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 */
40 OPF_FARG = (1 << 10), /* push collected as func arg (no reuse) */
108 // must be sorted (larger len must be further in enum)
116 #define MAX_OPERANDS 3
120 enum opr_lenmod lmod;
121 unsigned int is_ptr:1; // pointer in C
122 unsigned int is_array:1; // array in C
123 unsigned int size_mismatch:1; // type override differs from C
124 unsigned int size_lt:1; // type override is larger than C
132 struct parsed_opr operand[MAX_OPERANDS];
135 int regmask_src; // all referensed regs
137 int pfomask; // flagop: parsed_flag_op that can't be delayed
138 int argnum; // push: altered before call arg #
139 int cc_scratch; // scratch storage during analysis
140 int bt_i; // branch target for branches
141 struct parsed_data *btj;// branch targets for jumptables
146 // OP_CALL - ptr to parsed_proto
147 // (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
151 enum opr_lenmod lmod;
158 enum opr_lenmod lmod;
172 struct label_ref *next;
176 IDAFA_BP_FRAME = (1 << 0),
177 IDAFA_LIB_FUNC = (1 << 1),
178 IDAFA_STATIC = (1 << 2),
179 IDAFA_NORETURN = (1 << 3),
180 IDAFA_THUNK = (1 << 4),
181 IDAFA_FPD = (1 << 5),
186 static struct parsed_op ops[MAX_OPS];
187 static struct parsed_equ *g_eqs;
189 static char g_labels[MAX_OPS][32];
190 static struct label_ref g_label_refs[MAX_OPS];
191 static const struct parsed_proto *g_func_pp;
192 static struct parsed_data *g_func_pd;
193 static int g_func_pd_cnt;
194 static char g_func[256];
195 static char g_comment[256];
196 static int g_bp_frame;
197 static int g_sp_frame;
198 static int g_stack_fsz;
199 static int g_ida_func_attr;
200 #define ferr(op_, fmt, ...) do { \
201 printf("error:%s:#%zd: '%s': " fmt, g_func, (op_) - ops, \
202 dump_op(op_), ##__VA_ARGS__); \
206 #define fnote(op_, fmt, ...) \
207 printf("error:%s:#%zd: '%s': " fmt, g_func, (op_) - ops, \
208 dump_op(op_), ##__VA_ARGS__)
212 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
213 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
214 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
215 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
217 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
219 // possible basic comparison types (without inversion)
220 enum parsed_flag_op {
224 PFO_BE, // 6 CF=1||ZF=1
228 PFO_LE, // e ZF=1||SF!=OF
231 static const char *parsed_flag_op_names[] = {
232 "o", "c", "z", "be", "s", "p", "l", "le"
235 static int char_array_i(const char *array[], size_t len, const char *s)
239 for (i = 0; i < len; i++)
246 static void printf_number(char *buf, size_t buf_size,
247 unsigned long number)
249 // output in C-friendly form
250 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
253 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
257 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
259 *reg_lmod = OPLM_DWORD;
262 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
264 *reg_lmod = OPLM_WORD;
267 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
269 *reg_lmod = OPLM_BYTE;
272 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
274 *reg_lmod = OPLM_BYTE;
281 static unsigned long parse_number(const char *number)
283 int len = strlen(number);
284 const char *p = number;
294 if (len > 1 && *p == '0')
296 if (number[len - 1] == 'h') {
297 ret = strtoul(p, &endp, 16);
298 bad = (*endp != 'h');
301 ret = strtoul(p, &endp, 10);
305 aerr("number parsing failed\n");
311 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
313 enum opr_lenmod lmod;
326 while (my_isblank(*s))
328 for (; my_issep(*s); d++, s++)
330 while (my_isblank(*s))
335 if (IS_START(s, "ds:"))
338 s = next_idt(w, sizeof(w), s);
343 reg = parse_reg(&lmod, w);
345 *regmask |= 1 << reg;
349 if ('0' <= w[0] && w[0] <= '9') {
350 number = parse_number(w);
351 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
355 // probably some label/identifier - pass
358 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
362 strcpy(name, cvtbuf);
367 static int is_reg_in_str(const char *s)
371 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
374 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
375 if (!strncmp(s, regs_r32[i], 3))
381 static const char *parse_stack_el(const char *name, char *extra_reg)
383 const char *p, *p2, *s;
390 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
392 if (extra_reg != NULL) {
393 strncpy(extra_reg, name, 3);
398 if (IS_START(p, "ebp+")) {
402 if (p2 != NULL && is_reg_in_str(p)) {
403 if (extra_reg != NULL) {
404 strncpy(extra_reg, p, p2 - p);
405 extra_reg[p2 - p] = 0;
410 if (!('0' <= *p && *p <= '9'))
416 if (!IS_START(name, "esp+"))
419 p = strchr(name + 4, '+');
421 // must be a number after esp+, already converted to 0x..
423 if (!('0' <= *s && *s <= '9')) {
424 aerr("%s nan?\n", __func__);
427 if (s[0] == '0' && s[1] == 'x')
430 if (len < sizeof(buf) - 1) {
431 strncpy(buf, s, len);
433 val = strtol(buf, &endp, 16);
434 if (val == 0 || *endp != 0) {
435 aerr("%s num parse fail for '%s'\n", __func__, buf);
444 if ('0' <= *p && *p <= '9')
450 static int guess_lmod_from_name(struct parsed_opr *opr)
452 if (!strncmp(opr->name, "dword_", 6)) {
453 opr->lmod = OPLM_DWORD;
456 if (!strncmp(opr->name, "word_", 5)) {
457 opr->lmod = OPLM_WORD;
460 if (!strncmp(opr->name, "byte_", 5)) {
461 opr->lmod = OPLM_BYTE;
467 static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
468 const struct parsed_type *c_type)
470 static const char *dword_types[] = {
471 "int", "_DWORD", "DWORD", "HANDLE", "HWND", "HMODULE",
472 "WPARAM", "LPARAM", "UINT",
474 static const char *word_types[] = {
475 "uint16_t", "int16_t",
476 "unsigned __int16", "__int16",
478 static const char *byte_types[] = {
479 "uint8_t", "int8_t", "char",
480 "unsigned __int8", "__int8", "BYTE",
485 if (c_type->is_ptr) {
490 n = skip_type_mod(c_type->name);
492 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
493 if (IS(n, dword_types[i])) {
499 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
500 if (IS(n, word_types[i])) {
506 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
507 if (IS(n, byte_types[i])) {
516 static enum opr_type lmod_from_directive(const char *d)
520 else if (IS(d, "dw"))
522 else if (IS(d, "db"))
525 aerr("unhandled directive: '%s'\n", d);
529 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
535 *regmask |= 1 << reg;
538 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
541 static int parse_operand(struct parsed_opr *opr,
542 int *regmask, int *regmask_indirect,
543 char words[16][256], int wordc, int w, unsigned int op_flags)
545 const struct parsed_proto *pp;
546 enum opr_lenmod tmplmod;
547 unsigned long number;
554 aerr("parse_operand w %d, wordc %d\n", w, wordc);
558 for (i = w; i < wordc; i++) {
559 len = strlen(words[i]);
560 if (words[i][len - 1] == ',') {
561 words[i][len - 1] = 0;
567 wordc_in = wordc - w;
569 if ((op_flags & OPF_JMP) && wordc_in > 0
570 && !('0' <= words[w][0] && words[w][0] <= '9'))
572 const char *label = NULL;
574 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
575 && IS(words[w + 1], "ptr"))
576 label = words[w + 2];
577 else if (wordc_in == 2 && IS(words[w], "short"))
578 label = words[w + 1];
579 else if (wordc_in == 1
580 && strchr(words[w], '[') == NULL
581 && parse_reg(&tmplmod, words[w]) < 0)
585 opr->type = OPT_LABEL;
586 if (IS_START(label, "ds:"))
588 strcpy(opr->name, label);
594 if (IS(words[w + 1], "ptr")) {
595 if (IS(words[w], "dword"))
596 opr->lmod = OPLM_DWORD;
597 else if (IS(words[w], "word"))
598 opr->lmod = OPLM_WORD;
599 else if (IS(words[w], "byte"))
600 opr->lmod = OPLM_BYTE;
602 aerr("type parsing failed\n");
604 wordc_in = wordc - w;
609 if (IS(words[w], "offset")) {
610 opr->type = OPT_OFFSET;
611 strcpy(opr->name, words[w + 1]);
614 if (IS(words[w], "(offset")) {
615 char *p = strchr(words[w + 1], ')');
617 aerr("parse of bracketed offset failed\n");
619 opr->type = OPT_OFFSET;
620 strcpy(opr->name, words[w + 1]);
626 aerr("parse_operand 1 word expected\n");
629 if (IS_START(tmp, "ds:"))
631 strcpy(opr->name, tmp);
633 if (words[w][0] == '[') {
634 opr->type = OPT_REGMEM;
635 ret = sscanf(words[w], "[%[^]]]", opr->name);
637 aerr("[] parse failure\n");
639 parse_indmode(opr->name, regmask_indirect, 1);
640 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
642 struct parsed_equ *eq =
643 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
645 opr->lmod = eq->lmod;
649 else if (strchr(words[w], '[')) {
651 opr->type = OPT_REGMEM;
652 if (opr->lmod == OPLM_UNSPEC)
653 guess_lmod_from_name(opr);
654 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
657 else if (('0' <= words[w][0] && words[w][0] <= '9')
658 || words[w][0] == '-')
660 number = parse_number(words[w]);
661 opr->type = OPT_CONST;
663 printf_number(opr->name, sizeof(opr->name), number);
667 ret = parse_reg(&tmplmod, opr->name);
669 setup_reg_opr(opr, ret, tmplmod, regmask);
673 // most likely var in data segment
674 opr->type = OPT_LABEL;
676 pp = proto_parse(g_fhdr, opr->name);
679 opr->lmod = OPLM_DWORD;
683 tmplmod = OPLM_UNSPEC;
684 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
685 anote("unhandled C type '%s' for '%s'\n",
686 pp->type.name, opr->name);
688 if (opr->lmod == OPLM_UNSPEC)
690 else if (opr->lmod != tmplmod) {
691 opr->size_mismatch = 1;
692 if (tmplmod < opr->lmod)
695 opr->is_ptr = pp->type.is_ptr;
697 opr->is_array = pp->type.is_array;
700 if (opr->lmod == OPLM_UNSPEC)
701 guess_lmod_from_name(opr);
705 static const struct {
710 { "repe", OPF_REP|OPF_REPZ },
711 { "repz", OPF_REP|OPF_REPZ },
712 { "repne", OPF_REP|OPF_REPNZ },
713 { "repnz", OPF_REP|OPF_REPNZ },
716 static const struct {
723 { "nop", OP_NOP, 0, 0, 0 },
724 { "push", OP_PUSH, 1, 1, 0 },
725 { "pop", OP_POP, 1, 1, OPF_DATA },
726 { "mov" , OP_MOV, 2, 2, OPF_DATA },
727 { "lea", OP_LEA, 2, 2, OPF_DATA },
728 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
729 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
730 { "not", OP_NOT, 1, 1, OPF_DATA },
731 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
732 { "stosb",OP_STOS, 0, 0, OPF_DATA },
733 { "stosw",OP_STOS, 0, 0, OPF_DATA },
734 { "stosd",OP_STOS, 0, 0, OPF_DATA },
735 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
736 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
737 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
738 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
739 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
740 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
741 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
742 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
743 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
744 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
745 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
746 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
747 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
748 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
749 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
750 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
751 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
752 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
753 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
754 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
755 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
756 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
757 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
758 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
759 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
760 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
761 { "test", OP_TEST, 2, 2, OPF_FLAGS },
762 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
763 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
764 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
765 { "jmp", OP_JMP, 1, 1, OPF_JMP },
766 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
767 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
768 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
769 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
770 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
771 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
772 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
773 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
774 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
775 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
776 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
777 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
778 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
779 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
780 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
781 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
782 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
783 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
784 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
785 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
786 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
787 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
788 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
789 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
790 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
791 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
792 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
793 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
794 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
795 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
796 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
797 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
798 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
799 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
800 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
801 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
802 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
803 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
804 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
805 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
806 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
807 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
808 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
809 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
810 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
811 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
812 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
813 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
814 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
815 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
816 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
817 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
818 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
819 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
820 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
821 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
822 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
825 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
827 enum opr_lenmod lmod = OPLM_UNSPEC;
828 int prefix_flags = 0;
836 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
837 if (IS(words[w], pref_table[i].name)) {
838 prefix_flags = pref_table[i].flags;
845 aerr("lone prefix: '%s'\n", words[0]);
850 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
851 if (IS(words[w], op_table[i].name))
855 if (i == ARRAY_SIZE(op_table))
856 aerr("unhandled op: '%s'\n", words[0]);
859 op->op = op_table[i].op;
860 op->flags = op_table[i].flags | prefix_flags;
861 op->regmask_src = op->regmask_dst = 0;
863 for (opr = 0; opr < op_table[i].minopr; opr++) {
864 regmask = regmask_ind = 0;
865 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
866 words, wordc, w, op->flags);
868 if (opr == 0 && (op->flags & OPF_DATA))
869 op->regmask_dst = regmask;
870 // for now, mark dst as src too
871 op->regmask_src |= regmask | regmask_ind;
874 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
875 w = parse_operand(&op->operand[opr],
876 &op->regmask_src, &op->regmask_src,
877 words, wordc, w, op->flags);
881 aerr("parse_op %s incomplete: %d/%d\n",
885 op->operand_cnt = opr;
886 if (!strncmp(op_table[i].name, "set", 3))
887 op->operand[0].lmod = OPLM_BYTE;
889 // ops with implicit argumets
893 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
894 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
898 if (op->operand_cnt != 0)
900 if (IS(words[op_w], "stosb"))
902 else if (IS(words[op_w], "stosw"))
904 else if (IS(words[op_w], "stosd"))
907 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
908 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
909 op->regmask_dst = op->regmask_src;
910 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
915 if (op->operand_cnt != 0)
917 if (words[op_w][4] == 'b')
919 else if (words[op_w][4] == 'w')
921 else if (words[op_w][4] == 'd')
924 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
925 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
926 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
927 op->regmask_dst = op->regmask_src;
931 if (op->operand_cnt != 1)
936 op->regmask_dst = (1 << xDX) | (1 << xAX);
937 op->regmask_src |= (1 << xAX);
938 if (op->operand[0].lmod == OPLM_UNSPEC)
939 op->operand[0].lmod = OPLM_DWORD;
944 // we could set up operands for edx:eax, but there is no real need to
945 // (see is_opr_modified())
946 regmask = (1 << xDX) | (1 << xAX);
947 op->regmask_dst = regmask;
948 op->regmask_src |= regmask;
949 if (op->operand[0].lmod == OPLM_UNSPEC)
950 op->operand[0].lmod = OPLM_DWORD;
958 if (op->operand[1].lmod == OPLM_UNSPEC)
959 op->operand[1].lmod = OPLM_BYTE;
963 if (op->operand[0].lmod == OPLM_UNSPEC
964 && (op->operand[0].type == OPT_CONST
965 || op->operand[0].type == OPT_OFFSET
966 || op->operand[0].type == OPT_LABEL))
967 op->operand[0].lmod = OPLM_DWORD;
972 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
973 && op->operand[0].reg == xDI && op->operand[1].reg == xDI)
975 op->flags |= OPF_RMD;
980 if (op->operand[0].type == OPT_REG
981 && op->operand[1].type == OPT_REGMEM)
984 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
985 if (IS(buf, op->operand[1].name))
986 op->flags |= OPF_RMD;
995 static const char *op_name(enum op_op op)
999 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1000 if (op_table[i].op == op)
1001 return op_table[i].name;
1007 static const char *dump_op(struct parsed_op *po)
1009 static char out[128];
1016 snprintf(out, sizeof(out), "%s", op_name(po->op));
1017 for (i = 0; i < po->operand_cnt; i++) {
1021 snprintf(p, sizeof(out) - (p - out),
1022 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1023 po->operand[i].name);
1029 static const char *lmod_type_u(struct parsed_op *po,
1030 enum opr_lenmod lmod)
1040 ferr(po, "invalid lmod: %d\n", lmod);
1041 return "(_invalid_)";
1045 static const char *lmod_cast_u(struct parsed_op *po,
1046 enum opr_lenmod lmod)
1056 ferr(po, "invalid lmod: %d\n", lmod);
1057 return "(_invalid_)";
1061 static const char *lmod_cast_u_ptr(struct parsed_op *po,
1062 enum opr_lenmod lmod)
1072 ferr(po, "invalid lmod: %d\n", lmod);
1073 return "(_invalid_)";
1077 static const char *lmod_cast_s(struct parsed_op *po,
1078 enum opr_lenmod lmod)
1088 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1089 return "(_invalid_)";
1093 static const char *lmod_cast(struct parsed_op *po,
1094 enum opr_lenmod lmod, int is_signed)
1097 lmod_cast_s(po, lmod) :
1098 lmod_cast_u(po, lmod);
1101 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1111 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1116 static const char *opr_name(struct parsed_op *po, int opr_num)
1118 if (opr_num >= po->operand_cnt)
1119 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1120 return po->operand[opr_num].name;
1123 static unsigned int opr_const(struct parsed_op *po, int opr_num)
1125 if (opr_num >= po->operand_cnt)
1126 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1127 if (po->operand[opr_num].type != OPT_CONST)
1128 ferr(po, "opr %d: const expected\n", opr_num);
1129 return po->operand[opr_num].val;
1132 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1134 if ((unsigned int)popr->reg >= MAX_REGS)
1135 ferr(po, "invalid reg: %d\n", popr->reg);
1136 return regs_r32[popr->reg];
1139 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1148 namelen = strlen(name);
1150 p = strchr(name, '+');
1154 ferr(po, "equ parse failed for '%s'\n", name);
1156 if (IS_START(p, "0x"))
1158 *extra_offs = strtol(p, &endp, 16);
1160 ferr(po, "equ parse failed for '%s'\n", name);
1163 for (i = 0; i < g_eqcnt; i++)
1164 if (strncmp(g_eqs[i].name, name, namelen) == 0
1165 && g_eqs[i].name[namelen] == 0)
1169 ferr(po, "unresolved equ name: '%s'\n", name);
1176 static void stack_frame_access(struct parsed_op *po,
1177 struct parsed_opr *popr, char *buf, size_t buf_size,
1178 const char *name, const char *cast, int is_src, int is_lea)
1180 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1181 const char *prefix = "";
1182 const char *bp_arg = NULL;
1183 char ofs_reg[16] = { 0, };
1184 struct parsed_equ *eq;
1187 int i, arg_i, arg_s;
1193 if (!IS_START(name, "ebp-")) {
1194 bp_arg = parse_stack_el(name, ofs_reg);
1195 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1196 eq = equ_find(po, bp_arg, &offset);
1198 ferr(po, "detected but missing eq\n");
1199 offset += eq->offset;
1203 if (IS_START(p, "0x"))
1205 offset = -strtoul(p, &endp, 16);
1207 ferr(po, "ebp- parse of '%s' failed\n", name);
1210 if (!strncmp(name, "ebp", 3))
1213 if (stack_ra <= offset && offset < stack_ra + 4)
1214 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1216 if (offset > stack_ra)
1218 arg_i = (offset - stack_ra - 4) / 4;
1219 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1221 if (g_func_pp->is_vararg
1222 && arg_i == g_func_pp->argc_stack && is_lea)
1224 // should be va_list
1227 snprintf(buf, buf_size, "%sap", cast);
1230 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1231 offset, bp_arg, arg_i);
1233 if (ofs_reg[0] != 0)
1234 ferr(po, "offset reg on arg access?\n");
1236 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1237 if (g_func_pp->arg[i].reg != NULL)
1243 if (i == g_func_pp->argc)
1244 ferr(po, "arg %d not in prototype?\n", arg_i);
1246 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1252 ferr(po, "lea/byte to arg?\n");
1253 if (is_src && (offset & 3) == 0)
1254 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1256 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1261 ferr(po, "lea/word to arg?\n");
1263 ferr(po, "unaligned arg access\n");
1264 if (is_src && (offset & 2) == 0)
1265 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1267 snprintf(buf, buf_size, "%sWORD(a%d)",
1268 (offset & 2) ? "HI" : "LO", i + 1);
1277 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1279 snprintf(buf, buf_size, "(u32)&a%d + %d",
1282 snprintf(buf, buf_size, "%s(a%d >> %d)",
1283 prefix, i + 1, (offset & 3) * 8);
1286 snprintf(buf, buf_size, "%s%sa%d",
1287 prefix, is_lea ? "&" : "", i + 1);
1292 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1296 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1297 if ((offset & 3) && tmp_lmod != OPLM_DWORD)
1298 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
1299 offset, g_func_pp->arg[i].type.name);
1303 if (g_stack_fsz == 0)
1304 ferr(po, "stack var access without stackframe\n");
1306 sf_ofs = g_stack_fsz + offset;
1307 lim = (ofs_reg[0] != 0) ? -4 : 0;
1308 if (offset > 0 || sf_ofs < lim)
1309 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1319 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1320 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1324 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1325 // known unaligned or possibly unaligned
1326 strcat(g_comment, " unaligned");
1328 prefix = "*(u16 *)&";
1329 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1330 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1333 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1337 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1338 // known unaligned or possibly unaligned
1339 strcat(g_comment, " unaligned");
1341 prefix = "*(u32 *)&";
1342 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1343 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1346 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1350 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1355 static void check_label_read_ref(struct parsed_op *po, const char *name)
1357 const struct parsed_proto *pp;
1359 pp = proto_parse(g_fhdr, name);
1361 ferr(po, "proto_parse failed for ref '%s'\n", name);
1363 // currently we can take __cdecl and __stdcall
1364 if (pp->is_func && pp->argc_reg != 0)
1365 ferr(po, "reg-arg func reference?\n");
1368 static char *out_src_opr(char *buf, size_t buf_size,
1369 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1372 char tmp1[256], tmp2[256];
1379 switch (popr->type) {
1382 ferr(po, "lea from reg?\n");
1384 switch (popr->lmod) {
1386 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1389 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1392 if (popr->name[1] == 'h') // XXX..
1393 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1395 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1398 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1403 if (parse_stack_el(popr->name, NULL)
1404 || (g_bp_frame && IS_START(popr->name, "ebp-")))
1406 stack_frame_access(po, popr, buf, buf_size,
1407 popr->name, cast, 1, is_lea);
1411 strcpy(expr, popr->name);
1412 if (strchr(expr, '[')) {
1413 // special case: '[' can only be left for label[reg] form
1414 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1416 ferr(po, "parse failure for '%s'\n", expr);
1417 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1420 // XXX: do we need more parsing?
1422 snprintf(buf, buf_size, "%s", expr);
1427 cast = lmod_cast_u_ptr(po, popr->lmod);
1428 snprintf(buf, buf_size, "%s(%s)", cast, expr);
1432 check_label_read_ref(po, popr->name);
1433 if (cast[0] == 0 && popr->is_ptr)
1437 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1438 else if (popr->size_lt)
1439 snprintf(buf, buf_size, "%s%s%s%s", cast,
1440 lmod_cast_u_ptr(po, popr->lmod),
1441 popr->is_array ? "" : "&",
1444 snprintf(buf, buf_size, "%s%s%s", cast, popr->name,
1445 popr->is_array ? "[0]" : "");
1449 check_label_read_ref(po, popr->name);
1453 ferr(po, "lea an offset?\n");
1454 snprintf(buf, buf_size, "%s&%s", cast, popr->name);
1459 ferr(po, "lea from const?\n");
1461 snprintf(buf, buf_size, "%s", cast);
1463 printf_number(buf + ret, buf_size - ret, popr->val);
1467 ferr(po, "invalid src type: %d\n", popr->type);
1473 // note: may set is_ptr (we find that out late for ebp frame..)
1474 static char *out_dst_opr(char *buf, size_t buf_size,
1475 struct parsed_op *po, struct parsed_opr *popr)
1477 switch (popr->type) {
1479 switch (popr->lmod) {
1481 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1485 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1489 if (popr->name[1] == 'h') // XXX..
1490 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1492 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1495 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1500 if (parse_stack_el(popr->name, NULL)
1501 || (g_bp_frame && IS_START(popr->name, "ebp-")))
1503 stack_frame_access(po, popr, buf, buf_size,
1504 popr->name, "", 0, 0);
1508 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1511 if (popr->size_mismatch)
1512 snprintf(buf, buf_size, "%s%s%s",
1513 lmod_cast_u_ptr(po, popr->lmod),
1514 popr->is_array ? "" : "&", popr->name);
1516 snprintf(buf, buf_size, "%s%s", popr->name,
1517 popr->is_array ? "[0]" : "");
1521 ferr(po, "invalid dst type: %d\n", popr->type);
1527 static char *out_src_opr_u32(char *buf, size_t buf_size,
1528 struct parsed_op *po, struct parsed_opr *popr)
1530 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1533 static enum parsed_flag_op split_cond(struct parsed_op *po,
1534 enum op_op op, int *is_inv)
1586 ferr(po, "split_cond: bad op %d\n", op);
1591 static void out_test_for_cc(char *buf, size_t buf_size,
1592 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1593 enum opr_lenmod lmod, const char *expr)
1595 const char *cast, *scast;
1597 cast = lmod_cast_u(po, lmod);
1598 scast = lmod_cast_s(po, lmod);
1602 case PFO_BE: // CF=1||ZF=1; CF=0
1603 snprintf(buf, buf_size, "(%s%s %s 0)",
1604 cast, expr, is_inv ? "!=" : "==");
1608 case PFO_L: // SF!=OF; OF=0
1609 snprintf(buf, buf_size, "(%s%s %s 0)",
1610 scast, expr, is_inv ? ">=" : "<");
1613 case PFO_LE: // ZF=1||SF!=OF; OF=0
1614 snprintf(buf, buf_size, "(%s%s %s 0)",
1615 scast, expr, is_inv ? ">" : "<=");
1619 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1623 static void out_cmp_for_cc(char *buf, size_t buf_size,
1624 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1625 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1627 const char *cast, *scast;
1629 cast = lmod_cast_u(po, lmod);
1630 scast = lmod_cast_s(po, lmod);
1634 // note: must be unsigned compare
1635 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1636 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1640 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1641 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1645 // note: must be unsigned compare
1646 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1647 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1650 // note: must be signed compare
1652 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1653 scast, expr1, expr2, is_inv ? ">=" : "<");
1657 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1658 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1662 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1663 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1667 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1671 static void out_cmp_test(char *buf, size_t buf_size,
1672 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1674 char buf1[256], buf2[256], buf3[256];
1676 if (po->op == OP_TEST) {
1677 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1678 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1681 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1682 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1683 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1685 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1686 po->operand[0].lmod, buf3);
1688 else if (po->op == OP_CMP) {
1689 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
1690 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[1]);
1691 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1692 po->operand[0].lmod, buf2, buf3);
1695 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1698 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1699 struct parsed_opr *popr2)
1701 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1702 ferr(po, "missing lmod for both operands\n");
1704 if (popr1->lmod == OPLM_UNSPEC)
1705 popr1->lmod = popr2->lmod;
1706 else if (popr2->lmod == OPLM_UNSPEC)
1707 popr2->lmod = popr1->lmod;
1708 else if (popr1->lmod != popr2->lmod)
1709 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1712 static const char *op_to_c(struct parsed_op *po)
1736 ferr(po, "op_to_c was supplied with %d\n", po->op);
1740 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1741 enum op_flags flag_check)
1743 if (po->flags & flag)
1744 ferr(po, "flag %x already set\n", flag);
1745 if (po->flags & flag_check)
1746 ferr(po, "flag_check %x already set\n", flag_check);
1751 // last op in stream - unconditional branch or ret
1752 #define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
1753 || (ops[_i].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
1755 static int scan_for_pop(int i, int opcnt, const char *reg,
1756 int magic, int depth, int *maxdepth, int do_flags)
1758 struct parsed_op *po;
1762 for (; i < opcnt; i++) {
1764 if (po->cc_scratch == magic)
1765 break; // already checked
1766 po->cc_scratch = magic;
1768 if (po->flags & OPF_TAIL)
1769 return -1; // deadend
1771 if ((po->flags & OPF_RMD)
1772 || (po->op == OP_PUSH && po->argnum != 0)) // arg push
1775 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1776 if (po->btj != NULL) {
1778 for (j = 0; j < po->btj->count - 1; j++) {
1779 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1780 depth, maxdepth, do_flags);
1782 return ret; // dead end
1784 // follow last jumptable entry
1785 i = po->btj->d[j].bt_i - 1;
1790 ferr(po, "dead branch\n");
1794 if (po->flags & OPF_CC) {
1795 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1796 depth, maxdepth, do_flags);
1798 return ret; // dead end
1806 if ((po->op == OP_POP || po->op == OP_PUSH)
1807 && po->operand[0].type == OPT_REG
1808 && IS(po->operand[0].name, reg))
1810 if (po->op == OP_PUSH) {
1812 if (depth > *maxdepth)
1815 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1817 else if (depth == 0) {
1819 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1824 if (depth < 0) // should not happen
1825 ferr(po, "fail with depth\n");
1827 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1835 // scan for pop starting from 'ret' op (all paths)
1836 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1842 for (; i < opcnt; i++) {
1843 if (!(ops[i].flags & OPF_TAIL))
1846 for (j = i - 1; j >= 0; j--) {
1847 if (ops[j].flags & OPF_RMD)
1849 if (ops[j].flags & OPF_JMP)
1852 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1853 && IS(ops[j].operand[0].name, reg))
1856 ops[j].flags |= flag_set;
1860 if (g_labels[j][0] != 0)
1865 return found ? 0 : -1;
1868 // is operand 'opr modified' by parsed_op 'po'?
1869 static int is_opr_modified(const struct parsed_opr *opr,
1870 const struct parsed_op *po)
1872 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1875 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1876 if (po->regmask_dst & (1 << opr->reg))
1882 return IS(po->operand[0].name, opr->name);
1885 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1886 static int is_any_opr_modified(const struct parsed_op *po_test,
1887 const struct parsed_op *po)
1891 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1894 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
1897 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
1900 // in reality, it can wreck any register, but in decompiled C
1901 // version it can only overwrite eax or edx:eax
1902 if (po->op == OP_CALL
1903 && ((po_test->regmask_src | po_test->regmask_dst)
1904 & ((1 << xAX)|(1 << xDX))))
1907 for (i = 0; i < po_test->operand_cnt; i++)
1908 if (IS(po_test->operand[i].name, po->operand[0].name))
1914 // scan for any po_test operand modification in range given
1915 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1917 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
1920 for (; i < opcnt; i++) {
1921 if (is_any_opr_modified(po_test, &ops[i]))
1928 // scan for po_test operand[0] modification in range given
1929 static int scan_for_mod_opr0(struct parsed_op *po_test,
1932 for (; i < opcnt; i++) {
1933 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1940 static int scan_for_flag_set(int i, int *branched, int *setters,
1946 if (g_labels[i][0] != 0) {
1948 if (g_label_refs[i].next != NULL)
1950 if (i > 0 && LAST_OP(i - 1)) {
1951 i = g_label_refs[i].i;
1954 ret = scan_for_flag_set(g_label_refs[i].i, branched,
1955 setters, setter_cnt);
1961 if (ops[i].flags & OPF_FLAGS) {
1962 setters[*setter_cnt] = i;
1967 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1974 // scan back for cdq, if anything modifies edx, fail
1975 static int scan_for_cdq_edx(int i)
1977 for (; i >= 0; i--) {
1978 if (ops[i].op == OP_CDQ)
1981 if (ops[i].regmask_dst & (1 << xDX))
1983 if (g_labels[i][0] != 0)
1990 static int scan_for_reg_clear(int i, int reg)
1992 for (; i >= 0; i--) {
1993 if (ops[i].op == OP_XOR
1994 && ops[i].operand[0].lmod == OPLM_DWORD
1995 && ops[i].operand[0].reg == ops[i].operand[1].reg
1996 && ops[i].operand[0].reg == reg)
1999 if (ops[i].regmask_dst & (1 << reg))
2001 if (g_labels[i][0] != 0)
2008 // scan for positive, constant esp adjust
2009 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
2011 struct parsed_op *po;
2014 for (; i < opcnt; i++) {
2017 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2018 if (po->operand[1].type != OPT_CONST)
2019 ferr(&ops[i], "non-const esp adjust?\n");
2020 *adj += po->operand[1].val;
2022 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2025 else if (po->op == OP_PUSH)
2026 *adj -= lmod_bytes(po, po->operand[0].lmod);
2027 else if (po->op == OP_POP)
2028 *adj += lmod_bytes(po, po->operand[0].lmod);
2029 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2030 if (po->op != OP_CALL)
2032 if (po->operand[0].type != OPT_LABEL)
2034 // TODO: should only allow combining __cdecl calls..
2037 if (g_labels[i][0] != 0)
2044 static int collect_call_args(struct parsed_op *po, int i,
2045 struct parsed_proto *pp, int *save_arg_vars, int arg,
2046 int need_op_saving, int may_reuse)
2048 struct parsed_proto *pp_tmp;
2049 struct label_ref *lr;
2050 int need_to_save_current;
2055 ferr(po, "no refs for '%s'?\n", g_labels[i]);
2057 for (; arg < pp->argc; arg++)
2058 if (pp->arg[arg].reg == NULL)
2061 for (j = i; j >= 0 && arg < pp->argc; )
2063 if (g_labels[j][0] != 0) {
2064 lr = &g_label_refs[j];
2065 if (lr->next != NULL)
2067 for (; lr->next; lr = lr->next) {
2068 if ((ops[lr->i].flags & (OPF_JMP|OPF_CC)) != OPF_JMP)
2070 ret |= collect_call_args(po, lr->i, pp, save_arg_vars,
2071 arg, need_op_saving, may_reuse);
2074 if ((ops[lr->i].flags & (OPF_JMP|OPF_CC)) != OPF_JMP)
2076 if (j > 0 && LAST_OP(j - 1)) {
2077 // follow last branch in reverse
2082 ret |= collect_call_args(po, lr->i, pp, save_arg_vars,
2083 arg, need_op_saving, may_reuse);
2087 if (ops[j].op == OP_CALL)
2089 pp_tmp = ops[j].datap;
2091 ferr(po, "arg collect hit unparsed call\n");
2092 if (may_reuse && pp_tmp->argc_stack > 0)
2093 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2094 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2096 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP) {
2097 ferr(po, "arg collect %d/%d hit esp adjust\n",
2100 else if (ops[j].op == OP_POP) {
2101 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2103 else if ((ops[j].flags & (OPF_JMP|OPF_CC)) == (OPF_JMP|OPF_CC))
2107 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2109 pp->arg[arg].datap = &ops[j];
2110 need_to_save_current = 0;
2111 if (!need_op_saving) {
2112 ret = scan_for_mod(&ops[j], j + 1, i);
2113 need_to_save_current = (ret >= 0);
2115 if (need_op_saving || need_to_save_current) {
2116 // mark this push as one that needs operand saving
2117 ops[j].flags &= ~OPF_RMD;
2118 if (ops[j].argnum == 0) {
2119 ops[j].argnum = arg + 1;
2120 *save_arg_vars |= 1 << arg;
2122 else if (ops[j].argnum < arg + 1)
2123 ferr(&ops[j], "argnum conflict (%d<%d) for '%s'\n",
2124 ops[j].argnum, arg + 1, pp->name);
2126 else if (ops[j].argnum == 0)
2127 ops[j].flags |= OPF_RMD;
2129 // some PUSHes are reused by different calls on other branches,
2130 // but that can't happen if we didn't branch, so they
2131 // can be removed from future searches (handles nested calls)
2133 ops[j].flags |= OPF_FARG;
2136 for (arg++; arg < pp->argc; arg++)
2137 if (pp->arg[arg].reg == NULL)
2142 if (arg < pp->argc) {
2143 ferr(po, "arg collect failed for '%s': %d/%d\n",
2144 pp->name, arg, pp->argc);
2150 static void add_label_ref(struct label_ref *lr, int op_i)
2152 struct label_ref *lr_new;
2159 lr_new = calloc(1, sizeof(*lr_new));
2161 lr_new->next = lr->next;
2165 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
2167 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
2168 struct parsed_opr *last_arith_dst = NULL;
2169 char buf1[256], buf2[256], buf3[256], cast[64];
2170 const struct parsed_proto *pp_c;
2171 struct parsed_proto *pp, *pp_tmp;
2172 struct parsed_data *pd;
2173 const char *tmpname;
2174 enum parsed_flag_op pfo;
2175 int save_arg_vars = 0;
2176 int cmp_result_vars = 0;
2177 int need_mul_var = 0;
2179 int label_pending = 0;
2180 int regmask_save = 0;
2181 int regmask_arg = 0;
2193 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
2195 g_func_pp = proto_parse(fhdr, funcn);
2196 if (g_func_pp == NULL)
2197 ferr(ops, "proto_parse failed for '%s'\n", funcn);
2199 fprintf(fout, "%s ", g_func_pp->ret_type.name);
2200 if (g_func_pp->is_stdcall && g_func_pp->argc_reg == 0)
2201 fprintf(fout, "__stdcall ");
2202 if (g_ida_func_attr & IDAFA_NORETURN)
2203 fprintf(fout, "noreturn ");
2204 fprintf(fout, "%s(", funcn);
2206 for (i = 0; i < g_func_pp->argc; i++) {
2208 fprintf(fout, ", ");
2209 if (g_func_pp->arg[i].fptr != NULL) {
2211 pp = g_func_pp->arg[i].fptr;
2212 fprintf(fout, "%s (", pp->ret_type.name);
2213 if (pp->is_stdcall && pp->argc_reg == 0)
2214 fprintf(fout, "__stdcall ");
2215 fprintf(fout, "*a%d)(", i + 1);
2216 for (j = 0; j < pp->argc; j++) {
2218 fprintf(fout, ", ");
2219 if (pp->arg[j].fptr)
2220 ferr(ops, "nested fptr\n");
2221 fprintf(fout, "%s", pp->arg[j].type.name);
2226 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
2229 if (g_func_pp->is_vararg) {
2231 fprintf(fout, ", ");
2232 fprintf(fout, "...");
2235 fprintf(fout, ")\n{\n");
2238 // - handle ebp/esp frame, remove ops related to it
2239 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2240 && ops[1].op == OP_MOV
2241 && IS(opr_name(&ops[1], 0), "ebp")
2242 && IS(opr_name(&ops[1], 1), "esp"))
2247 ops[0].flags |= OPF_RMD;
2248 ops[1].flags |= OPF_RMD;
2251 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2252 g_stack_fsz = opr_const(&ops[2], 1);
2253 ops[2].flags |= OPF_RMD;
2257 // another way msvc builds stack frame..
2259 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2261 ops[i].flags |= OPF_RMD;
2265 // and another way..
2266 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
2267 && ops[i].operand[1].type == OPT_CONST
2268 && ops[i + 1].op == OP_CALL
2269 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
2271 g_stack_fsz += ops[i].operand[1].val;
2272 ops[i].flags |= OPF_RMD;
2274 ops[i].flags |= OPF_RMD;
2281 for (; i < opcnt; i++)
2282 if (ops[i].op == OP_RET)
2284 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
2287 if (ops[i - 1].op == OP_POP && IS(opr_name(&ops[i - 1], 0), "ebp"))
2288 ops[i - 1].flags |= OPF_RMD;
2289 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2290 ferr(&ops[i - 1], "'pop ebp' expected\n");
2292 if (g_stack_fsz != 0) {
2293 if (ops[i - 2].op == OP_MOV
2294 && IS(opr_name(&ops[i - 2], 0), "esp")
2295 && IS(opr_name(&ops[i - 2], 1), "ebp"))
2297 ops[i - 2].flags |= OPF_RMD;
2299 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2300 ferr(&ops[i - 2], "esp restore expected\n");
2302 if (ecx_push && ops[i - 3].op == OP_POP
2303 && IS(opr_name(&ops[i - 3], 0), "ecx"))
2305 ferr(&ops[i - 3], "unexpected ecx pop\n");
2311 } while (i < opcnt);
2314 for (i = 0; i < opcnt; i++) {
2315 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2317 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2318 && ops[i].operand[1].type == OPT_CONST)
2327 g_stack_fsz = ops[i].operand[1].val;
2328 ops[i].flags |= OPF_RMD;
2332 for (; i < opcnt; i++)
2333 if (ops[i].op == OP_RET)
2335 if (ops[i - 1].op != OP_ADD
2336 || !IS(opr_name(&ops[i - 1], 0), "esp")
2337 || ops[i - 1].operand[1].type != OPT_CONST
2338 || ops[i - 1].operand[1].val != g_stack_fsz)
2339 ferr(&ops[i - 1], "'add esp' expected\n");
2340 ops[i - 1].flags |= OPF_RMD;
2343 } while (i < opcnt);
2348 // - resolve all branches
2349 for (i = 0; i < opcnt; i++)
2355 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
2356 || po->op == OP_CALL || po->op == OP_RET)
2359 if (po->operand[0].type == OPT_REGMEM) {
2360 char *p = strchr(po->operand[0].name, '[');
2362 ferr(po, "unhandled indirect branch\n");
2363 ret = p - po->operand[0].name;
2364 strncpy(buf1, po->operand[0].name, ret);
2367 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2368 if (IS(g_func_pd[j].label, buf1)) {
2374 //ferr(po, "label '%s' not parsed?\n", buf1);
2376 if (pd->type != OPT_OFFSET)
2377 ferr(po, "label '%s' with non-offset data?\n", buf1);
2379 // find all labels, link
2380 for (j = 0; j < pd->count; j++) {
2381 for (l = 0; l < opcnt; l++) {
2382 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2383 add_label_ref(&g_label_refs[l], i);
2394 for (l = 0; l < opcnt; l++) {
2395 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2396 add_label_ref(&g_label_refs[l], i);
2405 if (po->operand[0].type == OPT_LABEL)
2409 ferr(po, "unhandled branch\n");
2413 po->flags |= OPF_TAIL;
2418 for (i = 0; i < opcnt; i++)
2421 if (po->flags & OPF_RMD)
2424 if (po->op == OP_CALL)
2426 pp = calloc(1, sizeof(*pp));
2427 my_assert_not(pp, NULL);
2428 tmpname = opr_name(po, 0);
2429 if (po->operand[0].type != OPT_LABEL)
2431 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2433 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2435 if (j > ARRAY_SIZE(pp->arg))
2436 ferr(po, "esp adjust too large?\n");
2437 pp->ret_type.name = strdup("int");
2438 pp->argc = pp->argc_stack = j;
2439 for (arg = 0; arg < pp->argc; arg++)
2440 pp->arg[arg].type.name = strdup("int");
2443 pp_c = proto_parse(fhdr, tmpname);
2445 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2446 pp = proto_clone(pp_c);
2449 // look for and make use of esp adjust
2451 if (!pp->is_stdcall && pp->argc_stack > 0)
2452 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2454 if (pp->is_vararg) {
2455 if (j / 4 < pp->argc_stack)
2456 ferr(po, "esp adjust is too small: %x < %x\n",
2457 j, pp->argc_stack * 4);
2458 // modify pp to make it have varargs as normal args
2460 pp->argc += j / 4 - pp->argc_stack;
2461 for (; arg < pp->argc; arg++) {
2462 pp->arg[arg].type.name = strdup("int");
2465 if (pp->argc > ARRAY_SIZE(pp->arg))
2466 ferr(po, "too many args for '%s'\n", tmpname);
2468 if (pp->argc_stack != j / 4)
2469 ferr(po, "stack tracking failed for '%s': %x %x\n",
2470 tmpname, pp->argc_stack * 4, j);
2472 ops[ret].flags |= OPF_RMD;
2473 // a bit of a hack, but deals with use of
2474 // single adj for multiple calls
2475 ops[ret].operand[1].val -= j;
2477 else if (pp->is_vararg)
2478 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2481 // can't call functions with non-__cdecl callbacks yet
2482 for (arg = 0; arg < pp->argc; arg++) {
2483 if (pp->arg[arg].fptr != NULL) {
2484 pp_tmp = pp->arg[arg].fptr;
2485 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2486 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2490 collect_call_args(po, i, pp, &save_arg_vars, 0, 0, 0);
2492 if (strstr(pp->ret_type.name, "int64"))
2499 // - find POPs for PUSHes, rm both
2500 // - scan for all used registers
2501 // - find flag set ops for their users
2502 // - declare indirect functions
2503 for (i = 0; i < opcnt; i++) {
2505 if (po->flags & OPF_RMD)
2508 if (po->op == OP_PUSH
2509 && po->argnum == 0 && !(po->flags & OPF_RSAVE)
2510 && po->operand[0].type == OPT_REG)
2512 reg = po->operand[0].reg;
2514 ferr(po, "reg not set for push?\n");
2517 ret = scan_for_pop(i + 1, opcnt,
2518 po->operand[0].name, i + opcnt, 0, &depth, 0);
2521 ferr(po, "too much depth: %d\n", depth);
2523 regmask_save |= 1 << reg;
2525 po->flags |= OPF_RMD;
2526 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2527 i + opcnt * 2, 0, &depth, 1);
2530 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2533 if (regmask & (1 << reg)) {
2534 if (regmask_save & (1 << reg))
2535 ferr(po, "%s already saved?\n", po->operand[0].name);
2539 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2544 regmask |= po->regmask_src | po->regmask_dst;
2546 if (po->flags & OPF_CC)
2548 int setters[16], cnt = 0, branched = 0;
2550 ret = scan_for_flag_set(i, &branched, setters, &cnt);
2551 if (ret < 0 || cnt <= 0)
2552 ferr(po, "unable to trace flag setter(s)\n");
2553 if (cnt > ARRAY_SIZE(setters))
2554 ferr(po, "too many flag setters\n");
2556 pfo = split_cond(po, po->op, &dummy);
2557 for (j = 0; j < cnt; j++)
2559 tmp_op = &ops[setters[j]]; // flag setter
2562 // to get nicer code, we try to delay test and cmp;
2563 // if we can't because of operand modification, or if we
2564 // have math op, or branch, make it calculate flags explicitly
2565 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2566 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i) >= 0)
2569 else if (tmp_op->op == OP_CMPS) {
2570 pfomask = 1 << PFO_Z;
2573 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2574 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
2578 tmp_op->pfomask |= pfomask;
2579 cmp_result_vars |= pfomask;
2580 // note: may overwrite, currently not a problem
2585 if (po->op == OP_ADC || po->op == OP_SBB)
2586 cmp_result_vars |= 1 << PFO_C;
2588 else if (po->op == OP_MUL
2589 || (po->op == OP_IMUL && po->operand_cnt == 1))
2593 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2595 my_assert_not(pp, NULL);
2596 fprintf(fout, " %s (*icall%d)(", pp->ret_type.name, i);
2597 for (j = 0; j < pp->argc; j++) {
2599 fprintf(fout, ", ");
2600 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
2602 fprintf(fout, ");\n");
2606 // output LUTs/jumptables
2607 for (i = 0; i < g_func_pd_cnt; i++) {
2609 fprintf(fout, " static const ");
2610 if (pd->type == OPT_OFFSET) {
2611 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2613 for (j = 0; j < pd->count; j++) {
2615 fprintf(fout, ", ");
2616 fprintf(fout, "&&%s", pd->d[j].u.label);
2620 fprintf(fout, "%s %s[] =\n { ",
2621 lmod_type_u(ops, pd->lmod), pd->label);
2623 for (j = 0; j < pd->count; j++) {
2625 fprintf(fout, ", ");
2626 fprintf(fout, "%u", pd->d[j].u.val);
2629 fprintf(fout, " };\n");
2632 // declare stack frame, va_arg
2634 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2635 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2637 if (g_func_pp->is_vararg)
2638 fprintf(fout, " va_list ap;\n");
2640 // declare arg-registers
2641 for (i = 0; i < g_func_pp->argc; i++) {
2642 if (g_func_pp->arg[i].reg != NULL) {
2643 reg = char_array_i(regs_r32,
2644 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
2646 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
2648 regmask_arg |= 1 << reg;
2649 fprintf(fout, " u32 %s = (u32)a%d;\n",
2650 g_func_pp->arg[i].reg, i + 1);
2655 // declare other regs - special case for eax
2656 if (!((regmask | regmask_arg) & 1)
2657 && !IS(g_func_pp->ret_type.name, "void"))
2659 fprintf(fout, " u32 eax = 0;\n");
2663 regmask &= ~regmask_arg;
2664 regmask &= ~(1 << xSP);
2666 regmask &= ~(1 << xBP);
2668 for (reg = 0; reg < 8; reg++) {
2669 if (regmask & (1 << reg)) {
2670 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2677 for (reg = 0; reg < 8; reg++) {
2678 if (regmask_save & (1 << reg)) {
2679 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2685 if (save_arg_vars) {
2686 for (reg = 0; reg < 32; reg++) {
2687 if (save_arg_vars & (1 << reg)) {
2688 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2694 if (cmp_result_vars) {
2695 for (i = 0; i < 8; i++) {
2696 if (cmp_result_vars & (1 << i)) {
2697 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2704 fprintf(fout, " u64 mul_tmp;\n");
2709 fprintf(fout, "\n");
2711 if (g_func_pp->is_vararg) {
2712 if (g_func_pp->argc_stack == 0)
2713 ferr(ops, "vararg func without stack args?\n");
2714 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
2718 for (i = 0; i < opcnt; i++)
2720 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1) {
2721 fprintf(fout, "\n%s:\n", g_labels[i]);
2724 delayed_flag_op = NULL;
2725 last_arith_dst = NULL;
2729 if (po->flags & OPF_RMD)
2734 #define assert_operand_cnt(n_) \
2735 if (po->operand_cnt != n_) \
2736 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2738 // conditional/flag using op?
2739 if (po->flags & OPF_CC)
2744 pfo = split_cond(po, po->op, &is_inv);
2746 // we go through all this trouble to avoid using parsed_flag_op,
2747 // which makes generated code much nicer
2748 if (delayed_flag_op != NULL)
2750 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2753 else if (last_arith_dst != NULL
2754 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2756 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
2757 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2758 last_arith_dst->lmod, buf3);
2761 else if (po->datap != NULL) {
2762 // use preprocessed flag calc results
2764 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2765 ferr(po, "not prepared for pfo %d\n", pfo);
2767 // note: is_inv was not yet applied
2768 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2769 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2772 ferr(po, "all methods of finding comparison failed\n");
2775 if (po->flags & OPF_JMP) {
2776 fprintf(fout, " if %s\n", buf1);
2778 else if (po->op == OP_ADC || po->op == OP_SBB) {
2780 fprintf(fout, " cond_%s = %s;\n",
2781 parsed_flag_op_names[pfo], buf1);
2783 else if (po->flags & OPF_DATA) { // SETcc
2784 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2785 fprintf(fout, " %s = %s;", buf2, buf1);
2788 ferr(po, "unhandled conditional op\n");
2792 pfomask = po->pfomask;
2797 assert_operand_cnt(2);
2798 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2799 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2800 fprintf(fout, " %s = %s;", buf1,
2801 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2802 po->operand[0].is_ptr ? "(void *)" : "", 0));
2806 assert_operand_cnt(2);
2807 po->operand[1].lmod = OPLM_DWORD; // always
2808 fprintf(fout, " %s = %s;",
2809 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2810 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2815 assert_operand_cnt(2);
2816 fprintf(fout, " %s = %s;",
2817 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2818 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2822 assert_operand_cnt(2);
2823 switch (po->operand[1].lmod) {
2825 strcpy(buf3, "(s8)");
2828 strcpy(buf3, "(s16)");
2831 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2833 fprintf(fout, " %s = %s%s;",
2834 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2836 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2840 assert_operand_cnt(1);
2841 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2842 fprintf(fout, " %s = ~%s;", buf1, buf1);
2846 assert_operand_cnt(2);
2847 fprintf(fout, " %s = (s32)%s >> 31;",
2848 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2849 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2850 strcpy(g_comment, "cdq");
2855 assert_operand_cnt(3);
2856 if (po->flags & OPF_REP) {
2857 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2858 lmod_bytes(po, po->operand[0].lmod));
2859 fprintf(fout, " %sedi = eax;",
2860 lmod_cast_u_ptr(po, po->operand[0].lmod));
2861 strcpy(g_comment, "rep stos");
2864 fprintf(fout, " %sedi = eax; edi += %d;",
2865 lmod_cast_u_ptr(po, po->operand[0].lmod),
2866 lmod_bytes(po, po->operand[0].lmod));
2867 strcpy(g_comment, "stos");
2873 assert_operand_cnt(3);
2874 j = lmod_bytes(po, po->operand[0].lmod);
2875 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2876 if (po->flags & OPF_REP) {
2878 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2881 " %sedi = %sesi;", buf1, buf1);
2882 strcpy(g_comment, "rep movs");
2885 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2887 strcpy(g_comment, "movs");
2893 // repe ~ repeat while ZF=1
2894 assert_operand_cnt(3);
2895 j = lmod_bytes(po, po->operand[0].lmod);
2896 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2897 if (po->flags & OPF_REP) {
2899 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2902 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
2903 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
2906 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
2907 (po->flags & OPF_REPZ) ? "e" : "ne");
2911 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
2913 strcpy(g_comment, "cmps");
2915 pfomask &= ~(1 << PFO_Z);
2916 last_arith_dst = NULL;
2917 delayed_flag_op = NULL;
2920 // arithmetic w/flags
2925 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2930 assert_operand_cnt(2);
2931 fprintf(fout, " %s %s= %s;",
2932 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2934 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2935 if (pfomask & (1 << PFO_Z)) {
2936 fprintf(fout, "\n cond_z = (%s == 0);", buf1);
2937 pfomask &= ~(1 << PFO_Z);
2939 if (pfomask & (1 << PFO_S)) {
2940 fprintf(fout, "\n cond_s = ((s32)%s < 0);", buf1);
2941 pfomask &= ~(1 << PFO_S);
2943 last_arith_dst = &po->operand[0];
2944 delayed_flag_op = NULL;
2948 assert_operand_cnt(2);
2949 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2950 fprintf(fout, " %s = %s%s >> %s;", buf1,
2951 lmod_cast_s(po, po->operand[0].lmod), buf1,
2952 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
2953 last_arith_dst = &po->operand[0];
2954 delayed_flag_op = NULL;
2959 assert_operand_cnt(2);
2960 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2961 if (po->operand[1].type == OPT_CONST) {
2962 j = po->operand[1].val;
2963 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2964 fprintf(fout, po->op == OP_ROL ?
2965 " %s = (%s << %d) | (%s >> %d);" :
2966 " %s = (%s >> %d) | (%s << %d);",
2967 buf1, buf1, j, buf1,
2968 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2972 last_arith_dst = &po->operand[0];
2973 delayed_flag_op = NULL;
2977 assert_operand_cnt(2);
2978 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2979 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2980 // special case for XOR
2981 fprintf(fout, " %s = 0;",
2982 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2983 last_arith_dst = &po->operand[0];
2984 delayed_flag_op = NULL;
2991 assert_operand_cnt(2);
2992 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2993 if (po->op == OP_SBB
2994 && IS(po->operand[0].name, po->operand[1].name))
2996 // avoid use of unitialized var
2997 fprintf(fout, " %s = -cond_c;",
2998 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
3001 fprintf(fout, " %s %s= %s + cond_c;",
3002 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3004 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3006 last_arith_dst = &po->operand[0];
3007 delayed_flag_op = NULL;
3012 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3013 if (po->operand[0].type == OPT_REG) {
3014 strcpy(buf2, po->op == OP_INC ? "++" : "--");
3015 fprintf(fout, " %s%s;", buf1, buf2);
3018 strcpy(buf2, po->op == OP_INC ? "+" : "-");
3019 fprintf(fout, " %s %s= 1;", buf1, buf2);
3021 last_arith_dst = &po->operand[0];
3022 delayed_flag_op = NULL;
3026 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3027 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
3028 fprintf(fout, " %s = -%s%s;", buf1,
3029 lmod_cast_s(po, po->operand[0].lmod), buf2);
3030 last_arith_dst = &po->operand[0];
3031 delayed_flag_op = NULL;
3032 if (pfomask & (1 << PFO_C)) {
3033 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
3034 pfomask &= ~(1 << PFO_C);
3039 if (po->operand_cnt == 2) {
3040 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3043 if (po->operand_cnt == 3)
3044 ferr(po, "TODO imul3\n");
3047 assert_operand_cnt(1);
3048 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
3049 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
3050 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
3051 fprintf(fout, " edx = mul_tmp >> 32;\n");
3052 fprintf(fout, " eax = mul_tmp;");
3053 last_arith_dst = NULL;
3054 delayed_flag_op = NULL;
3059 assert_operand_cnt(1);
3060 if (po->operand[0].lmod != OPLM_DWORD)
3061 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
3063 // 32bit division is common, look for it
3064 if (po->op == OP_DIV)
3065 ret = scan_for_reg_clear(i - 1, xDX);
3067 ret = scan_for_cdq_edx(i - 1);
3069 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3070 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
3071 po->op == OP_IDIV));
3072 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
3073 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
3076 ferr(po, "TODO 64bit divident\n");
3077 last_arith_dst = NULL;
3078 delayed_flag_op = NULL;
3083 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3085 for (j = 0; j < 8; j++) {
3086 if (pfomask & (1 << j)) {
3087 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
3088 fprintf(fout, " cond_%s = %s;",
3089 parsed_flag_op_names[j], buf1);
3096 last_arith_dst = NULL;
3097 delayed_flag_op = po;
3100 // note: we reuse OP_Jcc for SETcc, only flags differ
3101 case OP_JO ... OP_JG:
3102 if (po->flags & OPF_JMP)
3103 fprintf(fout, " goto %s;", po->operand[0].name);
3104 // else SETcc - should already be handled
3108 assert_operand_cnt(1);
3109 last_arith_dst = NULL;
3110 delayed_flag_op = NULL;
3112 if (po->operand[0].type == OPT_REGMEM) {
3113 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
3116 ferr(po, "parse failure for jmp '%s'\n",
3117 po->operand[0].name);
3118 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
3121 else if (po->operand[0].type != OPT_LABEL)
3122 ferr(po, "unhandled jmp type\n");
3124 fprintf(fout, " goto %s;", po->operand[0].name);
3128 assert_operand_cnt(1);
3131 ferr(po, "NULL pp\n");
3133 if (po->operand[0].type != OPT_LABEL)
3134 fprintf(fout, " icall%d = (void *)%s;\n", i,
3135 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]));
3138 if (strstr(pp->ret_type.name, "int64")) {
3139 if (po->flags & OPF_TAIL)
3140 ferr(po, "int64 and tail?\n");
3141 fprintf(fout, "mul_tmp = ");
3143 else if (!IS(pp->ret_type.name, "void")) {
3144 if (po->flags & OPF_TAIL) {
3145 if (!IS(g_func_pp->ret_type.name, "void")) {
3146 fprintf(fout, "return ");
3147 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
3148 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
3152 fprintf(fout, "eax = ");
3153 if (pp->ret_type.is_ptr)
3154 fprintf(fout, "(u32)");
3158 if (po->operand[0].type != OPT_LABEL) {
3159 fprintf(fout, "icall%d(", i);
3162 if (pp->name[0] == 0)
3163 ferr(po, "missing pp->name\n");
3164 fprintf(fout, "%s%s(", pp->name,
3165 pp->has_structarg ? "_sa" : "");
3168 for (arg = 0; arg < pp->argc; arg++) {
3170 fprintf(fout, ", ");
3173 if (pp->arg[arg].type.is_ptr)
3174 snprintf(cast, sizeof(cast), "(%s)", pp->arg[arg].type.name);
3176 if (pp->arg[arg].reg != NULL) {
3177 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
3182 tmp_op = pp->arg[arg].datap;
3184 ferr(po, "parsed_op missing for arg%d\n", arg);
3185 if (tmp_op->argnum != 0) {
3186 fprintf(fout, "%ss_a%d", cast, tmp_op->argnum);
3190 out_src_opr(buf1, sizeof(buf1),
3191 tmp_op, &tmp_op->operand[0], cast, 0));
3194 fprintf(fout, ");");
3196 if (strstr(pp->ret_type.name, "int64")) {
3197 fprintf(fout, "\n");
3198 fprintf(fout, " edx = mul_tmp >> 32;\n");
3199 fprintf(fout, " eax = mul_tmp;");
3202 if (po->flags & OPF_TAIL) {
3203 strcpy(g_comment, "tailcall");
3207 else if (IS(pp->ret_type.name, "void"))
3209 else if (IS(g_func_pp->ret_type.name, "void"))
3211 // else already handled as 'return f()'
3214 fprintf(fout, "\n return;");
3215 strcpy(g_comment, "^ tailcall");
3218 delayed_flag_op = NULL;
3219 last_arith_dst = NULL;
3223 if (g_func_pp->is_vararg)
3224 fprintf(fout, " va_end(ap);\n");
3226 if (IS(g_func_pp->ret_type.name, "void")) {
3227 if (i != opcnt - 1 || label_pending)
3228 fprintf(fout, " return;");
3230 else if (g_func_pp->ret_type.is_ptr) {
3231 fprintf(fout, " return (%s)eax;",
3232 g_func_pp->ret_type.name);
3235 fprintf(fout, " return eax;");
3237 last_arith_dst = NULL;
3238 delayed_flag_op = NULL;
3242 if (po->argnum != 0) {
3243 // special case - saved func arg
3244 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3245 fprintf(fout, " s_a%d = %s;", po->argnum, buf1);
3248 else if (po->flags & OPF_RSAVE) {
3249 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3250 fprintf(fout, " s_%s = %s;", buf1, buf1);
3253 if (!(g_ida_func_attr & IDAFA_NORETURN))
3254 ferr(po, "stray push encountered\n");
3259 if (po->flags & OPF_RSAVE) {
3260 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3261 fprintf(fout, " %s = s_%s;", buf1, buf1);
3264 ferr(po, "stray pop encountered\n");
3273 ferr(po, "unhandled op type %d, flags %x\n",
3278 if (g_comment[0] != 0) {
3279 fprintf(fout, " // %s", g_comment);
3284 fprintf(fout, "\n");
3286 // some sanity checking
3287 if ((po->flags & OPF_REP) && po->op != OP_STOS
3288 && po->op != OP_MOVS && po->op != OP_CMPS)
3289 ferr(po, "unexpected rep\n");
3290 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
3291 ferr(po, "unexpected repz/repnz\n");
3294 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
3296 // see is delayed flag stuff is still valid
3297 if (delayed_flag_op != NULL && delayed_flag_op != po) {
3298 if (is_any_opr_modified(delayed_flag_op, po))
3299 delayed_flag_op = NULL;
3302 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
3303 if (is_opr_modified(last_arith_dst, po))
3304 last_arith_dst = NULL;
3310 fprintf(fout, "}\n\n");
3313 for (i = 0; i < opcnt; i++) {
3314 struct label_ref *lr, *lr_del;
3316 lr = g_label_refs[i].next;
3317 while (lr != NULL) {
3322 g_label_refs[i].i = -1;
3323 g_label_refs[i].next = NULL;
3325 if (ops[i].op == OP_CALL) {
3334 static void set_label(int i, const char *name)
3340 p = strchr(name, ':');
3344 if (len > sizeof(g_labels[0]) - 1)
3345 aerr("label '%s' too long: %d\n", name, len);
3346 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
3347 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
3348 memcpy(g_labels[i], name, len);
3349 g_labels[i][len] = 0;
3352 // '=' needs special treatment..
3353 static char *next_word_s(char *w, size_t wsize, char *s)
3359 for (i = 0; i < wsize - 1; i++) {
3360 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3366 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3367 printf("warning: '%s' truncated\n", w);
3378 static int cmp_chunks(const void *p1, const void *p2)
3380 const struct chunk_item *c1 = p1, *c2 = p2;
3381 return strcmp(c1->name, c2->name);
3384 static int cmpstringp(const void *p1, const void *p2)
3386 return strcmp(*(char * const *)p1, *(char * const *)p2);
3389 int main(int argc, char *argv[])
3391 FILE *fout, *fasm, *frlist;
3392 struct parsed_data *pd = NULL;
3394 char **rlist = NULL;
3396 int rlist_alloc = 0;
3397 struct chunk_item *func_chunks;
3398 int func_chunks_used = 0;
3399 int func_chunks_sorted = 0;
3400 int func_chunk_cnt = 0;
3401 int func_chunk_alloc;
3402 int func_chunk_i = -1;
3403 long func_chunk_ret = 0;
3404 int func_chunk_ret_ln = 0;
3406 char words[16][256];
3407 enum opr_lenmod lmod;
3409 int pending_endp = 0;
3411 int skip_warned = 0;
3422 if (argv[1] && IS(argv[1], "-v")) {
3427 if (argc < arg + 3) {
3428 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
3435 asmfn = argv[arg++];
3436 fasm = fopen(asmfn, "r");
3437 my_assert_not(fasm, NULL);
3439 hdrfn = argv[arg++];
3440 g_fhdr = fopen(hdrfn, "r");
3441 my_assert_not(g_fhdr, NULL);
3444 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3445 my_assert_not(rlist, NULL);
3446 // needs special handling..
3447 rlist[rlist_len++] = "__alloca_probe";
3449 func_chunk_alloc = 32;
3450 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
3451 my_assert_not(func_chunks, NULL);
3453 for (; arg < argc; arg++) {
3454 frlist = fopen(argv[arg], "r");
3455 my_assert_not(frlist, NULL);
3457 while (fgets(line, sizeof(line), frlist)) {
3459 if (*p == 0 || *p == ';' || *p == '#')
3462 p = next_word(words[0], sizeof(words[0]), p);
3463 if (words[0][0] == 0)
3466 if (rlist_len >= rlist_alloc) {
3467 rlist_alloc = rlist_alloc * 2 + 64;
3468 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3469 my_assert_not(rlist, NULL);
3471 rlist[rlist_len++] = strdup(words[0]);
3479 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3481 fout = fopen(argv[arg_out], "w");
3482 my_assert_not(fout, NULL);
3485 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3486 my_assert_not(g_eqs, NULL);
3488 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3489 g_label_refs[i].i = -1;
3490 g_label_refs[i].next = NULL;
3493 while (fgets(line, sizeof(line), fasm))
3502 // get rid of random tabs
3503 for (i = 0; line[i] != 0; i++)
3504 if (line[i] == '\t')
3509 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3510 goto do_pending_endp; // eww..
3512 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
3514 static const char *attrs[] = {
3523 // parse IDA's attribute-list comment
3524 g_ida_func_attr = 0;
3527 for (; *p != 0; p = sskip(p)) {
3528 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3529 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
3530 g_ida_func_attr |= 1 << i;
3531 p += strlen(attrs[i]);
3535 if (i == ARRAY_SIZE(attrs)) {
3536 anote("unparsed IDA attr: %s\n", p);
3539 if (IS(attrs[i], "fpd=")) {
3540 p = next_word(words[0], sizeof(words[0]), p);
3545 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
3548 next_word(words[0], sizeof(words[0]), p);
3549 if (words[0][0] == 0)
3550 aerr("missing nam for func chunk?\n");
3551 if (func_chunk_cnt >= func_chunk_alloc) {
3552 func_chunk_alloc *= 2;
3553 func_chunks = realloc(func_chunks,
3554 func_chunk_alloc * sizeof(func_chunks[0]));
3555 my_assert_not(func_chunks, NULL);
3557 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
3558 func_chunks[func_chunk_cnt].name = strdup(words[0]);
3559 func_chunks[func_chunk_cnt].asmln = asmln;
3561 func_chunks_sorted = 0;
3563 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
3565 if (func_chunk_i >= 0) {
3566 if (func_chunk_i < func_chunk_cnt
3567 && IS(func_chunks[func_chunk_i].name, g_func))
3569 // move on to next chunk
3570 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
3572 aerr("seek failed for '%s' chunk #%d\n",
3573 g_func, func_chunk_i);
3574 asmln = func_chunks[func_chunk_i].asmln;
3578 if (func_chunk_ret == 0)
3579 aerr("no return from chunk?\n");
3580 fseek(fasm, func_chunk_ret, SEEK_SET);
3581 asmln = func_chunk_ret_ln;
3587 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
3588 func_chunks_used = 1;
3590 if (IS_START(g_func, "sub_")) {
3591 unsigned long addr = strtoul(p, NULL, 16);
3592 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
3594 aerr("need a chunk %lX that is after %s\n", addr, g_func);
3601 memset(words, 0, sizeof(words));
3602 for (wordc = 0; wordc < 16; wordc++) {
3603 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3604 if (*p == 0 || *p == ';') {
3610 // alow asm patches in comments
3611 if (*p == ';' && IS_START(p, "; sctpatch:")) {
3613 if (*p == 0 || *p == ';')
3615 goto parse_words; // lame
3620 awarn("wordc == 0?\n");
3624 // don't care about this:
3625 if (words[0][0] == '.'
3626 || IS(words[0], "include")
3627 || IS(words[0], "assume") || IS(words[1], "segment")
3628 || IS(words[0], "align"))
3634 // do delayed endp processing to collect switch jumptables
3636 if (in_func && !skip_func && wordc >= 2
3637 && ((words[0][0] == 'd' && words[0][2] == 0)
3638 || (words[1][0] == 'd' && words[1][2] == 0)))
3641 if (words[1][0] == 'd' && words[1][2] == 0) {
3643 if (g_func_pd_cnt >= pd_alloc) {
3644 pd_alloc = pd_alloc * 2 + 16;
3645 g_func_pd = realloc(g_func_pd,
3646 sizeof(g_func_pd[0]) * pd_alloc);
3647 my_assert_not(g_func_pd, NULL);
3649 pd = &g_func_pd[g_func_pd_cnt];
3651 memset(pd, 0, sizeof(*pd));
3652 strcpy(pd->label, words[0]);
3653 pd->type = OPT_CONST;
3654 pd->lmod = lmod_from_directive(words[1]);
3658 lmod = lmod_from_directive(words[0]);
3659 if (lmod != pd->lmod)
3660 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3663 if (pd->count_alloc < pd->count + wordc) {
3664 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3665 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3666 my_assert_not(pd->d, NULL);
3668 for (; i < wordc; i++) {
3669 if (IS(words[i], "offset")) {
3670 pd->type = OPT_OFFSET;
3673 p = strchr(words[i], ',');
3676 if (pd->type == OPT_OFFSET)
3677 pd->d[pd->count].u.label = strdup(words[i]);
3679 pd->d[pd->count].u.val = parse_number(words[i]);
3680 pd->d[pd->count].bt_i = -1;
3686 if (in_func && !skip_func)
3687 gen_func(fout, g_fhdr, g_func, pi);
3691 g_ida_func_attr = 0;
3695 func_chunks_used = 0;
3698 memset(&ops, 0, pi * sizeof(ops[0]));
3699 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3703 for (i = 0; i < g_func_pd_cnt; i++) {
3705 if (pd->type == OPT_OFFSET) {
3706 for (j = 0; j < pd->count; j++)
3707 free(pd->d[j].u.label);
3718 if (IS(words[1], "proc")) {
3720 aerr("proc '%s' while in_func '%s'?\n",
3723 if ((g_ida_func_attr & IDAFA_THUNK)
3724 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
3726 strcpy(g_func, words[0]);
3727 set_label(0, words[0]);
3732 if (IS(words[1], "endp"))
3735 aerr("endp '%s' while not in_func?\n", words[0]);
3736 if (!IS(g_func, words[0]))
3737 aerr("endp '%s' while in_func '%s'?\n",
3740 if (!skip_func && func_chunks_used) {
3741 // start processing chunks
3742 struct chunk_item *ci, key = { g_func, 0 };
3744 func_chunk_ret = ftell(fasm);
3745 func_chunk_ret_ln = asmln;
3746 if (!func_chunks_sorted) {
3747 qsort(func_chunks, func_chunk_cnt,
3748 sizeof(func_chunks[0]), cmp_chunks);
3749 func_chunks_sorted = 1;
3751 ci = bsearch(&key, func_chunks, func_chunk_cnt,
3752 sizeof(func_chunks[0]), cmp_chunks);
3754 aerr("'%s' needs chunks, but none found\n", g_func);
3755 func_chunk_i = ci - func_chunks;
3756 for (; func_chunk_i > 0; func_chunk_i--)
3757 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
3760 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
3762 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
3763 asmln = func_chunks[func_chunk_i].asmln;
3771 p = strchr(words[0], ':');
3773 set_label(pi, words[0]);
3777 if (!in_func || skip_func) {
3778 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
3780 anote("skipping from '%s'\n", g_labels[pi]);
3783 g_labels[pi][0] = 0;
3787 if (wordc > 1 && IS(words[1], "=")) {
3789 aerr("unhandled equ, wc=%d\n", wordc);
3790 if (g_eqcnt >= eq_alloc) {
3792 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
3793 my_assert_not(g_eqs, NULL);
3796 len = strlen(words[0]);
3797 if (len > sizeof(g_eqs[0].name) - 1)
3798 aerr("equ name too long: %d\n", len);
3799 strcpy(g_eqs[g_eqcnt].name, words[0]);
3801 if (!IS(words[3], "ptr"))
3802 aerr("unhandled equ\n");
3803 if (IS(words[2], "dword"))
3804 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
3805 else if (IS(words[2], "word"))
3806 g_eqs[g_eqcnt].lmod = OPLM_WORD;
3807 else if (IS(words[2], "byte"))
3808 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
3810 aerr("bad lmod: '%s'\n", words[2]);
3812 g_eqs[g_eqcnt].offset = parse_number(words[4]);
3817 if (pi >= ARRAY_SIZE(ops))
3818 aerr("too many ops\n");
3820 parse_op(&ops[pi], words, wordc);
3831 // vim:ts=2:shiftwidth=2:expandtab