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_REP = (1 << 6), /* prefixed by rep */
37 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
111 #define MAX_OPERANDS 3
115 enum opr_lenmod lmod;
116 unsigned int is_ptr:1; // pointer in C
124 struct parsed_opr operand[MAX_OPERANDS];
127 int regmask_src; // all referensed regs
129 int pfomask; // flagop: parsed_flag_op that can't be delayed
130 int argmask; // push: args that are altered before call
131 int cc_scratch; // scratch storage during analysis
132 int bt_i; // branch target (for branches)
133 struct parsed_op *lrl; // label reference list entry
138 // OP_CALL - ptr to parsed_proto
139 // (OPF_CC) - point to corresponding (OPF_FLAGS)
143 enum opr_lenmod lmod;
148 IDAFA_BP_FRAME = (1 << 0),
149 IDAFA_LIB_FUNC = (1 << 1),
150 IDAFA_STATIC = (1 << 2),
151 IDAFA_NORETURN = (1 << 3),
152 IDAFA_THUNK = (1 << 4),
153 IDAFA_FPD = (1 << 5),
158 static struct parsed_op ops[MAX_OPS];
159 static struct parsed_equ *g_eqs;
161 static char g_labels[MAX_OPS][32];
162 static struct parsed_op *g_label_refs[MAX_OPS];
163 static struct parsed_proto g_func_pp;
164 static char g_func[256];
165 static char g_comment[256];
166 static int g_bp_frame;
167 static int g_sp_frame;
168 static int g_stack_fsz;
169 #define ferr(op_, fmt, ...) do { \
170 printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
171 dump_op(op_), ##__VA_ARGS__); \
178 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
179 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
180 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
181 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
183 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
185 // possible basic comparison types (without inversion)
186 enum parsed_flag_op {
190 PFO_BE, // 6 CF=1||ZF=1
194 PFO_LE, // e ZF=1||SF!=OF
197 static const char *parsed_flag_op_names[] = {
198 "o", "c", "z", "be", "s", "p", "l", "le"
201 static int char_array_i(const char *array[], size_t len, const char *s)
205 for (i = 0; i < len; i++)
212 static void printf_number(char *buf, size_t buf_size, long number)
214 // output in C-friendly form
215 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
218 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
222 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
224 *reg_lmod = OPLM_DWORD;
227 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
229 *reg_lmod = OPLM_WORD;
232 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
234 *reg_lmod = OPLM_BYTE;
237 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
239 *reg_lmod = OPLM_BYTE;
246 static long parse_number(const char *number)
248 int len = strlen(number);
249 const char *p = number;
259 if (len > 1 && *p == '0')
261 if (number[len - 1] == 'h') {
262 ret = strtol(p, &endp, 16);
263 bad = (*endp != 'h');
266 ret = strtol(p, &endp, 10);
270 aerr("number parsing failed\n");
276 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
278 enum opr_lenmod lmod;
291 while (my_isblank(*s))
293 for (; my_issep(*s); d++, s++)
295 while (my_isblank(*s))
300 if (IS_START(s, "ds:"))
303 s = next_idt(w, sizeof(w), s);
308 reg = parse_reg(&lmod, w);
310 *regmask |= 1 << reg;
314 if ('0' <= w[0] && w[0] <= '9') {
315 number = parse_number(w);
316 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
320 // probably some label/identifier - pass
323 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
327 strcpy(name, cvtbuf);
332 static const char *parse_stack_el(const char *name)
340 if (IS_START(name, "ebp+")
341 && !('0' <= name[4] && name[4] <= '9'))
345 if (!IS_START(name, "esp+"))
348 p = strchr(name + 4, '+');
350 // must be a number after esp+, already converted to 0x..
352 if (!('0' <= *s && *s <= '9')) {
353 aerr("%s nan?\n", __func__);
356 if (s[0] == '0' && s[1] == 'x')
359 if (len < sizeof(buf) - 1) {
360 strncpy(buf, s, len);
362 val = strtol(buf, &endp, 16);
363 if (val == 0 || *endp != 0) {
364 aerr("%s num parse fail for '%s'\n", __func__, buf);
373 if ('0' <= *p && *p <= '9')
379 static int guess_lmod_from_name(struct parsed_opr *opr)
381 if (!strncmp(opr->name, "dword_", 6)) {
382 opr->lmod = OPLM_DWORD;
385 if (!strncmp(opr->name, "word_", 5)) {
386 opr->lmod = OPLM_WORD;
389 if (!strncmp(opr->name, "byte_", 5)) {
390 opr->lmod = OPLM_BYTE;
396 static int guess_lmod_from_c_type(struct parsed_opr *opr, const char *c_type)
398 static const char *ptr_types[] = {
401 static const char *dword_types[] = {
402 "int", "_DWORD", "DWORD", "HANDLE", "HWND", "HMODULE",
404 static const char *word_types[] = {
405 "__int16", "unsigned __int16",
407 static const char *byte_types[] = {
408 "char", "__int8", "unsigned __int8", "BYTE",
412 if (strchr(c_type, '*')) {
413 opr->lmod = OPLM_DWORD;
418 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
419 if (IS(c_type, dword_types[i])) {
420 opr->lmod = OPLM_DWORD;
425 for (i = 0; i < ARRAY_SIZE(ptr_types); i++) {
426 if (IS(c_type, ptr_types[i])) {
427 opr->lmod = OPLM_DWORD;
433 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
434 if (IS(c_type, word_types[i])) {
435 opr->lmod = OPLM_WORD;
440 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
441 if (IS(c_type, byte_types[i])) {
442 opr->lmod = OPLM_BYTE;
447 anote("unhandled C type '%s' for '%s'\n", c_type, opr->name);
451 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
457 *regmask |= 1 << reg;
460 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
463 static int parse_operand(struct parsed_opr *opr,
464 int *regmask, int *regmask_indirect,
465 char words[16][256], int wordc, int w, unsigned int op_flags)
467 struct parsed_proto pp;
468 enum opr_lenmod tmplmod;
476 aerr("parse_operand w %d, wordc %d\n", w, wordc);
480 for (i = w; i < wordc; i++) {
481 len = strlen(words[i]);
482 if (words[i][len - 1] == ',') {
483 words[i][len - 1] = 0;
489 wordc_in = wordc - w;
491 if ((op_flags & OPF_JMP) && wordc_in > 0
492 && !('0' <= words[w][0] && words[w][0] <= '9'))
494 const char *label = NULL;
496 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
497 && IS(words[w + 1], "ptr"))
498 label = words[w + 2];
499 else if (wordc_in == 2 && IS(words[w], "short"))
500 label = words[w + 1];
501 else if (wordc_in == 1
502 && strchr(words[w], '[') == NULL
503 && parse_reg(&tmplmod, words[w]) < 0)
507 opr->type = OPT_LABEL;
508 if (IS_START(label, "ds:"))
510 strcpy(opr->name, label);
516 if (IS(words[w + 1], "ptr")) {
517 if (IS(words[w], "dword"))
518 opr->lmod = OPLM_DWORD;
519 else if (IS(words[w], "word"))
520 opr->lmod = OPLM_WORD;
521 else if (IS(words[w], "byte"))
522 opr->lmod = OPLM_BYTE;
524 aerr("type parsing failed\n");
526 wordc_in = wordc - w;
531 if (IS(words[w], "offset")) {
532 opr->type = OPT_OFFSET;
533 strcpy(opr->name, words[w + 1]);
536 if (IS(words[w], "(offset")) {
537 char *p = strchr(words[w + 1], ')');
539 aerr("parse of bracketed offset failed\n");
541 opr->type = OPT_OFFSET;
542 strcpy(opr->name, words[w + 1]);
548 aerr("parse_operand 1 word expected\n");
551 if (IS_START(tmp, "ds:"))
553 strcpy(opr->name, tmp);
555 if (words[w][0] == '[') {
556 opr->type = OPT_REGMEM;
557 ret = sscanf(words[w], "[%[^]]]", opr->name);
559 aerr("[] parse failure\n");
561 parse_indmode(opr->name, regmask_indirect, 1);
562 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name)) {
564 struct parsed_equ *eq =
565 equ_find(NULL, parse_stack_el(opr->name), &i);
567 opr->lmod = eq->lmod;
571 else if (strchr(words[w], '[')) {
573 opr->type = OPT_REGMEM;
574 if (opr->lmod == OPLM_UNSPEC)
575 guess_lmod_from_name(opr);
576 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
579 else if (('0' <= words[w][0] && words[w][0] <= '9')
580 || words[w][0] == '-')
582 number = parse_number(words[w]);
583 opr->type = OPT_CONST;
585 printf_number(opr->name, sizeof(opr->name), number);
589 ret = parse_reg(&tmplmod, opr->name);
591 setup_reg_opr(opr, ret, tmplmod, regmask);
595 // most likely var in data segment
596 opr->type = OPT_LABEL;
598 ret = proto_parse(g_fhdr, opr->name, &pp);
601 opr->lmod = OPLM_DWORD;
604 else if (opr->lmod == OPLM_UNSPEC)
605 guess_lmod_from_c_type(opr, pp.ret_type);
609 if (opr->lmod == OPLM_UNSPEC)
610 guess_lmod_from_name(opr);
614 static const struct {
621 static const struct {
628 { "nop", OP_NOP, 0, 0, 0 },
629 { "push", OP_PUSH, 1, 1, 0 },
630 { "pop", OP_POP, 1, 1, OPF_DATA },
631 { "mov" , OP_MOV, 2, 2, OPF_DATA },
632 { "lea", OP_LEA, 2, 2, OPF_DATA },
633 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
634 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
635 { "not", OP_NOT, 1, 1, OPF_DATA },
636 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
637 { "stosb",OP_STOS, 0, 0, OPF_DATA },
638 { "stosw",OP_STOS, 0, 0, OPF_DATA },
639 { "stosd",OP_STOS, 0, 0, OPF_DATA },
640 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
641 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
642 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
643 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
644 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
645 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
646 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
647 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
648 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
649 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
650 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
651 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
652 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
653 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
654 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
655 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
656 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
657 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
658 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
659 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
660 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
661 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
662 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
663 { "test", OP_TEST, 2, 2, OPF_FLAGS },
664 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
665 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
666 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS },
667 { "jmp", OP_JMP, 1, 1, OPF_JMP },
668 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
669 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
670 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
671 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
672 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
673 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
674 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
675 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
676 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
677 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
678 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
679 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
680 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
681 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
682 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
683 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
684 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
685 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
686 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
687 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
688 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
689 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
690 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
691 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
692 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
693 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
694 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
695 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
696 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
697 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
698 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
699 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
700 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
701 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
702 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
703 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
704 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
705 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
706 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
707 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
708 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
709 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
710 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
711 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
712 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
713 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
714 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
715 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
716 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
717 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
718 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
719 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
720 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
721 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
722 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
723 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
724 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
727 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
729 enum opr_lenmod lmod = OPLM_UNSPEC;
730 int prefix_flags = 0;
738 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
739 if (IS(words[w], pref_table[i].name)) {
740 prefix_flags = pref_table[i].flags;
747 aerr("lone prefix: '%s'\n", words[0]);
752 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
753 if (IS(words[w], op_table[i].name))
757 if (i == ARRAY_SIZE(op_table))
758 aerr("unhandled op: '%s'\n", words[0]);
761 op->op = op_table[i].op;
762 op->flags = op_table[i].flags | prefix_flags;
763 op->regmask_src = op->regmask_dst = 0;
765 for (opr = 0; opr < op_table[i].minopr; opr++) {
766 regmask = regmask_ind = 0;
767 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
768 words, wordc, w, op->flags);
770 if (opr == 0 && (op->flags & OPF_DATA))
771 op->regmask_dst = regmask;
772 // for now, mark dst as src too
773 op->regmask_src |= regmask | regmask_ind;
776 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
777 w = parse_operand(&op->operand[opr],
778 &op->regmask_src, &op->regmask_src,
779 words, wordc, w, op->flags);
783 aerr("parse_op %s incomplete: %d/%d\n",
787 op->operand_cnt = opr;
788 if (!strncmp(op_table[i].name, "set", 3))
789 op->operand[0].lmod = OPLM_BYTE;
791 // ops with implicit argumets
795 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
796 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
800 if (op->operand_cnt != 0)
802 if (IS(words[op_w], "stosb"))
804 else if (IS(words[op_w], "stosw"))
806 else if (IS(words[op_w], "stosd"))
809 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
810 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
811 op->regmask_dst = op->regmask_src;
812 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
816 if (op->operand_cnt != 0)
818 if (IS(words[op_w], "movsb"))
820 else if (IS(words[op_w], "movsw"))
822 else if (IS(words[op_w], "movsd"))
825 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
826 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
827 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
828 op->regmask_dst = op->regmask_src;
832 if (op->operand_cnt != 1)
837 op->regmask_dst = (1 << xDX) | (1 << xAX);
838 op->regmask_src |= (1 << xAX);
839 if (op->operand[0].lmod == OPLM_UNSPEC)
840 op->operand[0].lmod = OPLM_DWORD;
845 // we could set up operands for edx:eax, but there is no real need to
846 // (see is_opr_modified())
847 regmask = (1 << xDX) | (1 << xAX);
848 op->regmask_dst = regmask;
849 op->regmask_src |= regmask;
850 if (op->operand[0].lmod == OPLM_UNSPEC)
851 op->operand[0].lmod = OPLM_DWORD;
859 if (op->operand[1].lmod == OPLM_UNSPEC)
860 op->operand[1].lmod = OPLM_BYTE;
868 static const char *op_name(enum op_op op)
872 for (i = 0; i < ARRAY_SIZE(op_table); i++)
873 if (op_table[i].op == op)
874 return op_table[i].name;
880 static const char *dump_op(struct parsed_op *po)
882 static char out[128];
886 snprintf(out, sizeof(out), "%s", op_name(po->op));
887 for (i = 0; i < po->operand_cnt; i++) {
891 snprintf(p, sizeof(out) - (p - out),
892 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
893 po->operand[i].name);
899 static const char *lmod_cast_u(struct parsed_op *po,
900 enum opr_lenmod lmod)
910 ferr(po, "invalid lmod: %d\n", lmod);
911 return "(_invalid_)";
915 static const char *lmod_cast_u_ptr(struct parsed_op *po,
916 enum opr_lenmod lmod)
926 ferr(po, "invalid lmod: %d\n", lmod);
927 return "(_invalid_)";
931 static const char *lmod_cast_s(struct parsed_op *po,
932 enum opr_lenmod lmod)
942 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
943 return "(_invalid_)";
947 static const char *lmod_cast(struct parsed_op *po,
948 enum opr_lenmod lmod, int is_signed)
951 lmod_cast_s(po, lmod) :
952 lmod_cast_u(po, lmod);
955 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
965 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
970 static const char *opr_name(struct parsed_op *po, int opr_num)
972 if (opr_num >= po->operand_cnt)
973 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
974 return po->operand[opr_num].name;
977 static unsigned int opr_const(struct parsed_op *po, int opr_num)
979 if (opr_num >= po->operand_cnt)
980 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
981 if (po->operand[opr_num].type != OPT_CONST)
982 ferr(po, "opr %d: const expected\n", opr_num);
983 return po->operand[opr_num].val;
986 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
988 if ((unsigned int)popr->reg >= MAX_REGS)
989 ferr(po, "invalid reg: %d\n", popr->reg);
990 return regs_r32[popr->reg];
993 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1002 namelen = strlen(name);
1004 p = strchr(name, '+');
1008 ferr(po, "equ parse failed for '%s'\n", name);
1010 if (IS_START(p, "0x"))
1012 *extra_offs = strtol(p, &endp, 16);
1014 ferr(po, "equ parse failed for '%s'\n", name);
1017 for (i = 0; i < g_eqcnt; i++)
1018 if (strncmp(g_eqs[i].name, name, namelen) == 0
1019 && g_eqs[i].name[namelen] == 0)
1023 ferr(po, "unresolved equ name: '%s'\n", name);
1030 static void stack_frame_access(struct parsed_op *po,
1031 enum opr_lenmod lmod, char *buf, size_t buf_size,
1032 const char *name, int is_src, int is_lea)
1034 const char *prefix = "";
1035 struct parsed_equ *eq;
1036 int i, arg_i, arg_s;
1042 bp_arg = parse_stack_el(name);
1043 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1044 eq = equ_find(po, bp_arg, &offset);
1046 ferr(po, "detected but missing eq\n");
1048 offset += eq->offset;
1050 if (!strncmp(name, "ebp", 3))
1053 if (stack_ra <= offset && offset < stack_ra + 4)
1054 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1056 if (offset > stack_ra) {
1057 arg_i = (offset - stack_ra - 4) / 4;
1058 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
1059 ferr(po, "offset %d (%s) doesn't map to any arg\n",
1062 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
1063 if (g_func_pp.arg[i].reg != NULL)
1069 if (i == g_func_pp.argc)
1070 ferr(po, "arg %d not in prototype?\n", arg_i);
1072 ferr(po, "lea to arg?\n");
1074 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
1077 if (g_stack_fsz == 0)
1078 ferr(po, "stack var access without stackframe\n");
1080 sf_ofs = g_stack_fsz + offset;
1082 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1090 snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
1093 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1096 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1099 ferr(po, "bp_stack bad lmod: %d\n", lmod);
1104 static char *out_src_opr(char *buf, size_t buf_size,
1105 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
1107 char tmp1[256], tmp2[256];
1111 switch (popr->type) {
1114 ferr(po, "lea from reg?\n");
1116 switch (popr->lmod) {
1118 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1121 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1124 if (popr->name[1] == 'h') // XXX..
1125 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1127 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1130 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1135 if (parse_stack_el(popr->name)) {
1136 stack_frame_access(po, popr->lmod, buf, buf_size,
1137 popr->name, 1, is_lea);
1141 strcpy(expr, popr->name);
1142 if (strchr(expr, '[')) {
1143 // special case: '[' can only be left for label[reg] form
1144 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1146 ferr(po, "parse failure for '%s'\n", expr);
1147 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1150 // XXX: do we need more parsing?
1152 snprintf(buf, buf_size, "%s", expr);
1156 snprintf(buf, buf_size, "%s(%s)",
1157 lmod_cast_u_ptr(po, popr->lmod), expr);
1162 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1164 snprintf(buf, buf_size, "(u32)%s", popr->name);
1169 ferr(po, "lea an offset?\n");
1170 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1175 ferr(po, "lea from const?\n");
1177 printf_number(buf, buf_size, popr->val);
1181 ferr(po, "invalid src type: %d\n", popr->type);
1187 static char *out_dst_opr(char *buf, size_t buf_size,
1188 struct parsed_op *po, struct parsed_opr *popr)
1190 switch (popr->type) {
1192 switch (popr->lmod) {
1194 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1198 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1202 if (popr->name[1] == 'h') // XXX..
1203 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1205 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1208 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1213 if (parse_stack_el(popr->name)) {
1214 stack_frame_access(po, popr->lmod, buf, buf_size,
1219 return out_src_opr(buf, buf_size, po, popr, 0);
1222 snprintf(buf, buf_size, "%s", popr->name);
1226 ferr(po, "invalid dst type: %d\n", popr->type);
1232 static enum parsed_flag_op split_cond(struct parsed_op *po,
1233 enum op_op op, int *is_inv)
1285 ferr(po, "split_cond: bad op %d\n", op);
1290 static void out_test_for_cc(char *buf, size_t buf_size,
1291 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1292 enum opr_lenmod lmod, const char *expr)
1294 const char *cast, *scast;
1296 cast = lmod_cast_u(po, lmod);
1297 scast = lmod_cast_s(po, lmod);
1301 case PFO_BE: // CF=1||ZF=1; CF=0
1302 snprintf(buf, buf_size, "(%s%s %s 0)",
1303 cast, expr, is_inv ? "!=" : "==");
1307 case PFO_L: // SF!=OF; OF=0
1308 snprintf(buf, buf_size, "(%s%s %s 0)",
1309 scast, expr, is_inv ? ">=" : "<");
1312 case PFO_LE: // ZF=1||SF!=OF; OF=0
1313 snprintf(buf, buf_size, "(%s%s %s 0)",
1314 scast, expr, is_inv ? ">" : "<=");
1318 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1322 static void out_cmp_for_cc(char *buf, size_t buf_size,
1323 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1324 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1326 const char *cast, *scast;
1328 cast = lmod_cast_u(po, lmod);
1329 scast = lmod_cast_s(po, lmod);
1333 // note: must be unsigned compare
1334 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1335 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1339 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1340 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1344 // note: must be unsigned compare
1345 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1346 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1349 // note: must be signed compare
1351 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1352 scast, expr1, expr2, is_inv ? ">=" : "<");
1356 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1357 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1361 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1362 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1366 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1370 static void out_cmp_test(char *buf, size_t buf_size,
1371 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1373 char buf1[256], buf2[256], buf3[256];
1375 if (po->op == OP_TEST) {
1376 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1377 out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
1380 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1381 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
1382 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1384 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1385 po->operand[0].lmod, buf3);
1387 else if (po->op == OP_CMP) {
1388 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1389 out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
1390 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1391 po->operand[0].lmod, buf2, buf3);
1394 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1397 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1398 struct parsed_opr *popr2)
1400 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1401 ferr(po, "missing lmod for both operands\n");
1403 if (popr1->lmod == OPLM_UNSPEC)
1404 popr1->lmod = popr2->lmod;
1405 else if (popr2->lmod == OPLM_UNSPEC)
1406 popr2->lmod = popr1->lmod;
1407 else if (popr1->lmod != popr2->lmod)
1408 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1411 static const char *op_to_c(struct parsed_op *po)
1435 ferr(po, "op_to_c was supplied with %d\n", po->op);
1439 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1440 enum op_flags flag_check)
1442 if (po->flags & flag)
1443 ferr(po, "flag %x already set\n", flag);
1444 if (po->flags & flag_check)
1445 ferr(po, "flag_check %x already set\n", flag_check);
1450 static int scan_for_pop(int i, int opcnt, const char *reg,
1451 int magic, int depth, int *maxdepth, int do_flags)
1453 struct parsed_op *po;
1456 for (; i < opcnt; i++) {
1458 if (po->cc_scratch == magic)
1459 break; // already checked
1460 po->cc_scratch = magic;
1462 if (po->flags & OPF_TAIL)
1463 return -1; // deadend
1465 if ((po->flags & OPF_RMD)
1466 || (po->op == OP_PUSH && po->argmask)) // arg push
1469 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1471 ferr(po, "dead branch\n");
1475 if (po->flags & OPF_CC) {
1476 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1477 depth, maxdepth, do_flags);
1479 return ret; // dead end
1487 if ((po->op == OP_POP || po->op == OP_PUSH)
1488 && po->operand[0].type == OPT_REG
1489 && IS(po->operand[0].name, reg))
1491 if (po->op == OP_PUSH) {
1493 if (depth > *maxdepth)
1496 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1498 else if (depth == 0) {
1500 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1505 if (depth < 0) // should not happen
1506 ferr(po, "fail with depth\n");
1508 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1516 // scan for pop starting from 'ret' op (all paths)
1517 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1523 for (; i < opcnt; i++) {
1524 if (!(ops[i].flags & OPF_TAIL))
1527 for (j = i - 1; j >= 0; j--) {
1528 if (ops[j].flags & OPF_RMD)
1530 if (ops[j].flags & OPF_JMP)
1533 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1534 && IS(ops[j].operand[0].name, reg))
1537 ops[j].flags |= flag_set;
1541 if (g_labels[j][0] != 0)
1546 return found ? 0 : -1;
1549 // is operand 'opr modified' by parsed_op 'po'?
1550 static int is_opr_modified(const struct parsed_opr *opr,
1551 const struct parsed_op *po)
1553 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1556 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1557 if (po->regmask_dst & (1 << opr->reg))
1563 return IS(po->operand[0].name, opr->name);
1566 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1567 static int is_any_opr_modified(const struct parsed_op *po_test,
1568 const struct parsed_op *po)
1572 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1575 if (po_test->regmask_src & po->regmask_dst)
1578 for (i = 0; i < po_test->operand_cnt; i++)
1579 if (IS(po_test->operand[i].name, po->operand[0].name))
1585 // scan for any po_test operand modification in range given
1586 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1588 for (; i < opcnt; i++) {
1589 if (is_any_opr_modified(po_test, &ops[i]))
1596 // scan for po_test operand[0] modification in range given
1597 static int scan_for_mod_opr0(struct parsed_op *po_test,
1600 for (; i < opcnt; i++) {
1601 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1608 static int scan_for_flag_set(int i)
1610 for (; i >= 0; i--) {
1611 if (ops[i].flags & OPF_FLAGS)
1614 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1616 if (g_labels[i][0] != 0)
1623 // scan back for cdq, if anything modifies edx, fail
1624 static int scan_for_cdq_edx(int i)
1626 for (; i >= 0; i--) {
1627 if (ops[i].op == OP_CDQ)
1630 if (ops[i].regmask_dst & (1 << xDX))
1632 if (g_labels[i][0] != 0)
1639 static int scan_for_reg_clear(int i, int reg)
1641 for (; i >= 0; i--) {
1642 if (ops[i].op == OP_XOR
1643 && ops[i].operand[0].lmod == OPLM_DWORD
1644 && ops[i].operand[0].reg == ops[i].operand[1].reg
1645 && ops[i].operand[0].reg == reg)
1648 if (ops[i].regmask_dst & (1 << reg))
1650 if (g_labels[i][0] != 0)
1657 // scan for positive, constant esp adjust
1658 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1660 for (; i < opcnt; i++) {
1661 if (ops[i].op == OP_ADD && ops[i].operand[0].reg == xSP) {
1662 if (ops[i].operand[1].type != OPT_CONST)
1663 ferr(&ops[i], "non-const esp adjust?\n");
1664 *adj = ops[i].operand[1].val;
1666 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1670 if ((ops[i].flags & (OPF_JMP|OPF_TAIL))
1671 || ops[i].op == OP_PUSH || ops[i].op == OP_POP)
1673 if (g_labels[i][0] != 0)
1680 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1682 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1683 struct parsed_opr *last_arith_dst = NULL;
1684 char buf1[256], buf2[256], buf3[256];
1685 struct parsed_proto *pp, *pp_tmp;
1686 const char *tmpname;
1687 enum parsed_flag_op pfo;
1688 int save_arg_vars = 0;
1689 int cmp_result_vars = 0;
1690 int need_mul_var = 0;
1692 int regmask_save = 0;
1693 int regmask_arg = 0;
1705 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
1707 ret = proto_parse(fhdr, funcn, &g_func_pp);
1709 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1711 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
1712 for (i = 0; i < g_func_pp.argc; i++) {
1714 fprintf(fout, ", ");
1715 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
1717 fprintf(fout, ")\n{\n");
1720 // - handle ebp/esp frame, remove ops related to it
1721 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1722 && ops[1].op == OP_MOV
1723 && IS(opr_name(&ops[1], 0), "ebp")
1724 && IS(opr_name(&ops[1], 1), "esp"))
1729 ops[0].flags |= OPF_RMD;
1730 ops[1].flags |= OPF_RMD;
1732 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1733 g_stack_fsz = opr_const(&ops[2], 1);
1734 ops[2].flags |= OPF_RMD;
1737 // another way msvc builds stack frame..
1739 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1741 ops[i].flags |= OPF_RMD;
1750 for (; i < opcnt; i++)
1751 if (ops[i].op == OP_RET)
1753 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
1756 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1757 ferr(&ops[i - 1], "'pop ebp' expected\n");
1758 ops[i - 1].flags |= OPF_RMD;
1760 if (g_stack_fsz != 0) {
1761 if (ops[i - 2].op != OP_MOV
1762 || !IS(opr_name(&ops[i - 2], 0), "esp")
1763 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1765 ferr(&ops[i - 2], "esp restore expected\n");
1767 ops[i - 2].flags |= OPF_RMD;
1769 if (ecx_push && ops[i - 3].op == OP_POP
1770 && IS(opr_name(&ops[i - 3], 0), "ecx"))
1772 ferr(&ops[i - 3], "unexpected ecx pop\n");
1778 } while (i < opcnt);
1781 for (i = 0; i < opcnt; i++) {
1782 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
1784 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
1785 && ops[i].operand[1].type == OPT_CONST)
1794 g_stack_fsz = ops[i].operand[1].val;
1795 ops[i].flags |= OPF_RMD;
1799 for (; i < opcnt; i++)
1800 if (ops[i].op == OP_RET)
1802 if (ops[i - 1].op != OP_ADD
1803 || !IS(opr_name(&ops[i - 1], 0), "esp")
1804 || ops[i - 1].operand[1].type != OPT_CONST
1805 || ops[i - 1].operand[1].val != g_stack_fsz)
1806 ferr(&ops[i - 1], "'add esp' expected\n");
1807 ops[i - 1].flags |= OPF_RMD;
1810 } while (i < opcnt);
1815 // - resolve all branches
1816 for (i = 0; i < opcnt; i++) {
1820 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
1821 || po->op == OP_CALL || po->op == OP_RET)
1824 for (j = 0; j < opcnt; j++) {
1825 if (g_labels[j][0] && IS(po->operand[0].name, g_labels[j])) {
1827 po->lrl = g_label_refs[j];
1828 g_label_refs[j] = po;
1833 if (po->bt_i == -1) {
1836 po->flags |= OPF_TAIL;
1842 for (i = 0; i < opcnt; i++)
1845 if (po->flags & OPF_RMD)
1848 if (po->op == OP_CALL)
1850 pp = calloc(1, sizeof(*pp));
1851 my_assert_not(pp, NULL);
1852 tmpname = opr_name(po, 0);
1853 if (po->operand[0].type != OPT_LABEL)
1855 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
1857 ferr(po, "non-__cdecl indirect call unhandled yet\n");
1859 if (j > ARRAY_SIZE(pp->arg))
1860 ferr(po, "esp adjust too large?\n");
1861 pp->ret_type = strdup("int");
1862 pp->argc = pp->argc_stack = j;
1863 for (arg = 0; arg < pp->argc; arg++)
1864 pp->arg[arg].type = strdup("int");
1867 ret = proto_parse(fhdr, tmpname, pp);
1869 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
1872 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
1874 if (pp->argc_stack != j / 4)
1875 ferr(po, "stack tracking failed: %x %x\n",
1877 ops[ret].flags |= OPF_RMD;
1880 // can't call functions with non-__cdecl callbacks yet
1881 for (arg = 0; arg < pp->argc; arg++) {
1882 if (pp->arg[arg].fptr != NULL) {
1883 pp_tmp = pp->arg[arg].fptr;
1884 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
1885 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
1889 for (arg = 0; arg < pp->argc; arg++)
1890 if (pp->arg[arg].reg == NULL)
1893 for (j = i; j >= 0 && arg < pp->argc; )
1895 if (g_labels[j][0] != 0) {
1896 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
1897 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
1899 // follow the branch in reverse
1900 if (g_label_refs[j] == NULL)
1901 ferr(po, "no refs for '%s'?\n", g_labels[j]);
1902 if (g_label_refs[j]->lrl != NULL)
1903 ferr(po, "unhandled multiple fefs to '%s'\n", g_labels[j]);
1904 j = (g_label_refs[j] - ops) + 1;
1911 if (ops[j].op == OP_CALL)
1913 pp_tmp = ops[j].datap;
1915 ferr(po, "arg collect hit unparsed call\n");
1916 if (pp_tmp->argc_stack > 0)
1917 ferr(po, "arg collect hit '%s' with %d stack args\n",
1918 opr_name(&ops[j], 0), pp_tmp->argc_stack);
1920 else if ((ops[j].flags & OPF_TAIL)
1921 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
1925 else if (ops[j].op == OP_PUSH)
1927 pp->arg[arg].datap = &ops[j];
1928 ret = scan_for_mod(&ops[j], j + 1, i);
1930 // mark this push as one that needs operand saving
1931 ops[j].flags &= ~OPF_RMD;
1932 ops[j].argmask |= 1 << arg;
1933 save_arg_vars |= 1 << arg;
1936 ops[j].flags |= OPF_RMD;
1939 for (arg++; arg < pp->argc; arg++)
1940 if (pp->arg[arg].reg == NULL)
1945 ferr(po, "arg collect failed for '%s': %d/%d\n",
1946 tmpname, arg, pp->argc);
1952 // - find POPs for PUSHes, rm both
1953 // - scan for all used registers
1954 // - find flag set ops for their users
1955 // - declare indirect functions
1956 for (i = 0; i < opcnt; i++) {
1958 if (po->flags & OPF_RMD)
1961 if (po->op == OP_PUSH
1962 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
1963 && po->operand[0].type == OPT_REG)
1965 reg = po->operand[0].reg;
1967 ferr(po, "reg not set for push?\n");
1970 ret = scan_for_pop(i + 1, opcnt,
1971 po->operand[0].name, i + opcnt, 0, &depth, 0);
1974 ferr(po, "too much depth: %d\n", depth);
1976 regmask_save |= 1 << reg;
1978 po->flags |= OPF_RMD;
1979 scan_for_pop(i + 1, opcnt, po->operand[0].name,
1980 i + opcnt * 2, 0, &depth, 1);
1983 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
1986 if (regmask & (1 << reg)) {
1987 if (regmask_save & (1 << reg))
1988 ferr(po, "%s already saved?\n", po->operand[0].name);
1992 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
1997 regmask |= po->regmask_src | po->regmask_dst;
1999 if (po->flags & OPF_CC)
2001 ret = scan_for_flag_set(i - 1);
2003 ferr(po, "unable to trace flag setter\n");
2005 tmp_op = &ops[ret]; // flag setter
2006 pfo = split_cond(po, po->op, &dummy);
2009 // to get nicer code, we try to delay test and cmp;
2010 // if we can't because of operand modification, or if we
2011 // have math op, make it calculate flags explicitly
2012 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2013 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
2017 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2018 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
2022 tmp_op->pfomask |= pfomask;
2023 cmp_result_vars |= pfomask;
2027 if (po->op == OP_ADC || po->op == OP_SBB)
2028 cmp_result_vars |= 1 << PFO_C;
2030 else if (po->op == OP_MUL
2031 || (po->op == OP_IMUL && po->operand_cnt == 1))
2035 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2037 my_assert_not(pp, NULL);
2038 fprintf(fout, " %s (*icall%d)(", pp->ret_type, i);
2039 for (j = 0; j < pp->argc; j++) {
2041 fprintf(fout, ", ");
2042 fprintf(fout, "%s a%d", pp->arg[j].type, j + 1);
2044 fprintf(fout, ");\n");
2048 // declare stack frame
2050 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2051 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2053 // declare arg-registers
2054 for (i = 0; i < g_func_pp.argc; i++) {
2055 if (g_func_pp.arg[i].reg != NULL) {
2056 reg = char_array_i(regs_r32,
2057 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
2059 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
2061 regmask_arg |= 1 << reg;
2062 fprintf(fout, " u32 %s = (u32)a%d;\n",
2063 g_func_pp.arg[i].reg, i + 1);
2068 // declare other regs - special case for eax
2069 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
2070 fprintf(fout, " u32 eax = 0;\n");
2074 regmask &= ~regmask_arg;
2075 regmask &= ~(1 << xSP);
2077 regmask &= ~(1 << xBP);
2079 for (reg = 0; reg < 8; reg++) {
2080 if (regmask & (1 << reg)) {
2081 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2088 for (reg = 0; reg < 8; reg++) {
2089 if (regmask_save & (1 << reg)) {
2090 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2096 if (save_arg_vars) {
2097 for (reg = 0; reg < 32; reg++) {
2098 if (save_arg_vars & (1 << reg)) {
2099 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2105 if (cmp_result_vars) {
2106 for (i = 0; i < 8; i++) {
2107 if (cmp_result_vars & (1 << i)) {
2108 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2115 fprintf(fout, " u64 mul_tmp;\n");
2120 fprintf(fout, "\n");
2123 for (i = 0; i < opcnt; i++)
2125 if (g_labels[i][0] != 0 && g_label_refs[i] != NULL)
2126 fprintf(fout, "\n%s:\n", g_labels[i]);
2129 if (po->flags & OPF_RMD)
2134 #define assert_operand_cnt(n_) \
2135 if (po->operand_cnt != n_) \
2136 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2138 // conditional/flag using op?
2139 if (po->flags & OPF_CC)
2144 pfo = split_cond(po, po->op, &is_inv);
2146 // we go through all this trouble to avoid using parsed_flag_op,
2147 // which makes generated code much nicer
2148 if (delayed_flag_op != NULL)
2150 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2153 else if (last_arith_dst != NULL
2154 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2156 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
2157 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2158 last_arith_dst->lmod, buf3);
2161 else if (po->datap != NULL) {
2162 // use preprocessed results
2164 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2165 ferr(po, "not prepared for pfo %d\n", pfo);
2167 // note: is_inv was not yet applied
2168 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2169 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2172 ferr(po, "all methods of finding comparison failed\n");
2175 if (po->flags & OPF_JMP) {
2176 fprintf(fout, " if %s\n", buf1);
2178 else if (po->op == OP_ADC || po->op == OP_SBB) {
2180 fprintf(fout, " cond_%s = %s;\n",
2181 parsed_flag_op_names[pfo], buf1);
2183 else if (po->flags & OPF_DATA) { // SETcc
2184 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2185 fprintf(fout, " %s = %s;", buf2, buf1);
2188 ferr(po, "unhandled conditional op\n");
2192 pfomask = po->pfomask;
2197 assert_operand_cnt(2);
2198 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2199 fprintf(fout, " %s = %s%s;",
2200 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2201 po->operand[0].is_ptr ? "(void *)" : "",
2202 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2206 assert_operand_cnt(2);
2207 po->operand[1].lmod = OPLM_DWORD; // always
2208 fprintf(fout, " %s = %s;",
2209 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2210 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
2214 assert_operand_cnt(2);
2215 fprintf(fout, " %s = %s;",
2216 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2217 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2221 assert_operand_cnt(2);
2222 switch (po->operand[1].lmod) {
2224 strcpy(buf3, "(s8)");
2227 strcpy(buf3, "(s16)");
2230 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2232 fprintf(fout, " %s = %s%s;",
2233 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2235 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2239 assert_operand_cnt(1);
2240 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2241 fprintf(fout, " %s = ~%s;", buf1, buf1);
2245 assert_operand_cnt(2);
2246 fprintf(fout, " %s = (s32)%s >> 31;",
2247 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2248 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2249 strcpy(g_comment, "cdq");
2254 assert_operand_cnt(3);
2255 if (po->flags & OPF_REP) {
2256 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2257 lmod_bytes(po, po->operand[0].lmod));
2258 fprintf(fout, " %sedi = eax;",
2259 lmod_cast_u_ptr(po, po->operand[0].lmod));
2260 strcpy(g_comment, "rep stos");
2263 fprintf(fout, " %sedi = eax; edi += %d;",
2264 lmod_cast_u_ptr(po, po->operand[0].lmod),
2265 lmod_bytes(po, po->operand[0].lmod));
2266 strcpy(g_comment, "stos");
2272 assert_operand_cnt(3);
2273 j = lmod_bytes(po, po->operand[0].lmod);
2274 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2275 if (po->flags & OPF_REP) {
2277 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2280 " %sedi = %sesi;", buf1, buf1);
2281 strcpy(g_comment, "rep movs");
2284 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2286 strcpy(g_comment, "movs");
2290 // arithmetic w/flags
2295 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2300 assert_operand_cnt(2);
2301 fprintf(fout, " %s %s= %s;",
2302 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2304 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2305 last_arith_dst = &po->operand[0];
2306 delayed_flag_op = NULL;
2310 assert_operand_cnt(2);
2311 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2312 fprintf(fout, " %s = %s%s >> %s;", buf1,
2313 lmod_cast_s(po, po->operand[0].lmod), buf1,
2314 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2315 last_arith_dst = &po->operand[0];
2316 delayed_flag_op = NULL;
2321 assert_operand_cnt(2);
2322 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2323 if (po->operand[1].type == OPT_CONST) {
2324 j = po->operand[1].val;
2325 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2326 fprintf(fout, po->op == OP_ROL ?
2327 " %s = (%s << %d) | (%s >> %d);" :
2328 " %s = (%s >> %d) | (%s << %d);",
2329 buf1, buf1, j, buf1,
2330 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2334 last_arith_dst = &po->operand[0];
2335 delayed_flag_op = NULL;
2339 assert_operand_cnt(2);
2340 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2341 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2342 // special case for XOR
2343 fprintf(fout, " %s = 0;",
2344 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2345 last_arith_dst = &po->operand[0];
2346 delayed_flag_op = NULL;
2353 assert_operand_cnt(2);
2354 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2355 fprintf(fout, " %s %s= %s + cond_c;",
2356 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2358 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2359 last_arith_dst = &po->operand[0];
2360 delayed_flag_op = NULL;
2365 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2366 if (po->operand[0].type == OPT_REG) {
2367 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2368 fprintf(fout, " %s%s;", buf1, buf2);
2371 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2372 fprintf(fout, " %s %s= 1;", buf1, buf2);
2374 last_arith_dst = &po->operand[0];
2375 delayed_flag_op = NULL;
2379 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2380 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
2381 fprintf(fout, " %s = -%s%s;", buf1,
2382 lmod_cast_s(po, po->operand[0].lmod), buf2);
2383 last_arith_dst = &po->operand[0];
2384 delayed_flag_op = NULL;
2385 if (pfomask & (1 << PFO_C)) {
2386 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2387 pfomask &= ~(1 << PFO_C);
2392 if (po->operand_cnt == 2)
2394 if (po->operand_cnt == 3)
2395 ferr(po, "TODO imul3\n");
2398 assert_operand_cnt(1);
2399 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2400 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
2401 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0));
2402 fprintf(fout, " edx = mul_tmp >> 32;\n");
2403 fprintf(fout, " eax = mul_tmp;");
2404 last_arith_dst = NULL;
2405 delayed_flag_op = NULL;
2410 assert_operand_cnt(1);
2411 if (po->operand[0].lmod != OPLM_DWORD)
2412 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2414 // 32bit division is common, look for it
2415 if (po->op == OP_DIV)
2416 ret = scan_for_reg_clear(i - 1, xDX);
2418 ret = scan_for_cdq_edx(i - 1);
2420 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2421 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2422 po->op == OP_IDIV));
2423 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2424 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2427 ferr(po, "TODO 64bit divident\n");
2428 last_arith_dst = NULL;
2429 delayed_flag_op = NULL;
2434 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2436 for (j = 0; j < 8; j++) {
2437 if (pfomask & (1 << j)) {
2438 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2439 fprintf(fout, " cond_%s = %s;",
2440 parsed_flag_op_names[j], buf1);
2447 delayed_flag_op = po;
2450 // note: we reuse OP_Jcc for SETcc, only flags differ
2451 case OP_JO ... OP_JG:
2452 if (po->flags & OPF_JMP)
2453 fprintf(fout, " goto %s;", po->operand[0].name);
2454 // else SETcc - should already be handled
2458 assert_operand_cnt(1);
2459 if (po->operand[0].type != OPT_LABEL)
2460 ferr(po, "unhandled call type\n");
2462 fprintf(fout, " goto %s;", po->operand[0].name);
2466 assert_operand_cnt(1);
2469 ferr(po, "NULL pp\n");
2471 if (po->operand[0].type != OPT_LABEL)
2472 fprintf(fout, " icall%d = (void *)%s;\n", i,
2473 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
2476 if (!IS(pp->ret_type, "void")) {
2477 if (po->flags & OPF_TAIL)
2478 fprintf(fout, "return ");
2480 fprintf(fout, "eax = ");
2481 if (strchr(pp->ret_type, '*'))
2482 fprintf(fout, "(u32)");
2485 if (po->operand[0].type != OPT_LABEL) {
2486 fprintf(fout, "icall%d(", i);
2489 if (pp->name[0] == 0)
2490 ferr(po, "missing pp->name\n");
2491 fprintf(fout, "%s(", pp->name);
2494 for (arg = 0; arg < pp->argc; arg++) {
2496 fprintf(fout, ", ");
2498 if (strchr(pp->arg[arg].type, '*'))
2499 fprintf(fout, "(%s)", pp->arg[arg].type);
2501 if (pp->arg[arg].reg != NULL) {
2502 fprintf(fout, "%s", pp->arg[arg].reg);
2507 tmp_op = pp->arg[arg].datap;
2509 ferr(po, "parsed_op missing for arg%d\n", arg);
2510 if (tmp_op->argmask) {
2511 fprintf(fout, "s_a%d", arg + 1);
2515 out_src_opr(buf1, sizeof(buf1),
2516 tmp_op, &tmp_op->operand[0], 0));
2519 fprintf(fout, ");");
2521 if (po->flags & OPF_TAIL) {
2522 strcpy(g_comment, "tailcall");
2523 if (IS(pp->ret_type, "void"))
2524 fprintf(fout, "\n return;");
2526 delayed_flag_op = NULL;
2527 last_arith_dst = NULL;
2531 if (IS(g_func_pp.ret_type, "void"))
2532 fprintf(fout, " return;");
2533 else if (strchr(g_func_pp.ret_type, '*'))
2534 fprintf(fout, " return (%s)eax;",
2535 g_func_pp.ret_type);
2537 fprintf(fout, " return eax;");
2542 // special case - saved func arg
2543 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2544 for (j = 0; j < 32; j++) {
2545 if (po->argmask & (1 << j))
2546 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
2550 else if (po->flags & OPF_RSAVE) {
2551 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2552 fprintf(fout, " s_%s = %s;", buf1, buf1);
2555 ferr(po, "stray push encountered\n");
2559 if (po->flags & OPF_RSAVE) {
2560 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2561 fprintf(fout, " %s = s_%s;", buf1, buf1);
2564 ferr(po, "stray pop encountered\n");
2572 ferr(po, "unhandled op type %d, flags %x\n",
2577 if (g_comment[0] != 0) {
2578 fprintf(fout, " // %s", g_comment);
2583 fprintf(fout, "\n");
2586 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
2588 // see is delayed flag stuff is still valid
2589 if (delayed_flag_op != NULL && delayed_flag_op != po) {
2590 if (is_any_opr_modified(delayed_flag_op, po))
2591 delayed_flag_op = NULL;
2594 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
2595 if (is_opr_modified(last_arith_dst, po))
2596 last_arith_dst = NULL;
2600 fprintf(fout, "}\n\n");
2603 for (i = 0; i < opcnt; i++) {
2604 if (ops[i].op == OP_CALL) {
2612 proto_release(&g_func_pp);
2615 static void set_label(int i, const char *name)
2621 p = strchr(name, ':');
2625 if (len > sizeof(g_labels[0]) - 1)
2626 aerr("label '%s' too long: %d\n", name, len);
2627 if (g_labels[i][0] != 0)
2628 aerr("dupe label '%s'?\n", name);
2629 memcpy(g_labels[i], name, len);
2630 g_labels[i][len] = 0;
2633 // '=' needs special treatment..
2634 static char *next_word_s(char *w, size_t wsize, char *s)
2640 for (i = 0; i < wsize - 1; i++) {
2641 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
2647 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
2648 printf("warning: '%s' truncated\n", w);
2653 static int cmpstringp(const void *p1, const void *p2)
2655 return strcmp(*(char * const *)p1, *(char * const *)p2);
2658 int main(int argc, char *argv[])
2660 FILE *fout, *fasm, *frlist;
2662 char words[16][256];
2663 int ida_func_attr = 0;
2666 int skip_warned = 0;
2668 char **rlist = NULL;
2670 int rlist_alloc = 0;
2679 if (argv[1] && IS(argv[1], "-v")) {
2684 if (argc < arg + 3) {
2685 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
2692 asmfn = argv[arg++];
2693 fasm = fopen(asmfn, "r");
2694 my_assert_not(fasm, NULL);
2696 hdrfn = argv[arg++];
2697 g_fhdr = fopen(hdrfn, "r");
2698 my_assert_not(g_fhdr, NULL);
2701 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
2702 my_assert_not(rlist, NULL);
2703 // needs special handling..
2704 rlist[rlist_len++] = "__alloca_probe";
2706 for (; arg < argc; arg++) {
2707 frlist = fopen(argv[arg], "r");
2708 my_assert_not(frlist, NULL);
2710 while (fgets(line, sizeof(line), frlist)) {
2712 if (*p == 0 || *p == ';' || *p == '#')
2715 p = next_word(words[0], sizeof(words[0]), p);
2716 if (words[0][0] == 0)
2719 if (rlist_len >= rlist_alloc) {
2720 rlist_alloc = rlist_alloc * 2 + 64;
2721 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
2722 my_assert_not(rlist, NULL);
2724 rlist[rlist_len++] = strdup(words[0]);
2732 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
2734 fout = fopen(argv[arg_out], "w");
2735 my_assert_not(fout, NULL);
2738 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
2739 my_assert_not(g_eqs, NULL);
2741 while (fgets(line, sizeof(line), fasm))
2750 static const char *attrs[] = {
2758 if (p[2] != 'A' || strncmp(p, "; Attributes:", 13) != 0)
2761 // parse IDA's attribute-list comment
2764 // get rid of random tabs
2765 for (i = 0; p[i] != 0; i++)
2769 for (; *p != 0; p = sskip(p)) {
2770 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
2771 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
2772 ida_func_attr |= 1 << i;
2773 p += strlen(attrs[i]);
2777 if (i == ARRAY_SIZE(attrs)) {
2778 anote("unparsed IDA attr: %s\n", p);
2781 if (IS(attrs[i], "fpd=")) {
2782 p = next_word(words[0], sizeof(words[0]), p);
2790 memset(words, 0, sizeof(words));
2791 for (wordc = 0; wordc < 16; wordc++) {
2792 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
2793 if (*p == 0 || *p == ';') {
2799 // alow asm patches in comments
2800 if (*p == ';' && IS_START(p, "; sctpatch: ")) {
2802 if (*p == 0 || *p == ';')
2804 goto parse_words; // lame
2809 awarn("wordc == 0?\n");
2813 // don't care about this:
2814 if (words[0][0] == '.'
2815 || IS(words[0], "include")
2816 || IS(words[0], "assume") || IS(words[1], "segment")
2817 || IS(words[0], "align"))
2822 if (IS(words[1], "proc")) {
2824 aerr("proc '%s' while in_func '%s'?\n",
2827 if ((ida_func_attr & IDAFA_THUNK)
2828 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
2830 strcpy(g_func, words[0]);
2831 set_label(0, words[0]);
2836 if (IS(words[1], "endp")) {
2838 aerr("endp '%s' while not in_func?\n", words[0]);
2839 if (!IS(g_func, words[0]))
2840 aerr("endp '%s' while in_func '%s'?\n",
2843 if (in_func && !skip_func)
2844 gen_func(fout, g_fhdr, g_func, pi);
2851 memset(&ops, 0, pi * sizeof(ops[0]));
2852 memset(g_labels, 0, pi * sizeof(g_labels[0]));
2853 memset(g_label_refs, 0, pi * sizeof(g_label_refs[0]));
2861 p = strchr(words[0], ':');
2863 set_label(pi, words[0]);
2867 if (!in_func || skip_func) {
2868 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
2870 anote("skipping from '%s'\n", g_labels[pi]);
2873 g_labels[pi][0] = 0;
2877 if (IS(words[1], "=")) {
2879 aerr("unhandled equ, wc=%d\n", wordc);
2880 if (g_eqcnt >= eq_alloc) {
2882 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
2883 my_assert_not(g_eqs, NULL);
2886 len = strlen(words[0]);
2887 if (len > sizeof(g_eqs[0].name) - 1)
2888 aerr("equ name too long: %d\n", len);
2889 strcpy(g_eqs[g_eqcnt].name, words[0]);
2891 if (!IS(words[3], "ptr"))
2892 aerr("unhandled equ\n");
2893 if (IS(words[2], "dword"))
2894 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
2895 else if (IS(words[2], "word"))
2896 g_eqs[g_eqcnt].lmod = OPLM_WORD;
2897 else if (IS(words[2], "byte"))
2898 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
2900 aerr("bad lmod: '%s'\n", words[2]);
2902 g_eqs[g_eqcnt].offset = parse_number(words[4]);
2907 if (pi >= ARRAY_SIZE(ops))
2908 aerr("too many ops\n");
2910 parse_op(&ops[pi], words, wordc);
2921 // vim:ts=2:shiftwidth=2:expandtab