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"
18 #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
19 #define IS(w, y) !strcmp(w, y)
20 #define IS_START(w, y) !strncmp(w, y, strlen(y))
22 #include "protoparse.h"
24 static const char *asmfn;
28 #define anote(fmt, ...) \
29 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
30 #define awarn(fmt, ...) \
31 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
32 #define aerr(fmt, ...) do { \
33 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
38 #include "masm_tools.h"
41 OPF_RMD = (1 << 0), /* removed from code generation */
42 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
43 OPF_FLAGS = (1 << 2), /* sets flags */
44 OPF_JMP = (1 << 3), /* branch, call */
45 OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz) */
46 OPF_CC = (1 << 5), /* uses flags */
47 OPF_TAIL = (1 << 6), /* ret or tail call */
48 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
49 OPF_REP = (1 << 8), /* prefixed by rep */
50 OPF_REPZ = (1 << 9), /* rep is repe/repz */
51 OPF_REPNZ = (1 << 10), /* rep is repne/repnz */
52 OPF_FARG = (1 << 11), /* push collected as func arg */
53 OPF_FARGNR = (1 << 12), /* push collected as func arg (no reuse) */
54 OPF_EBP_S = (1 << 13), /* ebp used as scratch here, not BP */
55 OPF_DF = (1 << 14), /* DF flag set */
56 OPF_ATAIL = (1 << 15), /* tail call with reused arg frame */
57 OPF_32BIT = (1 << 16), /* 32bit division */
58 OPF_LOCK = (1 << 17), /* op has lock prefix */
59 OPF_VAPUSH = (1 << 18), /* vararg ptr push (as call arg) */
60 OPF_DONE = (1 << 19), /* already fully handled by analysis */
61 OPF_PPUSH = (1 << 20), /* part of complex push-pop graph */
131 // must be sorted (larger len must be further in enum)
140 #define MAX_OPERANDS 3
145 enum opr_lenmod lmod;
146 unsigned int is_ptr:1; // pointer in C
147 unsigned int is_array:1; // array in C
148 unsigned int type_from_var:1; // .. in header, sometimes wrong
149 unsigned int size_mismatch:1; // type override differs from C
150 unsigned int size_lt:1; // type override is larger than C
151 unsigned int had_ds:1; // had ds: prefix
152 const struct parsed_proto *pp; // for OPT_LABEL
160 struct parsed_opr operand[MAX_OPERANDS];
163 unsigned char pfo_inv;
164 unsigned char operand_cnt;
165 unsigned char p_argnum; // arg push: altered before call arg #
166 unsigned char p_arggrp; // arg push: arg group # for above
167 unsigned char p_argpass;// arg push: arg of host func
168 short p_argnext;// arg push: same arg pushed elsewhere or -1
169 int regmask_src; // all referensed regs
171 int pfomask; // flagop: parsed_flag_op that can't be delayed
172 int cc_scratch; // scratch storage during analysis
173 int bt_i; // branch target for branches
174 struct parsed_data *btj;// branch targets for jumptables
175 struct parsed_proto *pp;// parsed_proto for OP_CALL
181 // OP_CALL - parser proto hint (str)
182 // (OPF_CC) - points to one of (OPF_FLAGS) that affects cc op
183 // OP_PUSH - points to OP_POP in complex push/pop graph
184 // OP_POP - points to OP_PUSH in simple push/pop pair
188 enum opr_lenmod lmod;
195 enum opr_lenmod lmod;
209 struct label_ref *next;
213 IDAFA_BP_FRAME = (1 << 0),
214 IDAFA_LIB_FUNC = (1 << 1),
215 IDAFA_STATIC = (1 << 2),
216 IDAFA_NORETURN = (1 << 3),
217 IDAFA_THUNK = (1 << 4),
218 IDAFA_FPD = (1 << 5),
221 // note: limited to 32k due to p_argnext
223 #define MAX_ARG_GRP 2
225 static struct parsed_op ops[MAX_OPS];
226 static struct parsed_equ *g_eqs;
228 static char *g_labels[MAX_OPS];
229 static struct label_ref g_label_refs[MAX_OPS];
230 static const struct parsed_proto *g_func_pp;
231 static struct parsed_data *g_func_pd;
232 static int g_func_pd_cnt;
233 static char g_func[256];
234 static char g_comment[256];
235 static int g_bp_frame;
236 static int g_sp_frame;
237 static int g_stack_frame_used;
238 static int g_stack_fsz;
239 static int g_ida_func_attr;
240 static int g_skip_func;
241 static int g_allow_regfunc;
242 static int g_quiet_pp;
243 static int g_header_mode;
245 #define ferr(op_, fmt, ...) do { \
246 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
247 dump_op(op_), ##__VA_ARGS__); \
251 #define fnote(op_, fmt, ...) \
252 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
253 dump_op(op_), ##__VA_ARGS__)
255 #define ferr_assert(op_, cond) do { \
256 if (!(cond)) ferr(op_, "assertion '%s' failed on ln :%d\n", #cond, \
260 const char *regs_r32[] = {
261 "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp",
262 // not r32, but list here for easy parsing and printing
263 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7",
265 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
266 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
267 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
269 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
271 // possible basic comparison types (without inversion)
272 enum parsed_flag_op {
276 PFO_BE, // 6 CF=1||ZF=1
280 PFO_LE, // e ZF=1||SF!=OF
283 #define PFOB_O (1 << PFO_O)
284 #define PFOB_C (1 << PFO_C)
285 #define PFOB_Z (1 << PFO_Z)
286 #define PFOB_S (1 << PFO_S)
288 static const char *parsed_flag_op_names[] = {
289 "o", "c", "z", "be", "s", "p", "l", "le"
292 static int char_array_i(const char *array[], size_t len, const char *s)
296 for (i = 0; i < len; i++)
303 static void printf_number(char *buf, size_t buf_size,
304 unsigned long number)
306 // output in C-friendly form
307 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
310 static int check_segment_prefix(const char *s)
312 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
326 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
330 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
332 *reg_lmod = OPLM_QWORD;
336 *reg_lmod = OPLM_DWORD;
339 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
341 *reg_lmod = OPLM_WORD;
344 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
346 *reg_lmod = OPLM_BYTE;
349 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
351 *reg_lmod = OPLM_BYTE;
358 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
360 enum opr_lenmod lmod;
373 while (my_isblank(*s))
375 for (; my_issep(*s); d++, s++)
377 while (my_isblank(*s))
381 // skip '?s:' prefixes
382 if (check_segment_prefix(s))
385 s = next_idt(w, sizeof(w), s);
390 reg = parse_reg(&lmod, w);
392 *regmask |= 1 << reg;
396 if ('0' <= w[0] && w[0] <= '9') {
397 number = parse_number(w);
398 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
402 // probably some label/identifier - pass
405 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
409 strcpy(name, cvtbuf);
414 static int is_reg_in_str(const char *s)
418 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
421 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
422 if (!strncmp(s, regs_r32[i], 3))
428 static const char *parse_stack_el(const char *name, char *extra_reg,
431 const char *p, *p2, *s;
437 if (g_bp_frame || early_try)
440 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
442 if (extra_reg != NULL) {
443 strncpy(extra_reg, name, 3);
448 if (IS_START(p, "ebp+")) {
452 if (p2 != NULL && is_reg_in_str(p)) {
453 if (extra_reg != NULL) {
454 strncpy(extra_reg, p, p2 - p);
455 extra_reg[p2 - p] = 0;
460 if (!('0' <= *p && *p <= '9'))
467 if (!IS_START(name, "esp+"))
473 if (is_reg_in_str(s)) {
474 if (extra_reg != NULL) {
475 strncpy(extra_reg, s, p - s);
476 extra_reg[p - s] = 0;
481 aerr("%s IDA stackvar not set?\n", __func__);
483 if (!('0' <= *s && *s <= '9')) {
484 aerr("%s IDA stackvar offset not set?\n", __func__);
487 if (s[0] == '0' && s[1] == 'x')
490 if (len < sizeof(buf) - 1) {
491 strncpy(buf, s, len);
493 val = strtol(buf, &endp, 16);
494 if (val == 0 || *endp != 0) {
495 aerr("%s num parse fail for '%s'\n", __func__, buf);
504 if ('0' <= *p && *p <= '9')
510 static int guess_lmod_from_name(struct parsed_opr *opr)
512 if (!strncmp(opr->name, "dword_", 6)) {
513 opr->lmod = OPLM_DWORD;
516 if (!strncmp(opr->name, "word_", 5)) {
517 opr->lmod = OPLM_WORD;
520 if (!strncmp(opr->name, "byte_", 5)) {
521 opr->lmod = OPLM_BYTE;
524 if (!strncmp(opr->name, "qword_", 6)) {
525 opr->lmod = OPLM_QWORD;
531 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
532 const struct parsed_type *c_type)
534 static const char *dword_types[] = {
535 "uint32_t", "int", "_DWORD", "UINT_PTR", "DWORD",
536 "WPARAM", "LPARAM", "UINT", "__int32",
537 "LONG", "HIMC", "BOOL", "size_t",
540 static const char *word_types[] = {
541 "uint16_t", "int16_t", "_WORD", "WORD",
542 "unsigned __int16", "__int16",
544 static const char *byte_types[] = {
545 "uint8_t", "int8_t", "char",
546 "unsigned __int8", "__int8", "BYTE", "_BYTE",
548 // structures.. deal the same as with _UNKNOWN for now
554 if (c_type->is_ptr) {
559 n = skip_type_mod(c_type->name);
561 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
562 if (IS(n, dword_types[i])) {
568 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
569 if (IS(n, word_types[i])) {
575 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
576 if (IS(n, byte_types[i])) {
585 static char *default_cast_to(char *buf, size_t buf_size,
586 struct parsed_opr *opr)
592 if (opr->pp == NULL || opr->pp->type.name == NULL
595 snprintf(buf, buf_size, "%s", "(void *)");
599 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
603 static enum opr_type lmod_from_directive(const char *d)
607 else if (IS(d, "dw"))
609 else if (IS(d, "db"))
612 aerr("unhandled directive: '%s'\n", d);
616 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
622 *regmask |= 1 << reg;
625 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
628 static int parse_operand(struct parsed_opr *opr,
629 int *regmask, int *regmask_indirect,
630 char words[16][256], int wordc, int w, unsigned int op_flags)
632 const struct parsed_proto *pp = NULL;
633 enum opr_lenmod tmplmod;
634 unsigned long number;
642 aerr("parse_operand w %d, wordc %d\n", w, wordc);
646 for (i = w; i < wordc; i++) {
647 len = strlen(words[i]);
648 if (words[i][len - 1] == ',') {
649 words[i][len - 1] = 0;
655 wordc_in = wordc - w;
657 if ((op_flags & OPF_JMP) && wordc_in > 0
658 && !('0' <= words[w][0] && words[w][0] <= '9'))
660 const char *label = NULL;
662 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
663 && IS(words[w + 1], "ptr"))
664 label = words[w + 2];
665 else if (wordc_in == 2 && IS(words[w], "short"))
666 label = words[w + 1];
667 else if (wordc_in == 1
668 && strchr(words[w], '[') == NULL
669 && parse_reg(&tmplmod, words[w]) < 0)
673 opr->type = OPT_LABEL;
674 ret = check_segment_prefix(label);
677 aerr("fs/gs used\n");
681 strcpy(opr->name, label);
687 if (IS(words[w + 1], "ptr")) {
688 if (IS(words[w], "dword"))
689 opr->lmod = OPLM_DWORD;
690 else if (IS(words[w], "word"))
691 opr->lmod = OPLM_WORD;
692 else if (IS(words[w], "byte"))
693 opr->lmod = OPLM_BYTE;
694 else if (IS(words[w], "qword"))
695 opr->lmod = OPLM_QWORD;
697 aerr("type parsing failed\n");
699 wordc_in = wordc - w;
704 if (IS(words[w], "offset")) {
705 opr->type = OPT_OFFSET;
706 opr->lmod = OPLM_DWORD;
707 strcpy(opr->name, words[w + 1]);
708 pp = proto_parse(g_fhdr, opr->name, 1);
711 if (IS(words[w], "(offset")) {
712 p = strchr(words[w + 1], ')');
714 aerr("parse of bracketed offset failed\n");
716 opr->type = OPT_OFFSET;
717 strcpy(opr->name, words[w + 1]);
723 aerr("parse_operand 1 word expected\n");
725 ret = check_segment_prefix(words[w]);
728 aerr("fs/gs used\n");
730 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
732 strcpy(opr->name, words[w]);
734 if (words[w][0] == '[') {
735 opr->type = OPT_REGMEM;
736 ret = sscanf(words[w], "[%[^]]]", opr->name);
738 aerr("[] parse failure\n");
740 parse_indmode(opr->name, regmask_indirect, 1);
741 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1))
744 struct parsed_equ *eq =
745 equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i);
747 opr->lmod = eq->lmod;
751 else if (strchr(words[w], '[')) {
753 p = strchr(words[w], '[');
754 opr->type = OPT_REGMEM;
755 parse_indmode(p, regmask_indirect, 0);
756 strncpy(buf, words[w], p - words[w]);
757 buf[p - words[w]] = 0;
758 pp = proto_parse(g_fhdr, buf, 1);
761 else if (('0' <= words[w][0] && words[w][0] <= '9')
762 || words[w][0] == '-')
764 number = parse_number(words[w]);
765 opr->type = OPT_CONST;
767 printf_number(opr->name, sizeof(opr->name), number);
771 ret = parse_reg(&tmplmod, opr->name);
773 setup_reg_opr(opr, ret, tmplmod, regmask);
777 // most likely var in data segment
778 opr->type = OPT_LABEL;
779 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
783 if (pp->is_fptr || pp->is_func) {
784 opr->lmod = OPLM_DWORD;
788 tmplmod = OPLM_UNSPEC;
789 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
790 anote("unhandled C type '%s' for '%s'\n",
791 pp->type.name, opr->name);
793 if (opr->lmod == OPLM_UNSPEC) {
795 opr->type_from_var = 1;
797 else if (opr->lmod != tmplmod) {
798 opr->size_mismatch = 1;
799 if (tmplmod < opr->lmod)
802 opr->is_ptr = pp->type.is_ptr;
804 opr->is_array = pp->type.is_array;
808 if (opr->lmod == OPLM_UNSPEC)
809 guess_lmod_from_name(opr);
813 static const struct {
818 { "repe", OPF_REP|OPF_REPZ },
819 { "repz", OPF_REP|OPF_REPZ },
820 { "repne", OPF_REP|OPF_REPNZ },
821 { "repnz", OPF_REP|OPF_REPNZ },
822 { "lock", OPF_LOCK }, // ignored for now..
825 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
827 static const struct {
830 unsigned short minopr;
831 unsigned short maxopr;
834 unsigned char pfo_inv;
836 { "nop", OP_NOP, 0, 0, 0 },
837 { "push", OP_PUSH, 1, 1, 0 },
838 { "pop", OP_POP, 1, 1, OPF_DATA },
839 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
840 { "mov" , OP_MOV, 2, 2, OPF_DATA },
841 { "lea", OP_LEA, 2, 2, OPF_DATA },
842 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
843 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
844 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
845 { "not", OP_NOT, 1, 1, OPF_DATA },
846 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
847 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
848 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
849 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
850 { "stosb",OP_STOS, 0, 0, OPF_DATA },
851 { "stosw",OP_STOS, 0, 0, OPF_DATA },
852 { "stosd",OP_STOS, 0, 0, OPF_DATA },
853 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
854 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
855 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
856 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
857 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
858 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
859 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
860 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
861 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
862 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
863 { "cld", OP_CLD, 0, 0, OPF_DATA },
864 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
865 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
866 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
867 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
868 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
869 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
870 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
871 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
872 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
873 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
874 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
875 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
876 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
877 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
878 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
879 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
880 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
881 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
882 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
883 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
884 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
885 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
886 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
887 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
888 { "test", OP_TEST, 2, 2, OPF_FLAGS },
889 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
890 { "retn", OP_RET, 0, 1, OPF_TAIL },
891 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
892 { "jmp", OP_JMP, 1, 1, OPF_JMP },
893 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
894 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
895 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
896 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
897 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
898 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
899 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
900 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
901 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
902 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
903 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
904 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
905 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
906 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
907 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
908 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
909 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
910 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
911 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
912 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
913 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
914 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
915 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
916 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
917 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
918 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
919 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
920 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
921 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
922 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
923 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
924 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
925 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
926 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
927 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
928 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
929 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
930 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
931 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
932 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
933 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
934 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
935 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
936 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
937 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
938 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
939 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
940 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
941 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
942 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
943 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
944 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
945 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
946 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
947 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
948 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
949 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
950 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
951 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
954 { "emms", OP_EMMS, 0, 0, OPF_DATA },
955 { "movq", OP_MOV, 2, 2, OPF_DATA },
960 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
962 enum opr_lenmod lmod = OPLM_UNSPEC;
963 int prefix_flags = 0;
971 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
972 if (IS(words[w], pref_table[i].name)) {
973 prefix_flags = pref_table[i].flags;
980 aerr("lone prefix: '%s'\n", words[0]);
985 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
986 if (IS(words[w], op_table[i].name))
990 if (i == ARRAY_SIZE(op_table)) {
992 aerr("unhandled op: '%s'\n", words[0]);
997 op->op = op_table[i].op;
998 op->flags = op_table[i].flags | prefix_flags;
999 op->pfo = op_table[i].pfo;
1000 op->pfo_inv = op_table[i].pfo_inv;
1001 op->regmask_src = op->regmask_dst = 0;
1004 if (op->op == OP_UD2)
1007 for (opr = 0; opr < op_table[i].maxopr; opr++) {
1008 if (opr >= op_table[i].minopr && w >= wordc)
1011 regmask = regmask_ind = 0;
1012 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
1013 words, wordc, w, op->flags);
1015 if (opr == 0 && (op->flags & OPF_DATA))
1016 op->regmask_dst = regmask;
1018 op->regmask_src |= regmask;
1019 op->regmask_src |= regmask_ind;
1023 aerr("parse_op %s incomplete: %d/%d\n",
1024 words[0], w, wordc);
1027 op->operand_cnt = opr;
1028 if (!strncmp(op_table[i].name, "set", 3))
1029 op->operand[0].lmod = OPLM_BYTE;
1032 // first operand is not dst
1035 op->regmask_src |= op->regmask_dst;
1036 op->regmask_dst = 0;
1039 // first operand is src too
1051 op->regmask_src |= op->regmask_dst;
1056 op->regmask_src |= op->regmask_dst;
1057 op->regmask_dst |= op->regmask_src;
1063 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1064 && op->operand[0].lmod == op->operand[1].lmod
1065 && op->operand[0].reg == op->operand[1].reg
1066 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1068 op->regmask_src = 0;
1071 op->regmask_src |= op->regmask_dst;
1074 // ops with implicit argumets
1076 op->operand_cnt = 2;
1077 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
1078 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
1084 if (op->operand_cnt != 0)
1086 if (words[op_w][4] == 'b')
1088 else if (words[op_w][4] == 'w')
1090 else if (words[op_w][4] == 'd')
1092 op->operand_cnt = 3;
1093 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
1094 lmod, &op->regmask_src);
1095 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
1096 op->regmask_dst = op->regmask_src;
1097 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
1098 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1103 if (op->operand_cnt != 0)
1105 if (words[op_w][4] == 'b')
1107 else if (words[op_w][4] == 'w')
1109 else if (words[op_w][4] == 'd')
1111 op->operand_cnt = 3;
1112 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
1113 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
1114 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
1115 op->regmask_dst = op->regmask_src;
1119 op->operand_cnt = 1;
1120 op->regmask_src = 1 << xCX;
1121 op->operand[0].type = OPT_REG;
1122 op->operand[0].reg = xCX;
1123 op->operand[0].lmod = OPLM_DWORD;
1127 if (op->operand_cnt != 1)
1132 op->regmask_src |= op->regmask_dst;
1133 op->regmask_dst = (1 << xDX) | (1 << xAX);
1134 if (op->operand[0].lmod == OPLM_UNSPEC)
1135 op->operand[0].lmod = OPLM_DWORD;
1140 // we could set up operands for edx:eax, but there is no real need to
1141 // (see is_opr_modified())
1142 op->regmask_src |= op->regmask_dst;
1143 op->regmask_dst = (1 << xDX) | (1 << xAX);
1144 if (op->operand[0].lmod == OPLM_UNSPEC)
1145 op->operand[0].lmod = OPLM_DWORD;
1153 op->regmask_src |= op->regmask_dst;
1154 if (op->operand[1].lmod == OPLM_UNSPEC)
1155 op->operand[1].lmod = OPLM_BYTE;
1159 op->regmask_src |= op->regmask_dst;
1160 if (op->operand[2].lmod == OPLM_UNSPEC)
1161 op->operand[2].lmod = OPLM_BYTE;
1165 op->regmask_src |= op->regmask_dst;
1166 op->regmask_dst = 0;
1167 if (op->operand[0].lmod == OPLM_UNSPEC
1168 && (op->operand[0].type == OPT_CONST
1169 || op->operand[0].type == OPT_OFFSET
1170 || op->operand[0].type == OPT_LABEL))
1171 op->operand[0].lmod = OPLM_DWORD;
1177 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1178 && op->operand[0].lmod == op->operand[1].lmod
1179 && op->operand[0].reg == op->operand[1].reg
1180 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1182 op->flags |= OPF_RMD | OPF_DONE;
1183 op->regmask_src = op->regmask_dst = 0;
1188 if (op->operand[0].type == OPT_REG
1189 && op->operand[1].type == OPT_REGMEM)
1192 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1193 if (IS(buf, op->operand[1].name))
1194 op->flags |= OPF_RMD | OPF_DONE;
1199 // trashed regs must be explicitly detected later
1200 op->regmask_dst = 0;
1204 op->regmask_dst = (1 << xBP) | (1 << xSP);
1205 op->regmask_src = 1 << xBP;
1213 static const char *op_name(struct parsed_op *po)
1215 static char buf[16];
1219 if (po->op == OP_JCC || po->op == OP_SCC) {
1221 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1224 strcpy(p, parsed_flag_op_names[po->pfo]);
1228 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1229 if (op_table[i].op == po->op)
1230 return op_table[i].name;
1236 static const char *dump_op(struct parsed_op *po)
1238 static char out[128];
1245 snprintf(out, sizeof(out), "%s", op_name(po));
1246 for (i = 0; i < po->operand_cnt; i++) {
1250 snprintf(p, sizeof(out) - (p - out),
1251 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1252 po->operand[i].name);
1258 static const char *lmod_type_u(struct parsed_op *po,
1259 enum opr_lenmod lmod)
1271 ferr(po, "invalid lmod: %d\n", lmod);
1272 return "(_invalid_)";
1276 static const char *lmod_cast_u(struct parsed_op *po,
1277 enum opr_lenmod lmod)
1289 ferr(po, "invalid lmod: %d\n", lmod);
1290 return "(_invalid_)";
1294 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1295 enum opr_lenmod lmod)
1307 ferr(po, "invalid lmod: %d\n", lmod);
1308 return "(_invalid_)";
1312 static const char *lmod_cast_s(struct parsed_op *po,
1313 enum opr_lenmod lmod)
1325 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1326 return "(_invalid_)";
1330 static const char *lmod_cast(struct parsed_op *po,
1331 enum opr_lenmod lmod, int is_signed)
1334 lmod_cast_s(po, lmod) :
1335 lmod_cast_u(po, lmod);
1338 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1350 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1355 static const char *opr_name(struct parsed_op *po, int opr_num)
1357 if (opr_num >= po->operand_cnt)
1358 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1359 return po->operand[opr_num].name;
1362 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1364 if (opr_num >= po->operand_cnt)
1365 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1366 if (po->operand[opr_num].type != OPT_CONST)
1367 ferr(po, "opr %d: const expected\n", opr_num);
1368 return po->operand[opr_num].val;
1371 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1373 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1374 ferr(po, "invalid reg: %d\n", popr->reg);
1375 return regs_r32[popr->reg];
1378 // cast1 is the "final" cast
1379 static const char *simplify_cast(const char *cast1, const char *cast2)
1381 static char buf[256];
1387 if (IS(cast1, cast2))
1389 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1391 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1393 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1395 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1397 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1400 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1404 static const char *simplify_cast_num(const char *cast, unsigned int val)
1406 if (IS(cast, "(u8)") && val < 0x100)
1408 if (IS(cast, "(s8)") && val < 0x80)
1410 if (IS(cast, "(u16)") && val < 0x10000)
1412 if (IS(cast, "(s16)") && val < 0x8000)
1414 if (IS(cast, "(s32)") && val < 0x80000000)
1420 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1429 namelen = strlen(name);
1431 p = strchr(name, '+');
1435 ferr(po, "equ parse failed for '%s'\n", name);
1437 if (IS_START(p, "0x"))
1439 *extra_offs = strtol(p, &endp, 16);
1441 ferr(po, "equ parse failed for '%s'\n", name);
1444 for (i = 0; i < g_eqcnt; i++)
1445 if (strncmp(g_eqs[i].name, name, namelen) == 0
1446 && g_eqs[i].name[namelen] == 0)
1450 ferr(po, "unresolved equ name: '%s'\n", name);
1457 static int is_stack_access(struct parsed_op *po,
1458 const struct parsed_opr *popr)
1460 return (parse_stack_el(popr->name, NULL, 0)
1461 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1462 && IS_START(popr->name, "ebp")));
1465 static void parse_stack_access(struct parsed_op *po,
1466 const char *name, char *ofs_reg, int *offset_out,
1467 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1469 const char *bp_arg = "";
1470 const char *p = NULL;
1471 struct parsed_equ *eq;
1478 if (IS_START(name, "ebp-")
1479 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1482 if (IS_START(p, "0x"))
1484 offset = strtoul(p, &endp, 16);
1488 ferr(po, "ebp- parse of '%s' failed\n", name);
1491 bp_arg = parse_stack_el(name, ofs_reg, 0);
1492 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1493 eq = equ_find(po, bp_arg, &offset);
1495 ferr(po, "detected but missing eq\n");
1496 offset += eq->offset;
1499 if (!strncmp(name, "ebp", 3))
1502 // yes it sometimes LEAs ra for compares..
1503 if (!is_lea && ofs_reg[0] == 0
1504 && stack_ra <= offset && offset < stack_ra + 4)
1506 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1509 *offset_out = offset;
1510 *stack_ra_out = stack_ra;
1512 *bp_arg_out = bp_arg;
1515 static int stack_frame_access(struct parsed_op *po,
1516 struct parsed_opr *popr, char *buf, size_t buf_size,
1517 const char *name, const char *cast, int is_src, int is_lea)
1519 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1520 const char *prefix = "";
1521 const char *bp_arg = NULL;
1522 char ofs_reg[16] = { 0, };
1523 int i, arg_i, arg_s;
1531 if (po->flags & OPF_EBP_S)
1532 ferr(po, "stack_frame_access while ebp is scratch\n");
1534 parse_stack_access(po, name, ofs_reg, &offset,
1535 &stack_ra, &bp_arg, is_lea);
1537 if (offset > stack_ra)
1539 arg_i = (offset - stack_ra - 4) / 4;
1540 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1542 if (g_func_pp->is_vararg
1543 && arg_i == g_func_pp->argc_stack && is_lea)
1545 // should be va_list
1548 snprintf(buf, buf_size, "%sap", cast);
1551 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1552 offset, bp_arg, arg_i);
1554 if (ofs_reg[0] != 0)
1555 ferr(po, "offset reg on arg access?\n");
1557 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1558 if (g_func_pp->arg[i].reg != NULL)
1564 if (i == g_func_pp->argc)
1565 ferr(po, "arg %d not in prototype?\n", arg_i);
1567 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1574 ferr(po, "lea/byte to arg?\n");
1575 if (is_src && (offset & 3) == 0)
1576 snprintf(buf, buf_size, "%sa%d",
1577 simplify_cast(cast, "(u8)"), i + 1);
1579 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1580 cast, offset & 3, i + 1);
1585 ferr(po, "lea/word to arg?\n");
1590 ferr(po, "problematic arg store\n");
1591 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1592 simplify_cast(cast, "*(u16 *)"), i + 1);
1595 ferr(po, "unaligned arg word load\n");
1597 else if (is_src && (offset & 2) == 0)
1598 snprintf(buf, buf_size, "%sa%d",
1599 simplify_cast(cast, "(u16)"), i + 1);
1601 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1602 cast, (offset & 2) ? "HI" : "LO", i + 1);
1614 snprintf(buf, buf_size, "(u32)&a%d + %d",
1617 ferr(po, "unaligned arg store\n");
1619 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1620 snprintf(buf, buf_size, "%s(a%d >> %d)",
1621 prefix, i + 1, (offset & 3) * 8);
1625 snprintf(buf, buf_size, "%s%sa%d",
1626 prefix, is_lea ? "&" : "", i + 1);
1631 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1635 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1638 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1639 if (tmp_lmod != OPLM_DWORD
1640 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1641 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1643 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1644 i + 1, offset, g_func_pp->arg[i].type.name);
1646 // can't check this because msvc likes to reuse
1647 // arg space for scratch..
1648 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1649 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1653 if (g_stack_fsz == 0)
1654 ferr(po, "stack var access without stackframe\n");
1655 g_stack_frame_used = 1;
1657 sf_ofs = g_stack_fsz + offset;
1658 lim = (ofs_reg[0] != 0) ? -4 : 0;
1659 if (offset > 0 || sf_ofs < lim)
1660 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1670 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1671 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1675 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1676 // known unaligned or possibly unaligned
1677 strcat(g_comment, " unaligned");
1679 prefix = "*(u16 *)&";
1680 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1681 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1684 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1688 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1689 // known unaligned or possibly unaligned
1690 strcat(g_comment, " unaligned");
1692 prefix = "*(u32 *)&";
1693 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1694 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1697 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1701 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1708 static void check_func_pp(struct parsed_op *po,
1709 const struct parsed_proto *pp, const char *pfx)
1711 enum opr_lenmod tmp_lmod;
1715 if (pp->argc_reg != 0) {
1716 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1717 pp_print(buf, sizeof(buf), pp);
1718 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1720 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1721 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1722 pfx, pp->argc_reg, pp->argc_stack);
1725 // fptrs must use 32bit args, callsite might have no information and
1726 // lack a cast to smaller types, which results in incorrectly masked
1727 // args passed (callee may assume masked args, it does on ARM)
1728 if (!pp->is_osinc) {
1729 for (i = 0; i < pp->argc; i++) {
1730 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1731 if (ret && tmp_lmod != OPLM_DWORD)
1732 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1733 i + 1, pp->arg[i].type.name);
1738 static const char *check_label_read_ref(struct parsed_op *po,
1741 const struct parsed_proto *pp;
1743 pp = proto_parse(g_fhdr, name, 0);
1745 ferr(po, "proto_parse failed for ref '%s'\n", name);
1748 check_func_pp(po, pp, "ref");
1753 static char *out_src_opr(char *buf, size_t buf_size,
1754 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1757 char tmp1[256], tmp2[256];
1766 switch (popr->type) {
1769 ferr(po, "lea from reg?\n");
1771 switch (popr->lmod) {
1773 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
1776 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1779 snprintf(buf, buf_size, "%s%s",
1780 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1783 if (popr->name[1] == 'h') // XXX..
1784 snprintf(buf, buf_size, "%s(%s >> 8)",
1785 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1787 snprintf(buf, buf_size, "%s%s",
1788 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1791 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1796 if (is_stack_access(po, popr)) {
1797 stack_frame_access(po, popr, buf, buf_size,
1798 popr->name, cast, 1, is_lea);
1802 strcpy(expr, popr->name);
1803 if (strchr(expr, '[')) {
1804 // special case: '[' can only be left for label[reg] form
1805 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1807 ferr(po, "parse failure for '%s'\n", expr);
1808 if (tmp1[0] == '(') {
1809 // (off_4FFF50+3)[eax]
1810 p = strchr(tmp1 + 1, ')');
1811 if (p == NULL || p[1] != 0)
1812 ferr(po, "parse failure (2) for '%s'\n", expr);
1814 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1816 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1819 // XXX: do we need more parsing?
1821 snprintf(buf, buf_size, "%s", expr);
1825 snprintf(buf, buf_size, "%s(%s)",
1826 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1830 name = check_label_read_ref(po, popr->name);
1831 if (cast[0] == 0 && popr->is_ptr)
1835 snprintf(buf, buf_size, "(u32)&%s", name);
1836 else if (popr->size_lt)
1837 snprintf(buf, buf_size, "%s%s%s%s", cast,
1838 lmod_cast_u_ptr(po, popr->lmod),
1839 popr->is_array ? "" : "&", name);
1841 snprintf(buf, buf_size, "%s%s%s", cast, name,
1842 popr->is_array ? "[0]" : "");
1846 name = check_label_read_ref(po, popr->name);
1850 ferr(po, "lea an offset?\n");
1851 snprintf(buf, buf_size, "%s&%s", cast, name);
1856 ferr(po, "lea from const?\n");
1858 printf_number(tmp1, sizeof(tmp1), popr->val);
1859 if (popr->val == 0 && strchr(cast, '*'))
1860 snprintf(buf, buf_size, "NULL");
1862 snprintf(buf, buf_size, "%s%s",
1863 simplify_cast_num(cast, popr->val), tmp1);
1867 ferr(po, "invalid src type: %d\n", popr->type);
1873 // note: may set is_ptr (we find that out late for ebp frame..)
1874 static char *out_dst_opr(char *buf, size_t buf_size,
1875 struct parsed_op *po, struct parsed_opr *popr)
1877 switch (popr->type) {
1879 switch (popr->lmod) {
1881 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
1884 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1888 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1892 if (popr->name[1] == 'h') // XXX..
1893 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1895 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1898 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1903 if (is_stack_access(po, popr)) {
1904 stack_frame_access(po, popr, buf, buf_size,
1905 popr->name, "", 0, 0);
1909 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1912 if (popr->size_mismatch)
1913 snprintf(buf, buf_size, "%s%s%s",
1914 lmod_cast_u_ptr(po, popr->lmod),
1915 popr->is_array ? "" : "&", popr->name);
1917 snprintf(buf, buf_size, "%s%s", popr->name,
1918 popr->is_array ? "[0]" : "");
1922 ferr(po, "invalid dst type: %d\n", popr->type);
1928 static char *out_src_opr_u32(char *buf, size_t buf_size,
1929 struct parsed_op *po, struct parsed_opr *popr)
1931 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1934 static void out_test_for_cc(char *buf, size_t buf_size,
1935 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1936 enum opr_lenmod lmod, const char *expr)
1938 const char *cast, *scast;
1940 cast = lmod_cast_u(po, lmod);
1941 scast = lmod_cast_s(po, lmod);
1945 case PFO_BE: // CF=1||ZF=1; CF=0
1946 snprintf(buf, buf_size, "(%s%s %s 0)",
1947 cast, expr, is_inv ? "!=" : "==");
1951 case PFO_L: // SF!=OF; OF=0
1952 snprintf(buf, buf_size, "(%s%s %s 0)",
1953 scast, expr, is_inv ? ">=" : "<");
1956 case PFO_LE: // ZF=1||SF!=OF; OF=0
1957 snprintf(buf, buf_size, "(%s%s %s 0)",
1958 scast, expr, is_inv ? ">" : "<=");
1962 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1966 static void out_cmp_for_cc(char *buf, size_t buf_size,
1967 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1969 const char *cast, *scast, *cast_use;
1970 char buf1[256], buf2[256];
1971 enum opr_lenmod lmod;
1973 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
1974 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1975 po->operand[0].lmod, po->operand[1].lmod);
1976 lmod = po->operand[0].lmod;
1978 cast = lmod_cast_u(po, lmod);
1979 scast = lmod_cast_s(po, lmod);
1995 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1998 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1999 if (po->op == OP_DEC)
2000 snprintf(buf2, sizeof(buf2), "1");
2002 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
2006 // note: must be unsigned compare
2007 snprintf(buf, buf_size, "(%s %s %s)",
2008 buf1, is_inv ? ">=" : "<", buf2);
2012 snprintf(buf, buf_size, "(%s %s %s)",
2013 buf1, is_inv ? "!=" : "==", buf2);
2017 // note: must be unsigned compare
2018 snprintf(buf, buf_size, "(%s %s %s)",
2019 buf1, is_inv ? ">" : "<=", buf2);
2022 if (is_inv && lmod == OPLM_BYTE
2023 && po->operand[1].type == OPT_CONST
2024 && po->operand[1].val == 0xff)
2026 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2027 snprintf(buf, buf_size, "(0)");
2031 // note: must be signed compare
2033 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2034 scast, buf1, buf2, is_inv ? ">=" : "<");
2038 snprintf(buf, buf_size, "(%s %s %s)",
2039 buf1, is_inv ? ">=" : "<", buf2);
2043 snprintf(buf, buf_size, "(%s %s %s)",
2044 buf1, is_inv ? ">" : "<=", buf2);
2052 static void out_cmp_test(char *buf, size_t buf_size,
2053 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2055 char buf1[256], buf2[256], buf3[256];
2057 if (po->op == OP_TEST) {
2058 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2059 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2062 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2063 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2064 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2066 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2067 po->operand[0].lmod, buf3);
2069 else if (po->op == OP_CMP) {
2070 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
2073 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2076 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2077 struct parsed_opr *popr2)
2079 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2080 ferr(po, "missing lmod for both operands\n");
2082 if (popr1->lmod == OPLM_UNSPEC)
2083 popr1->lmod = popr2->lmod;
2084 else if (popr2->lmod == OPLM_UNSPEC)
2085 popr2->lmod = popr1->lmod;
2086 else if (popr1->lmod != popr2->lmod) {
2087 if (popr1->type_from_var) {
2088 popr1->size_mismatch = 1;
2089 if (popr1->lmod < popr2->lmod)
2091 popr1->lmod = popr2->lmod;
2093 else if (popr2->type_from_var) {
2094 popr2->size_mismatch = 1;
2095 if (popr2->lmod < popr1->lmod)
2097 popr2->lmod = popr1->lmod;
2100 ferr(po, "conflicting lmods: %d vs %d\n",
2101 popr1->lmod, popr2->lmod);
2105 static const char *op_to_c(struct parsed_op *po)
2129 ferr(po, "op_to_c was supplied with %d\n", po->op);
2133 static void op_set_clear_flag(struct parsed_op *po,
2134 enum op_flags flag_set, enum op_flags flag_clear)
2136 po->flags |= flag_set;
2137 po->flags &= ~flag_clear;
2140 // last op in stream - unconditional branch or ret
2141 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2142 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2143 && ops[_i].op != OP_CALL))
2145 #define check_i(po, i) \
2147 ferr(po, "bad " #i ": %d\n", i)
2149 static int scan_for_pop(int i, int opcnt, const char *reg,
2150 int magic, int depth, int *maxdepth, int do_flags)
2152 const struct parsed_proto *pp;
2153 struct parsed_op *po;
2157 for (; i < opcnt; i++) {
2159 if (po->cc_scratch == magic)
2160 break; // already checked
2161 po->cc_scratch = magic;
2163 if (po->flags & OPF_TAIL) {
2164 if (po->op == OP_CALL) {
2165 pp = proto_parse(g_fhdr, po->operand[0].name, g_quiet_pp);
2166 if (pp != NULL && pp->is_noreturn)
2167 // no stack cleanup for noreturn
2170 return -1; // deadend
2173 if ((po->flags & (OPF_RMD|OPF_DONE))
2174 || (po->op == OP_PUSH && po->p_argnum != 0)) // arg push
2177 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2178 if (po->btj != NULL) {
2180 for (j = 0; j < po->btj->count; j++) {
2181 check_i(po, po->btj->d[j].bt_i);
2182 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
2183 depth, maxdepth, do_flags);
2185 return ret; // dead end
2190 check_i(po, po->bt_i);
2191 if (po->flags & OPF_CJMP) {
2192 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2193 depth, maxdepth, do_flags);
2195 return ret; // dead end
2203 if ((po->op == OP_POP || po->op == OP_PUSH)
2204 && po->operand[0].type == OPT_REG
2205 && IS(po->operand[0].name, reg))
2207 if (po->op == OP_PUSH && !(po->flags & OPF_FARGNR)) {
2209 if (depth > *maxdepth)
2212 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2214 else if (po->op == OP_POP) {
2217 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2222 if (depth < 0) // should not happen
2223 ferr(po, "fail with depth\n");
2225 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2234 // scan for pop starting from 'ret' op (all paths)
2235 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2241 for (; i < opcnt; i++) {
2242 if (!(ops[i].flags & OPF_TAIL))
2245 for (j = i - 1; j >= 0; j--) {
2246 if (ops[j].flags & (OPF_RMD|OPF_DONE))
2248 if (ops[j].flags & OPF_JMP)
2251 if (ops[j].op == OP_POP && ops[j].datap == NULL
2252 && ops[j].operand[0].type == OPT_REG
2253 && IS(ops[j].operand[0].name, reg))
2256 ops[j].flags |= flag_set;
2260 if (g_labels[j] != NULL)
2265 return found ? 0 : -1;
2268 static void scan_for_pop_const(int i, int opcnt, int *regmask_pp)
2270 struct parsed_op *po;
2271 int is_multipath = 0;
2274 for (j = i + 1; j < opcnt; j++) {
2277 if (po->op == OP_JMP && po->btj == NULL) {
2278 ferr_assert(po, po->bt_i >= 0);
2283 if ((po->flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
2284 || po->op == OP_PUSH)
2289 if (g_labels[j] != NULL)
2292 if (po->op == OP_POP && !(po->flags & OPF_RMD))
2294 is_multipath |= !!(po->flags & OPF_PPUSH);
2296 ops[i].flags |= OPF_PPUSH | OPF_DONE;
2298 po->flags |= OPF_PPUSH | OPF_DONE;
2299 *regmask_pp |= 1 << po->operand[0].reg;
2302 ops[i].flags |= OPF_RMD | OPF_DONE;
2303 po->flags |= OPF_DONE;
2304 po->datap = &ops[i];
2311 static void scan_propagate_df(int i, int opcnt)
2313 struct parsed_op *po = &ops[i];
2316 for (; i < opcnt; i++) {
2318 if (po->flags & OPF_DF)
2319 return; // already resolved
2320 po->flags |= OPF_DF;
2322 if (po->op == OP_CALL)
2323 ferr(po, "call with DF set?\n");
2325 if (po->flags & OPF_JMP) {
2326 if (po->btj != NULL) {
2328 for (j = 0; j < po->btj->count; j++) {
2329 check_i(po, po->btj->d[j].bt_i);
2330 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2335 check_i(po, po->bt_i);
2336 if (po->flags & OPF_CJMP)
2337 scan_propagate_df(po->bt_i, opcnt);
2343 if (po->flags & OPF_TAIL)
2346 if (po->op == OP_CLD) {
2347 po->flags |= OPF_RMD | OPF_DONE;
2352 ferr(po, "missing DF clear?\n");
2355 // is operand 'opr' referenced by parsed_op 'po'?
2356 static int is_opr_referenced(const struct parsed_opr *opr,
2357 const struct parsed_op *po)
2361 if (opr->type == OPT_REG) {
2362 mask = po->regmask_dst | po->regmask_src;
2363 if (po->op == OP_CALL)
2364 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX);
2365 if ((1 << opr->reg) & mask)
2371 for (i = 0; i < po->operand_cnt; i++)
2372 if (IS(po->operand[0].name, opr->name))
2378 // is operand 'opr' read by parsed_op 'po'?
2379 static int is_opr_read(const struct parsed_opr *opr,
2380 const struct parsed_op *po)
2384 if (opr->type == OPT_REG) {
2385 mask = po->regmask_src;
2386 if (po->op == OP_CALL)
2387 // assume worst case
2388 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX);
2389 if ((1 << opr->reg) & mask)
2399 // is operand 'opr' modified by parsed_op 'po'?
2400 static int is_opr_modified(const struct parsed_opr *opr,
2401 const struct parsed_op *po)
2405 if (!(po->flags & OPF_DATA))
2408 if (opr->type == OPT_REG) {
2409 if (po->op == OP_CALL) {
2410 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2411 if ((1 << opr->reg) & mask)
2417 if (po->operand[0].type == OPT_REG) {
2418 if (po->regmask_dst & (1 << opr->reg))
2425 return IS(po->operand[0].name, opr->name);
2428 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2429 static int is_any_opr_modified(const struct parsed_op *po_test,
2430 const struct parsed_op *po, int c_mode)
2435 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2438 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2441 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2444 // in reality, it can wreck any register, but in decompiled C
2445 // version it can only overwrite eax or edx:eax
2446 mask = (1 << xAX) | (1 << xDX);
2450 if (po->op == OP_CALL
2451 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2454 for (i = 0; i < po_test->operand_cnt; i++)
2455 if (IS(po_test->operand[i].name, po->operand[0].name))
2461 // scan for any po_test operand modification in range given
2462 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2465 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2468 for (; i < opcnt; i++) {
2469 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2476 // scan for po_test operand[0] modification in range given
2477 static int scan_for_mod_opr0(struct parsed_op *po_test,
2480 for (; i < opcnt; i++) {
2481 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2488 static int scan_for_flag_set(int i, int magic, int *branched,
2489 int *setters, int *setter_cnt)
2491 struct label_ref *lr;
2495 if (ops[i].cc_scratch == magic) {
2496 ferr(&ops[i], "%s looped\n", __func__);
2499 ops[i].cc_scratch = magic;
2501 if (g_labels[i] != NULL) {
2504 lr = &g_label_refs[i];
2505 for (; lr->next; lr = lr->next) {
2506 check_i(&ops[i], lr->i);
2507 ret = scan_for_flag_set(lr->i, magic,
2508 branched, setters, setter_cnt);
2513 check_i(&ops[i], lr->i);
2514 if (i > 0 && LAST_OP(i - 1)) {
2518 ret = scan_for_flag_set(lr->i, magic,
2519 branched, setters, setter_cnt);
2525 if (ops[i].flags & OPF_FLAGS) {
2526 setters[*setter_cnt] = i;
2531 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2538 // scan back for cdq, if anything modifies edx, fail
2539 static int scan_for_cdq_edx(int i)
2542 if (g_labels[i] != NULL) {
2543 if (g_label_refs[i].next != NULL)
2545 if (i > 0 && LAST_OP(i - 1)) {
2546 i = g_label_refs[i].i;
2553 if (ops[i].op == OP_CDQ)
2556 if (ops[i].regmask_dst & (1 << xDX))
2563 static int scan_for_reg_clear(int i, int reg)
2566 if (g_labels[i] != NULL) {
2567 if (g_label_refs[i].next != NULL)
2569 if (i > 0 && LAST_OP(i - 1)) {
2570 i = g_label_refs[i].i;
2577 if (ops[i].op == OP_XOR
2578 && ops[i].operand[0].lmod == OPLM_DWORD
2579 && ops[i].operand[0].reg == ops[i].operand[1].reg
2580 && ops[i].operand[0].reg == reg)
2583 if (ops[i].regmask_dst & (1 << reg))
2590 static void patch_esp_adjust(struct parsed_op *po, int adj)
2592 ferr_assert(po, po->op == OP_ADD);
2593 ferr_assert(po, IS(opr_name(po, 0), "esp"));
2594 ferr_assert(po, po->operand[1].type == OPT_CONST);
2596 // this is a bit of a hack, but deals with use of
2597 // single adj for multiple calls
2598 po->operand[1].val -= adj;
2599 po->flags |= OPF_RMD;
2600 if (po->operand[1].val == 0)
2601 po->flags |= OPF_DONE;
2602 ferr_assert(po, (int)po->operand[1].val >= 0);
2605 // scan for positive, constant esp adjust
2606 // multipath case is preliminary
2607 static int scan_for_esp_adjust(int i, int opcnt,
2608 int adj_expect, int *adj, int *is_multipath, int do_update)
2610 struct parsed_op *po;
2613 *adj = *is_multipath = 0;
2615 for (; i < opcnt && *adj < adj_expect; i++) {
2616 if (g_labels[i] != NULL)
2620 if (po->flags & OPF_DONE)
2623 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2624 if (po->operand[1].type != OPT_CONST)
2625 ferr(&ops[i], "non-const esp adjust?\n");
2626 *adj += po->operand[1].val;
2628 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2631 patch_esp_adjust(po, adj_expect);
2633 po->flags |= OPF_RMD;
2637 else if (po->op == OP_PUSH) {
2638 //if (first_pop == -1)
2639 // first_pop = -2; // none
2640 *adj -= lmod_bytes(po, po->operand[0].lmod);
2642 else if (po->op == OP_POP) {
2643 if (!(po->flags & OPF_DONE)) {
2644 // seems like msvc only uses 'pop ecx' for stack realignment..
2645 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2647 if (first_pop == -1 && *adj >= 0)
2650 if (do_update && *adj >= 0) {
2651 po->flags |= OPF_RMD;
2653 po->flags |= OPF_DONE;
2656 *adj += lmod_bytes(po, po->operand[0].lmod);
2658 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2659 if (po->op == OP_JMP && po->btj == NULL) {
2665 if (po->op != OP_CALL)
2667 if (po->operand[0].type != OPT_LABEL)
2669 if (po->pp != NULL && po->pp->is_stdcall)
2671 // assume it's another cdecl call
2675 if (first_pop >= 0) {
2676 // probably 'pop ecx' was used..
2683 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2685 struct parsed_op *po;
2689 ferr(ops, "%s: followed bad branch?\n", __func__);
2691 for (; i < opcnt; i++) {
2693 if (po->cc_scratch == magic)
2695 po->cc_scratch = magic;
2698 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2699 if (po->btj != NULL) {
2701 for (j = 0; j < po->btj->count; j++)
2702 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2706 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2707 if (!(po->flags & OPF_CJMP))
2710 if (po->flags & OPF_TAIL)
2715 static const struct parsed_proto *try_recover_pp(
2716 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2718 const struct parsed_proto *pp = NULL;
2722 // maybe an arg of g_func?
2723 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2725 char ofs_reg[16] = { 0, };
2726 int arg, arg_s, arg_i;
2733 parse_stack_access(po, opr->name, ofs_reg,
2734 &offset, &stack_ra, NULL, 0);
2735 if (ofs_reg[0] != 0)
2736 ferr(po, "offset reg on arg access?\n");
2737 if (offset <= stack_ra) {
2738 // search who set the stack var instead
2739 if (search_instead != NULL)
2740 *search_instead = 1;
2744 arg_i = (offset - stack_ra - 4) / 4;
2745 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2746 if (g_func_pp->arg[arg].reg != NULL)
2752 if (arg == g_func_pp->argc)
2753 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2755 pp = g_func_pp->arg[arg].fptr;
2757 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2758 check_func_pp(po, pp, "icall arg");
2760 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2762 p = strchr(opr->name + 1, '[');
2763 memcpy(buf, opr->name, p - opr->name);
2764 buf[p - opr->name] = 0;
2765 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
2767 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2768 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
2771 ferr(po, "proto_parse failed for icall to '%s'\n", opr->name);
2774 check_func_pp(po, pp, "reg-fptr ref");
2780 static void scan_for_call_type(int i, const struct parsed_opr *opr,
2781 int magic, const struct parsed_proto **pp_found, int *pp_i,
2784 const struct parsed_proto *pp = NULL;
2785 struct parsed_op *po;
2786 struct label_ref *lr;
2788 ops[i].cc_scratch = magic;
2791 if (g_labels[i] != NULL) {
2792 lr = &g_label_refs[i];
2793 for (; lr != NULL; lr = lr->next) {
2794 check_i(&ops[i], lr->i);
2795 scan_for_call_type(lr->i, opr, magic, pp_found, pp_i, multi);
2797 if (i > 0 && LAST_OP(i - 1))
2805 if (ops[i].cc_scratch == magic)
2807 ops[i].cc_scratch = magic;
2809 if (!(ops[i].flags & OPF_DATA))
2811 if (!is_opr_modified(opr, &ops[i]))
2813 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2814 // most probably trashed by some processing
2819 opr = &ops[i].operand[1];
2820 if (opr->type != OPT_REG)
2824 po = (i >= 0) ? &ops[i] : ops;
2827 // reached the top - can only be an arg-reg
2828 if (opr->type != OPT_REG)
2831 for (i = 0; i < g_func_pp->argc; i++) {
2832 if (g_func_pp->arg[i].reg == NULL)
2834 if (IS(opr->name, g_func_pp->arg[i].reg))
2837 if (i == g_func_pp->argc)
2839 pp = g_func_pp->arg[i].fptr;
2841 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2842 i + 1, g_func_pp->arg[i].reg);
2843 check_func_pp(po, pp, "icall reg-arg");
2846 pp = try_recover_pp(po, opr, NULL);
2848 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2849 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2850 || (*pp_found)->is_stdcall != pp->is_stdcall
2851 || (*pp_found)->is_fptr != pp->is_fptr
2852 || (*pp_found)->argc != pp->argc
2853 || (*pp_found)->argc_reg != pp->argc_reg
2854 || (*pp_found)->argc_stack != pp->argc_stack)
2856 ferr(po, "icall: parsed_proto mismatch\n");
2866 static void add_label_ref(struct label_ref *lr, int op_i)
2868 struct label_ref *lr_new;
2875 lr_new = calloc(1, sizeof(*lr_new));
2877 lr_new->next = lr->next;
2881 static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
2883 struct parsed_op *po = &ops[i];
2884 struct parsed_data *pd;
2885 char label[NAMELEN], *p;
2888 p = strchr(po->operand[0].name, '[');
2892 len = p - po->operand[0].name;
2893 strncpy(label, po->operand[0].name, len);
2896 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2897 if (IS(g_func_pd[j].label, label)) {
2903 //ferr(po, "label '%s' not parsed?\n", label);
2906 if (pd->type != OPT_OFFSET)
2907 ferr(po, "label '%s' with non-offset data?\n", label);
2909 // find all labels, link
2910 for (j = 0; j < pd->count; j++) {
2911 for (l = 0; l < opcnt; l++) {
2912 if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) {
2913 add_label_ref(&g_label_refs[l], i);
2923 static void clear_labels(int count)
2927 for (i = 0; i < count; i++) {
2928 if (g_labels[i] != NULL) {
2935 static void resolve_branches_parse_calls(int opcnt)
2937 const struct parsed_proto *pp_c;
2938 struct parsed_proto *pp;
2939 struct parsed_data *pd;
2940 struct parsed_op *po;
2941 const char *tmpname;
2944 for (i = 0; i < opcnt; i++)
2950 if (po->op == OP_CALL) {
2953 if (po->operand[0].type == OPT_LABEL) {
2954 tmpname = opr_name(po, 0);
2955 if (IS_START(tmpname, "loc_"))
2956 ferr(po, "call to loc_*\n");
2957 pp_c = proto_parse(g_fhdr, tmpname, g_header_mode);
2958 if (!g_header_mode && pp_c == NULL)
2959 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2962 pp = proto_clone(pp_c);
2963 my_assert_not(pp, NULL);
2966 else if (po->datap != NULL) {
2967 pp = calloc(1, sizeof(*pp));
2968 my_assert_not(pp, NULL);
2970 ret = parse_protostr(po->datap, pp);
2972 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
2979 check_func_pp(po, pp, "fptr var call");
2980 if (pp->is_noreturn)
2981 po->flags |= OPF_TAIL;
2987 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
2990 if (po->operand[0].type == OPT_REGMEM) {
2991 pd = try_resolve_jumptab(i, opcnt);
2999 for (l = 0; l < opcnt; l++) {
3000 if (g_labels[l] != NULL
3001 && IS(po->operand[0].name, g_labels[l]))
3003 if (l == i + 1 && po->op == OP_JMP) {
3004 // yet another alignment type..
3005 po->flags |= OPF_RMD|OPF_DONE;
3008 add_label_ref(&g_label_refs[l], i);
3014 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3017 if (po->operand[0].type == OPT_LABEL)
3021 ferr(po, "unhandled branch\n");
3025 po->flags |= OPF_TAIL;
3026 if (i > 0 && ops[i - 1].op == OP_POP)
3027 po->flags |= OPF_ATAIL;
3032 static void scan_prologue_epilogue(int opcnt)
3034 int ecx_push = 0, esp_sub = 0;
3038 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3039 && ops[1].op == OP_MOV
3040 && IS(opr_name(&ops[1], 0), "ebp")
3041 && IS(opr_name(&ops[1], 1), "esp"))
3044 ops[0].flags |= OPF_RMD | OPF_DONE;
3045 ops[1].flags |= OPF_RMD | OPF_DONE;
3048 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
3049 g_stack_fsz = opr_const(&ops[2], 1);
3050 ops[2].flags |= OPF_RMD | OPF_DONE;
3054 // another way msvc builds stack frame..
3056 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3058 ops[i].flags |= OPF_RMD | OPF_DONE;
3062 // and another way..
3063 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3064 && ops[i].operand[1].type == OPT_CONST
3065 && ops[i + 1].op == OP_CALL
3066 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3068 g_stack_fsz += ops[i].operand[1].val;
3069 ops[i].flags |= OPF_RMD | OPF_DONE;
3071 ops[i].flags |= OPF_RMD | OPF_DONE;
3078 for (; i < opcnt; i++)
3079 if (ops[i].flags & OPF_TAIL)
3082 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3083 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3089 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3090 || ops[j].op == OP_LEAVE)
3092 ops[j].flags |= OPF_RMD | OPF_DONE;
3094 else if (ops[i].op == OP_CALL && ops[i].pp != NULL
3095 && ops[i].pp->is_noreturn)
3097 // on noreturn, msvc sometimes cleans stack, sometimes not
3102 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3103 ferr(&ops[j], "'pop ebp' expected\n");
3105 if (g_stack_fsz != 0) {
3106 if (ops[j - 1].op == OP_MOV
3107 && IS(opr_name(&ops[j - 1], 0), "esp")
3108 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3110 ops[j - 1].flags |= OPF_RMD | OPF_DONE;
3112 else if (ops[j].op != OP_LEAVE
3113 && !(g_ida_func_attr & IDAFA_NORETURN))
3115 ferr(&ops[j - 1], "esp restore expected\n");
3118 if (ecx_push && ops[j - 2].op == OP_POP
3119 && IS(opr_name(&ops[j - 2], 0), "ecx"))
3121 ferr(&ops[j - 2], "unexpected ecx pop\n");
3127 } while (i < opcnt);
3130 ferr(ops, "missing ebp epilogue\n");
3136 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3137 ops[i].flags |= OPF_RMD | OPF_DONE;
3143 for (; i < opcnt; i++) {
3144 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3146 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3147 && ops[i].operand[1].type == OPT_CONST)
3149 g_stack_fsz = ops[i].operand[1].val;
3150 ops[i].flags |= OPF_RMD | OPF_DONE;
3156 if (ecx_push && !esp_sub) {
3157 // could actually be args for a call..
3158 for (; i < opcnt; i++)
3159 if (ops[i].op != OP_PUSH)
3162 if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) {
3163 const struct parsed_proto *pp;
3164 pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1);
3165 j = pp ? pp->argc_stack : 0;
3166 while (i > 0 && j > 0) {
3168 if (ops[i].op == OP_PUSH) {
3169 ops[i].flags &= ~(OPF_RMD | OPF_DONE);
3174 ferr(&ops[i], "unhandled prologue\n");
3177 i = g_stack_fsz = ecx_push = 0;
3178 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3179 if (!(ops[i].flags & OPF_RMD))
3189 if (ecx_push || esp_sub)
3195 for (; i < opcnt; i++)
3196 if (ops[i].flags & OPF_TAIL)
3199 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3200 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3207 for (l = 0; l < ecx_push; l++) {
3208 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx"))
3210 else if (ops[j].op == OP_ADD
3211 && IS(opr_name(&ops[j], 0), "esp")
3212 && ops[j].operand[1].type == OPT_CONST)
3215 l += ops[j].operand[1].val / 4 - 1;
3218 ferr(&ops[j], "'pop ecx' expected\n");
3220 ops[j].flags |= OPF_RMD | OPF_DONE;
3224 ferr(&ops[j], "epilogue scan failed\n");
3230 if (ops[j].op != OP_ADD
3231 || !IS(opr_name(&ops[j], 0), "esp")
3232 || ops[j].operand[1].type != OPT_CONST
3233 || ops[j].operand[1].val != g_stack_fsz)
3234 ferr(&ops[j], "'add esp' expected\n");
3236 ops[j].flags |= OPF_RMD | OPF_DONE;
3237 ops[j].operand[1].val = 0; // hack for stack arg scanner
3242 } while (i < opcnt);
3245 ferr(ops, "missing esp epilogue\n");
3249 static const struct parsed_proto *resolve_icall(int i, int opcnt,
3250 int *pp_i, int *multi_src)
3252 const struct parsed_proto *pp = NULL;
3253 int search_advice = 0;
3258 switch (ops[i].operand[0].type) {
3262 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
3267 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
3275 // find an instruction that changed opr before i op
3276 // *op_i must be set to -1 by the caller
3277 // *entry is set to 1 if one source is determined to be the caller
3278 // returns 1 if found, *op_i is then set to origin
3279 static int resolve_origin(int i, const struct parsed_opr *opr,
3280 int magic, int *op_i, int *is_caller)
3282 struct label_ref *lr;
3285 if (ops[i].cc_scratch == magic)
3287 ops[i].cc_scratch = magic;
3290 if (g_labels[i] != NULL) {
3291 lr = &g_label_refs[i];
3292 for (; lr != NULL; lr = lr->next) {
3293 check_i(&ops[i], lr->i);
3294 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
3296 if (i > 0 && LAST_OP(i - 1))
3302 if (is_caller != NULL)
3307 if (ops[i].cc_scratch == magic)
3309 ops[i].cc_scratch = magic;
3311 if (!(ops[i].flags & OPF_DATA))
3313 if (!is_opr_modified(opr, &ops[i]))
3320 // XXX: could check if the other op does the same
3329 // find an instruction that previously referenced opr
3330 // if multiple results are found - fail
3331 // *op_i must be set to -1 by the caller
3332 // returns 1 if found, *op_i is then set to referencer insn
3333 static int resolve_last_ref(int i, const struct parsed_opr *opr,
3334 int magic, int *op_i)
3336 struct label_ref *lr;
3339 if (ops[i].cc_scratch == magic)
3341 ops[i].cc_scratch = magic;
3344 if (g_labels[i] != NULL) {
3345 lr = &g_label_refs[i];
3346 for (; lr != NULL; lr = lr->next) {
3347 check_i(&ops[i], lr->i);
3348 ret |= resolve_last_ref(lr->i, opr, magic, op_i);
3350 if (i > 0 && LAST_OP(i - 1))
3358 if (ops[i].cc_scratch == magic)
3360 ops[i].cc_scratch = magic;
3362 if (!is_opr_referenced(opr, &ops[i]))
3373 // find next instruction that reads opr
3374 // if multiple results are found - fail
3375 // *op_i must be set to -1 by the caller
3376 // returns 1 if found, *op_i is then set to referencer insn
3377 static int find_next_read(int i, int opcnt,
3378 const struct parsed_opr *opr, int magic, int *op_i)
3380 struct parsed_op *po;
3383 for (; i < opcnt; i++)
3385 if (ops[i].cc_scratch == magic)
3387 ops[i].cc_scratch = magic;
3390 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
3391 if (po->btj != NULL) {
3393 for (j = 0; j < po->btj->count; j++) {
3394 check_i(po, po->btj->d[j].bt_i);
3395 ret |= find_next_read(po->btj->d[j].bt_i, opcnt, opr,
3401 if (po->flags & OPF_RMD)
3403 check_i(po, po->bt_i);
3404 if (po->flags & OPF_CJMP) {
3405 ret = find_next_read(po->bt_i, opcnt, opr, magic, op_i);
3414 if (!is_opr_read(opr, po)) {
3415 if (is_opr_modified(opr, po))
3418 if (po->flags & OPF_TAIL)
3433 static int try_resolve_const(int i, const struct parsed_opr *opr,
3434 int magic, unsigned int *val)
3439 ret = resolve_origin(i, opr, magic, &s_i, NULL);
3442 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
3445 *val = ops[i].operand[1].val;
3452 static struct parsed_proto *process_call_early(int i, int opcnt,
3455 struct parsed_op *po = &ops[i];
3456 struct parsed_proto *pp;
3462 if (pp == NULL || pp->is_vararg || pp->argc_reg != 0)
3466 // look for and make use of esp adjust
3468 if (!pp->is_stdcall && pp->argc_stack > 0)
3469 ret = scan_for_esp_adjust(i + 1, opcnt,
3470 pp->argc_stack * 4, &adj, &multipath, 0);
3472 if (pp->argc_stack > adj / 4)
3476 if (ops[ret].op == OP_POP && adj != 4)
3484 static struct parsed_proto *process_call(int i, int opcnt)
3486 struct parsed_op *po = &ops[i];
3487 const struct parsed_proto *pp_c;
3488 struct parsed_proto *pp;
3489 const char *tmpname;
3490 int call_i = -1, ref_i = -1;
3491 int adj = 0, multipath = 0;
3494 tmpname = opr_name(po, 0);
3499 pp_c = resolve_icall(i, opcnt, &call_i, &multipath);
3501 if (!pp_c->is_func && !pp_c->is_fptr)
3502 ferr(po, "call to non-func: %s\n", pp_c->name);
3503 pp = proto_clone(pp_c);
3504 my_assert_not(pp, NULL);
3506 // not resolved just to single func
3509 switch (po->operand[0].type) {
3511 // we resolved this call and no longer need the register
3512 po->regmask_src &= ~(1 << po->operand[0].reg);
3514 if (!multipath && i != call_i && ops[call_i].op == OP_MOV
3515 && ops[call_i].operand[1].type == OPT_LABEL)
3517 // no other source users?
3518 ret = resolve_last_ref(i, &po->operand[0], opcnt * 10,
3520 if (ret == 1 && call_i == ref_i) {
3521 // and nothing uses it after us?
3523 ret = find_next_read(i + 1, opcnt, &po->operand[0],
3524 opcnt * 11, &ref_i);
3526 // then also don't need the source mov
3527 ops[call_i].flags |= OPF_RMD;
3539 pp = calloc(1, sizeof(*pp));
3540 my_assert_not(pp, NULL);
3543 ret = scan_for_esp_adjust(i + 1, opcnt,
3544 32*4, &adj, &multipath, 0);
3545 if (ret < 0 || adj < 0) {
3546 if (!g_allow_regfunc)
3547 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3548 pp->is_unresolved = 1;
3552 if (adj > ARRAY_SIZE(pp->arg))
3553 ferr(po, "esp adjust too large: %d\n", adj);
3554 pp->ret_type.name = strdup("int");
3555 pp->argc = pp->argc_stack = adj;
3556 for (arg = 0; arg < pp->argc; arg++)
3557 pp->arg[arg].type.name = strdup("int");
3562 // look for and make use of esp adjust
3565 if (!pp->is_stdcall && pp->argc_stack > 0)
3566 ret = scan_for_esp_adjust(i + 1, opcnt,
3567 pp->argc_stack * 4, &adj, &multipath, 0);
3569 if (pp->is_vararg) {
3570 if (adj / 4 < pp->argc_stack) {
3571 fnote(po, "(this call)\n");
3572 ferr(&ops[ret], "esp adjust is too small: %x < %x\n",
3573 adj, pp->argc_stack * 4);
3575 // modify pp to make it have varargs as normal args
3577 pp->argc += adj / 4 - pp->argc_stack;
3578 for (; arg < pp->argc; arg++) {
3579 pp->arg[arg].type.name = strdup("int");
3582 if (pp->argc > ARRAY_SIZE(pp->arg))
3583 ferr(po, "too many args for '%s'\n", tmpname);
3585 if (pp->argc_stack > adj / 4) {
3586 fnote(po, "(this call)\n");
3587 ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n",
3588 tmpname, pp->argc_stack * 4, adj);
3591 scan_for_esp_adjust(i + 1, opcnt,
3592 pp->argc_stack * 4, &adj, &multipath, 1);
3594 else if (pp->is_vararg)
3595 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3601 static int collect_call_args_early(struct parsed_op *po, int i,
3602 struct parsed_proto *pp, int *regmask)
3607 for (arg = 0; arg < pp->argc; arg++)
3608 if (pp->arg[arg].reg == NULL)
3611 // first see if it can be easily done
3612 for (j = i; j > 0 && arg < pp->argc; )
3614 if (g_labels[j] != NULL)
3618 if (ops[j].op == OP_CALL)
3620 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP)
3622 else if (ops[j].op == OP_POP)
3624 else if (ops[j].flags & OPF_CJMP)
3626 else if (ops[j].op == OP_PUSH) {
3627 if (ops[j].flags & (OPF_FARG|OPF_FARGNR))
3629 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3633 if (pp->arg[arg].type.is_va_list)
3637 for (arg++; arg < pp->argc; arg++)
3638 if (pp->arg[arg].reg == NULL)
3647 for (arg = 0; arg < pp->argc; arg++)
3648 if (pp->arg[arg].reg == NULL)
3651 for (j = i; j > 0 && arg < pp->argc; )
3655 if (ops[j].op == OP_PUSH)
3657 ops[j].p_argnext = -1;
3658 ferr_assert(&ops[j], pp->arg[arg].datap == NULL);
3659 pp->arg[arg].datap = &ops[j];
3661 if (ops[j].operand[0].type == OPT_REG)
3662 *regmask |= 1 << ops[j].operand[0].reg;
3664 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
3665 ops[j].flags &= ~OPF_RSAVE;
3668 for (arg++; arg < pp->argc; arg++)
3669 if (pp->arg[arg].reg == NULL)
3677 static int collect_call_args_r(struct parsed_op *po, int i,
3678 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3679 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
3681 struct parsed_proto *pp_tmp;
3682 struct parsed_op *po_tmp;
3683 struct label_ref *lr;
3684 int need_to_save_current;
3685 int arg_grp_current = 0;
3686 int save_args_seen = 0;
3694 ferr(po, "dead label encountered\n");
3698 for (; arg < pp->argc; arg++)
3699 if (pp->arg[arg].reg == NULL)
3701 magic = (magic & 0xffffff) | (arg << 24);
3703 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
3705 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
3706 if (ops[j].cc_scratch != magic) {
3707 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
3711 // ok: have already been here
3714 ops[j].cc_scratch = magic;
3716 if (g_labels[j] != NULL && g_label_refs[j].i != -1) {
3717 lr = &g_label_refs[j];
3718 if (lr->next != NULL)
3720 for (; lr->next; lr = lr->next) {
3721 check_i(&ops[j], lr->i);
3722 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
3724 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
3725 arg_grp, arg, magic, need_op_saving, may_reuse);
3730 check_i(&ops[j], lr->i);
3731 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
3733 if (j > 0 && LAST_OP(j - 1)) {
3734 // follow last branch in reverse
3739 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
3740 arg_grp, arg, magic, need_op_saving, may_reuse);
3746 if (ops[j].op == OP_CALL)
3748 if (pp->is_unresolved)
3753 ferr(po, "arg collect hit unparsed call '%s'\n",
3754 ops[j].operand[0].name);
3755 if (may_reuse && pp_tmp->argc_stack > 0)
3756 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
3757 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
3759 // esp adjust of 0 means we collected it before
3760 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
3761 && (ops[j].operand[1].type != OPT_CONST
3762 || ops[j].operand[1].val != 0))
3764 if (pp->is_unresolved)
3767 ferr(po, "arg collect %d/%d hit esp adjust of %d\n",
3768 arg, pp->argc, ops[j].operand[1].val);
3770 else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_DONE))
3772 if (pp->is_unresolved)
3775 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
3777 else if (ops[j].flags & OPF_CJMP)
3779 if (pp->is_unresolved)
3784 else if (ops[j].op == OP_PUSH
3785 && !(ops[j].flags & (OPF_FARGNR|OPF_DONE)))
3787 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
3790 ops[j].p_argnext = -1;
3791 po_tmp = pp->arg[arg].datap;
3793 ops[j].p_argnext = po_tmp - ops;
3794 pp->arg[arg].datap = &ops[j];
3796 need_to_save_current = 0;
3799 if (ops[j].operand[0].type == OPT_REG)
3800 reg = ops[j].operand[0].reg;
3802 if (!need_op_saving) {
3803 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3804 need_to_save_current = (ret >= 0);
3806 if (need_op_saving || need_to_save_current) {
3807 // mark this push as one that needs operand saving
3808 ops[j].flags &= ~OPF_RMD;
3809 if (ops[j].p_argnum == 0) {
3810 ops[j].p_argnum = arg + 1;
3811 save_args |= 1 << arg;
3813 else if (ops[j].p_argnum < arg + 1) {
3814 // XXX: might kill valid var..
3815 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
3816 ops[j].p_argnum = arg + 1;
3817 save_args |= 1 << arg;
3820 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
3823 if (arg_grp_current >= MAX_ARG_GRP)
3824 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
3825 ops[j].p_argnum, pp->name);
3828 else if (ops[j].p_argnum == 0)
3829 ops[j].flags |= OPF_RMD;
3831 // some PUSHes are reused by different calls on other branches,
3832 // but that can't happen if we didn't branch, so they
3833 // can be removed from future searches (handles nested calls)
3835 ops[j].flags |= OPF_FARGNR;
3837 ops[j].flags |= OPF_FARG;
3838 ops[j].flags &= ~OPF_RSAVE;
3840 // check for __VALIST
3841 if (!pp->is_unresolved && pp->arg[arg].type.is_va_list) {
3843 ret = resolve_origin(j, &ops[j].operand[0],
3844 magic + 1, &k, NULL);
3845 if (ret == 1 && k >= 0)
3847 if (ops[k].op == OP_LEA) {
3848 snprintf(buf, sizeof(buf), "arg_%X",
3849 g_func_pp->argc_stack * 4);
3850 if (!g_func_pp->is_vararg
3851 || strstr(ops[k].operand[1].name, buf))
3853 ops[k].flags |= OPF_RMD | OPF_DONE;
3854 ops[j].flags |= OPF_RMD | OPF_VAPUSH;
3855 save_args &= ~(1 << arg);
3859 ferr(&ops[j], "lea va_list used, but no vararg?\n");
3861 // check for va_list from g_func_pp arg too
3862 else if (ops[k].op == OP_MOV
3863 && is_stack_access(&ops[k], &ops[k].operand[1]))
3865 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
3866 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
3868 ops[k].flags |= OPF_RMD | OPF_DONE;
3869 ops[j].flags |= OPF_RMD;
3870 ops[j].p_argpass = ret + 1;
3871 save_args &= ~(1 << arg);
3878 *save_arg_vars |= save_args;
3880 // tracking reg usage
3882 *regmask |= 1 << reg;
3885 if (!pp->is_unresolved) {
3887 for (; arg < pp->argc; arg++)
3888 if (pp->arg[arg].reg == NULL)
3891 magic = (magic & 0xffffff) | (arg << 24);
3894 if (ops[j].p_arggrp > arg_grp_current) {
3896 arg_grp_current = ops[j].p_arggrp;
3898 if (ops[j].p_argnum > 0)
3899 save_args_seen |= 1 << (ops[j].p_argnum - 1);
3902 if (arg < pp->argc) {
3903 ferr(po, "arg collect failed for '%s': %d/%d\n",
3904 pp->name, arg, pp->argc);
3908 if (arg_grp_current > *arg_grp)
3909 *arg_grp = arg_grp_current;
3914 static int collect_call_args(struct parsed_op *po, int i,
3915 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3918 // arg group is for cases when pushes for
3919 // multiple funcs are going on
3920 struct parsed_op *po_tmp;
3921 int save_arg_vars_current = 0;
3926 ret = collect_call_args_r(po, i, pp, regmask,
3927 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
3932 // propagate arg_grp
3933 for (a = 0; a < pp->argc; a++) {
3934 if (pp->arg[a].reg != NULL)
3937 po_tmp = pp->arg[a].datap;
3938 while (po_tmp != NULL) {
3939 po_tmp->p_arggrp = arg_grp;
3940 if (po_tmp->p_argnext > 0)
3941 po_tmp = &ops[po_tmp->p_argnext];
3947 save_arg_vars[arg_grp] |= save_arg_vars_current;
3949 if (pp->is_unresolved) {
3951 pp->argc_stack += ret;
3952 for (a = 0; a < pp->argc; a++)
3953 if (pp->arg[a].type.name == NULL)
3954 pp->arg[a].type.name = strdup("int");
3960 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
3964 for (i = 0; i < pp->argc; i++)
3965 if (pp->arg[i].reg == NULL)
3969 memmove(&pp->arg[i + 1], &pp->arg[i],
3970 sizeof(pp->arg[0]) * pp->argc_stack);
3971 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
3972 pp->arg[i].reg = strdup(reg);
3973 pp->arg[i].type.name = strdup("int");
3978 static void output_std_flags(FILE *fout, struct parsed_op *po,
3979 int *pfomask, const char *dst_opr_text)
3981 if (*pfomask & (1 << PFO_Z)) {
3982 fprintf(fout, "\n cond_z = (%s%s == 0);",
3983 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
3984 *pfomask &= ~(1 << PFO_Z);
3986 if (*pfomask & (1 << PFO_S)) {
3987 fprintf(fout, "\n cond_s = (%s%s < 0);",
3988 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
3989 *pfomask &= ~(1 << PFO_S);
3994 OPP_FORCE_NORETURN = (1 << 0),
3995 OPP_SIMPLE_ARGS = (1 << 1),
3996 OPP_ALIGN = (1 << 2),
3999 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
4002 const char *cconv = "";
4004 if (pp->is_fastcall)
4005 cconv = "__fastcall ";
4006 else if (pp->is_stdcall && pp->argc_reg == 0)
4007 cconv = "__stdcall ";
4009 fprintf(fout, (flags & OPP_ALIGN) ? "%-16s" : "%s", cconv);
4011 if (pp->is_noreturn || (flags & OPP_FORCE_NORETURN))
4012 fprintf(fout, "noreturn ");
4015 static void output_pp(FILE *fout, const struct parsed_proto *pp,
4020 fprintf(fout, (flags & OPP_ALIGN) ? "%-5s" : "%s ",
4024 output_pp_attrs(fout, pp, flags);
4027 fprintf(fout, "%s", pp->name);
4032 for (i = 0; i < pp->argc; i++) {
4034 fprintf(fout, ", ");
4035 if (pp->arg[i].fptr != NULL && !(flags & OPP_SIMPLE_ARGS)) {
4037 output_pp(fout, pp->arg[i].fptr, 0);
4039 else if (pp->arg[i].type.is_retreg) {
4040 fprintf(fout, "u32 *r_%s", pp->arg[i].reg);
4043 fprintf(fout, "%s", pp->arg[i].type.name);
4045 fprintf(fout, " a%d", i + 1);
4048 if (pp->is_vararg) {
4050 fprintf(fout, ", ");
4051 fprintf(fout, "...");
4056 static int get_pp_arg_regmask(const struct parsed_proto *pp)
4061 for (i = 0; i < pp->argc; i++) {
4062 if (pp->arg[i].reg != NULL) {
4063 reg = char_array_i(regs_r32,
4064 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
4066 ferr(ops, "arg '%s' of func '%s' is not a reg?\n",
4067 pp->arg[i].reg, pp->name);
4068 regmask |= 1 << reg;
4075 static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
4081 snprintf(buf1, sizeof(buf1), "%d", grp);
4082 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
4087 static void gen_x_cleanup(int opcnt);
4089 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
4091 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
4092 struct parsed_opr *last_arith_dst = NULL;
4093 char buf1[256], buf2[256], buf3[256], cast[64];
4094 struct parsed_proto *pp, *pp_tmp;
4095 struct parsed_data *pd;
4097 int save_arg_vars[MAX_ARG_GRP] = { 0, };
4099 int need_tmp_var = 0;
4102 int label_pending = 0;
4103 int regmask_save = 0; // regs saved/restored in this func
4104 int regmask_arg = 0; // regs carrying function args (fastcall, etc)
4105 int regmask_now; // temp
4106 int regmask_init = 0; // regs that need zero initialization
4107 int regmask_pp = 0; // regs used in complex push-pop graph
4108 int regmask = 0; // used regs
4118 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
4119 g_stack_frame_used = 0;
4121 g_func_pp = proto_parse(fhdr, funcn, 0);
4122 if (g_func_pp == NULL)
4123 ferr(ops, "proto_parse failed for '%s'\n", funcn);
4125 regmask_arg = get_pp_arg_regmask(g_func_pp);
4128 // - resolve all branches
4129 // - parse calls with labels
4130 resolve_branches_parse_calls(opcnt);
4133 // - handle ebp/esp frame, remove ops related to it
4134 scan_prologue_epilogue(opcnt);
4137 // - remove dead labels
4138 for (i = 0; i < opcnt; i++)
4140 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
4147 // - process trivial calls
4148 for (i = 0; i < opcnt; i++)
4151 if (po->flags & (OPF_RMD|OPF_DONE))
4154 if (po->op == OP_CALL)
4156 pp = process_call_early(i, opcnt, &j);
4158 if (!(po->flags & OPF_ATAIL))
4159 // since we know the args, try to collect them
4160 if (collect_call_args_early(po, i, pp, ®mask) != 0)
4166 // commit esp adjust
4167 ops[j].flags |= OPF_RMD;
4168 if (ops[j].op != OP_POP)
4169 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
4171 ops[j].flags |= OPF_DONE;
4174 if (strstr(pp->ret_type.name, "int64"))
4177 po->flags |= OPF_DONE;
4184 // - handle push <const>/pop pairs
4185 for (i = 0; i < opcnt; i++)
4188 if (po->flags & (OPF_RMD|OPF_DONE))
4191 if (po->op == OP_CALL && !(po->flags & OPF_DONE))
4193 pp = process_call(i, opcnt);
4195 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
4196 // since we know the args, collect them
4197 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4201 if (strstr(pp->ret_type.name, "int64"))
4204 else if (po->op == OP_PUSH && !(po->flags & OPF_FARG)
4205 && !(po->flags & OPF_RSAVE) && po->operand[0].type == OPT_CONST)
4206 scan_for_pop_const(i, opcnt, ®mask_pp);
4210 // - find POPs for PUSHes, rm both
4211 // - scan for STD/CLD, propagate DF
4212 // - scan for all used registers
4213 // - find flag set ops for their users
4214 // - do unreselved calls
4215 // - declare indirect functions
4216 for (i = 0; i < opcnt; i++)
4219 if (po->flags & (OPF_RMD|OPF_DONE))
4222 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
4223 reg = po->operand[0].reg;
4224 if (!(regmask & (1 << reg)))
4225 // not a reg save after all, rerun scan_for_pop
4226 po->flags &= ~OPF_RSAVE;
4228 regmask_save |= 1 << reg;
4231 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)
4232 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
4234 if (po->operand[0].type == OPT_REG)
4236 reg = po->operand[0].reg;
4238 ferr(po, "reg not set for push?\n");
4241 ret = scan_for_pop(i + 1, opcnt,
4242 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
4245 ferr(po, "too much depth: %d\n", depth);
4247 po->flags |= OPF_RMD;
4248 scan_for_pop(i + 1, opcnt, po->operand[0].name,
4249 i + opcnt * 4, 0, &depth, 1);
4252 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
4255 if (regmask & (1 << reg)) {
4256 if (regmask_save & (1 << reg))
4257 ferr(po, "%s already saved?\n", po->operand[0].name);
4261 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
4267 if (po->op == OP_STD) {
4268 po->flags |= OPF_DF | OPF_RMD | OPF_DONE;
4269 scan_propagate_df(i + 1, opcnt);
4272 regmask_now = po->regmask_src | po->regmask_dst;
4273 if (regmask_now & (1 << xBP)) {
4274 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
4275 if (po->regmask_dst & (1 << xBP))
4276 // compiler decided to drop bp frame and use ebp as scratch
4277 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
4279 regmask_now &= ~(1 << xBP);
4283 regmask |= regmask_now;
4285 if (po->flags & OPF_CC)
4287 int setters[16], cnt = 0, branched = 0;
4289 ret = scan_for_flag_set(i, i + opcnt * 6,
4290 &branched, setters, &cnt);
4291 if (ret < 0 || cnt <= 0)
4292 ferr(po, "unable to trace flag setter(s)\n");
4293 if (cnt > ARRAY_SIZE(setters))
4294 ferr(po, "too many flag setters\n");
4296 for (j = 0; j < cnt; j++)
4298 tmp_op = &ops[setters[j]]; // flag setter
4301 // to get nicer code, we try to delay test and cmp;
4302 // if we can't because of operand modification, or if we
4303 // have arith op, or branch, make it calculate flags explicitly
4304 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
4306 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
4307 pfomask = 1 << po->pfo;
4309 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
4310 pfomask = 1 << po->pfo;
4313 // see if we'll be able to handle based on op result
4314 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
4315 && po->pfo != PFO_Z && po->pfo != PFO_S
4316 && po->pfo != PFO_P)
4318 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
4320 pfomask = 1 << po->pfo;
4323 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
4324 propagate_lmod(tmp_op, &tmp_op->operand[0],
4325 &tmp_op->operand[1]);
4326 if (tmp_op->operand[0].lmod == OPLM_DWORD)
4331 tmp_op->pfomask |= pfomask;
4332 cond_vars |= pfomask;
4334 // note: may overwrite, currently not a problem
4338 if (po->op == OP_RCL || po->op == OP_RCR
4339 || po->op == OP_ADC || po->op == OP_SBB)
4340 cond_vars |= 1 << PFO_C;
4343 if (po->op == OP_CMPS || po->op == OP_SCAS) {
4344 cond_vars |= 1 << PFO_Z;
4346 else if (po->op == OP_MUL
4347 || (po->op == OP_IMUL && po->operand_cnt == 1))
4349 if (po->operand[0].lmod == OPLM_DWORD)
4352 else if (po->op == OP_CALL) {
4353 // note: resolved non-reg calls are OPF_DONE already
4356 ferr(po, "NULL pp\n");
4358 if (pp->is_unresolved) {
4359 int regmask_stack = 0;
4360 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4363 // this is pretty rough guess:
4364 // see ecx and edx were pushed (and not their saved versions)
4365 for (arg = 0; arg < pp->argc; arg++) {
4366 if (pp->arg[arg].reg != NULL)
4369 tmp_op = pp->arg[arg].datap;
4371 ferr(po, "parsed_op missing for arg%d\n", arg);
4372 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
4373 regmask_stack |= 1 << tmp_op->operand[0].reg;
4376 if (!((regmask_stack & (1 << xCX))
4377 && (regmask_stack & (1 << xDX))))
4379 if (pp->argc_stack != 0
4380 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
4382 pp_insert_reg_arg(pp, "ecx");
4383 pp->is_fastcall = 1;
4384 regmask_init |= 1 << xCX;
4385 regmask |= 1 << xCX;
4387 if (pp->argc_stack != 0
4388 || ((regmask | regmask_arg) & (1 << xDX)))
4390 pp_insert_reg_arg(pp, "edx");
4391 regmask_init |= 1 << xDX;
4392 regmask |= 1 << xDX;
4396 // note: __cdecl doesn't fall into is_unresolved category
4397 if (pp->argc_stack > 0)
4401 for (arg = 0; arg < pp->argc; arg++) {
4402 if (pp->arg[arg].reg != NULL) {
4403 reg = char_array_i(regs_r32,
4404 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
4406 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
4407 if (!(regmask & (1 << reg))) {
4408 regmask_init |= 1 << reg;
4409 regmask |= 1 << reg;
4414 else if (po->op == OP_MOV && po->operand[0].pp != NULL
4415 && po->operand[1].pp != NULL)
4417 // <var> = offset <something>
4418 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
4419 && !IS_START(po->operand[1].name, "off_"))
4421 if (!po->operand[0].pp->is_fptr)
4422 ferr(po, "%s not declared as fptr when it should be\n",
4423 po->operand[0].name);
4424 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
4425 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
4426 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
4427 fnote(po, "var: %s\n", buf1);
4428 fnote(po, "func: %s\n", buf2);
4429 ferr(po, "^ mismatch\n");
4433 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
4434 regmask |= 1 << xAX;
4435 else if (po->op == OP_DIV || po->op == OP_IDIV) {
4436 // 32bit division is common, look for it
4437 if (po->op == OP_DIV)
4438 ret = scan_for_reg_clear(i, xDX);
4440 ret = scan_for_cdq_edx(i);
4442 po->flags |= OPF_32BIT;
4446 else if (po->op == OP_CLD)
4447 po->flags |= OPF_RMD | OPF_DONE;
4449 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
4455 // - confirm regmask_save, it might have been reduced
4456 if (regmask_save != 0)
4459 for (i = 0; i < opcnt; i++) {
4461 if (po->flags & OPF_RMD)
4464 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
4465 regmask_save |= 1 << po->operand[0].reg;
4469 // output starts here
4471 // define userstack size
4472 if (g_func_pp->is_userstack) {
4473 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
4474 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
4475 fprintf(fout, "#endif\n");
4478 // the function itself
4479 ferr_assert(ops, !g_func_pp->is_fptr);
4480 output_pp(fout, g_func_pp,
4481 (g_ida_func_attr & IDAFA_NORETURN) ? OPP_FORCE_NORETURN : 0);
4482 fprintf(fout, "\n{\n");
4484 // declare indirect functions
4485 for (i = 0; i < opcnt; i++) {
4487 if (po->flags & OPF_RMD)
4490 if (po->op == OP_CALL) {
4493 ferr(po, "NULL pp\n");
4495 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
4496 if (pp->name[0] != 0) {
4497 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
4498 memcpy(pp->name, "i_", 2);
4500 // might be declared already
4502 for (j = 0; j < i; j++) {
4503 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
4504 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
4514 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
4517 output_pp(fout, pp, OPP_SIMPLE_ARGS);
4518 fprintf(fout, ";\n");
4523 // output LUTs/jumptables
4524 for (i = 0; i < g_func_pd_cnt; i++) {
4526 fprintf(fout, " static const ");
4527 if (pd->type == OPT_OFFSET) {
4528 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
4530 for (j = 0; j < pd->count; j++) {
4532 fprintf(fout, ", ");
4533 fprintf(fout, "&&%s", pd->d[j].u.label);
4537 fprintf(fout, "%s %s[] =\n { ",
4538 lmod_type_u(ops, pd->lmod), pd->label);
4540 for (j = 0; j < pd->count; j++) {
4542 fprintf(fout, ", ");
4543 fprintf(fout, "%u", pd->d[j].u.val);
4546 fprintf(fout, " };\n");
4550 // declare stack frame, va_arg
4552 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
4553 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
4557 if (g_func_pp->is_userstack) {
4558 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
4559 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
4563 if (g_func_pp->is_vararg) {
4564 fprintf(fout, " va_list ap;\n");
4568 // declare arg-registers
4569 for (i = 0; i < g_func_pp->argc; i++) {
4570 if (g_func_pp->arg[i].reg != NULL) {
4571 reg = char_array_i(regs_r32,
4572 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
4573 if (regmask & (1 << reg)) {
4574 if (g_func_pp->arg[i].type.is_retreg)
4575 fprintf(fout, " u32 %s = *r_%s;\n",
4576 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
4578 fprintf(fout, " u32 %s = (u32)a%d;\n",
4579 g_func_pp->arg[i].reg, i + 1);
4582 if (g_func_pp->arg[i].type.is_retreg)
4583 ferr(ops, "retreg '%s' is unused?\n",
4584 g_func_pp->arg[i].reg);
4585 fprintf(fout, " // %s = a%d; // unused\n",
4586 g_func_pp->arg[i].reg, i + 1);
4592 // declare normal registers
4593 regmask_now = regmask & ~regmask_arg;
4594 regmask_now &= ~(1 << xSP);
4595 if (regmask_now & 0x00ff) {
4596 for (reg = 0; reg < 8; reg++) {
4597 if (regmask_now & (1 << reg)) {
4598 fprintf(fout, " u32 %s", regs_r32[reg]);
4599 if (regmask_init & (1 << reg))
4600 fprintf(fout, " = 0");
4601 fprintf(fout, ";\n");
4606 if (regmask_now & 0xff00) {
4607 for (reg = 8; reg < 16; reg++) {
4608 if (regmask_now & (1 << reg)) {
4609 fprintf(fout, " mmxr %s", regs_r32[reg]);
4610 if (regmask_init & (1 << reg))
4611 fprintf(fout, " = { 0, }");
4612 fprintf(fout, ";\n");
4619 for (reg = 0; reg < 8; reg++) {
4620 if (regmask_save & (1 << reg)) {
4621 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
4627 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
4628 if (save_arg_vars[i] == 0)
4630 for (reg = 0; reg < 32; reg++) {
4631 if (save_arg_vars[i] & (1 << reg)) {
4632 fprintf(fout, " u32 %s;\n",
4633 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
4639 // declare push-pop temporaries
4641 for (reg = 0; reg < 8; reg++) {
4642 if (regmask_pp & (1 << reg)) {
4643 fprintf(fout, " u32 pp_%s;\n", regs_r32[reg]);
4650 for (i = 0; i < 8; i++) {
4651 if (cond_vars & (1 << i)) {
4652 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
4659 fprintf(fout, " u32 tmp;\n");
4664 fprintf(fout, " u64 tmp64;\n");
4669 fprintf(fout, "\n");
4671 if (g_func_pp->is_vararg) {
4672 if (g_func_pp->argc_stack == 0)
4673 ferr(ops, "vararg func without stack args?\n");
4674 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
4678 for (i = 0; i < opcnt; i++)
4680 if (g_labels[i] != NULL) {
4681 fprintf(fout, "\n%s:\n", g_labels[i]);
4684 delayed_flag_op = NULL;
4685 last_arith_dst = NULL;
4689 if (po->flags & OPF_RMD)
4694 #define assert_operand_cnt(n_) \
4695 if (po->operand_cnt != n_) \
4696 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
4698 // conditional/flag using op?
4699 if (po->flags & OPF_CC)
4705 // we go through all this trouble to avoid using parsed_flag_op,
4706 // which makes generated code much nicer
4707 if (delayed_flag_op != NULL)
4709 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
4710 po->pfo, po->pfo_inv);
4713 else if (last_arith_dst != NULL
4714 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
4715 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
4718 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4719 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
4720 last_arith_dst->lmod, buf3);
4723 else if (tmp_op != NULL) {
4724 // use preprocessed flag calc results
4725 if (!(tmp_op->pfomask & (1 << po->pfo)))
4726 ferr(po, "not prepared for pfo %d\n", po->pfo);
4728 // note: pfo_inv was not yet applied
4729 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
4730 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
4733 ferr(po, "all methods of finding comparison failed\n");
4736 if (po->flags & OPF_JMP) {
4737 fprintf(fout, " if %s", buf1);
4739 else if (po->op == OP_RCL || po->op == OP_RCR
4740 || po->op == OP_ADC || po->op == OP_SBB)
4743 fprintf(fout, " cond_%s = %s;\n",
4744 parsed_flag_op_names[po->pfo], buf1);
4746 else if (po->flags & OPF_DATA) { // SETcc
4747 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
4748 fprintf(fout, " %s = %s;", buf2, buf1);
4751 ferr(po, "unhandled conditional op\n");
4755 pfomask = po->pfomask;
4757 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
4758 struct parsed_opr opr = {0,};
4761 opr.lmod = OPLM_DWORD;
4762 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
4764 if (ret != 1 || uval == 0) {
4765 // we need initial flags for ecx=0 case..
4766 if (i > 0 && ops[i - 1].op == OP_XOR
4767 && IS(ops[i - 1].operand[0].name,
4768 ops[i - 1].operand[1].name))
4770 fprintf(fout, " cond_z = ");
4771 if (pfomask & (1 << PFO_C))
4772 fprintf(fout, "cond_c = ");
4773 fprintf(fout, "0;\n");
4775 else if (last_arith_dst != NULL) {
4776 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4777 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
4778 last_arith_dst->lmod, buf3);
4779 fprintf(fout, " cond_z = %s;\n", buf1);
4782 ferr(po, "missing initial ZF\n");
4789 assert_operand_cnt(2);
4790 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4791 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4792 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
4793 fprintf(fout, " %s = %s;", buf1,
4794 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4799 assert_operand_cnt(2);
4800 po->operand[1].lmod = OPLM_DWORD; // always
4801 fprintf(fout, " %s = %s;",
4802 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4803 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4808 assert_operand_cnt(2);
4809 fprintf(fout, " %s = %s;",
4810 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4811 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4815 assert_operand_cnt(2);
4816 switch (po->operand[1].lmod) {
4818 strcpy(buf3, "(s8)");
4821 strcpy(buf3, "(s16)");
4824 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
4826 fprintf(fout, " %s = %s;",
4827 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4828 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4833 assert_operand_cnt(2);
4834 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4835 fprintf(fout, " tmp = %s;",
4836 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
4837 fprintf(fout, " %s = %s;",
4838 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4839 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4840 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4841 fprintf(fout, " %s = %stmp;",
4842 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
4843 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
4844 snprintf(g_comment, sizeof(g_comment), "xchg");
4848 assert_operand_cnt(1);
4849 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4850 fprintf(fout, " %s = ~%s;", buf1, buf1);
4854 assert_operand_cnt(2);
4855 fprintf(fout, " %s = (s32)%s >> 31;",
4856 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4857 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4858 strcpy(g_comment, "cdq");
4862 assert_operand_cnt(3);
4863 if (po->flags & OPF_REP) {
4868 fprintf(fout, " eax = %sesi; esi %c= %d;",
4869 lmod_cast_u_ptr(po, po->operand[0].lmod),
4870 (po->flags & OPF_DF) ? '-' : '+',
4871 lmod_bytes(po, po->operand[0].lmod));
4872 strcpy(g_comment, "lods");
4877 assert_operand_cnt(3);
4878 if (po->flags & OPF_REP) {
4879 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
4880 (po->flags & OPF_DF) ? '-' : '+',
4881 lmod_bytes(po, po->operand[0].lmod));
4882 fprintf(fout, " %sedi = eax;",
4883 lmod_cast_u_ptr(po, po->operand[0].lmod));
4884 strcpy(g_comment, "rep stos");
4887 fprintf(fout, " %sedi = eax; edi %c= %d;",
4888 lmod_cast_u_ptr(po, po->operand[0].lmod),
4889 (po->flags & OPF_DF) ? '-' : '+',
4890 lmod_bytes(po, po->operand[0].lmod));
4891 strcpy(g_comment, "stos");
4896 assert_operand_cnt(3);
4897 j = lmod_bytes(po, po->operand[0].lmod);
4898 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4899 l = (po->flags & OPF_DF) ? '-' : '+';
4900 if (po->flags & OPF_REP) {
4902 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
4905 " %sedi = %sesi;", buf1, buf1);
4906 strcpy(g_comment, "rep movs");
4909 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
4910 buf1, buf1, l, j, l, j);
4911 strcpy(g_comment, "movs");
4916 // repe ~ repeat while ZF=1
4917 assert_operand_cnt(3);
4918 j = lmod_bytes(po, po->operand[0].lmod);
4919 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4920 l = (po->flags & OPF_DF) ? '-' : '+';
4921 if (po->flags & OPF_REP) {
4923 " for (; ecx != 0; ecx--) {\n");
4924 if (pfomask & (1 << PFO_C)) {
4927 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4928 pfomask &= ~(1 << PFO_C);
4931 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4932 buf1, buf1, l, j, l, j);
4934 " if (cond_z %s 0) break;\n",
4935 (po->flags & OPF_REPZ) ? "==" : "!=");
4938 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4939 (po->flags & OPF_REPZ) ? "e" : "ne");
4943 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4944 buf1, buf1, l, j, l, j);
4945 strcpy(g_comment, "cmps");
4947 pfomask &= ~(1 << PFO_Z);
4948 last_arith_dst = NULL;
4949 delayed_flag_op = NULL;
4953 // only does ZF (for now)
4954 // repe ~ repeat while ZF=1
4955 assert_operand_cnt(3);
4956 j = lmod_bytes(po, po->operand[0].lmod);
4957 l = (po->flags & OPF_DF) ? '-' : '+';
4958 if (po->flags & OPF_REP) {
4960 " for (; ecx != 0; ecx--) {\n");
4962 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4963 lmod_cast_u(po, po->operand[0].lmod),
4964 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4966 " if (cond_z %s 0) break;\n",
4967 (po->flags & OPF_REPZ) ? "==" : "!=");
4970 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4971 (po->flags & OPF_REPZ) ? "e" : "ne");
4974 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4975 lmod_cast_u(po, po->operand[0].lmod),
4976 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4977 strcpy(g_comment, "scas");
4979 pfomask &= ~(1 << PFO_Z);
4980 last_arith_dst = NULL;
4981 delayed_flag_op = NULL;
4984 // arithmetic w/flags
4986 if (po->operand[1].type == OPT_CONST && !po->operand[1].val) {
4987 // deal with complex dst clear
4988 assert_operand_cnt(2);
4989 fprintf(fout, " %s = %s;",
4990 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4991 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4992 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4993 output_std_flags(fout, po, &pfomask, buf1);
4994 last_arith_dst = &po->operand[0];
4995 delayed_flag_op = NULL;
5000 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5003 assert_operand_cnt(2);
5004 fprintf(fout, " %s %s= %s;",
5005 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5007 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5008 output_std_flags(fout, po, &pfomask, buf1);
5009 last_arith_dst = &po->operand[0];
5010 delayed_flag_op = NULL;
5015 assert_operand_cnt(2);
5016 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5017 if (pfomask & (1 << PFO_C)) {
5018 if (po->operand[1].type == OPT_CONST) {
5019 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5020 j = po->operand[1].val;
5023 if (po->op == OP_SHL)
5027 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
5031 ferr(po, "zero shift?\n");
5035 pfomask &= ~(1 << PFO_C);
5037 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
5038 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5039 output_std_flags(fout, po, &pfomask, buf1);
5040 last_arith_dst = &po->operand[0];
5041 delayed_flag_op = NULL;
5045 assert_operand_cnt(2);
5046 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5047 fprintf(fout, " %s = %s%s >> %s;", buf1,
5048 lmod_cast_s(po, po->operand[0].lmod), buf1,
5049 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5050 output_std_flags(fout, po, &pfomask, buf1);
5051 last_arith_dst = &po->operand[0];
5052 delayed_flag_op = NULL;
5056 assert_operand_cnt(3);
5057 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5058 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5059 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5060 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5061 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
5062 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
5063 buf1, buf3, buf1, buf2, l, buf3);
5064 strcpy(g_comment, "shrd");
5065 output_std_flags(fout, po, &pfomask, buf1);
5066 last_arith_dst = &po->operand[0];
5067 delayed_flag_op = NULL;
5072 assert_operand_cnt(2);
5073 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5074 if (po->operand[1].type == OPT_CONST) {
5075 j = po->operand[1].val;
5076 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
5077 fprintf(fout, po->op == OP_ROL ?
5078 " %s = (%s << %d) | (%s >> %d);" :
5079 " %s = (%s >> %d) | (%s << %d);",
5080 buf1, buf1, j, buf1,
5081 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
5085 output_std_flags(fout, po, &pfomask, buf1);
5086 last_arith_dst = &po->operand[0];
5087 delayed_flag_op = NULL;
5092 assert_operand_cnt(2);
5093 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5094 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5095 if (po->operand[1].type == OPT_CONST) {
5096 j = po->operand[1].val % l;
5098 ferr(po, "zero rotate\n");
5099 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
5100 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
5101 if (po->op == OP_RCL) {
5103 " %s = (%s << %d) | (cond_c << %d)",
5104 buf1, buf1, j, j - 1);
5106 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
5110 " %s = (%s >> %d) | (cond_c << %d)",
5111 buf1, buf1, j, l - j);
5113 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
5115 fprintf(fout, ";\n");
5116 fprintf(fout, " cond_c = tmp;");
5120 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
5121 output_std_flags(fout, po, &pfomask, buf1);
5122 last_arith_dst = &po->operand[0];
5123 delayed_flag_op = NULL;
5127 assert_operand_cnt(2);
5128 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5129 if (IS(opr_name(po, 0), opr_name(po, 1))) {
5130 // special case for XOR
5131 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
5132 fprintf(fout, " cond_be = 1;\n");
5133 pfomask &= ~(1 << PFO_BE);
5135 fprintf(fout, " %s = 0;",
5136 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5137 last_arith_dst = &po->operand[0];
5138 delayed_flag_op = NULL;
5144 assert_operand_cnt(2);
5145 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5146 if (pfomask & (1 << PFO_C)) {
5147 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5148 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5149 if (po->operand[0].lmod == OPLM_DWORD) {
5150 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
5151 fprintf(fout, " cond_c = tmp64 >> 32;\n");
5152 fprintf(fout, " %s = (u32)tmp64;",
5153 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5154 strcat(g_comment, "add64");
5157 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
5158 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
5159 fprintf(fout, " %s += %s;",
5160 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5163 pfomask &= ~(1 << PFO_C);
5164 output_std_flags(fout, po, &pfomask, buf1);
5165 last_arith_dst = &po->operand[0];
5166 delayed_flag_op = NULL;
5172 assert_operand_cnt(2);
5173 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5174 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
5175 for (j = 0; j <= PFO_LE; j++) {
5176 if (!(pfomask & (1 << j)))
5178 if (j == PFO_Z || j == PFO_S)
5181 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5182 fprintf(fout, " cond_%s = %s;\n",
5183 parsed_flag_op_names[j], buf1);
5184 pfomask &= ~(1 << j);
5191 assert_operand_cnt(2);
5192 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5193 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5194 if (po->op == OP_SBB
5195 && IS(po->operand[0].name, po->operand[1].name))
5197 // avoid use of unitialized var
5198 fprintf(fout, " %s = -cond_c;", buf1);
5199 // carry remains what it was
5200 pfomask &= ~(1 << PFO_C);
5203 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
5204 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5206 output_std_flags(fout, po, &pfomask, buf1);
5207 last_arith_dst = &po->operand[0];
5208 delayed_flag_op = NULL;
5212 assert_operand_cnt(2);
5213 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5214 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
5215 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5217 output_std_flags(fout, po, &pfomask, buf1);
5218 last_arith_dst = &po->operand[0];
5219 delayed_flag_op = NULL;
5220 strcat(g_comment, "bsf");
5224 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
5225 for (j = 0; j <= PFO_LE; j++) {
5226 if (!(pfomask & (1 << j)))
5228 if (j == PFO_Z || j == PFO_S || j == PFO_C)
5231 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5232 fprintf(fout, " cond_%s = %s;\n",
5233 parsed_flag_op_names[j], buf1);
5234 pfomask &= ~(1 << j);
5240 if (pfomask & (1 << PFO_C))
5241 // carry is unaffected by inc/dec.. wtf?
5242 ferr(po, "carry propagation needed\n");
5244 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5245 if (po->operand[0].type == OPT_REG) {
5246 strcpy(buf2, po->op == OP_INC ? "++" : "--");
5247 fprintf(fout, " %s%s;", buf1, buf2);
5250 strcpy(buf2, po->op == OP_INC ? "+" : "-");
5251 fprintf(fout, " %s %s= 1;", buf1, buf2);
5253 output_std_flags(fout, po, &pfomask, buf1);
5254 last_arith_dst = &po->operand[0];
5255 delayed_flag_op = NULL;
5259 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5260 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
5261 fprintf(fout, " %s = -%s%s;", buf1,
5262 lmod_cast_s(po, po->operand[0].lmod), buf2);
5263 last_arith_dst = &po->operand[0];
5264 delayed_flag_op = NULL;
5265 if (pfomask & (1 << PFO_C)) {
5266 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
5267 pfomask &= ~(1 << PFO_C);
5272 if (po->operand_cnt == 2) {
5273 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5276 if (po->operand_cnt == 3)
5277 ferr(po, "TODO imul3\n");
5280 assert_operand_cnt(1);
5281 switch (po->operand[0].lmod) {
5283 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
5284 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
5285 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
5286 fprintf(fout, " edx = tmp64 >> 32;\n");
5287 fprintf(fout, " eax = tmp64;");
5290 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
5291 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
5292 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
5296 ferr(po, "TODO: unhandled mul type\n");
5299 last_arith_dst = NULL;
5300 delayed_flag_op = NULL;
5305 assert_operand_cnt(1);
5306 if (po->operand[0].lmod != OPLM_DWORD)
5307 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
5309 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5310 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
5311 po->op == OP_IDIV));
5312 switch (po->operand[0].lmod) {
5314 if (po->flags & OPF_32BIT)
5315 snprintf(buf3, sizeof(buf3), "%seax", buf2);
5317 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
5318 snprintf(buf3, sizeof(buf3), "%stmp64",
5319 (po->op == OP_IDIV) ? "(s64)" : "");
5321 if (po->operand[0].type == OPT_REG
5322 && po->operand[0].reg == xDX)
5324 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
5325 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
5328 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
5329 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
5333 ferr(po, "unhandled division type\n");
5335 last_arith_dst = NULL;
5336 delayed_flag_op = NULL;
5341 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5343 for (j = 0; j < 8; j++) {
5344 if (pfomask & (1 << j)) {
5345 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
5346 fprintf(fout, " cond_%s = %s;",
5347 parsed_flag_op_names[j], buf1);
5354 last_arith_dst = NULL;
5355 delayed_flag_op = po;
5359 // SETcc - should already be handled
5362 // note: we reuse OP_Jcc for SETcc, only flags differ
5364 fprintf(fout, "\n goto %s;", po->operand[0].name);
5368 fprintf(fout, " if (ecx == 0)\n");
5369 fprintf(fout, " goto %s;", po->operand[0].name);
5370 strcat(g_comment, "jecxz");
5374 assert_operand_cnt(1);
5375 last_arith_dst = NULL;
5376 delayed_flag_op = NULL;
5378 if (po->operand[0].type == OPT_REGMEM) {
5379 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
5382 ferr(po, "parse failure for jmp '%s'\n",
5383 po->operand[0].name);
5384 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
5387 else if (po->operand[0].type != OPT_LABEL)
5388 ferr(po, "unhandled jmp type\n");
5390 fprintf(fout, " goto %s;", po->operand[0].name);
5394 assert_operand_cnt(1);
5396 my_assert_not(pp, NULL);
5399 if (po->flags & OPF_CC) {
5400 // we treat conditional branch to another func
5401 // (yes such code exists..) as conditional tailcall
5403 fprintf(fout, " {\n");
5406 if (pp->is_fptr && !pp->is_arg) {
5407 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
5408 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
5410 if (pp->is_unresolved)
5411 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
5412 buf3, asmfn, po->asmln, pp->name);
5415 fprintf(fout, "%s", buf3);
5416 if (strstr(pp->ret_type.name, "int64")) {
5417 if (po->flags & OPF_TAIL)
5418 ferr(po, "int64 and tail?\n");
5419 fprintf(fout, "tmp64 = ");
5421 else if (!IS(pp->ret_type.name, "void")) {
5422 if (po->flags & OPF_TAIL) {
5423 if (!IS(g_func_pp->ret_type.name, "void")) {
5424 fprintf(fout, "return ");
5425 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
5426 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
5429 else if (regmask & (1 << xAX)) {
5430 fprintf(fout, "eax = ");
5431 if (pp->ret_type.is_ptr)
5432 fprintf(fout, "(u32)");
5436 if (pp->name[0] == 0)
5437 ferr(po, "missing pp->name\n");
5438 fprintf(fout, "%s%s(", pp->name,
5439 pp->has_structarg ? "_sa" : "");
5441 if (po->flags & OPF_ATAIL) {
5442 if (pp->argc_stack != g_func_pp->argc_stack
5443 || (pp->argc_stack > 0
5444 && pp->is_stdcall != g_func_pp->is_stdcall))
5445 ferr(po, "incompatible tailcall\n");
5446 if (g_func_pp->has_retreg)
5447 ferr(po, "TODO: retreg+tailcall\n");
5449 for (arg = j = 0; arg < pp->argc; arg++) {
5451 fprintf(fout, ", ");
5454 if (pp->arg[arg].type.is_ptr)
5455 snprintf(cast, sizeof(cast), "(%s)",
5456 pp->arg[arg].type.name);
5458 if (pp->arg[arg].reg != NULL) {
5459 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5463 for (; j < g_func_pp->argc; j++)
5464 if (g_func_pp->arg[j].reg == NULL)
5466 fprintf(fout, "%sa%d", cast, j + 1);
5471 for (arg = 0; arg < pp->argc; arg++) {
5473 fprintf(fout, ", ");
5476 if (pp->arg[arg].type.is_ptr)
5477 snprintf(cast, sizeof(cast), "(%s)",
5478 pp->arg[arg].type.name);
5480 if (pp->arg[arg].reg != NULL) {
5481 if (pp->arg[arg].type.is_retreg)
5482 fprintf(fout, "&%s", pp->arg[arg].reg);
5484 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5489 tmp_op = pp->arg[arg].datap;
5491 ferr(po, "parsed_op missing for arg%d\n", arg);
5493 if (tmp_op->flags & OPF_VAPUSH) {
5494 fprintf(fout, "ap");
5496 else if (tmp_op->p_argpass != 0) {
5497 fprintf(fout, "a%d", tmp_op->p_argpass);
5499 else if (tmp_op->p_argnum != 0) {
5500 fprintf(fout, "%s%s", cast,
5501 saved_arg_name(buf1, sizeof(buf1),
5502 tmp_op->p_arggrp, tmp_op->p_argnum));
5506 out_src_opr(buf1, sizeof(buf1),
5507 tmp_op, &tmp_op->operand[0], cast, 0));
5511 fprintf(fout, ");");
5513 if (strstr(pp->ret_type.name, "int64")) {
5514 fprintf(fout, "\n");
5515 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
5516 fprintf(fout, "%seax = tmp64;", buf3);
5519 if (pp->is_unresolved) {
5520 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
5522 strcat(g_comment, buf2);
5525 if (po->flags & OPF_TAIL) {
5527 if (i == opcnt - 1 || pp->is_noreturn)
5529 else if (IS(pp->ret_type.name, "void"))
5531 else if (IS(g_func_pp->ret_type.name, "void"))
5533 // else already handled as 'return f()'
5536 if (!IS(g_func_pp->ret_type.name, "void")) {
5537 ferr(po, "int func -> void func tailcall?\n");
5540 fprintf(fout, "\n%sreturn;", buf3);
5541 strcat(g_comment, " ^ tailcall");
5545 strcat(g_comment, " tailcall");
5547 if (pp->is_noreturn)
5548 strcat(g_comment, " noreturn");
5549 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
5550 strcat(g_comment, " argframe");
5551 if (po->flags & OPF_CC)
5552 strcat(g_comment, " cond");
5554 if (po->flags & OPF_CC)
5555 fprintf(fout, "\n }");
5557 delayed_flag_op = NULL;
5558 last_arith_dst = NULL;
5562 if (g_func_pp->is_vararg)
5563 fprintf(fout, " va_end(ap);\n");
5564 if (g_func_pp->has_retreg) {
5565 for (arg = 0; arg < g_func_pp->argc; arg++)
5566 if (g_func_pp->arg[arg].type.is_retreg)
5567 fprintf(fout, " *r_%s = %s;\n",
5568 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
5571 if (IS(g_func_pp->ret_type.name, "void")) {
5572 if (i != opcnt - 1 || label_pending)
5573 fprintf(fout, " return;");
5575 else if (g_func_pp->ret_type.is_ptr) {
5576 fprintf(fout, " return (%s)eax;",
5577 g_func_pp->ret_type.name);
5579 else if (IS(g_func_pp->ret_type.name, "__int64"))
5580 fprintf(fout, " return ((u64)edx << 32) | eax;");
5582 fprintf(fout, " return eax;");
5584 last_arith_dst = NULL;
5585 delayed_flag_op = NULL;
5589 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5590 if (po->p_argnum != 0) {
5591 // special case - saved func arg
5592 fprintf(fout, " %s = %s;",
5593 saved_arg_name(buf2, sizeof(buf2),
5594 po->p_arggrp, po->p_argnum), buf1);
5597 else if (po->flags & OPF_RSAVE) {
5598 fprintf(fout, " s_%s = %s;", buf1, buf1);
5601 else if (po->flags & OPF_PPUSH) {
5603 ferr_assert(po, tmp_op != NULL);
5604 out_dst_opr(buf2, sizeof(buf2), po, &tmp_op->operand[0]);
5605 fprintf(fout, " pp_%s = %s;", buf2, buf1);
5608 else if (g_func_pp->is_userstack) {
5609 fprintf(fout, " *(--esp) = %s;", buf1);
5612 if (!(g_ida_func_attr & IDAFA_NORETURN))
5613 ferr(po, "stray push encountered\n");
5618 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5619 if (po->flags & OPF_RSAVE) {
5620 fprintf(fout, " %s = s_%s;", buf1, buf1);
5623 else if (po->flags & OPF_PPUSH) {
5625 ferr_assert(po, po->datap == NULL);
5626 fprintf(fout, " %s = pp_%s;", buf1, buf1);
5629 else if (po->datap != NULL) {
5632 fprintf(fout, " %s = %s;", buf1,
5633 out_src_opr(buf2, sizeof(buf2),
5634 tmp_op, &tmp_op->operand[0],
5635 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5638 else if (g_func_pp->is_userstack) {
5639 fprintf(fout, " %s = *esp++;", buf1);
5643 ferr(po, "stray pop encountered\n");
5652 strcpy(g_comment, "(emms)");
5657 ferr(po, "unhandled op type %d, flags %x\n",
5662 if (g_comment[0] != 0) {
5663 char *p = g_comment;
5664 while (my_isblank(*p))
5666 fprintf(fout, " // %s", p);
5671 fprintf(fout, "\n");
5673 // some sanity checking
5674 if (po->flags & OPF_REP) {
5675 if (po->op != OP_STOS && po->op != OP_MOVS
5676 && po->op != OP_CMPS && po->op != OP_SCAS)
5677 ferr(po, "unexpected rep\n");
5678 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
5679 && (po->op == OP_CMPS || po->op == OP_SCAS))
5680 ferr(po, "cmps/scas with plain rep\n");
5682 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
5683 && po->op != OP_CMPS && po->op != OP_SCAS)
5684 ferr(po, "unexpected repz/repnz\n");
5687 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
5689 // see is delayed flag stuff is still valid
5690 if (delayed_flag_op != NULL && delayed_flag_op != po) {
5691 if (is_any_opr_modified(delayed_flag_op, po, 0))
5692 delayed_flag_op = NULL;
5695 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
5696 if (is_opr_modified(last_arith_dst, po))
5697 last_arith_dst = NULL;
5703 if (g_stack_fsz && !g_stack_frame_used)
5704 fprintf(fout, " (void)sf;\n");
5706 fprintf(fout, "}\n\n");
5708 gen_x_cleanup(opcnt);
5711 static void gen_x_cleanup(int opcnt)
5715 for (i = 0; i < opcnt; i++) {
5716 struct label_ref *lr, *lr_del;
5718 lr = g_label_refs[i].next;
5719 while (lr != NULL) {
5724 g_label_refs[i].i = -1;
5725 g_label_refs[i].next = NULL;
5727 if (ops[i].op == OP_CALL) {
5729 proto_release(ops[i].pp);
5735 struct func_proto_dep;
5737 struct func_prototype {
5742 int has_ret:3; // -1, 0, 1: unresolved, no, yes
5743 unsigned int dep_resolved:1;
5744 unsigned int is_stdcall:1;
5745 struct func_proto_dep *dep_func;
5747 const struct parsed_proto *pp; // seed pp, if any
5750 struct func_proto_dep {
5752 struct func_prototype *proto;
5753 int regmask_live; // .. at the time of call
5754 unsigned int ret_dep:1; // return from this is caller's return
5757 static struct func_prototype *hg_fp;
5758 static int hg_fp_cnt;
5760 static struct scanned_var {
5762 enum opr_lenmod lmod;
5763 unsigned int is_seeded:1;
5764 unsigned int is_c_str:1;
5765 const struct parsed_proto *pp; // seed pp, if any
5767 static int hg_var_cnt;
5769 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
5772 struct func_prototype *hg_fp_add(const char *funcn)
5774 struct func_prototype *fp;
5776 if ((hg_fp_cnt & 0xff) == 0) {
5777 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
5778 my_assert_not(hg_fp, NULL);
5779 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
5782 fp = &hg_fp[hg_fp_cnt];
5783 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
5785 fp->argc_stack = -1;
5791 static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
5796 for (i = 0; i < fp->dep_func_cnt; i++)
5797 if (IS(fp->dep_func[i].name, name))
5798 return &fp->dep_func[i];
5803 static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
5806 if (hg_fp_find_dep(fp, name))
5809 if ((fp->dep_func_cnt & 0xff) == 0) {
5810 fp->dep_func = realloc(fp->dep_func,
5811 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
5812 my_assert_not(fp->dep_func, NULL);
5813 memset(&fp->dep_func[fp->dep_func_cnt], 0,
5814 sizeof(fp->dep_func[0]) * 0x100);
5816 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
5820 static int hg_fp_cmp_name(const void *p1_, const void *p2_)
5822 const struct func_prototype *p1 = p1_, *p2 = p2_;
5823 return strcmp(p1->name, p2->name);
5827 static int hg_fp_cmp_id(const void *p1_, const void *p2_)
5829 const struct func_prototype *p1 = p1_, *p2 = p2_;
5830 return p1->id - p2->id;
5834 // recursive register dep pass
5835 // - track saved regs (part 2)
5836 // - try to figure out arg-regs
5837 // - calculate reg deps
5838 static void gen_hdr_dep_pass(int i, int opcnt, unsigned char *cbits,
5839 struct func_prototype *fp, int regmask_save, int regmask_dst,
5840 int *regmask_dep, int *has_ret)
5842 struct func_proto_dep *dep;
5843 struct parsed_op *po;
5844 int from_caller = 0;
5850 for (; i < opcnt; i++)
5852 if (cbits[i >> 3] & (1 << (i & 7)))
5854 cbits[i >> 3] |= (1 << (i & 7));
5858 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
5859 if (po->btj != NULL) {
5861 for (j = 0; j < po->btj->count; j++) {
5862 check_i(po, po->btj->d[j].bt_i);
5863 gen_hdr_dep_pass(po->btj->d[j].bt_i, opcnt, cbits, fp,
5864 regmask_save, regmask_dst, regmask_dep, has_ret);
5869 check_i(po, po->bt_i);
5870 if (po->flags & OPF_CJMP) {
5871 gen_hdr_dep_pass(po->bt_i, opcnt, cbits, fp,
5872 regmask_save, regmask_dst, regmask_dep, has_ret);
5880 if (po->flags & OPF_FARG)
5881 /* (just calculate register deps) */;
5882 else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
5884 reg = po->operand[0].reg;
5886 ferr(po, "reg not set for push?\n");
5888 if (po->flags & OPF_RSAVE) {
5889 regmask_save |= 1 << reg;
5892 if (po->flags & OPF_DONE)
5896 ret = scan_for_pop(i + 1, opcnt,
5897 po->operand[0].name, i + opcnt * 2, 0, &depth, 0);
5899 regmask_save |= 1 << reg;
5900 po->flags |= OPF_RMD;
5901 scan_for_pop(i + 1, opcnt,
5902 po->operand[0].name, i + opcnt * 3, 0, &depth, 1);
5906 else if (po->flags & OPF_RMD)
5908 else if (po->op == OP_CALL) {
5909 po->regmask_dst |= 1 << xAX;
5911 dep = hg_fp_find_dep(fp, po->operand[0].name);
5913 dep->regmask_live = regmask_save | regmask_dst;
5915 else if (po->op == OP_RET) {
5916 if (po->operand_cnt > 0) {
5918 if (fp->argc_stack >= 0
5919 && fp->argc_stack != po->operand[0].val / 4)
5920 ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4);
5921 fp->argc_stack = po->operand[0].val / 4;
5925 // if has_ret is 0, there is uninitialized eax path,
5926 // which means it's most likely void func
5927 if (*has_ret != 0 && (po->flags & OPF_TAIL)) {
5928 if (po->op == OP_CALL) {
5933 struct parsed_opr opr = { 0, };
5938 ret = resolve_origin(i, &opr, i + opcnt * 4, &j, &from_caller);
5941 if (ret != 1 && from_caller) {
5942 // unresolved eax - probably void func
5946 if (j >= 0 && ops[j].op == OP_CALL) {
5947 dep = hg_fp_find_dep(fp, ops[j].operand[0].name);
5958 l = regmask_save | regmask_dst;
5959 if (g_bp_frame && !(po->flags & OPF_EBP_S))
5962 l = po->regmask_src & ~l;
5965 fnote(po, "dep |= %04x, dst %04x, save %04x (f %x)\n",
5966 l, regmask_dst, regmask_save, po->flags);
5969 regmask_dst |= po->regmask_dst;
5971 if (po->flags & OPF_TAIL)
5976 static void gen_hdr(const char *funcn, int opcnt)
5978 int save_arg_vars[MAX_ARG_GRP] = { 0, };
5979 unsigned char cbits[MAX_OPS / 8];
5980 const struct parsed_proto *pp_c;
5981 struct parsed_proto *pp;
5982 struct func_prototype *fp;
5983 struct parsed_op *po;
5984 int regmask_dummy = 0;
5986 int max_bp_offset = 0;
5990 pp_c = proto_parse(g_fhdr, funcn, 1);
5992 // already in seed, will add to hg_fp later
5995 fp = hg_fp_add(funcn);
5997 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
5998 g_stack_frame_used = 0;
6001 // - resolve all branches
6002 // - parse calls with labels
6003 resolve_branches_parse_calls(opcnt);
6006 // - handle ebp/esp frame, remove ops related to it
6007 scan_prologue_epilogue(opcnt);
6010 // - remove dead labels
6012 for (i = 0; i < opcnt; i++)
6014 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6020 if (po->flags & (OPF_RMD|OPF_DONE))
6023 if (po->op == OP_CALL) {
6024 if (po->operand[0].type == OPT_LABEL)
6025 hg_fp_add_dep(fp, opr_name(po, 0));
6026 else if (po->pp != NULL)
6027 hg_fp_add_dep(fp, po->pp->name);
6032 // - remove dead labels
6033 // - handle push <const>/pop pairs
6034 for (i = 0; i < opcnt; i++)
6036 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6042 if (po->flags & (OPF_RMD|OPF_DONE))
6045 if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST)
6046 scan_for_pop_const(i, opcnt, ®mask_dummy);
6050 // - process trivial calls
6051 for (i = 0; i < opcnt; i++)
6054 if (po->flags & (OPF_RMD|OPF_DONE))
6057 if (po->op == OP_CALL)
6059 pp = process_call_early(i, opcnt, &j);
6061 if (!(po->flags & OPF_ATAIL))
6062 // since we know the args, try to collect them
6063 if (collect_call_args_early(po, i, pp, ®mask_dummy) != 0)
6069 // commit esp adjust
6070 ops[j].flags |= OPF_RMD;
6071 if (ops[j].op != OP_POP)
6072 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
6074 ops[j].flags |= OPF_DONE;
6077 po->flags |= OPF_DONE;
6083 // - track saved regs (simple)
6085 for (i = 0; i < opcnt; i++)
6088 if (po->flags & (OPF_RMD|OPF_DONE))
6091 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
6093 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
6095 // regmask_save |= 1 << po->operand[0].reg; // do it later
6096 po->flags |= OPF_RSAVE | OPF_RMD | OPF_DONE;
6097 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, OPF_RMD);
6100 else if (po->op == OP_CALL && !(po->flags & OPF_DONE))
6102 pp = process_call(i, opcnt);
6104 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
6105 // since we know the args, collect them
6106 ret = collect_call_args(po, i, pp, ®mask_dummy, save_arg_vars,
6113 memset(cbits, 0, sizeof(cbits));
6117 gen_hdr_dep_pass(0, opcnt, cbits, fp, 0, 0, ®mask_dep, &has_ret);
6119 // find unreachable code - must be fixed in IDA
6120 for (i = 0; i < opcnt; i++)
6122 if (cbits[i >> 3] & (1 << (i & 7)))
6125 if (ops[i].op != OP_NOP)
6126 ferr(&ops[i], "unreachable code\n");
6129 for (i = 0; i < g_eqcnt; i++) {
6130 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
6131 max_bp_offset = g_eqs[i].offset;
6134 if (fp->argc_stack < 0) {
6135 max_bp_offset = (max_bp_offset + 3) & ~3;
6136 fp->argc_stack = max_bp_offset / 4;
6137 if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0)
6141 fp->regmask_dep = regmask_dep & ~(1 << xSP);
6142 fp->has_ret = has_ret;
6144 printf("// has_ret %d, regmask_dep %x\n",
6145 fp->has_ret, fp->regmask_dep);
6146 output_hdr_fp(stdout, fp, 1);
6147 if (IS(funcn, "sub_10007F72")) exit(1);
6150 gen_x_cleanup(opcnt);
6153 static void hg_fp_resolve_deps(struct func_prototype *fp)
6155 struct func_prototype fp_s;
6159 // this thing is recursive, so mark first..
6160 fp->dep_resolved = 1;
6162 for (i = 0; i < fp->dep_func_cnt; i++) {
6163 strcpy(fp_s.name, fp->dep_func[i].name);
6164 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
6165 sizeof(hg_fp[0]), hg_fp_cmp_name);
6166 if (fp->dep_func[i].proto != NULL) {
6167 if (!fp->dep_func[i].proto->dep_resolved)
6168 hg_fp_resolve_deps(fp->dep_func[i].proto);
6170 dep = ~fp->dep_func[i].regmask_live
6171 & fp->dep_func[i].proto->regmask_dep;
6172 fp->regmask_dep |= dep;
6173 // printf("dep %s %s |= %x\n", fp->name,
6174 // fp->dep_func[i].name, dep);
6176 if (fp->has_ret == -1 && fp->dep_func[i].ret_dep)
6177 fp->has_ret = fp->dep_func[i].proto->has_ret;
6182 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
6185 const struct parsed_proto *pp;
6186 char *p, namebuf[NAMELEN];
6192 for (; count > 0; count--, fp++) {
6193 if (fp->has_ret == -1)
6194 fprintf(fout, "// ret unresolved\n");
6196 fprintf(fout, "// dep:");
6197 for (j = 0; j < fp->dep_func_cnt; j++) {
6198 fprintf(fout, " %s/", fp->dep_func[j].name);
6199 if (fp->dep_func[j].proto != NULL)
6200 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
6201 fp->dep_func[j].proto->has_ret);
6203 fprintf(fout, "\n");
6206 p = strchr(fp->name, '@');
6208 memcpy(namebuf, fp->name, p - fp->name);
6209 namebuf[p - fp->name] = 0;
6217 pp = proto_parse(g_fhdr, name, 1);
6218 if (pp != NULL && pp->is_include)
6221 if (fp->pp != NULL) {
6222 // part of seed, output later
6226 regmask_dep = fp->regmask_dep;
6227 argc_stack = fp->argc_stack;
6229 fprintf(fout, "%-5s", fp->pp ? fp->pp->ret_type.name :
6230 (fp->has_ret ? "int" : "void"));
6231 if (regmask_dep && (fp->is_stdcall || argc_stack == 0)
6232 && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0)
6234 fprintf(fout, " __fastcall ");
6235 if (!(regmask_dep & (1 << xDX)) && argc_stack == 0)
6241 else if (regmask_dep && !fp->is_stdcall) {
6242 fprintf(fout, "/*__usercall*/ ");
6244 else if (regmask_dep) {
6245 fprintf(fout, "/*__userpurge*/ ");
6247 else if (fp->is_stdcall)
6248 fprintf(fout, " __stdcall ");
6250 fprintf(fout, " __cdecl ");
6252 fprintf(fout, "%s(", name);
6255 for (j = 0; j < xSP; j++) {
6256 if (regmask_dep & (1 << j)) {
6259 fprintf(fout, ", ");
6261 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6263 fprintf(fout, "int");
6264 fprintf(fout, " a%d/*<%s>*/", arg, regs_r32[j]);
6268 for (j = 0; j < argc_stack; j++) {
6271 fprintf(fout, ", ");
6272 if (fp->pp != NULL) {
6273 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6274 if (!fp->pp->arg[arg - 1].type.is_ptr)
6278 fprintf(fout, "int ");
6279 fprintf(fout, "a%d", arg);
6282 fprintf(fout, ");\n");
6286 static void output_hdr(FILE *fout)
6288 static const char *lmod_c_names[] = {
6289 [OPLM_UNSPEC] = "???",
6290 [OPLM_BYTE] = "uint8_t",
6291 [OPLM_WORD] = "uint16_t",
6292 [OPLM_DWORD] = "uint32_t",
6293 [OPLM_QWORD] = "uint64_t",
6295 const struct scanned_var *var;
6296 struct func_prototype *fp;
6297 char line[256] = { 0, };
6301 // add stuff from headers
6302 for (i = 0; i < pp_cache_size; i++) {
6303 if (pp_cache[i].is_cinc && !pp_cache[i].is_stdcall)
6304 snprintf(name, sizeof(name), "_%s", pp_cache[i].name);
6306 snprintf(name, sizeof(name), "%s", pp_cache[i].name);
6307 fp = hg_fp_add(name);
6308 fp->pp = &pp_cache[i];
6309 fp->argc_stack = fp->pp->argc_stack;
6310 fp->is_stdcall = fp->pp->is_stdcall;
6311 fp->regmask_dep = get_pp_arg_regmask(fp->pp);
6312 fp->has_ret = !IS(fp->pp->ret_type.name, "void");
6316 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
6317 for (i = 0; i < hg_fp_cnt; i++)
6318 hg_fp_resolve_deps(&hg_fp[i]);
6320 // note: messes up .proto ptr, don't use
6321 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
6324 for (i = 0; i < hg_var_cnt; i++) {
6327 if (var->pp != NULL)
6330 else if (var->is_c_str)
6331 fprintf(fout, "extern %-8s %s[];", "char", var->name);
6333 fprintf(fout, "extern %-8s %s;",
6334 lmod_c_names[var->lmod], var->name);
6337 fprintf(fout, " // seeded");
6338 fprintf(fout, "\n");
6341 fprintf(fout, "\n");
6343 // output function prototypes
6344 output_hdr_fp(fout, hg_fp, hg_fp_cnt);
6347 fprintf(fout, "\n// - seed -\n");
6350 while (fgets(line, sizeof(line), g_fhdr))
6351 fwrite(line, 1, strlen(line), fout);
6354 // '=' needs special treatment
6356 static char *next_word_s(char *w, size_t wsize, char *s)
6365 for (i = 1; i < wsize - 1; i++) {
6367 printf("warning: missing closing quote: \"%s\"\n", s);
6376 for (; i < wsize - 1; i++) {
6377 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
6383 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
6384 printf("warning: '%s' truncated\n", w);
6389 static void scan_variables(FILE *fasm)
6391 struct scanned_var *var;
6392 char line[256] = { 0, };
6400 // skip to next data section
6401 while (my_fgets(line, sizeof(line), fasm))
6406 if (*p == 0 || *p == ';')
6409 p = sskip(next_word_s(words[0], sizeof(words[0]), p));
6410 if (*p == 0 || *p == ';')
6413 if (*p != 's' || !IS_START(p, "segment para public"))
6419 if (p == NULL || !IS_START(p, "segment para public"))
6423 if (!IS_START(p, "'DATA'"))
6427 while (my_fgets(line, sizeof(line), fasm))
6436 if (*p == 0 || *p == ';')
6439 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6440 words[wordc][0] = 0;
6441 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6442 if (*p == 0 || *p == ';') {
6448 if (wordc == 2 && IS(words[1], "ends"))
6453 if (IS_START(words[0], "__IMPORT_DESCRIPTOR_")) {
6454 // when this starts, we don't need anything from this section
6458 if ((hg_var_cnt & 0xff) == 0) {
6459 hg_vars = realloc(hg_vars, sizeof(hg_vars[0])
6460 * (hg_var_cnt + 0x100));
6461 my_assert_not(hg_vars, NULL);
6462 memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100);
6465 var = &hg_vars[hg_var_cnt++];
6466 snprintf(var->name, sizeof(var->name), "%s", words[0]);
6468 // maybe already in seed header?
6469 var->pp = proto_parse(g_fhdr, var->name, 1);
6470 if (var->pp != NULL) {
6471 if (var->pp->is_fptr) {
6472 var->lmod = OPLM_DWORD;
6475 else if (var->pp->is_func)
6477 else if (!guess_lmod_from_c_type(&var->lmod, &var->pp->type))
6478 aerr("unhandled C type '%s' for '%s'\n",
6479 var->pp->type.name, var->name);
6485 if (IS(words[1], "dd"))
6486 var->lmod = OPLM_DWORD;
6487 else if (IS(words[1], "dw"))
6488 var->lmod = OPLM_WORD;
6489 else if (IS(words[1], "db")) {
6490 var->lmod = OPLM_BYTE;
6491 if (wordc >= 3 && (l = strlen(words[2])) > 4) {
6492 if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0"))
6496 else if (IS(words[1], "dq"))
6497 var->lmod = OPLM_QWORD;
6498 //else if (IS(words[1], "dt"))
6500 aerr("type '%s' not known\n", words[1]);
6508 static void set_label(int i, const char *name)
6514 p = strchr(name, ':');
6518 if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_"))
6519 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
6520 g_labels[i] = realloc(g_labels[i], len + 1);
6521 my_assert_not(g_labels[i], NULL);
6522 memcpy(g_labels[i], name, len);
6523 g_labels[i][len] = 0;
6532 static struct chunk_item *func_chunks;
6533 static int func_chunk_cnt;
6534 static int func_chunk_alloc;
6536 static void add_func_chunk(FILE *fasm, const char *name, int line)
6538 if (func_chunk_cnt >= func_chunk_alloc) {
6539 func_chunk_alloc *= 2;
6540 func_chunks = realloc(func_chunks,
6541 func_chunk_alloc * sizeof(func_chunks[0]));
6542 my_assert_not(func_chunks, NULL);
6544 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
6545 func_chunks[func_chunk_cnt].name = strdup(name);
6546 func_chunks[func_chunk_cnt].asmln = line;
6550 static int cmp_chunks(const void *p1, const void *p2)
6552 const struct chunk_item *c1 = p1, *c2 = p2;
6553 return strcmp(c1->name, c2->name);
6556 static int cmpstringp(const void *p1, const void *p2)
6558 return strcmp(*(char * const *)p1, *(char * const *)p2);
6561 static void scan_ahead(FILE *fasm)
6571 oldpos = ftell(fasm);
6574 while (my_fgets(line, sizeof(line), fasm))
6585 // get rid of random tabs
6586 for (i = 0; line[i] != 0; i++)
6587 if (line[i] == '\t')
6590 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
6593 next_word(words[0], sizeof(words[0]), p);
6594 if (words[0][0] == 0)
6595 aerr("missing name for func chunk?\n");
6597 add_func_chunk(fasm, words[0], asmln);
6599 else if (IS_START(p, "; sctend"))
6605 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6606 words[wordc][0] = 0;
6607 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6608 if (*p == 0 || *p == ';') {
6614 if (wordc == 2 && IS(words[1], "ends"))
6618 fseek(fasm, oldpos, SEEK_SET);
6622 int main(int argc, char *argv[])
6624 FILE *fout, *fasm, *frlist;
6625 struct parsed_data *pd = NULL;
6627 char **rlist = NULL;
6629 int rlist_alloc = 0;
6630 int func_chunks_used = 0;
6631 int func_chunks_sorted = 0;
6632 int func_chunk_i = -1;
6633 long func_chunk_ret = 0;
6634 int func_chunk_ret_ln = 0;
6635 int scanned_ahead = 0;
6637 char words[20][256];
6638 enum opr_lenmod lmod;
6639 char *sctproto = NULL;
6641 int pending_endp = 0;
6643 int skip_warned = 0;
6656 for (arg = 1; arg < argc; arg++) {
6657 if (IS(argv[arg], "-v"))
6659 else if (IS(argv[arg], "-rf"))
6660 g_allow_regfunc = 1;
6661 else if (IS(argv[arg], "-m"))
6663 else if (IS(argv[arg], "-hdr"))
6664 g_header_mode = g_quiet_pp = g_allow_regfunc = 1;
6669 if (argc < arg + 3) {
6670 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdr.h> [rlist]*\n"
6671 "%s -hdr <out.h> <.asm> <seed.h> [rlist]*\n"
6673 " -hdr - header generation mode\n"
6674 " -rf - allow unannotated indirect calls\n"
6675 " -m - allow multiple .text sections\n"
6676 "[rlist] is a file with function names to skip,"
6684 asmfn = argv[arg++];
6685 fasm = fopen(asmfn, "r");
6686 my_assert_not(fasm, NULL);
6688 hdrfn = argv[arg++];
6689 g_fhdr = fopen(hdrfn, "r");
6690 my_assert_not(g_fhdr, NULL);
6693 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
6694 my_assert_not(rlist, NULL);
6695 // needs special handling..
6696 rlist[rlist_len++] = "__alloca_probe";
6698 func_chunk_alloc = 32;
6699 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
6700 my_assert_not(func_chunks, NULL);
6702 memset(words, 0, sizeof(words));
6704 for (; arg < argc; arg++) {
6705 frlist = fopen(argv[arg], "r");
6706 my_assert_not(frlist, NULL);
6708 while (my_fgets(line, sizeof(line), frlist)) {
6710 if (*p == 0 || *p == ';')
6713 if (IS_START(p, "#if 0")
6714 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
6718 else if (IS_START(p, "#endif"))
6725 p = next_word(words[0], sizeof(words[0]), p);
6726 if (words[0][0] == 0)
6729 if (rlist_len >= rlist_alloc) {
6730 rlist_alloc = rlist_alloc * 2 + 64;
6731 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
6732 my_assert_not(rlist, NULL);
6734 rlist[rlist_len++] = strdup(words[0]);
6743 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
6745 fout = fopen(argv[arg_out], "w");
6746 my_assert_not(fout, NULL);
6749 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
6750 my_assert_not(g_eqs, NULL);
6752 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
6753 g_label_refs[i].i = -1;
6754 g_label_refs[i].next = NULL;
6758 scan_variables(fasm);
6760 while (my_fgets(line, sizeof(line), fasm))
6769 // get rid of random tabs
6770 for (i = 0; line[i] != 0; i++)
6771 if (line[i] == '\t')
6776 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
6777 goto do_pending_endp; // eww..
6779 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
6781 static const char *attrs[] = {
6790 // parse IDA's attribute-list comment
6791 g_ida_func_attr = 0;
6794 for (; *p != 0; p = sskip(p)) {
6795 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
6796 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
6797 g_ida_func_attr |= 1 << i;
6798 p += strlen(attrs[i]);
6802 if (i == ARRAY_SIZE(attrs)) {
6803 anote("unparsed IDA attr: %s\n", p);
6806 if (IS(attrs[i], "fpd=")) {
6807 p = next_word(words[0], sizeof(words[0]), p);
6812 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
6815 next_word(words[0], sizeof(words[0]), p);
6816 if (words[0][0] == 0)
6817 aerr("missing name for func chunk?\n");
6819 if (!scanned_ahead) {
6820 add_func_chunk(fasm, words[0], asmln);
6821 func_chunks_sorted = 0;
6824 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
6826 if (func_chunk_i >= 0) {
6827 if (func_chunk_i < func_chunk_cnt
6828 && IS(func_chunks[func_chunk_i].name, g_func))
6830 // move on to next chunk
6831 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
6833 aerr("seek failed for '%s' chunk #%d\n",
6834 g_func, func_chunk_i);
6835 asmln = func_chunks[func_chunk_i].asmln;
6839 if (func_chunk_ret == 0)
6840 aerr("no return from chunk?\n");
6841 fseek(fasm, func_chunk_ret, SEEK_SET);
6842 asmln = func_chunk_ret_ln;
6848 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
6849 func_chunks_used = 1;
6851 if (IS_START(g_func, "sub_")) {
6852 unsigned long addr = strtoul(p, NULL, 16);
6853 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
6854 if (addr > f_addr && !scanned_ahead) {
6855 anote("scan_ahead caused by '%s', addr %lx\n",
6859 func_chunks_sorted = 0;
6867 for (i = wordc; i < ARRAY_SIZE(words); i++)
6869 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6870 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6871 if (*p == 0 || *p == ';') {
6876 if (*p != 0 && *p != ';')
6877 aerr("too many words\n");
6879 // alow asm patches in comments
6881 if (IS_START(p, "; sctpatch:")) {
6883 if (*p == 0 || *p == ';')
6885 goto parse_words; // lame
6887 if (IS_START(p, "; sctproto:")) {
6888 sctproto = strdup(p + 11);
6890 else if (IS_START(p, "; sctend")) {
6899 awarn("wordc == 0?\n");
6903 // don't care about this:
6904 if (words[0][0] == '.'
6905 || IS(words[0], "include")
6906 || IS(words[0], "assume") || IS(words[1], "segment")
6907 || IS(words[0], "align"))
6913 // do delayed endp processing to collect switch jumptables
6915 if (in_func && !g_skip_func && !end && wordc >= 2
6916 && ((words[0][0] == 'd' && words[0][2] == 0)
6917 || (words[1][0] == 'd' && words[1][2] == 0)))
6920 if (words[1][0] == 'd' && words[1][2] == 0) {
6922 if (g_func_pd_cnt >= pd_alloc) {
6923 pd_alloc = pd_alloc * 2 + 16;
6924 g_func_pd = realloc(g_func_pd,
6925 sizeof(g_func_pd[0]) * pd_alloc);
6926 my_assert_not(g_func_pd, NULL);
6928 pd = &g_func_pd[g_func_pd_cnt];
6930 memset(pd, 0, sizeof(*pd));
6931 strcpy(pd->label, words[0]);
6932 pd->type = OPT_CONST;
6933 pd->lmod = lmod_from_directive(words[1]);
6939 anote("skipping alignment byte?\n");
6942 lmod = lmod_from_directive(words[0]);
6943 if (lmod != pd->lmod)
6944 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
6947 if (pd->count_alloc < pd->count + wordc) {
6948 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
6949 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
6950 my_assert_not(pd->d, NULL);
6952 for (; i < wordc; i++) {
6953 if (IS(words[i], "offset")) {
6954 pd->type = OPT_OFFSET;
6957 p = strchr(words[i], ',');
6960 if (pd->type == OPT_OFFSET)
6961 pd->d[pd->count].u.label = strdup(words[i]);
6963 pd->d[pd->count].u.val = parse_number(words[i]);
6964 pd->d[pd->count].bt_i = -1;
6970 if (in_func && !g_skip_func) {
6972 gen_hdr(g_func, pi);
6974 gen_func(fout, g_fhdr, g_func, pi);
6979 g_ida_func_attr = 0;
6983 func_chunks_used = 0;
6986 memset(&ops, 0, pi * sizeof(ops[0]));
6991 for (i = 0; i < g_func_pd_cnt; i++) {
6993 if (pd->type == OPT_OFFSET) {
6994 for (j = 0; j < pd->count; j++)
6995 free(pd->d[j].u.label);
7009 if (IS(words[1], "proc")) {
7011 aerr("proc '%s' while in_func '%s'?\n",
7014 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
7016 strcpy(g_func, words[0]);
7017 set_label(0, words[0]);
7022 if (IS(words[1], "endp"))
7025 aerr("endp '%s' while not in_func?\n", words[0]);
7026 if (!IS(g_func, words[0]))
7027 aerr("endp '%s' while in_func '%s'?\n",
7030 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
7031 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
7037 if (!g_skip_func && func_chunks_used) {
7038 // start processing chunks
7039 struct chunk_item *ci, key = { g_func, 0 };
7041 func_chunk_ret = ftell(fasm);
7042 func_chunk_ret_ln = asmln;
7043 if (!func_chunks_sorted) {
7044 qsort(func_chunks, func_chunk_cnt,
7045 sizeof(func_chunks[0]), cmp_chunks);
7046 func_chunks_sorted = 1;
7048 ci = bsearch(&key, func_chunks, func_chunk_cnt,
7049 sizeof(func_chunks[0]), cmp_chunks);
7051 aerr("'%s' needs chunks, but none found\n", g_func);
7052 func_chunk_i = ci - func_chunks;
7053 for (; func_chunk_i > 0; func_chunk_i--)
7054 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
7057 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
7059 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
7060 asmln = func_chunks[func_chunk_i].asmln;
7068 if (wordc == 2 && IS(words[1], "ends")) {
7072 goto do_pending_endp;
7076 // scan for next text segment
7077 while (my_fgets(line, sizeof(line), fasm)) {
7080 if (*p == 0 || *p == ';')
7083 if (strstr(p, "segment para public 'CODE' use32"))
7090 p = strchr(words[0], ':');
7092 set_label(pi, words[0]);
7096 if (!in_func || g_skip_func) {
7097 if (!skip_warned && !g_skip_func && g_labels[pi] != NULL) {
7099 anote("skipping from '%s'\n", g_labels[pi]);
7103 g_labels[pi] = NULL;
7107 if (wordc > 1 && IS(words[1], "="))
7110 aerr("unhandled equ, wc=%d\n", wordc);
7111 if (g_eqcnt >= eq_alloc) {
7113 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
7114 my_assert_not(g_eqs, NULL);
7117 len = strlen(words[0]);
7118 if (len > sizeof(g_eqs[0].name) - 1)
7119 aerr("equ name too long: %d\n", len);
7120 strcpy(g_eqs[g_eqcnt].name, words[0]);
7122 if (!IS(words[3], "ptr"))
7123 aerr("unhandled equ\n");
7124 if (IS(words[2], "dword"))
7125 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
7126 else if (IS(words[2], "word"))
7127 g_eqs[g_eqcnt].lmod = OPLM_WORD;
7128 else if (IS(words[2], "byte"))
7129 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
7130 else if (IS(words[2], "qword"))
7131 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
7133 aerr("bad lmod: '%s'\n", words[2]);
7135 g_eqs[g_eqcnt].offset = parse_number(words[4]);
7140 if (pi >= ARRAY_SIZE(ops))
7141 aerr("too many ops\n");
7143 parse_op(&ops[pi], words, wordc);
7145 if (sctproto != NULL) {
7146 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
7147 ops[pi].datap = sctproto;
7163 // vim:ts=2:shiftwidth=2:expandtab