/*
* complete R structure
*/
- t = 0;
for(r=firstr; r!=R; r=r1) {
r1 = r->link;
if(r1 == R)
r1->p1 = r2;
r = r2;
- t++;
case ADATA:
case AGLOBL:
p = p->link;
}
}
+//dumpit("begin", firstr);
loop1:
+
t = 0;
for(r=firstr; r!=R; r=r->link) {
p = r->prog;
case AMOVW:
case AMOVF:
case AMOVD:
- if(p->scond != C_SCOND_NONE)
- break;
- if(!regtyp(&p->to))
- break;
-// if(isdconst(&p->from)) {
-// constprop(&p->from, &p->to, r->s1);
-// break;
-// }
- if(!regtyp(&p->from))
- break;
- if(p->from.type != p->to.type)
- break;
- if(copyprop(r)) {
- excise(r);
- t++;
- break;
+ if(regtyp(&p->from))
+ if(p->from.type == p->to.type)
+ if(p->scond == C_SCOND_NONE) {
+ if(copyprop(r)) {
+ excise(r);
+ t++;
+ break;
+ }
+ if(subprop(r) && copyprop(r)) {
+ excise(r);
+ t++;
+ break;
+ }
}
- if(subprop(r) && copyprop(r)) {
- excise(r);
- t++;
- break;
+ break;
+
+ if(p->scond == C_SCOND_NONE)
+ if(regtyp(&p->to))
+ if(isdconst(&p->from)) {
+ constprop(&p->from, &p->to, r->s1);
}
+ break;
}
}
if(t)
goto loop1;
- /*
- * look for MOVB x,R; MOVB R,R
- */
+
+return;
+
for(r=firstr; r!=R; r=r->link) {
p = r->prog;
switch(p->as) {
- default:
- continue;
// case AEOR:
// /*
// * EOR -1,x,y => MVN x,y
// p->from.reg = p->to.reg;
// p->reg = NREG;
// }
-// continue;
+// break;
+
case AMOVH:
case AMOVHU:
case AMOVB:
case AMOVBU:
+ /*
+ * look for MOVB x,R; MOVB R,R
+ */
if(p->to.type != D_REG)
- continue;
+ break;
+ if(r1 == R)
+ break;
+ p1 = r1->prog;
+ if(p1->as != p->as)
+ break;
+ if(p1->from.type != D_REG || p1->from.reg != p->to.reg)
+ break;
+ if(p1->to.type != D_REG || p1->to.reg != p->to.reg)
+ break;
+ excise(r1);
break;
}
r1 = r->link;
- if(r1 == R)
- continue;
- p1 = r1->prog;
- if(p1->as != p->as)
- continue;
- if(p1->from.type != D_REG || p1->from.reg != p->to.reg)
- continue;
- if(p1->to.type != D_REG || p1->to.reg != p->to.reg)
- continue;
- excise(r1);
}
// for(r=firstr; r!=R; r=r->link) {
}
return 0;
- case ANOP: /* read, write */
+ case ANOP: /* read,, write */
case AMOVW:
case AMOVF:
case AMOVD:
case ADIVF:
case ADIVD:
- case ACMPF:
+ case ACMPF: /* read, read, */
case ACMPD:
- case ATST:
case ACMP:
case ACMN:
case ACASE:
+ case ATST: /* read,, */
if(s != A) {
if(copysub(&p->from, v, s, 1))
return 1;
return 0;
}
-int
-a2type(Prog *p)
-{
-
- switch(p->as) {
-
- case ATST:
- case ACMP:
- case ACMN:
-
- case AMULLU:
- case AMULA:
-
- case AADD:
- case ASUB:
- case ARSB:
- case ASLL:
- case ASRL:
- case ASRA:
- case AORR:
- case AAND:
- case AEOR:
-// case AMVN:
- case AMUL:
- case AMULU:
- case ADIV:
- case ADIVU:
- case AMOD:
- case AMODU:
- return D_REG;
-
- case ACMPF:
- case ACMPD:
-
- case AADDF:
- case AADDD:
- case ASUBF:
- case ASUBD:
- case AMULF:
- case AMULD:
- case ADIVF:
- case ADIVD:
- return D_FREG;
- }
- return D_NONE;
-}
-
/*
* direct reference,
* could be set/use depending on
return 0;
}
+/*
+ * compare v to the center
+ * register in p (p->reg)
+ * the trick is that this
+ * register might be D_REG
+ * D_FREG. there are basically
+ * two cases,
+ * ADD r,r,r
+ * CMP r,r,
+ */
int
copyau1(Prog *p, Adr *v)
{
- if(regtyp(v)) {
- if(a2type(p) == v->type)
- if(p->reg == v->reg) {
- if(a2type(p) != v->type)
- print("botch a2type %P\n", p);
- return 1;
+ if(regtyp(v))
+ if(p->reg == v->reg) {
+ if(p->to.type != D_NONE) {
+ if(v->type == p->to.type)
+ return 1;
+ return 0;
+ }
+ if(p->from.type != D_NONE) {
+ if(v->type == p->from.type)
+ return 1;
+ return 0;
}
+ print("copyau1: cant tell %P\n", p);
}
return 0;
}
pred = predinfo[rstart->prog->as - ABEQ].notscond;
for(r = j->start;; r = successor(r)) {
- if (r->prog->as == AB) {
- if (r != j->last || branch == Delbranch)
+ if(r->prog->as == AB) {
+ if(r != j->last || branch == Delbranch)
excise(r);
else {
- if (cond == Truecond)
+ if(cond == Truecond)
r->prog->as = predinfo[rstart->prog->as - ABEQ].opcode;
else
r->prog->as = predinfo[rstart->prog->as - ABEQ].notopcode;
}
}
else
- if (predicable(r->prog))
+ if(predicable(r->prog))
r->prog->scond = (r->prog->scond&~C_SCOND)|pred;
- if (r->s1 != r->link) {
+ if(r->s1 != r->link) {
r->s1 = r->link;
r->link->p1 = r;
}
- if (r == j->last)
+ if(r == j->last)
break;
}
}
return 1;
return 0;
}
+
+void
+dumpone(Reg *r)
+{
+ int z;
+ Bits bit;
+
+ print("%d:%P", r->loop, r->prog);
+ for(z=0; z<BITS; z++)
+ bit.b[z] =
+ r->set.b[z] |
+ r->use1.b[z] |
+ r->use2.b[z] |
+ r->refbehind.b[z] |
+ r->refahead.b[z] |
+ r->calbehind.b[z] |
+ r->calahead.b[z] |
+ r->regdiff.b[z] |
+ r->act.b[z] |
+ 0;
+// if(bany(&bit)) {
+// print("\t");
+// if(bany(&r->set))
+// print(" s:%Q", r->set);
+// if(bany(&r->use1))
+// print(" u1:%Q", r->use1);
+// if(bany(&r->use2))
+// print(" u2:%Q", r->use2);
+// if(bany(&r->refbehind))
+// print(" rb:%Q ", r->refbehind);
+// if(bany(&r->refahead))
+// print(" ra:%Q ", r->refahead);
+// if(bany(&r->calbehind))
+// print("cb:%Q ", r->calbehind);
+// if(bany(&r->calahead))
+// print(" ca:%Q ", r->calahead);
+// if(bany(&r->regdiff))
+// print(" d:%Q ", r->regdiff);
+// if(bany(&r->act))
+// print(" a:%Q ", r->act);
+// }
+ print("\n");
+}
+
+void
+dumpit(char *str, Reg *r0)
+{
+ Reg *r, *r1;
+
+ print("\n%s\n", str);
+ for(r = r0; r != R; r = r->link) {
+ dumpone(r);
+ r1 = r->p2;
+ if(r1 != R) {
+ print(" pred:");
+ for(; r1 != R; r1 = r1->p2link)
+ print(" %.4ud", r1->prog->loc);
+ print("\n");
+ }
+// r1 = r->s1;
+// if(r1 != R) {
+// print(" succ:");
+// for(; r1 != R; r1 = r1->s1)
+// print(" %.4ud", r1->prog->loc);
+// print("\n");
+// }
+ }
+}