demangle.hpp 5.7 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192
  1. // sol2
  2. // The MIT License (MIT)
  3. // Copyright (c) 2013-2022 Rapptz, ThePhD and contributors
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy of
  5. // this software and associated documentation files (the "Software"), to deal in
  6. // the Software without restriction, including without limitation the rights to
  7. // use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
  8. // the Software, and to permit persons to whom the Software is furnished to do so,
  9. // subject to the following conditions:
  10. // The above copyright notice and this permission notice shall be included in all
  11. // copies or substantial portions of the Software.
  12. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  13. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
  14. // FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
  15. // COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
  16. // IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  17. // CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  18. #ifndef SOL_DEMANGLE_HPP
  19. #define SOL_DEMANGLE_HPP
  20. #include <sol/string_view.hpp>
  21. #include <string>
  22. #include <array>
  23. #include <cctype>
  24. #if SOL_IS_ON(SOL_MINGW_CCTYPE_IS_POISONED)
  25. extern "C" {
  26. #include <ctype.h>
  27. }
  28. #endif // MinGW is on some stuff
  29. #include <locale>
  30. namespace sol { namespace detail {
  31. inline constexpr std::array<string_view, 9> removals { { "{anonymous}",
  32. "(anonymous namespace)",
  33. "public:",
  34. "private:",
  35. "protected:",
  36. "struct ",
  37. "class ",
  38. "`anonymous-namespace'",
  39. "`anonymous namespace'" } };
  40. #if SOL_IS_ON(SOL_COMPILER_GCC) || SOL_IS_ON(SOL_COMPILER_CLANG)
  41. inline std::string ctti_get_type_name_from_sig(std::string name) {
  42. // cardinal sins from MINGW
  43. using namespace std;
  44. std::size_t start = name.find_first_of('[');
  45. start = name.find_first_of('=', start);
  46. std::size_t end = name.find_last_of(']');
  47. if (end == std::string::npos)
  48. end = name.size();
  49. if (start == std::string::npos)
  50. start = 0;
  51. if (start < name.size() - 1)
  52. start += 1;
  53. name = name.substr(start, end - start);
  54. start = name.rfind("seperator_mark");
  55. if (start != std::string::npos) {
  56. name.erase(start - 2, name.length());
  57. }
  58. while (!name.empty() && isblank(name.front()))
  59. name.erase(name.begin());
  60. while (!name.empty() && isblank(name.back()))
  61. name.pop_back();
  62. for (std::size_t r = 0; r < removals.size(); ++r) {
  63. auto found = name.find(removals[r]);
  64. while (found != std::string::npos) {
  65. name.erase(found, removals[r].size());
  66. found = name.find(removals[r]);
  67. }
  68. }
  69. return name;
  70. }
  71. template <typename T, class seperator_mark = int>
  72. inline std::string ctti_get_type_name() {
  73. return ctti_get_type_name_from_sig(__PRETTY_FUNCTION__);
  74. }
  75. #elif SOL_IS_ON(SOL_COMPILER_VCXX)
  76. inline std::string ctti_get_type_name_from_sig(std::string name) {
  77. std::size_t start = name.find("get_type_name");
  78. if (start == std::string::npos)
  79. start = 0;
  80. else
  81. start += 13;
  82. if (start < name.size() - 1)
  83. start += 1;
  84. std::size_t end = name.find_last_of('>');
  85. if (end == std::string::npos)
  86. end = name.size();
  87. name = name.substr(start, end - start);
  88. if (name.find("struct", 0) == 0)
  89. name.replace(0, 6, "", 0);
  90. if (name.find("class", 0) == 0)
  91. name.replace(0, 5, "", 0);
  92. while (!name.empty() && isblank(name.front()))
  93. name.erase(name.begin());
  94. while (!name.empty() && isblank(name.back()))
  95. name.pop_back();
  96. for (std::size_t r = 0; r < removals.size(); ++r) {
  97. auto found = name.find(removals[r]);
  98. while (found != std::string::npos) {
  99. name.erase(found, removals[r].size());
  100. found = name.find(removals[r]);
  101. }
  102. }
  103. return name;
  104. }
  105. template <typename T>
  106. std::string ctti_get_type_name() {
  107. return ctti_get_type_name_from_sig(__FUNCSIG__);
  108. }
  109. #else
  110. #error Compiler not supported for demangling
  111. #endif // compilers
  112. template <typename T>
  113. std::string demangle_once() {
  114. std::string realname = ctti_get_type_name<T>();
  115. return realname;
  116. }
  117. inline std::string short_demangle_from_type_name(std::string realname) {
  118. // This isn't the most complete but it'll do for now...?
  119. static const std::array<std::string, 10> ops = {
  120. { "operator<", "operator<<", "operator<<=", "operator<=", "operator>", "operator>>", "operator>>=", "operator>=", "operator->", "operator->*" }
  121. };
  122. int level = 0;
  123. std::size_t idx = 0;
  124. for (idx = static_cast<std::size_t>(realname.empty() ? 0 : realname.size() - 1); idx > 0; --idx) {
  125. if (level == 0 && realname[idx] == ':') {
  126. break;
  127. }
  128. bool isleft = realname[idx] == '<';
  129. bool isright = realname[idx] == '>';
  130. if (!isleft && !isright)
  131. continue;
  132. bool earlybreak = false;
  133. for (const auto& op : ops) {
  134. std::size_t nisop = realname.rfind(op, idx);
  135. if (nisop == std::string::npos)
  136. continue;
  137. std::size_t nisopidx = idx - op.size() + 1;
  138. if (nisop == nisopidx) {
  139. idx = static_cast<std::size_t>(nisopidx);
  140. earlybreak = true;
  141. }
  142. break;
  143. }
  144. if (earlybreak) {
  145. continue;
  146. }
  147. level += isleft ? -1 : 1;
  148. }
  149. if (idx > 0) {
  150. realname.erase(0, realname.length() < static_cast<std::size_t>(idx) ? realname.length() : idx + 1);
  151. }
  152. return realname;
  153. }
  154. template <typename T>
  155. std::string short_demangle_once() {
  156. std::string realname = ctti_get_type_name<T>();
  157. return short_demangle_from_type_name(realname);
  158. }
  159. template <typename T>
  160. const std::string& demangle() {
  161. static const std::string d = demangle_once<T>();
  162. return d;
  163. }
  164. template <typename T>
  165. const std::string& short_demangle() {
  166. static const std::string d = short_demangle_once<T>();
  167. return d;
  168. }
  169. }} // namespace sol::detail
  170. #endif // SOL_DEMANGLE_HPP