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], xDX, 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 (op->operand_cnt != 0)
1104 if (words[op_w][4] == 'b')
1106 else if (words[op_w][4] == 'w')
1108 else if (words[op_w][4] == 'd')
1111 setup_reg_opr(&op->operand[j++], op->op == OP_LODS ? xSI : xDI,
1112 lmod, &op->regmask_src);
1113 if (op->flags & OPF_REP)
1114 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1115 op->regmask_dst = op->regmask_src;
1116 setup_reg_opr(&op->operand[j++], xAX, OPLM_DWORD,
1117 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1118 op->operand_cnt = j;
1123 if (op->operand_cnt != 0)
1125 if (words[op_w][4] == 'b')
1127 else if (words[op_w][4] == 'w')
1129 else if (words[op_w][4] == 'd')
1132 setup_reg_opr(&op->operand[j++], xDI, lmod, &op->regmask_src);
1133 setup_reg_opr(&op->operand[j++], xSI, OPLM_DWORD, &op->regmask_src);
1134 if (op->flags & OPF_REP)
1135 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1136 op->operand_cnt = j;
1137 op->regmask_dst = op->regmask_src;
1141 op->regmask_dst = 1 << xCX;
1144 op->operand_cnt = 2;
1145 op->regmask_src = 1 << xCX;
1146 op->operand[1].type = OPT_REG;
1147 op->operand[1].reg = xCX;
1148 op->operand[1].lmod = OPLM_DWORD;
1152 if (op->operand_cnt == 2) {
1153 if (op->operand[0].type != OPT_REG)
1154 aerr("reg expected\n");
1155 op->regmask_src |= 1 << op->operand[0].reg;
1157 if (op->operand_cnt != 1)
1162 op->regmask_src |= op->regmask_dst;
1163 op->regmask_dst = (1 << xDX) | (1 << xAX);
1164 if (op->operand[0].lmod == OPLM_UNSPEC)
1165 op->operand[0].lmod = OPLM_DWORD;
1170 // we could set up operands for edx:eax, but there is no real need to
1171 // (see is_opr_modified())
1172 op->regmask_src |= op->regmask_dst;
1173 op->regmask_dst = (1 << xDX) | (1 << xAX);
1174 if (op->operand[0].lmod == OPLM_UNSPEC)
1175 op->operand[0].lmod = OPLM_DWORD;
1183 op->regmask_src |= op->regmask_dst;
1184 if (op->operand[1].lmod == OPLM_UNSPEC)
1185 op->operand[1].lmod = OPLM_BYTE;
1190 op->regmask_src |= op->regmask_dst;
1191 if (op->operand[2].lmod == OPLM_UNSPEC)
1192 op->operand[2].lmod = OPLM_BYTE;
1196 op->regmask_src |= op->regmask_dst;
1197 op->regmask_dst = 0;
1198 if (op->operand[0].lmod == OPLM_UNSPEC
1199 && (op->operand[0].type == OPT_CONST
1200 || op->operand[0].type == OPT_OFFSET
1201 || op->operand[0].type == OPT_LABEL))
1202 op->operand[0].lmod = OPLM_DWORD;
1208 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1209 && op->operand[0].lmod == op->operand[1].lmod
1210 && op->operand[0].reg == op->operand[1].reg
1211 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1213 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1214 op->regmask_src = op->regmask_dst = 0;
1219 if (op->operand[0].type == OPT_REG
1220 && op->operand[1].type == OPT_REGMEM)
1223 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1224 if (IS(buf, op->operand[1].name))
1225 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1230 // trashed regs must be explicitly detected later
1231 op->regmask_dst = 0;
1235 op->regmask_dst = (1 << xBP) | (1 << xSP);
1236 op->regmask_src = 1 << xBP;
1243 if (op->operand[0].type == OPT_REG
1244 && op->operand[1].type == OPT_CONST)
1246 struct parsed_opr *op1 = &op->operand[1];
1247 if ((op->op == OP_AND && op1->val == 0)
1250 || (op->operand[0].lmod == OPLM_WORD && op1->val == 0xffff)
1251 || (op->operand[0].lmod == OPLM_BYTE && op1->val == 0xff))))
1253 op->regmask_src = 0;
1258 static const char *op_name(struct parsed_op *po)
1260 static char buf[16];
1264 if (po->op == OP_JCC || po->op == OP_SCC) {
1266 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1269 strcpy(p, parsed_flag_op_names[po->pfo]);
1273 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1274 if (op_table[i].op == po->op)
1275 return op_table[i].name;
1281 static const char *dump_op(struct parsed_op *po)
1283 static char out[128];
1290 snprintf(out, sizeof(out), "%s", op_name(po));
1291 for (i = 0; i < po->operand_cnt; i++) {
1295 snprintf(p, sizeof(out) - (p - out),
1296 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1297 po->operand[i].name);
1303 static const char *lmod_type_u(struct parsed_op *po,
1304 enum opr_lenmod lmod)
1316 ferr(po, "invalid lmod: %d\n", lmod);
1317 return "(_invalid_)";
1321 static const char *lmod_cast_u(struct parsed_op *po,
1322 enum opr_lenmod lmod)
1334 ferr(po, "invalid lmod: %d\n", lmod);
1335 return "(_invalid_)";
1339 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1340 enum opr_lenmod lmod)
1352 ferr(po, "invalid lmod: %d\n", lmod);
1353 return "(_invalid_)";
1357 static const char *lmod_cast_s(struct parsed_op *po,
1358 enum opr_lenmod lmod)
1370 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1371 return "(_invalid_)";
1375 static const char *lmod_cast(struct parsed_op *po,
1376 enum opr_lenmod lmod, int is_signed)
1379 lmod_cast_s(po, lmod) :
1380 lmod_cast_u(po, lmod);
1383 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1395 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1400 static const char *opr_name(struct parsed_op *po, int opr_num)
1402 if (opr_num >= po->operand_cnt)
1403 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1404 return po->operand[opr_num].name;
1407 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1409 if (opr_num >= po->operand_cnt)
1410 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1411 if (po->operand[opr_num].type != OPT_CONST)
1412 ferr(po, "opr %d: const expected\n", opr_num);
1413 return po->operand[opr_num].val;
1416 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1418 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1419 ferr(po, "invalid reg: %d\n", popr->reg);
1420 return regs_r32[popr->reg];
1423 // cast1 is the "final" cast
1424 static const char *simplify_cast(const char *cast1, const char *cast2)
1426 static char buf[256];
1432 if (IS(cast1, cast2))
1434 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1436 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1438 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1440 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1442 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1445 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1449 static const char *simplify_cast_num(const char *cast, unsigned int val)
1451 if (IS(cast, "(u8)") && val < 0x100)
1453 if (IS(cast, "(s8)") && val < 0x80)
1455 if (IS(cast, "(u16)") && val < 0x10000)
1457 if (IS(cast, "(s16)") && val < 0x8000)
1459 if (IS(cast, "(s32)") && val < 0x80000000)
1465 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1474 namelen = strlen(name);
1476 p = strchr(name, '+');
1480 ferr(po, "equ parse failed for '%s'\n", name);
1482 if (IS_START(p, "0x"))
1484 *extra_offs = strtol(p, &endp, 16);
1486 ferr(po, "equ parse failed for '%s'\n", name);
1489 for (i = 0; i < g_eqcnt; i++)
1490 if (strncmp(g_eqs[i].name, name, namelen) == 0
1491 && g_eqs[i].name[namelen] == 0)
1495 ferr(po, "unresolved equ name: '%s'\n", name);
1502 static int is_stack_access(struct parsed_op *po,
1503 const struct parsed_opr *popr)
1505 return (parse_stack_el(popr->name, NULL, 0)
1506 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1507 && IS_START(popr->name, "ebp")));
1510 static void parse_stack_access(struct parsed_op *po,
1511 const char *name, char *ofs_reg, int *offset_out,
1512 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1514 const char *bp_arg = "";
1515 const char *p = NULL;
1516 struct parsed_equ *eq;
1523 if (IS_START(name, "ebp-")
1524 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1527 if (IS_START(p, "0x"))
1529 offset = strtoul(p, &endp, 16);
1533 ferr(po, "ebp- parse of '%s' failed\n", name);
1536 bp_arg = parse_stack_el(name, ofs_reg, 0);
1537 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1538 eq = equ_find(po, bp_arg, &offset);
1540 ferr(po, "detected but missing eq\n");
1541 offset += eq->offset;
1544 if (!strncmp(name, "ebp", 3))
1547 // yes it sometimes LEAs ra for compares..
1548 if (!is_lea && ofs_reg[0] == 0
1549 && stack_ra <= offset && offset < stack_ra + 4)
1551 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1554 *offset_out = offset;
1555 *stack_ra_out = stack_ra;
1557 *bp_arg_out = bp_arg;
1560 static int stack_frame_access(struct parsed_op *po,
1561 struct parsed_opr *popr, char *buf, size_t buf_size,
1562 const char *name, const char *cast, int is_src, int is_lea)
1564 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1565 const char *prefix = "";
1566 const char *bp_arg = NULL;
1567 char ofs_reg[16] = { 0, };
1568 int i, arg_i, arg_s;
1576 if (po->flags & OPF_EBP_S)
1577 ferr(po, "stack_frame_access while ebp is scratch\n");
1579 parse_stack_access(po, name, ofs_reg, &offset,
1580 &stack_ra, &bp_arg, is_lea);
1582 if (offset > stack_ra)
1584 arg_i = (offset - stack_ra - 4) / 4;
1585 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1587 if (g_func_pp->is_vararg
1588 && arg_i == g_func_pp->argc_stack && is_lea)
1590 // should be va_list
1593 snprintf(buf, buf_size, "%sap", cast);
1596 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1597 offset, bp_arg, arg_i);
1599 if (ofs_reg[0] != 0)
1600 ferr(po, "offset reg on arg access?\n");
1602 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1603 if (g_func_pp->arg[i].reg != NULL)
1609 if (i == g_func_pp->argc)
1610 ferr(po, "arg %d not in prototype?\n", arg_i);
1612 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1619 ferr(po, "lea/byte to arg?\n");
1620 if (is_src && (offset & 3) == 0)
1621 snprintf(buf, buf_size, "%sa%d",
1622 simplify_cast(cast, "(u8)"), i + 1);
1624 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1625 cast, offset & 3, i + 1);
1630 ferr(po, "lea/word to arg?\n");
1635 ferr(po, "problematic arg store\n");
1636 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1637 simplify_cast(cast, "*(u16 *)"), i + 1);
1640 ferr(po, "unaligned arg word load\n");
1642 else if (is_src && (offset & 2) == 0)
1643 snprintf(buf, buf_size, "%sa%d",
1644 simplify_cast(cast, "(u16)"), i + 1);
1646 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1647 cast, (offset & 2) ? "HI" : "LO", i + 1);
1659 snprintf(buf, buf_size, "(u32)&a%d + %d",
1662 ferr(po, "unaligned arg store\n");
1664 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1665 snprintf(buf, buf_size, "%s(a%d >> %d)",
1666 prefix, i + 1, (offset & 3) * 8);
1670 snprintf(buf, buf_size, "%s%sa%d",
1671 prefix, is_lea ? "&" : "", i + 1);
1676 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1680 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1683 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1684 if (tmp_lmod != OPLM_DWORD
1685 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1686 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1688 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1689 i + 1, offset, g_func_pp->arg[i].type.name);
1691 // can't check this because msvc likes to reuse
1692 // arg space for scratch..
1693 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1694 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1698 if (g_stack_fsz == 0)
1699 ferr(po, "stack var access without stackframe\n");
1700 g_stack_frame_used = 1;
1702 sf_ofs = g_stack_fsz + offset;
1703 lim = (ofs_reg[0] != 0) ? -4 : 0;
1704 if (offset > 0 || sf_ofs < lim)
1705 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1715 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1716 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1720 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1721 // known unaligned or possibly unaligned
1722 strcat(g_comment, " unaligned");
1724 prefix = "*(u16 *)&";
1725 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1726 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1729 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1733 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1734 // known unaligned or possibly unaligned
1735 strcat(g_comment, " unaligned");
1737 prefix = "*(u32 *)&";
1738 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1739 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1742 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1746 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1753 static void check_func_pp(struct parsed_op *po,
1754 const struct parsed_proto *pp, const char *pfx)
1756 enum opr_lenmod tmp_lmod;
1760 if (pp->argc_reg != 0) {
1761 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1762 pp_print(buf, sizeof(buf), pp);
1763 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1765 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1766 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1767 pfx, pp->argc_reg, pp->argc_stack);
1770 // fptrs must use 32bit args, callsite might have no information and
1771 // lack a cast to smaller types, which results in incorrectly masked
1772 // args passed (callee may assume masked args, it does on ARM)
1773 if (!pp->is_osinc) {
1774 for (i = 0; i < pp->argc; i++) {
1775 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1776 if (ret && tmp_lmod != OPLM_DWORD)
1777 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1778 i + 1, pp->arg[i].type.name);
1783 static const char *check_label_read_ref(struct parsed_op *po,
1786 const struct parsed_proto *pp;
1788 pp = proto_parse(g_fhdr, name, 0);
1790 ferr(po, "proto_parse failed for ref '%s'\n", name);
1793 check_func_pp(po, pp, "ref");
1798 static char *out_src_opr(char *buf, size_t buf_size,
1799 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1802 char tmp1[256], tmp2[256];
1811 switch (popr->type) {
1814 ferr(po, "lea from reg?\n");
1816 switch (popr->lmod) {
1818 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
1821 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1824 snprintf(buf, buf_size, "%s%s",
1825 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1828 if (popr->name[1] == 'h') // XXX..
1829 snprintf(buf, buf_size, "%s(%s >> 8)",
1830 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1832 snprintf(buf, buf_size, "%s%s",
1833 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1836 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1841 if (is_stack_access(po, popr)) {
1842 stack_frame_access(po, popr, buf, buf_size,
1843 popr->name, cast, 1, is_lea);
1847 strcpy(expr, popr->name);
1848 if (strchr(expr, '[')) {
1849 // special case: '[' can only be left for label[reg] form
1850 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1852 ferr(po, "parse failure for '%s'\n", expr);
1853 if (tmp1[0] == '(') {
1854 // (off_4FFF50+3)[eax]
1855 p = strchr(tmp1 + 1, ')');
1856 if (p == NULL || p[1] != 0)
1857 ferr(po, "parse failure (2) for '%s'\n", expr);
1859 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1861 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1864 // XXX: do we need more parsing?
1866 snprintf(buf, buf_size, "%s", expr);
1870 snprintf(buf, buf_size, "%s(%s)",
1871 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1875 name = check_label_read_ref(po, popr->name);
1876 if (cast[0] == 0 && popr->is_ptr)
1880 snprintf(buf, buf_size, "(u32)&%s", name);
1881 else if (popr->size_lt)
1882 snprintf(buf, buf_size, "%s%s%s%s", cast,
1883 lmod_cast_u_ptr(po, popr->lmod),
1884 popr->is_array ? "" : "&", name);
1886 snprintf(buf, buf_size, "%s%s%s", cast, name,
1887 popr->is_array ? "[0]" : "");
1891 name = check_label_read_ref(po, popr->name);
1895 ferr(po, "lea an offset?\n");
1896 snprintf(buf, buf_size, "%s&%s", cast, name);
1901 ferr(po, "lea from const?\n");
1903 printf_number(tmp1, sizeof(tmp1), popr->val);
1904 if (popr->val == 0 && strchr(cast, '*'))
1905 snprintf(buf, buf_size, "NULL");
1907 snprintf(buf, buf_size, "%s%s",
1908 simplify_cast_num(cast, popr->val), tmp1);
1912 ferr(po, "invalid src type: %d\n", popr->type);
1918 // note: may set is_ptr (we find that out late for ebp frame..)
1919 static char *out_dst_opr(char *buf, size_t buf_size,
1920 struct parsed_op *po, struct parsed_opr *popr)
1922 switch (popr->type) {
1924 switch (popr->lmod) {
1926 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
1929 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1933 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1937 if (popr->name[1] == 'h') // XXX..
1938 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1940 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1943 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1948 if (is_stack_access(po, popr)) {
1949 stack_frame_access(po, popr, buf, buf_size,
1950 popr->name, "", 0, 0);
1954 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1957 if (popr->size_mismatch)
1958 snprintf(buf, buf_size, "%s%s%s",
1959 lmod_cast_u_ptr(po, popr->lmod),
1960 popr->is_array ? "" : "&", popr->name);
1962 snprintf(buf, buf_size, "%s%s", popr->name,
1963 popr->is_array ? "[0]" : "");
1967 ferr(po, "invalid dst type: %d\n", popr->type);
1973 static char *out_src_opr_u32(char *buf, size_t buf_size,
1974 struct parsed_op *po, struct parsed_opr *popr)
1976 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1979 static void out_test_for_cc(char *buf, size_t buf_size,
1980 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1981 enum opr_lenmod lmod, const char *expr)
1983 const char *cast, *scast;
1985 cast = lmod_cast_u(po, lmod);
1986 scast = lmod_cast_s(po, lmod);
1990 case PFO_BE: // CF=1||ZF=1; CF=0
1991 snprintf(buf, buf_size, "(%s%s %s 0)",
1992 cast, expr, is_inv ? "!=" : "==");
1996 case PFO_L: // SF!=OF; OF=0
1997 snprintf(buf, buf_size, "(%s%s %s 0)",
1998 scast, expr, is_inv ? ">=" : "<");
2001 case PFO_LE: // ZF=1||SF!=OF; OF=0
2002 snprintf(buf, buf_size, "(%s%s %s 0)",
2003 scast, expr, is_inv ? ">" : "<=");
2007 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2011 static void out_cmp_for_cc(char *buf, size_t buf_size,
2012 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2014 const char *cast, *scast, *cast_use;
2015 char buf1[256], buf2[256];
2016 enum opr_lenmod lmod;
2018 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
2019 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
2020 po->operand[0].lmod, po->operand[1].lmod);
2021 lmod = po->operand[0].lmod;
2023 cast = lmod_cast_u(po, lmod);
2024 scast = lmod_cast_s(po, lmod);
2040 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2043 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
2044 if (po->op == OP_DEC)
2045 snprintf(buf2, sizeof(buf2), "1");
2047 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
2051 // note: must be unsigned compare
2052 snprintf(buf, buf_size, "(%s %s %s)",
2053 buf1, is_inv ? ">=" : "<", buf2);
2057 snprintf(buf, buf_size, "(%s %s %s)",
2058 buf1, is_inv ? "!=" : "==", buf2);
2062 // note: must be unsigned compare
2063 snprintf(buf, buf_size, "(%s %s %s)",
2064 buf1, is_inv ? ">" : "<=", buf2);
2067 if (is_inv && lmod == OPLM_BYTE
2068 && po->operand[1].type == OPT_CONST
2069 && po->operand[1].val == 0xff)
2071 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2072 snprintf(buf, buf_size, "(0)");
2076 // note: must be signed compare
2078 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2079 scast, buf1, buf2, is_inv ? ">=" : "<");
2083 snprintf(buf, buf_size, "(%s %s %s)",
2084 buf1, is_inv ? ">=" : "<", buf2);
2088 snprintf(buf, buf_size, "(%s %s %s)",
2089 buf1, is_inv ? ">" : "<=", buf2);
2097 static void out_cmp_test(char *buf, size_t buf_size,
2098 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2100 char buf1[256], buf2[256], buf3[256];
2102 if (po->op == OP_TEST) {
2103 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2104 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2107 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2108 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2109 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2111 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2112 po->operand[0].lmod, buf3);
2114 else if (po->op == OP_CMP) {
2115 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
2118 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2121 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2122 struct parsed_opr *popr2)
2124 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2125 ferr(po, "missing lmod for both operands\n");
2127 if (popr1->lmod == OPLM_UNSPEC)
2128 popr1->lmod = popr2->lmod;
2129 else if (popr2->lmod == OPLM_UNSPEC)
2130 popr2->lmod = popr1->lmod;
2131 else if (popr1->lmod != popr2->lmod) {
2132 if (popr1->type_from_var) {
2133 popr1->size_mismatch = 1;
2134 if (popr1->lmod < popr2->lmod)
2136 popr1->lmod = popr2->lmod;
2138 else if (popr2->type_from_var) {
2139 popr2->size_mismatch = 1;
2140 if (popr2->lmod < popr1->lmod)
2142 popr2->lmod = popr1->lmod;
2145 ferr(po, "conflicting lmods: %d vs %d\n",
2146 popr1->lmod, popr2->lmod);
2150 static const char *op_to_c(struct parsed_op *po)
2174 ferr(po, "op_to_c was supplied with %d\n", po->op);
2178 // last op in stream - unconditional branch or ret
2179 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2180 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2181 && ops[_i].op != OP_CALL))
2183 #define check_i(po, i) \
2185 ferr(po, "bad " #i ": %d\n", i)
2187 // note: this skips over calls and rm'd stuff assuming they're handled
2188 // so it's intended to use at one of final passes
2189 static int scan_for_pop(int i, int opcnt, int magic, int reg,
2190 int depth, int flags_set)
2192 struct parsed_op *po;
2197 for (; i < opcnt; i++) {
2199 if (po->cc_scratch == magic)
2200 return ret; // already checked
2201 po->cc_scratch = magic;
2203 if (po->flags & OPF_TAIL) {
2204 if (po->op == OP_CALL) {
2205 if (po->pp != NULL && po->pp->is_noreturn)
2206 // assume no stack cleanup for noreturn
2209 return -1; // deadend
2212 if (po->flags & (OPF_RMD|OPF_DONE|OPF_FARG))
2215 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2216 if (po->btj != NULL) {
2218 for (j = 0; j < po->btj->count; j++) {
2219 check_i(po, po->btj->d[j].bt_i);
2220 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, magic, reg,
2223 return ret; // dead end
2228 check_i(po, po->bt_i);
2229 if (po->flags & OPF_CJMP) {
2230 ret |= scan_for_pop(po->bt_i, opcnt, magic, reg,
2233 return ret; // dead end
2242 if ((po->op == OP_POP || po->op == OP_PUSH)
2243 && po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2248 if (po->op == OP_PUSH) {
2251 else if (po->op == OP_POP) {
2252 if (relevant && depth == 0) {
2253 po->flags |= flags_set;
2263 // scan for 'reg' pop backwards starting from i
2264 // intended to use for register restore search, so other reg
2265 // references are considered an error
2266 static int scan_for_rsave_pop_reg(int i, int magic, int reg, int set_flags)
2268 struct parsed_op *po;
2269 struct label_ref *lr;
2272 ops[i].cc_scratch = magic;
2276 if (g_labels[i] != NULL) {
2277 lr = &g_label_refs[i];
2278 for (; lr != NULL; lr = lr->next) {
2279 check_i(&ops[i], lr->i);
2280 ret |= scan_for_rsave_pop_reg(lr->i, magic, reg, set_flags);
2284 if (i > 0 && LAST_OP(i - 1))
2292 if (ops[i].cc_scratch == magic)
2294 ops[i].cc_scratch = magic;
2297 if (po->op == OP_POP && po->operand[0].reg == reg) {
2298 if (po->flags & (OPF_RMD|OPF_DONE))
2301 po->flags |= set_flags;
2305 // this also covers the case where we reach corresponding push
2306 if ((po->regmask_dst | po->regmask_src) & (1 << reg))
2310 // nothing interesting on this path
2314 static void find_reachable_exits(int i, int opcnt, int magic,
2315 int *exits, int *exit_count)
2317 struct parsed_op *po;
2320 for (; i < opcnt; i++)
2323 if (po->cc_scratch == magic)
2325 po->cc_scratch = magic;
2327 if (po->flags & OPF_TAIL) {
2328 ferr_assert(po, *exit_count < MAX_EXITS);
2329 exits[*exit_count] = i;
2334 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2335 if (po->flags & OPF_RMD)
2338 if (po->btj != NULL) {
2339 for (j = 0; j < po->btj->count; j++) {
2340 check_i(po, po->btj->d[j].bt_i);
2341 find_reachable_exits(po->btj->d[j].bt_i, opcnt, magic,
2347 check_i(po, po->bt_i);
2348 if (po->flags & OPF_CJMP)
2349 find_reachable_exits(po->bt_i, opcnt, magic, exits, exit_count);
2357 // scan for 'reg' pop backwards starting from exits (all paths)
2358 static int scan_for_pop_ret(int i, int opcnt, int reg, int set_flags)
2360 static int exits[MAX_EXITS];
2361 static int exit_count;
2366 find_reachable_exits(i, opcnt, i + opcnt * 15, exits,
2368 ferr_assert(&ops[i], exit_count > 0);
2371 for (j = 0; j < exit_count; j++) {
2372 ret = scan_for_rsave_pop_reg(exits[j], i + opcnt * 16 + set_flags,
2381 // scan for one or more pop of push <const>
2382 static int scan_for_pop_const_r(int i, int opcnt, int magic,
2383 int push_i, int is_probe)
2385 struct parsed_op *po;
2386 struct label_ref *lr;
2390 for (; i < opcnt; i++)
2393 if (po->cc_scratch == magic)
2394 return ret; // already checked
2395 po->cc_scratch = magic;
2397 if (po->flags & OPF_JMP) {
2398 if (po->flags & OPF_RMD)
2400 if (po->op == OP_CALL)
2403 if (po->btj != NULL) {
2404 for (j = 0; j < po->btj->count; j++) {
2405 check_i(po, po->btj->d[j].bt_i);
2406 ret |= scan_for_pop_const_r(po->btj->d[j].bt_i, opcnt, magic,
2414 check_i(po, po->bt_i);
2415 if (po->flags & OPF_CJMP) {
2416 ret |= scan_for_pop_const_r(po->bt_i, opcnt, magic, push_i,
2427 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_PUSH)
2430 if (g_labels[i] != NULL) {
2431 // all refs must be visited
2432 lr = &g_label_refs[i];
2433 for (; lr != NULL; lr = lr->next) {
2435 if (ops[lr->i].cc_scratch != magic)
2438 if (i > 0 && !LAST_OP(i - 1) && ops[i - 1].cc_scratch != magic)
2442 if (po->op == OP_POP)
2444 if (po->flags & (OPF_RMD|OPF_DONE))
2448 po->flags |= OPF_DONE;
2449 po->datap = &ops[push_i];
2458 static void scan_for_pop_const(int i, int opcnt, int magic)
2462 ret = scan_for_pop_const_r(i + 1, opcnt, magic, i, 1);
2464 ops[i].flags |= OPF_RMD | OPF_DONE;
2465 scan_for_pop_const_r(i + 1, opcnt, magic + 1, i, 0);
2469 // check if all branch targets within a marked path are also marked
2470 // note: the path checked must not be empty or end with a branch
2471 static int check_path_branches(int opcnt, int magic)
2473 struct parsed_op *po;
2476 for (i = 0; i < opcnt; i++) {
2478 if (po->cc_scratch != magic)
2481 if (po->flags & OPF_JMP) {
2482 if ((po->flags & OPF_RMD) || po->op == OP_CALL)
2485 if (po->btj != NULL) {
2486 for (j = 0; j < po->btj->count; j++) {
2487 check_i(po, po->btj->d[j].bt_i);
2488 if (ops[po->btj->d[j].bt_i].cc_scratch != magic)
2493 check_i(po, po->bt_i);
2494 if (ops[po->bt_i].cc_scratch != magic)
2496 if ((po->flags & OPF_CJMP) && ops[i + 1].cc_scratch != magic)
2504 // scan for multiple pushes for given pop
2505 static int scan_pushes_for_pop_r(int i, int magic, int pop_i,
2508 int reg = ops[pop_i].operand[0].reg;
2509 struct parsed_op *po;
2510 struct label_ref *lr;
2513 ops[i].cc_scratch = magic;
2517 if (g_labels[i] != NULL) {
2518 lr = &g_label_refs[i];
2519 for (; lr != NULL; lr = lr->next) {
2520 check_i(&ops[i], lr->i);
2521 ret |= scan_pushes_for_pop_r(lr->i, magic, pop_i, is_probe);
2525 if (i > 0 && LAST_OP(i - 1))
2533 if (ops[i].cc_scratch == magic)
2535 ops[i].cc_scratch = magic;
2538 if (po->op == OP_CALL)
2540 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_POP)
2543 if (po->op == OP_PUSH)
2545 if (po->datap != NULL)
2547 if (po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2548 // leave this case for reg save/restore handlers
2552 po->flags |= OPF_PPUSH | OPF_DONE;
2553 po->datap = &ops[pop_i];
2562 static void scan_pushes_for_pop(int i, int opcnt, int *regmask_pp)
2564 int magic = i + opcnt * 14;
2567 ret = scan_pushes_for_pop_r(i, magic, i, 1);
2569 ret = check_path_branches(opcnt, magic);
2571 ops[i].flags |= OPF_PPUSH | OPF_DONE;
2572 *regmask_pp |= 1 << ops[i].operand[0].reg;
2573 scan_pushes_for_pop_r(i, magic + 1, i, 0);
2578 static void scan_propagate_df(int i, int opcnt)
2580 struct parsed_op *po = &ops[i];
2583 for (; i < opcnt; i++) {
2585 if (po->flags & OPF_DF)
2586 return; // already resolved
2587 po->flags |= OPF_DF;
2589 if (po->op == OP_CALL)
2590 ferr(po, "call with DF set?\n");
2592 if (po->flags & OPF_JMP) {
2593 if (po->btj != NULL) {
2595 for (j = 0; j < po->btj->count; j++) {
2596 check_i(po, po->btj->d[j].bt_i);
2597 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2602 if (po->flags & OPF_RMD)
2604 check_i(po, po->bt_i);
2605 if (po->flags & OPF_CJMP)
2606 scan_propagate_df(po->bt_i, opcnt);
2612 if (po->flags & OPF_TAIL)
2615 if (po->op == OP_CLD) {
2616 po->flags |= OPF_RMD | OPF_DONE;
2621 ferr(po, "missing DF clear?\n");
2624 // is operand 'opr' referenced by parsed_op 'po'?
2625 static int is_opr_referenced(const struct parsed_opr *opr,
2626 const struct parsed_op *po)
2630 if (opr->type == OPT_REG) {
2631 mask = po->regmask_dst | po->regmask_src;
2632 if (po->op == OP_CALL)
2633 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX);
2634 if ((1 << opr->reg) & mask)
2640 for (i = 0; i < po->operand_cnt; i++)
2641 if (IS(po->operand[0].name, opr->name))
2647 // is operand 'opr' read by parsed_op 'po'?
2648 static int is_opr_read(const struct parsed_opr *opr,
2649 const struct parsed_op *po)
2651 if (opr->type == OPT_REG) {
2652 if (po->regmask_src & (1 << opr->reg))
2662 // is operand 'opr' modified by parsed_op 'po'?
2663 static int is_opr_modified(const struct parsed_opr *opr,
2664 const struct parsed_op *po)
2668 if (opr->type == OPT_REG) {
2669 if (po->op == OP_CALL) {
2670 mask = po->regmask_dst;
2671 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX); // ?
2672 if (mask & (1 << opr->reg))
2678 if (po->regmask_dst & (1 << opr->reg))
2684 return IS(po->operand[0].name, opr->name);
2687 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2688 static int is_any_opr_modified(const struct parsed_op *po_test,
2689 const struct parsed_op *po, int c_mode)
2694 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2697 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2700 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2703 // in reality, it can wreck any register, but in decompiled C
2704 // version it can only overwrite eax or edx:eax
2705 mask = (1 << xAX) | (1 << xDX);
2709 if (po->op == OP_CALL
2710 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2713 for (i = 0; i < po_test->operand_cnt; i++)
2714 if (IS(po_test->operand[i].name, po->operand[0].name))
2720 // scan for any po_test operand modification in range given
2721 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2724 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2727 for (; i < opcnt; i++) {
2728 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2735 // scan for po_test operand[0] modification in range given
2736 static int scan_for_mod_opr0(struct parsed_op *po_test,
2739 for (; i < opcnt; i++) {
2740 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2747 static int scan_for_flag_set(int i, int magic, int *branched,
2748 int *setters, int *setter_cnt)
2750 struct label_ref *lr;
2754 if (ops[i].cc_scratch == magic) {
2755 // is this a problem?
2756 //ferr(&ops[i], "%s looped\n", __func__);
2759 ops[i].cc_scratch = magic;
2761 if (g_labels[i] != NULL) {
2764 lr = &g_label_refs[i];
2765 for (; lr->next; lr = lr->next) {
2766 check_i(&ops[i], lr->i);
2767 ret = scan_for_flag_set(lr->i, magic,
2768 branched, setters, setter_cnt);
2773 check_i(&ops[i], lr->i);
2774 if (i > 0 && LAST_OP(i - 1)) {
2778 ret = scan_for_flag_set(lr->i, magic,
2779 branched, setters, setter_cnt);
2785 if (ops[i].flags & OPF_FLAGS) {
2786 setters[*setter_cnt] = i;
2791 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2798 // scan back for cdq, if anything modifies edx, fail
2799 static int scan_for_cdq_edx(int i)
2802 if (g_labels[i] != NULL) {
2803 if (g_label_refs[i].next != NULL)
2805 if (i > 0 && LAST_OP(i - 1)) {
2806 i = g_label_refs[i].i;
2813 if (ops[i].op == OP_CDQ)
2816 if (ops[i].regmask_dst & (1 << xDX))
2823 static int scan_for_reg_clear(int i, int reg)
2826 if (g_labels[i] != NULL) {
2827 if (g_label_refs[i].next != NULL)
2829 if (i > 0 && LAST_OP(i - 1)) {
2830 i = g_label_refs[i].i;
2837 if (ops[i].op == OP_XOR
2838 && ops[i].operand[0].lmod == OPLM_DWORD
2839 && ops[i].operand[0].reg == ops[i].operand[1].reg
2840 && ops[i].operand[0].reg == reg)
2843 if (ops[i].regmask_dst & (1 << reg))
2850 static void patch_esp_adjust(struct parsed_op *po, int adj)
2852 ferr_assert(po, po->op == OP_ADD);
2853 ferr_assert(po, IS(opr_name(po, 0), "esp"));
2854 ferr_assert(po, po->operand[1].type == OPT_CONST);
2856 // this is a bit of a hack, but deals with use of
2857 // single adj for multiple calls
2858 po->operand[1].val -= adj;
2859 po->flags |= OPF_RMD;
2860 if (po->operand[1].val == 0)
2861 po->flags |= OPF_DONE;
2862 ferr_assert(po, (int)po->operand[1].val >= 0);
2865 // scan for positive, constant esp adjust
2866 // multipath case is preliminary
2867 static int scan_for_esp_adjust(int i, int opcnt,
2868 int adj_expect, int *adj, int *is_multipath, int do_update)
2870 int adj_expect_unknown = 0;
2871 struct parsed_op *po;
2875 *adj = *is_multipath = 0;
2876 if (adj_expect < 0) {
2877 adj_expect_unknown = 1;
2878 adj_expect = 32 * 4; // enough?
2881 for (; i < opcnt && *adj < adj_expect; i++) {
2882 if (g_labels[i] != NULL)
2886 if (po->flags & OPF_DONE)
2889 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2890 if (po->operand[1].type != OPT_CONST)
2891 ferr(&ops[i], "non-const esp adjust?\n");
2892 *adj += po->operand[1].val;
2894 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2897 patch_esp_adjust(po, adj_expect);
2899 po->flags |= OPF_RMD;
2903 else if (po->op == OP_PUSH) {
2904 //if (first_pop == -1)
2905 // first_pop = -2; // none
2906 *adj -= lmod_bytes(po, po->operand[0].lmod);
2908 else if (po->op == OP_POP) {
2909 if (!(po->flags & OPF_DONE)) {
2910 // seems like msvc only uses 'pop ecx' for stack realignment..
2911 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2913 if (first_pop == -1 && *adj >= 0)
2916 if (do_update && *adj >= 0) {
2917 po->flags |= OPF_RMD;
2919 po->flags |= OPF_DONE | OPF_NOREGS;
2922 *adj += lmod_bytes(po, po->operand[0].lmod);
2923 if (*adj > adj_best)
2926 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2927 if (po->op == OP_JMP && po->btj == NULL) {
2933 if (po->op != OP_CALL)
2935 if (po->operand[0].type != OPT_LABEL)
2937 if (po->pp != NULL && po->pp->is_stdcall)
2939 if (adj_expect_unknown && first_pop >= 0)
2941 // assume it's another cdecl call
2945 if (first_pop >= 0) {
2946 // probably only 'pop ecx' was used
2954 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2956 struct parsed_op *po;
2960 ferr(ops, "%s: followed bad branch?\n", __func__);
2962 for (; i < opcnt; i++) {
2964 if (po->cc_scratch == magic)
2966 po->cc_scratch = magic;
2969 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2970 if (po->btj != NULL) {
2972 for (j = 0; j < po->btj->count; j++)
2973 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2977 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2978 if (!(po->flags & OPF_CJMP))
2981 if (po->flags & OPF_TAIL)
2986 static const struct parsed_proto *try_recover_pp(
2987 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2989 const struct parsed_proto *pp = NULL;
2993 // maybe an arg of g_func?
2994 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2996 char ofs_reg[16] = { 0, };
2997 int arg, arg_s, arg_i;
3004 parse_stack_access(po, opr->name, ofs_reg,
3005 &offset, &stack_ra, NULL, 0);
3006 if (ofs_reg[0] != 0)
3007 ferr(po, "offset reg on arg access?\n");
3008 if (offset <= stack_ra) {
3009 // search who set the stack var instead
3010 if (search_instead != NULL)
3011 *search_instead = 1;
3015 arg_i = (offset - stack_ra - 4) / 4;
3016 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
3017 if (g_func_pp->arg[arg].reg != NULL)
3023 if (arg == g_func_pp->argc)
3024 ferr(po, "stack arg %d not in prototype?\n", arg_i);
3026 pp = g_func_pp->arg[arg].fptr;
3028 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
3029 check_func_pp(po, pp, "icall arg");
3031 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
3033 p = strchr(opr->name + 1, '[');
3034 memcpy(buf, opr->name, p - opr->name);
3035 buf[p - opr->name] = 0;
3036 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
3038 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
3039 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
3042 ferr(po, "proto_parse failed for icall to '%s'\n", opr->name);
3045 check_func_pp(po, pp, "reg-fptr ref");
3051 static void scan_for_call_type(int i, const struct parsed_opr *opr,
3052 int magic, const struct parsed_proto **pp_found, int *pp_i,
3055 const struct parsed_proto *pp = NULL;
3056 struct parsed_op *po;
3057 struct label_ref *lr;
3059 ops[i].cc_scratch = magic;
3062 if (g_labels[i] != NULL) {
3063 lr = &g_label_refs[i];
3064 for (; lr != NULL; lr = lr->next) {
3065 check_i(&ops[i], lr->i);
3066 scan_for_call_type(lr->i, opr, magic, pp_found, pp_i, multi);
3068 if (i > 0 && LAST_OP(i - 1))
3076 if (ops[i].cc_scratch == magic)
3078 ops[i].cc_scratch = magic;
3080 if (!(ops[i].flags & OPF_DATA))
3082 if (!is_opr_modified(opr, &ops[i]))
3084 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
3085 // most probably trashed by some processing
3090 opr = &ops[i].operand[1];
3091 if (opr->type != OPT_REG)
3095 po = (i >= 0) ? &ops[i] : ops;
3098 // reached the top - can only be an arg-reg
3099 if (opr->type != OPT_REG || g_func_pp == NULL)
3102 for (i = 0; i < g_func_pp->argc; i++) {
3103 if (g_func_pp->arg[i].reg == NULL)
3105 if (IS(opr->name, g_func_pp->arg[i].reg))
3108 if (i == g_func_pp->argc)
3110 pp = g_func_pp->arg[i].fptr;
3112 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
3113 i + 1, g_func_pp->arg[i].reg);
3114 check_func_pp(po, pp, "icall reg-arg");
3117 pp = try_recover_pp(po, opr, NULL);
3119 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
3120 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
3121 || (*pp_found)->is_stdcall != pp->is_stdcall
3122 || (*pp_found)->is_fptr != pp->is_fptr
3123 || (*pp_found)->argc != pp->argc
3124 || (*pp_found)->argc_reg != pp->argc_reg
3125 || (*pp_found)->argc_stack != pp->argc_stack)
3127 ferr(po, "icall: parsed_proto mismatch\n");
3137 static void add_label_ref(struct label_ref *lr, int op_i)
3139 struct label_ref *lr_new;
3146 lr_new = calloc(1, sizeof(*lr_new));
3148 lr_new->next = lr->next;
3152 static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
3154 struct parsed_op *po = &ops[i];
3155 struct parsed_data *pd;
3156 char label[NAMELEN], *p;
3159 p = strchr(po->operand[0].name, '[');
3163 len = p - po->operand[0].name;
3164 strncpy(label, po->operand[0].name, len);
3167 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3168 if (IS(g_func_pd[j].label, label)) {
3174 //ferr(po, "label '%s' not parsed?\n", label);
3177 if (pd->type != OPT_OFFSET)
3178 ferr(po, "label '%s' with non-offset data?\n", label);
3180 // find all labels, link
3181 for (j = 0; j < pd->count; j++) {
3182 for (l = 0; l < opcnt; l++) {
3183 if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) {
3184 add_label_ref(&g_label_refs[l], i);
3194 static void clear_labels(int count)
3198 for (i = 0; i < count; i++) {
3199 if (g_labels[i] != NULL) {
3206 static int get_pp_arg_regmask_src(const struct parsed_proto *pp)
3211 for (i = 0; i < pp->argc; i++) {
3212 if (pp->arg[i].reg != NULL) {
3213 reg = char_array_i(regs_r32,
3214 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
3216 ferr(ops, "arg '%s' of func '%s' is not a reg?\n",
3217 pp->arg[i].reg, pp->name);
3218 regmask |= 1 << reg;
3225 static int get_pp_arg_regmask_dst(const struct parsed_proto *pp)
3227 if (strstr(pp->ret_type.name, "int64"))
3228 return (1 << xAX) | (1 << xDX);
3229 if (strcasecmp(pp->ret_type.name, "void") == 0)
3235 static void resolve_branches_parse_calls(int opcnt)
3237 const struct parsed_proto *pp_c;
3238 struct parsed_proto *pp;
3239 struct parsed_data *pd;
3240 struct parsed_op *po;
3241 const char *tmpname;
3245 for (i = 0; i < opcnt; i++)
3251 if (po->op == OP_CALL) {
3254 if (po->operand[0].type == OPT_LABEL) {
3255 tmpname = opr_name(po, 0);
3256 if (IS_START(tmpname, "loc_"))
3257 ferr(po, "call to loc_*\n");
3258 pp_c = proto_parse(g_fhdr, tmpname, g_header_mode);
3259 if (!g_header_mode && pp_c == NULL)
3260 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3263 pp = proto_clone(pp_c);
3264 my_assert_not(pp, NULL);
3267 else if (po->datap != NULL) {
3268 pp = calloc(1, sizeof(*pp));
3269 my_assert_not(pp, NULL);
3271 ret = parse_protostr(po->datap, pp);
3273 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3280 check_func_pp(po, pp, "fptr var call");
3281 if (pp->is_noreturn)
3282 po->flags |= OPF_TAIL;
3288 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3291 if (po->operand[0].type == OPT_REGMEM) {
3292 pd = try_resolve_jumptab(i, opcnt);
3300 for (l = 0; l < opcnt; l++) {
3301 if (g_labels[l] != NULL
3302 && IS(po->operand[0].name, g_labels[l]))
3304 if (l == i + 1 && po->op == OP_JMP) {
3305 // yet another alignment type..
3306 po->flags |= OPF_RMD|OPF_DONE;
3309 add_label_ref(&g_label_refs[l], i);
3315 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3318 if (po->operand[0].type == OPT_LABEL)
3322 ferr(po, "unhandled branch\n");
3326 po->flags |= OPF_TAIL;
3327 if (i > 0 && ops[i - 1].op == OP_POP)
3328 po->flags |= OPF_ATAIL;
3333 static void scan_prologue_epilogue(int opcnt)
3335 int ecx_push = 0, esp_sub = 0;
3339 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3340 && ops[1].op == OP_MOV
3341 && IS(opr_name(&ops[1], 0), "ebp")
3342 && IS(opr_name(&ops[1], 1), "esp"))
3345 ops[0].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3346 ops[1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3349 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
3350 g_stack_fsz = opr_const(&ops[2], 1);
3351 ops[2].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3355 // another way msvc builds stack frame..
3357 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3359 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3363 // and another way..
3364 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3365 && ops[i].operand[1].type == OPT_CONST
3366 && ops[i + 1].op == OP_CALL
3367 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3369 g_stack_fsz += ops[i].operand[1].val;
3370 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3372 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3379 for (; i < opcnt; i++)
3380 if (ops[i].flags & OPF_TAIL)
3383 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3384 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3390 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3391 || ops[j].op == OP_LEAVE)
3393 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3395 else if (ops[i].op == OP_CALL && ops[i].pp != NULL
3396 && ops[i].pp->is_noreturn)
3398 // on noreturn, msvc sometimes cleans stack, sometimes not
3403 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3404 ferr(&ops[j], "'pop ebp' expected\n");
3406 if (g_stack_fsz != 0) {
3407 if (ops[j].op == OP_LEAVE)
3409 else if (ops[j].op == OP_POP
3410 && ops[j - 1].op == OP_MOV
3411 && IS(opr_name(&ops[j - 1], 0), "esp")
3412 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3414 ops[j - 1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3417 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3419 ferr(&ops[j], "esp restore expected\n");
3422 if (ecx_push && j >= 0 && ops[j].op == OP_POP
3423 && IS(opr_name(&ops[j], 0), "ecx"))
3425 ferr(&ops[j], "unexpected ecx pop\n");
3431 } while (i < opcnt);
3434 ferr(ops, "missing ebp epilogue\n");
3440 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3441 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3447 for (; i < opcnt; i++) {
3448 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3450 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3451 && ops[i].operand[1].type == OPT_CONST)
3453 g_stack_fsz = ops[i].operand[1].val;
3454 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3460 if (ecx_push && !esp_sub) {
3461 // could actually be args for a call..
3462 for (; i < opcnt; i++)
3463 if (ops[i].op != OP_PUSH)
3466 if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) {
3467 const struct parsed_proto *pp;
3468 pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1);
3469 j = pp ? pp->argc_stack : 0;
3470 while (i > 0 && j > 0) {
3472 if (ops[i].op == OP_PUSH) {
3473 ops[i].flags &= ~(OPF_RMD | OPF_DONE | OPF_NOREGS);
3478 ferr(&ops[i], "unhandled prologue\n");
3481 i = g_stack_fsz = ecx_push = 0;
3482 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3483 if (!(ops[i].flags & OPF_RMD))
3493 if (ecx_push || esp_sub)
3499 for (; i < opcnt; i++)
3500 if (ops[i].flags & OPF_TAIL)
3503 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3504 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3511 for (l = 0; l < ecx_push; l++) {
3512 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx"))
3514 else if (ops[j].op == OP_ADD
3515 && IS(opr_name(&ops[j], 0), "esp")
3516 && ops[j].operand[1].type == OPT_CONST)
3519 l += ops[j].operand[1].val / 4 - 1;
3522 ferr(&ops[j], "'pop ecx' expected\n");
3524 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3528 ferr(&ops[j], "epilogue scan failed\n");
3534 if (ops[j].op != OP_ADD
3535 || !IS(opr_name(&ops[j], 0), "esp")
3536 || ops[j].operand[1].type != OPT_CONST
3537 || ops[j].operand[1].val != g_stack_fsz)
3538 ferr(&ops[j], "'add esp' expected\n");
3540 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3541 ops[j].operand[1].val = 0; // hack for stack arg scanner
3546 } while (i < opcnt);
3549 ferr(ops, "missing esp epilogue\n");
3553 static const struct parsed_proto *resolve_icall(int i, int opcnt,
3554 int *pp_i, int *multi_src)
3556 const struct parsed_proto *pp = NULL;
3557 int search_advice = 0;
3562 switch (ops[i].operand[0].type) {
3566 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
3571 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
3579 // find an instruction that changed opr before i op
3580 // *op_i must be set to -1 by the caller
3581 // *entry is set to 1 if one source is determined to be the caller
3582 // returns 1 if found, *op_i is then set to origin
3583 static int resolve_origin(int i, const struct parsed_opr *opr,
3584 int magic, int *op_i, int *is_caller)
3586 struct label_ref *lr;
3589 if (ops[i].cc_scratch == magic)
3591 ops[i].cc_scratch = magic;
3594 if (g_labels[i] != NULL) {
3595 lr = &g_label_refs[i];
3596 for (; lr != NULL; lr = lr->next) {
3597 check_i(&ops[i], lr->i);
3598 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
3600 if (i > 0 && LAST_OP(i - 1))
3606 if (is_caller != NULL)
3611 if (ops[i].cc_scratch == magic)
3613 ops[i].cc_scratch = magic;
3615 if (!(ops[i].flags & OPF_DATA))
3617 if (!is_opr_modified(opr, &ops[i]))
3624 // XXX: could check if the other op does the same
3633 // find an instruction that previously referenced opr
3634 // if multiple results are found - fail
3635 // *op_i must be set to -1 by the caller
3636 // returns 1 if found, *op_i is then set to referencer insn
3637 static int resolve_last_ref(int i, const struct parsed_opr *opr,
3638 int magic, int *op_i)
3640 struct label_ref *lr;
3643 if (ops[i].cc_scratch == magic)
3645 ops[i].cc_scratch = magic;
3648 if (g_labels[i] != NULL) {
3649 lr = &g_label_refs[i];
3650 for (; lr != NULL; lr = lr->next) {
3651 check_i(&ops[i], lr->i);
3652 ret |= resolve_last_ref(lr->i, opr, magic, op_i);
3654 if (i > 0 && LAST_OP(i - 1))
3662 if (ops[i].cc_scratch == magic)
3664 ops[i].cc_scratch = magic;
3666 if (!is_opr_referenced(opr, &ops[i]))
3677 // find next instruction that reads opr
3678 // *op_i must be set to -1 by the caller
3679 // on return, *op_i is set to first referencer insn
3680 // returns 1 if exactly 1 referencer is found
3681 static int find_next_read(int i, int opcnt,
3682 const struct parsed_opr *opr, int magic, int *op_i)
3684 struct parsed_op *po;
3687 for (; i < opcnt; i++)
3689 if (ops[i].cc_scratch == magic)
3691 ops[i].cc_scratch = magic;
3694 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
3695 if (po->btj != NULL) {
3697 for (j = 0; j < po->btj->count; j++) {
3698 check_i(po, po->btj->d[j].bt_i);
3699 ret |= find_next_read(po->btj->d[j].bt_i, opcnt, opr,
3705 if (po->flags & OPF_RMD)
3707 check_i(po, po->bt_i);
3708 if (po->flags & OPF_CJMP) {
3709 ret |= find_next_read(po->bt_i, opcnt, opr, magic, op_i);
3718 if (!is_opr_read(opr, po)) {
3719 if (is_opr_modified(opr, po)
3720 && (po->op == OP_CALL
3721 || ((po->flags & OPF_DATA)
3722 && po->operand[0].lmod == OPLM_DWORD)))
3727 if (po->flags & OPF_TAIL)
3742 static int try_resolve_const(int i, const struct parsed_opr *opr,
3743 int magic, unsigned int *val)
3748 ret = resolve_origin(i, opr, magic, &s_i, NULL);
3751 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
3754 *val = ops[i].operand[1].val;
3761 static struct parsed_proto *process_call_early(int i, int opcnt,
3764 struct parsed_op *po = &ops[i];
3765 struct parsed_proto *pp;
3771 if (pp == NULL || pp->is_vararg || pp->argc_reg != 0)
3775 // look for and make use of esp adjust
3777 if (!pp->is_stdcall && pp->argc_stack > 0)
3778 ret = scan_for_esp_adjust(i + 1, opcnt,
3779 pp->argc_stack * 4, &adj, &multipath, 0);
3781 if (pp->argc_stack > adj / 4)
3785 if (ops[ret].op == OP_POP) {
3786 for (j = 1; j < adj / 4; j++) {
3787 if (ops[ret + j].op != OP_POP
3788 || ops[ret + j].operand[0].reg != xCX)
3800 static struct parsed_proto *process_call(int i, int opcnt)
3802 struct parsed_op *po = &ops[i];
3803 const struct parsed_proto *pp_c;
3804 struct parsed_proto *pp;
3805 const char *tmpname;
3806 int call_i = -1, ref_i = -1;
3807 int adj = 0, multipath = 0;
3810 tmpname = opr_name(po, 0);
3815 pp_c = resolve_icall(i, opcnt, &call_i, &multipath);
3817 if (!pp_c->is_func && !pp_c->is_fptr)
3818 ferr(po, "call to non-func: %s\n", pp_c->name);
3819 pp = proto_clone(pp_c);
3820 my_assert_not(pp, NULL);
3822 // not resolved just to single func
3825 switch (po->operand[0].type) {
3827 // we resolved this call and no longer need the register
3828 po->regmask_src &= ~(1 << po->operand[0].reg);
3830 if (!multipath && i != call_i && ops[call_i].op == OP_MOV
3831 && ops[call_i].operand[1].type == OPT_LABEL)
3833 // no other source users?
3834 ret = resolve_last_ref(i, &po->operand[0], i + opcnt * 10,
3836 if (ret == 1 && call_i == ref_i) {
3837 // and nothing uses it after us?
3839 find_next_read(i + 1, opcnt, &po->operand[0],
3840 i + opcnt * 11, &ref_i);
3842 // then also don't need the source mov
3843 ops[call_i].flags |= OPF_RMD | OPF_NOREGS;
3855 pp = calloc(1, sizeof(*pp));
3856 my_assert_not(pp, NULL);
3859 ret = scan_for_esp_adjust(i + 1, opcnt,
3860 -1, &adj, &multipath, 0);
3861 if (ret < 0 || adj < 0) {
3862 if (!g_allow_regfunc)
3863 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3864 pp->is_unresolved = 1;
3868 if (adj > ARRAY_SIZE(pp->arg))
3869 ferr(po, "esp adjust too large: %d\n", adj);
3870 pp->ret_type.name = strdup("int");
3871 pp->argc = pp->argc_stack = adj;
3872 for (arg = 0; arg < pp->argc; arg++)
3873 pp->arg[arg].type.name = strdup("int");
3878 // look for and make use of esp adjust
3881 if (!pp->is_stdcall && pp->argc_stack > 0) {
3882 int adj_expect = pp->is_vararg ? -1 : pp->argc_stack * 4;
3883 ret = scan_for_esp_adjust(i + 1, opcnt,
3884 adj_expect, &adj, &multipath, 0);
3887 if (pp->is_vararg) {
3888 if (adj / 4 < pp->argc_stack) {
3889 fnote(po, "(this call)\n");
3890 ferr(&ops[ret], "esp adjust is too small: %x < %x\n",
3891 adj, pp->argc_stack * 4);
3893 // modify pp to make it have varargs as normal args
3895 pp->argc += adj / 4 - pp->argc_stack;
3896 for (; arg < pp->argc; arg++) {
3897 pp->arg[arg].type.name = strdup("int");
3900 if (pp->argc > ARRAY_SIZE(pp->arg))
3901 ferr(po, "too many args for '%s'\n", tmpname);
3903 if (pp->argc_stack > adj / 4) {
3904 fnote(po, "(this call)\n");
3905 ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n",
3906 tmpname, pp->argc_stack * 4, adj);
3909 scan_for_esp_adjust(i + 1, opcnt,
3910 pp->argc_stack * 4, &adj, &multipath, 1);
3912 else if (pp->is_vararg)
3913 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3919 static int collect_call_args_early(struct parsed_op *po, int i,
3920 struct parsed_proto *pp, int *regmask)
3925 for (arg = 0; arg < pp->argc; arg++)
3926 if (pp->arg[arg].reg == NULL)
3929 // first see if it can be easily done
3930 for (j = i; j > 0 && arg < pp->argc; )
3932 if (g_labels[j] != NULL)
3936 if (ops[j].op == OP_CALL)
3938 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP)
3940 else if (ops[j].op == OP_POP)
3942 else if (ops[j].flags & OPF_CJMP)
3944 else if (ops[j].op == OP_PUSH) {
3945 if (ops[j].flags & (OPF_FARG|OPF_FARGNR))
3947 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3951 if (pp->arg[arg].type.is_va_list)
3955 for (arg++; arg < pp->argc; arg++)
3956 if (pp->arg[arg].reg == NULL)
3965 for (arg = 0; arg < pp->argc; arg++)
3966 if (pp->arg[arg].reg == NULL)
3969 for (j = i; j > 0 && arg < pp->argc; )
3973 if (ops[j].op == OP_PUSH)
3975 ops[j].p_argnext = -1;
3976 ferr_assert(&ops[j], pp->arg[arg].datap == NULL);
3977 pp->arg[arg].datap = &ops[j];
3979 if (ops[j].operand[0].type == OPT_REG)
3980 *regmask |= 1 << ops[j].operand[0].reg;
3982 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
3983 ops[j].flags &= ~OPF_RSAVE;
3986 for (arg++; arg < pp->argc; arg++)
3987 if (pp->arg[arg].reg == NULL)
3995 static int collect_call_args_r(struct parsed_op *po, int i,
3996 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3997 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
3999 struct parsed_proto *pp_tmp;
4000 struct parsed_op *po_tmp;
4001 struct label_ref *lr;
4002 int need_to_save_current;
4003 int arg_grp_current = 0;
4004 int save_args_seen = 0;
4012 ferr(po, "dead label encountered\n");
4016 for (; arg < pp->argc; arg++)
4017 if (pp->arg[arg].reg == NULL)
4019 magic = (magic & 0xffffff) | (arg << 24);
4021 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
4023 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
4024 if (ops[j].cc_scratch != magic) {
4025 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
4029 // ok: have already been here
4032 ops[j].cc_scratch = magic;
4034 if (g_labels[j] != NULL && g_label_refs[j].i != -1) {
4035 lr = &g_label_refs[j];
4036 if (lr->next != NULL)
4038 for (; lr->next; lr = lr->next) {
4039 check_i(&ops[j], lr->i);
4040 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4042 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4043 arg_grp, arg, magic, need_op_saving, may_reuse);
4048 check_i(&ops[j], lr->i);
4049 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4051 if (j > 0 && LAST_OP(j - 1)) {
4052 // follow last branch in reverse
4057 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4058 arg_grp, arg, magic, need_op_saving, may_reuse);
4064 if (ops[j].op == OP_CALL)
4066 if (pp->is_unresolved)
4071 ferr(po, "arg collect hit unparsed call '%s'\n",
4072 ops[j].operand[0].name);
4073 if (may_reuse && pp_tmp->argc_stack > 0)
4074 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
4075 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
4077 // esp adjust of 0 means we collected it before
4078 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
4079 && (ops[j].operand[1].type != OPT_CONST
4080 || ops[j].operand[1].val != 0))
4082 if (pp->is_unresolved)
4085 fnote(po, "(this call)\n");
4086 ferr(&ops[j], "arg collect %d/%d hit esp adjust of %d\n",
4087 arg, pp->argc, ops[j].operand[1].val);
4089 else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_DONE))
4091 if (pp->is_unresolved)
4094 fnote(po, "(this call)\n");
4095 ferr(&ops[j], "arg collect %d/%d hit pop\n", arg, pp->argc);
4097 else if (ops[j].flags & OPF_CJMP)
4099 if (pp->is_unresolved)
4104 else if (ops[j].op == OP_PUSH
4105 && !(ops[j].flags & (OPF_FARGNR|OPF_DONE)))
4107 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
4110 ops[j].p_argnext = -1;
4111 po_tmp = pp->arg[arg].datap;
4113 ops[j].p_argnext = po_tmp - ops;
4114 pp->arg[arg].datap = &ops[j];
4116 need_to_save_current = 0;
4119 if (ops[j].operand[0].type == OPT_REG)
4120 reg = ops[j].operand[0].reg;
4122 if (!need_op_saving) {
4123 ret = scan_for_mod(&ops[j], j + 1, i, 1);
4124 need_to_save_current = (ret >= 0);
4126 if (need_op_saving || need_to_save_current) {
4127 // mark this push as one that needs operand saving
4128 ops[j].flags &= ~OPF_RMD;
4129 if (ops[j].p_argnum == 0) {
4130 ops[j].p_argnum = arg + 1;
4131 save_args |= 1 << arg;
4133 else if (ops[j].p_argnum < arg + 1) {
4134 // XXX: might kill valid var..
4135 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
4136 ops[j].p_argnum = arg + 1;
4137 save_args |= 1 << arg;
4140 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
4143 if (arg_grp_current >= MAX_ARG_GRP)
4144 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
4145 ops[j].p_argnum, pp->name);
4148 else if (ops[j].p_argnum == 0)
4149 ops[j].flags |= OPF_RMD;
4151 // some PUSHes are reused by different calls on other branches,
4152 // but that can't happen if we didn't branch, so they
4153 // can be removed from future searches (handles nested calls)
4155 ops[j].flags |= OPF_FARGNR;
4157 ops[j].flags |= OPF_FARG;
4158 ops[j].flags &= ~OPF_RSAVE;
4160 // check for __VALIST
4161 if (!pp->is_unresolved && g_func_pp != NULL
4162 && pp->arg[arg].type.is_va_list)
4165 ret = resolve_origin(j, &ops[j].operand[0],
4166 magic + 1, &k, NULL);
4167 if (ret == 1 && k >= 0)
4169 if (ops[k].op == OP_LEA) {
4170 if (!g_func_pp->is_vararg)
4171 ferr(&ops[k], "lea <arg> used, but %s is not vararg?\n",
4174 snprintf(buf, sizeof(buf), "arg_%X",
4175 g_func_pp->argc_stack * 4);
4176 if (strstr(ops[k].operand[1].name, buf)
4177 || strstr(ops[k].operand[1].name, "arglist"))
4179 ops[k].flags |= OPF_RMD | OPF_NOREGS | OPF_DONE;
4180 ops[j].flags |= OPF_RMD | OPF_NOREGS | OPF_VAPUSH;
4181 save_args &= ~(1 << arg);
4185 ferr(&ops[k], "va_list arg detection failed\n");
4187 // check for va_list from g_func_pp arg too
4188 else if (ops[k].op == OP_MOV
4189 && is_stack_access(&ops[k], &ops[k].operand[1]))
4191 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
4192 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
4194 ops[k].flags |= OPF_RMD | OPF_DONE;
4195 ops[j].flags |= OPF_RMD;
4196 ops[j].p_argpass = ret + 1;
4197 save_args &= ~(1 << arg);
4204 *save_arg_vars |= save_args;
4206 // tracking reg usage
4208 *regmask |= 1 << reg;
4211 if (!pp->is_unresolved) {
4213 for (; arg < pp->argc; arg++)
4214 if (pp->arg[arg].reg == NULL)
4217 magic = (magic & 0xffffff) | (arg << 24);
4220 if (ops[j].p_arggrp > arg_grp_current) {
4222 arg_grp_current = ops[j].p_arggrp;
4224 if (ops[j].p_argnum > 0)
4225 save_args_seen |= 1 << (ops[j].p_argnum - 1);
4228 if (arg < pp->argc) {
4229 ferr(po, "arg collect failed for '%s': %d/%d\n",
4230 pp->name, arg, pp->argc);
4234 if (arg_grp_current > *arg_grp)
4235 *arg_grp = arg_grp_current;
4240 static int collect_call_args(struct parsed_op *po, int i,
4241 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
4244 // arg group is for cases when pushes for
4245 // multiple funcs are going on
4246 struct parsed_op *po_tmp;
4247 int save_arg_vars_current = 0;
4252 ret = collect_call_args_r(po, i, pp, regmask,
4253 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
4258 // propagate arg_grp
4259 for (a = 0; a < pp->argc; a++) {
4260 if (pp->arg[a].reg != NULL)
4263 po_tmp = pp->arg[a].datap;
4264 while (po_tmp != NULL) {
4265 po_tmp->p_arggrp = arg_grp;
4266 if (po_tmp->p_argnext > 0)
4267 po_tmp = &ops[po_tmp->p_argnext];
4273 save_arg_vars[arg_grp] |= save_arg_vars_current;
4275 if (pp->is_unresolved) {
4277 pp->argc_stack += ret;
4278 for (a = 0; a < pp->argc; a++)
4279 if (pp->arg[a].type.name == NULL)
4280 pp->arg[a].type.name = strdup("int");
4286 static void reg_use_pass(int i, int opcnt, unsigned char *cbits,
4287 int regmask_now, int *regmask,
4288 int regmask_save_now, int *regmask_save,
4289 int *regmask_init, int regmask_arg)
4291 struct parsed_op *po;
4299 for (; i < opcnt; i++)
4302 if (cbits[i >> 3] & (1 << (i & 7)))
4304 cbits[i >> 3] |= (1 << (i & 7));
4306 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
4307 if (po->flags & (OPF_RMD|OPF_DONE))
4309 if (po->btj != NULL) {
4310 for (j = 0; j < po->btj->count; j++) {
4311 check_i(po, po->btj->d[j].bt_i);
4312 reg_use_pass(po->btj->d[j].bt_i, opcnt, cbits,
4313 regmask_now, regmask, regmask_save_now, regmask_save,
4314 regmask_init, regmask_arg);
4319 check_i(po, po->bt_i);
4320 if (po->flags & OPF_CJMP)
4321 reg_use_pass(po->bt_i, opcnt, cbits,
4322 regmask_now, regmask, regmask_save_now, regmask_save,
4323 regmask_init, regmask_arg);
4329 if (po->op == OP_PUSH && !(po->flags & (OPF_FARG|OPF_DONE))
4330 && !g_func_pp->is_userstack
4331 && po->operand[0].type == OPT_REG)
4333 reg = po->operand[0].reg;
4334 ferr_assert(po, reg >= 0);
4337 flags_set = OPF_RSAVE | OPF_RMD | OPF_DONE;
4338 if (regmask_now & (1 << reg)) {
4339 already_saved = regmask_save_now & (1 << reg);
4340 flags_set = OPF_RSAVE | OPF_DONE;
4343 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, 0);
4345 scan_for_pop(i + 1, opcnt, i + opcnt * 4, reg, 0, flags_set);
4348 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
4350 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg,
4355 ferr_assert(po, !already_saved);
4356 po->flags |= flags_set;
4358 if (regmask_now & (1 << reg)) {
4359 regmask_save_now |= (1 << reg);
4360 *regmask_save |= regmask_save_now;
4365 else if (po->op == OP_POP && (po->flags & OPF_RSAVE)) {
4366 reg = po->operand[0].reg;
4367 ferr_assert(po, reg >= 0);
4369 if (regmask_save_now & (1 << reg))
4370 regmask_save_now &= ~(1 << reg);
4372 regmask_now &= ~(1 << reg);
4375 else if (po->op == OP_CALL) {
4376 if ((po->regmask_dst & (1 << xAX))
4377 && !(po->regmask_dst & (1 << xDX)))
4379 if (po->flags & OPF_TAIL)
4380 // don't need eax, will do "return f();" or "f(); return;"
4381 po->regmask_dst &= ~(1 << xAX);
4383 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
4385 find_next_read(i + 1, opcnt, &opr, i + opcnt * 17, &j);
4388 po->regmask_dst &= ~(1 << xAX);
4393 if (po->flags & OPF_NOREGS)
4396 // if incomplete register is used, clear it on init to avoid
4397 // later use of uninitialized upper part in some situations
4398 if ((po->flags & OPF_DATA) && po->operand[0].type == OPT_REG
4399 && po->operand[0].lmod != OPLM_DWORD)
4401 reg = po->operand[0].reg;
4402 ferr_assert(po, reg >= 0);
4404 if (!(regmask_now & (1 << reg)))
4405 *regmask_init |= 1 << reg;
4408 regmask_op = po->regmask_src | po->regmask_dst;
4410 regmask_new = po->regmask_src & ~regmask_now & ~regmask_arg;
4411 regmask_new &= ~(1 << xSP);
4412 if (g_bp_frame && !(po->flags & OPF_EBP_S))
4413 regmask_new &= ~(1 << xBP);
4415 if (po->op == OP_CALL) {
4416 // allow fastcall calls from anywhere, calee may be also sitting
4417 // in some fastcall table even when it's not using reg args
4418 if (regmask_new & po->regmask_src & (1 << xCX)) {
4419 *regmask_init |= (1 << xCX);
4420 regmask_now |= (1 << xCX);
4421 regmask_new &= ~(1 << xCX);
4423 if (regmask_new & po->regmask_src & (1 << xDX)) {
4424 *regmask_init |= (1 << xDX);
4425 regmask_now |= (1 << xDX);
4426 regmask_new &= ~(1 << xDX);
4430 if (regmask_new != 0)
4431 fnote(po, "uninitialized reg mask: %x\n", regmask_new);
4433 if (regmask_op & (1 << xBP)) {
4434 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
4435 if (po->regmask_dst & (1 << xBP))
4436 // compiler decided to drop bp frame and use ebp as scratch
4437 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
4439 regmask_op &= ~(1 << xBP);
4443 regmask_now |= regmask_op;
4444 *regmask |= regmask_now;
4446 if (po->flags & OPF_TAIL)
4451 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
4455 for (i = 0; i < pp->argc; i++)
4456 if (pp->arg[i].reg == NULL)
4460 memmove(&pp->arg[i + 1], &pp->arg[i],
4461 sizeof(pp->arg[0]) * pp->argc_stack);
4462 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
4463 pp->arg[i].reg = strdup(reg);
4464 pp->arg[i].type.name = strdup("int");
4469 static void output_std_flags(FILE *fout, struct parsed_op *po,
4470 int *pfomask, const char *dst_opr_text)
4472 if (*pfomask & (1 << PFO_Z)) {
4473 fprintf(fout, "\n cond_z = (%s%s == 0);",
4474 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
4475 *pfomask &= ~(1 << PFO_Z);
4477 if (*pfomask & (1 << PFO_S)) {
4478 fprintf(fout, "\n cond_s = (%s%s < 0);",
4479 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
4480 *pfomask &= ~(1 << PFO_S);
4485 OPP_FORCE_NORETURN = (1 << 0),
4486 OPP_SIMPLE_ARGS = (1 << 1),
4487 OPP_ALIGN = (1 << 2),
4490 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
4493 const char *cconv = "";
4495 if (pp->is_fastcall)
4496 cconv = "__fastcall ";
4497 else if (pp->is_stdcall && pp->argc_reg == 0)
4498 cconv = "__stdcall ";
4500 fprintf(fout, (flags & OPP_ALIGN) ? "%-16s" : "%s", cconv);
4502 if (pp->is_noreturn || (flags & OPP_FORCE_NORETURN))
4503 fprintf(fout, "noreturn ");
4506 static void output_pp(FILE *fout, const struct parsed_proto *pp,
4511 fprintf(fout, (flags & OPP_ALIGN) ? "%-5s" : "%s ",
4515 output_pp_attrs(fout, pp, flags);
4518 fprintf(fout, "%s", pp->name);
4523 for (i = 0; i < pp->argc; i++) {
4525 fprintf(fout, ", ");
4526 if (pp->arg[i].fptr != NULL && !(flags & OPP_SIMPLE_ARGS)) {
4528 output_pp(fout, pp->arg[i].fptr, 0);
4530 else if (pp->arg[i].type.is_retreg) {
4531 fprintf(fout, "u32 *r_%s", pp->arg[i].reg);
4534 fprintf(fout, "%s", pp->arg[i].type.name);
4536 fprintf(fout, " a%d", i + 1);
4539 if (pp->is_vararg) {
4541 fprintf(fout, ", ");
4542 fprintf(fout, "...");
4547 static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
4553 snprintf(buf1, sizeof(buf1), "%d", grp);
4554 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
4559 static void gen_x_cleanup(int opcnt);
4561 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
4563 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
4564 struct parsed_opr *last_arith_dst = NULL;
4565 char buf1[256], buf2[256], buf3[256], cast[64];
4566 struct parsed_proto *pp, *pp_tmp;
4567 struct parsed_data *pd;
4569 int save_arg_vars[MAX_ARG_GRP] = { 0, };
4570 unsigned char cbits[MAX_OPS / 8];
4572 int need_tmp_var = 0;
4575 int label_pending = 0;
4576 int regmask_save = 0; // regs saved/restored in this func
4577 int regmask_arg; // regs from this function args (fastcall, etc)
4578 int regmask_ret; // regs needed on ret
4579 int regmask_now; // temp
4580 int regmask_init = 0; // regs that need zero initialization
4581 int regmask_pp = 0; // regs used in complex push-pop graph
4582 int regmask = 0; // used regs
4591 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
4592 g_stack_frame_used = 0;
4594 g_func_pp = proto_parse(fhdr, funcn, 0);
4595 if (g_func_pp == NULL)
4596 ferr(ops, "proto_parse failed for '%s'\n", funcn);
4598 regmask_arg = get_pp_arg_regmask_src(g_func_pp);
4599 regmask_ret = get_pp_arg_regmask_dst(g_func_pp);
4601 if (g_func_pp->has_retreg) {
4602 for (arg = 0; arg < g_func_pp->argc; arg++) {
4603 if (g_func_pp->arg[arg].type.is_retreg) {
4604 reg = char_array_i(regs_r32,
4605 ARRAY_SIZE(regs_r32), g_func_pp->arg[arg].reg);
4606 ferr_assert(ops, reg >= 0);
4607 regmask_ret |= 1 << reg;
4613 // - resolve all branches
4614 // - parse calls with labels
4615 resolve_branches_parse_calls(opcnt);
4618 // - handle ebp/esp frame, remove ops related to it
4619 scan_prologue_epilogue(opcnt);
4622 // - remove dead labels
4623 // - set regs needed at ret
4624 for (i = 0; i < opcnt; i++)
4626 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
4631 if (ops[i].op == OP_RET)
4632 ops[i].regmask_src |= regmask_ret;
4636 // - process trivial calls
4637 for (i = 0; i < opcnt; i++)
4640 if (po->flags & (OPF_RMD|OPF_DONE))
4643 if (po->op == OP_CALL)
4645 pp = process_call_early(i, opcnt, &j);
4647 if (!(po->flags & OPF_ATAIL))
4648 // since we know the args, try to collect them
4649 if (collect_call_args_early(po, i, pp, ®mask) != 0)
4655 // commit esp adjust
4656 if (ops[j].op != OP_POP)
4657 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
4659 for (l = 0; l < pp->argc_stack; l++)
4660 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
4664 if (strstr(pp->ret_type.name, "int64"))
4667 po->flags |= OPF_DONE;
4673 // - process calls, stage 2
4674 // - handle some push/pop pairs
4675 // - scan for STD/CLD, propagate DF
4676 for (i = 0; i < opcnt; i++)
4679 if (po->flags & OPF_RMD)
4682 if (po->op == OP_CALL)
4684 if (!(po->flags & OPF_DONE)) {
4685 pp = process_call(i, opcnt);
4687 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
4688 // since we know the args, collect them
4689 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4692 // for unresolved, collect after other passes
4696 ferr_assert(po, pp != NULL);
4698 po->regmask_src |= get_pp_arg_regmask_src(pp);
4699 po->regmask_dst |= get_pp_arg_regmask_dst(pp);
4701 if (strstr(pp->ret_type.name, "int64"))
4707 if (po->flags & OPF_DONE)
4710 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)
4711 && !(po->flags & OPF_RSAVE) && po->operand[0].type == OPT_CONST)
4713 scan_for_pop_const(i, opcnt, i + opcnt * 12);
4715 else if (po->op == OP_POP)
4716 scan_pushes_for_pop(i, opcnt, ®mask_pp);
4717 else if (po->op == OP_STD) {
4718 po->flags |= OPF_DF | OPF_RMD | OPF_DONE;
4719 scan_propagate_df(i + 1, opcnt);
4724 // - find POPs for PUSHes, rm both
4725 // - scan for all used registers
4726 memset(cbits, 0, sizeof(cbits));
4727 reg_use_pass(0, opcnt, cbits, 0, ®mask,
4728 0, ®mask_save, ®mask_init, regmask_arg);
4731 // - find flag set ops for their users
4732 // - do unresolved calls
4733 // - declare indirect functions
4734 for (i = 0; i < opcnt; i++)
4737 if (po->flags & (OPF_RMD|OPF_DONE))
4740 if (po->flags & OPF_CC)
4742 int setters[16], cnt = 0, branched = 0;
4744 ret = scan_for_flag_set(i, i + opcnt * 6,
4745 &branched, setters, &cnt);
4746 if (ret < 0 || cnt <= 0)
4747 ferr(po, "unable to trace flag setter(s)\n");
4748 if (cnt > ARRAY_SIZE(setters))
4749 ferr(po, "too many flag setters\n");
4751 for (j = 0; j < cnt; j++)
4753 tmp_op = &ops[setters[j]]; // flag setter
4756 // to get nicer code, we try to delay test and cmp;
4757 // if we can't because of operand modification, or if we
4758 // have arith op, or branch, make it calculate flags explicitly
4759 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
4761 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
4762 pfomask = 1 << po->pfo;
4764 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
4765 pfomask = 1 << po->pfo;
4768 // see if we'll be able to handle based on op result
4769 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
4770 && po->pfo != PFO_Z && po->pfo != PFO_S
4771 && po->pfo != PFO_P)
4773 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
4775 pfomask = 1 << po->pfo;
4778 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
4779 propagate_lmod(tmp_op, &tmp_op->operand[0],
4780 &tmp_op->operand[1]);
4781 if (tmp_op->operand[0].lmod == OPLM_DWORD)
4786 tmp_op->pfomask |= pfomask;
4787 cond_vars |= pfomask;
4789 // note: may overwrite, currently not a problem
4793 if (po->op == OP_RCL || po->op == OP_RCR
4794 || po->op == OP_ADC || po->op == OP_SBB)
4795 cond_vars |= 1 << PFO_C;
4798 if (po->op == OP_CMPS || po->op == OP_SCAS) {
4799 cond_vars |= 1 << PFO_Z;
4801 else if (po->op == OP_MUL
4802 || (po->op == OP_IMUL && po->operand_cnt == 1))
4804 if (po->operand[0].lmod == OPLM_DWORD)
4807 else if (po->op == OP_CALL) {
4808 // note: resolved non-reg calls are OPF_DONE already
4810 ferr_assert(po, pp != NULL);
4812 if (pp->is_unresolved) {
4813 int regmask_stack = 0;
4814 collect_call_args(po, i, pp, ®mask, save_arg_vars,
4817 // this is pretty rough guess:
4818 // see ecx and edx were pushed (and not their saved versions)
4819 for (arg = 0; arg < pp->argc; arg++) {
4820 if (pp->arg[arg].reg != NULL)
4823 tmp_op = pp->arg[arg].datap;
4825 ferr(po, "parsed_op missing for arg%d\n", arg);
4826 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
4827 regmask_stack |= 1 << tmp_op->operand[0].reg;
4830 if (!((regmask_stack & (1 << xCX))
4831 && (regmask_stack & (1 << xDX))))
4833 if (pp->argc_stack != 0
4834 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
4836 pp_insert_reg_arg(pp, "ecx");
4837 pp->is_fastcall = 1;
4838 regmask_init |= 1 << xCX;
4839 regmask |= 1 << xCX;
4841 if (pp->argc_stack != 0
4842 || ((regmask | regmask_arg) & (1 << xDX)))
4844 pp_insert_reg_arg(pp, "edx");
4845 regmask_init |= 1 << xDX;
4846 regmask |= 1 << xDX;
4850 // note: __cdecl doesn't fall into is_unresolved category
4851 if (pp->argc_stack > 0)
4855 else if (po->op == OP_MOV && po->operand[0].pp != NULL
4856 && po->operand[1].pp != NULL)
4858 // <var> = offset <something>
4859 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
4860 && !IS_START(po->operand[1].name, "off_"))
4862 if (!po->operand[0].pp->is_fptr)
4863 ferr(po, "%s not declared as fptr when it should be\n",
4864 po->operand[0].name);
4865 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
4866 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
4867 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
4868 fnote(po, "var: %s\n", buf1);
4869 fnote(po, "func: %s\n", buf2);
4870 ferr(po, "^ mismatch\n");
4874 else if (po->op == OP_DIV || po->op == OP_IDIV) {
4875 if (po->operand[0].lmod == OPLM_DWORD) {
4876 // 32bit division is common, look for it
4877 if (po->op == OP_DIV)
4878 ret = scan_for_reg_clear(i, xDX);
4880 ret = scan_for_cdq_edx(i);
4882 po->flags |= OPF_32BIT;
4889 else if (po->op == OP_CLD)
4890 po->flags |= OPF_RMD | OPF_DONE;
4892 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG)
4896 // output starts here
4898 // define userstack size
4899 if (g_func_pp->is_userstack) {
4900 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
4901 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
4902 fprintf(fout, "#endif\n");
4905 // the function itself
4906 ferr_assert(ops, !g_func_pp->is_fptr);
4907 output_pp(fout, g_func_pp,
4908 (g_ida_func_attr & IDAFA_NORETURN) ? OPP_FORCE_NORETURN : 0);
4909 fprintf(fout, "\n{\n");
4911 // declare indirect functions
4912 for (i = 0; i < opcnt; i++) {
4914 if (po->flags & OPF_RMD)
4917 if (po->op == OP_CALL) {
4920 ferr(po, "NULL pp\n");
4922 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
4923 if (pp->name[0] != 0) {
4924 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
4925 memcpy(pp->name, "i_", 2);
4927 // might be declared already
4929 for (j = 0; j < i; j++) {
4930 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
4931 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
4941 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
4944 output_pp(fout, pp, OPP_SIMPLE_ARGS);
4945 fprintf(fout, ";\n");
4950 // output LUTs/jumptables
4951 for (i = 0; i < g_func_pd_cnt; i++) {
4953 fprintf(fout, " static const ");
4954 if (pd->type == OPT_OFFSET) {
4955 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
4957 for (j = 0; j < pd->count; j++) {
4959 fprintf(fout, ", ");
4960 fprintf(fout, "&&%s", pd->d[j].u.label);
4964 fprintf(fout, "%s %s[] =\n { ",
4965 lmod_type_u(ops, pd->lmod), pd->label);
4967 for (j = 0; j < pd->count; j++) {
4969 fprintf(fout, ", ");
4970 fprintf(fout, "%u", pd->d[j].u.val);
4973 fprintf(fout, " };\n");
4977 // declare stack frame, va_arg
4979 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
4980 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
4984 if (g_func_pp->is_userstack) {
4985 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
4986 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
4990 if (g_func_pp->is_vararg) {
4991 fprintf(fout, " va_list ap;\n");
4995 // declare arg-registers
4996 for (i = 0; i < g_func_pp->argc; i++) {
4997 if (g_func_pp->arg[i].reg != NULL) {
4998 reg = char_array_i(regs_r32,
4999 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
5000 if (regmask & (1 << reg)) {
5001 if (g_func_pp->arg[i].type.is_retreg)
5002 fprintf(fout, " u32 %s = *r_%s;\n",
5003 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
5005 fprintf(fout, " u32 %s = (u32)a%d;\n",
5006 g_func_pp->arg[i].reg, i + 1);
5009 if (g_func_pp->arg[i].type.is_retreg)
5010 ferr(ops, "retreg '%s' is unused?\n",
5011 g_func_pp->arg[i].reg);
5012 fprintf(fout, " // %s = a%d; // unused\n",
5013 g_func_pp->arg[i].reg, i + 1);
5019 // declare normal registers
5020 regmask_now = regmask & ~regmask_arg;
5021 regmask_now &= ~(1 << xSP);
5022 if (regmask_now & 0x00ff) {
5023 for (reg = 0; reg < 8; reg++) {
5024 if (regmask_now & (1 << reg)) {
5025 fprintf(fout, " u32 %s", regs_r32[reg]);
5026 if (regmask_init & (1 << reg))
5027 fprintf(fout, " = 0");
5028 fprintf(fout, ";\n");
5033 if (regmask_now & 0xff00) {
5034 for (reg = 8; reg < 16; reg++) {
5035 if (regmask_now & (1 << reg)) {
5036 fprintf(fout, " mmxr %s", regs_r32[reg]);
5037 if (regmask_init & (1 << reg))
5038 fprintf(fout, " = { 0, }");
5039 fprintf(fout, ";\n");
5046 for (reg = 0; reg < 8; reg++) {
5047 if (regmask_save & (1 << reg)) {
5048 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
5054 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
5055 if (save_arg_vars[i] == 0)
5057 for (reg = 0; reg < 32; reg++) {
5058 if (save_arg_vars[i] & (1 << reg)) {
5059 fprintf(fout, " u32 %s;\n",
5060 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
5066 // declare push-pop temporaries
5068 for (reg = 0; reg < 8; reg++) {
5069 if (regmask_pp & (1 << reg)) {
5070 fprintf(fout, " u32 pp_%s;\n", regs_r32[reg]);
5077 for (i = 0; i < 8; i++) {
5078 if (cond_vars & (1 << i)) {
5079 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
5086 fprintf(fout, " u32 tmp;\n");
5091 fprintf(fout, " u64 tmp64;\n");
5096 fprintf(fout, "\n");
5098 if (g_func_pp->is_vararg) {
5099 if (g_func_pp->argc_stack == 0)
5100 ferr(ops, "vararg func without stack args?\n");
5101 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
5105 for (i = 0; i < opcnt; i++)
5107 if (g_labels[i] != NULL) {
5108 fprintf(fout, "\n%s:\n", g_labels[i]);
5111 delayed_flag_op = NULL;
5112 last_arith_dst = NULL;
5116 if (po->flags & OPF_RMD)
5121 #define assert_operand_cnt(n_) \
5122 if (po->operand_cnt != n_) \
5123 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
5125 // conditional/flag using op?
5126 if (po->flags & OPF_CC)
5132 // we go through all this trouble to avoid using parsed_flag_op,
5133 // which makes generated code much nicer
5134 if (delayed_flag_op != NULL)
5136 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
5137 po->pfo, po->pfo_inv);
5140 else if (last_arith_dst != NULL
5141 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
5142 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
5145 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
5146 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
5147 last_arith_dst->lmod, buf3);
5150 else if (tmp_op != NULL) {
5151 // use preprocessed flag calc results
5152 if (!(tmp_op->pfomask & (1 << po->pfo)))
5153 ferr(po, "not prepared for pfo %d\n", po->pfo);
5155 // note: pfo_inv was not yet applied
5156 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
5157 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
5160 ferr(po, "all methods of finding comparison failed\n");
5163 if (po->flags & OPF_JMP) {
5164 fprintf(fout, " if %s", buf1);
5166 else if (po->op == OP_RCL || po->op == OP_RCR
5167 || po->op == OP_ADC || po->op == OP_SBB)
5170 fprintf(fout, " cond_%s = %s;\n",
5171 parsed_flag_op_names[po->pfo], buf1);
5173 else if (po->flags & OPF_DATA) { // SETcc
5174 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
5175 fprintf(fout, " %s = %s;", buf2, buf1);
5178 ferr(po, "unhandled conditional op\n");
5182 pfomask = po->pfomask;
5184 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
5185 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xCX);
5186 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
5188 if (ret != 1 || uval == 0) {
5189 // we need initial flags for ecx=0 case..
5190 if (i > 0 && ops[i - 1].op == OP_XOR
5191 && IS(ops[i - 1].operand[0].name,
5192 ops[i - 1].operand[1].name))
5194 fprintf(fout, " cond_z = ");
5195 if (pfomask & (1 << PFO_C))
5196 fprintf(fout, "cond_c = ");
5197 fprintf(fout, "0;\n");
5199 else if (last_arith_dst != NULL) {
5200 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
5201 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
5202 last_arith_dst->lmod, buf3);
5203 fprintf(fout, " cond_z = %s;\n", buf1);
5206 ferr(po, "missing initial ZF\n");
5213 assert_operand_cnt(2);
5214 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5215 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5216 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
5217 fprintf(fout, " %s = %s;", buf1,
5218 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5223 assert_operand_cnt(2);
5224 po->operand[1].lmod = OPLM_DWORD; // always
5225 fprintf(fout, " %s = %s;",
5226 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5227 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5232 assert_operand_cnt(2);
5233 fprintf(fout, " %s = %s;",
5234 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5235 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5239 assert_operand_cnt(2);
5240 switch (po->operand[1].lmod) {
5242 strcpy(buf3, "(s8)");
5245 strcpy(buf3, "(s16)");
5248 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
5250 fprintf(fout, " %s = %s;",
5251 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5252 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5257 assert_operand_cnt(2);
5258 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5259 fprintf(fout, " tmp = %s;",
5260 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
5261 fprintf(fout, " %s = %s;",
5262 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5263 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5264 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5265 fprintf(fout, " %s = %stmp;",
5266 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
5267 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
5268 snprintf(g_comment, sizeof(g_comment), "xchg");
5272 assert_operand_cnt(1);
5273 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5274 fprintf(fout, " %s = ~%s;", buf1, buf1);
5278 assert_operand_cnt(2);
5279 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5280 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5281 fprintf(fout, " %s = *(u8 *)(%s + %s);", buf1, buf2, buf1);
5282 strcpy(g_comment, "xlat");
5286 assert_operand_cnt(2);
5287 fprintf(fout, " %s = (s32)%s >> 31;",
5288 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5289 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5290 strcpy(g_comment, "cdq");
5294 if (po->flags & OPF_REP) {
5295 assert_operand_cnt(3);
5300 assert_operand_cnt(2);
5301 fprintf(fout, " eax = %sesi; esi %c= %d;",
5302 lmod_cast_u_ptr(po, po->operand[0].lmod),
5303 (po->flags & OPF_DF) ? '-' : '+',
5304 lmod_bytes(po, po->operand[0].lmod));
5305 strcpy(g_comment, "lods");
5310 if (po->flags & OPF_REP) {
5311 assert_operand_cnt(3);
5312 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
5313 (po->flags & OPF_DF) ? '-' : '+',
5314 lmod_bytes(po, po->operand[0].lmod));
5315 fprintf(fout, " %sedi = eax;",
5316 lmod_cast_u_ptr(po, po->operand[0].lmod));
5317 strcpy(g_comment, "rep stos");
5320 assert_operand_cnt(2);
5321 fprintf(fout, " %sedi = eax; edi %c= %d;",
5322 lmod_cast_u_ptr(po, po->operand[0].lmod),
5323 (po->flags & OPF_DF) ? '-' : '+',
5324 lmod_bytes(po, po->operand[0].lmod));
5325 strcpy(g_comment, "stos");
5330 j = lmod_bytes(po, po->operand[0].lmod);
5331 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
5332 l = (po->flags & OPF_DF) ? '-' : '+';
5333 if (po->flags & OPF_REP) {
5334 assert_operand_cnt(3);
5336 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
5339 " %sedi = %sesi;", buf1, buf1);
5340 strcpy(g_comment, "rep movs");
5343 assert_operand_cnt(2);
5344 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
5345 buf1, buf1, l, j, l, j);
5346 strcpy(g_comment, "movs");
5351 // repe ~ repeat while ZF=1
5352 j = lmod_bytes(po, po->operand[0].lmod);
5353 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
5354 l = (po->flags & OPF_DF) ? '-' : '+';
5355 if (po->flags & OPF_REP) {
5356 assert_operand_cnt(3);
5358 " for (; ecx != 0; ecx--) {\n");
5359 if (pfomask & (1 << PFO_C)) {
5362 " cond_c = %sesi < %sedi;\n", buf1, buf1);
5363 pfomask &= ~(1 << PFO_C);
5366 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
5367 buf1, buf1, l, j, l, j);
5369 " if (cond_z %s 0) break;\n",
5370 (po->flags & OPF_REPZ) ? "==" : "!=");
5373 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
5374 (po->flags & OPF_REPZ) ? "e" : "ne");
5377 assert_operand_cnt(2);
5379 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
5380 buf1, buf1, l, j, l, j);
5381 strcpy(g_comment, "cmps");
5383 pfomask &= ~(1 << PFO_Z);
5384 last_arith_dst = NULL;
5385 delayed_flag_op = NULL;
5389 // only does ZF (for now)
5390 // repe ~ repeat while ZF=1
5391 j = lmod_bytes(po, po->operand[0].lmod);
5392 l = (po->flags & OPF_DF) ? '-' : '+';
5393 if (po->flags & OPF_REP) {
5394 assert_operand_cnt(3);
5396 " for (; ecx != 0; ecx--) {\n");
5398 " cond_z = (%seax == %sedi); edi %c= %d;\n",
5399 lmod_cast_u(po, po->operand[0].lmod),
5400 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
5402 " if (cond_z %s 0) break;\n",
5403 (po->flags & OPF_REPZ) ? "==" : "!=");
5406 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
5407 (po->flags & OPF_REPZ) ? "e" : "ne");
5410 assert_operand_cnt(2);
5411 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
5412 lmod_cast_u(po, po->operand[0].lmod),
5413 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
5414 strcpy(g_comment, "scas");
5416 pfomask &= ~(1 << PFO_Z);
5417 last_arith_dst = NULL;
5418 delayed_flag_op = NULL;
5421 // arithmetic w/flags
5423 if (po->operand[1].type == OPT_CONST && !po->operand[1].val)
5424 goto dualop_arith_const;
5425 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5429 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5430 if (po->operand[1].type == OPT_CONST) {
5431 j = lmod_bytes(po, po->operand[0].lmod);
5432 if (((1ull << j * 8) - 1) == po->operand[1].val)
5433 goto dualop_arith_const;
5438 assert_operand_cnt(2);
5439 fprintf(fout, " %s %s= %s;",
5440 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5442 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5443 output_std_flags(fout, po, &pfomask, buf1);
5444 last_arith_dst = &po->operand[0];
5445 delayed_flag_op = NULL;
5449 // and 0, or ~0 used instead mov
5450 assert_operand_cnt(2);
5451 fprintf(fout, " %s = %s;",
5452 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5453 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
5454 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5455 output_std_flags(fout, po, &pfomask, buf1);
5456 last_arith_dst = &po->operand[0];
5457 delayed_flag_op = NULL;
5462 assert_operand_cnt(2);
5463 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5464 if (pfomask & (1 << PFO_C)) {
5465 if (po->operand[1].type == OPT_CONST) {
5466 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5467 j = po->operand[1].val;
5470 if (po->op == OP_SHL)
5474 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
5478 ferr(po, "zero shift?\n");
5482 pfomask &= ~(1 << PFO_C);
5484 fprintf(fout, " %s %s= %s", buf1, op_to_c(po),
5485 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5486 if (po->operand[1].type != OPT_CONST)
5487 fprintf(fout, " & 0x1f");
5489 output_std_flags(fout, po, &pfomask, buf1);
5490 last_arith_dst = &po->operand[0];
5491 delayed_flag_op = NULL;
5495 assert_operand_cnt(2);
5496 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5497 fprintf(fout, " %s = %s%s >> %s;", buf1,
5498 lmod_cast_s(po, po->operand[0].lmod), buf1,
5499 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5500 output_std_flags(fout, po, &pfomask, buf1);
5501 last_arith_dst = &po->operand[0];
5502 delayed_flag_op = NULL;
5507 assert_operand_cnt(3);
5508 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5509 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5510 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
5511 if (po->operand[2].type != OPT_CONST) {
5512 // no handling for "undefined" case, hopefully not needed
5513 snprintf(buf2, sizeof(buf2), "(%s & 0x1f)", buf3);
5516 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5517 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5518 if (po->op == OP_SHLD) {
5519 fprintf(fout, " %s <<= %s; %s |= %s >> (%d - %s);",
5520 buf1, buf3, buf1, buf2, l, buf3);
5521 strcpy(g_comment, "shld");
5524 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
5525 buf1, buf3, buf1, buf2, l, buf3);
5526 strcpy(g_comment, "shrd");
5528 output_std_flags(fout, po, &pfomask, buf1);
5529 last_arith_dst = &po->operand[0];
5530 delayed_flag_op = NULL;
5535 assert_operand_cnt(2);
5536 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5537 if (po->operand[1].type == OPT_CONST) {
5538 j = po->operand[1].val;
5539 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
5540 fprintf(fout, po->op == OP_ROL ?
5541 " %s = (%s << %d) | (%s >> %d);" :
5542 " %s = (%s >> %d) | (%s << %d);",
5543 buf1, buf1, j, buf1,
5544 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
5548 output_std_flags(fout, po, &pfomask, buf1);
5549 last_arith_dst = &po->operand[0];
5550 delayed_flag_op = NULL;
5555 assert_operand_cnt(2);
5556 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5557 l = lmod_bytes(po, po->operand[0].lmod) * 8;
5558 if (po->operand[1].type == OPT_CONST) {
5559 j = po->operand[1].val % l;
5561 ferr(po, "zero rotate\n");
5562 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
5563 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
5564 if (po->op == OP_RCL) {
5566 " %s = (%s << %d) | (cond_c << %d)",
5567 buf1, buf1, j, j - 1);
5569 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
5573 " %s = (%s >> %d) | (cond_c << %d)",
5574 buf1, buf1, j, l - j);
5576 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
5578 fprintf(fout, ";\n");
5579 fprintf(fout, " cond_c = tmp;");
5583 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
5584 output_std_flags(fout, po, &pfomask, buf1);
5585 last_arith_dst = &po->operand[0];
5586 delayed_flag_op = NULL;
5590 assert_operand_cnt(2);
5591 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5592 if (IS(opr_name(po, 0), opr_name(po, 1))) {
5593 // special case for XOR
5594 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
5595 fprintf(fout, " cond_be = 1;\n");
5596 pfomask &= ~(1 << PFO_BE);
5598 fprintf(fout, " %s = 0;",
5599 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5600 last_arith_dst = &po->operand[0];
5601 delayed_flag_op = NULL;
5607 assert_operand_cnt(2);
5608 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5609 if (pfomask & (1 << PFO_C)) {
5610 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5611 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5612 if (po->operand[0].lmod == OPLM_DWORD) {
5613 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
5614 fprintf(fout, " cond_c = tmp64 >> 32;\n");
5615 fprintf(fout, " %s = (u32)tmp64;",
5616 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5617 strcat(g_comment, "add64");
5620 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
5621 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
5622 fprintf(fout, " %s += %s;",
5623 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5626 pfomask &= ~(1 << PFO_C);
5627 output_std_flags(fout, po, &pfomask, buf1);
5628 last_arith_dst = &po->operand[0];
5629 delayed_flag_op = NULL;
5635 assert_operand_cnt(2);
5636 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5637 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
5638 for (j = 0; j <= PFO_LE; j++) {
5639 if (!(pfomask & (1 << j)))
5641 if (j == PFO_Z || j == PFO_S)
5644 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5645 fprintf(fout, " cond_%s = %s;\n",
5646 parsed_flag_op_names[j], buf1);
5647 pfomask &= ~(1 << j);
5654 assert_operand_cnt(2);
5655 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5656 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5657 if (po->op == OP_SBB
5658 && IS(po->operand[0].name, po->operand[1].name))
5660 // avoid use of unitialized var
5661 fprintf(fout, " %s = -cond_c;", buf1);
5662 // carry remains what it was
5663 pfomask &= ~(1 << PFO_C);
5666 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
5667 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5669 output_std_flags(fout, po, &pfomask, buf1);
5670 last_arith_dst = &po->operand[0];
5671 delayed_flag_op = NULL;
5675 assert_operand_cnt(2);
5676 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
5677 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
5678 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
5680 output_std_flags(fout, po, &pfomask, buf1);
5681 last_arith_dst = &po->operand[0];
5682 delayed_flag_op = NULL;
5683 strcat(g_comment, "bsf");
5687 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
5688 for (j = 0; j <= PFO_LE; j++) {
5689 if (!(pfomask & (1 << j)))
5691 if (j == PFO_Z || j == PFO_S || j == PFO_C)
5694 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
5695 fprintf(fout, " cond_%s = %s;\n",
5696 parsed_flag_op_names[j], buf1);
5697 pfomask &= ~(1 << j);
5703 if (pfomask & (1 << PFO_C))
5704 // carry is unaffected by inc/dec.. wtf?
5705 ferr(po, "carry propagation needed\n");
5707 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5708 if (po->operand[0].type == OPT_REG) {
5709 strcpy(buf2, po->op == OP_INC ? "++" : "--");
5710 fprintf(fout, " %s%s;", buf1, buf2);
5713 strcpy(buf2, po->op == OP_INC ? "+" : "-");
5714 fprintf(fout, " %s %s= 1;", buf1, buf2);
5716 output_std_flags(fout, po, &pfomask, buf1);
5717 last_arith_dst = &po->operand[0];
5718 delayed_flag_op = NULL;
5722 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5723 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
5724 fprintf(fout, " %s = -%s%s;", buf1,
5725 lmod_cast_s(po, po->operand[0].lmod), buf2);
5726 last_arith_dst = &po->operand[0];
5727 delayed_flag_op = NULL;
5728 if (pfomask & (1 << PFO_C)) {
5729 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
5730 pfomask &= ~(1 << PFO_C);
5735 if (po->operand_cnt == 2) {
5736 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5739 if (po->operand_cnt == 3)
5740 ferr(po, "TODO imul3\n");
5743 assert_operand_cnt(1);
5744 switch (po->operand[0].lmod) {
5746 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
5747 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
5748 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
5749 fprintf(fout, " edx = tmp64 >> 32;\n");
5750 fprintf(fout, " eax = tmp64;");
5753 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
5754 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
5755 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
5759 ferr(po, "TODO: unhandled mul type\n");
5762 last_arith_dst = NULL;
5763 delayed_flag_op = NULL;
5768 assert_operand_cnt(1);
5769 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5770 strcpy(cast, lmod_cast(po, po->operand[0].lmod,
5771 po->op == OP_IDIV));
5772 switch (po->operand[0].lmod) {
5774 if (po->flags & OPF_32BIT)
5775 snprintf(buf2, sizeof(buf2), "%seax", cast);
5777 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
5778 snprintf(buf2, sizeof(buf2), "%stmp64",
5779 (po->op == OP_IDIV) ? "(s64)" : "");
5781 if (po->operand[0].type == OPT_REG
5782 && po->operand[0].reg == xDX)
5784 fprintf(fout, " eax = %s / %s%s;\n", buf2, cast, buf1);
5785 fprintf(fout, " edx = %s %% %s%s;", buf2, cast, buf1);
5788 fprintf(fout, " edx = %s %% %s%s;\n", buf2, cast, buf1);
5789 fprintf(fout, " eax = %s / %s%s;", buf2, cast, buf1);
5793 fprintf(fout, " tmp = (edx << 16) | (eax & 0xffff);\n");
5794 snprintf(buf2, sizeof(buf2), "%stmp",
5795 (po->op == OP_IDIV) ? "(s32)" : "");
5796 if (po->operand[0].type == OPT_REG
5797 && po->operand[0].reg == xDX)
5799 fprintf(fout, " LOWORD(eax) = %s / %s%s;\n",
5801 fprintf(fout, " LOWORD(edx) = %s %% %s%s;",
5805 fprintf(fout, " LOWORD(edx) = %s %% %s%s;\n",
5807 fprintf(fout, " LOWORD(eax) = %s / %s%s;",
5810 strcat(g_comment, "div16");
5813 ferr(po, "unhandled div lmod %d\n", po->operand[0].lmod);
5815 last_arith_dst = NULL;
5816 delayed_flag_op = NULL;
5821 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5823 for (j = 0; j < 8; j++) {
5824 if (pfomask & (1 << j)) {
5825 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
5826 fprintf(fout, " cond_%s = %s;",
5827 parsed_flag_op_names[j], buf1);
5834 last_arith_dst = NULL;
5835 delayed_flag_op = po;
5839 // SETcc - should already be handled
5842 // note: we reuse OP_Jcc for SETcc, only flags differ
5844 fprintf(fout, "\n goto %s;", po->operand[0].name);
5848 fprintf(fout, " if (ecx == 0)\n");
5849 fprintf(fout, " goto %s;", po->operand[0].name);
5850 strcat(g_comment, "jecxz");
5854 fprintf(fout, " if (--ecx == 0)\n");
5855 fprintf(fout, " goto %s;", po->operand[0].name);
5856 strcat(g_comment, "loop");
5860 assert_operand_cnt(1);
5861 last_arith_dst = NULL;
5862 delayed_flag_op = NULL;
5864 if (po->operand[0].type == OPT_REGMEM) {
5865 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
5868 ferr(po, "parse failure for jmp '%s'\n",
5869 po->operand[0].name);
5870 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
5873 else if (po->operand[0].type != OPT_LABEL)
5874 ferr(po, "unhandled jmp type\n");
5876 fprintf(fout, " goto %s;", po->operand[0].name);
5880 assert_operand_cnt(1);
5882 my_assert_not(pp, NULL);
5885 if (po->flags & OPF_CC) {
5886 // we treat conditional branch to another func
5887 // (yes such code exists..) as conditional tailcall
5889 fprintf(fout, " {\n");
5892 if (pp->is_fptr && !pp->is_arg) {
5893 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
5894 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
5896 if (pp->is_unresolved)
5897 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
5898 buf3, asmfn, po->asmln, pp->name);
5901 fprintf(fout, "%s", buf3);
5902 if (strstr(pp->ret_type.name, "int64")) {
5903 if (po->flags & OPF_TAIL)
5904 ferr(po, "int64 and tail?\n");
5905 fprintf(fout, "tmp64 = ");
5907 else if (!IS(pp->ret_type.name, "void")) {
5908 if (po->flags & OPF_TAIL) {
5909 if (regmask_ret & (1 << xAX)) {
5910 fprintf(fout, "return ");
5911 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
5912 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
5915 else if (po->regmask_dst & (1 << xAX)) {
5916 fprintf(fout, "eax = ");
5917 if (pp->ret_type.is_ptr)
5918 fprintf(fout, "(u32)");
5922 if (pp->name[0] == 0)
5923 ferr(po, "missing pp->name\n");
5924 fprintf(fout, "%s%s(", pp->name,
5925 pp->has_structarg ? "_sa" : "");
5927 if (po->flags & OPF_ATAIL) {
5928 if (pp->argc_stack != g_func_pp->argc_stack
5929 || (pp->argc_stack > 0
5930 && pp->is_stdcall != g_func_pp->is_stdcall))
5931 ferr(po, "incompatible tailcall\n");
5932 if (g_func_pp->has_retreg)
5933 ferr(po, "TODO: retreg+tailcall\n");
5935 for (arg = j = 0; arg < pp->argc; arg++) {
5937 fprintf(fout, ", ");
5940 if (pp->arg[arg].type.is_ptr)
5941 snprintf(cast, sizeof(cast), "(%s)",
5942 pp->arg[arg].type.name);
5944 if (pp->arg[arg].reg != NULL) {
5945 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5949 for (; j < g_func_pp->argc; j++)
5950 if (g_func_pp->arg[j].reg == NULL)
5952 fprintf(fout, "%sa%d", cast, j + 1);
5957 for (arg = 0; arg < pp->argc; arg++) {
5959 fprintf(fout, ", ");
5962 if (pp->arg[arg].type.is_ptr)
5963 snprintf(cast, sizeof(cast), "(%s)",
5964 pp->arg[arg].type.name);
5966 if (pp->arg[arg].reg != NULL) {
5967 if (pp->arg[arg].type.is_retreg)
5968 fprintf(fout, "&%s", pp->arg[arg].reg);
5970 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5975 tmp_op = pp->arg[arg].datap;
5977 ferr(po, "parsed_op missing for arg%d\n", arg);
5979 if (tmp_op->flags & OPF_VAPUSH) {
5980 fprintf(fout, "ap");
5982 else if (tmp_op->p_argpass != 0) {
5983 fprintf(fout, "a%d", tmp_op->p_argpass);
5985 else if (tmp_op->p_argnum != 0) {
5986 fprintf(fout, "%s%s", cast,
5987 saved_arg_name(buf1, sizeof(buf1),
5988 tmp_op->p_arggrp, tmp_op->p_argnum));
5992 out_src_opr(buf1, sizeof(buf1),
5993 tmp_op, &tmp_op->operand[0], cast, 0));
5997 fprintf(fout, ");");
5999 if (strstr(pp->ret_type.name, "int64")) {
6000 fprintf(fout, "\n");
6001 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
6002 fprintf(fout, "%seax = tmp64;", buf3);
6005 if (pp->is_unresolved) {
6006 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
6008 strcat(g_comment, buf2);
6011 if (po->flags & OPF_TAIL) {
6013 if (i == opcnt - 1 || pp->is_noreturn)
6015 else if (IS(pp->ret_type.name, "void"))
6017 else if (!(regmask_ret & (1 << xAX)))
6019 // else already handled as 'return f()'
6022 fprintf(fout, "\n%sreturn;", buf3);
6023 strcat(g_comment, " ^ tailcall");
6026 strcat(g_comment, " tailcall");
6028 if ((regmask_ret & (1 << xAX))
6029 && IS(pp->ret_type.name, "void") && !pp->is_noreturn)
6031 ferr(po, "int func -> void func tailcall?\n");
6034 if (pp->is_noreturn)
6035 strcat(g_comment, " noreturn");
6036 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
6037 strcat(g_comment, " argframe");
6038 if (po->flags & OPF_CC)
6039 strcat(g_comment, " cond");
6041 if (po->flags & OPF_CC)
6042 fprintf(fout, "\n }");
6044 delayed_flag_op = NULL;
6045 last_arith_dst = NULL;
6049 if (g_func_pp->is_vararg)
6050 fprintf(fout, " va_end(ap);\n");
6051 if (g_func_pp->has_retreg) {
6052 for (arg = 0; arg < g_func_pp->argc; arg++)
6053 if (g_func_pp->arg[arg].type.is_retreg)
6054 fprintf(fout, " *r_%s = %s;\n",
6055 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
6058 if (!(regmask_ret & (1 << xAX))) {
6059 if (i != opcnt - 1 || label_pending)
6060 fprintf(fout, " return;");
6062 else if (g_func_pp->ret_type.is_ptr) {
6063 fprintf(fout, " return (%s)eax;",
6064 g_func_pp->ret_type.name);
6066 else if (IS(g_func_pp->ret_type.name, "__int64"))
6067 fprintf(fout, " return ((u64)edx << 32) | eax;");
6069 fprintf(fout, " return eax;");
6071 last_arith_dst = NULL;
6072 delayed_flag_op = NULL;
6076 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
6077 if (po->p_argnum != 0) {
6078 // special case - saved func arg
6079 fprintf(fout, " %s = %s;",
6080 saved_arg_name(buf2, sizeof(buf2),
6081 po->p_arggrp, po->p_argnum), buf1);
6084 else if (po->flags & OPF_RSAVE) {
6085 fprintf(fout, " s_%s = %s;", buf1, buf1);
6088 else if (po->flags & OPF_PPUSH) {
6090 ferr_assert(po, tmp_op != NULL);
6091 out_dst_opr(buf2, sizeof(buf2), po, &tmp_op->operand[0]);
6092 fprintf(fout, " pp_%s = %s;", buf2, buf1);
6095 else if (g_func_pp->is_userstack) {
6096 fprintf(fout, " *(--esp) = %s;", buf1);
6099 if (!(g_ida_func_attr & IDAFA_NORETURN))
6100 ferr(po, "stray push encountered\n");
6105 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6106 if (po->flags & OPF_RSAVE) {
6107 fprintf(fout, " %s = s_%s;", buf1, buf1);
6110 else if (po->flags & OPF_PPUSH) {
6111 // push/pop graph / non-const
6112 ferr_assert(po, po->datap == NULL);
6113 fprintf(fout, " %s = pp_%s;", buf1, buf1);
6116 else if (po->datap != NULL) {
6119 fprintf(fout, " %s = %s;", buf1,
6120 out_src_opr(buf2, sizeof(buf2),
6121 tmp_op, &tmp_op->operand[0],
6122 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
6125 else if (g_func_pp->is_userstack) {
6126 fprintf(fout, " %s = *esp++;", buf1);
6130 ferr(po, "stray pop encountered\n");
6139 strcpy(g_comment, "(emms)");
6144 ferr(po, "unhandled op type %d, flags %x\n",
6149 if (g_comment[0] != 0) {
6150 char *p = g_comment;
6151 while (my_isblank(*p))
6153 fprintf(fout, " // %s", p);
6158 fprintf(fout, "\n");
6160 // some sanity checking
6161 if (po->flags & OPF_REP) {
6162 if (po->op != OP_STOS && po->op != OP_MOVS
6163 && po->op != OP_CMPS && po->op != OP_SCAS)
6164 ferr(po, "unexpected rep\n");
6165 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
6166 && (po->op == OP_CMPS || po->op == OP_SCAS))
6167 ferr(po, "cmps/scas with plain rep\n");
6169 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
6170 && po->op != OP_CMPS && po->op != OP_SCAS)
6171 ferr(po, "unexpected repz/repnz\n");
6174 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
6176 // see is delayed flag stuff is still valid
6177 if (delayed_flag_op != NULL && delayed_flag_op != po) {
6178 if (is_any_opr_modified(delayed_flag_op, po, 0))
6179 delayed_flag_op = NULL;
6182 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
6183 if (is_opr_modified(last_arith_dst, po))
6184 last_arith_dst = NULL;
6190 if (g_stack_fsz && !g_stack_frame_used)
6191 fprintf(fout, " (void)sf;\n");
6193 fprintf(fout, "}\n\n");
6195 gen_x_cleanup(opcnt);
6198 static void gen_x_cleanup(int opcnt)
6202 for (i = 0; i < opcnt; i++) {
6203 struct label_ref *lr, *lr_del;
6205 lr = g_label_refs[i].next;
6206 while (lr != NULL) {
6211 g_label_refs[i].i = -1;
6212 g_label_refs[i].next = NULL;
6214 if (ops[i].op == OP_CALL) {
6216 proto_release(ops[i].pp);
6222 struct func_proto_dep;
6224 struct func_prototype {
6229 int has_ret:3; // -1, 0, 1: unresolved, no, yes
6230 unsigned int dep_resolved:1;
6231 unsigned int is_stdcall:1;
6232 struct func_proto_dep *dep_func;
6234 const struct parsed_proto *pp; // seed pp, if any
6237 struct func_proto_dep {
6239 struct func_prototype *proto;
6240 int regmask_live; // .. at the time of call
6241 unsigned int ret_dep:1; // return from this is caller's return
6244 static struct func_prototype *hg_fp;
6245 static int hg_fp_cnt;
6247 static struct scanned_var {
6249 enum opr_lenmod lmod;
6250 unsigned int is_seeded:1;
6251 unsigned int is_c_str:1;
6252 const struct parsed_proto *pp; // seed pp, if any
6254 static int hg_var_cnt;
6256 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
6259 struct func_prototype *hg_fp_add(const char *funcn)
6261 struct func_prototype *fp;
6263 if ((hg_fp_cnt & 0xff) == 0) {
6264 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
6265 my_assert_not(hg_fp, NULL);
6266 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
6269 fp = &hg_fp[hg_fp_cnt];
6270 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
6272 fp->argc_stack = -1;
6278 static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
6283 for (i = 0; i < fp->dep_func_cnt; i++)
6284 if (IS(fp->dep_func[i].name, name))
6285 return &fp->dep_func[i];
6290 static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
6293 if (hg_fp_find_dep(fp, name))
6296 if ((fp->dep_func_cnt & 0xff) == 0) {
6297 fp->dep_func = realloc(fp->dep_func,
6298 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
6299 my_assert_not(fp->dep_func, NULL);
6300 memset(&fp->dep_func[fp->dep_func_cnt], 0,
6301 sizeof(fp->dep_func[0]) * 0x100);
6303 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
6307 static int hg_fp_cmp_name(const void *p1_, const void *p2_)
6309 const struct func_prototype *p1 = p1_, *p2 = p2_;
6310 return strcmp(p1->name, p2->name);
6314 static int hg_fp_cmp_id(const void *p1_, const void *p2_)
6316 const struct func_prototype *p1 = p1_, *p2 = p2_;
6317 return p1->id - p2->id;
6321 // recursive register dep pass
6322 // - track saved regs (part 2)
6323 // - try to figure out arg-regs
6324 // - calculate reg deps
6325 static void gen_hdr_dep_pass(int i, int opcnt, unsigned char *cbits,
6326 struct func_prototype *fp, int regmask_save, int regmask_dst,
6327 int *regmask_dep, int *has_ret)
6329 struct func_proto_dep *dep;
6330 struct parsed_op *po;
6331 int from_caller = 0;
6336 for (; i < opcnt; i++)
6338 if (cbits[i >> 3] & (1 << (i & 7)))
6340 cbits[i >> 3] |= (1 << (i & 7));
6344 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
6345 if (po->flags & OPF_RMD)
6348 if (po->btj != NULL) {
6350 for (j = 0; j < po->btj->count; j++) {
6351 check_i(po, po->btj->d[j].bt_i);
6352 gen_hdr_dep_pass(po->btj->d[j].bt_i, opcnt, cbits, fp,
6353 regmask_save, regmask_dst, regmask_dep, has_ret);
6358 check_i(po, po->bt_i);
6359 if (po->flags & OPF_CJMP) {
6360 gen_hdr_dep_pass(po->bt_i, opcnt, cbits, fp,
6361 regmask_save, regmask_dst, regmask_dep, has_ret);
6369 if (po->flags & OPF_FARG)
6370 /* (just calculate register deps) */;
6371 else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
6373 reg = po->operand[0].reg;
6374 ferr_assert(po, reg >= 0);
6376 if (po->flags & OPF_RSAVE) {
6377 regmask_save |= 1 << reg;
6380 if (po->flags & OPF_DONE)
6383 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 2, reg, 0, 0);
6385 regmask_save |= 1 << reg;
6386 po->flags |= OPF_RMD;
6387 scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, OPF_RMD);
6391 else if (po->flags & OPF_RMD)
6393 else if (po->op == OP_CALL) {
6394 po->regmask_dst |= 1 << xAX;
6396 dep = hg_fp_find_dep(fp, po->operand[0].name);
6398 dep->regmask_live = regmask_save | regmask_dst;
6400 else if (po->op == OP_RET) {
6401 if (po->operand_cnt > 0) {
6403 if (fp->argc_stack >= 0
6404 && fp->argc_stack != po->operand[0].val / 4)
6405 ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4);
6406 fp->argc_stack = po->operand[0].val / 4;
6410 // if has_ret is 0, there is uninitialized eax path,
6411 // which means it's most likely void func
6412 if (*has_ret != 0 && (po->flags & OPF_TAIL)) {
6413 if (po->op == OP_CALL) {
6418 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
6421 ret = resolve_origin(i, &opr, i + opcnt * 4, &j, &from_caller);
6424 if (ret != 1 && from_caller) {
6425 // unresolved eax - probably void func
6429 if (j >= 0 && ops[j].op == OP_CALL) {
6430 dep = hg_fp_find_dep(fp, ops[j].operand[0].name);
6441 l = regmask_save | regmask_dst;
6442 if (g_bp_frame && !(po->flags & OPF_EBP_S))
6445 l = po->regmask_src & ~l;
6448 fnote(po, "dep |= %04x, dst %04x, save %04x (f %x)\n",
6449 l, regmask_dst, regmask_save, po->flags);
6452 regmask_dst |= po->regmask_dst;
6454 if (po->flags & OPF_TAIL)
6459 static void gen_hdr(const char *funcn, int opcnt)
6461 int save_arg_vars[MAX_ARG_GRP] = { 0, };
6462 unsigned char cbits[MAX_OPS / 8];
6463 const struct parsed_proto *pp_c;
6464 struct parsed_proto *pp;
6465 struct func_prototype *fp;
6466 struct parsed_op *po;
6467 int regmask_dummy = 0;
6469 int max_bp_offset = 0;
6474 pp_c = proto_parse(g_fhdr, funcn, 1);
6476 // already in seed, will add to hg_fp later
6479 fp = hg_fp_add(funcn);
6481 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
6482 g_stack_frame_used = 0;
6485 // - resolve all branches
6486 // - parse calls with labels
6487 resolve_branches_parse_calls(opcnt);
6490 // - handle ebp/esp frame, remove ops related to it
6491 scan_prologue_epilogue(opcnt);
6494 // - remove dead labels
6496 for (i = 0; i < opcnt; i++)
6498 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6504 if (po->flags & (OPF_RMD|OPF_DONE))
6507 if (po->op == OP_CALL) {
6508 if (po->operand[0].type == OPT_LABEL)
6509 hg_fp_add_dep(fp, opr_name(po, 0));
6510 else if (po->pp != NULL)
6511 hg_fp_add_dep(fp, po->pp->name);
6516 // - remove dead labels
6517 // - handle push <const>/pop pairs
6518 for (i = 0; i < opcnt; i++)
6520 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
6526 if (po->flags & (OPF_RMD|OPF_DONE))
6529 if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST)
6530 scan_for_pop_const(i, opcnt, i + opcnt * 13);
6534 // - process trivial calls
6535 for (i = 0; i < opcnt; i++)
6538 if (po->flags & (OPF_RMD|OPF_DONE))
6541 if (po->op == OP_CALL)
6543 pp = process_call_early(i, opcnt, &j);
6545 if (!(po->flags & OPF_ATAIL))
6546 // since we know the args, try to collect them
6547 if (collect_call_args_early(po, i, pp, ®mask_dummy) != 0)
6553 // commit esp adjust
6554 if (ops[j].op != OP_POP)
6555 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
6557 for (l = 0; l < pp->argc_stack; l++)
6558 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
6562 po->flags |= OPF_DONE;
6568 // - track saved regs (simple)
6570 for (i = 0; i < opcnt; i++)
6573 if (po->flags & (OPF_RMD|OPF_DONE))
6576 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG
6577 && po->operand[0].reg != xCX)
6579 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
6581 // regmask_save |= 1 << po->operand[0].reg; // do it later
6582 po->flags |= OPF_RSAVE | OPF_RMD | OPF_DONE;
6583 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, OPF_RMD);
6586 else if (po->op == OP_CALL)
6588 pp = process_call(i, opcnt);
6590 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
6591 // since we know the args, collect them
6592 ret = collect_call_args(po, i, pp, ®mask_dummy, save_arg_vars,
6599 memset(cbits, 0, sizeof(cbits));
6603 gen_hdr_dep_pass(0, opcnt, cbits, fp, 0, 0, ®mask_dep, &has_ret);
6605 // find unreachable code - must be fixed in IDA
6606 for (i = 0; i < opcnt; i++)
6608 if (cbits[i >> 3] & (1 << (i & 7)))
6611 if (g_labels[i] == NULL && i > 0 && ops[i - 1].op == OP_CALL
6612 && ops[i - 1].pp != NULL && ops[i - 1].pp->is_osinc)
6614 // the compiler sometimes still generates code after
6615 // noreturn OS functions
6618 if (ops[i].op != OP_NOP)
6619 ferr(&ops[i], "unreachable code\n");
6622 for (i = 0; i < g_eqcnt; i++) {
6623 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
6624 max_bp_offset = g_eqs[i].offset;
6627 if (fp->argc_stack < 0) {
6628 max_bp_offset = (max_bp_offset + 3) & ~3;
6629 fp->argc_stack = max_bp_offset / 4;
6630 if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0)
6634 fp->regmask_dep = regmask_dep & ~(1 << xSP);
6635 fp->has_ret = has_ret;
6637 printf("// has_ret %d, regmask_dep %x\n",
6638 fp->has_ret, fp->regmask_dep);
6639 output_hdr_fp(stdout, fp, 1);
6640 if (IS(funcn, "sub_10007F72")) exit(1);
6643 gen_x_cleanup(opcnt);
6646 static void hg_fp_resolve_deps(struct func_prototype *fp)
6648 struct func_prototype fp_s;
6652 // this thing is recursive, so mark first..
6653 fp->dep_resolved = 1;
6655 for (i = 0; i < fp->dep_func_cnt; i++) {
6656 strcpy(fp_s.name, fp->dep_func[i].name);
6657 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
6658 sizeof(hg_fp[0]), hg_fp_cmp_name);
6659 if (fp->dep_func[i].proto != NULL) {
6660 if (!fp->dep_func[i].proto->dep_resolved)
6661 hg_fp_resolve_deps(fp->dep_func[i].proto);
6663 dep = ~fp->dep_func[i].regmask_live
6664 & fp->dep_func[i].proto->regmask_dep;
6665 fp->regmask_dep |= dep;
6666 // printf("dep %s %s |= %x\n", fp->name,
6667 // fp->dep_func[i].name, dep);
6669 if (fp->has_ret == -1 && fp->dep_func[i].ret_dep)
6670 fp->has_ret = fp->dep_func[i].proto->has_ret;
6675 static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
6678 const struct parsed_proto *pp;
6679 char *p, namebuf[NAMELEN];
6685 for (; count > 0; count--, fp++) {
6686 if (fp->has_ret == -1)
6687 fprintf(fout, "// ret unresolved\n");
6689 fprintf(fout, "// dep:");
6690 for (j = 0; j < fp->dep_func_cnt; j++) {
6691 fprintf(fout, " %s/", fp->dep_func[j].name);
6692 if (fp->dep_func[j].proto != NULL)
6693 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
6694 fp->dep_func[j].proto->has_ret);
6696 fprintf(fout, "\n");
6699 p = strchr(fp->name, '@');
6701 memcpy(namebuf, fp->name, p - fp->name);
6702 namebuf[p - fp->name] = 0;
6710 pp = proto_parse(g_fhdr, name, 1);
6711 if (pp != NULL && pp->is_include)
6714 if (fp->pp != NULL) {
6715 // part of seed, output later
6719 regmask_dep = fp->regmask_dep;
6720 argc_stack = fp->argc_stack;
6722 fprintf(fout, "%-5s", fp->pp ? fp->pp->ret_type.name :
6723 (fp->has_ret ? "int" : "void"));
6724 if (regmask_dep && (fp->is_stdcall || argc_stack == 0)
6725 && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0)
6727 fprintf(fout, " __fastcall ");
6728 if (!(regmask_dep & (1 << xDX)) && argc_stack == 0)
6734 else if (regmask_dep && !fp->is_stdcall) {
6735 fprintf(fout, "/*__usercall*/ ");
6737 else if (regmask_dep) {
6738 fprintf(fout, "/*__userpurge*/ ");
6740 else if (fp->is_stdcall)
6741 fprintf(fout, " __stdcall ");
6743 fprintf(fout, " __cdecl ");
6745 fprintf(fout, "%s(", name);
6748 for (j = 0; j < xSP; j++) {
6749 if (regmask_dep & (1 << j)) {
6752 fprintf(fout, ", ");
6754 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6756 fprintf(fout, "int");
6757 fprintf(fout, " a%d/*<%s>*/", arg, regs_r32[j]);
6761 for (j = 0; j < argc_stack; j++) {
6764 fprintf(fout, ", ");
6765 if (fp->pp != NULL) {
6766 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
6767 if (!fp->pp->arg[arg - 1].type.is_ptr)
6771 fprintf(fout, "int ");
6772 fprintf(fout, "a%d", arg);
6775 fprintf(fout, ");\n");
6779 static void output_hdr(FILE *fout)
6781 static const char *lmod_c_names[] = {
6782 [OPLM_UNSPEC] = "???",
6783 [OPLM_BYTE] = "uint8_t",
6784 [OPLM_WORD] = "uint16_t",
6785 [OPLM_DWORD] = "uint32_t",
6786 [OPLM_QWORD] = "uint64_t",
6788 const struct scanned_var *var;
6789 struct func_prototype *fp;
6790 char line[256] = { 0, };
6794 // add stuff from headers
6795 for (i = 0; i < pp_cache_size; i++) {
6796 if (pp_cache[i].is_cinc && !pp_cache[i].is_stdcall)
6797 snprintf(name, sizeof(name), "_%s", pp_cache[i].name);
6799 snprintf(name, sizeof(name), "%s", pp_cache[i].name);
6800 fp = hg_fp_add(name);
6801 fp->pp = &pp_cache[i];
6802 fp->argc_stack = fp->pp->argc_stack;
6803 fp->is_stdcall = fp->pp->is_stdcall;
6804 fp->regmask_dep = get_pp_arg_regmask_src(fp->pp);
6805 fp->has_ret = !IS(fp->pp->ret_type.name, "void");
6809 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
6810 for (i = 0; i < hg_fp_cnt; i++)
6811 hg_fp_resolve_deps(&hg_fp[i]);
6813 // note: messes up .proto ptr, don't use
6814 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
6817 for (i = 0; i < hg_var_cnt; i++) {
6820 if (var->pp != NULL)
6823 else if (var->is_c_str)
6824 fprintf(fout, "extern %-8s %s[];", "char", var->name);
6826 fprintf(fout, "extern %-8s %s;",
6827 lmod_c_names[var->lmod], var->name);
6830 fprintf(fout, " // seeded");
6831 fprintf(fout, "\n");
6834 fprintf(fout, "\n");
6836 // output function prototypes
6837 output_hdr_fp(fout, hg_fp, hg_fp_cnt);
6840 fprintf(fout, "\n// - seed -\n");
6843 while (fgets(line, sizeof(line), g_fhdr))
6844 fwrite(line, 1, strlen(line), fout);
6847 // '=' needs special treatment
6849 static char *next_word_s(char *w, size_t wsize, char *s)
6858 for (i = 1; i < wsize - 1; i++) {
6860 printf("warning: missing closing quote: \"%s\"\n", s);
6869 for (; i < wsize - 1; i++) {
6870 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
6876 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
6877 printf("warning: '%s' truncated\n", w);
6882 static void scan_variables(FILE *fasm)
6884 struct scanned_var *var;
6885 char line[256] = { 0, };
6893 // skip to next data section
6894 while (my_fgets(line, sizeof(line), fasm))
6899 if (*p == 0 || *p == ';')
6902 p = sskip(next_word_s(words[0], sizeof(words[0]), p));
6903 if (*p == 0 || *p == ';')
6906 if (*p != 's' || !IS_START(p, "segment para public"))
6912 if (p == NULL || !IS_START(p, "segment para public"))
6916 if (!IS_START(p, "'DATA'"))
6920 while (my_fgets(line, sizeof(line), fasm))
6929 if (*p == 0 || *p == ';')
6932 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6933 words[wordc][0] = 0;
6934 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6935 if (*p == 0 || *p == ';') {
6941 if (wordc == 2 && IS(words[1], "ends"))
6946 if (IS_START(words[0], "__IMPORT_DESCRIPTOR_")) {
6947 // when this starts, we don't need anything from this section
6951 if ((hg_var_cnt & 0xff) == 0) {
6952 hg_vars = realloc(hg_vars, sizeof(hg_vars[0])
6953 * (hg_var_cnt + 0x100));
6954 my_assert_not(hg_vars, NULL);
6955 memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100);
6958 var = &hg_vars[hg_var_cnt++];
6959 snprintf(var->name, sizeof(var->name), "%s", words[0]);
6961 // maybe already in seed header?
6962 var->pp = proto_parse(g_fhdr, var->name, 1);
6963 if (var->pp != NULL) {
6964 if (var->pp->is_fptr) {
6965 var->lmod = OPLM_DWORD;
6968 else if (var->pp->is_func)
6970 else if (!guess_lmod_from_c_type(&var->lmod, &var->pp->type))
6971 aerr("unhandled C type '%s' for '%s'\n",
6972 var->pp->type.name, var->name);
6978 if (IS(words[1], "dd"))
6979 var->lmod = OPLM_DWORD;
6980 else if (IS(words[1], "dw"))
6981 var->lmod = OPLM_WORD;
6982 else if (IS(words[1], "db")) {
6983 var->lmod = OPLM_BYTE;
6984 if (wordc >= 3 && (l = strlen(words[2])) > 4) {
6985 if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0"))
6989 else if (IS(words[1], "dq"))
6990 var->lmod = OPLM_QWORD;
6991 //else if (IS(words[1], "dt"))
6993 aerr("type '%s' not known\n", words[1]);
7001 static void set_label(int i, const char *name)
7007 p = strchr(name, ':');
7011 if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_"))
7012 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
7013 g_labels[i] = realloc(g_labels[i], len + 1);
7014 my_assert_not(g_labels[i], NULL);
7015 memcpy(g_labels[i], name, len);
7016 g_labels[i][len] = 0;
7025 static struct chunk_item *func_chunks;
7026 static int func_chunk_cnt;
7027 static int func_chunk_alloc;
7029 static void add_func_chunk(FILE *fasm, const char *name, int line)
7031 if (func_chunk_cnt >= func_chunk_alloc) {
7032 func_chunk_alloc *= 2;
7033 func_chunks = realloc(func_chunks,
7034 func_chunk_alloc * sizeof(func_chunks[0]));
7035 my_assert_not(func_chunks, NULL);
7037 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
7038 func_chunks[func_chunk_cnt].name = strdup(name);
7039 func_chunks[func_chunk_cnt].asmln = line;
7043 static int cmp_chunks(const void *p1, const void *p2)
7045 const struct chunk_item *c1 = p1, *c2 = p2;
7046 return strcmp(c1->name, c2->name);
7049 static int cmpstringp(const void *p1, const void *p2)
7051 return strcmp(*(char * const *)p1, *(char * const *)p2);
7054 static void scan_ahead(FILE *fasm)
7064 oldpos = ftell(fasm);
7067 while (my_fgets(line, sizeof(line), fasm))
7078 // get rid of random tabs
7079 for (i = 0; line[i] != 0; i++)
7080 if (line[i] == '\t')
7083 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
7086 next_word(words[0], sizeof(words[0]), p);
7087 if (words[0][0] == 0)
7088 aerr("missing name for func chunk?\n");
7090 add_func_chunk(fasm, words[0], asmln);
7092 else if (IS_START(p, "; sctend"))
7098 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
7099 words[wordc][0] = 0;
7100 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
7101 if (*p == 0 || *p == ';') {
7107 if (wordc == 2 && IS(words[1], "ends"))
7111 fseek(fasm, oldpos, SEEK_SET);
7115 int main(int argc, char *argv[])
7117 FILE *fout, *fasm, *frlist;
7118 struct parsed_data *pd = NULL;
7120 char **rlist = NULL;
7122 int rlist_alloc = 0;
7123 int func_chunks_used = 0;
7124 int func_chunks_sorted = 0;
7125 int func_chunk_i = -1;
7126 long func_chunk_ret = 0;
7127 int func_chunk_ret_ln = 0;
7128 int scanned_ahead = 0;
7130 char words[20][256];
7131 enum opr_lenmod lmod;
7132 char *sctproto = NULL;
7134 int pending_endp = 0;
7136 int skip_warned = 0;
7149 for (arg = 1; arg < argc; arg++) {
7150 if (IS(argv[arg], "-v"))
7152 else if (IS(argv[arg], "-rf"))
7153 g_allow_regfunc = 1;
7154 else if (IS(argv[arg], "-m"))
7156 else if (IS(argv[arg], "-hdr"))
7157 g_header_mode = g_quiet_pp = g_allow_regfunc = 1;
7162 if (argc < arg + 3) {
7163 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdr.h> [rlist]*\n"
7164 "%s -hdr <out.h> <.asm> <seed.h> [rlist]*\n"
7166 " -hdr - header generation mode\n"
7167 " -rf - allow unannotated indirect calls\n"
7168 " -m - allow multiple .text sections\n"
7169 "[rlist] is a file with function names to skip,"
7177 asmfn = argv[arg++];
7178 fasm = fopen(asmfn, "r");
7179 my_assert_not(fasm, NULL);
7181 hdrfn = argv[arg++];
7182 g_fhdr = fopen(hdrfn, "r");
7183 my_assert_not(g_fhdr, NULL);
7186 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
7187 my_assert_not(rlist, NULL);
7188 // needs special handling..
7189 rlist[rlist_len++] = "__alloca_probe";
7191 func_chunk_alloc = 32;
7192 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
7193 my_assert_not(func_chunks, NULL);
7195 memset(words, 0, sizeof(words));
7197 for (; arg < argc; arg++) {
7198 frlist = fopen(argv[arg], "r");
7199 my_assert_not(frlist, NULL);
7201 while (my_fgets(line, sizeof(line), frlist)) {
7203 if (*p == 0 || *p == ';')
7206 if (IS_START(p, "#if 0")
7207 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
7211 else if (IS_START(p, "#endif"))
7218 p = next_word(words[0], sizeof(words[0]), p);
7219 if (words[0][0] == 0)
7222 if (rlist_len >= rlist_alloc) {
7223 rlist_alloc = rlist_alloc * 2 + 64;
7224 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
7225 my_assert_not(rlist, NULL);
7227 rlist[rlist_len++] = strdup(words[0]);
7236 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
7238 fout = fopen(argv[arg_out], "w");
7239 my_assert_not(fout, NULL);
7242 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
7243 my_assert_not(g_eqs, NULL);
7245 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
7246 g_label_refs[i].i = -1;
7247 g_label_refs[i].next = NULL;
7251 scan_variables(fasm);
7253 while (my_fgets(line, sizeof(line), fasm))
7262 // get rid of random tabs
7263 for (i = 0; line[i] != 0; i++)
7264 if (line[i] == '\t')
7269 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
7270 goto do_pending_endp; // eww..
7272 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
7274 static const char *attrs[] = {
7283 // parse IDA's attribute-list comment
7284 g_ida_func_attr = 0;
7287 for (; *p != 0; p = sskip(p)) {
7288 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
7289 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
7290 g_ida_func_attr |= 1 << i;
7291 p += strlen(attrs[i]);
7295 if (i == ARRAY_SIZE(attrs)) {
7296 anote("unparsed IDA attr: %s\n", p);
7299 if (IS(attrs[i], "fpd=")) {
7300 p = next_word(words[0], sizeof(words[0]), p);
7305 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
7308 next_word(words[0], sizeof(words[0]), p);
7309 if (words[0][0] == 0)
7310 aerr("missing name for func chunk?\n");
7312 if (!scanned_ahead) {
7313 add_func_chunk(fasm, words[0], asmln);
7314 func_chunks_sorted = 0;
7317 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
7319 if (func_chunk_i >= 0) {
7320 if (func_chunk_i < func_chunk_cnt
7321 && IS(func_chunks[func_chunk_i].name, g_func))
7323 // move on to next chunk
7324 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
7326 aerr("seek failed for '%s' chunk #%d\n",
7327 g_func, func_chunk_i);
7328 asmln = func_chunks[func_chunk_i].asmln;
7332 if (func_chunk_ret == 0)
7333 aerr("no return from chunk?\n");
7334 fseek(fasm, func_chunk_ret, SEEK_SET);
7335 asmln = func_chunk_ret_ln;
7341 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
7342 func_chunks_used = 1;
7344 if (IS_START(g_func, "sub_")) {
7345 unsigned long addr = strtoul(p, NULL, 16);
7346 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
7347 if (addr > f_addr && !scanned_ahead) {
7348 //anote("scan_ahead caused by '%s', addr %lx\n",
7352 func_chunks_sorted = 0;
7360 for (i = wordc; i < ARRAY_SIZE(words); i++)
7362 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
7363 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
7364 if (*p == 0 || *p == ';') {
7369 if (*p != 0 && *p != ';')
7370 aerr("too many words\n");
7372 // alow asm patches in comments
7374 if (IS_START(p, "; sctpatch:")) {
7376 if (*p == 0 || *p == ';')
7378 goto parse_words; // lame
7380 if (IS_START(p, "; sctproto:")) {
7381 sctproto = strdup(p + 11);
7383 else if (IS_START(p, "; sctend")) {
7392 awarn("wordc == 0?\n");
7396 // don't care about this:
7397 if (words[0][0] == '.'
7398 || IS(words[0], "include")
7399 || IS(words[0], "assume") || IS(words[1], "segment")
7400 || IS(words[0], "align"))
7406 // do delayed endp processing to collect switch jumptables
7408 if (in_func && !g_skip_func && !end && wordc >= 2
7409 && ((words[0][0] == 'd' && words[0][2] == 0)
7410 || (words[1][0] == 'd' && words[1][2] == 0)))
7413 if (words[1][0] == 'd' && words[1][2] == 0) {
7415 if (g_func_pd_cnt >= pd_alloc) {
7416 pd_alloc = pd_alloc * 2 + 16;
7417 g_func_pd = realloc(g_func_pd,
7418 sizeof(g_func_pd[0]) * pd_alloc);
7419 my_assert_not(g_func_pd, NULL);
7421 pd = &g_func_pd[g_func_pd_cnt];
7423 memset(pd, 0, sizeof(*pd));
7424 strcpy(pd->label, words[0]);
7425 pd->type = OPT_CONST;
7426 pd->lmod = lmod_from_directive(words[1]);
7432 anote("skipping alignment byte?\n");
7435 lmod = lmod_from_directive(words[0]);
7436 if (lmod != pd->lmod)
7437 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
7440 if (pd->count_alloc < pd->count + wordc) {
7441 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
7442 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
7443 my_assert_not(pd->d, NULL);
7445 for (; i < wordc; i++) {
7446 if (IS(words[i], "offset")) {
7447 pd->type = OPT_OFFSET;
7450 p = strchr(words[i], ',');
7453 if (pd->type == OPT_OFFSET)
7454 pd->d[pd->count].u.label = strdup(words[i]);
7456 pd->d[pd->count].u.val = parse_number(words[i]);
7457 pd->d[pd->count].bt_i = -1;
7463 if (in_func && !g_skip_func) {
7465 gen_hdr(g_func, pi);
7467 gen_func(fout, g_fhdr, g_func, pi);
7472 g_ida_func_attr = 0;
7476 func_chunks_used = 0;
7479 memset(&ops, 0, pi * sizeof(ops[0]));
7484 for (i = 0; i < g_func_pd_cnt; i++) {
7486 if (pd->type == OPT_OFFSET) {
7487 for (j = 0; j < pd->count; j++)
7488 free(pd->d[j].u.label);
7502 if (IS(words[1], "proc")) {
7504 aerr("proc '%s' while in_func '%s'?\n",
7507 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
7509 strcpy(g_func, words[0]);
7510 set_label(0, words[0]);
7515 if (IS(words[1], "endp"))
7518 aerr("endp '%s' while not in_func?\n", words[0]);
7519 if (!IS(g_func, words[0]))
7520 aerr("endp '%s' while in_func '%s'?\n",
7523 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
7524 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
7530 if (!g_skip_func && func_chunks_used) {
7531 // start processing chunks
7532 struct chunk_item *ci, key = { g_func, 0 };
7534 func_chunk_ret = ftell(fasm);
7535 func_chunk_ret_ln = asmln;
7536 if (!func_chunks_sorted) {
7537 qsort(func_chunks, func_chunk_cnt,
7538 sizeof(func_chunks[0]), cmp_chunks);
7539 func_chunks_sorted = 1;
7541 ci = bsearch(&key, func_chunks, func_chunk_cnt,
7542 sizeof(func_chunks[0]), cmp_chunks);
7544 aerr("'%s' needs chunks, but none found\n", g_func);
7545 func_chunk_i = ci - func_chunks;
7546 for (; func_chunk_i > 0; func_chunk_i--)
7547 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
7550 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
7552 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
7553 asmln = func_chunks[func_chunk_i].asmln;
7561 if (wordc == 2 && IS(words[1], "ends")) {
7565 goto do_pending_endp;
7569 // scan for next text segment
7570 while (my_fgets(line, sizeof(line), fasm)) {
7573 if (*p == 0 || *p == ';')
7576 if (strstr(p, "segment para public 'CODE' use32"))
7583 p = strchr(words[0], ':');
7585 set_label(pi, words[0]);
7589 if (!in_func || g_skip_func) {
7590 if (!skip_warned && !g_skip_func && g_labels[pi] != NULL) {
7592 anote("skipping from '%s'\n", g_labels[pi]);
7596 g_labels[pi] = NULL;
7600 if (wordc > 1 && IS(words[1], "="))
7603 aerr("unhandled equ, wc=%d\n", wordc);
7604 if (g_eqcnt >= eq_alloc) {
7606 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
7607 my_assert_not(g_eqs, NULL);
7610 len = strlen(words[0]);
7611 if (len > sizeof(g_eqs[0].name) - 1)
7612 aerr("equ name too long: %d\n", len);
7613 strcpy(g_eqs[g_eqcnt].name, words[0]);
7615 if (!IS(words[3], "ptr"))
7616 aerr("unhandled equ\n");
7617 if (IS(words[2], "dword"))
7618 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
7619 else if (IS(words[2], "word"))
7620 g_eqs[g_eqcnt].lmod = OPLM_WORD;
7621 else if (IS(words[2], "byte"))
7622 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
7623 else if (IS(words[2], "qword"))
7624 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
7626 aerr("bad lmod: '%s'\n", words[2]);
7628 g_eqs[g_eqcnt].offset = parse_number(words[4]);
7633 if (pi >= ARRAY_SIZE(ops))
7634 aerr("too many ops\n");
7636 parse_op(&ops[pi], words, wordc);
7638 if (sctproto != NULL) {
7639 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
7640 ops[pi].datap = sctproto;
7656 // vim:ts=2:shiftwidth=2:expandtab