codea: mehr generisch

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

diff --git a/codea/code.bfe b/codea/code.bfe
index 0b14110b88c157699202abd854b284046681e70a..cd30f851abd7cac7c8d557ff4a339d34eb1407b2 100644 (file)
--- a/codea/code.bfe
+++ b/codea/code.bfe
@@ -1,10 +1,11 @@
 %{
 #define BFEHAX
 
-#define KIDR(A) bnode->kids[A]->reg
-#define KIDV(A) bnode->kids[A]->val
-#define BNR bnode->reg
-#define BNV bnode->val
+#define KID_REG(A) bnode->kids[A]->reg
+#define KID_VAL(A) bnode->kids[A]->val
+#define BN_REG bnode->reg
+#define BN_VAL bnode->val
+#define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
 
 #include <stdio.h>
 #include <stdlib.h>
@@ -12,6 +13,25 @@
 #include "tree.h"
 #include "chelper.h"
 
+void gen_e_eno(struct treenode *bnode, char *instr)
+{
+       KIDREG2PARM(1);
+       printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
+}
+
+void gen_e_imm(struct treenode *bnode, char *instr)
+{
+       printf("\t%s $%li, %%%s\n", instr, KID_VAL(1), KID_REG(0));
+       move(KID_REG(0), BN_REG);
+}
+
+void gen_imm_eno(struct treenode *bnode, char *instr)
+{
+       moveimm(KID_VAL(0), BN_REG);
+       KIDREG2PARM(1);
+       printf("\tsubq %%%s, %%%s\n", KID_REG(1), BN_REG);
+}
+
 %}
 
 %start begin
@@ -19,23 +39,29 @@
 
 %%
 
-begin: ret # 0 # printf("// end\n");
-ret: O_RET(expr) # 2 # move(BNR, "rax"); ret();
+begin: ret # 0 # printf("\n");
+ret: O_RET(expr) # 2 # move(BN_REG, "rax"); func_footer();
+
+expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
+expr: imm # 1 # moveimm(BN_VAL, BN_REG);
+
+expr: O_SUB(expr,exprno) # 1 # gen_e_eno(bnode, "subq");
+expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
+expr: O_SUB(imm,exprno) # 3 # gen_imm_eno(bnode, "subq");
 
-expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BNR);
-expr: imm # 1 # moveimm(BNV, BNR);
+expr: O_ADD(expr,exprno) # 1 # gen_e_eno(bnode, "addq");
+expr: O_ADD(imm,expr) # 2 # gen_e_imm(bnode, "addq");
 
-expr: O_SUB(expr,expr) # 1 # fprintf(stderr, "osub0\n"); printf("\tsubq %%%s, %%%s\n", KIDR(0), KIDR(1));
-expr: O_SUB(imm,expr) # 2 # fprintf(stderr, "osub1\n"); printf("\tsubq $%li, %%%s\n", KIDV(0), KIDR(1)); move(KIDR(1), BNR);
-expr: O_SUB(expr,imm) # 3 # fprintf(stderr, "osub2\n"); moveimm(KIDV(1), BNR); printf("\tsubq %%%s, %%%s\n", KIDR(0), BNR);
+expr: O_MUL(expr,exprno) # 1 # gen_e_eno(bnode, "imulq");
+expr: O_MUL(expr,imm) # 2 # gen_e_imm(bnode, "imulq");
 
-expr: O_ADD(expr,expr) # 1 # printf("\taddq %%%s, %%%s\n", KIDR(1), KIDR(0));
-expr: O_ADD(imm,expr) # 1 # printf("\taddq $%li, %%%s\n", KIDV(1), KIDR(0)); move(KIDR(0), BNR);
-expr: O_ADD(expr,imm) # 1 # printf("\taddq $%li, %%%s\n", KIDV(0), KIDR(1)); move(KIDR(1), BNR);
+exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
+exprno: expr
 
 
-imm: O_ADD(imm,imm) # 0 # BNV = KIDV(0)+KIDV(1);
-imm: O_SUB(imm,imm) # 0 # BNV = KIDV(1)-KIDV(0);
+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_NUM # 0 #
 
 %%