X-Git-Url: http://wien.tomnetworks.com/gitweb/?a=blobdiff_plain;f=gesamt_ppc%2Fcode.bfe;h=97dc26946b5bf724e4ac394240e6ea599645fe04;hb=7b8df533cad8c9a84e4da9b60f26b5109daef638;hp=000638201c2356002ff89b988ab1404fb61eaa74;hpb=61464f024c073b5aed5ed55e0eb29bd4bf10ae9e;p=uebersetzerbau-ss10.git diff --git a/gesamt_ppc/code.bfe b/gesamt_ppc/code.bfe index 0006382..97dc269 100644 --- a/gesamt_ppc/code.bfe +++ b/gesamt_ppc/code.bfe @@ -55,9 +55,9 @@ void gen_id_eno(struct treenode *bnode) KIDKIDREG2PARM(1,0); KIDKIDREG2PARM(1,1); KIDREG2PARM(0); - move(KID_REG(0), BN_REG); - printf("\tsub %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG); - printf("\tsub %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG); + + printf("\tsub %s,%s,%s\n", BN_REG, KID_REG(0), KIDKID_REG(1,1)); + printf("\tsub %s,%s,%s\n", BN_REG, BN_REG, KIDKID_REG(1,0)); } void gen_e_field(struct treenode *bnode, char *instr) @@ -86,7 +86,7 @@ void gen_e_imm(struct treenode *bnode, char *instr) if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) { printf("\t#multiplikation mit 1 wegoptimiert\n"); } else { - printf("\tmullw $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG); + printf("\tmulli %s,%s,%d\n", BN_REG, KID_REG(0), KID_VAL(1)); } } else { if(strcmp(instr, "sub") == 0 && KID_VAL(1) == 0) { @@ -123,10 +123,10 @@ void gen_imm_eno(struct treenode *bnode, char *instr) if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) { printf("\t#multiplikation mit 1 wegoptimiert\n"); } else { - printf("\tmullw $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG); + printf("\tmulli %s,%s,%d\n", BN_REG, KID_REG(1), KID_VAL(0)); } } else { /* addq */ - printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG); + printf("\taddi %s,%s,%d\n", BN_REG, BN_REG, KID_VAL(0)); } } @@ -179,22 +179,11 @@ void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep /* um (32-29)=3 nach rechts shiften und das LSB anschauen */ printf("\trlwinm %s,%s,%i,31,31\n", BN_REG, BN_REG, strcmp(op,"l")==0 ? 30 : 30); } + /* vergleich mit null und in CR0 speichern */ + printf("\tcmpwi %s,0\n", BN_REG); #endif } -void gen_lea(struct treenode *bnode, short e) -{ - printf("\t#gen_lea(e= %i)\n", e); - KIDREG2PARM(0); - if(e) { - KIDKIDREG2PARM(1,0); - printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG); - } else { - KIDKIDREG2PARM(1,1); - printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG); - } -} - void gen_subspecial(struct treenode *bnode, short e) { /* tritt z.b. bei snafu_05.0 auf */ @@ -204,7 +193,7 @@ void gen_subspecial(struct treenode *bnode, short e) if(e) { if(KIDKID_VAL(1,0) != 0) { - printf("\tsubf $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG); + printf("\tsubi %s,%s,%d\n", BN_REG, BN_REG, KIDKID_VAL(1,0)); } } else { printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG); @@ -215,12 +204,13 @@ void gen_subspecial(struct treenode *bnode, short e) void assign_var(struct treenode *bnode) { + printf("\t#assign_var\n"); KIDREG2PARM(1); if (strcmp(bnode->kids[0]->kids[0]->name, bnode->kids[1]->name) != 0) { KIDKIDREG2PARM(0,0); - printf("\tmov %%%s, %%%s\n", KIDKID_REG(0,0), KID_REG(1)); + printf("\tmr %s,%s\n", KID_REG(1), KIDKID_REG(0,0)); } /*else: x := x - 1 geht in einem befehl */ - printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1)); + printf("\tsubi %s,%s,%d\n", KID_REG(1), KID_REG(1), KIDKID_VAL(0,1)); } void make_call(struct treenode *bnode) @@ -228,38 +218,49 @@ void make_call(struct treenode *bnode) int j; printf("\t#params pushen\n"); for(j = 0; j < bnode->soffset; j++) { - printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8); + printf("\tlwz 20,%d(1)\n", j*4); + printf("\tstw %s,%d(1)\n", param_reg(j), j*4); + printf("\tmr %s,20\n", param_reg(j)); } printf("\t#vars pushen\n"); - for(j = VARBEGIN; j > VARBEGIN - bnode->vars; j--) { - printf("\tpushq %%%s\n", param_reg(j)); + for(j = bnode->soffset; j < bnode->soffset + bnode->vars; j++) { + printf("\tstw %s,%d(1)\n", param_reg(j), j*4); } /* TODO: schoener machen... */ - if(strcmp(BN_REG, "rax")!=0) { + if(strcmp(BN_REG, "14")!=0) { printf("\t#tmp register pushen\n"); - printf("\tpushq %%rax\n"); - if(strcmp(BN_REG, "r10")!=0) { - printf("\tpushq %%r10\n"); + printf("\tstw 14,52(1)\n"); + if(strcmp(BN_REG, "15")!=0) { + printf("\tstw 15,56(1)\n"); + if(strcmp(BN_REG, "16")!=0) { + printf("\tstw 16,60(1)\n"); + } } } - printf("\tcall %s\n", bnode->name); - if(strcmp(BN_REG, "rax")!=0) { - move("rax", BN_REG); - if(strcmp(BN_REG, "r10")!=0) { - printf("\tpopq %%r10\n"); + + printf("\tbl %s\n", bnode->name); + move("3", BN_REG); + + if(strcmp(BN_REG, "14")!=0) { + printf("\t#tmp register poppen\n"); + if(strcmp(BN_REG, "15")!=0) { + if(strcmp(BN_REG, "16")!=0) { + printf("\tlwz 16,60(1)\n"); + } + printf("\tlwz 15,56(1)\n"); } - printf("\tpopq %%rax\n"); + printf("\tlwz 14,52(1)\n"); } - /* vars poppen */ - for(j = VARBEGIN+1 - bnode->vars; j < VARBEGIN+1; j++) { - printf("\tpopq %%%s\n", param_reg(j)); + printf("\t#vars poppen\n"); + for(j = bnode->soffset + bnode->vars - 1; j > bnode->soffset - 1; j--) { + printf("\tlwz %s,%d(1)\n", param_reg(j), j*4); } - /* params poppen */ + printf("\t#params poppen\n"); for(j = 0; j < bnode->soffset; j++) { - printf("\tpopq %%%s\n", param_reg(j)); + printf("\tlwz %s,%d(1)\n", param_reg(j), j*4); } } @@ -270,16 +271,16 @@ void prep_arg(struct treenode *bnode, int moveit) 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)); + printf("\tstw %s,%d(1)\n", KID_REG(1),bnode->soffset*4); } else { - printf("\tpushq %%%s\n", param_reg(bnode->soffset)); + printf("\tstw %s,%d(1)\n", param_reg(bnode->soffset), bnode->soffset*4); } } else { - printf("\tpushq %%%s\n", BN_REG); + printf("\tstw %s,%d(1)\n", BN_REG, bnode->soffset*4); } } else { /* just O_ID */ KIDREG2PARM(0); - printf("\tpushq %%%s\n", KID_REG(0)); + printf("\tstw %s,%d(1)\n", KID_REG(0), bnode->soffset*4); } } @@ -291,10 +292,10 @@ void gen_sub_field(struct treenode *bnode) 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("\tmov %s,%d(%s)\n", BN_REG, bnode->kids[0]->kids[0]->soffset * 8, KIDKIDKID_REG(0,0,0)); + 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)); + printf("\tsubi $%d, %d(%%%s)\n", bnode->kids[0]->kids[1]->val, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0)); } %} @@ -304,24 +305,23 @@ void gen_sub_field(struct treenode *bnode) %% -begin: ret # 0 # printf("\n"); +begin: ret # 0 # begin: assign # 0 # begin: ifstat # 0 # begin: args # 0 # -assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(1)); -assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq $%d, %%%s\n", KID_VAL(0), KID_REG(1)); -assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmovq %%%s, %%%s\n", KID_REG(0), KID_REG(1)); +assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmr %s,%s\n", KID_REG(1), BN_REG); +assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); printf("\tli %s,%d\n", KID_REG(1), KID_VAL(0)); +assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmr %s,%s\n", KID_REG(1), KID_REG(0)); assign: O_ASSIGN(O_SUB(O_ID,O_NUM), O_ID) # 1 # assign_var(bnode); -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); +assign: O_ASSIGN(expr, O_FIELD(expr)) # 1 # KIDKIDREG2PARM(1,0); printf("\tstw %s,%d(%s)\n", BN_REG, bnode->kids[1]->soffset * 4, KIDKID_REG(1,0)); +assign: O_ASSIGN(O_ID, O_FIELD(expr)) # 1 # KIDREG2PARM(0); KIDKIDREG2PARM(1,0); printf("\tstw %s,%d(%s)\n", KID_REG(0), bnode->kids[1]->soffset * 4, KIDKID_REG(1,0)); -ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\ttest $-1, %%%s\n", KID_REG(0)); +ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\tcmpwi %s,0\n", KID_REG(0)); ifstat: O_IF(expr) # 2 # /* iburg beschummeln :/ */ printf("\ttest $-1, %%rax\n"); ifstat: O_IF(O_BOOL(expr)) # 1 # /* dann braucht man kein test */ @@ -351,22 +351,10 @@ expr: O_SUB(expr,O_SUB(imm,expr)) # 2 # gen_subspecial(bnode, 1); expr: O_SUB(expr, O_ADD(O_ID,expr)) # 1 # gen_id_eno(bnode); -expr: O_SUB(expr,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(expr,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(expr,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(expr,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0); - -expr: O_SUB(expr,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1); -expr: O_SUB(expr,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1); -expr: O_SUB(expr,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1); -expr: O_SUB(expr,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1); - - -expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq"); -expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq"); -expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "addq"); -expr: O_ADD(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "addq"); +expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "add"); +expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "add"); +expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "add"); expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "mullw"); @@ -374,7 +362,6 @@ expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "mullw"); expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "mullw"); expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "mullw"); -expr: O_MUL(O_FIELD(expr),imm) # 1 # gen_field_imm(bnode); expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "or"); expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "or");