blob: ded9b2abf64c7f43f3f7d96417bff4fc90c94b6f [file] [log] [blame]
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +00001//===- DWARFUnit.cpp ------------------------------------------------------===//
David Blaikie07e22442013-09-23 22:44:40 +00002//
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
Chandler Carruth6bda14b2017-06-06 11:49:48 +000010#include "llvm/DebugInfo/DWARF/DWARFUnit.h"
Chandler Carruth6bda14b2017-06-06 11:49:48 +000011#include "llvm/ADT/SmallString.h"
Eugene Zelenko570e39a2016-11-23 23:16:32 +000012#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/Support/DataExtractor.h"
David Blaikie07e22442013-09-23 22:44:40 +000020#include "llvm/Support/Path.h"
Eugene Zelenko570e39a2016-11-23 23:16:32 +000021#include <algorithm>
22#include <cassert>
Eugene Zelenko28db7e62017-03-01 01:14:23 +000023#include <cstddef>
Eugene Zelenko570e39a2016-11-23 23:16:32 +000024#include <cstdint>
David Blaikie8de5e982013-09-23 23:15:57 +000025#include <cstdio>
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000026#include <utility>
Eugene Zelenko570e39a2016-11-23 23:16:32 +000027#include <vector>
David Blaikie07e22442013-09-23 22:44:40 +000028
Eugene Zelenko28db7e62017-03-01 01:14:23 +000029using namespace llvm;
David Blaikie07e22442013-09-23 22:44:40 +000030using namespace dwarf;
31
Alexey Samsonov8cd4c9d2014-10-08 00:07:53 +000032void DWARFUnitSectionBase::parse(DWARFContext &C, const DWARFSection &Section) {
George Rimarca532112017-04-24 10:19:45 +000033 parseImpl(C, Section, C.getDebugAbbrev(), &C.getRangeSection(),
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000034 C.getStringSection(), C.getStringOffsetSection(),
35 &C.getAddrSection(), C.getLineSection().Data, C.isLittleEndian(),
36 false);
Frederic Riss6005dbd2014-10-06 03:36:18 +000037}
38
Alexey Samsonov8cd4c9d2014-10-08 00:07:53 +000039void DWARFUnitSectionBase::parseDWO(DWARFContext &C,
David Blaikie82641be2015-11-17 00:39:55 +000040 const DWARFSection &DWOSection,
41 DWARFUnitIndex *Index) {
George Rimarca532112017-04-24 10:19:45 +000042 parseImpl(C, DWOSection, C.getDebugAbbrevDWO(), &C.getRangeDWOSection(),
Frederic Riss6005dbd2014-10-06 03:36:18 +000043 C.getStringDWOSection(), C.getStringOffsetDWOSection(),
David Blaikied2f3a942017-05-22 07:02:47 +000044 &C.getAddrSection(), C.getLineDWOSection().Data, C.isLittleEndian(),
David Blaikiee438cff2016-04-22 22:50:56 +000045 true);
Frederic Riss6005dbd2014-10-06 03:36:18 +000046}
47
Alexey Samsonov4b4d64b2014-10-08 00:24:41 +000048DWARFUnit::DWARFUnit(DWARFContext &DC, const DWARFSection &Section,
George Rimarca532112017-04-24 10:19:45 +000049 const DWARFDebugAbbrev *DA, const DWARFSection *RS,
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000050 StringRef SS, const DWARFSection &SOS,
51 const DWARFSection *AOS, StringRef LS, bool LE, bool IsDWO,
George Rimarca532112017-04-24 10:19:45 +000052 const DWARFUnitSectionBase &UnitSection,
David Blaikie82641be2015-11-17 00:39:55 +000053 const DWARFUnitIndex::Entry *IndexEntry)
Alexey Samsonov4b4d64b2014-10-08 00:24:41 +000054 : Context(DC), InfoSection(Section), Abbrev(DA), RangeSection(RS),
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000055 LineSection(LS), StringSection(SS), StringOffsetSection(SOS),
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000056 AddrOffsetSection(AOS), isLittleEndian(LE), isDWO(IsDWO),
57 UnitSection(UnitSection), IndexEntry(IndexEntry) {
David Blaikie07e22442013-09-23 22:44:40 +000058 clear();
59}
60
Eugene Zelenko570e39a2016-11-23 23:16:32 +000061DWARFUnit::~DWARFUnit() = default;
David Blaikie07e22442013-09-23 22:44:40 +000062
63bool DWARFUnit::getAddrOffsetSectionItem(uint32_t Index,
64 uint64_t &Result) const {
65 uint32_t Offset = AddrOffsetSectionBase + Index * AddrSize;
David Blaikied2f3a942017-05-22 07:02:47 +000066 if (AddrOffsetSection->Data.size() < Offset + AddrSize)
David Blaikie07e22442013-09-23 22:44:40 +000067 return false;
David Blaikied2f3a942017-05-22 07:02:47 +000068 DataExtractor DA(AddrOffsetSection->Data, isLittleEndian, AddrSize);
69 Result = getRelocatedValue(DA, AddrSize, &Offset, &AddrOffsetSection->Relocs);
David Blaikie07e22442013-09-23 22:44:40 +000070 return true;
71}
72
73bool DWARFUnit::getStringOffsetSectionItem(uint32_t Index,
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000074 uint64_t &Result) const {
75 unsigned ItemSize = getFormat() == DWARF64 ? 8 : 4;
76 uint32_t Offset = StringOffsetSectionBase + Index * ItemSize;
77 if (StringOffsetSection.Data.size() < Offset + ItemSize)
David Blaikie07e22442013-09-23 22:44:40 +000078 return false;
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000079 DataExtractor DA(StringOffsetSection.Data, isLittleEndian, 0);
80 Result = ItemSize == 4 ? DA.getU32(&Offset) : DA.getU64(&Offset);
David Blaikie07e22442013-09-23 22:44:40 +000081 return true;
82}
83
Wolfgang Pieb77d3e932017-06-06 01:22:34 +000084uint64_t DWARFUnit::getStringOffsetSectionRelocation(uint32_t Index) const {
85 unsigned ItemSize = getFormat() == DWARF64 ? 8 : 4;
86 uint64_t ByteOffset = StringOffsetSectionBase + Index * ItemSize;
87 RelocAddrMap::const_iterator AI = getStringOffsetsRelocMap().find(ByteOffset);
88 if (AI != getStringOffsetsRelocMap().end())
89 return AI->second.Value;
90 return 0;
91}
92
David Blaikie07e22442013-09-23 22:44:40 +000093bool DWARFUnit::extractImpl(DataExtractor debug_info, uint32_t *offset_ptr) {
94 Length = debug_info.getU32(offset_ptr);
95 Version = debug_info.getU16(offset_ptr);
Paul Robinsoncddd6042017-02-28 20:24:55 +000096 uint64_t AbbrOffset;
97 if (Version >= 5) {
98 UnitType = debug_info.getU8(offset_ptr);
99 AddrSize = debug_info.getU8(offset_ptr);
100 AbbrOffset = debug_info.getU32(offset_ptr);
101 } else {
102 AbbrOffset = debug_info.getU32(offset_ptr);
103 AddrSize = debug_info.getU8(offset_ptr);
104 }
David Blaikie82641be2015-11-17 00:39:55 +0000105 if (IndexEntry) {
106 if (AbbrOffset)
107 return false;
108 auto *UnitContrib = IndexEntry->getOffset();
109 if (!UnitContrib || UnitContrib->Length != (Length + 4))
110 return false;
111 auto *AbbrEntry = IndexEntry->getOffset(DW_SECT_ABBREV);
112 if (!AbbrEntry)
113 return false;
114 AbbrOffset = AbbrEntry->Offset;
115 }
David Blaikie07e22442013-09-23 22:44:40 +0000116
Alexey Samsonov7682f812014-04-24 22:51:03 +0000117 bool LengthOK = debug_info.isValidOffset(getNextUnitOffset() - 1);
118 bool VersionOK = DWARFContext::isSupportedVersion(Version);
119 bool AddrSizeOK = AddrSize == 4 || AddrSize == 8;
David Blaikie07e22442013-09-23 22:44:40 +0000120
Alexey Samsonov7682f812014-04-24 22:51:03 +0000121 if (!LengthOK || !VersionOK || !AddrSizeOK)
David Blaikie07e22442013-09-23 22:44:40 +0000122 return false;
123
Wolfgang Pieb77d3e932017-06-06 01:22:34 +0000124 // Keep track of the highest DWARF version we encounter across all units.
125 Context.setMaxVersionIfGreater(Version);
126
Alexey Samsonov7682f812014-04-24 22:51:03 +0000127 Abbrevs = Abbrev->getAbbreviationDeclarationSet(AbbrOffset);
Benjamin Kramer68a29562015-05-25 13:28:03 +0000128 return Abbrevs != nullptr;
David Blaikie07e22442013-09-23 22:44:40 +0000129}
130
131bool DWARFUnit::extract(DataExtractor debug_info, uint32_t *offset_ptr) {
132 clear();
133
134 Offset = *offset_ptr;
135
136 if (debug_info.isValidOffset(*offset_ptr)) {
137 if (extractImpl(debug_info, offset_ptr))
138 return true;
139
140 // reset the offset to where we tried to parse from if anything went wrong
141 *offset_ptr = Offset;
142 }
143
144 return false;
145}
146
David Blaikie07e22442013-09-23 22:44:40 +0000147bool DWARFUnit::extractRangeList(uint32_t RangeListOffset,
148 DWARFDebugRangeList &RangeList) const {
149 // Require that compile unit is extracted.
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000150 assert(!DieArray.empty());
George Rimarca532112017-04-24 10:19:45 +0000151 DataExtractor RangesData(RangeSection->Data, isLittleEndian, AddrSize);
David Blaikie07e22442013-09-23 22:44:40 +0000152 uint32_t ActualRangeListOffset = RangeSectionBase + RangeListOffset;
George Rimarca532112017-04-24 10:19:45 +0000153 return RangeList.extract(RangesData, &ActualRangeListOffset,
154 RangeSection->Relocs);
David Blaikie07e22442013-09-23 22:44:40 +0000155}
156
157void DWARFUnit::clear() {
158 Offset = 0;
159 Length = 0;
160 Version = 0;
Craig Topper2617dcc2014-04-15 06:32:26 +0000161 Abbrevs = nullptr;
David Blaikie07e22442013-09-23 22:44:40 +0000162 AddrSize = 0;
163 BaseAddr = 0;
164 RangeSectionBase = 0;
165 AddrOffsetSectionBase = 0;
166 clearDIEs(false);
167 DWO.reset();
168}
169
170const char *DWARFUnit::getCompilationDir() {
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000171 return dwarf::toString(getUnitDIE().find(DW_AT_comp_dir), nullptr);
David Blaikie07e22442013-09-23 22:44:40 +0000172}
173
Greg Clayton52fe1f62016-12-14 22:38:08 +0000174Optional<uint64_t> DWARFUnit::getDWOId() {
Greg Clayton97d22182017-01-13 21:08:18 +0000175 return toUnsigned(getUnitDIE().find(DW_AT_GNU_dwo_id));
David Blaikie07e22442013-09-23 22:44:40 +0000176}
177
David Blaikie07e22442013-09-23 22:44:40 +0000178void DWARFUnit::extractDIEsToVector(
179 bool AppendCUDie, bool AppendNonCUDies,
Greg Claytonc8c10322016-12-13 18:25:19 +0000180 std::vector<DWARFDebugInfoEntry> &Dies) const {
David Blaikie07e22442013-09-23 22:44:40 +0000181 if (!AppendCUDie && !AppendNonCUDies)
182 return;
183
184 // Set the offset to that of the first DIE and calculate the start of the
185 // next compilation unit header.
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000186 uint32_t DIEOffset = Offset + getHeaderSize();
David Blaikie07e22442013-09-23 22:44:40 +0000187 uint32_t NextCUOffset = getNextUnitOffset();
Greg Claytonc8c10322016-12-13 18:25:19 +0000188 DWARFDebugInfoEntry DIE;
Greg Clayton6f6e4db2016-11-15 01:23:06 +0000189 DataExtractor DebugInfoData = getDebugInfoExtractor();
David Blaikie07e22442013-09-23 22:44:40 +0000190 uint32_t Depth = 0;
David Blaikie07e22442013-09-23 22:44:40 +0000191 bool IsCUDie = true;
192
Greg Clayton78a07bf2016-12-21 21:37:06 +0000193 while (DIE.extractFast(*this, &DIEOffset, DebugInfoData, NextCUOffset,
194 Depth)) {
David Blaikie07e22442013-09-23 22:44:40 +0000195 if (IsCUDie) {
196 if (AppendCUDie)
197 Dies.push_back(DIE);
198 if (!AppendNonCUDies)
199 break;
200 // The average bytes per DIE entry has been seen to be
201 // around 14-20 so let's pre-reserve the needed memory for
202 // our DIE entries accordingly.
203 Dies.reserve(Dies.size() + getDebugInfoSize() / 14);
204 IsCUDie = false;
205 } else {
206 Dies.push_back(DIE);
207 }
208
Alexey Samsonov8e4cf3b2014-04-29 17:12:42 +0000209 if (const DWARFAbbreviationDeclaration *AbbrDecl =
210 DIE.getAbbreviationDeclarationPtr()) {
David Blaikie07e22442013-09-23 22:44:40 +0000211 // Normal DIE
212 if (AbbrDecl->hasChildren())
213 ++Depth;
214 } else {
215 // NULL DIE.
216 if (Depth > 0)
217 --Depth;
218 if (Depth == 0)
219 break; // We are done with this compile unit!
220 }
221 }
222
223 // Give a little bit of info if we encounter corrupt DWARF (our offset
224 // should always terminate at or before the start of the next compilation
225 // unit header).
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000226 if (DIEOffset > NextCUOffset)
David Blaikie07e22442013-09-23 22:44:40 +0000227 fprintf(stderr, "warning: DWARF compile unit extends beyond its "
Alexey Samsonov19f76f22014-04-24 23:08:56 +0000228 "bounds cu 0x%8.8x at 0x%8.8x'\n", getOffset(), DIEOffset);
David Blaikie07e22442013-09-23 22:44:40 +0000229}
230
231size_t DWARFUnit::extractDIEsIfNeeded(bool CUDieOnly) {
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000232 if ((CUDieOnly && !DieArray.empty()) ||
David Blaikie07e22442013-09-23 22:44:40 +0000233 DieArray.size() > 1)
234 return 0; // Already parsed.
235
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000236 bool HasCUDie = !DieArray.empty();
David Blaikie07e22442013-09-23 22:44:40 +0000237 extractDIEsToVector(!HasCUDie, !CUDieOnly, DieArray);
238
239 if (DieArray.empty())
240 return 0;
241
242 // If CU DIE was just parsed, copy several attribute values from it.
243 if (!HasCUDie) {
Greg Claytonc8c10322016-12-13 18:25:19 +0000244 DWARFDie UnitDie = getUnitDIE();
Greg Claytonc109bbe2017-01-13 22:32:12 +0000245 auto BaseAddr = toAddress(UnitDie.find({DW_AT_low_pc, DW_AT_entry_pc}));
Greg Clayton52fe1f62016-12-14 22:38:08 +0000246 if (BaseAddr)
247 setBaseAddress(*BaseAddr);
Greg Clayton97d22182017-01-13 21:08:18 +0000248 AddrOffsetSectionBase = toSectionOffset(UnitDie.find(DW_AT_GNU_addr_base), 0);
249 RangeSectionBase = toSectionOffset(UnitDie.find(DW_AT_rnglists_base), 0);
Wolfgang Pieb77d3e932017-06-06 01:22:34 +0000250
251 // In general, we derive the offset of the unit's contibution to the
252 // debug_str_offsets{.dwo} section from the unit DIE's
253 // DW_AT_str_offsets_base attribute. In dwp files we add to it the offset
254 // we get from the index table.
255 StringOffsetSectionBase =
256 toSectionOffset(UnitDie.find(DW_AT_str_offsets_base), 0);
257 if (IndexEntry)
258 if (const auto *C = IndexEntry->getOffset(DW_SECT_STR_OFFSETS))
259 StringOffsetSectionBase += C->Offset;
260
Alexey Samsonovaa909982014-06-13 22:31:03 +0000261 // Don't fall back to DW_AT_GNU_ranges_base: it should be ignored for
262 // skeleton CU DIE, so that DWARF users not aware of it are not broken.
David Blaikie07e22442013-09-23 22:44:40 +0000263 }
264
David Blaikie07e22442013-09-23 22:44:40 +0000265 return DieArray.size();
266}
267
David Blaikie07e22442013-09-23 22:44:40 +0000268bool DWARFUnit::parseDWO() {
David Blaikiee438cff2016-04-22 22:50:56 +0000269 if (isDWO)
270 return false;
Craig Topper2617dcc2014-04-15 06:32:26 +0000271 if (DWO.get())
David Blaikie07e22442013-09-23 22:44:40 +0000272 return false;
Greg Claytonc8c10322016-12-13 18:25:19 +0000273 DWARFDie UnitDie = getUnitDIE();
274 if (!UnitDie)
David Blaikie07e22442013-09-23 22:44:40 +0000275 return false;
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000276 auto DWOFileName = dwarf::toString(UnitDie.find(DW_AT_GNU_dwo_name));
Craig Topper2617dcc2014-04-15 06:32:26 +0000277 if (!DWOFileName)
David Blaikie07e22442013-09-23 22:44:40 +0000278 return false;
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000279 auto CompilationDir = dwarf::toString(UnitDie.find(DW_AT_comp_dir));
David Blaikie07e22442013-09-23 22:44:40 +0000280 SmallString<16> AbsolutePath;
Greg Clayton97d22182017-01-13 21:08:18 +0000281 if (sys::path::is_relative(*DWOFileName) && CompilationDir &&
282 *CompilationDir) {
283 sys::path::append(AbsolutePath, *CompilationDir);
David Blaikie07e22442013-09-23 22:44:40 +0000284 }
Greg Clayton97d22182017-01-13 21:08:18 +0000285 sys::path::append(AbsolutePath, *DWOFileName);
David Blaikie8d039d42017-05-20 03:32:49 +0000286 auto DWOId = getDWOId();
287 if (!DWOId)
288 return false;
David Blaikief9803fb2017-05-23 00:30:42 +0000289 auto DWOContext = Context.getDWOContext(AbsolutePath);
290 if (!DWOContext)
David Blaikie07e22442013-09-23 22:44:40 +0000291 return false;
David Blaikief9803fb2017-05-23 00:30:42 +0000292
David Blaikie15d85fc2017-05-23 06:48:53 +0000293 DWARFCompileUnit *DWOCU = DWOContext->getDWOCompileUnitForHash(*DWOId);
294 if (!DWOCU)
David Blaikief9803fb2017-05-23 00:30:42 +0000295 return false;
David Blaikie15d85fc2017-05-23 06:48:53 +0000296 DWO = std::shared_ptr<DWARFCompileUnit>(std::move(DWOContext), DWOCU);
David Blaikie07e22442013-09-23 22:44:40 +0000297 // Share .debug_addr and .debug_ranges section with compile unit in .dwo
David Blaikief9803fb2017-05-23 00:30:42 +0000298 DWO->setAddrOffsetSection(AddrOffsetSection, AddrOffsetSectionBase);
Greg Clayton52fe1f62016-12-14 22:38:08 +0000299 auto DWORangesBase = UnitDie.getRangesBaseAttribute();
David Blaikief9803fb2017-05-23 00:30:42 +0000300 DWO->setRangesSection(RangeSection, DWORangesBase ? *DWORangesBase : 0);
David Blaikie07e22442013-09-23 22:44:40 +0000301 return true;
302}
303
304void DWARFUnit::clearDIEs(bool KeepCUDie) {
305 if (DieArray.size() > (unsigned)KeepCUDie) {
306 // std::vectors never get any smaller when resized to a smaller size,
307 // or when clear() or erase() are called, the size will report that it
308 // is smaller, but the memory allocated remains intact (call capacity()
309 // to see this). So we need to create a temporary vector and swap the
310 // contents which will cause just the internal pointers to be swapped
311 // so that when temporary vector goes out of scope, it will destroy the
312 // contents.
Greg Claytonc8c10322016-12-13 18:25:19 +0000313 std::vector<DWARFDebugInfoEntry> TmpArray;
David Blaikie07e22442013-09-23 22:44:40 +0000314 DieArray.swap(TmpArray);
315 // Save at least the compile unit DIE
316 if (KeepCUDie)
317 DieArray.push_back(TmpArray.front());
318 }
319}
320
Alexey Samsonov762343d2014-04-18 17:25:46 +0000321void DWARFUnit::collectAddressRanges(DWARFAddressRangesVector &CURanges) {
Greg Claytonc8c10322016-12-13 18:25:19 +0000322 DWARFDie UnitDie = getUnitDIE();
323 if (!UnitDie)
Alexey Samsonov7a18c062015-05-19 21:54:32 +0000324 return;
325 // First, check if unit DIE describes address ranges for the whole unit.
Greg Claytonc8c10322016-12-13 18:25:19 +0000326 const auto &CUDIERanges = UnitDie.getAddressRanges();
Alexey Samsonov84e24232014-04-18 20:30:27 +0000327 if (!CUDIERanges.empty()) {
328 CURanges.insert(CURanges.end(), CUDIERanges.begin(), CUDIERanges.end());
329 return;
330 }
331
David Blaikie07e22442013-09-23 22:44:40 +0000332 // This function is usually called if there in no .debug_aranges section
333 // in order to produce a compile unit level set of address ranges that
334 // is accurate. If the DIEs weren't parsed, then we don't want all dies for
335 // all compile units to stay loaded when they weren't needed. So we can end
336 // up parsing the DWARF and then throwing them all away to keep memory usage
337 // down.
Alexey Samsonov762343d2014-04-18 17:25:46 +0000338 const bool ClearDIEs = extractDIEsIfNeeded(false) > 1;
Greg Claytonc8c10322016-12-13 18:25:19 +0000339 getUnitDIE().collectChildrenAddressRanges(CURanges);
Alexey Samsonov762343d2014-04-18 17:25:46 +0000340
341 // Collect address ranges from DIEs in .dwo if necessary.
David Blaikie07e22442013-09-23 22:44:40 +0000342 bool DWOCreated = parseDWO();
David Blaikief9803fb2017-05-23 00:30:42 +0000343 if (DWO)
344 DWO->collectAddressRanges(CURanges);
Alexey Samsonov762343d2014-04-18 17:25:46 +0000345 if (DWOCreated)
David Blaikie07e22442013-09-23 22:44:40 +0000346 DWO.reset();
347
348 // Keep memory down by clearing DIEs if this generate function
349 // caused them to be parsed.
Alexey Samsonov762343d2014-04-18 17:25:46 +0000350 if (ClearDIEs)
David Blaikie07e22442013-09-23 22:44:40 +0000351 clearDIEs(true);
352}
353
Dehao Chena364f092017-04-19 20:09:38 +0000354void DWARFUnit::updateAddressDieMap(DWARFDie Die) {
355 if (Die.isSubroutineDIE()) {
356 for (const auto &R : Die.getAddressRanges()) {
357 // Ignore 0-sized ranges.
George Rimar4671f2e2017-05-16 12:30:59 +0000358 if (R.LowPC == R.HighPC)
Dehao Chena364f092017-04-19 20:09:38 +0000359 continue;
George Rimar4671f2e2017-05-16 12:30:59 +0000360 auto B = AddrDieMap.upper_bound(R.LowPC);
361 if (B != AddrDieMap.begin() && R.LowPC < (--B)->second.first) {
Dehao Chena364f092017-04-19 20:09:38 +0000362 // The range is a sub-range of existing ranges, we need to split the
363 // existing range.
George Rimar4671f2e2017-05-16 12:30:59 +0000364 if (R.HighPC < B->second.first)
365 AddrDieMap[R.HighPC] = B->second;
366 if (R.LowPC > B->first)
367 AddrDieMap[B->first].first = R.LowPC;
Dehao Chena364f092017-04-19 20:09:38 +0000368 }
George Rimar4671f2e2017-05-16 12:30:59 +0000369 AddrDieMap[R.LowPC] = std::make_pair(R.HighPC, Die);
David Blaikie07e22442013-09-23 22:44:40 +0000370 }
Alexey Samsonov1eabf982014-03-13 07:52:54 +0000371 }
Dehao Chena364f092017-04-19 20:09:38 +0000372 // Parent DIEs are added to the AddrDieMap prior to the Children DIEs to
373 // simplify the logic to update AddrDieMap. The child's range will always
374 // be equal or smaller than the parent's range. With this assumption, when
375 // adding one range into the map, it will at most split a range into 3
376 // sub-ranges.
377 for (DWARFDie Child = Die.getFirstChild(); Child; Child = Child.getSibling())
378 updateAddressDieMap(Child);
379}
380
381DWARFDie DWARFUnit::getSubroutineForAddress(uint64_t Address) {
382 extractDIEsIfNeeded(false);
383 if (AddrDieMap.empty())
384 updateAddressDieMap(getUnitDIE());
385 auto R = AddrDieMap.upper_bound(Address);
386 if (R == AddrDieMap.begin())
387 return DWARFDie();
388 // upper_bound's previous item contains Address.
389 --R;
390 if (Address >= R->second.first)
391 return DWARFDie();
392 return R->second.second;
David Blaikie07e22442013-09-23 22:44:40 +0000393}
394
Greg Claytonc8c10322016-12-13 18:25:19 +0000395void
396DWARFUnit::getInlinedChainForAddress(uint64_t Address,
397 SmallVectorImpl<DWARFDie> &InlinedChain) {
Dehao Chendb569ba2017-04-19 20:52:21 +0000398 assert(InlinedChain.empty());
David Blaikie9a4f3cb2016-04-22 21:32:59 +0000399 // Try to look for subprogram DIEs in the DWO file.
400 parseDWO();
Dehao Chendb569ba2017-04-19 20:52:21 +0000401 // First, find the subroutine that contains the given address (the leaf
402 // of inlined chain).
403 DWARFDie SubroutineDIE =
David Blaikief9803fb2017-05-23 00:30:42 +0000404 (DWO ? DWO.get() : this)->getSubroutineForAddress(Address);
David Blaikie07e22442013-09-23 22:44:40 +0000405
Dehao Chendb569ba2017-04-19 20:52:21 +0000406 while (SubroutineDIE) {
407 if (SubroutineDIE.isSubroutineDIE())
408 InlinedChain.push_back(SubroutineDIE);
409 SubroutineDIE = SubroutineDIE.getParent();
410 }
David Blaikie07e22442013-09-23 22:44:40 +0000411}
David Blaikie82641be2015-11-17 00:39:55 +0000412
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000413const DWARFUnitIndex &llvm::getDWARFUnitIndex(DWARFContext &Context,
414 DWARFSectionKind Kind) {
David Blaikie82641be2015-11-17 00:39:55 +0000415 if (Kind == DW_SECT_INFO)
416 return Context.getCUIndex();
417 assert(Kind == DW_SECT_TYPES);
418 return Context.getTUIndex();
419}
Eugene Zelenko570e39a2016-11-23 23:16:32 +0000420
Greg Clayton78a07bf2016-12-21 21:37:06 +0000421DWARFDie DWARFUnit::getParent(const DWARFDebugInfoEntry *Die) {
422 if (!Die)
423 return DWARFDie();
424 const uint32_t Depth = Die->getDepth();
425 // Unit DIEs always have a depth of zero and never have parents.
426 if (Depth == 0)
427 return DWARFDie();
428 // Depth of 1 always means parent is the compile/type unit.
429 if (Depth == 1)
430 return getUnitDIE();
431 // Look for previous DIE with a depth that is one less than the Die's depth.
432 const uint32_t ParentDepth = Depth - 1;
433 for (uint32_t I = getDIEIndex(Die) - 1; I > 0; --I) {
434 if (DieArray[I].getDepth() == ParentDepth)
435 return DWARFDie(this, &DieArray[I]);
436 }
437 return DWARFDie();
438}
439
440DWARFDie DWARFUnit::getSibling(const DWARFDebugInfoEntry *Die) {
441 if (!Die)
442 return DWARFDie();
443 uint32_t Depth = Die->getDepth();
444 // Unit DIEs always have a depth of zero and never have siblings.
445 if (Depth == 0)
446 return DWARFDie();
447 // NULL DIEs don't have siblings.
448 if (Die->getAbbreviationDeclarationPtr() == nullptr)
449 return DWARFDie();
450
451 // Find the next DIE whose depth is the same as the Die's depth.
Eugene Zelenko28db7e62017-03-01 01:14:23 +0000452 for (size_t I = getDIEIndex(Die) + 1, EndIdx = DieArray.size(); I < EndIdx;
453 ++I) {
Greg Clayton78a07bf2016-12-21 21:37:06 +0000454 if (DieArray[I].getDepth() == Depth)
455 return DWARFDie(this, &DieArray[I]);
456 }
457 return DWARFDie();
458}