5 * This work is licensed under the terms of 3-clause BSD license.
6 * See COPYING file in the top-level directory.
14 #include "my_assert.h"
17 #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
18 #define IS(w, y) !strcmp(w, y)
19 #define IS_START(w, y) !strncmp(w, y, strlen(y))
21 #include "protoparse.h"
23 static const char *asmfn;
27 #define anote(fmt, ...) \
28 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
29 #define awarn(fmt, ...) \
30 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
31 #define aerr(fmt, ...) do { \
32 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
37 #include "masm_tools.h"
40 OPF_RMD = (1 << 0), /* removed or optimized out */
41 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
42 OPF_FLAGS = (1 << 2), /* sets flags */
43 OPF_JMP = (1 << 3), /* branch, call */
44 OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz) */
45 OPF_CC = (1 << 5), /* uses flags */
46 OPF_TAIL = (1 << 6), /* ret or tail call */
47 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
48 OPF_REP = (1 << 8), /* prefixed by rep */
49 OPF_REPZ = (1 << 9), /* rep is repe/repz */
50 OPF_REPNZ = (1 << 10), /* rep is repne/repnz */
51 OPF_FARG = (1 << 11), /* push collected as func arg (no reuse) */
52 OPF_EBP_S = (1 << 12), /* ebp used as scratch here, not BP */
53 OPF_DF = (1 << 13), /* DF flag set */
54 OPF_ATAIL = (1 << 14), /* tail call with reused arg frame */
55 OPF_32BIT = (1 << 15), /* 32bit division */
56 OPF_LOCK = (1 << 16), /* op has lock prefix */
57 OPF_VAPUSH = (1 << 17), /* vararg ptr push (as call arg) */
122 // must be sorted (larger len must be further in enum)
130 #define MAX_OPERANDS 3
134 enum opr_lenmod lmod;
135 unsigned int is_ptr:1; // pointer in C
136 unsigned int is_array:1; // array in C
137 unsigned int type_from_var:1; // .. in header, sometimes wrong
138 unsigned int size_mismatch:1; // type override differs from C
139 unsigned int size_lt:1; // type override is larger than C
140 unsigned int had_ds:1; // had ds: prefix
141 const struct parsed_proto *pp; // for OPT_LABEL
149 struct parsed_opr operand[MAX_OPERANDS];
152 unsigned char pfo_inv;
153 unsigned char operand_cnt;
154 unsigned char p_argnum; // push: altered before call arg #
155 unsigned char p_argpass;// push: arg of host func
156 unsigned char pad[3];
157 int regmask_src; // all referensed regs
159 int pfomask; // flagop: parsed_flag_op that can't be delayed
160 int cc_scratch; // scratch storage during analysis
161 int bt_i; // branch target for branches
162 struct parsed_data *btj;// branch targets for jumptables
163 struct parsed_proto *pp;// parsed_proto for OP_CALL
169 // OP_CALL - parser proto hint (str)
170 // (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
171 // OP_POP - point to OP_PUSH in push/pop pair
175 enum opr_lenmod lmod;
182 enum opr_lenmod lmod;
196 struct label_ref *next;
200 IDAFA_BP_FRAME = (1 << 0),
201 IDAFA_LIB_FUNC = (1 << 1),
202 IDAFA_STATIC = (1 << 2),
203 IDAFA_NORETURN = (1 << 3),
204 IDAFA_THUNK = (1 << 4),
205 IDAFA_FPD = (1 << 5),
210 static struct parsed_op ops[MAX_OPS];
211 static struct parsed_equ *g_eqs;
213 static char g_labels[MAX_OPS][48];
214 static struct label_ref g_label_refs[MAX_OPS];
215 static const struct parsed_proto *g_func_pp;
216 static struct parsed_data *g_func_pd;
217 static int g_func_pd_cnt;
218 static char g_func[256];
219 static char g_comment[256];
220 static int g_bp_frame;
221 static int g_sp_frame;
222 static int g_stack_frame_used;
223 static int g_stack_fsz;
224 static int g_ida_func_attr;
225 static int g_allow_regfunc;
226 #define ferr(op_, fmt, ...) do { \
227 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
228 dump_op(op_), ##__VA_ARGS__); \
232 #define fnote(op_, fmt, ...) \
233 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
234 dump_op(op_), ##__VA_ARGS__)
238 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
239 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
240 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
241 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
243 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
245 // possible basic comparison types (without inversion)
246 enum parsed_flag_op {
250 PFO_BE, // 6 CF=1||ZF=1
254 PFO_LE, // e ZF=1||SF!=OF
257 static const char *parsed_flag_op_names[] = {
258 "o", "c", "z", "be", "s", "p", "l", "le"
261 static int char_array_i(const char *array[], size_t len, const char *s)
265 for (i = 0; i < len; i++)
272 static void printf_number(char *buf, size_t buf_size,
273 unsigned long number)
275 // output in C-friendly form
276 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
279 static int check_segment_prefix(const char *s)
281 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
295 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
299 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
301 *reg_lmod = OPLM_DWORD;
304 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
306 *reg_lmod = OPLM_WORD;
309 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
311 *reg_lmod = OPLM_BYTE;
314 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
316 *reg_lmod = OPLM_BYTE;
323 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
325 enum opr_lenmod lmod;
338 while (my_isblank(*s))
340 for (; my_issep(*s); d++, s++)
342 while (my_isblank(*s))
346 // skip '?s:' prefixes
347 if (check_segment_prefix(s))
350 s = next_idt(w, sizeof(w), s);
355 reg = parse_reg(&lmod, w);
357 *regmask |= 1 << reg;
361 if ('0' <= w[0] && w[0] <= '9') {
362 number = parse_number(w);
363 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
367 // probably some label/identifier - pass
370 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
374 strcpy(name, cvtbuf);
379 static int is_reg_in_str(const char *s)
383 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
386 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
387 if (!strncmp(s, regs_r32[i], 3))
393 static const char *parse_stack_el(const char *name, char *extra_reg,
396 const char *p, *p2, *s;
402 if (g_bp_frame || early_try)
405 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
407 if (extra_reg != NULL) {
408 strncpy(extra_reg, name, 3);
413 if (IS_START(p, "ebp+")) {
417 if (p2 != NULL && is_reg_in_str(p)) {
418 if (extra_reg != NULL) {
419 strncpy(extra_reg, p, p2 - p);
420 extra_reg[p2 - p] = 0;
425 if (!('0' <= *p && *p <= '9'))
432 if (!IS_START(name, "esp+"))
438 if (is_reg_in_str(s)) {
439 if (extra_reg != NULL) {
440 strncpy(extra_reg, s, p - s);
441 extra_reg[p - s] = 0;
446 aerr("%s IDA stackvar not set?\n", __func__);
448 if (!('0' <= *s && *s <= '9')) {
449 aerr("%s IDA stackvar offset not set?\n", __func__);
452 if (s[0] == '0' && s[1] == 'x')
455 if (len < sizeof(buf) - 1) {
456 strncpy(buf, s, len);
458 val = strtol(buf, &endp, 16);
459 if (val == 0 || *endp != 0) {
460 aerr("%s num parse fail for '%s'\n", __func__, buf);
469 if ('0' <= *p && *p <= '9')
475 static int guess_lmod_from_name(struct parsed_opr *opr)
477 if (!strncmp(opr->name, "dword_", 6)) {
478 opr->lmod = OPLM_DWORD;
481 if (!strncmp(opr->name, "word_", 5)) {
482 opr->lmod = OPLM_WORD;
485 if (!strncmp(opr->name, "byte_", 5)) {
486 opr->lmod = OPLM_BYTE;
492 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
493 const struct parsed_type *c_type)
495 static const char *dword_types[] = {
496 "int", "_DWORD", "UINT_PTR", "DWORD",
497 "WPARAM", "LPARAM", "UINT", "__int32",
498 "LONG", "HIMC", "BOOL", "size_t",
501 static const char *word_types[] = {
502 "uint16_t", "int16_t", "_WORD", "WORD",
503 "unsigned __int16", "__int16",
505 static const char *byte_types[] = {
506 "uint8_t", "int8_t", "char",
507 "unsigned __int8", "__int8", "BYTE", "_BYTE",
509 // structures.. deal the same as with _UNKNOWN for now
515 if (c_type->is_ptr) {
520 n = skip_type_mod(c_type->name);
522 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
523 if (IS(n, dword_types[i])) {
529 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
530 if (IS(n, word_types[i])) {
536 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
537 if (IS(n, byte_types[i])) {
546 static char *default_cast_to(char *buf, size_t buf_size,
547 struct parsed_opr *opr)
553 if (opr->pp == NULL || opr->pp->type.name == NULL
556 snprintf(buf, buf_size, "%s", "(void *)");
560 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
564 static enum opr_type lmod_from_directive(const char *d)
568 else if (IS(d, "dw"))
570 else if (IS(d, "db"))
573 aerr("unhandled directive: '%s'\n", d);
577 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
583 *regmask |= 1 << reg;
586 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
589 static int parse_operand(struct parsed_opr *opr,
590 int *regmask, int *regmask_indirect,
591 char words[16][256], int wordc, int w, unsigned int op_flags)
593 const struct parsed_proto *pp;
594 enum opr_lenmod tmplmod;
595 unsigned long number;
603 aerr("parse_operand w %d, wordc %d\n", w, wordc);
607 for (i = w; i < wordc; i++) {
608 len = strlen(words[i]);
609 if (words[i][len - 1] == ',') {
610 words[i][len - 1] = 0;
616 wordc_in = wordc - w;
618 if ((op_flags & OPF_JMP) && wordc_in > 0
619 && !('0' <= words[w][0] && words[w][0] <= '9'))
621 const char *label = NULL;
623 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
624 && IS(words[w + 1], "ptr"))
625 label = words[w + 2];
626 else if (wordc_in == 2 && IS(words[w], "short"))
627 label = words[w + 1];
628 else if (wordc_in == 1
629 && strchr(words[w], '[') == NULL
630 && parse_reg(&tmplmod, words[w]) < 0)
634 opr->type = OPT_LABEL;
635 ret = check_segment_prefix(label);
638 aerr("fs/gs used\n");
642 strcpy(opr->name, label);
648 if (IS(words[w + 1], "ptr")) {
649 if (IS(words[w], "dword"))
650 opr->lmod = OPLM_DWORD;
651 else if (IS(words[w], "word"))
652 opr->lmod = OPLM_WORD;
653 else if (IS(words[w], "byte"))
654 opr->lmod = OPLM_BYTE;
656 aerr("type parsing failed\n");
658 wordc_in = wordc - w;
663 if (IS(words[w], "offset")) {
664 opr->type = OPT_OFFSET;
665 opr->lmod = OPLM_DWORD;
666 strcpy(opr->name, words[w + 1]);
667 pp = proto_parse(g_fhdr, opr->name, 1);
670 if (IS(words[w], "(offset")) {
671 p = strchr(words[w + 1], ')');
673 aerr("parse of bracketed offset failed\n");
675 opr->type = OPT_OFFSET;
676 strcpy(opr->name, words[w + 1]);
682 aerr("parse_operand 1 word expected\n");
684 ret = check_segment_prefix(words[w]);
687 aerr("fs/gs used\n");
689 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
691 strcpy(opr->name, words[w]);
693 if (words[w][0] == '[') {
694 opr->type = OPT_REGMEM;
695 ret = sscanf(words[w], "[%[^]]]", opr->name);
697 aerr("[] parse failure\n");
699 parse_indmode(opr->name, regmask_indirect, 1);
700 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1))
703 struct parsed_equ *eq =
704 equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i);
706 opr->lmod = eq->lmod;
710 else if (strchr(words[w], '[')) {
712 p = strchr(words[w], '[');
713 opr->type = OPT_REGMEM;
714 parse_indmode(p, regmask_indirect, 0);
715 strncpy(buf, words[w], p - words[w]);
716 buf[p - words[w]] = 0;
717 pp = proto_parse(g_fhdr, buf, 1);
720 else if (('0' <= words[w][0] && words[w][0] <= '9')
721 || words[w][0] == '-')
723 number = parse_number(words[w]);
724 opr->type = OPT_CONST;
726 printf_number(opr->name, sizeof(opr->name), number);
730 ret = parse_reg(&tmplmod, opr->name);
732 setup_reg_opr(opr, ret, tmplmod, regmask);
736 // most likely var in data segment
737 opr->type = OPT_LABEL;
738 pp = proto_parse(g_fhdr, opr->name, 0);
742 if (pp->is_fptr || pp->is_func) {
743 opr->lmod = OPLM_DWORD;
747 tmplmod = OPLM_UNSPEC;
748 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
749 anote("unhandled C type '%s' for '%s'\n",
750 pp->type.name, opr->name);
752 if (opr->lmod == OPLM_UNSPEC) {
754 opr->type_from_var = 1;
756 else if (opr->lmod != tmplmod) {
757 opr->size_mismatch = 1;
758 if (tmplmod < opr->lmod)
761 opr->is_ptr = pp->type.is_ptr;
763 opr->is_array = pp->type.is_array;
767 if (opr->lmod == OPLM_UNSPEC)
768 guess_lmod_from_name(opr);
772 static const struct {
777 { "repe", OPF_REP|OPF_REPZ },
778 { "repz", OPF_REP|OPF_REPZ },
779 { "repne", OPF_REP|OPF_REPNZ },
780 { "repnz", OPF_REP|OPF_REPNZ },
781 { "lock", OPF_LOCK }, // ignored for now..
784 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
786 static const struct {
789 unsigned short minopr;
790 unsigned short maxopr;
793 unsigned char pfo_inv;
795 { "nop", OP_NOP, 0, 0, 0 },
796 { "push", OP_PUSH, 1, 1, 0 },
797 { "pop", OP_POP, 1, 1, OPF_DATA },
798 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
799 { "mov" , OP_MOV, 2, 2, OPF_DATA },
800 { "lea", OP_LEA, 2, 2, OPF_DATA },
801 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
802 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
803 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
804 { "not", OP_NOT, 1, 1, OPF_DATA },
805 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
806 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
807 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
808 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
809 { "stosb",OP_STOS, 0, 0, OPF_DATA },
810 { "stosw",OP_STOS, 0, 0, OPF_DATA },
811 { "stosd",OP_STOS, 0, 0, OPF_DATA },
812 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
813 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
814 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
815 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
816 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
817 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
818 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
819 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
820 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
821 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
822 { "cld", OP_CLD, 0, 0, OPF_DATA },
823 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
824 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
825 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
826 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
827 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
828 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
829 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
830 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
831 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
832 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
833 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
834 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
835 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
836 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
837 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
838 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
839 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
840 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
841 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
842 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
843 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
844 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
845 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
846 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
847 { "test", OP_TEST, 2, 2, OPF_FLAGS },
848 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
849 { "retn", OP_RET, 0, 1, OPF_TAIL },
850 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
851 { "jmp", OP_JMP, 1, 1, OPF_JMP },
852 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
853 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
854 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
855 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
856 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
857 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
858 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
859 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
860 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
861 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
862 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
863 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
864 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
865 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
866 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
867 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
868 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
869 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
870 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
871 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
872 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
873 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
874 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
875 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
876 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
877 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
878 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
879 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
880 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
881 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
882 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
883 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
884 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
885 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
886 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
887 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
888 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
889 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
890 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
891 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
892 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
893 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
894 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
895 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
896 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
897 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
898 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
899 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
900 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
901 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
902 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
903 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
904 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
905 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
906 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
907 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
908 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
909 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
910 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
913 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
915 enum opr_lenmod lmod = OPLM_UNSPEC;
916 int prefix_flags = 0;
924 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
925 if (IS(words[w], pref_table[i].name)) {
926 prefix_flags = pref_table[i].flags;
933 aerr("lone prefix: '%s'\n", words[0]);
938 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
939 if (IS(words[w], op_table[i].name))
943 if (i == ARRAY_SIZE(op_table))
944 aerr("unhandled op: '%s'\n", words[0]);
947 op->op = op_table[i].op;
948 op->flags = op_table[i].flags | prefix_flags;
949 op->pfo = op_table[i].pfo;
950 op->pfo_inv = op_table[i].pfo_inv;
951 op->regmask_src = op->regmask_dst = 0;
954 for (opr = 0; opr < op_table[i].minopr; opr++) {
955 regmask = regmask_ind = 0;
956 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
957 words, wordc, w, op->flags);
959 if (opr == 0 && (op->flags & OPF_DATA))
960 op->regmask_dst = regmask;
961 // for now, mark dst as src too
962 op->regmask_src |= regmask | regmask_ind;
965 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
966 w = parse_operand(&op->operand[opr],
967 &op->regmask_src, &op->regmask_src,
968 words, wordc, w, op->flags);
972 aerr("parse_op %s incomplete: %d/%d\n",
976 op->operand_cnt = opr;
977 if (!strncmp(op_table[i].name, "set", 3))
978 op->operand[0].lmod = OPLM_BYTE;
980 // ops with implicit argumets
984 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
985 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
991 if (op->operand_cnt != 0)
993 if (words[op_w][4] == 'b')
995 else if (words[op_w][4] == 'w')
997 else if (words[op_w][4] == 'd')
1000 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
1001 lmod, &op->regmask_src);
1002 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
1003 op->regmask_dst = op->regmask_src;
1004 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
1005 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1010 if (op->operand_cnt != 0)
1012 if (words[op_w][4] == 'b')
1014 else if (words[op_w][4] == 'w')
1016 else if (words[op_w][4] == 'd')
1018 op->operand_cnt = 3;
1019 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
1020 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
1021 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
1022 op->regmask_dst = op->regmask_src;
1026 op->regmask_src |= op->regmask_dst;
1027 op->regmask_dst |= op->regmask_src;
1031 op->operand_cnt = 1;
1032 op->regmask_src = 1 << xCX;
1033 op->operand[0].type = OPT_REG;
1034 op->operand[0].reg = xCX;
1035 op->operand[0].lmod = OPLM_DWORD;
1039 if (op->operand_cnt != 1)
1044 op->regmask_dst = (1 << xDX) | (1 << xAX);
1045 op->regmask_src |= (1 << xAX);
1046 if (op->operand[0].lmod == OPLM_UNSPEC)
1047 op->operand[0].lmod = OPLM_DWORD;
1052 // we could set up operands for edx:eax, but there is no real need to
1053 // (see is_opr_modified())
1054 regmask = (1 << xDX) | (1 << xAX);
1055 op->regmask_dst = regmask;
1056 op->regmask_src |= regmask;
1057 if (op->operand[0].lmod == OPLM_UNSPEC)
1058 op->operand[0].lmod = OPLM_DWORD;
1066 if (op->operand[1].lmod == OPLM_UNSPEC)
1067 op->operand[1].lmod = OPLM_BYTE;
1071 if (op->operand[2].lmod == OPLM_UNSPEC)
1072 op->operand[2].lmod = OPLM_BYTE;
1076 if (op->operand[0].lmod == OPLM_UNSPEC
1077 && (op->operand[0].type == OPT_CONST
1078 || op->operand[0].type == OPT_OFFSET
1079 || op->operand[0].type == OPT_LABEL))
1080 op->operand[0].lmod = OPLM_DWORD;
1086 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1087 && op->operand[0].lmod == op->operand[1].lmod
1088 && op->operand[0].reg == op->operand[1].reg
1089 && IS(op->operand[0].name, op->operand[1].name)) // ah, al..
1091 op->flags |= OPF_RMD;
1092 op->regmask_src = op->regmask_dst = 0;
1097 if (op->operand[0].type == OPT_REG
1098 && op->operand[1].type == OPT_REGMEM)
1101 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1102 if (IS(buf, op->operand[1].name))
1103 op->flags |= OPF_RMD;
1108 // trashed regs must be explicitly detected later
1109 op->regmask_dst = 0;
1117 static const char *op_name(struct parsed_op *po)
1119 static char buf[16];
1123 if (po->op == OP_JCC || po->op == OP_SCC) {
1125 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1128 strcpy(p, parsed_flag_op_names[po->pfo]);
1132 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1133 if (op_table[i].op == po->op)
1134 return op_table[i].name;
1140 static const char *dump_op(struct parsed_op *po)
1142 static char out[128];
1149 snprintf(out, sizeof(out), "%s", op_name(po));
1150 for (i = 0; i < po->operand_cnt; i++) {
1154 snprintf(p, sizeof(out) - (p - out),
1155 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1156 po->operand[i].name);
1162 static const char *lmod_type_u(struct parsed_op *po,
1163 enum opr_lenmod lmod)
1173 ferr(po, "invalid lmod: %d\n", lmod);
1174 return "(_invalid_)";
1178 static const char *lmod_cast_u(struct parsed_op *po,
1179 enum opr_lenmod lmod)
1189 ferr(po, "invalid lmod: %d\n", lmod);
1190 return "(_invalid_)";
1194 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1195 enum opr_lenmod lmod)
1205 ferr(po, "invalid lmod: %d\n", lmod);
1206 return "(_invalid_)";
1210 static const char *lmod_cast_s(struct parsed_op *po,
1211 enum opr_lenmod lmod)
1221 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1222 return "(_invalid_)";
1226 static const char *lmod_cast(struct parsed_op *po,
1227 enum opr_lenmod lmod, int is_signed)
1230 lmod_cast_s(po, lmod) :
1231 lmod_cast_u(po, lmod);
1234 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1244 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1249 static const char *opr_name(struct parsed_op *po, int opr_num)
1251 if (opr_num >= po->operand_cnt)
1252 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1253 return po->operand[opr_num].name;
1256 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1258 if (opr_num >= po->operand_cnt)
1259 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1260 if (po->operand[opr_num].type != OPT_CONST)
1261 ferr(po, "opr %d: const expected\n", opr_num);
1262 return po->operand[opr_num].val;
1265 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1267 if ((unsigned int)popr->reg >= MAX_REGS)
1268 ferr(po, "invalid reg: %d\n", popr->reg);
1269 return regs_r32[popr->reg];
1272 // cast1 is the "final" cast
1273 static const char *simplify_cast(const char *cast1, const char *cast2)
1275 static char buf[256];
1281 if (IS(cast1, cast2))
1283 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1285 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1287 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1289 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1291 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1294 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1298 static const char *simplify_cast_num(const char *cast, unsigned int val)
1300 if (IS(cast, "(u8)") && val < 0x100)
1302 if (IS(cast, "(s8)") && val < 0x80)
1304 if (IS(cast, "(u16)") && val < 0x10000)
1306 if (IS(cast, "(s16)") && val < 0x8000)
1308 if (IS(cast, "(s32)") && val < 0x80000000)
1314 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1323 namelen = strlen(name);
1325 p = strchr(name, '+');
1329 ferr(po, "equ parse failed for '%s'\n", name);
1331 if (IS_START(p, "0x"))
1333 *extra_offs = strtol(p, &endp, 16);
1335 ferr(po, "equ parse failed for '%s'\n", name);
1338 for (i = 0; i < g_eqcnt; i++)
1339 if (strncmp(g_eqs[i].name, name, namelen) == 0
1340 && g_eqs[i].name[namelen] == 0)
1344 ferr(po, "unresolved equ name: '%s'\n", name);
1351 static int is_stack_access(struct parsed_op *po,
1352 const struct parsed_opr *popr)
1354 return (parse_stack_el(popr->name, NULL, 0)
1355 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1356 && IS_START(popr->name, "ebp")));
1359 static void parse_stack_access(struct parsed_op *po,
1360 const char *name, char *ofs_reg, int *offset_out,
1361 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1363 const char *bp_arg = "";
1364 const char *p = NULL;
1365 struct parsed_equ *eq;
1372 if (IS_START(name, "ebp-")
1373 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1376 if (IS_START(p, "0x"))
1378 offset = strtoul(p, &endp, 16);
1382 ferr(po, "ebp- parse of '%s' failed\n", name);
1385 bp_arg = parse_stack_el(name, ofs_reg, 0);
1386 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1387 eq = equ_find(po, bp_arg, &offset);
1389 ferr(po, "detected but missing eq\n");
1390 offset += eq->offset;
1393 if (!strncmp(name, "ebp", 3))
1396 // yes it sometimes LEAs ra for compares..
1397 if (!is_lea && ofs_reg[0] == 0
1398 && stack_ra <= offset && offset < stack_ra + 4)
1400 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1403 *offset_out = offset;
1404 *stack_ra_out = stack_ra;
1406 *bp_arg_out = bp_arg;
1409 static int stack_frame_access(struct parsed_op *po,
1410 struct parsed_opr *popr, char *buf, size_t buf_size,
1411 const char *name, const char *cast, int is_src, int is_lea)
1413 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1414 const char *prefix = "";
1415 const char *bp_arg = NULL;
1416 char ofs_reg[16] = { 0, };
1417 int i, arg_i, arg_s;
1425 if (po->flags & OPF_EBP_S)
1426 ferr(po, "stack_frame_access while ebp is scratch\n");
1428 parse_stack_access(po, name, ofs_reg, &offset,
1429 &stack_ra, &bp_arg, is_lea);
1431 if (offset > stack_ra)
1433 arg_i = (offset - stack_ra - 4) / 4;
1434 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1436 if (g_func_pp->is_vararg
1437 && arg_i == g_func_pp->argc_stack && is_lea)
1439 // should be va_list
1442 snprintf(buf, buf_size, "%sap", cast);
1445 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1446 offset, bp_arg, arg_i);
1448 if (ofs_reg[0] != 0)
1449 ferr(po, "offset reg on arg access?\n");
1451 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1452 if (g_func_pp->arg[i].reg != NULL)
1458 if (i == g_func_pp->argc)
1459 ferr(po, "arg %d not in prototype?\n", arg_i);
1461 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1468 ferr(po, "lea/byte to arg?\n");
1469 if (is_src && (offset & 3) == 0)
1470 snprintf(buf, buf_size, "%sa%d",
1471 simplify_cast(cast, "(u8)"), i + 1);
1473 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1474 cast, offset & 3, i + 1);
1479 ferr(po, "lea/word to arg?\n");
1484 ferr(po, "problematic arg store\n");
1485 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1486 simplify_cast(cast, "*(u16 *)"), i + 1);
1489 ferr(po, "unaligned arg word load\n");
1491 else if (is_src && (offset & 2) == 0)
1492 snprintf(buf, buf_size, "%sa%d",
1493 simplify_cast(cast, "(u16)"), i + 1);
1495 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1496 cast, (offset & 2) ? "HI" : "LO", i + 1);
1508 snprintf(buf, buf_size, "(u32)&a%d + %d",
1511 ferr(po, "unaligned arg store\n");
1513 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1514 snprintf(buf, buf_size, "%s(a%d >> %d)",
1515 prefix, i + 1, (offset & 3) * 8);
1519 snprintf(buf, buf_size, "%s%sa%d",
1520 prefix, is_lea ? "&" : "", i + 1);
1525 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1529 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1532 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1533 if (tmp_lmod != OPLM_DWORD
1534 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1535 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1537 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1538 i + 1, offset, g_func_pp->arg[i].type.name);
1540 // can't check this because msvc likes to reuse
1541 // arg space for scratch..
1542 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1543 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1547 if (g_stack_fsz == 0)
1548 ferr(po, "stack var access without stackframe\n");
1549 g_stack_frame_used = 1;
1551 sf_ofs = g_stack_fsz + offset;
1552 lim = (ofs_reg[0] != 0) ? -4 : 0;
1553 if (offset > 0 || sf_ofs < lim)
1554 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1564 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1565 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1569 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1570 // known unaligned or possibly unaligned
1571 strcat(g_comment, " unaligned");
1573 prefix = "*(u16 *)&";
1574 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1575 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1578 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1582 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1583 // known unaligned or possibly unaligned
1584 strcat(g_comment, " unaligned");
1586 prefix = "*(u32 *)&";
1587 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1588 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1591 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1595 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1602 static void check_func_pp(struct parsed_op *po,
1603 const struct parsed_proto *pp, const char *pfx)
1605 enum opr_lenmod tmp_lmod;
1609 if (pp->argc_reg != 0) {
1610 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1611 pp_print(buf, sizeof(buf), pp);
1612 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1614 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1615 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1616 pfx, pp->argc_reg, pp->argc_stack);
1619 // fptrs must use 32bit args, callsite might have no information and
1620 // lack a cast to smaller types, which results in incorrectly masked
1621 // args passed (callee may assume masked args, it does on ARM)
1622 if (!pp->is_oslib) {
1623 for (i = 0; i < pp->argc; i++) {
1624 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1625 if (ret && tmp_lmod != OPLM_DWORD)
1626 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1627 i + 1, pp->arg[i].type.name);
1632 static const char *check_label_read_ref(struct parsed_op *po,
1635 const struct parsed_proto *pp;
1637 pp = proto_parse(g_fhdr, name, 0);
1639 ferr(po, "proto_parse failed for ref '%s'\n", name);
1642 check_func_pp(po, pp, "ref");
1647 static char *out_src_opr(char *buf, size_t buf_size,
1648 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1651 char tmp1[256], tmp2[256];
1660 switch (popr->type) {
1663 ferr(po, "lea from reg?\n");
1665 switch (popr->lmod) {
1667 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1670 snprintf(buf, buf_size, "%s%s",
1671 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1674 if (popr->name[1] == 'h') // XXX..
1675 snprintf(buf, buf_size, "%s(%s >> 8)",
1676 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1678 snprintf(buf, buf_size, "%s%s",
1679 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1682 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1687 if (is_stack_access(po, popr)) {
1688 stack_frame_access(po, popr, buf, buf_size,
1689 popr->name, cast, 1, is_lea);
1693 strcpy(expr, popr->name);
1694 if (strchr(expr, '[')) {
1695 // special case: '[' can only be left for label[reg] form
1696 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1698 ferr(po, "parse failure for '%s'\n", expr);
1699 if (tmp1[0] == '(') {
1700 // (off_4FFF50+3)[eax]
1701 p = strchr(tmp1 + 1, ')');
1702 if (p == NULL || p[1] != 0)
1703 ferr(po, "parse failure (2) for '%s'\n", expr);
1705 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1707 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1710 // XXX: do we need more parsing?
1712 snprintf(buf, buf_size, "%s", expr);
1716 snprintf(buf, buf_size, "%s(%s)",
1717 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1721 name = check_label_read_ref(po, popr->name);
1722 if (cast[0] == 0 && popr->is_ptr)
1726 snprintf(buf, buf_size, "(u32)&%s", name);
1727 else if (popr->size_lt)
1728 snprintf(buf, buf_size, "%s%s%s%s", cast,
1729 lmod_cast_u_ptr(po, popr->lmod),
1730 popr->is_array ? "" : "&", name);
1732 snprintf(buf, buf_size, "%s%s%s", cast, name,
1733 popr->is_array ? "[0]" : "");
1737 name = check_label_read_ref(po, popr->name);
1741 ferr(po, "lea an offset?\n");
1742 snprintf(buf, buf_size, "%s&%s", cast, name);
1747 ferr(po, "lea from const?\n");
1749 printf_number(tmp1, sizeof(tmp1), popr->val);
1750 if (popr->val == 0 && strchr(cast, '*'))
1751 snprintf(buf, buf_size, "NULL");
1753 snprintf(buf, buf_size, "%s%s",
1754 simplify_cast_num(cast, popr->val), tmp1);
1758 ferr(po, "invalid src type: %d\n", popr->type);
1764 // note: may set is_ptr (we find that out late for ebp frame..)
1765 static char *out_dst_opr(char *buf, size_t buf_size,
1766 struct parsed_op *po, struct parsed_opr *popr)
1768 switch (popr->type) {
1770 switch (popr->lmod) {
1772 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1776 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1780 if (popr->name[1] == 'h') // XXX..
1781 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1783 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1786 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1791 if (is_stack_access(po, popr)) {
1792 stack_frame_access(po, popr, buf, buf_size,
1793 popr->name, "", 0, 0);
1797 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1800 if (popr->size_mismatch)
1801 snprintf(buf, buf_size, "%s%s%s",
1802 lmod_cast_u_ptr(po, popr->lmod),
1803 popr->is_array ? "" : "&", popr->name);
1805 snprintf(buf, buf_size, "%s%s", popr->name,
1806 popr->is_array ? "[0]" : "");
1810 ferr(po, "invalid dst type: %d\n", popr->type);
1816 static char *out_src_opr_u32(char *buf, size_t buf_size,
1817 struct parsed_op *po, struct parsed_opr *popr)
1819 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1822 static void out_test_for_cc(char *buf, size_t buf_size,
1823 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1824 enum opr_lenmod lmod, const char *expr)
1826 const char *cast, *scast;
1828 cast = lmod_cast_u(po, lmod);
1829 scast = lmod_cast_s(po, lmod);
1833 case PFO_BE: // CF=1||ZF=1; CF=0
1834 snprintf(buf, buf_size, "(%s%s %s 0)",
1835 cast, expr, is_inv ? "!=" : "==");
1839 case PFO_L: // SF!=OF; OF=0
1840 snprintf(buf, buf_size, "(%s%s %s 0)",
1841 scast, expr, is_inv ? ">=" : "<");
1844 case PFO_LE: // ZF=1||SF!=OF; OF=0
1845 snprintf(buf, buf_size, "(%s%s %s 0)",
1846 scast, expr, is_inv ? ">" : "<=");
1850 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1854 static void out_cmp_for_cc(char *buf, size_t buf_size,
1855 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1857 const char *cast, *scast, *cast_use;
1858 char buf1[256], buf2[256];
1859 enum opr_lenmod lmod;
1861 if (po->operand[0].lmod != po->operand[1].lmod)
1862 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1863 po->operand[0].lmod, po->operand[1].lmod);
1864 lmod = po->operand[0].lmod;
1866 cast = lmod_cast_u(po, lmod);
1867 scast = lmod_cast_s(po, lmod);
1883 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1886 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1887 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
1891 // note: must be unsigned compare
1892 snprintf(buf, buf_size, "(%s %s %s)",
1893 buf1, is_inv ? ">=" : "<", buf2);
1897 snprintf(buf, buf_size, "(%s %s %s)",
1898 buf1, is_inv ? "!=" : "==", buf2);
1902 // note: must be unsigned compare
1903 snprintf(buf, buf_size, "(%s %s %s)",
1904 buf1, is_inv ? ">" : "<=", buf2);
1907 if (is_inv && lmod == OPLM_BYTE
1908 && po->operand[1].type == OPT_CONST
1909 && po->operand[1].val == 0xff)
1911 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
1912 snprintf(buf, buf_size, "(0)");
1916 // note: must be signed compare
1918 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1919 scast, buf1, buf2, is_inv ? ">=" : "<");
1923 snprintf(buf, buf_size, "(%s %s %s)",
1924 buf1, is_inv ? ">=" : "<", buf2);
1928 snprintf(buf, buf_size, "(%s %s %s)",
1929 buf1, is_inv ? ">" : "<=", buf2);
1937 static void out_cmp_test(char *buf, size_t buf_size,
1938 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1940 char buf1[256], buf2[256], buf3[256];
1942 if (po->op == OP_TEST) {
1943 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1944 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1947 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1948 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1949 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1951 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1952 po->operand[0].lmod, buf3);
1954 else if (po->op == OP_CMP) {
1955 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
1958 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1961 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1962 struct parsed_opr *popr2)
1964 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1965 ferr(po, "missing lmod for both operands\n");
1967 if (popr1->lmod == OPLM_UNSPEC)
1968 popr1->lmod = popr2->lmod;
1969 else if (popr2->lmod == OPLM_UNSPEC)
1970 popr2->lmod = popr1->lmod;
1971 else if (popr1->lmod != popr2->lmod) {
1972 if (popr1->type_from_var) {
1973 popr1->size_mismatch = 1;
1974 if (popr1->lmod < popr2->lmod)
1976 popr1->lmod = popr2->lmod;
1978 else if (popr2->type_from_var) {
1979 popr2->size_mismatch = 1;
1980 if (popr2->lmod < popr1->lmod)
1982 popr2->lmod = popr1->lmod;
1985 ferr(po, "conflicting lmods: %d vs %d\n",
1986 popr1->lmod, popr2->lmod);
1990 static const char *op_to_c(struct parsed_op *po)
2014 ferr(po, "op_to_c was supplied with %d\n", po->op);
2018 static void op_set_clear_flag(struct parsed_op *po,
2019 enum op_flags flag_set, enum op_flags flag_clear)
2021 po->flags |= flag_set;
2022 po->flags &= ~flag_clear;
2025 // last op in stream - unconditional branch or ret
2026 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2027 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2028 && ops[_i].op != OP_CALL))
2030 static int scan_for_pop(int i, int opcnt, const char *reg,
2031 int magic, int depth, int *maxdepth, int do_flags)
2033 const struct parsed_proto *pp;
2034 struct parsed_op *po;
2038 for (; i < opcnt; i++) {
2040 if (po->cc_scratch == magic)
2041 break; // already checked
2042 po->cc_scratch = magic;
2044 if (po->flags & OPF_TAIL) {
2045 if (po->op == OP_CALL) {
2046 pp = proto_parse(g_fhdr, po->operand[0].name, 0);
2047 if (pp != NULL && pp->is_noreturn)
2048 // no stack cleanup for noreturn
2051 return -1; // deadend
2054 if ((po->flags & OPF_RMD)
2055 || (po->op == OP_PUSH && po->p_argnum != 0)) // arg push
2058 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2059 if (po->btj != NULL) {
2061 for (j = 0; j < po->btj->count; j++) {
2062 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
2063 depth, maxdepth, do_flags);
2065 return ret; // dead end
2071 ferr(po, "dead branch\n");
2075 if (po->flags & OPF_CJMP) {
2076 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2077 depth, maxdepth, do_flags);
2079 return ret; // dead end
2087 if ((po->op == OP_POP || po->op == OP_PUSH)
2088 && po->operand[0].type == OPT_REG
2089 && IS(po->operand[0].name, reg))
2091 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)) {
2093 if (depth > *maxdepth)
2096 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2098 else if (po->op == OP_POP) {
2101 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2106 if (depth < 0) // should not happen
2107 ferr(po, "fail with depth\n");
2109 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2118 // scan for pop starting from 'ret' op (all paths)
2119 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2125 for (; i < opcnt; i++) {
2126 if (!(ops[i].flags & OPF_TAIL))
2129 for (j = i - 1; j >= 0; j--) {
2130 if (ops[j].flags & OPF_RMD)
2132 if (ops[j].flags & OPF_JMP)
2135 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
2136 && IS(ops[j].operand[0].name, reg))
2139 ops[j].flags |= flag_set;
2143 if (g_labels[j][0] != 0)
2148 return found ? 0 : -1;
2151 static void scan_propagate_df(int i, int opcnt)
2153 struct parsed_op *po = &ops[i];
2156 for (; i < opcnt; i++) {
2158 if (po->flags & OPF_DF)
2159 return; // already resolved
2160 po->flags |= OPF_DF;
2162 if (po->op == OP_CALL)
2163 ferr(po, "call with DF set?\n");
2165 if (po->flags & OPF_JMP) {
2166 if (po->btj != NULL) {
2168 for (j = 0; j < po->btj->count; j++)
2169 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2174 ferr(po, "dead branch\n");
2178 if (po->flags & OPF_CJMP)
2179 scan_propagate_df(po->bt_i, opcnt);
2185 if (po->flags & OPF_TAIL)
2188 if (po->op == OP_CLD) {
2189 po->flags |= OPF_RMD;
2194 ferr(po, "missing DF clear?\n");
2197 // is operand 'opr' modified by parsed_op 'po'?
2198 static int is_opr_modified(const struct parsed_opr *opr,
2199 const struct parsed_op *po)
2203 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2206 if (opr->type == OPT_REG) {
2207 if (po->op == OP_CALL) {
2208 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2209 if ((1 << opr->reg) & mask)
2215 if (po->operand[0].type == OPT_REG) {
2216 if (po->regmask_dst & (1 << opr->reg))
2223 return IS(po->operand[0].name, opr->name);
2226 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2227 static int is_any_opr_modified(const struct parsed_op *po_test,
2228 const struct parsed_op *po, int c_mode)
2233 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2236 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2239 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2242 // in reality, it can wreck any register, but in decompiled C
2243 // version it can only overwrite eax or edx:eax
2244 mask = (1 << xAX) | (1 << xDX);
2248 if (po->op == OP_CALL
2249 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2252 for (i = 0; i < po_test->operand_cnt; i++)
2253 if (IS(po_test->operand[i].name, po->operand[0].name))
2259 // scan for any po_test operand modification in range given
2260 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2263 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2266 for (; i < opcnt; i++) {
2267 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2274 // scan for po_test operand[0] modification in range given
2275 static int scan_for_mod_opr0(struct parsed_op *po_test,
2278 for (; i < opcnt; i++) {
2279 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2286 static int scan_for_flag_set(int i, int magic, int *branched,
2287 int *setters, int *setter_cnt)
2289 struct label_ref *lr;
2293 if (ops[i].cc_scratch == magic) {
2294 ferr(&ops[i], "%s looped\n", __func__);
2297 ops[i].cc_scratch = magic;
2299 if (g_labels[i][0] != 0) {
2302 lr = &g_label_refs[i];
2303 for (; lr->next; lr = lr->next) {
2304 ret = scan_for_flag_set(lr->i, magic,
2305 branched, setters, setter_cnt);
2310 if (i > 0 && LAST_OP(i - 1)) {
2314 ret = scan_for_flag_set(lr->i, magic,
2315 branched, setters, setter_cnt);
2321 if (ops[i].flags & OPF_FLAGS) {
2322 setters[*setter_cnt] = i;
2327 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2334 // scan back for cdq, if anything modifies edx, fail
2335 static int scan_for_cdq_edx(int i)
2338 if (g_labels[i][0] != 0) {
2339 if (g_label_refs[i].next != NULL)
2341 if (i > 0 && LAST_OP(i - 1)) {
2342 i = g_label_refs[i].i;
2349 if (ops[i].op == OP_CDQ)
2352 if (ops[i].regmask_dst & (1 << xDX))
2359 static int scan_for_reg_clear(int i, int reg)
2362 if (g_labels[i][0] != 0) {
2363 if (g_label_refs[i].next != NULL)
2365 if (i > 0 && LAST_OP(i - 1)) {
2366 i = g_label_refs[i].i;
2373 if (ops[i].op == OP_XOR
2374 && ops[i].operand[0].lmod == OPLM_DWORD
2375 && ops[i].operand[0].reg == ops[i].operand[1].reg
2376 && ops[i].operand[0].reg == reg)
2379 if (ops[i].regmask_dst & (1 << reg))
2386 // scan for positive, constant esp adjust
2387 static int scan_for_esp_adjust(int i, int opcnt, int *adj,
2390 struct parsed_op *po;
2393 *adj = *multipath = 0;
2395 for (; i < opcnt; i++) {
2398 if (g_labels[i][0] != 0)
2401 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2402 if (po->operand[1].type != OPT_CONST)
2403 ferr(&ops[i], "non-const esp adjust?\n");
2404 *adj += po->operand[1].val;
2406 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2409 else if (po->op == OP_PUSH && !(po->flags & OPF_RMD)) {
2410 //if (first_pop == -1)
2411 // first_pop = -2; // none
2412 *adj -= lmod_bytes(po, po->operand[0].lmod);
2414 else if (po->op == OP_POP && !(po->flags & OPF_RMD)) {
2415 // seems like msvc only uses 'pop ecx' for stack realignment..
2416 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2418 if (first_pop == -1 && *adj >= 0)
2420 *adj += lmod_bytes(po, po->operand[0].lmod);
2422 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2423 if (po->op == OP_JMP && po->btj == NULL) {
2427 if (po->op != OP_CALL)
2429 if (po->operand[0].type != OPT_LABEL)
2431 if (po->pp != NULL && po->pp->is_stdcall)
2436 if (first_pop >= 0) {
2437 // probably 'pop ecx' was used..
2444 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2446 struct parsed_op *po;
2450 ferr(ops, "%s: followed bad branch?\n", __func__);
2452 for (; i < opcnt; i++) {
2454 if (po->cc_scratch == magic)
2456 po->cc_scratch = magic;
2459 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2460 if (po->btj != NULL) {
2462 for (j = 0; j < po->btj->count; j++)
2463 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2467 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2468 if (!(po->flags & OPF_CJMP))
2471 if (po->flags & OPF_TAIL)
2476 static const struct parsed_proto *try_recover_pp(
2477 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2479 const struct parsed_proto *pp = NULL;
2483 // maybe an arg of g_func?
2484 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2486 char ofs_reg[16] = { 0, };
2487 int arg, arg_s, arg_i;
2491 parse_stack_access(po, opr->name, ofs_reg,
2492 &offset, &stack_ra, NULL, 0);
2493 if (ofs_reg[0] != 0)
2494 ferr(po, "offset reg on arg access?\n");
2495 if (offset <= stack_ra) {
2496 // search who set the stack var instead
2497 if (search_instead != NULL)
2498 *search_instead = 1;
2502 arg_i = (offset - stack_ra - 4) / 4;
2503 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2504 if (g_func_pp->arg[arg].reg != NULL)
2510 if (arg == g_func_pp->argc)
2511 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2513 pp = g_func_pp->arg[arg].fptr;
2515 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2516 check_func_pp(po, pp, "icall arg");
2518 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2520 p = strchr(opr->name + 1, '[');
2521 memcpy(buf, opr->name, p - opr->name);
2522 buf[p - opr->name] = 0;
2523 pp = proto_parse(g_fhdr, buf, 0);
2525 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2526 pp = proto_parse(g_fhdr, opr->name, 0);
2528 ferr(po, "proto_parse failed for icall from '%s'\n", opr->name);
2529 check_func_pp(po, pp, "reg-fptr ref");
2535 static void scan_for_call_type(int i, const struct parsed_opr *opr,
2536 int magic, const struct parsed_proto **pp_found, int *multi)
2538 const struct parsed_proto *pp = NULL;
2539 struct parsed_op *po;
2540 struct label_ref *lr;
2542 ops[i].cc_scratch = magic;
2545 if (g_labels[i][0] != 0) {
2546 lr = &g_label_refs[i];
2547 for (; lr != NULL; lr = lr->next)
2548 scan_for_call_type(lr->i, opr, magic, pp_found, multi);
2549 if (i > 0 && LAST_OP(i - 1))
2557 if (ops[i].cc_scratch == magic)
2559 ops[i].cc_scratch = magic;
2561 if (!(ops[i].flags & OPF_DATA))
2563 if (!is_opr_modified(opr, &ops[i]))
2565 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2566 // most probably trashed by some processing
2571 opr = &ops[i].operand[1];
2572 if (opr->type != OPT_REG)
2576 po = (i >= 0) ? &ops[i] : ops;
2579 // reached the top - can only be an arg-reg
2580 if (opr->type != OPT_REG)
2583 for (i = 0; i < g_func_pp->argc; i++) {
2584 if (g_func_pp->arg[i].reg == NULL)
2586 if (IS(opr->name, g_func_pp->arg[i].reg))
2589 if (i == g_func_pp->argc)
2591 pp = g_func_pp->arg[i].fptr;
2593 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2594 i + 1, g_func_pp->arg[i].reg);
2595 check_func_pp(po, pp, "icall reg-arg");
2598 pp = try_recover_pp(po, opr, NULL);
2600 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2601 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2602 || (*pp_found)->is_stdcall != pp->is_stdcall
2603 || (*pp_found)->is_fptr != pp->is_fptr
2604 || (*pp_found)->argc != pp->argc
2605 || (*pp_found)->argc_reg != pp->argc_reg
2606 || (*pp_found)->argc_stack != pp->argc_stack)
2608 ferr(po, "icall: parsed_proto mismatch\n");
2616 static const struct parsed_proto *resolve_icall(int i, int opcnt,
2619 const struct parsed_proto *pp = NULL;
2620 int search_advice = 0;
2624 switch (ops[i].operand[0].type) {
2628 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
2633 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
2641 // find an instruction that changed opr before i op
2642 // *op_i must be set to -1
2643 static int resolve_origin(int i, const struct parsed_opr *opr,
2644 int magic, int *op_i)
2646 struct label_ref *lr;
2649 ops[i].cc_scratch = magic;
2652 if (g_labels[i][0] != 0) {
2653 lr = &g_label_refs[i];
2654 for (; lr != NULL; lr = lr->next)
2655 ret |= resolve_origin(lr->i, opr, magic, op_i);
2656 if (i > 0 && LAST_OP(i - 1))
2664 if (ops[i].cc_scratch == magic)
2666 ops[i].cc_scratch = magic;
2668 if (!(ops[i].flags & OPF_DATA))
2670 if (!is_opr_modified(opr, &ops[i]))
2676 // XXX: could check if the other op does the same
2685 static int try_resolve_const(int i, const struct parsed_opr *opr,
2686 int magic, unsigned int *val)
2691 ret = resolve_origin(i, opr, magic, &s_i);
2694 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
2697 *val = ops[i].operand[1].val;
2704 static int collect_call_args_r(struct parsed_op *po, int i,
2705 struct parsed_proto *pp, int *regmask, int *save_arg_vars, int arg,
2706 int magic, int need_op_saving, int may_reuse)
2708 struct parsed_proto *pp_tmp;
2709 struct label_ref *lr;
2710 int need_to_save_current;
2718 ferr(po, "dead label encountered\n");
2722 for (; arg < pp->argc; arg++)
2723 if (pp->arg[arg].reg == NULL)
2725 magic = (magic & 0xffffff) | (arg << 24);
2727 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
2729 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
2730 if (ops[j].cc_scratch != magic) {
2731 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
2735 // ok: have already been here
2738 ops[j].cc_scratch = magic;
2740 if (g_labels[j][0] != 0 && g_label_refs[j].i != -1) {
2741 lr = &g_label_refs[j];
2742 if (lr->next != NULL)
2744 for (; lr->next; lr = lr->next) {
2745 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2747 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2748 arg, magic, need_op_saving, may_reuse);
2753 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2755 if (j > 0 && LAST_OP(j - 1)) {
2756 // follow last branch in reverse
2761 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2762 arg, magic, need_op_saving, may_reuse);
2768 if (ops[j].op == OP_CALL)
2770 if (pp->is_unresolved)
2775 ferr(po, "arg collect hit unparsed call '%s'\n",
2776 ops[j].operand[0].name);
2777 if (may_reuse && pp_tmp->argc_stack > 0)
2778 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2779 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2781 // esp adjust of 0 means we collected it before
2782 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
2783 && (ops[j].operand[1].type != OPT_CONST
2784 || ops[j].operand[1].val != 0))
2786 if (pp->is_unresolved)
2789 ferr(po, "arg collect %d/%d hit esp adjust of %d\n",
2790 arg, pp->argc, ops[j].operand[1].val);
2792 else if (ops[j].op == OP_POP) {
2793 if (pp->is_unresolved)
2796 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2798 else if (ops[j].flags & OPF_CJMP)
2800 if (pp->is_unresolved)
2805 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2807 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
2810 pp->arg[arg].datap = &ops[j];
2811 need_to_save_current = 0;
2814 if (ops[j].operand[0].type == OPT_REG)
2815 reg = ops[j].operand[0].reg;
2817 if (!need_op_saving) {
2818 ret = scan_for_mod(&ops[j], j + 1, i, 1);
2819 need_to_save_current = (ret >= 0);
2821 if (need_op_saving || need_to_save_current) {
2822 // mark this push as one that needs operand saving
2823 ops[j].flags &= ~OPF_RMD;
2824 if (ops[j].p_argnum == 0) {
2825 ops[j].p_argnum = arg + 1;
2826 save_args |= 1 << arg;
2828 else if (ops[j].p_argnum < arg + 1) {
2829 // XXX: might kill valid var..
2830 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
2831 ops[j].p_argnum = arg + 1;
2832 save_args |= 1 << arg;
2835 else if (ops[j].p_argnum == 0)
2836 ops[j].flags |= OPF_RMD;
2838 // some PUSHes are reused by different calls on other branches,
2839 // but that can't happen if we didn't branch, so they
2840 // can be removed from future searches (handles nested calls)
2842 ops[j].flags |= OPF_FARG;
2844 ops[j].flags &= ~OPF_RSAVE;
2846 // check for __VALIST
2847 if (!pp->is_unresolved && pp->arg[arg].type.is_va_list) {
2849 ret = resolve_origin(j, &ops[j].operand[0], magic + 1, &k);
2850 if (ret == 1 && k >= 0)
2852 if (ops[k].op == OP_LEA) {
2853 snprintf(buf, sizeof(buf), "arg_%X",
2854 g_func_pp->argc_stack * 4);
2855 if (!g_func_pp->is_vararg
2856 || strstr(ops[k].operand[1].name, buf))
2858 ops[k].flags |= OPF_RMD;
2859 ops[j].flags |= OPF_RMD | OPF_VAPUSH;
2860 save_args &= ~(1 << arg);
2864 ferr(&ops[j], "lea va_list used, but no vararg?\n");
2866 // check for va_list from g_func_pp arg too
2867 else if (ops[k].op == OP_MOV
2868 && is_stack_access(&ops[k], &ops[k].operand[1]))
2870 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
2871 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
2873 ops[k].flags |= OPF_RMD;
2874 ops[j].flags |= OPF_RMD;
2875 ops[j].p_argpass = ret + 1;
2876 save_args &= ~(1 << arg);
2883 *save_arg_vars |= save_args;
2885 // tracking reg usage
2887 *regmask |= 1 << reg;
2890 if (!pp->is_unresolved) {
2892 for (; arg < pp->argc; arg++)
2893 if (pp->arg[arg].reg == NULL)
2896 magic = (magic & 0xffffff) | (arg << 24);
2900 if (arg < pp->argc) {
2901 ferr(po, "arg collect failed for '%s': %d/%d\n",
2902 pp->name, arg, pp->argc);
2909 static int collect_call_args(struct parsed_op *po, int i,
2910 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
2916 ret = collect_call_args_r(po, i, pp, regmask, save_arg_vars,
2921 if (pp->is_unresolved) {
2923 pp->argc_stack += ret;
2924 for (a = 0; a < pp->argc; a++)
2925 if (pp->arg[a].type.name == NULL)
2926 pp->arg[a].type.name = strdup("int");
2932 // early check for tail call or branch back
2933 static int is_like_tailjmp(int j)
2935 if (!(ops[j].flags & OPF_JMP))
2938 if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds)
2939 // probably local branch back..
2941 if (ops[j].op == OP_CALL)
2942 // probably noreturn call..
2948 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
2952 for (i = 0; i < pp->argc; i++)
2953 if (pp->arg[i].reg == NULL)
2957 memmove(&pp->arg[i + 1], &pp->arg[i],
2958 sizeof(pp->arg[0]) * pp->argc_stack);
2959 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
2960 pp->arg[i].reg = strdup(reg);
2961 pp->arg[i].type.name = strdup("int");
2966 static void add_label_ref(struct label_ref *lr, int op_i)
2968 struct label_ref *lr_new;
2975 lr_new = calloc(1, sizeof(*lr_new));
2977 lr_new->next = lr->next;
2981 static void output_std_flags(FILE *fout, struct parsed_op *po,
2982 int *pfomask, const char *dst_opr_text)
2984 if (*pfomask & (1 << PFO_Z)) {
2985 fprintf(fout, "\n cond_z = (%s%s == 0);",
2986 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
2987 *pfomask &= ~(1 << PFO_Z);
2989 if (*pfomask & (1 << PFO_S)) {
2990 fprintf(fout, "\n cond_s = (%s%s < 0);",
2991 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
2992 *pfomask &= ~(1 << PFO_S);
2996 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
2999 if (pp->is_fastcall)
3000 fprintf(fout, "__fastcall ");
3001 else if (pp->is_stdcall && pp->argc_reg == 0)
3002 fprintf(fout, "__stdcall ");
3003 if (pp->is_noreturn || is_noreturn)
3004 fprintf(fout, "noreturn ");
3007 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
3009 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
3010 struct parsed_opr *last_arith_dst = NULL;
3011 char buf1[256], buf2[256], buf3[256], cast[64];
3012 const struct parsed_proto *pp_c;
3013 struct parsed_proto *pp, *pp_tmp;
3014 struct parsed_data *pd;
3015 const char *tmpname;
3017 int save_arg_vars = 0;
3019 int need_tmp_var = 0;
3022 int label_pending = 0;
3023 int regmask_save = 0;
3024 int regmask_arg = 0;
3025 int regmask_now = 0;
3026 int regmask_init = 0;
3037 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
3038 g_stack_frame_used = 0;
3040 g_func_pp = proto_parse(fhdr, funcn, 0);
3041 if (g_func_pp == NULL)
3042 ferr(ops, "proto_parse failed for '%s'\n", funcn);
3044 for (i = 0; i < g_func_pp->argc; i++) {
3045 if (g_func_pp->arg[i].reg != NULL) {
3046 reg = char_array_i(regs_r32,
3047 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
3049 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
3050 regmask_arg |= 1 << reg;
3055 // - handle ebp/esp frame, remove ops related to it
3056 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3057 && ops[1].op == OP_MOV
3058 && IS(opr_name(&ops[1], 0), "ebp")
3059 && IS(opr_name(&ops[1], 1), "esp"))
3064 ops[0].flags |= OPF_RMD;
3065 ops[1].flags |= OPF_RMD;
3068 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
3069 g_stack_fsz = opr_const(&ops[2], 1);
3070 ops[2].flags |= OPF_RMD;
3074 // another way msvc builds stack frame..
3076 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3078 ops[i].flags |= OPF_RMD;
3082 // and another way..
3083 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3084 && ops[i].operand[1].type == OPT_CONST
3085 && ops[i + 1].op == OP_CALL
3086 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3088 g_stack_fsz += ops[i].operand[1].val;
3089 ops[i].flags |= OPF_RMD;
3091 ops[i].flags |= OPF_RMD;
3098 for (; i < opcnt; i++)
3099 if (ops[i].op == OP_RET)
3102 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3103 if (found && is_like_tailjmp(j))
3108 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3109 || ops[j].op == OP_LEAVE)
3111 ops[j].flags |= OPF_RMD;
3113 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3114 ferr(&ops[j], "'pop ebp' expected\n");
3116 if (g_stack_fsz != 0) {
3117 if (ops[j - 1].op == OP_MOV
3118 && IS(opr_name(&ops[j - 1], 0), "esp")
3119 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3121 ops[j - 1].flags |= OPF_RMD;
3123 else if (ops[j].op != OP_LEAVE
3124 && !(g_ida_func_attr & IDAFA_NORETURN))
3126 ferr(&ops[j - 1], "esp restore expected\n");
3129 if (ecx_push && ops[j - 2].op == OP_POP
3130 && IS(opr_name(&ops[j - 2], 0), "ecx"))
3132 ferr(&ops[j - 2], "unexpected ecx pop\n");
3138 } while (i < opcnt);
3141 int ecx_push = 0, esp_sub = 0;
3144 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3145 ops[i].flags |= OPF_RMD;
3151 for (; i < opcnt; i++) {
3152 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3154 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3155 && ops[i].operand[1].type == OPT_CONST)
3157 g_stack_fsz = ops[i].operand[1].val;
3158 ops[i].flags |= OPF_RMD;
3165 if (ecx_push || esp_sub)
3171 for (; i < opcnt; i++)
3172 if (ops[i].op == OP_RET)
3175 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3176 if (found && is_like_tailjmp(j))
3182 for (l = 0; l < ecx_push; l++) {
3183 if (ops[j].op != OP_POP
3184 || !IS(opr_name(&ops[j], 0), "ecx"))
3186 ferr(&ops[j], "'pop ecx' expected\n");
3188 ops[j].flags |= OPF_RMD;
3196 if (ops[j].op != OP_ADD
3197 || !IS(opr_name(&ops[j], 0), "esp")
3198 || ops[j].operand[1].type != OPT_CONST
3199 || ops[j].operand[1].val != g_stack_fsz)
3200 ferr(&ops[j], "'add esp' expected\n");
3201 ops[j].flags |= OPF_RMD;
3207 } while (i < opcnt);
3212 // - parse calls with labels
3213 // - resolve all branches
3214 for (i = 0; i < opcnt; i++)
3220 if (po->flags & OPF_RMD)
3223 if (po->op == OP_CALL) {
3226 if (po->operand[0].type == OPT_LABEL) {
3227 tmpname = opr_name(po, 0);
3228 if (IS_START(tmpname, "loc_"))
3229 ferr(po, "call to loc_*\n");
3230 pp_c = proto_parse(fhdr, tmpname, 0);
3232 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3234 pp = proto_clone(pp_c);
3235 my_assert_not(pp, NULL);
3237 else if (po->datap != NULL) {
3238 pp = calloc(1, sizeof(*pp));
3239 my_assert_not(pp, NULL);
3241 ret = parse_protostr(po->datap, pp);
3243 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3250 check_func_pp(po, pp, "fptr var call");
3251 if (pp->is_noreturn)
3252 po->flags |= OPF_TAIL;
3258 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3261 if (po->operand[0].type == OPT_REGMEM) {
3262 char *p = strchr(po->operand[0].name, '[');
3265 ret = p - po->operand[0].name;
3266 strncpy(buf1, po->operand[0].name, ret);
3269 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3270 if (IS(g_func_pd[j].label, buf1)) {
3276 //ferr(po, "label '%s' not parsed?\n", buf1);
3278 if (pd->type != OPT_OFFSET)
3279 ferr(po, "label '%s' with non-offset data?\n", buf1);
3281 // find all labels, link
3282 for (j = 0; j < pd->count; j++) {
3283 for (l = 0; l < opcnt; l++) {
3284 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
3285 add_label_ref(&g_label_refs[l], i);
3296 for (l = 0; l < opcnt; l++) {
3297 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
3298 if (l == i + 1 && po->op == OP_JMP) {
3299 // yet another alignment type..
3300 po->flags |= OPF_RMD;
3303 add_label_ref(&g_label_refs[l], i);
3309 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3312 if (po->operand[0].type == OPT_LABEL)
3316 ferr(po, "unhandled branch\n");
3320 po->flags |= OPF_TAIL;
3321 if (i > 0 && ops[i - 1].op == OP_POP)
3322 po->flags |= OPF_ATAIL;
3327 // - remove dead labels
3329 for (i = 0; i < opcnt; i++)
3331 if (g_labels[i][0] != 0 && g_label_refs[i].i == -1)
3335 if (po->flags & OPF_RMD)
3338 if (po->op == OP_CALL)
3340 tmpname = opr_name(po, 0);
3345 pp_c = resolve_icall(i, opcnt, &l);
3347 if (!pp_c->is_func && !pp_c->is_fptr)
3348 ferr(po, "call to non-func: %s\n", pp_c->name);
3349 pp = proto_clone(pp_c);
3350 my_assert_not(pp, NULL);
3352 // not resolved just to single func
3355 switch (po->operand[0].type) {
3357 // we resolved this call and no longer need the register
3358 po->regmask_src &= ~(1 << po->operand[0].reg);
3368 pp = calloc(1, sizeof(*pp));
3369 my_assert_not(pp, NULL);
3371 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3373 if (!g_allow_regfunc)
3374 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3375 pp->is_unresolved = 1;
3379 if (j > ARRAY_SIZE(pp->arg))
3380 ferr(po, "esp adjust too large: %d\n", j);
3381 pp->ret_type.name = strdup("int");
3382 pp->argc = pp->argc_stack = j;
3383 for (arg = 0; arg < pp->argc; arg++)
3384 pp->arg[arg].type.name = strdup("int");
3389 // look for and make use of esp adjust
3391 if (!pp->is_stdcall && pp->argc_stack > 0)
3392 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3394 if (pp->is_vararg) {
3395 if (j / 4 < pp->argc_stack)
3396 ferr(po, "esp adjust is too small: %x < %x\n",
3397 j, pp->argc_stack * 4);
3398 // modify pp to make it have varargs as normal args
3400 pp->argc += j / 4 - pp->argc_stack;
3401 for (; arg < pp->argc; arg++) {
3402 pp->arg[arg].type.name = strdup("int");
3405 if (pp->argc > ARRAY_SIZE(pp->arg))
3406 ferr(po, "too many args for '%s'\n", tmpname);
3408 if (pp->argc_stack != j / 4)
3409 ferr(po, "stack tracking failed for '%s': %x %x\n",
3410 tmpname, pp->argc_stack * 4, j);
3412 ops[ret].flags |= OPF_RMD;
3413 if (ops[ret].op == OP_POP && j > 4) {
3414 // deal with multi-pop stack adjust
3416 while (ops[ret].op == OP_POP && j > 0 && ret < opcnt) {
3417 ops[ret].flags |= OPF_RMD;
3423 // a bit of a hack, but deals with use of
3424 // single adj for multiple calls
3425 ops[ret].operand[1].val -= j;
3428 else if (pp->is_vararg)
3429 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3432 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
3433 // since we know the args, collect them
3434 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3438 if (strstr(pp->ret_type.name, "int64"))
3444 // - find POPs for PUSHes, rm both
3445 // - scan for STD/CLD, propagate DF
3446 // - scan for all used registers
3447 // - find flag set ops for their users
3448 // - do unreselved calls
3449 // - declare indirect functions
3450 for (i = 0; i < opcnt; i++) {
3452 if (po->flags & OPF_RMD)
3455 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
3456 reg = po->operand[0].reg;
3457 if (!(regmask & (1 << reg)))
3458 // not a reg save after all, rerun scan_for_pop
3459 po->flags &= ~OPF_RSAVE;
3461 regmask_save |= 1 << reg;
3464 if (po->op == OP_PUSH && po->p_argnum == 0
3465 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
3467 if (po->operand[0].type == OPT_REG)
3469 reg = po->operand[0].reg;
3471 ferr(po, "reg not set for push?\n");
3474 ret = scan_for_pop(i + 1, opcnt,
3475 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
3478 ferr(po, "too much depth: %d\n", depth);
3480 po->flags |= OPF_RMD;
3481 scan_for_pop(i + 1, opcnt, po->operand[0].name,
3482 i + opcnt * 4, 0, &depth, 1);
3485 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
3488 if (regmask & (1 << reg)) {
3489 if (regmask_save & (1 << reg))
3490 ferr(po, "%s already saved?\n", po->operand[0].name);
3494 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
3498 else if (po->operand[0].type == OPT_CONST) {
3499 for (j = i + 1; j < opcnt; j++) {
3500 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
3501 || ops[j].op == OP_PUSH || g_labels[i][0] != 0)
3506 if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP)
3508 po->flags |= OPF_RMD;
3516 if (po->op == OP_STD) {
3517 po->flags |= OPF_DF | OPF_RMD;
3518 scan_propagate_df(i + 1, opcnt);
3521 regmask_now = po->regmask_src | po->regmask_dst;
3522 if (regmask_now & (1 << xBP)) {
3523 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
3524 if (po->regmask_dst & (1 << xBP))
3525 // compiler decided to drop bp frame and use ebp as scratch
3526 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
3528 regmask_now &= ~(1 << xBP);
3532 regmask |= regmask_now;
3534 if (po->flags & OPF_CC)
3536 int setters[16], cnt = 0, branched = 0;
3538 ret = scan_for_flag_set(i, i + opcnt * 6,
3539 &branched, setters, &cnt);
3540 if (ret < 0 || cnt <= 0)
3541 ferr(po, "unable to trace flag setter(s)\n");
3542 if (cnt > ARRAY_SIZE(setters))
3543 ferr(po, "too many flag setters\n");
3545 for (j = 0; j < cnt; j++)
3547 tmp_op = &ops[setters[j]]; // flag setter
3550 // to get nicer code, we try to delay test and cmp;
3551 // if we can't because of operand modification, or if we
3552 // have arith op, or branch, make it calculate flags explicitly
3553 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
3555 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
3556 pfomask = 1 << po->pfo;
3558 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
3559 pfomask = 1 << po->pfo;
3562 // see if we'll be able to handle based on op result
3563 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
3564 && po->pfo != PFO_Z && po->pfo != PFO_S
3565 && po->pfo != PFO_P)
3567 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
3569 pfomask = 1 << po->pfo;
3572 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
3573 propagate_lmod(tmp_op, &tmp_op->operand[0],
3574 &tmp_op->operand[1]);
3575 if (tmp_op->operand[0].lmod == OPLM_DWORD)
3580 tmp_op->pfomask |= pfomask;
3581 cond_vars |= pfomask;
3583 // note: may overwrite, currently not a problem
3587 if (po->op == OP_RCL || po->op == OP_RCR
3588 || po->op == OP_ADC || po->op == OP_SBB)
3589 cond_vars |= 1 << PFO_C;
3592 if (po->op == OP_CMPS || po->op == OP_SCAS) {
3593 cond_vars |= 1 << PFO_Z;
3595 else if (po->op == OP_MUL
3596 || (po->op == OP_IMUL && po->operand_cnt == 1))
3598 if (po->operand[0].lmod == OPLM_DWORD)
3601 else if (po->op == OP_CALL) {
3604 ferr(po, "NULL pp\n");
3606 if (pp->is_unresolved) {
3607 int regmask_stack = 0;
3608 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3611 // this is pretty rough guess:
3612 // see ecx and edx were pushed (and not their saved versions)
3613 for (arg = 0; arg < pp->argc; arg++) {
3614 if (pp->arg[arg].reg != NULL)
3617 tmp_op = pp->arg[arg].datap;
3619 ferr(po, "parsed_op missing for arg%d\n", arg);
3620 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
3621 regmask_stack |= 1 << tmp_op->operand[0].reg;
3624 if (!((regmask_stack & (1 << xCX))
3625 && (regmask_stack & (1 << xDX))))
3627 if (pp->argc_stack != 0
3628 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
3630 pp_insert_reg_arg(pp, "ecx");
3631 pp->is_fastcall = 1;
3632 regmask_init |= 1 << xCX;
3633 regmask |= 1 << xCX;
3635 if (pp->argc_stack != 0
3636 || ((regmask | regmask_arg) & (1 << xDX)))
3638 pp_insert_reg_arg(pp, "edx");
3639 regmask_init |= 1 << xDX;
3640 regmask |= 1 << xDX;
3644 // note: __cdecl doesn't fall into is_unresolved category
3645 if (pp->argc_stack > 0)
3649 for (arg = 0; arg < pp->argc; arg++) {
3650 if (pp->arg[arg].reg != NULL) {
3651 reg = char_array_i(regs_r32,
3652 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
3654 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
3655 if (!(regmask & (1 << reg))) {
3656 regmask_init |= 1 << reg;
3657 regmask |= 1 << reg;
3662 else if (po->op == OP_MOV && po->operand[0].pp != NULL
3663 && po->operand[1].pp != NULL)
3665 // <var> = offset <something>
3666 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
3667 && !IS_START(po->operand[1].name, "off_"))
3669 if (!po->operand[0].pp->is_fptr)
3670 ferr(po, "%s not declared as fptr when it should be\n",
3671 po->operand[0].name);
3672 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
3673 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
3674 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
3675 fnote(po, "var: %s\n", buf1);
3676 fnote(po, "func: %s\n", buf2);
3677 ferr(po, "^ mismatch\n");
3681 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
3682 regmask |= 1 << xAX;
3683 else if (po->op == OP_DIV || po->op == OP_IDIV) {
3684 // 32bit division is common, look for it
3685 if (po->op == OP_DIV)
3686 ret = scan_for_reg_clear(i, xDX);
3688 ret = scan_for_cdq_edx(i);
3690 po->flags |= OPF_32BIT;
3694 else if (po->op == OP_CLD)
3695 po->flags |= OPF_RMD;
3697 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
3703 // - confirm regmask_save, it might have been reduced
3704 if (regmask_save != 0)
3707 for (i = 0; i < opcnt; i++) {
3709 if (po->flags & OPF_RMD)
3712 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
3713 regmask_save |= 1 << po->operand[0].reg;
3717 // output starts here
3719 // define userstack size
3720 if (g_func_pp->is_userstack) {
3721 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
3722 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
3723 fprintf(fout, "#endif\n");
3726 // the function itself
3727 fprintf(fout, "%s ", g_func_pp->ret_type.name);
3728 output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN);
3729 fprintf(fout, "%s(", g_func_pp->name);
3731 for (i = 0; i < g_func_pp->argc; i++) {
3733 fprintf(fout, ", ");
3734 if (g_func_pp->arg[i].fptr != NULL) {
3736 pp = g_func_pp->arg[i].fptr;
3737 fprintf(fout, "%s (", pp->ret_type.name);
3738 output_pp_attrs(fout, pp, 0);
3739 fprintf(fout, "*a%d)(", i + 1);
3740 for (j = 0; j < pp->argc; j++) {
3742 fprintf(fout, ", ");
3743 if (pp->arg[j].fptr)
3744 ferr(ops, "nested fptr\n");
3745 fprintf(fout, "%s", pp->arg[j].type.name);
3747 if (pp->is_vararg) {
3749 fprintf(fout, ", ");
3750 fprintf(fout, "...");
3754 else if (g_func_pp->arg[i].type.is_retreg) {
3755 fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg);
3758 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
3761 if (g_func_pp->is_vararg) {
3763 fprintf(fout, ", ");
3764 fprintf(fout, "...");
3767 fprintf(fout, ")\n{\n");
3769 // declare indirect functions
3770 for (i = 0; i < opcnt; i++) {
3772 if (po->flags & OPF_RMD)
3775 if (po->op == OP_CALL) {
3778 ferr(po, "NULL pp\n");
3780 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
3781 if (pp->name[0] != 0) {
3782 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
3783 memcpy(pp->name, "i_", 2);
3785 // might be declared already
3787 for (j = 0; j < i; j++) {
3788 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
3789 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
3799 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
3801 fprintf(fout, " %s (", pp->ret_type.name);
3802 output_pp_attrs(fout, pp, 0);
3803 fprintf(fout, "*%s)(", pp->name);
3804 for (j = 0; j < pp->argc; j++) {
3806 fprintf(fout, ", ");
3807 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
3809 fprintf(fout, ");\n");
3814 // output LUTs/jumptables
3815 for (i = 0; i < g_func_pd_cnt; i++) {
3817 fprintf(fout, " static const ");
3818 if (pd->type == OPT_OFFSET) {
3819 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
3821 for (j = 0; j < pd->count; j++) {
3823 fprintf(fout, ", ");
3824 fprintf(fout, "&&%s", pd->d[j].u.label);
3828 fprintf(fout, "%s %s[] =\n { ",
3829 lmod_type_u(ops, pd->lmod), pd->label);
3831 for (j = 0; j < pd->count; j++) {
3833 fprintf(fout, ", ");
3834 fprintf(fout, "%u", pd->d[j].u.val);
3837 fprintf(fout, " };\n");
3841 // declare stack frame, va_arg
3843 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
3844 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
3848 if (g_func_pp->is_userstack) {
3849 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
3850 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
3854 if (g_func_pp->is_vararg) {
3855 fprintf(fout, " va_list ap;\n");
3859 // declare arg-registers
3860 for (i = 0; i < g_func_pp->argc; i++) {
3861 if (g_func_pp->arg[i].reg != NULL) {
3862 reg = char_array_i(regs_r32,
3863 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
3864 if (regmask & (1 << reg)) {
3865 if (g_func_pp->arg[i].type.is_retreg)
3866 fprintf(fout, " u32 %s = *r_%s;\n",
3867 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
3869 fprintf(fout, " u32 %s = (u32)a%d;\n",
3870 g_func_pp->arg[i].reg, i + 1);
3873 if (g_func_pp->arg[i].type.is_retreg)
3874 ferr(ops, "retreg '%s' is unused?\n",
3875 g_func_pp->arg[i].reg);
3876 fprintf(fout, " // %s = a%d; // unused\n",
3877 g_func_pp->arg[i].reg, i + 1);
3883 regmask_now = regmask & ~regmask_arg;
3884 regmask_now &= ~(1 << xSP);
3886 for (reg = 0; reg < 8; reg++) {
3887 if (regmask_now & (1 << reg)) {
3888 fprintf(fout, " u32 %s", regs_r32[reg]);
3889 if (regmask_init & (1 << reg))
3890 fprintf(fout, " = 0");
3891 fprintf(fout, ";\n");
3898 for (reg = 0; reg < 8; reg++) {
3899 if (regmask_save & (1 << reg)) {
3900 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
3906 if (save_arg_vars) {
3907 for (reg = 0; reg < 32; reg++) {
3908 if (save_arg_vars & (1 << reg)) {
3909 fprintf(fout, " u32 s_a%d;\n", reg + 1);
3916 for (i = 0; i < 8; i++) {
3917 if (cond_vars & (1 << i)) {
3918 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
3925 fprintf(fout, " u32 tmp;\n");
3930 fprintf(fout, " u64 tmp64;\n");
3935 fprintf(fout, "\n");
3937 if (g_func_pp->is_vararg) {
3938 if (g_func_pp->argc_stack == 0)
3939 ferr(ops, "vararg func without stack args?\n");
3940 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
3944 for (i = 0; i < opcnt; i++)
3946 if (g_labels[i][0] != 0) {
3947 fprintf(fout, "\n%s:\n", g_labels[i]);
3950 delayed_flag_op = NULL;
3951 last_arith_dst = NULL;
3955 if (po->flags & OPF_RMD)
3960 #define assert_operand_cnt(n_) \
3961 if (po->operand_cnt != n_) \
3962 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
3964 // conditional/flag using op?
3965 if (po->flags & OPF_CC)
3971 // we go through all this trouble to avoid using parsed_flag_op,
3972 // which makes generated code much nicer
3973 if (delayed_flag_op != NULL)
3975 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
3976 po->pfo, po->pfo_inv);
3979 else if (last_arith_dst != NULL
3980 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
3981 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
3984 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
3985 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
3986 last_arith_dst->lmod, buf3);
3989 else if (tmp_op != NULL) {
3990 // use preprocessed flag calc results
3991 if (!(tmp_op->pfomask & (1 << po->pfo)))
3992 ferr(po, "not prepared for pfo %d\n", po->pfo);
3994 // note: pfo_inv was not yet applied
3995 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
3996 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
3999 ferr(po, "all methods of finding comparison failed\n");
4002 if (po->flags & OPF_JMP) {
4003 fprintf(fout, " if %s", buf1);
4005 else if (po->op == OP_RCL || po->op == OP_RCR
4006 || po->op == OP_ADC || po->op == OP_SBB)
4009 fprintf(fout, " cond_%s = %s;\n",
4010 parsed_flag_op_names[po->pfo], buf1);
4012 else if (po->flags & OPF_DATA) { // SETcc
4013 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
4014 fprintf(fout, " %s = %s;", buf2, buf1);
4017 ferr(po, "unhandled conditional op\n");
4021 pfomask = po->pfomask;
4023 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
4024 struct parsed_opr opr = {0,};
4027 opr.lmod = OPLM_DWORD;
4028 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
4030 if (ret != 1 || uval == 0) {
4031 // we need initial flags for ecx=0 case..
4032 if (i > 0 && ops[i - 1].op == OP_XOR
4033 && IS(ops[i - 1].operand[0].name,
4034 ops[i - 1].operand[1].name))
4036 fprintf(fout, " cond_z = ");
4037 if (pfomask & (1 << PFO_C))
4038 fprintf(fout, "cond_c = ");
4039 fprintf(fout, "0;\n");
4041 else if (last_arith_dst != NULL) {
4042 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4043 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
4044 last_arith_dst->lmod, buf3);
4045 fprintf(fout, " cond_z = %s;\n", buf1);
4048 ferr(po, "missing initial ZF\n");
4055 assert_operand_cnt(2);
4056 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4057 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4058 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
4059 fprintf(fout, " %s = %s;", buf1,
4060 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4065 assert_operand_cnt(2);
4066 po->operand[1].lmod = OPLM_DWORD; // always
4067 fprintf(fout, " %s = %s;",
4068 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4069 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4074 assert_operand_cnt(2);
4075 fprintf(fout, " %s = %s;",
4076 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4077 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4081 assert_operand_cnt(2);
4082 switch (po->operand[1].lmod) {
4084 strcpy(buf3, "(s8)");
4087 strcpy(buf3, "(s16)");
4090 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
4092 fprintf(fout, " %s = %s;",
4093 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4094 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4099 assert_operand_cnt(2);
4100 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4101 fprintf(fout, " tmp = %s;",
4102 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
4103 fprintf(fout, " %s = %s;",
4104 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4105 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4106 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4107 fprintf(fout, " %s = %stmp;",
4108 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
4109 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
4110 snprintf(g_comment, sizeof(g_comment), "xchg");
4114 assert_operand_cnt(1);
4115 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4116 fprintf(fout, " %s = ~%s;", buf1, buf1);
4120 assert_operand_cnt(2);
4121 fprintf(fout, " %s = (s32)%s >> 31;",
4122 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4123 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4124 strcpy(g_comment, "cdq");
4128 assert_operand_cnt(3);
4129 if (po->flags & OPF_REP) {
4134 fprintf(fout, " eax = %sesi; esi %c= %d;",
4135 lmod_cast_u_ptr(po, po->operand[0].lmod),
4136 (po->flags & OPF_DF) ? '-' : '+',
4137 lmod_bytes(po, po->operand[0].lmod));
4138 strcpy(g_comment, "lods");
4143 assert_operand_cnt(3);
4144 if (po->flags & OPF_REP) {
4145 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
4146 (po->flags & OPF_DF) ? '-' : '+',
4147 lmod_bytes(po, po->operand[0].lmod));
4148 fprintf(fout, " %sedi = eax;",
4149 lmod_cast_u_ptr(po, po->operand[0].lmod));
4150 strcpy(g_comment, "rep stos");
4153 fprintf(fout, " %sedi = eax; edi %c= %d;",
4154 lmod_cast_u_ptr(po, po->operand[0].lmod),
4155 (po->flags & OPF_DF) ? '-' : '+',
4156 lmod_bytes(po, po->operand[0].lmod));
4157 strcpy(g_comment, "stos");
4162 assert_operand_cnt(3);
4163 j = lmod_bytes(po, po->operand[0].lmod);
4164 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4165 l = (po->flags & OPF_DF) ? '-' : '+';
4166 if (po->flags & OPF_REP) {
4168 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
4171 " %sedi = %sesi;", buf1, buf1);
4172 strcpy(g_comment, "rep movs");
4175 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
4176 buf1, buf1, l, j, l, j);
4177 strcpy(g_comment, "movs");
4182 // repe ~ repeat while ZF=1
4183 assert_operand_cnt(3);
4184 j = lmod_bytes(po, po->operand[0].lmod);
4185 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4186 l = (po->flags & OPF_DF) ? '-' : '+';
4187 if (po->flags & OPF_REP) {
4189 " for (; ecx != 0; ecx--) {\n");
4190 if (pfomask & (1 << PFO_C)) {
4193 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4194 pfomask &= ~(1 << PFO_C);
4197 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4198 buf1, buf1, l, j, l, j);
4200 " if (cond_z %s 0) break;\n",
4201 (po->flags & OPF_REPZ) ? "==" : "!=");
4204 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4205 (po->flags & OPF_REPZ) ? "e" : "ne");
4209 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4210 buf1, buf1, l, j, l, j);
4211 strcpy(g_comment, "cmps");
4213 pfomask &= ~(1 << PFO_Z);
4214 last_arith_dst = NULL;
4215 delayed_flag_op = NULL;
4219 // only does ZF (for now)
4220 // repe ~ repeat while ZF=1
4221 assert_operand_cnt(3);
4222 j = lmod_bytes(po, po->operand[0].lmod);
4223 l = (po->flags & OPF_DF) ? '-' : '+';
4224 if (po->flags & OPF_REP) {
4226 " for (; ecx != 0; ecx--) {\n");
4228 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4229 lmod_cast_u(po, po->operand[0].lmod),
4230 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4232 " if (cond_z %s 0) break;\n",
4233 (po->flags & OPF_REPZ) ? "==" : "!=");
4236 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4237 (po->flags & OPF_REPZ) ? "e" : "ne");
4240 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4241 lmod_cast_u(po, po->operand[0].lmod),
4242 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4243 strcpy(g_comment, "scas");
4245 pfomask &= ~(1 << PFO_Z);
4246 last_arith_dst = NULL;
4247 delayed_flag_op = NULL;
4250 // arithmetic w/flags
4253 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4256 assert_operand_cnt(2);
4257 fprintf(fout, " %s %s= %s;",
4258 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4260 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4261 output_std_flags(fout, po, &pfomask, buf1);
4262 last_arith_dst = &po->operand[0];
4263 delayed_flag_op = NULL;
4268 assert_operand_cnt(2);
4269 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4270 if (pfomask & (1 << PFO_C)) {
4271 if (po->operand[1].type == OPT_CONST) {
4272 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4273 j = po->operand[1].val;
4276 if (po->op == OP_SHL)
4280 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
4284 ferr(po, "zero shift?\n");
4288 pfomask &= ~(1 << PFO_C);
4290 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
4291 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4292 output_std_flags(fout, po, &pfomask, buf1);
4293 last_arith_dst = &po->operand[0];
4294 delayed_flag_op = NULL;
4298 assert_operand_cnt(2);
4299 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4300 fprintf(fout, " %s = %s%s >> %s;", buf1,
4301 lmod_cast_s(po, po->operand[0].lmod), buf1,
4302 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4303 output_std_flags(fout, po, &pfomask, buf1);
4304 last_arith_dst = &po->operand[0];
4305 delayed_flag_op = NULL;
4309 assert_operand_cnt(3);
4310 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4311 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4312 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4313 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4314 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
4315 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
4316 buf1, buf3, buf1, buf2, l, buf3);
4317 strcpy(g_comment, "shrd");
4318 output_std_flags(fout, po, &pfomask, buf1);
4319 last_arith_dst = &po->operand[0];
4320 delayed_flag_op = NULL;
4325 assert_operand_cnt(2);
4326 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4327 if (po->operand[1].type == OPT_CONST) {
4328 j = po->operand[1].val;
4329 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
4330 fprintf(fout, po->op == OP_ROL ?
4331 " %s = (%s << %d) | (%s >> %d);" :
4332 " %s = (%s >> %d) | (%s << %d);",
4333 buf1, buf1, j, buf1,
4334 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
4338 output_std_flags(fout, po, &pfomask, buf1);
4339 last_arith_dst = &po->operand[0];
4340 delayed_flag_op = NULL;
4345 assert_operand_cnt(2);
4346 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4347 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4348 if (po->operand[1].type == OPT_CONST) {
4349 j = po->operand[1].val % l;
4351 ferr(po, "zero rotate\n");
4352 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
4353 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
4354 if (po->op == OP_RCL) {
4356 " %s = (%s << %d) | (cond_c << %d)",
4357 buf1, buf1, j, j - 1);
4359 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
4363 " %s = (%s >> %d) | (cond_c << %d)",
4364 buf1, buf1, j, l - j);
4366 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
4368 fprintf(fout, ";\n");
4369 fprintf(fout, " cond_c = tmp;");
4373 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
4374 output_std_flags(fout, po, &pfomask, buf1);
4375 last_arith_dst = &po->operand[0];
4376 delayed_flag_op = NULL;
4380 assert_operand_cnt(2);
4381 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4382 if (IS(opr_name(po, 0), opr_name(po, 1))) {
4383 // special case for XOR
4384 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
4385 fprintf(fout, " cond_be = 1;\n");
4386 pfomask &= ~(1 << PFO_BE);
4388 fprintf(fout, " %s = 0;",
4389 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4390 last_arith_dst = &po->operand[0];
4391 delayed_flag_op = NULL;
4397 assert_operand_cnt(2);
4398 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4399 if (pfomask & (1 << PFO_C)) {
4400 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4401 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4402 if (po->operand[0].lmod == OPLM_DWORD) {
4403 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
4404 fprintf(fout, " cond_c = tmp64 >> 32;\n");
4405 fprintf(fout, " %s = (u32)tmp64;",
4406 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4407 strcat(g_comment, "add64");
4410 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
4411 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
4412 fprintf(fout, " %s += %s;",
4413 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4416 pfomask &= ~(1 << PFO_C);
4417 output_std_flags(fout, po, &pfomask, buf1);
4418 last_arith_dst = &po->operand[0];
4419 delayed_flag_op = NULL;
4425 assert_operand_cnt(2);
4426 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4427 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
4428 for (j = 0; j <= PFO_LE; j++) {
4429 if (!(pfomask & (1 << j)))
4431 if (j == PFO_Z || j == PFO_S)
4434 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
4435 fprintf(fout, " cond_%s = %s;\n",
4436 parsed_flag_op_names[j], buf1);
4437 pfomask &= ~(1 << j);
4444 assert_operand_cnt(2);
4445 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4446 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4447 if (po->op == OP_SBB
4448 && IS(po->operand[0].name, po->operand[1].name))
4450 // avoid use of unitialized var
4451 fprintf(fout, " %s = -cond_c;", buf1);
4452 // carry remains what it was
4453 pfomask &= ~(1 << PFO_C);
4456 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
4457 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4459 output_std_flags(fout, po, &pfomask, buf1);
4460 last_arith_dst = &po->operand[0];
4461 delayed_flag_op = NULL;
4465 assert_operand_cnt(2);
4466 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4467 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
4468 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4470 output_std_flags(fout, po, &pfomask, buf1);
4471 last_arith_dst = &po->operand[0];
4472 delayed_flag_op = NULL;
4473 strcat(g_comment, "bsf");
4478 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4479 if (po->operand[0].type == OPT_REG) {
4480 strcpy(buf2, po->op == OP_INC ? "++" : "--");
4481 fprintf(fout, " %s%s;", buf1, buf2);
4484 strcpy(buf2, po->op == OP_INC ? "+" : "-");
4485 fprintf(fout, " %s %s= 1;", buf1, buf2);
4487 output_std_flags(fout, po, &pfomask, buf1);
4488 last_arith_dst = &po->operand[0];
4489 delayed_flag_op = NULL;
4493 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4494 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
4495 fprintf(fout, " %s = -%s%s;", buf1,
4496 lmod_cast_s(po, po->operand[0].lmod), buf2);
4497 last_arith_dst = &po->operand[0];
4498 delayed_flag_op = NULL;
4499 if (pfomask & (1 << PFO_C)) {
4500 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
4501 pfomask &= ~(1 << PFO_C);
4506 if (po->operand_cnt == 2) {
4507 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4510 if (po->operand_cnt == 3)
4511 ferr(po, "TODO imul3\n");
4514 assert_operand_cnt(1);
4515 switch (po->operand[0].lmod) {
4517 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
4518 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
4519 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
4520 fprintf(fout, " edx = tmp64 >> 32;\n");
4521 fprintf(fout, " eax = tmp64;");
4524 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
4525 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
4526 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
4530 ferr(po, "TODO: unhandled mul type\n");
4533 last_arith_dst = NULL;
4534 delayed_flag_op = NULL;
4539 assert_operand_cnt(1);
4540 if (po->operand[0].lmod != OPLM_DWORD)
4541 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
4543 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4544 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
4545 po->op == OP_IDIV));
4546 switch (po->operand[0].lmod) {
4548 if (po->flags & OPF_32BIT)
4549 snprintf(buf3, sizeof(buf3), "%seax", buf2);
4551 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
4552 snprintf(buf3, sizeof(buf3), "%stmp64",
4553 (po->op == OP_IDIV) ? "(s64)" : "");
4555 if (po->operand[0].type == OPT_REG
4556 && po->operand[0].reg == xDX)
4558 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4559 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4562 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4563 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4567 ferr(po, "unhandled division type\n");
4569 last_arith_dst = NULL;
4570 delayed_flag_op = NULL;
4575 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4577 for (j = 0; j < 8; j++) {
4578 if (pfomask & (1 << j)) {
4579 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
4580 fprintf(fout, " cond_%s = %s;",
4581 parsed_flag_op_names[j], buf1);
4588 last_arith_dst = NULL;
4589 delayed_flag_op = po;
4593 // SETcc - should already be handled
4596 // note: we reuse OP_Jcc for SETcc, only flags differ
4598 fprintf(fout, "\n goto %s;", po->operand[0].name);
4602 fprintf(fout, " if (ecx == 0)\n");
4603 fprintf(fout, " goto %s;", po->operand[0].name);
4604 strcat(g_comment, "jecxz");
4608 assert_operand_cnt(1);
4609 last_arith_dst = NULL;
4610 delayed_flag_op = NULL;
4612 if (po->operand[0].type == OPT_REGMEM) {
4613 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
4616 ferr(po, "parse failure for jmp '%s'\n",
4617 po->operand[0].name);
4618 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
4621 else if (po->operand[0].type != OPT_LABEL)
4622 ferr(po, "unhandled jmp type\n");
4624 fprintf(fout, " goto %s;", po->operand[0].name);
4628 assert_operand_cnt(1);
4630 my_assert_not(pp, NULL);
4633 if (po->flags & OPF_CC) {
4634 // we treat conditional branch to another func
4635 // (yes such code exists..) as conditional tailcall
4637 fprintf(fout, " {\n");
4640 if (pp->is_fptr && !pp->is_arg) {
4641 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
4642 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
4644 if (pp->is_unresolved)
4645 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
4646 buf3, asmfn, po->asmln, pp->name);
4649 fprintf(fout, "%s", buf3);
4650 if (strstr(pp->ret_type.name, "int64")) {
4651 if (po->flags & OPF_TAIL)
4652 ferr(po, "int64 and tail?\n");
4653 fprintf(fout, "tmp64 = ");
4655 else if (!IS(pp->ret_type.name, "void")) {
4656 if (po->flags & OPF_TAIL) {
4657 if (!IS(g_func_pp->ret_type.name, "void")) {
4658 fprintf(fout, "return ");
4659 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
4660 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
4663 else if (regmask & (1 << xAX)) {
4664 fprintf(fout, "eax = ");
4665 if (pp->ret_type.is_ptr)
4666 fprintf(fout, "(u32)");
4670 if (pp->name[0] == 0)
4671 ferr(po, "missing pp->name\n");
4672 fprintf(fout, "%s%s(", pp->name,
4673 pp->has_structarg ? "_sa" : "");
4675 if (po->flags & OPF_ATAIL) {
4676 if (pp->argc_stack != g_func_pp->argc_stack
4677 || (pp->argc_stack > 0
4678 && pp->is_stdcall != g_func_pp->is_stdcall))
4679 ferr(po, "incompatible tailcall\n");
4680 if (g_func_pp->has_retreg)
4681 ferr(po, "TODO: retreg+tailcall\n");
4683 for (arg = j = 0; arg < pp->argc; arg++) {
4685 fprintf(fout, ", ");
4688 if (pp->arg[arg].type.is_ptr)
4689 snprintf(cast, sizeof(cast), "(%s)",
4690 pp->arg[arg].type.name);
4692 if (pp->arg[arg].reg != NULL) {
4693 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4697 for (; j < g_func_pp->argc; j++)
4698 if (g_func_pp->arg[j].reg == NULL)
4700 fprintf(fout, "%sa%d", cast, j + 1);
4705 for (arg = 0; arg < pp->argc; arg++) {
4707 fprintf(fout, ", ");
4710 if (pp->arg[arg].type.is_ptr)
4711 snprintf(cast, sizeof(cast), "(%s)",
4712 pp->arg[arg].type.name);
4714 if (pp->arg[arg].reg != NULL) {
4715 if (pp->arg[arg].type.is_retreg)
4716 fprintf(fout, "&%s", pp->arg[arg].reg);
4718 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4723 tmp_op = pp->arg[arg].datap;
4725 ferr(po, "parsed_op missing for arg%d\n", arg);
4727 if (tmp_op->flags & OPF_VAPUSH) {
4728 fprintf(fout, "ap");
4730 else if (tmp_op->p_argpass != 0) {
4731 fprintf(fout, "a%d", tmp_op->p_argpass);
4733 else if (tmp_op->p_argnum != 0) {
4734 fprintf(fout, "%ss_a%d", cast, tmp_op->p_argnum);
4738 out_src_opr(buf1, sizeof(buf1),
4739 tmp_op, &tmp_op->operand[0], cast, 0));
4743 fprintf(fout, ");");
4745 if (strstr(pp->ret_type.name, "int64")) {
4746 fprintf(fout, "\n");
4747 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
4748 fprintf(fout, "%seax = tmp64;", buf3);
4751 if (pp->is_unresolved) {
4752 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
4754 strcat(g_comment, buf2);
4757 if (po->flags & OPF_TAIL) {
4759 if (i == opcnt - 1 || pp->is_noreturn)
4761 else if (IS(pp->ret_type.name, "void"))
4763 else if (IS(g_func_pp->ret_type.name, "void"))
4765 // else already handled as 'return f()'
4768 if (!IS(g_func_pp->ret_type.name, "void")) {
4769 ferr(po, "int func -> void func tailcall?\n");
4772 fprintf(fout, "\n%sreturn;", buf3);
4773 strcat(g_comment, " ^ tailcall");
4777 strcat(g_comment, " tailcall");
4779 if (pp->is_noreturn)
4780 strcat(g_comment, " noreturn");
4781 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
4782 strcat(g_comment, " argframe");
4783 if (po->flags & OPF_CC)
4784 strcat(g_comment, " cond");
4786 if (po->flags & OPF_CC)
4787 fprintf(fout, "\n }");
4789 delayed_flag_op = NULL;
4790 last_arith_dst = NULL;
4794 if (g_func_pp->is_vararg)
4795 fprintf(fout, " va_end(ap);\n");
4796 if (g_func_pp->has_retreg) {
4797 for (arg = 0; arg < g_func_pp->argc; arg++)
4798 if (g_func_pp->arg[arg].type.is_retreg)
4799 fprintf(fout, " *r_%s = %s;\n",
4800 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
4803 if (IS(g_func_pp->ret_type.name, "void")) {
4804 if (i != opcnt - 1 || label_pending)
4805 fprintf(fout, " return;");
4807 else if (g_func_pp->ret_type.is_ptr) {
4808 fprintf(fout, " return (%s)eax;",
4809 g_func_pp->ret_type.name);
4811 else if (IS(g_func_pp->ret_type.name, "__int64"))
4812 fprintf(fout, " return ((u64)edx << 32) | eax;");
4814 fprintf(fout, " return eax;");
4816 last_arith_dst = NULL;
4817 delayed_flag_op = NULL;
4821 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4822 if (po->p_argnum != 0) {
4823 // special case - saved func arg
4824 fprintf(fout, " s_a%d = %s;", po->p_argnum, buf1);
4827 else if (po->flags & OPF_RSAVE) {
4828 fprintf(fout, " s_%s = %s;", buf1, buf1);
4831 else if (g_func_pp->is_userstack) {
4832 fprintf(fout, " *(--esp) = %s;", buf1);
4835 if (!(g_ida_func_attr & IDAFA_NORETURN))
4836 ferr(po, "stray push encountered\n");
4841 if (po->flags & OPF_RSAVE) {
4842 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4843 fprintf(fout, " %s = s_%s;", buf1, buf1);
4846 else if (po->datap != NULL) {
4849 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4850 fprintf(fout, " %s = %s;", buf1,
4851 out_src_opr(buf2, sizeof(buf2),
4852 tmp_op, &tmp_op->operand[0],
4853 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4856 else if (g_func_pp->is_userstack) {
4857 fprintf(fout, " %s = *esp++;",
4858 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4862 ferr(po, "stray pop encountered\n");
4871 ferr(po, "unhandled op type %d, flags %x\n",
4876 if (g_comment[0] != 0) {
4877 char *p = g_comment;
4878 while (my_isblank(*p))
4880 fprintf(fout, " // %s", p);
4885 fprintf(fout, "\n");
4887 // some sanity checking
4888 if (po->flags & OPF_REP) {
4889 if (po->op != OP_STOS && po->op != OP_MOVS
4890 && po->op != OP_CMPS && po->op != OP_SCAS)
4891 ferr(po, "unexpected rep\n");
4892 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
4893 && (po->op == OP_CMPS || po->op == OP_SCAS))
4894 ferr(po, "cmps/scas with plain rep\n");
4896 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
4897 && po->op != OP_CMPS && po->op != OP_SCAS)
4898 ferr(po, "unexpected repz/repnz\n");
4901 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
4903 // see is delayed flag stuff is still valid
4904 if (delayed_flag_op != NULL && delayed_flag_op != po) {
4905 if (is_any_opr_modified(delayed_flag_op, po, 0))
4906 delayed_flag_op = NULL;
4909 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
4910 if (is_opr_modified(last_arith_dst, po))
4911 last_arith_dst = NULL;
4917 if (g_stack_fsz && !g_stack_frame_used)
4918 fprintf(fout, " (void)sf;\n");
4920 fprintf(fout, "}\n\n");
4923 for (i = 0; i < opcnt; i++) {
4924 struct label_ref *lr, *lr_del;
4926 lr = g_label_refs[i].next;
4927 while (lr != NULL) {
4932 g_label_refs[i].i = -1;
4933 g_label_refs[i].next = NULL;
4935 if (ops[i].op == OP_CALL) {
4937 proto_release(ops[i].pp);
4943 static void set_label(int i, const char *name)
4949 p = strchr(name, ':');
4953 if (len > sizeof(g_labels[0]) - 1)
4954 aerr("label '%s' too long: %d\n", name, len);
4955 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
4956 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
4957 memcpy(g_labels[i], name, len);
4958 g_labels[i][len] = 0;
4961 // '=' needs special treatment..
4962 static char *next_word_s(char *w, size_t wsize, char *s)
4968 for (i = 0; i < wsize - 1; i++) {
4969 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
4975 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
4976 printf("warning: '%s' truncated\n", w);
4987 static struct chunk_item *func_chunks;
4988 static int func_chunk_cnt;
4989 static int func_chunk_alloc;
4991 static void add_func_chunk(FILE *fasm, const char *name, int line)
4993 if (func_chunk_cnt >= func_chunk_alloc) {
4994 func_chunk_alloc *= 2;
4995 func_chunks = realloc(func_chunks,
4996 func_chunk_alloc * sizeof(func_chunks[0]));
4997 my_assert_not(func_chunks, NULL);
4999 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
5000 func_chunks[func_chunk_cnt].name = strdup(name);
5001 func_chunks[func_chunk_cnt].asmln = line;
5005 static int cmp_chunks(const void *p1, const void *p2)
5007 const struct chunk_item *c1 = p1, *c2 = p2;
5008 return strcmp(c1->name, c2->name);
5011 static int cmpstringp(const void *p1, const void *p2)
5013 return strcmp(*(char * const *)p1, *(char * const *)p2);
5016 static void scan_ahead(FILE *fasm)
5026 oldpos = ftell(fasm);
5029 while (fgets(line, sizeof(line), fasm))
5040 // get rid of random tabs
5041 for (i = 0; line[i] != 0; i++)
5042 if (line[i] == '\t')
5045 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5048 next_word(words[0], sizeof(words[0]), p);
5049 if (words[0][0] == 0)
5050 aerr("missing name for func chunk?\n");
5052 add_func_chunk(fasm, words[0], asmln);
5054 else if (IS_START(p, "; sctend"))
5060 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5061 words[wordc][0] = 0;
5062 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5063 if (*p == 0 || *p == ';') {
5069 if (wordc == 2 && IS(words[1], "ends"))
5073 fseek(fasm, oldpos, SEEK_SET);
5077 int main(int argc, char *argv[])
5079 FILE *fout, *fasm, *frlist;
5080 struct parsed_data *pd = NULL;
5082 char **rlist = NULL;
5084 int rlist_alloc = 0;
5085 int func_chunks_used = 0;
5086 int func_chunks_sorted = 0;
5087 int func_chunk_i = -1;
5088 long func_chunk_ret = 0;
5089 int func_chunk_ret_ln = 0;
5090 int scanned_ahead = 0;
5092 char words[20][256];
5093 enum opr_lenmod lmod;
5094 char *sctproto = NULL;
5096 int pending_endp = 0;
5098 int skip_warned = 0;
5111 for (arg = 1; arg < argc; arg++) {
5112 if (IS(argv[arg], "-v"))
5114 else if (IS(argv[arg], "-rf"))
5115 g_allow_regfunc = 1;
5116 else if (IS(argv[arg], "-m"))
5122 if (argc < arg + 3) {
5123 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdrf> [rlist]*\n",
5130 asmfn = argv[arg++];
5131 fasm = fopen(asmfn, "r");
5132 my_assert_not(fasm, NULL);
5134 hdrfn = argv[arg++];
5135 g_fhdr = fopen(hdrfn, "r");
5136 my_assert_not(g_fhdr, NULL);
5139 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
5140 my_assert_not(rlist, NULL);
5141 // needs special handling..
5142 rlist[rlist_len++] = "__alloca_probe";
5144 func_chunk_alloc = 32;
5145 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
5146 my_assert_not(func_chunks, NULL);
5148 memset(words, 0, sizeof(words));
5150 for (; arg < argc; arg++) {
5151 frlist = fopen(argv[arg], "r");
5152 my_assert_not(frlist, NULL);
5154 while (fgets(line, sizeof(line), frlist)) {
5156 if (*p == 0 || *p == ';')
5159 if (IS_START(p, "#if 0")
5160 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
5164 else if (IS_START(p, "#endif"))
5171 p = next_word(words[0], sizeof(words[0]), p);
5172 if (words[0][0] == 0)
5175 if (rlist_len >= rlist_alloc) {
5176 rlist_alloc = rlist_alloc * 2 + 64;
5177 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
5178 my_assert_not(rlist, NULL);
5180 rlist[rlist_len++] = strdup(words[0]);
5189 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
5191 fout = fopen(argv[arg_out], "w");
5192 my_assert_not(fout, NULL);
5195 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
5196 my_assert_not(g_eqs, NULL);
5198 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
5199 g_label_refs[i].i = -1;
5200 g_label_refs[i].next = NULL;
5203 while (fgets(line, sizeof(line), fasm))
5212 // get rid of random tabs
5213 for (i = 0; line[i] != 0; i++)
5214 if (line[i] == '\t')
5219 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
5220 goto do_pending_endp; // eww..
5222 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
5224 static const char *attrs[] = {
5233 // parse IDA's attribute-list comment
5234 g_ida_func_attr = 0;
5237 for (; *p != 0; p = sskip(p)) {
5238 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
5239 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
5240 g_ida_func_attr |= 1 << i;
5241 p += strlen(attrs[i]);
5245 if (i == ARRAY_SIZE(attrs)) {
5246 anote("unparsed IDA attr: %s\n", p);
5249 if (IS(attrs[i], "fpd=")) {
5250 p = next_word(words[0], sizeof(words[0]), p);
5255 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5258 next_word(words[0], sizeof(words[0]), p);
5259 if (words[0][0] == 0)
5260 aerr("missing name for func chunk?\n");
5262 if (!scanned_ahead) {
5263 add_func_chunk(fasm, words[0], asmln);
5264 func_chunks_sorted = 0;
5267 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
5269 if (func_chunk_i >= 0) {
5270 if (func_chunk_i < func_chunk_cnt
5271 && IS(func_chunks[func_chunk_i].name, g_func))
5273 // move on to next chunk
5274 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5276 aerr("seek failed for '%s' chunk #%d\n",
5277 g_func, func_chunk_i);
5278 asmln = func_chunks[func_chunk_i].asmln;
5282 if (func_chunk_ret == 0)
5283 aerr("no return from chunk?\n");
5284 fseek(fasm, func_chunk_ret, SEEK_SET);
5285 asmln = func_chunk_ret_ln;
5291 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
5292 func_chunks_used = 1;
5294 if (IS_START(g_func, "sub_")) {
5295 unsigned long addr = strtoul(p, NULL, 16);
5296 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
5297 if (addr > f_addr && !scanned_ahead) {
5298 anote("scan_ahead caused by '%s', addr %lx\n",
5302 func_chunks_sorted = 0;
5310 for (i = wordc; i < ARRAY_SIZE(words); i++)
5312 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5313 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5314 if (*p == 0 || *p == ';') {
5319 if (*p != 0 && *p != ';')
5320 aerr("too many words\n");
5322 // alow asm patches in comments
5324 if (IS_START(p, "; sctpatch:")) {
5326 if (*p == 0 || *p == ';')
5328 goto parse_words; // lame
5330 if (IS_START(p, "; sctproto:")) {
5331 sctproto = strdup(p + 11);
5333 else if (IS_START(p, "; sctend")) {
5342 awarn("wordc == 0?\n");
5346 // don't care about this:
5347 if (words[0][0] == '.'
5348 || IS(words[0], "include")
5349 || IS(words[0], "assume") || IS(words[1], "segment")
5350 || IS(words[0], "align"))
5356 // do delayed endp processing to collect switch jumptables
5358 if (in_func && !skip_func && !end && wordc >= 2
5359 && ((words[0][0] == 'd' && words[0][2] == 0)
5360 || (words[1][0] == 'd' && words[1][2] == 0)))
5363 if (words[1][0] == 'd' && words[1][2] == 0) {
5365 if (g_func_pd_cnt >= pd_alloc) {
5366 pd_alloc = pd_alloc * 2 + 16;
5367 g_func_pd = realloc(g_func_pd,
5368 sizeof(g_func_pd[0]) * pd_alloc);
5369 my_assert_not(g_func_pd, NULL);
5371 pd = &g_func_pd[g_func_pd_cnt];
5373 memset(pd, 0, sizeof(*pd));
5374 strcpy(pd->label, words[0]);
5375 pd->type = OPT_CONST;
5376 pd->lmod = lmod_from_directive(words[1]);
5382 anote("skipping alignment byte?\n");
5385 lmod = lmod_from_directive(words[0]);
5386 if (lmod != pd->lmod)
5387 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
5390 if (pd->count_alloc < pd->count + wordc) {
5391 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
5392 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
5393 my_assert_not(pd->d, NULL);
5395 for (; i < wordc; i++) {
5396 if (IS(words[i], "offset")) {
5397 pd->type = OPT_OFFSET;
5400 p = strchr(words[i], ',');
5403 if (pd->type == OPT_OFFSET)
5404 pd->d[pd->count].u.label = strdup(words[i]);
5406 pd->d[pd->count].u.val = parse_number(words[i]);
5407 pd->d[pd->count].bt_i = -1;
5413 if (in_func && !skip_func)
5414 gen_func(fout, g_fhdr, g_func, pi);
5418 g_ida_func_attr = 0;
5422 func_chunks_used = 0;
5425 memset(&ops, 0, pi * sizeof(ops[0]));
5426 memset(g_labels, 0, pi * sizeof(g_labels[0]));
5430 for (i = 0; i < g_func_pd_cnt; i++) {
5432 if (pd->type == OPT_OFFSET) {
5433 for (j = 0; j < pd->count; j++)
5434 free(pd->d[j].u.label);
5448 if (IS(words[1], "proc")) {
5450 aerr("proc '%s' while in_func '%s'?\n",
5453 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
5455 strcpy(g_func, words[0]);
5456 set_label(0, words[0]);
5461 if (IS(words[1], "endp"))
5464 aerr("endp '%s' while not in_func?\n", words[0]);
5465 if (!IS(g_func, words[0]))
5466 aerr("endp '%s' while in_func '%s'?\n",
5469 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
5470 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
5476 if (!skip_func && func_chunks_used) {
5477 // start processing chunks
5478 struct chunk_item *ci, key = { g_func, 0 };
5480 func_chunk_ret = ftell(fasm);
5481 func_chunk_ret_ln = asmln;
5482 if (!func_chunks_sorted) {
5483 qsort(func_chunks, func_chunk_cnt,
5484 sizeof(func_chunks[0]), cmp_chunks);
5485 func_chunks_sorted = 1;
5487 ci = bsearch(&key, func_chunks, func_chunk_cnt,
5488 sizeof(func_chunks[0]), cmp_chunks);
5490 aerr("'%s' needs chunks, but none found\n", g_func);
5491 func_chunk_i = ci - func_chunks;
5492 for (; func_chunk_i > 0; func_chunk_i--)
5493 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
5496 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5498 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
5499 asmln = func_chunks[func_chunk_i].asmln;
5507 if (wordc == 2 && IS(words[1], "ends")) {
5511 goto do_pending_endp;
5515 // scan for next text segment
5516 while (fgets(line, sizeof(line), fasm)) {
5519 if (*p == 0 || *p == ';')
5522 if (strstr(p, "segment para public 'CODE' use32"))
5529 p = strchr(words[0], ':');
5531 set_label(pi, words[0]);
5535 if (!in_func || skip_func) {
5536 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
5538 anote("skipping from '%s'\n", g_labels[pi]);
5541 g_labels[pi][0] = 0;
5545 if (wordc > 1 && IS(words[1], "="))
5548 aerr("unhandled equ, wc=%d\n", wordc);
5549 if (g_eqcnt >= eq_alloc) {
5551 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
5552 my_assert_not(g_eqs, NULL);
5555 len = strlen(words[0]);
5556 if (len > sizeof(g_eqs[0].name) - 1)
5557 aerr("equ name too long: %d\n", len);
5558 strcpy(g_eqs[g_eqcnt].name, words[0]);
5560 if (!IS(words[3], "ptr"))
5561 aerr("unhandled equ\n");
5562 if (IS(words[2], "dword"))
5563 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
5564 else if (IS(words[2], "word"))
5565 g_eqs[g_eqcnt].lmod = OPLM_WORD;
5566 else if (IS(words[2], "byte"))
5567 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
5569 aerr("bad lmod: '%s'\n", words[2]);
5571 g_eqs[g_eqcnt].offset = parse_number(words[4]);
5576 if (pi >= ARRAY_SIZE(ops))
5577 aerr("too many ops\n");
5579 parse_op(&ops[pi], words, wordc);
5581 if (sctproto != NULL) {
5582 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
5583 ops[pi].datap = sctproto;
5596 // vim:ts=2:shiftwidth=2:expandtab