-
Notifications
You must be signed in to change notification settings - Fork 2
/
Block.cpp
319 lines (290 loc) · 7.81 KB
/
Block.cpp
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
#include"Block.h"
int Block::count = 0;
Block::Block(int _functionId) {
functionId = _functionId;
id = count++;
}
void Block::insert(MidCode c) {
v.push_back(c);
}
void Block::addPrev(Block* b) {
prev.push_back(b);
}
void Block::addNext(Block* b) {
next.push_back(b);
}
/*扫描这个基本块中的use def集合*/
void Block::useDefScan() {
for (int index = v.size() - 1; index >= 0;index--) {
MidCode i = v[index];
//正常三地址运算,注意立即数问题
if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
|| i.op == MIDNEQ||i.op==MIDARRAYGET||i.op==MIDREM) {
use.erase(i.target);
def.insert(i.target);
if (!i.isImmediate1) {
def.erase(i.operand1);
use.insert(i.operand1);
}
if (!i.isImmediate2) {
def.erase(i.operand2);
use.insert(i.operand2);
}
}
//只使用operand1,ret存在使得需要考虑-1问题
else if (i.op == MIDPUSH || i.op == MIDRET||i.op==MIDBNZ||i.op==MIDBZ
||i.op==MIDPRINTINT||i.op==MIDPRINTCHAR) {
if (!i.isImmediate1&&i.operand1!=-1) {
def.erase(i.operand1);
use.insert(i.operand1);
}
}
//使用operand1并返回值,其中assign需要考虑排除-1
else if (i.op == MIDNEGATE || i.op == MIDASSIGN) {
use.erase(i.target);
def.insert(i.target);
if ((!i.isImmediate1)&&i.operand1!=-1) {
def.erase(i.operand1);
use.insert(i.operand1);
}
}
//数组写操作只会使用2个操作数,但是不会对target造成影响,因为数组地址没变
else if (i.op == MIDARRAYWRITE) {
if (!i.isImmediate1) {
def.erase(i.operand1);
use.insert(i.operand1);
}
if (!i.isImmediate2) {
def.erase(i.operand2);
use.insert(i.operand2);
}
}//只使用target
else if (i.op == MIDREADCHAR || i.op == MIDREADINTEGER) {
use.erase(i.target);
def.insert(i.target);
}
}
}
bool Block::activeVariableAnalyzeEpoch() {
int oldsize = activeIn.size();
for (Block* i : next) {
activeOut = setUnion(activeOut, i->activeIn);
}
set<int>tmp = setDifference(activeOut, def);
activeIn = setUnion(tmp, use);
return oldsize != activeIn.size();
}
vector<vector<int>>Block::conflictEdgeAnalyze(){
/*冲突边的构建原则是,只要在变量定义处活跃的变量全都算是冲突*/
vector<vector<int>>res;
set<int>localActive;
localActive = activeOut;
for (int line = v.size() - 1; line >= 0; line--) {
MidCode i = v[line];
//正常三地址运算
if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
|| i.op == MIDNEQ || i.op == MIDARRAYGET||i.op==MIDREM) {
localActive.erase(i.target);
if (!i.isImmediate1) {
localActive.insert(i.operand1);
}
if (!i.isImmediate2) {
localActive.insert(i.operand2);
}
for (int j : localActive) {
if (i.target != j) {
res.push_back({ j,i.target });
}
if (!i.isImmediate1 && i.operand1 != -1&&i.operand1!=j) {
res.push_back({ j,i.operand1 });
}
if (!i.isImmediate2 && i.operand2 != -1 && i.operand2 != j) {
res.push_back({ j,i.operand2 });
}
}
}
//只使用operand1
else if (i.op == MIDPUSH || i.op == MIDRET || i.op == MIDBNZ || i.op == MIDBZ
|| i.op == MIDPRINTINT || i.op == MIDPRINTCHAR) {
if (!i.isImmediate1&&i.operand1!=-1) {
localActive.insert(i.operand1);
}
for (int j : localActive) {
if (!i.isImmediate1 && i.operand1 != -1 && i.operand1 != j) {
res.push_back({ j,i.operand1 });
}
}
}
//使用operand1并返回值,其中assign需要考虑排除-1
else if (i.op == MIDNEGATE || i.op == MIDASSIGN) {
localActive.erase(i.target);
if (!i.isImmediate1 && i.operand1 != -1) {
localActive.insert(i.operand1);
}
for (int j : localActive) {
if (i.target != j) {
res.push_back({ j,i.target });
}
if (!i.isImmediate1 && i.operand1 != -1 && i.operand1 != j) {
res.push_back({ j,i.operand1 });
}
}
}
//数组写操作只会使用2个操作数,但是不会对target造成影响,因为数组地址没变
else if (i.op == MIDARRAYWRITE) {
if (!i.isImmediate1) {
localActive.insert(i.operand1);
}
if (!i.isImmediate2) {
localActive.insert(i.operand2);
}
for (int j : localActive) {
if (!i.isImmediate1 && i.operand1 != -1 && i.operand1 != j) {
res.push_back({ j,i.operand1 });
}
if (!i.isImmediate2 && i.operand2 != -1 && i.operand2 != j) {
res.push_back({ j,i.operand2 });
}
}
}
//只有target
else if (i.op == MIDREADCHAR || i.op == MIDREADINTEGER) {
localActive.erase(i.target);
for (int j : localActive) {
if (i.target != j) {
res.push_back({ j,i.target });
}
}
}
}
return res;
}
void Block::DAGoptimize() {
DagMap dag(activeOut,activeIn);
for (MidCode c : v) {
dag.handleMidCode(c);
}
vector<MidCode>tmp = dag.dumpMidCode();
if (v.size() > tmp.size()) {
v = tmp;
}
}
void Block::eliminateDeadCode() {
DeadCodeEliminator eliminator(activeOut);
v=eliminator.eliminateDeadCode(v);
}
void Block::blockOptimize() {
BlockOptimization bop(activeOut);
v = bop.propagationInBlock(v);
}
void Block::peepholeOptimize() {
PeepHoleOptimization opt;
v = opt.peepHoleOptimization(v);
}
set<int>Block::setUnion(set<int> a, set<int> b) {
set<int>res;
for (int i : a) {
res.insert(i);
}
for (int i : b) {
res.insert(i);
}
return res;
}
set<int>Block::setDifference(set<int> a, set<int> b) {
set<int>res;
for (int i : a) {
res.insert(i);
}
for (int i : b) {
res.erase(i);
}
return res;
}
ostream& operator<<(ostream& out, Block b) {
out << "====Block"<<b.id<<"====" << endl;
for (MidCode& i : b.v) {
out << i;
}
out << "\t" << "prev:[";
for (Block* i : b.prev) {
out << i->id << ",";
}
out << "]" << endl;
out << "\t" << "next:[";
for (Block* i : b.next) {
out << i->id << ",";
}
out << "]" << endl;
out << "\t" << "use:[";
for (int i : b.use) {
out << MidCode::getOperandName(i, false) << ",";
}
out << "]" << endl;
out << "\t" << "def:[";
for (int i : b.def) {
out << MidCode::getOperandName(i, false) << ",";
}
out << "]" << endl;
out << "\t" << "activeIn:[";
for (int i : b.activeIn) {
out << MidCode::getOperandName(i, false) << ",";
}
out << "]" << endl;
out << "\t" << "activeOut:[";
for (int i : b.activeOut) {
out << MidCode::getOperandName(i, false) << ",";
}
out << "]" << endl;
out << "=============="<<endl;
return out;
}
void Block::activeVariableAnalyzePerLine() {
set<int>localActive = activeOut;
for (int line = v.size() - 1; line >= 0; line--) {
MidCode i = v[line];
v[line].activeVariable = localActive;
//三地址运算
if (i.op == MIDADD || i.op == MIDSUB || i.op == MIDMULT
|| i.op == MIDDIV || i.op == MIDLSS || i.op == MIDLEQ
|| i.op == MIDGRE || i.op == MIDGEQ || i.op == MIDEQL
|| i.op == MIDNEQ || i.op == MIDARRAYGET||i.op==MIDREM) {
localActive.erase(i.target);
if (!i.isImmediate1) {
localActive.insert(i.operand1);
}
if (!i.isImmediate2) {
localActive.insert(i.operand2);
}
}
//只使用operand1
else if (i.op == MIDPUSH || i.op == MIDRET || i.op == MIDBNZ || i.op == MIDBZ
|| i.op == MIDPRINTINT || i.op == MIDPRINTCHAR) {
if (!i.isImmediate1 && i.operand1 != -1) {
localActive.insert(i.operand1);
}
}
//使用operand1并返回值,其中assign需要考虑排除-1
else if (i.op == MIDNEGATE || i.op == MIDASSIGN) {
localActive.erase(i.target);
if (!i.isImmediate1 && i.operand1 != -1) {
localActive.insert(i.operand1);
}
}
else if (i.op == MIDARRAYWRITE) {
if (!i.isImmediate1) {
localActive.insert(i.operand1);
}
if (!i.isImmediate2) {
localActive.insert(i.operand2);
}
}
else if (i.op == MIDREADCHAR || i.op == MIDREADINTEGER) {
localActive.erase(i.target);
}
}
}