blob: f4d31f328a2ee08b1f127f16a151a55c3667d3f5 [file] [log] [blame]
Greg Clayton044776b2019-06-26 14:09:09 +00001//===- Range.cpp ------------------------------------------------*- C++ -*-===//
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/GSYM/Range.h"
Greg Claytonbf9ee072019-08-21 21:48:11 +000011#include "llvm/DebugInfo/GSYM/FileWriter.h"
12#include "llvm/Support/DataExtractor.h"
Greg Clayton044776b2019-06-26 14:09:09 +000013#include <algorithm>
14#include <inttypes.h>
15
16using namespace llvm;
17using namespace gsym;
18
19
Fangrui Song493a1202019-06-28 10:06:11 +000020void AddressRanges::insert(AddressRange Range) {
Greg Clayton044776b2019-06-26 14:09:09 +000021 if (Range.size() == 0)
22 return;
Greg Clayton044776b2019-06-26 14:09:09 +000023
Fangrui Song493a1202019-06-28 10:06:11 +000024 auto It = llvm::upper_bound(Ranges, Range);
25 auto It2 = It;
26 while (It2 != Ranges.end() && It2->Start < Range.End)
27 ++It2;
28 if (It != It2) {
29 Range.End = std::max(Range.End, It2[-1].End);
30 It = Ranges.erase(It, It2);
Greg Clayton044776b2019-06-26 14:09:09 +000031 }
Fangrui Song493a1202019-06-28 10:06:11 +000032 if (It != Ranges.begin() && Range.Start < It[-1].End)
33 It[-1].End = std::max(It[-1].End, Range.End);
34 else
35 Ranges.insert(It, Range);
Greg Clayton044776b2019-06-26 14:09:09 +000036}
37
38bool AddressRanges::contains(uint64_t Addr) const {
Fangrui Songe662b692019-06-28 08:58:05 +000039 auto It = std::partition_point(
40 Ranges.begin(), Ranges.end(),
Fangrui Song493a1202019-06-28 10:06:11 +000041 [=](const AddressRange &R) { return R.Start <= Addr; });
42 return It != Ranges.begin() && Addr < It[-1].End;
Greg Clayton044776b2019-06-26 14:09:09 +000043}
44
45raw_ostream &llvm::gsym::operator<<(raw_ostream &OS, const AddressRange &R) {
Fangrui Song493a1202019-06-28 10:06:11 +000046 return OS << '[' << HEX64(R.Start) << " - " << HEX64(R.End) << ")";
Greg Clayton044776b2019-06-26 14:09:09 +000047}
48
49raw_ostream &llvm::gsym::operator<<(raw_ostream &OS, const AddressRanges &AR) {
50 size_t Size = AR.size();
Fangrui Song493a1202019-06-28 10:06:11 +000051 for (size_t I = 0; I < Size; ++I) {
Greg Clayton044776b2019-06-26 14:09:09 +000052 if (I)
53 OS << ' ';
54 OS << AR[I];
55 }
56 return OS;
57}
Greg Claytonbf9ee072019-08-21 21:48:11 +000058
59void AddressRange::encode(FileWriter &O, uint64_t BaseAddr) const {
60 assert(Start >= BaseAddr);
61 O.writeULEB(Start - BaseAddr);
62 O.writeULEB(size());
63}
64
65void AddressRange::decode(DataExtractor &Data, uint64_t BaseAddr,
66 uint64_t &Offset) {
67 const uint64_t AddrOffset = Data.getULEB128(&Offset);
68 const uint64_t Size = Data.getULEB128(&Offset);
69 const uint64_t StartAddr = BaseAddr + AddrOffset;
70 Start = StartAddr;
71 End = StartAddr + Size;
72}
73
74void AddressRanges::encode(FileWriter &O, uint64_t BaseAddr) const {
75 O.writeULEB(Ranges.size());
76 if (Ranges.empty())
77 return;
78 for (auto Range : Ranges)
79 Range.encode(O, BaseAddr);
80}
81
82void AddressRanges::decode(DataExtractor &Data, uint64_t BaseAddr,
83 uint64_t &Offset) {
84 clear();
85 uint64_t NumRanges = Data.getULEB128(&Offset);
86 if (NumRanges == 0)
87 return;
88 Ranges.resize(NumRanges);
89 for (auto &Range : Ranges)
90 Range.decode(Data, BaseAddr, Offset);
91}