4 /* macros zum registerzugriff bei kinder */
5 #define KID_REG(A) bnode->kids[A]->reg
6 #define KIDKID_REG(A,B) bnode->kids[A]->kids[B]->reg
7 #define KIDKIDKID_REG(A,B,C) bnode->kids[A]->kids[B]->kids[C]->reg
9 /* macros zum wertezugriff bei kindern */
10 #define KID_VAL(A) bnode->kids[A]->val
11 #define KIDKID_VAL(A,B) bnode->kids[A]->kids[B]->val
12 #define KIDKIDKID_VAL(A,B,C) bnode->kids[A]->kids[B]->kids[C]->val
14 /* macros zum zugriff des aktuellen knotens */
15 #define BN_REG bnode->reg
16 #define BN_VAL bnode->val
18 /* wenn sich ein parameter auf der "leseseite" (also links bei at&t syntax)
19 * befindet, dann soll dieses register verwendet werden */
20 #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
21 #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); }
22 #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); }
24 /* wenn sich ein parameter auf der "schreibeseite" befindet (also rechts bei
25 * at&t syntax), dann muss es vorher in ein temporaeres register gemovt werden */
26 #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);
34 void gen_e_eno(struct treenode *bnode, char *instr)
36 printf("\t//gen_e_eno(%s)\n", instr);
39 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
42 void gen_id_eno(struct treenode *bnode)
44 printf("\t//gen_id_eno\n");
48 move(KID_REG(0), BN_REG);
49 printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
50 printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
53 void gen_e_field(struct treenode *bnode, char *instr)
55 printf("\t//gen_e_field(%s)\n", instr);
58 printf("\t%s %d(%%%s), %%%s\n", instr, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0), KID_REG(0));
61 void gen_field_imm(struct treenode *bnode)
63 printf("\t//gen_field_imm\n");
66 printf("\timulq $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
69 void gen_e_imm(struct treenode *bnode, char *instr)
71 printf("\t//gen_e_imm(%s)\n", instr);
74 /* man kann sich ein move der konstante bei der multiplikation ersparen */
75 if(strcmp(instr, "imulq") == 0) {
76 if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
77 printf("\t//multiplikation mit 1 wegoptimiert\n");
79 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
82 if(strcmp(instr, "subq") == 0 && KID_VAL(1) == 0) {
83 printf("\t//subtraktion mit 0 wegoptimiert\n");
84 move(KID_REG(0), BN_REG);
86 move(KID_REG(0), BN_REG);
87 printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG);
92 void gen_imm_field(struct treenode *bnode)
94 printf("\t//gen_imm_field\n");
98 moveimm(KID_VAL(0), BN_REG);
99 printf("\tsubq %d(%%%s), %%%s\n", bnode->kids[1]->soffset * 8, KIDKID_REG(1, 0), BN_REG);
102 void gen_imm_eno(struct treenode *bnode, char *instr)
104 printf("\t//gen_imm_eno(%s)\n", instr);
107 /* man kann sich ein move der konstante bei der multiplikation ersparen */
108 if(strcmp(instr, "imulq") == 0) {
109 if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
110 printf("\t//multiplikation mit 1 wegoptimiert\n");
112 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
115 printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
119 void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep)
121 printf("\t//gen_eqless_%i%i @ %i\n", e0, e1, deep);
122 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
123 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
128 printf("\tcmp %d(%%%s), %%%s\n", bnode->kids[1]->soffset *8, KIDKID_REG(1,0), KID_REG(0));
130 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
132 } else if(e0 && !e1) {
134 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
135 } else if (deep == 1) {
137 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKID_REG(0,0));
138 } else if (deep == 2) {
139 KIDKIDKIDREG2PARM(0,0,0);
140 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKIDKID_REG(0,0,0));
142 } else if(!e0 && e1) {
143 printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
145 printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
146 printf("\tand $1, %%%s\n", BN_REG);
149 void gen_lea(struct treenode *bnode, short e)
151 printf("\t//gen_lea(e: %i)\n", e);
155 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG);
158 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG);
162 void gen_subspecial(struct treenode *bnode, short e)
164 /* tritt z.b. bei snafu_05.0 auf */
165 printf("\t//gen_subspecial(%i)\n", e);
170 if(KIDKID_VAL(1,0) != 0) {
171 printf("\tsubq $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG);
174 printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
176 if(e) KIDKIDREG2PARM(1,1);
177 printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
180 void assign_var(struct treenode *bnode)
183 if (strcmp(bnode->kids[0]->kids[0]->name, bnode->kids[1]->name) != 0) {
185 printf("\tmov %%%s, %%%s\n", KIDKID_REG(0,0), KID_REG(1));
186 } /*else: x := x - 1 geht in einem befehl */
187 printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
190 void make_call(struct treenode *bnode)
193 printf("\t//params pushen\n");
194 for(j = 0; j < bnode->soffset; j++) {
195 printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
197 printf("\t//vars pushen\n");
198 for(j = 6; j > 6 - bnode->vars; j--) {
199 printf("\tpushq %%%s\n", param_reg(j));
202 /* TODO: schoener machen... */
203 if(strcmp(BN_REG, "rax")!=0) {
204 printf("\t//tmp register pushen\n");
205 printf("\tpushq %%rax\n");
206 if(strcmp(BN_REG, "r10")!=0) {
207 printf("\tpushq %%r10\n");
210 printf("\tcall %s\n", bnode->name);
211 if(strcmp(BN_REG, "rax")!=0) {
213 if(strcmp(BN_REG, "r10")!=0) {
214 printf("\tpopq %%r10\n");
216 printf("\tpopq %%rax\n");
220 for(j = 7 - bnode->vars; j < 7; j++) {
221 printf("\tpopq %%%s\n", param_reg(j));
225 for(j = 0; j < bnode->soffset; j++) {
226 printf("\tpopq %%%s\n", param_reg(j));
230 void prep_arg(struct treenode *bnode, int moveit)
232 printf("\t//args-nr.: %i (%%%s) [moveit: %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
233 if(moveit) { /* expr */
234 if((BN_REG == (char *) NULL) || (bnode->kids[1] != TREENULL && bnode->kids[1]->op == O_ID && bnode->kids[1]->kids[0] == TREENULL && bnode->kids[1]->kids[1] == TREENULL)) {
235 if(bnode->kids[1]->name != (char *) NULL && strcmp(bnode->kids[1]->name,"this")!=0) {
237 printf("\tpushq %%%s\n", KID_REG(1));
239 printf("\tpushq %%%s\n", param_reg(bnode->soffset));
242 printf("\tpushq %%%s\n", BN_REG);
244 } else { /* just O_ID */
246 printf("\tpushq %%%s\n", KID_REG(0));
253 %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 O_ASSIGN=16 O_IF=17 O_BOOL=18 O_CALL=19 O_ARG=20 O_NOTHING=21
257 begin: ret # 0 # printf("\n");
263 assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(1));
264 assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq $%d, %%%s\n", KID_VAL(0), KID_REG(1));
265 assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmovq %%%s, %%%s\n", KID_REG(0), KID_REG(1));
267 assign: O_ASSIGN(O_SUB(O_ID,O_NUM), O_ID) # 1 # assign_var(bnode);
269 assign: O_ASSIGN(expr, O_FIELD(expr)) # 1 # KIDKIDREG2PARM(1,0); printf("\tmovq %%%s, %d(%%%s)\n", BN_REG, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
270 assign: O_ASSIGN(O_ID, O_FIELD(expr)) # 1 # KIDREG2PARM(0); KIDKIDREG2PARM(1,0); printf("\tmovq %%%s, %d(%%%s)\n", KID_REG(0), bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
273 ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\ttest $-1, %%%s\n", KID_REG(0));
274 ifstat: O_IF(expr) # 2 # /* iburg beschummeln :/ */ printf("\ttest $-1, %%rax\n");
275 ifstat: O_IF(O_BOOL(expr)) # 1 # /* dann braucht man kein test */
278 ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax");
280 retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
285 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
286 expr: O_BOOL(expr) # 0 #
288 expr: O_CALL(expr) # 0 # make_call(bnode);
289 expr: O_ARG(expr,expr) # 1 # prep_arg(bnode, 1);
290 expr: O_ARG(O_ID,expr) # 1 # prep_arg(bnode, 0);
291 expr: O_NOTHING # 0 #
293 expr: O_SUB(expr,expr) # 2 # gen_e_eno(bnode, "subq");
294 expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subq");
295 expr: O_SUB(expr,imm) # 1 # gen_e_imm(bnode, "subq");
297 expr: O_SUB(expr,O_SUB(O_ID,expr)) # 2 # gen_subspecial(bnode, 0);
298 expr: O_SUB(expr,O_SUB(imm,expr)) # 2 # gen_subspecial(bnode, 1);
300 expr: O_SUB(expr, O_ADD(O_ID,expr)) # 1 # gen_id_eno(bnode);
302 expr: O_SUB(expr,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0);
303 expr: O_SUB(expr,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0);
304 expr: O_SUB(expr,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0);
305 expr: O_SUB(expr,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0);
307 expr: O_SUB(expr,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1);
308 expr: O_SUB(expr,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1);
309 expr: O_SUB(expr,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1);
310 expr: O_SUB(expr,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1);
313 expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
314 expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
315 expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "addq");
317 expr: O_ADD(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "addq");
320 expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq");
321 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
322 expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "imulq");
324 expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "imulq");
325 expr: O_MUL(O_FIELD(expr),imm) # 1 # gen_field_imm(bnode);
327 expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq");
328 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
329 expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "orq");
332 expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1, 0);
333 expr: O_LESS(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "l", 1, 1, 1);
334 expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0, 0);
335 expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "g", 0, 1, 0);
338 expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1, 0);
339 expr: O_EQ(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "e", 1, 1, 1);
340 expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
341 expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1, 0);
342 expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
344 expr: O_EQ(O_EQ(expr,O_NULL),O_NULL) # 3 # gen_eqless(bnode, "ne", 1, 0, 1);
345 expr: O_EQ(O_EQ(O_EQ(expr,O_NULL),O_NULL),O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 2);
348 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);
349 expr: O_FIELD(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
352 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
353 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
354 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
355 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
356 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) == KID_VAL(1) ? 1 : 0;
357 imm: O_OR(imm,imm) # 0 # BN_VAL = KID_VAL(0) | KID_VAL(1);