1 //===- DWARFDebugLine.cpp -------------------------------------------------===// 2 // 3 // 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 6 // 7 //===----------------------------------------------------------------------===// 8 9 #include "llvm/DebugInfo/DWARF/DWARFDebugLine.h" 10 #include "llvm/ADT/Optional.h" 11 #include "llvm/ADT/SmallString.h" 12 #include "llvm/ADT/SmallVector.h" 13 #include "llvm/ADT/StringRef.h" 14 #include "llvm/BinaryFormat/Dwarf.h" 15 #include "llvm/DebugInfo/DWARF/DWARFFormValue.h" 16 #include "llvm/DebugInfo/DWARF/DWARFRelocMap.h" 17 #include "llvm/Support/Errc.h" 18 #include "llvm/Support/Format.h" 19 #include "llvm/Support/FormatVariadic.h" 20 #include "llvm/Support/WithColor.h" 21 #include "llvm/Support/raw_ostream.h" 22 #include <algorithm> 23 #include <cassert> 24 #include <cinttypes> 25 #include <cstdint> 26 #include <cstdio> 27 #include <utility> 28 29 using namespace llvm; 30 using namespace dwarf; 31 32 using FileLineInfoKind = DILineInfoSpecifier::FileLineInfoKind; 33 34 namespace { 35 36 struct ContentDescriptor { 37 dwarf::LineNumberEntryFormat Type; 38 dwarf::Form Form; 39 }; 40 41 using ContentDescriptors = SmallVector<ContentDescriptor, 4>; 42 43 } // end anonymous namespace 44 45 static bool versionIsSupported(uint16_t Version) { 46 return Version >= 2 && Version <= 5; 47 } 48 49 void DWARFDebugLine::ContentTypeTracker::trackContentType( 50 dwarf::LineNumberEntryFormat ContentType) { 51 switch (ContentType) { 52 case dwarf::DW_LNCT_timestamp: 53 HasModTime = true; 54 break; 55 case dwarf::DW_LNCT_size: 56 HasLength = true; 57 break; 58 case dwarf::DW_LNCT_MD5: 59 HasMD5 = true; 60 break; 61 case dwarf::DW_LNCT_LLVM_source: 62 HasSource = true; 63 break; 64 default: 65 // We only care about values we consider optional, and new values may be 66 // added in the vendor extension range, so we do not match exhaustively. 67 break; 68 } 69 } 70 71 DWARFDebugLine::Prologue::Prologue() { clear(); } 72 73 bool DWARFDebugLine::Prologue::hasFileAtIndex(uint64_t FileIndex) const { 74 uint16_t DwarfVersion = getVersion(); 75 assert(DwarfVersion != 0 && 76 "line table prologue has no dwarf version information"); 77 if (DwarfVersion >= 5) 78 return FileIndex < FileNames.size(); 79 return FileIndex != 0 && FileIndex <= FileNames.size(); 80 } 81 82 const llvm::DWARFDebugLine::FileNameEntry & 83 DWARFDebugLine::Prologue::getFileNameEntry(uint64_t Index) const { 84 uint16_t DwarfVersion = getVersion(); 85 assert(DwarfVersion != 0 && 86 "line table prologue has no dwarf version information"); 87 // In DWARF v5 the file names are 0-indexed. 88 if (DwarfVersion >= 5) 89 return FileNames[Index]; 90 return FileNames[Index - 1]; 91 } 92 93 void DWARFDebugLine::Prologue::clear() { 94 TotalLength = PrologueLength = 0; 95 SegSelectorSize = 0; 96 MinInstLength = MaxOpsPerInst = DefaultIsStmt = LineBase = LineRange = 0; 97 OpcodeBase = 0; 98 FormParams = dwarf::FormParams({0, 0, DWARF32}); 99 ContentTypes = ContentTypeTracker(); 100 StandardOpcodeLengths.clear(); 101 IncludeDirectories.clear(); 102 FileNames.clear(); 103 } 104 105 void DWARFDebugLine::Prologue::dump(raw_ostream &OS, 106 DIDumpOptions DumpOptions) const { 107 if (!totalLengthIsValid()) 108 return; 109 int OffsetDumpWidth = 2 * dwarf::getDwarfOffsetByteSize(FormParams.Format); 110 OS << "Line table prologue:\n" 111 << format(" total_length: 0x%0*" PRIx64 "\n", OffsetDumpWidth, 112 TotalLength) 113 << " format: " << dwarf::FormatString(FormParams.Format) << "\n" 114 << format(" version: %u\n", getVersion()); 115 if (!versionIsSupported(getVersion())) 116 return; 117 if (getVersion() >= 5) 118 OS << format(" address_size: %u\n", getAddressSize()) 119 << format(" seg_select_size: %u\n", SegSelectorSize); 120 OS << format(" prologue_length: 0x%0*" PRIx64 "\n", OffsetDumpWidth, 121 PrologueLength) 122 << format(" min_inst_length: %u\n", MinInstLength) 123 << format(getVersion() >= 4 ? "max_ops_per_inst: %u\n" : "", MaxOpsPerInst) 124 << format(" default_is_stmt: %u\n", DefaultIsStmt) 125 << format(" line_base: %i\n", LineBase) 126 << format(" line_range: %u\n", LineRange) 127 << format(" opcode_base: %u\n", OpcodeBase); 128 129 for (uint32_t I = 0; I != StandardOpcodeLengths.size(); ++I) 130 OS << formatv("standard_opcode_lengths[{0}] = {1}\n", 131 static_cast<dwarf::LineNumberOps>(I + 1), 132 StandardOpcodeLengths[I]); 133 134 if (!IncludeDirectories.empty()) { 135 // DWARF v5 starts directory indexes at 0. 136 uint32_t DirBase = getVersion() >= 5 ? 0 : 1; 137 for (uint32_t I = 0; I != IncludeDirectories.size(); ++I) { 138 OS << format("include_directories[%3u] = ", I + DirBase); 139 IncludeDirectories[I].dump(OS, DumpOptions); 140 OS << '\n'; 141 } 142 } 143 144 if (!FileNames.empty()) { 145 // DWARF v5 starts file indexes at 0. 146 uint32_t FileBase = getVersion() >= 5 ? 0 : 1; 147 for (uint32_t I = 0; I != FileNames.size(); ++I) { 148 const FileNameEntry &FileEntry = FileNames[I]; 149 OS << format("file_names[%3u]:\n", I + FileBase); 150 OS << " name: "; 151 FileEntry.Name.dump(OS, DumpOptions); 152 OS << '\n' 153 << format(" dir_index: %" PRIu64 "\n", FileEntry.DirIdx); 154 if (ContentTypes.HasMD5) 155 OS << " md5_checksum: " << FileEntry.Checksum.digest() << '\n'; 156 if (ContentTypes.HasModTime) 157 OS << format(" mod_time: 0x%8.8" PRIx64 "\n", FileEntry.ModTime); 158 if (ContentTypes.HasLength) 159 OS << format(" length: 0x%8.8" PRIx64 "\n", FileEntry.Length); 160 if (ContentTypes.HasSource) { 161 OS << " source: "; 162 FileEntry.Source.dump(OS, DumpOptions); 163 OS << '\n'; 164 } 165 } 166 } 167 } 168 169 // Parse v2-v4 directory and file tables. 170 static Error 171 parseV2DirFileTables(const DWARFDataExtractor &DebugLineData, 172 uint64_t *OffsetPtr, 173 DWARFDebugLine::ContentTypeTracker &ContentTypes, 174 std::vector<DWARFFormValue> &IncludeDirectories, 175 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) { 176 while (true) { 177 Error Err = Error::success(); 178 StringRef S = DebugLineData.getCStrRef(OffsetPtr, &Err); 179 if (Err) { 180 consumeError(std::move(Err)); 181 return createStringError(errc::invalid_argument, 182 "include directories table was not null " 183 "terminated before the end of the prologue"); 184 } 185 if (S.empty()) 186 break; 187 DWARFFormValue Dir = 188 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, S.data()); 189 IncludeDirectories.push_back(Dir); 190 } 191 192 ContentTypes.HasModTime = true; 193 ContentTypes.HasLength = true; 194 195 while (true) { 196 Error Err = Error::success(); 197 StringRef Name = DebugLineData.getCStrRef(OffsetPtr, &Err); 198 if (!Err && Name.empty()) 199 break; 200 201 DWARFDebugLine::FileNameEntry FileEntry; 202 FileEntry.Name = 203 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name.data()); 204 FileEntry.DirIdx = DebugLineData.getULEB128(OffsetPtr, &Err); 205 FileEntry.ModTime = DebugLineData.getULEB128(OffsetPtr, &Err); 206 FileEntry.Length = DebugLineData.getULEB128(OffsetPtr, &Err); 207 208 if (Err) { 209 consumeError(std::move(Err)); 210 return createStringError( 211 errc::invalid_argument, 212 "file names table was not null terminated before " 213 "the end of the prologue"); 214 } 215 FileNames.push_back(FileEntry); 216 } 217 218 return Error::success(); 219 } 220 221 // Parse v5 directory/file entry content descriptions. 222 // Returns the descriptors, or an error if we did not find a path or ran off 223 // the end of the prologue. 224 static llvm::Expected<ContentDescriptors> 225 parseV5EntryFormat(const DWARFDataExtractor &DebugLineData, uint64_t *OffsetPtr, 226 DWARFDebugLine::ContentTypeTracker *ContentTypes) { 227 Error Err = Error::success(); 228 ContentDescriptors Descriptors; 229 int FormatCount = DebugLineData.getU8(OffsetPtr, &Err); 230 bool HasPath = false; 231 for (int I = 0; I != FormatCount && !Err; ++I) { 232 ContentDescriptor Descriptor; 233 Descriptor.Type = 234 dwarf::LineNumberEntryFormat(DebugLineData.getULEB128(OffsetPtr, &Err)); 235 Descriptor.Form = dwarf::Form(DebugLineData.getULEB128(OffsetPtr, &Err)); 236 if (Descriptor.Type == dwarf::DW_LNCT_path) 237 HasPath = true; 238 if (ContentTypes) 239 ContentTypes->trackContentType(Descriptor.Type); 240 Descriptors.push_back(Descriptor); 241 } 242 243 if (Err) 244 return createStringError(errc::invalid_argument, 245 "failed to parse entry content descriptors: %s", 246 toString(std::move(Err)).c_str()); 247 248 if (!HasPath) 249 return createStringError(errc::invalid_argument, 250 "failed to parse entry content descriptions" 251 " because no path was found"); 252 return Descriptors; 253 } 254 255 static Error 256 parseV5DirFileTables(const DWARFDataExtractor &DebugLineData, 257 uint64_t *OffsetPtr, const dwarf::FormParams &FormParams, 258 const DWARFContext &Ctx, const DWARFUnit *U, 259 DWARFDebugLine::ContentTypeTracker &ContentTypes, 260 std::vector<DWARFFormValue> &IncludeDirectories, 261 std::vector<DWARFDebugLine::FileNameEntry> &FileNames) { 262 // Get the directory entry description. 263 llvm::Expected<ContentDescriptors> DirDescriptors = 264 parseV5EntryFormat(DebugLineData, OffsetPtr, nullptr); 265 if (!DirDescriptors) 266 return DirDescriptors.takeError(); 267 268 // Get the directory entries, according to the format described above. 269 uint64_t DirEntryCount = DebugLineData.getULEB128(OffsetPtr); 270 for (uint64_t I = 0; I != DirEntryCount; ++I) { 271 for (auto Descriptor : *DirDescriptors) { 272 DWARFFormValue Value(Descriptor.Form); 273 switch (Descriptor.Type) { 274 case DW_LNCT_path: 275 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U)) 276 return createStringError(errc::invalid_argument, 277 "failed to parse directory entry because " 278 "extracting the form value failed."); 279 IncludeDirectories.push_back(Value); 280 break; 281 default: 282 if (!Value.skipValue(DebugLineData, OffsetPtr, FormParams)) 283 return createStringError(errc::invalid_argument, 284 "failed to parse directory entry because " 285 "skipping the form value failed."); 286 } 287 } 288 } 289 290 // Get the file entry description. 291 llvm::Expected<ContentDescriptors> FileDescriptors = 292 parseV5EntryFormat(DebugLineData, OffsetPtr, &ContentTypes); 293 if (!FileDescriptors) 294 return FileDescriptors.takeError(); 295 296 // Get the file entries, according to the format described above. 297 uint64_t FileEntryCount = DebugLineData.getULEB128(OffsetPtr); 298 for (uint64_t I = 0; I != FileEntryCount; ++I) { 299 DWARFDebugLine::FileNameEntry FileEntry; 300 for (auto Descriptor : *FileDescriptors) { 301 DWARFFormValue Value(Descriptor.Form); 302 if (!Value.extractValue(DebugLineData, OffsetPtr, FormParams, &Ctx, U)) 303 return createStringError(errc::invalid_argument, 304 "failed to parse file entry because " 305 "extracting the form value failed."); 306 switch (Descriptor.Type) { 307 case DW_LNCT_path: 308 FileEntry.Name = Value; 309 break; 310 case DW_LNCT_LLVM_source: 311 FileEntry.Source = Value; 312 break; 313 case DW_LNCT_directory_index: 314 FileEntry.DirIdx = Value.getAsUnsignedConstant().getValue(); 315 break; 316 case DW_LNCT_timestamp: 317 FileEntry.ModTime = Value.getAsUnsignedConstant().getValue(); 318 break; 319 case DW_LNCT_size: 320 FileEntry.Length = Value.getAsUnsignedConstant().getValue(); 321 break; 322 case DW_LNCT_MD5: 323 if (!Value.getAsBlock() || Value.getAsBlock().getValue().size() != 16) 324 return createStringError( 325 errc::invalid_argument, 326 "failed to parse file entry because the MD5 hash is invalid"); 327 std::uninitialized_copy_n(Value.getAsBlock().getValue().begin(), 16, 328 FileEntry.Checksum.Bytes.begin()); 329 break; 330 default: 331 break; 332 } 333 } 334 FileNames.push_back(FileEntry); 335 } 336 return Error::success(); 337 } 338 339 uint64_t DWARFDebugLine::Prologue::getLength() const { 340 uint64_t Length = PrologueLength + sizeofTotalLength() + 341 sizeof(getVersion()) + sizeofPrologueLength(); 342 if (getVersion() >= 5) 343 Length += 2; // Address + Segment selector sizes. 344 return Length; 345 } 346 347 Error DWARFDebugLine::Prologue::parse( 348 DWARFDataExtractor DebugLineData, uint64_t *OffsetPtr, 349 function_ref<void(Error)> RecoverableErrorHandler, const DWARFContext &Ctx, 350 const DWARFUnit *U) { 351 const uint64_t PrologueOffset = *OffsetPtr; 352 353 clear(); 354 Error Err = Error::success(); 355 std::tie(TotalLength, FormParams.Format) = 356 DebugLineData.getInitialLength(OffsetPtr, &Err); 357 if (Err) 358 return createStringError( 359 errc::invalid_argument, 360 "parsing line table prologue at offset 0x%8.8" PRIx64 ": %s", 361 PrologueOffset, toString(std::move(Err)).c_str()); 362 363 DebugLineData = DWARFDataExtractor(DebugLineData, *OffsetPtr + TotalLength); 364 FormParams.Version = DebugLineData.getU16(OffsetPtr); 365 if (!versionIsSupported(getVersion())) 366 // Treat this error as unrecoverable - we cannot be sure what any of 367 // the data represents including the length field, so cannot skip it or make 368 // any reasonable assumptions. 369 return createStringError( 370 errc::not_supported, 371 "parsing line table prologue at offset 0x%8.8" PRIx64 372 ": unsupported version %" PRIu16, 373 PrologueOffset, getVersion()); 374 375 if (getVersion() >= 5) { 376 FormParams.AddrSize = DebugLineData.getU8(OffsetPtr); 377 assert((DebugLineData.getAddressSize() == 0 || 378 DebugLineData.getAddressSize() == getAddressSize()) && 379 "Line table header and data extractor disagree"); 380 SegSelectorSize = DebugLineData.getU8(OffsetPtr); 381 } 382 383 PrologueLength = 384 DebugLineData.getRelocatedValue(sizeofPrologueLength(), OffsetPtr); 385 const uint64_t EndPrologueOffset = PrologueLength + *OffsetPtr; 386 DebugLineData = DWARFDataExtractor(DebugLineData, EndPrologueOffset); 387 MinInstLength = DebugLineData.getU8(OffsetPtr); 388 if (getVersion() >= 4) 389 MaxOpsPerInst = DebugLineData.getU8(OffsetPtr); 390 DefaultIsStmt = DebugLineData.getU8(OffsetPtr); 391 LineBase = DebugLineData.getU8(OffsetPtr); 392 LineRange = DebugLineData.getU8(OffsetPtr); 393 OpcodeBase = DebugLineData.getU8(OffsetPtr); 394 395 if (OpcodeBase == 0) { 396 // If the opcode base is 0, we cannot read the standard opcode lengths (of 397 // which there are supposed to be one fewer than the opcode base). Assume 398 // there are no standard opcodes and continue parsing. 399 RecoverableErrorHandler(createStringError( 400 errc::invalid_argument, 401 "parsing line table prologue at offset 0x%8.8" PRIx64 402 " found opcode base of 0. Assuming no standard opcodes", 403 PrologueOffset)); 404 } else { 405 StandardOpcodeLengths.reserve(OpcodeBase - 1); 406 for (uint32_t I = 1; I < OpcodeBase; ++I) { 407 uint8_t OpLen = DebugLineData.getU8(OffsetPtr); 408 StandardOpcodeLengths.push_back(OpLen); 409 } 410 } 411 412 Error E = 413 getVersion() >= 5 414 ? parseV5DirFileTables(DebugLineData, OffsetPtr, FormParams, Ctx, U, 415 ContentTypes, IncludeDirectories, FileNames) 416 : parseV2DirFileTables(DebugLineData, OffsetPtr, ContentTypes, 417 IncludeDirectories, FileNames); 418 if (E) { 419 RecoverableErrorHandler(joinErrors( 420 createStringError( 421 errc::invalid_argument, 422 "parsing line table prologue at 0x%8.8" PRIx64 423 " found an invalid directory or file table description at" 424 " 0x%8.8" PRIx64, 425 PrologueOffset, *OffsetPtr), 426 std::move(E))); 427 return Error::success(); 428 } 429 430 assert(*OffsetPtr <= EndPrologueOffset); 431 if (*OffsetPtr != EndPrologueOffset) { 432 RecoverableErrorHandler(createStringError( 433 errc::invalid_argument, 434 "unknown data in line table prologue at offset 0x%8.8" PRIx64 435 ": parsing ended (at offset 0x%8.8" PRIx64 436 ") before reaching the prologue end at offset 0x%8.8" PRIx64, 437 PrologueOffset, *OffsetPtr, EndPrologueOffset)); 438 } 439 return Error::success(); 440 } 441 442 DWARFDebugLine::Row::Row(bool DefaultIsStmt) { reset(DefaultIsStmt); } 443 444 void DWARFDebugLine::Row::postAppend() { 445 Discriminator = 0; 446 BasicBlock = false; 447 PrologueEnd = false; 448 EpilogueBegin = false; 449 } 450 451 void DWARFDebugLine::Row::reset(bool DefaultIsStmt) { 452 Address.Address = 0; 453 Address.SectionIndex = object::SectionedAddress::UndefSection; 454 Line = 1; 455 Column = 0; 456 File = 1; 457 Isa = 0; 458 Discriminator = 0; 459 IsStmt = DefaultIsStmt; 460 BasicBlock = false; 461 EndSequence = false; 462 PrologueEnd = false; 463 EpilogueBegin = false; 464 } 465 466 void DWARFDebugLine::Row::dumpTableHeader(raw_ostream &OS, unsigned Indent) { 467 OS.indent(Indent) 468 << "Address Line Column File ISA Discriminator Flags\n"; 469 OS.indent(Indent) 470 << "------------------ ------ ------ ------ --- ------------- " 471 "-------------\n"; 472 } 473 474 void DWARFDebugLine::Row::dump(raw_ostream &OS) const { 475 OS << format("0x%16.16" PRIx64 " %6u %6u", Address.Address, Line, Column) 476 << format(" %6u %3u %13u ", File, Isa, Discriminator) 477 << (IsStmt ? " is_stmt" : "") << (BasicBlock ? " basic_block" : "") 478 << (PrologueEnd ? " prologue_end" : "") 479 << (EpilogueBegin ? " epilogue_begin" : "") 480 << (EndSequence ? " end_sequence" : "") << '\n'; 481 } 482 483 DWARFDebugLine::Sequence::Sequence() { reset(); } 484 485 void DWARFDebugLine::Sequence::reset() { 486 LowPC = 0; 487 HighPC = 0; 488 SectionIndex = object::SectionedAddress::UndefSection; 489 FirstRowIndex = 0; 490 LastRowIndex = 0; 491 Empty = true; 492 } 493 494 DWARFDebugLine::LineTable::LineTable() { clear(); } 495 496 void DWARFDebugLine::LineTable::dump(raw_ostream &OS, 497 DIDumpOptions DumpOptions) const { 498 Prologue.dump(OS, DumpOptions); 499 500 if (!Rows.empty()) { 501 OS << '\n'; 502 Row::dumpTableHeader(OS, 0); 503 for (const Row &R : Rows) { 504 R.dump(OS); 505 } 506 } 507 508 // Terminate the table with a final blank line to clearly delineate it from 509 // later dumps. 510 OS << '\n'; 511 } 512 513 void DWARFDebugLine::LineTable::clear() { 514 Prologue.clear(); 515 Rows.clear(); 516 Sequences.clear(); 517 } 518 519 DWARFDebugLine::ParsingState::ParsingState( 520 struct LineTable *LT, uint64_t TableOffset, 521 function_ref<void(Error)> ErrorHandler) 522 : LineTable(LT), LineTableOffset(TableOffset), ErrorHandler(ErrorHandler) { 523 resetRowAndSequence(); 524 } 525 526 void DWARFDebugLine::ParsingState::resetRowAndSequence() { 527 Row.reset(LineTable->Prologue.DefaultIsStmt); 528 Sequence.reset(); 529 } 530 531 void DWARFDebugLine::ParsingState::appendRowToMatrix() { 532 unsigned RowNumber = LineTable->Rows.size(); 533 if (Sequence.Empty) { 534 // Record the beginning of instruction sequence. 535 Sequence.Empty = false; 536 Sequence.LowPC = Row.Address.Address; 537 Sequence.FirstRowIndex = RowNumber; 538 } 539 LineTable->appendRow(Row); 540 if (Row.EndSequence) { 541 // Record the end of instruction sequence. 542 Sequence.HighPC = Row.Address.Address; 543 Sequence.LastRowIndex = RowNumber + 1; 544 Sequence.SectionIndex = Row.Address.SectionIndex; 545 if (Sequence.isValid()) 546 LineTable->appendSequence(Sequence); 547 Sequence.reset(); 548 } 549 Row.postAppend(); 550 } 551 552 const DWARFDebugLine::LineTable * 553 DWARFDebugLine::getLineTable(uint64_t Offset) const { 554 LineTableConstIter Pos = LineTableMap.find(Offset); 555 if (Pos != LineTableMap.end()) 556 return &Pos->second; 557 return nullptr; 558 } 559 560 Expected<const DWARFDebugLine::LineTable *> DWARFDebugLine::getOrParseLineTable( 561 DWARFDataExtractor &DebugLineData, uint64_t Offset, const DWARFContext &Ctx, 562 const DWARFUnit *U, function_ref<void(Error)> RecoverableErrorHandler) { 563 if (!DebugLineData.isValidOffset(Offset)) 564 return createStringError(errc::invalid_argument, "offset 0x%8.8" PRIx64 565 " is not a valid debug line section offset", 566 Offset); 567 568 std::pair<LineTableIter, bool> Pos = 569 LineTableMap.insert(LineTableMapTy::value_type(Offset, LineTable())); 570 LineTable *LT = &Pos.first->second; 571 if (Pos.second) { 572 if (Error Err = 573 LT->parse(DebugLineData, &Offset, Ctx, U, RecoverableErrorHandler)) 574 return std::move(Err); 575 return LT; 576 } 577 return LT; 578 } 579 580 static StringRef getOpcodeName(uint8_t Opcode, uint8_t OpcodeBase) { 581 assert(Opcode != 0); 582 if (Opcode < OpcodeBase) 583 return LNStandardString(Opcode); 584 return "special"; 585 } 586 587 uint64_t DWARFDebugLine::ParsingState::advanceAddr(uint64_t OperationAdvance, 588 uint8_t Opcode, 589 uint64_t OpcodeOffset) { 590 StringRef OpcodeName = getOpcodeName(Opcode, LineTable->Prologue.OpcodeBase); 591 // For versions less than 4, the MaxOpsPerInst member is set to 0, as the 592 // maximum_operations_per_instruction field wasn't introduced until DWARFv4. 593 // Don't warn about bad values in this situation. 594 if (ReportAdvanceAddrProblem && LineTable->Prologue.getVersion() >= 4 && 595 LineTable->Prologue.MaxOpsPerInst != 1) 596 ErrorHandler(createStringError( 597 errc::not_supported, 598 "line table program at offset 0x%8.8" PRIx64 599 " contains a %s opcode at offset 0x%8.8" PRIx64 600 ", but the prologue maximum_operations_per_instruction value is %" PRId8 601 ", which is unsupported. Assuming a value of 1 instead", 602 LineTableOffset, OpcodeName.data(), OpcodeOffset, 603 LineTable->Prologue.MaxOpsPerInst)); 604 if (ReportAdvanceAddrProblem && LineTable->Prologue.MinInstLength == 0) 605 ErrorHandler( 606 createStringError(errc::invalid_argument, 607 "line table program at offset 0x%8.8" PRIx64 608 " contains a %s opcode at offset 0x%8.8" PRIx64 609 ", but the prologue minimum_instruction_length value " 610 "is 0, which prevents any address advancing", 611 LineTableOffset, OpcodeName.data(), OpcodeOffset)); 612 ReportAdvanceAddrProblem = false; 613 uint64_t AddrOffset = OperationAdvance * LineTable->Prologue.MinInstLength; 614 Row.Address.Address += AddrOffset; 615 return AddrOffset; 616 } 617 618 DWARFDebugLine::ParsingState::AddrAndAdjustedOpcode 619 DWARFDebugLine::ParsingState::advanceAddrForOpcode(uint8_t Opcode, 620 uint64_t OpcodeOffset) { 621 assert(Opcode == DW_LNS_const_add_pc || 622 Opcode >= LineTable->Prologue.OpcodeBase); 623 if (ReportBadLineRange && LineTable->Prologue.LineRange == 0) { 624 StringRef OpcodeName = 625 getOpcodeName(Opcode, LineTable->Prologue.OpcodeBase); 626 ErrorHandler( 627 createStringError(errc::not_supported, 628 "line table program at offset 0x%8.8" PRIx64 629 " contains a %s opcode at offset 0x%8.8" PRIx64 630 ", but the prologue line_range value is 0. The " 631 "address and line will not be adjusted", 632 LineTableOffset, OpcodeName.data(), OpcodeOffset)); 633 ReportBadLineRange = false; 634 } 635 636 uint8_t OpcodeValue = Opcode; 637 if (Opcode == DW_LNS_const_add_pc) 638 OpcodeValue = 255; 639 uint8_t AdjustedOpcode = OpcodeValue - LineTable->Prologue.OpcodeBase; 640 uint64_t OperationAdvance = 641 LineTable->Prologue.LineRange != 0 642 ? AdjustedOpcode / LineTable->Prologue.LineRange 643 : 0; 644 uint64_t AddrOffset = advanceAddr(OperationAdvance, Opcode, OpcodeOffset); 645 return {AddrOffset, AdjustedOpcode}; 646 } 647 648 DWARFDebugLine::ParsingState::AddrAndLineDelta 649 DWARFDebugLine::ParsingState::handleSpecialOpcode(uint8_t Opcode, 650 uint64_t OpcodeOffset) { 651 // A special opcode value is chosen based on the amount that needs 652 // to be added to the line and address registers. The maximum line 653 // increment for a special opcode is the value of the line_base 654 // field in the header, plus the value of the line_range field, 655 // minus 1 (line base + line range - 1). If the desired line 656 // increment is greater than the maximum line increment, a standard 657 // opcode must be used instead of a special opcode. The "address 658 // advance" is calculated by dividing the desired address increment 659 // by the minimum_instruction_length field from the header. The 660 // special opcode is then calculated using the following formula: 661 // 662 // opcode = (desired line increment - line_base) + 663 // (line_range * address advance) + opcode_base 664 // 665 // If the resulting opcode is greater than 255, a standard opcode 666 // must be used instead. 667 // 668 // To decode a special opcode, subtract the opcode_base from the 669 // opcode itself to give the adjusted opcode. The amount to 670 // increment the address register is the result of the adjusted 671 // opcode divided by the line_range multiplied by the 672 // minimum_instruction_length field from the header. That is: 673 // 674 // address increment = (adjusted opcode / line_range) * 675 // minimum_instruction_length 676 // 677 // The amount to increment the line register is the line_base plus 678 // the result of the adjusted opcode modulo the line_range. That is: 679 // 680 // line increment = line_base + (adjusted opcode % line_range) 681 682 DWARFDebugLine::ParsingState::AddrAndAdjustedOpcode AddrAdvanceResult = 683 advanceAddrForOpcode(Opcode, OpcodeOffset); 684 int32_t LineOffset = 0; 685 if (LineTable->Prologue.LineRange != 0) 686 LineOffset = 687 LineTable->Prologue.LineBase + 688 (AddrAdvanceResult.AdjustedOpcode % LineTable->Prologue.LineRange); 689 Row.Line += LineOffset; 690 return {AddrAdvanceResult.AddrDelta, LineOffset}; 691 } 692 693 Error DWARFDebugLine::LineTable::parse( 694 DWARFDataExtractor &DebugLineData, uint64_t *OffsetPtr, 695 const DWARFContext &Ctx, const DWARFUnit *U, 696 function_ref<void(Error)> RecoverableErrorHandler, raw_ostream *OS, 697 bool Verbose) { 698 assert((OS || !Verbose) && "cannot have verbose output without stream"); 699 const uint64_t DebugLineOffset = *OffsetPtr; 700 701 clear(); 702 703 Error PrologueErr = 704 Prologue.parse(DebugLineData, OffsetPtr, RecoverableErrorHandler, Ctx, U); 705 706 if (OS) { 707 DIDumpOptions DumpOptions; 708 DumpOptions.Verbose = Verbose; 709 Prologue.dump(*OS, DumpOptions); 710 } 711 712 if (PrologueErr) { 713 // Ensure there is a blank line after the prologue to clearly delineate it 714 // from later dumps. 715 if (OS) 716 *OS << "\n"; 717 return PrologueErr; 718 } 719 720 uint64_t ProgramLength = Prologue.TotalLength + Prologue.sizeofTotalLength(); 721 if (!DebugLineData.isValidOffsetForDataOfSize(DebugLineOffset, 722 ProgramLength)) { 723 assert(DebugLineData.size() > DebugLineOffset && 724 "prologue parsing should handle invalid offset"); 725 uint64_t BytesRemaining = DebugLineData.size() - DebugLineOffset; 726 RecoverableErrorHandler( 727 createStringError(errc::invalid_argument, 728 "line table program with offset 0x%8.8" PRIx64 729 " has length 0x%8.8" PRIx64 " but only 0x%8.8" PRIx64 730 " bytes are available", 731 DebugLineOffset, ProgramLength, BytesRemaining)); 732 // Continue by capping the length at the number of remaining bytes. 733 ProgramLength = BytesRemaining; 734 } 735 736 // Create a DataExtractor which can only see the data up to the end of the 737 // table, to prevent reading past the end. 738 const uint64_t EndOffset = DebugLineOffset + ProgramLength; 739 DWARFDataExtractor TableData(DebugLineData, EndOffset); 740 741 // See if we should tell the data extractor the address size. 742 if (TableData.getAddressSize() == 0) 743 TableData.setAddressSize(Prologue.getAddressSize()); 744 else 745 assert(Prologue.getAddressSize() == 0 || 746 Prologue.getAddressSize() == TableData.getAddressSize()); 747 748 ParsingState State(this, DebugLineOffset, RecoverableErrorHandler); 749 750 *OffsetPtr = DebugLineOffset + Prologue.getLength(); 751 if (OS && *OffsetPtr < EndOffset) { 752 *OS << '\n'; 753 Row::dumpTableHeader(*OS, /*Indent=*/Verbose ? 12 : 0); 754 } 755 while (*OffsetPtr < EndOffset) { 756 if (Verbose) 757 *OS << format("0x%08.08" PRIx64 ": ", *OffsetPtr); 758 759 uint64_t OpcodeOffset = *OffsetPtr; 760 uint8_t Opcode = TableData.getU8(OffsetPtr); 761 size_t RowCount = Rows.size(); 762 763 if (Verbose) 764 *OS << format("%02.02" PRIx8 " ", Opcode); 765 766 if (Opcode == 0) { 767 // Extended Opcodes always start with a zero opcode followed by 768 // a uleb128 length so you can skip ones you don't know about 769 DataExtractor::Cursor Cursor(*OffsetPtr); 770 uint64_t Len = TableData.getULEB128(Cursor); 771 uint64_t ExtOffset = Cursor.tell(); 772 773 // Tolerate zero-length; assume length is correct and soldier on. 774 if (Len == 0) { 775 if (Verbose) 776 *OS << "Badly formed extended line op (length 0)\n"; 777 if (!Cursor) 778 RecoverableErrorHandler(Cursor.takeError()); 779 *OffsetPtr = Cursor.tell(); 780 continue; 781 } 782 783 uint8_t SubOpcode = TableData.getU8(Cursor); 784 if (Verbose) 785 *OS << LNExtendedString(SubOpcode); 786 switch (SubOpcode) { 787 case DW_LNE_end_sequence: 788 // Set the end_sequence register of the state machine to true and 789 // append a row to the matrix using the current values of the 790 // state-machine registers. Then reset the registers to the initial 791 // values specified above. Every statement program sequence must end 792 // with a DW_LNE_end_sequence instruction which creates a row whose 793 // address is that of the byte after the last target machine instruction 794 // of the sequence. 795 State.Row.EndSequence = true; 796 if (Verbose) { 797 *OS << "\n"; 798 OS->indent(12); 799 } 800 if (OS) 801 State.Row.dump(*OS); 802 State.appendRowToMatrix(); 803 State.resetRowAndSequence(); 804 break; 805 806 case DW_LNE_set_address: 807 // Takes a single relocatable address as an operand. The size of the 808 // operand is the size appropriate to hold an address on the target 809 // machine. Set the address register to the value given by the 810 // relocatable address. All of the other statement program opcodes 811 // that affect the address register add a delta to it. This instruction 812 // stores a relocatable value into it instead. 813 // 814 // Make sure the extractor knows the address size. If not, infer it 815 // from the size of the operand. 816 { 817 uint8_t ExtractorAddressSize = TableData.getAddressSize(); 818 uint64_t OpcodeAddressSize = Len - 1; 819 if (ExtractorAddressSize != OpcodeAddressSize && 820 ExtractorAddressSize != 0) 821 RecoverableErrorHandler(createStringError( 822 errc::invalid_argument, 823 "mismatching address size at offset 0x%8.8" PRIx64 824 " expected 0x%2.2" PRIx8 " found 0x%2.2" PRIx64, 825 ExtOffset, ExtractorAddressSize, Len - 1)); 826 827 // Assume that the line table is correct and temporarily override the 828 // address size. If the size is unsupported, give up trying to read 829 // the address and continue to the next opcode. 830 if (OpcodeAddressSize != 1 && OpcodeAddressSize != 2 && 831 OpcodeAddressSize != 4 && OpcodeAddressSize != 8) { 832 RecoverableErrorHandler(createStringError( 833 errc::invalid_argument, 834 "address size 0x%2.2" PRIx64 835 " of DW_LNE_set_address opcode at offset 0x%8.8" PRIx64 836 " is unsupported", 837 OpcodeAddressSize, ExtOffset)); 838 TableData.skip(Cursor, OpcodeAddressSize); 839 } else { 840 TableData.setAddressSize(OpcodeAddressSize); 841 State.Row.Address.Address = TableData.getRelocatedAddress( 842 Cursor, &State.Row.Address.SectionIndex); 843 844 // Restore the address size if the extractor already had it. 845 if (ExtractorAddressSize != 0) 846 TableData.setAddressSize(ExtractorAddressSize); 847 } 848 849 if (Verbose) 850 *OS << format(" (0x%16.16" PRIx64 ")", State.Row.Address.Address); 851 } 852 break; 853 854 case DW_LNE_define_file: 855 // Takes 4 arguments. The first is a null terminated string containing 856 // a source file name. The second is an unsigned LEB128 number 857 // representing the directory index of the directory in which the file 858 // was found. The third is an unsigned LEB128 number representing the 859 // time of last modification of the file. The fourth is an unsigned 860 // LEB128 number representing the length in bytes of the file. The time 861 // and length fields may contain LEB128(0) if the information is not 862 // available. 863 // 864 // The directory index represents an entry in the include_directories 865 // section of the statement program prologue. The index is LEB128(0) 866 // if the file was found in the current directory of the compilation, 867 // LEB128(1) if it was found in the first directory in the 868 // include_directories section, and so on. The directory index is 869 // ignored for file names that represent full path names. 870 // 871 // The files are numbered, starting at 1, in the order in which they 872 // appear; the names in the prologue come before names defined by 873 // the DW_LNE_define_file instruction. These numbers are used in the 874 // the file register of the state machine. 875 { 876 FileNameEntry FileEntry; 877 const char *Name = TableData.getCStr(Cursor); 878 FileEntry.Name = 879 DWARFFormValue::createFromPValue(dwarf::DW_FORM_string, Name); 880 FileEntry.DirIdx = TableData.getULEB128(Cursor); 881 FileEntry.ModTime = TableData.getULEB128(Cursor); 882 FileEntry.Length = TableData.getULEB128(Cursor); 883 Prologue.FileNames.push_back(FileEntry); 884 if (Verbose) 885 *OS << " (" << Name << ", dir=" << FileEntry.DirIdx << ", mod_time=" 886 << format("(0x%16.16" PRIx64 ")", FileEntry.ModTime) 887 << ", length=" << FileEntry.Length << ")"; 888 } 889 break; 890 891 case DW_LNE_set_discriminator: 892 State.Row.Discriminator = TableData.getULEB128(Cursor); 893 if (Verbose) 894 *OS << " (" << State.Row.Discriminator << ")"; 895 break; 896 897 default: 898 if (Verbose) 899 *OS << format("Unrecognized extended op 0x%02.02" PRIx8, SubOpcode) 900 << format(" length %" PRIx64, Len); 901 // Len doesn't include the zero opcode byte or the length itself, but 902 // it does include the sub_opcode, so we have to adjust for that. 903 TableData.skip(Cursor, Len - 1); 904 break; 905 } 906 // Make sure the length as recorded in the table and the standard length 907 // for the opcode match. If they don't, continue from the end as claimed 908 // by the table. Similarly, continue from the claimed end in the event of 909 // a parsing error. 910 uint64_t End = ExtOffset + Len; 911 if (!Cursor) 912 RecoverableErrorHandler(Cursor.takeError()); 913 else if (Cursor.tell() != End) 914 RecoverableErrorHandler(createStringError( 915 errc::illegal_byte_sequence, 916 "unexpected line op length at offset 0x%8.8" PRIx64 917 " expected 0x%2.2" PRIx64 " found 0x%2.2" PRIx64, 918 ExtOffset, Len, Cursor.tell() - ExtOffset)); 919 *OffsetPtr = End; 920 } else if (Opcode < Prologue.OpcodeBase) { 921 if (Verbose) 922 *OS << LNStandardString(Opcode); 923 switch (Opcode) { 924 // Standard Opcodes 925 case DW_LNS_copy: 926 // Takes no arguments. Append a row to the matrix using the 927 // current values of the state-machine registers. 928 if (Verbose) { 929 *OS << "\n"; 930 OS->indent(12); 931 } 932 if (OS) 933 State.Row.dump(*OS); 934 State.appendRowToMatrix(); 935 break; 936 937 case DW_LNS_advance_pc: 938 // Takes a single unsigned LEB128 operand, multiplies it by the 939 // min_inst_length field of the prologue, and adds the 940 // result to the address register of the state machine. 941 { 942 uint64_t AddrOffset = State.advanceAddr( 943 TableData.getULEB128(OffsetPtr), Opcode, OpcodeOffset); 944 if (Verbose) 945 *OS << " (" << AddrOffset << ")"; 946 } 947 break; 948 949 case DW_LNS_advance_line: 950 // Takes a single signed LEB128 operand and adds that value to 951 // the line register of the state machine. 952 State.Row.Line += TableData.getSLEB128(OffsetPtr); 953 if (Verbose) 954 *OS << " (" << State.Row.Line << ")"; 955 break; 956 957 case DW_LNS_set_file: 958 // Takes a single unsigned LEB128 operand and stores it in the file 959 // register of the state machine. 960 State.Row.File = TableData.getULEB128(OffsetPtr); 961 if (Verbose) 962 *OS << " (" << State.Row.File << ")"; 963 break; 964 965 case DW_LNS_set_column: 966 // Takes a single unsigned LEB128 operand and stores it in the 967 // column register of the state machine. 968 State.Row.Column = TableData.getULEB128(OffsetPtr); 969 if (Verbose) 970 *OS << " (" << State.Row.Column << ")"; 971 break; 972 973 case DW_LNS_negate_stmt: 974 // Takes no arguments. Set the is_stmt register of the state 975 // machine to the logical negation of its current value. 976 State.Row.IsStmt = !State.Row.IsStmt; 977 break; 978 979 case DW_LNS_set_basic_block: 980 // Takes no arguments. Set the basic_block register of the 981 // state machine to true 982 State.Row.BasicBlock = true; 983 break; 984 985 case DW_LNS_const_add_pc: 986 // Takes no arguments. Add to the address register of the state 987 // machine the address increment value corresponding to special 988 // opcode 255. The motivation for DW_LNS_const_add_pc is this: 989 // when the statement program needs to advance the address by a 990 // small amount, it can use a single special opcode, which occupies 991 // a single byte. When it needs to advance the address by up to 992 // twice the range of the last special opcode, it can use 993 // DW_LNS_const_add_pc followed by a special opcode, for a total 994 // of two bytes. Only if it needs to advance the address by more 995 // than twice that range will it need to use both DW_LNS_advance_pc 996 // and a special opcode, requiring three or more bytes. 997 { 998 uint64_t AddrOffset = 999 State.advanceAddrForOpcode(Opcode, OpcodeOffset).AddrDelta; 1000 if (Verbose) 1001 *OS << format(" (0x%16.16" PRIx64 ")", AddrOffset); 1002 } 1003 break; 1004 1005 case DW_LNS_fixed_advance_pc: 1006 // Takes a single uhalf operand. Add to the address register of 1007 // the state machine the value of the (unencoded) operand. This 1008 // is the only extended opcode that takes an argument that is not 1009 // a variable length number. The motivation for DW_LNS_fixed_advance_pc 1010 // is this: existing assemblers cannot emit DW_LNS_advance_pc or 1011 // special opcodes because they cannot encode LEB128 numbers or 1012 // judge when the computation of a special opcode overflows and 1013 // requires the use of DW_LNS_advance_pc. Such assemblers, however, 1014 // can use DW_LNS_fixed_advance_pc instead, sacrificing compression. 1015 { 1016 uint16_t PCOffset = TableData.getRelocatedValue(2, OffsetPtr); 1017 State.Row.Address.Address += PCOffset; 1018 if (Verbose) 1019 *OS << format(" (0x%4.4" PRIx16 ")", PCOffset); 1020 } 1021 break; 1022 1023 case DW_LNS_set_prologue_end: 1024 // Takes no arguments. Set the prologue_end register of the 1025 // state machine to true 1026 State.Row.PrologueEnd = true; 1027 break; 1028 1029 case DW_LNS_set_epilogue_begin: 1030 // Takes no arguments. Set the basic_block register of the 1031 // state machine to true 1032 State.Row.EpilogueBegin = true; 1033 break; 1034 1035 case DW_LNS_set_isa: 1036 // Takes a single unsigned LEB128 operand and stores it in the 1037 // column register of the state machine. 1038 State.Row.Isa = TableData.getULEB128(OffsetPtr); 1039 if (Verbose) 1040 *OS << " (" << (uint64_t)State.Row.Isa << ")"; 1041 break; 1042 1043 default: 1044 // Handle any unknown standard opcodes here. We know the lengths 1045 // of such opcodes because they are specified in the prologue 1046 // as a multiple of LEB128 operands for each opcode. 1047 { 1048 assert(Opcode - 1U < Prologue.StandardOpcodeLengths.size()); 1049 if (Verbose) 1050 *OS << "Unrecognized standard opcode"; 1051 uint8_t OpcodeLength = Prologue.StandardOpcodeLengths[Opcode - 1]; 1052 if (OpcodeLength != 0) { 1053 if (Verbose) 1054 *OS << " (operands: "; 1055 for (uint8_t I = 0; I < OpcodeLength; ++I) { 1056 uint64_t Value = TableData.getULEB128(OffsetPtr); 1057 if (Verbose) { 1058 if (I > 0) 1059 *OS << ", "; 1060 *OS << format("0x%16.16" PRIx64, Value); 1061 } 1062 } 1063 if (Verbose) 1064 *OS << ')'; 1065 } 1066 } 1067 break; 1068 } 1069 } else { 1070 // Special Opcodes. 1071 ParsingState::AddrAndLineDelta Delta = 1072 State.handleSpecialOpcode(Opcode, OpcodeOffset); 1073 1074 if (Verbose) { 1075 *OS << "address += " << Delta.Address << ", line += " << Delta.Line 1076 << "\n"; 1077 OS->indent(12); 1078 } 1079 if (OS) 1080 State.Row.dump(*OS); 1081 1082 State.appendRowToMatrix(); 1083 } 1084 1085 // When a row is added to the matrix, it is also dumped, which includes a 1086 // new line already, so don't add an extra one. 1087 if (Verbose && Rows.size() == RowCount) 1088 *OS << "\n"; 1089 } 1090 1091 if (!State.Sequence.Empty) 1092 RecoverableErrorHandler(createStringError( 1093 errc::illegal_byte_sequence, 1094 "last sequence in debug line table at offset 0x%8.8" PRIx64 1095 " is not terminated", 1096 DebugLineOffset)); 1097 1098 // Sort all sequences so that address lookup will work faster. 1099 if (!Sequences.empty()) { 1100 llvm::sort(Sequences, Sequence::orderByHighPC); 1101 // Note: actually, instruction address ranges of sequences should not 1102 // overlap (in shared objects and executables). If they do, the address 1103 // lookup would still work, though, but result would be ambiguous. 1104 // We don't report warning in this case. For example, 1105 // sometimes .so compiled from multiple object files contains a few 1106 // rudimentary sequences for address ranges [0x0, 0xsomething). 1107 } 1108 1109 // Terminate the table with a final blank line to clearly delineate it from 1110 // later dumps. 1111 if (OS) 1112 *OS << "\n"; 1113 1114 return Error::success(); 1115 } 1116 1117 uint32_t DWARFDebugLine::LineTable::findRowInSeq( 1118 const DWARFDebugLine::Sequence &Seq, 1119 object::SectionedAddress Address) const { 1120 if (!Seq.containsPC(Address)) 1121 return UnknownRowIndex; 1122 assert(Seq.SectionIndex == Address.SectionIndex); 1123 // In some cases, e.g. first instruction in a function, the compiler generates 1124 // two entries, both with the same address. We want the last one. 1125 // 1126 // In general we want a non-empty range: the last row whose address is less 1127 // than or equal to Address. This can be computed as upper_bound - 1. 1128 DWARFDebugLine::Row Row; 1129 Row.Address = Address; 1130 RowIter FirstRow = Rows.begin() + Seq.FirstRowIndex; 1131 RowIter LastRow = Rows.begin() + Seq.LastRowIndex; 1132 assert(FirstRow->Address.Address <= Row.Address.Address && 1133 Row.Address.Address < LastRow[-1].Address.Address); 1134 RowIter RowPos = std::upper_bound(FirstRow + 1, LastRow - 1, Row, 1135 DWARFDebugLine::Row::orderByAddress) - 1136 1; 1137 assert(Seq.SectionIndex == RowPos->Address.SectionIndex); 1138 return RowPos - Rows.begin(); 1139 } 1140 1141 uint32_t DWARFDebugLine::LineTable::lookupAddress( 1142 object::SectionedAddress Address) const { 1143 1144 // Search for relocatable addresses 1145 uint32_t Result = lookupAddressImpl(Address); 1146 1147 if (Result != UnknownRowIndex || 1148 Address.SectionIndex == object::SectionedAddress::UndefSection) 1149 return Result; 1150 1151 // Search for absolute addresses 1152 Address.SectionIndex = object::SectionedAddress::UndefSection; 1153 return lookupAddressImpl(Address); 1154 } 1155 1156 uint32_t DWARFDebugLine::LineTable::lookupAddressImpl( 1157 object::SectionedAddress Address) const { 1158 // First, find an instruction sequence containing the given address. 1159 DWARFDebugLine::Sequence Sequence; 1160 Sequence.SectionIndex = Address.SectionIndex; 1161 Sequence.HighPC = Address.Address; 1162 SequenceIter It = llvm::upper_bound(Sequences, Sequence, 1163 DWARFDebugLine::Sequence::orderByHighPC); 1164 if (It == Sequences.end() || It->SectionIndex != Address.SectionIndex) 1165 return UnknownRowIndex; 1166 return findRowInSeq(*It, Address); 1167 } 1168 1169 bool DWARFDebugLine::LineTable::lookupAddressRange( 1170 object::SectionedAddress Address, uint64_t Size, 1171 std::vector<uint32_t> &Result) const { 1172 1173 // Search for relocatable addresses 1174 if (lookupAddressRangeImpl(Address, Size, Result)) 1175 return true; 1176 1177 if (Address.SectionIndex == object::SectionedAddress::UndefSection) 1178 return false; 1179 1180 // Search for absolute addresses 1181 Address.SectionIndex = object::SectionedAddress::UndefSection; 1182 return lookupAddressRangeImpl(Address, Size, Result); 1183 } 1184 1185 bool DWARFDebugLine::LineTable::lookupAddressRangeImpl( 1186 object::SectionedAddress Address, uint64_t Size, 1187 std::vector<uint32_t> &Result) const { 1188 if (Sequences.empty()) 1189 return false; 1190 uint64_t EndAddr = Address.Address + Size; 1191 // First, find an instruction sequence containing the given address. 1192 DWARFDebugLine::Sequence Sequence; 1193 Sequence.SectionIndex = Address.SectionIndex; 1194 Sequence.HighPC = Address.Address; 1195 SequenceIter LastSeq = Sequences.end(); 1196 SequenceIter SeqPos = llvm::upper_bound( 1197 Sequences, Sequence, DWARFDebugLine::Sequence::orderByHighPC); 1198 if (SeqPos == LastSeq || !SeqPos->containsPC(Address)) 1199 return false; 1200 1201 SequenceIter StartPos = SeqPos; 1202 1203 // Add the rows from the first sequence to the vector, starting with the 1204 // index we just calculated 1205 1206 while (SeqPos != LastSeq && SeqPos->LowPC < EndAddr) { 1207 const DWARFDebugLine::Sequence &CurSeq = *SeqPos; 1208 // For the first sequence, we need to find which row in the sequence is the 1209 // first in our range. 1210 uint32_t FirstRowIndex = CurSeq.FirstRowIndex; 1211 if (SeqPos == StartPos) 1212 FirstRowIndex = findRowInSeq(CurSeq, Address); 1213 1214 // Figure out the last row in the range. 1215 uint32_t LastRowIndex = 1216 findRowInSeq(CurSeq, {EndAddr - 1, Address.SectionIndex}); 1217 if (LastRowIndex == UnknownRowIndex) 1218 LastRowIndex = CurSeq.LastRowIndex - 1; 1219 1220 assert(FirstRowIndex != UnknownRowIndex); 1221 assert(LastRowIndex != UnknownRowIndex); 1222 1223 for (uint32_t I = FirstRowIndex; I <= LastRowIndex; ++I) { 1224 Result.push_back(I); 1225 } 1226 1227 ++SeqPos; 1228 } 1229 1230 return true; 1231 } 1232 1233 Optional<StringRef> DWARFDebugLine::LineTable::getSourceByIndex(uint64_t FileIndex, 1234 FileLineInfoKind Kind) const { 1235 if (Kind == FileLineInfoKind::None || !Prologue.hasFileAtIndex(FileIndex)) 1236 return None; 1237 const FileNameEntry &Entry = Prologue.getFileNameEntry(FileIndex); 1238 if (Optional<const char *> source = Entry.Source.getAsCString()) 1239 return StringRef(*source); 1240 return None; 1241 } 1242 1243 static bool isPathAbsoluteOnWindowsOrPosix(const Twine &Path) { 1244 // Debug info can contain paths from any OS, not necessarily 1245 // an OS we're currently running on. Moreover different compilation units can 1246 // be compiled on different operating systems and linked together later. 1247 return sys::path::is_absolute(Path, sys::path::Style::posix) || 1248 sys::path::is_absolute(Path, sys::path::Style::windows); 1249 } 1250 1251 bool DWARFDebugLine::Prologue::getFileNameByIndex( 1252 uint64_t FileIndex, StringRef CompDir, FileLineInfoKind Kind, 1253 std::string &Result, sys::path::Style Style) const { 1254 if (Kind == FileLineInfoKind::None || !hasFileAtIndex(FileIndex)) 1255 return false; 1256 const FileNameEntry &Entry = getFileNameEntry(FileIndex); 1257 Optional<const char *> Name = Entry.Name.getAsCString(); 1258 if (!Name) 1259 return false; 1260 StringRef FileName = *Name; 1261 if (Kind == FileLineInfoKind::RawValue || 1262 isPathAbsoluteOnWindowsOrPosix(FileName)) { 1263 Result = std::string(FileName); 1264 return true; 1265 } 1266 if (Kind == FileLineInfoKind::BaseNameOnly) { 1267 Result = std::string(llvm::sys::path::filename(FileName)); 1268 return true; 1269 } 1270 1271 SmallString<16> FilePath; 1272 StringRef IncludeDir; 1273 // Be defensive about the contents of Entry. 1274 if (getVersion() >= 5) { 1275 // DirIdx 0 is the compilation directory, so don't include it for 1276 // relative names. 1277 if ((Entry.DirIdx != 0 || Kind != FileLineInfoKind::RelativeFilePath) && 1278 Entry.DirIdx < IncludeDirectories.size()) 1279 IncludeDir = IncludeDirectories[Entry.DirIdx].getAsCString().getValue(); 1280 } else { 1281 if (0 < Entry.DirIdx && Entry.DirIdx <= IncludeDirectories.size()) 1282 IncludeDir = 1283 IncludeDirectories[Entry.DirIdx - 1].getAsCString().getValue(); 1284 } 1285 1286 // For absolute paths only, include the compilation directory of compile unit. 1287 // We know that FileName is not absolute, the only way to have an absolute 1288 // path at this point would be if IncludeDir is absolute. 1289 if (Kind == FileLineInfoKind::AbsoluteFilePath && !CompDir.empty() && 1290 !isPathAbsoluteOnWindowsOrPosix(IncludeDir)) 1291 sys::path::append(FilePath, Style, CompDir); 1292 1293 assert((Kind == FileLineInfoKind::AbsoluteFilePath || 1294 Kind == FileLineInfoKind::RelativeFilePath) && 1295 "invalid FileLineInfo Kind"); 1296 1297 // sys::path::append skips empty strings. 1298 sys::path::append(FilePath, Style, IncludeDir, FileName); 1299 Result = std::string(FilePath.str()); 1300 return true; 1301 } 1302 1303 bool DWARFDebugLine::LineTable::getFileLineInfoForAddress( 1304 object::SectionedAddress Address, const char *CompDir, 1305 FileLineInfoKind Kind, DILineInfo &Result) const { 1306 // Get the index of row we're looking for in the line table. 1307 uint32_t RowIndex = lookupAddress(Address); 1308 if (RowIndex == -1U) 1309 return false; 1310 // Take file number and line/column from the row. 1311 const auto &Row = Rows[RowIndex]; 1312 if (!getFileNameByIndex(Row.File, CompDir, Kind, Result.FileName)) 1313 return false; 1314 Result.Line = Row.Line; 1315 Result.Column = Row.Column; 1316 Result.Discriminator = Row.Discriminator; 1317 Result.Source = getSourceByIndex(Row.File, Kind); 1318 return true; 1319 } 1320 1321 // We want to supply the Unit associated with a .debug_line[.dwo] table when 1322 // we dump it, if possible, but still dump the table even if there isn't a Unit. 1323 // Therefore, collect up handles on all the Units that point into the 1324 // line-table section. 1325 static DWARFDebugLine::SectionParser::LineToUnitMap 1326 buildLineToUnitMap(DWARFDebugLine::SectionParser::cu_range CUs, 1327 DWARFDebugLine::SectionParser::tu_range TUs) { 1328 DWARFDebugLine::SectionParser::LineToUnitMap LineToUnit; 1329 for (const auto &CU : CUs) 1330 if (auto CUDIE = CU->getUnitDIE()) 1331 if (auto StmtOffset = toSectionOffset(CUDIE.find(DW_AT_stmt_list))) 1332 LineToUnit.insert(std::make_pair(*StmtOffset, &*CU)); 1333 for (const auto &TU : TUs) 1334 if (auto TUDIE = TU->getUnitDIE()) 1335 if (auto StmtOffset = toSectionOffset(TUDIE.find(DW_AT_stmt_list))) 1336 LineToUnit.insert(std::make_pair(*StmtOffset, &*TU)); 1337 return LineToUnit; 1338 } 1339 1340 DWARFDebugLine::SectionParser::SectionParser(DWARFDataExtractor &Data, 1341 const DWARFContext &C, 1342 cu_range CUs, tu_range TUs) 1343 : DebugLineData(Data), Context(C) { 1344 LineToUnit = buildLineToUnitMap(CUs, TUs); 1345 if (!DebugLineData.isValidOffset(Offset)) 1346 Done = true; 1347 } 1348 1349 bool DWARFDebugLine::Prologue::totalLengthIsValid() const { 1350 return TotalLength != 0u; 1351 } 1352 1353 DWARFDebugLine::LineTable DWARFDebugLine::SectionParser::parseNext( 1354 function_ref<void(Error)> RecoverableErrorHandler, 1355 function_ref<void(Error)> UnrecoverableErrorHandler, raw_ostream *OS, 1356 bool Verbose) { 1357 assert(DebugLineData.isValidOffset(Offset) && 1358 "parsing should have terminated"); 1359 DWARFUnit *U = prepareToParse(Offset); 1360 uint64_t OldOffset = Offset; 1361 LineTable LT; 1362 if (Error Err = LT.parse(DebugLineData, &Offset, Context, U, 1363 RecoverableErrorHandler, OS, Verbose)) 1364 UnrecoverableErrorHandler(std::move(Err)); 1365 moveToNextTable(OldOffset, LT.Prologue); 1366 return LT; 1367 } 1368 1369 void DWARFDebugLine::SectionParser::skip( 1370 function_ref<void(Error)> RecoverableErrorHandler, 1371 function_ref<void(Error)> UnrecoverableErrorHandler) { 1372 assert(DebugLineData.isValidOffset(Offset) && 1373 "parsing should have terminated"); 1374 DWARFUnit *U = prepareToParse(Offset); 1375 uint64_t OldOffset = Offset; 1376 LineTable LT; 1377 if (Error Err = LT.Prologue.parse(DebugLineData, &Offset, 1378 RecoverableErrorHandler, Context, U)) 1379 UnrecoverableErrorHandler(std::move(Err)); 1380 moveToNextTable(OldOffset, LT.Prologue); 1381 } 1382 1383 DWARFUnit *DWARFDebugLine::SectionParser::prepareToParse(uint64_t Offset) { 1384 DWARFUnit *U = nullptr; 1385 auto It = LineToUnit.find(Offset); 1386 if (It != LineToUnit.end()) 1387 U = It->second; 1388 DebugLineData.setAddressSize(U ? U->getAddressByteSize() : 0); 1389 return U; 1390 } 1391 1392 void DWARFDebugLine::SectionParser::moveToNextTable(uint64_t OldOffset, 1393 const Prologue &P) { 1394 // If the length field is not valid, we don't know where the next table is, so 1395 // cannot continue to parse. Mark the parser as done, and leave the Offset 1396 // value as it currently is. This will be the end of the bad length field. 1397 if (!P.totalLengthIsValid()) { 1398 Done = true; 1399 return; 1400 } 1401 1402 Offset = OldOffset + P.TotalLength + P.sizeofTotalLength(); 1403 if (!DebugLineData.isValidOffset(Offset)) { 1404 Done = true; 1405 } 1406 } 1407