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/loop) */
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 */
62 OPF_NOREGS = (1 << 21), /* don't track regs of this op */
135 // must be sorted (larger len must be further in enum)
144 #define MAX_EXITS 128
146 #define MAX_OPERANDS 3
149 #define OPR_INIT(type_, lmod_, reg_) \
150 { type_, lmod_, reg_, }
154 enum opr_lenmod lmod;
156 unsigned int is_ptr:1; // pointer in C
157 unsigned int is_array:1; // array in C
158 unsigned int type_from_var:1; // .. in header, sometimes wrong
159 unsigned int size_mismatch:1; // type override differs from C
160 unsigned int size_lt:1; // type override is larger than C
161 unsigned int had_ds:1; // had ds: prefix
162 const struct parsed_proto *pp; // for OPT_LABEL
169 struct parsed_opr operand[MAX_OPERANDS];
172 unsigned char pfo_inv;
173 unsigned char operand_cnt;
174 unsigned char p_argnum; // arg push: altered before call arg #
175 unsigned char p_arggrp; // arg push: arg group # for above
176 unsigned char p_argpass;// arg push: arg of host func
177 short p_argnext;// arg push: same arg pushed elsewhere or -1
178 int regmask_src; // all referensed regs
180 int pfomask; // flagop: parsed_flag_op that can't be delayed
181 int cc_scratch; // scratch storage during analysis
182 int bt_i; // branch target for branches
183 struct parsed_data *btj;// branch targets for jumptables
184 struct parsed_proto *pp;// parsed_proto for OP_CALL
190 // OP_CALL - parser proto hint (str)
191 // (OPF_CC) - points to one of (OPF_FLAGS) that affects cc op
192 // OP_PUSH - points to OP_POP in complex push/pop graph
193 // OP_POP - points to OP_PUSH in simple push/pop pair
197 enum opr_lenmod lmod;
204 enum opr_lenmod lmod;
218 struct label_ref *next;
222 IDAFA_BP_FRAME = (1 << 0),
223 IDAFA_LIB_FUNC = (1 << 1),
224 IDAFA_STATIC = (1 << 2),
225 IDAFA_NORETURN = (1 << 3),
226 IDAFA_THUNK = (1 << 4),
227 IDAFA_FPD = (1 << 5),
230 // note: limited to 32k due to p_argnext
232 #define MAX_ARG_GRP 2
234 static struct parsed_op ops[MAX_OPS];
235 static struct parsed_equ *g_eqs;
237 static char *g_labels[MAX_OPS];
238 static struct label_ref g_label_refs[MAX_OPS];
239 static const struct parsed_proto *g_func_pp;
240 static struct parsed_data *g_func_pd;
241 static int g_func_pd_cnt;
242 static char g_func[256];
243 static char g_comment[256];
244 static int g_bp_frame;
245 static int g_sp_frame;
246 static int g_stack_frame_used;
247 static int g_stack_fsz;
248 static int g_ida_func_attr;
249 static int g_skip_func;
250 static int g_allow_regfunc;
251 static int g_quiet_pp;
252 static int g_header_mode;
254 #define ferr(op_, fmt, ...) do { \
255 printf("%s:%d: error %u: [%s] '%s': " fmt, asmfn, (op_)->asmln, \
256 __LINE__, g_func, dump_op(op_), ##__VA_ARGS__); \
260 #define fnote(op_, fmt, ...) \
261 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
262 dump_op(op_), ##__VA_ARGS__)
264 #define ferr_assert(op_, cond) do { \
265 if (!(cond)) ferr(op_, "assertion '%s' failed\n", #cond); \
268 const char *regs_r32[] = {
269 "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp",
270 // not r32, but list here for easy parsing and printing
271 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7",
273 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
274 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
275 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
277 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
279 // possible basic comparison types (without inversion)
280 enum parsed_flag_op {
284 PFO_BE, // 6 CF=1||ZF=1
288 PFO_LE, // e ZF=1||SF!=OF
291 #define PFOB_O (1 << PFO_O)
292 #define PFOB_C (1 << PFO_C)
293 #define PFOB_Z (1 << PFO_Z)
294 #define PFOB_S (1 << PFO_S)
296 static const char *parsed_flag_op_names[] = {
297 "o", "c", "z", "be", "s", "p", "l", "le"
300 static int char_array_i(const char *array[], size_t len, const char *s)
304 for (i = 0; i < len; i++)
311 static void printf_number(char *buf, size_t buf_size,
312 unsigned long number)
314 // output in C-friendly form
315 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
318 static int check_segment_prefix(const char *s)
320 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
334 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
338 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
340 *reg_lmod = OPLM_QWORD;
344 *reg_lmod = OPLM_DWORD;
347 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
349 *reg_lmod = OPLM_WORD;
352 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
354 *reg_lmod = OPLM_BYTE;
357 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
359 *reg_lmod = OPLM_BYTE;
366 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
368 enum opr_lenmod lmod;
381 while (my_isblank(*s))
383 for (; my_issep(*s); d++, s++)
385 while (my_isblank(*s))
389 // skip '?s:' prefixes
390 if (check_segment_prefix(s))
393 s = next_idt(w, sizeof(w), s);
398 reg = parse_reg(&lmod, w);
400 *regmask |= 1 << reg;
404 if ('0' <= w[0] && w[0] <= '9') {
405 number = parse_number(w);
406 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
410 // probably some label/identifier - pass
413 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
417 strcpy(name, cvtbuf);
422 static int is_reg_in_str(const char *s)
426 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
429 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
430 if (!strncmp(s, regs_r32[i], 3))
436 static const char *parse_stack_el(const char *name, char *extra_reg,
439 const char *p, *p2, *s;
445 if (g_bp_frame || early_try)
448 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
450 if (extra_reg != NULL) {
451 strncpy(extra_reg, name, 3);
456 if (IS_START(p, "ebp+")) {
460 if (p2 != NULL && is_reg_in_str(p)) {
461 if (extra_reg != NULL) {
462 strncpy(extra_reg, p, p2 - p);
463 extra_reg[p2 - p] = 0;
468 if (!('0' <= *p && *p <= '9'))
475 if (!IS_START(name, "esp+"))
481 if (is_reg_in_str(s)) {
482 if (extra_reg != NULL) {
483 strncpy(extra_reg, s, p - s);
484 extra_reg[p - s] = 0;
489 aerr("%s IDA stackvar not set?\n", __func__);
491 if (!('0' <= *s && *s <= '9')) {
492 aerr("%s IDA stackvar offset not set?\n", __func__);
495 if (s[0] == '0' && s[1] == 'x')
498 if (len < sizeof(buf) - 1) {
499 strncpy(buf, s, len);
501 val = strtol(buf, &endp, 16);
502 if (val == 0 || *endp != 0) {
503 aerr("%s num parse fail for '%s'\n", __func__, buf);
512 if ('0' <= *p && *p <= '9')
518 static int guess_lmod_from_name(struct parsed_opr *opr)
520 if (IS_START(opr->name, "dword_") || IS_START(opr->name, "off_")) {
521 opr->lmod = OPLM_DWORD;
524 if (IS_START(opr->name, "word_")) {
525 opr->lmod = OPLM_WORD;
528 if (IS_START(opr->name, "byte_")) {
529 opr->lmod = OPLM_BYTE;
532 if (IS_START(opr->name, "qword_")) {
533 opr->lmod = OPLM_QWORD;
539 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
540 const struct parsed_type *c_type)
542 static const char *dword_types[] = {
543 "uint32_t", "int", "_DWORD", "UINT_PTR", "DWORD",
544 "WPARAM", "LPARAM", "UINT", "__int32",
545 "LONG", "HIMC", "BOOL", "size_t",
548 static const char *word_types[] = {
549 "uint16_t", "int16_t", "_WORD", "WORD",
550 "unsigned __int16", "__int16",
552 static const char *byte_types[] = {
553 "uint8_t", "int8_t", "char",
554 "unsigned __int8", "__int8", "BYTE", "_BYTE",
556 // structures.. deal the same as with _UNKNOWN for now
562 if (c_type->is_ptr) {
567 n = skip_type_mod(c_type->name);
569 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
570 if (IS(n, dword_types[i])) {
576 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
577 if (IS(n, word_types[i])) {
583 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
584 if (IS(n, byte_types[i])) {
593 static char *default_cast_to(char *buf, size_t buf_size,
594 struct parsed_opr *opr)
600 if (opr->pp == NULL || opr->pp->type.name == NULL
603 snprintf(buf, buf_size, "%s", "(void *)");
607 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
611 static enum opr_type lmod_from_directive(const char *d)
615 else if (IS(d, "dw"))
617 else if (IS(d, "db"))
620 aerr("unhandled directive: '%s'\n", d);
624 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
630 *regmask |= 1 << reg;
633 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
636 static int parse_operand(struct parsed_opr *opr,
637 int *regmask, int *regmask_indirect,
638 char words[16][256], int wordc, int w, unsigned int op_flags)
640 const struct parsed_proto *pp = NULL;
641 enum opr_lenmod tmplmod;
642 unsigned long number;
650 aerr("parse_operand w %d, wordc %d\n", w, wordc);
654 for (i = w; i < wordc; i++) {
655 len = strlen(words[i]);
656 if (words[i][len - 1] == ',') {
657 words[i][len - 1] = 0;
663 wordc_in = wordc - w;
665 if ((op_flags & OPF_JMP) && wordc_in > 0
666 && !('0' <= words[w][0] && words[w][0] <= '9'))
668 const char *label = NULL;
670 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
671 && IS(words[w + 1], "ptr"))
672 label = words[w + 2];
673 else if (wordc_in == 2 && IS(words[w], "short"))
674 label = words[w + 1];
675 else if (wordc_in == 1
676 && strchr(words[w], '[') == NULL
677 && parse_reg(&tmplmod, words[w]) < 0)
681 opr->type = OPT_LABEL;
682 ret = check_segment_prefix(label);
685 aerr("fs/gs used\n");
689 strcpy(opr->name, label);
695 if (IS(words[w + 1], "ptr")) {
696 if (IS(words[w], "dword"))
697 opr->lmod = OPLM_DWORD;
698 else if (IS(words[w], "word"))
699 opr->lmod = OPLM_WORD;
700 else if (IS(words[w], "byte"))
701 opr->lmod = OPLM_BYTE;
702 else if (IS(words[w], "qword"))
703 opr->lmod = OPLM_QWORD;
705 aerr("type parsing failed\n");
707 wordc_in = wordc - w;
712 if (IS(words[w], "offset")) {
713 opr->type = OPT_OFFSET;
714 opr->lmod = OPLM_DWORD;
715 strcpy(opr->name, words[w + 1]);
716 pp = proto_parse(g_fhdr, opr->name, 1);
719 if (IS(words[w], "(offset")) {
720 p = strchr(words[w + 1], ')');
722 aerr("parse of bracketed offset failed\n");
724 opr->type = OPT_OFFSET;
725 strcpy(opr->name, words[w + 1]);
731 aerr("parse_operand 1 word expected\n");
733 ret = check_segment_prefix(words[w]);
736 aerr("fs/gs used\n");
738 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
740 strcpy(opr->name, words[w]);
742 if (words[w][0] == '[') {
743 opr->type = OPT_REGMEM;
744 ret = sscanf(words[w], "[%[^]]]", opr->name);
746 aerr("[] parse failure\n");
748 parse_indmode(opr->name, regmask_indirect, 1);
749 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1))
752 struct parsed_equ *eq =
753 equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i);
755 opr->lmod = eq->lmod;
759 else if (strchr(words[w], '[')) {
761 p = strchr(words[w], '[');
762 opr->type = OPT_REGMEM;
763 parse_indmode(p, regmask_indirect, 0);
764 strncpy(buf, words[w], p - words[w]);
765 buf[p - words[w]] = 0;
766 pp = proto_parse(g_fhdr, buf, 1);
769 else if (('0' <= words[w][0] && words[w][0] <= '9')
770 || words[w][0] == '-')
772 number = parse_number(words[w]);
773 opr->type = OPT_CONST;
775 printf_number(opr->name, sizeof(opr->name), number);
779 ret = parse_reg(&tmplmod, opr->name);
781 setup_reg_opr(opr, ret, tmplmod, regmask);
785 // most likely var in data segment
786 opr->type = OPT_LABEL;
787 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
791 if (pp->is_fptr || pp->is_func) {
792 opr->lmod = OPLM_DWORD;
796 tmplmod = OPLM_UNSPEC;
797 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
798 anote("unhandled C type '%s' for '%s'\n",
799 pp->type.name, opr->name);
801 if (opr->lmod == OPLM_UNSPEC) {
803 opr->type_from_var = 1;
805 else if (opr->lmod != tmplmod) {
806 opr->size_mismatch = 1;
807 if (tmplmod < opr->lmod)
810 opr->is_ptr = pp->type.is_ptr;
812 opr->is_array = pp->type.is_array;
816 if (opr->lmod == OPLM_UNSPEC)
817 guess_lmod_from_name(opr);
821 static const struct {
826 { "repe", OPF_REP|OPF_REPZ },
827 { "repz", OPF_REP|OPF_REPZ },
828 { "repne", OPF_REP|OPF_REPNZ },
829 { "repnz", OPF_REP|OPF_REPNZ },
830 { "lock", OPF_LOCK }, // ignored for now..
833 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
835 static const struct {
838 unsigned short minopr;
839 unsigned short maxopr;
842 unsigned char pfo_inv;
844 { "nop", OP_NOP, 0, 0, 0 },
845 { "push", OP_PUSH, 1, 1, 0 },
846 { "pop", OP_POP, 1, 1, OPF_DATA },
847 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
848 { "mov" , OP_MOV, 2, 2, OPF_DATA },
849 { "lea", OP_LEA, 2, 2, OPF_DATA },
850 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
851 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
852 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
853 { "not", OP_NOT, 1, 1, OPF_DATA },
854 { "xlat", OP_XLAT, 0, 0, OPF_DATA },
855 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
856 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
857 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
858 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
859 { "stosb",OP_STOS, 0, 0, OPF_DATA },
860 { "stosw",OP_STOS, 0, 0, OPF_DATA },
861 { "stosd",OP_STOS, 0, 0, OPF_DATA },
862 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
863 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
864 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
865 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
866 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
867 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
868 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
869 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
870 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
871 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
872 { "cld", OP_CLD, 0, 0, OPF_DATA },
873 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
874 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
875 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
876 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
877 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
878 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
879 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
880 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
881 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
882 { "shld", OP_SHLD, 3, 3, OPF_DATA|OPF_FLAGS },
883 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
884 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
885 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
886 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
887 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
888 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
889 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
890 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
891 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
892 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
893 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
894 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
895 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
896 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
897 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
898 { "test", OP_TEST, 2, 2, OPF_FLAGS },
899 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
900 { "retn", OP_RET, 0, 1, OPF_TAIL },
901 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
902 { "jmp", OP_JMP, 1, 1, OPF_JMP },
903 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
904 { "loop", OP_LOOP, 1, 1, OPF_JMP|OPF_CJMP|OPF_DATA },
905 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
906 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
907 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
908 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
909 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
910 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
911 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
912 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
913 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
914 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
915 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
916 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
917 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
918 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
919 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
920 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
921 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
922 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
923 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
924 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
925 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
926 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
927 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
928 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
929 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
930 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
931 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
932 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
933 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
934 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
935 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
936 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
937 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
938 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
939 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
940 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
941 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
942 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
943 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
944 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
945 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
946 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
947 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
948 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
949 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
950 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
951 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
952 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
953 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
954 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
955 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
956 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
957 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
958 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
959 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
960 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
961 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
962 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
965 { "emms", OP_EMMS, 0, 0, OPF_DATA },
966 { "movq", OP_MOV, 2, 2, OPF_DATA },
971 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
973 enum opr_lenmod lmod = OPLM_UNSPEC;
974 int prefix_flags = 0;
982 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
983 if (IS(words[w], pref_table[i].name)) {
984 prefix_flags = pref_table[i].flags;
991 aerr("lone prefix: '%s'\n", words[0]);
996 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
997 if (IS(words[w], op_table[i].name))
1001 if (i == ARRAY_SIZE(op_table)) {
1003 aerr("unhandled op: '%s'\n", words[0]);
1008 op->op = op_table[i].op;
1009 op->flags = op_table[i].flags | prefix_flags;
1010 op->pfo = op_table[i].pfo;
1011 op->pfo_inv = op_table[i].pfo_inv;
1012 op->regmask_src = op->regmask_dst = 0;
1015 if (op->op == OP_UD2)
1018 for (opr = 0; opr < op_table[i].maxopr; opr++) {
1019 if (opr >= op_table[i].minopr && w >= wordc)
1022 regmask = regmask_ind = 0;
1023 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
1024 words, wordc, w, op->flags);
1026 if (opr == 0 && (op->flags & OPF_DATA))
1027 op->regmask_dst = regmask;
1029 op->regmask_src |= regmask;
1030 op->regmask_src |= regmask_ind;
1034 aerr("parse_op %s incomplete: %d/%d\n",
1035 words[0], w, wordc);
1038 op->operand_cnt = opr;
1039 if (!strncmp(op_table[i].name, "set", 3))
1040 op->operand[0].lmod = OPLM_BYTE;
1043 // first operand is not dst
1046 op->regmask_src |= op->regmask_dst;
1047 op->regmask_dst = 0;
1050 // first operand is src too
1062 op->regmask_src |= op->regmask_dst;
1067 op->regmask_src |= op->regmask_dst;
1068 op->regmask_dst |= op->regmask_src;
1074 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1075 && op->operand[0].lmod == op->operand[1].lmod
1076 && op->operand[0].reg == op->operand[1].reg
1077 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1079 op->regmask_src = 0;
1082 op->regmask_src |= op->regmask_dst;
1085 // ops with implicit argumets
1087 op->operand_cnt = 2;
1088 setup_reg_opr(&op->operand[0], xAX, OPLM_BYTE, &op->regmask_src);
1089 op->regmask_dst = op->regmask_src;
1090 setup_reg_opr(&op->operand[1], xBX, OPLM_DWORD, &op->regmask_src);
1094 op->operand_cnt = 2;
1095 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
1096 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
1102 if (words[op_w][4] == 'b')
1104 else if (words[op_w][4] == 'w')
1106 else if (words[op_w][4] == 'd')
1109 op->regmask_src = 0;
1110 setup_reg_opr(&op->operand[j++], op->op == OP_LODS ? xSI : xDI,
1111 OPLM_DWORD, &op->regmask_src);
1112 op->regmask_dst = op->regmask_src;
1113 setup_reg_opr(&op->operand[j++], xAX, lmod,
1114 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1115 if (op->flags & OPF_REP) {
1116 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1117 op->regmask_dst |= 1 << xCX;
1119 op->operand_cnt = j;
1124 if (words[op_w][4] == 'b')
1126 else if (words[op_w][4] == 'w')
1128 else if (words[op_w][4] == 'd')
1131 op->regmask_src = 0;
1132 // note: lmod is not correct, don't have where to place it
1133 setup_reg_opr(&op->operand[j++], xDI, lmod, &op->regmask_src);
1134 setup_reg_opr(&op->operand[j++], xSI, OPLM_DWORD, &op->regmask_src);
1135 if (op->flags & OPF_REP)
1136 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1137 op->operand_cnt = j;
1138 op->regmask_dst = op->regmask_src;
1142 op->regmask_dst = 1 << xCX;
1145 op->operand_cnt = 2;
1146 op->regmask_src = 1 << xCX;
1147 op->operand[1].type = OPT_REG;
1148 op->operand[1].reg = xCX;
1149 op->operand[1].lmod = OPLM_DWORD;
1153 if (op->operand_cnt == 2) {
1154 if (op->operand[0].type != OPT_REG)
1155 aerr("reg expected\n");
1156 op->regmask_src |= 1 << op->operand[0].reg;
1158 if (op->operand_cnt != 1)
1163 op->regmask_src |= op->regmask_dst;
1164 op->regmask_dst = (1 << xDX) | (1 << xAX);
1165 if (op->operand[0].lmod == OPLM_UNSPEC)
1166 op->operand[0].lmod = OPLM_DWORD;
1171 // we could set up operands for edx:eax, but there is no real need to
1172 // (see is_opr_modified())
1173 op->regmask_src |= op->regmask_dst;
1174 op->regmask_dst = (1 << xDX) | (1 << xAX);
1175 if (op->operand[0].lmod == OPLM_UNSPEC)
1176 op->operand[0].lmod = OPLM_DWORD;
1184 op->regmask_src |= op->regmask_dst;
1185 if (op->operand[1].lmod == OPLM_UNSPEC)
1186 op->operand[1].lmod = OPLM_BYTE;
1191 op->regmask_src |= op->regmask_dst;
1192 if (op->operand[2].lmod == OPLM_UNSPEC)
1193 op->operand[2].lmod = OPLM_BYTE;
1197 op->regmask_src |= op->regmask_dst;
1198 op->regmask_dst = 0;
1199 if (op->operand[0].lmod == OPLM_UNSPEC
1200 && (op->operand[0].type == OPT_CONST
1201 || op->operand[0].type == OPT_OFFSET
1202 || op->operand[0].type == OPT_LABEL))
1203 op->operand[0].lmod = OPLM_DWORD;
1209 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1210 && op->operand[0].lmod == op->operand[1].lmod
1211 && op->operand[0].reg == op->operand[1].reg
1212 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1214 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1215 op->regmask_src = op->regmask_dst = 0;
1220 if (op->operand[0].type == OPT_REG
1221 && op->operand[1].type == OPT_REGMEM)
1224 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1225 if (IS(buf, op->operand[1].name))
1226 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1231 // trashed regs must be explicitly detected later
1232 op->regmask_dst = 0;
1236 op->regmask_dst = (1 << xBP) | (1 << xSP);
1237 op->regmask_src = 1 << xBP;
1244 if (op->operand[0].type == OPT_REG
1245 && op->operand[1].type == OPT_CONST)
1247 struct parsed_opr *op1 = &op->operand[1];
1248 if ((op->op == OP_AND && op1->val == 0)
1251 || (op->operand[0].lmod == OPLM_WORD && op1->val == 0xffff)
1252 || (op->operand[0].lmod == OPLM_BYTE && op1->val == 0xff))))
1254 op->regmask_src = 0;
1259 static const char *op_name(struct parsed_op *po)
1261 static char buf[16];
1265 if (po->op == OP_JCC || po->op == OP_SCC) {
1267 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1270 strcpy(p, parsed_flag_op_names[po->pfo]);
1274 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1275 if (op_table[i].op == po->op)
1276 return op_table[i].name;
1282 static const char *dump_op(struct parsed_op *po)
1284 static char out[128];
1291 snprintf(out, sizeof(out), "%s", op_name(po));
1292 for (i = 0; i < po->operand_cnt; i++) {
1296 snprintf(p, sizeof(out) - (p - out),
1297 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1298 po->operand[i].name);
1304 static const char *lmod_type_u(struct parsed_op *po,
1305 enum opr_lenmod lmod)
1317 ferr(po, "invalid lmod: %d\n", lmod);
1318 return "(_invalid_)";
1322 static const char *lmod_cast_u(struct parsed_op *po,
1323 enum opr_lenmod lmod)
1335 ferr(po, "invalid lmod: %d\n", lmod);
1336 return "(_invalid_)";
1340 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1341 enum opr_lenmod lmod)
1353 ferr(po, "invalid lmod: %d\n", lmod);
1354 return "(_invalid_)";
1358 static const char *lmod_cast_s(struct parsed_op *po,
1359 enum opr_lenmod lmod)
1371 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1372 return "(_invalid_)";
1376 static const char *lmod_cast(struct parsed_op *po,
1377 enum opr_lenmod lmod, int is_signed)
1380 lmod_cast_s(po, lmod) :
1381 lmod_cast_u(po, lmod);
1384 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1396 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1401 static const char *opr_name(struct parsed_op *po, int opr_num)
1403 if (opr_num >= po->operand_cnt)
1404 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1405 return po->operand[opr_num].name;
1408 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1410 if (opr_num >= po->operand_cnt)
1411 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1412 if (po->operand[opr_num].type != OPT_CONST)
1413 ferr(po, "opr %d: const expected\n", opr_num);
1414 return po->operand[opr_num].val;
1417 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1419 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1420 ferr(po, "invalid reg: %d\n", popr->reg);
1421 return regs_r32[popr->reg];
1424 // cast1 is the "final" cast
1425 static const char *simplify_cast(const char *cast1, const char *cast2)
1427 static char buf[256];
1433 if (IS(cast1, cast2))
1435 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1437 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1439 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1441 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1443 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1446 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1450 static const char *simplify_cast_num(const char *cast, unsigned int val)
1452 if (IS(cast, "(u8)") && val < 0x100)
1454 if (IS(cast, "(s8)") && val < 0x80)
1456 if (IS(cast, "(u16)") && val < 0x10000)
1458 if (IS(cast, "(s16)") && val < 0x8000)
1460 if (IS(cast, "(s32)") && val < 0x80000000)
1466 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1475 namelen = strlen(name);
1477 p = strchr(name, '+');
1481 ferr(po, "equ parse failed for '%s'\n", name);
1483 if (IS_START(p, "0x"))
1485 *extra_offs = strtol(p, &endp, 16);
1487 ferr(po, "equ parse failed for '%s'\n", name);
1490 for (i = 0; i < g_eqcnt; i++)
1491 if (strncmp(g_eqs[i].name, name, namelen) == 0
1492 && g_eqs[i].name[namelen] == 0)
1496 ferr(po, "unresolved equ name: '%s'\n", name);
1503 static int is_stack_access(struct parsed_op *po,
1504 const struct parsed_opr *popr)
1506 return (parse_stack_el(popr->name, NULL, 0)
1507 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1508 && IS_START(popr->name, "ebp")));
1511 static void parse_stack_access(struct parsed_op *po,
1512 const char *name, char *ofs_reg, int *offset_out,
1513 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1515 const char *bp_arg = "";
1516 const char *p = NULL;
1517 struct parsed_equ *eq;
1524 if (IS_START(name, "ebp-")
1525 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1528 if (IS_START(p, "0x"))
1530 offset = strtoul(p, &endp, 16);
1534 ferr(po, "ebp- parse of '%s' failed\n", name);
1537 bp_arg = parse_stack_el(name, ofs_reg, 0);
1538 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1539 eq = equ_find(po, bp_arg, &offset);
1541 ferr(po, "detected but missing eq\n");
1542 offset += eq->offset;
1545 if (!strncmp(name, "ebp", 3))
1548 // yes it sometimes LEAs ra for compares..
1549 if (!is_lea && ofs_reg[0] == 0
1550 && stack_ra <= offset && offset < stack_ra + 4)
1552 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1555 *offset_out = offset;
1556 *stack_ra_out = stack_ra;
1558 *bp_arg_out = bp_arg;
1561 static int stack_frame_access(struct parsed_op *po,
1562 struct parsed_opr *popr, char *buf, size_t buf_size,
1563 const char *name, const char *cast, int is_src, int is_lea)
1565 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1566 const char *prefix = "";
1567 const char *bp_arg = NULL;
1568 char ofs_reg[16] = { 0, };
1569 int i, arg_i, arg_s;
1577 if (po->flags & OPF_EBP_S)
1578 ferr(po, "stack_frame_access while ebp is scratch\n");
1580 parse_stack_access(po, name, ofs_reg, &offset,
1581 &stack_ra, &bp_arg, is_lea);
1583 if (offset > stack_ra)
1585 arg_i = (offset - stack_ra - 4) / 4;
1586 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1588 if (g_func_pp->is_vararg
1589 && arg_i == g_func_pp->argc_stack && is_lea)
1591 // should be va_list
1594 snprintf(buf, buf_size, "%sap", cast);
1597 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1598 offset, bp_arg, arg_i);
1600 if (ofs_reg[0] != 0)
1601 ferr(po, "offset reg on arg access?\n");
1603 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1604 if (g_func_pp->arg[i].reg != NULL)
1610 if (i == g_func_pp->argc)
1611 ferr(po, "arg %d not in prototype?\n", arg_i);
1613 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1620 ferr(po, "lea/byte to arg?\n");
1621 if (is_src && (offset & 3) == 0)
1622 snprintf(buf, buf_size, "%sa%d",
1623 simplify_cast(cast, "(u8)"), i + 1);
1625 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1626 cast, offset & 3, i + 1);
1631 ferr(po, "lea/word to arg?\n");
1636 ferr(po, "problematic arg store\n");
1637 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1638 simplify_cast(cast, "*(u16 *)"), i + 1);
1641 ferr(po, "unaligned arg word load\n");
1643 else if (is_src && (offset & 2) == 0)
1644 snprintf(buf, buf_size, "%sa%d",
1645 simplify_cast(cast, "(u16)"), i + 1);
1647 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1648 cast, (offset & 2) ? "HI" : "LO", i + 1);
1660 snprintf(buf, buf_size, "(u32)&a%d + %d",
1663 ferr(po, "unaligned arg store\n");
1665 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1666 snprintf(buf, buf_size, "%s(a%d >> %d)",
1667 prefix, i + 1, (offset & 3) * 8);
1671 snprintf(buf, buf_size, "%s%sa%d",
1672 prefix, is_lea ? "&" : "", i + 1);
1677 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1681 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1684 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1685 if (tmp_lmod != OPLM_DWORD
1686 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1687 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1689 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1690 i + 1, offset, g_func_pp->arg[i].type.name);
1692 // can't check this because msvc likes to reuse
1693 // arg space for scratch..
1694 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1695 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1699 if (g_stack_fsz == 0)
1700 ferr(po, "stack var access without stackframe\n");
1701 g_stack_frame_used = 1;
1703 sf_ofs = g_stack_fsz + offset;
1704 lim = (ofs_reg[0] != 0) ? -4 : 0;
1705 if (offset > 0 || sf_ofs < lim)
1706 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1716 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1717 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1721 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1722 // known unaligned or possibly unaligned
1723 strcat(g_comment, " unaligned");
1725 prefix = "*(u16 *)&";
1726 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1727 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1730 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1734 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1735 // known unaligned or possibly unaligned
1736 strcat(g_comment, " unaligned");
1738 prefix = "*(u32 *)&";
1739 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1740 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1743 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1747 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1754 static void check_func_pp(struct parsed_op *po,
1755 const struct parsed_proto *pp, const char *pfx)
1757 enum opr_lenmod tmp_lmod;
1761 if (pp->argc_reg != 0) {
1762 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1763 pp_print(buf, sizeof(buf), pp);
1764 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1766 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1767 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1768 pfx, pp->argc_reg, pp->argc_stack);
1771 // fptrs must use 32bit args, callsite might have no information and
1772 // lack a cast to smaller types, which results in incorrectly masked
1773 // args passed (callee may assume masked args, it does on ARM)
1774 if (!pp->is_osinc) {
1775 for (i = 0; i < pp->argc; i++) {
1776 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1777 if (ret && tmp_lmod != OPLM_DWORD)
1778 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1779 i + 1, pp->arg[i].type.name);
1784 static const char *check_label_read_ref(struct parsed_op *po,
1787 const struct parsed_proto *pp;
1789 pp = proto_parse(g_fhdr, name, 0);
1791 ferr(po, "proto_parse failed for ref '%s'\n", name);
1794 check_func_pp(po, pp, "ref");
1799 static char *out_src_opr(char *buf, size_t buf_size,
1800 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1803 char tmp1[256], tmp2[256];
1812 switch (popr->type) {
1815 ferr(po, "lea from reg?\n");
1817 switch (popr->lmod) {
1819 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
1822 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1825 snprintf(buf, buf_size, "%s%s",
1826 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1829 if (popr->name[1] == 'h') // XXX..
1830 snprintf(buf, buf_size, "%s(%s >> 8)",
1831 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1833 snprintf(buf, buf_size, "%s%s",
1834 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1837 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1842 if (is_stack_access(po, popr)) {
1843 stack_frame_access(po, popr, buf, buf_size,
1844 popr->name, cast, 1, is_lea);
1848 strcpy(expr, popr->name);
1849 if (strchr(expr, '[')) {
1850 // special case: '[' can only be left for label[reg] form
1851 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1853 ferr(po, "parse failure for '%s'\n", expr);
1854 if (tmp1[0] == '(') {
1855 // (off_4FFF50+3)[eax]
1856 p = strchr(tmp1 + 1, ')');
1857 if (p == NULL || p[1] != 0)
1858 ferr(po, "parse failure (2) for '%s'\n", expr);
1860 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1862 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1865 // XXX: do we need more parsing?
1867 snprintf(buf, buf_size, "%s", expr);
1871 snprintf(buf, buf_size, "%s(%s)",
1872 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1876 name = check_label_read_ref(po, popr->name);
1877 if (cast[0] == 0 && popr->is_ptr)
1881 snprintf(buf, buf_size, "(u32)&%s", name);
1882 else if (popr->size_lt)
1883 snprintf(buf, buf_size, "%s%s%s%s", cast,
1884 lmod_cast_u_ptr(po, popr->lmod),
1885 popr->is_array ? "" : "&", name);
1887 snprintf(buf, buf_size, "%s%s%s", cast, name,
1888 popr->is_array ? "[0]" : "");
1892 name = check_label_read_ref(po, popr->name);
1896 ferr(po, "lea an offset?\n");
1897 snprintf(buf, buf_size, "%s&%s", cast, name);
1902 ferr(po, "lea from const?\n");
1904 printf_number(tmp1, sizeof(tmp1), popr->val);
1905 if (popr->val == 0 && strchr(cast, '*'))
1906 snprintf(buf, buf_size, "NULL");
1908 snprintf(buf, buf_size, "%s%s",
1909 simplify_cast_num(cast, popr->val), tmp1);
1913 ferr(po, "invalid src type: %d\n", popr->type);
1919 // note: may set is_ptr (we find that out late for ebp frame..)
1920 static char *out_dst_opr(char *buf, size_t buf_size,
1921 struct parsed_op *po, struct parsed_opr *popr)
1923 switch (popr->type) {
1925 switch (popr->lmod) {
1927 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
1930 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1934 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1938 if (popr->name[1] == 'h') // XXX..
1939 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1941 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1944 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1949 if (is_stack_access(po, popr)) {
1950 stack_frame_access(po, popr, buf, buf_size,
1951 popr->name, "", 0, 0);
1955 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1958 if (popr->size_mismatch)
1959 snprintf(buf, buf_size, "%s%s%s",
1960 lmod_cast_u_ptr(po, popr->lmod),
1961 popr->is_array ? "" : "&", popr->name);
1963 snprintf(buf, buf_size, "%s%s", popr->name,
1964 popr->is_array ? "[0]" : "");
1968 ferr(po, "invalid dst type: %d\n", popr->type);
1974 static char *out_src_opr_u32(char *buf, size_t buf_size,
1975 struct parsed_op *po, struct parsed_opr *popr)
1977 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1980 static void out_test_for_cc(char *buf, size_t buf_size,
1981 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1982 enum opr_lenmod lmod, const char *expr)
1984 const char *cast, *scast;
1986 cast = lmod_cast_u(po, lmod);
1987 scast = lmod_cast_s(po, lmod);
1991 case PFO_BE: // CF=1||ZF=1; CF=0
1992 snprintf(buf, buf_size, "(%s%s %s 0)",
1993 cast, expr, is_inv ? "!=" : "==");
1997 case PFO_L: // SF!=OF; OF=0
1998 snprintf(buf, buf_size, "(%s%s %s 0)",
1999 scast, expr, is_inv ? ">=" : "<");
2002 case PFO_LE: // ZF=1||SF!=OF; OF=0
2003 snprintf(buf, buf_size, "(%s%s %s 0)",
2004 scast, expr, is_inv ? ">" : "<=");
2008 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2012 static void out_cmp_for_cc(char *buf, size_t buf_size,
2013 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2015 const char *cast, *scast, *cast_use;
2016 char buf1[256], buf2[256];
2017 enum opr_lenmod lmod;
2019 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
2020 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
2021 po->operand[0].lmod, po->operand[1].lmod);
2022 lmod = po->operand[0].lmod;
2024 cast = lmod_cast_u(po, lmod);
2025 scast = lmod_cast_s(po, lmod);
2041 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2044 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
2045 if (po->op == OP_DEC)
2046 snprintf(buf2, sizeof(buf2), "1");
2048 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
2052 // note: must be unsigned compare
2053 snprintf(buf, buf_size, "(%s %s %s)",
2054 buf1, is_inv ? ">=" : "<", buf2);
2058 snprintf(buf, buf_size, "(%s %s %s)",
2059 buf1, is_inv ? "!=" : "==", buf2);
2063 // note: must be unsigned compare
2064 snprintf(buf, buf_size, "(%s %s %s)",
2065 buf1, is_inv ? ">" : "<=", buf2);
2068 if (is_inv && lmod == OPLM_BYTE
2069 && po->operand[1].type == OPT_CONST
2070 && po->operand[1].val == 0xff)
2072 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2073 snprintf(buf, buf_size, "(0)");
2077 // note: must be signed compare
2079 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2080 scast, buf1, buf2, is_inv ? ">=" : "<");
2084 snprintf(buf, buf_size, "(%s %s %s)",
2085 buf1, is_inv ? ">=" : "<", buf2);
2089 snprintf(buf, buf_size, "(%s %s %s)",
2090 buf1, is_inv ? ">" : "<=", buf2);
2098 static void out_cmp_test(char *buf, size_t buf_size,
2099 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2101 char buf1[256], buf2[256], buf3[256];
2103 if (po->op == OP_TEST) {
2104 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2105 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2108 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2109 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2110 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2112 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2113 po->operand[0].lmod, buf3);
2115 else if (po->op == OP_CMP) {
2116 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
2119 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2122 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2123 struct parsed_opr *popr2)
2125 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2126 ferr(po, "missing lmod for both operands\n");
2128 if (popr1->lmod == OPLM_UNSPEC)
2129 popr1->lmod = popr2->lmod;
2130 else if (popr2->lmod == OPLM_UNSPEC)
2131 popr2->lmod = popr1->lmod;
2132 else if (popr1->lmod != popr2->lmod) {
2133 if (popr1->type_from_var) {
2134 popr1->size_mismatch = 1;
2135 if (popr1->lmod < popr2->lmod)
2137 popr1->lmod = popr2->lmod;
2139 else if (popr2->type_from_var) {
2140 popr2->size_mismatch = 1;
2141 if (popr2->lmod < popr1->lmod)
2143 popr2->lmod = popr1->lmod;
2146 ferr(po, "conflicting lmods: %d vs %d\n",
2147 popr1->lmod, popr2->lmod);
2151 static const char *op_to_c(struct parsed_op *po)
2175 ferr(po, "op_to_c was supplied with %d\n", po->op);
2179 // last op in stream - unconditional branch or ret
2180 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2181 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2182 && ops[_i].op != OP_CALL))
2184 #define check_i(po, i) \
2186 ferr(po, "bad " #i ": %d\n", i)
2188 // note: this skips over calls and rm'd stuff assuming they're handled
2189 // so it's intended to use at one of final passes
2190 static int scan_for_pop(int i, int opcnt, int magic, int reg,
2191 int depth, int flags_set)
2193 struct parsed_op *po;
2198 for (; i < opcnt; i++) {
2200 if (po->cc_scratch == magic)
2201 return ret; // already checked
2202 po->cc_scratch = magic;
2204 if (po->flags & OPF_TAIL) {
2205 if (po->op == OP_CALL) {
2206 if (po->pp != NULL && po->pp->is_noreturn)
2207 // assume no stack cleanup for noreturn
2210 return -1; // deadend
2213 if (po->flags & (OPF_RMD|OPF_DONE|OPF_FARG))
2216 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2217 if (po->btj != NULL) {
2219 for (j = 0; j < po->btj->count; j++) {
2220 check_i(po, po->btj->d[j].bt_i);
2221 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, magic, reg,
2224 return ret; // dead end
2229 check_i(po, po->bt_i);
2230 if (po->flags & OPF_CJMP) {
2231 ret |= scan_for_pop(po->bt_i, opcnt, magic, reg,
2234 return ret; // dead end
2243 if ((po->op == OP_POP || po->op == OP_PUSH)
2244 && po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2249 if (po->op == OP_PUSH) {
2252 else if (po->op == OP_POP) {
2253 if (relevant && depth == 0) {
2254 po->flags |= flags_set;
2264 // scan for 'reg' pop backwards starting from i
2265 // intended to use for register restore search, so other reg
2266 // references are considered an error
2267 static int scan_for_rsave_pop_reg(int i, int magic, int reg, int set_flags)
2269 struct parsed_op *po;
2270 struct label_ref *lr;
2273 ops[i].cc_scratch = magic;
2277 if (g_labels[i] != NULL) {
2278 lr = &g_label_refs[i];
2279 for (; lr != NULL; lr = lr->next) {
2280 check_i(&ops[i], lr->i);
2281 ret |= scan_for_rsave_pop_reg(lr->i, magic, reg, set_flags);
2285 if (i > 0 && LAST_OP(i - 1))
2293 if (ops[i].cc_scratch == magic)
2295 ops[i].cc_scratch = magic;
2298 if (po->op == OP_POP && po->operand[0].reg == reg) {
2299 if (po->flags & (OPF_RMD|OPF_DONE))
2302 po->flags |= set_flags;
2306 // this also covers the case where we reach corresponding push
2307 if ((po->regmask_dst | po->regmask_src) & (1 << reg))
2311 // nothing interesting on this path
2315 static void find_reachable_exits(int i, int opcnt, int magic,
2316 int *exits, int *exit_count)
2318 struct parsed_op *po;
2321 for (; i < opcnt; i++)
2324 if (po->cc_scratch == magic)
2326 po->cc_scratch = magic;
2328 if (po->flags & OPF_TAIL) {
2329 ferr_assert(po, *exit_count < MAX_EXITS);
2330 exits[*exit_count] = i;
2335 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2336 if (po->flags & OPF_RMD)
2339 if (po->btj != NULL) {
2340 for (j = 0; j < po->btj->count; j++) {
2341 check_i(po, po->btj->d[j].bt_i);
2342 find_reachable_exits(po->btj->d[j].bt_i, opcnt, magic,
2348 check_i(po, po->bt_i);
2349 if (po->flags & OPF_CJMP)
2350 find_reachable_exits(po->bt_i, opcnt, magic, exits, exit_count);
2358 // scan for 'reg' pop backwards starting from exits (all paths)
2359 static int scan_for_pop_ret(int i, int opcnt, int reg, int set_flags)
2361 static int exits[MAX_EXITS];
2362 static int exit_count;
2367 find_reachable_exits(i, opcnt, i + opcnt * 15, exits,
2369 ferr_assert(&ops[i], exit_count > 0);
2372 for (j = 0; j < exit_count; j++) {
2373 ret = scan_for_rsave_pop_reg(exits[j], i + opcnt * 16 + set_flags,
2382 // scan for one or more pop of push <const>
2383 static int scan_for_pop_const_r(int i, int opcnt, int magic,
2384 int push_i, int is_probe)
2386 struct parsed_op *po;
2387 struct label_ref *lr;
2391 for (; i < opcnt; i++)
2394 if (po->cc_scratch == magic)
2395 return ret; // already checked
2396 po->cc_scratch = magic;
2398 if (po->flags & OPF_JMP) {
2399 if (po->flags & OPF_RMD)
2401 if (po->op == OP_CALL)
2404 if (po->btj != NULL) {
2405 for (j = 0; j < po->btj->count; j++) {
2406 check_i(po, po->btj->d[j].bt_i);
2407 ret |= scan_for_pop_const_r(po->btj->d[j].bt_i, opcnt, magic,
2415 check_i(po, po->bt_i);
2416 if (po->flags & OPF_CJMP) {
2417 ret |= scan_for_pop_const_r(po->bt_i, opcnt, magic, push_i,
2428 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_PUSH)
2431 if (g_labels[i] != NULL) {
2432 // all refs must be visited
2433 lr = &g_label_refs[i];
2434 for (; lr != NULL; lr = lr->next) {
2436 if (ops[lr->i].cc_scratch != magic)
2439 if (i > 0 && !LAST_OP(i - 1) && ops[i - 1].cc_scratch != magic)
2443 if (po->op == OP_POP)
2445 if (po->flags & (OPF_RMD|OPF_DONE))
2449 po->flags |= OPF_DONE;
2450 po->datap = &ops[push_i];
2459 static void scan_for_pop_const(int i, int opcnt, int magic)
2463 ret = scan_for_pop_const_r(i + 1, opcnt, magic, i, 1);
2465 ops[i].flags |= OPF_RMD | OPF_DONE;
2466 scan_for_pop_const_r(i + 1, opcnt, magic + 1, i, 0);
2470 // check if all branch targets within a marked path are also marked
2471 // note: the path checked must not be empty or end with a branch
2472 static int check_path_branches(int opcnt, int magic)
2474 struct parsed_op *po;
2477 for (i = 0; i < opcnt; i++) {
2479 if (po->cc_scratch != magic)
2482 if (po->flags & OPF_JMP) {
2483 if ((po->flags & OPF_RMD) || po->op == OP_CALL)
2486 if (po->btj != NULL) {
2487 for (j = 0; j < po->btj->count; j++) {
2488 check_i(po, po->btj->d[j].bt_i);
2489 if (ops[po->btj->d[j].bt_i].cc_scratch != magic)
2494 check_i(po, po->bt_i);
2495 if (ops[po->bt_i].cc_scratch != magic)
2497 if ((po->flags & OPF_CJMP) && ops[i + 1].cc_scratch != magic)
2505 // scan for multiple pushes for given pop
2506 static int scan_pushes_for_pop_r(int i, int magic, int pop_i,
2509 int reg = ops[pop_i].operand[0].reg;
2510 struct parsed_op *po;
2511 struct label_ref *lr;
2514 ops[i].cc_scratch = magic;
2518 if (g_labels[i] != NULL) {
2519 lr = &g_label_refs[i];
2520 for (; lr != NULL; lr = lr->next) {
2521 check_i(&ops[i], lr->i);
2522 ret |= scan_pushes_for_pop_r(lr->i, magic, pop_i, is_probe);
2526 if (i > 0 && LAST_OP(i - 1))
2534 if (ops[i].cc_scratch == magic)
2536 ops[i].cc_scratch = magic;
2539 if (po->op == OP_CALL)
2541 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_POP)
2544 if (po->op == OP_PUSH)
2546 if (po->datap != NULL)
2548 if (po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2549 // leave this case for reg save/restore handlers
2553 po->flags |= OPF_PPUSH | OPF_DONE;
2554 po->datap = &ops[pop_i];
2563 static void scan_pushes_for_pop(int i, int opcnt, int *regmask_pp)
2565 int magic = i + opcnt * 14;
2568 ret = scan_pushes_for_pop_r(i, magic, i, 1);
2570 ret = check_path_branches(opcnt, magic);
2572 ops[i].flags |= OPF_PPUSH | OPF_DONE;
2573 *regmask_pp |= 1 << ops[i].operand[0].reg;
2574 scan_pushes_for_pop_r(i, magic + 1, i, 0);
2579 static void scan_propagate_df(int i, int opcnt)
2581 struct parsed_op *po = &ops[i];
2584 for (; i < opcnt; i++) {
2586 if (po->flags & OPF_DF)
2587 return; // already resolved
2588 po->flags |= OPF_DF;
2590 if (po->op == OP_CALL)
2591 ferr(po, "call with DF set?\n");
2593 if (po->flags & OPF_JMP) {
2594 if (po->btj != NULL) {
2596 for (j = 0; j < po->btj->count; j++) {
2597 check_i(po, po->btj->d[j].bt_i);
2598 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2603 if (po->flags & OPF_RMD)
2605 check_i(po, po->bt_i);
2606 if (po->flags & OPF_CJMP)
2607 scan_propagate_df(po->bt_i, opcnt);
2613 if (po->flags & OPF_TAIL)
2616 if (po->op == OP_CLD) {
2617 po->flags |= OPF_RMD | OPF_DONE;
2622 ferr(po, "missing DF clear?\n");
2625 // is operand 'opr' referenced by parsed_op 'po'?
2626 static int is_opr_referenced(const struct parsed_opr *opr,
2627 const struct parsed_op *po)
2631 if (opr->type == OPT_REG) {
2632 mask = po->regmask_dst | po->regmask_src;
2633 if (po->op == OP_CALL)
2634 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX);
2635 if ((1 << opr->reg) & mask)
2641 for (i = 0; i < po->operand_cnt; i++)
2642 if (IS(po->operand[0].name, opr->name))
2648 // is operand 'opr' read by parsed_op 'po'?
2649 static int is_opr_read(const struct parsed_opr *opr,
2650 const struct parsed_op *po)
2652 if (opr->type == OPT_REG) {
2653 if (po->regmask_src & (1 << opr->reg))
2663 // is operand 'opr' modified by parsed_op 'po'?
2664 static int is_opr_modified(const struct parsed_opr *opr,
2665 const struct parsed_op *po)
2669 if (opr->type == OPT_REG) {
2670 if (po->op == OP_CALL) {
2671 mask = po->regmask_dst;
2672 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX); // ?
2673 if (mask & (1 << opr->reg))
2679 if (po->regmask_dst & (1 << opr->reg))
2685 return IS(po->operand[0].name, opr->name);
2688 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2689 static int is_any_opr_modified(const struct parsed_op *po_test,
2690 const struct parsed_op *po, int c_mode)
2695 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2698 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2701 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2704 // in reality, it can wreck any register, but in decompiled C
2705 // version it can only overwrite eax or edx:eax
2706 mask = (1 << xAX) | (1 << xDX);
2710 if (po->op == OP_CALL
2711 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2714 for (i = 0; i < po_test->operand_cnt; i++)
2715 if (IS(po_test->operand[i].name, po->operand[0].name))
2721 // scan for any po_test operand modification in range given
2722 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2725 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2728 for (; i < opcnt; i++) {
2729 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2736 // scan for po_test operand[0] modification in range given
2737 static int scan_for_mod_opr0(struct parsed_op *po_test,
2740 for (; i < opcnt; i++) {
2741 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2748 static int scan_for_flag_set(int i, int magic, int *branched,
2749 int *setters, int *setter_cnt)
2751 struct label_ref *lr;
2755 if (ops[i].cc_scratch == magic) {
2756 // is this a problem?
2757 //ferr(&ops[i], "%s looped\n", __func__);
2760 ops[i].cc_scratch = magic;
2762 if (g_labels[i] != NULL) {
2765 lr = &g_label_refs[i];
2766 for (; lr->next; lr = lr->next) {
2767 check_i(&ops[i], lr->i);
2768 ret = scan_for_flag_set(lr->i, magic,
2769 branched, setters, setter_cnt);
2774 check_i(&ops[i], lr->i);
2775 if (i > 0 && LAST_OP(i - 1)) {
2779 ret = scan_for_flag_set(lr->i, magic,
2780 branched, setters, setter_cnt);
2786 if (ops[i].flags & OPF_FLAGS) {
2787 setters[*setter_cnt] = i;
2792 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2799 // scan back for cdq, if anything modifies edx, fail
2800 static int scan_for_cdq_edx(int i)
2803 if (g_labels[i] != NULL) {
2804 if (g_label_refs[i].next != NULL)
2806 if (i > 0 && LAST_OP(i - 1)) {
2807 i = g_label_refs[i].i;
2814 if (ops[i].op == OP_CDQ)
2817 if (ops[i].regmask_dst & (1 << xDX))
2824 static int scan_for_reg_clear(int i, int reg)
2827 if (g_labels[i] != NULL) {
2828 if (g_label_refs[i].next != NULL)
2830 if (i > 0 && LAST_OP(i - 1)) {
2831 i = g_label_refs[i].i;
2838 if (ops[i].op == OP_XOR
2839 && ops[i].operand[0].lmod == OPLM_DWORD
2840 && ops[i].operand[0].reg == ops[i].operand[1].reg
2841 && ops[i].operand[0].reg == reg)
2844 if (ops[i].regmask_dst & (1 << reg))
2851 static void patch_esp_adjust(struct parsed_op *po, int adj)
2853 ferr_assert(po, po->op == OP_ADD);
2854 ferr_assert(po, IS(opr_name(po, 0), "esp"));
2855 ferr_assert(po, po->operand[1].type == OPT_CONST);
2857 // this is a bit of a hack, but deals with use of
2858 // single adj for multiple calls
2859 po->operand[1].val -= adj;
2860 po->flags |= OPF_RMD;
2861 if (po->operand[1].val == 0)
2862 po->flags |= OPF_DONE;
2863 ferr_assert(po, (int)po->operand[1].val >= 0);
2866 // scan for positive, constant esp adjust
2867 // multipath case is preliminary
2868 static int scan_for_esp_adjust(int i, int opcnt,
2869 int adj_expect, int *adj, int *is_multipath, int do_update)
2871 int adj_expect_unknown = 0;
2872 struct parsed_op *po;
2876 *adj = *is_multipath = 0;
2877 if (adj_expect < 0) {
2878 adj_expect_unknown = 1;
2879 adj_expect = 32 * 4; // enough?
2882 for (; i < opcnt && *adj < adj_expect; i++) {
2883 if (g_labels[i] != NULL)
2887 if (po->flags & OPF_DONE)
2890 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2891 if (po->operand[1].type != OPT_CONST)
2892 ferr(&ops[i], "non-const esp adjust?\n");
2893 *adj += po->operand[1].val;
2895 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2898 patch_esp_adjust(po, adj_expect);
2900 po->flags |= OPF_RMD;
2904 else if (po->op == OP_PUSH) {
2905 //if (first_pop == -1)
2906 // first_pop = -2; // none
2907 *adj -= lmod_bytes(po, po->operand[0].lmod);
2909 else if (po->op == OP_POP) {
2910 if (!(po->flags & OPF_DONE)) {
2911 // seems like msvc only uses 'pop ecx' for stack realignment..
2912 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2914 if (first_pop == -1 && *adj >= 0)
2917 if (do_update && *adj >= 0) {
2918 po->flags |= OPF_RMD;
2920 po->flags |= OPF_DONE | OPF_NOREGS;
2923 *adj += lmod_bytes(po, po->operand[0].lmod);
2924 if (*adj > adj_best)
2927 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2928 if (po->op == OP_JMP && po->btj == NULL) {
2934 if (po->op != OP_CALL)
2936 if (po->operand[0].type != OPT_LABEL)
2938 if (po->pp != NULL && po->pp->is_stdcall)
2940 if (adj_expect_unknown && first_pop >= 0)
2942 // assume it's another cdecl call
2946 if (first_pop >= 0) {
2947 // probably only 'pop ecx' was used
2955 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2957 struct parsed_op *po;
2961 ferr(ops, "%s: followed bad branch?\n", __func__);
2963 for (; i < opcnt; i++) {
2965 if (po->cc_scratch == magic)
2967 po->cc_scratch = magic;
2970 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2971 if (po->btj != NULL) {
2973 for (j = 0; j < po->btj->count; j++)
2974 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2978 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2979 if (!(po->flags & OPF_CJMP))
2982 if (po->flags & OPF_TAIL)
2987 static const struct parsed_proto *try_recover_pp(
2988 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2990 const struct parsed_proto *pp = NULL;
2994 // maybe an arg of g_func?
2995 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2997 char ofs_reg[16] = { 0, };
2998 int arg, arg_s, arg_i;
3005 parse_stack_access(po, opr->name, ofs_reg,
3006 &offset, &stack_ra, NULL, 0);
3007 if (ofs_reg[0] != 0)
3008 ferr(po, "offset reg on arg access?\n");
3009 if (offset <= stack_ra) {
3010 // search who set the stack var instead
3011 if (search_instead != NULL)
3012 *search_instead = 1;
3016 arg_i = (offset - stack_ra - 4) / 4;
3017 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
3018 if (g_func_pp->arg[arg].reg != NULL)
3024 if (arg == g_func_pp->argc)
3025 ferr(po, "stack arg %d not in prototype?\n", arg_i);
3027 pp = g_func_pp->arg[arg].fptr;
3029 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
3030 check_func_pp(po, pp, "icall arg");
3032 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
3034 p = strchr(opr->name + 1, '[');
3035 memcpy(buf, opr->name, p - opr->name);
3036 buf[p - opr->name] = 0;
3037 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
3039 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
3040 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
3043 ferr(po, "proto_parse failed for icall to '%s'\n", opr->name);
3046 check_func_pp(po, pp, "reg-fptr ref");
3052 static void scan_for_call_type(int i, const struct parsed_opr *opr,
3053 int magic, const struct parsed_proto **pp_found, int *pp_i,
3056 const struct parsed_proto *pp = NULL;
3057 struct parsed_op *po;
3058 struct label_ref *lr;
3060 ops[i].cc_scratch = magic;
3063 if (g_labels[i] != NULL) {
3064 lr = &g_label_refs[i];
3065 for (; lr != NULL; lr = lr->next) {
3066 check_i(&ops[i], lr->i);
3067 scan_for_call_type(lr->i, opr, magic, pp_found, pp_i, multi);
3069 if (i > 0 && LAST_OP(i - 1))
3077 if (ops[i].cc_scratch == magic)
3079 ops[i].cc_scratch = magic;
3081 if (!(ops[i].flags & OPF_DATA))
3083 if (!is_opr_modified(opr, &ops[i]))
3085 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
3086 // most probably trashed by some processing
3091 opr = &ops[i].operand[1];
3092 if (opr->type != OPT_REG)
3096 po = (i >= 0) ? &ops[i] : ops;
3099 // reached the top - can only be an arg-reg
3100 if (opr->type != OPT_REG || g_func_pp == NULL)
3103 for (i = 0; i < g_func_pp->argc; i++) {
3104 if (g_func_pp->arg[i].reg == NULL)
3106 if (IS(opr->name, g_func_pp->arg[i].reg))
3109 if (i == g_func_pp->argc)
3111 pp = g_func_pp->arg[i].fptr;
3113 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
3114 i + 1, g_func_pp->arg[i].reg);
3115 check_func_pp(po, pp, "icall reg-arg");
3118 pp = try_recover_pp(po, opr, NULL);
3120 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
3121 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
3122 || (*pp_found)->is_stdcall != pp->is_stdcall
3123 || (*pp_found)->is_fptr != pp->is_fptr
3124 || (*pp_found)->argc != pp->argc
3125 || (*pp_found)->argc_reg != pp->argc_reg
3126 || (*pp_found)->argc_stack != pp->argc_stack)
3128 ferr(po, "icall: parsed_proto mismatch\n");
3138 static void add_label_ref(struct label_ref *lr, int op_i)
3140 struct label_ref *lr_new;
3147 lr_new = calloc(1, sizeof(*lr_new));
3149 lr_new->next = lr->next;
3153 static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
3155 struct parsed_op *po = &ops[i];
3156 struct parsed_data *pd;
3157 char label[NAMELEN], *p;
3160 p = strchr(po->operand[0].name, '[');
3164 len = p - po->operand[0].name;
3165 strncpy(label, po->operand[0].name, len);
3168 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3169 if (IS(g_func_pd[j].label, label)) {
3175 //ferr(po, "label '%s' not parsed?\n", label);
3178 if (pd->type != OPT_OFFSET)
3179 ferr(po, "label '%s' with non-offset data?\n", label);
3181 // find all labels, link
3182 for (j = 0; j < pd->count; j++) {
3183 for (l = 0; l < opcnt; l++) {
3184 if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) {
3185 add_label_ref(&g_label_refs[l], i);
3195 static void clear_labels(int count)
3199 for (i = 0; i < count; i++) {
3200 if (g_labels[i] != NULL) {
3207 static int get_pp_arg_regmask_src(const struct parsed_proto *pp)
3212 for (i = 0; i < pp->argc; i++) {
3213 if (pp->arg[i].reg != NULL) {
3214 reg = char_array_i(regs_r32,
3215 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
3217 ferr(ops, "arg '%s' of func '%s' is not a reg?\n",
3218 pp->arg[i].reg, pp->name);
3219 regmask |= 1 << reg;
3226 static int get_pp_arg_regmask_dst(const struct parsed_proto *pp)
3228 if (strstr(pp->ret_type.name, "int64"))
3229 return (1 << xAX) | (1 << xDX);
3230 if (strcasecmp(pp->ret_type.name, "void") == 0)
3236 static void resolve_branches_parse_calls(int opcnt)
3238 const struct parsed_proto *pp_c;
3239 struct parsed_proto *pp;
3240 struct parsed_data *pd;
3241 struct parsed_op *po;
3242 const char *tmpname;
3246 for (i = 0; i < opcnt; i++)
3252 if (po->op == OP_CALL) {
3255 if (po->operand[0].type == OPT_LABEL) {
3256 tmpname = opr_name(po, 0);
3257 if (IS_START(tmpname, "loc_"))
3258 ferr(po, "call to loc_*\n");
3259 pp_c = proto_parse(g_fhdr, tmpname, g_header_mode);
3260 if (!g_header_mode && pp_c == NULL)
3261 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3264 pp = proto_clone(pp_c);
3265 my_assert_not(pp, NULL);
3268 else if (po->datap != NULL) {
3269 pp = calloc(1, sizeof(*pp));
3270 my_assert_not(pp, NULL);
3272 ret = parse_protostr(po->datap, pp);
3274 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3281 check_func_pp(po, pp, "fptr var call");
3282 if (pp->is_noreturn)
3283 po->flags |= OPF_TAIL;
3289 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3292 if (po->operand[0].type == OPT_REGMEM) {
3293 pd = try_resolve_jumptab(i, opcnt);
3301 for (l = 0; l < opcnt; l++) {
3302 if (g_labels[l] != NULL
3303 && IS(po->operand[0].name, g_labels[l]))
3305 if (l == i + 1 && po->op == OP_JMP) {
3306 // yet another alignment type..
3307 po->flags |= OPF_RMD|OPF_DONE;
3310 add_label_ref(&g_label_refs[l], i);
3316 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3319 if (po->operand[0].type == OPT_LABEL)
3323 ferr(po, "unhandled branch\n");
3327 po->flags |= OPF_TAIL;
3328 if (i > 0 && ops[i - 1].op == OP_POP)
3329 po->flags |= OPF_ATAIL;
3334 static void scan_prologue_epilogue(int opcnt)
3336 int ecx_push = 0, esp_sub = 0;
3340 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3341 && ops[1].op == OP_MOV
3342 && IS(opr_name(&ops[1], 0), "ebp")
3343 && IS(opr_name(&ops[1], 1), "esp"))
3346 ops[0].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3347 ops[1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3350 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
3351 g_stack_fsz = opr_const(&ops[2], 1);
3352 ops[2].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3356 // another way msvc builds stack frame..
3358 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3360 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3364 // and another way..
3365 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3366 && ops[i].operand[1].type == OPT_CONST
3367 && ops[i + 1].op == OP_CALL
3368 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3370 g_stack_fsz += ops[i].operand[1].val;
3371 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3373 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3380 for (; i < opcnt; i++)
3381 if (ops[i].flags & OPF_TAIL)
3384 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3385 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3391 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3392 || ops[j].op == OP_LEAVE)
3394 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3396 else if (ops[i].op == OP_CALL && ops[i].pp != NULL
3397 && ops[i].pp->is_noreturn)
3399 // on noreturn, msvc sometimes cleans stack, sometimes not
3404 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3405 ferr(&ops[j], "'pop ebp' expected\n");
3407 if (g_stack_fsz != 0) {
3408 if (ops[j].op == OP_LEAVE)
3410 else if (ops[j].op == OP_POP
3411 && ops[j - 1].op == OP_MOV
3412 && IS(opr_name(&ops[j - 1], 0), "esp")
3413 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3415 ops[j - 1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3418 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3420 ferr(&ops[j], "esp restore expected\n");
3423 if (ecx_push && j >= 0 && ops[j].op == OP_POP
3424 && IS(opr_name(&ops[j], 0), "ecx"))
3426 ferr(&ops[j], "unexpected ecx pop\n");
3432 } while (i < opcnt);
3435 ferr(ops, "missing ebp epilogue\n");
3441 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3442 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3448 for (; i < opcnt; i++) {
3449 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3451 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3452 && ops[i].operand[1].type == OPT_CONST)
3454 g_stack_fsz = ops[i].operand[1].val;
3455 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3461 if (ecx_push && !esp_sub) {
3462 // could actually be args for a call..
3463 for (; i < opcnt; i++)
3464 if (ops[i].op != OP_PUSH)
3467 if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) {
3468 const struct parsed_proto *pp;
3469 pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1);
3470 j = pp ? pp->argc_stack : 0;
3471 while (i > 0 && j > 0) {
3473 if (ops[i].op == OP_PUSH) {
3474 ops[i].flags &= ~(OPF_RMD | OPF_DONE | OPF_NOREGS);
3479 ferr(&ops[i], "unhandled prologue\n");
3482 i = g_stack_fsz = ecx_push = 0;
3483 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3484 if (!(ops[i].flags & OPF_RMD))
3494 if (ecx_push || esp_sub)
3500 for (; i < opcnt; i++)
3501 if (ops[i].flags & OPF_TAIL)
3504 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3505 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3512 for (l = 0; l < ecx_push; l++) {
3513 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx"))
3515 else if (ops[j].op == OP_ADD
3516 && IS(opr_name(&ops[j], 0), "esp")
3517 && ops[j].operand[1].type == OPT_CONST)
3520 l += ops[j].operand[1].val / 4 - 1;
3523 ferr(&ops[j], "'pop ecx' expected\n");
3525 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3529 ferr(&ops[j], "epilogue scan failed\n");
3535 if (ops[j].op != OP_ADD
3536 || !IS(opr_name(&ops[j], 0), "esp")
3537 || ops[j].operand[1].type != OPT_CONST
3538 || ops[j].operand[1].val != g_stack_fsz)
3539 ferr(&ops[j], "'add esp' expected\n");
3541 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3542 ops[j].operand[1].val = 0; // hack for stack arg scanner
3547 } while (i < opcnt);
3550 ferr(ops, "missing esp epilogue\n");
3554 static const struct parsed_proto *resolve_icall(int i, int opcnt,
3555 int *pp_i, int *multi_src)
3557 const struct parsed_proto *pp = NULL;
3558 int search_advice = 0;
3563 switch (ops[i].operand[0].type) {
3567 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
3572 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
3580 // find an instruction that changed opr before i op
3581 // *op_i must be set to -1 by the caller
3582 // *entry is set to 1 if one source is determined to be the caller
3583 // returns 1 if found, *op_i is then set to origin
3584 static int resolve_origin(int i, const struct parsed_opr *opr,
3585 int magic, int *op_i, int *is_caller)
3587 struct label_ref *lr;
3590 if (ops[i].cc_scratch == magic)
3592 ops[i].cc_scratch = magic;
3595 if (g_labels[i] != NULL) {
3596 lr = &g_label_refs[i];
3597 for (; lr != NULL; lr = lr->next) {
3598 check_i(&ops[i], lr->i);
3599 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
3601 if (i > 0 && LAST_OP(i - 1))
3607 if (is_caller != NULL)
3612 if (ops[i].cc_scratch == magic)
3614 ops[i].cc_scratch = magic;
3616 if (!(ops[i].flags & OPF_DATA))
3618 if (!is_opr_modified(opr, &ops[i]))
3625 // XXX: could check if the other op does the same
3634 // find an instruction that previously referenced opr
3635 // if multiple results are found - fail
3636 // *op_i must be set to -1 by the caller
3637 // returns 1 if found, *op_i is then set to referencer insn
3638 static int resolve_last_ref(int i, const struct parsed_opr *opr,
3639 int magic, int *op_i)
3641 struct label_ref *lr;
3644 if (ops[i].cc_scratch == magic)
3646 ops[i].cc_scratch = magic;
3649 if (g_labels[i] != NULL) {
3650 lr = &g_label_refs[i];
3651 for (; lr != NULL; lr = lr->next) {
3652 check_i(&ops[i], lr->i);
3653 ret |= resolve_last_ref(lr->i, opr, magic, op_i);
3655 if (i > 0 && LAST_OP(i - 1))
3663 if (ops[i].cc_scratch == magic)
3665 ops[i].cc_scratch = magic;
3667 if (!is_opr_referenced(opr, &ops[i]))
3678 // find next instruction that reads opr
3679 // *op_i must be set to -1 by the caller
3680 // on return, *op_i is set to first referencer insn
3681 // returns 1 if exactly 1 referencer is found
3682 static int find_next_read(int i, int opcnt,
3683 const struct parsed_opr *opr, int magic, int *op_i)
3685 struct parsed_op *po;
3688 for (; i < opcnt; i++)
3690 if (ops[i].cc_scratch == magic)
3692 ops[i].cc_scratch = magic;
3695 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
3696 if (po->btj != NULL) {
3698 for (j = 0; j < po->btj->count; j++) {
3699 check_i(po, po->btj->d[j].bt_i);
3700 ret |= find_next_read(po->btj->d[j].bt_i, opcnt, opr,
3706 if (po->flags & OPF_RMD)
3708 check_i(po, po->bt_i);
3709 if (po->flags & OPF_CJMP) {
3710 ret |= find_next_read(po->bt_i, opcnt, opr, magic, op_i);
3719 if (!is_opr_read(opr, po)) {
3720 if (is_opr_modified(opr, po)
3721 && (po->op == OP_CALL
3722 || ((po->flags & OPF_DATA)
3723 && po->operand[0].lmod == OPLM_DWORD)))
3728 if (po->flags & OPF_TAIL)
3743 static int try_resolve_const(int i, const struct parsed_opr *opr,
3744 int magic, unsigned int *val)
3749 ret = resolve_origin(i, opr, magic, &s_i, NULL);
3752 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
3755 *val = ops[i].operand[1].val;
3762 static struct parsed_proto *process_call_early(int i, int opcnt,
3765 struct parsed_op *po = &ops[i];
3766 struct parsed_proto *pp;
3772 if (pp == NULL || pp->is_vararg || pp->argc_reg != 0)
3776 // look for and make use of esp adjust
3778 if (!pp->is_stdcall && pp->argc_stack > 0)
3779 ret = scan_for_esp_adjust(i + 1, opcnt,
3780 pp->argc_stack * 4, &adj, &multipath, 0);
3782 if (pp->argc_stack > adj / 4)
3786 if (ops[ret].op == OP_POP) {
3787 for (j = 1; j < adj / 4; j++) {
3788 if (ops[ret + j].op != OP_POP
3789 || ops[ret + j].operand[0].reg != xCX)
3801 static struct parsed_proto *process_call(int i, int opcnt)
3803 struct parsed_op *po = &ops[i];
3804 const struct parsed_proto *pp_c;
3805 struct parsed_proto *pp;
3806 const char *tmpname;
3807 int call_i = -1, ref_i = -1;
3808 int adj = 0, multipath = 0;
3811 tmpname = opr_name(po, 0);
3816 pp_c = resolve_icall(i, opcnt, &call_i, &multipath);
3818 if (!pp_c->is_func && !pp_c->is_fptr)
3819 ferr(po, "call to non-func: %s\n", pp_c->name);
3820 pp = proto_clone(pp_c);
3821 my_assert_not(pp, NULL);
3823 // not resolved just to single func
3826 switch (po->operand[0].type) {
3828 // we resolved this call and no longer need the register
3829 po->regmask_src &= ~(1 << po->operand[0].reg);
3831 if (!multipath && i != call_i && ops[call_i].op == OP_MOV
3832 && ops[call_i].operand[1].type == OPT_LABEL)
3834 // no other source users?
3835 ret = resolve_last_ref(i, &po->operand[0], i + opcnt * 10,
3837 if (ret == 1 && call_i == ref_i) {
3838 // and nothing uses it after us?
3840 find_next_read(i + 1, opcnt, &po->operand[0],
3841 i + opcnt * 11, &ref_i);
3843 // then also don't need the source mov
3844 ops[call_i].flags |= OPF_RMD | OPF_NOREGS;
3856 pp = calloc(1, sizeof(*pp));
3857 my_assert_not(pp, NULL);
3860 ret = scan_for_esp_adjust(i + 1, opcnt,
3861 -1, &adj, &multipath, 0);
3862 if (ret < 0 || adj < 0) {
3863 if (!g_allow_regfunc)
3864 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3865 pp->is_unresolved = 1;
3869 if (adj > ARRAY_SIZE(pp->arg))
3870 ferr(po, "esp adjust too large: %d\n", adj);
3871 pp->ret_type.name = strdup("int");
3872 pp->argc = pp->argc_stack = adj;
3873 for (arg = 0; arg < pp->argc; arg++)
3874 pp->arg[arg].type.name = strdup("int");
3879 // look for and make use of esp adjust
3882 if (!pp->is_stdcall && pp->argc_stack > 0) {
3883 int adj_expect = pp->is_vararg ? -1 : pp->argc_stack * 4;
3884 ret = scan_for_esp_adjust(i + 1, opcnt,
3885 adj_expect, &adj, &multipath, 0);
3888 if (pp->is_vararg) {
3889 if (adj / 4 < pp->argc_stack) {
3890 fnote(po, "(this call)\n");
3891 ferr(&ops[ret], "esp adjust is too small: %x < %x\n",
3892 adj, pp->argc_stack * 4);
3894 // modify pp to make it have varargs as normal args
3896 pp->argc += adj / 4 - pp->argc_stack;
3897 for (; arg < pp->argc; arg++) {
3898 pp->arg[arg].type.name = strdup("int");
3901 if (pp->argc > ARRAY_SIZE(pp->arg))
3902 ferr(po, "too many args for '%s'\n", tmpname);
3904 if (pp->argc_stack > adj / 4) {
3905 fnote(po, "(this call)\n");
3906 ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n",
3907 tmpname, pp->argc_stack * 4, adj);
3910 scan_for_esp_adjust(i + 1, opcnt,
3911 pp->argc_stack * 4, &adj, &multipath, 1);
3913 else if (pp->is_vararg)
3914 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3920 static int collect_call_args_early(struct parsed_op *po, int i,
3921 struct parsed_proto *pp, int *regmask)
3926 for (arg = 0; arg < pp->argc; arg++)
3927 if (pp->arg[arg].reg == NULL)
3930 // first see if it can be easily done
3931 for (j = i; j > 0 && arg < pp->argc; )
3933 if (g_labels[j] != NULL)
3937 if (ops[j].op == OP_CALL)
3939 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP)
3941 else if (ops[j].op == OP_POP)
3943 else if (ops[j].flags & OPF_CJMP)
3945 else if (ops[j].op == OP_PUSH) {
3946 if (ops[j].flags & (OPF_FARG|OPF_FARGNR))
3948 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3952 if (pp->arg[arg].type.is_va_list)
3956 for (arg++; arg < pp->argc; arg++)
3957 if (pp->arg[arg].reg == NULL)
3966 for (arg = 0; arg < pp->argc; arg++)
3967 if (pp->arg[arg].reg == NULL)
3970 for (j = i; j > 0 && arg < pp->argc; )
3974 if (ops[j].op == OP_PUSH)
3976 ops[j].p_argnext = -1;
3977 ferr_assert(&ops[j], pp->arg[arg].datap == NULL);
3978 pp->arg[arg].datap = &ops[j];
3980 if (ops[j].operand[0].type == OPT_REG)
3981 *regmask |= 1 << ops[j].operand[0].reg;
3983 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
3984 ops[j].flags &= ~OPF_RSAVE;
3987 for (arg++; arg < pp->argc; arg++)
3988 if (pp->arg[arg].reg == NULL)
3996 static int collect_call_args_r(struct parsed_op *po, int i,
3997 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3998 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
4000 struct parsed_proto *pp_tmp;
4001 struct parsed_op *po_tmp;
4002 struct label_ref *lr;
4003 int need_to_save_current;
4004 int arg_grp_current = 0;
4005 int save_args_seen = 0;
4013 ferr(po, "dead label encountered\n");
4017 for (; arg < pp->argc; arg++)
4018 if (pp->arg[arg].reg == NULL)
4020 magic = (magic & 0xffffff) | (arg << 24);
4022 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
4024 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
4025 if (ops[j].cc_scratch != magic) {
4026 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
4030 // ok: have already been here
4033 ops[j].cc_scratch = magic;
4035 if (g_labels[j] != NULL && g_label_refs[j].i != -1) {
4036 lr = &g_label_refs[j];
4037 if (lr->next != NULL)
4039 for (; lr->next; lr = lr->next) {
4040 check_i(&ops[j], lr->i);
4041 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4043 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4044 arg_grp, arg, magic, need_op_saving, may_reuse);
4049 check_i(&ops[j], lr->i);
4050 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4052 if (j > 0 && LAST_OP(j - 1)) {
4053 // follow last branch in reverse
4058 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4059 arg_grp, arg, magic, need_op_saving, may_reuse);
4065 if (ops[j].op == OP_CALL)
4067 if (pp->is_unresolved)
4072 ferr(po, "arg collect hit unparsed call '%s'\n",
4073 ops[j].operand[0].name);
4074 if (may_reuse && pp_tmp->argc_stack > 0)
4075 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
4076 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
4078 // esp adjust of 0 means we collected it before
4079 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
4080 && (ops[j].operand[1].type != OPT_CONST
4081 || ops[j].operand[1].val != 0))
4083 if (pp->is_unresolved)
4086 fnote(po, "(this call)\n");
4087 ferr(&ops[j], "arg collect %d/%d hit esp adjust of %d\n",
4088 arg, pp->argc, ops[j].operand[1].val);
4090 else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_DONE))
4092 if (pp->is_unresolved)
4095 fnote(po, "(this call)\n");
4096 ferr(&ops[j], "arg collect %d/%d hit pop\n", arg, pp->argc);
4098 else if (ops[j].flags & OPF_CJMP)
4100 if (pp->is_unresolved)
4105 else if (ops[j].op == OP_PUSH
4106 && !(ops[j].flags & (OPF_FARGNR|OPF_DONE)))
4108 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
4111 ops[j].p_argnext = -1;
4112 po_tmp = pp->arg[arg].datap;
4114 ops[j].p_argnext = po_tmp - ops;
4115 pp->arg[arg].datap = &ops[j];
4117 need_to_save_current = 0;
4120 if (ops[j].operand[0].type == OPT_REG)
4121 reg = ops[j].operand[0].reg;
4123 if (!need_op_saving) {
4124 ret = scan_for_mod(&ops[j], j + 1, i, 1);
4125 need_to_save_current = (ret >= 0);
4127 if (need_op_saving || need_to_save_current) {
4128 // mark this push as one that needs operand saving
4129 ops[j].flags &= ~OPF_RMD;
4130 if (ops[j].p_argnum == 0) {
4131 ops[j].p_argnum = arg + 1;
4132 save_args |= 1 << arg;
4134 else if (ops[j].p_argnum < arg + 1) {
4135 // XXX: might kill valid var..
4136 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
4137 ops[j].p_argnum = arg + 1;
4138 save_args |= 1 << arg;
4141 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
4144 if (arg_grp_current >= MAX_ARG_GRP)
4145 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
4146 ops[j].p_argnum, pp->name);
4149 else if (ops[j].p_argnum == 0)
4150 ops[j].flags |= OPF_RMD;
4152 // some PUSHes are reused by different calls on other branches,
4153 // but that can't happen if we didn't branch, so they
4154 // can be removed from future searches (handles nested calls)
4156 ops[j].flags |= OPF_FARGNR;
4158 ops[j].flags |= OPF_FARG;
4159 ops[j].flags &= ~OPF_RSAVE;
4161 // check for __VALIST
4162 if (!pp->is_unresolved && g_func_pp != NULL
4163 && pp->arg[arg].type.is_va_list)
4166 ret = resolve_origin(j, &ops[j].operand[0],
4167 magic + 1, &k, NULL);
4168 if (ret == 1 && k >= 0)
4170 if (ops[k].op == OP_LEA) {
4171 if (!g_func_pp->is_vararg)
4172 ferr(&ops[k], "lea <arg> used, but %s is not vararg?\n",
4175 snprintf(buf, sizeof(buf), "arg_%X",
4176 g_func_pp->argc_stack * 4);
4177 if (strstr(ops[k].operand[1].name, buf)
4178 || strstr(ops[k].operand[1].name, "arglist"))
4180 ops[k].flags |= OPF_RMD | OPF_NOREGS | OPF_DONE;
4181 ops[j].flags |= OPF_RMD | OPF_NOREGS | OPF_VAPUSH;
4182 save_args &= ~(1 << arg);
4186 ferr(&ops[k], "va_list arg detection failed\n");
4188 // check for va_list from g_func_pp arg too
4189 else if (ops[k].op == OP_MOV
4190 && is_stack_access(&ops[k], &ops[k].operand[1]))
4192 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
4193 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
4195 ops[k].flags |= OPF_RMD | OPF_DONE;
4196 ops[j].flags |= OPF_RMD;
4197 ops[j].p_argpass = ret + 1;
4198 save_args &= ~(1 << arg);
4205 *save_arg_vars |= save_args;
4207 // tracking reg usage
4209 *regmask |= 1 << reg;
4212 if (!pp->is_unresolved) {
4214 for (; arg < pp->argc; arg++)
4215 if (pp->arg[arg].reg == NULL)
4218 magic = (magic & 0xffffff) | (arg << 24);
4221 if (ops[j].p_arggrp > arg_grp_current) {
4223 arg_grp_current = ops[j].p_arggrp;
4225 if (ops[j].p_argnum > 0)
4226 save_args_seen |= 1 << (ops[j].p_argnum - 1);
4229 if (arg < pp->argc) {
4230 ferr(po, "arg collect failed for '%s': %d/%d\n",
4231 pp->name, arg, pp->argc);
4235 if (arg_grp_current > *arg_grp)
4236 *arg_grp = arg_grp_current;
4241 static int collect_call_args(struct parsed_op *po, int i,
4242 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
4245 // arg group is for cases when pushes for
4246 // multiple funcs are going on
4247 struct parsed_op *po_tmp;
4248 int save_arg_vars_current = 0;
4253 ret = collect_call_args_r(po, i, pp, regmask,
4254 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
4259 // propagate arg_grp
4260 for (a = 0; a < pp->argc; a++) {
4261 if (pp->arg[a].reg != NULL)
4264 po_tmp = pp->arg[a].datap;
4265 while (po_tmp != NULL) {
4266 po_tmp->p_arggrp = arg_grp;
4267 if (po_tmp->p_argnext > 0)
4268 po_tmp = &ops[po_tmp->p_argnext];
4274 save_arg_vars[arg_grp] |= save_arg_vars_current;
4276 if (pp->is_unresolved) {
4278 pp->argc_stack += ret;
4279 for (a = 0; a < pp->argc; a++)
4280 if (pp->arg[a].type.name == NULL)
4281 pp->arg[a].type.name = strdup("int");
4287 static void reg_use_pass(int i, int opcnt, unsigned char *cbits,
4288 int regmask_now, int *regmask,
4289 int regmask_save_now, int *regmask_save,
4290 int *regmask_init, int regmask_arg)
4292 struct parsed_op *po;
4300 for (; i < opcnt; i++)
4303 if (cbits[i >> 3] & (1 << (i & 7)))
4305 cbits[i >> 3] |= (1 << (i & 7));
4307 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
4308 if (po->flags & (OPF_RMD|OPF_DONE))
4310 if (po->btj != NULL) {
4311 for (j = 0; j < po->btj->count; j++) {
4312 check_i(po, po->btj->d[j].bt_i);
4313 reg_use_pass(po->btj->d[j].bt_i, opcnt, cbits,
4314 regmask_now, regmask, regmask_save_now, regmask_save,
4315 regmask_init, regmask_arg);
4320 check_i(po, po->bt_i);
4321 if (po->flags & OPF_CJMP)
4322 reg_use_pass(po->bt_i, opcnt, cbits,
4323 regmask_now, regmask, regmask_save_now, regmask_save,
4324 regmask_init, regmask_arg);
4330 if (po->op == OP_PUSH && !(po->flags & (OPF_FARG|OPF_DONE))
4331 && !g_func_pp->is_userstack
4332 && po->operand[0].type == OPT_REG)
4334 reg = po->operand[0].reg;
4335 ferr_assert(po, reg >= 0);
4338 flags_set = OPF_RSAVE | OPF_RMD | OPF_DONE;
4339 if (regmask_now & (1 << reg)) {
4340 already_saved = regmask_save_now & (1 << reg);
4341 flags_set = OPF_RSAVE | OPF_DONE;
4344 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, 0);
4346 scan_for_pop(i + 1, opcnt, i + opcnt * 4, reg, 0, flags_set);
4349 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
4351 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg,
4356 ferr_assert(po, !already_saved);
4357 po->flags |= flags_set;
4359 if (regmask_now & (1 << reg)) {
4360 regmask_save_now |= (1 << reg);
4361 *regmask_save |= regmask_save_now;
4366 else if (po->op == OP_POP && (po->flags & OPF_RSAVE)) {
4367 reg = po->operand[0].reg;
4368 ferr_assert(po, reg >= 0);
4370 if (regmask_save_now & (1 << reg))
4371 regmask_save_now &= ~(1 << reg);
4373 regmask_now &= ~(1 << reg);
4376 else if (po->op == OP_CALL) {
4377 if ((po->regmask_dst & (1 << xAX))
4378 && !(po->regmask_dst & (1 << xDX)))
4380 if (po->flags & OPF_TAIL)
4381 // don't need eax, will do "return f();" or "f(); return;"
4382 po->regmask_dst &= ~(1 << xAX);
4384 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
4386 find_next_read(i + 1, opcnt, &opr, i + opcnt * 17, &j);
4389 po->regmask_dst &= ~(1 << xAX);
4394 if (po->flags & OPF_NOREGS)
4397 // if incomplete register is used, clear it on init to avoid
4398 // later use of uninitialized upper part in some situations
4399 if ((po->flags & OPF_DATA) && po->operand[0].type == OPT_REG
4400 && po->operand[0].lmod != OPLM_DWORD)
4402 reg = po->operand[0].reg;
4403 ferr_assert(po, reg >= 0);
4405 if (!(regmask_now & (1 << reg)))
4406 *regmask_init |= 1 << reg;
4409 regmask_op = po->regmask_src | po->regmask_dst;
4411 regmask_new = po->regmask_src & ~regmask_now & ~regmask_arg;
4412 regmask_new &= ~(1 << xSP);
4413 if (g_bp_frame && !(po->flags & OPF_EBP_S))
4414 regmask_new &= ~(1 << xBP);
4416 if (po->op == OP_CALL) {
4417 // allow fastcall calls from anywhere, calee may be also sitting
4418 // in some fastcall table even when it's not using reg args
4419 if (regmask_new & po->regmask_src & (1 << xCX)) {
4420 *regmask_init |= (1 << xCX);
4421 regmask_now |= (1 << xCX);
4422 regmask_new &= ~(1 << xCX);
4424 if (regmask_new & po->regmask_src & (1 << xDX)) {
4425 *regmask_init |= (1 << xDX);
4426 regmask_now |= (1 << xDX);
4427 regmask_new &= ~(1 << xDX);
4431 if (regmask_new != 0)
4432 fnote(po, "uninitialized reg mask: %x\n", regmask_new);
4434 if (regmask_op & (1 << xBP)) {
4435 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
4436 if (po->regmask_dst & (1 << xBP))
4437 // compiler decided to drop bp frame and use ebp as scratch
4438 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
4440 regmask_op &= ~(1 << xBP);
4444 regmask_now |= regmask_op;
4445 *regmask |= regmask_now;
4447 if (po->flags & OPF_TAIL)
4452 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
4456 for (i = 0; i < pp->argc; i++)
4457 if (pp->arg[i].reg == NULL)
4461 memmove(&pp->arg[i + 1], &pp->arg[i],
4462 sizeof(pp->arg[0]) * pp->argc_stack);
4463 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
4464 pp->arg[i].reg = strdup(reg);
4465 pp->arg[i].type.name = strdup("int");
4470 static void output_std_flags(FILE *fout, struct parsed_op *po,
4471 int *pfomask, const char *dst_opr_text)
4473 if (*pfomask & (1 << PFO_Z)) {
4474 fprintf(fout, "\n cond_z = (%s%s == 0);",
4475 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
4476 *pfomask &= ~(1 << PFO_Z);
4478 if (*pfomask & (1 << PFO_S)) {
4479 fprintf(fout, "\n cond_s = (%s%s < 0);",
4480 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
4481 *pfomask &= ~(1 << PFO_S);
4486 OPP_FORCE_NORETURN = (1 << 0),
4487 OPP_SIMPLE_ARGS = (1 << 1),
4488 OPP_ALIGN = (1 << 2),
4491 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
4494 const char *cconv = "";
4496 if (pp->is_fastcall)
4497 cconv = "__fastcall ";
4498 else if (pp->is_stdcall && pp->argc_reg == 0)
4499 cconv = "__stdcall ";
4501 fprintf(fout, (flags & OPP_ALIGN) ? "%-16s" : "%s", cconv);
4503 if (pp->is_noreturn || (flags & OPP_FORCE_NORETURN))
4504 fprintf(fout, "noreturn ");
4507 static void output_pp(FILE *fout, const struct parsed_proto *pp,
4512 fprintf(fout, (flags & OPP_ALIGN) ? "%-5s" : "%s ",
4516 output_pp_attrs(fout, pp, flags);
4519 fprintf(fout, "%s", pp->name);
4524 for (i = 0; i < pp->argc; i++) {
4526 fprintf(fout, ", ");
4527 if (pp->arg[i].fptr != NULL && !(flags & OPP_SIMPLE_ARGS)) {
4529 output_pp(fout, pp->arg[i].fptr, 0);
4531 else if (pp->arg[i].type.is_retreg) {
4532 fprintf(fout, "u32 *r_%s", pp->arg[i].reg);
4535 fprintf(fout, "%s", pp->arg[i].type.name);
4537 fprintf(fout, " a%d", i + 1);
4540 if (pp->is_vararg) {
4542 fprintf(fout, ", ");
4543 fprintf(fout, "...");
4548 static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
4554 snprintf(buf1, sizeof(buf1), "%d", grp);
4555 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
4560 static void gen_x_cleanup(int opcnt);
4562 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
4564 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
4565 struct parsed_opr *last_arith_dst = NULL;
4566 char buf1[256], buf2[256], buf3[256], cast[64];
4567 struct parsed_proto *pp, *pp_tmp;
4568 struct parsed_data *pd;
4570 int save_arg_vars[MAX_ARG_GRP] = { 0, };
4571 unsigned char cbits[MAX_OPS / 8];
4573 int need_tmp_var = 0;
4576 int label_pending = 0;
4577 int regmask_save = 0; // regs saved/restored in this func
4578 int regmask_arg; // regs from this function args (fastcall, etc)
4579 int regmask_ret; // regs needed on ret
4580 int regmask_now; // temp
4581 int regmask_init = 0; // regs that need zero initialization
4582 int regmask_pp = 0; // regs used in complex push-pop graph
4583 int regmask = 0; // used regs
4592 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
4593 g_stack_frame_used = 0;
4595 g_func_pp = proto_parse(fhdr, funcn, 0);
4596 if (g_func_pp == NULL)
4597 ferr(ops, "proto_parse failed for '%s'\n", funcn);
4599 regmask_arg = get_pp_arg_regmask_src(g_func_pp);
4600 regmask_ret = get_pp_arg_regmask_dst(g_func_pp);
4602 if (g_func_pp->has_retreg) {
4603 for (arg = 0; arg < g_func_pp->argc; arg++) {
4604 if (g_func_pp->arg[arg].type.is_retreg) {
4605 reg = char_array_i(regs_r32,
4606 ARRAY_SIZE(regs_r32), g_func_pp->arg[arg].reg);
4607 ferr_assert(ops, reg >= 0);
4608 regmask_ret |= 1 << reg;
4614 // - resolve all branches
4615 // - parse calls with labels
4616 resolve_branches_parse_calls(opcnt);
4619 // - handle ebp/esp frame, remove ops related to it
4620 scan_prologue_epilogue(opcnt);
4623 // - remove dead labels
4624 // - set regs needed at ret
4625 for (i = 0; i < opcnt; i++)
4627 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
4632 if (ops[i].op == OP_RET)
4633 ops[i].regmask_src |= regmask_ret;
4637 // - process trivial calls
4638 for (i = 0; i < opcnt; i++)
4641 if (po->flags & (OPF_RMD|OPF_DONE))
4644 if (po->op == OP_CALL)
4646 pp = process_call_early(i, opcnt, &j);
4648 if (!(po->flags & OPF_ATAIL))
4649 // since we know the args, try to collect them
4650 if (collect_call_args_early(po, i, pp, ®mask) != 0)
4656 // commit esp adjust
4657 if (ops[j].op != OP_POP)
4658 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
4660 for (l = 0; l < pp->argc_stack; l++)
4661 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
4665 if (strstr(pp->ret_type.name, "int64"))
4668 po->flags |= OPF_DONE;
4674 // - process calls, stage 2
4675 // - handle some push/pop pairs
4676 // - scan for STD/CLD, propagate DF
4677 for (i = 0; i < opcnt; i++)
4680 if (po->flags & OPF_RMD)
4683 if (po->op == OP_CALL)
4685 if (!(po->flags & OPF_DONE)) {
4686 pp = process_call(i, opcnt);
4688 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
4689 // since we know the args, collect them
4690 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4693 // for unresolved, collect after other passes
4697 ferr_assert(po, pp != NULL);
4699 po->regmask_src |= get_pp_arg_regmask_src(pp);
4700 po->regmask_dst |= get_pp_arg_regmask_dst(pp);
4702 if (strstr(pp->ret_type.name, "int64"))
4708 if (po->flags & OPF_DONE)
4711 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)
4712 && !(po->flags & OPF_RSAVE) && po->operand[0].type == OPT_CONST)
4714 scan_for_pop_const(i, opcnt, i + opcnt * 12);
4716 else if (po->op == OP_POP)
4717 scan_pushes_for_pop(i, opcnt, ®mask_pp);
4718 else if (po->op == OP_STD) {
4719 po->flags |= OPF_DF | OPF_RMD | OPF_DONE;
4720 scan_propagate_df(i + 1, opcnt);
4725 // - find POPs for PUSHes, rm both
4726 // - scan for all used registers
4727 memset(cbits, 0, sizeof(cbits));
4728 reg_use_pass(0, opcnt, cbits, 0, ®mask,
4729 0, ®mask_save, ®mask_init, regmask_arg);
4732 // - find flag set ops for their users
4733 // - do unresolved calls
4734 // - declare indirect functions
4735 for (i = 0; i < opcnt; i++)
4738 if (po->flags & (OPF_RMD|OPF_DONE))
4741 if (po->flags & OPF_CC)
4743 int setters[16], cnt = 0, branched = 0;
4745 ret = scan_for_flag_set(i, i + opcnt * 6,
4746 &branched, setters, &cnt);
4747 if (ret < 0 || cnt <= 0)
4748 ferr(po, "unable to trace flag setter(s)\n");
4749 if (cnt > ARRAY_SIZE(setters))
4750 ferr(po, "too many flag setters\n");
4752 for (j = 0; j < cnt; j++)
4754 tmp_op = &ops[setters[j]]; // flag setter
4757 // to get nicer code, we try to delay test and cmp;
4758 // if we can't because of operand modification, or if we
4759 // have arith op, or branch, make it calculate flags explicitly
4760 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
4762 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
4763 pfomask = 1 << po->pfo;
4765 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
4766 pfomask = 1 << po->pfo;
4769 // see if we'll be able to handle based on op result
4770 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
4771 && po->pfo != PFO_Z && po->pfo != PFO_S
4772 && po->pfo != PFO_P)
4774 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
4776 pfomask = 1 << po->pfo;
4779 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
4780 propagate_lmod(tmp_op, &tmp_op->operand[0],
4781 &tmp_op->operand[1]);
4782 if (tmp_op->operand[0].lmod == OPLM_DWORD)
4787 tmp_op->pfomask |= pfomask;
4788 cond_vars |= pfomask;
4790 // note: may overwrite, currently not a problem
4794 if (po->op == OP_RCL || po->op == OP_RCR
4795 || po->op == OP_ADC || po->op == OP_SBB)
4796 cond_vars |= 1 << PFO_C;
4799 if (po->op == OP_CMPS || po->op == OP_SCAS) {
4800 cond_vars |= 1 << PFO_Z;
4802 else if (po->op == OP_MUL
4803 || (po->op == OP_IMUL && po->operand_cnt == 1))
4805 if (po->operand[0].lmod == OPLM_DWORD)
4808 else if (po->op == OP_CALL) {
4809 // note: resolved non-reg calls are OPF_DONE already
4811 ferr_assert(po, pp != NULL);
4813 if (pp->is_unresolved) {
4814 int regmask_stack = 0;
4815 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4818 // this is pretty rough guess:
4819 // see ecx and edx were pushed (and not their saved versions)
4820 for (arg = 0; arg < pp->argc; arg++) {
4821 if (pp->arg[arg].reg != NULL)
4824 tmp_op = pp->arg[arg].datap;
4826 ferr(po, "parsed_op missing for arg%d\n", arg);
4827 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
4828 regmask_stack |= 1 << tmp_op->operand[0].reg;
4831 if (!((regmask_stack & (1 << xCX))
4832 && (regmask_stack & (1 << xDX))))
4834 if (pp->argc_stack != 0
4835 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
4837 pp_insert_reg_arg(pp, "ecx");
4838 pp->is_fastcall = 1;
4839 regmask_init |= 1 << xCX;
4840 regmask |= 1 << xCX;
4842 if (pp->argc_stack != 0
4843 || ((regmask | regmask_arg) & (1 << xDX)))
4845 pp_insert_reg_arg(pp, "edx");
4846 regmask_init |= 1 << xDX;
4847 regmask |= 1 << xDX;
4851 // note: __cdecl doesn't fall into is_unresolved category
4852 if (pp->argc_stack > 0)
4856 else if (po->op == OP_MOV && po->operand[0].pp != NULL
4857 && po->operand[1].pp != NULL)
4859 // <var> = offset <something>
4860 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
4861 && !IS_START(po->operand[1].name, "off_"))
4863 if (!po->operand[0].pp->is_fptr)
4864 ferr(po, "%s not declared as fptr when it should be\n",
4865 po->operand[0].name);
4866 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
4867 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
4868 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
4869 fnote(po, "var: %s\n", buf1);
4870 fnote(po, "func: %s\n", buf2);
4871 ferr(po, "^ mismatch\n");
4875 else if (po->op == OP_DIV || po->op == OP_IDIV) {
4876 if (po->operand[0].lmod == OPLM_DWORD) {
4877 // 32bit division is common, look for it
4878 if (po->op == OP_DIV)
4879 ret = scan_for_reg_clear(i, xDX);
4881 ret = scan_for_cdq_edx(i);
4883 po->flags |= OPF_32BIT;
4890 else if (po->op == OP_CLD)
4891 po->flags |= OPF_RMD | OPF_DONE;
4893 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG)
4897 // output starts here
4899 // define userstack size
4900 if (g_func_pp->is_userstack) {
4901 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
4902 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
4903 fprintf(fout, "#endif\n");
4906 // the function itself
4907 ferr_assert(ops, !g_func_pp->is_fptr);
4908 output_pp(fout, g_func_pp,
4909 (g_ida_func_attr & IDAFA_NORETURN) ? OPP_FORCE_NORETURN : 0);
4910 fprintf(fout, "\n{\n");
4912 // declare indirect functions
4913 for (i = 0; i < opcnt; i++) {
4915 if (po->flags & OPF_RMD)
4918 if (po->op == OP_CALL) {
4921 ferr(po, "NULL pp\n");
4923 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
4924 if (pp->name[0] != 0) {
4925 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
4926 memcpy(pp->name, "i_", 2);
4928 // might be declared already
4930 for (j = 0; j < i; j++) {
4931 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
4932 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
4942 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
4945 output_pp(fout, pp, OPP_SIMPLE_ARGS);
4946 fprintf(fout, ";\n");
4951 // output LUTs/jumptables
4952 for (i = 0; i < g_func_pd_cnt; i++) {
4954 fprintf(fout, " static const ");
4955 if (pd->type == OPT_OFFSET) {
4956 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
4958 for (j = 0; j < pd->count; j++) {
4960 fprintf(fout, ", ");
4961 fprintf(fout, "&&%s", pd->d[j].u.label);
4965 fprintf(fout, "%s %s[] =\n { ",
4966 lmod_type_u(ops, pd->lmod), pd->label);
4968 for (j = 0; j < pd->count; j++) {
4970 fprintf(fout, ", ");
4971 fprintf(fout, "%u", pd->d[j].u.val);
4974 fprintf(fout, " };\n");
4978 // declare stack frame, va_arg
4980 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
4981 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
4985 if (g_func_pp->is_userstack) {
4986 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
4987 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
4991 if (g_func_pp->is_vararg) {
4992 fprintf(fout, " va_list ap;\n");
4996 // declare arg-registers
4997 for (i = 0; i < g_func_pp->argc; i++) {
4998 if (g_func_pp->arg[i].reg != NULL) {
4999 reg = char_array_i(regs_r32,
5000 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
5001 if (regmask & (1 << reg)) {
5002 if (g_func_pp->arg[i].type.is_retreg)
5003 fprintf(fout, " u32 %s = *r_%s;\n",
5004 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
5006 fprintf(fout, " u32 %s = (u32)a%d;\n",
5007 g_func_pp->arg[i].reg, i + 1);
5010 if (g_func_pp->arg[i].type.is_retreg)
5011 ferr(ops, "retreg '%s' is unused?\n",
5012 g_func_pp->arg[i].reg);
5013 fprintf(fout, " // %s = a%d; // unused\n",
5014 g_func_pp->arg[i].reg, i + 1);
5020 // declare normal registers
5021 regmask_now = regmask & ~regmask_arg;
5022 regmask_now &= ~(1 << xSP);
5023 if (regmask_now & 0x00ff) {
5024 for (reg = 0; reg < 8; reg++) {
5025 if (regmask_now & (1 << reg)) {
5026 fprintf(fout, " u32 %s", regs_r32[reg]);
5027 if (regmask_init & (1 << reg))
5028 fprintf(fout, " = 0");
5029 fprintf(fout, ";\n");
5034 if (regmask_now & 0xff00) {
5035 for (reg = 8; reg < 16; reg++) {
5036 if (regmask_now & (1 << reg)) {
5037 fprintf(fout, " mmxr %s", regs_r32[reg]);
5038 if (regmask_init & (1 << reg))
5039 fprintf(fout, " = { 0, }");
5040 fprintf(fout, ";\n");
5047 for (reg = 0; reg < 8; reg++) {
5048 if (regmask_save & (1 << reg)) {
5049 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
5055 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
5056 if (save_arg_vars[i] == 0)
5058 for (reg = 0; reg < 32; reg++) {
5059 if (save_arg_vars[i] & (1 << reg)) {
5060 fprintf(fout, " u32 %s;\n",
5061 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
5067 // declare push-pop temporaries
5069 for (reg = 0; reg < 8; reg++) {
5070 if (regmask_pp & (1 << reg)) {
5071 fprintf(fout, " u32 pp_%s;\n", regs_r32[reg]);
5078 for (i = 0; i < 8; i++) {
5079 if (cond_vars & (1 << i)) {
5080 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
5087 fprintf(fout, " u32 tmp;\n");
5092 fprintf(fout, " u64 tmp64;\n");
5097 fprintf(fout, "\n");
5099 if (g_func_pp->is_vararg) {
5100 if (g_func_pp->argc_stack == 0)
5101 ferr(ops, "vararg func without stack args?\n");
5102 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
5106 for (i = 0; i < opcnt; i++)
5108 if (g_labels[i] != NULL) {
5109 fprintf(fout, "\n%s:\n", g_labels[i]);
5112 delayed_flag_op = NULL;
5113 last_arith_dst = NULL;
5117 if (po->flags & OPF_RMD)
5122 #define assert_operand_cnt(n_) \
5123 if (po->operand_cnt != n_) \
5124 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
5126 // conditional/flag using op?
5127 if (po->flags & OPF_CC)
5133 // we go through all this trouble to avoid using parsed_flag_op,
5134 // which makes generated code much nicer
5135 if (delayed_flag_op != NULL)
5137 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
5138 po->pfo, po->pfo_inv);
5141 else if (last_arith_dst != NULL
5142 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
5143 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
5146 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
5147 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
5148 last_arith_dst->lmod, buf3);
5151 else if (tmp_op != NULL) {
5152 // use preprocessed flag calc results
5153 if (!(tmp_op->pfomask & (1 << po->pfo)))
5154 ferr(po, "not prepared for pfo %d\n", po->pfo);
5156 // note: pfo_inv was not yet applied
5157 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
5158 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
5161 ferr(po, "all methods of finding comparison failed\n");
5164 if (po->flags & OPF_JMP) {
5165 fprintf(fout, " if %s", buf1);
5167 else if (po->op == OP_RCL || po->op == OP_RCR
5168 || po->op == OP_ADC || po->op == OP_SBB)
5171 fprintf(fout, " cond_%s = %s;\n",
5172 parsed_flag_op_names[po->pfo], buf1);
5174 else if (po->flags & OPF_DATA) { // SETcc
5175 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
5176 fprintf(fout, " %s = %s;", buf2, buf1);
5179 ferr(po, "unhandled conditional op\n");
5183 pfomask = po->pfomask;
5185 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
5186 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xCX);
5187 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
5189 if (ret != 1 || uval == 0) {
5190 // we need initial flags for ecx=0 case..
5191 if (i > 0 && ops[i - 1].op == OP_XOR
5192 && IS(ops[i - 1].operand[0].name,
5193 ops[i - 1].operand[1].name))
5195 fprintf(fout, " cond_z = ");
5196 if (pfomask & (1 << PFO_C))
5197 fprintf(fout, "cond_c = ");
5198 fprintf(fout, "0;\n");
5200 else if (last_arith_dst != NULL) {
5201 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
5202 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
5203 last_arith_dst->lmod, buf3);
5204 fprintf(fout, " cond_z = %s;\n", buf1);
5207 ferr(po, "missing initial ZF\n");
5214 assert_operand_cnt(2);
5215 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5216 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5217 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
5218 fprintf(fout, " %s = %s;", buf1,
5219 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5224 assert_operand_cnt(2);
5225 po->operand[1].lmod = OPLM_DWORD; // always
5226 fprintf(fout, " %s = %s;",
5227 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5228 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5233 assert_operand_cnt(2);
5234 fprintf(fout, " %s = %s;",
5235 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5236 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5240 assert_operand_cnt(2);
5241 switch (po->operand[1].lmod) {
5243 strcpy(buf3, "(s8)");
5246 strcpy(buf3, "(s16)");
5249 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
5251 fprintf(fout, " %s = %s;",
5252 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5253 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5258 assert_operand_cnt(2);
5259 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5260 fprintf(fout, " tmp = %s;",
5261 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
5262 fprintf(fout, " %s = %s;",
5263 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5264 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5265 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5266 fprintf(fout, " %s = %stmp;",
5267 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
5268 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
5269 snprintf(g_comment, sizeof(g_comment), "xchg");
5273 assert_operand_cnt(1);
5274 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5275 fprintf(fout, " %s = ~%s;", buf1, buf1);
5279 assert_operand_cnt(2);
5280 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5281 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5282 fprintf(fout, " %s = *(u8 *)(%s + %s);", buf1, buf2, buf1);
5283 strcpy(g_comment, "xlat");
5287 assert_operand_cnt(2);
5288 fprintf(fout, " %s = (s32)%s >> 31;",
5289 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5290 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5291 strcpy(g_comment, "cdq");
5295 if (po->flags & OPF_REP) {
5296 assert_operand_cnt(3);
5301 assert_operand_cnt(2);
5302 fprintf(fout, " %s = %sesi; esi %c= %d;",
5303 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
5304 lmod_cast_u_ptr(po, po->operand[1].lmod),
5305 (po->flags & OPF_DF) ? '-' : '+',
5306 lmod_bytes(po, po->operand[1].lmod));
5307 strcpy(g_comment, "lods");
5312 if (po->flags & OPF_REP) {
5313 assert_operand_cnt(3);
5314 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
5315 (po->flags & OPF_DF) ? '-' : '+',
5316 lmod_bytes(po, po->operand[1].lmod));
5317 fprintf(fout, " %sedi = eax;",
5318 lmod_cast_u_ptr(po, po->operand[1].lmod));
5319 strcpy(g_comment, "rep stos");
5322 assert_operand_cnt(2);
5323 fprintf(fout, " %sedi = eax; edi %c= %d;",
5324 lmod_cast_u_ptr(po, po->operand[1].lmod),
5325 (po->flags & OPF_DF) ? '-' : '+',
5326 lmod_bytes(po, po->operand[1].lmod));
5327 strcpy(g_comment, "stos");
5332 j = lmod_bytes(po, po->operand[0].lmod);
5333 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
5334 l = (po->flags & OPF_DF) ? '-' : '+';
5335 if (po->flags & OPF_REP) {
5336 assert_operand_cnt(3);
5338 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
5341 " %sedi = %sesi;", buf1, buf1);
5342 strcpy(g_comment, "rep movs");
5345 assert_operand_cnt(2);
5346 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
5347 buf1, buf1, l, j, l, j);
5348 strcpy(g_comment, "movs");
5353 // repe ~ repeat while ZF=1
5354 j = lmod_bytes(po, po->operand[0].lmod);
5355 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
5356 l = (po->flags & OPF_DF) ? '-' : '+';
5357 if (po->flags & OPF_REP) {
5358 assert_operand_cnt(3);
5360 " for (; ecx != 0; ecx--) {\n");
5361 if (pfomask & (1 << PFO_C)) {
5364 " cond_c = %sesi < %sedi;\n", buf1, buf1);
5365 pfomask &= ~(1 << PFO_C);
5368 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
5369 buf1, buf1, l, j, l, j);
5371 " if (cond_z %s 0) break;\n",
5372 (po->flags & OPF_REPZ) ? "==" : "!=");
5375 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
5376 (po->flags & OPF_REPZ) ? "e" : "ne");
5379 assert_operand_cnt(2);
5381 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
5382 buf1, buf1, l, j, l, j);
5383 strcpy(g_comment, "cmps");
5385 pfomask &= ~(1 << PFO_Z);
5386 last_arith_dst = NULL;
5387 delayed_flag_op = NULL;
5391 // only does ZF (for now)
5392 // repe ~ repeat while ZF=1
5393 j = lmod_bytes(po, po->operand[1].lmod);
5394 l = (po->flags & OPF_DF) ? '-' : '+';
5395 if (po->flags & OPF_REP) {
5396 assert_operand_cnt(3);
5398 " for (; ecx != 0; ecx--) {\n");
5400 " cond_z = (%seax == %sedi); edi %c= %d;\n",
5401 lmod_cast_u(po, po->operand[1].lmod),
5402 lmod_cast_u_ptr(po, po->operand[1].lmod), l, j);
5404 " if (cond_z %s 0) break;\n",
5405 (po->flags & OPF_REPZ) ? "==" : "!=");
5408 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
5409 (po->flags & OPF_REPZ) ? "e" : "ne");
5412 assert_operand_cnt(2);
5413 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
5414 lmod_cast_u(po, po->operand[1].lmod),
5415 lmod_cast_u_ptr(po, po->operand[1].lmod), l, j);
5416 strcpy(g_comment, "scas");
5418 pfomask &= ~(1 << PFO_Z);
5419 last_arith_dst = NULL;
5420 delayed_flag_op = NULL;
5423 // arithmetic w/flags
5425 if (po->operand[1].type == OPT_CONST && !po->operand[1].val)
5426 goto dualop_arith_const;
5427 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5431 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5432 if (po->operand[1].type == OPT_CONST) {
5433 j = lmod_bytes(po, po->operand[0].lmod);
5434 if (((1ull << j * 8) - 1) == po->operand[1].val)
5435 goto dualop_arith_const;
5440 assert_operand_cnt(2);
5441 fprintf(fout, " %s %s= %s;",
5442 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5444 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5445 output_std_flags(fout, po, &pfomask, buf1);
5446 last_arith_dst = &po->operand[0];
5447 delayed_flag_op = NULL;
5451 // and 0, or ~0 used instead mov
5452 assert_operand_cnt(2);
5453 fprintf(fout, " %s = %s;",
5454 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5455 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5456 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5457 output_std_flags(fout, po, &pfomask, buf1);
5458 last_arith_dst = &po->operand[0];
5459 delayed_flag_op = NULL;
5464 assert_operand_cnt(2);
5465 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5466 if (pfomask & (1 << PFO_C)) {
5467 if (po->operand[1].type == OPT_CONST) {
5468 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5469 j = po->operand[1].val;
5472 if (po->op == OP_SHL)
5476 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
5480 ferr(po, "zero shift?\n");
5484 pfomask &= ~(1 << PFO_C);
5486 fprintf(fout, " %s %s= %s", buf1, op_to_c(po),
5487 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5488 if (po->operand[1].type != OPT_CONST)
5489 fprintf(fout, " & 0x1f");
5491 output_std_flags(fout, po, &pfomask, buf1);
5492 last_arith_dst = &po->operand[0];
5493 delayed_flag_op = NULL;
5497 assert_operand_cnt(2);
5498 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5499 fprintf(fout, " %s = %s%s >> %s;", buf1,
5500 lmod_cast_s(po, po->operand[0].lmod), buf1,
5501 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5502 output_std_flags(fout, po, &pfomask, buf1);
5503 last_arith_dst = &po->operand[0];
5504 delayed_flag_op = NULL;
5509 assert_operand_cnt(3);
5510 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5511 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5512 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
5513 if (po->operand[2].type != OPT_CONST) {
5514 // no handling for "undefined" case, hopefully not needed
5515 snprintf(buf2, sizeof(buf2), "(%s & 0x1f)", buf3);
5518 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5519 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5520 if (po->op == OP_SHLD) {
5521 fprintf(fout, " %s <<= %s; %s |= %s >> (%d - %s);",
5522 buf1, buf3, buf1, buf2, l, buf3);
5523 strcpy(g_comment, "shld");
5526 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
5527 buf1, buf3, buf1, buf2, l, buf3);
5528 strcpy(g_comment, "shrd");
5530 output_std_flags(fout, po, &pfomask, buf1);
5531 last_arith_dst = &po->operand[0];
5532 delayed_flag_op = NULL;
5537 assert_operand_cnt(2);
5538 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5539 if (po->operand[1].type == OPT_CONST) {
5540 j = po->operand[1].val;
5541 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
5542 fprintf(fout, po->op == OP_ROL ?
5543 " %s = (%s << %d) | (%s >> %d);" :
5544 " %s = (%s >> %d) | (%s << %d);",
5545 buf1, buf1, j, buf1,
5546 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
5550 output_std_flags(fout, po, &pfomask, buf1);
5551 last_arith_dst = &po->operand[0];
5552 delayed_flag_op = NULL;
5557 assert_operand_cnt(2);
5558 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5559 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5560 if (po->operand[1].type == OPT_CONST) {
5561 j = po->operand[1].val % l;
5563 ferr(po, "zero rotate\n");
5564 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
5565 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
5566 if (po->op == OP_RCL) {
5568 " %s = (%s << %d) | (cond_c << %d)",
5569 buf1, buf1, j, j - 1);
5571 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
5575 " %s = (%s >> %d) | (cond_c << %d)",
5576 buf1, buf1, j, l - j);
5578 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
5580 fprintf(fout, ";\n");
5581 fprintf(fout, " cond_c = tmp;");
5585 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
5586 output_std_flags(fout, po, &pfomask, buf1);
5587 last_arith_dst = &po->operand[0];
5588 delayed_flag_op = NULL;
5592 assert_operand_cnt(2);
5593 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5594 if (IS(opr_name(po, 0), opr_name(po, 1))) {
5595 // special case for XOR
5596 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
5597 fprintf(fout, " cond_be = 1;\n");
5598 pfomask &= ~(1 << PFO_BE);
5600 fprintf(fout, " %s = 0;",
5601 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5602 last_arith_dst = &po->operand[0];
5603 delayed_flag_op = NULL;
5609 assert_operand_cnt(2);
5610 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5611 if (pfomask & (1 << PFO_C)) {
5612 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5613 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5614 if (po->operand[0].lmod == OPLM_DWORD) {
5615 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
5616 fprintf(fout, " cond_c = tmp64 >> 32;\n");
5617 fprintf(fout, " %s = (u32)tmp64;",
5618 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5619 strcat(g_comment, "add64");
5622 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
5623 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
5624 fprintf(fout, " %s += %s;",
5625 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5628 pfomask &= ~(1 << PFO_C);
5629 output_std_flags(fout, po, &pfomask, buf1);
5630 last_arith_dst = &po->operand[0];
5631 delayed_flag_op = NULL;
5637 assert_operand_cnt(2);
5638 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5639 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
5640 for (j = 0; j <= PFO_LE; j++) {
5641 if (!(pfomask & (1 << j)))
5643 if (j == PFO_Z || j == PFO_S)
5646 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5647 fprintf(fout, " cond_%s = %s;\n",
5648 parsed_flag_op_names[j], buf1);
5649 pfomask &= ~(1 << j);
5656 assert_operand_cnt(2);
5657 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5658 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5659 if (po->op == OP_SBB
5660 && IS(po->operand[0].name, po->operand[1].name))
5662 // avoid use of unitialized var
5663 fprintf(fout, " %s = -cond_c;", buf1);
5664 // carry remains what it was
5665 pfomask &= ~(1 << PFO_C);
5668 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
5669 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5671 output_std_flags(fout, po, &pfomask, buf1);
5672 last_arith_dst = &po->operand[0];
5673 delayed_flag_op = NULL;
5677 assert_operand_cnt(2);
5678 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5679 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
5680 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5682 output_std_flags(fout, po, &pfomask, buf1);
5683 last_arith_dst = &po->operand[0];
5684 delayed_flag_op = NULL;
5685 strcat(g_comment, "bsf");
5689 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
5690 for (j = 0; j <= PFO_LE; j++) {
5691 if (!(pfomask & (1 << j)))
5693 if (j == PFO_Z || j == PFO_S || j == PFO_C)
5696 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5697 fprintf(fout, " cond_%s = %s;\n",
5698 parsed_flag_op_names[j], buf1);
5699 pfomask &= ~(1 << j);
5705 if (pfomask & (1 << PFO_C))
5706 // carry is unaffected by inc/dec.. wtf?
5707 ferr(po, "carry propagation needed\n");
5709 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5710 if (po->operand[0].type == OPT_REG) {
5711 strcpy(buf2, po->op == OP_INC ? "++" : "--");
5712 fprintf(fout, " %s%s;", buf1, buf2);
5715 strcpy(buf2, po->op == OP_INC ? "+" : "-");
5716 fprintf(fout, " %s %s= 1;", buf1, buf2);
5718 output_std_flags(fout, po, &pfomask, buf1);
5719 last_arith_dst = &po->operand[0];
5720 delayed_flag_op = NULL;
5724 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5725 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
5726 fprintf(fout, " %s = -%s%s;", buf1,
5727 lmod_cast_s(po, po->operand[0].lmod), buf2);
5728 last_arith_dst = &po->operand[0];
5729 delayed_flag_op = NULL;
5730 if (pfomask & (1 << PFO_C)) {
5731 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
5732 pfomask &= ~(1 << PFO_C);
5737 if (po->operand_cnt == 2) {
5738 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5741 if (po->operand_cnt == 3)
5742 ferr(po, "TODO imul3\n");
5745 assert_operand_cnt(1);
5746 switch (po->operand[0].lmod) {
5748 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
5749 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
5750 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
5751 fprintf(fout, " edx = tmp64 >> 32;\n");
5752 fprintf(fout, " eax = tmp64;");
5755 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
5756 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
5757 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
5761 ferr(po, "TODO: unhandled mul type\n");
5764 last_arith_dst = NULL;
5765 delayed_flag_op = NULL;
5770 assert_operand_cnt(1);
5771 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5772 strcpy(cast, lmod_cast(po, po->operand[0].lmod,
5773 po->op == OP_IDIV));
5774 switch (po->operand[0].lmod) {
5776 if (po->flags & OPF_32BIT)
5777 snprintf(buf2, sizeof(buf2), "%seax", cast);
5779 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
5780 snprintf(buf2, sizeof(buf2), "%stmp64",
5781 (po->op == OP_IDIV) ? "(s64)" : "");
5783 if (po->operand[0].type == OPT_REG
5784 && po->operand[0].reg == xDX)
5786 fprintf(fout, " eax = %s / %s%s;\n", buf2, cast, buf1);
5787 fprintf(fout, " edx = %s %% %s%s;", buf2, cast, buf1);
5790 fprintf(fout, " edx = %s %% %s%s;\n", buf2, cast, buf1);
5791 fprintf(fout, " eax = %s / %s%s;", buf2, cast, buf1);
5795 fprintf(fout, " tmp = (edx << 16) | (eax & 0xffff);\n");
5796 snprintf(buf2, sizeof(buf2), "%stmp",
5797 (po->op == OP_IDIV) ? "(s32)" : "");
5798 if (po->operand[0].type == OPT_REG
5799 && po->operand[0].reg == xDX)
5801 fprintf(fout, " LOWORD(eax) = %s / %s%s;\n",
5803 fprintf(fout, " LOWORD(edx) = %s %% %s%s;",
5807 fprintf(fout, " LOWORD(edx) = %s %% %s%s;\n",
5809 fprintf(fout, " LOWORD(eax) = %s / %s%s;",
5812 strcat(g_comment, "div16");
5815 ferr(po, "unhandled div lmod %d\n", po->operand[0].lmod);
5817 last_arith_dst = NULL;
5818 delayed_flag_op = NULL;
5823 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5825 for (j = 0; j < 8; j++) {
5826 if (pfomask & (1 << j)) {
5827 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
5828 fprintf(fout, " cond_%s = %s;",
5829 parsed_flag_op_names[j], buf1);
5836 last_arith_dst = NULL;
5837 delayed_flag_op = po;
5841 // SETcc - should already be handled
5844 // note: we reuse OP_Jcc for SETcc, only flags differ
5846 fprintf(fout, "\n goto %s;", po->operand[0].name);
5850 fprintf(fout, " if (ecx == 0)\n");
5851 fprintf(fout, " goto %s;", po->operand[0].name);
5852 strcat(g_comment, "jecxz");
5856 fprintf(fout, " if (--ecx != 0)\n");
5857 fprintf(fout, " goto %s;", po->operand[0].name);
5858 strcat(g_comment, "loop");
5862 assert_operand_cnt(1);
5863 last_arith_dst = NULL;
5864 delayed_flag_op = NULL;
5866 if (po->operand[0].type == OPT_REGMEM) {
5867 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
5870 ferr(po, "parse failure for jmp '%s'\n",
5871 po->operand[0].name);
5872 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
5875 else if (po->operand[0].type != OPT_LABEL)
5876 ferr(po, "unhandled jmp type\n");
5878 fprintf(fout, " goto %s;", po->operand[0].name);
5882 assert_operand_cnt(1);
5884 my_assert_not(pp, NULL);
5887 if (po->flags & OPF_CC) {
5888 // we treat conditional branch to another func
5889 // (yes such code exists..) as conditional tailcall
5891 fprintf(fout, " {\n");
5894 if (pp->is_fptr && !pp->is_arg) {
5895 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
5896 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
5898 if (pp->is_unresolved)
5899 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
5900 buf3, asmfn, po->asmln, pp->name);
5903 fprintf(fout, "%s", buf3);
5904 if (strstr(pp->ret_type.name, "int64")) {
5905 if (po->flags & OPF_TAIL)
5906 ferr(po, "int64 and tail?\n");
5907 fprintf(fout, "tmp64 = ");
5909 else if (!IS(pp->ret_type.name, "void")) {
5910 if (po->flags & OPF_TAIL) {
5911 if (regmask_ret & (1 << xAX)) {
5912 fprintf(fout, "return ");
5913 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
5914 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
5917 else if (po->regmask_dst & (1 << xAX)) {
5918 fprintf(fout, "eax = ");
5919 if (pp->ret_type.is_ptr)
5920 fprintf(fout, "(u32)");
5924 if (pp->name[0] == 0)
5925 ferr(po, "missing pp->name\n");
5926 fprintf(fout, "%s%s(", pp->name,
5927 pp->has_structarg ? "_sa" : "");
5929 if (po->flags & OPF_ATAIL) {
5930 if (pp->argc_stack != g_func_pp->argc_stack
5931 || (pp->argc_stack > 0
5932 && pp->is_stdcall != g_func_pp->is_stdcall))
5933 ferr(po, "incompatible tailcall\n");
5934 if (g_func_pp->has_retreg)
5935 ferr(po, "TODO: retreg+tailcall\n");
5937 for (arg = j = 0; arg < pp->argc; arg++) {
5939 fprintf(fout, ", ");
5942 if (pp->arg[arg].type.is_ptr)
5943 snprintf(cast, sizeof(cast), "(%s)",
5944 pp->arg[arg].type.name);
5946 if (pp->arg[arg].reg != NULL) {
5947 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5951 for (; j < g_func_pp->argc; j++)
5952 if (g_func_pp->arg[j].reg == NULL)
5954 fprintf(fout, "%sa%d", cast, j + 1);
5959 for (arg = 0; arg < pp->argc; arg++) {
5961 fprintf(fout, ", ");
5964 if (pp->arg[arg].type.is_ptr)
5965 snprintf(cast, sizeof(cast), "(%s)",
5966 pp->arg[arg].type.name);
5968 if (pp->arg[arg].reg != NULL) {
5969 if (pp->arg[arg].type.is_retreg)
5970 fprintf(fout, "&%s", pp->arg[arg].reg);
5972 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5977 tmp_op = pp->arg[arg].datap;
5979 ferr(po, "parsed_op missing for arg%d\n", arg);
5981 if (tmp_op->flags & OPF_VAPUSH) {
5982 fprintf(fout, "ap");
5984 else if (tmp_op->p_argpass != 0) {
5985 fprintf(fout, "a%d", tmp_op->p_argpass);
5987 else if (tmp_op->p_argnum != 0) {
5988 fprintf(fout, "%s%s", cast,
5989 saved_arg_name(buf1, sizeof(buf1),
5990 tmp_op->p_arggrp, tmp_op->p_argnum));
5994 out_src_opr(buf1, sizeof(buf1),
5995 tmp_op, &tmp_op->operand[0], cast, 0));
5999 fprintf(fout, ");");
6001 if (strstr(pp->ret_type.name, "int64")) {
6002 fprintf(fout, "\n");
6003 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
6004 fprintf(fout, "%seax = tmp64;", buf3);
6007 if (pp->is_unresolved) {
6008 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
6010 strcat(g_comment, buf2);
6013 if (po->flags & OPF_TAIL) {
6015 if (i == opcnt - 1 || pp->is_noreturn)
6017 else if (IS(pp->ret_type.name, "void"))
6019 else if (!(regmask_ret & (1 << xAX)))
6021 // else already handled as 'return f()'
6024 fprintf(fout, "\n%sreturn;", buf3);
6025 strcat(g_comment, " ^ tailcall");
6028 strcat(g_comment, " tailcall");
6030 if ((regmask_ret & (1 << xAX))
6031 && IS(pp->ret_type.name, "void") && !pp->is_noreturn)
6033 ferr(po, "int func -> void func tailcall?\n");
6036 if (pp->is_noreturn)
6037 strcat(g_comment, " noreturn");
6038 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
6039 strcat(g_comment, " argframe");
6040 if (po->flags & OPF_CC)
6041 strcat(g_comment, " cond");
6043 if (po->flags & OPF_CC)
6044 fprintf(fout, "\n }");
6046 delayed_flag_op = NULL;
6047 last_arith_dst = NULL;
6051 if (g_func_pp->is_vararg)
6052 fprintf(fout, " va_end(ap);\n");
6053 if (g_func_pp->has_retreg) {
6054 for (arg = 0; arg < g_func_pp->argc; arg++)
6055 if (g_func_pp->arg[arg].type.is_retreg)
6056 fprintf(fout, " *r_%s = %s;\n",
6057 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
6060 if (!(regmask_ret & (1 << xAX))) {
6061 if (i != opcnt - 1 || label_pending)
6062 fprintf(fout, " return;");
6064 else if (g_func_pp->ret_type.is_ptr) {
6065 fprintf(fout, " return (%s)eax;",
6066 g_func_pp->ret_type.name);
6068 else if (IS(g_func_pp->ret_type.name, "__int64"))
6069 fprintf(fout, " return ((u64)edx << 32) | eax;");
6071 fprintf(fout, " return eax;");
6073 last_arith_dst = NULL;
6074 delayed_flag_op = NULL;
6078 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
6079 if (po->p_argnum != 0) {
6080 // special case - saved func arg
6081 fprintf(fout, " %s = %s;",
6082 saved_arg_name(buf2, sizeof(buf2),
6083 po->p_arggrp, po->p_argnum), buf1);
6086 else if (po->flags & OPF_RSAVE) {
6087 fprintf(fout, " s_%s = %s;", buf1, buf1);
6090 else if (po->flags & OPF_PPUSH) {
6092 ferr_assert(po, tmp_op != NULL);
6093 out_dst_opr(buf2, sizeof(buf2), po, &tmp_op->operand[0]);
6094 fprintf(fout, " pp_%s = %s;", buf2, buf1);
6097 else if (g_func_pp->is_userstack) {
6098 fprintf(fout, " *(--esp) = %s;", buf1);
6101 if (!(g_ida_func_attr & IDAFA_NORETURN))
6102 ferr(po, "stray push encountered\n");
6107 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6108 if (po->flags & OPF_RSAVE) {
6109 fprintf(fout, " %s = s_%s;", buf1, buf1);
6112 else if (po->flags & OPF_PPUSH) {
6113 // push/pop graph / non-const
6114 ferr_assert(po, po->datap == NULL);
6115 fprintf(fout, " %s = pp_%s;", buf1, buf1);
6118 else if (po->datap != NULL) {
6121 fprintf(fout, " %s = %s;", buf1,
6122 out_src_opr(buf2, sizeof(buf2),
6123 tmp_op, &tmp_op->operand[0],
6124 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
6127 else if (g_func_pp->is_userstack) {
6128 fprintf(fout, " %s = *esp++;", buf1);
6132 ferr(po, "stray pop encountered\n");
6141 strcpy(g_comment, "(emms)");
6146 ferr(po, "unhandled op type %d, flags %x\n",
6151 if (g_comment[0] != 0) {
6152 char *p = g_comment;
6153 while (my_isblank(*p))
6155 fprintf(fout, " // %s", p);
6160 fprintf(fout, "\n");
6162 // some sanity checking
6163 if (po->flags & OPF_REP) {
6164 if (po->op != OP_STOS && po->op != OP_MOVS
6165 && po->op != OP_CMPS && po->op != OP_SCAS)
6166 ferr(po, "unexpected rep\n");
6167 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
6168 && (po->op == OP_CMPS || po->op == OP_SCAS))
6169 ferr(po, "cmps/scas with plain rep\n");
6171 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
6172 && po->op != OP_CMPS && po->op != OP_SCAS)
6173 ferr(po, "unexpected repz/repnz\n");
6176 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
6178 // see is delayed flag stuff is still valid
6179 if (delayed_flag_op != NULL && delayed_flag_op != po) {
6180 if (is_any_opr_modified(delayed_flag_op, po, 0))
6181 delayed_flag_op = NULL;
6184 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
6185 if (is_opr_modified(last_arith_dst, po))
6186 last_arith_dst = NULL;
6192 if (g_stack_fsz && !g_stack_frame_used)
6193 fprintf(fout, " (void)sf;\n");
6195 fprintf(fout, "}\n\n");
6197 gen_x_cleanup(opcnt);
6200 static void gen_x_cleanup(int opcnt)
6204 for (i = 0; i < opcnt; i++) {
6205 struct label_ref *lr, *lr_del;
6207 lr = g_label_refs[i].next;
6208 while (lr != NULL) {
6213 g_label_refs[i].i = -1;
6214 g_label_refs[i].next = NULL;
6216 if (ops[i].op == OP_CALL) {
6218 proto_release(ops[i].pp);
6224 struct func_proto_dep;
6226 struct func_prototype {
6231 int has_ret:3; // -1, 0, 1: unresolved, no, yes
6232 unsigned int dep_resolved:1;
6233 unsigned int is_stdcall:1;
6234 struct func_proto_dep *dep_func;
6236 const struct parsed_proto *pp; // seed pp, if any
6239 struct func_proto_dep {
6241 struct func_prototype *proto;
6242 int regmask_live; // .. at the time of call
6243 unsigned int ret_dep:1; // return from this is caller's return
6246 static struct func_prototype *hg_fp;
6247 static int hg_fp_cnt;
6249 static struct scanned_var {
6251 enum opr_lenmod lmod;
6252 unsigned int is_seeded:1;
6253 unsigned int is_c_str:1;
6254 const struct parsed_proto *pp; // seed pp, if any
6256 static int hg_var_cnt;
6258 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
6261 struct func_prototype *hg_fp_add(const char *funcn)
6263 struct func_prototype *fp;
6265 if ((hg_fp_cnt & 0xff) == 0) {
6266 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
6267 my_assert_not(hg_fp, NULL);
6268 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
6271 fp = &hg_fp[hg_fp_cnt];
6272 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
6274 fp->argc_stack = -1;
6280 static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
6285 for (i = 0; i < fp->dep_func_cnt; i++)
6286 if (IS(fp->dep_func[i].name, name))
6287 return &fp->dep_func[i];
6292 static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
6295 if (hg_fp_find_dep(fp, name))
6298 if ((fp->dep_func_cnt & 0xff) == 0) {
6299 fp->dep_func = realloc(fp->dep_func,
6300 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
6301 my_assert_not(fp->dep_func, NULL);
6302 memset(&fp->dep_func[fp->dep_func_cnt], 0,
6303 sizeof(fp->dep_func[0]) * 0x100);
6305 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
6309 static int hg_fp_cmp_name(const void *p1_, const void *p2_)
6311 const struct func_prototype *p1 = p1_, *p2 = p2_;
6312 return strcmp(p1->name, p2->name);
6316 static int hg_fp_cmp_id(const void *p1_, const void *p2_)
6318 const struct func_prototype *p1 = p1_, *p2 = p2_;
6319 return p1->id - p2->id;
6323 // recursive register dep pass
6324 // - track saved regs (part 2)
6325 // - try to figure out arg-regs
6326 // - calculate reg deps
6327 static void gen_hdr_dep_pass(int i, int opcnt, unsigned char *cbits,
6328 struct func_prototype *fp, int regmask_save, int regmask_dst,
6329 int *regmask_dep, int *has_ret)
6331 struct func_proto_dep *dep;
6332 struct parsed_op *po;
6333 int from_caller = 0;
6338 for (; i < opcnt; i++)
6340 if (cbits[i >> 3] & (1 << (i & 7)))
6342 cbits[i >> 3] |= (1 << (i & 7));
6346 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
6347 if (po->flags & OPF_RMD)
6350 if (po->btj != NULL) {
6352 for (j = 0; j < po->btj->count; j++) {
6353 check_i(po, po->btj->d[j].bt_i);
6354 gen_hdr_dep_pass(po->btj->d[j].bt_i, opcnt, cbits, fp,
6355 regmask_save, regmask_dst, regmask_dep, has_ret);
6360 check_i(po, po->bt_i);
6361 if (po->flags & OPF_CJMP) {
6362 gen_hdr_dep_pass(po->bt_i, opcnt, cbits, fp,
6363 regmask_save, regmask_dst, regmask_dep, has_ret);
6371 if (po->flags & OPF_FARG)
6372 /* (just calculate register deps) */;
6373 else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
6375 reg = po->operand[0].reg;
6376 ferr_assert(po, reg >= 0);
6378 if (po->flags & OPF_RSAVE) {
6379 regmask_save |= 1 << reg;
6382 if (po->flags & OPF_DONE)
6385 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 2, reg, 0, 0);
6387 regmask_save |= 1 << reg;
6388 po->flags |= OPF_RMD;
6389 scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, OPF_RMD);
6393 else if (po->flags & OPF_RMD)
6395 else if (po->op == OP_CALL) {
6396 po->regmask_dst |= 1 << xAX;
6398 dep = hg_fp_find_dep(fp, po->operand[0].name);
6400 dep->regmask_live = regmask_save | regmask_dst;
6402 else if (po->op == OP_RET) {
6403 if (po->operand_cnt > 0) {
6405 if (fp->argc_stack >= 0
6406 && fp->argc_stack != po->operand[0].val / 4)
6407 ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4);
6408 fp->argc_stack = po->operand[0].val / 4;
6412 // if has_ret is 0, there is uninitialized eax path,
6413 // which means it's most likely void func
6414 if (*has_ret != 0 && (po->flags & OPF_TAIL)) {
6415 if (po->op == OP_CALL) {
6420 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
6423 ret = resolve_origin(i, &opr, i + opcnt * 4, &j, &from_caller);
6426 if (ret != 1 && from_caller) {
6427 // unresolved eax - probably void func
6431 if (j >= 0 && ops[j].op == OP_CALL) {
6432 dep = hg_fp_find_dep(fp, ops[j].operand[0].name);
6443 l = regmask_save | regmask_dst;
6444 if (g_bp_frame && !(po->flags & OPF_EBP_S))
6447 l = po->regmask_src & ~l;
6450 fnote(po, "dep |= %04x, dst %04x, save %04x (f %x)\n",
6451 l, regmask_dst, regmask_save, po->flags);
6454 regmask_dst |= po->regmask_dst;
6456 if (po->flags & OPF_TAIL)
6461 static void gen_hdr(const char *funcn, int opcnt)
6463 int save_arg_vars[MAX_ARG_GRP] = { 0, };
6464 unsigned char cbits[MAX_OPS / 8];
6465 const struct parsed_proto *pp_c;
6466 struct parsed_proto *pp;
6467 struct func_prototype *fp;
6468 struct parsed_op *po;
6469 int regmask_dummy = 0;
6471 int max_bp_offset = 0;
6476 pp_c = proto_parse(g_fhdr, funcn, 1);
6478 // already in seed, will add to hg_fp later
6481 fp = hg_fp_add(funcn);
6483 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
6484 g_stack_frame_used = 0;
6487 // - resolve all branches
6488 // - parse calls with labels
6489 resolve_branches_parse_calls(opcnt);
6492 // - handle ebp/esp frame, remove ops related to it
6493 scan_prologue_epilogue(opcnt);
6496 // - remove dead labels
6498 for (i = 0; i < opcnt; i++)
6500 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6506 if (po->flags & (OPF_RMD|OPF_DONE))
6509 if (po->op == OP_CALL) {
6510 if (po->operand[0].type == OPT_LABEL)
6511 hg_fp_add_dep(fp, opr_name(po, 0));
6512 else if (po->pp != NULL)
6513 hg_fp_add_dep(fp, po->pp->name);
6518 // - remove dead labels
6519 // - handle push <const>/pop pairs
6520 for (i = 0; i < opcnt; i++)
6522 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6528 if (po->flags & (OPF_RMD|OPF_DONE))
6531 if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST)
6532 scan_for_pop_const(i, opcnt, i + opcnt * 13);
6536 // - process trivial calls
6537 for (i = 0; i < opcnt; i++)
6540 if (po->flags & (OPF_RMD|OPF_DONE))
6543 if (po->op == OP_CALL)
6545 pp = process_call_early(i, opcnt, &j);
6547 if (!(po->flags & OPF_ATAIL))
6548 // since we know the args, try to collect them
6549 if (collect_call_args_early(po, i, pp, ®mask_dummy) != 0)
6555 // commit esp adjust
6556 if (ops[j].op != OP_POP)
6557 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
6559 for (l = 0; l < pp->argc_stack; l++)
6560 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
6564 po->flags |= OPF_DONE;
6570 // - track saved regs (simple)
6572 for (i = 0; i < opcnt; i++)
6575 if (po->flags & (OPF_RMD|OPF_DONE))
6578 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG
6579 && po->operand[0].reg != xCX)
6581 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
6583 // regmask_save |= 1 << po->operand[0].reg; // do it later
6584 po->flags |= OPF_RSAVE | OPF_RMD | OPF_DONE;
6585 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, OPF_RMD);
6588 else if (po->op == OP_CALL)
6590 pp = process_call(i, opcnt);
6592 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
6593 // since we know the args, collect them
6594 ret = collect_call_args(po, i, pp, ®mask_dummy, save_arg_vars,
6601 memset(cbits, 0, sizeof(cbits));
6605 gen_hdr_dep_pass(0, opcnt, cbits, fp, 0, 0, ®mask_dep, &has_ret);
6607 // find unreachable code - must be fixed in IDA
6608 for (i = 0; i < opcnt; i++)
6610 if (cbits[i >> 3] & (1 << (i & 7)))
6613 if (g_labels[i] == NULL && i > 0 && ops[i - 1].op == OP_CALL
6614 && ops[i - 1].pp != NULL && ops[i - 1].pp->is_osinc)
6616 // the compiler sometimes still generates code after
6617 // noreturn OS functions
6620 if (ops[i].op != OP_NOP)
6621 ferr(&ops[i], "unreachable code\n");
6624 for (i = 0; i < g_eqcnt; i++) {
6625 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
6626 max_bp_offset = g_eqs[i].offset;
6629 if (fp->argc_stack < 0) {
6630 max_bp_offset = (max_bp_offset + 3) & ~3;
6631 fp->argc_stack = max_bp_offset / 4;
6632 if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0)
6636 fp->regmask_dep = regmask_dep & ~(1 << xSP);
6637 fp->has_ret = has_ret;
6639 printf("// has_ret %d, regmask_dep %x\n",
6640 fp->has_ret, fp->regmask_dep);
6641 output_hdr_fp(stdout, fp, 1);
6642 if (IS(funcn, "sub_10007F72")) exit(1);
6645 gen_x_cleanup(opcnt);
6648 static void hg_fp_resolve_deps(struct func_prototype *fp)
6650 struct func_prototype fp_s;
6654 // this thing is recursive, so mark first..
6655 fp->dep_resolved = 1;
6657 for (i = 0; i < fp->dep_func_cnt; i++) {
6658 strcpy(fp_s.name, fp->dep_func[i].name);
6659 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
6660 sizeof(hg_fp[0]), hg_fp_cmp_name);
6661 if (fp->dep_func[i].proto != NULL) {
6662 if (!fp->dep_func[i].proto->dep_resolved)
6663 hg_fp_resolve_deps(fp->dep_func[i].proto);
6665 dep = ~fp->dep_func[i].regmask_live
6666 & fp->dep_func[i].proto->regmask_dep;
6667 fp->regmask_dep |= dep;
6668 // printf("dep %s %s |= %x\n", fp->name,
6669 // fp->dep_func[i].name, dep);
6671 if (fp->has_ret == -1 && fp->dep_func[i].ret_dep)
6672 fp->has_ret = fp->dep_func[i].proto->has_ret;
6677 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
6680 const struct parsed_proto *pp;
6681 char *p, namebuf[NAMELEN];
6687 for (; count > 0; count--, fp++) {
6688 if (fp->has_ret == -1)
6689 fprintf(fout, "// ret unresolved\n");
6691 fprintf(fout, "// dep:");
6692 for (j = 0; j < fp->dep_func_cnt; j++) {
6693 fprintf(fout, " %s/", fp->dep_func[j].name);
6694 if (fp->dep_func[j].proto != NULL)
6695 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
6696 fp->dep_func[j].proto->has_ret);
6698 fprintf(fout, "\n");
6701 p = strchr(fp->name, '@');
6703 memcpy(namebuf, fp->name, p - fp->name);
6704 namebuf[p - fp->name] = 0;
6712 pp = proto_parse(g_fhdr, name, 1);
6713 if (pp != NULL && pp->is_include)
6716 if (fp->pp != NULL) {
6717 // part of seed, output later
6721 regmask_dep = fp->regmask_dep;
6722 argc_stack = fp->argc_stack;
6724 fprintf(fout, "%-5s", fp->pp ? fp->pp->ret_type.name :
6725 (fp->has_ret ? "int" : "void"));
6726 if (regmask_dep && (fp->is_stdcall || argc_stack == 0)
6727 && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0)
6729 fprintf(fout, " __fastcall ");
6730 if (!(regmask_dep & (1 << xDX)) && argc_stack == 0)
6736 else if (regmask_dep && !fp->is_stdcall) {
6737 fprintf(fout, "/*__usercall*/ ");
6739 else if (regmask_dep) {
6740 fprintf(fout, "/*__userpurge*/ ");
6742 else if (fp->is_stdcall)
6743 fprintf(fout, " __stdcall ");
6745 fprintf(fout, " __cdecl ");
6747 fprintf(fout, "%s(", name);
6750 for (j = 0; j < xSP; j++) {
6751 if (regmask_dep & (1 << j)) {
6754 fprintf(fout, ", ");
6756 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6758 fprintf(fout, "int");
6759 fprintf(fout, " a%d/*<%s>*/", arg, regs_r32[j]);
6763 for (j = 0; j < argc_stack; j++) {
6766 fprintf(fout, ", ");
6767 if (fp->pp != NULL) {
6768 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6769 if (!fp->pp->arg[arg - 1].type.is_ptr)
6773 fprintf(fout, "int ");
6774 fprintf(fout, "a%d", arg);
6777 fprintf(fout, ");\n");
6781 static void output_hdr(FILE *fout)
6783 static const char *lmod_c_names[] = {
6784 [OPLM_UNSPEC] = "???",
6785 [OPLM_BYTE] = "uint8_t",
6786 [OPLM_WORD] = "uint16_t",
6787 [OPLM_DWORD] = "uint32_t",
6788 [OPLM_QWORD] = "uint64_t",
6790 const struct scanned_var *var;
6791 struct func_prototype *fp;
6792 char line[256] = { 0, };
6796 // add stuff from headers
6797 for (i = 0; i < pp_cache_size; i++) {
6798 if (pp_cache[i].is_cinc && !pp_cache[i].is_stdcall)
6799 snprintf(name, sizeof(name), "_%s", pp_cache[i].name);
6801 snprintf(name, sizeof(name), "%s", pp_cache[i].name);
6802 fp = hg_fp_add(name);
6803 fp->pp = &pp_cache[i];
6804 fp->argc_stack = fp->pp->argc_stack;
6805 fp->is_stdcall = fp->pp->is_stdcall;
6806 fp->regmask_dep = get_pp_arg_regmask_src(fp->pp);
6807 fp->has_ret = !IS(fp->pp->ret_type.name, "void");
6811 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
6812 for (i = 0; i < hg_fp_cnt; i++)
6813 hg_fp_resolve_deps(&hg_fp[i]);
6815 // note: messes up .proto ptr, don't use
6816 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
6819 for (i = 0; i < hg_var_cnt; i++) {
6822 if (var->pp != NULL)
6825 else if (var->is_c_str)
6826 fprintf(fout, "extern %-8s %s[];", "char", var->name);
6828 fprintf(fout, "extern %-8s %s;",
6829 lmod_c_names[var->lmod], var->name);
6832 fprintf(fout, " // seeded");
6833 fprintf(fout, "\n");
6836 fprintf(fout, "\n");
6838 // output function prototypes
6839 output_hdr_fp(fout, hg_fp, hg_fp_cnt);
6842 fprintf(fout, "\n// - seed -\n");
6845 while (fgets(line, sizeof(line), g_fhdr))
6846 fwrite(line, 1, strlen(line), fout);
6849 // '=' needs special treatment
6851 static char *next_word_s(char *w, size_t wsize, char *s)
6860 for (i = 1; i < wsize - 1; i++) {
6862 printf("warning: missing closing quote: \"%s\"\n", s);
6871 for (; i < wsize - 1; i++) {
6872 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
6878 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
6879 printf("warning: '%s' truncated\n", w);
6884 static void scan_variables(FILE *fasm)
6886 struct scanned_var *var;
6887 char line[256] = { 0, };
6895 // skip to next data section
6896 while (my_fgets(line, sizeof(line), fasm))
6901 if (*p == 0 || *p == ';')
6904 p = sskip(next_word_s(words[0], sizeof(words[0]), p));
6905 if (*p == 0 || *p == ';')
6908 if (*p != 's' || !IS_START(p, "segment para public"))
6914 if (p == NULL || !IS_START(p, "segment para public"))
6918 if (!IS_START(p, "'DATA'"))
6922 while (my_fgets(line, sizeof(line), fasm))
6931 if (*p == 0 || *p == ';')
6934 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6935 words[wordc][0] = 0;
6936 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6937 if (*p == 0 || *p == ';') {
6943 if (wordc == 2 && IS(words[1], "ends"))
6948 if (IS_START(words[0], "__IMPORT_DESCRIPTOR_")) {
6949 // when this starts, we don't need anything from this section
6953 if ((hg_var_cnt & 0xff) == 0) {
6954 hg_vars = realloc(hg_vars, sizeof(hg_vars[0])
6955 * (hg_var_cnt + 0x100));
6956 my_assert_not(hg_vars, NULL);
6957 memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100);
6960 var = &hg_vars[hg_var_cnt++];
6961 snprintf(var->name, sizeof(var->name), "%s", words[0]);
6963 // maybe already in seed header?
6964 var->pp = proto_parse(g_fhdr, var->name, 1);
6965 if (var->pp != NULL) {
6966 if (var->pp->is_fptr) {
6967 var->lmod = OPLM_DWORD;
6970 else if (var->pp->is_func)
6972 else if (!guess_lmod_from_c_type(&var->lmod, &var->pp->type))
6973 aerr("unhandled C type '%s' for '%s'\n",
6974 var->pp->type.name, var->name);
6980 if (IS(words[1], "dd"))
6981 var->lmod = OPLM_DWORD;
6982 else if (IS(words[1], "dw"))
6983 var->lmod = OPLM_WORD;
6984 else if (IS(words[1], "db")) {
6985 var->lmod = OPLM_BYTE;
6986 if (wordc >= 3 && (l = strlen(words[2])) > 4) {
6987 if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0"))
6991 else if (IS(words[1], "dq"))
6992 var->lmod = OPLM_QWORD;
6993 //else if (IS(words[1], "dt"))
6995 aerr("type '%s' not known\n", words[1]);
7003 static void set_label(int i, const char *name)
7009 p = strchr(name, ':');
7013 if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_"))
7014 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
7015 g_labels[i] = realloc(g_labels[i], len + 1);
7016 my_assert_not(g_labels[i], NULL);
7017 memcpy(g_labels[i], name, len);
7018 g_labels[i][len] = 0;
7027 static struct chunk_item *func_chunks;
7028 static int func_chunk_cnt;
7029 static int func_chunk_alloc;
7031 static void add_func_chunk(FILE *fasm, const char *name, int line)
7033 if (func_chunk_cnt >= func_chunk_alloc) {
7034 func_chunk_alloc *= 2;
7035 func_chunks = realloc(func_chunks,
7036 func_chunk_alloc * sizeof(func_chunks[0]));
7037 my_assert_not(func_chunks, NULL);
7039 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
7040 func_chunks[func_chunk_cnt].name = strdup(name);
7041 func_chunks[func_chunk_cnt].asmln = line;
7045 static int cmp_chunks(const void *p1, const void *p2)
7047 const struct chunk_item *c1 = p1, *c2 = p2;
7048 return strcmp(c1->name, c2->name);
7051 static int cmpstringp(const void *p1, const void *p2)
7053 return strcmp(*(char * const *)p1, *(char * const *)p2);
7056 static void scan_ahead(FILE *fasm)
7066 oldpos = ftell(fasm);
7069 while (my_fgets(line, sizeof(line), fasm))
7080 // get rid of random tabs
7081 for (i = 0; line[i] != 0; i++)
7082 if (line[i] == '\t')
7085 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
7088 next_word(words[0], sizeof(words[0]), p);
7089 if (words[0][0] == 0)
7090 aerr("missing name for func chunk?\n");
7092 add_func_chunk(fasm, words[0], asmln);
7094 else if (IS_START(p, "; sctend"))
7100 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
7101 words[wordc][0] = 0;
7102 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
7103 if (*p == 0 || *p == ';') {
7109 if (wordc == 2 && IS(words[1], "ends"))
7113 fseek(fasm, oldpos, SEEK_SET);
7117 int main(int argc, char *argv[])
7119 FILE *fout, *fasm, *frlist;
7120 struct parsed_data *pd = NULL;
7122 char **rlist = NULL;
7124 int rlist_alloc = 0;
7125 int func_chunks_used = 0;
7126 int func_chunks_sorted = 0;
7127 int func_chunk_i = -1;
7128 long func_chunk_ret = 0;
7129 int func_chunk_ret_ln = 0;
7130 int scanned_ahead = 0;
7132 char words[20][256];
7133 enum opr_lenmod lmod;
7134 char *sctproto = NULL;
7136 int pending_endp = 0;
7138 int skip_warned = 0;
7151 for (arg = 1; arg < argc; arg++) {
7152 if (IS(argv[arg], "-v"))
7154 else if (IS(argv[arg], "-rf"))
7155 g_allow_regfunc = 1;
7156 else if (IS(argv[arg], "-m"))
7158 else if (IS(argv[arg], "-hdr"))
7159 g_header_mode = g_quiet_pp = g_allow_regfunc = 1;
7164 if (argc < arg + 3) {
7165 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdr.h> [rlist]*\n"
7166 "%s -hdr <out.h> <.asm> <seed.h> [rlist]*\n"
7168 " -hdr - header generation mode\n"
7169 " -rf - allow unannotated indirect calls\n"
7170 " -m - allow multiple .text sections\n"
7171 "[rlist] is a file with function names to skip,"
7179 asmfn = argv[arg++];
7180 fasm = fopen(asmfn, "r");
7181 my_assert_not(fasm, NULL);
7183 hdrfn = argv[arg++];
7184 g_fhdr = fopen(hdrfn, "r");
7185 my_assert_not(g_fhdr, NULL);
7188 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
7189 my_assert_not(rlist, NULL);
7190 // needs special handling..
7191 rlist[rlist_len++] = "__alloca_probe";
7193 func_chunk_alloc = 32;
7194 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
7195 my_assert_not(func_chunks, NULL);
7197 memset(words, 0, sizeof(words));
7199 for (; arg < argc; arg++) {
7200 frlist = fopen(argv[arg], "r");
7201 my_assert_not(frlist, NULL);
7203 while (my_fgets(line, sizeof(line), frlist)) {
7205 if (*p == 0 || *p == ';')
7208 if (IS_START(p, "#if 0")
7209 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
7213 else if (IS_START(p, "#endif"))
7220 p = next_word(words[0], sizeof(words[0]), p);
7221 if (words[0][0] == 0)
7224 if (rlist_len >= rlist_alloc) {
7225 rlist_alloc = rlist_alloc * 2 + 64;
7226 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
7227 my_assert_not(rlist, NULL);
7229 rlist[rlist_len++] = strdup(words[0]);
7238 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
7240 fout = fopen(argv[arg_out], "w");
7241 my_assert_not(fout, NULL);
7244 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
7245 my_assert_not(g_eqs, NULL);
7247 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
7248 g_label_refs[i].i = -1;
7249 g_label_refs[i].next = NULL;
7253 scan_variables(fasm);
7255 while (my_fgets(line, sizeof(line), fasm))
7264 // get rid of random tabs
7265 for (i = 0; line[i] != 0; i++)
7266 if (line[i] == '\t')
7271 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
7272 goto do_pending_endp; // eww..
7274 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
7276 static const char *attrs[] = {
7285 // parse IDA's attribute-list comment
7286 g_ida_func_attr = 0;
7289 for (; *p != 0; p = sskip(p)) {
7290 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
7291 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
7292 g_ida_func_attr |= 1 << i;
7293 p += strlen(attrs[i]);
7297 if (i == ARRAY_SIZE(attrs)) {
7298 anote("unparsed IDA attr: %s\n", p);
7301 if (IS(attrs[i], "fpd=")) {
7302 p = next_word(words[0], sizeof(words[0]), p);
7307 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
7310 next_word(words[0], sizeof(words[0]), p);
7311 if (words[0][0] == 0)
7312 aerr("missing name for func chunk?\n");
7314 if (!scanned_ahead) {
7315 add_func_chunk(fasm, words[0], asmln);
7316 func_chunks_sorted = 0;
7319 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
7321 if (func_chunk_i >= 0) {
7322 if (func_chunk_i < func_chunk_cnt
7323 && IS(func_chunks[func_chunk_i].name, g_func))
7325 // move on to next chunk
7326 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
7328 aerr("seek failed for '%s' chunk #%d\n",
7329 g_func, func_chunk_i);
7330 asmln = func_chunks[func_chunk_i].asmln;
7334 if (func_chunk_ret == 0)
7335 aerr("no return from chunk?\n");
7336 fseek(fasm, func_chunk_ret, SEEK_SET);
7337 asmln = func_chunk_ret_ln;
7343 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
7344 func_chunks_used = 1;
7346 if (IS_START(g_func, "sub_")) {
7347 unsigned long addr = strtoul(p, NULL, 16);
7348 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
7349 if (addr > f_addr && !scanned_ahead) {
7350 //anote("scan_ahead caused by '%s', addr %lx\n",
7354 func_chunks_sorted = 0;
7362 for (i = wordc; i < ARRAY_SIZE(words); i++)
7364 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
7365 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
7366 if (*p == 0 || *p == ';') {
7371 if (*p != 0 && *p != ';')
7372 aerr("too many words\n");
7374 // alow asm patches in comments
7376 if (IS_START(p, "; sctpatch:")) {
7378 if (*p == 0 || *p == ';')
7380 goto parse_words; // lame
7382 if (IS_START(p, "; sctproto:")) {
7383 sctproto = strdup(p + 11);
7385 else if (IS_START(p, "; sctend")) {
7394 awarn("wordc == 0?\n");
7398 // don't care about this:
7399 if (words[0][0] == '.'
7400 || IS(words[0], "include")
7401 || IS(words[0], "assume") || IS(words[1], "segment")
7402 || IS(words[0], "align"))
7408 // do delayed endp processing to collect switch jumptables
7410 if (in_func && !g_skip_func && !end && wordc >= 2
7411 && ((words[0][0] == 'd' && words[0][2] == 0)
7412 || (words[1][0] == 'd' && words[1][2] == 0)))
7415 if (words[1][0] == 'd' && words[1][2] == 0) {
7417 if (g_func_pd_cnt >= pd_alloc) {
7418 pd_alloc = pd_alloc * 2 + 16;
7419 g_func_pd = realloc(g_func_pd,
7420 sizeof(g_func_pd[0]) * pd_alloc);
7421 my_assert_not(g_func_pd, NULL);
7423 pd = &g_func_pd[g_func_pd_cnt];
7425 memset(pd, 0, sizeof(*pd));
7426 strcpy(pd->label, words[0]);
7427 pd->type = OPT_CONST;
7428 pd->lmod = lmod_from_directive(words[1]);
7434 anote("skipping alignment byte?\n");
7437 lmod = lmod_from_directive(words[0]);
7438 if (lmod != pd->lmod)
7439 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
7442 if (pd->count_alloc < pd->count + wordc) {
7443 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
7444 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
7445 my_assert_not(pd->d, NULL);
7447 for (; i < wordc; i++) {
7448 if (IS(words[i], "offset")) {
7449 pd->type = OPT_OFFSET;
7452 p = strchr(words[i], ',');
7455 if (pd->type == OPT_OFFSET)
7456 pd->d[pd->count].u.label = strdup(words[i]);
7458 pd->d[pd->count].u.val = parse_number(words[i]);
7459 pd->d[pd->count].bt_i = -1;
7465 if (in_func && !g_skip_func) {
7467 gen_hdr(g_func, pi);
7469 gen_func(fout, g_fhdr, g_func, pi);
7474 g_ida_func_attr = 0;
7478 func_chunks_used = 0;
7481 memset(&ops, 0, pi * sizeof(ops[0]));
7486 for (i = 0; i < g_func_pd_cnt; i++) {
7488 if (pd->type == OPT_OFFSET) {
7489 for (j = 0; j < pd->count; j++)
7490 free(pd->d[j].u.label);
7504 if (IS(words[1], "proc")) {
7506 aerr("proc '%s' while in_func '%s'?\n",
7509 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
7511 strcpy(g_func, words[0]);
7512 set_label(0, words[0]);
7517 if (IS(words[1], "endp"))
7520 aerr("endp '%s' while not in_func?\n", words[0]);
7521 if (!IS(g_func, words[0]))
7522 aerr("endp '%s' while in_func '%s'?\n",
7525 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
7526 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
7532 if (!g_skip_func && func_chunks_used) {
7533 // start processing chunks
7534 struct chunk_item *ci, key = { g_func, 0 };
7536 func_chunk_ret = ftell(fasm);
7537 func_chunk_ret_ln = asmln;
7538 if (!func_chunks_sorted) {
7539 qsort(func_chunks, func_chunk_cnt,
7540 sizeof(func_chunks[0]), cmp_chunks);
7541 func_chunks_sorted = 1;
7543 ci = bsearch(&key, func_chunks, func_chunk_cnt,
7544 sizeof(func_chunks[0]), cmp_chunks);
7546 aerr("'%s' needs chunks, but none found\n", g_func);
7547 func_chunk_i = ci - func_chunks;
7548 for (; func_chunk_i > 0; func_chunk_i--)
7549 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
7552 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
7554 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
7555 asmln = func_chunks[func_chunk_i].asmln;
7563 if (wordc == 2 && IS(words[1], "ends")) {
7567 goto do_pending_endp;
7571 // scan for next text segment
7572 while (my_fgets(line, sizeof(line), fasm)) {
7575 if (*p == 0 || *p == ';')
7578 if (strstr(p, "segment para public 'CODE' use32"))
7585 p = strchr(words[0], ':');
7587 set_label(pi, words[0]);
7591 if (!in_func || g_skip_func) {
7592 if (!skip_warned && !g_skip_func && g_labels[pi] != NULL) {
7594 anote("skipping from '%s'\n", g_labels[pi]);
7598 g_labels[pi] = NULL;
7602 if (wordc > 1 && IS(words[1], "="))
7605 aerr("unhandled equ, wc=%d\n", wordc);
7606 if (g_eqcnt >= eq_alloc) {
7608 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
7609 my_assert_not(g_eqs, NULL);
7612 len = strlen(words[0]);
7613 if (len > sizeof(g_eqs[0].name) - 1)
7614 aerr("equ name too long: %d\n", len);
7615 strcpy(g_eqs[g_eqcnt].name, words[0]);
7617 if (!IS(words[3], "ptr"))
7618 aerr("unhandled equ\n");
7619 if (IS(words[2], "dword"))
7620 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
7621 else if (IS(words[2], "word"))
7622 g_eqs[g_eqcnt].lmod = OPLM_WORD;
7623 else if (IS(words[2], "byte"))
7624 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
7625 else if (IS(words[2], "qword"))
7626 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
7628 aerr("bad lmod: '%s'\n", words[2]);
7630 g_eqs[g_eqcnt].offset = parse_number(words[4]);
7635 if (pi >= ARRAY_SIZE(ops))
7636 aerr("too many ops\n");
7638 parse_op(&ops[pi], words, wordc);
7640 if (sctproto != NULL) {
7641 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
7642 ops[pi].datap = sctproto;
7658 // vim:ts=2:shiftwidth=2:expandtab