void gen_lea(struct treenode *bnode, short e)
{
- printf("\t//gen_lea(e: %i)\n", e);
+ printf("\t//gen_lea(e= %i)\n", e);
KIDREG2PARM(0);
if(e) {
KIDKIDREG2PARM(1,0);
printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
}
-void make_call(struct treenode *bnode)
+void make_call(struct treenode *bnode, short skippop)
{
- int j;
- printf("\t//params pushen\n");
+ short *sc = bnode->sc;
+ int j, off = 0;
+ printf("\t//params pushen (skippop: %d)\n", skippop);
for(j = 0; j < bnode->soffset; j++) {
- printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
+ if(sc[j] == 1)
+ printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), (j - off)*8);
+ else {
+ if (sc[j] == 0) {
+ printf("\tpushq %%%s\n", param_reg(j));
+ off++;
+ }
+ }
}
printf("\t//vars pushen\n");
- for(j = 6; j > 6 - bnode->vars - 1; j--) {
+ for(j = bnode->soffset; j < bnode->soffset + bnode->vars; j++) {
printf("\tpushq %%%s\n", param_reg(j));
}
printf("\tcall %s\n", bnode->name);
if(strcmp(BN_REG, "rax")!=0) {
move("rax", BN_REG);
+ if(skippop)
+ goto cleanup;
if(strcmp(BN_REG, "r10")!=0) {
printf("\tpopq %%r10\n");
}
printf("\tpopq %%rax\n");
}
+ if(skippop)
+ goto cleanup;
- /* vars poppen */
- for(j = 6 - bnode->vars; j < 6+1; j++) {
+ printf("\t//vars poppen\n");
+ for(j = bnode->soffset + bnode->vars - 1; j > bnode->soffset - 1; j--) {
printf("\tpopq %%%s\n", param_reg(j));
}
- /* params poppen */
+ printf("\t//params poppen (sc == 0)\n");
+ for(j = bnode->soffset - 1; j >= 0; j--) {
+ if(sc[j] == 0)
+ printf("\tpopq %%%s\n", param_reg(j));
+ }
+ printf("\t//params poppen (sc != 0)\n");
for(j = 0; j < bnode->soffset; j++) {
- printf("\tpopq %%%s\n", param_reg(j));
+ if(sc[j] > 0)
+ printf("\tpopq %%%s\n", param_reg(j));
}
+
+cleanup:
+ /* clear stack_control array */
+ for(j = 0; j < sizeof sc / sizeof sc[0]; j++)
+ sc[j] = 0;
}
void prep_arg(struct treenode *bnode, int moveit)
{
- printf("\t//args-nr.: %i (%%%s) [moveit: %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
- 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) {
- KIDREG2PARM(1);
- printf("\tpushq %%%s\n", KID_REG(1));
- } else {
- printf("\tpushq %%%s\n", param_reg(bnode->soffset));
- }
+ short *sc = bnode->sc;
+ printf("\t//args-nr-> %i (%%%s) [moveit= %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
+ sc[bnode->soffset] = 1;
+ if(moveit == 1) { /* expr */
+ if(( bnode->kids[0] != TREENULL && bnode->kids[0]->op == O_NOTHING &&
+ bnode->kids[0] != TREENULL && bnode->kids[0]->op == O_NOTHING)) {
+ printf("\tpushq %%%s\n", param_reg(bnode->soffset));
+ sc[bnode->soffset] = 2;
} else {
printf("\tpushq %%%s\n", BN_REG);
}
- } else { /* just O_ID */
+ } else if(moveit == 2) { /* O_ID right */
+ KIDREG2PARM(1);
+ printf("\tpushq %%%s\n", KID_REG(1));
+ } else if(moveit == 0) { /* O_ID left */
KIDREG2PARM(0);
printf("\tpushq %%%s\n", KID_REG(0));
}
}
+void gen_sub_field(struct treenode *bnode)
+{
+ /* siehe intelli_03.0 @ gesamt */
+ printf("\t//gen_sub_field\n");
+ KIDKIDREG2PARM(1,0);
+ if(!(strcmp(bnode->kids[0]->kids[0]->kids[0]->name, bnode->kids[1]->kids[0]->name) == 0 &&
+ bnode->kids[0]->kids[0]->soffset == bnode->kids[1]->soffset)) {
+ KIDKIDKIDREG2PARM(0,0,0);
+ printf("\tmov %d(%%%s), %%%s\n", bnode->kids[0]->kids[0]->soffset * 8, KIDKIDKID_REG(0,0,0), BN_REG);
+ printf("\tmov %%%s, %d(%%%s)\n", BN_REG, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
+ }
+ printf("\tsub $%d, %d(%%%s)\n", bnode->kids[0]->kids[1]->val, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
+}
+
+int was_already_in_bfe = 0;
+
%}
%start begin
-%term O_RET=1 O_NULL=2 O_SUB=3 O_MUL=4 O_OR=5 O_LESS=6 O_EQ=7 O_ID=8 O_ADD=9 O_NUM=10 O_FIELD=11 O_MTWO=12 O_MFOUR=13 O_MEIGHT=14 O_MONE=15 O_ASSIGN=16 O_IF=17 O_BOOL=18 O_CALL=19 O_ARG=20 O_NOTHING=21
+%term O_RET=1 O_NULL=2 O_SUB=3 O_MUL=4 O_OR=5 O_LESS=6 O_EQ=7 O_ID=8 O_ADD=9 O_NUM=10 O_FIELD=11 O_MTWO=12 O_MFOUR=13 O_MEIGHT=14 O_MONE=15 O_ASSIGN=16 O_IF=17 O_BOOL=18 O_CALL=19 O_ARG=20 O_NOTHING=21 O_EXPR=22
%%
-begin: ret # 0 # printf("\n");
-begin: assign # 0 #
-begin: ifstat # 0 #
-begin: args # 0 #
+begin: ret # 0 # printf("\n"); was_already_in_bfe = 1;
+begin: assign # 0 # was_already_in_bfe = 1;
+begin: ifstat # 0 # was_already_in_bfe = 1;
+begin: expr # 0 # was_already_in_bfe = 1;
+begin: O_RET(O_CALL(O_NOTHING, O_ARG(O_NOTHING, O_NOTHING))) # 1 # if(was_already_in_bfe == 0) { printf("\tjmp %s\n", bnode->kids[0]->name); } else { make_call(bnode->kids[0], 1); } was_already_in_bfe = 1;
+begin: O_RET(O_CALL(expr,expr)) # 1 # make_call(bnode->kids[0], 1); was_already_in_bfe = 1;
assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(1));
assign: O_ASSIGN(expr, O_FIELD(expr)) # 1 # KIDKIDREG2PARM(1,0); printf("\tmovq %%%s, %d(%%%s)\n", BN_REG, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
assign: O_ASSIGN(O_ID, O_FIELD(expr)) # 1 # KIDREG2PARM(0); KIDKIDREG2PARM(1,0); printf("\tmovq %%%s, %d(%%%s)\n", KID_REG(0), bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
+assign: O_ASSIGN(O_SUB(O_FIELD(O_ID), imm), O_FIELD(O_ID)) # 1 # gen_sub_field(bnode);
ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\ttest $-1, %%%s\n", KID_REG(0));
ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax");
+ret: O_EXPR(expr) # 0 #
retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
retexpr: expr
expr: imm # 1 # moveimm(BN_VAL, BN_REG);
expr: O_BOOL(expr) # 0 #
-expr: O_CALL(expr) # 0 # make_call(bnode);
+expr: O_CALL(expr,expr) # 2 # make_call(bnode, 0);
expr: O_ARG(expr,expr) # 1 # prep_arg(bnode, 1);
expr: O_ARG(O_ID,expr) # 1 # prep_arg(bnode, 0);
+expr: O_ARG(expr,O_ID) # 1 # prep_arg(bnode, 2);
expr: O_NOTHING # 0 #
expr: O_SUB(expr,expr) # 2 # gen_e_eno(bnode, "subq");
projects / uebersetzerbau-ss10.git / blobdiff