1 //===-- DWARFDebugLoc.cpp -------------------------------------------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 10 #include "llvm/DebugInfo/DWARF/DWARFDebugLoc.h" 11 #include "llvm/Support/Compiler.h" 12 #include "llvm/Support/Dwarf.h" 13 #include "llvm/Support/Format.h" 14 #include "llvm/Support/raw_ostream.h" 15 16 using namespace llvm; 17 18 void DWARFDebugLoc::dump(raw_ostream &OS) const { 19 for (const LocationList &L : Locations) { 20 OS << format("0x%8.8x: ", L.Offset); 21 const unsigned Indent = 12; 22 for (const Entry &E : L.Entries) { 23 if (&E != L.Entries.begin()) 24 OS.indent(Indent); 25 OS << "Beginning address offset: " << format("0x%016" PRIx64, E.Begin) 26 << '\n'; 27 OS.indent(Indent) << " Ending address offset: " 28 << format("0x%016" PRIx64, E.End) << '\n'; 29 OS.indent(Indent) << " Location description: "; 30 for (unsigned char Loc : E.Loc) { 31 OS << format("%2.2x ", Loc); 32 } 33 OS << "\n\n"; 34 } 35 } 36 } 37 38 void DWARFDebugLoc::parse(DataExtractor data, unsigned AddressSize) { 39 uint32_t Offset = 0; 40 while (data.isValidOffset(Offset+AddressSize-1)) { 41 Locations.resize(Locations.size() + 1); 42 LocationList &Loc = Locations.back(); 43 Loc.Offset = Offset; 44 // 2.6.2 Location Lists 45 // A location list entry consists of: 46 while (true) { 47 Entry E; 48 RelocAddrMap::const_iterator AI = RelocMap.find(Offset); 49 // 1. A beginning address offset. ... 50 E.Begin = data.getUnsigned(&Offset, AddressSize); 51 if (AI != RelocMap.end()) 52 E.Begin += AI->second.second; 53 54 AI = RelocMap.find(Offset); 55 // 2. An ending address offset. ... 56 E.End = data.getUnsigned(&Offset, AddressSize); 57 if (AI != RelocMap.end()) 58 E.End += AI->second.second; 59 60 // The end of any given location list is marked by an end of list entry, 61 // which consists of a 0 for the beginning address offset and a 0 for the 62 // ending address offset. 63 if (E.Begin == 0 && E.End == 0) 64 break; 65 66 unsigned Bytes = data.getU16(&Offset); 67 // A single location description describing the location of the object... 68 StringRef str = data.getData().substr(Offset, Bytes); 69 Offset += Bytes; 70 E.Loc.append(str.begin(), str.end()); 71 Loc.Entries.push_back(std::move(E)); 72 } 73 } 74 if (data.isValidOffset(Offset)) 75 llvm::errs() << "error: failed to consume entire .debug_loc section\n"; 76 } 77 78 void DWARFDebugLocDWO::parse(DataExtractor data) { 79 uint32_t Offset = 0; 80 while (data.isValidOffset(Offset)) { 81 Locations.resize(Locations.size() + 1); 82 LocationList &Loc = Locations.back(); 83 Loc.Offset = Offset; 84 dwarf::LocationListEntry Kind; 85 while ((Kind = static_cast<dwarf::LocationListEntry>( 86 data.getU8(&Offset))) != dwarf::DW_LLE_end_of_list_entry) { 87 88 if (Kind != dwarf::DW_LLE_start_length_entry) { 89 llvm::errs() << "error: dumping support for LLE of kind " << (int)Kind 90 << " not implemented\n"; 91 return; 92 } 93 94 Entry E; 95 96 E.Start = data.getULEB128(&Offset); 97 E.Length = data.getU32(&Offset); 98 99 unsigned Bytes = data.getU16(&Offset); 100 // A single location description describing the location of the object... 101 StringRef str = data.getData().substr(Offset, Bytes); 102 Offset += Bytes; 103 E.Loc.resize(str.size()); 104 std::copy(str.begin(), str.end(), E.Loc.begin()); 105 106 Loc.Entries.push_back(std::move(E)); 107 } 108 } 109 } 110 111 void DWARFDebugLocDWO::dump(raw_ostream &OS) const { 112 for (const LocationList &L : Locations) { 113 OS << format("0x%8.8x: ", L.Offset); 114 const unsigned Indent = 12; 115 for (const Entry &E : L.Entries) { 116 if (&E != L.Entries.begin()) 117 OS.indent(Indent); 118 OS << "Beginning address index: " << E.Start << '\n'; 119 OS.indent(Indent) << " Length: " << E.Length << '\n'; 120 OS.indent(Indent) << " Location description: "; 121 for (unsigned char Loc : E.Loc) 122 OS << format("%2.2x ", Loc); 123 OS << "\n\n"; 124 } 125 } 126 } 127 128
