OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:DIEs
(Results
1 - 5
of
5
) sorted by null
/external/llvm/lib/CodeGen/AsmPrinter/
DwarfAccelTable.cpp
37
DataArray &
DIEs
= Entries[Name];
38
assert(!
DIEs
.StrSym ||
DIEs
.StrSym == StrSym);
39
DIEs
.StrSym = StrSym;
40
DIEs
.Values.push_back(new (Allocator) HashDataContents(die, Flags));
64
// compareDIEs - comparison predicate that sorts
DIEs
by their offset.
175
// the bucket. For the string case emit the
dies
and the various offsets.
188
Asm->OutStreamer.AddComment("Num
DIEs
");
/external/llvm/lib/DebugInfo/
DWARFDebugInfoEntry.h
145
///
DIEs
, (possibly ending with subprogram DIE), all of which are contained
151
SmallVector<DWARFDebugInfoEntryMinimal, 4>
DIEs
;
DWARFUnit.h
131
/// chain is valid as long as parsed compile unit
DIEs
are not cleared.
138
/// extractDIEsIfNeeded - Parses a compile unit and indexes its
DIEs
if it
139
/// hasn't already been done. Returns the number of
DIEs
parsed at this call.
141
/// extractDIEsToVector - Appends all parsed
DIEs
to a vector.
143
std::vector<DWARFDebugInfoEntryMinimal> &
DIEs
) const;
148
/// clearDIEs - Clear parsed
DIEs
to keep memory usage low.
157
/// compile unit
DIEs
are not cleared.
DWARFDebugInfoEntry.cpp
344
InlinedChain.
DIEs
.push_back(*DIE);
358
std::reverse(InlinedChain.
DIEs
.begin(), InlinedChain.
DIEs
.end());
DWARFContext.cpp
479
if (InlinedChain.
DIEs
.size() == 0)
481
const DWARFDebugInfoEntryMinimal &TopFunctionDIE = InlinedChain.
DIEs
[0];
559
if (InlinedChain.
DIEs
.size() == 0) {
574
for (uint32_t i = 0, n = InlinedChain.
DIEs
.size(); i != n; i++) {
575
const DWARFDebugInfoEntryMinimal &FunctionDIE = InlinedChain.
DIEs
[i];
Completed in 76 milliseconds