-
Notifications
You must be signed in to change notification settings - Fork 1
/
build_interference.py
205 lines (166 loc) · 5.93 KB
/
build_interference.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
# Build Interference Graph
# Input: an AST for IR_x86
# Output: interference graph and move graph
from ir_x86 import *
from vis import Visitor
from print_visitor import PrintVisitor
from assigned_vars import AssignedVars, full_reg
from closure_conversion import FunName
import sys
# only need to consider simple expressions
# use visitor for this? Let's wait and see.
def free_vars(n):
if isinstance(n, Const):
return set([])
elif isinstance(n, Name):
return set([n.name])
elif isinstance(n, FunName):
return set([])
elif isinstance(n, Register): #?? -JGS
return set([full_reg(n.name)])
else:
return set([])
class ModifyLiveVisitor(Visitor):
# lhs += rhs
def visitIntAddInstr(self, n, live):
n.live = live | free_vars(n.lhs) | free_vars(n.rhs[0])
return n.live
# lhs -= rhs
def visitIntSubInstr(self, n, live):
n.live = live | free_vars(n.lhs) | free_vars(n.rhs[0])
return n.live
# lhs = -lhs
def visitIntNegInstr(self, n, live):
n.live = live | free_vars(n.lhs)
return n.live
# lhs = rhs
def visitIntMoveInstr(self, n, live):
n.live = (live - free_vars(n.lhs)) | free_vars(n.rhs[0])
return n.live
def visitCallX86(self, n, live):
n.live = live
return n.live
def visitPush(self, n, live):
n.live = live | free_vars(n.arg)
return n.live
def visitPop(self, n, live):
n.live = live
return n.live
def visitPopValue(self, n, live):
n.live = live - free_vars(n.target)
return n.live
def visitStmt(self, n, live):
for s in reversed(n.nodes):
live = self.dispatch(s, live)
def visitModule(self, n):
self.dispatch(n.node)
class BuildInterferenceVisitor(Visitor):
def __init__(self, registers):
Visitor.__init__(self)
self.interference_graph = {}
self.move_graph = {}
self.registers = registers
# graph access methods
def interferes_with(self, v):
if v in self.interference_graph.keys():
return self.interference_graph[v]
else:
raise Exception('inter_with: %s not in interference_graph' % v)
def move_related(self, v):
if v in self.move_graph.keys():
return self.move_graph[v]
else:
raise Exception('%s not in move_graph' % v)
def vertices(self):
return self.interference_graph.keys()
def get_color(self, real_color, c, num_registers):
if c < num_registers:
return real_color[c]
else:
return 'red'
def print_interference(self, filename, ordering, color, real_color, num_registers):
edges = set([])
i = 0
vertices_str = ""
for v in ordering:
vertices_str += '''"%s"[color=%s,label="%s.%s"]\n''' % \
(v, self.get_color(real_color, color[v], num_registers), \
v, repr(i))
for u in self.interferes_with(v):
if (v,u) not in edges:
edges |= set([(u,v)])
i += 1
edges_str = '\n'.join(['"%s" -- "%s"' % (u,v)
for (u,v) in edges])
f = open(filename, 'w')
stdout = sys.stdout
sys.stdout = f
print 'graph {\n%s\n%s\n}\n' % (vertices_str, edges_str)
sys.stdout = stdout
f.close()
# visit methods
def assigned_vars(self, n):
return AssignedVars().preorder(n)
def visitModule(self, n):
# initialize the interference and move graph
localvars = self.assigned_vars(n.node)
for l in localvars:
self.interference_graph[l] = set([])
self.move_graph[l] = set([])
for l in self.registers:
self.interference_graph[l] = set([])
self.move_graph[l] = set([])
print 'build Module start'
self.dispatch(n.node)
print 'build Module end'
def visitStmt(self, n):
for s in reversed(n.nodes):
self.dispatch(s)
def default(self, n):
if isinstance(n, ArithInstr):
if n.lhs:
lhs = n.lhs.name
else:
lhs = None
if isinstance(n, IntMoveInstr) and isinstance(n.rhs[0], Name):
rhs = n.rhs[0].name
for v in n.live:
if lhs and v != full_reg(lhs) and v != rhs:
self.add_interference(v, full_reg(lhs))
self.add_move(full_reg(lhs), rhs)
else:
for v in n.live:
if lhs and v != full_reg(lhs):
self.add_interference(v, full_reg(lhs))
else:
Visitor.default(self, n)
def visitCallX86(self, n):
# The live variables interfere with the caller-save registers.
for v in n.live:
# The if's are for running with reduced register sets
if 'eax' in self.vertices():
self.add_interference(v, 'eax')
if 'ecx' in self.vertices():
self.add_interference(v, 'ecx')
if 'edx' in self.vertices():
self.add_interference(v, 'edx')
def visitPush(self, n):
pass
def visitPop(self, n):
pass
def visitPopValue(self, n):
lhs = n.target.name
for v in n.live:
if lhs and v != full_reg(lhs):
self.add_interference(v, full_reg(lhs))
# internal methods
def add_interference(self, v1, v2):
#if v1 in self.interference_graph.keys():
self.interference_graph[v1] |= set([v2])
#if v2 in self.interference_graph.keys():
self.interference_graph[v2] |= set([v1])
def add_move(self, v1, v2):
#if v1 in self.move_graph.keys():
self.move_graph[v1] |= set([v2])
#if v2 in self.move_graph.keys():
self.move_graph[v2] |= set([v1])