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);
+ printf("\tmulli %s,%s,%d\n", BN_REG, KID_REG(0), KID_VAL(1));
}
} else {
if(strcmp(instr, "sub") == 0 && KID_VAL(1) == 0) {
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);
+ 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);
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);
%%
-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); printf("\tli %s,%d\n", KID_REG(1), KID_VAL(0));
+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);