%{
#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
#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)
{
	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)
{
	moveimm(KID_VAL(0), BN_REG);
	KIDREG2PARM(1);
	printf("\tsubq %%%s, %%%s\n", KID_REG(1), BN_REG);
}

%}

%start begin
%term O_RET=1 O_NOT=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

%%

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) # 3 # 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) # 2 # gen_e_imm(bnode, "imulq");

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


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

%%

/* vim: filetype=c
 */