4 #define KID_REG(A) bnode->kids[A]->reg
5 #define KID_VAL(A) bnode->kids[A]->val
6 #define BN_REG bnode->reg
7 #define BN_VAL bnode->val
9 /* falls ein parameter auf der "leseseite" ist, soll das statt ein weiteres
10 * register verwendet werden */
11 #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
19 void gen_e_eno(struct treenode *bnode, char *instr)
22 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
25 void gen_e_imm(struct treenode *bnode, char *instr)
27 /* man kann sich ein move der konstante bei der multiplikation ersparen */
28 if(strcmp(instr, "imulq") == 0) {
29 printf("\timulq $%li, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
31 printf("\t%s $%li, %%%s\n", instr, KID_VAL(1), KID_REG(0));
32 move(KID_REG(0), BN_REG);
36 void gen_imm_eno(struct treenode *bnode, char *instr)
39 /* man kann sich ein move der konstante bei der multiplikation ersparen */
40 if(strcmp(instr, "imulq") == 0) {
41 printf("\timulq $%li, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
43 moveimm(KID_VAL(0), BN_REG);
44 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), BN_REG);
48 void gen_eqless_footer(struct treenode *bnode, char *op)
51 printf("\tcmov%s %%%2$s, %%%2$s\n", op, BN_REG);
52 moveimm(0, KID_REG(1));
53 printf("\tcmovn%s %%%s, %%%s\n", op, KID_REG(1), BN_REG);
56 void gen_eqless_ee(struct treenode *bnode, char *op)
58 printf("\t//gen_eqless_ee\n");
64 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
66 gen_eqless_footer(bnode, op);
69 void gen_eqless_ei(struct treenode *bnode, char *op)
71 printf("\t//gen_eqless_ei\n");
76 printf("\tcmp $%li, %%%s\n", KID_VAL(1), KID_REG(0));
78 gen_eqless_footer(bnode, op);
81 void gen_eqless_ie(struct treenode *bnode, char *op)
83 printf("\t//gen_eqless_ie\n");
84 if(strcmp("e", op) == 0) {
85 printf("\tcmp $%li, %%%s\n", KID_VAL(0), KID_REG(1));
86 gen_eqless_footer(bnode, op);
88 moveimm(KID_VAL(0), BN_REG);
89 printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG);
91 gen_eqless_footer(bnode, op);
98 %term O_RET=1 O_NOT=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
102 begin: ret # 0 # printf("\n");
103 ret: O_RET(expr) # 2 # move(BN_REG, "rax"); func_footer();
105 expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
106 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
108 expr: O_SUB(expr,exprno) # 1 # gen_e_eno(bnode, "subq");
109 expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
110 expr: O_SUB(imm,exprno) # 2 # gen_imm_eno(bnode, "subq");
112 expr: O_ADD(expr,exprno) # 1 # gen_e_eno(bnode, "addq");
113 expr: O_ADD(imm,expr) # 2 # gen_e_imm(bnode, "addq");
115 expr: O_MUL(expr,exprno) # 1 # gen_e_eno(bnode, "imulq");
116 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
117 expr: O_MUL(imm,exprno) # 1 # gen_imm_eno(bnode, "imulq");
119 expr: O_OR(expr,exprno) # 1 # gen_e_eno(bnode, "orq");
120 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
122 expr: O_LESS(expr,expr) # 5 # gen_eqless_ee(bnode, "l");
123 expr: O_LESS(expr,imm) # 5 # gen_eqless_ei(bnode, "l");
124 expr: O_LESS(imm,expr) # 6 # gen_eqless_ie(bnode, "l");
126 expr: O_EQ(expr,expr) # 5 # gen_eqless_ee(bnode, "e");
127 expr: O_EQ(expr,imm) # 5 # gen_eqless_ei(bnode, "e");
128 expr: O_EQ(imm,expr) # 5 # gen_eqless_ie(bnode, "e");
131 exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
135 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
136 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
137 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
138 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
139 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) = KID_VAL(1) ? 1 : 0;