9 #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
10 #define IS(w, y) !strcmp(w, y)
12 #include "protoparse.h"
17 #define anote(fmt, ...) \
18 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
19 #define awarn(fmt, ...) \
20 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
21 #define aerr(fmt, ...) do { \
22 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
28 OPF_RMD = (1 << 0), /* removed or optimized out */
29 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
30 OPF_FLAGS = (1 << 2), /* sets flags */
31 OPF_JMP = (1 << 3), /* branches, ret and call */
32 OPF_CC = (1 << 4), /* uses flags */
33 OPF_TAIL = (1 << 5), /* ret or tail call */
34 OPF_REP = (1 << 6), /* prefixed by rep */
105 #define MAX_OPERANDS 3
109 enum opr_lenmod lmod;
117 struct parsed_opr operand[MAX_OPERANDS];
120 int regmask_src; // all referensed regs
122 int pfomask; // flagop: parsed_flag_op that can't be delayed
123 int argmask; // push: args that are altered before call
124 int cc_scratch; // scratch storage during analysis
125 int bt_i; // branch target (for branches)
126 struct parsed_op *lrl; // label reference list entry
131 // OP_CALL - ptr to parsed_proto
132 // (OPF_CC) - point to corresponding (OPF_FLAGS)
136 enum opr_lenmod lmod;
142 static struct parsed_op ops[MAX_OPS];
143 static struct parsed_equ *g_eqs;
145 static char g_labels[MAX_OPS][32];
146 static struct parsed_op *g_label_refs[MAX_OPS];
147 static struct parsed_proto g_func_pp;
148 static char g_func[256];
149 static char g_comment[256];
150 static int g_bp_frame;
151 static int g_bp_stack;
152 #define ferr(op_, fmt, ...) do { \
153 printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
154 dump_op(op_), ##__VA_ARGS__); \
161 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
162 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
163 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
164 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
166 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
168 // possible basic comparison types (without inversion)
169 enum parsed_flag_op {
173 PFO_BE, // 6 CF=1||ZF=1
177 PFO_LE, // e ZF=1||SF!=OF
180 static const char *parsed_flag_op_names[] = {
181 "o", "c", "z", "be", "s", "p", "l", "le"
184 static int char_array_i(const char *array[], size_t len, const char *s)
188 for (i = 0; i < len; i++)
195 static void printf_number(char *buf, size_t buf_size, long number)
197 // output in C-friendly form
198 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
201 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
205 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
207 *reg_lmod = OPLM_DWORD;
210 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
212 *reg_lmod = OPLM_WORD;
215 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
217 *reg_lmod = OPLM_BYTE;
220 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
222 *reg_lmod = OPLM_BYTE;
229 static long parse_number(const char *number)
231 int len = strlen(number);
232 const char *p = number;
242 if (len > 1 && *p == '0')
244 if (number[len - 1] == 'h') {
245 ret = strtol(p, &endp, 16);
246 bad = (*endp != 'h');
249 ret = strtol(p, &endp, 10);
253 aerr("number parsing failed\n");
259 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
261 enum opr_lenmod lmod;
274 while (my_isblank(*s))
276 for (; my_issep(*s); d++, s++)
278 while (my_isblank(*s))
283 if (!strncmp(s, "ds:", 3))
286 s = next_idt(w, sizeof(w), s);
291 reg = parse_reg(&lmod, w);
293 *regmask |= 1 << reg;
297 if ('0' <= w[0] && w[0] <= '9') {
298 number = parse_number(w);
299 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
303 // probably some label/identifier - pass
306 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
310 strcpy(name, cvtbuf);
315 static int guess_lmod_from_name(struct parsed_opr *opr)
317 if (!strncmp(opr->name, "dword_", 6)) {
318 opr->lmod = OPLM_DWORD;
321 if (!strncmp(opr->name, "word_", 5)) {
322 opr->lmod = OPLM_WORD;
325 if (!strncmp(opr->name, "byte_", 5)) {
326 opr->lmod = OPLM_BYTE;
332 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
338 *regmask |= 1 << reg;
341 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name);
343 static int parse_operand(struct parsed_opr *opr,
344 int *regmask, int *regmask_indirect,
345 char words[16][256], int wordc, int w, unsigned int op_flags)
347 enum opr_lenmod tmplmod;
353 aerr("parse_operand w %d, wordc %d\n", w, wordc);
357 for (i = w; i < wordc; i++) {
358 len = strlen(words[i]);
359 if (words[i][len - 1] == ',') {
360 words[i][len - 1] = 0;
366 if (op_flags & OPF_JMP) {
369 if (wordc - w == 3 && IS(words[w + 1], "ptr"))
370 label = words[w + 2];
371 else if (wordc - w == 2 && IS(words[w], "short"))
372 label = words[w + 1];
373 else if (wordc - w == 1)
376 aerr("jump parse error");
378 opr->type = OPT_LABEL;
379 strcpy(opr->name, label);
383 if (wordc - w >= 3) {
384 if (IS(words[w + 1], "ptr")) {
385 if (IS(words[w], "dword"))
386 opr->lmod = OPLM_DWORD;
387 else if (IS(words[w], "word"))
388 opr->lmod = OPLM_WORD;
389 else if (IS(words[w], "byte"))
390 opr->lmod = OPLM_BYTE;
392 aerr("type parsing failed\n");
397 if (wordc - w == 2 && IS(words[w], "offset")) {
398 opr->type = OPT_OFFSET;
399 strcpy(opr->name, words[w + 1]);
404 aerr("parse_operand 1 word expected\n");
406 strcpy(opr->name, words[w]);
408 if (words[w][0] == '[') {
409 opr->type = OPT_REGMEM;
410 ret = sscanf(words[w], "[%[^]]]", opr->name);
412 aerr("[] parse failure\n");
414 parse_indmode(opr->name, regmask_indirect, 1);
415 if (opr->lmod == OPLM_UNSPEC && !strncmp(opr->name, "ebp+", 4)) {
417 struct parsed_equ *eq = equ_find(NULL, opr->name + 4);
419 opr->lmod = eq->lmod;
423 else if (strchr(words[w], '[')) {
425 opr->type = OPT_REGMEM;
426 if (opr->lmod == OPLM_UNSPEC)
427 guess_lmod_from_name(opr);
428 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
431 else if (('0' <= words[w][0] && words[w][0] <= '9')
432 || words[w][0] == '-')
434 number = parse_number(words[w]);
435 opr->type = OPT_CONST;
437 printf_number(opr->name, sizeof(opr->name), number);
441 ret = parse_reg(&tmplmod, opr->name);
443 setup_reg_opr(opr, ret, tmplmod, regmask);
447 // most likely var in data segment
448 opr->type = OPT_LABEL;
449 if (opr->lmod == OPLM_UNSPEC)
450 guess_lmod_from_name(opr);
451 if (opr->lmod != OPLM_UNSPEC)
454 // TODO: scan data seg to determine type?
458 static const struct {
465 static const struct {
472 { "nop", OP_NOP, 0, 0, 0 },
473 { "push", OP_PUSH, 1, 1, 0 },
474 { "pop", OP_POP, 1, 1, OPF_DATA },
475 { "mov" , OP_MOV, 2, 2, OPF_DATA },
476 { "lea", OP_LEA, 2, 2, OPF_DATA },
477 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
478 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
479 { "not", OP_NOT, 1, 1, OPF_DATA },
480 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
481 { "stosb",OP_STOS, 0, 0, OPF_DATA },
482 { "stosw",OP_STOS, 0, 0, OPF_DATA },
483 { "stosd",OP_STOS, 0, 0, OPF_DATA },
484 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
485 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
486 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
487 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
488 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
489 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
490 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
491 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
492 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
493 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
494 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
495 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
496 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
497 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
498 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
499 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
500 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
501 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
502 { "test", OP_TEST, 2, 2, OPF_FLAGS },
503 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
504 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
505 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS },
506 { "jmp", OP_JMP, 1, 1, OPF_JMP },
507 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
508 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
509 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
510 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
511 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
512 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
513 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
514 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
515 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
516 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
517 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
518 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
519 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
520 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
521 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
522 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
523 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
524 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
525 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
526 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
527 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
528 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
529 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
530 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
531 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
532 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
533 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
534 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
535 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
536 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
537 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
538 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
539 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
540 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
541 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
542 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
543 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
544 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
545 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
546 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
547 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
548 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
549 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
550 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
551 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
552 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
553 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
554 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
555 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
556 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
557 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
558 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
559 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
560 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
561 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
562 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
563 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
566 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
568 enum opr_lenmod lmod;
569 int prefix_flags = 0;
577 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
578 if (IS(words[w], pref_table[i].name)) {
579 prefix_flags = pref_table[i].flags;
586 aerr("lone prefix: '%s'\n", words[0]);
591 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
592 if (IS(words[w], op_table[i].name))
596 if (i == ARRAY_SIZE(op_table))
597 aerr("unhandled op: '%s'\n", words[0]);
600 op->op = op_table[i].op;
601 op->flags = op_table[i].flags | prefix_flags;
602 op->regmask_src = op->regmask_dst = 0;
604 for (opr = 0; opr < op_table[i].minopr; opr++) {
605 regmask = regmask_ind = 0;
606 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
607 words, wordc, w, op->flags);
609 if (opr == 0 && (op->flags & OPF_DATA))
610 op->regmask_dst = regmask;
611 // for now, mark dst as src too
612 op->regmask_src |= regmask | regmask_ind;
615 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
616 w = parse_operand(&op->operand[opr],
617 &op->regmask_src, &op->regmask_src,
618 words, wordc, w, op->flags);
622 aerr("parse_op %s incomplete: %d/%d\n",
626 op->operand_cnt = opr;
627 if (!strncmp(op_table[i].name, "set", 3))
628 op->operand[0].lmod = OPLM_BYTE;
630 // ops with implicit argumets
634 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
635 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
639 if (op->operand_cnt != 0)
641 if (IS(words[op_w], "stosb"))
643 else if (IS(words[op_w], "stosw"))
645 else if (IS(words[op_w], "stosd"))
648 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_dst);
649 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_dst);
650 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
654 if (op->operand_cnt != 1)
659 op->regmask_dst = (1 << xDX) | (1 << xAX);
660 op->regmask_src |= (1 << xAX);
661 if (op->operand[0].lmod == OPLM_UNSPEC)
662 op->operand[0].lmod = OPLM_DWORD;
667 // we could set up operands for edx:eax, but there is no real need to
668 // (see is_opr_modified())
669 regmask = (1 << xDX) | (1 << xAX);
670 op->regmask_dst = regmask;
671 op->regmask_src |= regmask;
672 if (op->operand[0].lmod == OPLM_UNSPEC)
673 op->operand[0].lmod = OPLM_DWORD;
679 if (op->operand[1].lmod == OPLM_UNSPEC)
680 op->operand[1].lmod = OPLM_BYTE;
688 static const char *op_name(enum op_op op)
692 for (i = 0; i < ARRAY_SIZE(op_table); i++)
693 if (op_table[i].op == op)
694 return op_table[i].name;
700 static const char *dump_op(struct parsed_op *po)
702 static char out[128];
706 snprintf(out, sizeof(out), "%s", op_name(po->op));
707 for (i = 0; i < po->operand_cnt; i++) {
711 snprintf(p, sizeof(out) - (p - out),
712 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
713 po->operand[i].name);
719 static const char *opr_name(struct parsed_op *po, int opr_num)
721 if (opr_num >= po->operand_cnt)
722 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
723 return po->operand[opr_num].name;
726 static unsigned int opr_const(struct parsed_op *po, int opr_num)
728 if (opr_num >= po->operand_cnt)
729 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
730 if (po->operand[opr_num].type != OPT_CONST)
731 ferr(po, "opr %d: const expected\n", opr_num);
732 return po->operand[opr_num].val;
735 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
737 if ((unsigned int)popr->reg >= MAX_REGS)
738 ferr(po, "invalid reg: %d\n", popr->reg);
739 return regs_r32[popr->reg];
742 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name)
746 for (i = 0; i < g_eqcnt; i++)
747 if (IS(g_eqs[i].name, name))
751 ferr(po, "unresolved equ name: '%s'\n", name);
758 static void bg_frame_access(struct parsed_op *po, enum opr_lenmod lmod,
759 char *buf, size_t buf_size, const char *bp_arg,
760 int is_src, int is_lea)
762 const char *prefix = "";
763 struct parsed_equ *eq;
767 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
769 eq = equ_find(po, bp_arg);
771 if (eq->offset >= 0) {
772 arg_i = eq->offset / 4 - 2;
773 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
774 ferr(po, "offset %d doesn't map to any arg\n", eq->offset);
776 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
777 if (g_func_pp.arg[i].reg != NULL)
783 if (i == g_func_pp.argc)
784 ferr(po, "arg %d not in prototype?\n", arg_i);
786 ferr(po, "lea to arg?\n");
788 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
792 ferr(po, "bp_stack access after it was not detected\n");
794 sf_ofs = g_bp_stack + eq->offset;
796 ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_bp_stack);
804 snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
807 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
810 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
813 ferr(po, "bp_stack bad lmod: %d\n", lmod);
818 static char *out_src_opr(char *buf, size_t buf_size,
819 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
821 const char *cast = "";
822 char tmp1[256], tmp2[256];
826 switch (popr->type) {
829 ferr(po, "lea from reg?\n");
831 switch (popr->lmod) {
833 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
836 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
839 if (popr->name[1] == 'h') // XXX..
840 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
842 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
845 ferr(po, "invalid src lmod: %d\n", popr->lmod);
850 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
851 bg_frame_access(po, popr->lmod, buf, buf_size,
852 popr->name + 4, 1, is_lea);
856 strcpy(expr, popr->name);
857 if (strchr(expr, '[')) {
858 // special case: '[' can only be left for label[reg] form
859 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
861 ferr(po, "parse failure for '%s'\n", expr);
862 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
865 // XXX: do we need more parsing?
867 snprintf(buf, buf_size, "%s", expr);
871 switch (popr->lmod) {
882 ferr(po, "invalid lmod: %d\n", popr->lmod);
884 snprintf(buf, buf_size, "%s(%s)", cast, expr);
889 snprintf(buf, buf_size, "(u32)&%s", popr->name);
891 snprintf(buf, buf_size, "(u32)%s", popr->name);
896 ferr(po, "lea an offset?\n");
897 snprintf(buf, buf_size, "(u32)&%s", popr->name);
902 ferr(po, "lea from const?\n");
904 printf_number(buf, buf_size, popr->val);
908 ferr(po, "invalid src type: %d\n", popr->type);
914 static char *out_dst_opr(char *buf, size_t buf_size,
915 struct parsed_op *po, struct parsed_opr *popr)
917 switch (popr->type) {
919 switch (popr->lmod) {
921 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
925 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
929 if (popr->name[1] == 'h') // XXX..
930 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
932 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
935 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
940 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
941 bg_frame_access(po, popr->lmod, buf, buf_size,
942 popr->name + 4, 0, 0);
946 return out_src_opr(buf, buf_size, po, popr, 0);
949 ferr(po, "invalid dst type: %d\n", popr->type);
955 static const char *lmod_cast_u(struct parsed_op *po,
956 enum opr_lenmod lmod)
966 ferr(po, "invalid lmod: %d\n", lmod);
967 return "(_invalid_)";
971 static const char *lmod_cast_s(struct parsed_op *po,
972 enum opr_lenmod lmod)
982 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
983 return "(_invalid_)";
987 static const char *lmod_cast(struct parsed_op *po,
988 enum opr_lenmod lmod, int is_signed)
991 lmod_cast_s(po, lmod) :
992 lmod_cast_u(po, lmod);
995 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1005 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1010 static enum parsed_flag_op split_cond(struct parsed_op *po,
1011 enum op_op op, int *is_inv)
1063 ferr(po, "split_cond: bad op %d\n", op);
1068 static void out_test_for_cc(char *buf, size_t buf_size,
1069 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1070 enum opr_lenmod lmod, const char *expr)
1072 const char *cast, *scast;
1074 cast = lmod_cast_u(po, lmod);
1075 scast = lmod_cast_s(po, lmod);
1079 case PFO_BE: // CF=1||ZF=1; CF=0
1080 snprintf(buf, buf_size, "(%s%s %s 0)",
1081 cast, expr, is_inv ? "!=" : "==");
1085 case PFO_L: // SF!=OF; OF=0
1086 snprintf(buf, buf_size, "(%s%s %s 0)",
1087 scast, expr, is_inv ? ">=" : "<");
1090 case PFO_LE: // ZF=1||SF!=OF; OF=0
1091 snprintf(buf, buf_size, "(%s%s %s 0)",
1092 scast, expr, is_inv ? ">" : "<=");
1096 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1100 static void out_cmp_for_cc(char *buf, size_t buf_size,
1101 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1102 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1104 const char *cast, *scast;
1106 cast = lmod_cast_u(po, lmod);
1107 scast = lmod_cast_s(po, lmod);
1111 // note: must be unsigned compare
1112 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1113 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1117 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1118 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1122 // note: must be unsigned compare
1123 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1124 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1127 // note: must be signed compare
1129 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1130 scast, expr1, expr2, is_inv ? ">=" : "<");
1134 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1135 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1139 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1140 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1144 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1148 static void out_cmp_test(char *buf, size_t buf_size,
1149 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1151 char buf1[256], buf2[256], buf3[256];
1153 if (po->op == OP_TEST) {
1154 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1155 out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
1158 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1159 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
1160 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1162 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1163 po->operand[0].lmod, buf3);
1165 else if (po->op == OP_CMP) {
1166 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1167 out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
1168 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1169 po->operand[0].lmod, buf2, buf3);
1172 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1175 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1176 struct parsed_opr *popr2)
1178 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1179 ferr(po, "missing lmod for both operands\n");
1181 if (popr1->lmod == OPLM_UNSPEC)
1182 popr1->lmod = popr2->lmod;
1183 else if (popr2->lmod == OPLM_UNSPEC)
1184 popr2->lmod = popr1->lmod;
1185 else if (popr1->lmod != popr2->lmod)
1186 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1189 static const char *op_to_c(struct parsed_op *po)
1213 ferr(po, "op_to_c was supplied with %d\n", po->op);
1217 static int scan_for_pop(int i, int opcnt, const char *reg,
1218 int magic, int do_patch)
1220 struct parsed_op *po;
1223 for (; i < opcnt; i++) {
1225 if (po->cc_scratch == magic)
1226 break; // already checked
1227 po->cc_scratch = magic;
1229 if (po->flags & OPF_TAIL)
1230 return -1; // deadend
1232 if (po->flags & OPF_RMD)
1235 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1237 ferr(po, "dead branch\n");
1241 if (po->flags & OPF_CC) {
1242 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic, do_patch);
1244 return ret; // dead end
1252 if (po->op == OP_POP && po->operand[0].type == OPT_REG
1253 && IS(po->operand[0].name, reg))
1256 po->flags |= OPF_RMD;
1264 // scan for pop starting from 'ret' op (all paths)
1265 static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch)
1270 for (; i < opcnt; i++) {
1271 if (!(ops[i].flags & OPF_TAIL))
1274 for (j = i - 1; j >= 0; j--) {
1275 if (ops[j].flags & OPF_RMD)
1277 if (ops[j].flags & OPF_JMP)
1280 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1281 && IS(ops[j].operand[0].name, reg))
1285 ops[j].flags |= OPF_RMD;
1289 if (g_labels[j][0] != 0)
1294 return found ? 0 : -1;
1297 // is operand 'opr modified' by parsed_op 'po'?
1298 static int is_opr_modified(const struct parsed_opr *opr,
1299 const struct parsed_op *po)
1301 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1304 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1305 if (po->regmask_dst & (1 << opr->reg))
1311 return IS(po->operand[0].name, opr->name);
1314 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1315 static int is_any_opr_modified(const struct parsed_op *po_test,
1316 const struct parsed_op *po)
1320 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1323 if (po_test->regmask_src & po->regmask_dst)
1326 for (i = 0; i < po_test->operand_cnt; i++)
1327 if (IS(po_test->operand[i].name, po->operand[0].name))
1333 // scan for any po_test operand modification in range given
1334 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1336 for (; i < opcnt; i++) {
1337 if (is_any_opr_modified(po_test, &ops[i]))
1344 // scan for po_test operand[0] modification in range given
1345 static int scan_for_mod_opr0(struct parsed_op *po_test,
1348 for (; i < opcnt; i++) {
1349 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1356 static int scan_for_flag_set(int i)
1358 for (; i >= 0; i--) {
1359 if (ops[i].flags & OPF_FLAGS)
1362 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1364 if (g_labels[i][0] != 0)
1371 // scan back for cdq, if anything modifies edx, fail
1372 static int scan_for_cdq_edx(int i)
1374 for (; i >= 0; i--) {
1375 if (ops[i].op == OP_CDQ)
1378 if (ops[i].regmask_dst & (1 << xDX))
1380 if (g_labels[i][0] != 0)
1387 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1389 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1390 struct parsed_opr *last_arith_dst = NULL;
1391 char buf1[256], buf2[256], buf3[256];
1392 struct parsed_proto *pp, *pp_tmp;
1393 const char *tmpname;
1394 enum parsed_flag_op pfo;
1395 int save_arg_vars = 0;
1396 int cmp_result_vars = 0;
1397 int need_mul_var = 0;
1399 int regmask_arg = 0;
1409 g_bp_frame = g_bp_stack = 0;
1411 ret = proto_parse(fhdr, funcn, &g_func_pp);
1413 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1415 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
1416 for (i = 0; i < g_func_pp.argc; i++) {
1418 fprintf(fout, ", ");
1419 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
1421 fprintf(fout, ")\n{\n");
1424 // - handle ebp frame, remove ops related to it
1425 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1426 && ops[1].op == OP_MOV
1427 && IS(opr_name(&ops[1], 0), "ebp")
1428 && IS(opr_name(&ops[1], 1), "esp"))
1433 ops[0].flags |= OPF_RMD;
1434 ops[1].flags |= OPF_RMD;
1436 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1437 g_bp_stack = opr_const(&ops[2], 1);
1438 ops[2].flags |= OPF_RMD;
1441 // another way msvc builds stack frame..
1443 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1445 ops[i].flags |= OPF_RMD;
1453 for (; i < opcnt; i++)
1454 if (ops[i].op == OP_RET)
1456 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1457 ferr(&ops[i - 1], "'pop ebp' expected\n");
1458 ops[i - 1].flags |= OPF_RMD;
1460 if (g_bp_stack != 0) {
1461 if (ops[i - 2].op != OP_MOV
1462 || !IS(opr_name(&ops[i - 2], 0), "esp")
1463 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1465 ferr(&ops[i - 2], "esp restore expected\n");
1467 ops[i - 2].flags |= OPF_RMD;
1469 if (ecx_push && ops[i - 3].op == OP_POP
1470 && IS(opr_name(&ops[i - 3], 0), "ecx"))
1472 ferr(&ops[i - 3], "unexpected ecx pop\n");
1477 } while (i < opcnt);
1481 // - resolve all branches
1482 for (i = 0; i < opcnt; i++) {
1486 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
1487 || po->op == OP_CALL || po->op == OP_RET)
1490 for (j = 0; j < opcnt; j++) {
1491 if (g_labels[j][0] && IS(po->operand[0].name, g_labels[j])) {
1493 po->lrl = g_label_refs[j];
1494 g_label_refs[j] = po;
1499 if (po->bt_i == -1) {
1502 po->flags |= OPF_TAIL;
1507 // - find POPs for PUSHes, rm both
1508 // - scan for all used registers
1509 // - find flag set ops for their users
1511 for (i = 0; i < opcnt; i++) {
1513 if (po->flags & OPF_RMD)
1516 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG) {
1517 if (po->operand[0].reg < 0)
1518 ferr(po, "reg not set for push?\n");
1519 if (!(regmask & (1 << po->operand[0].reg))) { // reg save
1520 ret = scan_for_pop(i + 1, opcnt,
1521 po->operand[0].name, i + opcnt, 0);
1523 po->flags |= OPF_RMD;
1524 scan_for_pop(i + 1, opcnt, po->operand[0].name,
1528 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
1530 po->flags |= OPF_RMD;
1531 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 1);
1537 regmask |= po->regmask_src | po->regmask_dst;
1539 if (po->flags & OPF_CC)
1541 ret = scan_for_flag_set(i - 1);
1543 ferr(po, "unable to trace flag setter\n");
1545 tmp_op = &ops[ret]; // flag setter
1546 pfo = split_cond(po, po->op, &dummy);
1549 // to get nicer code, we try to delay test and cmp;
1550 // if we can't because of operand modification, or if we
1551 // have math op, make it calculate flags explicitly
1552 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
1553 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
1557 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
1558 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
1562 tmp_op->pfomask |= pfomask;
1563 cmp_result_vars |= pfomask;
1567 if (po->op == OP_ADC || po->op == OP_SBB)
1568 cmp_result_vars |= 1 << PFO_C;
1570 else if (po->op == OP_CALL)
1572 pp = malloc(sizeof(*pp));
1573 my_assert_not(pp, NULL);
1574 tmpname = opr_name(&ops[i], 0);
1575 ret = proto_parse(fhdr, tmpname, pp);
1577 ferr(po, "proto_parse failed for '%s'\n", tmpname);
1579 for (arg = 0; arg < pp->argc; arg++)
1580 if (pp->arg[arg].reg == NULL)
1583 for (j = i - 1; j >= 0 && arg < pp->argc; j--) {
1584 if (ops[j].op == OP_CALL) {
1585 pp_tmp = ops[j].datap;
1587 ferr(po, "arg collect hit unparsed call\n");
1588 if (pp_tmp->argc_stack > 0)
1589 ferr(po, "arg collect hit '%s' with %d stack args\n",
1590 opr_name(&ops[j], 0), pp_tmp->argc_stack);
1592 else if ((ops[j].flags & OPF_TAIL)
1593 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
1598 if (ops[j].op == OP_PUSH) {
1599 pp->arg[arg].datap = &ops[j];
1600 ret = scan_for_mod(&ops[j], j + 1, i);
1602 // mark this push as one that needs operand saving
1603 ops[j].argmask |= 1 << arg;
1604 save_arg_vars |= 1 << arg;
1607 ops[j].flags |= OPF_RMD;
1610 for (arg++; arg < pp->argc; arg++)
1611 if (pp->arg[arg].reg == NULL)
1615 if (g_labels[j][0] != 0) {
1616 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
1617 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
1619 // follow the branch in reverse
1620 if (g_label_refs[j] == NULL)
1621 ferr(po, "no refs for '%s'?\n", g_labels[j]);
1622 if (g_label_refs[j]->lrl != NULL)
1623 ferr(po, "unhandled multiple fefs to '%s'\n", g_labels[j]);
1624 j = (g_label_refs[j] - ops) + 1;
1631 ferr(po, "arg collect failed for '%s'\n", tmpname);
1634 else if (po->op == OP_MUL
1635 || (po->op == OP_IMUL && po->operand_cnt == 1))
1641 // declare stack frame
1643 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
1644 (g_bp_stack + 3) / 4, (g_bp_stack + 1) / 2, g_bp_stack);
1646 // declare arg-registers
1647 for (i = 0; i < g_func_pp.argc; i++) {
1648 if (g_func_pp.arg[i].reg != NULL) {
1649 reg = char_array_i(regs_r32,
1650 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
1652 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
1654 regmask_arg |= 1 << reg;
1655 fprintf(fout, " u32 %s = (u32)a%d;\n",
1656 g_func_pp.arg[i].reg, i + 1);
1661 // declare other regs - special case for eax
1662 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
1663 fprintf(fout, " u32 eax = 0;\n");
1667 regmask &= ~regmask_arg;
1669 regmask &= ~(1 << xBP);
1671 for (reg = 0; reg < 8; reg++) {
1672 if (regmask & (1 << reg)) {
1673 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
1679 if (save_arg_vars) {
1680 for (reg = 0; reg < 32; reg++) {
1681 if (save_arg_vars & (1 << reg)) {
1682 fprintf(fout, " u32 s_a%d;\n", reg + 1);
1688 if (cmp_result_vars) {
1689 for (i = 0; i < 8; i++) {
1690 if (cmp_result_vars & (1 << i)) {
1691 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
1698 fprintf(fout, " u64 mul_tmp;\n");
1703 fprintf(fout, "\n");
1706 for (i = 0; i < opcnt; i++)
1708 if (g_labels[i][0] != 0)
1709 fprintf(fout, "\n%s:\n", g_labels[i]);
1712 if (po->flags & OPF_RMD)
1717 #define assert_operand_cnt(n_) \
1718 if (po->operand_cnt != n_) \
1719 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
1721 // conditional/flag using op?
1722 if (po->flags & OPF_CC)
1727 pfo = split_cond(po, po->op, &is_inv);
1729 // we go through all this trouble to avoid using parsed_flag_op,
1730 // which makes generated code much nicer
1731 if (delayed_flag_op != NULL)
1733 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
1736 else if (last_arith_dst != NULL
1737 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
1739 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
1740 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
1741 last_arith_dst->lmod, buf3);
1744 else if (po->datap != NULL) {
1745 // use preprocessed results
1747 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
1748 ferr(po, "not prepared for pfo %d\n", pfo);
1750 // note: is_inv was not yet applied
1751 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
1752 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
1755 ferr(po, "all methods of finding comparison failed\n");
1758 if (po->flags & OPF_JMP) {
1759 fprintf(fout, " if %s\n", buf1);
1761 else if (po->op == OP_ADC || po->op == OP_SBB) {
1763 fprintf(fout, " cond_%s = %s;\n",
1764 parsed_flag_op_names[pfo], buf1);
1766 else if (po->flags & OPF_DATA) { // SETcc
1767 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
1768 fprintf(fout, " %s = %s;", buf2, buf1);
1771 ferr(po, "unhandled conditional op\n");
1775 pfomask = po->pfomask;
1780 assert_operand_cnt(2);
1781 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1782 fprintf(fout, " %s = %s;",
1783 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1784 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1788 assert_operand_cnt(2);
1789 po->operand[1].lmod = OPLM_DWORD; // always
1790 fprintf(fout, " %s = %s;",
1791 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1792 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
1796 assert_operand_cnt(2);
1797 fprintf(fout, " %s = %s;",
1798 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1799 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1803 assert_operand_cnt(2);
1804 switch (po->operand[1].lmod) {
1806 strcpy(buf3, "(s8)");
1809 strcpy(buf3, "(s16)");
1812 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
1814 fprintf(fout, " %s = %s%s;",
1815 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1817 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1821 assert_operand_cnt(1);
1822 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1823 fprintf(fout, " %s = ~%s;", buf1, buf1);
1827 assert_operand_cnt(2);
1828 fprintf(fout, " %s = (s32)%s >> 31;",
1829 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1830 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1831 strcpy(g_comment, "cdq");
1836 assert_operand_cnt(3);
1837 if (po->flags & OPF_REP) {
1838 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
1839 lmod_bytes(po, po->operand[0].lmod));
1840 fprintf(fout, " *(u32 *)edi = eax;");
1841 strcpy(g_comment, "rep stos");
1844 fprintf(fout, " *(u32 *)edi = eax; edi += %d;",
1845 lmod_bytes(po, po->operand[0].lmod));
1846 strcpy(g_comment, "stos");
1850 // arithmetic w/flags
1855 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1860 assert_operand_cnt(2);
1861 fprintf(fout, " %s %s= %s;",
1862 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1864 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1865 last_arith_dst = &po->operand[0];
1866 delayed_flag_op = NULL;
1870 assert_operand_cnt(2);
1871 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1872 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1873 // special case for XOR
1874 fprintf(fout, " %s = 0;",
1875 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
1876 last_arith_dst = &po->operand[0];
1877 delayed_flag_op = NULL;
1883 assert_operand_cnt(2);
1884 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1885 fprintf(fout, " %s = %s%s >> %s;", buf1,
1886 lmod_cast_s(po, po->operand[0].lmod), buf1,
1887 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1888 last_arith_dst = &po->operand[0];
1889 delayed_flag_op = NULL;
1894 assert_operand_cnt(2);
1895 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1896 fprintf(fout, " %s %s= %s + cond_c;",
1897 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1899 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1900 last_arith_dst = &po->operand[0];
1901 delayed_flag_op = NULL;
1906 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1907 strcpy(buf2, po->op == OP_INC ? "++" : "--");
1908 fprintf(fout, " %s%s;", buf1, buf2);
1909 last_arith_dst = &po->operand[0];
1910 delayed_flag_op = NULL;
1914 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1915 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1916 fprintf(fout, " %s = -%s%s;", buf1,
1917 lmod_cast_s(po, po->operand[0].lmod), buf2);
1918 last_arith_dst = &po->operand[0];
1919 delayed_flag_op = NULL;
1920 if (pfomask & (1 << PFO_C)) {
1921 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
1922 pfomask &= ~(1 << PFO_C);
1927 if (po->operand_cnt == 2)
1929 if (po->operand_cnt == 3)
1930 ferr(po, "TODO imul3\n");
1933 assert_operand_cnt(1);
1934 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
1935 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
1936 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0));
1937 fprintf(fout, " edx = mul_tmp >> 32;\n");
1938 fprintf(fout, " eax = mul_tmp;");
1939 last_arith_dst = NULL;
1940 delayed_flag_op = NULL;
1945 assert_operand_cnt(1);
1946 if (po->operand[0].lmod != OPLM_DWORD)
1947 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
1949 // 32bit division is common, look for it
1950 if (scan_for_cdq_edx(i - 1) >= 0) {
1951 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1952 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
1953 po->op == OP_IDIV));
1954 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
1955 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
1958 ferr(po, "TODO 64bit divident\n");
1959 last_arith_dst = NULL;
1960 delayed_flag_op = NULL;
1965 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1967 for (j = 0; j < 8; j++) {
1968 if (pfomask & (1 << j)) {
1969 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
1970 fprintf(fout, " cond_%s = %s;",
1971 parsed_flag_op_names[j], buf1);
1978 delayed_flag_op = po;
1981 // note: we reuse OP_Jcc for SETcc, only flags differ
1982 case OP_JO ... OP_JG:
1983 if (po->flags & OPF_JMP)
1984 fprintf(fout, " goto %s;", po->operand[0].name);
1985 // else SETcc - should already be handled
1989 assert_operand_cnt(1);
1990 if (po->operand[0].type != OPT_LABEL)
1991 ferr(po, "unhandled call type\n");
1993 fprintf(fout, " goto %s;", po->operand[0].name);
1997 assert_operand_cnt(1);
1998 if (po->operand[0].type != OPT_LABEL)
1999 ferr(po, "unhandled call type\n");
2003 ferr(po, "NULL pp\n");
2006 if (!IS(pp->ret_type, "void")) {
2007 if (po->flags & OPF_TAIL)
2008 fprintf(fout, "return ");
2010 fprintf(fout, "eax = ");
2011 if (strchr(pp->ret_type, '*'))
2012 fprintf(fout, "(u32)");
2015 fprintf(fout, "%s(", opr_name(po, 0));
2016 for (arg = 0; arg < pp->argc; arg++) {
2018 fprintf(fout, ", ");
2020 if (strchr(pp->arg[arg].type, '*'))
2021 fprintf(fout, "(%s)", pp->arg[arg].type);
2023 if (pp->arg[arg].reg != NULL) {
2024 fprintf(fout, "%s", pp->arg[arg].reg);
2029 tmp_op = pp->arg[arg].datap;
2031 ferr(po, "parsed_op missing for arg%d\n", arg);
2032 if (tmp_op->argmask) {
2033 fprintf(fout, "s_a%d", arg + 1);
2037 out_src_opr(buf1, sizeof(buf1),
2038 tmp_op, &tmp_op->operand[0], 0));
2041 fprintf(fout, ");");
2043 if (po->flags & OPF_TAIL) {
2044 strcpy(g_comment, "tailcall");
2045 if (IS(pp->ret_type, "void"))
2046 fprintf(fout, "\n return;");
2048 delayed_flag_op = NULL;
2049 last_arith_dst = NULL;
2053 if (IS(g_func_pp.ret_type, "void"))
2054 fprintf(fout, " return;");
2056 fprintf(fout, " return eax;");
2061 // special case - saved func arg
2062 for (j = 0; j < 32; j++) {
2063 if (po->argmask & (1 << j)) {
2064 fprintf(fout, " s_a%d = %s;", j + 1,
2065 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
2070 ferr(po, "push encountered\n");
2074 ferr(po, "pop encountered\n");
2082 ferr(po, "unhandled op type %d, flags %x\n",
2087 if (g_comment[0] != 0) {
2088 fprintf(fout, " // %s", g_comment);
2093 fprintf(fout, "\n");
2096 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
2098 // see is delayed flag stuff is still valid
2099 if (delayed_flag_op != NULL && delayed_flag_op != po) {
2100 if (is_any_opr_modified(delayed_flag_op, po))
2101 delayed_flag_op = NULL;
2104 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
2105 if (is_opr_modified(last_arith_dst, po))
2106 last_arith_dst = NULL;
2110 fprintf(fout, "}\n\n");
2113 for (i = 0; i < opcnt; i++) {
2114 if (ops[i].op == OP_CALL) {
2122 proto_release(&g_func_pp);
2125 int main(int argc, char *argv[])
2127 FILE *fout, *fasm, *fhdr;
2129 char words[16][256];
2131 int skip_warned = 0;
2139 printf("usage:\n%s <.c> <.asm> <hdrf>\n",
2145 fhdr = fopen(hdrfn, "r");
2146 my_assert_not(fhdr, NULL);
2149 fasm = fopen(asmfn, "r");
2150 my_assert_not(fasm, NULL);
2152 fout = fopen(argv[1], "w");
2153 my_assert_not(fout, NULL);
2156 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
2157 my_assert_not(g_eqs, NULL);
2159 while (fgets(line, sizeof(line), fasm))
2164 if (*p == 0 || *p == ';')
2167 memset(words, 0, sizeof(words));
2168 for (wordc = 0; wordc < 16; wordc++) {
2169 p = sskip(next_word(words[wordc], sizeof(words[0]), p));
2170 if (*p == 0 || *p == ';') {
2178 awarn("wordc == 0?\n");
2182 // don't care about this:
2183 if (words[0][0] == '.'
2184 || IS(words[0], "include")
2185 || IS(words[0], "assume") || IS(words[1], "segment")
2186 || IS(words[0], "align"))
2191 if (IS(words[1], "proc")) {
2193 aerr("proc '%s' while in_func '%s'?\n",
2195 strcpy(g_func, words[0]);
2200 if (IS(words[1], "endp")) {
2202 aerr("endp '%s' while not in_func?\n", words[0]);
2203 if (!IS(g_func, words[0]))
2204 aerr("endp '%s' while in_func '%s'?\n",
2206 gen_func(fout, fhdr, g_func, pi);
2211 memset(&ops, 0, pi * sizeof(ops[0]));
2212 memset(g_labels, 0, pi * sizeof(g_labels[0]));
2213 memset(g_label_refs, 0, pi * sizeof(g_label_refs[0]));
2220 if (IS(words[1], "=")) {
2222 aerr("unhandled equ, wc=%d\n", wordc);
2223 if (g_eqcnt >= eq_alloc) {
2225 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
2226 my_assert_not(g_eqs, NULL);
2229 len = strlen(words[0]);
2230 if (len > sizeof(g_eqs[0].name) - 1)
2231 aerr("equ name too long: %d\n", len);
2232 strcpy(g_eqs[g_eqcnt].name, words[0]);
2234 if (!IS(words[3], "ptr"))
2235 aerr("unhandled equ\n");
2236 if (IS(words[2], "dword"))
2237 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
2238 else if (IS(words[2], "word"))
2239 g_eqs[g_eqcnt].lmod = OPLM_WORD;
2240 else if (IS(words[2], "byte"))
2241 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
2243 aerr("bad lmod: '%s'\n", words[2]);
2245 g_eqs[g_eqcnt].offset = parse_number(words[4]);
2250 if (pi >= ARRAY_SIZE(ops))
2251 aerr("too many ops\n");
2253 p = strchr(words[0], ':');
2256 if (len > sizeof(g_labels[0]) - 1)
2257 aerr("label too long: %d\n", len);
2258 if (g_labels[pi][0] != 0)
2259 aerr("dupe label?\n");
2260 memcpy(g_labels[pi], words[0], len);
2261 g_labels[pi][len] = 0;
2266 if (!skip_warned && g_labels[pi][0] != 0) {
2267 anote("skipping from '%s'\n", g_labels[pi]);
2270 g_labels[pi][0] = 0;
2274 parse_op(&ops[pi], words, wordc);
2285 // vim:ts=2:shiftwidth=2:expandtab