diff options
| author | Quentin Carbonneaux <quentin.carbonneaux@yale.edu> | 2015-07-10 16:43:17 -0400 |
|---|---|---|
| committer | Quentin Carbonneaux <quentin.carbonneaux@yale.edu> | 2015-09-15 23:01:27 -0400 |
| commit | d165818c66f662178253a29b71ba2f15993b77e7 (patch) | |
| tree | a768a6fede14a6826cb105d11149bf78a769b328 /lisc/ssa.c | |
| parent | 8f5548f558bc6a70a31a9d9c3d200b433d44ebdc (diff) | |
| download | roux-d165818c66f662178253a29b71ba2f15993b77e7.tar.gz | |
remove useless parameter in top,bot def
Diffstat (limited to 'lisc/ssa.c')
| -rw-r--r-- | lisc/ssa.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/lisc/ssa.c b/lisc/ssa.c index 3491e96..0ee03c3 100644 --- a/lisc/ssa.c +++ b/lisc/ssa.c @@ -82,22 +82,22 @@ fillrpo(Fn *f) } } -static Ref topdef(int, Blk *, Fn *, Ref *, Ref *); +static Ref topdef(Blk *, Fn *, Ref *, Ref *); static Ref -botdef(int t, Blk *b, Fn *f, Ref *top, Ref *bot) +botdef(Blk *b, Fn *f, Ref *top, Ref *bot) { Ref r; if (bot[b->rpo] != R) return bot[b->rpo]; - r = topdef(t, b, f, top, bot); + r = topdef(b, f, top, bot); bot[b->rpo] = r; return r; } static Ref -topdef(int t, Blk *b, Fn *f, Ref *top, Ref *bot) +topdef(Blk *b, Fn *f, Ref *top, Ref *bot) { int i, t1; Ref r; @@ -106,7 +106,7 @@ topdef(int t, Blk *b, Fn *f, Ref *top, Ref *bot) if (top[b->rpo] != R) return top[b->rpo]; if (b->npreds == 1) { - r = botdef(t, b->preds[0], f, top, bot); + r = botdef(b->preds[0], f, top, bot); top[b->rpo] = r; return r; } @@ -120,7 +120,7 @@ topdef(int t, Blk *b, Fn *f, Ref *top, Ref *bot) p = &b->ps[b->np-1]; p->to = r; for (i=0; i<b->npreds; i++) - p->args[i] = botdef(t, b->preds[i], f, top, bot); + p->args[i] = botdef(b->preds[i], f, top, bot); p->na = i; return r; } @@ -173,13 +173,13 @@ ssafix(Fn *f, int t) for (i=0; i<phi->na; i++) { if (phi->args[i] != rt) continue; - phi->args[i] = topdef(t, b, f, top, bot); + phi->args[i] = topdef(b, f, top, bot); } for (ins=b->is; ins-b->is < b->ni; ins++) { if (ins->l == rt) - ins->l = topdef(t, b, f, top, bot); + ins->l = topdef(b, f, top, bot); if (ins->r == rt) - ins->r = topdef(t, b, f, top, bot); + ins->r = topdef(b, f, top, bot); } } free(top); |