%{
#define BFEHAX

#define KID_REG(A) bnode->kids[A]->reg
#define KID_VAL(A) bnode->kids[A]->val
#define BN_REG bnode->reg
#define BN_VAL bnode->val

/* falls ein parameter auf der "leseseite" ist, soll das statt ein weiteres
 * register verwendet werden */
#define KIDREG2PARM(A) if(bnode->kids[A]->param_index > -1) { bnode->kids[A]->reg = param_reg(bnode->kids[A]->param_index); }

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

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

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

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

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

	if(e0 && e1) {
		printf("\tcmp %%%s, %%%s\n", KID_REG(1), KID_REG(0));
	} else if(e0 && !e1) {
		printf("\tcmp $%li, %%%s\n", KID_VAL(1), KID_REG(0));
	} else if(!e0 && e1) {
		if(strcmp("e", op) == 0) {
			printf("\tcmp $%li, %%%s\n", KID_VAL(0), KID_REG(1));
		} else {
			moveimm(KID_VAL(0), BN_REG);
			printf("\tcmp %%%s, %%%s\n", KID_REG(1), BN_REG);
		}
	}
	printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
	printf("\tand $1, %%%s\n", BN_REG);
}

%}

%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

%%

begin: ret # 0 # printf("\n");
ret: O_RET(expr) # 2 # move(BN_REG, "rax"); func_footer();

expr: O_ID # 1 # if(bnode->param_index > -1) move(param_reg(bnode->param_index), BN_REG);
expr: imm # 1 # moveimm(BN_VAL, BN_REG);

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

expr: O_ADD(expr,exprno) # 1 # gen_e_eno(bnode, "addq");
expr: O_ADD(imm,expr)    # 2 # gen_e_imm(bnode, "addq");

expr: O_MUL(expr,exprno) # 1 # gen_e_eno(bnode, "imulq");
expr: O_MUL(expr,imm)    # 1 # gen_e_imm(bnode, "imulq");
expr: O_MUL(imm,exprno)  # 1 # gen_imm_eno(bnode, "imulq");

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

expr: O_LESS(expr,expr) # 3 # gen_eqless(bnode, "l", 1, 1);
expr: O_LESS(expr,imm)  # 3 # gen_eqless(bnode, "l", 1, 0);
expr: O_LESS(imm,expr)  # 3 # gen_eqless(bnode, "l", 0, 1);

expr: O_EQ(exprno,exprno) # 3 # gen_eqless(bnode, "e", 1, 1);
expr: O_EQ(exprno,imm)    # 3 # gen_eqless(bnode, "e", 1, 0);
expr: O_EQ(imm,exprno)    # 3 # gen_eqless(bnode, "e", 0, 1);
expr: O_EQ(nexpr,O_NULL)  # 0 #
expr: O_EQ(exprno,O_NULL) # 3 # gen_eqless(bnode, "e", 1, 0);

expr: O_FIELD(exprno) # 1 # KIDREG2PARM(0); printf("\tmovq %li(%%%s), %%%s\n", bnode->soffset * 8, KID_REG(0), BN_REG);
expr: O_FIELD(imm) # 1 # printf("\tmovq %li, %%%s\n", KID_VAL(0) + (bnode->soffset * 8), BN_REG);


exprno: O_ID # 0 # /* brauchen wir nicht 'zwischenlagern', weil nur gelesen wird */
exprno: expr

nexpr: O_EQ(expr,O_NULL) # 0 #


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_NUM # 0 #

%%

/* vim: filetype=c
 */