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__); \
25 OPC_RMD, /* removed or optimized out */
26 OPC_DATA, /* data processing */
27 OPC_DATA_FLAGS, /* data processing + sets flags */
28 OPC_JMP, /* .. and call */
29 OPC_JCC, /* conditional jump */
30 OPC_SCC, /* conditionel set */
94 #define MAX_OPERANDS 3
107 struct parsed_opr operand[MAX_OPERANDS];
109 int regmask; // all referensed regs
115 enum opr_lenmod lmod;
121 static struct parsed_op ops[MAX_OPS];
122 static struct parsed_equ *g_eqs;
124 static char g_labels[MAX_OPS][32];
125 static struct parsed_proto g_func_pp;
126 static char g_func[256];
127 static char g_comment[256];
128 static int g_bp_frame;
129 static int g_bp_stack;
130 #define ferr(op_, fmt, ...) do { \
131 printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
132 dump_op(op_), ##__VA_ARGS__); \
138 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
139 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
140 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
141 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
143 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
145 static int char_array_i(const char *array[], size_t len, const char *s)
149 for (i = 0; i < len; i++)
156 static int parse_reg(int *reg_out, enum opr_lenmod *reg_lmod,
157 int *regmask, char *s)
164 while (my_isblank(*s) || my_issep(*s))
166 s = next_idt(w, sizeof(w), s);
170 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), w);
172 *reg_lmod = OPLM_DWORD;
173 *regmask |= 1 << reg;
176 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), w);
178 *reg_lmod = OPLM_WORD;
179 *regmask |= 1 << reg;
182 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), w);
184 *reg_lmod = OPLM_BYTE;
185 *regmask |= 1 << reg;
188 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), w);
190 *reg_lmod = OPLM_BYTE;
191 *regmask |= 1 << reg;
206 static long parse_number(const char *number)
208 int len = strlen(number);
209 const char *p = number;
219 if (len > 1 && *p == '0')
221 if (number[len - 1] == 'h') {
222 ret = strtol(p, &endp, 16);
223 bad = (*endp != 'h');
226 ret = strtol(p, &endp, 10);
230 aerr("number parsing failed\n");
236 static int guess_lmod_from_name(struct parsed_opr *opr)
238 if (!strncmp(opr->name, "dword_", 6)) {
239 opr->lmod = OPLM_DWORD;
242 if (!strncmp(opr->name, "word_", 5)) {
243 opr->lmod = OPLM_WORD;
246 if (!strncmp(opr->name, "byte_", 5)) {
247 opr->lmod = OPLM_BYTE;
253 static int parse_operand(struct parsed_opr *opr, int *regmask,
254 char words[16][256], int wordc, int w, enum op_class cls)
256 enum opr_lenmod tmplmod;
262 aerr("parse_operand w %d, wordc %d\n", w, wordc);
266 for (i = w; i < wordc; i++) {
267 len = strlen(words[i]);
268 if (words[i][len - 1] == ',') {
269 words[i][len - 1] = 0;
275 if (cls == OPC_JMP || cls == OPC_JCC) {
278 if (wordc - w == 3 && IS(words[w + 1], "ptr"))
279 label = words[w + 2];
280 else if (wordc - w == 2 && IS(words[w], "short"))
281 label = words[w + 1];
282 else if (wordc - w == 1)
285 aerr("jump parse error");
287 opr->type = OPT_LABEL;
288 strcpy(opr->name, label);
292 if (wordc - w >= 3) {
293 if (IS(words[w + 1], "ptr")) {
294 if (IS(words[w], "dword"))
295 opr->lmod = OPLM_DWORD;
296 else if (IS(words[w], "word"))
297 opr->lmod = OPLM_WORD;
298 else if (IS(words[w], "byte"))
299 opr->lmod = OPLM_BYTE;
301 aerr("type parsing failed\n");
306 if (wordc - w == 2 && IS(words[w], "offset")) {
307 opr->type = OPT_OFFSET;
308 strcpy(opr->name, words[w + 1]);
313 aerr("parse_operand 1 word expected\n");
315 strcpy(opr->name, words[w]);
317 if (words[w][0] == '[') {
318 opr->type = OPT_REGMEM;
319 ret = sscanf(words[w], "[%[^]]]", opr->name);
321 aerr("[] parse failure\n");
322 // only need the regmask
323 parse_reg(&tmpreg, &tmplmod, regmask, opr->name);
326 else if (strchr(words[w], '[')) {
328 opr->type = OPT_REGMEM;
329 if (opr->lmod == OPLM_UNSPEC)
330 guess_lmod_from_name(opr);
331 parse_reg(&tmpreg, &tmplmod, regmask, strchr(words[w], '['));
334 else if (('0' <= words[w][0] && words[w][0] <= '9')
335 || words[w][0] == '-')
337 opr->type = OPT_CONST;
338 opr->val = (unsigned int)parse_number(words[w]);
342 ret = parse_reg(&opr->reg, &tmplmod, regmask, opr->name);
349 // most likely var in data segment
350 opr->type = OPT_LABEL;
351 if (opr->lmod == OPLM_UNSPEC)
352 guess_lmod_from_name(opr);
353 if (opr->lmod != OPLM_UNSPEC)
356 // TODO: scan data seg to determine type?
360 static const struct {
367 { "push", OP_PUSH, OPC_DATA, 1, 1 },
368 { "pop", OP_POP, OPC_DATA, 1, 1 },
369 { "mov" , OP_MOV, OPC_DATA, 2, 2 },
370 { "lea", OP_LEA, OPC_DATA, 2, 2 },
371 { "movzx",OP_MOVZX, OPC_DATA, 2, 2 },
372 { "movsx",OP_MOVSX, OPC_DATA, 2, 2 },
373 { "not", OP_NOT, OPC_DATA, 1, 1 },
374 { "add", OP_ADD, OPC_DATA_FLAGS, 2, 2 },
375 { "sub", OP_SUB, OPC_DATA_FLAGS, 2, 2 },
376 { "and", OP_AND, OPC_DATA_FLAGS, 2, 2 },
377 { "or", OP_OR, OPC_DATA_FLAGS, 2, 2 },
378 { "xor", OP_XOR, OPC_DATA_FLAGS, 2, 2 },
379 { "shl", OP_SHL, OPC_DATA_FLAGS, 2, 2 },
380 { "shr", OP_SHR, OPC_DATA_FLAGS, 2, 2 },
381 { "sal", OP_SHL, OPC_DATA_FLAGS, 2, 2 },
382 { "sar", OP_SAR, OPC_DATA_FLAGS, 2, 2 },
383 { "sbb", OP_SBB, OPC_DATA_FLAGS, 2, 2 },
384 { "inc", OP_INC, OPC_DATA_FLAGS, 1, 1 },
385 { "dec", OP_DEC, OPC_DATA_FLAGS, 1, 1 },
386 { "mul", OP_MUL, OPC_DATA_FLAGS, 1, 1 },
387 { "imul", OP_IMUL, OPC_DATA_FLAGS, 1, 3 },
388 { "test", OP_TEST, OPC_DATA_FLAGS, 2, 2 },
389 { "cmp", OP_CMP, OPC_DATA_FLAGS, 2, 2 },
390 { "retn", OP_RET, OPC_JMP, 0, 1 },
391 { "call", OP_CALL, OPC_JMP, 1, 1 },
392 { "jmp", OP_JMP, OPC_JMP, 1, 1 },
393 { "jo", OP_JO, OPC_JCC, 1, 1 }, // 70 OF=1
394 { "jno", OP_JNO, OPC_JCC, 1, 1 }, // 71 OF=0
395 { "jc", OP_JC, OPC_JCC, 1, 1 }, // 72 CF=1
396 { "jb", OP_JC, OPC_JCC, 1, 1 }, // 72
397 { "jnc", OP_JNC, OPC_JCC, 1, 1 }, // 73 CF=0
398 { "jae", OP_JNC, OPC_JCC, 1, 1 }, // 73
399 { "jz", OP_JZ, OPC_JCC, 1, 1 }, // 74 ZF=1
400 { "je", OP_JZ, OPC_JCC, 1, 1 }, // 74
401 { "jnz", OP_JNZ, OPC_JCC, 1, 1 }, // 75 ZF=0
402 { "jne", OP_JNZ, OPC_JCC, 1, 1 }, // 75
403 { "jbe", OP_JBE, OPC_JCC, 1, 1 }, // 76 CF=1 || ZF=1
404 { "jna", OP_JBE, OPC_JCC, 1, 1 }, // 76
405 { "ja", OP_JA, OPC_JCC, 1, 1 }, // 77 CF=0 && ZF=0
406 { "jnbe", OP_JA, OPC_JCC, 1, 1 }, // 77
407 { "js", OP_JS, OPC_JCC, 1, 1 }, // 78 SF=1
408 { "jns", OP_JNS, OPC_JCC, 1, 1 }, // 79 SF=0
409 { "jp", OP_JP, OPC_JCC, 1, 1 }, // 7a PF=1
410 { "jpe", OP_JP, OPC_JCC, 1, 1 }, // 7a
411 { "jnp", OP_JNP, OPC_JCC, 1, 1 }, // 7b PF=0
412 { "jpo", OP_JNP, OPC_JCC, 1, 1 }, // 7b
413 { "jl", OP_JL, OPC_JCC, 1, 1 }, // 7c SF!=OF
414 { "jnge", OP_JL, OPC_JCC, 1, 1 }, // 7c
415 { "jge", OP_JGE, OPC_JCC, 1, 1 }, // 7d SF=OF
416 { "jnl", OP_JGE, OPC_JCC, 1, 1 }, // 7d
417 { "jle", OP_JLE, OPC_JCC, 1, 1 }, // 7e ZF=1 || SF!=OF
418 { "jng", OP_JLE, OPC_JCC, 1, 1 }, // 7e
419 { "jg", OP_JG, OPC_JCC, 1, 1 }, // 7f ZF=0 && SF=OF
420 { "jnle", OP_JG, OPC_JCC, 1, 1 }, // 7f
423 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
429 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
430 if (!IS(words[0], op_table[i].name))
435 for (opr = 0; opr < op_table[i].minopr; opr++) {
436 w = parse_operand(&op->operand[opr], &op->regmask,
437 words, wordc, w, op_table[i].cls);
440 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
441 w = parse_operand(&op->operand[opr], &op->regmask,
442 words, wordc, w, op_table[i].cls);
448 aerr("unhandled op: '%s'\n", words[0]);
452 aerr("parse_op %s incomplete: %d/%d\n",
455 op->cls = op_table[i].cls;
456 op->op = op_table[i].op;
457 op->operand_cnt = opr;
461 static const char *op_name(enum op_op op)
465 for (i = 0; i < ARRAY_SIZE(op_table); i++)
466 if (op_table[i].op == op)
467 return op_table[i].name;
473 static const char *dump_op(struct parsed_op *po)
475 static char out[128];
479 snprintf(out, sizeof(out), "%s", op_name(po->op));
480 for (i = 0; i < po->operand_cnt; i++) {
484 snprintf(p, sizeof(out) - (p - out),
485 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
486 po->operand[i].name);
492 static const char *opr_name(struct parsed_op *po, int opr_num)
494 if (opr_num >= po->operand_cnt)
495 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
496 return po->operand[opr_num].name;
499 static unsigned int opr_const(struct parsed_op *po, int opr_num)
501 if (opr_num >= po->operand_cnt)
502 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
503 if (po->operand[opr_num].type != OPT_CONST)
504 ferr(po, "opr %d: const expected\n", opr_num);
505 return po->operand[opr_num].val;
508 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
510 if ((unsigned int)popr->reg >= MAX_REGS)
511 ferr(po, "invalid reg: %d\n", popr->reg);
512 return regs_r32[popr->reg];
515 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name)
519 for (i = 0; i < g_eqcnt; i++)
520 if (IS(g_eqs[i].name, name))
523 ferr(po, "unresolved equ name: '%s'\n", name);
528 static void bg_frame_access(struct parsed_op *po, enum opr_lenmod lmod,
529 char *buf, size_t buf_size, const char *bp_arg,
530 int is_src, int is_lea)
532 const char *prefix = "";
533 struct parsed_equ *eq;
537 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
539 eq = equ_find(po, bp_arg);
541 if (eq->offset >= 0) {
542 arg_i = eq->offset / 4 - 2;
543 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
544 ferr(po, "offset %d doesn't map to any arg\n", eq->offset);
546 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
547 if (g_func_pp.arg[i].reg != NULL)
553 if (i == g_func_pp.argc)
554 ferr(po, "arg %d not in prototype?\n", arg_i);
556 ferr(po, "lea to arg?\n");
558 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
562 ferr(po, "bp_stack access after it was not detected\n");
564 sf_ofs = g_bp_stack + eq->offset;
566 ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_bp_stack);
574 snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
577 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
580 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
583 ferr(po, "bp_stack bad lmod: %d\n", lmod);
588 static char *out_src_opr(char *buf, size_t buf_size,
589 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
591 const char *cast = "";
592 char tmp1[256], tmp2[256];
596 switch (popr->type) {
599 ferr(po, "lea from reg?\n");
601 switch (popr->lmod) {
603 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
606 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
609 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
612 ferr(po, "invalid src lmod: %d\n", popr->lmod);
617 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
618 bg_frame_access(po, popr->lmod, buf, buf_size,
619 popr->name + 4, 1, is_lea);
623 strcpy(expr, popr->name);
624 if (strchr(expr, '[')) {
625 // special case: '[' can only be left for label[reg] form
626 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
628 ferr(po, "parse failure for '%s'\n", expr);
629 snprintf(expr, sizeof(expr), "(u32)%s + %s", tmp1, tmp2);
632 // XXX: do we need more parsing?
634 snprintf(buf, buf_size, "%s", expr);
638 switch (popr->lmod) {
649 ferr(po, "invalid lmod: %d\n", popr->lmod);
651 snprintf(buf, buf_size, "%s(%s)", cast, expr);
656 snprintf(buf, buf_size, "(u32)&%s", popr->name);
658 snprintf(buf, buf_size, "%s", popr->name);
663 ferr(po, "lea an offset?\n");
664 snprintf(buf, buf_size, "(u32)&%s", popr->name);
669 ferr(po, "lea from const?\n");
671 snprintf(buf, buf_size, popr->val < 10 ? "%u" : "0x%02x", popr->val);
675 ferr(po, "invalid src type: %d\n", popr->type);
681 static char *out_dst_opr(char *buf, size_t buf_size,
682 struct parsed_op *po, struct parsed_opr *popr)
684 switch (popr->type) {
686 switch (popr->lmod) {
688 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
692 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
696 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
699 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
704 if (g_bp_frame && !strncmp(popr->name, "ebp+", 4)) {
705 bg_frame_access(po, popr->lmod, buf, buf_size,
706 popr->name + 4, 0, 0);
710 return out_src_opr(buf, buf_size, po, popr, 0);
713 ferr(po, "invalid dst type: %d\n", popr->type);
719 static void split_cond(struct parsed_op *po, enum op_op *op, int *is_neg)
767 ferr(po, "split_cond: bad op %d\n", *op);
772 static void out_test_for_cc(char *buf, size_t buf_size,
773 struct parsed_op *po, enum op_op op, enum opr_lenmod lmod,
776 const char *cast = "";
779 split_cond(po, &op, &is_neg);
792 ferr(po, "%s: invalid lmod for JZ: %d\n", __func__, lmod);
794 snprintf(buf, buf_size, "(%s%s %s 0)",
795 cast, expr, is_neg ? "!=" : "==");
798 case OP_JG: // ZF=0 && SF=OF; OF=0 after test
801 snprintf(buf, buf_size, "((int)%s %s 0)", expr, is_neg ? "<=" : ">");
804 ferr(po, "%s: unhandled lmod for JG: %d\n", __func__, lmod);
809 ferr(po, "%s: unhandled op: %d\n", __func__, op);
813 static void out_cmp_for_cc(char *buf, size_t buf_size,
814 struct parsed_op *po, enum op_op op, enum opr_lenmod lmod,
815 const char *expr1, const char *expr2)
817 const char *cast = "";
818 const char *scast = "";
834 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
837 split_cond(po, &op, &is_neg);
840 snprintf(buf, buf_size, "(%s%s %s %s%s)",
841 cast, expr1, is_neg ? "!=" : "==", cast, expr2);
845 // note: must be unsigned compare
846 snprintf(buf, buf_size, "(%s%s %s %s%s)",
847 cast, expr1, is_neg ? ">=" : "<", cast, expr2);
851 // note: must be unsigned compare
852 snprintf(buf, buf_size, "(%s%s %s %s%s)",
853 scast, expr1, is_neg ? ">=" : "<", scast, expr2);
857 ferr(po, "%s: unhandled op: %d\n", __func__, op);
861 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
862 struct parsed_opr *popr2)
864 struct parsed_equ *eq;
866 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC) {
867 // lmod could be specified by equ..
868 if (!strncmp(popr1->name, "ebp+", 4)) {
869 eq = equ_find(po, popr1->name + 4);
870 popr1->lmod = eq->lmod;
872 if (!strncmp(popr2->name, "ebp+", 4)) {
873 eq = equ_find(po, popr2->name + 4);
874 popr2->lmod = eq->lmod;
878 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
879 ferr(po, "missing lmod for both operands\n");
881 if (popr1->lmod == OPLM_UNSPEC)
882 popr1->lmod = popr2->lmod;
883 else if (popr2->lmod == OPLM_UNSPEC)
884 popr2->lmod = popr1->lmod;
885 else if (popr1->lmod != popr2->lmod)
886 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
889 static const char *op_to_c(struct parsed_op *po)
911 ferr(po, "op_to_c was supplied with %d\n", po->op);
915 static int scan_for_pop(int i, int opcnt, const char *reg)
917 for (; i < opcnt; i++) {
918 if (ops[i].cls == OPC_RMD)
921 if (ops[i].cls == OPC_JMP || ops[i].cls == OPC_JCC
922 || g_labels[i][0] != 0)
925 if (ops[i].op == OP_POP && ops[i].operand[0].type == OPT_REG
926 && IS(ops[i].operand[0].name, reg))
933 // scan for pop starting from ret
934 static int scan_for_pop_ret(int i, int opcnt, const char *reg, int do_patch)
939 for (; i < opcnt; i++) {
940 if (ops[i].op != OP_RET)
943 for (j = i - 1; j >= 0; j--) {
944 if (ops[j].cls == OPC_JMP || ops[j].cls == OPC_JCC)
947 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
948 && IS(ops[j].operand[0].name, reg))
952 ops[j].cls = OPC_RMD;
956 if (g_labels[j][0] != 0)
961 return found ? 0 : -1;
964 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
966 struct parsed_op *po, *delayed_op = NULL, *tmp_op;
967 struct parsed_opr *last_arith_dst = NULL;
968 char buf1[256], buf2[256], buf3[256];
969 struct parsed_proto *pp;
981 g_bp_frame = g_bp_stack = 0;
983 ret = proto_parse(fhdr, funcn, &g_func_pp);
985 ferr(ops, "proto_parse failed for '%s'\n", funcn);
987 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
988 for (i = 0; i < g_func_pp.argc; i++) {
991 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
993 fprintf(fout, ")\n{\n");
996 // - handle ebp frame, remove ops related to it
997 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
998 && ops[1].op == OP_MOV
999 && IS(opr_name(&ops[1], 0), "ebp")
1000 && IS(opr_name(&ops[1], 1), "esp"))
1003 ops[0].cls = OPC_RMD;
1004 ops[1].cls = OPC_RMD;
1006 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1007 g_bp_stack = opr_const(&ops[2], 1);
1008 ops[2].cls = OPC_RMD;
1013 for (; i < opcnt; i++)
1014 if (ops[i].op == OP_RET)
1016 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1017 ferr(&ops[i - 1], "'pop ebp' expected\n");
1018 ops[i - 1].cls = OPC_RMD;
1020 if (g_bp_stack != 0) {
1021 if (ops[i - 2].op != OP_MOV
1022 || !IS(opr_name(&ops[i - 2], 0), "esp")
1023 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1025 ferr(&ops[i - 2], "esp restore expected\n");
1027 ops[i - 2].cls = OPC_RMD;
1030 } while (i < opcnt);
1034 // - scan for all used registers
1036 // - find POPs for PUSHes, rm both
1037 for (i = 0; i < opcnt; i++) {
1038 if (ops[i].cls == OPC_RMD)
1041 if (ops[i].op == OP_PUSH && ops[i].operand[0].type == OPT_REG) {
1042 if (ops[i].operand[0].reg < 0)
1043 ferr(&ops[i], "reg not set for push?\n");
1044 if (!(regmask & (1 << ops[i].operand[0].reg))) { // reg save
1045 ret = scan_for_pop(i + 1, opcnt, ops[i].operand[0].name);
1047 ops[i].cls = ops[ret].cls = OPC_RMD;
1050 ret = scan_for_pop_ret(i + 1, opcnt, ops[i].operand[0].name, 0);
1052 ops[i].cls = OPC_RMD;
1053 scan_for_pop_ret(i + 1, opcnt, ops[i].operand[0].name, 1);
1059 regmask |= ops[i].regmask;
1061 if (ops[i].op == OP_CALL) {
1062 pp = malloc(sizeof(*pp));
1063 my_assert_not(pp, NULL);
1064 tmpname = opr_name(&ops[i], 0);
1065 ret = proto_parse(fhdr, tmpname, pp);
1067 ferr(&ops[i], "proto_parse failed for '%s'\n", tmpname);
1069 for (arg = 0; arg < pp->argc; arg++)
1070 if (pp->arg[arg].reg == NULL)
1073 for (j = i - 1; j >= 0 && arg < pp->argc; j--) {
1074 if (ops[j].cls == OPC_RMD)
1076 if (ops[j].op != OP_PUSH)
1079 pp->arg[arg].datap = &ops[j];
1080 ops[j].cls = OPC_RMD;
1081 for (arg++; arg < pp->argc; arg++)
1082 if (pp->arg[arg].reg == NULL)
1086 ferr(&ops[i], "arg collect failed for '%s'\n", tmpname);
1091 // declare stack frame
1093 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
1094 (g_bp_stack + 3) / 4, (g_bp_stack + 1) / 2, g_bp_stack);
1096 // instantiate arg-registers
1097 for (i = 0; i < g_func_pp.argc; i++) {
1098 if (g_func_pp.arg[i].reg != NULL) {
1099 reg = char_array_i(regs_r32,
1100 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
1102 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
1104 regmask_arg |= 1 << reg;
1105 fprintf(fout, " u32 %s = (u32)a%d;\n",
1106 g_func_pp.arg[i].reg, i + 1);
1111 // instantiate other regs - special case for eax
1112 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
1113 fprintf(fout, " u32 eax = 0;\n");
1117 regmask &= ~regmask_arg;
1119 regmask &= ~(1 << xBP);
1121 for (reg = 0; reg < 8; reg++) {
1122 if (regmask & (1 << reg)) {
1123 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
1130 fprintf(fout, "\n");
1133 for (i = 0; i < opcnt; i++) {
1134 if (g_labels[i][0] != 0)
1135 fprintf(fout, "\n%s:\n", g_labels[i]);
1137 if (ops[i].cls == OPC_RMD)
1143 #define assert_operand_cnt(n_) \
1144 if (po->operand_cnt != n_) \
1145 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
1147 if (last_arith_dst != NULL && po->operand_cnt > 0
1148 && po->operand[0].type == OPT_REG)
1150 if (IS(last_arith_dst->name, po->operand[0].name))
1151 last_arith_dst = NULL;
1156 if (po->op == OP_SBB && IS(opr_name(po, 0), opr_name(po, 1)))
1159 if (po->cls == OPC_JCC || po->cls == OPC_SCC || special_sbb)
1161 enum op_op flag_op = po->op;
1165 if (delayed_op != NULL)
1167 if (delayed_op->op == OP_TEST) {
1168 if (IS(opr_name(delayed_op, 0), opr_name(delayed_op, 1))) {
1169 out_src_opr(buf3, sizeof(buf3), delayed_op,
1170 &delayed_op->operand[0], 0);
1173 out_src_opr(buf1, sizeof(buf1), delayed_op,
1174 &delayed_op->operand[0], 0);
1175 out_src_opr(buf2, sizeof(buf2), delayed_op,
1176 &delayed_op->operand[1], 0);
1177 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1179 out_test_for_cc(buf1, sizeof(buf1), po, flag_op,
1180 delayed_op->operand[0].lmod, buf3);
1182 else if (delayed_op->op == OP_CMP) {
1183 out_src_opr(buf2, sizeof(buf2), delayed_op,
1184 &delayed_op->operand[0], 0);
1185 out_src_opr(buf3, sizeof(buf3), delayed_op,
1186 &delayed_op->operand[1], 0);
1187 out_cmp_for_cc(buf1, sizeof(buf1), po, flag_op,
1188 delayed_op->operand[0].lmod, buf2, buf3);
1191 else if (last_arith_dst != NULL
1192 && (flag_op == OP_JZ || flag_op == OP_JNZ))
1194 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
1195 out_test_for_cc(buf1, sizeof(buf1), po, flag_op,
1196 last_arith_dst->lmod, buf3);
1199 ferr(po, "no delayed_op or last arith result before cond op\n");
1201 if (po->cls == OPC_JCC) {
1202 fprintf(fout, " if %s\n", buf1);
1204 else if (special_sbb) {
1205 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
1206 fprintf(fout, " %s = %s * -1;", buf2, buf1);
1209 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
1210 fprintf(fout, " %s = %s;", buf2, buf1);
1217 assert_operand_cnt(2);
1218 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1219 fprintf(fout, " %s = %s;",
1220 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1221 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1225 assert_operand_cnt(2);
1226 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1227 fprintf(fout, " %s = %s;",
1228 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1229 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
1233 assert_operand_cnt(2);
1234 fprintf(fout, " %s = %s;",
1235 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1236 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1240 assert_operand_cnt(2);
1241 switch (po->operand[1].lmod) {
1243 strcpy(buf3, "(s8)");
1246 strcpy(buf3, "(s16)");
1249 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
1251 fprintf(fout, " %s = %s%s;",
1252 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1254 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1258 assert_operand_cnt(1);
1259 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1260 fprintf(fout, " %s = ~%s;", buf1, buf1);
1263 // arithmetic w/flags
1272 assert_operand_cnt(2);
1273 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1274 fprintf(fout, " %s %s= %s;",
1275 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
1277 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1278 last_arith_dst = &po->operand[0];
1283 assert_operand_cnt(2);
1284 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1285 switch (po->operand[0].lmod) {
1287 strcpy(buf3, "(s8)");
1290 strcpy(buf3, "(s16)");
1293 strcpy(buf3, "(s32)");
1296 ferr(po, "invalid dst lmod: %d\n", po->operand[0].lmod);
1298 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1299 fprintf(fout, " %s = %s%s >> %s;", buf1, buf3, buf1,
1300 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
1301 last_arith_dst = &po->operand[0];
1312 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1313 strcpy(buf2, po->op == OP_INC ? "++" : "--");
1314 switch (po->operand[0].lmod) {
1316 fprintf(fout, " LOBYTE(%s)%s;", buf1, buf2);
1319 fprintf(fout, " LOWORD(%s)%s;", buf1, buf2);
1322 fprintf(fout, " %s%s;", buf1, buf2);
1325 ferr(po, "invalid dst lmod: %d\n", po->operand[0].lmod);
1327 last_arith_dst = &po->operand[0];
1332 if (po->operand_cnt == 2)
1334 ferr(po, "TODO imul\n");
1335 last_arith_dst = &po->operand[0];
1341 propagate_lmod(po, &po->operand[0], &po->operand[1]);
1346 // note: we reuse OP_Jcc for SETcc, only cls differs
1347 case OP_JO ... OP_JG:
1348 if (po->cls == OPC_JCC)
1349 fprintf(fout, " goto %s;", po->operand[0].name);
1353 fprintf(fout, " goto %s;", po->operand[0].name);
1359 ferr(po, "NULL pp\n");
1362 if (!IS(pp->ret_type, "void")) {
1363 fprintf(fout, "eax = ");
1364 if (strchr(pp->ret_type, '*'))
1365 fprintf(fout, "(u32)");
1367 fprintf(fout, "%s(", opr_name(po, 0));
1368 for (arg = 0; arg < pp->argc; arg++) {
1370 fprintf(fout, ", ");
1371 if (pp->arg[arg].reg != NULL) {
1372 fprintf(fout, "%s", pp->arg[arg].reg);
1377 tmp_op = pp->arg[arg].datap;
1379 ferr(po, "parsed_op missing for arg%d\n", arg);
1381 out_src_opr(buf1, sizeof(buf1), tmp_op, &tmp_op->operand[0], 0));
1383 fprintf(fout, ");");
1387 if (IS(g_func_pp.ret_type, "void"))
1388 fprintf(fout, " return;");
1390 fprintf(fout, " return eax;");
1394 ferr(po, "push encountered\n");
1398 ferr(po, "pop encountered\n");
1403 ferr(po, "unhandled op type %d, cls %d\n",
1408 if (g_comment[0] != 0) {
1409 fprintf(fout, " // %s", g_comment);
1414 fprintf(fout, "\n");
1417 fprintf(fout, "}\n\n");
1420 for (i = 0; i < opcnt; i++) {
1421 if (ops[i].op == OP_CALL) {
1429 proto_release(&g_func_pp);
1432 int main(int argc, char *argv[])
1434 FILE *fout, *fasm, *fhdr;
1436 char words[16][256];
1445 printf("usage:\n%s <.c> <.asm> <hdrf>\n",
1451 fhdr = fopen(hdrfn, "r");
1452 my_assert_not(fhdr, NULL);
1455 fasm = fopen(asmfn, "r");
1456 my_assert_not(fasm, NULL);
1458 fout = fopen(argv[1], "w");
1459 my_assert_not(fout, NULL);
1462 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
1463 my_assert_not(g_eqs, NULL);
1465 while (fgets(line, sizeof(line), fasm))
1470 if (*p == 0 || *p == ';')
1473 memset(words, 0, sizeof(words));
1474 for (wordc = 0; wordc < 16; wordc++) {
1475 p = sskip(next_word(words[wordc], sizeof(words[0]), p));
1476 if (*p == 0 || *p == ';') {
1484 awarn("wordc == 0?\n");
1488 // don't care about this:
1489 if (words[0][0] == '.'
1490 || IS(words[0], "include")
1491 || IS(words[0], "assume") || IS(words[1], "segment")
1492 || IS(words[0], "align"))
1497 if (IS(words[1], "proc")) {
1499 aerr("proc '%s' while in_func '%s'?\n",
1501 strcpy(g_func, words[0]);
1506 if (IS(words[1], "endp")) {
1508 aerr("endp '%s' while not in_func?\n", words[0]);
1509 if (!IS(g_func, words[0]))
1510 aerr("endp '%s' while in_func '%s'?\n",
1512 gen_func(fout, fhdr, g_func, pi);
1516 memset(&ops, 0, pi * sizeof(ops[0]));
1517 memset(g_labels, 0, pi * sizeof(g_labels[0]));
1524 if (IS(words[1], "=")) {
1526 aerr("unhandled equ, wc=%d\n", wordc);
1527 if (g_eqcnt >= eq_alloc) {
1529 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
1530 my_assert_not(g_eqs, NULL);
1533 len = strlen(words[0]);
1534 if (len > sizeof(g_eqs[0].name) - 1)
1535 aerr("equ name too long: %d\n", len);
1536 strcpy(g_eqs[g_eqcnt].name, words[0]);
1538 if (!IS(words[3], "ptr"))
1539 aerr("unhandled equ\n");
1540 if (IS(words[2], "dword"))
1541 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
1542 else if (IS(words[2], "word"))
1543 g_eqs[g_eqcnt].lmod = OPLM_WORD;
1544 else if (IS(words[2], "byte"))
1545 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
1547 aerr("bad lmod: '%s'\n", words[2]);
1549 g_eqs[g_eqcnt].offset = parse_number(words[4]);
1554 if (pi >= ARRAY_SIZE(ops))
1555 aerr("too many ops\n");
1557 p = strchr(words[0], ':');
1560 if (len > sizeof(g_labels[0]) - 1)
1561 aerr("label too long: %d\n", len);
1562 if (g_labels[pi][0] != 0)
1563 aerr("dupe label?\n");
1564 memcpy(g_labels[pi], words[0], len);
1565 g_labels[pi][len] = 0;
1569 parse_op(&ops[pi], words, wordc);
1582 // vim:ts=2:shiftwidth=2:expandtab