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
157
158
159
160
161
162
163
164
165
166
167
|
/*
Copyright (C) 2010-2013 David Anderson. All rights reserved.
Redistribution and use in source and binary forms, with or without
modification, are permitted provided that the following conditions are met:
* Redistributions of source code must retain the above copyright
notice, this list of conditions and the following disclaimer.
* Redistributions in binary form must reproduce the above copyright
notice, this list of conditions and the following disclaimer in the
documentation and/or other materials provided with the distribution.
* Neither the name of the example nor the
names of its contributors may be used to endorse or promote products
derived from this software without specific prior written permission.
THIS SOFTWARE IS PROVIDED BY David Anderson ''AS IS'' AND ANY
EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
DISCLAIMED. IN NO EVENT SHALL David Anderson BE LIABLE FOR ANY
DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
//
// irepframe.h
//
class IRCie {
public:
IRCie(): cie_byte_length_(0), version_(0),
code_alignment_factor_(1),
data_alignment_factor_(1),
return_address_register_rule_(0)
{};
IRCie(Dwarf_Unsigned length, Dwarf_Unsigned version,
const std::string &augmentation, Dwarf_Unsigned code_align,
Dwarf_Signed data_align, Dwarf_Half return_reg_rule,
const void * init_instrs, Dwarf_Unsigned instrs_len):
cie_byte_length_(length), version_(version),
augmentation_(augmentation), code_alignment_factor_(code_align),
data_alignment_factor_(data_align),
return_address_register_rule_(return_reg_rule)
{
const Dwarf_Small *x =
reinterpret_cast<const Dwarf_Small *>(init_instrs);
for(Dwarf_Unsigned i = 0; i < instrs_len; ++i) {
initial_instructions_.push_back(x[i]);
}
}
void insert_fde_index(unsigned i) { fde_index_.push_back(i); };
~IRCie() {};
void get_basic_cie_data(Dwarf_Unsigned * version,
std::string * aug,
Dwarf_Unsigned * code_align,
Dwarf_Signed * data_align,
Dwarf_Half * ret_addr_reg) {
*version = version_;
*aug = augmentation_;
*code_align = code_alignment_factor_;
*data_align = data_alignment_factor_;
*ret_addr_reg = return_address_register_rule_;
}
void get_init_instructions(Dwarf_Unsigned *len,
void **bytes) {
*len = initial_instructions_.size();
*bytes = reinterpret_cast<void *>(&initial_instructions_[0]);
};
private:
// Byte length 0 if not known yet.
Dwarf_Unsigned cie_byte_length_;
Dwarf_Unsigned version_;
std::string augmentation_;
Dwarf_Unsigned code_alignment_factor_;
Dwarf_Signed data_alignment_factor_;
Dwarf_Half return_address_register_rule_;
std::vector<Dwarf_Small> initial_instructions_;
// fde_index is the array of indexes into fdedata_
// that are fdes used by this cie.
std::vector<unsigned> fde_index_;
};
class IRFde {
public:
IRFde(): low_pc_(0), func_length_(0),
cie_offset_(0), cie_index_(-1),
fde_offset_(0) {};
IRFde(Dwarf_Addr low_pc,Dwarf_Unsigned func_length,
Dwarf_Ptr fde_bytes, Dwarf_Unsigned fde_length,
Dwarf_Off cie_offset,Dwarf_Signed cie_index,
Dwarf_Off fde_offset): low_pc_(low_pc), func_length_(func_length),
cie_offset_(cie_offset), cie_index_(cie_index),
fde_offset_(fde_offset) {
const Dwarf_Small *x =
reinterpret_cast<const Dwarf_Small *>(fde_bytes);
for(Dwarf_Unsigned i = 0; i < fde_length; ++i) {
fde_bytes_.push_back(x[i]);
}
};
~IRFde() {};
Dwarf_Signed cie_index() { return cie_index_; };
void get_fde_base_data(Dwarf_Addr *lowpc, Dwarf_Unsigned * funclen,
Dwarf_Signed *cie_index_input) {
*lowpc = low_pc_;
*funclen = func_length_;
*cie_index_input = cie_index_;
};
void get_fde_instrs_into_ir(Dwarf_Ptr ip,Dwarf_Unsigned len ) {
const Dwarf_Small *x =
reinterpret_cast<const Dwarf_Small *>(ip);
for(Dwarf_Unsigned i = 0; i < len; ++i) {
fde_instrs_.push_back(x[i]);
}
};
void get_fde_instructions(Dwarf_Unsigned *len,
void **bytes) {
*len = fde_instrs_.size();
*bytes = reinterpret_cast<void *>(&fde_instrs_[0]);
};
void fde_instrs () {
};
private:
Dwarf_Addr low_pc_;
Dwarf_Unsigned func_length_;
// fde_bytes_ may be empty if content bytes not yet created.
std::vector<Dwarf_Small> fde_bytes_;
// fde_instrs_ is simply a vector of bytes.
// it might be good to actually parse the
// instructions.
std::vector<Dwarf_Small> fde_instrs_;
// cie_offset may be 0 if not known yet.
Dwarf_Off cie_offset_;
// cie_index is the index in ciedata_ of
// the applicable CIE. Begins with index 0.
Dwarf_Signed cie_index_;
// fde_offset may be 0 if not yet known.
Dwarf_Off fde_offset_;
};
class IRFrame {
public:
IRFrame() {};
~IRFrame() {};
void insert_cie(IRCie &cie) {
ciedata_.push_back(cie);
}
void insert_fde(IRFde &fdedata) {
fdedata_.push_back(fdedata);
unsigned findex = fdedata_.size() -1;
Dwarf_Signed cindex = fdedata.cie_index();
if( cindex != -1) {
IRCie & mycie = ciedata_[cindex];
mycie.insert_fde_index(findex);
}
}
std::vector<IRCie> &get_cie_vec() { return ciedata_; };
std::vector<IRFde> &get_fde_vec() { return fdedata_; };
private:
std::vector<IRCie> ciedata_;
std::vector<IRFde> fdedata_;
};
|
