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 #define KID_PARM(A) bnode->kids[A]->param_index
15 #define KIDKID_PARM(A,B) bnode->kids[A]->kids[B]->param_index
16 #define KIDKIDKID_PARM(A,B,C) bnode->kids[A]->kids[B]->kids[C]->param_index
18 /* macros zum zugriff des aktuellen knotens */
19 #define BN_REG bnode->reg
20 #define BN_VAL bnode->val
22 /* wenn sich ein parameter auf der "leseseite" (also links bei at&t syntax)
23 * befindet, dann soll dieses register verwendet werden */
24 #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
25 #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); }
26 #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); }
28 /* wenn sich ein parameter auf der "schreibeseite" befindet (also rechts bei
29 * at&t syntax), dann muss es vorher in ein temporaeres register gemovt werden */
30 #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);
38 void gen_e_eno(struct treenode *bnode, char *instr)
40 printf("\t#gen_e_eno(%s)\n", instr);
44 printf("\t%s %s, %s\n", instr, KID_REG(1), KID_REG(0));
48 printf("\t%s %s,%s,%s\n", instr, BN_REG, KID_REG(1), KID_REG(0));
52 void gen_id_eno(struct treenode *bnode)
54 printf("\t#gen_id_eno\n");
58 move(KID_REG(0), BN_REG);
59 printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
60 printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
63 void gen_e_field(struct treenode *bnode, char *instr)
65 printf("\t#gen_e_field(%s)\n", instr);
68 printf("\t%s %d(%%%s), %%%s\n", instr, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0), KID_REG(0));
71 void gen_field_imm(struct treenode *bnode)
73 printf("\t#gen_field_imm\n");
76 printf("\timulq $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
79 void gen_e_imm(struct treenode *bnode, char *instr)
81 printf("\t#gen_e_imm(%s)\n", instr);
84 /* man kann sich ein move der konstante bei der multiplikation ersparen */
85 if(strcmp(instr, "imulq") == 0) {
86 if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
87 printf("\t#multiplikation mit 1 wegoptimiert\n");
89 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
92 if(strcmp(instr, "subf") == 0 && KID_VAL(1) == 0) {
93 printf("\t#subtraktion mit 0 wegoptimiert\n");
94 move(KID_REG(0), BN_REG);
97 move(KID_REG(0), BN_REG);
98 printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG);
101 printf("\taddi %s,%s,%d\n", BN_REG, KID_REG(0), -1*KID_VAL(1));
107 void gen_imm_field(struct treenode *bnode)
109 printf("\t#gen_imm_field\n");
111 KIDKIDREG2PARM(1, 0);
113 moveimm(KID_VAL(0), BN_REG);
114 printf("\tsubf %d(%%%s), %%%s\n", bnode->kids[1]->soffset * 8, KIDKID_REG(1, 0), BN_REG);
117 void gen_imm_eno(struct treenode *bnode, char *instr)
119 printf("\t#gen_imm_eno(%s)\n", instr);
122 /* man kann sich ein move der konstante bei der multiplikation ersparen */
123 if(strcmp(instr, "imulq") == 0) {
124 if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
125 printf("\t#multiplikation mit 1 wegoptimiert\n");
127 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
130 printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
134 void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep)
136 printf("\t#gen_eqless_%i%i @ %i (op: %s)\n", e0, e1, deep, op);
138 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
139 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
144 printf("\tcmp %d(%%%s), %%%s\n", bnode->kids[1]->soffset *8, KIDKID_REG(1,0), KID_REG(0));
146 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
148 } else if(e0 && !e1) {
150 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
151 } else if (deep == 1) {
153 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKID_REG(0,0));
154 } else if (deep == 2) {
155 KIDKIDKIDREG2PARM(0,0,0);
156 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKIDKID_REG(0,0,0));
158 } else if(!e0 && e1) {
159 printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
161 printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
162 printf("\tand $1, %%%s\n", BN_REG);
164 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
165 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
166 if(strcmp(op,"e")==0 && KID_VAL(1) == 0) {
168 printf("\tcntlzw %s,%s\n", KID_REG(0), KID_REG(0));
169 printf("\tsrwi %s,%s,5\n", BN_REG, KID_REG(0));
174 void gen_lea(struct treenode *bnode, short e)
176 printf("\t#gen_lea(e= %i)\n", e);
180 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG);
183 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG);
187 void gen_subspecial(struct treenode *bnode, short e)
189 /* tritt z.b. bei snafu_05.0 auf */
190 printf("\t#gen_subspecial(%i)\n", e);
195 if(KIDKID_VAL(1,0) != 0) {
196 printf("\tsubf $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG);
199 printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
201 if(e) KIDKIDREG2PARM(1,1);
202 printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
205 void assign_var(struct treenode *bnode)
208 if (strcmp(bnode->kids[0]->kids[0]->name, bnode->kids[1]->name) != 0) {
210 printf("\tmov %%%s, %%%s\n", KIDKID_REG(0,0), KID_REG(1));
211 } /*else: x := x - 1 geht in einem befehl */
212 printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
215 void make_call(struct treenode *bnode)
218 printf("\t#params pushen\n");
219 for(j = 0; j < bnode->soffset; j++) {
220 printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
222 printf("\t#vars pushen\n");
223 for(j = VARBEGIN; j > VARBEGIN - bnode->vars; j--) {
224 printf("\tpushq %%%s\n", param_reg(j));
227 /* TODO: schoener machen... */
228 if(strcmp(BN_REG, "rax")!=0) {
229 printf("\t#tmp register pushen\n");
230 printf("\tpushq %%rax\n");
231 if(strcmp(BN_REG, "r10")!=0) {
232 printf("\tpushq %%r10\n");
235 printf("\tcall %s\n", bnode->name);
236 if(strcmp(BN_REG, "rax")!=0) {
238 if(strcmp(BN_REG, "r10")!=0) {
239 printf("\tpopq %%r10\n");
241 printf("\tpopq %%rax\n");
245 for(j = VARBEGIN+1 - bnode->vars; j < VARBEGIN+1; j++) {
246 printf("\tpopq %%%s\n", param_reg(j));
250 for(j = 0; j < bnode->soffset; j++) {
251 printf("\tpopq %%%s\n", param_reg(j));
255 void prep_arg(struct treenode *bnode, int moveit)
257 printf("\t#args-nr-> %i (%%%s) [moveit= %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
258 if(moveit) { /* expr */
259 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)) {
260 if(bnode->kids[1]->name != (char *) NULL && strcmp(bnode->kids[1]->name,"this")!=0) {
262 printf("\tpushq %%%s\n", KID_REG(1));
264 printf("\tpushq %%%s\n", param_reg(bnode->soffset));
267 printf("\tpushq %%%s\n", BN_REG);
269 } else { /* just O_ID */
271 printf("\tpushq %%%s\n", KID_REG(0));
275 void gen_sub_field(struct treenode *bnode)
277 /* siehe intelli_03.0 @ gesamt */
278 printf("\t#gen_sub_field\n");
280 if(!(strcmp(bnode->kids[0]->kids[0]->kids[0]->name, bnode->kids[1]->kids[0]->name) == 0 &&
281 bnode->kids[0]->kids[0]->soffset == bnode->kids[1]->soffset)) {
282 KIDKIDKIDREG2PARM(0,0,0);
283 printf("\tmov %d(%%%s), %%%s\n", bnode->kids[0]->kids[0]->soffset * 8, KIDKIDKID_REG(0,0,0), BN_REG);
284 printf("\tmov %%%s, %d(%%%s)\n", BN_REG, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
286 printf("\tsub $%d, %d(%%%s)\n", bnode->kids[0]->kids[1]->val, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
292 %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 O_EXPR=22
296 begin: ret # 0 # printf("\n");
302 assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(1));
303 assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq $%d, %%%s\n", KID_VAL(0), KID_REG(1));
304 assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmovq %%%s, %%%s\n", KID_REG(0), KID_REG(1));
306 assign: O_ASSIGN(O_SUB(O_ID,O_NUM), O_ID) # 1 # assign_var(bnode);
308 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));
309 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));
310 assign: O_ASSIGN(O_SUB(O_FIELD(O_ID), imm), O_FIELD(O_ID)) # 1 # gen_sub_field(bnode);
313 ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\ttest $-1, %%%s\n", KID_REG(0));
314 ifstat: O_IF(expr) # 2 # /* iburg beschummeln :/ */ printf("\ttest $-1, %%rax\n");
315 ifstat: O_IF(O_BOOL(expr)) # 1 # /* dann braucht man kein test */
318 ret: O_RET(retexpr) # 2 # printf("\t/*o_ret(expr)*/\n"); move(BN_REG, "3");
319 ret: O_EXPR(expr) # 0 #
321 retexpr: O_ID # 1 # printf("\t/*retexpr*/\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
326 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
327 expr: O_BOOL(expr) # 0 #
329 expr: O_CALL(expr) # 0 # make_call(bnode);
330 expr: O_ARG(expr,expr) # 1 # prep_arg(bnode, 1);
331 expr: O_ARG(O_ID,expr) # 1 # prep_arg(bnode, 0);
332 expr: O_NOTHING # 0 #
334 expr: O_SUB(expr,expr) # 2 # gen_e_eno(bnode, "subf");
335 expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subf");
336 expr: O_SUB(expr,imm) # 1 # gen_e_imm(bnode, "subf");
338 expr: O_SUB(expr,O_SUB(O_ID,expr)) # 2 # gen_subspecial(bnode, 0);
339 expr: O_SUB(expr,O_SUB(imm,expr)) # 2 # gen_subspecial(bnode, 1);
341 expr: O_SUB(expr, O_ADD(O_ID,expr)) # 1 # gen_id_eno(bnode);
343 expr: O_SUB(expr,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0);
344 expr: O_SUB(expr,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0);
345 expr: O_SUB(expr,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0);
346 expr: O_SUB(expr,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0);
348 expr: O_SUB(expr,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1);
349 expr: O_SUB(expr,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1);
350 expr: O_SUB(expr,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1);
351 expr: O_SUB(expr,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1);
354 expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
355 expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
356 expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "addq");
358 expr: O_ADD(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "addq");
361 expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq");
362 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
363 expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "imulq");
365 expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "imulq");
366 expr: O_MUL(O_FIELD(expr),imm) # 1 # gen_field_imm(bnode);
368 expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq");
369 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
370 expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "orq");
373 expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1, 0);
374 expr: O_LESS(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "l", 1, 1, 1);
375 expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0, 0);
376 expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "g", 0, 1, 0);
379 expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1, 0);
380 expr: O_EQ(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "e", 1, 1, 1);
381 expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
382 expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1, 0);
383 expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
385 expr: O_EQ(O_EQ(expr,O_NULL),O_NULL) # 3 # gen_eqless(bnode, "ne", 1, 0, 1);
386 expr: O_EQ(O_EQ(O_EQ(expr,O_NULL),O_NULL),O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 2);
389 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);
390 expr: O_FIELD(imm) # 1 # printf("\t/* field(imm)*/\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
393 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
394 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
395 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
396 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
397 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) == KID_VAL(1) ? 1 : 0;
398 imm: O_OR(imm,imm) # 0 # BN_VAL = KID_VAL(0) | KID_VAL(1);