4 #define KID_REG(A) bnode->kids[A]->reg
5 #define KIDKID_REG(A,B) bnode->kids[A]->kids[B]->reg
6 #define KIDKIDKID_REG(A,B,C) bnode->kids[A]->kids[B]->kids[C]->reg
7 #define KID_VAL(A) bnode->kids[A]->val
8 #define KIDKID_VAL(A,B) bnode->kids[A]->kids[B]->val
9 #define KIDKIDKID_VAL(A,B,C) bnode->kids[A]->kids[B]->kids[C]->val
10 #define BN_REG bnode->reg
11 #define BN_VAL bnode->val
13 /* falls ein parameter auf der "leseseite" ist, soll das statt ein weiteres
14 * register verwendet werden */
15 #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
16 #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); }
17 #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); }
19 #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);
27 void gen_e_eno(struct treenode *bnode, char *instr)
29 printf("\t//gen_e_eno(%s)\n", instr);
32 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
35 void gen_e_field(struct treenode *bnode, char *instr)
37 printf("\t//gen_e_field(%s)\n", instr);
40 printf("\t%s %d(%%%s), %%%s\n", instr, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0), KID_REG(0));
43 void gen_e_imm(struct treenode *bnode, char *instr)
45 printf("\t//gen_e_imm(%s)\n", instr);
48 /* man kann sich ein move der konstante bei der multiplikation ersparen */
49 if(strcmp(instr, "imulq") == 0) {
50 if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
51 printf("\t//multiplikation mit 1 wegoptimiert\n");
53 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
56 if(strcmp(instr, "subq") == 0 && KID_VAL(1) == 0) {
57 printf("\t//subtraktion mit 0 wegoptimiert\n");
58 move(KID_REG(0), BN_REG);
60 printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), KID_REG(0));
61 move(KID_REG(0), BN_REG);
66 void gen_imm_eno(struct treenode *bnode, char *instr)
68 printf("\t//gen_imm_eno(%s)\n", instr);
71 /* man kann sich ein move der konstante bei der multiplikation ersparen */
72 if(strcmp(instr, "imulq") == 0) {
73 if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
74 printf("\t//multiplikation mit 1 wegoptimiert\n");
76 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
78 } else if(strcmp(instr, "addq") == 0) {
79 printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
81 moveimm(KID_VAL(0), BN_REG);
82 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), BN_REG);
86 void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep)
88 printf("\t//gen_eqless_%i%i @ %i\n", e0, e1, deep);
89 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
90 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
95 printf("\tcmp %d(%%%s), %%%s\n", bnode->kids[1]->soffset *8, KIDKID_REG(1,0), KID_REG(0));
97 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
99 } else if(e0 && !e1) {
101 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
102 } else if (deep == 1) {
104 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKID_REG(0,0));
105 } else if (deep == 2) {
106 KIDKIDKIDREG2PARM(0,0,0);
107 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKIDKID_REG(0,0,0));
109 } else if(!e0 && e1) {
110 printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
112 printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
113 printf("\tand $1, %%%s\n", BN_REG);
116 void gen_lea(struct treenode *bnode, short e)
118 printf("\t//gen_lea(e: %i)\n", e);
122 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG);
125 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG);
132 %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 O_MTWO=12 O_MFOUR=13 O_MEIGHT=14 O_MONE=15
136 begin: ret # 0 # printf("\n");
137 ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax"); func_footer();
139 retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
143 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
145 expr: O_SUB(expr,expr) # 1 # gen_e_eno(bnode, "subq");
146 expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
147 expr: O_SUB(imm,expr) # 2 # gen_imm_eno(bnode, "subq");
148 expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subq");
150 expr: O_SUB(expr,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0);
151 expr: O_SUB(expr,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0);
152 expr: O_SUB(expr,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0);
153 expr: O_SUB(expr,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0);
155 expr: O_SUB(expr,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1);
156 expr: O_SUB(expr,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1);
157 expr: O_SUB(expr,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1);
158 expr: O_SUB(expr,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1);
160 expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
161 expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
162 expr: O_ADD(imm,expr) # 2 # gen_imm_eno(bnode, "addq");
164 expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq");
165 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
166 expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "imulq");
168 expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq");
169 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
170 expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "orq");
172 expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1, 0);
173 expr: O_LESS(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "l", 1, 1, 1);
174 expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0, 0);
175 expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "g", 0, 1, 0);
177 expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1, 0);
178 expr: O_EQ(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "e", 1, 1, 1);
179 expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
180 expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1, 0);
181 expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
182 expr: O_EQ(O_EQ(expr,O_NULL),O_NULL) # 3 # gen_eqless(bnode, "ne", 1, 0, 1);
183 expr: O_EQ(O_EQ(O_EQ(expr,O_NULL),O_NULL),O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 2);
185 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);
186 expr: O_FIELD(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
190 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
191 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
192 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
193 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
194 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) == KID_VAL(1) ? 1 : 0;
195 imm: O_OR(imm,imm) # 0 # BN_VAL = KID_VAL(0) | KID_VAL(1);