Commit bedfc2c2 authored by Ken Thompson's avatar Ken Thompson

more on the optimizer

trying to get alizses
to optimize

R=rsc
https://golang.org/cl/176061
parent 68777771
...@@ -94,8 +94,24 @@ setoutvar(void) ...@@ -94,8 +94,24 @@ setoutvar(void)
static void static void
setaddrs(Bits bit) setaddrs(Bits bit)
{ {
if(bany(&bit)) int i, n;
var[bnum(bit)].addr = 1; Var *v;
Sym *s;
while(bany(&bit)) {
// convert each bit to a variable
i = bnum(bit);
s = var[i].sym;
n = var[i].name;
bit.b[i/32] &= ~(1L<<(i%32));
// disable all pieces of that variable
for(i=0; i<nvar; i++) {
v = var+i;
if(v->sym == s && v->name == n)
v->addr = 2;
}
}
} }
void void
...@@ -851,15 +867,12 @@ mkvar(Reg *r, Adr *a) ...@@ -851,15 +867,12 @@ mkvar(Reg *r, Adr *a)
for(i=0; i<nvar; i++) { for(i=0; i<nvar; i++) {
v = var+i; v = var+i;
if(v->sym == s && v->name == n) { if(v->sym == s && v->name == n) {
if(v->offset == o) { if(v->offset == o)
// if it is the same, use it if(v->etype == et)
if(v->etype != et|| if(v->width == w)
v->width != w)
v->addr = 1;
return blsh(i); return blsh(i);
}
// if it overlaps, disable bothj // if they overlaps, disable both
if(overlap(v->offset, v->width, o, w)) { if(overlap(v->offset, v->width, o, w)) {
v->addr = 1; v->addr = 1;
flag = 1; flag = 1;
...@@ -888,6 +901,8 @@ mkvar(Reg *r, Adr *a) ...@@ -888,6 +901,8 @@ mkvar(Reg *r, Adr *a)
v->gotype = a->gotype; v->gotype = a->gotype;
v->etype = et; v->etype = et;
v->width = w; v->width = w;
v->addr = flag; // funny punning
if(debug['R']) if(debug['R'])
print("bit=%2d et=%2d w=%d %S %D\n", i, et, w, s, a); print("bit=%2d et=%2d w=%d %S %D\n", i, et, w, s, a);
ostats.nvar++; ostats.nvar++;
...@@ -900,10 +915,6 @@ mkvar(Reg *r, Adr *a) ...@@ -900,10 +915,6 @@ mkvar(Reg *r, Adr *a)
for(z=0; z<BITS; z++) for(z=0; z<BITS; z++)
params.b[z] |= bit.b[z]; params.b[z] |= bit.b[z];
// funny punning
if(flag)
v->addr = 1;
return bit; return bit;
none: none:
......
...@@ -67,7 +67,7 @@ rcmp(const void *a1, const void *a2) ...@@ -67,7 +67,7 @@ rcmp(const void *a1, const void *a2)
return p2->varno - p1->varno; return p2->varno - p1->varno;
} }
void static void
setoutvar(void) setoutvar(void)
{ {
Type *t; Type *t;
...@@ -91,6 +91,29 @@ setoutvar(void) ...@@ -91,6 +91,29 @@ setoutvar(void)
//print("ovars = %Q\n", &ovar); //print("ovars = %Q\n", &ovar);
} }
static void
setaddrs(Bits bit)
{
int i, n;
Var *v;
Sym *s;
while(bany(&bit)) {
// convert each bit to a variable
i = bnum(bit);
s = var[i].sym;
n = var[i].name;
bit.b[i/32] &= ~(1L<<(i%32));
// disable all pieces of that variable
for(i=0; i<nvar; i++) {
v = var+i;
if(v->sym == s && v->name == n)
v->addr = 2;
}
}
}
void void
regopt(Prog *firstp) regopt(Prog *firstp)
{ {
...@@ -179,8 +202,7 @@ regopt(Prog *firstp) ...@@ -179,8 +202,7 @@ regopt(Prog *firstp)
* funny * funny
*/ */
case ALEAL: case ALEAL:
for(z=0; z<BITS; z++) setaddrs(bit);
addrs.b[z] |= bit.b[z];
break; break;
/* /*
...@@ -314,8 +336,7 @@ regopt(Prog *firstp) ...@@ -314,8 +336,7 @@ regopt(Prog *firstp)
case AFMOVVP: case AFMOVVP:
case AFMOVWP: case AFMOVWP:
case ACALL: case ACALL:
for(z=0; z<BITS; z++) setaddrs(bit);
addrs.b[z] |= bit.b[z];
break; break;
} }
...@@ -380,6 +401,18 @@ regopt(Prog *firstp) ...@@ -380,6 +401,18 @@ regopt(Prog *firstp)
if(firstr == R) if(firstr == R)
return; return;
for(i=0; i<nvar; i++) {
Var *v = var+i;
if(v->addr) {
bit = blsh(i);
for(z=0; z<BITS; z++)
addrs.b[z] |= bit.b[z];
}
// print("bit=%2d addr=%d et=%-6E w=%-2d s=%S + %lld\n",
// i, v->addr, v->etype, v->width, v->sym, v->offset);
}
if(debug['R'] && debug['v']) if(debug['R'] && debug['v'])
dumpit("pass1", firstr); dumpit("pass1", firstr);
...@@ -679,31 +712,16 @@ doregbits(int r) ...@@ -679,31 +712,16 @@ doregbits(int r)
} }
static int static int
overlap(Var *v, int o2, int w2) overlap(int32 o1, int w1, int32 o2, int w2)
{ {
int o1, w1, t1, t2, z; int32 t1, t2;
Bits bit;
o1 = v->offset;
w1 = v->width;
t1 = o1+w1; t1 = o1+w1;
t2 = o2+w2; t2 = o2+w2;
if(!(t1 > o2 && t2 > o1)) if(!(t1 > o2 && t2 > o1))
return 0; return 0;
// set to max extent
if(o2 < o1)
v->offset = o2;
if(t1 > t2)
v->width = t1-v->offset;
else
v->width = t2-v->offset;
// and dont registerize
bit = blsh(v-var);
for(z=0; z<BITS; z++)
addrs.b[z] |= bit.b[z];
return 1; return 1;
} }
...@@ -720,6 +738,9 @@ mkvar(Reg *r, Adr *a) ...@@ -720,6 +738,9 @@ mkvar(Reg *r, Adr *a)
* mark registers used * mark registers used
*/ */
t = a->type; t = a->type;
if(t == D_NONE)
goto none;
if(r != R) { if(r != R) {
r->regu |= doregbits(t); r->regu |= doregbits(t);
r->regu |= doregbits(a->index); r->regu |= doregbits(a->index);
...@@ -728,14 +749,15 @@ mkvar(Reg *r, Adr *a) ...@@ -728,14 +749,15 @@ mkvar(Reg *r, Adr *a)
switch(t) { switch(t) {
default: default:
goto none; goto none;
case D_ADDR: case D_ADDR:
a->type = a->index; a->type = a->index;
bit = mkvar(r, a); bit = mkvar(r, a);
for(z=0; z<BITS; z++) setaddrs(bit);
addrs.b[z] |= bit.b[z];
a->type = t; a->type = t;
ostats.naddr++; ostats.naddr++;
goto none; goto none;
case D_EXTERN: case D_EXTERN:
case D_STATIC: case D_STATIC:
case D_PARAM: case D_PARAM:
...@@ -752,32 +774,27 @@ mkvar(Reg *r, Adr *a) ...@@ -752,32 +774,27 @@ mkvar(Reg *r, Adr *a)
et = a->etype; et = a->etype;
o = a->offset; o = a->offset;
w = a->width; w = a->width;
v = var;
flag = 0; flag = 0;
for(i=0; i<nvar; i++) { for(i=0; i<nvar; i++) {
if(s == v->sym) v = var+i;
if(n == v->name) { if(v->sym == s && v->name == n) {
// if it is the same, use it if(v->offset == o)
if(v->etype == et) if(v->etype == et)
if(v->width == w) if(v->width == w)
if(v->offset == o) return blsh(i);
goto out;
// if it overlaps, set max // if they overlaps, disable both
// width and dont registerize if(overlap(v->offset, v->width, o, w)) {
if(overlap(v, o, w)) v->addr = 1;
flag = 1; flag = 1;
} }
v++;
} }
if(flag) }
goto none;
switch(et) { switch(et) {
case 0: case 0:
case TFUNC: case TFUNC:
case TARRAY:
goto none; goto none;
} }
...@@ -786,34 +803,23 @@ mkvar(Reg *r, Adr *a) ...@@ -786,34 +803,23 @@ mkvar(Reg *r, Adr *a)
fatal("variable not optimized: %D", a); fatal("variable not optimized: %D", a);
goto none; goto none;
} }
i = nvar; i = nvar;
nvar++; nvar++;
v = &var[i]; v = var+i;
v->sym = s; v->sym = s;
v->offset = o; v->offset = o;
v->name = n; v->name = n;
v->gotype = a->gotype; v->gotype = a->gotype;
v->etype = et; v->etype = et;
v->width = w; v->width = w;
v->addr = flag; // funny punning
if(debug['R']) if(debug['R'])
print("bit=%2d et=%2d w=%d %D\n", i, et, w, a); print("bit=%2d et=%2d w=%d %S %D\n", i, et, w, s, a);
ostats.nvar++; ostats.nvar++;
out:
bit = blsh(i); bit = blsh(i);
// funny punning
if(v->etype != et) {
if(debug['R'])
print("pun et=%d/%d w=%d/%d o=%d/%d %D\n",
v->etype, et,
v->width, w,
v->offset, o, a);
for(z=0; z<BITS; z++)
addrs.b[z] |= bit.b[z];
goto none;
}
if(n == D_EXTERN || n == D_STATIC) if(n == D_EXTERN || n == D_STATIC)
for(z=0; z<BITS; z++) for(z=0; z<BITS; z++)
externs.b[z] |= bit.b[z]; externs.b[z] |= bit.b[z];
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment