blob: ad5647f3e03d82fadccbec8a5a5d9bafce7b030f [file] [log] [blame]
Eugene Zelenkoe94042c2017-02-27 23:43:14 +00001//===- DWARFDebugLine.cpp -------------------------------------------------===//
Benjamin Kramer5acab502011-09-15 02:12:05 +00002//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9
Paul Robinson9d4eb692017-05-01 23:27:55 +000010#include "llvm/DebugInfo/DWARF/DWARFDebugLine.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"
George Rimarf8a96422017-04-21 09:12:18 +000015#include "llvm/DebugInfo/DWARF/DWARFContext.h"
Paul Robinson2bc38732017-05-02 21:40:47 +000016#include "llvm/DebugInfo/DWARF/DWARFFormValue.h"
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000017#include "llvm/DebugInfo/DWARF/DWARFRelocMap.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"
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
Dehao Chen1b54fce2016-04-28 22:09:37 +000044DWARFDebugLine::Prologue::Prologue() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000045
46void DWARFDebugLine::Prologue::clear() {
Paul Robinson75c068c2017-06-26 18:43:01 +000047 TotalLength = PrologueLength = 0;
48 SegSelectorSize = 0;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000049 MinInstLength = MaxOpsPerInst = DefaultIsStmt = LineBase = LineRange = 0;
50 OpcodeBase = 0;
Paul Robinson75c068c2017-06-26 18:43:01 +000051 FormParams = DWARFFormParams({0, 0, DWARF32});
Alexey Samsonov836b1ae2014-04-29 21:28:13 +000052 StandardOpcodeLengths.clear();
53 IncludeDirectories.clear();
54 FileNames.clear();
55}
56
Benjamin Kramer5acab502011-09-15 02:12:05 +000057void DWARFDebugLine::Prologue::dump(raw_ostream &OS) const {
58 OS << "Line table prologue:\n"
Ed Maste6d0bee52015-05-28 15:38:17 +000059 << format(" total_length: 0x%8.8" PRIx64 "\n", TotalLength)
Paul Robinson75c068c2017-06-26 18:43:01 +000060 << format(" version: %u\n", getVersion());
61 if (getVersion() >= 5)
62 OS << format(" address_size: %u\n", getAddressSize())
63 << format(" seg_select_size: %u\n", SegSelectorSize);
64 OS << format(" prologue_length: 0x%8.8" PRIx64 "\n", PrologueLength)
David Blaikie1d4736e2014-02-24 23:58:54 +000065 << format(" min_inst_length: %u\n", MinInstLength)
Paul Robinson75c068c2017-06-26 18:43:01 +000066 << format(getVersion() >= 4 ? "max_ops_per_inst: %u\n" : "", MaxOpsPerInst)
David Blaikie1d4736e2014-02-24 23:58:54 +000067 << format(" default_is_stmt: %u\n", DefaultIsStmt)
68 << format(" line_base: %i\n", LineBase)
69 << format(" line_range: %u\n", LineRange)
70 << format(" opcode_base: %u\n", OpcodeBase);
Benjamin Kramer5acab502011-09-15 02:12:05 +000071
Paul Robinson9d4eb692017-05-01 23:27:55 +000072 for (uint32_t I = 0; I != StandardOpcodeLengths.size(); ++I)
Mehdi Amini149f6ea2016-10-05 05:59:29 +000073 OS << format("standard_opcode_lengths[%s] = %u\n",
Paul Robinson9d4eb692017-05-01 23:27:55 +000074 LNStandardString(I + 1).data(), StandardOpcodeLengths[I]);
Benjamin Kramer5acab502011-09-15 02:12:05 +000075
76 if (!IncludeDirectories.empty())
Paul Robinson9d4eb692017-05-01 23:27:55 +000077 for (uint32_t I = 0; I != IncludeDirectories.size(); ++I)
78 OS << format("include_directories[%3u] = '", I + 1)
79 << IncludeDirectories[I] << "'\n";
Benjamin Kramer5acab502011-09-15 02:12:05 +000080
81 if (!FileNames.empty()) {
82 OS << " Dir Mod Time File Len File Name\n"
83 << " ---- ---------- ---------- -----------"
84 "----------------\n";
Paul Robinson9d4eb692017-05-01 23:27:55 +000085 for (uint32_t I = 0; I != FileNames.size(); ++I) {
86 const FileNameEntry &FileEntry = FileNames[I];
87 OS << format("file_names[%3u] %4" PRIu64 " ", I + 1, FileEntry.DirIdx)
88 << format("0x%8.8" PRIx64 " 0x%8.8" PRIx64 " ", FileEntry.ModTime,
89 FileEntry.Length)
90 << FileEntry.Name << '\n';
Benjamin Kramer5acab502011-09-15 02:12:05 +000091 }
92 }
93}
94
Paul Robinson2bc38732017-05-02 21:40:47 +000095// Parse v2-v4 directory and file tables.
96static void
97parseV2DirFileTables(DataExtractor DebugLineData, uint32_t *OffsetPtr,
98 uint64_t EndPrologueOffset,
99 std::vector<StringRef> &IncludeDirectories,
100 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
101 while (*OffsetPtr < EndPrologueOffset) {
102 StringRef S = DebugLineData.getCStrRef(OffsetPtr);
103 if (S.empty())
104 break;
105 IncludeDirectories.push_back(S);
106 }
107
108 while (*OffsetPtr < EndPrologueOffset) {
109 StringRef Name = DebugLineData.getCStrRef(OffsetPtr);
110 if (Name.empty())
111 break;
112 DWARFDebugLine::FileNameEntry FileEntry;
113 FileEntry.Name = Name;
114 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
115 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
116 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
117 FileNames.push_back(FileEntry);
118 }
119}
120
121// Parse v5 directory/file entry content descriptions.
122// Returns the descriptors, or an empty vector if we did not find a path or
123// ran off the end of the prologue.
124static ContentDescriptors
125parseV5EntryFormat(DataExtractor DebugLineData, uint32_t *OffsetPtr,
126 uint64_t EndPrologueOffset) {
127 ContentDescriptors Descriptors;
128 int FormatCount = DebugLineData.getU8(OffsetPtr);
129 bool HasPath = false;
130 for (int I = 0; I != FormatCount; ++I) {
131 if (*OffsetPtr >= EndPrologueOffset)
132 return ContentDescriptors();
133 ContentDescriptor Descriptor;
134 Descriptor.Type =
135 dwarf::LineNumberEntryFormat(DebugLineData.getULEB128(OffsetPtr));
136 Descriptor.Form = dwarf::Form(DebugLineData.getULEB128(OffsetPtr));
137 if (Descriptor.Type == dwarf::DW_LNCT_path)
138 HasPath = true;
139 Descriptors.push_back(Descriptor);
140 }
141 return HasPath ? Descriptors : ContentDescriptors();
142}
143
144static bool
145parseV5DirFileTables(DataExtractor DebugLineData, uint32_t *OffsetPtr,
146 uint64_t EndPrologueOffset,
Paul Robinson75c068c2017-06-26 18:43:01 +0000147 const DWARFFormParams &FormParams,
Paul Robinson2bc38732017-05-02 21:40:47 +0000148 std::vector<StringRef> &IncludeDirectories,
149 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) {
150 // Get the directory entry description.
151 ContentDescriptors DirDescriptors =
152 parseV5EntryFormat(DebugLineData, OffsetPtr, EndPrologueOffset);
153 if (DirDescriptors.empty())
154 return false;
155
156 // Get the directory entries, according to the format described above.
157 int DirEntryCount = DebugLineData.getU8(OffsetPtr);
158 for (int I = 0; I != DirEntryCount; ++I) {
159 if (*OffsetPtr >= EndPrologueOffset)
160 return false;
161 for (auto Descriptor : DirDescriptors) {
162 DWARFFormValue Value(Descriptor.Form);
163 switch (Descriptor.Type) {
164 case DW_LNCT_path:
165 if (!Value.extractValue(DebugLineData, OffsetPtr, nullptr))
166 return false;
167 IncludeDirectories.push_back(Value.getAsCString().getValue());
168 break;
169 default:
Paul Robinson75c068c2017-06-26 18:43:01 +0000170 if (!Value.skipValue(DebugLineData, OffsetPtr, FormParams))
Paul Robinson2bc38732017-05-02 21:40:47 +0000171 return false;
172 }
173 }
174 }
175
176 // Get the file entry description.
177 ContentDescriptors FileDescriptors =
178 parseV5EntryFormat(DebugLineData, OffsetPtr, EndPrologueOffset);
179 if (FileDescriptors.empty())
180 return false;
181
182 // Get the file entries, according to the format described above.
183 int FileEntryCount = DebugLineData.getU8(OffsetPtr);
184 for (int I = 0; I != FileEntryCount; ++I) {
185 if (*OffsetPtr >= EndPrologueOffset)
186 return false;
187 DWARFDebugLine::FileNameEntry FileEntry;
188 for (auto Descriptor : FileDescriptors) {
189 DWARFFormValue Value(Descriptor.Form);
190 if (!Value.extractValue(DebugLineData, OffsetPtr, nullptr))
191 return false;
192 switch (Descriptor.Type) {
193 case DW_LNCT_path:
194 FileEntry.Name = Value.getAsCString().getValue();
195 break;
196 case DW_LNCT_directory_index:
197 FileEntry.DirIdx = Value.getAsUnsignedConstant().getValue();
198 break;
199 case DW_LNCT_timestamp:
200 FileEntry.ModTime = Value.getAsUnsignedConstant().getValue();
201 break;
202 case DW_LNCT_size:
203 FileEntry.Length = Value.getAsUnsignedConstant().getValue();
204 break;
205 // FIXME: Add MD5
206 default:
207 break;
208 }
209 }
210 FileNames.push_back(FileEntry);
211 }
212 return true;
213}
214
Paul Robinson9d4eb692017-05-01 23:27:55 +0000215bool DWARFDebugLine::Prologue::parse(DataExtractor DebugLineData,
216 uint32_t *OffsetPtr) {
217 const uint64_t PrologueOffset = *OffsetPtr;
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000218
219 clear();
Paul Robinson9d4eb692017-05-01 23:27:55 +0000220 TotalLength = DebugLineData.getU32(OffsetPtr);
Ed Maste6d0bee52015-05-28 15:38:17 +0000221 if (TotalLength == UINT32_MAX) {
Paul Robinson75c068c2017-06-26 18:43:01 +0000222 FormParams.Format = dwarf::DWARF64;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000223 TotalLength = DebugLineData.getU64(OffsetPtr);
Paul Robinson75c068c2017-06-26 18:43:01 +0000224 } else if (TotalLength >= 0xffffff00) {
Ed Maste6d0bee52015-05-28 15:38:17 +0000225 return false;
226 }
Paul Robinson75c068c2017-06-26 18:43:01 +0000227 FormParams.Version = DebugLineData.getU16(OffsetPtr);
228 if (getVersion() < 2)
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000229 return false;
230
Paul Robinson75c068c2017-06-26 18:43:01 +0000231 if (getVersion() >= 5) {
232 FormParams.AddrSize = DebugLineData.getU8(OffsetPtr);
233 assert(getAddressSize() == DebugLineData.getAddressSize() &&
234 "Line table header and data extractor disagree");
Paul Robinson2bc38732017-05-02 21:40:47 +0000235 SegSelectorSize = DebugLineData.getU8(OffsetPtr);
236 }
237
Paul Robinson9d4eb692017-05-01 23:27:55 +0000238 PrologueLength = DebugLineData.getUnsigned(OffsetPtr, sizeofPrologueLength());
239 const uint64_t EndPrologueOffset = PrologueLength + *OffsetPtr;
240 MinInstLength = DebugLineData.getU8(OffsetPtr);
Paul Robinson75c068c2017-06-26 18:43:01 +0000241 if (getVersion() >= 4)
Paul Robinson9d4eb692017-05-01 23:27:55 +0000242 MaxOpsPerInst = DebugLineData.getU8(OffsetPtr);
243 DefaultIsStmt = DebugLineData.getU8(OffsetPtr);
244 LineBase = DebugLineData.getU8(OffsetPtr);
245 LineRange = DebugLineData.getU8(OffsetPtr);
246 OpcodeBase = DebugLineData.getU8(OffsetPtr);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000247
248 StandardOpcodeLengths.reserve(OpcodeBase - 1);
Paul Robinson9d4eb692017-05-01 23:27:55 +0000249 for (uint32_t I = 1; I < OpcodeBase; ++I) {
250 uint8_t OpLen = DebugLineData.getU8(OffsetPtr);
251 StandardOpcodeLengths.push_back(OpLen);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000252 }
253
Paul Robinson75c068c2017-06-26 18:43:01 +0000254 if (getVersion() >= 5) {
Paul Robinson2bc38732017-05-02 21:40:47 +0000255 if (!parseV5DirFileTables(DebugLineData, OffsetPtr, EndPrologueOffset,
Paul Robinson75c068c2017-06-26 18:43:01 +0000256 getFormParams(), IncludeDirectories, FileNames)) {
Paul Robinson2bc38732017-05-02 21:40:47 +0000257 fprintf(stderr,
258 "warning: parsing line table prologue at 0x%8.8" PRIx64
259 " found an invalid directory or file table description at"
260 " 0x%8.8" PRIx64 "\n", PrologueOffset, (uint64_t)*OffsetPtr);
261 return false;
262 }
263 } else
264 parseV2DirFileTables(DebugLineData, OffsetPtr, EndPrologueOffset,
265 IncludeDirectories, FileNames);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000266
Paul Robinson9d4eb692017-05-01 23:27:55 +0000267 if (*OffsetPtr != EndPrologueOffset) {
268 fprintf(stderr,
269 "warning: parsing line table prologue at 0x%8.8" PRIx64
270 " should have ended at 0x%8.8" PRIx64
271 " but it ended at 0x%8.8" PRIx64 "\n",
272 PrologueOffset, EndPrologueOffset, (uint64_t)*OffsetPtr);
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000273 return false;
274 }
275 return true;
276}
277
Paul Robinson9d4eb692017-05-01 23:27:55 +0000278DWARFDebugLine::Row::Row(bool DefaultIsStmt) { reset(DefaultIsStmt); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000279
Benjamin Kramer5acab502011-09-15 02:12:05 +0000280void DWARFDebugLine::Row::postAppend() {
281 BasicBlock = false;
282 PrologueEnd = false;
283 EpilogueBegin = false;
284}
285
Paul Robinson9d4eb692017-05-01 23:27:55 +0000286void DWARFDebugLine::Row::reset(bool DefaultIsStmt) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000287 Address = 0;
288 Line = 1;
289 Column = 0;
290 File = 1;
291 Isa = 0;
Diego Novillo5b5cf502014-02-14 19:27:53 +0000292 Discriminator = 0;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000293 IsStmt = DefaultIsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000294 BasicBlock = false;
295 EndSequence = false;
296 PrologueEnd = false;
297 EpilogueBegin = false;
298}
299
Greg Clayton67070462017-05-02 22:48:52 +0000300void DWARFDebugLine::Row::dumpTableHeader(raw_ostream &OS) {
301 OS << "Address Line Column File ISA Discriminator Flags\n"
302 << "------------------ ------ ------ ------ --- ------------- "
303 "-------------\n";
304}
305
Benjamin Kramer5acab502011-09-15 02:12:05 +0000306void DWARFDebugLine::Row::dump(raw_ostream &OS) const {
Benjamin Kramerf3da5292011-11-05 08:57:40 +0000307 OS << format("0x%16.16" PRIx64 " %6u %6u", Address, Line, Column)
Diego Novillo5b5cf502014-02-14 19:27:53 +0000308 << format(" %6u %3u %13u ", File, Isa, Discriminator)
Dehao Chen1b54fce2016-04-28 22:09:37 +0000309 << (IsStmt ? " is_stmt" : "") << (BasicBlock ? " basic_block" : "")
Benjamin Kramer5acab502011-09-15 02:12:05 +0000310 << (PrologueEnd ? " prologue_end" : "")
311 << (EpilogueBegin ? " epilogue_begin" : "")
Dehao Chen1b54fce2016-04-28 22:09:37 +0000312 << (EndSequence ? " end_sequence" : "") << '\n';
Benjamin Kramer5acab502011-09-15 02:12:05 +0000313}
314
Dehao Chen1b54fce2016-04-28 22:09:37 +0000315DWARFDebugLine::Sequence::Sequence() { reset(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000316
317void DWARFDebugLine::Sequence::reset() {
318 LowPC = 0;
319 HighPC = 0;
320 FirstRowIndex = 0;
321 LastRowIndex = 0;
322 Empty = true;
323}
324
Dehao Chen1b54fce2016-04-28 22:09:37 +0000325DWARFDebugLine::LineTable::LineTable() { clear(); }
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000326
Benjamin Kramer5acab502011-09-15 02:12:05 +0000327void DWARFDebugLine::LineTable::dump(raw_ostream &OS) const {
328 Prologue.dump(OS);
329 OS << '\n';
330
331 if (!Rows.empty()) {
Greg Clayton67070462017-05-02 22:48:52 +0000332 Row::dumpTableHeader(OS);
Alexey Samsonov1eabf982014-03-13 07:52:54 +0000333 for (const Row &R : Rows) {
334 R.dump(OS);
335 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000336 }
337}
338
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000339void DWARFDebugLine::LineTable::clear() {
340 Prologue.clear();
341 Rows.clear();
342 Sequences.clear();
343}
344
Alexey Samsonov110d5952014-04-30 00:09:19 +0000345DWARFDebugLine::ParsingState::ParsingState(struct LineTable *LT)
Eugene Zelenko2db0cfa2017-06-23 21:57:40 +0000346 : LineTable(LT) {
Alexey Samsonov110d5952014-04-30 00:09:19 +0000347 resetRowAndSequence();
348}
Nick Lewycky4d044922011-09-15 03:41:51 +0000349
Alexey Samsonov110d5952014-04-30 00:09:19 +0000350void DWARFDebugLine::ParsingState::resetRowAndSequence() {
351 Row.reset(LineTable->Prologue.DefaultIsStmt);
352 Sequence.reset();
353}
354
Paul Robinson9d4eb692017-05-01 23:27:55 +0000355void DWARFDebugLine::ParsingState::appendRowToMatrix(uint32_t Offset) {
Alexey Samsonov110d5952014-04-30 00:09:19 +0000356 if (Sequence.Empty) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000357 // Record the beginning of instruction sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000358 Sequence.Empty = false;
359 Sequence.LowPC = Row.Address;
360 Sequence.FirstRowIndex = RowNumber;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000361 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000362 ++RowNumber;
363 LineTable->appendRow(Row);
364 if (Row.EndSequence) {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000365 // Record the end of instruction sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000366 Sequence.HighPC = Row.Address;
367 Sequence.LastRowIndex = RowNumber;
368 if (Sequence.isValid())
369 LineTable->appendSequence(Sequence);
370 Sequence.reset();
Alexey Samsonov947228c2012-08-07 11:46:57 +0000371 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000372 Row.postAppend();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000373}
374
Benjamin Kramer5acab502011-09-15 02:12:05 +0000375const DWARFDebugLine::LineTable *
Paul Robinson9d4eb692017-05-01 23:27:55 +0000376DWARFDebugLine::getLineTable(uint32_t Offset) const {
377 LineTableConstIter Pos = LineTableMap.find(Offset);
378 if (Pos != LineTableMap.end())
379 return &Pos->second;
Craig Topper2617dcc2014-04-15 06:32:26 +0000380 return nullptr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000381}
382
Benjamin Kramer679e1752011-09-15 20:43:18 +0000383const DWARFDebugLine::LineTable *
Paul Robinson9d4eb692017-05-01 23:27:55 +0000384DWARFDebugLine::getOrParseLineTable(DataExtractor DebugLineData,
385 uint32_t Offset) {
386 std::pair<LineTableIter, bool> Pos =
387 LineTableMap.insert(LineTableMapTy::value_type(Offset, LineTable()));
388 LineTable *LT = &Pos.first->second;
389 if (Pos.second) {
390 if (!LT->parse(DebugLineData, RelocMap, &Offset))
Craig Topper2617dcc2014-04-15 06:32:26 +0000391 return nullptr;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000392 }
Alexey Samsonov110d5952014-04-30 00:09:19 +0000393 return LT;
Benjamin Kramer679e1752011-09-15 20:43:18 +0000394}
395
Paul Robinson9d4eb692017-05-01 23:27:55 +0000396bool DWARFDebugLine::LineTable::parse(DataExtractor DebugLineData,
Alexey Samsonov110d5952014-04-30 00:09:19 +0000397 const RelocAddrMap *RMap,
Paul Robinson9d4eb692017-05-01 23:27:55 +0000398 uint32_t *OffsetPtr) {
399 const uint32_t DebugLineOffset = *OffsetPtr;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000400
Alexey Samsonov110d5952014-04-30 00:09:19 +0000401 clear();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000402
Paul Robinson9d4eb692017-05-01 23:27:55 +0000403 if (!Prologue.parse(DebugLineData, OffsetPtr)) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000404 // Restore our offset and return false to indicate failure!
Paul Robinson9d4eb692017-05-01 23:27:55 +0000405 *OffsetPtr = DebugLineOffset;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000406 return false;
407 }
408
Paul Robinson9d4eb692017-05-01 23:27:55 +0000409 const uint32_t EndOffset =
410 DebugLineOffset + Prologue.TotalLength + Prologue.sizeofTotalLength();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000411
Alexey Samsonov110d5952014-04-30 00:09:19 +0000412 ParsingState State(this);
Benjamin Kramer112ec172011-09-15 21:59:13 +0000413
Paul Robinson9d4eb692017-05-01 23:27:55 +0000414 while (*OffsetPtr < EndOffset) {
415 uint8_t Opcode = DebugLineData.getU8(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000416
Paul Robinson9d4eb692017-05-01 23:27:55 +0000417 if (Opcode == 0) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000418 // Extended Opcodes always start with a zero opcode followed by
419 // a uleb128 length so you can skip ones you don't know about
Paul Robinson9d4eb692017-05-01 23:27:55 +0000420 uint32_t ExtOffset = *OffsetPtr;
421 uint64_t Len = DebugLineData.getULEB128(OffsetPtr);
422 uint32_t ArgSize = Len - (*OffsetPtr - ExtOffset);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000423
Paul Robinson9d4eb692017-05-01 23:27:55 +0000424 uint8_t SubOpcode = DebugLineData.getU8(OffsetPtr);
425 switch (SubOpcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000426 case DW_LNE_end_sequence:
427 // Set the end_sequence register of the state machine to true and
428 // append a row to the matrix using the current values of the
429 // state-machine registers. Then reset the registers to the initial
430 // values specified above. Every statement program sequence must end
431 // with a DW_LNE_end_sequence instruction which creates a row whose
432 // address is that of the byte after the last target machine instruction
433 // of the sequence.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000434 State.Row.EndSequence = true;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000435 State.appendRowToMatrix(*OffsetPtr);
Alexey Samsonov110d5952014-04-30 00:09:19 +0000436 State.resetRowAndSequence();
Benjamin Kramer5acab502011-09-15 02:12:05 +0000437 break;
438
439 case DW_LNE_set_address:
440 // Takes a single relocatable address as an operand. The size of the
441 // operand is the size appropriate to hold an address on the target
442 // machine. Set the address register to the value given by the
443 // relocatable address. All of the other statement program opcodes
444 // that affect the address register add a delta to it. This instruction
445 // stores a relocatable value into it instead.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000446 State.Row.Address = getRelocatedValue(
447 DebugLineData, DebugLineData.getAddressSize(), OffsetPtr, RMap);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000448 break;
449
450 case DW_LNE_define_file:
451 // Takes 4 arguments. The first is a null terminated string containing
452 // a source file name. The second is an unsigned LEB128 number
453 // representing the directory index of the directory in which the file
454 // was found. The third is an unsigned LEB128 number representing the
455 // time of last modification of the file. The fourth is an unsigned
456 // LEB128 number representing the length in bytes of the file. The time
457 // and length fields may contain LEB128(0) if the information is not
458 // available.
459 //
460 // The directory index represents an entry in the include_directories
461 // section of the statement program prologue. The index is LEB128(0)
462 // if the file was found in the current directory of the compilation,
463 // LEB128(1) if it was found in the first directory in the
464 // include_directories section, and so on. The directory index is
465 // ignored for file names that represent full path names.
466 //
467 // The files are numbered, starting at 1, in the order in which they
468 // appear; the names in the prologue come before names defined by
469 // the DW_LNE_define_file instruction. These numbers are used in the
470 // the file register of the state machine.
471 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000472 FileNameEntry FileEntry;
473 FileEntry.Name = DebugLineData.getCStr(OffsetPtr);
474 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr);
475 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr);
476 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr);
477 Prologue.FileNames.push_back(FileEntry);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000478 }
479 break;
480
Diego Novillo5b5cf502014-02-14 19:27:53 +0000481 case DW_LNE_set_discriminator:
Paul Robinson9d4eb692017-05-01 23:27:55 +0000482 State.Row.Discriminator = DebugLineData.getULEB128(OffsetPtr);
Diego Novillo5b5cf502014-02-14 19:27:53 +0000483 break;
484
Benjamin Kramer5acab502011-09-15 02:12:05 +0000485 default:
486 // Length doesn't include the zero opcode byte or the length itself, but
487 // it does include the sub_opcode, so we have to adjust for that below
Paul Robinson9d4eb692017-05-01 23:27:55 +0000488 (*OffsetPtr) += ArgSize;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000489 break;
490 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000491 } else if (Opcode < Prologue.OpcodeBase) {
492 switch (Opcode) {
Benjamin Kramer5acab502011-09-15 02:12:05 +0000493 // Standard Opcodes
494 case DW_LNS_copy:
495 // Takes no arguments. Append a row to the matrix using the
496 // current values of the state-machine registers. Then set
497 // the basic_block register to false.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000498 State.appendRowToMatrix(*OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000499 break;
500
501 case DW_LNS_advance_pc:
502 // Takes a single unsigned LEB128 operand, multiplies it by the
503 // min_inst_length field of the prologue, and adds the
504 // result to the address register of the state machine.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000505 State.Row.Address +=
Paul Robinson9d4eb692017-05-01 23:27:55 +0000506 DebugLineData.getULEB128(OffsetPtr) * Prologue.MinInstLength;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000507 break;
508
509 case DW_LNS_advance_line:
510 // Takes a single signed LEB128 operand and adds that value to
511 // the line register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000512 State.Row.Line += DebugLineData.getSLEB128(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000513 break;
514
515 case DW_LNS_set_file:
516 // Takes a single unsigned LEB128 operand and stores it in the file
517 // register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000518 State.Row.File = DebugLineData.getULEB128(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000519 break;
520
521 case DW_LNS_set_column:
522 // Takes a single unsigned LEB128 operand and stores it in the
523 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000524 State.Row.Column = DebugLineData.getULEB128(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000525 break;
526
527 case DW_LNS_negate_stmt:
528 // Takes no arguments. Set the is_stmt register of the state
529 // machine to the logical negation of its current value.
Alexey Samsonov110d5952014-04-30 00:09:19 +0000530 State.Row.IsStmt = !State.Row.IsStmt;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000531 break;
532
533 case DW_LNS_set_basic_block:
534 // Takes no arguments. Set the basic_block register of the
535 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000536 State.Row.BasicBlock = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000537 break;
538
539 case DW_LNS_const_add_pc:
540 // Takes no arguments. Add to the address register of the state
541 // machine the address increment value corresponding to special
542 // opcode 255. The motivation for DW_LNS_const_add_pc is this:
543 // when the statement program needs to advance the address by a
544 // small amount, it can use a single special opcode, which occupies
545 // a single byte. When it needs to advance the address by up to
546 // twice the range of the last special opcode, it can use
547 // DW_LNS_const_add_pc followed by a special opcode, for a total
548 // of two bytes. Only if it needs to advance the address by more
549 // than twice that range will it need to use both DW_LNS_advance_pc
550 // and a special opcode, requiring three or more bytes.
551 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000552 uint8_t AdjustOpcode = 255 - Prologue.OpcodeBase;
553 uint64_t AddrOffset =
554 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
555 State.Row.Address += AddrOffset;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000556 }
557 break;
558
559 case DW_LNS_fixed_advance_pc:
560 // Takes a single uhalf operand. Add to the address register of
561 // the state machine the value of the (unencoded) operand. This
562 // is the only extended opcode that takes an argument that is not
563 // a variable length number. The motivation for DW_LNS_fixed_advance_pc
564 // is this: existing assemblers cannot emit DW_LNS_advance_pc or
565 // special opcodes because they cannot encode LEB128 numbers or
566 // judge when the computation of a special opcode overflows and
567 // requires the use of DW_LNS_advance_pc. Such assemblers, however,
568 // can use DW_LNS_fixed_advance_pc instead, sacrificing compression.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000569 State.Row.Address += DebugLineData.getU16(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000570 break;
571
572 case DW_LNS_set_prologue_end:
573 // Takes no arguments. Set the prologue_end register of the
574 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000575 State.Row.PrologueEnd = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000576 break;
577
578 case DW_LNS_set_epilogue_begin:
579 // Takes no arguments. Set the basic_block register of the
580 // state machine to true
Alexey Samsonov110d5952014-04-30 00:09:19 +0000581 State.Row.EpilogueBegin = true;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000582 break;
583
584 case DW_LNS_set_isa:
585 // Takes a single unsigned LEB128 operand and stores it in the
586 // column register of the state machine.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000587 State.Row.Isa = DebugLineData.getULEB128(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000588 break;
589
590 default:
591 // Handle any unknown standard opcodes here. We know the lengths
592 // of such opcodes because they are specified in the prologue
593 // as a multiple of LEB128 operands for each opcode.
594 {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000595 assert(Opcode - 1U < Prologue.StandardOpcodeLengths.size());
596 uint8_t OpcodeLength = Prologue.StandardOpcodeLengths[Opcode - 1];
597 for (uint8_t I = 0; I < OpcodeLength; ++I)
598 DebugLineData.getULEB128(OffsetPtr);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000599 }
600 break;
601 }
602 } else {
603 // Special Opcodes
604
605 // A special opcode value is chosen based on the amount that needs
606 // to be added to the line and address registers. The maximum line
607 // increment for a special opcode is the value of the line_base
608 // field in the header, plus the value of the line_range field,
609 // minus 1 (line base + line range - 1). If the desired line
610 // increment is greater than the maximum line increment, a standard
NAKAMURA Takumif9959852011-10-08 11:22:47 +0000611 // opcode must be used instead of a special opcode. The "address
612 // advance" is calculated by dividing the desired address increment
Benjamin Kramer5acab502011-09-15 02:12:05 +0000613 // by the minimum_instruction_length field from the header. The
614 // special opcode is then calculated using the following formula:
615 //
616 // opcode = (desired line increment - line_base) +
617 // (line_range * address advance) + opcode_base
618 //
619 // If the resulting opcode is greater than 255, a standard opcode
620 // must be used instead.
621 //
622 // To decode a special opcode, subtract the opcode_base from the
623 // opcode itself to give the adjusted opcode. The amount to
624 // increment the address register is the result of the adjusted
625 // opcode divided by the line_range multiplied by the
626 // minimum_instruction_length field from the header. That is:
627 //
628 // address increment = (adjusted opcode / line_range) *
629 // minimum_instruction_length
630 //
631 // The amount to increment the line register is the line_base plus
632 // the result of the adjusted opcode modulo the line_range. That is:
633 //
634 // line increment = line_base + (adjusted opcode % line_range)
635
Paul Robinson9d4eb692017-05-01 23:27:55 +0000636 uint8_t AdjustOpcode = Opcode - Prologue.OpcodeBase;
637 uint64_t AddrOffset =
638 (AdjustOpcode / Prologue.LineRange) * Prologue.MinInstLength;
639 int32_t LineOffset =
640 Prologue.LineBase + (AdjustOpcode % Prologue.LineRange);
641 State.Row.Line += LineOffset;
642 State.Row.Address += AddrOffset;
643 State.appendRowToMatrix(*OffsetPtr);
Dehao Chen1b54fce2016-04-28 22:09:37 +0000644 // Reset discriminator to 0.
645 State.Row.Discriminator = 0;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000646 }
647 }
648
Alexey Samsonov110d5952014-04-30 00:09:19 +0000649 if (!State.Sequence.Empty) {
650 fprintf(stderr, "warning: last sequence in debug line table is not"
651 "terminated!\n");
652 }
653
654 // Sort all sequences so that address lookup will work faster.
655 if (!Sequences.empty()) {
656 std::sort(Sequences.begin(), Sequences.end(), Sequence::orderByLowPC);
657 // Note: actually, instruction address ranges of sequences should not
658 // overlap (in shared objects and executables). If they do, the address
659 // lookup would still work, though, but result would be ambiguous.
660 // We don't report warning in this case. For example,
661 // sometimes .so compiled from multiple object files contains a few
662 // rudimentary sequences for address ranges [0x0, 0xsomething).
663 }
Benjamin Kramer5acab502011-09-15 02:12:05 +0000664
Paul Robinson9d4eb692017-05-01 23:27:55 +0000665 return EndOffset;
Benjamin Kramer5acab502011-09-15 02:12:05 +0000666}
667
Keno Fischerc2c60182015-05-31 23:37:04 +0000668uint32_t
Paul Robinson9d4eb692017-05-01 23:27:55 +0000669DWARFDebugLine::LineTable::findRowInSeq(const DWARFDebugLine::Sequence &Seq,
670 uint64_t Address) const {
671 if (!Seq.containsPC(Address))
Keno Fischerc2c60182015-05-31 23:37:04 +0000672 return UnknownRowIndex;
673 // Search for instruction address in the rows describing the sequence.
674 // Rows are stored in a vector, so we may use arithmetical operations with
675 // iterators.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000676 DWARFDebugLine::Row Row;
677 Row.Address = Address;
678 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex;
679 RowIter LastRow = Rows.begin() + Seq.LastRowIndex;
680 LineTable::RowIter RowPos = std::lower_bound(
681 FirstRow, LastRow, Row, DWARFDebugLine::Row::orderByAddress);
682 if (RowPos == LastRow) {
683 return Seq.LastRowIndex - 1;
Keno Fischerc2c60182015-05-31 23:37:04 +0000684 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000685 uint32_t Index = Seq.FirstRowIndex + (RowPos - FirstRow);
686 if (RowPos->Address > Address) {
687 if (RowPos == FirstRow)
Keno Fischerc2c60182015-05-31 23:37:04 +0000688 return UnknownRowIndex;
689 else
Paul Robinson9d4eb692017-05-01 23:27:55 +0000690 Index--;
Keno Fischerc2c60182015-05-31 23:37:04 +0000691 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000692 return Index;
Keno Fischerc2c60182015-05-31 23:37:04 +0000693}
694
Paul Robinson9d4eb692017-05-01 23:27:55 +0000695uint32_t DWARFDebugLine::LineTable::lookupAddress(uint64_t Address) const {
Alexey Samsonov947228c2012-08-07 11:46:57 +0000696 if (Sequences.empty())
Keno Fischerc2c60182015-05-31 23:37:04 +0000697 return UnknownRowIndex;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000698 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000699 DWARFDebugLine::Sequence Sequence;
700 Sequence.LowPC = Address;
701 SequenceIter FirstSeq = Sequences.begin();
702 SequenceIter LastSeq = Sequences.end();
703 SequenceIter SeqPos = std::lower_bound(
704 FirstSeq, LastSeq, Sequence, DWARFDebugLine::Sequence::orderByLowPC);
705 DWARFDebugLine::Sequence FoundSeq;
706 if (SeqPos == LastSeq) {
707 FoundSeq = Sequences.back();
708 } else if (SeqPos->LowPC == Address) {
709 FoundSeq = *SeqPos;
Alexey Samsonov947228c2012-08-07 11:46:57 +0000710 } else {
Paul Robinson9d4eb692017-05-01 23:27:55 +0000711 if (SeqPos == FirstSeq)
Keno Fischerc2c60182015-05-31 23:37:04 +0000712 return UnknownRowIndex;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000713 FoundSeq = *(SeqPos - 1);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000714 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000715 return findRowInSeq(FoundSeq, Address);
Benjamin Kramer5acab502011-09-15 02:12:05 +0000716}
Alexey Samsonov45be7932012-08-30 07:49:50 +0000717
Alexey Samsonov836b1ae2014-04-29 21:28:13 +0000718bool DWARFDebugLine::LineTable::lookupAddressRange(
Paul Robinson9d4eb692017-05-01 23:27:55 +0000719 uint64_t Address, uint64_t Size, std::vector<uint32_t> &Result) const {
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000720 if (Sequences.empty())
721 return false;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000722 uint64_t EndAddr = Address + Size;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000723 // First, find an instruction sequence containing the given address.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000724 DWARFDebugLine::Sequence Sequence;
725 Sequence.LowPC = Address;
726 SequenceIter FirstSeq = Sequences.begin();
727 SequenceIter LastSeq = Sequences.end();
728 SequenceIter SeqPos = std::lower_bound(
729 FirstSeq, LastSeq, Sequence, DWARFDebugLine::Sequence::orderByLowPC);
730 if (SeqPos == LastSeq || SeqPos->LowPC != Address) {
731 if (SeqPos == FirstSeq)
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000732 return false;
Paul Robinson9d4eb692017-05-01 23:27:55 +0000733 SeqPos--;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000734 }
Paul Robinson9d4eb692017-05-01 23:27:55 +0000735 if (!SeqPos->containsPC(Address))
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000736 return false;
737
Paul Robinson9d4eb692017-05-01 23:27:55 +0000738 SequenceIter StartPos = SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000739
740 // Add the rows from the first sequence to the vector, starting with the
741 // index we just calculated
742
Paul Robinson9d4eb692017-05-01 23:27:55 +0000743 while (SeqPos != LastSeq && SeqPos->LowPC < EndAddr) {
744 const DWARFDebugLine::Sequence &CurSeq = *SeqPos;
Keno Fischerc2c60182015-05-31 23:37:04 +0000745 // For the first sequence, we need to find which row in the sequence is the
746 // first in our range.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000747 uint32_t FirstRowIndex = CurSeq.FirstRowIndex;
748 if (SeqPos == StartPos)
749 FirstRowIndex = findRowInSeq(CurSeq, Address);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000750
Keno Fischerc2c60182015-05-31 23:37:04 +0000751 // Figure out the last row in the range.
Paul Robinson9d4eb692017-05-01 23:27:55 +0000752 uint32_t LastRowIndex = findRowInSeq(CurSeq, EndAddr - 1);
753 if (LastRowIndex == UnknownRowIndex)
754 LastRowIndex = CurSeq.LastRowIndex - 1;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000755
Paul Robinson9d4eb692017-05-01 23:27:55 +0000756 assert(FirstRowIndex != UnknownRowIndex);
757 assert(LastRowIndex != UnknownRowIndex);
Keno Fischerc2c60182015-05-31 23:37:04 +0000758
Paul Robinson9d4eb692017-05-01 23:27:55 +0000759 for (uint32_t I = FirstRowIndex; I <= LastRowIndex; ++I) {
760 Result.push_back(I);
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000761 }
762
Paul Robinson9d4eb692017-05-01 23:27:55 +0000763 ++SeqPos;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000764 }
NAKAMURA Takumi4b86cdb2013-01-26 01:45:06 +0000765
766 return true;
Andrew Kaylor9a8ff812013-01-26 00:28:05 +0000767}
768
Paul Robinson9d4eb692017-05-01 23:27:55 +0000769bool DWARFDebugLine::LineTable::hasFileAtIndex(uint64_t FileIndex) const {
Pete Cooperb2ba7762016-07-22 01:41:32 +0000770 return FileIndex != 0 && FileIndex <= Prologue.FileNames.size();
771}
772
Paul Robinson9d4eb692017-05-01 23:27:55 +0000773bool DWARFDebugLine::LineTable::getFileNameByIndex(uint64_t FileIndex,
774 const char *CompDir,
775 FileLineInfoKind Kind,
776 std::string &Result) const {
Pete Cooperb2ba7762016-07-22 01:41:32 +0000777 if (Kind == FileLineInfoKind::None || !hasFileAtIndex(FileIndex))
Alexey Samsonov45be7932012-08-30 07:49:50 +0000778 return false;
779 const FileNameEntry &Entry = Prologue.FileNames[FileIndex - 1];
Paul Robinsonba1c9152017-05-02 17:37:32 +0000780 StringRef FileName = Entry.Name;
Alexey Samsonovdce67342014-05-15 21:24:32 +0000781 if (Kind != FileLineInfoKind::AbsoluteFilePath ||
Alexey Samsonov45be7932012-08-30 07:49:50 +0000782 sys::path::is_absolute(FileName)) {
783 Result = FileName;
784 return true;
785 }
Frederic Riss101b5e22014-09-19 15:11:51 +0000786
Alexey Samsonov45be7932012-08-30 07:49:50 +0000787 SmallString<16> FilePath;
788 uint64_t IncludeDirIndex = Entry.DirIdx;
Paul Robinsonba1c9152017-05-02 17:37:32 +0000789 StringRef IncludeDir;
Alexey Samsonov45be7932012-08-30 07:49:50 +0000790 // Be defensive about the contents of Entry.
791 if (IncludeDirIndex > 0 &&
Frederic Riss101b5e22014-09-19 15:11:51 +0000792 IncludeDirIndex <= Prologue.IncludeDirectories.size())
793 IncludeDir = Prologue.IncludeDirectories[IncludeDirIndex - 1];
794
795 // We may still need to append compilation directory of compile unit.
796 // We know that FileName is not absolute, the only way to have an
797 // absolute path at this point would be if IncludeDir is absolute.
798 if (CompDir && Kind == FileLineInfoKind::AbsoluteFilePath &&
799 sys::path::is_relative(IncludeDir))
800 sys::path::append(FilePath, CompDir);
801
802 // sys::path::append skips empty strings.
803 sys::path::append(FilePath, IncludeDir, FileName);
Alexey Samsonov45be7932012-08-30 07:49:50 +0000804 Result = FilePath.str();
805 return true;
806}
Frederic Riss101b5e22014-09-19 15:11:51 +0000807
Dehao Chen1b54fce2016-04-28 22:09:37 +0000808bool DWARFDebugLine::LineTable::getFileLineInfoForAddress(
809 uint64_t Address, const char *CompDir, FileLineInfoKind Kind,
810 DILineInfo &Result) const {
Frederic Riss101b5e22014-09-19 15:11:51 +0000811 // Get the index of row we're looking for in the line table.
812 uint32_t RowIndex = lookupAddress(Address);
813 if (RowIndex == -1U)
814 return false;
815 // Take file number and line/column from the row.
816 const auto &Row = Rows[RowIndex];
817 if (!getFileNameByIndex(Row.File, CompDir, Kind, Result.FileName))
818 return false;
819 Result.Line = Row.Line;
820 Result.Column = Row.Column;
Eric Christopherba1024c2016-12-14 18:29:39 +0000821 Result.Discriminator = Row.Discriminator;
Frederic Riss101b5e22014-09-19 15:11:51 +0000822 return true;
823}