void gen_e_eno(struct treenode *bnode, char *instr)
{
printf("\t#gen_e_eno(%s)\n", instr);
-#if 0
- KIDREG2ID(0);
- KIDREG2PARM(1);
- printf("\t%s %s, %s\n", instr, KID_REG(1), KID_REG(0));
-#else
KIDREG2PARM(0);
KIDREG2PARM(1);
printf("\t%s %s,%s,%s\n", instr, BN_REG, KID_REG(0), KID_REG(1));
-#endif
}
void gen_id_eno(struct treenode *bnode)
KIDKIDREG2PARM(1,0);
KIDKIDREG2PARM(1,1);
KIDREG2PARM(0);
- move(KID_REG(0), BN_REG);
- printf("\tsub %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
- printf("\tsub %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
-}
-
-void gen_e_field(struct treenode *bnode, char *instr)
-{
- printf("\t#gen_e_field(%s)\n", instr);
- KIDREG2ID(0);
- KIDKIDREG2PARM(1,0);
- printf("\t%s %d(%%%s), %%%s\n", instr, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0), KID_REG(0));
-}
-void gen_field_imm(struct treenode *bnode)
-{
- printf("\t#gen_field_imm\n");
- KIDKIDREG2PARM(0,0);
- KIDREG2ID(1);
- printf("\tmullw $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
+ printf("\tsub %s,%s,%s\n", BN_REG, KID_REG(0), KIDKID_REG(1,1));
+ printf("\tsub %s,%s,%s\n", BN_REG, BN_REG, KIDKID_REG(1,0));
}
void gen_e_imm(struct treenode *bnode, char *instr)
if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
printf("\t#multiplikation mit 1 wegoptimiert\n");
} else {
- printf("\tmullw $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
+ if(KID_VAL(1) > (65536)-1 || KID_VAL(1) < -65536) {
+ moveimm(KID_VAL(1), next_reg(BN_REG,0));
+ printf("\tmullw %s,%s,%s\n", BN_REG, KID_REG(0), next_reg(BN_REG,0));
+ } else {
+ printf("\tmulli %s,%s,%d\n", BN_REG, KID_REG(0), KID_VAL(1));
+ }
}
} else {
if(strcmp(instr, "sub") == 0 && KID_VAL(1) == 0) {
printf("\t#subtraktion mit 0 wegoptimiert\n");
move(KID_REG(0), BN_REG);
} else {
-#if 0
- move(KID_REG(0), BN_REG);
- printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG);
-#else
- printf("\t%si %s,%s,%d\n", instr, BN_REG, KID_REG(0), KID_VAL(1));
-#endif
+ if(KID_VAL(1) > (65536)-1 || KID_VAL(1) < -65536) {
+ moveimm(KID_VAL(1), next_reg(BN_REG,0));
+ printf("\t%s %s,%s,%s\n", instr, BN_REG, KID_REG(0), next_reg(BN_REG,0));
+ } else {
+ printf("\t%si %s,%s,%d\n", instr, BN_REG, KID_REG(0), KID_VAL(1));
+ }
}
}
}
-void gen_imm_field(struct treenode *bnode)
-{
- printf("\t#gen_imm_field\n");
- KIDREG2ID(0);
- KIDKIDREG2PARM(1, 0);
-
- moveimm(KID_VAL(0), BN_REG);
- printf("\tsubf %d(%%%s), %%%s\n", bnode->kids[1]->soffset * 8, KIDKID_REG(1, 0), BN_REG);
-}
-
void gen_imm_eno(struct treenode *bnode, char *instr)
{
printf("\t#gen_imm_eno(%s)\n", instr);
if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
printf("\t#multiplikation mit 1 wegoptimiert\n");
} else {
- printf("\tmullw $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
+ if(KID_VAL(0) > (65536)-1 || KID_VAL(0) < -65536) {
+ moveimm(KID_VAL(0), next_reg(BN_REG,0));
+ printf("\tmullw %s,%s,%s\n", BN_REG, KID_REG(1), next_reg(BN_REG,0));
+ } else {
+ printf("\tmulli %s,%s,%d\n", BN_REG, KID_REG(1), KID_VAL(0));
+ }
}
} else { /* addq */
- printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
+ /* TODO: imm check einbauen */
+ printf("\taddi %s,%s,%d\n", BN_REG, KID_REG(1), KID_VAL(0));
}
}
printf("\tand $1, %%%s\n", BN_REG);
#else
if(e0) { KIDREG2PARM(0); } else { moveimm(KID_VAL(0), BN_REG); }
- if(e1) { KIDREG2PARM(1); } else { moveimm(KID_VAL(1), KID_REG(1)); }
- if(strcmp(op,"e")==0 && KID_VAL(1) == 0) {
+ if(e1) { KIDREG2PARM(1); }
+ if(strcmp(op,"e")==0 && bnode->kids[1]->op == O_NULL) {
/* not */
printf("\tcntlzw %s,%s\n", KID_REG(0), KID_REG(0));
printf("\tsrwi %s,%s,5\n", BN_REG, KID_REG(0));
- } else if(strcmp(op, "l")==0 || strcmp(op, "g")==0) {
- /* less */
- printf("\tcmpw 7,%s,%s\n", KID_REG(1), KID_REG(0));
- printf("\tmfcr %s\n", BN_REG);
- /* EQ, GT, LT */
- /* um (32-29)=3 nach rechts shiften und das LSB anschauen */
- printf("\trlwinm %s,%s,%i,31,31\n", BN_REG, BN_REG, strcmp(op,"l")==0 ? 30 : 30);
- }
-#endif
-}
-
-void gen_lea(struct treenode *bnode, short e)
-{
- printf("\t#gen_lea(e= %i)\n", e);
- KIDREG2PARM(0);
- if(e) {
- KIDKIDREG2PARM(1,0);
- printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,0), -1 * KIDKID_VAL(1,1), BN_REG);
} else {
- KIDKIDREG2PARM(1,1);
- printf("\tlea (%%%s,%%%s,%d), %%%s\n", KID_REG(0), KIDKID_REG(1,1), -1 * KIDKID_VAL(1,0), BN_REG);
+ if(!e1) {
+ moveimm(KID_VAL(1), KID_REG(1));
+ }
+ if(strcmp(op, "e")==0) {
+ /* eq */
+ printf("\txor %s,%s,%s\n", BN_REG, KID_REG(0), KID_REG(1));
+ printf("\tcntlzw %s,%s\n", BN_REG, BN_REG);
+ printf("\tsrwi %s,%s,5\n", BN_REG, BN_REG);
+ } else if(strcmp(op, "l")==0 || strcmp(op, "g")==0) {
+ /* less */
+ printf("\tcmpw 7,%s,%s\n", KID_REG(1), KID_REG(0));
+ printf("\tmfcr %s\n", BN_REG);
+ /* EQ, GT, LT */
+ /* um (32-29)=3 nach rechts shiften und das LSB anschauen */
+ printf("\trlwinm %s,%s,%i,31,31\n", BN_REG, BN_REG, strcmp(op,"l")==0 ? 30 : 30);
+ }
}
+ /* vergleich mit null und in CR0 speichern */
+ printf("\tcmpwi %s,0\n", BN_REG);
+#endif
}
void gen_subspecial(struct treenode *bnode, short e)
KIDREG2ID(0);
KIDKIDREG2PARM(1,0);
+ /* TODO: Loong@ codea_snafu_03.0 */
+
if(e) {
if(KIDKID_VAL(1,0) != 0) {
- printf("\tsubf $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG);
+ printf("\tsubi %s,%s,%d\n", BN_REG, BN_REG, KIDKID_VAL(1,0));
}
} else {
- printf("\tsubf %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
+ printf("\tsub %s,%s,%s\n", BN_REG, BN_REG, KIDKID_REG(1,0));
}
if(e) KIDKIDREG2PARM(1,1);
- printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
+ printf("\tadd %s,%s,%s\n", BN_REG, BN_REG, KIDKID_REG(1,1));
}
void assign_var(struct treenode *bnode)
{
+ printf("\t#assign_var\n");
KIDREG2PARM(1);
if (strcmp(bnode->kids[0]->kids[0]->name, bnode->kids[1]->name) != 0) {
KIDKIDREG2PARM(0,0);
- printf("\tmov %%%s, %%%s\n", KIDKID_REG(0,0), KID_REG(1));
+ printf("\tmr %s,%s\n", KID_REG(1), KIDKID_REG(0,0));
} /*else: x := x - 1 geht in einem befehl */
- printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
+ printf("\tsubi %s,%s,%d\n", KID_REG(1), KID_REG(1), KIDKID_VAL(0,1));
}
+/* ... dirty */
+static short sc[8] = {0};
void make_call(struct treenode *bnode)
{
int j;
printf("\t#params pushen\n");
for(j = 0; j < bnode->soffset; j++) {
- printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), j*8);
+ if(sc[j] == 1) {
+ printf("\tlwz 20,%d(1)\n", j*4);
+ printf("\tstw %s,%d(1)\n", param_reg(j), j*4);
+ printf("\tmr %s,20\n", param_reg(j));
+ } else if (sc[j] == 0) {
+ printf("\tstw %s,%d(1)\n", param_reg(j), j*4);
+ }
}
printf("\t#vars pushen\n");
- for(j = VARBEGIN; j > VARBEGIN - bnode->vars; j--) {
- printf("\tpushq %%%s\n", param_reg(j));
+ for(j = bnode->soffset; j < bnode->soffset + bnode->vars; j++) {
+ printf("\tstw %s,%d(1)\n", param_reg(j), j*4);
}
/* TODO: schoener machen... */
- if(strcmp(BN_REG, "rax")!=0) {
+ if(strcmp(BN_REG, "14")!=0) {
printf("\t#tmp register pushen\n");
- printf("\tpushq %%rax\n");
- if(strcmp(BN_REG, "r10")!=0) {
- printf("\tpushq %%r10\n");
+ printf("\tstw 14,52(1)\n");
+ if(strcmp(BN_REG, "15")!=0) {
+ printf("\tstw 15,56(1)\n");
+ if(strcmp(BN_REG, "16")!=0) {
+ printf("\tstw 16,60(1)\n");
+ }
}
}
- printf("\tcall %s\n", bnode->name);
- if(strcmp(BN_REG, "rax")!=0) {
- move("rax", BN_REG);
- if(strcmp(BN_REG, "r10")!=0) {
- printf("\tpopq %%r10\n");
+
+ printf("\tbl %s\n", bnode->name);
+ move("3", BN_REG);
+
+ if(strcmp(BN_REG, "14")!=0) {
+ printf("\t#tmp register poppen\n");
+ if(strcmp(BN_REG, "15")!=0) {
+ if(strcmp(BN_REG, "16")!=0) {
+ printf("\tlwz 16,60(1)\n");
+ }
+ printf("\tlwz 15,56(1)\n");
}
- printf("\tpopq %%rax\n");
+ printf("\tlwz 14,52(1)\n");
}
- /* vars poppen */
- for(j = VARBEGIN+1 - bnode->vars; j < VARBEGIN+1; j++) {
- printf("\tpopq %%%s\n", param_reg(j));
+ printf("\t#vars poppen\n");
+ for(j = bnode->soffset + bnode->vars - 1; j > bnode->soffset - 1; j--) {
+ printf("\tlwz %s,%d(1)\n", param_reg(j), j*4);
}
- /* params poppen */
+ printf("\t#params poppen\n");
+ for(j = bnode->soffset - 1; j >= 0; j--) {
+ if(sc[j] == 0)
+ printf("\tlwz %s,%d(1)\n", param_reg(j), j*4);
+ }
for(j = 0; j < bnode->soffset; j++) {
- printf("\tpopq %%%s\n", param_reg(j));
+ if(sc[j] > 0)
+ printf("\tlwz %s,%d(1)\n", param_reg(j), j*4);
}
+
+ /* clear stack control array */
+ for(j = 0; j < sizeof sc / sizeof sc[0]; j++)
+ sc[j] = 0;
}
void prep_arg(struct treenode *bnode, int moveit)
{
printf("\t#args-nr-> %i (%%%s) [moveit= %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
+ sc[bnode->soffset] = 1;
if(moveit) { /* expr */
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)) {
if(bnode->kids[1]->name != (char *) NULL && strcmp(bnode->kids[1]->name,"this")!=0) {
KIDREG2PARM(1);
- printf("\tpushq %%%s\n", KID_REG(1));
+ printf("\tstw %s,%d(1)\n", KID_REG(1),bnode->soffset*4);
} else {
- printf("\tpushq %%%s\n", param_reg(bnode->soffset));
+ printf("\tstw %s,%d(1)\n", param_reg(bnode->soffset), bnode->soffset*4);
+ sc[bnode->soffset] = 2;
}
} else {
- printf("\tpushq %%%s\n", BN_REG);
+ printf("\tstw %s,%d(1)\n", BN_REG, bnode->soffset*4);
}
} else { /* just O_ID */
KIDREG2PARM(0);
- printf("\tpushq %%%s\n", KID_REG(0));
+ printf("\tstw %s,%d(1)\n", KID_REG(0), bnode->soffset*4);
}
}
-void gen_sub_field(struct treenode *bnode)
-{
- /* siehe intelli_03.0 @ gesamt */
- printf("\t#gen_sub_field\n");
- KIDKIDREG2PARM(1,0);
- if(!(strcmp(bnode->kids[0]->kids[0]->kids[0]->name, bnode->kids[1]->kids[0]->name) == 0 &&
- bnode->kids[0]->kids[0]->soffset == bnode->kids[1]->soffset)) {
- KIDKIDKIDREG2PARM(0,0,0);
- printf("\tmov %d(%%%s), %%%s\n", bnode->kids[0]->kids[0]->soffset * 8, KIDKIDKID_REG(0,0,0), BN_REG);
- printf("\tmov %%%s, %d(%%%s)\n", BN_REG, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
- }
- printf("\tsub $%d, %d(%%%s)\n", bnode->kids[0]->kids[1]->val, bnode->kids[1]->soffset * 8, KIDKID_REG(1,0));
-}
-
%}
%start begin
%%
-begin: ret # 0 # printf("\n");
+begin: ret # 0 #
begin: assign # 0 #
begin: ifstat # 0 #
begin: args # 0 #
-assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq %%%s, %%%s\n", BN_REG, KID_REG(1));
-assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); printf("\tmovq $%d, %%%s\n", KID_VAL(0), KID_REG(1));
-assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmovq %%%s, %%%s\n", KID_REG(0), KID_REG(1));
+assign: O_ASSIGN(expr, O_ID) # 1 # KIDREG2PARM(1); printf("\tmr %s,%s\n", KID_REG(1), BN_REG);
+assign: O_ASSIGN(imm, O_ID) # 1 # KIDREG2PARM(1); moveimm(KID_VAL(0), KID_REG(1));
+assign: O_ASSIGN(O_ID, O_ID) # 1 # KIDREG2PARM(1); KIDREG2PARM(0); printf("\tmr %s,%s\n", KID_REG(1), KID_REG(0));
assign: O_ASSIGN(O_SUB(O_ID,O_NUM), O_ID) # 1 # assign_var(bnode);
-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));
-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));
-assign: O_ASSIGN(O_SUB(O_FIELD(O_ID), imm), O_FIELD(O_ID)) # 1 # gen_sub_field(bnode);
+assign: O_ASSIGN(expr, O_FIELD(expr)) # 1 # KIDKIDREG2PARM(1,0); printf("\tstw %s,%d(%s)\n", BN_REG, bnode->kids[1]->soffset * 4, KIDKID_REG(1,0));
+assign: O_ASSIGN(O_ID, O_FIELD(expr)) # 1 # KIDREG2PARM(0); KIDKIDREG2PARM(1,0); printf("\tstw %s,%d(%s)\n", KID_REG(0), bnode->kids[1]->soffset * 4, KIDKID_REG(1,0));
-ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\ttest $-1, %%%s\n", KID_REG(0));
-ifstat: O_IF(expr) # 2 # /* iburg beschummeln :/ */ printf("\ttest $-1, %%rax\n");
+ifstat: O_IF(O_ID) # 1 # /* fuer faelle wie "if bla then" noetig */ KIDREG2PARM(0); printf("\tcmpwi %s,0\n", KID_REG(0));
+ifstat: O_IF(O_BOOL(imm)) # 1 # printf("\tcmpwi %s,0\n", BN_REG);
+ifstat: O_IF(expr) # 2 # /* iburg beschummeln :/ */ printf("\tcmpwi %s,0\n", BN_REG);
ifstat: O_IF(O_BOOL(expr)) # 1 # /* dann braucht man kein test */
expr: O_NOTHING # 0 #
expr: O_SUB(expr,expr) # 2 # gen_e_eno(bnode, "sub");
-expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "sub");
expr: O_SUB(expr,imm) # 1 # gen_e_imm(bnode, "sub");
expr: O_SUB(expr,O_SUB(O_ID,expr)) # 2 # gen_subspecial(bnode, 0);
expr: O_SUB(expr, O_ADD(O_ID,expr)) # 1 # gen_id_eno(bnode);
-expr: O_SUB(expr,O_MUL(O_MONE,expr)) # 1 # gen_lea(bnode,0);
-expr: O_SUB(expr,O_MUL(O_MTWO,expr)) # 1 # gen_lea(bnode,0);
-expr: O_SUB(expr,O_MUL(O_MFOUR,expr)) # 1 # gen_lea(bnode,0);
-expr: O_SUB(expr,O_MUL(O_MEIGHT,expr)) # 1 # gen_lea(bnode,0);
-
-expr: O_SUB(expr,O_MUL(expr,O_MONE)) # 1 # gen_lea(bnode,1);
-expr: O_SUB(expr,O_MUL(expr,O_MTWO)) # 1 # gen_lea(bnode,1);
-expr: O_SUB(expr,O_MUL(expr,O_MFOUR)) # 1 # gen_lea(bnode,1);
-expr: O_SUB(expr,O_MUL(expr,O_MEIGHT)) # 1 # gen_lea(bnode,1);
-
-
-expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "addq");
-expr: O_ADD(expr,imm) # 2 # gen_e_imm(bnode, "addq");
-expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "addq");
-expr: O_ADD(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "addq");
+expr: O_ADD(expr,expr) # 1 # gen_e_eno(bnode, "add");
+expr: O_ADD(expr,imm) # 1 # gen_e_imm(bnode, "add");
+expr: O_ADD(imm,expr) # 1 # gen_imm_eno(bnode, "add");
expr: O_MUL(expr,expr) # 1 # gen_e_eno(bnode, "mullw");
expr: O_MUL(expr,imm) # 1 # gen_e_imm(bnode, "mullw");
expr: O_MUL(imm,expr) # 1 # gen_imm_eno(bnode, "mullw");
-expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "mullw");
-expr: O_MUL(O_FIELD(expr),imm) # 1 # gen_field_imm(bnode);
expr: O_OR(expr,expr) # 1 # gen_e_eno(bnode, "or");
expr: O_OR(expr,imm) # 2 # gen_e_imm(bnode, "or");
-expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "or");
expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1, 0);
-expr: O_LESS(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "l", 1, 1, 1);
expr: O_LESS(expr,imm) # 3 # gen_eqless(bnode, "l", 1, 0, 0);
expr: O_LESS(imm,expr) # 3 # gen_eqless(bnode, "g", 0, 1, 0);
expr: O_EQ(expr,expr) # 3 # gen_eqless(bnode, "e", 1, 1, 0);
-expr: O_EQ(expr,O_FIELD(expr)) # 3 # gen_eqless(bnode, "e", 1, 1, 1);
expr: O_EQ(expr,imm) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
expr: O_EQ(imm,expr) # 3 # gen_eqless(bnode, "e", 0, 1, 0);
expr: O_EQ(expr,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 0);
expr: O_EQ(O_EQ(O_EQ(expr,O_NULL),O_NULL),O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0, 2);
-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);
-expr: O_FIELD(imm) # 1 # printf("\t/* field(imm)*/\n"); printf("\tmovq %d, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);
+expr: O_FIELD(expr) # 1 # printf("\t/* field(expr)*/\n"); KIDREG2PARM(0); printf("\tlwz %s, %d(%s)\n", BN_REG, bnode->soffset * 4, KID_REG(0));
+expr: O_FIELD(imm) # 1 # printf("\t/* field(imm)*/\n"); moveimm(KID_VAL(0), BN_REG); printf("\tlwz %s,%d(%s)\n", BN_REG, bnode->soffset * 4, BN_REG);
imm: O_ADD(imm,imm) # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
projects / uebersetzerbau-ss10.git / blobdiff