9 #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
10 #define IS(w, y) !strcmp(w, y)
11 #define IS_START(w, y) !strncmp(w, y, strlen(y))
13 #include "protoparse.h"
15 static const char *asmfn;
19 #define anote(fmt, ...) \
20 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
21 #define awarn(fmt, ...) \
22 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
23 #define aerr(fmt, ...) do { \
24 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
29 #include "masm_tools.h"
32 OPF_RMD = (1 << 0), /* removed or optimized out */
33 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
34 OPF_FLAGS = (1 << 2), /* sets flags */
35 OPF_JMP = (1 << 3), /* branch, call */
36 OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz) */
37 OPF_CC = (1 << 5), /* uses flags */
38 OPF_TAIL = (1 << 6), /* ret or tail call */
39 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
40 OPF_REP = (1 << 8), /* prefixed by rep */
41 OPF_REPZ = (1 << 9), /* rep is repe/repz */
42 OPF_REPNZ = (1 << 10), /* rep is repne/repnz */
43 OPF_FARG = (1 << 11), /* push collected as func arg (no reuse) */
44 OPF_EBP_S = (1 << 12), /* ebp used as scratch here, not BP */
45 OPF_DF = (1 << 13), /* DF flag set */
46 OPF_ATAIL = (1 << 14), /* tail call with reused arg frame */
47 OPF_32BIT = (1 << 15), /* 32bit division */
48 OPF_LOCK = (1 << 16), /* op has lock prefix */
112 // must be sorted (larger len must be further in enum)
120 #define MAX_OPERANDS 3
124 enum opr_lenmod lmod;
125 unsigned int is_ptr:1; // pointer in C
126 unsigned int is_array:1; // array in C
127 unsigned int type_from_var:1; // .. in header, sometimes wrong
128 unsigned int size_mismatch:1; // type override differs from C
129 unsigned int size_lt:1; // type override is larger than C
130 unsigned int had_ds:1; // had ds: prefix
131 const struct parsed_proto *pp; // for OPT_LABEL
139 struct parsed_opr operand[MAX_OPERANDS];
142 unsigned char pfo_inv;
143 unsigned char operand_cnt;
145 int regmask_src; // all referensed regs
147 int pfomask; // flagop: parsed_flag_op that can't be delayed
148 int argnum; // push: altered before call arg #
149 int cc_scratch; // scratch storage during analysis
150 int bt_i; // branch target for branches
151 struct parsed_data *btj;// branch targets for jumptables
152 struct parsed_proto *pp;// parsed_proto for OP_CALL
158 // OP_CALL - parser proto hint (str)
159 // (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
160 // OP_POP - point to OP_PUSH in push/pop pair
164 enum opr_lenmod lmod;
171 enum opr_lenmod lmod;
185 struct label_ref *next;
189 IDAFA_BP_FRAME = (1 << 0),
190 IDAFA_LIB_FUNC = (1 << 1),
191 IDAFA_STATIC = (1 << 2),
192 IDAFA_NORETURN = (1 << 3),
193 IDAFA_THUNK = (1 << 4),
194 IDAFA_FPD = (1 << 5),
199 static struct parsed_op ops[MAX_OPS];
200 static struct parsed_equ *g_eqs;
202 static char g_labels[MAX_OPS][48];
203 static struct label_ref g_label_refs[MAX_OPS];
204 static const struct parsed_proto *g_func_pp;
205 static struct parsed_data *g_func_pd;
206 static int g_func_pd_cnt;
207 static char g_func[256];
208 static char g_comment[256];
209 static int g_bp_frame;
210 static int g_sp_frame;
211 static int g_stack_frame_used;
212 static int g_stack_fsz;
213 static int g_ida_func_attr;
214 static int g_allow_regfunc;
215 #define ferr(op_, fmt, ...) do { \
216 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
217 dump_op(op_), ##__VA_ARGS__); \
221 #define fnote(op_, fmt, ...) \
222 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
223 dump_op(op_), ##__VA_ARGS__)
227 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
228 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
229 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
230 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
232 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
234 // possible basic comparison types (without inversion)
235 enum parsed_flag_op {
239 PFO_BE, // 6 CF=1||ZF=1
243 PFO_LE, // e ZF=1||SF!=OF
246 static const char *parsed_flag_op_names[] = {
247 "o", "c", "z", "be", "s", "p", "l", "le"
250 static int char_array_i(const char *array[], size_t len, const char *s)
254 for (i = 0; i < len; i++)
261 static void printf_number(char *buf, size_t buf_size,
262 unsigned long number)
264 // output in C-friendly form
265 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
268 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
272 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
274 *reg_lmod = OPLM_DWORD;
277 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
279 *reg_lmod = OPLM_WORD;
282 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
284 *reg_lmod = OPLM_BYTE;
287 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
289 *reg_lmod = OPLM_BYTE;
296 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
298 enum opr_lenmod lmod;
311 while (my_isblank(*s))
313 for (; my_issep(*s); d++, s++)
315 while (my_isblank(*s))
320 if (IS_START(s, "ds:"))
323 s = next_idt(w, sizeof(w), s);
328 reg = parse_reg(&lmod, w);
330 *regmask |= 1 << reg;
334 if ('0' <= w[0] && w[0] <= '9') {
335 number = parse_number(w);
336 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
340 // probably some label/identifier - pass
343 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
347 strcpy(name, cvtbuf);
352 static int is_reg_in_str(const char *s)
356 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
359 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
360 if (!strncmp(s, regs_r32[i], 3))
366 static const char *parse_stack_el(const char *name, char *extra_reg)
368 const char *p, *p2, *s;
375 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
377 if (extra_reg != NULL) {
378 strncpy(extra_reg, name, 3);
383 if (IS_START(p, "ebp+")) {
387 if (p2 != NULL && is_reg_in_str(p)) {
388 if (extra_reg != NULL) {
389 strncpy(extra_reg, p, p2 - p);
390 extra_reg[p2 - p] = 0;
395 if (!('0' <= *p && *p <= '9'))
401 if (!IS_START(name, "esp+"))
407 if (is_reg_in_str(s)) {
408 if (extra_reg != NULL) {
409 strncpy(extra_reg, s, p - s);
410 extra_reg[p - s] = 0;
415 aerr("%s IDA stackvar not set?\n", __func__);
417 if (!('0' <= *s && *s <= '9')) {
418 aerr("%s IDA stackvar offset not set?\n", __func__);
421 if (s[0] == '0' && s[1] == 'x')
424 if (len < sizeof(buf) - 1) {
425 strncpy(buf, s, len);
427 val = strtol(buf, &endp, 16);
428 if (val == 0 || *endp != 0) {
429 aerr("%s num parse fail for '%s'\n", __func__, buf);
438 if ('0' <= *p && *p <= '9')
444 static int guess_lmod_from_name(struct parsed_opr *opr)
446 if (!strncmp(opr->name, "dword_", 6)) {
447 opr->lmod = OPLM_DWORD;
450 if (!strncmp(opr->name, "word_", 5)) {
451 opr->lmod = OPLM_WORD;
454 if (!strncmp(opr->name, "byte_", 5)) {
455 opr->lmod = OPLM_BYTE;
461 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
462 const struct parsed_type *c_type)
464 static const char *dword_types[] = {
465 "int", "_DWORD", "UINT_PTR", "DWORD",
466 "WPARAM", "LPARAM", "UINT", "__int32",
469 static const char *word_types[] = {
470 "uint16_t", "int16_t", "_WORD",
471 "unsigned __int16", "__int16",
473 static const char *byte_types[] = {
474 "uint8_t", "int8_t", "char",
475 "unsigned __int8", "__int8", "BYTE", "_BYTE",
481 if (c_type->is_ptr) {
486 n = skip_type_mod(c_type->name);
488 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
489 if (IS(n, dword_types[i])) {
495 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
496 if (IS(n, word_types[i])) {
502 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
503 if (IS(n, byte_types[i])) {
512 static char *default_cast_to(char *buf, size_t buf_size,
513 struct parsed_opr *opr)
519 if (opr->pp == NULL || opr->pp->type.name == NULL
522 snprintf(buf, buf_size, "%s", "(void *)");
526 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
530 static enum opr_type lmod_from_directive(const char *d)
534 else if (IS(d, "dw"))
536 else if (IS(d, "db"))
539 aerr("unhandled directive: '%s'\n", d);
543 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
549 *regmask |= 1 << reg;
552 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
555 static int parse_operand(struct parsed_opr *opr,
556 int *regmask, int *regmask_indirect,
557 char words[16][256], int wordc, int w, unsigned int op_flags)
559 const struct parsed_proto *pp;
560 enum opr_lenmod tmplmod;
561 unsigned long number;
569 aerr("parse_operand w %d, wordc %d\n", w, wordc);
573 for (i = w; i < wordc; i++) {
574 len = strlen(words[i]);
575 if (words[i][len - 1] == ',') {
576 words[i][len - 1] = 0;
582 wordc_in = wordc - w;
584 if ((op_flags & OPF_JMP) && wordc_in > 0
585 && !('0' <= words[w][0] && words[w][0] <= '9'))
587 const char *label = NULL;
589 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
590 && IS(words[w + 1], "ptr"))
591 label = words[w + 2];
592 else if (wordc_in == 2 && IS(words[w], "short"))
593 label = words[w + 1];
594 else if (wordc_in == 1
595 && strchr(words[w], '[') == NULL
596 && parse_reg(&tmplmod, words[w]) < 0)
600 opr->type = OPT_LABEL;
601 if (IS_START(label, "ds:")) {
605 strcpy(opr->name, label);
611 if (IS(words[w + 1], "ptr")) {
612 if (IS(words[w], "dword"))
613 opr->lmod = OPLM_DWORD;
614 else if (IS(words[w], "word"))
615 opr->lmod = OPLM_WORD;
616 else if (IS(words[w], "byte"))
617 opr->lmod = OPLM_BYTE;
619 aerr("type parsing failed\n");
621 wordc_in = wordc - w;
626 if (IS(words[w], "offset")) {
627 opr->type = OPT_OFFSET;
628 opr->lmod = OPLM_DWORD;
629 strcpy(opr->name, words[w + 1]);
630 pp = proto_parse(g_fhdr, opr->name, 1);
633 if (IS(words[w], "(offset")) {
634 p = strchr(words[w + 1], ')');
636 aerr("parse of bracketed offset failed\n");
638 opr->type = OPT_OFFSET;
639 strcpy(opr->name, words[w + 1]);
645 aerr("parse_operand 1 word expected\n");
647 if (IS_START(words[w], "ds:")) {
649 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
651 strcpy(opr->name, words[w]);
653 if (words[w][0] == '[') {
654 opr->type = OPT_REGMEM;
655 ret = sscanf(words[w], "[%[^]]]", opr->name);
657 aerr("[] parse failure\n");
659 parse_indmode(opr->name, regmask_indirect, 1);
660 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
662 struct parsed_equ *eq =
663 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
665 opr->lmod = eq->lmod;
669 else if (strchr(words[w], '[')) {
671 p = strchr(words[w], '[');
672 opr->type = OPT_REGMEM;
673 parse_indmode(p, regmask_indirect, 0);
674 strncpy(buf, words[w], p - words[w]);
675 buf[p - words[w]] = 0;
676 pp = proto_parse(g_fhdr, buf, 1);
679 else if (('0' <= words[w][0] && words[w][0] <= '9')
680 || words[w][0] == '-')
682 number = parse_number(words[w]);
683 opr->type = OPT_CONST;
685 printf_number(opr->name, sizeof(opr->name), number);
689 ret = parse_reg(&tmplmod, opr->name);
691 setup_reg_opr(opr, ret, tmplmod, regmask);
695 // most likely var in data segment
696 opr->type = OPT_LABEL;
697 pp = proto_parse(g_fhdr, opr->name, 0);
701 if (pp->is_fptr || pp->is_func) {
702 opr->lmod = OPLM_DWORD;
706 tmplmod = OPLM_UNSPEC;
707 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
708 anote("unhandled C type '%s' for '%s'\n",
709 pp->type.name, opr->name);
711 if (opr->lmod == OPLM_UNSPEC) {
713 opr->type_from_var = 1;
715 else if (opr->lmod != tmplmod) {
716 opr->size_mismatch = 1;
717 if (tmplmod < opr->lmod)
720 opr->is_ptr = pp->type.is_ptr;
722 opr->is_array = pp->type.is_array;
726 if (opr->lmod == OPLM_UNSPEC)
727 guess_lmod_from_name(opr);
731 static const struct {
736 { "repe", OPF_REP|OPF_REPZ },
737 { "repz", OPF_REP|OPF_REPZ },
738 { "repne", OPF_REP|OPF_REPNZ },
739 { "repnz", OPF_REP|OPF_REPNZ },
740 { "lock", OPF_LOCK }, // ignored for now..
743 #define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
745 static const struct {
748 unsigned short minopr;
749 unsigned short maxopr;
752 unsigned char pfo_inv;
754 { "nop", OP_NOP, 0, 0, 0 },
755 { "push", OP_PUSH, 1, 1, 0 },
756 { "pop", OP_POP, 1, 1, OPF_DATA },
757 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
758 { "mov" , OP_MOV, 2, 2, OPF_DATA },
759 { "lea", OP_LEA, 2, 2, OPF_DATA },
760 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
761 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
762 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
763 { "not", OP_NOT, 1, 1, OPF_DATA },
764 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
765 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
766 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
767 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
768 { "stosb",OP_STOS, 0, 0, OPF_DATA },
769 { "stosw",OP_STOS, 0, 0, OPF_DATA },
770 { "stosd",OP_STOS, 0, 0, OPF_DATA },
771 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
772 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
773 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
774 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
775 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
776 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
777 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
778 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
779 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
780 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
781 { "cld", OP_CLD, 0, 0, OPF_DATA },
782 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
783 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
784 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
785 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
786 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
787 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
788 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
789 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
790 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
791 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
792 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
793 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
794 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
795 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
796 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
797 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
798 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
799 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
800 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
801 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
802 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
803 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
804 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
805 { "test", OP_TEST, 2, 2, OPF_FLAGS },
806 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
807 { "retn", OP_RET, 0, 1, OPF_TAIL },
808 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
809 { "jmp", OP_JMP, 1, 1, OPF_JMP },
810 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
811 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
812 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
813 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
814 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
815 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
816 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
817 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
818 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
819 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
820 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
821 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
822 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
823 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
824 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
825 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
826 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
827 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
828 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
829 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
830 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
831 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
832 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
833 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
834 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
835 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
836 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
837 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
838 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
839 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
840 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
841 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
842 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
843 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
844 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
845 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
846 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
847 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
848 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
849 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
850 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
851 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
852 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
853 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
854 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
855 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
856 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
857 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
858 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
859 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
860 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
861 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
862 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
863 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
864 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
865 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
866 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
867 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
868 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
871 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
873 enum opr_lenmod lmod = OPLM_UNSPEC;
874 int prefix_flags = 0;
882 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
883 if (IS(words[w], pref_table[i].name)) {
884 prefix_flags = pref_table[i].flags;
891 aerr("lone prefix: '%s'\n", words[0]);
896 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
897 if (IS(words[w], op_table[i].name))
901 if (i == ARRAY_SIZE(op_table))
902 aerr("unhandled op: '%s'\n", words[0]);
905 op->op = op_table[i].op;
906 op->flags = op_table[i].flags | prefix_flags;
907 op->pfo = op_table[i].pfo;
908 op->pfo_inv = op_table[i].pfo_inv;
909 op->regmask_src = op->regmask_dst = 0;
912 for (opr = 0; opr < op_table[i].minopr; opr++) {
913 regmask = regmask_ind = 0;
914 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
915 words, wordc, w, op->flags);
917 if (opr == 0 && (op->flags & OPF_DATA))
918 op->regmask_dst = regmask;
919 // for now, mark dst as src too
920 op->regmask_src |= regmask | regmask_ind;
923 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
924 w = parse_operand(&op->operand[opr],
925 &op->regmask_src, &op->regmask_src,
926 words, wordc, w, op->flags);
930 aerr("parse_op %s incomplete: %d/%d\n",
934 op->operand_cnt = opr;
935 if (!strncmp(op_table[i].name, "set", 3))
936 op->operand[0].lmod = OPLM_BYTE;
938 // ops with implicit argumets
942 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
943 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
949 if (op->operand_cnt != 0)
951 if (words[op_w][4] == 'b')
953 else if (words[op_w][4] == 'w')
955 else if (words[op_w][4] == 'd')
958 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
959 lmod, &op->regmask_src);
960 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
961 op->regmask_dst = op->regmask_src;
962 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
963 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
968 if (op->operand_cnt != 0)
970 if (words[op_w][4] == 'b')
972 else if (words[op_w][4] == 'w')
974 else if (words[op_w][4] == 'd')
977 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
978 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
979 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
980 op->regmask_dst = op->regmask_src;
984 op->regmask_src |= op->regmask_dst;
985 op->regmask_dst |= op->regmask_src;
990 op->regmask_src = 1 << xCX;
991 op->operand[0].type = OPT_REG;
992 op->operand[0].reg = xCX;
993 op->operand[0].lmod = OPLM_DWORD;
997 if (op->operand_cnt != 1)
1002 op->regmask_dst = (1 << xDX) | (1 << xAX);
1003 op->regmask_src |= (1 << xAX);
1004 if (op->operand[0].lmod == OPLM_UNSPEC)
1005 op->operand[0].lmod = OPLM_DWORD;
1010 // we could set up operands for edx:eax, but there is no real need to
1011 // (see is_opr_modified())
1012 regmask = (1 << xDX) | (1 << xAX);
1013 op->regmask_dst = regmask;
1014 op->regmask_src |= regmask;
1015 if (op->operand[0].lmod == OPLM_UNSPEC)
1016 op->operand[0].lmod = OPLM_DWORD;
1024 if (op->operand[1].lmod == OPLM_UNSPEC)
1025 op->operand[1].lmod = OPLM_BYTE;
1029 if (op->operand[0].lmod == OPLM_UNSPEC
1030 && (op->operand[0].type == OPT_CONST
1031 || op->operand[0].type == OPT_OFFSET
1032 || op->operand[0].type == OPT_LABEL))
1033 op->operand[0].lmod = OPLM_DWORD;
1039 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1040 && op->operand[0].lmod == op->operand[1].lmod
1041 && op->operand[0].reg == op->operand[1].reg
1042 && IS(op->operand[0].name, op->operand[1].name)) // ah, al..
1044 op->flags |= OPF_RMD;
1045 op->regmask_src = op->regmask_dst = 0;
1050 if (op->operand[0].type == OPT_REG
1051 && op->operand[1].type == OPT_REGMEM)
1054 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1055 if (IS(buf, op->operand[1].name))
1056 op->flags |= OPF_RMD;
1061 // trashed regs must be explicitly detected later
1062 op->regmask_dst = 0;
1070 static const char *op_name(struct parsed_op *po)
1072 static char buf[16];
1076 if (po->op == OP_JCC || po->op == OP_SCC) {
1078 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1081 strcpy(p, parsed_flag_op_names[po->pfo]);
1085 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1086 if (op_table[i].op == po->op)
1087 return op_table[i].name;
1093 static const char *dump_op(struct parsed_op *po)
1095 static char out[128];
1102 snprintf(out, sizeof(out), "%s", op_name(po));
1103 for (i = 0; i < po->operand_cnt; i++) {
1107 snprintf(p, sizeof(out) - (p - out),
1108 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1109 po->operand[i].name);
1115 static const char *lmod_type_u(struct parsed_op *po,
1116 enum opr_lenmod lmod)
1126 ferr(po, "invalid lmod: %d\n", lmod);
1127 return "(_invalid_)";
1131 static const char *lmod_cast_u(struct parsed_op *po,
1132 enum opr_lenmod lmod)
1142 ferr(po, "invalid lmod: %d\n", lmod);
1143 return "(_invalid_)";
1147 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1148 enum opr_lenmod lmod)
1158 ferr(po, "invalid lmod: %d\n", lmod);
1159 return "(_invalid_)";
1163 static const char *lmod_cast_s(struct parsed_op *po,
1164 enum opr_lenmod lmod)
1174 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1175 return "(_invalid_)";
1179 static const char *lmod_cast(struct parsed_op *po,
1180 enum opr_lenmod lmod, int is_signed)
1183 lmod_cast_s(po, lmod) :
1184 lmod_cast_u(po, lmod);
1187 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1197 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1202 static const char *opr_name(struct parsed_op *po, int opr_num)
1204 if (opr_num >= po->operand_cnt)
1205 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1206 return po->operand[opr_num].name;
1209 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1211 if (opr_num >= po->operand_cnt)
1212 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1213 if (po->operand[opr_num].type != OPT_CONST)
1214 ferr(po, "opr %d: const expected\n", opr_num);
1215 return po->operand[opr_num].val;
1218 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1220 if ((unsigned int)popr->reg >= MAX_REGS)
1221 ferr(po, "invalid reg: %d\n", popr->reg);
1222 return regs_r32[popr->reg];
1225 // cast1 is the "final" cast
1226 static const char *simplify_cast(const char *cast1, const char *cast2)
1228 static char buf[256];
1234 if (IS(cast1, cast2))
1236 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1238 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1240 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1242 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1244 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1247 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1251 static const char *simplify_cast_num(const char *cast, unsigned int val)
1253 if (IS(cast, "(u8)") && val < 0x100)
1255 if (IS(cast, "(s8)") && val < 0x80)
1257 if (IS(cast, "(u16)") && val < 0x10000)
1259 if (IS(cast, "(s16)") && val < 0x8000)
1261 if (IS(cast, "(s32)") && val < 0x80000000)
1267 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1276 namelen = strlen(name);
1278 p = strchr(name, '+');
1282 ferr(po, "equ parse failed for '%s'\n", name);
1284 if (IS_START(p, "0x"))
1286 *extra_offs = strtol(p, &endp, 16);
1288 ferr(po, "equ parse failed for '%s'\n", name);
1291 for (i = 0; i < g_eqcnt; i++)
1292 if (strncmp(g_eqs[i].name, name, namelen) == 0
1293 && g_eqs[i].name[namelen] == 0)
1297 ferr(po, "unresolved equ name: '%s'\n", name);
1304 static int is_stack_access(struct parsed_op *po,
1305 const struct parsed_opr *popr)
1307 return (parse_stack_el(popr->name, NULL)
1308 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1309 && IS_START(popr->name, "ebp")));
1312 static void parse_stack_access(struct parsed_op *po,
1313 const char *name, char *ofs_reg, int *offset_out,
1314 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1316 const char *bp_arg = "";
1317 const char *p = NULL;
1318 struct parsed_equ *eq;
1325 if (IS_START(name, "ebp-")
1326 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1329 if (IS_START(p, "0x"))
1331 offset = strtoul(p, &endp, 16);
1335 ferr(po, "ebp- parse of '%s' failed\n", name);
1338 bp_arg = parse_stack_el(name, ofs_reg);
1339 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1340 eq = equ_find(po, bp_arg, &offset);
1342 ferr(po, "detected but missing eq\n");
1343 offset += eq->offset;
1346 if (!strncmp(name, "ebp", 3))
1349 // yes it sometimes LEAs ra for compares..
1350 if (!is_lea && ofs_reg[0] == 0
1351 && stack_ra <= offset && offset < stack_ra + 4)
1353 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1356 *offset_out = offset;
1357 *stack_ra_out = stack_ra;
1359 *bp_arg_out = bp_arg;
1362 static void stack_frame_access(struct parsed_op *po,
1363 struct parsed_opr *popr, char *buf, size_t buf_size,
1364 const char *name, const char *cast, int is_src, int is_lea)
1366 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1367 const char *prefix = "";
1368 const char *bp_arg = NULL;
1369 char ofs_reg[16] = { 0, };
1370 int i, arg_i, arg_s;
1377 if (po->flags & OPF_EBP_S)
1378 ferr(po, "stack_frame_access while ebp is scratch\n");
1380 parse_stack_access(po, name, ofs_reg, &offset,
1381 &stack_ra, &bp_arg, is_lea);
1383 if (offset > stack_ra)
1385 arg_i = (offset - stack_ra - 4) / 4;
1386 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1388 if (g_func_pp->is_vararg
1389 && arg_i == g_func_pp->argc_stack && is_lea)
1391 // should be va_list
1394 snprintf(buf, buf_size, "%sap", cast);
1397 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1398 offset, bp_arg, arg_i);
1400 if (ofs_reg[0] != 0)
1401 ferr(po, "offset reg on arg access?\n");
1403 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1404 if (g_func_pp->arg[i].reg != NULL)
1410 if (i == g_func_pp->argc)
1411 ferr(po, "arg %d not in prototype?\n", arg_i);
1413 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1419 ferr(po, "lea/byte to arg?\n");
1420 if (is_src && (offset & 3) == 0)
1421 snprintf(buf, buf_size, "%sa%d",
1422 simplify_cast(cast, "(u8)"), i + 1);
1424 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1425 cast, offset & 3, i + 1);
1430 ferr(po, "lea/word to arg?\n");
1435 ferr(po, "problematic arg store\n");
1436 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1437 simplify_cast(cast, "*(u16 *)"), i + 1);
1440 ferr(po, "unaligned arg word load\n");
1442 else if (is_src && (offset & 2) == 0)
1443 snprintf(buf, buf_size, "%sa%d",
1444 simplify_cast(cast, "(u16)"), i + 1);
1446 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1447 cast, (offset & 2) ? "HI" : "LO", i + 1);
1459 snprintf(buf, buf_size, "(u32)&a%d + %d",
1462 ferr(po, "unaligned arg store\n");
1464 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1465 snprintf(buf, buf_size, "%s(a%d >> %d)",
1466 prefix, i + 1, (offset & 3) * 8);
1470 snprintf(buf, buf_size, "%s%sa%d",
1471 prefix, is_lea ? "&" : "", i + 1);
1476 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1480 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1483 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1484 if (tmp_lmod != OPLM_DWORD
1485 && (unaligned || (!is_src && tmp_lmod < popr->lmod)))
1487 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1488 i + 1, offset, g_func_pp->arg[i].type.name);
1490 // can't check this because msvc likes to reuse
1491 // arg space for scratch..
1492 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1493 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1497 if (g_stack_fsz == 0)
1498 ferr(po, "stack var access without stackframe\n");
1499 g_stack_frame_used = 1;
1501 sf_ofs = g_stack_fsz + offset;
1502 lim = (ofs_reg[0] != 0) ? -4 : 0;
1503 if (offset > 0 || sf_ofs < lim)
1504 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1514 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1515 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1519 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1520 // known unaligned or possibly unaligned
1521 strcat(g_comment, " unaligned");
1523 prefix = "*(u16 *)&";
1524 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1525 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1528 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1532 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1533 // known unaligned or possibly unaligned
1534 strcat(g_comment, " unaligned");
1536 prefix = "*(u32 *)&";
1537 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1538 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1541 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1545 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1550 static void check_func_pp(struct parsed_op *po,
1551 const struct parsed_proto *pp, const char *pfx)
1555 if (pp->argc_reg != 0) {
1556 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1557 pp_print(buf, sizeof(buf), pp);
1558 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1560 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1561 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1562 pfx, pp->argc_reg, pp->argc_stack);
1566 static const char *check_label_read_ref(struct parsed_op *po,
1569 const struct parsed_proto *pp;
1571 pp = proto_parse(g_fhdr, name, 0);
1573 ferr(po, "proto_parse failed for ref '%s'\n", name);
1576 check_func_pp(po, pp, "ref");
1581 static char *out_src_opr(char *buf, size_t buf_size,
1582 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1585 char tmp1[256], tmp2[256];
1594 switch (popr->type) {
1597 ferr(po, "lea from reg?\n");
1599 switch (popr->lmod) {
1601 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1604 snprintf(buf, buf_size, "%s%s",
1605 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1608 if (popr->name[1] == 'h') // XXX..
1609 snprintf(buf, buf_size, "%s(%s >> 8)",
1610 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1612 snprintf(buf, buf_size, "%s%s",
1613 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1616 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1621 if (is_stack_access(po, popr)) {
1622 stack_frame_access(po, popr, buf, buf_size,
1623 popr->name, cast, 1, is_lea);
1627 strcpy(expr, popr->name);
1628 if (strchr(expr, '[')) {
1629 // special case: '[' can only be left for label[reg] form
1630 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1632 ferr(po, "parse failure for '%s'\n", expr);
1633 if (tmp1[0] == '(') {
1634 // (off_4FFF50+3)[eax]
1635 p = strchr(tmp1 + 1, ')');
1636 if (p == NULL || p[1] != 0)
1637 ferr(po, "parse failure (2) for '%s'\n", expr);
1639 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1641 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1644 // XXX: do we need more parsing?
1646 snprintf(buf, buf_size, "%s", expr);
1650 snprintf(buf, buf_size, "%s(%s)",
1651 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1655 name = check_label_read_ref(po, popr->name);
1656 if (cast[0] == 0 && popr->is_ptr)
1660 snprintf(buf, buf_size, "(u32)&%s", name);
1661 else if (popr->size_lt)
1662 snprintf(buf, buf_size, "%s%s%s%s", cast,
1663 lmod_cast_u_ptr(po, popr->lmod),
1664 popr->is_array ? "" : "&", name);
1666 snprintf(buf, buf_size, "%s%s%s", cast, name,
1667 popr->is_array ? "[0]" : "");
1671 name = check_label_read_ref(po, popr->name);
1675 ferr(po, "lea an offset?\n");
1676 snprintf(buf, buf_size, "%s&%s", cast, name);
1681 ferr(po, "lea from const?\n");
1683 printf_number(tmp1, sizeof(tmp1), popr->val);
1684 if (popr->val == 0 && strchr(cast, '*'))
1685 snprintf(buf, buf_size, "NULL");
1687 snprintf(buf, buf_size, "%s%s",
1688 simplify_cast_num(cast, popr->val), tmp1);
1692 ferr(po, "invalid src type: %d\n", popr->type);
1698 // note: may set is_ptr (we find that out late for ebp frame..)
1699 static char *out_dst_opr(char *buf, size_t buf_size,
1700 struct parsed_op *po, struct parsed_opr *popr)
1702 switch (popr->type) {
1704 switch (popr->lmod) {
1706 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1710 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1714 if (popr->name[1] == 'h') // XXX..
1715 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1717 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1720 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1725 if (is_stack_access(po, popr)) {
1726 stack_frame_access(po, popr, buf, buf_size,
1727 popr->name, "", 0, 0);
1731 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1734 if (popr->size_mismatch)
1735 snprintf(buf, buf_size, "%s%s%s",
1736 lmod_cast_u_ptr(po, popr->lmod),
1737 popr->is_array ? "" : "&", popr->name);
1739 snprintf(buf, buf_size, "%s%s", popr->name,
1740 popr->is_array ? "[0]" : "");
1744 ferr(po, "invalid dst type: %d\n", popr->type);
1750 static char *out_src_opr_u32(char *buf, size_t buf_size,
1751 struct parsed_op *po, struct parsed_opr *popr)
1753 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1756 static void out_test_for_cc(char *buf, size_t buf_size,
1757 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1758 enum opr_lenmod lmod, const char *expr)
1760 const char *cast, *scast;
1762 cast = lmod_cast_u(po, lmod);
1763 scast = lmod_cast_s(po, lmod);
1767 case PFO_BE: // CF=1||ZF=1; CF=0
1768 snprintf(buf, buf_size, "(%s%s %s 0)",
1769 cast, expr, is_inv ? "!=" : "==");
1773 case PFO_L: // SF!=OF; OF=0
1774 snprintf(buf, buf_size, "(%s%s %s 0)",
1775 scast, expr, is_inv ? ">=" : "<");
1778 case PFO_LE: // ZF=1||SF!=OF; OF=0
1779 snprintf(buf, buf_size, "(%s%s %s 0)",
1780 scast, expr, is_inv ? ">" : "<=");
1784 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1788 static void out_cmp_for_cc(char *buf, size_t buf_size,
1789 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1791 const char *cast, *scast, *cast_use;
1792 char buf1[256], buf2[256];
1793 enum opr_lenmod lmod;
1795 if (po->operand[0].lmod != po->operand[1].lmod)
1796 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1797 po->operand[0].lmod, po->operand[1].lmod);
1798 lmod = po->operand[0].lmod;
1800 cast = lmod_cast_u(po, lmod);
1801 scast = lmod_cast_s(po, lmod);
1817 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1820 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1821 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
1825 // note: must be unsigned compare
1826 snprintf(buf, buf_size, "(%s %s %s)",
1827 buf1, is_inv ? ">=" : "<", buf2);
1831 snprintf(buf, buf_size, "(%s %s %s)",
1832 buf1, is_inv ? "!=" : "==", buf2);
1836 // note: must be unsigned compare
1837 snprintf(buf, buf_size, "(%s %s %s)",
1838 buf1, is_inv ? ">" : "<=", buf2);
1841 if (is_inv && lmod == OPLM_BYTE
1842 && po->operand[1].type == OPT_CONST
1843 && po->operand[1].val == 0xff)
1845 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
1846 snprintf(buf, buf_size, "(0)");
1850 // note: must be signed compare
1852 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1853 scast, buf1, buf2, is_inv ? ">=" : "<");
1857 snprintf(buf, buf_size, "(%s %s %s)",
1858 buf1, is_inv ? ">=" : "<", buf2);
1862 snprintf(buf, buf_size, "(%s %s %s)",
1863 buf1, is_inv ? ">" : "<=", buf2);
1871 static void out_cmp_test(char *buf, size_t buf_size,
1872 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1874 char buf1[256], buf2[256], buf3[256];
1876 if (po->op == OP_TEST) {
1877 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1878 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1881 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1882 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1883 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1885 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1886 po->operand[0].lmod, buf3);
1888 else if (po->op == OP_CMP) {
1889 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
1892 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1895 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1896 struct parsed_opr *popr2)
1898 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1899 ferr(po, "missing lmod for both operands\n");
1901 if (popr1->lmod == OPLM_UNSPEC)
1902 popr1->lmod = popr2->lmod;
1903 else if (popr2->lmod == OPLM_UNSPEC)
1904 popr2->lmod = popr1->lmod;
1905 else if (popr1->lmod != popr2->lmod) {
1906 if (popr1->type_from_var) {
1907 popr1->size_mismatch = 1;
1908 if (popr1->lmod < popr2->lmod)
1910 popr1->lmod = popr2->lmod;
1912 else if (popr2->type_from_var) {
1913 popr2->size_mismatch = 1;
1914 if (popr2->lmod < popr1->lmod)
1916 popr2->lmod = popr1->lmod;
1919 ferr(po, "conflicting lmods: %d vs %d\n",
1920 popr1->lmod, popr2->lmod);
1924 static const char *op_to_c(struct parsed_op *po)
1948 ferr(po, "op_to_c was supplied with %d\n", po->op);
1952 static void op_set_clear_flag(struct parsed_op *po,
1953 enum op_flags flag_set, enum op_flags flag_clear)
1955 po->flags |= flag_set;
1956 po->flags &= ~flag_clear;
1959 // last op in stream - unconditional branch or ret
1960 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
1961 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
1962 && ops[_i].op != OP_CALL))
1964 static int scan_for_pop(int i, int opcnt, const char *reg,
1965 int magic, int depth, int *maxdepth, int do_flags)
1967 const struct parsed_proto *pp;
1968 struct parsed_op *po;
1972 for (; i < opcnt; i++) {
1974 if (po->cc_scratch == magic)
1975 break; // already checked
1976 po->cc_scratch = magic;
1978 if (po->flags & OPF_TAIL) {
1979 if (po->op == OP_CALL) {
1980 pp = proto_parse(g_fhdr, po->operand[0].name, 0);
1981 if (pp != NULL && pp->is_noreturn)
1982 // no stack cleanup for noreturn
1985 return -1; // deadend
1988 if ((po->flags & OPF_RMD)
1989 || (po->op == OP_PUSH && po->argnum != 0)) // arg push
1992 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1993 if (po->btj != NULL) {
1995 for (j = 0; j < po->btj->count; j++) {
1996 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1997 depth, maxdepth, do_flags);
1999 return ret; // dead end
2005 ferr(po, "dead branch\n");
2009 if (po->flags & OPF_CJMP) {
2010 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2011 depth, maxdepth, do_flags);
2013 return ret; // dead end
2021 if ((po->op == OP_POP || po->op == OP_PUSH)
2022 && po->operand[0].type == OPT_REG
2023 && IS(po->operand[0].name, reg))
2025 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)) {
2027 if (depth > *maxdepth)
2030 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2032 else if (po->op == OP_POP) {
2035 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2040 if (depth < 0) // should not happen
2041 ferr(po, "fail with depth\n");
2043 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2052 // scan for pop starting from 'ret' op (all paths)
2053 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2059 for (; i < opcnt; i++) {
2060 if (!(ops[i].flags & OPF_TAIL))
2063 for (j = i - 1; j >= 0; j--) {
2064 if (ops[j].flags & OPF_RMD)
2066 if (ops[j].flags & OPF_JMP)
2069 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
2070 && IS(ops[j].operand[0].name, reg))
2073 ops[j].flags |= flag_set;
2077 if (g_labels[j][0] != 0)
2082 return found ? 0 : -1;
2085 static void scan_propagate_df(int i, int opcnt)
2087 struct parsed_op *po = &ops[i];
2090 for (; i < opcnt; i++) {
2092 if (po->flags & OPF_DF)
2093 return; // already resolved
2094 po->flags |= OPF_DF;
2096 if (po->op == OP_CALL)
2097 ferr(po, "call with DF set?\n");
2099 if (po->flags & OPF_JMP) {
2100 if (po->btj != NULL) {
2102 for (j = 0; j < po->btj->count; j++)
2103 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2108 ferr(po, "dead branch\n");
2112 if (po->flags & OPF_CJMP)
2113 scan_propagate_df(po->bt_i, opcnt);
2119 if (po->flags & OPF_TAIL)
2122 if (po->op == OP_CLD) {
2123 po->flags |= OPF_RMD;
2128 ferr(po, "missing DF clear?\n");
2131 // is operand 'opr' modified by parsed_op 'po'?
2132 static int is_opr_modified(const struct parsed_opr *opr,
2133 const struct parsed_op *po)
2137 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2140 if (opr->type == OPT_REG) {
2141 if (po->op == OP_CALL) {
2142 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2143 if ((1 << opr->reg) & mask)
2149 if (po->operand[0].type == OPT_REG) {
2150 if (po->regmask_dst & (1 << opr->reg))
2157 return IS(po->operand[0].name, opr->name);
2160 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2161 static int is_any_opr_modified(const struct parsed_op *po_test,
2162 const struct parsed_op *po, int c_mode)
2167 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2170 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2173 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2176 // in reality, it can wreck any register, but in decompiled C
2177 // version it can only overwrite eax or edx:eax
2178 mask = (1 << xAX) | (1 << xDX);
2182 if (po->op == OP_CALL
2183 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2186 for (i = 0; i < po_test->operand_cnt; i++)
2187 if (IS(po_test->operand[i].name, po->operand[0].name))
2193 // scan for any po_test operand modification in range given
2194 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2197 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2200 for (; i < opcnt; i++) {
2201 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2208 // scan for po_test operand[0] modification in range given
2209 static int scan_for_mod_opr0(struct parsed_op *po_test,
2212 for (; i < opcnt; i++) {
2213 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2220 static int scan_for_flag_set(int i, int magic, int *branched,
2221 int *setters, int *setter_cnt)
2223 struct label_ref *lr;
2227 if (ops[i].cc_scratch == magic) {
2228 ferr(&ops[i], "%s looped\n", __func__);
2231 ops[i].cc_scratch = magic;
2233 if (g_labels[i][0] != 0) {
2236 lr = &g_label_refs[i];
2237 for (; lr->next; lr = lr->next) {
2238 ret = scan_for_flag_set(lr->i, magic,
2239 branched, setters, setter_cnt);
2244 if (i > 0 && LAST_OP(i - 1)) {
2248 ret = scan_for_flag_set(lr->i, magic,
2249 branched, setters, setter_cnt);
2255 if (ops[i].flags & OPF_FLAGS) {
2256 setters[*setter_cnt] = i;
2261 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2268 // scan back for cdq, if anything modifies edx, fail
2269 static int scan_for_cdq_edx(int i)
2272 if (g_labels[i][0] != 0) {
2273 if (g_label_refs[i].next != NULL)
2275 if (i > 0 && LAST_OP(i - 1)) {
2276 i = g_label_refs[i].i;
2283 if (ops[i].op == OP_CDQ)
2286 if (ops[i].regmask_dst & (1 << xDX))
2293 static int scan_for_reg_clear(int i, int reg)
2296 if (g_labels[i][0] != 0) {
2297 if (g_label_refs[i].next != NULL)
2299 if (i > 0 && LAST_OP(i - 1)) {
2300 i = g_label_refs[i].i;
2307 if (ops[i].op == OP_XOR
2308 && ops[i].operand[0].lmod == OPLM_DWORD
2309 && ops[i].operand[0].reg == ops[i].operand[1].reg
2310 && ops[i].operand[0].reg == reg)
2313 if (ops[i].regmask_dst & (1 << reg))
2320 // scan for positive, constant esp adjust
2321 static int scan_for_esp_adjust(int i, int opcnt, int *adj,
2324 struct parsed_op *po;
2327 *adj = *multipath = 0;
2329 for (; i < opcnt; i++) {
2332 if (g_labels[i][0] != 0)
2335 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2336 if (po->operand[1].type != OPT_CONST)
2337 ferr(&ops[i], "non-const esp adjust?\n");
2338 *adj += po->operand[1].val;
2340 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2343 else if (po->op == OP_PUSH && !(po->flags & OPF_RMD)) {
2344 //if (first_pop == -1)
2345 // first_pop = -2; // none
2346 *adj -= lmod_bytes(po, po->operand[0].lmod);
2348 else if (po->op == OP_POP && !(po->flags & OPF_RMD)) {
2349 // seems like msvc only uses 'pop ecx' for stack realignment..
2350 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2352 if (first_pop == -1 && *adj >= 0)
2354 *adj += lmod_bytes(po, po->operand[0].lmod);
2356 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2357 if (po->op == OP_JMP && po->btj == NULL) {
2361 if (po->op != OP_CALL)
2363 if (po->operand[0].type != OPT_LABEL)
2365 if (po->pp != NULL && po->pp->is_stdcall)
2370 if (first_pop >= 0) {
2371 // probably 'pop ecx' was used..
2378 static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2380 struct parsed_op *po;
2384 ferr(ops, "%s: followed bad branch?\n", __func__);
2386 for (; i < opcnt; i++) {
2388 if (po->cc_scratch == magic)
2390 po->cc_scratch = magic;
2393 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2394 if (po->btj != NULL) {
2396 for (j = 0; j < po->btj->count; j++)
2397 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2401 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2402 if (!(po->flags & OPF_CJMP))
2405 if (po->flags & OPF_TAIL)
2410 static const struct parsed_proto *try_recover_pp(
2411 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2413 const struct parsed_proto *pp = NULL;
2417 // maybe an arg of g_func?
2418 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2420 char ofs_reg[16] = { 0, };
2421 int arg, arg_s, arg_i;
2425 parse_stack_access(po, opr->name, ofs_reg,
2426 &offset, &stack_ra, NULL, 0);
2427 if (ofs_reg[0] != 0)
2428 ferr(po, "offset reg on arg access?\n");
2429 if (offset <= stack_ra) {
2430 // search who set the stack var instead
2431 if (search_instead != NULL)
2432 *search_instead = 1;
2436 arg_i = (offset - stack_ra - 4) / 4;
2437 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2438 if (g_func_pp->arg[arg].reg != NULL)
2444 if (arg == g_func_pp->argc)
2445 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2447 pp = g_func_pp->arg[arg].fptr;
2449 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2450 check_func_pp(po, pp, "icall arg");
2452 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2454 p = strchr(opr->name + 1, '[');
2455 memcpy(buf, opr->name, p - opr->name);
2456 buf[p - opr->name] = 0;
2457 pp = proto_parse(g_fhdr, buf, 0);
2459 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2460 pp = proto_parse(g_fhdr, opr->name, 0);
2462 ferr(po, "proto_parse failed for icall from '%s'\n", opr->name);
2463 check_func_pp(po, pp, "reg-fptr ref");
2469 static void scan_for_call_type(int i, const struct parsed_opr *opr,
2470 int magic, const struct parsed_proto **pp_found, int *multi)
2472 const struct parsed_proto *pp = NULL;
2473 struct parsed_op *po;
2474 struct label_ref *lr;
2476 ops[i].cc_scratch = magic;
2479 if (g_labels[i][0] != 0) {
2480 lr = &g_label_refs[i];
2481 for (; lr != NULL; lr = lr->next)
2482 scan_for_call_type(lr->i, opr, magic, pp_found, multi);
2483 if (i > 0 && LAST_OP(i - 1))
2491 if (ops[i].cc_scratch == magic)
2493 ops[i].cc_scratch = magic;
2495 if (!(ops[i].flags & OPF_DATA))
2497 if (!is_opr_modified(opr, &ops[i]))
2499 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2500 // most probably trashed by some processing
2505 opr = &ops[i].operand[1];
2506 if (opr->type != OPT_REG)
2510 po = (i >= 0) ? &ops[i] : ops;
2513 // reached the top - can only be an arg-reg
2514 if (opr->type != OPT_REG)
2517 for (i = 0; i < g_func_pp->argc; i++) {
2518 if (g_func_pp->arg[i].reg == NULL)
2520 if (IS(opr->name, g_func_pp->arg[i].reg))
2523 if (i == g_func_pp->argc)
2525 pp = g_func_pp->arg[i].fptr;
2527 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2528 i + 1, g_func_pp->arg[i].reg);
2529 check_func_pp(po, pp, "icall reg-arg");
2532 pp = try_recover_pp(po, opr, NULL);
2534 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2535 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2536 || (*pp_found)->is_stdcall != pp->is_stdcall
2537 || (*pp_found)->is_fptr != pp->is_fptr
2538 || (*pp_found)->argc != pp->argc
2539 || (*pp_found)->argc_reg != pp->argc_reg
2540 || (*pp_found)->argc_stack != pp->argc_stack)
2542 ferr(po, "icall: parsed_proto mismatch\n");
2550 static const struct parsed_proto *resolve_icall(int i, int opcnt,
2553 const struct parsed_proto *pp = NULL;
2554 int search_advice = 0;
2558 switch (ops[i].operand[0].type) {
2562 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
2567 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
2575 static int try_resolve_const(int i, const struct parsed_opr *opr,
2576 int magic, unsigned int *val)
2578 struct label_ref *lr;
2581 ops[i].cc_scratch = magic;
2584 if (g_labels[i][0] != 0) {
2585 lr = &g_label_refs[i];
2586 for (; lr != NULL; lr = lr->next)
2587 ret |= try_resolve_const(lr->i, opr, magic, val);
2588 if (i > 0 && LAST_OP(i - 1))
2596 if (ops[i].cc_scratch == magic)
2598 ops[i].cc_scratch = magic;
2600 if (!(ops[i].flags & OPF_DATA))
2602 if (!is_opr_modified(opr, &ops[i]))
2604 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
2607 *val = ops[i].operand[1].val;
2612 static int collect_call_args_r(struct parsed_op *po, int i,
2613 struct parsed_proto *pp, int *regmask, int *save_arg_vars, int arg,
2614 int magic, int need_op_saving, int may_reuse)
2616 struct parsed_proto *pp_tmp;
2617 struct label_ref *lr;
2618 int need_to_save_current;
2623 ferr(po, "dead label encountered\n");
2627 for (; arg < pp->argc; arg++)
2628 if (pp->arg[arg].reg == NULL)
2630 magic = (magic & 0xffffff) | (arg << 24);
2632 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
2634 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
2635 if (ops[j].cc_scratch != magic) {
2636 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
2640 // ok: have already been here
2643 ops[j].cc_scratch = magic;
2645 if (g_labels[j][0] != 0 && g_label_refs[j].i != -1) {
2646 lr = &g_label_refs[j];
2647 if (lr->next != NULL)
2649 for (; lr->next; lr = lr->next) {
2650 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2652 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2653 arg, magic, need_op_saving, may_reuse);
2658 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
2660 if (j > 0 && LAST_OP(j - 1)) {
2661 // follow last branch in reverse
2666 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
2667 arg, magic, need_op_saving, may_reuse);
2673 if (ops[j].op == OP_CALL)
2675 if (pp->is_unresolved)
2680 ferr(po, "arg collect hit unparsed call '%s'\n",
2681 ops[j].operand[0].name);
2682 if (may_reuse && pp_tmp->argc_stack > 0)
2683 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2684 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2686 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP) {
2687 if (pp->is_unresolved)
2690 ferr(po, "arg collect %d/%d hit esp adjust\n",
2693 else if (ops[j].op == OP_POP) {
2694 if (pp->is_unresolved)
2697 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2699 else if (ops[j].flags & OPF_CJMP)
2701 if (pp->is_unresolved)
2706 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2708 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
2711 pp->arg[arg].datap = &ops[j];
2712 need_to_save_current = 0;
2713 if (!need_op_saving) {
2714 ret = scan_for_mod(&ops[j], j + 1, i, 1);
2715 need_to_save_current = (ret >= 0);
2717 if (need_op_saving || need_to_save_current) {
2718 // mark this push as one that needs operand saving
2719 ops[j].flags &= ~OPF_RMD;
2720 if (ops[j].argnum == 0) {
2721 ops[j].argnum = arg + 1;
2722 *save_arg_vars |= 1 << arg;
2724 else if (ops[j].argnum < arg + 1)
2725 ferr(&ops[j], "argnum conflict (%d<%d) for '%s'\n",
2726 ops[j].argnum, arg + 1, pp->name);
2728 else if (ops[j].argnum == 0)
2729 ops[j].flags |= OPF_RMD;
2731 // some PUSHes are reused by different calls on other branches,
2732 // but that can't happen if we didn't branch, so they
2733 // can be removed from future searches (handles nested calls)
2735 ops[j].flags |= OPF_FARG;
2737 ops[j].flags &= ~OPF_RSAVE;
2740 if (!pp->is_unresolved) {
2742 for (; arg < pp->argc; arg++)
2743 if (pp->arg[arg].reg == NULL)
2746 magic = (magic & 0xffffff) | (arg << 24);
2748 // tracking reg usage
2749 if (ops[j].operand[0].type == OPT_REG)
2750 *regmask |= 1 << ops[j].operand[0].reg;
2754 if (arg < pp->argc) {
2755 ferr(po, "arg collect failed for '%s': %d/%d\n",
2756 pp->name, arg, pp->argc);
2763 static int collect_call_args(struct parsed_op *po, int i,
2764 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
2770 ret = collect_call_args_r(po, i, pp, regmask, save_arg_vars,
2775 if (pp->is_unresolved) {
2777 pp->argc_stack += ret;
2778 for (a = 0; a < pp->argc; a++)
2779 if (pp->arg[a].type.name == NULL)
2780 pp->arg[a].type.name = strdup("int");
2786 // early check for tail call or branch back
2787 static int is_like_tailjmp(int j)
2789 if (!(ops[j].flags & OPF_JMP))
2792 if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds)
2793 // probably local branch back..
2795 if (ops[j].op == OP_CALL)
2796 // probably noreturn call..
2802 static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
2806 for (i = 0; i < pp->argc; i++)
2807 if (pp->arg[i].reg == NULL)
2811 memmove(&pp->arg[i + 1], &pp->arg[i],
2812 sizeof(pp->arg[0]) * pp->argc_stack);
2813 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
2814 pp->arg[i].reg = strdup(reg);
2815 pp->arg[i].type.name = strdup("int");
2820 static void add_label_ref(struct label_ref *lr, int op_i)
2822 struct label_ref *lr_new;
2829 lr_new = calloc(1, sizeof(*lr_new));
2831 lr_new->next = lr->next;
2835 static void output_std_flags(FILE *fout, struct parsed_op *po,
2836 int *pfomask, const char *dst_opr_text)
2838 if (*pfomask & (1 << PFO_Z)) {
2839 fprintf(fout, "\n cond_z = (%s%s == 0);",
2840 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
2841 *pfomask &= ~(1 << PFO_Z);
2843 if (*pfomask & (1 << PFO_S)) {
2844 fprintf(fout, "\n cond_s = (%s%s < 0);",
2845 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
2846 *pfomask &= ~(1 << PFO_S);
2850 static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
2853 if (pp->is_fastcall)
2854 fprintf(fout, "__fastcall ");
2855 else if (pp->is_stdcall && pp->argc_reg == 0)
2856 fprintf(fout, "__stdcall ");
2857 if (pp->is_noreturn || is_noreturn)
2858 fprintf(fout, "noreturn ");
2861 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
2863 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
2864 struct parsed_opr *last_arith_dst = NULL;
2865 char buf1[256], buf2[256], buf3[256], cast[64];
2866 const struct parsed_proto *pp_c;
2867 struct parsed_proto *pp, *pp_tmp;
2868 struct parsed_data *pd;
2869 const char *tmpname;
2871 int save_arg_vars = 0;
2873 int need_tmp_var = 0;
2876 int label_pending = 0;
2877 int regmask_save = 0;
2878 int regmask_arg = 0;
2879 int regmask_now = 0;
2880 int regmask_init = 0;
2891 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
2892 g_stack_frame_used = 0;
2894 g_func_pp = proto_parse(fhdr, funcn, 0);
2895 if (g_func_pp == NULL)
2896 ferr(ops, "proto_parse failed for '%s'\n", funcn);
2898 for (i = 0; i < g_func_pp->argc; i++) {
2899 if (g_func_pp->arg[i].reg != NULL) {
2900 reg = char_array_i(regs_r32,
2901 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
2903 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
2904 regmask_arg |= 1 << reg;
2909 // - handle ebp/esp frame, remove ops related to it
2910 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2911 && ops[1].op == OP_MOV
2912 && IS(opr_name(&ops[1], 0), "ebp")
2913 && IS(opr_name(&ops[1], 1), "esp"))
2918 ops[0].flags |= OPF_RMD;
2919 ops[1].flags |= OPF_RMD;
2922 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2923 g_stack_fsz = opr_const(&ops[2], 1);
2924 ops[2].flags |= OPF_RMD;
2928 // another way msvc builds stack frame..
2930 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2932 ops[i].flags |= OPF_RMD;
2936 // and another way..
2937 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
2938 && ops[i].operand[1].type == OPT_CONST
2939 && ops[i + 1].op == OP_CALL
2940 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
2942 g_stack_fsz += ops[i].operand[1].val;
2943 ops[i].flags |= OPF_RMD;
2945 ops[i].flags |= OPF_RMD;
2952 for (; i < opcnt; i++)
2953 if (ops[i].op == OP_RET)
2956 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
2957 if (found && is_like_tailjmp(j))
2962 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
2963 || ops[j].op == OP_LEAVE)
2965 ops[j].flags |= OPF_RMD;
2967 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2968 ferr(&ops[j], "'pop ebp' expected\n");
2970 if (g_stack_fsz != 0) {
2971 if (ops[j - 1].op == OP_MOV
2972 && IS(opr_name(&ops[j - 1], 0), "esp")
2973 && IS(opr_name(&ops[j - 1], 1), "ebp"))
2975 ops[j - 1].flags |= OPF_RMD;
2977 else if (ops[j].op != OP_LEAVE
2978 && !(g_ida_func_attr & IDAFA_NORETURN))
2980 ferr(&ops[j - 1], "esp restore expected\n");
2983 if (ecx_push && ops[j - 2].op == OP_POP
2984 && IS(opr_name(&ops[j - 2], 0), "ecx"))
2986 ferr(&ops[j - 2], "unexpected ecx pop\n");
2992 } while (i < opcnt);
2995 for (i = 0; i < opcnt; i++) {
2996 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2998 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2999 && ops[i].operand[1].type == OPT_CONST)
3009 g_stack_fsz = ops[i].operand[1].val;
3010 ops[i].flags |= OPF_RMD;
3014 for (; i < opcnt; i++)
3015 if (ops[i].op == OP_RET)
3018 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3019 if (found && is_like_tailjmp(j))
3024 if (ops[j].op != OP_ADD
3025 || !IS(opr_name(&ops[j], 0), "esp")
3026 || ops[j].operand[1].type != OPT_CONST
3027 || ops[j].operand[1].val != g_stack_fsz)
3028 ferr(&ops[j], "'add esp' expected\n");
3029 ops[j].flags |= OPF_RMD;
3033 } while (i < opcnt);
3038 // - parse calls with labels
3039 // - resolve all branches
3040 for (i = 0; i < opcnt; i++)
3046 if (po->flags & OPF_RMD)
3049 if (po->op == OP_CALL) {
3052 if (po->operand[0].type == OPT_LABEL) {
3053 tmpname = opr_name(po, 0);
3054 if (IS_START(tmpname, "loc_"))
3055 ferr(po, "call to loc_*\n");
3056 pp_c = proto_parse(fhdr, tmpname, 0);
3058 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3060 pp = proto_clone(pp_c);
3061 my_assert_not(pp, NULL);
3063 else if (po->datap != NULL) {
3064 pp = calloc(1, sizeof(*pp));
3065 my_assert_not(pp, NULL);
3067 ret = parse_protostr(po->datap, pp);
3069 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3076 check_func_pp(po, pp, "fptr var call");
3077 if (pp->is_noreturn)
3078 po->flags |= OPF_TAIL;
3084 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3087 if (po->operand[0].type == OPT_REGMEM) {
3088 char *p = strchr(po->operand[0].name, '[');
3091 ret = p - po->operand[0].name;
3092 strncpy(buf1, po->operand[0].name, ret);
3095 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3096 if (IS(g_func_pd[j].label, buf1)) {
3102 //ferr(po, "label '%s' not parsed?\n", buf1);
3104 if (pd->type != OPT_OFFSET)
3105 ferr(po, "label '%s' with non-offset data?\n", buf1);
3107 // find all labels, link
3108 for (j = 0; j < pd->count; j++) {
3109 for (l = 0; l < opcnt; l++) {
3110 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
3111 add_label_ref(&g_label_refs[l], i);
3122 for (l = 0; l < opcnt; l++) {
3123 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
3124 if (l == i + 1 && po->op == OP_JMP) {
3125 // yet another alignment type..
3126 po->flags |= OPF_RMD;
3129 add_label_ref(&g_label_refs[l], i);
3135 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3138 if (po->operand[0].type == OPT_LABEL)
3142 ferr(po, "unhandled branch\n");
3146 po->flags |= OPF_TAIL;
3147 if (i > 0 && ops[i - 1].op == OP_POP)
3148 po->flags |= OPF_ATAIL;
3153 // - remove dead labels
3155 for (i = 0; i < opcnt; i++)
3157 if (g_labels[i][0] != 0 && g_label_refs[i].i == -1)
3161 if (po->flags & OPF_RMD)
3164 if (po->op == OP_CALL)
3166 tmpname = opr_name(po, 0);
3171 pp_c = resolve_icall(i, opcnt, &l);
3173 pp = proto_clone(pp_c);
3174 my_assert_not(pp, NULL);
3176 // not resolved just to single func
3179 switch (po->operand[0].type) {
3181 // we resolved this call and no longer need the register
3182 po->regmask_src &= ~(1 << po->operand[0].reg);
3192 pp = calloc(1, sizeof(*pp));
3193 my_assert_not(pp, NULL);
3195 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3197 if (!g_allow_regfunc)
3198 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3199 pp->is_unresolved = 1;
3203 if (j > ARRAY_SIZE(pp->arg))
3204 ferr(po, "esp adjust too large: %d\n", j);
3205 pp->ret_type.name = strdup("int");
3206 pp->argc = pp->argc_stack = j;
3207 for (arg = 0; arg < pp->argc; arg++)
3208 pp->arg[arg].type.name = strdup("int");
3213 // look for and make use of esp adjust
3215 if (!pp->is_stdcall && pp->argc_stack > 0)
3216 ret = scan_for_esp_adjust(i + 1, opcnt, &j, &l);
3218 if (pp->is_vararg) {
3219 if (j / 4 < pp->argc_stack)
3220 ferr(po, "esp adjust is too small: %x < %x\n",
3221 j, pp->argc_stack * 4);
3222 // modify pp to make it have varargs as normal args
3224 pp->argc += j / 4 - pp->argc_stack;
3225 for (; arg < pp->argc; arg++) {
3226 pp->arg[arg].type.name = strdup("int");
3229 if (pp->argc > ARRAY_SIZE(pp->arg))
3230 ferr(po, "too many args for '%s'\n", tmpname);
3232 if (pp->argc_stack != j / 4)
3233 ferr(po, "stack tracking failed for '%s': %x %x\n",
3234 tmpname, pp->argc_stack * 4, j);
3236 ops[ret].flags |= OPF_RMD;
3237 if (ops[ret].op == OP_POP && j > 4) {
3238 // deal with multi-pop stack adjust
3240 while (ops[ret].op == OP_POP && j > 0 && ret < opcnt) {
3241 ops[ret].flags |= OPF_RMD;
3247 // a bit of a hack, but deals with use of
3248 // single adj for multiple calls
3249 ops[ret].operand[1].val -= j;
3252 else if (pp->is_vararg)
3253 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3256 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
3257 // since we know the args, collect them
3258 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3262 if (strstr(pp->ret_type.name, "int64"))
3268 // - find POPs for PUSHes, rm both
3269 // - scan for STD/CLD, propagate DF
3270 // - scan for all used registers
3271 // - find flag set ops for their users
3272 // - do unreselved calls
3273 // - declare indirect functions
3274 for (i = 0; i < opcnt; i++) {
3276 if (po->flags & OPF_RMD)
3279 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
3280 reg = po->operand[0].reg;
3281 if (!(regmask & (1 << reg)))
3282 // not a reg save after all, rerun scan_for_pop
3283 po->flags &= ~OPF_RSAVE;
3285 regmask_save |= 1 << reg;
3288 if (po->op == OP_PUSH && po->argnum == 0
3289 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
3291 if (po->operand[0].type == OPT_REG)
3293 reg = po->operand[0].reg;
3295 ferr(po, "reg not set for push?\n");
3298 ret = scan_for_pop(i + 1, opcnt,
3299 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
3302 ferr(po, "too much depth: %d\n", depth);
3304 po->flags |= OPF_RMD;
3305 scan_for_pop(i + 1, opcnt, po->operand[0].name,
3306 i + opcnt * 4, 0, &depth, 1);
3309 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
3312 if (regmask & (1 << reg)) {
3313 if (regmask_save & (1 << reg))
3314 ferr(po, "%s already saved?\n", po->operand[0].name);
3318 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
3322 else if (po->operand[0].type == OPT_CONST) {
3323 for (j = i + 1; j < opcnt; j++) {
3324 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
3325 || ops[j].op == OP_PUSH || g_labels[i][0] != 0)
3330 if (!(ops[j].flags & OPF_RMD) && ops[j].op == OP_POP)
3332 po->flags |= OPF_RMD;
3340 if (po->op == OP_STD) {
3341 po->flags |= OPF_DF | OPF_RMD;
3342 scan_propagate_df(i + 1, opcnt);
3345 regmask_now = po->regmask_src | po->regmask_dst;
3346 if (regmask_now & (1 << xBP)) {
3347 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
3348 if (po->regmask_dst & (1 << xBP))
3349 // compiler decided to drop bp frame and use ebp as scratch
3350 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
3352 regmask_now &= ~(1 << xBP);
3356 regmask |= regmask_now;
3358 if (po->flags & OPF_CC)
3360 int setters[16], cnt = 0, branched = 0;
3362 ret = scan_for_flag_set(i, i + opcnt * 6,
3363 &branched, setters, &cnt);
3364 if (ret < 0 || cnt <= 0)
3365 ferr(po, "unable to trace flag setter(s)\n");
3366 if (cnt > ARRAY_SIZE(setters))
3367 ferr(po, "too many flag setters\n");
3369 for (j = 0; j < cnt; j++)
3371 tmp_op = &ops[setters[j]]; // flag setter
3374 // to get nicer code, we try to delay test and cmp;
3375 // if we can't because of operand modification, or if we
3376 // have arith op, or branch, make it calculate flags explicitly
3377 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
3379 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
3380 pfomask = 1 << po->pfo;
3382 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
3383 pfomask = 1 << po->pfo;
3386 // see if we'll be able to handle based on op result
3387 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
3388 && po->pfo != PFO_Z && po->pfo != PFO_S
3389 && po->pfo != PFO_P)
3391 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
3393 pfomask = 1 << po->pfo;
3396 if (tmp_op->op == OP_ADD && po->pfo == PFO_C)
3400 tmp_op->pfomask |= pfomask;
3401 cond_vars |= pfomask;
3403 // note: may overwrite, currently not a problem
3407 if (po->op == OP_RCL || po->op == OP_RCR
3408 || po->op == OP_ADC || po->op == OP_SBB)
3409 cond_vars |= 1 << PFO_C;
3412 if (po->op == OP_CMPS || po->op == OP_SCAS) {
3413 cond_vars |= 1 << PFO_Z;
3415 else if (po->op == OP_MUL
3416 || (po->op == OP_IMUL && po->operand_cnt == 1))
3420 else if (po->op == OP_CALL) {
3423 ferr(po, "NULL pp\n");
3425 if (pp->is_unresolved) {
3426 int regmask_stack = 0;
3427 collect_call_args(po, i, pp, ®mask, &save_arg_vars,
3430 // this is pretty rough guess:
3431 // see ecx and edx were pushed (and not their saved versions)
3432 for (arg = 0; arg < pp->argc; arg++) {
3433 if (pp->arg[arg].reg != NULL)
3436 tmp_op = pp->arg[arg].datap;
3438 ferr(po, "parsed_op missing for arg%d\n", arg);
3439 if (tmp_op->argnum == 0 && tmp_op->operand[0].type == OPT_REG)
3440 regmask_stack |= 1 << tmp_op->operand[0].reg;
3443 if (!((regmask_stack & (1 << xCX))
3444 && (regmask_stack & (1 << xDX))))
3446 if (pp->argc_stack != 0
3447 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
3449 pp_insert_reg_arg(pp, "ecx");
3450 pp->is_fastcall = 1;
3451 regmask_init |= 1 << xCX;
3452 regmask |= 1 << xCX;
3454 if (pp->argc_stack != 0
3455 || ((regmask | regmask_arg) & (1 << xDX)))
3457 pp_insert_reg_arg(pp, "edx");
3458 regmask_init |= 1 << xDX;
3459 regmask |= 1 << xDX;
3463 // note: __cdecl doesn't fall into is_unresolved category
3464 if (pp->argc_stack > 0)
3468 for (arg = 0; arg < pp->argc; arg++) {
3469 if (pp->arg[arg].reg != NULL) {
3470 reg = char_array_i(regs_r32,
3471 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
3473 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
3474 if (!(regmask & (1 << reg))) {
3475 regmask_init |= 1 << reg;
3476 regmask |= 1 << reg;
3481 else if (po->op == OP_MOV && po->operand[0].pp != NULL
3482 && po->operand[1].pp != NULL)
3484 // <var> = offset <something>
3485 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
3486 && !IS_START(po->operand[1].name, "off_"))
3488 if (!po->operand[0].pp->is_fptr)
3489 ferr(po, "%s not declared as fptr when it should be\n",
3490 po->operand[0].name);
3491 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
3492 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
3493 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
3494 fnote(po, "var: %s\n", buf1);
3495 fnote(po, "func: %s\n", buf2);
3496 ferr(po, "^ mismatch\n");
3500 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
3501 regmask |= 1 << xAX;
3502 else if (po->op == OP_DIV || po->op == OP_IDIV) {
3503 // 32bit division is common, look for it
3504 if (po->op == OP_DIV)
3505 ret = scan_for_reg_clear(i, xDX);
3507 ret = scan_for_cdq_edx(i);
3509 po->flags |= OPF_32BIT;
3513 else if (po->op == OP_CLD)
3514 po->flags |= OPF_RMD;
3516 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
3522 // - confirm regmask_save, it might have been reduced
3523 if (regmask_save != 0)
3526 for (i = 0; i < opcnt; i++) {
3528 if (po->flags & OPF_RMD)
3531 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
3532 regmask_save |= 1 << po->operand[0].reg;
3536 // output starts here
3538 // define userstack size
3539 if (g_func_pp->is_userstack) {
3540 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
3541 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
3542 fprintf(fout, "#endif\n");
3545 // the function itself
3546 fprintf(fout, "%s ", g_func_pp->ret_type.name);
3547 output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN);
3548 fprintf(fout, "%s(", g_func_pp->name);
3550 for (i = 0; i < g_func_pp->argc; i++) {
3552 fprintf(fout, ", ");
3553 if (g_func_pp->arg[i].fptr != NULL) {
3555 pp = g_func_pp->arg[i].fptr;
3556 fprintf(fout, "%s (", pp->ret_type.name);
3557 output_pp_attrs(fout, pp, 0);
3558 fprintf(fout, "*a%d)(", i + 1);
3559 for (j = 0; j < pp->argc; j++) {
3561 fprintf(fout, ", ");
3562 if (pp->arg[j].fptr)
3563 ferr(ops, "nested fptr\n");
3564 fprintf(fout, "%s", pp->arg[j].type.name);
3566 if (pp->is_vararg) {
3568 fprintf(fout, ", ");
3569 fprintf(fout, "...");
3573 else if (g_func_pp->arg[i].type.is_retreg) {
3574 fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg);
3577 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
3580 if (g_func_pp->is_vararg) {
3582 fprintf(fout, ", ");
3583 fprintf(fout, "...");
3586 fprintf(fout, ")\n{\n");
3588 // declare indirect functions
3589 for (i = 0; i < opcnt; i++) {
3591 if (po->flags & OPF_RMD)
3594 if (po->op == OP_CALL) {
3597 ferr(po, "NULL pp\n");
3599 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
3600 if (pp->name[0] != 0) {
3601 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
3602 memcpy(pp->name, "i_", 2);
3604 // might be declared already
3606 for (j = 0; j < i; j++) {
3607 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
3608 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
3618 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
3620 fprintf(fout, " %s (", pp->ret_type.name);
3621 output_pp_attrs(fout, pp, 0);
3622 fprintf(fout, "*%s)(", pp->name);
3623 for (j = 0; j < pp->argc; j++) {
3625 fprintf(fout, ", ");
3626 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
3628 fprintf(fout, ");\n");
3633 // output LUTs/jumptables
3634 for (i = 0; i < g_func_pd_cnt; i++) {
3636 fprintf(fout, " static const ");
3637 if (pd->type == OPT_OFFSET) {
3638 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
3640 for (j = 0; j < pd->count; j++) {
3642 fprintf(fout, ", ");
3643 fprintf(fout, "&&%s", pd->d[j].u.label);
3647 fprintf(fout, "%s %s[] =\n { ",
3648 lmod_type_u(ops, pd->lmod), pd->label);
3650 for (j = 0; j < pd->count; j++) {
3652 fprintf(fout, ", ");
3653 fprintf(fout, "%u", pd->d[j].u.val);
3656 fprintf(fout, " };\n");
3660 // declare stack frame, va_arg
3662 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
3663 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
3667 if (g_func_pp->is_userstack) {
3668 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
3669 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
3673 if (g_func_pp->is_vararg) {
3674 fprintf(fout, " va_list ap;\n");
3678 // declare arg-registers
3679 for (i = 0; i < g_func_pp->argc; i++) {
3680 if (g_func_pp->arg[i].reg != NULL) {
3681 reg = char_array_i(regs_r32,
3682 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
3683 if (regmask & (1 << reg)) {
3684 if (g_func_pp->arg[i].type.is_retreg)
3685 fprintf(fout, " u32 %s = *r_%s;\n",
3686 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
3688 fprintf(fout, " u32 %s = (u32)a%d;\n",
3689 g_func_pp->arg[i].reg, i + 1);
3692 if (g_func_pp->arg[i].type.is_retreg)
3693 ferr(ops, "retreg '%s' is unused?\n",
3694 g_func_pp->arg[i].reg);
3695 fprintf(fout, " // %s = a%d; // unused\n",
3696 g_func_pp->arg[i].reg, i + 1);
3702 regmask_now = regmask & ~regmask_arg;
3703 regmask_now &= ~(1 << xSP);
3705 for (reg = 0; reg < 8; reg++) {
3706 if (regmask_now & (1 << reg)) {
3707 fprintf(fout, " u32 %s", regs_r32[reg]);
3708 if (regmask_init & (1 << reg))
3709 fprintf(fout, " = 0");
3710 fprintf(fout, ";\n");
3717 for (reg = 0; reg < 8; reg++) {
3718 if (regmask_save & (1 << reg)) {
3719 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
3725 if (save_arg_vars) {
3726 for (reg = 0; reg < 32; reg++) {
3727 if (save_arg_vars & (1 << reg)) {
3728 fprintf(fout, " u32 s_a%d;\n", reg + 1);
3735 for (i = 0; i < 8; i++) {
3736 if (cond_vars & (1 << i)) {
3737 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
3744 fprintf(fout, " u32 tmp;\n");
3749 fprintf(fout, " u64 tmp64;\n");
3754 fprintf(fout, "\n");
3756 if (g_func_pp->is_vararg) {
3757 if (g_func_pp->argc_stack == 0)
3758 ferr(ops, "vararg func without stack args?\n");
3759 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
3763 for (i = 0; i < opcnt; i++)
3765 if (g_labels[i][0] != 0) {
3766 fprintf(fout, "\n%s:\n", g_labels[i]);
3769 delayed_flag_op = NULL;
3770 last_arith_dst = NULL;
3774 if (po->flags & OPF_RMD)
3779 #define assert_operand_cnt(n_) \
3780 if (po->operand_cnt != n_) \
3781 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
3783 // conditional/flag using op?
3784 if (po->flags & OPF_CC)
3790 // we go through all this trouble to avoid using parsed_flag_op,
3791 // which makes generated code much nicer
3792 if (delayed_flag_op != NULL)
3794 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
3795 po->pfo, po->pfo_inv);
3798 else if (last_arith_dst != NULL
3799 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
3800 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
3803 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
3804 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
3805 last_arith_dst->lmod, buf3);
3808 else if (tmp_op != NULL) {
3809 // use preprocessed flag calc results
3810 if (!(tmp_op->pfomask & (1 << po->pfo)))
3811 ferr(po, "not prepared for pfo %d\n", po->pfo);
3813 // note: pfo_inv was not yet applied
3814 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
3815 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
3818 ferr(po, "all methods of finding comparison failed\n");
3821 if (po->flags & OPF_JMP) {
3822 fprintf(fout, " if %s", buf1);
3824 else if (po->op == OP_RCL || po->op == OP_RCR
3825 || po->op == OP_ADC || po->op == OP_SBB)
3828 fprintf(fout, " cond_%s = %s;\n",
3829 parsed_flag_op_names[po->pfo], buf1);
3831 else if (po->flags & OPF_DATA) { // SETcc
3832 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
3833 fprintf(fout, " %s = %s;", buf2, buf1);
3836 ferr(po, "unhandled conditional op\n");
3840 pfomask = po->pfomask;
3842 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
3843 struct parsed_opr opr = {0,};
3846 opr.lmod = OPLM_DWORD;
3847 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
3849 if (ret != 1 || uval == 0) {
3850 // we need initial flags for ecx=0 case..
3851 if (i > 0 && ops[i - 1].op == OP_XOR
3852 && IS(ops[i - 1].operand[0].name,
3853 ops[i - 1].operand[1].name))
3855 fprintf(fout, " cond_z = ");
3856 if (pfomask & (1 << PFO_C))
3857 fprintf(fout, "cond_c = ");
3858 fprintf(fout, "0;\n");
3860 else if (last_arith_dst != NULL) {
3861 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
3862 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
3863 last_arith_dst->lmod, buf3);
3864 fprintf(fout, " cond_z = %s;\n", buf1);
3867 ferr(po, "missing initial ZF\n");
3874 assert_operand_cnt(2);
3875 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3876 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3877 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
3878 fprintf(fout, " %s = %s;", buf1,
3879 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3884 assert_operand_cnt(2);
3885 po->operand[1].lmod = OPLM_DWORD; // always
3886 fprintf(fout, " %s = %s;",
3887 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3888 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3893 assert_operand_cnt(2);
3894 fprintf(fout, " %s = %s;",
3895 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3896 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3900 assert_operand_cnt(2);
3901 switch (po->operand[1].lmod) {
3903 strcpy(buf3, "(s8)");
3906 strcpy(buf3, "(s16)");
3909 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
3911 fprintf(fout, " %s = %s;",
3912 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3913 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3918 assert_operand_cnt(2);
3919 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3920 fprintf(fout, " tmp = %s;",
3921 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
3922 fprintf(fout, " %s = %s;",
3923 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3924 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
3925 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
3926 fprintf(fout, " %s = %stmp;",
3927 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
3928 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
3929 snprintf(g_comment, sizeof(g_comment), "xchg");
3933 assert_operand_cnt(1);
3934 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3935 fprintf(fout, " %s = ~%s;", buf1, buf1);
3939 assert_operand_cnt(2);
3940 fprintf(fout, " %s = (s32)%s >> 31;",
3941 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3942 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3943 strcpy(g_comment, "cdq");
3947 assert_operand_cnt(3);
3948 if (po->flags & OPF_REP) {
3953 fprintf(fout, " eax = %sesi; esi %c= %d;",
3954 lmod_cast_u_ptr(po, po->operand[0].lmod),
3955 (po->flags & OPF_DF) ? '-' : '+',
3956 lmod_bytes(po, po->operand[0].lmod));
3957 strcpy(g_comment, "lods");
3962 assert_operand_cnt(3);
3963 if (po->flags & OPF_REP) {
3964 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
3965 (po->flags & OPF_DF) ? '-' : '+',
3966 lmod_bytes(po, po->operand[0].lmod));
3967 fprintf(fout, " %sedi = eax;",
3968 lmod_cast_u_ptr(po, po->operand[0].lmod));
3969 strcpy(g_comment, "rep stos");
3972 fprintf(fout, " %sedi = eax; edi %c= %d;",
3973 lmod_cast_u_ptr(po, po->operand[0].lmod),
3974 (po->flags & OPF_DF) ? '-' : '+',
3975 lmod_bytes(po, po->operand[0].lmod));
3976 strcpy(g_comment, "stos");
3981 assert_operand_cnt(3);
3982 j = lmod_bytes(po, po->operand[0].lmod);
3983 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
3984 l = (po->flags & OPF_DF) ? '-' : '+';
3985 if (po->flags & OPF_REP) {
3987 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
3990 " %sedi = %sesi;", buf1, buf1);
3991 strcpy(g_comment, "rep movs");
3994 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
3995 buf1, buf1, l, j, l, j);
3996 strcpy(g_comment, "movs");
4001 // repe ~ repeat while ZF=1
4002 assert_operand_cnt(3);
4003 j = lmod_bytes(po, po->operand[0].lmod);
4004 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4005 l = (po->flags & OPF_DF) ? '-' : '+';
4006 if (po->flags & OPF_REP) {
4008 " for (; ecx != 0; ecx--) {\n");
4009 if (pfomask & (1 << PFO_C)) {
4012 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4013 pfomask &= ~(1 << PFO_C);
4016 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4017 buf1, buf1, l, j, l, j);
4019 " if (cond_z %s 0) break;\n",
4020 (po->flags & OPF_REPZ) ? "==" : "!=");
4023 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4024 (po->flags & OPF_REPZ) ? "e" : "ne");
4028 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4029 buf1, buf1, l, j, l, j);
4030 strcpy(g_comment, "cmps");
4032 pfomask &= ~(1 << PFO_Z);
4033 last_arith_dst = NULL;
4034 delayed_flag_op = NULL;
4038 // only does ZF (for now)
4039 // repe ~ repeat while ZF=1
4040 assert_operand_cnt(3);
4041 j = lmod_bytes(po, po->operand[0].lmod);
4042 l = (po->flags & OPF_DF) ? '-' : '+';
4043 if (po->flags & OPF_REP) {
4045 " for (; ecx != 0; ecx--) {\n");
4047 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4048 lmod_cast_u(po, po->operand[0].lmod),
4049 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4051 " if (cond_z %s 0) break;\n",
4052 (po->flags & OPF_REPZ) ? "==" : "!=");
4055 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4056 (po->flags & OPF_REPZ) ? "e" : "ne");
4059 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4060 lmod_cast_u(po, po->operand[0].lmod),
4061 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4062 strcpy(g_comment, "scas");
4064 pfomask &= ~(1 << PFO_Z);
4065 last_arith_dst = NULL;
4066 delayed_flag_op = NULL;
4069 // arithmetic w/flags
4072 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4075 assert_operand_cnt(2);
4076 fprintf(fout, " %s %s= %s;",
4077 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4079 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4080 output_std_flags(fout, po, &pfomask, buf1);
4081 last_arith_dst = &po->operand[0];
4082 delayed_flag_op = NULL;
4087 assert_operand_cnt(2);
4088 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4089 if (pfomask & (1 << PFO_C)) {
4090 if (po->operand[1].type == OPT_CONST) {
4091 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4092 j = po->operand[1].val;
4095 if (po->op == OP_SHL)
4099 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
4103 ferr(po, "zero shift?\n");
4107 pfomask &= ~(1 << PFO_C);
4109 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
4110 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4111 output_std_flags(fout, po, &pfomask, buf1);
4112 last_arith_dst = &po->operand[0];
4113 delayed_flag_op = NULL;
4117 assert_operand_cnt(2);
4118 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4119 fprintf(fout, " %s = %s%s >> %s;", buf1,
4120 lmod_cast_s(po, po->operand[0].lmod), buf1,
4121 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4122 output_std_flags(fout, po, &pfomask, buf1);
4123 last_arith_dst = &po->operand[0];
4124 delayed_flag_op = NULL;
4129 assert_operand_cnt(2);
4130 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4131 if (po->operand[1].type == OPT_CONST) {
4132 j = po->operand[1].val;
4133 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
4134 fprintf(fout, po->op == OP_ROL ?
4135 " %s = (%s << %d) | (%s >> %d);" :
4136 " %s = (%s >> %d) | (%s << %d);",
4137 buf1, buf1, j, buf1,
4138 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
4142 output_std_flags(fout, po, &pfomask, buf1);
4143 last_arith_dst = &po->operand[0];
4144 delayed_flag_op = NULL;
4149 assert_operand_cnt(2);
4150 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4151 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4152 if (po->operand[1].type == OPT_CONST) {
4153 j = po->operand[1].val % l;
4155 ferr(po, "zero rotate\n");
4156 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
4157 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
4158 if (po->op == OP_RCL) {
4160 " %s = (%s << %d) | (cond_c << %d)",
4161 buf1, buf1, j, j - 1);
4163 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
4167 " %s = (%s >> %d) | (cond_c << %d)",
4168 buf1, buf1, j, l - j);
4170 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
4172 fprintf(fout, ";\n");
4173 fprintf(fout, " cond_c = tmp;");
4177 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
4178 output_std_flags(fout, po, &pfomask, buf1);
4179 last_arith_dst = &po->operand[0];
4180 delayed_flag_op = NULL;
4184 assert_operand_cnt(2);
4185 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4186 if (IS(opr_name(po, 0), opr_name(po, 1))) {
4187 // special case for XOR
4188 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
4189 fprintf(fout, " cond_be = 1;\n");
4190 pfomask &= ~(1 << PFO_BE);
4192 fprintf(fout, " %s = 0;",
4193 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4194 last_arith_dst = &po->operand[0];
4195 delayed_flag_op = NULL;
4201 assert_operand_cnt(2);
4202 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4203 if (pfomask & (1 << PFO_C)) {
4204 fprintf(fout, " tmp64 = (u64)%s + %s;\n",
4205 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]),
4206 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4207 fprintf(fout, " cond_c = tmp64 >> 32;\n");
4208 fprintf(fout, " %s = (u32)tmp64;",
4209 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4210 strcat(g_comment, "add64");
4211 pfomask &= ~(1 << PFO_C);
4212 output_std_flags(fout, po, &pfomask, buf1);
4213 last_arith_dst = &po->operand[0];
4214 delayed_flag_op = NULL;
4220 assert_operand_cnt(2);
4221 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4222 if (pfomask & (1 << PFO_C)) {
4223 fprintf(fout, " cond_c = %s < %s;\n",
4224 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]),
4225 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4226 pfomask &= ~(1 << PFO_C);
4232 assert_operand_cnt(2);
4233 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4234 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4235 if (po->op == OP_SBB
4236 && IS(po->operand[0].name, po->operand[1].name))
4238 // avoid use of unitialized var
4239 fprintf(fout, " %s = -cond_c;", buf1);
4240 // carry remains what it was
4241 pfomask &= ~(1 << PFO_C);
4244 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
4245 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4247 output_std_flags(fout, po, &pfomask, buf1);
4248 last_arith_dst = &po->operand[0];
4249 delayed_flag_op = NULL;
4253 assert_operand_cnt(2);
4254 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4255 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
4256 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4258 output_std_flags(fout, po, &pfomask, buf1);
4259 last_arith_dst = &po->operand[0];
4260 delayed_flag_op = NULL;
4261 strcat(g_comment, "bsf");
4266 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4267 if (po->operand[0].type == OPT_REG) {
4268 strcpy(buf2, po->op == OP_INC ? "++" : "--");
4269 fprintf(fout, " %s%s;", buf1, buf2);
4272 strcpy(buf2, po->op == OP_INC ? "+" : "-");
4273 fprintf(fout, " %s %s= 1;", buf1, buf2);
4275 output_std_flags(fout, po, &pfomask, buf1);
4276 last_arith_dst = &po->operand[0];
4277 delayed_flag_op = NULL;
4281 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4282 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
4283 fprintf(fout, " %s = -%s%s;", buf1,
4284 lmod_cast_s(po, po->operand[0].lmod), buf2);
4285 last_arith_dst = &po->operand[0];
4286 delayed_flag_op = NULL;
4287 if (pfomask & (1 << PFO_C)) {
4288 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
4289 pfomask &= ~(1 << PFO_C);
4294 if (po->operand_cnt == 2) {
4295 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4298 if (po->operand_cnt == 3)
4299 ferr(po, "TODO imul3\n");
4302 assert_operand_cnt(1);
4303 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
4304 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
4305 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
4306 fprintf(fout, " edx = tmp64 >> 32;\n");
4307 fprintf(fout, " eax = tmp64;");
4308 last_arith_dst = NULL;
4309 delayed_flag_op = NULL;
4314 assert_operand_cnt(1);
4315 if (po->operand[0].lmod != OPLM_DWORD)
4316 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
4318 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4319 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
4320 po->op == OP_IDIV));
4321 switch (po->operand[0].lmod) {
4323 if (po->flags & OPF_32BIT)
4324 snprintf(buf3, sizeof(buf3), "%seax", buf2);
4326 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
4327 snprintf(buf3, sizeof(buf3), "%stmp64",
4328 (po->op == OP_IDIV) ? "(s64)" : "");
4330 if (po->operand[0].type == OPT_REG
4331 && po->operand[0].reg == xDX)
4333 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4334 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4337 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
4338 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
4342 ferr(po, "unhandled division type\n");
4344 last_arith_dst = NULL;
4345 delayed_flag_op = NULL;
4350 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4352 for (j = 0; j < 8; j++) {
4353 if (pfomask & (1 << j)) {
4354 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
4355 fprintf(fout, " cond_%s = %s;",
4356 parsed_flag_op_names[j], buf1);
4363 last_arith_dst = NULL;
4364 delayed_flag_op = po;
4368 // SETcc - should already be handled
4371 // note: we reuse OP_Jcc for SETcc, only flags differ
4373 fprintf(fout, "\n goto %s;", po->operand[0].name);
4377 fprintf(fout, " if (ecx == 0)\n");
4378 fprintf(fout, " goto %s;", po->operand[0].name);
4379 strcat(g_comment, "jecxz");
4383 assert_operand_cnt(1);
4384 last_arith_dst = NULL;
4385 delayed_flag_op = NULL;
4387 if (po->operand[0].type == OPT_REGMEM) {
4388 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
4391 ferr(po, "parse failure for jmp '%s'\n",
4392 po->operand[0].name);
4393 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
4396 else if (po->operand[0].type != OPT_LABEL)
4397 ferr(po, "unhandled jmp type\n");
4399 fprintf(fout, " goto %s;", po->operand[0].name);
4403 assert_operand_cnt(1);
4405 my_assert_not(pp, NULL);
4408 if (po->flags & OPF_CC) {
4409 // we treat conditional branch to another func
4410 // (yes such code exists..) as conditional tailcall
4412 fprintf(fout, " {\n");
4415 if (pp->is_fptr && !pp->is_arg) {
4416 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
4417 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
4419 if (pp->is_unresolved)
4420 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
4421 buf3, asmfn, po->asmln, pp->name);
4424 fprintf(fout, "%s", buf3);
4425 if (strstr(pp->ret_type.name, "int64")) {
4426 if (po->flags & OPF_TAIL)
4427 ferr(po, "int64 and tail?\n");
4428 fprintf(fout, "tmp64 = ");
4430 else if (!IS(pp->ret_type.name, "void")) {
4431 if (po->flags & OPF_TAIL) {
4432 if (!IS(g_func_pp->ret_type.name, "void")) {
4433 fprintf(fout, "return ");
4434 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
4435 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
4438 else if (regmask & (1 << xAX)) {
4439 fprintf(fout, "eax = ");
4440 if (pp->ret_type.is_ptr)
4441 fprintf(fout, "(u32)");
4445 if (pp->name[0] == 0)
4446 ferr(po, "missing pp->name\n");
4447 fprintf(fout, "%s%s(", pp->name,
4448 pp->has_structarg ? "_sa" : "");
4450 if (po->flags & OPF_ATAIL) {
4451 if (pp->argc_stack != g_func_pp->argc_stack
4452 || (pp->argc_stack > 0
4453 && pp->is_stdcall != g_func_pp->is_stdcall))
4454 ferr(po, "incompatible tailcall\n");
4455 if (g_func_pp->has_retreg)
4456 ferr(po, "TODO: retreg+tailcall\n");
4458 for (arg = j = 0; arg < pp->argc; arg++) {
4460 fprintf(fout, ", ");
4463 if (pp->arg[arg].type.is_ptr)
4464 snprintf(cast, sizeof(cast), "(%s)",
4465 pp->arg[arg].type.name);
4467 if (pp->arg[arg].reg != NULL) {
4468 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4472 for (; j < g_func_pp->argc; j++)
4473 if (g_func_pp->arg[j].reg == NULL)
4475 fprintf(fout, "%sa%d", cast, j + 1);
4480 for (arg = 0; arg < pp->argc; arg++) {
4482 fprintf(fout, ", ");
4485 if (pp->arg[arg].type.is_ptr)
4486 snprintf(cast, sizeof(cast), "(%s)",
4487 pp->arg[arg].type.name);
4489 if (pp->arg[arg].reg != NULL) {
4490 if (pp->arg[arg].type.is_retreg)
4491 fprintf(fout, "&%s", pp->arg[arg].reg);
4493 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
4498 tmp_op = pp->arg[arg].datap;
4500 ferr(po, "parsed_op missing for arg%d\n", arg);
4501 if (tmp_op->argnum != 0) {
4502 fprintf(fout, "%ss_a%d", cast, tmp_op->argnum);
4506 out_src_opr(buf1, sizeof(buf1),
4507 tmp_op, &tmp_op->operand[0], cast, 0));
4511 fprintf(fout, ");");
4513 if (strstr(pp->ret_type.name, "int64")) {
4514 fprintf(fout, "\n");
4515 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
4516 fprintf(fout, "%seax = tmp64;", buf3);
4519 if (pp->is_unresolved) {
4520 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
4522 strcat(g_comment, buf2);
4525 if (po->flags & OPF_TAIL) {
4527 if (i == opcnt - 1 || pp->is_noreturn)
4529 else if (IS(pp->ret_type.name, "void"))
4531 else if (IS(g_func_pp->ret_type.name, "void"))
4533 // else already handled as 'return f()'
4536 if (!IS(g_func_pp->ret_type.name, "void")) {
4537 ferr(po, "int func -> void func tailcall?\n");
4540 fprintf(fout, "\n%sreturn;", buf3);
4541 strcat(g_comment, " ^ tailcall");
4545 strcat(g_comment, " tailcall");
4547 if (pp->is_noreturn)
4548 strcat(g_comment, " noreturn");
4549 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
4550 strcat(g_comment, " argframe");
4551 if (po->flags & OPF_CC)
4552 strcat(g_comment, " cond");
4554 if (po->flags & OPF_CC)
4555 fprintf(fout, "\n }");
4557 delayed_flag_op = NULL;
4558 last_arith_dst = NULL;
4562 if (g_func_pp->is_vararg)
4563 fprintf(fout, " va_end(ap);\n");
4564 if (g_func_pp->has_retreg) {
4565 for (arg = 0; arg < g_func_pp->argc; arg++)
4566 if (g_func_pp->arg[arg].type.is_retreg)
4567 fprintf(fout, " *r_%s = %s;\n",
4568 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
4571 if (IS(g_func_pp->ret_type.name, "void")) {
4572 if (i != opcnt - 1 || label_pending)
4573 fprintf(fout, " return;");
4575 else if (g_func_pp->ret_type.is_ptr) {
4576 fprintf(fout, " return (%s)eax;",
4577 g_func_pp->ret_type.name);
4579 else if (IS(g_func_pp->ret_type.name, "__int64"))
4580 fprintf(fout, " return ((u64)edx << 32) | eax;");
4582 fprintf(fout, " return eax;");
4584 last_arith_dst = NULL;
4585 delayed_flag_op = NULL;
4589 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4590 if (po->argnum != 0) {
4591 // special case - saved func arg
4592 fprintf(fout, " s_a%d = %s;", po->argnum, buf1);
4595 else if (po->flags & OPF_RSAVE) {
4596 fprintf(fout, " s_%s = %s;", buf1, buf1);
4599 else if (g_func_pp->is_userstack) {
4600 fprintf(fout, " *(--esp) = %s;", buf1);
4603 if (!(g_ida_func_attr & IDAFA_NORETURN))
4604 ferr(po, "stray push encountered\n");
4609 if (po->flags & OPF_RSAVE) {
4610 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4611 fprintf(fout, " %s = s_%s;", buf1, buf1);
4614 else if (po->datap != NULL) {
4617 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4618 fprintf(fout, " %s = %s;", buf1,
4619 out_src_opr(buf2, sizeof(buf2),
4620 tmp_op, &tmp_op->operand[0],
4621 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4624 else if (g_func_pp->is_userstack) {
4625 fprintf(fout, " %s = *esp++;",
4626 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4630 ferr(po, "stray pop encountered\n");
4639 ferr(po, "unhandled op type %d, flags %x\n",
4644 if (g_comment[0] != 0) {
4645 char *p = g_comment;
4646 while (my_isblank(*p))
4648 fprintf(fout, " // %s", p);
4653 fprintf(fout, "\n");
4655 // some sanity checking
4656 if (po->flags & OPF_REP) {
4657 if (po->op != OP_STOS && po->op != OP_MOVS
4658 && po->op != OP_CMPS && po->op != OP_SCAS)
4659 ferr(po, "unexpected rep\n");
4660 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
4661 && (po->op == OP_CMPS || po->op == OP_SCAS))
4662 ferr(po, "cmps/scas with plain rep\n");
4664 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
4665 && po->op != OP_CMPS && po->op != OP_SCAS)
4666 ferr(po, "unexpected repz/repnz\n");
4669 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
4671 // see is delayed flag stuff is still valid
4672 if (delayed_flag_op != NULL && delayed_flag_op != po) {
4673 if (is_any_opr_modified(delayed_flag_op, po, 0))
4674 delayed_flag_op = NULL;
4677 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
4678 if (is_opr_modified(last_arith_dst, po))
4679 last_arith_dst = NULL;
4685 if (g_stack_fsz && !g_stack_frame_used)
4686 fprintf(fout, " (void)sf;\n");
4688 fprintf(fout, "}\n\n");
4691 for (i = 0; i < opcnt; i++) {
4692 struct label_ref *lr, *lr_del;
4694 lr = g_label_refs[i].next;
4695 while (lr != NULL) {
4700 g_label_refs[i].i = -1;
4701 g_label_refs[i].next = NULL;
4703 if (ops[i].op == OP_CALL) {
4705 proto_release(ops[i].pp);
4711 static void set_label(int i, const char *name)
4717 p = strchr(name, ':');
4721 if (len > sizeof(g_labels[0]) - 1)
4722 aerr("label '%s' too long: %d\n", name, len);
4723 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
4724 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
4725 memcpy(g_labels[i], name, len);
4726 g_labels[i][len] = 0;
4729 // '=' needs special treatment..
4730 static char *next_word_s(char *w, size_t wsize, char *s)
4736 for (i = 0; i < wsize - 1; i++) {
4737 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
4743 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
4744 printf("warning: '%s' truncated\n", w);
4755 static struct chunk_item *func_chunks;
4756 static int func_chunk_cnt;
4757 static int func_chunk_alloc;
4759 static void add_func_chunk(FILE *fasm, const char *name, int line)
4761 if (func_chunk_cnt >= func_chunk_alloc) {
4762 func_chunk_alloc *= 2;
4763 func_chunks = realloc(func_chunks,
4764 func_chunk_alloc * sizeof(func_chunks[0]));
4765 my_assert_not(func_chunks, NULL);
4767 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
4768 func_chunks[func_chunk_cnt].name = strdup(name);
4769 func_chunks[func_chunk_cnt].asmln = line;
4773 static int cmp_chunks(const void *p1, const void *p2)
4775 const struct chunk_item *c1 = p1, *c2 = p2;
4776 return strcmp(c1->name, c2->name);
4779 static int cmpstringp(const void *p1, const void *p2)
4781 return strcmp(*(char * const *)p1, *(char * const *)p2);
4784 static void scan_ahead(FILE *fasm)
4794 oldpos = ftell(fasm);
4797 while (fgets(line, sizeof(line), fasm))
4808 // get rid of random tabs
4809 for (i = 0; line[i] != 0; i++)
4810 if (line[i] == '\t')
4813 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
4816 next_word(words[0], sizeof(words[0]), p);
4817 if (words[0][0] == 0)
4818 aerr("missing name for func chunk?\n");
4820 add_func_chunk(fasm, words[0], asmln);
4822 else if (IS_START(p, "; sctend"))
4828 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
4829 words[wordc][0] = 0;
4830 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
4831 if (*p == 0 || *p == ';') {
4837 if (wordc == 2 && IS(words[1], "ends"))
4841 fseek(fasm, oldpos, SEEK_SET);
4845 int main(int argc, char *argv[])
4847 FILE *fout, *fasm, *frlist;
4848 struct parsed_data *pd = NULL;
4850 char **rlist = NULL;
4852 int rlist_alloc = 0;
4853 int func_chunks_used = 0;
4854 int func_chunks_sorted = 0;
4855 int func_chunk_i = -1;
4856 long func_chunk_ret = 0;
4857 int func_chunk_ret_ln = 0;
4858 int scanned_ahead = 0;
4860 char words[20][256];
4861 enum opr_lenmod lmod;
4862 char *sctproto = NULL;
4864 int pending_endp = 0;
4866 int skip_warned = 0;
4879 for (arg = 1; arg < argc; arg++) {
4880 if (IS(argv[arg], "-v"))
4882 else if (IS(argv[arg], "-rf"))
4883 g_allow_regfunc = 1;
4884 else if (IS(argv[arg], "-m"))
4890 if (argc < arg + 3) {
4891 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdrf> [rlist]*\n",
4898 asmfn = argv[arg++];
4899 fasm = fopen(asmfn, "r");
4900 my_assert_not(fasm, NULL);
4902 hdrfn = argv[arg++];
4903 g_fhdr = fopen(hdrfn, "r");
4904 my_assert_not(g_fhdr, NULL);
4907 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
4908 my_assert_not(rlist, NULL);
4909 // needs special handling..
4910 rlist[rlist_len++] = "__alloca_probe";
4912 func_chunk_alloc = 32;
4913 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
4914 my_assert_not(func_chunks, NULL);
4916 memset(words, 0, sizeof(words));
4918 for (; arg < argc; arg++) {
4919 frlist = fopen(argv[arg], "r");
4920 my_assert_not(frlist, NULL);
4922 while (fgets(line, sizeof(line), frlist)) {
4924 if (*p == 0 || *p == ';')
4927 if (IS_START(p, "#if 0")
4928 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
4932 else if (IS_START(p, "#endif"))
4939 p = next_word(words[0], sizeof(words[0]), p);
4940 if (words[0][0] == 0)
4943 if (rlist_len >= rlist_alloc) {
4944 rlist_alloc = rlist_alloc * 2 + 64;
4945 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
4946 my_assert_not(rlist, NULL);
4948 rlist[rlist_len++] = strdup(words[0]);
4957 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
4959 fout = fopen(argv[arg_out], "w");
4960 my_assert_not(fout, NULL);
4963 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
4964 my_assert_not(g_eqs, NULL);
4966 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
4967 g_label_refs[i].i = -1;
4968 g_label_refs[i].next = NULL;
4971 while (fgets(line, sizeof(line), fasm))
4980 // get rid of random tabs
4981 for (i = 0; line[i] != 0; i++)
4982 if (line[i] == '\t')
4987 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
4988 goto do_pending_endp; // eww..
4990 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
4992 static const char *attrs[] = {
5001 // parse IDA's attribute-list comment
5002 g_ida_func_attr = 0;
5005 for (; *p != 0; p = sskip(p)) {
5006 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
5007 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
5008 g_ida_func_attr |= 1 << i;
5009 p += strlen(attrs[i]);
5013 if (i == ARRAY_SIZE(attrs)) {
5014 anote("unparsed IDA attr: %s\n", p);
5017 if (IS(attrs[i], "fpd=")) {
5018 p = next_word(words[0], sizeof(words[0]), p);
5023 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
5026 next_word(words[0], sizeof(words[0]), p);
5027 if (words[0][0] == 0)
5028 aerr("missing name for func chunk?\n");
5030 if (!scanned_ahead) {
5031 add_func_chunk(fasm, words[0], asmln);
5032 func_chunks_sorted = 0;
5035 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
5037 if (func_chunk_i >= 0) {
5038 if (func_chunk_i < func_chunk_cnt
5039 && IS(func_chunks[func_chunk_i].name, g_func))
5041 // move on to next chunk
5042 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5044 aerr("seek failed for '%s' chunk #%d\n",
5045 g_func, func_chunk_i);
5046 asmln = func_chunks[func_chunk_i].asmln;
5050 if (func_chunk_ret == 0)
5051 aerr("no return from chunk?\n");
5052 fseek(fasm, func_chunk_ret, SEEK_SET);
5053 asmln = func_chunk_ret_ln;
5059 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
5060 func_chunks_used = 1;
5062 if (IS_START(g_func, "sub_")) {
5063 unsigned long addr = strtoul(p, NULL, 16);
5064 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
5065 if (addr > f_addr && !scanned_ahead) {
5066 anote("scan_ahead caused by '%s', addr %lx\n",
5070 func_chunks_sorted = 0;
5078 for (i = wordc; i < ARRAY_SIZE(words); i++)
5080 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
5081 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
5082 if (*p == 0 || *p == ';') {
5087 if (*p != 0 && *p != ';')
5088 aerr("too many words\n");
5090 // alow asm patches in comments
5092 if (IS_START(p, "; sctpatch:")) {
5094 if (*p == 0 || *p == ';')
5096 goto parse_words; // lame
5098 if (IS_START(p, "; sctproto:")) {
5099 sctproto = strdup(p + 11);
5101 else if (IS_START(p, "; sctend")) {
5110 awarn("wordc == 0?\n");
5114 // don't care about this:
5115 if (words[0][0] == '.'
5116 || IS(words[0], "include")
5117 || IS(words[0], "assume") || IS(words[1], "segment")
5118 || IS(words[0], "align"))
5124 // do delayed endp processing to collect switch jumptables
5126 if (in_func && !skip_func && !end && wordc >= 2
5127 && ((words[0][0] == 'd' && words[0][2] == 0)
5128 || (words[1][0] == 'd' && words[1][2] == 0)))
5131 if (words[1][0] == 'd' && words[1][2] == 0) {
5133 if (g_func_pd_cnt >= pd_alloc) {
5134 pd_alloc = pd_alloc * 2 + 16;
5135 g_func_pd = realloc(g_func_pd,
5136 sizeof(g_func_pd[0]) * pd_alloc);
5137 my_assert_not(g_func_pd, NULL);
5139 pd = &g_func_pd[g_func_pd_cnt];
5141 memset(pd, 0, sizeof(*pd));
5142 strcpy(pd->label, words[0]);
5143 pd->type = OPT_CONST;
5144 pd->lmod = lmod_from_directive(words[1]);
5150 anote("skipping alignment byte?\n");
5153 lmod = lmod_from_directive(words[0]);
5154 if (lmod != pd->lmod)
5155 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
5158 if (pd->count_alloc < pd->count + wordc) {
5159 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
5160 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
5161 my_assert_not(pd->d, NULL);
5163 for (; i < wordc; i++) {
5164 if (IS(words[i], "offset")) {
5165 pd->type = OPT_OFFSET;
5168 p = strchr(words[i], ',');
5171 if (pd->type == OPT_OFFSET)
5172 pd->d[pd->count].u.label = strdup(words[i]);
5174 pd->d[pd->count].u.val = parse_number(words[i]);
5175 pd->d[pd->count].bt_i = -1;
5181 if (in_func && !skip_func)
5182 gen_func(fout, g_fhdr, g_func, pi);
5186 g_ida_func_attr = 0;
5190 func_chunks_used = 0;
5193 memset(&ops, 0, pi * sizeof(ops[0]));
5194 memset(g_labels, 0, pi * sizeof(g_labels[0]));
5198 for (i = 0; i < g_func_pd_cnt; i++) {
5200 if (pd->type == OPT_OFFSET) {
5201 for (j = 0; j < pd->count; j++)
5202 free(pd->d[j].u.label);
5216 if (IS(words[1], "proc")) {
5218 aerr("proc '%s' while in_func '%s'?\n",
5221 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
5223 strcpy(g_func, words[0]);
5224 set_label(0, words[0]);
5229 if (IS(words[1], "endp"))
5232 aerr("endp '%s' while not in_func?\n", words[0]);
5233 if (!IS(g_func, words[0]))
5234 aerr("endp '%s' while in_func '%s'?\n",
5237 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
5238 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
5244 if (!skip_func && func_chunks_used) {
5245 // start processing chunks
5246 struct chunk_item *ci, key = { g_func, 0 };
5248 func_chunk_ret = ftell(fasm);
5249 func_chunk_ret_ln = asmln;
5250 if (!func_chunks_sorted) {
5251 qsort(func_chunks, func_chunk_cnt,
5252 sizeof(func_chunks[0]), cmp_chunks);
5253 func_chunks_sorted = 1;
5255 ci = bsearch(&key, func_chunks, func_chunk_cnt,
5256 sizeof(func_chunks[0]), cmp_chunks);
5258 aerr("'%s' needs chunks, but none found\n", g_func);
5259 func_chunk_i = ci - func_chunks;
5260 for (; func_chunk_i > 0; func_chunk_i--)
5261 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
5264 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
5266 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
5267 asmln = func_chunks[func_chunk_i].asmln;
5275 if (wordc == 2 && IS(words[1], "ends")) {
5279 goto do_pending_endp;
5283 // scan for next text segment
5284 while (fgets(line, sizeof(line), fasm)) {
5287 if (*p == 0 || *p == ';')
5290 if (strstr(p, "segment para public 'CODE' use32"))
5297 p = strchr(words[0], ':');
5299 set_label(pi, words[0]);
5303 if (!in_func || skip_func) {
5304 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
5306 anote("skipping from '%s'\n", g_labels[pi]);
5309 g_labels[pi][0] = 0;
5313 if (wordc > 1 && IS(words[1], "="))
5316 aerr("unhandled equ, wc=%d\n", wordc);
5317 if (g_eqcnt >= eq_alloc) {
5319 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
5320 my_assert_not(g_eqs, NULL);
5323 len = strlen(words[0]);
5324 if (len > sizeof(g_eqs[0].name) - 1)
5325 aerr("equ name too long: %d\n", len);
5326 strcpy(g_eqs[g_eqcnt].name, words[0]);
5328 if (!IS(words[3], "ptr"))
5329 aerr("unhandled equ\n");
5330 if (IS(words[2], "dword"))
5331 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
5332 else if (IS(words[2], "word"))
5333 g_eqs[g_eqcnt].lmod = OPLM_WORD;
5334 else if (IS(words[2], "byte"))
5335 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
5337 aerr("bad lmod: '%s'\n", words[2]);
5339 g_eqs[g_eqcnt].offset = parse_number(words[4]);
5344 if (pi >= ARRAY_SIZE(ops))
5345 aerr("too many ops\n");
5347 parse_op(&ops[pi], words, wordc);
5349 if (sctproto != NULL) {
5350 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
5351 ops[pi].datap = sctproto;
5364 // vim:ts=2:shiftwidth=2:expandtab