1 //===-- DWARFCompileUnit.cpp ----------------------------------------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "DWARFCompileUnit.h"
11 #include "DWARFContext.h"
12 #include "DWARFFormValue.h"
13 #include "llvm/Support/Dwarf.h"
14 #include "llvm/Support/Format.h"
15 #include "llvm/Support/raw_ostream.h"
17 using namespace dwarf;
19 DataExtractor DWARFCompileUnit::getDebugInfoExtractor() const {
20 return DataExtractor(Context.getInfoSection(),
21 Context.isLittleEndian(), getAddressByteSize());
24 bool DWARFCompileUnit::extract(DataExtractor debug_info, uint32_t *offset_ptr) {
29 if (debug_info.isValidOffset(*offset_ptr)) {
31 const DWARFDebugAbbrev *abbr = Context.getDebugAbbrev();
32 Length = debug_info.getU32(offset_ptr);
33 Version = debug_info.getU16(offset_ptr);
34 abbrOffset = debug_info.getU32(offset_ptr);
35 AddrSize = debug_info.getU8(offset_ptr);
37 bool lengthOK = debug_info.isValidOffset(getNextCompileUnitOffset()-1);
38 bool versionOK = DWARFContext::isSupportedVersion(Version);
39 bool abbrOffsetOK = Context.getAbbrevSection().size() > abbrOffset;
40 bool addrSizeOK = AddrSize == 4 || AddrSize == 8;
42 if (lengthOK && versionOK && addrSizeOK && abbrOffsetOK && abbr != NULL) {
43 Abbrevs = abbr->getAbbreviationDeclarationSet(abbrOffset);
47 // reset the offset to where we tried to parse from if anything went wrong
55 DWARFCompileUnit::extract(uint32_t offset, DataExtractor debug_info_data,
56 const DWARFAbbreviationDeclarationSet *abbrevs) {
61 if (debug_info_data.isValidOffset(offset)) {
62 Length = debug_info_data.getU32(&offset);
63 Version = debug_info_data.getU16(&offset);
64 bool abbrevsOK = debug_info_data.getU32(&offset) == abbrevs->getOffset();
66 AddrSize = debug_info_data.getU8 (&offset);
68 bool versionOK = DWARFContext::isSupportedVersion(Version);
69 bool addrSizeOK = AddrSize == 4 || AddrSize == 8;
71 if (versionOK && addrSizeOK && abbrevsOK &&
72 debug_info_data.isValidOffset(offset))
78 void DWARFCompileUnit::clear() {
88 void DWARFCompileUnit::dump(raw_ostream &OS) {
89 OS << format("0x%08x", Offset) << ": Compile Unit:"
90 << " length = " << format("0x%08x", Length)
91 << " version = " << format("0x%04x", Version)
92 << " abbr_offset = " << format("0x%04x", Abbrevs->getOffset())
93 << " addr_size = " << format("0x%02x", AddrSize)
94 << " (next CU at " << format("0x%08x", getNextCompileUnitOffset())
97 const DWARFDebugInfoEntryMinimal *CU = getCompileUnitDIE(false);
98 assert(CU && "Null Compile Unit?");
99 CU->dump(OS, this, -1U);
102 const char *DWARFCompileUnit::getCompilationDir() {
103 extractDIEsIfNeeded(true);
104 if (DieArray.empty())
106 return DieArray[0].getAttributeValueAsString(this, DW_AT_comp_dir, 0);
109 void DWARFCompileUnit::setDIERelations() {
110 if (DieArray.empty())
112 DWARFDebugInfoEntryMinimal *die_array_begin = &DieArray.front();
113 DWARFDebugInfoEntryMinimal *die_array_end = &DieArray.back();
114 DWARFDebugInfoEntryMinimal *curr_die;
115 // We purposely are skipping the last element in the array in the loop below
116 // so that we can always have a valid next item
117 for (curr_die = die_array_begin; curr_die < die_array_end; ++curr_die) {
118 // Since our loop doesn't include the last element, we can always
119 // safely access the next die in the array.
120 DWARFDebugInfoEntryMinimal *next_die = curr_die + 1;
122 const DWARFAbbreviationDeclaration *curr_die_abbrev =
123 curr_die->getAbbreviationDeclarationPtr();
125 if (curr_die_abbrev) {
127 if (curr_die_abbrev->hasChildren())
128 next_die->setParent(curr_die);
130 curr_die->setSibling(next_die);
132 // NULL DIE that terminates a sibling chain
133 DWARFDebugInfoEntryMinimal *parent = curr_die->getParent();
135 parent->setSibling(next_die);
139 // Since we skipped the last element, we need to fix it up!
140 if (die_array_begin < die_array_end)
141 curr_die->setParent(die_array_begin);
144 size_t DWARFCompileUnit::extractDIEsIfNeeded(bool cu_die_only) {
145 const size_t initial_die_array_size = DieArray.size();
146 if ((cu_die_only && initial_die_array_size > 0) ||
147 initial_die_array_size > 1)
148 return 0; // Already parsed
150 // Set the offset to that of the first DIE and calculate the start of the
151 // next compilation unit header.
152 uint32_t offset = getFirstDIEOffset();
153 uint32_t next_cu_offset = getNextCompileUnitOffset();
155 DWARFDebugInfoEntryMinimal die;
156 // Keep a flat array of the DIE for binary lookup by DIE offset
158 // We are in our compile unit, parse starting at the offset
159 // we were told to parse
161 const uint8_t *fixed_form_sizes =
162 DWARFFormValue::getFixedFormSizesForAddressSize(getAddressByteSize());
164 while (offset < next_cu_offset &&
165 die.extractFast(this, fixed_form_sizes, &offset)) {
169 die.getAttributeValueAsUnsigned(this, DW_AT_low_pc, -1U);
170 if (base_addr == -1U)
171 base_addr = die.getAttributeValueAsUnsigned(this, DW_AT_entry_pc, 0);
172 setBaseAddress(base_addr);
179 else if (depth == 0 && initial_die_array_size == 1) {
180 // Don't append the CU die as we already did that
185 const DWARFAbbreviationDeclaration *abbrDecl =
186 die.getAbbreviationDeclarationPtr();
189 if (abbrDecl->hasChildren())
196 break; // We are done with this compile unit!
201 // Give a little bit of info if we encounter corrupt DWARF (our offset
202 // should always terminate at or before the start of the next compilation
204 if (offset > next_cu_offset)
205 fprintf (stderr, "warning: DWARF compile unit extends beyond its"
206 "bounds cu 0x%8.8x at 0x%8.8x'\n", getOffset(), offset);
209 return DieArray.size();
212 void DWARFCompileUnit::clearDIEs(bool keep_compile_unit_die) {
213 if (DieArray.size() > (unsigned)keep_compile_unit_die) {
214 // std::vectors never get any smaller when resized to a smaller size,
215 // or when clear() or erase() are called, the size will report that it
216 // is smaller, but the memory allocated remains intact (call capacity()
217 // to see this). So we need to create a temporary vector and swap the
218 // contents which will cause just the internal pointers to be swapped
219 // so that when "tmp_array" goes out of scope, it will destroy the
222 // Save at least the compile unit DIE
223 std::vector<DWARFDebugInfoEntryMinimal> tmpArray;
224 DieArray.swap(tmpArray);
225 if (keep_compile_unit_die)
226 DieArray.push_back(tmpArray.front());
231 DWARFCompileUnit::buildAddressRangeTable(DWARFDebugAranges *debug_aranges,
232 bool clear_dies_if_already_not_parsed){
233 // This function is usually called if there in no .debug_aranges section
234 // in order to produce a compile unit level set of address ranges that
235 // is accurate. If the DIEs weren't parsed, then we don't want all dies for
236 // all compile units to stay loaded when they weren't needed. So we can end
237 // up parsing the DWARF and then throwing them all away to keep memory usage
239 const bool clear_dies = extractDIEsIfNeeded(false) > 1 &&
240 clear_dies_if_already_not_parsed;
241 DieArray[0].buildAddressRangeTable(this, debug_aranges);
243 // Keep memory down by clearing DIEs if this generate function
244 // caused them to be parsed.
249 const DWARFDebugInfoEntryMinimal*
250 DWARFCompileUnit::getFunctionDIEForAddress(int64_t address) {
251 extractDIEsIfNeeded(false);
252 for (size_t i = 0, n = DieArray.size(); i != n; i++) {
253 if (DieArray[i].addressRangeContainsAddress(this, address))