1 //===- Range.cpp ------------------------------------------------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 #include "llvm/DebugInfo/GSYM/Range.h"
11 #include "llvm/DebugInfo/GSYM/FileWriter.h"
12 #include "llvm/Support/DataExtractor.h"
20 void AddressRanges::insert(AddressRange Range) {
21 if (Range.size() == 0)
24 auto It = llvm::upper_bound(Ranges, Range);
26 while (It2 != Ranges.end() && It2->Start < Range.End)
29 Range.End = std::max(Range.End, It2[-1].End);
30 It = Ranges.erase(It, It2);
32 if (It != Ranges.begin() && Range.Start < It[-1].End)
33 It[-1].End = std::max(It[-1].End, Range.End);
35 Ranges.insert(It, Range);
38 bool AddressRanges::contains(uint64_t Addr) const {
39 auto It = std::partition_point(
40 Ranges.begin(), Ranges.end(),
41 [=](const AddressRange &R) { return R.Start <= Addr; });
42 return It != Ranges.begin() && Addr < It[-1].End;
45 bool AddressRanges::contains(AddressRange Range) const {
46 if (Range.size() == 0)
48 auto It = std::partition_point(
49 Ranges.begin(), Ranges.end(),
50 [=](const AddressRange &R) { return R.Start <= Range.Start; });
51 if (It == Ranges.begin())
53 return Range.End <= It[-1].End;
56 Optional<AddressRange>
57 AddressRanges::getRangeThatContains(uint64_t Addr) const {
58 auto It = std::partition_point(
59 Ranges.begin(), Ranges.end(),
60 [=](const AddressRange &R) { return R.Start <= Addr; });
61 if (It != Ranges.begin() && Addr < It[-1].End)
66 raw_ostream &llvm::gsym::operator<<(raw_ostream &OS, const AddressRange &R) {
67 return OS << '[' << HEX64(R.Start) << " - " << HEX64(R.End) << ")";
70 raw_ostream &llvm::gsym::operator<<(raw_ostream &OS, const AddressRanges &AR) {
71 size_t Size = AR.size();
72 for (size_t I = 0; I < Size; ++I) {
80 void AddressRange::encode(FileWriter &O, uint64_t BaseAddr) const {
81 assert(Start >= BaseAddr);
82 O.writeULEB(Start - BaseAddr);
86 void AddressRange::decode(DataExtractor &Data, uint64_t BaseAddr,
88 const uint64_t AddrOffset = Data.getULEB128(&Offset);
89 const uint64_t Size = Data.getULEB128(&Offset);
90 const uint64_t StartAddr = BaseAddr + AddrOffset;
92 End = StartAddr + Size;
95 void AddressRanges::encode(FileWriter &O, uint64_t BaseAddr) const {
96 O.writeULEB(Ranges.size());
99 for (auto Range : Ranges)
100 Range.encode(O, BaseAddr);
103 void AddressRanges::decode(DataExtractor &Data, uint64_t BaseAddr,
106 uint64_t NumRanges = Data.getULEB128(&Offset);
109 Ranges.resize(NumRanges);
110 for (auto &Range : Ranges)
111 Range.decode(Data, BaseAddr, Offset);
114 void AddressRange::skip(DataExtractor &Data, uint64_t &Offset) {
115 Data.getULEB128(&Offset);
116 Data.getULEB128(&Offset);
119 uint64_t AddressRanges::skip(DataExtractor &Data, uint64_t &Offset) {
120 uint64_t NumRanges = Data.getULEB128(&Offset);
121 for (uint64_t I=0; I<NumRanges; ++I)
122 AddressRange::skip(Data, Offset);