#define DDCHELP
#endif
+#define REGLEN 9
+static char *regs64[] = {"rax", "r10", "r11", "r9", "r8", "rcx", "rdx", "rsi", "rdi"};
+static char *regs8l[] = {"al", "r10b", "r11b", "r9b", "r8b", "cl", "dl", "sil", "dil"};
+
void func_header(char *s)
{
printf("\t.globl %1$s\n\t.type %1$s, @function\n%1$s:\n", s);
char *next_reg(char *s, short skip, int params)
{
- /* TODO: bessere registerwahl. das is gerade a wengal suboptimal... */
-#define REGLEN 9
- char *regs[] = {"rax", "r10", "r11", "r9", "r8", "rcx", "rdx", "rsi", "rdi"};
-
- int i=0;
+ int i = 0;
if (s != (char*) NULL) {
while(i < REGLEN) {
- if(!strcmp(s, regs[i++])) {
+ if(!strcmp(s, regs64[i++])) {
break;
}
}
i++;
}
#ifdef DDCHELP
- fprintf(stderr, "next_reg(): %s (bei %i parameter)\n", regs[i], params);
+ fprintf(stderr, "next_reg(): %s (bei %i parameter)\n", regs64[i], params);
#endif
/* TODO: <= passt? */
if(REGLEN - params <= i) {
- fprintf(stderr, "next_reg(): register \"%s\" in dem sich ein parameter befindet wird als temporaeres register verwendet(params: %i, i: %i)\n", regs[i], params, i);
+ fprintf(stderr, "next_reg(): register \"%s\" in dem sich ein parameter befindet wird als temporaeres register verwendet(params: %i, i: %i)\n", regs64[i], params, i);
/* TODO: exit hier? */
#if 0
exit(4);
#endif
}
+ return regs64[i];
+}
- return regs[i];
+char *reg_64to8l(char *s)
+{
+ int i = 0;
+ if (s != (char*) NULL) {
+ while(i < REGLEN) {
+ if(!strcmp(s, regs64[i])) {
+ return regs8l[i];
+ } else {
+ i++;
+ }
+ }
+ }
+ fprintf(stderr, "reg_64to8l(): sollte nicht passieren\n");
+ exit(4);
}
+
char *param_reg(int num)
{
char *regs[] = {"rdi", "rsi", "rdx", "rcx", "r8", "r9"};
void gen_eqless_footer(struct treenode *bnode, char *op)
{
- moveimm(1, BN_REG);
- printf("\tcmov%s %%%2$s, %%%2$s\n", op, BN_REG);
- moveimm(0, KID_REG(1));
- printf("\tcmovn%s %%%s, %%%s\n", op, KID_REG(1), BN_REG);
+ printf("\tset%s %%%s\n", op, reg_64to8l(BN_REG));
+ printf("\tand $1, %%%s\n", BN_REG);
}
void gen_eqless_ee(struct treenode *bnode, char *op)