2012-03-13 13:20:01 +00:00
|
|
|
/*
|
|
|
|
* Copyright 2010-2012 PathScale, Inc. All rights reserved.
|
|
|
|
*
|
|
|
|
* Redistribution and use in source and binary forms, with or without
|
|
|
|
* modification, are permitted provided that the following conditions are met:
|
|
|
|
*
|
|
|
|
* 1. Redistributions of source code must retain the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer.
|
|
|
|
*
|
|
|
|
* 2. Redistributions in binary form must reproduce the above copyright notice,
|
|
|
|
* this list of conditions and the following disclaimer in the documentation
|
|
|
|
* and/or other materials provided with the distribution.
|
|
|
|
*
|
|
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS ``AS
|
|
|
|
* IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
* THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
|
|
|
|
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR
|
|
|
|
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
|
|
|
|
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
|
|
|
|
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS;
|
|
|
|
* OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
|
|
|
|
* WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR
|
|
|
|
* OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
|
|
|
|
* ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*/
|
|
|
|
|
2011-11-22 17:30:41 +00:00
|
|
|
#include "typeinfo.h"
|
|
|
|
#include <string.h>
|
|
|
|
#include <stdlib.h>
|
|
|
|
#include <stdio.h>
|
|
|
|
|
|
|
|
using std::type_info;
|
|
|
|
|
|
|
|
type_info::~type_info() {}
|
|
|
|
|
|
|
|
bool type_info::operator==(const type_info &other) const
|
|
|
|
{
|
|
|
|
return __type_name == other.__type_name;
|
|
|
|
}
|
|
|
|
bool type_info::operator!=(const type_info &other) const
|
|
|
|
{
|
|
|
|
return __type_name != other.__type_name;
|
|
|
|
}
|
|
|
|
bool type_info::before(const type_info &other) const
|
|
|
|
{
|
|
|
|
return __type_name < other.__type_name;
|
|
|
|
}
|
|
|
|
const char* type_info::name() const
|
|
|
|
{
|
|
|
|
return __type_name;
|
|
|
|
}
|
|
|
|
type_info::type_info (const type_info& rhs)
|
|
|
|
{
|
|
|
|
__type_name = rhs.__type_name;
|
|
|
|
}
|
|
|
|
type_info& type_info::operator= (const type_info& rhs)
|
|
|
|
{
|
|
|
|
return *new type_info(rhs);
|
|
|
|
}
|
|
|
|
|
|
|
|
ABI_NAMESPACE::__fundamental_type_info::~__fundamental_type_info() {}
|
|
|
|
ABI_NAMESPACE::__array_type_info::~__array_type_info() {}
|
|
|
|
ABI_NAMESPACE::__function_type_info::~__function_type_info() {}
|
|
|
|
ABI_NAMESPACE::__enum_type_info::~__enum_type_info() {}
|
|
|
|
ABI_NAMESPACE::__class_type_info::~__class_type_info() {}
|
|
|
|
ABI_NAMESPACE::__si_class_type_info::~__si_class_type_info() {}
|
|
|
|
ABI_NAMESPACE::__vmi_class_type_info::~__vmi_class_type_info() {}
|
|
|
|
ABI_NAMESPACE::__pbase_type_info::~__pbase_type_info() {}
|
|
|
|
ABI_NAMESPACE::__pointer_type_info::~__pointer_type_info() {}
|
|
|
|
ABI_NAMESPACE::__pointer_to_member_type_info::~__pointer_to_member_type_info() {}
|
|
|
|
|
|
|
|
// From libelftc
|
|
|
|
extern "C" char *__cxa_demangle_gnu3(const char *);
|
|
|
|
|
|
|
|
extern "C" char* __cxa_demangle(const char* mangled_name,
|
|
|
|
char* buf,
|
|
|
|
size_t* n,
|
|
|
|
int* status)
|
|
|
|
{
|
|
|
|
// TODO: We should probably just be linking against libelf-tc, rather than
|
|
|
|
// copying their code. This requires them to do an actual release,
|
|
|
|
// however, and for our changes to be pushed upstream. We also need to
|
|
|
|
// call a different demangling function here depending on the ABI (e.g.
|
|
|
|
// ARM).
|
|
|
|
char *demangled = __cxa_demangle_gnu3(mangled_name);
|
|
|
|
if (NULL != demangled)
|
|
|
|
{
|
|
|
|
size_t len = strlen(demangled);
|
2013-09-23 11:35:49 +00:00
|
|
|
if (buf == NULL)
|
|
|
|
{
|
|
|
|
if (n)
|
|
|
|
{
|
|
|
|
*n = len;
|
|
|
|
}
|
|
|
|
return demangled;
|
|
|
|
}
|
|
|
|
if (*n < len+1)
|
|
|
|
{
|
|
|
|
buf = (char*)realloc(buf, len+1);
|
|
|
|
}
|
2011-11-22 17:30:41 +00:00
|
|
|
if (0 != buf)
|
|
|
|
{
|
|
|
|
memcpy(buf, demangled, len);
|
|
|
|
buf[len] = 0;
|
2012-03-13 13:20:01 +00:00
|
|
|
if (n)
|
|
|
|
{
|
|
|
|
*n = len;
|
|
|
|
}
|
|
|
|
if (status)
|
|
|
|
{
|
|
|
|
*status = 0;
|
|
|
|
}
|
2011-11-22 17:30:41 +00:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-03-13 13:20:01 +00:00
|
|
|
if (status)
|
|
|
|
{
|
|
|
|
*status = -1;
|
|
|
|
}
|
2011-11-22 17:30:41 +00:00
|
|
|
}
|
|
|
|
free(demangled);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2012-03-13 13:20:01 +00:00
|
|
|
if (status)
|
|
|
|
{
|
|
|
|
*status = -2;
|
|
|
|
}
|
2011-11-22 17:30:41 +00:00
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
return buf;
|
|
|
|
}
|