4 #define KID_REG(A) bnode->kids[A]->reg
5 #define KIDKID_REG(A,B) bnode->kids[A]->kids[B]->reg
6 #define KID_VAL(A) bnode->kids[A]->val
7 #define KIDKID_VAL(A,B) bnode->kids[A]->kids[B]->val
8 #define BN_REG bnode->reg
9 #define BN_VAL bnode->val
11 /* falls ein parameter auf der "leseseite" ist, soll das statt ein weiteres
12 * register verwendet werden */
13 #define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
14 #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); }
16 #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);
24 void gen_e_eno(struct treenode *bnode, char *instr)
26 printf("\t//gen_e_eno(%s)\n", instr);
29 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
32 void gen_e_imm(struct treenode *bnode, char *instr)
34 printf("\t//gen_e_imm(%s)\n", instr);
37 /* man kann sich ein move der konstante bei der multiplikation ersparen */
38 if(strcmp(instr, "imulq") == 0) {
39 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
41 printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), KID_REG(0));
42 move(KID_REG(0), BN_REG);
46 void gen_imm_eno(struct treenode *bnode, char *instr)
48 printf("\t//gen_imm_eno(%s)\n", instr);
51 /* man kann sich ein move der konstante bei der multiplikation ersparen */
52 if(strcmp(instr, "imulq") == 0) {
53 printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
54 } else if(strcmp(instr, "addq") == 0) {
55 printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
57 moveimm(KID_VAL(0), BN_REG);
58 printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), BN_REG);
62 void gen_eqless(struct treenode *bnode, char *op, short e0, short e1)
64 printf("\t//gen_eqless_%i%i\n", e0, e1);
65 if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
66 if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }
69 printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
70 } else if(e0 && !e1) {
71 printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
72 } else if(!e0 && e1) {
73 if(strcmp("e", op) == 0) {
74 printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
76 moveimm(KID_VAL(0), BN_REG);
77 printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG);
80 printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
81 printf("\tand $1, %%%s\n", BN_REG);
84 void gen_lea(struct treenode *bnode, short e)
86 printf("\t//gen_lea(e: %i)\n", e);
90 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG);
93 printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG);
100 %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
104 begin: ret # 0 # printf("\n");
105 ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax"); func_footer();
107 retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
111 expr: imm # 1 # moveimm(BN_VAL, BN_REG);
113 expr: O_SUB(expr,expr) # 1 # gen_e_eno(bnode, "subq");
114 expr: O_SUB(expr,imm) # 2 # gen_e_imm(bnode, "subq");
115 expr: O_SUB(imm,expr) # 2 # gen_imm_eno(bnode, "subq");
116 expr: O_SUB(O_ID,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0);
117 expr: O_SUB(O_ID,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0);
118 expr: O_SUB(O_ID,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0);
119 expr: O_SUB(O_ID,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0);
121 expr: O_SUB(O_ID,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1);
122 expr: O_SUB(O_ID,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1);
123 expr: O_SUB(O_ID,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1);
124 expr: O_SUB(O_ID,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1);
126 expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
127 expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
128 expr: O_ADD(imm,expr) # 2 # gen_imm_eno(bnode, "addq");
130 expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "imulq");
131 expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "imulq");
132 expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "imulq");
134 expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "orq");
135 expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "orq");
137 expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1);
138 expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0);
139 expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "l", 0, 1);
141 expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1);
142 expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0);
143 expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1);
144 expr: O_EQ(nexpr,O_NULL) # 0 #
145 expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0);
147 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);
148 expr: O_FIELD(imm) # 1 # printf("\t//field(imm)\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
151 nexpr: O_EQ(expr,O_NULL) # 0 # gen_eqless(bnode, "ne", 1, 0);
154 imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
155 imm: O_SUB(imm,imm) # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
156 imm: O_MUL(imm,imm) # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
157 imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
158 imm: O_EQ(imm,imm) # 0 # BN_VAL = KID_VAL(0) = KID_VAL(1) ? 1 : 0;