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:#%ld: '%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, long number)
241 // output in C-friendly form
242 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
245 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
249 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
251 *reg_lmod = OPLM_DWORD;
254 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
256 *reg_lmod = OPLM_WORD;
259 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
261 *reg_lmod = OPLM_BYTE;
264 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
266 *reg_lmod = OPLM_BYTE;
273 static long parse_number(const char *number)
275 int len = strlen(number);
276 const char *p = number;
286 if (len > 1 && *p == '0')
288 if (number[len - 1] == 'h') {
289 ret = strtol(p, &endp, 16);
290 bad = (*endp != 'h');
293 ret = strtol(p, &endp, 10);
297 aerr("number parsing failed\n");
303 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
305 enum opr_lenmod lmod;
318 while (my_isblank(*s))
320 for (; my_issep(*s); d++, s++)
322 while (my_isblank(*s))
327 if (IS_START(s, "ds:"))
330 s = next_idt(w, sizeof(w), s);
335 reg = parse_reg(&lmod, w);
337 *regmask |= 1 << reg;
341 if ('0' <= w[0] && w[0] <= '9') {
342 number = parse_number(w);
343 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
347 // probably some label/identifier - pass
350 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
354 strcpy(name, cvtbuf);
359 static int is_reg_in_str(const char *s)
363 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
366 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
367 if (!strncmp(s, regs_r32[i], 3))
373 static const char *parse_stack_el(const char *name, char *extra_reg)
375 const char *p, *p2, *s;
382 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
384 if (extra_reg != NULL) {
385 strncpy(extra_reg, name, 3);
390 if (IS_START(p, "ebp+")) {
394 if (p2 != NULL && is_reg_in_str(p)) {
395 if (extra_reg != NULL) {
396 strncpy(extra_reg, p, p2 - p);
397 extra_reg[p2 - p] = 0;
402 if (!('0' <= *p && *p <= '9'))
408 if (!IS_START(name, "esp+"))
411 p = strchr(name + 4, '+');
413 // must be a number after esp+, already converted to 0x..
415 if (!('0' <= *s && *s <= '9')) {
416 aerr("%s nan?\n", __func__);
419 if (s[0] == '0' && s[1] == 'x')
422 if (len < sizeof(buf) - 1) {
423 strncpy(buf, s, len);
425 val = strtol(buf, &endp, 16);
426 if (val == 0 || *endp != 0) {
427 aerr("%s num parse fail for '%s'\n", __func__, buf);
436 if ('0' <= *p && *p <= '9')
442 static int guess_lmod_from_name(struct parsed_opr *opr)
444 if (!strncmp(opr->name, "dword_", 6)) {
445 opr->lmod = OPLM_DWORD;
448 if (!strncmp(opr->name, "word_", 5)) {
449 opr->lmod = OPLM_WORD;
452 if (!strncmp(opr->name, "byte_", 5)) {
453 opr->lmod = OPLM_BYTE;
459 static int guess_lmod_from_c_type(struct parsed_opr *opr, const char *c_type)
461 static const char *ptr_types[] = {
464 static const char *dword_types[] = {
465 "int", "_DWORD", "DWORD", "HANDLE", "HWND", "HMODULE",
467 static const char *word_types[] = {
468 "__int16", "unsigned __int16",
470 static const char *byte_types[] = {
471 "char", "__int8", "unsigned __int8", "BYTE",
475 if (strchr(c_type, '*')) {
476 opr->lmod = OPLM_DWORD;
481 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
482 if (IS(c_type, dword_types[i])) {
483 opr->lmod = OPLM_DWORD;
488 for (i = 0; i < ARRAY_SIZE(ptr_types); i++) {
489 if (IS(c_type, ptr_types[i])) {
490 opr->lmod = OPLM_DWORD;
496 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
497 if (IS(c_type, word_types[i])) {
498 opr->lmod = OPLM_WORD;
503 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
504 if (IS(c_type, byte_types[i])) {
505 opr->lmod = OPLM_BYTE;
510 anote("unhandled C type '%s' for '%s'\n", c_type, opr->name);
514 static enum opr_type lmod_from_directive(const char *d)
518 else if (IS(d, "dw"))
520 else if (IS(d, "db"))
523 aerr("unhandled directive: '%s'\n", d);
527 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
533 *regmask |= 1 << reg;
536 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
539 static int parse_operand(struct parsed_opr *opr,
540 int *regmask, int *regmask_indirect,
541 char words[16][256], int wordc, int w, unsigned int op_flags)
543 struct parsed_proto pp;
544 enum opr_lenmod tmplmod;
552 aerr("parse_operand w %d, wordc %d\n", w, wordc);
556 for (i = w; i < wordc; i++) {
557 len = strlen(words[i]);
558 if (words[i][len - 1] == ',') {
559 words[i][len - 1] = 0;
565 wordc_in = wordc - w;
567 if ((op_flags & OPF_JMP) && wordc_in > 0
568 && !('0' <= words[w][0] && words[w][0] <= '9'))
570 const char *label = NULL;
572 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
573 && IS(words[w + 1], "ptr"))
574 label = words[w + 2];
575 else if (wordc_in == 2 && IS(words[w], "short"))
576 label = words[w + 1];
577 else if (wordc_in == 1
578 && strchr(words[w], '[') == NULL
579 && parse_reg(&tmplmod, words[w]) < 0)
583 opr->type = OPT_LABEL;
584 if (IS_START(label, "ds:"))
586 strcpy(opr->name, label);
592 if (IS(words[w + 1], "ptr")) {
593 if (IS(words[w], "dword"))
594 opr->lmod = OPLM_DWORD;
595 else if (IS(words[w], "word"))
596 opr->lmod = OPLM_WORD;
597 else if (IS(words[w], "byte"))
598 opr->lmod = OPLM_BYTE;
600 aerr("type parsing failed\n");
602 wordc_in = wordc - w;
607 if (IS(words[w], "offset")) {
608 opr->type = OPT_OFFSET;
609 strcpy(opr->name, words[w + 1]);
612 if (IS(words[w], "(offset")) {
613 char *p = strchr(words[w + 1], ')');
615 aerr("parse of bracketed offset failed\n");
617 opr->type = OPT_OFFSET;
618 strcpy(opr->name, words[w + 1]);
624 aerr("parse_operand 1 word expected\n");
627 if (IS_START(tmp, "ds:"))
629 strcpy(opr->name, tmp);
631 if (words[w][0] == '[') {
632 opr->type = OPT_REGMEM;
633 ret = sscanf(words[w], "[%[^]]]", opr->name);
635 aerr("[] parse failure\n");
637 parse_indmode(opr->name, regmask_indirect, 1);
638 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
640 struct parsed_equ *eq =
641 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
643 opr->lmod = eq->lmod;
647 else if (strchr(words[w], '[')) {
649 opr->type = OPT_REGMEM;
650 if (opr->lmod == OPLM_UNSPEC)
651 guess_lmod_from_name(opr);
652 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
655 else if (('0' <= words[w][0] && words[w][0] <= '9')
656 || words[w][0] == '-')
658 number = parse_number(words[w]);
659 opr->type = OPT_CONST;
661 printf_number(opr->name, sizeof(opr->name), number);
665 ret = parse_reg(&tmplmod, opr->name);
667 setup_reg_opr(opr, ret, tmplmod, regmask);
671 // most likely var in data segment
672 opr->type = OPT_LABEL;
674 ret = proto_parse(g_fhdr, opr->name, &pp);
677 opr->lmod = OPLM_DWORD;
680 else if (opr->lmod == OPLM_UNSPEC)
681 guess_lmod_from_c_type(opr, pp.ret_type);
682 opr->is_array = pp.is_array;
686 if (opr->lmod == OPLM_UNSPEC)
687 guess_lmod_from_name(opr);
691 static const struct {
696 { "repe", OPF_REP|OPF_REPZ },
697 { "repz", OPF_REP|OPF_REPZ },
698 { "repne", OPF_REP|OPF_REPNZ },
699 { "repnz", OPF_REP|OPF_REPNZ },
702 static const struct {
709 { "nop", OP_NOP, 0, 0, 0 },
710 { "push", OP_PUSH, 1, 1, 0 },
711 { "pop", OP_POP, 1, 1, OPF_DATA },
712 { "mov" , OP_MOV, 2, 2, OPF_DATA },
713 { "lea", OP_LEA, 2, 2, OPF_DATA },
714 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
715 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
716 { "not", OP_NOT, 1, 1, OPF_DATA },
717 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
718 { "stosb",OP_STOS, 0, 0, OPF_DATA },
719 { "stosw",OP_STOS, 0, 0, OPF_DATA },
720 { "stosd",OP_STOS, 0, 0, OPF_DATA },
721 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
722 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
723 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
724 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
725 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
726 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
727 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
728 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
729 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
730 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
731 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
732 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
733 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
734 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
735 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
736 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
737 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
738 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
739 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
740 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
741 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
742 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
743 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
744 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
745 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
746 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
747 { "test", OP_TEST, 2, 2, OPF_FLAGS },
748 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
749 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
750 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS },
751 { "jmp", OP_JMP, 1, 1, OPF_JMP },
752 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
753 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
754 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
755 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
756 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
757 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
758 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
759 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
760 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
761 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
762 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
763 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
764 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
765 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
766 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
767 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
768 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
769 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
770 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
771 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
772 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
773 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
774 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
775 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
776 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
777 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
778 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
779 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
780 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
781 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
782 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
783 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
784 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
785 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
786 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
787 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
788 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
789 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
790 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
791 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
792 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
793 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
794 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
795 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
796 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
797 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
798 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
799 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
800 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
801 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
802 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
803 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
804 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
805 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
806 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
807 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
808 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
811 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
813 enum opr_lenmod lmod = OPLM_UNSPEC;
814 int prefix_flags = 0;
822 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
823 if (IS(words[w], pref_table[i].name)) {
824 prefix_flags = pref_table[i].flags;
831 aerr("lone prefix: '%s'\n", words[0]);
836 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
837 if (IS(words[w], op_table[i].name))
841 if (i == ARRAY_SIZE(op_table))
842 aerr("unhandled op: '%s'\n", words[0]);
845 op->op = op_table[i].op;
846 op->flags = op_table[i].flags | prefix_flags;
847 op->regmask_src = op->regmask_dst = 0;
849 for (opr = 0; opr < op_table[i].minopr; opr++) {
850 regmask = regmask_ind = 0;
851 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
852 words, wordc, w, op->flags);
854 if (opr == 0 && (op->flags & OPF_DATA))
855 op->regmask_dst = regmask;
856 // for now, mark dst as src too
857 op->regmask_src |= regmask | regmask_ind;
860 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
861 w = parse_operand(&op->operand[opr],
862 &op->regmask_src, &op->regmask_src,
863 words, wordc, w, op->flags);
867 aerr("parse_op %s incomplete: %d/%d\n",
871 op->operand_cnt = opr;
872 if (!strncmp(op_table[i].name, "set", 3))
873 op->operand[0].lmod = OPLM_BYTE;
875 // ops with implicit argumets
879 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
880 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
884 if (op->operand_cnt != 0)
886 if (IS(words[op_w], "stosb"))
888 else if (IS(words[op_w], "stosw"))
890 else if (IS(words[op_w], "stosd"))
893 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
894 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
895 op->regmask_dst = op->regmask_src;
896 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
901 if (op->operand_cnt != 0)
903 if (words[op_w][4] == 'b')
905 else if (words[op_w][4] == 'w')
907 else if (words[op_w][4] == 'd')
910 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
911 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
912 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
913 op->regmask_dst = op->regmask_src;
917 if (op->operand_cnt != 1)
922 op->regmask_dst = (1 << xDX) | (1 << xAX);
923 op->regmask_src |= (1 << xAX);
924 if (op->operand[0].lmod == OPLM_UNSPEC)
925 op->operand[0].lmod = OPLM_DWORD;
930 // we could set up operands for edx:eax, but there is no real need to
931 // (see is_opr_modified())
932 regmask = (1 << xDX) | (1 << xAX);
933 op->regmask_dst = regmask;
934 op->regmask_src |= regmask;
935 if (op->operand[0].lmod == OPLM_UNSPEC)
936 op->operand[0].lmod = OPLM_DWORD;
944 if (op->operand[1].lmod == OPLM_UNSPEC)
945 op->operand[1].lmod = OPLM_BYTE;
949 if (op->operand[0].lmod == OPLM_UNSPEC
950 && (op->operand[0].type == OPT_CONST
951 || op->operand[0].type == OPT_OFFSET
952 || op->operand[0].type == OPT_LABEL))
953 op->operand[0].lmod = OPLM_DWORD;
961 static const char *op_name(enum op_op op)
965 for (i = 0; i < ARRAY_SIZE(op_table); i++)
966 if (op_table[i].op == op)
967 return op_table[i].name;
973 static const char *dump_op(struct parsed_op *po)
975 static char out[128];
982 snprintf(out, sizeof(out), "%s", op_name(po->op));
983 for (i = 0; i < po->operand_cnt; i++) {
987 snprintf(p, sizeof(out) - (p - out),
988 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
989 po->operand[i].name);
995 static const char *lmod_type_u(struct parsed_op *po,
996 enum opr_lenmod lmod)
1006 ferr(po, "invalid lmod: %d\n", lmod);
1007 return "(_invalid_)";
1011 static const char *lmod_cast_u(struct parsed_op *po,
1012 enum opr_lenmod lmod)
1022 ferr(po, "invalid lmod: %d\n", lmod);
1023 return "(_invalid_)";
1027 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1028 enum opr_lenmod lmod)
1038 ferr(po, "invalid lmod: %d\n", lmod);
1039 return "(_invalid_)";
1043 static const char *lmod_cast_s(struct parsed_op *po,
1044 enum opr_lenmod lmod)
1054 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1055 return "(_invalid_)";
1059 static const char *lmod_cast(struct parsed_op *po,
1060 enum opr_lenmod lmod, int is_signed)
1063 lmod_cast_s(po, lmod) :
1064 lmod_cast_u(po, lmod);
1067 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1077 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1082 static const char *opr_name(struct parsed_op *po, int opr_num)
1084 if (opr_num >= po->operand_cnt)
1085 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1086 return po->operand[opr_num].name;
1089 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1091 if (opr_num >= po->operand_cnt)
1092 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1093 if (po->operand[opr_num].type != OPT_CONST)
1094 ferr(po, "opr %d: const expected\n", opr_num);
1095 return po->operand[opr_num].val;
1098 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1100 if ((unsigned int)popr->reg >= MAX_REGS)
1101 ferr(po, "invalid reg: %d\n", popr->reg);
1102 return regs_r32[popr->reg];
1105 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1114 namelen = strlen(name);
1116 p = strchr(name, '+');
1120 ferr(po, "equ parse failed for '%s'\n", name);
1122 if (IS_START(p, "0x"))
1124 *extra_offs = strtol(p, &endp, 16);
1126 ferr(po, "equ parse failed for '%s'\n", name);
1129 for (i = 0; i < g_eqcnt; i++)
1130 if (strncmp(g_eqs[i].name, name, namelen) == 0
1131 && g_eqs[i].name[namelen] == 0)
1135 ferr(po, "unresolved equ name: '%s'\n", name);
1142 static void stack_frame_access(struct parsed_op *po,
1143 enum opr_lenmod lmod, char *buf, size_t buf_size,
1144 const char *name, int is_src, int is_lea)
1146 const char *prefix = "";
1147 char ofs_reg[16] = { 0, };
1148 struct parsed_equ *eq;
1149 int i, arg_i, arg_s;
1155 bp_arg = parse_stack_el(name, ofs_reg);
1156 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1157 eq = equ_find(po, bp_arg, &offset);
1159 ferr(po, "detected but missing eq\n");
1161 offset += eq->offset;
1163 if (!strncmp(name, "ebp", 3))
1166 if (stack_ra <= offset && offset < stack_ra + 4)
1167 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1169 if (offset > stack_ra) {
1170 arg_i = (offset - stack_ra - 4) / 4;
1171 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
1172 ferr(po, "offset %d (%s) doesn't map to any arg\n",
1174 if (ofs_reg[0] != 0)
1175 ferr(po, "offset reg on arg access?\n");
1177 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
1178 if (g_func_pp.arg[i].reg != NULL)
1184 if (i == g_func_pp.argc)
1185 ferr(po, "arg %d not in prototype?\n", arg_i);
1187 ferr(po, "lea to arg?\n");
1192 if (is_src && (offset & 3) == 0)
1193 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1195 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1200 ferr(po, "unaligned arg access\n");
1201 if (is_src && (offset & 2) == 0)
1202 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1204 snprintf(buf, buf_size, "%sWORD(a%d)",
1205 (offset & 2) ? "HI" : "LO", i + 1);
1210 ferr(po, "unaligned arg access\n");
1211 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
1215 ferr(po, "bp_arg bad lmod: %d\n", lmod);
1220 && (strstr(g_func_pp.arg[i].type, "int8")
1221 || strstr(g_func_pp.arg[i].type, "int16")))
1223 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
1224 offset, g_func_pp.arg[i].type);
1228 if (g_stack_fsz == 0)
1229 ferr(po, "stack var access without stackframe\n");
1231 sf_ofs = g_stack_fsz + offset;
1233 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1241 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1242 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1246 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1247 // known unaligned or possibly unaligned
1248 strcat(g_comment, " unaligned");
1250 prefix = "*(u16 *)&";
1251 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1252 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1255 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1259 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1260 // known unaligned or possibly unaligned
1261 strcat(g_comment, " unaligned");
1263 prefix = "*(u32 *)&";
1264 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1265 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1268 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1272 ferr(po, "bp_stack bad lmod: %d\n", lmod);
1277 static char *out_src_opr(char *buf, size_t buf_size,
1278 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
1280 char tmp1[256], tmp2[256];
1284 switch (popr->type) {
1287 ferr(po, "lea from reg?\n");
1289 switch (popr->lmod) {
1291 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1294 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1297 if (popr->name[1] == 'h') // XXX..
1298 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1300 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1303 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1308 if (parse_stack_el(popr->name, NULL)) {
1309 stack_frame_access(po, popr->lmod, buf, buf_size,
1310 popr->name, 1, is_lea);
1314 strcpy(expr, popr->name);
1315 if (strchr(expr, '[')) {
1316 // special case: '[' can only be left for label[reg] form
1317 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1319 ferr(po, "parse failure for '%s'\n", expr);
1320 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1323 // XXX: do we need more parsing?
1325 snprintf(buf, buf_size, "%s", expr);
1329 snprintf(buf, buf_size, "%s(%s)",
1330 lmod_cast_u_ptr(po, popr->lmod), expr);
1335 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1337 snprintf(buf, buf_size, "%s%s%s",
1338 popr->is_ptr ? "(u32)" : "",
1340 popr->is_array ? "[0]" : "");
1345 ferr(po, "lea an offset?\n");
1346 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1351 ferr(po, "lea from const?\n");
1353 printf_number(buf, buf_size, popr->val);
1357 ferr(po, "invalid src type: %d\n", popr->type);
1363 static char *out_dst_opr(char *buf, size_t buf_size,
1364 struct parsed_op *po, struct parsed_opr *popr)
1366 switch (popr->type) {
1368 switch (popr->lmod) {
1370 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1374 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1378 if (popr->name[1] == 'h') // XXX..
1379 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1381 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1384 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1389 if (parse_stack_el(popr->name, NULL)) {
1390 stack_frame_access(po, popr->lmod, buf, buf_size,
1395 return out_src_opr(buf, buf_size, po, popr, 0);
1398 snprintf(buf, buf_size, "%s%s", popr->name,
1399 popr->is_array ? "[0]" : "");
1403 ferr(po, "invalid dst type: %d\n", popr->type);
1409 static enum parsed_flag_op split_cond(struct parsed_op *po,
1410 enum op_op op, int *is_inv)
1462 ferr(po, "split_cond: bad op %d\n", op);
1467 static void out_test_for_cc(char *buf, size_t buf_size,
1468 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1469 enum opr_lenmod lmod, const char *expr)
1471 const char *cast, *scast;
1473 cast = lmod_cast_u(po, lmod);
1474 scast = lmod_cast_s(po, lmod);
1478 case PFO_BE: // CF=1||ZF=1; CF=0
1479 snprintf(buf, buf_size, "(%s%s %s 0)",
1480 cast, expr, is_inv ? "!=" : "==");
1484 case PFO_L: // SF!=OF; OF=0
1485 snprintf(buf, buf_size, "(%s%s %s 0)",
1486 scast, expr, is_inv ? ">=" : "<");
1489 case PFO_LE: // ZF=1||SF!=OF; OF=0
1490 snprintf(buf, buf_size, "(%s%s %s 0)",
1491 scast, expr, is_inv ? ">" : "<=");
1495 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1499 static void out_cmp_for_cc(char *buf, size_t buf_size,
1500 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1501 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1503 const char *cast, *scast;
1505 cast = lmod_cast_u(po, lmod);
1506 scast = lmod_cast_s(po, lmod);
1510 // note: must be unsigned compare
1511 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1512 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1516 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1517 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1521 // note: must be unsigned compare
1522 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1523 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1526 // note: must be signed compare
1528 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1529 scast, expr1, expr2, is_inv ? ">=" : "<");
1533 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1534 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1538 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1539 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1543 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1547 static void out_cmp_test(char *buf, size_t buf_size,
1548 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1550 char buf1[256], buf2[256], buf3[256];
1552 if (po->op == OP_TEST) {
1553 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1554 out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
1557 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1558 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
1559 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1561 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1562 po->operand[0].lmod, buf3);
1564 else if (po->op == OP_CMP) {
1565 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1566 out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
1567 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1568 po->operand[0].lmod, buf2, buf3);
1571 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1574 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1575 struct parsed_opr *popr2)
1577 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1578 ferr(po, "missing lmod for both operands\n");
1580 if (popr1->lmod == OPLM_UNSPEC)
1581 popr1->lmod = popr2->lmod;
1582 else if (popr2->lmod == OPLM_UNSPEC)
1583 popr2->lmod = popr1->lmod;
1584 else if (popr1->lmod != popr2->lmod)
1585 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1588 static const char *op_to_c(struct parsed_op *po)
1612 ferr(po, "op_to_c was supplied with %d\n", po->op);
1616 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1617 enum op_flags flag_check)
1619 if (po->flags & flag)
1620 ferr(po, "flag %x already set\n", flag);
1621 if (po->flags & flag_check)
1622 ferr(po, "flag_check %x already set\n", flag_check);
1627 static int scan_for_pop(int i, int opcnt, const char *reg,
1628 int magic, int depth, int *maxdepth, int do_flags)
1630 struct parsed_op *po;
1634 for (; i < opcnt; i++) {
1636 if (po->cc_scratch == magic)
1637 break; // already checked
1638 po->cc_scratch = magic;
1640 if (po->flags & OPF_TAIL)
1641 return -1; // deadend
1643 if ((po->flags & OPF_RMD)
1644 || (po->op == OP_PUSH && po->argmask)) // arg push
1647 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1648 if (po->btj != NULL) {
1650 for (j = 0; j < po->btj->count - 1; j++) {
1651 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1652 depth, maxdepth, do_flags);
1654 return ret; // dead end
1656 // follow last jumptable entry
1657 i = po->btj->d[j].bt_i - 1;
1662 ferr(po, "dead branch\n");
1666 if (po->flags & OPF_CC) {
1667 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1668 depth, maxdepth, do_flags);
1670 return ret; // dead end
1678 if ((po->op == OP_POP || po->op == OP_PUSH)
1679 && po->operand[0].type == OPT_REG
1680 && IS(po->operand[0].name, reg))
1682 if (po->op == OP_PUSH) {
1684 if (depth > *maxdepth)
1687 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1689 else if (depth == 0) {
1691 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1696 if (depth < 0) // should not happen
1697 ferr(po, "fail with depth\n");
1699 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1707 // scan for pop starting from 'ret' op (all paths)
1708 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1714 for (; i < opcnt; i++) {
1715 if (!(ops[i].flags & OPF_TAIL))
1718 for (j = i - 1; j >= 0; j--) {
1719 if (ops[j].flags & OPF_RMD)
1721 if (ops[j].flags & OPF_JMP)
1724 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1725 && IS(ops[j].operand[0].name, reg))
1728 ops[j].flags |= flag_set;
1732 if (g_labels[j][0] != 0)
1737 return found ? 0 : -1;
1740 // is operand 'opr modified' by parsed_op 'po'?
1741 static int is_opr_modified(const struct parsed_opr *opr,
1742 const struct parsed_op *po)
1744 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1747 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1748 if (po->regmask_dst & (1 << opr->reg))
1754 return IS(po->operand[0].name, opr->name);
1757 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1758 static int is_any_opr_modified(const struct parsed_op *po_test,
1759 const struct parsed_op *po)
1763 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1766 if (po_test->regmask_src & po->regmask_dst)
1769 for (i = 0; i < po_test->operand_cnt; i++)
1770 if (IS(po_test->operand[i].name, po->operand[0].name))
1776 // scan for any po_test operand modification in range given
1777 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1779 for (; i < opcnt; i++) {
1780 if (is_any_opr_modified(po_test, &ops[i]))
1787 // scan for po_test operand[0] modification in range given
1788 static int scan_for_mod_opr0(struct parsed_op *po_test,
1791 for (; i < opcnt; i++) {
1792 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1799 static int scan_for_flag_set(int i)
1801 for (; i >= 0; i--) {
1802 if (ops[i].flags & OPF_FLAGS)
1805 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1807 if (g_labels[i][0] != 0)
1814 // scan back for cdq, if anything modifies edx, fail
1815 static int scan_for_cdq_edx(int i)
1817 for (; i >= 0; i--) {
1818 if (ops[i].op == OP_CDQ)
1821 if (ops[i].regmask_dst & (1 << xDX))
1823 if (g_labels[i][0] != 0)
1830 static int scan_for_reg_clear(int i, int reg)
1832 for (; i >= 0; i--) {
1833 if (ops[i].op == OP_XOR
1834 && ops[i].operand[0].lmod == OPLM_DWORD
1835 && ops[i].operand[0].reg == ops[i].operand[1].reg
1836 && ops[i].operand[0].reg == reg)
1839 if (ops[i].regmask_dst & (1 << reg))
1841 if (g_labels[i][0] != 0)
1848 // scan for positive, constant esp adjust
1849 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1851 struct parsed_op *po;
1854 for (; i < opcnt; i++) {
1857 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
1858 if (po->operand[1].type != OPT_CONST)
1859 ferr(&ops[i], "non-const esp adjust?\n");
1860 *adj += po->operand[1].val;
1862 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1865 else if (po->op == OP_PUSH)
1866 *adj -= lmod_bytes(po, po->operand[0].lmod);
1867 else if (po->op == OP_POP)
1868 *adj += lmod_bytes(po, po->operand[0].lmod);
1869 else if ((po->flags & (OPF_JMP|OPF_TAIL)) && po->op != OP_CALL)
1872 if (g_labels[i][0] != 0)
1879 static void add_label_ref(struct label_ref *lr, int op_i)
1881 struct label_ref *lr_new;
1888 lr_new = calloc(1, sizeof(*lr_new));
1893 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1895 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1896 struct parsed_opr *last_arith_dst = NULL;
1897 char buf1[256], buf2[256], buf3[256];
1898 struct parsed_proto *pp, *pp_tmp;
1899 struct parsed_data *pd;
1900 const char *tmpname;
1901 enum parsed_flag_op pfo;
1902 int save_arg_vars = 0;
1903 int cmp_result_vars = 0;
1904 int need_mul_var = 0;
1906 int regmask_save = 0;
1907 int regmask_arg = 0;
1919 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
1921 ret = proto_parse(fhdr, funcn, &g_func_pp);
1923 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1925 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
1926 for (i = 0; i < g_func_pp.argc; i++) {
1928 fprintf(fout, ", ");
1929 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
1931 fprintf(fout, ")\n{\n");
1934 // - handle ebp/esp frame, remove ops related to it
1935 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1936 && ops[1].op == OP_MOV
1937 && IS(opr_name(&ops[1], 0), "ebp")
1938 && IS(opr_name(&ops[1], 1), "esp"))
1943 ops[0].flags |= OPF_RMD;
1944 ops[1].flags |= OPF_RMD;
1947 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1948 g_stack_fsz = opr_const(&ops[2], 1);
1949 ops[2].flags |= OPF_RMD;
1953 // another way msvc builds stack frame..
1955 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1957 ops[i].flags |= OPF_RMD;
1961 // and another way..
1962 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
1963 && ops[i].operand[1].type == OPT_CONST
1964 && ops[i + 1].op == OP_CALL
1965 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
1967 g_stack_fsz += ops[i].operand[1].val;
1968 ops[i].flags |= OPF_RMD;
1970 ops[i].flags |= OPF_RMD;
1977 for (; i < opcnt; i++)
1978 if (ops[i].op == OP_RET)
1980 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
1983 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1984 ferr(&ops[i - 1], "'pop ebp' expected\n");
1985 ops[i - 1].flags |= OPF_RMD;
1987 if (g_stack_fsz != 0) {
1988 if (ops[i - 2].op != OP_MOV
1989 || !IS(opr_name(&ops[i - 2], 0), "esp")
1990 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1992 ferr(&ops[i - 2], "esp restore expected\n");
1994 ops[i - 2].flags |= OPF_RMD;
1996 if (ecx_push && ops[i - 3].op == OP_POP
1997 && IS(opr_name(&ops[i - 3], 0), "ecx"))
1999 ferr(&ops[i - 3], "unexpected ecx pop\n");
2005 } while (i < opcnt);
2008 for (i = 0; i < opcnt; i++) {
2009 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2011 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2012 && ops[i].operand[1].type == OPT_CONST)
2021 g_stack_fsz = ops[i].operand[1].val;
2022 ops[i].flags |= OPF_RMD;
2026 for (; i < opcnt; i++)
2027 if (ops[i].op == OP_RET)
2029 if (ops[i - 1].op != OP_ADD
2030 || !IS(opr_name(&ops[i - 1], 0), "esp")
2031 || ops[i - 1].operand[1].type != OPT_CONST
2032 || ops[i - 1].operand[1].val != g_stack_fsz)
2033 ferr(&ops[i - 1], "'add esp' expected\n");
2034 ops[i - 1].flags |= OPF_RMD;
2037 } while (i < opcnt);
2042 // - resolve all branches
2043 for (i = 0; i < opcnt; i++) {
2048 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
2049 || po->op == OP_CALL || po->op == OP_RET)
2052 if (po->operand[0].type == OPT_REGMEM) {
2053 char *p = strchr(po->operand[0].name, '[');
2055 ferr(po, "unhandled indirect branch\n");
2056 ret = p - po->operand[0].name;
2057 strncpy(buf1, po->operand[0].name, ret);
2060 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2061 if (IS(g_func_pd[j].label, buf1)) {
2067 ferr(po, "label '%s' not parsed?\n", buf1);
2068 if (pd->type != OPT_OFFSET)
2069 ferr(po, "label '%s' with non-offset data?\n", buf1);
2071 // find all labels, link
2072 for (j = 0; j < pd->count; j++) {
2073 for (l = 0; l < opcnt; l++) {
2074 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2075 add_label_ref(&g_label_refs[l], i);
2086 for (l = 0; l < opcnt; l++) {
2087 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2088 add_label_ref(&g_label_refs[l], i);
2097 if (po->operand[0].type == OPT_LABEL) {
2100 po->flags |= OPF_TAIL;
2104 ferr(po, "unhandled branch\n");
2109 for (i = 0; i < opcnt; i++)
2112 if (po->flags & OPF_RMD)
2115 if (po->op == OP_CALL)
2117 pp = calloc(1, sizeof(*pp));
2118 my_assert_not(pp, NULL);
2119 tmpname = opr_name(po, 0);
2120 if (po->operand[0].type != OPT_LABEL)
2122 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2124 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2126 if (j > ARRAY_SIZE(pp->arg))
2127 ferr(po, "esp adjust too large?\n");
2128 pp->ret_type = strdup("int");
2129 pp->argc = pp->argc_stack = j;
2130 for (arg = 0; arg < pp->argc; arg++)
2131 pp->arg[arg].type = strdup("int");
2134 ret = proto_parse(fhdr, tmpname, pp);
2136 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2139 // look for and make use of esp adjust
2141 if (!pp->is_stdcall)
2142 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2144 if (pp->is_vararg) {
2145 if (j / 4 < pp->argc_stack)
2146 ferr(po, "esp adjust is too small: %x < %x\n",
2147 j, pp->argc_stack * 4);
2148 // modify pp to make it have varargs as normal args
2150 pp->argc += j / 4 - pp->argc_stack;
2151 for (; arg < pp->argc; arg++) {
2152 pp->arg[arg].type = strdup("int");
2155 if (pp->argc > ARRAY_SIZE(pp->arg))
2156 ferr(po, "too many args\n");
2158 if (pp->argc_stack != j / 4)
2159 ferr(po, "stack tracking failed: %x %x\n",
2160 pp->argc_stack * 4, j);
2162 ops[ret].flags |= OPF_RMD;
2163 // a bit of a hack, but deals with use of
2164 // single adj for multiple calls
2165 ops[ret].operand[1].val -= j;
2167 else if (pp->is_vararg)
2168 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2171 // can't call functions with non-__cdecl callbacks yet
2172 for (arg = 0; arg < pp->argc; arg++) {
2173 if (pp->arg[arg].fptr != NULL) {
2174 pp_tmp = pp->arg[arg].fptr;
2175 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2176 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2180 // collect all stack args
2181 for (arg = 0; arg < pp->argc; arg++)
2182 if (pp->arg[arg].reg == NULL)
2185 for (j = i; j >= 0 && arg < pp->argc; )
2187 if (g_labels[j][0] != 0) {
2188 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
2189 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
2191 // follow the branch in reverse
2192 if (g_label_refs[j].i == -1)
2193 ferr(po, "no refs for '%s'?\n", g_labels[j]);
2194 if (g_label_refs[j].next != NULL)
2195 ferr(po, "unhandled multiple refs to '%s'\n", g_labels[j]);
2196 j = g_label_refs[j].i + 1;
2203 if (ops[j].op == OP_CALL)
2205 pp_tmp = ops[j].datap;
2207 ferr(po, "arg collect hit unparsed call\n");
2208 if (pp_tmp->argc_stack > 0)
2209 ferr(po, "arg collect hit '%s' with %d stack args\n",
2210 opr_name(&ops[j], 0), pp_tmp->argc_stack);
2212 else if ((ops[j].flags & OPF_TAIL)
2213 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
2217 else if (ops[j].op == OP_PUSH)
2219 pp->arg[arg].datap = &ops[j];
2220 ret = scan_for_mod(&ops[j], j + 1, i);
2222 // mark this push as one that needs operand saving
2223 ops[j].flags &= ~OPF_RMD;
2224 ops[j].argmask |= 1 << arg;
2225 save_arg_vars |= 1 << arg;
2228 ops[j].flags |= OPF_RMD;
2231 for (arg++; arg < pp->argc; arg++)
2232 if (pp->arg[arg].reg == NULL)
2237 ferr(po, "arg collect failed for '%s': %d/%d\n",
2238 tmpname, arg, pp->argc);
2244 // - find POPs for PUSHes, rm both
2245 // - scan for all used registers
2246 // - find flag set ops for their users
2247 // - declare indirect functions
2248 for (i = 0; i < opcnt; i++) {
2250 if (po->flags & OPF_RMD)
2253 if (po->op == OP_PUSH
2254 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
2255 && po->operand[0].type == OPT_REG)
2257 reg = po->operand[0].reg;
2259 ferr(po, "reg not set for push?\n");
2262 ret = scan_for_pop(i + 1, opcnt,
2263 po->operand[0].name, i + opcnt, 0, &depth, 0);
2266 ferr(po, "too much depth: %d\n", depth);
2268 regmask_save |= 1 << reg;
2270 po->flags |= OPF_RMD;
2271 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2272 i + opcnt * 2, 0, &depth, 1);
2275 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2278 if (regmask & (1 << reg)) {
2279 if (regmask_save & (1 << reg))
2280 ferr(po, "%s already saved?\n", po->operand[0].name);
2284 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2289 regmask |= po->regmask_src | po->regmask_dst;
2291 if (po->flags & OPF_CC)
2293 ret = scan_for_flag_set(i - 1);
2295 ferr(po, "unable to trace flag setter\n");
2297 tmp_op = &ops[ret]; // flag setter
2298 pfo = split_cond(po, po->op, &dummy);
2301 // to get nicer code, we try to delay test and cmp;
2302 // if we can't because of operand modification, or if we
2303 // have math op, make it calculate flags explicitly
2304 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2305 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
2308 else if (tmp_op->op == OP_CMPS) {
2309 pfomask = 1 << PFO_Z;
2312 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2313 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
2317 tmp_op->pfomask |= pfomask;
2318 cmp_result_vars |= pfomask;
2322 if (po->op == OP_ADC || po->op == OP_SBB)
2323 cmp_result_vars |= 1 << PFO_C;
2325 else if (po->op == OP_MUL
2326 || (po->op == OP_IMUL && po->operand_cnt == 1))
2330 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2332 my_assert_not(pp, NULL);
2333 fprintf(fout, " %s (*icall%d)(", pp->ret_type, i);
2334 for (j = 0; j < pp->argc; j++) {
2336 fprintf(fout, ", ");
2337 fprintf(fout, "%s a%d", pp->arg[j].type, j + 1);
2339 fprintf(fout, ");\n");
2343 // output LUTs/jumptables
2344 for (i = 0; i < g_func_pd_cnt; i++) {
2346 fprintf(fout, " static const ");
2347 if (pd->type == OPT_OFFSET) {
2348 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2350 for (j = 0; j < pd->count; j++) {
2352 fprintf(fout, ", ");
2353 fprintf(fout, "&&%s", pd->d[j].u.label);
2357 fprintf(fout, "%s %s[] =\n { ",
2358 lmod_type_u(ops, pd->lmod), pd->label);
2360 for (j = 0; j < pd->count; j++) {
2362 fprintf(fout, ", ");
2363 fprintf(fout, "%u", pd->d[j].u.val);
2366 fprintf(fout, " };\n");
2369 // declare stack frame
2371 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2372 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2374 // declare arg-registers
2375 for (i = 0; i < g_func_pp.argc; i++) {
2376 if (g_func_pp.arg[i].reg != NULL) {
2377 reg = char_array_i(regs_r32,
2378 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
2380 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
2382 regmask_arg |= 1 << reg;
2383 fprintf(fout, " u32 %s = (u32)a%d;\n",
2384 g_func_pp.arg[i].reg, i + 1);
2389 // declare other regs - special case for eax
2390 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
2391 fprintf(fout, " u32 eax = 0;\n");
2395 regmask &= ~regmask_arg;
2396 regmask &= ~(1 << xSP);
2398 regmask &= ~(1 << xBP);
2400 for (reg = 0; reg < 8; reg++) {
2401 if (regmask & (1 << reg)) {
2402 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2409 for (reg = 0; reg < 8; reg++) {
2410 if (regmask_save & (1 << reg)) {
2411 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2417 if (save_arg_vars) {
2418 for (reg = 0; reg < 32; reg++) {
2419 if (save_arg_vars & (1 << reg)) {
2420 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2426 if (cmp_result_vars) {
2427 for (i = 0; i < 8; i++) {
2428 if (cmp_result_vars & (1 << i)) {
2429 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2436 fprintf(fout, " u64 mul_tmp;\n");
2441 fprintf(fout, "\n");
2444 for (i = 0; i < opcnt; i++)
2446 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1)
2447 fprintf(fout, "\n%s:\n", g_labels[i]);
2450 if (po->flags & OPF_RMD)
2455 #define assert_operand_cnt(n_) \
2456 if (po->operand_cnt != n_) \
2457 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2459 // conditional/flag using op?
2460 if (po->flags & OPF_CC)
2465 pfo = split_cond(po, po->op, &is_inv);
2467 // we go through all this trouble to avoid using parsed_flag_op,
2468 // which makes generated code much nicer
2469 if (delayed_flag_op != NULL)
2471 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2474 else if (last_arith_dst != NULL
2475 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2477 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
2478 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2479 last_arith_dst->lmod, buf3);
2482 else if (po->datap != NULL) {
2483 // use preprocessed flag calc results
2485 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2486 ferr(po, "not prepared for pfo %d\n", pfo);
2488 // note: is_inv was not yet applied
2489 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2490 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2493 ferr(po, "all methods of finding comparison failed\n");
2496 if (po->flags & OPF_JMP) {
2497 fprintf(fout, " if %s\n", buf1);
2499 else if (po->op == OP_ADC || po->op == OP_SBB) {
2501 fprintf(fout, " cond_%s = %s;\n",
2502 parsed_flag_op_names[pfo], buf1);
2504 else if (po->flags & OPF_DATA) { // SETcc
2505 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2506 fprintf(fout, " %s = %s;", buf2, buf1);
2509 ferr(po, "unhandled conditional op\n");
2513 pfomask = po->pfomask;
2518 assert_operand_cnt(2);
2519 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2520 fprintf(fout, " %s = %s%s;",
2521 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2522 po->operand[0].is_ptr ? "(void *)" : "",
2523 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2527 assert_operand_cnt(2);
2528 po->operand[1].lmod = OPLM_DWORD; // always
2529 fprintf(fout, " %s = %s;",
2530 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2531 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
2535 assert_operand_cnt(2);
2536 fprintf(fout, " %s = %s;",
2537 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2538 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2542 assert_operand_cnt(2);
2543 switch (po->operand[1].lmod) {
2545 strcpy(buf3, "(s8)");
2548 strcpy(buf3, "(s16)");
2551 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2553 fprintf(fout, " %s = %s%s;",
2554 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2556 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2560 assert_operand_cnt(1);
2561 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2562 fprintf(fout, " %s = ~%s;", buf1, buf1);
2566 assert_operand_cnt(2);
2567 fprintf(fout, " %s = (s32)%s >> 31;",
2568 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2569 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2570 strcpy(g_comment, "cdq");
2575 assert_operand_cnt(3);
2576 if (po->flags & OPF_REP) {
2577 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2578 lmod_bytes(po, po->operand[0].lmod));
2579 fprintf(fout, " %sedi = eax;",
2580 lmod_cast_u_ptr(po, po->operand[0].lmod));
2581 strcpy(g_comment, "rep stos");
2584 fprintf(fout, " %sedi = eax; edi += %d;",
2585 lmod_cast_u_ptr(po, po->operand[0].lmod),
2586 lmod_bytes(po, po->operand[0].lmod));
2587 strcpy(g_comment, "stos");
2593 assert_operand_cnt(3);
2594 j = lmod_bytes(po, po->operand[0].lmod);
2595 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2596 if (po->flags & OPF_REP) {
2598 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2601 " %sedi = %sesi;", buf1, buf1);
2602 strcpy(g_comment, "rep movs");
2605 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2607 strcpy(g_comment, "movs");
2613 // repe ~ repeat while ZF=1
2614 assert_operand_cnt(3);
2615 j = lmod_bytes(po, po->operand[0].lmod);
2616 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2617 if (po->flags & OPF_REP) {
2619 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2622 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
2623 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
2626 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
2627 (po->flags & OPF_REPZ) ? "e" : "ne");
2631 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
2633 strcpy(g_comment, "cmps");
2635 pfomask &= ~(1 << PFO_Z);
2636 last_arith_dst = NULL;
2637 delayed_flag_op = NULL;
2640 // arithmetic w/flags
2645 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2650 assert_operand_cnt(2);
2651 fprintf(fout, " %s %s= %s;",
2652 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2654 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2655 last_arith_dst = &po->operand[0];
2656 delayed_flag_op = NULL;
2660 assert_operand_cnt(2);
2661 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2662 fprintf(fout, " %s = %s%s >> %s;", buf1,
2663 lmod_cast_s(po, po->operand[0].lmod), buf1,
2664 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2665 last_arith_dst = &po->operand[0];
2666 delayed_flag_op = NULL;
2671 assert_operand_cnt(2);
2672 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2673 if (po->operand[1].type == OPT_CONST) {
2674 j = po->operand[1].val;
2675 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2676 fprintf(fout, po->op == OP_ROL ?
2677 " %s = (%s << %d) | (%s >> %d);" :
2678 " %s = (%s >> %d) | (%s << %d);",
2679 buf1, buf1, j, buf1,
2680 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2684 last_arith_dst = &po->operand[0];
2685 delayed_flag_op = NULL;
2689 assert_operand_cnt(2);
2690 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2691 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2692 // special case for XOR
2693 fprintf(fout, " %s = 0;",
2694 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2695 last_arith_dst = &po->operand[0];
2696 delayed_flag_op = NULL;
2703 assert_operand_cnt(2);
2704 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2705 fprintf(fout, " %s %s= %s + cond_c;",
2706 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2708 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2709 last_arith_dst = &po->operand[0];
2710 delayed_flag_op = NULL;
2715 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2716 if (po->operand[0].type == OPT_REG) {
2717 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2718 fprintf(fout, " %s%s;", buf1, buf2);
2721 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2722 fprintf(fout, " %s %s= 1;", buf1, buf2);
2724 last_arith_dst = &po->operand[0];
2725 delayed_flag_op = NULL;
2729 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2730 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
2731 fprintf(fout, " %s = -%s%s;", buf1,
2732 lmod_cast_s(po, po->operand[0].lmod), buf2);
2733 last_arith_dst = &po->operand[0];
2734 delayed_flag_op = NULL;
2735 if (pfomask & (1 << PFO_C)) {
2736 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2737 pfomask &= ~(1 << PFO_C);
2742 if (po->operand_cnt == 2)
2744 if (po->operand_cnt == 3)
2745 ferr(po, "TODO imul3\n");
2748 assert_operand_cnt(1);
2749 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2750 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
2751 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0));
2752 fprintf(fout, " edx = mul_tmp >> 32;\n");
2753 fprintf(fout, " eax = mul_tmp;");
2754 last_arith_dst = NULL;
2755 delayed_flag_op = NULL;
2760 assert_operand_cnt(1);
2761 if (po->operand[0].lmod != OPLM_DWORD)
2762 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2764 // 32bit division is common, look for it
2765 if (po->op == OP_DIV)
2766 ret = scan_for_reg_clear(i - 1, xDX);
2768 ret = scan_for_cdq_edx(i - 1);
2770 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2771 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2772 po->op == OP_IDIV));
2773 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2774 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2777 ferr(po, "TODO 64bit divident\n");
2778 last_arith_dst = NULL;
2779 delayed_flag_op = NULL;
2784 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2786 for (j = 0; j < 8; j++) {
2787 if (pfomask & (1 << j)) {
2788 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2789 fprintf(fout, " cond_%s = %s;",
2790 parsed_flag_op_names[j], buf1);
2797 last_arith_dst = NULL;
2798 delayed_flag_op = po;
2801 // note: we reuse OP_Jcc for SETcc, only flags differ
2802 case OP_JO ... OP_JG:
2803 if (po->flags & OPF_JMP)
2804 fprintf(fout, " goto %s;", po->operand[0].name);
2805 // else SETcc - should already be handled
2809 assert_operand_cnt(1);
2810 if (po->operand[0].type == OPT_REGMEM) {
2811 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
2814 ferr(po, "parse failure for jmp '%s'\n",
2815 po->operand[0].name);
2816 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
2819 else if (po->operand[0].type != OPT_LABEL)
2820 ferr(po, "unhandled jmp type\n");
2822 fprintf(fout, " goto %s;", po->operand[0].name);
2826 assert_operand_cnt(1);
2829 ferr(po, "NULL pp\n");
2831 if (po->operand[0].type != OPT_LABEL)
2832 fprintf(fout, " icall%d = (void *)%s;\n", i,
2833 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
2836 if (!IS(pp->ret_type, "void")) {
2837 if (po->flags & OPF_TAIL)
2838 fprintf(fout, "return ");
2840 fprintf(fout, "eax = ");
2841 if (strchr(pp->ret_type, '*'))
2842 fprintf(fout, "(u32)");
2845 if (po->operand[0].type != OPT_LABEL) {
2846 fprintf(fout, "icall%d(", i);
2849 if (pp->name[0] == 0)
2850 ferr(po, "missing pp->name\n");
2851 fprintf(fout, "%s(", pp->name);
2854 for (arg = 0; arg < pp->argc; arg++) {
2856 fprintf(fout, ", ");
2858 if (strchr(pp->arg[arg].type, '*'))
2859 fprintf(fout, "(%s)", pp->arg[arg].type);
2861 if (pp->arg[arg].reg != NULL) {
2862 fprintf(fout, "%s", pp->arg[arg].reg);
2867 tmp_op = pp->arg[arg].datap;
2869 ferr(po, "parsed_op missing for arg%d\n", arg);
2870 if (tmp_op->argmask) {
2871 fprintf(fout, "s_a%d", arg + 1);
2875 out_src_opr(buf1, sizeof(buf1),
2876 tmp_op, &tmp_op->operand[0], 0));
2879 fprintf(fout, ");");
2881 if (po->flags & OPF_TAIL) {
2882 strcpy(g_comment, "tailcall");
2883 if (IS(pp->ret_type, "void"))
2884 fprintf(fout, "\n return;");
2886 delayed_flag_op = NULL;
2887 last_arith_dst = NULL;
2891 if (IS(g_func_pp.ret_type, "void"))
2892 fprintf(fout, " return;");
2893 else if (strchr(g_func_pp.ret_type, '*'))
2894 fprintf(fout, " return (%s)eax;",
2895 g_func_pp.ret_type);
2897 fprintf(fout, " return eax;");
2902 // special case - saved func arg
2903 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2904 for (j = 0; j < 32; j++) {
2905 if (po->argmask & (1 << j))
2906 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
2910 else if (po->flags & OPF_RSAVE) {
2911 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2912 fprintf(fout, " s_%s = %s;", buf1, buf1);
2915 ferr(po, "stray push encountered\n");
2919 if (po->flags & OPF_RSAVE) {
2920 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2921 fprintf(fout, " %s = s_%s;", buf1, buf1);
2924 ferr(po, "stray pop encountered\n");
2932 ferr(po, "unhandled op type %d, flags %x\n",
2937 // some sanity checking
2938 if ((po->flags & OPF_REP) && po->op != OP_STOS
2939 && po->op != OP_MOVS && po->op != OP_CMPS)
2940 ferr(po, "unexpected rep\n");
2941 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
2942 ferr(po, "unexpected repz/repnz\n");
2944 if (g_comment[0] != 0) {
2945 fprintf(fout, " // %s", g_comment);
2950 fprintf(fout, "\n");
2953 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
2955 // see is delayed flag stuff is still valid
2956 if (delayed_flag_op != NULL && delayed_flag_op != po) {
2957 if (is_any_opr_modified(delayed_flag_op, po))
2958 delayed_flag_op = NULL;
2961 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
2962 if (is_opr_modified(last_arith_dst, po))
2963 last_arith_dst = NULL;
2967 fprintf(fout, "}\n\n");
2970 for (i = 0; i < opcnt; i++) {
2971 struct label_ref *lr, *lr_del;
2973 lr = g_label_refs[i].next;
2974 while (lr != NULL) {
2979 g_label_refs[i].i = -1;
2980 g_label_refs[i].next = NULL;
2982 if (ops[i].op == OP_CALL) {
2990 proto_release(&g_func_pp);
2993 static void set_label(int i, const char *name)
2999 p = strchr(name, ':');
3003 if (len > sizeof(g_labels[0]) - 1)
3004 aerr("label '%s' too long: %d\n", name, len);
3005 if (g_labels[i][0] != 0)
3006 aerr("dupe label '%s'?\n", name);
3007 memcpy(g_labels[i], name, len);
3008 g_labels[i][len] = 0;
3011 // '=' needs special treatment..
3012 static char *next_word_s(char *w, size_t wsize, char *s)
3018 for (i = 0; i < wsize - 1; i++) {
3019 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3025 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3026 printf("warning: '%s' truncated\n", w);
3031 static int cmpstringp(const void *p1, const void *p2)
3033 return strcmp(*(char * const *)p1, *(char * const *)p2);
3036 int main(int argc, char *argv[])
3038 FILE *fout, *fasm, *frlist;
3039 struct parsed_data *pd = NULL;
3041 char **rlist = NULL;
3043 int rlist_alloc = 0;
3045 char words[16][256];
3046 enum opr_lenmod lmod;
3048 int pending_endp = 0;
3050 int skip_warned = 0;
3060 if (argv[1] && IS(argv[1], "-v")) {
3065 if (argc < arg + 3) {
3066 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
3073 asmfn = argv[arg++];
3074 fasm = fopen(asmfn, "r");
3075 my_assert_not(fasm, NULL);
3077 hdrfn = argv[arg++];
3078 g_fhdr = fopen(hdrfn, "r");
3079 my_assert_not(g_fhdr, NULL);
3082 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3083 my_assert_not(rlist, NULL);
3084 // needs special handling..
3085 rlist[rlist_len++] = "__alloca_probe";
3087 for (; arg < argc; arg++) {
3088 frlist = fopen(argv[arg], "r");
3089 my_assert_not(frlist, NULL);
3091 while (fgets(line, sizeof(line), frlist)) {
3093 if (*p == 0 || *p == ';' || *p == '#')
3096 p = next_word(words[0], sizeof(words[0]), p);
3097 if (words[0][0] == 0)
3100 if (rlist_len >= rlist_alloc) {
3101 rlist_alloc = rlist_alloc * 2 + 64;
3102 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3103 my_assert_not(rlist, NULL);
3105 rlist[rlist_len++] = strdup(words[0]);
3113 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3115 fout = fopen(argv[arg_out], "w");
3116 my_assert_not(fout, NULL);
3119 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3120 my_assert_not(g_eqs, NULL);
3122 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3123 g_label_refs[i].i = -1;
3124 g_label_refs[i].next = NULL;
3127 while (fgets(line, sizeof(line), fasm))
3137 static const char *attrs[] = {
3145 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3146 goto do_pending_endp; // eww..
3148 if (p[2] != 'A' || !IS_START(p, "; Attributes:"))
3151 // parse IDA's attribute-list comment
3152 g_ida_func_attr = 0;
3154 // get rid of random tabs
3155 for (i = 0; p[i] != 0; i++)
3159 for (; *p != 0; p = sskip(p)) {
3160 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3161 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
3162 g_ida_func_attr |= 1 << i;
3163 p += strlen(attrs[i]);
3167 if (i == ARRAY_SIZE(attrs)) {
3168 anote("unparsed IDA attr: %s\n", p);
3171 if (IS(attrs[i], "fpd=")) {
3172 p = next_word(words[0], sizeof(words[0]), p);
3180 memset(words, 0, sizeof(words));
3181 for (wordc = 0; wordc < 16; wordc++) {
3182 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3183 if (*p == 0 || *p == ';') {
3189 // alow asm patches in comments
3190 if (*p == ';' && IS_START(p, "; sctpatch: ")) {
3192 if (*p == 0 || *p == ';')
3194 goto parse_words; // lame
3199 awarn("wordc == 0?\n");
3203 // don't care about this:
3204 if (words[0][0] == '.'
3205 || IS(words[0], "include")
3206 || IS(words[0], "assume") || IS(words[1], "segment")
3207 || IS(words[0], "align"))
3213 // do delayed endp processing to collect switch jumptables
3215 if (in_func && !skip_func && wordc >= 2
3216 && ((words[0][0] == 'd' && words[0][2] == 0)
3217 || (words[1][0] == 'd' && words[1][2] == 0)))
3220 if (words[1][0] == 'd' && words[1][2] == 0) {
3222 if (g_func_pd_cnt >= pd_alloc) {
3223 pd_alloc = pd_alloc * 2 + 16;
3224 g_func_pd = realloc(g_func_pd,
3225 sizeof(g_func_pd[0]) * pd_alloc);
3226 my_assert_not(g_func_pd, NULL);
3228 pd = &g_func_pd[g_func_pd_cnt];
3230 memset(pd, 0, sizeof(*pd));
3231 strcpy(pd->label, words[0]);
3232 pd->type = OPT_CONST;
3233 pd->lmod = lmod_from_directive(words[1]);
3237 lmod = lmod_from_directive(words[0]);
3238 if (lmod != pd->lmod)
3239 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3242 if (pd->count_alloc < pd->count + wordc) {
3243 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3244 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3245 my_assert_not(pd->d, NULL);
3247 for (; i < wordc; i++) {
3248 if (IS(words[i], "offset")) {
3249 pd->type = OPT_OFFSET;
3252 p = strchr(words[i], ',');
3255 if (pd->type == OPT_OFFSET)
3256 pd->d[pd->count].u.label = strdup(words[i]);
3258 pd->d[pd->count].u.val = parse_number(words[i]);
3259 pd->d[pd->count].bt_i = -1;
3265 if (in_func && !skip_func)
3266 gen_func(fout, g_fhdr, g_func, pi);
3270 g_ida_func_attr = 0;
3275 memset(&ops, 0, pi * sizeof(ops[0]));
3276 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3280 for (i = 0; i < g_func_pd_cnt; i++) {
3282 if (pd->type == OPT_OFFSET) {
3283 for (j = 0; j < pd->count; j++)
3284 free(pd->d[j].u.label);
3295 if (IS(words[1], "proc")) {
3297 aerr("proc '%s' while in_func '%s'?\n",
3300 if ((g_ida_func_attr & IDAFA_THUNK)
3301 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
3303 strcpy(g_func, words[0]);
3304 set_label(0, words[0]);
3309 if (IS(words[1], "endp")) {
3311 aerr("endp '%s' while not in_func?\n", words[0]);
3312 if (!IS(g_func, words[0]))
3313 aerr("endp '%s' while in_func '%s'?\n",
3320 p = strchr(words[0], ':');
3322 set_label(pi, words[0]);
3326 if (!in_func || skip_func) {
3327 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
3329 anote("skipping from '%s'\n", g_labels[pi]);
3332 g_labels[pi][0] = 0;
3336 if (wordc > 1 && IS(words[1], "=")) {
3338 aerr("unhandled equ, wc=%d\n", wordc);
3339 if (g_eqcnt >= eq_alloc) {
3341 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
3342 my_assert_not(g_eqs, NULL);
3345 len = strlen(words[0]);
3346 if (len > sizeof(g_eqs[0].name) - 1)
3347 aerr("equ name too long: %d\n", len);
3348 strcpy(g_eqs[g_eqcnt].name, words[0]);
3350 if (!IS(words[3], "ptr"))
3351 aerr("unhandled equ\n");
3352 if (IS(words[2], "dword"))
3353 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
3354 else if (IS(words[2], "word"))
3355 g_eqs[g_eqcnt].lmod = OPLM_WORD;
3356 else if (IS(words[2], "byte"))
3357 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
3359 aerr("bad lmod: '%s'\n", words[2]);
3361 g_eqs[g_eqcnt].offset = parse_number(words[4]);
3366 if (pi >= ARRAY_SIZE(ops))
3367 aerr("too many ops\n");
3369 parse_op(&ops[pi], words, wordc);
3380 // vim:ts=2:shiftwidth=2:expandtab