blob: 406c342cd5892ad0e08c133a892d472e23902456 [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"
Alexey Samsonov45be7932012-08-30 07:49:50 +000019#include "llvm/Support/Path.h"
Jonas Devlieghere84e99262018-04-14 22:07:23 +000020#include "llvm/Support/WithColor.h"
Benjamin Kramer5acab502011-09-15 02:12:05 +000021#include "llvm/Support/raw_ostream.h"
Benjamin Kramera57c46a2011-09-15 02:19:33 +000022#include <algorithm>
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000023#include <cassert>
24#include <cinttypes>
25#include <cstdint>
26#include <cstdio>
27#include <utility>
28
Benjamin Kramer5acab502011-09-15 02:12:05 +000029using namespace llvm;
30using namespace dwarf;
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000031
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000032using FileLineInfoKind = DILineInfoSpecifier::FileLineInfoKind;
33
Paul Robinson2bc38732017-05-02 21:40:47 +000034namespace {
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000035
Paul Robinson2bc38732017-05-02 21:40:47 +000036struct ContentDescriptor {
37 dwarf::LineNumberEntryFormat Type;
38 dwarf::Form Form;
39};
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +000040
41using ContentDescriptors = SmallVector<ContentDescriptor, 4>;
42
Paul Robinson2bc38732017-05-02 21:40:47 +000043} // end anonmyous namespace
Benjamin Kramer5acab502011-09-15 02:12:05 +000044
Scott Linder16c7bda2018-02-23 23:01:06 +000045void DWARFDebugLine::ContentTypeTracker::trackContentType(
46 dwarf::LineNumberEntryFormat ContentType) {
47 switch (ContentType) {
48 case dwarf::DW_LNCT_timestamp:
49 HasModTime = true;
50 break;
51 case dwarf::DW_LNCT_size:
52 HasLength = true;
53 break;
54 case dwarf::DW_LNCT_MD5:
55 HasMD5 = true;
56 break;
57 case dwarf::DW_LNCT_LLVM_source:
58 HasSource = true;
59 break;
60 default:
61 // We only care about values we consider optional, and new values may be
62 // added in the vendor extension range, so we do not match exhaustively.
63 break;
64 }
65}
66
Dehao Chen1b54fce2016-04-28 22:09:37 +000067DWARFDebugLine::Prologue::Prologue() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000068
69void DWARFDebugLine::Prologue::clear() {
Paul Robinson75c068c2017-06-26 18:43:01 +000070 TotalLength = PrologueLength = 0;
71 SegSelectorSize = 0;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000072 MinInstLength = MaxOpsPerInst = DefaultIsStmt = LineBase = LineRange = 0;
73 OpcodeBase = 0;
Pavel Labath322711f2018-03-14 09:39:54 +000074 FormParams = dwarf::FormParams({0, 0, DWARF32});
Scott Linder16c7bda2018-02-23 23:01:06 +000075 ContentTypes = ContentTypeTracker();
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000076 StandardOpcodeLengths.clear();
77 IncludeDirectories.clear();
78 FileNames.clear();
79}
80
Paul Robinson0a227092018-02-05 20:43:15 +000081void DWARFDebugLine::Prologue::dump(raw_ostream &OS,
82 DIDumpOptions DumpOptions) const {
Benjamin Kramer5acab502011-09-15 02:12:05 +000083 OS << "Line table prologue:\n"
Ed Maste6d0bee52015-05-28 15:38:17 +000084 << format(" total_length: 0x%8.8" PRIx64 "\n", TotalLength)
Paul Robinson75c068c2017-06-26 18:43:01 +000085 << format(" version: %u\n", getVersion());
86 if (getVersion() >= 5)
87 OS << format(" address_size: %u\n", getAddressSize())
88 << format(" seg_select_size: %u\n", SegSelectorSize);
89 OS << format(" prologue_length: 0x%8.8" PRIx64 "\n", PrologueLength)
David Blaikie1d4736e2014-02-24 23:58:54 +000090 << format(" min_inst_length: %u\n", MinInstLength)
Paul Robinson75c068c2017-06-26 18:43:01 +000091 << format(getVersion() >= 4 ? "max_ops_per_inst: %u\n" : "", MaxOpsPerInst)
David Blaikie1d4736e2014-02-24 23:58:54 +000092 << format(" default_is_stmt: %u\n", DefaultIsStmt)
93 << format(" line_base: %i\n", LineBase)
94 << format(" line_range: %u\n", LineRange)
95 << format(" opcode_base: %u\n", OpcodeBase);
Benjamin Kramer5acab502011-09-15 02:12:05 +000096
Paul Robinson9d4eb692017-05-01 23:27:55 +000097 for (uint32_t I = 0; I != StandardOpcodeLengths.size(); ++I)
Mehdi Amini149f6ea2016-10-05 05:59:29 +000098 OS << format("standard_opcode_lengths[%s] = %u\n",
Paul Robinson9d4eb692017-05-01 23:27:55 +000099 LNStandardString(I + 1).data(), StandardOpcodeLengths[I]);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000100
Paul Robinson8181d232018-01-18 20:33:35 +0000101 if (!IncludeDirectories.empty()) {
102 // DWARF v5 starts directory indexes at 0.
103 uint32_t DirBase = getVersion() >= 5 ? 0 : 1;
Paul Robinson0a227092018-02-05 20:43:15 +0000104 for (uint32_t I = 0; I != IncludeDirectories.size(); ++I) {
105 OS << format("include_directories[%3u] = ", I + DirBase);
106 IncludeDirectories[I].dump(OS, DumpOptions);
107 OS << '\n';
108 }
Paul Robinson8181d232018-01-18 20:33:35 +0000109 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000110
111 if (!FileNames.empty()) {
Paul Robinsonceafcd42018-02-08 23:08:02 +0000112 // DWARF v5 starts file indexes at 0.
113 uint32_t FileBase = getVersion() >= 5 ? 0 : 1;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000114 for (uint32_t I = 0; I != FileNames.size(); ++I) {
115 const FileNameEntry &FileEntry = FileNames[I];
Scott Linder16c7bda2018-02-23 23:01:06 +0000116 OS << format("file_names[%3u]:\n", I + FileBase);
117 OS << " name: ";
Paul Robinson0a227092018-02-05 20:43:15 +0000118 FileEntry.Name.dump(OS, DumpOptions);
Scott Linder16c7bda2018-02-23 23:01:06 +0000119 OS << '\n'
120 << format(" dir_index: %" PRIu64 "\n", FileEntry.DirIdx);
121 if (ContentTypes.HasMD5)
122 OS << " md5_checksum: " << FileEntry.Checksum.digest() << '\n';
123 if (ContentTypes.HasModTime)
124 OS << format(" mod_time: 0x%8.8" PRIx64 "\n", FileEntry.ModTime);
125 if (ContentTypes.HasLength)
126 OS << format(" length: 0x%8.8" PRIx64 "\n", FileEntry.Length);
127 if (ContentTypes.HasSource) {
128 OS << " source: ";
129 FileEntry.Source.dump(OS, DumpOptions);
130 OS << '\n';
131 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000132 }
133 }
134}
135
Paul Robinson2bc38732017-05-02 21:40:47 +0000136// Parse v2-v4 directory and file tables.
137static void
Paul Robinson17536b92017-06-29 16:52:08 +0000138parseV2DirFileTables(const DWARFDataExtractor &DebugLineData,
139 uint32_t *OffsetPtr, uint64_t EndPrologueOffset,
Scott Linder16c7bda2018-02-23 23:01:06 +0000140 DWARFDebugLine::ContentTypeTracker &ContentTypes,
Paul Robinson0a227092018-02-05 20:43:15 +0000141 std::vector<DWARFFormValue> &IncludeDirectories,
Paul Robinson2bc38732017-05-02 21:40:47 +0000142 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
143 while (*OffsetPtr < EndPrologueOffset) {
144 StringRef S = DebugLineData.getCStrRef(OffsetPtr);
145 if (S.empty())
146 break;
Jonas Devliegherebb111152019-02-27 00:58:09 +0000147 DWARFFormValue Dir =
148 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, S.data());
Paul Robinson0a227092018-02-05 20:43:15 +0000149 IncludeDirectories.push_back(Dir);
Paul Robinson2bc38732017-05-02 21:40:47 +0000150 }
151
152 while (*OffsetPtr < EndPrologueOffset) {
153 StringRef Name = DebugLineData.getCStrRef(OffsetPtr);
154 if (Name.empty())
155 break;
156 DWARFDebugLine::FileNameEntry FileEntry;
Jonas Devliegherebb111152019-02-27 00:58:09 +0000157 FileEntry.Name =
158 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name.data());
Paul Robinson2bc38732017-05-02 21:40:47 +0000159 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
160 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
161 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
162 FileNames.push_back(FileEntry);
163 }
Scott Linder16c7bda2018-02-23 23:01:06 +0000164
165 ContentTypes.HasModTime = true;
166 ContentTypes.HasLength = true;
Paul Robinson2bc38732017-05-02 21:40:47 +0000167}
168
169// Parse v5 directory/file entry content descriptions.
170// Returns the descriptors, or an empty vector if we did not find a path or
171// ran off the end of the prologue.
172static ContentDescriptors
Scott Linder16c7bda2018-02-23 23:01:06 +0000173parseV5EntryFormat(const DWARFDataExtractor &DebugLineData, uint32_t
174 *OffsetPtr, uint64_t EndPrologueOffset, DWARFDebugLine::ContentTypeTracker
175 *ContentTypes) {
Paul Robinson2bc38732017-05-02 21:40:47 +0000176 ContentDescriptors Descriptors;
177 int FormatCount = DebugLineData.getU8(OffsetPtr);
178 bool HasPath = false;
179 for (int I = 0; I != FormatCount; ++I) {
180 if (*OffsetPtr >= EndPrologueOffset)
181 return ContentDescriptors();
182 ContentDescriptor Descriptor;
183 Descriptor.Type =
184 dwarf::LineNumberEntryFormat(DebugLineData.getULEB128(OffsetPtr));
185 Descriptor.Form = dwarf::Form(DebugLineData.getULEB128(OffsetPtr));
186 if (Descriptor.Type == dwarf::DW_LNCT_path)
187 HasPath = true;
Scott Linder16c7bda2018-02-23 23:01:06 +0000188 if (ContentTypes)
189 ContentTypes->trackContentType(Descriptor.Type);
Paul Robinson2bc38732017-05-02 21:40:47 +0000190 Descriptors.push_back(Descriptor);
191 }
192 return HasPath ? Descriptors : ContentDescriptors();
193}
194
195static bool
Paul Robinson17536b92017-06-29 16:52:08 +0000196parseV5DirFileTables(const DWARFDataExtractor &DebugLineData,
197 uint32_t *OffsetPtr, uint64_t EndPrologueOffset,
Pavel Labath322711f2018-03-14 09:39:54 +0000198 const dwarf::FormParams &FormParams,
199 const DWARFContext &Ctx, const DWARFUnit *U,
Scott Linder16c7bda2018-02-23 23:01:06 +0000200 DWARFDebugLine::ContentTypeTracker &ContentTypes,
Paul Robinson0a227092018-02-05 20:43:15 +0000201 std::vector<DWARFFormValue> &IncludeDirectories,
Paul Robinson2bc38732017-05-02 21:40:47 +0000202 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
203 // Get the directory entry description.
204 ContentDescriptors DirDescriptors =
Paul Robinsona06f8dc2017-12-18 19:08:35 +0000205 parseV5EntryFormat(DebugLineData, OffsetPtr, EndPrologueOffset, nullptr);
Paul Robinson2bc38732017-05-02 21:40:47 +0000206 if (DirDescriptors.empty())
207 return false;
208
209 // Get the directory entries, according to the format described above.
210 int DirEntryCount = DebugLineData.getU8(OffsetPtr);
211 for (int I = 0; I != DirEntryCount; ++I) {
212 if (*OffsetPtr >= EndPrologueOffset)
213 return false;
214 for (auto Descriptor : DirDescriptors) {
215 DWARFFormValue Value(Descriptor.Form);
216 switch (Descriptor.Type) {
217 case DW_LNCT_path:
Paul Robinsonbf750c82018-01-29 20:57:43 +0000218 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U))
Paul Robinson2bc38732017-05-02 21:40:47 +0000219 return false;
Paul Robinson0a227092018-02-05 20:43:15 +0000220 IncludeDirectories.push_back(Value);
Paul Robinson2bc38732017-05-02 21:40:47 +0000221 break;
222 default:
Paul Robinson75c068c2017-06-26 18:43:01 +0000223 if (!Value.skipValue(DebugLineData, OffsetPtr, FormParams))
Paul Robinson2bc38732017-05-02 21:40:47 +0000224 return false;
225 }
226 }
227 }
228
229 // Get the file entry description.
230 ContentDescriptors FileDescriptors =
Scott Linder16c7bda2018-02-23 23:01:06 +0000231 parseV5EntryFormat(DebugLineData, OffsetPtr, EndPrologueOffset,
232 &ContentTypes);
Paul Robinson2bc38732017-05-02 21:40:47 +0000233 if (FileDescriptors.empty())
234 return false;
235
236 // Get the file entries, according to the format described above.
237 int FileEntryCount = DebugLineData.getU8(OffsetPtr);
238 for (int I = 0; I != FileEntryCount; ++I) {
239 if (*OffsetPtr >= EndPrologueOffset)
240 return false;
241 DWARFDebugLine::FileNameEntry FileEntry;
242 for (auto Descriptor : FileDescriptors) {
243 DWARFFormValue Value(Descriptor.Form);
Paul Robinsonbf750c82018-01-29 20:57:43 +0000244 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U))
Paul Robinson2bc38732017-05-02 21:40:47 +0000245 return false;
246 switch (Descriptor.Type) {
247 case DW_LNCT_path:
Paul Robinson0a227092018-02-05 20:43:15 +0000248 FileEntry.Name = Value;
Paul Robinson2bc38732017-05-02 21:40:47 +0000249 break;
Scott Linder16c7bda2018-02-23 23:01:06 +0000250 case DW_LNCT_LLVM_source:
251 FileEntry.Source = Value;
252 break;
Paul Robinson2bc38732017-05-02 21:40:47 +0000253 case DW_LNCT_directory_index:
254 FileEntry.DirIdx = Value.getAsUnsignedConstant().getValue();
255 break;
256 case DW_LNCT_timestamp:
257 FileEntry.ModTime = Value.getAsUnsignedConstant().getValue();
258 break;
259 case DW_LNCT_size:
260 FileEntry.Length = Value.getAsUnsignedConstant().getValue();
261 break;
Paul Robinsona06f8dc2017-12-18 19:08:35 +0000262 case DW_LNCT_MD5:
263 assert(Value.getAsBlock().getValue().size() == 16);
264 std::uninitialized_copy_n(Value.getAsBlock().getValue().begin(), 16,
265 FileEntry.Checksum.Bytes.begin());
266 break;
Paul Robinson2bc38732017-05-02 21:40:47 +0000267 default:
268 break;
269 }
270 }
271 FileNames.push_back(FileEntry);
272 }
273 return true;
274}
275
James Hendersona3acf992018-05-10 10:51:33 +0000276Error DWARFDebugLine::Prologue::parse(const DWARFDataExtractor &DebugLineData,
277 uint32_t *OffsetPtr,
278 const DWARFContext &Ctx,
279 const DWARFUnit *U) {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000280 const uint64_t PrologueOffset = *OffsetPtr;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000281
282 clear();
Paul Robinson9d4eb692017-05-01 23:27:55 +0000283 TotalLength = DebugLineData.getU32(OffsetPtr);
Ed Maste6d0bee52015-05-28 15:38:17 +0000284 if (TotalLength == UINT32_MAX) {
Paul Robinson75c068c2017-06-26 18:43:01 +0000285 FormParams.Format = dwarf::DWARF64;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000286 TotalLength = DebugLineData.getU64(OffsetPtr);
Paul Robinson75c068c2017-06-26 18:43:01 +0000287 } else if (TotalLength >= 0xffffff00) {
Victor Leschukcba595d2018-08-20 09:59:08 +0000288 return createStringError(errc::invalid_argument,
James Hendersona3acf992018-05-10 10:51:33 +0000289 "parsing line table prologue at offset 0x%8.8" PRIx64
290 " unsupported reserved unit length found of value 0x%8.8" PRIx64,
291 PrologueOffset, TotalLength);
Ed Maste6d0bee52015-05-28 15:38:17 +0000292 }
Paul Robinson75c068c2017-06-26 18:43:01 +0000293 FormParams.Version = DebugLineData.getU16(OffsetPtr);
294 if (getVersion() < 2)
Victor Leschukcba595d2018-08-20 09:59:08 +0000295 return createStringError(errc::not_supported,
296 "parsing line table prologue at offset 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000297 " found unsupported version 0x%2.2" PRIx16,
298 PrologueOffset, getVersion());
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000299
Paul Robinson75c068c2017-06-26 18:43:01 +0000300 if (getVersion() >= 5) {
301 FormParams.AddrSize = DebugLineData.getU8(OffsetPtr);
Paul Robinson63811a42017-11-22 15:33:17 +0000302 assert((DebugLineData.getAddressSize() == 0 ||
303 DebugLineData.getAddressSize() == getAddressSize()) &&
Paul Robinson75c068c2017-06-26 18:43:01 +0000304 "Line table header and data extractor disagree");
Paul Robinson2bc38732017-05-02 21:40:47 +0000305 SegSelectorSize = DebugLineData.getU8(OffsetPtr);
306 }
307
Paul Robinson9d4eb692017-05-01 23:27:55 +0000308 PrologueLength = DebugLineData.getUnsigned(OffsetPtr, sizeofPrologueLength());
309 const uint64_t EndPrologueOffset = PrologueLength + *OffsetPtr;
310 MinInstLength = DebugLineData.getU8(OffsetPtr);
Paul Robinson75c068c2017-06-26 18:43:01 +0000311 if (getVersion() >= 4)
Paul Robinson9d4eb692017-05-01 23:27:55 +0000312 MaxOpsPerInst = DebugLineData.getU8(OffsetPtr);
313 DefaultIsStmt = DebugLineData.getU8(OffsetPtr);
314 LineBase = DebugLineData.getU8(OffsetPtr);
315 LineRange = DebugLineData.getU8(OffsetPtr);
316 OpcodeBase = DebugLineData.getU8(OffsetPtr);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000317
318 StandardOpcodeLengths.reserve(OpcodeBase - 1);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000319 for (uint32_t I = 1; I < OpcodeBase; ++I) {
320 uint8_t OpLen = DebugLineData.getU8(OffsetPtr);
321 StandardOpcodeLengths.push_back(OpLen);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000322 }
323
Paul Robinson75c068c2017-06-26 18:43:01 +0000324 if (getVersion() >= 5) {
Paul Robinson2bc38732017-05-02 21:40:47 +0000325 if (!parseV5DirFileTables(DebugLineData, OffsetPtr, EndPrologueOffset,
Scott Linder16c7bda2018-02-23 23:01:06 +0000326 FormParams, Ctx, U, ContentTypes,
327 IncludeDirectories, FileNames)) {
Victor Leschukcba595d2018-08-20 09:59:08 +0000328 return createStringError(errc::invalid_argument,
Jonas Devlieghere84e99262018-04-14 22:07:23 +0000329 "parsing line table prologue at 0x%8.8" PRIx64
330 " found an invalid directory or file table description at"
James Hendersona3acf992018-05-10 10:51:33 +0000331 " 0x%8.8" PRIx64,
Jonas Devlieghere84e99262018-04-14 22:07:23 +0000332 PrologueOffset, (uint64_t)*OffsetPtr);
Paul Robinson2bc38732017-05-02 21:40:47 +0000333 }
334 } else
335 parseV2DirFileTables(DebugLineData, OffsetPtr, EndPrologueOffset,
Scott Linder16c7bda2018-02-23 23:01:06 +0000336 ContentTypes, IncludeDirectories, FileNames);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000337
James Hendersona3acf992018-05-10 10:51:33 +0000338 if (*OffsetPtr != EndPrologueOffset)
Victor Leschukcba595d2018-08-20 09:59:08 +0000339 return createStringError(errc::invalid_argument,
340 "parsing line table prologue at 0x%8.8" PRIx64
James Hendersona3acf992018-05-10 10:51:33 +0000341 " should have ended at 0x%8.8" PRIx64
342 " but it ended at 0x%8.8" PRIx64,
343 PrologueOffset, EndPrologueOffset, (uint64_t)*OffsetPtr);
344 return Error::success();
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000345}
346
Paul Robinson9d4eb692017-05-01 23:27:55 +0000347DWARFDebugLine::Row::Row(bool DefaultIsStmt) { reset(DefaultIsStmt); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000348
Benjamin Kramer5acab502011-09-15 02:12:05 +0000349void DWARFDebugLine::Row::postAppend() {
350 BasicBlock = false;
351 PrologueEnd = false;
352 EpilogueBegin = false;
353}
354
Paul Robinson9d4eb692017-05-01 23:27:55 +0000355void DWARFDebugLine::Row::reset(bool DefaultIsStmt) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000356 Address = 0;
357 Line = 1;
358 Column = 0;
359 File = 1;
360 Isa = 0;
Diego Novillo5b5cf502014-02-14 19:27:53 +0000361 Discriminator = 0;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000362 IsStmt = DefaultIsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000363 BasicBlock = false;
364 EndSequence = false;
365 PrologueEnd = false;
366 EpilogueBegin = false;
367}
368
Greg Clayton67070462017-05-02 22:48:52 +0000369void DWARFDebugLine::Row::dumpTableHeader(raw_ostream &OS) {
370 OS << "Address Line Column File ISA Discriminator Flags\n"
371 << "------------------ ------ ------ ------ --- ------------- "
372 "-------------\n";
373}
374
Benjamin Kramer5acab502011-09-15 02:12:05 +0000375void DWARFDebugLine::Row::dump(raw_ostream &OS) const {
Benjamin Kramerf3da5292011-11-05 08:57:40 +0000376 OS << format("0x%16.16" PRIx64 " %6u %6u", Address, Line, Column)
Diego Novillo5b5cf502014-02-14 19:27:53 +0000377 << format(" %6u %3u %13u ", File, Isa, Discriminator)
Dehao Chen1b54fce2016-04-28 22:09:37 +0000378 << (IsStmt ? " is_stmt" : "") << (BasicBlock ? " basic_block" : "")
Benjamin Kramer5acab502011-09-15 02:12:05 +0000379 << (PrologueEnd ? " prologue_end" : "")
380 << (EpilogueBegin ? " epilogue_begin" : "")
Dehao Chen1b54fce2016-04-28 22:09:37 +0000381 << (EndSequence ? " end_sequence" : "") << '\n';
Benjamin Kramer5acab502011-09-15 02:12:05 +0000382}
383
Dehao Chen1b54fce2016-04-28 22:09:37 +0000384DWARFDebugLine::Sequence::Sequence() { reset(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000385
386void DWARFDebugLine::Sequence::reset() {
387 LowPC = 0;
388 HighPC = 0;
389 FirstRowIndex = 0;
390 LastRowIndex = 0;
391 Empty = true;
392}
393
Dehao Chen1b54fce2016-04-28 22:09:37 +0000394DWARFDebugLine::LineTable::LineTable() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000395
Paul Robinson0a227092018-02-05 20:43:15 +0000396void DWARFDebugLine::LineTable::dump(raw_ostream &OS,
397 DIDumpOptions DumpOptions) const {
398 Prologue.dump(OS, DumpOptions);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000399 OS << '\n';
400
401 if (!Rows.empty()) {
Greg Clayton67070462017-05-02 22:48:52 +0000402 Row::dumpTableHeader(OS);
Alexey Samsonov1eabf982014-03-13 07:52:54 +0000403 for (const Row &R : Rows) {
404 R.dump(OS);
405 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000406 }
407}
408
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000409void DWARFDebugLine::LineTable::clear() {
410 Prologue.clear();
411 Rows.clear();
412 Sequences.clear();
413}
414
Alexey Samsonov110d5952014-04-30 00:09:19 +0000415DWARFDebugLine::ParsingState::ParsingState(struct LineTable *LT)
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +0000416 : LineTable(LT) {
Alexey Samsonov110d5952014-04-30 00:09:19 +0000417 resetRowAndSequence();
418}
Nick Lewycky4d044922011-09-15 03:41:51 +0000419
Alexey Samsonov110d5952014-04-30 00:09:19 +0000420void DWARFDebugLine::ParsingState::resetRowAndSequence() {
421 Row.reset(LineTable->Prologue.DefaultIsStmt);
422 Sequence.reset();
423}
424
Paul Robinson9d4eb692017-05-01 23:27:55 +0000425void DWARFDebugLine::ParsingState::appendRowToMatrix(uint32_t Offset) {
Alexey Samsonov110d5952014-04-30 00:09:19 +0000426 if (Sequence.Empty) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000427 // Record the beginning of instruction sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000428 Sequence.Empty = false;
429 Sequence.LowPC = Row.Address;
430 Sequence.FirstRowIndex = RowNumber;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000431 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000432 ++RowNumber;
433 LineTable->appendRow(Row);
434 if (Row.EndSequence) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000435 // Record the end of instruction sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000436 Sequence.HighPC = Row.Address;
437 Sequence.LastRowIndex = RowNumber;
438 if (Sequence.isValid())
439 LineTable->appendSequence(Sequence);
440 Sequence.reset();
Alexey Samsonov947228c2012-08-07 11:46:57 +0000441 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000442 Row.postAppend();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000443}
444
Benjamin Kramer5acab502011-09-15 02:12:05 +0000445const DWARFDebugLine::LineTable *
Paul Robinson9d4eb692017-05-01 23:27:55 +0000446DWARFDebugLine::getLineTable(uint32_t Offset) const {
447 LineTableConstIter Pos = LineTableMap.find(Offset);
448 if (Pos != LineTableMap.end())
449 return &Pos->second;
Craig Topper2617dcc2014-04-15 06:32:26 +0000450 return nullptr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000451}
452
James Hendersona3acf992018-05-10 10:51:33 +0000453Expected<const DWARFDebugLine::LineTable *> DWARFDebugLine::getOrParseLineTable(
454 DWARFDataExtractor &DebugLineData, uint32_t Offset, const DWARFContext &Ctx,
James Henderson004b7292018-05-21 15:30:54 +0000455 const DWARFUnit *U, std::function<void(Error)> RecoverableErrorCallback) {
James Henderson66702622018-03-08 10:53:34 +0000456 if (!DebugLineData.isValidOffset(Offset))
Victor Leschukcba595d2018-08-20 09:59:08 +0000457 return createStringError(errc::invalid_argument, "offset 0x%8.8" PRIx32
James Hendersona3acf992018-05-10 10:51:33 +0000458 " is not a valid debug line section offset",
459 Offset);
James Henderson66702622018-03-08 10:53:34 +0000460
Paul Robinson9d4eb692017-05-01 23:27:55 +0000461 std::pair<LineTableIter, bool> Pos =
462 LineTableMap.insert(LineTableMapTy::value_type(Offset, LineTable()));
463 LineTable *LT = &Pos.first->second;
464 if (Pos.second) {
James Henderson004b7292018-05-21 15:30:54 +0000465 if (Error Err =
466 LT->parse(DebugLineData, &Offset, Ctx, U, RecoverableErrorCallback))
James Hendersona3acf992018-05-10 10:51:33 +0000467 return std::move(Err);
468 return LT;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000469 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000470 return LT;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000471}
472
James Hendersona3acf992018-05-10 10:51:33 +0000473Error DWARFDebugLine::LineTable::parse(
474 DWARFDataExtractor &DebugLineData, uint32_t *OffsetPtr,
475 const DWARFContext &Ctx, const DWARFUnit *U,
James Henderson004b7292018-05-21 15:30:54 +0000476 std::function<void(Error)> RecoverableErrorCallback, raw_ostream *OS) {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000477 const uint32_t DebugLineOffset = *OffsetPtr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000478
Alexey Samsonov110d5952014-04-30 00:09:19 +0000479 clear();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000480
James Hendersona3acf992018-05-10 10:51:33 +0000481 Error PrologueErr = Prologue.parse(DebugLineData, OffsetPtr, Ctx, U);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000482
Paul Robinson0a227092018-02-05 20:43:15 +0000483 if (OS) {
484 // The presence of OS signals verbose dumping.
485 DIDumpOptions DumpOptions;
486 DumpOptions.Verbose = true;
487 Prologue.dump(*OS, DumpOptions);
488 }
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000489
James Hendersona3acf992018-05-10 10:51:33 +0000490 if (PrologueErr)
491 return PrologueErr;
492
Paul Robinson9d4eb692017-05-01 23:27:55 +0000493 const uint32_t EndOffset =
494 DebugLineOffset + Prologue.TotalLength + Prologue.sizeofTotalLength();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000495
Paul Robinson511b54c2017-11-22 15:48:30 +0000496 // See if we should tell the data extractor the address size.
497 if (DebugLineData.getAddressSize() == 0)
498 DebugLineData.setAddressSize(Prologue.getAddressSize());
499 else
500 assert(Prologue.getAddressSize() == 0 ||
501 Prologue.getAddressSize() == DebugLineData.getAddressSize());
502
Alexey Samsonov110d5952014-04-30 00:09:19 +0000503 ParsingState State(this);
Benjamin Kramer112ec172011-09-15 21:59:13 +0000504
Paul Robinson9d4eb692017-05-01 23:27:55 +0000505 while (*OffsetPtr < EndOffset) {
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000506 if (OS)
507 *OS << format("0x%08.08" PRIx32 ": ", *OffsetPtr);
508
Paul Robinson9d4eb692017-05-01 23:27:55 +0000509 uint8_t Opcode = DebugLineData.getU8(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000510
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000511 if (OS)
512 *OS << format("%02.02" PRIx8 " ", Opcode);
513
Paul Robinson9d4eb692017-05-01 23:27:55 +0000514 if (Opcode == 0) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000515 // Extended Opcodes always start with a zero opcode followed by
516 // a uleb128 length so you can skip ones you don't know about
Paul Robinson9d4eb692017-05-01 23:27:55 +0000517 uint64_t Len = DebugLineData.getULEB128(OffsetPtr);
Paul Robinsone0833342017-11-22 15:14:49 +0000518 uint32_t ExtOffset = *OffsetPtr;
519
520 // Tolerate zero-length; assume length is correct and soldier on.
521 if (Len == 0) {
522 if (OS)
523 *OS << "Badly formed extended line op (length 0)\n";
524 continue;
525 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000526
Paul Robinson9d4eb692017-05-01 23:27:55 +0000527 uint8_t SubOpcode = DebugLineData.getU8(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000528 if (OS)
529 *OS << LNExtendedString(SubOpcode);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000530 switch (SubOpcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000531 case DW_LNE_end_sequence:
532 // Set the end_sequence register of the state machine to true and
533 // append a row to the matrix using the current values of the
534 // state-machine registers. Then reset the registers to the initial
535 // values specified above. Every statement program sequence must end
536 // with a DW_LNE_end_sequence instruction which creates a row whose
537 // address is that of the byte after the last target machine instruction
538 // of the sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000539 State.Row.EndSequence = true;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000540 State.appendRowToMatrix(*OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000541 if (OS) {
542 *OS << "\n";
543 OS->indent(12);
544 State.Row.dump(*OS);
545 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000546 State.resetRowAndSequence();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000547 break;
548
549 case DW_LNE_set_address:
550 // Takes a single relocatable address as an operand. The size of the
551 // operand is the size appropriate to hold an address on the target
552 // machine. Set the address register to the value given by the
553 // relocatable address. All of the other statement program opcodes
554 // that affect the address register add a delta to it. This instruction
555 // stores a relocatable value into it instead.
Paul Robinson511b54c2017-11-22 15:48:30 +0000556 //
557 // Make sure the extractor knows the address size. If not, infer it
558 // from the size of the operand.
559 if (DebugLineData.getAddressSize() == 0)
560 DebugLineData.setAddressSize(Len - 1);
Paul Robinson79474682018-03-22 19:37:56 +0000561 else if (DebugLineData.getAddressSize() != Len - 1) {
Victor Leschukcba595d2018-08-20 09:59:08 +0000562 return createStringError(errc::invalid_argument,
563 "mismatching address size at offset 0x%8.8" PRIx32
James Hendersona3acf992018-05-10 10:51:33 +0000564 " expected 0x%2.2" PRIx8 " found 0x%2.2" PRIx64,
565 ExtOffset, DebugLineData.getAddressSize(),
566 Len - 1);
Paul Robinson79474682018-03-22 19:37:56 +0000567 }
Paul Robinson17536b92017-06-29 16:52:08 +0000568 State.Row.Address = DebugLineData.getRelocatedAddress(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000569 if (OS)
570 *OS << format(" (0x%16.16" PRIx64 ")", State.Row.Address);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000571 break;
572
573 case DW_LNE_define_file:
574 // Takes 4 arguments. The first is a null terminated string containing
575 // a source file name. The second is an unsigned LEB128 number
576 // representing the directory index of the directory in which the file
577 // was found. The third is an unsigned LEB128 number representing the
578 // time of last modification of the file. The fourth is an unsigned
579 // LEB128 number representing the length in bytes of the file. The time
580 // and length fields may contain LEB128(0) if the information is not
581 // available.
582 //
583 // The directory index represents an entry in the include_directories
584 // section of the statement program prologue. The index is LEB128(0)
585 // if the file was found in the current directory of the compilation,
586 // LEB128(1) if it was found in the first directory in the
587 // include_directories section, and so on. The directory index is
588 // ignored for file names that represent full path names.
589 //
590 // The files are numbered, starting at 1, in the order in which they
591 // appear; the names in the prologue come before names defined by
592 // the DW_LNE_define_file instruction. These numbers are used in the
593 // the file register of the state machine.
594 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000595 FileNameEntry FileEntry;
Paul Robinson0a227092018-02-05 20:43:15 +0000596 const char *Name = DebugLineData.getCStr(OffsetPtr);
Jonas Devliegherebb111152019-02-27 00:58:09 +0000597 FileEntry.Name =
598 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000599 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
600 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
601 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
602 Prologue.FileNames.push_back(FileEntry);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000603 if (OS)
Paul Robinson0a227092018-02-05 20:43:15 +0000604 *OS << " (" << Name << ", dir=" << FileEntry.DirIdx << ", mod_time="
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000605 << format("(0x%16.16" PRIx64 ")", FileEntry.ModTime)
606 << ", length=" << FileEntry.Length << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000607 }
608 break;
609
Diego Novillo5b5cf502014-02-14 19:27:53 +0000610 case DW_LNE_set_discriminator:
Paul Robinson9d4eb692017-05-01 23:27:55 +0000611 State.Row.Discriminator = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000612 if (OS)
613 *OS << " (" << State.Row.Discriminator << ")";
Diego Novillo5b5cf502014-02-14 19:27:53 +0000614 break;
615
Benjamin Kramer5acab502011-09-15 02:12:05 +0000616 default:
Paul Robinsone0833342017-11-22 15:14:49 +0000617 if (OS)
618 *OS << format("Unrecognized extended op 0x%02.02" PRIx8, SubOpcode)
619 << format(" length %" PRIx64, Len);
620 // Len doesn't include the zero opcode byte or the length itself, but
621 // it does include the sub_opcode, so we have to adjust for that.
622 (*OffsetPtr) += Len - 1;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000623 break;
624 }
Paul Robinsone0833342017-11-22 15:14:49 +0000625 // Make sure the stated and parsed lengths are the same.
626 // Otherwise we have an unparseable line-number program.
James Hendersona3acf992018-05-10 10:51:33 +0000627 if (*OffsetPtr - ExtOffset != Len)
Victor Leschukcba595d2018-08-20 09:59:08 +0000628 return createStringError(errc::illegal_byte_sequence,
629 "unexpected line op length at offset 0x%8.8" PRIx32
James Hendersona3acf992018-05-10 10:51:33 +0000630 " expected 0x%2.2" PRIx64 " found 0x%2.2" PRIx32,
631 ExtOffset, Len, *OffsetPtr - ExtOffset);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000632 } else if (Opcode < Prologue.OpcodeBase) {
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000633 if (OS)
634 *OS << LNStandardString(Opcode);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000635 switch (Opcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000636 // Standard Opcodes
637 case DW_LNS_copy:
638 // Takes no arguments. Append a row to the matrix using the
639 // current values of the state-machine registers. Then set
640 // the basic_block register to false.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000641 State.appendRowToMatrix(*OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000642 if (OS) {
643 *OS << "\n";
644 OS->indent(12);
645 State.Row.dump(*OS);
646 *OS << "\n";
647 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000648 break;
649
650 case DW_LNS_advance_pc:
651 // Takes a single unsigned LEB128 operand, multiplies it by the
652 // min_inst_length field of the prologue, and adds the
653 // result to the address register of the state machine.
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000654 {
655 uint64_t AddrOffset =
656 DebugLineData.getULEB128(OffsetPtr) * Prologue.MinInstLength;
657 State.Row.Address += AddrOffset;
658 if (OS)
659 *OS << " (" << AddrOffset << ")";
660 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000661 break;
662
663 case DW_LNS_advance_line:
664 // Takes a single signed LEB128 operand and adds that value to
665 // the line register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000666 State.Row.Line += DebugLineData.getSLEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000667 if (OS)
668 *OS << " (" << State.Row.Line << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000669 break;
670
671 case DW_LNS_set_file:
672 // Takes a single unsigned LEB128 operand and stores it in the file
673 // register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000674 State.Row.File = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000675 if (OS)
676 *OS << " (" << State.Row.File << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000677 break;
678
679 case DW_LNS_set_column:
680 // Takes a single unsigned LEB128 operand and stores it in the
681 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000682 State.Row.Column = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000683 if (OS)
684 *OS << " (" << State.Row.Column << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000685 break;
686
687 case DW_LNS_negate_stmt:
688 // Takes no arguments. Set the is_stmt register of the state
689 // machine to the logical negation of its current value.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000690 State.Row.IsStmt = !State.Row.IsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000691 break;
692
693 case DW_LNS_set_basic_block:
694 // Takes no arguments. Set the basic_block register of the
695 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000696 State.Row.BasicBlock = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000697 break;
698
699 case DW_LNS_const_add_pc:
700 // Takes no arguments. Add to the address register of the state
701 // machine the address increment value corresponding to special
702 // opcode 255. The motivation for DW_LNS_const_add_pc is this:
703 // when the statement program needs to advance the address by a
704 // small amount, it can use a single special opcode, which occupies
705 // a single byte. When it needs to advance the address by up to
706 // twice the range of the last special opcode, it can use
707 // DW_LNS_const_add_pc followed by a special opcode, for a total
708 // of two bytes. Only if it needs to advance the address by more
709 // than twice that range will it need to use both DW_LNS_advance_pc
710 // and a special opcode, requiring three or more bytes.
711 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000712 uint8_t AdjustOpcode = 255 - Prologue.OpcodeBase;
713 uint64_t AddrOffset =
714 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
715 State.Row.Address += AddrOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000716 if (OS)
717 *OS
718 << format(" (0x%16.16" PRIx64 ")", AddrOffset);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000719 }
720 break;
721
722 case DW_LNS_fixed_advance_pc:
723 // Takes a single uhalf operand. Add to the address register of
724 // the state machine the value of the (unencoded) operand. This
725 // is the only extended opcode that takes an argument that is not
726 // a variable length number. The motivation for DW_LNS_fixed_advance_pc
727 // is this: existing assemblers cannot emit DW_LNS_advance_pc or
728 // special opcodes because they cannot encode LEB128 numbers or
729 // judge when the computation of a special opcode overflows and
730 // requires the use of DW_LNS_advance_pc. Such assemblers, however,
731 // can use DW_LNS_fixed_advance_pc instead, sacrificing compression.
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000732 {
733 uint16_t PCOffset = DebugLineData.getU16(OffsetPtr);
734 State.Row.Address += PCOffset;
735 if (OS)
736 *OS
737 << format(" (0x%16.16" PRIx64 ")", PCOffset);
738 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000739 break;
740
741 case DW_LNS_set_prologue_end:
742 // Takes no arguments. Set the prologue_end register of the
743 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000744 State.Row.PrologueEnd = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000745 break;
746
747 case DW_LNS_set_epilogue_begin:
748 // Takes no arguments. Set the basic_block register of the
749 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000750 State.Row.EpilogueBegin = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000751 break;
752
753 case DW_LNS_set_isa:
754 // Takes a single unsigned LEB128 operand and stores it in the
755 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000756 State.Row.Isa = DebugLineData.getULEB128(OffsetPtr);
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000757 if (OS)
758 *OS << " (" << State.Row.Isa << ")";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000759 break;
760
761 default:
762 // Handle any unknown standard opcodes here. We know the lengths
763 // of such opcodes because they are specified in the prologue
764 // as a multiple of LEB128 operands for each opcode.
765 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000766 assert(Opcode - 1U < Prologue.StandardOpcodeLengths.size());
767 uint8_t OpcodeLength = Prologue.StandardOpcodeLengths[Opcode - 1];
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000768 for (uint8_t I = 0; I < OpcodeLength; ++I) {
769 uint64_t Value = DebugLineData.getULEB128(OffsetPtr);
770 if (OS)
771 *OS << format("Skipping ULEB128 value: 0x%16.16" PRIx64 ")\n",
772 Value);
773 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000774 }
775 break;
776 }
777 } else {
778 // Special Opcodes
779
780 // A special opcode value is chosen based on the amount that needs
781 // to be added to the line and address registers. The maximum line
782 // increment for a special opcode is the value of the line_base
783 // field in the header, plus the value of the line_range field,
784 // minus 1 (line base + line range - 1). If the desired line
785 // increment is greater than the maximum line increment, a standard
NAKAMURA Takumif9959852011-10-08 11:22:47 +0000786 // opcode must be used instead of a special opcode. The "address
787 // advance" is calculated by dividing the desired address increment
Benjamin Kramer5acab502011-09-15 02:12:05 +0000788 // by the minimum_instruction_length field from the header. The
789 // special opcode is then calculated using the following formula:
790 //
791 // opcode = (desired line increment - line_base) +
792 // (line_range * address advance) + opcode_base
793 //
794 // If the resulting opcode is greater than 255, a standard opcode
795 // must be used instead.
796 //
797 // To decode a special opcode, subtract the opcode_base from the
798 // opcode itself to give the adjusted opcode. The amount to
799 // increment the address register is the result of the adjusted
800 // opcode divided by the line_range multiplied by the
801 // minimum_instruction_length field from the header. That is:
802 //
803 // address increment = (adjusted opcode / line_range) *
804 // minimum_instruction_length
805 //
806 // The amount to increment the line register is the line_base plus
807 // the result of the adjusted opcode modulo the line_range. That is:
808 //
809 // line increment = line_base + (adjusted opcode % line_range)
810
Paul Robinson9d4eb692017-05-01 23:27:55 +0000811 uint8_t AdjustOpcode = Opcode - Prologue.OpcodeBase;
812 uint64_t AddrOffset =
813 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
814 int32_t LineOffset =
815 Prologue.LineBase + (AdjustOpcode % Prologue.LineRange);
816 State.Row.Line += LineOffset;
817 State.Row.Address += AddrOffset;
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000818
819 if (OS) {
James Hendersonb6b5b1a2019-02-06 10:31:50 +0000820 *OS << "address += " << AddrOffset << ", line += " << LineOffset
821 << "\n";
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000822 OS->indent(12);
823 State.Row.dump(*OS);
824 }
825
Paul Robinson9d4eb692017-05-01 23:27:55 +0000826 State.appendRowToMatrix(*OffsetPtr);
Dehao Chen1b54fce2016-04-28 22:09:37 +0000827 // Reset discriminator to 0.
828 State.Row.Discriminator = 0;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000829 }
Jonas Devlieghere26f9a0c2017-09-21 20:15:30 +0000830 if(OS)
831 *OS << "\n";
Benjamin Kramer5acab502011-09-15 02:12:05 +0000832 }
833
Jonas Devlieghere84e99262018-04-14 22:07:23 +0000834 if (!State.Sequence.Empty)
James Henderson004b7292018-05-21 15:30:54 +0000835 RecoverableErrorCallback(
Victor Leschukcba595d2018-08-20 09:59:08 +0000836 createStringError(errc::illegal_byte_sequence,
837 "last sequence in debug line table is not terminated!"));
Alexey Samsonov110d5952014-04-30 00:09:19 +0000838
839 // Sort all sequences so that address lookup will work faster.
840 if (!Sequences.empty()) {
Fangrui Song0cac7262018-09-27 02:13:45 +0000841 llvm::sort(Sequences, Sequence::orderByLowPC);
Alexey Samsonov110d5952014-04-30 00:09:19 +0000842 // Note: actually, instruction address ranges of sequences should not
843 // overlap (in shared objects and executables). If they do, the address
844 // lookup would still work, though, but result would be ambiguous.
845 // We don't report warning in this case. For example,
846 // sometimes .so compiled from multiple object files contains a few
847 // rudimentary sequences for address ranges [0x0, 0xsomething).
848 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000849
James Hendersona3acf992018-05-10 10:51:33 +0000850 return Error::success();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000851}
852
Keno Fischerc2c60182015-05-31 23:37:04 +0000853uint32_t
Paul Robinson9d4eb692017-05-01 23:27:55 +0000854DWARFDebugLine::LineTable::findRowInSeq(const DWARFDebugLine::Sequence &Seq,
855 uint64_t Address) const {
856 if (!Seq.containsPC(Address))
Keno Fischerc2c60182015-05-31 23:37:04 +0000857 return UnknownRowIndex;
858 // Search for instruction address in the rows describing the sequence.
859 // Rows are stored in a vector, so we may use arithmetical operations with
860 // iterators.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000861 DWARFDebugLine::Row Row;
862 Row.Address = Address;
863 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex;
864 RowIter LastRow = Rows.begin() + Seq.LastRowIndex;
865 LineTable::RowIter RowPos = std::lower_bound(
866 FirstRow, LastRow, Row, DWARFDebugLine::Row::orderByAddress);
867 if (RowPos == LastRow) {
868 return Seq.LastRowIndex - 1;
Keno Fischerc2c60182015-05-31 23:37:04 +0000869 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000870 uint32_t Index = Seq.FirstRowIndex + (RowPos - FirstRow);
871 if (RowPos->Address > Address) {
872 if (RowPos == FirstRow)
Keno Fischerc2c60182015-05-31 23:37:04 +0000873 return UnknownRowIndex;
874 else
Paul Robinson9d4eb692017-05-01 23:27:55 +0000875 Index--;
Keno Fischerc2c60182015-05-31 23:37:04 +0000876 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000877 return Index;
Keno Fischerc2c60182015-05-31 23:37:04 +0000878}
879
Paul Robinson9d4eb692017-05-01 23:27:55 +0000880uint32_t DWARFDebugLine::LineTable::lookupAddress(uint64_t Address) const {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000881 if (Sequences.empty())
Keno Fischerc2c60182015-05-31 23:37:04 +0000882 return UnknownRowIndex;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000883 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000884 DWARFDebugLine::Sequence Sequence;
885 Sequence.LowPC = Address;
886 SequenceIter FirstSeq = Sequences.begin();
887 SequenceIter LastSeq = Sequences.end();
888 SequenceIter SeqPos = std::lower_bound(
889 FirstSeq, LastSeq, Sequence, DWARFDebugLine::Sequence::orderByLowPC);
890 DWARFDebugLine::Sequence FoundSeq;
891 if (SeqPos == LastSeq) {
892 FoundSeq = Sequences.back();
893 } else if (SeqPos->LowPC == Address) {
894 FoundSeq = *SeqPos;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000895 } else {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000896 if (SeqPos == FirstSeq)
Keno Fischerc2c60182015-05-31 23:37:04 +0000897 return UnknownRowIndex;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000898 FoundSeq = *(SeqPos - 1);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000899 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000900 return findRowInSeq(FoundSeq, Address);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000901}
Alexey Samsonov45be7932012-08-30 07:49:50 +0000902
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000903bool DWARFDebugLine::LineTable::lookupAddressRange(
Paul Robinson9d4eb692017-05-01 23:27:55 +0000904 uint64_t Address, uint64_t Size, std::vector<uint32_t> &Result) const {
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000905 if (Sequences.empty())
906 return false;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000907 uint64_t EndAddr = Address + Size;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000908 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000909 DWARFDebugLine::Sequence Sequence;
910 Sequence.LowPC = Address;
911 SequenceIter FirstSeq = Sequences.begin();
912 SequenceIter LastSeq = Sequences.end();
913 SequenceIter SeqPos = std::lower_bound(
914 FirstSeq, LastSeq, Sequence, DWARFDebugLine::Sequence::orderByLowPC);
915 if (SeqPos == LastSeq || SeqPos->LowPC != Address) {
916 if (SeqPos == FirstSeq)
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000917 return false;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000918 SeqPos--;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000919 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000920 if (!SeqPos->containsPC(Address))
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000921 return false;
922
Paul Robinson9d4eb692017-05-01 23:27:55 +0000923 SequenceIter StartPos = SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000924
925 // Add the rows from the first sequence to the vector, starting with the
926 // index we just calculated
927
Paul Robinson9d4eb692017-05-01 23:27:55 +0000928 while (SeqPos != LastSeq && SeqPos->LowPC < EndAddr) {
929 const DWARFDebugLine::Sequence &CurSeq = *SeqPos;
Keno Fischerc2c60182015-05-31 23:37:04 +0000930 // For the first sequence, we need to find which row in the sequence is the
931 // first in our range.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000932 uint32_t FirstRowIndex = CurSeq.FirstRowIndex;
933 if (SeqPos == StartPos)
934 FirstRowIndex = findRowInSeq(CurSeq, Address);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000935
Keno Fischerc2c60182015-05-31 23:37:04 +0000936 // Figure out the last row in the range.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000937 uint32_t LastRowIndex = findRowInSeq(CurSeq, EndAddr - 1);
938 if (LastRowIndex == UnknownRowIndex)
939 LastRowIndex = CurSeq.LastRowIndex - 1;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000940
Paul Robinson9d4eb692017-05-01 23:27:55 +0000941 assert(FirstRowIndex != UnknownRowIndex);
942 assert(LastRowIndex != UnknownRowIndex);
Keno Fischerc2c60182015-05-31 23:37:04 +0000943
Paul Robinson9d4eb692017-05-01 23:27:55 +0000944 for (uint32_t I = FirstRowIndex; I <= LastRowIndex; ++I) {
945 Result.push_back(I);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000946 }
947
Paul Robinson9d4eb692017-05-01 23:27:55 +0000948 ++SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000949 }
NAKAMURA Takumi4b86cdb2013-01-26 01:45:06 +0000950
951 return true;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000952}
953
Paul Robinson9d4eb692017-05-01 23:27:55 +0000954bool DWARFDebugLine::LineTable::hasFileAtIndex(uint64_t FileIndex) const {
Pete Cooperb2ba7762016-07-22 01:41:32 +0000955 return FileIndex != 0 && FileIndex <= Prologue.FileNames.size();
956}
957
Scott Linder16c7bda2018-02-23 23:01:06 +0000958Optional<StringRef> DWARFDebugLine::LineTable::getSourceByIndex(uint64_t FileIndex,
959 FileLineInfoKind Kind) const {
960 if (Kind == FileLineInfoKind::None || !hasFileAtIndex(FileIndex))
961 return None;
962 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
963 if (Optional<const char *> source = Entry.Source.getAsCString())
964 return StringRef(*source);
965 return None;
966}
967
Eugene Zemtsov82d60d62018-03-13 17:54:29 +0000968static bool isPathAbsoluteOnWindowsOrPosix(const Twine &Path) {
969 // Debug info can contain paths from any OS, not necessarily
970 // an OS we're currently running on. Moreover different compilation units can
971 // be compiled on different operating systems and linked together later.
972 return sys::path::is_absolute(Path, sys::path::Style::posix) ||
973 sys::path::is_absolute(Path, sys::path::Style::windows);
974}
975
Paul Robinson9d4eb692017-05-01 23:27:55 +0000976bool DWARFDebugLine::LineTable::getFileNameByIndex(uint64_t FileIndex,
977 const char *CompDir,
978 FileLineInfoKind Kind,
979 std::string &Result) const {
Pete Cooperb2ba7762016-07-22 01:41:32 +0000980 if (Kind == FileLineInfoKind::None || !hasFileAtIndex(FileIndex))
Alexey Samsonov45be7932012-08-30 07:49:50 +0000981 return false;
982 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
Paul Robinson0a227092018-02-05 20:43:15 +0000983 StringRef FileName = Entry.Name.getAsCString().getValue();
Alexey Samsonovdce67342014-05-15 21:24:32 +0000984 if (Kind != FileLineInfoKind::AbsoluteFilePath ||
Eugene Zemtsov82d60d62018-03-13 17:54:29 +0000985 isPathAbsoluteOnWindowsOrPosix(FileName)) {
Alexey Samsonov45be7932012-08-30 07:49:50 +0000986 Result = FileName;
987 return true;
988 }
Frederic Riss101b5e22014-09-19 15:11:51 +0000989
Alexey Samsonov45be7932012-08-30 07:49:50 +0000990 SmallString<16> FilePath;
991 uint64_t IncludeDirIndex = Entry.DirIdx;
Paul Robinsonba1c9152017-05-02 17:37:32 +0000992 StringRef IncludeDir;
Alexey Samsonov45be7932012-08-30 07:49:50 +0000993 // Be defensive about the contents of Entry.
994 if (IncludeDirIndex > 0 &&
Frederic Riss101b5e22014-09-19 15:11:51 +0000995 IncludeDirIndex <= Prologue.IncludeDirectories.size())
Paul Robinson0a227092018-02-05 20:43:15 +0000996 IncludeDir = Prologue.IncludeDirectories[IncludeDirIndex - 1]
997 .getAsCString()
998 .getValue();
Frederic Riss101b5e22014-09-19 15:11:51 +0000999
1000 // We may still need to append compilation directory of compile unit.
1001 // We know that FileName is not absolute, the only way to have an
1002 // absolute path at this point would be if IncludeDir is absolute.
1003 if (CompDir && Kind == FileLineInfoKind::AbsoluteFilePath &&
Eugene Zemtsov82d60d62018-03-13 17:54:29 +00001004 !isPathAbsoluteOnWindowsOrPosix(IncludeDir))
Frederic Riss101b5e22014-09-19 15:11:51 +00001005 sys::path::append(FilePath, CompDir);
1006
1007 // sys::path::append skips empty strings.
1008 sys::path::append(FilePath, IncludeDir, FileName);
Alexey Samsonov45be7932012-08-30 07:49:50 +00001009 Result = FilePath.str();
1010 return true;
1011}
Frederic Riss101b5e22014-09-19 15:11:51 +00001012
Dehao Chen1b54fce2016-04-28 22:09:37 +00001013bool DWARFDebugLine::LineTable::getFileLineInfoForAddress(
1014 uint64_t Address, const char *CompDir, FileLineInfoKind Kind,
1015 DILineInfo &Result) const {
Frederic Riss101b5e22014-09-19 15:11:51 +00001016 // Get the index of row we're looking for in the line table.
1017 uint32_t RowIndex = lookupAddress(Address);
1018 if (RowIndex == -1U)
1019 return false;
1020 // Take file number and line/column from the row.
1021 const auto &Row = Rows[RowIndex];
1022 if (!getFileNameByIndex(Row.File, CompDir, Kind, Result.FileName))
1023 return false;
1024 Result.Line = Row.Line;
1025 Result.Column = Row.Column;
Eric Christopherba1024c2016-12-14 18:29:39 +00001026 Result.Discriminator = Row.Discriminator;
Scott Linder16c7bda2018-02-23 23:01:06 +00001027 Result.Source = getSourceByIndex(Row.File, Kind);
Frederic Riss101b5e22014-09-19 15:11:51 +00001028 return true;
1029}
James Hendersona3acf992018-05-10 10:51:33 +00001030
1031// We want to supply the Unit associated with a .debug_line[.dwo] table when
1032// we dump it, if possible, but still dump the table even if there isn't a Unit.
1033// Therefore, collect up handles on all the Units that point into the
1034// line-table section.
1035static DWARFDebugLine::SectionParser::LineToUnitMap
1036buildLineToUnitMap(DWARFDebugLine::SectionParser::cu_range CUs,
Paul Robinson7f330942018-08-01 20:46:46 +00001037 DWARFDebugLine::SectionParser::tu_range TUs) {
James Hendersona3acf992018-05-10 10:51:33 +00001038 DWARFDebugLine::SectionParser::LineToUnitMap LineToUnit;
1039 for (const auto &CU : CUs)
1040 if (auto CUDIE = CU->getUnitDIE())
1041 if (auto StmtOffset = toSectionOffset(CUDIE.find(DW_AT_stmt_list)))
1042 LineToUnit.insert(std::make_pair(*StmtOffset, &*CU));
Paul Robinson7f330942018-08-01 20:46:46 +00001043 for (const auto &TU : TUs)
1044 if (auto TUDIE = TU->getUnitDIE())
1045 if (auto StmtOffset = toSectionOffset(TUDIE.find(DW_AT_stmt_list)))
1046 LineToUnit.insert(std::make_pair(*StmtOffset, &*TU));
James Hendersona3acf992018-05-10 10:51:33 +00001047 return LineToUnit;
1048}
1049
1050DWARFDebugLine::SectionParser::SectionParser(DWARFDataExtractor &Data,
1051 const DWARFContext &C,
1052 cu_range CUs, tu_range TUs)
1053 : DebugLineData(Data), Context(C) {
1054 LineToUnit = buildLineToUnitMap(CUs, TUs);
1055 if (!DebugLineData.isValidOffset(Offset))
1056 Done = true;
1057}
1058
1059bool DWARFDebugLine::Prologue::totalLengthIsValid() const {
1060 return TotalLength == 0xffffffff || TotalLength < 0xffffff00;
1061}
1062
1063DWARFDebugLine::LineTable DWARFDebugLine::SectionParser::parseNext(
James Henderson004b7292018-05-21 15:30:54 +00001064 function_ref<void(Error)> RecoverableErrorCallback,
1065 function_ref<void(Error)> UnrecoverableErrorCallback, raw_ostream *OS) {
James Hendersona3acf992018-05-10 10:51:33 +00001066 assert(DebugLineData.isValidOffset(Offset) &&
1067 "parsing should have terminated");
1068 DWARFUnit *U = prepareToParse(Offset);
1069 uint32_t OldOffset = Offset;
1070 LineTable LT;
James Henderson004b7292018-05-21 15:30:54 +00001071 if (Error Err = LT.parse(DebugLineData, &Offset, Context, U,
1072 RecoverableErrorCallback, OS))
1073 UnrecoverableErrorCallback(std::move(Err));
James Hendersona3acf992018-05-10 10:51:33 +00001074 moveToNextTable(OldOffset, LT.Prologue);
1075 return LT;
1076}
1077
1078void DWARFDebugLine::SectionParser::skip(
1079 function_ref<void(Error)> ErrorCallback) {
1080 assert(DebugLineData.isValidOffset(Offset) &&
1081 "parsing should have terminated");
1082 DWARFUnit *U = prepareToParse(Offset);
1083 uint32_t OldOffset = Offset;
1084 LineTable LT;
James Henderson004b7292018-05-21 15:30:54 +00001085 if (Error Err = LT.Prologue.parse(DebugLineData, &Offset, Context, U))
1086 ErrorCallback(std::move(Err));
James Hendersona3acf992018-05-10 10:51:33 +00001087 moveToNextTable(OldOffset, LT.Prologue);
1088}
1089
1090DWARFUnit *DWARFDebugLine::SectionParser::prepareToParse(uint32_t Offset) {
1091 DWARFUnit *U = nullptr;
1092 auto It = LineToUnit.find(Offset);
1093 if (It != LineToUnit.end())
1094 U = It->second;
1095 DebugLineData.setAddressSize(U ? U->getAddressByteSize() : 0);
1096 return U;
1097}
1098
1099void DWARFDebugLine::SectionParser::moveToNextTable(uint32_t OldOffset,
1100 const Prologue &P) {
1101 // If the length field is not valid, we don't know where the next table is, so
1102 // cannot continue to parse. Mark the parser as done, and leave the Offset
1103 // value as it currently is. This will be the end of the bad length field.
1104 if (!P.totalLengthIsValid()) {
1105 Done = true;
1106 return;
1107 }
1108
1109 Offset = OldOffset + P.TotalLength + P.sizeofTotalLength();
1110 if (!DebugLineData.isValidOffset(Offset)) {
1111 Done = true;
1112 }
1113}