193 lines
5.7 KiB
C++
193 lines
5.7 KiB
C++
|
// sol2
|
||
|
|
||
|
// The MIT License (MIT)
|
||
|
|
||
|
// Copyright (c) 2013-2022 Rapptz, ThePhD and contributors
|
||
|
|
||
|
// Permission is hereby granted, free of charge, to any person obtaining a copy of
|
||
|
// this software and associated documentation files (the "Software"), to deal in
|
||
|
// the Software without restriction, including without limitation the rights to
|
||
|
// use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
|
||
|
// the Software, and to permit persons to whom the Software is furnished to do so,
|
||
|
// subject to the following conditions:
|
||
|
|
||
|
// The above copyright notice and this permission notice shall be included in all
|
||
|
// copies or substantial portions of the Software.
|
||
|
|
||
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||
|
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
|
||
|
// FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
|
||
|
// COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
|
||
|
// IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
|
||
|
// CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
|
||
|
|
||
|
#ifndef SOL_DEMANGLE_HPP
|
||
|
#define SOL_DEMANGLE_HPP
|
||
|
|
||
|
#include <sol/string_view.hpp>
|
||
|
#include <string>
|
||
|
#include <array>
|
||
|
#include <cctype>
|
||
|
#if SOL_IS_ON(SOL_MINGW_CCTYPE_IS_POISONED)
|
||
|
extern "C" {
|
||
|
#include <ctype.h>
|
||
|
}
|
||
|
#endif // MinGW is on some stuff
|
||
|
#include <locale>
|
||
|
|
||
|
namespace sol { namespace detail {
|
||
|
inline constexpr std::array<string_view, 9> removals { { "{anonymous}",
|
||
|
"(anonymous namespace)",
|
||
|
"public:",
|
||
|
"private:",
|
||
|
"protected:",
|
||
|
"struct ",
|
||
|
"class ",
|
||
|
"`anonymous-namespace'",
|
||
|
"`anonymous namespace'" } };
|
||
|
|
||
|
|
||
|
#if SOL_IS_ON(SOL_COMPILER_GCC) || SOL_IS_ON(SOL_COMPILER_CLANG)
|
||
|
inline std::string ctti_get_type_name_from_sig(std::string name) {
|
||
|
// cardinal sins from MINGW
|
||
|
using namespace std;
|
||
|
std::size_t start = name.find_first_of('[');
|
||
|
start = name.find_first_of('=', start);
|
||
|
std::size_t end = name.find_last_of(']');
|
||
|
if (end == std::string::npos)
|
||
|
end = name.size();
|
||
|
if (start == std::string::npos)
|
||
|
start = 0;
|
||
|
if (start < name.size() - 1)
|
||
|
start += 1;
|
||
|
name = name.substr(start, end - start);
|
||
|
start = name.rfind("seperator_mark");
|
||
|
if (start != std::string::npos) {
|
||
|
name.erase(start - 2, name.length());
|
||
|
}
|
||
|
while (!name.empty() && isblank(name.front()))
|
||
|
name.erase(name.begin());
|
||
|
while (!name.empty() && isblank(name.back()))
|
||
|
name.pop_back();
|
||
|
|
||
|
for (std::size_t r = 0; r < removals.size(); ++r) {
|
||
|
auto found = name.find(removals[r]);
|
||
|
while (found != std::string::npos) {
|
||
|
name.erase(found, removals[r].size());
|
||
|
found = name.find(removals[r]);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return name;
|
||
|
}
|
||
|
|
||
|
template <typename T, class seperator_mark = int>
|
||
|
inline std::string ctti_get_type_name() {
|
||
|
return ctti_get_type_name_from_sig(__PRETTY_FUNCTION__);
|
||
|
}
|
||
|
#elif SOL_IS_ON(SOL_COMPILER_VCXX)
|
||
|
inline std::string ctti_get_type_name_from_sig(std::string name) {
|
||
|
std::size_t start = name.find("get_type_name");
|
||
|
if (start == std::string::npos)
|
||
|
start = 0;
|
||
|
else
|
||
|
start += 13;
|
||
|
if (start < name.size() - 1)
|
||
|
start += 1;
|
||
|
std::size_t end = name.find_last_of('>');
|
||
|
if (end == std::string::npos)
|
||
|
end = name.size();
|
||
|
name = name.substr(start, end - start);
|
||
|
if (name.find("struct", 0) == 0)
|
||
|
name.replace(0, 6, "", 0);
|
||
|
if (name.find("class", 0) == 0)
|
||
|
name.replace(0, 5, "", 0);
|
||
|
while (!name.empty() && isblank(name.front()))
|
||
|
name.erase(name.begin());
|
||
|
while (!name.empty() && isblank(name.back()))
|
||
|
name.pop_back();
|
||
|
|
||
|
for (std::size_t r = 0; r < removals.size(); ++r) {
|
||
|
auto found = name.find(removals[r]);
|
||
|
while (found != std::string::npos) {
|
||
|
name.erase(found, removals[r].size());
|
||
|
found = name.find(removals[r]);
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return name;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
std::string ctti_get_type_name() {
|
||
|
return ctti_get_type_name_from_sig(__FUNCSIG__);
|
||
|
}
|
||
|
#else
|
||
|
#error Compiler not supported for demangling
|
||
|
#endif // compilers
|
||
|
|
||
|
template <typename T>
|
||
|
std::string demangle_once() {
|
||
|
std::string realname = ctti_get_type_name<T>();
|
||
|
return realname;
|
||
|
}
|
||
|
|
||
|
inline std::string short_demangle_from_type_name(std::string realname) {
|
||
|
// This isn't the most complete but it'll do for now...?
|
||
|
static const std::array<std::string, 10> ops = {
|
||
|
{ "operator<", "operator<<", "operator<<=", "operator<=", "operator>", "operator>>", "operator>>=", "operator>=", "operator->", "operator->*" }
|
||
|
};
|
||
|
int level = 0;
|
||
|
std::size_t idx = 0;
|
||
|
for (idx = static_cast<std::size_t>(realname.empty() ? 0 : realname.size() - 1); idx > 0; --idx) {
|
||
|
if (level == 0 && realname[idx] == ':') {
|
||
|
break;
|
||
|
}
|
||
|
bool isleft = realname[idx] == '<';
|
||
|
bool isright = realname[idx] == '>';
|
||
|
if (!isleft && !isright)
|
||
|
continue;
|
||
|
bool earlybreak = false;
|
||
|
for (const auto& op : ops) {
|
||
|
std::size_t nisop = realname.rfind(op, idx);
|
||
|
if (nisop == std::string::npos)
|
||
|
continue;
|
||
|
std::size_t nisopidx = idx - op.size() + 1;
|
||
|
if (nisop == nisopidx) {
|
||
|
idx = static_cast<std::size_t>(nisopidx);
|
||
|
earlybreak = true;
|
||
|
}
|
||
|
break;
|
||
|
}
|
||
|
if (earlybreak) {
|
||
|
continue;
|
||
|
}
|
||
|
level += isleft ? -1 : 1;
|
||
|
}
|
||
|
if (idx > 0) {
|
||
|
realname.erase(0, realname.length() < static_cast<std::size_t>(idx) ? realname.length() : idx + 1);
|
||
|
}
|
||
|
return realname;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
std::string short_demangle_once() {
|
||
|
std::string realname = ctti_get_type_name<T>();
|
||
|
return short_demangle_from_type_name(realname);
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
const std::string& demangle() {
|
||
|
static const std::string d = demangle_once<T>();
|
||
|
return d;
|
||
|
}
|
||
|
|
||
|
template <typename T>
|
||
|
const std::string& short_demangle() {
|
||
|
static const std::string d = short_demangle_once<T>();
|
||
|
return d;
|
||
|
}
|
||
|
}} // namespace sol::detail
|
||
|
|
||
|
#endif // SOL_DEMANGLE_HPP
|