From 6ee8574eb8de603417fc0a55b6b9a809cb76b806 Mon Sep 17 00:00:00 2001 From: Bernhard Urban Date: Tue, 8 Jun 2010 20:35:09 +0200 Subject: [PATCH] ppc: gesamt (stack und so) geht jetzt auch TODO: lewurm_08.0 @ gesamt --- gesamt_ppc/chelper.c | 17 ++++++++++- gesamt_ppc/code.bfe | 71 +++++++++++++++++++++++++------------------- 2 files changed, 56 insertions(+), 32 deletions(-) diff --git a/gesamt_ppc/chelper.c b/gesamt_ppc/chelper.c index 94d3f91..c8746eb 100644 --- a/gesamt_ppc/chelper.c +++ b/gesamt_ppc/chelper.c @@ -23,7 +23,14 @@ void func_header(char *s, int vars, int parms, int call) need_stack = (vars || parms) && call; if(need_stack) { +#if 0 printf("\tenter $%d, $0\n", 8*(vars + parms + 2 /* fuer rax und r10 */)); +#else + /* save the link register */ + printf("\tmflr 0; stw 0,8(1)\n"); + /* create the stack */ + printf("\tstwu 1, -64(1)\n"); +#endif } } @@ -34,8 +41,16 @@ char *get_func_name(void) void func_footer(void) { - if(need_stack) + if(need_stack) { +#if 0 printf("\tleave\n"); +#else + /* remove stack frame */ + printf("\taddi 1,1,64\n"); + /* restore link register */ + printf("\tlwz 0,8(1); mtlr 0\n"); +#endif + } printf("\tblr\n\n\n"); } diff --git a/gesamt_ppc/code.bfe b/gesamt_ppc/code.bfe index dad8b92..ea56365 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) @@ -126,7 +126,7 @@ void gen_imm_eno(struct treenode *bnode, char *instr) 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)); } } @@ -193,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); @@ -208,7 +208,7 @@ void assign_var(struct treenode *bnode) 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("\tsubi %s,%s,%d\n", KID_REG(1), KID_REG(1), KIDKID_VAL(0,1)); } @@ -218,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)); + 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 */ + printf("\t#vars poppen\n"); for(j = VARBEGIN+1 - bnode->vars; j < VARBEGIN+1; j++) { - printf("\tpopq %%%s\n", param_reg(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); } } @@ -260,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); } } @@ -341,11 +352,9 @@ 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_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"); -- 2.25.1