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 char ofs_reg[16] = { 0, };
1153 struct parsed_equ *eq;
1154 int i, arg_i, arg_s;
1160 bp_arg = parse_stack_el(name, ofs_reg);
1161 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1162 eq = equ_find(po, bp_arg, &offset);
1164 ferr(po, "detected but missing eq\n");
1166 offset += eq->offset;
1168 if (!strncmp(name, "ebp", 3))
1171 if (stack_ra <= offset && offset < stack_ra + 4)
1172 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1174 if (offset > stack_ra) {
1175 arg_i = (offset - stack_ra - 4) / 4;
1176 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
1177 ferr(po, "offset %d (%s) doesn't map to any arg\n",
1179 if (ofs_reg[0] != 0)
1180 ferr(po, "offset reg on arg access?\n");
1182 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
1183 if (g_func_pp.arg[i].reg != NULL)
1189 if (i == g_func_pp.argc)
1190 ferr(po, "arg %d not in prototype?\n", arg_i);
1192 ferr(po, "lea to arg?\n");
1197 if (is_src && (offset & 3) == 0)
1198 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1200 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1205 ferr(po, "unaligned arg access\n");
1206 if (is_src && (offset & 2) == 0)
1207 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1209 snprintf(buf, buf_size, "%sWORD(a%d)",
1210 (offset & 2) ? "HI" : "LO", i + 1);
1215 ferr(po, "unaligned arg access\n");
1220 snprintf(buf, buf_size, "%sa%d", prefix, i + 1);
1224 ferr(po, "bp_arg bad lmod: %d\n", lmod);
1228 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp.arg[i].type);
1229 if ((offset & 3) && tmp_lmod != OPLM_DWORD)
1230 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
1231 offset, g_func_pp.arg[i].type.name);
1234 if (g_stack_fsz == 0)
1235 ferr(po, "stack var access without stackframe\n");
1237 sf_ofs = g_stack_fsz + offset;
1239 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1249 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1250 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1254 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1255 // known unaligned or possibly unaligned
1256 strcat(g_comment, " unaligned");
1258 prefix = "*(u16 *)&";
1259 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1260 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1263 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1267 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1268 // known unaligned or possibly unaligned
1269 strcat(g_comment, " unaligned");
1271 prefix = "*(u32 *)&";
1272 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1273 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1276 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1280 ferr(po, "bp_stack bad lmod: %d\n", lmod);
1285 static void check_label_read_ref(struct parsed_op *po, const char *name)
1287 if (IS_START(name, "sub_"))
1288 ferr(po, "func reference?\n");
1291 static char *out_src_opr(char *buf, size_t buf_size,
1292 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1295 char tmp1[256], tmp2[256];
1302 switch (popr->type) {
1305 ferr(po, "lea from reg?\n");
1307 switch (popr->lmod) {
1309 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1312 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1315 if (popr->name[1] == 'h') // XXX..
1316 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1318 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1321 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1326 if (parse_stack_el(popr->name, NULL)) {
1327 stack_frame_access(po, popr->lmod, buf, buf_size,
1328 popr->name, cast, 1, is_lea);
1332 strcpy(expr, popr->name);
1333 if (strchr(expr, '[')) {
1334 // special case: '[' can only be left for label[reg] form
1335 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1337 ferr(po, "parse failure for '%s'\n", expr);
1338 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1341 // XXX: do we need more parsing?
1343 snprintf(buf, buf_size, "%s", expr);
1348 cast = lmod_cast_u_ptr(po, popr->lmod);
1349 snprintf(buf, buf_size, "%s(%s)", cast, expr);
1353 check_label_read_ref(po, popr->name);
1354 if (cast[0] == 0 && popr->is_ptr)
1357 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1359 snprintf(buf, buf_size, "%s%s%s", cast, popr->name,
1360 popr->is_array ? "[0]" : "");
1364 check_label_read_ref(po, popr->name);
1368 ferr(po, "lea an offset?\n");
1369 snprintf(buf, buf_size, "%s&%s", cast, popr->name);
1374 ferr(po, "lea from const?\n");
1376 snprintf(buf, buf_size, "%s", cast);
1378 printf_number(buf + ret, buf_size - ret, popr->val);
1382 ferr(po, "invalid src type: %d\n", popr->type);
1388 static char *out_dst_opr(char *buf, size_t buf_size,
1389 struct parsed_op *po, struct parsed_opr *popr)
1391 switch (popr->type) {
1393 switch (popr->lmod) {
1395 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1399 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1403 if (popr->name[1] == 'h') // XXX..
1404 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1406 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1409 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1414 if (parse_stack_el(popr->name, NULL)) {
1415 stack_frame_access(po, popr->lmod, buf, buf_size,
1416 popr->name, "", 0, 0);
1420 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1423 snprintf(buf, buf_size, "%s%s", popr->name,
1424 popr->is_array ? "[0]" : "");
1428 ferr(po, "invalid dst type: %d\n", popr->type);
1434 static char *out_src_opr_u32(char *buf, size_t buf_size,
1435 struct parsed_op *po, struct parsed_opr *popr)
1437 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1440 static enum parsed_flag_op split_cond(struct parsed_op *po,
1441 enum op_op op, int *is_inv)
1493 ferr(po, "split_cond: bad op %d\n", op);
1498 static void out_test_for_cc(char *buf, size_t buf_size,
1499 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1500 enum opr_lenmod lmod, const char *expr)
1502 const char *cast, *scast;
1504 cast = lmod_cast_u(po, lmod);
1505 scast = lmod_cast_s(po, lmod);
1509 case PFO_BE: // CF=1||ZF=1; CF=0
1510 snprintf(buf, buf_size, "(%s%s %s 0)",
1511 cast, expr, is_inv ? "!=" : "==");
1515 case PFO_L: // SF!=OF; OF=0
1516 snprintf(buf, buf_size, "(%s%s %s 0)",
1517 scast, expr, is_inv ? ">=" : "<");
1520 case PFO_LE: // ZF=1||SF!=OF; OF=0
1521 snprintf(buf, buf_size, "(%s%s %s 0)",
1522 scast, expr, is_inv ? ">" : "<=");
1526 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1530 static void out_cmp_for_cc(char *buf, size_t buf_size,
1531 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1532 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1534 const char *cast, *scast;
1536 cast = lmod_cast_u(po, lmod);
1537 scast = lmod_cast_s(po, lmod);
1541 // note: must be unsigned compare
1542 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1543 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1547 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1548 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1552 // note: must be unsigned compare
1553 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1554 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1557 // note: must be signed compare
1559 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1560 scast, expr1, expr2, is_inv ? ">=" : "<");
1564 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1565 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1569 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1570 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1574 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1578 static void out_cmp_test(char *buf, size_t buf_size,
1579 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1581 char buf1[256], buf2[256], buf3[256];
1583 if (po->op == OP_TEST) {
1584 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1585 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1588 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1589 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1590 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1592 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1593 po->operand[0].lmod, buf3);
1595 else if (po->op == OP_CMP) {
1596 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
1597 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[1]);
1598 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1599 po->operand[0].lmod, buf2, buf3);
1602 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1605 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1606 struct parsed_opr *popr2)
1608 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1609 ferr(po, "missing lmod for both operands\n");
1611 if (popr1->lmod == OPLM_UNSPEC)
1612 popr1->lmod = popr2->lmod;
1613 else if (popr2->lmod == OPLM_UNSPEC)
1614 popr2->lmod = popr1->lmod;
1615 else if (popr1->lmod != popr2->lmod)
1616 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1619 static const char *op_to_c(struct parsed_op *po)
1643 ferr(po, "op_to_c was supplied with %d\n", po->op);
1647 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1648 enum op_flags flag_check)
1650 if (po->flags & flag)
1651 ferr(po, "flag %x already set\n", flag);
1652 if (po->flags & flag_check)
1653 ferr(po, "flag_check %x already set\n", flag_check);
1658 static int scan_for_pop(int i, int opcnt, const char *reg,
1659 int magic, int depth, int *maxdepth, int do_flags)
1661 struct parsed_op *po;
1665 for (; i < opcnt; i++) {
1667 if (po->cc_scratch == magic)
1668 break; // already checked
1669 po->cc_scratch = magic;
1671 if (po->flags & OPF_TAIL)
1672 return -1; // deadend
1674 if ((po->flags & OPF_RMD)
1675 || (po->op == OP_PUSH && po->argmask)) // arg push
1678 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1679 if (po->btj != NULL) {
1681 for (j = 0; j < po->btj->count - 1; j++) {
1682 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1683 depth, maxdepth, do_flags);
1685 return ret; // dead end
1687 // follow last jumptable entry
1688 i = po->btj->d[j].bt_i - 1;
1693 ferr(po, "dead branch\n");
1697 if (po->flags & OPF_CC) {
1698 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1699 depth, maxdepth, do_flags);
1701 return ret; // dead end
1709 if ((po->op == OP_POP || po->op == OP_PUSH)
1710 && po->operand[0].type == OPT_REG
1711 && IS(po->operand[0].name, reg))
1713 if (po->op == OP_PUSH) {
1715 if (depth > *maxdepth)
1718 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1720 else if (depth == 0) {
1722 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1727 if (depth < 0) // should not happen
1728 ferr(po, "fail with depth\n");
1730 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1738 // scan for pop starting from 'ret' op (all paths)
1739 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1745 for (; i < opcnt; i++) {
1746 if (!(ops[i].flags & OPF_TAIL))
1749 for (j = i - 1; j >= 0; j--) {
1750 if (ops[j].flags & OPF_RMD)
1752 if (ops[j].flags & OPF_JMP)
1755 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1756 && IS(ops[j].operand[0].name, reg))
1759 ops[j].flags |= flag_set;
1763 if (g_labels[j][0] != 0)
1768 return found ? 0 : -1;
1771 // is operand 'opr modified' by parsed_op 'po'?
1772 static int is_opr_modified(const struct parsed_opr *opr,
1773 const struct parsed_op *po)
1775 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1778 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1779 if (po->regmask_dst & (1 << opr->reg))
1785 return IS(po->operand[0].name, opr->name);
1788 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1789 static int is_any_opr_modified(const struct parsed_op *po_test,
1790 const struct parsed_op *po)
1794 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1797 if (po_test->regmask_src & po->regmask_dst)
1800 for (i = 0; i < po_test->operand_cnt; i++)
1801 if (IS(po_test->operand[i].name, po->operand[0].name))
1807 // scan for any po_test operand modification in range given
1808 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1810 for (; i < opcnt; i++) {
1811 if (is_any_opr_modified(po_test, &ops[i]))
1818 // scan for po_test operand[0] modification in range given
1819 static int scan_for_mod_opr0(struct parsed_op *po_test,
1822 for (; i < opcnt; i++) {
1823 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1830 static int scan_for_flag_set(int i)
1832 for (; i >= 0; i--) {
1833 if (ops[i].flags & OPF_FLAGS)
1836 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1838 if (g_labels[i][0] != 0)
1845 // scan back for cdq, if anything modifies edx, fail
1846 static int scan_for_cdq_edx(int i)
1848 for (; i >= 0; i--) {
1849 if (ops[i].op == OP_CDQ)
1852 if (ops[i].regmask_dst & (1 << xDX))
1854 if (g_labels[i][0] != 0)
1861 static int scan_for_reg_clear(int i, int reg)
1863 for (; i >= 0; i--) {
1864 if (ops[i].op == OP_XOR
1865 && ops[i].operand[0].lmod == OPLM_DWORD
1866 && ops[i].operand[0].reg == ops[i].operand[1].reg
1867 && ops[i].operand[0].reg == reg)
1870 if (ops[i].regmask_dst & (1 << reg))
1872 if (g_labels[i][0] != 0)
1879 // scan for positive, constant esp adjust
1880 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1882 struct parsed_op *po;
1885 for (; i < opcnt; i++) {
1888 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
1889 if (po->operand[1].type != OPT_CONST)
1890 ferr(&ops[i], "non-const esp adjust?\n");
1891 *adj += po->operand[1].val;
1893 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1896 else if (po->op == OP_PUSH)
1897 *adj -= lmod_bytes(po, po->operand[0].lmod);
1898 else if (po->op == OP_POP)
1899 *adj += lmod_bytes(po, po->operand[0].lmod);
1900 else if ((po->flags & (OPF_JMP|OPF_TAIL)) && po->op != OP_CALL)
1903 if (g_labels[i][0] != 0)
1910 static void add_label_ref(struct label_ref *lr, int op_i)
1912 struct label_ref *lr_new;
1919 lr_new = calloc(1, sizeof(*lr_new));
1924 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1926 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1927 struct parsed_opr *last_arith_dst = NULL;
1928 char buf1[256], buf2[256], buf3[256], cast[64];
1929 struct parsed_proto *pp, *pp_tmp;
1930 struct parsed_data *pd;
1931 const char *tmpname;
1932 enum parsed_flag_op pfo;
1933 int save_arg_vars = 0;
1934 int cmp_result_vars = 0;
1935 int need_mul_var = 0;
1937 int label_pending = 0;
1938 int regmask_save = 0;
1939 int regmask_arg = 0;
1951 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
1953 ret = proto_parse(fhdr, funcn, &g_func_pp);
1955 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1957 fprintf(fout, "%s %s(", g_func_pp.ret_type.name, funcn);
1958 for (i = 0; i < g_func_pp.argc; i++) {
1960 fprintf(fout, ", ");
1961 fprintf(fout, "%s a%d", g_func_pp.arg[i].type.name, i + 1);
1963 fprintf(fout, ")\n{\n");
1966 // - handle ebp/esp frame, remove ops related to it
1967 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1968 && ops[1].op == OP_MOV
1969 && IS(opr_name(&ops[1], 0), "ebp")
1970 && IS(opr_name(&ops[1], 1), "esp"))
1975 ops[0].flags |= OPF_RMD;
1976 ops[1].flags |= OPF_RMD;
1979 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1980 g_stack_fsz = opr_const(&ops[2], 1);
1981 ops[2].flags |= OPF_RMD;
1985 // another way msvc builds stack frame..
1987 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1989 ops[i].flags |= OPF_RMD;
1993 // and another way..
1994 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
1995 && ops[i].operand[1].type == OPT_CONST
1996 && ops[i + 1].op == OP_CALL
1997 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
1999 g_stack_fsz += ops[i].operand[1].val;
2000 ops[i].flags |= OPF_RMD;
2002 ops[i].flags |= OPF_RMD;
2009 for (; i < opcnt; i++)
2010 if (ops[i].op == OP_RET)
2012 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
2015 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
2016 ferr(&ops[i - 1], "'pop ebp' expected\n");
2017 ops[i - 1].flags |= OPF_RMD;
2019 if (g_stack_fsz != 0) {
2020 if (ops[i - 2].op != OP_MOV
2021 || !IS(opr_name(&ops[i - 2], 0), "esp")
2022 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
2024 ferr(&ops[i - 2], "esp restore expected\n");
2026 ops[i - 2].flags |= OPF_RMD;
2028 if (ecx_push && ops[i - 3].op == OP_POP
2029 && IS(opr_name(&ops[i - 3], 0), "ecx"))
2031 ferr(&ops[i - 3], "unexpected ecx pop\n");
2037 } while (i < opcnt);
2040 for (i = 0; i < opcnt; i++) {
2041 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2043 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2044 && ops[i].operand[1].type == OPT_CONST)
2053 g_stack_fsz = ops[i].operand[1].val;
2054 ops[i].flags |= OPF_RMD;
2058 for (; i < opcnt; i++)
2059 if (ops[i].op == OP_RET)
2061 if (ops[i - 1].op != OP_ADD
2062 || !IS(opr_name(&ops[i - 1], 0), "esp")
2063 || ops[i - 1].operand[1].type != OPT_CONST
2064 || ops[i - 1].operand[1].val != g_stack_fsz)
2065 ferr(&ops[i - 1], "'add esp' expected\n");
2066 ops[i - 1].flags |= OPF_RMD;
2069 } while (i < opcnt);
2074 // - resolve all branches
2075 for (i = 0; i < opcnt; i++) {
2080 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
2081 || po->op == OP_CALL || po->op == OP_RET)
2084 if (po->operand[0].type == OPT_REGMEM) {
2085 char *p = strchr(po->operand[0].name, '[');
2087 ferr(po, "unhandled indirect branch\n");
2088 ret = p - po->operand[0].name;
2089 strncpy(buf1, po->operand[0].name, ret);
2092 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2093 if (IS(g_func_pd[j].label, buf1)) {
2099 ferr(po, "label '%s' not parsed?\n", buf1);
2100 if (pd->type != OPT_OFFSET)
2101 ferr(po, "label '%s' with non-offset data?\n", buf1);
2103 // find all labels, link
2104 for (j = 0; j < pd->count; j++) {
2105 for (l = 0; l < opcnt; l++) {
2106 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2107 add_label_ref(&g_label_refs[l], i);
2118 for (l = 0; l < opcnt; l++) {
2119 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2120 add_label_ref(&g_label_refs[l], i);
2129 if (po->operand[0].type == OPT_LABEL) {
2132 po->flags |= OPF_TAIL;
2136 ferr(po, "unhandled branch\n");
2141 for (i = 0; i < opcnt; i++)
2144 if (po->flags & OPF_RMD)
2147 if (po->op == OP_CALL)
2149 pp = calloc(1, sizeof(*pp));
2150 my_assert_not(pp, NULL);
2151 tmpname = opr_name(po, 0);
2152 if (po->operand[0].type != OPT_LABEL)
2154 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2156 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2158 if (j > ARRAY_SIZE(pp->arg))
2159 ferr(po, "esp adjust too large?\n");
2160 pp->ret_type.name = strdup("int");
2161 pp->argc = pp->argc_stack = j;
2162 for (arg = 0; arg < pp->argc; arg++)
2163 pp->arg[arg].type.name = strdup("int");
2166 ret = proto_parse(fhdr, tmpname, pp);
2168 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2171 // look for and make use of esp adjust
2173 if (!pp->is_stdcall)
2174 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2176 if (pp->is_vararg) {
2177 if (j / 4 < pp->argc_stack)
2178 ferr(po, "esp adjust is too small: %x < %x\n",
2179 j, pp->argc_stack * 4);
2180 // modify pp to make it have varargs as normal args
2182 pp->argc += j / 4 - pp->argc_stack;
2183 for (; arg < pp->argc; arg++) {
2184 pp->arg[arg].type.name = strdup("int");
2187 if (pp->argc > ARRAY_SIZE(pp->arg))
2188 ferr(po, "too many args\n");
2190 if (pp->argc_stack != j / 4)
2191 ferr(po, "stack tracking failed: %x %x\n",
2192 pp->argc_stack * 4, j);
2194 ops[ret].flags |= OPF_RMD;
2195 // a bit of a hack, but deals with use of
2196 // single adj for multiple calls
2197 ops[ret].operand[1].val -= j;
2199 else if (pp->is_vararg)
2200 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2203 // can't call functions with non-__cdecl callbacks yet
2204 for (arg = 0; arg < pp->argc; arg++) {
2205 if (pp->arg[arg].fptr != NULL) {
2206 pp_tmp = pp->arg[arg].fptr;
2207 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2208 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2212 // collect all stack args
2213 for (arg = 0; arg < pp->argc; arg++)
2214 if (pp->arg[arg].reg == NULL)
2217 for (j = i; j >= 0 && arg < pp->argc; )
2219 if (g_labels[j][0] != 0) {
2220 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
2221 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
2223 // follow the branch in reverse
2224 if (g_label_refs[j].i == -1)
2225 ferr(po, "no refs for '%s'?\n", g_labels[j]);
2226 if (g_label_refs[j].next != NULL)
2227 ferr(po, "unhandled multiple refs to '%s'\n", g_labels[j]);
2228 j = g_label_refs[j].i + 1;
2235 if (ops[j].op == OP_CALL)
2237 pp_tmp = ops[j].datap;
2239 ferr(po, "arg collect hit unparsed call\n");
2240 if (pp_tmp->argc_stack > 0)
2241 ferr(po, "arg collect hit '%s' with %d stack args\n",
2242 opr_name(&ops[j], 0), pp_tmp->argc_stack);
2244 else if ((ops[j].flags & OPF_TAIL)
2245 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
2249 else if (ops[j].op == OP_PUSH)
2251 pp->arg[arg].datap = &ops[j];
2252 ret = scan_for_mod(&ops[j], j + 1, i);
2254 // mark this push as one that needs operand saving
2255 ops[j].flags &= ~OPF_RMD;
2256 ops[j].argmask |= 1 << arg;
2257 save_arg_vars |= 1 << arg;
2260 ops[j].flags |= OPF_RMD;
2263 for (arg++; arg < pp->argc; arg++)
2264 if (pp->arg[arg].reg == NULL)
2269 ferr(po, "arg collect failed for '%s': %d/%d\n",
2270 tmpname, arg, pp->argc);
2276 // - find POPs for PUSHes, rm both
2277 // - scan for all used registers
2278 // - find flag set ops for their users
2279 // - declare indirect functions
2280 for (i = 0; i < opcnt; i++) {
2282 if (po->flags & OPF_RMD)
2285 if (po->op == OP_PUSH
2286 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
2287 && po->operand[0].type == OPT_REG)
2289 reg = po->operand[0].reg;
2291 ferr(po, "reg not set for push?\n");
2294 ret = scan_for_pop(i + 1, opcnt,
2295 po->operand[0].name, i + opcnt, 0, &depth, 0);
2298 ferr(po, "too much depth: %d\n", depth);
2300 regmask_save |= 1 << reg;
2302 po->flags |= OPF_RMD;
2303 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2304 i + opcnt * 2, 0, &depth, 1);
2307 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2310 if (regmask & (1 << reg)) {
2311 if (regmask_save & (1 << reg))
2312 ferr(po, "%s already saved?\n", po->operand[0].name);
2316 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2321 regmask |= po->regmask_src | po->regmask_dst;
2323 if (po->flags & OPF_CC)
2325 ret = scan_for_flag_set(i - 1);
2327 ferr(po, "unable to trace flag setter\n");
2329 tmp_op = &ops[ret]; // flag setter
2330 pfo = split_cond(po, po->op, &dummy);
2333 // to get nicer code, we try to delay test and cmp;
2334 // if we can't because of operand modification, or if we
2335 // have math op, make it calculate flags explicitly
2336 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2337 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
2340 else if (tmp_op->op == OP_CMPS) {
2341 pfomask = 1 << PFO_Z;
2344 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2345 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
2349 tmp_op->pfomask |= pfomask;
2350 cmp_result_vars |= pfomask;
2354 if (po->op == OP_ADC || po->op == OP_SBB)
2355 cmp_result_vars |= 1 << PFO_C;
2357 else if (po->op == OP_MUL
2358 || (po->op == OP_IMUL && po->operand_cnt == 1))
2362 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2364 my_assert_not(pp, NULL);
2365 fprintf(fout, " %s (*icall%d)(", pp->ret_type.name, i);
2366 for (j = 0; j < pp->argc; j++) {
2368 fprintf(fout, ", ");
2369 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
2371 fprintf(fout, ");\n");
2375 // output LUTs/jumptables
2376 for (i = 0; i < g_func_pd_cnt; i++) {
2378 fprintf(fout, " static const ");
2379 if (pd->type == OPT_OFFSET) {
2380 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2382 for (j = 0; j < pd->count; j++) {
2384 fprintf(fout, ", ");
2385 fprintf(fout, "&&%s", pd->d[j].u.label);
2389 fprintf(fout, "%s %s[] =\n { ",
2390 lmod_type_u(ops, pd->lmod), pd->label);
2392 for (j = 0; j < pd->count; j++) {
2394 fprintf(fout, ", ");
2395 fprintf(fout, "%u", pd->d[j].u.val);
2398 fprintf(fout, " };\n");
2401 // declare stack frame
2403 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2404 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2406 // declare arg-registers
2407 for (i = 0; i < g_func_pp.argc; i++) {
2408 if (g_func_pp.arg[i].reg != NULL) {
2409 reg = char_array_i(regs_r32,
2410 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
2412 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
2414 regmask_arg |= 1 << reg;
2415 fprintf(fout, " u32 %s = (u32)a%d;\n",
2416 g_func_pp.arg[i].reg, i + 1);
2421 // declare other regs - special case for eax
2422 if (!((regmask | regmask_arg) & 1)
2423 && !IS(g_func_pp.ret_type.name, "void"))
2425 fprintf(fout, " u32 eax = 0;\n");
2429 regmask &= ~regmask_arg;
2430 regmask &= ~(1 << xSP);
2432 regmask &= ~(1 << xBP);
2434 for (reg = 0; reg < 8; reg++) {
2435 if (regmask & (1 << reg)) {
2436 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2443 for (reg = 0; reg < 8; reg++) {
2444 if (regmask_save & (1 << reg)) {
2445 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2451 if (save_arg_vars) {
2452 for (reg = 0; reg < 32; reg++) {
2453 if (save_arg_vars & (1 << reg)) {
2454 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2460 if (cmp_result_vars) {
2461 for (i = 0; i < 8; i++) {
2462 if (cmp_result_vars & (1 << i)) {
2463 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2470 fprintf(fout, " u64 mul_tmp;\n");
2475 fprintf(fout, "\n");
2478 for (i = 0; i < opcnt; i++)
2480 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1) {
2481 fprintf(fout, "\n%s:\n", g_labels[i]);
2486 if (po->flags & OPF_RMD)
2491 #define assert_operand_cnt(n_) \
2492 if (po->operand_cnt != n_) \
2493 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2495 // conditional/flag using op?
2496 if (po->flags & OPF_CC)
2501 pfo = split_cond(po, po->op, &is_inv);
2503 // we go through all this trouble to avoid using parsed_flag_op,
2504 // which makes generated code much nicer
2505 if (delayed_flag_op != NULL)
2507 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2510 else if (last_arith_dst != NULL
2511 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2513 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
2514 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2515 last_arith_dst->lmod, buf3);
2518 else if (po->datap != NULL) {
2519 // use preprocessed flag calc results
2521 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2522 ferr(po, "not prepared for pfo %d\n", pfo);
2524 // note: is_inv was not yet applied
2525 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2526 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2529 ferr(po, "all methods of finding comparison failed\n");
2532 if (po->flags & OPF_JMP) {
2533 fprintf(fout, " if %s\n", buf1);
2535 else if (po->op == OP_ADC || po->op == OP_SBB) {
2537 fprintf(fout, " cond_%s = %s;\n",
2538 parsed_flag_op_names[pfo], buf1);
2540 else if (po->flags & OPF_DATA) { // SETcc
2541 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2542 fprintf(fout, " %s = %s;", buf2, buf1);
2545 ferr(po, "unhandled conditional op\n");
2549 pfomask = po->pfomask;
2554 assert_operand_cnt(2);
2555 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2556 fprintf(fout, " %s = %s;",
2557 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2558 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2559 po->operand[0].is_ptr ? "(void *)" : "", 0));
2563 assert_operand_cnt(2);
2564 po->operand[1].lmod = OPLM_DWORD; // always
2565 fprintf(fout, " %s = %s;",
2566 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2567 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2572 assert_operand_cnt(2);
2573 fprintf(fout, " %s = %s;",
2574 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2575 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2579 assert_operand_cnt(2);
2580 switch (po->operand[1].lmod) {
2582 strcpy(buf3, "(s8)");
2585 strcpy(buf3, "(s16)");
2588 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2590 fprintf(fout, " %s = %s%s;",
2591 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2593 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2597 assert_operand_cnt(1);
2598 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2599 fprintf(fout, " %s = ~%s;", buf1, buf1);
2603 assert_operand_cnt(2);
2604 fprintf(fout, " %s = (s32)%s >> 31;",
2605 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2606 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2607 strcpy(g_comment, "cdq");
2612 assert_operand_cnt(3);
2613 if (po->flags & OPF_REP) {
2614 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2615 lmod_bytes(po, po->operand[0].lmod));
2616 fprintf(fout, " %sedi = eax;",
2617 lmod_cast_u_ptr(po, po->operand[0].lmod));
2618 strcpy(g_comment, "rep stos");
2621 fprintf(fout, " %sedi = eax; edi += %d;",
2622 lmod_cast_u_ptr(po, po->operand[0].lmod),
2623 lmod_bytes(po, po->operand[0].lmod));
2624 strcpy(g_comment, "stos");
2630 assert_operand_cnt(3);
2631 j = lmod_bytes(po, po->operand[0].lmod);
2632 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2633 if (po->flags & OPF_REP) {
2635 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2638 " %sedi = %sesi;", buf1, buf1);
2639 strcpy(g_comment, "rep movs");
2642 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2644 strcpy(g_comment, "movs");
2650 // repe ~ repeat while ZF=1
2651 assert_operand_cnt(3);
2652 j = lmod_bytes(po, po->operand[0].lmod);
2653 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2654 if (po->flags & OPF_REP) {
2656 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2659 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
2660 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
2663 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
2664 (po->flags & OPF_REPZ) ? "e" : "ne");
2668 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
2670 strcpy(g_comment, "cmps");
2672 pfomask &= ~(1 << PFO_Z);
2673 last_arith_dst = NULL;
2674 delayed_flag_op = NULL;
2677 // arithmetic w/flags
2682 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2687 assert_operand_cnt(2);
2688 fprintf(fout, " %s %s= %s;",
2689 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2691 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2692 last_arith_dst = &po->operand[0];
2693 delayed_flag_op = NULL;
2697 assert_operand_cnt(2);
2698 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2699 fprintf(fout, " %s = %s%s >> %s;", buf1,
2700 lmod_cast_s(po, po->operand[0].lmod), buf1,
2701 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2702 last_arith_dst = &po->operand[0];
2703 delayed_flag_op = NULL;
2708 assert_operand_cnt(2);
2709 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2710 if (po->operand[1].type == OPT_CONST) {
2711 j = po->operand[1].val;
2712 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2713 fprintf(fout, po->op == OP_ROL ?
2714 " %s = (%s << %d) | (%s >> %d);" :
2715 " %s = (%s >> %d) | (%s << %d);",
2716 buf1, buf1, j, buf1,
2717 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2721 last_arith_dst = &po->operand[0];
2722 delayed_flag_op = NULL;
2726 assert_operand_cnt(2);
2727 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2728 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2729 // special case for XOR
2730 fprintf(fout, " %s = 0;",
2731 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2732 last_arith_dst = &po->operand[0];
2733 delayed_flag_op = NULL;
2740 assert_operand_cnt(2);
2741 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2742 fprintf(fout, " %s %s= %s + cond_c;",
2743 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2745 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2746 last_arith_dst = &po->operand[0];
2747 delayed_flag_op = NULL;
2752 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2753 if (po->operand[0].type == OPT_REG) {
2754 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2755 fprintf(fout, " %s%s;", buf1, buf2);
2758 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2759 fprintf(fout, " %s %s= 1;", buf1, buf2);
2761 last_arith_dst = &po->operand[0];
2762 delayed_flag_op = NULL;
2766 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2767 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
2768 fprintf(fout, " %s = -%s%s;", buf1,
2769 lmod_cast_s(po, po->operand[0].lmod), buf2);
2770 last_arith_dst = &po->operand[0];
2771 delayed_flag_op = NULL;
2772 if (pfomask & (1 << PFO_C)) {
2773 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2774 pfomask &= ~(1 << PFO_C);
2779 if (po->operand_cnt == 2)
2781 if (po->operand_cnt == 3)
2782 ferr(po, "TODO imul3\n");
2785 assert_operand_cnt(1);
2786 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2787 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
2788 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
2789 fprintf(fout, " edx = mul_tmp >> 32;\n");
2790 fprintf(fout, " eax = mul_tmp;");
2791 last_arith_dst = NULL;
2792 delayed_flag_op = NULL;
2797 assert_operand_cnt(1);
2798 if (po->operand[0].lmod != OPLM_DWORD)
2799 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2801 // 32bit division is common, look for it
2802 if (po->op == OP_DIV)
2803 ret = scan_for_reg_clear(i - 1, xDX);
2805 ret = scan_for_cdq_edx(i - 1);
2807 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2808 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2809 po->op == OP_IDIV));
2810 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2811 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2814 ferr(po, "TODO 64bit divident\n");
2815 last_arith_dst = NULL;
2816 delayed_flag_op = NULL;
2821 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2823 for (j = 0; j < 8; j++) {
2824 if (pfomask & (1 << j)) {
2825 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2826 fprintf(fout, " cond_%s = %s;",
2827 parsed_flag_op_names[j], buf1);
2834 last_arith_dst = NULL;
2835 delayed_flag_op = po;
2838 // note: we reuse OP_Jcc for SETcc, only flags differ
2839 case OP_JO ... OP_JG:
2840 if (po->flags & OPF_JMP)
2841 fprintf(fout, " goto %s;", po->operand[0].name);
2842 // else SETcc - should already be handled
2846 assert_operand_cnt(1);
2847 if (po->operand[0].type == OPT_REGMEM) {
2848 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
2851 ferr(po, "parse failure for jmp '%s'\n",
2852 po->operand[0].name);
2853 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
2856 else if (po->operand[0].type != OPT_LABEL)
2857 ferr(po, "unhandled jmp type\n");
2859 fprintf(fout, " goto %s;", po->operand[0].name);
2863 assert_operand_cnt(1);
2866 ferr(po, "NULL pp\n");
2868 if (po->operand[0].type != OPT_LABEL)
2869 fprintf(fout, " icall%d = (void *)%s;\n", i,
2870 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]));
2873 if (!IS(pp->ret_type.name, "void")) {
2874 if (po->flags & OPF_TAIL)
2875 fprintf(fout, "return ");
2877 fprintf(fout, "eax = ");
2878 if (pp->ret_type.is_ptr)
2879 fprintf(fout, "(u32)");
2882 if (po->operand[0].type != OPT_LABEL) {
2883 fprintf(fout, "icall%d(", i);
2886 if (pp->name[0] == 0)
2887 ferr(po, "missing pp->name\n");
2888 fprintf(fout, "%s(", pp->name);
2891 for (arg = 0; arg < pp->argc; arg++) {
2893 fprintf(fout, ", ");
2896 if (pp->arg[arg].type.is_ptr)
2897 snprintf(cast, sizeof(cast), "(%s)", pp->arg[arg].type.name);
2899 if (pp->arg[arg].reg != NULL) {
2900 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
2905 tmp_op = pp->arg[arg].datap;
2907 ferr(po, "parsed_op missing for arg%d\n", arg);
2908 if (tmp_op->argmask) {
2909 fprintf(fout, "%ss_a%d", cast, arg + 1);
2913 out_src_opr(buf1, sizeof(buf1),
2914 tmp_op, &tmp_op->operand[0], cast, 0));
2917 fprintf(fout, ");");
2919 if (po->flags & OPF_TAIL) {
2920 strcpy(g_comment, "tailcall");
2921 if (IS(pp->ret_type.name, "void")) {
2922 fprintf(fout, "\n return;");
2923 strcpy(g_comment, "^ tailcall");
2926 delayed_flag_op = NULL;
2927 last_arith_dst = NULL;
2931 if (IS(g_func_pp.ret_type.name, "void")) {
2932 if (i != opcnt - 1 || label_pending)
2933 fprintf(fout, " return;");
2935 else if (g_func_pp.ret_type.is_ptr) {
2936 fprintf(fout, " return (%s)eax;",
2937 g_func_pp.ret_type.name);
2940 fprintf(fout, " return eax;");
2945 // special case - saved func arg
2946 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2947 for (j = 0; j < 32; j++) {
2948 if (po->argmask & (1 << j))
2949 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
2953 else if (po->flags & OPF_RSAVE) {
2954 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2955 fprintf(fout, " s_%s = %s;", buf1, buf1);
2958 ferr(po, "stray push encountered\n");
2962 if (po->flags & OPF_RSAVE) {
2963 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2964 fprintf(fout, " %s = s_%s;", buf1, buf1);
2967 ferr(po, "stray pop encountered\n");
2975 ferr(po, "unhandled op type %d, flags %x\n",
2980 // some sanity checking
2981 if ((po->flags & OPF_REP) && po->op != OP_STOS
2982 && po->op != OP_MOVS && po->op != OP_CMPS)
2983 ferr(po, "unexpected rep\n");
2984 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
2985 ferr(po, "unexpected repz/repnz\n");
2987 if (g_comment[0] != 0) {
2988 fprintf(fout, " // %s", g_comment);
2993 fprintf(fout, "\n");
2996 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
2998 // see is delayed flag stuff is still valid
2999 if (delayed_flag_op != NULL && delayed_flag_op != po) {
3000 if (is_any_opr_modified(delayed_flag_op, po))
3001 delayed_flag_op = NULL;
3004 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
3005 if (is_opr_modified(last_arith_dst, po))
3006 last_arith_dst = NULL;
3012 fprintf(fout, "}\n\n");
3015 for (i = 0; i < opcnt; i++) {
3016 struct label_ref *lr, *lr_del;
3018 lr = g_label_refs[i].next;
3019 while (lr != NULL) {
3024 g_label_refs[i].i = -1;
3025 g_label_refs[i].next = NULL;
3027 if (ops[i].op == OP_CALL) {
3035 proto_release(&g_func_pp);
3038 static void set_label(int i, const char *name)
3044 p = strchr(name, ':');
3048 if (len > sizeof(g_labels[0]) - 1)
3049 aerr("label '%s' too long: %d\n", name, len);
3050 if (g_labels[i][0] != 0)
3051 aerr("dupe label '%s'?\n", name);
3052 memcpy(g_labels[i], name, len);
3053 g_labels[i][len] = 0;
3056 // '=' needs special treatment..
3057 static char *next_word_s(char *w, size_t wsize, char *s)
3063 for (i = 0; i < wsize - 1; i++) {
3064 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3070 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3071 printf("warning: '%s' truncated\n", w);
3076 static int cmpstringp(const void *p1, const void *p2)
3078 return strcmp(*(char * const *)p1, *(char * const *)p2);
3081 int main(int argc, char *argv[])
3083 FILE *fout, *fasm, *frlist;
3084 struct parsed_data *pd = NULL;
3086 char **rlist = NULL;
3088 int rlist_alloc = 0;
3090 char words[16][256];
3091 enum opr_lenmod lmod;
3093 int pending_endp = 0;
3095 int skip_warned = 0;
3105 if (argv[1] && IS(argv[1], "-v")) {
3110 if (argc < arg + 3) {
3111 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
3118 asmfn = argv[arg++];
3119 fasm = fopen(asmfn, "r");
3120 my_assert_not(fasm, NULL);
3122 hdrfn = argv[arg++];
3123 g_fhdr = fopen(hdrfn, "r");
3124 my_assert_not(g_fhdr, NULL);
3127 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3128 my_assert_not(rlist, NULL);
3129 // needs special handling..
3130 rlist[rlist_len++] = "__alloca_probe";
3132 for (; arg < argc; arg++) {
3133 frlist = fopen(argv[arg], "r");
3134 my_assert_not(frlist, NULL);
3136 while (fgets(line, sizeof(line), frlist)) {
3138 if (*p == 0 || *p == ';' || *p == '#')
3141 p = next_word(words[0], sizeof(words[0]), p);
3142 if (words[0][0] == 0)
3145 if (rlist_len >= rlist_alloc) {
3146 rlist_alloc = rlist_alloc * 2 + 64;
3147 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3148 my_assert_not(rlist, NULL);
3150 rlist[rlist_len++] = strdup(words[0]);
3158 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3160 fout = fopen(argv[arg_out], "w");
3161 my_assert_not(fout, NULL);
3164 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3165 my_assert_not(g_eqs, NULL);
3167 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3168 g_label_refs[i].i = -1;
3169 g_label_refs[i].next = NULL;
3172 while (fgets(line, sizeof(line), fasm))
3182 static const char *attrs[] = {
3190 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3191 goto do_pending_endp; // eww..
3193 if (p[2] != 'A' || !IS_START(p, "; Attributes:"))
3196 // parse IDA's attribute-list comment
3197 g_ida_func_attr = 0;
3199 // get rid of random tabs
3200 for (i = 0; p[i] != 0; i++)
3204 for (; *p != 0; p = sskip(p)) {
3205 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3206 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
3207 g_ida_func_attr |= 1 << i;
3208 p += strlen(attrs[i]);
3212 if (i == ARRAY_SIZE(attrs)) {
3213 anote("unparsed IDA attr: %s\n", p);
3216 if (IS(attrs[i], "fpd=")) {
3217 p = next_word(words[0], sizeof(words[0]), p);
3225 memset(words, 0, sizeof(words));
3226 for (wordc = 0; wordc < 16; wordc++) {
3227 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3228 if (*p == 0 || *p == ';') {
3234 // alow asm patches in comments
3235 if (*p == ';' && IS_START(p, "; sctpatch:")) {
3237 if (*p == 0 || *p == ';')
3239 goto parse_words; // lame
3244 awarn("wordc == 0?\n");
3248 // don't care about this:
3249 if (words[0][0] == '.'
3250 || IS(words[0], "include")
3251 || IS(words[0], "assume") || IS(words[1], "segment")
3252 || IS(words[0], "align"))
3258 // do delayed endp processing to collect switch jumptables
3260 if (in_func && !skip_func && wordc >= 2
3261 && ((words[0][0] == 'd' && words[0][2] == 0)
3262 || (words[1][0] == 'd' && words[1][2] == 0)))
3265 if (words[1][0] == 'd' && words[1][2] == 0) {
3267 if (g_func_pd_cnt >= pd_alloc) {
3268 pd_alloc = pd_alloc * 2 + 16;
3269 g_func_pd = realloc(g_func_pd,
3270 sizeof(g_func_pd[0]) * pd_alloc);
3271 my_assert_not(g_func_pd, NULL);
3273 pd = &g_func_pd[g_func_pd_cnt];
3275 memset(pd, 0, sizeof(*pd));
3276 strcpy(pd->label, words[0]);
3277 pd->type = OPT_CONST;
3278 pd->lmod = lmod_from_directive(words[1]);
3282 lmod = lmod_from_directive(words[0]);
3283 if (lmod != pd->lmod)
3284 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3287 if (pd->count_alloc < pd->count + wordc) {
3288 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3289 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3290 my_assert_not(pd->d, NULL);
3292 for (; i < wordc; i++) {
3293 if (IS(words[i], "offset")) {
3294 pd->type = OPT_OFFSET;
3297 p = strchr(words[i], ',');
3300 if (pd->type == OPT_OFFSET)
3301 pd->d[pd->count].u.label = strdup(words[i]);
3303 pd->d[pd->count].u.val = parse_number(words[i]);
3304 pd->d[pd->count].bt_i = -1;
3310 if (in_func && !skip_func)
3311 gen_func(fout, g_fhdr, g_func, pi);
3315 g_ida_func_attr = 0;
3320 memset(&ops, 0, pi * sizeof(ops[0]));
3321 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3325 for (i = 0; i < g_func_pd_cnt; i++) {
3327 if (pd->type == OPT_OFFSET) {
3328 for (j = 0; j < pd->count; j++)
3329 free(pd->d[j].u.label);
3340 if (IS(words[1], "proc")) {
3342 aerr("proc '%s' while in_func '%s'?\n",
3345 if ((g_ida_func_attr & IDAFA_THUNK)
3346 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
3348 strcpy(g_func, words[0]);
3349 set_label(0, words[0]);
3354 if (IS(words[1], "endp")) {
3356 aerr("endp '%s' while not in_func?\n", words[0]);
3357 if (!IS(g_func, words[0]))
3358 aerr("endp '%s' while in_func '%s'?\n",
3365 p = strchr(words[0], ':');
3367 set_label(pi, words[0]);
3371 if (!in_func || skip_func) {
3372 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
3374 anote("skipping from '%s'\n", g_labels[pi]);
3377 g_labels[pi][0] = 0;
3381 if (wordc > 1 && IS(words[1], "=")) {
3383 aerr("unhandled equ, wc=%d\n", wordc);
3384 if (g_eqcnt >= eq_alloc) {
3386 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
3387 my_assert_not(g_eqs, NULL);
3390 len = strlen(words[0]);
3391 if (len > sizeof(g_eqs[0].name) - 1)
3392 aerr("equ name too long: %d\n", len);
3393 strcpy(g_eqs[g_eqcnt].name, words[0]);
3395 if (!IS(words[3], "ptr"))
3396 aerr("unhandled equ\n");
3397 if (IS(words[2], "dword"))
3398 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
3399 else if (IS(words[2], "word"))
3400 g_eqs[g_eqcnt].lmod = OPLM_WORD;
3401 else if (IS(words[2], "byte"))
3402 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
3404 aerr("bad lmod: '%s'\n", words[2]);
3406 g_eqs[g_eqcnt].offset = parse_number(words[4]);
3411 if (pi >= ARRAY_SIZE(ops))
3412 aerr("too many ops\n");
3414 parse_op(&ops[pi], words, wordc);
3425 // vim:ts=2:shiftwidth=2:expandtab