sam/libqbe
1
0
Fork 0
Code Issues Pull requests Projects Releases 1 Packages Wiki Activity Actions

uniformize looping on instructions

Browse source 
I am actually not sure if "i-b->ins < b->nins" is the best way,
maybe the comparison with the last instruction is a little more
efficient...  At least it is uniform now.
This commit is contained in:
Quentin Carbonneaux 2015-11-16 17:54:16 -05:00
parent b8c7645746
commit c744281317
3 changed files with 8 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

6
lisc/ssa.c
View file

@ -63,7 +63,7 @@ filluse(Fn *fn)
tmp[t].phi = p->to.val;
}
}
for (i=b->ins; i!=&b->ins[b->nins]; i++) {
for (i=b->ins; i-b->ins < b->nins; i++) {
if (!req(i->to, R)) {
assert(rtype(i->to) == RTmp);
tmp[i->to.val].ndef++;
@ -303,7 +303,7 @@ phiins(Fn *fn)
for (b=fn->start; b; b=b->link) {
b->visit = 0;
r = R;
for (i=b->ins; i!=&b->ins[b->nins]; i++) {
for (i=b->ins; i-b->ins < b->nins; i++) {
if (!req(r, R)) {
if (req(i->arg[0], TMP(t)))
i->arg[0] = r;
@ -438,7 +438,7 @@ renblk(Blk *b, Name **stk, Fn *fn)
for (p=b->phi; p; p=p->link)
rendef(&p->to, b, stk, fn);
for (i=b->ins; i!=&b->ins[b->nins]; i++) {
for (i=b->ins; i-b->ins < b->nins; i++) {
for (m=0; m<2; m++) {
t = i->arg[m].val;
if (rtype(i->arg[m]) == RTmp)