exit(1); \
} while (0)
-enum op_class {
- OPC_UNSPEC,
- OPC_RMD, /* removed or optimized out */
- OPC_DATA, /* data processing */
- OPC_DATA_FLAGS, /* data processing + sets flags */
- OPC_JMP, /* .. and call */
- OPC_JCC,
+enum op_flags {
+ OPF_RMD = (1 << 0), /* removed or optimized out */
+ OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
+ OPF_FLAGS = (1 << 2), /* sets flags */
+ OPF_JMP = (1 << 3), /* branches, ret and call */
+ OPF_CC = (1 << 4), /* uses flags */
};
enum op_op {
OP_PUSH,
OP_POP,
OP_MOV,
+ OP_LEA,
+ OP_MOVZX,
+ OP_MOVSX,
+ OP_NOT,
+ OP_CDQ,
OP_RET,
OP_ADD,
+ OP_SUB,
+ OP_AND,
+ OP_OR,
+ OP_XOR,
+ OP_SHL,
+ OP_SHR,
+ OP_SAR,
+ OP_ADC,
+ OP_SBB,
+ OP_INC,
+ OP_DEC,
+ OP_NEG,
+ OP_MUL,
+ OP_IMUL,
+ OP_DIV,
+ OP_IDIV,
OP_TEST,
OP_CMP,
OP_CALL,
OPT_REG,
OPT_REGMEM,
OPT_LABEL,
+ OPT_OFFSET,
OPT_CONST,
};
enum opr_lenmod {
- OPRM_UNSPEC,
- OPRM_BYTE,
- OPRM_WORD,
- OPRM_DWORD,
+ OPLM_UNSPEC,
+ OPLM_BYTE,
+ OPLM_WORD,
+ OPLM_DWORD,
};
-#define MAX_OPERANDS 2
+#define MAX_OPERANDS 3
struct parsed_opr {
- enum opr_type type;
- enum opr_lenmod lmod;
- unsigned int val;
- char name[256];
+ enum opr_type type;
+ enum opr_lenmod lmod;
+ int reg;
+ unsigned int val;
+ char name[256];
};
struct parsed_op {
- enum op_class cls;
- enum op_op op;
- struct parsed_opr operand[MAX_OPERANDS];
- int operand_cnt;
+ enum op_op op;
+ struct parsed_opr operand[MAX_OPERANDS];
+ unsigned int flags;
+ int operand_cnt;
+ int regmask_src; // all referensed regs
+ int regmask_dst;
+ int pfomask; // parsed_flag_op that can't be delayed
+ void *datap;
+};
+
+// datap:
+// OP_PUSH - arg number if arg is altered before call
+// OP_CALL - ptr to parsed_proto
+// (OPF_CC) - point to corresponding (OPF_FLAGS)
+
+struct parsed_equ {
+ char name[64];
+ enum opr_lenmod lmod;
+ int offset;
};
#define MAX_OPS 1024
static struct parsed_op ops[MAX_OPS];
-static char labels[MAX_OPS][32];
+static struct parsed_equ *g_eqs;
+static int g_eqcnt;
+static char g_labels[MAX_OPS][32];
+static struct parsed_proto g_func_pp;
+static char g_func[256];
+static char g_comment[256];
+static int g_bp_frame;
+static int g_bp_stack;
+#define ferr(op_, fmt, ...) do { \
+ printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
+ dump_op(op_), ##__VA_ARGS__); \
+ exit(1); \
+} while (0)
+
+#define MAX_REGS 8
+
+const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
+const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
+const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
+const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
+
+enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
+
+// possible basic comparison types (without inversion)
+enum parsed_flag_op {
+ PFO_O, // 0 OF=1
+ PFO_C, // 2 CF=1
+ PFO_Z, // 4 ZF=1
+ PFO_BE, // 6 CF=1||ZF=1
+ PFO_S, // 8 SF=1
+ PFO_P, // a PF=1
+ PFO_L, // c SF!=OF
+ PFO_LE, // e ZF=1||SF!=OF
+};
+
+static const char *parsed_flag_op_names[] = {
+ "o", "c", "z", "be", "s", "p", "l", "le"
+};
+
+static int char_array_i(const char *array[], size_t len, const char *s)
+{
+ int i;
+
+ for (i = 0; i < len; i++)
+ if (IS(s, array[i]))
+ return i;
+
+ return -1;
+}
+
+static void printf_number(char *buf, size_t buf_size, long number)
+{
+ // output in C-friendly form
+ snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
+}
+
+static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
+{
+ int reg;
+
+ reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
+ if (reg >= 0) {
+ *reg_lmod = OPLM_DWORD;
+ return reg;
+ }
+ reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
+ if (reg >= 0) {
+ *reg_lmod = OPLM_WORD;
+ return reg;
+ }
+ reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
+ if (reg >= 0) {
+ *reg_lmod = OPLM_BYTE;
+ return reg;
+ }
+ reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
+ if (reg >= 0) {
+ *reg_lmod = OPLM_BYTE;
+ return reg;
+ }
+
+ return -1;
+}
+
+static long parse_number(const char *number)
+{
+ int len = strlen(number);
+ const char *p = number;
+ char *endp = NULL;
+ int neg = 0;
+ int bad;
+ long ret;
+
+ if (*p == '-') {
+ neg = 1;
+ p++;
+ }
+ if (len > 1 && *p == '0')
+ p++;
+ if (number[len - 1] == 'h') {
+ ret = strtol(p, &endp, 16);
+ bad = (*endp != 'h');
+ }
+ else {
+ ret = strtol(p, &endp, 10);
+ bad = (*endp != 0);
+ }
+ if (bad)
+ aerr("number parsing failed\n");
+ if (neg)
+ ret = -ret;
+ return ret;
+}
+
+static int parse_indmode(char *name, int *regmask, int need_c_cvt)
+{
+ enum opr_lenmod lmod;
+ char cvtbuf[256];
+ char *d = cvtbuf;
+ char *s = name;
+ char w[64];
+ long number;
+ int reg;
+ int c = 0;
+
+ *d = 0;
+
+ while (*s != 0) {
+ d += strlen(d);
+ while (my_isblank(*s))
+ s++;
+ for (; my_issep(*s); d++, s++)
+ *d = *s;
+ while (my_isblank(*s))
+ s++;
+ *d = 0;
+
+ s = next_idt(w, sizeof(w), s);
+ if (w[0] == 0)
+ break;
+ c++;
+
+ reg = parse_reg(&lmod, w);
+ if (reg >= 0) {
+ *regmask |= 1 << reg;
+ goto pass;
+ }
+
+ if ('0' <= w[0] && w[0] <= '9') {
+ number = parse_number(w);
+ printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
+ continue;
+ }
+
+ // probably some label/identifier - pass
-const char *main_regs[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
+pass:
+ snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
+ }
+
+ if (need_c_cvt)
+ strcpy(name, cvtbuf);
+
+ return c;
+}
+
+static int guess_lmod_from_name(struct parsed_opr *opr)
+{
+ if (!strncmp(opr->name, "dword_", 6)) {
+ opr->lmod = OPLM_DWORD;
+ return 1;
+ }
+ if (!strncmp(opr->name, "word_", 5)) {
+ opr->lmod = OPLM_WORD;
+ return 1;
+ }
+ if (!strncmp(opr->name, "byte_", 5)) {
+ opr->lmod = OPLM_BYTE;
+ return 1;
+ }
+ return 0;
+}
+
+static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
+ int *regmask)
+{
+ opr->type = OPT_REG;
+ opr->reg = reg;
+ opr->lmod = lmod;
+ *regmask |= 1 << reg;
+}
static int parse_operand(struct parsed_opr *opr,
- char words[16][256], int wordc, int w, enum op_class cls)
+ int *regmask, int *regmask_indirect,
+ char words[16][256], int wordc, int w, unsigned int op_flags)
{
- char *endp = NULL;
- int ret, len;
- int i;
+ enum opr_lenmod tmplmod;
+ int ret, len;
+ long number;
+ int i;
if (w >= wordc)
aerr("parse_operand w %d, wordc %d\n", w, wordc);
+ opr->reg = xUNSPEC;
+
for (i = w; i < wordc; i++) {
len = strlen(words[i]);
if (words[i][len - 1] == ',') {
}
}
- if (cls == OPC_JMP || cls == OPC_JCC) {
+ if (op_flags & OPF_JMP) {
const char *label;
if (wordc - w == 3 && IS(words[w + 1], "ptr"))
if (wordc - w >= 3) {
if (IS(words[w + 1], "ptr")) {
if (IS(words[w], "dword"))
- opr->lmod = OPRM_DWORD;
+ opr->lmod = OPLM_DWORD;
else if (IS(words[w], "word"))
- opr->lmod = OPRM_WORD;
+ opr->lmod = OPLM_WORD;
else if (IS(words[w], "byte"))
- opr->lmod = OPRM_BYTE;
+ opr->lmod = OPLM_BYTE;
else
aerr("type parsing failed\n");
w += 2;
}
if (wordc - w == 2 && IS(words[w], "offset")) {
- opr->type = OPT_LABEL;
+ opr->type = OPT_OFFSET;
strcpy(opr->name, words[w + 1]);
return wordc;
}
- if (wordc - w != 1)
- aerr("parse_operand 1 word expected\n");
+ if (wordc - w != 1)
+ aerr("parse_operand 1 word expected\n");
- len = strlen(words[w]);
+ strcpy(opr->name, words[w]);
- if (words[w][0] == '[') {
- opr->type = OPT_REGMEM;
- ret = sscanf(words[w], "[%256s]", opr->name);
- if (ret != 1)
- aerr("[] parse failure\n");
- return wordc;
- }
- else if (('0' <= words[w][0] && words[w][0] <= '9')
- || words[w][0] == '-')
- {
- opr->type = OPT_CONST;
- i = 0;
- if (len > 1 && words[w][0] == '0')
- i = 1;
- if (words[w][len - 1] == 'h') {
- words[w][len - 1] = 0;
- opr->val = strtoul(&words[w][i], &endp, 16);
- }
- else {
- opr->val = strtoul(&words[w][i], &endp, 10);
- }
- if (*endp != 0)
- aerr("const parse failed\n");
- return wordc;
- }
+ if (words[w][0] == '[') {
+ opr->type = OPT_REGMEM;
+ ret = sscanf(words[w], "[%[^]]]", opr->name);
+ if (ret != 1)
+ aerr("[] parse failure\n");
+ // only need the regmask
+ parse_indmode(opr->name, regmask_indirect, 1);
+ return wordc;
+ }
+ else if (strchr(words[w], '[')) {
+ // label[reg] form
+ opr->type = OPT_REGMEM;
+ if (opr->lmod == OPLM_UNSPEC)
+ guess_lmod_from_name(opr);
+ parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
+ return wordc;
+ }
+ else if (('0' <= words[w][0] && words[w][0] <= '9')
+ || words[w][0] == '-')
+ {
+ number = parse_number(words[w]);
+ opr->type = OPT_CONST;
+ opr->val = number;
+ printf_number(opr->name, sizeof(opr->name), number);
+ return wordc;
+ }
+
+ ret = parse_reg(&tmplmod, opr->name);
+ if (ret >= 0) {
+ setup_reg_opr(opr, ret, tmplmod, regmask);
+ return wordc;
+ }
- strcpy(opr->name, words[w]);
- opr->type = OPT_REG;
- return wordc;
+ // most likely var in data segment
+ opr->type = OPT_LABEL;
+ if (opr->lmod == OPLM_UNSPEC)
+ guess_lmod_from_name(opr);
+ if (opr->lmod != OPLM_UNSPEC)
+ return wordc;
+
+ // TODO: scan data seg to determine type?
+ return wordc;
}
static const struct {
- const char *name;
- enum op_op op;
- enum op_class cls;
- int minopr;
- int maxopr;
+ const char *name;
+ enum op_op op;
+ unsigned int minopr;
+ unsigned int maxopr;
+ unsigned int flags;
} op_table[] = {
- { "push", OP_PUSH, OPC_DATA, 1, 1 },
- { "pop", OP_POP, OPC_DATA, 1, 1 },
- { "mov" , OP_MOV, OPC_DATA, 2, 2 },
- { "add", OP_ADD, OPC_DATA_FLAGS, 2, 2 },
- { "test", OP_TEST, OPC_DATA_FLAGS, 2, 2 },
- { "cmp", OP_CMP, OPC_DATA_FLAGS, 2, 2 },
- { "retn", OP_RET, OPC_JMP, 0, 1 },
- { "call", OP_CALL, OPC_JMP, 1, 1 },
- { "jmp", OP_JMP, OPC_JMP, 1, 1 },
- { "jo", OP_JO, OPC_JCC, 1, 1 }, // 70 OF=1
- { "jno", OP_JNO, OPC_JCC, 1, 1 }, // 71 OF=0
- { "jc", OP_JC, OPC_JCC, 1, 1 }, // 72 CF=1
- { "jb", OP_JC, OPC_JCC, 1, 1 }, // 72
- { "jnc", OP_JNC, OPC_JCC, 1, 1 }, // 73 CF=0
- { "jae", OP_JNC, OPC_JCC, 1, 1 }, // 73
- { "jz", OP_JZ, OPC_JCC, 1, 1 }, // 74 ZF=1
- { "je", OP_JZ, OPC_JCC, 1, 1 }, // 74
- { "jnz", OP_JNZ, OPC_JCC, 1, 1 }, // 75 ZF=0
- { "jne", OP_JNZ, OPC_JCC, 1, 1 }, // 75
- { "jbe", OP_JBE, OPC_JCC, 1, 1 }, // 76 CF=1 || ZF=1
- { "jna", OP_JBE, OPC_JCC, 1, 1 }, // 76
- { "ja", OP_JA, OPC_JCC, 1, 1 }, // 77 CF=0 && ZF=0
- { "jnbe", OP_JA, OPC_JCC, 1, 1 }, // 77
- { "js", OP_JS, OPC_JCC, 1, 1 }, // 78 SF=1
- { "jns", OP_JNS, OPC_JCC, 1, 1 }, // 79 SF=0
- { "jp", OP_JP, OPC_JCC, 1, 1 }, // 7a PF=1
- { "jpe", OP_JP, OPC_JCC, 1, 1 }, // 7a
- { "jnp", OP_JNP, OPC_JCC, 1, 1 }, // 7b PF=0
- { "jpo", OP_JNP, OPC_JCC, 1, 1 }, // 7b
- { "jl", OP_JL, OPC_JCC, 1, 1 }, // 7c SF!=OF
- { "jnge", OP_JL, OPC_JCC, 1, 1 }, // 7c
- { "jge", OP_JGE, OPC_JCC, 1, 1 }, // 7d SF=OF
- { "jnl", OP_JGE, OPC_JCC, 1, 1 }, // 7d
- { "jle", OP_JLE, OPC_JCC, 1, 1 }, // 7e ZF=1 || SF!=OF
- { "jng", OP_JLE, OPC_JCC, 1, 1 }, // 7e
- { "jg", OP_JG, OPC_JCC, 1, 1 }, // 7f ZF=0 && SF=OF
- { "jnle", OP_JG, OPC_JCC, 1, 1 }, // 7f
+ { "push", OP_PUSH, 1, 1, 0 },
+ { "pop", OP_POP, 1, 1, OPF_DATA },
+ { "mov" , OP_MOV, 2, 2, OPF_DATA },
+ { "lea", OP_LEA, 2, 2, OPF_DATA },
+ { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
+ { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
+ { "not", OP_NOT, 1, 1, OPF_DATA },
+ { "cdq", OP_CDQ, 0, 0, OPF_DATA },
+ { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
+ { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
+ { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
+ { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
+ { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
+ { "test", OP_TEST, 2, 2, OPF_FLAGS },
+ { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
+ { "retn", OP_RET, 0, 1, OPF_JMP },
+ { "call", OP_CALL, 1, 1, OPF_JMP },
+ { "jmp", OP_JMP, 1, 1, OPF_JMP },
+ { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
+ { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
+ { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
+ { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
+ { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
+ { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
+ { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
+ { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
+ { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
+ { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
+ { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
+ { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
+ { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
+ { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
+ { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
+ { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
+ { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
+ { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
+ { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
+ { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
+ { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
+ { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
+ { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
+ { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
+ { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
+ { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
+ { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
+ { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
+ { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
+ { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
+ { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
+ { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
+ { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
+ { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
+ { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
+ { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
+ { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
+ { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
+ { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
+ { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
+ { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
+ { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
+ { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
+ { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
+ { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
+ { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
+ { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
+ { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
+ { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
+ { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
+ { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
+ { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
+ { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
+ { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
+ { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
+ { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
};
static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
{
- int w = 1;
- int opr;
- int i;
+ int regmask_ind;
+ int regmask;
+ int opr = 0;
+ int w = 1;
+ int i;
- for (i = 0; i < ARRAY_SIZE(op_table); i++) {
- if (!IS(words[0], op_table[i].name))
- continue;
+ for (i = 0; i < ARRAY_SIZE(op_table); i++) {
+ if (IS(words[0], op_table[i].name))
+ break;
+ }
- for (opr = 0; opr < op_table[i].minopr; opr++) {
- w = parse_operand(&op->operand[opr],
- words, wordc, w, op_table[i].cls);
- }
+ if (i == ARRAY_SIZE(op_table))
+ aerr("unhandled op: '%s'\n", words[0]);
- for (; w < wordc && opr < op_table[i].maxopr; opr++) {
- w = parse_operand(&op->operand[opr],
- words, wordc, w, op_table[i].cls);
- }
+ op->op = op_table[i].op;
+ op->flags = op_table[i].flags;
+ op->regmask_src = op->regmask_dst = 0;
- goto done;
- }
+ for (opr = 0; opr < op_table[i].minopr; opr++) {
+ regmask = regmask_ind = 0;
+ w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
+ words, wordc, w, op->flags);
+
+ if (opr == 0 && (op->flags & OPF_DATA))
+ op->regmask_dst = regmask;
+ // for now, mark dst as src too
+ op->regmask_src |= regmask | regmask_ind;
+ }
+
+ for (; w < wordc && opr < op_table[i].maxopr; opr++) {
+ w = parse_operand(&op->operand[opr],
+ &op->regmask_src, &op->regmask_src,
+ words, wordc, w, op->flags);
+ }
+
+ if (w < wordc)
+ aerr("parse_op %s incomplete: %d/%d\n",
+ words[0], w, wordc);
+
+ // special cases
+ op->operand_cnt = opr;
+ if (!strncmp(op_table[i].name, "set", 3))
+ op->operand[0].lmod = OPLM_BYTE;
+
+ // ops with implicit argumets
+ switch (op->op) {
+ case OP_CDQ:
+ op->operand_cnt = 2;
+ setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
+ setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
+ break;
- aerr("unhandled op: '%s'\n", words[0]);
+ case OP_IMUL:
+ if (op->operand_cnt != 1)
+ break;
+ // fallthrough
+ case OP_MUL:
+ // singleop mul
+ op->regmask_dst = (1 << xDX) | (1 << xAX);
+ op->regmask_src |= (1 << xAX);
+ if (op->operand[0].lmod == OPLM_UNSPEC)
+ op->operand[0].lmod = OPLM_DWORD;
+ break;
-done:
- if (w < wordc)
- aerr("parse_op %s incomplete: %d/%d\n",
- words[0], w, wordc);
+ case OP_DIV:
+ case OP_IDIV:
+ // we could set up operands for edx:eax, but there is no real need to
+ // (see is_opr_modified())
+ regmask = (1 << xDX) | (1 << xAX);
+ op->regmask_dst = regmask;
+ op->regmask_src |= regmask;
+ if (op->operand[0].lmod == OPLM_UNSPEC)
+ op->operand[0].lmod = OPLM_DWORD;
+ break;
- op->cls = op_table[i].cls;
- op->op = op_table[i].op;
- return;
+ case OP_SHL:
+ case OP_SHR:
+ case OP_SAR:
+ if (op->operand[1].lmod == OPLM_UNSPEC)
+ op->operand[1].lmod = OPLM_BYTE;
+ break;
+
+ default:
+ break;
+ }
}
-int gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
+static const char *op_name(enum op_op op)
{
- struct parsed_proto pp;
- int ret;
- int i;
+ int i;
- ret = proto_parse(fhdr, funcn, &pp);
- if (ret)
- return ret;
+ for (i = 0; i < ARRAY_SIZE(op_table); i++)
+ if (op_table[i].op == op)
+ return op_table[i].name;
- fprintf(fout, "%s %s(", pp.ret_type, funcn);
- for (i = 0; i < pp.argc; i++) {
- if (i > 0)
- fprintf(fout, ", ");
- fprintf(fout, "%s a%d", pp.arg[i].type, i);
- }
- fprintf(fout, ")\n{\n");
+ return "???";
+}
+
+// debug
+static const char *dump_op(struct parsed_op *po)
+{
+ static char out[128];
+ char *p = out;
+ int i;
+
+ snprintf(out, sizeof(out), "%s", op_name(po->op));
+ for (i = 0; i < po->operand_cnt; i++) {
+ p += strlen(p);
+ if (i > 0)
+ *p++ = ',';
+ snprintf(p, sizeof(out) - (p - out),
+ po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
+ po->operand[i].name);
+ }
+
+ return out;
+}
+
+static const char *opr_name(struct parsed_op *po, int opr_num)
+{
+ if (opr_num >= po->operand_cnt)
+ ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
+ return po->operand[opr_num].name;
+}
+
+static unsigned int opr_const(struct parsed_op *po, int opr_num)
+{
+ if (opr_num >= po->operand_cnt)
+ ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
+ if (po->operand[opr_num].type != OPT_CONST)
+ ferr(po, "opr %d: const expected\n", opr_num);
+ return po->operand[opr_num].val;
+}
+
+static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
+{
+ if ((unsigned int)popr->reg >= MAX_REGS)
+ ferr(po, "invalid reg: %d\n", popr->reg);
+ return regs_r32[popr->reg];
+}
+
+static struct parsed_equ *equ_find(struct parsed_op *po, const char *name)
+{
+ int i;
+
+ for (i = 0; i < g_eqcnt; i++)
+ if (IS(g_eqs[i].name, name))
+ break;
+ if (i >= g_eqcnt)
+ ferr(po, "unresolved equ name: '%s'\n", name);
+
+ return &g_eqs[i];
+}
+
+static void bg_frame_access(struct parsed_op *po, enum opr_lenmod lmod,
+ char *buf, size_t buf_size, const char *bp_arg,
+ int is_src, int is_lea)
+{
+ const char *prefix = "";
+ struct parsed_equ *eq;
+ int i, arg_i, arg_s;
+ int sf_ofs;
+
+ snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
+
+ eq = equ_find(po, bp_arg);
+
+ if (eq->offset >= 0) {
+ arg_i = eq->offset / 4 - 2;
+ if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
+ ferr(po, "offset %d doesn't map to any arg\n", eq->offset);
+
+ for (i = arg_s = 0; i < g_func_pp.argc; i++) {
+ if (g_func_pp.arg[i].reg != NULL)
+ continue;
+ if (arg_s == arg_i)
+ break;
+ arg_s++;
+ }
+ if (i == g_func_pp.argc)
+ ferr(po, "arg %d not in prototype?\n", arg_i);
+ if (is_lea)
+ ferr(po, "lea to arg?\n");
+
+ snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
+ }
+ else {
+ if (g_bp_stack == 0)
+ ferr(po, "bp_stack access after it was not detected\n");
+
+ sf_ofs = g_bp_stack + eq->offset;
+ if (sf_ofs < 0)
+ ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_bp_stack);
+
+ if (is_lea)
+ prefix = "&";
+
+ switch (lmod)
+ {
+ case OPLM_BYTE:
+ snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
+ break;
+ case OPLM_WORD:
+ snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
+ break;
+ case OPLM_DWORD:
+ snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
+ break;
+ default:
+ ferr(po, "bp_stack bad lmod: %d\n", lmod);
+ }
+ }
+}
+
+static char *out_src_opr(char *buf, size_t buf_size,
+ struct parsed_op *po, struct parsed_opr *popr, int is_lea)
+{
+ const char *cast = "";
+ char tmp1[256], tmp2[256];
+ char expr[256];
+ int ret;
+
+ switch (popr->type) {
+ case OPT_REG:
+ if (is_lea)
+ ferr(po, "lea from reg?\n");
+
+ switch (popr->lmod) {
+ case OPLM_DWORD:
+ snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
+ break;
+ case OPLM_WORD:
+ snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
+ break;
+ case OPLM_BYTE:
+ if (popr->name[1] == 'h') // XXX..
+ snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
+ else
+ snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
+ break;
+ default:
+ ferr(po, "invalid src lmod: %d\n", popr->lmod);
+ }
+ break;
+
+ case OPT_REGMEM:
+ if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
+ bg_frame_access(po, popr->lmod, buf, buf_size,
+ popr->name + 4, 1, is_lea);
+ break;
+ }
+
+ strcpy(expr, popr->name);
+ if (strchr(expr, '[')) {
+ // special case: '[' can only be left for label[reg] form
+ ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
+ if (ret != 2)
+ ferr(po, "parse failure for '%s'\n", expr);
+ snprintf(expr, sizeof(expr), "(u32)%s + %s", tmp1, tmp2);
+ }
+
+ // XXX: do we need more parsing?
+ if (is_lea) {
+ snprintf(buf, buf_size, "%s", expr);
+ break;
+ }
+
+ switch (popr->lmod) {
+ case OPLM_DWORD:
+ cast = "*(u32 *)";
+ break;
+ case OPLM_WORD:
+ cast = "*(u16 *)";
+ break;
+ case OPLM_BYTE:
+ cast = "*(u8 *)";
+ break;
+ default:
+ ferr(po, "invalid lmod: %d\n", popr->lmod);
+ }
+ snprintf(buf, buf_size, "%s(%s)", cast, expr);
+ break;
+
+ case OPT_LABEL:
+ if (is_lea)
+ snprintf(buf, buf_size, "(u32)&%s", popr->name);
+ else
+ snprintf(buf, buf_size, "%s", popr->name);
+ break;
+
+ case OPT_OFFSET:
+ if (is_lea)
+ ferr(po, "lea an offset?\n");
+ snprintf(buf, buf_size, "(u32)&%s", popr->name);
+ break;
+
+ case OPT_CONST:
+ if (is_lea)
+ ferr(po, "lea from const?\n");
+
+ printf_number(buf, buf_size, popr->val);
+ break;
+
+ default:
+ ferr(po, "invalid src type: %d\n", popr->type);
+ }
+
+ return buf;
+}
+
+static char *out_dst_opr(char *buf, size_t buf_size,
+ struct parsed_op *po, struct parsed_opr *popr)
+{
+ switch (popr->type) {
+ case OPT_REG:
+ switch (popr->lmod) {
+ case OPLM_DWORD:
+ snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
+ break;
+ case OPLM_WORD:
+ // ugh..
+ snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
+ break;
+ case OPLM_BYTE:
+ // ugh..
+ if (popr->name[1] == 'h') // XXX..
+ snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
+ else
+ snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
+ break;
+ default:
+ ferr(po, "invalid dst lmod: %d\n", popr->lmod);
+ }
+ break;
+
+ case OPT_REGMEM:
+ if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
+ bg_frame_access(po, popr->lmod, buf, buf_size,
+ popr->name + 4, 0, 0);
+ break;
+ }
+
+ return out_src_opr(buf, buf_size, po, popr, 0);
+
+ default:
+ ferr(po, "invalid dst type: %d\n", popr->type);
+ }
+
+ return buf;
+}
+
+static const char *lmod_cast_u(struct parsed_op *po,
+ enum opr_lenmod lmod)
+{
+ switch (lmod) {
+ case OPLM_DWORD:
+ return "";
+ case OPLM_WORD:
+ return "(u16)";
+ case OPLM_BYTE:
+ return "(u8)";
+ default:
+ ferr(po, "invalid lmod: %d\n", lmod);
+ return "(_invalid_)";
+ }
+}
+
+static const char *lmod_cast_s(struct parsed_op *po,
+ enum opr_lenmod lmod)
+{
+ switch (lmod) {
+ case OPLM_DWORD:
+ return "(s32)";
+ case OPLM_WORD:
+ return "(s16)";
+ case OPLM_BYTE:
+ return "(s8)";
+ default:
+ ferr(po, "invalid lmod: %d\n", lmod);
+ return "(_invalid_)";
+ }
+}
+
+static const char *lmod_cast(struct parsed_op *po,
+ enum opr_lenmod lmod, int is_signed)
+{
+ return is_signed ?
+ lmod_cast_s(po, lmod) :
+ lmod_cast_u(po, lmod);
+}
+
+static enum parsed_flag_op split_cond(struct parsed_op *po,
+ enum op_op op, int *is_neg)
+{
+ *is_neg = 0;
+
+ switch (op) {
+ case OP_JO:
+ return PFO_O;
+ case OP_JC:
+ return PFO_C;
+ case OP_JZ:
+ return PFO_Z;
+ case OP_JBE:
+ return PFO_BE;
+ case OP_JS:
+ return PFO_S;
+ case OP_JP:
+ return PFO_P;
+ case OP_JL:
+ return PFO_L;
+ case OP_JLE:
+ return PFO_LE;
+
+ case OP_JNO:
+ *is_neg = 1;
+ return PFO_O;
+ case OP_JNC:
+ *is_neg = 1;
+ return PFO_C;
+ case OP_JNZ:
+ *is_neg = 1;
+ return PFO_Z;
+ case OP_JA:
+ *is_neg = 1;
+ return PFO_BE;
+ case OP_JNS:
+ *is_neg = 1;
+ return PFO_S;
+ case OP_JNP:
+ *is_neg = 1;
+ return PFO_P;
+ case OP_JGE:
+ *is_neg = 1;
+ return PFO_L;
+ case OP_JG:
+ *is_neg = 1;
+ return PFO_LE;
+
+ case OP_ADC:
+ case OP_SBB:
+ return PFO_C;
+
+ default:
+ ferr(po, "split_cond: bad op %d\n", op);
+ return -1;
+ }
+}
+
+static void out_test_for_cc(char *buf, size_t buf_size,
+ struct parsed_op *po, enum parsed_flag_op pfo, int is_neg,
+ enum opr_lenmod lmod, const char *expr)
+{
+ const char *cast, *scast;
+
+ cast = lmod_cast_u(po, lmod);
+ scast = lmod_cast_s(po, lmod);
+
+ switch (pfo) {
+ case PFO_Z:
+ snprintf(buf, buf_size, "(%s%s %s 0)",
+ cast, expr, is_neg ? "!=" : "==");
+ break;
+
+ case PFO_S:
+ case PFO_L: // SF!=OF; OF=0
+ snprintf(buf, buf_size, "(%s%s %s 0)",
+ scast, expr, is_neg ? ">=" : "<");
+ break;
+
+ case PFO_LE: // ZF=1||SF!=OF; OF=0 after test
+ snprintf(buf, buf_size, "(%s%s %s 0)",
+ scast, expr, is_neg ? ">" : "<=");
+ break;
+
+ default:
+ ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
+ }
+}
+static void out_cmp_for_cc(char *buf, size_t buf_size,
+ struct parsed_op *po, enum parsed_flag_op pfo, int is_neg,
+ enum opr_lenmod lmod, const char *expr1, const char *expr2)
+{
+ const char *cast, *scast;
+
+ cast = lmod_cast_u(po, lmod);
+ scast = lmod_cast_s(po, lmod);
+
+ switch (pfo) {
+ case PFO_C:
+ // note: must be unsigned compare
+ snprintf(buf, buf_size, "(%s%s %s %s%s)",
+ cast, expr1, is_neg ? ">=" : "<", cast, expr2);
+ break;
+
+ case PFO_Z:
+ snprintf(buf, buf_size, "(%s%s %s %s%s)",
+ cast, expr1, is_neg ? "!=" : "==", cast, expr2);
+ break;
+
+ case PFO_BE: // !a
+ // note: must be unsigned compare
+ snprintf(buf, buf_size, "(%s%s %s %s%s)",
+ cast, expr1, is_neg ? ">" : "<=", cast, expr2);
+ break;
+
+ // note: must be signed compare
+ case PFO_S:
+ snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
+ scast, expr1, expr2, is_neg ? ">=" : "<");
+ break;
+
+ case PFO_L: // !ge
+ snprintf(buf, buf_size, "(%s%s %s %s%s)",
+ scast, expr1, is_neg ? ">=" : "<", scast, expr2);
+ break;
+
+ case PFO_LE:
+ snprintf(buf, buf_size, "(%s%s %s %s%s)",
+ scast, expr1, is_neg ? ">" : "<=", scast, expr2);
+ break;
+
+ default:
+ ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
+ }
+}
+
+static void out_cmp_test(char *buf, size_t buf_size,
+ struct parsed_op *po, enum parsed_flag_op pfo, int is_neg)
+{
+ char buf1[256], buf2[256], buf3[256];
+
+ if (po->op == OP_TEST) {
+ if (IS(opr_name(po, 0), opr_name(po, 1))) {
+ out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
+ }
+ else {
+ out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
+ snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
+ }
+ out_test_for_cc(buf, buf_size, po, pfo, is_neg,
+ po->operand[0].lmod, buf3);
+ }
+ else if (po->op == OP_CMP) {
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
+ out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
+ out_cmp_for_cc(buf, buf_size, po, pfo, is_neg,
+ po->operand[0].lmod, buf2, buf3);
+ }
+ else
+ ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
+}
+
+static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
+ struct parsed_opr *popr2)
+{
+ struct parsed_equ *eq;
+
+ if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC) {
+ // lmod could be specified by equ..
+ if (!strncmp(popr1->name, "ebp+", 4)) {
+ eq = equ_find(po, popr1->name + 4);
+ popr1->lmod = eq->lmod;
+ }
+ if (!strncmp(popr2->name, "ebp+", 4)) {
+ eq = equ_find(po, popr2->name + 4);
+ popr2->lmod = eq->lmod;
+ }
+ }
+
+ if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
+ ferr(po, "missing lmod for both operands\n");
+
+ if (popr1->lmod == OPLM_UNSPEC)
+ popr1->lmod = popr2->lmod;
+ else if (popr2->lmod == OPLM_UNSPEC)
+ popr2->lmod = popr1->lmod;
+ else if (popr1->lmod != popr2->lmod)
+ ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
+}
+
+static const char *op_to_c(struct parsed_op *po)
+{
+ switch (po->op)
+ {
+ case OP_ADD:
+ case OP_ADC:
+ return "+";
+ case OP_SUB:
+ case OP_SBB:
+ return "-";
+ case OP_AND:
+ return "&";
+ case OP_OR:
+ return "|";
+ case OP_XOR:
+ return "^";
+ case OP_SHL:
+ return "<<";
+ case OP_SHR:
+ return ">>";
+ case OP_MUL:
+ case OP_IMUL:
+ return "*";
+ default:
+ ferr(po, "op_to_c was supplied with %d\n", po->op);
+ }
+}
+
+static int scan_for_pop(int i, int opcnt, const char *reg)
+{
+ for (; i < opcnt; i++) {
+ if (ops[i].flags & OPF_RMD)
+ continue;
+
+ if ((ops[i].flags & OPF_JMP) || g_labels[i][0] != 0)
+ return -1;
+
+ if (ops[i].op == OP_POP && ops[i].operand[0].type == OPT_REG
+ && IS(ops[i].operand[0].name, reg))
+ return i;
+ }
+
+ return -1;
+}
+
+// scan for pop starting from 'ret' op (all paths)
+static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch)
+{
+ int found = 0;
+ int j;
+
+ for (; i < opcnt; i++) {
+ if (ops[i].op != OP_RET)
+ continue;
+
+ for (j = i - 1; j >= 0; j--) {
+ if (ops[j].flags & OPF_RMD)
+ continue;
+ if (ops[j].flags & OPF_JMP)
+ return -1;
+
+ if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
+ && IS(ops[j].operand[0].name, reg))
+ {
+ found = 1;
+ if (do_patch)
+ ops[j].flags |= OPF_RMD;
+ break;
+ }
+
+ if (g_labels[j][0] != 0)
+ return -1;
+ }
+ }
+
+ return found ? 0 : -1;
+}
+
+// is operand 'opr modified' by parsed_op 'po'?
+static int is_opr_modified(const struct parsed_opr *opr,
+ const struct parsed_op *po)
+{
+ if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
+ return 0;
+
+ if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
+ if (po->regmask_dst & (1 << opr->reg))
+ return 1;
+ else
+ return 0;
+ }
+
+ return IS(po->operand[0].name, opr->name);
+}
+
+// is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
+static int is_any_opr_modified(const struct parsed_op *po_test,
+ const struct parsed_op *po)
+{
+ int i;
+
+ if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
+ return 0;
+
+ if (po_test->regmask_src & po->regmask_dst)
+ return 1;
+
+ for (i = 0; i < po_test->operand_cnt; i++)
+ if (IS(po_test->operand[i].name, po->operand[0].name))
+ return 1;
+
+ return 0;
+}
+
+// scan for po_test operand modification in range given
+static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
+{
+ for (; i < opcnt; i++) {
+ if (is_any_opr_modified(po_test, &ops[i]))
+ return i;
+ }
+
+ return -1;
+}
+
+static int scan_for_flag_set(int i)
+{
+ for (; i >= 0; i--) {
+ if (ops[i].flags & OPF_FLAGS)
+ return i;
+
+ if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
+ return -1;
+ if (g_labels[i][0] != 0)
+ return -1;
+ }
+
+ return -1;
+}
+
+// scan back for cdq, if anything modifies edx, fail
+static int scan_for_cdq_edx(int i)
+{
+ for (; i >= 0; i--) {
+ if (ops[i].op == OP_CDQ)
+ return i;
+
+ if (ops[i].regmask_dst & (1 << xDX))
+ return -1;
+ if (g_labels[i][0] != 0)
+ return -1;
+ }
+
+ return -1;
+}
+
+static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
+{
+ struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
+ struct parsed_opr *last_arith_dst = NULL;
+ char buf1[256], buf2[256], buf3[256];
+ struct parsed_proto *pp;
+ const char *tmpname;
+ int save_arg_vars = 0;
+ int cmp_result_vars = 0;
+ int had_decl = 0;
+ int regmask_arg = 0;
+ int regmask = 0;
+ int no_output;
+ int dummy;
+ int arg;
+ int i, j;
+ int reg;
+ int ret;
+
+ g_bp_frame = g_bp_stack = 0;
+
+ ret = proto_parse(fhdr, funcn, &g_func_pp);
+ if (ret)
+ ferr(ops, "proto_parse failed for '%s'\n", funcn);
+
+ fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
+ for (i = 0; i < g_func_pp.argc; i++) {
+ if (i > 0)
+ fprintf(fout, ", ");
+ fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
+ }
+ fprintf(fout, ")\n{\n");
+
+ // pass1:
+ // - handle ebp frame, remove ops related to it
+ if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
+ && ops[1].op == OP_MOV
+ && IS(opr_name(&ops[1], 0), "ebp")
+ && IS(opr_name(&ops[1], 1), "esp"))
+ {
+ g_bp_frame = 1;
+ ops[0].flags |= OPF_RMD;
+ ops[1].flags |= OPF_RMD;
+
+ if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
+ g_bp_stack = opr_const(&ops[2], 1);
+ ops[2].flags |= OPF_RMD;
+ }
+
+ i = 2;
+ do {
+ for (; i < opcnt; i++)
+ if (ops[i].op == OP_RET)
+ break;
+ if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
+ ferr(&ops[i - 1], "'pop ebp' expected\n");
+ ops[i - 1].flags |= OPF_RMD;
+ if (g_bp_stack != 0) {
+ if (ops[i - 2].op != OP_MOV
+ || !IS(opr_name(&ops[i - 2], 0), "esp")
+ || !IS(opr_name(&ops[i - 2], 1), "ebp"))
+ {
+ ferr(&ops[i - 2], "esp restore expected\n");
+ }
+ ops[i - 2].flags |= OPF_RMD;
+ }
+ i++;
+ } while (i < opcnt);
+ }
- fprintf(fout, "}\n\n");
- proto_release(&pp);
- return 0;
+ // pass2:
+ // - find POPs for PUSHes, rm both
+ // - scan for all used registers
+ // - find flag set ops for their users
+ // - process calls
+ for (i = 0; i < opcnt; i++) {
+ po = &ops[i];
+ if (po->flags & OPF_RMD)
+ continue;
+
+ if (po->op == OP_PUSH && po->operand[0].type == OPT_REG) {
+ if (po->operand[0].reg < 0)
+ ferr(po, "reg not set for push?\n");
+ if (!(regmask & (1 << po->operand[0].reg))) { // reg save
+ ret = scan_for_pop(i + 1, opcnt, po->operand[0].name);
+ if (ret >= 0) {
+ po->flags |= OPF_RMD;
+ ops[ret].flags |= OPF_RMD;
+ continue;
+ }
+ ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
+ if (ret == 0) {
+ po->flags |= OPF_RMD;
+ scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 1);
+ continue;
+ }
+ }
+ }
+
+ regmask |= po->regmask_src | po->regmask_dst;
+
+ if (po->flags & OPF_CC)
+ {
+ ret = scan_for_flag_set(i - 1);
+ if (ret < 0)
+ ferr(po, "unable to trace flag setter\n");
+
+ tmp_op = &ops[ret]; // flag setter
+ ret = scan_for_mod(tmp_op, ret + 1, i);
+ if (ret >= 0) {
+ ret = 1 << split_cond(po, po->op, &dummy);
+ tmp_op->pfomask |= ret;
+ cmp_result_vars |= ret;
+ po->datap = tmp_op;
+ }
+
+ if (po->op == OP_ADC || po->op == OP_SBB)
+ cmp_result_vars |= 1 << PFO_C;
+ }
+ else if (po->op == OP_CALL)
+ {
+ pp = malloc(sizeof(*pp));
+ my_assert_not(pp, NULL);
+ tmpname = opr_name(&ops[i], 0);
+ ret = proto_parse(fhdr, tmpname, pp);
+ if (ret)
+ ferr(po, "proto_parse failed for '%s'\n", tmpname);
+
+ for (arg = 0; arg < pp->argc; arg++)
+ if (pp->arg[arg].reg == NULL)
+ break;
+
+ for (j = i - 1; j >= 0 && arg < pp->argc; j--) {
+ if (ops[j].flags & OPF_RMD)
+ continue;
+ if (ops[j].op != OP_PUSH)
+ continue;
+ if (g_labels[j + 1][0] != 0)
+ ferr(po, "arg search interrupted by '%s'\n", g_labels[j + 1]);
+
+ pp->arg[arg].datap = &ops[j];
+ ret = scan_for_mod(&ops[j], j + 1, i);
+ if (ret >= 0) {
+ // mark this push as one that needs operand saving
+ ops[j].datap = (void *)(long)(arg + 1);
+ save_arg_vars |= 1 << arg;
+ }
+ else
+ ops[j].flags |= OPF_RMD;
+
+ // next arg
+ for (arg++; arg < pp->argc; arg++)
+ if (pp->arg[arg].reg == NULL)
+ break;
+ }
+ if (arg < pp->argc)
+ ferr(po, "arg collect failed for '%s'\n", tmpname);
+ po->datap = pp;
+ }
+ }
+
+ // declare stack frame
+ if (g_bp_stack)
+ fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
+ (g_bp_stack + 3) / 4, (g_bp_stack + 1) / 2, g_bp_stack);
+
+ // instantiate arg-registers
+ for (i = 0; i < g_func_pp.argc; i++) {
+ if (g_func_pp.arg[i].reg != NULL) {
+ reg = char_array_i(regs_r32,
+ ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
+ if (reg < 0)
+ ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
+
+ regmask_arg |= 1 << reg;
+ fprintf(fout, " u32 %s = (u32)a%d;\n",
+ g_func_pp.arg[i].reg, i + 1);
+ had_decl = 1;
+ }
+ }
+
+ // instantiate other regs - special case for eax
+ if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
+ fprintf(fout, " u32 eax = 0;\n");
+ had_decl = 1;
+ }
+
+ regmask &= ~regmask_arg;
+ if (g_bp_frame)
+ regmask &= ~(1 << xBP);
+ if (regmask) {
+ for (reg = 0; reg < 8; reg++) {
+ if (regmask & (1 << reg)) {
+ fprintf(fout, " u32 %s;\n", regs_r32[reg]);
+ had_decl = 1;
+ }
+ }
+ }
+
+ if (save_arg_vars) {
+ for (reg = 0; reg < 32; reg++) {
+ if (save_arg_vars & (1 << reg)) {
+ fprintf(fout, " u32 s_a%d;\n", reg + 1);
+ had_decl = 1;
+ }
+ }
+ }
+
+ if (cmp_result_vars) {
+ for (i = 0; i < 8; i++) {
+ if (cmp_result_vars & (1 << i)) {
+ fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
+ had_decl = 1;
+ }
+ }
+ }
+
+ if (had_decl)
+ fprintf(fout, "\n");
+
+ // output ops
+ for (i = 0; i < opcnt; i++)
+ {
+ if (g_labels[i][0] != 0)
+ fprintf(fout, "\n%s:\n", g_labels[i]);
+
+ po = &ops[i];
+ if (po->flags & OPF_RMD)
+ continue;
+
+ no_output = 0;
+
+ #define assert_operand_cnt(n_) \
+ if (po->operand_cnt != n_) \
+ ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
+
+ // conditional/flag using op?
+ if (po->flags & OPF_CC)
+ {
+ enum parsed_flag_op pfo;
+ int is_neg = 0;
+
+ pfo = split_cond(po, po->op, &is_neg);
+
+ // we go through all this trouble to avoid using parsed_flag_op,
+ // which makes generated code much nicer
+ if (delayed_flag_op != NULL)
+ {
+ out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_neg);
+ }
+ else if (last_arith_dst != NULL
+ && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
+ {
+ out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
+ out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_neg,
+ last_arith_dst->lmod, buf3);
+ }
+ else if (po->datap != NULL) {
+ // use preprocessed results
+ tmp_op = po->datap;
+ if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
+ ferr(po, "not prepared for pfo %d\n", pfo);
+
+ // note: is_neg was not yet applied
+ snprintf(buf1, sizeof(buf1), "(%scond_%s)",
+ is_neg ? "!" : "", parsed_flag_op_names[pfo]);
+ }
+ else {
+ ferr(po, "all methods of finding comparison failed\n");
+ }
+
+ if (po->flags & OPF_JMP) {
+ fprintf(fout, " if %s\n", buf1);
+ }
+ else if (po->op == OP_ADC || po->op == OP_SBB) {
+ fprintf(fout, " cond_%s = %s;\n", parsed_flag_op_names[pfo], buf1);
+ }
+ else if (po->flags & OPF_DATA) { // SETcc
+ out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
+ fprintf(fout, " %s = %s;", buf2, buf1);
+ }
+ else {
+ ferr(po, "unhandled conditional op\n");
+ }
+ }
+
+ switch (po->op)
+ {
+ case OP_MOV:
+ assert_operand_cnt(2);
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ fprintf(fout, " %s = %s;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ break;
+
+ case OP_LEA:
+ assert_operand_cnt(2);
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ fprintf(fout, " %s = %s;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
+ break;
+
+ case OP_MOVZX:
+ assert_operand_cnt(2);
+ fprintf(fout, " %s = %s;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ break;
+
+ case OP_MOVSX:
+ assert_operand_cnt(2);
+ switch (po->operand[1].lmod) {
+ case OPLM_BYTE:
+ strcpy(buf3, "(s8)");
+ break;
+ case OPLM_WORD:
+ strcpy(buf3, "(s16)");
+ break;
+ default:
+ ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
+ }
+ fprintf(fout, " %s = %s%s;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ buf3,
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ break;
+
+ case OP_NOT:
+ assert_operand_cnt(1);
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
+ fprintf(fout, " %s = ~%s;", buf1, buf1);
+ break;
+
+ case OP_CDQ:
+ assert_operand_cnt(2);
+ fprintf(fout, " %s = (s32)%s >> 31;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ strcpy(g_comment, "cdq");
+ break;
+
+ // arithmetic w/flags
+ case OP_ADD:
+ case OP_SUB:
+ case OP_AND:
+ case OP_OR:
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ // fallthrough
+ case OP_SHL:
+ case OP_SHR:
+ dualop_arith:
+ assert_operand_cnt(2);
+ fprintf(fout, " %s %s= %s;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ op_to_c(po),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_XOR:
+ assert_operand_cnt(2);
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ if (IS(opr_name(po, 0), opr_name(po, 1))) {
+ // special case for XOR
+ fprintf(fout, " %s = 0;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+ }
+ goto dualop_arith;
+
+ case OP_SAR:
+ assert_operand_cnt(2);
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
+ fprintf(fout, " %s = %s%s >> %s;", buf1,
+ lmod_cast_s(po, po->operand[0].lmod), buf1,
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_ADC:
+ case OP_SBB:
+ assert_operand_cnt(2);
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ fprintf(fout, " %s %s= %s + cond_c;",
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
+ op_to_c(po),
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_INC:
+ case OP_DEC:
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
+ strcpy(buf2, po->op == OP_INC ? "++" : "--");
+ fprintf(fout, " %s%s;", buf1, buf2);
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_NEG:
+ out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
+ out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
+ fprintf(fout, " %s = -%s%s;", buf1,
+ lmod_cast_s(po, po->operand[0].lmod), buf2);
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_IMUL:
+ if (po->operand_cnt == 2)
+ goto dualop_arith;
+ ferr(po, "TODO imul\n");
+ last_arith_dst = &po->operand[0];
+ delayed_flag_op = NULL;
+ break;
+
+ case OP_DIV:
+ case OP_IDIV:
+ assert_operand_cnt(1);
+ if (po->operand[0].lmod != OPLM_DWORD)
+ ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
+
+ // 32bit division is common, look for it
+ if (scan_for_cdq_edx(i - 1) >= 0) {
+ out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
+ strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
+ po->op == OP_IDIV));
+ fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
+ fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
+ }
+ else
+ ferr(po, "TODO 64bit divident\n");
+ break;
+
+ case OP_TEST:
+ case OP_CMP:
+ propagate_lmod(po, &po->operand[0], &po->operand[1]);
+ if (po->pfomask != 0) {
+ for (j = 0; j < 8; j++) {
+ if (po->pfomask & (1 << j)) {
+ out_cmp_test(buf1, sizeof(buf1), po, j, 0);
+ fprintf(fout, " cond_%s = %s;",
+ parsed_flag_op_names[j], buf1);
+ }
+ }
+ }
+ else
+ no_output = 1;
+ delayed_flag_op = po;
+ break;
+
+ // note: we reuse OP_Jcc for SETcc, only flags differ
+ case OP_JO ... OP_JG:
+ if (po->flags & OPF_JMP)
+ fprintf(fout, " goto %s;", po->operand[0].name);
+ // else SETcc - should already be handled
+ break;
+
+ case OP_JMP:
+ fprintf(fout, " goto %s;", po->operand[0].name);
+ break;
+
+ case OP_CALL:
+ assert_operand_cnt(1);
+ if (po->operand[0].type != OPT_LABEL)
+ ferr(po, "unhandled call type\n");
+
+ pp = po->datap;
+ if (pp == NULL)
+ ferr(po, "NULL pp\n");
+
+ fprintf(fout, " ");
+ if (!IS(pp->ret_type, "void")) {
+ fprintf(fout, "eax = ");
+ if (strchr(pp->ret_type, '*'))
+ fprintf(fout, "(u32)");
+ }
+ fprintf(fout, "%s(", opr_name(po, 0));
+ for (arg = 0; arg < pp->argc; arg++) {
+ if (arg > 0)
+ fprintf(fout, ", ");
+ if (pp->arg[arg].reg != NULL) {
+ fprintf(fout, "%s", pp->arg[arg].reg);
+ continue;
+ }
+
+ // stack arg
+ tmp_op = pp->arg[arg].datap;
+ if (tmp_op == NULL)
+ ferr(po, "parsed_op missing for arg%d\n", arg);
+ if (tmp_op->datap) {
+ fprintf(fout, "s_a%ld", (long)tmp_op->datap);
+ }
+ else {
+ fprintf(fout, "%s",
+ out_src_opr(buf1, sizeof(buf1),
+ tmp_op, &tmp_op->operand[0], 0));
+ }
+ }
+ fprintf(fout, ");");
+ break;
+
+ case OP_RET:
+ if (IS(g_func_pp.ret_type, "void"))
+ fprintf(fout, " return;");
+ else
+ fprintf(fout, " return eax;");
+ break;
+
+ case OP_PUSH:
+ if (po->datap) {
+ // special case - saved func arg
+ fprintf(fout, " s_a%ld = %s;", (long)po->datap,
+ out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
+ break;
+ }
+ ferr(po, "push encountered\n");
+ break;
+
+ case OP_POP:
+ ferr(po, "pop encountered\n");
+ break;
+
+ default:
+ no_output = 1;
+ ferr(po, "unhandled op type %d, flags %x\n",
+ po->op, po->flags);
+ break;
+ }
+
+ if (g_comment[0] != 0) {
+ fprintf(fout, " // %s", g_comment);
+ g_comment[0] = 0;
+ no_output = 0;
+ }
+ if (!no_output)
+ fprintf(fout, "\n");
+
+ // see is delayed flag stuff is still valid
+ if (delayed_flag_op != NULL && delayed_flag_op != po) {
+ if (is_any_opr_modified(delayed_flag_op, po))
+ delayed_flag_op = NULL;
+ }
+
+ if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
+ if (is_opr_modified(last_arith_dst, po))
+ last_arith_dst = NULL;
+ }
+ }
+
+ fprintf(fout, "}\n\n");
+
+ // cleanup
+ for (i = 0; i < opcnt; i++) {
+ if (ops[i].op == OP_CALL) {
+ pp = ops[i].datap;
+ if (pp) {
+ proto_release(pp);
+ free(pp);
+ }
+ }
+ }
+ proto_release(&g_func_pp);
}
int main(int argc, char *argv[])
{
- FILE *fout, *fasm, *fhdr;
- char line[256];
- char words[16][256];
- char func[256];
- int in_func = 0;
- int pi = 0;
- int len;
- char *p;
- int wordc;
-
- if (argc != 4) {
- printf("usage:\n%s <.c> <.asm> <hdrf>\n",
- argv[0]);
- return 1;
- }
+ FILE *fout, *fasm, *fhdr;
+ char line[256];
+ char words[16][256];
+ int in_func = 0;
+ int eq_alloc;
+ int pi = 0;
+ int len;
+ char *p;
+ int wordc;
- hdrfn = argv[3];
- fhdr = fopen(hdrfn, "r");
- my_assert_not(fhdr, NULL);
+ if (argc != 4) {
+ printf("usage:\n%s <.c> <.asm> <hdrf>\n",
+ argv[0]);
+ return 1;
+ }
- asmfn = argv[2];
- fasm = fopen(asmfn, "r");
- my_assert_not(fasm, NULL);
+ hdrfn = argv[3];
+ fhdr = fopen(hdrfn, "r");
+ my_assert_not(fhdr, NULL);
- fout = fopen(argv[1], "w");
- my_assert_not(fout, NULL);
+ asmfn = argv[2];
+ fasm = fopen(asmfn, "r");
+ my_assert_not(fasm, NULL);
+ fout = fopen(argv[1], "w");
+ my_assert_not(fout, NULL);
- while (fgets(line, sizeof(line), fasm))
- {
- asmln++;
+ eq_alloc = 128;
+ g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
+ my_assert_not(g_eqs, NULL);
- p = sskip(line);
- if (*p == 0 || *p == ';')
- continue;
+ while (fgets(line, sizeof(line), fasm))
+ {
+ asmln++;
- memset(words, 0, sizeof(words));
- for (wordc = 0; wordc < 16; wordc++) {
- p = sskip(next_word(words[wordc], sizeof(words[0]), p));
- if (*p == 0 || *p == ';') {
- wordc++;
- break;
- }
- }
+ p = sskip(line);
+ if (*p == 0 || *p == ';')
+ continue;
- if (wordc == 0) {
- // shouldn't happen
- awarn("wordc == 0?\n");
- continue;
- }
+ memset(words, 0, sizeof(words));
+ for (wordc = 0; wordc < 16; wordc++) {
+ p = sskip(next_word(words[wordc], sizeof(words[0]), p));
+ if (*p == 0 || *p == ';') {
+ wordc++;
+ break;
+ }
+ }
- // don't care about this:
- if (words[0][0] == '.'
- || IS(words[0], "include")
- || IS(words[0], "assume") || IS(words[1], "segment")
- || IS(words[0], "align"))
- {
- continue;
- }
+ if (wordc == 0) {
+ // shouldn't happen
+ awarn("wordc == 0?\n");
+ continue;
+ }
- if (IS(words[1], "proc")) {
- if (in_func)
- aerr("proc '%s' while in_func '%s'?\n",
- words[0], func);
- strcpy(func, words[0]);
- in_func = 1;
- continue;
- }
+ // don't care about this:
+ if (words[0][0] == '.'
+ || IS(words[0], "include")
+ || IS(words[0], "assume") || IS(words[1], "segment")
+ || IS(words[0], "align"))
+ {
+ continue;
+ }
- if (IS(words[1], "endp")) {
- if (!in_func)
- aerr("endp '%s' while not in_func?\n", words[0]);
- if (!IS(func, words[0]))
- aerr("endp '%s' while in_func '%s'?\n",
- words[0], func);
- gen_func(fout, fhdr, func, pi);
- in_func = 0;
- func[0] = 0;
- if (pi != 0) {
- memset(&ops, 0, pi * sizeof(ops[0]));
- memset(labels, 0, pi * sizeof(labels[0]));
- pi = 0;
- }
- exit(1);
- continue;
- }
+ if (IS(words[1], "proc")) {
+ if (in_func)
+ aerr("proc '%s' while in_func '%s'?\n",
+ words[0], g_func);
+ strcpy(g_func, words[0]);
+ in_func = 1;
+ continue;
+ }
- if (IS(words[1], "="))
- // lots of work will be have to be done here, but for now..
- continue;
-
- if (pi >= ARRAY_SIZE(ops))
- aerr("too many ops\n");
-
- p = strchr(words[0], ':');
- if (p != NULL) {
- len = p - words[0];
- if (len > sizeof(labels[0]) - 1)
- aerr("label too long: %d\n", len);
- if (labels[pi][0] != 0)
- aerr("dupe label?\n");
- memcpy(labels[pi], words[0], len);
- labels[pi][len] = 0;
- continue;
- }
+ if (IS(words[1], "endp")) {
+ if (!in_func)
+ aerr("endp '%s' while not in_func?\n", words[0]);
+ if (!IS(g_func, words[0]))
+ aerr("endp '%s' while in_func '%s'?\n",
+ words[0], g_func);
+ gen_func(fout, fhdr, g_func, pi);
+ in_func = 0;
+ g_func[0] = 0;
+ if (pi != 0) {
+ memset(&ops, 0, pi * sizeof(ops[0]));
+ memset(g_labels, 0, pi * sizeof(g_labels[0]));
+ pi = 0;
+ }
+ g_eqcnt = 0;
+ continue;
+ }
- parse_op(&ops[pi], words, wordc);
- pi++;
+ if (IS(words[1], "=")) {
+ if (wordc != 5)
+ aerr("unhandled equ, wc=%d\n", wordc);
+ if (g_eqcnt >= eq_alloc) {
+ eq_alloc *= 2;
+ g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
+ my_assert_not(g_eqs, NULL);
+ }
- (void)proto_parse;
- }
+ len = strlen(words[0]);
+ if (len > sizeof(g_eqs[0].name) - 1)
+ aerr("equ name too long: %d\n", len);
+ strcpy(g_eqs[g_eqcnt].name, words[0]);
+
+ if (!IS(words[3], "ptr"))
+ aerr("unhandled equ\n");
+ if (IS(words[2], "dword"))
+ g_eqs[g_eqcnt].lmod = OPLM_DWORD;
+ else if (IS(words[2], "word"))
+ g_eqs[g_eqcnt].lmod = OPLM_WORD;
+ else if (IS(words[2], "byte"))
+ g_eqs[g_eqcnt].lmod = OPLM_BYTE;
+ else
+ aerr("bad lmod: '%s'\n", words[2]);
+
+ g_eqs[g_eqcnt].offset = parse_number(words[4]);
+ g_eqcnt++;
+ continue;
+ }
+
+ if (pi >= ARRAY_SIZE(ops))
+ aerr("too many ops\n");
- fclose(fout);
- fclose(fasm);
- fclose(fhdr);
+ p = strchr(words[0], ':');
+ if (p != NULL) {
+ len = p - words[0];
+ if (len > sizeof(g_labels[0]) - 1)
+ aerr("label too long: %d\n", len);
+ if (g_labels[pi][0] != 0)
+ aerr("dupe label?\n");
+ memcpy(g_labels[pi], words[0], len);
+ g_labels[pi][len] = 0;
+ continue;
+ }
- return 0;
+ parse_op(&ops[pi], words, wordc);
+ pi++;
+
+ (void)proto_parse;
+ }
+
+ fclose(fout);
+ fclose(fasm);
+ fclose(fhdr);
+
+ return 0;
}
+
+// vim:ts=2:shiftwidth=2:expandtab
notaz.gp2x.de / ia32rtools.git / blobdiff