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_less0(struct treenode *bnode)
50 printf("\t//gen_less0\n");
56 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
58 printf("\tcmovl %%%1$s, %%%1$s\n", BN_REG);
59 moveimm(0, KID_REG(1));
60 printf("\tcmovnl %%%s, %%%s\n", KID_REG(1), BN_REG);
63 void gen_less1(struct treenode *bnode)
65 printf("\t//gen_less1\n");
71 printf("\tcmp $%li, %%%s\n", KID_VAL(1), KID_REG(0));
73 printf("\tcmovl %%%1$s, %%%1$s\n", BN_REG);
74 moveimm(0, KID_REG(1));
75 printf("\tcmovnl %%%s, %%%s\n", KID_REG(1), BN_REG);
78 void gen_less2(struct treenode *bnode)
80 printf("\t//gen_less2\n");
82 moveimm(KID_VAL(0), BN_REG);
83 printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG);
86 printf("\tcmovl %%%1$s, %%%1$s\n", BN_REG);
87 moveimm(0, KID_REG(1));
88 printf("\tcmovnl %%%s, %%%s\n", KID_REG(1), BN_REG);
94 %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
98 begin: ret # 0 # printf("\n");
99 ret: O_RET(expr) # 2 # move(BN_REG, "rax"); func_footer();
101 expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
102 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
104 expr: O_SUB(expr,exprno) # 1 # gen_e_eno(bnode, "subq");
105 expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
106 expr: O_SUB(imm,exprno) # 2 # gen_imm_eno(bnode, "subq");
108 expr: O_ADD(expr,exprno) # 1 # gen_e_eno(bnode, "addq");
109 expr: O_ADD(imm,expr) # 2 # gen_e_imm(bnode, "addq");
111 expr: O_MUL(expr,exprno) # 1 # gen_e_eno(bnode, "imulq");
112 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
113 expr: O_MUL(imm,exprno) # 1 # gen_imm_eno(bnode, "imulq");
115 expr: O_OR(expr,exprno) # 1 # gen_e_eno(bnode, "orq");
116 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
118 expr: O_LESS(expr,expr) # 5 # gen_less0(bnode);
119 expr: O_LESS(expr,imm) # 5 # gen_less1(bnode);
120 expr: O_LESS(imm,expr) # 6 # gen_less2(bnode);
123 exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
127 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
128 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
129 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
130 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;