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__); \
30 OPF_RMD = (1 << 0), /* removed or optimized out */
31 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
32 OPF_FLAGS = (1 << 2), /* sets flags */
33 OPF_JMP = (1 << 3), /* branches, ret and call */
34 OPF_CC = (1 << 4), /* uses flags */
35 OPF_TAIL = (1 << 5), /* ret or tail call */
36 OPF_RSAVE = (1 << 6), /* push/pop is local reg save/load */
37 OPF_REP = (1 << 7), /* prefixed by rep */
38 OPF_REPZ = (1 << 8), /* rep is repe/repz */
39 OPF_REPNZ = (1 << 9), /* rep is repne/repnz */
114 #define MAX_OPERANDS 3
118 enum opr_lenmod lmod;
119 unsigned int is_ptr:1; // pointer in C
120 unsigned int is_array:1; // array in C
128 struct parsed_opr operand[MAX_OPERANDS];
131 int regmask_src; // all referensed regs
133 int pfomask; // flagop: parsed_flag_op that can't be delayed
134 int argmask; // push: args that are altered before call
135 int cc_scratch; // scratch storage during analysis
136 int bt_i; // branch target for branches
137 struct parsed_data *btj;// branch targets for jumptables
142 // OP_CALL - ptr to parsed_proto
143 // (OPF_CC) - point to corresponding (OPF_FLAGS)
147 enum opr_lenmod lmod;
154 enum opr_lenmod lmod;
168 struct label_ref *next;
172 IDAFA_BP_FRAME = (1 << 0),
173 IDAFA_LIB_FUNC = (1 << 1),
174 IDAFA_STATIC = (1 << 2),
175 IDAFA_NORETURN = (1 << 3),
176 IDAFA_THUNK = (1 << 4),
177 IDAFA_FPD = (1 << 5),
182 static struct parsed_op ops[MAX_OPS];
183 static struct parsed_equ *g_eqs;
185 static char g_labels[MAX_OPS][32];
186 static struct label_ref g_label_refs[MAX_OPS];
187 static struct parsed_proto g_func_pp;
188 static struct parsed_data *g_func_pd;
189 static int g_func_pd_cnt;
190 static char g_func[256];
191 static char g_comment[256];
192 static int g_bp_frame;
193 static int g_sp_frame;
194 static int g_stack_fsz;
195 static int g_ida_func_attr;
196 #define ferr(op_, fmt, ...) do { \
197 printf("error:%s:#%zd: '%s': " fmt, g_func, (op_) - ops, \
198 dump_op(op_), ##__VA_ARGS__); \
205 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
206 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
207 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
208 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
210 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
212 // possible basic comparison types (without inversion)
213 enum parsed_flag_op {
217 PFO_BE, // 6 CF=1||ZF=1
221 PFO_LE, // e ZF=1||SF!=OF
224 static const char *parsed_flag_op_names[] = {
225 "o", "c", "z", "be", "s", "p", "l", "le"
228 static int char_array_i(const char *array[], size_t len, const char *s)
232 for (i = 0; i < len; i++)
239 static void printf_number(char *buf, size_t buf_size,
240 unsigned long number)
242 // output in C-friendly form
243 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
246 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
250 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
252 *reg_lmod = OPLM_DWORD;
255 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
257 *reg_lmod = OPLM_WORD;
260 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
262 *reg_lmod = OPLM_BYTE;
265 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
267 *reg_lmod = OPLM_BYTE;
274 static unsigned long parse_number(const char *number)
276 int len = strlen(number);
277 const char *p = number;
287 if (len > 1 && *p == '0')
289 if (number[len - 1] == 'h') {
290 ret = strtoul(p, &endp, 16);
291 bad = (*endp != 'h');
294 ret = strtoul(p, &endp, 10);
298 aerr("number parsing failed\n");
304 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
306 enum opr_lenmod lmod;
319 while (my_isblank(*s))
321 for (; my_issep(*s); d++, s++)
323 while (my_isblank(*s))
328 if (IS_START(s, "ds:"))
331 s = next_idt(w, sizeof(w), s);
336 reg = parse_reg(&lmod, w);
338 *regmask |= 1 << reg;
342 if ('0' <= w[0] && w[0] <= '9') {
343 number = parse_number(w);
344 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
348 // probably some label/identifier - pass
351 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
355 strcpy(name, cvtbuf);
360 static int is_reg_in_str(const char *s)
364 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
367 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
368 if (!strncmp(s, regs_r32[i], 3))
374 static const char *parse_stack_el(const char *name, char *extra_reg)
376 const char *p, *p2, *s;
383 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
385 if (extra_reg != NULL) {
386 strncpy(extra_reg, name, 3);
391 if (IS_START(p, "ebp+")) {
395 if (p2 != NULL && is_reg_in_str(p)) {
396 if (extra_reg != NULL) {
397 strncpy(extra_reg, p, p2 - p);
398 extra_reg[p2 - p] = 0;
403 if (!('0' <= *p && *p <= '9'))
409 if (!IS_START(name, "esp+"))
412 p = strchr(name + 4, '+');
414 // must be a number after esp+, already converted to 0x..
416 if (!('0' <= *s && *s <= '9')) {
417 aerr("%s nan?\n", __func__);
420 if (s[0] == '0' && s[1] == 'x')
423 if (len < sizeof(buf) - 1) {
424 strncpy(buf, s, len);
426 val = strtol(buf, &endp, 16);
427 if (val == 0 || *endp != 0) {
428 aerr("%s num parse fail for '%s'\n", __func__, buf);
437 if ('0' <= *p && *p <= '9')
443 static int guess_lmod_from_name(struct parsed_opr *opr)
445 if (!strncmp(opr->name, "dword_", 6)) {
446 opr->lmod = OPLM_DWORD;
449 if (!strncmp(opr->name, "word_", 5)) {
450 opr->lmod = OPLM_WORD;
453 if (!strncmp(opr->name, "byte_", 5)) {
454 opr->lmod = OPLM_BYTE;
460 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
461 const struct parsed_type *c_type)
463 static const char *dword_types[] = {
464 "int", "_DWORD", "DWORD", "HANDLE", "HWND", "HMODULE",
466 static const char *word_types[] = {
467 "__int16", "unsigned __int16",
469 static const char *byte_types[] = {
470 "char", "__int8", "unsigned __int8", "BYTE",
475 if (c_type->is_ptr) {
480 n = skip_type_mod(c_type->name);
482 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
483 if (IS(n, dword_types[i])) {
489 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
490 if (IS(n, word_types[i])) {
496 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
497 if (IS(n, byte_types[i])) {
506 static enum opr_type lmod_from_directive(const char *d)
510 else if (IS(d, "dw"))
512 else if (IS(d, "db"))
515 aerr("unhandled directive: '%s'\n", d);
519 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
525 *regmask |= 1 << reg;
528 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
531 static int parse_operand(struct parsed_opr *opr,
532 int *regmask, int *regmask_indirect,
533 char words[16][256], int wordc, int w, unsigned int op_flags)
535 struct parsed_proto pp;
536 enum opr_lenmod tmplmod;
537 unsigned long number;
544 aerr("parse_operand w %d, wordc %d\n", w, wordc);
548 for (i = w; i < wordc; i++) {
549 len = strlen(words[i]);
550 if (words[i][len - 1] == ',') {
551 words[i][len - 1] = 0;
557 wordc_in = wordc - w;
559 if ((op_flags & OPF_JMP) && wordc_in > 0
560 && !('0' <= words[w][0] && words[w][0] <= '9'))
562 const char *label = NULL;
564 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
565 && IS(words[w + 1], "ptr"))
566 label = words[w + 2];
567 else if (wordc_in == 2 && IS(words[w], "short"))
568 label = words[w + 1];
569 else if (wordc_in == 1
570 && strchr(words[w], '[') == NULL
571 && parse_reg(&tmplmod, words[w]) < 0)
575 opr->type = OPT_LABEL;
576 if (IS_START(label, "ds:"))
578 strcpy(opr->name, label);
584 if (IS(words[w + 1], "ptr")) {
585 if (IS(words[w], "dword"))
586 opr->lmod = OPLM_DWORD;
587 else if (IS(words[w], "word"))
588 opr->lmod = OPLM_WORD;
589 else if (IS(words[w], "byte"))
590 opr->lmod = OPLM_BYTE;
592 aerr("type parsing failed\n");
594 wordc_in = wordc - w;
599 if (IS(words[w], "offset")) {
600 opr->type = OPT_OFFSET;
601 strcpy(opr->name, words[w + 1]);
604 if (IS(words[w], "(offset")) {
605 char *p = strchr(words[w + 1], ')');
607 aerr("parse of bracketed offset failed\n");
609 opr->type = OPT_OFFSET;
610 strcpy(opr->name, words[w + 1]);
616 aerr("parse_operand 1 word expected\n");
619 if (IS_START(tmp, "ds:"))
621 strcpy(opr->name, tmp);
623 if (words[w][0] == '[') {
624 opr->type = OPT_REGMEM;
625 ret = sscanf(words[w], "[%[^]]]", opr->name);
627 aerr("[] parse failure\n");
629 parse_indmode(opr->name, regmask_indirect, 1);
630 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
632 struct parsed_equ *eq =
633 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
635 opr->lmod = eq->lmod;
639 else if (strchr(words[w], '[')) {
641 opr->type = OPT_REGMEM;
642 if (opr->lmod == OPLM_UNSPEC)
643 guess_lmod_from_name(opr);
644 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
647 else if (('0' <= words[w][0] && words[w][0] <= '9')
648 || words[w][0] == '-')
650 number = parse_number(words[w]);
651 opr->type = OPT_CONST;
653 printf_number(opr->name, sizeof(opr->name), number);
657 ret = parse_reg(&tmplmod, opr->name);
659 setup_reg_opr(opr, ret, tmplmod, regmask);
663 // most likely var in data segment
664 opr->type = OPT_LABEL;
666 ret = proto_parse(g_fhdr, opr->name, &pp);
669 opr->lmod = OPLM_DWORD;
672 else if (opr->lmod == OPLM_UNSPEC) {
673 if (!guess_lmod_from_c_type(&opr->lmod, &pp.type))
674 anote("unhandled C type '%s' for '%s'\n", pp.type.name, opr->name);
676 opr->is_ptr = pp.type.is_ptr;
677 opr->is_array = pp.type.is_array;
681 if (opr->lmod == OPLM_UNSPEC)
682 guess_lmod_from_name(opr);
686 static const struct {
691 { "repe", OPF_REP|OPF_REPZ },
692 { "repz", OPF_REP|OPF_REPZ },
693 { "repne", OPF_REP|OPF_REPNZ },
694 { "repnz", OPF_REP|OPF_REPNZ },
697 static const struct {
704 { "nop", OP_NOP, 0, 0, 0 },
705 { "push", OP_PUSH, 1, 1, 0 },
706 { "pop", OP_POP, 1, 1, OPF_DATA },
707 { "mov" , OP_MOV, 2, 2, OPF_DATA },
708 { "lea", OP_LEA, 2, 2, OPF_DATA },
709 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
710 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
711 { "not", OP_NOT, 1, 1, OPF_DATA },
712 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
713 { "stosb",OP_STOS, 0, 0, OPF_DATA },
714 { "stosw",OP_STOS, 0, 0, OPF_DATA },
715 { "stosd",OP_STOS, 0, 0, OPF_DATA },
716 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
717 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
718 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
719 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
720 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
721 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
722 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
723 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
724 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
725 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
726 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
727 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
728 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
729 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
730 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
731 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
732 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
733 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
734 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
735 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
736 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
737 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
738 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
739 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
740 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
741 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
742 { "test", OP_TEST, 2, 2, OPF_FLAGS },
743 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
744 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
745 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS },
746 { "jmp", OP_JMP, 1, 1, OPF_JMP },
747 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
748 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
749 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
750 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
751 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
752 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
753 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
754 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
755 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
756 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
757 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
758 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
759 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
760 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
761 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
762 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
763 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
764 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
765 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
766 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
767 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
768 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
769 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
770 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
771 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
772 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
773 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
774 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
775 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
776 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
777 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
778 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
779 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
780 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
781 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
782 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
783 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
784 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
785 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
786 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
787 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
788 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
789 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
790 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
791 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
792 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
793 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
794 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
795 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
796 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
797 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
798 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
799 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
800 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
801 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
802 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
803 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
806 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
808 enum opr_lenmod lmod = OPLM_UNSPEC;
809 int prefix_flags = 0;
817 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
818 if (IS(words[w], pref_table[i].name)) {
819 prefix_flags = pref_table[i].flags;
826 aerr("lone prefix: '%s'\n", words[0]);
831 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
832 if (IS(words[w], op_table[i].name))
836 if (i == ARRAY_SIZE(op_table))
837 aerr("unhandled op: '%s'\n", words[0]);
840 op->op = op_table[i].op;
841 op->flags = op_table[i].flags | prefix_flags;
842 op->regmask_src = op->regmask_dst = 0;
844 for (opr = 0; opr < op_table[i].minopr; opr++) {
845 regmask = regmask_ind = 0;
846 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
847 words, wordc, w, op->flags);
849 if (opr == 0 && (op->flags & OPF_DATA))
850 op->regmask_dst = regmask;
851 // for now, mark dst as src too
852 op->regmask_src |= regmask | regmask_ind;
855 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
856 w = parse_operand(&op->operand[opr],
857 &op->regmask_src, &op->regmask_src,
858 words, wordc, w, op->flags);
862 aerr("parse_op %s incomplete: %d/%d\n",
866 op->operand_cnt = opr;
867 if (!strncmp(op_table[i].name, "set", 3))
868 op->operand[0].lmod = OPLM_BYTE;
870 // ops with implicit argumets
874 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
875 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
879 if (op->operand_cnt != 0)
881 if (IS(words[op_w], "stosb"))
883 else if (IS(words[op_w], "stosw"))
885 else if (IS(words[op_w], "stosd"))
888 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
889 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
890 op->regmask_dst = op->regmask_src;
891 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
896 if (op->operand_cnt != 0)
898 if (words[op_w][4] == 'b')
900 else if (words[op_w][4] == 'w')
902 else if (words[op_w][4] == 'd')
905 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
906 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
907 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
908 op->regmask_dst = op->regmask_src;
912 if (op->operand_cnt != 1)
917 op->regmask_dst = (1 << xDX) | (1 << xAX);
918 op->regmask_src |= (1 << xAX);
919 if (op->operand[0].lmod == OPLM_UNSPEC)
920 op->operand[0].lmod = OPLM_DWORD;
925 // we could set up operands for edx:eax, but there is no real need to
926 // (see is_opr_modified())
927 regmask = (1 << xDX) | (1 << xAX);
928 op->regmask_dst = regmask;
929 op->regmask_src |= regmask;
930 if (op->operand[0].lmod == OPLM_UNSPEC)
931 op->operand[0].lmod = OPLM_DWORD;
939 if (op->operand[1].lmod == OPLM_UNSPEC)
940 op->operand[1].lmod = OPLM_BYTE;
944 if (op->operand[0].lmod == OPLM_UNSPEC
945 && (op->operand[0].type == OPT_CONST
946 || op->operand[0].type == OPT_OFFSET
947 || op->operand[0].type == OPT_LABEL))
948 op->operand[0].lmod = OPLM_DWORD;
953 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
954 && op->operand[0].reg == xDI && op->operand[1].reg == xDI)
956 op->flags |= OPF_RMD;
965 static const char *op_name(enum op_op op)
969 for (i = 0; i < ARRAY_SIZE(op_table); i++)
970 if (op_table[i].op == op)
971 return op_table[i].name;
977 static const char *dump_op(struct parsed_op *po)
979 static char out[128];
986 snprintf(out, sizeof(out), "%s", op_name(po->op));
987 for (i = 0; i < po->operand_cnt; i++) {
991 snprintf(p, sizeof(out) - (p - out),
992 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
993 po->operand[i].name);
999 static const char *lmod_type_u(struct parsed_op *po,
1000 enum opr_lenmod lmod)
1010 ferr(po, "invalid lmod: %d\n", lmod);
1011 return "(_invalid_)";
1015 static const char *lmod_cast_u(struct parsed_op *po,
1016 enum opr_lenmod lmod)
1026 ferr(po, "invalid lmod: %d\n", lmod);
1027 return "(_invalid_)";
1031 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1032 enum opr_lenmod lmod)
1042 ferr(po, "invalid lmod: %d\n", lmod);
1043 return "(_invalid_)";
1047 static const char *lmod_cast_s(struct parsed_op *po,
1048 enum opr_lenmod lmod)
1058 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1059 return "(_invalid_)";
1063 static const char *lmod_cast(struct parsed_op *po,
1064 enum opr_lenmod lmod, int is_signed)
1067 lmod_cast_s(po, lmod) :
1068 lmod_cast_u(po, lmod);
1071 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1081 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1086 static const char *opr_name(struct parsed_op *po, int opr_num)
1088 if (opr_num >= po->operand_cnt)
1089 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1090 return po->operand[opr_num].name;
1093 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1095 if (opr_num >= po->operand_cnt)
1096 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1097 if (po->operand[opr_num].type != OPT_CONST)
1098 ferr(po, "opr %d: const expected\n", opr_num);
1099 return po->operand[opr_num].val;
1102 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1104 if ((unsigned int)popr->reg >= MAX_REGS)
1105 ferr(po, "invalid reg: %d\n", popr->reg);
1106 return regs_r32[popr->reg];
1109 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1118 namelen = strlen(name);
1120 p = strchr(name, '+');
1124 ferr(po, "equ parse failed for '%s'\n", name);
1126 if (IS_START(p, "0x"))
1128 *extra_offs = strtol(p, &endp, 16);
1130 ferr(po, "equ parse failed for '%s'\n", name);
1133 for (i = 0; i < g_eqcnt; i++)
1134 if (strncmp(g_eqs[i].name, name, namelen) == 0
1135 && g_eqs[i].name[namelen] == 0)
1139 ferr(po, "unresolved equ name: '%s'\n", name);
1146 static void stack_frame_access(struct parsed_op *po,
1147 enum opr_lenmod lmod, char *buf, size_t buf_size,
1148 const char *name, const char *cast, int is_src, int is_lea)
1150 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1151 const char *prefix = "";
1152 const char *bp_arg = NULL;
1153 char ofs_reg[16] = { 0, };
1154 struct parsed_equ *eq;
1157 int i, arg_i, arg_s;
1162 if (!IS_START(name, "ebp-")) {
1163 bp_arg = parse_stack_el(name, ofs_reg);
1164 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1165 eq = equ_find(po, bp_arg, &offset);
1167 ferr(po, "detected but missing eq\n");
1168 offset += eq->offset;
1172 if (IS_START(p, "0x"))
1174 offset = -strtoul(p, &endp, 16);
1176 ferr(po, "ebp- parse of '%s' failed\n", name);
1179 if (!strncmp(name, "ebp", 3))
1182 if (stack_ra <= offset && offset < stack_ra + 4)
1183 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1185 if (offset > stack_ra)
1187 arg_i = (offset - stack_ra - 4) / 4;
1188 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
1190 if (g_func_pp.is_vararg && arg_i == g_func_pp.argc_stack && is_lea) {
1191 // should be va_list
1194 snprintf(buf, buf_size, "%sap", cast);
1197 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1198 offset, bp_arg, arg_i);
1200 if (ofs_reg[0] != 0)
1201 ferr(po, "offset reg on arg access?\n");
1203 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
1204 if (g_func_pp.arg[i].reg != NULL)
1210 if (i == g_func_pp.argc)
1211 ferr(po, "arg %d not in prototype?\n", arg_i);
1217 ferr(po, "lea/byte to arg?\n");
1218 if (is_src && (offset & 3) == 0)
1219 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1221 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1226 ferr(po, "lea/word to arg?\n");
1228 ferr(po, "unaligned arg access\n");
1229 if (is_src && (offset & 2) == 0)
1230 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1232 snprintf(buf, buf_size, "%sWORD(a%d)",
1233 (offset & 2) ? "HI" : "LO", i + 1);
1238 ferr(po, "unaligned arg access\n");
1243 snprintf(buf, buf_size, "%s%sa%d", prefix, is_lea ? "&" : "", i + 1);
1247 ferr(po, "bp_arg bad lmod: %d\n", lmod);
1251 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp.arg[i].type);
1252 if ((offset & 3) && tmp_lmod != OPLM_DWORD)
1253 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
1254 offset, g_func_pp.arg[i].type.name);
1258 if (g_stack_fsz == 0)
1259 ferr(po, "stack var access without stackframe\n");
1261 sf_ofs = g_stack_fsz + offset;
1263 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1273 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1274 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1278 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1279 // known unaligned or possibly unaligned
1280 strcat(g_comment, " unaligned");
1282 prefix = "*(u16 *)&";
1283 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1284 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1287 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1291 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1292 // known unaligned or possibly unaligned
1293 strcat(g_comment, " unaligned");
1295 prefix = "*(u32 *)&";
1296 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1297 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1300 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1304 ferr(po, "bp_stack bad lmod: %d\n", lmod);
1309 static void check_label_read_ref(struct parsed_op *po, const char *name)
1311 if (IS_START(name, "sub_"))
1312 ferr(po, "func reference?\n");
1315 static char *out_src_opr(char *buf, size_t buf_size,
1316 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1319 char tmp1[256], tmp2[256];
1326 switch (popr->type) {
1329 ferr(po, "lea from reg?\n");
1331 switch (popr->lmod) {
1333 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1336 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1339 if (popr->name[1] == 'h') // XXX..
1340 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1342 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1345 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1350 if (parse_stack_el(popr->name, NULL)
1351 || (g_bp_frame && IS_START(popr->name, "ebp-")))
1353 stack_frame_access(po, popr->lmod, buf, buf_size,
1354 popr->name, cast, 1, is_lea);
1358 strcpy(expr, popr->name);
1359 if (strchr(expr, '[')) {
1360 // special case: '[' can only be left for label[reg] form
1361 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1363 ferr(po, "parse failure for '%s'\n", expr);
1364 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1367 // XXX: do we need more parsing?
1369 snprintf(buf, buf_size, "%s", expr);
1374 cast = lmod_cast_u_ptr(po, popr->lmod);
1375 snprintf(buf, buf_size, "%s(%s)", cast, expr);
1379 check_label_read_ref(po, popr->name);
1380 if (cast[0] == 0 && popr->is_ptr)
1383 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1385 snprintf(buf, buf_size, "%s%s%s", cast, popr->name,
1386 popr->is_array ? "[0]" : "");
1390 check_label_read_ref(po, popr->name);
1394 ferr(po, "lea an offset?\n");
1395 snprintf(buf, buf_size, "%s&%s", cast, popr->name);
1400 ferr(po, "lea from const?\n");
1402 snprintf(buf, buf_size, "%s", cast);
1404 printf_number(buf + ret, buf_size - ret, popr->val);
1408 ferr(po, "invalid src type: %d\n", popr->type);
1414 static char *out_dst_opr(char *buf, size_t buf_size,
1415 struct parsed_op *po, struct parsed_opr *popr)
1417 switch (popr->type) {
1419 switch (popr->lmod) {
1421 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1425 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1429 if (popr->name[1] == 'h') // XXX..
1430 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1432 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1435 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1440 if (parse_stack_el(popr->name, NULL)
1441 || (g_bp_frame && IS_START(popr->name, "ebp-")))
1443 stack_frame_access(po, popr->lmod, buf, buf_size,
1444 popr->name, "", 0, 0);
1448 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1451 snprintf(buf, buf_size, "%s%s", popr->name,
1452 popr->is_array ? "[0]" : "");
1456 ferr(po, "invalid dst type: %d\n", popr->type);
1462 static char *out_src_opr_u32(char *buf, size_t buf_size,
1463 struct parsed_op *po, struct parsed_opr *popr)
1465 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1468 static enum parsed_flag_op split_cond(struct parsed_op *po,
1469 enum op_op op, int *is_inv)
1521 ferr(po, "split_cond: bad op %d\n", op);
1526 static void out_test_for_cc(char *buf, size_t buf_size,
1527 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1528 enum opr_lenmod lmod, const char *expr)
1530 const char *cast, *scast;
1532 cast = lmod_cast_u(po, lmod);
1533 scast = lmod_cast_s(po, lmod);
1537 case PFO_BE: // CF=1||ZF=1; CF=0
1538 snprintf(buf, buf_size, "(%s%s %s 0)",
1539 cast, expr, is_inv ? "!=" : "==");
1543 case PFO_L: // SF!=OF; OF=0
1544 snprintf(buf, buf_size, "(%s%s %s 0)",
1545 scast, expr, is_inv ? ">=" : "<");
1548 case PFO_LE: // ZF=1||SF!=OF; OF=0
1549 snprintf(buf, buf_size, "(%s%s %s 0)",
1550 scast, expr, is_inv ? ">" : "<=");
1554 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1558 static void out_cmp_for_cc(char *buf, size_t buf_size,
1559 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1560 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1562 const char *cast, *scast;
1564 cast = lmod_cast_u(po, lmod);
1565 scast = lmod_cast_s(po, lmod);
1569 // note: must be unsigned compare
1570 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1571 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1575 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1576 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1580 // note: must be unsigned compare
1581 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1582 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1585 // note: must be signed compare
1587 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1588 scast, expr1, expr2, is_inv ? ">=" : "<");
1592 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1593 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1597 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1598 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1602 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1606 static void out_cmp_test(char *buf, size_t buf_size,
1607 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1609 char buf1[256], buf2[256], buf3[256];
1611 if (po->op == OP_TEST) {
1612 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1613 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1616 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1617 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1618 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1620 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1621 po->operand[0].lmod, buf3);
1623 else if (po->op == OP_CMP) {
1624 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
1625 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[1]);
1626 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1627 po->operand[0].lmod, buf2, buf3);
1630 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1633 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1634 struct parsed_opr *popr2)
1636 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1637 ferr(po, "missing lmod for both operands\n");
1639 if (popr1->lmod == OPLM_UNSPEC)
1640 popr1->lmod = popr2->lmod;
1641 else if (popr2->lmod == OPLM_UNSPEC)
1642 popr2->lmod = popr1->lmod;
1643 else if (popr1->lmod != popr2->lmod)
1644 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1647 static const char *op_to_c(struct parsed_op *po)
1671 ferr(po, "op_to_c was supplied with %d\n", po->op);
1675 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1676 enum op_flags flag_check)
1678 if (po->flags & flag)
1679 ferr(po, "flag %x already set\n", flag);
1680 if (po->flags & flag_check)
1681 ferr(po, "flag_check %x already set\n", flag_check);
1686 static int scan_for_pop(int i, int opcnt, const char *reg,
1687 int magic, int depth, int *maxdepth, int do_flags)
1689 struct parsed_op *po;
1693 for (; i < opcnt; i++) {
1695 if (po->cc_scratch == magic)
1696 break; // already checked
1697 po->cc_scratch = magic;
1699 if (po->flags & OPF_TAIL)
1700 return -1; // deadend
1702 if ((po->flags & OPF_RMD)
1703 || (po->op == OP_PUSH && po->argmask)) // arg push
1706 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1707 if (po->btj != NULL) {
1709 for (j = 0; j < po->btj->count - 1; j++) {
1710 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1711 depth, maxdepth, do_flags);
1713 return ret; // dead end
1715 // follow last jumptable entry
1716 i = po->btj->d[j].bt_i - 1;
1721 ferr(po, "dead branch\n");
1725 if (po->flags & OPF_CC) {
1726 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1727 depth, maxdepth, do_flags);
1729 return ret; // dead end
1737 if ((po->op == OP_POP || po->op == OP_PUSH)
1738 && po->operand[0].type == OPT_REG
1739 && IS(po->operand[0].name, reg))
1741 if (po->op == OP_PUSH) {
1743 if (depth > *maxdepth)
1746 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1748 else if (depth == 0) {
1750 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1755 if (depth < 0) // should not happen
1756 ferr(po, "fail with depth\n");
1758 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1766 // scan for pop starting from 'ret' op (all paths)
1767 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1773 for (; i < opcnt; i++) {
1774 if (!(ops[i].flags & OPF_TAIL))
1777 for (j = i - 1; j >= 0; j--) {
1778 if (ops[j].flags & OPF_RMD)
1780 if (ops[j].flags & OPF_JMP)
1783 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1784 && IS(ops[j].operand[0].name, reg))
1787 ops[j].flags |= flag_set;
1791 if (g_labels[j][0] != 0)
1796 return found ? 0 : -1;
1799 // is operand 'opr modified' by parsed_op 'po'?
1800 static int is_opr_modified(const struct parsed_opr *opr,
1801 const struct parsed_op *po)
1803 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1806 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1807 if (po->regmask_dst & (1 << opr->reg))
1813 return IS(po->operand[0].name, opr->name);
1816 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1817 static int is_any_opr_modified(const struct parsed_op *po_test,
1818 const struct parsed_op *po)
1822 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1825 if (po_test->regmask_src & po->regmask_dst)
1828 for (i = 0; i < po_test->operand_cnt; i++)
1829 if (IS(po_test->operand[i].name, po->operand[0].name))
1835 // scan for any po_test operand modification in range given
1836 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1838 for (; i < opcnt; i++) {
1839 if (is_any_opr_modified(po_test, &ops[i]))
1846 // scan for po_test operand[0] modification in range given
1847 static int scan_for_mod_opr0(struct parsed_op *po_test,
1850 for (; i < opcnt; i++) {
1851 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1858 static int scan_for_flag_set(int i)
1860 for (; i >= 0; i--) {
1861 if (ops[i].flags & OPF_FLAGS)
1864 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1866 if (g_labels[i][0] != 0)
1873 // scan back for cdq, if anything modifies edx, fail
1874 static int scan_for_cdq_edx(int i)
1876 for (; i >= 0; i--) {
1877 if (ops[i].op == OP_CDQ)
1880 if (ops[i].regmask_dst & (1 << xDX))
1882 if (g_labels[i][0] != 0)
1889 static int scan_for_reg_clear(int i, int reg)
1891 for (; i >= 0; i--) {
1892 if (ops[i].op == OP_XOR
1893 && ops[i].operand[0].lmod == OPLM_DWORD
1894 && ops[i].operand[0].reg == ops[i].operand[1].reg
1895 && ops[i].operand[0].reg == reg)
1898 if (ops[i].regmask_dst & (1 << reg))
1900 if (g_labels[i][0] != 0)
1907 // scan for positive, constant esp adjust
1908 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1910 struct parsed_op *po;
1913 for (; i < opcnt; i++) {
1916 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
1917 if (po->operand[1].type != OPT_CONST)
1918 ferr(&ops[i], "non-const esp adjust?\n");
1919 *adj += po->operand[1].val;
1921 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1924 else if (po->op == OP_PUSH)
1925 *adj -= lmod_bytes(po, po->operand[0].lmod);
1926 else if (po->op == OP_POP)
1927 *adj += lmod_bytes(po, po->operand[0].lmod);
1928 else if ((po->flags & (OPF_JMP|OPF_TAIL)) && po->op != OP_CALL)
1931 if (g_labels[i][0] != 0)
1938 static void add_label_ref(struct label_ref *lr, int op_i)
1940 struct label_ref *lr_new;
1947 lr_new = calloc(1, sizeof(*lr_new));
1952 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1954 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1955 struct parsed_opr *last_arith_dst = NULL;
1956 char buf1[256], buf2[256], buf3[256], cast[64];
1957 struct parsed_proto *pp, *pp_tmp;
1958 struct parsed_data *pd;
1959 const char *tmpname;
1960 enum parsed_flag_op pfo;
1961 int save_arg_vars = 0;
1962 int cmp_result_vars = 0;
1963 int need_mul_var = 0;
1965 int label_pending = 0;
1966 int regmask_save = 0;
1967 int regmask_arg = 0;
1979 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
1981 ret = proto_parse(fhdr, funcn, &g_func_pp);
1983 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1985 fprintf(fout, "%s %s(", g_func_pp.ret_type.name, funcn);
1986 for (i = 0; i < g_func_pp.argc; i++) {
1988 fprintf(fout, ", ");
1989 fprintf(fout, "%s a%d", g_func_pp.arg[i].type.name, i + 1);
1991 if (g_func_pp.is_vararg) {
1993 fprintf(fout, ", ");
1994 fprintf(fout, "...");
1996 fprintf(fout, ")\n{\n");
1999 // - handle ebp/esp frame, remove ops related to it
2000 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2001 && ops[1].op == OP_MOV
2002 && IS(opr_name(&ops[1], 0), "ebp")
2003 && IS(opr_name(&ops[1], 1), "esp"))
2008 ops[0].flags |= OPF_RMD;
2009 ops[1].flags |= OPF_RMD;
2012 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2013 g_stack_fsz = opr_const(&ops[2], 1);
2014 ops[2].flags |= OPF_RMD;
2018 // another way msvc builds stack frame..
2020 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2022 ops[i].flags |= OPF_RMD;
2026 // and another way..
2027 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
2028 && ops[i].operand[1].type == OPT_CONST
2029 && ops[i + 1].op == OP_CALL
2030 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
2032 g_stack_fsz += ops[i].operand[1].val;
2033 ops[i].flags |= OPF_RMD;
2035 ops[i].flags |= OPF_RMD;
2042 for (; i < opcnt; i++)
2043 if (ops[i].op == OP_RET)
2045 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
2048 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
2049 ferr(&ops[i - 1], "'pop ebp' expected\n");
2050 ops[i - 1].flags |= OPF_RMD;
2052 if (g_stack_fsz != 0) {
2053 if (ops[i - 2].op != OP_MOV
2054 || !IS(opr_name(&ops[i - 2], 0), "esp")
2055 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
2057 ferr(&ops[i - 2], "esp restore expected\n");
2059 ops[i - 2].flags |= OPF_RMD;
2061 if (ecx_push && ops[i - 3].op == OP_POP
2062 && IS(opr_name(&ops[i - 3], 0), "ecx"))
2064 ferr(&ops[i - 3], "unexpected ecx pop\n");
2070 } while (i < opcnt);
2073 for (i = 0; i < opcnt; i++) {
2074 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2076 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2077 && ops[i].operand[1].type == OPT_CONST)
2086 g_stack_fsz = ops[i].operand[1].val;
2087 ops[i].flags |= OPF_RMD;
2091 for (; i < opcnt; i++)
2092 if (ops[i].op == OP_RET)
2094 if (ops[i - 1].op != OP_ADD
2095 || !IS(opr_name(&ops[i - 1], 0), "esp")
2096 || ops[i - 1].operand[1].type != OPT_CONST
2097 || ops[i - 1].operand[1].val != g_stack_fsz)
2098 ferr(&ops[i - 1], "'add esp' expected\n");
2099 ops[i - 1].flags |= OPF_RMD;
2102 } while (i < opcnt);
2107 // - resolve all branches
2108 for (i = 0; i < opcnt; i++) {
2113 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
2114 || po->op == OP_CALL || po->op == OP_RET)
2117 if (po->operand[0].type == OPT_REGMEM) {
2118 char *p = strchr(po->operand[0].name, '[');
2120 ferr(po, "unhandled indirect branch\n");
2121 ret = p - po->operand[0].name;
2122 strncpy(buf1, po->operand[0].name, ret);
2125 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2126 if (IS(g_func_pd[j].label, buf1)) {
2132 ferr(po, "label '%s' not parsed?\n", buf1);
2133 if (pd->type != OPT_OFFSET)
2134 ferr(po, "label '%s' with non-offset data?\n", buf1);
2136 // find all labels, link
2137 for (j = 0; j < pd->count; j++) {
2138 for (l = 0; l < opcnt; l++) {
2139 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2140 add_label_ref(&g_label_refs[l], i);
2151 for (l = 0; l < opcnt; l++) {
2152 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2153 add_label_ref(&g_label_refs[l], i);
2162 if (po->operand[0].type == OPT_LABEL) {
2165 po->flags |= OPF_TAIL;
2169 ferr(po, "unhandled branch\n");
2174 for (i = 0; i < opcnt; i++)
2177 if (po->flags & OPF_RMD)
2180 if (po->op == OP_CALL)
2182 pp = calloc(1, sizeof(*pp));
2183 my_assert_not(pp, NULL);
2184 tmpname = opr_name(po, 0);
2185 if (po->operand[0].type != OPT_LABEL)
2187 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2189 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2191 if (j > ARRAY_SIZE(pp->arg))
2192 ferr(po, "esp adjust too large?\n");
2193 pp->ret_type.name = strdup("int");
2194 pp->argc = pp->argc_stack = j;
2195 for (arg = 0; arg < pp->argc; arg++)
2196 pp->arg[arg].type.name = strdup("int");
2199 ret = proto_parse(fhdr, tmpname, pp);
2201 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2204 // look for and make use of esp adjust
2206 if (!pp->is_stdcall)
2207 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2209 if (pp->is_vararg) {
2210 if (j / 4 < pp->argc_stack)
2211 ferr(po, "esp adjust is too small: %x < %x\n",
2212 j, pp->argc_stack * 4);
2213 // modify pp to make it have varargs as normal args
2215 pp->argc += j / 4 - pp->argc_stack;
2216 for (; arg < pp->argc; arg++) {
2217 pp->arg[arg].type.name = strdup("int");
2220 if (pp->argc > ARRAY_SIZE(pp->arg))
2221 ferr(po, "too many args\n");
2223 if (pp->argc_stack != j / 4)
2224 ferr(po, "stack tracking failed: %x %x\n",
2225 pp->argc_stack * 4, j);
2227 ops[ret].flags |= OPF_RMD;
2228 // a bit of a hack, but deals with use of
2229 // single adj for multiple calls
2230 ops[ret].operand[1].val -= j;
2232 else if (pp->is_vararg)
2233 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2236 // can't call functions with non-__cdecl callbacks yet
2237 for (arg = 0; arg < pp->argc; arg++) {
2238 if (pp->arg[arg].fptr != NULL) {
2239 pp_tmp = pp->arg[arg].fptr;
2240 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2241 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2245 // collect all stack args
2246 for (arg = 0; arg < pp->argc; arg++)
2247 if (pp->arg[arg].reg == NULL)
2250 for (j = i; j >= 0 && arg < pp->argc; )
2252 if (g_labels[j][0] != 0) {
2253 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
2254 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
2256 // follow the branch in reverse
2257 if (g_label_refs[j].i == -1)
2258 ferr(po, "no refs for '%s'?\n", g_labels[j]);
2259 if (g_label_refs[j].next != NULL)
2260 ferr(po, "unhandled multiple refs to '%s'\n", g_labels[j]);
2261 j = g_label_refs[j].i + 1;
2268 if (ops[j].op == OP_CALL)
2270 pp_tmp = ops[j].datap;
2272 ferr(po, "arg collect hit unparsed call\n");
2273 if (pp_tmp->argc_stack > 0)
2274 ferr(po, "arg collect hit '%s' with %d stack args\n",
2275 opr_name(&ops[j], 0), pp_tmp->argc_stack);
2277 else if ((ops[j].flags & OPF_TAIL)
2278 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
2282 else if (ops[j].op == OP_PUSH)
2284 pp->arg[arg].datap = &ops[j];
2285 ret = scan_for_mod(&ops[j], j + 1, i);
2287 // mark this push as one that needs operand saving
2288 ops[j].flags &= ~OPF_RMD;
2289 ops[j].argmask |= 1 << arg;
2290 save_arg_vars |= 1 << arg;
2293 ops[j].flags |= OPF_RMD;
2296 for (arg++; arg < pp->argc; arg++)
2297 if (pp->arg[arg].reg == NULL)
2302 ferr(po, "arg collect failed for '%s': %d/%d\n",
2303 tmpname, arg, pp->argc);
2309 // - find POPs for PUSHes, rm both
2310 // - scan for all used registers
2311 // - find flag set ops for their users
2312 // - declare indirect functions
2313 for (i = 0; i < opcnt; i++) {
2315 if (po->flags & OPF_RMD)
2318 if (po->op == OP_PUSH
2319 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
2320 && po->operand[0].type == OPT_REG)
2322 reg = po->operand[0].reg;
2324 ferr(po, "reg not set for push?\n");
2327 ret = scan_for_pop(i + 1, opcnt,
2328 po->operand[0].name, i + opcnt, 0, &depth, 0);
2331 ferr(po, "too much depth: %d\n", depth);
2333 regmask_save |= 1 << reg;
2335 po->flags |= OPF_RMD;
2336 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2337 i + opcnt * 2, 0, &depth, 1);
2340 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2343 if (regmask & (1 << reg)) {
2344 if (regmask_save & (1 << reg))
2345 ferr(po, "%s already saved?\n", po->operand[0].name);
2349 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2354 regmask |= po->regmask_src | po->regmask_dst;
2356 if (po->flags & OPF_CC)
2358 ret = scan_for_flag_set(i - 1);
2360 ferr(po, "unable to trace flag setter\n");
2362 tmp_op = &ops[ret]; // flag setter
2363 pfo = split_cond(po, po->op, &dummy);
2366 // to get nicer code, we try to delay test and cmp;
2367 // if we can't because of operand modification, or if we
2368 // have math op, make it calculate flags explicitly
2369 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2370 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
2373 else if (tmp_op->op == OP_CMPS) {
2374 pfomask = 1 << PFO_Z;
2377 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2378 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
2382 tmp_op->pfomask |= pfomask;
2383 cmp_result_vars |= pfomask;
2387 if (po->op == OP_ADC || po->op == OP_SBB)
2388 cmp_result_vars |= 1 << PFO_C;
2390 else if (po->op == OP_MUL
2391 || (po->op == OP_IMUL && po->operand_cnt == 1))
2395 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2397 my_assert_not(pp, NULL);
2398 fprintf(fout, " %s (*icall%d)(", pp->ret_type.name, i);
2399 for (j = 0; j < pp->argc; j++) {
2401 fprintf(fout, ", ");
2402 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
2404 fprintf(fout, ");\n");
2408 // output LUTs/jumptables
2409 for (i = 0; i < g_func_pd_cnt; i++) {
2411 fprintf(fout, " static const ");
2412 if (pd->type == OPT_OFFSET) {
2413 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2415 for (j = 0; j < pd->count; j++) {
2417 fprintf(fout, ", ");
2418 fprintf(fout, "&&%s", pd->d[j].u.label);
2422 fprintf(fout, "%s %s[] =\n { ",
2423 lmod_type_u(ops, pd->lmod), pd->label);
2425 for (j = 0; j < pd->count; j++) {
2427 fprintf(fout, ", ");
2428 fprintf(fout, "%u", pd->d[j].u.val);
2431 fprintf(fout, " };\n");
2434 // declare stack frame, va_arg
2436 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2437 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2439 if (g_func_pp.is_vararg)
2440 fprintf(fout, " va_list ap;\n");
2442 // declare arg-registers
2443 for (i = 0; i < g_func_pp.argc; i++) {
2444 if (g_func_pp.arg[i].reg != NULL) {
2445 reg = char_array_i(regs_r32,
2446 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
2448 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
2450 regmask_arg |= 1 << reg;
2451 fprintf(fout, " u32 %s = (u32)a%d;\n",
2452 g_func_pp.arg[i].reg, i + 1);
2457 // declare other regs - special case for eax
2458 if (!((regmask | regmask_arg) & 1)
2459 && !IS(g_func_pp.ret_type.name, "void"))
2461 fprintf(fout, " u32 eax = 0;\n");
2465 regmask &= ~regmask_arg;
2466 regmask &= ~(1 << xSP);
2468 regmask &= ~(1 << xBP);
2470 for (reg = 0; reg < 8; reg++) {
2471 if (regmask & (1 << reg)) {
2472 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2479 for (reg = 0; reg < 8; reg++) {
2480 if (regmask_save & (1 << reg)) {
2481 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2487 if (save_arg_vars) {
2488 for (reg = 0; reg < 32; reg++) {
2489 if (save_arg_vars & (1 << reg)) {
2490 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2496 if (cmp_result_vars) {
2497 for (i = 0; i < 8; i++) {
2498 if (cmp_result_vars & (1 << i)) {
2499 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2506 fprintf(fout, " u64 mul_tmp;\n");
2511 fprintf(fout, "\n");
2513 if (g_func_pp.is_vararg) {
2514 if (g_func_pp.argc_stack == 0)
2515 ferr(ops, "vararg func without stack args?\n");
2516 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp.argc);
2520 for (i = 0; i < opcnt; i++)
2522 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1) {
2523 fprintf(fout, "\n%s:\n", g_labels[i]);
2528 if (po->flags & OPF_RMD)
2533 #define assert_operand_cnt(n_) \
2534 if (po->operand_cnt != n_) \
2535 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2537 // conditional/flag using op?
2538 if (po->flags & OPF_CC)
2543 pfo = split_cond(po, po->op, &is_inv);
2545 // we go through all this trouble to avoid using parsed_flag_op,
2546 // which makes generated code much nicer
2547 if (delayed_flag_op != NULL)
2549 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2552 else if (last_arith_dst != NULL
2553 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2555 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
2556 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2557 last_arith_dst->lmod, buf3);
2560 else if (po->datap != NULL) {
2561 // use preprocessed flag calc results
2563 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2564 ferr(po, "not prepared for pfo %d\n", pfo);
2566 // note: is_inv was not yet applied
2567 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2568 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2571 ferr(po, "all methods of finding comparison failed\n");
2574 if (po->flags & OPF_JMP) {
2575 fprintf(fout, " if %s\n", buf1);
2577 else if (po->op == OP_ADC || po->op == OP_SBB) {
2579 fprintf(fout, " cond_%s = %s;\n",
2580 parsed_flag_op_names[pfo], buf1);
2582 else if (po->flags & OPF_DATA) { // SETcc
2583 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2584 fprintf(fout, " %s = %s;", buf2, buf1);
2587 ferr(po, "unhandled conditional op\n");
2591 pfomask = po->pfomask;
2596 assert_operand_cnt(2);
2597 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2598 fprintf(fout, " %s = %s;",
2599 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2600 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2601 po->operand[0].is_ptr ? "(void *)" : "", 0));
2605 assert_operand_cnt(2);
2606 po->operand[1].lmod = OPLM_DWORD; // always
2607 fprintf(fout, " %s = %s;",
2608 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2609 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2614 assert_operand_cnt(2);
2615 fprintf(fout, " %s = %s;",
2616 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2617 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2621 assert_operand_cnt(2);
2622 switch (po->operand[1].lmod) {
2624 strcpy(buf3, "(s8)");
2627 strcpy(buf3, "(s16)");
2630 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2632 fprintf(fout, " %s = %s%s;",
2633 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2635 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2639 assert_operand_cnt(1);
2640 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2641 fprintf(fout, " %s = ~%s;", buf1, buf1);
2645 assert_operand_cnt(2);
2646 fprintf(fout, " %s = (s32)%s >> 31;",
2647 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2648 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2649 strcpy(g_comment, "cdq");
2654 assert_operand_cnt(3);
2655 if (po->flags & OPF_REP) {
2656 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2657 lmod_bytes(po, po->operand[0].lmod));
2658 fprintf(fout, " %sedi = eax;",
2659 lmod_cast_u_ptr(po, po->operand[0].lmod));
2660 strcpy(g_comment, "rep stos");
2663 fprintf(fout, " %sedi = eax; edi += %d;",
2664 lmod_cast_u_ptr(po, po->operand[0].lmod),
2665 lmod_bytes(po, po->operand[0].lmod));
2666 strcpy(g_comment, "stos");
2672 assert_operand_cnt(3);
2673 j = lmod_bytes(po, po->operand[0].lmod);
2674 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2675 if (po->flags & OPF_REP) {
2677 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2680 " %sedi = %sesi;", buf1, buf1);
2681 strcpy(g_comment, "rep movs");
2684 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2686 strcpy(g_comment, "movs");
2692 // repe ~ repeat while ZF=1
2693 assert_operand_cnt(3);
2694 j = lmod_bytes(po, po->operand[0].lmod);
2695 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2696 if (po->flags & OPF_REP) {
2698 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2701 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
2702 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
2705 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
2706 (po->flags & OPF_REPZ) ? "e" : "ne");
2710 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
2712 strcpy(g_comment, "cmps");
2714 pfomask &= ~(1 << PFO_Z);
2715 last_arith_dst = NULL;
2716 delayed_flag_op = NULL;
2719 // arithmetic w/flags
2724 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2729 assert_operand_cnt(2);
2730 fprintf(fout, " %s %s= %s;",
2731 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2733 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2734 last_arith_dst = &po->operand[0];
2735 delayed_flag_op = NULL;
2739 assert_operand_cnt(2);
2740 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2741 fprintf(fout, " %s = %s%s >> %s;", buf1,
2742 lmod_cast_s(po, po->operand[0].lmod), buf1,
2743 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2744 last_arith_dst = &po->operand[0];
2745 delayed_flag_op = NULL;
2750 assert_operand_cnt(2);
2751 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2752 if (po->operand[1].type == OPT_CONST) {
2753 j = po->operand[1].val;
2754 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2755 fprintf(fout, po->op == OP_ROL ?
2756 " %s = (%s << %d) | (%s >> %d);" :
2757 " %s = (%s >> %d) | (%s << %d);",
2758 buf1, buf1, j, buf1,
2759 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2763 last_arith_dst = &po->operand[0];
2764 delayed_flag_op = NULL;
2768 assert_operand_cnt(2);
2769 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2770 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2771 // special case for XOR
2772 fprintf(fout, " %s = 0;",
2773 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2774 last_arith_dst = &po->operand[0];
2775 delayed_flag_op = NULL;
2782 assert_operand_cnt(2);
2783 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2784 fprintf(fout, " %s %s= %s + cond_c;",
2785 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2787 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2788 last_arith_dst = &po->operand[0];
2789 delayed_flag_op = NULL;
2794 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2795 if (po->operand[0].type == OPT_REG) {
2796 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2797 fprintf(fout, " %s%s;", buf1, buf2);
2800 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2801 fprintf(fout, " %s %s= 1;", buf1, buf2);
2803 last_arith_dst = &po->operand[0];
2804 delayed_flag_op = NULL;
2808 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2809 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
2810 fprintf(fout, " %s = -%s%s;", buf1,
2811 lmod_cast_s(po, po->operand[0].lmod), buf2);
2812 last_arith_dst = &po->operand[0];
2813 delayed_flag_op = NULL;
2814 if (pfomask & (1 << PFO_C)) {
2815 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2816 pfomask &= ~(1 << PFO_C);
2821 if (po->operand_cnt == 2)
2823 if (po->operand_cnt == 3)
2824 ferr(po, "TODO imul3\n");
2827 assert_operand_cnt(1);
2828 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2829 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
2830 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
2831 fprintf(fout, " edx = mul_tmp >> 32;\n");
2832 fprintf(fout, " eax = mul_tmp;");
2833 last_arith_dst = NULL;
2834 delayed_flag_op = NULL;
2839 assert_operand_cnt(1);
2840 if (po->operand[0].lmod != OPLM_DWORD)
2841 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2843 // 32bit division is common, look for it
2844 if (po->op == OP_DIV)
2845 ret = scan_for_reg_clear(i - 1, xDX);
2847 ret = scan_for_cdq_edx(i - 1);
2849 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2850 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2851 po->op == OP_IDIV));
2852 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2853 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2856 ferr(po, "TODO 64bit divident\n");
2857 last_arith_dst = NULL;
2858 delayed_flag_op = NULL;
2863 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2865 for (j = 0; j < 8; j++) {
2866 if (pfomask & (1 << j)) {
2867 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2868 fprintf(fout, " cond_%s = %s;",
2869 parsed_flag_op_names[j], buf1);
2876 last_arith_dst = NULL;
2877 delayed_flag_op = po;
2880 // note: we reuse OP_Jcc for SETcc, only flags differ
2881 case OP_JO ... OP_JG:
2882 if (po->flags & OPF_JMP)
2883 fprintf(fout, " goto %s;", po->operand[0].name);
2884 // else SETcc - should already be handled
2888 assert_operand_cnt(1);
2889 if (po->operand[0].type == OPT_REGMEM) {
2890 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
2893 ferr(po, "parse failure for jmp '%s'\n",
2894 po->operand[0].name);
2895 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
2898 else if (po->operand[0].type != OPT_LABEL)
2899 ferr(po, "unhandled jmp type\n");
2901 fprintf(fout, " goto %s;", po->operand[0].name);
2905 assert_operand_cnt(1);
2908 ferr(po, "NULL pp\n");
2910 if (po->operand[0].type != OPT_LABEL)
2911 fprintf(fout, " icall%d = (void *)%s;\n", i,
2912 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]));
2915 if (!IS(pp->ret_type.name, "void")) {
2916 if (po->flags & OPF_TAIL)
2917 fprintf(fout, "return ");
2919 fprintf(fout, "eax = ");
2920 if (pp->ret_type.is_ptr)
2921 fprintf(fout, "(u32)");
2924 if (po->operand[0].type != OPT_LABEL) {
2925 fprintf(fout, "icall%d(", i);
2928 if (pp->name[0] == 0)
2929 ferr(po, "missing pp->name\n");
2930 fprintf(fout, "%s(", pp->name);
2933 for (arg = 0; arg < pp->argc; arg++) {
2935 fprintf(fout, ", ");
2938 if (pp->arg[arg].type.is_ptr)
2939 snprintf(cast, sizeof(cast), "(%s)", pp->arg[arg].type.name);
2941 if (pp->arg[arg].reg != NULL) {
2942 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
2947 tmp_op = pp->arg[arg].datap;
2949 ferr(po, "parsed_op missing for arg%d\n", arg);
2950 if (tmp_op->argmask) {
2951 fprintf(fout, "%ss_a%d", cast, arg + 1);
2955 out_src_opr(buf1, sizeof(buf1),
2956 tmp_op, &tmp_op->operand[0], cast, 0));
2959 fprintf(fout, ");");
2961 if (po->flags & OPF_TAIL) {
2962 strcpy(g_comment, "tailcall");
2963 if (IS(pp->ret_type.name, "void")) {
2964 fprintf(fout, "\n return;");
2965 strcpy(g_comment, "^ tailcall");
2968 delayed_flag_op = NULL;
2969 last_arith_dst = NULL;
2973 if (g_func_pp.is_vararg)
2974 fprintf(fout, " va_end(ap);\n");
2976 if (IS(g_func_pp.ret_type.name, "void")) {
2977 if (i != opcnt - 1 || label_pending)
2978 fprintf(fout, " return;");
2980 else if (g_func_pp.ret_type.is_ptr) {
2981 fprintf(fout, " return (%s)eax;",
2982 g_func_pp.ret_type.name);
2985 fprintf(fout, " return eax;");
2990 // special case - saved func arg
2991 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2992 for (j = 0; j < 32; j++) {
2993 if (po->argmask & (1 << j))
2994 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
2998 else if (po->flags & OPF_RSAVE) {
2999 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3000 fprintf(fout, " s_%s = %s;", buf1, buf1);
3003 ferr(po, "stray push encountered\n");
3007 if (po->flags & OPF_RSAVE) {
3008 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3009 fprintf(fout, " %s = s_%s;", buf1, buf1);
3012 ferr(po, "stray pop encountered\n");
3020 ferr(po, "unhandled op type %d, flags %x\n",
3025 // some sanity checking
3026 if ((po->flags & OPF_REP) && po->op != OP_STOS
3027 && po->op != OP_MOVS && po->op != OP_CMPS)
3028 ferr(po, "unexpected rep\n");
3029 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
3030 ferr(po, "unexpected repz/repnz\n");
3032 if (g_comment[0] != 0) {
3033 fprintf(fout, " // %s", g_comment);
3038 fprintf(fout, "\n");
3041 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
3043 // see is delayed flag stuff is still valid
3044 if (delayed_flag_op != NULL && delayed_flag_op != po) {
3045 if (is_any_opr_modified(delayed_flag_op, po))
3046 delayed_flag_op = NULL;
3049 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
3050 if (is_opr_modified(last_arith_dst, po))
3051 last_arith_dst = NULL;
3057 fprintf(fout, "}\n\n");
3060 for (i = 0; i < opcnt; i++) {
3061 struct label_ref *lr, *lr_del;
3063 lr = g_label_refs[i].next;
3064 while (lr != NULL) {
3069 g_label_refs[i].i = -1;
3070 g_label_refs[i].next = NULL;
3072 if (ops[i].op == OP_CALL) {
3080 proto_release(&g_func_pp);
3083 static void set_label(int i, const char *name)
3089 p = strchr(name, ':');
3093 if (len > sizeof(g_labels[0]) - 1)
3094 aerr("label '%s' too long: %d\n", name, len);
3095 if (g_labels[i][0] != 0)
3096 aerr("dupe label '%s'?\n", name);
3097 memcpy(g_labels[i], name, len);
3098 g_labels[i][len] = 0;
3101 // '=' needs special treatment..
3102 static char *next_word_s(char *w, size_t wsize, char *s)
3108 for (i = 0; i < wsize - 1; i++) {
3109 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3115 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3116 printf("warning: '%s' truncated\n", w);
3121 static int cmpstringp(const void *p1, const void *p2)
3123 return strcmp(*(char * const *)p1, *(char * const *)p2);
3126 int main(int argc, char *argv[])
3128 FILE *fout, *fasm, *frlist;
3129 struct parsed_data *pd = NULL;
3131 char **rlist = NULL;
3133 int rlist_alloc = 0;
3135 char words[16][256];
3136 enum opr_lenmod lmod;
3138 int pending_endp = 0;
3140 int skip_warned = 0;
3150 if (argv[1] && IS(argv[1], "-v")) {
3155 if (argc < arg + 3) {
3156 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
3163 asmfn = argv[arg++];
3164 fasm = fopen(asmfn, "r");
3165 my_assert_not(fasm, NULL);
3167 hdrfn = argv[arg++];
3168 g_fhdr = fopen(hdrfn, "r");
3169 my_assert_not(g_fhdr, NULL);
3172 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3173 my_assert_not(rlist, NULL);
3174 // needs special handling..
3175 rlist[rlist_len++] = "__alloca_probe";
3177 for (; arg < argc; arg++) {
3178 frlist = fopen(argv[arg], "r");
3179 my_assert_not(frlist, NULL);
3181 while (fgets(line, sizeof(line), frlist)) {
3183 if (*p == 0 || *p == ';' || *p == '#')
3186 p = next_word(words[0], sizeof(words[0]), p);
3187 if (words[0][0] == 0)
3190 if (rlist_len >= rlist_alloc) {
3191 rlist_alloc = rlist_alloc * 2 + 64;
3192 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3193 my_assert_not(rlist, NULL);
3195 rlist[rlist_len++] = strdup(words[0]);
3203 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3205 fout = fopen(argv[arg_out], "w");
3206 my_assert_not(fout, NULL);
3209 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3210 my_assert_not(g_eqs, NULL);
3212 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3213 g_label_refs[i].i = -1;
3214 g_label_refs[i].next = NULL;
3217 while (fgets(line, sizeof(line), fasm))
3227 static const char *attrs[] = {
3235 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3236 goto do_pending_endp; // eww..
3238 if (p[2] != 'A' || !IS_START(p, "; Attributes:"))
3241 // parse IDA's attribute-list comment
3242 g_ida_func_attr = 0;
3244 // get rid of random tabs
3245 for (i = 0; p[i] != 0; i++)
3249 for (; *p != 0; p = sskip(p)) {
3250 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3251 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
3252 g_ida_func_attr |= 1 << i;
3253 p += strlen(attrs[i]);
3257 if (i == ARRAY_SIZE(attrs)) {
3258 anote("unparsed IDA attr: %s\n", p);
3261 if (IS(attrs[i], "fpd=")) {
3262 p = next_word(words[0], sizeof(words[0]), p);
3270 memset(words, 0, sizeof(words));
3271 for (wordc = 0; wordc < 16; wordc++) {
3272 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3273 if (*p == 0 || *p == ';') {
3279 // alow asm patches in comments
3280 if (*p == ';' && IS_START(p, "; sctpatch:")) {
3282 if (*p == 0 || *p == ';')
3284 goto parse_words; // lame
3289 awarn("wordc == 0?\n");
3293 // don't care about this:
3294 if (words[0][0] == '.'
3295 || IS(words[0], "include")
3296 || IS(words[0], "assume") || IS(words[1], "segment")
3297 || IS(words[0], "align"))
3303 // do delayed endp processing to collect switch jumptables
3305 if (in_func && !skip_func && wordc >= 2
3306 && ((words[0][0] == 'd' && words[0][2] == 0)
3307 || (words[1][0] == 'd' && words[1][2] == 0)))
3310 if (words[1][0] == 'd' && words[1][2] == 0) {
3312 if (g_func_pd_cnt >= pd_alloc) {
3313 pd_alloc = pd_alloc * 2 + 16;
3314 g_func_pd = realloc(g_func_pd,
3315 sizeof(g_func_pd[0]) * pd_alloc);
3316 my_assert_not(g_func_pd, NULL);
3318 pd = &g_func_pd[g_func_pd_cnt];
3320 memset(pd, 0, sizeof(*pd));
3321 strcpy(pd->label, words[0]);
3322 pd->type = OPT_CONST;
3323 pd->lmod = lmod_from_directive(words[1]);
3327 lmod = lmod_from_directive(words[0]);
3328 if (lmod != pd->lmod)
3329 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3332 if (pd->count_alloc < pd->count + wordc) {
3333 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3334 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3335 my_assert_not(pd->d, NULL);
3337 for (; i < wordc; i++) {
3338 if (IS(words[i], "offset")) {
3339 pd->type = OPT_OFFSET;
3342 p = strchr(words[i], ',');
3345 if (pd->type == OPT_OFFSET)
3346 pd->d[pd->count].u.label = strdup(words[i]);
3348 pd->d[pd->count].u.val = parse_number(words[i]);
3349 pd->d[pd->count].bt_i = -1;
3355 if (in_func && !skip_func)
3356 gen_func(fout, g_fhdr, g_func, pi);
3360 g_ida_func_attr = 0;
3365 memset(&ops, 0, pi * sizeof(ops[0]));
3366 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3370 for (i = 0; i < g_func_pd_cnt; i++) {
3372 if (pd->type == OPT_OFFSET) {
3373 for (j = 0; j < pd->count; j++)
3374 free(pd->d[j].u.label);
3385 if (IS(words[1], "proc")) {
3387 aerr("proc '%s' while in_func '%s'?\n",
3390 if ((g_ida_func_attr & IDAFA_THUNK)
3391 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
3393 strcpy(g_func, words[0]);
3394 set_label(0, words[0]);
3399 if (IS(words[1], "endp")) {
3401 aerr("endp '%s' while not in_func?\n", words[0]);
3402 if (!IS(g_func, words[0]))
3403 aerr("endp '%s' while in_func '%s'?\n",
3410 p = strchr(words[0], ':');
3412 set_label(pi, words[0]);
3416 if (!in_func || skip_func) {
3417 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
3419 anote("skipping from '%s'\n", g_labels[pi]);
3422 g_labels[pi][0] = 0;
3426 if (wordc > 1 && IS(words[1], "=")) {
3428 aerr("unhandled equ, wc=%d\n", wordc);
3429 if (g_eqcnt >= eq_alloc) {
3431 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
3432 my_assert_not(g_eqs, NULL);
3435 len = strlen(words[0]);
3436 if (len > sizeof(g_eqs[0].name) - 1)
3437 aerr("equ name too long: %d\n", len);
3438 strcpy(g_eqs[g_eqcnt].name, words[0]);
3440 if (!IS(words[3], "ptr"))
3441 aerr("unhandled equ\n");
3442 if (IS(words[2], "dword"))
3443 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
3444 else if (IS(words[2], "word"))
3445 g_eqs[g_eqcnt].lmod = OPLM_WORD;
3446 else if (IS(words[2], "byte"))
3447 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
3449 aerr("bad lmod: '%s'\n", words[2]);
3451 g_eqs[g_eqcnt].offset = parse_number(words[4]);
3456 if (pi >= ARRAY_SIZE(ops))
3457 aerr("too many ops\n");
3459 parse_op(&ops[pi], words, wordc);
3470 // vim:ts=2:shiftwidth=2:expandtab