-
Notifications
You must be signed in to change notification settings - Fork 0
/
Dataflow.java
264 lines (217 loc) · 5.3 KB
/
Dataflow.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
// Lab in EDAN25 http://cs.lth.se/edan25/labs/
import java.util.Iterator;
import java.util.ListIterator;
import java.util.LinkedList;
import java.util.BitSet;
import java.io.*;
import java.util.concurrent.Semaphore;
class Random {
int w;
int z;
public Random(int seed) {
w = seed + 1;
z = seed * seed + seed + 2;
}
int nextInt() {
z = 36969 * (z & 65535) + (z >> 16);
w = 18000 * (w & 65535) + (w >> 16);
return (z << 16) + w;
}
}
class Vertex {
int index;
boolean listed;
LinkedList<Vertex> pred;
LinkedList<Vertex> succ;
BitSet in;
BitSet out;
BitSet use;
BitSet def;
Vertex(int i) {
index = i;
pred = new LinkedList<Vertex>();
succ = new LinkedList<Vertex>();
in = new BitSet();
out = new BitSet();
use = new BitSet();
def = new BitSet();
}
void computeIn(LinkedList<Vertex> worklist) {
int i;
BitSet old;
BitSet ne;
Vertex v;
ListIterator<Vertex> iter;
iter = succ.listIterator();
while (iter.hasNext()) {
v = iter.next();
out.or(v.in);
}
old = in;
in = new BitSet();
in.or(out);
in.andNot(def);
in.or(use);
if (!in.equals(old)) {
iter = pred.listIterator();
while (iter.hasNext()) {
v = iter.next();
if (!v.listed) {
worklist.addLast(v);
v.listed = true;
}
}
}
}
public void print() {
try {
PrintWriter writer = new PrintWriter(new FileOutputStream(new File("new.txt"), true));
int i;
writer.print("use[" + index + "] = { ");
for (i = 0; i < use.size(); ++i)
if (use.get(i))
writer.print("" + i + " ");
writer.println("}");
writer.print("def[" + index + "] = { ");
for (i = 0; i < def.size(); ++i)
if (def.get(i))
writer.print("" + i + " ");
writer.println("}\n");
writer.print("in[" + index + "] = { ");
for (i = 0; i < in.size(); ++i)
if (in.get(i))
writer.print("" + i + " ");
writer.println("}");
writer.print("out[" + index + "] = { ");
for (i = 0; i < out.size(); ++i)
if (out.get(i))
writer.print("" + i + " ");
writer.println("}\n");
writer.close();
} catch (Exception e) {
e.printStackTrace();
}
}
}
class Dataflow {
public static void connect(Vertex pred, Vertex succ) {
pred.succ.addLast(succ);
succ.pred.addLast(pred);
}
public static void generateCFG(Vertex vertex[], int maxsucc, Random r) {
int i;
int j;
int k;
int s; // number of successors of a vertex.
System.out.println("generating CFG...");
connect(vertex[0], vertex[1]);
connect(vertex[0], vertex[2]);
for (i = 2; i < vertex.length; ++i) {
s = (r.nextInt() % maxsucc) + 1;
for (j = 0; j < s; ++j) {
k = Math.abs(r.nextInt()) % vertex.length;
connect(vertex[i], vertex[k]);
}
}
}
public static void generateUseDef(
Vertex vertex[],
int nsym,
int nactive,
Random r) {
int i;
int j;
int sym;
System.out.println("generating usedefs...");
for (i = 0; i < vertex.length; ++i) {
for (j = 0; j < nactive; ++j) {
sym = Math.abs(r.nextInt()) % nsym;
if (j % 4 != 0) {
if (!vertex[i].def.get(sym))
vertex[i].use.set(sym);
} else {
if (!vertex[i].use.get(sym))
vertex[i].def.set(sym);
}
}
}
}
public static void main(String[] args) {
int i;
int nsym;
int nvertex;
int maxsucc;
int nactive;
int nthread;
boolean print;
Vertex vertex[];
Random r;
r = new Random(1);
nsym = Integer.parseInt(args[0]);
nvertex = Integer.parseInt(args[1]);
maxsucc = Integer.parseInt(args[2]);
nactive = Integer.parseInt(args[3]);
nthread = Integer.parseInt(args[4]);
print = Integer.parseInt(args[5]) != 0;
System.out.println("nsym = " + nsym);
System.out.println("nvertex = " + nvertex);
System.out.println("maxsucc = " + maxsucc);
System.out.println("nactive = " + nactive);
vertex = new Vertex[nvertex];
for (i = 0; i < vertex.length; ++i)
vertex[i] = new Vertex(i);
generateCFG(vertex, maxsucc, r);
generateUseDef(vertex, nsym, nactive, r);
liveness(vertex, nthread);
if (print)
for (i = 0; i < vertex.length; ++i)
vertex[i].print();
}
public static void liveness(Vertex vertex[], int nthread) {
Vertex u;
LinkedList<Vertex> worklist;
long begin;
long end;
begin = System.nanoTime();
worklist = new LinkedList<Vertex>();
int partSize = vertex.length / nthread;
LinkedList<livenessThread> t = new LinkedList<livenessThread>();
for (int i = 0; i < nthread; i++) {
worklist = new LinkedList<Vertex>();
for (int j = i * partSize; j < (i + 1) * partSize; ++j) {
worklist.addLast(vertex[j]);
vertex[i].listed = true;
}
t.add(new livenessThread(worklist));
}
for (livenessThread livenessThread : t) {
livenessThread.start();
}
try {
for (livenessThread livenessThread : t) {
livenessThread.join();
}
} catch (InterruptedException e) {
e.printStackTrace();
}
end = System.nanoTime();
System.out.println("T = " + (end - begin) / 1e9 + " s");
}
}
class livenessThread extends Thread {
Vertex u;
int i;
LinkedList<Vertex> worklist;
public livenessThread(LinkedList<Vertex> worklist) {
this.worklist = worklist;
}
public void run() {
System.out.println("computing liveness...");
System.out.println("Worklist size: " + worklist.size());
while (!worklist.isEmpty()) {
u = worklist.remove();
u.listed = false;
u.computeIn(worklist);
}
}
}