%{
#define BFEHAX

/* macros zum registerzugriff bei kinder */
#define KID_REG(A) bnode->kids[A]->reg
#define KIDKID_REG(A,B) bnode->kids[A]->kids[B]->reg
#define KIDKIDKID_REG(A,B,C) bnode->kids[A]->kids[B]->kids[C]->reg

/* macros zum wertezugriff bei kindern */
#define KID_VAL(A) bnode->kids[A]->val
#define KIDKID_VAL(A,B) bnode->kids[A]->kids[B]->val
#define KIDKIDKID_VAL(A,B,C) bnode->kids[A]->kids[B]->kids[C]->val

/* macros zum zugriff des aktuellen knotens */
#define BN_REG bnode->reg
#define BN_VAL bnode->val

/* wenn sich ein parameter auf der "leseseite" (also links bei at&t syntax)
 * befindet, dann soll dieses register verwendet werden */
#define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }
#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); }
#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); }

/* wenn sich ein parameter auf der "schreibeseite" befindet (also rechts bei
 * at&t syntax), dann muss es vorher in ein temporaeres register gemovt werden */
#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);

#include <stdio.h>
#include <stdlib.h>
#include <assert.h>
#include "tree.h"
#include "chelper.h"

void gen_e_eno(struct treenode *bnode, char *instr)
{
	printf("\t//gen_e_eno(%s)\n", instr);
	KIDREG2ID(0);
	KIDREG2PARM(1);
	printf("\t%s %%%s, %%%s\n", instr, KID_REG(1), KID_REG(0));
}

void gen_id_eno(struct treenode *bnode)
{
	printf("\t//gen_id_eno\n");
	KIDKIDREG2PARM(1,0);
	KIDKIDREG2PARM(1,1);
	KIDREG2PARM(0);
	move(KID_REG(0), BN_REG);
	printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
	printf("\tsubq %%%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("\timulq $%d, %d(%%%s), %%%s\n", KID_VAL(1), bnode->kids[0]->soffset * 8, KIDKID_REG(0, 0), BN_REG);
}

void gen_e_imm(struct treenode *bnode, char *instr)
{
	printf("\t//gen_e_imm(%s)\n", instr);
	KIDREG2PARM(0);
	KIDREG2ID(1);
	/* man kann sich ein move der konstante bei der multiplikation ersparen */
	if(strcmp(instr, "imulq") == 0) {
		if(KID_VAL(1) == 1 && strcmp(KID_REG(0), BN_REG) == 0) {
			printf("\t//multiplikation mit 1 wegoptimiert\n");
		} else {
			printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(1), KID_REG(0), BN_REG);
		}
	} else {
		if(strcmp(instr, "subq") == 0 && KID_VAL(1) == 0) {
			printf("\t//subtraktion mit 0 wegoptimiert\n");
			move(KID_REG(0), BN_REG);
		} else {
			move(KID_REG(0), BN_REG);
			printf("\t%s $%d, %%%s\n", instr, KID_VAL(1), BN_REG);
		}
	}
}

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("\tsubq %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);
	KIDREG2ID(0);
	KIDREG2PARM(1);
	/* man kann sich ein move der konstante bei der multiplikation ersparen */
	if(strcmp(instr, "imulq") == 0) {
		if(KID_VAL(0) == 1 && strcmp(KID_REG(1), BN_REG) == 0) {
			printf("\t//multiplikation mit 1 wegoptimiert\n");
		} else {
			printf("\timulq $%d, %%%s, %%%s\n", KID_VAL(0), KID_REG(1), BN_REG);
		}
	} else { /* addq */
		printf("\taddq $%d, %%%s\n", KID_VAL(0), BN_REG);
	}
}

void gen_eqless(struct treenode *bnode, char *op, short e0, short e1, short deep)
{
	printf("\t//gen_eqless_%i%i @ %i\n", e0, e1, deep);
	if(e0) { KIDREG2PARM(0); } else { KIDREG2ID(0); }
	if(e1) { KIDREG2PARM(1); } else { KIDREG2ID(1); }

	if(e0 && e1) {
		if(deep) {
			KIDKIDREG2PARM(1,0);
			printf("\tcmp %d(%%%s), %%%s\n", bnode->kids[1]->soffset *8, KIDKID_REG(1,0), KID_REG(0));
		} else {
			printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
		}
	} else if(e0 && !e1) {
		if (deep == 0) {
			printf("\tcmp $%d, %%%s\n", KID_VAL(1), KID_REG(0));
		} else if (deep == 1) {
			KIDKIDREG2PARM(0,0);
			printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKID_REG(0,0));
		} else if (deep == 2) {
			KIDKIDKIDREG2PARM(0,0,0);
			printf("\tcmp $%d, %%%s\n", KID_VAL(1), KIDKIDKID_REG(0,0,0));
		}
	} else if(!e0 && e1) {
			printf("\tcmp $%d, %%%s\n", KID_VAL(0), KID_REG(1));
	}
	printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
	printf("\tand $1, %%%s\n", BN_REG);
}

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);
	}
}

