8 #define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
9 #define IS(w, y) !strcmp(w, y)
11 #include "protoparse.h"
16 #define awarn(fmt, ...) \
17 printf("warning:%s:%d: " fmt, asmfn, asmln, ##__VA_ARGS__)
18 #define aerr(fmt, ...) do { \
19 printf("error:%s:%d: " fmt, asmfn, asmln, ##__VA_ARGS__); \
24 OPF_RMD = (1 << 0), /* removed or optimized out */
25 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
26 OPF_FLAGS = (1 << 2), /* sets flags */
27 OPF_JMP = (1 << 3), /* branches, ret and call */
28 OPF_CC = (1 << 4), /* uses flags */
97 #define MAX_OPERANDS 3
101 enum opr_lenmod lmod;
109 struct parsed_opr operand[MAX_OPERANDS];
112 int regmask_src; // all referensed regs
114 int pfomask; // parsed_flag_op that can't be delayed
119 // OP_PUSH - arg number if arg is altered before call
120 // OP_CALL - ptr to parsed_proto
121 // (OPF_CC) - point to corresponding (OPF_FLAGS)
125 enum opr_lenmod lmod;
131 static struct parsed_op ops[MAX_OPS];
132 static struct parsed_equ *g_eqs;
134 static char g_labels[MAX_OPS][32];
135 static struct parsed_proto g_func_pp;
136 static char g_func[256];
137 static char g_comment[256];
138 static int g_bp_frame;
139 static int g_bp_stack;
140 #define ferr(op_, fmt, ...) do { \
141 printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
142 dump_op(op_), ##__VA_ARGS__); \
148 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
149 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
150 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
151 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
153 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
155 // possible basic comparison types (without inversion)
156 enum parsed_flag_op {
160 PFO_BE, // 6 CF=1||ZF=1
164 PFO_LE, // e ZF=1||SF!=OF
167 static const char *parsed_flag_op_names[] = {
168 "o", "c", "z", "be", "s", "p", "l", "le"
171 static int char_array_i(const char *array[], size_t len, const char *s)
175 for (i = 0; i < len; i++)
182 static void printf_number(char *buf, size_t buf_size, long number)
184 // output in C-friendly form
185 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
188 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
192 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
194 *reg_lmod = OPLM_DWORD;
197 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
199 *reg_lmod = OPLM_WORD;
202 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
204 *reg_lmod = OPLM_BYTE;
207 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
209 *reg_lmod = OPLM_BYTE;
216 static long parse_number(const char *number)
218 int len = strlen(number);
219 const char *p = number;
229 if (len > 1 && *p == '0')
231 if (number[len - 1] == 'h') {
232 ret = strtol(p, &endp, 16);
233 bad = (*endp != 'h');
236 ret = strtol(p, &endp, 10);
240 aerr("number parsing failed\n");
246 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
248 enum opr_lenmod lmod;
261 while (my_isblank(*s))
263 for (; my_issep(*s); d++, s++)
265 while (my_isblank(*s))
269 s = next_idt(w, sizeof(w), s);
274 reg = parse_reg(&lmod, w);
276 *regmask |= 1 << reg;
280 if ('0' <= w[0] && w[0] <= '9') {
281 number = parse_number(w);
282 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
286 // probably some label/identifier - pass
289 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
293 strcpy(name, cvtbuf);
298 static int guess_lmod_from_name(struct parsed_opr *opr)
300 if (!strncmp(opr->name, "dword_", 6)) {
301 opr->lmod = OPLM_DWORD;
304 if (!strncmp(opr->name, "word_", 5)) {
305 opr->lmod = OPLM_WORD;
308 if (!strncmp(opr->name, "byte_", 5)) {
309 opr->lmod = OPLM_BYTE;
315 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
321 *regmask |= 1 << reg;
324 static int parse_operand(struct parsed_opr *opr,
325 int *regmask, int *regmask_indirect,
326 char words[16][256], int wordc, int w, unsigned int op_flags)
328 enum opr_lenmod tmplmod;
334 aerr("parse_operand w %d, wordc %d\n", w, wordc);
338 for (i = w; i < wordc; i++) {
339 len = strlen(words[i]);
340 if (words[i][len - 1] == ',') {
341 words[i][len - 1] = 0;
347 if (op_flags & OPF_JMP) {
350 if (wordc - w == 3 && IS(words[w + 1], "ptr"))
351 label = words[w + 2];
352 else if (wordc - w == 2 && IS(words[w], "short"))
353 label = words[w + 1];
354 else if (wordc - w == 1)
357 aerr("jump parse error");
359 opr->type = OPT_LABEL;
360 strcpy(opr->name, label);
364 if (wordc - w >= 3) {
365 if (IS(words[w + 1], "ptr")) {
366 if (IS(words[w], "dword"))
367 opr->lmod = OPLM_DWORD;
368 else if (IS(words[w], "word"))
369 opr->lmod = OPLM_WORD;
370 else if (IS(words[w], "byte"))
371 opr->lmod = OPLM_BYTE;
373 aerr("type parsing failed\n");
378 if (wordc - w == 2 && IS(words[w], "offset")) {
379 opr->type = OPT_OFFSET;
380 strcpy(opr->name, words[w + 1]);
385 aerr("parse_operand 1 word expected\n");
387 strcpy(opr->name, words[w]);
389 if (words[w][0] == '[') {
390 opr->type = OPT_REGMEM;
391 ret = sscanf(words[w], "[%[^]]]", opr->name);
393 aerr("[] parse failure\n");
394 // only need the regmask
395 parse_indmode(opr->name, regmask_indirect, 1);
398 else if (strchr(words[w], '[')) {
400 opr->type = OPT_REGMEM;
401 if (opr->lmod == OPLM_UNSPEC)
402 guess_lmod_from_name(opr);
403 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
406 else if (('0' <= words[w][0] && words[w][0] <= '9')
407 || words[w][0] == '-')
409 number = parse_number(words[w]);
410 opr->type = OPT_CONST;
412 printf_number(opr->name, sizeof(opr->name), number);
416 ret = parse_reg(&tmplmod, opr->name);
418 setup_reg_opr(opr, ret, tmplmod, regmask);
422 // most likely var in data segment
423 opr->type = OPT_LABEL;
424 if (opr->lmod == OPLM_UNSPEC)
425 guess_lmod_from_name(opr);
426 if (opr->lmod != OPLM_UNSPEC)
429 // TODO: scan data seg to determine type?
433 static const struct {
440 { "push", OP_PUSH, 1, 1, 0 },
441 { "pop", OP_POP, 1, 1, OPF_DATA },
442 { "mov" , OP_MOV, 2, 2, OPF_DATA },
443 { "lea", OP_LEA, 2, 2, OPF_DATA },
444 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
445 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
446 { "not", OP_NOT, 1, 1, OPF_DATA },
447 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
448 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
449 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
450 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
451 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
452 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
453 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
454 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
455 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
456 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
457 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
458 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
459 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
460 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
461 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
462 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
463 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
464 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
465 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
466 { "test", OP_TEST, 2, 2, OPF_FLAGS },
467 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
468 { "retn", OP_RET, 0, 1, OPF_JMP },
469 { "call", OP_CALL, 1, 1, OPF_JMP },
470 { "jmp", OP_JMP, 1, 1, OPF_JMP },
471 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
472 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
473 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
474 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
475 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
476 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
477 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
478 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
479 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
480 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
481 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
482 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
483 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
484 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
485 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
486 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
487 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
488 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
489 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
490 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
491 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
492 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
493 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
494 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
495 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
496 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
497 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
498 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
499 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
500 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
501 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
502 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
503 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
504 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
505 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
506 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
507 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
508 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
509 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
510 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
511 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
512 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
513 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
514 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
515 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
516 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
517 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
518 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
519 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
520 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
521 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
522 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
523 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
524 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
525 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
526 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
529 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
537 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
538 if (IS(words[0], op_table[i].name))
542 if (i == ARRAY_SIZE(op_table))
543 aerr("unhandled op: '%s'\n", words[0]);
545 op->op = op_table[i].op;
546 op->flags = op_table[i].flags;
547 op->regmask_src = op->regmask_dst = 0;
549 for (opr = 0; opr < op_table[i].minopr; opr++) {
550 regmask = regmask_ind = 0;
551 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
552 words, wordc, w, op->flags);
554 if (opr == 0 && (op->flags & OPF_DATA))
555 op->regmask_dst = regmask;
556 // for now, mark dst as src too
557 op->regmask_src |= regmask | regmask_ind;
560 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
561 w = parse_operand(&op->operand[opr],
562 &op->regmask_src, &op->regmask_src,
563 words, wordc, w, op->flags);
567 aerr("parse_op %s incomplete: %d/%d\n",
571 op->operand_cnt = opr;
572 if (!strncmp(op_table[i].name, "set", 3))
573 op->operand[0].lmod = OPLM_BYTE;
575 // ops with implicit argumets
579 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
580 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
584 if (op->operand_cnt != 1)
589 op->regmask_dst = (1 << xDX) | (1 << xAX);
590 op->regmask_src |= (1 << xAX);
591 if (op->operand[0].lmod == OPLM_UNSPEC)
592 op->operand[0].lmod = OPLM_DWORD;
597 // we could set up operands for edx:eax, but there is no real need to
598 // (see is_opr_modified())
599 regmask = (1 << xDX) | (1 << xAX);
600 op->regmask_dst = regmask;
601 op->regmask_src |= regmask;
602 if (op->operand[0].lmod == OPLM_UNSPEC)
603 op->operand[0].lmod = OPLM_DWORD;
609 if (op->operand[1].lmod == OPLM_UNSPEC)
610 op->operand[1].lmod = OPLM_BYTE;
618 static const char *op_name(enum op_op op)
622 for (i = 0; i < ARRAY_SIZE(op_table); i++)
623 if (op_table[i].op == op)
624 return op_table[i].name;
630 static const char *dump_op(struct parsed_op *po)
632 static char out[128];
636 snprintf(out, sizeof(out), "%s", op_name(po->op));
637 for (i = 0; i < po->operand_cnt; i++) {
641 snprintf(p, sizeof(out) - (p - out),
642 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
643 po->operand[i].name);
649 static const char *opr_name(struct parsed_op *po, int opr_num)
651 if (opr_num >= po->operand_cnt)
652 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
653 return po->operand[opr_num].name;
656 static unsigned int opr_const(struct parsed_op *po, int opr_num)
658 if (opr_num >= po->operand_cnt)
659 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
660 if (po->operand[opr_num].type != OPT_CONST)
661 ferr(po, "opr %d: const expected\n", opr_num);
662 return po->operand[opr_num].val;
665 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
667 if ((unsigned int)popr->reg >= MAX_REGS)
668 ferr(po, "invalid reg: %d\n", popr->reg);
669 return regs_r32[popr->reg];
672 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name)
676 for (i = 0; i < g_eqcnt; i++)
677 if (IS(g_eqs[i].name, name))
680 ferr(po, "unresolved equ name: '%s'\n", name);
685 static void bg_frame_access(struct parsed_op *po, enum opr_lenmod lmod,
686 char *buf, size_t buf_size, const char *bp_arg,
687 int is_src, int is_lea)
689 const char *prefix = "";
690 struct parsed_equ *eq;
694 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
696 eq = equ_find(po, bp_arg);
698 if (eq->offset >= 0) {
699 arg_i = eq->offset / 4 - 2;
700 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
701 ferr(po, "offset %d doesn't map to any arg\n", eq->offset);
703 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
704 if (g_func_pp.arg[i].reg != NULL)
710 if (i == g_func_pp.argc)
711 ferr(po, "arg %d not in prototype?\n", arg_i);
713 ferr(po, "lea to arg?\n");
715 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
719 ferr(po, "bp_stack access after it was not detected\n");
721 sf_ofs = g_bp_stack + eq->offset;
723 ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_bp_stack);
731 snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
734 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
737 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
740 ferr(po, "bp_stack bad lmod: %d\n", lmod);
745 static char *out_src_opr(char *buf, size_t buf_size,
746 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
748 const char *cast = "";
749 char tmp1[256], tmp2[256];
753 switch (popr->type) {
756 ferr(po, "lea from reg?\n");
758 switch (popr->lmod) {
760 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
763 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
766 if (popr->name[1] == 'h') // XXX..
767 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
769 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
772 ferr(po, "invalid src lmod: %d\n", popr->lmod);
777 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
778 bg_frame_access(po, popr->lmod, buf, buf_size,
779 popr->name + 4, 1, is_lea);
783 strcpy(expr, popr->name);
784 if (strchr(expr, '[')) {
785 // special case: '[' can only be left for label[reg] form
786 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
788 ferr(po, "parse failure for '%s'\n", expr);
789 snprintf(expr, sizeof(expr), "(u32)%s + %s", tmp1, tmp2);
792 // XXX: do we need more parsing?
794 snprintf(buf, buf_size, "%s", expr);
798 switch (popr->lmod) {
809 ferr(po, "invalid lmod: %d\n", popr->lmod);
811 snprintf(buf, buf_size, "%s(%s)", cast, expr);
816 snprintf(buf, buf_size, "(u32)&%s", popr->name);
818 snprintf(buf, buf_size, "%s", popr->name);
823 ferr(po, "lea an offset?\n");
824 snprintf(buf, buf_size, "(u32)&%s", popr->name);
829 ferr(po, "lea from const?\n");
831 printf_number(buf, buf_size, popr->val);
835 ferr(po, "invalid src type: %d\n", popr->type);
841 static char *out_dst_opr(char *buf, size_t buf_size,
842 struct parsed_op *po, struct parsed_opr *popr)
844 switch (popr->type) {
846 switch (popr->lmod) {
848 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
852 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
856 if (popr->name[1] == 'h') // XXX..
857 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
859 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
862 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
867 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
868 bg_frame_access(po, popr->lmod, buf, buf_size,
869 popr->name + 4, 0, 0);
873 return out_src_opr(buf, buf_size, po, popr, 0);
876 ferr(po, "invalid dst type: %d\n", popr->type);
882 static const char *lmod_cast_u(struct parsed_op *po,
883 enum opr_lenmod lmod)
893 ferr(po, "invalid lmod: %d\n", lmod);
894 return "(_invalid_)";
898 static const char *lmod_cast_s(struct parsed_op *po,
899 enum opr_lenmod lmod)
909 ferr(po, "invalid lmod: %d\n", lmod);
910 return "(_invalid_)";
914 static const char *lmod_cast(struct parsed_op *po,
915 enum opr_lenmod lmod, int is_signed)
918 lmod_cast_s(po, lmod) :
919 lmod_cast_u(po, lmod);
922 static enum parsed_flag_op split_cond(struct parsed_op *po,
923 enum op_op op, int *is_neg)
975 ferr(po, "split_cond: bad op %d\n", op);
980 static void out_test_for_cc(char *buf, size_t buf_size,
981 struct parsed_op *po, enum parsed_flag_op pfo, int is_neg,
982 enum opr_lenmod lmod, const char *expr)
984 const char *cast, *scast;
986 cast = lmod_cast_u(po, lmod);
987 scast = lmod_cast_s(po, lmod);
991 snprintf(buf, buf_size, "(%s%s %s 0)",
992 cast, expr, is_neg ? "!=" : "==");
996 case PFO_L: // SF!=OF; OF=0
997 snprintf(buf, buf_size, "(%s%s %s 0)",
998 scast, expr, is_neg ? ">=" : "<");
1001 case PFO_LE: // ZF=1||SF!=OF; OF=0 after test
1002 snprintf(buf, buf_size, "(%s%s %s 0)",
1003 scast, expr, is_neg ? ">" : "<=");
1007 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1011 static void out_cmp_for_cc(char *buf, size_t buf_size,
1012 struct parsed_op *po, enum parsed_flag_op pfo, int is_neg,
1013 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1015 const char *cast, *scast;
1017 cast = lmod_cast_u(po, lmod);
1018 scast = lmod_cast_s(po, lmod);
1022 // note: must be unsigned compare
1023 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1024 cast, expr1, is_neg ? ">=" : "<", cast, expr2);
1028 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1029 cast, expr1, is_neg ? "!=" : "==", cast, expr2);
1033 // note: must be unsigned compare
1034 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1035 cast, expr1, is_neg ? ">" : "<=", cast, expr2);
1038 // note: must be signed compare
1040 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1041 scast, expr1, expr2, is_neg ? ">=" : "<");
1045 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1046 scast, expr1, is_neg ? ">=" : "<", scast, expr2);
1050 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1051 scast, expr1, is_neg ? ">" : "<=", scast, expr2);
1055 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1059 static void out_cmp_test(char *buf, size_t buf_size,
1060 struct parsed_op *po, enum parsed_flag_op pfo, int is_neg)
1062 char buf1[256], buf2[256], buf3[256];
1064 if (po->op == OP_TEST) {
1065 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1066 out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
1069 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1070 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
1071 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1073 out_test_for_cc(buf, buf_size, po, pfo, is_neg,
1074 po->operand[0].lmod, buf3);
1076 else if (po->op == OP_CMP) {
1077 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1078 out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
1079 out_cmp_for_cc(buf, buf_size, po, pfo, is_neg,
1080 po->operand[0].lmod, buf2, buf3);
1083 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1086 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1087 struct parsed_opr *popr2)
1089 struct parsed_equ *eq;
1091 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC) {
1092 // lmod could be specified by equ..
1093 if (!strncmp(popr1->name, "ebp+", 4)) {
1094 eq = equ_find(po, popr1->name + 4);
1095 popr1->lmod = eq->lmod;
1097 if (!strncmp(popr2->name, "ebp+", 4)) {
1098 eq = equ_find(po, popr2->name + 4);
1099 popr2->lmod = eq->lmod;
1103 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1104 ferr(po, "missing lmod for both operands\n");
1106 if (popr1->lmod == OPLM_UNSPEC)
1107 popr1->lmod = popr2->lmod;
1108 else if (popr2->lmod == OPLM_UNSPEC)
1109 popr2->lmod = popr1->lmod;
1110 else if (popr1->lmod != popr2->lmod)
1111 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1114 static const char *op_to_c(struct parsed_op *po)
1138 ferr(po, "op_to_c was supplied with %d\n", po->op);
1142 static int scan_for_pop(int i, int opcnt, const char *reg)
1144 for (; i < opcnt; i++) {
1145 if (ops[i].flags & OPF_RMD)
1148 if ((ops[i].flags & OPF_JMP) || g_labels[i][0] != 0)
1151 if (ops[i].op == OP_POP && ops[i].operand[0].type == OPT_REG
1152 && IS(ops[i].operand[0].name, reg))
1159 // scan for pop starting from 'ret' op (all paths)
1160 static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch)
1165 for (; i < opcnt; i++) {
1166 if (ops[i].op != OP_RET)
1169 for (j = i - 1; j >= 0; j--) {
1170 if (ops[j].flags & OPF_RMD)
1172 if (ops[j].flags & OPF_JMP)
1175 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1176 && IS(ops[j].operand[0].name, reg))
1180 ops[j].flags |= OPF_RMD;
1184 if (g_labels[j][0] != 0)
1189 return found ? 0 : -1;
1192 // is operand 'opr modified' by parsed_op 'po'?
1193 static int is_opr_modified(const struct parsed_opr *opr,
1194 const struct parsed_op *po)
1196 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1199 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1200 if (po->regmask_dst & (1 << opr->reg))
1206 return IS(po->operand[0].name, opr->name);
1209 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1210 static int is_any_opr_modified(const struct parsed_op *po_test,
1211 const struct parsed_op *po)
1215 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1218 if (po_test->regmask_src & po->regmask_dst)
1221 for (i = 0; i < po_test->operand_cnt; i++)
1222 if (IS(po_test->operand[i].name, po->operand[0].name))
1228 // scan for po_test operand modification in range given
1229 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1231 for (; i < opcnt; i++) {
1232 if (is_any_opr_modified(po_test, &ops[i]))
1239 static int scan_for_flag_set(int i)
1241 for (; i >= 0; i--) {
1242 if (ops[i].flags & OPF_FLAGS)
1245 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1247 if (g_labels[i][0] != 0)
1254 // scan back for cdq, if anything modifies edx, fail
1255 static int scan_for_cdq_edx(int i)
1257 for (; i >= 0; i--) {
1258 if (ops[i].op == OP_CDQ)
1261 if (ops[i].regmask_dst & (1 << xDX))
1263 if (g_labels[i][0] != 0)
1270 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1272 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1273 struct parsed_opr *last_arith_dst = NULL;
1274 char buf1[256], buf2[256], buf3[256];
1275 struct parsed_proto *pp;
1276 const char *tmpname;
1277 int save_arg_vars = 0;
1278 int cmp_result_vars = 0;
1280 int regmask_arg = 0;
1289 g_bp_frame = g_bp_stack = 0;
1291 ret = proto_parse(fhdr, funcn, &g_func_pp);
1293 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1295 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
1296 for (i = 0; i < g_func_pp.argc; i++) {
1298 fprintf(fout, ", ");
1299 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
1301 fprintf(fout, ")\n{\n");
1304 // - handle ebp frame, remove ops related to it
1305 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1306 && ops[1].op == OP_MOV
1307 && IS(opr_name(&ops[1], 0), "ebp")
1308 && IS(opr_name(&ops[1], 1), "esp"))
1311 ops[0].flags |= OPF_RMD;
1312 ops[1].flags |= OPF_RMD;
1314 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1315 g_bp_stack = opr_const(&ops[2], 1);
1316 ops[2].flags |= OPF_RMD;
1321 for (; i < opcnt; i++)
1322 if (ops[i].op == OP_RET)
1324 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1325 ferr(&ops[i - 1], "'pop ebp' expected\n");
1326 ops[i - 1].flags |= OPF_RMD;
1328 if (g_bp_stack != 0) {
1329 if (ops[i - 2].op != OP_MOV
1330 || !IS(opr_name(&ops[i - 2], 0), "esp")
1331 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1333 ferr(&ops[i - 2], "esp restore expected\n");
1335 ops[i - 2].flags |= OPF_RMD;
1338 } while (i < opcnt);
1342 // - find POPs for PUSHes, rm both
1343 // - scan for all used registers
1344 // - find flag set ops for their users
1346 for (i = 0; i < opcnt; i++) {
1348 if (po->flags & OPF_RMD)
1351 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG) {
1352 if (po->operand[0].reg < 0)
1353 ferr(po, "reg not set for push?\n");
1354 if (!(regmask & (1 << po->operand[0].reg))) { // reg save
1355 ret = scan_for_pop(i + 1, opcnt, po->operand[0].name);
1357 po->flags |= OPF_RMD;
1358 ops[ret].flags |= OPF_RMD;
1361 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
1363 po->flags |= OPF_RMD;
1364 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 1);
1370 regmask |= po->regmask_src | po->regmask_dst;
1372 if (po->flags & OPF_CC)
1374 ret = scan_for_flag_set(i - 1);
1376 ferr(po, "unable to trace flag setter\n");
1378 tmp_op = &ops[ret]; // flag setter
1379 ret = scan_for_mod(tmp_op, ret + 1, i);
1381 ret = 1 << split_cond(po, po->op, &dummy);
1382 tmp_op->pfomask |= ret;
1383 cmp_result_vars |= ret;
1387 if (po->op == OP_ADC || po->op == OP_SBB)
1388 cmp_result_vars |= 1 << PFO_C;
1390 else if (po->op == OP_CALL)
1392 pp = malloc(sizeof(*pp));
1393 my_assert_not(pp, NULL);
1394 tmpname = opr_name(&ops[i], 0);
1395 ret = proto_parse(fhdr, tmpname, pp);
1397 ferr(po, "proto_parse failed for '%s'\n", tmpname);
1399 for (arg = 0; arg < pp->argc; arg++)
1400 if (pp->arg[arg].reg == NULL)
1403 for (j = i - 1; j >= 0 && arg < pp->argc; j--) {
1404 if (ops[j].flags & OPF_RMD)
1406 if (ops[j].op != OP_PUSH)
1408 if (g_labels[j + 1][0] != 0)
1409 ferr(po, "arg search interrupted by '%s'\n", g_labels[j + 1]);
1411 pp->arg[arg].datap = &ops[j];
1412 ret = scan_for_mod(&ops[j], j + 1, i);
1414 // mark this push as one that needs operand saving
1415 ops[j].datap = (void *)(long)(arg + 1);
1416 save_arg_vars |= 1 << arg;
1419 ops[j].flags |= OPF_RMD;
1422 for (arg++; arg < pp->argc; arg++)
1423 if (pp->arg[arg].reg == NULL)
1427 ferr(po, "arg collect failed for '%s'\n", tmpname);
1432 // declare stack frame
1434 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
1435 (g_bp_stack + 3) / 4, (g_bp_stack + 1) / 2, g_bp_stack);
1437 // instantiate arg-registers
1438 for (i = 0; i < g_func_pp.argc; i++) {
1439 if (g_func_pp.arg[i].reg != NULL) {
1440 reg = char_array_i(regs_r32,
1441 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
1443 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
1445 regmask_arg |= 1 << reg;
1446 fprintf(fout, " u32 %s = (u32)a%d;\n",
1447 g_func_pp.arg[i].reg, i + 1);
1452 // instantiate other regs - special case for eax
1453 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
1454 fprintf(fout, " u32 eax = 0;\n");
1458 regmask &= ~regmask_arg;
1460 regmask &= ~(1 << xBP);
1462 for (reg = 0; reg < 8; reg++) {
1463 if (regmask & (1 << reg)) {
1464 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
1470 if (save_arg_vars) {
1471 for (reg = 0; reg < 32; reg++) {
1472 if (save_arg_vars & (1 << reg)) {
1473 fprintf(fout, " u32 s_a%d;\n", reg + 1);
1479 if (cmp_result_vars) {
1480 for (i = 0; i < 8; i++) {
1481 if (cmp_result_vars & (1 << i)) {
1482 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
1489 fprintf(fout, "\n");
1492 for (i = 0; i < opcnt; i++)
1494 if (g_labels[i][0] != 0)
1495 fprintf(fout, "\n%s:\n", g_labels[i]);
1498 if (po->flags & OPF_RMD)
1503 #define assert_operand_cnt(n_) \
1504 if (po->operand_cnt != n_) \
1505 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
1507 // conditional/flag using op?
1508 if (po->flags & OPF_CC)
1510 enum parsed_flag_op pfo;
1513 pfo = split_cond(po, po->op, &is_neg);
1515 // we go through all this trouble to avoid using parsed_flag_op,
1516 // which makes generated code much nicer
1517 if (delayed_flag_op != NULL)
1519 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_neg);
1521 else if (last_arith_dst != NULL
1522 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
1524 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
1525 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_neg,
1526 last_arith_dst->lmod, buf3);
1528 else if (po->datap != NULL) {
1529 // use preprocessed results
1531 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
1532 ferr(po, "not prepared for pfo %d\n", pfo);
1534 // note: is_neg was not yet applied
1535 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
1536 is_neg ? "!" : "", parsed_flag_op_names[pfo]);
1539 ferr(po, "all methods of finding comparison failed\n");
1542 if (po->flags & OPF_JMP) {
1543 fprintf(fout, " if %s\n", buf1);
1545 else if (po->op == OP_ADC || po->op == OP_SBB) {
1546 fprintf(fout, " cond_%s = %s;\n", parsed_flag_op_names[pfo], buf1);
1548 else if (po->flags & OPF_DATA) { // SETcc
1549 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
1550 fprintf(fout, " %s = %s;", buf2, buf1);
1553 ferr(po, "unhandled conditional op\n");
1560 assert_operand_cnt(2);
1561 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1562 fprintf(fout, " %s = %s;",
1563 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1564 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1568 assert_operand_cnt(2);
1569 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1570 fprintf(fout, " %s = %s;",
1571 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1572 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
1576 assert_operand_cnt(2);
1577 fprintf(fout, " %s = %s;",
1578 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1579 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1583 assert_operand_cnt(2);
1584 switch (po->operand[1].lmod) {
1586 strcpy(buf3, "(s8)");
1589 strcpy(buf3, "(s16)");
1592 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
1594 fprintf(fout, " %s = %s%s;",
1595 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1597 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1601 assert_operand_cnt(1);
1602 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1603 fprintf(fout, " %s = ~%s;", buf1, buf1);
1607 assert_operand_cnt(2);
1608 fprintf(fout, " %s = (s32)%s >> 31;",
1609 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1610 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1611 strcpy(g_comment, "cdq");
1614 // arithmetic w/flags
1619 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1624 assert_operand_cnt(2);
1625 fprintf(fout, " %s %s= %s;",
1626 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1628 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1629 last_arith_dst = &po->operand[0];
1630 delayed_flag_op = NULL;
1634 assert_operand_cnt(2);
1635 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1636 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1637 // special case for XOR
1638 fprintf(fout, " %s = 0;",
1639 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
1640 last_arith_dst = &po->operand[0];
1641 delayed_flag_op = NULL;
1647 assert_operand_cnt(2);
1648 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1649 fprintf(fout, " %s = %s%s >> %s;", buf1,
1650 lmod_cast_s(po, po->operand[0].lmod), buf1,
1651 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1652 last_arith_dst = &po->operand[0];
1653 delayed_flag_op = NULL;
1658 assert_operand_cnt(2);
1659 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1660 fprintf(fout, " %s %s= %s + cond_c;",
1661 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1663 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1664 last_arith_dst = &po->operand[0];
1665 delayed_flag_op = NULL;
1670 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1671 strcpy(buf2, po->op == OP_INC ? "++" : "--");
1672 fprintf(fout, " %s%s;", buf1, buf2);
1673 last_arith_dst = &po->operand[0];
1674 delayed_flag_op = NULL;
1678 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1679 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1680 fprintf(fout, " %s = -%s%s;", buf1,
1681 lmod_cast_s(po, po->operand[0].lmod), buf2);
1682 last_arith_dst = &po->operand[0];
1683 delayed_flag_op = NULL;
1687 if (po->operand_cnt == 2)
1689 ferr(po, "TODO imul\n");
1690 last_arith_dst = &po->operand[0];
1691 delayed_flag_op = NULL;
1696 assert_operand_cnt(1);
1697 if (po->operand[0].lmod != OPLM_DWORD)
1698 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
1700 // 32bit division is common, look for it
1701 if (scan_for_cdq_edx(i - 1) >= 0) {
1702 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1703 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
1704 po->op == OP_IDIV));
1705 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
1706 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
1709 ferr(po, "TODO 64bit divident\n");
1714 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1715 if (po->pfomask != 0) {
1716 for (j = 0; j < 8; j++) {
1717 if (po->pfomask & (1 << j)) {
1718 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
1719 fprintf(fout, " cond_%s = %s;",
1720 parsed_flag_op_names[j], buf1);
1726 delayed_flag_op = po;
1729 // note: we reuse OP_Jcc for SETcc, only flags differ
1730 case OP_JO ... OP_JG:
1731 if (po->flags & OPF_JMP)
1732 fprintf(fout, " goto %s;", po->operand[0].name);
1733 // else SETcc - should already be handled
1737 fprintf(fout, " goto %s;", po->operand[0].name);
1741 assert_operand_cnt(1);
1742 if (po->operand[0].type != OPT_LABEL)
1743 ferr(po, "unhandled call type\n");
1747 ferr(po, "NULL pp\n");
1750 if (!IS(pp->ret_type, "void")) {
1751 fprintf(fout, "eax = ");
1752 if (strchr(pp->ret_type, '*'))
1753 fprintf(fout, "(u32)");
1755 fprintf(fout, "%s(", opr_name(po, 0));
1756 for (arg = 0; arg < pp->argc; arg++) {
1758 fprintf(fout, ", ");
1759 if (pp->arg[arg].reg != NULL) {
1760 fprintf(fout, "%s", pp->arg[arg].reg);
1765 tmp_op = pp->arg[arg].datap;
1767 ferr(po, "parsed_op missing for arg%d\n", arg);
1768 if (tmp_op->datap) {
1769 fprintf(fout, "s_a%ld", (long)tmp_op->datap);
1773 out_src_opr(buf1, sizeof(buf1),
1774 tmp_op, &tmp_op->operand[0], 0));
1777 fprintf(fout, ");");
1781 if (IS(g_func_pp.ret_type, "void"))
1782 fprintf(fout, " return;");
1784 fprintf(fout, " return eax;");
1789 // special case - saved func arg
1790 fprintf(fout, " s_a%ld = %s;", (long)po->datap,
1791 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
1794 ferr(po, "push encountered\n");
1798 ferr(po, "pop encountered\n");
1803 ferr(po, "unhandled op type %d, flags %x\n",
1808 if (g_comment[0] != 0) {
1809 fprintf(fout, " // %s", g_comment);
1814 fprintf(fout, "\n");
1816 // see is delayed flag stuff is still valid
1817 if (delayed_flag_op != NULL && delayed_flag_op != po) {
1818 if (is_any_opr_modified(delayed_flag_op, po))
1819 delayed_flag_op = NULL;
1822 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
1823 if (is_opr_modified(last_arith_dst, po))
1824 last_arith_dst = NULL;
1828 fprintf(fout, "}\n\n");
1831 for (i = 0; i < opcnt; i++) {
1832 if (ops[i].op == OP_CALL) {
1840 proto_release(&g_func_pp);
1843 int main(int argc, char *argv[])
1845 FILE *fout, *fasm, *fhdr;
1847 char words[16][256];
1856 printf("usage:\n%s <.c> <.asm> <hdrf>\n",
1862 fhdr = fopen(hdrfn, "r");
1863 my_assert_not(fhdr, NULL);
1866 fasm = fopen(asmfn, "r");
1867 my_assert_not(fasm, NULL);
1869 fout = fopen(argv[1], "w");
1870 my_assert_not(fout, NULL);
1873 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
1874 my_assert_not(g_eqs, NULL);
1876 while (fgets(line, sizeof(line), fasm))
1881 if (*p == 0 || *p == ';')
1884 memset(words, 0, sizeof(words));
1885 for (wordc = 0; wordc < 16; wordc++) {
1886 p = sskip(next_word(words[wordc], sizeof(words[0]), p));
1887 if (*p == 0 || *p == ';') {
1895 awarn("wordc == 0?\n");
1899 // don't care about this:
1900 if (words[0][0] == '.'
1901 || IS(words[0], "include")
1902 || IS(words[0], "assume") || IS(words[1], "segment")
1903 || IS(words[0], "align"))
1908 if (IS(words[1], "proc")) {
1910 aerr("proc '%s' while in_func '%s'?\n",
1912 strcpy(g_func, words[0]);
1917 if (IS(words[1], "endp")) {
1919 aerr("endp '%s' while not in_func?\n", words[0]);
1920 if (!IS(g_func, words[0]))
1921 aerr("endp '%s' while in_func '%s'?\n",
1923 gen_func(fout, fhdr, g_func, pi);
1927 memset(&ops, 0, pi * sizeof(ops[0]));
1928 memset(g_labels, 0, pi * sizeof(g_labels[0]));
1935 if (IS(words[1], "=")) {
1937 aerr("unhandled equ, wc=%d\n", wordc);
1938 if (g_eqcnt >= eq_alloc) {
1940 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
1941 my_assert_not(g_eqs, NULL);
1944 len = strlen(words[0]);
1945 if (len > sizeof(g_eqs[0].name) - 1)
1946 aerr("equ name too long: %d\n", len);
1947 strcpy(g_eqs[g_eqcnt].name, words[0]);
1949 if (!IS(words[3], "ptr"))
1950 aerr("unhandled equ\n");
1951 if (IS(words[2], "dword"))
1952 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
1953 else if (IS(words[2], "word"))
1954 g_eqs[g_eqcnt].lmod = OPLM_WORD;
1955 else if (IS(words[2], "byte"))
1956 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
1958 aerr("bad lmod: '%s'\n", words[2]);
1960 g_eqs[g_eqcnt].offset = parse_number(words[4]);
1965 if (pi >= ARRAY_SIZE(ops))
1966 aerr("too many ops\n");
1968 p = strchr(words[0], ':');
1971 if (len > sizeof(g_labels[0]) - 1)
1972 aerr("label too long: %d\n", len);
1973 if (g_labels[pi][0] != 0)
1974 aerr("dupe label?\n");
1975 memcpy(g_labels[pi], words[0], len);
1976 g_labels[pi][len] = 0;
1980 parse_op(&ops[pi], words, wordc);
1993 // vim:ts=2:shiftwidth=2:expandtab