X-Git-Url: https://notaz.gp2x.de/cgi-bin/gitweb.cgi?p=ia32rtools.git;a=blobdiff_plain;f=tools%2Ftranslate.c;h=c7e6ce1d6ea67cf1e6047db732040df765ddc038;hp=9f27cf1d87e013f306fe38703c5127c3133c3591;hb=61e29183dd00fa64584fa8787008b21a1c70b8ce;hpb=87bf6cec87a5031ec4a69eacd60704ac129f3799 diff --git a/tools/translate.c b/tools/translate.c index 9f27cf1..c7e6ce1 100644 --- a/tools/translate.c +++ b/tools/translate.c @@ -1,3 +1,12 @@ +/* + * ia32rtools + * (C) notaz, 2013-2015 + * + * This work is licensed under the terms of 3-clause BSD license. + * See COPYING file in the top-level directory. + */ + +#define _GNU_SOURCE #include #include #include @@ -7,38 +16,69 @@ #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0])) #define IS(w, y) !strcmp(w, y) +#define IS_START(w, y) !strncmp(w, y, strlen(y)) #include "protoparse.h" -const char *asmfn; +static const char *asmfn; static int asmln; +static FILE *g_fhdr; +#define anote(fmt, ...) \ + printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__) #define awarn(fmt, ...) \ - printf("warning:%s:%d: " fmt, asmfn, asmln, ##__VA_ARGS__) + printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__) #define aerr(fmt, ...) do { \ - printf("error:%s:%d: " fmt, asmfn, asmln, ##__VA_ARGS__); \ + printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \ + fcloseall(); \ exit(1); \ } while (0) +#include "masm_tools.h" + 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 */ - OPF_TAIL = (1 << 5), /* ret or tail call */ + OPF_JMP = (1 << 3), /* branch, call */ + OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz) */ + OPF_CC = (1 << 5), /* uses flags */ + OPF_TAIL = (1 << 6), /* ret or tail call */ + OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */ + OPF_REP = (1 << 8), /* prefixed by rep */ + OPF_REPZ = (1 << 9), /* rep is repe/repz */ + OPF_REPNZ = (1 << 10), /* rep is repne/repnz */ + OPF_FARG = (1 << 11), /* push collected as func arg */ + OPF_FARGNR = (1 << 12), /* push collected as func arg (no reuse) */ + OPF_EBP_S = (1 << 13), /* ebp used as scratch here, not BP */ + OPF_DF = (1 << 14), /* DF flag set */ + OPF_ATAIL = (1 << 15), /* tail call with reused arg frame */ + OPF_32BIT = (1 << 16), /* 32bit division */ + OPF_LOCK = (1 << 17), /* op has lock prefix */ + OPF_VAPUSH = (1 << 18), /* vararg ptr push (as call arg) */ + OPF_DONE = (1 << 19), /* already fully handled by analysis */ }; enum op_op { OP_INVAL, + OP_NOP, OP_PUSH, OP_POP, + OP_LEAVE, OP_MOV, OP_LEA, OP_MOVZX, OP_MOVSX, + OP_XCHG, OP_NOT, OP_CDQ, + OP_LODS, + OP_STOS, + OP_MOVS, + OP_CMPS, + OP_SCAS, + OP_STD, + OP_CLD, OP_RET, OP_ADD, OP_SUB, @@ -48,8 +88,14 @@ enum op_op { OP_SHL, OP_SHR, OP_SAR, + OP_SHRD, + OP_ROL, + OP_ROR, + OP_RCL, + OP_RCR, OP_ADC, OP_SBB, + OP_BSF, OP_INC, OP_DEC, OP_NEG, @@ -61,22 +107,14 @@ enum op_op { OP_CMP, OP_CALL, OP_JMP, - OP_JO, - OP_JNO, - OP_JC, - OP_JNC, - OP_JZ, - OP_JNZ, - OP_JBE, - OP_JA, - OP_JS, - OP_JNS, - OP_JP, - OP_JNP, - OP_JL, - OP_JGE, - OP_JLE, - OP_JG, + OP_JECXZ, + OP_JCC, + OP_SCC, + // x87 + // mmx + OP_EMMS, + // mmx + OP_UD2, }; enum opr_type { @@ -88,40 +126,59 @@ enum opr_type { OPT_CONST, }; +// must be sorted (larger len must be further in enum) enum opr_lenmod { OPLM_UNSPEC, OPLM_BYTE, OPLM_WORD, OPLM_DWORD, + OPLM_QWORD, }; #define MAX_OPERANDS 3 +#define NAMELEN 112 struct parsed_opr { enum opr_type type; enum opr_lenmod lmod; + unsigned int is_ptr:1; // pointer in C + unsigned int is_array:1; // array in C + unsigned int type_from_var:1; // .. in header, sometimes wrong + unsigned int size_mismatch:1; // type override differs from C + unsigned int size_lt:1; // type override is larger than C + unsigned int had_ds:1; // had ds: prefix + const struct parsed_proto *pp; // for OPT_LABEL int reg; unsigned int val; - char name[256]; + char name[NAMELEN]; }; struct parsed_op { enum op_op op; struct parsed_opr operand[MAX_OPERANDS]; unsigned int flags; - int operand_cnt; + unsigned char pfo; + unsigned char pfo_inv; + unsigned char operand_cnt; + unsigned char p_argnum; // arg push: altered before call arg # + unsigned char p_arggrp; // arg push: arg group # for above + unsigned char p_argpass;// arg push: arg of host func + short p_argnext;// arg push: same arg pushed elsewhere or -1 int regmask_src; // all referensed regs int regmask_dst; - int pfomask; // parsed_flag_op that can't be delayed - int cc_scratch; // for storage during analysis - int bt_i; // branch target (for branches) + int pfomask; // flagop: parsed_flag_op that can't be delayed + int cc_scratch; // scratch storage during analysis + int bt_i; // branch target for branches + struct parsed_data *btj;// branch targets for jumptables + struct parsed_proto *pp;// parsed_proto for OP_CALL void *datap; + int asmln; }; // datap: -// OP_PUSH - arg number if arg is altered before call -// OP_CALL - ptr to parsed_proto -// (OPF_CC) - point to corresponding (OPF_FLAGS) +// OP_CALL - parser proto hint (str) +// (OPF_CC) - points to one of (OPF_FLAGS) that affects cc op +// OP_POP - points to OP_PUSH in push/pop pair struct parsed_equ { char name[64]; @@ -129,26 +186,78 @@ struct parsed_equ { int offset; }; -#define MAX_OPS 1024 +struct parsed_data { + char label[256]; + enum opr_type type; + enum opr_lenmod lmod; + int count; + int count_alloc; + struct { + union { + char *label; + unsigned int val; + } u; + int bt_i; + } *d; +}; + +struct label_ref { + int i; + struct label_ref *next; +}; + +enum ida_func_attr { + IDAFA_BP_FRAME = (1 << 0), + IDAFA_LIB_FUNC = (1 << 1), + IDAFA_STATIC = (1 << 2), + IDAFA_NORETURN = (1 << 3), + IDAFA_THUNK = (1 << 4), + IDAFA_FPD = (1 << 5), +}; + +// note: limited to 32k due to p_argnext +#define MAX_OPS 4096 +#define MAX_ARG_GRP 2 static struct parsed_op ops[MAX_OPS]; 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_labels[MAX_OPS]; +static struct label_ref g_label_refs[MAX_OPS]; +static const struct parsed_proto *g_func_pp; +static struct parsed_data *g_func_pd; +static int g_func_pd_cnt; static char g_func[256]; static char g_comment[256]; static int g_bp_frame; -static int g_bp_stack; +static int g_sp_frame; +static int g_stack_frame_used; +static int g_stack_fsz; +static int g_ida_func_attr; +static int g_allow_regfunc; +static int g_quiet_pp; +static int g_header_mode; + #define ferr(op_, fmt, ...) do { \ - printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \ + printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \ dump_op(op_), ##__VA_ARGS__); \ + fcloseall(); \ exit(1); \ } while (0) +#define fnote(op_, fmt, ...) \ + printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \ + dump_op(op_), ##__VA_ARGS__) -#define MAX_REGS 8 +#define ferr_assert(op_, cond) do { \ + if (!(cond)) ferr(op_, "assertion '%s' failed on ln :%d\n", #cond, \ + __LINE__); \ +} while (0) -const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" }; +const char *regs_r32[] = { + "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp", + // not r32, but list here for easy parsing and printing + "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7", +}; 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" }; @@ -167,6 +276,11 @@ enum parsed_flag_op { PFO_LE, // e ZF=1||SF!=OF }; +#define PFOB_O (1 << PFO_O) +#define PFOB_C (1 << PFO_C) +#define PFOB_Z (1 << PFO_Z) +#define PFOB_S (1 << PFO_S) + static const char *parsed_flag_op_names[] = { "o", "c", "z", "be", "s", "p", "l", "le" }; @@ -182,17 +296,38 @@ static int char_array_i(const char *array[], size_t len, const char *s) return -1; } -static void printf_number(char *buf, size_t buf_size, long number) +static void printf_number(char *buf, size_t buf_size, + unsigned long number) { // output in C-friendly form snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number); } +static int check_segment_prefix(const char *s) +{ + if (s[0] == 0 || s[1] != 's' || s[2] != ':') + return 0; + + switch (s[0]) { + case 'c': return 1; + case 'd': return 2; + case 's': return 3; + case 'e': return 4; + case 'f': return 5; + case 'g': return 6; + default: return 0; + } +} + 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 >= 8) { + *reg_lmod = OPLM_QWORD; + return reg; + } if (reg >= 0) { *reg_lmod = OPLM_DWORD; return reg; @@ -216,36 +351,6 @@ static int parse_reg(enum opr_lenmod *reg_lmod, const char *s) 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; @@ -269,8 +374,8 @@ static int parse_indmode(char *name, int *regmask, int need_c_cvt) s++; *d = 0; - // skip 'ds:' prefix - if (!strncmp(s, "ds:", 3)) + // skip '?s:' prefixes + if (check_segment_prefix(s)) s += 3; s = next_idt(w, sizeof(w), s); @@ -302,6 +407,102 @@ pass: return c; } +static int is_reg_in_str(const char *s) +{ + int i; + + if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3]))) + return 0; + + for (i = 0; i < ARRAY_SIZE(regs_r32); i++) + if (!strncmp(s, regs_r32[i], 3)) + return 1; + + return 0; +} + +static const char *parse_stack_el(const char *name, char *extra_reg, + int early_try) +{ + const char *p, *p2, *s; + char *endp = NULL; + char buf[32]; + long val; + int len; + + if (g_bp_frame || early_try) + { + p = name; + if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) { + p += 4; + if (extra_reg != NULL) { + strncpy(extra_reg, name, 3); + extra_reg[4] = 0; + } + } + + if (IS_START(p, "ebp+")) { + p += 4; + + p2 = strchr(p, '+'); + if (p2 != NULL && is_reg_in_str(p)) { + if (extra_reg != NULL) { + strncpy(extra_reg, p, p2 - p); + extra_reg[p2 - p] = 0; + } + p = p2 + 1; + } + + if (!('0' <= *p && *p <= '9')) + return p; + + return NULL; + } + } + + if (!IS_START(name, "esp+")) + return NULL; + + s = name + 4; + p = strchr(s, '+'); + if (p) { + if (is_reg_in_str(s)) { + if (extra_reg != NULL) { + strncpy(extra_reg, s, p - s); + extra_reg[p - s] = 0; + } + s = p + 1; + p = strchr(s, '+'); + if (p == NULL) + aerr("%s IDA stackvar not set?\n", __func__); + } + if (!('0' <= *s && *s <= '9')) { + aerr("%s IDA stackvar offset not set?\n", __func__); + return NULL; + } + if (s[0] == '0' && s[1] == 'x') + s += 2; + len = p - s; + if (len < sizeof(buf) - 1) { + strncpy(buf, s, len); + buf[len] = 0; + val = strtol(buf, &endp, 16); + if (val == 0 || *endp != 0) { + aerr("%s num parse fail for '%s'\n", __func__, buf); + return NULL; + } + } + p++; + } + else + p = name + 4; + + if ('0' <= *p && *p <= '9') + return NULL; + + return p; +} + static int guess_lmod_from_name(struct parsed_opr *opr) { if (!strncmp(opr->name, "dword_", 6)) { @@ -316,9 +517,98 @@ static int guess_lmod_from_name(struct parsed_opr *opr) opr->lmod = OPLM_BYTE; return 1; } + if (!strncmp(opr->name, "qword_", 6)) { + opr->lmod = OPLM_QWORD; + return 1; + } + return 0; +} + +static int guess_lmod_from_c_type(enum opr_lenmod *lmod, + const struct parsed_type *c_type) +{ + static const char *dword_types[] = { + "int", "_DWORD", "UINT_PTR", "DWORD", + "WPARAM", "LPARAM", "UINT", "__int32", + "LONG", "HIMC", "BOOL", "size_t", + "float", + }; + static const char *word_types[] = { + "uint16_t", "int16_t", "_WORD", "WORD", + "unsigned __int16", "__int16", + }; + static const char *byte_types[] = { + "uint8_t", "int8_t", "char", + "unsigned __int8", "__int8", "BYTE", "_BYTE", + "CHAR", "_UNKNOWN", + // structures.. deal the same as with _UNKNOWN for now + "CRITICAL_SECTION", + }; + const char *n; + int i; + + if (c_type->is_ptr) { + *lmod = OPLM_DWORD; + return 1; + } + + n = skip_type_mod(c_type->name); + + for (i = 0; i < ARRAY_SIZE(dword_types); i++) { + if (IS(n, dword_types[i])) { + *lmod = OPLM_DWORD; + return 1; + } + } + + for (i = 0; i < ARRAY_SIZE(word_types); i++) { + if (IS(n, word_types[i])) { + *lmod = OPLM_WORD; + return 1; + } + } + + for (i = 0; i < ARRAY_SIZE(byte_types); i++) { + if (IS(n, byte_types[i])) { + *lmod = OPLM_BYTE; + return 1; + } + } + return 0; } +static char *default_cast_to(char *buf, size_t buf_size, + struct parsed_opr *opr) +{ + buf[0] = 0; + + if (!opr->is_ptr) + return buf; + if (opr->pp == NULL || opr->pp->type.name == NULL + || opr->pp->is_fptr) + { + snprintf(buf, buf_size, "%s", "(void *)"); + return buf; + } + + snprintf(buf, buf_size, "(%s)", opr->pp->type.name); + return buf; +} + +static enum opr_type lmod_from_directive(const char *d) +{ + if (IS(d, "dd")) + return OPLM_DWORD; + else if (IS(d, "dw")) + return OPLM_WORD; + else if (IS(d, "db")) + return OPLM_BYTE; + + aerr("unhandled directive: '%s'\n", d); + return OPLM_UNSPEC; +} + static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod, int *regmask) { @@ -328,71 +618,113 @@ static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod, *regmask |= 1 << reg; } -static struct parsed_equ *equ_find(struct parsed_op *po, const char *name); +static struct parsed_equ *equ_find(struct parsed_op *po, const char *name, + int *extra_offs); static int parse_operand(struct parsed_opr *opr, int *regmask, int *regmask_indirect, - char words[16][256], int wordc, int w, unsigned int op_flags) + char words[16][256], int wordc, int w, unsigned int op_flags) { + const struct parsed_proto *pp = NULL; enum opr_lenmod tmplmod; + unsigned long number; + char buf[256]; int ret, len; - long number; + int wordc_in; + char *p; 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] == ',') { - words[i][len - 1] = 0; - wordc = i + 1; - break; - } - } - - if (op_flags & OPF_JMP) { - const char *label; - - if (wordc - w == 3 && IS(words[w + 1], "ptr")) - label = words[w + 2]; - else if (wordc - w == 2 && IS(words[w], "short")) - label = words[w + 1]; - else if (wordc - w == 1) - label = words[w]; - else - aerr("jump parse error"); - - opr->type = OPT_LABEL; - strcpy(opr->name, label); - return wordc; - } - - if (wordc - w >= 3) { - if (IS(words[w + 1], "ptr")) { - if (IS(words[w], "dword")) - opr->lmod = OPLM_DWORD; - else if (IS(words[w], "word")) - opr->lmod = OPLM_WORD; - else if (IS(words[w], "byte")) - opr->lmod = OPLM_BYTE; - else - aerr("type parsing failed\n"); - w += 2; - } - } - - if (wordc - w == 2 && IS(words[w], "offset")) { - opr->type = OPT_OFFSET; - strcpy(opr->name, words[w + 1]); - return wordc; - } - - if (wordc - w != 1) + 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] == ',') { + words[i][len - 1] = 0; + wordc = i + 1; + break; + } + } + + wordc_in = wordc - w; + + if ((op_flags & OPF_JMP) && wordc_in > 0 + && !('0' <= words[w][0] && words[w][0] <= '9')) + { + const char *label = NULL; + + if (wordc_in == 3 && !strncmp(words[w], "near", 4) + && IS(words[w + 1], "ptr")) + label = words[w + 2]; + else if (wordc_in == 2 && IS(words[w], "short")) + label = words[w + 1]; + else if (wordc_in == 1 + && strchr(words[w], '[') == NULL + && parse_reg(&tmplmod, words[w]) < 0) + label = words[w]; + + if (label != NULL) { + opr->type = OPT_LABEL; + ret = check_segment_prefix(label); + if (ret != 0) { + if (ret >= 5) + aerr("fs/gs used\n"); + opr->had_ds = 1; + label += 3; + } + strcpy(opr->name, label); + return wordc; + } + } + + if (wordc_in >= 3) { + if (IS(words[w + 1], "ptr")) { + if (IS(words[w], "dword")) + opr->lmod = OPLM_DWORD; + else if (IS(words[w], "word")) + opr->lmod = OPLM_WORD; + else if (IS(words[w], "byte")) + opr->lmod = OPLM_BYTE; + else if (IS(words[w], "qword")) + opr->lmod = OPLM_QWORD; + else + aerr("type parsing failed\n"); + w += 2; + wordc_in = wordc - w; + } + } + + if (wordc_in == 2) { + if (IS(words[w], "offset")) { + opr->type = OPT_OFFSET; + opr->lmod = OPLM_DWORD; + strcpy(opr->name, words[w + 1]); + pp = proto_parse(g_fhdr, opr->name, 1); + goto do_label; + } + if (IS(words[w], "(offset")) { + p = strchr(words[w + 1], ')'); + if (p == NULL) + aerr("parse of bracketed offset failed\n"); + *p = 0; + opr->type = OPT_OFFSET; + strcpy(opr->name, words[w + 1]); + return wordc; + } + } + + if (wordc_in != 1) aerr("parse_operand 1 word expected\n"); + ret = check_segment_prefix(words[w]); + if (ret != 0) { + if (ret >= 5) + aerr("fs/gs used\n"); + opr->had_ds = 1; + memmove(words[w], words[w] + 3, strlen(words[w]) - 2); + } strcpy(opr->name, words[w]); if (words[w][0] == '[') { @@ -402,9 +734,11 @@ static int parse_operand(struct parsed_opr *opr, aerr("[] parse failure\n"); parse_indmode(opr->name, regmask_indirect, 1); - if (opr->lmod == OPLM_UNSPEC && !strncmp(opr->name, "ebp+", 4)) { + if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1)) + { // might be an equ - struct parsed_equ *eq = equ_find(NULL, opr->name + 4); + struct parsed_equ *eq = + equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i); if (eq) opr->lmod = eq->lmod; } @@ -412,11 +746,13 @@ static int parse_operand(struct parsed_opr *opr, } else if (strchr(words[w], '[')) { // label[reg] form + p = strchr(words[w], '['); opr->type = OPT_REGMEM; - if (opr->lmod == OPLM_UNSPEC) - guess_lmod_from_name(opr); - parse_indmode(strchr(words[w], '['), regmask_indirect, 0); - return wordc; + parse_indmode(p, regmask_indirect, 0); + strncpy(buf, words[w], p - words[w]); + buf[p - words[w]] = 0; + pp = proto_parse(g_fhdr, buf, 1); + goto do_label; } else if (('0' <= words[w][0] && words[w][0] <= '9') || words[w][0] == '-') @@ -436,30 +772,91 @@ static int parse_operand(struct parsed_opr *opr, // most likely var in data segment opr->type = OPT_LABEL; + pp = proto_parse(g_fhdr, opr->name, g_quiet_pp); + +do_label: + if (pp != NULL) { + if (pp->is_fptr || pp->is_func) { + opr->lmod = OPLM_DWORD; + opr->is_ptr = 1; + } + else { + tmplmod = OPLM_UNSPEC; + if (!guess_lmod_from_c_type(&tmplmod, &pp->type)) + anote("unhandled C type '%s' for '%s'\n", + pp->type.name, opr->name); + + if (opr->lmod == OPLM_UNSPEC) { + opr->lmod = tmplmod; + opr->type_from_var = 1; + } + else if (opr->lmod != tmplmod) { + opr->size_mismatch = 1; + if (tmplmod < opr->lmod) + opr->size_lt = 1; + } + opr->is_ptr = pp->type.is_ptr; + } + opr->is_array = pp->type.is_array; + } + opr->pp = pp; + 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; + unsigned int flags; +} pref_table[] = { + { "rep", OPF_REP }, + { "repe", OPF_REP|OPF_REPZ }, + { "repz", OPF_REP|OPF_REPZ }, + { "repne", OPF_REP|OPF_REPNZ }, + { "repnz", OPF_REP|OPF_REPNZ }, + { "lock", OPF_LOCK }, // ignored for now.. +}; + +#define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC) + static const struct { const char *name; enum op_op op; - unsigned int minopr; - unsigned int maxopr; + unsigned short minopr; + unsigned short maxopr; unsigned int flags; + unsigned char pfo; + unsigned char pfo_inv; } op_table[] = { + { "nop", OP_NOP, 0, 0, 0 }, { "push", OP_PUSH, 1, 1, 0 }, { "pop", OP_POP, 1, 1, OPF_DATA }, + { "leave",OP_LEAVE, 0, 0, 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 }, + { "xchg", OP_XCHG, 2, 2, OPF_DATA }, { "not", OP_NOT, 1, 1, OPF_DATA }, { "cdq", OP_CDQ, 0, 0, OPF_DATA }, + { "lodsb",OP_LODS, 0, 0, OPF_DATA }, + { "lodsw",OP_LODS, 0, 0, OPF_DATA }, + { "lodsd",OP_LODS, 0, 0, OPF_DATA }, + { "stosb",OP_STOS, 0, 0, OPF_DATA }, + { "stosw",OP_STOS, 0, 0, OPF_DATA }, + { "stosd",OP_STOS, 0, 0, OPF_DATA }, + { "movsb",OP_MOVS, 0, 0, OPF_DATA }, + { "movsw",OP_MOVS, 0, 0, OPF_DATA }, + { "movsd",OP_MOVS, 0, 0, OPF_DATA }, + { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS }, + { "std", OP_STD, 0, 0, OPF_DATA }, // special flag + { "cld", OP_CLD, 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 }, @@ -469,8 +866,14 @@ static const struct { { "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 }, + { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS }, + { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS }, + { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS }, + { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C }, + { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C }, + { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C }, + { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C }, + { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS }, { "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 }, @@ -480,102 +883,135 @@ static const struct { { "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|OPF_TAIL }, - { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS }, + { "retn", OP_RET, 0, 1, OPF_TAIL }, + { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS }, { "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 }, + { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP }, + { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1 + { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0 + { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1 + { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 + { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0 + { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 + { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 + { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1 + { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 + { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0 + { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 + { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1 + { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 + { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0 + { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 + { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1 + { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0 + { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1 + { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a + { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0 + { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b + { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF + { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c + { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF + { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d + { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF + { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e + { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF + { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f + { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 }, + { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 }, + { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 }, + { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 }, + { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 }, + { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 }, + { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 }, + { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 }, + { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 }, + { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 }, + { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 }, + { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 }, + { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 }, + { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 }, + { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 }, + { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 }, + { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 }, + { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 }, + { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 }, + { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 }, + { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 }, + { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 }, + { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 }, + { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 }, + { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 }, + { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 }, + { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 }, + { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 }, + { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 }, + // x87 + // mmx + { "emms", OP_EMMS, 0, 0, OPF_DATA }, + { "movq", OP_MOV, 2, 2, OPF_DATA }, + // must be last + { "ud2", OP_UD2 }, }; static void parse_op(struct parsed_op *op, char words[16][256], int wordc) { + enum opr_lenmod lmod = OPLM_UNSPEC; + int prefix_flags = 0; int regmask_ind; int regmask; + int op_w = 0; int opr = 0; - int w = 1; + int w = 0; int i; + for (i = 0; i < ARRAY_SIZE(pref_table); i++) { + if (IS(words[w], pref_table[i].name)) { + prefix_flags = pref_table[i].flags; + break; + } + } + + if (prefix_flags) { + if (wordc <= 1) + aerr("lone prefix: '%s'\n", words[0]); + w++; + } + + op_w = w; for (i = 0; i < ARRAY_SIZE(op_table); i++) { - if (IS(words[0], op_table[i].name)) + if (IS(words[w], op_table[i].name)) break; } - if (i == ARRAY_SIZE(op_table)) - aerr("unhandled op: '%s'\n", words[0]); + if (i == ARRAY_SIZE(op_table)) { + anote("unhandled op: '%s'\n", words[0]); + i--; // OP_UD2 + } + w++; op->op = op_table[i].op; - op->flags = op_table[i].flags; + op->flags = op_table[i].flags | prefix_flags; + op->pfo = op_table[i].pfo; + op->pfo_inv = op_table[i].pfo_inv; op->regmask_src = op->regmask_dst = 0; + op->asmln = asmln; + + if (op->op == OP_UD2) + return; + + for (opr = 0; opr < op_table[i].maxopr; opr++) { + if (opr >= op_table[i].minopr && w >= wordc) + break; - 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); + else + op->regmask_src |= regmask; + op->regmask_src |= regmask_ind; } if (w < wordc) @@ -587,22 +1023,109 @@ static void parse_op(struct parsed_op *op, char words[16][256], int wordc) if (!strncmp(op_table[i].name, "set", 3)) op->operand[0].lmod = OPLM_BYTE; - // ops with implicit argumets switch (op->op) { + // first operand is not dst + case OP_CMP: + case OP_TEST: + op->regmask_src |= op->regmask_dst; + op->regmask_dst = 0; + break; + + // first operand is src too + case OP_NOT: + case OP_ADD: + case OP_AND: + case OP_OR: + case OP_RCL: + case OP_RCR: + case OP_ADC: + case OP_INC: + case OP_DEC: + case OP_NEG: + // more below.. + op->regmask_src |= op->regmask_dst; + break; + + // special + case OP_XCHG: + op->regmask_src |= op->regmask_dst; + op->regmask_dst |= op->regmask_src; + goto check_align; + + case OP_SUB: + case OP_SBB: + case OP_XOR: + if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG + && op->operand[0].lmod == op->operand[1].lmod + && op->operand[0].reg == op->operand[1].reg + && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al.. + { + op->regmask_src = 0; + } + else + op->regmask_src |= op->regmask_dst; + break; + + // ops with implicit argumets 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; + case OP_LODS: + case OP_STOS: + case OP_SCAS: + if (op->operand_cnt != 0) + break; + if (words[op_w][4] == 'b') + lmod = OPLM_BYTE; + else if (words[op_w][4] == 'w') + lmod = OPLM_WORD; + else if (words[op_w][4] == 'd') + lmod = OPLM_DWORD; + op->operand_cnt = 3; + setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI, + lmod, &op->regmask_src); + setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src); + op->regmask_dst = op->regmask_src; + setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, + op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src); + break; + + case OP_MOVS: + case OP_CMPS: + if (op->operand_cnt != 0) + break; + if (words[op_w][4] == 'b') + lmod = OPLM_BYTE; + else if (words[op_w][4] == 'w') + lmod = OPLM_WORD; + else if (words[op_w][4] == 'd') + lmod = OPLM_DWORD; + op->operand_cnt = 3; + setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src); + setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src); + setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src); + op->regmask_dst = op->regmask_src; + break; + + case OP_JECXZ: + op->operand_cnt = 1; + op->regmask_src = 1 << xCX; + op->operand[0].type = OPT_REG; + op->operand[0].reg = xCX; + op->operand[0].lmod = OPLM_DWORD; + break; + case OP_IMUL: if (op->operand_cnt != 1) break; // fallthrough case OP_MUL: // singleop mul + op->regmask_src |= op->regmask_dst; 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; @@ -611,9 +1134,8 @@ static void parse_op(struct parsed_op *op, char words[16][256], int wordc) 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; + op->regmask_src |= op->regmask_dst; + op->regmask_dst = (1 << xDX) | (1 << xAX); if (op->operand[0].lmod == OPLM_UNSPEC) op->operand[0].lmod = OPLM_DWORD; break; @@ -621,21 +1143,85 @@ static void parse_op(struct parsed_op *op, char words[16][256], int wordc) case OP_SHL: case OP_SHR: case OP_SAR: + case OP_ROL: + case OP_ROR: + op->regmask_src |= op->regmask_dst; if (op->operand[1].lmod == OPLM_UNSPEC) op->operand[1].lmod = OPLM_BYTE; break; + case OP_SHRD: + op->regmask_src |= op->regmask_dst; + if (op->operand[2].lmod == OPLM_UNSPEC) + op->operand[2].lmod = OPLM_BYTE; + break; + + case OP_PUSH: + op->regmask_src |= op->regmask_dst; + op->regmask_dst = 0; + if (op->operand[0].lmod == OPLM_UNSPEC + && (op->operand[0].type == OPT_CONST + || op->operand[0].type == OPT_OFFSET + || op->operand[0].type == OPT_LABEL)) + op->operand[0].lmod = OPLM_DWORD; + break; + + // alignment + case OP_MOV: + check_align: + if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG + && op->operand[0].lmod == op->operand[1].lmod + && op->operand[0].reg == op->operand[1].reg + && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al.. + { + op->flags |= OPF_RMD; + op->regmask_src = op->regmask_dst = 0; + } + break; + + case OP_LEA: + if (op->operand[0].type == OPT_REG + && op->operand[1].type == OPT_REGMEM) + { + char buf[16]; + snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name); + if (IS(buf, op->operand[1].name)) + op->flags |= OPF_RMD; + } + break; + + case OP_CALL: + // trashed regs must be explicitly detected later + op->regmask_dst = 0; + break; + + case OP_LEAVE: + op->regmask_dst = (1 << xBP) | (1 << xSP); + op->regmask_src = 1 << xBP; + break; + default: break; } } -static const char *op_name(enum op_op op) +static const char *op_name(struct parsed_op *po) { + static char buf[16]; + char *p; int i; + if (po->op == OP_JCC || po->op == OP_SCC) { + p = buf; + *p++ = (po->op == OP_JCC) ? 'j' : 's'; + if (po->pfo_inv) + *p++ = 'n'; + strcpy(p, parsed_flag_op_names[po->pfo]); + return buf; + } + for (i = 0; i < ARRAY_SIZE(op_table); i++) - if (op_table[i].op == op) + if (op_table[i].op == po->op) return op_table[i].name; return "???"; @@ -648,7 +1234,10 @@ static const char *dump_op(struct parsed_op *po) char *p = out; int i; - snprintf(out, sizeof(out), "%s", op_name(po->op)); + if (po == NULL) + return "???"; + + snprintf(out, sizeof(out), "%s", op_name(po)); for (i = 0; i < po->operand_cnt; i++) { p += strlen(p); if (i > 0) @@ -661,35 +1250,195 @@ static const char *dump_op(struct parsed_op *po) return out; } -static const char *opr_name(struct parsed_op *po, int opr_num) +static const char *lmod_type_u(struct parsed_op *po, + enum opr_lenmod lmod) { - if (opr_num >= po->operand_cnt) - ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt); - return po->operand[opr_num].name; + switch (lmod) { + case OPLM_QWORD: + return "u64"; + case OPLM_DWORD: + return "u32"; + case OPLM_WORD: + return "u16"; + case OPLM_BYTE: + return "u8"; + default: + ferr(po, "invalid lmod: %d\n", lmod); + return "(_invalid_)"; + } } -static unsigned int opr_const(struct parsed_op *po, int opr_num) +static const char *lmod_cast_u(struct parsed_op *po, + enum opr_lenmod lmod) { - 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; + switch (lmod) { + case OPLM_QWORD: + return ""; + 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 *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr) +static const char *lmod_cast_u_ptr(struct parsed_op *po, + enum opr_lenmod lmod) { - if ((unsigned int)popr->reg >= MAX_REGS) - ferr(po, "invalid reg: %d\n", popr->reg); - return regs_r32[popr->reg]; + switch (lmod) { + case OPLM_QWORD: + return "*(u64 *)"; + case OPLM_DWORD: + return "*(u32 *)"; + case OPLM_WORD: + return "*(u16 *)"; + case OPLM_BYTE: + return "*(u8 *)"; + default: + ferr(po, "invalid lmod: %d\n", lmod); + return "(_invalid_)"; + } } -static struct parsed_equ *equ_find(struct parsed_op *po, const char *name) +static const char *lmod_cast_s(struct parsed_op *po, + enum opr_lenmod lmod) { + switch (lmod) { + case OPLM_QWORD: + return "(s64)"; + case OPLM_DWORD: + return "(s32)"; + case OPLM_WORD: + return "(s16)"; + case OPLM_BYTE: + return "(s8)"; + default: + ferr(po, "%s: invalid lmod: %d\n", __func__, 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 int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod) +{ + switch (lmod) { + case OPLM_QWORD: + return 8; + case OPLM_DWORD: + return 4; + case OPLM_WORD: + return 2; + case OPLM_BYTE: + return 1; + default: + ferr(po, "%s: invalid lmod: %d\n", __func__, lmod); + return 0; + } +} + +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 >= ARRAY_SIZE(regs_r32)) + ferr(po, "invalid reg: %d\n", popr->reg); + return regs_r32[popr->reg]; +} + +// cast1 is the "final" cast +static const char *simplify_cast(const char *cast1, const char *cast2) +{ + static char buf[256]; + + if (cast1[0] == 0) + return cast2; + if (cast2[0] == 0) + return cast1; + if (IS(cast1, cast2)) + return cast1; + if (IS(cast1, "(s8)") && IS(cast2, "(u8)")) + return cast1; + if (IS(cast1, "(s16)") && IS(cast2, "(u16)")) + return cast1; + if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)")) + return cast2; + if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)")) + return cast2; + if (strchr(cast1, '*') && IS_START(cast2, "(u32)")) + return cast1; + + snprintf(buf, sizeof(buf), "%s%s", cast1, cast2); + return buf; +} + +static const char *simplify_cast_num(const char *cast, unsigned int val) +{ + if (IS(cast, "(u8)") && val < 0x100) + return ""; + if (IS(cast, "(s8)") && val < 0x80) + return ""; + if (IS(cast, "(u16)") && val < 0x10000) + return ""; + if (IS(cast, "(s16)") && val < 0x8000) + return ""; + if (IS(cast, "(s32)") && val < 0x80000000) + return ""; + + return cast; +} + +static struct parsed_equ *equ_find(struct parsed_op *po, const char *name, + int *extra_offs) +{ + const char *p; + char *endp; + int namelen; int i; + *extra_offs = 0; + namelen = strlen(name); + + p = strchr(name, '+'); + if (p != NULL) { + namelen = p - name; + if (namelen <= 0) + ferr(po, "equ parse failed for '%s'\n", name); + + if (IS_START(p, "0x")) + p += 2; + *extra_offs = strtol(p, &endp, 16); + if (*endp != 0) + ferr(po, "equ parse failed for '%s'\n", name); + } + for (i = 0; i < g_eqcnt; i++) - if (IS(g_eqs[i].name, name)) + if (strncmp(g_eqs[i].name, name, namelen) == 0 + && g_eqs[i].name[namelen] == 0) break; if (i >= g_eqcnt) { if (po != NULL) @@ -700,91 +1449,338 @@ static struct parsed_equ *equ_find(struct parsed_op *po, const char *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) +static int is_stack_access(struct parsed_op *po, + const struct parsed_opr *popr) { - const char *prefix = ""; + return (parse_stack_el(popr->name, NULL, 0) + || (g_bp_frame && !(po->flags & OPF_EBP_S) + && IS_START(popr->name, "ebp"))); +} + +static void parse_stack_access(struct parsed_op *po, + const char *name, char *ofs_reg, int *offset_out, + int *stack_ra_out, const char **bp_arg_out, int is_lea) +{ + const char *bp_arg = ""; + const char *p = NULL; struct parsed_equ *eq; + char *endp = NULL; + int stack_ra = 0; + int offset = 0; + + ofs_reg[0] = 0; + + if (IS_START(name, "ebp-") + || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9')) + { + p = name + 4; + if (IS_START(p, "0x")) + p += 2; + offset = strtoul(p, &endp, 16); + if (name[3] == '-') + offset = -offset; + if (*endp != 0) + ferr(po, "ebp- parse of '%s' failed\n", name); + } + else { + bp_arg = parse_stack_el(name, ofs_reg, 0); + snprintf(g_comment, sizeof(g_comment), "%s", bp_arg); + eq = equ_find(po, bp_arg, &offset); + if (eq == NULL) + ferr(po, "detected but missing eq\n"); + offset += eq->offset; + } + + if (!strncmp(name, "ebp", 3)) + stack_ra = 4; + + // yes it sometimes LEAs ra for compares.. + if (!is_lea && ofs_reg[0] == 0 + && stack_ra <= offset && offset < stack_ra + 4) + { + ferr(po, "reference to ra? %d %d\n", offset, stack_ra); + } + + *offset_out = offset; + *stack_ra_out = stack_ra; + if (bp_arg_out) + *bp_arg_out = bp_arg; +} + +static int stack_frame_access(struct parsed_op *po, + struct parsed_opr *popr, char *buf, size_t buf_size, + const char *name, const char *cast, int is_src, int is_lea) +{ + enum opr_lenmod tmp_lmod = OPLM_UNSPEC; + const char *prefix = ""; + const char *bp_arg = NULL; + char ofs_reg[16] = { 0, }; int i, arg_i, arg_s; + int unaligned = 0; + int stack_ra = 0; + int offset = 0; + int retval = -1; int sf_ofs; + int lim; - snprintf(g_comment, sizeof(g_comment), "%s", bp_arg); + if (po->flags & OPF_EBP_S) + ferr(po, "stack_frame_access while ebp is scratch\n"); - eq = equ_find(po, bp_arg); + parse_stack_access(po, name, ofs_reg, &offset, + &stack_ra, &bp_arg, is_lea); - 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); + if (offset > stack_ra) + { + arg_i = (offset - stack_ra - 4) / 4; + if (arg_i < 0 || arg_i >= g_func_pp->argc_stack) + { + if (g_func_pp->is_vararg + && arg_i == g_func_pp->argc_stack && is_lea) + { + // should be va_list + if (cast[0] == 0) + cast = "(u32)"; + snprintf(buf, buf_size, "%sap", cast); + return -1; + } + ferr(po, "offset %d (%s,%d) doesn't map to any arg\n", + offset, bp_arg, arg_i); + } + if (ofs_reg[0] != 0) + ferr(po, "offset reg on arg access?\n"); - for (i = arg_s = 0; i < g_func_pp.argc; i++) { - if (g_func_pp.arg[i].reg != NULL) + 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) + 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); + popr->is_ptr = g_func_pp->arg[i].type.is_ptr; + retval = i; + + switch (popr->lmod) + { + case OPLM_BYTE: + if (is_lea) + ferr(po, "lea/byte to arg?\n"); + if (is_src && (offset & 3) == 0) + snprintf(buf, buf_size, "%sa%d", + simplify_cast(cast, "(u8)"), i + 1); + else + snprintf(buf, buf_size, "%sBYTE%d(a%d)", + cast, offset & 3, i + 1); + break; + + case OPLM_WORD: + if (is_lea) + ferr(po, "lea/word to arg?\n"); + if (offset & 1) { + unaligned = 1; + if (!is_src) { + if (offset & 2) + ferr(po, "problematic arg store\n"); + snprintf(buf, buf_size, "%s((char *)&a%d + 1)", + simplify_cast(cast, "*(u16 *)"), i + 1); + } + else + ferr(po, "unaligned arg word load\n"); + } + else if (is_src && (offset & 2) == 0) + snprintf(buf, buf_size, "%sa%d", + simplify_cast(cast, "(u16)"), i + 1); + else + snprintf(buf, buf_size, "%s%sWORD(a%d)", + cast, (offset & 2) ? "HI" : "LO", i + 1); + break; + + case OPLM_DWORD: + if (cast[0]) + prefix = cast; + else if (is_src) + prefix = "(u32)"; + + if (offset & 3) { + unaligned = 1; + if (is_lea) + snprintf(buf, buf_size, "(u32)&a%d + %d", + i + 1, offset & 3); + else if (!is_src) + ferr(po, "unaligned arg store\n"); + else { + // mov edx, [ebp+arg_4+2]; movsx ecx, dx + snprintf(buf, buf_size, "%s(a%d >> %d)", + prefix, i + 1, (offset & 3) * 8); + } + } + else { + snprintf(buf, buf_size, "%s%sa%d", + prefix, is_lea ? "&" : "", i + 1); + } + break; + + default: + ferr(po, "bp_arg bad lmod: %d\n", popr->lmod); + } + + if (unaligned) + snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg); + + // common problem + guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type); + if (tmp_lmod != OPLM_DWORD + && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod) + < lmod_bytes(po, popr->lmod) + (offset & 3)))) + { + ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n", + i + 1, offset, g_func_pp->arg[i].type.name); + } + // can't check this because msvc likes to reuse + // arg space for scratch.. + //if (popr->is_ptr && popr->lmod != OPLM_DWORD) + // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1); } - else { - if (g_bp_stack == 0) - ferr(po, "bp_stack access after it was not detected\n"); + else + { + if (g_stack_fsz == 0) + ferr(po, "stack var access without stackframe\n"); + g_stack_frame_used = 1; - sf_ofs = g_bp_stack + eq->offset; - if (sf_ofs < 0) - ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_bp_stack); + sf_ofs = g_stack_fsz + offset; + lim = (ofs_reg[0] != 0) ? -4 : 0; + if (offset > 0 || sf_ofs < lim) + ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz); if (is_lea) - prefix = "&"; + prefix = "(u32)&"; + else + prefix = cast; - switch (lmod) + switch (popr->lmod) { case OPLM_BYTE: - snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs); + snprintf(buf, buf_size, "%ssf.b[%d%s%s]", + prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg); break; + case OPLM_WORD: + if ((sf_ofs & 1) || ofs_reg[0] != 0) { + // known unaligned or possibly unaligned + strcat(g_comment, " unaligned"); + if (prefix[0] == 0) + prefix = "*(u16 *)&"; + snprintf(buf, buf_size, "%ssf.b[%d%s%s]", + prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg); + break; + } snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2); break; + case OPLM_DWORD: + if ((sf_ofs & 3) || ofs_reg[0] != 0) { + // known unaligned or possibly unaligned + strcat(g_comment, " unaligned"); + if (prefix[0] == 0) + prefix = "*(u32 *)&"; + snprintf(buf, buf_size, "%ssf.b[%d%s%s]", + prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg); + break; + } snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4); break; + default: - ferr(po, "bp_stack bad lmod: %d\n", lmod); + ferr(po, "bp_stack bad lmod: %d\n", popr->lmod); + } + } + + return retval; +} + +static void check_func_pp(struct parsed_op *po, + const struct parsed_proto *pp, const char *pfx) +{ + enum opr_lenmod tmp_lmod; + char buf[256]; + int ret, i; + + if (pp->argc_reg != 0) { + if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) { + pp_print(buf, sizeof(buf), pp); + ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf); + } + if (pp->argc_stack > 0 && pp->argc_reg != 2) + ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n", + pfx, pp->argc_reg, pp->argc_stack); + } + + // fptrs must use 32bit args, callsite might have no information and + // lack a cast to smaller types, which results in incorrectly masked + // args passed (callee may assume masked args, it does on ARM) + if (!pp->is_osinc) { + for (i = 0; i < pp->argc; i++) { + ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type); + if (ret && tmp_lmod != OPLM_DWORD) + ferr(po, "reference to %s with arg%d '%s'\n", pp->name, + i + 1, pp->arg[i].type.name); } } } +static const char *check_label_read_ref(struct parsed_op *po, + const char *name) +{ + const struct parsed_proto *pp; + + pp = proto_parse(g_fhdr, name, 0); + if (pp == NULL) + ferr(po, "proto_parse failed for ref '%s'\n", name); + + if (pp->is_func) + check_func_pp(po, pp, "ref"); + + return pp->name; +} + static char *out_src_opr(char *buf, size_t buf_size, - struct parsed_op *po, struct parsed_opr *popr, int is_lea) + struct parsed_op *po, struct parsed_opr *popr, const char *cast, + int is_lea) { - const char *cast = ""; char tmp1[256], tmp2[256]; char expr[256]; + const char *name; + char *p; int ret; + if (cast == NULL) + cast = ""; + switch (popr->type) { case OPT_REG: if (is_lea) ferr(po, "lea from reg?\n"); switch (popr->lmod) { + case OPLM_QWORD: + snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr)); + break; case OPLM_DWORD: - snprintf(buf, buf_size, "%s", opr_reg_p(po, popr)); + snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr)); break; case OPLM_WORD: - snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr)); + snprintf(buf, buf_size, "%s%s", + simplify_cast(cast, "(u16)"), 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)); + snprintf(buf, buf_size, "%s(%s >> 8)", + simplify_cast(cast, "(u8)"), opr_reg_p(po, popr)); else - snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr)); + snprintf(buf, buf_size, "%s%s", + simplify_cast(cast, "(u8)"), opr_reg_p(po, popr)); break; default: ferr(po, "invalid src lmod: %d\n", popr->lmod); @@ -792,9 +1788,9 @@ static char *out_src_opr(char *buf, size_t buf_size, 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); + if (is_stack_access(po, popr)) { + stack_frame_access(po, popr, buf, buf_size, + popr->name, cast, 1, is_lea); break; } @@ -804,7 +1800,15 @@ static char *out_src_opr(char *buf, size_t buf_size, 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); + if (tmp1[0] == '(') { + // (off_4FFF50+3)[eax] + p = strchr(tmp1 + 1, ')'); + if (p == NULL || p[1] != 0) + ferr(po, "parse failure (2) for '%s'\n", expr); + *p = 0; + memmove(tmp1, tmp1 + 1, strlen(tmp1)); + } + snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2); } // XXX: do we need more parsing? @@ -813,40 +1817,45 @@ static char *out_src_opr(char *buf, size_t buf_size, 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); + snprintf(buf, buf_size, "%s(%s)", + simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr); break; case OPT_LABEL: + name = check_label_read_ref(po, popr->name); + if (cast[0] == 0 && popr->is_ptr) + cast = "(u32)"; + if (is_lea) - snprintf(buf, buf_size, "(u32)&%s", popr->name); + snprintf(buf, buf_size, "(u32)&%s", name); + else if (popr->size_lt) + snprintf(buf, buf_size, "%s%s%s%s", cast, + lmod_cast_u_ptr(po, popr->lmod), + popr->is_array ? "" : "&", name); else - snprintf(buf, buf_size, "(u32)%s", popr->name); + snprintf(buf, buf_size, "%s%s%s", cast, name, + popr->is_array ? "[0]" : ""); break; case OPT_OFFSET: + name = check_label_read_ref(po, popr->name); + if (cast[0] == 0) + cast = "(u32)"; if (is_lea) ferr(po, "lea an offset?\n"); - snprintf(buf, buf_size, "(u32)&%s", popr->name); + snprintf(buf, buf_size, "%s&%s", cast, name); break; case OPT_CONST: if (is_lea) ferr(po, "lea from const?\n"); - printf_number(buf, buf_size, popr->val); + printf_number(tmp1, sizeof(tmp1), popr->val); + if (popr->val == 0 && strchr(cast, '*')) + snprintf(buf, buf_size, "NULL"); + else + snprintf(buf, buf_size, "%s%s", + simplify_cast_num(cast, popr->val), tmp1); break; default: @@ -856,12 +1865,16 @@ static char *out_src_opr(char *buf, size_t buf_size, return buf; } +// note: may set is_ptr (we find that out late for ebp frame..) 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_QWORD: + snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr)); + break; case OPLM_DWORD: snprintf(buf, buf_size, "%s", opr_reg_p(po, popr)); break; @@ -882,13 +1895,23 @@ static char *out_dst_opr(char *buf, size_t buf_size, 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); + if (is_stack_access(po, popr)) { + stack_frame_access(po, popr, buf, buf_size, + popr->name, "", 0, 0); break; } - return out_src_opr(buf, buf_size, po, popr, 0); + return out_src_opr(buf, buf_size, po, popr, NULL, 0); + + case OPT_LABEL: + if (popr->size_mismatch) + snprintf(buf, buf_size, "%s%s%s", + lmod_cast_u_ptr(po, popr->lmod), + popr->is_array ? "" : "&", popr->name); + else + snprintf(buf, buf_size, "%s%s", popr->name, + popr->is_array ? "[0]" : ""); + break; default: ferr(po, "invalid dst type: %d\n", popr->type); @@ -897,106 +1920,14 @@ static char *out_dst_opr(char *buf, size_t buf_size, 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) +static char *out_src_opr_u32(char *buf, size_t buf_size, + struct parsed_op *po, struct parsed_opr *popr) { - 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; - } + return out_src_opr(buf, buf_size, po, popr, NULL, 0); } static void out_test_for_cc(char *buf, size_t buf_size, - struct parsed_op *po, enum parsed_flag_op pfo, int is_neg, + struct parsed_op *po, enum parsed_flag_op pfo, int is_inv, enum opr_lenmod lmod, const char *expr) { const char *cast, *scast; @@ -1008,18 +1939,18 @@ static void out_test_for_cc(char *buf, size_t buf_size, case PFO_Z: case PFO_BE: // CF=1||ZF=1; CF=0 snprintf(buf, buf_size, "(%s%s %s 0)", - cast, expr, is_neg ? "!=" : "=="); + cast, expr, is_inv ? "!=" : "=="); break; case PFO_S: case PFO_L: // SF!=OF; OF=0 snprintf(buf, buf_size, "(%s%s %s 0)", - scast, expr, is_neg ? ">=" : "<"); + scast, expr, is_inv ? ">=" : "<"); break; case PFO_LE: // ZF=1||SF!=OF; OF=0 snprintf(buf, buf_size, "(%s%s %s 0)", - scast, expr, is_neg ? ">" : "<="); + scast, expr, is_inv ? ">" : "<="); break; default: @@ -1028,75 +1959,110 @@ static void out_test_for_cc(char *buf, size_t buf_size, } 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) + struct parsed_op *po, enum parsed_flag_op pfo, int is_inv) { - const char *cast, *scast; + const char *cast, *scast, *cast_use; + char buf1[256], buf2[256]; + enum opr_lenmod lmod; + + if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod) + ferr(po, "%s: lmod mismatch: %d %d\n", __func__, + po->operand[0].lmod, po->operand[1].lmod); + lmod = po->operand[0].lmod; cast = lmod_cast_u(po, lmod); scast = lmod_cast_s(po, lmod); + switch (pfo) { + case PFO_C: + case PFO_Z: + case PFO_BE: // !a + cast_use = cast; + break; + + case PFO_S: + case PFO_L: // !ge + case PFO_LE: + cast_use = scast; + break; + + default: + ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo); + } + + out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0); + if (po->op == OP_DEC) + snprintf(buf2, sizeof(buf2), "1"); + else + out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0); + 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); + snprintf(buf, buf_size, "(%s %s %s)", + buf1, is_inv ? ">=" : "<", buf2); break; case PFO_Z: - snprintf(buf, buf_size, "(%s%s %s %s%s)", - cast, expr1, is_neg ? "!=" : "==", cast, expr2); + snprintf(buf, buf_size, "(%s %s %s)", + buf1, is_inv ? "!=" : "==", buf2); 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); + snprintf(buf, buf_size, "(%s %s %s)", + buf1, is_inv ? ">" : "<=", buf2); + + // annoying case + if (is_inv && lmod == OPLM_BYTE + && po->operand[1].type == OPT_CONST + && po->operand[1].val == 0xff) + { + snprintf(g_comment, sizeof(g_comment), "if %s", buf); + snprintf(buf, buf_size, "(0)"); + } break; // note: must be signed compare case PFO_S: snprintf(buf, buf_size, "(%s(%s - %s) %s 0)", - scast, expr1, expr2, is_neg ? ">=" : "<"); + scast, buf1, buf2, is_inv ? ">=" : "<"); break; case PFO_L: // !ge - snprintf(buf, buf_size, "(%s%s %s %s%s)", - scast, expr1, is_neg ? ">=" : "<", scast, expr2); + snprintf(buf, buf_size, "(%s %s %s)", + buf1, is_inv ? ">=" : "<", buf2); break; - case PFO_LE: - snprintf(buf, buf_size, "(%s%s %s %s%s)", - scast, expr1, is_neg ? ">" : "<=", scast, expr2); + case PFO_LE: // !g + snprintf(buf, buf_size, "(%s %s %s)", + buf1, is_inv ? ">" : "<=", buf2); break; default: - ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo); + break; } } static void out_cmp_test(char *buf, size_t buf_size, - struct parsed_op *po, enum parsed_flag_op pfo, int is_neg) + struct parsed_op *po, enum parsed_flag_op pfo, int is_inv) { 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); + out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]); } else { - out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0); - out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0); + out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]); + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]); snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2); } - out_test_for_cc(buf, buf_size, po, pfo, is_neg, + out_test_for_cc(buf, buf_size, po, pfo, is_inv, 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); + out_cmp_for_cc(buf, buf_size, po, pfo, is_inv); } else ferr(po, "%s: unhandled op: %d\n", __func__, po->op); @@ -1112,8 +2078,23 @@ static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1, 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); + else if (popr1->lmod != popr2->lmod) { + if (popr1->type_from_var) { + popr1->size_mismatch = 1; + if (popr1->lmod < popr2->lmod) + popr1->size_lt = 1; + popr1->lmod = popr2->lmod; + } + else if (popr2->type_from_var) { + popr2->size_mismatch = 1; + if (popr2->lmod < popr1->lmod) + popr2->size_lt = 1; + popr2->lmod = popr1->lmod; + } + else + ferr(po, "conflicting lmods: %d vs %d\n", + popr1->lmod, popr2->lmod); + } } static const char *op_to_c(struct parsed_op *po) @@ -1144,11 +2125,25 @@ static const char *op_to_c(struct parsed_op *po) } } +static void op_set_clear_flag(struct parsed_op *po, + enum op_flags flag_set, enum op_flags flag_clear) +{ + po->flags |= flag_set; + po->flags &= ~flag_clear; +} + +// last op in stream - unconditional branch or ret +#define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \ + || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \ + && ops[_i].op != OP_CALL)) + static int scan_for_pop(int i, int opcnt, const char *reg, - int magic, int do_patch) + int magic, int depth, int *maxdepth, int do_flags) { + const struct parsed_proto *pp; struct parsed_op *po; int ret = 0; + int j; for (; i < opcnt; i++) { po = &ops[i]; @@ -1156,20 +2151,40 @@ static int scan_for_pop(int i, int opcnt, const char *reg, break; // already checked po->cc_scratch = magic; - if (po->flags & OPF_TAIL) + if (po->flags & OPF_TAIL) { + if (po->op == OP_CALL) { + pp = proto_parse(g_fhdr, po->operand[0].name, g_quiet_pp); + if (pp != NULL && pp->is_noreturn) + // no stack cleanup for noreturn + return ret; + } return -1; // deadend + } - if (po->flags & OPF_RMD) + if ((po->flags & OPF_RMD) + || (po->op == OP_PUSH && po->p_argnum != 0)) // arg push continue; if ((po->flags & OPF_JMP) && po->op != OP_CALL) { + if (po->btj != NULL) { + // jumptable + for (j = 0; j < po->btj->count; j++) { + ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic, + depth, maxdepth, do_flags); + if (ret < 0) + return ret; // dead end + } + return ret; + } + if (po->bt_i < 0) { ferr(po, "dead branch\n"); return -1; } - if (po->flags & OPF_CC) { - ret |= scan_for_pop(po->bt_i, opcnt, reg, magic, do_patch); + if (po->flags & OPF_CJMP) { + ret |= scan_for_pop(po->bt_i, opcnt, reg, magic, + depth, maxdepth, do_flags); if (ret < 0) return ret; // dead end } @@ -1179,12 +2194,31 @@ static int scan_for_pop(int i, int opcnt, const char *reg, continue; } - if (po->op == OP_POP && po->operand[0].type == OPT_REG + if ((po->op == OP_POP || po->op == OP_PUSH) + && po->operand[0].type == OPT_REG && IS(po->operand[0].name, reg)) { - if (do_patch) - po->flags |= OPF_RMD; - return 1; + if (po->op == OP_PUSH && !(po->flags & OPF_FARGNR)) { + depth++; + if (depth > *maxdepth) + *maxdepth = depth; + if (do_flags) + op_set_clear_flag(po, OPF_RSAVE, OPF_RMD); + } + else if (po->op == OP_POP) { + if (depth == 0) { + if (do_flags) + op_set_clear_flag(po, OPF_RMD, OPF_RSAVE); + return 1; + } + else { + depth--; + if (depth < 0) // should not happen + ferr(po, "fail with depth\n"); + if (do_flags) + op_set_clear_flag(po, OPF_RSAVE, OPF_RMD); + } + } } } @@ -1192,7 +2226,8 @@ static int scan_for_pop(int i, int opcnt, const char *reg, } // 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) +static int scan_for_pop_ret(int i, int opcnt, const char *reg, + int flag_set) { int found = 0; int j; @@ -1211,12 +2246,11 @@ static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch) && IS(ops[j].operand[0].name, reg)) { found = 1; - if (do_patch) - ops[j].flags |= OPF_RMD; + ops[j].flags |= flag_set; break; } - if (g_labels[j][0] != 0) + if (g_labels[j] != NULL) return -1; } } @@ -1224,18 +2258,97 @@ static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch) return found ? 0 : -1; } -// is operand 'opr modified' by parsed_op 'po'? +// XXX: merge with scan_for_pop? +static void scan_for_pop_const(int i, int opcnt) +{ + int j; + + for (j = i + 1; j < opcnt; j++) { + if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE)) + || ops[j].op == OP_PUSH || g_labels[i] != NULL) + { + break; + } + + if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP) + { + ops[i].flags |= OPF_RMD; + ops[j].datap = &ops[i]; + break; + } + } +} + +static void scan_propagate_df(int i, int opcnt) +{ + struct parsed_op *po = &ops[i]; + int j; + + for (; i < opcnt; i++) { + po = &ops[i]; + if (po->flags & OPF_DF) + return; // already resolved + po->flags |= OPF_DF; + + if (po->op == OP_CALL) + ferr(po, "call with DF set?\n"); + + if (po->flags & OPF_JMP) { + if (po->btj != NULL) { + // jumptable + for (j = 0; j < po->btj->count; j++) + scan_propagate_df(po->btj->d[j].bt_i, opcnt); + return; + } + + if (po->bt_i < 0) { + ferr(po, "dead branch\n"); + return; + } + + if (po->flags & OPF_CJMP) + scan_propagate_df(po->bt_i, opcnt); + else + i = po->bt_i - 1; + continue; + } + + if (po->flags & OPF_TAIL) + break; + + if (po->op == OP_CLD) { + po->flags |= OPF_RMD; + return; + } + } + + ferr(po, "missing DF clear?\n"); +} + +// is operand 'opr' modified by parsed_op 'po'? static int is_opr_modified(const struct parsed_opr *opr, const struct parsed_op *po) { + int mask; + 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; + if (opr->type == OPT_REG) { + if (po->op == OP_CALL) { + mask = (1 << xAX) | (1 << xCX) | (1 << xDX); + if ((1 << opr->reg) & mask) + return 1; + else + return 0; + } + + if (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); @@ -1243,14 +2356,28 @@ static int is_opr_modified(const struct parsed_opr *opr, // 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) + const struct parsed_op *po, int c_mode) { + int mask; int i; if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA)) return 0; - if (po_test->regmask_src & po->regmask_dst) + if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST) + return 0; + + if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst) + return 1; + + // in reality, it can wreck any register, but in decompiled C + // version it can only overwrite eax or edx:eax + mask = (1 << xAX) | (1 << xDX); + if (!c_mode) + mask |= 1 << xCX; + + if (po->op == OP_CALL + && ((po_test->regmask_src | po_test->regmask_dst) & mask)) return 1; for (i = 0; i < po_test->operand_cnt; i++) @@ -1260,26 +2387,81 @@ static int is_any_opr_modified(const struct parsed_op *po_test, 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) +// scan for any po_test operand modification in range given +static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt, + int c_mode) { + if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST) + return -1; + for (; i < opcnt; i++) { - if (is_any_opr_modified(po_test, &ops[i])) + if (is_any_opr_modified(po_test, &ops[i], c_mode)) return i; } return -1; } -static int scan_for_flag_set(int i) +// scan for po_test operand[0] modification in range given +static int scan_for_mod_opr0(struct parsed_op *po_test, + int i, int opcnt) { - for (; i >= 0; i--) { - if (ops[i].flags & OPF_FLAGS) + for (; i < opcnt; i++) { + if (is_opr_modified(&po_test->operand[0], &ops[i])) return i; + } + + return -1; +} + +#define check_i(po, i) \ + if ((i) < 0) \ + ferr(po, "bad " #i ": %d\n", i) - if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC)) +static int scan_for_flag_set(int i, int magic, int *branched, + int *setters, int *setter_cnt) +{ + struct label_ref *lr; + int ret; + + while (i >= 0) { + if (ops[i].cc_scratch == magic) { + ferr(&ops[i], "%s looped\n", __func__); return -1; - if (g_labels[i][0] != 0) + } + ops[i].cc_scratch = magic; + + if (g_labels[i] != NULL) { + *branched = 1; + + lr = &g_label_refs[i]; + for (; lr->next; lr = lr->next) { + check_i(&ops[i], lr->i); + ret = scan_for_flag_set(lr->i, magic, + branched, setters, setter_cnt); + if (ret < 0) + return ret; + } + + check_i(&ops[i], lr->i); + if (i > 0 && LAST_OP(i - 1)) { + i = lr->i; + continue; + } + ret = scan_for_flag_set(lr->i, magic, + branched, setters, setter_cnt); + if (ret < 0) + return ret; + } + i--; + + if (ops[i].flags & OPF_FLAGS) { + setters[*setter_cnt] = i; + (*setter_cnt)++; + return 0; + } + + if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP) return -1; } @@ -1289,726 +2471,4091 @@ static int scan_for_flag_set(int i) // scan back for cdq, if anything modifies edx, fail static int scan_for_cdq_edx(int i) { - for (; i >= 0; i--) { + while (i >= 0) { + if (g_labels[i] != NULL) { + if (g_label_refs[i].next != NULL) + return -1; + if (i > 0 && LAST_OP(i - 1)) { + i = g_label_refs[i].i; + continue; + } + return -1; + } + 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; +} + +static int scan_for_reg_clear(int i, int reg) +{ + while (i >= 0) { + if (g_labels[i] != NULL) { + if (g_label_refs[i].next != NULL) + return -1; + if (i > 0 && LAST_OP(i - 1)) { + i = g_label_refs[i].i; + continue; + } + return -1; + } + i--; + + if (ops[i].op == OP_XOR + && ops[i].operand[0].lmod == OPLM_DWORD + && ops[i].operand[0].reg == ops[i].operand[1].reg + && ops[i].operand[0].reg == reg) + return i; + + if (ops[i].regmask_dst & (1 << reg)) return -1; } return -1; } -static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt) +// scan for positive, constant esp adjust +static int scan_for_esp_adjust(int i, int opcnt, + unsigned int adj_expect, int *adj, int *multipath) { - 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 need_mul_var = 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; + struct parsed_op *po; + int first_pop = -1; - g_bp_frame = g_bp_stack = 0; + *adj = *multipath = 0; - ret = proto_parse(fhdr, funcn, &g_func_pp); - if (ret) - ferr(ops, "proto_parse failed for '%s'\n", funcn); + for (; i < opcnt && *adj < adj_expect; i++) { + po = &ops[i]; - 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); + if (g_labels[i] != NULL) + *multipath = 1; + + if (po->op == OP_ADD && po->operand[0].reg == xSP) { + if (po->operand[1].type != OPT_CONST) + ferr(&ops[i], "non-const esp adjust?\n"); + *adj += po->operand[1].val; + if (*adj & 3) + ferr(&ops[i], "unaligned esp adjust: %x\n", *adj); + return i; + } + else if (po->op == OP_PUSH && !(po->flags & OPF_RMD)) { + //if (first_pop == -1) + // first_pop = -2; // none + *adj -= lmod_bytes(po, po->operand[0].lmod); + } + else if (po->op == OP_POP && !(po->flags & OPF_RMD)) { + if (po->datap != NULL) // in push/pop pair? + break; + // seems like msvc only uses 'pop ecx' for stack realignment.. + if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX) + break; + if (first_pop == -1 && *adj >= 0) + first_pop = i; + *adj += lmod_bytes(po, po->operand[0].lmod); + } + else if (po->flags & (OPF_JMP|OPF_TAIL)) { + if (po->op == OP_JMP && po->btj == NULL) { + i = po->bt_i - 1; + continue; + } + if (po->op != OP_CALL) + break; + if (po->operand[0].type != OPT_LABEL) + break; + if (po->pp != NULL && po->pp->is_stdcall) + break; + } } - fprintf(fout, ")\n{\n"); - // pass1: - // - handle ebp frame, remove ops related to it + if (first_pop >= 0) { + // probably 'pop ecx' was used.. + return first_pop; + } + + return -1; +} + +static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags) +{ + struct parsed_op *po; + int j; + + if (i < 0) + ferr(ops, "%s: followed bad branch?\n", __func__); + + for (; i < opcnt; i++) { + po = &ops[i]; + if (po->cc_scratch == magic) + return; + po->cc_scratch = magic; + po->flags |= flags; + + if ((po->flags & OPF_JMP) && po->op != OP_CALL) { + if (po->btj != NULL) { + // jumptable + for (j = 0; j < po->btj->count; j++) + scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags); + return; + } + + scan_fwd_set_flags(po->bt_i, opcnt, magic, flags); + if (!(po->flags & OPF_CJMP)) + return; + } + if (po->flags & OPF_TAIL) + return; + } +} + +static const struct parsed_proto *try_recover_pp( + struct parsed_op *po, const struct parsed_opr *opr, int *search_instead) +{ + const struct parsed_proto *pp = NULL; + char buf[256]; + char *p; + + // maybe an arg of g_func? + if (opr->type == OPT_REGMEM && is_stack_access(po, opr)) + { + char ofs_reg[16] = { 0, }; + int arg, arg_s, arg_i; + int stack_ra = 0; + int offset = 0; + + if (g_header_mode) + return NULL; + + parse_stack_access(po, opr->name, ofs_reg, + &offset, &stack_ra, NULL, 0); + if (ofs_reg[0] != 0) + ferr(po, "offset reg on arg access?\n"); + if (offset <= stack_ra) { + // search who set the stack var instead + if (search_instead != NULL) + *search_instead = 1; + return NULL; + } + + arg_i = (offset - stack_ra - 4) / 4; + for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) { + if (g_func_pp->arg[arg].reg != NULL) + continue; + if (arg_s == arg_i) + break; + arg_s++; + } + if (arg == g_func_pp->argc) + ferr(po, "stack arg %d not in prototype?\n", arg_i); + + pp = g_func_pp->arg[arg].fptr; + if (pp == NULL) + ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1); + check_func_pp(po, pp, "icall arg"); + } + else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) { + // label[index] + p = strchr(opr->name + 1, '['); + memcpy(buf, opr->name, p - opr->name); + buf[p - opr->name] = 0; + pp = proto_parse(g_fhdr, buf, g_quiet_pp); + } + else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) { + pp = proto_parse(g_fhdr, opr->name, g_quiet_pp); + if (pp == NULL) { + if (!g_header_mode) + ferr(po, "proto_parse failed for icall to '%s'\n", opr->name); + } + else + check_func_pp(po, pp, "reg-fptr ref"); + } + + return pp; +} + +static void scan_for_call_type(int i, const struct parsed_opr *opr, + int magic, const struct parsed_proto **pp_found, int *multi) +{ + const struct parsed_proto *pp = NULL; + struct parsed_op *po; + struct label_ref *lr; + + ops[i].cc_scratch = magic; + + while (1) { + if (g_labels[i] != NULL) { + lr = &g_label_refs[i]; + for (; lr != NULL; lr = lr->next) { + check_i(&ops[i], lr->i); + scan_for_call_type(lr->i, opr, magic, pp_found, multi); + } + if (i > 0 && LAST_OP(i - 1)) + return; + } + + i--; + if (i < 0) + break; + + if (ops[i].cc_scratch == magic) + return; + ops[i].cc_scratch = magic; + + if (!(ops[i].flags & OPF_DATA)) + continue; + if (!is_opr_modified(opr, &ops[i])) + continue; + if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) { + // most probably trashed by some processing + *pp_found = NULL; + return; + } + + opr = &ops[i].operand[1]; + if (opr->type != OPT_REG) + break; + } + + po = (i >= 0) ? &ops[i] : ops; + + if (i < 0) { + // reached the top - can only be an arg-reg + if (opr->type != OPT_REG) + return; + + for (i = 0; i < g_func_pp->argc; i++) { + if (g_func_pp->arg[i].reg == NULL) + continue; + if (IS(opr->name, g_func_pp->arg[i].reg)) + break; + } + if (i == g_func_pp->argc) + return; + pp = g_func_pp->arg[i].fptr; + if (pp == NULL) + ferr(po, "icall: arg%d (%s) is not a fptr?\n", + i + 1, g_func_pp->arg[i].reg); + check_func_pp(po, pp, "icall reg-arg"); + } + else + pp = try_recover_pp(po, opr, NULL); + + if (*pp_found != NULL && pp != NULL && *pp_found != pp) { + if (!IS((*pp_found)->ret_type.name, pp->ret_type.name) + || (*pp_found)->is_stdcall != pp->is_stdcall + || (*pp_found)->is_fptr != pp->is_fptr + || (*pp_found)->argc != pp->argc + || (*pp_found)->argc_reg != pp->argc_reg + || (*pp_found)->argc_stack != pp->argc_stack) + { + ferr(po, "icall: parsed_proto mismatch\n"); + } + *multi = 1; + } + if (pp != NULL) + *pp_found = pp; +} + +// early check for tail call or branch back +static int is_like_tailjmp(int j) +{ + if (!(ops[j].flags & OPF_JMP)) + return 0; + + if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds) + // probably local branch back.. + return 1; + if (ops[j].op == OP_CALL) + // probably noreturn call.. + return 1; + + return 0; +} + +static void scan_prologue_epilogue(int opcnt) +{ + int ecx_push = 0, esp_sub = 0; + int found; + int i, j, l; + 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")) { - int ecx_push = 0; - g_bp_frame = 1; ops[0].flags |= OPF_RMD; ops[1].flags |= OPF_RMD; + i = 2; if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) { - g_bp_stack = opr_const(&ops[2], 1); + g_stack_fsz = opr_const(&ops[2], 1); ops[2].flags |= OPF_RMD; + i++; } else { // another way msvc builds stack frame.. i = 2; while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) { - g_bp_stack += 4; + g_stack_fsz += 4; ops[i].flags |= OPF_RMD; ecx_push++; i++; } + // and another way.. + if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX + && ops[i].operand[1].type == OPT_CONST + && ops[i + 1].op == OP_CALL + && IS(opr_name(&ops[i + 1], 0), "__alloca_probe")) + { + g_stack_fsz += ops[i].operand[1].val; + ops[i].flags |= OPF_RMD; + i++; + ops[i].flags |= OPF_RMD; + i++; + } } - i = 2; + found = 0; 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")) + j = i - 1; + if (i == opcnt && (ops[j].flags & OPF_JMP)) { + if (found && is_like_tailjmp(j)) + break; + j--; + } + + if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp")) + || ops[j].op == OP_LEAVE) + { + ops[j].flags |= OPF_RMD; + } + else if (!(g_ida_func_attr & IDAFA_NORETURN)) + ferr(&ops[j], "'pop ebp' expected\n"); + + if (g_stack_fsz != 0) { + if (ops[j - 1].op == OP_MOV + && IS(opr_name(&ops[j - 1], 0), "esp") + && IS(opr_name(&ops[j - 1], 1), "ebp")) + { + ops[j - 1].flags |= OPF_RMD; + } + else if (ops[j].op != OP_LEAVE + && !(g_ida_func_attr & IDAFA_NORETURN)) { - ferr(&ops[i - 2], "esp restore expected\n"); + ferr(&ops[j - 1], "esp restore expected\n"); } - ops[i - 2].flags |= OPF_RMD; - if (ecx_push && ops[i - 3].op == OP_POP - && IS(opr_name(&ops[i - 3], 0), "ecx")) + if (ecx_push && ops[j - 2].op == OP_POP + && IS(opr_name(&ops[j - 2], 0), "ecx")) { - ferr(&ops[i - 3], "unexpected ecx pop\n"); + ferr(&ops[j - 2], "unexpected ecx pop\n"); } } + found = 1; i++; } while (i < opcnt); - } - // pass2: - // - resolve all branches - for (i = 0; i < opcnt; i++) { - po = &ops[i]; - po->bt_i = -1; + return; + } - if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP) - || po->op == OP_CALL || po->op == OP_RET) - continue; + // non-bp frame + i = 0; + while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) { + ops[i].flags |= OPF_RMD; + g_stack_fsz += 4; + ecx_push++; + i++; + } - for (j = 0; j < opcnt; j++) { - if (g_labels[j][0] && IS(po->operand[0].name, g_labels[j])) { - po->bt_i = j; - break; - } + for (; i < opcnt; i++) { + if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL))) + break; + if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP + && ops[i].operand[1].type == OPT_CONST) + { + g_stack_fsz = ops[i].operand[1].val; + ops[i].flags |= OPF_RMD; + esp_sub = 1; + break; } + } - if (po->bt_i == -1) { - // assume tail call - po->op = OP_CALL; - po->flags |= OPF_TAIL; + if (ecx_push && !esp_sub) { + // could actually be args for a call.. + for (; i < opcnt; i++) + if (ops[i].op != OP_PUSH) + break; + + if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) { + const struct parsed_proto *pp; + pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1); + j = pp ? pp->argc_stack : 0; + while (i > 0 && j > 0) { + i--; + if (ops[i].op == OP_PUSH) { + ops[i].flags &= ~OPF_RMD; + j--; + } + } + if (j != 0) + ferr(&ops[i], "unhandled prologue\n"); + + // recheck + i = g_stack_fsz = ecx_push = 0; + while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) { + if (!(ops[i].flags & OPF_RMD)) + break; + g_stack_fsz += 4; + ecx_push++; + i++; + } } } - // pass3: - // - 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; + found = 0; + if (ecx_push || esp_sub) + { + g_sp_frame = 1; - 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, i + 1, 0); - if (ret == 1) { - po->flags |= OPF_RMD; - scan_for_pop(i + 1, opcnt, po->operand[0].name, i + 2, 1); - 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; + i++; + do { + for (; i < opcnt; i++) + if (ops[i].op == OP_RET) + break; + j = i - 1; + if (i == opcnt && (ops[j].flags & OPF_JMP)) { + if (found && is_like_tailjmp(j)) + break; + j--; + } + + if (ecx_push > 0) { + for (l = 0; l < ecx_push; l++) { + if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx")) + /* pop ecx */; + else if (ops[j].op == OP_ADD + && IS(opr_name(&ops[j], 0), "esp") + && ops[j].operand[1].type == OPT_CONST) + { + /* add esp, N */ + ecx_push -= ops[j].operand[1].val / 4 - 1; + } + else + ferr(&ops[j], "'pop ecx' expected\n"); + + ops[j].flags |= OPF_RMD; + j--; } + if (l != ecx_push) + ferr(&ops[j], "epilogue scan failed\n"); + + found = 1; } - } - regmask |= po->regmask_src | po->regmask_dst; + if (esp_sub) { + if (ops[j].op != OP_ADD + || !IS(opr_name(&ops[j], 0), "esp") + || ops[j].operand[1].type != OPT_CONST + || ops[j].operand[1].val != g_stack_fsz) + ferr(&ops[j], "'add esp' expected\n"); - 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; + ops[j].flags |= OPF_RMD; + ops[j].operand[1].val = 0; // hack for stack arg scanner + found = 1; } - 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); + i++; + } while (i < opcnt); + } +} - for (arg = 0; arg < pp->argc; arg++) - if (pp->arg[arg].reg == NULL) - break; +static const struct parsed_proto *resolve_icall(int i, int opcnt, + int *multi_src) +{ + const struct parsed_proto *pp = NULL; + int search_advice = 0; - 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]); + *multi_src = 0; - 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; + switch (ops[i].operand[0].type) { + case OPT_REGMEM: + case OPT_LABEL: + case OPT_OFFSET: + pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice); + if (!search_advice) + break; + // fallthrough + default: + scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp, + multi_src); + break; + } - // next arg - for (arg++; arg < pp->argc; arg++) - if (pp->arg[arg].reg == NULL) - break; + return pp; +} + +// find an instruction that changed opr before i op +// *op_i must be set to -1 by caller +// *entry is set to 1 if one source is determined to be the caller +// returns 1 if found, *op_i is then set to origin +static int resolve_origin(int i, const struct parsed_opr *opr, + int magic, int *op_i, int *is_caller) +{ + struct label_ref *lr; + int ret = 0; + + if (ops[i].cc_scratch == magic) + return 0; + ops[i].cc_scratch = magic; + + while (1) { + if (g_labels[i] != NULL) { + lr = &g_label_refs[i]; + for (; lr != NULL; lr = lr->next) { + check_i(&ops[i], lr->i); + ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller); } - if (arg < pp->argc) - ferr(po, "arg collect failed for '%s'\n", tmpname); - po->datap = pp; + if (i > 0 && LAST_OP(i - 1)) + return ret; } - else if (po->op == OP_MUL - || (po->op == OP_IMUL && po->operand_cnt == 1)) - { - need_mul_var = 1; + + i--; + if (i < 0) { + if (is_caller != NULL) + *is_caller = 1; + return -1; } - } - // 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); + if (ops[i].cc_scratch == magic) + return 0; + ops[i].cc_scratch = magic; - // 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); + if (!(ops[i].flags & OPF_DATA)) + continue; + if (!is_opr_modified(opr, &ops[i])) + continue; - regmask_arg |= 1 << reg; - fprintf(fout, " u32 %s = (u32)a%d;\n", - g_func_pp.arg[i].reg, i + 1); - had_decl = 1; + if (*op_i >= 0) { + if (*op_i == i) + return 1; + // XXX: could check if the other op does the same + return -1; } + + *op_i = i; + return 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; +static int try_resolve_const(int i, const struct parsed_opr *opr, + int magic, unsigned int *val) +{ + int s_i = -1; + int ret; + + ret = resolve_origin(i, opr, magic, &s_i, NULL); + if (ret == 1) { + i = s_i; + if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST) + return -1; + + *val = ops[i].operand[1].val; + return 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; + return -1; +} + +static struct parsed_proto *process_call_early(int i, int opcnt, + int *adj_i) +{ + struct parsed_op *po = &ops[i]; + struct parsed_proto *pp; + int multipath = 0; + int adj = 0; + int ret; + + pp = po->pp; + if (pp == NULL || pp->is_vararg || pp->argc_reg != 0) + // leave for later + return NULL; + + // look for and make use of esp adjust + *adj_i = ret = -1; + if (!pp->is_stdcall && pp->argc_stack > 0) + ret = scan_for_esp_adjust(i + 1, opcnt, + pp->argc_stack * 4, &adj, &multipath); + if (ret >= 0) { + if (pp->argc_stack > adj / 4) + return NULL; + if (multipath) + return NULL; + if (ops[ret].op == OP_POP && adj != 4) + return NULL; + } + + *adj_i = ret; + return pp; +} + +static struct parsed_proto *process_call(int i, int opcnt) +{ + struct parsed_op *po = &ops[i]; + const struct parsed_proto *pp_c; + struct parsed_proto *pp; + const char *tmpname; + int adj = 0, multipath = 0; + int ret, arg; + + tmpname = opr_name(po, 0); + pp = po->pp; + if (pp == NULL) + { + // indirect call + pp_c = resolve_icall(i, opcnt, &multipath); + if (pp_c != NULL) { + if (!pp_c->is_func && !pp_c->is_fptr) + ferr(po, "call to non-func: %s\n", pp_c->name); + pp = proto_clone(pp_c); + my_assert_not(pp, NULL); + if (multipath) + // not resolved just to single func + pp->is_fptr = 1; + + switch (po->operand[0].type) { + case OPT_REG: + // we resolved this call and no longer need the register + po->regmask_src &= ~(1 << po->operand[0].reg); + break; + case OPT_REGMEM: + pp->is_fptr = 1; + break; + default: + break; } } - } + if (pp == NULL) { + pp = calloc(1, sizeof(*pp)); + my_assert_not(pp, NULL); - 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; + pp->is_fptr = 1; + ret = scan_for_esp_adjust(i + 1, opcnt, ~0, &adj, &multipath); + if (ret < 0 || adj < 0) { + if (!g_allow_regfunc) + ferr(po, "non-__cdecl indirect call unhandled yet\n"); + pp->is_unresolved = 1; + adj = 0; } + adj /= 4; + if (adj > ARRAY_SIZE(pp->arg)) + ferr(po, "esp adjust too large: %d\n", adj); + pp->ret_type.name = strdup("int"); + pp->argc = pp->argc_stack = adj; + for (arg = 0; arg < pp->argc; arg++) + pp->arg[arg].type.name = strdup("int"); } + po->pp = pp; } - 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; + // look for and make use of esp adjust + ret = -1; + if (!pp->is_stdcall && pp->argc_stack > 0) + ret = scan_for_esp_adjust(i + 1, opcnt, + pp->argc_stack * 4, &adj, &multipath); + if (ret >= 0) { + if (pp->is_vararg) { + if (adj / 4 < pp->argc_stack) { + fnote(po, "(this call)\n"); + ferr(&ops[ret], "esp adjust is too small: %x < %x\n", + adj, pp->argc_stack * 4); + } + // modify pp to make it have varargs as normal args + arg = pp->argc; + pp->argc += adj / 4 - pp->argc_stack; + for (; arg < pp->argc; arg++) { + pp->arg[arg].type.name = strdup("int"); + pp->argc_stack++; } + if (pp->argc > ARRAY_SIZE(pp->arg)) + ferr(po, "too many args for '%s'\n", tmpname); + } + if (pp->argc_stack > adj / 4) { + fnote(po, "(this call)\n"); + ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n", + tmpname, pp->argc_stack * 4, adj); } - } - if (need_mul_var) { - fprintf(fout, " u64 mul_tmp;\n"); - had_decl = 1; + ops[ret].flags |= OPF_RMD; + if (ops[ret].op == OP_POP) { + if (adj > 4) { + // deal with multi-pop stack adjust + adj = pp->argc_stack; + while (ops[ret].op == OP_POP && adj > 0 && ret < opcnt) { + ops[ret].flags |= OPF_RMD; + adj--; + ret++; + } + } + } + else if (!multipath) { + // a bit of a hack, but deals with use of + // single adj for multiple calls + ops[ret].operand[1].val -= pp->argc_stack * 4; + } } + else if (pp->is_vararg) + ferr(po, "missing esp_adjust for vararg func '%s'\n", + pp->name); - if (had_decl) - fprintf(fout, "\n"); + return pp; +} - // output ops - for (i = 0; i < opcnt; i++) +static int collect_call_args_early(struct parsed_op *po, int i, + struct parsed_proto *pp, int *regmask) +{ + int arg, ret; + int j; + + for (arg = 0; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + + // first see if it can be easily done + for (j = i; j > 0 && arg < pp->argc; ) { - if (g_labels[i][0] != 0) - fprintf(fout, "\n%s:\n", g_labels[i]); + if (g_labels[j] != NULL) + return -1; + j--; - po = &ops[i]; - if (po->flags & OPF_RMD) - continue; + if (ops[j].op == OP_CALL) + return -1; + else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP) + return -1; + else if (ops[j].op == OP_POP) + return -1; + else if (ops[j].flags & OPF_CJMP) + return -1; + else if (ops[j].op == OP_PUSH) { + if (ops[j].flags & (OPF_FARG|OPF_FARGNR)) + return -1; + ret = scan_for_mod(&ops[j], j + 1, i, 1); + if (ret >= 0) + return -1; - no_output = 0; + if (pp->arg[arg].type.is_va_list) + return -1; - #define assert_operand_cnt(n_) \ - if (po->operand_cnt != n_) \ - ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_) + // next arg + for (arg++; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + } + } - // conditional/flag using op? - if (po->flags & OPF_CC) + if (arg < pp->argc) + return -1; + + // now do it + for (arg = 0; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + + for (j = i; j > 0 && arg < pp->argc; ) + { + j--; + + if (ops[j].op == OP_PUSH) { - enum parsed_flag_op pfo; - int is_neg = 0; + ops[j].p_argnext = -1; + ferr_assert(&ops[j], pp->arg[arg].datap == NULL); + pp->arg[arg].datap = &ops[j]; - pfo = split_cond(po, po->op, &is_neg); + if (ops[j].operand[0].type == OPT_REG) + *regmask |= 1 << ops[j].operand[0].reg; - // 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); + ops[j].flags |= OPF_RMD | OPF_FARGNR | OPF_FARG; + ops[j].flags &= ~OPF_RSAVE; - // 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); + // next arg + for (arg++; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + } + } + + return 0; +} + +static int collect_call_args_r(struct parsed_op *po, int i, + struct parsed_proto *pp, int *regmask, int *save_arg_vars, + int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse) +{ + struct parsed_proto *pp_tmp; + struct parsed_op *po_tmp; + struct label_ref *lr; + int need_to_save_current; + int arg_grp_current = 0; + int save_args_seen = 0; + int save_args; + int ret = 0; + int reg; + char buf[32]; + int j, k; + + if (i < 0) { + ferr(po, "dead label encountered\n"); + return -1; + } + + for (; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + magic = (magic & 0xffffff) | (arg << 24); + + for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); ) + { + if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) { + if (ops[j].cc_scratch != magic) { + ferr(&ops[j], "arg collect hit same path with diff args for %s\n", + pp->name); + return -1; } - else if (po->flags & OPF_DATA) { // SETcc - out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]); - fprintf(fout, " %s = %s;", buf2, buf1); + // ok: have already been here + return 0; + } + ops[j].cc_scratch = magic; + + if (g_labels[j] != NULL && g_label_refs[j].i != -1) { + lr = &g_label_refs[j]; + if (lr->next != NULL) + need_op_saving = 1; + for (; lr->next; lr = lr->next) { + check_i(&ops[j], lr->i); + if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP) + may_reuse = 1; + ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars, + arg_grp, arg, magic, need_op_saving, may_reuse); + if (ret < 0) + return ret; } - else { - ferr(po, "unhandled conditional op\n"); + + check_i(&ops[j], lr->i); + if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP) + may_reuse = 1; + if (j > 0 && LAST_OP(j - 1)) { + // follow last branch in reverse + j = lr->i; + continue; } + need_op_saving = 1; + ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars, + arg_grp, arg, magic, need_op_saving, may_reuse); + if (ret < 0) + return ret; } + j--; - switch (po->op) + if (ops[j].op == OP_CALL) { - 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)); + if (pp->is_unresolved) break; - case OP_LEA: - assert_operand_cnt(2); - po->operand[1].lmod = OPLM_DWORD; // always - 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)); + pp_tmp = ops[j].pp; + if (pp_tmp == NULL) + ferr(po, "arg collect hit unparsed call '%s'\n", + ops[j].operand[0].name); + if (may_reuse && pp_tmp->argc_stack > 0) + ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n", + arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack); + } + // esp adjust of 0 means we collected it before + else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP + && (ops[j].operand[1].type != OPT_CONST + || ops[j].operand[1].val != 0)) + { + if (pp->is_unresolved) 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)); + ferr(po, "arg collect %d/%d hit esp adjust of %d\n", + arg, pp->argc, ops[j].operand[1].val); + } + else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_RMD) + && ops[j].datap == NULL) + { + if (pp->is_unresolved) break; - case OP_NOT: - assert_operand_cnt(1); - out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); - fprintf(fout, " %s = ~%s;", buf1, buf1); + ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc); + } + else if (ops[j].flags & OPF_CJMP) + { + if (pp->is_unresolved) 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"); + may_reuse = 1; + } + else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARGNR)) + { + if (pp->is_unresolved && (ops[j].flags & OPF_RMD)) 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; + ops[j].p_argnext = -1; + po_tmp = pp->arg[arg].datap; + if (po_tmp != NULL) + ops[j].p_argnext = po_tmp - ops; + pp->arg[arg].datap = &ops[j]; + + need_to_save_current = 0; + save_args = 0; + reg = -1; + if (ops[j].operand[0].type == OPT_REG) + reg = ops[j].operand[0].reg; + + if (!need_op_saving) { + ret = scan_for_mod(&ops[j], j + 1, i, 1); + need_to_save_current = (ret >= 0); + } + if (need_op_saving || need_to_save_current) { + // mark this push as one that needs operand saving + ops[j].flags &= ~OPF_RMD; + if (ops[j].p_argnum == 0) { + ops[j].p_argnum = arg + 1; + save_args |= 1 << arg; + } + else if (ops[j].p_argnum < arg + 1) { + // XXX: might kill valid var.. + //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1)); + ops[j].p_argnum = arg + 1; + save_args |= 1 << arg; + } - 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; + if (save_args_seen & (1 << (ops[j].p_argnum - 1))) { + save_args_seen = 0; + arg_grp_current++; + if (arg_grp_current >= MAX_ARG_GRP) + ferr(&ops[j], "out of arg groups (arg%d), f %s\n", + ops[j].p_argnum, pp->name); } - goto dualop_arith; + } + else if (ops[j].p_argnum == 0) + ops[j].flags |= OPF_RMD; + + // some PUSHes are reused by different calls on other branches, + // but that can't happen if we didn't branch, so they + // can be removed from future searches (handles nested calls) + if (!may_reuse) + ops[j].flags |= OPF_FARGNR; + + ops[j].flags |= OPF_FARG; + ops[j].flags &= ~OPF_RSAVE; + + // check for __VALIST + if (!pp->is_unresolved && pp->arg[arg].type.is_va_list) { + k = -1; + ret = resolve_origin(j, &ops[j].operand[0], + magic + 1, &k, NULL); + if (ret == 1 && k >= 0) + { + if (ops[k].op == OP_LEA) { + snprintf(buf, sizeof(buf), "arg_%X", + g_func_pp->argc_stack * 4); + if (!g_func_pp->is_vararg + || strstr(ops[k].operand[1].name, buf)) + { + ops[k].flags |= OPF_RMD; + ops[j].flags |= OPF_RMD | OPF_VAPUSH; + save_args &= ~(1 << arg); + reg = -1; + } + else + ferr(&ops[j], "lea va_list used, but no vararg?\n"); + } + // check for va_list from g_func_pp arg too + else if (ops[k].op == OP_MOV + && is_stack_access(&ops[k], &ops[k].operand[1])) + { + ret = stack_frame_access(&ops[k], &ops[k].operand[1], + buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0); + if (ret >= 0) { + ops[k].flags |= OPF_RMD; + ops[j].flags |= OPF_RMD; + ops[j].p_argpass = ret + 1; + save_args &= ~(1 << arg); + reg = -1; + } + } + } + } - 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; + *save_arg_vars |= save_args; - 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; + // tracking reg usage + if (reg >= 0) + *regmask |= 1 << reg; - 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; + arg++; + if (!pp->is_unresolved) { + // next arg + for (; arg < pp->argc; arg++) + if (pp->arg[arg].reg == NULL) + break; + } + magic = (magic & 0xffffff) | (arg << 24); + } - 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; + if (ops[j].p_arggrp > arg_grp_current) { + save_args_seen = 0; + arg_grp_current = ops[j].p_arggrp; + } + if (ops[j].p_argnum > 0) + save_args_seen |= 1 << (ops[j].p_argnum - 1); + } - case OP_IMUL: - if (po->operand_cnt == 2) - goto dualop_arith; - if (po->operand_cnt == 3) - ferr(po, "TODO imul3\n"); - // fallthrough - case OP_MUL: - assert_operand_cnt(1); - strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)"); - fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1, - out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0)); - fprintf(fout, " edx = mul_tmp >> 32;\n"); - fprintf(fout, " eax = mul_tmp;"); - last_arith_dst = NULL; - delayed_flag_op = NULL; - break; + if (arg < pp->argc) { + ferr(po, "arg collect failed for '%s': %d/%d\n", + pp->name, arg, pp->argc); + return -1; + } - 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); + if (arg_grp_current > *arg_grp) + *arg_grp = arg_grp_current; - // 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"); - last_arith_dst = NULL; - delayed_flag_op = NULL; - break; + return arg; +} - 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); - } - } - } +static int collect_call_args(struct parsed_op *po, int i, + struct parsed_proto *pp, int *regmask, int *save_arg_vars, + int magic) +{ + // arg group is for cases when pushes for + // multiple funcs are going on + struct parsed_op *po_tmp; + int save_arg_vars_current = 0; + int arg_grp = 0; + int ret; + int a; + + ret = collect_call_args_r(po, i, pp, regmask, + &save_arg_vars_current, &arg_grp, 0, magic, 0, 0); + if (ret < 0) + return ret; + + if (arg_grp != 0) { + // propagate arg_grp + for (a = 0; a < pp->argc; a++) { + if (pp->arg[a].reg != NULL) + continue; + + po_tmp = pp->arg[a].datap; + while (po_tmp != NULL) { + po_tmp->p_arggrp = arg_grp; + if (po_tmp->p_argnext > 0) + po_tmp = &ops[po_tmp->p_argnext]; else - no_output = 1; - delayed_flag_op = po; - break; + po_tmp = NULL; + } + } + } + save_arg_vars[arg_grp] |= save_arg_vars_current; + + if (pp->is_unresolved) { + pp->argc += ret; + pp->argc_stack += ret; + for (a = 0; a < pp->argc; a++) + if (pp->arg[a].type.name == NULL) + pp->arg[a].type.name = strdup("int"); + } - // 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 + return ret; +} + +static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg) +{ + int i; + + for (i = 0; i < pp->argc; i++) + if (pp->arg[i].reg == NULL) + break; + + if (pp->argc_stack) + memmove(&pp->arg[i + 1], &pp->arg[i], + sizeof(pp->arg[0]) * pp->argc_stack); + memset(&pp->arg[i], 0, sizeof(pp->arg[i])); + pp->arg[i].reg = strdup(reg); + pp->arg[i].type.name = strdup("int"); + pp->argc++; + pp->argc_reg++; +} + +static void add_label_ref(struct label_ref *lr, int op_i) +{ + struct label_ref *lr_new; + + if (lr->i == -1) { + lr->i = op_i; + return; + } + + lr_new = calloc(1, sizeof(*lr_new)); + lr_new->i = op_i; + lr_new->next = lr->next; + lr->next = lr_new; +} + +static struct parsed_data *try_resolve_jumptab(int i, int opcnt) +{ + struct parsed_op *po = &ops[i]; + struct parsed_data *pd; + char label[NAMELEN], *p; + int len, j, l; + + p = strchr(po->operand[0].name, '['); + if (p == NULL) + return NULL; + + len = p - po->operand[0].name; + strncpy(label, po->operand[0].name, len); + label[len] = 0; + + for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) { + if (IS(g_func_pd[j].label, label)) { + pd = &g_func_pd[j]; + break; + } + } + if (pd == NULL) + //ferr(po, "label '%s' not parsed?\n", label); + return NULL; + + if (pd->type != OPT_OFFSET) + ferr(po, "label '%s' with non-offset data?\n", label); + + // find all labels, link + for (j = 0; j < pd->count; j++) { + for (l = 0; l < opcnt; l++) { + if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) { + add_label_ref(&g_label_refs[l], i); + pd->d[j].bt_i = l; break; + } + } + } - case OP_JMP: - assert_operand_cnt(1); - if (po->operand[0].type != OPT_LABEL) - ferr(po, "unhandled call type\n"); + return pd; +} + +static void clear_labels(int count) +{ + int i; + + for (i = 0; i < count; i++) { + if (g_labels[i] != NULL) { + free(g_labels[i]); + g_labels[i] = NULL; + } + } +} + +static void output_std_flags(FILE *fout, struct parsed_op *po, + int *pfomask, const char *dst_opr_text) +{ + if (*pfomask & (1 << PFO_Z)) { + fprintf(fout, "\n cond_z = (%s%s == 0);", + lmod_cast_u(po, po->operand[0].lmod), dst_opr_text); + *pfomask &= ~(1 << PFO_Z); + } + if (*pfomask & (1 << PFO_S)) { + fprintf(fout, "\n cond_s = (%s%s < 0);", + lmod_cast_s(po, po->operand[0].lmod), dst_opr_text); + *pfomask &= ~(1 << PFO_S); + } +} + +static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp, + int is_noreturn) +{ + if (pp->is_fastcall) + fprintf(fout, "__fastcall "); + else if (pp->is_stdcall && pp->argc_reg == 0) + fprintf(fout, "__stdcall "); + if (pp->is_noreturn || is_noreturn) + fprintf(fout, "noreturn "); +} + +static int get_pp_arg_regmask(const struct parsed_proto *pp) +{ + int regmask = 0; + int i, reg; + + for (i = 0; i < pp->argc; i++) { + if (pp->arg[i].reg != NULL) { + reg = char_array_i(regs_r32, + ARRAY_SIZE(regs_r32), pp->arg[i].reg); + if (reg < 0) + ferr(ops, "arg '%s' of func '%s' is not a reg?\n", + pp->arg[i].reg, pp->name); + regmask |= 1 << reg; + } + } + + return regmask; +} + +static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num) +{ + char buf1[16]; + + buf1[0] = 0; + if (grp > 0) + snprintf(buf1, sizeof(buf1), "%d", grp); + snprintf(buf, buf_size, "s%s_a%d", buf1, num); + + return buf; +} + +static void gen_x_cleanup(int opcnt); + +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], cast[64]; + const struct parsed_proto *pp_c; + struct parsed_proto *pp, *pp_tmp; + struct parsed_data *pd; + const char *tmpname; + unsigned int uval; + int save_arg_vars[MAX_ARG_GRP] = { 0, }; + int cond_vars = 0; + int need_tmp_var = 0; + int need_tmp64 = 0; + int had_decl = 0; + int label_pending = 0; + int regmask_save = 0; + int regmask_arg = 0; + int regmask_now = 0; + int regmask_init = 0; + int regmask = 0; + int pfomask = 0; + int found = 0; + int depth = 0; + int no_output; + int i, j, l; + int arg; + int reg; + int ret; + + g_bp_frame = g_sp_frame = g_stack_fsz = 0; + g_stack_frame_used = 0; + + g_func_pp = proto_parse(fhdr, funcn, 0); + if (g_func_pp == NULL) + ferr(ops, "proto_parse failed for '%s'\n", funcn); + + regmask_arg = get_pp_arg_regmask(g_func_pp); + + // pass1: + // - handle ebp/esp frame, remove ops related to it + scan_prologue_epilogue(opcnt); + + // pass2: + // - parse calls with labels + // - resolve all branches + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + po->bt_i = -1; + po->btj = NULL; + + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL) { + pp = NULL; + + if (po->operand[0].type == OPT_LABEL) { + tmpname = opr_name(po, 0); + if (IS_START(tmpname, "loc_")) + ferr(po, "call to loc_*\n"); + pp_c = proto_parse(fhdr, tmpname, 0); + if (pp_c == NULL) + ferr(po, "proto_parse failed for call '%s'\n", tmpname); + + pp = proto_clone(pp_c); + my_assert_not(pp, NULL); + } + else if (po->datap != NULL) { + pp = calloc(1, sizeof(*pp)); + my_assert_not(pp, NULL); + + ret = parse_protostr(po->datap, pp); + if (ret < 0) + ferr(po, "bad protostr supplied: %s\n", (char *)po->datap); + free(po->datap); + po->datap = NULL; + } + + if (pp != NULL) { + if (pp->is_fptr) + check_func_pp(po, pp, "fptr var call"); + if (pp->is_noreturn) + po->flags |= OPF_TAIL; + } + po->pp = pp; + continue; + } + + if (!(po->flags & OPF_JMP) || po->op == OP_RET) + continue; + + if (po->operand[0].type == OPT_REGMEM) { + pd = try_resolve_jumptab(i, opcnt); + if (pd == NULL) + goto tailcall; + + po->btj = pd; + continue; + } + + for (l = 0; l < opcnt; l++) { + if (g_labels[l] != NULL + && IS(po->operand[0].name, g_labels[l])) + { + if (l == i + 1 && po->op == OP_JMP) { + // yet another alignment type.. + po->flags |= OPF_RMD; + break; + } + add_label_ref(&g_label_refs[l], i); + po->bt_i = l; + break; + } + } + + if (po->bt_i != -1 || (po->flags & OPF_RMD)) + continue; + + if (po->operand[0].type == OPT_LABEL) + // assume tail call + goto tailcall; + + ferr(po, "unhandled branch\n"); + +tailcall: + po->op = OP_CALL; + po->flags |= OPF_TAIL; + if (i > 0 && ops[i - 1].op == OP_POP) + po->flags |= OPF_ATAIL; + i--; // reprocess + } + + // pass3: + // - remove dead labels + // - process trivial calls + for (i = 0; i < opcnt; i++) + { + if (g_labels[i] != NULL && g_label_refs[i].i == -1) { + free(g_labels[i]); + g_labels[i] = NULL; + } + + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL) + { + pp = process_call_early(i, opcnt, &j); + if (pp != NULL) { + if (!(po->flags & OPF_ATAIL)) + // since we know the args, try to collect them + if (collect_call_args_early(po, i, pp, ®mask) != 0) + pp = NULL; + } + + if (pp != NULL) { + if (j >= 0) { + // commit esp adjust + ops[j].flags |= OPF_RMD; + if (ops[j].op != OP_POP) { + ferr_assert(&ops[j], ops[j].op == OP_ADD); + ops[j].operand[1].val -= pp->argc_stack * 4; + } + } + + if (strstr(pp->ret_type.name, "int64")) + need_tmp64 = 1; + + po->flags |= OPF_DONE; + } + } + } + + // pass4: + // - process calls + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL && !(po->flags & OPF_DONE)) + { + pp = process_call(i, opcnt); + + if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) { + // since we know the args, collect them + collect_call_args(po, i, pp, ®mask, save_arg_vars, + i + opcnt * 2); + } + + if (strstr(pp->ret_type.name, "int64")) + need_tmp64 = 1; + } + } + + // pass5: + // - find POPs for PUSHes, rm both + // - scan for STD/CLD, propagate DF + // - scan for all used registers + // - find flag set ops for their users + // - do unreselved calls + // - declare indirect functions + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) { + reg = po->operand[0].reg; + if (!(regmask & (1 << reg))) + // not a reg save after all, rerun scan_for_pop + po->flags &= ~OPF_RSAVE; + else + regmask_save |= 1 << reg; + } + + if (po->op == OP_PUSH && !(po->flags & OPF_FARG) + && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack) + { + if (po->operand[0].type == OPT_REG) + { + reg = po->operand[0].reg; + if (reg < 0) + ferr(po, "reg not set for push?\n"); + + depth = 0; + ret = scan_for_pop(i + 1, opcnt, + po->operand[0].name, i + opcnt * 3, 0, &depth, 0); + if (ret == 1) { + if (depth > 1) + ferr(po, "too much depth: %d\n", depth); + + po->flags |= OPF_RMD; + scan_for_pop(i + 1, opcnt, po->operand[0].name, + i + opcnt * 4, 0, &depth, 1); + continue; + } + ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0); + if (ret == 0) { + arg = OPF_RMD; + if (regmask & (1 << reg)) { + if (regmask_save & (1 << reg)) + ferr(po, "%s already saved?\n", po->operand[0].name); + arg = OPF_RSAVE; + } + po->flags |= arg; + scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg); + continue; + } + } + else if (po->operand[0].type == OPT_CONST) { + scan_for_pop_const(i, opcnt); + } + } + + if (po->op == OP_STD) { + po->flags |= OPF_DF | OPF_RMD; + scan_propagate_df(i + 1, opcnt); + } + + regmask_now = po->regmask_src | po->regmask_dst; + if (regmask_now & (1 << xBP)) { + if (g_bp_frame && !(po->flags & OPF_EBP_S)) { + if (po->regmask_dst & (1 << xBP)) + // compiler decided to drop bp frame and use ebp as scratch + scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S); + else + regmask_now &= ~(1 << xBP); + } + } + + regmask |= regmask_now; + + if (po->flags & OPF_CC) + { + int setters[16], cnt = 0, branched = 0; + + ret = scan_for_flag_set(i, i + opcnt * 6, + &branched, setters, &cnt); + if (ret < 0 || cnt <= 0) + ferr(po, "unable to trace flag setter(s)\n"); + if (cnt > ARRAY_SIZE(setters)) + ferr(po, "too many flag setters\n"); + + for (j = 0; j < cnt; j++) + { + tmp_op = &ops[setters[j]]; // flag setter + pfomask = 0; + + // to get nicer code, we try to delay test and cmp; + // if we can't because of operand modification, or if we + // have arith op, or branch, make it calculate flags explicitly + if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) + { + if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0) + pfomask = 1 << po->pfo; + } + else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) { + pfomask = 1 << po->pfo; + } + else { + // see if we'll be able to handle based on op result + if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR + && po->pfo != PFO_Z && po->pfo != PFO_S + && po->pfo != PFO_P) + || branched + || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0) + { + pfomask = 1 << po->pfo; + } + + if (tmp_op->op == OP_ADD && po->pfo == PFO_C) { + propagate_lmod(tmp_op, &tmp_op->operand[0], + &tmp_op->operand[1]); + if (tmp_op->operand[0].lmod == OPLM_DWORD) + need_tmp64 = 1; + } + } + if (pfomask) { + tmp_op->pfomask |= pfomask; + cond_vars |= pfomask; + } + // note: may overwrite, currently not a problem + po->datap = tmp_op; + } + + if (po->op == OP_RCL || po->op == OP_RCR + || po->op == OP_ADC || po->op == OP_SBB) + cond_vars |= 1 << PFO_C; + } + + if (po->op == OP_CMPS || po->op == OP_SCAS) { + cond_vars |= 1 << PFO_Z; + } + else if (po->op == OP_MUL + || (po->op == OP_IMUL && po->operand_cnt == 1)) + { + if (po->operand[0].lmod == OPLM_DWORD) + need_tmp64 = 1; + } + else if (po->op == OP_CALL) { + // note: resolved non-reg calls are OPF_DONE already + pp = po->pp; + if (pp == NULL) + ferr(po, "NULL pp\n"); + + if (pp->is_unresolved) { + int regmask_stack = 0; + collect_call_args(po, i, pp, ®mask, save_arg_vars, + i + opcnt * 2); + + // this is pretty rough guess: + // see ecx and edx were pushed (and not their saved versions) + for (arg = 0; arg < pp->argc; arg++) { + if (pp->arg[arg].reg != NULL) + continue; + + tmp_op = pp->arg[arg].datap; + if (tmp_op == NULL) + ferr(po, "parsed_op missing for arg%d\n", arg); + if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG) + regmask_stack |= 1 << tmp_op->operand[0].reg; + } + + if (!((regmask_stack & (1 << xCX)) + && (regmask_stack & (1 << xDX)))) + { + if (pp->argc_stack != 0 + || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX)))) + { + pp_insert_reg_arg(pp, "ecx"); + pp->is_fastcall = 1; + regmask_init |= 1 << xCX; + regmask |= 1 << xCX; + } + if (pp->argc_stack != 0 + || ((regmask | regmask_arg) & (1 << xDX))) + { + pp_insert_reg_arg(pp, "edx"); + regmask_init |= 1 << xDX; + regmask |= 1 << xDX; + } + } + + // note: __cdecl doesn't fall into is_unresolved category + if (pp->argc_stack > 0) + pp->is_stdcall = 1; + } + + for (arg = 0; arg < pp->argc; arg++) { + if (pp->arg[arg].reg != NULL) { + reg = char_array_i(regs_r32, + ARRAY_SIZE(regs_r32), pp->arg[arg].reg); + if (reg < 0) + ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg); + if (!(regmask & (1 << reg))) { + regmask_init |= 1 << reg; + regmask |= 1 << reg; + } + } + } + } + else if (po->op == OP_MOV && po->operand[0].pp != NULL + && po->operand[1].pp != NULL) + { + // = offset + if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr) + && !IS_START(po->operand[1].name, "off_")) + { + if (!po->operand[0].pp->is_fptr) + ferr(po, "%s not declared as fptr when it should be\n", + po->operand[0].name); + if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) { + pp_print(buf1, sizeof(buf1), po->operand[0].pp); + pp_print(buf2, sizeof(buf2), po->operand[1].pp); + fnote(po, "var: %s\n", buf1); + fnote(po, "func: %s\n", buf2); + ferr(po, "^ mismatch\n"); + } + } + } + else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void")) + regmask |= 1 << xAX; + else if (po->op == OP_DIV || po->op == OP_IDIV) { + // 32bit division is common, look for it + if (po->op == OP_DIV) + ret = scan_for_reg_clear(i, xDX); + else + ret = scan_for_cdq_edx(i); + if (ret >= 0) + po->flags |= OPF_32BIT; + else + need_tmp64 = 1; + } + else if (po->op == OP_CLD) + po->flags |= OPF_RMD; + + if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) { + need_tmp_var = 1; + } + } + + // pass6: + // - confirm regmask_save, it might have been reduced + if (regmask_save != 0) + { + regmask_save = 0; + for (i = 0; i < opcnt; i++) { + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) + regmask_save |= 1 << po->operand[0].reg; + } + } + + // output starts here + + // define userstack size + if (g_func_pp->is_userstack) { + fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name); + fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name); + fprintf(fout, "#endif\n"); + } + + // the function itself + fprintf(fout, "%s ", g_func_pp->ret_type.name); + output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN); + fprintf(fout, "%s(", g_func_pp->name); + + for (i = 0; i < g_func_pp->argc; i++) { + if (i > 0) + fprintf(fout, ", "); + if (g_func_pp->arg[i].fptr != NULL) { + // func pointer.. + pp = g_func_pp->arg[i].fptr; + fprintf(fout, "%s (", pp->ret_type.name); + output_pp_attrs(fout, pp, 0); + fprintf(fout, "*a%d)(", i + 1); + for (j = 0; j < pp->argc; j++) { + if (j > 0) + fprintf(fout, ", "); + if (pp->arg[j].fptr) + ferr(ops, "nested fptr\n"); + fprintf(fout, "%s", pp->arg[j].type.name); + } + if (pp->is_vararg) { + if (j > 0) + fprintf(fout, ", "); + fprintf(fout, "..."); + } + fprintf(fout, ")"); + } + else if (g_func_pp->arg[i].type.is_retreg) { + fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg); + } + else { + fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1); + } + } + if (g_func_pp->is_vararg) { + if (i > 0) + fprintf(fout, ", "); + fprintf(fout, "..."); + } + + fprintf(fout, ")\n{\n"); + + // declare indirect functions + for (i = 0; i < opcnt; i++) { + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL) { + pp = po->pp; + if (pp == NULL) + ferr(po, "NULL pp\n"); + + if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) { + if (pp->name[0] != 0) { + memmove(pp->name + 2, pp->name, strlen(pp->name) + 1); + memcpy(pp->name, "i_", 2); + + // might be declared already + found = 0; + for (j = 0; j < i; j++) { + if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) { + if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) { + found = 1; + break; + } + } + } + if (found) + continue; + } + else + snprintf(pp->name, sizeof(pp->name), "icall%d", i); + + fprintf(fout, " %s (", pp->ret_type.name); + output_pp_attrs(fout, pp, 0); + fprintf(fout, "*%s)(", pp->name); + for (j = 0; j < pp->argc; j++) { + if (j > 0) + fprintf(fout, ", "); + fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1); + } + fprintf(fout, ");\n"); + } + } + } + + // output LUTs/jumptables + for (i = 0; i < g_func_pd_cnt; i++) { + pd = &g_func_pd[i]; + fprintf(fout, " static const "); + if (pd->type == OPT_OFFSET) { + fprintf(fout, "void *jt_%s[] =\n { ", pd->label); + + for (j = 0; j < pd->count; j++) { + if (j > 0) + fprintf(fout, ", "); + fprintf(fout, "&&%s", pd->d[j].u.label); + } + } + else { + fprintf(fout, "%s %s[] =\n { ", + lmod_type_u(ops, pd->lmod), pd->label); + + for (j = 0; j < pd->count; j++) { + if (j > 0) + fprintf(fout, ", "); + fprintf(fout, "%u", pd->d[j].u.val); + } + } + fprintf(fout, " };\n"); + had_decl = 1; + } + + // declare stack frame, va_arg + if (g_stack_fsz) { + fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n", + (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz); + had_decl = 1; + } + + if (g_func_pp->is_userstack) { + fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name); + fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n"); + had_decl = 1; + } + + if (g_func_pp->is_vararg) { + fprintf(fout, " va_list ap;\n"); + had_decl = 1; + } + + // declare 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 (regmask & (1 << reg)) { + if (g_func_pp->arg[i].type.is_retreg) + fprintf(fout, " u32 %s = *r_%s;\n", + g_func_pp->arg[i].reg, g_func_pp->arg[i].reg); + else + fprintf(fout, " u32 %s = (u32)a%d;\n", + g_func_pp->arg[i].reg, i + 1); + } + else { + if (g_func_pp->arg[i].type.is_retreg) + ferr(ops, "retreg '%s' is unused?\n", + g_func_pp->arg[i].reg); + fprintf(fout, " // %s = a%d; // unused\n", + g_func_pp->arg[i].reg, i + 1); + } + had_decl = 1; + } + } + + regmask_now = regmask & ~regmask_arg; + regmask_now &= ~(1 << xSP); + if (regmask_now & 0x00ff) { + for (reg = 0; reg < 8; reg++) { + if (regmask_now & (1 << reg)) { + fprintf(fout, " u32 %s", regs_r32[reg]); + if (regmask_init & (1 << reg)) + fprintf(fout, " = 0"); + fprintf(fout, ";\n"); + had_decl = 1; + } + } + } + if (regmask_now & 0xff00) { + for (reg = 8; reg < 16; reg++) { + if (regmask_now & (1 << reg)) { + fprintf(fout, " mmxr %s", regs_r32[reg]); + if (regmask_init & (1 << reg)) + fprintf(fout, " = { 0, }"); + fprintf(fout, ";\n"); + had_decl = 1; + } + } + } + + if (regmask_save) { + for (reg = 0; reg < 8; reg++) { + if (regmask_save & (1 << reg)) { + fprintf(fout, " u32 s_%s;\n", regs_r32[reg]); + had_decl = 1; + } + } + } + + for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) { + if (save_arg_vars[i] == 0) + continue; + for (reg = 0; reg < 32; reg++) { + if (save_arg_vars[i] & (1 << reg)) { + fprintf(fout, " u32 %s;\n", + saved_arg_name(buf1, sizeof(buf1), i, reg + 1)); + had_decl = 1; + } + } + } + + if (cond_vars) { + for (i = 0; i < 8; i++) { + if (cond_vars & (1 << i)) { + fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]); + had_decl = 1; + } + } + } + + if (need_tmp_var) { + fprintf(fout, " u32 tmp;\n"); + had_decl = 1; + } + + if (need_tmp64) { + fprintf(fout, " u64 tmp64;\n"); + had_decl = 1; + } + + if (had_decl) + fprintf(fout, "\n"); + + if (g_func_pp->is_vararg) { + if (g_func_pp->argc_stack == 0) + ferr(ops, "vararg func without stack args?\n"); + fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc); + } + + // output ops + for (i = 0; i < opcnt; i++) + { + if (g_labels[i] != NULL) { + fprintf(fout, "\n%s:\n", g_labels[i]); + label_pending = 1; + + delayed_flag_op = NULL; + last_arith_dst = NULL; + } + + 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) + { + int is_delayed = 0; + + tmp_op = po->datap; + + // 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, + po->pfo, po->pfo_inv); + is_delayed = 1; + } + else if (last_arith_dst != NULL + && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P + || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR)) + )) + { + out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst); + out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv, + last_arith_dst->lmod, buf3); + is_delayed = 1; + } + else if (tmp_op != NULL) { + // use preprocessed flag calc results + if (!(tmp_op->pfomask & (1 << po->pfo))) + ferr(po, "not prepared for pfo %d\n", po->pfo); + + // note: pfo_inv was not yet applied + snprintf(buf1, sizeof(buf1), "(%scond_%s)", + po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]); + } + else { + ferr(po, "all methods of finding comparison failed\n"); + } + + if (po->flags & OPF_JMP) { + fprintf(fout, " if %s", buf1); + } + else if (po->op == OP_RCL || po->op == OP_RCR + || po->op == OP_ADC || po->op == OP_SBB) + { + if (is_delayed) + fprintf(fout, " cond_%s = %s;\n", + parsed_flag_op_names[po->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"); + } + } + + pfomask = po->pfomask; + + if (po->flags & (OPF_REPZ|OPF_REPNZ)) { + struct parsed_opr opr = {0,}; + opr.type = OPT_REG; + opr.reg = xCX; + opr.lmod = OPLM_DWORD; + ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval); + + if (ret != 1 || uval == 0) { + // we need initial flags for ecx=0 case.. + if (i > 0 && ops[i - 1].op == OP_XOR + && IS(ops[i - 1].operand[0].name, + ops[i - 1].operand[1].name)) + { + fprintf(fout, " cond_z = "); + if (pfomask & (1 << PFO_C)) + fprintf(fout, "cond_c = "); + fprintf(fout, "0;\n"); + } + else if (last_arith_dst != NULL) { + out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst); + out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0, + last_arith_dst->lmod, buf3); + fprintf(fout, " cond_z = %s;\n", buf1); + } + else + ferr(po, "missing initial ZF\n"); + } + } + + switch (po->op) + { + case OP_MOV: + assert_operand_cnt(2); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + default_cast_to(buf3, sizeof(buf3), &po->operand[0]); + fprintf(fout, " %s = %s;", buf1, + out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], + buf3, 0)); + break; + + case OP_LEA: + assert_operand_cnt(2); + po->operand[1].lmod = OPLM_DWORD; // always + fprintf(fout, " %s = %s;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]), + out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], + NULL, 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_u32(buf2, sizeof(buf2), po, &po->operand[1])); + 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;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]), + out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], + buf3, 0)); + break; + + case OP_XCHG: + assert_operand_cnt(2); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + fprintf(fout, " tmp = %s;", + out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0)); + fprintf(fout, " %s = %s;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]), + out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], + default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0)); + fprintf(fout, " %s = %stmp;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]), + default_cast_to(buf3, sizeof(buf3), &po->operand[1])); + snprintf(g_comment, sizeof(g_comment), "xchg"); + 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_u32(buf2, sizeof(buf2), po, &po->operand[1])); + strcpy(g_comment, "cdq"); + break; + + case OP_LODS: + assert_operand_cnt(3); + if (po->flags & OPF_REP) { + // hmh.. + ferr(po, "TODO\n"); + } + else { + fprintf(fout, " eax = %sesi; esi %c= %d;", + lmod_cast_u_ptr(po, po->operand[0].lmod), + (po->flags & OPF_DF) ? '-' : '+', + lmod_bytes(po, po->operand[0].lmod)); + strcpy(g_comment, "lods"); + } + break; + + case OP_STOS: + assert_operand_cnt(3); + if (po->flags & OPF_REP) { + fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n", + (po->flags & OPF_DF) ? '-' : '+', + lmod_bytes(po, po->operand[0].lmod)); + fprintf(fout, " %sedi = eax;", + lmod_cast_u_ptr(po, po->operand[0].lmod)); + strcpy(g_comment, "rep stos"); + } + else { + fprintf(fout, " %sedi = eax; edi %c= %d;", + lmod_cast_u_ptr(po, po->operand[0].lmod), + (po->flags & OPF_DF) ? '-' : '+', + lmod_bytes(po, po->operand[0].lmod)); + strcpy(g_comment, "stos"); + } + break; + + case OP_MOVS: + assert_operand_cnt(3); + j = lmod_bytes(po, po->operand[0].lmod); + strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod)); + l = (po->flags & OPF_DF) ? '-' : '+'; + if (po->flags & OPF_REP) { + fprintf(fout, + " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n", + l, j, l, j); + fprintf(fout, + " %sedi = %sesi;", buf1, buf1); + strcpy(g_comment, "rep movs"); + } + else { + fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;", + buf1, buf1, l, j, l, j); + strcpy(g_comment, "movs"); + } + break; + + case OP_CMPS: + // repe ~ repeat while ZF=1 + assert_operand_cnt(3); + j = lmod_bytes(po, po->operand[0].lmod); + strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod)); + l = (po->flags & OPF_DF) ? '-' : '+'; + if (po->flags & OPF_REP) { + fprintf(fout, + " for (; ecx != 0; ecx--) {\n"); + if (pfomask & (1 << PFO_C)) { + // ugh.. + fprintf(fout, + " cond_c = %sesi < %sedi;\n", buf1, buf1); + pfomask &= ~(1 << PFO_C); + } + fprintf(fout, + " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n", + buf1, buf1, l, j, l, j); + fprintf(fout, + " if (cond_z %s 0) break;\n", + (po->flags & OPF_REPZ) ? "==" : "!="); + fprintf(fout, + " }"); + snprintf(g_comment, sizeof(g_comment), "rep%s cmps", + (po->flags & OPF_REPZ) ? "e" : "ne"); + } + else { + fprintf(fout, + " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;", + buf1, buf1, l, j, l, j); + strcpy(g_comment, "cmps"); + } + pfomask &= ~(1 << PFO_Z); + last_arith_dst = NULL; + delayed_flag_op = NULL; + break; + + case OP_SCAS: + // only does ZF (for now) + // repe ~ repeat while ZF=1 + assert_operand_cnt(3); + j = lmod_bytes(po, po->operand[0].lmod); + l = (po->flags & OPF_DF) ? '-' : '+'; + if (po->flags & OPF_REP) { + fprintf(fout, + " for (; ecx != 0; ecx--) {\n"); + fprintf(fout, + " cond_z = (%seax == %sedi); edi %c= %d;\n", + lmod_cast_u(po, po->operand[0].lmod), + lmod_cast_u_ptr(po, po->operand[0].lmod), l, j); + fprintf(fout, + " if (cond_z %s 0) break;\n", + (po->flags & OPF_REPZ) ? "==" : "!="); + fprintf(fout, + " }"); + snprintf(g_comment, sizeof(g_comment), "rep%s scas", + (po->flags & OPF_REPZ) ? "e" : "ne"); + } + else { + fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;", + lmod_cast_u(po, po->operand[0].lmod), + lmod_cast_u_ptr(po, po->operand[0].lmod), l, j); + strcpy(g_comment, "scas"); + } + pfomask &= ~(1 << PFO_Z); + last_arith_dst = NULL; + delayed_flag_op = NULL; + break; + + // arithmetic w/flags + case OP_AND: + case OP_OR: + propagate_lmod(po, &po->operand[0], &po->operand[1]); + // fallthrough + 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_u32(buf2, sizeof(buf2), po, &po->operand[1])); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + case OP_SHL: + case OP_SHR: + assert_operand_cnt(2); + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + if (pfomask & (1 << PFO_C)) { + if (po->operand[1].type == OPT_CONST) { + l = lmod_bytes(po, po->operand[0].lmod) * 8; + j = po->operand[1].val; + j %= l; + if (j != 0) { + if (po->op == OP_SHL) + j = l - j; + else + j -= 1; + fprintf(fout, " cond_c = (%s >> %d) & 1;\n", + buf1, j); + } + else + ferr(po, "zero shift?\n"); + } + else + ferr(po, "TODO\n"); + pfomask &= ~(1 << PFO_C); + } + fprintf(fout, " %s %s= %s;", buf1, op_to_c(po), + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1])); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + 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_u32(buf2, sizeof(buf2), po, &po->operand[1])); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + case OP_SHRD: + assert_operand_cnt(3); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + l = lmod_bytes(po, po->operand[0].lmod) * 8; + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]); + out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]); + fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);", + buf1, buf3, buf1, buf2, l, buf3); + strcpy(g_comment, "shrd"); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + case OP_ROL: + case OP_ROR: + assert_operand_cnt(2); + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + if (po->operand[1].type == OPT_CONST) { + j = po->operand[1].val; + j %= lmod_bytes(po, po->operand[0].lmod) * 8; + fprintf(fout, po->op == OP_ROL ? + " %s = (%s << %d) | (%s >> %d);" : + " %s = (%s >> %d) | (%s << %d);", + buf1, buf1, j, buf1, + lmod_bytes(po, po->operand[0].lmod) * 8 - j); + } + else + ferr(po, "TODO\n"); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + case OP_RCL: + case OP_RCR: + assert_operand_cnt(2); + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + l = lmod_bytes(po, po->operand[0].lmod) * 8; + if (po->operand[1].type == OPT_CONST) { + j = po->operand[1].val % l; + if (j == 0) + ferr(po, "zero rotate\n"); + fprintf(fout, " tmp = (%s >> %d) & 1;\n", + buf1, (po->op == OP_RCL) ? (l - j) : (j - 1)); + if (po->op == OP_RCL) { + fprintf(fout, + " %s = (%s << %d) | (cond_c << %d)", + buf1, buf1, j, j - 1); + if (j != 1) + fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j); + } + else { + fprintf(fout, + " %s = (%s >> %d) | (cond_c << %d)", + buf1, buf1, j, l - j); + if (j != 1) + fprintf(fout, " | (%s << %d)", buf1, l + 1 - j); + } + fprintf(fout, ";\n"); + fprintf(fout, " cond_c = tmp;"); + } + else + ferr(po, "TODO\n"); + strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr"); + output_std_flags(fout, po, &pfomask, buf1); + 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 + if (pfomask & (1 << PFO_BE)) { // weird, but it happens.. + fprintf(fout, " cond_be = 1;\n"); + pfomask &= ~(1 << PFO_BE); + } + 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_ADD: + assert_operand_cnt(2); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + if (pfomask & (1 << PFO_C)) { + out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]); + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]); + if (po->operand[0].lmod == OPLM_DWORD) { + fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2); + fprintf(fout, " cond_c = tmp64 >> 32;\n"); + fprintf(fout, " %s = (u32)tmp64;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0])); + strcat(g_comment, "add64"); + } + else { + fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n", + buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8); + fprintf(fout, " %s += %s;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]), + buf2); + } + pfomask &= ~(1 << PFO_C); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + } + goto dualop_arith; + + case OP_SUB: + assert_operand_cnt(2); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) { + for (j = 0; j <= PFO_LE; j++) { + if (!(pfomask & (1 << j))) + continue; + if (j == PFO_Z || j == PFO_S) + continue; + + out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0); + fprintf(fout, " cond_%s = %s;\n", + parsed_flag_op_names[j], buf1); + pfomask &= ~(1 << j); + } + } + goto dualop_arith; + + case OP_ADC: + case OP_SBB: + assert_operand_cnt(2); + propagate_lmod(po, &po->operand[0], &po->operand[1]); + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + if (po->op == OP_SBB + && IS(po->operand[0].name, po->operand[1].name)) + { + // avoid use of unitialized var + fprintf(fout, " %s = -cond_c;", buf1); + // carry remains what it was + pfomask &= ~(1 << PFO_C); + } + else { + fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po), + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1])); + } + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + break; + + case OP_BSF: + assert_operand_cnt(2); + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]); + fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]), + buf2, buf2); + output_std_flags(fout, po, &pfomask, buf1); + last_arith_dst = &po->operand[0]; + delayed_flag_op = NULL; + strcat(g_comment, "bsf"); + break; + + case OP_DEC: + if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) { + for (j = 0; j <= PFO_LE; j++) { + if (!(pfomask & (1 << j))) + continue; + if (j == PFO_Z || j == PFO_S || j == PFO_C) + continue; + + out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0); + fprintf(fout, " cond_%s = %s;\n", + parsed_flag_op_names[j], buf1); + pfomask &= ~(1 << j); + } + } + // fallthrough + + case OP_INC: + if (pfomask & (1 << PFO_C)) + // carry is unaffected by inc/dec.. wtf? + ferr(po, "carry propagation needed\n"); + + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + if (po->operand[0].type == OPT_REG) { + strcpy(buf2, po->op == OP_INC ? "++" : "--"); + fprintf(fout, " %s%s;", buf1, buf2); + } + else { + strcpy(buf2, po->op == OP_INC ? "+" : "-"); + fprintf(fout, " %s %s= 1;", buf1, buf2); + } + output_std_flags(fout, po, &pfomask, buf1); + 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_u32(buf2, sizeof(buf2), po, &po->operand[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; + if (pfomask & (1 << PFO_C)) { + fprintf(fout, "\n cond_c = (%s != 0);", buf1); + pfomask &= ~(1 << PFO_C); + } + break; + + case OP_IMUL: + if (po->operand_cnt == 2) { + propagate_lmod(po, &po->operand[0], &po->operand[1]); + goto dualop_arith; + } + if (po->operand_cnt == 3) + ferr(po, "TODO imul3\n"); + // fallthrough + case OP_MUL: + assert_operand_cnt(1); + switch (po->operand[0].lmod) { + case OPLM_DWORD: + strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)"); + fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1, + out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0])); + fprintf(fout, " edx = tmp64 >> 32;\n"); + fprintf(fout, " eax = tmp64;"); + break; + case OPLM_BYTE: + strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)"); + fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1, + out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], + buf1, 0)); + break; + default: + ferr(po, "TODO: unhandled mul type\n"); + break; + } + last_arith_dst = NULL; + 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); + + out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]); + strcpy(buf2, lmod_cast(po, po->operand[0].lmod, + po->op == OP_IDIV)); + switch (po->operand[0].lmod) { + case OPLM_DWORD: + if (po->flags & OPF_32BIT) + snprintf(buf3, sizeof(buf3), "%seax", buf2); + else { + fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n"); + snprintf(buf3, sizeof(buf3), "%stmp64", + (po->op == OP_IDIV) ? "(s64)" : ""); + } + if (po->operand[0].type == OPT_REG + && po->operand[0].reg == xDX) + { + fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1); + fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1); + } + else { + fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1); + fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1); + } + break; + default: + ferr(po, "unhandled division type\n"); + } + last_arith_dst = NULL; + delayed_flag_op = NULL; + break; + + case OP_TEST: + case OP_CMP: + propagate_lmod(po, &po->operand[0], &po->operand[1]); + if (pfomask != 0) { + for (j = 0; j < 8; j++) { + if (pfomask & (1 << j)) { + out_cmp_test(buf1, sizeof(buf1), po, j, 0); + fprintf(fout, " cond_%s = %s;", + parsed_flag_op_names[j], buf1); + } + } + pfomask = 0; + } + else + no_output = 1; + last_arith_dst = NULL; + delayed_flag_op = po; + break; + + case OP_SCC: + // SETcc - should already be handled + break; + + // note: we reuse OP_Jcc for SETcc, only flags differ + case OP_JCC: + fprintf(fout, "\n goto %s;", po->operand[0].name); + break; + + case OP_JECXZ: + fprintf(fout, " if (ecx == 0)\n"); + fprintf(fout, " goto %s;", po->operand[0].name); + strcat(g_comment, "jecxz"); + break; + + case OP_JMP: + assert_operand_cnt(1); + last_arith_dst = NULL; + delayed_flag_op = NULL; + + if (po->operand[0].type == OPT_REGMEM) { + ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]", + buf1, buf2); + if (ret != 2) + ferr(po, "parse failure for jmp '%s'\n", + po->operand[0].name); + fprintf(fout, " goto *jt_%s[%s];", buf1, buf2); + break; + } + else if (po->operand[0].type != OPT_LABEL) + ferr(po, "unhandled jmp type\n"); + + fprintf(fout, " goto %s;", po->operand[0].name); + break; + + case OP_CALL: + assert_operand_cnt(1); + pp = po->pp; + my_assert_not(pp, NULL); + + strcpy(buf3, " "); + if (po->flags & OPF_CC) { + // we treat conditional branch to another func + // (yes such code exists..) as conditional tailcall + strcat(buf3, " "); + fprintf(fout, " {\n"); + } + + if (pp->is_fptr && !pp->is_arg) { + fprintf(fout, "%s%s = %s;\n", buf3, pp->name, + out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], + "(void *)", 0)); + if (pp->is_unresolved) + fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n", + buf3, asmfn, po->asmln, pp->name); + } + + fprintf(fout, "%s", buf3); + if (strstr(pp->ret_type.name, "int64")) { + if (po->flags & OPF_TAIL) + ferr(po, "int64 and tail?\n"); + fprintf(fout, "tmp64 = "); + } + else if (!IS(pp->ret_type.name, "void")) { + if (po->flags & OPF_TAIL) { + if (!IS(g_func_pp->ret_type.name, "void")) { + fprintf(fout, "return "); + if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr) + fprintf(fout, "(%s)", g_func_pp->ret_type.name); + } + } + else if (regmask & (1 << xAX)) { + fprintf(fout, "eax = "); + if (pp->ret_type.is_ptr) + fprintf(fout, "(u32)"); + } + } + + if (pp->name[0] == 0) + ferr(po, "missing pp->name\n"); + fprintf(fout, "%s%s(", pp->name, + pp->has_structarg ? "_sa" : ""); + + if (po->flags & OPF_ATAIL) { + if (pp->argc_stack != g_func_pp->argc_stack + || (pp->argc_stack > 0 + && pp->is_stdcall != g_func_pp->is_stdcall)) + ferr(po, "incompatible tailcall\n"); + if (g_func_pp->has_retreg) + ferr(po, "TODO: retreg+tailcall\n"); + + for (arg = j = 0; arg < pp->argc; arg++) { + if (arg > 0) + fprintf(fout, ", "); + + cast[0] = 0; + if (pp->arg[arg].type.is_ptr) + snprintf(cast, sizeof(cast), "(%s)", + pp->arg[arg].type.name); + + if (pp->arg[arg].reg != NULL) { + fprintf(fout, "%s%s", cast, pp->arg[arg].reg); + continue; + } + // stack arg + for (; j < g_func_pp->argc; j++) + if (g_func_pp->arg[j].reg == NULL) + break; + fprintf(fout, "%sa%d", cast, j + 1); + j++; + } + } + else { + for (arg = 0; arg < pp->argc; arg++) { + if (arg > 0) + fprintf(fout, ", "); + + cast[0] = 0; + if (pp->arg[arg].type.is_ptr) + snprintf(cast, sizeof(cast), "(%s)", + pp->arg[arg].type.name); + + if (pp->arg[arg].reg != NULL) { + if (pp->arg[arg].type.is_retreg) + fprintf(fout, "&%s", pp->arg[arg].reg); + else + fprintf(fout, "%s%s", cast, 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->flags & OPF_VAPUSH) { + fprintf(fout, "ap"); + } + else if (tmp_op->p_argpass != 0) { + fprintf(fout, "a%d", tmp_op->p_argpass); + } + else if (tmp_op->p_argnum != 0) { + fprintf(fout, "%s%s", cast, + saved_arg_name(buf1, sizeof(buf1), + tmp_op->p_arggrp, tmp_op->p_argnum)); + } + else { + fprintf(fout, "%s", + out_src_opr(buf1, sizeof(buf1), + tmp_op, &tmp_op->operand[0], cast, 0)); + } + } + } + fprintf(fout, ");"); + + if (strstr(pp->ret_type.name, "int64")) { + fprintf(fout, "\n"); + fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3); + fprintf(fout, "%seax = tmp64;", buf3); + } + + if (pp->is_unresolved) { + snprintf(buf2, sizeof(buf2), " unresolved %dreg", + pp->argc_reg); + strcat(g_comment, buf2); + } + + if (po->flags & OPF_TAIL) { + ret = 0; + if (i == opcnt - 1 || pp->is_noreturn) + ret = 0; + else if (IS(pp->ret_type.name, "void")) + ret = 1; + else if (IS(g_func_pp->ret_type.name, "void")) + ret = 1; + // else already handled as 'return f()' + + if (ret) { + if (!IS(g_func_pp->ret_type.name, "void")) { + ferr(po, "int func -> void func tailcall?\n"); + } + else { + fprintf(fout, "\n%sreturn;", buf3); + strcat(g_comment, " ^ tailcall"); + } + } + else + strcat(g_comment, " tailcall"); + } + if (pp->is_noreturn) + strcat(g_comment, " noreturn"); + if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0) + strcat(g_comment, " argframe"); + if (po->flags & OPF_CC) + strcat(g_comment, " cond"); + + if (po->flags & OPF_CC) + fprintf(fout, "\n }"); + + delayed_flag_op = NULL; + last_arith_dst = NULL; + break; + + case OP_RET: + if (g_func_pp->is_vararg) + fprintf(fout, " va_end(ap);\n"); + if (g_func_pp->has_retreg) { + for (arg = 0; arg < g_func_pp->argc; arg++) + if (g_func_pp->arg[arg].type.is_retreg) + fprintf(fout, " *r_%s = %s;\n", + g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg); + } + + if (IS(g_func_pp->ret_type.name, "void")) { + if (i != opcnt - 1 || label_pending) + fprintf(fout, " return;"); + } + else if (g_func_pp->ret_type.is_ptr) { + fprintf(fout, " return (%s)eax;", + g_func_pp->ret_type.name); + } + else if (IS(g_func_pp->ret_type.name, "__int64")) + fprintf(fout, " return ((u64)edx << 32) | eax;"); + else + fprintf(fout, " return eax;"); + + last_arith_dst = NULL; + delayed_flag_op = NULL; + break; + + case OP_PUSH: + out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]); + if (po->p_argnum != 0) { + // special case - saved func arg + fprintf(fout, " %s = %s;", + saved_arg_name(buf2, sizeof(buf2), + po->p_arggrp, po->p_argnum), buf1); + break; + } + else if (po->flags & OPF_RSAVE) { + fprintf(fout, " s_%s = %s;", buf1, buf1); + break; + } + else if (g_func_pp->is_userstack) { + fprintf(fout, " *(--esp) = %s;", buf1); + break; + } + if (!(g_ida_func_attr & IDAFA_NORETURN)) + ferr(po, "stray push encountered\n"); + no_output = 1; + break; + + case OP_POP: + if (po->flags & OPF_RSAVE) { + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + fprintf(fout, " %s = s_%s;", buf1, buf1); + break; + } + else if (po->datap != NULL) { + // push/pop pair + tmp_op = po->datap; + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]); + fprintf(fout, " %s = %s;", buf1, + out_src_opr(buf2, sizeof(buf2), + tmp_op, &tmp_op->operand[0], + default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0)); + break; + } + else if (g_func_pp->is_userstack) { + fprintf(fout, " %s = *esp++;", + out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0])); + break; + } + else + ferr(po, "stray pop encountered\n"); + break; + + case OP_NOP: + no_output = 1; + break; + + // mmx + case OP_EMMS: + strcpy(g_comment, "(emms)"); + break; + + default: + no_output = 1; + ferr(po, "unhandled op type %d, flags %x\n", + po->op, po->flags); + break; + } + + if (g_comment[0] != 0) { + char *p = g_comment; + while (my_isblank(*p)) + p++; + fprintf(fout, " // %s", p); + g_comment[0] = 0; + no_output = 0; + } + if (!no_output) + fprintf(fout, "\n"); + + // some sanity checking + if (po->flags & OPF_REP) { + if (po->op != OP_STOS && po->op != OP_MOVS + && po->op != OP_CMPS && po->op != OP_SCAS) + ferr(po, "unexpected rep\n"); + if (!(po->flags & (OPF_REPZ|OPF_REPNZ)) + && (po->op == OP_CMPS || po->op == OP_SCAS)) + ferr(po, "cmps/scas with plain rep\n"); + } + if ((po->flags & (OPF_REPZ|OPF_REPNZ)) + && po->op != OP_CMPS && po->op != OP_SCAS) + ferr(po, "unexpected repz/repnz\n"); + + if (pfomask != 0) + ferr(po, "missed flag calc, pfomask=%x\n", pfomask); + + // 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, 0)) + 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; + } + + label_pending = 0; + } + + if (g_stack_fsz && !g_stack_frame_used) + fprintf(fout, " (void)sf;\n"); + + fprintf(fout, "}\n\n"); + + gen_x_cleanup(opcnt); +} + +static void gen_x_cleanup(int opcnt) +{ + int i; + + for (i = 0; i < opcnt; i++) { + struct label_ref *lr, *lr_del; + + lr = g_label_refs[i].next; + while (lr != NULL) { + lr_del = lr; + lr = lr->next; + free(lr_del); + } + g_label_refs[i].i = -1; + g_label_refs[i].next = NULL; + + if (ops[i].op == OP_CALL) { + if (ops[i].pp) + proto_release(ops[i].pp); + } + } + g_func_pp = NULL; +} + +struct func_proto_dep; + +struct func_prototype { + char name[NAMELEN]; + int id; + int argc_stack; + int regmask_dep; + int has_ret:3; // -1, 0, 1: unresolved, no, yes + unsigned int dep_resolved:1; + unsigned int is_stdcall:1; + struct func_proto_dep *dep_func; + int dep_func_cnt; +}; + +struct func_proto_dep { + char *name; + struct func_prototype *proto; + int regmask_live; // .. at the time of call + unsigned int ret_dep:1; // return from this is caller's return +}; + +static struct func_prototype *hg_fp; +static int hg_fp_cnt; + +static struct scanned_var { + char name[NAMELEN]; + enum opr_lenmod lmod; + unsigned int is_seeded:1; + unsigned int is_c_str:1; +} *hg_vars; +static int hg_var_cnt; + +static void output_hdr_fp(FILE *fout, const struct func_prototype *fp, + int count); + +static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp, + const char *name) +{ + int i; + + for (i = 0; i < fp->dep_func_cnt; i++) + if (IS(fp->dep_func[i].name, name)) + return &fp->dep_func[i]; + + return NULL; +} + +static void hg_fp_add_dep(struct func_prototype *fp, const char *name) +{ + // is it a dupe? + if (hg_fp_find_dep(fp, name)) + return; + + if ((fp->dep_func_cnt & 0xff) == 0) { + fp->dep_func = realloc(fp->dep_func, + sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100)); + my_assert_not(fp->dep_func, NULL); + memset(&fp->dep_func[fp->dep_func_cnt], 0, + sizeof(fp->dep_func[0]) * 0x100); + } + fp->dep_func[fp->dep_func_cnt].name = strdup(name); + fp->dep_func_cnt++; +} + +static int hg_fp_cmp_name(const void *p1_, const void *p2_) +{ + const struct func_prototype *p1 = p1_, *p2 = p2_; + return strcmp(p1->name, p2->name); +} + +#if 0 +static int hg_fp_cmp_id(const void *p1_, const void *p2_) +{ + const struct func_prototype *p1 = p1_, *p2 = p2_; + return p1->id - p2->id; +} +#endif + +static void gen_hdr(const char *funcn, int opcnt) +{ + int save_arg_vars[MAX_ARG_GRP] = { 0, }; + const struct parsed_proto *pp_c; + struct parsed_proto *pp; + struct func_prototype *fp; + struct func_proto_dep *dep; + struct parsed_data *pd; + struct parsed_op *po; + const char *tmpname; + int regmask_dummy = 0; + int regmask_save = 0; + int regmask_dst = 0; + int regmask_dep = 0; + int max_bp_offset = 0; + int has_ret = -1; + int from_caller = 0; + int i, j, l, ret; + int depth, reg; + + if ((hg_fp_cnt & 0xff) == 0) { + hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100)); + my_assert_not(hg_fp, NULL); + memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100); + } + + fp = &hg_fp[hg_fp_cnt]; + snprintf(fp->name, sizeof(fp->name), "%s", funcn); + fp->id = hg_fp_cnt; + fp->argc_stack = -1; + hg_fp_cnt++; + + // perhaps already in seed header? + pp_c = proto_parse(g_fhdr, funcn, 1); + if (pp_c != NULL) { + fp->argc_stack = pp_c->argc_stack; + fp->regmask_dep = get_pp_arg_regmask(pp_c); + fp->has_ret = !IS(pp_c->ret_type.name, "void"); + return; + } + + g_bp_frame = g_sp_frame = g_stack_fsz = 0; + g_stack_frame_used = 0; + + // pass1: + // - handle ebp/esp frame, remove ops related to it + scan_prologue_epilogue(opcnt); + + // pass2: + // - collect calls + // - resolve all branches + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + po->bt_i = -1; + po->btj = NULL; + + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL) { + tmpname = opr_name(po, 0); + pp = NULL; + if (po->operand[0].type == OPT_LABEL) { + hg_fp_add_dep(fp, tmpname); + + // perhaps a call to already known func? + pp_c = proto_parse(g_fhdr, tmpname, 1); + if (pp_c != NULL) + pp = proto_clone(pp_c); + } + else if (po->datap != NULL) { + pp = calloc(1, sizeof(*pp)); + my_assert_not(pp, NULL); + + ret = parse_protostr(po->datap, pp); + if (ret < 0) + ferr(po, "bad protostr supplied: %s\n", (char *)po->datap); + free(po->datap); + po->datap = NULL; + } + if (pp != NULL && pp->is_noreturn) + po->flags |= OPF_TAIL; + + po->pp = pp; + continue; + } + + if (!(po->flags & OPF_JMP) || po->op == OP_RET) + continue; + + if (po->operand[0].type == OPT_REGMEM) { + pd = try_resolve_jumptab(i, opcnt); + if (pd == NULL) + goto tailcall; + + po->btj = pd; + continue; + } + + for (l = 0; l < opcnt; l++) { + if (g_labels[l] != NULL + && IS(po->operand[0].name, g_labels[l])) + { + add_label_ref(&g_label_refs[l], i); + po->bt_i = l; + break; + } + } + + if (po->bt_i != -1 || (po->flags & OPF_RMD)) + continue; + + if (po->operand[0].type == OPT_LABEL) + // assume tail call + goto tailcall; + + ferr(po, "unhandled branch\n"); + +tailcall: + po->op = OP_CALL; + po->flags |= OPF_TAIL; + if (i > 0 && ops[i - 1].op == OP_POP) + po->flags |= OPF_ATAIL; + i--; // reprocess + } + + // pass3: + // - remove dead labels + // - process trivial calls + // - handle push /pop pairs + for (i = 0; i < opcnt; i++) + { + if (g_labels[i] != NULL && g_label_refs[i].i == -1) { + free(g_labels[i]); + g_labels[i] = NULL; + } + + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL) + { + pp = process_call_early(i, opcnt, &j); + if (pp != NULL) { + if (!(po->flags & OPF_ATAIL)) + // since we know the args, try to collect them + if (collect_call_args_early(po, i, pp, ®mask_dummy) != 0) + pp = NULL; + } + + if (pp != NULL) { + if (j >= 0) { + // commit esp adjust + ops[j].flags |= OPF_RMD; + if (ops[j].op != OP_POP) { + ferr_assert(&ops[j], ops[j].op == OP_ADD); + ops[j].operand[1].val -= pp->argc_stack * 4; + } + } + + po->flags |= OPF_DONE; + } + } + else if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST) { + scan_for_pop_const(i, opcnt); + } + } + + // pass4: + // - process calls + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + if (po->flags & OPF_RMD) + continue; + + if (po->op == OP_CALL && !(po->flags & OPF_DONE)) + { + pp = process_call(i, opcnt); + + if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) { + // since we know the args, collect them + collect_call_args(po, i, pp, ®mask_dummy, save_arg_vars, + i + opcnt * 2); + } + } + } + + // pass5: + // - track saved regs + // - try to figure out arg-regs + for (i = 0; i < opcnt; i++) + { + po = &ops[i]; + + if (po->flags & OPF_FARG) + /* (just calculate register deps) */; + else if (po->flags & OPF_RMD) + continue; + else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG) + { + reg = po->operand[0].reg; + if (reg < 0) + ferr(po, "reg not set for push?\n"); + + depth = 0; + ret = scan_for_pop(i + 1, opcnt, + po->operand[0].name, i + opcnt * 1, 0, &depth, 0); + if (ret == 1) { + regmask_save |= 1 << reg; + po->flags |= OPF_RMD; + scan_for_pop(i + 1, opcnt, + po->operand[0].name, i + opcnt * 2, 0, &depth, 1); + continue; + } + ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0); + if (ret == 0) { + regmask_save |= 1 << reg; + po->flags |= OPF_RMD; + scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, OPF_RMD); + continue; + } + } + else if (po->op == OP_CALL) { + po->regmask_dst |= 1 << xAX; + + dep = hg_fp_find_dep(fp, po->operand[0].name); + if (dep != NULL) + dep->regmask_live = regmask_save | regmask_dst; + } + else if (po->op == OP_RET) { + if (po->operand_cnt > 0) { + fp->is_stdcall = 1; + if (fp->argc_stack >= 0 + && fp->argc_stack != po->operand[0].val / 4) + ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4); + fp->argc_stack = po->operand[0].val / 4; + } + } + + if (has_ret != 0 && (po->flags & OPF_TAIL)) { + if (po->op == OP_CALL) { + j = i; + ret = 1; + } + else { + struct parsed_opr opr = { 0, }; + opr.type = OPT_REG; + opr.reg = xAX; + j = -1; + from_caller = 0; + ret = resolve_origin(i, &opr, i + opcnt * 3, &j, &from_caller); + } + + if (ret == -1 && from_caller) { + // unresolved eax - probably void func + has_ret = 0; + } + else { + if (ops[j].op == OP_CALL) { + dep = hg_fp_find_dep(fp, po->operand[0].name); + if (dep != NULL) + dep->ret_dep = 1; + else + has_ret = 1; + } + else + has_ret = 1; + } + } + + l = regmask_save | regmask_dst; + if (g_bp_frame && !(po->flags & OPF_EBP_S)) + l |= 1 << xBP; + + l = po->regmask_src & ~l; +#if 0 + if (l) + fnote(po, "dep |= %04x, dst %04x, save %04x\n", l, + regmask_dst, regmask_save); +#endif + regmask_dep |= l; + regmask_dst |= po->regmask_dst; + } + + if (has_ret == -1 && (regmask_dep & (1 << xAX))) + has_ret = 1; + + for (i = 0; i < g_eqcnt; i++) { + if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32) + max_bp_offset = g_eqs[i].offset; + } + + if (fp->argc_stack < 0) { + max_bp_offset = (max_bp_offset + 3) & ~3; + fp->argc_stack = max_bp_offset / 4; + if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0) + fp->argc_stack--; + } + + fp->regmask_dep = regmask_dep & ~(1 << xSP); + fp->has_ret = has_ret; + // output_hdr_fp(stdout, fp, 1); + + gen_x_cleanup(opcnt); +} + +static void hg_fp_resolve_deps(struct func_prototype *fp) +{ + struct func_prototype fp_s; + int i; + + // this thing is recursive, so mark first.. + fp->dep_resolved = 1; + + for (i = 0; i < fp->dep_func_cnt; i++) { + strcpy(fp_s.name, fp->dep_func[i].name); + fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt, + sizeof(hg_fp[0]), hg_fp_cmp_name); + if (fp->dep_func[i].proto != NULL) { + if (!fp->dep_func[i].proto->dep_resolved) + hg_fp_resolve_deps(fp->dep_func[i].proto); + + fp->regmask_dep |= ~fp->dep_func[i].regmask_live + & fp->dep_func[i].proto->regmask_dep; + + if (fp->has_ret == -1) + fp->has_ret = fp->dep_func[i].proto->has_ret; + } + } +} + +static void output_hdr_fp(FILE *fout, const struct func_prototype *fp, + int count) +{ + const struct parsed_proto *pp; + char *p, namebuf[NAMELEN]; + const char *name; + int regmask_dep; + int argc_stack; + int j, arg; + + for (; count > 0; count--, fp++) { + if (fp->has_ret == -1) + fprintf(fout, "// ret unresolved\n"); +#if 0 + fprintf(fout, "// dep:"); + for (j = 0; j < fp->dep_func_cnt; j++) { + fprintf(fout, " %s/", fp->dep_func[j].name); + if (fp->dep_func[j].proto != NULL) + fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep, + fp->dep_func[j].proto->has_ret); + } + fprintf(fout, "\n"); +#endif + + p = strchr(fp->name, '@'); + if (p != NULL) { + memcpy(namebuf, fp->name, p - fp->name); + namebuf[p - fp->name] = 0; + name = namebuf; + } + else + name = fp->name; + if (name[0] == '_') + name++; + + pp = proto_parse(g_fhdr, name, 1); + if (pp != NULL && pp->is_include) + continue; + + regmask_dep = fp->regmask_dep; + argc_stack = fp->argc_stack; + + fprintf(fout, fp->has_ret ? "int " : "void "); + if (regmask_dep && (fp->is_stdcall || argc_stack == 0) + && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0) + { + fprintf(fout, " __fastcall "); + if (!(regmask_dep & (1 << xDX)) && argc_stack == 0) + argc_stack = 1; + else + argc_stack += 2; + regmask_dep = 0; + } + else if (regmask_dep && !fp->is_stdcall) { + fprintf(fout, "/*__usercall*/ "); + } + else if (regmask_dep) { + fprintf(fout, "/*__userpurge*/ "); + } + else if (fp->is_stdcall) + fprintf(fout, " __stdcall "); + else + fprintf(fout, " __cdecl "); + + fprintf(fout, "%s(", name); + + arg = 0; + for (j = 0; j < xSP; j++) { + if (regmask_dep & (1 << j)) { + arg++; + if (arg != 1) + fprintf(fout, ", "); + fprintf(fout, "int a%d/*<%s>*/", arg, regs_r32[j]); + } + } + + for (j = 0; j < argc_stack; j++) { + arg++; + if (arg != 1) + fprintf(fout, ", "); + fprintf(fout, "int a%d", arg); + } + + fprintf(fout, ");\n"); + } +} + +static void output_hdr(FILE *fout) +{ + static const char *lmod_c_names[] = { + [OPLM_UNSPEC] = "???", + [OPLM_BYTE] = "uint8_t", + [OPLM_WORD] = "uint16_t", + [OPLM_DWORD] = "uint32_t", + [OPLM_QWORD] = "uint64_t", + }; + const struct scanned_var *var; + int i; + + // resolve deps + qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name); + for (i = 0; i < hg_fp_cnt; i++) + hg_fp_resolve_deps(&hg_fp[i]); + + // note: messes up .proto ptr, don't use + //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id); + + // output variables + for (i = 0; i < hg_var_cnt; i++) { + var = &hg_vars[i]; + + if (var->is_c_str) + fprintf(fout, "extern %-8s %s[];", "char", var->name); + else + fprintf(fout, "extern %-8s %s;", + lmod_c_names[var->lmod], var->name); + + if (var->is_seeded) + fprintf(fout, " // seeded"); + fprintf(fout, "\n"); + } + + fprintf(fout, "\n"); + + // output function prototypes + output_hdr_fp(fout, hg_fp, hg_fp_cnt); +} + +// read a line, truncating it if it doesn't fit +static char *my_fgets(char *s, size_t size, FILE *stream) +{ + char *ret, *ret2; + char buf[64]; + int p; + + p = size - 2; + if (p >= 0) + s[p] = 0; + + ret = fgets(s, size, stream); + if (ret != NULL && p >= 0 && s[p] != 0 && s[p] != '\n') { + p = sizeof(buf) - 2; + do { + buf[p] = 0; + ret2 = fgets(buf, sizeof(buf), stream); + } + while (ret2 != NULL && buf[p] != 0 && buf[p] != '\n'); + } + + return ret; +} + +// '=' needs special treatment +// also ' quote +static char *next_word_s(char *w, size_t wsize, char *s) +{ + size_t i; + + s = sskip(s); + + i = 0; + if (*s == '\'') { + w[0] = s[0]; + for (i = 1; i < wsize - 1; i++) { + if (s[i] == 0) { + printf("warning: missing closing quote: \"%s\"\n", s); + break; + } + if (s[i] == '\'') + break; + w[i] = s[i]; + } + } + + for (; i < wsize - 1; i++) { + if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0)) + break; + w[i] = s[i]; + } + w[i] = 0; + + if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=') + printf("warning: '%s' truncated\n", w); + + return s + i; +} + +static void scan_variables(FILE *fasm) +{ + const struct parsed_proto *pp_c; + struct scanned_var *var; + char line[256] = { 0, }; + char words[3][256]; + char *p = NULL; + int wordc; + int l; + + while (!feof(fasm)) + { + // skip to next data section + while (my_fgets(line, sizeof(line), fasm)) + { + asmln++; + + p = sskip(line); + if (*p == 0 || *p == ';') + continue; + + p = sskip(next_word_s(words[0], sizeof(words[0]), p)); + if (*p == 0 || *p == ';') + continue; - fprintf(fout, " goto %s;", po->operand[0].name); - break; + if (*p != 's' || !IS_START(p, "segment para public")) + continue; - case OP_CALL: - assert_operand_cnt(1); - if (po->operand[0].type != OPT_LABEL) - ferr(po, "unhandled call type\n"); + break; + } - pp = po->datap; - if (pp == NULL) - ferr(po, "NULL pp\n"); + if (p == NULL || !IS_START(p, "segment para public")) + break; + p = sskip(p + 19); - fprintf(fout, " "); - if (!IS(pp->ret_type, "void")) { - if (po->flags & OPF_TAIL) - fprintf(fout, "return "); - else - fprintf(fout, "eax = "); - if (strchr(pp->ret_type, '*')) - fprintf(fout, "(u32)"); - } + if (!IS_START(p, "'DATA'")) + continue; - fprintf(fout, "%s(", opr_name(po, 0)); - for (arg = 0; arg < pp->argc; arg++) { - if (arg > 0) - fprintf(fout, ", "); + // now process it + while (my_fgets(line, sizeof(line), fasm)) + { + asmln++; - if (strchr(pp->arg[arg].type, '*')) - fprintf(fout, "(%s)", pp->arg[arg].type); + p = line; + if (my_isblank(*p)) + continue; - if (pp->arg[arg].reg != NULL) { - fprintf(fout, "%s", pp->arg[arg].reg); - continue; - } + p = sskip(p); + if (*p == 0 || *p == ';') + 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)); - } + for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) { + words[wordc][0] = 0; + p = sskip(next_word_s(words[wordc], sizeof(words[0]), p)); + if (*p == 0 || *p == ';') { + wordc++; + break; } - fprintf(fout, ");"); + } - if (po->flags & OPF_TAIL) { - strcpy(g_comment, "tailcall"); - if (IS(pp->ret_type, "void")) - fprintf(fout, "\n return;"); - } - delayed_flag_op = NULL; - last_arith_dst = NULL; + if (wordc == 2 && IS(words[1], "ends")) break; + if (wordc < 2) + continue; - case OP_RET: - if (IS(g_func_pp.ret_type, "void")) - fprintf(fout, " return;"); - else - fprintf(fout, " return eax;"); - break; + if ((hg_var_cnt & 0xff) == 0) { + hg_vars = realloc(hg_vars, sizeof(hg_vars[0]) + * (hg_var_cnt + 0x100)); + my_assert_not(hg_vars, NULL); + memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100); + } - 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; + var = &hg_vars[hg_var_cnt++]; + snprintf(var->name, sizeof(var->name), "%s", words[0]); + + // maybe already in seed header? + pp_c = proto_parse(g_fhdr, var->name, 1); + if (pp_c != NULL) { + if (pp_c->is_func) + aerr("func?\n"); + else if (pp_c->is_fptr) { + var->lmod = OPLM_DWORD; + //var->is_ptr = 1; } - ferr(po, "push encountered\n"); - break; + else if (!guess_lmod_from_c_type(&var->lmod, &pp_c->type)) + aerr("unhandled C type '%s' for '%s'\n", + pp_c->type.name, var->name); - case OP_POP: - ferr(po, "pop encountered\n"); - break; + var->is_seeded = 1; + continue; + } - default: - no_output = 1; - ferr(po, "unhandled op type %d, flags %x\n", - po->op, po->flags); - break; + if (IS(words[1], "dd")) + var->lmod = OPLM_DWORD; + else if (IS(words[1], "dw")) + var->lmod = OPLM_WORD; + else if (IS(words[1], "db")) { + var->lmod = OPLM_BYTE; + if (wordc >= 3 && (l = strlen(words[2])) > 4) { + if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0")) + var->is_c_str = 1; + } + } + else if (IS(words[1], "dq")) + var->lmod = OPLM_QWORD; + //else if (IS(words[1], "dt")) + else + aerr("type '%s' not known\n", words[1]); } + } - if (g_comment[0] != 0) { - fprintf(fout, " // %s", g_comment); - g_comment[0] = 0; - no_output = 0; - } - if (!no_output) - fprintf(fout, "\n"); + rewind(fasm); + asmln = 0; +} - // 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; - } +static void set_label(int i, const char *name) +{ + const char *p; + int len; - if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) { - if (is_opr_modified(last_arith_dst, po)) - last_arith_dst = NULL; - } + len = strlen(name); + p = strchr(name, ':'); + if (p != NULL) + len = p - name; + + if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_")) + aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]); + g_labels[i] = realloc(g_labels[i], len + 1); + my_assert_not(g_labels[i], NULL); + memcpy(g_labels[i], name, len); + g_labels[i][len] = 0; +} + +struct chunk_item { + char *name; + long fptr; + int asmln; +}; + +static struct chunk_item *func_chunks; +static int func_chunk_cnt; +static int func_chunk_alloc; + +static void add_func_chunk(FILE *fasm, const char *name, int line) +{ + if (func_chunk_cnt >= func_chunk_alloc) { + func_chunk_alloc *= 2; + func_chunks = realloc(func_chunks, + func_chunk_alloc * sizeof(func_chunks[0])); + my_assert_not(func_chunks, NULL); } + func_chunks[func_chunk_cnt].fptr = ftell(fasm); + func_chunks[func_chunk_cnt].name = strdup(name); + func_chunks[func_chunk_cnt].asmln = line; + func_chunk_cnt++; +} - fprintf(fout, "}\n\n"); +static int cmp_chunks(const void *p1, const void *p2) +{ + const struct chunk_item *c1 = p1, *c2 = p2; + return strcmp(c1->name, c2->name); +} - // cleanup - for (i = 0; i < opcnt; i++) { - if (ops[i].op == OP_CALL) { - pp = ops[i].datap; - if (pp) { - proto_release(pp); - free(pp); +static int cmpstringp(const void *p1, const void *p2) +{ + return strcmp(*(char * const *)p1, *(char * const *)p2); +} + +static void scan_ahead(FILE *fasm) +{ + char words[2][256]; + char line[256]; + long oldpos; + int oldasmln; + int wordc; + char *p; + int i; + + oldpos = ftell(fasm); + oldasmln = asmln; + + while (my_fgets(line, sizeof(line), fasm)) + { + wordc = 0; + asmln++; + + p = sskip(line); + if (*p == 0) + continue; + + if (*p == ';') + { + // get rid of random tabs + for (i = 0; line[i] != 0; i++) + if (line[i] == '\t') + line[i] = ' '; + + if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR ")) + { + p += 30; + next_word(words[0], sizeof(words[0]), p); + if (words[0][0] == 0) + aerr("missing name for func chunk?\n"); + + add_func_chunk(fasm, words[0], asmln); + } + else if (IS_START(p, "; sctend")) + break; + + continue; + } // *p == ';' + + for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) { + words[wordc][0] = 0; + p = sskip(next_word_s(words[wordc], sizeof(words[0]), p)); + if (*p == 0 || *p == ';') { + wordc++; + break; } } + + if (wordc == 2 && IS(words[1], "ends")) + break; } - proto_release(&g_func_pp); + + fseek(fasm, oldpos, SEEK_SET); + asmln = oldasmln; } int main(int argc, char *argv[]) { - FILE *fout, *fasm, *fhdr; + FILE *fout, *fasm, *frlist; + struct parsed_data *pd = NULL; + int pd_alloc = 0; + char **rlist = NULL; + int rlist_len = 0; + int rlist_alloc = 0; + int func_chunks_used = 0; + int func_chunks_sorted = 0; + int func_chunk_i = -1; + long func_chunk_ret = 0; + int func_chunk_ret_ln = 0; + int scanned_ahead = 0; char line[256]; - char words[16][256]; + char words[20][256]; + enum opr_lenmod lmod; + char *sctproto = NULL; int in_func = 0; + int pending_endp = 0; + int skip_func = 0; + int skip_warned = 0; int eq_alloc; + int verbose = 0; + int multi_seg = 0; + int end = 0; + int arg_out; + int arg; int pi = 0; - int len; + int i, j; + int ret, len; char *p; int wordc; - if (argc != 4) { - printf("usage:\n%s <.c> <.asm> \n", - argv[0]); + for (arg = 1; arg < argc; arg++) { + if (IS(argv[arg], "-v")) + verbose = 1; + else if (IS(argv[arg], "-rf")) + g_allow_regfunc = 1; + else if (IS(argv[arg], "-m")) + multi_seg = 1; + else if (IS(argv[arg], "-hdr")) + g_header_mode = g_quiet_pp = g_allow_regfunc = 1; + else + break; + } + + if (argc < arg + 3) { + printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> [rlist]*\n" + "%s -hdr <.asm> [rlist]*\n", + argv[0], argv[0]); return 1; } - hdrfn = argv[3]; - fhdr = fopen(hdrfn, "r"); - my_assert_not(fhdr, NULL); + arg_out = arg++; - asmfn = argv[2]; + asmfn = argv[arg++]; fasm = fopen(asmfn, "r"); my_assert_not(fasm, NULL); - fout = fopen(argv[1], "w"); + hdrfn = argv[arg++]; + g_fhdr = fopen(hdrfn, "r"); + my_assert_not(g_fhdr, NULL); + + rlist_alloc = 64; + rlist = malloc(rlist_alloc * sizeof(rlist[0])); + my_assert_not(rlist, NULL); + // needs special handling.. + rlist[rlist_len++] = "__alloca_probe"; + + func_chunk_alloc = 32; + func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0])); + my_assert_not(func_chunks, NULL); + + memset(words, 0, sizeof(words)); + + for (; arg < argc; arg++) { + frlist = fopen(argv[arg], "r"); + my_assert_not(frlist, NULL); + + while (my_fgets(line, sizeof(line), frlist)) { + p = sskip(line); + if (*p == 0 || *p == ';') + continue; + if (*p == '#') { + if (IS_START(p, "#if 0") + || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC"))) + { + skip_func = 1; + } + else if (IS_START(p, "#endif")) + skip_func = 0; + continue; + } + if (skip_func) + continue; + + p = next_word(words[0], sizeof(words[0]), p); + if (words[0][0] == 0) + continue; + + if (rlist_len >= rlist_alloc) { + rlist_alloc = rlist_alloc * 2 + 64; + rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0])); + my_assert_not(rlist, NULL); + } + rlist[rlist_len++] = strdup(words[0]); + } + skip_func = 0; + + fclose(frlist); + frlist = NULL; + } + + if (rlist_len > 0) + qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp); + + fout = fopen(argv[arg_out], "w"); my_assert_not(fout, NULL); eq_alloc = 128; g_eqs = malloc(eq_alloc * sizeof(g_eqs[0])); my_assert_not(g_eqs, NULL); - while (fgets(line, sizeof(line), fasm)) + for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) { + g_label_refs[i].i = -1; + g_label_refs[i].next = NULL; + } + + if (g_header_mode) + scan_variables(fasm); + + while (my_fgets(line, sizeof(line), fasm)) { + wordc = 0; asmln++; p = sskip(line); - if (*p == 0 || *p == ';') + if (*p == 0) + continue; + + // get rid of random tabs + for (i = 0; line[i] != 0; i++) + if (line[i] == '\t') + line[i] = ' '; + + if (*p == ';') + { + if (p[2] == '=' && IS_START(p, "; =============== S U B")) + goto do_pending_endp; // eww.. + + if (p[2] == 'A' && IS_START(p, "; Attributes:")) + { + static const char *attrs[] = { + "bp-based frame", + "library function", + "static", + "noreturn", + "thunk", + "fpd=", + }; + + // parse IDA's attribute-list comment + g_ida_func_attr = 0; + p = sskip(p + 13); + + for (; *p != 0; p = sskip(p)) { + for (i = 0; i < ARRAY_SIZE(attrs); i++) { + if (!strncmp(p, attrs[i], strlen(attrs[i]))) { + g_ida_func_attr |= 1 << i; + p += strlen(attrs[i]); + break; + } + } + if (i == ARRAY_SIZE(attrs)) { + anote("unparsed IDA attr: %s\n", p); + break; + } + if (IS(attrs[i], "fpd=")) { + p = next_word(words[0], sizeof(words[0]), p); + // ignore for now.. + } + } + } + else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR ")) + { + p += 30; + next_word(words[0], sizeof(words[0]), p); + if (words[0][0] == 0) + aerr("missing name for func chunk?\n"); + + if (!scanned_ahead) { + add_func_chunk(fasm, words[0], asmln); + func_chunks_sorted = 0; + } + } + else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK")) + { + if (func_chunk_i >= 0) { + if (func_chunk_i < func_chunk_cnt + && IS(func_chunks[func_chunk_i].name, g_func)) + { + // move on to next chunk + ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET); + if (ret) + aerr("seek failed for '%s' chunk #%d\n", + g_func, func_chunk_i); + asmln = func_chunks[func_chunk_i].asmln; + func_chunk_i++; + } + else { + if (func_chunk_ret == 0) + aerr("no return from chunk?\n"); + fseek(fasm, func_chunk_ret, SEEK_SET); + asmln = func_chunk_ret_ln; + func_chunk_ret = 0; + pending_endp = 1; + } + } + } + else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) { + func_chunks_used = 1; + p += 20; + if (IS_START(g_func, "sub_")) { + unsigned long addr = strtoul(p, NULL, 16); + unsigned long f_addr = strtoul(g_func + 4, NULL, 16); + if (addr > f_addr && !scanned_ahead) { + anote("scan_ahead caused by '%s', addr %lx\n", + g_func, addr); + scan_ahead(fasm); + scanned_ahead = 1; + func_chunks_sorted = 0; + } + } + } continue; + } // *p == ';' - memset(words, 0, sizeof(words)); - for (wordc = 0; wordc < 16; wordc++) { - p = sskip(next_word(words[wordc], sizeof(words[0]), p)); +parse_words: + for (i = wordc; i < ARRAY_SIZE(words); i++) + words[i][0] = 0; + for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) { + p = sskip(next_word_s(words[wordc], sizeof(words[0]), p)); if (*p == 0 || *p == ';') { wordc++; break; } } + if (*p != 0 && *p != ';') + aerr("too many words\n"); + + // alow asm patches in comments + if (*p == ';') { + if (IS_START(p, "; sctpatch:")) { + p = sskip(p + 11); + if (*p == 0 || *p == ';') + continue; + goto parse_words; // lame + } + if (IS_START(p, "; sctproto:")) { + sctproto = strdup(p + 11); + } + else if (IS_START(p, "; sctend")) { + end = 1; + if (!pending_endp) + break; + } + } if (wordc == 0) { // shouldn't happen @@ -2025,34 +6572,203 @@ int main(int argc, char *argv[]) continue; } +do_pending_endp: + // do delayed endp processing to collect switch jumptables + if (pending_endp) { + if (in_func && !skip_func && !end && wordc >= 2 + && ((words[0][0] == 'd' && words[0][2] == 0) + || (words[1][0] == 'd' && words[1][2] == 0))) + { + i = 1; + if (words[1][0] == 'd' && words[1][2] == 0) { + // label + if (g_func_pd_cnt >= pd_alloc) { + pd_alloc = pd_alloc * 2 + 16; + g_func_pd = realloc(g_func_pd, + sizeof(g_func_pd[0]) * pd_alloc); + my_assert_not(g_func_pd, NULL); + } + pd = &g_func_pd[g_func_pd_cnt]; + g_func_pd_cnt++; + memset(pd, 0, sizeof(*pd)); + strcpy(pd->label, words[0]); + pd->type = OPT_CONST; + pd->lmod = lmod_from_directive(words[1]); + i = 2; + } + else { + if (pd == NULL) { + if (verbose) + anote("skipping alignment byte?\n"); + continue; + } + lmod = lmod_from_directive(words[0]); + if (lmod != pd->lmod) + aerr("lmod change? %d->%d\n", pd->lmod, lmod); + } + + if (pd->count_alloc < pd->count + wordc) { + pd->count_alloc = pd->count_alloc * 2 + 14 + wordc; + pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc); + my_assert_not(pd->d, NULL); + } + for (; i < wordc; i++) { + if (IS(words[i], "offset")) { + pd->type = OPT_OFFSET; + i++; + } + p = strchr(words[i], ','); + if (p != NULL) + *p = 0; + if (pd->type == OPT_OFFSET) + pd->d[pd->count].u.label = strdup(words[i]); + else + pd->d[pd->count].u.val = parse_number(words[i]); + pd->d[pd->count].bt_i = -1; + pd->count++; + } + continue; + } + + if (in_func && !skip_func) { + if (g_header_mode) + gen_hdr(g_func, pi); + else + gen_func(fout, g_fhdr, g_func, pi); + } + + pending_endp = 0; + in_func = 0; + g_ida_func_attr = 0; + skip_warned = 0; + skip_func = 0; + g_func[0] = 0; + func_chunks_used = 0; + func_chunk_i = -1; + if (pi != 0) { + memset(&ops, 0, pi * sizeof(ops[0])); + clear_labels(pi); + pi = 0; + } + g_eqcnt = 0; + for (i = 0; i < g_func_pd_cnt; i++) { + pd = &g_func_pd[i]; + if (pd->type == OPT_OFFSET) { + for (j = 0; j < pd->count; j++) + free(pd->d[j].u.label); + } + free(pd->d); + pd->d = NULL; + } + g_func_pd_cnt = 0; + pd = NULL; + + if (end) + break; + if (wordc == 0) + continue; + } + if (IS(words[1], "proc")) { if (in_func) aerr("proc '%s' while in_func '%s'?\n", words[0], g_func); + p = words[0]; + if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp)) + skip_func = 1; strcpy(g_func, words[0]); + set_label(0, words[0]); in_func = 1; continue; } - if (IS(words[1], "endp")) { + 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; + + if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1 + && ops[0].op == OP_JMP && ops[0].operand[0].had_ds) + { + // import jump + skip_func = 1; } - g_eqcnt = 0; + + if (!skip_func && func_chunks_used) { + // start processing chunks + struct chunk_item *ci, key = { g_func, 0 }; + + func_chunk_ret = ftell(fasm); + func_chunk_ret_ln = asmln; + if (!func_chunks_sorted) { + qsort(func_chunks, func_chunk_cnt, + sizeof(func_chunks[0]), cmp_chunks); + func_chunks_sorted = 1; + } + ci = bsearch(&key, func_chunks, func_chunk_cnt, + sizeof(func_chunks[0]), cmp_chunks); + if (ci == NULL) + aerr("'%s' needs chunks, but none found\n", g_func); + func_chunk_i = ci - func_chunks; + for (; func_chunk_i > 0; func_chunk_i--) + if (!IS(func_chunks[func_chunk_i - 1].name, g_func)) + break; + + ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET); + if (ret) + aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i); + asmln = func_chunks[func_chunk_i].asmln; + func_chunk_i++; + continue; + } + pending_endp = 1; + continue; + } + + if (wordc == 2 && IS(words[1], "ends")) { + if (!multi_seg) { + end = 1; + if (pending_endp) + goto do_pending_endp; + break; + } + + // scan for next text segment + while (my_fgets(line, sizeof(line), fasm)) { + asmln++; + p = sskip(line); + if (*p == 0 || *p == ';') + continue; + + if (strstr(p, "segment para public 'CODE' use32")) + break; + } + + continue; + } + + p = strchr(words[0], ':'); + if (p != NULL) { + set_label(pi, words[0]); + continue; + } + + if (!in_func || skip_func) { + if (!skip_warned && !skip_func && g_labels[pi] != NULL) { + if (verbose) + anote("skipping from '%s'\n", g_labels[pi]); + skip_warned = 1; + } + free(g_labels[pi]); + g_labels[pi] = NULL; continue; } - if (IS(words[1], "=")) { + if (wordc > 1 && IS(words[1], "=")) + { if (wordc != 5) aerr("unhandled equ, wc=%d\n", wordc); if (g_eqcnt >= eq_alloc) { @@ -2074,6 +6790,8 @@ int main(int argc, char *argv[]) g_eqs[g_eqcnt].lmod = OPLM_WORD; else if (IS(words[2], "byte")) g_eqs[g_eqcnt].lmod = OPLM_BYTE; + else if (IS(words[2], "qword")) + g_eqs[g_eqcnt].lmod = OPLM_QWORD; else aerr("bad lmod: '%s'\n", words[2]); @@ -2085,27 +6803,22 @@ int main(int argc, char *argv[]) if (pi >= ARRAY_SIZE(ops)) aerr("too many ops\n"); - 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; - } - parse_op(&ops[pi], words, wordc); - pi++; - (void)proto_parse; + if (sctproto != NULL) { + if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP) + ops[pi].datap = sctproto; + sctproto = NULL; + } + pi++; } + if (g_header_mode) + output_hdr(fout); + fclose(fout); fclose(fasm); - fclose(fhdr); + fclose(g_fhdr); return 0; }