MicrosoftDemangle.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287
  1. #pragma once
  2. #ifdef __GNUC__
  3. #pragma GCC diagnostic push
  4. #pragma GCC diagnostic ignored "-Wunused-parameter"
  5. #endif
  6. //===------------------------- MicrosoftDemangle.h --------------*- C++ -*-===//
  7. //
  8. // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
  9. // See https://llvm.org/LICENSE.txt for license information.
  10. // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
  11. //
  12. //===----------------------------------------------------------------------===//
  13. #ifndef LLVM_DEMANGLE_MICROSOFTDEMANGLE_H
  14. #define LLVM_DEMANGLE_MICROSOFTDEMANGLE_H
  15. #include "llvm/Demangle/MicrosoftDemangleNodes.h"
  16. #include "llvm/Demangle/StringView.h"
  17. #include <utility>
  18. namespace llvm {
  19. namespace ms_demangle {
  20. // This memory allocator is extremely fast, but it doesn't call dtors
  21. // for allocated objects. That means you can't use STL containers
  22. // (such as std::vector) with this allocator. But it pays off --
  23. // the demangler is 3x faster with this allocator compared to one with
  24. // STL containers.
  25. constexpr size_t AllocUnit = 4096;
  26. class ArenaAllocator {
  27. struct AllocatorNode {
  28. uint8_t *Buf = nullptr;
  29. size_t Used = 0;
  30. size_t Capacity = 0;
  31. AllocatorNode *Next = nullptr;
  32. };
  33. void addNode(size_t Capacity) {
  34. AllocatorNode *NewHead = new AllocatorNode;
  35. NewHead->Buf = new uint8_t[Capacity];
  36. NewHead->Next = Head;
  37. NewHead->Capacity = Capacity;
  38. Head = NewHead;
  39. NewHead->Used = 0;
  40. }
  41. public:
  42. ArenaAllocator() { addNode(AllocUnit); }
  43. ~ArenaAllocator() {
  44. while (Head) {
  45. assert(Head->Buf);
  46. delete[] Head->Buf;
  47. AllocatorNode *Next = Head->Next;
  48. delete Head;
  49. Head = Next;
  50. }
  51. }
  52. char *allocUnalignedBuffer(size_t Size) {
  53. assert(Head && Head->Buf);
  54. uint8_t *P = Head->Buf + Head->Used;
  55. Head->Used += Size;
  56. if (Head->Used <= Head->Capacity)
  57. return reinterpret_cast<char *>(P);
  58. addNode(std::max(AllocUnit, Size));
  59. Head->Used = Size;
  60. return reinterpret_cast<char *>(Head->Buf);
  61. }
  62. template <typename T, typename... Args> T *allocArray(size_t Count) {
  63. size_t Size = Count * sizeof(T);
  64. assert(Head && Head->Buf);
  65. size_t P = (size_t)Head->Buf + Head->Used;
  66. uintptr_t AlignedP =
  67. (((size_t)P + alignof(T) - 1) & ~(size_t)(alignof(T) - 1));
  68. uint8_t *PP = (uint8_t *)AlignedP;
  69. size_t Adjustment = AlignedP - P;
  70. Head->Used += Size + Adjustment;
  71. if (Head->Used <= Head->Capacity)
  72. return new (PP) T[Count]();
  73. addNode(std::max(AllocUnit, Size));
  74. Head->Used = Size;
  75. return new (Head->Buf) T[Count]();
  76. }
  77. template <typename T, typename... Args> T *alloc(Args &&... ConstructorArgs) {
  78. constexpr size_t Size = sizeof(T);
  79. assert(Head && Head->Buf);
  80. size_t P = (size_t)Head->Buf + Head->Used;
  81. uintptr_t AlignedP =
  82. (((size_t)P + alignof(T) - 1) & ~(size_t)(alignof(T) - 1));
  83. uint8_t *PP = (uint8_t *)AlignedP;
  84. size_t Adjustment = AlignedP - P;
  85. Head->Used += Size + Adjustment;
  86. if (Head->Used <= Head->Capacity)
  87. return new (PP) T(std::forward<Args>(ConstructorArgs)...);
  88. static_assert(Size < AllocUnit);
  89. addNode(AllocUnit);
  90. Head->Used = Size;
  91. return new (Head->Buf) T(std::forward<Args>(ConstructorArgs)...);
  92. }
  93. private:
  94. AllocatorNode *Head = nullptr;
  95. };
  96. struct BackrefContext {
  97. static constexpr size_t Max = 10;
  98. TypeNode *FunctionParams[Max];
  99. size_t FunctionParamCount = 0;
  100. // The first 10 BackReferences in a mangled name can be back-referenced by
  101. // special name @[0-9]. This is a storage for the first 10 BackReferences.
  102. NamedIdentifierNode *Names[Max];
  103. size_t NamesCount = 0;
  104. };
  105. enum class QualifierMangleMode { Drop, Mangle, Result };
  106. enum NameBackrefBehavior : uint8_t {
  107. NBB_None = 0, // don't save any names as backrefs.
  108. NBB_Template = 1 << 0, // save template instanations.
  109. NBB_Simple = 1 << 1, // save simple names.
  110. };
  111. enum class FunctionIdentifierCodeGroup { Basic, Under, DoubleUnder };
  112. // Demangler class takes the main role in demangling symbols.
  113. // It has a set of functions to parse mangled symbols into Type instances.
  114. // It also has a set of functions to convert Type instances to strings.
  115. class Demangler {
  116. public:
  117. Demangler() = default;
  118. virtual ~Demangler() = default;
  119. // You are supposed to call parse() first and then check if error is true. If
  120. // it is false, call output() to write the formatted name to the given stream.
  121. SymbolNode *parse(StringView &MangledName);
  122. TagTypeNode *parseTagUniqueName(StringView &MangledName);
  123. // True if an error occurred.
  124. bool Error = false;
  125. void dumpBackReferences();
  126. private:
  127. SymbolNode *demangleEncodedSymbol(StringView &MangledName,
  128. QualifiedNameNode *QN);
  129. SymbolNode *demangleDeclarator(StringView &MangledName);
  130. SymbolNode *demangleMD5Name(StringView &MangledName);
  131. SymbolNode *demangleTypeinfoName(StringView &MangledName);
  132. VariableSymbolNode *demangleVariableEncoding(StringView &MangledName,
  133. StorageClass SC);
  134. FunctionSymbolNode *demangleFunctionEncoding(StringView &MangledName);
  135. Qualifiers demanglePointerExtQualifiers(StringView &MangledName);
  136. // Parser functions. This is a recursive-descent parser.
  137. TypeNode *demangleType(StringView &MangledName, QualifierMangleMode QMM);
  138. PrimitiveTypeNode *demanglePrimitiveType(StringView &MangledName);
  139. CustomTypeNode *demangleCustomType(StringView &MangledName);
  140. TagTypeNode *demangleClassType(StringView &MangledName);
  141. PointerTypeNode *demanglePointerType(StringView &MangledName);
  142. PointerTypeNode *demangleMemberPointerType(StringView &MangledName);
  143. FunctionSignatureNode *demangleFunctionType(StringView &MangledName,
  144. bool HasThisQuals);
  145. ArrayTypeNode *demangleArrayType(StringView &MangledName);
  146. NodeArrayNode *demangleFunctionParameterList(StringView &MangledName,
  147. bool &IsVariadic);
  148. NodeArrayNode *demangleTemplateParameterList(StringView &MangledName);
  149. std::pair<uint64_t, bool> demangleNumber(StringView &MangledName);
  150. uint64_t demangleUnsigned(StringView &MangledName);
  151. int64_t demangleSigned(StringView &MangledName);
  152. void memorizeString(StringView s);
  153. void memorizeIdentifier(IdentifierNode *Identifier);
  154. /// Allocate a copy of \p Borrowed into memory that we own.
  155. StringView copyString(StringView Borrowed);
  156. QualifiedNameNode *demangleFullyQualifiedTypeName(StringView &MangledName);
  157. QualifiedNameNode *demangleFullyQualifiedSymbolName(StringView &MangledName);
  158. IdentifierNode *demangleUnqualifiedTypeName(StringView &MangledName,
  159. bool Memorize);
  160. IdentifierNode *demangleUnqualifiedSymbolName(StringView &MangledName,
  161. NameBackrefBehavior NBB);
  162. QualifiedNameNode *demangleNameScopeChain(StringView &MangledName,
  163. IdentifierNode *UnqualifiedName);
  164. IdentifierNode *demangleNameScopePiece(StringView &MangledName);
  165. NamedIdentifierNode *demangleBackRefName(StringView &MangledName);
  166. IdentifierNode *demangleTemplateInstantiationName(StringView &MangledName,
  167. NameBackrefBehavior NBB);
  168. IntrinsicFunctionKind
  169. translateIntrinsicFunctionCode(char CH, FunctionIdentifierCodeGroup Group);
  170. IdentifierNode *demangleFunctionIdentifierCode(StringView &MangledName);
  171. IdentifierNode *
  172. demangleFunctionIdentifierCode(StringView &MangledName,
  173. FunctionIdentifierCodeGroup Group);
  174. StructorIdentifierNode *demangleStructorIdentifier(StringView &MangledName,
  175. bool IsDestructor);
  176. ConversionOperatorIdentifierNode *
  177. demangleConversionOperatorIdentifier(StringView &MangledName);
  178. LiteralOperatorIdentifierNode *
  179. demangleLiteralOperatorIdentifier(StringView &MangledName);
  180. SymbolNode *demangleSpecialIntrinsic(StringView &MangledName);
  181. SpecialTableSymbolNode *
  182. demangleSpecialTableSymbolNode(StringView &MangledName,
  183. SpecialIntrinsicKind SIK);
  184. LocalStaticGuardVariableNode *
  185. demangleLocalStaticGuard(StringView &MangledName, bool IsThread);
  186. VariableSymbolNode *demangleUntypedVariable(ArenaAllocator &Arena,
  187. StringView &MangledName,
  188. StringView VariableName);
  189. VariableSymbolNode *
  190. demangleRttiBaseClassDescriptorNode(ArenaAllocator &Arena,
  191. StringView &MangledName);
  192. FunctionSymbolNode *demangleInitFiniStub(StringView &MangledName,
  193. bool IsDestructor);
  194. NamedIdentifierNode *demangleSimpleName(StringView &MangledName,
  195. bool Memorize);
  196. NamedIdentifierNode *demangleAnonymousNamespaceName(StringView &MangledName);
  197. NamedIdentifierNode *demangleLocallyScopedNamePiece(StringView &MangledName);
  198. EncodedStringLiteralNode *demangleStringLiteral(StringView &MangledName);
  199. FunctionSymbolNode *demangleVcallThunkNode(StringView &MangledName);
  200. StringView demangleSimpleString(StringView &MangledName, bool Memorize);
  201. FuncClass demangleFunctionClass(StringView &MangledName);
  202. CallingConv demangleCallingConvention(StringView &MangledName);
  203. StorageClass demangleVariableStorageClass(StringView &MangledName);
  204. bool demangleThrowSpecification(StringView &MangledName);
  205. wchar_t demangleWcharLiteral(StringView &MangledName);
  206. uint8_t demangleCharLiteral(StringView &MangledName);
  207. std::pair<Qualifiers, bool> demangleQualifiers(StringView &MangledName);
  208. // Memory allocator.
  209. ArenaAllocator Arena;
  210. // A single type uses one global back-ref table for all function params.
  211. // This means back-refs can even go "into" other types. Examples:
  212. //
  213. // // Second int* is a back-ref to first.
  214. // void foo(int *, int*);
  215. //
  216. // // Second int* is not a back-ref to first (first is not a function param).
  217. // int* foo(int*);
  218. //
  219. // // Second int* is a back-ref to first (ALL function types share the same
  220. // // back-ref map.
  221. // using F = void(*)(int*);
  222. // F G(int *);
  223. BackrefContext Backrefs;
  224. };
  225. } // namespace ms_demangle
  226. } // namespace llvm
  227. #endif // LLVM_DEMANGLE_MICROSOFTDEMANGLE_H
  228. #ifdef __GNUC__
  229. #pragma GCC diagnostic pop
  230. #endif