2946cd7010
to reflect the new license. We understand that people may be surprised that we're moving the header entirely to discuss the new license. We checked this carefully with the Foundation's lawyer and we believe this is the correct approach. Essentially, all code in the project is now made available by the LLVM project under our new license, so you will see that the license headers include that license only. Some of our contributors have contributed code under our old license, and accordingly, we have retained a copy of our old license notice in the top-level files in each project and repository. llvm-svn: 351636
96 lines
3.2 KiB
C++
96 lines
3.2 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 = -1U;
|
|
AddressSize = 0;
|
|
Entries.clear();
|
|
}
|
|
|
|
Error DWARFDebugRangeList::extract(const DWARFDataExtractor &data,
|
|
uint32_t *offset_ptr) {
|
|
clear();
|
|
if (!data.isValidOffset(*offset_ptr))
|
|
return createStringError(errc::invalid_argument,
|
|
"invalid range list offset 0x%" PRIx32, *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;
|
|
|
|
uint32_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%" PRIx32,
|
|
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
|
|
? "%08x %08" PRIx64 " %08" PRIx64 "\n"
|
|
: "%08x %016" PRIx64 " %016" PRIx64 "\n");
|
|
OS << format(format_str, Offset, RLE.StartAddress, RLE.EndAddress);
|
|
}
|
|
OS << format("%08x <End of list>\n", Offset);
|
|
}
|
|
|
|
DWARFAddressRangesVector DWARFDebugRangeList::getAbsoluteRanges(
|
|
llvm::Optional<SectionedAddress> BaseAddr) const {
|
|
DWARFAddressRangesVector Res;
|
|
for (const RangeListEntry &RLE : Entries) {
|
|
if (RLE.isBaseAddressSelectionEntry(AddressSize)) {
|
|
BaseAddr = {RLE.EndAddress, RLE.SectionIndex};
|
|
continue;
|
|
}
|
|
|
|
DWARFAddressRange E;
|
|
E.LowPC = RLE.StartAddress;
|
|
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) {
|
|
E.LowPC += BaseAddr->Address;
|
|
E.HighPC += BaseAddr->Address;
|
|
if (E.SectionIndex == -1ULL)
|
|
E.SectionIndex = BaseAddr->SectionIndex;
|
|
}
|
|
Res.push_back(E);
|
|
}
|
|
return Res;
|
|
}
|