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
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
use std::ops::Range;
use std::slice::Iter;
use std::usize;
use std::borrow::Cow;
use {
Mnemonic,BasicBlock,Names,Strings,
Result,
Statement,Bitcode,BitcodeIter,Segments
};
pub enum StatementsIter<'a> {
Bitcode(BitcodeIter<'a>),
Vector(Iter<'a,Statement>),
}
impl<'a> Iterator for StatementsIter<'a> {
type Item = Cow<'a,Statement>;
fn next(&mut self) -> Option<Cow<'a,Statement>> {
match self {
&mut StatementsIter::Bitcode(ref mut bt) => bt.next().map(|x| Cow::Owned(x)),
&mut StatementsIter::Vector(ref mut v) => v.next().map(|x| Cow::Borrowed(x)),
}
}
}
pub enum RewriteControl {
Continue,
Break,
}
#[derive(Clone, Debug)]
pub enum Statements {
Bitcode(Bitcode),
Vector(Vec<Statement>),
}
impl Default for Statements {
fn default() -> Statements {
Statements::Vector(Vec::new())
}
}
impl Statements {
pub fn iter_range<'a>(&'a self, rgn: Range<usize>) -> StatementsIter<'a> {
match self {
&Statements::Bitcode(ref bt) => StatementsIter::Bitcode(bt.iter_range(rgn)),
&Statements::Vector(ref v) => StatementsIter::Vector(v[rgn].iter()),
}
}
pub fn rewrite<F: FnMut(&mut Statement, &mut Names, &mut Strings, &mut Segments) -> Result<RewriteControl> + Sized>(&mut self, rgn: Range<usize>, names: &mut Names, strings: &mut Strings, segments: &mut Segments, mut f: F) -> Result<Range<usize>> {
match self {
&mut Statements::Bitcode(ref mut bt) => bt.rewrite(rgn,names,strings,segments,f),
&mut Statements::Vector(ref mut v) => {
for stmt in v[rgn.clone()].iter_mut() {
match f(stmt,names,strings,segments)? {
RewriteControl::Break => { break; }
RewriteControl::Continue => { continue; }
}
}
Ok(rgn)
}
}
}
pub fn insert(&mut self, pos: usize, stmts: Vec<Statement>) -> Result<Range<usize>> {
match self {
&mut Statements::Bitcode(ref mut bt) => bt.insert(pos,stmts),
&mut Statements::Vector(ref mut v) => {
let rgn = pos..(pos + stmts.len());
for (i,stmt) in stmts.into_iter().enumerate() {
v.insert(i + pos,stmt);
}
Ok(rgn)
}
}
}
pub fn remove(&mut self, rgn: Range<usize>) {
match self {
&mut Statements::Bitcode(ref mut bt) => bt.remove(rgn),
&mut Statements::Vector(ref mut v) => { v.drain(rgn); }
}
}
pub fn append<I: IntoIterator<Item=Statement> + Sized>(&mut self, i: I) -> Result<Range<usize>> {
match self {
&mut Statements::Bitcode(ref mut bt) => bt.append(i),
&mut Statements::Vector(ref mut v) => {
let fst = v.len();
v.extend(i);
Ok(fst..v.len())
}
}
}
pub fn len(&self) -> usize {
match self {
&Statements::Bitcode(ref bt) => bt.num_bytes(),
&Statements::Vector(ref v) => v.len(),
}
}
pub fn pack(&mut self, basic_blocks: &mut Vec<BasicBlock>, mnemonics: &mut Vec<Mnemonic>) -> Result<()> {
*self = match self {
&mut Statements::Bitcode(_) => { return Ok(()); },
&mut Statements::Vector(ref mut vec) => {
let mut bc = Bitcode::with_capacity(vec.len() * 15);
for bb in basic_blocks.iter_mut() {
let mut old_idx = bb.statements.start;
let mut new_idx = bc.num_bytes();
let new_start = new_idx;
let mne_rgn = bb.mnemonics.start.index()..bb.mnemonics.end.index();
for mne in mnemonics[mne_rgn].iter_mut() {
let old_rgn = old_idx..(old_idx + mne.statement_count);
let new_rgn = bc.append(vec[old_rgn].iter().cloned())?;
old_idx += mne.statement_count;
mne.statement_count = new_rgn.end - new_rgn.start;
new_idx += mne.statement_count;
}
assert_eq!(bb.statements.end, old_idx);
bb.statements = new_start..new_idx;
}
Statements::Bitcode(bc)
}
};
Ok(())
}
pub fn unpack(&mut self, basic_blocks: &mut Vec<BasicBlock>, mnemonics: &mut Vec<Mnemonic>) -> Result<()> {
*self = match self {
&mut Statements::Vector(_) => { return Ok(()); }
&mut Statements::Bitcode(ref bc) => {
let mut vec = Vec::with_capacity(bc.num_bytes() / 15);
for bb in basic_blocks.iter_mut() {
let mut old_idx = bb.statements.start;
let mut new_idx = vec.len();
let new_start = new_idx;
let mne_rgn = bb.mnemonics.start.index()..bb.mnemonics.end.index();
for mne in mnemonics[mne_rgn].iter_mut() {
let old_rgn = old_idx..(old_idx + mne.statement_count);
vec.extend(bc.iter_range(old_rgn));
old_idx += mne.statement_count;
mne.statement_count = vec.len() - new_idx;
new_idx += mne.statement_count;
}
assert_eq!(bb.statements.end, old_idx);
bb.statements = new_start..new_idx;
}
Statements::Vector(vec)
}
};
Ok(())
}
}