-
Notifications
You must be signed in to change notification settings - Fork 0
/
optimize.py
211 lines (203 loc) · 7.95 KB
/
optimize.py
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
import copy
def partial_evaluation(ast, MAX):
final = {}
for name in ast:
final[name] = []
stack = []
mem = {}
for op_type, op in ast[name]:
if isinstance(op, tuple):
stack.extend(op)
elif isinstance(op, int):
stack.append(op)
if op_type == 'INT':
pass
elif op_type == 'ADD':
if len(stack) >= 2:
now = stack[-2] + stack[-1]
del stack[-2:]
stack.append(now % MAX)
elif stack:
final[name].append(('ADD', stack.pop()))
else:
final[name].append(('ADD', op))
elif op_type == 'SUB':
if len(stack) >= 2:
now = stack[-2] - stack[-1]
del stack[-2:]
stack.append(now % MAX)
elif stack:
final[name].append(('SUB', stack.pop()))
else:
final[name].append(('SUB', op))
elif op_type == 'MUL':
if len(stack) >= 2:
now = stack[-2] * stack[-1]
del stack[-2:]
stack.append(now % MAX)
elif stack:
final[name].append(('MUL', stack.pop()))
else:
final[name].append(('MUL', op))
elif op_type == 'DIV':
if len(stack) >= 2:
try:
now = stack[-2] / stack[-1]
except ZeroDivisionError:
now = 17
del stack[-2:]
stack.append(now % MAX)
elif stack:
final[name].append(('DIV', stack.pop()))
else:
final[name].append(('DIV', op))
elif op_type == 'STORE':
if len(stack) >= 2:
mem[stack[-1]] = stack[-2]
del stack[-2:]
elif stack:
if stack[-1] in mem:
del mem[stack[-1]]
final[name].append(('STORE', stack.pop()))
else:
final[name].append(('STORE', op))
elif op_type == 'LOAD':
if stack:
if stack[-1] in mem:
stack.append(mem[stack.pop()])
else:
for stack_min, i in enumerate(stack[:-1]):
final[name].append(('INT', i))
final[name].append(('LOAD', stack[-1]))
stack.clear()
else:
final[name].append(('LOAD', op))
elif op_type == 'DUP':
if stack:
stack.append(stack[-1])
else:
final[name].append(('DUP', op))
elif op_type == 'EQ':
if len(stack) >= 2:
now = int(stack[-2] == stack[-1])
del stack[-2:]
stack.append(now)
elif stack:
final[name].append(('EQ', stack.pop()))
else:
final[name].append(('EQ', op))
elif op_type == 'NT':
if stack:
stack.append(int(not stack.pop(-1)))
else:
final[name].append(('NT', op))
elif op_type == 'GREATER':
if len(stack) >= 2:
now = int(stack[-2] > stack[-1])
del stack[-2:]
stack.append(now)
elif stack:
final[name].append(('GREATER', stack.pop()))
else:
final[name].append(('GREATER', op))
elif op_type == 'LESS':
if len(stack) >= 2:
now = int(stack[-2] < stack[-1])
del stack[-2:]
stack.append(now)
elif stack:
final[name].append(('LESS', stack.pop()))
else:
final[name].append(('LESS', op))
elif op_type == 'MOD':
if len(stack) >= 2:
now = stack[-2] % stack[-1]
del stack[-2:]
stack.append(now % MAX)
elif stack:
final[name].append(('MOD', stack.pop()))
else:
final[name].append(('MOD', op))
elif op_type == 'INPUT':
for stack_min, i in enumerate(stack):
final[name].append(('INT', i))
final[name].append(('INPUT', op))
stack.clear()
elif op_type == 'OUTPUT':
if stack:
final[name].append(('OUTPUT', [stack.pop()]))
else:
final[name].append(('OUTPUT', op))
elif op_type == 'OUTPUT_NUM':
if stack:
final[name].append(('OUTPUT',
list(map(ord, str(stack.pop())))))
else:
final[name].append(('OUTPUT_NUM', op))
else:
for stack_min, i in enumerate(stack):
final[name].append(('INT', i))
for key in mem:
final[name].append(('STORE', (mem[key], key)))
mem.clear()
final[name].append((op_type, op))
stack.clear()
print('Unknown op_type:', op_type, op)
for stack_min, i in enumerate(stack):
final[name].append(('INT', i))
for key in sorted(mem, reverse=True):
final[name].append(('STORE', (mem[key], key)))
mem.clear()
return final
def peephole(ast, MAX):
changed = True
while changed:
changed = False
for name in ast:
block = ast[name]
for i, x in enumerate(block):
try:
if x[0] == 'OUTPUT' and block[i + 1][0] == 'OUTPUT':
if isinstance(block[i][1], list):
if isinstance(block[i + 1][1], list):
block[i:i + 2] = [('OUTPUT',
x[1] + block[i + 1][1])]
changed = True
except IndexError:
pass
if changed:
ast[name] = block
break
return ast
def loop_unrolling(ast, MAX):
for name in ast:
if ast[name][-1][0] == 'STORE':
if isinstance(ast[name][-1][1], tuple):
if ast[name][-1][1][1] == 0:
num = ast[name][-1][1][0]
if num in ast:
ast[name].extend(ast[num])
return ast
def dead_code_elimination(ast, MAX):
if ast[2149][-1][0] == 'STORE':
if isinstance(ast[2149][-1][1], tuple):
if ast[2149][-1][1][1] == 0:
if ast[2149][-1][1][0] not in ast:
if ast[2149][-2][0] == 'STORE':
del ast[2149][-2]
return {2149: ast[2149]}
return ast
def optimize(ast, MAX, OPTIMIZE, logger):
for r in range(1000):
logger.info('Round: %s Instructions: %s'
% (r, sum([len(ast[i]) for i in ast])))
old = str(ast)
if OPTIMIZE >= 3:
ast = loop_unrolling(ast, MAX)
if OPTIMIZE:
ast = partial_evaluation(ast, MAX)
ast = dead_code_elimination(ast, MAX)
ast = peephole(ast, MAX)
if str(ast) == old:
break
return ast