blob: 3835d4da9ae9d28cac8615cb47e2436653638132 [file] [log] [blame]
David Blaikie07e22442013-09-23 22:44:40 +00001//===-- DWARFUnit.cpp -----------------------------------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Eugene Zelenko570e39a2016-11-23 23:16:32 +000010#include "llvm/ADT/SmallString.h"
11#include "llvm/ADT/STLExtras.h"
12#include "llvm/ADT/StringRef.h"
13#include "llvm/DebugInfo/DWARF/DWARFAbbreviationDeclaration.h"
Zachary Turner82af9432015-01-30 18:07:45 +000014#include "llvm/DebugInfo/DWARF/DWARFContext.h"
Eugene Zelenko570e39a2016-11-23 23:16:32 +000015#include "llvm/DebugInfo/DWARF/DWARFDebugAbbrev.h"
Eugene Zelenko28db7e62017-03-01 01:14:23 +000016#include "llvm/DebugInfo/DWARF/DWARFDebugInfoEntry.h"
17#include "llvm/DebugInfo/DWARF/DWARFDie.h"
Greg Clayton97d22182017-01-13 21:08:18 +000018#include "llvm/DebugInfo/DWARF/DWARFFormValue.h"
Eugene Zelenko570e39a2016-11-23 23:16:32 +000019#include "llvm/DebugInfo/DWARF/DWARFUnit.h"
20#include "llvm/Object/ObjectFile.h"
21#include "llvm/Support/Casting.h"
22#include "llvm/Support/DataExtractor.h"
David Blaikie07e22442013-09-23 22:44:40 +000023#include "llvm/Support/Path.h"
Eugene Zelenko570e39a2016-11-23 23:16:32 +000024#include <algorithm>
25#include <cassert>
Eugene Zelenko28db7e62017-03-01 01:14:23 +000026#include <cstddef>
Eugene Zelenko570e39a2016-11-23 23:16:32 +000027#include <cstdint>
David Blaikie8de5e982013-09-23 23:15:57 +000028#include <cstdio>
Eugene Zelenko570e39a2016-11-23 23:16:32 +000029#include <vector>
David Blaikie07e22442013-09-23 22:44:40 +000030
Eugene Zelenko28db7e62017-03-01 01:14:23 +000031using namespace llvm;
David Blaikie07e22442013-09-23 22:44:40 +000032using namespace dwarf;
33
Alexey Samsonov8cd4c9d2014-10-08 00:07:53 +000034void DWARFUnitSectionBase::parse(DWARFContext &C, const DWARFSection &Section) {
George Rimarca532112017-04-24 10:19:45 +000035 parseImpl(C, Section, C.getDebugAbbrev(), &C.getRangeSection(),
Alexey Samsonov8cd4c9d2014-10-08 00:07:53 +000036 C.getStringSection(), StringRef(), C.getAddrSection(),
David Blaikiee438cff2016-04-22 22:50:56 +000037 C.getLineSection().Data, C.isLittleEndian(), false);
Frederic Riss6005dbd2014-10-06 03:36:18 +000038}
39
Alexey Samsonov8cd4c9d2014-10-08 00:07:53 +000040void DWARFUnitSectionBase::parseDWO(DWARFContext &C,
David Blaikie82641be2015-11-17 00:39:55 +000041 const DWARFSection &DWOSection,
42 DWARFUnitIndex *Index) {
George Rimarca532112017-04-24 10:19:45 +000043 parseImpl(C, DWOSection, C.getDebugAbbrevDWO(), &C.getRangeDWOSection(),
Frederic Riss6005dbd2014-10-06 03:36:18 +000044 C.getStringDWOSection(), C.getStringOffsetDWOSection(),
David Blaikiee438cff2016-04-22 22:50:56 +000045 C.getAddrSection(), C.getLineDWOSection().Data, C.isLittleEndian(),
46 true);
Frederic Riss6005dbd2014-10-06 03:36:18 +000047}
48
Alexey Samsonov4b4d64b2014-10-08 00:24:41 +000049DWARFUnit::DWARFUnit(DWARFContext &DC, const DWARFSection &Section,
George Rimarca532112017-04-24 10:19:45 +000050 const DWARFDebugAbbrev *DA, const DWARFSection *RS,
51 StringRef SS, StringRef SOS, StringRef AOS, StringRef LS,
52 bool LE, bool IsDWO,
53 const DWARFUnitSectionBase &UnitSection,
David Blaikie82641be2015-11-17 00:39:55 +000054 const DWARFUnitIndex::Entry *IndexEntry)
Alexey Samsonov4b4d64b2014-10-08 00:24:41 +000055 : Context(DC), InfoSection(Section), Abbrev(DA), RangeSection(RS),
David Blaikie35c2eeb2015-11-17 22:39:23 +000056 LineSection(LS), StringSection(SS), StringOffsetSection([&]() {
David Blaikie4689ef52015-11-17 22:39:26 +000057 if (IndexEntry)
58 if (const auto *C = IndexEntry->getOffset(DW_SECT_STR_OFFSETS))
59 return SOS.slice(C->Offset, C->Offset + C->Length);
David Blaikie35c2eeb2015-11-17 22:39:23 +000060 return SOS;
61 }()),
David Blaikiee438cff2016-04-22 22:50:56 +000062 AddrOffsetSection(AOS), isLittleEndian(LE), isDWO(IsDWO),
63 UnitSection(UnitSection), IndexEntry(IndexEntry) {
David Blaikie07e22442013-09-23 22:44:40 +000064 clear();
65}
66
Eugene Zelenko570e39a2016-11-23 23:16:32 +000067DWARFUnit::~DWARFUnit() = default;
David Blaikie07e22442013-09-23 22:44:40 +000068
69bool DWARFUnit::getAddrOffsetSectionItem(uint32_t Index,
70 uint64_t &Result) const {
71 uint32_t Offset = AddrOffsetSectionBase + Index * AddrSize;
72 if (AddrOffsetSection.size() < Offset + AddrSize)
73 return false;
74 DataExtractor DA(AddrOffsetSection, isLittleEndian, AddrSize);
75 Result = DA.getAddress(&Offset);
76 return true;
77}
78
79bool DWARFUnit::getStringOffsetSectionItem(uint32_t Index,
80 uint32_t &Result) const {
81 // FIXME: string offset section entries are 8-byte for DWARF64.
82 const uint32_t ItemSize = 4;
83 uint32_t Offset = Index * ItemSize;
84 if (StringOffsetSection.size() < Offset + ItemSize)
85 return false;
86 DataExtractor DA(StringOffsetSection, isLittleEndian, 0);
87 Result = DA.getU32(&Offset);
88 return true;
89}
90
91bool DWARFUnit::extractImpl(DataExtractor debug_info, uint32_t *offset_ptr) {
92 Length = debug_info.getU32(offset_ptr);
93 Version = debug_info.getU16(offset_ptr);
Paul Robinsoncddd6042017-02-28 20:24:55 +000094 uint64_t AbbrOffset;
95 if (Version >= 5) {
96 UnitType = debug_info.getU8(offset_ptr);
97 AddrSize = debug_info.getU8(offset_ptr);
98 AbbrOffset = debug_info.getU32(offset_ptr);
99 } else {
100 AbbrOffset = debug_info.getU32(offset_ptr);
101 AddrSize = debug_info.getU8(offset_ptr);
102 }
David Blaikie82641be2015-11-17 00:39:55 +0000103 if (IndexEntry) {
104 if (AbbrOffset)
105 return false;
106 auto *UnitContrib = IndexEntry->getOffset();
107 if (!UnitContrib || UnitContrib->Length != (Length + 4))
108 return false;
109 auto *AbbrEntry = IndexEntry->getOffset(DW_SECT_ABBREV);
110 if (!AbbrEntry)
111 return false;
112 AbbrOffset = AbbrEntry->Offset;
113 }
David Blaikie07e22442013-09-23 22:44:40 +0000114
Alexey Samsonov7682f812014-04-24 22:51:03 +0000115 bool LengthOK = debug_info.isValidOffset(getNextUnitOffset() - 1);
116 bool VersionOK = DWARFContext::isSupportedVersion(Version);
117 bool AddrSizeOK = AddrSize == 4 || AddrSize == 8;
David Blaikie07e22442013-09-23 22:44:40 +0000118
Alexey Samsonov7682f812014-04-24 22:51:03 +0000119 if (!LengthOK || !VersionOK || !AddrSizeOK)
David Blaikie07e22442013-09-23 22:44:40 +0000120 return false;
121
Alexey Samsonov7682f812014-04-24 22:51:03 +0000122 Abbrevs = Abbrev->getAbbreviationDeclarationSet(AbbrOffset);
Benjamin Kramer68a29562015-05-25 13:28:03 +0000123 return Abbrevs != nullptr;
David Blaikie07e22442013-09-23 22:44:40 +0000124}
125
126bool DWARFUnit::extract(DataExtractor debug_info, uint32_t *offset_ptr) {
127 clear();
128
129 Offset = *offset_ptr;
130
131 if (debug_info.isValidOffset(*offset_ptr)) {
132 if (extractImpl(debug_info, offset_ptr))
133 return true;
134
135 // reset the offset to where we tried to parse from if anything went wrong
136 *offset_ptr = Offset;
137 }
138
139 return false;
140}
141
David Blaikie07e22442013-09-23 22:44:40 +0000142bool DWARFUnit::extractRangeList(uint32_t RangeListOffset,
143 DWARFDebugRangeList &RangeList) const {
144 // Require that compile unit is extracted.
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000145 assert(!DieArray.empty());
George Rimarca532112017-04-24 10:19:45 +0000146 DataExtractor RangesData(RangeSection->Data, isLittleEndian, AddrSize);
David Blaikie07e22442013-09-23 22:44:40 +0000147 uint32_t ActualRangeListOffset = RangeSectionBase + RangeListOffset;
George Rimarca532112017-04-24 10:19:45 +0000148 return RangeList.extract(RangesData, &ActualRangeListOffset,
149 RangeSection->Relocs);
David Blaikie07e22442013-09-23 22:44:40 +0000150}
151
152void DWARFUnit::clear() {
153 Offset = 0;
154 Length = 0;
155 Version = 0;
Craig Topper2617dcc2014-04-15 06:32:26 +0000156 Abbrevs = nullptr;
David Blaikie07e22442013-09-23 22:44:40 +0000157 AddrSize = 0;
158 BaseAddr = 0;
159 RangeSectionBase = 0;
160 AddrOffsetSectionBase = 0;
161 clearDIEs(false);
162 DWO.reset();
163}
164
165const char *DWARFUnit::getCompilationDir() {
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000166 return dwarf::toString(getUnitDIE().find(DW_AT_comp_dir), nullptr);
David Blaikie07e22442013-09-23 22:44:40 +0000167}
168
Greg Clayton52fe1f62016-12-14 22:38:08 +0000169Optional<uint64_t> DWARFUnit::getDWOId() {
Greg Clayton97d22182017-01-13 21:08:18 +0000170 return toUnsigned(getUnitDIE().find(DW_AT_GNU_dwo_id));
David Blaikie07e22442013-09-23 22:44:40 +0000171}
172
David Blaikie07e22442013-09-23 22:44:40 +0000173void DWARFUnit::extractDIEsToVector(
174 bool AppendCUDie, bool AppendNonCUDies,
Greg Claytonc8c10322016-12-13 18:25:19 +0000175 std::vector<DWARFDebugInfoEntry> &Dies) const {
David Blaikie07e22442013-09-23 22:44:40 +0000176 if (!AppendCUDie && !AppendNonCUDies)
177 return;
178
179 // Set the offset to that of the first DIE and calculate the start of the
180 // next compilation unit header.
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000181 uint32_t DIEOffset = Offset + getHeaderSize();
David Blaikie07e22442013-09-23 22:44:40 +0000182 uint32_t NextCUOffset = getNextUnitOffset();
Greg Claytonc8c10322016-12-13 18:25:19 +0000183 DWARFDebugInfoEntry DIE;
Greg Clayton6f6e4db2016-11-15 01:23:06 +0000184 DataExtractor DebugInfoData = getDebugInfoExtractor();
David Blaikie07e22442013-09-23 22:44:40 +0000185 uint32_t Depth = 0;
David Blaikie07e22442013-09-23 22:44:40 +0000186 bool IsCUDie = true;
187
Greg Clayton78a07bf2016-12-21 21:37:06 +0000188 while (DIE.extractFast(*this, &DIEOffset, DebugInfoData, NextCUOffset,
189 Depth)) {
David Blaikie07e22442013-09-23 22:44:40 +0000190 if (IsCUDie) {
191 if (AppendCUDie)
192 Dies.push_back(DIE);
193 if (!AppendNonCUDies)
194 break;
195 // The average bytes per DIE entry has been seen to be
196 // around 14-20 so let's pre-reserve the needed memory for
197 // our DIE entries accordingly.
198 Dies.reserve(Dies.size() + getDebugInfoSize() / 14);
199 IsCUDie = false;
200 } else {
201 Dies.push_back(DIE);
202 }
203
Alexey Samsonov8e4cf3b2014-04-29 17:12:42 +0000204 if (const DWARFAbbreviationDeclaration *AbbrDecl =
205 DIE.getAbbreviationDeclarationPtr()) {
David Blaikie07e22442013-09-23 22:44:40 +0000206 // Normal DIE
207 if (AbbrDecl->hasChildren())
208 ++Depth;
209 } else {
210 // NULL DIE.
211 if (Depth > 0)
212 --Depth;
213 if (Depth == 0)
214 break; // We are done with this compile unit!
215 }
216 }
217
218 // Give a little bit of info if we encounter corrupt DWARF (our offset
219 // should always terminate at or before the start of the next compilation
220 // unit header).
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000221 if (DIEOffset > NextCUOffset)
David Blaikie07e22442013-09-23 22:44:40 +0000222 fprintf(stderr, "warning: DWARF compile unit extends beyond its "
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000223 "bounds cu 0x%8.8x at 0x%8.8x'\n", getOffset(), DIEOffset);
David Blaikie07e22442013-09-23 22:44:40 +0000224}
225
226size_t DWARFUnit::extractDIEsIfNeeded(bool CUDieOnly) {
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000227 if ((CUDieOnly && !DieArray.empty()) ||
David Blaikie07e22442013-09-23 22:44:40 +0000228 DieArray.size() > 1)
229 return 0; // Already parsed.
230
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000231 bool HasCUDie = !DieArray.empty();
David Blaikie07e22442013-09-23 22:44:40 +0000232 extractDIEsToVector(!HasCUDie, !CUDieOnly, DieArray);
233
234 if (DieArray.empty())
235 return 0;
236
237 // If CU DIE was just parsed, copy several attribute values from it.
238 if (!HasCUDie) {
Greg Claytonc8c10322016-12-13 18:25:19 +0000239 DWARFDie UnitDie = getUnitDIE();
Greg Claytonc109bbe2017-01-13 22:32:12 +0000240 auto BaseAddr = toAddress(UnitDie.find({DW_AT_low_pc, DW_AT_entry_pc}));
Greg Clayton52fe1f62016-12-14 22:38:08 +0000241 if (BaseAddr)
242 setBaseAddress(*BaseAddr);
Greg Clayton97d22182017-01-13 21:08:18 +0000243 AddrOffsetSectionBase = toSectionOffset(UnitDie.find(DW_AT_GNU_addr_base), 0);
244 RangeSectionBase = toSectionOffset(UnitDie.find(DW_AT_rnglists_base), 0);
Alexey Samsonovaa909982014-06-13 22:31:03 +0000245 // Don't fall back to DW_AT_GNU_ranges_base: it should be ignored for
246 // skeleton CU DIE, so that DWARF users not aware of it are not broken.
David Blaikie07e22442013-09-23 22:44:40 +0000247 }
248
David Blaikie07e22442013-09-23 22:44:40 +0000249 return DieArray.size();
250}
251
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000252DWARFUnit::DWOHolder::DWOHolder(StringRef DWOPath) {
Alexey Samsonovd3e12132014-09-05 19:29:45 +0000253 auto Obj = object::ObjectFile::createObjectFile(DWOPath);
Kevin Enderby3fcdf6a2016-04-06 22:14:09 +0000254 if (!Obj) {
255 // TODO: Actually report errors helpfully.
256 consumeError(Obj.takeError());
Alexey Samsonovd3e12132014-09-05 19:29:45 +0000257 return;
Kevin Enderby3fcdf6a2016-04-06 22:14:09 +0000258 }
Alexey Samsonovd3e12132014-09-05 19:29:45 +0000259 DWOFile = std::move(Obj.get());
260 DWOContext.reset(
Zachary Turner6489d7b2015-04-23 17:37:47 +0000261 cast<DWARFContext>(new DWARFContextInMemory(*DWOFile.getBinary())));
David Blaikie07e22442013-09-23 22:44:40 +0000262 if (DWOContext->getNumDWOCompileUnits() > 0)
263 DWOU = DWOContext->getDWOCompileUnitAtIndex(0);
264}
265
266bool DWARFUnit::parseDWO() {
David Blaikiee438cff2016-04-22 22:50:56 +0000267 if (isDWO)
268 return false;
Craig Topper2617dcc2014-04-15 06:32:26 +0000269 if (DWO.get())
David Blaikie07e22442013-09-23 22:44:40 +0000270 return false;
Greg Claytonc8c10322016-12-13 18:25:19 +0000271 DWARFDie UnitDie = getUnitDIE();
272 if (!UnitDie)
David Blaikie07e22442013-09-23 22:44:40 +0000273 return false;
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000274 auto DWOFileName = dwarf::toString(UnitDie.find(DW_AT_GNU_dwo_name));
Craig Topper2617dcc2014-04-15 06:32:26 +0000275 if (!DWOFileName)
David Blaikie07e22442013-09-23 22:44:40 +0000276 return false;
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000277 auto CompilationDir = dwarf::toString(UnitDie.find(DW_AT_comp_dir));
David Blaikie07e22442013-09-23 22:44:40 +0000278 SmallString<16> AbsolutePath;
Greg Clayton97d22182017-01-13 21:08:18 +0000279 if (sys::path::is_relative(*DWOFileName) && CompilationDir &&
280 *CompilationDir) {
281 sys::path::append(AbsolutePath, *CompilationDir);
David Blaikie07e22442013-09-23 22:44:40 +0000282 }
Greg Clayton97d22182017-01-13 21:08:18 +0000283 sys::path::append(AbsolutePath, *DWOFileName);
Alexey Samsonovd3e12132014-09-05 19:29:45 +0000284 DWO = llvm::make_unique<DWOHolder>(AbsolutePath);
David Blaikie07e22442013-09-23 22:44:40 +0000285 DWARFUnit *DWOCU = DWO->getUnit();
286 // Verify that compile unit in .dwo file is valid.
Craig Topper2617dcc2014-04-15 06:32:26 +0000287 if (!DWOCU || DWOCU->getDWOId() != getDWOId()) {
David Blaikie07e22442013-09-23 22:44:40 +0000288 DWO.reset();
289 return false;
290 }
291 // Share .debug_addr and .debug_ranges section with compile unit in .dwo
292 DWOCU->setAddrOffsetSection(AddrOffsetSection, AddrOffsetSectionBase);
Greg Clayton52fe1f62016-12-14 22:38:08 +0000293 auto DWORangesBase = UnitDie.getRangesBaseAttribute();
294 DWOCU->setRangesSection(RangeSection, DWORangesBase ? *DWORangesBase : 0);
David Blaikie07e22442013-09-23 22:44:40 +0000295 return true;
296}
297
298void DWARFUnit::clearDIEs(bool KeepCUDie) {
299 if (DieArray.size() > (unsigned)KeepCUDie) {
300 // std::vectors never get any smaller when resized to a smaller size,
301 // or when clear() or erase() are called, the size will report that it
302 // is smaller, but the memory allocated remains intact (call capacity()
303 // to see this). So we need to create a temporary vector and swap the
304 // contents which will cause just the internal pointers to be swapped
305 // so that when temporary vector goes out of scope, it will destroy the
306 // contents.
Greg Claytonc8c10322016-12-13 18:25:19 +0000307 std::vector<DWARFDebugInfoEntry> TmpArray;
David Blaikie07e22442013-09-23 22:44:40 +0000308 DieArray.swap(TmpArray);
309 // Save at least the compile unit DIE
310 if (KeepCUDie)
311 DieArray.push_back(TmpArray.front());
312 }
313}
314
Alexey Samsonov762343d2014-04-18 17:25:46 +0000315void DWARFUnit::collectAddressRanges(DWARFAddressRangesVector &CURanges) {
Greg Claytonc8c10322016-12-13 18:25:19 +0000316 DWARFDie UnitDie = getUnitDIE();
317 if (!UnitDie)
Alexey Samsonov7a18c062015-05-19 21:54:32 +0000318 return;
319 // First, check if unit DIE describes address ranges for the whole unit.
Greg Claytonc8c10322016-12-13 18:25:19 +0000320 const auto &CUDIERanges = UnitDie.getAddressRanges();
Alexey Samsonov84e24232014-04-18 20:30:27 +0000321 if (!CUDIERanges.empty()) {
322 CURanges.insert(CURanges.end(), CUDIERanges.begin(), CUDIERanges.end());
323 return;
324 }
325
David Blaikie07e22442013-09-23 22:44:40 +0000326 // This function is usually called if there in no .debug_aranges section
327 // in order to produce a compile unit level set of address ranges that
328 // is accurate. If the DIEs weren't parsed, then we don't want all dies for
329 // all compile units to stay loaded when they weren't needed. So we can end
330 // up parsing the DWARF and then throwing them all away to keep memory usage
331 // down.
Alexey Samsonov762343d2014-04-18 17:25:46 +0000332 const bool ClearDIEs = extractDIEsIfNeeded(false) > 1;
Greg Claytonc8c10322016-12-13 18:25:19 +0000333 getUnitDIE().collectChildrenAddressRanges(CURanges);
Alexey Samsonov762343d2014-04-18 17:25:46 +0000334
335 // Collect address ranges from DIEs in .dwo if necessary.
David Blaikie07e22442013-09-23 22:44:40 +0000336 bool DWOCreated = parseDWO();
Alexey Samsonov762343d2014-04-18 17:25:46 +0000337 if (DWO.get())
338 DWO->getUnit()->collectAddressRanges(CURanges);
339 if (DWOCreated)
David Blaikie07e22442013-09-23 22:44:40 +0000340 DWO.reset();
341
342 // Keep memory down by clearing DIEs if this generate function
343 // caused them to be parsed.
Alexey Samsonov762343d2014-04-18 17:25:46 +0000344 if (ClearDIEs)
David Blaikie07e22442013-09-23 22:44:40 +0000345 clearDIEs(true);
346}
347
Dehao Chena364f092017-04-19 20:09:38 +0000348void DWARFUnit::updateAddressDieMap(DWARFDie Die) {
349 if (Die.isSubroutineDIE()) {
350 for (const auto &R : Die.getAddressRanges()) {
351 // Ignore 0-sized ranges.
George Rimar4671f2e2017-05-16 12:30:59 +0000352 if (R.LowPC == R.HighPC)
Dehao Chena364f092017-04-19 20:09:38 +0000353 continue;
George Rimar4671f2e2017-05-16 12:30:59 +0000354 auto B = AddrDieMap.upper_bound(R.LowPC);
355 if (B != AddrDieMap.begin() && R.LowPC < (--B)->second.first) {
Dehao Chena364f092017-04-19 20:09:38 +0000356 // The range is a sub-range of existing ranges, we need to split the
357 // existing range.
George Rimar4671f2e2017-05-16 12:30:59 +0000358 if (R.HighPC < B->second.first)
359 AddrDieMap[R.HighPC] = B->second;
360 if (R.LowPC > B->first)
361 AddrDieMap[B->first].first = R.LowPC;
Dehao Chena364f092017-04-19 20:09:38 +0000362 }
George Rimar4671f2e2017-05-16 12:30:59 +0000363 AddrDieMap[R.LowPC] = std::make_pair(R.HighPC, Die);
David Blaikie07e22442013-09-23 22:44:40 +0000364 }
Alexey Samsonov1eabf982014-03-13 07:52:54 +0000365 }
Dehao Chena364f092017-04-19 20:09:38 +0000366 // Parent DIEs are added to the AddrDieMap prior to the Children DIEs to
367 // simplify the logic to update AddrDieMap. The child's range will always
368 // be equal or smaller than the parent's range. With this assumption, when
369 // adding one range into the map, it will at most split a range into 3
370 // sub-ranges.
371 for (DWARFDie Child = Die.getFirstChild(); Child; Child = Child.getSibling())
372 updateAddressDieMap(Child);
373}
374
375DWARFDie DWARFUnit::getSubroutineForAddress(uint64_t Address) {
376 extractDIEsIfNeeded(false);
377 if (AddrDieMap.empty())
378 updateAddressDieMap(getUnitDIE());
379 auto R = AddrDieMap.upper_bound(Address);
380 if (R == AddrDieMap.begin())
381 return DWARFDie();
382 // upper_bound's previous item contains Address.
383 --R;
384 if (Address >= R->second.first)
385 return DWARFDie();
386 return R->second.second;
David Blaikie07e22442013-09-23 22:44:40 +0000387}
388
Greg Claytonc8c10322016-12-13 18:25:19 +0000389void
390DWARFUnit::getInlinedChainForAddress(uint64_t Address,
391 SmallVectorImpl<DWARFDie> &InlinedChain) {
Dehao Chendb569ba2017-04-19 20:52:21 +0000392 assert(InlinedChain.empty());
David Blaikie9a4f3cb2016-04-22 21:32:59 +0000393 // Try to look for subprogram DIEs in the DWO file.
394 parseDWO();
Dehao Chendb569ba2017-04-19 20:52:21 +0000395 // First, find the subroutine that contains the given address (the leaf
396 // of inlined chain).
397 DWARFDie SubroutineDIE =
398 (DWO ? DWO->getUnit() : this)->getSubroutineForAddress(Address);
David Blaikie07e22442013-09-23 22:44:40 +0000399
Dehao Chendb569ba2017-04-19 20:52:21 +0000400 while (SubroutineDIE) {
401 if (SubroutineDIE.isSubroutineDIE())
402 InlinedChain.push_back(SubroutineDIE);
403 SubroutineDIE = SubroutineDIE.getParent();
404 }
David Blaikie07e22442013-09-23 22:44:40 +0000405}
David Blaikie82641be2015-11-17 00:39:55 +0000406
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000407const DWARFUnitIndex &llvm::getDWARFUnitIndex(DWARFContext &Context,
408 DWARFSectionKind Kind) {
David Blaikie82641be2015-11-17 00:39:55 +0000409 if (Kind == DW_SECT_INFO)
410 return Context.getCUIndex();
411 assert(Kind == DW_SECT_TYPES);
412 return Context.getTUIndex();
413}
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000414
Greg Clayton78a07bf2016-12-21 21:37:06 +0000415DWARFDie DWARFUnit::getParent(const DWARFDebugInfoEntry *Die) {
416 if (!Die)
417 return DWARFDie();
418 const uint32_t Depth = Die->getDepth();
419 // Unit DIEs always have a depth of zero and never have parents.
420 if (Depth == 0)
421 return DWARFDie();
422 // Depth of 1 always means parent is the compile/type unit.
423 if (Depth == 1)
424 return getUnitDIE();
425 // Look for previous DIE with a depth that is one less than the Die's depth.
426 const uint32_t ParentDepth = Depth - 1;
427 for (uint32_t I = getDIEIndex(Die) - 1; I > 0; --I) {
428 if (DieArray[I].getDepth() == ParentDepth)
429 return DWARFDie(this, &DieArray[I]);
430 }
431 return DWARFDie();
432}
433
434DWARFDie DWARFUnit::getSibling(const DWARFDebugInfoEntry *Die) {
435 if (!Die)
436 return DWARFDie();
437 uint32_t Depth = Die->getDepth();
438 // Unit DIEs always have a depth of zero and never have siblings.
439 if (Depth == 0)
440 return DWARFDie();
441 // NULL DIEs don't have siblings.
442 if (Die->getAbbreviationDeclarationPtr() == nullptr)
443 return DWARFDie();
444
445 // Find the next DIE whose depth is the same as the Die's depth.
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000446 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx;
447 ++I) {
Greg Clayton78a07bf2016-12-21 21:37:06 +0000448 if (DieArray[I].getDepth() == Depth)
449 return DWARFDie(this, &DieArray[I]);
450 }
451 return DWARFDie();
452}