blob: 0cf71f530446b2cafcd98da9fbdf37524e824b61 [file] [log] [blame]
Eugene Zelenkoe94042c2017-02-27 23:43:14 +00001//===- DWARFDebugAranges.cpp ----------------------------------------------===//
Benjamin Kramera6002fd2011-09-14 01:09:52 +00002//
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
Zachary Turner82af9432015-01-30 18:07:45 +000010#include "llvm/DebugInfo/DWARF/DWARFDebugAranges.h"
11#include "llvm/DebugInfo/DWARF/DWARFCompileUnit.h"
12#include "llvm/DebugInfo/DWARF/DWARFContext.h"
13#include "llvm/DebugInfo/DWARF/DWARFDebugArangeSet.h"
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000014#include "llvm/Support/DataExtractor.h"
Benjamin Kramera6002fd2011-09-14 01:09:52 +000015#include <algorithm>
16#include <cassert>
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000017#include <cstdint>
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000018#include <set>
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000019#include <vector>
20
Benjamin Kramera6002fd2011-09-14 01:09:52 +000021using namespace llvm;
22
Alexey Samsonov0c9b7252013-10-01 15:48:10 +000023void DWARFDebugAranges::extract(DataExtractor DebugArangesData) {
24 if (!DebugArangesData.isValidOffset(0))
25 return;
Alexey Samsonovad4bf3d2013-10-01 16:52:46 +000026 uint32_t Offset = 0;
Alexey Samsonovad4bf3d2013-10-01 16:52:46 +000027 DWARFDebugArangeSet Set;
Benjamin Kramera6002fd2011-09-14 01:09:52 +000028
Alexey Samsonovad4bf3d2013-10-01 16:52:46 +000029 while (Set.extract(DebugArangesData, &Offset)) {
Alexey Samsonovfee0ee22014-04-28 22:27:46 +000030 uint32_t CUOffset = Set.getCompileUnitDIEOffset();
31 for (const auto &Desc : Set.descriptors()) {
Alexey Samsonov1eabf982014-03-13 07:52:54 +000032 uint64_t LowPC = Desc.Address;
33 uint64_t HighPC = Desc.getEndAddress();
Alexey Samsonovad4bf3d2013-10-01 16:52:46 +000034 appendRange(CUOffset, LowPC, HighPC);
35 }
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000036 ParsedCUOffsets.insert(CUOffset);
Alexey Samsonovad4bf3d2013-10-01 16:52:46 +000037 }
Benjamin Kramera6002fd2011-09-14 01:09:52 +000038}
39
Alexey Samsonov0c9b7252013-10-01 15:48:10 +000040void DWARFDebugAranges::generate(DWARFContext *CTX) {
Alexey Samsonov15a23352013-10-02 07:12:47 +000041 clear();
42 if (!CTX)
43 return;
44
45 // Extract aranges from .debug_aranges section.
46 DataExtractor ArangesData(CTX->getARangeSection(), CTX->isLittleEndian(), 0);
47 extract(ArangesData);
48
49 // Generate aranges from DIEs: even if .debug_aranges section is present,
50 // it may describe only a small subset of compilation units, so we need to
51 // manually build aranges for the rest of them.
Alexey Samsonov1eabf982014-03-13 07:52:54 +000052 for (const auto &CU : CTX->compile_units()) {
53 uint32_t CUOffset = CU->getOffset();
Alexey Samsonov762343d2014-04-18 17:25:46 +000054 if (ParsedCUOffsets.insert(CUOffset).second) {
55 DWARFAddressRangesVector CURanges;
56 CU->collectAddressRanges(CURanges);
57 for (const auto &R : CURanges) {
58 appendRange(CUOffset, R.first, R.second);
59 }
60 }
Benjamin Kramer32664932011-09-14 20:52:27 +000061 }
Alexey Samsonov15a23352013-10-02 07:12:47 +000062
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000063 construct();
Benjamin Kramer32664932011-09-14 20:52:27 +000064}
65
Alexey Samsonov001ecd92014-04-25 21:30:03 +000066void DWARFDebugAranges::clear() {
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000067 Endpoints.clear();
Alexey Samsonov001ecd92014-04-25 21:30:03 +000068 Aranges.clear();
69 ParsedCUOffsets.clear();
70}
71
Alexey Samsonov0c9b7252013-10-01 15:48:10 +000072void DWARFDebugAranges::appendRange(uint32_t CUOffset, uint64_t LowPC,
73 uint64_t HighPC) {
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000074 if (LowPC >= HighPC)
75 return;
76 Endpoints.emplace_back(LowPC, CUOffset, true);
77 Endpoints.emplace_back(HighPC, CUOffset, false);
Benjamin Kramera6002fd2011-09-14 01:09:52 +000078}
79
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000080void DWARFDebugAranges::construct() {
81 std::multiset<uint32_t> ValidCUs; // Maintain the set of CUs describing
82 // a current address range.
83 std::sort(Endpoints.begin(), Endpoints.end());
84 uint64_t PrevAddress = -1ULL;
85 for (const auto &E : Endpoints) {
Eugene Zelenkoe94042c2017-02-27 23:43:14 +000086 if (PrevAddress < E.Address && !ValidCUs.empty()) {
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000087 // If the address range between two endpoints is described by some
88 // CU, first try to extend the last range in Aranges. If we can't
89 // do it, start a new range.
90 if (!Aranges.empty() && Aranges.back().HighPC() == PrevAddress &&
91 ValidCUs.find(Aranges.back().CUOffset) != ValidCUs.end()) {
92 Aranges.back().setHighPC(E.Address);
93 } else {
94 Aranges.emplace_back(PrevAddress, E.Address, *ValidCUs.begin());
95 }
Benjamin Kramera6002fd2011-09-14 01:09:52 +000096 }
Alexey Samsonov0670cfa2014-06-12 23:58:49 +000097 // Update the set of valid CUs.
98 if (E.IsRangeStart) {
99 ValidCUs.insert(E.CUOffset);
100 } else {
101 auto CUPos = ValidCUs.find(E.CUOffset);
102 assert(CUPos != ValidCUs.end());
103 ValidCUs.erase(CUPos);
104 }
105 PrevAddress = E.Address;
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000106 }
Alexey Samsonov0670cfa2014-06-12 23:58:49 +0000107 assert(ValidCUs.empty());
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000108
Alexey Samsonov0670cfa2014-06-12 23:58:49 +0000109 // Endpoints are not needed now.
110 std::vector<RangeEndpoint> EmptyEndpoints;
111 EmptyEndpoints.swap(Endpoints);
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000112}
113
Alexey Samsonov0c9b7252013-10-01 15:48:10 +0000114uint32_t DWARFDebugAranges::findAddress(uint64_t Address) const {
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000115 if (!Aranges.empty()) {
Alexey Samsonov0c9b7252013-10-01 15:48:10 +0000116 Range range(Address);
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000117 RangeCollIterator begin = Aranges.begin();
118 RangeCollIterator end = Aranges.end();
Alexey Samsonov97e8a872013-10-01 16:25:14 +0000119 RangeCollIterator pos =
120 std::lower_bound(begin, end, range);
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000121
Alexey Samsonov97e8a872013-10-01 16:25:14 +0000122 if (pos != end && pos->containsAddress(Address)) {
123 return pos->CUOffset;
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000124 } else if (pos != begin) {
125 --pos;
Alexey Samsonov97e8a872013-10-01 16:25:14 +0000126 if (pos->containsAddress(Address))
127 return pos->CUOffset;
Benjamin Kramera6002fd2011-09-14 01:09:52 +0000128 }
129 }
130 return -1U;
131}