-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathLiveness.java
279 lines (211 loc) · 8.34 KB
/
Liveness.java
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
import pascal.analysis.DepthFirstAdapter;
import pascal.node.*;
import java.util.LinkedList;
/**
* Created by maximilian on 01.02.14.
*/
public class Liveness extends DepthFirstAdapter{
private LinkedList graph;
private int blockCounter;
private int currentBlock;
private FlowGraph blocks;
class FlowGraph{
private String name;
private LinkedList<FlowGraph> edges;
private LinkedList<String> def;
private LinkedList<String> use;
private LinkedList<String> in;
private LinkedList<String> out;
private boolean flag;
public FlowGraph(String name){
this.name = name;
edges = new LinkedList<FlowGraph>();
flag = false;
def = new LinkedList<String>();
use = new LinkedList<String>();
in = new LinkedList<String>();
out = new LinkedList<String>();
}
public String getName(){
return this.name;
}
public FlowGraph getBlockName (String blockName){
if(this.name.equalsIgnoreCase(blockName)) return this;
for (int i = 0; i < edges.size(); i++){
if(edges.get(i).getName().equals(blockName)){
return edges.get(i);
}
if (edges.get(i).getBlockName(blockName)!= null){
return edges.get(i).getBlockName(blockName);
}
}
return null;
}
//add to the in set all variables that were used and defined
public void setIn(){
flag = false;
for (int i = 0; i < this.use.size(); i++){
if(!(this.in.contains(this.use.get(i)))){
this.in.add(this.use.get(i));
flag= false;
}
}
LinkedList<String> outDef = this.getOutDef();
for (int i = 0; i < outDef.size(); i++){
if(!(this.in.contains(outDef.get(i)))){
this.in.add(outDef.get(i));
flag = true;
}
}
}
//add to the out set all variables which went out and remove all that were defined
public LinkedList<String> getOutDef(){
LinkedList<String> outDef= new LinkedList<String>();
for(int i = 0; i < this.out.size(); i++){
outDef.add(this.out.get(i));
}
for(int i=0; i < this.def.size(); i++){
outDef.remove(this.def.get(i));
}
return outDef;
}
public void setOut(){
for (int i = 0; i < edges.size(); i++){
flag = false;
for(int j = 0; j < edges.get(i).in.size(); j++){
if( !(this.out.contains(edges.get(i).in.get(j)))){
this.out.add(edges.get(i).in.get(j));
flag = true;
}
}
}
}
public boolean getFlag(){
return this.flag;
}
public void add(FlowGraph g){
this.edges.add(g);
}
}
public Liveness(){
blockCounter = 0;
blocks = new FlowGraph(blockCounter+". block:");
}
public void getLiveness(){
boolean changed = true;
FlowGraph current;
while (changed){
changed = false;
for (int i = 0; i <= blockCounter; i++){
current = blocks.getBlockName(i+". block:");
current.setIn();
if(current.getFlag()) changed = true;
current.setOut();
if (current.getFlag())changed = true;
}
}
int registerNumber = 0;
for (int i = 0; i < blockCounter; i++){
current = blocks.getBlockName(i+". block:");
System.out.println(current.getName()+ ":\nIn: " +current.in.toString()+"\nout: "+ current.out.toString());
if (registerNumber < current.out.size()) registerNumber= current.out.size();
}
System.out.println("Registers: "+registerNumber);
}
//why not use the sablecc classes? They work here too :D
@Override
public void caseAAssignmentAst (AAssignmentAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
String id = node.getIdentifier().toString().toLowerCase().replaceAll("\\s+", "");
if (! current.def.contains(id)) current.def.add(id);
node.getAst().apply(this);
}
@Override
public void caseAIdentifierAst(AIdentifierAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
String id = node.getIdentifier().toString().toLowerCase().replace("\\s+","");
if(! current.use.contains(id)) current.use.add(id);
}
@Override
public void caseAClosedIfStatementAst(AClosedIfStatementAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
if(!(current.use.isEmpty() && current.def.isEmpty())) blockCounter++;
FlowGraph leftBlock = new FlowGraph(blockCounter+". block:");
current.add(leftBlock);
node.getLeft().apply(this);
blockCounter++;
FlowGraph rightBlock = new FlowGraph(blockCounter+". block:");
current.add(rightBlock);
blockCounter++;
FlowGraph endBlock = new FlowGraph(blockCounter+". block:");
current.add(endBlock);
rightBlock.add(endBlock);
}
@Override
public void caseAOpenIfStatementAst(AOpenIfStatementAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
if(!(current.use.isEmpty() && current.def.isEmpty())) blockCounter++;
FlowGraph leftBlock = new FlowGraph(blockCounter+". block:");
current.add(leftBlock);
node.getLeft().apply(this);
blockCounter++;
FlowGraph rightBlock = new FlowGraph(blockCounter+". block:");
current.add(rightBlock);
blockCounter++;
FlowGraph endBlock = new FlowGraph(blockCounter+". block:");
current.add(endBlock);
rightBlock.add(endBlock);
}
@Override
public void caseAOpenIfElseStatementAst(AOpenIfElseStatementAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
if (!(current.use.isEmpty() && current.def.isEmpty())) blockCounter++;
FlowGraph leftBlock = new FlowGraph(blockCounter+". block:");
current.add(leftBlock);
node.getLeft().apply(this);
blockCounter++;
FlowGraph midBlock = new FlowGraph(blockCounter+". block:");
current.add(midBlock);
node.getMid().apply(this);
blockCounter++;
FlowGraph rightBlock = new FlowGraph(blockCounter+". block:");
current.add(rightBlock);
node.getRight().apply(this);
blockCounter++;
FlowGraph endBlock = new FlowGraph(blockCounter+". block:");
midBlock.add(endBlock);
rightBlock.add(endBlock);
}
@Override
public void caseAOpenWhileStatementAst (AOpenWhileStatementAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block:");
if (! (current.use.isEmpty() && current.def.isEmpty()))blockCounter++;
FlowGraph leftBlock = new FlowGraph(blockCounter+". block:");
current.add(leftBlock);
node.getLeft().apply(this);
blockCounter++;
FlowGraph rightBlock = new FlowGraph(blockCounter+". block:");
current.add(rightBlock);
node.getRight().apply(this);
blockCounter++;
FlowGraph endBlock = new FlowGraph(blockCounter+". block:");
current.add(endBlock);
rightBlock.add(endBlock);
}
@Override
public void caseAClosedWhileStatementAst(AClosedWhileStatementAst node){
FlowGraph current = blocks.getBlockName(blockCounter+". block");
if (! (current.use.isEmpty() && current.def.isEmpty()))blockCounter++;
FlowGraph leftBlock = new FlowGraph(blockCounter+". block:");
current.add(leftBlock);
node.getLeft().apply(this);
blockCounter++;
FlowGraph rightBlock = new FlowGraph(blockCounter+". block:");
current.add(rightBlock);
node.getRight().apply(this);
blockCounter++;
FlowGraph endBlock = new FlowGraph(blockCounter+". block:");
current.add(endBlock);
rightBlock.add(endBlock);
}
}