diff options
| author | Quentin Carbonneaux <quentin@c9x.me> | 2022-11-22 16:52:42 +0100 |
|---|---|---|
| committer | Quentin Carbonneaux <quentin@c9x.me> | 2022-11-22 21:55:06 +0100 |
| commit | 04e26409011389f7b5759114905195a4fb0b0286 (patch) | |
| tree | 1a31d31fe7b36d953ce891716377fbfa935425c3 | |
| parent | 87dc3ea290a4ba75f153c5bb8b9fb87ec548e64f (diff) | |
| download | roux-04e26409011389f7b5759114905195a4fb0b0286.tar.gz | |
rename Tmp.ins to be more descriptive
| -rw-r--r-- | all.h | 2 | ||||
| -rw-r--r-- | mem.c | 10 | ||||
| -rw-r--r-- | ssa.c | 4 |
3 files changed, 8 insertions, 8 deletions
diff --git a/all.h b/all.h index 92c02ee..00b8628 100644 --- a/all.h +++ b/all.h @@ -297,7 +297,7 @@ struct Alias { struct Tmp { char name[NString]; - Ins *ins; + Ins *def; Use *use; uint ndef, nuse; uint bid; /* id of a defining block */ diff --git a/mem.c b/mem.c index 6cbb801..e372f0f 100644 --- a/mem.c +++ b/mem.c @@ -299,8 +299,8 @@ coalesce(Fn *fn) } while (n--) { t = &fn->tmp[kill[n]]; - assert(t->ndef == 1 && t->ins); - *t->ins = (Ins){.op = Onop}; + assert(t->ndef == 1 && t->def); + *t->def = (Ins){.op = Onop}; for (u=t->use; u<&t->use[t->nuse]; u++) { assert(u->type == UIns); i = u->u.ins; @@ -327,7 +327,7 @@ coalesce(Fn *fn) if (s->s || !s->r.b) goto Skip; if (rovlap(r, s->r)) - /* O(n^2) can be approximated + /* O(n) can be approximated * by 'goto Skip;' if need be */ for (m=n; &sl[m]<s; m++) @@ -347,8 +347,8 @@ coalesce(Fn *fn) if (s->s == s) continue; t = &fn->tmp[s->t]; - assert(t->ndef == 1 && t->ins); - *t->ins = (Ins){.op = Onop}; + assert(t->ndef == 1 && t->def); + *t->def = (Ins){.op = Onop}; for (u=t->use; u<&t->use[t->nuse]; u++) { assert(u->type == UIns); arg = u->u.ins->arg; diff --git a/ssa.c b/ssa.c index d2ac227..849f679 100644 --- a/ssa.c +++ b/ssa.c @@ -47,7 +47,7 @@ filluse(Fn *fn) /* todo, is this the correct file? */ tmp = fn->tmp; for (t=Tmp0; t<fn->ntmp; t++) { - tmp[t].ins = 0; + tmp[t].def = 0; tmp[t].bid = -1u; tmp[t].ndef = 0; tmp[t].nuse = 0; @@ -89,7 +89,7 @@ filluse(Fn *fn) w = WFull; t = i->to.val; tmp[t].width = w; - tmp[t].ins = i; + tmp[t].def = i; tmp[t].bid = b->id; tmp[t].ndef++; tmp[t].cls = i->cls; |