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); }
13 #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);
21 void gen_e_eno(struct treenode *bnode, char *instr)
23 printf("\t//gen_e_eno(%s)\n", instr);
26 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
29 void gen_e_imm(struct treenode *bnode, char *instr)
31 printf("\t//gen_e_imm(%s)\n", instr);
34 /* man kann sich ein move der konstante bei der multiplikation ersparen */
35 if(strcmp(instr, "imulq") == 0) {
36 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
38 printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), KID_REG(0));
39 move(KID_REG(0), BN_REG);
43 void gen_imm_eno(struct treenode *bnode, char *instr)
45 printf("\t//gen_imm_eno(%s)\n", instr);
48 /* man kann sich ein move der konstante bei der multiplikation ersparen */
49 if(strcmp(instr, "imulq") == 0) {
50 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
51 } else if(strcmp(instr, "addq") == 0) {
52 printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
54 moveimm(KID_VAL(0), BN_REG);
55 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), BN_REG);
59 void gen_eqless(struct treenode *bnode, char *op, short e0, short e1)
61 printf("\t//gen_eqless_%i%i\n", e0, e1);
62 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
63 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
66 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
67 } else if(e0 && !e1) {
68 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
69 } else if(!e0 && e1) {
70 if(strcmp("e", op) == 0) {
71 printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
73 moveimm(KID_VAL(0), BN_REG);
74 printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG);
77 printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
78 printf("\tand $1, %%%s\n", BN_REG);
84 %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
88 begin: ret # 0 # printf("\n");
89 ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax"); func_footer();
91 retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
95 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
97 expr: O_SUB(expr,expr) # 1 # gen_e_eno(bnode, "subq");
98 expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
99 expr: O_SUB(imm,expr) # 2 # gen_imm_eno(bnode, "subq");
101 expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
102 expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
103 expr: O_ADD(imm,expr) # 2 # gen_imm_eno(bnode, "addq");
105 expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq");
106 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
107 expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "imulq");
109 expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq");
110 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
112 expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1);
113 expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0);
114 expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "l", 0, 1);
116 expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1);
117 expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0);
118 expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1);
119 expr: O_EQ(nexpr,O_NULL) # 0 #
120 expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0);
122 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);
123 expr: O_FIELD(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
126 nexpr: O_EQ(expr,O_NULL) # 0 # gen_eqless(bnode, "ne", 1, 0);
129 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
130 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
131 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
132 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
133 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) = KID_VAL(1) ? 1 : 0;