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
|
#include "lisc.h"
static void
dumprset(Bits *b, Fn *fn)
{
int t;
for (t=Tmp0; t<fn->ntmp; t++)
if (BGET(*b, t))
printf(" %s", fn->sym[t].name);
}
int
main(int ac, char *av[])
{
int opt, pr;
Fn *fn;
fn = parsefn(stdin);
pr = 1;
opt = 0;
if (ac > 1 && av[1][0] == '-')
opt = av[1][1];
switch (opt) {
case 'f': {
int tx, ntmp;
fprintf(stderr, "[Testing SSA Reconstruction:");
fillpreds(fn);
for (ntmp=fn->ntmp, tx=Tmp0; tx<ntmp; tx++) {
fprintf(stderr, " %s", fn->sym[tx].name);
ssafix(fn, tx);
}
fprintf(stderr, "]\n");
break;
}
case 'r': {
int n;
fprintf(stderr, "[Testing RPO]\n");
fillrpo(fn);
assert(fn->rpo[0] == fn->start);
for (n=0;; n++)
if (n == fn->nblk-1) {
fn->rpo[n]->link = 0;
break;
} else
fn->rpo[n]->link = fn->rpo[n+1];
break;
}
case 'l': {
Blk *b;
fprintf(stderr, "[Testing Liveness]\n");
fillrpo(fn);
filllive(fn);
for (b=fn->start; b; b=b->link) {
printf("> Block %s\n", b->name);
printf("\t in: [");
dumprset(&b->in, fn);
printf(" ]\n");
printf("\tout: [");
dumprset(&b->out, fn);
printf(" ]\n");
printf("\tnlive: %d\n", b->nlive);
}
pr = 0;
break;
}
default:
break;
}
if (pr)
printfn(fn, stdout);
return 0;
}
|
