printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
}
-/* dirty...*/
-static short xchg_param[7] = {0};
void make_call(struct treenode *bnode)
{
int j;
printf("\t//params pushen\n");
for(j = 0; j < bnode->soffset; j++) {
- if(xchg_param[j] == 1)
- printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
+ printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
}
printf("\t//vars pushen\n");
for(j = VARBEGIN; j > VARBEGIN - bnode->vars; j--) {
void prep_arg(struct treenode *bnode, int moveit)
{
printf("\t//args-nr-> %i (%%%s) [moveit= %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
- xchg_param[bnode->soffset] = 1;
if(moveit) { /* expr */
if((BN_REG == (char *) NULL) || (bnode->kids[1] != TREENULL && bnode->kids[1]->op == O_ID && bnode->kids[1]->kids[0] == TREENULL && bnode->kids[1]->kids[1] == TREENULL)) {
if(bnode->kids[1]->name != (char *) NULL && strcmp(bnode->kids[1]->name,"this")!=0) {
printf("\tpushq %%%s\n", KID_REG(1));
} else {
printf("\tpushq %%%s\n", param_reg(bnode->soffset));
- xchg_param[bnode->soffset] = 0;
}
} else {
printf("\tpushq %%%s\n", BN_REG);
} else { /* just O_ID */
KIDREG2PARM(0);
printf("\tpushq %%%s\n", KID_REG(0));
- if(strcmp(KID_REG(0), param_reg(bnode->soffset)) == 0) {
- xchg_param[bnode->soffset] = 0;
- }
}
}
@i {
@Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, new_nothing(), 0) /*this*/,
TREENULL, @Term.gparamges@, @Term.vars_in@);
- @Term.node@->soffset = @Exprs.paramcount@;
+ @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
}
@i @Exprs.cnt@ = 1;
@i @Term.imm@ = 0;
@i {
@Term.node@ = new_call(@IDENT.name@, new_arg(@Exprs.node@, @Term.1.node@, 0) /*this*/,
TREENULL, @Term.gparamges@, @Term.vars_in@);
- @Term.node@->soffset = @Exprs.paramcount@;
+ @Term.node@->soffset = MAX(@Exprs.paramcount@, @Term.gparamges@);
}
@i @Exprs.cnt@ = 1;
@i @Term.imm@ = 0;