notaz.gp2x.de / ia32rtools.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
fixes
[ia32rtools.git] / tools / translate.c
... / ...
CommitLineData
1#define _GNU_SOURCE
2#include <stdio.h>
3#include <stdlib.h>
4#include <string.h>
5
6#include "my_assert.h"
7#include "my_str.h"
8
9#define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
10#define IS(w, y) !strcmp(w, y)
11#define IS_START(w, y) !strncmp(w, y, strlen(y))
12
13#include "protoparse.h"
14
15static const char *asmfn;
16static int asmln;
17static FILE *g_fhdr;
18
19#define anote(fmt, ...) \
20 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
21#define awarn(fmt, ...) \
22 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
23#define aerr(fmt, ...) do { \
24 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
25 fcloseall(); \
26 exit(1); \
27} while (0)
28
29enum op_flags {
30 OPF_RMD = (1 << 0), /* removed or optimized out */
31 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
32 OPF_FLAGS = (1 << 2), /* sets flags */
33 OPF_JMP = (1 << 3), /* branches, ret and call */
34 OPF_CC = (1 << 4), /* uses flags */
35 OPF_TAIL = (1 << 5), /* ret or tail call */
36 OPF_RSAVE = (1 << 6), /* push/pop is local reg save/load */
37 OPF_REP = (1 << 7), /* prefixed by rep */
38 OPF_REPZ = (1 << 8), /* rep is repe/repz */
39 OPF_REPNZ = (1 << 9), /* rep is repne/repnz */
40 OPF_FARG = (1 << 10), /* push collected as func arg (no reuse) */
41 OPF_EBP_S = (1 << 11), /* ebp used as scratch, not BP */
42};
43
44enum op_op {
45 OP_INVAL,
46 OP_NOP,
47 OP_PUSH,
48 OP_POP,
49 OP_MOV,
50 OP_LEA,
51 OP_MOVZX,
52 OP_MOVSX,
53 OP_NOT,
54 OP_CDQ,
55 OP_STOS,
56 OP_MOVS,
57 OP_CMPS,
58 OP_RET,
59 OP_ADD,
60 OP_SUB,
61 OP_AND,
62 OP_OR,
63 OP_XOR,
64 OP_SHL,
65 OP_SHR,
66 OP_SAR,
67 OP_ROL,
68 OP_ROR,
69 OP_ADC,
70 OP_SBB,
71 OP_INC,
72 OP_DEC,
73 OP_NEG,
74 OP_MUL,
75 OP_IMUL,
76 OP_DIV,
77 OP_IDIV,
78 OP_TEST,
79 OP_CMP,
80 OP_CALL,
81 OP_JMP,
82 OP_JO,
83 OP_JNO,
84 OP_JC,
85 OP_JNC,
86 OP_JZ,
87 OP_JNZ,
88 OP_JBE,
89 OP_JA,
90 OP_JS,
91 OP_JNS,
92 OP_JP,
93 OP_JNP,
94 OP_JL,
95 OP_JGE,
96 OP_JLE,
97 OP_JG,
98};
99
100enum opr_type {
101 OPT_UNSPEC,
102 OPT_REG,
103 OPT_REGMEM,
104 OPT_LABEL,
105 OPT_OFFSET,
106 OPT_CONST,
107};
108
109// must be sorted (larger len must be further in enum)
110enum opr_lenmod {
111 OPLM_UNSPEC,
112 OPLM_BYTE,
113 OPLM_WORD,
114 OPLM_DWORD,
115};
116
117#define MAX_OPERANDS 3
118
119struct parsed_opr {
120 enum opr_type type;
121 enum opr_lenmod lmod;
122 unsigned int is_ptr:1; // pointer in C
123 unsigned int is_array:1; // array in C
124 unsigned int type_from_var:1; // .. in header, sometimes wrong
125 unsigned int size_mismatch:1; // type override differs from C
126 unsigned int size_lt:1; // type override is larger than C
127 int reg;
128 unsigned int val;
129 char name[256];
130};
131
132struct parsed_op {
133 enum op_op op;
134 struct parsed_opr operand[MAX_OPERANDS];
135 unsigned int flags;
136 int operand_cnt;
137 int regmask_src; // all referensed regs
138 int regmask_dst;
139 int pfomask; // flagop: parsed_flag_op that can't be delayed
140 int argnum; // push: altered before call arg #
141 int cc_scratch; // scratch storage during analysis
142 int bt_i; // branch target for branches
143 struct parsed_data *btj;// branch targets for jumptables
144 void *datap;
145};
146
147// datap:
148// OP_CALL - ptr to parsed_proto
149// (OPF_CC) - point to one of (OPF_FLAGS) that affects cc op
150
151struct parsed_equ {
152 char name[64];
153 enum opr_lenmod lmod;
154 int offset;
155};
156
157struct parsed_data {
158 char label[256];
159 enum opr_type type;
160 enum opr_lenmod lmod;
161 int count;
162 int count_alloc;
163 struct {
164 union {
165 char *label;
166 unsigned int val;
167 } u;
168 int bt_i;
169 } *d;
170};
171
172struct label_ref {
173 int i;
174 struct label_ref *next;
175};
176
177enum ida_func_attr {
178 IDAFA_BP_FRAME = (1 << 0),
179 IDAFA_LIB_FUNC = (1 << 1),
180 IDAFA_STATIC = (1 << 2),
181 IDAFA_NORETURN = (1 << 3),
182 IDAFA_THUNK = (1 << 4),
183 IDAFA_FPD = (1 << 5),
184};
185
186#define MAX_OPS 4096
187
188static struct parsed_op ops[MAX_OPS];
189static struct parsed_equ *g_eqs;
190static int g_eqcnt;
191static char g_labels[MAX_OPS][32];
192static struct label_ref g_label_refs[MAX_OPS];
193static const struct parsed_proto *g_func_pp;
194static struct parsed_data *g_func_pd;
195static int g_func_pd_cnt;
196static char g_func[256];
197static char g_comment[256];
198static int g_bp_frame;
199static int g_sp_frame;
200static int g_stack_fsz;
201static int g_ida_func_attr;
202#define ferr(op_, fmt, ...) do { \
203 printf("error:%s:#%zd: '%s': " fmt, g_func, (op_) - ops, \
204 dump_op(op_), ##__VA_ARGS__); \
205 fcloseall(); \
206 exit(1); \
207} while (0)
208#define fnote(op_, fmt, ...) \
209 printf("error:%s:#%zd: '%s': " fmt, g_func, (op_) - ops, \
210 dump_op(op_), ##__VA_ARGS__)
211
212#define MAX_REGS 8
213
214const char *regs_r32[] = { "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp" };
215const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
216const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
217const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
218
219enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
220
221// possible basic comparison types (without inversion)
222enum parsed_flag_op {
223 PFO_O, // 0 OF=1
224 PFO_C, // 2 CF=1
225 PFO_Z, // 4 ZF=1
226 PFO_BE, // 6 CF=1||ZF=1
227 PFO_S, // 8 SF=1
228 PFO_P, // a PF=1
229 PFO_L, // c SF!=OF
230 PFO_LE, // e ZF=1||SF!=OF
231};
232
233static const char *parsed_flag_op_names[] = {
234 "o", "c", "z", "be", "s", "p", "l", "le"
235};
236
237static int char_array_i(const char *array[], size_t len, const char *s)
238{
239 int i;
240
241 for (i = 0; i < len; i++)
242 if (IS(s, array[i]))
243 return i;
244
245 return -1;
246}
247
248static void printf_number(char *buf, size_t buf_size,
249 unsigned long number)
250{
251 // output in C-friendly form
252 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
253}
254
255static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
256{
257 int reg;
258
259 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
260 if (reg >= 0) {
261 *reg_lmod = OPLM_DWORD;
262 return reg;
263 }
264 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
265 if (reg >= 0) {
266 *reg_lmod = OPLM_WORD;
267 return reg;
268 }
269 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
270 if (reg >= 0) {
271 *reg_lmod = OPLM_BYTE;
272 return reg;
273 }
274 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
275 if (reg >= 0) {
276 *reg_lmod = OPLM_BYTE;
277 return reg;
278 }
279
280 return -1;
281}
282
283static unsigned long parse_number(const char *number)
284{
285 int len = strlen(number);
286 const char *p = number;
287 char *endp = NULL;
288 unsigned long ret;
289 int neg = 0;
290 int bad;
291
292 if (*p == '-') {
293 neg = 1;
294 p++;
295 }
296 if (len > 1 && *p == '0')
297 p++;
298 if (number[len - 1] == 'h') {
299 ret = strtoul(p, &endp, 16);
300 bad = (*endp != 'h');
301 }
302 else {
303 ret = strtoul(p, &endp, 10);
304 bad = (*endp != 0);
305 }
306 if (bad)
307 aerr("number parsing failed\n");
308 if (neg)
309 ret = -ret;
310 return ret;
311}
312
313static int parse_indmode(char *name, int *regmask, int need_c_cvt)
314{
315 enum opr_lenmod lmod;
316 char cvtbuf[256];
317 char *d = cvtbuf;
318 char *s = name;
319 char w[64];
320 long number;
321 int reg;
322 int c = 0;
323
324 *d = 0;
325
326 while (*s != 0) {
327 d += strlen(d);
328 while (my_isblank(*s))
329 s++;
330 for (; my_issep(*s); d++, s++)
331 *d = *s;
332 while (my_isblank(*s))
333 s++;
334 *d = 0;
335
336 // skip 'ds:' prefix
337 if (IS_START(s, "ds:"))
338 s += 3;
339
340 s = next_idt(w, sizeof(w), s);
341 if (w[0] == 0)
342 break;
343 c++;
344
345 reg = parse_reg(&lmod, w);
346 if (reg >= 0) {
347 *regmask |= 1 << reg;
348 goto pass;
349 }
350
351 if ('0' <= w[0] && w[0] <= '9') {
352 number = parse_number(w);
353 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
354 continue;
355 }
356
357 // probably some label/identifier - pass
358
359pass:
360 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
361 }
362
363 if (need_c_cvt)
364 strcpy(name, cvtbuf);
365
366 return c;
367}
368
369static int is_reg_in_str(const char *s)
370{
371 int i;
372
373 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
374 return 0;
375
376 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
377 if (!strncmp(s, regs_r32[i], 3))
378 return 1;
379
380 return 0;
381}
382
383static const char *parse_stack_el(const char *name, char *extra_reg)
384{
385 const char *p, *p2, *s;
386 char *endp = NULL;
387 char buf[32];
388 long val;
389 int len;
390
391 p = name;
392 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
393 p += 4;
394 if (extra_reg != NULL) {
395 strncpy(extra_reg, name, 3);
396 extra_reg[4] = 0;
397 }
398 }
399
400 if (IS_START(p, "ebp+")) {
401 p += 4;
402
403 p2 = strchr(p, '+');
404 if (p2 != NULL && is_reg_in_str(p)) {
405 if (extra_reg != NULL) {
406 strncpy(extra_reg, p, p2 - p);
407 extra_reg[p2 - p] = 0;
408 }
409 p = p2 + 1;
410 }
411
412 if (!('0' <= *p && *p <= '9'))
413 return p;
414
415 return NULL;
416 }
417
418 if (!IS_START(name, "esp+"))
419 return NULL;
420
421 p = strchr(name + 4, '+');
422 if (p) {
423 // must be a number after esp+, already converted to 0x..
424 s = name + 4;
425 if (!('0' <= *s && *s <= '9')) {
426 aerr("%s nan?\n", __func__);
427 return NULL;
428 }
429 if (s[0] == '0' && s[1] == 'x')
430 s += 2;
431 len = p - s;
432 if (len < sizeof(buf) - 1) {
433 strncpy(buf, s, len);
434 buf[len] = 0;
435 val = strtol(buf, &endp, 16);
436 if (val == 0 || *endp != 0) {
437 aerr("%s num parse fail for '%s'\n", __func__, buf);
438 return NULL;
439 }
440 }
441 p++;
442 }
443 else
444 p = name + 4;
445
446 if ('0' <= *p && *p <= '9')
447 return NULL;
448
449 return p;
450}
451
452static int guess_lmod_from_name(struct parsed_opr *opr)
453{
454 if (!strncmp(opr->name, "dword_", 6)) {
455 opr->lmod = OPLM_DWORD;
456 return 1;
457 }
458 if (!strncmp(opr->name, "word_", 5)) {
459 opr->lmod = OPLM_WORD;
460 return 1;
461 }
462 if (!strncmp(opr->name, "byte_", 5)) {
463 opr->lmod = OPLM_BYTE;
464 return 1;
465 }
466 return 0;
467}
468
469static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
470 const struct parsed_type *c_type)
471{
472 static const char *dword_types[] = {
473 "int", "_DWORD", "UINT_PTR",
474 "DWORD", "HANDLE", "HWND", "HMODULE",
475 "WPARAM", "LPARAM", "UINT",
476 };
477 static const char *word_types[] = {
478 "uint16_t", "int16_t",
479 "unsigned __int16", "__int16",
480 };
481 static const char *byte_types[] = {
482 "uint8_t", "int8_t", "char",
483 "unsigned __int8", "__int8", "BYTE",
484 "_UNKNOWN",
485 };
486 const char *n;
487 int i;
488
489 if (c_type->is_ptr) {
490 *lmod = OPLM_DWORD;
491 return 1;
492 }
493
494 n = skip_type_mod(c_type->name);
495
496 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
497 if (IS(n, dword_types[i])) {
498 *lmod = OPLM_DWORD;
499 return 1;
500 }
501 }
502
503 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
504 if (IS(n, word_types[i])) {
505 *lmod = OPLM_WORD;
506 return 1;
507 }
508 }
509
510 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
511 if (IS(n, byte_types[i])) {
512 *lmod = OPLM_BYTE;
513 return 1;
514 }
515 }
516
517 return 0;
518}
519
520static enum opr_type lmod_from_directive(const char *d)
521{
522 if (IS(d, "dd"))
523 return OPLM_DWORD;
524 else if (IS(d, "dw"))
525 return OPLM_WORD;
526 else if (IS(d, "db"))
527 return OPLM_BYTE;
528
529 aerr("unhandled directive: '%s'\n", d);
530 return OPLM_UNSPEC;
531}
532
533static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
534 int *regmask)
535{
536 opr->type = OPT_REG;
537 opr->reg = reg;
538 opr->lmod = lmod;
539 *regmask |= 1 << reg;
540}
541
542static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
543 int *extra_offs);
544
545static int parse_operand(struct parsed_opr *opr,
546 int *regmask, int *regmask_indirect,
547 char words[16][256], int wordc, int w, unsigned int op_flags)
548{
549 const struct parsed_proto *pp;
550 enum opr_lenmod tmplmod;
551 unsigned long number;
552 int ret, len;
553 int wordc_in;
554 char *tmp;
555 int i;
556
557 if (w >= wordc)
558 aerr("parse_operand w %d, wordc %d\n", w, wordc);
559
560 opr->reg = xUNSPEC;
561
562 for (i = w; i < wordc; i++) {
563 len = strlen(words[i]);
564 if (words[i][len - 1] == ',') {
565 words[i][len - 1] = 0;
566 wordc = i + 1;
567 break;
568 }
569 }
570
571 wordc_in = wordc - w;
572
573 if ((op_flags & OPF_JMP) && wordc_in > 0
574 && !('0' <= words[w][0] && words[w][0] <= '9'))
575 {
576 const char *label = NULL;
577
578 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
579 && IS(words[w + 1], "ptr"))
580 label = words[w + 2];
581 else if (wordc_in == 2 && IS(words[w], "short"))
582 label = words[w + 1];
583 else if (wordc_in == 1
584 && strchr(words[w], '[') == NULL
585 && parse_reg(&tmplmod, words[w]) < 0)
586 label = words[w];
587
588 if (label != NULL) {
589 opr->type = OPT_LABEL;
590 if (IS_START(label, "ds:"))
591 label += 3;
592 strcpy(opr->name, label);
593 return wordc;
594 }
595 }
596
597 if (wordc_in >= 3) {
598 if (IS(words[w + 1], "ptr")) {
599 if (IS(words[w], "dword"))
600 opr->lmod = OPLM_DWORD;
601 else if (IS(words[w], "word"))
602 opr->lmod = OPLM_WORD;
603 else if (IS(words[w], "byte"))
604 opr->lmod = OPLM_BYTE;
605 else
606 aerr("type parsing failed\n");
607 w += 2;
608 wordc_in = wordc - w;
609 }
610 }
611
612 if (wordc_in == 2) {
613 if (IS(words[w], "offset")) {
614 opr->type = OPT_OFFSET;
615 strcpy(opr->name, words[w + 1]);
616 return wordc;
617 }
618 if (IS(words[w], "(offset")) {
619 char *p = strchr(words[w + 1], ')');
620 if (p == NULL)
621 aerr("parse of bracketed offset failed\n");
622 *p = 0;
623 opr->type = OPT_OFFSET;
624 strcpy(opr->name, words[w + 1]);
625 return wordc;
626 }
627 }
628
629 if (wordc_in != 1)
630 aerr("parse_operand 1 word expected\n");
631
632 tmp = words[w];
633 if (IS_START(tmp, "ds:"))
634 tmp += 3;
635 strcpy(opr->name, tmp);
636
637 if (words[w][0] == '[') {
638 opr->type = OPT_REGMEM;
639 ret = sscanf(words[w], "[%[^]]]", opr->name);
640 if (ret != 1)
641 aerr("[] parse failure\n");
642
643 parse_indmode(opr->name, regmask_indirect, 1);
644 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL)) {
645 // might be an equ
646 struct parsed_equ *eq =
647 equ_find(NULL, parse_stack_el(opr->name, NULL), &i);
648 if (eq)
649 opr->lmod = eq->lmod;
650 }
651 return wordc;
652 }
653 else if (strchr(words[w], '[')) {
654 // label[reg] form
655 opr->type = OPT_REGMEM;
656 if (opr->lmod == OPLM_UNSPEC)
657 guess_lmod_from_name(opr);
658 parse_indmode(strchr(words[w], '['), regmask_indirect, 0);
659 return wordc;
660 }
661 else if (('0' <= words[w][0] && words[w][0] <= '9')
662 || words[w][0] == '-')
663 {
664 number = parse_number(words[w]);
665 opr->type = OPT_CONST;
666 opr->val = number;
667 printf_number(opr->name, sizeof(opr->name), number);
668 return wordc;
669 }
670
671 ret = parse_reg(&tmplmod, opr->name);
672 if (ret >= 0) {
673 setup_reg_opr(opr, ret, tmplmod, regmask);
674 return wordc;
675 }
676
677 // most likely var in data segment
678 opr->type = OPT_LABEL;
679
680 pp = proto_parse(g_fhdr, opr->name);
681 if (pp != NULL) {
682 if (pp->is_fptr) {
683 opr->lmod = OPLM_DWORD;
684 opr->is_ptr = 1;
685 }
686 else {
687 tmplmod = OPLM_UNSPEC;
688 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
689 anote("unhandled C type '%s' for '%s'\n",
690 pp->type.name, opr->name);
691
692 if (opr->lmod == OPLM_UNSPEC) {
693 opr->lmod = tmplmod;
694 opr->type_from_var = 1;
695 }
696 else if (opr->lmod != tmplmod) {
697 opr->size_mismatch = 1;
698 if (tmplmod < opr->lmod)
699 opr->size_lt = 1;
700 }
701 opr->is_ptr = pp->type.is_ptr;
702 }
703 opr->is_array = pp->type.is_array;
704 }
705
706 if (opr->lmod == OPLM_UNSPEC)
707 guess_lmod_from_name(opr);
708 return wordc;
709}
710
711static const struct {
712 const char *name;
713 unsigned int flags;
714} pref_table[] = {
715 { "rep", OPF_REP },
716 { "repe", OPF_REP|OPF_REPZ },
717 { "repz", OPF_REP|OPF_REPZ },
718 { "repne", OPF_REP|OPF_REPNZ },
719 { "repnz", OPF_REP|OPF_REPNZ },
720};
721
722static const struct {
723 const char *name;
724 enum op_op op;
725 unsigned int minopr;
726 unsigned int maxopr;
727 unsigned int flags;
728} op_table[] = {
729 { "nop", OP_NOP, 0, 0, 0 },
730 { "push", OP_PUSH, 1, 1, 0 },
731 { "pop", OP_POP, 1, 1, OPF_DATA },
732 { "mov" , OP_MOV, 2, 2, OPF_DATA },
733 { "lea", OP_LEA, 2, 2, OPF_DATA },
734 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
735 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
736 { "not", OP_NOT, 1, 1, OPF_DATA },
737 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
738 { "stosb",OP_STOS, 0, 0, OPF_DATA },
739 { "stosw",OP_STOS, 0, 0, OPF_DATA },
740 { "stosd",OP_STOS, 0, 0, OPF_DATA },
741 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
742 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
743 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
744 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
745 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
746 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
747 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
748 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
749 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
750 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
751 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
752 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
753 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
754 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
755 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
756 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
757 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
758 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
759 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC },
760 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
761 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
762 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
763 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
764 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
765 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
766 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
767 { "test", OP_TEST, 2, 2, OPF_FLAGS },
768 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
769 { "retn", OP_RET, 0, 1, OPF_TAIL },
770 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
771 { "jmp", OP_JMP, 1, 1, OPF_JMP },
772 { "jo", OP_JO, 1, 1, OPF_JMP|OPF_CC }, // 70 OF=1
773 { "jno", OP_JNO, 1, 1, OPF_JMP|OPF_CC }, // 71 OF=0
774 { "jc", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72 CF=1
775 { "jb", OP_JC, 1, 1, OPF_JMP|OPF_CC }, // 72
776 { "jnc", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73 CF=0
777 { "jnb", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
778 { "jae", OP_JNC, 1, 1, OPF_JMP|OPF_CC }, // 73
779 { "jz", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74 ZF=1
780 { "je", OP_JZ, 1, 1, OPF_JMP|OPF_CC }, // 74
781 { "jnz", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75 ZF=0
782 { "jne", OP_JNZ, 1, 1, OPF_JMP|OPF_CC }, // 75
783 { "jbe", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76 CF=1 || ZF=1
784 { "jna", OP_JBE, 1, 1, OPF_JMP|OPF_CC }, // 76
785 { "ja", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77 CF=0 && ZF=0
786 { "jnbe", OP_JA, 1, 1, OPF_JMP|OPF_CC }, // 77
787 { "js", OP_JS, 1, 1, OPF_JMP|OPF_CC }, // 78 SF=1
788 { "jns", OP_JNS, 1, 1, OPF_JMP|OPF_CC }, // 79 SF=0
789 { "jp", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a PF=1
790 { "jpe", OP_JP, 1, 1, OPF_JMP|OPF_CC }, // 7a
791 { "jnp", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b PF=0
792 { "jpo", OP_JNP, 1, 1, OPF_JMP|OPF_CC }, // 7b
793 { "jl", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c SF!=OF
794 { "jnge", OP_JL, 1, 1, OPF_JMP|OPF_CC }, // 7c
795 { "jge", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d SF=OF
796 { "jnl", OP_JGE, 1, 1, OPF_JMP|OPF_CC }, // 7d
797 { "jle", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e ZF=1 || SF!=OF
798 { "jng", OP_JLE, 1, 1, OPF_JMP|OPF_CC }, // 7e
799 { "jg", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f ZF=0 && SF=OF
800 { "jnle", OP_JG, 1, 1, OPF_JMP|OPF_CC }, // 7f
801 { "seto", OP_JO, 1, 1, OPF_DATA|OPF_CC },
802 { "setno", OP_JNO, 1, 1, OPF_DATA|OPF_CC },
803 { "setc", OP_JC, 1, 1, OPF_DATA|OPF_CC },
804 { "setb", OP_JC, 1, 1, OPF_DATA|OPF_CC },
805 { "setnc", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
806 { "setae", OP_JNC, 1, 1, OPF_DATA|OPF_CC },
807 { "setz", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
808 { "sete", OP_JZ, 1, 1, OPF_DATA|OPF_CC },
809 { "setnz", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
810 { "setne", OP_JNZ, 1, 1, OPF_DATA|OPF_CC },
811 { "setbe", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
812 { "setna", OP_JBE, 1, 1, OPF_DATA|OPF_CC },
813 { "seta", OP_JA, 1, 1, OPF_DATA|OPF_CC },
814 { "setnbe", OP_JA, 1, 1, OPF_DATA|OPF_CC },
815 { "sets", OP_JS, 1, 1, OPF_DATA|OPF_CC },
816 { "setns", OP_JNS, 1, 1, OPF_DATA|OPF_CC },
817 { "setp", OP_JP, 1, 1, OPF_DATA|OPF_CC },
818 { "setpe", OP_JP, 1, 1, OPF_DATA|OPF_CC },
819 { "setnp", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
820 { "setpo", OP_JNP, 1, 1, OPF_DATA|OPF_CC },
821 { "setl", OP_JL, 1, 1, OPF_DATA|OPF_CC },
822 { "setnge", OP_JL, 1, 1, OPF_DATA|OPF_CC },
823 { "setge", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
824 { "setnl", OP_JGE, 1, 1, OPF_DATA|OPF_CC },
825 { "setle", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
826 { "setng", OP_JLE, 1, 1, OPF_DATA|OPF_CC },
827 { "setg", OP_JG, 1, 1, OPF_DATA|OPF_CC },
828 { "setnle", OP_JG, 1, 1, OPF_DATA|OPF_CC },
829};
830
831static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
832{
833 enum opr_lenmod lmod = OPLM_UNSPEC;
834 int prefix_flags = 0;
835 int regmask_ind;
836 int regmask;
837 int op_w = 0;
838 int opr = 0;
839 int w = 0;
840 int i;
841
842 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
843 if (IS(words[w], pref_table[i].name)) {
844 prefix_flags = pref_table[i].flags;
845 break;
846 }
847 }
848
849 if (prefix_flags) {
850 if (wordc <= 1)
851 aerr("lone prefix: '%s'\n", words[0]);
852 w++;
853 }
854
855 op_w = w;
856 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
857 if (IS(words[w], op_table[i].name))
858 break;
859 }
860
861 if (i == ARRAY_SIZE(op_table))
862 aerr("unhandled op: '%s'\n", words[0]);
863 w++;
864
865 op->op = op_table[i].op;
866 op->flags = op_table[i].flags | prefix_flags;
867 op->regmask_src = op->regmask_dst = 0;
868
869 for (opr = 0; opr < op_table[i].minopr; opr++) {
870 regmask = regmask_ind = 0;
871 w = parse_operand(&op->operand[opr], &regmask, &regmask_ind,
872 words, wordc, w, op->flags);
873
874 if (opr == 0 && (op->flags & OPF_DATA))
875 op->regmask_dst = regmask;
876 // for now, mark dst as src too
877 op->regmask_src |= regmask | regmask_ind;
878 }
879
880 for (; w < wordc && opr < op_table[i].maxopr; opr++) {
881 w = parse_operand(&op->operand[opr],
882 &op->regmask_src, &op->regmask_src,
883 words, wordc, w, op->flags);
884 }
885
886 if (w < wordc)
887 aerr("parse_op %s incomplete: %d/%d\n",
888 words[0], w, wordc);
889
890 // special cases
891 op->operand_cnt = opr;
892 if (!strncmp(op_table[i].name, "set", 3))
893 op->operand[0].lmod = OPLM_BYTE;
894
895 // ops with implicit argumets
896 switch (op->op) {
897 case OP_CDQ:
898 op->operand_cnt = 2;
899 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
900 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
901 break;
902
903 case OP_STOS:
904 if (op->operand_cnt != 0)
905 break;
906 if (IS(words[op_w], "stosb"))
907 lmod = OPLM_BYTE;
908 else if (IS(words[op_w], "stosw"))
909 lmod = OPLM_WORD;
910 else if (IS(words[op_w], "stosd"))
911 lmod = OPLM_DWORD;
912 op->operand_cnt = 3;
913 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
914 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
915 op->regmask_dst = op->regmask_src;
916 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD, &op->regmask_src);
917 break;
918
919 case OP_MOVS:
920 case OP_CMPS:
921 if (op->operand_cnt != 0)
922 break;
923 if (words[op_w][4] == 'b')
924 lmod = OPLM_BYTE;
925 else if (words[op_w][4] == 'w')
926 lmod = OPLM_WORD;
927 else if (words[op_w][4] == 'd')
928 lmod = OPLM_DWORD;
929 op->operand_cnt = 3;
930 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
931 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
932 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
933 op->regmask_dst = op->regmask_src;
934 break;
935
936 case OP_IMUL:
937 if (op->operand_cnt != 1)
938 break;
939 // fallthrough
940 case OP_MUL:
941 // singleop mul
942 op->regmask_dst = (1 << xDX) | (1 << xAX);
943 op->regmask_src |= (1 << xAX);
944 if (op->operand[0].lmod == OPLM_UNSPEC)
945 op->operand[0].lmod = OPLM_DWORD;
946 break;
947
948 case OP_DIV:
949 case OP_IDIV:
950 // we could set up operands for edx:eax, but there is no real need to
951 // (see is_opr_modified())
952 regmask = (1 << xDX) | (1 << xAX);
953 op->regmask_dst = regmask;
954 op->regmask_src |= regmask;
955 if (op->operand[0].lmod == OPLM_UNSPEC)
956 op->operand[0].lmod = OPLM_DWORD;
957 break;
958
959 case OP_SHL:
960 case OP_SHR:
961 case OP_SAR:
962 case OP_ROL:
963 case OP_ROR:
964 if (op->operand[1].lmod == OPLM_UNSPEC)
965 op->operand[1].lmod = OPLM_BYTE;
966 break;
967
968 case OP_PUSH:
969 if (op->operand[0].lmod == OPLM_UNSPEC
970 && (op->operand[0].type == OPT_CONST
971 || op->operand[0].type == OPT_OFFSET
972 || op->operand[0].type == OPT_LABEL))
973 op->operand[0].lmod = OPLM_DWORD;
974 break;
975
976 // alignment
977 case OP_MOV:
978 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
979 && op->operand[0].reg == xDI && op->operand[1].reg == xDI)
980 {
981 op->flags |= OPF_RMD;
982 }
983 break;
984
985 case OP_LEA:
986 if (op->operand[0].type == OPT_REG
987 && op->operand[1].type == OPT_REGMEM)
988 {
989 char buf[16];
990 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
991 if (IS(buf, op->operand[1].name))
992 op->flags |= OPF_RMD;
993 }
994 break;
995
996 default:
997 break;
998 }
999}
1000
1001static const char *op_name(enum op_op op)
1002{
1003 int i;
1004
1005 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1006 if (op_table[i].op == op)
1007 return op_table[i].name;
1008
1009 return "???";
1010}
1011
1012// debug
1013static const char *dump_op(struct parsed_op *po)
1014{
1015 static char out[128];
1016 char *p = out;
1017 int i;
1018
1019 if (po == NULL)
1020 return "???";
1021
1022 snprintf(out, sizeof(out), "%s", op_name(po->op));
1023 for (i = 0; i < po->operand_cnt; i++) {
1024 p += strlen(p);
1025 if (i > 0)
1026 *p++ = ',';
1027 snprintf(p, sizeof(out) - (p - out),
1028 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1029 po->operand[i].name);
1030 }
1031
1032 return out;
1033}
1034
1035static const char *lmod_type_u(struct parsed_op *po,
1036 enum opr_lenmod lmod)
1037{
1038 switch (lmod) {
1039 case OPLM_DWORD:
1040 return "u32";
1041 case OPLM_WORD:
1042 return "u16";
1043 case OPLM_BYTE:
1044 return "u8";
1045 default:
1046 ferr(po, "invalid lmod: %d\n", lmod);
1047 return "(_invalid_)";
1048 }
1049}
1050
1051static const char *lmod_cast_u(struct parsed_op *po,
1052 enum opr_lenmod lmod)
1053{
1054 switch (lmod) {
1055 case OPLM_DWORD:
1056 return "";
1057 case OPLM_WORD:
1058 return "(u16)";
1059 case OPLM_BYTE:
1060 return "(u8)";
1061 default:
1062 ferr(po, "invalid lmod: %d\n", lmod);
1063 return "(_invalid_)";
1064 }
1065}
1066
1067static const char *lmod_cast_u_ptr(struct parsed_op *po,
1068 enum opr_lenmod lmod)
1069{
1070 switch (lmod) {
1071 case OPLM_DWORD:
1072 return "*(u32 *)";
1073 case OPLM_WORD:
1074 return "*(u16 *)";
1075 case OPLM_BYTE:
1076 return "*(u8 *)";
1077 default:
1078 ferr(po, "invalid lmod: %d\n", lmod);
1079 return "(_invalid_)";
1080 }
1081}
1082
1083static const char *lmod_cast_s(struct parsed_op *po,
1084 enum opr_lenmod lmod)
1085{
1086 switch (lmod) {
1087 case OPLM_DWORD:
1088 return "(s32)";
1089 case OPLM_WORD:
1090 return "(s16)";
1091 case OPLM_BYTE:
1092 return "(s8)";
1093 default:
1094 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1095 return "(_invalid_)";
1096 }
1097}
1098
1099static const char *lmod_cast(struct parsed_op *po,
1100 enum opr_lenmod lmod, int is_signed)
1101{
1102 return is_signed ?
1103 lmod_cast_s(po, lmod) :
1104 lmod_cast_u(po, lmod);
1105}
1106
1107static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1108{
1109 switch (lmod) {
1110 case OPLM_DWORD:
1111 return 4;
1112 case OPLM_WORD:
1113 return 2;
1114 case OPLM_BYTE:
1115 return 1;
1116 default:
1117 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1118 return 0;
1119 }
1120}
1121
1122static const char *opr_name(struct parsed_op *po, int opr_num)
1123{
1124 if (opr_num >= po->operand_cnt)
1125 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1126 return po->operand[opr_num].name;
1127}
1128
1129static unsigned int opr_const(struct parsed_op *po, int opr_num)
1130{
1131 if (opr_num >= po->operand_cnt)
1132 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1133 if (po->operand[opr_num].type != OPT_CONST)
1134 ferr(po, "opr %d: const expected\n", opr_num);
1135 return po->operand[opr_num].val;
1136}
1137
1138static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1139{
1140 if ((unsigned int)popr->reg >= MAX_REGS)
1141 ferr(po, "invalid reg: %d\n", popr->reg);
1142 return regs_r32[popr->reg];
1143}
1144
1145static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1146 int *extra_offs)
1147{
1148 const char *p;
1149 char *endp;
1150 int namelen;
1151 int i;
1152
1153 *extra_offs = 0;
1154 namelen = strlen(name);
1155
1156 p = strchr(name, '+');
1157 if (p != NULL) {
1158 namelen = p - name;
1159 if (namelen <= 0)
1160 ferr(po, "equ parse failed for '%s'\n", name);
1161
1162 if (IS_START(p, "0x"))
1163 p += 2;
1164 *extra_offs = strtol(p, &endp, 16);
1165 if (*endp != 0)
1166 ferr(po, "equ parse failed for '%s'\n", name);
1167 }
1168
1169 for (i = 0; i < g_eqcnt; i++)
1170 if (strncmp(g_eqs[i].name, name, namelen) == 0
1171 && g_eqs[i].name[namelen] == 0)
1172 break;
1173 if (i >= g_eqcnt) {
1174 if (po != NULL)
1175 ferr(po, "unresolved equ name: '%s'\n", name);
1176 return NULL;
1177 }
1178
1179 return &g_eqs[i];
1180}
1181
1182static void stack_frame_access(struct parsed_op *po,
1183 struct parsed_opr *popr, char *buf, size_t buf_size,
1184 const char *name, const char *cast, int is_src, int is_lea)
1185{
1186 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1187 const char *prefix = "";
1188 const char *bp_arg = NULL;
1189 char ofs_reg[16] = { 0, };
1190 struct parsed_equ *eq;
1191 const char *p;
1192 char *endp = NULL;
1193 int i, arg_i, arg_s;
1194 int unaligned = 0;
1195 int stack_ra = 0;
1196 int offset = 0;
1197 int sf_ofs;
1198 int lim;
1199
1200 if (po->flags & OPF_EBP_S)
1201 ferr(po, "stack_frame_access while ebp is scratch\n");
1202
1203 if (IS_START(name, "ebp-")
1204 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1205 {
1206 p = name + 4;
1207 if (IS_START(p, "0x"))
1208 p += 2;
1209 offset = strtoul(p, &endp, 16);
1210 if (name[3] == '-')
1211 offset = -offset;
1212 if (*endp != 0)
1213 ferr(po, "ebp- parse of '%s' failed\n", name);
1214 }
1215 else {
1216 bp_arg = parse_stack_el(name, ofs_reg);
1217 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1218 eq = equ_find(po, bp_arg, &offset);
1219 if (eq == NULL)
1220 ferr(po, "detected but missing eq\n");
1221 offset += eq->offset;
1222 }
1223
1224 if (!strncmp(name, "ebp", 3))
1225 stack_ra = 4;
1226
1227 if (ofs_reg[0] == 0 && stack_ra <= offset && offset < stack_ra + 4)
1228 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1229
1230 if (offset > stack_ra)
1231 {
1232 arg_i = (offset - stack_ra - 4) / 4;
1233 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1234 {
1235 if (g_func_pp->is_vararg
1236 && arg_i == g_func_pp->argc_stack && is_lea)
1237 {
1238 // should be va_list
1239 if (cast[0] == 0)
1240 cast = "(u32)";
1241 snprintf(buf, buf_size, "%sap", cast);
1242 return;
1243 }
1244 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1245 offset, bp_arg, arg_i);
1246 }
1247 if (ofs_reg[0] != 0)
1248 ferr(po, "offset reg on arg access?\n");
1249
1250 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1251 if (g_func_pp->arg[i].reg != NULL)
1252 continue;
1253 if (arg_s == arg_i)
1254 break;
1255 arg_s++;
1256 }
1257 if (i == g_func_pp->argc)
1258 ferr(po, "arg %d not in prototype?\n", arg_i);
1259
1260 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1261
1262 switch (popr->lmod)
1263 {
1264 case OPLM_BYTE:
1265 if (is_lea)
1266 ferr(po, "lea/byte to arg?\n");
1267 if (is_src && (offset & 3) == 0)
1268 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1269 else
1270 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1271 break;
1272
1273 case OPLM_WORD:
1274 if (is_lea)
1275 ferr(po, "lea/word to arg?\n");
1276 if (offset & 1) {
1277 unaligned = 1;
1278 if (!is_src) {
1279 if (offset & 2)
1280 ferr(po, "problematic arg store\n");
1281 snprintf(buf, buf_size, "*(u16 *)((char *)&a%d + 1)", i + 1);
1282 }
1283 else
1284 ferr(po, "unaligned arg word load\n");
1285 }
1286 else if (is_src && (offset & 2) == 0)
1287 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1288 else
1289 snprintf(buf, buf_size, "%sWORD(a%d)",
1290 (offset & 2) ? "HI" : "LO", i + 1);
1291 break;
1292
1293 case OPLM_DWORD:
1294 if (cast[0])
1295 prefix = cast;
1296 else if (is_src)
1297 prefix = "(u32)";
1298
1299 if (offset & 3) {
1300 unaligned = 1;
1301 if (is_lea)
1302 snprintf(buf, buf_size, "(u32)&a%d + %d",
1303 i + 1, offset & 3);
1304 else if (!is_src)
1305 ferr(po, "unaligned arg store\n");
1306 else {
1307 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1308 snprintf(buf, buf_size, "%s(a%d >> %d)",
1309 prefix, i + 1, (offset & 3) * 8);
1310 }
1311 }
1312 else {
1313 snprintf(buf, buf_size, "%s%sa%d",
1314 prefix, is_lea ? "&" : "", i + 1);
1315 }
1316 break;
1317
1318 default:
1319 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1320 }
1321
1322 if (unaligned)
1323 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1324
1325 // common problem
1326 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1327 if (unaligned && tmp_lmod != OPLM_DWORD)
1328 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
1329 offset, g_func_pp->arg[i].type.name);
1330 }
1331 else
1332 {
1333 if (g_stack_fsz == 0)
1334 ferr(po, "stack var access without stackframe\n");
1335
1336 sf_ofs = g_stack_fsz + offset;
1337 lim = (ofs_reg[0] != 0) ? -4 : 0;
1338 if (offset > 0 || sf_ofs < lim)
1339 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1340
1341 if (is_lea)
1342 prefix = "(u32)&";
1343 else
1344 prefix = cast;
1345
1346 switch (popr->lmod)
1347 {
1348 case OPLM_BYTE:
1349 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1350 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1351 break;
1352
1353 case OPLM_WORD:
1354 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1355 // known unaligned or possibly unaligned
1356 strcat(g_comment, " unaligned");
1357 if (prefix[0] == 0)
1358 prefix = "*(u16 *)&";
1359 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1360 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1361 break;
1362 }
1363 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1364 break;
1365
1366 case OPLM_DWORD:
1367 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1368 // known unaligned or possibly unaligned
1369 strcat(g_comment, " unaligned");
1370 if (prefix[0] == 0)
1371 prefix = "*(u32 *)&";
1372 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1373 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1374 break;
1375 }
1376 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1377 break;
1378
1379 default:
1380 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1381 }
1382 }
1383}
1384
1385static void check_label_read_ref(struct parsed_op *po, const char *name)
1386{
1387 const struct parsed_proto *pp;
1388
1389 pp = proto_parse(g_fhdr, name);
1390 if (pp == NULL)
1391 ferr(po, "proto_parse failed for ref '%s'\n", name);
1392
1393 // currently we can take __cdecl and __stdcall
1394 if (pp->is_func && pp->argc_reg != 0)
1395 ferr(po, "reg-arg func reference?\n");
1396}
1397
1398static char *out_src_opr(char *buf, size_t buf_size,
1399 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1400 int is_lea)
1401{
1402 char tmp1[256], tmp2[256];
1403 char expr[256];
1404 int ret;
1405
1406 if (cast == NULL)
1407 cast = "";
1408
1409 switch (popr->type) {
1410 case OPT_REG:
1411 if (is_lea)
1412 ferr(po, "lea from reg?\n");
1413
1414 switch (popr->lmod) {
1415 case OPLM_DWORD:
1416 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1417 break;
1418 case OPLM_WORD:
1419 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1420 break;
1421 case OPLM_BYTE:
1422 if (popr->name[1] == 'h') // XXX..
1423 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1424 else
1425 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
1426 break;
1427 default:
1428 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1429 }
1430 break;
1431
1432 case OPT_REGMEM:
1433 if (parse_stack_el(popr->name, NULL)
1434 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1435 && IS_START(popr->name, "ebp")))
1436 {
1437 stack_frame_access(po, popr, buf, buf_size,
1438 popr->name, cast, 1, is_lea);
1439 break;
1440 }
1441
1442 strcpy(expr, popr->name);
1443 if (strchr(expr, '[')) {
1444 // special case: '[' can only be left for label[reg] form
1445 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1446 if (ret != 2)
1447 ferr(po, "parse failure for '%s'\n", expr);
1448 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1449 }
1450
1451 // XXX: do we need more parsing?
1452 if (is_lea) {
1453 snprintf(buf, buf_size, "%s", expr);
1454 break;
1455 }
1456
1457 if (cast[0] == 0)
1458 cast = lmod_cast_u_ptr(po, popr->lmod);
1459 snprintf(buf, buf_size, "%s(%s)", cast, expr);
1460 break;
1461
1462 case OPT_LABEL:
1463 check_label_read_ref(po, popr->name);
1464 if (cast[0] == 0 && popr->is_ptr)
1465 cast = "(u32)";
1466
1467 if (is_lea)
1468 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1469 else if (popr->size_lt)
1470 snprintf(buf, buf_size, "%s%s%s%s", cast,
1471 lmod_cast_u_ptr(po, popr->lmod),
1472 popr->is_array ? "" : "&",
1473 popr->name);
1474 else
1475 snprintf(buf, buf_size, "%s%s%s", cast, popr->name,
1476 popr->is_array ? "[0]" : "");
1477 break;
1478
1479 case OPT_OFFSET:
1480 check_label_read_ref(po, popr->name);
1481 if (cast[0] == 0)
1482 cast = "(u32)";
1483 if (is_lea)
1484 ferr(po, "lea an offset?\n");
1485 snprintf(buf, buf_size, "%s&%s", cast, popr->name);
1486 break;
1487
1488 case OPT_CONST:
1489 if (is_lea)
1490 ferr(po, "lea from const?\n");
1491
1492 snprintf(buf, buf_size, "%s", cast);
1493 ret = strlen(buf);
1494 printf_number(buf + ret, buf_size - ret, popr->val);
1495 break;
1496
1497 default:
1498 ferr(po, "invalid src type: %d\n", popr->type);
1499 }
1500
1501 return buf;
1502}
1503
1504// note: may set is_ptr (we find that out late for ebp frame..)
1505static char *out_dst_opr(char *buf, size_t buf_size,
1506 struct parsed_op *po, struct parsed_opr *popr)
1507{
1508 switch (popr->type) {
1509 case OPT_REG:
1510 switch (popr->lmod) {
1511 case OPLM_DWORD:
1512 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1513 break;
1514 case OPLM_WORD:
1515 // ugh..
1516 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1517 break;
1518 case OPLM_BYTE:
1519 // ugh..
1520 if (popr->name[1] == 'h') // XXX..
1521 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1522 else
1523 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1524 break;
1525 default:
1526 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1527 }
1528 break;
1529
1530 case OPT_REGMEM:
1531 if (parse_stack_el(popr->name, NULL)
1532 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1533 && IS_START(popr->name, "ebp")))
1534 {
1535 stack_frame_access(po, popr, buf, buf_size,
1536 popr->name, "", 0, 0);
1537 break;
1538 }
1539
1540 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1541
1542 case OPT_LABEL:
1543 if (popr->size_mismatch)
1544 snprintf(buf, buf_size, "%s%s%s",
1545 lmod_cast_u_ptr(po, popr->lmod),
1546 popr->is_array ? "" : "&", popr->name);
1547 else
1548 snprintf(buf, buf_size, "%s%s", popr->name,
1549 popr->is_array ? "[0]" : "");
1550 break;
1551
1552 default:
1553 ferr(po, "invalid dst type: %d\n", popr->type);
1554 }
1555
1556 return buf;
1557}
1558
1559static char *out_src_opr_u32(char *buf, size_t buf_size,
1560 struct parsed_op *po, struct parsed_opr *popr)
1561{
1562 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1563}
1564
1565static enum parsed_flag_op split_cond(struct parsed_op *po,
1566 enum op_op op, int *is_inv)
1567{
1568 *is_inv = 0;
1569
1570 switch (op) {
1571 case OP_JO:
1572 return PFO_O;
1573 case OP_JC:
1574 return PFO_C;
1575 case OP_JZ:
1576 return PFO_Z;
1577 case OP_JBE:
1578 return PFO_BE;
1579 case OP_JS:
1580 return PFO_S;
1581 case OP_JP:
1582 return PFO_P;
1583 case OP_JL:
1584 return PFO_L;
1585 case OP_JLE:
1586 return PFO_LE;
1587
1588 case OP_JNO:
1589 *is_inv = 1;
1590 return PFO_O;
1591 case OP_JNC:
1592 *is_inv = 1;
1593 return PFO_C;
1594 case OP_JNZ:
1595 *is_inv = 1;
1596 return PFO_Z;
1597 case OP_JA:
1598 *is_inv = 1;
1599 return PFO_BE;
1600 case OP_JNS:
1601 *is_inv = 1;
1602 return PFO_S;
1603 case OP_JNP:
1604 *is_inv = 1;
1605 return PFO_P;
1606 case OP_JGE:
1607 *is_inv = 1;
1608 return PFO_L;
1609 case OP_JG:
1610 *is_inv = 1;
1611 return PFO_LE;
1612
1613 case OP_ADC:
1614 case OP_SBB:
1615 return PFO_C;
1616
1617 default:
1618 ferr(po, "split_cond: bad op %d\n", op);
1619 return -1;
1620 }
1621}
1622
1623static void out_test_for_cc(char *buf, size_t buf_size,
1624 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1625 enum opr_lenmod lmod, const char *expr)
1626{
1627 const char *cast, *scast;
1628
1629 cast = lmod_cast_u(po, lmod);
1630 scast = lmod_cast_s(po, lmod);
1631
1632 switch (pfo) {
1633 case PFO_Z:
1634 case PFO_BE: // CF=1||ZF=1; CF=0
1635 snprintf(buf, buf_size, "(%s%s %s 0)",
1636 cast, expr, is_inv ? "!=" : "==");
1637 break;
1638
1639 case PFO_S:
1640 case PFO_L: // SF!=OF; OF=0
1641 snprintf(buf, buf_size, "(%s%s %s 0)",
1642 scast, expr, is_inv ? ">=" : "<");
1643 break;
1644
1645 case PFO_LE: // ZF=1||SF!=OF; OF=0
1646 snprintf(buf, buf_size, "(%s%s %s 0)",
1647 scast, expr, is_inv ? ">" : "<=");
1648 break;
1649
1650 default:
1651 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1652 }
1653}
1654
1655static void out_cmp_for_cc(char *buf, size_t buf_size,
1656 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1657 enum opr_lenmod lmod, const char *expr1, const char *expr2)
1658{
1659 const char *cast, *scast;
1660
1661 cast = lmod_cast_u(po, lmod);
1662 scast = lmod_cast_s(po, lmod);
1663
1664 switch (pfo) {
1665 case PFO_C:
1666 // note: must be unsigned compare
1667 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1668 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
1669 break;
1670
1671 case PFO_Z:
1672 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1673 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
1674 break;
1675
1676 case PFO_BE: // !a
1677 // note: must be unsigned compare
1678 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1679 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
1680 break;
1681
1682 // note: must be signed compare
1683 case PFO_S:
1684 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
1685 scast, expr1, expr2, is_inv ? ">=" : "<");
1686 break;
1687
1688 case PFO_L: // !ge
1689 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1690 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
1691 break;
1692
1693 case PFO_LE:
1694 snprintf(buf, buf_size, "(%s%s %s %s%s)",
1695 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
1696 break;
1697
1698 default:
1699 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1700 }
1701}
1702
1703static void out_cmp_test(char *buf, size_t buf_size,
1704 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1705{
1706 char buf1[256], buf2[256], buf3[256];
1707
1708 if (po->op == OP_TEST) {
1709 if (IS(opr_name(po, 0), opr_name(po, 1))) {
1710 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
1711 }
1712 else {
1713 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1714 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
1715 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1716 }
1717 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
1718 po->operand[0].lmod, buf3);
1719 }
1720 else if (po->op == OP_CMP) {
1721 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
1722 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[1]);
1723 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
1724 po->operand[0].lmod, buf2, buf3);
1725 }
1726 else
1727 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1728}
1729
1730static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
1731 struct parsed_opr *popr2)
1732{
1733 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1734 ferr(po, "missing lmod for both operands\n");
1735
1736 if (popr1->lmod == OPLM_UNSPEC)
1737 popr1->lmod = popr2->lmod;
1738 else if (popr2->lmod == OPLM_UNSPEC)
1739 popr2->lmod = popr1->lmod;
1740 else if (popr1->lmod != popr2->lmod) {
1741 if (popr1->type_from_var) {
1742 popr1->size_mismatch = 1;
1743 if (popr1->lmod < popr2->lmod)
1744 popr1->size_lt = 1;
1745 popr1->lmod = popr2->lmod;
1746 }
1747 else if (popr2->type_from_var) {
1748 popr2->size_mismatch = 1;
1749 if (popr2->lmod < popr1->lmod)
1750 popr2->size_lt = 1;
1751 popr2->lmod = popr1->lmod;
1752 }
1753 else
1754 ferr(po, "conflicting lmods: %d vs %d\n",
1755 popr1->lmod, popr2->lmod);
1756 }
1757}
1758
1759static const char *op_to_c(struct parsed_op *po)
1760{
1761 switch (po->op)
1762 {
1763 case OP_ADD:
1764 case OP_ADC:
1765 return "+";
1766 case OP_SUB:
1767 case OP_SBB:
1768 return "-";
1769 case OP_AND:
1770 return "&";
1771 case OP_OR:
1772 return "|";
1773 case OP_XOR:
1774 return "^";
1775 case OP_SHL:
1776 return "<<";
1777 case OP_SHR:
1778 return ">>";
1779 case OP_MUL:
1780 case OP_IMUL:
1781 return "*";
1782 default:
1783 ferr(po, "op_to_c was supplied with %d\n", po->op);
1784 }
1785}
1786
1787static void op_set_clear_flag(struct parsed_op *po,
1788 enum op_flags flag_set, enum op_flags flag_clear)
1789{
1790 po->flags |= flag_set;
1791 po->flags &= ~flag_clear;
1792}
1793
1794// last op in stream - unconditional branch or ret
1795#define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
1796 || (ops[_i].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
1797
1798static int scan_for_pop(int i, int opcnt, const char *reg,
1799 int magic, int depth, int *maxdepth, int do_flags)
1800{
1801 struct parsed_op *po;
1802 int ret = 0;
1803 int j;
1804
1805 for (; i < opcnt; i++) {
1806 po = &ops[i];
1807 if (po->cc_scratch == magic)
1808 break; // already checked
1809 po->cc_scratch = magic;
1810
1811 if (po->flags & OPF_TAIL)
1812 return -1; // deadend
1813
1814 if ((po->flags & OPF_RMD)
1815 || (po->op == OP_PUSH && po->argnum != 0)) // arg push
1816 continue;
1817
1818 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
1819 if (po->btj != NULL) {
1820 // jumptable
1821 for (j = 0; j < po->btj->count - 1; j++) {
1822 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1823 depth, maxdepth, do_flags);
1824 if (ret < 0)
1825 return ret; // dead end
1826 }
1827 // follow last jumptable entry
1828 i = po->btj->d[j].bt_i - 1;
1829 continue;
1830 }
1831
1832 if (po->bt_i < 0) {
1833 ferr(po, "dead branch\n");
1834 return -1;
1835 }
1836
1837 if (po->flags & OPF_CC) {
1838 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1839 depth, maxdepth, do_flags);
1840 if (ret < 0)
1841 return ret; // dead end
1842 }
1843 else {
1844 i = po->bt_i - 1;
1845 }
1846 continue;
1847 }
1848
1849 if ((po->op == OP_POP || po->op == OP_PUSH)
1850 && po->operand[0].type == OPT_REG
1851 && IS(po->operand[0].name, reg))
1852 {
1853 if (po->op == OP_PUSH) {
1854 depth++;
1855 if (depth > *maxdepth)
1856 *maxdepth = depth;
1857 if (do_flags)
1858 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
1859 }
1860 else if (depth == 0) {
1861 if (do_flags)
1862 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
1863 return 1;
1864 }
1865 else {
1866 depth--;
1867 if (depth < 0) // should not happen
1868 ferr(po, "fail with depth\n");
1869 if (do_flags)
1870 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
1871 }
1872 }
1873 }
1874
1875 return ret;
1876}
1877
1878// scan for pop starting from 'ret' op (all paths)
1879static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1880 int flag_set)
1881{
1882 int found = 0;
1883 int j;
1884
1885 for (; i < opcnt; i++) {
1886 if (!(ops[i].flags & OPF_TAIL))
1887 continue;
1888
1889 for (j = i - 1; j >= 0; j--) {
1890 if (ops[j].flags & OPF_RMD)
1891 continue;
1892 if (ops[j].flags & OPF_JMP)
1893 return -1;
1894
1895 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1896 && IS(ops[j].operand[0].name, reg))
1897 {
1898 found = 1;
1899 ops[j].flags |= flag_set;
1900 break;
1901 }
1902
1903 if (g_labels[j][0] != 0)
1904 return -1;
1905 }
1906 }
1907
1908 return found ? 0 : -1;
1909}
1910
1911// is operand 'opr modified' by parsed_op 'po'?
1912static int is_opr_modified(const struct parsed_opr *opr,
1913 const struct parsed_op *po)
1914{
1915 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1916 return 0;
1917
1918 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1919 if (po->regmask_dst & (1 << opr->reg))
1920 return 1;
1921 else
1922 return 0;
1923 }
1924
1925 return IS(po->operand[0].name, opr->name);
1926}
1927
1928// is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1929static int is_any_opr_modified(const struct parsed_op *po_test,
1930 const struct parsed_op *po)
1931{
1932 int i;
1933
1934 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1935 return 0;
1936
1937 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
1938 return 0;
1939
1940 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
1941 return 1;
1942
1943 // in reality, it can wreck any register, but in decompiled C
1944 // version it can only overwrite eax or edx:eax
1945 if (po->op == OP_CALL
1946 && ((po_test->regmask_src | po_test->regmask_dst)
1947 & ((1 << xAX)|(1 << xDX))))
1948 return 1;
1949
1950 for (i = 0; i < po_test->operand_cnt; i++)
1951 if (IS(po_test->operand[i].name, po->operand[0].name))
1952 return 1;
1953
1954 return 0;
1955}
1956
1957// scan for any po_test operand modification in range given
1958static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
1959{
1960 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
1961 return -1;
1962
1963 for (; i < opcnt; i++) {
1964 if (is_any_opr_modified(po_test, &ops[i]))
1965 return i;
1966 }
1967
1968 return -1;
1969}
1970
1971// scan for po_test operand[0] modification in range given
1972static int scan_for_mod_opr0(struct parsed_op *po_test,
1973 int i, int opcnt)
1974{
1975 for (; i < opcnt; i++) {
1976 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1977 return i;
1978 }
1979
1980 return -1;
1981}
1982
1983static int scan_for_flag_set(int i, int magic, int *branched,
1984 int *setters, int *setter_cnt)
1985{
1986 struct label_ref *lr;
1987 int ret;
1988
1989 while (i >= 0) {
1990 if (ops[i].cc_scratch == magic) {
1991 ferr(&ops[i], "%s looped\n", __func__);
1992 return -1;
1993 }
1994 ops[i].cc_scratch = magic;
1995
1996 if (g_labels[i][0] != 0) {
1997 *branched = 1;
1998
1999 lr = &g_label_refs[i];
2000 for (; lr->next; lr = lr->next) {
2001 ret = scan_for_flag_set(lr->i, magic,
2002 branched, setters, setter_cnt);
2003 if (ret < 0)
2004 return ret;
2005 }
2006
2007 if (i > 0 && LAST_OP(i - 1)) {
2008 i = lr->i;
2009 continue;
2010 }
2011 ret = scan_for_flag_set(lr->i, magic,
2012 branched, setters, setter_cnt);
2013 if (ret < 0)
2014 return ret;
2015 }
2016 i--;
2017
2018 if (ops[i].flags & OPF_FLAGS) {
2019 setters[*setter_cnt] = i;
2020 (*setter_cnt)++;
2021 return 0;
2022 }
2023
2024 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
2025 return -1;
2026 }
2027
2028 return -1;
2029}
2030
2031// scan back for cdq, if anything modifies edx, fail
2032static int scan_for_cdq_edx(int i)
2033{
2034 while (i >= 0) {
2035 if (g_labels[i][0] != 0) {
2036 if (g_label_refs[i].next != NULL)
2037 return -1;
2038 if (i > 0 && LAST_OP(i - 1)) {
2039 i = g_label_refs[i].i;
2040 continue;
2041 }
2042 return -1;
2043 }
2044 i--;
2045
2046 if (ops[i].op == OP_CDQ)
2047 return i;
2048
2049 if (ops[i].regmask_dst & (1 << xDX))
2050 return -1;
2051 if (g_labels[i][0] != 0)
2052 return -1;
2053 }
2054
2055 return -1;
2056}
2057
2058static int scan_for_reg_clear(int i, int reg)
2059{
2060 while (i >= 0) {
2061 if (g_labels[i][0] != 0) {
2062 if (g_label_refs[i].next != NULL)
2063 return -1;
2064 if (i > 0 && LAST_OP(i - 1)) {
2065 i = g_label_refs[i].i;
2066 continue;
2067 }
2068 return -1;
2069 }
2070 i--;
2071
2072 if (ops[i].op == OP_XOR
2073 && ops[i].operand[0].lmod == OPLM_DWORD
2074 && ops[i].operand[0].reg == ops[i].operand[1].reg
2075 && ops[i].operand[0].reg == reg)
2076 return i;
2077
2078 if (ops[i].regmask_dst & (1 << reg))
2079 return -1;
2080 if (g_labels[i][0] != 0)
2081 return -1;
2082 }
2083
2084 return -1;
2085}
2086
2087// scan for positive, constant esp adjust
2088static int scan_for_esp_adjust(int i, int opcnt, int *adj)
2089{
2090 struct parsed_op *po;
2091 *adj = 0;
2092
2093 for (; i < opcnt; i++) {
2094 po = &ops[i];
2095
2096 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2097 if (po->operand[1].type != OPT_CONST)
2098 ferr(&ops[i], "non-const esp adjust?\n");
2099 *adj += po->operand[1].val;
2100 if (*adj & 3)
2101 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2102 return i;
2103 }
2104 else if (po->op == OP_PUSH)
2105 *adj -= lmod_bytes(po, po->operand[0].lmod);
2106 else if (po->op == OP_POP)
2107 *adj += lmod_bytes(po, po->operand[0].lmod);
2108 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2109 if (po->op != OP_CALL)
2110 return -1;
2111 if (po->operand[0].type != OPT_LABEL)
2112 return -1;
2113 // TODO: should only allow combining __cdecl calls..
2114 }
2115
2116 if (g_labels[i][0] != 0)
2117 return -1;
2118 }
2119
2120 return -1;
2121}
2122
2123static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2124{
2125 struct parsed_op *po;
2126 int j;
2127
2128 if (i < 0)
2129 ferr(ops, "%s: followed bad branch?\n", __func__);
2130
2131 for (; i < opcnt; i++) {
2132 po = &ops[i];
2133 if (po->cc_scratch == magic)
2134 return;
2135 po->cc_scratch = magic;
2136 po->flags |= flags;
2137
2138 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2139 if (po->btj != NULL) {
2140 // jumptable
2141 for (j = 0; j < po->btj->count; j++)
2142 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2143 return;
2144 }
2145
2146 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2147 if (!(po->flags & OPF_CC))
2148 return;
2149 }
2150 if (po->flags & OPF_TAIL)
2151 return;
2152 }
2153}
2154
2155static int collect_call_args(struct parsed_op *po, int i,
2156 struct parsed_proto *pp, int *save_arg_vars, int arg,
2157 int magic, int need_op_saving, int may_reuse)
2158{
2159 struct parsed_proto *pp_tmp;
2160 struct label_ref *lr;
2161 int need_to_save_current;
2162 int ret = 0;
2163 int j;
2164
2165 if (i < 0) {
2166 ferr(po, "no refs for '%s'?\n", g_labels[i]);
2167 return -1;
2168 }
2169
2170 for (; arg < pp->argc; arg++)
2171 if (pp->arg[arg].reg == NULL)
2172 break;
2173 magic = (magic & 0xffffff) | (arg << 24);
2174
2175 for (j = i; j >= 0 && arg < pp->argc; )
2176 {
2177 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
2178 if (ops[j].cc_scratch != magic) {
2179 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
2180 pp->name);
2181 return -1;
2182 }
2183 // ok: have already been here
2184 return 0;
2185 }
2186 ops[j].cc_scratch = magic;
2187
2188 if (g_labels[j][0] != 0) {
2189 lr = &g_label_refs[j];
2190 if (lr->next != NULL)
2191 need_op_saving = 1;
2192 for (; lr->next; lr = lr->next) {
2193 if ((ops[lr->i].flags & (OPF_JMP|OPF_CC)) != OPF_JMP)
2194 may_reuse = 1;
2195 ret = collect_call_args(po, lr->i, pp, save_arg_vars,
2196 arg, magic, need_op_saving, may_reuse);
2197 if (ret < 0)
2198 return ret;
2199 }
2200
2201 if ((ops[lr->i].flags & (OPF_JMP|OPF_CC)) != OPF_JMP)
2202 may_reuse = 1;
2203 if (j > 0 && LAST_OP(j - 1)) {
2204 // follow last branch in reverse
2205 j = lr->i;
2206 continue;
2207 }
2208 need_op_saving = 1;
2209 ret = collect_call_args(po, lr->i, pp, save_arg_vars,
2210 arg, magic, need_op_saving, may_reuse);
2211 if (ret < 0)
2212 return ret;
2213 }
2214 j--;
2215
2216 if (ops[j].op == OP_CALL)
2217 {
2218 pp_tmp = ops[j].datap;
2219 if (pp_tmp == NULL)
2220 ferr(po, "arg collect hit unparsed call '%s'\n",
2221 ops[j].operand[0].name);
2222 if (may_reuse && pp_tmp->argc_stack > 0)
2223 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
2224 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
2225 }
2226 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP) {
2227 ferr(po, "arg collect %d/%d hit esp adjust\n",
2228 arg, pp->argc);
2229 }
2230 else if (ops[j].op == OP_POP) {
2231 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
2232 }
2233 else if ((ops[j].flags & (OPF_JMP|OPF_CC)) == (OPF_JMP|OPF_CC))
2234 {
2235 may_reuse = 1;
2236 }
2237 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARG))
2238 {
2239 pp->arg[arg].datap = &ops[j];
2240 need_to_save_current = 0;
2241 if (!need_op_saving) {
2242 ret = scan_for_mod(&ops[j], j + 1, i);
2243 need_to_save_current = (ret >= 0);
2244 }
2245 if (need_op_saving || need_to_save_current) {
2246 // mark this push as one that needs operand saving
2247 ops[j].flags &= ~OPF_RMD;
2248 if (ops[j].argnum == 0) {
2249 ops[j].argnum = arg + 1;
2250 *save_arg_vars |= 1 << arg;
2251 }
2252 else if (ops[j].argnum < arg + 1)
2253 ferr(&ops[j], "argnum conflict (%d<%d) for '%s'\n",
2254 ops[j].argnum, arg + 1, pp->name);
2255 }
2256 else if (ops[j].argnum == 0)
2257 ops[j].flags |= OPF_RMD;
2258
2259 // some PUSHes are reused by different calls on other branches,
2260 // but that can't happen if we didn't branch, so they
2261 // can be removed from future searches (handles nested calls)
2262 if (!may_reuse)
2263 ops[j].flags |= OPF_FARG;
2264
2265 // next arg
2266 for (arg++; arg < pp->argc; arg++)
2267 if (pp->arg[arg].reg == NULL)
2268 break;
2269 magic = (magic & 0xffffff) | (arg << 24);
2270 }
2271 }
2272
2273 if (arg < pp->argc) {
2274 ferr(po, "arg collect failed for '%s': %d/%d\n",
2275 pp->name, arg, pp->argc);
2276 ret = -1;
2277 }
2278 return ret;
2279}
2280
2281static void add_label_ref(struct label_ref *lr, int op_i)
2282{
2283 struct label_ref *lr_new;
2284
2285 if (lr->i == -1) {
2286 lr->i = op_i;
2287 return;
2288 }
2289
2290 lr_new = calloc(1, sizeof(*lr_new));
2291 lr_new->i = op_i;
2292 lr_new->next = lr->next;
2293 lr->next = lr_new;
2294}
2295
2296static void output_std_flags(FILE *fout, struct parsed_op *po,
2297 int *pfomask, const char *dst_opr_text)
2298{
2299 if (*pfomask & (1 << PFO_Z)) {
2300 fprintf(fout, "\n cond_z = (%s%s == 0);",
2301 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
2302 *pfomask &= ~(1 << PFO_Z);
2303 }
2304 if (*pfomask & (1 << PFO_S)) {
2305 fprintf(fout, "\n cond_s = (%s%s < 0);",
2306 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
2307 *pfomask &= ~(1 << PFO_S);
2308 }
2309}
2310
2311static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
2312{
2313 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
2314 struct parsed_opr *last_arith_dst = NULL;
2315 char buf1[256], buf2[256], buf3[256], cast[64];
2316 const struct parsed_proto *pp_c;
2317 struct parsed_proto *pp, *pp_tmp;
2318 struct parsed_data *pd;
2319 const char *tmpname;
2320 enum parsed_flag_op pfo;
2321 int save_arg_vars = 0;
2322 int cmp_result_vars = 0;
2323 int need_mul_var = 0;
2324 int have_func_ret = 0;
2325 int had_decl = 0;
2326 int label_pending = 0;
2327 int regmask_save = 0;
2328 int regmask_arg = 0;
2329 int regmask_now = 0;
2330 int regmask = 0;
2331 int pfomask = 0;
2332 int found = 0;
2333 int depth = 0;
2334 int no_output;
2335 int i, j, l;
2336 int dummy;
2337 int arg;
2338 int reg;
2339 int ret;
2340
2341 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
2342
2343 g_func_pp = proto_parse(fhdr, funcn);
2344 if (g_func_pp == NULL)
2345 ferr(ops, "proto_parse failed for '%s'\n", funcn);
2346
2347 fprintf(fout, "%s ", g_func_pp->ret_type.name);
2348 if (g_func_pp->is_stdcall && g_func_pp->argc_reg == 0)
2349 fprintf(fout, "__stdcall ");
2350 if (g_ida_func_attr & IDAFA_NORETURN)
2351 fprintf(fout, "noreturn ");
2352 fprintf(fout, "%s(", funcn);
2353
2354 for (i = 0; i < g_func_pp->argc; i++) {
2355 if (i > 0)
2356 fprintf(fout, ", ");
2357 if (g_func_pp->arg[i].fptr != NULL) {
2358 // func pointer..
2359 pp = g_func_pp->arg[i].fptr;
2360 fprintf(fout, "%s (", pp->ret_type.name);
2361 if (pp->is_stdcall && pp->argc_reg == 0)
2362 fprintf(fout, "__stdcall ");
2363 fprintf(fout, "*a%d)(", i + 1);
2364 for (j = 0; j < pp->argc; j++) {
2365 if (j > 0)
2366 fprintf(fout, ", ");
2367 if (pp->arg[j].fptr)
2368 ferr(ops, "nested fptr\n");
2369 fprintf(fout, "%s", pp->arg[j].type.name);
2370 }
2371 fprintf(fout, ")");
2372 }
2373 else {
2374 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
2375 }
2376 }
2377 if (g_func_pp->is_vararg) {
2378 if (i > 0)
2379 fprintf(fout, ", ");
2380 fprintf(fout, "...");
2381 }
2382
2383 fprintf(fout, ")\n{\n");
2384
2385 // pass1:
2386 // - handle ebp/esp frame, remove ops related to it
2387 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2388 && ops[1].op == OP_MOV
2389 && IS(opr_name(&ops[1], 0), "ebp")
2390 && IS(opr_name(&ops[1], 1), "esp"))
2391 {
2392 int ecx_push = 0;
2393
2394 g_bp_frame = 1;
2395 ops[0].flags |= OPF_RMD;
2396 ops[1].flags |= OPF_RMD;
2397 i = 2;
2398
2399 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2400 g_stack_fsz = opr_const(&ops[2], 1);
2401 ops[2].flags |= OPF_RMD;
2402 i++;
2403 }
2404 else {
2405 // another way msvc builds stack frame..
2406 i = 2;
2407 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2408 g_stack_fsz += 4;
2409 ops[i].flags |= OPF_RMD;
2410 ecx_push++;
2411 i++;
2412 }
2413 // and another way..
2414 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
2415 && ops[i].operand[1].type == OPT_CONST
2416 && ops[i + 1].op == OP_CALL
2417 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
2418 {
2419 g_stack_fsz += ops[i].operand[1].val;
2420 ops[i].flags |= OPF_RMD;
2421 i++;
2422 ops[i].flags |= OPF_RMD;
2423 i++;
2424 }
2425 }
2426
2427 found = 0;
2428 do {
2429 for (; i < opcnt; i++)
2430 if (ops[i].op == OP_RET)
2431 break;
2432 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
2433 break;
2434
2435 if (ops[i - 1].op == OP_POP && IS(opr_name(&ops[i - 1], 0), "ebp"))
2436 ops[i - 1].flags |= OPF_RMD;
2437 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2438 ferr(&ops[i - 1], "'pop ebp' expected\n");
2439
2440 if (g_stack_fsz != 0) {
2441 if (ops[i - 2].op == OP_MOV
2442 && IS(opr_name(&ops[i - 2], 0), "esp")
2443 && IS(opr_name(&ops[i - 2], 1), "ebp"))
2444 {
2445 ops[i - 2].flags |= OPF_RMD;
2446 }
2447 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2448 ferr(&ops[i - 2], "esp restore expected\n");
2449
2450 if (ecx_push && ops[i - 3].op == OP_POP
2451 && IS(opr_name(&ops[i - 3], 0), "ecx"))
2452 {
2453 ferr(&ops[i - 3], "unexpected ecx pop\n");
2454 }
2455 }
2456
2457 found = 1;
2458 i++;
2459 } while (i < opcnt);
2460 }
2461 else {
2462 for (i = 0; i < opcnt; i++) {
2463 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2464 break;
2465 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2466 && ops[i].operand[1].type == OPT_CONST)
2467 {
2468 g_sp_frame = 1;
2469 break;
2470 }
2471 }
2472
2473 if (g_sp_frame)
2474 {
2475 g_stack_fsz = ops[i].operand[1].val;
2476 ops[i].flags |= OPF_RMD;
2477
2478 i++;
2479 do {
2480 for (; i < opcnt; i++)
2481 if (ops[i].op == OP_RET)
2482 break;
2483 if (ops[i - 1].op != OP_ADD
2484 || !IS(opr_name(&ops[i - 1], 0), "esp")
2485 || ops[i - 1].operand[1].type != OPT_CONST
2486 || ops[i - 1].operand[1].val != g_stack_fsz)
2487 ferr(&ops[i - 1], "'add esp' expected\n");
2488 ops[i - 1].flags |= OPF_RMD;
2489
2490 i++;
2491 } while (i < opcnt);
2492 }
2493 }
2494
2495 // pass2:
2496 // - parse calls with labels
2497 // - resolve all branches
2498 for (i = 0; i < opcnt; i++)
2499 {
2500 po = &ops[i];
2501 po->bt_i = -1;
2502 po->btj = NULL;
2503
2504 if (po->flags & OPF_RMD)
2505 continue;
2506
2507 if (po->op == OP_CALL) {
2508 if (po->operand[0].type == OPT_LABEL) {
2509 tmpname = opr_name(po, 0);
2510 pp_c = proto_parse(fhdr, tmpname);
2511 if (pp_c == NULL)
2512 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2513 if (pp_c->is_fptr && pp_c->argc_reg != 0)
2514 ferr(po, "fptr call with reg arg\n");
2515 pp = proto_clone(pp_c);
2516 my_assert_not(pp, NULL);
2517 po->datap = pp;
2518 }
2519 continue;
2520 }
2521
2522 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
2523 continue;
2524
2525 if (po->operand[0].type == OPT_REGMEM) {
2526 char *p = strchr(po->operand[0].name, '[');
2527 if (p == NULL)
2528 ferr(po, "unhandled indirect branch\n");
2529 ret = p - po->operand[0].name;
2530 strncpy(buf1, po->operand[0].name, ret);
2531 buf1[ret] = 0;
2532
2533 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2534 if (IS(g_func_pd[j].label, buf1)) {
2535 pd = &g_func_pd[j];
2536 break;
2537 }
2538 }
2539 if (pd == NULL)
2540 //ferr(po, "label '%s' not parsed?\n", buf1);
2541 goto tailcall;
2542 if (pd->type != OPT_OFFSET)
2543 ferr(po, "label '%s' with non-offset data?\n", buf1);
2544
2545 // find all labels, link
2546 for (j = 0; j < pd->count; j++) {
2547 for (l = 0; l < opcnt; l++) {
2548 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2549 add_label_ref(&g_label_refs[l], i);
2550 pd->d[j].bt_i = l;
2551 break;
2552 }
2553 }
2554 }
2555
2556 po->btj = pd;
2557 continue;
2558 }
2559
2560 for (l = 0; l < opcnt; l++) {
2561 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2562 add_label_ref(&g_label_refs[l], i);
2563 po->bt_i = l;
2564 break;
2565 }
2566 }
2567
2568 if (po->bt_i != -1)
2569 continue;
2570
2571 if (po->operand[0].type == OPT_LABEL)
2572 // assume tail call
2573 goto tailcall;
2574
2575 ferr(po, "unhandled branch\n");
2576
2577tailcall:
2578 po->op = OP_CALL;
2579 po->flags |= OPF_TAIL;
2580 i--; // reprocess
2581 }
2582
2583 // pass3:
2584 // - process calls
2585 for (i = 0; i < opcnt; i++)
2586 {
2587 po = &ops[i];
2588 if (po->flags & OPF_RMD)
2589 continue;
2590
2591 if (po->op == OP_CALL)
2592 {
2593 tmpname = opr_name(po, 0);
2594 pp = po->datap;
2595 if (pp == NULL)
2596 {
2597 // indirect call
2598 pp = calloc(1, sizeof(*pp));
2599 my_assert_not(pp, NULL);
2600 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2601 if (ret < 0)
2602 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2603 j /= 4;
2604 if (j > ARRAY_SIZE(pp->arg))
2605 ferr(po, "esp adjust too large?\n");
2606 pp->ret_type.name = strdup("int");
2607 pp->argc = pp->argc_stack = j;
2608 for (arg = 0; arg < pp->argc; arg++)
2609 pp->arg[arg].type.name = strdup("int");
2610 po->datap = pp;
2611 }
2612
2613 // look for and make use of esp adjust
2614 ret = -1;
2615 if (!pp->is_stdcall && pp->argc_stack > 0)
2616 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2617 if (ret >= 0) {
2618 if (pp->is_vararg) {
2619 if (j / 4 < pp->argc_stack)
2620 ferr(po, "esp adjust is too small: %x < %x\n",
2621 j, pp->argc_stack * 4);
2622 // modify pp to make it have varargs as normal args
2623 arg = pp->argc;
2624 pp->argc += j / 4 - pp->argc_stack;
2625 for (; arg < pp->argc; arg++) {
2626 pp->arg[arg].type.name = strdup("int");
2627 pp->argc_stack++;
2628 }
2629 if (pp->argc > ARRAY_SIZE(pp->arg))
2630 ferr(po, "too many args for '%s'\n", tmpname);
2631 }
2632 if (pp->argc_stack != j / 4)
2633 ferr(po, "stack tracking failed for '%s': %x %x\n",
2634 tmpname, pp->argc_stack * 4, j);
2635
2636 ops[ret].flags |= OPF_RMD;
2637 // a bit of a hack, but deals with use of
2638 // single adj for multiple calls
2639 ops[ret].operand[1].val -= j;
2640 }
2641 else if (pp->is_vararg)
2642 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2643 pp->name);
2644
2645 // can't call functions with non-__cdecl callbacks yet
2646 for (arg = 0; arg < pp->argc; arg++) {
2647 if (pp->arg[arg].fptr != NULL) {
2648 pp_tmp = pp->arg[arg].fptr;
2649 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2650 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2651 }
2652 }
2653
2654 collect_call_args(po, i, pp, &save_arg_vars,
2655 0, i + opcnt * 2, 0, 0);
2656
2657 if (strstr(pp->ret_type.name, "int64"))
2658 need_mul_var = 1;
2659 if (!(po->flags & OPF_TAIL) && !IS(pp->ret_type.name, "void"))
2660 have_func_ret = 1;
2661 }
2662 }
2663
2664 // pass4:
2665 // - find POPs for PUSHes, rm both
2666 // - scan for all used registers
2667 // - find flag set ops for their users
2668 // - declare indirect functions
2669 for (i = 0; i < opcnt; i++) {
2670 po = &ops[i];
2671 if (po->flags & OPF_RMD)
2672 continue;
2673
2674 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
2675 reg = po->operand[0].reg;
2676 if (!(regmask & (1 << reg)))
2677 // not a reg save after all, rerun scan_for_pop
2678 po->flags &= ~OPF_RSAVE;
2679 else
2680 regmask_save |= 1 << reg;
2681 }
2682
2683 if (po->op == OP_PUSH
2684 && po->argnum == 0 && !(po->flags & OPF_RSAVE)
2685 && po->operand[0].type == OPT_REG)
2686 {
2687 reg = po->operand[0].reg;
2688 if (reg < 0)
2689 ferr(po, "reg not set for push?\n");
2690
2691 depth = 0;
2692 ret = scan_for_pop(i + 1, opcnt,
2693 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
2694 if (ret == 1) {
2695 if (depth > 1)
2696 ferr(po, "too much depth: %d\n", depth);
2697
2698 po->flags |= OPF_RMD;
2699 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2700 i + opcnt * 4, 0, &depth, 1);
2701 continue;
2702 }
2703 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2704 if (ret == 0) {
2705 arg = OPF_RMD;
2706 if (regmask & (1 << reg)) {
2707 if (regmask_save & (1 << reg))
2708 ferr(po, "%s already saved?\n", po->operand[0].name);
2709 arg = OPF_RSAVE;
2710 }
2711 po->flags |= arg;
2712 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2713 continue;
2714 }
2715 }
2716
2717 regmask_now = po->regmask_src | po->regmask_dst;
2718 if (regmask_now & (1 << xBP)) {
2719 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
2720 if (po->regmask_dst & (1 << xBP))
2721 // compiler decided to drop bp frame and use ebp as scratch
2722 scan_fwd_set_flags(i, opcnt, i + opcnt * 5, OPF_EBP_S);
2723 else
2724 regmask_now &= ~(1 << xBP);
2725 }
2726 }
2727
2728 regmask |= regmask_now;
2729
2730 if (po->flags & OPF_CC)
2731 {
2732 int setters[16], cnt = 0, branched = 0;
2733
2734 ret = scan_for_flag_set(i, i + opcnt * 6,
2735 &branched, setters, &cnt);
2736 if (ret < 0 || cnt <= 0)
2737 ferr(po, "unable to trace flag setter(s)\n");
2738 if (cnt > ARRAY_SIZE(setters))
2739 ferr(po, "too many flag setters\n");
2740
2741 pfo = split_cond(po, po->op, &dummy);
2742 for (j = 0; j < cnt; j++)
2743 {
2744 tmp_op = &ops[setters[j]]; // flag setter
2745 pfomask = 0;
2746
2747 // to get nicer code, we try to delay test and cmp;
2748 // if we can't because of operand modification, or if we
2749 // have math op, or branch, make it calculate flags explicitly
2750 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2751 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i) >= 0)
2752 pfomask = 1 << pfo;
2753 }
2754 else if (tmp_op->op == OP_CMPS) {
2755 pfomask = 1 << PFO_Z;
2756 }
2757 else {
2758 // see if we'll be able to handle based on op result
2759 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
2760 && pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2761 || branched
2762 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
2763 pfomask = 1 << pfo;
2764 }
2765 if (pfomask) {
2766 tmp_op->pfomask |= pfomask;
2767 cmp_result_vars |= pfomask;
2768 }
2769 // note: may overwrite, currently not a problem
2770 po->datap = tmp_op;
2771 }
2772
2773 if (po->op == OP_ADC || po->op == OP_SBB)
2774 cmp_result_vars |= 1 << PFO_C;
2775 }
2776 else if (po->op == OP_MUL
2777 || (po->op == OP_IMUL && po->operand_cnt == 1))
2778 {
2779 need_mul_var = 1;
2780 }
2781 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2782 pp = po->datap;
2783 my_assert_not(pp, NULL);
2784 fprintf(fout, " %s (*icall%d)(", pp->ret_type.name, i);
2785 for (j = 0; j < pp->argc; j++) {
2786 if (j > 0)
2787 fprintf(fout, ", ");
2788 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
2789 }
2790 fprintf(fout, ");\n");
2791 }
2792 }
2793
2794 // output LUTs/jumptables
2795 for (i = 0; i < g_func_pd_cnt; i++) {
2796 pd = &g_func_pd[i];
2797 fprintf(fout, " static const ");
2798 if (pd->type == OPT_OFFSET) {
2799 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2800
2801 for (j = 0; j < pd->count; j++) {
2802 if (j > 0)
2803 fprintf(fout, ", ");
2804 fprintf(fout, "&&%s", pd->d[j].u.label);
2805 }
2806 }
2807 else {
2808 fprintf(fout, "%s %s[] =\n { ",
2809 lmod_type_u(ops, pd->lmod), pd->label);
2810
2811 for (j = 0; j < pd->count; j++) {
2812 if (j > 0)
2813 fprintf(fout, ", ");
2814 fprintf(fout, "%u", pd->d[j].u.val);
2815 }
2816 }
2817 fprintf(fout, " };\n");
2818 }
2819
2820 // declare stack frame, va_arg
2821 if (g_stack_fsz)
2822 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
2823 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
2824
2825 if (g_func_pp->is_vararg)
2826 fprintf(fout, " va_list ap;\n");
2827
2828 // declare arg-registers
2829 for (i = 0; i < g_func_pp->argc; i++) {
2830 if (g_func_pp->arg[i].reg != NULL) {
2831 reg = char_array_i(regs_r32,
2832 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
2833 if (reg < 0)
2834 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp->arg[i].reg);
2835
2836 regmask_arg |= 1 << reg;
2837 fprintf(fout, " u32 %s = (u32)a%d;\n",
2838 g_func_pp->arg[i].reg, i + 1);
2839 had_decl = 1;
2840 }
2841 }
2842
2843 // declare other regs - special case for eax
2844 if (!((regmask | regmask_arg) & 1) && have_func_ret
2845 && !IS(g_func_pp->ret_type.name, "void"))
2846 {
2847 fprintf(fout, " u32 eax = 0;\n");
2848 had_decl = 1;
2849 }
2850
2851 regmask &= ~regmask_arg;
2852 regmask &= ~(1 << xSP);
2853 if (regmask) {
2854 for (reg = 0; reg < 8; reg++) {
2855 if (regmask & (1 << reg)) {
2856 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2857 had_decl = 1;
2858 }
2859 }
2860 }
2861
2862 if (regmask_save) {
2863 for (reg = 0; reg < 8; reg++) {
2864 if (regmask_save & (1 << reg)) {
2865 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2866 had_decl = 1;
2867 }
2868 }
2869 }
2870
2871 if (save_arg_vars) {
2872 for (reg = 0; reg < 32; reg++) {
2873 if (save_arg_vars & (1 << reg)) {
2874 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2875 had_decl = 1;
2876 }
2877 }
2878 }
2879
2880 if (cmp_result_vars) {
2881 for (i = 0; i < 8; i++) {
2882 if (cmp_result_vars & (1 << i)) {
2883 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2884 had_decl = 1;
2885 }
2886 }
2887 }
2888
2889 if (need_mul_var) {
2890 fprintf(fout, " u64 mul_tmp;\n");
2891 had_decl = 1;
2892 }
2893
2894 if (had_decl)
2895 fprintf(fout, "\n");
2896
2897 if (g_func_pp->is_vararg) {
2898 if (g_func_pp->argc_stack == 0)
2899 ferr(ops, "vararg func without stack args?\n");
2900 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
2901 }
2902
2903 // output ops
2904 for (i = 0; i < opcnt; i++)
2905 {
2906 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1) {
2907 fprintf(fout, "\n%s:\n", g_labels[i]);
2908 label_pending = 1;
2909
2910 delayed_flag_op = NULL;
2911 last_arith_dst = NULL;
2912 }
2913
2914 po = &ops[i];
2915 if (po->flags & OPF_RMD)
2916 continue;
2917
2918 no_output = 0;
2919
2920 #define assert_operand_cnt(n_) \
2921 if (po->operand_cnt != n_) \
2922 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2923
2924 // conditional/flag using op?
2925 if (po->flags & OPF_CC)
2926 {
2927 int is_delayed = 0;
2928 int is_inv = 0;
2929
2930 pfo = split_cond(po, po->op, &is_inv);
2931 tmp_op = po->datap;
2932
2933 // we go through all this trouble to avoid using parsed_flag_op,
2934 // which makes generated code much nicer
2935 if (delayed_flag_op != NULL)
2936 {
2937 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2938 is_delayed = 1;
2939 }
2940 else if (last_arith_dst != NULL
2941 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P
2942 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
2943 ))
2944 {
2945 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
2946 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
2947 last_arith_dst->lmod, buf3);
2948 is_delayed = 1;
2949 }
2950 else if (tmp_op != NULL) {
2951 // use preprocessed flag calc results
2952 if (!(tmp_op->pfomask & (1 << pfo)))
2953 ferr(po, "not prepared for pfo %d\n", pfo);
2954
2955 // note: is_inv was not yet applied
2956 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
2957 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
2958 }
2959 else {
2960 ferr(po, "all methods of finding comparison failed\n");
2961 }
2962
2963 if (po->flags & OPF_JMP) {
2964 fprintf(fout, " if %s\n", buf1);
2965 }
2966 else if (po->op == OP_ADC || po->op == OP_SBB) {
2967 if (is_delayed)
2968 fprintf(fout, " cond_%s = %s;\n",
2969 parsed_flag_op_names[pfo], buf1);
2970 }
2971 else if (po->flags & OPF_DATA) { // SETcc
2972 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2973 fprintf(fout, " %s = %s;", buf2, buf1);
2974 }
2975 else {
2976 ferr(po, "unhandled conditional op\n");
2977 }
2978 }
2979
2980 pfomask = po->pfomask;
2981
2982 switch (po->op)
2983 {
2984 case OP_MOV:
2985 assert_operand_cnt(2);
2986 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2987 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2988 fprintf(fout, " %s = %s;", buf1,
2989 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2990 po->operand[0].is_ptr ? "(void *)" : "", 0));
2991 break;
2992
2993 case OP_LEA:
2994 assert_operand_cnt(2);
2995 po->operand[1].lmod = OPLM_DWORD; // always
2996 fprintf(fout, " %s = %s;",
2997 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2998 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2999 NULL, 1));
3000 break;
3001
3002 case OP_MOVZX:
3003 assert_operand_cnt(2);
3004 fprintf(fout, " %s = %s;",
3005 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3006 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3007 break;
3008
3009 case OP_MOVSX:
3010 assert_operand_cnt(2);
3011 switch (po->operand[1].lmod) {
3012 case OPLM_BYTE:
3013 strcpy(buf3, "(s8)");
3014 break;
3015 case OPLM_WORD:
3016 strcpy(buf3, "(s16)");
3017 break;
3018 default:
3019 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
3020 }
3021 fprintf(fout, " %s = %s%s;",
3022 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3023 buf3,
3024 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3025 break;
3026
3027 case OP_NOT:
3028 assert_operand_cnt(1);
3029 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3030 fprintf(fout, " %s = ~%s;", buf1, buf1);
3031 break;
3032
3033 case OP_CDQ:
3034 assert_operand_cnt(2);
3035 fprintf(fout, " %s = (s32)%s >> 31;",
3036 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3037 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3038 strcpy(g_comment, "cdq");
3039 break;
3040
3041 case OP_STOS:
3042 // assumes DF=0
3043 assert_operand_cnt(3);
3044 if (po->flags & OPF_REP) {
3045 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
3046 lmod_bytes(po, po->operand[0].lmod));
3047 fprintf(fout, " %sedi = eax;",
3048 lmod_cast_u_ptr(po, po->operand[0].lmod));
3049 strcpy(g_comment, "rep stos");
3050 }
3051 else {
3052 fprintf(fout, " %sedi = eax; edi += %d;",
3053 lmod_cast_u_ptr(po, po->operand[0].lmod),
3054 lmod_bytes(po, po->operand[0].lmod));
3055 strcpy(g_comment, "stos");
3056 }
3057 break;
3058
3059 case OP_MOVS:
3060 // assumes DF=0
3061 assert_operand_cnt(3);
3062 j = lmod_bytes(po, po->operand[0].lmod);
3063 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
3064 if (po->flags & OPF_REP) {
3065 fprintf(fout,
3066 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
3067 j, j);
3068 fprintf(fout,
3069 " %sedi = %sesi;", buf1, buf1);
3070 strcpy(g_comment, "rep movs");
3071 }
3072 else {
3073 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
3074 buf1, buf1, j, j);
3075 strcpy(g_comment, "movs");
3076 }
3077 break;
3078
3079 case OP_CMPS:
3080 // assumes DF=0
3081 // repe ~ repeat while ZF=1
3082 assert_operand_cnt(3);
3083 j = lmod_bytes(po, po->operand[0].lmod);
3084 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
3085 if (po->flags & OPF_REP) {
3086 fprintf(fout,
3087 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
3088 j, j);
3089 fprintf(fout,
3090 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
3091 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
3092 fprintf(fout,
3093 " break;");
3094 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
3095 (po->flags & OPF_REPZ) ? "e" : "ne");
3096 }
3097 else {
3098 fprintf(fout,
3099 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
3100 buf1, buf1, j, j);
3101 strcpy(g_comment, "cmps");
3102 }
3103 pfomask &= ~(1 << PFO_Z);
3104 last_arith_dst = NULL;
3105 delayed_flag_op = NULL;
3106 break;
3107
3108 // arithmetic w/flags
3109 case OP_ADD:
3110 case OP_SUB:
3111 case OP_AND:
3112 case OP_OR:
3113 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3114 // fallthrough
3115 dualop_arith:
3116 assert_operand_cnt(2);
3117 fprintf(fout, " %s %s= %s;",
3118 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3119 op_to_c(po),
3120 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3121 output_std_flags(fout, po, &pfomask, buf1);
3122 last_arith_dst = &po->operand[0];
3123 delayed_flag_op = NULL;
3124 break;
3125
3126 case OP_SHL:
3127 case OP_SHR:
3128 assert_operand_cnt(2);
3129 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3130 if (pfomask & (1 << PFO_C)) {
3131 if (po->operand[1].type == OPT_CONST) {
3132 l = lmod_bytes(po, po->operand[0].lmod) * 8;
3133 j = po->operand[1].val;
3134 j %= l;
3135 if (j != 0) {
3136 if (po->op == OP_SHL)
3137 j = l - j;
3138 else
3139 j -= 1;
3140 fprintf(fout, " cond_c = (%s & 0x%02x) ? 1 : 0;\n",
3141 buf1, 1 << j);
3142 }
3143 else
3144 ferr(po, "zero shift?\n");
3145 }
3146 else
3147 ferr(po, "TODO\n");
3148 pfomask &= ~(1 << PFO_C);
3149 }
3150 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
3151 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3152 output_std_flags(fout, po, &pfomask, buf1);
3153 last_arith_dst = &po->operand[0];
3154 delayed_flag_op = NULL;
3155 break;
3156
3157 case OP_SAR:
3158 assert_operand_cnt(2);
3159 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3160 fprintf(fout, " %s = %s%s >> %s;", buf1,
3161 lmod_cast_s(po, po->operand[0].lmod), buf1,
3162 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3163 output_std_flags(fout, po, &pfomask, buf1);
3164 last_arith_dst = &po->operand[0];
3165 delayed_flag_op = NULL;
3166 break;
3167
3168 case OP_ROL:
3169 case OP_ROR:
3170 assert_operand_cnt(2);
3171 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3172 if (po->operand[1].type == OPT_CONST) {
3173 j = po->operand[1].val;
3174 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
3175 fprintf(fout, po->op == OP_ROL ?
3176 " %s = (%s << %d) | (%s >> %d);" :
3177 " %s = (%s >> %d) | (%s << %d);",
3178 buf1, buf1, j, buf1,
3179 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
3180 }
3181 else
3182 ferr(po, "TODO\n");
3183 output_std_flags(fout, po, &pfomask, buf1);
3184 last_arith_dst = &po->operand[0];
3185 delayed_flag_op = NULL;
3186 break;
3187
3188 case OP_XOR:
3189 assert_operand_cnt(2);
3190 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3191 if (IS(opr_name(po, 0), opr_name(po, 1))) {
3192 // special case for XOR
3193 fprintf(fout, " %s = 0;",
3194 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
3195 last_arith_dst = &po->operand[0];
3196 delayed_flag_op = NULL;
3197 break;
3198 }
3199 goto dualop_arith;
3200
3201 case OP_ADC:
3202 case OP_SBB:
3203 assert_operand_cnt(2);
3204 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3205 if (po->op == OP_SBB
3206 && IS(po->operand[0].name, po->operand[1].name))
3207 {
3208 // avoid use of unitialized var
3209 fprintf(fout, " %s = -cond_c;",
3210 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
3211 // carry remains what it was
3212 pfomask &= ~(1 << PFO_C);
3213 }
3214 else {
3215 fprintf(fout, " %s %s= %s + cond_c;",
3216 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3217 op_to_c(po),
3218 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
3219 }
3220 last_arith_dst = &po->operand[0];
3221 delayed_flag_op = NULL;
3222 break;
3223
3224 case OP_INC:
3225 case OP_DEC:
3226 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3227 if (po->operand[0].type == OPT_REG) {
3228 strcpy(buf2, po->op == OP_INC ? "++" : "--");
3229 fprintf(fout, " %s%s;", buf1, buf2);
3230 }
3231 else {
3232 strcpy(buf2, po->op == OP_INC ? "+" : "-");
3233 fprintf(fout, " %s %s= 1;", buf1, buf2);
3234 }
3235 last_arith_dst = &po->operand[0];
3236 delayed_flag_op = NULL;
3237 break;
3238
3239 case OP_NEG:
3240 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3241 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
3242 fprintf(fout, " %s = -%s%s;", buf1,
3243 lmod_cast_s(po, po->operand[0].lmod), buf2);
3244 last_arith_dst = &po->operand[0];
3245 delayed_flag_op = NULL;
3246 if (pfomask & (1 << PFO_C)) {
3247 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
3248 pfomask &= ~(1 << PFO_C);
3249 }
3250 break;
3251
3252 case OP_IMUL:
3253 if (po->operand_cnt == 2) {
3254 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3255 goto dualop_arith;
3256 }
3257 if (po->operand_cnt == 3)
3258 ferr(po, "TODO imul3\n");
3259 // fallthrough
3260 case OP_MUL:
3261 assert_operand_cnt(1);
3262 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
3263 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
3264 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
3265 fprintf(fout, " edx = mul_tmp >> 32;\n");
3266 fprintf(fout, " eax = mul_tmp;");
3267 last_arith_dst = NULL;
3268 delayed_flag_op = NULL;
3269 break;
3270
3271 case OP_DIV:
3272 case OP_IDIV:
3273 assert_operand_cnt(1);
3274 if (po->operand[0].lmod != OPLM_DWORD)
3275 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
3276
3277 // 32bit division is common, look for it
3278 if (po->op == OP_DIV)
3279 ret = scan_for_reg_clear(i, xDX);
3280 else
3281 ret = scan_for_cdq_edx(i);
3282 if (ret >= 0) {
3283 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3284 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
3285 po->op == OP_IDIV));
3286 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
3287 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
3288 }
3289 else
3290 ferr(po, "TODO 64bit divident\n");
3291 last_arith_dst = NULL;
3292 delayed_flag_op = NULL;
3293 break;
3294
3295 case OP_TEST:
3296 case OP_CMP:
3297 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3298 if (pfomask != 0) {
3299 for (j = 0; j < 8; j++) {
3300 if (pfomask & (1 << j)) {
3301 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
3302 fprintf(fout, " cond_%s = %s;",
3303 parsed_flag_op_names[j], buf1);
3304 }
3305 }
3306 pfomask = 0;
3307 }
3308 else
3309 no_output = 1;
3310 last_arith_dst = NULL;
3311 delayed_flag_op = po;
3312 break;
3313
3314 // note: we reuse OP_Jcc for SETcc, only flags differ
3315 case OP_JO ... OP_JG:
3316 if (po->flags & OPF_JMP)
3317 fprintf(fout, " goto %s;", po->operand[0].name);
3318 // else SETcc - should already be handled
3319 break;
3320
3321 case OP_JMP:
3322 assert_operand_cnt(1);
3323 last_arith_dst = NULL;
3324 delayed_flag_op = NULL;
3325
3326 if (po->operand[0].type == OPT_REGMEM) {
3327 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
3328 buf1, buf2);
3329 if (ret != 2)
3330 ferr(po, "parse failure for jmp '%s'\n",
3331 po->operand[0].name);
3332 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
3333 break;
3334 }
3335 else if (po->operand[0].type != OPT_LABEL)
3336 ferr(po, "unhandled jmp type\n");
3337
3338 fprintf(fout, " goto %s;", po->operand[0].name);
3339 break;
3340
3341 case OP_CALL:
3342 assert_operand_cnt(1);
3343 pp = po->datap;
3344 if (pp == NULL)
3345 ferr(po, "NULL pp\n");
3346
3347 if (po->operand[0].type != OPT_LABEL)
3348 fprintf(fout, " icall%d = (void *)%s;\n", i,
3349 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]));
3350
3351 fprintf(fout, " ");
3352 if (strstr(pp->ret_type.name, "int64")) {
3353 if (po->flags & OPF_TAIL)
3354 ferr(po, "int64 and tail?\n");
3355 fprintf(fout, "mul_tmp = ");
3356 }
3357 else if (!IS(pp->ret_type.name, "void")) {
3358 if (po->flags & OPF_TAIL) {
3359 if (!IS(g_func_pp->ret_type.name, "void")) {
3360 fprintf(fout, "return ");
3361 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
3362 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
3363 }
3364 }
3365 else {
3366 fprintf(fout, "eax = ");
3367 if (pp->ret_type.is_ptr)
3368 fprintf(fout, "(u32)");
3369 }
3370 }
3371
3372 if (po->operand[0].type != OPT_LABEL) {
3373 fprintf(fout, "icall%d(", i);
3374 }
3375 else {
3376 if (pp->name[0] == 0)
3377 ferr(po, "missing pp->name\n");
3378 fprintf(fout, "%s%s(", pp->name,
3379 pp->has_structarg ? "_sa" : "");
3380 }
3381
3382 for (arg = 0; arg < pp->argc; arg++) {
3383 if (arg > 0)
3384 fprintf(fout, ", ");
3385
3386 cast[0] = 0;
3387 if (pp->arg[arg].type.is_ptr)
3388 snprintf(cast, sizeof(cast), "(%s)", pp->arg[arg].type.name);
3389
3390 if (pp->arg[arg].reg != NULL) {
3391 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
3392 continue;
3393 }
3394
3395 // stack arg
3396 tmp_op = pp->arg[arg].datap;
3397 if (tmp_op == NULL)
3398 ferr(po, "parsed_op missing for arg%d\n", arg);
3399 if (tmp_op->argnum != 0) {
3400 fprintf(fout, "%ss_a%d", cast, tmp_op->argnum);
3401 }
3402 else {
3403 fprintf(fout, "%s",
3404 out_src_opr(buf1, sizeof(buf1),
3405 tmp_op, &tmp_op->operand[0], cast, 0));
3406 }
3407 }
3408 fprintf(fout, ");");
3409
3410 if (strstr(pp->ret_type.name, "int64")) {
3411 fprintf(fout, "\n");
3412 fprintf(fout, " edx = mul_tmp >> 32;\n");
3413 fprintf(fout, " eax = mul_tmp;");
3414 }
3415
3416 if (po->flags & OPF_TAIL) {
3417 strcpy(g_comment, "tailcall");
3418 ret = 0;
3419 if (i == opcnt - 1)
3420 ret = 0;
3421 else if (IS(pp->ret_type.name, "void"))
3422 ret = 1;
3423 else if (IS(g_func_pp->ret_type.name, "void"))
3424 ret = 1;
3425 // else already handled as 'return f()'
3426
3427 if (ret) {
3428 fprintf(fout, "\n return;");
3429 strcpy(g_comment, "^ tailcall");
3430 }
3431 }
3432 delayed_flag_op = NULL;
3433 last_arith_dst = NULL;
3434 break;
3435
3436 case OP_RET:
3437 if (g_func_pp->is_vararg)
3438 fprintf(fout, " va_end(ap);\n");
3439
3440 if (IS(g_func_pp->ret_type.name, "void")) {
3441 if (i != opcnt - 1 || label_pending)
3442 fprintf(fout, " return;");
3443 }
3444 else if (g_func_pp->ret_type.is_ptr) {
3445 fprintf(fout, " return (%s)eax;",
3446 g_func_pp->ret_type.name);
3447 }
3448 else
3449 fprintf(fout, " return eax;");
3450
3451 last_arith_dst = NULL;
3452 delayed_flag_op = NULL;
3453 break;
3454
3455 case OP_PUSH:
3456 if (po->argnum != 0) {
3457 // special case - saved func arg
3458 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3459 fprintf(fout, " s_a%d = %s;", po->argnum, buf1);
3460 break;
3461 }
3462 else if (po->flags & OPF_RSAVE) {
3463 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
3464 fprintf(fout, " s_%s = %s;", buf1, buf1);
3465 break;
3466 }
3467 if (!(g_ida_func_attr & IDAFA_NORETURN))
3468 ferr(po, "stray push encountered\n");
3469 no_output = 1;
3470 break;
3471
3472 case OP_POP:
3473 if (po->flags & OPF_RSAVE) {
3474 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3475 fprintf(fout, " %s = s_%s;", buf1, buf1);
3476 break;
3477 }
3478 ferr(po, "stray pop encountered\n");
3479 break;
3480
3481 case OP_NOP:
3482 no_output = 1;
3483 break;
3484
3485 default:
3486 no_output = 1;
3487 ferr(po, "unhandled op type %d, flags %x\n",
3488 po->op, po->flags);
3489 break;
3490 }
3491
3492 if (g_comment[0] != 0) {
3493 fprintf(fout, " // %s", g_comment);
3494 g_comment[0] = 0;
3495 no_output = 0;
3496 }
3497 if (!no_output)
3498 fprintf(fout, "\n");
3499
3500 // some sanity checking
3501 if ((po->flags & OPF_REP) && po->op != OP_STOS
3502 && po->op != OP_MOVS && po->op != OP_CMPS)
3503 ferr(po, "unexpected rep\n");
3504 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
3505 ferr(po, "unexpected repz/repnz\n");
3506
3507 if (pfomask != 0)
3508 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
3509
3510 // see is delayed flag stuff is still valid
3511 if (delayed_flag_op != NULL && delayed_flag_op != po) {
3512 if (is_any_opr_modified(delayed_flag_op, po))
3513 delayed_flag_op = NULL;
3514 }
3515
3516 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
3517 if (is_opr_modified(last_arith_dst, po))
3518 last_arith_dst = NULL;
3519 }
3520
3521 label_pending = 0;
3522 }
3523
3524 fprintf(fout, "}\n\n");
3525
3526 // cleanup
3527 for (i = 0; i < opcnt; i++) {
3528 struct label_ref *lr, *lr_del;
3529
3530 lr = g_label_refs[i].next;
3531 while (lr != NULL) {
3532 lr_del = lr;
3533 lr = lr->next;
3534 free(lr_del);
3535 }
3536 g_label_refs[i].i = -1;
3537 g_label_refs[i].next = NULL;
3538
3539 if (ops[i].op == OP_CALL) {
3540 pp = ops[i].datap;
3541 if (pp)
3542 proto_release(pp);
3543 }
3544 }
3545 g_func_pp = NULL;
3546}
3547
3548static void set_label(int i, const char *name)
3549{
3550 const char *p;
3551 int len;
3552
3553 len = strlen(name);
3554 p = strchr(name, ':');
3555 if (p != NULL)
3556 len = p - name;
3557
3558 if (len > sizeof(g_labels[0]) - 1)
3559 aerr("label '%s' too long: %d\n", name, len);
3560 if (g_labels[i][0] != 0 && !IS_START(g_labels[i], "algn_"))
3561 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
3562 memcpy(g_labels[i], name, len);
3563 g_labels[i][len] = 0;
3564}
3565
3566// '=' needs special treatment..
3567static char *next_word_s(char *w, size_t wsize, char *s)
3568{
3569 size_t i;
3570
3571 s = sskip(s);
3572
3573 for (i = 0; i < wsize - 1; i++) {
3574 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3575 break;
3576 w[i] = s[i];
3577 }
3578 w[i] = 0;
3579
3580 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3581 printf("warning: '%s' truncated\n", w);
3582
3583 return s + i;
3584}
3585
3586struct chunk_item {
3587 char *name;
3588 long fptr;
3589 int asmln;
3590};
3591
3592static struct chunk_item *func_chunks;
3593static int func_chunk_cnt;
3594static int func_chunk_alloc;
3595
3596static void add_func_chunk(FILE *fasm, const char *name, int line)
3597{
3598 if (func_chunk_cnt >= func_chunk_alloc) {
3599 func_chunk_alloc *= 2;
3600 func_chunks = realloc(func_chunks,
3601 func_chunk_alloc * sizeof(func_chunks[0]));
3602 my_assert_not(func_chunks, NULL);
3603 }
3604 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
3605 func_chunks[func_chunk_cnt].name = strdup(name);
3606 func_chunks[func_chunk_cnt].asmln = line;
3607 func_chunk_cnt++;
3608}
3609
3610static int cmp_chunks(const void *p1, const void *p2)
3611{
3612 const struct chunk_item *c1 = p1, *c2 = p2;
3613 return strcmp(c1->name, c2->name);
3614}
3615
3616static int cmpstringp(const void *p1, const void *p2)
3617{
3618 return strcmp(*(char * const *)p1, *(char * const *)p2);
3619}
3620
3621static void scan_ahead(FILE *fasm)
3622{
3623 char words[2][256];
3624 char line[256];
3625 long oldpos;
3626 int oldasmln;
3627 int wordc;
3628 char *p;
3629 int i;
3630
3631 oldpos = ftell(fasm);
3632 oldasmln = asmln;
3633
3634 while (fgets(line, sizeof(line), fasm))
3635 {
3636 wordc = 0;
3637 asmln++;
3638
3639 p = sskip(line);
3640 if (*p == 0)
3641 continue;
3642
3643 if (*p == ';')
3644 {
3645 // get rid of random tabs
3646 for (i = 0; line[i] != 0; i++)
3647 if (line[i] == '\t')
3648 line[i] = ' ';
3649
3650 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
3651 {
3652 p += 30;
3653 next_word(words[0], sizeof(words[0]), p);
3654 if (words[0][0] == 0)
3655 aerr("missing name for func chunk?\n");
3656
3657 add_func_chunk(fasm, words[0], asmln);
3658 }
3659 continue;
3660 } // *p == ';'
3661
3662 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
3663 words[wordc][0] = 0;
3664 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3665 if (*p == 0 || *p == ';') {
3666 wordc++;
3667 break;
3668 }
3669 }
3670
3671 if (wordc == 2 && IS(words[1], "ends"))
3672 break;
3673 }
3674
3675 fseek(fasm, oldpos, SEEK_SET);
3676 asmln = oldasmln;
3677}
3678
3679int main(int argc, char *argv[])
3680{
3681 FILE *fout, *fasm, *frlist;
3682 struct parsed_data *pd = NULL;
3683 int pd_alloc = 0;
3684 char **rlist = NULL;
3685 int rlist_len = 0;
3686 int rlist_alloc = 0;
3687 int func_chunks_used = 0;
3688 int func_chunks_sorted = 0;
3689 int func_chunk_i = -1;
3690 long func_chunk_ret = 0;
3691 int func_chunk_ret_ln = 0;
3692 int scanned_ahead = 0;
3693 char line[256];
3694 char words[16][256];
3695 enum opr_lenmod lmod;
3696 int in_func = 0;
3697 int pending_endp = 0;
3698 int skip_func = 0;
3699 int skip_warned = 0;
3700 int eq_alloc;
3701 int verbose = 0;
3702 int arg_out;
3703 int arg = 1;
3704 int pi = 0;
3705 int i, j;
3706 int ret, len;
3707 char *p;
3708 int wordc;
3709
3710 if (argv[1] && IS(argv[1], "-v")) {
3711 verbose = 1;
3712 arg++;
3713 }
3714
3715 if (argc < arg + 3) {
3716 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
3717 argv[0]);
3718 return 1;
3719 }
3720
3721 arg_out = arg++;
3722
3723 asmfn = argv[arg++];
3724 fasm = fopen(asmfn, "r");
3725 my_assert_not(fasm, NULL);
3726
3727 hdrfn = argv[arg++];
3728 g_fhdr = fopen(hdrfn, "r");
3729 my_assert_not(g_fhdr, NULL);
3730
3731 rlist_alloc = 64;
3732 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3733 my_assert_not(rlist, NULL);
3734 // needs special handling..
3735 rlist[rlist_len++] = "__alloca_probe";
3736
3737 func_chunk_alloc = 32;
3738 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
3739 my_assert_not(func_chunks, NULL);
3740
3741 for (; arg < argc; arg++) {
3742 frlist = fopen(argv[arg], "r");
3743 my_assert_not(frlist, NULL);
3744
3745 while (fgets(line, sizeof(line), frlist)) {
3746 p = sskip(line);
3747 if (*p == 0 || *p == ';' || *p == '#')
3748 continue;
3749
3750 p = next_word(words[0], sizeof(words[0]), p);
3751 if (words[0][0] == 0)
3752 continue;
3753
3754 if (rlist_len >= rlist_alloc) {
3755 rlist_alloc = rlist_alloc * 2 + 64;
3756 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3757 my_assert_not(rlist, NULL);
3758 }
3759 rlist[rlist_len++] = strdup(words[0]);
3760 }
3761
3762 fclose(frlist);
3763 frlist = NULL;
3764 }
3765
3766 if (rlist_len > 0)
3767 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3768
3769 fout = fopen(argv[arg_out], "w");
3770 my_assert_not(fout, NULL);
3771
3772 eq_alloc = 128;
3773 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3774 my_assert_not(g_eqs, NULL);
3775
3776 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3777 g_label_refs[i].i = -1;
3778 g_label_refs[i].next = NULL;
3779 }
3780
3781 while (fgets(line, sizeof(line), fasm))
3782 {
3783 wordc = 0;
3784 asmln++;
3785
3786 p = sskip(line);
3787 if (*p == 0)
3788 continue;
3789
3790 // get rid of random tabs
3791 for (i = 0; line[i] != 0; i++)
3792 if (line[i] == '\t')
3793 line[i] = ' ';
3794
3795 if (*p == ';')
3796 {
3797 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3798 goto do_pending_endp; // eww..
3799
3800 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
3801 {
3802 static const char *attrs[] = {
3803 "bp-based frame",
3804 "library function",
3805 "static",
3806 "noreturn",
3807 "thunk",
3808 "fpd=",
3809 };
3810
3811 // parse IDA's attribute-list comment
3812 g_ida_func_attr = 0;
3813 p = sskip(p + 13);
3814
3815 for (; *p != 0; p = sskip(p)) {
3816 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3817 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
3818 g_ida_func_attr |= 1 << i;
3819 p += strlen(attrs[i]);
3820 break;
3821 }
3822 }
3823 if (i == ARRAY_SIZE(attrs)) {
3824 anote("unparsed IDA attr: %s\n", p);
3825 break;
3826 }
3827 if (IS(attrs[i], "fpd=")) {
3828 p = next_word(words[0], sizeof(words[0]), p);
3829 // ignore for now..
3830 }
3831 }
3832 }
3833 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
3834 {
3835 p += 30;
3836 next_word(words[0], sizeof(words[0]), p);
3837 if (words[0][0] == 0)
3838 aerr("missing name for func chunk?\n");
3839
3840 if (!scanned_ahead) {
3841 add_func_chunk(fasm, words[0], asmln);
3842 func_chunks_sorted = 0;
3843 }
3844 }
3845 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
3846 {
3847 if (func_chunk_i >= 0) {
3848 if (func_chunk_i < func_chunk_cnt
3849 && IS(func_chunks[func_chunk_i].name, g_func))
3850 {
3851 // move on to next chunk
3852 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
3853 if (ret)
3854 aerr("seek failed for '%s' chunk #%d\n",
3855 g_func, func_chunk_i);
3856 asmln = func_chunks[func_chunk_i].asmln;
3857 func_chunk_i++;
3858 }
3859 else {
3860 if (func_chunk_ret == 0)
3861 aerr("no return from chunk?\n");
3862 fseek(fasm, func_chunk_ret, SEEK_SET);
3863 asmln = func_chunk_ret_ln;
3864 func_chunk_ret = 0;
3865 pending_endp = 1;
3866 }
3867 }
3868 }
3869 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
3870 func_chunks_used = 1;
3871 p += 20;
3872 if (IS_START(g_func, "sub_")) {
3873 unsigned long addr = strtoul(p, NULL, 16);
3874 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
3875 if (addr > f_addr && !scanned_ahead) {
3876 anote("scan_ahead caused by '%s', addr %lx\n",
3877 g_func, addr);
3878 scan_ahead(fasm);
3879 scanned_ahead = 1;
3880 func_chunks_sorted = 0;
3881 }
3882 }
3883 }
3884 continue;
3885 } // *p == ';'
3886
3887parse_words:
3888 memset(words, 0, sizeof(words));
3889 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
3890 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
3891 if (*p == 0 || *p == ';') {
3892 wordc++;
3893 break;
3894 }
3895 }
3896
3897 // alow asm patches in comments
3898 if (*p == ';' && IS_START(p, "; sctpatch:")) {
3899 p = sskip(p + 11);
3900 if (*p == 0 || *p == ';')
3901 continue;
3902 goto parse_words; // lame
3903 }
3904
3905 if (wordc == 0) {
3906 // shouldn't happen
3907 awarn("wordc == 0?\n");
3908 continue;
3909 }
3910
3911 // don't care about this:
3912 if (words[0][0] == '.'
3913 || IS(words[0], "include")
3914 || IS(words[0], "assume") || IS(words[1], "segment")
3915 || IS(words[0], "align"))
3916 {
3917 continue;
3918 }
3919
3920do_pending_endp:
3921 // do delayed endp processing to collect switch jumptables
3922 if (pending_endp) {
3923 if (in_func && !skip_func && wordc >= 2
3924 && ((words[0][0] == 'd' && words[0][2] == 0)
3925 || (words[1][0] == 'd' && words[1][2] == 0)))
3926 {
3927 i = 1;
3928 if (words[1][0] == 'd' && words[1][2] == 0) {
3929 // label
3930 if (g_func_pd_cnt >= pd_alloc) {
3931 pd_alloc = pd_alloc * 2 + 16;
3932 g_func_pd = realloc(g_func_pd,
3933 sizeof(g_func_pd[0]) * pd_alloc);
3934 my_assert_not(g_func_pd, NULL);
3935 }
3936 pd = &g_func_pd[g_func_pd_cnt];
3937 g_func_pd_cnt++;
3938 memset(pd, 0, sizeof(*pd));
3939 strcpy(pd->label, words[0]);
3940 pd->type = OPT_CONST;
3941 pd->lmod = lmod_from_directive(words[1]);
3942 i = 2;
3943 }
3944 else {
3945 lmod = lmod_from_directive(words[0]);
3946 if (lmod != pd->lmod)
3947 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3948 }
3949
3950 if (pd->count_alloc < pd->count + wordc) {
3951 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3952 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3953 my_assert_not(pd->d, NULL);
3954 }
3955 for (; i < wordc; i++) {
3956 if (IS(words[i], "offset")) {
3957 pd->type = OPT_OFFSET;
3958 i++;
3959 }
3960 p = strchr(words[i], ',');
3961 if (p != NULL)
3962 *p = 0;
3963 if (pd->type == OPT_OFFSET)
3964 pd->d[pd->count].u.label = strdup(words[i]);
3965 else
3966 pd->d[pd->count].u.val = parse_number(words[i]);
3967 pd->d[pd->count].bt_i = -1;
3968 pd->count++;
3969 }
3970 continue;
3971 }
3972
3973 if (in_func && !skip_func)
3974 gen_func(fout, g_fhdr, g_func, pi);
3975
3976 pending_endp = 0;
3977 in_func = 0;
3978 g_ida_func_attr = 0;
3979 skip_warned = 0;
3980 skip_func = 0;
3981 g_func[0] = 0;
3982 func_chunks_used = 0;
3983 func_chunk_i = -1;
3984 if (pi != 0) {
3985 memset(&ops, 0, pi * sizeof(ops[0]));
3986 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3987 pi = 0;
3988 }
3989 g_eqcnt = 0;
3990 for (i = 0; i < g_func_pd_cnt; i++) {
3991 pd = &g_func_pd[i];
3992 if (pd->type == OPT_OFFSET) {
3993 for (j = 0; j < pd->count; j++)
3994 free(pd->d[j].u.label);
3995 }
3996 free(pd->d);
3997 pd->d = NULL;
3998 }
3999 g_func_pd_cnt = 0;
4000 pd = NULL;
4001 if (wordc == 0)
4002 continue;
4003 }
4004
4005 if (IS(words[1], "proc")) {
4006 if (in_func)
4007 aerr("proc '%s' while in_func '%s'?\n",
4008 words[0], g_func);
4009 p = words[0];
4010 if ((g_ida_func_attr & IDAFA_THUNK)
4011 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
4012 skip_func = 1;
4013 strcpy(g_func, words[0]);
4014 set_label(0, words[0]);
4015 in_func = 1;
4016 continue;
4017 }
4018
4019 if (IS(words[1], "endp"))
4020 {
4021 if (!in_func)
4022 aerr("endp '%s' while not in_func?\n", words[0]);
4023 if (!IS(g_func, words[0]))
4024 aerr("endp '%s' while in_func '%s'?\n",
4025 words[0], g_func);
4026
4027 if (!skip_func && func_chunks_used) {
4028 // start processing chunks
4029 struct chunk_item *ci, key = { g_func, 0 };
4030
4031 func_chunk_ret = ftell(fasm);
4032 func_chunk_ret_ln = asmln;
4033 if (!func_chunks_sorted) {
4034 qsort(func_chunks, func_chunk_cnt,
4035 sizeof(func_chunks[0]), cmp_chunks);
4036 func_chunks_sorted = 1;
4037 }
4038 ci = bsearch(&key, func_chunks, func_chunk_cnt,
4039 sizeof(func_chunks[0]), cmp_chunks);
4040 if (ci == NULL)
4041 aerr("'%s' needs chunks, but none found\n", g_func);
4042 func_chunk_i = ci - func_chunks;
4043 for (; func_chunk_i > 0; func_chunk_i--)
4044 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
4045 break;
4046
4047 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
4048 if (ret)
4049 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
4050 asmln = func_chunks[func_chunk_i].asmln;
4051 func_chunk_i++;
4052 continue;
4053 }
4054 pending_endp = 1;
4055 continue;
4056 }
4057
4058 p = strchr(words[0], ':');
4059 if (p != NULL) {
4060 set_label(pi, words[0]);
4061 continue;
4062 }
4063
4064 if (!in_func || skip_func) {
4065 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
4066 if (verbose)
4067 anote("skipping from '%s'\n", g_labels[pi]);
4068 skip_warned = 1;
4069 }
4070 g_labels[pi][0] = 0;
4071 continue;
4072 }
4073
4074 if (wordc > 1 && IS(words[1], "=")) {
4075 if (wordc != 5)
4076 aerr("unhandled equ, wc=%d\n", wordc);
4077 if (g_eqcnt >= eq_alloc) {
4078 eq_alloc *= 2;
4079 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
4080 my_assert_not(g_eqs, NULL);
4081 }
4082
4083 len = strlen(words[0]);
4084 if (len > sizeof(g_eqs[0].name) - 1)
4085 aerr("equ name too long: %d\n", len);
4086 strcpy(g_eqs[g_eqcnt].name, words[0]);
4087
4088 if (!IS(words[3], "ptr"))
4089 aerr("unhandled equ\n");
4090 if (IS(words[2], "dword"))
4091 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
4092 else if (IS(words[2], "word"))
4093 g_eqs[g_eqcnt].lmod = OPLM_WORD;
4094 else if (IS(words[2], "byte"))
4095 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
4096 else
4097 aerr("bad lmod: '%s'\n", words[2]);
4098
4099 g_eqs[g_eqcnt].offset = parse_number(words[4]);
4100 g_eqcnt++;
4101 continue;
4102 }
4103
4104 if (pi >= ARRAY_SIZE(ops))
4105 aerr("too many ops\n");
4106
4107 parse_op(&ops[pi], words, wordc);
4108 pi++;
4109 }
4110
4111 fclose(fout);
4112 fclose(fasm);
4113 fclose(g_fhdr);
4114
4115 return 0;
4116}
4117
4118// vim:ts=2:shiftwidth=2:expandtab
Unnamed repository; edit this file 'description' to name the repository.