ppc: alle codeb testfaelle klappen nun auch

[uebersetzerbau-ss10.git] / gesamt_ppc / code.bfe

diff --git a/gesamt_ppc/code.bfe b/gesamt_ppc/code.bfe
index 8451990896d75ba9567d29b7e0265e961c56b2b0..dad8b92dd7afce6cc77941f1cb8c0d65fe1a0ced 100644 (file)
--- a/gesamt_ppc/code.bfe
+++ b/gesamt_ppc/code.bfe
@@ -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,7 +123,7 @@ 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);
@@ -161,11 +161,16 @@ void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep
        printf("\tand $1, %%%s\n", BN_REG);
 #else
        if(e0) { KIDREG2PARM(0); } else { moveimm(KID_VAL(0), BN_REG); }
-       if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
-       if(strcmp(op,"e")==0 && KID_VAL(1) == 0) {
+       if(e1) { KIDREG2PARM(1); } else { if(KID_VAL(1) != 0) moveimm(KID_VAL(1), KID_REG(1)); }
+       if(strcmp(op,"e")==0 && KID_VAL(1) == 0 && KID_VAL(0) == 0) {
                /* not */
                printf("\tcntlzw %s,%s\n", KID_REG(0), KID_REG(0));
                printf("\tsrwi %s,%s,5\n", BN_REG, KID_REG(0));
+       } else if(strcmp(op, "e")==0) {
+               /* eq */
+               printf("\txor %s,%s,%s\n", BN_REG, KID_REG(0), KID_REG(1));
+               printf("\tcntlzw %s,%s\n", BN_REG, BN_REG);
+               printf("\tsrwi %s,%s,5\n", BN_REG, BN_REG);
        } else if(strcmp(op, "l")==0 || strcmp(op, "g")==0) {
                /* less */
                printf("\tcmpw 7,%s,%s\n", KID_REG(1), KID_REG(0));
@@ -174,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 */
@@ -205,17 +199,18 @@ void gen_subspecial(struct treenode *bnode, short e)
                printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
        }
        if(e) KIDKIDREG2PARM(1,1);
-       printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
+       printf("\tadd %s,%s,%s\n", BN_REG, BN_REG, KIDKID_REG(1,1));
 }
 
 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));
        } /*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)
@@ -286,10 +281,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));
 }
 
 %}
@@ -299,24 +294,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 */
 
@@ -346,16 +340,6 @@ 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");
@@ -369,7 +353,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");
@@ -392,7 +375,7 @@ expr: O_EQ(O_EQ(expr,O_NULL),O_NULL)  # 3 # gen_eqless(bnode, "ne", 1, 0, 1);
 expr: O_EQ(O_EQ(O_EQ(expr,O_NULL),O_NULL),O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 2);
 
 
-expr: O_FIELD(expr) # 1 # printf("\t/* field(expr)*/\n"); KIDREG2PARM(0); printf("\tmovq %d(%%%s), %%%s\n", bnode->soffset * 8, KID_REG(0), BN_REG);
+expr: O_FIELD(expr) # 1 # printf("\t/* field(expr)*/\n"); KIDREG2PARM(0); printf("\tlwz %s, %d(%s)\n", BN_REG, bnode->soffset * 4, KID_REG(0));
 expr: O_FIELD(imm)  # 1 # printf("\t/* field(imm)*/\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);