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