103 lines
3.5 KiB
C++
103 lines
3.5 KiB
C++
//===- DWARFDebugRangesList.cpp -------------------------------------------===//
|
|
//
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "llvm/DebugInfo/DWARF/DWARFDebugRangeList.h"
|
|
#include "llvm/DebugInfo/DWARF/DWARFContext.h"
|
|
#include "llvm/Support/Errc.h"
|
|
#include "llvm/Support/Format.h"
|
|
#include "llvm/Support/raw_ostream.h"
|
|
#include <cinttypes>
|
|
#include <cstdint>
|
|
|
|
using namespace llvm;
|
|
|
|
void DWARFDebugRangeList::clear() {
|
|
Offset = -1ULL;
|
|
AddressSize = 0;
|
|
Entries.clear();
|
|
}
|
|
|
|
Error DWARFDebugRangeList::extract(const DWARFDataExtractor &data,
|
|
uint64_t *offset_ptr) {
|
|
clear();
|
|
if (!data.isValidOffset(*offset_ptr))
|
|
return createStringError(errc::invalid_argument,
|
|
"invalid range list offset 0x%" PRIx64, *offset_ptr);
|
|
|
|
AddressSize = data.getAddressSize();
|
|
if (AddressSize != 4 && AddressSize != 8)
|
|
return createStringError(errc::invalid_argument,
|
|
"invalid address size: %" PRIu8, AddressSize);
|
|
Offset = *offset_ptr;
|
|
while (true) {
|
|
RangeListEntry Entry;
|
|
Entry.SectionIndex = -1ULL;
|
|
|
|
uint64_t prev_offset = *offset_ptr;
|
|
Entry.StartAddress = data.getRelocatedAddress(offset_ptr);
|
|
Entry.EndAddress =
|
|
data.getRelocatedAddress(offset_ptr, &Entry.SectionIndex);
|
|
|
|
// Check that both values were extracted correctly.
|
|
if (*offset_ptr != prev_offset + 2 * AddressSize) {
|
|
clear();
|
|
return createStringError(errc::invalid_argument,
|
|
"invalid range list entry at offset 0x%" PRIx64,
|
|
prev_offset);
|
|
}
|
|
if (Entry.isEndOfListEntry())
|
|
break;
|
|
Entries.push_back(Entry);
|
|
}
|
|
return Error::success();
|
|
}
|
|
|
|
void DWARFDebugRangeList::dump(raw_ostream &OS) const {
|
|
for (const RangeListEntry &RLE : Entries) {
|
|
const char *format_str =
|
|
(AddressSize == 4 ? "%08" PRIx64 " %08" PRIx64 " %08" PRIx64 "\n"
|
|
: "%08" PRIx64 " %016" PRIx64 " %016" PRIx64 "\n");
|
|
OS << format(format_str, Offset, RLE.StartAddress, RLE.EndAddress);
|
|
}
|
|
OS << format("%08" PRIx64 " <End of list>\n", Offset);
|
|
}
|
|
|
|
DWARFAddressRangesVector DWARFDebugRangeList::getAbsoluteRanges(
|
|
llvm::Optional<object::SectionedAddress> BaseAddr) const {
|
|
DWARFAddressRangesVector Res;
|
|
// debug_addr can't use the max integer tombstone because that's used for the
|
|
// base address specifier entry - so use max-1.
|
|
uint64_t Tombstone = dwarf::computeTombstoneAddress(AddressSize) - 1;
|
|
for (const RangeListEntry &RLE : Entries) {
|
|
if (RLE.isBaseAddressSelectionEntry(AddressSize)) {
|
|
BaseAddr = {RLE.EndAddress, RLE.SectionIndex};
|
|
continue;
|
|
}
|
|
|
|
DWARFAddressRange E;
|
|
E.LowPC = RLE.StartAddress;
|
|
if (E.LowPC == Tombstone)
|
|
continue;
|
|
E.HighPC = RLE.EndAddress;
|
|
E.SectionIndex = RLE.SectionIndex;
|
|
// Base address of a range list entry is determined by the closest preceding
|
|
// base address selection entry in the same range list. It defaults to the
|
|
// base address of the compilation unit if there is no such entry.
|
|
if (BaseAddr) {
|
|
if (BaseAddr->Address == Tombstone)
|
|
continue;
|
|
E.LowPC += BaseAddr->Address;
|
|
E.HighPC += BaseAddr->Address;
|
|
if (E.SectionIndex == -1ULL)
|
|
E.SectionIndex = BaseAddr->SectionIndex;
|
|
}
|
|
Res.push_back(E);
|
|
}
|
|
return Res;
|
|
}
|