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) */
121 // must be sorted (larger len must be further in enum)
129 #define MAX_OPERANDS 3
133 enum opr_lenmod lmod;
134 unsigned int is_ptr:1; // pointer in C
135 unsigned int is_array:1; // array in C
136 unsigned int type_from_var:1; // .. in header, sometimes wrong
137 unsigned int size_mismatch:1; // type override differs from C
138 unsigned int size_lt:1; // type override is larger than C
139 unsigned int had_ds:1; // had ds: prefix
140 const struct parsed_proto *pp; // for OPT_LABEL
148 struct parsed_opr operand[MAX_OPERANDS];
151 unsigned char pfo_inv;
152 unsigned char operand_cnt;
154 int regmask_src; // all referensed regs
156 int pfomask; // flagop: parsed_flag_op that can't be delayed
157 int argnum; // push: altered before call arg #
158 int cc_scratch; // scratch storage during analysis
159 int bt_i; // branch target for branches
160 struct parsed_data *btj;// branch targets for jumptables
161 struct parsed_proto *pp;// parsed_proto for OP_CALL
167 // OP_CALL - parser proto hint (str)
168 // (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
169 // OP_POP - point to OP_PUSH in push/pop pair
173 enum opr_lenmod lmod;
180 enum opr_lenmod lmod;
194 struct label_ref *next;
198 IDAFA_BP_FRAME = (1 << 0),
199 IDAFA_LIB_FUNC = (1 << 1),
200 IDAFA_STATIC = (1 << 2),
201 IDAFA_NORETURN = (1 << 3),
202 IDAFA_THUNK = (1 << 4),
203 IDAFA_FPD = (1 << 5),
208 static struct parsed_op ops[MAX_OPS];
209 static struct parsed_equ *g_eqs;
211 static char g_labels[MAX_OPS][48];
212 static struct label_ref g_label_refs[MAX_OPS];
213 static const struct parsed_proto *g_func_pp;
214 static struct parsed_data *g_func_pd;
215 static int g_func_pd_cnt;
216 static char g_func[256];
217 static char g_comment[256];
218 static int g_bp_frame;
219 static int g_sp_frame;
220 static int g_stack_frame_used;
221 static int g_stack_fsz;
222 static int g_ida_func_attr;
223 static int g_allow_regfunc;
224 #define ferr(op_, fmt, ...) do { \
225 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
226 dump_op(op_), ##__VA_ARGS__); \
230 #define fnote(op_, fmt, ...) \
231 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
232 dump_op(op_), ##__VA_ARGS__)
236 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
237 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
238 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
239 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
241 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
243 // possible basic comparison types (without inversion)
244 enum parsed_flag_op {
248 PFO_BE, // 6 CF=1||ZF=1
252 PFO_LE, // e ZF=1||SF!=OF
255 static const char *parsed_flag_op_names[] = {
256 "o", "c", "z", "be", "s", "p", "l", "le"
259 static int char_array_i(const char *array[], size_t len, const char *s)
263 for (i = 0; i < len; i++)
270 static void printf_number(char *buf, size_t buf_size,
271 unsigned long number)
273 // output in C-friendly form
274 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
277 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
281 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
283 *reg_lmod = OPLM_DWORD;
286 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
288 *reg_lmod = OPLM_WORD;
291 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
293 *reg_lmod = OPLM_BYTE;
296 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
298 *reg_lmod = OPLM_BYTE;
305 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
307 enum opr_lenmod lmod;
320 while (my_isblank(*s))
322 for (; my_issep(*s); d++, s++)
324 while (my_isblank(*s))
329 if (IS_START(s, "ds:"))
332 s = next_idt(w, sizeof(w), s);
337 reg = parse_reg(&lmod, w);
339 *regmask |= 1 << reg;
343 if ('0' <= w[0] && w[0] <= '9') {
344 number = parse_number(w);
345 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
349 // probably some label/identifier - pass
352 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
356 strcpy(name, cvtbuf);
361 static int is_reg_in_str(const char *s)
365 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
368 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
369 if (!strncmp(s, regs_r32[i], 3))
375 static const char *parse_stack_el(const char *name, char *extra_reg)
377 const char *p, *p2, *s;
384 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
386 if (extra_reg != NULL) {
387 strncpy(extra_reg, name, 3);
392 if (IS_START(p, "ebp+")) {
396 if (p2 != NULL && is_reg_in_str(p)) {
397 if (extra_reg != NULL) {
398 strncpy(extra_reg, p, p2 - p);
399 extra_reg[p2 - p] = 0;
404 if (!('0' <= *p && *p <= '9'))
410 if (!IS_START(name, "esp+"))
416 if (is_reg_in_str(s)) {
417 if (extra_reg != NULL) {
418 strncpy(extra_reg, s, p - s);
419 extra_reg[p - s] = 0;
424 aerr("%s IDA stackvar not set?\n", __func__);
426 if (!('0' <= *s && *s <= '9')) {
427 aerr("%s IDA stackvar offset not set?\n", __func__);
430 if (s[0] == '0' && s[1] == 'x')
433 if (len < sizeof(buf) - 1) {
434 strncpy(buf, s, len);
436 val = strtol(buf, &endp, 16);
437 if (val == 0 || *endp != 0) {
438 aerr("%s num parse fail for '%s'\n", __func__, buf);
447 if ('0' <= *p && *p <= '9')
453 static int guess_lmod_from_name(struct parsed_opr *opr)
455 if (!strncmp(opr->name, "dword_", 6)) {
456 opr->lmod = OPLM_DWORD;
459 if (!strncmp(opr->name, "word_", 5)) {
460 opr->lmod = OPLM_WORD;
463 if (!strncmp(opr->name, "byte_", 5)) {
464 opr->lmod = OPLM_BYTE;
470 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
471 const struct parsed_type *c_type)
473 static const char *dword_types[] = {
474 "int", "_DWORD", "UINT_PTR", "DWORD",
475 "WPARAM", "LPARAM", "UINT", "__int32",
476 "LONG", "HIMC", "BOOL",
478 static const char *word_types[] = {
479 "uint16_t", "int16_t", "_WORD", "WORD",
480 "unsigned __int16", "__int16",
482 static const char *byte_types[] = {
483 "uint8_t", "int8_t", "char",
484 "unsigned __int8", "__int8", "BYTE", "_BYTE",
486 // structures.. deal the same as with _UNKNOWN for now
492 if (c_type->is_ptr) {
497 n = skip_type_mod(c_type->name);
499 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
500 if (IS(n, dword_types[i])) {
506 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
507 if (IS(n, word_types[i])) {
513 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
514 if (IS(n, byte_types[i])) {
523 static char *default_cast_to(char *buf, size_t buf_size,
524 struct parsed_opr *opr)
530 if (opr->pp == NULL || opr->pp->type.name == NULL
533 snprintf(buf, buf_size, "%s", "(void *)");
537 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
541 static enum opr_type lmod_from_directive(const char *d)
545 else if (IS(d, "dw"))
547 else if (IS(d, "db"))
550 aerr("unhandled directive: '%s'\n", d);
554 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
560 *regmask |= 1 << reg;
563 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
566 static int parse_operand(struct parsed_opr *opr,
567 int *regmask, int *regmask_indirect,
568 char words[16][256], int wordc, int w, unsigned int op_flags)
570 const struct parsed_proto *pp;
571 enum opr_lenmod tmplmod;
572 unsigned long number;
580 aerr("parse_operand w %d, wordc %d\n", w, wordc);
584 for (i = w; i < wordc; i++) {
585 len = strlen(words[i]);
586 if (words[i][len - 1] == ',') {
587 words[i][len - 1] = 0;
593 wordc_in = wordc - w;
595 if ((op_flags & OPF_JMP) && wordc_in > 0
596 && !('0' <= words[w][0] && words[w][0] <= '9'))
598 const char *label = NULL;
600 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
601 && IS(words[w + 1], "ptr"))
602 label = words[w + 2];
603 else if (wordc_in == 2 && IS(words[w], "short"))
604 label = words[w + 1];
605 else if (wordc_in == 1
606 && strchr(words[w], '[') == NULL
607 && parse_reg(&tmplmod, words[w]) < 0)
611 opr->type = OPT_LABEL;
612 if (IS_START(label, "ds:")) {
616 strcpy(opr->name, label);
622 if (IS(words[w + 1], "ptr")) {
623 if (IS(words[w], "dword"))
624 opr->lmod = OPLM_DWORD;
625 else if (IS(words[w], "word"))
626 opr->lmod = OPLM_WORD;
627 else if (IS(words[w], "byte"))
628 opr->lmod = OPLM_BYTE;
630 aerr("type parsing failed\n");
632 wordc_in = wordc - w;
637 if (IS(words[w], "offset")) {
638 opr->type = OPT_OFFSET;
639 opr->lmod = OPLM_DWORD;
640 strcpy(opr->name, words[w + 1]);
641 pp = proto_parse(g_fhdr, opr->name, 1);
644 if (IS(words[w], "(offset")) {
645 p = strchr(words[w + 1], ')');
647 aerr("parse of bracketed offset failed\n");
649 opr->type = OPT_OFFSET;
650 strcpy(opr->name, words[w + 1]);
656 aerr("parse_operand 1 word expected\n");
658 if (IS_START(words[w], "ds:")) {
660 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
662 strcpy(opr->name, words[w]);
664 if (words[w][0] == '[') {
665 opr->type = OPT_REGMEM;
666 ret = sscanf(words[w], "[%[^]]]", opr->name);
668 aerr("[] parse failure\n");
670 parse_indmode(opr->name, regmask_indirect, 1);
671 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
673 struct parsed_equ *eq =
674 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
676 opr->lmod = eq->lmod;
680 else if (strchr(words[w], '[')) {
682 p = strchr(words[w], '[');
683 opr->type = OPT_REGMEM;
684 parse_indmode(p, regmask_indirect, 0);
685 strncpy(buf, words[w], p - words[w]);
686 buf[p - words[w]] = 0;
687 pp = proto_parse(g_fhdr, buf, 1);
690 else if (('0' <= words[w][0] && words[w][0] <= '9')
691 || words[w][0] == '-')
693 number = parse_number(words[w]);
694 opr->type = OPT_CONST;
696 printf_number(opr->name, sizeof(opr->name), number);
700 ret = parse_reg(&tmplmod, opr->name);
702 setup_reg_opr(opr, ret, tmplmod, regmask);
706 // most likely var in data segment
707 opr->type = OPT_LABEL;
708 pp = proto_parse(g_fhdr, opr->name, 0);
712 if (pp->is_fptr || pp->is_func) {
713 opr->lmod = OPLM_DWORD;
717 tmplmod = OPLM_UNSPEC;
718 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
719 anote("unhandled C type '%s' for '%s'\n",
720 pp->type.name, opr->name);
722 if (opr->lmod == OPLM_UNSPEC) {
724 opr->type_from_var = 1;
726 else if (opr->lmod != tmplmod) {
727 opr->size_mismatch = 1;
728 if (tmplmod < opr->lmod)
731 opr->is_ptr = pp->type.is_ptr;
733 opr->is_array = pp->type.is_array;
737 if (opr->lmod == OPLM_UNSPEC)
738 guess_lmod_from_name(opr);
742 static const struct {
747 { "repe", OPF_REP|OPF_REPZ },
748 { "repz", OPF_REP|OPF_REPZ },
749 { "repne", OPF_REP|OPF_REPNZ },
750 { "repnz", OPF_REP|OPF_REPNZ },
751 { "lock", OPF_LOCK }, // ignored for now..
754 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
756 static const struct {
759 unsigned short minopr;
760 unsigned short maxopr;
763 unsigned char pfo_inv;
765 { "nop", OP_NOP, 0, 0, 0 },
766 { "push", OP_PUSH, 1, 1, 0 },
767 { "pop", OP_POP, 1, 1, OPF_DATA },
768 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
769 { "mov" , OP_MOV, 2, 2, OPF_DATA },
770 { "lea", OP_LEA, 2, 2, OPF_DATA },
771 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
772 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
773 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
774 { "not", OP_NOT, 1, 1, OPF_DATA },
775 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
776 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
777 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
778 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
779 { "stosb",OP_STOS, 0, 0, OPF_DATA },
780 { "stosw",OP_STOS, 0, 0, OPF_DATA },
781 { "stosd",OP_STOS, 0, 0, OPF_DATA },
782 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
783 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
784 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
785 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
786 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
787 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
788 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
789 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
790 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
791 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
792 { "cld", OP_CLD, 0, 0, OPF_DATA },
793 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
794 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
795 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
796 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
797 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
798 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
799 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
800 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
801 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
802 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
803 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
804 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
805 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
806 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
807 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
808 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
809 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
810 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
811 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
812 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
813 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
814 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
815 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
816 { "test", OP_TEST, 2, 2, OPF_FLAGS },
817 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
818 { "retn", OP_RET, 0, 1, OPF_TAIL },
819 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
820 { "jmp", OP_JMP, 1, 1, OPF_JMP },
821 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
822 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
823 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
824 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
825 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
826 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
827 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
828 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
829 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
830 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
831 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
832 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
833 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
834 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
835 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
836 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
837 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
838 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
839 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
840 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
841 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
842 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
843 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
844 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
845 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
846 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
847 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
848 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
849 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
850 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
851 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
852 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
853 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
854 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
855 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
856 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
857 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
858 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
859 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
860 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
861 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
862 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
863 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
864 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
865 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
866 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
867 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
868 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
869 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
870 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
871 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
872 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
873 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
874 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
875 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
876 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
877 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
878 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
879 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
882 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
884 enum opr_lenmod lmod = OPLM_UNSPEC;
885 int prefix_flags = 0;
893 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
894 if (IS(words[w], pref_table[i].name)) {
895 prefix_flags = pref_table[i].flags;
902 aerr("lone prefix: '%s'\n", words[0]);
907 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
908 if (IS(words[w], op_table[i].name))
912 if (i == ARRAY_SIZE(op_table))
913 aerr("unhandled op: '%s'\n", words[0]);
916 op->op = op_table[i].op;
917 op->flags = op_table[i].flags | prefix_flags;
918 op->pfo = op_table[i].pfo;
919 op->pfo_inv = op_table[i].pfo_inv;
920 op->regmask_src = op->regmask_dst = 0;
923 for (opr = 0; opr < op_table[i].minopr; opr++) {
924 regmask = regmask_ind = 0;
925 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
926 words, wordc, w, op->flags);
928 if (opr == 0 && (op->flags & OPF_DATA))
929 op->regmask_dst = regmask;
930 // for now, mark dst as src too
931 op->regmask_src |= regmask | regmask_ind;
934 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
935 w = parse_operand(&op->operand[opr],
936 &op->regmask_src, &op->regmask_src,
937 words, wordc, w, op->flags);
941 aerr("parse_op %s incomplete: %d/%d\n",
945 op->operand_cnt = opr;
946 if (!strncmp(op_table[i].name, "set", 3))
947 op->operand[0].lmod = OPLM_BYTE;
949 // ops with implicit argumets
953 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
954 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
960 if (op->operand_cnt != 0)
962 if (words[op_w][4] == 'b')
964 else if (words[op_w][4] == 'w')
966 else if (words[op_w][4] == 'd')
969 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
970 lmod, &op->regmask_src);
971 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
972 op->regmask_dst = op->regmask_src;
973 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
974 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
979 if (op->operand_cnt != 0)
981 if (words[op_w][4] == 'b')
983 else if (words[op_w][4] == 'w')
985 else if (words[op_w][4] == 'd')
988 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
989 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
990 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
991 op->regmask_dst = op->regmask_src;
995 op->regmask_src |= op->regmask_dst;
996 op->regmask_dst |= op->regmask_src;
1000 op->operand_cnt = 1;
1001 op->regmask_src = 1 << xCX;
1002 op->operand[0].type = OPT_REG;
1003 op->operand[0].reg = xCX;
1004 op->operand[0].lmod = OPLM_DWORD;
1008 if (op->operand_cnt != 1)
1013 op->regmask_dst = (1 << xDX) | (1 << xAX);
1014 op->regmask_src |= (1 << xAX);
1015 if (op->operand[0].lmod == OPLM_UNSPEC)
1016 op->operand[0].lmod = OPLM_DWORD;
1021 // we could set up operands for edx:eax, but there is no real need to
1022 // (see is_opr_modified())
1023 regmask = (1 << xDX) | (1 << xAX);
1024 op->regmask_dst = regmask;
1025 op->regmask_src |= regmask;
1026 if (op->operand[0].lmod == OPLM_UNSPEC)
1027 op->operand[0].lmod = OPLM_DWORD;
1035 if (op->operand[1].lmod == OPLM_UNSPEC)
1036 op->operand[1].lmod = OPLM_BYTE;
1040 if (op->operand[0].lmod == OPLM_UNSPEC
1041 && (op->operand[0].type == OPT_CONST
1042 || op->operand[0].type == OPT_OFFSET
1043 || op->operand[0].type == OPT_LABEL))
1044 op->operand[0].lmod = OPLM_DWORD;
1050 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1051 && op->operand[0].lmod == op->operand[1].lmod
1052 && op->operand[0].reg == op->operand[1].reg
1053 && IS(op->operand[0].name, op->operand[1].name)) // ah, al..
1055 op->flags |= OPF_RMD;
1056 op->regmask_src = op->regmask_dst = 0;
1061 if (op->operand[0].type == OPT_REG
1062 && op->operand[1].type == OPT_REGMEM)
1065 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1066 if (IS(buf, op->operand[1].name))
1067 op->flags |= OPF_RMD;
1072 // trashed regs must be explicitly detected later
1073 op->regmask_dst = 0;
1081 static const char *op_name(struct parsed_op *po)
1083 static char buf[16];
1087 if (po->op == OP_JCC || po->op == OP_SCC) {
1089 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1092 strcpy(p, parsed_flag_op_names[po->pfo]);
1096 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1097 if (op_table[i].op == po->op)
1098 return op_table[i].name;
1104 static const char *dump_op(struct parsed_op *po)
1106 static char out[128];
1113 snprintf(out, sizeof(out), "%s", op_name(po));
1114 for (i = 0; i < po->operand_cnt; i++) {
1118 snprintf(p, sizeof(out) - (p - out),
1119 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1120 po->operand[i].name);
1126 static const char *lmod_type_u(struct parsed_op *po,
1127 enum opr_lenmod lmod)
1137 ferr(po, "invalid lmod: %d\n", lmod);
1138 return "(_invalid_)";
1142 static const char *lmod_cast_u(struct parsed_op *po,
1143 enum opr_lenmod lmod)
1153 ferr(po, "invalid lmod: %d\n", lmod);
1154 return "(_invalid_)";
1158 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1159 enum opr_lenmod lmod)
1169 ferr(po, "invalid lmod: %d\n", lmod);
1170 return "(_invalid_)";
1174 static const char *lmod_cast_s(struct parsed_op *po,
1175 enum opr_lenmod lmod)
1185 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1186 return "(_invalid_)";
1190 static const char *lmod_cast(struct parsed_op *po,
1191 enum opr_lenmod lmod, int is_signed)
1194 lmod_cast_s(po, lmod) :
1195 lmod_cast_u(po, lmod);
1198 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1208 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1213 static const char *opr_name(struct parsed_op *po, int opr_num)
1215 if (opr_num >= po->operand_cnt)
1216 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1217 return po->operand[opr_num].name;
1220 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1222 if (opr_num >= po->operand_cnt)
1223 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1224 if (po->operand[opr_num].type != OPT_CONST)
1225 ferr(po, "opr %d: const expected\n", opr_num);
1226 return po->operand[opr_num].val;
1229 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1231 if ((unsigned int)popr->reg >= MAX_REGS)
1232 ferr(po, "invalid reg: %d\n", popr->reg);
1233 return regs_r32[popr->reg];
1236 // cast1 is the "final" cast
1237 static const char *simplify_cast(const char *cast1, const char *cast2)
1239 static char buf[256];
1245 if (IS(cast1, cast2))
1247 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1249 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1251 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1253 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1255 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1258 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1262 static const char *simplify_cast_num(const char *cast, unsigned int val)
1264 if (IS(cast, "(u8)") && val < 0x100)
1266 if (IS(cast, "(s8)") && val < 0x80)
1268 if (IS(cast, "(u16)") && val < 0x10000)
1270 if (IS(cast, "(s16)") && val < 0x8000)
1272 if (IS(cast, "(s32)") && val < 0x80000000)
1278 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1287 namelen = strlen(name);
1289 p = strchr(name, '+');
1293 ferr(po, "equ parse failed for '%s'\n", name);
1295 if (IS_START(p, "0x"))
1297 *extra_offs = strtol(p, &endp, 16);
1299 ferr(po, "equ parse failed for '%s'\n", name);
1302 for (i = 0; i < g_eqcnt; i++)
1303 if (strncmp(g_eqs[i].name, name, namelen) == 0
1304 && g_eqs[i].name[namelen] == 0)
1308 ferr(po, "unresolved equ name: '%s'\n", name);
1315 static int is_stack_access(struct parsed_op *po,
1316 const struct parsed_opr *popr)
1318 return (parse_stack_el(popr->name, NULL)
1319 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1320 && IS_START(popr->name, "ebp")));
1323 static void parse_stack_access(struct parsed_op *po,
1324 const char *name, char *ofs_reg, int *offset_out,
1325 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1327 const char *bp_arg = "";
1328 const char *p = NULL;
1329 struct parsed_equ *eq;
1336 if (IS_START(name, "ebp-")
1337 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1340 if (IS_START(p, "0x"))
1342 offset = strtoul(p, &endp, 16);
1346 ferr(po, "ebp- parse of '%s' failed\n", name);
1349 bp_arg = parse_stack_el(name, ofs_reg);
1350 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1351 eq = equ_find(po, bp_arg, &offset);
1353 ferr(po, "detected but missing eq\n");
1354 offset += eq->offset;
1357 if (!strncmp(name, "ebp", 3))
1360 // yes it sometimes LEAs ra for compares..
1361 if (!is_lea && ofs_reg[0] == 0
1362 && stack_ra <= offset && offset < stack_ra + 4)
1364 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1367 *offset_out = offset;
1368 *stack_ra_out = stack_ra;
1370 *bp_arg_out = bp_arg;
1373 static void stack_frame_access(struct parsed_op *po,
1374 struct parsed_opr *popr, char *buf, size_t buf_size,
1375 const char *name, const char *cast, int is_src, int is_lea)
1377 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1378 const char *prefix = "";
1379 const char *bp_arg = NULL;
1380 char ofs_reg[16] = { 0, };
1381 int i, arg_i, arg_s;
1388 if (po->flags & OPF_EBP_S)
1389 ferr(po, "stack_frame_access while ebp is scratch\n");
1391 parse_stack_access(po, name, ofs_reg, &offset,
1392 &stack_ra, &bp_arg, is_lea);
1394 if (offset > stack_ra)
1396 arg_i = (offset - stack_ra - 4) / 4;
1397 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1399 if (g_func_pp->is_vararg
1400 && arg_i == g_func_pp->argc_stack && is_lea)
1402 // should be va_list
1405 snprintf(buf, buf_size, "%sap", cast);
1408 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1409 offset, bp_arg, arg_i);
1411 if (ofs_reg[0] != 0)
1412 ferr(po, "offset reg on arg access?\n");
1414 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1415 if (g_func_pp->arg[i].reg != NULL)
1421 if (i == g_func_pp->argc)
1422 ferr(po, "arg %d not in prototype?\n", arg_i);
1424 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1430 ferr(po, "lea/byte to arg?\n");
1431 if (is_src && (offset & 3) == 0)
1432 snprintf(buf, buf_size, "%sa%d",
1433 simplify_cast(cast, "(u8)"), i + 1);
1435 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1436 cast, offset & 3, i + 1);
1441 ferr(po, "lea/word to arg?\n");
1446 ferr(po, "problematic arg store\n");
1447 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1448 simplify_cast(cast, "*(u16 *)"), i + 1);
1451 ferr(po, "unaligned arg word load\n");
1453 else if (is_src && (offset & 2) == 0)
1454 snprintf(buf, buf_size, "%sa%d",
1455 simplify_cast(cast, "(u16)"), i + 1);
1457 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1458 cast, (offset & 2) ? "HI" : "LO", i + 1);
1470 snprintf(buf, buf_size, "(u32)&a%d + %d",
1473 ferr(po, "unaligned arg store\n");
1475 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1476 snprintf(buf, buf_size, "%s(a%d >> %d)",
1477 prefix, i + 1, (offset & 3) * 8);
1481 snprintf(buf, buf_size, "%s%sa%d",
1482 prefix, is_lea ? "&" : "", i + 1);
1487 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1491 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1494 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1495 if (tmp_lmod != OPLM_DWORD
1496 && (unaligned || (!is_src && tmp_lmod < popr->lmod)))
1498 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1499 i + 1, offset, g_func_pp->arg[i].type.name);
1501 // can't check this because msvc likes to reuse
1502 // arg space for scratch..
1503 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1504 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1508 if (g_stack_fsz == 0)
1509 ferr(po, "stack var access without stackframe\n");
1510 g_stack_frame_used = 1;
1512 sf_ofs = g_stack_fsz + offset;
1513 lim = (ofs_reg[0] != 0) ? -4 : 0;
1514 if (offset > 0 || sf_ofs < lim)
1515 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1525 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1526 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1530 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1531 // known unaligned or possibly unaligned
1532 strcat(g_comment, " unaligned");
1534 prefix = "*(u16 *)&";
1535 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1536 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1539 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1543 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1544 // known unaligned or possibly unaligned
1545 strcat(g_comment, " unaligned");
1547 prefix = "*(u32 *)&";
1548 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1549 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1552 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1556 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1561 static void check_func_pp(struct parsed_op *po,
1562 const struct parsed_proto *pp, const char *pfx)
1564 enum opr_lenmod tmp_lmod;
1568 if (pp->argc_reg != 0) {
1569 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1570 pp_print(buf, sizeof(buf), pp);
1571 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1573 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1574 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1575 pfx, pp->argc_reg, pp->argc_stack);
1578 // fptrs must use 32bit args, callsite might have no information and
1579 // lack a cast to smaller types, which results in incorrectly masked
1580 // args passed (callee may assume masked args, it does on ARM)
1581 if (!pp->is_oslib) {
1582 for (i = 0; i < pp->argc; i++) {
1583 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1584 if (ret && tmp_lmod != OPLM_DWORD)
1585 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1586 i + 1, pp->arg[i].type.name);
1591 static const char *check_label_read_ref(struct parsed_op *po,
1594 const struct parsed_proto *pp;
1596 pp = proto_parse(g_fhdr, name, 0);
1598 ferr(po, "proto_parse failed for ref '%s'\n", name);
1601 check_func_pp(po, pp, "ref");
1606 static char *out_src_opr(char *buf, size_t buf_size,
1607 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1610 char tmp1[256], tmp2[256];
1619 switch (popr->type) {
1622 ferr(po, "lea from reg?\n");
1624 switch (popr->lmod) {
1626 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1629 snprintf(buf, buf_size, "%s%s",
1630 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1633 if (popr->name[1] == 'h') // XXX..
1634 snprintf(buf, buf_size, "%s(%s >> 8)",
1635 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1637 snprintf(buf, buf_size, "%s%s",
1638 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1641 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1646 if (is_stack_access(po, popr)) {
1647 stack_frame_access(po, popr, buf, buf_size,
1648 popr->name, cast, 1, is_lea);
1652 strcpy(expr, popr->name);
1653 if (strchr(expr, '[')) {
1654 // special case: '[' can only be left for label[reg] form
1655 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1657 ferr(po, "parse failure for '%s'\n", expr);
1658 if (tmp1[0] == '(') {
1659 // (off_4FFF50+3)[eax]
1660 p = strchr(tmp1 + 1, ')');
1661 if (p == NULL || p[1] != 0)
1662 ferr(po, "parse failure (2) for '%s'\n", expr);
1664 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1666 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1669 // XXX: do we need more parsing?
1671 snprintf(buf, buf_size, "%s", expr);
1675 snprintf(buf, buf_size, "%s(%s)",
1676 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1680 name = check_label_read_ref(po, popr->name);
1681 if (cast[0] == 0 && popr->is_ptr)
1685 snprintf(buf, buf_size, "(u32)&%s", name);
1686 else if (popr->size_lt)
1687 snprintf(buf, buf_size, "%s%s%s%s", cast,
1688 lmod_cast_u_ptr(po, popr->lmod),
1689 popr->is_array ? "" : "&", name);
1691 snprintf(buf, buf_size, "%s%s%s", cast, name,
1692 popr->is_array ? "[0]" : "");
1696 name = check_label_read_ref(po, popr->name);
1700 ferr(po, "lea an offset?\n");
1701 snprintf(buf, buf_size, "%s&%s", cast, name);
1706 ferr(po, "lea from const?\n");
1708 printf_number(tmp1, sizeof(tmp1), popr->val);
1709 if (popr->val == 0 && strchr(cast, '*'))
1710 snprintf(buf, buf_size, "NULL");
1712 snprintf(buf, buf_size, "%s%s",
1713 simplify_cast_num(cast, popr->val), tmp1);
1717 ferr(po, "invalid src type: %d\n", popr->type);
1723 // note: may set is_ptr (we find that out late for ebp frame..)
1724 static char *out_dst_opr(char *buf, size_t buf_size,
1725 struct parsed_op *po, struct parsed_opr *popr)
1727 switch (popr->type) {
1729 switch (popr->lmod) {
1731 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1735 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1739 if (popr->name[1] == 'h') // XXX..
1740 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1742 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1745 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1750 if (is_stack_access(po, popr)) {
1751 stack_frame_access(po, popr, buf, buf_size,
1752 popr->name, "", 0, 0);
1756 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1759 if (popr->size_mismatch)
1760 snprintf(buf, buf_size, "%s%s%s",
1761 lmod_cast_u_ptr(po, popr->lmod),
1762 popr->is_array ? "" : "&", popr->name);
1764 snprintf(buf, buf_size, "%s%s", popr->name,
1765 popr->is_array ? "[0]" : "");
1769 ferr(po, "invalid dst type: %d\n", popr->type);
1775 static char *out_src_opr_u32(char *buf, size_t buf_size,
1776 struct parsed_op *po, struct parsed_opr *popr)
1778 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1781 static void out_test_for_cc(char *buf, size_t buf_size,
1782 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1783 enum opr_lenmod lmod, const char *expr)
1785 const char *cast, *scast;
1787 cast = lmod_cast_u(po, lmod);
1788 scast = lmod_cast_s(po, lmod);
1792 case PFO_BE: // CF=1||ZF=1; CF=0
1793 snprintf(buf, buf_size, "(%s%s %s 0)",
1794 cast, expr, is_inv ? "!=" : "==");
1798 case PFO_L: // SF!=OF; OF=0
1799 snprintf(buf, buf_size, "(%s%s %s 0)",
1800 scast, expr, is_inv ? ">=" : "<");
1803 case PFO_LE: // ZF=1||SF!=OF; OF=0
1804 snprintf(buf, buf_size, "(%s%s %s 0)",
1805 scast, expr, is_inv ? ">" : "<=");
1809 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1813 static void out_cmp_for_cc(char *buf, size_t buf_size,
1814 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1816 const char *cast, *scast, *cast_use;
1817 char buf1[256], buf2[256];
1818 enum opr_lenmod lmod;
1820 if (po->operand[0].lmod != po->operand[1].lmod)
1821 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1822 po->operand[0].lmod, po->operand[1].lmod);
1823 lmod = po->operand[0].lmod;
1825 cast = lmod_cast_u(po, lmod);
1826 scast = lmod_cast_s(po, lmod);
1842 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1845 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1846 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
1850 // note: must be unsigned compare
1851 snprintf(buf, buf_size, "(%s %s %s)",
1852 buf1, is_inv ? ">=" : "<", buf2);
1856 snprintf(buf, buf_size, "(%s %s %s)",
1857 buf1, is_inv ? "!=" : "==", buf2);
1861 // note: must be unsigned compare
1862 snprintf(buf, buf_size, "(%s %s %s)",
1863 buf1, is_inv ? ">" : "<=", buf2);
1866 if (is_inv && lmod == OPLM_BYTE
1867 && po->operand[1].type == OPT_CONST
1868 && po->operand[1].val == 0xff)
1870 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
1871 snprintf(buf, buf_size, "(0)");
1875 // note: must be signed compare
1877 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1878 scast, buf1, buf2, is_inv ? ">=" : "<");
1882 snprintf(buf, buf_size, "(%s %s %s)",
1883 buf1, is_inv ? ">=" : "<", buf2);
1887 snprintf(buf, buf_size, "(%s %s %s)",
1888 buf1, is_inv ? ">" : "<=", buf2);
1896 static void out_cmp_test(char *buf, size_t buf_size,
1897 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1899 char buf1[256], buf2[256], buf3[256];
1901 if (po->op == OP_TEST) {
1902 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1903 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1906 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1907 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1908 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1910 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1911 po->operand[0].lmod, buf3);
1913 else if (po->op == OP_CMP) {
1914 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
1917 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1920 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1921 struct parsed_opr *popr2)
1923 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1924 ferr(po, "missing lmod for both operands\n");
1926 if (popr1->lmod == OPLM_UNSPEC)
1927 popr1->lmod = popr2->lmod;
1928 else if (popr2->lmod == OPLM_UNSPEC)
1929 popr2->lmod = popr1->lmod;
1930 else if (popr1->lmod != popr2->lmod) {
1931 if (popr1->type_from_var) {
1932 popr1->size_mismatch = 1;
1933 if (popr1->lmod < popr2->lmod)
1935 popr1->lmod = popr2->lmod;
1937 else if (popr2->type_from_var) {
1938 popr2->size_mismatch = 1;
1939 if (popr2->lmod < popr1->lmod)
1941 popr2->lmod = popr1->lmod;
1944 ferr(po, "conflicting lmods: %d vs %d\n",
1945 popr1->lmod, popr2->lmod);
1949 static const char *op_to_c(struct parsed_op *po)
1973 ferr(po, "op_to_c was supplied with %d\n", po->op);
1977 static void op_set_clear_flag(struct parsed_op *po,
1978 enum op_flags flag_set, enum op_flags flag_clear)
1980 po->flags |= flag_set;
1981 po->flags &= ~flag_clear;
1984 // last op in stream - unconditional branch or ret
1985 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
1986 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
1987 && ops[_i].op != OP_CALL))
1989 static int scan_for_pop(int i, int opcnt, const char *reg,
1990 int magic, int depth, int *maxdepth, int do_flags)
1992 const struct parsed_proto *pp;
1993 struct parsed_op *po;
1997 for (; i < opcnt; i++) {
1999 if (po->cc_scratch == magic)
2000 break; // already checked
2001 po->cc_scratch = magic;
2003 if (po->flags & OPF_TAIL) {
2004 if (po->op == OP_CALL) {
2005 pp = proto_parse(g_fhdr, po->operand[0].name, 0);
2006 if (pp != NULL && pp->is_noreturn)
2007 // no stack cleanup for noreturn
2010 return -1; // deadend
2013 if ((po->flags & OPF_RMD)
2014 || (po->op == OP_PUSH && po->argnum != 0)) // arg push
2017 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2018 if (po->btj != NULL) {
2020 for (j = 0; j < po->btj->count; j++) {
2021 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
2022 depth, maxdepth, do_flags);
2024 return ret; // dead end
2030 ferr(po, "dead branch\n");
2034 if (po->flags & OPF_CJMP) {
2035 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2036 depth, maxdepth, do_flags);
2038 return ret; // dead end
2046 if ((po->op == OP_POP || po->op == OP_PUSH)
2047 && po->operand[0].type == OPT_REG
2048 && IS(po->operand[0].name, reg))
2050 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)) {
2052 if (depth > *maxdepth)
2055 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2057 else if (po->op == OP_POP) {
2060 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2065 if (depth < 0) // should not happen
2066 ferr(po, "fail with depth\n");
2068 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2077 // scan for pop starting from 'ret' op (all paths)
2078 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2084 for (; i < opcnt; i++) {
2085 if (!(ops[i].flags & OPF_TAIL))
2088 for (j = i - 1; j >= 0; j--) {
2089 if (ops[j].flags & OPF_RMD)
2091 if (ops[j].flags & OPF_JMP)
2094 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
2095 && IS(ops[j].operand[0].name, reg))
2098 ops[j].flags |= flag_set;
2102 if (g_labels[j][0] != 0)
2107 return found ? 0 : -1;
2110 static void scan_propagate_df(int i, int opcnt)
2112 struct parsed_op *po = &ops[i];
2115 for (; i < opcnt; i++) {
2117 if (po->flags & OPF_DF)
2118 return; // already resolved
2119 po->flags |= OPF_DF;
2121 if (po->op == OP_CALL)
2122 ferr(po, "call with DF set?\n");
2124 if (po->flags & OPF_JMP) {
2125 if (po->btj != NULL) {
2127 for (j = 0; j < po->btj->count; j++)
2128 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2133 ferr(po, "dead branch\n");
2137 if (po->flags & OPF_CJMP)
2138 scan_propagate_df(po->bt_i, opcnt);
2144 if (po->flags & OPF_TAIL)
2147 if (po->op == OP_CLD) {
2148 po->flags |= OPF_RMD;
2153 ferr(po, "missing DF clear?\n");
2156 // is operand 'opr' modified by parsed_op 'po'?
2157 static int is_opr_modified(const struct parsed_opr *opr,
2158 const struct parsed_op *po)
2162 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2165 if (opr->type == OPT_REG) {
2166 if (po->op == OP_CALL) {
2167 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2168 if ((1 << opr->reg) & mask)
2174 if (po->operand[0].type == OPT_REG) {
2175 if (po->regmask_dst & (1 << opr->reg))
2182 return IS(po->operand[0].name, opr->name);
2185 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2186 static int is_any_opr_modified(const struct parsed_op *po_test,
2187 const struct parsed_op *po, int c_mode)
2192 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2195 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2198 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2201 // in reality, it can wreck any register, but in decompiled C
2202 // version it can only overwrite eax or edx:eax
2203 mask = (1 << xAX) | (1 << xDX);
2207 if (po->op == OP_CALL
2208 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2211 for (i = 0; i < po_test->operand_cnt; i++)
2212 if (IS(po_test->operand[i].name, po->operand[0].name))
2218 // scan for any po_test operand modification in range given
2219 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2222 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2225 for (; i < opcnt; i++) {
2226 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2233 // scan for po_test operand[0] modification in range given
2234 static int scan_for_mod_opr0(struct parsed_op *po_test,
2237 for (; i < opcnt; i++) {
2238 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2245 static int scan_for_flag_set(int i, int magic, int *branched,
2246 int *setters, int *setter_cnt)
2248 struct label_ref *lr;
2252 if (ops[i].cc_scratch == magic) {
2253 ferr(&ops[i], "%s looped\n", __func__);
2256 ops[i].cc_scratch = magic;
2258 if (g_labels[i][0] != 0) {
2261 lr = &g_label_refs[i];
2262 for (; lr->next; lr = lr->next) {
2263 ret = scan_for_flag_set(lr->i, magic,
2264 branched, setters, setter_cnt);
2269 if (i > 0 && LAST_OP(i - 1)) {
2273 ret = scan_for_flag_set(lr->i, magic,
2274 branched, setters, setter_cnt);
2280 if (ops[i].flags & OPF_FLAGS) {
2281 setters[*setter_cnt] = i;
2286 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2293 // scan back for cdq, if anything modifies edx, fail
2294 static int scan_for_cdq_edx(int i)
2297 if (g_labels[i][0] != 0) {
2298 if (g_label_refs[i].next != NULL)
2300 if (i > 0 && LAST_OP(i - 1)) {
2301 i = g_label_refs[i].i;
2308 if (ops[i].op == OP_CDQ)
2311 if (ops[i].regmask_dst & (1 << xDX))
2318 static int scan_for_reg_clear(int i, int reg)
2321 if (g_labels[i][0] != 0) {
2322 if (g_label_refs[i].next != NULL)
2324 if (i > 0 && LAST_OP(i - 1)) {
2325 i = g_label_refs[i].i;
2332 if (ops[i].op == OP_XOR
2333 && ops[i].operand[0].lmod == OPLM_DWORD
2334 && ops[i].operand[0].reg == ops[i].operand[1].reg
2335 && ops[i].operand[0].reg == reg)
2338 if (ops[i].regmask_dst & (1 << reg))
2345 // scan for positive, constant esp adjust
2346 static int scan_for_esp_adjust(int i, int opcnt, int *adj,
2349 struct parsed_op *po;
2352 *adj = *multipath = 0;
2354 for (; i < opcnt; i++) {
2357 if (g_labels[i][0] != 0)
2360 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2361 if (po->operand[1].type != OPT_CONST)
2362 ferr(&ops[i], "non-const esp adjust?\n");
2363 *adj += po->operand[1].val;
2365 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2368 else if (po->op == OP_PUSH && !(po->flags & OPF_RMD)) {
2369 //if (first_pop == -1)
2370 // first_pop = -2; // none
2371 *adj -= lmod_bytes(po, po->operand[0].lmod);
2373 else if (po->op == OP_POP && !(po->flags & OPF_RMD)) {
2374 // seems like msvc only uses 'pop ecx' for stack realignment..
2375 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2377 if (first_pop == -1 && *adj >= 0)
2379 *adj += lmod_bytes(po, po->operand[0].lmod);
2381 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2382 if (po->op == OP_JMP && po->btj == NULL) {
2386 if (po->op != OP_CALL)
2388 if (po->operand[0].type != OPT_LABEL)
2390 if (po->pp != NULL && po->pp->is_stdcall)
2395 if (first_pop >= 0) {
2396 // probably 'pop ecx' was used..
2403 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2405 struct parsed_op *po;
2409 ferr(ops, "%s: followed bad branch?\n", __func__);
2411 for (; i < opcnt; i++) {
2413 if (po->cc_scratch == magic)
2415 po->cc_scratch = magic;
2418 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2419 if (po->btj != NULL) {
2421 for (j = 0; j < po->btj->count; j++)
2422 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2426 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2427 if (!(po->flags & OPF_CJMP))
2430 if (po->flags & OPF_TAIL)
2435 static const struct parsed_proto *try_recover_pp(
2436 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2438 const struct parsed_proto *pp = NULL;
2442 // maybe an arg of g_func?
2443 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2445 char ofs_reg[16] = { 0, };
2446 int arg, arg_s, arg_i;
2450 parse_stack_access(po, opr->name, ofs_reg,
2451 &offset, &stack_ra, NULL, 0);
2452 if (ofs_reg[0] != 0)
2453 ferr(po, "offset reg on arg access?\n");
2454 if (offset <= stack_ra) {
2455 // search who set the stack var instead
2456 if (search_instead != NULL)
2457 *search_instead = 1;
2461 arg_i = (offset - stack_ra - 4) / 4;
2462 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2463 if (g_func_pp->arg[arg].reg != NULL)
2469 if (arg == g_func_pp->argc)
2470 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2472 pp = g_func_pp->arg[arg].fptr;
2474 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2475 check_func_pp(po, pp, "icall arg");
2477 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2479 p = strchr(opr->name + 1, '[');
2480 memcpy(buf, opr->name, p - opr->name);
2481 buf[p - opr->name] = 0;
2482 pp = proto_parse(g_fhdr, buf, 0);
2484 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2485 pp = proto_parse(g_fhdr, opr->name, 0);
2487 ferr(po, "proto_parse failed for icall from '%s'\n", opr->name);
2488 check_func_pp(po, pp, "reg-fptr ref");
2494 static void scan_for_call_type(int i, const struct parsed_opr *opr,
2495 int magic, const struct parsed_proto **pp_found, int *multi)
2497 const struct parsed_proto *pp = NULL;
2498 struct parsed_op *po;
2499 struct label_ref *lr;
2501 ops[i].cc_scratch = magic;
2504 if (g_labels[i][0] != 0) {
2505 lr = &g_label_refs[i];
2506 for (; lr != NULL; lr = lr->next)
2507 scan_for_call_type(lr->i, opr, magic, pp_found, multi);
2508 if (i > 0 && LAST_OP(i - 1))
2516 if (ops[i].cc_scratch == magic)
2518 ops[i].cc_scratch = magic;
2520 if (!(ops[i].flags & OPF_DATA))
2522 if (!is_opr_modified(opr, &ops[i]))
2524 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2525 // most probably trashed by some processing
2530 opr = &ops[i].operand[1];
2531 if (opr->type != OPT_REG)
2535 po = (i >= 0) ? &ops[i] : ops;
2538 // reached the top - can only be an arg-reg
2539 if (opr->type != OPT_REG)
2542 for (i = 0; i < g_func_pp->argc; i++) {
2543 if (g_func_pp->arg[i].reg == NULL)
2545 if (IS(opr->name, g_func_pp->arg[i].reg))
2548 if (i == g_func_pp->argc)
2550 pp = g_func_pp->arg[i].fptr;
2552 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2553 i + 1, g_func_pp->arg[i].reg);
2554 check_func_pp(po, pp, "icall reg-arg");
2557 pp = try_recover_pp(po, opr, NULL);
2559 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2560 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2561 || (*pp_found)->is_stdcall != pp->is_stdcall
2562 || (*pp_found)->is_fptr != pp->is_fptr
2563 || (*pp_found)->argc != pp->argc
2564 || (*pp_found)->argc_reg != pp->argc_reg
2565 || (*pp_found)->argc_stack != pp->argc_stack)
2567 ferr(po, "icall: parsed_proto mismatch\n");
2575 static const struct parsed_proto *resolve_icall(int i, int opcnt,
2578 const struct parsed_proto *pp = NULL;
2579 int search_advice = 0;
2583 switch (ops[i].operand[0].type) {
2587 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
2592 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
2600 // find an instruction that changed opr before i op
2601 // *op_i must be set to -1
2602 static int resolve_origin(int i, const struct parsed_opr *opr,
2603 int magic, int *op_i)
2605 struct label_ref *lr;
2608 ops[i].cc_scratch = magic;
2611 if (g_labels[i][0] != 0) {
2612 lr = &g_label_refs[i];
2613 for (; lr != NULL; lr = lr->next)
2614 ret |= resolve_origin(lr->i, opr, magic, op_i);
2615 if (i > 0 && LAST_OP(i - 1))
2623 if (ops[i].cc_scratch == magic)
2625 ops[i].cc_scratch = magic;
2627 if (!(ops[i].flags & OPF_DATA))
2629 if (!is_opr_modified(opr, &ops[i]))
2635 // XXX: could check if the other op does the same
2644 static int try_resolve_const(int i, const struct parsed_opr *opr,
2645 int magic, unsigned int *val)
2650 ret = resolve_origin(i, opr, magic, &s_i);
2653 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
2656 *val = ops[i].operand[1].val;
2663 static int collect_call_args_r(struct parsed_op *po, int i,
2664 struct parsed_proto *pp, int *regmask, int *save_arg_vars, int arg,
2665 int magic, int need_op_saving, int may_reuse)
2667 struct parsed_proto *pp_tmp;
2668 struct label_ref *lr;
2669 int need_to_save_current;
2676 ferr(po, "dead label encountered\n");
2680 for (; arg < pp->argc; arg++)
2681 if (pp->arg[arg].reg == NULL)
2683 magic = (magic & 0xffffff) | (arg << 24);
2685 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
2687 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
2688 if (ops[j].cc_scratch != magic) {
2689 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
2693 // ok: have already been here
2696 ops[j].cc_scratch = magic;
2698 if (g_labels[j][0] != 0 && g_label_refs[j].i != -1) {
2699 lr = &g_label_refs[j];
2700 if (lr->next != NULL)
2702 for (; lr->next; lr = lr->next) {
2703 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2705 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2706 arg, magic, need_op_saving, may_reuse);
2711 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2713 if (j > 0 && LAST_OP(j - 1)) {
2714 // follow last branch in reverse
2719 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2720 arg, magic, need_op_saving, may_reuse);
2726 if (ops[j].op == OP_CALL)
2728 if (pp->is_unresolved)
2733 ferr(po, "arg collect hit unparsed call '%s'\n",
2734 ops[j].operand[0].name);
2735 if (may_reuse && pp_tmp->argc_stack > 0)
2736 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2737 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2739 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP) {
2740 if (pp->is_unresolved)
2743 ferr(po, "arg collect %d/%d hit esp adjust\n",
2746 else if (ops[j].op == OP_POP) {
2747 if (pp->is_unresolved)
2750 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2752 else if (ops[j].flags & OPF_CJMP)
2754 if (pp->is_unresolved)
2759 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2761 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
2764 pp->arg[arg].datap = &ops[j];
2765 need_to_save_current = 0;
2767 if (!need_op_saving) {
2768 ret = scan_for_mod(&ops[j], j + 1, i, 1);
2769 need_to_save_current = (ret >= 0);
2771 if (need_op_saving || need_to_save_current) {
2772 // mark this push as one that needs operand saving
2773 ops[j].flags &= ~OPF_RMD;
2774 if (ops[j].argnum == 0) {
2775 ops[j].argnum = arg + 1;
2776 save_args |= 1 << arg;
2778 else if (ops[j].argnum < arg + 1)
2779 ferr(&ops[j], "argnum conflict (%d<%d) for '%s'\n",
2780 ops[j].argnum, arg + 1, pp->name);
2782 else if (ops[j].argnum == 0)
2783 ops[j].flags |= OPF_RMD;
2785 // some PUSHes are reused by different calls on other branches,
2786 // but that can't happen if we didn't branch, so they
2787 // can be removed from future searches (handles nested calls)
2789 ops[j].flags |= OPF_FARG;
2791 ops[j].flags &= ~OPF_RSAVE;
2793 // check for __VALIST
2794 if (!pp->is_unresolved && g_func_pp->is_vararg
2795 && IS(pp->arg[arg].type.name, "__VALIST"))
2797 snprintf(buf, sizeof(buf), "arg_%X",
2798 g_func_pp->argc_stack * 4);
2800 ret = resolve_origin(j, &ops[j].operand[0], magic + 1, &k);
2801 if (ret == 1 && k >= 0 && ops[k].op == OP_LEA
2802 && strstr(ops[k].operand[1].name, buf))
2804 ops[k].flags |= OPF_RMD;
2805 ops[j].flags |= OPF_RMD | OPF_VAPUSH;
2806 save_args &= ~(1 << arg);
2810 *save_arg_vars |= save_args;
2812 // tracking reg usage
2813 if (!(ops[j].flags & OPF_VAPUSH)
2814 && ops[j].operand[0].type == OPT_REG)
2816 *regmask |= 1 << ops[j].operand[0].reg;
2820 if (!pp->is_unresolved) {
2822 for (; arg < pp->argc; arg++)
2823 if (pp->arg[arg].reg == NULL)
2826 magic = (magic & 0xffffff) | (arg << 24);
2830 if (arg < pp->argc) {
2831 ferr(po, "arg collect failed for '%s': %d/%d\n",
2832 pp->name, arg, pp->argc);
2839 static int collect_call_args(struct parsed_op *po, int i,
2840 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
2846 ret = collect_call_args_r(po, i, pp, regmask, save_arg_vars,
2851 if (pp->is_unresolved) {
2853 pp->argc_stack += ret;
2854 for (a = 0; a < pp->argc; a++)
2855 if (pp->arg[a].type.name == NULL)
2856 pp->arg[a].type.name = strdup("int");
2862 // early check for tail call or branch back
2863 static int is_like_tailjmp(int j)
2865 if (!(ops[j].flags & OPF_JMP))
2868 if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds)
2869 // probably local branch back..
2871 if (ops[j].op == OP_CALL)
2872 // probably noreturn call..
2878 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
2882 for (i = 0; i < pp->argc; i++)
2883 if (pp->arg[i].reg == NULL)
2887 memmove(&pp->arg[i + 1], &pp->arg[i],
2888 sizeof(pp->arg[0]) * pp->argc_stack);
2889 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
2890 pp->arg[i].reg = strdup(reg);
2891 pp->arg[i].type.name = strdup("int");
2896 static void add_label_ref(struct label_ref *lr, int op_i)
2898 struct label_ref *lr_new;
2905 lr_new = calloc(1, sizeof(*lr_new));
2907 lr_new->next = lr->next;
2911 static void output_std_flags(FILE *fout, struct parsed_op *po,
2912 int *pfomask, const char *dst_opr_text)
2914 if (*pfomask & (1 << PFO_Z)) {
2915 fprintf(fout, "\n cond_z = (%s%s == 0);",
2916 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
2917 *pfomask &= ~(1 << PFO_Z);
2919 if (*pfomask & (1 << PFO_S)) {
2920 fprintf(fout, "\n cond_s = (%s%s < 0);",
2921 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
2922 *pfomask &= ~(1 << PFO_S);
2926 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
2929 if (pp->is_fastcall)
2930 fprintf(fout, "__fastcall ");
2931 else if (pp->is_stdcall && pp->argc_reg == 0)
2932 fprintf(fout, "__stdcall ");
2933 if (pp->is_noreturn || is_noreturn)
2934 fprintf(fout, "noreturn ");
2937 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
2939 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
2940 struct parsed_opr *last_arith_dst = NULL;
2941 char buf1[256], buf2[256], buf3[256], cast[64];
2942 const struct parsed_proto *pp_c;
2943 struct parsed_proto *pp, *pp_tmp;
2944 struct parsed_data *pd;
2945 const char *tmpname;
2947 int save_arg_vars = 0;
2949 int need_tmp_var = 0;
2952 int label_pending = 0;
2953 int regmask_save = 0;
2954 int regmask_arg = 0;
2955 int regmask_now = 0;
2956 int regmask_init = 0;
2967 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
2968 g_stack_frame_used = 0;
2970 g_func_pp = proto_parse(fhdr, funcn, 0);
2971 if (g_func_pp == NULL)
2972 ferr(ops, "proto_parse failed for '%s'\n", funcn);
2974 for (i = 0; i < g_func_pp->argc; i++) {
2975 if (g_func_pp->arg[i].reg != NULL) {
2976 reg = char_array_i(regs_r32,
2977 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
2979 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
2980 regmask_arg |= 1 << reg;
2985 // - handle ebp/esp frame, remove ops related to it
2986 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2987 && ops[1].op == OP_MOV
2988 && IS(opr_name(&ops[1], 0), "ebp")
2989 && IS(opr_name(&ops[1], 1), "esp"))
2994 ops[0].flags |= OPF_RMD;
2995 ops[1].flags |= OPF_RMD;
2998 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2999 g_stack_fsz = opr_const(&ops[2], 1);
3000 ops[2].flags |= OPF_RMD;
3004 // another way msvc builds stack frame..
3006 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3008 ops[i].flags |= OPF_RMD;
3012 // and another way..
3013 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3014 && ops[i].operand[1].type == OPT_CONST
3015 && ops[i + 1].op == OP_CALL
3016 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3018 g_stack_fsz += ops[i].operand[1].val;
3019 ops[i].flags |= OPF_RMD;
3021 ops[i].flags |= OPF_RMD;
3028 for (; i < opcnt; i++)
3029 if (ops[i].op == OP_RET)
3032 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3033 if (found && is_like_tailjmp(j))
3038 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3039 || ops[j].op == OP_LEAVE)
3041 ops[j].flags |= OPF_RMD;
3043 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3044 ferr(&ops[j], "'pop ebp' expected\n");
3046 if (g_stack_fsz != 0) {
3047 if (ops[j - 1].op == OP_MOV
3048 && IS(opr_name(&ops[j - 1], 0), "esp")
3049 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3051 ops[j - 1].flags |= OPF_RMD;
3053 else if (ops[j].op != OP_LEAVE
3054 && !(g_ida_func_attr & IDAFA_NORETURN))
3056 ferr(&ops[j - 1], "esp restore expected\n");
3059 if (ecx_push && ops[j - 2].op == OP_POP
3060 && IS(opr_name(&ops[j - 2], 0), "ecx"))
3062 ferr(&ops[j - 2], "unexpected ecx pop\n");
3068 } while (i < opcnt);
3071 for (i = 0; i < opcnt; i++) {
3072 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3074 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3075 && ops[i].operand[1].type == OPT_CONST)
3085 g_stack_fsz = ops[i].operand[1].val;
3086 ops[i].flags |= OPF_RMD;
3090 for (; i < opcnt; i++)
3091 if (ops[i].op == OP_RET)
3094 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3095 if (found && is_like_tailjmp(j))
3100 if (ops[j].op != OP_ADD
3101 || !IS(opr_name(&ops[j], 0), "esp")
3102 || ops[j].operand[1].type != OPT_CONST
3103 || ops[j].operand[1].val != g_stack_fsz)
3104 ferr(&ops[j], "'add esp' expected\n");
3105 ops[j].flags |= OPF_RMD;
3109 } while (i < opcnt);
3114 // - parse calls with labels
3115 // - resolve all branches
3116 for (i = 0; i < opcnt; i++)
3122 if (po->flags & OPF_RMD)
3125 if (po->op == OP_CALL) {
3128 if (po->operand[0].type == OPT_LABEL) {
3129 tmpname = opr_name(po, 0);
3130 if (IS_START(tmpname, "loc_"))
3131 ferr(po, "call to loc_*\n");
3132 pp_c = proto_parse(fhdr, tmpname, 0);
3134 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3136 pp = proto_clone(pp_c);
3137 my_assert_not(pp, NULL);
3139 else if (po->datap != NULL) {
3140 pp = calloc(1, sizeof(*pp));
3141 my_assert_not(pp, NULL);
3143 ret = parse_protostr(po->datap, pp);
3145 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3152 check_func_pp(po, pp, "fptr var call");
3153 if (pp->is_noreturn)
3154 po->flags |= OPF_TAIL;
3160 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3163 if (po->operand[0].type == OPT_REGMEM) {
3164 char *p = strchr(po->operand[0].name, '[');
3167 ret = p - po->operand[0].name;
3168 strncpy(buf1, po->operand[0].name, ret);
3171 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3172 if (IS(g_func_pd[j].label, buf1)) {
3178 //ferr(po, "label '%s' not parsed?\n", buf1);
3180 if (pd->type != OPT_OFFSET)
3181 ferr(po, "label '%s' with non-offset data?\n", buf1);
3183 // find all labels, link
3184 for (j = 0; j < pd->count; j++) {
3185 for (l = 0; l < opcnt; l++) {
3186 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
3187 add_label_ref(&g_label_refs[l], i);
3198 for (l = 0; l < opcnt; l++) {
3199 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
3200 if (l == i + 1 && po->op == OP_JMP) {
3201 // yet another alignment type..
3202 po->flags |= OPF_RMD;
3205 add_label_ref(&g_label_refs[l], i);
3211 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3214 if (po->operand[0].type == OPT_LABEL)
3218 ferr(po, "unhandled branch\n");
3222 po->flags |= OPF_TAIL;
3223 if (i > 0 && ops[i - 1].op == OP_POP)
3224 po->flags |= OPF_ATAIL;
3229 // - remove dead labels
3231 for (i = 0; i < opcnt; i++)
3233 if (g_labels[i][0] != 0 && g_label_refs[i].i == -1)
3237 if (po->flags & OPF_RMD)
3240 if (po->op == OP_CALL)
3242 tmpname = opr_name(po, 0);
3247 pp_c = resolve_icall(i, opcnt, &l);
3249 if (!pp_c->is_func && !pp_c->is_fptr)
3250 ferr(po, "call to non-func: %s\n", pp_c->name);
3251 pp = proto_clone(pp_c);
3252 my_assert_not(pp, NULL);
3254 // not resolved just to single func
3257 switch (po->operand[0].type) {
3259 // we resolved this call and no longer need the register
3260 po->regmask_src &= ~(1 << po->operand[0].reg);
3270 pp = calloc(1, sizeof(*pp));
3271 my_assert_not(pp, NULL);
3273 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3275 if (!g_allow_regfunc)
3276 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3277 pp->is_unresolved = 1;
3281 if (j > ARRAY_SIZE(pp->arg))
3282 ferr(po, "esp adjust too large: %d\n", j);
3283 pp->ret_type.name = strdup("int");
3284 pp->argc = pp->argc_stack = j;
3285 for (arg = 0; arg < pp->argc; arg++)
3286 pp->arg[arg].type.name = strdup("int");
3291 // look for and make use of esp adjust
3293 if (!pp->is_stdcall && pp->argc_stack > 0)
3294 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3296 if (pp->is_vararg) {
3297 if (j / 4 < pp->argc_stack)
3298 ferr(po, "esp adjust is too small: %x < %x\n",
3299 j, pp->argc_stack * 4);
3300 // modify pp to make it have varargs as normal args
3302 pp->argc += j / 4 - pp->argc_stack;
3303 for (; arg < pp->argc; arg++) {
3304 pp->arg[arg].type.name = strdup("int");
3307 if (pp->argc > ARRAY_SIZE(pp->arg))
3308 ferr(po, "too many args for '%s'\n", tmpname);
3310 if (pp->argc_stack != j / 4)
3311 ferr(po, "stack tracking failed for '%s': %x %x\n",
3312 tmpname, pp->argc_stack * 4, j);
3314 ops[ret].flags |= OPF_RMD;
3315 if (ops[ret].op == OP_POP && j > 4) {
3316 // deal with multi-pop stack adjust
3318 while (ops[ret].op == OP_POP && j > 0 && ret < opcnt) {
3319 ops[ret].flags |= OPF_RMD;
3325 // a bit of a hack, but deals with use of
3326 // single adj for multiple calls
3327 ops[ret].operand[1].val -= j;
3330 else if (pp->is_vararg)
3331 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3334 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
3335 // since we know the args, collect them
3336 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3340 if (strstr(pp->ret_type.name, "int64"))
3346 // - find POPs for PUSHes, rm both
3347 // - scan for STD/CLD, propagate DF
3348 // - scan for all used registers
3349 // - find flag set ops for their users
3350 // - do unreselved calls
3351 // - declare indirect functions
3352 for (i = 0; i < opcnt; i++) {
3354 if (po->flags & OPF_RMD)
3357 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
3358 reg = po->operand[0].reg;
3359 if (!(regmask & (1 << reg)))
3360 // not a reg save after all, rerun scan_for_pop
3361 po->flags &= ~OPF_RSAVE;
3363 regmask_save |= 1 << reg;
3366 if (po->op == OP_PUSH && po->argnum == 0
3367 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
3369 if (po->operand[0].type == OPT_REG)
3371 reg = po->operand[0].reg;
3373 ferr(po, "reg not set for push?\n");
3376 ret = scan_for_pop(i + 1, opcnt,
3377 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
3380 ferr(po, "too much depth: %d\n", depth);
3382 po->flags |= OPF_RMD;
3383 scan_for_pop(i + 1, opcnt, po->operand[0].name,
3384 i + opcnt * 4, 0, &depth, 1);
3387 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
3390 if (regmask & (1 << reg)) {
3391 if (regmask_save & (1 << reg))
3392 ferr(po, "%s already saved?\n", po->operand[0].name);
3396 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
3400 else if (po->operand[0].type == OPT_CONST) {
3401 for (j = i + 1; j < opcnt; j++) {
3402 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
3403 || ops[j].op == OP_PUSH || g_labels[i][0] != 0)
3408 if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP)
3410 po->flags |= OPF_RMD;
3418 if (po->op == OP_STD) {
3419 po->flags |= OPF_DF | OPF_RMD;
3420 scan_propagate_df(i + 1, opcnt);
3423 regmask_now = po->regmask_src | po->regmask_dst;
3424 if (regmask_now & (1 << xBP)) {
3425 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
3426 if (po->regmask_dst & (1 << xBP))
3427 // compiler decided to drop bp frame and use ebp as scratch
3428 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
3430 regmask_now &= ~(1 << xBP);
3434 regmask |= regmask_now;
3436 if (po->flags & OPF_CC)
3438 int setters[16], cnt = 0, branched = 0;
3440 ret = scan_for_flag_set(i, i + opcnt * 6,
3441 &branched, setters, &cnt);
3442 if (ret < 0 || cnt <= 0)
3443 ferr(po, "unable to trace flag setter(s)\n");
3444 if (cnt > ARRAY_SIZE(setters))
3445 ferr(po, "too many flag setters\n");
3447 for (j = 0; j < cnt; j++)
3449 tmp_op = &ops[setters[j]]; // flag setter
3452 // to get nicer code, we try to delay test and cmp;
3453 // if we can't because of operand modification, or if we
3454 // have arith op, or branch, make it calculate flags explicitly
3455 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
3457 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
3458 pfomask = 1 << po->pfo;
3460 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
3461 pfomask = 1 << po->pfo;
3464 // see if we'll be able to handle based on op result
3465 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
3466 && po->pfo != PFO_Z && po->pfo != PFO_S
3467 && po->pfo != PFO_P)
3469 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
3471 pfomask = 1 << po->pfo;
3474 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
3475 propagate_lmod(tmp_op, &tmp_op->operand[0],
3476 &tmp_op->operand[1]);
3477 if (tmp_op->operand[0].lmod == OPLM_DWORD)
3482 tmp_op->pfomask |= pfomask;
3483 cond_vars |= pfomask;
3485 // note: may overwrite, currently not a problem
3489 if (po->op == OP_RCL || po->op == OP_RCR
3490 || po->op == OP_ADC || po->op == OP_SBB)
3491 cond_vars |= 1 << PFO_C;
3494 if (po->op == OP_CMPS || po->op == OP_SCAS) {
3495 cond_vars |= 1 << PFO_Z;
3497 else if (po->op == OP_MUL
3498 || (po->op == OP_IMUL && po->operand_cnt == 1))
3500 if (po->operand[0].lmod == OPLM_DWORD)
3503 else if (po->op == OP_CALL) {
3506 ferr(po, "NULL pp\n");
3508 if (pp->is_unresolved) {
3509 int regmask_stack = 0;
3510 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3513 // this is pretty rough guess:
3514 // see ecx and edx were pushed (and not their saved versions)
3515 for (arg = 0; arg < pp->argc; arg++) {
3516 if (pp->arg[arg].reg != NULL)
3519 tmp_op = pp->arg[arg].datap;
3521 ferr(po, "parsed_op missing for arg%d\n", arg);
3522 if (tmp_op->argnum == 0 && tmp_op->operand[0].type == OPT_REG)
3523 regmask_stack |= 1 << tmp_op->operand[0].reg;
3526 if (!((regmask_stack & (1 << xCX))
3527 && (regmask_stack & (1 << xDX))))
3529 if (pp->argc_stack != 0
3530 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
3532 pp_insert_reg_arg(pp, "ecx");
3533 pp->is_fastcall = 1;
3534 regmask_init |= 1 << xCX;
3535 regmask |= 1 << xCX;
3537 if (pp->argc_stack != 0
3538 || ((regmask | regmask_arg) & (1 << xDX)))
3540 pp_insert_reg_arg(pp, "edx");
3541 regmask_init |= 1 << xDX;
3542 regmask |= 1 << xDX;
3546 // note: __cdecl doesn't fall into is_unresolved category
3547 if (pp->argc_stack > 0)
3551 for (arg = 0; arg < pp->argc; arg++) {
3552 if (pp->arg[arg].reg != NULL) {
3553 reg = char_array_i(regs_r32,
3554 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
3556 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
3557 if (!(regmask & (1 << reg))) {
3558 regmask_init |= 1 << reg;
3559 regmask |= 1 << reg;
3564 else if (po->op == OP_MOV && po->operand[0].pp != NULL
3565 && po->operand[1].pp != NULL)
3567 // <var> = offset <something>
3568 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
3569 && !IS_START(po->operand[1].name, "off_"))
3571 if (!po->operand[0].pp->is_fptr)
3572 ferr(po, "%s not declared as fptr when it should be\n",
3573 po->operand[0].name);
3574 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
3575 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
3576 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
3577 fnote(po, "var: %s\n", buf1);
3578 fnote(po, "func: %s\n", buf2);
3579 ferr(po, "^ mismatch\n");
3583 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
3584 regmask |= 1 << xAX;
3585 else if (po->op == OP_DIV || po->op == OP_IDIV) {
3586 // 32bit division is common, look for it
3587 if (po->op == OP_DIV)
3588 ret = scan_for_reg_clear(i, xDX);
3590 ret = scan_for_cdq_edx(i);
3592 po->flags |= OPF_32BIT;
3596 else if (po->op == OP_CLD)
3597 po->flags |= OPF_RMD;
3599 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
3605 // - confirm regmask_save, it might have been reduced
3606 if (regmask_save != 0)
3609 for (i = 0; i < opcnt; i++) {
3611 if (po->flags & OPF_RMD)
3614 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
3615 regmask_save |= 1 << po->operand[0].reg;
3619 // output starts here
3621 // define userstack size
3622 if (g_func_pp->is_userstack) {
3623 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
3624 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
3625 fprintf(fout, "#endif\n");
3628 // the function itself
3629 fprintf(fout, "%s ", g_func_pp->ret_type.name);
3630 output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN);
3631 fprintf(fout, "%s(", g_func_pp->name);
3633 for (i = 0; i < g_func_pp->argc; i++) {
3635 fprintf(fout, ", ");
3636 if (g_func_pp->arg[i].fptr != NULL) {
3638 pp = g_func_pp->arg[i].fptr;
3639 fprintf(fout, "%s (", pp->ret_type.name);
3640 output_pp_attrs(fout, pp, 0);
3641 fprintf(fout, "*a%d)(", i + 1);
3642 for (j = 0; j < pp->argc; j++) {
3644 fprintf(fout, ", ");
3645 if (pp->arg[j].fptr)
3646 ferr(ops, "nested fptr\n");
3647 fprintf(fout, "%s", pp->arg[j].type.name);
3649 if (pp->is_vararg) {
3651 fprintf(fout, ", ");
3652 fprintf(fout, "...");
3656 else if (g_func_pp->arg[i].type.is_retreg) {
3657 fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg);
3660 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
3663 if (g_func_pp->is_vararg) {
3665 fprintf(fout, ", ");
3666 fprintf(fout, "...");
3669 fprintf(fout, ")\n{\n");
3671 // declare indirect functions
3672 for (i = 0; i < opcnt; i++) {
3674 if (po->flags & OPF_RMD)
3677 if (po->op == OP_CALL) {
3680 ferr(po, "NULL pp\n");
3682 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
3683 if (pp->name[0] != 0) {
3684 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
3685 memcpy(pp->name, "i_", 2);
3687 // might be declared already
3689 for (j = 0; j < i; j++) {
3690 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
3691 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
3701 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
3703 fprintf(fout, " %s (", pp->ret_type.name);
3704 output_pp_attrs(fout, pp, 0);
3705 fprintf(fout, "*%s)(", pp->name);
3706 for (j = 0; j < pp->argc; j++) {
3708 fprintf(fout, ", ");
3709 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
3711 fprintf(fout, ");\n");
3716 // output LUTs/jumptables
3717 for (i = 0; i < g_func_pd_cnt; i++) {
3719 fprintf(fout, " static const ");
3720 if (pd->type == OPT_OFFSET) {
3721 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
3723 for (j = 0; j < pd->count; j++) {
3725 fprintf(fout, ", ");
3726 fprintf(fout, "&&%s", pd->d[j].u.label);
3730 fprintf(fout, "%s %s[] =\n { ",
3731 lmod_type_u(ops, pd->lmod), pd->label);
3733 for (j = 0; j < pd->count; j++) {
3735 fprintf(fout, ", ");
3736 fprintf(fout, "%u", pd->d[j].u.val);
3739 fprintf(fout, " };\n");
3743 // declare stack frame, va_arg
3745 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
3746 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
3750 if (g_func_pp->is_userstack) {
3751 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
3752 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
3756 if (g_func_pp->is_vararg) {
3757 fprintf(fout, " va_list ap;\n");
3761 // declare arg-registers
3762 for (i = 0; i < g_func_pp->argc; i++) {
3763 if (g_func_pp->arg[i].reg != NULL) {
3764 reg = char_array_i(regs_r32,
3765 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
3766 if (regmask & (1 << reg)) {
3767 if (g_func_pp->arg[i].type.is_retreg)
3768 fprintf(fout, " u32 %s = *r_%s;\n",
3769 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
3771 fprintf(fout, " u32 %s = (u32)a%d;\n",
3772 g_func_pp->arg[i].reg, i + 1);
3775 if (g_func_pp->arg[i].type.is_retreg)
3776 ferr(ops, "retreg '%s' is unused?\n",
3777 g_func_pp->arg[i].reg);
3778 fprintf(fout, " // %s = a%d; // unused\n",
3779 g_func_pp->arg[i].reg, i + 1);
3785 regmask_now = regmask & ~regmask_arg;
3786 regmask_now &= ~(1 << xSP);
3788 for (reg = 0; reg < 8; reg++) {
3789 if (regmask_now & (1 << reg)) {
3790 fprintf(fout, " u32 %s", regs_r32[reg]);
3791 if (regmask_init & (1 << reg))
3792 fprintf(fout, " = 0");
3793 fprintf(fout, ";\n");
3800 for (reg = 0; reg < 8; reg++) {
3801 if (regmask_save & (1 << reg)) {
3802 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
3808 if (save_arg_vars) {
3809 for (reg = 0; reg < 32; reg++) {
3810 if (save_arg_vars & (1 << reg)) {
3811 fprintf(fout, " u32 s_a%d;\n", reg + 1);
3818 for (i = 0; i < 8; i++) {
3819 if (cond_vars & (1 << i)) {
3820 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
3827 fprintf(fout, " u32 tmp;\n");
3832 fprintf(fout, " u64 tmp64;\n");
3837 fprintf(fout, "\n");
3839 if (g_func_pp->is_vararg) {
3840 if (g_func_pp->argc_stack == 0)
3841 ferr(ops, "vararg func without stack args?\n");
3842 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
3846 for (i = 0; i < opcnt; i++)
3848 if (g_labels[i][0] != 0) {
3849 fprintf(fout, "\n%s:\n", g_labels[i]);
3852 delayed_flag_op = NULL;
3853 last_arith_dst = NULL;
3857 if (po->flags & OPF_RMD)
3862 #define assert_operand_cnt(n_) \
3863 if (po->operand_cnt != n_) \
3864 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
3866 // conditional/flag using op?
3867 if (po->flags & OPF_CC)
3873 // we go through all this trouble to avoid using parsed_flag_op,
3874 // which makes generated code much nicer
3875 if (delayed_flag_op != NULL)
3877 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
3878 po->pfo, po->pfo_inv);
3881 else if (last_arith_dst != NULL
3882 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
3883 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
3886 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
3887 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
3888 last_arith_dst->lmod, buf3);
3891 else if (tmp_op != NULL) {
3892 // use preprocessed flag calc results
3893 if (!(tmp_op->pfomask & (1 << po->pfo)))
3894 ferr(po, "not prepared for pfo %d\n", po->pfo);
3896 // note: pfo_inv was not yet applied
3897 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
3898 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
3901 ferr(po, "all methods of finding comparison failed\n");
3904 if (po->flags & OPF_JMP) {
3905 fprintf(fout, " if %s", buf1);
3907 else if (po->op == OP_RCL || po->op == OP_RCR
3908 || po->op == OP_ADC || po->op == OP_SBB)
3911 fprintf(fout, " cond_%s = %s;\n",
3912 parsed_flag_op_names[po->pfo], buf1);
3914 else if (po->flags & OPF_DATA) { // SETcc
3915 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
3916 fprintf(fout, " %s = %s;", buf2, buf1);
3919 ferr(po, "unhandled conditional op\n");
3923 pfomask = po->pfomask;
3925 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
3926 struct parsed_opr opr = {0,};
3929 opr.lmod = OPLM_DWORD;
3930 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
3932 if (ret != 1 || uval == 0) {
3933 // we need initial flags for ecx=0 case..
3934 if (i > 0 && ops[i - 1].op == OP_XOR
3935 && IS(ops[i - 1].operand[0].name,
3936 ops[i - 1].operand[1].name))
3938 fprintf(fout, " cond_z = ");
3939 if (pfomask & (1 << PFO_C))
3940 fprintf(fout, "cond_c = ");
3941 fprintf(fout, "0;\n");
3943 else if (last_arith_dst != NULL) {
3944 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
3945 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
3946 last_arith_dst->lmod, buf3);
3947 fprintf(fout, " cond_z = %s;\n", buf1);
3950 ferr(po, "missing initial ZF\n");
3957 assert_operand_cnt(2);
3958 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3959 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3960 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
3961 fprintf(fout, " %s = %s;", buf1,
3962 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3967 assert_operand_cnt(2);
3968 po->operand[1].lmod = OPLM_DWORD; // always
3969 fprintf(fout, " %s = %s;",
3970 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3971 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3976 assert_operand_cnt(2);
3977 fprintf(fout, " %s = %s;",
3978 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3979 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3983 assert_operand_cnt(2);
3984 switch (po->operand[1].lmod) {
3986 strcpy(buf3, "(s8)");
3989 strcpy(buf3, "(s16)");
3992 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
3994 fprintf(fout, " %s = %s;",
3995 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3996 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4001 assert_operand_cnt(2);
4002 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4003 fprintf(fout, " tmp = %s;",
4004 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
4005 fprintf(fout, " %s = %s;",
4006 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4007 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4008 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4009 fprintf(fout, " %s = %stmp;",
4010 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
4011 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
4012 snprintf(g_comment, sizeof(g_comment), "xchg");
4016 assert_operand_cnt(1);
4017 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4018 fprintf(fout, " %s = ~%s;", buf1, buf1);
4022 assert_operand_cnt(2);
4023 fprintf(fout, " %s = (s32)%s >> 31;",
4024 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4025 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4026 strcpy(g_comment, "cdq");
4030 assert_operand_cnt(3);
4031 if (po->flags & OPF_REP) {
4036 fprintf(fout, " eax = %sesi; esi %c= %d;",
4037 lmod_cast_u_ptr(po, po->operand[0].lmod),
4038 (po->flags & OPF_DF) ? '-' : '+',
4039 lmod_bytes(po, po->operand[0].lmod));
4040 strcpy(g_comment, "lods");
4045 assert_operand_cnt(3);
4046 if (po->flags & OPF_REP) {
4047 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
4048 (po->flags & OPF_DF) ? '-' : '+',
4049 lmod_bytes(po, po->operand[0].lmod));
4050 fprintf(fout, " %sedi = eax;",
4051 lmod_cast_u_ptr(po, po->operand[0].lmod));
4052 strcpy(g_comment, "rep stos");
4055 fprintf(fout, " %sedi = eax; edi %c= %d;",
4056 lmod_cast_u_ptr(po, po->operand[0].lmod),
4057 (po->flags & OPF_DF) ? '-' : '+',
4058 lmod_bytes(po, po->operand[0].lmod));
4059 strcpy(g_comment, "stos");
4064 assert_operand_cnt(3);
4065 j = lmod_bytes(po, po->operand[0].lmod);
4066 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4067 l = (po->flags & OPF_DF) ? '-' : '+';
4068 if (po->flags & OPF_REP) {
4070 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
4073 " %sedi = %sesi;", buf1, buf1);
4074 strcpy(g_comment, "rep movs");
4077 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
4078 buf1, buf1, l, j, l, j);
4079 strcpy(g_comment, "movs");
4084 // repe ~ repeat while ZF=1
4085 assert_operand_cnt(3);
4086 j = lmod_bytes(po, po->operand[0].lmod);
4087 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4088 l = (po->flags & OPF_DF) ? '-' : '+';
4089 if (po->flags & OPF_REP) {
4091 " for (; ecx != 0; ecx--) {\n");
4092 if (pfomask & (1 << PFO_C)) {
4095 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4096 pfomask &= ~(1 << PFO_C);
4099 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4100 buf1, buf1, l, j, l, j);
4102 " if (cond_z %s 0) break;\n",
4103 (po->flags & OPF_REPZ) ? "==" : "!=");
4106 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4107 (po->flags & OPF_REPZ) ? "e" : "ne");
4111 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4112 buf1, buf1, l, j, l, j);
4113 strcpy(g_comment, "cmps");
4115 pfomask &= ~(1 << PFO_Z);
4116 last_arith_dst = NULL;
4117 delayed_flag_op = NULL;
4121 // only does ZF (for now)
4122 // repe ~ repeat while ZF=1
4123 assert_operand_cnt(3);
4124 j = lmod_bytes(po, po->operand[0].lmod);
4125 l = (po->flags & OPF_DF) ? '-' : '+';
4126 if (po->flags & OPF_REP) {
4128 " for (; ecx != 0; ecx--) {\n");
4130 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4131 lmod_cast_u(po, po->operand[0].lmod),
4132 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4134 " if (cond_z %s 0) break;\n",
4135 (po->flags & OPF_REPZ) ? "==" : "!=");
4138 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4139 (po->flags & OPF_REPZ) ? "e" : "ne");
4142 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4143 lmod_cast_u(po, po->operand[0].lmod),
4144 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4145 strcpy(g_comment, "scas");
4147 pfomask &= ~(1 << PFO_Z);
4148 last_arith_dst = NULL;
4149 delayed_flag_op = NULL;
4152 // arithmetic w/flags
4155 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4158 assert_operand_cnt(2);
4159 fprintf(fout, " %s %s= %s;",
4160 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4162 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4163 output_std_flags(fout, po, &pfomask, buf1);
4164 last_arith_dst = &po->operand[0];
4165 delayed_flag_op = NULL;
4170 assert_operand_cnt(2);
4171 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4172 if (pfomask & (1 << PFO_C)) {
4173 if (po->operand[1].type == OPT_CONST) {
4174 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4175 j = po->operand[1].val;
4178 if (po->op == OP_SHL)
4182 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
4186 ferr(po, "zero shift?\n");
4190 pfomask &= ~(1 << PFO_C);
4192 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
4193 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4194 output_std_flags(fout, po, &pfomask, buf1);
4195 last_arith_dst = &po->operand[0];
4196 delayed_flag_op = NULL;
4200 assert_operand_cnt(2);
4201 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4202 fprintf(fout, " %s = %s%s >> %s;", buf1,
4203 lmod_cast_s(po, po->operand[0].lmod), buf1,
4204 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4205 output_std_flags(fout, po, &pfomask, buf1);
4206 last_arith_dst = &po->operand[0];
4207 delayed_flag_op = NULL;
4212 assert_operand_cnt(2);
4213 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4214 if (po->operand[1].type == OPT_CONST) {
4215 j = po->operand[1].val;
4216 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
4217 fprintf(fout, po->op == OP_ROL ?
4218 " %s = (%s << %d) | (%s >> %d);" :
4219 " %s = (%s >> %d) | (%s << %d);",
4220 buf1, buf1, j, buf1,
4221 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
4225 output_std_flags(fout, po, &pfomask, buf1);
4226 last_arith_dst = &po->operand[0];
4227 delayed_flag_op = NULL;
4232 assert_operand_cnt(2);
4233 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4234 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4235 if (po->operand[1].type == OPT_CONST) {
4236 j = po->operand[1].val % l;
4238 ferr(po, "zero rotate\n");
4239 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
4240 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
4241 if (po->op == OP_RCL) {
4243 " %s = (%s << %d) | (cond_c << %d)",
4244 buf1, buf1, j, j - 1);
4246 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
4250 " %s = (%s >> %d) | (cond_c << %d)",
4251 buf1, buf1, j, l - j);
4253 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
4255 fprintf(fout, ";\n");
4256 fprintf(fout, " cond_c = tmp;");
4260 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
4261 output_std_flags(fout, po, &pfomask, buf1);
4262 last_arith_dst = &po->operand[0];
4263 delayed_flag_op = NULL;
4267 assert_operand_cnt(2);
4268 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4269 if (IS(opr_name(po, 0), opr_name(po, 1))) {
4270 // special case for XOR
4271 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
4272 fprintf(fout, " cond_be = 1;\n");
4273 pfomask &= ~(1 << PFO_BE);
4275 fprintf(fout, " %s = 0;",
4276 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4277 last_arith_dst = &po->operand[0];
4278 delayed_flag_op = NULL;
4284 assert_operand_cnt(2);
4285 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4286 if (pfomask & (1 << PFO_C)) {
4287 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4288 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4289 if (po->operand[0].lmod == OPLM_DWORD) {
4290 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
4291 fprintf(fout, " cond_c = tmp64 >> 32;\n");
4292 fprintf(fout, " %s = (u32)tmp64;",
4293 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4294 strcat(g_comment, "add64");
4297 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
4298 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
4299 fprintf(fout, " %s += %s;",
4300 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4303 pfomask &= ~(1 << PFO_C);
4304 output_std_flags(fout, po, &pfomask, buf1);
4305 last_arith_dst = &po->operand[0];
4306 delayed_flag_op = NULL;
4312 assert_operand_cnt(2);
4313 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4314 if (pfomask & (1 << PFO_C)) {
4315 fprintf(fout, " cond_c = %s < %s;\n",
4316 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]),
4317 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4318 pfomask &= ~(1 << PFO_C);
4324 assert_operand_cnt(2);
4325 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4326 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4327 if (po->op == OP_SBB
4328 && IS(po->operand[0].name, po->operand[1].name))
4330 // avoid use of unitialized var
4331 fprintf(fout, " %s = -cond_c;", buf1);
4332 // carry remains what it was
4333 pfomask &= ~(1 << PFO_C);
4336 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
4337 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4339 output_std_flags(fout, po, &pfomask, buf1);
4340 last_arith_dst = &po->operand[0];
4341 delayed_flag_op = NULL;
4345 assert_operand_cnt(2);
4346 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4347 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
4348 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4350 output_std_flags(fout, po, &pfomask, buf1);
4351 last_arith_dst = &po->operand[0];
4352 delayed_flag_op = NULL;
4353 strcat(g_comment, "bsf");
4358 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4359 if (po->operand[0].type == OPT_REG) {
4360 strcpy(buf2, po->op == OP_INC ? "++" : "--");
4361 fprintf(fout, " %s%s;", buf1, buf2);
4364 strcpy(buf2, po->op == OP_INC ? "+" : "-");
4365 fprintf(fout, " %s %s= 1;", buf1, buf2);
4367 output_std_flags(fout, po, &pfomask, buf1);
4368 last_arith_dst = &po->operand[0];
4369 delayed_flag_op = NULL;
4373 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4374 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
4375 fprintf(fout, " %s = -%s%s;", buf1,
4376 lmod_cast_s(po, po->operand[0].lmod), buf2);
4377 last_arith_dst = &po->operand[0];
4378 delayed_flag_op = NULL;
4379 if (pfomask & (1 << PFO_C)) {
4380 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
4381 pfomask &= ~(1 << PFO_C);
4386 if (po->operand_cnt == 2) {
4387 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4390 if (po->operand_cnt == 3)
4391 ferr(po, "TODO imul3\n");
4394 assert_operand_cnt(1);
4395 switch (po->operand[0].lmod) {
4397 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
4398 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
4399 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
4400 fprintf(fout, " edx = tmp64 >> 32;\n");
4401 fprintf(fout, " eax = tmp64;");
4404 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
4405 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
4406 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
4410 ferr(po, "TODO: unhandled mul type\n");
4413 last_arith_dst = NULL;
4414 delayed_flag_op = NULL;
4419 assert_operand_cnt(1);
4420 if (po->operand[0].lmod != OPLM_DWORD)
4421 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
4423 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4424 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
4425 po->op == OP_IDIV));
4426 switch (po->operand[0].lmod) {
4428 if (po->flags & OPF_32BIT)
4429 snprintf(buf3, sizeof(buf3), "%seax", buf2);
4431 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
4432 snprintf(buf3, sizeof(buf3), "%stmp64",
4433 (po->op == OP_IDIV) ? "(s64)" : "");
4435 if (po->operand[0].type == OPT_REG
4436 && po->operand[0].reg == xDX)
4438 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4439 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4442 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4443 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4447 ferr(po, "unhandled division type\n");
4449 last_arith_dst = NULL;
4450 delayed_flag_op = NULL;
4455 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4457 for (j = 0; j < 8; j++) {
4458 if (pfomask & (1 << j)) {
4459 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
4460 fprintf(fout, " cond_%s = %s;",
4461 parsed_flag_op_names[j], buf1);
4468 last_arith_dst = NULL;
4469 delayed_flag_op = po;
4473 // SETcc - should already be handled
4476 // note: we reuse OP_Jcc for SETcc, only flags differ
4478 fprintf(fout, "\n goto %s;", po->operand[0].name);
4482 fprintf(fout, " if (ecx == 0)\n");
4483 fprintf(fout, " goto %s;", po->operand[0].name);
4484 strcat(g_comment, "jecxz");
4488 assert_operand_cnt(1);
4489 last_arith_dst = NULL;
4490 delayed_flag_op = NULL;
4492 if (po->operand[0].type == OPT_REGMEM) {
4493 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
4496 ferr(po, "parse failure for jmp '%s'\n",
4497 po->operand[0].name);
4498 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
4501 else if (po->operand[0].type != OPT_LABEL)
4502 ferr(po, "unhandled jmp type\n");
4504 fprintf(fout, " goto %s;", po->operand[0].name);
4508 assert_operand_cnt(1);
4510 my_assert_not(pp, NULL);
4513 if (po->flags & OPF_CC) {
4514 // we treat conditional branch to another func
4515 // (yes such code exists..) as conditional tailcall
4517 fprintf(fout, " {\n");
4520 if (pp->is_fptr && !pp->is_arg) {
4521 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
4522 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
4524 if (pp->is_unresolved)
4525 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
4526 buf3, asmfn, po->asmln, pp->name);
4529 fprintf(fout, "%s", buf3);
4530 if (strstr(pp->ret_type.name, "int64")) {
4531 if (po->flags & OPF_TAIL)
4532 ferr(po, "int64 and tail?\n");
4533 fprintf(fout, "tmp64 = ");
4535 else if (!IS(pp->ret_type.name, "void")) {
4536 if (po->flags & OPF_TAIL) {
4537 if (!IS(g_func_pp->ret_type.name, "void")) {
4538 fprintf(fout, "return ");
4539 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
4540 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
4543 else if (regmask & (1 << xAX)) {
4544 fprintf(fout, "eax = ");
4545 if (pp->ret_type.is_ptr)
4546 fprintf(fout, "(u32)");
4550 if (pp->name[0] == 0)
4551 ferr(po, "missing pp->name\n");
4552 fprintf(fout, "%s%s(", pp->name,
4553 pp->has_structarg ? "_sa" : "");
4555 if (po->flags & OPF_ATAIL) {
4556 if (pp->argc_stack != g_func_pp->argc_stack
4557 || (pp->argc_stack > 0
4558 && pp->is_stdcall != g_func_pp->is_stdcall))
4559 ferr(po, "incompatible tailcall\n");
4560 if (g_func_pp->has_retreg)
4561 ferr(po, "TODO: retreg+tailcall\n");
4563 for (arg = j = 0; arg < pp->argc; arg++) {
4565 fprintf(fout, ", ");
4568 if (pp->arg[arg].type.is_ptr)
4569 snprintf(cast, sizeof(cast), "(%s)",
4570 pp->arg[arg].type.name);
4572 if (pp->arg[arg].reg != NULL) {
4573 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4577 for (; j < g_func_pp->argc; j++)
4578 if (g_func_pp->arg[j].reg == NULL)
4580 fprintf(fout, "%sa%d", cast, j + 1);
4585 for (arg = 0; arg < pp->argc; arg++) {
4587 fprintf(fout, ", ");
4590 if (pp->arg[arg].type.is_ptr)
4591 snprintf(cast, sizeof(cast), "(%s)",
4592 pp->arg[arg].type.name);
4594 if (pp->arg[arg].reg != NULL) {
4595 if (pp->arg[arg].type.is_retreg)
4596 fprintf(fout, "&%s", pp->arg[arg].reg);
4598 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4603 tmp_op = pp->arg[arg].datap;
4605 ferr(po, "parsed_op missing for arg%d\n", arg);
4607 if (tmp_op->flags & OPF_VAPUSH) {
4608 fprintf(fout, "ap");
4610 else if (tmp_op->argnum != 0) {
4611 fprintf(fout, "%ss_a%d", cast, tmp_op->argnum);
4615 out_src_opr(buf1, sizeof(buf1),
4616 tmp_op, &tmp_op->operand[0], cast, 0));
4620 fprintf(fout, ");");
4622 if (strstr(pp->ret_type.name, "int64")) {
4623 fprintf(fout, "\n");
4624 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
4625 fprintf(fout, "%seax = tmp64;", buf3);
4628 if (pp->is_unresolved) {
4629 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
4631 strcat(g_comment, buf2);
4634 if (po->flags & OPF_TAIL) {
4636 if (i == opcnt - 1 || pp->is_noreturn)
4638 else if (IS(pp->ret_type.name, "void"))
4640 else if (IS(g_func_pp->ret_type.name, "void"))
4642 // else already handled as 'return f()'
4645 if (!IS(g_func_pp->ret_type.name, "void")) {
4646 ferr(po, "int func -> void func tailcall?\n");
4649 fprintf(fout, "\n%sreturn;", buf3);
4650 strcat(g_comment, " ^ tailcall");
4654 strcat(g_comment, " tailcall");
4656 if (pp->is_noreturn)
4657 strcat(g_comment, " noreturn");
4658 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
4659 strcat(g_comment, " argframe");
4660 if (po->flags & OPF_CC)
4661 strcat(g_comment, " cond");
4663 if (po->flags & OPF_CC)
4664 fprintf(fout, "\n }");
4666 delayed_flag_op = NULL;
4667 last_arith_dst = NULL;
4671 if (g_func_pp->is_vararg)
4672 fprintf(fout, " va_end(ap);\n");
4673 if (g_func_pp->has_retreg) {
4674 for (arg = 0; arg < g_func_pp->argc; arg++)
4675 if (g_func_pp->arg[arg].type.is_retreg)
4676 fprintf(fout, " *r_%s = %s;\n",
4677 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
4680 if (IS(g_func_pp->ret_type.name, "void")) {
4681 if (i != opcnt - 1 || label_pending)
4682 fprintf(fout, " return;");
4684 else if (g_func_pp->ret_type.is_ptr) {
4685 fprintf(fout, " return (%s)eax;",
4686 g_func_pp->ret_type.name);
4688 else if (IS(g_func_pp->ret_type.name, "__int64"))
4689 fprintf(fout, " return ((u64)edx << 32) | eax;");
4691 fprintf(fout, " return eax;");
4693 last_arith_dst = NULL;
4694 delayed_flag_op = NULL;
4698 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4699 if (po->argnum != 0) {
4700 // special case - saved func arg
4701 fprintf(fout, " s_a%d = %s;", po->argnum, buf1);
4704 else if (po->flags & OPF_RSAVE) {
4705 fprintf(fout, " s_%s = %s;", buf1, buf1);
4708 else if (g_func_pp->is_userstack) {
4709 fprintf(fout, " *(--esp) = %s;", buf1);
4712 if (!(g_ida_func_attr & IDAFA_NORETURN))
4713 ferr(po, "stray push encountered\n");
4718 if (po->flags & OPF_RSAVE) {
4719 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4720 fprintf(fout, " %s = s_%s;", buf1, buf1);
4723 else if (po->datap != NULL) {
4726 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4727 fprintf(fout, " %s = %s;", buf1,
4728 out_src_opr(buf2, sizeof(buf2),
4729 tmp_op, &tmp_op->operand[0],
4730 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4733 else if (g_func_pp->is_userstack) {
4734 fprintf(fout, " %s = *esp++;",
4735 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4739 ferr(po, "stray pop encountered\n");
4748 ferr(po, "unhandled op type %d, flags %x\n",
4753 if (g_comment[0] != 0) {
4754 char *p = g_comment;
4755 while (my_isblank(*p))
4757 fprintf(fout, " // %s", p);
4762 fprintf(fout, "\n");
4764 // some sanity checking
4765 if (po->flags & OPF_REP) {
4766 if (po->op != OP_STOS && po->op != OP_MOVS
4767 && po->op != OP_CMPS && po->op != OP_SCAS)
4768 ferr(po, "unexpected rep\n");
4769 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
4770 && (po->op == OP_CMPS || po->op == OP_SCAS))
4771 ferr(po, "cmps/scas with plain rep\n");
4773 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
4774 && po->op != OP_CMPS && po->op != OP_SCAS)
4775 ferr(po, "unexpected repz/repnz\n");
4778 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
4780 // see is delayed flag stuff is still valid
4781 if (delayed_flag_op != NULL && delayed_flag_op != po) {
4782 if (is_any_opr_modified(delayed_flag_op, po, 0))
4783 delayed_flag_op = NULL;
4786 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
4787 if (is_opr_modified(last_arith_dst, po))
4788 last_arith_dst = NULL;
4794 if (g_stack_fsz && !g_stack_frame_used)
4795 fprintf(fout, " (void)sf;\n");
4797 fprintf(fout, "}\n\n");
4800 for (i = 0; i < opcnt; i++) {
4801 struct label_ref *lr, *lr_del;
4803 lr = g_label_refs[i].next;
4804 while (lr != NULL) {
4809 g_label_refs[i].i = -1;
4810 g_label_refs[i].next = NULL;
4812 if (ops[i].op == OP_CALL) {
4814 proto_release(ops[i].pp);
4820 static void set_label(int i, const char *name)
4826 p = strchr(name, ':');
4830 if (len > sizeof(g_labels[0]) - 1)
4831 aerr("label '%s' too long: %d\n", name, len);
4832 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
4833 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
4834 memcpy(g_labels[i], name, len);
4835 g_labels[i][len] = 0;
4838 // '=' needs special treatment..
4839 static char *next_word_s(char *w, size_t wsize, char *s)
4845 for (i = 0; i < wsize - 1; i++) {
4846 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
4852 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
4853 printf("warning: '%s' truncated\n", w);
4864 static struct chunk_item *func_chunks;
4865 static int func_chunk_cnt;
4866 static int func_chunk_alloc;
4868 static void add_func_chunk(FILE *fasm, const char *name, int line)
4870 if (func_chunk_cnt >= func_chunk_alloc) {
4871 func_chunk_alloc *= 2;
4872 func_chunks = realloc(func_chunks,
4873 func_chunk_alloc * sizeof(func_chunks[0]));
4874 my_assert_not(func_chunks, NULL);
4876 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
4877 func_chunks[func_chunk_cnt].name = strdup(name);
4878 func_chunks[func_chunk_cnt].asmln = line;
4882 static int cmp_chunks(const void *p1, const void *p2)
4884 const struct chunk_item *c1 = p1, *c2 = p2;
4885 return strcmp(c1->name, c2->name);
4888 static int cmpstringp(const void *p1, const void *p2)
4890 return strcmp(*(char * const *)p1, *(char * const *)p2);
4893 static void scan_ahead(FILE *fasm)
4903 oldpos = ftell(fasm);
4906 while (fgets(line, sizeof(line), fasm))
4917 // get rid of random tabs
4918 for (i = 0; line[i] != 0; i++)
4919 if (line[i] == '\t')
4922 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
4925 next_word(words[0], sizeof(words[0]), p);
4926 if (words[0][0] == 0)
4927 aerr("missing name for func chunk?\n");
4929 add_func_chunk(fasm, words[0], asmln);
4931 else if (IS_START(p, "; sctend"))
4937 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
4938 words[wordc][0] = 0;
4939 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
4940 if (*p == 0 || *p == ';') {
4946 if (wordc == 2 && IS(words[1], "ends"))
4950 fseek(fasm, oldpos, SEEK_SET);
4954 int main(int argc, char *argv[])
4956 FILE *fout, *fasm, *frlist;
4957 struct parsed_data *pd = NULL;
4959 char **rlist = NULL;
4961 int rlist_alloc = 0;
4962 int func_chunks_used = 0;
4963 int func_chunks_sorted = 0;
4964 int func_chunk_i = -1;
4965 long func_chunk_ret = 0;
4966 int func_chunk_ret_ln = 0;
4967 int scanned_ahead = 0;
4969 char words[20][256];
4970 enum opr_lenmod lmod;
4971 char *sctproto = NULL;
4973 int pending_endp = 0;
4975 int skip_warned = 0;
4988 for (arg = 1; arg < argc; arg++) {
4989 if (IS(argv[arg], "-v"))
4991 else if (IS(argv[arg], "-rf"))
4992 g_allow_regfunc = 1;
4993 else if (IS(argv[arg], "-m"))
4999 if (argc < arg + 3) {
5000 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdrf> [rlist]*\n",
5007 asmfn = argv[arg++];
5008 fasm = fopen(asmfn, "r");
5009 my_assert_not(fasm, NULL);
5011 hdrfn = argv[arg++];
5012 g_fhdr = fopen(hdrfn, "r");
5013 my_assert_not(g_fhdr, NULL);
5016 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
5017 my_assert_not(rlist, NULL);
5018 // needs special handling..
5019 rlist[rlist_len++] = "__alloca_probe";
5021 func_chunk_alloc = 32;
5022 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
5023 my_assert_not(func_chunks, NULL);
5025 memset(words, 0, sizeof(words));
5027 for (; arg < argc; arg++) {
5028 frlist = fopen(argv[arg], "r");
5029 my_assert_not(frlist, NULL);
5031 while (fgets(line, sizeof(line), frlist)) {
5033 if (*p == 0 || *p == ';')
5036 if (IS_START(p, "#if 0")
5037 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
5041 else if (IS_START(p, "#endif"))
5048 p = next_word(words[0], sizeof(words[0]), p);
5049 if (words[0][0] == 0)
5052 if (rlist_len >= rlist_alloc) {
5053 rlist_alloc = rlist_alloc * 2 + 64;
5054 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
5055 my_assert_not(rlist, NULL);
5057 rlist[rlist_len++] = strdup(words[0]);
5066 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
5068 fout = fopen(argv[arg_out], "w");
5069 my_assert_not(fout, NULL);
5072 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
5073 my_assert_not(g_eqs, NULL);
5075 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
5076 g_label_refs[i].i = -1;
5077 g_label_refs[i].next = NULL;
5080 while (fgets(line, sizeof(line), fasm))
5089 // get rid of random tabs
5090 for (i = 0; line[i] != 0; i++)
5091 if (line[i] == '\t')
5096 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
5097 goto do_pending_endp; // eww..
5099 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
5101 static const char *attrs[] = {
5110 // parse IDA's attribute-list comment
5111 g_ida_func_attr = 0;
5114 for (; *p != 0; p = sskip(p)) {
5115 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
5116 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
5117 g_ida_func_attr |= 1 << i;
5118 p += strlen(attrs[i]);
5122 if (i == ARRAY_SIZE(attrs)) {
5123 anote("unparsed IDA attr: %s\n", p);
5126 if (IS(attrs[i], "fpd=")) {
5127 p = next_word(words[0], sizeof(words[0]), p);
5132 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5135 next_word(words[0], sizeof(words[0]), p);
5136 if (words[0][0] == 0)
5137 aerr("missing name for func chunk?\n");
5139 if (!scanned_ahead) {
5140 add_func_chunk(fasm, words[0], asmln);
5141 func_chunks_sorted = 0;
5144 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
5146 if (func_chunk_i >= 0) {
5147 if (func_chunk_i < func_chunk_cnt
5148 && IS(func_chunks[func_chunk_i].name, g_func))
5150 // move on to next chunk
5151 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5153 aerr("seek failed for '%s' chunk #%d\n",
5154 g_func, func_chunk_i);
5155 asmln = func_chunks[func_chunk_i].asmln;
5159 if (func_chunk_ret == 0)
5160 aerr("no return from chunk?\n");
5161 fseek(fasm, func_chunk_ret, SEEK_SET);
5162 asmln = func_chunk_ret_ln;
5168 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
5169 func_chunks_used = 1;
5171 if (IS_START(g_func, "sub_")) {
5172 unsigned long addr = strtoul(p, NULL, 16);
5173 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
5174 if (addr > f_addr && !scanned_ahead) {
5175 anote("scan_ahead caused by '%s', addr %lx\n",
5179 func_chunks_sorted = 0;
5187 for (i = wordc; i < ARRAY_SIZE(words); i++)
5189 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5190 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5191 if (*p == 0 || *p == ';') {
5196 if (*p != 0 && *p != ';')
5197 aerr("too many words\n");
5199 // alow asm patches in comments
5201 if (IS_START(p, "; sctpatch:")) {
5203 if (*p == 0 || *p == ';')
5205 goto parse_words; // lame
5207 if (IS_START(p, "; sctproto:")) {
5208 sctproto = strdup(p + 11);
5210 else if (IS_START(p, "; sctend")) {
5219 awarn("wordc == 0?\n");
5223 // don't care about this:
5224 if (words[0][0] == '.'
5225 || IS(words[0], "include")
5226 || IS(words[0], "assume") || IS(words[1], "segment")
5227 || IS(words[0], "align"))
5233 // do delayed endp processing to collect switch jumptables
5235 if (in_func && !skip_func && !end && wordc >= 2
5236 && ((words[0][0] == 'd' && words[0][2] == 0)
5237 || (words[1][0] == 'd' && words[1][2] == 0)))
5240 if (words[1][0] == 'd' && words[1][2] == 0) {
5242 if (g_func_pd_cnt >= pd_alloc) {
5243 pd_alloc = pd_alloc * 2 + 16;
5244 g_func_pd = realloc(g_func_pd,
5245 sizeof(g_func_pd[0]) * pd_alloc);
5246 my_assert_not(g_func_pd, NULL);
5248 pd = &g_func_pd[g_func_pd_cnt];
5250 memset(pd, 0, sizeof(*pd));
5251 strcpy(pd->label, words[0]);
5252 pd->type = OPT_CONST;
5253 pd->lmod = lmod_from_directive(words[1]);
5259 anote("skipping alignment byte?\n");
5262 lmod = lmod_from_directive(words[0]);
5263 if (lmod != pd->lmod)
5264 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
5267 if (pd->count_alloc < pd->count + wordc) {
5268 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
5269 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
5270 my_assert_not(pd->d, NULL);
5272 for (; i < wordc; i++) {
5273 if (IS(words[i], "offset")) {
5274 pd->type = OPT_OFFSET;
5277 p = strchr(words[i], ',');
5280 if (pd->type == OPT_OFFSET)
5281 pd->d[pd->count].u.label = strdup(words[i]);
5283 pd->d[pd->count].u.val = parse_number(words[i]);
5284 pd->d[pd->count].bt_i = -1;
5290 if (in_func && !skip_func)
5291 gen_func(fout, g_fhdr, g_func, pi);
5295 g_ida_func_attr = 0;
5299 func_chunks_used = 0;
5302 memset(&ops, 0, pi * sizeof(ops[0]));
5303 memset(g_labels, 0, pi * sizeof(g_labels[0]));
5307 for (i = 0; i < g_func_pd_cnt; i++) {
5309 if (pd->type == OPT_OFFSET) {
5310 for (j = 0; j < pd->count; j++)
5311 free(pd->d[j].u.label);
5325 if (IS(words[1], "proc")) {
5327 aerr("proc '%s' while in_func '%s'?\n",
5330 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
5332 strcpy(g_func, words[0]);
5333 set_label(0, words[0]);
5338 if (IS(words[1], "endp"))
5341 aerr("endp '%s' while not in_func?\n", words[0]);
5342 if (!IS(g_func, words[0]))
5343 aerr("endp '%s' while in_func '%s'?\n",
5346 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
5347 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
5353 if (!skip_func && func_chunks_used) {
5354 // start processing chunks
5355 struct chunk_item *ci, key = { g_func, 0 };
5357 func_chunk_ret = ftell(fasm);
5358 func_chunk_ret_ln = asmln;
5359 if (!func_chunks_sorted) {
5360 qsort(func_chunks, func_chunk_cnt,
5361 sizeof(func_chunks[0]), cmp_chunks);
5362 func_chunks_sorted = 1;
5364 ci = bsearch(&key, func_chunks, func_chunk_cnt,
5365 sizeof(func_chunks[0]), cmp_chunks);
5367 aerr("'%s' needs chunks, but none found\n", g_func);
5368 func_chunk_i = ci - func_chunks;
5369 for (; func_chunk_i > 0; func_chunk_i--)
5370 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
5373 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5375 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
5376 asmln = func_chunks[func_chunk_i].asmln;
5384 if (wordc == 2 && IS(words[1], "ends")) {
5388 goto do_pending_endp;
5392 // scan for next text segment
5393 while (fgets(line, sizeof(line), fasm)) {
5396 if (*p == 0 || *p == ';')
5399 if (strstr(p, "segment para public 'CODE' use32"))
5406 p = strchr(words[0], ':');
5408 set_label(pi, words[0]);
5412 if (!in_func || skip_func) {
5413 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
5415 anote("skipping from '%s'\n", g_labels[pi]);
5418 g_labels[pi][0] = 0;
5422 if (wordc > 1 && IS(words[1], "="))
5425 aerr("unhandled equ, wc=%d\n", wordc);
5426 if (g_eqcnt >= eq_alloc) {
5428 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
5429 my_assert_not(g_eqs, NULL);
5432 len = strlen(words[0]);
5433 if (len > sizeof(g_eqs[0].name) - 1)
5434 aerr("equ name too long: %d\n", len);
5435 strcpy(g_eqs[g_eqcnt].name, words[0]);
5437 if (!IS(words[3], "ptr"))
5438 aerr("unhandled equ\n");
5439 if (IS(words[2], "dword"))
5440 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
5441 else if (IS(words[2], "word"))
5442 g_eqs[g_eqcnt].lmod = OPLM_WORD;
5443 else if (IS(words[2], "byte"))
5444 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
5446 aerr("bad lmod: '%s'\n", words[2]);
5448 g_eqs[g_eqcnt].offset = parse_number(words[4]);
5453 if (pi >= ARRAY_SIZE(ops))
5454 aerr("too many ops\n");
5456 parse_op(&ops[pi], words, wordc);
5458 if (sctproto != NULL) {
5459 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
5460 ops[pi].datap = sctproto;
5473 // vim:ts=2:shiftwidth=2:expandtab