void gen_subspecial(struct treenode *bnode, short e)
{
	/* tritt z.b. bei snafu_05.0 auf */
	printf("\t//gen_subspecial(%i)\n", e);
	KIDREG2ID(0);
	KIDKIDREG2PARM(1,0);

	if(e) {
		if(KIDKID_VAL(1,0) != 0) {
			printf("\tsubq $%d, %%%s\n", KIDKID_VAL(1,0), BN_REG);
		}
	} else {
		printf("\tsubq %%%s, %%%s\n", KIDKID_REG(1,0), BN_REG);
	}
	if(e) KIDKIDREG2PARM(1,1);
	printf("\taddq %%%s, %%%s\n", KIDKID_REG(1,1), BN_REG);
}

void assign_var(struct treenode *bnode)
{
	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));
	} /*else:  x := x - 1 geht in einem befehl */
	printf("\tsub $%d, %%%s\n", KIDKID_VAL(0,1), KID_REG(1));
}

void make_call(struct treenode *bnode, short skippop)
{
	short *sc = bnode->sc;
	int j, off = 0;
	printf("\t//params pushen (skippop: %d)\n", skippop);
	for(j = 0; j < bnode->soffset; j++) {
		if(sc[j] == 1)
			printf("\txchg %%%s, %d(%%rsp)\n", param_reg(j), (j - off)*8);
		else {
			if (sc[j] == 0) {
				printf("\tpushq %%%s\n", param_reg(j));
				off++;
			}
		}
	}
	printf("\t//vars pushen\n");
	for(j = bnode->soffset; j < bnode->soffset + bnode->vars; j++) {
		printf("\tpushq %%%s\n", param_reg(j));
	}

	/* TODO: schoener machen... */
	if(strcmp(BN_REG, "rax")!=0) {
		printf("\t//tmp register pushen\n");
		printf("\tpushq %%rax\n");
		if(strcmp(BN_REG, "r10")!=0) {
			printf("\tpushq %%r10\n");
		}
	}
	printf("\tcall %s\n", bnode->name);
	if(strcmp(BN_REG, "rax")!=0) {
		move("rax", BN_REG);
		if(skippop)
			goto cleanup;
		if(strcmp(BN_REG, "r10")!=0) {
			printf("\tpopq %%r10\n");
		}
		printf("\tpopq %%rax\n");
	}
	if(skippop)
		goto cleanup;

	printf("\t//vars poppen\n");
	for(j = bnode->soffset + bnode->vars - 1; j > bnode->soffset - 1; j--) {
		printf("\tpopq %%%s\n", param_reg(j));
	}

	printf("\t//params poppen (sc == 0)\n");
	for(j = bnode->soffset - 1; j >= 0; j--) {
		if(sc[j] == 0)
			printf("\tpopq %%%s\n", param_reg(j));
	}
	printf("\t//params poppen (sc != 0)\n");
	for(j = 0; j < bnode->soffset; j++) {
		if(sc[j] > 0)
			printf("\tpopq %%%s\n", param_reg(j));
	}

cleanup:
	/* 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)
{
	short *sc = bnode->sc;
	printf("\t//args-nr-> %i (%%%s) [moveit= %i]\n", bnode->soffset, param_reg(bnode->soffset), moveit);
	sc[bnode->soffset] = 1;
	if(moveit == 1) { /* expr */
		if((  bnode->kids[0] != TREENULL && bnode->kids[0]->op == O_NOTHING &&
		      bnode->kids[0] != TREENULL && bnode->kids[0]->op == O_NOTHING)) {
			printf("\tpushq %%%s\n", param_reg(bnode->soffset));
			sc[bnode->soffset] = 2;
		} else {
			printf("\tpushq %%%s\n", BN_REG);
		}
	} else if(moveit == 2) { /* O_ID right */
		KIDREG2PARM(1);
		printf("\tpushq %%%s\n", KID_REG(1));
	} else if(moveit == 0) { /* O_ID left */
		KIDREG2PARM(0);
		printf("\tpushq %%%s\n", KID_REG(0));
	}
}

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));
}

