ppc: ersten zwei codeb testfaelle gehen (assign)

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

diff --git a/gesamt_ppc/code.bfe b/gesamt_ppc/code.bfe
index d67847a02cfa69b7f125e519c7c34c3dbe01bbf5..384314e7d90227d5eceebe38e8d1432739f59e1f 100644 (file)
--- a/gesamt_ppc/code.bfe
+++ b/gesamt_ppc/code.bfe
@@ -45,7 +45,7 @@ void gen_e_eno(struct treenode *bnode, char *instr)
 #else
        KIDREG2PARM(0);
        KIDREG2PARM(1);
-       printf("\t%s %s,%s,%s\n", instr, BN_REG, KID_REG(1), KID_REG(0));
+       printf("\t%s %s,%s,%s\n", instr, BN_REG, KID_REG(0), KID_REG(1));
 #endif
 }
 
@@ -56,8 +56,8 @@ void gen_id_eno(struct treenode *bnode)
        KIDKIDREG2PARM(1,1);
        KIDREG2PARM(0);
        move(KID_REG(0), BN_REG);
-       printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
-       printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,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);
 }
 
 void gen_e_field(struct treenode *bnode, char *instr)
@@ -73,7 +73,7 @@ void gen_field_imm(struct treenode *bnode)
        printf("\t#gen_field_imm\n");
        KIDKIDREG2PARM(0,0);
        KIDREG2ID(1);
-       printf("\timulq $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
+       printf("\tmullw $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
 }
 
 void gen_e_imm(struct treenode *bnode, char *instr)
@@ -82,14 +82,14 @@ void gen_e_imm(struct treenode *bnode, char *instr)
        KIDREG2PARM(0);
        KIDREG2ID(1);
        /* man kann sich ein move der konstante bei der multiplikation ersparen */
-       if(strcmp(instr, "imulq") == 0) {
+       if(strcmp(instr, "mullw") == 0) {
                if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
                        printf("\t#multiplikation mit 1 wegoptimiert\n");
                } else {
-                       printf("\timulq $%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, "subf") == 0 && KID_VAL(1) == 0) {
+               if(strcmp(instr, "sub") == 0 && KID_VAL(1) == 0) {
                        printf("\t#subtraktion mit 0 wegoptimiert\n");
                        move(KID_REG(0), BN_REG);
                } else {
@@ -97,8 +97,7 @@ void gen_e_imm(struct treenode *bnode, char *instr)
                        move(KID_REG(0), BN_REG);
                        printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG);
 #else
-                       /* subf only */
-                       printf("\taddi %s,%s,%d\n", BN_REG, KID_REG(0), -1*KID_VAL(1));
+                       printf("\t%si %s,%s,%d\n", instr, BN_REG, KID_REG(0), KID_VAL(1));
 #endif
                }
        }
@@ -120,11 +119,11 @@ void gen_imm_eno(struct treenode *bnode, char *instr)
        KIDREG2ID(0);
        KIDREG2PARM(1);
        /* man kann sich ein move der konstante bei der multiplikation ersparen */
-       if(strcmp(instr, "imulq") == 0) {
+       if(strcmp(instr, "mullw") == 0) {
                if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
                        printf("\t#multiplikation mit 1 wegoptimiert\n");
                } else {
-                       printf("\timulq $%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,12 +160,24 @@ void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep
        printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
        printf("\tand $1, %%%s\n", BN_REG);
 #else
-       if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
-       if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
-       if(strcmp(op,"e")==0 && KID_VAL(1) == 0) {
+       if(e0) { KIDREG2PARM(0); } else { moveimm(KID_VAL(0), BN_REG); }
+       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));
+               printf("\tmfcr %s\n", BN_REG);
+               /* EQ, GT, LT */
+               /* 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);
        }
 #endif
 }
@@ -199,11 +210,12 @@ 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);
@@ -293,15 +305,15 @@ 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);
 
@@ -331,9 +343,9 @@ expr: O_ARG(expr,expr) # 1 # prep_arg(bnode, 1);
 expr: O_ARG(O_ID,expr) # 1 # prep_arg(bnode, 0);
 expr: O_NOTHING # 0 #
 
-expr: O_SUB(expr,expr)          # 2 # gen_e_eno(bnode, "subf");
-expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subf");
-expr: O_SUB(expr,imm)           # 1 # gen_e_imm(bnode, "subf");
+expr: O_SUB(expr,expr)          # 2 # gen_e_eno(bnode, "sub");
+expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "sub");
+expr: O_SUB(expr,imm)           # 1 # gen_e_imm(bnode, "sub");
 
 expr: O_SUB(expr,O_SUB(O_ID,expr)) # 2 # gen_subspecial(bnode, 0);
 expr: O_SUB(expr,O_SUB(imm,expr))  # 2 # gen_subspecial(bnode, 1);
@@ -358,16 +370,16 @@ 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_MUL(expr,expr)   # 1 # gen_e_eno(bnode, "imulq");
-expr: O_MUL(expr,imm)    # 1 # gen_e_imm(bnode, "imulq");
-expr: O_MUL(imm,expr)    # 1 # gen_imm_eno(bnode, "imulq");
+expr: O_MUL(expr,expr)   # 1 # gen_e_eno(bnode, "mullw");
+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, "imulq");
+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, "orq");
-expr: O_OR(expr,imm)           # 2 # gen_e_imm(bnode, "orq");
-expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "orq");
+expr: O_OR(expr,expr)          # 1 # gen_e_eno(bnode, "or");
+expr: O_OR(expr,imm)           # 2 # gen_e_imm(bnode, "or");
+expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "or");
 
 
 expr: O_LESS(expr,expr)          # 3 # gen_eqless(bnode, "l", 1, 1, 0);
@@ -386,7 +398,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);