blob: dbee28ff5ab17957cbc1b003b7680bfda120ac45 [file] [log] [blame]
Eugene Zelenkoe94042c2017-02-27 23:43:14 +00001//===- DWARFDebugLine.cpp -------------------------------------------------===//
Benjamin Kramer5acab502011-09-15 02:12:05 +00002//
Chandler Carruth2946cd72019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
Benjamin Kramer5acab502011-09-15 02:12:05 +00006//
7//===----------------------------------------------------------------------===//
8
Paul Robinson9d4eb692017-05-01 23:27:55 +00009#include "llvm/DebugInfo/DWARF/DWARFDebugLine.h"
Scott Linder16c7bda2018-02-23 23:01:06 +000010#include "llvm/ADT/Optional.h"
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000011#include "llvm/ADT/SmallString.h"
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000012#include "llvm/ADT/SmallVector.h"
13#include "llvm/ADT/StringRef.h"
Zachary Turner264b5d92017-06-07 03:48:56 +000014#include "llvm/BinaryFormat/Dwarf.h"
Paul Robinson2bc38732017-05-02 21:40:47 +000015#include "llvm/DebugInfo/DWARF/DWARFFormValue.h"
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000016#include "llvm/DebugInfo/DWARF/DWARFRelocMap.h"
Victor Leschukcba595d2018-08-20 09:59:08 +000017#include "llvm/Support/Errc.h"
Benjamin Kramer5acab502011-09-15 02:12:05 +000018#include "llvm/Support/Format.h"
Jonas Devlieghere84e99262018-04-14 22:07:23 +000019#include "llvm/Support/WithColor.h"
Benjamin Kramer5acab502011-09-15 02:12:05 +000020#include "llvm/Support/raw_ostream.h"
Benjamin Kramera57c46a2011-09-15 02:19:33 +000021#include <algorithm>
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000022#include <cassert>
23#include <cinttypes>
24#include <cstdint>
25#include <cstdio>
26#include <utility>
27
Benjamin Kramer5acab502011-09-15 02:12:05 +000028using namespace llvm;
29using namespace dwarf;
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000030
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000031using FileLineInfoKind = DILineInfoSpecifier::FileLineInfoKind;
32
Paul Robinson2bc38732017-05-02 21:40:47 +000033namespace {
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000034
Paul Robinson2bc38732017-05-02 21:40:47 +000035struct ContentDescriptor {
36 dwarf::LineNumberEntryFormat Type;
37 dwarf::Form Form;
38};
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000039
40using ContentDescriptors = SmallVector<ContentDescriptor, 4>;
41
Paul Robinson2bc38732017-05-02 21:40:47 +000042} // end anonmyous namespace
Benjamin Kramer5acab502011-09-15 02:12:05 +000043
Scott Linder16c7bda2018-02-23 23:01:06 +000044void DWARFDebugLine::ContentTypeTracker::trackContentType(
45 dwarf::LineNumberEntryFormat ContentType) {
46 switch (ContentType) {
47 case dwarf::DW_LNCT_timestamp:
48 HasModTime = true;
49 break;
50 case dwarf::DW_LNCT_size:
51 HasLength = true;
52 break;
53 case dwarf::DW_LNCT_MD5:
54 HasMD5 = true;
55 break;
56 case dwarf::DW_LNCT_LLVM_source:
57 HasSource = true;
58 break;
59 default:
60 // We only care about values we consider optional, and new values may be
61 // added in the vendor extension range, so we do not match exhaustively.
62 break;
63 }
64}
65
Dehao Chen1b54fce2016-04-28 22:09:37 +000066DWARFDebugLine::Prologue::Prologue() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000067
Jonas Devlieghereca16d282019-07-16 01:21:25 +000068bool DWARFDebugLine::Prologue::hasFileAtIndex(uint64_t FileIndex) const {
69 uint16_t DwarfVersion = getVersion();
70 assert(DwarfVersion != 0 &&
71 "line table prologue has no dwarf version information");
72 if (DwarfVersion >= 5)
73 return FileIndex < FileNames.size();
74 return FileIndex != 0 && FileIndex <= FileNames.size();
75}
76
77const llvm::DWARFDebugLine::FileNameEntry &
78DWARFDebugLine::Prologue::getFileNameEntry(uint64_t Index) const {
79 uint16_t DwarfVersion = getVersion();
80 assert(DwarfVersion != 0 &&
81 "line table prologue has no dwarf version information");
82 // In DWARF v5 the file names are 0-indexed.
83 if (DwarfVersion >= 5)
84 return FileNames[Index];
85 return FileNames[Index - 1];
86}
87
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000088void DWARFDebugLine::Prologue::clear() {
Paul Robinson75c068c2017-06-26 18:43:01 +000089 TotalLength = PrologueLength = 0;
90 SegSelectorSize = 0;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000091 MinInstLength = MaxOpsPerInst = DefaultIsStmt = LineBase = LineRange = 0;
92 OpcodeBase = 0;
Pavel Labath322711f2018-03-14 09:39:54 +000093 FormParams = dwarf::FormParams({0, 0, DWARF32});
Scott Linder16c7bda2018-02-23 23:01:06 +000094 ContentTypes = ContentTypeTracker();
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000095 StandardOpcodeLengths.clear();
96 IncludeDirectories.clear();
97 FileNames.clear();
98}
99
Paul Robinson0a227092018-02-05 20:43:15 +0000100void DWARFDebugLine::Prologue::dump(raw_ostream &OS,
101 DIDumpOptions DumpOptions) const {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000102 OS << "Line table prologue:\n"
Ed Maste6d0bee52015-05-28 15:38:17 +0000103 << format(" total_length: 0x%8.8" PRIx64 "\n", TotalLength)
Paul Robinson75c068c2017-06-26 18:43:01 +0000104 << format(" version: %u\n", getVersion());
105 if (getVersion() >= 5)
106 OS << format(" address_size: %u\n", getAddressSize())
107 << format(" seg_select_size: %u\n", SegSelectorSize);
108 OS << format(" prologue_length: 0x%8.8" PRIx64 "\n", PrologueLength)
David Blaikie1d4736e2014-02-24 23:58:54 +0000109 << format(" min_inst_length: %u\n", MinInstLength)
Paul Robinson75c068c2017-06-26 18:43:01 +0000110 << format(getVersion() >= 4 ? "max_ops_per_inst: %u\n" : "", MaxOpsPerInst)
David Blaikie1d4736e2014-02-24 23:58:54 +0000111 << format(" default_is_stmt: %u\n", DefaultIsStmt)
112 << format(" line_base: %i\n", LineBase)
113 << format(" line_range: %u\n", LineRange)
114 << format(" opcode_base: %u\n", OpcodeBase);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000115
Paul Robinson9d4eb692017-05-01 23:27:55 +0000116 for (uint32_t I = 0; I != StandardOpcodeLengths.size(); ++I)
Mehdi Amini149f6ea2016-10-05 05:59:29 +0000117 OS << format("standard_opcode_lengths[%s] = %u\n",
Paul Robinson9d4eb692017-05-01 23:27:55 +0000118 LNStandardString(I + 1).data(), StandardOpcodeLengths[I]);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000119
Paul Robinson8181d232018-01-18 20:33:35 +0000120 if (!IncludeDirectories.empty()) {
121 // DWARF v5 starts directory indexes at 0.
122 uint32_t DirBase = getVersion() >= 5 ? 0 : 1;
Paul Robinson0a227092018-02-05 20:43:15 +0000123 for (uint32_t I = 0; I != IncludeDirectories.size(); ++I) {
124 OS << format("include_directories[%3u] = ", I + DirBase);
125 IncludeDirectories[I].dump(OS, DumpOptions);
126 OS << '\n';
127 }
Paul Robinson8181d232018-01-18 20:33:35 +0000128 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000129
130 if (!FileNames.empty()) {
Paul Robinsonceafcd42018-02-08 23:08:02 +0000131 // DWARF v5 starts file indexes at 0.
132 uint32_t FileBase = getVersion() >= 5 ? 0 : 1;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000133 for (uint32_t I = 0; I != FileNames.size(); ++I) {
134 const FileNameEntry &FileEntry = FileNames[I];
Scott Linder16c7bda2018-02-23 23:01:06 +0000135 OS << format("file_names[%3u]:\n", I + FileBase);
136 OS << " name: ";
Paul Robinson0a227092018-02-05 20:43:15 +0000137 FileEntry.Name.dump(OS, DumpOptions);
Scott Linder16c7bda2018-02-23 23:01:06 +0000138 OS << '\n'
139 << format(" dir_index: %" PRIu64 "\n", FileEntry.DirIdx);
140 if (ContentTypes.HasMD5)
141 OS << " md5_checksum: " << FileEntry.Checksum.digest() << '\n';
142 if (ContentTypes.HasModTime)
143 OS << format(" mod_time: 0x%8.8" PRIx64 "\n", FileEntry.ModTime);
144 if (ContentTypes.HasLength)
145 OS << format(" length: 0x%8.8" PRIx64 "\n", FileEntry.Length);
146 if (ContentTypes.HasSource) {
147 OS << " source: ";
148 FileEntry.Source.dump(OS, DumpOptions);
149 OS << '\n';
150 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000151 }
152 }
153}
154
Paul Robinson2bc38732017-05-02 21:40:47 +0000155// Parse v2-v4 directory and file tables.
156static void
Paul Robinson17536b92017-06-29 16:52:08 +0000157parseV2DirFileTables(const DWARFDataExtractor &DebugLineData,
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000158 uint64_t *OffsetPtr, uint64_t EndPrologueOffset,
Scott Linder16c7bda2018-02-23 23:01:06 +0000159 DWARFDebugLine::ContentTypeTracker &ContentTypes,
Paul Robinson0a227092018-02-05 20:43:15 +0000160 std::vector<DWARFFormValue> &IncludeDirectories,
Paul Robinson2bc38732017-05-02 21:40:47 +0000161 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
162 while (*OffsetPtr < EndPrologueOffset) {
163 StringRef S = DebugLineData.getCStrRef(OffsetPtr);
164 if (S.empty())
165 break;
Jonas Devliegherebb111152019-02-27 00:58:09 +0000166 DWARFFormValue Dir =
167 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, S.data());
Paul Robinson0a227092018-02-05 20:43:15 +0000168 IncludeDirectories.push_back(Dir);
Paul Robinson2bc38732017-05-02 21:40:47 +0000169 }
170
171 while (*OffsetPtr < EndPrologueOffset) {
172 StringRef Name = DebugLineData.getCStrRef(OffsetPtr);
173 if (Name.empty())
174 break;
175 DWARFDebugLine::FileNameEntry FileEntry;
Jonas Devliegherebb111152019-02-27 00:58:09 +0000176 FileEntry.Name =
177 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name.data());
Paul Robinson2bc38732017-05-02 21:40:47 +0000178 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
179 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
180 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
181 FileNames.push_back(FileEntry);
182 }
Scott Linder16c7bda2018-02-23 23:01:06 +0000183
184 ContentTypes.HasModTime = true;
185 ContentTypes.HasLength = true;
Paul Robinson2bc38732017-05-02 21:40:47 +0000186}
187
188// Parse v5 directory/file entry content descriptions.
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000189// Returns the descriptors, or an error if we did not find a path or ran off
190// the end of the prologue.
191static llvm::Expected<ContentDescriptors>
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000192parseV5EntryFormat(const DWARFDataExtractor &DebugLineData, uint64_t *OffsetPtr,
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000193 uint64_t EndPrologueOffset,
194 DWARFDebugLine::ContentTypeTracker *ContentTypes) {
Paul Robinson2bc38732017-05-02 21:40:47 +0000195 ContentDescriptors Descriptors;
196 int FormatCount = DebugLineData.getU8(OffsetPtr);
197 bool HasPath = false;
198 for (int I = 0; I != FormatCount; ++I) {
199 if (*OffsetPtr >= EndPrologueOffset)
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000200 return createStringError(
201 errc::invalid_argument,
202 "failed to parse entry content descriptions at offset "
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000203 "0x%8.8" PRIx64
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000204 " because offset extends beyond the prologue end at offset "
205 "0x%8.8" PRIx64,
206 *OffsetPtr, EndPrologueOffset);
Paul Robinson2bc38732017-05-02 21:40:47 +0000207 ContentDescriptor Descriptor;
208 Descriptor.Type =
209 dwarf::LineNumberEntryFormat(DebugLineData.getULEB128(OffsetPtr));
210 Descriptor.Form = dwarf::Form(DebugLineData.getULEB128(OffsetPtr));
211 if (Descriptor.Type == dwarf::DW_LNCT_path)
212 HasPath = true;
Scott Linder16c7bda2018-02-23 23:01:06 +0000213 if (ContentTypes)
214 ContentTypes->trackContentType(Descriptor.Type);
Paul Robinson2bc38732017-05-02 21:40:47 +0000215 Descriptors.push_back(Descriptor);
216 }
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000217
218 if (!HasPath)
219 return createStringError(errc::invalid_argument,
220 "failed to parse entry content descriptions"
221 " because no path was found");
222 return Descriptors;
Paul Robinson2bc38732017-05-02 21:40:47 +0000223}
224
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000225static Error
Paul Robinson17536b92017-06-29 16:52:08 +0000226parseV5DirFileTables(const DWARFDataExtractor &DebugLineData,
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000227 uint64_t *OffsetPtr, uint64_t EndPrologueOffset,
Pavel Labath322711f2018-03-14 09:39:54 +0000228 const dwarf::FormParams &FormParams,
229 const DWARFContext &Ctx, const DWARFUnit *U,
Scott Linder16c7bda2018-02-23 23:01:06 +0000230 DWARFDebugLine::ContentTypeTracker &ContentTypes,
Paul Robinson0a227092018-02-05 20:43:15 +0000231 std::vector<DWARFFormValue> &IncludeDirectories,
Paul Robinson2bc38732017-05-02 21:40:47 +0000232 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
233 // Get the directory entry description.
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000234 llvm::Expected<ContentDescriptors> DirDescriptors =
Paul Robinsona06f8dc2017-12-18 19:08:35 +0000235 parseV5EntryFormat(DebugLineData, OffsetPtr, EndPrologueOffset, nullptr);
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000236 if (!DirDescriptors)
237 return DirDescriptors.takeError();
Paul Robinson2bc38732017-05-02 21:40:47 +0000238
239 // Get the directory entries, according to the format described above.
240 int DirEntryCount = DebugLineData.getU8(OffsetPtr);
241 for (int I = 0; I != DirEntryCount; ++I) {
242 if (*OffsetPtr >= EndPrologueOffset)
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000243 return createStringError(
244 errc::invalid_argument,
245 "failed to parse directory entry at offset "
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000246 "0x%8.8" PRIx64
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000247 " because offset extends beyond the prologue end at offset "
248 "0x%8.8" PRIx64,
249 *OffsetPtr, EndPrologueOffset);
250 for (auto Descriptor : *DirDescriptors) {
Vlad Tsyrklevich53a9f1d2019-03-02 01:10:00 +0000251 DWARFFormValue Value(Descriptor.Form);
Paul Robinson2bc38732017-05-02 21:40:47 +0000252 switch (Descriptor.Type) {
253 case DW_LNCT_path:
Vlad Tsyrklevich53a9f1d2019-03-02 01:10:00 +0000254 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U))
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000255 return createStringError(errc::invalid_argument,
256 "failed to parse directory entry because "
257 "extracting the form value failed.");
Vlad Tsyrklevich53a9f1d2019-03-02 01:10:00 +0000258 IncludeDirectories.push_back(Value);
Paul Robinson2bc38732017-05-02 21:40:47 +0000259 break;
260 default:
Vlad Tsyrklevich53a9f1d2019-03-02 01:10:00 +0000261 if (!Value.skipValue(DebugLineData, OffsetPtr, FormParams))
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000262 return createStringError(errc::invalid_argument,
263 "failed to parse directory entry because "
264 "skipping the form value failed.");
Paul Robinson2bc38732017-05-02 21:40:47 +0000265 }
266 }
267 }
268
269 // Get the file entry description.
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000270 llvm::Expected<ContentDescriptors> FileDescriptors = parseV5EntryFormat(
271 DebugLineData, OffsetPtr, EndPrologueOffset, &ContentTypes);
272 if (!FileDescriptors)
273 return FileDescriptors.takeError();
Paul Robinson2bc38732017-05-02 21:40:47 +0000274
275 // Get the file entries, according to the format described above.
276 int FileEntryCount = DebugLineData.getU8(OffsetPtr);
277 for (int I = 0; I != FileEntryCount; ++I) {
278 if (*OffsetPtr >= EndPrologueOffset)
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000279 return createStringError(
280 errc::invalid_argument,
281 "failed to parse file entry at offset "
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000282 "0x%8.8" PRIx64
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000283 " because offset extends beyond the prologue end at offset "
284 "0x%8.8" PRIx64,
285 *OffsetPtr, EndPrologueOffset);
Paul Robinson2bc38732017-05-02 21:40:47 +0000286 DWARFDebugLine::FileNameEntry FileEntry;
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000287 for (auto Descriptor : *FileDescriptors) {
Vlad Tsyrklevich53a9f1d2019-03-02 01:10:00 +0000288 DWARFFormValue Value(Descriptor.Form);
289 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U))
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000290 return createStringError(errc::invalid_argument,
291 "failed to parse file entry because "
292 "extracting the form value failed.");
Paul Robinson2bc38732017-05-02 21:40:47 +0000293 switch (Descriptor.Type) {
294 case DW_LNCT_path:
Paul Robinson0a227092018-02-05 20:43:15 +0000295 FileEntry.Name = Value;
Paul Robinson2bc38732017-05-02 21:40:47 +0000296 break;
Scott Linder16c7bda2018-02-23 23:01:06 +0000297 case DW_LNCT_LLVM_source:
298 FileEntry.Source = Value;
299 break;
Paul Robinson2bc38732017-05-02 21:40:47 +0000300 case DW_LNCT_directory_index:
301 FileEntry.DirIdx = Value.getAsUnsignedConstant().getValue();
302 break;
303 case DW_LNCT_timestamp:
304 FileEntry.ModTime = Value.getAsUnsignedConstant().getValue();
305 break;
306 case DW_LNCT_size:
307 FileEntry.Length = Value.getAsUnsignedConstant().getValue();
308 break;
Paul Robinsona06f8dc2017-12-18 19:08:35 +0000309 case DW_LNCT_MD5:
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000310 if (!Value.getAsBlock() || Value.getAsBlock().getValue().size() != 16)
311 return createStringError(
312 errc::invalid_argument,
313 "failed to parse file entry because the MD5 hash is invalid");
Paul Robinsona06f8dc2017-12-18 19:08:35 +0000314 std::uninitialized_copy_n(Value.getAsBlock().getValue().begin(), 16,
315 FileEntry.Checksum.Bytes.begin());
316 break;
Paul Robinson2bc38732017-05-02 21:40:47 +0000317 default:
318 break;
319 }
320 }
321 FileNames.push_back(FileEntry);
322 }
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000323 return Error::success();
Paul Robinson2bc38732017-05-02 21:40:47 +0000324}
325
James Hendersona3acf992018-05-10 10:51:33 +0000326Error DWARFDebugLine::Prologue::parse(const DWARFDataExtractor &DebugLineData,
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000327 uint64_t *OffsetPtr,
James Hendersona3acf992018-05-10 10:51:33 +0000328 const DWARFContext &Ctx,
329 const DWARFUnit *U) {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000330 const uint64_t PrologueOffset = *OffsetPtr;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000331
332 clear();
Alex Bradbury44deaf72019-07-18 05:22:55 +0000333 TotalLength = DebugLineData.getRelocatedValue(4, OffsetPtr);
Igor Kudrin3daefb02019-07-24 11:34:29 +0000334 if (TotalLength == dwarf::DW_LENGTH_DWARF64) {
Paul Robinson75c068c2017-06-26 18:43:01 +0000335 FormParams.Format = dwarf::DWARF64;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000336 TotalLength = DebugLineData.getU64(OffsetPtr);
Igor Kudrin3daefb02019-07-24 11:34:29 +0000337 } else if (TotalLength >= dwarf::DW_LENGTH_lo_reserved) {
Victor Leschukcba595d2018-08-20 09:59:08 +0000338 return createStringError(errc::invalid_argument,
James Hendersona3acf992018-05-10 10:51:33 +0000339 "parsing line table prologue at offset 0x%8.8" PRIx64
340 " unsupported reserved unit length found of value 0x%8.8" PRIx64,
341 PrologueOffset, TotalLength);
Ed Maste6d0bee52015-05-28 15:38:17 +0000342 }
Paul Robinson75c068c2017-06-26 18:43:01 +0000343 FormParams.Version = DebugLineData.getU16(OffsetPtr);
344 if (getVersion() < 2)
Victor Leschukcba595d2018-08-20 09:59:08 +0000345 return createStringError(errc::not_supported,
346 "parsing line table prologue at offset 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000347 " found unsupported version 0x%2.2" PRIx16,
348 PrologueOffset, getVersion());
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000349
Paul Robinson75c068c2017-06-26 18:43:01 +0000350 if (getVersion() >= 5) {
351 FormParams.AddrSize = DebugLineData.getU8(OffsetPtr);
Paul Robinson63811a42017-11-22 15:33:17 +0000352 assert((DebugLineData.getAddressSize() == 0 ||
353 DebugLineData.getAddressSize() == getAddressSize()) &&
Paul Robinson75c068c2017-06-26 18:43:01 +0000354 "Line table header and data extractor disagree");
Paul Robinson2bc38732017-05-02 21:40:47 +0000355 SegSelectorSize = DebugLineData.getU8(OffsetPtr);
356 }
357
Alex Bradbury44deaf72019-07-18 05:22:55 +0000358 PrologueLength =
359 DebugLineData.getRelocatedValue(sizeofPrologueLength(), OffsetPtr);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000360 const uint64_t EndPrologueOffset = PrologueLength + *OffsetPtr;
361 MinInstLength = DebugLineData.getU8(OffsetPtr);
Paul Robinson75c068c2017-06-26 18:43:01 +0000362 if (getVersion() >= 4)
Paul Robinson9d4eb692017-05-01 23:27:55 +0000363 MaxOpsPerInst = DebugLineData.getU8(OffsetPtr);
364 DefaultIsStmt = DebugLineData.getU8(OffsetPtr);
365 LineBase = DebugLineData.getU8(OffsetPtr);
366 LineRange = DebugLineData.getU8(OffsetPtr);
367 OpcodeBase = DebugLineData.getU8(OffsetPtr);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000368
369 StandardOpcodeLengths.reserve(OpcodeBase - 1);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000370 for (uint32_t I = 1; I < OpcodeBase; ++I) {
371 uint8_t OpLen = DebugLineData.getU8(OffsetPtr);
372 StandardOpcodeLengths.push_back(OpLen);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000373 }
374
Paul Robinson75c068c2017-06-26 18:43:01 +0000375 if (getVersion() >= 5) {
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000376 if (Error e = parseV5DirFileTables(
377 DebugLineData, OffsetPtr, EndPrologueOffset, FormParams, Ctx, U,
378 ContentTypes, IncludeDirectories, FileNames)) {
379 return joinErrors(
380 createStringError(
381 errc::invalid_argument,
382 "parsing line table prologue at 0x%8.8" PRIx64
383 " found an invalid directory or file table description at"
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000384 " 0x%8.8" PRIx64,
Jonas Devliegheref8552e62019-07-23 22:34:21 +0000385 PrologueOffset, *OffsetPtr),
Jonas Devlieghere0e7ba062019-07-22 23:23:34 +0000386 std::move(e));
Paul Robinson2bc38732017-05-02 21:40:47 +0000387 }
388 } else
389 parseV2DirFileTables(DebugLineData, OffsetPtr, EndPrologueOffset,
Scott Linder16c7bda2018-02-23 23:01:06 +0000390 ContentTypes, IncludeDirectories, FileNames);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000391
James Hendersona3acf992018-05-10 10:51:33 +0000392 if (*OffsetPtr != EndPrologueOffset)
Victor Leschukcba595d2018-08-20 09:59:08 +0000393 return createStringError(errc::invalid_argument,
394 "parsing line table prologue at 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000395 " should have ended at 0x%8.8" PRIx64
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000396 " but it ended at 0x%8.8" PRIx64,
Jonas Devliegheref8552e62019-07-23 22:34:21 +0000397 PrologueOffset, EndPrologueOffset, *OffsetPtr);
James Hendersona3acf992018-05-10 10:51:33 +0000398 return Error::success();
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000399}
400
Paul Robinson9d4eb692017-05-01 23:27:55 +0000401DWARFDebugLine::Row::Row(bool DefaultIsStmt) { reset(DefaultIsStmt); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000402
Benjamin Kramer5acab502011-09-15 02:12:05 +0000403void DWARFDebugLine::Row::postAppend() {
Fangrui Song6a285df2019-04-11 02:02:44 +0000404 Discriminator = 0;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000405 BasicBlock = false;
406 PrologueEnd = false;
407 EpilogueBegin = false;
408}
409
Paul Robinson9d4eb692017-05-01 23:27:55 +0000410void DWARFDebugLine::Row::reset(bool DefaultIsStmt) {
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000411 Address.Address = 0;
412 Address.SectionIndex = object::SectionedAddress::UndefSection;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000413 Line = 1;
414 Column = 0;
415 File = 1;
416 Isa = 0;
Diego Novillo5b5cf502014-02-14 19:27:53 +0000417 Discriminator = 0;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000418 IsStmt = DefaultIsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000419 BasicBlock = false;
420 EndSequence = false;
421 PrologueEnd = false;
422 EpilogueBegin = false;
423}
424
Greg Clayton67070462017-05-02 22:48:52 +0000425void DWARFDebugLine::Row::dumpTableHeader(raw_ostream &OS) {
426 OS << "Address Line Column File ISA Discriminator Flags\n"
427 << "------------------ ------ ------ ------ --- ------------- "
428 "-------------\n";
429}
430
Benjamin Kramer5acab502011-09-15 02:12:05 +0000431void DWARFDebugLine::Row::dump(raw_ostream &OS) const {
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000432 OS << format("0x%16.16" PRIx64 " %6u %6u", Address.Address, Line, Column)
Diego Novillo5b5cf502014-02-14 19:27:53 +0000433 << format(" %6u %3u %13u ", File, Isa, Discriminator)
Dehao Chen1b54fce2016-04-28 22:09:37 +0000434 << (IsStmt ? " is_stmt" : "") << (BasicBlock ? " basic_block" : "")
Benjamin Kramer5acab502011-09-15 02:12:05 +0000435 << (PrologueEnd ? " prologue_end" : "")
436 << (EpilogueBegin ? " epilogue_begin" : "")
Dehao Chen1b54fce2016-04-28 22:09:37 +0000437 << (EndSequence ? " end_sequence" : "") << '\n';
Benjamin Kramer5acab502011-09-15 02:12:05 +0000438}
439
Dehao Chen1b54fce2016-04-28 22:09:37 +0000440DWARFDebugLine::Sequence::Sequence() { reset(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000441
442void DWARFDebugLine::Sequence::reset() {
443 LowPC = 0;
444 HighPC = 0;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000445 SectionIndex = object::SectionedAddress::UndefSection;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000446 FirstRowIndex = 0;
447 LastRowIndex = 0;
448 Empty = true;
449}
450
Dehao Chen1b54fce2016-04-28 22:09:37 +0000451DWARFDebugLine::LineTable::LineTable() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000452
Paul Robinson0a227092018-02-05 20:43:15 +0000453void DWARFDebugLine::LineTable::dump(raw_ostream &OS,
454 DIDumpOptions DumpOptions) const {
455 Prologue.dump(OS, DumpOptions);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000456 OS << '\n';
457
458 if (!Rows.empty()) {
Greg Clayton67070462017-05-02 22:48:52 +0000459 Row::dumpTableHeader(OS);
Alexey Samsonov1eabf982014-03-13 07:52:54 +0000460 for (const Row &R : Rows) {
461 R.dump(OS);
462 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000463 }
464}
465
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000466void DWARFDebugLine::LineTable::clear() {
467 Prologue.clear();
468 Rows.clear();
469 Sequences.clear();
470}
471
Alexey Samsonov110d5952014-04-30 00:09:19 +0000472DWARFDebugLine::ParsingState::ParsingState(struct LineTable *LT)
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +0000473 : LineTable(LT) {
Alexey Samsonov110d5952014-04-30 00:09:19 +0000474 resetRowAndSequence();
475}
Nick Lewycky4d044922011-09-15 03:41:51 +0000476
Alexey Samsonov110d5952014-04-30 00:09:19 +0000477void DWARFDebugLine::ParsingState::resetRowAndSequence() {
478 Row.reset(LineTable->Prologue.DefaultIsStmt);
479 Sequence.reset();
480}
481
Fangrui Songc4c8bca2019-04-07 13:56:14 +0000482void DWARFDebugLine::ParsingState::appendRowToMatrix() {
Fangrui Song50a09672019-04-15 07:40:30 +0000483 unsigned RowNumber = LineTable->Rows.size();
Alexey Samsonov110d5952014-04-30 00:09:19 +0000484 if (Sequence.Empty) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000485 // Record the beginning of instruction sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000486 Sequence.Empty = false;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000487 Sequence.LowPC = Row.Address.Address;
Alexey Samsonov110d5952014-04-30 00:09:19 +0000488 Sequence.FirstRowIndex = RowNumber;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000489 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000490 LineTable->appendRow(Row);
491 if (Row.EndSequence) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000492 // Record the end of instruction sequence.
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000493 Sequence.HighPC = Row.Address.Address;
Fangrui Song50a09672019-04-15 07:40:30 +0000494 Sequence.LastRowIndex = RowNumber + 1;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000495 Sequence.SectionIndex = Row.Address.SectionIndex;
Alexey Samsonov110d5952014-04-30 00:09:19 +0000496 if (Sequence.isValid())
497 LineTable->appendSequence(Sequence);
498 Sequence.reset();
Alexey Samsonov947228c2012-08-07 11:46:57 +0000499 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000500 Row.postAppend();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000501}
502
Benjamin Kramer5acab502011-09-15 02:12:05 +0000503const DWARFDebugLine::LineTable *
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000504DWARFDebugLine::getLineTable(uint64_t Offset) const {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000505 LineTableConstIter Pos = LineTableMap.find(Offset);
506 if (Pos != LineTableMap.end())
507 return &Pos->second;
Craig Topper2617dcc2014-04-15 06:32:26 +0000508 return nullptr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000509}
510
James Hendersona3acf992018-05-10 10:51:33 +0000511Expected<const DWARFDebugLine::LineTable *> DWARFDebugLine::getOrParseLineTable(
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000512 DWARFDataExtractor &DebugLineData, uint64_t Offset, const DWARFContext &Ctx,
James Henderson004b7292018-05-21 15:30:54 +0000513 const DWARFUnit *U, std::function<void(Error)> RecoverableErrorCallback) {
James Henderson66702622018-03-08 10:53:34 +0000514 if (!DebugLineData.isValidOffset(Offset))
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000515 return createStringError(errc::invalid_argument, "offset 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000516 " is not a valid debug line section offset",
517 Offset);
James Henderson66702622018-03-08 10:53:34 +0000518
Paul Robinson9d4eb692017-05-01 23:27:55 +0000519 std::pair<LineTableIter, bool> Pos =
520 LineTableMap.insert(LineTableMapTy::value_type(Offset, LineTable()));
521 LineTable *LT = &Pos.first->second;
522 if (Pos.second) {
James Henderson004b7292018-05-21 15:30:54 +0000523 if (Error Err =
524 LT->parse(DebugLineData, &Offset, Ctx, U, RecoverableErrorCallback))
James Hendersona3acf992018-05-10 10:51:33 +0000525 return std::move(Err);
526 return LT;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000527 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000528 return LT;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000529}
530
James Hendersona3acf992018-05-10 10:51:33 +0000531Error DWARFDebugLine::LineTable::parse(
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000532 DWARFDataExtractor &DebugLineData, uint64_t *OffsetPtr,
James Hendersona3acf992018-05-10 10:51:33 +0000533 const DWARFContext &Ctx, const DWARFUnit *U,
James Henderson004b7292018-05-21 15:30:54 +0000534 std::function<void(Error)> RecoverableErrorCallback, raw_ostream *OS) {
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000535 const uint64_t DebugLineOffset = *OffsetPtr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000536
Alexey Samsonov110d5952014-04-30 00:09:19 +0000537 clear();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000538
James Hendersona3acf992018-05-10 10:51:33 +0000539 Error PrologueErr = Prologue.parse(DebugLineData, OffsetPtr, Ctx, U);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000540
Paul Robinson0a227092018-02-05 20:43:15 +0000541 if (OS) {
542 // The presence of OS signals verbose dumping.
543 DIDumpOptions DumpOptions;
544 DumpOptions.Verbose = true;
545 Prologue.dump(*OS, DumpOptions);
546 }
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000547
James Hendersona3acf992018-05-10 10:51:33 +0000548 if (PrologueErr)
549 return PrologueErr;
550
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000551 const uint64_t EndOffset =
Paul Robinson9d4eb692017-05-01 23:27:55 +0000552 DebugLineOffset + Prologue.TotalLength + Prologue.sizeofTotalLength();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000553
Paul Robinson511b54c2017-11-22 15:48:30 +0000554 // See if we should tell the data extractor the address size.
555 if (DebugLineData.getAddressSize() == 0)
556 DebugLineData.setAddressSize(Prologue.getAddressSize());
557 else
558 assert(Prologue.getAddressSize() == 0 ||
559 Prologue.getAddressSize() == DebugLineData.getAddressSize());
560
Alexey Samsonov110d5952014-04-30 00:09:19 +0000561 ParsingState State(this);
Benjamin Kramer112ec172011-09-15 21:59:13 +0000562
Paul Robinson9d4eb692017-05-01 23:27:55 +0000563 while (*OffsetPtr < EndOffset) {
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000564 if (OS)
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000565 *OS << format("0x%08.08" PRIx64 ": ", *OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000566
Paul Robinson9d4eb692017-05-01 23:27:55 +0000567 uint8_t Opcode = DebugLineData.getU8(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000568
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000569 if (OS)
570 *OS << format("%02.02" PRIx8 " ", Opcode);
571
Paul Robinson9d4eb692017-05-01 23:27:55 +0000572 if (Opcode == 0) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000573 // Extended Opcodes always start with a zero opcode followed by
574 // a uleb128 length so you can skip ones you don't know about
Paul Robinson9d4eb692017-05-01 23:27:55 +0000575 uint64_t Len = DebugLineData.getULEB128(OffsetPtr);
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000576 uint64_t ExtOffset = *OffsetPtr;
Paul Robinsone0833342017-11-22 15:14:49 +0000577
578 // Tolerate zero-length; assume length is correct and soldier on.
579 if (Len == 0) {
580 if (OS)
581 *OS << "Badly formed extended line op (length 0)\n";
582 continue;
583 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000584
Paul Robinson9d4eb692017-05-01 23:27:55 +0000585 uint8_t SubOpcode = DebugLineData.getU8(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000586 if (OS)
587 *OS << LNExtendedString(SubOpcode);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000588 switch (SubOpcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000589 case DW_LNE_end_sequence:
590 // Set the end_sequence register of the state machine to true and
591 // append a row to the matrix using the current values of the
592 // state-machine registers. Then reset the registers to the initial
593 // values specified above. Every statement program sequence must end
594 // with a DW_LNE_end_sequence instruction which creates a row whose
595 // address is that of the byte after the last target machine instruction
596 // of the sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000597 State.Row.EndSequence = true;
Fangrui Songc4c8bca2019-04-07 13:56:14 +0000598 State.appendRowToMatrix();
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000599 if (OS) {
600 *OS << "\n";
601 OS->indent(12);
602 State.Row.dump(*OS);
603 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000604 State.resetRowAndSequence();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000605 break;
606
607 case DW_LNE_set_address:
608 // Takes a single relocatable address as an operand. The size of the
609 // operand is the size appropriate to hold an address on the target
610 // machine. Set the address register to the value given by the
611 // relocatable address. All of the other statement program opcodes
612 // that affect the address register add a delta to it. This instruction
613 // stores a relocatable value into it instead.
Paul Robinson511b54c2017-11-22 15:48:30 +0000614 //
615 // Make sure the extractor knows the address size. If not, infer it
616 // from the size of the operand.
617 if (DebugLineData.getAddressSize() == 0)
618 DebugLineData.setAddressSize(Len - 1);
Paul Robinson79474682018-03-22 19:37:56 +0000619 else if (DebugLineData.getAddressSize() != Len - 1) {
Victor Leschukcba595d2018-08-20 09:59:08 +0000620 return createStringError(errc::invalid_argument,
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000621 "mismatching address size at offset 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000622 " expected 0x%2.2" PRIx8 " found 0x%2.2" PRIx64,
623 ExtOffset, DebugLineData.getAddressSize(),
624 Len - 1);
Paul Robinson79474682018-03-22 19:37:56 +0000625 }
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000626 State.Row.Address.Address = DebugLineData.getRelocatedAddress(
627 OffsetPtr, &State.Row.Address.SectionIndex);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000628 if (OS)
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000629 *OS << format(" (0x%16.16" PRIx64 ")", State.Row.Address.Address);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000630 break;
631
632 case DW_LNE_define_file:
633 // Takes 4 arguments. The first is a null terminated string containing
634 // a source file name. The second is an unsigned LEB128 number
635 // representing the directory index of the directory in which the file
636 // was found. The third is an unsigned LEB128 number representing the
637 // time of last modification of the file. The fourth is an unsigned
638 // LEB128 number representing the length in bytes of the file. The time
639 // and length fields may contain LEB128(0) if the information is not
640 // available.
641 //
642 // The directory index represents an entry in the include_directories
643 // section of the statement program prologue. The index is LEB128(0)
644 // if the file was found in the current directory of the compilation,
645 // LEB128(1) if it was found in the first directory in the
646 // include_directories section, and so on. The directory index is
647 // ignored for file names that represent full path names.
648 //
649 // The files are numbered, starting at 1, in the order in which they
650 // appear; the names in the prologue come before names defined by
651 // the DW_LNE_define_file instruction. These numbers are used in the
652 // the file register of the state machine.
653 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000654 FileNameEntry FileEntry;
Paul Robinson0a227092018-02-05 20:43:15 +0000655 const char *Name = DebugLineData.getCStr(OffsetPtr);
Jonas Devliegherebb111152019-02-27 00:58:09 +0000656 FileEntry.Name =
657 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000658 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
659 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
660 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
661 Prologue.FileNames.push_back(FileEntry);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000662 if (OS)
Paul Robinson0a227092018-02-05 20:43:15 +0000663 *OS << " (" << Name << ", dir=" << FileEntry.DirIdx << ", mod_time="
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000664 << format("(0x%16.16" PRIx64 ")", FileEntry.ModTime)
665 << ", length=" << FileEntry.Length << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000666 }
667 break;
668
Diego Novillo5b5cf502014-02-14 19:27:53 +0000669 case DW_LNE_set_discriminator:
Paul Robinson9d4eb692017-05-01 23:27:55 +0000670 State.Row.Discriminator = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000671 if (OS)
672 *OS << " (" << State.Row.Discriminator << ")";
Diego Novillo5b5cf502014-02-14 19:27:53 +0000673 break;
674
Benjamin Kramer5acab502011-09-15 02:12:05 +0000675 default:
Paul Robinsone0833342017-11-22 15:14:49 +0000676 if (OS)
677 *OS << format("Unrecognized extended op 0x%02.02" PRIx8, SubOpcode)
678 << format(" length %" PRIx64, Len);
679 // Len doesn't include the zero opcode byte or the length itself, but
680 // it does include the sub_opcode, so we have to adjust for that.
681 (*OffsetPtr) += Len - 1;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000682 break;
683 }
Paul Robinsone0833342017-11-22 15:14:49 +0000684 // Make sure the stated and parsed lengths are the same.
685 // Otherwise we have an unparseable line-number program.
James Hendersona3acf992018-05-10 10:51:33 +0000686 if (*OffsetPtr - ExtOffset != Len)
Victor Leschukcba595d2018-08-20 09:59:08 +0000687 return createStringError(errc::illegal_byte_sequence,
Igor Kudrinf26a70a2019-08-06 10:49:40 +0000688 "unexpected line op length at offset 0x%8.8" PRIx64
689 " expected 0x%2.2" PRIx64 " found 0x%2.2" PRIx64,
James Hendersona3acf992018-05-10 10:51:33 +0000690 ExtOffset, Len, *OffsetPtr - ExtOffset);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000691 } else if (Opcode < Prologue.OpcodeBase) {
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000692 if (OS)
693 *OS << LNStandardString(Opcode);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000694 switch (Opcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000695 // Standard Opcodes
696 case DW_LNS_copy:
697 // Takes no arguments. Append a row to the matrix using the
Fangrui Song6a285df2019-04-11 02:02:44 +0000698 // current values of the state-machine registers.
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000699 if (OS) {
700 *OS << "\n";
701 OS->indent(12);
702 State.Row.dump(*OS);
703 *OS << "\n";
704 }
Fangrui Song6a285df2019-04-11 02:02:44 +0000705 State.appendRowToMatrix();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000706 break;
707
708 case DW_LNS_advance_pc:
709 // Takes a single unsigned LEB128 operand, multiplies it by the
710 // min_inst_length field of the prologue, and adds the
711 // result to the address register of the state machine.
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000712 {
713 uint64_t AddrOffset =
714 DebugLineData.getULEB128(OffsetPtr) * Prologue.MinInstLength;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000715 State.Row.Address.Address += AddrOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000716 if (OS)
717 *OS << " (" << AddrOffset << ")";
718 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000719 break;
720
721 case DW_LNS_advance_line:
722 // Takes a single signed LEB128 operand and adds that value to
723 // the line register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000724 State.Row.Line += DebugLineData.getSLEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000725 if (OS)
726 *OS << " (" << State.Row.Line << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000727 break;
728
729 case DW_LNS_set_file:
730 // Takes a single unsigned LEB128 operand and stores it in the file
731 // register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000732 State.Row.File = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000733 if (OS)
734 *OS << " (" << State.Row.File << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000735 break;
736
737 case DW_LNS_set_column:
738 // Takes a single unsigned LEB128 operand and stores it in the
739 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000740 State.Row.Column = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000741 if (OS)
742 *OS << " (" << State.Row.Column << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000743 break;
744
745 case DW_LNS_negate_stmt:
746 // Takes no arguments. Set the is_stmt register of the state
747 // machine to the logical negation of its current value.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000748 State.Row.IsStmt = !State.Row.IsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000749 break;
750
751 case DW_LNS_set_basic_block:
752 // Takes no arguments. Set the basic_block register of the
753 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000754 State.Row.BasicBlock = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000755 break;
756
757 case DW_LNS_const_add_pc:
758 // Takes no arguments. Add to the address register of the state
759 // machine the address increment value corresponding to special
760 // opcode 255. The motivation for DW_LNS_const_add_pc is this:
761 // when the statement program needs to advance the address by a
762 // small amount, it can use a single special opcode, which occupies
763 // a single byte. When it needs to advance the address by up to
764 // twice the range of the last special opcode, it can use
765 // DW_LNS_const_add_pc followed by a special opcode, for a total
766 // of two bytes. Only if it needs to advance the address by more
767 // than twice that range will it need to use both DW_LNS_advance_pc
768 // and a special opcode, requiring three or more bytes.
769 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000770 uint8_t AdjustOpcode = 255 - Prologue.OpcodeBase;
771 uint64_t AddrOffset =
772 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000773 State.Row.Address.Address += AddrOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000774 if (OS)
775 *OS
776 << format(" (0x%16.16" PRIx64 ")", AddrOffset);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000777 }
778 break;
779
780 case DW_LNS_fixed_advance_pc:
781 // Takes a single uhalf operand. Add to the address register of
782 // the state machine the value of the (unencoded) operand. This
783 // is the only extended opcode that takes an argument that is not
784 // a variable length number. The motivation for DW_LNS_fixed_advance_pc
785 // is this: existing assemblers cannot emit DW_LNS_advance_pc or
786 // special opcodes because they cannot encode LEB128 numbers or
787 // judge when the computation of a special opcode overflows and
788 // requires the use of DW_LNS_advance_pc. Such assemblers, however,
789 // can use DW_LNS_fixed_advance_pc instead, sacrificing compression.
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000790 {
Alex Bradbury44deaf72019-07-18 05:22:55 +0000791 uint16_t PCOffset = DebugLineData.getRelocatedValue(2, OffsetPtr);
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000792 State.Row.Address.Address += PCOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000793 if (OS)
794 *OS
Igor Kudrin74c350a2019-07-16 06:56:10 +0000795 << format(" (0x%4.4" PRIx16 ")", PCOffset);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000796 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000797 break;
798
799 case DW_LNS_set_prologue_end:
800 // Takes no arguments. Set the prologue_end register of the
801 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000802 State.Row.PrologueEnd = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000803 break;
804
805 case DW_LNS_set_epilogue_begin:
806 // Takes no arguments. Set the basic_block register of the
807 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000808 State.Row.EpilogueBegin = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000809 break;
810
811 case DW_LNS_set_isa:
812 // Takes a single unsigned LEB128 operand and stores it in the
813 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000814 State.Row.Isa = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000815 if (OS)
816 *OS << " (" << State.Row.Isa << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000817 break;
818
819 default:
820 // Handle any unknown standard opcodes here. We know the lengths
821 // of such opcodes because they are specified in the prologue
822 // as a multiple of LEB128 operands for each opcode.
823 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000824 assert(Opcode - 1U < Prologue.StandardOpcodeLengths.size());
825 uint8_t OpcodeLength = Prologue.StandardOpcodeLengths[Opcode - 1];
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000826 for (uint8_t I = 0; I < OpcodeLength; ++I) {
827 uint64_t Value = DebugLineData.getULEB128(OffsetPtr);
828 if (OS)
829 *OS << format("Skipping ULEB128 value: 0x%16.16" PRIx64 ")\n",
830 Value);
831 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000832 }
833 break;
834 }
835 } else {
836 // Special Opcodes
837
838 // A special opcode value is chosen based on the amount that needs
839 // to be added to the line and address registers. The maximum line
840 // increment for a special opcode is the value of the line_base
841 // field in the header, plus the value of the line_range field,
842 // minus 1 (line base + line range - 1). If the desired line
843 // increment is greater than the maximum line increment, a standard
NAKAMURA Takumif9959852011-10-08 11:22:47 +0000844 // opcode must be used instead of a special opcode. The "address
845 // advance" is calculated by dividing the desired address increment
Benjamin Kramer5acab502011-09-15 02:12:05 +0000846 // by the minimum_instruction_length field from the header. The
847 // special opcode is then calculated using the following formula:
848 //
849 // opcode = (desired line increment - line_base) +
850 // (line_range * address advance) + opcode_base
851 //
852 // If the resulting opcode is greater than 255, a standard opcode
853 // must be used instead.
854 //
855 // To decode a special opcode, subtract the opcode_base from the
856 // opcode itself to give the adjusted opcode. The amount to
857 // increment the address register is the result of the adjusted
858 // opcode divided by the line_range multiplied by the
859 // minimum_instruction_length field from the header. That is:
860 //
861 // address increment = (adjusted opcode / line_range) *
862 // minimum_instruction_length
863 //
864 // The amount to increment the line register is the line_base plus
865 // the result of the adjusted opcode modulo the line_range. That is:
866 //
867 // line increment = line_base + (adjusted opcode % line_range)
868
Paul Robinson9d4eb692017-05-01 23:27:55 +0000869 uint8_t AdjustOpcode = Opcode - Prologue.OpcodeBase;
870 uint64_t AddrOffset =
871 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
872 int32_t LineOffset =
873 Prologue.LineBase + (AdjustOpcode % Prologue.LineRange);
874 State.Row.Line += LineOffset;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000875 State.Row.Address.Address += AddrOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000876
877 if (OS) {
James Hendersonb6b5b1a2019-02-06 10:31:50 +0000878 *OS << "address += " << AddrOffset << ", line += " << LineOffset
879 << "\n";
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000880 OS->indent(12);
881 State.Row.dump(*OS);
882 }
883
Fangrui Songc4c8bca2019-04-07 13:56:14 +0000884 State.appendRowToMatrix();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000885 }
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000886 if(OS)
887 *OS << "\n";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000888 }
889
Jonas Devlieghere84e99262018-04-14 22:07:23 +0000890 if (!State.Sequence.Empty)
James Henderson004b7292018-05-21 15:30:54 +0000891 RecoverableErrorCallback(
Victor Leschukcba595d2018-08-20 09:59:08 +0000892 createStringError(errc::illegal_byte_sequence,
893 "last sequence in debug line table is not terminated!"));
Alexey Samsonov110d5952014-04-30 00:09:19 +0000894
895 // Sort all sequences so that address lookup will work faster.
896 if (!Sequences.empty()) {
Fangrui Song9b22c462019-04-09 15:08:32 +0000897 llvm::sort(Sequences, Sequence::orderByHighPC);
Alexey Samsonov110d5952014-04-30 00:09:19 +0000898 // Note: actually, instruction address ranges of sequences should not
899 // overlap (in shared objects and executables). If they do, the address
900 // lookup would still work, though, but result would be ambiguous.
901 // We don't report warning in this case. For example,
902 // sometimes .so compiled from multiple object files contains a few
903 // rudimentary sequences for address ranges [0x0, 0xsomething).
904 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000905
James Hendersona3acf992018-05-10 10:51:33 +0000906 return Error::success();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000907}
908
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000909uint32_t DWARFDebugLine::LineTable::findRowInSeq(
910 const DWARFDebugLine::Sequence &Seq,
911 object::SectionedAddress Address) const {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000912 if (!Seq.containsPC(Address))
Keno Fischerc2c60182015-05-31 23:37:04 +0000913 return UnknownRowIndex;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000914 assert(Seq.SectionIndex == Address.SectionIndex);
Fangrui Songb3be23d2019-04-10 07:44:23 +0000915 // In some cases, e.g. first instruction in a function, the compiler generates
916 // two entries, both with the same address. We want the last one.
917 //
918 // In general we want a non-empty range: the last row whose address is less
919 // than or equal to Address. This can be computed as upper_bound - 1.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000920 DWARFDebugLine::Row Row;
921 Row.Address = Address;
922 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex;
923 RowIter LastRow = Rows.begin() + Seq.LastRowIndex;
Fangrui Songb3be23d2019-04-10 07:44:23 +0000924 assert(FirstRow->Address.Address <= Row.Address.Address &&
925 Row.Address.Address < LastRow[-1].Address.Address);
926 RowIter RowPos = std::upper_bound(FirstRow + 1, LastRow - 1, Row,
927 DWARFDebugLine::Row::orderByAddress) -
928 1;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000929 assert(Seq.SectionIndex == RowPos->Address.SectionIndex);
Fangrui Songb3be23d2019-04-10 07:44:23 +0000930 return RowPos - Rows.begin();
Keno Fischerc2c60182015-05-31 23:37:04 +0000931}
932
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000933uint32_t DWARFDebugLine::LineTable::lookupAddress(
934 object::SectionedAddress Address) const {
935
936 // Search for relocatable addresses
937 uint32_t Result = lookupAddressImpl(Address);
938
939 if (Result != UnknownRowIndex ||
940 Address.SectionIndex == object::SectionedAddress::UndefSection)
941 return Result;
942
943 // Search for absolute addresses
944 Address.SectionIndex = object::SectionedAddress::UndefSection;
945 return lookupAddressImpl(Address);
946}
947
948uint32_t DWARFDebugLine::LineTable::lookupAddressImpl(
949 object::SectionedAddress Address) const {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000950 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000951 DWARFDebugLine::Sequence Sequence;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000952 Sequence.SectionIndex = Address.SectionIndex;
Fangrui Song9b22c462019-04-09 15:08:32 +0000953 Sequence.HighPC = Address.Address;
954 SequenceIter It = llvm::upper_bound(Sequences, Sequence,
955 DWARFDebugLine::Sequence::orderByHighPC);
956 if (It == Sequences.end() || It->SectionIndex != Address.SectionIndex)
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000957 return UnknownRowIndex;
Fangrui Song9b22c462019-04-09 15:08:32 +0000958 return findRowInSeq(*It, Address);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000959}
Alexey Samsonov45be7932012-08-30 07:49:50 +0000960
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000961bool DWARFDebugLine::LineTable::lookupAddressRange(
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000962 object::SectionedAddress Address, uint64_t Size,
963 std::vector<uint32_t> &Result) const {
964
965 // Search for relocatable addresses
966 if (lookupAddressRangeImpl(Address, Size, Result))
967 return true;
968
969 if (Address.SectionIndex == object::SectionedAddress::UndefSection)
970 return false;
971
972 // Search for absolute addresses
973 Address.SectionIndex = object::SectionedAddress::UndefSection;
974 return lookupAddressRangeImpl(Address, Size, Result);
975}
976
977bool DWARFDebugLine::LineTable::lookupAddressRangeImpl(
978 object::SectionedAddress Address, uint64_t Size,
979 std::vector<uint32_t> &Result) const {
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000980 if (Sequences.empty())
981 return false;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000982 uint64_t EndAddr = Address.Address + Size;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000983 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000984 DWARFDebugLine::Sequence Sequence;
Alexey Lapshin77fc1f62019-02-27 13:17:36 +0000985 Sequence.SectionIndex = Address.SectionIndex;
Fangrui Song9b22c462019-04-09 15:08:32 +0000986 Sequence.HighPC = Address.Address;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000987 SequenceIter LastSeq = Sequences.end();
Fangrui Song9b22c462019-04-09 15:08:32 +0000988 SequenceIter SeqPos = llvm::upper_bound(
989 Sequences, Sequence, DWARFDebugLine::Sequence::orderByHighPC);
990 if (SeqPos == LastSeq || !SeqPos->containsPC(Address))
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000991 return false;
992
Paul Robinson9d4eb692017-05-01 23:27:55 +0000993 SequenceIter StartPos = SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000994
995 // Add the rows from the first sequence to the vector, starting with the
996 // index we just calculated
997
Paul Robinson9d4eb692017-05-01 23:27:55 +0000998 while (SeqPos != LastSeq && SeqPos->LowPC < EndAddr) {
999 const DWARFDebugLine::Sequence &CurSeq = *SeqPos;
Keno Fischerc2c60182015-05-31 23:37:04 +00001000 // For the first sequence, we need to find which row in the sequence is the
1001 // first in our range.
Paul Robinson9d4eb692017-05-01 23:27:55 +00001002 uint32_t FirstRowIndex = CurSeq.FirstRowIndex;
1003 if (SeqPos == StartPos)
1004 FirstRowIndex = findRowInSeq(CurSeq, Address);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +00001005
Keno Fischerc2c60182015-05-31 23:37:04 +00001006 // Figure out the last row in the range.
Alexey Lapshin77fc1f62019-02-27 13:17:36 +00001007 uint32_t LastRowIndex =
1008 findRowInSeq(CurSeq, {EndAddr - 1, Address.SectionIndex});
Paul Robinson9d4eb692017-05-01 23:27:55 +00001009 if (LastRowIndex == UnknownRowIndex)
1010 LastRowIndex = CurSeq.LastRowIndex - 1;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +00001011
Paul Robinson9d4eb692017-05-01 23:27:55 +00001012 assert(FirstRowIndex != UnknownRowIndex);
1013 assert(LastRowIndex != UnknownRowIndex);
Keno Fischerc2c60182015-05-31 23:37:04 +00001014
Paul Robinson9d4eb692017-05-01 23:27:55 +00001015 for (uint32_t I = FirstRowIndex; I <= LastRowIndex; ++I) {
1016 Result.push_back(I);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +00001017 }
1018
Paul Robinson9d4eb692017-05-01 23:27:55 +00001019 ++SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +00001020 }
NAKAMURA Takumi4b86cdb2013-01-26 01:45:06 +00001021
1022 return true;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +00001023}
1024
Scott Linder16c7bda2018-02-23 23:01:06 +00001025Optional<StringRef> DWARFDebugLine::LineTable::getSourceByIndex(uint64_t FileIndex,
1026 FileLineInfoKind Kind) const {
Jonas Devlieghereca16d282019-07-16 01:21:25 +00001027 if (Kind == FileLineInfoKind::None || !Prologue.hasFileAtIndex(FileIndex))
Scott Linder16c7bda2018-02-23 23:01:06 +00001028 return None;
Jonas Devlieghereca16d282019-07-16 01:21:25 +00001029 const FileNameEntry &Entry = Prologue.getFileNameEntry(FileIndex);
Scott Linder16c7bda2018-02-23 23:01:06 +00001030 if (Optional<const char *> source = Entry.Source.getAsCString())
1031 return StringRef(*source);
1032 return None;
1033}
1034
Eugene Zemtsov82d60d62018-03-13 17:54:29 +00001035static bool isPathAbsoluteOnWindowsOrPosix(const Twine &Path) {
1036 // Debug info can contain paths from any OS, not necessarily
1037 // an OS we're currently running on. Moreover different compilation units can
1038 // be compiled on different operating systems and linked together later.
1039 return sys::path::is_absolute(Path, sys::path::Style::posix) ||
1040 sys::path::is_absolute(Path, sys::path::Style::windows);
1041}
1042
Jonas Devliegherede0ce982019-08-15 23:53:15 +00001043bool DWARFDebugLine::Prologue::getFileNameByIndex(
1044 uint64_t FileIndex, StringRef CompDir, FileLineInfoKind Kind,
1045 std::string &Result, sys::path::Style Style) const {
Pete Cooperb2ba7762016-07-22 01:41:32 +00001046 if (Kind == FileLineInfoKind::None || !hasFileAtIndex(FileIndex))
Alexey Samsonov45be7932012-08-30 07:49:50 +00001047 return false;
Ali Tamur783d84b2019-04-19 02:26:56 +00001048 const FileNameEntry &Entry = getFileNameEntry(FileIndex);
Paul Robinson0a227092018-02-05 20:43:15 +00001049 StringRef FileName = Entry.Name.getAsCString().getValue();
Alexey Samsonovdce67342014-05-15 21:24:32 +00001050 if (Kind != FileLineInfoKind::AbsoluteFilePath ||
Eugene Zemtsov82d60d62018-03-13 17:54:29 +00001051 isPathAbsoluteOnWindowsOrPosix(FileName)) {
Alexey Samsonov45be7932012-08-30 07:49:50 +00001052 Result = FileName;
1053 return true;
1054 }
Frederic Riss101b5e22014-09-19 15:11:51 +00001055
Alexey Samsonov45be7932012-08-30 07:49:50 +00001056 SmallString<16> FilePath;
Paul Robinsonba1c9152017-05-02 17:37:32 +00001057 StringRef IncludeDir;
Alexey Samsonov45be7932012-08-30 07:49:50 +00001058 // Be defensive about the contents of Entry.
Jonas Devlieghereca16d282019-07-16 01:21:25 +00001059 if (getVersion() >= 5) {
1060 if (Entry.DirIdx < IncludeDirectories.size())
1061 IncludeDir = IncludeDirectories[Entry.DirIdx].getAsCString().getValue();
Jonas Devlieghere01ee1722019-07-16 00:59:04 +00001062 } else {
Jonas Devlieghereca16d282019-07-16 01:21:25 +00001063 if (0 < Entry.DirIdx && Entry.DirIdx <= IncludeDirectories.size())
1064 IncludeDir =
1065 IncludeDirectories[Entry.DirIdx - 1].getAsCString().getValue();
Frederic Riss101b5e22014-09-19 15:11:51 +00001066
Fangrui Song7e556722019-05-06 08:03:46 +00001067 // We may still need to append compilation directory of compile unit.
1068 // We know that FileName is not absolute, the only way to have an
1069 // absolute path at this point would be if IncludeDir is absolute.
Jonas Devlieghereca16d282019-07-16 01:21:25 +00001070 if (!CompDir.empty() && !isPathAbsoluteOnWindowsOrPosix(IncludeDir))
Jonas Devliegherede0ce982019-08-15 23:53:15 +00001071 sys::path::append(FilePath, Style, CompDir);
Fangrui Song7e556722019-05-06 08:03:46 +00001072 }
Frederic Riss101b5e22014-09-19 15:11:51 +00001073
1074 // sys::path::append skips empty strings.
Jonas Devliegherede0ce982019-08-15 23:53:15 +00001075 sys::path::append(FilePath, Style, IncludeDir, FileName);
Alexey Samsonov45be7932012-08-30 07:49:50 +00001076 Result = FilePath.str();
1077 return true;
1078}
Frederic Riss101b5e22014-09-19 15:11:51 +00001079
Dehao Chen1b54fce2016-04-28 22:09:37 +00001080bool DWARFDebugLine::LineTable::getFileLineInfoForAddress(
Alexey Lapshin77fc1f62019-02-27 13:17:36 +00001081 object::SectionedAddress Address, const char *CompDir,
1082 FileLineInfoKind Kind, DILineInfo &Result) const {
Frederic Riss101b5e22014-09-19 15:11:51 +00001083 // Get the index of row we're looking for in the line table.
1084 uint32_t RowIndex = lookupAddress(Address);
1085 if (RowIndex == -1U)
1086 return false;
1087 // Take file number and line/column from the row.
1088 const auto &Row = Rows[RowIndex];
1089 if (!getFileNameByIndex(Row.File, CompDir, Kind, Result.FileName))
1090 return false;
1091 Result.Line = Row.Line;
1092 Result.Column = Row.Column;
Eric Christopherba1024c2016-12-14 18:29:39 +00001093 Result.Discriminator = Row.Discriminator;
Scott Linder16c7bda2018-02-23 23:01:06 +00001094 Result.Source = getSourceByIndex(Row.File, Kind);
Frederic Riss101b5e22014-09-19 15:11:51 +00001095 return true;
1096}
James Hendersona3acf992018-05-10 10:51:33 +00001097
1098// We want to supply the Unit associated with a .debug_line[.dwo] table when
1099// we dump it, if possible, but still dump the table even if there isn't a Unit.
1100// Therefore, collect up handles on all the Units that point into the
1101// line-table section.
1102static DWARFDebugLine::SectionParser::LineToUnitMap
1103buildLineToUnitMap(DWARFDebugLine::SectionParser::cu_range CUs,
Paul Robinson7f330942018-08-01 20:46:46 +00001104 DWARFDebugLine::SectionParser::tu_range TUs) {
James Hendersona3acf992018-05-10 10:51:33 +00001105 DWARFDebugLine::SectionParser::LineToUnitMap LineToUnit;
1106 for (const auto &CU : CUs)
1107 if (auto CUDIE = CU->getUnitDIE())
1108 if (auto StmtOffset = toSectionOffset(CUDIE.find(DW_AT_stmt_list)))
1109 LineToUnit.insert(std::make_pair(*StmtOffset, &*CU));
Paul Robinson7f330942018-08-01 20:46:46 +00001110 for (const auto &TU : TUs)
1111 if (auto TUDIE = TU->getUnitDIE())
1112 if (auto StmtOffset = toSectionOffset(TUDIE.find(DW_AT_stmt_list)))
1113 LineToUnit.insert(std::make_pair(*StmtOffset, &*TU));
James Hendersona3acf992018-05-10 10:51:33 +00001114 return LineToUnit;
1115}
1116
1117DWARFDebugLine::SectionParser::SectionParser(DWARFDataExtractor &Data,
1118 const DWARFContext &C,
1119 cu_range CUs, tu_range TUs)
1120 : DebugLineData(Data), Context(C) {
1121 LineToUnit = buildLineToUnitMap(CUs, TUs);
1122 if (!DebugLineData.isValidOffset(Offset))
1123 Done = true;
1124}
1125
1126bool DWARFDebugLine::Prologue::totalLengthIsValid() const {
Igor Kudrin3daefb02019-07-24 11:34:29 +00001127 return TotalLength == dwarf::DW_LENGTH_DWARF64 ||
1128 TotalLength < dwarf::DW_LENGTH_lo_reserved;
James Hendersona3acf992018-05-10 10:51:33 +00001129}
1130
1131DWARFDebugLine::LineTable DWARFDebugLine::SectionParser::parseNext(
James Henderson004b7292018-05-21 15:30:54 +00001132 function_ref<void(Error)> RecoverableErrorCallback,
1133 function_ref<void(Error)> UnrecoverableErrorCallback, raw_ostream *OS) {
James Hendersona3acf992018-05-10 10:51:33 +00001134 assert(DebugLineData.isValidOffset(Offset) &&
1135 "parsing should have terminated");
1136 DWARFUnit *U = prepareToParse(Offset);
Igor Kudrinf26a70a2019-08-06 10:49:40 +00001137 uint64_t OldOffset = Offset;
James Hendersona3acf992018-05-10 10:51:33 +00001138 LineTable LT;
James Henderson004b7292018-05-21 15:30:54 +00001139 if (Error Err = LT.parse(DebugLineData, &Offset, Context, U,
1140 RecoverableErrorCallback, OS))
1141 UnrecoverableErrorCallback(std::move(Err));
James Hendersona3acf992018-05-10 10:51:33 +00001142 moveToNextTable(OldOffset, LT.Prologue);
1143 return LT;
1144}
1145
1146void DWARFDebugLine::SectionParser::skip(
1147 function_ref<void(Error)> ErrorCallback) {
1148 assert(DebugLineData.isValidOffset(Offset) &&
1149 "parsing should have terminated");
1150 DWARFUnit *U = prepareToParse(Offset);
Igor Kudrinf26a70a2019-08-06 10:49:40 +00001151 uint64_t OldOffset = Offset;
James Hendersona3acf992018-05-10 10:51:33 +00001152 LineTable LT;
James Henderson004b7292018-05-21 15:30:54 +00001153 if (Error Err = LT.Prologue.parse(DebugLineData, &Offset, Context, U))
1154 ErrorCallback(std::move(Err));
James Hendersona3acf992018-05-10 10:51:33 +00001155 moveToNextTable(OldOffset, LT.Prologue);
1156}
1157
Igor Kudrinf26a70a2019-08-06 10:49:40 +00001158DWARFUnit *DWARFDebugLine::SectionParser::prepareToParse(uint64_t Offset) {
James Hendersona3acf992018-05-10 10:51:33 +00001159 DWARFUnit *U = nullptr;
1160 auto It = LineToUnit.find(Offset);
1161 if (It != LineToUnit.end())
1162 U = It->second;
1163 DebugLineData.setAddressSize(U ? U->getAddressByteSize() : 0);
1164 return U;
1165}
1166
Igor Kudrinf26a70a2019-08-06 10:49:40 +00001167void DWARFDebugLine::SectionParser::moveToNextTable(uint64_t OldOffset,
James Hendersona3acf992018-05-10 10:51:33 +00001168 const Prologue &P) {
1169 // If the length field is not valid, we don't know where the next table is, so
1170 // cannot continue to parse. Mark the parser as done, and leave the Offset
1171 // value as it currently is. This will be the end of the bad length field.
1172 if (!P.totalLengthIsValid()) {
1173 Done = true;
1174 return;
1175 }
1176
1177 Offset = OldOffset + P.TotalLength + P.sizeofTotalLength();
1178 if (!DebugLineData.isValidOffset(Offset)) {
1179 Done = true;
1180 }
1181}