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) */
125 // must be sorted (larger len must be further in enum)
134 #define MAX_OPERANDS 3
139 enum opr_lenmod lmod;
140 unsigned int is_ptr:1; // pointer in C
141 unsigned int is_array:1; // array in C
142 unsigned int type_from_var:1; // .. in header, sometimes wrong
143 unsigned int size_mismatch:1; // type override differs from C
144 unsigned int size_lt:1; // type override is larger than C
145 unsigned int had_ds:1; // had ds: prefix
146 const struct parsed_proto *pp; // for OPT_LABEL
154 struct parsed_opr operand[MAX_OPERANDS];
157 unsigned char pfo_inv;
158 unsigned char operand_cnt;
159 unsigned char p_argnum; // arg push: altered before call arg #
160 unsigned char p_arggrp; // arg push: arg group # for above
161 unsigned char p_argpass;// arg push: arg of host func
162 short p_argnext;// arg push: same arg pushed elsewhere or -1
163 int regmask_src; // all referensed regs
165 int pfomask; // flagop: parsed_flag_op that can't be delayed
166 int cc_scratch; // scratch storage during analysis
167 int bt_i; // branch target for branches
168 struct parsed_data *btj;// branch targets for jumptables
169 struct parsed_proto *pp;// parsed_proto for OP_CALL
175 // OP_CALL - parser proto hint (str)
176 // (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
177 // OP_POP - point to OP_PUSH in push/pop pair
181 enum opr_lenmod lmod;
188 enum opr_lenmod lmod;
202 struct label_ref *next;
206 IDAFA_BP_FRAME = (1 << 0),
207 IDAFA_LIB_FUNC = (1 << 1),
208 IDAFA_STATIC = (1 << 2),
209 IDAFA_NORETURN = (1 << 3),
210 IDAFA_THUNK = (1 << 4),
211 IDAFA_FPD = (1 << 5),
214 // note: limited to 32k due to p_argnext
216 #define MAX_ARG_GRP 2
218 static struct parsed_op ops[MAX_OPS];
219 static struct parsed_equ *g_eqs;
221 static char g_labels[MAX_OPS][48];
222 static struct label_ref g_label_refs[MAX_OPS];
223 static const struct parsed_proto *g_func_pp;
224 static struct parsed_data *g_func_pd;
225 static int g_func_pd_cnt;
226 static char g_func[256];
227 static char g_comment[256];
228 static int g_bp_frame;
229 static int g_sp_frame;
230 static int g_stack_frame_used;
231 static int g_stack_fsz;
232 static int g_ida_func_attr;
233 static int g_allow_regfunc;
234 static int g_quiet_pp;
236 #define ferr(op_, fmt, ...) do { \
237 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
238 dump_op(op_), ##__VA_ARGS__); \
242 #define fnote(op_, fmt, ...) \
243 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
244 dump_op(op_), ##__VA_ARGS__)
246 const char *regs_r32[] = {
247 "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp",
248 // not r32, but list here for easy parsing and printing
249 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7",
251 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
252 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
253 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
255 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
257 // possible basic comparison types (without inversion)
258 enum parsed_flag_op {
262 PFO_BE, // 6 CF=1||ZF=1
266 PFO_LE, // e ZF=1||SF!=OF
269 #define PFOB_O (1 << PFO_O)
270 #define PFOB_C (1 << PFO_C)
271 #define PFOB_Z (1 << PFO_Z)
272 #define PFOB_S (1 << PFO_S)
274 static const char *parsed_flag_op_names[] = {
275 "o", "c", "z", "be", "s", "p", "l", "le"
278 static int char_array_i(const char *array[], size_t len, const char *s)
282 for (i = 0; i < len; i++)
289 static void printf_number(char *buf, size_t buf_size,
290 unsigned long number)
292 // output in C-friendly form
293 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
296 static int check_segment_prefix(const char *s)
298 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
312 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
316 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
318 *reg_lmod = OPLM_QWORD;
322 *reg_lmod = OPLM_DWORD;
325 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
327 *reg_lmod = OPLM_WORD;
330 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
332 *reg_lmod = OPLM_BYTE;
335 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
337 *reg_lmod = OPLM_BYTE;
344 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
346 enum opr_lenmod lmod;
359 while (my_isblank(*s))
361 for (; my_issep(*s); d++, s++)
363 while (my_isblank(*s))
367 // skip '?s:' prefixes
368 if (check_segment_prefix(s))
371 s = next_idt(w, sizeof(w), s);
376 reg = parse_reg(&lmod, w);
378 *regmask |= 1 << reg;
382 if ('0' <= w[0] && w[0] <= '9') {
383 number = parse_number(w);
384 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
388 // probably some label/identifier - pass
391 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
395 strcpy(name, cvtbuf);
400 static int is_reg_in_str(const char *s)
404 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
407 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
408 if (!strncmp(s, regs_r32[i], 3))
414 static const char *parse_stack_el(const char *name, char *extra_reg,
417 const char *p, *p2, *s;
423 if (g_bp_frame || early_try)
426 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
428 if (extra_reg != NULL) {
429 strncpy(extra_reg, name, 3);
434 if (IS_START(p, "ebp+")) {
438 if (p2 != NULL && is_reg_in_str(p)) {
439 if (extra_reg != NULL) {
440 strncpy(extra_reg, p, p2 - p);
441 extra_reg[p2 - p] = 0;
446 if (!('0' <= *p && *p <= '9'))
453 if (!IS_START(name, "esp+"))
459 if (is_reg_in_str(s)) {
460 if (extra_reg != NULL) {
461 strncpy(extra_reg, s, p - s);
462 extra_reg[p - s] = 0;
467 aerr("%s IDA stackvar not set?\n", __func__);
469 if (!('0' <= *s && *s <= '9')) {
470 aerr("%s IDA stackvar offset not set?\n", __func__);
473 if (s[0] == '0' && s[1] == 'x')
476 if (len < sizeof(buf) - 1) {
477 strncpy(buf, s, len);
479 val = strtol(buf, &endp, 16);
480 if (val == 0 || *endp != 0) {
481 aerr("%s num parse fail for '%s'\n", __func__, buf);
490 if ('0' <= *p && *p <= '9')
496 static int guess_lmod_from_name(struct parsed_opr *opr)
498 if (!strncmp(opr->name, "dword_", 6)) {
499 opr->lmod = OPLM_DWORD;
502 if (!strncmp(opr->name, "word_", 5)) {
503 opr->lmod = OPLM_WORD;
506 if (!strncmp(opr->name, "byte_", 5)) {
507 opr->lmod = OPLM_BYTE;
510 if (!strncmp(opr->name, "qword_", 6)) {
511 opr->lmod = OPLM_QWORD;
517 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
518 const struct parsed_type *c_type)
520 static const char *dword_types[] = {
521 "int", "_DWORD", "UINT_PTR", "DWORD",
522 "WPARAM", "LPARAM", "UINT", "__int32",
523 "LONG", "HIMC", "BOOL", "size_t",
526 static const char *word_types[] = {
527 "uint16_t", "int16_t", "_WORD", "WORD",
528 "unsigned __int16", "__int16",
530 static const char *byte_types[] = {
531 "uint8_t", "int8_t", "char",
532 "unsigned __int8", "__int8", "BYTE", "_BYTE",
534 // structures.. deal the same as with _UNKNOWN for now
540 if (c_type->is_ptr) {
545 n = skip_type_mod(c_type->name);
547 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
548 if (IS(n, dword_types[i])) {
554 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
555 if (IS(n, word_types[i])) {
561 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
562 if (IS(n, byte_types[i])) {
571 static char *default_cast_to(char *buf, size_t buf_size,
572 struct parsed_opr *opr)
578 if (opr->pp == NULL || opr->pp->type.name == NULL
581 snprintf(buf, buf_size, "%s", "(void *)");
585 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
589 static enum opr_type lmod_from_directive(const char *d)
593 else if (IS(d, "dw"))
595 else if (IS(d, "db"))
598 aerr("unhandled directive: '%s'\n", d);
602 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
608 *regmask |= 1 << reg;
611 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
614 static int parse_operand(struct parsed_opr *opr,
615 int *regmask, int *regmask_indirect,
616 char words[16][256], int wordc, int w, unsigned int op_flags)
618 const struct parsed_proto *pp = NULL;
619 enum opr_lenmod tmplmod;
620 unsigned long number;
628 aerr("parse_operand w %d, wordc %d\n", w, wordc);
632 for (i = w; i < wordc; i++) {
633 len = strlen(words[i]);
634 if (words[i][len - 1] == ',') {
635 words[i][len - 1] = 0;
641 wordc_in = wordc - w;
643 if ((op_flags & OPF_JMP) && wordc_in > 0
644 && !('0' <= words[w][0] && words[w][0] <= '9'))
646 const char *label = NULL;
648 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
649 && IS(words[w + 1], "ptr"))
650 label = words[w + 2];
651 else if (wordc_in == 2 && IS(words[w], "short"))
652 label = words[w + 1];
653 else if (wordc_in == 1
654 && strchr(words[w], '[') == NULL
655 && parse_reg(&tmplmod, words[w]) < 0)
659 opr->type = OPT_LABEL;
660 ret = check_segment_prefix(label);
663 aerr("fs/gs used\n");
667 strcpy(opr->name, label);
673 if (IS(words[w + 1], "ptr")) {
674 if (IS(words[w], "dword"))
675 opr->lmod = OPLM_DWORD;
676 else if (IS(words[w], "word"))
677 opr->lmod = OPLM_WORD;
678 else if (IS(words[w], "byte"))
679 opr->lmod = OPLM_BYTE;
680 else if (IS(words[w], "qword"))
681 opr->lmod = OPLM_QWORD;
683 aerr("type parsing failed\n");
685 wordc_in = wordc - w;
690 if (IS(words[w], "offset")) {
691 opr->type = OPT_OFFSET;
692 opr->lmod = OPLM_DWORD;
693 strcpy(opr->name, words[w + 1]);
694 pp = proto_parse(g_fhdr, opr->name, 1);
697 if (IS(words[w], "(offset")) {
698 p = strchr(words[w + 1], ')');
700 aerr("parse of bracketed offset failed\n");
702 opr->type = OPT_OFFSET;
703 strcpy(opr->name, words[w + 1]);
709 aerr("parse_operand 1 word expected\n");
711 ret = check_segment_prefix(words[w]);
714 aerr("fs/gs used\n");
716 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
718 strcpy(opr->name, words[w]);
720 if (words[w][0] == '[') {
721 opr->type = OPT_REGMEM;
722 ret = sscanf(words[w], "[%[^]]]", opr->name);
724 aerr("[] parse failure\n");
726 parse_indmode(opr->name, regmask_indirect, 1);
727 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1))
730 struct parsed_equ *eq =
731 equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i);
733 opr->lmod = eq->lmod;
737 else if (strchr(words[w], '[')) {
739 p = strchr(words[w], '[');
740 opr->type = OPT_REGMEM;
741 parse_indmode(p, regmask_indirect, 0);
742 strncpy(buf, words[w], p - words[w]);
743 buf[p - words[w]] = 0;
744 pp = proto_parse(g_fhdr, buf, 1);
747 else if (('0' <= words[w][0] && words[w][0] <= '9')
748 || words[w][0] == '-')
750 number = parse_number(words[w]);
751 opr->type = OPT_CONST;
753 printf_number(opr->name, sizeof(opr->name), number);
757 ret = parse_reg(&tmplmod, opr->name);
759 setup_reg_opr(opr, ret, tmplmod, regmask);
763 // most likely var in data segment
764 opr->type = OPT_LABEL;
765 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
769 if (pp->is_fptr || pp->is_func) {
770 opr->lmod = OPLM_DWORD;
774 tmplmod = OPLM_UNSPEC;
775 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
776 anote("unhandled C type '%s' for '%s'\n",
777 pp->type.name, opr->name);
779 if (opr->lmod == OPLM_UNSPEC) {
781 opr->type_from_var = 1;
783 else if (opr->lmod != tmplmod) {
784 opr->size_mismatch = 1;
785 if (tmplmod < opr->lmod)
788 opr->is_ptr = pp->type.is_ptr;
790 opr->is_array = pp->type.is_array;
794 if (opr->lmod == OPLM_UNSPEC)
795 guess_lmod_from_name(opr);
799 static const struct {
804 { "repe", OPF_REP|OPF_REPZ },
805 { "repz", OPF_REP|OPF_REPZ },
806 { "repne", OPF_REP|OPF_REPNZ },
807 { "repnz", OPF_REP|OPF_REPNZ },
808 { "lock", OPF_LOCK }, // ignored for now..
811 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
813 static const struct {
816 unsigned short minopr;
817 unsigned short maxopr;
820 unsigned char pfo_inv;
822 { "nop", OP_NOP, 0, 0, 0 },
823 { "push", OP_PUSH, 1, 1, 0 },
824 { "pop", OP_POP, 1, 1, OPF_DATA },
825 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
826 { "mov" , OP_MOV, 2, 2, OPF_DATA },
827 { "lea", OP_LEA, 2, 2, OPF_DATA },
828 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
829 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
830 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
831 { "not", OP_NOT, 1, 1, OPF_DATA },
832 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
833 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
834 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
835 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
836 { "stosb",OP_STOS, 0, 0, OPF_DATA },
837 { "stosw",OP_STOS, 0, 0, OPF_DATA },
838 { "stosd",OP_STOS, 0, 0, OPF_DATA },
839 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
840 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
841 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
842 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
843 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
844 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
845 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
846 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
847 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
848 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
849 { "cld", OP_CLD, 0, 0, OPF_DATA },
850 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
851 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
852 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
853 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
854 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
855 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
856 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
857 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
858 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
859 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
860 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
861 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
862 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
863 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
864 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
865 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
866 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
867 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
868 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
869 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
870 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
871 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
872 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
873 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
874 { "test", OP_TEST, 2, 2, OPF_FLAGS },
875 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
876 { "retn", OP_RET, 0, 1, OPF_TAIL },
877 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
878 { "jmp", OP_JMP, 1, 1, OPF_JMP },
879 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
880 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
881 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
882 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
883 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
884 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
885 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
886 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
887 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
888 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
889 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
890 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
891 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
892 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
893 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
894 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
895 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
896 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
897 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
898 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
899 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
900 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
901 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
902 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
903 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
904 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
905 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
906 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
907 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
908 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
909 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
910 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
911 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
912 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
913 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
914 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
915 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
916 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
917 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
918 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
919 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
920 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
921 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
922 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
923 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
924 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
925 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
926 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
927 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
928 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
929 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
930 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
931 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
932 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
933 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
934 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
935 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
936 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
937 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
940 { "emms", OP_EMMS, 0, 0, OPF_DATA },
941 { "movq", OP_MOV, 2, 2, OPF_DATA },
944 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
946 enum opr_lenmod lmod = OPLM_UNSPEC;
947 int prefix_flags = 0;
955 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
956 if (IS(words[w], pref_table[i].name)) {
957 prefix_flags = pref_table[i].flags;
964 aerr("lone prefix: '%s'\n", words[0]);
969 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
970 if (IS(words[w], op_table[i].name))
974 if (i == ARRAY_SIZE(op_table))
975 aerr("unhandled op: '%s'\n", words[0]);
978 op->op = op_table[i].op;
979 op->flags = op_table[i].flags | prefix_flags;
980 op->pfo = op_table[i].pfo;
981 op->pfo_inv = op_table[i].pfo_inv;
982 op->regmask_src = op->regmask_dst = 0;
985 for (opr = 0; opr < op_table[i].maxopr; opr++) {
986 if (opr >= op_table[i].minopr && w >= wordc)
989 regmask = regmask_ind = 0;
990 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
991 words, wordc, w, op->flags);
993 if (opr == 0 && (op->flags & OPF_DATA))
994 op->regmask_dst = regmask;
996 op->regmask_src |= regmask;
997 op->regmask_src |= regmask_ind;
1001 aerr("parse_op %s incomplete: %d/%d\n",
1002 words[0], w, wordc);
1005 op->operand_cnt = opr;
1006 if (!strncmp(op_table[i].name, "set", 3))
1007 op->operand[0].lmod = OPLM_BYTE;
1010 // first operand is not dst
1013 op->regmask_src |= op->regmask_dst;
1014 op->regmask_dst = 0;
1017 // first operand is src too
1029 op->regmask_src |= op->regmask_dst;
1034 op->regmask_src |= op->regmask_dst;
1035 op->regmask_dst |= op->regmask_src;
1041 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1042 && op->operand[0].lmod == op->operand[1].lmod
1043 && op->operand[0].reg == op->operand[1].reg
1044 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1046 op->regmask_src = 0;
1049 op->regmask_src |= op->regmask_dst;
1052 // ops with implicit argumets
1054 op->operand_cnt = 2;
1055 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
1056 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
1062 if (op->operand_cnt != 0)
1064 if (words[op_w][4] == 'b')
1066 else if (words[op_w][4] == 'w')
1068 else if (words[op_w][4] == 'd')
1070 op->operand_cnt = 3;
1071 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
1072 lmod, &op->regmask_src);
1073 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
1074 op->regmask_dst = op->regmask_src;
1075 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
1076 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1081 if (op->operand_cnt != 0)
1083 if (words[op_w][4] == 'b')
1085 else if (words[op_w][4] == 'w')
1087 else if (words[op_w][4] == 'd')
1089 op->operand_cnt = 3;
1090 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
1091 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
1092 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
1093 op->regmask_dst = op->regmask_src;
1097 op->operand_cnt = 1;
1098 op->regmask_src = 1 << xCX;
1099 op->operand[0].type = OPT_REG;
1100 op->operand[0].reg = xCX;
1101 op->operand[0].lmod = OPLM_DWORD;
1105 if (op->operand_cnt != 1)
1110 op->regmask_src |= op->regmask_dst;
1111 op->regmask_dst = (1 << xDX) | (1 << xAX);
1112 if (op->operand[0].lmod == OPLM_UNSPEC)
1113 op->operand[0].lmod = OPLM_DWORD;
1118 // we could set up operands for edx:eax, but there is no real need to
1119 // (see is_opr_modified())
1120 op->regmask_src |= op->regmask_dst;
1121 op->regmask_dst = (1 << xDX) | (1 << xAX);
1122 if (op->operand[0].lmod == OPLM_UNSPEC)
1123 op->operand[0].lmod = OPLM_DWORD;
1131 op->regmask_src |= op->regmask_dst;
1132 if (op->operand[1].lmod == OPLM_UNSPEC)
1133 op->operand[1].lmod = OPLM_BYTE;
1137 op->regmask_src |= op->regmask_dst;
1138 if (op->operand[2].lmod == OPLM_UNSPEC)
1139 op->operand[2].lmod = OPLM_BYTE;
1143 op->regmask_src |= op->regmask_dst;
1144 op->regmask_dst = 0;
1145 if (op->operand[0].lmod == OPLM_UNSPEC
1146 && (op->operand[0].type == OPT_CONST
1147 || op->operand[0].type == OPT_OFFSET
1148 || op->operand[0].type == OPT_LABEL))
1149 op->operand[0].lmod = OPLM_DWORD;
1155 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1156 && op->operand[0].lmod == op->operand[1].lmod
1157 && op->operand[0].reg == op->operand[1].reg
1158 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1160 op->flags |= OPF_RMD;
1161 op->regmask_src = op->regmask_dst = 0;
1166 if (op->operand[0].type == OPT_REG
1167 && op->operand[1].type == OPT_REGMEM)
1170 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1171 if (IS(buf, op->operand[1].name))
1172 op->flags |= OPF_RMD;
1177 // trashed regs must be explicitly detected later
1178 op->regmask_dst = 0;
1182 op->regmask_dst = (1 << xBP) | (1 << xSP);
1183 op->regmask_src = 1 << xBP;
1191 static const char *op_name(struct parsed_op *po)
1193 static char buf[16];
1197 if (po->op == OP_JCC || po->op == OP_SCC) {
1199 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1202 strcpy(p, parsed_flag_op_names[po->pfo]);
1206 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1207 if (op_table[i].op == po->op)
1208 return op_table[i].name;
1214 static const char *dump_op(struct parsed_op *po)
1216 static char out[128];
1223 snprintf(out, sizeof(out), "%s", op_name(po));
1224 for (i = 0; i < po->operand_cnt; i++) {
1228 snprintf(p, sizeof(out) - (p - out),
1229 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1230 po->operand[i].name);
1236 static const char *lmod_type_u(struct parsed_op *po,
1237 enum opr_lenmod lmod)
1249 ferr(po, "invalid lmod: %d\n", lmod);
1250 return "(_invalid_)";
1254 static const char *lmod_cast_u(struct parsed_op *po,
1255 enum opr_lenmod lmod)
1267 ferr(po, "invalid lmod: %d\n", lmod);
1268 return "(_invalid_)";
1272 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1273 enum opr_lenmod lmod)
1285 ferr(po, "invalid lmod: %d\n", lmod);
1286 return "(_invalid_)";
1290 static const char *lmod_cast_s(struct parsed_op *po,
1291 enum opr_lenmod lmod)
1303 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1304 return "(_invalid_)";
1308 static const char *lmod_cast(struct parsed_op *po,
1309 enum opr_lenmod lmod, int is_signed)
1312 lmod_cast_s(po, lmod) :
1313 lmod_cast_u(po, lmod);
1316 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1328 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1333 static const char *opr_name(struct parsed_op *po, int opr_num)
1335 if (opr_num >= po->operand_cnt)
1336 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1337 return po->operand[opr_num].name;
1340 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1342 if (opr_num >= po->operand_cnt)
1343 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1344 if (po->operand[opr_num].type != OPT_CONST)
1345 ferr(po, "opr %d: const expected\n", opr_num);
1346 return po->operand[opr_num].val;
1349 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1351 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1352 ferr(po, "invalid reg: %d\n", popr->reg);
1353 return regs_r32[popr->reg];
1356 // cast1 is the "final" cast
1357 static const char *simplify_cast(const char *cast1, const char *cast2)
1359 static char buf[256];
1365 if (IS(cast1, cast2))
1367 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1369 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1371 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1373 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1375 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1378 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1382 static const char *simplify_cast_num(const char *cast, unsigned int val)
1384 if (IS(cast, "(u8)") && val < 0x100)
1386 if (IS(cast, "(s8)") && val < 0x80)
1388 if (IS(cast, "(u16)") && val < 0x10000)
1390 if (IS(cast, "(s16)") && val < 0x8000)
1392 if (IS(cast, "(s32)") && val < 0x80000000)
1398 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1407 namelen = strlen(name);
1409 p = strchr(name, '+');
1413 ferr(po, "equ parse failed for '%s'\n", name);
1415 if (IS_START(p, "0x"))
1417 *extra_offs = strtol(p, &endp, 16);
1419 ferr(po, "equ parse failed for '%s'\n", name);
1422 for (i = 0; i < g_eqcnt; i++)
1423 if (strncmp(g_eqs[i].name, name, namelen) == 0
1424 && g_eqs[i].name[namelen] == 0)
1428 ferr(po, "unresolved equ name: '%s'\n", name);
1435 static int is_stack_access(struct parsed_op *po,
1436 const struct parsed_opr *popr)
1438 return (parse_stack_el(popr->name, NULL, 0)
1439 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1440 && IS_START(popr->name, "ebp")));
1443 static void parse_stack_access(struct parsed_op *po,
1444 const char *name, char *ofs_reg, int *offset_out,
1445 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1447 const char *bp_arg = "";
1448 const char *p = NULL;
1449 struct parsed_equ *eq;
1456 if (IS_START(name, "ebp-")
1457 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1460 if (IS_START(p, "0x"))
1462 offset = strtoul(p, &endp, 16);
1466 ferr(po, "ebp- parse of '%s' failed\n", name);
1469 bp_arg = parse_stack_el(name, ofs_reg, 0);
1470 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1471 eq = equ_find(po, bp_arg, &offset);
1473 ferr(po, "detected but missing eq\n");
1474 offset += eq->offset;
1477 if (!strncmp(name, "ebp", 3))
1480 // yes it sometimes LEAs ra for compares..
1481 if (!is_lea && ofs_reg[0] == 0
1482 && stack_ra <= offset && offset < stack_ra + 4)
1484 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1487 *offset_out = offset;
1488 *stack_ra_out = stack_ra;
1490 *bp_arg_out = bp_arg;
1493 static int stack_frame_access(struct parsed_op *po,
1494 struct parsed_opr *popr, char *buf, size_t buf_size,
1495 const char *name, const char *cast, int is_src, int is_lea)
1497 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1498 const char *prefix = "";
1499 const char *bp_arg = NULL;
1500 char ofs_reg[16] = { 0, };
1501 int i, arg_i, arg_s;
1509 if (po->flags & OPF_EBP_S)
1510 ferr(po, "stack_frame_access while ebp is scratch\n");
1512 parse_stack_access(po, name, ofs_reg, &offset,
1513 &stack_ra, &bp_arg, is_lea);
1515 if (offset > stack_ra)
1517 arg_i = (offset - stack_ra - 4) / 4;
1518 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1520 if (g_func_pp->is_vararg
1521 && arg_i == g_func_pp->argc_stack && is_lea)
1523 // should be va_list
1526 snprintf(buf, buf_size, "%sap", cast);
1529 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1530 offset, bp_arg, arg_i);
1532 if (ofs_reg[0] != 0)
1533 ferr(po, "offset reg on arg access?\n");
1535 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1536 if (g_func_pp->arg[i].reg != NULL)
1542 if (i == g_func_pp->argc)
1543 ferr(po, "arg %d not in prototype?\n", arg_i);
1545 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1552 ferr(po, "lea/byte to arg?\n");
1553 if (is_src && (offset & 3) == 0)
1554 snprintf(buf, buf_size, "%sa%d",
1555 simplify_cast(cast, "(u8)"), i + 1);
1557 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1558 cast, offset & 3, i + 1);
1563 ferr(po, "lea/word to arg?\n");
1568 ferr(po, "problematic arg store\n");
1569 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1570 simplify_cast(cast, "*(u16 *)"), i + 1);
1573 ferr(po, "unaligned arg word load\n");
1575 else if (is_src && (offset & 2) == 0)
1576 snprintf(buf, buf_size, "%sa%d",
1577 simplify_cast(cast, "(u16)"), i + 1);
1579 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1580 cast, (offset & 2) ? "HI" : "LO", i + 1);
1592 snprintf(buf, buf_size, "(u32)&a%d + %d",
1595 ferr(po, "unaligned arg store\n");
1597 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1598 snprintf(buf, buf_size, "%s(a%d >> %d)",
1599 prefix, i + 1, (offset & 3) * 8);
1603 snprintf(buf, buf_size, "%s%sa%d",
1604 prefix, is_lea ? "&" : "", i + 1);
1609 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1613 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1616 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1617 if (tmp_lmod != OPLM_DWORD
1618 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1619 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1621 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1622 i + 1, offset, g_func_pp->arg[i].type.name);
1624 // can't check this because msvc likes to reuse
1625 // arg space for scratch..
1626 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1627 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1631 if (g_stack_fsz == 0)
1632 ferr(po, "stack var access without stackframe\n");
1633 g_stack_frame_used = 1;
1635 sf_ofs = g_stack_fsz + offset;
1636 lim = (ofs_reg[0] != 0) ? -4 : 0;
1637 if (offset > 0 || sf_ofs < lim)
1638 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1648 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1649 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1653 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1654 // known unaligned or possibly unaligned
1655 strcat(g_comment, " unaligned");
1657 prefix = "*(u16 *)&";
1658 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1659 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1662 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1666 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1667 // known unaligned or possibly unaligned
1668 strcat(g_comment, " unaligned");
1670 prefix = "*(u32 *)&";
1671 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1672 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1675 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1679 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1686 static void check_func_pp(struct parsed_op *po,
1687 const struct parsed_proto *pp, const char *pfx)
1689 enum opr_lenmod tmp_lmod;
1693 if (pp->argc_reg != 0) {
1694 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1695 pp_print(buf, sizeof(buf), pp);
1696 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1698 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1699 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1700 pfx, pp->argc_reg, pp->argc_stack);
1703 // fptrs must use 32bit args, callsite might have no information and
1704 // lack a cast to smaller types, which results in incorrectly masked
1705 // args passed (callee may assume masked args, it does on ARM)
1706 if (!pp->is_oslib) {
1707 for (i = 0; i < pp->argc; i++) {
1708 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1709 if (ret && tmp_lmod != OPLM_DWORD)
1710 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1711 i + 1, pp->arg[i].type.name);
1716 static const char *check_label_read_ref(struct parsed_op *po,
1719 const struct parsed_proto *pp;
1721 pp = proto_parse(g_fhdr, name, 0);
1723 ferr(po, "proto_parse failed for ref '%s'\n", name);
1726 check_func_pp(po, pp, "ref");
1731 static char *out_src_opr(char *buf, size_t buf_size,
1732 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1735 char tmp1[256], tmp2[256];
1744 switch (popr->type) {
1747 ferr(po, "lea from reg?\n");
1749 switch (popr->lmod) {
1751 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
1754 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1757 snprintf(buf, buf_size, "%s%s",
1758 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1761 if (popr->name[1] == 'h') // XXX..
1762 snprintf(buf, buf_size, "%s(%s >> 8)",
1763 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1765 snprintf(buf, buf_size, "%s%s",
1766 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1769 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1774 if (is_stack_access(po, popr)) {
1775 stack_frame_access(po, popr, buf, buf_size,
1776 popr->name, cast, 1, is_lea);
1780 strcpy(expr, popr->name);
1781 if (strchr(expr, '[')) {
1782 // special case: '[' can only be left for label[reg] form
1783 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1785 ferr(po, "parse failure for '%s'\n", expr);
1786 if (tmp1[0] == '(') {
1787 // (off_4FFF50+3)[eax]
1788 p = strchr(tmp1 + 1, ')');
1789 if (p == NULL || p[1] != 0)
1790 ferr(po, "parse failure (2) for '%s'\n", expr);
1792 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1794 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1797 // XXX: do we need more parsing?
1799 snprintf(buf, buf_size, "%s", expr);
1803 snprintf(buf, buf_size, "%s(%s)",
1804 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1808 name = check_label_read_ref(po, popr->name);
1809 if (cast[0] == 0 && popr->is_ptr)
1813 snprintf(buf, buf_size, "(u32)&%s", name);
1814 else if (popr->size_lt)
1815 snprintf(buf, buf_size, "%s%s%s%s", cast,
1816 lmod_cast_u_ptr(po, popr->lmod),
1817 popr->is_array ? "" : "&", name);
1819 snprintf(buf, buf_size, "%s%s%s", cast, name,
1820 popr->is_array ? "[0]" : "");
1824 name = check_label_read_ref(po, popr->name);
1828 ferr(po, "lea an offset?\n");
1829 snprintf(buf, buf_size, "%s&%s", cast, name);
1834 ferr(po, "lea from const?\n");
1836 printf_number(tmp1, sizeof(tmp1), popr->val);
1837 if (popr->val == 0 && strchr(cast, '*'))
1838 snprintf(buf, buf_size, "NULL");
1840 snprintf(buf, buf_size, "%s%s",
1841 simplify_cast_num(cast, popr->val), tmp1);
1845 ferr(po, "invalid src type: %d\n", popr->type);
1851 // note: may set is_ptr (we find that out late for ebp frame..)
1852 static char *out_dst_opr(char *buf, size_t buf_size,
1853 struct parsed_op *po, struct parsed_opr *popr)
1855 switch (popr->type) {
1857 switch (popr->lmod) {
1859 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
1862 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1866 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1870 if (popr->name[1] == 'h') // XXX..
1871 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1873 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1876 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1881 if (is_stack_access(po, popr)) {
1882 stack_frame_access(po, popr, buf, buf_size,
1883 popr->name, "", 0, 0);
1887 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1890 if (popr->size_mismatch)
1891 snprintf(buf, buf_size, "%s%s%s",
1892 lmod_cast_u_ptr(po, popr->lmod),
1893 popr->is_array ? "" : "&", popr->name);
1895 snprintf(buf, buf_size, "%s%s", popr->name,
1896 popr->is_array ? "[0]" : "");
1900 ferr(po, "invalid dst type: %d\n", popr->type);
1906 static char *out_src_opr_u32(char *buf, size_t buf_size,
1907 struct parsed_op *po, struct parsed_opr *popr)
1909 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1912 static void out_test_for_cc(char *buf, size_t buf_size,
1913 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1914 enum opr_lenmod lmod, const char *expr)
1916 const char *cast, *scast;
1918 cast = lmod_cast_u(po, lmod);
1919 scast = lmod_cast_s(po, lmod);
1923 case PFO_BE: // CF=1||ZF=1; CF=0
1924 snprintf(buf, buf_size, "(%s%s %s 0)",
1925 cast, expr, is_inv ? "!=" : "==");
1929 case PFO_L: // SF!=OF; OF=0
1930 snprintf(buf, buf_size, "(%s%s %s 0)",
1931 scast, expr, is_inv ? ">=" : "<");
1934 case PFO_LE: // ZF=1||SF!=OF; OF=0
1935 snprintf(buf, buf_size, "(%s%s %s 0)",
1936 scast, expr, is_inv ? ">" : "<=");
1940 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1944 static void out_cmp_for_cc(char *buf, size_t buf_size,
1945 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1947 const char *cast, *scast, *cast_use;
1948 char buf1[256], buf2[256];
1949 enum opr_lenmod lmod;
1951 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
1952 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1953 po->operand[0].lmod, po->operand[1].lmod);
1954 lmod = po->operand[0].lmod;
1956 cast = lmod_cast_u(po, lmod);
1957 scast = lmod_cast_s(po, lmod);
1973 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1976 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1977 if (po->op == OP_DEC)
1978 snprintf(buf2, sizeof(buf2), "1");
1980 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
1984 // note: must be unsigned compare
1985 snprintf(buf, buf_size, "(%s %s %s)",
1986 buf1, is_inv ? ">=" : "<", buf2);
1990 snprintf(buf, buf_size, "(%s %s %s)",
1991 buf1, is_inv ? "!=" : "==", buf2);
1995 // note: must be unsigned compare
1996 snprintf(buf, buf_size, "(%s %s %s)",
1997 buf1, is_inv ? ">" : "<=", buf2);
2000 if (is_inv && lmod == OPLM_BYTE
2001 && po->operand[1].type == OPT_CONST
2002 && po->operand[1].val == 0xff)
2004 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2005 snprintf(buf, buf_size, "(0)");
2009 // note: must be signed compare
2011 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2012 scast, buf1, buf2, is_inv ? ">=" : "<");
2016 snprintf(buf, buf_size, "(%s %s %s)",
2017 buf1, is_inv ? ">=" : "<", buf2);
2021 snprintf(buf, buf_size, "(%s %s %s)",
2022 buf1, is_inv ? ">" : "<=", buf2);
2030 static void out_cmp_test(char *buf, size_t buf_size,
2031 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2033 char buf1[256], buf2[256], buf3[256];
2035 if (po->op == OP_TEST) {
2036 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2037 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2040 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2041 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2042 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2044 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2045 po->operand[0].lmod, buf3);
2047 else if (po->op == OP_CMP) {
2048 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
2051 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2054 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2055 struct parsed_opr *popr2)
2057 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2058 ferr(po, "missing lmod for both operands\n");
2060 if (popr1->lmod == OPLM_UNSPEC)
2061 popr1->lmod = popr2->lmod;
2062 else if (popr2->lmod == OPLM_UNSPEC)
2063 popr2->lmod = popr1->lmod;
2064 else if (popr1->lmod != popr2->lmod) {
2065 if (popr1->type_from_var) {
2066 popr1->size_mismatch = 1;
2067 if (popr1->lmod < popr2->lmod)
2069 popr1->lmod = popr2->lmod;
2071 else if (popr2->type_from_var) {
2072 popr2->size_mismatch = 1;
2073 if (popr2->lmod < popr1->lmod)
2075 popr2->lmod = popr1->lmod;
2078 ferr(po, "conflicting lmods: %d vs %d\n",
2079 popr1->lmod, popr2->lmod);
2083 static const char *op_to_c(struct parsed_op *po)
2107 ferr(po, "op_to_c was supplied with %d\n", po->op);
2111 static void op_set_clear_flag(struct parsed_op *po,
2112 enum op_flags flag_set, enum op_flags flag_clear)
2114 po->flags |= flag_set;
2115 po->flags &= ~flag_clear;
2118 // last op in stream - unconditional branch or ret
2119 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2120 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2121 && ops[_i].op != OP_CALL))
2123 static int scan_for_pop(int i, int opcnt, const char *reg,
2124 int magic, int depth, int *maxdepth, int do_flags)
2126 const struct parsed_proto *pp;
2127 struct parsed_op *po;
2131 for (; i < opcnt; i++) {
2133 if (po->cc_scratch == magic)
2134 break; // already checked
2135 po->cc_scratch = magic;
2137 if (po->flags & OPF_TAIL) {
2138 if (po->op == OP_CALL) {
2139 pp = proto_parse(g_fhdr, po->operand[0].name, g_quiet_pp);
2140 if (pp != NULL && pp->is_noreturn)
2141 // no stack cleanup for noreturn
2144 return -1; // deadend
2147 if ((po->flags & OPF_RMD)
2148 || (po->op == OP_PUSH && po->p_argnum != 0)) // arg push
2151 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2152 if (po->btj != NULL) {
2154 for (j = 0; j < po->btj->count; j++) {
2155 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
2156 depth, maxdepth, do_flags);
2158 return ret; // dead end
2164 ferr(po, "dead branch\n");
2168 if (po->flags & OPF_CJMP) {
2169 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2170 depth, maxdepth, do_flags);
2172 return ret; // dead end
2180 if ((po->op == OP_POP || po->op == OP_PUSH)
2181 && po->operand[0].type == OPT_REG
2182 && IS(po->operand[0].name, reg))
2184 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)) {
2186 if (depth > *maxdepth)
2189 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2191 else if (po->op == OP_POP) {
2194 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2199 if (depth < 0) // should not happen
2200 ferr(po, "fail with depth\n");
2202 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2211 // scan for pop starting from 'ret' op (all paths)
2212 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2218 for (; i < opcnt; i++) {
2219 if (!(ops[i].flags & OPF_TAIL))
2222 for (j = i - 1; j >= 0; j--) {
2223 if (ops[j].flags & OPF_RMD)
2225 if (ops[j].flags & OPF_JMP)
2228 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
2229 && IS(ops[j].operand[0].name, reg))
2232 ops[j].flags |= flag_set;
2236 if (g_labels[j][0] != 0)
2241 return found ? 0 : -1;
2244 static void scan_propagate_df(int i, int opcnt)
2246 struct parsed_op *po = &ops[i];
2249 for (; i < opcnt; i++) {
2251 if (po->flags & OPF_DF)
2252 return; // already resolved
2253 po->flags |= OPF_DF;
2255 if (po->op == OP_CALL)
2256 ferr(po, "call with DF set?\n");
2258 if (po->flags & OPF_JMP) {
2259 if (po->btj != NULL) {
2261 for (j = 0; j < po->btj->count; j++)
2262 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2267 ferr(po, "dead branch\n");
2271 if (po->flags & OPF_CJMP)
2272 scan_propagate_df(po->bt_i, opcnt);
2278 if (po->flags & OPF_TAIL)
2281 if (po->op == OP_CLD) {
2282 po->flags |= OPF_RMD;
2287 ferr(po, "missing DF clear?\n");
2290 // is operand 'opr' modified by parsed_op 'po'?
2291 static int is_opr_modified(const struct parsed_opr *opr,
2292 const struct parsed_op *po)
2296 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2299 if (opr->type == OPT_REG) {
2300 if (po->op == OP_CALL) {
2301 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2302 if ((1 << opr->reg) & mask)
2308 if (po->operand[0].type == OPT_REG) {
2309 if (po->regmask_dst & (1 << opr->reg))
2316 return IS(po->operand[0].name, opr->name);
2319 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2320 static int is_any_opr_modified(const struct parsed_op *po_test,
2321 const struct parsed_op *po, int c_mode)
2326 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2329 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2332 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2335 // in reality, it can wreck any register, but in decompiled C
2336 // version it can only overwrite eax or edx:eax
2337 mask = (1 << xAX) | (1 << xDX);
2341 if (po->op == OP_CALL
2342 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2345 for (i = 0; i < po_test->operand_cnt; i++)
2346 if (IS(po_test->operand[i].name, po->operand[0].name))
2352 // scan for any po_test operand modification in range given
2353 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2356 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2359 for (; i < opcnt; i++) {
2360 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2367 // scan for po_test operand[0] modification in range given
2368 static int scan_for_mod_opr0(struct parsed_op *po_test,
2371 for (; i < opcnt; i++) {
2372 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2379 #define check_i(po, i) \
2381 ferr(po, "bad " #i ": %d\n", i)
2383 static int scan_for_flag_set(int i, int magic, int *branched,
2384 int *setters, int *setter_cnt)
2386 struct label_ref *lr;
2390 if (ops[i].cc_scratch == magic) {
2391 ferr(&ops[i], "%s looped\n", __func__);
2394 ops[i].cc_scratch = magic;
2396 if (g_labels[i][0] != 0) {
2399 lr = &g_label_refs[i];
2400 for (; lr->next; lr = lr->next) {
2401 check_i(&ops[i], lr->i);
2402 ret = scan_for_flag_set(lr->i, magic,
2403 branched, setters, setter_cnt);
2408 check_i(&ops[i], lr->i);
2409 if (i > 0 && LAST_OP(i - 1)) {
2413 ret = scan_for_flag_set(lr->i, magic,
2414 branched, setters, setter_cnt);
2420 if (ops[i].flags & OPF_FLAGS) {
2421 setters[*setter_cnt] = i;
2426 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2433 // scan back for cdq, if anything modifies edx, fail
2434 static int scan_for_cdq_edx(int i)
2437 if (g_labels[i][0] != 0) {
2438 if (g_label_refs[i].next != NULL)
2440 if (i > 0 && LAST_OP(i - 1)) {
2441 i = g_label_refs[i].i;
2448 if (ops[i].op == OP_CDQ)
2451 if (ops[i].regmask_dst & (1 << xDX))
2458 static int scan_for_reg_clear(int i, int reg)
2461 if (g_labels[i][0] != 0) {
2462 if (g_label_refs[i].next != NULL)
2464 if (i > 0 && LAST_OP(i - 1)) {
2465 i = g_label_refs[i].i;
2472 if (ops[i].op == OP_XOR
2473 && ops[i].operand[0].lmod == OPLM_DWORD
2474 && ops[i].operand[0].reg == ops[i].operand[1].reg
2475 && ops[i].operand[0].reg == reg)
2478 if (ops[i].regmask_dst & (1 << reg))
2485 // scan for positive, constant esp adjust
2486 static int scan_for_esp_adjust(int i, int opcnt, int *adj,
2489 struct parsed_op *po;
2492 *adj = *multipath = 0;
2494 for (; i < opcnt; i++) {
2497 if (g_labels[i][0] != 0)
2500 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2501 if (po->operand[1].type != OPT_CONST)
2502 ferr(&ops[i], "non-const esp adjust?\n");
2503 *adj += po->operand[1].val;
2505 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2508 else if (po->op == OP_PUSH && !(po->flags & OPF_RMD)) {
2509 //if (first_pop == -1)
2510 // first_pop = -2; // none
2511 *adj -= lmod_bytes(po, po->operand[0].lmod);
2513 else if (po->op == OP_POP && !(po->flags & OPF_RMD)) {
2514 // seems like msvc only uses 'pop ecx' for stack realignment..
2515 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2517 if (first_pop == -1 && *adj >= 0)
2519 *adj += lmod_bytes(po, po->operand[0].lmod);
2521 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2522 if (po->op == OP_JMP && po->btj == NULL) {
2526 if (po->op != OP_CALL)
2528 if (po->operand[0].type != OPT_LABEL)
2530 if (po->pp != NULL && po->pp->is_stdcall)
2535 if (first_pop >= 0) {
2536 // probably 'pop ecx' was used..
2543 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2545 struct parsed_op *po;
2549 ferr(ops, "%s: followed bad branch?\n", __func__);
2551 for (; i < opcnt; i++) {
2553 if (po->cc_scratch == magic)
2555 po->cc_scratch = magic;
2558 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2559 if (po->btj != NULL) {
2561 for (j = 0; j < po->btj->count; j++)
2562 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2566 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2567 if (!(po->flags & OPF_CJMP))
2570 if (po->flags & OPF_TAIL)
2575 static const struct parsed_proto *try_recover_pp(
2576 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2578 const struct parsed_proto *pp = NULL;
2582 // maybe an arg of g_func?
2583 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2585 char ofs_reg[16] = { 0, };
2586 int arg, arg_s, arg_i;
2590 parse_stack_access(po, opr->name, ofs_reg,
2591 &offset, &stack_ra, NULL, 0);
2592 if (ofs_reg[0] != 0)
2593 ferr(po, "offset reg on arg access?\n");
2594 if (offset <= stack_ra) {
2595 // search who set the stack var instead
2596 if (search_instead != NULL)
2597 *search_instead = 1;
2601 arg_i = (offset - stack_ra - 4) / 4;
2602 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2603 if (g_func_pp->arg[arg].reg != NULL)
2609 if (arg == g_func_pp->argc)
2610 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2612 pp = g_func_pp->arg[arg].fptr;
2614 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2615 check_func_pp(po, pp, "icall arg");
2617 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2619 p = strchr(opr->name + 1, '[');
2620 memcpy(buf, opr->name, p - opr->name);
2621 buf[p - opr->name] = 0;
2622 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
2624 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2625 pp = proto_parse(g_fhdr, opr->name, 0);
2627 ferr(po, "proto_parse failed for icall from '%s'\n", opr->name);
2628 check_func_pp(po, pp, "reg-fptr ref");
2634 static void scan_for_call_type(int i, const struct parsed_opr *opr,
2635 int magic, const struct parsed_proto **pp_found, int *multi)
2637 const struct parsed_proto *pp = NULL;
2638 struct parsed_op *po;
2639 struct label_ref *lr;
2641 ops[i].cc_scratch = magic;
2644 if (g_labels[i][0] != 0) {
2645 lr = &g_label_refs[i];
2646 for (; lr != NULL; lr = lr->next) {
2647 check_i(&ops[i], lr->i);
2648 scan_for_call_type(lr->i, opr, magic, pp_found, multi);
2650 if (i > 0 && LAST_OP(i - 1))
2658 if (ops[i].cc_scratch == magic)
2660 ops[i].cc_scratch = magic;
2662 if (!(ops[i].flags & OPF_DATA))
2664 if (!is_opr_modified(opr, &ops[i]))
2666 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2667 // most probably trashed by some processing
2672 opr = &ops[i].operand[1];
2673 if (opr->type != OPT_REG)
2677 po = (i >= 0) ? &ops[i] : ops;
2680 // reached the top - can only be an arg-reg
2681 if (opr->type != OPT_REG)
2684 for (i = 0; i < g_func_pp->argc; i++) {
2685 if (g_func_pp->arg[i].reg == NULL)
2687 if (IS(opr->name, g_func_pp->arg[i].reg))
2690 if (i == g_func_pp->argc)
2692 pp = g_func_pp->arg[i].fptr;
2694 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2695 i + 1, g_func_pp->arg[i].reg);
2696 check_func_pp(po, pp, "icall reg-arg");
2699 pp = try_recover_pp(po, opr, NULL);
2701 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2702 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2703 || (*pp_found)->is_stdcall != pp->is_stdcall
2704 || (*pp_found)->is_fptr != pp->is_fptr
2705 || (*pp_found)->argc != pp->argc
2706 || (*pp_found)->argc_reg != pp->argc_reg
2707 || (*pp_found)->argc_stack != pp->argc_stack)
2709 ferr(po, "icall: parsed_proto mismatch\n");
2717 static const struct parsed_proto *resolve_icall(int i, int opcnt,
2720 const struct parsed_proto *pp = NULL;
2721 int search_advice = 0;
2725 switch (ops[i].operand[0].type) {
2729 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
2734 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
2742 // find an instruction that changed opr before i op
2743 // *op_i must be set to -1 by caller
2744 // *entry is set to 1 if one source is determined to be the caller
2745 // returns 1 if found, *op_i is then set to origin
2746 static int resolve_origin(int i, const struct parsed_opr *opr,
2747 int magic, int *op_i, int *is_caller)
2749 struct label_ref *lr;
2752 if (ops[i].cc_scratch == magic)
2754 ops[i].cc_scratch = magic;
2757 if (g_labels[i][0] != 0) {
2758 lr = &g_label_refs[i];
2759 for (; lr != NULL; lr = lr->next) {
2760 check_i(&ops[i], lr->i);
2761 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
2763 if (i > 0 && LAST_OP(i - 1))
2769 if (is_caller != NULL)
2774 if (ops[i].cc_scratch == magic)
2776 ops[i].cc_scratch = magic;
2778 if (!(ops[i].flags & OPF_DATA))
2780 if (!is_opr_modified(opr, &ops[i]))
2786 // XXX: could check if the other op does the same
2795 static int try_resolve_const(int i, const struct parsed_opr *opr,
2796 int magic, unsigned int *val)
2801 ret = resolve_origin(i, opr, magic, &s_i, NULL);
2804 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
2807 *val = ops[i].operand[1].val;
2814 static int collect_call_args_r(struct parsed_op *po, int i,
2815 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
2816 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
2818 struct parsed_proto *pp_tmp;
2819 struct parsed_op *po_tmp;
2820 struct label_ref *lr;
2821 int need_to_save_current;
2822 int arg_grp_current = 0;
2823 int save_args_seen = 0;
2831 ferr(po, "dead label encountered\n");
2835 for (; arg < pp->argc; arg++)
2836 if (pp->arg[arg].reg == NULL)
2838 magic = (magic & 0xffffff) | (arg << 24);
2840 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
2842 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
2843 if (ops[j].cc_scratch != magic) {
2844 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
2848 // ok: have already been here
2851 ops[j].cc_scratch = magic;
2853 if (g_labels[j][0] != 0 && g_label_refs[j].i != -1) {
2854 lr = &g_label_refs[j];
2855 if (lr->next != NULL)
2857 for (; lr->next; lr = lr->next) {
2858 check_i(&ops[j], lr->i);
2859 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2861 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2862 arg_grp, arg, magic, need_op_saving, may_reuse);
2867 check_i(&ops[j], lr->i);
2868 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2870 if (j > 0 && LAST_OP(j - 1)) {
2871 // follow last branch in reverse
2876 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2877 arg_grp, arg, magic, need_op_saving, may_reuse);
2883 if (ops[j].op == OP_CALL)
2885 if (pp->is_unresolved)
2890 ferr(po, "arg collect hit unparsed call '%s'\n",
2891 ops[j].operand[0].name);
2892 if (may_reuse && pp_tmp->argc_stack > 0)
2893 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2894 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2896 // esp adjust of 0 means we collected it before
2897 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
2898 && (ops[j].operand[1].type != OPT_CONST
2899 || ops[j].operand[1].val != 0))
2901 if (pp->is_unresolved)
2904 ferr(po, "arg collect %d/%d hit esp adjust of %d\n",
2905 arg, pp->argc, ops[j].operand[1].val);
2907 else if (ops[j].op == OP_POP) {
2908 if (pp->is_unresolved)
2911 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2913 else if (ops[j].flags & OPF_CJMP)
2915 if (pp->is_unresolved)
2920 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2922 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
2925 ops[j].p_argnext = -1;
2926 po_tmp = pp->arg[arg].datap;
2928 ops[j].p_argnext = po_tmp - ops;
2929 pp->arg[arg].datap = &ops[j];
2931 need_to_save_current = 0;
2934 if (ops[j].operand[0].type == OPT_REG)
2935 reg = ops[j].operand[0].reg;
2937 if (!need_op_saving) {
2938 ret = scan_for_mod(&ops[j], j + 1, i, 1);
2939 need_to_save_current = (ret >= 0);
2941 if (need_op_saving || need_to_save_current) {
2942 // mark this push as one that needs operand saving
2943 ops[j].flags &= ~OPF_RMD;
2944 if (ops[j].p_argnum == 0) {
2945 ops[j].p_argnum = arg + 1;
2946 save_args |= 1 << arg;
2948 else if (ops[j].p_argnum < arg + 1) {
2949 // XXX: might kill valid var..
2950 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
2951 ops[j].p_argnum = arg + 1;
2952 save_args |= 1 << arg;
2955 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
2958 if (arg_grp_current >= MAX_ARG_GRP)
2959 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
2960 ops[j].p_argnum, pp->name);
2963 else if (ops[j].p_argnum == 0)
2964 ops[j].flags |= OPF_RMD;
2966 // some PUSHes are reused by different calls on other branches,
2967 // but that can't happen if we didn't branch, so they
2968 // can be removed from future searches (handles nested calls)
2970 ops[j].flags |= OPF_FARG;
2972 ops[j].flags &= ~OPF_RSAVE;
2974 // check for __VALIST
2975 if (!pp->is_unresolved && pp->arg[arg].type.is_va_list) {
2977 ret = resolve_origin(j, &ops[j].operand[0],
2978 magic + 1, &k, NULL);
2979 if (ret == 1 && k >= 0)
2981 if (ops[k].op == OP_LEA) {
2982 snprintf(buf, sizeof(buf), "arg_%X",
2983 g_func_pp->argc_stack * 4);
2984 if (!g_func_pp->is_vararg
2985 || strstr(ops[k].operand[1].name, buf))
2987 ops[k].flags |= OPF_RMD;
2988 ops[j].flags |= OPF_RMD | OPF_VAPUSH;
2989 save_args &= ~(1 << arg);
2993 ferr(&ops[j], "lea va_list used, but no vararg?\n");
2995 // check for va_list from g_func_pp arg too
2996 else if (ops[k].op == OP_MOV
2997 && is_stack_access(&ops[k], &ops[k].operand[1]))
2999 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
3000 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
3002 ops[k].flags |= OPF_RMD;
3003 ops[j].flags |= OPF_RMD;
3004 ops[j].p_argpass = ret + 1;
3005 save_args &= ~(1 << arg);
3012 *save_arg_vars |= save_args;
3014 // tracking reg usage
3016 *regmask |= 1 << reg;
3019 if (!pp->is_unresolved) {
3021 for (; arg < pp->argc; arg++)
3022 if (pp->arg[arg].reg == NULL)
3025 magic = (magic & 0xffffff) | (arg << 24);
3028 if (ops[j].p_arggrp > arg_grp_current) {
3030 arg_grp_current = ops[j].p_arggrp;
3032 if (ops[j].p_argnum > 0)
3033 save_args_seen |= 1 << (ops[j].p_argnum - 1);
3036 if (arg < pp->argc) {
3037 ferr(po, "arg collect failed for '%s': %d/%d\n",
3038 pp->name, arg, pp->argc);
3042 if (arg_grp_current > *arg_grp)
3043 *arg_grp = arg_grp_current;
3048 static int collect_call_args(struct parsed_op *po, int i,
3049 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3052 // arg group is for cases when pushes for
3053 // multiple funcs are going on
3054 struct parsed_op *po_tmp;
3055 int save_arg_vars_current = 0;
3060 ret = collect_call_args_r(po, i, pp, regmask,
3061 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
3066 // propagate arg_grp
3067 for (a = 0; a < pp->argc; a++) {
3068 if (pp->arg[a].reg != NULL)
3071 po_tmp = pp->arg[a].datap;
3072 while (po_tmp != NULL) {
3073 po_tmp->p_arggrp = arg_grp;
3074 if (po_tmp->p_argnext > 0)
3075 po_tmp = &ops[po_tmp->p_argnext];
3081 save_arg_vars[arg_grp] |= save_arg_vars_current;
3083 if (pp->is_unresolved) {
3085 pp->argc_stack += ret;
3086 for (a = 0; a < pp->argc; a++)
3087 if (pp->arg[a].type.name == NULL)
3088 pp->arg[a].type.name = strdup("int");
3094 // early check for tail call or branch back
3095 static int is_like_tailjmp(int j)
3097 if (!(ops[j].flags & OPF_JMP))
3100 if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds)
3101 // probably local branch back..
3103 if (ops[j].op == OP_CALL)
3104 // probably noreturn call..
3110 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
3114 for (i = 0; i < pp->argc; i++)
3115 if (pp->arg[i].reg == NULL)
3119 memmove(&pp->arg[i + 1], &pp->arg[i],
3120 sizeof(pp->arg[0]) * pp->argc_stack);
3121 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
3122 pp->arg[i].reg = strdup(reg);
3123 pp->arg[i].type.name = strdup("int");
3128 static void add_label_ref(struct label_ref *lr, int op_i)
3130 struct label_ref *lr_new;
3137 lr_new = calloc(1, sizeof(*lr_new));
3139 lr_new->next = lr->next;
3143 static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
3145 struct parsed_op *po = &ops[i];
3146 struct parsed_data *pd;
3147 char label[NAMELEN], *p;
3150 p = strchr(po->operand[0].name, '[');
3154 len = p - po->operand[0].name;
3155 strncpy(label, po->operand[0].name, len);
3158 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3159 if (IS(g_func_pd[j].label, label)) {
3165 //ferr(po, "label '%s' not parsed?\n", label);
3168 if (pd->type != OPT_OFFSET)
3169 ferr(po, "label '%s' with non-offset data?\n", label);
3171 // find all labels, link
3172 for (j = 0; j < pd->count; j++) {
3173 for (l = 0; l < opcnt; l++) {
3174 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
3175 add_label_ref(&g_label_refs[l], i);
3185 static void output_std_flags(FILE *fout, struct parsed_op *po,
3186 int *pfomask, const char *dst_opr_text)
3188 if (*pfomask & (1 << PFO_Z)) {
3189 fprintf(fout, "\n cond_z = (%s%s == 0);",
3190 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
3191 *pfomask &= ~(1 << PFO_Z);
3193 if (*pfomask & (1 << PFO_S)) {
3194 fprintf(fout, "\n cond_s = (%s%s < 0);",
3195 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
3196 *pfomask &= ~(1 << PFO_S);
3200 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
3203 if (pp->is_fastcall)
3204 fprintf(fout, "__fastcall ");
3205 else if (pp->is_stdcall && pp->argc_reg == 0)
3206 fprintf(fout, "__stdcall ");
3207 if (pp->is_noreturn || is_noreturn)
3208 fprintf(fout, "noreturn ");
3211 static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
3217 snprintf(buf1, sizeof(buf1), "%d", grp);
3218 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
3223 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
3225 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
3226 struct parsed_opr *last_arith_dst = NULL;
3227 char buf1[256], buf2[256], buf3[256], cast[64];
3228 const struct parsed_proto *pp_c;
3229 struct parsed_proto *pp, *pp_tmp;
3230 struct parsed_data *pd;
3231 const char *tmpname;
3233 int save_arg_vars[MAX_ARG_GRP] = { 0, };
3235 int need_tmp_var = 0;
3238 int label_pending = 0;
3239 int regmask_save = 0;
3240 int regmask_arg = 0;
3241 int regmask_now = 0;
3242 int regmask_init = 0;
3253 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
3254 g_stack_frame_used = 0;
3256 g_func_pp = proto_parse(fhdr, funcn, 0);
3257 if (g_func_pp == NULL)
3258 ferr(ops, "proto_parse failed for '%s'\n", funcn);
3260 for (i = 0; i < g_func_pp->argc; i++) {
3261 if (g_func_pp->arg[i].reg != NULL) {
3262 reg = char_array_i(regs_r32,
3263 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
3265 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
3266 regmask_arg |= 1 << reg;
3271 // - handle ebp/esp frame, remove ops related to it
3272 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3273 && ops[1].op == OP_MOV
3274 && IS(opr_name(&ops[1], 0), "ebp")
3275 && IS(opr_name(&ops[1], 1), "esp"))
3280 ops[0].flags |= OPF_RMD;
3281 ops[1].flags |= OPF_RMD;
3284 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
3285 g_stack_fsz = opr_const(&ops[2], 1);
3286 ops[2].flags |= OPF_RMD;
3290 // another way msvc builds stack frame..
3292 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3294 ops[i].flags |= OPF_RMD;
3298 // and another way..
3299 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3300 && ops[i].operand[1].type == OPT_CONST
3301 && ops[i + 1].op == OP_CALL
3302 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3304 g_stack_fsz += ops[i].operand[1].val;
3305 ops[i].flags |= OPF_RMD;
3307 ops[i].flags |= OPF_RMD;
3314 for (; i < opcnt; i++)
3315 if (ops[i].op == OP_RET)
3318 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3319 if (found && is_like_tailjmp(j))
3324 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3325 || ops[j].op == OP_LEAVE)
3327 ops[j].flags |= OPF_RMD;
3329 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3330 ferr(&ops[j], "'pop ebp' expected\n");
3332 if (g_stack_fsz != 0) {
3333 if (ops[j - 1].op == OP_MOV
3334 && IS(opr_name(&ops[j - 1], 0), "esp")
3335 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3337 ops[j - 1].flags |= OPF_RMD;
3339 else if (ops[j].op != OP_LEAVE
3340 && !(g_ida_func_attr & IDAFA_NORETURN))
3342 ferr(&ops[j - 1], "esp restore expected\n");
3345 if (ecx_push && ops[j - 2].op == OP_POP
3346 && IS(opr_name(&ops[j - 2], 0), "ecx"))
3348 ferr(&ops[j - 2], "unexpected ecx pop\n");
3354 } while (i < opcnt);
3357 int ecx_push = 0, esp_sub = 0;
3360 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3361 ops[i].flags |= OPF_RMD;
3367 for (; i < opcnt; i++) {
3368 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3370 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3371 && ops[i].operand[1].type == OPT_CONST)
3373 g_stack_fsz = ops[i].operand[1].val;
3374 ops[i].flags |= OPF_RMD;
3381 if (ecx_push || esp_sub)
3387 for (; i < opcnt; i++)
3388 if (ops[i].op == OP_RET)
3391 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3392 if (found && is_like_tailjmp(j))
3398 for (l = 0; l < ecx_push; l++) {
3399 if (ops[j].op != OP_POP
3400 || !IS(opr_name(&ops[j], 0), "ecx"))
3402 ferr(&ops[j], "'pop ecx' expected\n");
3404 ops[j].flags |= OPF_RMD;
3412 if (ops[j].op != OP_ADD
3413 || !IS(opr_name(&ops[j], 0), "esp")
3414 || ops[j].operand[1].type != OPT_CONST
3415 || ops[j].operand[1].val != g_stack_fsz)
3416 ferr(&ops[j], "'add esp' expected\n");
3417 ops[j].flags |= OPF_RMD;
3423 } while (i < opcnt);
3428 // - parse calls with labels
3429 // - resolve all branches
3430 for (i = 0; i < opcnt; i++)
3436 if (po->flags & OPF_RMD)
3439 if (po->op == OP_CALL) {
3442 if (po->operand[0].type == OPT_LABEL) {
3443 tmpname = opr_name(po, 0);
3444 if (IS_START(tmpname, "loc_"))
3445 ferr(po, "call to loc_*\n");
3446 pp_c = proto_parse(fhdr, tmpname, 0);
3448 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3450 pp = proto_clone(pp_c);
3451 my_assert_not(pp, NULL);
3453 else if (po->datap != NULL) {
3454 pp = calloc(1, sizeof(*pp));
3455 my_assert_not(pp, NULL);
3457 ret = parse_protostr(po->datap, pp);
3459 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3466 check_func_pp(po, pp, "fptr var call");
3467 if (pp->is_noreturn)
3468 po->flags |= OPF_TAIL;
3474 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3477 if (po->operand[0].type == OPT_REGMEM) {
3478 pd = try_resolve_jumptab(i, opcnt);
3486 for (l = 0; l < opcnt; l++) {
3487 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
3488 if (l == i + 1 && po->op == OP_JMP) {
3489 // yet another alignment type..
3490 po->flags |= OPF_RMD;
3493 add_label_ref(&g_label_refs[l], i);
3499 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3502 if (po->operand[0].type == OPT_LABEL)
3506 ferr(po, "unhandled branch\n");
3510 po->flags |= OPF_TAIL;
3511 if (i > 0 && ops[i - 1].op == OP_POP)
3512 po->flags |= OPF_ATAIL;
3517 // - remove dead labels
3519 for (i = 0; i < opcnt; i++)
3521 if (g_labels[i][0] != 0 && g_label_refs[i].i == -1)
3525 if (po->flags & OPF_RMD)
3528 if (po->op == OP_CALL)
3530 tmpname = opr_name(po, 0);
3535 pp_c = resolve_icall(i, opcnt, &l);
3537 if (!pp_c->is_func && !pp_c->is_fptr)
3538 ferr(po, "call to non-func: %s\n", pp_c->name);
3539 pp = proto_clone(pp_c);
3540 my_assert_not(pp, NULL);
3542 // not resolved just to single func
3545 switch (po->operand[0].type) {
3547 // we resolved this call and no longer need the register
3548 po->regmask_src &= ~(1 << po->operand[0].reg);
3558 pp = calloc(1, sizeof(*pp));
3559 my_assert_not(pp, NULL);
3561 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3563 if (!g_allow_regfunc)
3564 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3565 pp->is_unresolved = 1;
3569 if (j > ARRAY_SIZE(pp->arg))
3570 ferr(po, "esp adjust too large: %d\n", j);
3571 pp->ret_type.name = strdup("int");
3572 pp->argc = pp->argc_stack = j;
3573 for (arg = 0; arg < pp->argc; arg++)
3574 pp->arg[arg].type.name = strdup("int");
3579 // look for and make use of esp adjust
3581 if (!pp->is_stdcall && pp->argc_stack > 0)
3582 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3584 if (pp->is_vararg) {
3585 if (j / 4 < pp->argc_stack)
3586 ferr(po, "esp adjust is too small: %x < %x\n",
3587 j, pp->argc_stack * 4);
3588 // modify pp to make it have varargs as normal args
3590 pp->argc += j / 4 - pp->argc_stack;
3591 for (; arg < pp->argc; arg++) {
3592 pp->arg[arg].type.name = strdup("int");
3595 if (pp->argc > ARRAY_SIZE(pp->arg))
3596 ferr(po, "too many args for '%s'\n", tmpname);
3598 if (pp->argc_stack != j / 4)
3599 ferr(po, "stack tracking failed for '%s': %x %x\n",
3600 tmpname, pp->argc_stack * 4, j);
3602 ops[ret].flags |= OPF_RMD;
3603 if (ops[ret].op == OP_POP && j > 4) {
3604 // deal with multi-pop stack adjust
3606 while (ops[ret].op == OP_POP && j > 0 && ret < opcnt) {
3607 ops[ret].flags |= OPF_RMD;
3613 // a bit of a hack, but deals with use of
3614 // single adj for multiple calls
3615 ops[ret].operand[1].val -= j;
3618 else if (pp->is_vararg)
3619 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3622 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
3623 // since we know the args, collect them
3624 collect_call_args(po, i, pp, ®mask, save_arg_vars,
3628 if (strstr(pp->ret_type.name, "int64"))
3634 // - find POPs for PUSHes, rm both
3635 // - scan for STD/CLD, propagate DF
3636 // - scan for all used registers
3637 // - find flag set ops for their users
3638 // - do unreselved calls
3639 // - declare indirect functions
3640 for (i = 0; i < opcnt; i++) {
3642 if (po->flags & OPF_RMD)
3645 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
3646 reg = po->operand[0].reg;
3647 if (!(regmask & (1 << reg)))
3648 // not a reg save after all, rerun scan_for_pop
3649 po->flags &= ~OPF_RSAVE;
3651 regmask_save |= 1 << reg;
3654 if (po->op == OP_PUSH && po->p_argnum == 0
3655 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
3657 if (po->operand[0].type == OPT_REG)
3659 reg = po->operand[0].reg;
3661 ferr(po, "reg not set for push?\n");
3664 ret = scan_for_pop(i + 1, opcnt,
3665 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
3668 ferr(po, "too much depth: %d\n", depth);
3670 po->flags |= OPF_RMD;
3671 scan_for_pop(i + 1, opcnt, po->operand[0].name,
3672 i + opcnt * 4, 0, &depth, 1);
3675 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
3678 if (regmask & (1 << reg)) {
3679 if (regmask_save & (1 << reg))
3680 ferr(po, "%s already saved?\n", po->operand[0].name);
3684 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
3688 else if (po->operand[0].type == OPT_CONST) {
3689 for (j = i + 1; j < opcnt; j++) {
3690 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
3691 || ops[j].op == OP_PUSH || g_labels[i][0] != 0)
3696 if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP)
3698 po->flags |= OPF_RMD;
3706 if (po->op == OP_STD) {
3707 po->flags |= OPF_DF | OPF_RMD;
3708 scan_propagate_df(i + 1, opcnt);
3711 regmask_now = po->regmask_src | po->regmask_dst;
3712 if (regmask_now & (1 << xBP)) {
3713 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
3714 if (po->regmask_dst & (1 << xBP))
3715 // compiler decided to drop bp frame and use ebp as scratch
3716 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
3718 regmask_now &= ~(1 << xBP);
3722 regmask |= regmask_now;
3724 if (po->flags & OPF_CC)
3726 int setters[16], cnt = 0, branched = 0;
3728 ret = scan_for_flag_set(i, i + opcnt * 6,
3729 &branched, setters, &cnt);
3730 if (ret < 0 || cnt <= 0)
3731 ferr(po, "unable to trace flag setter(s)\n");
3732 if (cnt > ARRAY_SIZE(setters))
3733 ferr(po, "too many flag setters\n");
3735 for (j = 0; j < cnt; j++)
3737 tmp_op = &ops[setters[j]]; // flag setter
3740 // to get nicer code, we try to delay test and cmp;
3741 // if we can't because of operand modification, or if we
3742 // have arith op, or branch, make it calculate flags explicitly
3743 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
3745 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
3746 pfomask = 1 << po->pfo;
3748 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
3749 pfomask = 1 << po->pfo;
3752 // see if we'll be able to handle based on op result
3753 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
3754 && po->pfo != PFO_Z && po->pfo != PFO_S
3755 && po->pfo != PFO_P)
3757 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
3759 pfomask = 1 << po->pfo;
3762 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
3763 propagate_lmod(tmp_op, &tmp_op->operand[0],
3764 &tmp_op->operand[1]);
3765 if (tmp_op->operand[0].lmod == OPLM_DWORD)
3770 tmp_op->pfomask |= pfomask;
3771 cond_vars |= pfomask;
3773 // note: may overwrite, currently not a problem
3777 if (po->op == OP_RCL || po->op == OP_RCR
3778 || po->op == OP_ADC || po->op == OP_SBB)
3779 cond_vars |= 1 << PFO_C;
3782 if (po->op == OP_CMPS || po->op == OP_SCAS) {
3783 cond_vars |= 1 << PFO_Z;
3785 else if (po->op == OP_MUL
3786 || (po->op == OP_IMUL && po->operand_cnt == 1))
3788 if (po->operand[0].lmod == OPLM_DWORD)
3791 else if (po->op == OP_CALL) {
3794 ferr(po, "NULL pp\n");
3796 if (pp->is_unresolved) {
3797 int regmask_stack = 0;
3798 collect_call_args(po, i, pp, ®mask, save_arg_vars,
3801 // this is pretty rough guess:
3802 // see ecx and edx were pushed (and not their saved versions)
3803 for (arg = 0; arg < pp->argc; arg++) {
3804 if (pp->arg[arg].reg != NULL)
3807 tmp_op = pp->arg[arg].datap;
3809 ferr(po, "parsed_op missing for arg%d\n", arg);
3810 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
3811 regmask_stack |= 1 << tmp_op->operand[0].reg;
3814 if (!((regmask_stack & (1 << xCX))
3815 && (regmask_stack & (1 << xDX))))
3817 if (pp->argc_stack != 0
3818 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
3820 pp_insert_reg_arg(pp, "ecx");
3821 pp->is_fastcall = 1;
3822 regmask_init |= 1 << xCX;
3823 regmask |= 1 << xCX;
3825 if (pp->argc_stack != 0
3826 || ((regmask | regmask_arg) & (1 << xDX)))
3828 pp_insert_reg_arg(pp, "edx");
3829 regmask_init |= 1 << xDX;
3830 regmask |= 1 << xDX;
3834 // note: __cdecl doesn't fall into is_unresolved category
3835 if (pp->argc_stack > 0)
3839 for (arg = 0; arg < pp->argc; arg++) {
3840 if (pp->arg[arg].reg != NULL) {
3841 reg = char_array_i(regs_r32,
3842 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
3844 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
3845 if (!(regmask & (1 << reg))) {
3846 regmask_init |= 1 << reg;
3847 regmask |= 1 << reg;
3852 else if (po->op == OP_MOV && po->operand[0].pp != NULL
3853 && po->operand[1].pp != NULL)
3855 // <var> = offset <something>
3856 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
3857 && !IS_START(po->operand[1].name, "off_"))
3859 if (!po->operand[0].pp->is_fptr)
3860 ferr(po, "%s not declared as fptr when it should be\n",
3861 po->operand[0].name);
3862 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
3863 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
3864 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
3865 fnote(po, "var: %s\n", buf1);
3866 fnote(po, "func: %s\n", buf2);
3867 ferr(po, "^ mismatch\n");
3871 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
3872 regmask |= 1 << xAX;
3873 else if (po->op == OP_DIV || po->op == OP_IDIV) {
3874 // 32bit division is common, look for it
3875 if (po->op == OP_DIV)
3876 ret = scan_for_reg_clear(i, xDX);
3878 ret = scan_for_cdq_edx(i);
3880 po->flags |= OPF_32BIT;
3884 else if (po->op == OP_CLD)
3885 po->flags |= OPF_RMD;
3887 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
3893 // - confirm regmask_save, it might have been reduced
3894 if (regmask_save != 0)
3897 for (i = 0; i < opcnt; i++) {
3899 if (po->flags & OPF_RMD)
3902 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
3903 regmask_save |= 1 << po->operand[0].reg;
3907 // output starts here
3909 // define userstack size
3910 if (g_func_pp->is_userstack) {
3911 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
3912 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
3913 fprintf(fout, "#endif\n");
3916 // the function itself
3917 fprintf(fout, "%s ", g_func_pp->ret_type.name);
3918 output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN);
3919 fprintf(fout, "%s(", g_func_pp->name);
3921 for (i = 0; i < g_func_pp->argc; i++) {
3923 fprintf(fout, ", ");
3924 if (g_func_pp->arg[i].fptr != NULL) {
3926 pp = g_func_pp->arg[i].fptr;
3927 fprintf(fout, "%s (", pp->ret_type.name);
3928 output_pp_attrs(fout, pp, 0);
3929 fprintf(fout, "*a%d)(", i + 1);
3930 for (j = 0; j < pp->argc; j++) {
3932 fprintf(fout, ", ");
3933 if (pp->arg[j].fptr)
3934 ferr(ops, "nested fptr\n");
3935 fprintf(fout, "%s", pp->arg[j].type.name);
3937 if (pp->is_vararg) {
3939 fprintf(fout, ", ");
3940 fprintf(fout, "...");
3944 else if (g_func_pp->arg[i].type.is_retreg) {
3945 fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg);
3948 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
3951 if (g_func_pp->is_vararg) {
3953 fprintf(fout, ", ");
3954 fprintf(fout, "...");
3957 fprintf(fout, ")\n{\n");
3959 // declare indirect functions
3960 for (i = 0; i < opcnt; i++) {
3962 if (po->flags & OPF_RMD)
3965 if (po->op == OP_CALL) {
3968 ferr(po, "NULL pp\n");
3970 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
3971 if (pp->name[0] != 0) {
3972 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
3973 memcpy(pp->name, "i_", 2);
3975 // might be declared already
3977 for (j = 0; j < i; j++) {
3978 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
3979 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
3989 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
3991 fprintf(fout, " %s (", pp->ret_type.name);
3992 output_pp_attrs(fout, pp, 0);
3993 fprintf(fout, "*%s)(", pp->name);
3994 for (j = 0; j < pp->argc; j++) {
3996 fprintf(fout, ", ");
3997 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
3999 fprintf(fout, ");\n");
4004 // output LUTs/jumptables
4005 for (i = 0; i < g_func_pd_cnt; i++) {
4007 fprintf(fout, " static const ");
4008 if (pd->type == OPT_OFFSET) {
4009 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
4011 for (j = 0; j < pd->count; j++) {
4013 fprintf(fout, ", ");
4014 fprintf(fout, "&&%s", pd->d[j].u.label);
4018 fprintf(fout, "%s %s[] =\n { ",
4019 lmod_type_u(ops, pd->lmod), pd->label);
4021 for (j = 0; j < pd->count; j++) {
4023 fprintf(fout, ", ");
4024 fprintf(fout, "%u", pd->d[j].u.val);
4027 fprintf(fout, " };\n");
4031 // declare stack frame, va_arg
4033 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
4034 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
4038 if (g_func_pp->is_userstack) {
4039 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
4040 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
4044 if (g_func_pp->is_vararg) {
4045 fprintf(fout, " va_list ap;\n");
4049 // declare arg-registers
4050 for (i = 0; i < g_func_pp->argc; i++) {
4051 if (g_func_pp->arg[i].reg != NULL) {
4052 reg = char_array_i(regs_r32,
4053 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
4054 if (regmask & (1 << reg)) {
4055 if (g_func_pp->arg[i].type.is_retreg)
4056 fprintf(fout, " u32 %s = *r_%s;\n",
4057 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
4059 fprintf(fout, " u32 %s = (u32)a%d;\n",
4060 g_func_pp->arg[i].reg, i + 1);
4063 if (g_func_pp->arg[i].type.is_retreg)
4064 ferr(ops, "retreg '%s' is unused?\n",
4065 g_func_pp->arg[i].reg);
4066 fprintf(fout, " // %s = a%d; // unused\n",
4067 g_func_pp->arg[i].reg, i + 1);
4073 regmask_now = regmask & ~regmask_arg;
4074 regmask_now &= ~(1 << xSP);
4075 if (regmask_now & 0x00ff) {
4076 for (reg = 0; reg < 8; reg++) {
4077 if (regmask_now & (1 << reg)) {
4078 fprintf(fout, " u32 %s", regs_r32[reg]);
4079 if (regmask_init & (1 << reg))
4080 fprintf(fout, " = 0");
4081 fprintf(fout, ";\n");
4086 if (regmask_now & 0xff00) {
4087 for (reg = 8; reg < 16; reg++) {
4088 if (regmask_now & (1 << reg)) {
4089 fprintf(fout, " mmxr %s", regs_r32[reg]);
4090 if (regmask_init & (1 << reg))
4091 fprintf(fout, " = { 0, }");
4092 fprintf(fout, ";\n");
4099 for (reg = 0; reg < 8; reg++) {
4100 if (regmask_save & (1 << reg)) {
4101 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
4107 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
4108 if (save_arg_vars[i] == 0)
4110 for (reg = 0; reg < 32; reg++) {
4111 if (save_arg_vars[i] & (1 << reg)) {
4112 fprintf(fout, " u32 %s;\n",
4113 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
4120 for (i = 0; i < 8; i++) {
4121 if (cond_vars & (1 << i)) {
4122 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
4129 fprintf(fout, " u32 tmp;\n");
4134 fprintf(fout, " u64 tmp64;\n");
4139 fprintf(fout, "\n");
4141 if (g_func_pp->is_vararg) {
4142 if (g_func_pp->argc_stack == 0)
4143 ferr(ops, "vararg func without stack args?\n");
4144 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
4148 for (i = 0; i < opcnt; i++)
4150 if (g_labels[i][0] != 0) {
4151 fprintf(fout, "\n%s:\n", g_labels[i]);
4154 delayed_flag_op = NULL;
4155 last_arith_dst = NULL;
4159 if (po->flags & OPF_RMD)
4164 #define assert_operand_cnt(n_) \
4165 if (po->operand_cnt != n_) \
4166 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
4168 // conditional/flag using op?
4169 if (po->flags & OPF_CC)
4175 // we go through all this trouble to avoid using parsed_flag_op,
4176 // which makes generated code much nicer
4177 if (delayed_flag_op != NULL)
4179 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
4180 po->pfo, po->pfo_inv);
4183 else if (last_arith_dst != NULL
4184 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
4185 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
4188 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4189 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
4190 last_arith_dst->lmod, buf3);
4193 else if (tmp_op != NULL) {
4194 // use preprocessed flag calc results
4195 if (!(tmp_op->pfomask & (1 << po->pfo)))
4196 ferr(po, "not prepared for pfo %d\n", po->pfo);
4198 // note: pfo_inv was not yet applied
4199 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
4200 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
4203 ferr(po, "all methods of finding comparison failed\n");
4206 if (po->flags & OPF_JMP) {
4207 fprintf(fout, " if %s", buf1);
4209 else if (po->op == OP_RCL || po->op == OP_RCR
4210 || po->op == OP_ADC || po->op == OP_SBB)
4213 fprintf(fout, " cond_%s = %s;\n",
4214 parsed_flag_op_names[po->pfo], buf1);
4216 else if (po->flags & OPF_DATA) { // SETcc
4217 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
4218 fprintf(fout, " %s = %s;", buf2, buf1);
4221 ferr(po, "unhandled conditional op\n");
4225 pfomask = po->pfomask;
4227 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
4228 struct parsed_opr opr = {0,};
4231 opr.lmod = OPLM_DWORD;
4232 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
4234 if (ret != 1 || uval == 0) {
4235 // we need initial flags for ecx=0 case..
4236 if (i > 0 && ops[i - 1].op == OP_XOR
4237 && IS(ops[i - 1].operand[0].name,
4238 ops[i - 1].operand[1].name))
4240 fprintf(fout, " cond_z = ");
4241 if (pfomask & (1 << PFO_C))
4242 fprintf(fout, "cond_c = ");
4243 fprintf(fout, "0;\n");
4245 else if (last_arith_dst != NULL) {
4246 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4247 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
4248 last_arith_dst->lmod, buf3);
4249 fprintf(fout, " cond_z = %s;\n", buf1);
4252 ferr(po, "missing initial ZF\n");
4259 assert_operand_cnt(2);
4260 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4261 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4262 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
4263 fprintf(fout, " %s = %s;", buf1,
4264 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4269 assert_operand_cnt(2);
4270 po->operand[1].lmod = OPLM_DWORD; // always
4271 fprintf(fout, " %s = %s;",
4272 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4273 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4278 assert_operand_cnt(2);
4279 fprintf(fout, " %s = %s;",
4280 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4281 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4285 assert_operand_cnt(2);
4286 switch (po->operand[1].lmod) {
4288 strcpy(buf3, "(s8)");
4291 strcpy(buf3, "(s16)");
4294 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
4296 fprintf(fout, " %s = %s;",
4297 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4298 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4303 assert_operand_cnt(2);
4304 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4305 fprintf(fout, " tmp = %s;",
4306 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
4307 fprintf(fout, " %s = %s;",
4308 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4309 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4310 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4311 fprintf(fout, " %s = %stmp;",
4312 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
4313 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
4314 snprintf(g_comment, sizeof(g_comment), "xchg");
4318 assert_operand_cnt(1);
4319 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4320 fprintf(fout, " %s = ~%s;", buf1, buf1);
4324 assert_operand_cnt(2);
4325 fprintf(fout, " %s = (s32)%s >> 31;",
4326 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4327 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4328 strcpy(g_comment, "cdq");
4332 assert_operand_cnt(3);
4333 if (po->flags & OPF_REP) {
4338 fprintf(fout, " eax = %sesi; esi %c= %d;",
4339 lmod_cast_u_ptr(po, po->operand[0].lmod),
4340 (po->flags & OPF_DF) ? '-' : '+',
4341 lmod_bytes(po, po->operand[0].lmod));
4342 strcpy(g_comment, "lods");
4347 assert_operand_cnt(3);
4348 if (po->flags & OPF_REP) {
4349 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
4350 (po->flags & OPF_DF) ? '-' : '+',
4351 lmod_bytes(po, po->operand[0].lmod));
4352 fprintf(fout, " %sedi = eax;",
4353 lmod_cast_u_ptr(po, po->operand[0].lmod));
4354 strcpy(g_comment, "rep stos");
4357 fprintf(fout, " %sedi = eax; edi %c= %d;",
4358 lmod_cast_u_ptr(po, po->operand[0].lmod),
4359 (po->flags & OPF_DF) ? '-' : '+',
4360 lmod_bytes(po, po->operand[0].lmod));
4361 strcpy(g_comment, "stos");
4366 assert_operand_cnt(3);
4367 j = lmod_bytes(po, po->operand[0].lmod);
4368 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4369 l = (po->flags & OPF_DF) ? '-' : '+';
4370 if (po->flags & OPF_REP) {
4372 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
4375 " %sedi = %sesi;", buf1, buf1);
4376 strcpy(g_comment, "rep movs");
4379 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
4380 buf1, buf1, l, j, l, j);
4381 strcpy(g_comment, "movs");
4386 // repe ~ repeat while ZF=1
4387 assert_operand_cnt(3);
4388 j = lmod_bytes(po, po->operand[0].lmod);
4389 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4390 l = (po->flags & OPF_DF) ? '-' : '+';
4391 if (po->flags & OPF_REP) {
4393 " for (; ecx != 0; ecx--) {\n");
4394 if (pfomask & (1 << PFO_C)) {
4397 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4398 pfomask &= ~(1 << PFO_C);
4401 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4402 buf1, buf1, l, j, l, j);
4404 " if (cond_z %s 0) break;\n",
4405 (po->flags & OPF_REPZ) ? "==" : "!=");
4408 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4409 (po->flags & OPF_REPZ) ? "e" : "ne");
4413 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4414 buf1, buf1, l, j, l, j);
4415 strcpy(g_comment, "cmps");
4417 pfomask &= ~(1 << PFO_Z);
4418 last_arith_dst = NULL;
4419 delayed_flag_op = NULL;
4423 // only does ZF (for now)
4424 // repe ~ repeat while ZF=1
4425 assert_operand_cnt(3);
4426 j = lmod_bytes(po, po->operand[0].lmod);
4427 l = (po->flags & OPF_DF) ? '-' : '+';
4428 if (po->flags & OPF_REP) {
4430 " for (; ecx != 0; ecx--) {\n");
4432 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4433 lmod_cast_u(po, po->operand[0].lmod),
4434 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4436 " if (cond_z %s 0) break;\n",
4437 (po->flags & OPF_REPZ) ? "==" : "!=");
4440 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4441 (po->flags & OPF_REPZ) ? "e" : "ne");
4444 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4445 lmod_cast_u(po, po->operand[0].lmod),
4446 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4447 strcpy(g_comment, "scas");
4449 pfomask &= ~(1 << PFO_Z);
4450 last_arith_dst = NULL;
4451 delayed_flag_op = NULL;
4454 // arithmetic w/flags
4457 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4460 assert_operand_cnt(2);
4461 fprintf(fout, " %s %s= %s;",
4462 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4464 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4465 output_std_flags(fout, po, &pfomask, buf1);
4466 last_arith_dst = &po->operand[0];
4467 delayed_flag_op = NULL;
4472 assert_operand_cnt(2);
4473 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4474 if (pfomask & (1 << PFO_C)) {
4475 if (po->operand[1].type == OPT_CONST) {
4476 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4477 j = po->operand[1].val;
4480 if (po->op == OP_SHL)
4484 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
4488 ferr(po, "zero shift?\n");
4492 pfomask &= ~(1 << PFO_C);
4494 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
4495 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4496 output_std_flags(fout, po, &pfomask, buf1);
4497 last_arith_dst = &po->operand[0];
4498 delayed_flag_op = NULL;
4502 assert_operand_cnt(2);
4503 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4504 fprintf(fout, " %s = %s%s >> %s;", buf1,
4505 lmod_cast_s(po, po->operand[0].lmod), buf1,
4506 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4507 output_std_flags(fout, po, &pfomask, buf1);
4508 last_arith_dst = &po->operand[0];
4509 delayed_flag_op = NULL;
4513 assert_operand_cnt(3);
4514 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4515 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4516 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4517 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4518 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
4519 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
4520 buf1, buf3, buf1, buf2, l, buf3);
4521 strcpy(g_comment, "shrd");
4522 output_std_flags(fout, po, &pfomask, buf1);
4523 last_arith_dst = &po->operand[0];
4524 delayed_flag_op = NULL;
4529 assert_operand_cnt(2);
4530 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4531 if (po->operand[1].type == OPT_CONST) {
4532 j = po->operand[1].val;
4533 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
4534 fprintf(fout, po->op == OP_ROL ?
4535 " %s = (%s << %d) | (%s >> %d);" :
4536 " %s = (%s >> %d) | (%s << %d);",
4537 buf1, buf1, j, buf1,
4538 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
4542 output_std_flags(fout, po, &pfomask, buf1);
4543 last_arith_dst = &po->operand[0];
4544 delayed_flag_op = NULL;
4549 assert_operand_cnt(2);
4550 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4551 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4552 if (po->operand[1].type == OPT_CONST) {
4553 j = po->operand[1].val % l;
4555 ferr(po, "zero rotate\n");
4556 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
4557 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
4558 if (po->op == OP_RCL) {
4560 " %s = (%s << %d) | (cond_c << %d)",
4561 buf1, buf1, j, j - 1);
4563 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
4567 " %s = (%s >> %d) | (cond_c << %d)",
4568 buf1, buf1, j, l - j);
4570 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
4572 fprintf(fout, ";\n");
4573 fprintf(fout, " cond_c = tmp;");
4577 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
4578 output_std_flags(fout, po, &pfomask, buf1);
4579 last_arith_dst = &po->operand[0];
4580 delayed_flag_op = NULL;
4584 assert_operand_cnt(2);
4585 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4586 if (IS(opr_name(po, 0), opr_name(po, 1))) {
4587 // special case for XOR
4588 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
4589 fprintf(fout, " cond_be = 1;\n");
4590 pfomask &= ~(1 << PFO_BE);
4592 fprintf(fout, " %s = 0;",
4593 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4594 last_arith_dst = &po->operand[0];
4595 delayed_flag_op = NULL;
4601 assert_operand_cnt(2);
4602 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4603 if (pfomask & (1 << PFO_C)) {
4604 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4605 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4606 if (po->operand[0].lmod == OPLM_DWORD) {
4607 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
4608 fprintf(fout, " cond_c = tmp64 >> 32;\n");
4609 fprintf(fout, " %s = (u32)tmp64;",
4610 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4611 strcat(g_comment, "add64");
4614 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
4615 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
4616 fprintf(fout, " %s += %s;",
4617 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4620 pfomask &= ~(1 << PFO_C);
4621 output_std_flags(fout, po, &pfomask, buf1);
4622 last_arith_dst = &po->operand[0];
4623 delayed_flag_op = NULL;
4629 assert_operand_cnt(2);
4630 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4631 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
4632 for (j = 0; j <= PFO_LE; j++) {
4633 if (!(pfomask & (1 << j)))
4635 if (j == PFO_Z || j == PFO_S)
4638 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
4639 fprintf(fout, " cond_%s = %s;\n",
4640 parsed_flag_op_names[j], buf1);
4641 pfomask &= ~(1 << j);
4648 assert_operand_cnt(2);
4649 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4650 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4651 if (po->op == OP_SBB
4652 && IS(po->operand[0].name, po->operand[1].name))
4654 // avoid use of unitialized var
4655 fprintf(fout, " %s = -cond_c;", buf1);
4656 // carry remains what it was
4657 pfomask &= ~(1 << PFO_C);
4660 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
4661 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4663 output_std_flags(fout, po, &pfomask, buf1);
4664 last_arith_dst = &po->operand[0];
4665 delayed_flag_op = NULL;
4669 assert_operand_cnt(2);
4670 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4671 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
4672 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4674 output_std_flags(fout, po, &pfomask, buf1);
4675 last_arith_dst = &po->operand[0];
4676 delayed_flag_op = NULL;
4677 strcat(g_comment, "bsf");
4681 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
4682 for (j = 0; j <= PFO_LE; j++) {
4683 if (!(pfomask & (1 << j)))
4685 if (j == PFO_Z || j == PFO_S || j == PFO_C)
4688 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
4689 fprintf(fout, " cond_%s = %s;\n",
4690 parsed_flag_op_names[j], buf1);
4691 pfomask &= ~(1 << j);
4697 if (pfomask & (1 << PFO_C))
4698 // carry is unaffected by inc/dec.. wtf?
4699 ferr(po, "carry propagation needed\n");
4701 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4702 if (po->operand[0].type == OPT_REG) {
4703 strcpy(buf2, po->op == OP_INC ? "++" : "--");
4704 fprintf(fout, " %s%s;", buf1, buf2);
4707 strcpy(buf2, po->op == OP_INC ? "+" : "-");
4708 fprintf(fout, " %s %s= 1;", buf1, buf2);
4710 output_std_flags(fout, po, &pfomask, buf1);
4711 last_arith_dst = &po->operand[0];
4712 delayed_flag_op = NULL;
4716 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4717 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
4718 fprintf(fout, " %s = -%s%s;", buf1,
4719 lmod_cast_s(po, po->operand[0].lmod), buf2);
4720 last_arith_dst = &po->operand[0];
4721 delayed_flag_op = NULL;
4722 if (pfomask & (1 << PFO_C)) {
4723 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
4724 pfomask &= ~(1 << PFO_C);
4729 if (po->operand_cnt == 2) {
4730 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4733 if (po->operand_cnt == 3)
4734 ferr(po, "TODO imul3\n");
4737 assert_operand_cnt(1);
4738 switch (po->operand[0].lmod) {
4740 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
4741 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
4742 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
4743 fprintf(fout, " edx = tmp64 >> 32;\n");
4744 fprintf(fout, " eax = tmp64;");
4747 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
4748 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
4749 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
4753 ferr(po, "TODO: unhandled mul type\n");
4756 last_arith_dst = NULL;
4757 delayed_flag_op = NULL;
4762 assert_operand_cnt(1);
4763 if (po->operand[0].lmod != OPLM_DWORD)
4764 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
4766 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4767 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
4768 po->op == OP_IDIV));
4769 switch (po->operand[0].lmod) {
4771 if (po->flags & OPF_32BIT)
4772 snprintf(buf3, sizeof(buf3), "%seax", buf2);
4774 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
4775 snprintf(buf3, sizeof(buf3), "%stmp64",
4776 (po->op == OP_IDIV) ? "(s64)" : "");
4778 if (po->operand[0].type == OPT_REG
4779 && po->operand[0].reg == xDX)
4781 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4782 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4785 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4786 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4790 ferr(po, "unhandled division type\n");
4792 last_arith_dst = NULL;
4793 delayed_flag_op = NULL;
4798 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4800 for (j = 0; j < 8; j++) {
4801 if (pfomask & (1 << j)) {
4802 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
4803 fprintf(fout, " cond_%s = %s;",
4804 parsed_flag_op_names[j], buf1);
4811 last_arith_dst = NULL;
4812 delayed_flag_op = po;
4816 // SETcc - should already be handled
4819 // note: we reuse OP_Jcc for SETcc, only flags differ
4821 fprintf(fout, "\n goto %s;", po->operand[0].name);
4825 fprintf(fout, " if (ecx == 0)\n");
4826 fprintf(fout, " goto %s;", po->operand[0].name);
4827 strcat(g_comment, "jecxz");
4831 assert_operand_cnt(1);
4832 last_arith_dst = NULL;
4833 delayed_flag_op = NULL;
4835 if (po->operand[0].type == OPT_REGMEM) {
4836 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
4839 ferr(po, "parse failure for jmp '%s'\n",
4840 po->operand[0].name);
4841 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
4844 else if (po->operand[0].type != OPT_LABEL)
4845 ferr(po, "unhandled jmp type\n");
4847 fprintf(fout, " goto %s;", po->operand[0].name);
4851 assert_operand_cnt(1);
4853 my_assert_not(pp, NULL);
4856 if (po->flags & OPF_CC) {
4857 // we treat conditional branch to another func
4858 // (yes such code exists..) as conditional tailcall
4860 fprintf(fout, " {\n");
4863 if (pp->is_fptr && !pp->is_arg) {
4864 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
4865 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
4867 if (pp->is_unresolved)
4868 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
4869 buf3, asmfn, po->asmln, pp->name);
4872 fprintf(fout, "%s", buf3);
4873 if (strstr(pp->ret_type.name, "int64")) {
4874 if (po->flags & OPF_TAIL)
4875 ferr(po, "int64 and tail?\n");
4876 fprintf(fout, "tmp64 = ");
4878 else if (!IS(pp->ret_type.name, "void")) {
4879 if (po->flags & OPF_TAIL) {
4880 if (!IS(g_func_pp->ret_type.name, "void")) {
4881 fprintf(fout, "return ");
4882 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
4883 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
4886 else if (regmask & (1 << xAX)) {
4887 fprintf(fout, "eax = ");
4888 if (pp->ret_type.is_ptr)
4889 fprintf(fout, "(u32)");
4893 if (pp->name[0] == 0)
4894 ferr(po, "missing pp->name\n");
4895 fprintf(fout, "%s%s(", pp->name,
4896 pp->has_structarg ? "_sa" : "");
4898 if (po->flags & OPF_ATAIL) {
4899 if (pp->argc_stack != g_func_pp->argc_stack
4900 || (pp->argc_stack > 0
4901 && pp->is_stdcall != g_func_pp->is_stdcall))
4902 ferr(po, "incompatible tailcall\n");
4903 if (g_func_pp->has_retreg)
4904 ferr(po, "TODO: retreg+tailcall\n");
4906 for (arg = j = 0; arg < pp->argc; arg++) {
4908 fprintf(fout, ", ");
4911 if (pp->arg[arg].type.is_ptr)
4912 snprintf(cast, sizeof(cast), "(%s)",
4913 pp->arg[arg].type.name);
4915 if (pp->arg[arg].reg != NULL) {
4916 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4920 for (; j < g_func_pp->argc; j++)
4921 if (g_func_pp->arg[j].reg == NULL)
4923 fprintf(fout, "%sa%d", cast, j + 1);
4928 for (arg = 0; arg < pp->argc; arg++) {
4930 fprintf(fout, ", ");
4933 if (pp->arg[arg].type.is_ptr)
4934 snprintf(cast, sizeof(cast), "(%s)",
4935 pp->arg[arg].type.name);
4937 if (pp->arg[arg].reg != NULL) {
4938 if (pp->arg[arg].type.is_retreg)
4939 fprintf(fout, "&%s", pp->arg[arg].reg);
4941 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4946 tmp_op = pp->arg[arg].datap;
4948 ferr(po, "parsed_op missing for arg%d\n", arg);
4950 if (tmp_op->flags & OPF_VAPUSH) {
4951 fprintf(fout, "ap");
4953 else if (tmp_op->p_argpass != 0) {
4954 fprintf(fout, "a%d", tmp_op->p_argpass);
4956 else if (tmp_op->p_argnum != 0) {
4957 fprintf(fout, "%s%s", cast,
4958 saved_arg_name(buf1, sizeof(buf1),
4959 tmp_op->p_arggrp, tmp_op->p_argnum));
4963 out_src_opr(buf1, sizeof(buf1),
4964 tmp_op, &tmp_op->operand[0], cast, 0));
4968 fprintf(fout, ");");
4970 if (strstr(pp->ret_type.name, "int64")) {
4971 fprintf(fout, "\n");
4972 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
4973 fprintf(fout, "%seax = tmp64;", buf3);
4976 if (pp->is_unresolved) {
4977 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
4979 strcat(g_comment, buf2);
4982 if (po->flags & OPF_TAIL) {
4984 if (i == opcnt - 1 || pp->is_noreturn)
4986 else if (IS(pp->ret_type.name, "void"))
4988 else if (IS(g_func_pp->ret_type.name, "void"))
4990 // else already handled as 'return f()'
4993 if (!IS(g_func_pp->ret_type.name, "void")) {
4994 ferr(po, "int func -> void func tailcall?\n");
4997 fprintf(fout, "\n%sreturn;", buf3);
4998 strcat(g_comment, " ^ tailcall");
5002 strcat(g_comment, " tailcall");
5004 if (pp->is_noreturn)
5005 strcat(g_comment, " noreturn");
5006 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
5007 strcat(g_comment, " argframe");
5008 if (po->flags & OPF_CC)
5009 strcat(g_comment, " cond");
5011 if (po->flags & OPF_CC)
5012 fprintf(fout, "\n }");
5014 delayed_flag_op = NULL;
5015 last_arith_dst = NULL;
5019 if (g_func_pp->is_vararg)
5020 fprintf(fout, " va_end(ap);\n");
5021 if (g_func_pp->has_retreg) {
5022 for (arg = 0; arg < g_func_pp->argc; arg++)
5023 if (g_func_pp->arg[arg].type.is_retreg)
5024 fprintf(fout, " *r_%s = %s;\n",
5025 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
5028 if (IS(g_func_pp->ret_type.name, "void")) {
5029 if (i != opcnt - 1 || label_pending)
5030 fprintf(fout, " return;");
5032 else if (g_func_pp->ret_type.is_ptr) {
5033 fprintf(fout, " return (%s)eax;",
5034 g_func_pp->ret_type.name);
5036 else if (IS(g_func_pp->ret_type.name, "__int64"))
5037 fprintf(fout, " return ((u64)edx << 32) | eax;");
5039 fprintf(fout, " return eax;");
5041 last_arith_dst = NULL;
5042 delayed_flag_op = NULL;
5046 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5047 if (po->p_argnum != 0) {
5048 // special case - saved func arg
5049 fprintf(fout, " %s = %s;",
5050 saved_arg_name(buf2, sizeof(buf2),
5051 po->p_arggrp, po->p_argnum), buf1);
5054 else if (po->flags & OPF_RSAVE) {
5055 fprintf(fout, " s_%s = %s;", buf1, buf1);
5058 else if (g_func_pp->is_userstack) {
5059 fprintf(fout, " *(--esp) = %s;", buf1);
5062 if (!(g_ida_func_attr & IDAFA_NORETURN))
5063 ferr(po, "stray push encountered\n");
5068 if (po->flags & OPF_RSAVE) {
5069 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5070 fprintf(fout, " %s = s_%s;", buf1, buf1);
5073 else if (po->datap != NULL) {
5076 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5077 fprintf(fout, " %s = %s;", buf1,
5078 out_src_opr(buf2, sizeof(buf2),
5079 tmp_op, &tmp_op->operand[0],
5080 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5083 else if (g_func_pp->is_userstack) {
5084 fprintf(fout, " %s = *esp++;",
5085 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5089 ferr(po, "stray pop encountered\n");
5098 strcpy(g_comment, "(emms)");
5103 ferr(po, "unhandled op type %d, flags %x\n",
5108 if (g_comment[0] != 0) {
5109 char *p = g_comment;
5110 while (my_isblank(*p))
5112 fprintf(fout, " // %s", p);
5117 fprintf(fout, "\n");
5119 // some sanity checking
5120 if (po->flags & OPF_REP) {
5121 if (po->op != OP_STOS && po->op != OP_MOVS
5122 && po->op != OP_CMPS && po->op != OP_SCAS)
5123 ferr(po, "unexpected rep\n");
5124 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
5125 && (po->op == OP_CMPS || po->op == OP_SCAS))
5126 ferr(po, "cmps/scas with plain rep\n");
5128 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
5129 && po->op != OP_CMPS && po->op != OP_SCAS)
5130 ferr(po, "unexpected repz/repnz\n");
5133 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
5135 // see is delayed flag stuff is still valid
5136 if (delayed_flag_op != NULL && delayed_flag_op != po) {
5137 if (is_any_opr_modified(delayed_flag_op, po, 0))
5138 delayed_flag_op = NULL;
5141 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
5142 if (is_opr_modified(last_arith_dst, po))
5143 last_arith_dst = NULL;
5149 if (g_stack_fsz && !g_stack_frame_used)
5150 fprintf(fout, " (void)sf;\n");
5152 fprintf(fout, "}\n\n");
5155 for (i = 0; i < opcnt; i++) {
5156 struct label_ref *lr, *lr_del;
5158 lr = g_label_refs[i].next;
5159 while (lr != NULL) {
5164 g_label_refs[i].i = -1;
5165 g_label_refs[i].next = NULL;
5167 if (ops[i].op == OP_CALL) {
5169 proto_release(ops[i].pp);
5175 struct func_proto_dep;
5177 struct func_prototype {
5182 int has_ret:3; // -1, 0, 1: unresolved, no, yes
5183 unsigned int dep_resolved:1;
5184 unsigned int is_stdcall:1;
5185 struct func_proto_dep *dep_func;
5189 struct func_proto_dep {
5191 struct func_prototype *proto;
5192 int regmask_live; // .. at the time of call
5193 unsigned int ret_dep:1; // return from this is caller's return
5196 static struct func_prototype *hg_fp;
5197 static int hg_fp_cnt;
5199 static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
5204 for (i = 0; i < fp->dep_func_cnt; i++)
5205 if (IS(fp->dep_func[i].name, name))
5206 return &fp->dep_func[i];
5211 static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
5214 if (hg_fp_find_dep(fp, name))
5217 if ((fp->dep_func_cnt & 0xff) == 0) {
5218 fp->dep_func = realloc(fp->dep_func,
5219 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
5220 my_assert_not(fp->dep_func, NULL);
5221 memset(&fp->dep_func[fp->dep_func_cnt], 0,
5222 sizeof(fp->dep_func[0]) * 0x100);
5224 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
5228 static int hg_fp_cmp_name(const void *p1_, const void *p2_)
5230 const struct func_prototype *p1 = p1_, *p2 = p2_;
5231 return strcmp(p1->name, p2->name);
5235 static int hg_fp_cmp_id(const void *p1_, const void *p2_)
5237 const struct func_prototype *p1 = p1_, *p2 = p2_;
5238 return p1->id - p2->id;
5242 static void gen_hdr(const char *funcn, int opcnt)
5244 struct func_prototype *fp;
5245 struct func_proto_dep *dep;
5246 struct parsed_data *pd;
5247 struct parsed_op *po;
5248 int regmask_save = 0;
5249 int regmask_dst = 0;
5250 int regmask_dep = 0;
5251 int max_bp_offset = 0;
5253 int from_caller = 0;
5257 if ((hg_fp_cnt & 0xff) == 0) {
5258 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
5259 my_assert_not(hg_fp, NULL);
5260 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
5263 fp = &hg_fp[hg_fp_cnt];
5264 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
5270 // - resolve all branches
5271 for (i = 0; i < opcnt; i++)
5277 if (po->flags & OPF_RMD)
5280 if (po->op == OP_CALL) {
5281 if (po->operand[0].type == OPT_LABEL)
5282 hg_fp_add_dep(fp, opr_name(po, 0));
5287 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
5290 if (po->operand[0].type == OPT_REGMEM) {
5291 pd = try_resolve_jumptab(i, opcnt);
5299 for (l = 0; l < opcnt; l++) {
5300 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
5301 add_label_ref(&g_label_refs[l], i);
5307 if (po->bt_i != -1 || (po->flags & OPF_RMD))
5310 if (po->operand[0].type == OPT_LABEL)
5314 ferr(po, "unhandled branch\n");
5318 po->flags |= OPF_TAIL;
5319 if (i > 0 && ops[i - 1].op == OP_POP)
5320 po->flags |= OPF_ATAIL;
5325 // - remove dead labels
5326 for (i = 0; i < opcnt; i++)
5328 if (g_labels[i][0] != 0 && g_label_refs[i].i == -1)
5333 // - track saved regs
5334 // - try to figure out arg-regs
5335 for (i = 0; i < opcnt; i++)
5338 if (po->flags & OPF_RMD)
5341 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
5343 reg = po->operand[0].reg;
5345 ferr(po, "reg not set for push?\n");
5348 ret = scan_for_pop(i + 1, opcnt,
5349 po->operand[0].name, i + opcnt * 1, 0, &depth, 0);
5351 regmask_save |= 1 << reg;
5352 po->flags |= OPF_RMD;
5353 scan_for_pop(i + 1, opcnt,
5354 po->operand[0].name, i + opcnt * 2, 0, &depth, 1);
5357 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
5359 regmask_save |= 1 << reg;
5360 po->flags |= OPF_RMD;
5361 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, OPF_RMD);
5365 else if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST) {
5366 for (j = i + 1; j < opcnt; j++) {
5367 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
5368 || ops[j].op == OP_PUSH || g_labels[i][0] != 0)
5373 if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP)
5375 po->flags |= OPF_RMD;
5382 else if (po->op == OP_CALL) {
5383 po->regmask_dst |= 1 << xAX;
5385 dep = hg_fp_find_dep(fp, po->operand[0].name);
5387 dep->regmask_live = regmask_save | regmask_dst;
5389 else if (po->op == OP_RET) {
5390 if (po->operand_cnt > 0)
5394 if (has_ret != 0 && (po->flags & OPF_TAIL)) {
5395 if (po->op == OP_CALL) {
5400 struct parsed_opr opr = { 0, };
5405 ret = resolve_origin(i, &opr, i + opcnt * 3, &j, &from_caller);
5408 if (ret == -1 && from_caller) {
5409 // unresolved eax - probably void func
5413 if (ops[j].op == OP_CALL) {
5414 dep = hg_fp_find_dep(fp, po->operand[0].name);
5425 l = po->regmask_src & ~(regmask_save | regmask_dst);
5428 fnote(po, "dep |= %04x, dst %04x, save %04x\n", l,
5429 regmask_dst, regmask_save);
5432 regmask_dst |= po->regmask_dst;
5435 if (has_ret == -1 && (regmask_dep & (1 << xAX)))
5438 for (i = 0; i < g_eqcnt; i++)
5439 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
5440 max_bp_offset = g_eqs[i].offset;
5442 if (max_bp_offset > 0) {
5443 max_bp_offset = (max_bp_offset + 3) & ~3;
5444 fp->argc_stack = max_bp_offset / 4 - 1;
5445 if (!(g_ida_func_attr & IDAFA_BP_FRAME))
5449 fp->regmask_dep = regmask_dep & ~(1 << xSP);
5450 fp->has_ret = has_ret;
5453 static void hg_fp_resolve_deps(struct func_prototype *fp)
5455 struct func_prototype fp_s;
5458 // this thing is recursive, so mark first..
5459 fp->dep_resolved = 1;
5461 for (i = 0; i < fp->dep_func_cnt; i++) {
5462 strcpy(fp_s.name, fp->dep_func[i].name);
5463 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
5464 sizeof(hg_fp[0]), hg_fp_cmp_name);
5465 if (fp->dep_func[i].proto != NULL) {
5466 if (!fp->dep_func[i].proto->dep_resolved)
5467 hg_fp_resolve_deps(fp->dep_func[i].proto);
5469 fp->regmask_dep |= ~fp->dep_func[i].regmask_live
5470 & fp->dep_func[i].proto->regmask_dep;
5472 if (fp->has_ret == -1)
5473 fp->has_ret = fp->dep_func[i].proto->has_ret;
5478 static void output_hdr(FILE *fout)
5480 struct func_prototype *fp;
5481 int had_usercall = 0;
5487 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
5488 for (i = 0; i < hg_fp_cnt; i++)
5489 hg_fp_resolve_deps(&hg_fp[i]);
5491 // note: messes up .proto ptr, don't use
5492 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
5494 for (i = 0; i < hg_fp_cnt; i++) {
5496 if (fp->has_ret == -1)
5497 fprintf(fout, "// ret unresolved\n");
5499 fprintf(fout, "// dep:");
5500 for (j = 0; j < fp->dep_func_cnt; j++) {
5501 fprintf(fout, " %s/", fp->dep_func[j].name);
5502 if (fp->dep_func[j].proto != NULL)
5503 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
5504 fp->dep_func[j].proto->has_ret);
5506 fprintf(fout, "\n");
5509 regmask_dep = fp->regmask_dep;
5510 argc_stack = fp->argc_stack;
5512 fprintf(fout, fp->has_ret ? "int " : "void ");
5513 if (regmask_dep && (fp->is_stdcall || argc_stack == 0)
5514 && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0)
5516 fprintf(fout, "__fastcall ");
5518 fprintf(fout, " "); // align
5519 if (!(regmask_dep & (1 << xDX)) && argc_stack == 0)
5525 else if (regmask_dep && !fp->is_stdcall) {
5526 fprintf(fout, "/*__usercall*/ ");
5529 else if (regmask_dep) {
5530 fprintf(fout, "/*__userpurge*/ ");
5533 else if (fp->is_stdcall)
5534 fprintf(fout, "__stdcall ");
5536 fprintf(fout, "__cdecl ");
5538 fprintf(fout, "%s(", fp->name);
5541 for (j = 0; j < xSP; j++) {
5542 if (regmask_dep & (1 << j)) {
5545 fprintf(fout, ", ");
5546 fprintf(fout, "int a%d/*<%s>*/", arg, regs_r32[j]);
5550 for (j = 0; j < argc_stack; j++) {
5553 fprintf(fout, ", ");
5554 fprintf(fout, "int a%d", arg);
5557 fprintf(fout, ");\n");
5561 static void set_label(int i, const char *name)
5567 p = strchr(name, ':');
5571 if (len > sizeof(g_labels[0]) - 1)
5572 aerr("label '%s' too long: %d\n", name, len);
5573 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
5574 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
5575 memcpy(g_labels[i], name, len);
5576 g_labels[i][len] = 0;
5579 // '=' needs special treatment..
5580 static char *next_word_s(char *w, size_t wsize, char *s)
5586 for (i = 0; i < wsize - 1; i++) {
5587 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
5593 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
5594 printf("warning: '%s' truncated\n", w);
5605 static struct chunk_item *func_chunks;
5606 static int func_chunk_cnt;
5607 static int func_chunk_alloc;
5609 static void add_func_chunk(FILE *fasm, const char *name, int line)
5611 if (func_chunk_cnt >= func_chunk_alloc) {
5612 func_chunk_alloc *= 2;
5613 func_chunks = realloc(func_chunks,
5614 func_chunk_alloc * sizeof(func_chunks[0]));
5615 my_assert_not(func_chunks, NULL);
5617 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
5618 func_chunks[func_chunk_cnt].name = strdup(name);
5619 func_chunks[func_chunk_cnt].asmln = line;
5623 static int cmp_chunks(const void *p1, const void *p2)
5625 const struct chunk_item *c1 = p1, *c2 = p2;
5626 return strcmp(c1->name, c2->name);
5629 static int cmpstringp(const void *p1, const void *p2)
5631 return strcmp(*(char * const *)p1, *(char * const *)p2);
5634 static void scan_ahead(FILE *fasm)
5644 oldpos = ftell(fasm);
5647 while (fgets(line, sizeof(line), fasm))
5658 // get rid of random tabs
5659 for (i = 0; line[i] != 0; i++)
5660 if (line[i] == '\t')
5663 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5666 next_word(words[0], sizeof(words[0]), p);
5667 if (words[0][0] == 0)
5668 aerr("missing name for func chunk?\n");
5670 add_func_chunk(fasm, words[0], asmln);
5672 else if (IS_START(p, "; sctend"))
5678 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5679 words[wordc][0] = 0;
5680 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5681 if (*p == 0 || *p == ';') {
5687 if (wordc == 2 && IS(words[1], "ends"))
5691 fseek(fasm, oldpos, SEEK_SET);
5695 int main(int argc, char *argv[])
5697 FILE *fout, *fasm, *frlist;
5698 struct parsed_data *pd = NULL;
5700 char **rlist = NULL;
5702 int rlist_alloc = 0;
5703 int func_chunks_used = 0;
5704 int func_chunks_sorted = 0;
5705 int func_chunk_i = -1;
5706 long func_chunk_ret = 0;
5707 int func_chunk_ret_ln = 0;
5708 int scanned_ahead = 0;
5710 char words[20][256];
5711 enum opr_lenmod lmod;
5712 char *sctproto = NULL;
5714 int pending_endp = 0;
5716 int skip_warned = 0;
5717 int header_mode = 0;
5730 for (arg = 1; arg < argc; arg++) {
5731 if (IS(argv[arg], "-v"))
5733 else if (IS(argv[arg], "-rf"))
5734 g_allow_regfunc = 1;
5735 else if (IS(argv[arg], "-m"))
5737 else if (IS(argv[arg], "-hdr"))
5738 header_mode = g_quiet_pp = 1;
5743 if (argc < arg + 3) {
5744 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdrf> [rlist]*\n"
5745 "%s -hdr <.h> <.asm> <seed_hdrf> [rlist]*\n",
5752 asmfn = argv[arg++];
5753 fasm = fopen(asmfn, "r");
5754 my_assert_not(fasm, NULL);
5756 hdrfn = argv[arg++];
5757 g_fhdr = fopen(hdrfn, "r");
5758 my_assert_not(g_fhdr, NULL);
5761 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
5762 my_assert_not(rlist, NULL);
5763 // needs special handling..
5764 rlist[rlist_len++] = "__alloca_probe";
5766 func_chunk_alloc = 32;
5767 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
5768 my_assert_not(func_chunks, NULL);
5770 memset(words, 0, sizeof(words));
5772 for (; arg < argc; arg++) {
5773 frlist = fopen(argv[arg], "r");
5774 my_assert_not(frlist, NULL);
5776 while (fgets(line, sizeof(line), frlist)) {
5778 if (*p == 0 || *p == ';')
5781 if (IS_START(p, "#if 0")
5782 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
5786 else if (IS_START(p, "#endif"))
5793 p = next_word(words[0], sizeof(words[0]), p);
5794 if (words[0][0] == 0)
5797 if (rlist_len >= rlist_alloc) {
5798 rlist_alloc = rlist_alloc * 2 + 64;
5799 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
5800 my_assert_not(rlist, NULL);
5802 rlist[rlist_len++] = strdup(words[0]);
5811 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
5813 fout = fopen(argv[arg_out], "w");
5814 my_assert_not(fout, NULL);
5817 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
5818 my_assert_not(g_eqs, NULL);
5820 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
5821 g_label_refs[i].i = -1;
5822 g_label_refs[i].next = NULL;
5825 while (fgets(line, sizeof(line), fasm))
5834 // get rid of random tabs
5835 for (i = 0; line[i] != 0; i++)
5836 if (line[i] == '\t')
5841 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
5842 goto do_pending_endp; // eww..
5844 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
5846 static const char *attrs[] = {
5855 // parse IDA's attribute-list comment
5856 g_ida_func_attr = 0;
5859 for (; *p != 0; p = sskip(p)) {
5860 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
5861 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
5862 g_ida_func_attr |= 1 << i;
5863 p += strlen(attrs[i]);
5867 if (i == ARRAY_SIZE(attrs)) {
5868 anote("unparsed IDA attr: %s\n", p);
5871 if (IS(attrs[i], "fpd=")) {
5872 p = next_word(words[0], sizeof(words[0]), p);
5877 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5880 next_word(words[0], sizeof(words[0]), p);
5881 if (words[0][0] == 0)
5882 aerr("missing name for func chunk?\n");
5884 if (!scanned_ahead) {
5885 add_func_chunk(fasm, words[0], asmln);
5886 func_chunks_sorted = 0;
5889 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
5891 if (func_chunk_i >= 0) {
5892 if (func_chunk_i < func_chunk_cnt
5893 && IS(func_chunks[func_chunk_i].name, g_func))
5895 // move on to next chunk
5896 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5898 aerr("seek failed for '%s' chunk #%d\n",
5899 g_func, func_chunk_i);
5900 asmln = func_chunks[func_chunk_i].asmln;
5904 if (func_chunk_ret == 0)
5905 aerr("no return from chunk?\n");
5906 fseek(fasm, func_chunk_ret, SEEK_SET);
5907 asmln = func_chunk_ret_ln;
5913 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
5914 func_chunks_used = 1;
5916 if (IS_START(g_func, "sub_")) {
5917 unsigned long addr = strtoul(p, NULL, 16);
5918 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
5919 if (addr > f_addr && !scanned_ahead) {
5920 anote("scan_ahead caused by '%s', addr %lx\n",
5924 func_chunks_sorted = 0;
5932 for (i = wordc; i < ARRAY_SIZE(words); i++)
5934 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5935 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5936 if (*p == 0 || *p == ';') {
5941 if (*p != 0 && *p != ';')
5942 aerr("too many words\n");
5944 // alow asm patches in comments
5946 if (IS_START(p, "; sctpatch:")) {
5948 if (*p == 0 || *p == ';')
5950 goto parse_words; // lame
5952 if (IS_START(p, "; sctproto:")) {
5953 sctproto = strdup(p + 11);
5955 else if (IS_START(p, "; sctend")) {
5964 awarn("wordc == 0?\n");
5968 // don't care about this:
5969 if (words[0][0] == '.'
5970 || IS(words[0], "include")
5971 || IS(words[0], "assume") || IS(words[1], "segment")
5972 || IS(words[0], "align"))
5978 // do delayed endp processing to collect switch jumptables
5980 if (in_func && !skip_func && !end && wordc >= 2
5981 && ((words[0][0] == 'd' && words[0][2] == 0)
5982 || (words[1][0] == 'd' && words[1][2] == 0)))
5985 if (words[1][0] == 'd' && words[1][2] == 0) {
5987 if (g_func_pd_cnt >= pd_alloc) {
5988 pd_alloc = pd_alloc * 2 + 16;
5989 g_func_pd = realloc(g_func_pd,
5990 sizeof(g_func_pd[0]) * pd_alloc);
5991 my_assert_not(g_func_pd, NULL);
5993 pd = &g_func_pd[g_func_pd_cnt];
5995 memset(pd, 0, sizeof(*pd));
5996 strcpy(pd->label, words[0]);
5997 pd->type = OPT_CONST;
5998 pd->lmod = lmod_from_directive(words[1]);
6004 anote("skipping alignment byte?\n");
6007 lmod = lmod_from_directive(words[0]);
6008 if (lmod != pd->lmod)
6009 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
6012 if (pd->count_alloc < pd->count + wordc) {
6013 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
6014 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
6015 my_assert_not(pd->d, NULL);
6017 for (; i < wordc; i++) {
6018 if (IS(words[i], "offset")) {
6019 pd->type = OPT_OFFSET;
6022 p = strchr(words[i], ',');
6025 if (pd->type == OPT_OFFSET)
6026 pd->d[pd->count].u.label = strdup(words[i]);
6028 pd->d[pd->count].u.val = parse_number(words[i]);
6029 pd->d[pd->count].bt_i = -1;
6035 if (in_func && !skip_func) {
6037 gen_hdr(g_func, pi);
6039 gen_func(fout, g_fhdr, g_func, pi);
6044 g_ida_func_attr = 0;
6048 func_chunks_used = 0;
6051 memset(&ops, 0, pi * sizeof(ops[0]));
6052 memset(g_labels, 0, pi * sizeof(g_labels[0]));
6056 for (i = 0; i < g_func_pd_cnt; i++) {
6058 if (pd->type == OPT_OFFSET) {
6059 for (j = 0; j < pd->count; j++)
6060 free(pd->d[j].u.label);
6074 if (IS(words[1], "proc")) {
6076 aerr("proc '%s' while in_func '%s'?\n",
6079 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
6081 strcpy(g_func, words[0]);
6082 set_label(0, words[0]);
6087 if (IS(words[1], "endp"))
6090 aerr("endp '%s' while not in_func?\n", words[0]);
6091 if (!IS(g_func, words[0]))
6092 aerr("endp '%s' while in_func '%s'?\n",
6095 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
6096 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
6102 if (!skip_func && func_chunks_used) {
6103 // start processing chunks
6104 struct chunk_item *ci, key = { g_func, 0 };
6106 func_chunk_ret = ftell(fasm);
6107 func_chunk_ret_ln = asmln;
6108 if (!func_chunks_sorted) {
6109 qsort(func_chunks, func_chunk_cnt,
6110 sizeof(func_chunks[0]), cmp_chunks);
6111 func_chunks_sorted = 1;
6113 ci = bsearch(&key, func_chunks, func_chunk_cnt,
6114 sizeof(func_chunks[0]), cmp_chunks);
6116 aerr("'%s' needs chunks, but none found\n", g_func);
6117 func_chunk_i = ci - func_chunks;
6118 for (; func_chunk_i > 0; func_chunk_i--)
6119 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
6122 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
6124 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
6125 asmln = func_chunks[func_chunk_i].asmln;
6133 if (wordc == 2 && IS(words[1], "ends")) {
6137 goto do_pending_endp;
6141 // scan for next text segment
6142 while (fgets(line, sizeof(line), fasm)) {
6145 if (*p == 0 || *p == ';')
6148 if (strstr(p, "segment para public 'CODE' use32"))
6155 p = strchr(words[0], ':');
6157 set_label(pi, words[0]);
6161 if (!in_func || skip_func) {
6162 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
6164 anote("skipping from '%s'\n", g_labels[pi]);
6167 g_labels[pi][0] = 0;
6171 if (wordc > 1 && IS(words[1], "="))
6174 aerr("unhandled equ, wc=%d\n", wordc);
6175 if (g_eqcnt >= eq_alloc) {
6177 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
6178 my_assert_not(g_eqs, NULL);
6181 len = strlen(words[0]);
6182 if (len > sizeof(g_eqs[0].name) - 1)
6183 aerr("equ name too long: %d\n", len);
6184 strcpy(g_eqs[g_eqcnt].name, words[0]);
6186 if (!IS(words[3], "ptr"))
6187 aerr("unhandled equ\n");
6188 if (IS(words[2], "dword"))
6189 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
6190 else if (IS(words[2], "word"))
6191 g_eqs[g_eqcnt].lmod = OPLM_WORD;
6192 else if (IS(words[2], "byte"))
6193 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
6194 else if (IS(words[2], "qword"))
6195 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
6197 aerr("bad lmod: '%s'\n", words[2]);
6199 g_eqs[g_eqcnt].offset = parse_number(words[4]);
6204 if (pi >= ARRAY_SIZE(ops))
6205 aerr("too many ops\n");
6207 parse_op(&ops[pi], words, wordc);
6209 if (sctproto != NULL) {
6210 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
6211 ops[pi].datap = sctproto;
6227 // vim:ts=2:shiftwidth=2:expandtab