1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
/*
Copyright (C) 2011 David Anderson. All Rights Reserved.
This program is free software; you can redistribute it and/or modify it
under the terms of version 2 of the GNU General Public License as
published by the Free Software Foundation.
This program is distributed in the hope that it would be useful, but
WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
Further, this software is distributed without any warranty that it is
free of the rightful claim of any third person regarding infringement
or the like. Any license provided herein, whether implied or
otherwise, applies only to this software file. Patent licenses, if
any, provided herein do not apply to combinations of this program with
other software, or any other product whatsoever.
You should have received a copy of the GNU General Public License along
with this program; if not, write the Free Software Foundation, Inc., 51
Franklin Street - Fifth Floor, Boston MA 02110-1301, USA.
*/
/*
These simple list-processing functions are in support
of checking DWARF for compiler-errors of various sorts.
*/
#include "globals.h"
#include <assert.h>
using std::cout;
using std::cerr;
using std::endl;
bool
AddressRangesData::IsAddressInAddressRange(Dwarf_Unsigned pc)
{
if(pc < low_pc_) {
return false;
}
if(pc > high_pc_) {
return false;
}
for(std::list<AddressRangeEntry>::iterator it =
address_range_data_.begin(); it != address_range_data_.end();
++it) {
if (it->inThisRange(pc) ) {
return true;
}
}
return false;
}
void
AddressRangeEntry::printAddressRangeEntry(unsigned ct)
{
cout <<"[" << IToDec(ct,6) << "] Low = " <<
IToHex(range_low_pc_, 10 ) <<
", High = " <<
IToHex(range_high_pc_, 10) << std::endl;
};
// Leave overall high/low as is, delete the details.
void
AddressRangesData::ResetRangesList()
{
address_range_data_.clear();
}
// We might want to sort these by low-address rather than printing
// in random order!
void
AddressRangesData::PrintRangesData()
{
unsigned ct = 0;
cout << "Begin Traversing, Low = "<<
IToHex(low_pc_,10) <<
" High = " <<
IToHex(high_pc_,10);
for(std::list<AddressRangeEntry>::iterator it =
address_range_data_.begin(); it != address_range_data_.end();
++it,++ct) {
it->printAddressRangeEntry(ct);
}
}
void
AddressRangesData::AddAddressRange(Dwarf_Unsigned low_pc, Dwarf_Unsigned high_pc)
{
// Presently we are not checking for duplicates, so some
// can be present.
address_range_data_.push_back(AddressRangeEntry(low_pc,high_pc));
};
void
AddressRangesData::SetLimitsAddressRange(Dwarf_Unsigned low_pc, Dwarf_Unsigned high_pc)
{
if(low_pc < high_pc) {
low_pc_ = low_pc;
high_pc_ = high_pc;
}
};
void
LinkOnceEntry::printLinkOnceEntry(unsigned ct)
{
cout <<"[" << IToDec(ct,6) << "] Low = " <<
IToHex(lo_section_low_pc_, 10 ) <<
", High = " <<
IToHex(lo_section_high_pc_, 10) <<
", section index = " <<
lo_section_index_ <<
", section = " <<
lo_section_name_ << std::endl;
};
void
LinkOnceData::PrintLinkOnceData()
{
unsigned ct = 0;
for(std::list<LinkOnceEntry>::iterator it =
link_once_data_.begin(); it != link_once_data_.end();
++it,++ct) {
it->printLinkOnceEntry(ct);
}
}
bool LinkOnceData::FindLinkOnceEntry(Dwarf_Unsigned pc)
{
std::list<LinkOnceEntry>::iterator it;
for( it = link_once_data_.begin(); it != link_once_data_.end();
++it) {
if (it->inThisLinkOnceRange(pc) ) {
return true;
}
}
return false;
}
bool LinkOnceData::FindLinkOnceEntry(const std::string &secname,Dwarf_Unsigned lopc,Dwarf_Unsigned hipc)
{
std::list<LinkOnceEntry>::iterator it;
for( it = link_once_data_.begin(); it != link_once_data_.end();
++it) {
if (it->inThisLinkOnceRange(secname,lopc,hipc) ) {
return true;
}
}
return false;
}
|
