codeb: (opt) backport von feld optimierung

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

diff --git a/codeb/code.bfe b/codeb/code.bfe
index 3847d7a1e1c838ee069dfb3c00da24fd0b66d3fe..b14118199a99da40acb68d4d916a79caa76e1fdd 100644 (file)
--- a/codeb/code.bfe
+++ b/codeb/code.bfe
@@ -172,10 +172,34 @@ void gen_subspecial(struct treenode *bnode, short e)
        printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
 }
 
+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));
+       } /*else:  x := x - 1 geht in einem befehl */
+       printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
+}
+
+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));
+}
+
 %}
 
 %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
+%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
 
 %%
 
@@ -183,19 +207,32 @@ begin: ret # 0 # printf("\n");
 begin: assign # 0 #
 begin: ifstat # 0 #
 
-assign: O_ASSIGN(O_ID, expr) # 1 # KIDREG2PARM(0); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(0));
-assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(0); KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", KID_REG(1), KID_REG(0));
-assign: O_ASSIGN(O_FIELD(expr), expr) # 1 # KIDKIDREG2PARM(0,0); printf("\tmovq %%%s, %d(%%%s)\n", BN_REG, bnode->kids[0]->soffset * 8, KIDKID_REG(0,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(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);
+
+
+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(expr) # 2 # /* iburg beschummeln :/ */ printf("\ttest $-1, %%rax\n");
+ifstat: O_IF(O_BOOL(expr)) # 1 # /* dann braucht man kein test */
+
 
 ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax"); func_footer();
 
 retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
 retexpr: expr
 
-ifstat: O_IF(expr) # 0 #
 
 expr: O_ID # 0 #
 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
+expr: O_BOOL(expr) # 0 #
 
 
 expr: O_SUB(expr,expr)          # 2 # gen_e_eno(bnode, "subq");