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 */
35 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
109 #define MAX_OPERANDS 3
113 enum opr_lenmod lmod;
121 struct parsed_opr operand[MAX_OPERANDS];
124 int regmask_src; // all referensed regs
126 int pfomask; // flagop: parsed_flag_op that can't be delayed
127 int argmask; // push: args that are altered before call
128 int cc_scratch; // scratch storage during analysis
129 int bt_i; // branch target (for branches)
130 struct parsed_op *lrl; // label reference list entry
135 // OP_CALL - ptr to parsed_proto
136 // (OPF_CC) - point to corresponding (OPF_FLAGS)
140 enum opr_lenmod lmod;
145 IDAFA_BP_FRAME = (1 << 0),
146 IDAFA_LIB_FUNC = (1 << 1),
147 IDAFA_STATIC = (1 << 2),
148 IDAFA_NORETURN = (1 << 3),
149 IDAFA_THUNK = (1 << 4),
150 IDAFA_FPD = (1 << 5),
155 static struct parsed_op ops[MAX_OPS];
156 static struct parsed_equ *g_eqs;
158 static char g_labels[MAX_OPS][32];
159 static struct parsed_op *g_label_refs[MAX_OPS];
160 static struct parsed_proto g_func_pp;
161 static char g_func[256];
162 static char g_comment[256];
163 static int g_bp_frame;
164 static int g_sp_frame;
165 static int g_stack_fsz;
166 #define ferr(op_, fmt, ...) do { \
167 printf("error:%s:#%ld: '%s': " fmt, g_func, (op_) - ops, \
168 dump_op(op_), ##__VA_ARGS__); \
175 const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
176 const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
177 const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
178 const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
180 enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
182 // possible basic comparison types (without inversion)
183 enum parsed_flag_op {
187 PFO_BE, // 6 CF=1||ZF=1
191 PFO_LE, // e ZF=1||SF!=OF
194 static const char *parsed_flag_op_names[] = {
195 "o", "c", "z", "be", "s", "p", "l", "le"
198 static int char_array_i(const char *array[], size_t len, const char *s)
202 for (i = 0; i < len; i++)
209 static void printf_number(char *buf, size_t buf_size, long number)
211 // output in C-friendly form
212 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
215 static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
219 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
221 *reg_lmod = OPLM_DWORD;
224 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
226 *reg_lmod = OPLM_WORD;
229 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
231 *reg_lmod = OPLM_BYTE;
234 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
236 *reg_lmod = OPLM_BYTE;
243 static long parse_number(const char *number)
245 int len = strlen(number);
246 const char *p = number;
256 if (len > 1 && *p == '0')
258 if (number[len - 1] == 'h') {
259 ret = strtol(p, &endp, 16);
260 bad = (*endp != 'h');
263 ret = strtol(p, &endp, 10);
267 aerr("number parsing failed\n");
273 static int parse_indmode(char *name, int *regmask, int need_c_cvt)
275 enum opr_lenmod lmod;
288 while (my_isblank(*s))
290 for (; my_issep(*s); d++, s++)
292 while (my_isblank(*s))
297 if (!strncmp(s, "ds:", 3))
300 s = next_idt(w, sizeof(w), s);
305 reg = parse_reg(&lmod, w);
307 *regmask |= 1 << reg;
311 if ('0' <= w[0] && w[0] <= '9') {
312 number = parse_number(w);
313 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
317 // probably some label/identifier - pass
320 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
324 strcpy(name, cvtbuf);
329 static const char *parse_stack_el(const char *name)
337 if (!strncmp(name, "ebp+", 4)
338 && !('0' <= name[4] && name[4] <= '9'))
342 if (strncmp(name, "esp+", 4) != 0)
345 p = strchr(name + 4, '+');
347 // must be a number after esp+, already converted to 0x..
349 if (!('0' <= *s && *s <= '9')) {
350 aerr("%s nan?\n", __func__);
353 if (s[0] == '0' && s[1] == 'x')
356 if (len < sizeof(buf) - 1) {
357 strncpy(buf, s, len);
359 val = strtol(buf, &endp, 16);
360 if (val == 0 || *endp != 0) {
361 aerr("%s num parse fail for '%s'\n", __func__, buf);
370 if ('0' <= *p && *p <= '9')
376 static int guess_lmod_from_name(struct parsed_opr *opr)
378 if (!strncmp(opr->name, "dword_", 6)) {
379 opr->lmod = OPLM_DWORD;
382 if (!strncmp(opr->name, "word_", 5)) {
383 opr->lmod = OPLM_WORD;
386 if (!strncmp(opr->name, "byte_", 5)) {
387 opr->lmod = OPLM_BYTE;
393 static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
399 *regmask |= 1 << reg;
402 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name);
404 static int parse_operand(struct parsed_opr *opr,
405 int *regmask, int *regmask_indirect,
406 char words[16][256], int wordc, int w, unsigned int op_flags)
408 enum opr_lenmod tmplmod;
415 aerr("parse_operand w %d, wordc %d\n", w, wordc);
419 for (i = w; i < wordc; i++) {
420 len = strlen(words[i]);
421 if (words[i][len - 1] == ',') {
422 words[i][len - 1] = 0;
428 wordc_in = wordc - w;
430 if ((op_flags & OPF_JMP) && wordc_in > 0
431 && !('0' <= words[w][0] && words[w][0] <= '9'))
433 const char *label = NULL;
435 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
436 && IS(words[w + 1], "ptr"))
437 label = words[w + 2];
438 else if (wordc_in == 2 && IS(words[w], "short"))
439 label = words[w + 1];
440 else if (wordc_in == 1
441 && strchr(words[w], '[') == NULL
442 && parse_reg(&tmplmod, words[w]) < 0)
446 opr->type = OPT_LABEL;
447 strcpy(opr->name, label);
453 if (IS(words[w + 1], "ptr")) {
454 if (IS(words[w], "dword"))
455 opr->lmod = OPLM_DWORD;
456 else if (IS(words[w], "word"))
457 opr->lmod = OPLM_WORD;
458 else if (IS(words[w], "byte"))
459 opr->lmod = OPLM_BYTE;
461 aerr("type parsing failed\n");
463 wordc_in = wordc - w;
467 if (wordc_in == 2 && IS(words[w], "offset")) {
468 opr->type = OPT_OFFSET;
469 strcpy(opr->name, words[w + 1]);
474 aerr("parse_operand 1 word expected\n");
476 strcpy(opr->name, words[w]);
478 if (words[w][0] == '[') {
479 opr->type = OPT_REGMEM;
480 ret = sscanf(words[w], "[%[^]]]", opr->name);
482 aerr("[] parse failure\n");
484 parse_indmode(opr->name, regmask_indirect, 1);
485 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name)) {
487 struct parsed_equ *eq =
488 equ_find(NULL, parse_stack_el(opr->name));
490 opr->lmod = eq->lmod;
494 else if (strchr(words[w], '[')) {
496 opr->type = OPT_REGMEM;
497 if (opr->lmod == OPLM_UNSPEC)
498 guess_lmod_from_name(opr);
499 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
502 else if (('0' <= words[w][0] && words[w][0] <= '9')
503 || words[w][0] == '-')
505 number = parse_number(words[w]);
506 opr->type = OPT_CONST;
508 printf_number(opr->name, sizeof(opr->name), number);
512 ret = parse_reg(&tmplmod, opr->name);
514 setup_reg_opr(opr, ret, tmplmod, regmask);
518 // most likely var in data segment
519 opr->type = OPT_LABEL;
520 if (opr->lmod == OPLM_UNSPEC)
521 guess_lmod_from_name(opr);
522 if (opr->lmod != OPLM_UNSPEC)
525 // TODO: scan data seg to determine type?
529 static const struct {
536 static const struct {
543 { "nop", OP_NOP, 0, 0, 0 },
544 { "push", OP_PUSH, 1, 1, 0 },
545 { "pop", OP_POP, 1, 1, OPF_DATA },
546 { "mov" , OP_MOV, 2, 2, OPF_DATA },
547 { "lea", OP_LEA, 2, 2, OPF_DATA },
548 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
549 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
550 { "not", OP_NOT, 1, 1, OPF_DATA },
551 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
552 { "stosb",OP_STOS, 0, 0, OPF_DATA },
553 { "stosw",OP_STOS, 0, 0, OPF_DATA },
554 { "stosd",OP_STOS, 0, 0, OPF_DATA },
555 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
556 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
557 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
558 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
559 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
560 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
561 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
562 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
563 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
564 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
565 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
566 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
567 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
568 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
569 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
570 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
571 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
572 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
573 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
574 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
575 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
576 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
577 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
578 { "test", OP_TEST, 2, 2, OPF_FLAGS },
579 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
580 { "retn", OP_RET, 0, 1, OPF_JMP|OPF_TAIL },
581 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_FLAGS },
582 { "jmp", OP_JMP, 1, 1, OPF_JMP },
583 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
584 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
585 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
586 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
587 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
588 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
589 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
590 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
591 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
592 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
593 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
594 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
595 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
596 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
597 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
598 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
599 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
600 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
601 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
602 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
603 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
604 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
605 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
606 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
607 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
608 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
609 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
610 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
611 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
612 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
613 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
614 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
615 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
616 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
617 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
618 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
619 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
620 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
621 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
622 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
623 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
624 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
625 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
626 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
627 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
628 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
629 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
630 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
631 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
632 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
633 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
634 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
635 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
636 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
637 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
638 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
639 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
642 static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
644 enum opr_lenmod lmod = OPLM_UNSPEC;
645 int prefix_flags = 0;
653 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
654 if (IS(words[w], pref_table[i].name)) {
655 prefix_flags = pref_table[i].flags;
662 aerr("lone prefix: '%s'\n", words[0]);
667 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
668 if (IS(words[w], op_table[i].name))
672 if (i == ARRAY_SIZE(op_table))
673 aerr("unhandled op: '%s'\n", words[0]);
676 op->op = op_table[i].op;
677 op->flags = op_table[i].flags | prefix_flags;
678 op->regmask_src = op->regmask_dst = 0;
680 for (opr = 0; opr < op_table[i].minopr; opr++) {
681 regmask = regmask_ind = 0;
682 w = parse_operand(&op->operand[opr], ®mask, ®mask_ind,
683 words, wordc, w, op->flags);
685 if (opr == 0 && (op->flags & OPF_DATA))
686 op->regmask_dst = regmask;
687 // for now, mark dst as src too
688 op->regmask_src |= regmask | regmask_ind;
691 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
692 w = parse_operand(&op->operand[opr],
693 &op->regmask_src, &op->regmask_src,
694 words, wordc, w, op->flags);
698 aerr("parse_op %s incomplete: %d/%d\n",
702 op->operand_cnt = opr;
703 if (!strncmp(op_table[i].name, "set", 3))
704 op->operand[0].lmod = OPLM_BYTE;
706 // ops with implicit argumets
710 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
711 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
715 if (op->operand_cnt != 0)
717 if (IS(words[op_w], "stosb"))
719 else if (IS(words[op_w], "stosw"))
721 else if (IS(words[op_w], "stosd"))
724 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
725 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
726 op->regmask_dst = op->regmask_src;
727 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
731 if (op->operand_cnt != 0)
733 if (IS(words[op_w], "movsb"))
735 else if (IS(words[op_w], "movsw"))
737 else if (IS(words[op_w], "movsd"))
740 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
741 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
742 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
743 op->regmask_dst = op->regmask_src;
747 if (op->operand_cnt != 1)
752 op->regmask_dst = (1 << xDX) | (1 << xAX);
753 op->regmask_src |= (1 << xAX);
754 if (op->operand[0].lmod == OPLM_UNSPEC)
755 op->operand[0].lmod = OPLM_DWORD;
760 // we could set up operands for edx:eax, but there is no real need to
761 // (see is_opr_modified())
762 regmask = (1 << xDX) | (1 << xAX);
763 op->regmask_dst = regmask;
764 op->regmask_src |= regmask;
765 if (op->operand[0].lmod == OPLM_UNSPEC)
766 op->operand[0].lmod = OPLM_DWORD;
774 if (op->operand[1].lmod == OPLM_UNSPEC)
775 op->operand[1].lmod = OPLM_BYTE;
783 static const char *op_name(enum op_op op)
787 for (i = 0; i < ARRAY_SIZE(op_table); i++)
788 if (op_table[i].op == op)
789 return op_table[i].name;
795 static const char *dump_op(struct parsed_op *po)
797 static char out[128];
801 snprintf(out, sizeof(out), "%s", op_name(po->op));
802 for (i = 0; i < po->operand_cnt; i++) {
806 snprintf(p, sizeof(out) - (p - out),
807 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
808 po->operand[i].name);
814 static const char *lmod_cast_u(struct parsed_op *po,
815 enum opr_lenmod lmod)
825 ferr(po, "invalid lmod: %d\n", lmod);
826 return "(_invalid_)";
830 static const char *lmod_cast_u_ptr(struct parsed_op *po,
831 enum opr_lenmod lmod)
841 ferr(po, "invalid lmod: %d\n", lmod);
842 return "(_invalid_)";
846 static const char *lmod_cast_s(struct parsed_op *po,
847 enum opr_lenmod lmod)
857 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
858 return "(_invalid_)";
862 static const char *lmod_cast(struct parsed_op *po,
863 enum opr_lenmod lmod, int is_signed)
866 lmod_cast_s(po, lmod) :
867 lmod_cast_u(po, lmod);
870 static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
880 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
885 static const char *opr_name(struct parsed_op *po, int opr_num)
887 if (opr_num >= po->operand_cnt)
888 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
889 return po->operand[opr_num].name;
892 static unsigned int opr_const(struct parsed_op *po, int opr_num)
894 if (opr_num >= po->operand_cnt)
895 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
896 if (po->operand[opr_num].type != OPT_CONST)
897 ferr(po, "opr %d: const expected\n", opr_num);
898 return po->operand[opr_num].val;
901 static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
903 if ((unsigned int)popr->reg >= MAX_REGS)
904 ferr(po, "invalid reg: %d\n", popr->reg);
905 return regs_r32[popr->reg];
908 static struct parsed_equ *equ_find(struct parsed_op *po, const char *name)
912 for (i = 0; i < g_eqcnt; i++)
913 if (IS(g_eqs[i].name, name))
917 ferr(po, "unresolved equ name: '%s'\n", name);
924 static void stack_frame_access(struct parsed_op *po,
925 enum opr_lenmod lmod, char *buf, size_t buf_size,
926 const char *name, int is_src, int is_lea)
928 const char *prefix = "";
929 struct parsed_equ *eq;
935 bp_arg = parse_stack_el(name);
936 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
937 eq = equ_find(po, bp_arg);
939 ferr(po, "detected but missing eq\n");
941 if (!strncmp(name, "ebp", 3))
944 if (stack_ra <= eq->offset && eq->offset < stack_ra + 4)
945 ferr(po, "reference to ra? %d %d\n", eq->offset, stack_ra);
947 if (eq->offset > stack_ra) {
948 arg_i = (eq->offset - stack_ra - 4) / 4;
949 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
950 ferr(po, "offset %d (%s) doesn't map to any arg\n",
953 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
954 if (g_func_pp.arg[i].reg != NULL)
960 if (i == g_func_pp.argc)
961 ferr(po, "arg %d not in prototype?\n", arg_i);
963 ferr(po, "lea to arg?\n");
965 snprintf(buf, buf_size, "%sa%d", is_src ? "(u32)" : "", i + 1);
968 if (g_stack_fsz == 0)
969 ferr(po, "stack var access without stackframe\n");
971 sf_ofs = g_stack_fsz + eq->offset;
973 ferr(po, "bp_stack offset %d/%d\n", eq->offset, g_stack_fsz);
981 snprintf(buf, buf_size, "%ssf.b[%d]", prefix, sf_ofs);
984 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
987 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
990 ferr(po, "bp_stack bad lmod: %d\n", lmod);
995 static char *out_src_opr(char *buf, size_t buf_size,
996 struct parsed_op *po, struct parsed_opr *popr, int is_lea)
998 char tmp1[256], tmp2[256];
1002 switch (popr->type) {
1005 ferr(po, "lea from reg?\n");
1007 switch (popr->lmod) {
1009 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1012 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1015 if (popr->name[1] == 'h') // XXX..
1016 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1018 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1021 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1026 if (parse_stack_el(popr->name)) {
1027 stack_frame_access(po, popr->lmod, buf, buf_size,
1028 popr->name, 1, is_lea);
1032 strcpy(expr, popr->name);
1033 if (strchr(expr, '[')) {
1034 // special case: '[' can only be left for label[reg] form
1035 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1037 ferr(po, "parse failure for '%s'\n", expr);
1038 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1041 // XXX: do we need more parsing?
1043 snprintf(buf, buf_size, "%s", expr);
1047 snprintf(buf, buf_size, "%s(%s)",
1048 lmod_cast_u_ptr(po, popr->lmod), expr);
1053 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1055 snprintf(buf, buf_size, "(u32)%s", popr->name);
1060 ferr(po, "lea an offset?\n");
1061 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1066 ferr(po, "lea from const?\n");
1068 printf_number(buf, buf_size, popr->val);
1072 ferr(po, "invalid src type: %d\n", popr->type);
1078 static char *out_dst_opr(char *buf, size_t buf_size,
1079 struct parsed_op *po, struct parsed_opr *popr)
1081 switch (popr->type) {
1083 switch (popr->lmod) {
1085 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1089 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1093 if (popr->name[1] == 'h') // XXX..
1094 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1096 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1099 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1104 if (parse_stack_el(popr->name)) {
1105 stack_frame_access(po, popr->lmod, buf, buf_size,
1110 return out_src_opr(buf, buf_size, po, popr, 0);
1113 snprintf(buf, buf_size, "%s", popr->name);
1117 ferr(po, "invalid dst type: %d\n", popr->type);
1123 static enum parsed_flag_op split_cond(struct parsed_op *po,
1124 enum op_op op, int *is_inv)
1176 ferr(po, "split_cond: bad op %d\n", op);
1181 static void out_test_for_cc(char *buf, size_t buf_size,
1182 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1183 enum opr_lenmod lmod, const char *expr)
1185 const char *cast, *scast;
1187 cast = lmod_cast_u(po, lmod);
1188 scast = lmod_cast_s(po, lmod);
1192 case PFO_BE: // CF=1||ZF=1; CF=0
1193 snprintf(buf, buf_size, "(%s%s %s 0)",
1194 cast, expr, is_inv ? "!=" : "==");
1198 case PFO_L: // SF!=OF; OF=0
1199 snprintf(buf, buf_size, "(%s%s %s 0)",
1200 scast, expr, is_inv ? ">=" : "<");
1203 case PFO_LE: // ZF=1||SF!=OF; OF=0
1204 snprintf(buf, buf_size, "(%s%s %s 0)",
1205 scast, expr, is_inv ? ">" : "<=");
1209 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1213 static void out_cmp_for_cc(char *buf, size_t buf_size,
1214 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1215 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1217 const char *cast, *scast;
1219 cast = lmod_cast_u(po, lmod);
1220 scast = lmod_cast_s(po, lmod);
1224 // note: must be unsigned compare
1225 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1226 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1230 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1231 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1235 // note: must be unsigned compare
1236 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1237 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1240 // note: must be signed compare
1242 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1243 scast, expr1, expr2, is_inv ? ">=" : "<");
1247 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1248 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1252 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1253 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1257 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1261 static void out_cmp_test(char *buf, size_t buf_size,
1262 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1264 char buf1[256], buf2[256], buf3[256];
1266 if (po->op == OP_TEST) {
1267 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1268 out_src_opr(buf3, sizeof(buf3), po, &po->operand[0], 0);
1271 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
1272 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0);
1273 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1275 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1276 po->operand[0].lmod, buf3);
1278 else if (po->op == OP_CMP) {
1279 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
1280 out_src_opr(buf3, sizeof(buf3), po, &po->operand[1], 0);
1281 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1282 po->operand[0].lmod, buf2, buf3);
1285 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1288 static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1289 struct parsed_opr *popr2)
1291 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1292 ferr(po, "missing lmod for both operands\n");
1294 if (popr1->lmod == OPLM_UNSPEC)
1295 popr1->lmod = popr2->lmod;
1296 else if (popr2->lmod == OPLM_UNSPEC)
1297 popr2->lmod = popr1->lmod;
1298 else if (popr1->lmod != popr2->lmod)
1299 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1302 static const char *op_to_c(struct parsed_op *po)
1326 ferr(po, "op_to_c was supplied with %d\n", po->op);
1330 static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1331 enum op_flags flag_check)
1333 if (po->flags & flag)
1334 ferr(po, "flag %x already set\n", flag);
1335 if (po->flags & flag_check)
1336 ferr(po, "flag_check %x already set\n", flag_check);
1341 static int scan_for_pop(int i, int opcnt, const char *reg,
1342 int magic, int depth, int *maxdepth, int do_flags)
1344 struct parsed_op *po;
1347 for (; i < opcnt; i++) {
1349 if (po->cc_scratch == magic)
1350 break; // already checked
1351 po->cc_scratch = magic;
1353 if (po->flags & OPF_TAIL)
1354 return -1; // deadend
1356 if ((po->flags & OPF_RMD)
1357 || (po->op == OP_PUSH && po->argmask)) // arg push
1360 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1362 ferr(po, "dead branch\n");
1366 if (po->flags & OPF_CC) {
1367 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1368 depth, maxdepth, do_flags);
1370 return ret; // dead end
1378 if ((po->op == OP_POP || po->op == OP_PUSH)
1379 && po->operand[0].type == OPT_REG
1380 && IS(po->operand[0].name, reg))
1382 if (po->op == OP_PUSH) {
1384 if (depth > *maxdepth)
1387 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1389 else if (depth == 0) {
1391 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1396 if (depth < 0) // should not happen
1397 ferr(po, "fail with depth\n");
1399 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1407 // scan for pop starting from 'ret' op (all paths)
1408 static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1414 for (; i < opcnt; i++) {
1415 if (!(ops[i].flags & OPF_TAIL))
1418 for (j = i - 1; j >= 0; j--) {
1419 if (ops[j].flags & OPF_RMD)
1421 if (ops[j].flags & OPF_JMP)
1424 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1425 && IS(ops[j].operand[0].name, reg))
1428 ops[j].flags |= flag_set;
1432 if (g_labels[j][0] != 0)
1437 return found ? 0 : -1;
1440 // is operand 'opr modified' by parsed_op 'po'?
1441 static int is_opr_modified(const struct parsed_opr *opr,
1442 const struct parsed_op *po)
1444 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1447 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1448 if (po->regmask_dst & (1 << opr->reg))
1454 return IS(po->operand[0].name, opr->name);
1457 // is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1458 static int is_any_opr_modified(const struct parsed_op *po_test,
1459 const struct parsed_op *po)
1463 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1466 if (po_test->regmask_src & po->regmask_dst)
1469 for (i = 0; i < po_test->operand_cnt; i++)
1470 if (IS(po_test->operand[i].name, po->operand[0].name))
1476 // scan for any po_test operand modification in range given
1477 static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1479 for (; i < opcnt; i++) {
1480 if (is_any_opr_modified(po_test, &ops[i]))
1487 // scan for po_test operand[0] modification in range given
1488 static int scan_for_mod_opr0(struct parsed_op *po_test,
1491 for (; i < opcnt; i++) {
1492 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1499 static int scan_for_flag_set(int i)
1501 for (; i >= 0; i--) {
1502 if (ops[i].flags & OPF_FLAGS)
1505 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1507 if (g_labels[i][0] != 0)
1514 // scan back for cdq, if anything modifies edx, fail
1515 static int scan_for_cdq_edx(int i)
1517 for (; i >= 0; i--) {
1518 if (ops[i].op == OP_CDQ)
1521 if (ops[i].regmask_dst & (1 << xDX))
1523 if (g_labels[i][0] != 0)
1530 // scan for positive, constant esp adjust
1531 static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1533 for (; i < opcnt; i++) {
1534 if (ops[i].op == OP_ADD && ops[i].operand[0].reg == xSP) {
1535 if (ops[i].operand[1].type != OPT_CONST)
1536 ferr(&ops[i], "non-const esp adjust?\n");
1537 *adj = ops[i].operand[1].val;
1539 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1543 if ((ops[i].flags & (OPF_JMP|OPF_TAIL))
1544 || ops[i].op == OP_PUSH || ops[i].op == OP_POP)
1546 if (g_labels[i][0] != 0)
1553 static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1555 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
1556 struct parsed_opr *last_arith_dst = NULL;
1557 char buf1[256], buf2[256], buf3[256];
1558 struct parsed_proto *pp, *pp_tmp;
1559 const char *tmpname;
1560 enum parsed_flag_op pfo;
1561 int save_arg_vars = 0;
1562 int cmp_result_vars = 0;
1563 int need_mul_var = 0;
1565 int regmask_save = 0;
1566 int regmask_arg = 0;
1577 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
1579 ret = proto_parse(fhdr, funcn, &g_func_pp);
1581 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1583 fprintf(fout, "%s %s(", g_func_pp.ret_type, funcn);
1584 for (i = 0; i < g_func_pp.argc; i++) {
1586 fprintf(fout, ", ");
1587 fprintf(fout, "%s a%d", g_func_pp.arg[i].type, i + 1);
1589 fprintf(fout, ")\n{\n");
1592 // - handle ebp/esp frame, remove ops related to it
1593 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1594 && ops[1].op == OP_MOV
1595 && IS(opr_name(&ops[1], 0), "ebp")
1596 && IS(opr_name(&ops[1], 1), "esp"))
1601 ops[0].flags |= OPF_RMD;
1602 ops[1].flags |= OPF_RMD;
1604 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1605 g_stack_fsz = opr_const(&ops[2], 1);
1606 ops[2].flags |= OPF_RMD;
1609 // another way msvc builds stack frame..
1611 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1613 ops[i].flags |= OPF_RMD;
1621 for (; i < opcnt; i++)
1622 if (ops[i].op == OP_RET)
1624 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
1625 ferr(&ops[i - 1], "'pop ebp' expected\n");
1626 ops[i - 1].flags |= OPF_RMD;
1628 if (g_stack_fsz != 0) {
1629 if (ops[i - 2].op != OP_MOV
1630 || !IS(opr_name(&ops[i - 2], 0), "esp")
1631 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
1633 ferr(&ops[i - 2], "esp restore expected\n");
1635 ops[i - 2].flags |= OPF_RMD;
1637 if (ecx_push && ops[i - 3].op == OP_POP
1638 && IS(opr_name(&ops[i - 3], 0), "ecx"))
1640 ferr(&ops[i - 3], "unexpected ecx pop\n");
1645 } while (i < opcnt);
1648 for (i = 0; i < opcnt; i++) {
1649 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
1651 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
1652 && ops[i].operand[1].type == OPT_CONST)
1661 g_stack_fsz = ops[i].operand[1].val;
1662 ops[i].flags |= OPF_RMD;
1666 for (; i < opcnt; i++)
1667 if (ops[i].op == OP_RET)
1669 if (ops[i - 1].op != OP_ADD
1670 || !IS(opr_name(&ops[i - 1], 0), "esp")
1671 || ops[i - 1].operand[1].type != OPT_CONST
1672 || ops[i - 1].operand[1].val != g_stack_fsz)
1673 ferr(&ops[i - 1], "'add esp' expected\n");
1674 ops[i - 1].flags |= OPF_RMD;
1677 } while (i < opcnt);
1682 // - resolve all branches
1683 for (i = 0; i < opcnt; i++) {
1687 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
1688 || po->op == OP_CALL || po->op == OP_RET)
1691 for (j = 0; j < opcnt; j++) {
1692 if (g_labels[j][0] && IS(po->operand[0].name, g_labels[j])) {
1694 po->lrl = g_label_refs[j];
1695 g_label_refs[j] = po;
1700 if (po->bt_i == -1) {
1703 po->flags |= OPF_TAIL;
1709 for (i = 0; i < opcnt; i++)
1712 if (po->flags & OPF_RMD)
1715 if (po->op == OP_CALL)
1717 pp = calloc(1, sizeof(*pp));
1718 my_assert_not(pp, NULL);
1719 tmpname = opr_name(po, 0);
1720 if (po->operand[0].type != OPT_LABEL)
1722 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
1724 ferr(po, "non-__cdecl indirect call unhandled yet\n");
1726 if (j > ARRAY_SIZE(pp->arg))
1727 ferr(po, "esp adjust too large?\n");
1728 pp->ret_type = "int";
1729 pp->argc = pp->argc_stack = j;
1730 for (arg = 0; arg < pp->argc; arg++)
1731 pp->arg[arg].type = "int";
1734 ret = proto_parse(fhdr, tmpname, pp);
1736 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
1739 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
1741 if (pp->argc_stack != j / 4)
1742 ferr(po, "stack tracking failed: %x %x\n",
1744 ops[ret].flags |= OPF_RMD;
1747 for (arg = 0; arg < pp->argc; arg++)
1748 if (pp->arg[arg].reg == NULL)
1751 for (j = i; j >= 0 && arg < pp->argc; )
1753 if (g_labels[j][0] != 0) {
1754 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
1755 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
1757 // follow the branch in reverse
1758 if (g_label_refs[j] == NULL)
1759 ferr(po, "no refs for '%s'?\n", g_labels[j]);
1760 if (g_label_refs[j]->lrl != NULL)
1761 ferr(po, "unhandled multiple fefs to '%s'\n", g_labels[j]);
1762 j = (g_label_refs[j] - ops) + 1;
1769 if (ops[j].op == OP_CALL)
1771 pp_tmp = ops[j].datap;
1773 ferr(po, "arg collect hit unparsed call\n");
1774 if (pp_tmp->argc_stack > 0)
1775 ferr(po, "arg collect hit '%s' with %d stack args\n",
1776 opr_name(&ops[j], 0), pp_tmp->argc_stack);
1778 else if ((ops[j].flags & OPF_TAIL)
1779 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
1783 else if (ops[j].op == OP_PUSH)
1785 pp->arg[arg].datap = &ops[j];
1786 ret = scan_for_mod(&ops[j], j + 1, i);
1788 // mark this push as one that needs operand saving
1789 ops[j].flags &= ~OPF_RMD;
1790 ops[j].argmask |= 1 << arg;
1791 save_arg_vars |= 1 << arg;
1794 ops[j].flags |= OPF_RMD;
1797 for (arg++; arg < pp->argc; arg++)
1798 if (pp->arg[arg].reg == NULL)
1803 ferr(po, "arg collect failed for '%s'\n", tmpname);
1809 // - find POPs for PUSHes, rm both
1810 // - scan for all used registers
1811 // - find flag set ops for their users
1812 // - declare indirect functions
1813 for (i = 0; i < opcnt; i++) {
1815 if (po->flags & OPF_RMD)
1818 if (po->op == OP_PUSH
1819 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
1820 && po->operand[0].type == OPT_REG)
1822 reg = po->operand[0].reg;
1824 ferr(po, "reg not set for push?\n");
1827 ret = scan_for_pop(i + 1, opcnt,
1828 po->operand[0].name, i + opcnt, 0, &depth, 0);
1831 ferr(po, "too much depth: %d\n", depth);
1833 regmask_save |= 1 << reg;
1835 po->flags |= OPF_RMD;
1836 scan_for_pop(i + 1, opcnt, po->operand[0].name,
1837 i + opcnt * 2, 0, &depth, 1);
1840 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
1843 if (regmask & (1 << reg)) {
1844 if (regmask_save & (1 << reg))
1845 ferr(po, "%s already saved?\n", po->operand[0].name);
1849 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
1854 regmask |= po->regmask_src | po->regmask_dst;
1856 if (po->flags & OPF_CC)
1858 ret = scan_for_flag_set(i - 1);
1860 ferr(po, "unable to trace flag setter\n");
1862 tmp_op = &ops[ret]; // flag setter
1863 pfo = split_cond(po, po->op, &dummy);
1866 // to get nicer code, we try to delay test and cmp;
1867 // if we can't because of operand modification, or if we
1868 // have math op, make it calculate flags explicitly
1869 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
1870 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
1874 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
1875 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
1879 tmp_op->pfomask |= pfomask;
1880 cmp_result_vars |= pfomask;
1884 if (po->op == OP_ADC || po->op == OP_SBB)
1885 cmp_result_vars |= 1 << PFO_C;
1887 else if (po->op == OP_MUL
1888 || (po->op == OP_IMUL && po->operand_cnt == 1))
1892 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
1894 my_assert_not(pp, NULL);
1895 fprintf(fout, " %s (*icall%d)(", pp->ret_type, i);
1896 for (j = 0; j < pp->argc; j++) {
1898 fprintf(fout, ", ");
1899 fprintf(fout, "%s a%d", pp->arg[j].type, j + 1);
1901 fprintf(fout, ");\n");
1905 // declare stack frame
1907 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
1908 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
1910 // declare arg-registers
1911 for (i = 0; i < g_func_pp.argc; i++) {
1912 if (g_func_pp.arg[i].reg != NULL) {
1913 reg = char_array_i(regs_r32,
1914 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
1916 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
1918 regmask_arg |= 1 << reg;
1919 fprintf(fout, " u32 %s = (u32)a%d;\n",
1920 g_func_pp.arg[i].reg, i + 1);
1925 // declare other regs - special case for eax
1926 if (!((regmask | regmask_arg) & 1) && !IS(g_func_pp.ret_type, "void")) {
1927 fprintf(fout, " u32 eax = 0;\n");
1931 regmask &= ~regmask_arg;
1932 regmask &= ~(1 << xSP);
1934 regmask &= ~(1 << xBP);
1936 for (reg = 0; reg < 8; reg++) {
1937 if (regmask & (1 << reg)) {
1938 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
1945 for (reg = 0; reg < 8; reg++) {
1946 if (regmask_save & (1 << reg)) {
1947 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
1953 if (save_arg_vars) {
1954 for (reg = 0; reg < 32; reg++) {
1955 if (save_arg_vars & (1 << reg)) {
1956 fprintf(fout, " u32 s_a%d;\n", reg + 1);
1962 if (cmp_result_vars) {
1963 for (i = 0; i < 8; i++) {
1964 if (cmp_result_vars & (1 << i)) {
1965 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
1972 fprintf(fout, " u64 mul_tmp;\n");
1977 fprintf(fout, "\n");
1980 for (i = 0; i < opcnt; i++)
1982 if (g_labels[i][0] != 0 && g_label_refs[i] != NULL)
1983 fprintf(fout, "\n%s:\n", g_labels[i]);
1986 if (po->flags & OPF_RMD)
1991 #define assert_operand_cnt(n_) \
1992 if (po->operand_cnt != n_) \
1993 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
1995 // conditional/flag using op?
1996 if (po->flags & OPF_CC)
2001 pfo = split_cond(po, po->op, &is_inv);
2003 // we go through all this trouble to avoid using parsed_flag_op,
2004 // which makes generated code much nicer
2005 if (delayed_flag_op != NULL)
2007 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2010 else if (last_arith_dst != NULL
2011 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
2013 out_src_opr(buf3, sizeof(buf3), po, last_arith_dst, 0);
2014 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2015 last_arith_dst->lmod, buf3);
2018 else if (po->datap != NULL) {
2019 // use preprocessed results
2021 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2022 ferr(po, "not prepared for pfo %d\n", pfo);
2024 // note: is_inv was not yet applied
2025 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2026 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2029 ferr(po, "all methods of finding comparison failed\n");
2032 if (po->flags & OPF_JMP) {
2033 fprintf(fout, " if %s\n", buf1);
2035 else if (po->op == OP_ADC || po->op == OP_SBB) {
2037 fprintf(fout, " cond_%s = %s;\n",
2038 parsed_flag_op_names[pfo], buf1);
2040 else if (po->flags & OPF_DATA) { // SETcc
2041 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2042 fprintf(fout, " %s = %s;", buf2, buf1);
2045 ferr(po, "unhandled conditional op\n");
2049 pfomask = po->pfomask;
2054 assert_operand_cnt(2);
2055 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2056 fprintf(fout, " %s = %s;",
2057 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2058 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2062 assert_operand_cnt(2);
2063 po->operand[1].lmod = OPLM_DWORD; // always
2064 fprintf(fout, " %s = %s;",
2065 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2066 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 1));
2070 assert_operand_cnt(2);
2071 fprintf(fout, " %s = %s;",
2072 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2073 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2077 assert_operand_cnt(2);
2078 switch (po->operand[1].lmod) {
2080 strcpy(buf3, "(s8)");
2083 strcpy(buf3, "(s16)");
2086 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2088 fprintf(fout, " %s = %s%s;",
2089 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2091 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2095 assert_operand_cnt(1);
2096 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2097 fprintf(fout, " %s = ~%s;", buf1, buf1);
2101 assert_operand_cnt(2);
2102 fprintf(fout, " %s = (s32)%s >> 31;",
2103 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2104 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2105 strcpy(g_comment, "cdq");
2110 assert_operand_cnt(3);
2111 if (po->flags & OPF_REP) {
2112 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2113 lmod_bytes(po, po->operand[0].lmod));
2114 fprintf(fout, " %sedi = eax;",
2115 lmod_cast_u_ptr(po, po->operand[0].lmod));
2116 strcpy(g_comment, "rep stos");
2119 fprintf(fout, " %sedi = eax; edi += %d;",
2120 lmod_cast_u_ptr(po, po->operand[0].lmod),
2121 lmod_bytes(po, po->operand[0].lmod));
2122 strcpy(g_comment, "stos");
2128 assert_operand_cnt(3);
2129 j = lmod_bytes(po, po->operand[0].lmod);
2130 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2131 if (po->flags & OPF_REP) {
2133 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2136 " %sedi = %sesi;", buf1, buf1);
2137 strcpy(g_comment, "rep movs");
2140 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2142 strcpy(g_comment, "movs");
2146 // arithmetic w/flags
2151 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2156 assert_operand_cnt(2);
2157 fprintf(fout, " %s %s= %s;",
2158 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2160 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2161 last_arith_dst = &po->operand[0];
2162 delayed_flag_op = NULL;
2166 assert_operand_cnt(2);
2167 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2168 fprintf(fout, " %s = %s%s >> %s;", buf1,
2169 lmod_cast_s(po, po->operand[0].lmod), buf1,
2170 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2171 last_arith_dst = &po->operand[0];
2172 delayed_flag_op = NULL;
2177 assert_operand_cnt(2);
2178 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2179 if (po->operand[1].type == OPT_CONST) {
2180 j = po->operand[1].val;
2181 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2182 fprintf(fout, po->op == OP_ROL ?
2183 " %s = (%s << %d) | (%s >> %d);" :
2184 " %s = (%s >> %d) | (%s << %d);",
2185 buf1, buf1, j, buf1,
2186 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2190 last_arith_dst = &po->operand[0];
2191 delayed_flag_op = NULL;
2195 assert_operand_cnt(2);
2196 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2197 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2198 // special case for XOR
2199 fprintf(fout, " %s = 0;",
2200 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2201 last_arith_dst = &po->operand[0];
2202 delayed_flag_op = NULL;
2209 assert_operand_cnt(2);
2210 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2211 fprintf(fout, " %s %s= %s + cond_c;",
2212 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2214 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], 0));
2215 last_arith_dst = &po->operand[0];
2216 delayed_flag_op = NULL;
2221 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2222 if (po->operand[0].type == OPT_REG) {
2223 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2224 fprintf(fout, " %s%s;", buf1, buf2);
2227 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2228 fprintf(fout, " %s %s= 1;", buf1, buf2);
2230 last_arith_dst = &po->operand[0];
2231 delayed_flag_op = NULL;
2235 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2236 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0);
2237 fprintf(fout, " %s = -%s%s;", buf1,
2238 lmod_cast_s(po, po->operand[0].lmod), buf2);
2239 last_arith_dst = &po->operand[0];
2240 delayed_flag_op = NULL;
2241 if (pfomask & (1 << PFO_C)) {
2242 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2243 pfomask &= ~(1 << PFO_C);
2248 if (po->operand_cnt == 2)
2250 if (po->operand_cnt == 3)
2251 ferr(po, "TODO imul3\n");
2254 assert_operand_cnt(1);
2255 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2256 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
2257 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0], 0));
2258 fprintf(fout, " edx = mul_tmp >> 32;\n");
2259 fprintf(fout, " eax = mul_tmp;");
2260 last_arith_dst = NULL;
2261 delayed_flag_op = NULL;
2266 assert_operand_cnt(1);
2267 if (po->operand[0].lmod != OPLM_DWORD)
2268 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2270 // 32bit division is common, look for it
2271 if (scan_for_cdq_edx(i - 1) >= 0) {
2272 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2273 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2274 po->op == OP_IDIV));
2275 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2276 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2279 ferr(po, "TODO 64bit divident\n");
2280 last_arith_dst = NULL;
2281 delayed_flag_op = NULL;
2286 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2288 for (j = 0; j < 8; j++) {
2289 if (pfomask & (1 << j)) {
2290 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2291 fprintf(fout, " cond_%s = %s;",
2292 parsed_flag_op_names[j], buf1);
2299 delayed_flag_op = po;
2302 // note: we reuse OP_Jcc for SETcc, only flags differ
2303 case OP_JO ... OP_JG:
2304 if (po->flags & OPF_JMP)
2305 fprintf(fout, " goto %s;", po->operand[0].name);
2306 // else SETcc - should already be handled
2310 assert_operand_cnt(1);
2311 if (po->operand[0].type != OPT_LABEL)
2312 ferr(po, "unhandled call type\n");
2314 fprintf(fout, " goto %s;", po->operand[0].name);
2318 assert_operand_cnt(1);
2321 ferr(po, "NULL pp\n");
2323 if (po->operand[0].type != OPT_LABEL)
2324 fprintf(fout, " icall%d = (void *)%s;\n", i,
2325 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0));
2328 if (!IS(pp->ret_type, "void")) {
2329 if (po->flags & OPF_TAIL)
2330 fprintf(fout, "return ");
2332 fprintf(fout, "eax = ");
2333 if (strchr(pp->ret_type, '*'))
2334 fprintf(fout, "(u32)");
2337 if (po->operand[0].type != OPT_LABEL)
2338 fprintf(fout, "icall%d(", i);
2340 fprintf(fout, "%s(", opr_name(po, 0));
2341 for (arg = 0; arg < pp->argc; arg++) {
2343 fprintf(fout, ", ");
2345 if (strchr(pp->arg[arg].type, '*'))
2346 fprintf(fout, "(%s)", pp->arg[arg].type);
2348 if (pp->arg[arg].reg != NULL) {
2349 fprintf(fout, "%s", pp->arg[arg].reg);
2354 tmp_op = pp->arg[arg].datap;
2356 ferr(po, "parsed_op missing for arg%d\n", arg);
2357 if (tmp_op->argmask) {
2358 fprintf(fout, "s_a%d", arg + 1);
2362 out_src_opr(buf1, sizeof(buf1),
2363 tmp_op, &tmp_op->operand[0], 0));
2366 fprintf(fout, ");");
2368 if (po->flags & OPF_TAIL) {
2369 strcpy(g_comment, "tailcall");
2370 if (IS(pp->ret_type, "void"))
2371 fprintf(fout, "\n return;");
2373 delayed_flag_op = NULL;
2374 last_arith_dst = NULL;
2378 if (IS(g_func_pp.ret_type, "void"))
2379 fprintf(fout, " return;");
2380 else if (strchr(g_func_pp.ret_type, '*'))
2381 fprintf(fout, " return (%s)eax;",
2382 g_func_pp.ret_type);
2384 fprintf(fout, " return eax;");
2389 // special case - saved func arg
2390 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2391 for (j = 0; j < 32; j++) {
2392 if (po->argmask & (1 << j))
2393 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
2397 else if (po->flags & OPF_RSAVE) {
2398 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2399 fprintf(fout, " s_%s = %s;", buf1, buf1);
2402 ferr(po, "stray push encountered\n");
2406 if (po->flags & OPF_RSAVE) {
2407 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], 0);
2408 fprintf(fout, " %s = s_%s;", buf1, buf1);
2411 ferr(po, "stray pop encountered\n");
2419 ferr(po, "unhandled op type %d, flags %x\n",
2424 if (g_comment[0] != 0) {
2425 fprintf(fout, " // %s", g_comment);
2430 fprintf(fout, "\n");
2433 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
2435 // see is delayed flag stuff is still valid
2436 if (delayed_flag_op != NULL && delayed_flag_op != po) {
2437 if (is_any_opr_modified(delayed_flag_op, po))
2438 delayed_flag_op = NULL;
2441 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
2442 if (is_opr_modified(last_arith_dst, po))
2443 last_arith_dst = NULL;
2447 fprintf(fout, "}\n\n");
2450 for (i = 0; i < opcnt; i++) {
2451 if (ops[i].op == OP_CALL) {
2459 proto_release(&g_func_pp);
2462 static void set_label(int i, const char *name)
2468 p = strchr(name, ':');
2472 if (len > sizeof(g_labels[0]) - 1)
2473 aerr("label '%s' too long: %d\n", name, len);
2474 if (g_labels[i][0] != 0)
2475 aerr("dupe label '%s'?\n", name);
2476 memcpy(g_labels[i], name, len);
2477 g_labels[i][len] = 0;
2480 // '=' needs special treatment..
2481 static char *next_word_s(char *w, size_t wsize, char *s)
2487 for (i = 0; i < wsize - 1; i++) {
2488 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
2494 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
2495 printf("warning: '%s' truncated\n", w);
2500 static int cmpstringp(const void *p1, const void *p2)
2502 return strcmp(*(char * const *)p1, *(char * const *)p2);
2505 int main(int argc, char *argv[])
2507 FILE *fout, *fasm, *fhdr, *frlist;
2509 char words[16][256];
2510 int ida_func_attr = 0;
2513 int skip_warned = 0;
2515 char **rlist = NULL;
2517 int rlist_alloc = 0;
2526 if (argv[1] && IS(argv[1], "-v")) {
2531 if (argc < arg + 3) {
2532 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
2539 asmfn = argv[arg++];
2540 fasm = fopen(asmfn, "r");
2541 my_assert_not(fasm, NULL);
2543 hdrfn = argv[arg++];
2544 fhdr = fopen(hdrfn, "r");
2545 my_assert_not(fhdr, NULL);
2548 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
2549 my_assert_not(rlist, NULL);
2550 // needs special handling..
2551 rlist[rlist_len++] = "__alloca_probe";
2553 for (; arg < argc; arg++) {
2554 frlist = fopen(argv[arg], "r");
2555 my_assert_not(frlist, NULL);
2557 while (fgets(line, sizeof(line), frlist)) {
2559 if (*p == 0 || *p == ';' || *p == '#')
2562 p = next_word(words[0], sizeof(words[0]), p);
2563 if (words[0][0] == 0)
2566 if (rlist_len >= rlist_alloc) {
2567 rlist_alloc = rlist_alloc * 2 + 64;
2568 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
2569 my_assert_not(rlist, NULL);
2571 rlist[rlist_len++] = strdup(words[0]);
2579 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
2581 fout = fopen(argv[arg_out], "w");
2582 my_assert_not(fout, NULL);
2585 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
2586 my_assert_not(g_eqs, NULL);
2588 while (fgets(line, sizeof(line), fasm))
2597 static const char *attrs[] = {
2605 if (p[2] != 'A' || strncmp(p, "; Attributes:", 13) != 0)
2608 // parse IDA's attribute-list comment
2611 // get rid of random tabs
2612 for (i = 0; p[i] != 0; i++)
2616 for (; *p != 0; p = sskip(p)) {
2617 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
2618 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
2619 ida_func_attr |= 1 << i;
2620 p += strlen(attrs[i]);
2624 if (i == ARRAY_SIZE(attrs)) {
2625 anote("unparsed IDA attr: %s\n", p);
2628 if (IS(attrs[i], "fpd=")) {
2629 p = next_word(words[0], sizeof(words[0]), p);
2636 memset(words, 0, sizeof(words));
2637 for (wordc = 0; wordc < 16; wordc++) {
2638 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
2639 if (*p == 0 || *p == ';') {
2647 awarn("wordc == 0?\n");
2651 // don't care about this:
2652 if (words[0][0] == '.'
2653 || IS(words[0], "include")
2654 || IS(words[0], "assume") || IS(words[1], "segment")
2655 || IS(words[0], "align"))
2660 if (IS(words[1], "proc")) {
2662 aerr("proc '%s' while in_func '%s'?\n",
2665 if ((ida_func_attr & IDAFA_THUNK)
2666 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
2668 strcpy(g_func, words[0]);
2669 set_label(0, words[0]);
2674 if (IS(words[1], "endp")) {
2676 aerr("endp '%s' while not in_func?\n", words[0]);
2677 if (!IS(g_func, words[0]))
2678 aerr("endp '%s' while in_func '%s'?\n",
2681 if (in_func && !skip_func)
2682 gen_func(fout, fhdr, g_func, pi);
2689 memset(&ops, 0, pi * sizeof(ops[0]));
2690 memset(g_labels, 0, pi * sizeof(g_labels[0]));
2691 memset(g_label_refs, 0, pi * sizeof(g_label_refs[0]));
2699 p = strchr(words[0], ':');
2701 set_label(pi, words[0]);
2705 if (!in_func || skip_func) {
2706 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
2708 anote("skipping from '%s'\n", g_labels[pi]);
2711 g_labels[pi][0] = 0;
2715 if (IS(words[1], "=")) {
2717 aerr("unhandled equ, wc=%d\n", wordc);
2718 if (g_eqcnt >= eq_alloc) {
2720 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
2721 my_assert_not(g_eqs, NULL);
2724 len = strlen(words[0]);
2725 if (len > sizeof(g_eqs[0].name) - 1)
2726 aerr("equ name too long: %d\n", len);
2727 strcpy(g_eqs[g_eqcnt].name, words[0]);
2729 if (!IS(words[3], "ptr"))
2730 aerr("unhandled equ\n");
2731 if (IS(words[2], "dword"))
2732 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
2733 else if (IS(words[2], "word"))
2734 g_eqs[g_eqcnt].lmod = OPLM_WORD;
2735 else if (IS(words[2], "byte"))
2736 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
2738 aerr("bad lmod: '%s'\n", words[2]);
2740 g_eqs[g_eqcnt].offset = parse_number(words[4]);
2745 if (pi >= ARRAY_SIZE(ops))
2746 aerr("too many ops\n");
2748 parse_op(&ops[pi], words, wordc);
2759 // vim:ts=2:shiftwidth=2:expandtab