a8022fa70d
Fixed an issue that would happen when using debug map with DWARF in the .o files where we wouldn't ever track down the actual definition for a type when things were in namespaces. We now serialize the decl context information into an intermediate format which allows us to track down the correct definition for a type regardless of which DWARF symbol file it comes from. We do this by creating a "DWARFDeclContext" object that contains the DW_TAG + name for each item in a decl context which we can then use to veto potential accelerator table matches. For example, the accelerator tables store the basename of the type, so if you have "std::vector<int>", we would end up with an accelerator table entry for the type that contained "vector<int>", which we would then search for using a DWARFDeclContext object that contained: [0] DW_TAG_class_type "vector<int>" [1] DW_TAG_namespace "std" This is currently used to track down forward declarations for things like "class a::b::Foo;". llvm-svn: 155488
83 lines
2.5 KiB
C++
83 lines
2.5 KiB
C++
//===-- DWARFDeclContext.cpp ------------------------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "DWARFDeclContext.h"
|
|
|
|
const char *
|
|
DWARFDeclContext::GetQualifiedName () const
|
|
{
|
|
if (m_qualified_name.empty())
|
|
{
|
|
// The declaration context array for a class named "foo" in namespace
|
|
// "a::b::c" will be something like:
|
|
// [0] DW_TAG_class_type "foo"
|
|
// [1] DW_TAG_namespace "c"
|
|
// [2] DW_TAG_namespace "b"
|
|
// [3] DW_TAG_namespace "a"
|
|
if (!m_entries.empty())
|
|
{
|
|
if (m_entries.size() == 1)
|
|
{
|
|
if (m_entries[0].name)
|
|
{
|
|
m_qualified_name.append("::");
|
|
m_qualified_name.append(m_entries[0].name);
|
|
}
|
|
}
|
|
else
|
|
{
|
|
collection::const_reverse_iterator pos;
|
|
collection::const_reverse_iterator begin = m_entries.rbegin();
|
|
collection::const_reverse_iterator end = m_entries.rend();
|
|
for (pos = begin; pos != end; ++pos)
|
|
{
|
|
if (pos != begin)
|
|
m_qualified_name.append("::");
|
|
m_qualified_name.append(pos->name);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
if (m_qualified_name.empty())
|
|
return NULL;
|
|
return m_qualified_name.c_str();
|
|
}
|
|
|
|
|
|
bool
|
|
DWARFDeclContext::operator==(const DWARFDeclContext& rhs) const
|
|
{
|
|
if (m_entries.size() != rhs.m_entries.size())
|
|
return false;
|
|
|
|
collection::const_iterator pos;
|
|
collection::const_iterator begin = m_entries.begin();
|
|
collection::const_iterator end = m_entries.end();
|
|
|
|
collection::const_iterator rhs_pos;
|
|
collection::const_iterator rhs_begin = rhs.m_entries.begin();
|
|
// The two entry arrays have the same size
|
|
|
|
// First compare the tags before we do expensize name compares
|
|
for (pos = begin, rhs_pos = rhs_begin; pos != end; ++pos, ++rhs_pos)
|
|
{
|
|
if (pos->tag != rhs_pos->tag)
|
|
return false;
|
|
}
|
|
// The tags all match, now compare the names
|
|
for (pos = begin, rhs_pos = rhs_begin; pos != end; ++pos, ++rhs_pos)
|
|
{
|
|
if (!pos->NameMatches (*rhs_pos))
|
|
return false;
|
|
}
|
|
// All tags and names match
|
|
return true;
|
|
}
|
|
|