-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathbit-prob.cpp
More file actions
343 lines (299 loc) · 11.5 KB
/
Copy pathbit-prob.cpp
File metadata and controls
343 lines (299 loc) · 11.5 KB
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
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
#include <bits/stdc++.h>
#ifndef defs_hpp
#include "defs.hpp"
#define defs_hpp
#endif
using namespace std;
extern int n;
extern vector<eeyoreAST *> alter;
extern vector<eeyoreAST *> seq;
extern typeAST type[maxlines];
extern bool _has_no_side_effect(string this_func) ;
extern bool _is_param_stable() ;
extern bool _is_call_once(string this_func) ;
extern bool _is_sensitive(string var_name) ;
extern bool _is_param(string var_name) ;
extern bool _not_use_var(string var_name, int line) ;
string lx, ly, lz, pi;
string lA, ret, lEnd;
string tj, tk, Tx;
eeyoreAST *R0, *R1, *R2, *R3;
vector<eeyoreAST *> stmts3_4, stmts5, stmts6;
string cpower[32];
void _best_multiply() {
alter.clear();
string ret = varManager->newT(false);
string b0 = varManager->newT(false);
string b1 = varManager->newT(false);
string p2 = varManager->newT(false);
alter.push_back(new _eDEFVAR(ret, false));
alter.push_back(new _eDEFVAR(b0, false));
alter.push_back(new _eDEFVAR(b1, false));
alter.push_back(new _eDEFVAR(p2, false));
string loop = varManager->newl();
string exit = varManager->newl();
string evenx1 = varManager->newl();
string eveny1 = varManager->newl();
string even0 = varManager->newl();
alter.push_back(new _eDIRECT(new _eVAR(ret), new _eNUM(0)));
alter.push_back(new _eLABEL(loop));
alter.push_back(new _eIFGOTO(new _eVAR("p1"), "==", new _eNUM(0), exit));
alter.push_back(new _eBINARY(new _eVAR("p0"), new _eVAR("p0"), "%u", new _eVAR("T0")));
alter.push_back(new _eBINARY(new _eVAR(b0), new _eVAR("p1"), "&", new _eNUM(1)));
alter.push_back(new _eBINARY(new _eVAR(b1), new _eVAR("p1"), "&", new _eNUM(2)));
alter.push_back(new _eBINARY(new _eVAR("p1"), new _eVAR("p1"), "/", new _eNUM(4)));
alter.push_back(new _eBINARY(new _eVAR(p2), new _eVAR("p0"), "*", new _eNUM(2)));
alter.push_back(new _eIFGOTO(new _eVAR(b0), "==", new _eNUM(0), even0));
alter.push_back(new _eBINARY(new _eVAR(ret), new _eVAR(ret), "+", new _eVAR("p0")));
alter.push_back(new _eIFGOTO(new _eVAR(b1), "==", new _eNUM(0), evenx1));
alter.push_back(new _eBINARY(new _eVAR(ret), new _eVAR(ret), "+", new _eVAR(p2)));
alter.push_back(new _eLABEL(evenx1));
alter.push_back(new _eBINARY(new _eVAR("p0"), new _eVAR("p0"), "*", new _eNUM(4)));
alter.push_back(new _eBINARY(new _eVAR(ret), new _eVAR(ret), "%u", new _eVAR("T0")));
alter.push_back(new _eGOTO(loop));
alter.push_back(new _eLABEL(even0));
alter.push_back(new _eIFGOTO(new _eVAR(b1), "==", new _eNUM(0), eveny1));
alter.push_back(new _eBINARY(new _eVAR(ret), new _eVAR(ret), "+", new _eVAR(p2)));
alter.push_back(new _eBINARY(new _eVAR("p0"), new _eVAR("p0"), "*", new _eNUM(4)));
alter.push_back(new _eBINARY(new _eVAR(ret), new _eVAR(ret), "%u", new _eVAR("T0")));
alter.push_back(new _eGOTO(loop));
alter.push_back(new _eLABEL(eveny1));
alter.push_back(new _eBINARY(new _eVAR("p0"), new _eVAR("p0"), "*", new _eNUM(4)));
alter.push_back(new _eGOTO(loop));
alter.push_back(new _eLABEL(exit));
alter.push_back(new _eRET(new _eVAR(ret)));
}
void _divide_conquer(int l, int r) {
if (l == r) {
alter.push_back(new _eGOTO(cpower[l - 1]));
return ;
}
int m = l + r >> 1;
string lbranch = (l < m) ? varManager->newl() : (l ? cpower[l - 1] : lEnd);
alter.push_back(new _eIFGOTO(new _eVAR(pi), "<", new _eNUM(1 << m + 1), lbranch));
_divide_conquer(m + 1, r);
if (l < m) {
alter.push_back(new _eLABEL(lbranch));
_divide_conquer(l, m);
}
}
void _calc_body(int index) {
string dpower = varManager->newl();
/* -> cpower: */
alter.push_back(new _eLABEL(cpower[index]));
/* -> stms3.. stmts4.. */
alter.insert(alter.end(), stmts3_4.begin(), stmts3_4.end());
/* -> tk = pi & $2^index$ */
alter.push_back(new _eBINARY(new _eVAR(tk), new _eVAR(pi), "&", new _eNUM(1 << index)));
/* -> if tk == 0 goto dpower */
alter.push_back(new _eIFGOTO(new _eVAR(tk), "==", new _eNUM(0), dpower));
/* -> stms5.. */
alter.insert(alter.end(), stmts5.begin(), stmts5.end());
/* -> goto $cpower-1$ */
alter.push_back(new _eGOTO(index > 0 ? cpower[index - 1] : lEnd));
/* -> dpower: */
alter.push_back(new _eLABEL(dpower));
/* -> stms6.. */
alter.insert(alter.end(), stmts6.begin(), stmts6.end());
}
bool _pattern_matching_bit_prob(string this_func, int arity, bool def1) {
if (!_has_no_side_effect(this_func)) return false;
if (!_is_param_stable()) return false;
if (!_is_call_once(this_func)) return false;
/* assertion: every seq[line] ptr is not null */
for (int i = 0; i < n; i++)
assert(seq[i] != NULL);
alter.clear(); stmts3_4.clear(); stmts5.clear(); stmts6.clear();
lA = varManager->newl();
lEnd = varManager->newl();
ret = varManager->newT(false);
alter.push_back(new _eDEFVAR(ret, false));
int line = 0;
/* decls */
for (; line < n; line++) {
if (type[line] != DEFARR && type[line] != DEFVAR) break;
alter.push_back(seq[line]);
}
/* if pi != 0 goto lx */
if (line >= n) return false;
if (type[line] != IFGOTO) return false;
else {
_eIFGOTO *stmt = (_eIFGOTO *) seq[line];
pi = stmt->t1->getName();
if (!_is_param(pi)) return false;
if (stmt->op != "!=") return false;
if (stmt->t2->getName() != "0") return false;
lx = stmt->l; ++line;
}
/* -> if pi != 0 goto lA */
alter.push_back(new _eIFGOTO(new _eVAR(pi), "!=", new _eNUM(0), lA));
/* stmts1, don't use pi */
for (; line < n && type[line] != RET; line++) {
if (!_not_use_var(pi, line)) return false;
alter.push_back(seq[line]);
}
/* return R0 */
if (line >= n) return false;
if (type[line] != RET) return false;
else {
if (!_not_use_var(pi, line)) return false;
_eRET *stmt = (_eRET *) seq[line];
R0 = stmt->t;
alter.push_back(seq[line]); ++line;
}
/* lx: */
if (line >= n) return false;
if (type[line] != LABEL) return false;
else {
_eLABEL *stmt = (_eLABEL *) seq[line];
if (stmt->l != lx) return false;
++line;
}
/* -> lA: */
alter.push_back(new _eLABEL(lA));
/* if pi != 1 goto ly */
if (line >= n) return false;
if (type[line] != IFGOTO) return false;
else {
_eIFGOTO *stmt = (_eIFGOTO *) seq[line];
if (stmt->t1->getName() != pi) return false;
if (stmt->op != "!=") return false;
if (stmt->t2->getName() != "1") return false;
ly = stmt->l; ++line;
}
/* stmts2, don't use pi */
for (; line < n && type[line] != RET; line++) {
if (!_not_use_var(pi, line)) return false;
alter.push_back(seq[line]);
}
/* return R1 */
if (line >= n) return false;
if (type[line] != RET) return false;
else {
if (!_not_use_var(pi, line)) return false;
_eRET *stmt = (_eRET *) seq[line];
R1 = stmt->t; ++line;
}
/* ly: */
if (line >= n) return false;
if (type[line] != LABEL) return false;
else {
_eLABEL *stmt = (_eLABEL *) seq[line];
if (stmt->l != ly) return false;
++line;
}
/* -> ret = R1 */
alter.push_back(new _eDIRECT(new _eVAR(ret), R1));
if (arity == 0) return false;
/* stmts3, don't use pi */
for (; line < n && type[line] != PARAM; line++) {
if (_not_use_var(pi, line))
stmts3_4.push_back(seq[line]);
else {
if (type[line] != BINARY) return false;
_eBINARY *stmt = (_eBINARY *) seq[line];
tj = stmt->a->getName();
if (stmt->t1->getName() != pi) return false;
if (stmt->op != "/") return false;
if (stmt->t2->getName() != "2") return false;
}
}
/* param .. */
for (int i = 0; i < arity; i++, ++line) {
if (line >= n) continue;
string param = "p" + to_string(i);
if (type[line] != PARAM) return false;
_ePARAM *stmt = (_ePARAM *)seq[line];
if (param != pi) {
if (stmt->t->getName() != param) return false;
}
else {
if (stmt->t->getName() != tj) return false;
}
}
/* Tx = call f_this_func */
if (line >= n) return false;
if (type[line] != FUNCRET) return false;
else {
if (!_not_use_var(pi, line)) return false;
_eFUNCRET *stmt = (_eFUNCRET *) seq[line];
if (this_func != stmt->func) return false;
Tx = stmt->a->getName(); ++line;
}
/* -> Tx = ret */
stmts3_4.push_back(new _eDIRECT(new _eVAR(Tx), new _eVAR(ret)));
/* stmts4, don't use pi */
for (; line < n && type[line] != IFGOTO; line++) {
if (_not_use_var(pi, line))
stmts3_4.push_back(seq[line]);
else {
if (type[line] != BINARY) return false;
_eBINARY *stmt = (_eBINARY *) seq[line];
tk = stmt->a->getName();
if (stmt->t1->getName() != pi) return false;
if (stmt->op != "%") return false;
if (stmt->t2->getName() != "2") return false;
}
}
/* if tk != 1 goto lz */
if (line >= n) return false;
if (type[line] != IFGOTO) return false;
else {
_eIFGOTO *stmt = (_eIFGOTO *) seq[line];
if (stmt->t1->getName() != tk) return false;
if (stmt->op != "!=") return false;
if (stmt->t2->getName() != "1") return false;
lz = stmt->l; ++line;
}
/* stmts5, don't use pi */
for (; line < n && type[line] != RET; line++) {
if (!_not_use_var(pi, line)) return false;
stmts5.push_back(seq[line]);
}
/* return R2 */
if (line >= n) return false;
if (type[line] != RET) return false;
else {
if (!_not_use_var(pi, line)) return false;
_eRET *stmt = (_eRET *) seq[line];
R2 = stmt->t; ++line;
}
/* -> ret = R2 */
stmts5.push_back(new _eDIRECT(new _eVAR(ret), R2));
while (line < n && type[line] != LABEL) ++line;
/* there might be some useless statements after return */
/* lz: */
if (line >= n) return false;
if (type[line] != LABEL) return false;
else {
_eLABEL *stmt = (_eLABEL *) seq[line];
if (stmt->l != lz) return false;
++line;
}
/* stmts6, don't use pi */
for (; line < n && type[line] != RET; line++) {
if (!_not_use_var(pi, line)) return false;
stmts6.push_back(seq[line]);
}
/* return R3 */
if (line >= n) return false;
if (type[line] != RET) return false;
else {
if (!_not_use_var(pi, line)) return false;
_eRET *stmt = (_eRET *) seq[line];
R3 = stmt->t; ++line;
}
/* -> ret = R3 */
stmts6.push_back(new _eDIRECT(new _eVAR(ret), R3));
for (int i = 30; i >= 0; i--) cpower[i] = varManager->newl();
_divide_conquer(0, 30);
for (int i = 30; i >= 0; i--) _calc_body(i);
/* -> lEnd: */
alter.push_back(new _eLABEL(lEnd));
/* -> return ret */
alter.push_back(new _eRET(new _eVAR(ret)));
cerr << this_func << " is re-written as a bit-prob function" << endl;
// for (auto stmt: alter) stmt->Dump(); fflush(stdout);
if (def1) _best_multiply();
seq = alter; n = seq.size(); return true;
}