Viewing file:  DWARFAddressRange.h (3.04 KB) -rw-r--r--
Select action/file-type:
 (+) |  (+) |  (+) | Code (+) | Session (+) |  (+) | SDB (+) |  (+) |  (+) |  (+) |  (+) |  (+) |
//===- DWARFAddressRange.h --------------------------------------*- C++ -*-===//
//
// 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
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_DEBUGINFO_DWARF_DWARFADDRESSRANGE_H
#define LLVM_DEBUGINFO_DWARF_DWARFADDRESSRANGE_H
#include "llvm/DebugInfo/DIContext.h"
#include "llvm/Object/ObjectFile.h"
#include <algorithm>
#include <cassert>
#include <cstdint>
#include <tuple>
#include <vector>
namespace llvm {
class raw_ostream;
class DWARFObject;
struct DWARFAddressRange {
uint64_t LowPC;
uint64_t HighPC;
uint64_t SectionIndex;
DWARFAddressRange() = default;
/// Used for unit testing.
DWARFAddressRange(
uint64_t LowPC, uint64_t HighPC,
uint64_t SectionIndex = object::SectionedAddress::UndefSection)
: LowPC(LowPC), HighPC(HighPC), SectionIndex(SectionIndex) {}
/// Returns true if LowPC is smaller or equal to HighPC. This accounts for
/// dead-stripped ranges.
bool valid() const { return LowPC <= HighPC; }
/// Returns true if [LowPC, HighPC) intersects with [RHS.LowPC, RHS.HighPC).
bool intersects(const DWARFAddressRange &RHS) const {
assert(valid() && RHS.valid());
if (SectionIndex != RHS.SectionIndex)
return false;
// Empty ranges can't intersect.
if (LowPC == HighPC || RHS.LowPC == RHS.HighPC)
return false;
return LowPC < RHS.HighPC && RHS.LowPC < HighPC;
}
/// Union two address ranges if they intersect.
///
/// This function will union two address ranges if they intersect by
/// modifying this range to be the union of both ranges. If the two ranges
/// don't intersect this range will be left alone.
///
/// \param RHS Another address range to combine with.
///
/// \returns false if the ranges don't intersect, true if they do and the
/// ranges were combined.
bool merge(const DWARFAddressRange &RHS) {
if (!intersects(RHS))
return false;
LowPC = std::min<uint64_t>(LowPC, RHS.LowPC);
HighPC = std::max<uint64_t>(HighPC, RHS.HighPC);
return true;
}
void dump(raw_ostream &OS, uint32_t AddressSize, DIDumpOptions DumpOpts = {},
const DWARFObject *Obj = nullptr) const;
};
inline bool operator<(const DWARFAddressRange &LHS,
const DWARFAddressRange &RHS) {
return std::tie(LHS.SectionIndex, LHS.LowPC, LHS.HighPC) < std::tie(RHS.SectionIndex, RHS.LowPC, RHS.HighPC);
}
inline bool operator==(const DWARFAddressRange &LHS,
const DWARFAddressRange &RHS) {
return std::tie(LHS.SectionIndex, LHS.LowPC, LHS.HighPC) == std::tie(RHS.SectionIndex, RHS.LowPC, RHS.HighPC);
}
raw_ostream &operator<<(raw_ostream &OS, const DWARFAddressRange &R);
/// DWARFAddressRangesVector - represents a set of absolute address ranges.
using DWARFAddressRangesVector = std::vector<DWARFAddressRange>;
} // end namespace llvm
#endif // LLVM_DEBUGINFO_DWARF_DWARFADDRESSRANGE_H
|