int was_already_in_bfe = 0;

%}

%start begin
%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

%%

begin: ret # 0 # printf("\n"); was_already_in_bfe = 1;
begin: assign # 0 # was_already_in_bfe = 1;
begin: ifstat # 0 # was_already_in_bfe = 1;
begin: expr # 0 # was_already_in_bfe = 1;
begin: O_RET(O_CALL(O_NOTHING, O_ARG(O_NOTHING, O_NOTHING))) # 1 # if(was_already_in_bfe == 0) { printf("\tjmp %s\n", bnode->kids[0]->name); } else { make_call(bnode->kids[0], 1); } was_already_in_bfe = 1;
begin: O_RET(O_CALL(expr,expr)) # 1 # make_call(bnode->kids[0], 1); was_already_in_bfe = 1;


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(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);


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_BOOL(expr)) # 1 # /* dann braucht man kein test */


ret: O_RET(retexpr) # 2 # printf("\t//o_ret(expr)\n"); move(BN_REG, "rax");
ret: O_EXPR(expr) # 0 #

retexpr: O_ID # 1 # printf("\t//retexpr\n"); if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
retexpr: expr


expr: O_ID # 0 #
expr: imm # 1 # moveimm(BN_VAL, BN_REG);
expr: O_BOOL(expr) # 0 #

expr: O_CALL(expr,expr) # 2 # make_call(bnode, 0);
expr: O_ARG(expr,expr) # 1 # prep_arg(bnode, 1);
expr: O_ARG(O_ID,expr) # 1 # prep_arg(bnode, 0);
expr: O_ARG(expr,O_ID) # 1 # prep_arg(bnode, 2);
expr: O_NOTHING # 0 #

expr: O_SUB(expr,expr)          # 2 # gen_e_eno(bnode, "subq");
expr: O_SUB(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "subq");
expr: O_SUB(expr,imm)           # 1 # gen_e_imm(bnode, "subq");

expr: O_SUB(expr,O_SUB(O_ID,expr)) # 2 # gen_subspecial(bnode, 0);
expr: O_SUB(expr,O_SUB(imm,expr))  # 2 # gen_subspecial(bnode, 1);

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_MUL(expr,expr)   # 1 # gen_e_eno(bnode, "imulq");
expr: O_MUL(expr,imm)    # 1 # gen_e_imm(bnode, "imulq");
expr: O_MUL(imm,expr)    # 1 # gen_imm_eno(bnode, "imulq");

expr: O_MUL(expr,O_FIELD(expr)) # 1 # gen_e_field(bnode, "imulq");
expr: O_MUL(O_FIELD(expr),imm)  # 1 # gen_field_imm(bnode);

expr: O_OR(expr,expr)          # 1 # gen_e_eno(bnode, "orq");
expr: O_OR(expr,imm)           # 2 # gen_e_imm(bnode, "orq");
expr: O_OR(expr,O_FIELD(expr)) # 2 # gen_e_field(bnode, "orq");


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(expr,O_NULL),O_NULL)  # 3 # gen_eqless(bnode, "ne", 1, 0, 1);
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);


imm: O_ADD(imm,imm)  # 0 # BN_VAL = KID_VAL(0) + KID_VAL(1);
imm: O_SUB(imm,imm)  # 0 # BN_VAL = KID_VAL(0) - KID_VAL(1);
imm: O_MUL(imm,imm)  # 0 # BN_VAL = KID_VAL(0) * KID_VAL(1);
imm: O_LESS(imm,imm) # 0 # BN_VAL = KID_VAL(0) < KID_VAL(1) ? 1 : 0;
imm: O_EQ(imm,imm)   # 0 # BN_VAL = KID_VAL(0) == KID_VAL(1) ? 1 : 0;
imm: O_OR(imm,imm)   # 0 # BN_VAL = KID_VAL(0) | KID_VAL(1);
imm: O_NUM # 0 #
imm: O_MONE # 0 #
imm: O_MTWO # 0 #
imm: O_MFOUR # 0 #
imm: O_MEIGHT # 0 #
imm: O_NULL # 0 #

%%

/* vim: filetype=c
 */