notaz.gp2x.de / ia32rtools.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
translate: support more dereference types
[ia32rtools.git] / tools / translate.c
... / ...
CommitLineData
1/*
2 * ia32rtools
3 * (C) notaz, 2013-2015
4 *
5 * This work is licensed under the terms of 3-clause BSD license.
6 * See COPYING file in the top-level directory.
7 */
8
9#define _GNU_SOURCE
10#include <stdio.h>
11#include <stdlib.h>
12#include <string.h>
13
14#include "my_assert.h"
15#include "my_str.h"
16#include "common.h"
17
18#define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
19#define IS(w, y) !strcmp(w, y)
20#define IS_START(w, y) !strncmp(w, y, strlen(y))
21
22#include "protoparse.h"
23
24static const char *asmfn;
25static int asmln;
26static FILE *g_fhdr;
27
28#define anote(fmt, ...) \
29 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
30#define awarn(fmt, ...) \
31 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
32#define aerr(fmt, ...) do { \
33 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
34 fcloseall(); \
35 exit(1); \
36} while (0)
37
38#include "masm_tools.h"
39
40enum op_flags {
41 OPF_RMD = (1 << 0), /* removed from code generation */
42 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
43 OPF_FLAGS = (1 << 2), /* sets flags */
44 OPF_JMP = (1 << 3), /* branch, call */
45 OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz/loop) */
46 OPF_CC = (1 << 5), /* uses flags */
47 OPF_TAIL = (1 << 6), /* ret or tail call */
48 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
49 OPF_REP = (1 << 8), /* prefixed by rep */
50 OPF_REPZ = (1 << 9), /* rep is repe/repz */
51 OPF_REPNZ = (1 << 10), /* rep is repne/repnz */
52 OPF_FARG = (1 << 11), /* push collected as func arg */
53 OPF_FARGNR = (1 << 12), /* push collected as func arg (no reuse) */
54 OPF_EBP_S = (1 << 13), /* ebp used as scratch here, not BP */
55 OPF_DF = (1 << 14), /* DF flag set */
56 OPF_ATAIL = (1 << 15), /* tail call with reused arg frame */
57 OPF_32BIT = (1 << 16), /* 32bit division */
58 OPF_LOCK = (1 << 17), /* op has lock prefix */
59 OPF_VAPUSH = (1 << 18), /* vararg ptr push (as call arg) */
60 OPF_DONE = (1 << 19), /* already fully handled by analysis */
61 OPF_PPUSH = (1 << 20), /* part of complex push-pop graph */
62 OPF_NOREGS = (1 << 21), /* don't track regs of this op */
63 OPF_FPUSH = (1 << 22), /* pushes x87 stack */
64 OPF_FPOP = (1 << 23), /* pops x87 stack */
65 OPF_FSHIFT = (1 << 24), /* x87 stack shift is actually needed */
66};
67
68enum op_op {
69 OP_INVAL,
70 OP_NOP,
71 OP_PUSH,
72 OP_POP,
73 OP_PUSHA,
74 OP_POPA,
75 OP_LEAVE,
76 OP_MOV,
77 OP_LEA,
78 OP_MOVZX,
79 OP_MOVSX,
80 OP_XCHG,
81 OP_NOT,
82 OP_XLAT,
83 OP_CDQ,
84 OP_BSWAP,
85 OP_LODS,
86 OP_STOS,
87 OP_MOVS,
88 OP_CMPS,
89 OP_SCAS,
90 OP_STD,
91 OP_CLD,
92 OP_RET,
93 OP_ADD,
94 OP_SUB,
95 OP_AND,
96 OP_OR,
97 OP_XOR,
98 OP_SHL,
99 OP_SHR,
100 OP_SAR,
101 OP_SHLD,
102 OP_SHRD,
103 OP_ROL,
104 OP_ROR,
105 OP_RCL,
106 OP_RCR,
107 OP_ADC,
108 OP_SBB,
109 OP_BSF,
110 OP_INC,
111 OP_DEC,
112 OP_NEG,
113 OP_MUL,
114 OP_IMUL,
115 OP_DIV,
116 OP_IDIV,
117 OP_TEST,
118 OP_CMP,
119 OP_CALL,
120 OP_JMP,
121 OP_JECXZ,
122 OP_LOOP,
123 OP_JCC,
124 OP_SCC,
125 // x87
126 OP_FLD,
127 OP_FILD,
128 OP_FLDc,
129 OP_FST,
130 OP_FIST,
131 OP_FADD,
132 OP_FDIV,
133 OP_FMUL,
134 OP_FSUB,
135 OP_FDIVR,
136 OP_FSUBR,
137 OP_FIADD,
138 OP_FIDIV,
139 OP_FIMUL,
140 OP_FISUB,
141 OP_FIDIVR,
142 OP_FISUBR,
143 OP_FCOM,
144 OP_FNSTSW,
145 OP_FCHS,
146 OP_FCOS,
147 OP_FPATAN,
148 OP_FPTAN,
149 OP_FSIN,
150 OP_FSQRT,
151 OP_FXCH,
152 OP_FYL2X,
153 // mmx
154 OP_EMMS,
155 // pseudo-ops for lib calls
156 OPP_ALLSHL,
157 OPP_ALLSHR,
158 OPP_FTOL,
159 // undefined
160 OP_UD2,
161};
162
163enum opr_type {
164 OPT_UNSPEC,
165 OPT_REG,
166 OPT_REGMEM,
167 OPT_LABEL,
168 OPT_OFFSET,
169 OPT_CONST,
170};
171
172// must be sorted (larger len must be further in enum)
173enum opr_lenmod {
174 OPLM_UNSPEC,
175 OPLM_BYTE,
176 OPLM_WORD,
177 OPLM_DWORD,
178 OPLM_QWORD,
179};
180
181#define MAX_EXITS 128
182
183#define MAX_OPERANDS 3
184#define NAMELEN 112
185
186#define OPR_INIT(type_, lmod_, reg_) \
187 { type_, lmod_, reg_, }
188
189struct parsed_opr {
190 enum opr_type type;
191 enum opr_lenmod lmod;
192 int reg;
193 unsigned int is_ptr:1; // pointer in C
194 unsigned int is_array:1; // array in C
195 unsigned int type_from_var:1; // .. in header, sometimes wrong
196 unsigned int size_mismatch:1; // type override differs from C
197 unsigned int size_lt:1; // type override is larger than C
198 unsigned int had_ds:1; // had ds: prefix
199 const struct parsed_proto *pp; // for OPT_LABEL
200 unsigned int val;
201 char name[NAMELEN];
202};
203
204struct parsed_op {
205 enum op_op op;
206 struct parsed_opr operand[MAX_OPERANDS];
207 unsigned int flags;
208 unsigned char pfo;
209 unsigned char pfo_inv;
210 unsigned char operand_cnt;
211 unsigned char p_argnum; // arg push: altered before call arg #
212 unsigned char p_arggrp; // arg push: arg group # for above
213 unsigned char p_argpass;// arg push: arg of host func
214 short p_argnext;// arg push: same arg pushed elsewhere or -1
215 int regmask_src; // all referensed regs
216 int regmask_dst;
217 int pfomask; // flagop: parsed_flag_op that can't be delayed
218 int cc_scratch; // scratch storage during analysis
219 int bt_i; // branch target for branches
220 struct parsed_data *btj;// branch targets for jumptables
221 struct parsed_proto *pp;// parsed_proto for OP_CALL
222 void *datap;
223 int asmln;
224};
225
226// datap:
227// on start: function/data type hint (sctproto)
228// after analysis:
229// (OPF_CC) - points to one of (OPF_FLAGS) that affects cc op
230// OP_PUSH - points to OP_POP in complex push/pop graph
231// OP_POP - points to OP_PUSH in simple push/pop pair
232// OP_FCOM - needed_status_word_bits | (is_z_check << 16)
233
234struct parsed_equ {
235 char name[64];
236 enum opr_lenmod lmod;
237 int offset;
238};
239
240struct parsed_data {
241 char label[256];
242 enum opr_type type;
243 enum opr_lenmod lmod;
244 int count;
245 int count_alloc;
246 struct {
247 union {
248 char *label;
249 unsigned int val;
250 } u;
251 int bt_i;
252 } *d;
253};
254
255struct label_ref {
256 int i;
257 struct label_ref *next;
258};
259
260enum ida_func_attr {
261 IDAFA_BP_FRAME = (1 << 0),
262 IDAFA_LIB_FUNC = (1 << 1),
263 IDAFA_STATIC = (1 << 2),
264 IDAFA_NORETURN = (1 << 3),
265 IDAFA_THUNK = (1 << 4),
266 IDAFA_FPD = (1 << 5),
267};
268
269enum sct_func_attr {
270 SCTFA_CLEAR_SF = (1 << 0), // clear stack frame
271 SCTFA_CLEAR_REGS = (1 << 1), // clear registers (mask)
272};
273
274enum x87_const {
275 X87_CONST_1 = 1,
276 X87_CONST_2T,
277 X87_CONST_2E,
278 X87_CONST_PI,
279 X87_CONST_LG2,
280 X87_CONST_LN2,
281 X87_CONST_Z,
282};
283
284// note: limited to 32k due to p_argnext
285#define MAX_OPS 4096
286#define MAX_ARG_GRP 2
287
288static struct parsed_op ops[MAX_OPS];
289static struct parsed_equ *g_eqs;
290static int g_eqcnt;
291static char *g_labels[MAX_OPS];
292static struct label_ref g_label_refs[MAX_OPS];
293static const struct parsed_proto *g_func_pp;
294static struct parsed_data *g_func_pd;
295static int g_func_pd_cnt;
296static int g_func_lmods;
297static char g_func[256];
298static char g_comment[256];
299static int g_bp_frame;
300static int g_sp_frame;
301static int g_stack_frame_used;
302static int g_stack_fsz;
303static int g_ida_func_attr;
304static int g_sct_func_attr;
305static int g_stack_clear_start; // in dwords
306static int g_stack_clear_len;
307static int g_regmask_init;
308static int g_skip_func;
309static int g_allow_regfunc;
310static int g_quiet_pp;
311static int g_header_mode;
312
313#define ferr(op_, fmt, ...) do { \
314 printf("%s:%d: error %u: [%s] '%s': " fmt, asmfn, (op_)->asmln, \
315 __LINE__, g_func, dump_op(op_), ##__VA_ARGS__); \
316 fcloseall(); \
317 exit(1); \
318} while (0)
319#define fnote(op_, fmt, ...) \
320 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
321 dump_op(op_), ##__VA_ARGS__)
322
323#define ferr_assert(op_, cond) do { \
324 if (!(cond)) ferr(op_, "assertion '%s' failed\n", #cond); \
325} while (0)
326
327const char *regs_r32[] = {
328 "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp",
329 // not r32, but list here for easy parsing and printing
330 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7",
331 "st", "st(1)", "st(2)", "st(3)", "st(4)", "st(5)", "st(6)", "st(7)"
332};
333const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
334const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
335const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
336
337enum x86_regs {
338 xUNSPEC = -1,
339 xAX, xBX, xCX, xDX,
340 xSI, xDI, xBP, xSP,
341 xMM0, xMM1, xMM2, xMM3, // mmx
342 xMM4, xMM5, xMM6, xMM7,
343 xST0, xST1, xST2, xST3, // x87
344 xST4, xST5, xST6, xST7,
345};
346
347#define mxAX (1 << xAX)
348#define mxCX (1 << xCX)
349#define mxDX (1 << xDX)
350#define mxST0 (1 << xST0)
351#define mxST1 (1 << xST1)
352#define mxST1_0 (mxST1 | mxST0)
353#define mxST7_2 (0xfc << xST0)
354#define mxSTa (0xff << xST0)
355
356// possible basic comparison types (without inversion)
357enum parsed_flag_op {
358 PFO_O, // 0 OF=1
359 PFO_C, // 2 CF=1
360 PFO_Z, // 4 ZF=1
361 PFO_BE, // 6 CF=1||ZF=1
362 PFO_S, // 8 SF=1
363 PFO_P, // a PF=1
364 PFO_L, // c SF!=OF
365 PFO_LE, // e ZF=1||SF!=OF
366};
367
368#define PFOB_O (1 << PFO_O)
369#define PFOB_C (1 << PFO_C)
370#define PFOB_Z (1 << PFO_Z)
371#define PFOB_S (1 << PFO_S)
372
373static const char *parsed_flag_op_names[] = {
374 "o", "c", "z", "be", "s", "p", "l", "le"
375};
376
377static int char_array_i(const char *array[], size_t len, const char *s)
378{
379 int i;
380
381 for (i = 0; i < len; i++)
382 if (IS(s, array[i]))
383 return i;
384
385 return -1;
386}
387
388static void printf_number(char *buf, size_t buf_size,
389 unsigned long number)
390{
391 // output in C-friendly form
392 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
393}
394
395static int check_segment_prefix(const char *s)
396{
397 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
398 return 0;
399
400 switch (s[0]) {
401 case 'c': return 1;
402 case 'd': return 2;
403 case 's': return 3;
404 case 'e': return 4;
405 case 'f': return 5;
406 case 'g': return 6;
407 default: return 0;
408 }
409}
410
411static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
412{
413 int reg;
414
415 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
416 if (reg >= 8) {
417 *reg_lmod = OPLM_QWORD;
418 return reg;
419 }
420 if (reg >= 0) {
421 *reg_lmod = OPLM_DWORD;
422 return reg;
423 }
424 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
425 if (reg >= 0) {
426 *reg_lmod = OPLM_WORD;
427 return reg;
428 }
429 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
430 if (reg >= 0) {
431 *reg_lmod = OPLM_BYTE;
432 return reg;
433 }
434 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
435 if (reg >= 0) {
436 *reg_lmod = OPLM_BYTE;
437 return reg;
438 }
439
440 return -1;
441}
442
443static int parse_indmode(char *name, int *regmask, int need_c_cvt)
444{
445 enum opr_lenmod lmod;
446 char cvtbuf[256];
447 char *d = cvtbuf;
448 char *s = name;
449 char w[64];
450 long number;
451 int reg;
452 int c = 0;
453
454 *d = 0;
455
456 while (*s != 0) {
457 d += strlen(d);
458 while (my_isblank(*s))
459 s++;
460 for (; my_issep(*s); d++, s++)
461 *d = *s;
462 while (my_isblank(*s))
463 s++;
464 *d = 0;
465
466 // skip '?s:' prefixes
467 if (check_segment_prefix(s))
468 s += 3;
469
470 s = next_idt(w, sizeof(w), s);
471 if (w[0] == 0)
472 break;
473 c++;
474
475 reg = parse_reg(&lmod, w);
476 if (reg >= 0) {
477 *regmask |= 1 << reg;
478 goto pass;
479 }
480
481 if ('0' <= w[0] && w[0] <= '9') {
482 number = parse_number(w);
483 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
484 continue;
485 }
486
487 // probably some label/identifier - pass
488
489pass:
490 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
491 }
492
493 if (need_c_cvt)
494 strcpy(name, cvtbuf);
495
496 return c;
497}
498
499static int is_reg_in_str(const char *s)
500{
501 int i;
502
503 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
504 return 0;
505
506 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
507 if (!strncmp(s, regs_r32[i], 3))
508 return 1;
509
510 return 0;
511}
512
513static const char *parse_stack_el(const char *name, char *extra_reg,
514 int *base_val, int early_try)
515{
516 const char *p, *p2, *s;
517 char *endp = NULL;
518 char buf[32];
519 long val = -1;
520 int len;
521
522 if (g_bp_frame || early_try)
523 {
524 p = name;
525 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
526 p += 4;
527 if (extra_reg != NULL) {
528 strncpy(extra_reg, name, 3);
529 extra_reg[4] = 0;
530 }
531 }
532
533 if (IS_START(p, "ebp+")) {
534 p += 4;
535
536 p2 = strchr(p, '+');
537 if (p2 != NULL && is_reg_in_str(p)) {
538 if (extra_reg != NULL) {
539 strncpy(extra_reg, p, p2 - p);
540 extra_reg[p2 - p] = 0;
541 }
542 p = p2 + 1;
543 }
544
545 if (!('0' <= *p && *p <= '9'))
546 return p;
547
548 return NULL;
549 }
550 }
551
552 if (!IS_START(name, "esp+"))
553 return NULL;
554
555 s = name + 4;
556 p = strchr(s, '+');
557 if (p) {
558 if (is_reg_in_str(s)) {
559 if (extra_reg != NULL) {
560 strncpy(extra_reg, s, p - s);
561 extra_reg[p - s] = 0;
562 }
563 s = p + 1;
564 p = strchr(s, '+');
565 if (p == NULL)
566 aerr("%s IDA stackvar not set?\n", __func__);
567 }
568 if (!('0' <= *s && *s <= '9')) {
569 aerr("%s IDA stackvar offset not set?\n", __func__);
570 return NULL;
571 }
572 if (s[0] == '0' && s[1] == 'x')
573 s += 2;
574 len = p - s;
575 if (len < sizeof(buf) - 1) {
576 strncpy(buf, s, len);
577 buf[len] = 0;
578 val = strtol(buf, &endp, 16);
579 if (val == 0 || *endp != 0) {
580 aerr("%s num parse fail for '%s'\n", __func__, buf);
581 return NULL;
582 }
583 }
584 p++;
585 }
586 else
587 p = name + 4;
588
589 if ('0' <= *p && *p <= '9')
590 return NULL;
591
592 if (base_val != NULL)
593 *base_val = val;
594 return p;
595}
596
597static int guess_lmod_from_name(struct parsed_opr *opr)
598{
599 if (IS_START(opr->name, "dword_") || IS_START(opr->name, "off_")) {
600 opr->lmod = OPLM_DWORD;
601 return 1;
602 }
603 if (IS_START(opr->name, "word_")) {
604 opr->lmod = OPLM_WORD;
605 return 1;
606 }
607 if (IS_START(opr->name, "byte_")) {
608 opr->lmod = OPLM_BYTE;
609 return 1;
610 }
611 if (IS_START(opr->name, "qword_")) {
612 opr->lmod = OPLM_QWORD;
613 return 1;
614 }
615 return 0;
616}
617
618static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
619 const struct parsed_type *c_type)
620{
621 static const char *dword_types[] = {
622 "uint32_t", "int", "_DWORD", "UINT_PTR", "DWORD",
623 "WPARAM", "LPARAM", "UINT", "__int32",
624 "LONG", "HIMC", "BOOL", "size_t",
625 "float",
626 };
627 static const char *word_types[] = {
628 "uint16_t", "int16_t", "_WORD", "WORD",
629 "unsigned __int16", "__int16",
630 };
631 static const char *byte_types[] = {
632 "uint8_t", "int8_t", "char",
633 "unsigned __int8", "__int8", "BYTE", "_BYTE",
634 "CHAR", "_UNKNOWN",
635 // structures.. deal the same as with _UNKNOWN for now
636 "CRITICAL_SECTION",
637 };
638 const char *n;
639 int i;
640
641 if (c_type->is_ptr) {
642 *lmod = OPLM_DWORD;
643 return 1;
644 }
645
646 n = skip_type_mod(c_type->name);
647
648 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
649 if (IS(n, dword_types[i])) {
650 *lmod = OPLM_DWORD;
651 return 1;
652 }
653 }
654
655 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
656 if (IS(n, word_types[i])) {
657 *lmod = OPLM_WORD;
658 return 1;
659 }
660 }
661
662 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
663 if (IS(n, byte_types[i])) {
664 *lmod = OPLM_BYTE;
665 return 1;
666 }
667 }
668
669 return 0;
670}
671
672static char *default_cast_to(char *buf, size_t buf_size,
673 struct parsed_opr *opr)
674{
675 buf[0] = 0;
676
677 if (!opr->is_ptr || strchr(opr->name, '['))
678 return buf;
679 if (opr->pp == NULL || opr->pp->type.name == NULL
680 || opr->pp->is_fptr)
681 {
682 snprintf(buf, buf_size, "%s", "(void *)");
683 return buf;
684 }
685
686 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
687 return buf;
688}
689
690static enum opr_type lmod_from_directive(const char *d)
691{
692 if (IS(d, "dd"))
693 return OPLM_DWORD;
694 else if (IS(d, "dw"))
695 return OPLM_WORD;
696 else if (IS(d, "db"))
697 return OPLM_BYTE;
698
699 aerr("unhandled directive: '%s'\n", d);
700 return OPLM_UNSPEC;
701}
702
703static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
704 int *regmask)
705{
706 opr->type = OPT_REG;
707 opr->reg = reg;
708 opr->lmod = lmod;
709 *regmask |= 1 << reg;
710}
711
712static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
713 int *extra_offs);
714
715static int parse_operand(struct parsed_opr *opr,
716 int *regmask, int *regmask_indirect,
717 char words[16][256], int wordc, int w, unsigned int op_flags)
718{
719 const struct parsed_proto *pp = NULL;
720 enum opr_lenmod tmplmod;
721 unsigned long number;
722 char buf[256];
723 int ret, len;
724 int wordc_in;
725 char *p;
726 int i;
727
728 if (w >= wordc)
729 aerr("parse_operand w %d, wordc %d\n", w, wordc);
730
731 opr->reg = xUNSPEC;
732
733 for (i = w; i < wordc; i++) {
734 len = strlen(words[i]);
735 if (words[i][len - 1] == ',') {
736 words[i][len - 1] = 0;
737 wordc = i + 1;
738 break;
739 }
740 }
741
742 wordc_in = wordc - w;
743
744 if ((op_flags & OPF_JMP) && wordc_in > 0
745 && !('0' <= words[w][0] && words[w][0] <= '9'))
746 {
747 const char *label = NULL;
748
749 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
750 && IS(words[w + 1], "ptr"))
751 label = words[w + 2];
752 else if (wordc_in == 2 && IS(words[w], "short"))
753 label = words[w + 1];
754 else if (wordc_in == 1
755 && strchr(words[w], '[') == NULL
756 && parse_reg(&tmplmod, words[w]) < 0)
757 label = words[w];
758
759 if (label != NULL) {
760 opr->type = OPT_LABEL;
761 ret = check_segment_prefix(label);
762 if (ret != 0) {
763 if (ret >= 5)
764 aerr("fs/gs used\n");
765 opr->had_ds = 1;
766 label += 3;
767 }
768 strcpy(opr->name, label);
769 return wordc;
770 }
771 }
772
773 if (wordc_in >= 3) {
774 if (IS(words[w + 1], "ptr")) {
775 if (IS(words[w], "dword"))
776 opr->lmod = OPLM_DWORD;
777 else if (IS(words[w], "word"))
778 opr->lmod = OPLM_WORD;
779 else if (IS(words[w], "byte"))
780 opr->lmod = OPLM_BYTE;
781 else if (IS(words[w], "qword"))
782 opr->lmod = OPLM_QWORD;
783 else
784 aerr("type parsing failed\n");
785 w += 2;
786 wordc_in = wordc - w;
787 }
788 }
789
790 if (wordc_in == 2) {
791 if (IS(words[w], "offset")) {
792 opr->type = OPT_OFFSET;
793 opr->lmod = OPLM_DWORD;
794 strcpy(opr->name, words[w + 1]);
795 pp = proto_parse(g_fhdr, opr->name, 1);
796 goto do_label;
797 }
798 if (IS(words[w], "(offset")) {
799 p = strchr(words[w + 1], ')');
800 if (p == NULL)
801 aerr("parse of bracketed offset failed\n");
802 *p = 0;
803 opr->type = OPT_OFFSET;
804 strcpy(opr->name, words[w + 1]);
805 return wordc;
806 }
807 }
808
809 if (wordc_in != 1)
810 aerr("parse_operand 1 word expected\n");
811
812 ret = check_segment_prefix(words[w]);
813 if (ret != 0) {
814 if (ret >= 5)
815 aerr("fs/gs used\n");
816 opr->had_ds = 1;
817 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
818 }
819 strcpy(opr->name, words[w]);
820
821 if (words[w][0] == '[') {
822 opr->type = OPT_REGMEM;
823 ret = sscanf(words[w], "[%[^]]]", opr->name);
824 if (ret != 1)
825 aerr("[] parse failure\n");
826
827 parse_indmode(opr->name, regmask_indirect, 1);
828 if (opr->lmod == OPLM_UNSPEC
829 && parse_stack_el(opr->name, NULL, NULL, 1))
830 {
831 // might be an equ
832 struct parsed_equ *eq =
833 equ_find(NULL, parse_stack_el(opr->name, NULL, NULL, 1), &i);
834 if (eq)
835 opr->lmod = eq->lmod;
836
837 // might be unaligned access
838 g_func_lmods |= 1 << OPLM_BYTE;
839 }
840 return wordc;
841 }
842 else if (strchr(words[w], '[')) {
843 // label[reg] form
844 p = strchr(words[w], '[');
845 opr->type = OPT_REGMEM;
846 parse_indmode(p, regmask_indirect, 0);
847 strncpy(buf, words[w], p - words[w]);
848 buf[p - words[w]] = 0;
849 pp = proto_parse(g_fhdr, buf, 1);
850 goto do_label;
851 }
852 else if (('0' <= words[w][0] && words[w][0] <= '9')
853 || words[w][0] == '-')
854 {
855 number = parse_number(words[w]);
856 opr->type = OPT_CONST;
857 opr->val = number;
858 printf_number(opr->name, sizeof(opr->name), number);
859 return wordc;
860 }
861
862 ret = parse_reg(&tmplmod, opr->name);
863 if (ret >= 0) {
864 setup_reg_opr(opr, ret, tmplmod, regmask);
865 return wordc;
866 }
867
868 // most likely var in data segment
869 opr->type = OPT_LABEL;
870 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
871
872do_label:
873 if (pp != NULL) {
874 if (pp->is_fptr || pp->is_func) {
875 opr->lmod = OPLM_DWORD;
876 opr->is_ptr = 1;
877 }
878 else {
879 tmplmod = OPLM_UNSPEC;
880 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
881 anote("unhandled C type '%s' for '%s'\n",
882 pp->type.name, opr->name);
883
884 if (opr->lmod == OPLM_UNSPEC) {
885 opr->lmod = tmplmod;
886 opr->type_from_var = 1;
887 }
888 else if (opr->lmod != tmplmod) {
889 opr->size_mismatch = 1;
890 if (tmplmod < opr->lmod)
891 opr->size_lt = 1;
892 }
893 opr->is_ptr = pp->type.is_ptr;
894 }
895 opr->is_array = pp->type.is_array;
896 }
897 opr->pp = pp;
898
899 if (opr->lmod == OPLM_UNSPEC)
900 guess_lmod_from_name(opr);
901 return wordc;
902}
903
904static const struct {
905 const char *name;
906 unsigned int flags;
907} pref_table[] = {
908 { "rep", OPF_REP },
909 { "repe", OPF_REP|OPF_REPZ },
910 { "repz", OPF_REP|OPF_REPZ },
911 { "repne", OPF_REP|OPF_REPNZ },
912 { "repnz", OPF_REP|OPF_REPNZ },
913 { "lock", OPF_LOCK }, // ignored for now..
914};
915
916#define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
917
918static const struct {
919 const char *name;
920 enum op_op op;
921 unsigned short minopr;
922 unsigned short maxopr;
923 unsigned int flags;
924 unsigned char pfo;
925 unsigned char pfo_inv;
926} op_table[] = {
927 { "nop", OP_NOP, 0, 0, 0 },
928 { "push", OP_PUSH, 1, 1, 0 },
929 { "pop", OP_POP, 1, 1, OPF_DATA },
930 { "pusha",OP_PUSHA, 0, 0, 0 },
931 { "popa", OP_POPA, 0, 0, OPF_DATA },
932 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
933 { "mov" , OP_MOV, 2, 2, OPF_DATA },
934 { "lea", OP_LEA, 2, 2, OPF_DATA },
935 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
936 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
937 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
938 { "not", OP_NOT, 1, 1, OPF_DATA },
939 { "xlat", OP_XLAT, 0, 0, OPF_DATA },
940 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
941 { "bswap",OP_BSWAP, 1, 1, OPF_DATA },
942 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
943 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
944 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
945 { "stosb",OP_STOS, 0, 0, OPF_DATA },
946 { "stosw",OP_STOS, 0, 0, OPF_DATA },
947 { "stosd",OP_STOS, 0, 0, OPF_DATA },
948 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
949 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
950 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
951 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
952 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
953 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
954 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
955 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
956 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
957 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
958 { "cld", OP_CLD, 0, 0, OPF_DATA },
959 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
960 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
961 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
962 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
963 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
964 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
965 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
966 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
967 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
968 { "shld", OP_SHLD, 3, 3, OPF_DATA|OPF_FLAGS },
969 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
970 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
971 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
972 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
973 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
974 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
975 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
976 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
977 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
978 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
979 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
980 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
981 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
982 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
983 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
984 { "test", OP_TEST, 2, 2, OPF_FLAGS },
985 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
986 { "retn", OP_RET, 0, 1, OPF_TAIL },
987 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
988 { "jmp", OP_JMP, 1, 1, OPF_JMP },
989 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
990 { "loop", OP_LOOP, 1, 1, OPF_JMP|OPF_CJMP|OPF_DATA },
991 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
992 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
993 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
994 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
995 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
996 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
997 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
998 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
999 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
1000 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
1001 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
1002 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
1003 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
1004 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
1005 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
1006 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
1007 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
1008 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
1009 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
1010 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
1011 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
1012 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
1013 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
1014 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
1015 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
1016 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
1017 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
1018 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
1019 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
1020 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
1021 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
1022 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
1023 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
1024 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
1025 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
1026 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
1027 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
1028 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
1029 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
1030 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
1031 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
1032 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
1033 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
1034 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
1035 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
1036 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
1037 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
1038 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
1039 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
1040 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
1041 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
1042 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
1043 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
1044 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
1045 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
1046 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
1047 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
1048 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
1049 // x87
1050 { "fld", OP_FLD, 1, 1, OPF_FPUSH },
1051 { "fild", OP_FILD, 1, 1, OPF_FPUSH },
1052 { "fld1", OP_FLDc, 0, 0, OPF_FPUSH },
1053 { "fldln2", OP_FLDc, 0, 0, OPF_FPUSH },
1054 { "fldz", OP_FLDc, 0, 0, OPF_FPUSH },
1055 { "fst", OP_FST, 1, 1, 0 },
1056 { "fstp", OP_FST, 1, 1, OPF_FPOP },
1057 { "fist", OP_FIST, 1, 1, 0 },
1058 { "fistp", OP_FIST, 1, 1, OPF_FPOP },
1059 { "fadd", OP_FADD, 0, 2, 0 },
1060 { "faddp", OP_FADD, 0, 2, OPF_FPOP },
1061 { "fdiv", OP_FDIV, 0, 2, 0 },
1062 { "fdivp", OP_FDIV, 0, 2, OPF_FPOP },
1063 { "fmul", OP_FMUL, 0, 2, 0 },
1064 { "fmulp", OP_FMUL, 0, 2, OPF_FPOP },
1065 { "fsub", OP_FSUB, 0, 2, 0 },
1066 { "fsubp", OP_FSUB, 0, 2, OPF_FPOP },
1067 { "fdivr", OP_FDIVR, 0, 2, 0 },
1068 { "fdivrp", OP_FDIVR, 0, 2, OPF_FPOP },
1069 { "fsubr", OP_FSUBR, 0, 2, 0 },
1070 { "fsubrp", OP_FSUBR, 0, 2, OPF_FPOP },
1071 { "fiadd", OP_FIADD, 1, 1, 0 },
1072 { "fidiv", OP_FIDIV, 1, 1, 0 },
1073 { "fimul", OP_FIMUL, 1, 1, 0 },
1074 { "fisub", OP_FISUB, 1, 1, 0 },
1075 { "fidivr", OP_FIDIVR, 1, 1, 0 },
1076 { "fisubr", OP_FISUBR, 1, 1, 0 },
1077 { "fcom", OP_FCOM, 0, 1, 0 },
1078 { "fcomp", OP_FCOM, 0, 1, OPF_FPOP },
1079 { "fnstsw", OP_FNSTSW, 1, 1, OPF_DATA },
1080 { "fchs", OP_FCHS, 0, 0, 0 },
1081 { "fcos", OP_FCOS, 0, 0, 0 },
1082 { "fpatan", OP_FPATAN, 0, 0, OPF_FPOP },
1083 { "fptan", OP_FPTAN, 0, 0, OPF_FPUSH },
1084 { "fsin", OP_FSIN, 0, 0, 0 },
1085 { "fsqrt", OP_FSQRT, 0, 0, 0 },
1086 { "fxch", OP_FXCH, 1, 1, 0 },
1087 { "fyl2x", OP_FYL2X, 0, 0, OPF_FPOP },
1088 // mmx
1089 { "emms", OP_EMMS, 0, 0, OPF_DATA },
1090 { "movq", OP_MOV, 2, 2, OPF_DATA },
1091 // pseudo-ops for lib calls
1092 { "_allshl",OPP_ALLSHL },
1093 { "_allshr",OPP_ALLSHR },
1094 { "_ftol", OPP_FTOL },
1095 // must be last
1096 { "ud2", OP_UD2 },
1097};
1098
1099static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
1100{
1101 enum opr_lenmod lmod = OPLM_UNSPEC;
1102 int prefix_flags = 0;
1103 int regmask_ind;
1104 int regmask;
1105 int op_w = 0;
1106 int opr = 0;
1107 int w = 0;
1108 int i, j;
1109
1110 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
1111 if (IS(words[w], pref_table[i].name)) {
1112 prefix_flags = pref_table[i].flags;
1113 break;
1114 }
1115 }
1116
1117 if (prefix_flags) {
1118 if (wordc <= 1)
1119 aerr("lone prefix: '%s'\n", words[0]);
1120 w++;
1121 }
1122
1123 op_w = w;
1124 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
1125 if (IS(words[w], op_table[i].name))
1126 break;
1127 }
1128
1129 if (i == ARRAY_SIZE(op_table)) {
1130 if (!g_skip_func)
1131 aerr("unhandled op: '%s'\n", words[0]);
1132 i--; // OP_UD2
1133 }
1134 w++;
1135
1136 op->op = op_table[i].op;
1137 op->flags = op_table[i].flags | prefix_flags;
1138 op->pfo = op_table[i].pfo;
1139 op->pfo_inv = op_table[i].pfo_inv;
1140 op->regmask_src = op->regmask_dst = 0;
1141 op->asmln = asmln;
1142
1143 if (op->op == OP_UD2)
1144 return;
1145
1146 for (opr = 0; opr < op_table[i].maxopr; opr++) {
1147 if (opr >= op_table[i].minopr && w >= wordc)
1148 break;
1149
1150 regmask = regmask_ind = 0;
1151 w = parse_operand(&op->operand[opr], &regmask, &regmask_ind,
1152 words, wordc, w, op->flags);
1153
1154 if (opr == 0 && (op->flags & OPF_DATA))
1155 op->regmask_dst = regmask;
1156 else
1157 op->regmask_src |= regmask;
1158 op->regmask_src |= regmask_ind;
1159
1160 if (op->operand[opr].lmod != OPLM_UNSPEC)
1161 g_func_lmods |= 1 << op->operand[opr].lmod;
1162 }
1163
1164 if (w < wordc)
1165 aerr("parse_op %s incomplete: %d/%d\n",
1166 words[0], w, wordc);
1167
1168 // special cases
1169 op->operand_cnt = opr;
1170 if (!strncmp(op_table[i].name, "set", 3))
1171 op->operand[0].lmod = OPLM_BYTE;
1172
1173 switch (op->op) {
1174 // first operand is not dst
1175 case OP_CMP:
1176 case OP_TEST:
1177 op->regmask_src |= op->regmask_dst;
1178 op->regmask_dst = 0;
1179 break;
1180
1181 // first operand is src too
1182 case OP_NOT:
1183 case OP_ADD:
1184 case OP_AND:
1185 case OP_OR:
1186 case OP_RCL:
1187 case OP_RCR:
1188 case OP_ADC:
1189 case OP_INC:
1190 case OP_DEC:
1191 case OP_NEG:
1192 case OP_BSWAP:
1193 // more below..
1194 op->regmask_src |= op->regmask_dst;
1195 break;
1196
1197 // special
1198 case OP_XCHG:
1199 op->regmask_src |= op->regmask_dst;
1200 op->regmask_dst |= op->regmask_src;
1201 goto check_align;
1202
1203 case OP_SUB:
1204 case OP_SBB:
1205 case OP_XOR:
1206 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1207 && op->operand[0].lmod == op->operand[1].lmod
1208 && op->operand[0].reg == op->operand[1].reg
1209 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1210 {
1211 op->regmask_src = 0;
1212 }
1213 else
1214 op->regmask_src |= op->regmask_dst;
1215 break;
1216
1217 // ops with implicit argumets
1218 case OP_XLAT:
1219 op->operand_cnt = 2;
1220 setup_reg_opr(&op->operand[0], xAX, OPLM_BYTE, &op->regmask_src);
1221 op->regmask_dst = op->regmask_src;
1222 setup_reg_opr(&op->operand[1], xBX, OPLM_DWORD, &op->regmask_src);
1223 break;
1224
1225 case OP_CDQ:
1226 op->operand_cnt = 2;
1227 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
1228 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
1229 break;
1230
1231 case OP_LODS:
1232 case OP_STOS:
1233 case OP_SCAS:
1234 if (words[op_w][4] == 'b')
1235 lmod = OPLM_BYTE;
1236 else if (words[op_w][4] == 'w')
1237 lmod = OPLM_WORD;
1238 else if (words[op_w][4] == 'd')
1239 lmod = OPLM_DWORD;
1240 j = 0;
1241 op->regmask_src = 0;
1242 setup_reg_opr(&op->operand[j++], op->op == OP_LODS ? xSI : xDI,
1243 OPLM_DWORD, &op->regmask_src);
1244 op->regmask_dst = op->regmask_src;
1245 setup_reg_opr(&op->operand[j++], xAX, lmod,
1246 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1247 if (op->flags & OPF_REP) {
1248 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1249 op->regmask_dst |= 1 << xCX;
1250 }
1251 op->operand_cnt = j;
1252 break;
1253
1254 case OP_MOVS:
1255 case OP_CMPS:
1256 if (words[op_w][4] == 'b')
1257 lmod = OPLM_BYTE;
1258 else if (words[op_w][4] == 'w')
1259 lmod = OPLM_WORD;
1260 else if (words[op_w][4] == 'd')
1261 lmod = OPLM_DWORD;
1262 j = 0;
1263 op->regmask_src = 0;
1264 // note: lmod is not correct, don't have where to place it
1265 setup_reg_opr(&op->operand[j++], xDI, lmod, &op->regmask_src);
1266 setup_reg_opr(&op->operand[j++], xSI, OPLM_DWORD, &op->regmask_src);
1267 if (op->flags & OPF_REP)
1268 setup_reg_opr(&op->operand[j++], xCX, OPLM_DWORD, &op->regmask_src);
1269 op->operand_cnt = j;
1270 op->regmask_dst = op->regmask_src;
1271 break;
1272
1273 case OP_LOOP:
1274 op->regmask_dst = 1 << xCX;
1275 // fallthrough
1276 case OP_JECXZ:
1277 op->operand_cnt = 2;
1278 op->regmask_src = 1 << xCX;
1279 op->operand[1].type = OPT_REG;
1280 op->operand[1].reg = xCX;
1281 op->operand[1].lmod = OPLM_DWORD;
1282 break;
1283
1284 case OP_IMUL:
1285 if (op->operand_cnt == 2) {
1286 if (op->operand[0].type != OPT_REG)
1287 aerr("reg expected\n");
1288 op->regmask_src |= 1 << op->operand[0].reg;
1289 }
1290 if (op->operand_cnt != 1)
1291 break;
1292 // fallthrough
1293 case OP_MUL:
1294 // singleop mul
1295 op->regmask_src |= op->regmask_dst;
1296 op->regmask_dst = (1 << xDX) | (1 << xAX);
1297 if (op->operand[0].lmod == OPLM_UNSPEC)
1298 op->operand[0].lmod = OPLM_DWORD;
1299 break;
1300
1301 case OP_DIV:
1302 case OP_IDIV:
1303 // we could set up operands for edx:eax, but there is no real need to
1304 // (see is_opr_modified())
1305 op->regmask_src |= op->regmask_dst;
1306 op->regmask_dst = (1 << xDX) | (1 << xAX);
1307 if (op->operand[0].lmod == OPLM_UNSPEC)
1308 op->operand[0].lmod = OPLM_DWORD;
1309 break;
1310
1311 case OP_SHL:
1312 case OP_SHR:
1313 case OP_SAR:
1314 case OP_ROL:
1315 case OP_ROR:
1316 op->regmask_src |= op->regmask_dst;
1317 if (op->operand[1].lmod == OPLM_UNSPEC)
1318 op->operand[1].lmod = OPLM_BYTE;
1319 break;
1320
1321 case OP_SHLD:
1322 case OP_SHRD:
1323 op->regmask_src |= op->regmask_dst;
1324 if (op->operand[2].lmod == OPLM_UNSPEC)
1325 op->operand[2].lmod = OPLM_BYTE;
1326 break;
1327
1328 case OP_PUSH:
1329 op->regmask_src |= op->regmask_dst;
1330 op->regmask_dst = 0;
1331 if (op->operand[0].lmod == OPLM_UNSPEC
1332 && (op->operand[0].type == OPT_CONST
1333 || op->operand[0].type == OPT_OFFSET
1334 || op->operand[0].type == OPT_LABEL))
1335 op->operand[0].lmod = OPLM_DWORD;
1336 break;
1337
1338 // alignment
1339 case OP_MOV:
1340 check_align:
1341 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1342 && op->operand[0].lmod == op->operand[1].lmod
1343 && op->operand[0].reg == op->operand[1].reg
1344 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1345 {
1346 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1347 op->regmask_src = op->regmask_dst = 0;
1348 }
1349 break;
1350
1351 case OP_LEA:
1352 if (op->operand[0].type == OPT_REG
1353 && op->operand[1].type == OPT_REGMEM)
1354 {
1355 char buf[16];
1356 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1357 if (IS(buf, op->operand[1].name))
1358 op->flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
1359 }
1360 break;
1361
1362 case OP_CALL:
1363 // trashed regs must be explicitly detected later
1364 op->regmask_dst = 0;
1365 break;
1366
1367 case OP_LEAVE:
1368 op->regmask_dst = (1 << xBP) | (1 << xSP);
1369 op->regmask_src = 1 << xBP;
1370 break;
1371
1372 case OP_FLD:
1373 case OP_FILD:
1374 op->regmask_dst |= mxST0;
1375 break;
1376
1377 case OP_FLDc:
1378 op->regmask_dst |= mxST0;
1379 if (IS(words[op_w] + 3, "1"))
1380 op->operand[0].val = X87_CONST_1;
1381 else if (IS(words[op_w] + 3, "ln2"))
1382 op->operand[0].val = X87_CONST_LN2;
1383 else if (IS(words[op_w] + 3, "z"))
1384 op->operand[0].val = X87_CONST_Z;
1385 else
1386 aerr("TODO\n");
1387 break;
1388
1389 case OP_FST:
1390 case OP_FIST:
1391 op->regmask_src |= mxST0;
1392 break;
1393
1394 case OP_FADD:
1395 case OP_FDIV:
1396 case OP_FMUL:
1397 case OP_FSUB:
1398 case OP_FDIVR:
1399 case OP_FSUBR:
1400 op->regmask_src |= mxST0;
1401 if (op->operand_cnt == 2)
1402 op->regmask_src |= op->regmask_dst;
1403 else if (op->operand_cnt == 1) {
1404 memcpy(&op->operand[1], &op->operand[0], sizeof(op->operand[1]));
1405 op->operand[0].type = OPT_REG;
1406 op->operand[0].lmod = OPLM_QWORD;
1407 op->operand[0].reg = xST0;
1408 op->regmask_dst |= mxST0;
1409 }
1410 else
1411 // IDA doesn't use this
1412 aerr("no operands?\n");
1413 break;
1414
1415 case OP_FIADD:
1416 case OP_FIDIV:
1417 case OP_FIMUL:
1418 case OP_FISUB:
1419 case OP_FIDIVR:
1420 case OP_FISUBR:
1421 case OP_FCHS:
1422 case OP_FCOS:
1423 case OP_FSIN:
1424 case OP_FSQRT:
1425 case OP_FXCH:
1426 op->regmask_src |= mxST0;
1427 op->regmask_dst |= mxST0;
1428 break;
1429
1430 case OP_FPATAN:
1431 case OP_FYL2X:
1432 op->regmask_src |= mxST0 | mxST1;
1433 op->regmask_dst |= mxST0;
1434 break;
1435
1436 case OP_FPTAN:
1437 aerr("TODO\n");
1438 break;
1439
1440 case OP_FCOM:
1441 op->regmask_src |= mxST0;
1442 break;
1443
1444 default:
1445 break;
1446 }
1447
1448 if (op->operand[0].type == OPT_REG
1449 && op->operand[1].type == OPT_CONST)
1450 {
1451 struct parsed_opr *op1 = &op->operand[1];
1452 if ((op->op == OP_AND && op1->val == 0)
1453 || (op->op == OP_OR
1454 && (op1->val == ~0
1455 || (op->operand[0].lmod == OPLM_WORD && op1->val == 0xffff)
1456 || (op->operand[0].lmod == OPLM_BYTE && op1->val == 0xff))))
1457 {
1458 op->regmask_src = 0;
1459 }
1460 }
1461}
1462
1463static const char *op_name(struct parsed_op *po)
1464{
1465 static char buf[16];
1466 char *p;
1467 int i;
1468
1469 if (po->op == OP_JCC || po->op == OP_SCC) {
1470 p = buf;
1471 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1472 if (po->pfo_inv)
1473 *p++ = 'n';
1474 strcpy(p, parsed_flag_op_names[po->pfo]);
1475 return buf;
1476 }
1477
1478 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1479 if (op_table[i].op == po->op)
1480 return op_table[i].name;
1481
1482 return "???";
1483}
1484
1485// debug
1486static const char *dump_op(struct parsed_op *po)
1487{
1488 static char out[128];
1489 char *p = out;
1490 int i;
1491
1492 if (po == NULL)
1493 return "???";
1494
1495 snprintf(out, sizeof(out), "%s", op_name(po));
1496 for (i = 0; i < po->operand_cnt; i++) {
1497 p += strlen(p);
1498 if (i > 0)
1499 *p++ = ',';
1500 snprintf(p, sizeof(out) - (p - out),
1501 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1502 po->operand[i].name);
1503 }
1504
1505 return out;
1506}
1507
1508static const char *lmod_type_u(struct parsed_op *po,
1509 enum opr_lenmod lmod)
1510{
1511 switch (lmod) {
1512 case OPLM_QWORD:
1513 return "u64";
1514 case OPLM_DWORD:
1515 return "u32";
1516 case OPLM_WORD:
1517 return "u16";
1518 case OPLM_BYTE:
1519 return "u8";
1520 default:
1521 ferr(po, "invalid lmod: %d\n", lmod);
1522 return "(_invalid_)";
1523 }
1524}
1525
1526static const char *lmod_cast_u(struct parsed_op *po,
1527 enum opr_lenmod lmod)
1528{
1529 switch (lmod) {
1530 case OPLM_QWORD:
1531 return "";
1532 case OPLM_DWORD:
1533 return "";
1534 case OPLM_WORD:
1535 return "(u16)";
1536 case OPLM_BYTE:
1537 return "(u8)";
1538 default:
1539 ferr(po, "invalid lmod: %d\n", lmod);
1540 return "(_invalid_)";
1541 }
1542}
1543
1544static const char *lmod_cast_u_ptr(struct parsed_op *po,
1545 enum opr_lenmod lmod)
1546{
1547 switch (lmod) {
1548 case OPLM_QWORD:
1549 return "*(u64 *)";
1550 case OPLM_DWORD:
1551 return "*(u32 *)";
1552 case OPLM_WORD:
1553 return "*(u16 *)";
1554 case OPLM_BYTE:
1555 return "*(u8 *)";
1556 default:
1557 ferr(po, "invalid lmod: %d\n", lmod);
1558 return "(_invalid_)";
1559 }
1560}
1561
1562static const char *lmod_cast_s(struct parsed_op *po,
1563 enum opr_lenmod lmod)
1564{
1565 switch (lmod) {
1566 case OPLM_QWORD:
1567 return "(s64)";
1568 case OPLM_DWORD:
1569 return "(s32)";
1570 case OPLM_WORD:
1571 return "(s16)";
1572 case OPLM_BYTE:
1573 return "(s8)";
1574 default:
1575 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1576 return "(_invalid_)";
1577 }
1578}
1579
1580static const char *lmod_cast(struct parsed_op *po,
1581 enum opr_lenmod lmod, int is_signed)
1582{
1583 return is_signed ?
1584 lmod_cast_s(po, lmod) :
1585 lmod_cast_u(po, lmod);
1586}
1587
1588static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1589{
1590 switch (lmod) {
1591 case OPLM_QWORD:
1592 return 8;
1593 case OPLM_DWORD:
1594 return 4;
1595 case OPLM_WORD:
1596 return 2;
1597 case OPLM_BYTE:
1598 return 1;
1599 default:
1600 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1601 return 0;
1602 }
1603}
1604
1605static const char *opr_name(struct parsed_op *po, int opr_num)
1606{
1607 if (opr_num >= po->operand_cnt)
1608 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1609 return po->operand[opr_num].name;
1610}
1611
1612static unsigned int opr_const(struct parsed_op *po, int opr_num)
1613{
1614 if (opr_num >= po->operand_cnt)
1615 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1616 if (po->operand[opr_num].type != OPT_CONST)
1617 ferr(po, "opr %d: const expected\n", opr_num);
1618 return po->operand[opr_num].val;
1619}
1620
1621static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1622{
1623 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1624 ferr(po, "invalid reg: %d\n", popr->reg);
1625 return regs_r32[popr->reg];
1626}
1627
1628static int check_simple_cast(const char *cast, int *bits, int *is_signed)
1629{
1630 if (IS_START(cast, "(s8)") || IS_START(cast, "(u8)"))
1631 *bits = 8;
1632 else if (IS_START(cast, "(s16)") || IS_START(cast, "(u16)"))
1633 *bits = 16;
1634 else if (IS_START(cast, "(s32)") || IS_START(cast, "(u32)"))
1635 *bits = 32;
1636 else if (IS_START(cast, "(s64)") || IS_START(cast, "(u64)"))
1637 *bits = 64;
1638 else
1639 return -1;
1640
1641 *is_signed = cast[1] == 's' ? 1 : 0;
1642 return 0;
1643}
1644
1645static int check_deref_cast(const char *cast, int *bits)
1646{
1647 if (IS_START(cast, "*(u8 *)"))
1648 *bits = 8;
1649 else if (IS_START(cast, "*(u16 *)"))
1650 *bits = 16;
1651 else if (IS_START(cast, "*(u32 *)"))
1652 *bits = 32;
1653 else if (IS_START(cast, "*(u64 *)"))
1654 *bits = 64;
1655 else
1656 return -1;
1657
1658 return 0;
1659}
1660
1661// cast1 is the "final" cast
1662static const char *simplify_cast(const char *cast1, const char *cast2)
1663{
1664 static char buf[256];
1665 int bits1, bits2;
1666 int s1, s2;
1667
1668 if (cast1[0] == 0)
1669 return cast2;
1670 if (cast2[0] == 0)
1671 return cast1;
1672 if (IS(cast1, cast2))
1673 return cast1;
1674
1675 if (check_simple_cast(cast1, &bits1, &s1) == 0
1676 && check_simple_cast(cast2, &bits2, &s2) == 0)
1677 {
1678 if (bits1 <= bits2)
1679 return cast1;
1680 }
1681 if (check_simple_cast(cast1, &bits1, &s1) == 0
1682 && check_deref_cast(cast2, &bits2) == 0)
1683 {
1684 if (bits1 == bits2) {
1685 snprintf(buf, sizeof(buf), "*(%c%d *)", s1 ? 's' : 'u', bits1);
1686 return buf;
1687 }
1688 }
1689
1690 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1691 return cast1;
1692
1693 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1694 return buf;
1695}
1696
1697static const char *simplify_cast_num(const char *cast, unsigned int val)
1698{
1699 if (IS(cast, "(u8)") && val < 0x100)
1700 return "";
1701 if (IS(cast, "(s8)") && val < 0x80)
1702 return "";
1703 if (IS(cast, "(u16)") && val < 0x10000)
1704 return "";
1705 if (IS(cast, "(s16)") && val < 0x8000)
1706 return "";
1707 if (IS(cast, "(s32)") && val < 0x80000000)
1708 return "";
1709
1710 return cast;
1711}
1712
1713static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1714 int *extra_offs)
1715{
1716 const char *p;
1717 char *endp;
1718 int namelen;
1719 int i;
1720
1721 *extra_offs = 0;
1722 namelen = strlen(name);
1723
1724 p = strchr(name, '+');
1725 if (p != NULL) {
1726 namelen = p - name;
1727 if (namelen <= 0)
1728 ferr(po, "equ parse failed for '%s'\n", name);
1729
1730 if (IS_START(p, "0x"))
1731 p += 2;
1732 *extra_offs = strtol(p, &endp, 16);
1733 if (*endp != 0)
1734 ferr(po, "equ parse failed for '%s'\n", name);
1735 }
1736
1737 for (i = 0; i < g_eqcnt; i++)
1738 if (strncmp(g_eqs[i].name, name, namelen) == 0
1739 && g_eqs[i].name[namelen] == 0)
1740 break;
1741 if (i >= g_eqcnt) {
1742 if (po != NULL)
1743 ferr(po, "unresolved equ name: '%s'\n", name);
1744 return NULL;
1745 }
1746
1747 return &g_eqs[i];
1748}
1749
1750static int is_stack_access(struct parsed_op *po,
1751 const struct parsed_opr *popr)
1752{
1753 return (parse_stack_el(popr->name, NULL, NULL, 0)
1754 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1755 && IS_START(popr->name, "ebp")));
1756}
1757
1758static void parse_stack_access(struct parsed_op *po,
1759 const char *name, char *ofs_reg, int *offset_out,
1760 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1761{
1762 const char *bp_arg = "";
1763 const char *p = NULL;
1764 struct parsed_equ *eq;
1765 char *endp = NULL;
1766 int stack_ra = 0;
1767 int offset = 0;
1768
1769 ofs_reg[0] = 0;
1770
1771 if (IS_START(name, "ebp-")
1772 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1773 {
1774 p = name + 4;
1775 if (IS_START(p, "0x"))
1776 p += 2;
1777 offset = strtoul(p, &endp, 16);
1778 if (name[3] == '-')
1779 offset = -offset;
1780 if (*endp != 0)
1781 ferr(po, "ebp- parse of '%s' failed\n", name);
1782 }
1783 else {
1784 bp_arg = parse_stack_el(name, ofs_reg, NULL, 0);
1785 eq = equ_find(po, bp_arg, &offset);
1786 if (eq == NULL)
1787 ferr(po, "detected but missing eq\n");
1788 offset += eq->offset;
1789 }
1790
1791 if (!strncmp(name, "ebp", 3))
1792 stack_ra = 4;
1793
1794 // yes it sometimes LEAs ra for compares..
1795 if (!is_lea && ofs_reg[0] == 0
1796 && stack_ra <= offset && offset < stack_ra + 4)
1797 {
1798 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1799 }
1800
1801 *offset_out = offset;
1802 if (stack_ra_out)
1803 *stack_ra_out = stack_ra;
1804 if (bp_arg_out)
1805 *bp_arg_out = bp_arg;
1806}
1807
1808static int parse_stack_esp_offset(struct parsed_op *po,
1809 const char *name, int *offset_out)
1810{
1811 char ofs_reg[16] = { 0, };
1812 struct parsed_equ *eq;
1813 const char *bp_arg;
1814 char *endp = NULL;
1815 int base_val = 0;
1816 int offset = 0;
1817
1818 if (strstr(name, "esp") == NULL)
1819 return -1;
1820 bp_arg = parse_stack_el(name, ofs_reg, &base_val, 0);
1821 if (bp_arg == NULL) {
1822 // just plain offset?
1823 if (!IS_START(name, "esp+"))
1824 return -1;
1825 offset = strtol(name + 4, &endp, 0);
1826 if (endp == NULL || *endp != 0)
1827 return -1;
1828 *offset_out = offset;
1829 return 0;
1830 }
1831
1832 if (ofs_reg[0] != 0)
1833 return -1;
1834 eq = equ_find(po, bp_arg, &offset);
1835 if (eq == NULL)
1836 ferr(po, "detected but missing eq\n");
1837 offset += eq->offset;
1838 *offset_out = base_val + offset;
1839 return 0;
1840}
1841
1842static int stack_frame_access(struct parsed_op *po,
1843 struct parsed_opr *popr, char *buf, size_t buf_size,
1844 const char *name, const char *cast, int is_src, int is_lea)
1845{
1846 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1847 const char *prefix = "";
1848 const char *bp_arg = NULL;
1849 char ofs_reg[16] = { 0, };
1850 int i, arg_i, arg_s;
1851 int unaligned = 0;
1852 int stack_ra = 0;
1853 int offset = 0;
1854 int retval = -1;
1855 int sf_ofs;
1856 int lim;
1857
1858 if (po->flags & OPF_EBP_S)
1859 ferr(po, "stack_frame_access while ebp is scratch\n");
1860
1861 parse_stack_access(po, name, ofs_reg, &offset,
1862 &stack_ra, &bp_arg, is_lea);
1863
1864 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1865
1866 if (offset > stack_ra)
1867 {
1868 arg_i = (offset - stack_ra - 4) / 4;
1869 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1870 {
1871 if (g_func_pp->is_vararg
1872 && arg_i == g_func_pp->argc_stack && is_lea)
1873 {
1874 // should be va_list
1875 if (cast[0] == 0)
1876 cast = "(u32)";
1877 snprintf(buf, buf_size, "%sap", cast);
1878 return -1;
1879 }
1880 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1881 offset, bp_arg, arg_i);
1882 }
1883 if (ofs_reg[0] != 0)
1884 ferr(po, "offset reg on arg access?\n");
1885
1886 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1887 if (g_func_pp->arg[i].reg != NULL)
1888 continue;
1889 if (arg_s == arg_i)
1890 break;
1891 arg_s++;
1892 }
1893 if (i == g_func_pp->argc)
1894 ferr(po, "arg %d not in prototype?\n", arg_i);
1895
1896 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1897 retval = i;
1898
1899 switch (popr->lmod)
1900 {
1901 case OPLM_BYTE:
1902 if (is_lea)
1903 ferr(po, "lea/byte to arg?\n");
1904 if (is_src && (offset & 3) == 0)
1905 snprintf(buf, buf_size, "%sa%d",
1906 simplify_cast(cast, "(u8)"), i + 1);
1907 else
1908 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1909 cast, offset & 3, i + 1);
1910 break;
1911
1912 case OPLM_WORD:
1913 if (is_lea)
1914 ferr(po, "lea/word to arg?\n");
1915 if (offset & 1) {
1916 unaligned = 1;
1917 if (!is_src) {
1918 if (offset & 2)
1919 ferr(po, "problematic arg store\n");
1920 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1921 simplify_cast(cast, "*(u16 *)"), i + 1);
1922 }
1923 else
1924 ferr(po, "unaligned arg word load\n");
1925 }
1926 else if (is_src && (offset & 2) == 0)
1927 snprintf(buf, buf_size, "%sa%d",
1928 simplify_cast(cast, "(u16)"), i + 1);
1929 else
1930 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1931 cast, (offset & 2) ? "HI" : "LO", i + 1);
1932 break;
1933
1934 case OPLM_DWORD:
1935 if (cast[0])
1936 prefix = cast;
1937 else if (is_src)
1938 prefix = "(u32)";
1939
1940 if (offset & 3) {
1941 unaligned = 1;
1942 if (is_lea)
1943 snprintf(buf, buf_size, "(u32)&a%d + %d",
1944 i + 1, offset & 3);
1945 else if (!is_src)
1946 ferr(po, "unaligned arg store\n");
1947 else {
1948 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1949 snprintf(buf, buf_size, "%s(a%d >> %d)",
1950 prefix, i + 1, (offset & 3) * 8);
1951 }
1952 }
1953 else {
1954 snprintf(buf, buf_size, "%s%sa%d",
1955 prefix, is_lea ? "&" : "", i + 1);
1956 }
1957 break;
1958
1959 default:
1960 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1961 }
1962
1963 if (unaligned)
1964 strcat(g_comment, " unaligned");
1965
1966 // common problem
1967 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1968 if (tmp_lmod != OPLM_DWORD
1969 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1970 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1971 {
1972 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1973 i + 1, offset, g_func_pp->arg[i].type.name);
1974 }
1975 // can't check this because msvc likes to reuse
1976 // arg space for scratch..
1977 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1978 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1979 }
1980 else
1981 {
1982 if (g_stack_fsz == 0)
1983 ferr(po, "stack var access without stackframe\n");
1984 g_stack_frame_used = 1;
1985
1986 sf_ofs = g_stack_fsz + offset;
1987 lim = (ofs_reg[0] != 0) ? -4 : 0;
1988 if (offset > 0 || sf_ofs < lim)
1989 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1990
1991 if (is_lea)
1992 prefix = "(u32)&";
1993 else
1994 prefix = cast;
1995
1996 switch (popr->lmod)
1997 {
1998 case OPLM_BYTE:
1999 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
2000 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
2001 break;
2002
2003 case OPLM_WORD:
2004 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
2005 // known unaligned or possibly unaligned
2006 strcat(g_comment, " unaligned");
2007 if (prefix[0] == 0)
2008 prefix = "*(u16 *)&";
2009 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
2010 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
2011 break;
2012 }
2013 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
2014 break;
2015
2016 case OPLM_DWORD:
2017 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
2018 // known unaligned or possibly unaligned
2019 strcat(g_comment, " unaligned");
2020 if (prefix[0] == 0)
2021 prefix = "*(u32 *)&";
2022 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
2023 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
2024 break;
2025 }
2026 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
2027 break;
2028
2029 case OPLM_QWORD:
2030 ferr_assert(po, !(sf_ofs & 7));
2031 ferr_assert(po, ofs_reg[0] == 0);
2032 // float callers set is_lea
2033 ferr_assert(po, is_lea);
2034 snprintf(buf, buf_size, "%ssf.q[%d]", prefix, sf_ofs / 8);
2035 break;
2036
2037 default:
2038 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
2039 }
2040 }
2041
2042 return retval;
2043}
2044
2045static void check_func_pp(struct parsed_op *po,
2046 const struct parsed_proto *pp, const char *pfx)
2047{
2048 enum opr_lenmod tmp_lmod;
2049 char buf[256];
2050 int ret, i;
2051
2052 if (pp->argc_reg != 0) {
2053 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
2054 pp_print(buf, sizeof(buf), pp);
2055 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
2056 }
2057 if (pp->argc_stack > 0 && pp->argc_reg != 2)
2058 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
2059 pfx, pp->argc_reg, pp->argc_stack);
2060 }
2061
2062 // fptrs must use 32bit args, callsite might have no information and
2063 // lack a cast to smaller types, which results in incorrectly masked
2064 // args passed (callee may assume masked args, it does on ARM)
2065 if (!pp->is_osinc) {
2066 for (i = 0; i < pp->argc; i++) {
2067 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
2068 if (ret && tmp_lmod != OPLM_DWORD)
2069 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
2070 i + 1, pp->arg[i].type.name);
2071 }
2072 }
2073}
2074
2075static const char *check_label_read_ref(struct parsed_op *po,
2076 const char *name)
2077{
2078 const struct parsed_proto *pp;
2079
2080 pp = proto_parse(g_fhdr, name, 0);
2081 if (pp == NULL)
2082 ferr(po, "proto_parse failed for ref '%s'\n", name);
2083
2084 if (pp->is_func)
2085 check_func_pp(po, pp, "ref");
2086
2087 return pp->name;
2088}
2089
2090static char *out_src_opr(char *buf, size_t buf_size,
2091 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
2092 int is_lea)
2093{
2094 char tmp1[256], tmp2[256];
2095 char expr[256];
2096 const char *name;
2097 char *p;
2098 int ret;
2099
2100 if (cast == NULL)
2101 cast = "";
2102
2103 switch (popr->type) {
2104 case OPT_REG:
2105 if (is_lea)
2106 ferr(po, "lea from reg?\n");
2107
2108 switch (popr->lmod) {
2109 case OPLM_QWORD:
2110 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
2111 break;
2112 case OPLM_DWORD:
2113 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
2114 break;
2115 case OPLM_WORD:
2116 snprintf(buf, buf_size, "%s%s",
2117 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
2118 break;
2119 case OPLM_BYTE:
2120 if (popr->name[1] == 'h') // XXX..
2121 snprintf(buf, buf_size, "%s(%s >> 8)",
2122 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
2123 else
2124 snprintf(buf, buf_size, "%s%s",
2125 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
2126 break;
2127 default:
2128 ferr(po, "invalid src lmod: %d\n", popr->lmod);
2129 }
2130 break;
2131
2132 case OPT_REGMEM:
2133 if (is_stack_access(po, popr)) {
2134 stack_frame_access(po, popr, buf, buf_size,
2135 popr->name, cast, 1, is_lea);
2136 break;
2137 }
2138
2139 strcpy(expr, popr->name);
2140 if (strchr(expr, '[')) {
2141 // special case: '[' can only be left for label[reg] form
2142 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
2143 if (ret != 2)
2144 ferr(po, "parse failure for '%s'\n", expr);
2145 if (tmp1[0] == '(') {
2146 // (off_4FFF50+3)[eax]
2147 p = strchr(tmp1 + 1, ')');
2148 if (p == NULL || p[1] != 0)
2149 ferr(po, "parse failure (2) for '%s'\n", expr);
2150 *p = 0;
2151 memmove(tmp1, tmp1 + 1, strlen(tmp1));
2152 }
2153 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
2154 }
2155
2156 // XXX: do we need more parsing?
2157 if (is_lea) {
2158 snprintf(buf, buf_size, "%s", expr);
2159 break;
2160 }
2161
2162 snprintf(buf, buf_size, "%s(%s)",
2163 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
2164 break;
2165
2166 case OPT_LABEL:
2167 name = check_label_read_ref(po, popr->name);
2168 if (cast[0] == 0 && popr->is_ptr)
2169 cast = "(u32)";
2170
2171 if (is_lea)
2172 snprintf(buf, buf_size, "(u32)&%s", name);
2173 else if (popr->size_lt)
2174 snprintf(buf, buf_size, "%s%s%s%s", cast,
2175 lmod_cast_u_ptr(po, popr->lmod),
2176 popr->is_array ? "" : "&", name);
2177 else
2178 snprintf(buf, buf_size, "%s%s%s", cast, name,
2179 popr->is_array ? "[0]" : "");
2180 break;
2181
2182 case OPT_OFFSET:
2183 name = check_label_read_ref(po, popr->name);
2184 if (cast[0] == 0)
2185 cast = "(u32)";
2186 if (is_lea)
2187 ferr(po, "lea an offset?\n");
2188 snprintf(buf, buf_size, "%s&%s", cast, name);
2189 break;
2190
2191 case OPT_CONST:
2192 if (is_lea)
2193 ferr(po, "lea from const?\n");
2194
2195 printf_number(tmp1, sizeof(tmp1), popr->val);
2196 if (popr->val == 0 && strchr(cast, '*'))
2197 snprintf(buf, buf_size, "NULL");
2198 else
2199 snprintf(buf, buf_size, "%s%s",
2200 simplify_cast_num(cast, popr->val), tmp1);
2201 break;
2202
2203 default:
2204 ferr(po, "invalid src type: %d\n", popr->type);
2205 }
2206
2207 return buf;
2208}
2209
2210// note: may set is_ptr (we find that out late for ebp frame..)
2211static char *out_dst_opr(char *buf, size_t buf_size,
2212 struct parsed_op *po, struct parsed_opr *popr)
2213{
2214 switch (popr->type) {
2215 case OPT_REG:
2216 switch (popr->lmod) {
2217 case OPLM_QWORD:
2218 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
2219 break;
2220 case OPLM_DWORD:
2221 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
2222 break;
2223 case OPLM_WORD:
2224 // ugh..
2225 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
2226 break;
2227 case OPLM_BYTE:
2228 // ugh..
2229 if (popr->name[1] == 'h') // XXX..
2230 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
2231 else
2232 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
2233 break;
2234 default:
2235 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
2236 }
2237 break;
2238
2239 case OPT_REGMEM:
2240 if (is_stack_access(po, popr)) {
2241 stack_frame_access(po, popr, buf, buf_size,
2242 popr->name, "", 0, 0);
2243 break;
2244 }
2245
2246 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
2247
2248 case OPT_LABEL:
2249 if (popr->size_mismatch)
2250 snprintf(buf, buf_size, "%s%s%s",
2251 lmod_cast_u_ptr(po, popr->lmod),
2252 popr->is_array ? "" : "&", popr->name);
2253 else
2254 snprintf(buf, buf_size, "%s%s", popr->name,
2255 popr->is_array ? "[0]" : "");
2256 break;
2257
2258 default:
2259 ferr(po, "invalid dst type: %d\n", popr->type);
2260 }
2261
2262 return buf;
2263}
2264
2265static char *out_src_opr_u32(char *buf, size_t buf_size,
2266 struct parsed_op *po, struct parsed_opr *popr)
2267{
2268 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
2269}
2270
2271static char *out_src_opr_float(char *buf, size_t buf_size,
2272 struct parsed_op *po, struct parsed_opr *popr, int need_float_stack)
2273{
2274 const char *cast = NULL;
2275 char tmp[256];
2276
2277 switch (popr->type) {
2278 case OPT_REG:
2279 if (popr->reg < xST0 || popr->reg > xST7)
2280 ferr(po, "bad reg: %d\n", popr->reg);
2281
2282 if (need_float_stack) {
2283 if (popr->reg == xST0)
2284 snprintf(buf, buf_size, "f_st[f_stp & 7]");
2285 else
2286 snprintf(buf, buf_size, "f_st[(f_stp + %d) & 7]",
2287 popr->reg - xST0);
2288 }
2289 else
2290 snprintf(buf, buf_size, "f_st%d", popr->reg - xST0);
2291 break;
2292
2293 case OPT_REGMEM:
2294 case OPT_LABEL:
2295 case OPT_OFFSET:
2296 switch (popr->lmod) {
2297 case OPLM_QWORD:
2298 cast = "double";
2299 break;
2300 case OPLM_DWORD:
2301 cast = "float";
2302 break;
2303 default:
2304 ferr(po, "unhandled lmod: %d\n", popr->lmod);
2305 break;
2306 }
2307 out_src_opr(tmp, sizeof(tmp), po, popr, "", 1);
2308 snprintf(buf, buf_size, "*((%s *)%s)", cast, tmp);
2309 break;
2310
2311 default:
2312 ferr(po, "invalid float type: %d\n", popr->type);
2313 }
2314
2315 return buf;
2316}
2317
2318static char *out_dst_opr_float(char *buf, size_t buf_size,
2319 struct parsed_op *po, struct parsed_opr *popr, int need_float_stack)
2320{
2321 // same?
2322 return out_src_opr_float(buf, buf_size, po, popr, need_float_stack);
2323}
2324
2325static void out_test_for_cc(char *buf, size_t buf_size,
2326 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
2327 enum opr_lenmod lmod, const char *expr)
2328{
2329 const char *cast, *scast;
2330
2331 cast = lmod_cast_u(po, lmod);
2332 scast = lmod_cast_s(po, lmod);
2333
2334 switch (pfo) {
2335 case PFO_Z:
2336 case PFO_BE: // CF=1||ZF=1; CF=0
2337 snprintf(buf, buf_size, "(%s%s %s 0)",
2338 cast, expr, is_inv ? "!=" : "==");
2339 break;
2340
2341 case PFO_S:
2342 case PFO_L: // SF!=OF; OF=0
2343 snprintf(buf, buf_size, "(%s%s %s 0)",
2344 scast, expr, is_inv ? ">=" : "<");
2345 break;
2346
2347 case PFO_LE: // ZF=1||SF!=OF; OF=0
2348 snprintf(buf, buf_size, "(%s%s %s 0)",
2349 scast, expr, is_inv ? ">" : "<=");
2350 break;
2351
2352 default:
2353 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2354 }
2355}
2356
2357static void out_cmp_for_cc(char *buf, size_t buf_size,
2358 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
2359 int is_neg)
2360{
2361 const char *cast, *scast, *cast_use;
2362 char buf1[256], buf2[256];
2363 enum opr_lenmod lmod;
2364
2365 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
2366 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
2367 po->operand[0].lmod, po->operand[1].lmod);
2368 lmod = po->operand[0].lmod;
2369
2370 cast = lmod_cast_u(po, lmod);
2371 scast = lmod_cast_s(po, lmod);
2372
2373 switch (pfo) {
2374 case PFO_C:
2375 case PFO_Z:
2376 case PFO_BE: // !a
2377 cast_use = cast;
2378 break;
2379
2380 case PFO_S:
2381 case PFO_L: // !ge
2382 case PFO_LE:
2383 cast_use = scast;
2384 break;
2385
2386 default:
2387 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
2388 }
2389
2390 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
2391 if (po->op == OP_DEC)
2392 snprintf(buf2, sizeof(buf2), "1");
2393 else {
2394 char cast_op2[64];
2395 snprintf(cast_op2, sizeof(cast_op2) - 1, "%s", cast_use);
2396 if (is_neg)
2397 strcat(cast_op2, "-");
2398 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_op2, 0);
2399 }
2400
2401 switch (pfo) {
2402 case PFO_C:
2403 // note: must be unsigned compare
2404 snprintf(buf, buf_size, "(%s %s %s)",
2405 buf1, is_inv ? ">=" : "<", buf2);
2406 break;
2407
2408 case PFO_Z:
2409 snprintf(buf, buf_size, "(%s %s %s)",
2410 buf1, is_inv ? "!=" : "==", buf2);
2411 break;
2412
2413 case PFO_BE: // !a
2414 // note: must be unsigned compare
2415 snprintf(buf, buf_size, "(%s %s %s)",
2416 buf1, is_inv ? ">" : "<=", buf2);
2417
2418 // annoying case
2419 if (is_inv && lmod == OPLM_BYTE
2420 && po->operand[1].type == OPT_CONST
2421 && po->operand[1].val == 0xff)
2422 {
2423 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2424 snprintf(buf, buf_size, "(0)");
2425 }
2426 break;
2427
2428 // note: must be signed compare
2429 case PFO_S:
2430 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2431 scast, buf1, buf2, is_inv ? ">=" : "<");
2432 break;
2433
2434 case PFO_L: // !ge
2435 snprintf(buf, buf_size, "(%s %s %s)",
2436 buf1, is_inv ? ">=" : "<", buf2);
2437 break;
2438
2439 case PFO_LE: // !g
2440 snprintf(buf, buf_size, "(%s %s %s)",
2441 buf1, is_inv ? ">" : "<=", buf2);
2442 break;
2443
2444 default:
2445 break;
2446 }
2447}
2448
2449static void out_cmp_test(char *buf, size_t buf_size,
2450 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2451{
2452 char buf1[256], buf2[256], buf3[256];
2453
2454 if (po->op == OP_TEST) {
2455 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2456 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2457 }
2458 else {
2459 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2460 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2461 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2462 }
2463 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2464 po->operand[0].lmod, buf3);
2465 }
2466 else if (po->op == OP_CMP) {
2467 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv, 0);
2468 }
2469 else
2470 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2471}
2472
2473static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2474 struct parsed_opr *popr2)
2475{
2476 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2477 ferr(po, "missing lmod for both operands\n");
2478
2479 if (popr1->lmod == OPLM_UNSPEC)
2480 popr1->lmod = popr2->lmod;
2481 else if (popr2->lmod == OPLM_UNSPEC)
2482 popr2->lmod = popr1->lmod;
2483 else if (popr1->lmod != popr2->lmod) {
2484 if (popr1->type_from_var) {
2485 popr1->size_mismatch = 1;
2486 if (popr1->lmod < popr2->lmod)
2487 popr1->size_lt = 1;
2488 popr1->lmod = popr2->lmod;
2489 }
2490 else if (popr2->type_from_var) {
2491 popr2->size_mismatch = 1;
2492 if (popr2->lmod < popr1->lmod)
2493 popr2->size_lt = 1;
2494 popr2->lmod = popr1->lmod;
2495 }
2496 else
2497 ferr(po, "conflicting lmods: %d vs %d\n",
2498 popr1->lmod, popr2->lmod);
2499 }
2500}
2501
2502static const char *op_to_c(struct parsed_op *po)
2503{
2504 switch (po->op)
2505 {
2506 case OP_ADD:
2507 case OP_ADC:
2508 return "+";
2509 case OP_SUB:
2510 case OP_SBB:
2511 return "-";
2512 case OP_AND:
2513 return "&";
2514 case OP_OR:
2515 return "|";
2516 case OP_XOR:
2517 return "^";
2518 case OP_SHL:
2519 return "<<";
2520 case OP_SHR:
2521 return ">>";
2522 case OP_MUL:
2523 case OP_IMUL:
2524 return "*";
2525 default:
2526 ferr(po, "op_to_c was supplied with %d\n", po->op);
2527 }
2528}
2529
2530// last op in stream - unconditional branch or ret
2531#define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2532 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2533 && ops[_i].op != OP_CALL))
2534
2535#define check_i(po, i) \
2536 if ((i) < 0) \
2537 ferr(po, "bad " #i ": %d\n", i)
2538
2539// note: this skips over calls and rm'd stuff assuming they're handled
2540// so it's intended to use at one of final passes
2541static int scan_for_pop(int i, int opcnt, int magic, int reg,
2542 int depth, int seen_noreturn, int flags_set)
2543{
2544 struct parsed_op *po;
2545 int relevant;
2546 int ret = 0;
2547 int j;
2548
2549 for (; i < opcnt; i++) {
2550 po = &ops[i];
2551 if (po->cc_scratch == magic)
2552 return ret; // already checked
2553 po->cc_scratch = magic;
2554
2555 if (po->flags & OPF_TAIL) {
2556 if (po->op == OP_CALL) {
2557 if (po->pp != NULL && po->pp->is_noreturn)
2558 seen_noreturn = 1;
2559 else
2560 return -1;
2561 }
2562 else
2563 return -1; // deadend
2564 }
2565
2566 if (po->flags & (OPF_RMD|OPF_DONE|OPF_FARG))
2567 continue;
2568
2569 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2570 if (po->btj != NULL) {
2571 // jumptable
2572 for (j = 0; j < po->btj->count; j++) {
2573 check_i(po, po->btj->d[j].bt_i);
2574 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, magic, reg,
2575 depth, seen_noreturn, flags_set);
2576 if (ret < 0)
2577 return ret; // dead end
2578 }
2579 return ret;
2580 }
2581
2582 check_i(po, po->bt_i);
2583 if (po->flags & OPF_CJMP) {
2584 ret |= scan_for_pop(po->bt_i, opcnt, magic, reg,
2585 depth, seen_noreturn, flags_set);
2586 if (ret < 0)
2587 return ret; // dead end
2588 }
2589 else {
2590 i = po->bt_i - 1;
2591 }
2592 continue;
2593 }
2594
2595 relevant = 0;
2596 if ((po->op == OP_POP || po->op == OP_PUSH)
2597 && po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2598 {
2599 relevant = 1;
2600 }
2601
2602 if (po->op == OP_PUSH) {
2603 depth++;
2604 }
2605 else if (po->op == OP_POP) {
2606 if (relevant && depth == 0) {
2607 po->flags |= flags_set;
2608 return 1;
2609 }
2610 depth--;
2611 }
2612 }
2613
2614 // for noreturn, assume msvc skipped stack cleanup
2615 return seen_noreturn ? 1 : -1;
2616}
2617
2618// scan for 'reg' pop backwards starting from i
2619// intended to use for register restore search, so other reg
2620// references are considered an error
2621static int scan_for_rsave_pop_reg(int i, int magic, int reg, int set_flags)
2622{
2623 struct parsed_op *po;
2624 struct label_ref *lr;
2625 int ret = 0;
2626
2627 ops[i].cc_scratch = magic;
2628
2629 while (1)
2630 {
2631 if (g_labels[i] != NULL) {
2632 lr = &g_label_refs[i];
2633 for (; lr != NULL; lr = lr->next) {
2634 check_i(&ops[i], lr->i);
2635 ret |= scan_for_rsave_pop_reg(lr->i, magic, reg, set_flags);
2636 if (ret < 0)
2637 return ret;
2638 }
2639 if (i > 0 && LAST_OP(i - 1))
2640 return ret;
2641 }
2642
2643 i--;
2644 if (i < 0)
2645 break;
2646
2647 if (ops[i].cc_scratch == magic)
2648 return ret;
2649 ops[i].cc_scratch = magic;
2650
2651 po = &ops[i];
2652 if (po->op == OP_POP && po->operand[0].reg == reg) {
2653 if (po->flags & (OPF_RMD|OPF_DONE))
2654 return -1;
2655
2656 po->flags |= set_flags;
2657 return 1;
2658 }
2659
2660 // this also covers the case where we reach corresponding push
2661 if ((po->regmask_dst | po->regmask_src) & (1 << reg))
2662 return -1;
2663 }
2664
2665 // nothing interesting on this path
2666 return 0;
2667}
2668
2669static void find_reachable_exits(int i, int opcnt, int magic,
2670 int *exits, int *exit_count)
2671{
2672 struct parsed_op *po;
2673 int j;
2674
2675 for (; i < opcnt; i++)
2676 {
2677 po = &ops[i];
2678 if (po->cc_scratch == magic)
2679 return;
2680 po->cc_scratch = magic;
2681
2682 if (po->flags & OPF_TAIL) {
2683 ferr_assert(po, *exit_count < MAX_EXITS);
2684 exits[*exit_count] = i;
2685 (*exit_count)++;
2686 return;
2687 }
2688
2689 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2690 if (po->flags & OPF_RMD)
2691 continue;
2692
2693 if (po->btj != NULL) {
2694 for (j = 0; j < po->btj->count; j++) {
2695 check_i(po, po->btj->d[j].bt_i);
2696 find_reachable_exits(po->btj->d[j].bt_i, opcnt, magic,
2697 exits, exit_count);
2698 }
2699 return;
2700 }
2701
2702 check_i(po, po->bt_i);
2703 if (po->flags & OPF_CJMP)
2704 find_reachable_exits(po->bt_i, opcnt, magic, exits, exit_count);
2705 else
2706 i = po->bt_i - 1;
2707 continue;
2708 }
2709 }
2710}
2711
2712// scan for 'reg' pop backwards starting from exits (all paths)
2713static int scan_for_pop_ret(int i, int opcnt, int reg, int set_flags)
2714{
2715 static int exits[MAX_EXITS];
2716 static int exit_count;
2717 int j, ret;
2718
2719 if (!set_flags) {
2720 exit_count = 0;
2721 find_reachable_exits(i, opcnt, i + opcnt * 15, exits,
2722 &exit_count);
2723 ferr_assert(&ops[i], exit_count > 0);
2724 }
2725
2726 for (j = 0; j < exit_count; j++) {
2727 ret = scan_for_rsave_pop_reg(exits[j], i + opcnt * 16 + set_flags,
2728 reg, set_flags);
2729 if (ret == -1)
2730 return -1;
2731 }
2732
2733 return 1;
2734}
2735
2736// scan for one or more pop of push <const>
2737static int scan_for_pop_const_r(int i, int opcnt, int magic,
2738 int push_i, int is_probe)
2739{
2740 struct parsed_op *po;
2741 struct label_ref *lr;
2742 int ret = 0;
2743 int j;
2744
2745 for (; i < opcnt; i++)
2746 {
2747 po = &ops[i];
2748 if (po->cc_scratch == magic)
2749 return ret; // already checked
2750 po->cc_scratch = magic;
2751
2752 if (po->flags & OPF_JMP) {
2753 if (po->flags & OPF_RMD)
2754 continue;
2755 if (po->op == OP_CALL)
2756 return -1;
2757
2758 if (po->btj != NULL) {
2759 for (j = 0; j < po->btj->count; j++) {
2760 check_i(po, po->btj->d[j].bt_i);
2761 ret |= scan_for_pop_const_r(po->btj->d[j].bt_i, opcnt, magic,
2762 push_i, is_probe);
2763 if (ret < 0)
2764 return ret;
2765 }
2766 return ret;
2767 }
2768
2769 check_i(po, po->bt_i);
2770 if (po->flags & OPF_CJMP) {
2771 ret |= scan_for_pop_const_r(po->bt_i, opcnt, magic, push_i,
2772 is_probe);
2773 if (ret < 0)
2774 return ret;
2775 }
2776 else {
2777 i = po->bt_i - 1;
2778 }
2779 continue;
2780 }
2781
2782 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_PUSH)
2783 return -1;
2784
2785 if (g_labels[i] != NULL) {
2786 // all refs must be visited
2787 lr = &g_label_refs[i];
2788 for (; lr != NULL; lr = lr->next) {
2789 check_i(po, lr->i);
2790 if (ops[lr->i].cc_scratch != magic)
2791 return -1;
2792 }
2793 if (i > 0 && !LAST_OP(i - 1) && ops[i - 1].cc_scratch != magic)
2794 return -1;
2795 }
2796
2797 if (po->op == OP_POP)
2798 {
2799 if (po->flags & (OPF_RMD|OPF_DONE))
2800 return -1;
2801
2802 if (!is_probe) {
2803 po->flags |= OPF_DONE;
2804 po->datap = &ops[push_i];
2805 }
2806 return 1;
2807 }
2808 }
2809
2810 return -1;
2811}
2812
2813static void scan_for_pop_const(int i, int opcnt, int magic)
2814{
2815 int ret;
2816
2817 ret = scan_for_pop_const_r(i + 1, opcnt, magic, i, 1);
2818 if (ret == 1) {
2819 ops[i].flags |= OPF_RMD | OPF_DONE;
2820 scan_for_pop_const_r(i + 1, opcnt, magic + 1, i, 0);
2821 }
2822}
2823
2824// check if all branch targets within a marked path are also marked
2825// note: the path checked must not be empty or end with a branch
2826static int check_path_branches(int opcnt, int magic)
2827{
2828 struct parsed_op *po;
2829 int i, j;
2830
2831 for (i = 0; i < opcnt; i++) {
2832 po = &ops[i];
2833 if (po->cc_scratch != magic)
2834 continue;
2835
2836 if (po->flags & OPF_JMP) {
2837 if ((po->flags & OPF_RMD) || po->op == OP_CALL)
2838 continue;
2839
2840 if (po->btj != NULL) {
2841 for (j = 0; j < po->btj->count; j++) {
2842 check_i(po, po->btj->d[j].bt_i);
2843 if (ops[po->btj->d[j].bt_i].cc_scratch != magic)
2844 return 0;
2845 }
2846 }
2847
2848 check_i(po, po->bt_i);
2849 if (ops[po->bt_i].cc_scratch != magic)
2850 return 0;
2851 if ((po->flags & OPF_CJMP) && ops[i + 1].cc_scratch != magic)
2852 return 0;
2853 }
2854 }
2855
2856 return 1;
2857}
2858
2859// scan for multiple pushes for given pop
2860static int scan_pushes_for_pop_r(int i, int magic, int pop_i,
2861 int is_probe)
2862{
2863 int reg = ops[pop_i].operand[0].reg;
2864 struct parsed_op *po;
2865 struct label_ref *lr;
2866 int ret = 0;
2867
2868 ops[i].cc_scratch = magic;
2869
2870 while (1)
2871 {
2872 if (g_labels[i] != NULL) {
2873 lr = &g_label_refs[i];
2874 for (; lr != NULL; lr = lr->next) {
2875 check_i(&ops[i], lr->i);
2876 ret |= scan_pushes_for_pop_r(lr->i, magic, pop_i, is_probe);
2877 if (ret < 0)
2878 return ret;
2879 }
2880 if (i > 0 && LAST_OP(i - 1))
2881 return ret;
2882 }
2883
2884 i--;
2885 if (i < 0)
2886 break;
2887
2888 if (ops[i].cc_scratch == magic)
2889 return ret;
2890 ops[i].cc_scratch = magic;
2891
2892 po = &ops[i];
2893 if (po->op == OP_CALL)
2894 return -1;
2895 if ((po->flags & (OPF_TAIL|OPF_RSAVE)) || po->op == OP_POP)
2896 return -1;
2897
2898 if (po->op == OP_PUSH)
2899 {
2900 if (po->datap != NULL)
2901 return -1;
2902 if (po->operand[0].type == OPT_REG && po->operand[0].reg == reg)
2903 // leave this case for reg save/restore handlers
2904 return -1;
2905
2906 if (!is_probe) {
2907 po->flags |= OPF_PPUSH | OPF_DONE;
2908 po->datap = &ops[pop_i];
2909 }
2910 return 1;
2911 }
2912 }
2913
2914 return -1;
2915}
2916
2917static void scan_pushes_for_pop(int i, int opcnt, int *regmask_pp)
2918{
2919 int magic = i + opcnt * 14;
2920 int ret;
2921
2922 ret = scan_pushes_for_pop_r(i, magic, i, 1);
2923 if (ret == 1) {
2924 ret = check_path_branches(opcnt, magic);
2925 if (ret == 1) {
2926 ops[i].flags |= OPF_PPUSH | OPF_DONE;
2927 *regmask_pp |= 1 << ops[i].operand[0].reg;
2928 scan_pushes_for_pop_r(i, magic + 1, i, 0);
2929 }
2930 }
2931}
2932
2933static void scan_propagate_df(int i, int opcnt)
2934{
2935 struct parsed_op *po = &ops[i];
2936 int j;
2937
2938 for (; i < opcnt; i++) {
2939 po = &ops[i];
2940 if (po->flags & OPF_DF)
2941 return; // already resolved
2942 po->flags |= OPF_DF;
2943
2944 if (po->op == OP_CALL)
2945 ferr(po, "call with DF set?\n");
2946
2947 if (po->flags & OPF_JMP) {
2948 if (po->btj != NULL) {
2949 // jumptable
2950 for (j = 0; j < po->btj->count; j++) {
2951 check_i(po, po->btj->d[j].bt_i);
2952 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2953 }
2954 return;
2955 }
2956
2957 if (po->flags & OPF_RMD)
2958 continue;
2959 check_i(po, po->bt_i);
2960 if (po->flags & OPF_CJMP)
2961 scan_propagate_df(po->bt_i, opcnt);
2962 else
2963 i = po->bt_i - 1;
2964 continue;
2965 }
2966
2967 if (po->flags & OPF_TAIL)
2968 break;
2969
2970 if (po->op == OP_CLD) {
2971 po->flags |= OPF_RMD | OPF_DONE;
2972 return;
2973 }
2974 }
2975
2976 ferr(po, "missing DF clear?\n");
2977}
2978
2979// is operand 'opr' referenced by parsed_op 'po'?
2980static int is_opr_referenced(const struct parsed_opr *opr,
2981 const struct parsed_op *po)
2982{
2983 int i, mask;
2984
2985 if (opr->type == OPT_REG) {
2986 mask = po->regmask_dst | po->regmask_src;
2987 if (po->op == OP_CALL)
2988 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX);
2989 if ((1 << opr->reg) & mask)
2990 return 1;
2991 else
2992 return 0;
2993 }
2994
2995 for (i = 0; i < po->operand_cnt; i++)
2996 if (IS(po->operand[0].name, opr->name))
2997 return 1;
2998
2999 return 0;
3000}
3001
3002// is operand 'opr' read by parsed_op 'po'?
3003static int is_opr_read(const struct parsed_opr *opr,
3004 const struct parsed_op *po)
3005{
3006 if (opr->type == OPT_REG) {
3007 if (po->regmask_src & (1 << opr->reg))
3008 return 1;
3009 else
3010 return 0;
3011 }
3012
3013 // yes I'm lazy
3014 return 0;
3015}
3016
3017// is operand 'opr' modified by parsed_op 'po'?
3018static int is_opr_modified(const struct parsed_opr *opr,
3019 const struct parsed_op *po)
3020{
3021 int mask;
3022
3023 if (opr->type == OPT_REG) {
3024 if (po->op == OP_CALL) {
3025 mask = po->regmask_dst;
3026 mask |= (1 << xAX) | (1 << xCX) | (1 << xDX); // ?
3027 if (mask & (1 << opr->reg))
3028 return 1;
3029 else
3030 return 0;
3031 }
3032
3033 if (po->regmask_dst & (1 << opr->reg))
3034 return 1;
3035 else
3036 return 0;
3037 }
3038
3039 return IS(po->operand[0].name, opr->name);
3040}
3041
3042// is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
3043static int is_any_opr_modified(const struct parsed_op *po_test,
3044 const struct parsed_op *po, int c_mode)
3045{
3046 int mask;
3047 int i;
3048
3049 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
3050 return 0;
3051
3052 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
3053 return 0;
3054
3055 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
3056 return 1;
3057
3058 // in reality, it can wreck any register, but in decompiled C
3059 // version it can only overwrite eax or edx:eax
3060 mask = (1 << xAX) | (1 << xDX);
3061 if (!c_mode)
3062 mask |= 1 << xCX;
3063
3064 if (po->op == OP_CALL
3065 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
3066 return 1;
3067
3068 for (i = 0; i < po_test->operand_cnt; i++)
3069 if (IS(po_test->operand[i].name, po->operand[0].name))
3070 return 1;
3071
3072 return 0;
3073}
3074
3075// scan for any po_test operand modification in range given
3076static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
3077 int c_mode)
3078{
3079 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
3080 return -1;
3081
3082 for (; i < opcnt; i++) {
3083 if (is_any_opr_modified(po_test, &ops[i], c_mode))
3084 return i;
3085 }
3086
3087 return -1;
3088}
3089
3090// scan for po_test operand[0] modification in range given
3091static int scan_for_mod_opr0(struct parsed_op *po_test,
3092 int i, int opcnt)
3093{
3094 for (; i < opcnt; i++) {
3095 if (is_opr_modified(&po_test->operand[0], &ops[i]))
3096 return i;
3097 }
3098
3099 return -1;
3100}
3101
3102static int try_resolve_const(int i, const struct parsed_opr *opr,
3103 int magic, unsigned int *val);
3104
3105static int scan_for_flag_set(int i, int opcnt, int magic,
3106 int *branched, int *setters, int *setter_cnt)
3107{
3108 struct label_ref *lr;
3109 int ret;
3110
3111 while (i >= 0) {
3112 if (ops[i].cc_scratch == magic) {
3113 // is this a problem?
3114 //ferr(&ops[i], "%s looped\n", __func__);
3115 return 0;
3116 }
3117 ops[i].cc_scratch = magic;
3118
3119 if (g_labels[i] != NULL) {
3120 *branched = 1;
3121
3122 lr = &g_label_refs[i];
3123 for (; lr->next; lr = lr->next) {
3124 check_i(&ops[i], lr->i);
3125 ret = scan_for_flag_set(lr->i, opcnt, magic,
3126 branched, setters, setter_cnt);
3127 if (ret < 0)
3128 return ret;
3129 }
3130
3131 check_i(&ops[i], lr->i);
3132 if (i > 0 && LAST_OP(i - 1)) {
3133 i = lr->i;
3134 continue;
3135 }
3136 ret = scan_for_flag_set(lr->i, opcnt, magic,
3137 branched, setters, setter_cnt);
3138 if (ret < 0)
3139 return ret;
3140 }
3141 i--;
3142
3143 if (ops[i].flags & OPF_FLAGS) {
3144 setters[*setter_cnt] = i;
3145 (*setter_cnt)++;
3146
3147 if (ops[i].flags & OPF_REP) {
3148 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xCX);
3149 unsigned int uval;
3150
3151 ret = try_resolve_const(i, &opr, i + opcnt * 7, &uval);
3152 if (ret != 1 || uval == 0) {
3153 // can't treat it as full setter because of ecx=0 case,
3154 // also disallow delayed compare
3155 *branched = 1;
3156 continue;
3157 }
3158 }
3159
3160 return 0;
3161 }
3162
3163 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
3164 return -1;
3165 }
3166
3167 return -1;
3168}
3169
3170// scan back for cdq, if anything modifies edx, fail
3171static int scan_for_cdq_edx(int i)
3172{
3173 while (i >= 0) {
3174 if (g_labels[i] != NULL) {
3175 if (g_label_refs[i].next != NULL)
3176 return -1;
3177 if (i > 0 && LAST_OP(i - 1)) {
3178 i = g_label_refs[i].i;
3179 continue;
3180 }
3181 return -1;
3182 }
3183 i--;
3184
3185 if (ops[i].op == OP_CDQ)
3186 return i;
3187
3188 if (ops[i].regmask_dst & (1 << xDX))
3189 return -1;
3190 }
3191
3192 return -1;
3193}
3194
3195static int scan_for_reg_clear(int i, int reg)
3196{
3197 while (i >= 0) {
3198 if (g_labels[i] != NULL) {
3199 if (g_label_refs[i].next != NULL)
3200 return -1;
3201 if (i > 0 && LAST_OP(i - 1)) {
3202 i = g_label_refs[i].i;
3203 continue;
3204 }
3205 return -1;
3206 }
3207 i--;
3208
3209 if (ops[i].op == OP_XOR
3210 && ops[i].operand[0].lmod == OPLM_DWORD
3211 && ops[i].operand[0].reg == ops[i].operand[1].reg
3212 && ops[i].operand[0].reg == reg)
3213 return i;
3214
3215 if (ops[i].regmask_dst & (1 << reg))
3216 return -1;
3217 }
3218
3219 return -1;
3220}
3221
3222static void patch_esp_adjust(struct parsed_op *po, int adj)
3223{
3224 ferr_assert(po, po->op == OP_ADD);
3225 ferr_assert(po, IS(opr_name(po, 0), "esp"));
3226 ferr_assert(po, po->operand[1].type == OPT_CONST);
3227
3228 // this is a bit of a hack, but deals with use of
3229 // single adj for multiple calls
3230 po->operand[1].val -= adj;
3231 po->flags |= OPF_RMD;
3232 if (po->operand[1].val == 0)
3233 po->flags |= OPF_DONE;
3234 ferr_assert(po, (int)po->operand[1].val >= 0);
3235}
3236
3237// scan for positive, constant esp adjust
3238// multipath case is preliminary
3239static int scan_for_esp_adjust(int i, int opcnt,
3240 int adj_expect, int *adj, int *is_multipath, int do_update)
3241{
3242 int adj_expect_unknown = 0;
3243 struct parsed_op *po;
3244 int first_pop = -1;
3245 int adj_best = 0;
3246
3247 *adj = *is_multipath = 0;
3248 if (adj_expect < 0) {
3249 adj_expect_unknown = 1;
3250 adj_expect = 32 * 4; // enough?
3251 }
3252
3253 for (; i < opcnt && *adj < adj_expect; i++) {
3254 if (g_labels[i] != NULL)
3255 *is_multipath = 1;
3256
3257 po = &ops[i];
3258 if (po->flags & OPF_DONE)
3259 continue;
3260
3261 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
3262 if (po->operand[1].type != OPT_CONST)
3263 ferr(&ops[i], "non-const esp adjust?\n");
3264 *adj += po->operand[1].val;
3265 if (*adj & 3)
3266 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
3267 if (do_update) {
3268 if (!*is_multipath)
3269 patch_esp_adjust(po, adj_expect);
3270 else
3271 po->flags |= OPF_RMD;
3272 }
3273 return i;
3274 }
3275 else if (po->op == OP_PUSH) {
3276 //if (first_pop == -1)
3277 // first_pop = -2; // none
3278 *adj -= lmod_bytes(po, po->operand[0].lmod);
3279 }
3280 else if (po->op == OP_POP) {
3281 if (!(po->flags & OPF_DONE)) {
3282 // seems like msvc only uses 'pop ecx' for stack realignment..
3283 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
3284 break;
3285 if (first_pop == -1 && *adj >= 0)
3286 first_pop = i;
3287 }
3288 if (do_update && *adj >= 0) {
3289 po->flags |= OPF_RMD;
3290 if (!*is_multipath)
3291 po->flags |= OPF_DONE | OPF_NOREGS;
3292 }
3293
3294 *adj += lmod_bytes(po, po->operand[0].lmod);
3295 if (*adj > adj_best)
3296 adj_best = *adj;
3297 }
3298 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
3299 if (po->op == OP_JMP && po->btj == NULL) {
3300 if (po->bt_i <= i)
3301 break;
3302 i = po->bt_i - 1;
3303 continue;
3304 }
3305 if (po->op != OP_CALL)
3306 break;
3307 if (po->operand[0].type != OPT_LABEL)
3308 break;
3309 if (po->pp != NULL && po->pp->is_stdcall)
3310 break;
3311 if (adj_expect_unknown && first_pop >= 0)
3312 break;
3313 // assume it's another cdecl call
3314 }
3315 }
3316
3317 if (first_pop >= 0) {
3318 // probably only 'pop ecx' was used
3319 *adj = adj_best;
3320 return first_pop;
3321 }
3322
3323 return -1;
3324}
3325
3326static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
3327{
3328 struct parsed_op *po;
3329 int j;
3330
3331 if (i < 0)
3332 ferr(ops, "%s: followed bad branch?\n", __func__);
3333
3334 for (; i < opcnt; i++) {
3335 po = &ops[i];
3336 if (po->cc_scratch == magic)
3337 return;
3338 po->cc_scratch = magic;
3339 po->flags |= flags;
3340
3341 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
3342 if (po->btj != NULL) {
3343 // jumptable
3344 for (j = 0; j < po->btj->count; j++)
3345 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
3346 return;
3347 }
3348
3349 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
3350 if (!(po->flags & OPF_CJMP))
3351 return;
3352 }
3353 if (po->flags & OPF_TAIL)
3354 return;
3355 }
3356}
3357
3358static const struct parsed_proto *try_recover_pp(
3359 struct parsed_op *po, const struct parsed_opr *opr,
3360 int is_call, int *search_instead)
3361{
3362 const struct parsed_proto *pp = NULL;
3363 char buf[256];
3364 char *p;
3365
3366 // maybe an arg of g_func?
3367 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
3368 {
3369 char ofs_reg[16] = { 0, };
3370 int arg, arg_s, arg_i;
3371 int stack_ra = 0;
3372 int offset = 0;
3373
3374 if (g_header_mode)
3375 return NULL;
3376
3377 parse_stack_access(po, opr->name, ofs_reg,
3378 &offset, &stack_ra, NULL, 0);
3379 if (ofs_reg[0] != 0)
3380 ferr(po, "offset reg on arg access?\n");
3381 if (offset <= stack_ra) {
3382 // search who set the stack var instead
3383 if (search_instead != NULL)
3384 *search_instead = 1;
3385 return NULL;
3386 }
3387
3388 arg_i = (offset - stack_ra - 4) / 4;
3389 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
3390 if (g_func_pp->arg[arg].reg != NULL)
3391 continue;
3392 if (arg_s == arg_i)
3393 break;
3394 arg_s++;
3395 }
3396 if (arg == g_func_pp->argc)
3397 ferr(po, "stack arg %d not in prototype?\n", arg_i);
3398
3399 pp = g_func_pp->arg[arg].pp;
3400 if (is_call) {
3401 if (pp == NULL)
3402 ferr(po, "icall arg: arg%d has no pp\n", arg + 1);
3403 check_func_pp(po, pp, "icall arg");
3404 }
3405 }
3406 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
3407 // label[index]
3408 p = strchr(opr->name + 1, '[');
3409 memcpy(buf, opr->name, p - opr->name);
3410 buf[p - opr->name] = 0;
3411 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
3412 }
3413 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
3414 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
3415 if (pp == NULL) {
3416 if (!g_header_mode)
3417 ferr(po, "proto_parse failed for icall to '%s'\n", opr->name);
3418 }
3419 else
3420 check_func_pp(po, pp, "reg-fptr ref");
3421 }
3422
3423 return pp;
3424}
3425
3426static void scan_for_call_type(int i, const struct parsed_opr *opr,
3427 int magic, const struct parsed_proto **pp_found, int *pp_i,
3428 int *multi)
3429{
3430 const struct parsed_proto *pp = NULL;
3431 struct parsed_op *po;
3432 struct label_ref *lr;
3433
3434 ops[i].cc_scratch = magic;
3435
3436 while (1) {
3437 if (g_labels[i] != NULL) {
3438 lr = &g_label_refs[i];
3439 for (; lr != NULL; lr = lr->next) {
3440 check_i(&ops[i], lr->i);
3441 scan_for_call_type(lr->i, opr, magic, pp_found, pp_i, multi);
3442 }
3443 if (i > 0 && LAST_OP(i - 1))
3444 return;
3445 }
3446
3447 i--;
3448 if (i < 0)
3449 break;
3450
3451 if (ops[i].cc_scratch == magic)
3452 return;
3453 ops[i].cc_scratch = magic;
3454
3455 if (!(ops[i].flags & OPF_DATA))
3456 continue;
3457 if (!is_opr_modified(opr, &ops[i]))
3458 continue;
3459 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
3460 // most probably trashed by some processing
3461 *pp_found = NULL;
3462 return;
3463 }
3464
3465 opr = &ops[i].operand[1];
3466 if (opr->type != OPT_REG)
3467 break;
3468 }
3469
3470 po = (i >= 0) ? &ops[i] : ops;
3471
3472 if (i < 0) {
3473 // reached the top - can only be an arg-reg
3474 if (opr->type != OPT_REG || g_func_pp == NULL)
3475 return;
3476
3477 for (i = 0; i < g_func_pp->argc; i++) {
3478 if (g_func_pp->arg[i].reg == NULL)
3479 continue;
3480 if (IS(opr->name, g_func_pp->arg[i].reg))
3481 break;
3482 }
3483 if (i == g_func_pp->argc)
3484 return;
3485 pp = g_func_pp->arg[i].pp;
3486 if (pp == NULL)
3487 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
3488 i + 1, g_func_pp->arg[i].reg);
3489 check_func_pp(po, pp, "icall reg-arg");
3490 }
3491 else
3492 pp = try_recover_pp(po, opr, 1, NULL);
3493
3494 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
3495 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
3496 || (*pp_found)->is_stdcall != pp->is_stdcall
3497 || (*pp_found)->is_fptr != pp->is_fptr
3498 || (*pp_found)->argc != pp->argc
3499 || (*pp_found)->argc_reg != pp->argc_reg
3500 || (*pp_found)->argc_stack != pp->argc_stack)
3501 {
3502 ferr(po, "icall: parsed_proto mismatch\n");
3503 }
3504 *multi = 1;
3505 }
3506 if (pp != NULL) {
3507 *pp_found = pp;
3508 *pp_i = po - ops;
3509 }
3510}
3511
3512static void add_label_ref(struct label_ref *lr, int op_i)
3513{
3514 struct label_ref *lr_new;
3515
3516 if (lr->i == -1) {
3517 lr->i = op_i;
3518 return;
3519 }
3520
3521 lr_new = calloc(1, sizeof(*lr_new));
3522 lr_new->i = op_i;
3523 lr_new->next = lr->next;
3524 lr->next = lr_new;
3525}
3526
3527static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
3528{
3529 struct parsed_op *po = &ops[i];
3530 struct parsed_data *pd;
3531 char label[NAMELEN], *p;
3532 int len, j, l;
3533
3534 p = strchr(po->operand[0].name, '[');
3535 if (p == NULL)
3536 return NULL;
3537
3538 len = p - po->operand[0].name;
3539 strncpy(label, po->operand[0].name, len);
3540 label[len] = 0;
3541
3542 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3543 if (IS(g_func_pd[j].label, label)) {
3544 pd = &g_func_pd[j];
3545 break;
3546 }
3547 }
3548 if (pd == NULL)
3549 //ferr(po, "label '%s' not parsed?\n", label);
3550 return NULL;
3551
3552 if (pd->type != OPT_OFFSET)
3553 ferr(po, "label '%s' with non-offset data?\n", label);
3554
3555 // find all labels, link
3556 for (j = 0; j < pd->count; j++) {
3557 for (l = 0; l < opcnt; l++) {
3558 if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) {
3559 add_label_ref(&g_label_refs[l], i);
3560 pd->d[j].bt_i = l;
3561 break;
3562 }
3563 }
3564 }
3565
3566 return pd;
3567}
3568
3569static void clear_labels(int count)
3570{
3571 int i;
3572
3573 for (i = 0; i < count; i++) {
3574 if (g_labels[i] != NULL) {
3575 free(g_labels[i]);
3576 g_labels[i] = NULL;
3577 }
3578 }
3579}
3580
3581static int get_pp_arg_regmask_src(const struct parsed_proto *pp)
3582{
3583 int regmask = 0;
3584 int i, reg;
3585
3586 for (i = 0; i < pp->argc; i++) {
3587 if (pp->arg[i].reg != NULL) {
3588 reg = char_array_i(regs_r32,
3589 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
3590 if (reg < 0)
3591 ferr(ops, "arg '%s' of func '%s' is not a reg?\n",
3592 pp->arg[i].reg, pp->name);
3593 regmask |= 1 << reg;
3594 }
3595 }
3596
3597 return regmask;
3598}
3599
3600static int get_pp_arg_regmask_dst(const struct parsed_proto *pp)
3601{
3602 int regmask = 0;
3603 int i, reg;
3604
3605 if (pp->has_retreg) {
3606 for (i = 0; i < pp->argc; i++) {
3607 if (pp->arg[i].type.is_retreg) {
3608 reg = char_array_i(regs_r32,
3609 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
3610 ferr_assert(ops, reg >= 0);
3611 regmask |= 1 << reg;
3612 }
3613 }
3614 }
3615
3616 if (strstr(pp->ret_type.name, "int64"))
3617 return regmask | (1 << xAX) | (1 << xDX);
3618 if (IS(pp->ret_type.name, "float")
3619 || IS(pp->ret_type.name, "double"))
3620 {
3621 return regmask | mxST0;
3622 }
3623 if (strcasecmp(pp->ret_type.name, "void") == 0)
3624 return regmask;
3625
3626 return regmask | mxAX;
3627}
3628
3629static int are_ops_same(struct parsed_op *po1, struct parsed_op *po2)
3630{
3631 return po1->op == po2->op && po1->operand_cnt == po2->operand_cnt
3632 && memcmp(po1->operand, po2->operand,
3633 sizeof(po1->operand[0]) * po1->operand_cnt) == 0;
3634}
3635
3636static void resolve_branches_parse_calls(int opcnt)
3637{
3638 static const struct {
3639 const char *name;
3640 enum op_op op;
3641 unsigned int flags;
3642 unsigned int regmask_src;
3643 unsigned int regmask_dst;
3644 } pseudo_ops[] = {
3645 { "__allshl", OPP_ALLSHL, OPF_DATA, mxAX|mxDX|mxCX, mxAX|mxDX },
3646 { "__allshr", OPP_ALLSHR, OPF_DATA, mxAX|mxDX|mxCX, mxAX|mxDX },
3647 { "__ftol", OPP_FTOL, OPF_FPOP, mxST0, mxAX | mxDX },
3648 };
3649 const struct parsed_proto *pp_c;
3650 struct parsed_proto *pp;
3651 struct parsed_data *pd;
3652 struct parsed_op *po;
3653 const char *tmpname;
3654 int i, l;
3655 int ret;
3656
3657 for (i = 0; i < opcnt; i++)
3658 {
3659 po = &ops[i];
3660 po->bt_i = -1;
3661 po->btj = NULL;
3662
3663 if (po->datap != NULL) {
3664 pp = calloc(1, sizeof(*pp));
3665 my_assert_not(pp, NULL);
3666
3667 ret = parse_protostr(po->datap, pp);
3668 if (ret < 0)
3669 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3670 free(po->datap);
3671 po->datap = NULL;
3672 po->pp = pp;
3673 }
3674
3675 if (po->op == OP_CALL) {
3676 pp = NULL;
3677
3678 if (po->pp != NULL)
3679 pp = po->pp;
3680 else if (po->operand[0].type == OPT_LABEL)
3681 {
3682 tmpname = opr_name(po, 0);
3683 if (IS_START(tmpname, "loc_"))
3684 ferr(po, "call to loc_*\n");
3685 if (IS(tmpname, "__alloca_probe"))
3686 continue;
3687
3688 // convert some calls to pseudo-ops
3689 for (l = 0; l < ARRAY_SIZE(pseudo_ops); l++) {
3690 if (!IS(tmpname, pseudo_ops[l].name))
3691 continue;
3692
3693 po->op = pseudo_ops[l].op;
3694 po->operand_cnt = 0;
3695 po->regmask_src = pseudo_ops[l].regmask_src;
3696 po->regmask_dst = pseudo_ops[l].regmask_dst;
3697 po->flags = pseudo_ops[l].flags;
3698 po->flags |= po->regmask_dst ? OPF_DATA : 0;
3699 break;
3700 }
3701 if (l < ARRAY_SIZE(pseudo_ops))
3702 continue;
3703
3704 pp_c = proto_parse(g_fhdr, tmpname, g_header_mode);
3705 if (!g_header_mode && pp_c == NULL)
3706 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3707
3708 if (pp_c != NULL) {
3709 pp = proto_clone(pp_c);
3710 my_assert_not(pp, NULL);
3711 }
3712 }
3713
3714 if (pp != NULL) {
3715 if (pp->is_fptr)
3716 check_func_pp(po, pp, "fptr var call");
3717 if (pp->is_noreturn)
3718 po->flags |= OPF_TAIL;
3719 }
3720 po->pp = pp;
3721 continue;
3722 }
3723
3724 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3725 continue;
3726
3727 if (po->operand[0].type == OPT_REGMEM) {
3728 pd = try_resolve_jumptab(i, opcnt);
3729 if (pd == NULL)
3730 goto tailcall;
3731
3732 po->btj = pd;
3733 continue;
3734 }
3735
3736 for (l = 0; l < opcnt; l++) {
3737 if (g_labels[l] != NULL
3738 && IS(po->operand[0].name, g_labels[l]))
3739 {
3740 if (l == i + 1 && po->op == OP_JMP) {
3741 // yet another alignment type..
3742 po->flags |= OPF_RMD|OPF_DONE;
3743 break;
3744 }
3745 add_label_ref(&g_label_refs[l], i);
3746 po->bt_i = l;
3747 break;
3748 }
3749 }
3750
3751 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3752 continue;
3753
3754 if (po->operand[0].type == OPT_LABEL)
3755 // assume tail call
3756 goto tailcall;
3757
3758 ferr(po, "unhandled branch\n");
3759
3760tailcall:
3761 po->op = OP_CALL;
3762 po->flags |= OPF_TAIL;
3763 if (i > 0 && ops[i - 1].op == OP_POP)
3764 po->flags |= OPF_ATAIL;
3765 i--; // reprocess
3766 }
3767}
3768
3769static void scan_prologue_epilogue(int opcnt)
3770{
3771 int ecx_push = 0, esp_sub = 0, pusha = 0;
3772 int sandard_epilogue;
3773 int found;
3774 int i, j, l;
3775
3776 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
3777 && ops[1].op == OP_MOV
3778 && IS(opr_name(&ops[1], 0), "ebp")
3779 && IS(opr_name(&ops[1], 1), "esp"))
3780 {
3781 g_bp_frame = 1;
3782 ops[0].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3783 ops[1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3784 i = 2;
3785
3786 if (ops[i].op == OP_PUSHA) {
3787 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3788 pusha = 1;
3789 i++;
3790 }
3791
3792 if (ops[i].op == OP_SUB && IS(opr_name(&ops[i], 0), "esp")) {
3793 g_stack_fsz = opr_const(&ops[i], 1);
3794 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3795 i++;
3796 }
3797 else {
3798 // another way msvc builds stack frame..
3799 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3800 g_stack_fsz += 4;
3801 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3802 ecx_push++;
3803 i++;
3804 }
3805 // and another way..
3806 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3807 && ops[i].operand[1].type == OPT_CONST
3808 && ops[i + 1].op == OP_CALL
3809 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3810 {
3811 g_stack_fsz += ops[i].operand[1].val;
3812 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3813 i++;
3814 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3815 i++;
3816 }
3817 }
3818
3819 found = 0;
3820 do {
3821 for (; i < opcnt; i++)
3822 if (ops[i].flags & OPF_TAIL)
3823 break;
3824 j = i - 1;
3825 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3826 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3827 break;
3828 i--;
3829 j--;
3830 }
3831
3832 sandard_epilogue = 0;
3833 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
3834 {
3835 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3836 // the standard epilogue is sometimes even used without a sf
3837 if (ops[j - 1].op == OP_MOV
3838 && IS(opr_name(&ops[j - 1], 0), "esp")
3839 && IS(opr_name(&ops[j - 1], 1), "ebp"))
3840 sandard_epilogue = 1;
3841 }
3842 else if (ops[j].op == OP_LEAVE)
3843 {
3844 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3845 sandard_epilogue = 1;
3846 }
3847 else if (ops[i].op == OP_CALL && ops[i].pp != NULL
3848 && ops[i].pp->is_noreturn)
3849 {
3850 // on noreturn, msvc sometimes cleans stack, sometimes not
3851 i++;
3852 found = 1;
3853 continue;
3854 }
3855 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3856 ferr(&ops[j], "'pop ebp' expected\n");
3857
3858 if (g_stack_fsz != 0 || sandard_epilogue) {
3859 if (ops[j].op == OP_LEAVE)
3860 j--;
3861 else if (sandard_epilogue) // mov esp, ebp
3862 {
3863 ops[j - 1].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3864 j -= 2;
3865 }
3866 else if (!(g_ida_func_attr & IDAFA_NORETURN))
3867 {
3868 ferr(&ops[j], "esp restore expected\n");
3869 }
3870
3871 if (ecx_push && j >= 0 && ops[j].op == OP_POP
3872 && IS(opr_name(&ops[j], 0), "ecx"))
3873 {
3874 ferr(&ops[j], "unexpected ecx pop\n");
3875 }
3876 }
3877
3878 if (pusha) {
3879 if (ops[j].op == OP_POPA)
3880 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3881 else
3882 ferr(&ops[j], "popa expected\n");
3883 }
3884
3885 found = 1;
3886 i++;
3887 } while (i < opcnt);
3888
3889 if (!found)
3890 ferr(ops, "missing ebp epilogue\n");
3891 return;
3892 }
3893
3894 // non-bp frame
3895 i = 0;
3896 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3897 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3898 g_stack_fsz += 4;
3899 ecx_push++;
3900 i++;
3901 }
3902
3903 for (; i < opcnt; i++) {
3904 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
3905 break;
3906 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
3907 && ops[i].operand[1].type == OPT_CONST)
3908 {
3909 g_stack_fsz = ops[i].operand[1].val;
3910 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3911 i++;
3912 esp_sub = 1;
3913 break;
3914 }
3915 else if (ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
3916 && ops[i].operand[1].type == OPT_CONST
3917 && ops[i + 1].op == OP_CALL
3918 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
3919 {
3920 g_stack_fsz += ops[i].operand[1].val;
3921 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3922 i++;
3923 ops[i].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3924 i++;
3925 esp_sub = 1;
3926 break;
3927 }
3928 }
3929
3930 if (ecx_push && !esp_sub) {
3931 // could actually be args for a call..
3932 for (; i < opcnt; i++)
3933 if (ops[i].op != OP_PUSH)
3934 break;
3935
3936 if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) {
3937 const struct parsed_proto *pp;
3938 pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1);
3939 j = pp ? pp->argc_stack : 0;
3940 while (i > 0 && j > 0) {
3941 i--;
3942 if (ops[i].op == OP_PUSH) {
3943 ops[i].flags &= ~(OPF_RMD | OPF_DONE | OPF_NOREGS);
3944 j--;
3945 }
3946 }
3947 if (j != 0)
3948 ferr(&ops[i], "unhandled prologue\n");
3949
3950 // recheck
3951 i = g_stack_fsz = ecx_push = 0;
3952 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
3953 if (!(ops[i].flags & OPF_RMD))
3954 break;
3955 g_stack_fsz += 4;
3956 ecx_push++;
3957 i++;
3958 }
3959 }
3960 }
3961
3962 found = 0;
3963 if (ecx_push || esp_sub)
3964 {
3965 g_sp_frame = 1;
3966
3967 do {
3968 for (; i < opcnt; i++)
3969 if (ops[i].flags & OPF_TAIL)
3970 break;
3971
3972 j = i - 1;
3973 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
3974 if (ops[j].bt_i != -1 || ops[j].btj != NULL)
3975 break;
3976 i--;
3977 j--;
3978 }
3979
3980 if (ecx_push > 0) {
3981 for (l = 0; l < ecx_push; l++) {
3982 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx"))
3983 /* pop ecx */;
3984 else if (ops[j].op == OP_ADD
3985 && IS(opr_name(&ops[j], 0), "esp")
3986 && ops[j].operand[1].type == OPT_CONST)
3987 {
3988 /* add esp, N */
3989 l += ops[j].operand[1].val / 4 - 1;
3990 }
3991 else
3992 ferr(&ops[j], "'pop ecx' expected\n");
3993
3994 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
3995 j--;
3996 }
3997 if (l != ecx_push)
3998 ferr(&ops[j], "epilogue scan failed\n");
3999
4000 found = 1;
4001 }
4002
4003 if (esp_sub) {
4004 if (ops[j].op != OP_ADD
4005 || !IS(opr_name(&ops[j], 0), "esp")
4006 || ops[j].operand[1].type != OPT_CONST
4007 || ops[j].operand[1].val != g_stack_fsz)
4008 {
4009 if (ops[i].op == OP_CALL && ops[i].pp != NULL
4010 && ops[i].pp->is_noreturn)
4011 {
4012 // noreturn tailcall with no epilogue
4013 i++;
4014 continue;
4015 }
4016 ferr(&ops[j], "'add esp' expected\n");
4017 }
4018
4019 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_NOREGS;
4020 ops[j].operand[1].val = 0; // hack for stack arg scanner
4021 found = 1;
4022 }
4023
4024 i++;
4025 } while (i < opcnt);
4026
4027 if (!found)
4028 ferr(ops, "missing esp epilogue\n");
4029 }
4030}
4031
4032// find an instruction that changed opr before i op
4033// *op_i must be set to -1 by the caller
4034// *is_caller is set to 1 if one source is determined to be g_func arg
4035// returns 1 if found, *op_i is then set to origin
4036// returns -1 if multiple origins are found
4037static int resolve_origin(int i, const struct parsed_opr *opr,
4038 int magic, int *op_i, int *is_caller)
4039{
4040 struct label_ref *lr;
4041 int ret = 0;
4042
4043 while (1) {
4044 if (g_labels[i] != NULL) {
4045 lr = &g_label_refs[i];
4046 for (; lr != NULL; lr = lr->next) {
4047 check_i(&ops[i], lr->i);
4048 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
4049 }
4050 if (i > 0 && LAST_OP(i - 1))
4051 return ret;
4052 }
4053
4054 i--;
4055 if (i < 0) {
4056 if (is_caller != NULL)
4057 *is_caller = 1;
4058 return -1;
4059 }
4060
4061 if (ops[i].cc_scratch == magic)
4062 return ret;
4063 ops[i].cc_scratch = magic;
4064
4065 if (!(ops[i].flags & OPF_DATA))
4066 continue;
4067 if (!is_opr_modified(opr, &ops[i]))
4068 continue;
4069
4070 if (*op_i >= 0) {
4071 if (*op_i == i || are_ops_same(&ops[*op_i], &ops[i]))
4072 return ret | 1;
4073
4074 return -1;
4075 }
4076
4077 *op_i = i;
4078 return ret | 1;
4079 }
4080}
4081
4082// find an instruction that previously referenced opr
4083// if multiple results are found - fail
4084// *op_i must be set to -1 by the caller
4085// returns 1 if found, *op_i is then set to referencer insn
4086static int resolve_last_ref(int i, const struct parsed_opr *opr,
4087 int magic, int *op_i)
4088{
4089 struct label_ref *lr;
4090 int ret = 0;
4091
4092 while (1) {
4093 if (g_labels[i] != NULL) {
4094 lr = &g_label_refs[i];
4095 for (; lr != NULL; lr = lr->next) {
4096 check_i(&ops[i], lr->i);
4097 ret |= resolve_last_ref(lr->i, opr, magic, op_i);
4098 }
4099 if (i > 0 && LAST_OP(i - 1))
4100 return ret;
4101 }
4102
4103 i--;
4104 if (i < 0)
4105 return -1;
4106
4107 if (ops[i].cc_scratch == magic)
4108 return 0;
4109 ops[i].cc_scratch = magic;
4110
4111 if (!is_opr_referenced(opr, &ops[i]))
4112 continue;
4113
4114 if (*op_i >= 0)
4115 return -1;
4116
4117 *op_i = i;
4118 return 1;
4119 }
4120}
4121
4122// adjust datap of all reachable 'op' insns when moving back
4123// returns 1 if at least 1 op was found
4124// returns -1 if path without an op was found
4125static int adjust_prev_op(int i, enum op_op op, int magic, void *datap)
4126{
4127 struct label_ref *lr;
4128 int ret = 0;
4129
4130 if (ops[i].cc_scratch == magic)
4131 return 0;
4132 ops[i].cc_scratch = magic;
4133
4134 while (1) {
4135 if (g_labels[i] != NULL) {
4136 lr = &g_label_refs[i];
4137 for (; lr != NULL; lr = lr->next) {
4138 check_i(&ops[i], lr->i);
4139 ret |= adjust_prev_op(lr->i, op, magic, datap);
4140 }
4141 if (i > 0 && LAST_OP(i - 1))
4142 return ret;
4143 }
4144
4145 i--;
4146 if (i < 0)
4147 return -1;
4148
4149 if (ops[i].cc_scratch == magic)
4150 return 0;
4151 ops[i].cc_scratch = magic;
4152
4153 if (ops[i].op != op)
4154 continue;
4155
4156 ops[i].datap = datap;
4157 return 1;
4158 }
4159}
4160
4161// find next instruction that reads opr
4162// *op_i must be set to -1 by the caller
4163// on return, *op_i is set to first referencer insn
4164// returns 1 if exactly 1 referencer is found
4165static int find_next_read(int i, int opcnt,
4166 const struct parsed_opr *opr, int magic, int *op_i)
4167{
4168 struct parsed_op *po;
4169 int j, ret = 0;
4170
4171 for (; i < opcnt; i++)
4172 {
4173 if (ops[i].cc_scratch == magic)
4174 return ret;
4175 ops[i].cc_scratch = magic;
4176
4177 po = &ops[i];
4178 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
4179 if (po->btj != NULL) {
4180 // jumptable
4181 for (j = 0; j < po->btj->count; j++) {
4182 check_i(po, po->btj->d[j].bt_i);
4183 ret |= find_next_read(po->btj->d[j].bt_i, opcnt, opr,
4184 magic, op_i);
4185 }
4186 return ret;
4187 }
4188
4189 if (po->flags & OPF_RMD)
4190 continue;
4191 check_i(po, po->bt_i);
4192 if (po->flags & OPF_CJMP) {
4193 ret |= find_next_read(po->bt_i, opcnt, opr, magic, op_i);
4194 if (ret < 0)
4195 return ret;
4196 }
4197 else
4198 i = po->bt_i - 1;
4199 continue;
4200 }
4201
4202 if (!is_opr_read(opr, po)) {
4203 int full_opr = 1;
4204 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG
4205 && opr->reg == po->operand[0].reg && (po->flags & OPF_DATA))
4206 {
4207 full_opr = po->operand[0].lmod >= opr->lmod;
4208 }
4209 if (is_opr_modified(opr, po) && full_opr) {
4210 // it's overwritten
4211 return ret;
4212 }
4213 if (po->flags & OPF_TAIL)
4214 return ret;
4215 continue;
4216 }
4217
4218 if (*op_i >= 0)
4219 return -1;
4220
4221 *op_i = i;
4222 return 1;
4223 }
4224
4225 return 0;
4226}
4227
4228// find next instruction that reads opr
4229// *op_i must be set to -1 by the caller
4230// on return, *op_i is set to first flag user insn
4231// returns 1 if exactly 1 flag user is found
4232static int find_next_flag_use(int i, int opcnt, int magic, int *op_i)
4233{
4234 struct parsed_op *po;
4235 int j, ret = 0;
4236
4237 for (; i < opcnt; i++)
4238 {
4239 if (ops[i].cc_scratch == magic)
4240 return ret;
4241 ops[i].cc_scratch = magic;
4242
4243 po = &ops[i];
4244 if (po->op == OP_CALL)
4245 return -1;
4246 if (po->flags & OPF_JMP) {
4247 if (po->btj != NULL) {
4248 // jumptable
4249 for (j = 0; j < po->btj->count; j++) {
4250 check_i(po, po->btj->d[j].bt_i);
4251 ret |= find_next_flag_use(po->btj->d[j].bt_i, opcnt,
4252 magic, op_i);
4253 }
4254 return ret;
4255 }
4256
4257 if (po->flags & OPF_RMD)
4258 continue;
4259 check_i(po, po->bt_i);
4260 if (po->flags & OPF_CJMP)
4261 goto found;
4262 else
4263 i = po->bt_i - 1;
4264 continue;
4265 }
4266
4267 if (!(po->flags & OPF_CC)) {
4268 if (po->flags & OPF_FLAGS)
4269 // flags changed
4270 return ret;
4271 if (po->flags & OPF_TAIL)
4272 return ret;
4273 continue;
4274 }
4275
4276found:
4277 if (*op_i >= 0)
4278 return -1;
4279
4280 *op_i = i;
4281 return 1;
4282 }
4283
4284 return 0;
4285}
4286
4287static int try_resolve_const(int i, const struct parsed_opr *opr,
4288 int magic, unsigned int *val)
4289{
4290 int s_i = -1;
4291 int ret;
4292
4293 ret = resolve_origin(i, opr, magic, &s_i, NULL);
4294 if (ret == 1) {
4295 i = s_i;
4296 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
4297 return -1;
4298
4299 *val = ops[i].operand[1].val;
4300 return 1;
4301 }
4302
4303 return -1;
4304}
4305
4306static int resolve_used_bits(int i, int opcnt, int reg,
4307 int *mask, int *is_z_check)
4308{
4309 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_WORD, reg);
4310 int j = -1, k = -1;
4311 int ret;
4312
4313 ret = find_next_read(i, opcnt, &opr, i + opcnt * 20, &j);
4314 if (ret != 1)
4315 return -1;
4316
4317 find_next_read(j + 1, opcnt, &opr, i + opcnt * 20 + 1, &k);
4318 if (k != -1) {
4319 fnote(&ops[j], "(first read)\n");
4320 ferr(&ops[k], "TODO: bit resolve: multiple readers\n");
4321 }
4322
4323 if (ops[j].op != OP_TEST || ops[j].operand[1].type != OPT_CONST)
4324 ferr(&ops[j], "TODO: bit resolve: not a const test\n");
4325
4326 ferr_assert(&ops[j], ops[j].operand[0].type == OPT_REG);
4327 ferr_assert(&ops[j], ops[j].operand[0].reg == reg);
4328
4329 *mask = ops[j].operand[1].val;
4330 if (ops[j].operand[0].lmod == OPLM_BYTE
4331 && ops[j].operand[0].name[1] == 'h')
4332 {
4333 *mask <<= 8;
4334 }
4335 ferr_assert(&ops[j], (*mask & ~0xffff) == 0);
4336
4337 *is_z_check = 0;
4338 ret = find_next_flag_use(j + 1, opcnt, i + opcnt * 20 + 2, &k);
4339 if (ret == 1)
4340 *is_z_check = ops[k].pfo == PFO_Z;
4341
4342 return 0;
4343}
4344
4345static const struct parsed_proto *resolve_deref(int i, int magic,
4346 struct parsed_opr *opr, int level)
4347{
4348 struct parsed_opr opr_s = OPR_INIT(OPT_REG, OPLM_DWORD, 0);
4349 const struct parsed_proto *pp = NULL;
4350 int from_caller = 0;
4351 char s_reg[4];
4352 int offset = 0;
4353 int len = 0;
4354 int j = -1;
4355 int k = -1;
4356 int reg;
4357 int ret;
4358
4359 ret = sscanf(opr->name, "%3s+%x%n", s_reg, &offset, &len);
4360 if (ret != 2 || len != strlen(opr->name)) {
4361 ret = sscanf(opr->name, "%3s%n", s_reg, &len);
4362 if (ret != 1 || len != strlen(opr->name))
4363 return NULL;
4364 }
4365
4366 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s_reg);
4367 if (reg < 0)
4368 return NULL;
4369
4370 opr_s.reg = reg;
4371 ret = resolve_origin(i, &opr_s, i + magic, &j, NULL);
4372 if (ret != 1)
4373 return NULL;
4374
4375 if (ops[j].op == OP_MOV && ops[j].operand[1].type == OPT_REGMEM
4376 && strlen(ops[j].operand[1].name) == 3
4377 && ops[j].operand[0].lmod == OPLM_DWORD
4378 && ops[j].pp == NULL // no hint
4379 && level == 0)
4380 {
4381 // allow one simple dereference (com/directx)
4382 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32),
4383 ops[j].operand[1].name);
4384 if (reg < 0)
4385 return NULL;
4386 opr_s.reg = reg;
4387 ret = resolve_origin(j, &opr_s, j + magic, &k, NULL);
4388 if (ret != 1)
4389 return NULL;
4390 j = k;
4391 }
4392 if (ops[j].op != OP_MOV || ops[j].operand[0].lmod != OPLM_DWORD)
4393 return NULL;
4394
4395 if (ops[j].pp != NULL) {
4396 // type hint in asm
4397 pp = ops[j].pp;
4398 }
4399 else if (ops[j].operand[1].type == OPT_REGMEM) {
4400 pp = try_recover_pp(&ops[j], &ops[j].operand[1], 0, NULL);
4401 if (pp == NULL) {
4402 // maybe structure ptr in structure
4403 pp = resolve_deref(j, magic, &ops[j].operand[1], level + 1);
4404 }
4405 }
4406 else if (ops[j].operand[1].type == OPT_LABEL)
4407 pp = proto_parse(g_fhdr, ops[j].operand[1].name, g_quiet_pp);
4408 else if (ops[j].operand[1].type == OPT_REG) {
4409 // maybe arg reg?
4410 k = -1;
4411 ret = resolve_origin(j, &ops[j].operand[1], i + magic,
4412 &k, &from_caller);
4413 if (ret != 1 && from_caller && k == -1 && g_func_pp != NULL) {
4414 for (k = 0; k < g_func_pp->argc; k++) {
4415 if (g_func_pp->arg[k].reg == NULL)
4416 continue;
4417 if (IS(g_func_pp->arg[k].reg, ops[j].operand[1].name)) {
4418 pp = g_func_pp->arg[k].pp;
4419 break;
4420 }
4421 }
4422 }
4423 }
4424
4425 if (pp == NULL)
4426 return NULL;
4427 if (pp->is_func || pp->is_fptr || !pp->type.is_struct) {
4428 if (offset != 0)
4429 ferr(&ops[j], "expected struct, got '%s %s'\n",
4430 pp->type.name, pp->name);
4431 return NULL;
4432 }
4433
4434 return proto_lookup_struct(g_fhdr, pp->type.name, offset);
4435}
4436
4437static const struct parsed_proto *resolve_icall(int i, int opcnt,
4438 int *pp_i, int *multi_src)
4439{
4440 const struct parsed_proto *pp = NULL;
4441 int search_advice = 0;
4442
4443 *multi_src = 0;
4444 *pp_i = -1;
4445
4446 switch (ops[i].operand[0].type) {
4447 case OPT_REGMEM:
4448 // try to resolve struct member calls
4449 pp = resolve_deref(i, i + opcnt * 19, &ops[i].operand[0], 0);
4450 if (pp != NULL)
4451 break;
4452 // fallthrough
4453 case OPT_LABEL:
4454 case OPT_OFFSET:
4455 pp = try_recover_pp(&ops[i], &ops[i].operand[0],
4456 1, &search_advice);
4457 if (!search_advice)
4458 break;
4459 // fallthrough
4460 default:
4461 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
4462 pp_i, multi_src);
4463 break;
4464 }
4465
4466 return pp;
4467}
4468
4469static struct parsed_proto *process_call_early(int i, int opcnt,
4470 int *adj_i)
4471{
4472 struct parsed_op *po = &ops[i];
4473 struct parsed_proto *pp;
4474 int multipath = 0;
4475 int adj = 0;
4476 int j, ret;
4477
4478 pp = po->pp;
4479 if (pp == NULL || pp->is_vararg || pp->argc_reg != 0)
4480 // leave for later
4481 return NULL;
4482
4483 // look for and make use of esp adjust
4484 *adj_i = ret = -1;
4485 if (!pp->is_stdcall && pp->argc_stack > 0)
4486 ret = scan_for_esp_adjust(i + 1, opcnt,
4487 pp->argc_stack * 4, &adj, &multipath, 0);
4488 if (ret >= 0) {
4489 if (pp->argc_stack > adj / 4)
4490 return NULL;
4491 if (multipath)
4492 return NULL;
4493 if (ops[ret].op == OP_POP) {
4494 for (j = 1; j < adj / 4; j++) {
4495 if (ops[ret + j].op != OP_POP
4496 || ops[ret + j].operand[0].reg != xCX)
4497 {
4498 return NULL;
4499 }
4500 }
4501 }
4502 }
4503
4504 *adj_i = ret;
4505 return pp;
4506}
4507
4508static struct parsed_proto *process_call(int i, int opcnt)
4509{
4510 struct parsed_op *po = &ops[i];
4511 const struct parsed_proto *pp_c;
4512 struct parsed_proto *pp;
4513 const char *tmpname;
4514 int call_i = -1, ref_i = -1;
4515 int adj = 0, multipath = 0;
4516 int ret, arg;
4517
4518 tmpname = opr_name(po, 0);
4519 pp = po->pp;
4520 if (pp == NULL)
4521 {
4522 // indirect call
4523 pp_c = resolve_icall(i, opcnt, &call_i, &multipath);
4524 if (pp_c != NULL) {
4525 if (!pp_c->is_func && !pp_c->is_fptr)
4526 ferr(po, "call to non-func: %s\n", pp_c->name);
4527 pp = proto_clone(pp_c);
4528 my_assert_not(pp, NULL);
4529 if (multipath)
4530 // not resolved just to single func
4531 pp->is_fptr = 1;
4532
4533 switch (po->operand[0].type) {
4534 case OPT_REG:
4535 // we resolved this call and no longer need the register
4536 po->regmask_src &= ~(1 << po->operand[0].reg);
4537
4538 if (!multipath && i != call_i && ops[call_i].op == OP_MOV
4539 && ops[call_i].operand[1].type == OPT_LABEL)
4540 {
4541 // no other source users?
4542 ret = resolve_last_ref(i, &po->operand[0], i + opcnt * 10,
4543 &ref_i);
4544 if (ret == 1 && call_i == ref_i) {
4545 // and nothing uses it after us?
4546 ref_i = -1;
4547 find_next_read(i + 1, opcnt, &po->operand[0],
4548 i + opcnt * 11, &ref_i);
4549 if (ref_i == -1)
4550 // then also don't need the source mov
4551 ops[call_i].flags |= OPF_RMD | OPF_NOREGS;
4552 }
4553 }
4554 break;
4555 case OPT_REGMEM:
4556 pp->is_fptr = 1;
4557 break;
4558 default:
4559 break;
4560 }
4561 }
4562 if (pp == NULL) {
4563 pp = calloc(1, sizeof(*pp));
4564 my_assert_not(pp, NULL);
4565
4566 pp->is_fptr = 1;
4567 ret = scan_for_esp_adjust(i + 1, opcnt,
4568 -1, &adj, &multipath, 0);
4569 if (ret < 0 || adj < 0) {
4570 if (!g_allow_regfunc)
4571 ferr(po, "non-__cdecl indirect call unhandled yet\n");
4572 pp->is_unresolved = 1;
4573 adj = 0;
4574 }
4575 adj /= 4;
4576 if (adj > ARRAY_SIZE(pp->arg))
4577 ferr(po, "esp adjust too large: %d\n", adj);
4578 pp->ret_type.name = strdup("int");
4579 pp->argc = pp->argc_stack = adj;
4580 for (arg = 0; arg < pp->argc; arg++)
4581 pp->arg[arg].type.name = strdup("int");
4582 }
4583 po->pp = pp;
4584 }
4585
4586 // look for and make use of esp adjust
4587 multipath = 0;
4588 ret = -1;
4589 if (!pp->is_stdcall && pp->argc_stack > 0) {
4590 int adj_expect = pp->is_vararg ? -1 : pp->argc_stack * 4;
4591 ret = scan_for_esp_adjust(i + 1, opcnt,
4592 adj_expect, &adj, &multipath, 0);
4593 }
4594 if (ret >= 0) {
4595 if (pp->is_vararg) {
4596 if (adj / 4 < pp->argc_stack) {
4597 fnote(po, "(this call)\n");
4598 ferr(&ops[ret], "esp adjust is too small: %x < %x\n",
4599 adj, pp->argc_stack * 4);
4600 }
4601 // modify pp to make it have varargs as normal args
4602 arg = pp->argc;
4603 pp->argc += adj / 4 - pp->argc_stack;
4604 for (; arg < pp->argc; arg++) {
4605 pp->arg[arg].type.name = strdup("int");
4606 pp->argc_stack++;
4607 }
4608 if (pp->argc > ARRAY_SIZE(pp->arg))
4609 ferr(po, "too many args for '%s'\n", tmpname);
4610 }
4611 if (pp->argc_stack > adj / 4) {
4612 fnote(po, "(this call)\n");
4613 ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n",
4614 tmpname, pp->argc_stack * 4, adj);
4615 }
4616
4617 scan_for_esp_adjust(i + 1, opcnt,
4618 pp->argc_stack * 4, &adj, &multipath, 1);
4619 }
4620 else if (pp->is_vararg)
4621 ferr(po, "missing esp_adjust for vararg func '%s'\n",
4622 pp->name);
4623
4624 return pp;
4625}
4626
4627static int collect_call_args_no_push(int i, struct parsed_proto *pp,
4628 int *regmask_ffca)
4629{
4630 struct parsed_op *po;
4631 int offset = 0;
4632 int base_arg;
4633 int j, arg;
4634 int ret;
4635
4636 for (base_arg = 0; base_arg < pp->argc; base_arg++)
4637 if (pp->arg[base_arg].reg == NULL)
4638 break;
4639
4640 for (j = i; j > 0; )
4641 {
4642 ferr_assert(&ops[j], g_labels[j] == NULL);
4643 j--;
4644
4645 po = &ops[j];
4646 ferr_assert(po, po->op != OP_PUSH);
4647 if (po->op == OP_FST)
4648 {
4649 if (po->operand[0].type != OPT_REGMEM)
4650 continue;
4651 ret = parse_stack_esp_offset(po, po->operand[0].name, &offset);
4652 if (ret != 0)
4653 continue;
4654 if (offset < 0 || offset >= pp->argc_stack * 4 || (offset & 3))
4655 ferr(po, "bad offset %d (%d args)\n", offset, pp->argc_stack);
4656
4657 arg = base_arg + offset / 4;
4658 po->p_argnext = -1;
4659 po->p_argnum = arg + 1;
4660 ferr_assert(po, pp->arg[arg].datap == NULL);
4661 pp->arg[arg].datap = po;
4662 po->flags |= OPF_DONE | OPF_FARGNR | OPF_FARG;
4663 if (regmask_ffca != NULL)
4664 *regmask_ffca |= 1 << arg;
4665 }
4666 else if (po->op == OP_SUB && po->operand[0].reg == xSP
4667 && po->operand[1].type == OPT_CONST)
4668 {
4669 po->flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
4670 break;
4671 }
4672 }
4673
4674 for (arg = base_arg; arg < pp->argc; arg++) {
4675 ferr_assert(&ops[i], pp->arg[arg].reg == NULL);
4676 po = pp->arg[arg].datap;
4677 if (po == NULL)
4678 ferr(&ops[i], "arg %d/%d not found\n", arg, pp->argc);
4679 if (po->operand[0].lmod == OPLM_QWORD)
4680 arg++;
4681 }
4682
4683 return 0;
4684}
4685
4686static int collect_call_args_early(int i, struct parsed_proto *pp,
4687 int *regmask, int *regmask_ffca)
4688{
4689 struct parsed_op *po;
4690 int arg, ret;
4691 int j;
4692
4693 for (arg = 0; arg < pp->argc; arg++)
4694 if (pp->arg[arg].reg == NULL)
4695 break;
4696
4697 // first see if it can be easily done
4698 for (j = i; j > 0 && arg < pp->argc; )
4699 {
4700 if (g_labels[j] != NULL)
4701 return -1;
4702 j--;
4703
4704 po = &ops[j];
4705 if (po->op == OP_CALL)
4706 return -1;
4707 else if (po->op == OP_ADD && po->operand[0].reg == xSP)
4708 return -1;
4709 else if (po->op == OP_POP)
4710 return -1;
4711 else if (po->flags & OPF_CJMP)
4712 return -1;
4713 else if (po->op == OP_PUSH) {
4714 if (po->flags & (OPF_FARG|OPF_FARGNR))
4715 return -1;
4716 if (!g_header_mode) {
4717 ret = scan_for_mod(po, j + 1, i, 1);
4718 if (ret >= 0)
4719 return -1;
4720 }
4721
4722 if (pp->arg[arg].type.is_va_list)
4723 return -1;
4724
4725 // next arg
4726 for (arg++; arg < pp->argc; arg++)
4727 if (pp->arg[arg].reg == NULL)
4728 break;
4729 }
4730 else if (po->op == OP_SUB && po->operand[0].reg == xSP
4731 && po->operand[1].type == OPT_CONST)
4732 {
4733 if (po->flags & (OPF_RMD|OPF_DONE))
4734 return -1;
4735 if (po->operand[1].val != pp->argc_stack * 4)
4736 ferr(po, "unexpected esp adjust: %d\n",
4737 po->operand[1].val * 4);
4738 ferr_assert(po, pp->argc - arg == pp->argc_stack);
4739 return collect_call_args_no_push(i, pp, regmask_ffca);
4740 }
4741 }
4742
4743 if (arg < pp->argc)
4744 return -1;
4745
4746 // now do it
4747 for (arg = 0; arg < pp->argc; arg++)
4748 if (pp->arg[arg].reg == NULL)
4749 break;
4750
4751 for (j = i; j > 0 && arg < pp->argc; )
4752 {
4753 j--;
4754
4755 if (ops[j].op == OP_PUSH)
4756 {
4757 ops[j].p_argnext = -1;
4758 ferr_assert(&ops[j], pp->arg[arg].datap == NULL);
4759 pp->arg[arg].datap = &ops[j];
4760
4761 if (regmask != NULL && ops[j].operand[0].type == OPT_REG)
4762 *regmask |= 1 << ops[j].operand[0].reg;
4763
4764 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
4765 ops[j].flags &= ~OPF_RSAVE;
4766
4767 // next arg
4768 for (arg++; arg < pp->argc; arg++)
4769 if (pp->arg[arg].reg == NULL)
4770 break;
4771 }
4772 }
4773
4774 return 0;
4775}
4776
4777static int collect_call_args_r(struct parsed_op *po, int i,
4778 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
4779 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
4780{
4781 struct parsed_proto *pp_tmp;
4782 struct parsed_op *po_tmp;
4783 struct label_ref *lr;
4784 int need_to_save_current;
4785 int arg_grp_current = 0;
4786 int save_args_seen = 0;
4787 int save_args;
4788 int ret = 0;
4789 int reg;
4790 char buf[32];
4791 int j, k;
4792
4793 if (i < 0) {
4794 ferr(po, "dead label encountered\n");
4795 return -1;
4796 }
4797
4798 for (; arg < pp->argc; arg++)
4799 if (pp->arg[arg].reg == NULL)
4800 break;
4801 magic = (magic & 0xffffff) | (arg << 24);
4802
4803 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
4804 {
4805 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
4806 if (ops[j].cc_scratch != magic) {
4807 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
4808 pp->name);
4809 return -1;
4810 }
4811 // ok: have already been here
4812 return 0;
4813 }
4814 ops[j].cc_scratch = magic;
4815
4816 if (g_labels[j] != NULL && g_label_refs[j].i != -1) {
4817 lr = &g_label_refs[j];
4818 if (lr->next != NULL)
4819 need_op_saving = 1;
4820 for (; lr->next; lr = lr->next) {
4821 check_i(&ops[j], lr->i);
4822 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4823 may_reuse = 1;
4824 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4825 arg_grp, arg, magic, need_op_saving, may_reuse);
4826 if (ret < 0)
4827 return ret;
4828 }
4829
4830 check_i(&ops[j], lr->i);
4831 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
4832 may_reuse = 1;
4833 if (j > 0 && LAST_OP(j - 1)) {
4834 // follow last branch in reverse
4835 j = lr->i;
4836 continue;
4837 }
4838 need_op_saving = 1;
4839 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
4840 arg_grp, arg, magic, need_op_saving, may_reuse);
4841 if (ret < 0)
4842 return ret;
4843 }
4844 j--;
4845
4846 if (ops[j].op == OP_CALL)
4847 {
4848 if (pp->is_unresolved)
4849 break;
4850
4851 pp_tmp = ops[j].pp;
4852 if (pp_tmp == NULL)
4853 ferr(po, "arg collect hit unparsed call '%s'\n",
4854 ops[j].operand[0].name);
4855 if (may_reuse && pp_tmp->argc_stack > 0)
4856 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
4857 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
4858 }
4859 // esp adjust of 0 means we collected it before
4860 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
4861 && (ops[j].operand[1].type != OPT_CONST
4862 || ops[j].operand[1].val != 0))
4863 {
4864 if (pp->is_unresolved)
4865 break;
4866
4867 fnote(po, "(this call)\n");
4868 ferr(&ops[j], "arg collect %d/%d hit esp adjust of %d\n",
4869 arg, pp->argc, ops[j].operand[1].val);
4870 }
4871 else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_DONE))
4872 {
4873 if (pp->is_unresolved)
4874 break;
4875
4876 fnote(po, "(this call)\n");
4877 ferr(&ops[j], "arg collect %d/%d hit pop\n", arg, pp->argc);
4878 }
4879 else if (ops[j].flags & OPF_CJMP)
4880 {
4881 if (pp->is_unresolved)
4882 break;
4883
4884 may_reuse = 1;
4885 }
4886 else if (ops[j].op == OP_PUSH
4887 && !(ops[j].flags & (OPF_FARGNR|OPF_DONE)))
4888 {
4889 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
4890 break;
4891
4892 ops[j].p_argnext = -1;
4893 po_tmp = pp->arg[arg].datap;
4894 if (po_tmp != NULL)
4895 ops[j].p_argnext = po_tmp - ops;
4896 pp->arg[arg].datap = &ops[j];
4897
4898 need_to_save_current = 0;
4899 save_args = 0;
4900 reg = -1;
4901 if (ops[j].operand[0].type == OPT_REG)
4902 reg = ops[j].operand[0].reg;
4903
4904 if (!need_op_saving) {
4905 ret = scan_for_mod(&ops[j], j + 1, i, 1);
4906 need_to_save_current = (ret >= 0);
4907 }
4908 if (need_op_saving || need_to_save_current) {
4909 // mark this push as one that needs operand saving
4910 ops[j].flags &= ~OPF_RMD;
4911 if (ops[j].p_argnum == 0) {
4912 ops[j].p_argnum = arg + 1;
4913 save_args |= 1 << arg;
4914 }
4915 else if (ops[j].p_argnum < arg + 1) {
4916 // XXX: might kill valid var..
4917 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
4918 ops[j].p_argnum = arg + 1;
4919 save_args |= 1 << arg;
4920 }
4921
4922 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
4923 save_args_seen = 0;
4924 arg_grp_current++;
4925 if (arg_grp_current >= MAX_ARG_GRP)
4926 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
4927 ops[j].p_argnum, pp->name);
4928 }
4929 }
4930 else if (ops[j].p_argnum == 0)
4931 ops[j].flags |= OPF_RMD;
4932
4933 // some PUSHes are reused by different calls on other branches,
4934 // but that can't happen if we didn't branch, so they
4935 // can be removed from future searches (handles nested calls)
4936 if (!may_reuse)
4937 ops[j].flags |= OPF_FARGNR;
4938
4939 ops[j].flags |= OPF_FARG;
4940 ops[j].flags &= ~OPF_RSAVE;
4941
4942 // check for __VALIST
4943 if (!pp->is_unresolved && g_func_pp != NULL
4944 && pp->arg[arg].type.is_va_list)
4945 {
4946 k = -1;
4947 ret = resolve_origin(j, &ops[j].operand[0],
4948 magic + 1, &k, NULL);
4949 if (ret == 1 && k >= 0)
4950 {
4951 if (ops[k].op == OP_LEA) {
4952 if (!g_func_pp->is_vararg)
4953 ferr(&ops[k], "lea <arg> used, but %s is not vararg?\n",
4954 g_func_pp->name);
4955
4956 snprintf(buf, sizeof(buf), "arg_%X",
4957 g_func_pp->argc_stack * 4);
4958 if (strstr(ops[k].operand[1].name, buf)
4959 || strstr(ops[k].operand[1].name, "arglist"))
4960 {
4961 ops[k].flags |= OPF_RMD | OPF_NOREGS | OPF_DONE;
4962 ops[j].flags |= OPF_RMD | OPF_NOREGS | OPF_VAPUSH;
4963 save_args &= ~(1 << arg);
4964 reg = -1;
4965 }
4966 else
4967 ferr(&ops[k], "va_list arg detection failed\n");
4968 }
4969 // check for va_list from g_func_pp arg too
4970 else if (ops[k].op == OP_MOV
4971 && is_stack_access(&ops[k], &ops[k].operand[1]))
4972 {
4973 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
4974 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
4975 if (ret >= 0) {
4976 ops[k].flags |= OPF_RMD | OPF_DONE;
4977 ops[j].flags |= OPF_RMD;
4978 ops[j].p_argpass = ret + 1;
4979 save_args &= ~(1 << arg);
4980 reg = -1;
4981 }
4982 }
4983 }
4984 }
4985
4986 *save_arg_vars |= save_args;
4987
4988 // tracking reg usage
4989 if (reg >= 0)
4990 *regmask |= 1 << reg;
4991
4992 arg++;
4993 if (!pp->is_unresolved) {
4994 // next arg
4995 for (; arg < pp->argc; arg++)
4996 if (pp->arg[arg].reg == NULL)
4997 break;
4998 }
4999 magic = (magic & 0xffffff) | (arg << 24);
5000 }
5001
5002 if (ops[j].p_arggrp > arg_grp_current) {
5003 save_args_seen = 0;
5004 arg_grp_current = ops[j].p_arggrp;
5005 }
5006 if (ops[j].p_argnum > 0)
5007 save_args_seen |= 1 << (ops[j].p_argnum - 1);
5008 }
5009
5010 if (arg < pp->argc) {
5011 ferr(po, "arg collect failed for '%s': %d/%d\n",
5012 pp->name, arg, pp->argc);
5013 return -1;
5014 }
5015
5016 if (arg_grp_current > *arg_grp)
5017 *arg_grp = arg_grp_current;
5018
5019 return arg;
5020}
5021
5022static int collect_call_args(struct parsed_op *po, int i,
5023 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
5024 int magic)
5025{
5026 // arg group is for cases when pushes for
5027 // multiple funcs are going on
5028 struct parsed_op *po_tmp;
5029 int save_arg_vars_current = 0;
5030 int arg_grp = 0;
5031 int ret;
5032 int a;
5033
5034 ret = collect_call_args_r(po, i, pp, regmask,
5035 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
5036 if (ret < 0)
5037 return ret;
5038
5039 if (arg_grp != 0) {
5040 // propagate arg_grp
5041 for (a = 0; a < pp->argc; a++) {
5042 if (pp->arg[a].reg != NULL)
5043 continue;
5044
5045 po_tmp = pp->arg[a].datap;
5046 while (po_tmp != NULL) {
5047 po_tmp->p_arggrp = arg_grp;
5048 if (po_tmp->p_argnext > 0)
5049 po_tmp = &ops[po_tmp->p_argnext];
5050 else
5051 po_tmp = NULL;
5052 }
5053 }
5054 }
5055 save_arg_vars[arg_grp] |= save_arg_vars_current;
5056
5057 if (pp->is_unresolved) {
5058 pp->argc += ret;
5059 pp->argc_stack += ret;
5060 for (a = 0; a < pp->argc; a++)
5061 if (pp->arg[a].type.name == NULL)
5062 pp->arg[a].type.name = strdup("int");
5063 }
5064
5065 return ret;
5066}
5067
5068static void reg_use_pass(int i, int opcnt, unsigned char *cbits,
5069 int regmask_now, int *regmask,
5070 int regmask_save_now, int *regmask_save,
5071 int *regmask_init, int regmask_arg)
5072{
5073 struct parsed_op *po;
5074 int already_saved;
5075 int regmask_new;
5076 int regmask_op;
5077 int flags_set;
5078 int ret, reg;
5079 int j;
5080
5081 for (; i < opcnt; i++)
5082 {
5083 po = &ops[i];
5084 if (cbits[i >> 3] & (1 << (i & 7)))
5085 return;
5086 cbits[i >> 3] |= (1 << (i & 7));
5087
5088 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
5089 if (po->flags & (OPF_RMD|OPF_DONE))
5090 continue;
5091 if (po->btj != NULL) {
5092 for (j = 0; j < po->btj->count; j++) {
5093 check_i(po, po->btj->d[j].bt_i);
5094 reg_use_pass(po->btj->d[j].bt_i, opcnt, cbits,
5095 regmask_now, regmask, regmask_save_now, regmask_save,
5096 regmask_init, regmask_arg);
5097 }
5098 return;
5099 }
5100
5101 check_i(po, po->bt_i);
5102 if (po->flags & OPF_CJMP)
5103 reg_use_pass(po->bt_i, opcnt, cbits,
5104 regmask_now, regmask, regmask_save_now, regmask_save,
5105 regmask_init, regmask_arg);
5106 else
5107 i = po->bt_i - 1;
5108 continue;
5109 }
5110
5111 if (po->op == OP_PUSH && !(po->flags & (OPF_FARG|OPF_DONE))
5112 && !g_func_pp->is_userstack
5113 && po->operand[0].type == OPT_REG)
5114 {
5115 reg = po->operand[0].reg;
5116 ferr_assert(po, reg >= 0);
5117
5118 already_saved = 0;
5119 flags_set = OPF_RSAVE | OPF_RMD | OPF_DONE;
5120 if (regmask_now & (1 << reg)) {
5121 already_saved = regmask_save_now & (1 << reg);
5122 flags_set = OPF_RSAVE | OPF_DONE;
5123 }
5124
5125 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, 0, 0);
5126 if (ret == 1) {
5127 scan_for_pop(i + 1, opcnt, i + opcnt * 4,
5128 reg, 0, 0, flags_set);
5129 }
5130 else {
5131 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
5132 if (ret == 1) {
5133 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg,
5134 flags_set);
5135 }
5136 }
5137 if (ret == 1) {
5138 ferr_assert(po, !already_saved);
5139 po->flags |= flags_set;
5140
5141 if (regmask_now & (1 << reg)) {
5142 regmask_save_now |= (1 << reg);
5143 *regmask_save |= regmask_save_now;
5144 }
5145 continue;
5146 }
5147 }
5148 else if (po->op == OP_POP && (po->flags & OPF_RSAVE)) {
5149 reg = po->operand[0].reg;
5150 ferr_assert(po, reg >= 0);
5151
5152 if (regmask_save_now & (1 << reg))
5153 regmask_save_now &= ~(1 << reg);
5154 else
5155 regmask_now &= ~(1 << reg);
5156 continue;
5157 }
5158 else if (po->op == OP_CALL) {
5159 if ((po->regmask_dst & (1 << xAX))
5160 && !(po->regmask_dst & (1 << xDX)))
5161 {
5162 if (po->flags & OPF_TAIL)
5163 // don't need eax, will do "return f();" or "f(); return;"
5164 po->regmask_dst &= ~(1 << xAX);
5165 else {
5166 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
5167 j = -1;
5168 find_next_read(i + 1, opcnt, &opr, i + opcnt * 17, &j);
5169 if (j == -1)
5170 // not used
5171 po->regmask_dst &= ~(1 << xAX);
5172 }
5173 }
5174
5175 // not "full stack" mode and have something in stack
5176 if (!(regmask_now & mxST7_2) && (regmask_now & mxST1_0))
5177 ferr(po, "float stack is not empty on func call\n");
5178 }
5179
5180 if (po->flags & OPF_NOREGS)
5181 continue;
5182
5183 // if incomplete register is used, clear it on init to avoid
5184 // later use of uninitialized upper part in some situations
5185 if ((po->flags & OPF_DATA) && po->operand[0].type == OPT_REG
5186 && po->operand[0].lmod != OPLM_DWORD)
5187 {
5188 reg = po->operand[0].reg;
5189 ferr_assert(po, reg >= 0);
5190
5191 if (!(regmask_now & (1 << reg)))
5192 *regmask_init |= 1 << reg;
5193 }
5194
5195 regmask_op = po->regmask_src | po->regmask_dst;
5196
5197 regmask_new = po->regmask_src & ~regmask_now & ~regmask_arg;
5198 regmask_new &= ~(1 << xSP);
5199 if (g_bp_frame && !(po->flags & OPF_EBP_S))
5200 regmask_new &= ~(1 << xBP);
5201
5202 if (regmask_new != 0)
5203 fnote(po, "uninitialized reg mask: %x\n", regmask_new);
5204
5205 if (regmask_op & (1 << xBP)) {
5206 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
5207 if (po->regmask_dst & (1 << xBP))
5208 // compiler decided to drop bp frame and use ebp as scratch
5209 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
5210 else
5211 regmask_op &= ~(1 << xBP);
5212 }
5213 }
5214
5215 if (po->flags & OPF_FPUSH) {
5216 if (regmask_now & mxST1)
5217 regmask_now |= mxSTa; // switch to "full stack" mode
5218 if (regmask_now & mxSTa)
5219 po->flags |= OPF_FSHIFT;
5220 if (!(regmask_now & mxST7_2)) {
5221 regmask_now =
5222 (regmask_now & ~mxST1_0) | ((regmask_now & mxST0) << 1);
5223 }
5224 }
5225
5226 regmask_now |= regmask_op;
5227 *regmask |= regmask_now;
5228
5229 // released regs
5230 if (po->flags & OPF_FPOP) {
5231 if ((regmask_now & mxSTa) == 0)
5232 ferr(po, "float pop on empty stack?\n");
5233 if (regmask_now & (mxST7_2 | mxST1))
5234 po->flags |= OPF_FSHIFT;
5235 if (!(regmask_now & mxST7_2)) {
5236 regmask_now =
5237 (regmask_now & ~mxST1_0) | ((regmask_now & mxST1) >> 1);
5238 }
5239 }
5240
5241 if (po->flags & OPF_TAIL) {
5242 if (!(regmask_now & mxST7_2)) {
5243 if (get_pp_arg_regmask_dst(g_func_pp) & mxST0) {
5244 if (!(regmask_now & mxST0))
5245 ferr(po, "no st0 on float return, mask: %x\n",
5246 regmask_now);
5247 }
5248 else if (regmask_now & mxST1_0)
5249 ferr(po, "float regs on tail: %x\n", regmask_now);
5250 }
5251
5252 // there is support for "conditional tailcall", sort of
5253 if (!(po->flags & OPF_CC))
5254 return;
5255 }
5256 }
5257}
5258
5259static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
5260{
5261 int i;
5262
5263 for (i = 0; i < pp->argc; i++)
5264 if (pp->arg[i].reg == NULL)
5265 break;
5266
5267 if (pp->argc_stack)
5268 memmove(&pp->arg[i + 1], &pp->arg[i],
5269 sizeof(pp->arg[0]) * pp->argc_stack);
5270 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
5271 pp->arg[i].reg = strdup(reg);
5272 pp->arg[i].type.name = strdup("int");
5273 pp->argc++;
5274 pp->argc_reg++;
5275}
5276
5277static void output_std_flags(FILE *fout, struct parsed_op *po,
5278 int *pfomask, const char *dst_opr_text)
5279{
5280 if (*pfomask & (1 << PFO_Z)) {
5281 fprintf(fout, "\n cond_z = (%s%s == 0);",
5282 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
5283 *pfomask &= ~(1 << PFO_Z);
5284 }
5285 if (*pfomask & (1 << PFO_S)) {
5286 fprintf(fout, "\n cond_s = (%s%s < 0);",
5287 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
5288 *pfomask &= ~(1 << PFO_S);
5289 }
5290}
5291
5292enum {
5293 OPP_FORCE_NORETURN = (1 << 0),
5294 OPP_SIMPLE_ARGS = (1 << 1),
5295 OPP_ALIGN = (1 << 2),
5296};
5297
5298static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
5299 int flags)
5300{
5301 const char *cconv = "";
5302
5303 if (pp->is_fastcall)
5304 cconv = "__fastcall ";
5305 else if (pp->is_stdcall && pp->argc_reg == 0)
5306 cconv = "__stdcall ";
5307
5308 fprintf(fout, (flags & OPP_ALIGN) ? "%-16s" : "%s", cconv);
5309
5310 if (pp->is_noreturn || (flags & OPP_FORCE_NORETURN))
5311 fprintf(fout, "noreturn ");
5312}
5313
5314static void output_pp(FILE *fout, const struct parsed_proto *pp,
5315 int flags)
5316{
5317 int i;
5318
5319 fprintf(fout, (flags & OPP_ALIGN) ? "%-5s" : "%s ",
5320 pp->ret_type.name);
5321 if (pp->is_fptr)
5322 fprintf(fout, "(");
5323 output_pp_attrs(fout, pp, flags);
5324 if (pp->is_fptr)
5325 fprintf(fout, "*");
5326 fprintf(fout, "%s", pp->name);
5327 if (pp->is_fptr)
5328 fprintf(fout, ")");
5329
5330 fprintf(fout, "(");
5331 for (i = 0; i < pp->argc; i++) {
5332 if (i > 0)
5333 fprintf(fout, ", ");
5334 if (pp->arg[i].pp != NULL && pp->arg[i].pp->is_func
5335 && !(flags & OPP_SIMPLE_ARGS))
5336 {
5337 // func pointer
5338 output_pp(fout, pp->arg[i].pp, 0);
5339 }
5340 else if (pp->arg[i].type.is_retreg) {
5341 fprintf(fout, "u32 *r_%s", pp->arg[i].reg);
5342 }
5343 else {
5344 fprintf(fout, "%s", pp->arg[i].type.name);
5345 if (!pp->is_fptr)
5346 fprintf(fout, " a%d", i + 1);
5347 }
5348 }
5349 if (pp->is_vararg) {
5350 if (i > 0)
5351 fprintf(fout, ", ");
5352 fprintf(fout, "...");
5353 }
5354 fprintf(fout, ")");
5355}
5356
5357static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
5358{
5359 char buf1[16];
5360
5361 buf1[0] = 0;
5362 if (grp > 0)
5363 snprintf(buf1, sizeof(buf1), "%d", grp);
5364 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
5365
5366 return buf;
5367}
5368
5369static void gen_x_cleanup(int opcnt);
5370
5371static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
5372{
5373 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
5374 struct parsed_opr *last_arith_dst = NULL;
5375 char buf1[256], buf2[256], buf3[256], cast[64];
5376 struct parsed_proto *pp, *pp_tmp;
5377 struct parsed_data *pd;
5378 int save_arg_vars[MAX_ARG_GRP] = { 0, };
5379 unsigned char cbits[MAX_OPS / 8];
5380 const char *float_type;
5381 const char *float_st0;
5382 const char *float_st1;
5383 int need_float_stack = 0;
5384 int need_float_sw = 0; // status word
5385 int need_tmp_var = 0;
5386 int need_tmp64 = 0;
5387 int cond_vars = 0;
5388 int had_decl = 0;
5389 int label_pending = 0;
5390 int need_double = 0;
5391 int regmask_save = 0; // used regs saved/restored in this func
5392 int regmask_arg; // regs from this function args (fastcall, etc)
5393 int regmask_ret; // regs needed on ret
5394 int regmask_now; // temp
5395 int regmask_init = 0; // regs that need zero initialization
5396 int regmask_pp = 0; // regs used in complex push-pop graph
5397 int regmask_ffca = 0; // float function call args
5398 int regmask = 0; // used regs
5399 int pfomask = 0;
5400 int found = 0;
5401 int dead_dst;
5402 int no_output;
5403 int i, j, l;
5404 int arg;
5405 int reg;
5406 int ret;
5407
5408 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
5409 g_stack_frame_used = 0;
5410 if (g_sct_func_attr & SCTFA_CLEAR_REGS)
5411 regmask_init = g_regmask_init;
5412
5413 g_func_pp = proto_parse(fhdr, funcn, 0);
5414 if (g_func_pp == NULL)
5415 ferr(ops, "proto_parse failed for '%s'\n", funcn);
5416
5417 regmask_arg = get_pp_arg_regmask_src(g_func_pp);
5418 regmask_ret = get_pp_arg_regmask_dst(g_func_pp);
5419
5420 // pass1:
5421 // - resolve all branches
5422 // - parse calls with labels
5423 resolve_branches_parse_calls(opcnt);
5424
5425 // pass2:
5426 // - handle ebp/esp frame, remove ops related to it
5427 scan_prologue_epilogue(opcnt);
5428
5429 // pass3:
5430 // - remove dead labels
5431 // - set regs needed at ret
5432 for (i = 0; i < opcnt; i++)
5433 {
5434 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
5435 free(g_labels[i]);
5436 g_labels[i] = NULL;
5437 }
5438
5439 if (ops[i].op == OP_RET)
5440 ops[i].regmask_src |= regmask_ret;
5441 }
5442
5443 // pass4:
5444 // - process trivial calls
5445 for (i = 0; i < opcnt; i++)
5446 {
5447 po = &ops[i];
5448 if (po->flags & (OPF_RMD|OPF_DONE))
5449 continue;
5450
5451 if (po->op == OP_CALL)
5452 {
5453 pp = process_call_early(i, opcnt, &j);
5454 if (pp != NULL) {
5455 if (!(po->flags & OPF_ATAIL)) {
5456 // since we know the args, try to collect them
5457 ret = collect_call_args_early(i, pp, &regmask, &regmask_ffca);
5458 if (ret != 0)
5459 pp = NULL;
5460 }
5461 }
5462
5463 if (pp != NULL) {
5464 if (j >= 0) {
5465 // commit esp adjust
5466 if (ops[j].op != OP_POP)
5467 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
5468 else {
5469 for (l = 0; l < pp->argc_stack; l++)
5470 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
5471 }
5472 }
5473
5474 if (strstr(pp->ret_type.name, "int64"))
5475 need_tmp64 = 1;
5476
5477 po->flags |= OPF_DONE;
5478 }
5479 }
5480 }
5481
5482 // pass5:
5483 // - process calls, stage 2
5484 // - handle some push/pop pairs
5485 // - scan for STD/CLD, propagate DF
5486 // - try to resolve needed x87 status word bits
5487 for (i = 0; i < opcnt; i++)
5488 {
5489 int mask, z_check;
5490
5491 po = &ops[i];
5492 if (po->flags & OPF_RMD)
5493 continue;
5494
5495 if (po->op == OP_CALL)
5496 {
5497 if (!(po->flags & OPF_DONE)) {
5498 pp = process_call(i, opcnt);
5499
5500 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
5501 // since we know the args, collect them
5502 collect_call_args(po, i, pp, &regmask, save_arg_vars,
5503 i + opcnt * 2);
5504 }
5505 // for unresolved, collect after other passes
5506 }
5507
5508 pp = po->pp;
5509 ferr_assert(po, pp != NULL);
5510
5511 po->regmask_src |= get_pp_arg_regmask_src(pp);
5512 po->regmask_dst |= get_pp_arg_regmask_dst(pp);
5513
5514 if (po->regmask_dst & mxST0)
5515 po->flags |= OPF_FPUSH;
5516
5517 if (strstr(pp->ret_type.name, "int64"))
5518 need_tmp64 = 1;
5519
5520 continue;
5521 }
5522
5523 if (po->flags & OPF_DONE)
5524 continue;
5525
5526 switch (po->op) {
5527 case OP_PUSH:
5528 if (!(po->flags & OPF_FARG) && !(po->flags & OPF_RSAVE)
5529 && po->operand[0].type == OPT_CONST)
5530 {
5531 scan_for_pop_const(i, opcnt, i + opcnt * 12);
5532 }
5533 break;
5534
5535 case OP_POP:
5536 scan_pushes_for_pop(i, opcnt, &regmask_pp);
5537 break;
5538
5539 case OP_STD:
5540 po->flags |= OPF_DF | OPF_RMD | OPF_DONE;
5541 scan_propagate_df(i + 1, opcnt);
5542 break;
5543
5544 case OP_FNSTSW:
5545 need_float_sw = 1;
5546 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xAX)
5547 ferr(po, "TODO: fnstsw to mem\n");
5548 ret = resolve_used_bits(i + 1, opcnt, xAX, &mask, &z_check);
5549 if (ret != 0)
5550 ferr(po, "fnstsw resolve failed\n");
5551 ret = adjust_prev_op(i, OP_FCOM, i + opcnt * 21,
5552 (void *)(long)(mask | (z_check << 16)));
5553 if (ret != 1)
5554 ferr(po, "failed to find fcom: %d\n", ret);
5555 break;
5556
5557 default:
5558 break;
5559 }
5560 }
5561
5562 // pass6:
5563 // - find POPs for PUSHes, rm both
5564 // - scan for all used registers
5565 memset(cbits, 0, sizeof(cbits));
5566 reg_use_pass(0, opcnt, cbits, regmask_init, &regmask,
5567 0, &regmask_save, &regmask_init, regmask_arg);
5568
5569 // pass7:
5570 // - find flag set ops for their users
5571 // - do unresolved calls
5572 // - declare indirect functions
5573 // - other op specific processing
5574 for (i = 0; i < opcnt; i++)
5575 {
5576 po = &ops[i];
5577 if (po->flags & (OPF_RMD|OPF_DONE))
5578 continue;
5579
5580 if (po->flags & OPF_CC)
5581 {
5582 int setters[16], cnt = 0, branched = 0;
5583
5584 ret = scan_for_flag_set(i, opcnt, i + opcnt * 6,
5585 &branched, setters, &cnt);
5586 if (ret < 0 || cnt <= 0)
5587 ferr(po, "unable to trace flag setter(s)\n");
5588 if (cnt > ARRAY_SIZE(setters))
5589 ferr(po, "too many flag setters\n");
5590
5591 for (j = 0; j < cnt; j++)
5592 {
5593 tmp_op = &ops[setters[j]]; // flag setter
5594 pfomask = 0;
5595
5596 // to get nicer code, we try to delay test and cmp;
5597 // if we can't because of operand modification, or if we
5598 // have arith op, or branch, make it calculate flags explicitly
5599 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
5600 {
5601 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
5602 pfomask = 1 << po->pfo;
5603 }
5604 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
5605 pfomask = 1 << po->pfo;
5606 }
5607 else {
5608 // see if we'll be able to handle based on op result
5609 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
5610 && po->pfo != PFO_Z && po->pfo != PFO_S
5611 && po->pfo != PFO_P)
5612 || branched
5613 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
5614 {
5615 pfomask = 1 << po->pfo;
5616 }
5617
5618 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
5619 propagate_lmod(tmp_op, &tmp_op->operand[0],
5620 &tmp_op->operand[1]);
5621 if (tmp_op->operand[0].lmod == OPLM_DWORD)
5622 need_tmp64 = 1;
5623 }
5624 }
5625 if (pfomask) {
5626 tmp_op->pfomask |= pfomask;
5627 cond_vars |= pfomask;
5628 }
5629 // note: may overwrite, currently not a problem
5630 po->datap = tmp_op;
5631 }
5632
5633 if (po->op == OP_RCL || po->op == OP_RCR
5634 || po->op == OP_ADC || po->op == OP_SBB)
5635 cond_vars |= 1 << PFO_C;
5636 }
5637
5638 switch (po->op) {
5639 case OP_CMPS:
5640 case OP_SCAS:
5641 cond_vars |= 1 << PFO_Z;
5642 break;
5643
5644 case OP_MUL:
5645 if (po->operand[0].lmod == OPLM_DWORD)
5646 need_tmp64 = 1;
5647 break;
5648
5649 case OP_IMUL:
5650 if (po->operand_cnt == 1 && po->operand[0].lmod == OPLM_DWORD)
5651 need_tmp64 = 1;
5652 break;
5653
5654 case OP_CALL:
5655 // note: resolved non-reg calls are OPF_DONE already
5656 pp = po->pp;
5657 ferr_assert(po, pp != NULL);
5658
5659 if (pp->is_unresolved) {
5660 int regmask_stack = 0;
5661 collect_call_args(po, i, pp, &regmask, save_arg_vars,
5662 i + opcnt * 2);
5663
5664 // this is pretty rough guess:
5665 // see ecx and edx were pushed (and not their saved versions)
5666 for (arg = 0; arg < pp->argc; arg++) {
5667 if (pp->arg[arg].reg != NULL)
5668 continue;
5669
5670 tmp_op = pp->arg[arg].datap;
5671 if (tmp_op == NULL)
5672 ferr(po, "parsed_op missing for arg%d\n", arg);
5673 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
5674 regmask_stack |= 1 << tmp_op->operand[0].reg;
5675 }
5676
5677 if (!((regmask_stack & (1 << xCX))
5678 && (regmask_stack & (1 << xDX))))
5679 {
5680 if (pp->argc_stack != 0
5681 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
5682 {
5683 pp_insert_reg_arg(pp, "ecx");
5684 pp->is_fastcall = 1;
5685 regmask_init |= 1 << xCX;
5686 regmask |= 1 << xCX;
5687 }
5688 if (pp->argc_stack != 0
5689 || ((regmask | regmask_arg) & (1 << xDX)))
5690 {
5691 pp_insert_reg_arg(pp, "edx");
5692 regmask_init |= 1 << xDX;
5693 regmask |= 1 << xDX;
5694 }
5695 }
5696
5697 // note: __cdecl doesn't fall into is_unresolved category
5698 if (pp->argc_stack > 0)
5699 pp->is_stdcall = 1;
5700 }
5701 break;
5702
5703 case OP_MOV:
5704 if (po->operand[0].pp != NULL && po->operand[1].pp != NULL)
5705 {
5706 // <var> = offset <something>
5707 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
5708 && !IS_START(po->operand[1].name, "off_"))
5709 {
5710 if (!po->operand[0].pp->is_fptr)
5711 ferr(po, "%s not declared as fptr when it should be\n",
5712 po->operand[0].name);
5713 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
5714 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
5715 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
5716 fnote(po, "var: %s\n", buf1);
5717 fnote(po, "func: %s\n", buf2);
5718 ferr(po, "^ mismatch\n");
5719 }
5720 }
5721 }
5722 break;
5723
5724 case OP_DIV:
5725 case OP_IDIV:
5726 if (po->operand[0].lmod == OPLM_DWORD) {
5727 // 32bit division is common, look for it
5728 if (po->op == OP_DIV)
5729 ret = scan_for_reg_clear(i, xDX);
5730 else
5731 ret = scan_for_cdq_edx(i);
5732 if (ret >= 0)
5733 po->flags |= OPF_32BIT;
5734 else
5735 need_tmp64 = 1;
5736 }
5737 else
5738 need_tmp_var = 1;
5739 break;
5740
5741 case OP_CLD:
5742 po->flags |= OPF_RMD | OPF_DONE;
5743 break;
5744
5745 case OP_RCL:
5746 case OP_RCR:
5747 case OP_XCHG:
5748 need_tmp_var = 1;
5749 break;
5750
5751 case OP_FLD:
5752 if (po->operand[0].lmod == OPLM_QWORD)
5753 need_double = 1;
5754 break;
5755
5756 case OPP_ALLSHL:
5757 case OPP_ALLSHR:
5758 need_tmp64 = 1;
5759 break;
5760
5761 case OPP_FTOL: {
5762 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xDX);
5763 j = -1;
5764 find_next_read(i + 1, opcnt, &opr, i + opcnt * 18, &j);
5765 if (j == -1)
5766 po->flags |= OPF_32BIT;
5767 break;
5768 }
5769
5770 default:
5771 break;
5772 }
5773 }
5774
5775 float_type = need_double ? "double" : "float";
5776 need_float_stack = !!(regmask & mxST7_2);
5777 float_st0 = need_float_stack ? "f_st[f_stp & 7]" : "f_st0";
5778 float_st1 = need_float_stack ? "f_st[(f_stp + 1) & 7]" : "f_st1";
5779
5780 // output starts here
5781
5782 // define userstack size
5783 if (g_func_pp->is_userstack) {
5784 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
5785 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
5786 fprintf(fout, "#endif\n");
5787 }
5788
5789 // the function itself
5790 ferr_assert(ops, !g_func_pp->is_fptr);
5791 output_pp(fout, g_func_pp,
5792 (g_ida_func_attr & IDAFA_NORETURN) ? OPP_FORCE_NORETURN : 0);
5793 fprintf(fout, "\n{\n");
5794
5795 // declare indirect functions
5796 for (i = 0; i < opcnt; i++) {
5797 po = &ops[i];
5798 if (po->flags & OPF_RMD)
5799 continue;
5800
5801 if (po->op == OP_CALL) {
5802 pp = po->pp;
5803 if (pp == NULL)
5804 ferr(po, "NULL pp\n");
5805
5806 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
5807 if (pp->name[0] != 0) {
5808 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
5809 memcpy(pp->name, "i_", 2);
5810
5811 // might be declared already
5812 found = 0;
5813 for (j = 0; j < i; j++) {
5814 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
5815 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
5816 found = 1;
5817 break;
5818 }
5819 }
5820 }
5821 if (found)
5822 continue;
5823 }
5824 else
5825 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
5826
5827 fprintf(fout, " ");
5828 output_pp(fout, pp, OPP_SIMPLE_ARGS);
5829 fprintf(fout, ";\n");
5830 }
5831 }
5832 }
5833
5834 // output LUTs/jumptables
5835 for (i = 0; i < g_func_pd_cnt; i++) {
5836 pd = &g_func_pd[i];
5837 fprintf(fout, " static const ");
5838 if (pd->type == OPT_OFFSET) {
5839 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
5840
5841 for (j = 0; j < pd->count; j++) {
5842 if (j > 0)
5843 fprintf(fout, ", ");
5844 fprintf(fout, "&&%s", pd->d[j].u.label);
5845 }
5846 }
5847 else {
5848 fprintf(fout, "%s %s[] =\n { ",
5849 lmod_type_u(ops, pd->lmod), pd->label);
5850
5851 for (j = 0; j < pd->count; j++) {
5852 if (j > 0)
5853 fprintf(fout, ", ");
5854 fprintf(fout, "%u", pd->d[j].u.val);
5855 }
5856 }
5857 fprintf(fout, " };\n");
5858 had_decl = 1;
5859 }
5860
5861 // declare stack frame, va_arg
5862 if (g_stack_fsz) {
5863 fprintf(fout, " union { u32 d[%d];", (g_stack_fsz + 3) / 4);
5864 if (g_func_lmods & (1 << OPLM_WORD))
5865 fprintf(fout, " u16 w[%d];", (g_stack_fsz + 1) / 2);
5866 if (g_func_lmods & (1 << OPLM_BYTE))
5867 fprintf(fout, " u8 b[%d];", g_stack_fsz);
5868 if (g_func_lmods & (1 << OPLM_QWORD))
5869 fprintf(fout, " double q[%d];", (g_stack_fsz + 7) / 8);
5870 fprintf(fout, " } sf;\n");
5871 had_decl = 1;
5872 }
5873
5874 if (g_func_pp->is_userstack) {
5875 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
5876 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
5877 had_decl = 1;
5878 }
5879
5880 if (g_func_pp->is_vararg) {
5881 fprintf(fout, " va_list ap;\n");
5882 had_decl = 1;
5883 }
5884
5885 // declare arg-registers
5886 for (i = 0; i < g_func_pp->argc; i++) {
5887 if (g_func_pp->arg[i].reg != NULL) {
5888 reg = char_array_i(regs_r32,
5889 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
5890 if (regmask & (1 << reg)) {
5891 if (g_func_pp->arg[i].type.is_retreg)
5892 fprintf(fout, " u32 %s = *r_%s;\n",
5893 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
5894 else
5895 fprintf(fout, " u32 %s = (u32)a%d;\n",
5896 g_func_pp->arg[i].reg, i + 1);
5897 }
5898 else {
5899 if (g_func_pp->arg[i].type.is_retreg)
5900 ferr(ops, "retreg '%s' is unused?\n",
5901 g_func_pp->arg[i].reg);
5902 fprintf(fout, " // %s = a%d; // unused\n",
5903 g_func_pp->arg[i].reg, i + 1);
5904 }
5905 had_decl = 1;
5906 }
5907 }
5908
5909 // declare normal registers
5910 regmask_now = regmask & ~regmask_arg;
5911 regmask_now &= ~(1 << xSP);
5912 if (regmask_now & 0x00ff) {
5913 for (reg = 0; reg < 8; reg++) {
5914 if (regmask_now & (1 << reg)) {
5915 fprintf(fout, " u32 %s", regs_r32[reg]);
5916 if (regmask_init & (1 << reg))
5917 fprintf(fout, " = 0");
5918 fprintf(fout, ";\n");
5919 had_decl = 1;
5920 }
5921 }
5922 }
5923 // ... mmx
5924 if (regmask_now & 0xff00) {
5925 for (reg = 8; reg < 16; reg++) {
5926 if (regmask_now & (1 << reg)) {
5927 fprintf(fout, " mmxr %s", regs_r32[reg]);
5928 if (regmask_init & (1 << reg))
5929 fprintf(fout, " = { 0, }");
5930 fprintf(fout, ";\n");
5931 had_decl = 1;
5932 }
5933 }
5934 }
5935 // ... x87
5936 if (need_float_stack) {
5937 fprintf(fout, " %s f_st[8];\n", float_type);
5938 fprintf(fout, " int f_stp = 0;\n");
5939 had_decl = 1;
5940 }
5941 else {
5942 if (regmask_now & 0xff0000) {
5943 for (reg = 16; reg < 24; reg++) {
5944 if (regmask_now & (1 << reg)) {
5945 fprintf(fout, " %s f_st%d", float_type, reg - 16);
5946 if (regmask_init & (1 << reg))
5947 fprintf(fout, " = 0");
5948 fprintf(fout, ";\n");
5949 had_decl = 1;
5950 }
5951 }
5952 }
5953 }
5954
5955 if (need_float_sw) {
5956 fprintf(fout, " u16 f_sw;\n");
5957 had_decl = 1;
5958 }
5959
5960 if (regmask_save) {
5961 for (reg = 0; reg < 8; reg++) {
5962 if (regmask_save & (1 << reg)) {
5963 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
5964 had_decl = 1;
5965 }
5966 }
5967 }
5968
5969 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
5970 if (save_arg_vars[i] == 0)
5971 continue;
5972 for (reg = 0; reg < 32; reg++) {
5973 if (save_arg_vars[i] & (1 << reg)) {
5974 fprintf(fout, " u32 %s;\n",
5975 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
5976 had_decl = 1;
5977 }
5978 }
5979 }
5980
5981 if (regmask_ffca) {
5982 for (reg = 0; reg < 32; reg++) {
5983 if (regmask_ffca & (1 << reg)) {
5984 fprintf(fout, " %s fs_%d;\n", float_type, reg + 1);
5985 had_decl = 1;
5986 }
5987 }
5988 }
5989
5990 // declare push-pop temporaries
5991 if (regmask_pp) {
5992 for (reg = 0; reg < 8; reg++) {
5993 if (regmask_pp & (1 << reg)) {
5994 fprintf(fout, " u32 pp_%s;\n", regs_r32[reg]);
5995 had_decl = 1;
5996 }
5997 }
5998 }
5999
6000 if (cond_vars) {
6001 for (i = 0; i < 8; i++) {
6002 if (cond_vars & (1 << i)) {
6003 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
6004 had_decl = 1;
6005 }
6006 }
6007 }
6008
6009 if (need_tmp_var) {
6010 fprintf(fout, " u32 tmp;\n");
6011 had_decl = 1;
6012 }
6013
6014 if (need_tmp64) {
6015 fprintf(fout, " u64 tmp64;\n");
6016 had_decl = 1;
6017 }
6018
6019 if (had_decl)
6020 fprintf(fout, "\n");
6021
6022 // do stack clear, if needed
6023 if (g_sct_func_attr & SCTFA_CLEAR_SF) {
6024 fprintf(fout, " ");
6025 if (g_stack_clear_len != 0) {
6026 if (g_stack_clear_len <= 4) {
6027 for (i = 0; i < g_stack_clear_len; i++)
6028 fprintf(fout, "sf.d[%d] = ", g_stack_clear_start + i);
6029 fprintf(fout, "0;\n");
6030 }
6031 else {
6032 fprintf(fout, "memset(&sf[%d], 0, %d);\n",
6033 g_stack_clear_start, g_stack_clear_len * 4);
6034 }
6035 }
6036 else
6037 fprintf(fout, "memset(&sf, 0, sizeof(sf));\n");
6038 }
6039
6040 if (g_func_pp->is_vararg) {
6041 if (g_func_pp->argc_stack == 0)
6042 ferr(ops, "vararg func without stack args?\n");
6043 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
6044 }
6045
6046 // output ops
6047 for (i = 0; i < opcnt; i++)
6048 {
6049 if (g_labels[i] != NULL) {
6050 fprintf(fout, "\n%s:\n", g_labels[i]);
6051 label_pending = 1;
6052
6053 delayed_flag_op = NULL;
6054 last_arith_dst = NULL;
6055 }
6056
6057 po = &ops[i];
6058 if (po->flags & OPF_RMD)
6059 continue;
6060
6061 no_output = 0;
6062
6063 #define assert_operand_cnt(n_) \
6064 if (po->operand_cnt != n_) \
6065 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
6066
6067 // conditional/flag using op?
6068 if (po->flags & OPF_CC)
6069 {
6070 int is_delayed = 0;
6071
6072 tmp_op = po->datap;
6073
6074 // we go through all this trouble to avoid using parsed_flag_op,
6075 // which makes generated code much nicer
6076 if (delayed_flag_op != NULL)
6077 {
6078 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
6079 po->pfo, po->pfo_inv);
6080 is_delayed = 1;
6081 }
6082 else if (last_arith_dst != NULL
6083 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
6084 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
6085 ))
6086 {
6087 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
6088 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
6089 last_arith_dst->lmod, buf3);
6090 is_delayed = 1;
6091 }
6092 else if (tmp_op != NULL) {
6093 // use preprocessed flag calc results
6094 if (!(tmp_op->pfomask & (1 << po->pfo)))
6095 ferr(po, "not prepared for pfo %d\n", po->pfo);
6096
6097 // note: pfo_inv was not yet applied
6098 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
6099 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
6100 }
6101 else {
6102 ferr(po, "all methods of finding comparison failed\n");
6103 }
6104
6105 if (po->flags & OPF_JMP) {
6106 fprintf(fout, " if %s", buf1);
6107 }
6108 else if (po->op == OP_RCL || po->op == OP_RCR
6109 || po->op == OP_ADC || po->op == OP_SBB)
6110 {
6111 if (is_delayed)
6112 fprintf(fout, " cond_%s = %s;\n",
6113 parsed_flag_op_names[po->pfo], buf1);
6114 }
6115 else if (po->flags & OPF_DATA) { // SETcc
6116 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
6117 fprintf(fout, " %s = %s;", buf2, buf1);
6118 }
6119 else {
6120 ferr(po, "unhandled conditional op\n");
6121 }
6122 }
6123
6124 pfomask = po->pfomask;
6125
6126 switch (po->op)
6127 {
6128 case OP_MOV:
6129 assert_operand_cnt(2);
6130 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6131 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6132 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
6133 fprintf(fout, " %s = %s;", buf1,
6134 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
6135 buf3, 0));
6136 break;
6137
6138 case OP_LEA:
6139 assert_operand_cnt(2);
6140 po->operand[1].lmod = OPLM_DWORD; // always
6141 fprintf(fout, " %s = %s;",
6142 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6143 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
6144 NULL, 1));
6145 break;
6146
6147 case OP_MOVZX:
6148 assert_operand_cnt(2);
6149 fprintf(fout, " %s = %s;",
6150 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6151 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6152 break;
6153
6154 case OP_MOVSX:
6155 assert_operand_cnt(2);
6156 switch (po->operand[1].lmod) {
6157 case OPLM_BYTE:
6158 strcpy(buf3, "(s8)");
6159 break;
6160 case OPLM_WORD:
6161 strcpy(buf3, "(s16)");
6162 break;
6163 default:
6164 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
6165 }
6166 fprintf(fout, " %s = %s;",
6167 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6168 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
6169 buf3, 0));
6170 break;
6171
6172 case OP_XCHG:
6173 assert_operand_cnt(2);
6174 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6175 fprintf(fout, " tmp = %s;",
6176 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
6177 fprintf(fout, " %s = %s;",
6178 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6179 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
6180 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
6181 fprintf(fout, " %s = %stmp;",
6182 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
6183 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
6184 snprintf(g_comment, sizeof(g_comment), "xchg");
6185 break;
6186
6187 case OP_NOT:
6188 assert_operand_cnt(1);
6189 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6190 fprintf(fout, " %s = ~%s;", buf1, buf1);
6191 break;
6192
6193 case OP_XLAT:
6194 assert_operand_cnt(2);
6195 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6196 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
6197 fprintf(fout, " %s = *(u8 *)(%s + %s);", buf1, buf2, buf1);
6198 strcpy(g_comment, "xlat");
6199 break;
6200
6201 case OP_CDQ:
6202 assert_operand_cnt(2);
6203 fprintf(fout, " %s = (s32)%s >> 31;",
6204 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6205 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6206 strcpy(g_comment, "cdq");
6207 break;
6208
6209 case OP_BSWAP:
6210 assert_operand_cnt(1);
6211 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6212 fprintf(fout, " %s = __builtin_bswap32(%s);", buf1, buf1);
6213 break;
6214
6215 case OP_LODS:
6216 if (po->flags & OPF_REP) {
6217 assert_operand_cnt(3);
6218 // hmh..
6219 ferr(po, "TODO\n");
6220 }
6221 else {
6222 assert_operand_cnt(2);
6223 fprintf(fout, " %s = %sesi; esi %c= %d;",
6224 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
6225 lmod_cast_u_ptr(po, po->operand[1].lmod),
6226 (po->flags & OPF_DF) ? '-' : '+',
6227 lmod_bytes(po, po->operand[1].lmod));
6228 strcpy(g_comment, "lods");
6229 }
6230 break;
6231
6232 case OP_STOS:
6233 if (po->flags & OPF_REP) {
6234 assert_operand_cnt(3);
6235 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
6236 (po->flags & OPF_DF) ? '-' : '+',
6237 lmod_bytes(po, po->operand[1].lmod));
6238 fprintf(fout, " %sedi = eax;",
6239 lmod_cast_u_ptr(po, po->operand[1].lmod));
6240 strcpy(g_comment, "rep stos");
6241 }
6242 else {
6243 assert_operand_cnt(2);
6244 fprintf(fout, " %sedi = eax; edi %c= %d;",
6245 lmod_cast_u_ptr(po, po->operand[1].lmod),
6246 (po->flags & OPF_DF) ? '-' : '+',
6247 lmod_bytes(po, po->operand[1].lmod));
6248 strcpy(g_comment, "stos");
6249 }
6250 break;
6251
6252 case OP_MOVS:
6253 j = lmod_bytes(po, po->operand[0].lmod);
6254 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
6255 l = (po->flags & OPF_DF) ? '-' : '+';
6256 if (po->flags & OPF_REP) {
6257 assert_operand_cnt(3);
6258 fprintf(fout,
6259 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
6260 l, j, l, j);
6261 fprintf(fout,
6262 " %sedi = %sesi;", buf1, buf1);
6263 strcpy(g_comment, "rep movs");
6264 }
6265 else {
6266 assert_operand_cnt(2);
6267 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
6268 buf1, buf1, l, j, l, j);
6269 strcpy(g_comment, "movs");
6270 }
6271 break;
6272
6273 case OP_CMPS:
6274 // repe ~ repeat while ZF=1
6275 j = lmod_bytes(po, po->operand[0].lmod);
6276 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
6277 l = (po->flags & OPF_DF) ? '-' : '+';
6278 if (po->flags & OPF_REP) {
6279 assert_operand_cnt(3);
6280 fprintf(fout,
6281 " while (ecx != 0) {\n");
6282 if (pfomask & (1 << PFO_C)) {
6283 // ugh..
6284 fprintf(fout,
6285 " cond_c = %sesi < %sedi;\n", buf1, buf1);
6286 pfomask &= ~(1 << PFO_C);
6287 }
6288 fprintf(fout,
6289 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
6290 buf1, buf1, l, j, l, j);
6291 fprintf(fout,
6292 " ecx--;\n"
6293 " if (cond_z %s 0) break;\n",
6294 (po->flags & OPF_REPZ) ? "==" : "!=");
6295 fprintf(fout,
6296 " }");
6297 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
6298 (po->flags & OPF_REPZ) ? "e" : "ne");
6299 }
6300 else {
6301 assert_operand_cnt(2);
6302 fprintf(fout,
6303 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
6304 buf1, buf1, l, j, l, j);
6305 strcpy(g_comment, "cmps");
6306 }
6307 pfomask &= ~(1 << PFO_Z);
6308 last_arith_dst = NULL;
6309 delayed_flag_op = NULL;
6310 break;
6311
6312 case OP_SCAS:
6313 // only does ZF (for now)
6314 // repe ~ repeat while ZF=1
6315 j = lmod_bytes(po, po->operand[1].lmod);
6316 l = (po->flags & OPF_DF) ? '-' : '+';
6317 if (po->flags & OPF_REP) {
6318 assert_operand_cnt(3);
6319 fprintf(fout,
6320 " while (ecx != 0) {\n");
6321 fprintf(fout,
6322 " cond_z = (%seax == %sedi); edi %c= %d;\n",
6323 lmod_cast_u(po, po->operand[1].lmod),
6324 lmod_cast_u_ptr(po, po->operand[1].lmod), l, j);
6325 fprintf(fout,
6326 " ecx--;\n"
6327 " if (cond_z %s 0) break;\n",
6328 (po->flags & OPF_REPZ) ? "==" : "!=");
6329 fprintf(fout,
6330 " }");
6331 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
6332 (po->flags & OPF_REPZ) ? "e" : "ne");
6333 }
6334 else {
6335 assert_operand_cnt(2);
6336 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
6337 lmod_cast_u(po, po->operand[1].lmod),
6338 lmod_cast_u_ptr(po, po->operand[1].lmod), l, j);
6339 strcpy(g_comment, "scas");
6340 }
6341 pfomask &= ~(1 << PFO_Z);
6342 last_arith_dst = NULL;
6343 delayed_flag_op = NULL;
6344 break;
6345
6346 // arithmetic w/flags
6347 case OP_AND:
6348 if (po->operand[1].type == OPT_CONST && !po->operand[1].val)
6349 goto dualop_arith_const;
6350 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6351 goto dualop_arith;
6352
6353 case OP_OR:
6354 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6355 if (po->operand[1].type == OPT_CONST) {
6356 j = lmod_bytes(po, po->operand[0].lmod);
6357 if (((1ull << j * 8) - 1) == po->operand[1].val)
6358 goto dualop_arith_const;
6359 }
6360 goto dualop_arith;
6361
6362 dualop_arith:
6363 assert_operand_cnt(2);
6364 fprintf(fout, " %s %s= %s;",
6365 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6366 op_to_c(po),
6367 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6368 output_std_flags(fout, po, &pfomask, buf1);
6369 last_arith_dst = &po->operand[0];
6370 delayed_flag_op = NULL;
6371 break;
6372
6373 dualop_arith_const:
6374 // and 0, or ~0 used instead mov
6375 assert_operand_cnt(2);
6376 fprintf(fout, " %s = %s;",
6377 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6378 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
6379 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
6380 output_std_flags(fout, po, &pfomask, buf1);
6381 last_arith_dst = &po->operand[0];
6382 delayed_flag_op = NULL;
6383 break;
6384
6385 case OP_SHL:
6386 case OP_SHR:
6387 assert_operand_cnt(2);
6388 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6389 if (pfomask & (1 << PFO_C)) {
6390 if (po->operand[1].type == OPT_CONST) {
6391 l = lmod_bytes(po, po->operand[0].lmod) * 8;
6392 j = po->operand[1].val;
6393 j %= l;
6394 if (j != 0) {
6395 if (po->op == OP_SHL)
6396 j = l - j;
6397 else
6398 j -= 1;
6399 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
6400 buf1, j);
6401 }
6402 else
6403 ferr(po, "zero shift?\n");
6404 }
6405 else
6406 ferr(po, "TODO\n");
6407 pfomask &= ~(1 << PFO_C);
6408 }
6409 fprintf(fout, " %s %s= %s", buf1, op_to_c(po),
6410 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6411 if (po->operand[1].type != OPT_CONST)
6412 fprintf(fout, " & 0x1f");
6413 fprintf(fout, ";");
6414 output_std_flags(fout, po, &pfomask, buf1);
6415 last_arith_dst = &po->operand[0];
6416 delayed_flag_op = NULL;
6417 break;
6418
6419 case OP_SAR:
6420 assert_operand_cnt(2);
6421 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6422 fprintf(fout, " %s = %s%s >> %s;", buf1,
6423 lmod_cast_s(po, po->operand[0].lmod), buf1,
6424 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6425 output_std_flags(fout, po, &pfomask, buf1);
6426 last_arith_dst = &po->operand[0];
6427 delayed_flag_op = NULL;
6428 break;
6429
6430 case OP_SHLD:
6431 case OP_SHRD:
6432 assert_operand_cnt(3);
6433 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6434 l = lmod_bytes(po, po->operand[0].lmod) * 8;
6435 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
6436 if (po->operand[2].type != OPT_CONST) {
6437 // no handling for "undefined" case, hopefully not needed
6438 snprintf(buf2, sizeof(buf2), "(%s & 0x1f)", buf3);
6439 strcpy(buf3, buf2);
6440 }
6441 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
6442 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6443 if (po->op == OP_SHLD) {
6444 fprintf(fout, " %s <<= %s; %s |= %s >> (%d - %s);",
6445 buf1, buf3, buf1, buf2, l, buf3);
6446 strcpy(g_comment, "shld");
6447 }
6448 else {
6449 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
6450 buf1, buf3, buf1, buf2, l, buf3);
6451 strcpy(g_comment, "shrd");
6452 }
6453 output_std_flags(fout, po, &pfomask, buf1);
6454 last_arith_dst = &po->operand[0];
6455 delayed_flag_op = NULL;
6456 break;
6457
6458 case OP_ROL:
6459 case OP_ROR:
6460 assert_operand_cnt(2);
6461 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6462 if (po->operand[1].type == OPT_CONST) {
6463 j = po->operand[1].val;
6464 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
6465 fprintf(fout, po->op == OP_ROL ?
6466 " %s = (%s << %d) | (%s >> %d);" :
6467 " %s = (%s >> %d) | (%s << %d);",
6468 buf1, buf1, j, buf1,
6469 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
6470 }
6471 else
6472 ferr(po, "TODO\n");
6473 output_std_flags(fout, po, &pfomask, buf1);
6474 last_arith_dst = &po->operand[0];
6475 delayed_flag_op = NULL;
6476 break;
6477
6478 case OP_RCL:
6479 case OP_RCR:
6480 assert_operand_cnt(2);
6481 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6482 l = lmod_bytes(po, po->operand[0].lmod) * 8;
6483 if (po->operand[1].type == OPT_CONST) {
6484 j = po->operand[1].val % l;
6485 if (j == 0)
6486 ferr(po, "zero rotate\n");
6487 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
6488 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
6489 if (po->op == OP_RCL) {
6490 fprintf(fout,
6491 " %s = (%s << %d) | (cond_c << %d)",
6492 buf1, buf1, j, j - 1);
6493 if (j != 1)
6494 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
6495 }
6496 else {
6497 fprintf(fout,
6498 " %s = (%s >> %d) | (cond_c << %d)",
6499 buf1, buf1, j, l - j);
6500 if (j != 1)
6501 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
6502 }
6503 fprintf(fout, ";\n");
6504 fprintf(fout, " cond_c = tmp;");
6505 }
6506 else
6507 ferr(po, "TODO\n");
6508 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
6509 output_std_flags(fout, po, &pfomask, buf1);
6510 last_arith_dst = &po->operand[0];
6511 delayed_flag_op = NULL;
6512 break;
6513
6514 case OP_XOR:
6515 assert_operand_cnt(2);
6516 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6517 if (IS(opr_name(po, 0), opr_name(po, 1))) {
6518 // special case for XOR
6519 int z = PFOB_O | PFOB_C | PFOB_S | (1 << PFO_L);
6520 for (j = 0; j <= PFO_LE; j++) {
6521 if (pfomask & (1 << j)) {
6522 fprintf(fout, " cond_%s = %d;\n",
6523 parsed_flag_op_names[j], (1 << j) & z ? 0 : 1);
6524 pfomask &= ~(1 << j);
6525 }
6526 }
6527 fprintf(fout, " %s = 0;",
6528 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
6529 last_arith_dst = &po->operand[0];
6530 delayed_flag_op = NULL;
6531 break;
6532 }
6533 goto dualop_arith;
6534
6535 case OP_ADD:
6536 assert_operand_cnt(2);
6537 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6538 if (pfomask & (1 << PFO_C)) {
6539 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
6540 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
6541 if (po->operand[0].lmod == OPLM_DWORD) {
6542 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
6543 fprintf(fout, " cond_c = tmp64 >> 32;\n");
6544 fprintf(fout, " %s = (u32)tmp64;",
6545 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
6546 strcat(g_comment, " add64");
6547 }
6548 else {
6549 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
6550 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
6551 fprintf(fout, " %s += %s;",
6552 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6553 buf2);
6554 }
6555 pfomask &= ~(1 << PFO_C);
6556 output_std_flags(fout, po, &pfomask, buf1);
6557 last_arith_dst = &po->operand[0];
6558 delayed_flag_op = NULL;
6559 break;
6560 }
6561 if (pfomask & (1 << PFO_LE)) {
6562 out_cmp_for_cc(buf1, sizeof(buf1), po, PFO_LE, 0, 1);
6563 fprintf(fout, " cond_%s = %s;\n",
6564 parsed_flag_op_names[PFO_LE], buf1);
6565 pfomask &= ~(1 << PFO_LE);
6566 }
6567 goto dualop_arith;
6568
6569 case OP_SUB:
6570 assert_operand_cnt(2);
6571 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6572 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
6573 for (j = 0; j <= PFO_LE; j++) {
6574 if (!(pfomask & (1 << j)))
6575 continue;
6576 if (j == PFO_Z || j == PFO_S)
6577 continue;
6578
6579 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0, 0);
6580 fprintf(fout, " cond_%s = %s;\n",
6581 parsed_flag_op_names[j], buf1);
6582 pfomask &= ~(1 << j);
6583 }
6584 }
6585 goto dualop_arith;
6586
6587 case OP_ADC:
6588 case OP_SBB:
6589 assert_operand_cnt(2);
6590 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6591 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6592 if (po->op == OP_SBB
6593 && IS(po->operand[0].name, po->operand[1].name))
6594 {
6595 // avoid use of unitialized var
6596 fprintf(fout, " %s = -cond_c;", buf1);
6597 // carry remains what it was
6598 pfomask &= ~(1 << PFO_C);
6599 }
6600 else {
6601 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
6602 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
6603 }
6604 output_std_flags(fout, po, &pfomask, buf1);
6605 last_arith_dst = &po->operand[0];
6606 delayed_flag_op = NULL;
6607 break;
6608
6609 case OP_BSF:
6610 assert_operand_cnt(2);
6611 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
6612 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
6613 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
6614 buf2, buf2);
6615 output_std_flags(fout, po, &pfomask, buf1);
6616 last_arith_dst = &po->operand[0];
6617 delayed_flag_op = NULL;
6618 strcat(g_comment, " bsf");
6619 break;
6620
6621 case OP_DEC:
6622 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
6623 for (j = 0; j <= PFO_LE; j++) {
6624 if (!(pfomask & (1 << j)))
6625 continue;
6626 if (j == PFO_Z || j == PFO_S || j == PFO_C)
6627 continue;
6628
6629 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0, 0);
6630 fprintf(fout, " cond_%s = %s;\n",
6631 parsed_flag_op_names[j], buf1);
6632 pfomask &= ~(1 << j);
6633 }
6634 }
6635 // fallthrough
6636
6637 case OP_INC:
6638 if (pfomask & (1 << PFO_C))
6639 // carry is unaffected by inc/dec.. wtf?
6640 ferr(po, "carry propagation needed\n");
6641
6642 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6643 if (po->operand[0].type == OPT_REG) {
6644 strcpy(buf2, po->op == OP_INC ? "++" : "--");
6645 fprintf(fout, " %s%s;", buf1, buf2);
6646 }
6647 else {
6648 strcpy(buf2, po->op == OP_INC ? "+" : "-");
6649 fprintf(fout, " %s %s= 1;", buf1, buf2);
6650 }
6651 output_std_flags(fout, po, &pfomask, buf1);
6652 last_arith_dst = &po->operand[0];
6653 delayed_flag_op = NULL;
6654 break;
6655
6656 case OP_NEG:
6657 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
6658 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
6659 fprintf(fout, " %s = -%s%s;", buf1,
6660 lmod_cast_s(po, po->operand[0].lmod), buf2);
6661 last_arith_dst = &po->operand[0];
6662 delayed_flag_op = NULL;
6663 if (pfomask & (1 << PFO_C)) {
6664 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
6665 pfomask &= ~(1 << PFO_C);
6666 }
6667 break;
6668
6669 case OP_IMUL:
6670 if (po->operand_cnt == 2) {
6671 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6672 goto dualop_arith;
6673 }
6674 if (po->operand_cnt == 3)
6675 ferr(po, "TODO imul3\n");
6676 // fallthrough
6677 case OP_MUL:
6678 assert_operand_cnt(1);
6679 switch (po->operand[0].lmod) {
6680 case OPLM_DWORD:
6681 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
6682 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
6683 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
6684 fprintf(fout, " edx = tmp64 >> 32;\n");
6685 fprintf(fout, " eax = tmp64;");
6686 break;
6687 case OPLM_BYTE:
6688 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
6689 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
6690 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
6691 buf1, 0));
6692 break;
6693 default:
6694 ferr(po, "TODO: unhandled mul type\n");
6695 break;
6696 }
6697 last_arith_dst = NULL;
6698 delayed_flag_op = NULL;
6699 break;
6700
6701 case OP_DIV:
6702 case OP_IDIV:
6703 assert_operand_cnt(1);
6704 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
6705 strcpy(cast, lmod_cast(po, po->operand[0].lmod,
6706 po->op == OP_IDIV));
6707 switch (po->operand[0].lmod) {
6708 case OPLM_DWORD:
6709 if (po->flags & OPF_32BIT)
6710 snprintf(buf2, sizeof(buf2), "%seax", cast);
6711 else {
6712 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
6713 snprintf(buf2, sizeof(buf2), "%stmp64",
6714 (po->op == OP_IDIV) ? "(s64)" : "");
6715 }
6716 if (po->operand[0].type == OPT_REG
6717 && po->operand[0].reg == xDX)
6718 {
6719 fprintf(fout, " eax = %s / %s%s;\n", buf2, cast, buf1);
6720 fprintf(fout, " edx = %s %% %s%s;", buf2, cast, buf1);
6721 }
6722 else {
6723 fprintf(fout, " edx = %s %% %s%s;\n", buf2, cast, buf1);
6724 fprintf(fout, " eax = %s / %s%s;", buf2, cast, buf1);
6725 }
6726 break;
6727 case OPLM_WORD:
6728 fprintf(fout, " tmp = (edx << 16) | (eax & 0xffff);\n");
6729 snprintf(buf2, sizeof(buf2), "%stmp",
6730 (po->op == OP_IDIV) ? "(s32)" : "");
6731 if (po->operand[0].type == OPT_REG
6732 && po->operand[0].reg == xDX)
6733 {
6734 fprintf(fout, " LOWORD(eax) = %s / %s%s;\n",
6735 buf2, cast, buf1);
6736 fprintf(fout, " LOWORD(edx) = %s %% %s%s;",
6737 buf2, cast, buf1);
6738 }
6739 else {
6740 fprintf(fout, " LOWORD(edx) = %s %% %s%s;\n",
6741 buf2, cast, buf1);
6742 fprintf(fout, " LOWORD(eax) = %s / %s%s;",
6743 buf2, cast, buf1);
6744 }
6745 strcat(g_comment, " div16");
6746 break;
6747 default:
6748 ferr(po, "unhandled div lmod %d\n", po->operand[0].lmod);
6749 }
6750 last_arith_dst = NULL;
6751 delayed_flag_op = NULL;
6752 break;
6753
6754 case OP_TEST:
6755 case OP_CMP:
6756 propagate_lmod(po, &po->operand[0], &po->operand[1]);
6757 if (pfomask != 0) {
6758 for (j = 0; j < 8; j++) {
6759 if (pfomask & (1 << j)) {
6760 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
6761 fprintf(fout, " cond_%s = %s;",
6762 parsed_flag_op_names[j], buf1);
6763 }
6764 }
6765 pfomask = 0;
6766 }
6767 else
6768 no_output = 1;
6769 last_arith_dst = NULL;
6770 delayed_flag_op = po;
6771 break;
6772
6773 case OP_SCC:
6774 // SETcc - should already be handled
6775 break;
6776
6777 // note: we reuse OP_Jcc for SETcc, only flags differ
6778 case OP_JCC:
6779 fprintf(fout, "\n goto %s;", po->operand[0].name);
6780 break;
6781
6782 case OP_JECXZ:
6783 fprintf(fout, " if (ecx == 0)\n");
6784 fprintf(fout, " goto %s;", po->operand[0].name);
6785 strcat(g_comment, " jecxz");
6786 break;
6787
6788 case OP_LOOP:
6789 fprintf(fout, " if (--ecx != 0)\n");
6790 fprintf(fout, " goto %s;", po->operand[0].name);
6791 strcat(g_comment, " loop");
6792 break;
6793
6794 case OP_JMP:
6795 assert_operand_cnt(1);
6796 last_arith_dst = NULL;
6797 delayed_flag_op = NULL;
6798
6799 if (po->operand[0].type == OPT_REGMEM) {
6800 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
6801 buf1, buf2);
6802 if (ret != 2)
6803 ferr(po, "parse failure for jmp '%s'\n",
6804 po->operand[0].name);
6805 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
6806 break;
6807 }
6808 else if (po->operand[0].type != OPT_LABEL)
6809 ferr(po, "unhandled jmp type\n");
6810
6811 fprintf(fout, " goto %s;", po->operand[0].name);
6812 break;
6813
6814 case OP_CALL:
6815 assert_operand_cnt(1);
6816 pp = po->pp;
6817 my_assert_not(pp, NULL);
6818
6819 strcpy(buf3, " ");
6820 if (po->flags & OPF_CC) {
6821 // we treat conditional branch to another func
6822 // (yes such code exists..) as conditional tailcall
6823 strcat(buf3, " ");
6824 fprintf(fout, " {\n");
6825 }
6826
6827 if (pp->is_fptr && !pp->is_arg) {
6828 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
6829 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
6830 "(void *)", 0));
6831 if (pp->is_unresolved)
6832 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
6833 buf3, asmfn, po->asmln, pp->name);
6834 }
6835
6836 fprintf(fout, "%s", buf3);
6837 if (strstr(pp->ret_type.name, "int64")) {
6838 if (po->flags & OPF_TAIL)
6839 ferr(po, "int64 and tail?\n");
6840 fprintf(fout, "tmp64 = ");
6841 }
6842 else if (!IS(pp->ret_type.name, "void")) {
6843 if (po->flags & OPF_TAIL) {
6844 if (regmask_ret & mxAX) {
6845 fprintf(fout, "return ");
6846 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
6847 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
6848 }
6849 else if (regmask_ret & mxST0)
6850 ferr(po, "float tailcall\n");
6851 }
6852 else if (po->regmask_dst & mxAX) {
6853 fprintf(fout, "eax = ");
6854 if (pp->ret_type.is_ptr)
6855 fprintf(fout, "(u32)");
6856 }
6857 else if (po->regmask_dst & mxST0) {
6858 ferr_assert(po, po->flags & OPF_FPUSH);
6859 if (need_float_stack)
6860 fprintf(fout, "f_st[--f_stp & 7] = ");
6861 else
6862 fprintf(fout, "f_st0 = ");
6863 }
6864 }
6865
6866 if (pp->name[0] == 0)
6867 ferr(po, "missing pp->name\n");
6868 fprintf(fout, "%s%s(", pp->name,
6869 pp->has_structarg ? "_sa" : "");
6870
6871 if (po->flags & OPF_ATAIL) {
6872 if (pp->argc_stack != g_func_pp->argc_stack
6873 || (pp->argc_stack > 0
6874 && pp->is_stdcall != g_func_pp->is_stdcall))
6875 ferr(po, "incompatible tailcall\n");
6876 if (g_func_pp->has_retreg)
6877 ferr(po, "TODO: retreg+tailcall\n");
6878
6879 for (arg = j = 0; arg < pp->argc; arg++) {
6880 if (arg > 0)
6881 fprintf(fout, ", ");
6882
6883 cast[0] = 0;
6884 if (pp->arg[arg].type.is_ptr)
6885 snprintf(cast, sizeof(cast), "(%s)",
6886 pp->arg[arg].type.name);
6887
6888 if (pp->arg[arg].reg != NULL) {
6889 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
6890 continue;
6891 }
6892 // stack arg
6893 for (; j < g_func_pp->argc; j++)
6894 if (g_func_pp->arg[j].reg == NULL)
6895 break;
6896 fprintf(fout, "%sa%d", cast, j + 1);
6897 j++;
6898 }
6899 }
6900 else {
6901 for (arg = 0; arg < pp->argc; arg++) {
6902 if (arg > 0)
6903 fprintf(fout, ", ");
6904
6905 cast[0] = 0;
6906 if (pp->arg[arg].type.is_ptr)
6907 snprintf(cast, sizeof(cast), "(%s)",
6908 pp->arg[arg].type.name);
6909
6910 if (pp->arg[arg].reg != NULL) {
6911 if (pp->arg[arg].type.is_retreg)
6912 fprintf(fout, "&%s", pp->arg[arg].reg);
6913 else
6914 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
6915 continue;
6916 }
6917
6918 // stack arg
6919 tmp_op = pp->arg[arg].datap;
6920 if (tmp_op == NULL)
6921 ferr(po, "parsed_op missing for arg%d\n", arg);
6922
6923 if (tmp_op->flags & OPF_VAPUSH) {
6924 fprintf(fout, "ap");
6925 }
6926 else if (tmp_op->op == OP_FST) {
6927 fprintf(fout, "fs_%d", tmp_op->p_argnum);
6928 if (tmp_op->operand[0].lmod == OPLM_QWORD)
6929 arg++;
6930 }
6931 else if (tmp_op->p_argpass != 0) {
6932 fprintf(fout, "a%d", tmp_op->p_argpass);
6933 }
6934 else if (tmp_op->p_argnum != 0) {
6935 fprintf(fout, "%s%s", cast,
6936 saved_arg_name(buf1, sizeof(buf1),
6937 tmp_op->p_arggrp, tmp_op->p_argnum));
6938 }
6939 else {
6940 fprintf(fout, "%s",
6941 out_src_opr(buf1, sizeof(buf1),
6942 tmp_op, &tmp_op->operand[0], cast, 0));
6943 }
6944 }
6945 }
6946 fprintf(fout, ");");
6947
6948 if (strstr(pp->ret_type.name, "int64")) {
6949 fprintf(fout, "\n");
6950 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
6951 fprintf(fout, "%seax = tmp64;", buf3);
6952 }
6953
6954 if (pp->is_unresolved) {
6955 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
6956 pp->argc_reg);
6957 strcat(g_comment, buf2);
6958 }
6959
6960 if (po->flags & OPF_TAIL) {
6961 ret = 0;
6962 if (i == opcnt - 1 || pp->is_noreturn)
6963 ret = 0;
6964 else if (IS(pp->ret_type.name, "void"))
6965 ret = 1;
6966 else if (!(regmask_ret & (1 << xAX)))
6967 ret = 1;
6968 // else already handled as 'return f()'
6969
6970 if (ret) {
6971 fprintf(fout, "\n%sreturn;", buf3);
6972 strcat(g_comment, " ^ tailcall");
6973 }
6974 else
6975 strcat(g_comment, " tailcall");
6976
6977 if ((regmask_ret & (1 << xAX))
6978 && IS(pp->ret_type.name, "void") && !pp->is_noreturn)
6979 {
6980 ferr(po, "int func -> void func tailcall?\n");
6981 }
6982 }
6983 if (pp->is_noreturn)
6984 strcat(g_comment, " noreturn");
6985 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
6986 strcat(g_comment, " argframe");
6987 if (po->flags & OPF_CC)
6988 strcat(g_comment, " cond");
6989
6990 if (po->flags & OPF_CC)
6991 fprintf(fout, "\n }");
6992
6993 delayed_flag_op = NULL;
6994 last_arith_dst = NULL;
6995 break;
6996
6997 case OP_RET:
6998 if (g_func_pp->is_vararg)
6999 fprintf(fout, " va_end(ap);\n");
7000 if (g_func_pp->has_retreg) {
7001 for (arg = 0; arg < g_func_pp->argc; arg++)
7002 if (g_func_pp->arg[arg].type.is_retreg)
7003 fprintf(fout, " *r_%s = %s;\n",
7004 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
7005 }
7006
7007 if (regmask_ret & mxST0) {
7008 fprintf(fout, " return %s;", float_st0);
7009 }
7010 else if (!(regmask_ret & mxAX)) {
7011 if (i != opcnt - 1 || label_pending)
7012 fprintf(fout, " return;");
7013 }
7014 else if (g_func_pp->ret_type.is_ptr) {
7015 fprintf(fout, " return (%s)eax;",
7016 g_func_pp->ret_type.name);
7017 }
7018 else if (IS(g_func_pp->ret_type.name, "__int64"))
7019 fprintf(fout, " return ((u64)edx << 32) | eax;");
7020 else
7021 fprintf(fout, " return eax;");
7022
7023 last_arith_dst = NULL;
7024 delayed_flag_op = NULL;
7025 break;
7026
7027 case OP_PUSH:
7028 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
7029 if (po->p_argnum != 0) {
7030 // special case - saved func arg
7031 fprintf(fout, " %s = %s;",
7032 saved_arg_name(buf2, sizeof(buf2),
7033 po->p_arggrp, po->p_argnum), buf1);
7034 break;
7035 }
7036 else if (po->flags & OPF_RSAVE) {
7037 fprintf(fout, " s_%s = %s;", buf1, buf1);
7038 break;
7039 }
7040 else if (po->flags & OPF_PPUSH) {
7041 tmp_op = po->datap;
7042 ferr_assert(po, tmp_op != NULL);
7043 out_dst_opr(buf2, sizeof(buf2), po, &tmp_op->operand[0]);
7044 fprintf(fout, " pp_%s = %s;", buf2, buf1);
7045 break;
7046 }
7047 else if (g_func_pp->is_userstack) {
7048 fprintf(fout, " *(--esp) = %s;", buf1);
7049 break;
7050 }
7051 if (!(g_ida_func_attr & IDAFA_NORETURN))
7052 ferr(po, "stray push encountered\n");
7053 no_output = 1;
7054 break;
7055
7056 case OP_POP:
7057 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
7058 if (po->flags & OPF_RSAVE) {
7059 fprintf(fout, " %s = s_%s;", buf1, buf1);
7060 break;
7061 }
7062 else if (po->flags & OPF_PPUSH) {
7063 // push/pop graph / non-const
7064 ferr_assert(po, po->datap == NULL);
7065 fprintf(fout, " %s = pp_%s;", buf1, buf1);
7066 break;
7067 }
7068 else if (po->datap != NULL) {
7069 // push/pop pair
7070 tmp_op = po->datap;
7071 fprintf(fout, " %s = %s;", buf1,
7072 out_src_opr(buf2, sizeof(buf2),
7073 tmp_op, &tmp_op->operand[0],
7074 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
7075 break;
7076 }
7077 else if (g_func_pp->is_userstack) {
7078 fprintf(fout, " %s = *esp++;", buf1);
7079 break;
7080 }
7081 else
7082 ferr(po, "stray pop encountered\n");
7083 break;
7084
7085 case OP_NOP:
7086 no_output = 1;
7087 break;
7088
7089 // pseudo ops
7090 case OPP_ALLSHL:
7091 case OPP_ALLSHR:
7092 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
7093 fprintf(fout, " tmp64 = (s64)tmp64 %s= LOBYTE(ecx);\n",
7094 po->op == OPP_ALLSHL ? "<<" : ">>");
7095 fprintf(fout, " edx = tmp64 >> 32; eax = tmp64;");
7096 strcat(g_comment, po->op == OPP_ALLSHL
7097 ? " allshl" : " allshr");
7098 break;
7099
7100 // x87
7101 case OP_FLD:
7102 if (need_float_stack) {
7103 out_src_opr_float(buf1, sizeof(buf1),
7104 po, &po->operand[0], 1);
7105 if (po->regmask_src & mxSTa) {
7106 fprintf(fout, " f_st[(f_stp - 1) & 7] = %s; f_stp--;",
7107 buf1);
7108 }
7109 else
7110 fprintf(fout, " f_st[--f_stp & 7] = %s;", buf1);
7111 }
7112 else {
7113 if (po->flags & OPF_FSHIFT)
7114 fprintf(fout, " f_st1 = f_st0;");
7115 if (po->operand[0].type == OPT_REG
7116 && po->operand[0].reg == xST0)
7117 {
7118 strcat(g_comment, " fld st");
7119 break;
7120 }
7121 fprintf(fout, " f_st0 = %s;",
7122 out_src_opr_float(buf1, sizeof(buf1),
7123 po, &po->operand[0], 0));
7124 }
7125 strcat(g_comment, " fld");
7126 break;
7127
7128 case OP_FILD:
7129 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
7130 lmod_cast(po, po->operand[0].lmod, 1), 0);
7131 snprintf(buf2, sizeof(buf2), "(%s)%s", float_type, buf1);
7132 if (need_float_stack) {
7133 fprintf(fout, " f_st[--f_stp & 7] = %s;", buf2);
7134 }
7135 else {
7136 if (po->flags & OPF_FSHIFT)
7137 fprintf(fout, " f_st1 = f_st0;");
7138 fprintf(fout, " f_st0 = %s;", buf2);
7139 }
7140 strcat(g_comment, " fild");
7141 break;
7142
7143 case OP_FLDc:
7144 if (need_float_stack)
7145 fprintf(fout, " f_st[--f_stp & 7] = ");
7146 else {
7147 if (po->flags & OPF_FSHIFT)
7148 fprintf(fout, " f_st1 = f_st0;");
7149 fprintf(fout, " f_st0 = ");
7150 }
7151 switch (po->operand[0].val) {
7152 case X87_CONST_1: fprintf(fout, "1.0;"); break;
7153 case X87_CONST_LN2: fprintf(fout, "0.693147180559945;"); break;
7154 case X87_CONST_Z: fprintf(fout, "0.0;"); break;
7155 default: ferr(po, "TODO\n"); break;
7156 }
7157 break;
7158
7159 case OP_FST:
7160 if (po->flags & OPF_FARG) {
7161 // store to stack as func arg
7162 snprintf(buf1, sizeof(buf1), "fs_%d", po->p_argnum);
7163 dead_dst = 0;
7164 }
7165 else {
7166 out_dst_opr_float(buf1, sizeof(buf1), po, &po->operand[0],
7167 need_float_stack);
7168 dead_dst = po->operand[0].type == OPT_REG
7169 && po->operand[0].reg == xST0;
7170 }
7171 if (!dead_dst)
7172 fprintf(fout, " %s = %s;", buf1, float_st0);
7173 if (po->flags & OPF_FSHIFT) {
7174 if (need_float_stack)
7175 fprintf(fout, " f_stp++;");
7176 else
7177 fprintf(fout, " f_st0 = f_st1;");
7178 }
7179 if (dead_dst && !(po->flags & OPF_FSHIFT))
7180 no_output = 1;
7181 else
7182 strcat(g_comment, " fst");
7183 break;
7184
7185 case OP_FIST:
7186 fprintf(fout, " %s = %s%s;",
7187 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
7188 lmod_cast(po, po->operand[0].lmod, 1), float_st0);
7189 if (po->flags & OPF_FSHIFT) {
7190 if (need_float_stack)
7191 fprintf(fout, " f_stp++;");
7192 else
7193 fprintf(fout, " f_st0 = f_st1;");
7194 }
7195 strcat(g_comment, " fist");
7196 break;
7197
7198 case OP_FADD:
7199 case OP_FDIV:
7200 case OP_FMUL:
7201 case OP_FSUB:
7202 out_dst_opr_float(buf1, sizeof(buf1), po, &po->operand[0],
7203 need_float_stack);
7204 out_src_opr_float(buf2, sizeof(buf2), po, &po->operand[1],
7205 need_float_stack);
7206 dead_dst = (po->flags & OPF_FPOP)
7207 && po->operand[0].type == OPT_REG
7208 && po->operand[0].reg == xST0;
7209 switch (po->op) {
7210 case OP_FADD: j = '+'; break;
7211 case OP_FDIV: j = '/'; break;
7212 case OP_FMUL: j = '*'; break;
7213 case OP_FSUB: j = '-'; break;
7214 default: j = 'x'; break;
7215 }
7216 if (need_float_stack) {
7217 if (!dead_dst)
7218 fprintf(fout, " %s %c= %s;", buf1, j, buf2);
7219 if (po->flags & OPF_FSHIFT)
7220 fprintf(fout, " f_stp++;");
7221 }
7222 else {
7223 if (po->flags & OPF_FSHIFT) {
7224 // note: assumes only 2 regs handled
7225 if (!dead_dst)
7226 fprintf(fout, " f_st0 = f_st1 %c f_st0;", j);
7227 else
7228 fprintf(fout, " f_st0 = f_st1;");
7229 }
7230 else if (!dead_dst)
7231 fprintf(fout, " %s %c= %s;", buf1, j, buf2);
7232 }
7233 no_output = (dead_dst && !(po->flags & OPF_FSHIFT));
7234 break;
7235
7236 case OP_FDIVR:
7237 case OP_FSUBR:
7238 out_dst_opr_float(buf1, sizeof(buf1), po, &po->operand[0],
7239 need_float_stack);
7240 out_src_opr_float(buf2, sizeof(buf2), po, &po->operand[1],
7241 need_float_stack);
7242 out_src_opr_float(buf3, sizeof(buf3), po, &po->operand[0],
7243 need_float_stack);
7244 dead_dst = (po->flags & OPF_FPOP)
7245 && po->operand[0].type == OPT_REG
7246 && po->operand[0].reg == xST0;
7247 j = po->op == OP_FDIVR ? '/' : '-';
7248 if (need_float_stack) {
7249 if (!dead_dst)
7250 fprintf(fout, " %s = %s %c %s;", buf1, buf2, j, buf3);
7251 if (po->flags & OPF_FSHIFT)
7252 fprintf(fout, " f_stp++;");
7253 }
7254 else {
7255 if (po->flags & OPF_FSHIFT) {
7256 if (!dead_dst)
7257 fprintf(fout, " f_st0 = f_st0 %c f_st1;", j);
7258 else
7259 fprintf(fout, " f_st0 = f_st1;");
7260 }
7261 else if (!dead_dst)
7262 fprintf(fout, " %s = %s %c %s;", buf1, buf2, j, buf3);
7263 }
7264 no_output = (dead_dst && !(po->flags & OPF_FSHIFT));
7265 break;
7266
7267 case OP_FIADD:
7268 case OP_FIDIV:
7269 case OP_FIMUL:
7270 case OP_FISUB:
7271 switch (po->op) {
7272 case OP_FIADD: j = '+'; break;
7273 case OP_FIDIV: j = '/'; break;
7274 case OP_FIMUL: j = '*'; break;
7275 case OP_FISUB: j = '-'; break;
7276 default: j = 'x'; break;
7277 }
7278 fprintf(fout, " %s %c= (%s)%s;", float_st0,
7279 j, float_type,
7280 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
7281 lmod_cast(po, po->operand[0].lmod, 1), 0));
7282 break;
7283
7284 case OP_FIDIVR:
7285 case OP_FISUBR:
7286 fprintf(fout, " %s = %s %c %s;", float_st0,
7287 out_src_opr_float(buf2, sizeof(buf2), po, &po->operand[1],
7288 need_float_stack),
7289 po->op == OP_FIDIVR ? '/' : '-', float_st0);
7290 break;
7291
7292 case OP_FCOM: {
7293 int mask, z_check;
7294 ferr_assert(po, po->datap != NULL);
7295 mask = (long)po->datap & 0xffff;
7296 z_check = ((long)po->datap >> 16) & 1;
7297 out_src_opr_float(buf1, sizeof(buf1), po, &po->operand[0],
7298 need_float_stack);
7299 if (mask == 0x0100) { // C0 -> <
7300 fprintf(fout, " f_sw = %s < %s ? 0x0100 : 0;",
7301 float_st0, buf1);
7302 }
7303 else if (mask == 0x4000) { // C3 -> =
7304 fprintf(fout, " f_sw = %s == %s ? 0x4000 : 0;",
7305 float_st0, buf1);
7306 }
7307 else if (mask == 0x4100) { // C3, C0
7308 if (z_check) {
7309 fprintf(fout, " f_sw = %s <= %s ? 0x4100 : 0;",
7310 float_st0, buf1);
7311 strcat(g_comment, " z_chk_det");
7312 }
7313 else {
7314 fprintf(fout, " f_sw = %s == %s ? 0x4000 : "
7315 "(%s < %s ? 0x0100 : 0);",
7316 float_st0, buf1, float_st0, buf1);
7317 }
7318 }
7319 else
7320 ferr(po, "unhandled sw mask: %x\n", mask);
7321 if (po->flags & OPF_FSHIFT) {
7322 if (need_float_stack)
7323 fprintf(fout, " f_stp++;");
7324 else
7325 fprintf(fout, " f_st0 = f_st1;");
7326 }
7327 break;
7328 }
7329
7330 case OP_FNSTSW:
7331 fprintf(fout, " %s = f_sw;",
7332 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
7333 break;
7334
7335 case OP_FCHS:
7336 fprintf(fout, " %s = -%s;", float_st0, float_st0);
7337 break;
7338
7339 case OP_FCOS:
7340 fprintf(fout, " %s = cos%s(%s);", float_st0,
7341 need_double ? "" : "f", float_st0);
7342 break;
7343
7344 case OP_FPATAN:
7345 if (need_float_stack) {
7346 fprintf(fout, " %s = atan%s(%s / %s);", float_st1,
7347 need_double ? "" : "f", float_st1, float_st0);
7348 fprintf(fout, " f_stp++;");
7349 }
7350 else {
7351 fprintf(fout, " f_st0 = atan%s(f_st1 / f_st0);",
7352 need_double ? "" : "f");
7353 }
7354 break;
7355
7356 case OP_FYL2X:
7357 if (need_float_stack) {
7358 fprintf(fout, " %s = %s * log2%s(%s);", float_st1,
7359 float_st1, need_double ? "" : "f", float_st0);
7360 fprintf(fout, " f_stp++;");
7361 }
7362 else {
7363 fprintf(fout, " f_st0 = f_st1 * log2%s(f_st0);",
7364 need_double ? "" : "f");
7365 }
7366 break;
7367
7368 case OP_FSIN:
7369 fprintf(fout, " %s = sin%s(%s);", float_st0,
7370 need_double ? "" : "f", float_st0);
7371 break;
7372
7373 case OP_FSQRT:
7374 fprintf(fout, " %s = sqrt%s(%s);", float_st0,
7375 need_double ? "" : "f", float_st0);
7376 break;
7377
7378 case OP_FXCH:
7379 dead_dst = po->operand[0].type == OPT_REG
7380 && po->operand[0].reg == xST0;
7381 if (!dead_dst) {
7382 out_src_opr_float(buf1, sizeof(buf1), po, &po->operand[0],
7383 need_float_stack);
7384 fprintf(fout, " { %s t = %s; %s = %s; %s = t; }", float_type,
7385 float_st0, float_st0, buf1, buf1);
7386 strcat(g_comment, " fxch");
7387 }
7388 else
7389 no_output = 1;
7390 break;
7391
7392 case OPP_FTOL:
7393 ferr_assert(po, po->flags & OPF_32BIT);
7394 fprintf(fout, " eax = (s32)%s;", float_st0);
7395 if (po->flags & OPF_FSHIFT) {
7396 if (need_float_stack)
7397 fprintf(fout, " f_stp++;");
7398 else
7399 fprintf(fout, " f_st0 = f_st1;");
7400 }
7401 strcat(g_comment, " ftol");
7402 break;
7403
7404 // mmx
7405 case OP_EMMS:
7406 strcpy(g_comment, " (emms)");
7407 break;
7408
7409 default:
7410 no_output = 1;
7411 ferr(po, "unhandled op type %d, flags %x\n",
7412 po->op, po->flags);
7413 break;
7414 }
7415
7416 if (g_comment[0] != 0) {
7417 char *p = g_comment;
7418 while (my_isblank(*p))
7419 p++;
7420 fprintf(fout, " // %s", p);
7421 g_comment[0] = 0;
7422 no_output = 0;
7423 }
7424 if (!no_output)
7425 fprintf(fout, "\n");
7426
7427 // some sanity checking
7428 if (po->flags & OPF_REP) {
7429 if (po->op != OP_STOS && po->op != OP_MOVS
7430 && po->op != OP_CMPS && po->op != OP_SCAS)
7431 ferr(po, "unexpected rep\n");
7432 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
7433 && (po->op == OP_CMPS || po->op == OP_SCAS))
7434 ferr(po, "cmps/scas with plain rep\n");
7435 }
7436 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
7437 && po->op != OP_CMPS && po->op != OP_SCAS)
7438 ferr(po, "unexpected repz/repnz\n");
7439
7440 if (pfomask != 0)
7441 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
7442
7443 // see is delayed flag stuff is still valid
7444 if (delayed_flag_op != NULL && delayed_flag_op != po) {
7445 if (is_any_opr_modified(delayed_flag_op, po, 0))
7446 delayed_flag_op = NULL;
7447 }
7448
7449 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
7450 if (is_opr_modified(last_arith_dst, po))
7451 last_arith_dst = NULL;
7452 }
7453
7454 label_pending = 0;
7455 }
7456
7457 if (g_stack_fsz && !g_stack_frame_used)
7458 fprintf(fout, " (void)sf;\n");
7459
7460 fprintf(fout, "}\n\n");
7461
7462 gen_x_cleanup(opcnt);
7463}
7464
7465static void gen_x_cleanup(int opcnt)
7466{
7467 int i;
7468
7469 for (i = 0; i < opcnt; i++) {
7470 struct label_ref *lr, *lr_del;
7471
7472 lr = g_label_refs[i].next;
7473 while (lr != NULL) {
7474 lr_del = lr;
7475 lr = lr->next;
7476 free(lr_del);
7477 }
7478 g_label_refs[i].i = -1;
7479 g_label_refs[i].next = NULL;
7480
7481 if (ops[i].op == OP_CALL) {
7482 if (ops[i].pp)
7483 proto_release(ops[i].pp);
7484 }
7485 }
7486 g_func_pp = NULL;
7487}
7488
7489struct func_proto_dep;
7490
7491struct func_prototype {
7492 char name[NAMELEN];
7493 int id;
7494 int argc_stack;
7495 int regmask_dep;
7496 int has_ret:3; // -1, 0, 1: unresolved, no, yes
7497 unsigned int dep_resolved:1;
7498 unsigned int is_stdcall:1;
7499 struct func_proto_dep *dep_func;
7500 int dep_func_cnt;
7501 const struct parsed_proto *pp; // seed pp, if any
7502};
7503
7504struct func_proto_dep {
7505 char *name;
7506 struct func_prototype *proto;
7507 int regmask_live; // .. at the time of call
7508 unsigned int ret_dep:1; // return from this is caller's return
7509};
7510
7511static struct func_prototype *hg_fp;
7512static int hg_fp_cnt;
7513
7514static struct scanned_var {
7515 char name[NAMELEN];
7516 enum opr_lenmod lmod;
7517 unsigned int is_seeded:1;
7518 unsigned int is_c_str:1;
7519 const struct parsed_proto *pp; // seed pp, if any
7520} *hg_vars;
7521static int hg_var_cnt;
7522
7523static char **hg_refs;
7524static int hg_ref_cnt;
7525
7526static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
7527 int count);
7528
7529static struct func_prototype *hg_fp_add(const char *funcn)
7530{
7531 struct func_prototype *fp;
7532
7533 if ((hg_fp_cnt & 0xff) == 0) {
7534 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
7535 my_assert_not(hg_fp, NULL);
7536 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
7537 }
7538
7539 fp = &hg_fp[hg_fp_cnt];
7540 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
7541 fp->id = hg_fp_cnt;
7542 fp->argc_stack = -1;
7543 hg_fp_cnt++;
7544
7545 return fp;
7546}
7547
7548static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
7549 const char *name)
7550{
7551 int i;
7552
7553 for (i = 0; i < fp->dep_func_cnt; i++)
7554 if (IS(fp->dep_func[i].name, name))
7555 return &fp->dep_func[i];
7556
7557 return NULL;
7558}
7559
7560static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
7561{
7562 // is it a dupe?
7563 if (hg_fp_find_dep(fp, name))
7564 return;
7565
7566 if ((fp->dep_func_cnt & 0xff) == 0) {
7567 fp->dep_func = realloc(fp->dep_func,
7568 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
7569 my_assert_not(fp->dep_func, NULL);
7570 memset(&fp->dep_func[fp->dep_func_cnt], 0,
7571 sizeof(fp->dep_func[0]) * 0x100);
7572 }
7573 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
7574 fp->dep_func_cnt++;
7575}
7576
7577static int hg_fp_cmp_name(const void *p1_, const void *p2_)
7578{
7579 const struct func_prototype *p1 = p1_, *p2 = p2_;
7580 return strcmp(p1->name, p2->name);
7581}
7582
7583#if 0
7584static int hg_fp_cmp_id(const void *p1_, const void *p2_)
7585{
7586 const struct func_prototype *p1 = p1_, *p2 = p2_;
7587 return p1->id - p2->id;
7588}
7589#endif
7590
7591static void hg_ref_add(const char *name)
7592{
7593 if ((hg_ref_cnt & 0xff) == 0) {
7594 hg_refs = realloc(hg_refs, sizeof(hg_refs[0]) * (hg_ref_cnt + 0x100));
7595 my_assert_not(hg_refs, NULL);
7596 memset(hg_refs + hg_ref_cnt, 0, sizeof(hg_refs[0]) * 0x100);
7597 }
7598
7599 hg_refs[hg_ref_cnt] = strdup(name);
7600 my_assert_not(hg_refs[hg_ref_cnt], NULL);
7601 hg_ref_cnt++;
7602}
7603
7604// recursive register dep pass
7605// - track saved regs (part 2)
7606// - try to figure out arg-regs
7607// - calculate reg deps
7608static void gen_hdr_dep_pass(int i, int opcnt, unsigned char *cbits,
7609 struct func_prototype *fp, int regmask_save, int regmask_dst,
7610 int *regmask_dep, int *has_ret)
7611{
7612 struct func_proto_dep *dep;
7613 struct parsed_op *po;
7614 int from_caller = 0;
7615 int j, l;
7616 int reg;
7617 int ret;
7618
7619 for (; i < opcnt; i++)
7620 {
7621 if (cbits[i >> 3] & (1 << (i & 7)))
7622 return;
7623 cbits[i >> 3] |= (1 << (i & 7));
7624
7625 po = &ops[i];
7626
7627 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
7628 if (po->flags & OPF_RMD)
7629 continue;
7630
7631 if (po->btj != NULL) {
7632 // jumptable
7633 for (j = 0; j < po->btj->count; j++) {
7634 check_i(po, po->btj->d[j].bt_i);
7635 gen_hdr_dep_pass(po->btj->d[j].bt_i, opcnt, cbits, fp,
7636 regmask_save, regmask_dst, regmask_dep, has_ret);
7637 }
7638 return;
7639 }
7640
7641 check_i(po, po->bt_i);
7642 if (po->flags & OPF_CJMP) {
7643 gen_hdr_dep_pass(po->bt_i, opcnt, cbits, fp,
7644 regmask_save, regmask_dst, regmask_dep, has_ret);
7645 }
7646 else {
7647 i = po->bt_i - 1;
7648 }
7649 continue;
7650 }
7651
7652 if (po->flags & OPF_FARG)
7653 /* (just calculate register deps) */;
7654 else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
7655 {
7656 reg = po->operand[0].reg;
7657 ferr_assert(po, reg >= 0);
7658
7659 if (po->flags & OPF_RSAVE) {
7660 regmask_save |= 1 << reg;
7661 continue;
7662 }
7663 if (po->flags & OPF_DONE)
7664 continue;
7665
7666 ret = scan_for_pop(i + 1, opcnt, i + opcnt * 2, reg, 0, 0, 0);
7667 if (ret == 1) {
7668 regmask_save |= 1 << reg;
7669 po->flags |= OPF_RMD;
7670 scan_for_pop(i + 1, opcnt, i + opcnt * 3, reg, 0, 0, OPF_RMD);
7671 continue;
7672 }
7673 }
7674 else if (po->flags & OPF_RMD)
7675 continue;
7676 else if (po->op == OP_CALL) {
7677 po->regmask_dst |= 1 << xAX;
7678
7679 dep = hg_fp_find_dep(fp, po->operand[0].name);
7680 if (dep != NULL)
7681 dep->regmask_live = regmask_save | regmask_dst;
7682 }
7683 else if (po->op == OP_RET) {
7684 if (po->operand_cnt > 0) {
7685 fp->is_stdcall = 1;
7686 if (fp->argc_stack >= 0
7687 && fp->argc_stack != po->operand[0].val / 4)
7688 ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4);
7689 fp->argc_stack = po->operand[0].val / 4;
7690 }
7691 }
7692
7693 // if has_ret is 0, there is uninitialized eax path,
7694 // which means it's most likely void func
7695 if (*has_ret != 0 && (po->flags & OPF_TAIL)) {
7696 if (po->op == OP_CALL) {
7697 j = i;
7698 ret = 1;
7699 }
7700 else {
7701 struct parsed_opr opr = OPR_INIT(OPT_REG, OPLM_DWORD, xAX);
7702 j = -1;
7703 from_caller = 0;
7704 ret = resolve_origin(i, &opr, i + opcnt * 4, &j, &from_caller);
7705 }
7706
7707 if (ret != 1 && from_caller) {
7708 // unresolved eax - probably void func
7709 *has_ret = 0;
7710 }
7711 else {
7712 if (j >= 0 && ops[j].op == OP_CALL) {
7713 dep = hg_fp_find_dep(fp, ops[j].operand[0].name);
7714 if (dep != NULL)
7715 dep->ret_dep = 1;
7716 else
7717 *has_ret = 1;
7718 }
7719 else
7720 *has_ret = 1;
7721 }
7722 }
7723
7724 l = regmask_save | regmask_dst;
7725 if (g_bp_frame && !(po->flags & OPF_EBP_S))
7726 l |= 1 << xBP;
7727
7728 l = po->regmask_src & ~l;
7729#if 0
7730 if (l)
7731 fnote(po, "dep |= %04x, dst %04x, save %04x (f %x)\n",
7732 l, regmask_dst, regmask_save, po->flags);
7733#endif
7734 *regmask_dep |= l;
7735 regmask_dst |= po->regmask_dst;
7736
7737 if (po->flags & OPF_TAIL)
7738 return;
7739 }
7740}
7741
7742static void gen_hdr(const char *funcn, int opcnt)
7743{
7744 int save_arg_vars[MAX_ARG_GRP] = { 0, };
7745 unsigned char cbits[MAX_OPS / 8];
7746 const struct parsed_proto *pp_c;
7747 struct parsed_proto *pp;
7748 struct func_prototype *fp;
7749 struct parsed_op *po;
7750 int regmask_dummy = 0;
7751 int regmask_dep;
7752 int max_bp_offset = 0;
7753 int has_ret;
7754 int i, j, l;
7755 int ret;
7756
7757 pp_c = proto_parse(g_fhdr, funcn, 1);
7758 if (pp_c != NULL)
7759 // already in seed, will add to hg_fp later
7760 return;
7761
7762 fp = hg_fp_add(funcn);
7763
7764 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
7765 g_stack_frame_used = 0;
7766
7767 // pass1:
7768 // - resolve all branches
7769 // - parse calls with labels
7770 resolve_branches_parse_calls(opcnt);
7771
7772 // pass2:
7773 // - handle ebp/esp frame, remove ops related to it
7774 scan_prologue_epilogue(opcnt);
7775
7776 // pass3:
7777 // - remove dead labels
7778 // - collect calls
7779 for (i = 0; i < opcnt; i++)
7780 {
7781 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
7782 free(g_labels[i]);
7783 g_labels[i] = NULL;
7784 }
7785
7786 po = &ops[i];
7787 if (po->flags & (OPF_RMD|OPF_DONE))
7788 continue;
7789
7790 if (po->op == OP_CALL) {
7791 if (po->operand[0].type == OPT_LABEL)
7792 hg_fp_add_dep(fp, opr_name(po, 0));
7793 else if (po->pp != NULL)
7794 hg_fp_add_dep(fp, po->pp->name);
7795 }
7796 }
7797
7798 // pass4:
7799 // - remove dead labels
7800 // - handle push <const>/pop pairs
7801 for (i = 0; i < opcnt; i++)
7802 {
7803 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
7804 free(g_labels[i]);
7805 g_labels[i] = NULL;
7806 }
7807
7808 po = &ops[i];
7809 if (po->flags & (OPF_RMD|OPF_DONE))
7810 continue;
7811
7812 if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST)
7813 scan_for_pop_const(i, opcnt, i + opcnt * 13);
7814 }
7815
7816 // pass5:
7817 // - process trivial calls
7818 for (i = 0; i < opcnt; i++)
7819 {
7820 po = &ops[i];
7821 if (po->flags & (OPF_RMD|OPF_DONE))
7822 continue;
7823
7824 if (po->op == OP_CALL)
7825 {
7826 pp = process_call_early(i, opcnt, &j);
7827 if (pp != NULL) {
7828 if (!(po->flags & OPF_ATAIL))
7829 // since we know the args, try to collect them
7830 if (collect_call_args_early(i, pp, NULL, NULL) != 0)
7831 pp = NULL;
7832 }
7833
7834 if (pp != NULL) {
7835 if (j >= 0) {
7836 // commit esp adjust
7837 if (ops[j].op != OP_POP)
7838 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
7839 else {
7840 for (l = 0; l < pp->argc_stack; l++)
7841 ops[j + l].flags |= OPF_DONE | OPF_RMD | OPF_NOREGS;
7842 }
7843 }
7844
7845 po->flags |= OPF_DONE;
7846 }
7847 }
7848 }
7849
7850 // pass6:
7851 // - track saved regs (simple)
7852 // - process calls
7853 for (i = 0; i < opcnt; i++)
7854 {
7855 po = &ops[i];
7856 if (po->flags & (OPF_RMD|OPF_DONE))
7857 continue;
7858
7859 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG
7860 && po->operand[0].reg != xCX)
7861 {
7862 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, 0);
7863 if (ret == 1) {
7864 // regmask_save |= 1 << po->operand[0].reg; // do it later
7865 po->flags |= OPF_RSAVE | OPF_RMD | OPF_DONE;
7866 scan_for_pop_ret(i + 1, opcnt, po->operand[0].reg, OPF_RMD);
7867 }
7868 }
7869 else if (po->op == OP_CALL)
7870 {
7871 pp = process_call(i, opcnt);
7872
7873 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
7874 // since we know the args, collect them
7875 ret = collect_call_args(po, i, pp, &regmask_dummy, save_arg_vars,
7876 i + opcnt * 1);
7877 }
7878 }
7879 }
7880
7881 // pass7
7882 memset(cbits, 0, sizeof(cbits));
7883 regmask_dep = 0;
7884 has_ret = -1;
7885
7886 gen_hdr_dep_pass(0, opcnt, cbits, fp, 0, 0, &regmask_dep, &has_ret);
7887
7888 // find unreachable code - must be fixed in IDA
7889 for (i = 0; i < opcnt; i++)
7890 {
7891 if (cbits[i >> 3] & (1 << (i & 7)))
7892 continue;
7893
7894 if (g_labels[i] == NULL && i > 0 && ops[i - 1].op == OP_CALL
7895 && ops[i - 1].pp != NULL && ops[i - 1].pp->is_osinc)
7896 {
7897 // the compiler sometimes still generates code after
7898 // noreturn OS functions
7899 break;
7900 }
7901 if (ops[i].op != OP_NOP)
7902 ferr(&ops[i], "unreachable code\n");
7903 }
7904
7905 for (i = 0; i < g_eqcnt; i++) {
7906 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
7907 max_bp_offset = g_eqs[i].offset;
7908 }
7909
7910 if (fp->argc_stack < 0) {
7911 max_bp_offset = (max_bp_offset + 3) & ~3;
7912 fp->argc_stack = max_bp_offset / 4;
7913 if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0)
7914 fp->argc_stack--;
7915 }
7916
7917 fp->regmask_dep = regmask_dep & ~((1 << xSP) | mxSTa);
7918 fp->has_ret = has_ret;
7919#if 0
7920 printf("// has_ret %d, regmask_dep %x\n",
7921 fp->has_ret, fp->regmask_dep);
7922 output_hdr_fp(stdout, fp, 1);
7923 if (IS(funcn, "sub_10007F72")) exit(1);
7924#endif
7925
7926 gen_x_cleanup(opcnt);
7927}
7928
7929static void hg_fp_resolve_deps(struct func_prototype *fp)
7930{
7931 struct func_prototype fp_s;
7932 int dep;
7933 int i;
7934
7935 // this thing is recursive, so mark first..
7936 fp->dep_resolved = 1;
7937
7938 for (i = 0; i < fp->dep_func_cnt; i++) {
7939 strcpy(fp_s.name, fp->dep_func[i].name);
7940 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
7941 sizeof(hg_fp[0]), hg_fp_cmp_name);
7942 if (fp->dep_func[i].proto != NULL) {
7943 if (!fp->dep_func[i].proto->dep_resolved)
7944 hg_fp_resolve_deps(fp->dep_func[i].proto);
7945
7946 dep = ~fp->dep_func[i].regmask_live
7947 & fp->dep_func[i].proto->regmask_dep;
7948 fp->regmask_dep |= dep;
7949 // printf("dep %s %s |= %x\n", fp->name,
7950 // fp->dep_func[i].name, dep);
7951
7952 if (fp->has_ret == -1 && fp->dep_func[i].ret_dep)
7953 fp->has_ret = fp->dep_func[i].proto->has_ret;
7954 }
7955 }
7956}
7957
7958// make all thiscall/edx arg functions referenced from .data fastcall
7959static void do_func_refs_from_data(void)
7960{
7961 struct func_prototype *fp, fp_s;
7962 int i;
7963
7964 for (i = 0; i < hg_ref_cnt; i++) {
7965 strcpy(fp_s.name, hg_refs[i]);
7966 fp = bsearch(&fp_s, hg_fp, hg_fp_cnt,
7967 sizeof(hg_fp[0]), hg_fp_cmp_name);
7968 if (fp == NULL)
7969 continue;
7970
7971 if (fp->argc_stack != 0 && (fp->regmask_dep & (mxCX | mxDX)))
7972 fp->regmask_dep |= mxCX | mxDX;
7973 }
7974}
7975
7976static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
7977 int count)
7978{
7979 const struct parsed_proto *pp;
7980 char *p, namebuf[NAMELEN];
7981 const char *name;
7982 int regmask_dep;
7983 int argc_normal;
7984 int j, arg;
7985
7986 for (; count > 0; count--, fp++) {
7987 if (fp->has_ret == -1)
7988 fprintf(fout, "// ret unresolved\n");
7989#if 0
7990 fprintf(fout, "// dep:");
7991 for (j = 0; j < fp->dep_func_cnt; j++) {
7992 fprintf(fout, " %s/", fp->dep_func[j].name);
7993 if (fp->dep_func[j].proto != NULL)
7994 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
7995 fp->dep_func[j].proto->has_ret);
7996 }
7997 fprintf(fout, "\n");
7998#endif
7999
8000 p = strchr(fp->name, '@');
8001 if (p != NULL) {
8002 memcpy(namebuf, fp->name, p - fp->name);
8003 namebuf[p - fp->name] = 0;
8004 name = namebuf;
8005 }
8006 else
8007 name = fp->name;
8008 if (name[0] == '_')
8009 name++;
8010
8011 pp = proto_parse(g_fhdr, name, 1);
8012 if (pp != NULL && pp->is_include)
8013 continue;
8014
8015 if (fp->pp != NULL) {
8016 // part of seed, output later
8017 continue;
8018 }
8019
8020 regmask_dep = fp->regmask_dep;
8021 argc_normal = fp->argc_stack;
8022
8023 fprintf(fout, "%-5s", fp->pp ? fp->pp->ret_type.name :
8024 (fp->has_ret ? "int" : "void"));
8025 if (regmask_dep && (fp->is_stdcall || fp->argc_stack > 0)
8026 && (regmask_dep & ~mxCX) == 0)
8027 {
8028 fprintf(fout, "/*__thiscall*/ ");
8029 argc_normal++;
8030 regmask_dep = 0;
8031 }
8032 else if (regmask_dep && (fp->is_stdcall || fp->argc_stack == 0)
8033 && (regmask_dep & ~(mxCX | mxDX)) == 0)
8034 {
8035 fprintf(fout, " __fastcall ");
8036 if (!(regmask_dep & (1 << xDX)) && fp->argc_stack == 0)
8037 argc_normal = 1;
8038 else
8039 argc_normal += 2;
8040 regmask_dep = 0;
8041 }
8042 else if (regmask_dep && !fp->is_stdcall) {
8043 fprintf(fout, "/*__usercall*/ ");
8044 }
8045 else if (regmask_dep) {
8046 fprintf(fout, "/*__userpurge*/ ");
8047 }
8048 else if (fp->is_stdcall)
8049 fprintf(fout, " __stdcall ");
8050 else
8051 fprintf(fout, " __cdecl ");
8052
8053 fprintf(fout, "%s(", name);
8054
8055 arg = 0;
8056 for (j = 0; j < xSP; j++) {
8057 if (regmask_dep & (1 << j)) {
8058 arg++;
8059 if (arg != 1)
8060 fprintf(fout, ", ");
8061 if (fp->pp != NULL)
8062 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
8063 else
8064 fprintf(fout, "int");
8065 fprintf(fout, " a%d/*<%s>*/", arg, regs_r32[j]);
8066 }
8067 }
8068
8069 for (j = 0; j < argc_normal; j++) {
8070 arg++;
8071 if (arg != 1)
8072 fprintf(fout, ", ");
8073 if (fp->pp != NULL) {
8074 fprintf(fout, "%s", fp->pp->arg[arg - 1].type.name);
8075 if (!fp->pp->arg[arg - 1].type.is_ptr)
8076 fprintf(fout, " ");
8077 }
8078 else
8079 fprintf(fout, "int ");
8080 fprintf(fout, "a%d", arg);
8081 }
8082
8083 fprintf(fout, ");\n");
8084 }
8085}
8086
8087static void output_hdr(FILE *fout)
8088{
8089 static const char *lmod_c_names[] = {
8090 [OPLM_UNSPEC] = "???",
8091 [OPLM_BYTE] = "uint8_t",
8092 [OPLM_WORD] = "uint16_t",
8093 [OPLM_DWORD] = "uint32_t",
8094 [OPLM_QWORD] = "uint64_t",
8095 };
8096 const struct scanned_var *var;
8097 struct func_prototype *fp;
8098 char line[256] = { 0, };
8099 char name[256];
8100 int i;
8101
8102 // add stuff from headers
8103 for (i = 0; i < pp_cache_size; i++) {
8104 if (pp_cache[i].is_cinc && !pp_cache[i].is_stdcall)
8105 snprintf(name, sizeof(name), "_%s", pp_cache[i].name);
8106 else
8107 snprintf(name, sizeof(name), "%s", pp_cache[i].name);
8108 fp = hg_fp_add(name);
8109 fp->pp = &pp_cache[i];
8110 fp->argc_stack = fp->pp->argc_stack;
8111 fp->is_stdcall = fp->pp->is_stdcall;
8112 fp->regmask_dep = get_pp_arg_regmask_src(fp->pp);
8113 fp->has_ret = !IS(fp->pp->ret_type.name, "void");
8114 }
8115
8116 // resolve deps
8117 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
8118 for (i = 0; i < hg_fp_cnt; i++)
8119 hg_fp_resolve_deps(&hg_fp[i]);
8120
8121 // adjust functions referenced from data segment
8122 do_func_refs_from_data();
8123
8124 // note: messes up .proto ptr, don't use
8125 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
8126
8127 // output variables
8128 for (i = 0; i < hg_var_cnt; i++) {
8129 var = &hg_vars[i];
8130
8131 if (var->pp != NULL)
8132 // part of seed
8133 continue;
8134 else if (var->is_c_str)
8135 fprintf(fout, "extern %-8s %s[];", "char", var->name);
8136 else
8137 fprintf(fout, "extern %-8s %s;",
8138 lmod_c_names[var->lmod], var->name);
8139
8140 if (var->is_seeded)
8141 fprintf(fout, " // seeded");
8142 fprintf(fout, "\n");
8143 }
8144
8145 fprintf(fout, "\n");
8146
8147 // output function prototypes
8148 output_hdr_fp(fout, hg_fp, hg_fp_cnt);
8149
8150 // seed passthrough
8151 fprintf(fout, "\n// - seed -\n");
8152
8153 rewind(g_fhdr);
8154 while (fgets(line, sizeof(line), g_fhdr))
8155 fwrite(line, 1, strlen(line), fout);
8156}
8157
8158// '=' needs special treatment
8159// also ' quote
8160static char *next_word_s(char *w, size_t wsize, char *s)
8161{
8162 size_t i;
8163
8164 s = sskip(s);
8165
8166 i = 0;
8167 if (*s == '\'' && s[1] != '\r' && s[1] != '\n') {
8168 w[0] = s[0];
8169 for (i = 1; i < wsize - 1; i++) {
8170 if (s[i] == 0) {
8171 printf("warning: missing closing quote: \"%s\"\n", s);
8172 break;
8173 }
8174 if (s[i] == '\'')
8175 break;
8176 w[i] = s[i];
8177 }
8178 }
8179
8180 for (; i < wsize - 1; i++) {
8181 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
8182 break;
8183 w[i] = s[i];
8184 }
8185 w[i] = 0;
8186
8187 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
8188 printf("warning: '%s' truncated\n", w);
8189
8190 return s + i;
8191}
8192
8193static int cmpstringp(const void *p1, const void *p2)
8194{
8195 return strcmp(*(char * const *)p1, *(char * const *)p2);
8196}
8197
8198static int is_xref_needed(char *p, char **rlist, int rlist_len)
8199{
8200 char *p2;
8201
8202 p = sskip(p);
8203 if (strstr(p, "..."))
8204 // unable to determine, assume needed
8205 return 1;
8206
8207 if (*p == '.') // .text, .data, ...
8208 // ref from other data or non-function -> no
8209 return 0;
8210
8211 p2 = strpbrk(p, "+:\r\n\x18");
8212 if (p2 != NULL)
8213 *p2 = 0;
8214 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
8215 // referenced from removed code
8216 return 0;
8217
8218 return 1;
8219}
8220
8221static int ida_xrefs_show_need(FILE *fasm, char *p,
8222 char **rlist, int rlist_len)
8223{
8224 int found_need = 0;
8225 char line[256];
8226 long pos;
8227
8228 p = strrchr(p, ';');
8229 if (p != NULL && *p == ';' && IS_START(p + 2, "DATA XREF: ")) {
8230 p += 13;
8231 if (is_xref_needed(p, rlist, rlist_len))
8232 return 1;
8233 }
8234
8235 pos = ftell(fasm);
8236 while (1)
8237 {
8238 if (!my_fgets(line, sizeof(line), fasm))
8239 break;
8240 // non-first line is always indented
8241 if (!my_isblank(line[0]))
8242 break;
8243
8244 // should be no content, just comment
8245 p = sskip(line);
8246 if (*p != ';')
8247 break;
8248
8249 p = strrchr(p, ';');
8250 p += 2;
8251 // it's printed once, but no harm to check again
8252 if (IS_START(p, "DATA XREF: "))
8253 p += 11;
8254
8255 if (is_xref_needed(p, rlist, rlist_len)) {
8256 found_need = 1;
8257 break;
8258 }
8259 }
8260 fseek(fasm, pos, SEEK_SET);
8261 return found_need;
8262}
8263
8264static void scan_variables(FILE *fasm, char **rlist, int rlist_len)
8265{
8266 struct scanned_var *var;
8267 char line[256] = { 0, };
8268 char words[4][256];
8269 int no_identifier;
8270 char *p = NULL;
8271 int wordc;
8272 int l;
8273
8274 while (!feof(fasm))
8275 {
8276 // skip to next data section
8277 while (my_fgets(line, sizeof(line), fasm))
8278 {
8279 asmln++;
8280
8281 p = sskip(line);
8282 if (*p == 0 || *p == ';')
8283 continue;
8284
8285 p = sskip(next_word_s(words[0], sizeof(words[0]), p));
8286 if (*p == 0 || *p == ';')
8287 continue;
8288
8289 if (*p != 's' || !IS_START(p, "segment para public"))
8290 continue;
8291
8292 break;
8293 }
8294
8295 if (p == NULL || !IS_START(p, "segment para public"))
8296 break;
8297 p = sskip(p + 19);
8298
8299 if (!IS_START(p, "'DATA'"))
8300 continue;
8301
8302 // now process it
8303 while (my_fgets(line, sizeof(line), fasm))
8304 {
8305 asmln++;
8306
8307 p = line;
8308 no_identifier = my_isblank(*p);
8309
8310 p = sskip(p);
8311 if (*p == 0 || *p == ';')
8312 continue;
8313
8314 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
8315 words[wordc][0] = 0;
8316 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
8317 if (*p == 0 || *p == ';') {
8318 wordc++;
8319 break;
8320 }
8321 }
8322
8323 if (wordc == 2 && IS(words[1], "ends"))
8324 break;
8325 if (wordc < 2)
8326 continue;
8327
8328 if (no_identifier) {
8329 if (wordc >= 3 && IS(words[0], "dd") && IS(words[1], "offset"))
8330 hg_ref_add(words[2]);
8331 continue;
8332 }
8333
8334 if (IS_START(words[0], "__IMPORT_DESCRIPTOR_")) {
8335 // when this starts, we don't need anything from this section
8336 break;
8337 }
8338
8339 // check refs comment(s)
8340 if (!ida_xrefs_show_need(fasm, p, rlist, rlist_len))
8341 continue;
8342
8343 if ((hg_var_cnt & 0xff) == 0) {
8344 hg_vars = realloc(hg_vars, sizeof(hg_vars[0])
8345 * (hg_var_cnt + 0x100));
8346 my_assert_not(hg_vars, NULL);
8347 memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100);
8348 }
8349
8350 var = &hg_vars[hg_var_cnt++];
8351 snprintf(var->name, sizeof(var->name), "%s", words[0]);
8352
8353 // maybe already in seed header?
8354 var->pp = proto_parse(g_fhdr, var->name, 1);
8355 if (var->pp != NULL) {
8356 if (var->pp->is_fptr) {
8357 var->lmod = OPLM_DWORD;
8358 //var->is_ptr = 1;
8359 }
8360 else if (var->pp->is_func)
8361 aerr("func?\n");
8362 else if (!guess_lmod_from_c_type(&var->lmod, &var->pp->type))
8363 aerr("unhandled C type '%s' for '%s'\n",
8364 var->pp->type.name, var->name);
8365
8366 var->is_seeded = 1;
8367 continue;
8368 }
8369
8370 if (IS(words[1], "dd")) {
8371 var->lmod = OPLM_DWORD;
8372 if (wordc >= 4 && IS(words[2], "offset"))
8373 hg_ref_add(words[3]);
8374 }
8375 else if (IS(words[1], "dw"))
8376 var->lmod = OPLM_WORD;
8377 else if (IS(words[1], "db")) {
8378 var->lmod = OPLM_BYTE;
8379 if (wordc >= 3 && (l = strlen(words[2])) > 4) {
8380 if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0"))
8381 var->is_c_str = 1;
8382 }
8383 }
8384 else if (IS(words[1], "dq"))
8385 var->lmod = OPLM_QWORD;
8386 //else if (IS(words[1], "dt"))
8387 else
8388 aerr("type '%s' not known\n", words[1]);
8389 }
8390 }
8391
8392 rewind(fasm);
8393 asmln = 0;
8394}
8395
8396static void set_label(int i, const char *name)
8397{
8398 const char *p;
8399 int len;
8400
8401 len = strlen(name);
8402 p = strchr(name, ':');
8403 if (p != NULL)
8404 len = p - name;
8405
8406 if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_"))
8407 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
8408 g_labels[i] = realloc(g_labels[i], len + 1);
8409 my_assert_not(g_labels[i], NULL);
8410 memcpy(g_labels[i], name, len);
8411 g_labels[i][len] = 0;
8412}
8413
8414struct chunk_item {
8415 char *name;
8416 long fptr;
8417 int asmln;
8418};
8419
8420static struct chunk_item *func_chunks;
8421static int func_chunk_cnt;
8422static int func_chunk_alloc;
8423
8424static void add_func_chunk(FILE *fasm, const char *name, int line)
8425{
8426 if (func_chunk_cnt >= func_chunk_alloc) {
8427 func_chunk_alloc *= 2;
8428 func_chunks = realloc(func_chunks,
8429 func_chunk_alloc * sizeof(func_chunks[0]));
8430 my_assert_not(func_chunks, NULL);
8431 }
8432 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
8433 func_chunks[func_chunk_cnt].name = strdup(name);
8434 func_chunks[func_chunk_cnt].asmln = line;
8435 func_chunk_cnt++;
8436}
8437
8438static int cmp_chunks(const void *p1, const void *p2)
8439{
8440 const struct chunk_item *c1 = p1, *c2 = p2;
8441 return strcmp(c1->name, c2->name);
8442}
8443
8444static void scan_ahead(FILE *fasm)
8445{
8446 char words[2][256];
8447 char line[256];
8448 long oldpos;
8449 int oldasmln;
8450 int wordc;
8451 char *p;
8452 int i;
8453
8454 oldpos = ftell(fasm);
8455 oldasmln = asmln;
8456
8457 while (my_fgets(line, sizeof(line), fasm))
8458 {
8459 wordc = 0;
8460 asmln++;
8461
8462 p = sskip(line);
8463 if (*p == 0)
8464 continue;
8465
8466 if (*p == ';')
8467 {
8468 // get rid of random tabs
8469 for (i = 0; line[i] != 0; i++)
8470 if (line[i] == '\t')
8471 line[i] = ' ';
8472
8473 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
8474 {
8475 p += 30;
8476 next_word(words[0], sizeof(words[0]), p);
8477 if (words[0][0] == 0)
8478 aerr("missing name for func chunk?\n");
8479
8480 add_func_chunk(fasm, words[0], asmln);
8481 }
8482 else if (IS_START(p, "; sctend"))
8483 break;
8484
8485 continue;
8486 } // *p == ';'
8487
8488 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
8489 words[wordc][0] = 0;
8490 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
8491 if (*p == 0 || *p == ';') {
8492 wordc++;
8493 break;
8494 }
8495 }
8496
8497 if (wordc == 2 && IS(words[1], "ends"))
8498 break;
8499 }
8500
8501 fseek(fasm, oldpos, SEEK_SET);
8502 asmln = oldasmln;
8503}
8504
8505int main(int argc, char *argv[])
8506{
8507 FILE *fout, *fasm, *frlist;
8508 struct parsed_data *pd = NULL;
8509 int pd_alloc = 0;
8510 char **rlist = NULL;
8511 int rlist_len = 0;
8512 int rlist_alloc = 0;
8513 int func_chunks_used = 0;
8514 int func_chunks_sorted = 0;
8515 int func_chunk_i = -1;
8516 long func_chunk_ret = 0;
8517 int func_chunk_ret_ln = 0;
8518 int scanned_ahead = 0;
8519 char line[256];
8520 char words[20][256];
8521 enum opr_lenmod lmod;
8522 char *sctproto = NULL;
8523 int in_func = 0;
8524 int pending_endp = 0;
8525 int skip_func = 0;
8526 int skip_warned = 0;
8527 int eq_alloc;
8528 int verbose = 0;
8529 int multi_seg = 0;
8530 int end = 0;
8531 int arg_out;
8532 int arg;
8533 int pi = 0;
8534 int i, j;
8535 int ret, len;
8536 char *p;
8537 int wordc;
8538
8539 for (arg = 1; arg < argc; arg++) {
8540 if (IS(argv[arg], "-v"))
8541 verbose = 1;
8542 else if (IS(argv[arg], "-rf"))
8543 g_allow_regfunc = 1;
8544 else if (IS(argv[arg], "-m"))
8545 multi_seg = 1;
8546 else if (IS(argv[arg], "-hdr"))
8547 g_header_mode = g_quiet_pp = g_allow_regfunc = 1;
8548 else
8549 break;
8550 }
8551
8552 if (argc < arg + 3) {
8553 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdr.h> [rlist]*\n"
8554 "%s -hdr <out.h> <.asm> <seed.h> [rlist]*\n"
8555 "options:\n"
8556 " -hdr - header generation mode\n"
8557 " -rf - allow unannotated indirect calls\n"
8558 " -m - allow multiple .text sections\n"
8559 "[rlist] is a file with function names to skip,"
8560 " one per line\n",
8561 argv[0], argv[0]);
8562 return 1;
8563 }
8564
8565 arg_out = arg++;
8566
8567 asmfn = argv[arg++];
8568 fasm = fopen(asmfn, "r");
8569 my_assert_not(fasm, NULL);
8570
8571 hdrfn = argv[arg++];
8572 g_fhdr = fopen(hdrfn, "r");
8573 my_assert_not(g_fhdr, NULL);
8574
8575 rlist_alloc = 64;
8576 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
8577 my_assert_not(rlist, NULL);
8578 // needs special handling..
8579 rlist[rlist_len++] = "__alloca_probe";
8580
8581 func_chunk_alloc = 32;
8582 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
8583 my_assert_not(func_chunks, NULL);
8584
8585 memset(words, 0, sizeof(words));
8586
8587 for (; arg < argc; arg++) {
8588 frlist = fopen(argv[arg], "r");
8589 my_assert_not(frlist, NULL);
8590
8591 while (my_fgets(line, sizeof(line), frlist)) {
8592 p = sskip(line);
8593 if (*p == 0 || *p == ';')
8594 continue;
8595 if (*p == '#') {
8596 if (IS_START(p, "#if 0")
8597 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
8598 {
8599 skip_func = 1;
8600 }
8601 else if (IS_START(p, "#endif"))
8602 skip_func = 0;
8603 continue;
8604 }
8605 if (skip_func)
8606 continue;
8607
8608 p = next_word(words[0], sizeof(words[0]), p);
8609 if (words[0][0] == 0)
8610 continue;
8611
8612 if (rlist_len >= rlist_alloc) {
8613 rlist_alloc = rlist_alloc * 2 + 64;
8614 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
8615 my_assert_not(rlist, NULL);
8616 }
8617 rlist[rlist_len++] = strdup(words[0]);
8618 }
8619 skip_func = 0;
8620
8621 fclose(frlist);
8622 frlist = NULL;
8623 }
8624
8625 if (rlist_len > 0)
8626 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
8627
8628 fout = fopen(argv[arg_out], "w");
8629 my_assert_not(fout, NULL);
8630
8631 eq_alloc = 128;
8632 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
8633 my_assert_not(g_eqs, NULL);
8634
8635 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
8636 g_label_refs[i].i = -1;
8637 g_label_refs[i].next = NULL;
8638 }
8639
8640 if (g_header_mode)
8641 scan_variables(fasm, rlist, rlist_len);
8642
8643 while (my_fgets(line, sizeof(line), fasm))
8644 {
8645 wordc = 0;
8646 asmln++;
8647
8648 p = sskip(line);
8649 if (*p == 0)
8650 continue;
8651
8652 // get rid of random tabs
8653 for (i = 0; line[i] != 0; i++)
8654 if (line[i] == '\t')
8655 line[i] = ' ';
8656
8657 if (*p == ';')
8658 {
8659 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
8660 goto do_pending_endp; // eww..
8661
8662 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
8663 {
8664 static const char *attrs[] = {
8665 "bp-based frame",
8666 "library function",
8667 "static",
8668 "noreturn",
8669 "thunk",
8670 "fpd=",
8671 };
8672
8673 // parse IDA's attribute-list comment
8674 g_ida_func_attr = 0;
8675 p = sskip(p + 13);
8676
8677 for (; *p != 0; p = sskip(p)) {
8678 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
8679 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
8680 g_ida_func_attr |= 1 << i;
8681 p += strlen(attrs[i]);
8682 break;
8683 }
8684 }
8685 if (i == ARRAY_SIZE(attrs)) {
8686 anote("unparsed IDA attr: %s\n", p);
8687 break;
8688 }
8689 if (IS(attrs[i], "fpd=")) {
8690 p = next_word(words[0], sizeof(words[0]), p);
8691 // ignore for now..
8692 }
8693 }
8694 }
8695 else if (p[2] == 's' && IS_START(p, "; sctattr:"))
8696 {
8697 static const char *attrs[] = {
8698 "clear_sf",
8699 "clear_regmask",
8700 };
8701
8702 // parse manual attribute-list comment
8703 g_sct_func_attr = 0;
8704 p = sskip(p + 10);
8705
8706 for (; *p != 0; p = sskip(p)) {
8707 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
8708 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
8709 g_sct_func_attr |= 1 << i;
8710 p += strlen(attrs[i]);
8711 break;
8712 }
8713 }
8714 if (*p == '=') {
8715 j = ret = 0;
8716 if (i == 0)
8717 // clear_sf=start,len (in dwords)
8718 ret = sscanf(p, "=%d,%d%n", &g_stack_clear_start,
8719 &g_stack_clear_len, &j);
8720 else if (i == 1)
8721 // clear_regmask=<mask>
8722 ret = sscanf(p, "=%x%n", &g_regmask_init, &j) + 1;
8723 if (ret < 2) {
8724 anote("unparsed attr value: %s\n", p);
8725 break;
8726 }
8727 p += j;
8728 }
8729 else if (i == ARRAY_SIZE(attrs)) {
8730 anote("unparsed sct attr: %s\n", p);
8731 break;
8732 }
8733 }
8734 }
8735 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
8736 {
8737 p += 30;
8738 next_word(words[0], sizeof(words[0]), p);
8739 if (words[0][0] == 0)
8740 aerr("missing name for func chunk?\n");
8741
8742 if (!scanned_ahead) {
8743 add_func_chunk(fasm, words[0], asmln);
8744 func_chunks_sorted = 0;
8745 }
8746 }
8747 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
8748 {
8749 if (func_chunk_i >= 0) {
8750 if (func_chunk_i < func_chunk_cnt
8751 && IS(func_chunks[func_chunk_i].name, g_func))
8752 {
8753 // move on to next chunk
8754 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
8755 if (ret)
8756 aerr("seek failed for '%s' chunk #%d\n",
8757 g_func, func_chunk_i);
8758 asmln = func_chunks[func_chunk_i].asmln;
8759 func_chunk_i++;
8760 }
8761 else {
8762 if (func_chunk_ret == 0)
8763 aerr("no return from chunk?\n");
8764 fseek(fasm, func_chunk_ret, SEEK_SET);
8765 asmln = func_chunk_ret_ln;
8766 func_chunk_ret = 0;
8767 pending_endp = 1;
8768 }
8769 }
8770 }
8771 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
8772 func_chunks_used = 1;
8773 p += 20;
8774 if (IS_START(g_func, "sub_")) {
8775 unsigned long addr = strtoul(p, NULL, 16);
8776 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
8777 if (addr > f_addr && !scanned_ahead) {
8778 //anote("scan_ahead caused by '%s', addr %lx\n",
8779 // g_func, addr);
8780 scan_ahead(fasm);
8781 scanned_ahead = 1;
8782 func_chunks_sorted = 0;
8783 }
8784 }
8785 }
8786 continue;
8787 } // *p == ';'
8788
8789parse_words:
8790 for (i = wordc; i < ARRAY_SIZE(words); i++)
8791 words[i][0] = 0;
8792 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
8793 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
8794 if (*p == 0 || *p == ';') {
8795 wordc++;
8796 break;
8797 }
8798 }
8799 if (*p != 0 && *p != ';')
8800 aerr("too many words\n");
8801
8802 // alow asm patches in comments
8803 if (*p == ';') {
8804 if (IS_START(p, "; sctpatch:")) {
8805 p = sskip(p + 11);
8806 if (*p == 0 || *p == ';')
8807 continue;
8808 goto parse_words; // lame
8809 }
8810 if (IS_START(p, "; sctproto:")) {
8811 sctproto = strdup(p + 11);
8812 }
8813 else if (IS_START(p, "; sctend")) {
8814 end = 1;
8815 if (!pending_endp)
8816 break;
8817 }
8818 }
8819
8820 if (wordc == 0) {
8821 // shouldn't happen
8822 awarn("wordc == 0?\n");
8823 continue;
8824 }
8825
8826 // don't care about this:
8827 if (words[0][0] == '.'
8828 || IS(words[0], "include")
8829 || IS(words[0], "assume") || IS(words[1], "segment")
8830 || IS(words[0], "align"))
8831 {
8832 continue;
8833 }
8834
8835do_pending_endp:
8836 // do delayed endp processing to collect switch jumptables
8837 if (pending_endp) {
8838 if (in_func && !g_skip_func && !end && wordc >= 2
8839 && ((words[0][0] == 'd' && words[0][2] == 0)
8840 || (words[1][0] == 'd' && words[1][2] == 0)))
8841 {
8842 i = 1;
8843 if (words[1][0] == 'd' && words[1][2] == 0) {
8844 // label
8845 if (g_func_pd_cnt >= pd_alloc) {
8846 pd_alloc = pd_alloc * 2 + 16;
8847 g_func_pd = realloc(g_func_pd,
8848 sizeof(g_func_pd[0]) * pd_alloc);
8849 my_assert_not(g_func_pd, NULL);
8850 }
8851 pd = &g_func_pd[g_func_pd_cnt];
8852 g_func_pd_cnt++;
8853 memset(pd, 0, sizeof(*pd));
8854 strcpy(pd->label, words[0]);
8855 pd->type = OPT_CONST;
8856 pd->lmod = lmod_from_directive(words[1]);
8857 i = 2;
8858 }
8859 else {
8860 if (pd == NULL) {
8861 if (verbose)
8862 anote("skipping alignment byte?\n");
8863 continue;
8864 }
8865 lmod = lmod_from_directive(words[0]);
8866 if (lmod != pd->lmod)
8867 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
8868 }
8869
8870 if (pd->count_alloc < pd->count + wordc) {
8871 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
8872 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
8873 my_assert_not(pd->d, NULL);
8874 }
8875 for (; i < wordc; i++) {
8876 if (IS(words[i], "offset")) {
8877 pd->type = OPT_OFFSET;
8878 i++;
8879 }
8880 p = strchr(words[i], ',');
8881 if (p != NULL)
8882 *p = 0;
8883 if (pd->type == OPT_OFFSET)
8884 pd->d[pd->count].u.label = strdup(words[i]);
8885 else
8886 pd->d[pd->count].u.val = parse_number(words[i]);
8887 pd->d[pd->count].bt_i = -1;
8888 pd->count++;
8889 }
8890 continue;
8891 }
8892
8893 if (in_func && !g_skip_func) {
8894 if (g_header_mode)
8895 gen_hdr(g_func, pi);
8896 else
8897 gen_func(fout, g_fhdr, g_func, pi);
8898 }
8899
8900 pending_endp = 0;
8901 in_func = 0;
8902 g_ida_func_attr = 0;
8903 g_sct_func_attr = 0;
8904 g_stack_clear_start = 0;
8905 g_stack_clear_len = 0;
8906 g_regmask_init = 0;
8907 skip_warned = 0;
8908 g_skip_func = 0;
8909 g_func[0] = 0;
8910 func_chunks_used = 0;
8911 func_chunk_i = -1;
8912 if (pi != 0) {
8913 memset(&ops, 0, pi * sizeof(ops[0]));
8914 clear_labels(pi);
8915 pi = 0;
8916 }
8917 g_eqcnt = 0;
8918 for (i = 0; i < g_func_pd_cnt; i++) {
8919 pd = &g_func_pd[i];
8920 if (pd->type == OPT_OFFSET) {
8921 for (j = 0; j < pd->count; j++)
8922 free(pd->d[j].u.label);
8923 }
8924 free(pd->d);
8925 pd->d = NULL;
8926 }
8927 g_func_pd_cnt = 0;
8928 g_func_lmods = 0;
8929 pd = NULL;
8930
8931 if (end)
8932 break;
8933 if (wordc == 0)
8934 continue;
8935 }
8936
8937 if (IS(words[1], "proc")) {
8938 if (in_func)
8939 aerr("proc '%s' while in_func '%s'?\n",
8940 words[0], g_func);
8941 p = words[0];
8942 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
8943 g_skip_func = 1;
8944 strcpy(g_func, words[0]);
8945 set_label(0, words[0]);
8946 in_func = 1;
8947 continue;
8948 }
8949
8950 if (IS(words[1], "endp"))
8951 {
8952 if (!in_func)
8953 aerr("endp '%s' while not in_func?\n", words[0]);
8954 if (!IS(g_func, words[0]))
8955 aerr("endp '%s' while in_func '%s'?\n",
8956 words[0], g_func);
8957
8958 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
8959 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
8960 {
8961 // import jump
8962 g_skip_func = 1;
8963 }
8964
8965 if (!g_skip_func && func_chunks_used) {
8966 // start processing chunks
8967 struct chunk_item *ci, key = { g_func, 0 };
8968
8969 func_chunk_ret = ftell(fasm);
8970 func_chunk_ret_ln = asmln;
8971 if (!func_chunks_sorted) {
8972 qsort(func_chunks, func_chunk_cnt,
8973 sizeof(func_chunks[0]), cmp_chunks);
8974 func_chunks_sorted = 1;
8975 }
8976 ci = bsearch(&key, func_chunks, func_chunk_cnt,
8977 sizeof(func_chunks[0]), cmp_chunks);
8978 if (ci == NULL)
8979 aerr("'%s' needs chunks, but none found\n", g_func);
8980 func_chunk_i = ci - func_chunks;
8981 for (; func_chunk_i > 0; func_chunk_i--)
8982 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
8983 break;
8984
8985 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
8986 if (ret)
8987 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
8988 asmln = func_chunks[func_chunk_i].asmln;
8989 func_chunk_i++;
8990 continue;
8991 }
8992 pending_endp = 1;
8993 continue;
8994 }
8995
8996 if (wordc == 2 && IS(words[1], "ends")) {
8997 if (!multi_seg) {
8998 end = 1;
8999 if (pending_endp)
9000 goto do_pending_endp;
9001 break;
9002 }
9003
9004 // scan for next text segment
9005 while (my_fgets(line, sizeof(line), fasm)) {
9006 asmln++;
9007 p = sskip(line);
9008 if (*p == 0 || *p == ';')
9009 continue;
9010
9011 if (strstr(p, "segment para public 'CODE' use32"))
9012 break;
9013 }
9014
9015 continue;
9016 }
9017
9018 p = strchr(words[0], ':');
9019 if (p != NULL) {
9020 set_label(pi, words[0]);
9021 continue;
9022 }
9023
9024 if (!in_func || g_skip_func) {
9025 if (!skip_warned && !g_skip_func && g_labels[pi] != NULL) {
9026 if (verbose)
9027 anote("skipping from '%s'\n", g_labels[pi]);
9028 skip_warned = 1;
9029 }
9030 free(g_labels[pi]);
9031 g_labels[pi] = NULL;
9032 continue;
9033 }
9034
9035 if (wordc > 1 && IS(words[1], "="))
9036 {
9037 if (wordc != 5)
9038 aerr("unhandled equ, wc=%d\n", wordc);
9039 if (g_eqcnt >= eq_alloc) {
9040 eq_alloc *= 2;
9041 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
9042 my_assert_not(g_eqs, NULL);
9043 }
9044
9045 len = strlen(words[0]);
9046 if (len > sizeof(g_eqs[0].name) - 1)
9047 aerr("equ name too long: %d\n", len);
9048 strcpy(g_eqs[g_eqcnt].name, words[0]);
9049
9050 if (!IS(words[3], "ptr"))
9051 aerr("unhandled equ\n");
9052 if (IS(words[2], "dword"))
9053 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
9054 else if (IS(words[2], "word"))
9055 g_eqs[g_eqcnt].lmod = OPLM_WORD;
9056 else if (IS(words[2], "byte"))
9057 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
9058 else if (IS(words[2], "qword"))
9059 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
9060 else
9061 aerr("bad lmod: '%s'\n", words[2]);
9062
9063 g_eqs[g_eqcnt].offset = parse_number(words[4]);
9064 g_eqcnt++;
9065 continue;
9066 }
9067
9068 if (pi >= ARRAY_SIZE(ops))
9069 aerr("too many ops\n");
9070
9071 parse_op(&ops[pi], words, wordc);
9072
9073 ops[pi].datap = sctproto;
9074 sctproto = NULL;
9075 pi++;
9076 }
9077
9078 if (g_header_mode)
9079 output_hdr(fout);
9080
9081 fclose(fout);
9082 fclose(fasm);
9083 fclose(g_fhdr);
9084
9085 return 0;
9086}
9087
9088// vim:ts=2:shiftwidth=2:expandtab
Unnamed repository; edit this file 'description' to name the repository.