X-Git-Url: http://wien.tomnetworks.com/gitweb/?a=blobdiff_plain;f=codea%2Fcode.bfe;h=654d669ba1afafef1d9a0860c2f28eeca94d4cfb;hb=9b6caa07337c258e239c81f6aa859c8bcf3e243c;hp=d0229766f75639c796d5d08533b39b0491f8ef4b;hpb=87d8329bf334039ff85cac0f833f63f4b9b8ceca;p=uebersetzerbau-ss10.git diff --git a/codea/code.bfe b/codea/code.bfe index d022976..654d669 100644 --- a/codea/code.bfe +++ b/codea/code.bfe @@ -1,18 +1,28 @@ %{ #define BFEHAX +/* macros zum registerzugriff bei kinder */ #define KID_REG(A) bnode->kids[A]->reg #define KIDKID_REG(A,B) bnode->kids[A]->kids[B]->reg +#define KIDKIDKID_REG(A,B,C) bnode->kids[A]->kids[B]->kids[C]->reg + +/* macros zum wertezugriff bei kindern */ #define KID_VAL(A) bnode->kids[A]->val #define KIDKID_VAL(A,B) bnode->kids[A]->kids[B]->val +#define KIDKIDKID_VAL(A,B,C) bnode->kids[A]->kids[B]->kids[C]->val + +/* macros zum zugriff des aktuellen knotens */ #define BN_REG bnode->reg #define BN_VAL bnode->val -/* falls ein parameter auf der "leseseite" ist, soll das statt ein weiteres - * register verwendet werden */ +/* wenn sich ein parameter auf der "leseseite" (also links bei at&t syntax) + * befindet, dann soll dieses register verwendet werden */ #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); } #define KIDKIDREG2PARM(A,B) if(bnode->kids[A]->kids[B]->param_index > -1) { bnode->kids[A]->kids[B]->reg = param_reg(bnode->kids[A]->kids[B]->param_index); } +#define KIDKIDKIDREG2PARM(A,B,C) if(bnode->kids[A]->kids[B]->kids[C]->param_index > -1) { bnode->kids[A]->kids[B]->kids[C]->reg = param_reg(bnode->kids[A]->kids[B]->kids[C]->param_index); } +/* wenn sich ein parameter auf der "schreibeseite" befindet (also rechts bei + * at&t syntax), dann muss es vorher in ein temporaeres register gemovt werden */ #define KIDREG2ID(A) if(bnode->kids[A]->op == O_ID && bnode->kids[A]->param_index > -1) move(param_reg(bnode->kids[A]->param_index), bnode->kids[A]->reg); #include @@ -29,20 +39,68 @@ void gen_e_eno(struct treenode *bnode, char *instr) printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0)); } +void gen_id_eno(struct treenode *bnode) +{ + printf("\t//gen_id_eno\n"); + KIDKIDREG2PARM(1,0); + printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,0), KIDKID_REG(1,1)); + printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG); +} + +void gen_e_field(struct treenode *bnode, char *instr) +{ + printf("\t//gen_e_field(%s)\n", instr); + KIDREG2ID(0); + KIDKIDREG2PARM(1,0); + printf("\t%s %d(%%%s), %%%s\n", instr, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0), KID_REG(0)); +} + +void gen_field_imm(struct treenode *bnode) +{ + printf("\t//gen_field_imm\n"); + KIDKIDREG2PARM(0,0); + KIDREG2ID(1); + + if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) { + printf("\t//multiplikation mit 1 wegoptimiert\n"); + } else { + printf("\timulq $%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) { printf("\t//gen_e_imm(%s)\n", instr); - KIDREG2ID(0); + KIDREG2PARM(0); KIDREG2ID(1); /* man kann sich ein move der konstante bei der multiplikation ersparen */ if(strcmp(instr, "imulq") == 0) { - printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG); + 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); + } } else { - printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), KID_REG(0)); - move(KID_REG(0), BN_REG); + if(strcmp(instr, "subq") == 0 && KID_VAL(1) == 0) { + printf("\t//subtraktion mit 0 wegoptimiert\n"); + move(KID_REG(0), BN_REG); + } else { + move(KID_REG(0), BN_REG); + printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG); + } } } +void gen_imm_field(struct treenode *bnode) +{ + printf("\t//gen_imm_field\n"); + KIDREG2ID(0); + KIDKIDREG2PARM(1, 0); + + moveimm(KID_VAL(0), BN_REG); + printf("\tsubq %d(%%%s), %%%s\n", bnode->kids[1]->soffset * 8, KIDKID_REG(1, 0), BN_REG); +} + void gen_imm_eno(struct treenode *bnode, char *instr) { printf("\t//gen_imm_eno(%s)\n", instr); @@ -50,32 +108,41 @@ void gen_imm_eno(struct treenode *bnode, char *instr) KIDREG2PARM(1); /* man kann sich ein move der konstante bei der multiplikation ersparen */ if(strcmp(instr, "imulq") == 0) { - printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG); - } else if(strcmp(instr, "addq") == 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); + } + } else { /* addq */ printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG); - } else { /* subq */ - moveimm(KID_VAL(0), BN_REG); - printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), BN_REG); } } -void gen_eqless(struct treenode *bnode, char *op, short e0, short e1) +void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep) { - printf("\t//gen_eqless_%i%i\n", e0, e1); + printf("\t//gen_eqless_%i%i @ %i\n", e0, e1, deep); if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); } if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); } if(e0 && e1) { - printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0)); + if(deep) { + KIDKIDREG2PARM(1,0); + printf("\tcmp %d(%%%s), %%%s\n", bnode->kids[1]->soffset *8, KIDKID_REG(1,0), KID_REG(0)); + } else { + printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0)); + } } else if(e0 && !e1) { - printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0)); + if (deep == 0) { + printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0)); + } else if (deep == 1) { + KIDKIDREG2PARM(0,0); + printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKID_REG(0,0)); + } else if (deep == 2) { + KIDKIDKIDREG2PARM(0,0,0); + printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKIDKID_REG(0,0,0)); + } } else if(!e0 && e1) { - if(strcmp("e", op) == 0) { printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1)); - } else { - moveimm(KID_VAL(0), BN_REG); - printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG); - } } printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG)); printf("\tand $1, %%%s\n", BN_REG); @@ -94,6 +161,22 @@ void gen_lea(struct treenode *bnode, short e) } } +void gen_subspecial(struct treenode *bnode, short e) +{ + /* tritt z.b. bei snafu_05.0 auf */ + printf("\t//gen_subspecial(%i)\n", e); + KIDREG2ID(0); + KIDKIDREG2PARM(1,0); + + if(e) { + printf("\tsubq $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG); + } else { + printf("\tsubq %%%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); +} + %} %start begin @@ -110,57 +193,78 @@ retexpr: expr expr: O_ID # 0 # expr: imm # 1 # moveimm(BN_VAL, BN_REG); -expr: O_SUB(expr,expr) # 1 # gen_e_eno(bnode, "subq"); -expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq"); -expr: O_SUB(imm,expr) # 2 # gen_imm_eno(bnode, "subq"); -expr: O_SUB(O_ID,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(O_ID,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(O_ID,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(O_ID,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0); -expr: O_SUB(O_ID,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1); -expr: O_SUB(O_ID,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1); -expr: O_SUB(O_ID,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1); -expr: O_SUB(O_ID,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1); +expr: O_SUB(expr,expr) # 2 # gen_e_eno(bnode, "subq"); +expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subq"); +expr: O_SUB(expr,imm) # 1 # gen_e_imm(bnode, "subq"); + +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); + +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_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq"); +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) # 2 # gen_imm_eno(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_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq"); + +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(imm,expr) # 1 # gen_imm_eno(bnode, "imulq"); -expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq"); -expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq"); +expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "imulq"); +expr: O_MUL(O_FIELD(expr),imm) # 1 # gen_field_imm(bnode); -expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1); -expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0); -expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "l", 0, 1); +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_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1); -expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0); -expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1); -expr: O_EQ(nexpr,O_NULL) # 0 # -expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0); -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(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG); +expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1, 0); +expr: O_LESS(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "l", 1, 1, 1); +expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0, 0); +expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "g", 0, 1, 0); + +expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1, 0); +expr: O_EQ(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "e", 1, 1, 1); +expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0, 0); +expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1, 0); +expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 0); -nexpr: O_EQ(expr,O_NULL) # 0 # gen_eqless(bnode, "ne", 1, 0); +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(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG); imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1); imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1); imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1); imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0; -imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) = KID_VAL(1) ? 1 : 0; +imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) == KID_VAL(1) ? 1 : 0; +imm: O_OR(imm,imm) # 0 # BN_VAL = KID_VAL(0) | KID_VAL(1); imm: O_NUM # 0 # imm: O_MONE # 0 # imm: O_MTWO # 0 # imm: O_MFOUR # 0 # imm: O_MEIGHT # 0 # +imm: O_NULL # 0 # %%