p = ptxt;
while(p->link->as == AFUNCDATA || p->link->as == APCDATA || p->link->as == ATYPE)
p = p->link;
- if(stkptrsize >= 8*widthptr) {
+ if(stkzerosize >= 8*widthptr) {
p = appendp(p, AMOVW, D_CONST, NREG, 0, D_REG, 0, 0);
- p = appendp(p, AADD, D_CONST, NREG, 4+frame-stkptrsize, D_REG, 1, 0);
+ p = appendp(p, AADD, D_CONST, NREG, 4+frame-stkzerosize, D_REG, 1, 0);
p->reg = REGSP;
- p = appendp(p, AADD, D_CONST, NREG, stkptrsize, D_REG, 2, 0);
+ p = appendp(p, AADD, D_CONST, NREG, stkzerosize, D_REG, 2, 0);
p->reg = 1;
p1 = p = appendp(p, AMOVW, D_REG, 0, 0, D_OREG, 1, 4);
p->scond |= C_PBIT;
patch(p, p1);
} else {
first = 1;
- for(i=0, j=0; i<stkptrsize; i+=widthptr, j+=2) {
+ for(i=0, j=(stkptrsize-stkzerosize)/widthptr*2; i<stkzerosize; i+=widthptr, j+=2) {
if(bvget(bv, j) || bvget(bv, j+1)) {
if(first) {
p = appendp(p, AMOVW, D_CONST, NREG, 0, D_REG, 0, 0);
first = 0;
}
- p = appendp(p, AMOVW, D_REG, 0, 0, D_OREG, REGSP, 4+frame-stkptrsize+i);
+ p = appendp(p, AMOVW, D_REG, 0, 0, D_OREG, REGSP, 4+frame-stkzerosize+i);
}
}
}
// so that garbage collector only sees initialized values
// when it looks for pointers.
p = ptxt;
- if(stkptrsize >= 8*widthptr) {
+ if(stkzerosize >= 8*widthptr) {
p = appendp(p, AMOVQ, D_CONST, 0, D_AX, 0);
- p = appendp(p, AMOVQ, D_CONST, stkptrsize/widthptr, D_CX, 0);
- p = appendp(p, ALEAQ, D_SP+D_INDIR, frame-stkptrsize, D_DI, 0);
+ p = appendp(p, AMOVQ, D_CONST, stkzerosize/widthptr, D_CX, 0);
+ p = appendp(p, ALEAQ, D_SP+D_INDIR, frame-stkzerosize, D_DI, 0);
p = appendp(p, AREP, D_NONE, 0, D_NONE, 0);
appendp(p, ASTOSQ, D_NONE, 0, D_NONE, 0);
} else {
- for(i=0, j=0; i<stkptrsize; i+=widthptr, j+=2)
+ for(i=0, j=(stkptrsize-stkzerosize)/widthptr*2; i<stkzerosize; i+=widthptr, j+=2)
if(bvget(bv, j) || bvget(bv, j+1))
- p = appendp(p, AMOVQ, D_CONST, 0, D_SP+D_INDIR, frame-stkptrsize+i);
+ p = appendp(p, AMOVQ, D_CONST, 0, D_SP+D_INDIR, frame-stkzerosize+i);
}
}
// so that garbage collector only sees initialized values
// when it looks for pointers.
p = ptxt;
- if(stkptrsize >= 8*widthptr) {
+ if(stkzerosize >= 8*widthptr) {
p = appendp(p, AMOVL, D_CONST, 0, D_AX, 0);
- p = appendp(p, AMOVL, D_CONST, stkptrsize/widthptr, D_CX, 0);
- p = appendp(p, ALEAL, D_SP+D_INDIR, frame-stkptrsize, D_DI, 0);
+ p = appendp(p, AMOVL, D_CONST, stkzerosize/widthptr, D_CX, 0);
+ p = appendp(p, ALEAL, D_SP+D_INDIR, frame-stkzerosize, D_DI, 0);
p = appendp(p, AREP, D_NONE, 0, D_NONE, 0);
appendp(p, ASTOSL, D_NONE, 0, D_NONE, 0);
} else {
- for(i=0, j=0; i<stkptrsize; i+=widthptr, j+=2)
+ for(i=0, j=(stkptrsize-stkzerosize)/widthptr*2; i<stkzerosize; i+=widthptr, j+=2)
if(bvget(bv, j) || bvget(bv, j+1))
- p = appendp(p, AMOVL, D_CONST, 0, D_SP+D_INDIR, frame-stkptrsize+i);
+ p = appendp(p, AMOVL, D_CONST, 0, D_SP+D_INDIR, frame-stkzerosize+i);
}
}
uchar dupok; // duplicate definitions ok (for func)
schar likely; // likeliness of if statement
uchar hasbreak; // has break statement
+ uchar needzero; // if it contains pointers, needs to be zeroed on function entry
uint esc; // EscXXX
int funcdepth;
EXTERN Node* lasttype;
EXTERN vlong maxarg;
EXTERN vlong stksize; // stack size for current frame
-EXTERN vlong stkptrsize; // prefix of stack containing pointers for current frame
+EXTERN vlong stkptrsize; // prefix of stack containing pointers
+EXTERN vlong stkzerosize; // prefix of stack that must be zeroed on entry
EXTERN int32 blockgen; // max block number
EXTERN int32 block; // current block number
EXTERN int hasdefer; // flag that curfn has defer statetment
// Sort the list of stack variables. Autos after anything else,
// within autos, unused after used, within used, things with
-// pointers first, and then decreasing size.
+// pointers first, zeroed things first, and then decreasing size.
// Because autos are laid out in decreasing addresses
-// on the stack, pointers first and decreasing size
-// really means, in memory, pointers near the top of the
-// stack and increasing in size.
+// on the stack, pointers first, zeroed things first and decreasing size
+// really means, in memory, things with pointers needing zeroing at
+// the top of the stack and increasing in size.
// Non-autos sort on offset.
static int
cmpstackvar(Node *a, Node *b)
bp = haspointers(b->type);
if(ap != bp)
return bp - ap;
+
+ ap = a->needzero;
+ bp = b->needzero;
+ if(ap != bp)
+ return bp - ap;
+
if(a->type->width < b->type->width)
return +1;
if(a->type->width > b->type->width)
Node* n;
vlong w;
- if(curfn->dcl == nil) {
- stksize = 0;
- stkptrsize = 0;
+ stksize = 0;
+ stkptrsize = 0;
+ stkzerosize = 0;
+
+ if(curfn->dcl == nil)
return;
- }
// Mark the PAUTO's unused.
for(ll=curfn->dcl; ll != nil; ll=ll->next)
ll->n->used = 0;
markautoused(ptxt);
+
+ // TODO: Remove when liveness analysis sets needzero instead.
+ for(ll=curfn->dcl; ll != nil; ll=ll->next)
+ if (ll->n->class == PAUTO)
+ ll->n->needzero = 1; // ll->n->addrtaken;
listsort(&curfn->dcl, cmpstackvar);
if (n->class == PAUTO && n->op == ONAME && !n->used) {
// No locals used at all
curfn->dcl = nil;
- stksize = 0;
- stkptrsize = 0;
fixautoused(ptxt);
return;
}
}
// Reassign stack offsets of the locals that are still there.
- stksize = 0;
- stkptrsize = 0;
for(ll = curfn->dcl; ll != nil; ll=ll->next) {
n = ll->n;
if (n->class != PAUTO || n->op != ONAME)
fatal("bad width");
stksize += w;
stksize = rnd(stksize, n->type->align);
- if(haspointers(n->type))
+ if(haspointers(n->type)) {
stkptrsize = stksize;
+ if(n->needzero)
+ stkzerosize = stksize;
+ }
if(thechar == '5')
stksize = rnd(stksize, widthptr);
if(stksize >= (1ULL<<31)) {
}
stksize = rnd(stksize, widthptr);
stkptrsize = rnd(stkptrsize, widthptr);
+ stkzerosize = rnd(stkzerosize, widthptr);
fixautoused(ptxt);