1 //===- ItaniumDemangle.cpp ------------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is dual licensed under the MIT and the University of Illinois Open
6 // Source Licenses. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/Demangle/Demangle.h"
11 #include "llvm/Support/Compiler.h"
13 // This file exports a single function: llvm::itanium_demangle.
14 // It also has no dependencies on the rest of llvm. It is implemented this way
15 // so that it can be easily reused in libcxxabi.
26 // snprintf is implemented in VS 2015
28 #define snprintf _snprintf_s
42 CV_volatile = (1 << 1),
43 CV_restrict = (1 << 2),
47 static const char *parse_type(const char *first, const char *last, C &db);
49 static const char *parse_encoding(const char *first, const char *last, C &db);
51 static const char *parse_name(const char *first, const char *last, C &db,
52 bool *ends_with_template_args = 0);
54 static const char *parse_expression(const char *first, const char *last, C &db);
56 static const char *parse_template_args(const char *first, const char *last,
59 static const char *parse_operator_name(const char *first, const char *last,
62 static const char *parse_unqualified_name(const char *first, const char *last,
65 static const char *parse_decltype(const char *first, const char *last, C &db);
67 // <number> ::= [n] <non-negative decimal integer>
69 static const char *parse_number(const char *first, const char *last) {
71 const char *t = first;
77 } else if ('1' <= *t && *t <= '9') {
79 while (first != last && std::isdigit(*first))
88 template <class Float> struct float_data;
90 template <> struct float_data<float> {
91 static const size_t mangled_size = 8;
92 static const size_t max_demangled_size = 24;
93 static const char *spec;
95 const char *float_data<float>::spec = "%af";
97 template <> struct float_data<double> {
98 static const size_t mangled_size = 16;
99 static const size_t max_demangled_size = 32;
100 static const char *spec;
103 const char *float_data<double>::spec = "%a";
105 template <> struct float_data<long double> {
106 #if defined(__mips__) && defined(__mips_n64) || defined(__aarch64__) || \
108 static const size_t mangled_size = 32;
109 #elif defined(__arm__) || defined(__mips__) || defined(__hexagon__)
110 static const size_t mangled_size = 16;
112 static const size_t mangled_size =
113 20; // May need to be adjusted to 16 or 24 on other platforms
115 static const size_t max_demangled_size = 40;
116 static const char *spec;
119 const char *float_data<long double>::spec = "%LaL";
122 template <class Float, class C>
123 static const char *parse_floating_number(const char *first, const char *last,
125 const size_t N = float_data<Float>::mangled_size;
126 if (static_cast<std::size_t>(last - first) > N) {
130 char buf[sizeof(Float)];
132 const char *t = first;
134 for (; t != last; ++t, ++e) {
137 unsigned d1 = isdigit(*t) ? static_cast<unsigned>(*t - '0')
138 : static_cast<unsigned>(*t - 'a' + 10);
140 unsigned d0 = isdigit(*t) ? static_cast<unsigned>(*t - '0')
141 : static_cast<unsigned>(*t - 'a' + 10);
142 *e = static_cast<char>((d1 << 4) + d0);
145 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
146 std::reverse(buf, e);
148 char num[float_data<Float>::max_demangled_size] = {0};
149 int n = snprintf(num, sizeof(num), float_data<Float>::spec, value);
150 if (static_cast<std::size_t>(n) >= sizeof(num))
152 db.names.push_back(std::string(num, static_cast<std::size_t>(n)));
159 // <source-name> ::= <positive length number> <identifier>
162 static const char *parse_source_name(const char *first, const char *last,
166 if (isdigit(c) && first + 1 != last) {
167 const char *t = first + 1;
168 size_t n = static_cast<size_t>(c - '0');
169 for (c = *t; isdigit(c); c = *t) {
170 n = n * 10 + static_cast<size_t>(c - '0');
174 if (static_cast<size_t>(last - t) >= n) {
176 if (r.substr(0, 10) == "_GLOBAL__N")
177 db.names.push_back("(anonymous namespace)");
179 db.names.push_back(std::move(r));
187 // <substitution> ::= S <seq-id> _
189 // <substitution> ::= Sa # ::std::allocator
190 // <substitution> ::= Sb # ::std::basic_string
191 // <substitution> ::= Ss # ::std::basic_string < char,
192 // ::std::char_traits<char>,
193 // ::std::allocator<char> >
194 // <substitution> ::= Si # ::std::basic_istream<char, std::char_traits<char> >
195 // <substitution> ::= So # ::std::basic_ostream<char, std::char_traits<char> >
196 // <substitution> ::= Sd # ::std::basic_iostream<char, std::char_traits<char> >
199 static const char *parse_substitution(const char *first, const char *last,
201 if (last - first >= 2) {
205 db.names.push_back("std::allocator");
209 db.names.push_back("std::basic_string");
213 db.names.push_back("std::string");
217 db.names.push_back("std::istream");
221 db.names.push_back("std::ostream");
225 db.names.push_back("std::iostream");
229 if (!db.subs.empty()) {
230 for (const auto &n : db.subs.front())
231 db.names.push_back(n);
236 if (std::isdigit(first[1]) || std::isupper(first[1])) {
238 const char *t = first + 1;
239 if (std::isdigit(*t))
240 sub = static_cast<size_t>(*t - '0');
242 sub = static_cast<size_t>(*t - 'A') + 10;
243 for (++t; t != last && (std::isdigit(*t) || std::isupper(*t)); ++t) {
245 if (std::isdigit(*t))
246 sub += static_cast<size_t>(*t - '0');
248 sub += static_cast<size_t>(*t - 'A') + 10;
250 if (t == last || *t != '_')
253 if (sub < db.subs.size()) {
254 for (const auto &n : db.subs[sub])
255 db.names.push_back(n);
266 // <builtin-type> ::= v # void
270 // ::= a # signed char
271 // ::= h # unsigned char
273 // ::= t # unsigned short
275 // ::= j # unsigned int
277 // ::= m # unsigned long
278 // ::= x # long long, __int64
279 // ::= y # unsigned long long, __int64
281 // ::= o # unsigned __int128
284 // ::= e # long double, __float80
285 // ::= g # __float128
287 // ::= Dd # IEEE 754r decimal floating point (64 bits)
288 // ::= De # IEEE 754r decimal floating point (128 bits)
289 // ::= Df # IEEE 754r decimal floating point (32 bits)
290 // ::= Dh # IEEE 754r half-precision floating point (16 bits)
293 // ::= Da # auto (in dependent new-expressions)
294 // ::= Dc # decltype(auto)
295 // ::= Dn # std::nullptr_t (i.e., decltype(nullptr))
296 // ::= u <source-name> # vendor extended type
299 static const char *parse_builtin_type(const char *first, const char *last,
304 db.names.push_back("void");
308 db.names.push_back("wchar_t");
312 db.names.push_back("bool");
316 db.names.push_back("char");
320 db.names.push_back("signed char");
324 db.names.push_back("unsigned char");
328 db.names.push_back("short");
332 db.names.push_back("unsigned short");
336 db.names.push_back("int");
340 db.names.push_back("unsigned int");
344 db.names.push_back("long");
348 db.names.push_back("unsigned long");
352 db.names.push_back("long long");
356 db.names.push_back("unsigned long long");
360 db.names.push_back("__int128");
364 db.names.push_back("unsigned __int128");
368 db.names.push_back("float");
372 db.names.push_back("double");
376 db.names.push_back("long double");
380 db.names.push_back("__float128");
384 db.names.push_back("...");
388 const char *t = parse_source_name(first + 1, last, db);
393 if (first + 1 != last) {
396 db.names.push_back("decimal64");
400 db.names.push_back("decimal128");
404 db.names.push_back("decimal32");
408 db.names.push_back("decimal16");
412 db.names.push_back("char32_t");
416 db.names.push_back("char16_t");
420 db.names.push_back("auto");
424 db.names.push_back("decltype(auto)");
428 db.names.push_back("std::nullptr_t");
439 // <CV-qualifiers> ::= [r] [V] [K]
441 static const char *parse_cv_qualifiers(const char *first, const char *last,
461 // <template-param> ::= T_ # first template parameter
462 // ::= T <parameter-2 non-negative number> _
465 static const char *parse_template_param(const char *first, const char *last,
467 if (last - first >= 2) {
469 if (first[1] == '_') {
470 if (db.template_param.empty())
472 if (!db.template_param.back().empty()) {
473 for (auto &t : db.template_param.back().front())
474 db.names.push_back(t);
477 db.names.push_back("T_");
479 db.fix_forward_references = true;
481 } else if (isdigit(first[1])) {
482 const char *t = first + 1;
483 size_t sub = static_cast<size_t>(*t - '0');
484 for (++t; t != last && isdigit(*t); ++t) {
486 sub += static_cast<size_t>(*t - '0');
488 if (t == last || *t != '_' || db.template_param.empty())
491 if (sub < db.template_param.back().size()) {
492 for (auto &temp : db.template_param.back()[sub])
493 db.names.push_back(temp);
496 db.names.push_back(std::string(first, t + 1));
498 db.fix_forward_references = true;
506 // cc <type> <expression> # const_cast<type>
510 static const char *parse_const_cast_expr(const char *first, const char *last,
512 if (last - first >= 3 && first[0] == 'c' && first[1] == 'c') {
513 const char *t = parse_type(first + 2, last, db);
514 if (t != first + 2) {
515 const char *t1 = parse_expression(t, last, db);
517 if (db.names.size() < 2)
519 auto expr = db.names.back().move_full();
521 if (db.names.empty())
524 "const_cast<" + db.names.back().move_full() + ">(" + expr + ")";
532 // dc <type> <expression> # dynamic_cast<type>
536 static const char *parse_dynamic_cast_expr(const char *first, const char *last,
538 if (last - first >= 3 && first[0] == 'd' && first[1] == 'c') {
539 const char *t = parse_type(first + 2, last, db);
540 if (t != first + 2) {
541 const char *t1 = parse_expression(t, last, db);
543 if (db.names.size() < 2)
545 auto expr = db.names.back().move_full();
547 if (db.names.empty())
550 "dynamic_cast<" + db.names.back().move_full() + ">(" + expr + ")";
558 // rc <type> <expression> # reinterpret_cast<type>
562 static const char *parse_reinterpret_cast_expr(const char *first,
563 const char *last, C &db) {
564 if (last - first >= 3 && first[0] == 'r' && first[1] == 'c') {
565 const char *t = parse_type(first + 2, last, db);
566 if (t != first + 2) {
567 const char *t1 = parse_expression(t, last, db);
569 if (db.names.size() < 2)
571 auto expr = db.names.back().move_full();
573 if (db.names.empty())
575 db.names.back() = "reinterpret_cast<" + db.names.back().move_full() +
584 // sc <type> <expression> # static_cast<type>
588 static const char *parse_static_cast_expr(const char *first, const char *last,
590 if (last - first >= 3 && first[0] == 's' && first[1] == 'c') {
591 const char *t = parse_type(first + 2, last, db);
592 if (t != first + 2) {
593 const char *t1 = parse_expression(t, last, db);
595 if (db.names.size() < 2)
597 auto expr = db.names.back().move_full();
600 "static_cast<" + db.names.back().move_full() + ">(" + expr + ")";
608 // sp <expression> # pack expansion
611 static const char *parse_pack_expansion(const char *first, const char *last,
613 if (last - first >= 3 && first[0] == 's' && first[1] == 'p') {
614 const char *t = parse_expression(first + 2, last, db);
621 // st <type> # sizeof (a type)
624 static const char *parse_sizeof_type_expr(const char *first, const char *last,
626 if (last - first >= 3 && first[0] == 's' && first[1] == 't') {
627 const char *t = parse_type(first + 2, last, db);
628 if (t != first + 2) {
629 if (db.names.empty())
631 db.names.back() = "sizeof (" + db.names.back().move_full() + ")";
638 // sz <expr> # sizeof (a expression)
641 static const char *parse_sizeof_expr_expr(const char *first, const char *last,
643 if (last - first >= 3 && first[0] == 's' && first[1] == 'z') {
644 const char *t = parse_expression(first + 2, last, db);
645 if (t != first + 2) {
646 if (db.names.empty())
648 db.names.back() = "sizeof (" + db.names.back().move_full() + ")";
655 // sZ <template-param> # size of a parameter
659 static const char *parse_sizeof_param_pack_expr(const char *first,
660 const char *last, C &db) {
661 if (last - first >= 3 && first[0] == 's' && first[1] == 'Z' &&
663 size_t k0 = db.names.size();
664 const char *t = parse_template_param(first + 2, last, db);
665 size_t k1 = db.names.size();
666 if (t != first + 2) {
667 std::string tmp("sizeof...(");
670 tmp += db.names[k].move_full();
671 for (++k; k != k1; ++k)
672 tmp += ", " + db.names[k].move_full();
675 for (; k1 != k0; --k1)
677 db.names.push_back(std::move(tmp));
684 // <function-param> ::= fp <top-level CV-qualifiers> _ # L == 0, first parameter
685 // ::= fp <top-level CV-qualifiers> <parameter-2 non-negative
686 // number> _ # L == 0, second and later parameters
687 // ::= fL <L-1 non-negative number> p <top-level CV-qualifiers>
688 // _ # L > 0, first parameter
689 // ::= fL <L-1 non-negative number> p <top-level CV-qualifiers>
690 // <parameter-2 non-negative number> _ # L > 0, second and
694 static const char *parse_function_param(const char *first, const char *last,
696 if (last - first >= 3 && *first == 'f') {
697 if (first[1] == 'p') {
699 const char *t = parse_cv_qualifiers(first + 2, last, cv);
700 const char *t1 = parse_number(t, last);
701 if (t1 != last && *t1 == '_') {
702 db.names.push_back("fp" + std::string(t, t1));
705 } else if (first[1] == 'L') {
707 const char *t0 = parse_number(first + 2, last);
708 if (t0 != last && *t0 == 'p') {
710 const char *t = parse_cv_qualifiers(t0, last, cv);
711 const char *t1 = parse_number(t, last);
712 if (t1 != last && *t1 == '_') {
713 db.names.push_back("fp" + std::string(t, t1));
722 // sZ <function-param> # size of a function
726 static const char *parse_sizeof_function_param_pack_expr(const char *first,
729 if (last - first >= 3 && first[0] == 's' && first[1] == 'Z' &&
731 const char *t = parse_function_param(first + 2, last, db);
732 if (t != first + 2) {
733 if (db.names.empty())
735 db.names.back() = "sizeof...(" + db.names.back().move_full() + ")";
742 // te <expression> # typeid (expression)
743 // ti <type> # typeid (type)
746 static const char *parse_typeid_expr(const char *first, const char *last,
748 if (last - first >= 3 && first[0] == 't' &&
749 (first[1] == 'e' || first[1] == 'i')) {
752 t = parse_expression(first + 2, last, db);
754 t = parse_type(first + 2, last, db);
755 if (t != first + 2) {
756 if (db.names.empty())
758 db.names.back() = "typeid(" + db.names.back().move_full() + ")";
765 // tw <expression> # throw expression
768 static const char *parse_throw_expr(const char *first, const char *last,
770 if (last - first >= 3 && first[0] == 't' && first[1] == 'w') {
771 const char *t = parse_expression(first + 2, last, db);
772 if (t != first + 2) {
773 if (db.names.empty())
775 db.names.back() = "throw " + db.names.back().move_full();
782 // ds <expression> <expression> # expr.*expr
785 static const char *parse_dot_star_expr(const char *first, const char *last,
787 if (last - first >= 3 && first[0] == 'd' && first[1] == 's') {
788 const char *t = parse_expression(first + 2, last, db);
789 if (t != first + 2) {
790 const char *t1 = parse_expression(t, last, db);
792 if (db.names.size() < 2)
794 auto expr = db.names.back().move_full();
796 db.names.back().first += ".*" + expr;
804 // <simple-id> ::= <source-name> [ <template-args> ]
807 static const char *parse_simple_id(const char *first, const char *last, C &db) {
809 const char *t = parse_source_name(first, last, db);
811 const char *t1 = parse_template_args(t, last, db);
813 if (db.names.size() < 2)
815 auto args = db.names.back().move_full();
817 db.names.back().first += std::move(args);
826 // <unresolved-type> ::= <template-param>
828 // ::= <substitution>
831 static const char *parse_unresolved_type(const char *first, const char *last,
834 const char *t = first;
837 size_t k0 = db.names.size();
838 t = parse_template_param(first, last, db);
839 size_t k1 = db.names.size();
840 if (t != first && k1 == k0 + 1) {
841 db.subs.push_back(typename C::sub_type(1, db.names.back()));
844 for (; k1 != k0; --k1)
850 t = parse_decltype(first, last, db);
852 if (db.names.empty())
854 db.subs.push_back(typename C::sub_type(1, db.names.back()));
859 t = parse_substitution(first, last, db);
863 if (last - first > 2 && first[1] == 't') {
864 t = parse_unqualified_name(first + 2, last, db);
865 if (t != first + 2) {
866 if (db.names.empty())
868 db.names.back().first.insert(0, "std::");
869 db.subs.push_back(typename C::sub_type(1, db.names.back()));
880 // <destructor-name> ::= <unresolved-type> # e.g.,
881 // ~T or ~decltype(f())
882 // ::= <simple-id> # e.g.,
886 static const char *parse_destructor_name(const char *first, const char *last,
889 const char *t = parse_unresolved_type(first, last, db);
891 t = parse_simple_id(first, last, db);
893 if (db.names.empty())
895 db.names.back().first.insert(0, "~");
902 // <base-unresolved-name> ::= <simple-id> #
904 // extension ::= <operator-name> #
905 // unresolved operator-function-id
906 // extension ::= <operator-name> <template-args> #
907 // unresolved operator template-id
908 // ::= on <operator-name> #
909 // unresolved operator-function-id
910 // ::= on <operator-name> <template-args> #
911 // unresolved operator template-id
912 // ::= dn <destructor-name> #
913 // destructor or pseudo-destructor;
920 static const char *parse_base_unresolved_name(const char *first,
921 const char *last, C &db) {
922 if (last - first >= 2) {
923 if ((first[0] == 'o' || first[0] == 'd') && first[1] == 'n') {
924 if (first[0] == 'o') {
925 const char *t = parse_operator_name(first + 2, last, db);
926 if (t != first + 2) {
927 first = parse_template_args(t, last, db);
929 if (db.names.size() < 2)
931 auto args = db.names.back().move_full();
933 db.names.back().first += std::move(args);
937 const char *t = parse_destructor_name(first + 2, last, db);
942 const char *t = parse_simple_id(first, last, db);
944 t = parse_operator_name(first, last, db);
946 first = parse_template_args(t, last, db);
948 if (db.names.size() < 2)
950 auto args = db.names.back().move_full();
952 db.names.back().first += std::move(args);
962 // <unresolved-qualifier-level> ::= <simple-id>
965 static const char *parse_unresolved_qualifier_level(const char *first,
966 const char *last, C &db) {
967 return parse_simple_id(first, last, db);
971 // extension ::= srN <unresolved-type> [<template-args>]
972 // <unresolved-qualifier-level>* E <base-unresolved-name>
973 // ::= [gs] <base-unresolved-name> # x or
975 // ::= [gs] sr <unresolved-qualifier-level>+ E
976 // <base-unresolved-name>
984 // ::= sr <unresolved-type> <base-unresolved-name> # T::x
986 // extension ::= sr <unresolved-type> <template-args>
987 // <base-unresolved-name>
990 // /decltype(p)::N::x
991 // (ignored) ::= srN <unresolved-type> <unresolved-qualifier-level>+ E
992 // <base-unresolved-name>
995 static const char *parse_unresolved_name(const char *first, const char *last,
997 if (last - first > 2) {
998 const char *t = first;
1000 if (t[0] == 'g' && t[1] == 's') {
1004 const char *t2 = parse_base_unresolved_name(t, last, db);
1007 if (db.names.empty())
1009 db.names.back().first.insert(0, "::");
1012 } else if (last - t > 2 && t[0] == 's' && t[1] == 'r') {
1015 const char *t1 = parse_unresolved_type(t, last, db);
1016 if (t1 == t || t1 == last)
1019 t1 = parse_template_args(t, last, db);
1021 if (db.names.size() < 2)
1023 auto args = db.names.back().move_full();
1024 db.names.pop_back();
1025 db.names.back().first += std::move(args);
1028 db.names.pop_back();
1033 t1 = parse_unresolved_qualifier_level(t, last, db);
1034 if (t1 == t || t1 == last || db.names.size() < 2)
1036 auto s = db.names.back().move_full();
1037 db.names.pop_back();
1038 db.names.back().first += "::" + std::move(s);
1042 t1 = parse_base_unresolved_name(t, last, db);
1044 if (!db.names.empty())
1045 db.names.pop_back();
1048 if (db.names.size() < 2)
1050 auto s = db.names.back().move_full();
1051 db.names.pop_back();
1052 db.names.back().first += "::" + std::move(s);
1056 const char *t1 = parse_unresolved_type(t, last, db);
1059 t1 = parse_template_args(t, last, db);
1061 if (db.names.size() < 2)
1063 auto args = db.names.back().move_full();
1064 db.names.pop_back();
1065 db.names.back().first += std::move(args);
1068 t1 = parse_base_unresolved_name(t, last, db);
1070 if (!db.names.empty())
1071 db.names.pop_back();
1074 if (db.names.size() < 2)
1076 auto s = db.names.back().move_full();
1077 db.names.pop_back();
1078 db.names.back().first += "::" + std::move(s);
1081 t1 = parse_unresolved_qualifier_level(t, last, db);
1082 if (t1 == t || t1 == last)
1086 if (db.names.empty())
1088 db.names.back().first.insert(0, "::");
1091 t1 = parse_unresolved_qualifier_level(t, last, db);
1092 if (t1 == t || t1 == last || db.names.size() < 2)
1094 auto s = db.names.back().move_full();
1095 db.names.pop_back();
1096 db.names.back().first += "::" + std::move(s);
1100 t1 = parse_base_unresolved_name(t, last, db);
1102 if (!db.names.empty())
1103 db.names.pop_back();
1106 if (db.names.size() < 2)
1108 auto s = db.names.back().move_full();
1109 db.names.pop_back();
1110 db.names.back().first += "::" + std::move(s);
1119 // dt <expression> <unresolved-name> # expr.name
1122 static const char *parse_dot_expr(const char *first, const char *last, C &db) {
1123 if (last - first >= 3 && first[0] == 'd' && first[1] == 't') {
1124 const char *t = parse_expression(first + 2, last, db);
1125 if (t != first + 2) {
1126 const char *t1 = parse_unresolved_name(t, last, db);
1128 if (db.names.size() < 2)
1130 auto name = db.names.back().move_full();
1131 db.names.pop_back();
1132 if (db.names.empty())
1134 db.names.back().first += "." + name;
1142 // cl <expression>+ E # call
1145 static const char *parse_call_expr(const char *first, const char *last, C &db) {
1146 if (last - first >= 4 && first[0] == 'c' && first[1] == 'l') {
1147 const char *t = parse_expression(first + 2, last, db);
1148 if (t != first + 2) {
1151 if (db.names.empty())
1153 db.names.back().first += db.names.back().second;
1154 db.names.back().second = std::string();
1155 db.names.back().first.append("(");
1156 bool first_expr = true;
1158 const char *t1 = parse_expression(t, last, db);
1159 if (t1 == t || t1 == last)
1161 if (db.names.empty())
1163 auto tmp = db.names.back().move_full();
1164 db.names.pop_back();
1166 if (db.names.empty())
1169 db.names.back().first.append(", ");
1172 db.names.back().first.append(tmp);
1177 if (db.names.empty())
1179 db.names.back().first.append(")");
1186 // [gs] nw <expression>* _ <type> E # new (expr-list) type
1187 // [gs] nw <expression>* _ <type> <initializer> # new (expr-list) type
1189 // [gs] na <expression>* _ <type> E # new[] (expr-list) type
1190 // [gs] na <expression>* _ <type> <initializer> # new[] (expr-list) type
1192 // <initializer> ::= pi <expression>* E # parenthesized
1196 static const char *parse_new_expr(const char *first, const char *last, C &db) {
1197 if (last - first >= 4) {
1198 const char *t = first;
1199 bool parsed_gs = false;
1200 if (t[0] == 'g' && t[1] == 's') {
1204 if (t[0] == 'n' && (t[1] == 'w' || t[1] == 'a')) {
1205 bool is_array = t[1] == 'a';
1209 bool has_expr_list = false;
1210 bool first_expr = true;
1212 const char *t1 = parse_expression(t, last, db);
1213 if (t1 == t || t1 == last)
1215 has_expr_list = true;
1217 if (db.names.empty())
1219 auto tmp = db.names.back().move_full();
1220 db.names.pop_back();
1222 if (db.names.empty())
1224 db.names.back().first.append(", ");
1225 db.names.back().first.append(tmp);
1232 const char *t1 = parse_type(t, last, db);
1233 if (t1 == t || t1 == last)
1236 bool has_init = false;
1237 if (last - t >= 3 && t[0] == 'p' && t[1] == 'i') {
1242 t1 = parse_expression(t, last, db);
1243 if (t1 == t || t1 == last)
1246 if (db.names.empty())
1248 auto tmp = db.names.back().move_full();
1249 db.names.pop_back();
1251 if (db.names.empty())
1253 db.names.back().first.append(", ");
1254 db.names.back().first.append(tmp);
1263 std::string init_list;
1265 if (db.names.empty())
1267 init_list = db.names.back().move_full();
1268 db.names.pop_back();
1270 if (db.names.empty())
1272 auto type = db.names.back().move_full();
1273 db.names.pop_back();
1274 std::string expr_list;
1275 if (has_expr_list) {
1276 if (db.names.empty())
1278 expr_list = db.names.back().move_full();
1279 db.names.pop_back();
1289 r += "(" + expr_list + ") ";
1292 r += " (" + init_list + ")";
1293 db.names.push_back(std::move(r));
1300 // cv <type> <expression> # conversion with one
1302 // cv <type> _ <expression>* E # conversion with a
1303 // different number of arguments
1306 static const char *parse_conversion_expr(const char *first, const char *last,
1308 if (last - first >= 3 && first[0] == 'c' && first[1] == 'v') {
1309 bool try_to_parse_template_args = db.try_to_parse_template_args;
1310 db.try_to_parse_template_args = false;
1311 const char *t = parse_type(first + 2, last, db);
1312 db.try_to_parse_template_args = try_to_parse_template_args;
1313 if (t != first + 2 && t != last) {
1315 const char *t1 = parse_expression(t, last, db);
1324 db.names.emplace_back();
1326 bool first_expr = true;
1328 const char *t1 = parse_expression(t, last, db);
1329 if (t1 == t || t1 == last)
1332 if (db.names.empty())
1334 auto tmp = db.names.back().move_full();
1335 db.names.pop_back();
1337 if (db.names.empty())
1339 db.names.back().first.append(", ");
1340 db.names.back().first.append(tmp);
1349 if (db.names.size() < 2)
1351 auto tmp = db.names.back().move_full();
1352 db.names.pop_back();
1353 db.names.back() = "(" + db.names.back().move_full() + ")(" + tmp + ")";
1360 // pt <expression> <expression> # expr->name
1363 static const char *parse_arrow_expr(const char *first, const char *last,
1365 if (last - first >= 3 && first[0] == 'p' && first[1] == 't') {
1366 const char *t = parse_expression(first + 2, last, db);
1367 if (t != first + 2) {
1368 const char *t1 = parse_expression(t, last, db);
1370 if (db.names.size() < 2)
1372 auto tmp = db.names.back().move_full();
1373 db.names.pop_back();
1374 db.names.back().first += "->";
1375 db.names.back().first += tmp;
1383 // <ref-qualifier> ::= R # & ref-qualifier
1384 // <ref-qualifier> ::= O # && ref-qualifier
1386 // <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E
1389 static const char *parse_function_type(const char *first, const char *last,
1391 if (first != last && *first == 'F') {
1392 const char *t = first + 1;
1399 const char *t1 = parse_type(t, last, db);
1402 std::string sig("(");
1406 if (!db.names.empty())
1407 db.names.pop_back();
1418 if (*t == 'R' && t + 1 != last && t[1] == 'E') {
1423 if (*t == 'O' && t + 1 != last && t[1] == 'E') {
1428 size_t k0 = db.names.size();
1429 t1 = parse_type(t, last, db);
1430 size_t k1 = db.names.size();
1431 if (t1 == t || t1 == last)
1433 for (size_t k = k0; k < k1; ++k) {
1436 sig += db.names[k].move_full();
1438 for (size_t k = k0; k < k1; ++k)
1439 db.names.pop_back();
1451 if (db.names.empty())
1453 db.names.back().first += " ";
1454 db.names.back().second.insert(0, sig);
1462 // <pointer-to-member-type> ::= M <class type> <member type>
1465 static const char *parse_pointer_to_member_type(const char *first,
1466 const char *last, C &db) {
1467 if (first != last && *first == 'M') {
1468 const char *t = parse_type(first + 1, last, db);
1469 if (t != first + 1) {
1470 const char *t2 = parse_type(t, last, db);
1472 if (db.names.size() < 2)
1474 auto func = std::move(db.names.back());
1475 db.names.pop_back();
1476 auto class_type = std::move(db.names.back());
1477 if (!func.second.empty() && func.second.front() == '(') {
1478 db.names.back().first =
1479 std::move(func.first) + "(" + class_type.move_full() + "::*";
1480 db.names.back().second = ")" + std::move(func.second);
1482 db.names.back().first =
1483 std::move(func.first) + " " + class_type.move_full() + "::*";
1484 db.names.back().second = std::move(func.second);
1493 // <array-type> ::= A <positive dimension number> _ <element type>
1494 // ::= A [<dimension expression>] _ <element type>
1497 static const char *parse_array_type(const char *first, const char *last,
1499 if (first != last && *first == 'A' && first + 1 != last) {
1500 if (first[1] == '_') {
1501 const char *t = parse_type(first + 2, last, db);
1502 if (t != first + 2) {
1503 if (db.names.empty())
1505 if (db.names.back().second.substr(0, 2) == " [")
1506 db.names.back().second.erase(0, 1);
1507 db.names.back().second.insert(0, " []");
1510 } else if ('1' <= first[1] && first[1] <= '9') {
1511 const char *t = parse_number(first + 1, last);
1512 if (t != last && *t == '_') {
1513 const char *t2 = parse_type(t + 1, last, db);
1515 if (db.names.empty())
1517 if (db.names.back().second.substr(0, 2) == " [")
1518 db.names.back().second.erase(0, 1);
1519 db.names.back().second.insert(0,
1520 " [" + std::string(first + 1, t) + "]");
1525 const char *t = parse_expression(first + 1, last, db);
1526 if (t != first + 1 && t != last && *t == '_') {
1527 const char *t2 = parse_type(++t, last, db);
1529 if (db.names.size() < 2)
1531 auto type = std::move(db.names.back());
1532 db.names.pop_back();
1533 auto expr = std::move(db.names.back());
1534 db.names.back().first = std::move(type.first);
1535 if (type.second.substr(0, 2) == " [")
1536 type.second.erase(0, 1);
1537 db.names.back().second =
1538 " [" + expr.move_full() + "]" + std::move(type.second);
1547 // <decltype> ::= Dt <expression> E # decltype of an id-expression or class
1548 // member access (C++0x)
1549 // ::= DT <expression> E # decltype of an expression (C++0x)
1552 static const char *parse_decltype(const char *first, const char *last, C &db) {
1553 if (last - first >= 4 && first[0] == 'D') {
1557 const char *t = parse_expression(first + 2, last, db);
1558 if (t != first + 2 && t != last && *t == 'E') {
1559 if (db.names.empty())
1561 db.names.back() = "decltype(" + db.names.back().move_full() + ")";
1571 // <vector-type> ::= Dv <positive dimension number> _
1572 // <extended element type>
1573 // ::= Dv [<dimension expression>] _ <element type>
1574 // <extended element type> ::= <element type>
1575 // ::= p # AltiVec vector pixel
1578 static const char *parse_vector_type(const char *first, const char *last,
1580 if (last - first > 3 && first[0] == 'D' && first[1] == 'v') {
1581 if ('1' <= first[2] && first[2] <= '9') {
1582 const char *t = parse_number(first + 2, last);
1583 if (t == last || *t != '_')
1585 const char *num = first + 2;
1586 size_t sz = static_cast<size_t>(t - num);
1589 const char *t1 = parse_type(t, last, db);
1591 if (db.names.empty())
1593 db.names.back().first += " vector[" + std::string(num, sz) + "]";
1598 db.names.push_back("pixel vector[" + std::string(num, sz) + "]");
1604 const char *t1 = first + 2;
1606 const char *t = parse_expression(t1, last, db);
1608 if (db.names.empty())
1610 num = db.names.back().move_full();
1611 db.names.pop_back();
1615 if (t1 != last && *t1 == '_' && ++t1 != last) {
1616 const char *t = parse_type(t1, last, db);
1618 if (db.names.empty())
1620 db.names.back().first += " vector[" + num + "]";
1629 // <type> ::= <builtin-type>
1630 // ::= <function-type>
1631 // ::= <class-enum-type>
1633 // ::= <pointer-to-member-type>
1634 // ::= <template-param>
1635 // ::= <template-template-param> <template-args>
1637 // ::= <substitution>
1638 // ::= <CV-qualifiers> <type>
1639 // ::= P <type> # pointer-to
1640 // ::= R <type> # reference-to
1641 // ::= O <type> # rvalue reference-to (C++0x)
1642 // ::= C <type> # complex pair (C 2000)
1643 // ::= G <type> # imaginary (C 2000)
1644 // ::= Dp <type> # pack expansion (C++0x)
1645 // ::= U <source-name> <type> # vendor extended type qualifier
1646 // extension := U <objc-name> <objc-type> # objc-type<identifier>
1647 // extension := <vector-type> # <vector-type> starts with Dv
1649 // <objc-name> ::= <k0 number> objcproto <k1 number> <identifier> # k0 = 9 +
1650 // <number of digits in k1> + k1
1651 // <objc-type> := <source-name> # PU<11+>objcproto 11objc_object<source-name>
1652 // 11objc_object -> id<source-name>
1655 static const char *parse_type(const char *first, const char *last, C &db) {
1656 if (first != last) {
1662 const char *t = parse_cv_qualifiers(first, last, cv);
1664 bool is_function = *t == 'F';
1665 size_t k0 = db.names.size();
1666 const char *t1 = parse_type(t, last, db);
1667 size_t k1 = db.names.size();
1671 db.subs.emplace_back();
1672 for (size_t k = k0; k < k1; ++k) {
1674 auto &name = db.names[k].second;
1675 size_t p = name.size();
1677 if (name[p - 2] == '&' && name[p - 1] == '&')
1679 else if (name.back() == '&')
1682 if (cv & CV_const) {
1683 name.insert(p, " const");
1686 if (cv & CV_volatile) {
1687 name.insert(p, " volatile");
1690 if (cv & CV_restrict)
1691 name.insert(p, " restrict");
1694 db.names[k].first.append(" const");
1695 if (cv & CV_volatile)
1696 db.names[k].first.append(" volatile");
1697 if (cv & CV_restrict)
1698 db.names[k].first.append(" restrict");
1700 db.subs.back().push_back(db.names[k]);
1707 const char *t = parse_builtin_type(first, last, db);
1713 t = parse_array_type(first, last, db);
1715 if (db.names.empty())
1718 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1722 t = parse_type(first + 1, last, db);
1723 if (t != first + 1) {
1724 if (db.names.empty())
1726 db.names.back().first.append(" complex");
1728 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1732 t = parse_function_type(first, last, db);
1734 if (db.names.empty())
1737 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1741 t = parse_type(first + 1, last, db);
1742 if (t != first + 1) {
1743 if (db.names.empty())
1745 db.names.back().first.append(" imaginary");
1747 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1751 t = parse_pointer_to_member_type(first, last, db);
1753 if (db.names.empty())
1756 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1760 size_t k0 = db.names.size();
1761 t = parse_type(first + 1, last, db);
1762 size_t k1 = db.names.size();
1763 if (t != first + 1) {
1764 db.subs.emplace_back();
1765 for (size_t k = k0; k < k1; ++k) {
1766 if (db.names[k].second.substr(0, 2) == " [") {
1767 db.names[k].first += " (";
1768 db.names[k].second.insert(0, ")");
1769 } else if (!db.names[k].second.empty() &&
1770 db.names[k].second.front() == '(') {
1771 db.names[k].first += "(";
1772 db.names[k].second.insert(0, ")");
1774 db.names[k].first.append("&&");
1775 db.subs.back().push_back(db.names[k]);
1782 size_t k0 = db.names.size();
1783 t = parse_type(first + 1, last, db);
1784 size_t k1 = db.names.size();
1785 if (t != first + 1) {
1786 db.subs.emplace_back();
1787 for (size_t k = k0; k < k1; ++k) {
1788 if (db.names[k].second.substr(0, 2) == " [") {
1789 db.names[k].first += " (";
1790 db.names[k].second.insert(0, ")");
1791 } else if (!db.names[k].second.empty() &&
1792 db.names[k].second.front() == '(') {
1793 db.names[k].first += "(";
1794 db.names[k].second.insert(0, ")");
1796 if (first[1] != 'U' ||
1797 db.names[k].first.substr(0, 12) != "objc_object<") {
1798 db.names[k].first.append("*");
1800 db.names[k].first.replace(0, 11, "id");
1802 db.subs.back().push_back(db.names[k]);
1809 size_t k0 = db.names.size();
1810 t = parse_type(first + 1, last, db);
1811 size_t k1 = db.names.size();
1812 if (t != first + 1) {
1813 db.subs.emplace_back();
1814 for (size_t k = k0; k < k1; ++k) {
1815 if (db.names[k].second.substr(0, 2) == " [") {
1816 db.names[k].first += " (";
1817 db.names[k].second.insert(0, ")");
1818 } else if (!db.names[k].second.empty() &&
1819 db.names[k].second.front() == '(') {
1820 db.names[k].first += "(";
1821 db.names[k].second.insert(0, ")");
1823 db.names[k].first.append("&");
1824 db.subs.back().push_back(db.names[k]);
1831 size_t k0 = db.names.size();
1832 t = parse_template_param(first, last, db);
1833 size_t k1 = db.names.size();
1835 db.subs.emplace_back();
1836 for (size_t k = k0; k < k1; ++k)
1837 db.subs.back().push_back(db.names[k]);
1838 if (db.try_to_parse_template_args && k1 == k0 + 1) {
1839 const char *t1 = parse_template_args(t, last, db);
1841 auto args = db.names.back().move_full();
1842 db.names.pop_back();
1843 db.names.back().first += std::move(args);
1844 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1853 if (first + 1 != last) {
1854 t = parse_source_name(first + 1, last, db);
1855 if (t != first + 1) {
1856 const char *t2 = parse_type(t, last, db);
1858 if (db.names.size() < 2)
1860 auto type = db.names.back().move_full();
1861 db.names.pop_back();
1862 if (db.names.back().first.substr(0, 9) != "objcproto") {
1863 db.names.back() = type + " " + db.names.back().move_full();
1865 auto proto = db.names.back().move_full();
1866 db.names.pop_back();
1867 t = parse_source_name(proto.data() + 9,
1868 proto.data() + proto.size(), db);
1869 if (t != proto.data() + 9) {
1871 type + "<" + db.names.back().move_full() + ">";
1873 db.names.push_back(type + " " + proto);
1876 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1883 if (first + 1 != last && first[1] == 't') {
1884 t = parse_name(first, last, db);
1886 if (db.names.empty())
1888 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1892 t = parse_substitution(first, last, db);
1895 // Parsed a substitution. If the substitution is a
1896 // <template-param> it might be followed by <template-args>.
1897 t = parse_template_args(first, last, db);
1899 if (db.names.size() < 2)
1901 auto template_args = db.names.back().move_full();
1902 db.names.pop_back();
1903 db.names.back().first += template_args;
1904 // Need to create substitution for <template-template-param>
1906 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1913 if (first + 1 != last) {
1916 size_t k0 = db.names.size();
1917 t = parse_type(first + 2, last, db);
1918 size_t k1 = db.names.size();
1919 if (t != first + 2) {
1920 db.subs.emplace_back();
1921 for (size_t k = k0; k < k1; ++k)
1922 db.subs.back().push_back(db.names[k]);
1930 t = parse_decltype(first, last, db);
1932 if (db.names.empty())
1934 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1940 t = parse_vector_type(first, last, db);
1942 if (db.names.empty())
1944 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1953 // must check for builtin-types before class-enum-types to avoid
1954 // ambiguities with operator-names
1955 t = parse_builtin_type(first, last, db);
1959 t = parse_name(first, last, db);
1961 if (db.names.empty())
1963 db.subs.push_back(typename C::sub_type(1, db.names.back()));
1979 // ::= ad # & (unary)
1986 // ::= cv <type> # (cast)
1987 // ::= da # delete[]
1988 // ::= de # * (unary)
1999 // ::= li <source-name> # operator ""
2007 // ::= mm # -- (postfix in <expression> context)
2010 // ::= ng # - (unary)
2019 // ::= pp # ++ (postfix in <expression> context)
2020 // ::= ps # + (unary)
2027 // ::= v <digit> <source-name> # vendor extended
2031 static const char *parse_operator_name(const char *first, const char *last,
2033 if (last - first >= 2) {
2038 db.names.push_back("operator&&");
2043 db.names.push_back("operator&");
2047 db.names.push_back("operator&=");
2051 db.names.push_back("operator=");
2059 db.names.push_back("operator()");
2063 db.names.push_back("operator,");
2067 db.names.push_back("operator~");
2071 bool try_to_parse_template_args = db.try_to_parse_template_args;
2072 db.try_to_parse_template_args = false;
2073 const char *t = parse_type(first + 2, last, db);
2074 db.try_to_parse_template_args = try_to_parse_template_args;
2075 if (t != first + 2) {
2076 if (db.names.empty())
2078 db.names.back().first.insert(0, "operator ");
2079 db.parsed_ctor_dtor_cv = true;
2088 db.names.push_back("operator delete[]");
2092 db.names.push_back("operator*");
2096 db.names.push_back("operator delete");
2100 db.names.push_back("operator/");
2104 db.names.push_back("operator/=");
2112 db.names.push_back("operator^");
2116 db.names.push_back("operator^=");
2120 db.names.push_back("operator==");
2128 db.names.push_back("operator>=");
2132 db.names.push_back("operator>");
2138 if (first[1] == 'x') {
2139 db.names.push_back("operator[]");
2146 db.names.push_back("operator<=");
2150 const char *t = parse_source_name(first + 2, last, db);
2151 if (t != first + 2) {
2152 if (db.names.empty())
2154 db.names.back().first.insert(0, "operator\"\" ");
2159 db.names.push_back("operator<<");
2163 db.names.push_back("operator<<=");
2167 db.names.push_back("operator<");
2175 db.names.push_back("operator-");
2179 db.names.push_back("operator-=");
2183 db.names.push_back("operator*");
2187 db.names.push_back("operator*=");
2191 db.names.push_back("operator--");
2199 db.names.push_back("operator new[]");
2203 db.names.push_back("operator!=");
2207 db.names.push_back("operator-");
2211 db.names.push_back("operator!");
2215 db.names.push_back("operator new");
2223 db.names.push_back("operator||");
2227 db.names.push_back("operator|");
2231 db.names.push_back("operator|=");
2239 db.names.push_back("operator->*");
2243 db.names.push_back("operator+");
2247 db.names.push_back("operator+=");
2251 db.names.push_back("operator++");
2255 db.names.push_back("operator+");
2259 db.names.push_back("operator->");
2265 if (first[1] == 'u') {
2266 db.names.push_back("operator?");
2273 db.names.push_back("operator%");
2277 db.names.push_back("operator%=");
2281 db.names.push_back("operator>>");
2285 db.names.push_back("operator>>=");
2291 if (std::isdigit(first[1])) {
2292 const char *t = parse_source_name(first + 2, last, db);
2293 if (t != first + 2) {
2294 if (db.names.empty())
2296 db.names.back().first.insert(0, "operator ");
2307 static const char *parse_integer_literal(const char *first, const char *last,
2308 const std::string &lit, C &db) {
2309 const char *t = parse_number(first, last);
2310 if (t != first && t != last && *t == 'E') {
2312 db.names.push_back("(" + lit + ")");
2314 db.names.emplace_back();
2315 if (*first == 'n') {
2316 db.names.back().first += '-';
2319 db.names.back().first.append(first, t);
2320 if (lit.size() <= 3)
2321 db.names.back().first += lit;
2327 // <expr-primary> ::= L <type> <value number> E #
2329 // ::= L <type> <value float> E #
2331 // ::= L <string type> E #
2333 // ::= L <nullptr type> E #
2334 // nullptr literal (i.e., "LDnE")
2335 // ::= L <type> <real-part float> _ <imag-part float> E #
2336 // complex floating point literal (C 2000)
2337 // ::= L <mangled-name> E #
2341 static const char *parse_expr_primary(const char *first, const char *last,
2343 if (last - first >= 4 && *first == 'L') {
2346 const char *t = parse_integer_literal(first + 2, last, "wchar_t", db);
2351 if (first[3] == 'E') {
2354 db.names.push_back("false");
2358 db.names.push_back("true");
2365 const char *t = parse_integer_literal(first + 2, last, "char", db);
2370 const char *t = parse_integer_literal(first + 2, last, "signed char", db);
2376 parse_integer_literal(first + 2, last, "unsigned char", db);
2381 const char *t = parse_integer_literal(first + 2, last, "short", db);
2387 parse_integer_literal(first + 2, last, "unsigned short", db);
2392 const char *t = parse_integer_literal(first + 2, last, "", db);
2397 const char *t = parse_integer_literal(first + 2, last, "u", db);
2402 const char *t = parse_integer_literal(first + 2, last, "l", db);
2407 const char *t = parse_integer_literal(first + 2, last, "ul", db);
2412 const char *t = parse_integer_literal(first + 2, last, "ll", db);
2417 const char *t = parse_integer_literal(first + 2, last, "ull", db);
2422 const char *t = parse_integer_literal(first + 2, last, "__int128", db);
2428 parse_integer_literal(first + 2, last, "unsigned __int128", db);
2433 const char *t = parse_floating_number<float>(first + 2, last, db);
2438 const char *t = parse_floating_number<double>(first + 2, last, db);
2443 const char *t = parse_floating_number<long double>(first + 2, last, db);
2448 if (first[2] == 'Z') {
2449 const char *t = parse_encoding(first + 3, last, db);
2450 if (t != first + 3 && t != last && *t == 'E')
2455 // Invalid mangled name per
2456 // http://sourcerytools.com/pipermail/cxx-abi-dev/2011-August/002422.html
2459 // might be named type
2460 const char *t = parse_type(first + 1, last, db);
2461 if (t != first + 1 && t != last) {
2464 for (; n != last && isdigit(*n); ++n)
2466 if (n != t && n != last && *n == 'E') {
2467 if (db.names.empty())
2470 "(" + db.names.back().move_full() + ")" + std::string(t, n);
2485 static std::string base_name(std::string &s) {
2488 if (s == "std::string") {
2489 s = "std::basic_string<char, std::char_traits<char>, std::allocator<char> "
2491 return "basic_string";
2493 if (s == "std::istream") {
2494 s = "std::basic_istream<char, std::char_traits<char> >";
2495 return "basic_istream";
2497 if (s == "std::ostream") {
2498 s = "std::basic_ostream<char, std::char_traits<char> >";
2499 return "basic_ostream";
2501 if (s == "std::iostream") {
2502 s = "std::basic_iostream<char, std::char_traits<char> >";
2503 return "basic_iostream";
2505 const char *const pf = s.data();
2506 const char *pe = pf + s.size();
2507 if (pe[-1] == '>') {
2511 return std::string();
2512 if (pe[-1] == '<') {
2517 } else if (pe[-1] == '>')
2522 return std::string();
2523 const char *p0 = pe - 1;
2524 for (; p0 != pf; --p0) {
2529 if (!isalpha(*p0) && !isdigit(*p0) && *p0 != '_') {
2530 return std::string();
2533 return std::string(p0, pe);
2536 // <ctor-dtor-name> ::= C1 # complete object constructor
2537 // ::= C2 # base object constructor
2538 // ::= C3 # complete object allocating constructor
2539 // extension ::= C5 # ?
2540 // ::= D0 # deleting destructor
2541 // ::= D1 # complete object destructor
2542 // ::= D2 # base object destructor
2543 // extension ::= D5 # ?
2546 static const char *parse_ctor_dtor_name(const char *first, const char *last,
2548 if (last - first >= 2 && !db.names.empty()) {
2556 if (db.names.empty())
2558 db.names.push_back(base_name(db.names.back().first));
2560 db.parsed_ctor_dtor_cv = true;
2570 if (db.names.empty())
2572 db.names.push_back("~" + base_name(db.names.back().first));
2574 db.parsed_ctor_dtor_cv = true;
2583 // <unnamed-type-name> ::= Ut [ <nonnegative number> ] _
2584 // ::= <closure-type-name>
2586 // <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _
2588 // <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda
2589 // has no parameters
2592 static const char *parse_unnamed_type_name(const char *first, const char *last,
2594 if (last - first > 2 && first[0] == 'U') {
2595 char type = first[1];
2598 db.names.push_back(std::string("'unnamed"));
2599 const char *t0 = first + 2;
2601 db.names.pop_back();
2604 if (std::isdigit(*t0)) {
2605 const char *t1 = t0 + 1;
2606 while (t1 != last && std::isdigit(*t1))
2608 db.names.back().first.append(t0, t1);
2611 db.names.back().first.push_back('\'');
2612 if (t0 == last || *t0 != '_') {
2613 db.names.pop_back();
2619 size_t lambda_pos = db.names.size();
2620 db.names.push_back(std::string("'lambda'("));
2621 const char *t0 = first + 2;
2622 if (first[2] == 'v') {
2623 db.names.back().first += ')';
2626 bool is_first_it = true;
2628 long k0 = static_cast<long>(db.names.size());
2629 const char *t1 = parse_type(t0, last, db);
2630 long k1 = static_cast<long>(db.names.size());
2635 // If the call to parse_type above found a pack expansion
2636 // substitution, then multiple names could have been
2637 // inserted into the name table. Walk through the names,
2638 // appending each onto the lambda's parameter list.
2639 std::for_each(db.names.begin() + k0, db.names.begin() + k1,
2640 [&](typename C::sub_type::value_type &pair) {
2643 auto &lambda = db.names[lambda_pos].first;
2645 lambda.append(", ");
2646 is_first_it = false;
2647 lambda.append(pair.move_full());
2649 db.names.erase(db.names.begin() + k0, db.names.end());
2653 if (!db.names.empty())
2654 db.names.pop_back();
2657 if (db.names.empty() || db.names.size() - 1 != lambda_pos)
2659 db.names.back().first.append(")");
2661 if (t0 == last || *t0 != 'E') {
2662 if (!db.names.empty())
2663 db.names.pop_back();
2668 if (!db.names.empty())
2669 db.names.pop_back();
2672 if (std::isdigit(*t0)) {
2673 const char *t1 = t0 + 1;
2674 while (t1 != last && std::isdigit(*t1))
2676 db.names.back().first.insert(db.names.back().first.begin() + 7, t0, t1);
2679 if (t0 == last || *t0 != '_') {
2680 if (!db.names.empty())
2681 db.names.pop_back();
2691 // <unqualified-name> ::= <operator-name>
2692 // ::= <ctor-dtor-name>
2693 // ::= <source-name>
2694 // ::= <unnamed-type-name>
2697 static const char *parse_unqualified_name(const char *first, const char *last,
2699 if (first != last) {
2704 t = parse_ctor_dtor_name(first, last, db);
2709 t = parse_unnamed_type_name(first, last, db);
2722 t = parse_source_name(first, last, db);
2727 t = parse_operator_name(first, last, db);
2736 // <unscoped-name> ::= <unqualified-name>
2737 // ::= St <unqualified-name> # ::std::
2738 // extension ::= StL<unqualified-name>
2741 static const char *parse_unscoped_name(const char *first, const char *last,
2743 if (last - first >= 2) {
2744 const char *t0 = first;
2746 if (first[0] == 'S' && first[1] == 't') {
2749 if (t0 != last && *t0 == 'L')
2752 const char *t1 = parse_unqualified_name(t0, last, db);
2755 if (db.names.empty())
2757 db.names.back().first.insert(0, "std::");
2765 // at <type> # alignof (a type)
2768 static const char *parse_alignof_type(const char *first, const char *last,
2770 if (last - first >= 3 && first[0] == 'a' && first[1] == 't') {
2771 const char *t = parse_type(first + 2, last, db);
2772 if (t != first + 2) {
2773 if (db.names.empty())
2775 db.names.back().first = "alignof (" + db.names.back().move_full() + ")";
2782 // az <expression> # alignof (a
2786 static const char *parse_alignof_expr(const char *first, const char *last,
2788 if (last - first >= 3 && first[0] == 'a' && first[1] == 'z') {
2789 const char *t = parse_expression(first + 2, last, db);
2790 if (t != first + 2) {
2791 if (db.names.empty())
2793 db.names.back().first = "alignof (" + db.names.back().move_full() + ")";
2801 static const char *parse_noexcept_expression(const char *first,
2802 const char *last, C &db) {
2803 const char *t1 = parse_expression(first, last, db);
2805 if (db.names.empty())
2807 db.names.back().first = "noexcept (" + db.names.back().move_full() + ")";
2814 static const char *parse_prefix_expression(const char *first, const char *last,
2815 const std::string &op,
2817 const char *t1 = parse_expression(first, last, db);
2819 if (db.names.empty())
2821 db.names.back().first = op + "(" + db.names.back().move_full() + ")";
2828 static const char *parse_binary_expression(const char *first, const char *last,
2829 const std::string &op,
2831 const char *t1 = parse_expression(first, last, db);
2833 const char *t2 = parse_expression(t1, last, db);
2835 if (db.names.size() < 2)
2837 auto op2 = db.names.back().move_full();
2838 db.names.pop_back();
2839 auto op1 = db.names.back().move_full();
2840 auto &nm = db.names.back().first;
2844 nm += "(" + op1 + ") " + op + " (" + op2 + ")";
2848 } else if (!db.names.empty())
2849 db.names.pop_back();
2854 // <expression> ::= <unary operator-name> <expression>
2855 // ::= <binary operator-name> <expression> <expression>
2856 // ::= <ternary operator-name> <expression> <expression>
2858 // ::= cl <expression>+ E # call
2859 // ::= cv <type> <expression> #
2860 // conversion with one argument
2861 // ::= cv <type> _ <expression>* E #
2862 // conversion with a different number of arguments
2863 // ::= [gs] nw <expression>* _ <type> E # new
2865 // ::= [gs] nw <expression>* _ <type> <initializer> # new
2866 // (expr-list) type (init)
2867 // ::= [gs] na <expression>* _ <type> E # new[]
2869 // ::= [gs] na <expression>* _ <type> <initializer> # new[]
2870 // (expr-list) type (init)
2871 // ::= [gs] dl <expression> #
2872 // delete expression
2873 // ::= [gs] da <expression> #
2874 // delete[] expression
2875 // ::= pp_ <expression> #
2877 // ::= mm_ <expression> #
2881 // ::= te <expression> #
2882 // typeid (expression)
2883 // ::= dc <type> <expression> #
2884 // dynamic_cast<type> (expression)
2885 // ::= sc <type> <expression> #
2886 // static_cast<type> (expression)
2887 // ::= cc <type> <expression> #
2888 // const_cast<type> (expression)
2889 // ::= rc <type> <expression> #
2890 // reinterpret_cast<type> (expression)
2893 // ::= sz <expression> #
2894 // sizeof (an expression)
2897 // ::= az <expression> #
2898 // alignof (an expression)
2899 // ::= nx <expression> #
2900 // noexcept (expression)
2901 // ::= <template-param>
2902 // ::= <function-param>
2903 // ::= dt <expression> <unresolved-name> #
2905 // ::= pt <expression> <unresolved-name> #
2907 // ::= ds <expression> <expression> #
2909 // ::= sZ <template-param> # size
2910 // of a parameter pack
2911 // ::= sZ <function-param> # size
2912 // of a function parameter pack
2913 // ::= sp <expression> # pack
2915 // ::= tw <expression> # throw
2918 // with no operand (rethrow)
2919 // ::= <unresolved-name> # f(p),
2932 // ::= <expr-primary>
2935 static const char *parse_expression(const char *first, const char *last,
2937 if (last - first >= 2) {
2938 const char *t = first;
2939 bool parsed_gs = false;
2940 if (last - first >= 4 && t[0] == 'g' && t[1] == 's') {
2946 first = parse_expr_primary(first, last, db);
2949 first = parse_template_param(first, last, db);
2952 first = parse_function_param(first, last, db);
2957 t = parse_binary_expression(first + 2, last, "&&", db);
2962 t = parse_prefix_expression(first + 2, last, "&", db);
2967 t = parse_binary_expression(first + 2, last, "&", db);
2972 t = parse_binary_expression(first + 2, last, "&=", db);
2977 t = parse_binary_expression(first + 2, last, "=", db);
2982 first = parse_alignof_type(first, last, db);
2985 first = parse_alignof_expr(first, last, db);
2992 first = parse_const_cast_expr(first, last, db);
2995 first = parse_call_expr(first, last, db);
2998 t = parse_binary_expression(first + 2, last, ",", db);
3003 t = parse_prefix_expression(first + 2, last, "~", db);
3008 first = parse_conversion_expr(first, last, db);
3015 const char *t1 = parse_expression(t + 2, last, db);
3017 if (db.names.empty())
3019 db.names.back().first =
3020 (parsed_gs ? std::string("::") : std::string()) + "delete[] " +
3021 db.names.back().move_full();
3026 first = parse_dynamic_cast_expr(first, last, db);
3029 t = parse_prefix_expression(first + 2, last, "*", db);
3034 const char *t1 = parse_expression(t + 2, last, db);
3036 if (db.names.empty())
3038 db.names.back().first =
3039 (parsed_gs ? std::string("::") : std::string()) + "delete " +
3040 db.names.back().move_full();
3045 return parse_unresolved_name(first, last, db);
3047 first = parse_dot_star_expr(first, last, db);
3050 first = parse_dot_expr(first, last, db);
3053 t = parse_binary_expression(first + 2, last, "/", db);
3058 t = parse_binary_expression(first + 2, last, "/=", db);
3067 t = parse_binary_expression(first + 2, last, "^", db);
3072 t = parse_binary_expression(first + 2, last, "^=", db);
3077 t = parse_binary_expression(first + 2, last, "==", db);
3086 t = parse_binary_expression(first + 2, last, ">=", db);
3091 t = parse_binary_expression(first + 2, last, ">", db);
3099 const char *t1 = parse_expression(first + 2, last, db);
3100 if (t1 != first + 2) {
3101 const char *t2 = parse_expression(t1, last, db);
3103 if (db.names.size() < 2)
3105 auto op2 = db.names.back().move_full();
3106 db.names.pop_back();
3107 auto op1 = db.names.back().move_full();
3108 db.names.back() = "(" + op1 + ")[" + op2 + "]";
3110 } else if (!db.names.empty())
3111 db.names.pop_back();
3118 t = parse_binary_expression(first + 2, last, "<=", db);
3123 t = parse_binary_expression(first + 2, last, "<<", db);
3128 t = parse_binary_expression(first + 2, last, "<<=", db);
3133 t = parse_binary_expression(first + 2, last, "<", db);
3142 t = parse_binary_expression(first + 2, last, "-", db);
3147 t = parse_binary_expression(first + 2, last, "-=", db);
3152 t = parse_binary_expression(first + 2, last, "*", db);
3157 t = parse_binary_expression(first + 2, last, "*=", db);
3162 if (first + 2 != last && first[2] == '_') {
3163 t = parse_prefix_expression(first + 3, last, "--", db);
3167 const char *t1 = parse_expression(first + 2, last, db);
3168 if (t1 != first + 2) {
3169 if (db.names.empty())
3171 db.names.back() = "(" + db.names.back().move_full() + ")--";
3182 first = parse_new_expr(first, last, db);
3185 t = parse_binary_expression(first + 2, last, "!=", db);
3190 t = parse_prefix_expression(first + 2, last, "-", db);
3195 t = parse_prefix_expression(first + 2, last, "!", db);
3200 t = parse_noexcept_expression(first + 2, last, db);
3209 return parse_unresolved_name(first, last, db);
3211 t = parse_binary_expression(first + 2, last, "||", db);
3216 t = parse_binary_expression(first + 2, last, "|", db);
3221 t = parse_binary_expression(first + 2, last, "|=", db);
3230 t = parse_binary_expression(first + 2, last, "->*", db);
3235 t = parse_binary_expression(first + 2, last, "+", db);
3240 t = parse_binary_expression(first + 2, last, "+=", db);
3245 if (first + 2 != last && first[2] == '_') {
3246 t = parse_prefix_expression(first + 3, last, "++", db);
3250 const char *t1 = parse_expression(first + 2, last, db);
3251 if (t1 != first + 2) {
3252 if (db.names.empty())
3254 db.names.back() = "(" + db.names.back().move_full() + ")++";
3260 t = parse_prefix_expression(first + 2, last, "+", db);
3265 first = parse_arrow_expr(first, last, db);
3271 const char *t1 = parse_expression(first + 2, last, db);
3272 if (t1 != first + 2) {
3273 const char *t2 = parse_expression(t1, last, db);
3275 const char *t3 = parse_expression(t2, last, db);
3277 if (db.names.size() < 3)
3279 auto op3 = db.names.back().move_full();
3280 db.names.pop_back();
3281 auto op2 = db.names.back().move_full();
3282 db.names.pop_back();
3283 auto op1 = db.names.back().move_full();
3284 db.names.back() = "(" + op1 + ") ? (" + op2 + ") : (" + op3 + ")";
3287 if (db.names.size() < 2)
3289 db.names.pop_back();
3290 db.names.pop_back();
3292 } else if (!db.names.empty())
3293 db.names.pop_back();
3300 first = parse_reinterpret_cast_expr(first, last, db);
3303 t = parse_binary_expression(first + 2, last, "%", db);
3308 t = parse_binary_expression(first + 2, last, "%=", db);
3313 t = parse_binary_expression(first + 2, last, ">>", db);
3318 t = parse_binary_expression(first + 2, last, ">>=", db);
3327 first = parse_static_cast_expr(first, last, db);
3330 first = parse_pack_expansion(first, last, db);
3333 return parse_unresolved_name(first, last, db);
3335 first = parse_sizeof_type_expr(first, last, db);
3338 first = parse_sizeof_expr_expr(first, last, db);
3341 if (last - t >= 3) {
3344 first = parse_sizeof_param_pack_expr(first, last, db);
3347 first = parse_sizeof_function_param_pack_expr(first, last, db);
3358 first = parse_typeid_expr(first, last, db);
3361 db.names.push_back("throw");
3365 first = parse_throw_expr(first, last, db);
3378 return parse_unresolved_name(first, last, db);
3384 // <template-arg> ::= <type> # type
3386 // ::= X <expression> E #
3388 // ::= <expr-primary> #
3389 // simple expressions
3390 // ::= J <template-arg>* E #
3392 // ::= LZ <encoding> E #
3396 static const char *parse_template_arg(const char *first, const char *last,
3398 if (first != last) {
3402 t = parse_expression(first + 1, last, db);
3403 if (t != first + 1) {
3404 if (t != last && *t == 'E')
3413 const char *t1 = parse_template_arg(t, last, db);
3421 // <expr-primary> or LZ <encoding> E
3422 if (first + 1 != last && first[1] == 'Z') {
3423 t = parse_encoding(first + 2, last, db);
3424 if (t != first + 2 && t != last && *t == 'E')
3427 first = parse_expr_primary(first, last, db);
3431 first = parse_type(first, last, db);
3438 // <template-args> ::= I <template-arg>* E
3439 // extension, the abi says <template-arg>+
3442 static const char *parse_template_args(const char *first, const char *last,
3444 if (last - first >= 2 && *first == 'I') {
3445 if (db.tag_templates)
3446 db.template_param.back().clear();
3447 const char *t = first + 1;
3448 std::string args("<");
3450 if (db.tag_templates)
3451 db.template_param.emplace_back();
3452 size_t k0 = db.names.size();
3453 const char *t1 = parse_template_arg(t, last, db);
3454 size_t k1 = db.names.size();
3455 if (db.tag_templates)
3456 db.template_param.pop_back();
3457 if (t1 == t || t1 == last)
3459 if (db.tag_templates) {
3460 db.template_param.back().emplace_back();
3461 for (size_t k = k0; k < k1; ++k)
3462 db.template_param.back().back().push_back(db.names[k]);
3464 for (size_t k = k0; k < k1; ++k) {
3465 if (args.size() > 1)
3467 args += db.names[k].move_full();
3469 for (; k1 > k0; --k1)
3470 if (!db.names.empty())
3471 db.names.pop_back();
3475 if (args.back() != '>')
3479 db.names.push_back(std::move(args));
3484 // <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix>
3485 // <unqualified-name> E
3486 // ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix>
3487 // <template-args> E
3489 // <prefix> ::= <prefix> <unqualified-name>
3490 // ::= <template-prefix> <template-args>
3491 // ::= <template-param>
3494 // ::= <substitution>
3495 // ::= <prefix> <data-member-prefix>
3498 // <template-prefix> ::= <prefix> <template unqualified-name>
3499 // ::= <template-param>
3500 // ::= <substitution>
3503 static const char *parse_nested_name(const char *first, const char *last, C &db,
3504 bool *ends_with_template_args) {
3505 if (first != last && *first == 'N') {
3507 const char *t0 = parse_cv_qualifiers(first + 1, last, cv);
3514 } else if (*t0 == 'O') {
3518 db.names.emplace_back();
3519 if (last - t0 >= 2 && t0[0] == 'S' && t0[1] == 't') {
3521 db.names.back().first = "std";
3524 db.names.pop_back();
3527 bool pop_subs = false;
3528 bool component_ends_with_template_args = false;
3529 while (*t0 != 'E') {
3530 component_ends_with_template_args = false;
3534 if (t0 + 1 != last && t0[1] == 't')
3535 goto do_parse_unqualified_name;
3536 t1 = parse_substitution(t0, last, db);
3537 if (t1 != t0 && t1 != last) {
3538 auto name = db.names.back().move_full();
3539 db.names.pop_back();
3540 if (db.names.empty())
3542 if (!db.names.back().first.empty()) {
3543 db.names.back().first += "::" + name;
3544 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3546 db.names.back().first = name;
3553 t1 = parse_template_param(t0, last, db);
3554 if (t1 != t0 && t1 != last) {
3555 auto name = db.names.back().move_full();
3556 db.names.pop_back();
3557 if (db.names.empty())
3559 if (!db.names.back().first.empty())
3560 db.names.back().first += "::" + name;
3562 db.names.back().first = name;
3563 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3570 if (t0 + 1 != last && t0[1] != 't' && t0[1] != 'T')
3571 goto do_parse_unqualified_name;
3572 t1 = parse_decltype(t0, last, db);
3573 if (t1 != t0 && t1 != last) {
3574 auto name = db.names.back().move_full();
3575 db.names.pop_back();
3576 if (db.names.empty())
3578 if (!db.names.back().first.empty())
3579 db.names.back().first += "::" + name;
3581 db.names.back().first = name;
3582 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3589 t1 = parse_template_args(t0, last, db);
3590 if (t1 != t0 && t1 != last) {
3591 auto name = db.names.back().move_full();
3592 db.names.pop_back();
3593 if (db.names.empty())
3595 db.names.back().first += name;
3596 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3598 component_ends_with_template_args = true;
3607 do_parse_unqualified_name:
3608 t1 = parse_unqualified_name(t0, last, db);
3609 if (t1 != t0 && t1 != last) {
3610 auto name = db.names.back().move_full();
3611 db.names.pop_back();
3612 if (db.names.empty())
3614 if (!db.names.back().first.empty())
3615 db.names.back().first += "::" + name;
3617 db.names.back().first = name;
3618 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3627 if (pop_subs && !db.subs.empty())
3629 if (ends_with_template_args)
3630 *ends_with_template_args = component_ends_with_template_args;
3635 // <discriminator> := _ <non-negative number> # when number < 10
3636 // := __ <non-negative number> _ # when number >= 10
3637 // extension := decimal-digit+ # at the end of string
3639 static const char *parse_discriminator(const char *first, const char *last) {
3640 // parse but ignore discriminator
3641 if (first != last) {
3642 if (*first == '_') {
3643 const char *t1 = first + 1;
3645 if (std::isdigit(*t1))
3647 else if (*t1 == '_') {
3648 for (++t1; t1 != last && std::isdigit(*t1); ++t1)
3650 if (t1 != last && *t1 == '_')
3654 } else if (std::isdigit(*first)) {
3655 const char *t1 = first + 1;
3656 for (; t1 != last && std::isdigit(*t1); ++t1)
3665 // <local-name> := Z <function encoding> E <entity name> [<discriminator>]
3666 // := Z <function encoding> E s [<discriminator>]
3667 // := Z <function encoding> Ed [ <parameter number> ] _ <entity
3671 static const char *parse_local_name(const char *first, const char *last, C &db,
3672 bool *ends_with_template_args) {
3673 if (first != last && *first == 'Z') {
3674 const char *t = parse_encoding(first + 1, last, db);
3675 if (t != first + 1 && t != last && *t == 'E' && ++t != last) {
3678 first = parse_discriminator(t + 1, last);
3679 if (db.names.empty())
3681 db.names.back().first.append("::string literal");
3685 const char *t1 = parse_number(t, last);
3686 if (t1 != last && *t1 == '_') {
3688 t1 = parse_name(t, last, db, ends_with_template_args);
3690 if (db.names.size() < 2)
3692 auto name = db.names.back().move_full();
3693 db.names.pop_back();
3694 if (db.names.empty())
3696 db.names.back().first.append("::");
3697 db.names.back().first.append(name);
3699 } else if (!db.names.empty())
3700 db.names.pop_back();
3705 const char *t1 = parse_name(t, last, db, ends_with_template_args);
3707 // parse but ignore discriminator
3708 first = parse_discriminator(t1, last);
3709 if (db.names.size() < 2)
3711 auto name = db.names.back().move_full();
3712 db.names.pop_back();
3713 if (db.names.empty())
3715 db.names.back().first.append("::");
3716 db.names.back().first.append(name);
3717 } else if (!db.names.empty())
3718 db.names.pop_back();
3726 // <name> ::= <nested-name> // N
3727 // ::= <local-name> # See Scope Encoding below // Z
3728 // ::= <unscoped-template-name> <template-args>
3729 // ::= <unscoped-name>
3731 // <unscoped-template-name> ::= <unscoped-name>
3732 // ::= <substitution>
3735 static const char *parse_name(const char *first, const char *last, C &db,
3736 bool *ends_with_template_args) {
3737 if (last - first >= 2) {
3738 const char *t0 = first;
3739 // extension: ignore L here
3744 const char *t1 = parse_nested_name(t0, last, db, ends_with_template_args);
3750 const char *t1 = parse_local_name(t0, last, db, ends_with_template_args);
3756 const char *t1 = parse_unscoped_name(t0, last, db);
3759 *t1 == 'I') // <unscoped-template-name> <template-args>
3761 if (db.names.empty())
3763 db.subs.push_back(typename C::sub_type(1, db.names.back()));
3765 t1 = parse_template_args(t0, last, db);
3767 if (db.names.size() < 2)
3769 auto tmp = db.names.back().move_full();
3770 db.names.pop_back();
3771 if (db.names.empty())
3773 db.names.back().first += tmp;
3775 if (ends_with_template_args)
3776 *ends_with_template_args = true;
3778 } else // <unscoped-name>
3780 } else { // try <substitution> <template-args>
3781 t1 = parse_substitution(t0, last, db);
3782 if (t1 != t0 && t1 != last && *t1 == 'I') {
3784 t1 = parse_template_args(t0, last, db);
3786 if (db.names.size() < 2)
3788 auto tmp = db.names.back().move_full();
3789 db.names.pop_back();
3790 if (db.names.empty())
3792 db.names.back().first += tmp;
3794 if (ends_with_template_args)
3795 *ends_with_template_args = true;
3806 // <call-offset> ::= h <nv-offset> _
3807 // ::= v <v-offset> _
3809 // <nv-offset> ::= <offset number>
3810 // # non-virtual base override
3812 // <v-offset> ::= <offset number> _ <virtual offset number>
3813 // # virtual base override, with vcall offset
3815 static const char *parse_call_offset(const char *first, const char *last) {
3816 if (first != last) {
3819 const char *t = parse_number(first + 1, last);
3820 if (t != first + 1 && t != last && *t == '_')
3824 const char *t = parse_number(first + 1, last);
3825 if (t != first + 1 && t != last && *t == '_') {
3826 const char *t2 = parse_number(++t, last);
3827 if (t2 != t && t2 != last && *t2 == '_')
3836 // <special-name> ::= TV <type> # virtual table
3837 // ::= TT <type> # VTT structure (construction vtable index)
3838 // ::= TI <type> # typeinfo structure
3839 // ::= TS <type> # typeinfo name (null-terminated byte string)
3840 // ::= Tc <call-offset> <call-offset> <base encoding>
3841 // # base is the nominal target function of thunk
3842 // # first call-offset is 'this' adjustment
3843 // # second call-offset is result adjustment
3844 // ::= T <call-offset> <base encoding>
3845 // # base is the nominal target function of thunk
3846 // ::= GV <object name> # Guard variable for one-time
3849 // ::= TW <object name> # Thread-local wrapper
3850 // ::= TH <object name> # Thread-local initialization
3851 // extension ::= TC <first type> <number> _ <second type> # construction
3852 // vtable for second-in-first
3853 // extension ::= GR <object name> # reference temporary for object
3856 static const char *parse_special_name(const char *first, const char *last,
3858 if (last - first > 2) {
3864 // TV <type> # virtual table
3865 t = parse_type(first + 2, last, db);
3866 if (t != first + 2) {
3867 if (db.names.empty())
3869 db.names.back().first.insert(0, "vtable for ");
3874 // TT <type> # VTT structure (construction vtable index)
3875 t = parse_type(first + 2, last, db);
3876 if (t != first + 2) {
3877 if (db.names.empty())
3879 db.names.back().first.insert(0, "VTT for ");
3884 // TI <type> # typeinfo structure
3885 t = parse_type(first + 2, last, db);
3886 if (t != first + 2) {
3887 if (db.names.empty())
3889 db.names.back().first.insert(0, "typeinfo for ");
3894 // TS <type> # typeinfo name (null-terminated byte string)
3895 t = parse_type(first + 2, last, db);
3896 if (t != first + 2) {
3897 if (db.names.empty())
3899 db.names.back().first.insert(0, "typeinfo name for ");
3904 // Tc <call-offset> <call-offset> <base encoding>
3906 const char *t0 = parse_call_offset(first + 2, last);
3907 if (t0 == first + 2)
3909 const char *t1 = parse_call_offset(t0, last);
3912 t = parse_encoding(t1, last, db);
3914 if (db.names.empty())
3916 db.names.back().first.insert(0, "covariant return thunk to ");
3922 // extension ::= TC <first type> <number> _ <second type> # construction
3923 // vtable for second-in-first
3924 t = parse_type(first + 2, last, db);
3925 if (t != first + 2) {
3926 const char *t0 = parse_number(t, last);
3927 if (t0 != t && t0 != last && *t0 == '_') {
3928 const char *t1 = parse_type(++t0, last, db);
3930 if (db.names.size() < 2)
3932 auto left = db.names.back().move_full();
3933 db.names.pop_back();
3934 if (db.names.empty())
3936 db.names.back().first = "construction vtable for " +
3937 std::move(left) + "-in-" +
3938 db.names.back().move_full();
3945 // TW <object name> # Thread-local wrapper
3946 t = parse_name(first + 2, last, db);
3947 if (t != first + 2) {
3948 if (db.names.empty())
3950 db.names.back().first.insert(0, "thread-local wrapper routine for ");
3955 // TH <object name> # Thread-local initialization
3956 t = parse_name(first + 2, last, db);
3957 if (t != first + 2) {
3958 if (db.names.empty())
3960 db.names.back().first.insert(
3961 0, "thread-local initialization routine for ");
3966 // T <call-offset> <base encoding>
3968 const char *t0 = parse_call_offset(first + 1, last);
3969 if (t0 == first + 1)
3971 t = parse_encoding(t0, last, db);
3973 if (db.names.empty())
3975 if (first[1] == 'v') {
3976 db.names.back().first.insert(0, "virtual thunk to ");
3979 db.names.back().first.insert(0, "non-virtual thunk to ");
3990 // GV <object name> # Guard variable for one-time initialization
3991 t = parse_name(first + 2, last, db);
3992 if (t != first + 2) {
3993 if (db.names.empty())
3995 db.names.back().first.insert(0, "guard variable for ");
4000 // extension ::= GR <object name> # reference temporary for object
4001 t = parse_name(first + 2, last, db);
4002 if (t != first + 2) {
4003 if (db.names.empty())
4005 db.names.back().first.insert(0, "reference temporary for ");
4017 template <class T> class save_value {
4022 save_value(T &restore) : restore_(restore), original_value_(restore) {}
4024 ~save_value() { restore_ = std::move(original_value_); }
4026 save_value(const save_value &) = delete;
4027 save_value &operator=(const save_value &) = delete;
4031 // <encoding> ::= <function name> <bare-function-type>
4033 // ::= <special-name>
4036 static const char *parse_encoding(const char *first, const char *last, C &db) {
4037 if (first != last) {
4038 save_value<decltype(db.encoding_depth)> su(db.encoding_depth);
4039 ++db.encoding_depth;
4040 save_value<decltype(db.tag_templates)> sb(db.tag_templates);
4041 if (db.encoding_depth > 1)
4042 db.tag_templates = true;
4043 save_value<decltype(db.parsed_ctor_dtor_cv)> sp(db.parsed_ctor_dtor_cv);
4044 db.parsed_ctor_dtor_cv = false;
4048 first = parse_special_name(first, last, db);
4051 bool ends_with_template_args = false;
4052 const char *t = parse_name(first, last, db, &ends_with_template_args);
4053 unsigned cv = db.cv;
4054 unsigned ref = db.ref;
4056 if (t != last && *t != 'E' && *t != '.') {
4057 save_value<bool> sb2(db.tag_templates);
4058 db.tag_templates = false;
4061 if (db.names.empty())
4063 const std::string &nm = db.names.back().first;
4066 if (!db.parsed_ctor_dtor_cv && ends_with_template_args) {
4067 t2 = parse_type(t, last, db);
4070 if (db.names.size() < 2)
4072 auto ret1 = std::move(db.names.back().first);
4073 ret2 = std::move(db.names.back().second);
4076 db.names.pop_back();
4077 if (db.names.empty())
4080 db.names.back().first.insert(0, ret1);
4083 db.names.back().first += '(';
4084 if (t != last && *t == 'v') {
4087 bool first_arg = true;
4089 size_t k0 = db.names.size();
4090 t2 = parse_type(t, last, db);
4091 size_t k1 = db.names.size();
4096 for (size_t k = k0; k < k1; ++k) {
4099 tmp += db.names[k].move_full();
4101 for (size_t k = k0; k < k1; ++k) {
4102 if (db.names.empty())
4104 db.names.pop_back();
4107 if (db.names.empty())
4110 db.names.back().first += ", ";
4113 db.names.back().first += tmp;
4119 if (db.names.empty())
4121 db.names.back().first += ')';
4123 db.names.back().first.append(" const");
4124 if (cv & CV_volatile)
4125 db.names.back().first.append(" volatile");
4126 if (cv & CV_restrict)
4127 db.names.back().first.append(" restrict");
4129 db.names.back().first.append(" &");
4131 db.names.back().first.append(" &&");
4132 db.names.back().first += ret2;
4145 // _block_invoke<decimal-digit>+
4146 // _block_invoke_<decimal-digit>+
4149 static const char *parse_block_invoke(const char *first, const char *last,
4151 if (last - first >= 13) {
4152 const char test[] = "_block_invoke";
4153 const char *t = first;
4154 for (int i = 0; i < 13; ++i, ++t) {
4160 // must have at least 1 decimal digit
4161 if (++t == last || !std::isdigit(*t))
4165 // parse zero or more digits
4166 while (t != last && isdigit(*t))
4169 if (db.names.empty())
4171 db.names.back().first.insert(0, "invocation function for block in ");
4178 // <dot-suffix> := .<anything and everything>
4181 static const char *parse_dot_suffix(const char *first, const char *last,
4183 if (first != last && *first == '.') {
4184 if (db.names.empty())
4186 db.names.back().first += " (" + std::string(first, last) + ")";
4192 // <block-involcaton-function> ___Z<encoding>_block_invoke
4193 // <block-involcaton-function> ___Z<encoding>_block_invoke<decimal-digit>+
4194 // <block-involcaton-function> ___Z<encoding>_block_invoke_<decimal-digit>+
4195 // <mangled-name> ::= _Z<encoding>
4199 static void demangle(const char *first, const char *last, C &db, int &status) {
4200 if (first >= last) {
4201 status = invalid_mangled_name;
4204 if (*first == '_') {
4205 if (last - first >= 4) {
4206 if (first[1] == 'Z') {
4207 const char *t = parse_encoding(first + 2, last, db);
4208 if (t != first + 2 && t != last && *t == '.')
4209 t = parse_dot_suffix(t, last, db);
4211 status = invalid_mangled_name;
4212 } else if (first[1] == '_' && first[2] == '_' && first[3] == 'Z') {
4213 const char *t = parse_encoding(first + 4, last, db);
4214 if (t != first + 4 && t != last) {
4215 const char *t1 = parse_block_invoke(t, last, db);
4217 status = invalid_mangled_name;
4219 status = invalid_mangled_name;
4221 status = invalid_mangled_name;
4223 status = invalid_mangled_name;
4225 const char *t = parse_type(first, last, db);
4227 status = invalid_mangled_name;
4229 if (status == success && db.names.empty())
4230 status = invalid_mangled_name;
4234 template <class StrT> struct string_pair {
4238 string_pair() = default;
4239 string_pair(StrT f) : first(std::move(f)) {}
4240 string_pair(StrT f, StrT s) : first(std::move(f)), second(std::move(s)) {}
4241 template <size_t N> string_pair(const char (&s)[N]) : first(s, N - 1) {}
4243 size_t size() const { return first.size() + second.size(); }
4244 bool empty() const { return first.empty() && second.empty(); }
4245 StrT full() const { return first + second; }
4246 StrT move_full() { return std::move(first) + std::move(second); }
4250 typedef std::vector<string_pair<std::string>> sub_type;
4251 typedef std::vector<sub_type> template_param_type;
4253 template_param_type subs;
4254 std::vector<template_param_type> template_param;
4257 unsigned encoding_depth = 0;
4258 bool parsed_ctor_dtor_cv = false;
4259 bool tag_templates = true;
4260 bool fix_forward_references = false;
4261 bool try_to_parse_template_args = true;
4263 Db() : subs(0, names), template_param(0, subs) {}
4267 char *llvm::itaniumDemangle(const char *mangled_name, char *buf, size_t *n,
4269 if (mangled_name == nullptr || (buf != nullptr && n == nullptr)) {
4271 *status = invalid_args;
4274 size_t internal_size = buf != nullptr ? *n : 0;
4276 db.template_param.emplace_back();
4277 int internal_status = success;
4278 size_t len = std::strlen(mangled_name);
4279 demangle(mangled_name, mangled_name + len, db, internal_status);
4280 if (internal_status == success && db.fix_forward_references &&
4281 !db.template_param.empty() && !db.template_param.front().empty()) {
4282 db.fix_forward_references = false;
4283 db.tag_templates = false;
4286 demangle(mangled_name, mangled_name + len, db, internal_status);
4287 if (db.fix_forward_references)
4288 internal_status = invalid_mangled_name;
4290 if (internal_status == success) {
4291 size_t sz = db.names.back().size() + 1;
4292 if (sz > internal_size) {
4293 char *newbuf = static_cast<char *>(std::realloc(buf, sz));
4294 if (newbuf == nullptr) {
4295 internal_status = memory_alloc_failure;
4303 if (buf != nullptr) {
4304 db.names.back().first += db.names.back().second;
4305 std::memcpy(buf, db.names.back().first.data(), sz - 1);
4306 buf[sz - 1] = char(0);
4311 *status = internal_status;