<div dir="ltr">Does not build with MSVC 2013, should be fixed in r280740.</div><div class="gmail_extra"><br><div class="gmail_quote">On Tue, Sep 6, 2016 at 12:16 PM, Rafael Espindola via llvm-commits <span dir="ltr"><<a href="mailto:llvm-commits@lists.llvm.org" target="_blank">llvm-commits@lists.llvm.org</a>></span> wrote:<br><blockquote class="gmail_quote" style="margin:0 0 0 .8ex;border-left:1px #ccc solid;padding-left:1ex">Author: rafael<br>
Date: Tue Sep 6 14:16:48 2016<br>
New Revision: 280732<br>
<br>
URL: <a href="http://llvm.org/viewvc/llvm-project?rev=280732&view=rev" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project?rev=280732&view=rev</a><br>
Log:<br>
Add an c++ itanium demangler to llvm.<br>
<br>
This adds a copy of the demangler in libcxxabi.<br>
<br>
The code also has no dependencies on anything else in LLVM. To enforce<br>
that I added it as another library. That way a BUILD_SHARED_LIBS will<br>
fail if anyone adds an use of StringRef for example.<br>
<br>
The no llvm dependency combined with the fact that this has to build<br>
on linux, OS X and Windows required a few changes to the code. In<br>
particular:<br>
<br>
No constexpr.<br>
No alignas<br>
<br>
On OS X at least this library has only one global symbol:<br>
__ZN4llvm16itanium_<wbr>demangleEPKcPcPmPi<br>
<br>
My current plan is:<br>
<br>
Commit something like this<br>
Change lld to use it<br>
Change lldb to use it as the fallback<br>
<br>
Add a few #ifdefs so that exactly the same file can be used in<br>
libcxxabi to export abi::__cxa_demangle.<br>
<br>
Once the fast demangler in lldb can handle any names this<br>
implementation can be replaced with it and we will have the one true<br>
demangler.<br>
<br>
Added:<br>
llvm/trunk/include/llvm/<wbr>Demangle/<br>
llvm/trunk/include/llvm/<wbr>Demangle/Demangle.h<br>
llvm/trunk/lib/Demangle/<br>
llvm/trunk/lib/Demangle/<wbr>CMakeLists.txt<br>
llvm/trunk/lib/Demangle/<wbr>ItaniumDemangle.cpp<br>
llvm/trunk/lib/Demangle/<wbr>LLVMBuild.txt<br>
- copied, changed from r280727, llvm/trunk/lib/Support/<wbr>LLVMBuild.txt<br>
llvm/trunk/test/Demangle/<br>
llvm/trunk/test/Demangle/lit.<wbr>local.cfg<br>
llvm/trunk/test/Demangle/<wbr>simple.test<br>
llvm/trunk/tools/llvm-cxxfilt/<br>
llvm/trunk/tools/llvm-cxxfilt/<wbr>CMakeLists.txt<br>
llvm/trunk/tools/llvm-cxxfilt/<wbr>llvm-cxxfilt.cpp<br>
Modified:<br>
llvm/trunk/cmake/config-ix.<wbr>cmake<br>
llvm/trunk/include/llvm/<wbr>Config/config.h.cmake<br>
llvm/trunk/lib/CMakeLists.txt<br>
llvm/trunk/lib/LLVMBuild.txt<br>
llvm/trunk/lib/Support/<wbr>LLVMBuild.txt<br>
llvm/trunk/lib/Support/Unix/<wbr>Signals.inc<br>
llvm/trunk/test/CMakeLists.txt<br>
llvm/trunk/test/lit.cfg<br>
llvm/trunk/test/tools/llvm-<wbr>objdump/X86/macho-symbolized-<wbr>disassembly.test<br>
llvm/trunk/tools/llvm-objdump/<wbr>CMakeLists.txt<br>
llvm/trunk/tools/llvm-objdump/<wbr>LLVMBuild.txt<br>
llvm/trunk/tools/llvm-objdump/<wbr>MachODump.cpp<br>
<br>
Modified: llvm/trunk/cmake/config-ix.<wbr>cmake<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/cmake/config-ix.cmake?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/cmake/<wbr>config-ix.cmake?rev=280732&r1=<wbr>280731&r2=280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/cmake/config-ix.<wbr>cmake (original)<br>
+++ llvm/trunk/cmake/config-ix.<wbr>cmake Tue Sep 6 14:16:48 2016<br>
@@ -82,13 +82,6 @@ check_include_file(mach/mach.h HAVE_MACH<br>
check_include_file(mach-o/<wbr>dyld.h HAVE_MACH_O_DYLD_H)<br>
check_include_file(histedit.h HAVE_HISTEDIT_H)<br>
<br>
-# size_t must be defined before including cxxabi.h on FreeBSD 10.0.<br>
-check_cxx_source_compiles("<br>
-#include <stddef.h><br>
-#include <cxxabi.h><br>
-int main() { return 0; }<br>
-" HAVE_CXXABI_H)<br>
-<br>
# library checks<br>
if( NOT PURE_WINDOWS )<br>
check_library_exists(pthread pthread_create "" HAVE_LIBPTHREAD)<br>
<br>
Modified: llvm/trunk/include/llvm/<wbr>Config/config.h.cmake<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Config/config.h.cmake?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/include/<wbr>llvm/Config/config.h.cmake?<wbr>rev=280732&r1=280731&r2=<wbr>280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/include/llvm/<wbr>Config/config.h.cmake (original)<br>
+++ llvm/trunk/include/llvm/<wbr>Config/config.h.cmake Tue Sep 6 14:16:48 2016<br>
@@ -28,9 +28,6 @@<br>
/* Define to 1 if you have the `closedir' function. */<br>
#cmakedefine HAVE_CLOSEDIR ${HAVE_CLOSEDIR}<br>
<br>
-/* Define to 1 if you have the <cxxabi.h> header file. */<br>
-#cmakedefine HAVE_CXXABI_H ${HAVE_CXXABI_H}<br>
-<br>
/* Define to 1 if you have the <CrashReporterClient.h> header file. */<br>
#undef HAVE_CRASHREPORTERCLIENT_H<br>
<br>
<br>
Added: llvm/trunk/include/llvm/<wbr>Demangle/Demangle.h<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Demangle/Demangle.h?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/include/<wbr>llvm/Demangle/Demangle.h?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/include/llvm/<wbr>Demangle/Demangle.h (added)<br>
+++ llvm/trunk/include/llvm/<wbr>Demangle/Demangle.h Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,28 @@<br>
+//===--- Demangle.h ------------------------------<wbr>---------------*- C++ -*-===//<br>
+//<br>
+// The LLVM Compiler Infrastructure<br>
+//<br>
+// This file is distributed under the University of Illinois Open Source<br>
+// License. See LICENSE.TXT for details.<br>
+//<br>
+//===------------------------<wbr>------------------------------<wbr>----------------===//<br>
+<br>
+#include <cstddef><br>
+<br>
+namespace llvm {<br>
+/// This is a llvm local version of __cxa_demangle. Other than the name and<br>
+/// being in the llvm namespace it is identical.<br>
+///<br>
+/// The mangled_name is demangled into buf and returned. If the buffer is not<br>
+/// large enough, realloc is used to expand it.<br>
+///<br>
+/// The *status will be set to<br>
+/// unknown_error: -4<br>
+/// invalid_args: -3<br>
+/// invalid_mangled_name: -2<br>
+/// memory_alloc_failure: -1<br>
+/// success: 0<br>
+<br>
+char *itaniumDemangle(const char *mangled_name, char *buf, size_t *n,<br>
+ int *status);<br>
+}<br>
<br>
Modified: llvm/trunk/lib/CMakeLists.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/CMakeLists.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>CMakeLists.txt?rev=280732&r1=<wbr>280731&r2=280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/CMakeLists.txt (original)<br>
+++ llvm/trunk/lib/CMakeLists.txt Tue Sep 6 14:16:48 2016<br>
@@ -1,5 +1,6 @@<br>
# `Support' and `TableGen' libraries are added on the top-level CMakeLists.txt<br>
<br>
+add_subdirectory(Demangle)<br>
add_subdirectory(IR)<br>
add_subdirectory(IRReader)<br>
add_subdirectory(CodeGen)<br>
<br>
Added: llvm/trunk/lib/Demangle/<wbr>CMakeLists.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Demangle/CMakeLists.txt?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>Demangle/CMakeLists.txt?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/Demangle/<wbr>CMakeLists.txt (added)<br>
+++ llvm/trunk/lib/Demangle/<wbr>CMakeLists.txt Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,3 @@<br>
+add_llvm_library(LLVMDemangle<br>
+ ItaniumDemangle.cpp<br>
+)<br>
<br>
Added: llvm/trunk/lib/Demangle/<wbr>ItaniumDemangle.cpp<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Demangle/ItaniumDemangle.cpp?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>Demangle/ItaniumDemangle.cpp?<wbr>rev=280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/Demangle/<wbr>ItaniumDemangle.cpp (added)<br>
+++ llvm/trunk/lib/Demangle/<wbr>ItaniumDemangle.cpp Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,4431 @@<br>
+//===- ItaniumDemangle.cpp ------------------------------<wbr>------------------===//<br>
+//<br>
+// The LLVM Compiler Infrastructure<br>
+//<br>
+// This file is dual licensed under the MIT and the University of Illinois Open<br>
+// Source Licenses. See LICENSE.TXT for details.<br>
+//<br>
+//===------------------------<wbr>------------------------------<wbr>----------------===//<br>
+<br>
+#include <llvm/Demangle/Demangle.h><br>
+<br>
+// This file exports a single function: llvm::itanium_demangle.<br>
+// It also has no dependencies on the rest of llvm. It is implemented this way<br>
+// so that it can be easily reused in libcxxabi.<br>
+<br>
+#include <algorithm><br>
+#include <cctype><br>
+#include <cstdlib><br>
+#include <cstring><br>
+#include <numeric><br>
+#include <string><br>
+#include <vector><br>
+<br>
+#ifdef _MSC_VER<br>
+// snprintf is implemented in VS 2015<br>
+#if _MSC_VER < 1900<br>
+#define snprintf _snprintf_s<br>
+#endif<br>
+#endif<br>
+<br>
+enum {<br>
+ unknown_error = -4,<br>
+ invalid_args = -3,<br>
+ invalid_mangled_name,<br>
+ memory_alloc_failure,<br>
+ success<br>
+};<br>
+<br>
+template <class C><br>
+static const char *parse_type(const char *first, const char *last, C &db);<br>
+template <class C><br>
+static const char *parse_encoding(const char *first, const char *last, C &db);<br>
+template <class C><br>
+static const char *parse_name(const char *first, const char *last, C &db,<br>
+ bool *ends_with_template_args = 0);<br>
+template <class C><br>
+static const char *parse_expression(const char *first, const char *last, C &db);<br>
+template <class C><br>
+static const char *parse_template_args(const char *first, const char *last,<br>
+ C &db);<br>
+template <class C><br>
+static const char *parse_operator_name(const char *first, const char *last,<br>
+ C &db);<br>
+template <class C><br>
+static const char *parse_unqualified_name(const char *first, const char *last,<br>
+ C &db);<br>
+template <class C><br>
+static const char *parse_decltype(const char *first, const char *last, C &db);<br>
+<br>
+// <number> ::= [n] <non-negative decimal integer><br>
+<br>
+static const char *parse_number(const char *first, const char *last) {<br>
+ if (first != last) {<br>
+ const char *t = first;<br>
+ if (*t == 'n')<br>
+ ++t;<br>
+ if (t != last) {<br>
+ if (*t == '0') {<br>
+ first = t + 1;<br>
+ } else if ('1' <= *t && *t <= '9') {<br>
+ first = t + 1;<br>
+ while (first != last && std::isdigit(*first))<br>
+ ++first;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+namespace {<br>
+template <class Float> struct float_data;<br>
+<br>
+template <> struct float_data<float> {<br>
+ static const size_t mangled_size = 8;<br>
+ static const size_t max_demangled_size = 24;<br>
+ static const char *spec;<br>
+};<br>
+const char *float_data<float>::spec = "%af";<br>
+<br>
+template <> struct float_data<double> {<br>
+ static const size_t mangled_size = 16;<br>
+ static const size_t max_demangled_size = 32;<br>
+ static const char *spec;<br>
+};<br>
+<br>
+const char *float_data<double>::spec = "%a";<br>
+<br>
+template <> struct float_data<long double> {<br>
+#if defined(__mips__) && defined(__mips_n64) || defined(__aarch64__) || \<br>
+ defined(__wasm__)<br>
+ static const size_t mangled_size = 32;<br>
+#elif defined(__arm__) || defined(__mips__) || defined(__hexagon__)<br>
+ static const size_t mangled_size = 16;<br>
+#else<br>
+ static const size_t mangled_size =<br>
+ 20; // May need to be adjusted to 16 or 24 on other platforms<br>
+#endif<br>
+ static const size_t max_demangled_size = 40;<br>
+ static const char *spec;<br>
+};<br>
+<br>
+const char *float_data<long double>::spec = "%LaL";<br>
+}<br>
+<br>
+template <class Float, class C><br>
+static const char *parse_floating_number(const char *first, const char *last,<br>
+ C &db) {<br>
+ const size_t N = float_data<Float>::mangled_<wbr>size;<br>
+ if (static_cast<std::size_t>(last - first) > N) {<br>
+ last = first + N;<br>
+ union {<br>
+ Float value;<br>
+ char buf[sizeof(Float)];<br>
+ };<br>
+ const char *t = first;<br>
+ char *e = buf;<br>
+ for (; t != last; ++t, ++e) {<br>
+ if (!isxdigit(*t))<br>
+ return first;<br>
+ unsigned d1 = isdigit(*t) ? static_cast<unsigned>(*t - '0')<br>
+ : static_cast<unsigned>(*t - 'a' + 10);<br>
+ ++t;<br>
+ unsigned d0 = isdigit(*t) ? static_cast<unsigned>(*t - '0')<br>
+ : static_cast<unsigned>(*t - 'a' + 10);<br>
+ *e = static_cast<char>((d1 << 4) + d0);<br>
+ }<br>
+ if (*t == 'E') {<br>
+#if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__<br>
+ std::reverse(buf, e);<br>
+#endif<br>
+ char num[float_data<Float>::max_<wbr>demangled_size] = {0};<br>
+ int n = snprintf(num, sizeof(num), float_data<Float>::spec, value);<br>
+ if (static_cast<std::size_t>(n) >= sizeof(num))<br>
+ return first;<br>
+ db.names.push_back(typename C::String(num, static_cast<std::size_t>(n)));<br>
+ first = t + 1;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <source-name> ::= <positive length number> <identifier><br>
+<br>
+template <class C><br>
+static const char *parse_source_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ char c = *first;<br>
+ if (isdigit(c) && first + 1 != last) {<br>
+ const char *t = first + 1;<br>
+ size_t n = static_cast<size_t>(c - '0');<br>
+ for (c = *t; isdigit(c); c = *t) {<br>
+ n = n * 10 + static_cast<size_t>(c - '0');<br>
+ if (++t == last)<br>
+ return first;<br>
+ }<br>
+ if (static_cast<size_t>(last - t) >= n) {<br>
+ typename C::String r(t, n);<br>
+ if (r.substr(0, 10) == "_GLOBAL__N")<br>
+ db.names.push_back("(anonymous namespace)");<br>
+ else<br>
+ db.names.push_back(std::move(<wbr>r));<br>
+ first = t + n;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <substitution> ::= S <seq-id> _<br>
+// ::= S_<br>
+// <substitution> ::= Sa # ::std::allocator<br>
+// <substitution> ::= Sb # ::std::basic_string<br>
+// <substitution> ::= Ss # ::std::basic_string < char,<br>
+// ::std::char_traits<char>,<br>
+// ::std::allocator<char> ><br>
+// <substitution> ::= Si # ::std::basic_istream<char, std::char_traits<char> ><br>
+// <substitution> ::= So # ::std::basic_ostream<char, std::char_traits<char> ><br>
+// <substitution> ::= Sd # ::std::basic_iostream<char, std::char_traits<char> ><br>
+<br>
+template <class C><br>
+static const char *parse_substitution(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2) {<br>
+ if (*first == 'S') {<br>
+ switch (first[1]) {<br>
+ case 'a':<br>
+ db.names.push_back("std::<wbr>allocator");<br>
+ first += 2;<br>
+ break;<br>
+ case 'b':<br>
+ db.names.push_back("std::<wbr>basic_string");<br>
+ first += 2;<br>
+ break;<br>
+ case 's':<br>
+ db.names.push_back("std::<wbr>string");<br>
+ first += 2;<br>
+ break;<br>
+ case 'i':<br>
+ db.names.push_back("std::<wbr>istream");<br>
+ first += 2;<br>
+ break;<br>
+ case 'o':<br>
+ db.names.push_back("std::<wbr>ostream");<br>
+ first += 2;<br>
+ break;<br>
+ case 'd':<br>
+ db.names.push_back("std::<wbr>iostream");<br>
+ first += 2;<br>
+ break;<br>
+ case '_':<br>
+ if (!db.subs.empty()) {<br>
+ for (const auto &n : db.subs.front())<br>
+ db.names.push_back(n);<br>
+ first += 2;<br>
+ }<br>
+ break;<br>
+ default:<br>
+ if (std::isdigit(first[1]) || std::isupper(first[1])) {<br>
+ size_t sub = 0;<br>
+ const char *t = first + 1;<br>
+ if (std::isdigit(*t))<br>
+ sub = static_cast<size_t>(*t - '0');<br>
+ else<br>
+ sub = static_cast<size_t>(*t - 'A') + 10;<br>
+ for (++t; t != last && (std::isdigit(*t) || std::isupper(*t)); ++t) {<br>
+ sub *= 36;<br>
+ if (std::isdigit(*t))<br>
+ sub += static_cast<size_t>(*t - '0');<br>
+ else<br>
+ sub += static_cast<size_t>(*t - 'A') + 10;<br>
+ }<br>
+ if (t == last || *t != '_')<br>
+ return first;<br>
+ ++sub;<br>
+ if (sub < db.subs.size()) {<br>
+ for (const auto &n : db.subs[sub])<br>
+ db.names.push_back(n);<br>
+ first = t + 1;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <builtin-type> ::= v # void<br>
+// ::= w # wchar_t<br>
+// ::= b # bool<br>
+// ::= c # char<br>
+// ::= a # signed char<br>
+// ::= h # unsigned char<br>
+// ::= s # short<br>
+// ::= t # unsigned short<br>
+// ::= i # int<br>
+// ::= j # unsigned int<br>
+// ::= l # long<br>
+// ::= m # unsigned long<br>
+// ::= x # long long, __int64<br>
+// ::= y # unsigned long long, __int64<br>
+// ::= n # __int128<br>
+// ::= o # unsigned __int128<br>
+// ::= f # float<br>
+// ::= d # double<br>
+// ::= e # long double, __float80<br>
+// ::= g # __float128<br>
+// ::= z # ellipsis<br>
+// ::= Dd # IEEE 754r decimal floating point (64 bits)<br>
+// ::= De # IEEE 754r decimal floating point (128 bits)<br>
+// ::= Df # IEEE 754r decimal floating point (32 bits)<br>
+// ::= Dh # IEEE 754r half-precision floating point (16 bits)<br>
+// ::= Di # char32_t<br>
+// ::= Ds # char16_t<br>
+// ::= Da # auto (in dependent new-expressions)<br>
+// ::= Dc # decltype(auto)<br>
+// ::= Dn # std::nullptr_t (i.e., decltype(nullptr))<br>
+// ::= u <source-name> # vendor extended type<br>
+<br>
+template <class C><br>
+static const char *parse_builtin_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ switch (*first) {<br>
+ case 'v':<br>
+ db.names.push_back("void");<br>
+ ++first;<br>
+ break;<br>
+ case 'w':<br>
+ db.names.push_back("wchar_t");<br>
+ ++first;<br>
+ break;<br>
+ case 'b':<br>
+ db.names.push_back("bool");<br>
+ ++first;<br>
+ break;<br>
+ case 'c':<br>
+ db.names.push_back("char");<br>
+ ++first;<br>
+ break;<br>
+ case 'a':<br>
+ db.names.push_back("signed char");<br>
+ ++first;<br>
+ break;<br>
+ case 'h':<br>
+ db.names.push_back("unsigned char");<br>
+ ++first;<br>
+ break;<br>
+ case 's':<br>
+ db.names.push_back("short");<br>
+ ++first;<br>
+ break;<br>
+ case 't':<br>
+ db.names.push_back("unsigned short");<br>
+ ++first;<br>
+ break;<br>
+ case 'i':<br>
+ db.names.push_back("int");<br>
+ ++first;<br>
+ break;<br>
+ case 'j':<br>
+ db.names.push_back("unsigned int");<br>
+ ++first;<br>
+ break;<br>
+ case 'l':<br>
+ db.names.push_back("long");<br>
+ ++first;<br>
+ break;<br>
+ case 'm':<br>
+ db.names.push_back("unsigned long");<br>
+ ++first;<br>
+ break;<br>
+ case 'x':<br>
+ db.names.push_back("long long");<br>
+ ++first;<br>
+ break;<br>
+ case 'y':<br>
+ db.names.push_back("unsigned long long");<br>
+ ++first;<br>
+ break;<br>
+ case 'n':<br>
+ db.names.push_back("__int128")<wbr>;<br>
+ ++first;<br>
+ break;<br>
+ case 'o':<br>
+ db.names.push_back("unsigned __int128");<br>
+ ++first;<br>
+ break;<br>
+ case 'f':<br>
+ db.names.push_back("float");<br>
+ ++first;<br>
+ break;<br>
+ case 'd':<br>
+ db.names.push_back("double");<br>
+ ++first;<br>
+ break;<br>
+ case 'e':<br>
+ db.names.push_back("long double");<br>
+ ++first;<br>
+ break;<br>
+ case 'g':<br>
+ db.names.push_back("__<wbr>float128");<br>
+ ++first;<br>
+ break;<br>
+ case 'z':<br>
+ db.names.push_back("...");<br>
+ ++first;<br>
+ break;<br>
+ case 'u': {<br>
+ const char *t = parse_source_name(first + 1, last, db);<br>
+ if (t != first + 1)<br>
+ first = t;<br>
+ } break;<br>
+ case 'D':<br>
+ if (first + 1 != last) {<br>
+ switch (first[1]) {<br>
+ case 'd':<br>
+ db.names.push_back("decimal64"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'e':<br>
+ db.names.push_back("<wbr>decimal128");<br>
+ first += 2;<br>
+ break;<br>
+ case 'f':<br>
+ db.names.push_back("decimal32"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'h':<br>
+ db.names.push_back("decimal16"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'i':<br>
+ db.names.push_back("char32_t")<wbr>;<br>
+ first += 2;<br>
+ break;<br>
+ case 's':<br>
+ db.names.push_back("char16_t")<wbr>;<br>
+ first += 2;<br>
+ break;<br>
+ case 'a':<br>
+ db.names.push_back("auto");<br>
+ first += 2;<br>
+ break;<br>
+ case 'c':<br>
+ db.names.push_back("decltype(<wbr>auto)");<br>
+ first += 2;<br>
+ break;<br>
+ case 'n':<br>
+ db.names.push_back("std::<wbr>nullptr_t");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <CV-qualifiers> ::= [r] [V] [K]<br>
+<br>
+static const char *parse_cv_qualifiers(const char *first, const char *last,<br>
+ unsigned &cv) {<br>
+ cv = 0;<br>
+ if (first != last) {<br>
+ if (*first == 'r') {<br>
+ cv |= 4;<br>
+ ++first;<br>
+ }<br>
+ if (*first == 'V') {<br>
+ cv |= 2;<br>
+ ++first;<br>
+ }<br>
+ if (*first == 'K') {<br>
+ cv |= 1;<br>
+ ++first;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <template-param> ::= T_ # first template parameter<br>
+// ::= T <parameter-2 non-negative number> _<br>
+<br>
+template <class C><br>
+static const char *parse_template_param(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2) {<br>
+ if (*first == 'T') {<br>
+ if (first[1] == '_') {<br>
+ if (db.template_param.empty())<br>
+ return first;<br>
+ if (!db.template_param.back().<wbr>empty()) {<br>
+ for (auto &t : db.template_param.back().<wbr>front())<br>
+ db.names.push_back(t);<br>
+ first += 2;<br>
+ } else {<br>
+ db.names.push_back("T_");<br>
+ first += 2;<br>
+ db.fix_forward_references = true;<br>
+ }<br>
+ } else if (isdigit(first[1])) {<br>
+ const char *t = first + 1;<br>
+ size_t sub = static_cast<size_t>(*t - '0');<br>
+ for (++t; t != last && isdigit(*t); ++t) {<br>
+ sub *= 10;<br>
+ sub += static_cast<size_t>(*t - '0');<br>
+ }<br>
+ if (t == last || *t != '_' || db.template_param.empty())<br>
+ return first;<br>
+ ++sub;<br>
+ if (sub < db.template_param.back().size(<wbr>)) {<br>
+ for (auto &temp : db.template_param.back()[sub])<br>
+ db.names.push_back(temp);<br>
+ first = t + 1;<br>
+ } else {<br>
+ db.names.push_back(typename C::String(first, t + 1));<br>
+ first = t + 1;<br>
+ db.fix_forward_references = true;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// cc <type> <expression> # const_cast<type><br>
+// (expression)<br>
+<br>
+template <class C><br>
+static const char *parse_const_cast_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'c' && first[1] == 'c') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto expr = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() =<br>
+ "const_cast<" + db.names.back().move_full() + ">(" + expr + ")";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// dc <type> <expression> # dynamic_cast<type><br>
+// (expression)<br>
+<br>
+template <class C><br>
+static const char *parse_dynamic_cast_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'd' && first[1] == 'c') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto expr = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() =<br>
+ "dynamic_cast<" + db.names.back().move_full() + ">(" + expr + ")";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// rc <type> <expression> # reinterpret_cast<type><br>
+// (expression)<br>
+<br>
+template <class C><br>
+static const char *parse_reinterpret_cast_expr(<wbr>const char *first,<br>
+ const char *last, C &db) {<br>
+ if (last - first >= 3 && first[0] == 'r' && first[1] == 'c') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto expr = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "reinterpret_cast<" + db.names.back().move_full() +<br>
+ ">(" + expr + ")";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// sc <type> <expression> # static_cast<type><br>
+// (expression)<br>
+<br>
+template <class C><br>
+static const char *parse_static_cast_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 'c') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto expr = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back() =<br>
+ "static_cast<" + db.names.back().move_full() + ">(" + expr + ")";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// sp <expression> # pack expansion<br>
+<br>
+template <class C><br>
+static const char *parse_pack_expansion(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 'p') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// st <type> # sizeof (a type)<br>
+<br>
+template <class C><br>
+static const char *parse_sizeof_type_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 't') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "sizeof (" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// sz <expr> # sizeof (a expression)<br>
+<br>
+template <class C><br>
+static const char *parse_sizeof_expr_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 'z') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "sizeof (" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// sZ <template-param> # size of a parameter<br>
+// pack<br>
+<br>
+template <class C><br>
+static const char *parse_sizeof_param_pack_expr(<wbr>const char *first,<br>
+ const char *last, C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 'Z' &&<br>
+ first[2] == 'T') {<br>
+ size_t k0 = db.names.size();<br>
+ const char *t = parse_template_param(first + 2, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first + 2) {<br>
+ typename C::String tmp("sizeof...(");<br>
+ size_t k = k0;<br>
+ if (k != k1) {<br>
+ tmp += db.names[k].move_full();<br>
+ for (++k; k != k1; ++k)<br>
+ tmp += ", " + db.names[k].move_full();<br>
+ }<br>
+ tmp += ")";<br>
+ for (; k1 != k0; --k1)<br>
+ db.names.pop_back();<br>
+ db.names.push_back(std::move(<wbr>tmp));<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <function-param> ::= fp <top-level CV-qualifiers> _ # L == 0, first parameter<br>
+// ::= fp <top-level CV-qualifiers> <parameter-2 non-negative<br>
+// number> _ # L == 0, second and later parameters<br>
+// ::= fL <L-1 non-negative number> p <top-level CV-qualifiers><br>
+// _ # L > 0, first parameter<br>
+// ::= fL <L-1 non-negative number> p <top-level CV-qualifiers><br>
+// <parameter-2 non-negative number> _ # L > 0, second and<br>
+// later parameters<br>
+<br>
+template <class C><br>
+static const char *parse_function_param(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && *first == 'f') {<br>
+ if (first[1] == 'p') {<br>
+ unsigned cv;<br>
+ const char *t = parse_cv_qualifiers(first + 2, last, cv);<br>
+ const char *t1 = parse_number(t, last);<br>
+ if (t1 != last && *t1 == '_') {<br>
+ db.names.push_back("fp" + typename C::String(t, t1));<br>
+ first = t1 + 1;<br>
+ }<br>
+ } else if (first[1] == 'L') {<br>
+ unsigned cv;<br>
+ const char *t0 = parse_number(first + 2, last);<br>
+ if (t0 != last && *t0 == 'p') {<br>
+ ++t0;<br>
+ const char *t = parse_cv_qualifiers(t0, last, cv);<br>
+ const char *t1 = parse_number(t, last);<br>
+ if (t1 != last && *t1 == '_') {<br>
+ db.names.push_back("fp" + typename C::String(t, t1));<br>
+ first = t1 + 1;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// sZ <function-param> # size of a function<br>
+// parameter pack<br>
+<br>
+template <class C><br>
+static const char *parse_sizeof_function_param_<wbr>pack_expr(const char *first,<br>
+ const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 's' && first[1] == 'Z' &&<br>
+ first[2] == 'f') {<br>
+ const char *t = parse_function_param(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "sizeof...(" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// te <expression> # typeid (expression)<br>
+// ti <type> # typeid (type)<br>
+<br>
+template <class C><br>
+static const char *parse_typeid_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 't' &&<br>
+ (first[1] == 'e' || first[1] == 'i')) {<br>
+ const char *t;<br>
+ if (first[1] == 'e')<br>
+ t = parse_expression(first + 2, last, db);<br>
+ else<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "typeid(" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// tw <expression> # throw expression<br>
+<br>
+template <class C><br>
+static const char *parse_throw_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 't' && first[1] == 'w') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "throw " + db.names.back().move_full();<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// ds <expression> <expression> # expr.*expr<br>
+<br>
+template <class C><br>
+static const char *parse_dot_star_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'd' && first[1] == 's') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto expr = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += ".*" + expr;<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <simple-id> ::= <source-name> [ <template-args> ]<br>
+<br>
+template <class C><br>
+static const char *parse_simple_id(const char *first, const char *last, C &db) {<br>
+ if (first != last) {<br>
+ const char *t = parse_source_name(first, last, db);<br>
+ if (t != first) {<br>
+ const char *t1 = parse_template_args(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ }<br>
+ first = t1;<br>
+ } else<br>
+ first = t;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <unresolved-type> ::= <template-param><br>
+// ::= <decltype><br>
+// ::= <substitution><br>
+<br>
+template <class C><br>
+static const char *parse_unresolved_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ const char *t = first;<br>
+ switch (*first) {<br>
+ case 'T': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_template_param(first, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first && k1 == k0 + 1) {<br>
+ db.subs.push_back(<br>
+ typename C::sub_type(1, db.names.back(), db.names.get_allocator()));<br>
+ first = t;<br>
+ } else {<br>
+ for (; k1 != k0; --k1)<br>
+ db.names.pop_back();<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 'D':<br>
+ t = parse_decltype(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(<br>
+ typename C::sub_type(1, db.names.back(), db.names.get_allocator()));<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'S':<br>
+ t = parse_substitution(first, last, db);<br>
+ if (t != first)<br>
+ first = t;<br>
+ else {<br>
+ if (last - first > 2 && first[1] == 't') {<br>
+ t = parse_unqualified_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "std::");<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <destructor-name> ::= <unresolved-type> # e.g.,<br>
+// ~T or ~decltype(f())<br>
+// ::= <simple-id> # e.g.,<br>
+// ~A<2*N><br>
+<br>
+template <class C><br>
+static const char *parse_destructor_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ const char *t = parse_unresolved_type(first, last, db);<br>
+ if (t == first)<br>
+ t = parse_simple_id(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "~");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <base-unresolved-name> ::= <simple-id> #<br>
+// unresolved name<br>
+// extension ::= <operator-name> #<br>
+// unresolved operator-function-id<br>
+// extension ::= <operator-name> <template-args> #<br>
+// unresolved operator template-id<br>
+// ::= on <operator-name> #<br>
+// unresolved operator-function-id<br>
+// ::= on <operator-name> <template-args> #<br>
+// unresolved operator template-id<br>
+// ::= dn <destructor-name> #<br>
+// destructor or pseudo-destructor;<br>
+// #<br>
+// e.g.<br>
+// ~X or<br>
+// ~X<N-1><br>
+<br>
+template <class C><br>
+static const char *parse_base_unresolved_name(<wbr>const char *first,<br>
+ const char *last, C &db) {<br>
+ if (last - first >= 2) {<br>
+ if ((first[0] == 'o' || first[0] == 'd') && first[1] == 'n') {<br>
+ if (first[0] == 'o') {<br>
+ const char *t = parse_operator_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ first = parse_template_args(t, last, db);<br>
+ if (first != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ }<br>
+ }<br>
+ } else {<br>
+ const char *t = parse_destructor_name(first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ }<br>
+ } else {<br>
+ const char *t = parse_simple_id(first, last, db);<br>
+ if (t == first) {<br>
+ t = parse_operator_name(first, last, db);<br>
+ if (t != first) {<br>
+ first = parse_template_args(t, last, db);<br>
+ if (first != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ }<br>
+ }<br>
+ } else<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <unresolved-qualifier-level> ::= <simple-id><br>
+<br>
+template <class C><br>
+static const char *parse_unresolved_qualifier_<wbr>level(const char *first,<br>
+ const char *last, C &db) {<br>
+ return parse_simple_id(first, last, db);<br>
+}<br>
+<br>
+// <unresolved-name><br>
+// extension ::= srN <unresolved-type> [<template-args>]<br>
+// <unresolved-qualifier-level>* E <base-unresolved-name><br>
+// ::= [gs] <base-unresolved-name> # x or<br>
+// (with "gs") ::x<br>
+// ::= [gs] sr <unresolved-qualifier-level>+ E<br>
+// <base-unresolved-name><br>
+// # A::x,<br>
+// N::y,<br>
+// A<T>::z;<br>
+// "gs"<br>
+// means<br>
+// leading<br>
+// "::"<br>
+// ::= sr <unresolved-type> <base-unresolved-name> # T::x<br>
+// / decltype(p)::x<br>
+// extension ::= sr <unresolved-type> <template-args><br>
+// <base-unresolved-name><br>
+// #<br>
+// T::N::x<br>
+// /decltype(p)::N::x<br>
+// (ignored) ::= srN <unresolved-type> <unresolved-qualifier-level>+ E<br>
+// <base-unresolved-name><br>
+<br>
+template <class C><br>
+static const char *parse_unresolved_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first > 2) {<br>
+ const char *t = first;<br>
+ bool global = false;<br>
+ if (t[0] == 'g' && t[1] == 's') {<br>
+ global = true;<br>
+ t += 2;<br>
+ }<br>
+ const char *t2 = parse_base_unresolved_name(t, last, db);<br>
+ if (t2 != t) {<br>
+ if (global) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "::");<br>
+ }<br>
+ first = t2;<br>
+ } else if (last - t > 2 && t[0] == 's' && t[1] == 'r') {<br>
+ if (t[2] == 'N') {<br>
+ t += 3;<br>
+ const char *t1 = parse_unresolved_type(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ t = t1;<br>
+ t1 = parse_template_args(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ t = t1;<br>
+ if (t == last) {<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ }<br>
+ while (*t != 'E') {<br>
+ t1 = parse_unresolved_qualifier_<wbr>level(t, last, db);<br>
+ if (t1 == t || t1 == last || db.names.size() < 2)<br>
+ return first;<br>
+ auto s = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "::" + std::move(s);<br>
+ t = t1;<br>
+ }<br>
+ ++t;<br>
+ t1 = parse_base_unresolved_name(t, last, db);<br>
+ if (t1 == t) {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto s = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "::" + std::move(s);<br>
+ first = t1;<br>
+ } else {<br>
+ t += 2;<br>
+ const char *t1 = parse_unresolved_type(t, last, db);<br>
+ if (t1 != t) {<br>
+ t = t1;<br>
+ t1 = parse_template_args(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ t = t1;<br>
+ }<br>
+ t1 = parse_base_unresolved_name(t, last, db);<br>
+ if (t1 == t) {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto s = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "::" + std::move(s);<br>
+ first = t1;<br>
+ } else {<br>
+ t1 = parse_unresolved_qualifier_<wbr>level(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ t = t1;<br>
+ if (global) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "::");<br>
+ }<br>
+ while (*t != 'E') {<br>
+ t1 = parse_unresolved_qualifier_<wbr>level(t, last, db);<br>
+ if (t1 == t || t1 == last || db.names.size() < 2)<br>
+ return first;<br>
+ auto s = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "::" + std::move(s);<br>
+ t = t1;<br>
+ }<br>
+ ++t;<br>
+ t1 = parse_base_unresolved_name(t, last, db);<br>
+ if (t1 == t) {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto s = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "::" + std::move(s);<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// dt <expression> <unresolved-name> # <a href="http://expr.name" rel="noreferrer" target="_blank">expr.name</a><br>
+<br>
+template <class C><br>
+static const char *parse_dot_expr(const char *first, const char *last, C &db) {<br>
+ if (last - first >= 3 && first[0] == 'd' && first[1] == 't') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_unresolved_name(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += "." + name;<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// cl <expression>+ E # call<br>
+<br>
+template <class C><br>
+static const char *parse_call_expr(const char *first, const char *last, C &db) {<br>
+ if (last - first >= 4 && first[0] == 'c' && first[1] == 'l') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (t == last)<br>
+ return first;<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += db.names.back().second;<br>
+ db.names.back().second = typename C::String();<br>
+ db.names.back().first.append("<wbr>(");<br>
+ bool first_expr = true;<br>
+ while (*t != 'E') {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (!tmp.empty()) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!first_expr) {<br>
+ db.names.back().first.append("<wbr>, ");<br>
+ first_expr = false;<br>
+ }<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ }<br>
+ t = t1;<br>
+ }<br>
+ ++t;<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>)");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// [gs] nw <expression>* _ <type> E # new (expr-list) type<br>
+// [gs] nw <expression>* _ <type> <initializer> # new (expr-list) type<br>
+// (init)<br>
+// [gs] na <expression>* _ <type> E # new[] (expr-list) type<br>
+// [gs] na <expression>* _ <type> <initializer> # new[] (expr-list) type<br>
+// (init)<br>
+// <initializer> ::= pi <expression>* E # parenthesized<br>
+// initialization<br>
+<br>
+template <class C><br>
+static const char *parse_new_expr(const char *first, const char *last, C &db) {<br>
+ if (last - first >= 4) {<br>
+ const char *t = first;<br>
+ bool parsed_gs = false;<br>
+ if (t[0] == 'g' && t[1] == 's') {<br>
+ t += 2;<br>
+ parsed_gs = true;<br>
+ }<br>
+ if (t[0] == 'n' && (t[1] == 'w' || t[1] == 'a')) {<br>
+ bool is_array = t[1] == 'a';<br>
+ t += 2;<br>
+ if (t == last)<br>
+ return first;<br>
+ bool has_expr_list = false;<br>
+ bool first_expr = true;<br>
+ while (*t != '_') {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ has_expr_list = true;<br>
+ if (!first_expr) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (!tmp.empty()) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>, ");<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ first_expr = false;<br>
+ }<br>
+ }<br>
+ t = t1;<br>
+ }<br>
+ ++t;<br>
+ const char *t1 = parse_type(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ t = t1;<br>
+ bool has_init = false;<br>
+ if (last - t >= 3 && t[0] == 'p' && t[1] == 'i') {<br>
+ t += 2;<br>
+ has_init = true;<br>
+ first_expr = true;<br>
+ while (*t != 'E') {<br>
+ t1 = parse_expression(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ if (!first_expr) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (!tmp.empty()) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>, ");<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ first_expr = false;<br>
+ }<br>
+ }<br>
+ t = t1;<br>
+ }<br>
+ }<br>
+ if (*t != 'E')<br>
+ return first;<br>
+ typename C::String init_list;<br>
+ if (has_init) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ init_list = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ }<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ auto type = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ typename C::String expr_list;<br>
+ if (has_expr_list) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ expr_list = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ }<br>
+ typename C::String r;<br>
+ if (parsed_gs)<br>
+ r = "::";<br>
+ if (is_array)<br>
+ r += "[] ";<br>
+ else<br>
+ r += " ";<br>
+ if (has_expr_list)<br>
+ r += "(" + expr_list + ") ";<br>
+ r += type;<br>
+ if (has_init)<br>
+ r += " (" + init_list + ")";<br>
+ db.names.push_back(std::move(<wbr>r));<br>
+ first = t + 1;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// cv <type> <expression> # conversion with one<br>
+// argument<br>
+// cv <type> _ <expression>* E # conversion with a<br>
+// different number of arguments<br>
+<br>
+template <class C><br>
+static const char *parse_conversion_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'c' && first[1] == 'v') {<br>
+ bool try_to_parse_template_args = db.try_to_parse_template_args;<br>
+ db.try_to_parse_template_args = false;<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ db.try_to_parse_template_args = try_to_parse_template_args;<br>
+ if (t != first + 2 && t != last) {<br>
+ if (*t != '_') {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 == t)<br>
+ return first;<br>
+ t = t1;<br>
+ } else {<br>
+ ++t;<br>
+ if (t == last)<br>
+ return first;<br>
+ if (*t == 'E')<br>
+ db.names.emplace_back();<br>
+ else {<br>
+ bool first_expr = true;<br>
+ while (*t != 'E') {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ if (!first_expr) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (!tmp.empty()) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>, ");<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ first_expr = false;<br>
+ }<br>
+ }<br>
+ t = t1;<br>
+ }<br>
+ }<br>
+ ++t;<br>
+ }<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back() = "(" + db.names.back().move_full() + ")(" + tmp + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// pt <expression> <expression> # expr->name<br>
+<br>
+template <class C><br>
+static const char *parse_arrow_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'p' && first[1] == 't') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t1 = parse_expression(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += "->";<br>
+ db.names.back().first += tmp;<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <ref-qualifier> ::= R # & ref-qualifier<br>
+// <ref-qualifier> ::= O # && ref-qualifier<br>
+<br>
+// <function-type> ::= F [Y] <bare-function-type> [<ref-qualifier>] E<br>
+<br>
+template <class C><br>
+static const char *parse_function_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last && *first == 'F') {<br>
+ const char *t = first + 1;<br>
+ if (t != last) {<br>
+ if (*t == 'Y') {<br>
+ /* extern "C" */<br>
+ if (++t == last)<br>
+ return first;<br>
+ }<br>
+ const char *t1 = parse_type(t, last, db);<br>
+ if (t1 != t) {<br>
+ t = t1;<br>
+ typename C::String sig("(");<br>
+ int ref_qual = 0;<br>
+ while (true) {<br>
+ if (t == last) {<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (*t == 'E') {<br>
+ ++t;<br>
+ break;<br>
+ }<br>
+ if (*t == 'v') {<br>
+ ++t;<br>
+ continue;<br>
+ }<br>
+ if (*t == 'R' && t + 1 != last && t[1] == 'E') {<br>
+ ref_qual = 1;<br>
+ ++t;<br>
+ continue;<br>
+ }<br>
+ if (*t == 'O' && t + 1 != last && t[1] == 'E') {<br>
+ ref_qual = 2;<br>
+ ++t;<br>
+ continue;<br>
+ }<br>
+ size_t k0 = db.names.size();<br>
+ t1 = parse_type(t, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (sig.size() > 1)<br>
+ sig += ", ";<br>
+ sig += db.names[k].move_full();<br>
+ }<br>
+ for (size_t k = k0; k < k1; ++k)<br>
+ db.names.pop_back();<br>
+ t = t1;<br>
+ }<br>
+ sig += ")";<br>
+ switch (ref_qual) {<br>
+ case 1:<br>
+ sig += " &";<br>
+ break;<br>
+ case 2:<br>
+ sig += " &&";<br>
+ break;<br>
+ }<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += " ";<br>
+ db.names.back().second.insert(<wbr>0, sig);<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <pointer-to-member-type> ::= M <class type> <member type><br>
+<br>
+template <class C><br>
+static const char *parse_pointer_to_member_type(<wbr>const char *first,<br>
+ const char *last, C &db) {<br>
+ if (first != last && *first == 'M') {<br>
+ const char *t = parse_type(first + 1, last, db);<br>
+ if (t != first + 1) {<br>
+ const char *t2 = parse_type(t, last, db);<br>
+ if (t2 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto func = std::move(db.names.back());<br>
+ db.names.pop_back();<br>
+ auto class_type = std::move(db.names.back());<br>
+ if (!func.second.empty() && func.second.front() == '(') {<br>
+ db.names.back().first =<br>
+ std::move(func.first) + "(" + class_type.move_full() + "::*";<br>
+ db.names.back().second = ")" + std::move(func.second);<br>
+ } else {<br>
+ db.names.back().first =<br>
+ std::move(func.first) + " " + class_type.move_full() + "::*";<br>
+ db.names.back().second = std::move(func.second);<br>
+ }<br>
+ first = t2;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <array-type> ::= A <positive dimension number> _ <element type><br>
+// ::= A [<dimension expression>] _ <element type><br>
+<br>
+template <class C><br>
+static const char *parse_array_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last && *first == 'A' && first + 1 != last) {<br>
+ if (first[1] == '_') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (db.names.back().second.<wbr>substr(0, 2) == " [")<br>
+ db.names.back().second.erase(<wbr>0, 1);<br>
+ db.names.back().second.insert(<wbr>0, " []");<br>
+ first = t;<br>
+ }<br>
+ } else if ('1' <= first[1] && first[1] <= '9') {<br>
+ const char *t = parse_number(first + 1, last);<br>
+ if (t != last && *t == '_') {<br>
+ const char *t2 = parse_type(t + 1, last, db);<br>
+ if (t2 != t + 1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (db.names.back().second.<wbr>substr(0, 2) == " [")<br>
+ db.names.back().second.erase(<wbr>0, 1);<br>
+ db.names.back().second.insert(<br>
+ 0, " [" + typename C::String(first + 1, t) + "]");<br>
+ first = t2;<br>
+ }<br>
+ }<br>
+ } else {<br>
+ const char *t = parse_expression(first + 1, last, db);<br>
+ if (t != first + 1 && t != last && *t == '_') {<br>
+ const char *t2 = parse_type(++t, last, db);<br>
+ if (t2 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto type = std::move(db.names.back());<br>
+ db.names.pop_back();<br>
+ auto expr = std::move(db.names.back());<br>
+ db.names.back().first = std::move(type.first);<br>
+ if (type.second.substr(0, 2) == " [")<br>
+ type.second.erase(0, 1);<br>
+ db.names.back().second =<br>
+ " [" + expr.move_full() + "]" + std::move(type.second);<br>
+ first = t2;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <decltype> ::= Dt <expression> E # decltype of an id-expression or class<br>
+// member access (C++0x)<br>
+// ::= DT <expression> E # decltype of an expression (C++0x)<br>
+<br>
+template <class C><br>
+static const char *parse_decltype(const char *first, const char *last, C &db) {<br>
+ if (last - first >= 4 && first[0] == 'D') {<br>
+ switch (first[1]) {<br>
+ case 't':<br>
+ case 'T': {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2 && t != last && *t == 'E') {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "decltype(" + db.names.back().move_full() + ")";<br>
+ first = t + 1;<br>
+ }<br>
+ } break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// extension:<br>
+// <vector-type> ::= Dv <positive dimension number> _<br>
+// <extended element type><br>
+// ::= Dv [<dimension expression>] _ <element type><br>
+// <extended element type> ::= <element type><br>
+// ::= p # AltiVec vector pixel<br>
+<br>
+template <class C><br>
+static const char *parse_vector_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first > 3 && first[0] == 'D' && first[1] == 'v') {<br>
+ if ('1' <= first[2] && first[2] <= '9') {<br>
+ const char *t = parse_number(first + 2, last);<br>
+ if (t == last || *t != '_')<br>
+ return first;<br>
+ const char *num = first + 2;<br>
+ size_t sz = static_cast<size_t>(t - num);<br>
+ if (++t != last) {<br>
+ if (*t != 'p') {<br>
+ const char *t1 = parse_type(t, last, db);<br>
+ if (t1 != t) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first +=<br>
+ " vector[" + typename C::String(num, sz) + "]";<br>
+ first = t1;<br>
+ }<br>
+ } else {<br>
+ ++t;<br>
+ db.names.push_back("pixel vector[" + typename C::String(num, sz) +<br>
+ "]");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ } else {<br>
+ typename C::String num;<br>
+ const char *t1 = first + 2;<br>
+ if (*t1 != '_') {<br>
+ const char *t = parse_expression(t1, last, db);<br>
+ if (t != t1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ num = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ t1 = t;<br>
+ }<br>
+ }<br>
+ if (t1 != last && *t1 == '_' && ++t1 != last) {<br>
+ const char *t = parse_type(t1, last, db);<br>
+ if (t != t1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += " vector[" + num + "]";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <type> ::= <builtin-type><br>
+// ::= <function-type><br>
+// ::= <class-enum-type><br>
+// ::= <array-type><br>
+// ::= <pointer-to-member-type><br>
+// ::= <template-param><br>
+// ::= <template-template-param> <template-args><br>
+// ::= <decltype><br>
+// ::= <substitution><br>
+// ::= <CV-qualifiers> <type><br>
+// ::= P <type> # pointer-to<br>
+// ::= R <type> # reference-to<br>
+// ::= O <type> # rvalue reference-to (C++0x)<br>
+// ::= C <type> # complex pair (C 2000)<br>
+// ::= G <type> # imaginary (C 2000)<br>
+// ::= Dp <type> # pack expansion (C++0x)<br>
+// ::= U <source-name> <type> # vendor extended type qualifier<br>
+// extension := U <objc-name> <objc-type> # objc-type<identifier><br>
+// extension := <vector-type> # <vector-type> starts with Dv<br>
+<br>
+// <objc-name> ::= <k0 number> objcproto <k1 number> <identifier> # k0 = 9 +<br>
+// <number of digits in k1> + k1<br>
+// <objc-type> := <source-name> # PU<11+>objcproto 11objc_object<source-name><br>
+// 11objc_object -> id<source-name><br>
+<br>
+template <class C><br>
+static const char *parse_type(const char *first, const char *last, C &db) {<br>
+ if (first != last) {<br>
+ switch (*first) {<br>
+ case 'r':<br>
+ case 'V':<br>
+ case 'K': {<br>
+ unsigned cv = 0;<br>
+ const char *t = parse_cv_qualifiers(first, last, cv);<br>
+ if (t != first) {<br>
+ bool is_function = *t == 'F';<br>
+ size_t k0 = db.names.size();<br>
+ const char *t1 = parse_type(t, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t1 != t) {<br>
+ if (is_function)<br>
+ db.subs.pop_back();<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (is_function) {<br>
+ size_t p = db.names[k].second.size();<br>
+ if (db.names[k].second[p - 2] == '&')<br>
+ p -= 3;<br>
+ else if (db.names[k].second.back() == '&')<br>
+ p -= 2;<br>
+ if (cv & 1) {<br>
+ db.names[k].second.insert(p, " const");<br>
+ p += 6;<br>
+ }<br>
+ if (cv & 2) {<br>
+ db.names[k].second.insert(p, " volatile");<br>
+ p += 9;<br>
+ }<br>
+ if (cv & 4)<br>
+ db.names[k].second.insert(p, " restrict");<br>
+ } else {<br>
+ if (cv & 1)<br>
+ db.names[k].first.append(" const");<br>
+ if (cv & 2)<br>
+ db.names[k].first.append(" volatile");<br>
+ if (cv & 4)<br>
+ db.names[k].first.append(" restrict");<br>
+ }<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ }<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ } break;<br>
+ default: {<br>
+ const char *t = parse_builtin_type(first, last, db);<br>
+ if (t != first) {<br>
+ first = t;<br>
+ } else {<br>
+ switch (*first) {<br>
+ case 'A':<br>
+ t = parse_array_type(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ first = t;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ }<br>
+ break;<br>
+ case 'C':<br>
+ t = parse_type(first + 1, last, db);<br>
+ if (t != first + 1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append(" complex");<br>
+ first = t;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ }<br>
+ break;<br>
+ case 'F':<br>
+ t = parse_function_type(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ first = t;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ }<br>
+ break;<br>
+ case 'G':<br>
+ t = parse_type(first + 1, last, db);<br>
+ if (t != first + 1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append(" imaginary");<br>
+ first = t;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ }<br>
+ break;<br>
+ case 'M':<br>
+ t = parse_pointer_to_member_type(<wbr>first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ first = t;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ }<br>
+ break;<br>
+ case 'O': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_type(first + 1, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first + 1) {<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (db.names[k].second.substr(0, 2) == " [") {<br>
+ db.names[k].first += " (";<br>
+ db.names[k].second.insert(0, ")");<br>
+ } else if (!db.names[k].second.empty() &&<br>
+ db.names[k].second.front() == '(') {<br>
+ db.names[k].first += "(";<br>
+ db.names[k].second.insert(0, ")");<br>
+ }<br>
+ db.names[k].first.append("&&")<wbr>;<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ }<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 'P': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_type(first + 1, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first + 1) {<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (db.names[k].second.substr(0, 2) == " [") {<br>
+ db.names[k].first += " (";<br>
+ db.names[k].second.insert(0, ")");<br>
+ } else if (!db.names[k].second.empty() &&<br>
+ db.names[k].second.front() == '(') {<br>
+ db.names[k].first += "(";<br>
+ db.names[k].second.insert(0, ")");<br>
+ }<br>
+ if (first[1] != 'U' ||<br>
+ db.names[k].first.substr(0, 12) != "objc_object<") {<br>
+ db.names[k].first.append("*");<br>
+ } else {<br>
+ db.names[k].first.replace(0, 11, "id");<br>
+ }<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ }<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 'R': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_type(first + 1, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first + 1) {<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (db.names[k].second.substr(0, 2) == " [") {<br>
+ db.names[k].first += " (";<br>
+ db.names[k].second.insert(0, ")");<br>
+ } else if (!db.names[k].second.empty() &&<br>
+ db.names[k].second.front() == '(') {<br>
+ db.names[k].first += "(";<br>
+ db.names[k].second.insert(0, ")");<br>
+ }<br>
+ db.names[k].first.append("&");<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ }<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 'T': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_template_param(first, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first) {<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k)<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ if (db.try_to_parse_template_args && k1 == k0 + 1) {<br>
+ const char *t1 = parse_template_args(t, last, db);<br>
+ if (t1 != t) {<br>
+ auto args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += std::move(args);<br>
+ db.subs.push_back(typename C::sub_type(<br>
+ 1, db.names.back(), db.names.get_allocator()));<br>
+ t = t1;<br>
+ }<br>
+ }<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 'U':<br>
+ if (first + 1 != last) {<br>
+ t = parse_source_name(first + 1, last, db);<br>
+ if (t != first + 1) {<br>
+ const char *t2 = parse_type(t, last, db);<br>
+ if (t2 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto type = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.back().first.substr(<wbr>0, 9) != "objcproto") {<br>
+ db.names.back() = type + " " + db.names.back().move_full();<br>
+ } else {<br>
+ auto proto = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ t = parse_source_name(proto.data() + 9,<br>
+ proto.data() + proto.size(), db);<br>
+ if (t != proto.data() + 9) {<br>
+ db.names.back() =<br>
+ type + "<" + db.names.back().move_full() + ">";<br>
+ } else {<br>
+ db.names.push_back(type + " " + proto);<br>
+ }<br>
+ }<br>
+ db.subs.push_back(typename C::sub_type(<br>
+ 1, db.names.back(), db.names.get_allocator()));<br>
+ first = t2;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'S':<br>
+ if (first + 1 != last && first[1] == 't') {<br>
+ t = parse_name(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ first = t;<br>
+ }<br>
+ } else {<br>
+ t = parse_substitution(first, last, db);<br>
+ if (t != first) {<br>
+ first = t;<br>
+ // Parsed a substitution. If the substitution is a<br>
+ // <template-param> it might be followed by <template-args>.<br>
+ t = parse_template_args(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto template_args = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first += template_args;<br>
+ // Need to create substitution for <template-template-param><br>
+ // <template-args><br>
+ db.subs.push_back(typename C::sub_type(<br>
+ 1, db.names.back(), db.names.get_allocator()));<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'D':<br>
+ if (first + 1 != last) {<br>
+ switch (first[1]) {<br>
+ case 'p': {<br>
+ size_t k0 = db.names.size();<br>
+ t = parse_type(first + 2, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t != first + 2) {<br>
+ db.subs.emplace_back(db.names.<wbr>get_allocator());<br>
+ for (size_t k = k0; k < k1; ++k)<br>
+ db.subs.back().push_back(db.<wbr>names[k]);<br>
+ first = t;<br>
+ return first;<br>
+ }<br>
+ break;<br>
+ }<br>
+ case 't':<br>
+ case 'T':<br>
+ t = parse_decltype(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(typename C::sub_type(<br>
+ 1, db.names.back(), db.names.get_allocator()));<br>
+ first = t;<br>
+ return first;<br>
+ }<br>
+ break;<br>
+ case 'v':<br>
+ t = parse_vector_type(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(typename C::sub_type(<br>
+ 1, db.names.back(), db.names.get_allocator()));<br>
+ first = t;<br>
+ return first;<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ // drop through<br>
+ default:<br>
+ // must check for builtin-types before class-enum-types to avoid<br>
+ // ambiguities with operator-names<br>
+ t = parse_builtin_type(first, last, db);<br>
+ if (t != first) {<br>
+ first = t;<br>
+ } else {<br>
+ t = parse_name(first, last, db);<br>
+ if (t != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <operator-name><br>
+// ::= aa # &&<br>
+// ::= ad # & (unary)<br>
+// ::= an # &<br>
+// ::= aN # &=<br>
+// ::= aS # =<br>
+// ::= cl # ()<br>
+// ::= cm # ,<br>
+// ::= co # ~<br>
+// ::= cv <type> # (cast)<br>
+// ::= da # delete[]<br>
+// ::= de # * (unary)<br>
+// ::= dl # delete<br>
+// ::= dv # /<br>
+// ::= dV # /=<br>
+// ::= eo # ^<br>
+// ::= eO # ^=<br>
+// ::= eq # ==<br>
+// ::= ge # >=<br>
+// ::= gt # ><br>
+// ::= ix # []<br>
+// ::= le # <=<br>
+// ::= li <source-name> # operator ""<br>
+// ::= ls # <<<br>
+// ::= lS # <<=<br>
+// ::= lt # <<br>
+// ::= mi # -<br>
+// ::= mI # -=<br>
+// ::= ml # *<br>
+// ::= mL # *=<br>
+// ::= mm # -- (postfix in <expression> context)<br>
+// ::= na # new[]<br>
+// ::= ne # !=<br>
+// ::= ng # - (unary)<br>
+// ::= nt # !<br>
+// ::= nw # new<br>
+// ::= oo # ||<br>
+// ::= or # |<br>
+// ::= oR # |=<br>
+// ::= pm # ->*<br>
+// ::= pl # +<br>
+// ::= pL # +=<br>
+// ::= pp # ++ (postfix in <expression> context)<br>
+// ::= ps # + (unary)<br>
+// ::= pt # -><br>
+// ::= qu # ?<br>
+// ::= rm # %<br>
+// ::= rM # %=<br>
+// ::= rs # >><br>
+// ::= rS # >>=<br>
+// ::= v <digit> <source-name> # vendor extended<br>
+// operator<br>
+<br>
+template <class C><br>
+static const char *parse_operator_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2) {<br>
+ switch (first[0]) {<br>
+ case 'a':<br>
+ switch (first[1]) {<br>
+ case 'a':<br>
+ db.names.push_back("operator&&<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'd':<br>
+ case 'n':<br>
+ db.names.push_back("operator&"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'N':<br>
+ db.names.push_back("operator&=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'S':<br>
+ db.names.push_back("operator="<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'c':<br>
+ switch (first[1]) {<br>
+ case 'l':<br>
+ db.names.push_back("operator()<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'm':<br>
+ db.names.push_back("operator,"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'o':<br>
+ db.names.push_back("operator~"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'v': {<br>
+ bool try_to_parse_template_args = db.try_to_parse_template_args;<br>
+ db.try_to_parse_template_args = false;<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ db.try_to_parse_template_args = try_to_parse_template_args;<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "operator ");<br>
+ db.parsed_ctor_dtor_cv = true;<br>
+ first = t;<br>
+ }<br>
+ } break;<br>
+ }<br>
+ break;<br>
+ case 'd':<br>
+ switch (first[1]) {<br>
+ case 'a':<br>
+ db.names.push_back("operator delete[]");<br>
+ first += 2;<br>
+ break;<br>
+ case 'e':<br>
+ db.names.push_back("operator*"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'l':<br>
+ db.names.push_back("operator delete");<br>
+ first += 2;<br>
+ break;<br>
+ case 'v':<br>
+ db.names.push_back("operator/"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'V':<br>
+ db.names.push_back("operator/=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'e':<br>
+ switch (first[1]) {<br>
+ case 'o':<br>
+ db.names.push_back("operator^"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'O':<br>
+ db.names.push_back("operator^=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'q':<br>
+ db.names.push_back("operator==<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'g':<br>
+ switch (first[1]) {<br>
+ case 'e':<br>
+ db.names.push_back("operator>=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 't':<br>
+ db.names.push_back("operator>"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'i':<br>
+ if (first[1] == 'x') {<br>
+ db.names.push_back("operator[]<wbr>");<br>
+ first += 2;<br>
+ }<br>
+ break;<br>
+ case 'l':<br>
+ switch (first[1]) {<br>
+ case 'e':<br>
+ db.names.push_back("operator<=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'i': {<br>
+ const char *t = parse_source_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "operator\"\" ");<br>
+ first = t;<br>
+ }<br>
+ } break;<br>
+ case 's':<br>
+ db.names.push_back("operator<<<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'S':<br>
+ db.names.push_back("operator<<<wbr>=");<br>
+ first += 2;<br>
+ break;<br>
+ case 't':<br>
+ db.names.push_back("operator<"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'm':<br>
+ switch (first[1]) {<br>
+ case 'i':<br>
+ db.names.push_back("operator-"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'I':<br>
+ db.names.push_back("operator-=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'l':<br>
+ db.names.push_back("operator*"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'L':<br>
+ db.names.push_back("operator*=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'm':<br>
+ db.names.push_back("operator--<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'n':<br>
+ switch (first[1]) {<br>
+ case 'a':<br>
+ db.names.push_back("operator new[]");<br>
+ first += 2;<br>
+ break;<br>
+ case 'e':<br>
+ db.names.push_back("operator!=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'g':<br>
+ db.names.push_back("operator-"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 't':<br>
+ db.names.push_back("operator!"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'w':<br>
+ db.names.push_back("operator new");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'o':<br>
+ switch (first[1]) {<br>
+ case 'o':<br>
+ db.names.push_back("operator||<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'r':<br>
+ db.names.push_back("operator|"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'R':<br>
+ db.names.push_back("operator|=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'p':<br>
+ switch (first[1]) {<br>
+ case 'm':<br>
+ db.names.push_back("operator-><wbr>*");<br>
+ first += 2;<br>
+ break;<br>
+ case 'l':<br>
+ db.names.push_back("operator+"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'L':<br>
+ db.names.push_back("operator+=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'p':<br>
+ db.names.push_back("operator++<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 's':<br>
+ db.names.push_back("operator+"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 't':<br>
+ db.names.push_back("operator-><wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'q':<br>
+ if (first[1] == 'u') {<br>
+ db.names.push_back("operator?"<wbr>);<br>
+ first += 2;<br>
+ }<br>
+ break;<br>
+ case 'r':<br>
+ switch (first[1]) {<br>
+ case 'm':<br>
+ db.names.push_back("operator%"<wbr>);<br>
+ first += 2;<br>
+ break;<br>
+ case 'M':<br>
+ db.names.push_back("operator%=<wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 's':<br>
+ db.names.push_back("operator>><wbr>");<br>
+ first += 2;<br>
+ break;<br>
+ case 'S':<br>
+ db.names.push_back("operator>><wbr>=");<br>
+ first += 2;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'v':<br>
+ if (std::isdigit(first[1])) {<br>
+ const char *t = parse_source_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "operator ");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+template <class C><br>
+static const char *parse_integer_literal(const char *first, const char *last,<br>
+ const typename C::String &lit, C &db) {<br>
+ const char *t = parse_number(first, last);<br>
+ if (t != first && t != last && *t == 'E') {<br>
+ if (lit.size() > 3)<br>
+ db.names.push_back("(" + lit + ")");<br>
+ else<br>
+ db.names.emplace_back();<br>
+ if (*first == 'n') {<br>
+ db.names.back().first += '-';<br>
+ ++first;<br>
+ }<br>
+ db.names.back().first.append(<wbr>first, t);<br>
+ if (lit.size() <= 3)<br>
+ db.names.back().first += lit;<br>
+ first = t + 1;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <expr-primary> ::= L <type> <value number> E #<br>
+// integer literal<br>
+// ::= L <type> <value float> E #<br>
+// floating literal<br>
+// ::= L <string type> E #<br>
+// string literal<br>
+// ::= L <nullptr type> E #<br>
+// nullptr literal (i.e., "LDnE")<br>
+// ::= L <type> <real-part float> _ <imag-part float> E #<br>
+// complex floating point literal (C 2000)<br>
+// ::= L <mangled-name> E #<br>
+// external name<br>
+<br>
+template <class C><br>
+static const char *parse_expr_primary(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 4 && *first == 'L') {<br>
+ switch (first[1]) {<br>
+ case 'w': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "wchar_t", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'b':<br>
+ if (first[3] == 'E') {<br>
+ switch (first[2]) {<br>
+ case '0':<br>
+ db.names.push_back("false");<br>
+ first += 4;<br>
+ break;<br>
+ case '1':<br>
+ db.names.push_back("true");<br>
+ first += 4;<br>
+ break;<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'c': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "char", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'a': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "signed char", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'h': {<br>
+ const char *t =<br>
+ parse_integer_literal(first + 2, last, "unsigned char", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 's': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "short", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 't': {<br>
+ const char *t =<br>
+ parse_integer_literal(first + 2, last, "unsigned short", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'i': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'j': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "u", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'l': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "l", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'm': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "ul", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'x': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "ll", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'y': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "ull", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'n': {<br>
+ const char *t = parse_integer_literal(first + 2, last, "__int128", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'o': {<br>
+ const char *t =<br>
+ parse_integer_literal(first + 2, last, "unsigned __int128", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'f': {<br>
+ const char *t = parse_floating_number<float>(<wbr>first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'd': {<br>
+ const char *t = parse_floating_number<double>(<wbr>first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case 'e': {<br>
+ const char *t = parse_floating_number<long double>(first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ } break;<br>
+ case '_':<br>
+ if (first[2] == 'Z') {<br>
+ const char *t = parse_encoding(first + 3, last, db);<br>
+ if (t != first + 3 && t != last && *t == 'E')<br>
+ first = t + 1;<br>
+ }<br>
+ break;<br>
+ case 'T':<br>
+ // Invalid mangled name per<br>
+ // <a href="http://sourcerytools.com/pipermail/cxx-abi-dev/2011-August/002422.html" rel="noreferrer" target="_blank">http://sourcerytools.com/<wbr>pipermail/cxx-abi-dev/2011-<wbr>August/002422.html</a><br>
+ break;<br>
+ default: {<br>
+ // might be named type<br>
+ const char *t = parse_type(first + 1, last, db);<br>
+ if (t != first + 1 && t != last) {<br>
+ if (*t != 'E') {<br>
+ const char *n = t;<br>
+ for (; n != last && isdigit(*n); ++n)<br>
+ ;<br>
+ if (n != t && n != last && *n == 'E') {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "(" + db.names.back().move_full() + ")" +<br>
+ typename C::String(t, n);<br>
+ first = n + 1;<br>
+ break;<br>
+ }<br>
+ } else {<br>
+ first = t + 1;<br>
+ break;<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+template <class String> static String base_name(String &s) {<br>
+ if (s.empty())<br>
+ return s;<br>
+ if (s == "std::string") {<br>
+ s = "std::basic_string<char, std::char_traits<char>, std::allocator<char> "<br>
+ ">";<br>
+ return "basic_string";<br>
+ }<br>
+ if (s == "std::istream") {<br>
+ s = "std::basic_istream<char, std::char_traits<char> >";<br>
+ return "basic_istream";<br>
+ }<br>
+ if (s == "std::ostream") {<br>
+ s = "std::basic_ostream<char, std::char_traits<char> >";<br>
+ return "basic_ostream";<br>
+ }<br>
+ if (s == "std::iostream") {<br>
+ s = "std::basic_iostream<char, std::char_traits<char> >";<br>
+ return "basic_iostream";<br>
+ }<br>
+ const char *const pf = s.data();<br>
+ const char *pe = pf + s.size();<br>
+ if (pe[-1] == '>') {<br>
+ unsigned c = 1;<br>
+ while (true) {<br>
+ if (--pe == pf)<br>
+ return String();<br>
+ if (pe[-1] == '<') {<br>
+ if (--c == 0) {<br>
+ --pe;<br>
+ break;<br>
+ }<br>
+ } else if (pe[-1] == '>')<br>
+ ++c;<br>
+ }<br>
+ }<br>
+ if (pe - pf <= 1)<br>
+ return String();<br>
+ const char *p0 = pe - 1;<br>
+ for (; p0 != pf; --p0) {<br>
+ if (*p0 == ':') {<br>
+ ++p0;<br>
+ break;<br>
+ }<br>
+ }<br>
+ return String(p0, pe);<br>
+}<br>
+<br>
+// <ctor-dtor-name> ::= C1 # complete object constructor<br>
+// ::= C2 # base object constructor<br>
+// ::= C3 # complete object allocating constructor<br>
+// extension ::= C5 # ?<br>
+// ::= D0 # deleting destructor<br>
+// ::= D1 # complete object destructor<br>
+// ::= D2 # base object destructor<br>
+// extension ::= D5 # ?<br>
+<br>
+template <class C><br>
+static const char *parse_ctor_dtor_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2 && !db.names.empty()) {<br>
+ switch (first[0]) {<br>
+ case 'C':<br>
+ switch (first[1]) {<br>
+ case '1':<br>
+ case '2':<br>
+ case '3':<br>
+ case '5':<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.push_back(base_name(<wbr>db.names.back().first));<br>
+ first += 2;<br>
+ db.parsed_ctor_dtor_cv = true;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'D':<br>
+ switch (first[1]) {<br>
+ case '0':<br>
+ case '1':<br>
+ case '2':<br>
+ case '5':<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.push_back("~" + base_name(db.names.back().<wbr>first));<br>
+ first += 2;<br>
+ db.parsed_ctor_dtor_cv = true;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <unnamed-type-name> ::= Ut [ <nonnegative number> ] _<br>
+// ::= <closure-type-name><br>
+//<br>
+// <closure-type-name> ::= Ul <lambda-sig> E [ <nonnegative number> ] _<br>
+//<br>
+// <lambda-sig> ::= <parameter type>+ # Parameter types or "v" if the lambda<br>
+// has no parameters<br>
+<br>
+template <class C><br>
+static const char *parse_unnamed_type_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first > 2 && first[0] == 'U') {<br>
+ char type = first[1];<br>
+ switch (type) {<br>
+ case 't': {<br>
+ db.names.push_back(typename C::String("'unnamed"));<br>
+ const char *t0 = first + 2;<br>
+ if (t0 == last) {<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (std::isdigit(*t0)) {<br>
+ const char *t1 = t0 + 1;<br>
+ while (t1 != last && std::isdigit(*t1))<br>
+ ++t1;<br>
+ db.names.back().first.append(<wbr>t0, t1);<br>
+ t0 = t1;<br>
+ }<br>
+ db.names.back().first.push_<wbr>back('\'');<br>
+ if (t0 == last || *t0 != '_') {<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ first = t0 + 1;<br>
+ } break;<br>
+ case 'l': {<br>
+ db.names.push_back(typename C::String("'lambda'("));<br>
+ const char *t0 = first + 2;<br>
+ if (first[2] == 'v') {<br>
+ db.names.back().first += ')';<br>
+ ++t0;<br>
+ } else {<br>
+ const char *t1 = parse_type(t0, last, db);<br>
+ if (t1 == t0) {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ t0 = t1;<br>
+ while (true) {<br>
+ t1 = parse_type(t0, last, db);<br>
+ if (t1 == t0)<br>
+ break;<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (!tmp.empty()) {<br>
+ db.names.back().first.append("<wbr>, ");<br>
+ db.names.back().first.append(<wbr>tmp);<br>
+ }<br>
+ t0 = t1;<br>
+ }<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>)");<br>
+ }<br>
+ if (t0 == last || *t0 != 'E') {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ ++t0;<br>
+ if (t0 == last) {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ if (std::isdigit(*t0)) {<br>
+ const char *t1 = t0 + 1;<br>
+ while (t1 != last && std::isdigit(*t1))<br>
+ ++t1;<br>
+ db.names.back().first.insert(<wbr>db.names.back().first.begin() + 7, t0, t1);<br>
+ t0 = t1;<br>
+ }<br>
+ if (t0 == last || *t0 != '_') {<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ first = t0 + 1;<br>
+ } break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <unqualified-name> ::= <operator-name><br>
+// ::= <ctor-dtor-name><br>
+// ::= <source-name><br>
+// ::= <unnamed-type-name><br>
+<br>
+template <class C><br>
+static const char *parse_unqualified_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ const char *t;<br>
+ switch (*first) {<br>
+ case 'C':<br>
+ case 'D':<br>
+ t = parse_ctor_dtor_name(first, last, db);<br>
+ if (t != first)<br>
+ first = t;<br>
+ break;<br>
+ case 'U':<br>
+ t = parse_unnamed_type_name(first, last, db);<br>
+ if (t != first)<br>
+ first = t;<br>
+ break;<br>
+ case '1':<br>
+ case '2':<br>
+ case '3':<br>
+ case '4':<br>
+ case '5':<br>
+ case '6':<br>
+ case '7':<br>
+ case '8':<br>
+ case '9':<br>
+ t = parse_source_name(first, last, db);<br>
+ if (t != first)<br>
+ first = t;<br>
+ break;<br>
+ default:<br>
+ t = parse_operator_name(first, last, db);<br>
+ if (t != first)<br>
+ first = t;<br>
+ break;<br>
+ };<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <unscoped-name> ::= <unqualified-name><br>
+// ::= St <unqualified-name> # ::std::<br>
+// extension ::= StL<unqualified-name><br>
+<br>
+template <class C><br>
+static const char *parse_unscoped_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2) {<br>
+ const char *t0 = first;<br>
+ bool St = false;<br>
+ if (first[0] == 'S' && first[1] == 't') {<br>
+ t0 += 2;<br>
+ St = true;<br>
+ if (t0 != last && *t0 == 'L')<br>
+ ++t0;<br>
+ }<br>
+ const char *t1 = parse_unqualified_name(t0, last, db);<br>
+ if (t1 != t0) {<br>
+ if (St) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "std::");<br>
+ }<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// at <type> # alignof (a type)<br>
+<br>
+template <class C><br>
+static const char *parse_alignof_type(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'a' && first[1] == 't') {<br>
+ const char *t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first = "alignof (" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// az <expression> # alignof (a<br>
+// expression)<br>
+<br>
+template <class C><br>
+static const char *parse_alignof_expr(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 3 && first[0] == 'a' && first[1] == 'z') {<br>
+ const char *t = parse_expression(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first = "alignof (" + db.names.back().move_full() + ")";<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+template <class C><br>
+static const char *parse_noexcept_expression(<wbr>const char *first,<br>
+ const char *last, C &db) {<br>
+ const char *t1 = parse_expression(first, last, db);<br>
+ if (t1 != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first = "noexcept (" + db.names.back().move_full() + ")";<br>
+ first = t1;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+template <class C><br>
+static const char *parse_prefix_expression(const char *first, const char *last,<br>
+ const typename C::String &op,<br>
+ C &db) {<br>
+ const char *t1 = parse_expression(first, last, db);<br>
+ if (t1 != first) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first = op + "(" + db.names.back().move_full() + ")";<br>
+ first = t1;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+template <class C><br>
+static const char *parse_binary_expression(const char *first, const char *last,<br>
+ const typename C::String &op,<br>
+ C &db) {<br>
+ const char *t1 = parse_expression(first, last, db);<br>
+ if (t1 != first) {<br>
+ const char *t2 = parse_expression(t1, last, db);<br>
+ if (t2 != t1) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto op2 = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ auto op1 = db.names.back().move_full();<br>
+ auto &nm = db.names.back().first;<br>
+ nm.clear();<br>
+ if (op == ">")<br>
+ nm += '(';<br>
+ nm += "(" + op1 + ") " + op + " (" + op2 + ")";<br>
+ if (op == ">")<br>
+ nm += ')';<br>
+ first = t2;<br>
+ } else if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <expression> ::= <unary operator-name> <expression><br>
+// ::= <binary operator-name> <expression> <expression><br>
+// ::= <ternary operator-name> <expression> <expression><br>
+// <expression><br>
+// ::= cl <expression>+ E # call<br>
+// ::= cv <type> <expression> #<br>
+// conversion with one argument<br>
+// ::= cv <type> _ <expression>* E #<br>
+// conversion with a different number of arguments<br>
+// ::= [gs] nw <expression>* _ <type> E # new<br>
+// (expr-list) type<br>
+// ::= [gs] nw <expression>* _ <type> <initializer> # new<br>
+// (expr-list) type (init)<br>
+// ::= [gs] na <expression>* _ <type> E # new[]<br>
+// (expr-list) type<br>
+// ::= [gs] na <expression>* _ <type> <initializer> # new[]<br>
+// (expr-list) type (init)<br>
+// ::= [gs] dl <expression> #<br>
+// delete expression<br>
+// ::= [gs] da <expression> #<br>
+// delete[] expression<br>
+// ::= pp_ <expression> #<br>
+// prefix ++<br>
+// ::= mm_ <expression> #<br>
+// prefix --<br>
+// ::= ti <type> #<br>
+// typeid (type)<br>
+// ::= te <expression> #<br>
+// typeid (expression)<br>
+// ::= dc <type> <expression> #<br>
+// dynamic_cast<type> (expression)<br>
+// ::= sc <type> <expression> #<br>
+// static_cast<type> (expression)<br>
+// ::= cc <type> <expression> #<br>
+// const_cast<type> (expression)<br>
+// ::= rc <type> <expression> #<br>
+// reinterpret_cast<type> (expression)<br>
+// ::= st <type> #<br>
+// sizeof (a type)<br>
+// ::= sz <expression> #<br>
+// sizeof (an expression)<br>
+// ::= at <type> #<br>
+// alignof (a type)<br>
+// ::= az <expression> #<br>
+// alignof (an expression)<br>
+// ::= nx <expression> #<br>
+// noexcept (expression)<br>
+// ::= <template-param><br>
+// ::= <function-param><br>
+// ::= dt <expression> <unresolved-name> #<br>
+// <a href="http://expr.name" rel="noreferrer" target="_blank">expr.name</a><br>
+// ::= pt <expression> <unresolved-name> #<br>
+// expr->name<br>
+// ::= ds <expression> <expression> #<br>
+// expr.*expr<br>
+// ::= sZ <template-param> # size<br>
+// of a parameter pack<br>
+// ::= sZ <function-param> # size<br>
+// of a function parameter pack<br>
+// ::= sp <expression> # pack<br>
+// expansion<br>
+// ::= tw <expression> # throw<br>
+// expression<br>
+// ::= tr # throw<br>
+// with no operand (rethrow)<br>
+// ::= <unresolved-name> # f(p),<br>
+// N::f(p), ::f(p),<br>
+// #<br>
+// freestanding<br>
+// dependent<br>
+// name<br>
+// (e.g.,<br>
+// T::x),<br>
+// #<br>
+// objectless<br>
+// nonstatic<br>
+// member<br>
+// reference<br>
+// ::= <expr-primary><br>
+<br>
+template <class C><br>
+static const char *parse_expression(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2) {<br>
+ const char *t = first;<br>
+ bool parsed_gs = false;<br>
+ if (last - first >= 4 && t[0] == 'g' && t[1] == 's') {<br>
+ t += 2;<br>
+ parsed_gs = true;<br>
+ }<br>
+ switch (*t) {<br>
+ case 'L':<br>
+ first = parse_expr_primary(first, last, db);<br>
+ break;<br>
+ case 'T':<br>
+ first = parse_template_param(first, last, db);<br>
+ break;<br>
+ case 'f':<br>
+ first = parse_function_param(first, last, db);<br>
+ break;<br>
+ case 'a':<br>
+ switch (t[1]) {<br>
+ case 'a':<br>
+ t = parse_binary_expression(first + 2, last, "&&", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'd':<br>
+ t = parse_prefix_expression(first + 2, last, "&", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'n':<br>
+ t = parse_binary_expression(first + 2, last, "&", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'N':<br>
+ t = parse_binary_expression(first + 2, last, "&=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'S':<br>
+ t = parse_binary_expression(first + 2, last, "=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 't':<br>
+ first = parse_alignof_type(first, last, db);<br>
+ break;<br>
+ case 'z':<br>
+ first = parse_alignof_expr(first, last, db);<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'c':<br>
+ switch (t[1]) {<br>
+ case 'c':<br>
+ first = parse_const_cast_expr(first, last, db);<br>
+ break;<br>
+ case 'l':<br>
+ first = parse_call_expr(first, last, db);<br>
+ break;<br>
+ case 'm':<br>
+ t = parse_binary_expression(first + 2, last, ",", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'o':<br>
+ t = parse_prefix_expression(first + 2, last, "~", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'v':<br>
+ first = parse_conversion_expr(first, last, db);<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'd':<br>
+ switch (t[1]) {<br>
+ case 'a': {<br>
+ const char *t1 = parse_expression(t + 2, last, db);<br>
+ if (t1 != t + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first =<br>
+ (parsed_gs ? typename C::String("::") : typename C::String()) +<br>
+ "delete[] " + db.names.back().move_full();<br>
+ first = t1;<br>
+ }<br>
+ } break;<br>
+ case 'c':<br>
+ first = parse_dynamic_cast_expr(first, last, db);<br>
+ break;<br>
+ case 'e':<br>
+ t = parse_prefix_expression(first + 2, last, "*", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'l': {<br>
+ const char *t1 = parse_expression(t + 2, last, db);<br>
+ if (t1 != t + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first =<br>
+ (parsed_gs ? typename C::String("::") : typename C::String()) +<br>
+ "delete " + db.names.back().move_full();<br>
+ first = t1;<br>
+ }<br>
+ } break;<br>
+ case 'n':<br>
+ return parse_unresolved_name(first, last, db);<br>
+ case 's':<br>
+ first = parse_dot_star_expr(first, last, db);<br>
+ break;<br>
+ case 't':<br>
+ first = parse_dot_expr(first, last, db);<br>
+ break;<br>
+ case 'v':<br>
+ t = parse_binary_expression(first + 2, last, "/", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'V':<br>
+ t = parse_binary_expression(first + 2, last, "/=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'e':<br>
+ switch (t[1]) {<br>
+ case 'o':<br>
+ t = parse_binary_expression(first + 2, last, "^", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'O':<br>
+ t = parse_binary_expression(first + 2, last, "^=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'q':<br>
+ t = parse_binary_expression(first + 2, last, "==", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'g':<br>
+ switch (t[1]) {<br>
+ case 'e':<br>
+ t = parse_binary_expression(first + 2, last, ">=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 't':<br>
+ t = parse_binary_expression(first + 2, last, ">", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'i':<br>
+ if (t[1] == 'x') {<br>
+ const char *t1 = parse_expression(first + 2, last, db);<br>
+ if (t1 != first + 2) {<br>
+ const char *t2 = parse_expression(t1, last, db);<br>
+ if (t2 != t1) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto op2 = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ auto op1 = db.names.back().move_full();<br>
+ db.names.back() = "(" + op1 + ")[" + op2 + "]";<br>
+ first = t2;<br>
+ } else if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'l':<br>
+ switch (t[1]) {<br>
+ case 'e':<br>
+ t = parse_binary_expression(first + 2, last, "<=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 's':<br>
+ t = parse_binary_expression(first + 2, last, "<<", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'S':<br>
+ t = parse_binary_expression(first + 2, last, "<<=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 't':<br>
+ t = parse_binary_expression(first + 2, last, "<", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'm':<br>
+ switch (t[1]) {<br>
+ case 'i':<br>
+ t = parse_binary_expression(first + 2, last, "-", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'I':<br>
+ t = parse_binary_expression(first + 2, last, "-=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'l':<br>
+ t = parse_binary_expression(first + 2, last, "*", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'L':<br>
+ t = parse_binary_expression(first + 2, last, "*=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'm':<br>
+ if (first + 2 != last && first[2] == '_') {<br>
+ t = parse_prefix_expression(first + 3, last, "--", db);<br>
+ if (t != first + 3)<br>
+ first = t;<br>
+ } else {<br>
+ const char *t1 = parse_expression(first + 2, last, db);<br>
+ if (t1 != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "(" + db.names.back().move_full() + ")--";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'n':<br>
+ switch (t[1]) {<br>
+ case 'a':<br>
+ case 'w':<br>
+ first = parse_new_expr(first, last, db);<br>
+ break;<br>
+ case 'e':<br>
+ t = parse_binary_expression(first + 2, last, "!=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'g':<br>
+ t = parse_prefix_expression(first + 2, last, "-", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 't':<br>
+ t = parse_prefix_expression(first + 2, last, "!", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'x':<br>
+ t = parse_noexcept_expression(<wbr>first + 2, last, db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'o':<br>
+ switch (t[1]) {<br>
+ case 'n':<br>
+ return parse_unresolved_name(first, last, db);<br>
+ case 'o':<br>
+ t = parse_binary_expression(first + 2, last, "||", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'r':<br>
+ t = parse_binary_expression(first + 2, last, "|", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'R':<br>
+ t = parse_binary_expression(first + 2, last, "|=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'p':<br>
+ switch (t[1]) {<br>
+ case 'm':<br>
+ t = parse_binary_expression(first + 2, last, "->*", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'l':<br>
+ t = parse_binary_expression(first + 2, last, "+", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'L':<br>
+ t = parse_binary_expression(first + 2, last, "+=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'p':<br>
+ if (first + 2 != last && first[2] == '_') {<br>
+ t = parse_prefix_expression(first + 3, last, "++", db);<br>
+ if (t != first + 3)<br>
+ first = t;<br>
+ } else {<br>
+ const char *t1 = parse_expression(first + 2, last, db);<br>
+ if (t1 != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back() = "(" + db.names.back().move_full() + ")++";<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 's':<br>
+ t = parse_prefix_expression(first + 2, last, "+", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 't':<br>
+ first = parse_arrow_expr(first, last, db);<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'q':<br>
+ if (t[1] == 'u') {<br>
+ const char *t1 = parse_expression(first + 2, last, db);<br>
+ if (t1 != first + 2) {<br>
+ const char *t2 = parse_expression(t1, last, db);<br>
+ if (t2 != t1) {<br>
+ const char *t3 = parse_expression(t2, last, db);<br>
+ if (t3 != t2) {<br>
+ if (db.names.size() < 3)<br>
+ return first;<br>
+ auto op3 = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ auto op2 = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ auto op1 = db.names.back().move_full();<br>
+ db.names.back() = "(" + op1 + ") ? (" + op2 + ") : (" + op3 + ")";<br>
+ first = t3;<br>
+ } else {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ db.names.pop_back();<br>
+ db.names.pop_back();<br>
+ }<br>
+ } else if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'r':<br>
+ switch (t[1]) {<br>
+ case 'c':<br>
+ first = parse_reinterpret_cast_expr(<wbr>first, last, db);<br>
+ break;<br>
+ case 'm':<br>
+ t = parse_binary_expression(first + 2, last, "%", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'M':<br>
+ t = parse_binary_expression(first + 2, last, "%=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 's':<br>
+ t = parse_binary_expression(first + 2, last, ">>", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ case 'S':<br>
+ t = parse_binary_expression(first + 2, last, ">>=", db);<br>
+ if (t != first + 2)<br>
+ first = t;<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 's':<br>
+ switch (t[1]) {<br>
+ case 'c':<br>
+ first = parse_static_cast_expr(first, last, db);<br>
+ break;<br>
+ case 'p':<br>
+ first = parse_pack_expansion(first, last, db);<br>
+ break;<br>
+ case 'r':<br>
+ return parse_unresolved_name(first, last, db);<br>
+ case 't':<br>
+ first = parse_sizeof_type_expr(first, last, db);<br>
+ break;<br>
+ case 'z':<br>
+ first = parse_sizeof_expr_expr(first, last, db);<br>
+ break;<br>
+ case 'Z':<br>
+ if (last - t >= 3) {<br>
+ switch (t[2]) {<br>
+ case 'T':<br>
+ first = parse_sizeof_param_pack_expr(<wbr>first, last, db);<br>
+ break;<br>
+ case 'f':<br>
+ first = parse_sizeof_function_param_<wbr>pack_expr(first, last, db);<br>
+ break;<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 't':<br>
+ switch (t[1]) {<br>
+ case 'e':<br>
+ case 'i':<br>
+ first = parse_typeid_expr(first, last, db);<br>
+ break;<br>
+ case 'r':<br>
+ db.names.push_back("throw");<br>
+ first += 2;<br>
+ break;<br>
+ case 'w':<br>
+ first = parse_throw_expr(first, last, db);<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case '1':<br>
+ case '2':<br>
+ case '3':<br>
+ case '4':<br>
+ case '5':<br>
+ case '6':<br>
+ case '7':<br>
+ case '8':<br>
+ case '9':<br>
+ return parse_unresolved_name(first, last, db);<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <template-arg> ::= <type> # type<br>
+// or template<br>
+// ::= X <expression> E #<br>
+// expression<br>
+// ::= <expr-primary> #<br>
+// simple expressions<br>
+// ::= J <template-arg>* E #<br>
+// argument pack<br>
+// ::= LZ <encoding> E #<br>
+// extension<br>
+<br>
+template <class C><br>
+static const char *parse_template_arg(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last) {<br>
+ const char *t;<br>
+ switch (*first) {<br>
+ case 'X':<br>
+ t = parse_expression(first + 1, last, db);<br>
+ if (t != first + 1) {<br>
+ if (t != last && *t == 'E')<br>
+ first = t + 1;<br>
+ }<br>
+ break;<br>
+ case 'J':<br>
+ t = first + 1;<br>
+ if (t == last)<br>
+ return first;<br>
+ while (*t != 'E') {<br>
+ const char *t1 = parse_template_arg(t, last, db);<br>
+ if (t1 == t)<br>
+ return first;<br>
+ t = t1;<br>
+ }<br>
+ first = t + 1;<br>
+ break;<br>
+ case 'L':<br>
+ // <expr-primary> or LZ <encoding> E<br>
+ if (first + 1 != last && first[1] == 'Z') {<br>
+ t = parse_encoding(first + 2, last, db);<br>
+ if (t != first + 2 && t != last && *t == 'E')<br>
+ first = t + 1;<br>
+ } else<br>
+ first = parse_expr_primary(first, last, db);<br>
+ break;<br>
+ default:<br>
+ // <type><br>
+ first = parse_type(first, last, db);<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <template-args> ::= I <template-arg>* E<br>
+// extension, the abi says <template-arg>+<br>
+<br>
+template <class C><br>
+static const char *parse_template_args(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 2 && *first == 'I') {<br>
+ if (db.tag_templates)<br>
+ db.template_param.back().<wbr>clear();<br>
+ const char *t = first + 1;<br>
+ typename C::String args("<");<br>
+ while (*t != 'E') {<br>
+ if (db.tag_templates)<br>
+ db.template_param.emplace_<wbr>back(db.names.get_allocator())<wbr>;<br>
+ size_t k0 = db.names.size();<br>
+ const char *t1 = parse_template_arg(t, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (db.tag_templates)<br>
+ db.template_param.pop_back();<br>
+ if (t1 == t || t1 == last)<br>
+ return first;<br>
+ if (db.tag_templates) {<br>
+ db.template_param.back().<wbr>emplace_back(db.names.get_<wbr>allocator());<br>
+ for (size_t k = k0; k < k1; ++k)<br>
+ db.template_param.back().back(<wbr>).push_back(db.names[k]);<br>
+ }<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (args.size() > 1)<br>
+ args += ", ";<br>
+ args += db.names[k].move_full();<br>
+ }<br>
+ for (; k1 > k0; --k1)<br>
+ if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ t = t1;<br>
+ }<br>
+ first = t + 1;<br>
+ if (args.back() != '>')<br>
+ args += ">";<br>
+ else<br>
+ args += " >";<br>
+ db.names.push_back(std::move(<wbr>args));<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <nested-name> ::= N [<CV-qualifiers>] [<ref-qualifier>] <prefix><br>
+// <unqualified-name> E<br>
+// ::= N [<CV-qualifiers>] [<ref-qualifier>] <template-prefix><br>
+// <template-args> E<br>
+//<br>
+// <prefix> ::= <prefix> <unqualified-name><br>
+// ::= <template-prefix> <template-args><br>
+// ::= <template-param><br>
+// ::= <decltype><br>
+// ::= # empty<br>
+// ::= <substitution><br>
+// ::= <prefix> <data-member-prefix><br>
+// extension ::= L<br>
+//<br>
+// <template-prefix> ::= <prefix> <template unqualified-name><br>
+// ::= <template-param><br>
+// ::= <substitution><br>
+<br>
+template <class C><br>
+static const char *parse_nested_name(const char *first, const char *last, C &db,<br>
+ bool *ends_with_template_args) {<br>
+ if (first != last && *first == 'N') {<br>
+ unsigned cv;<br>
+ const char *t0 = parse_cv_qualifiers(first + 1, last, cv);<br>
+ if (t0 == last)<br>
+ return first;<br>
+ db.ref = 0;<br>
+ if (*t0 == 'R') {<br>
+ db.ref = 1;<br>
+ ++t0;<br>
+ } else if (*t0 == 'O') {<br>
+ db.ref = 2;<br>
+ ++t0;<br>
+ }<br>
+ db.names.emplace_back();<br>
+ if (last - t0 >= 2 && t0[0] == 'S' && t0[1] == 't') {<br>
+ t0 += 2;<br>
+ db.names.back().first = "std";<br>
+ }<br>
+ if (t0 == last) {<br>
+ db.names.pop_back();<br>
+ return first;<br>
+ }<br>
+ bool pop_subs = false;<br>
+ bool component_ends_with_template_<wbr>args = false;<br>
+ while (*t0 != 'E') {<br>
+ component_ends_with_template_<wbr>args = false;<br>
+ const char *t1;<br>
+ switch (*t0) {<br>
+ case 'S':<br>
+ if (t0 + 1 != last && t0[1] == 't')<br>
+ goto do_parse_unqualified_name;<br>
+ t1 = parse_substitution(t0, last, db);<br>
+ if (t1 != t0 && t1 != last) {<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!db.names.back().first.empty(<wbr>)) {<br>
+ db.names.back().first += "::" + name;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ } else<br>
+ db.names.back().first = name;<br>
+ pop_subs = true;<br>
+ t0 = t1;<br>
+ } else<br>
+ return first;<br>
+ break;<br>
+ case 'T':<br>
+ t1 = parse_template_param(t0, last, db);<br>
+ if (t1 != t0 && t1 != last) {<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!db.names.back().first.empty(<wbr>))<br>
+ db.names.back().first += "::" + name;<br>
+ else<br>
+ db.names.back().first = name;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ pop_subs = true;<br>
+ t0 = t1;<br>
+ } else<br>
+ return first;<br>
+ break;<br>
+ case 'D':<br>
+ if (t0 + 1 != last && t0[1] != 't' && t0[1] != 'T')<br>
+ goto do_parse_unqualified_name;<br>
+ t1 = parse_decltype(t0, last, db);<br>
+ if (t1 != t0 && t1 != last) {<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!db.names.back().first.empty(<wbr>))<br>
+ db.names.back().first += "::" + name;<br>
+ else<br>
+ db.names.back().first = name;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ pop_subs = true;<br>
+ t0 = t1;<br>
+ } else<br>
+ return first;<br>
+ break;<br>
+ case 'I':<br>
+ t1 = parse_template_args(t0, last, db);<br>
+ if (t1 != t0 && t1 != last) {<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += name;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ t0 = t1;<br>
+ component_ends_with_template_<wbr>args = true;<br>
+ } else<br>
+ return first;<br>
+ break;<br>
+ case 'L':<br>
+ if (++t0 == last)<br>
+ return first;<br>
+ break;<br>
+ default:<br>
+ do_parse_unqualified_name:<br>
+ t1 = parse_unqualified_name(t0, last, db);<br>
+ if (t1 != t0 && t1 != last) {<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!db.names.back().first.empty(<wbr>))<br>
+ db.names.back().first += "::" + name;<br>
+ else<br>
+ db.names.back().first = name;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ pop_subs = true;<br>
+ t0 = t1;<br>
+ } else<br>
+ return first;<br>
+ }<br>
+ }<br>
+ first = t0 + 1;<br>
+ <a href="http://db.cv" rel="noreferrer" target="_blank">db.cv</a> = cv;<br>
+ if (pop_subs && !db.subs.empty())<br>
+ db.subs.pop_back();<br>
+ if (ends_with_template_args)<br>
+ *ends_with_template_args = component_ends_with_template_<wbr>args;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <discriminator> := _ <non-negative number> # when number < 10<br>
+// := __ <non-negative number> _ # when number >= 10<br>
+// extension := decimal-digit+ # at the end of string<br>
+<br>
+static const char *parse_discriminator(const char *first, const char *last) {<br>
+ // parse but ignore discriminator<br>
+ if (first != last) {<br>
+ if (*first == '_') {<br>
+ const char *t1 = first + 1;<br>
+ if (t1 != last) {<br>
+ if (std::isdigit(*t1))<br>
+ first = t1 + 1;<br>
+ else if (*t1 == '_') {<br>
+ for (++t1; t1 != last && std::isdigit(*t1); ++t1)<br>
+ ;<br>
+ if (t1 != last && *t1 == '_')<br>
+ first = t1 + 1;<br>
+ }<br>
+ }<br>
+ } else if (std::isdigit(*first)) {<br>
+ const char *t1 = first + 1;<br>
+ for (; t1 != last && std::isdigit(*t1); ++t1)<br>
+ ;<br>
+ if (t1 == last)<br>
+ first = last;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <local-name> := Z <function encoding> E <entity name> [<discriminator>]<br>
+// := Z <function encoding> E s [<discriminator>]<br>
+// := Z <function encoding> Ed [ <parameter number> ] _ <entity<br>
+// name><br>
+<br>
+template <class C><br>
+static const char *parse_local_name(const char *first, const char *last, C &db,<br>
+ bool *ends_with_template_args) {<br>
+ if (first != last && *first == 'Z') {<br>
+ const char *t = parse_encoding(first + 1, last, db);<br>
+ if (t != first + 1 && t != last && *t == 'E' && ++t != last) {<br>
+ switch (*t) {<br>
+ case 's':<br>
+ first = parse_discriminator(t + 1, last);<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>::string literal");<br>
+ break;<br>
+ case 'd':<br>
+ if (++t != last) {<br>
+ const char *t1 = parse_number(t, last);<br>
+ if (t1 != last && *t1 == '_') {<br>
+ t = t1 + 1;<br>
+ t1 = parse_name(t, last, db, ends_with_template_args);<br>
+ if (t1 != t) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>::");<br>
+ db.names.back().first.append(<wbr>name);<br>
+ first = t1;<br>
+ } else if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ }<br>
+ }<br>
+ break;<br>
+ default: {<br>
+ const char *t1 = parse_name(t, last, db, ends_with_template_args);<br>
+ if (t1 != t) {<br>
+ // parse but ignore discriminator<br>
+ first = parse_discriminator(t1, last);<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto name = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.append("<wbr>::");<br>
+ db.names.back().first.append(<wbr>name);<br>
+ } else if (!db.names.empty())<br>
+ db.names.pop_back();<br>
+ } break;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <name> ::= <nested-name> // N<br>
+// ::= <local-name> # See Scope Encoding below // Z<br>
+// ::= <unscoped-template-name> <template-args><br>
+// ::= <unscoped-name><br>
+<br>
+// <unscoped-template-name> ::= <unscoped-name><br>
+// ::= <substitution><br>
+<br>
+template <class C><br>
+static const char *parse_name(const char *first, const char *last, C &db,<br>
+ bool *ends_with_template_args) {<br>
+ if (last - first >= 2) {<br>
+ const char *t0 = first;<br>
+ // extension: ignore L here<br>
+ if (*t0 == 'L')<br>
+ ++t0;<br>
+ switch (*t0) {<br>
+ case 'N': {<br>
+ const char *t1 = parse_nested_name(t0, last, db, ends_with_template_args);<br>
+ if (t1 != t0)<br>
+ first = t1;<br>
+ break;<br>
+ }<br>
+ case 'Z': {<br>
+ const char *t1 = parse_local_name(t0, last, db, ends_with_template_args);<br>
+ if (t1 != t0)<br>
+ first = t1;<br>
+ break;<br>
+ }<br>
+ default: {<br>
+ const char *t1 = parse_unscoped_name(t0, last, db);<br>
+ if (t1 != t0) {<br>
+ if (t1 != last &&<br>
+ *t1 == 'I') // <unscoped-template-name> <template-args><br>
+ {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.subs.push_back(typename C::sub_type(1, db.names.back(),<br>
+ db.names.get_allocator()));<br>
+ t0 = t1;<br>
+ t1 = parse_template_args(t0, last, db);<br>
+ if (t1 != t0) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += tmp;<br>
+ first = t1;<br>
+ if (ends_with_template_args)<br>
+ *ends_with_template_args = true;<br>
+ }<br>
+ } else // <unscoped-name><br>
+ first = t1;<br>
+ } else { // try <substitution> <template-args><br>
+ t1 = parse_substitution(t0, last, db);<br>
+ if (t1 != t0 && t1 != last && *t1 == 'I') {<br>
+ t0 = t1;<br>
+ t1 = parse_template_args(t0, last, db);<br>
+ if (t1 != t0) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto tmp = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += tmp;<br>
+ first = t1;<br>
+ if (ends_with_template_args)<br>
+ *ends_with_template_args = true;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <call-offset> ::= h <nv-offset> _<br>
+// ::= v <v-offset> _<br>
+//<br>
+// <nv-offset> ::= <offset number><br>
+// # non-virtual base override<br>
+//<br>
+// <v-offset> ::= <offset number> _ <virtual offset number><br>
+// # virtual base override, with vcall offset<br>
+<br>
+static const char *parse_call_offset(const char *first, const char *last) {<br>
+ if (first != last) {<br>
+ switch (*first) {<br>
+ case 'h': {<br>
+ const char *t = parse_number(first + 1, last);<br>
+ if (t != first + 1 && t != last && *t == '_')<br>
+ first = t + 1;<br>
+ } break;<br>
+ case 'v': {<br>
+ const char *t = parse_number(first + 1, last);<br>
+ if (t != first + 1 && t != last && *t == '_') {<br>
+ const char *t2 = parse_number(++t, last);<br>
+ if (t2 != t && t2 != last && *t2 == '_')<br>
+ first = t2 + 1;<br>
+ }<br>
+ } break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <special-name> ::= TV <type> # virtual table<br>
+// ::= TT <type> # VTT structure (construction vtable index)<br>
+// ::= TI <type> # typeinfo structure<br>
+// ::= TS <type> # typeinfo name (null-terminated byte string)<br>
+// ::= Tc <call-offset> <call-offset> <base encoding><br>
+// # base is the nominal target function of thunk<br>
+// # first call-offset is 'this' adjustment<br>
+// # second call-offset is result adjustment<br>
+// ::= T <call-offset> <base encoding><br>
+// # base is the nominal target function of thunk<br>
+// ::= GV <object name> # Guard variable for one-time<br>
+// initialization<br>
+// # No <type><br>
+// extension ::= TC <first type> <number> _ <second type> # construction<br>
+// vtable for second-in-first<br>
+// extension ::= GR <object name> # reference temporary for object<br>
+<br>
+template <class C><br>
+static const char *parse_special_name(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first > 2) {<br>
+ const char *t;<br>
+ switch (*first) {<br>
+ case 'T':<br>
+ switch (first[1]) {<br>
+ case 'V':<br>
+ // TV <type> # virtual table<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "vtable for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'T':<br>
+ // TT <type> # VTT structure (construction vtable index)<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "VTT for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'I':<br>
+ // TI <type> # typeinfo structure<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "typeinfo for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'S':<br>
+ // TS <type> # typeinfo name (null-terminated byte string)<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "typeinfo name for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'c':<br>
+ // Tc <call-offset> <call-offset> <base encoding><br>
+ {<br>
+ const char *t0 = parse_call_offset(first + 2, last);<br>
+ if (t0 == first + 2)<br>
+ break;<br>
+ const char *t1 = parse_call_offset(t0, last);<br>
+ if (t1 == t0)<br>
+ break;<br>
+ t = parse_encoding(t1, last, db);<br>
+ if (t != t1) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "covariant return thunk to ");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ break;<br>
+ case 'C':<br>
+ // extension ::= TC <first type> <number> _ <second type> # construction<br>
+ // vtable for second-in-first<br>
+ t = parse_type(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ const char *t0 = parse_number(t, last);<br>
+ if (t0 != t && t0 != last && *t0 == '_') {<br>
+ const char *t1 = parse_type(++t0, last, db);<br>
+ if (t1 != t0) {<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto left = db.names.back().move_full();<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first = "construction vtable for " +<br>
+ std::move(left) + "-in-" +<br>
+ db.names.back().move_full();<br>
+ first = t1;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ default:<br>
+ // T <call-offset> <base encoding><br>
+ {<br>
+ const char *t0 = parse_call_offset(first + 1, last);<br>
+ if (t0 == first + 1)<br>
+ break;<br>
+ t = parse_encoding(t0, last, db);<br>
+ if (t != t0) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (first[1] == 'v') {<br>
+ db.names.back().first.insert(<wbr>0, "virtual thunk to ");<br>
+ first = t;<br>
+ } else {<br>
+ db.names.back().first.insert(<wbr>0, "non-virtual thunk to ");<br>
+ first = t;<br>
+ }<br>
+ }<br>
+ }<br>
+ break;<br>
+ }<br>
+ break;<br>
+ case 'G':<br>
+ switch (first[1]) {<br>
+ case 'V':<br>
+ // GV <object name> # Guard variable for one-time initialization<br>
+ t = parse_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "guard variable for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ case 'R':<br>
+ // extension ::= GR <object name> # reference temporary for object<br>
+ t = parse_name(first + 2, last, db);<br>
+ if (t != first + 2) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "reference temporary for ");<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+namespace {<br>
+template <class T> class save_value {<br>
+ T &restore_;<br>
+ T original_value_;<br>
+<br>
+public:<br>
+ save_value(T &restore) : restore_(restore), original_value_(restore) {}<br>
+<br>
+ ~save_value() { restore_ = std::move(original_value_); }<br>
+<br>
+ save_value(const save_value &) = delete;<br>
+ save_value &operator=(const save_value &) = delete;<br>
+};<br>
+}<br>
+<br>
+// <encoding> ::= <function name> <bare-function-type><br>
+// ::= <data name><br>
+// ::= <special-name><br>
+<br>
+template <class C><br>
+static const char *parse_encoding(const char *first, const char *last, C &db) {<br>
+ if (first != last) {<br>
+ save_value<decltype(db.<wbr>encoding_depth)> su(db.encoding_depth);<br>
+ ++db.encoding_depth;<br>
+ save_value<decltype(db.tag_<wbr>templates)> sb(db.tag_templates);<br>
+ if (db.encoding_depth > 1)<br>
+ db.tag_templates = true;<br>
+ switch (*first) {<br>
+ case 'G':<br>
+ case 'T':<br>
+ first = parse_special_name(first, last, db);<br>
+ break;<br>
+ default: {<br>
+ bool ends_with_template_args = false;<br>
+ const char *t = parse_name(first, last, db, &ends_with_template_args);<br>
+ unsigned cv = <a href="http://db.cv" rel="noreferrer" target="_blank">db.cv</a>;<br>
+ unsigned ref = db.ref;<br>
+ if (t != first) {<br>
+ if (t != last && *t != 'E' && *t != '.') {<br>
+ save_value<bool> sb2(db.tag_templates);<br>
+ db.tag_templates = false;<br>
+ const char *t2;<br>
+ typename C::String ret2;<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ const typename C::String &nm = db.names.back().first;<br>
+ if (nm.empty())<br>
+ return first;<br>
+ if (!db.parsed_ctor_dtor_cv && ends_with_template_args) {<br>
+ t2 = parse_type(t, last, db);<br>
+ if (t2 == t)<br>
+ return first;<br>
+ if (db.names.size() < 2)<br>
+ return first;<br>
+ auto ret1 = std::move(db.names.back().<wbr>first);<br>
+ ret2 = std::move(db.names.back().<wbr>second);<br>
+ if (ret2.empty())<br>
+ ret1 += ' ';<br>
+ db.names.pop_back();<br>
+ if (db.names.empty())<br>
+ return first;<br>
+<br>
+ db.names.back().first.insert(<wbr>0, ret1);<br>
+ t = t2;<br>
+ }<br>
+ db.names.back().first += '(';<br>
+ if (t != last && *t == 'v') {<br>
+ ++t;<br>
+ } else {<br>
+ bool first_arg = true;<br>
+ while (true) {<br>
+ size_t k0 = db.names.size();<br>
+ t2 = parse_type(t, last, db);<br>
+ size_t k1 = db.names.size();<br>
+ if (t2 == t)<br>
+ break;<br>
+ if (k1 > k0) {<br>
+ typename C::String tmp;<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (!tmp.empty())<br>
+ tmp += ", ";<br>
+ tmp += db.names[k].move_full();<br>
+ }<br>
+ for (size_t k = k0; k < k1; ++k) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.pop_back();<br>
+ }<br>
+ if (!tmp.empty()) {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ if (!first_arg)<br>
+ db.names.back().first += ", ";<br>
+ else<br>
+ first_arg = false;<br>
+ db.names.back().first += tmp;<br>
+ }<br>
+ }<br>
+ t = t2;<br>
+ }<br>
+ }<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += ')';<br>
+ if (cv & 1)<br>
+ db.names.back().first.append(" const");<br>
+ if (cv & 2)<br>
+ db.names.back().first.append(" volatile");<br>
+ if (cv & 4)<br>
+ db.names.back().first.append(" restrict");<br>
+ if (ref == 1)<br>
+ db.names.back().first.append(" &");<br>
+ else if (ref == 2)<br>
+ db.names.back().first.append(" &&");<br>
+ db.names.back().first += ret2;<br>
+ first = t;<br>
+ } else<br>
+ first = t;<br>
+ }<br>
+ break;<br>
+ }<br>
+ }<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// _block_invoke<br>
+// _block_invoke<decimal-digit>+<br>
+// _block_invoke_<decimal-digit>+<br>
+<br>
+template <class C><br>
+static const char *parse_block_invoke(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (last - first >= 13) {<br>
+ const char test[] = "_block_invoke";<br>
+ const char *t = first;<br>
+ for (int i = 0; i < 13; ++i, ++t) {<br>
+ if (*t != test[i])<br>
+ return first;<br>
+ }<br>
+ if (t != last) {<br>
+ if (*t == '_') {<br>
+ // must have at least 1 decimal digit<br>
+ if (++t == last || !std::isdigit(*t))<br>
+ return first;<br>
+ ++t;<br>
+ }<br>
+ // parse zero or more digits<br>
+ while (t != last && isdigit(*t))<br>
+ ++t;<br>
+ }<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first.insert(<wbr>0, "invocation function for block in ");<br>
+ first = t;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// extension<br>
+// <dot-suffix> := .<anything and everything><br>
+<br>
+template <class C><br>
+static const char *parse_dot_suffix(const char *first, const char *last,<br>
+ C &db) {<br>
+ if (first != last && *first == '.') {<br>
+ if (db.names.empty())<br>
+ return first;<br>
+ db.names.back().first += " (" + typename C::String(first, last) + ")";<br>
+ first = last;<br>
+ }<br>
+ return first;<br>
+}<br>
+<br>
+// <block-involcaton-function> ___Z<encoding>_block_invoke<br>
+// <block-involcaton-function> ___Z<encoding>_block_invoke<<wbr>decimal-digit>+<br>
+// <block-involcaton-function> ___Z<encoding>_block_invoke_<<wbr>decimal-digit>+<br>
+// <mangled-name> ::= _Z<encoding><br>
+// ::= <type><br>
+<br>
+template <class C><br>
+static void demangle(const char *first, const char *last, C &db, int &status) {<br>
+ if (first >= last) {<br>
+ status = invalid_mangled_name;<br>
+ return;<br>
+ }<br>
+ if (*first == '_') {<br>
+ if (last - first >= 4) {<br>
+ if (first[1] == 'Z') {<br>
+ const char *t = parse_encoding(first + 2, last, db);<br>
+ if (t != first + 2 && t != last && *t == '.')<br>
+ t = parse_dot_suffix(t, last, db);<br>
+ if (t != last)<br>
+ status = invalid_mangled_name;<br>
+ } else if (first[1] == '_' && first[2] == '_' && first[3] == 'Z') {<br>
+ const char *t = parse_encoding(first + 4, last, db);<br>
+ if (t != first + 4 && t != last) {<br>
+ const char *t1 = parse_block_invoke(t, last, db);<br>
+ if (t1 != last)<br>
+ status = invalid_mangled_name;<br>
+ } else<br>
+ status = invalid_mangled_name;<br>
+ } else<br>
+ status = invalid_mangled_name;<br>
+ } else<br>
+ status = invalid_mangled_name;<br>
+ } else {<br>
+ const char *t = parse_type(first, last, db);<br>
+ if (t != last)<br>
+ status = invalid_mangled_name;<br>
+ }<br>
+ if (status == success && db.names.empty())<br>
+ status = invalid_mangled_name;<br>
+}<br>
+<br>
+namespace {<br>
+template <std::size_t N> class arena {<br>
+ static const std::size_t alignment = 16;<br>
+ alignas(alignment) char buf_[N];<br>
+ char *ptr_;<br>
+<br>
+ std::size_t align_up(std::size_t n) noexcept {<br>
+ return (n + (alignment - 1)) & ~(alignment - 1);<br>
+ }<br>
+<br>
+ bool pointer_in_buffer(char *p) noexcept {<br>
+ return buf_ <= p && p <= buf_ + N;<br>
+ }<br>
+<br>
+public:<br>
+ arena() noexcept : ptr_(buf_) {}<br>
+ ~arena() { ptr_ = nullptr; }<br>
+ arena(const arena &) = delete;<br>
+ arena &operator=(const arena &) = delete;<br>
+<br>
+ char *allocate(std::size_t n);<br>
+ void deallocate(char *p, std::size_t n) noexcept;<br>
+<br>
+ static constexpr std::size_t size() { return N; }<br>
+ std::size_t used() const { return static_cast<std::size_t>(ptr_ - buf_); }<br>
+ void reset() { ptr_ = buf_; }<br>
+};<br>
+<br>
+template <std::size_t N> char *arena<N>::allocate(std::size_<wbr>t n) {<br>
+ n = align_up(n);<br>
+ if (static_cast<std::size_t>(buf_ + N - ptr_) >= n) {<br>
+ char *r = ptr_;<br>
+ ptr_ += n;<br>
+ return r;<br>
+ }<br>
+ return static_cast<char *>(std::malloc(n));<br>
+}<br>
+<br>
+template <std::size_t N><br>
+void arena<N>::deallocate(char *p, std::size_t n) noexcept {<br>
+ if (pointer_in_buffer(p)) {<br>
+ n = align_up(n);<br>
+ if (p + n == ptr_)<br>
+ ptr_ = p;<br>
+ } else<br>
+ std::free(p);<br>
+}<br>
+<br>
+template <class T, std::size_t N> class short_alloc {<br>
+ arena<N> &a_;<br>
+<br>
+public:<br>
+ typedef T value_type;<br>
+<br>
+public:<br>
+ template <class _Up> struct rebind { typedef short_alloc<_Up, N> other; };<br>
+<br>
+ short_alloc(arena<N> &a) noexcept : a_(a) {}<br>
+ template <class U><br>
+ short_alloc(const short_alloc<U, N> &a) noexcept : a_(a.a_) {}<br>
+ short_alloc(const short_alloc &) = default;<br>
+ short_alloc &operator=(const short_alloc &) = delete;<br>
+<br>
+ T *allocate(std::size_t n) {<br>
+ return reinterpret_cast<T *>(a_.allocate(n * sizeof(T)));<br>
+ }<br>
+ void deallocate(T *p, std::size_t n) noexcept {<br>
+ a_.deallocate(reinterpret_<wbr>cast<char *>(p), n * sizeof(T));<br>
+ }<br>
+<br>
+ template <class T1, std::size_t N1, class U, std::size_t M><br>
+ friend bool operator==(const short_alloc<T1, N1> &x,<br>
+ const short_alloc<U, M> &y) noexcept;<br>
+<br>
+ template <class U, std::size_t M> friend class short_alloc;<br>
+};<br>
+<br>
+template <class T, std::size_t N, class U, std::size_t M><br>
+inline bool operator==(const short_alloc<T, N> &x,<br>
+ const short_alloc<U, M> &y) noexcept {<br>
+ return N == M && &x.a_ == &y.a_;<br>
+}<br>
+<br>
+template <class T, std::size_t N, class U, std::size_t M><br>
+inline bool operator!=(const short_alloc<T, N> &x,<br>
+ const short_alloc<U, M> &y) noexcept {<br>
+ return !(x == y);<br>
+}<br>
+<br>
+template <class T> class malloc_alloc {<br>
+public:<br>
+ typedef T value_type;<br>
+ typedef T &reference;<br>
+ typedef const T &const_reference;<br>
+ typedef T *pointer;<br>
+ typedef const T *const_pointer;<br>
+ typedef std::size_t size_type;<br>
+ typedef std::ptrdiff_t difference_type;<br>
+<br>
+ malloc_alloc() = default;<br>
+ template <class U> malloc_alloc(const malloc_alloc<U> &) noexcept {}<br>
+<br>
+ T *allocate(std::size_t n) {<br>
+ return static_cast<T *>(std::malloc(n * sizeof(T)));<br>
+ }<br>
+ void deallocate(T *p, std::size_t) noexcept { std::free(p); }<br>
+<br>
+ template <class U> struct rebind { using other = malloc_alloc<U>; };<br>
+ template <class U, class... Args> void construct(U *p, Args &&... args) {<br>
+ ::new ((void *)p) U(std::forward<Args>(args)...)<wbr>;<br>
+ }<br>
+ void destroy(T *p) { p->~T(); }<br>
+};<br>
+<br>
+template <class T, class U><br>
+inline bool operator==(const malloc_alloc<T> &,<br>
+ const malloc_alloc<U> &) noexcept {<br>
+ return true;<br>
+}<br>
+<br>
+template <class T, class U><br>
+inline bool operator!=(const malloc_alloc<T> &x,<br>
+ const malloc_alloc<U> &y) noexcept {<br>
+ return !(x == y);<br>
+}<br>
+<br>
+const size_t bs = 4 * 1024;<br>
+template <class T> using Alloc = short_alloc<T, bs>;<br>
+template <class T> using Vector = std::vector<T, Alloc<T>>;<br>
+<br>
+template <class StrT> struct string_pair {<br>
+ StrT first;<br>
+ StrT second;<br>
+<br>
+ string_pair() = default;<br>
+ string_pair(StrT f) : first(std::move(f)) {}<br>
+ string_pair(StrT f, StrT s) : first(std::move(f)), second(std::move(s)) {}<br>
+ template <size_t N> string_pair(const char (&s)[N]) : first(s, N - 1) {}<br>
+<br>
+ size_t size() const { return first.size() + second.size(); }<br>
+ StrT full() const { return first + second; }<br>
+ StrT move_full() { return std::move(first) + std::move(second); }<br>
+};<br>
+<br>
+struct Db {<br>
+ typedef std::basic_string<char, std::char_traits<char>, malloc_alloc<char>><br>
+ String;<br>
+ typedef Vector<string_pair<String>> sub_type;<br>
+ typedef Vector<sub_type> template_param_type;<br>
+ sub_type names;<br>
+ template_param_type subs;<br>
+ Vector<template_param_type> template_param;<br>
+ unsigned cv;<br>
+ unsigned ref;<br>
+ unsigned encoding_depth;<br>
+ bool parsed_ctor_dtor_cv;<br>
+ bool tag_templates;<br>
+ bool fix_forward_references;<br>
+ bool try_to_parse_template_args;<br>
+<br>
+ template <size_t N><br>
+ Db(arena<N> &ar)<br>
+ : names(ar), subs(0, names, ar), template_param(0, subs, ar) {}<br>
+};<br>
+}<br>
+<br>
+char *llvm::itaniumDemangle(const char *mangled_name, char *buf, size_t *n,<br>
+ int *status) {<br>
+ if (mangled_name == nullptr || (buf != nullptr && n == nullptr)) {<br>
+ if (status)<br>
+ *status = invalid_args;<br>
+ return nullptr;<br>
+ }<br>
+ size_t internal_size = buf != nullptr ? *n : 0;<br>
+ arena<bs> a;<br>
+ Db db(a);<br>
+ <a href="http://db.cv" rel="noreferrer" target="_blank">db.cv</a> = 0;<br>
+ db.ref = 0;<br>
+ db.encoding_depth = 0;<br>
+ db.parsed_ctor_dtor_cv = false;<br>
+ db.tag_templates = true;<br>
+ db.template_param.emplace_<wbr>back(a);<br>
+ db.fix_forward_references = false;<br>
+ db.try_to_parse_template_args = true;<br>
+ int internal_status = success;<br>
+ size_t len = std::strlen(mangled_name);<br>
+ demangle(mangled_name, mangled_name + len, db, internal_status);<br>
+ if (internal_status == success && db.fix_forward_references &&<br>
+ !db.template_param.empty() && !db.template_param.front().<wbr>empty()) {<br>
+ db.fix_forward_references = false;<br>
+ db.tag_templates = false;<br>
+ db.names.clear();<br>
+ db.subs.clear();<br>
+ demangle(mangled_name, mangled_name + len, db, internal_status);<br>
+ if (db.fix_forward_references)<br>
+ internal_status = invalid_mangled_name;<br>
+ }<br>
+ if (internal_status == success) {<br>
+ size_t sz = db.names.back().size() + 1;<br>
+ if (sz > internal_size) {<br>
+ char *newbuf = static_cast<char *>(std::realloc(buf, sz));<br>
+ if (newbuf == nullptr) {<br>
+ internal_status = memory_alloc_failure;<br>
+ buf = nullptr;<br>
+ } else {<br>
+ buf = newbuf;<br>
+ if (n != nullptr)<br>
+ *n = sz;<br>
+ }<br>
+ }<br>
+ if (buf != nullptr) {<br>
+ db.names.back().first += db.names.back().second;<br>
+ std::memcpy(buf, db.names.back().first.data(), sz - 1);<br>
+ buf[sz - 1] = char(0);<br>
+ }<br>
+ } else<br>
+ buf = nullptr;<br>
+ if (status)<br>
+ *status = internal_status;<br>
+ return buf;<br>
+}<br>
<br>
Copied: llvm/trunk/lib/Demangle/<wbr>LLVMBuild.txt (from r280727, llvm/trunk/lib/Support/<wbr>LLVMBuild.txt)<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Demangle/LLVMBuild.txt?p2=llvm/trunk/lib/Demangle/LLVMBuild.txt&p1=llvm/trunk/lib/Support/LLVMBuild.txt&r1=280727&r2=280732&rev=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>Demangle/LLVMBuild.txt?p2=<wbr>llvm/trunk/lib/Demangle/<wbr>LLVMBuild.txt&p1=llvm/trunk/<wbr>lib/Support/LLVMBuild.txt&r1=<wbr>280727&r2=280732&rev=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/Support/<wbr>LLVMBuild.txt (original)<br>
+++ llvm/trunk/lib/Demangle/<wbr>LLVMBuild.txt Tue Sep 6 14:16:48 2016<br>
@@ -17,5 +17,5 @@<br>
<br>
[component_0]<br>
type = Library<br>
-name = Support<br>
+name = Demangle<br>
parent = Libraries<br>
<br>
Modified: llvm/trunk/lib/LLVMBuild.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/LLVMBuild.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>LLVMBuild.txt?rev=280732&r1=<wbr>280731&r2=280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/LLVMBuild.txt (original)<br>
+++ llvm/trunk/lib/LLVMBuild.txt Tue Sep 6 14:16:48 2016<br>
@@ -22,6 +22,7 @@ subdirectories =<br>
Bitcode<br>
CodeGen<br>
DebugInfo<br>
+ Demangle<br>
ExecutionEngine<br>
LibDriver<br>
LineEditor<br>
<br>
Modified: llvm/trunk/lib/Support/<wbr>LLVMBuild.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Support/LLVMBuild.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>Support/LLVMBuild.txt?rev=<wbr>280732&r1=280731&r2=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/Support/<wbr>LLVMBuild.txt (original)<br>
+++ llvm/trunk/lib/Support/<wbr>LLVMBuild.txt Tue Sep 6 14:16:48 2016<br>
@@ -19,3 +19,4 @@<br>
type = Library<br>
name = Support<br>
parent = Libraries<br>
+required_libraries = Demangle<br>
<br>
Modified: llvm/trunk/lib/Support/Unix/<wbr>Signals.inc<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Support/Unix/Signals.inc?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/lib/<wbr>Support/Unix/Signals.inc?rev=<wbr>280732&r1=280731&r2=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/lib/Support/Unix/<wbr>Signals.inc (original)<br>
+++ llvm/trunk/lib/Support/Unix/<wbr>Signals.inc Tue Sep 6 14:16:48 2016<br>
@@ -14,6 +14,7 @@<br>
<br>
#include "Unix.h"<br>
#include "llvm/ADT/STLExtras.h"<br>
+#include "llvm/Demangle/Demangle.h"<br>
#include "llvm/Support/Format.h"<br>
#include "llvm/Support/FileSystem.h"<br>
#include "llvm/Support/FileUtilities.h"<br>
@@ -33,9 +34,6 @@<br>
#if HAVE_SYS_STAT_H<br>
#include <sys/stat.h><br>
#endif<br>
-#if HAVE_CXXABI_H<br>
-#include <cxxabi.h><br>
-#endif<br>
#if HAVE_DLFCN_H<br>
#include <dlfcn.h><br>
#endif<br>
@@ -443,12 +441,8 @@ void llvm::sys::PrintStackTrace(<wbr>raw_ostr<br>
<br>
if (dlinfo.dli_sname != nullptr) {<br>
OS << ' ';<br>
-# if HAVE_CXXABI_H<br>
int res;<br>
- char* d = abi::__cxa_demangle(dlinfo.<wbr>dli_sname, nullptr, nullptr, &res);<br>
-# else<br>
- char* d = NULL;<br>
-# endif<br>
+ char* d = itaniumDemangle(dlinfo.dli_<wbr>sname, nullptr, nullptr, &res);<br>
if (!d) OS << dlinfo.dli_sname;<br>
else OS << d;<br>
free(d);<br>
<br>
Modified: llvm/trunk/test/CMakeLists.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/test/CMakeLists.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/test/<wbr>CMakeLists.txt?rev=280732&r1=<wbr>280731&r2=280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/test/CMakeLists.txt (original)<br>
+++ llvm/trunk/test/CMakeLists.txt Tue Sep 6 14:16:48 2016<br>
@@ -32,6 +32,7 @@ set(LLVM_TEST_DEPENDS<br>
llvm-as<br>
llvm-bcanalyzer<br>
llvm-c-test<br>
+ llvm-cxxfilt<br>
llvm-config<br>
llvm-cov<br>
llvm-cxxdump<br>
<br>
Added: llvm/trunk/test/Demangle/lit.<wbr>local.cfg<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Demangle/lit.local.cfg?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/test/<wbr>Demangle/lit.local.cfg?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/test/Demangle/lit.<wbr>local.cfg (added)<br>
+++ llvm/trunk/test/Demangle/lit.<wbr>local.cfg Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1 @@<br>
+config.suffixes = ['.test']<br>
<br>
Added: llvm/trunk/test/Demangle/<wbr>simple.test<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/test/Demangle/simple.test?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/test/<wbr>Demangle/simple.test?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/test/Demangle/<wbr>simple.test (added)<br>
+++ llvm/trunk/test/Demangle/<wbr>simple.test Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,4 @@<br>
+RUN: llvm-cxxfilt _Z1fi abc | FileCheck %s<br>
+<br>
+CHECK: f(int)<br>
+CHECK-NEXT: abc<br>
<br>
Modified: llvm/trunk/test/lit.cfg<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/test/lit.cfg?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/test/lit.<wbr>cfg?rev=280732&r1=280731&r2=<wbr>280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/test/lit.cfg (original)<br>
+++ llvm/trunk/test/lit.cfg Tue Sep 6 14:16:48 2016<br>
@@ -309,6 +309,7 @@ for pattern in [r"\bbugpoint\b(?!-)",<br>
r"\bllvm-split\b",<br>
r"\bllvm-tblgen\b",<br>
r"\bllvm-c-test\b",<br>
+ r"\bllvm-cxxfilt\b",<br>
NOJUNK + r"\bllvm-symbolizer\b",<br>
NOJUNK + r"\bopt\b",<br>
r"\bFileCheck\b",<br>
<br>
Modified: llvm/trunk/test/tools/llvm-<wbr>objdump/X86/macho-symbolized-<wbr>disassembly.test<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/test/tools/llvm-objdump/X86/macho-symbolized-disassembly.test?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/test/tools/<wbr>llvm-objdump/X86/macho-<wbr>symbolized-disassembly.test?<wbr>rev=280732&r1=280731&r2=<wbr>280732&view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/test/tools/llvm-<wbr>objdump/X86/macho-symbolized-<wbr>disassembly.test (original)<br>
+++ llvm/trunk/test/tools/llvm-<wbr>objdump/X86/macho-symbolized-<wbr>disassembly.test Tue Sep 6 14:16:48 2016<br>
@@ -31,10 +31,7 @@ ObjC-EXE: 0000000100000f1b movq 0x10e(%r<br>
ObjC-EXE: 0000000100000f25 callq 0x100000f4a ## Objc message: +[NSDate date]<br>
ObjC-EXE: 0000000100000f33 callq 0x100000f44 ## symbol stub for: _NSLog<br>
<br>
-CXX-EXE: 00000001000014cb callq __ZNSt3__116__pad_and_<wbr>outputIcNS_11char_<wbr>traitsIcEEEENS_19ostreambuf_<wbr>iteratorIT_T0_EES6_PKS4_S8_S8_<wbr>RNS_8ios_baseES4_<br>
-<br>
-// FIXME: Demangler depends on host's <cxxabi.h>.<br>
-// std::__1::ostreambuf_iterator<<wbr>char, std::__1::char_traits<char> > std::__1::__pad_and_output<<wbr>char, std::__1::char_traits<char> >(std::__1::ostreambuf_<wbr>iterator<char, std::__1::char_traits<char> >, char const*, char const*, char const*, std::__1::ios_base&, char)<br>
+CXX-EXE: 00000001000014cb callq __ZNSt3__116__pad_and_<wbr>outputIcNS_11char_<wbr>traitsIcEEEENS_19ostreambuf_<wbr>iteratorIT_T0_EES6_PKS4_S8_S8_<wbr>RNS_8ios_baseES4_ ## std::__1::ostreambuf_iterator<<wbr>char, std::__1::char_traits<char> > std::__1::__pad_and_output<<wbr>char, std::__1::char_traits<char> >(std::__1::ostreambuf_<wbr>iterator<char, std::__1::char_traits<char> >, char const*, char const*, char const*, std::__1::ios_base&, char)<br>
<br>
i386-OBJ: 0000002f calll _printf<br>
<br>
<br>
Added: llvm/trunk/tools/llvm-cxxfilt/<wbr>CMakeLists.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-cxxfilt/CMakeLists.txt?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/tools/llvm-<wbr>cxxfilt/CMakeLists.txt?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/tools/llvm-cxxfilt/<wbr>CMakeLists.txt (added)<br>
+++ llvm/trunk/tools/llvm-cxxfilt/<wbr>CMakeLists.txt Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,7 @@<br>
+set(LLVM_LINK_COMPONENTS<br>
+ Demangle<br>
+ )<br>
+<br>
+add_llvm_tool(llvm-cxxfilt<br>
+ llvm-cxxfilt.cpp<br>
+ )<br>
<br>
Added: llvm/trunk/tools/llvm-cxxfilt/<wbr>llvm-cxxfilt.cpp<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-cxxfilt/llvm-cxxfilt.cpp?rev=280732&view=auto" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/tools/llvm-<wbr>cxxfilt/llvm-cxxfilt.cpp?rev=<wbr>280732&view=auto</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/tools/llvm-cxxfilt/<wbr>llvm-cxxfilt.cpp (added)<br>
+++ llvm/trunk/tools/llvm-cxxfilt/<wbr>llvm-cxxfilt.cpp Tue Sep 6 14:16:48 2016<br>
@@ -0,0 +1,29 @@<br>
+//===-- llvm-c++filt.cpp ------------------------------<wbr>--------------------===//<br>
+//<br>
+// The LLVM Compiler Infrastructure<br>
+//<br>
+// This file is distributed under the University of Illinois Open Source<br>
+// License. See LICENSE.TXT for details.<br>
+//<br>
+//===------------------------<wbr>------------------------------<wbr>----------------===//<br>
+<br>
+#include "llvm/Demangle/Demangle.h"<br>
+<br>
+#include <stdio.h><br>
+#include <stdlib.h><br>
+<br>
+using namespace llvm;<br>
+<br>
+int main(int argc, char **argv) {<br>
+ for (int I = 1; I < argc; ++I) {<br>
+ const char *Mangled = argv[I];<br>
+ int Status;<br>
+ char *Demangled = itaniumDemangle(Mangled, nullptr, nullptr, &Status);<br>
+ if (Demangled)<br>
+ printf("%s\n", Demangled);<br>
+ else<br>
+ printf("%s\n", Mangled);<br>
+ free(Demangled);<br>
+ }<br>
+ return 0;<br>
+}<br>
<br>
Modified: llvm/trunk/tools/llvm-objdump/<wbr>CMakeLists.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-objdump/CMakeLists.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/tools/llvm-<wbr>objdump/CMakeLists.txt?rev=<wbr>280732&r1=280731&r2=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/tools/llvm-objdump/<wbr>CMakeLists.txt (original)<br>
+++ llvm/trunk/tools/llvm-objdump/<wbr>CMakeLists.txt Tue Sep 6 14:16:48 2016<br>
@@ -6,6 +6,7 @@ set(LLVM_LINK_COMPONENTS<br>
CodeGen<br>
DebugInfoDWARF<br>
DebugInfoPDB<br>
+ Demangle<br>
MC<br>
MCDisassembler<br>
Object<br>
<br>
Modified: llvm/trunk/tools/llvm-objdump/<wbr>LLVMBuild.txt<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-objdump/LLVMBuild.txt?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/tools/llvm-<wbr>objdump/LLVMBuild.txt?rev=<wbr>280732&r1=280731&r2=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/tools/llvm-objdump/<wbr>LLVMBuild.txt (original)<br>
+++ llvm/trunk/tools/llvm-objdump/<wbr>LLVMBuild.txt Tue Sep 6 14:16:48 2016<br>
@@ -19,4 +19,4 @@<br>
type = Tool<br>
name = llvm-objdump<br>
parent = Tools<br>
-required_libraries = DebugInfoDWARF MC MCDisassembler MCParser Object all-targets<br>
+required_libraries = DebugInfoDWARF MC MCDisassembler MCParser Object all-targets Demangle<br>
<br>
Modified: llvm/trunk/tools/llvm-objdump/<wbr>MachODump.cpp<br>
URL: <a href="http://llvm.org/viewvc/llvm-project/llvm/trunk/tools/llvm-objdump/MachODump.cpp?rev=280732&r1=280731&r2=280732&view=diff" rel="noreferrer" target="_blank">http://llvm.org/viewvc/llvm-<wbr>project/llvm/trunk/tools/llvm-<wbr>objdump/MachODump.cpp?rev=<wbr>280732&r1=280731&r2=280732&<wbr>view=diff</a><br>
==============================<wbr>==============================<wbr>==================<br>
--- llvm/trunk/tools/llvm-objdump/<wbr>MachODump.cpp (original)<br>
+++ llvm/trunk/tools/llvm-objdump/<wbr>MachODump.cpp Tue Sep 6 14:16:48 2016<br>
@@ -20,6 +20,7 @@<br>
#include "llvm/Config/config.h"<br>
#include "llvm/DebugInfo/DIContext.h"<br>
#include "llvm/DebugInfo/DWARF/<wbr>DWARFContext.h"<br>
+#include "llvm/Demangle/Demangle.h"<br>
#include "llvm/MC/MCAsmInfo.h"<br>
#include "llvm/MC/MCContext.h"<br>
#include "llvm/MC/MCDisassembler/<wbr>MCDisassembler.h"<br>
@@ -48,10 +49,6 @@<br>
#include <cstring><br>
#include <system_error><br>
<br>
-#if HAVE_CXXABI_H<br>
-#include <cxxabi.h><br>
-#endif<br>
-<br>
#ifdef HAVE_LIBXAR<br>
extern "C" {<br>
#include <xar/xar.h><br>
@@ -6235,11 +6232,9 @@ static const char *GuessLiteralPointer(u<br>
// Out type and the ReferenceName will also be set which is added as a comment<br>
// to the disassembled instruction.<br>
//<br>
-#if HAVE_CXXABI_H<br>
// If the symbol name is a C++ mangled name then the demangled name is<br>
// returned through ReferenceName and ReferenceType is set to<br>
// LLVMDisassembler_<wbr>ReferenceType_DeMangled_Name .<br>
-#endif<br>
//<br>
// When this is called to get a symbol name for a branch target then the<br>
// ReferenceType will be LLVMDisassembler_<wbr>ReferenceType_In_Branch and then<br>
@@ -6274,21 +6269,18 @@ static const char *SymbolizerSymbolLookU<br>
method_reference(info, ReferenceType, ReferenceName);<br>
if (*ReferenceType != LLVMDisassembler_<wbr>ReferenceType_Out_Objc_<wbr>Message)<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_Out_SymbolStub;<br>
- } else<br>
-#if HAVE_CXXABI_H<br>
- if (SymbolName != nullptr && strncmp(SymbolName, "__Z", 3) == 0) {<br>
+ } else if (SymbolName != nullptr && strncmp(SymbolName, "__Z", 3) == 0) {<br>
if (info->demangled_name != nullptr)<br>
free(info->demangled_name);<br>
int status;<br>
info->demangled_name =<br>
- abi::__cxa_demangle(SymbolName + 1, nullptr, nullptr, &status);<br>
+ itaniumDemangle(SymbolName + 1, nullptr, nullptr, &status);<br>
if (info->demangled_name != nullptr) {<br>
*ReferenceName = info->demangled_name;<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_DeMangled_Name;<br>
} else<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_InOut_None;<br>
} else<br>
-#endif<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_InOut_None;<br>
} else if (*ReferenceType == LLVMDisassembler_<wbr>ReferenceType_In_PCrel_Load) {<br>
*ReferenceName =<br>
@@ -6377,20 +6369,17 @@ static const char *SymbolizerSymbolLookU<br>
GuessLiteralPointer(<wbr>ReferenceValue, ReferencePC, ReferenceType, info);<br>
if (*ReferenceName == nullptr)<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_InOut_None;<br>
- }<br>
-#if HAVE_CXXABI_H<br>
- else if (SymbolName != nullptr && strncmp(SymbolName, "__Z", 3) == 0) {<br>
+ } else if (SymbolName != nullptr && strncmp(SymbolName, "__Z", 3) == 0) {<br>
if (info->demangled_name != nullptr)<br>
free(info->demangled_name);<br>
int status;<br>
info->demangled_name =<br>
- abi::__cxa_demangle(SymbolName + 1, nullptr, nullptr, &status);<br>
+ itaniumDemangle(SymbolName + 1, nullptr, nullptr, &status);<br>
if (info->demangled_name != nullptr) {<br>
*ReferenceName = info->demangled_name;<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_DeMangled_Name;<br>
}<br>
}<br>
-#endif<br>
else {<br>
*ReferenceName = nullptr;<br>
*ReferenceType = LLVMDisassembler_<wbr>ReferenceType_InOut_None;<br>
<br>
<br>
______________________________<wbr>_________________<br>
llvm-commits mailing list<br>
<a href="mailto:llvm-commits@lists.llvm.org">llvm-commits@lists.llvm.org</a><br>
<a href="http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits" rel="noreferrer" target="_blank">http://lists.llvm.org/cgi-bin/<wbr>mailman/listinfo/llvm-commits</a><br>
</blockquote></div><br></div>