notaz.gp2x.de / ia32rtools.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
translate: use separate removed and done flags
[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
17#define ARRAY_SIZE(x) (sizeof(x) / sizeof(x[0]))
18#define IS(w, y) !strcmp(w, y)
19#define IS_START(w, y) !strncmp(w, y, strlen(y))
20
21#include "protoparse.h"
22
23static const char *asmfn;
24static int asmln;
25static FILE *g_fhdr;
26
27#define anote(fmt, ...) \
28 printf("%s:%d: note: " fmt, asmfn, asmln, ##__VA_ARGS__)
29#define awarn(fmt, ...) \
30 printf("%s:%d: warning: " fmt, asmfn, asmln, ##__VA_ARGS__)
31#define aerr(fmt, ...) do { \
32 printf("%s:%d: error: " fmt, asmfn, asmln, ##__VA_ARGS__); \
33 fcloseall(); \
34 exit(1); \
35} while (0)
36
37#include "masm_tools.h"
38
39enum op_flags {
40 OPF_RMD = (1 << 0), /* removed from code generation */
41 OPF_DATA = (1 << 1), /* data processing - writes to dst opr */
42 OPF_FLAGS = (1 << 2), /* sets flags */
43 OPF_JMP = (1 << 3), /* branch, call */
44 OPF_CJMP = (1 << 4), /* cond. branch (cc or jecxz) */
45 OPF_CC = (1 << 5), /* uses flags */
46 OPF_TAIL = (1 << 6), /* ret or tail call */
47 OPF_RSAVE = (1 << 7), /* push/pop is local reg save/load */
48 OPF_REP = (1 << 8), /* prefixed by rep */
49 OPF_REPZ = (1 << 9), /* rep is repe/repz */
50 OPF_REPNZ = (1 << 10), /* rep is repne/repnz */
51 OPF_FARG = (1 << 11), /* push collected as func arg */
52 OPF_FARGNR = (1 << 12), /* push collected as func arg (no reuse) */
53 OPF_EBP_S = (1 << 13), /* ebp used as scratch here, not BP */
54 OPF_DF = (1 << 14), /* DF flag set */
55 OPF_ATAIL = (1 << 15), /* tail call with reused arg frame */
56 OPF_32BIT = (1 << 16), /* 32bit division */
57 OPF_LOCK = (1 << 17), /* op has lock prefix */
58 OPF_VAPUSH = (1 << 18), /* vararg ptr push (as call arg) */
59 OPF_DONE = (1 << 19), /* already fully handled by analysis */
60};
61
62enum op_op {
63 OP_INVAL,
64 OP_NOP,
65 OP_PUSH,
66 OP_POP,
67 OP_LEAVE,
68 OP_MOV,
69 OP_LEA,
70 OP_MOVZX,
71 OP_MOVSX,
72 OP_XCHG,
73 OP_NOT,
74 OP_CDQ,
75 OP_LODS,
76 OP_STOS,
77 OP_MOVS,
78 OP_CMPS,
79 OP_SCAS,
80 OP_STD,
81 OP_CLD,
82 OP_RET,
83 OP_ADD,
84 OP_SUB,
85 OP_AND,
86 OP_OR,
87 OP_XOR,
88 OP_SHL,
89 OP_SHR,
90 OP_SAR,
91 OP_SHRD,
92 OP_ROL,
93 OP_ROR,
94 OP_RCL,
95 OP_RCR,
96 OP_ADC,
97 OP_SBB,
98 OP_BSF,
99 OP_INC,
100 OP_DEC,
101 OP_NEG,
102 OP_MUL,
103 OP_IMUL,
104 OP_DIV,
105 OP_IDIV,
106 OP_TEST,
107 OP_CMP,
108 OP_CALL,
109 OP_JMP,
110 OP_JECXZ,
111 OP_JCC,
112 OP_SCC,
113 // x87
114 // mmx
115 OP_EMMS,
116 // mmx
117 OP_UD2,
118};
119
120enum opr_type {
121 OPT_UNSPEC,
122 OPT_REG,
123 OPT_REGMEM,
124 OPT_LABEL,
125 OPT_OFFSET,
126 OPT_CONST,
127};
128
129// must be sorted (larger len must be further in enum)
130enum opr_lenmod {
131 OPLM_UNSPEC,
132 OPLM_BYTE,
133 OPLM_WORD,
134 OPLM_DWORD,
135 OPLM_QWORD,
136};
137
138#define MAX_OPERANDS 3
139#define NAMELEN 112
140
141struct parsed_opr {
142 enum opr_type type;
143 enum opr_lenmod lmod;
144 unsigned int is_ptr:1; // pointer in C
145 unsigned int is_array:1; // array in C
146 unsigned int type_from_var:1; // .. in header, sometimes wrong
147 unsigned int size_mismatch:1; // type override differs from C
148 unsigned int size_lt:1; // type override is larger than C
149 unsigned int had_ds:1; // had ds: prefix
150 const struct parsed_proto *pp; // for OPT_LABEL
151 int reg;
152 unsigned int val;
153 char name[NAMELEN];
154};
155
156struct parsed_op {
157 enum op_op op;
158 struct parsed_opr operand[MAX_OPERANDS];
159 unsigned int flags;
160 unsigned char pfo;
161 unsigned char pfo_inv;
162 unsigned char operand_cnt;
163 unsigned char p_argnum; // arg push: altered before call arg #
164 unsigned char p_arggrp; // arg push: arg group # for above
165 unsigned char p_argpass;// arg push: arg of host func
166 short p_argnext;// arg push: same arg pushed elsewhere or -1
167 int regmask_src; // all referensed regs
168 int regmask_dst;
169 int pfomask; // flagop: parsed_flag_op that can't be delayed
170 int cc_scratch; // scratch storage during analysis
171 int bt_i; // branch target for branches
172 struct parsed_data *btj;// branch targets for jumptables
173 struct parsed_proto *pp;// parsed_proto for OP_CALL
174 void *datap;
175 int asmln;
176};
177
178// datap:
179// OP_CALL - parser proto hint (str)
180// (OPF_CC) - points to one of (OPF_FLAGS) that affects cc op
181// OP_POP - points to OP_PUSH in push/pop pair
182
183struct parsed_equ {
184 char name[64];
185 enum opr_lenmod lmod;
186 int offset;
187};
188
189struct parsed_data {
190 char label[256];
191 enum opr_type type;
192 enum opr_lenmod lmod;
193 int count;
194 int count_alloc;
195 struct {
196 union {
197 char *label;
198 unsigned int val;
199 } u;
200 int bt_i;
201 } *d;
202};
203
204struct label_ref {
205 int i;
206 struct label_ref *next;
207};
208
209enum ida_func_attr {
210 IDAFA_BP_FRAME = (1 << 0),
211 IDAFA_LIB_FUNC = (1 << 1),
212 IDAFA_STATIC = (1 << 2),
213 IDAFA_NORETURN = (1 << 3),
214 IDAFA_THUNK = (1 << 4),
215 IDAFA_FPD = (1 << 5),
216};
217
218// note: limited to 32k due to p_argnext
219#define MAX_OPS 4096
220#define MAX_ARG_GRP 2
221
222static struct parsed_op ops[MAX_OPS];
223static struct parsed_equ *g_eqs;
224static int g_eqcnt;
225static char *g_labels[MAX_OPS];
226static struct label_ref g_label_refs[MAX_OPS];
227static const struct parsed_proto *g_func_pp;
228static struct parsed_data *g_func_pd;
229static int g_func_pd_cnt;
230static char g_func[256];
231static char g_comment[256];
232static int g_bp_frame;
233static int g_sp_frame;
234static int g_stack_frame_used;
235static int g_stack_fsz;
236static int g_ida_func_attr;
237static int g_allow_regfunc;
238static int g_quiet_pp;
239static int g_header_mode;
240
241#define ferr(op_, fmt, ...) do { \
242 printf("%s:%d: error: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
243 dump_op(op_), ##__VA_ARGS__); \
244 fcloseall(); \
245 exit(1); \
246} while (0)
247#define fnote(op_, fmt, ...) \
248 printf("%s:%d: note: [%s] '%s': " fmt, asmfn, (op_)->asmln, g_func, \
249 dump_op(op_), ##__VA_ARGS__)
250
251#define ferr_assert(op_, cond) do { \
252 if (!(cond)) ferr(op_, "assertion '%s' failed on ln :%d\n", #cond, \
253 __LINE__); \
254} while (0)
255
256const char *regs_r32[] = {
257 "eax", "ebx", "ecx", "edx", "esi", "edi", "ebp", "esp",
258 // not r32, but list here for easy parsing and printing
259 "mm0", "mm1", "mm2", "mm3", "mm4", "mm5", "mm6", "mm7",
260};
261const char *regs_r16[] = { "ax", "bx", "cx", "dx", "si", "di", "bp", "sp" };
262const char *regs_r8l[] = { "al", "bl", "cl", "dl" };
263const char *regs_r8h[] = { "ah", "bh", "ch", "dh" };
264
265enum x86_regs { xUNSPEC = -1, xAX, xBX, xCX, xDX, xSI, xDI, xBP, xSP };
266
267// possible basic comparison types (without inversion)
268enum parsed_flag_op {
269 PFO_O, // 0 OF=1
270 PFO_C, // 2 CF=1
271 PFO_Z, // 4 ZF=1
272 PFO_BE, // 6 CF=1||ZF=1
273 PFO_S, // 8 SF=1
274 PFO_P, // a PF=1
275 PFO_L, // c SF!=OF
276 PFO_LE, // e ZF=1||SF!=OF
277};
278
279#define PFOB_O (1 << PFO_O)
280#define PFOB_C (1 << PFO_C)
281#define PFOB_Z (1 << PFO_Z)
282#define PFOB_S (1 << PFO_S)
283
284static const char *parsed_flag_op_names[] = {
285 "o", "c", "z", "be", "s", "p", "l", "le"
286};
287
288static int char_array_i(const char *array[], size_t len, const char *s)
289{
290 int i;
291
292 for (i = 0; i < len; i++)
293 if (IS(s, array[i]))
294 return i;
295
296 return -1;
297}
298
299static void printf_number(char *buf, size_t buf_size,
300 unsigned long number)
301{
302 // output in C-friendly form
303 snprintf(buf, buf_size, number < 10 ? "%lu" : "0x%02lx", number);
304}
305
306static int check_segment_prefix(const char *s)
307{
308 if (s[0] == 0 || s[1] != 's' || s[2] != ':')
309 return 0;
310
311 switch (s[0]) {
312 case 'c': return 1;
313 case 'd': return 2;
314 case 's': return 3;
315 case 'e': return 4;
316 case 'f': return 5;
317 case 'g': return 6;
318 default: return 0;
319 }
320}
321
322static int parse_reg(enum opr_lenmod *reg_lmod, const char *s)
323{
324 int reg;
325
326 reg = char_array_i(regs_r32, ARRAY_SIZE(regs_r32), s);
327 if (reg >= 8) {
328 *reg_lmod = OPLM_QWORD;
329 return reg;
330 }
331 if (reg >= 0) {
332 *reg_lmod = OPLM_DWORD;
333 return reg;
334 }
335 reg = char_array_i(regs_r16, ARRAY_SIZE(regs_r16), s);
336 if (reg >= 0) {
337 *reg_lmod = OPLM_WORD;
338 return reg;
339 }
340 reg = char_array_i(regs_r8h, ARRAY_SIZE(regs_r8h), s);
341 if (reg >= 0) {
342 *reg_lmod = OPLM_BYTE;
343 return reg;
344 }
345 reg = char_array_i(regs_r8l, ARRAY_SIZE(regs_r8l), s);
346 if (reg >= 0) {
347 *reg_lmod = OPLM_BYTE;
348 return reg;
349 }
350
351 return -1;
352}
353
354static int parse_indmode(char *name, int *regmask, int need_c_cvt)
355{
356 enum opr_lenmod lmod;
357 char cvtbuf[256];
358 char *d = cvtbuf;
359 char *s = name;
360 char w[64];
361 long number;
362 int reg;
363 int c = 0;
364
365 *d = 0;
366
367 while (*s != 0) {
368 d += strlen(d);
369 while (my_isblank(*s))
370 s++;
371 for (; my_issep(*s); d++, s++)
372 *d = *s;
373 while (my_isblank(*s))
374 s++;
375 *d = 0;
376
377 // skip '?s:' prefixes
378 if (check_segment_prefix(s))
379 s += 3;
380
381 s = next_idt(w, sizeof(w), s);
382 if (w[0] == 0)
383 break;
384 c++;
385
386 reg = parse_reg(&lmod, w);
387 if (reg >= 0) {
388 *regmask |= 1 << reg;
389 goto pass;
390 }
391
392 if ('0' <= w[0] && w[0] <= '9') {
393 number = parse_number(w);
394 printf_number(d, sizeof(cvtbuf) - (d - cvtbuf), number);
395 continue;
396 }
397
398 // probably some label/identifier - pass
399
400pass:
401 snprintf(d, sizeof(cvtbuf) - (d - cvtbuf), "%s", w);
402 }
403
404 if (need_c_cvt)
405 strcpy(name, cvtbuf);
406
407 return c;
408}
409
410static int is_reg_in_str(const char *s)
411{
412 int i;
413
414 if (strlen(s) < 3 || (s[3] && !my_issep(s[3]) && !my_isblank(s[3])))
415 return 0;
416
417 for (i = 0; i < ARRAY_SIZE(regs_r32); i++)
418 if (!strncmp(s, regs_r32[i], 3))
419 return 1;
420
421 return 0;
422}
423
424static const char *parse_stack_el(const char *name, char *extra_reg,
425 int early_try)
426{
427 const char *p, *p2, *s;
428 char *endp = NULL;
429 char buf[32];
430 long val;
431 int len;
432
433 if (g_bp_frame || early_try)
434 {
435 p = name;
436 if (IS_START(p + 3, "+ebp+") && is_reg_in_str(p)) {
437 p += 4;
438 if (extra_reg != NULL) {
439 strncpy(extra_reg, name, 3);
440 extra_reg[4] = 0;
441 }
442 }
443
444 if (IS_START(p, "ebp+")) {
445 p += 4;
446
447 p2 = strchr(p, '+');
448 if (p2 != NULL && is_reg_in_str(p)) {
449 if (extra_reg != NULL) {
450 strncpy(extra_reg, p, p2 - p);
451 extra_reg[p2 - p] = 0;
452 }
453 p = p2 + 1;
454 }
455
456 if (!('0' <= *p && *p <= '9'))
457 return p;
458
459 return NULL;
460 }
461 }
462
463 if (!IS_START(name, "esp+"))
464 return NULL;
465
466 s = name + 4;
467 p = strchr(s, '+');
468 if (p) {
469 if (is_reg_in_str(s)) {
470 if (extra_reg != NULL) {
471 strncpy(extra_reg, s, p - s);
472 extra_reg[p - s] = 0;
473 }
474 s = p + 1;
475 p = strchr(s, '+');
476 if (p == NULL)
477 aerr("%s IDA stackvar not set?\n", __func__);
478 }
479 if (!('0' <= *s && *s <= '9')) {
480 aerr("%s IDA stackvar offset not set?\n", __func__);
481 return NULL;
482 }
483 if (s[0] == '0' && s[1] == 'x')
484 s += 2;
485 len = p - s;
486 if (len < sizeof(buf) - 1) {
487 strncpy(buf, s, len);
488 buf[len] = 0;
489 val = strtol(buf, &endp, 16);
490 if (val == 0 || *endp != 0) {
491 aerr("%s num parse fail for '%s'\n", __func__, buf);
492 return NULL;
493 }
494 }
495 p++;
496 }
497 else
498 p = name + 4;
499
500 if ('0' <= *p && *p <= '9')
501 return NULL;
502
503 return p;
504}
505
506static int guess_lmod_from_name(struct parsed_opr *opr)
507{
508 if (!strncmp(opr->name, "dword_", 6)) {
509 opr->lmod = OPLM_DWORD;
510 return 1;
511 }
512 if (!strncmp(opr->name, "word_", 5)) {
513 opr->lmod = OPLM_WORD;
514 return 1;
515 }
516 if (!strncmp(opr->name, "byte_", 5)) {
517 opr->lmod = OPLM_BYTE;
518 return 1;
519 }
520 if (!strncmp(opr->name, "qword_", 6)) {
521 opr->lmod = OPLM_QWORD;
522 return 1;
523 }
524 return 0;
525}
526
527static int guess_lmod_from_c_type(enum opr_lenmod *lmod,
528 const struct parsed_type *c_type)
529{
530 static const char *dword_types[] = {
531 "int", "_DWORD", "UINT_PTR", "DWORD",
532 "WPARAM", "LPARAM", "UINT", "__int32",
533 "LONG", "HIMC", "BOOL", "size_t",
534 "float",
535 };
536 static const char *word_types[] = {
537 "uint16_t", "int16_t", "_WORD", "WORD",
538 "unsigned __int16", "__int16",
539 };
540 static const char *byte_types[] = {
541 "uint8_t", "int8_t", "char",
542 "unsigned __int8", "__int8", "BYTE", "_BYTE",
543 "CHAR", "_UNKNOWN",
544 // structures.. deal the same as with _UNKNOWN for now
545 "CRITICAL_SECTION",
546 };
547 const char *n;
548 int i;
549
550 if (c_type->is_ptr) {
551 *lmod = OPLM_DWORD;
552 return 1;
553 }
554
555 n = skip_type_mod(c_type->name);
556
557 for (i = 0; i < ARRAY_SIZE(dword_types); i++) {
558 if (IS(n, dword_types[i])) {
559 *lmod = OPLM_DWORD;
560 return 1;
561 }
562 }
563
564 for (i = 0; i < ARRAY_SIZE(word_types); i++) {
565 if (IS(n, word_types[i])) {
566 *lmod = OPLM_WORD;
567 return 1;
568 }
569 }
570
571 for (i = 0; i < ARRAY_SIZE(byte_types); i++) {
572 if (IS(n, byte_types[i])) {
573 *lmod = OPLM_BYTE;
574 return 1;
575 }
576 }
577
578 return 0;
579}
580
581static char *default_cast_to(char *buf, size_t buf_size,
582 struct parsed_opr *opr)
583{
584 buf[0] = 0;
585
586 if (!opr->is_ptr)
587 return buf;
588 if (opr->pp == NULL || opr->pp->type.name == NULL
589 || opr->pp->is_fptr)
590 {
591 snprintf(buf, buf_size, "%s", "(void *)");
592 return buf;
593 }
594
595 snprintf(buf, buf_size, "(%s)", opr->pp->type.name);
596 return buf;
597}
598
599static enum opr_type lmod_from_directive(const char *d)
600{
601 if (IS(d, "dd"))
602 return OPLM_DWORD;
603 else if (IS(d, "dw"))
604 return OPLM_WORD;
605 else if (IS(d, "db"))
606 return OPLM_BYTE;
607
608 aerr("unhandled directive: '%s'\n", d);
609 return OPLM_UNSPEC;
610}
611
612static void setup_reg_opr(struct parsed_opr *opr, int reg, enum opr_lenmod lmod,
613 int *regmask)
614{
615 opr->type = OPT_REG;
616 opr->reg = reg;
617 opr->lmod = lmod;
618 *regmask |= 1 << reg;
619}
620
621static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
622 int *extra_offs);
623
624static int parse_operand(struct parsed_opr *opr,
625 int *regmask, int *regmask_indirect,
626 char words[16][256], int wordc, int w, unsigned int op_flags)
627{
628 const struct parsed_proto *pp = NULL;
629 enum opr_lenmod tmplmod;
630 unsigned long number;
631 char buf[256];
632 int ret, len;
633 int wordc_in;
634 char *p;
635 int i;
636
637 if (w >= wordc)
638 aerr("parse_operand w %d, wordc %d\n", w, wordc);
639
640 opr->reg = xUNSPEC;
641
642 for (i = w; i < wordc; i++) {
643 len = strlen(words[i]);
644 if (words[i][len - 1] == ',') {
645 words[i][len - 1] = 0;
646 wordc = i + 1;
647 break;
648 }
649 }
650
651 wordc_in = wordc - w;
652
653 if ((op_flags & OPF_JMP) && wordc_in > 0
654 && !('0' <= words[w][0] && words[w][0] <= '9'))
655 {
656 const char *label = NULL;
657
658 if (wordc_in == 3 && !strncmp(words[w], "near", 4)
659 && IS(words[w + 1], "ptr"))
660 label = words[w + 2];
661 else if (wordc_in == 2 && IS(words[w], "short"))
662 label = words[w + 1];
663 else if (wordc_in == 1
664 && strchr(words[w], '[') == NULL
665 && parse_reg(&tmplmod, words[w]) < 0)
666 label = words[w];
667
668 if (label != NULL) {
669 opr->type = OPT_LABEL;
670 ret = check_segment_prefix(label);
671 if (ret != 0) {
672 if (ret >= 5)
673 aerr("fs/gs used\n");
674 opr->had_ds = 1;
675 label += 3;
676 }
677 strcpy(opr->name, label);
678 return wordc;
679 }
680 }
681
682 if (wordc_in >= 3) {
683 if (IS(words[w + 1], "ptr")) {
684 if (IS(words[w], "dword"))
685 opr->lmod = OPLM_DWORD;
686 else if (IS(words[w], "word"))
687 opr->lmod = OPLM_WORD;
688 else if (IS(words[w], "byte"))
689 opr->lmod = OPLM_BYTE;
690 else if (IS(words[w], "qword"))
691 opr->lmod = OPLM_QWORD;
692 else
693 aerr("type parsing failed\n");
694 w += 2;
695 wordc_in = wordc - w;
696 }
697 }
698
699 if (wordc_in == 2) {
700 if (IS(words[w], "offset")) {
701 opr->type = OPT_OFFSET;
702 opr->lmod = OPLM_DWORD;
703 strcpy(opr->name, words[w + 1]);
704 pp = proto_parse(g_fhdr, opr->name, 1);
705 goto do_label;
706 }
707 if (IS(words[w], "(offset")) {
708 p = strchr(words[w + 1], ')');
709 if (p == NULL)
710 aerr("parse of bracketed offset failed\n");
711 *p = 0;
712 opr->type = OPT_OFFSET;
713 strcpy(opr->name, words[w + 1]);
714 return wordc;
715 }
716 }
717
718 if (wordc_in != 1)
719 aerr("parse_operand 1 word expected\n");
720
721 ret = check_segment_prefix(words[w]);
722 if (ret != 0) {
723 if (ret >= 5)
724 aerr("fs/gs used\n");
725 opr->had_ds = 1;
726 memmove(words[w], words[w] + 3, strlen(words[w]) - 2);
727 }
728 strcpy(opr->name, words[w]);
729
730 if (words[w][0] == '[') {
731 opr->type = OPT_REGMEM;
732 ret = sscanf(words[w], "[%[^]]]", opr->name);
733 if (ret != 1)
734 aerr("[] parse failure\n");
735
736 parse_indmode(opr->name, regmask_indirect, 1);
737 if (opr->lmod == OPLM_UNSPEC && parse_stack_el(opr->name, NULL, 1))
738 {
739 // might be an equ
740 struct parsed_equ *eq =
741 equ_find(NULL, parse_stack_el(opr->name, NULL, 1), &i);
742 if (eq)
743 opr->lmod = eq->lmod;
744 }
745 return wordc;
746 }
747 else if (strchr(words[w], '[')) {
748 // label[reg] form
749 p = strchr(words[w], '[');
750 opr->type = OPT_REGMEM;
751 parse_indmode(p, regmask_indirect, 0);
752 strncpy(buf, words[w], p - words[w]);
753 buf[p - words[w]] = 0;
754 pp = proto_parse(g_fhdr, buf, 1);
755 goto do_label;
756 }
757 else if (('0' <= words[w][0] && words[w][0] <= '9')
758 || words[w][0] == '-')
759 {
760 number = parse_number(words[w]);
761 opr->type = OPT_CONST;
762 opr->val = number;
763 printf_number(opr->name, sizeof(opr->name), number);
764 return wordc;
765 }
766
767 ret = parse_reg(&tmplmod, opr->name);
768 if (ret >= 0) {
769 setup_reg_opr(opr, ret, tmplmod, regmask);
770 return wordc;
771 }
772
773 // most likely var in data segment
774 opr->type = OPT_LABEL;
775 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
776
777do_label:
778 if (pp != NULL) {
779 if (pp->is_fptr || pp->is_func) {
780 opr->lmod = OPLM_DWORD;
781 opr->is_ptr = 1;
782 }
783 else {
784 tmplmod = OPLM_UNSPEC;
785 if (!guess_lmod_from_c_type(&tmplmod, &pp->type))
786 anote("unhandled C type '%s' for '%s'\n",
787 pp->type.name, opr->name);
788
789 if (opr->lmod == OPLM_UNSPEC) {
790 opr->lmod = tmplmod;
791 opr->type_from_var = 1;
792 }
793 else if (opr->lmod != tmplmod) {
794 opr->size_mismatch = 1;
795 if (tmplmod < opr->lmod)
796 opr->size_lt = 1;
797 }
798 opr->is_ptr = pp->type.is_ptr;
799 }
800 opr->is_array = pp->type.is_array;
801 }
802 opr->pp = pp;
803
804 if (opr->lmod == OPLM_UNSPEC)
805 guess_lmod_from_name(opr);
806 return wordc;
807}
808
809static const struct {
810 const char *name;
811 unsigned int flags;
812} pref_table[] = {
813 { "rep", OPF_REP },
814 { "repe", OPF_REP|OPF_REPZ },
815 { "repz", OPF_REP|OPF_REPZ },
816 { "repne", OPF_REP|OPF_REPNZ },
817 { "repnz", OPF_REP|OPF_REPNZ },
818 { "lock", OPF_LOCK }, // ignored for now..
819};
820
821#define OPF_CJMP_CC (OPF_JMP|OPF_CJMP|OPF_CC)
822
823static const struct {
824 const char *name;
825 enum op_op op;
826 unsigned short minopr;
827 unsigned short maxopr;
828 unsigned int flags;
829 unsigned char pfo;
830 unsigned char pfo_inv;
831} op_table[] = {
832 { "nop", OP_NOP, 0, 0, 0 },
833 { "push", OP_PUSH, 1, 1, 0 },
834 { "pop", OP_POP, 1, 1, OPF_DATA },
835 { "leave",OP_LEAVE, 0, 0, OPF_DATA },
836 { "mov" , OP_MOV, 2, 2, OPF_DATA },
837 { "lea", OP_LEA, 2, 2, OPF_DATA },
838 { "movzx",OP_MOVZX, 2, 2, OPF_DATA },
839 { "movsx",OP_MOVSX, 2, 2, OPF_DATA },
840 { "xchg", OP_XCHG, 2, 2, OPF_DATA },
841 { "not", OP_NOT, 1, 1, OPF_DATA },
842 { "cdq", OP_CDQ, 0, 0, OPF_DATA },
843 { "lodsb",OP_LODS, 0, 0, OPF_DATA },
844 { "lodsw",OP_LODS, 0, 0, OPF_DATA },
845 { "lodsd",OP_LODS, 0, 0, OPF_DATA },
846 { "stosb",OP_STOS, 0, 0, OPF_DATA },
847 { "stosw",OP_STOS, 0, 0, OPF_DATA },
848 { "stosd",OP_STOS, 0, 0, OPF_DATA },
849 { "movsb",OP_MOVS, 0, 0, OPF_DATA },
850 { "movsw",OP_MOVS, 0, 0, OPF_DATA },
851 { "movsd",OP_MOVS, 0, 0, OPF_DATA },
852 { "cmpsb",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
853 { "cmpsw",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
854 { "cmpsd",OP_CMPS, 0, 0, OPF_DATA|OPF_FLAGS },
855 { "scasb",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
856 { "scasw",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
857 { "scasd",OP_SCAS, 0, 0, OPF_DATA|OPF_FLAGS },
858 { "std", OP_STD, 0, 0, OPF_DATA }, // special flag
859 { "cld", OP_CLD, 0, 0, OPF_DATA },
860 { "add", OP_ADD, 2, 2, OPF_DATA|OPF_FLAGS },
861 { "sub", OP_SUB, 2, 2, OPF_DATA|OPF_FLAGS },
862 { "and", OP_AND, 2, 2, OPF_DATA|OPF_FLAGS },
863 { "or", OP_OR, 2, 2, OPF_DATA|OPF_FLAGS },
864 { "xor", OP_XOR, 2, 2, OPF_DATA|OPF_FLAGS },
865 { "shl", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
866 { "shr", OP_SHR, 2, 2, OPF_DATA|OPF_FLAGS },
867 { "sal", OP_SHL, 2, 2, OPF_DATA|OPF_FLAGS },
868 { "sar", OP_SAR, 2, 2, OPF_DATA|OPF_FLAGS },
869 { "shrd", OP_SHRD, 3, 3, OPF_DATA|OPF_FLAGS },
870 { "rol", OP_ROL, 2, 2, OPF_DATA|OPF_FLAGS },
871 { "ror", OP_ROR, 2, 2, OPF_DATA|OPF_FLAGS },
872 { "rcl", OP_RCL, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
873 { "rcr", OP_RCR, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
874 { "adc", OP_ADC, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
875 { "sbb", OP_SBB, 2, 2, OPF_DATA|OPF_FLAGS|OPF_CC, PFO_C },
876 { "bsf", OP_BSF, 2, 2, OPF_DATA|OPF_FLAGS },
877 { "inc", OP_INC, 1, 1, OPF_DATA|OPF_FLAGS },
878 { "dec", OP_DEC, 1, 1, OPF_DATA|OPF_FLAGS },
879 { "neg", OP_NEG, 1, 1, OPF_DATA|OPF_FLAGS },
880 { "mul", OP_MUL, 1, 1, OPF_DATA|OPF_FLAGS },
881 { "imul", OP_IMUL, 1, 3, OPF_DATA|OPF_FLAGS },
882 { "div", OP_DIV, 1, 1, OPF_DATA|OPF_FLAGS },
883 { "idiv", OP_IDIV, 1, 1, OPF_DATA|OPF_FLAGS },
884 { "test", OP_TEST, 2, 2, OPF_FLAGS },
885 { "cmp", OP_CMP, 2, 2, OPF_FLAGS },
886 { "retn", OP_RET, 0, 1, OPF_TAIL },
887 { "call", OP_CALL, 1, 1, OPF_JMP|OPF_DATA|OPF_FLAGS },
888 { "jmp", OP_JMP, 1, 1, OPF_JMP },
889 { "jecxz",OP_JECXZ, 1, 1, OPF_JMP|OPF_CJMP },
890 { "jo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 0 }, // 70 OF=1
891 { "jno", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_O, 1 }, // 71 OF=0
892 { "jc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72 CF=1
893 { "jb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 0 }, // 72
894 { "jnc", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73 CF=0
895 { "jnb", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
896 { "jae", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_C, 1 }, // 73
897 { "jz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74 ZF=1
898 { "je", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 0 }, // 74
899 { "jnz", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75 ZF=0
900 { "jne", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_Z, 1 }, // 75
901 { "jbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76 CF=1||ZF=1
902 { "jna", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 0 }, // 76
903 { "ja", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77 CF=0&&ZF=0
904 { "jnbe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_BE, 1 }, // 77
905 { "js", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 0 }, // 78 SF=1
906 { "jns", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_S, 1 }, // 79 SF=0
907 { "jp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a PF=1
908 { "jpe", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 0 }, // 7a
909 { "jnp", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b PF=0
910 { "jpo", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_P, 1 }, // 7b
911 { "jl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c SF!=OF
912 { "jnge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 0 }, // 7c
913 { "jge", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d SF=OF
914 { "jnl", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_L, 1 }, // 7d
915 { "jle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e ZF=1||SF!=OF
916 { "jng", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 0 }, // 7e
917 { "jg", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f ZF=0&&SF=OF
918 { "jnle", OP_JCC, 1, 1, OPF_CJMP_CC, PFO_LE, 1 }, // 7f
919 { "seto", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 0 },
920 { "setno", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_O, 1 },
921 { "setc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
922 { "setb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 0 },
923 { "setnc", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
924 { "setae", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
925 { "setnb", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_C, 1 },
926 { "setz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
927 { "sete", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 0 },
928 { "setnz", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
929 { "setne", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_Z, 1 },
930 { "setbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
931 { "setna", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 0 },
932 { "seta", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
933 { "setnbe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_BE, 1 },
934 { "sets", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 0 },
935 { "setns", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_S, 1 },
936 { "setp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
937 { "setpe", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 0 },
938 { "setnp", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
939 { "setpo", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_P, 1 },
940 { "setl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
941 { "setnge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 0 },
942 { "setge", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
943 { "setnl", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_L, 1 },
944 { "setle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
945 { "setng", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 0 },
946 { "setg", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
947 { "setnle", OP_SCC, 1, 1, OPF_DATA|OPF_CC, PFO_LE, 1 },
948 // x87
949 // mmx
950 { "emms", OP_EMMS, 0, 0, OPF_DATA },
951 { "movq", OP_MOV, 2, 2, OPF_DATA },
952 // must be last
953 { "ud2", OP_UD2 },
954};
955
956static void parse_op(struct parsed_op *op, char words[16][256], int wordc)
957{
958 enum opr_lenmod lmod = OPLM_UNSPEC;
959 int prefix_flags = 0;
960 int regmask_ind;
961 int regmask;
962 int op_w = 0;
963 int opr = 0;
964 int w = 0;
965 int i;
966
967 for (i = 0; i < ARRAY_SIZE(pref_table); i++) {
968 if (IS(words[w], pref_table[i].name)) {
969 prefix_flags = pref_table[i].flags;
970 break;
971 }
972 }
973
974 if (prefix_flags) {
975 if (wordc <= 1)
976 aerr("lone prefix: '%s'\n", words[0]);
977 w++;
978 }
979
980 op_w = w;
981 for (i = 0; i < ARRAY_SIZE(op_table); i++) {
982 if (IS(words[w], op_table[i].name))
983 break;
984 }
985
986 if (i == ARRAY_SIZE(op_table)) {
987 anote("unhandled op: '%s'\n", words[0]);
988 i--; // OP_UD2
989 }
990 w++;
991
992 op->op = op_table[i].op;
993 op->flags = op_table[i].flags | prefix_flags;
994 op->pfo = op_table[i].pfo;
995 op->pfo_inv = op_table[i].pfo_inv;
996 op->regmask_src = op->regmask_dst = 0;
997 op->asmln = asmln;
998
999 if (op->op == OP_UD2)
1000 return;
1001
1002 for (opr = 0; opr < op_table[i].maxopr; opr++) {
1003 if (opr >= op_table[i].minopr && w >= wordc)
1004 break;
1005
1006 regmask = regmask_ind = 0;
1007 w = parse_operand(&op->operand[opr], &regmask, &regmask_ind,
1008 words, wordc, w, op->flags);
1009
1010 if (opr == 0 && (op->flags & OPF_DATA))
1011 op->regmask_dst = regmask;
1012 else
1013 op->regmask_src |= regmask;
1014 op->regmask_src |= regmask_ind;
1015 }
1016
1017 if (w < wordc)
1018 aerr("parse_op %s incomplete: %d/%d\n",
1019 words[0], w, wordc);
1020
1021 // special cases
1022 op->operand_cnt = opr;
1023 if (!strncmp(op_table[i].name, "set", 3))
1024 op->operand[0].lmod = OPLM_BYTE;
1025
1026 switch (op->op) {
1027 // first operand is not dst
1028 case OP_CMP:
1029 case OP_TEST:
1030 op->regmask_src |= op->regmask_dst;
1031 op->regmask_dst = 0;
1032 break;
1033
1034 // first operand is src too
1035 case OP_NOT:
1036 case OP_ADD:
1037 case OP_AND:
1038 case OP_OR:
1039 case OP_RCL:
1040 case OP_RCR:
1041 case OP_ADC:
1042 case OP_INC:
1043 case OP_DEC:
1044 case OP_NEG:
1045 // more below..
1046 op->regmask_src |= op->regmask_dst;
1047 break;
1048
1049 // special
1050 case OP_XCHG:
1051 op->regmask_src |= op->regmask_dst;
1052 op->regmask_dst |= op->regmask_src;
1053 goto check_align;
1054
1055 case OP_SUB:
1056 case OP_SBB:
1057 case OP_XOR:
1058 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1059 && op->operand[0].lmod == op->operand[1].lmod
1060 && op->operand[0].reg == op->operand[1].reg
1061 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1062 {
1063 op->regmask_src = 0;
1064 }
1065 else
1066 op->regmask_src |= op->regmask_dst;
1067 break;
1068
1069 // ops with implicit argumets
1070 case OP_CDQ:
1071 op->operand_cnt = 2;
1072 setup_reg_opr(&op->operand[0], xDX, OPLM_DWORD, &op->regmask_dst);
1073 setup_reg_opr(&op->operand[1], xAX, OPLM_DWORD, &op->regmask_src);
1074 break;
1075
1076 case OP_LODS:
1077 case OP_STOS:
1078 case OP_SCAS:
1079 if (op->operand_cnt != 0)
1080 break;
1081 if (words[op_w][4] == 'b')
1082 lmod = OPLM_BYTE;
1083 else if (words[op_w][4] == 'w')
1084 lmod = OPLM_WORD;
1085 else if (words[op_w][4] == 'd')
1086 lmod = OPLM_DWORD;
1087 op->operand_cnt = 3;
1088 setup_reg_opr(&op->operand[0], op->op == OP_LODS ? xSI : xDI,
1089 lmod, &op->regmask_src);
1090 setup_reg_opr(&op->operand[1], xCX, OPLM_DWORD, &op->regmask_src);
1091 op->regmask_dst = op->regmask_src;
1092 setup_reg_opr(&op->operand[2], xAX, OPLM_DWORD,
1093 op->op == OP_LODS ? &op->regmask_dst : &op->regmask_src);
1094 break;
1095
1096 case OP_MOVS:
1097 case OP_CMPS:
1098 if (op->operand_cnt != 0)
1099 break;
1100 if (words[op_w][4] == 'b')
1101 lmod = OPLM_BYTE;
1102 else if (words[op_w][4] == 'w')
1103 lmod = OPLM_WORD;
1104 else if (words[op_w][4] == 'd')
1105 lmod = OPLM_DWORD;
1106 op->operand_cnt = 3;
1107 setup_reg_opr(&op->operand[0], xDI, lmod, &op->regmask_src);
1108 setup_reg_opr(&op->operand[1], xSI, OPLM_DWORD, &op->regmask_src);
1109 setup_reg_opr(&op->operand[2], xCX, OPLM_DWORD, &op->regmask_src);
1110 op->regmask_dst = op->regmask_src;
1111 break;
1112
1113 case OP_JECXZ:
1114 op->operand_cnt = 1;
1115 op->regmask_src = 1 << xCX;
1116 op->operand[0].type = OPT_REG;
1117 op->operand[0].reg = xCX;
1118 op->operand[0].lmod = OPLM_DWORD;
1119 break;
1120
1121 case OP_IMUL:
1122 if (op->operand_cnt != 1)
1123 break;
1124 // fallthrough
1125 case OP_MUL:
1126 // singleop mul
1127 op->regmask_src |= op->regmask_dst;
1128 op->regmask_dst = (1 << xDX) | (1 << xAX);
1129 if (op->operand[0].lmod == OPLM_UNSPEC)
1130 op->operand[0].lmod = OPLM_DWORD;
1131 break;
1132
1133 case OP_DIV:
1134 case OP_IDIV:
1135 // we could set up operands for edx:eax, but there is no real need to
1136 // (see is_opr_modified())
1137 op->regmask_src |= op->regmask_dst;
1138 op->regmask_dst = (1 << xDX) | (1 << xAX);
1139 if (op->operand[0].lmod == OPLM_UNSPEC)
1140 op->operand[0].lmod = OPLM_DWORD;
1141 break;
1142
1143 case OP_SHL:
1144 case OP_SHR:
1145 case OP_SAR:
1146 case OP_ROL:
1147 case OP_ROR:
1148 op->regmask_src |= op->regmask_dst;
1149 if (op->operand[1].lmod == OPLM_UNSPEC)
1150 op->operand[1].lmod = OPLM_BYTE;
1151 break;
1152
1153 case OP_SHRD:
1154 op->regmask_src |= op->regmask_dst;
1155 if (op->operand[2].lmod == OPLM_UNSPEC)
1156 op->operand[2].lmod = OPLM_BYTE;
1157 break;
1158
1159 case OP_PUSH:
1160 op->regmask_src |= op->regmask_dst;
1161 op->regmask_dst = 0;
1162 if (op->operand[0].lmod == OPLM_UNSPEC
1163 && (op->operand[0].type == OPT_CONST
1164 || op->operand[0].type == OPT_OFFSET
1165 || op->operand[0].type == OPT_LABEL))
1166 op->operand[0].lmod = OPLM_DWORD;
1167 break;
1168
1169 // alignment
1170 case OP_MOV:
1171 check_align:
1172 if (op->operand[0].type == OPT_REG && op->operand[1].type == OPT_REG
1173 && op->operand[0].lmod == op->operand[1].lmod
1174 && op->operand[0].reg == op->operand[1].reg
1175 && IS(op->operand[0].name, op->operand[1].name)) // ! ah, al..
1176 {
1177 op->flags |= OPF_RMD | OPF_DONE;
1178 op->regmask_src = op->regmask_dst = 0;
1179 }
1180 break;
1181
1182 case OP_LEA:
1183 if (op->operand[0].type == OPT_REG
1184 && op->operand[1].type == OPT_REGMEM)
1185 {
1186 char buf[16];
1187 snprintf(buf, sizeof(buf), "%s+0", op->operand[0].name);
1188 if (IS(buf, op->operand[1].name))
1189 op->flags |= OPF_RMD | OPF_DONE;
1190 }
1191 break;
1192
1193 case OP_CALL:
1194 // trashed regs must be explicitly detected later
1195 op->regmask_dst = 0;
1196 break;
1197
1198 case OP_LEAVE:
1199 op->regmask_dst = (1 << xBP) | (1 << xSP);
1200 op->regmask_src = 1 << xBP;
1201 break;
1202
1203 default:
1204 break;
1205 }
1206}
1207
1208static const char *op_name(struct parsed_op *po)
1209{
1210 static char buf[16];
1211 char *p;
1212 int i;
1213
1214 if (po->op == OP_JCC || po->op == OP_SCC) {
1215 p = buf;
1216 *p++ = (po->op == OP_JCC) ? 'j' : 's';
1217 if (po->pfo_inv)
1218 *p++ = 'n';
1219 strcpy(p, parsed_flag_op_names[po->pfo]);
1220 return buf;
1221 }
1222
1223 for (i = 0; i < ARRAY_SIZE(op_table); i++)
1224 if (op_table[i].op == po->op)
1225 return op_table[i].name;
1226
1227 return "???";
1228}
1229
1230// debug
1231static const char *dump_op(struct parsed_op *po)
1232{
1233 static char out[128];
1234 char *p = out;
1235 int i;
1236
1237 if (po == NULL)
1238 return "???";
1239
1240 snprintf(out, sizeof(out), "%s", op_name(po));
1241 for (i = 0; i < po->operand_cnt; i++) {
1242 p += strlen(p);
1243 if (i > 0)
1244 *p++ = ',';
1245 snprintf(p, sizeof(out) - (p - out),
1246 po->operand[i].type == OPT_REGMEM ? " [%s]" : " %s",
1247 po->operand[i].name);
1248 }
1249
1250 return out;
1251}
1252
1253static const char *lmod_type_u(struct parsed_op *po,
1254 enum opr_lenmod lmod)
1255{
1256 switch (lmod) {
1257 case OPLM_QWORD:
1258 return "u64";
1259 case OPLM_DWORD:
1260 return "u32";
1261 case OPLM_WORD:
1262 return "u16";
1263 case OPLM_BYTE:
1264 return "u8";
1265 default:
1266 ferr(po, "invalid lmod: %d\n", lmod);
1267 return "(_invalid_)";
1268 }
1269}
1270
1271static const char *lmod_cast_u(struct parsed_op *po,
1272 enum opr_lenmod lmod)
1273{
1274 switch (lmod) {
1275 case OPLM_QWORD:
1276 return "";
1277 case OPLM_DWORD:
1278 return "";
1279 case OPLM_WORD:
1280 return "(u16)";
1281 case OPLM_BYTE:
1282 return "(u8)";
1283 default:
1284 ferr(po, "invalid lmod: %d\n", lmod);
1285 return "(_invalid_)";
1286 }
1287}
1288
1289static const char *lmod_cast_u_ptr(struct parsed_op *po,
1290 enum opr_lenmod lmod)
1291{
1292 switch (lmod) {
1293 case OPLM_QWORD:
1294 return "*(u64 *)";
1295 case OPLM_DWORD:
1296 return "*(u32 *)";
1297 case OPLM_WORD:
1298 return "*(u16 *)";
1299 case OPLM_BYTE:
1300 return "*(u8 *)";
1301 default:
1302 ferr(po, "invalid lmod: %d\n", lmod);
1303 return "(_invalid_)";
1304 }
1305}
1306
1307static const char *lmod_cast_s(struct parsed_op *po,
1308 enum opr_lenmod lmod)
1309{
1310 switch (lmod) {
1311 case OPLM_QWORD:
1312 return "(s64)";
1313 case OPLM_DWORD:
1314 return "(s32)";
1315 case OPLM_WORD:
1316 return "(s16)";
1317 case OPLM_BYTE:
1318 return "(s8)";
1319 default:
1320 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1321 return "(_invalid_)";
1322 }
1323}
1324
1325static const char *lmod_cast(struct parsed_op *po,
1326 enum opr_lenmod lmod, int is_signed)
1327{
1328 return is_signed ?
1329 lmod_cast_s(po, lmod) :
1330 lmod_cast_u(po, lmod);
1331}
1332
1333static int lmod_bytes(struct parsed_op *po, enum opr_lenmod lmod)
1334{
1335 switch (lmod) {
1336 case OPLM_QWORD:
1337 return 8;
1338 case OPLM_DWORD:
1339 return 4;
1340 case OPLM_WORD:
1341 return 2;
1342 case OPLM_BYTE:
1343 return 1;
1344 default:
1345 ferr(po, "%s: invalid lmod: %d\n", __func__, lmod);
1346 return 0;
1347 }
1348}
1349
1350static const char *opr_name(struct parsed_op *po, int opr_num)
1351{
1352 if (opr_num >= po->operand_cnt)
1353 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1354 return po->operand[opr_num].name;
1355}
1356
1357static unsigned int opr_const(struct parsed_op *po, int opr_num)
1358{
1359 if (opr_num >= po->operand_cnt)
1360 ferr(po, "opr OOR: %d/%d\n", opr_num, po->operand_cnt);
1361 if (po->operand[opr_num].type != OPT_CONST)
1362 ferr(po, "opr %d: const expected\n", opr_num);
1363 return po->operand[opr_num].val;
1364}
1365
1366static const char *opr_reg_p(struct parsed_op *po, struct parsed_opr *popr)
1367{
1368 if ((unsigned int)popr->reg >= ARRAY_SIZE(regs_r32))
1369 ferr(po, "invalid reg: %d\n", popr->reg);
1370 return regs_r32[popr->reg];
1371}
1372
1373// cast1 is the "final" cast
1374static const char *simplify_cast(const char *cast1, const char *cast2)
1375{
1376 static char buf[256];
1377
1378 if (cast1[0] == 0)
1379 return cast2;
1380 if (cast2[0] == 0)
1381 return cast1;
1382 if (IS(cast1, cast2))
1383 return cast1;
1384 if (IS(cast1, "(s8)") && IS(cast2, "(u8)"))
1385 return cast1;
1386 if (IS(cast1, "(s16)") && IS(cast2, "(u16)"))
1387 return cast1;
1388 if (IS(cast1, "(u8)") && IS_START(cast2, "*(u8 *)"))
1389 return cast2;
1390 if (IS(cast1, "(u16)") && IS_START(cast2, "*(u16 *)"))
1391 return cast2;
1392 if (strchr(cast1, '*') && IS_START(cast2, "(u32)"))
1393 return cast1;
1394
1395 snprintf(buf, sizeof(buf), "%s%s", cast1, cast2);
1396 return buf;
1397}
1398
1399static const char *simplify_cast_num(const char *cast, unsigned int val)
1400{
1401 if (IS(cast, "(u8)") && val < 0x100)
1402 return "";
1403 if (IS(cast, "(s8)") && val < 0x80)
1404 return "";
1405 if (IS(cast, "(u16)") && val < 0x10000)
1406 return "";
1407 if (IS(cast, "(s16)") && val < 0x8000)
1408 return "";
1409 if (IS(cast, "(s32)") && val < 0x80000000)
1410 return "";
1411
1412 return cast;
1413}
1414
1415static struct parsed_equ *equ_find(struct parsed_op *po, const char *name,
1416 int *extra_offs)
1417{
1418 const char *p;
1419 char *endp;
1420 int namelen;
1421 int i;
1422
1423 *extra_offs = 0;
1424 namelen = strlen(name);
1425
1426 p = strchr(name, '+');
1427 if (p != NULL) {
1428 namelen = p - name;
1429 if (namelen <= 0)
1430 ferr(po, "equ parse failed for '%s'\n", name);
1431
1432 if (IS_START(p, "0x"))
1433 p += 2;
1434 *extra_offs = strtol(p, &endp, 16);
1435 if (*endp != 0)
1436 ferr(po, "equ parse failed for '%s'\n", name);
1437 }
1438
1439 for (i = 0; i < g_eqcnt; i++)
1440 if (strncmp(g_eqs[i].name, name, namelen) == 0
1441 && g_eqs[i].name[namelen] == 0)
1442 break;
1443 if (i >= g_eqcnt) {
1444 if (po != NULL)
1445 ferr(po, "unresolved equ name: '%s'\n", name);
1446 return NULL;
1447 }
1448
1449 return &g_eqs[i];
1450}
1451
1452static int is_stack_access(struct parsed_op *po,
1453 const struct parsed_opr *popr)
1454{
1455 return (parse_stack_el(popr->name, NULL, 0)
1456 || (g_bp_frame && !(po->flags & OPF_EBP_S)
1457 && IS_START(popr->name, "ebp")));
1458}
1459
1460static void parse_stack_access(struct parsed_op *po,
1461 const char *name, char *ofs_reg, int *offset_out,
1462 int *stack_ra_out, const char **bp_arg_out, int is_lea)
1463{
1464 const char *bp_arg = "";
1465 const char *p = NULL;
1466 struct parsed_equ *eq;
1467 char *endp = NULL;
1468 int stack_ra = 0;
1469 int offset = 0;
1470
1471 ofs_reg[0] = 0;
1472
1473 if (IS_START(name, "ebp-")
1474 || (IS_START(name, "ebp+") && '0' <= name[4] && name[4] <= '9'))
1475 {
1476 p = name + 4;
1477 if (IS_START(p, "0x"))
1478 p += 2;
1479 offset = strtoul(p, &endp, 16);
1480 if (name[3] == '-')
1481 offset = -offset;
1482 if (*endp != 0)
1483 ferr(po, "ebp- parse of '%s' failed\n", name);
1484 }
1485 else {
1486 bp_arg = parse_stack_el(name, ofs_reg, 0);
1487 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
1488 eq = equ_find(po, bp_arg, &offset);
1489 if (eq == NULL)
1490 ferr(po, "detected but missing eq\n");
1491 offset += eq->offset;
1492 }
1493
1494 if (!strncmp(name, "ebp", 3))
1495 stack_ra = 4;
1496
1497 // yes it sometimes LEAs ra for compares..
1498 if (!is_lea && ofs_reg[0] == 0
1499 && stack_ra <= offset && offset < stack_ra + 4)
1500 {
1501 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
1502 }
1503
1504 *offset_out = offset;
1505 *stack_ra_out = stack_ra;
1506 if (bp_arg_out)
1507 *bp_arg_out = bp_arg;
1508}
1509
1510static int stack_frame_access(struct parsed_op *po,
1511 struct parsed_opr *popr, char *buf, size_t buf_size,
1512 const char *name, const char *cast, int is_src, int is_lea)
1513{
1514 enum opr_lenmod tmp_lmod = OPLM_UNSPEC;
1515 const char *prefix = "";
1516 const char *bp_arg = NULL;
1517 char ofs_reg[16] = { 0, };
1518 int i, arg_i, arg_s;
1519 int unaligned = 0;
1520 int stack_ra = 0;
1521 int offset = 0;
1522 int retval = -1;
1523 int sf_ofs;
1524 int lim;
1525
1526 if (po->flags & OPF_EBP_S)
1527 ferr(po, "stack_frame_access while ebp is scratch\n");
1528
1529 parse_stack_access(po, name, ofs_reg, &offset,
1530 &stack_ra, &bp_arg, is_lea);
1531
1532 if (offset > stack_ra)
1533 {
1534 arg_i = (offset - stack_ra - 4) / 4;
1535 if (arg_i < 0 || arg_i >= g_func_pp->argc_stack)
1536 {
1537 if (g_func_pp->is_vararg
1538 && arg_i == g_func_pp->argc_stack && is_lea)
1539 {
1540 // should be va_list
1541 if (cast[0] == 0)
1542 cast = "(u32)";
1543 snprintf(buf, buf_size, "%sap", cast);
1544 return -1;
1545 }
1546 ferr(po, "offset %d (%s,%d) doesn't map to any arg\n",
1547 offset, bp_arg, arg_i);
1548 }
1549 if (ofs_reg[0] != 0)
1550 ferr(po, "offset reg on arg access?\n");
1551
1552 for (i = arg_s = 0; i < g_func_pp->argc; i++) {
1553 if (g_func_pp->arg[i].reg != NULL)
1554 continue;
1555 if (arg_s == arg_i)
1556 break;
1557 arg_s++;
1558 }
1559 if (i == g_func_pp->argc)
1560 ferr(po, "arg %d not in prototype?\n", arg_i);
1561
1562 popr->is_ptr = g_func_pp->arg[i].type.is_ptr;
1563 retval = i;
1564
1565 switch (popr->lmod)
1566 {
1567 case OPLM_BYTE:
1568 if (is_lea)
1569 ferr(po, "lea/byte to arg?\n");
1570 if (is_src && (offset & 3) == 0)
1571 snprintf(buf, buf_size, "%sa%d",
1572 simplify_cast(cast, "(u8)"), i + 1);
1573 else
1574 snprintf(buf, buf_size, "%sBYTE%d(a%d)",
1575 cast, offset & 3, i + 1);
1576 break;
1577
1578 case OPLM_WORD:
1579 if (is_lea)
1580 ferr(po, "lea/word to arg?\n");
1581 if (offset & 1) {
1582 unaligned = 1;
1583 if (!is_src) {
1584 if (offset & 2)
1585 ferr(po, "problematic arg store\n");
1586 snprintf(buf, buf_size, "%s((char *)&a%d + 1)",
1587 simplify_cast(cast, "*(u16 *)"), i + 1);
1588 }
1589 else
1590 ferr(po, "unaligned arg word load\n");
1591 }
1592 else if (is_src && (offset & 2) == 0)
1593 snprintf(buf, buf_size, "%sa%d",
1594 simplify_cast(cast, "(u16)"), i + 1);
1595 else
1596 snprintf(buf, buf_size, "%s%sWORD(a%d)",
1597 cast, (offset & 2) ? "HI" : "LO", i + 1);
1598 break;
1599
1600 case OPLM_DWORD:
1601 if (cast[0])
1602 prefix = cast;
1603 else if (is_src)
1604 prefix = "(u32)";
1605
1606 if (offset & 3) {
1607 unaligned = 1;
1608 if (is_lea)
1609 snprintf(buf, buf_size, "(u32)&a%d + %d",
1610 i + 1, offset & 3);
1611 else if (!is_src)
1612 ferr(po, "unaligned arg store\n");
1613 else {
1614 // mov edx, [ebp+arg_4+2]; movsx ecx, dx
1615 snprintf(buf, buf_size, "%s(a%d >> %d)",
1616 prefix, i + 1, (offset & 3) * 8);
1617 }
1618 }
1619 else {
1620 snprintf(buf, buf_size, "%s%sa%d",
1621 prefix, is_lea ? "&" : "", i + 1);
1622 }
1623 break;
1624
1625 default:
1626 ferr(po, "bp_arg bad lmod: %d\n", popr->lmod);
1627 }
1628
1629 if (unaligned)
1630 snprintf(g_comment, sizeof(g_comment), "%s unaligned", bp_arg);
1631
1632 // common problem
1633 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp->arg[i].type);
1634 if (tmp_lmod != OPLM_DWORD
1635 && (unaligned || (!is_src && lmod_bytes(po, tmp_lmod)
1636 < lmod_bytes(po, popr->lmod) + (offset & 3))))
1637 {
1638 ferr(po, "bp_arg arg%d/w offset %d and type '%s' is too small\n",
1639 i + 1, offset, g_func_pp->arg[i].type.name);
1640 }
1641 // can't check this because msvc likes to reuse
1642 // arg space for scratch..
1643 //if (popr->is_ptr && popr->lmod != OPLM_DWORD)
1644 // ferr(po, "bp_arg arg%d: non-dword ptr access\n", i + 1);
1645 }
1646 else
1647 {
1648 if (g_stack_fsz == 0)
1649 ferr(po, "stack var access without stackframe\n");
1650 g_stack_frame_used = 1;
1651
1652 sf_ofs = g_stack_fsz + offset;
1653 lim = (ofs_reg[0] != 0) ? -4 : 0;
1654 if (offset > 0 || sf_ofs < lim)
1655 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
1656
1657 if (is_lea)
1658 prefix = "(u32)&";
1659 else
1660 prefix = cast;
1661
1662 switch (popr->lmod)
1663 {
1664 case OPLM_BYTE:
1665 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1666 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1667 break;
1668
1669 case OPLM_WORD:
1670 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1671 // known unaligned or possibly unaligned
1672 strcat(g_comment, " unaligned");
1673 if (prefix[0] == 0)
1674 prefix = "*(u16 *)&";
1675 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1676 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1677 break;
1678 }
1679 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
1680 break;
1681
1682 case OPLM_DWORD:
1683 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1684 // known unaligned or possibly unaligned
1685 strcat(g_comment, " unaligned");
1686 if (prefix[0] == 0)
1687 prefix = "*(u32 *)&";
1688 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1689 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1690 break;
1691 }
1692 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
1693 break;
1694
1695 default:
1696 ferr(po, "bp_stack bad lmod: %d\n", popr->lmod);
1697 }
1698 }
1699
1700 return retval;
1701}
1702
1703static void check_func_pp(struct parsed_op *po,
1704 const struct parsed_proto *pp, const char *pfx)
1705{
1706 enum opr_lenmod tmp_lmod;
1707 char buf[256];
1708 int ret, i;
1709
1710 if (pp->argc_reg != 0) {
1711 if (/*!g_allow_regfunc &&*/ !pp->is_fastcall) {
1712 pp_print(buf, sizeof(buf), pp);
1713 ferr(po, "%s: unexpected reg arg in icall: %s\n", pfx, buf);
1714 }
1715 if (pp->argc_stack > 0 && pp->argc_reg != 2)
1716 ferr(po, "%s: %d reg arg(s) with %d stack arg(s)\n",
1717 pfx, pp->argc_reg, pp->argc_stack);
1718 }
1719
1720 // fptrs must use 32bit args, callsite might have no information and
1721 // lack a cast to smaller types, which results in incorrectly masked
1722 // args passed (callee may assume masked args, it does on ARM)
1723 if (!pp->is_osinc) {
1724 for (i = 0; i < pp->argc; i++) {
1725 ret = guess_lmod_from_c_type(&tmp_lmod, &pp->arg[i].type);
1726 if (ret && tmp_lmod != OPLM_DWORD)
1727 ferr(po, "reference to %s with arg%d '%s'\n", pp->name,
1728 i + 1, pp->arg[i].type.name);
1729 }
1730 }
1731}
1732
1733static const char *check_label_read_ref(struct parsed_op *po,
1734 const char *name)
1735{
1736 const struct parsed_proto *pp;
1737
1738 pp = proto_parse(g_fhdr, name, 0);
1739 if (pp == NULL)
1740 ferr(po, "proto_parse failed for ref '%s'\n", name);
1741
1742 if (pp->is_func)
1743 check_func_pp(po, pp, "ref");
1744
1745 return pp->name;
1746}
1747
1748static char *out_src_opr(char *buf, size_t buf_size,
1749 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1750 int is_lea)
1751{
1752 char tmp1[256], tmp2[256];
1753 char expr[256];
1754 const char *name;
1755 char *p;
1756 int ret;
1757
1758 if (cast == NULL)
1759 cast = "";
1760
1761 switch (popr->type) {
1762 case OPT_REG:
1763 if (is_lea)
1764 ferr(po, "lea from reg?\n");
1765
1766 switch (popr->lmod) {
1767 case OPLM_QWORD:
1768 snprintf(buf, buf_size, "%s%s.q", cast, opr_reg_p(po, popr));
1769 break;
1770 case OPLM_DWORD:
1771 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
1772 break;
1773 case OPLM_WORD:
1774 snprintf(buf, buf_size, "%s%s",
1775 simplify_cast(cast, "(u16)"), opr_reg_p(po, popr));
1776 break;
1777 case OPLM_BYTE:
1778 if (popr->name[1] == 'h') // XXX..
1779 snprintf(buf, buf_size, "%s(%s >> 8)",
1780 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1781 else
1782 snprintf(buf, buf_size, "%s%s",
1783 simplify_cast(cast, "(u8)"), opr_reg_p(po, popr));
1784 break;
1785 default:
1786 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1787 }
1788 break;
1789
1790 case OPT_REGMEM:
1791 if (is_stack_access(po, popr)) {
1792 stack_frame_access(po, popr, buf, buf_size,
1793 popr->name, cast, 1, is_lea);
1794 break;
1795 }
1796
1797 strcpy(expr, popr->name);
1798 if (strchr(expr, '[')) {
1799 // special case: '[' can only be left for label[reg] form
1800 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1801 if (ret != 2)
1802 ferr(po, "parse failure for '%s'\n", expr);
1803 if (tmp1[0] == '(') {
1804 // (off_4FFF50+3)[eax]
1805 p = strchr(tmp1 + 1, ')');
1806 if (p == NULL || p[1] != 0)
1807 ferr(po, "parse failure (2) for '%s'\n", expr);
1808 *p = 0;
1809 memmove(tmp1, tmp1 + 1, strlen(tmp1));
1810 }
1811 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
1812 }
1813
1814 // XXX: do we need more parsing?
1815 if (is_lea) {
1816 snprintf(buf, buf_size, "%s", expr);
1817 break;
1818 }
1819
1820 snprintf(buf, buf_size, "%s(%s)",
1821 simplify_cast(cast, lmod_cast_u_ptr(po, popr->lmod)), expr);
1822 break;
1823
1824 case OPT_LABEL:
1825 name = check_label_read_ref(po, popr->name);
1826 if (cast[0] == 0 && popr->is_ptr)
1827 cast = "(u32)";
1828
1829 if (is_lea)
1830 snprintf(buf, buf_size, "(u32)&%s", name);
1831 else if (popr->size_lt)
1832 snprintf(buf, buf_size, "%s%s%s%s", cast,
1833 lmod_cast_u_ptr(po, popr->lmod),
1834 popr->is_array ? "" : "&", name);
1835 else
1836 snprintf(buf, buf_size, "%s%s%s", cast, name,
1837 popr->is_array ? "[0]" : "");
1838 break;
1839
1840 case OPT_OFFSET:
1841 name = check_label_read_ref(po, popr->name);
1842 if (cast[0] == 0)
1843 cast = "(u32)";
1844 if (is_lea)
1845 ferr(po, "lea an offset?\n");
1846 snprintf(buf, buf_size, "%s&%s", cast, name);
1847 break;
1848
1849 case OPT_CONST:
1850 if (is_lea)
1851 ferr(po, "lea from const?\n");
1852
1853 printf_number(tmp1, sizeof(tmp1), popr->val);
1854 if (popr->val == 0 && strchr(cast, '*'))
1855 snprintf(buf, buf_size, "NULL");
1856 else
1857 snprintf(buf, buf_size, "%s%s",
1858 simplify_cast_num(cast, popr->val), tmp1);
1859 break;
1860
1861 default:
1862 ferr(po, "invalid src type: %d\n", popr->type);
1863 }
1864
1865 return buf;
1866}
1867
1868// note: may set is_ptr (we find that out late for ebp frame..)
1869static char *out_dst_opr(char *buf, size_t buf_size,
1870 struct parsed_op *po, struct parsed_opr *popr)
1871{
1872 switch (popr->type) {
1873 case OPT_REG:
1874 switch (popr->lmod) {
1875 case OPLM_QWORD:
1876 snprintf(buf, buf_size, "%s.q", opr_reg_p(po, popr));
1877 break;
1878 case OPLM_DWORD:
1879 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1880 break;
1881 case OPLM_WORD:
1882 // ugh..
1883 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1884 break;
1885 case OPLM_BYTE:
1886 // ugh..
1887 if (popr->name[1] == 'h') // XXX..
1888 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1889 else
1890 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
1891 break;
1892 default:
1893 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1894 }
1895 break;
1896
1897 case OPT_REGMEM:
1898 if (is_stack_access(po, popr)) {
1899 stack_frame_access(po, popr, buf, buf_size,
1900 popr->name, "", 0, 0);
1901 break;
1902 }
1903
1904 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1905
1906 case OPT_LABEL:
1907 if (popr->size_mismatch)
1908 snprintf(buf, buf_size, "%s%s%s",
1909 lmod_cast_u_ptr(po, popr->lmod),
1910 popr->is_array ? "" : "&", popr->name);
1911 else
1912 snprintf(buf, buf_size, "%s%s", popr->name,
1913 popr->is_array ? "[0]" : "");
1914 break;
1915
1916 default:
1917 ferr(po, "invalid dst type: %d\n", popr->type);
1918 }
1919
1920 return buf;
1921}
1922
1923static char *out_src_opr_u32(char *buf, size_t buf_size,
1924 struct parsed_op *po, struct parsed_opr *popr)
1925{
1926 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1927}
1928
1929static void out_test_for_cc(char *buf, size_t buf_size,
1930 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
1931 enum opr_lenmod lmod, const char *expr)
1932{
1933 const char *cast, *scast;
1934
1935 cast = lmod_cast_u(po, lmod);
1936 scast = lmod_cast_s(po, lmod);
1937
1938 switch (pfo) {
1939 case PFO_Z:
1940 case PFO_BE: // CF=1||ZF=1; CF=0
1941 snprintf(buf, buf_size, "(%s%s %s 0)",
1942 cast, expr, is_inv ? "!=" : "==");
1943 break;
1944
1945 case PFO_S:
1946 case PFO_L: // SF!=OF; OF=0
1947 snprintf(buf, buf_size, "(%s%s %s 0)",
1948 scast, expr, is_inv ? ">=" : "<");
1949 break;
1950
1951 case PFO_LE: // ZF=1||SF!=OF; OF=0
1952 snprintf(buf, buf_size, "(%s%s %s 0)",
1953 scast, expr, is_inv ? ">" : "<=");
1954 break;
1955
1956 default:
1957 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1958 }
1959}
1960
1961static void out_cmp_for_cc(char *buf, size_t buf_size,
1962 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
1963{
1964 const char *cast, *scast, *cast_use;
1965 char buf1[256], buf2[256];
1966 enum opr_lenmod lmod;
1967
1968 if (po->op != OP_DEC && po->operand[0].lmod != po->operand[1].lmod)
1969 ferr(po, "%s: lmod mismatch: %d %d\n", __func__,
1970 po->operand[0].lmod, po->operand[1].lmod);
1971 lmod = po->operand[0].lmod;
1972
1973 cast = lmod_cast_u(po, lmod);
1974 scast = lmod_cast_s(po, lmod);
1975
1976 switch (pfo) {
1977 case PFO_C:
1978 case PFO_Z:
1979 case PFO_BE: // !a
1980 cast_use = cast;
1981 break;
1982
1983 case PFO_S:
1984 case PFO_L: // !ge
1985 case PFO_LE:
1986 cast_use = scast;
1987 break;
1988
1989 default:
1990 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
1991 }
1992
1993 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], cast_use, 0);
1994 if (po->op == OP_DEC)
1995 snprintf(buf2, sizeof(buf2), "1");
1996 else
1997 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1], cast_use, 0);
1998
1999 switch (pfo) {
2000 case PFO_C:
2001 // note: must be unsigned compare
2002 snprintf(buf, buf_size, "(%s %s %s)",
2003 buf1, is_inv ? ">=" : "<", buf2);
2004 break;
2005
2006 case PFO_Z:
2007 snprintf(buf, buf_size, "(%s %s %s)",
2008 buf1, is_inv ? "!=" : "==", buf2);
2009 break;
2010
2011 case PFO_BE: // !a
2012 // note: must be unsigned compare
2013 snprintf(buf, buf_size, "(%s %s %s)",
2014 buf1, is_inv ? ">" : "<=", buf2);
2015
2016 // annoying case
2017 if (is_inv && lmod == OPLM_BYTE
2018 && po->operand[1].type == OPT_CONST
2019 && po->operand[1].val == 0xff)
2020 {
2021 snprintf(g_comment, sizeof(g_comment), "if %s", buf);
2022 snprintf(buf, buf_size, "(0)");
2023 }
2024 break;
2025
2026 // note: must be signed compare
2027 case PFO_S:
2028 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
2029 scast, buf1, buf2, is_inv ? ">=" : "<");
2030 break;
2031
2032 case PFO_L: // !ge
2033 snprintf(buf, buf_size, "(%s %s %s)",
2034 buf1, is_inv ? ">=" : "<", buf2);
2035 break;
2036
2037 case PFO_LE: // !g
2038 snprintf(buf, buf_size, "(%s %s %s)",
2039 buf1, is_inv ? ">" : "<=", buf2);
2040 break;
2041
2042 default:
2043 break;
2044 }
2045}
2046
2047static void out_cmp_test(char *buf, size_t buf_size,
2048 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
2049{
2050 char buf1[256], buf2[256], buf3[256];
2051
2052 if (po->op == OP_TEST) {
2053 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2054 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
2055 }
2056 else {
2057 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
2058 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
2059 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
2060 }
2061 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
2062 po->operand[0].lmod, buf3);
2063 }
2064 else if (po->op == OP_CMP) {
2065 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv);
2066 }
2067 else
2068 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
2069}
2070
2071static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
2072 struct parsed_opr *popr2)
2073{
2074 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
2075 ferr(po, "missing lmod for both operands\n");
2076
2077 if (popr1->lmod == OPLM_UNSPEC)
2078 popr1->lmod = popr2->lmod;
2079 else if (popr2->lmod == OPLM_UNSPEC)
2080 popr2->lmod = popr1->lmod;
2081 else if (popr1->lmod != popr2->lmod) {
2082 if (popr1->type_from_var) {
2083 popr1->size_mismatch = 1;
2084 if (popr1->lmod < popr2->lmod)
2085 popr1->size_lt = 1;
2086 popr1->lmod = popr2->lmod;
2087 }
2088 else if (popr2->type_from_var) {
2089 popr2->size_mismatch = 1;
2090 if (popr2->lmod < popr1->lmod)
2091 popr2->size_lt = 1;
2092 popr2->lmod = popr1->lmod;
2093 }
2094 else
2095 ferr(po, "conflicting lmods: %d vs %d\n",
2096 popr1->lmod, popr2->lmod);
2097 }
2098}
2099
2100static const char *op_to_c(struct parsed_op *po)
2101{
2102 switch (po->op)
2103 {
2104 case OP_ADD:
2105 case OP_ADC:
2106 return "+";
2107 case OP_SUB:
2108 case OP_SBB:
2109 return "-";
2110 case OP_AND:
2111 return "&";
2112 case OP_OR:
2113 return "|";
2114 case OP_XOR:
2115 return "^";
2116 case OP_SHL:
2117 return "<<";
2118 case OP_SHR:
2119 return ">>";
2120 case OP_MUL:
2121 case OP_IMUL:
2122 return "*";
2123 default:
2124 ferr(po, "op_to_c was supplied with %d\n", po->op);
2125 }
2126}
2127
2128static void op_set_clear_flag(struct parsed_op *po,
2129 enum op_flags flag_set, enum op_flags flag_clear)
2130{
2131 po->flags |= flag_set;
2132 po->flags &= ~flag_clear;
2133}
2134
2135// last op in stream - unconditional branch or ret
2136#define LAST_OP(_i) ((ops[_i].flags & OPF_TAIL) \
2137 || ((ops[_i].flags & (OPF_JMP|OPF_CJMP|OPF_RMD)) == OPF_JMP \
2138 && ops[_i].op != OP_CALL))
2139
2140static int scan_for_pop(int i, int opcnt, const char *reg,
2141 int magic, int depth, int *maxdepth, int do_flags)
2142{
2143 const struct parsed_proto *pp;
2144 struct parsed_op *po;
2145 int ret = 0;
2146 int j;
2147
2148 for (; i < opcnt; i++) {
2149 po = &ops[i];
2150 if (po->cc_scratch == magic)
2151 break; // already checked
2152 po->cc_scratch = magic;
2153
2154 if (po->flags & OPF_TAIL) {
2155 if (po->op == OP_CALL) {
2156 pp = proto_parse(g_fhdr, po->operand[0].name, g_quiet_pp);
2157 if (pp != NULL && pp->is_noreturn)
2158 // no stack cleanup for noreturn
2159 return ret;
2160 }
2161 return -1; // deadend
2162 }
2163
2164 if ((po->flags & (OPF_RMD|OPF_DONE))
2165 || (po->op == OP_PUSH && po->p_argnum != 0)) // arg push
2166 continue;
2167
2168 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2169 if (po->btj != NULL) {
2170 // jumptable
2171 for (j = 0; j < po->btj->count; j++) {
2172 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
2173 depth, maxdepth, do_flags);
2174 if (ret < 0)
2175 return ret; // dead end
2176 }
2177 return ret;
2178 }
2179
2180 if (po->bt_i < 0) {
2181 ferr(po, "dead branch\n");
2182 return -1;
2183 }
2184
2185 if (po->flags & OPF_CJMP) {
2186 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
2187 depth, maxdepth, do_flags);
2188 if (ret < 0)
2189 return ret; // dead end
2190 }
2191 else {
2192 i = po->bt_i - 1;
2193 }
2194 continue;
2195 }
2196
2197 if ((po->op == OP_POP || po->op == OP_PUSH)
2198 && po->operand[0].type == OPT_REG
2199 && IS(po->operand[0].name, reg))
2200 {
2201 if (po->op == OP_PUSH && !(po->flags & OPF_FARGNR)) {
2202 depth++;
2203 if (depth > *maxdepth)
2204 *maxdepth = depth;
2205 if (do_flags)
2206 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2207 }
2208 else if (po->op == OP_POP) {
2209 if (depth == 0) {
2210 if (do_flags)
2211 op_set_clear_flag(po, OPF_RMD, OPF_RSAVE);
2212 return 1;
2213 }
2214 else {
2215 depth--;
2216 if (depth < 0) // should not happen
2217 ferr(po, "fail with depth\n");
2218 if (do_flags)
2219 op_set_clear_flag(po, OPF_RSAVE, OPF_RMD);
2220 }
2221 }
2222 }
2223 }
2224
2225 return ret;
2226}
2227
2228// scan for pop starting from 'ret' op (all paths)
2229static int scan_for_pop_ret(int i, int opcnt, const char *reg,
2230 int flag_set)
2231{
2232 int found = 0;
2233 int j;
2234
2235 for (; i < opcnt; i++) {
2236 if (!(ops[i].flags & OPF_TAIL))
2237 continue;
2238
2239 for (j = i - 1; j >= 0; j--) {
2240 if (ops[j].flags & (OPF_RMD|OPF_DONE))
2241 continue;
2242 if (ops[j].flags & OPF_JMP)
2243 return -1;
2244
2245 if (ops[j].op == OP_POP && ops[j].datap == NULL
2246 && ops[j].operand[0].type == OPT_REG
2247 && IS(ops[j].operand[0].name, reg))
2248 {
2249 found = 1;
2250 ops[j].flags |= flag_set;
2251 break;
2252 }
2253
2254 if (g_labels[j] != NULL)
2255 return -1;
2256 }
2257 }
2258
2259 return found ? 0 : -1;
2260}
2261
2262static void scan_for_pop_const(int i, int opcnt)
2263{
2264 int j;
2265
2266 for (j = i + 1; j < opcnt; j++) {
2267 if ((ops[j].flags & (OPF_JMP|OPF_TAIL|OPF_RSAVE))
2268 || ops[j].op == OP_PUSH || g_labels[i] != NULL)
2269 {
2270 break;
2271 }
2272
2273 if (ops[j].op == OP_POP && !(ops[j].flags & (OPF_RMD|OPF_DONE)))
2274 {
2275 ops[i].flags |= OPF_RMD | OPF_DONE;
2276 ops[j].flags |= OPF_DONE;
2277 ops[j].datap = &ops[i];
2278 break;
2279 }
2280 }
2281}
2282
2283static void scan_propagate_df(int i, int opcnt)
2284{
2285 struct parsed_op *po = &ops[i];
2286 int j;
2287
2288 for (; i < opcnt; i++) {
2289 po = &ops[i];
2290 if (po->flags & OPF_DF)
2291 return; // already resolved
2292 po->flags |= OPF_DF;
2293
2294 if (po->op == OP_CALL)
2295 ferr(po, "call with DF set?\n");
2296
2297 if (po->flags & OPF_JMP) {
2298 if (po->btj != NULL) {
2299 // jumptable
2300 for (j = 0; j < po->btj->count; j++)
2301 scan_propagate_df(po->btj->d[j].bt_i, opcnt);
2302 return;
2303 }
2304
2305 if (po->bt_i < 0) {
2306 ferr(po, "dead branch\n");
2307 return;
2308 }
2309
2310 if (po->flags & OPF_CJMP)
2311 scan_propagate_df(po->bt_i, opcnt);
2312 else
2313 i = po->bt_i - 1;
2314 continue;
2315 }
2316
2317 if (po->flags & OPF_TAIL)
2318 break;
2319
2320 if (po->op == OP_CLD) {
2321 po->flags |= OPF_RMD | OPF_DONE;
2322 return;
2323 }
2324 }
2325
2326 ferr(po, "missing DF clear?\n");
2327}
2328
2329// is operand 'opr' modified by parsed_op 'po'?
2330static int is_opr_modified(const struct parsed_opr *opr,
2331 const struct parsed_op *po)
2332{
2333 int mask;
2334
2335 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2336 return 0;
2337
2338 if (opr->type == OPT_REG) {
2339 if (po->op == OP_CALL) {
2340 mask = (1 << xAX) | (1 << xCX) | (1 << xDX);
2341 if ((1 << opr->reg) & mask)
2342 return 1;
2343 else
2344 return 0;
2345 }
2346
2347 if (po->operand[0].type == OPT_REG) {
2348 if (po->regmask_dst & (1 << opr->reg))
2349 return 1;
2350 else
2351 return 0;
2352 }
2353 }
2354
2355 return IS(po->operand[0].name, opr->name);
2356}
2357
2358// is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
2359static int is_any_opr_modified(const struct parsed_op *po_test,
2360 const struct parsed_op *po, int c_mode)
2361{
2362 int mask;
2363 int i;
2364
2365 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
2366 return 0;
2367
2368 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2369 return 0;
2370
2371 if ((po_test->regmask_src | po_test->regmask_dst) & po->regmask_dst)
2372 return 1;
2373
2374 // in reality, it can wreck any register, but in decompiled C
2375 // version it can only overwrite eax or edx:eax
2376 mask = (1 << xAX) | (1 << xDX);
2377 if (!c_mode)
2378 mask |= 1 << xCX;
2379
2380 if (po->op == OP_CALL
2381 && ((po_test->regmask_src | po_test->regmask_dst) & mask))
2382 return 1;
2383
2384 for (i = 0; i < po_test->operand_cnt; i++)
2385 if (IS(po_test->operand[i].name, po->operand[0].name))
2386 return 1;
2387
2388 return 0;
2389}
2390
2391// scan for any po_test operand modification in range given
2392static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt,
2393 int c_mode)
2394{
2395 if (po_test->operand_cnt == 1 && po_test->operand[0].type == OPT_CONST)
2396 return -1;
2397
2398 for (; i < opcnt; i++) {
2399 if (is_any_opr_modified(po_test, &ops[i], c_mode))
2400 return i;
2401 }
2402
2403 return -1;
2404}
2405
2406// scan for po_test operand[0] modification in range given
2407static int scan_for_mod_opr0(struct parsed_op *po_test,
2408 int i, int opcnt)
2409{
2410 for (; i < opcnt; i++) {
2411 if (is_opr_modified(&po_test->operand[0], &ops[i]))
2412 return i;
2413 }
2414
2415 return -1;
2416}
2417
2418#define check_i(po, i) \
2419 if ((i) < 0) \
2420 ferr(po, "bad " #i ": %d\n", i)
2421
2422static int scan_for_flag_set(int i, int magic, int *branched,
2423 int *setters, int *setter_cnt)
2424{
2425 struct label_ref *lr;
2426 int ret;
2427
2428 while (i >= 0) {
2429 if (ops[i].cc_scratch == magic) {
2430 ferr(&ops[i], "%s looped\n", __func__);
2431 return -1;
2432 }
2433 ops[i].cc_scratch = magic;
2434
2435 if (g_labels[i] != NULL) {
2436 *branched = 1;
2437
2438 lr = &g_label_refs[i];
2439 for (; lr->next; lr = lr->next) {
2440 check_i(&ops[i], lr->i);
2441 ret = scan_for_flag_set(lr->i, magic,
2442 branched, setters, setter_cnt);
2443 if (ret < 0)
2444 return ret;
2445 }
2446
2447 check_i(&ops[i], lr->i);
2448 if (i > 0 && LAST_OP(i - 1)) {
2449 i = lr->i;
2450 continue;
2451 }
2452 ret = scan_for_flag_set(lr->i, magic,
2453 branched, setters, setter_cnt);
2454 if (ret < 0)
2455 return ret;
2456 }
2457 i--;
2458
2459 if (ops[i].flags & OPF_FLAGS) {
2460 setters[*setter_cnt] = i;
2461 (*setter_cnt)++;
2462 return 0;
2463 }
2464
2465 if ((ops[i].flags & (OPF_JMP|OPF_CJMP)) == OPF_JMP)
2466 return -1;
2467 }
2468
2469 return -1;
2470}
2471
2472// scan back for cdq, if anything modifies edx, fail
2473static int scan_for_cdq_edx(int i)
2474{
2475 while (i >= 0) {
2476 if (g_labels[i] != NULL) {
2477 if (g_label_refs[i].next != NULL)
2478 return -1;
2479 if (i > 0 && LAST_OP(i - 1)) {
2480 i = g_label_refs[i].i;
2481 continue;
2482 }
2483 return -1;
2484 }
2485 i--;
2486
2487 if (ops[i].op == OP_CDQ)
2488 return i;
2489
2490 if (ops[i].regmask_dst & (1 << xDX))
2491 return -1;
2492 }
2493
2494 return -1;
2495}
2496
2497static int scan_for_reg_clear(int i, int reg)
2498{
2499 while (i >= 0) {
2500 if (g_labels[i] != NULL) {
2501 if (g_label_refs[i].next != NULL)
2502 return -1;
2503 if (i > 0 && LAST_OP(i - 1)) {
2504 i = g_label_refs[i].i;
2505 continue;
2506 }
2507 return -1;
2508 }
2509 i--;
2510
2511 if (ops[i].op == OP_XOR
2512 && ops[i].operand[0].lmod == OPLM_DWORD
2513 && ops[i].operand[0].reg == ops[i].operand[1].reg
2514 && ops[i].operand[0].reg == reg)
2515 return i;
2516
2517 if (ops[i].regmask_dst & (1 << reg))
2518 return -1;
2519 }
2520
2521 return -1;
2522}
2523
2524// scan for positive, constant esp adjust
2525static int scan_for_esp_adjust(int i, int opcnt,
2526 unsigned int adj_expect, int *adj, int *multipath)
2527{
2528 struct parsed_op *po;
2529 int first_pop = -1;
2530
2531 *adj = *multipath = 0;
2532
2533 for (; i < opcnt && *adj < adj_expect; i++) {
2534 if (g_labels[i] != NULL)
2535 *multipath = 1;
2536
2537 po = &ops[i];
2538 if (po->flags & OPF_DONE)
2539 continue;
2540
2541 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
2542 if (po->operand[1].type != OPT_CONST)
2543 ferr(&ops[i], "non-const esp adjust?\n");
2544 *adj += po->operand[1].val;
2545 if (*adj & 3)
2546 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
2547 return i;
2548 }
2549 else if (po->op == OP_PUSH) {
2550 //if (first_pop == -1)
2551 // first_pop = -2; // none
2552 *adj -= lmod_bytes(po, po->operand[0].lmod);
2553 }
2554 else if (po->op == OP_POP) {
2555 // seems like msvc only uses 'pop ecx' for stack realignment..
2556 if (po->operand[0].type != OPT_REG || po->operand[0].reg != xCX)
2557 break;
2558 if (first_pop == -1 && *adj >= 0)
2559 first_pop = i;
2560 *adj += lmod_bytes(po, po->operand[0].lmod);
2561 }
2562 else if (po->flags & (OPF_JMP|OPF_TAIL)) {
2563 if (po->op == OP_JMP && po->btj == NULL) {
2564 if (po->bt_i <= i)
2565 break;
2566 i = po->bt_i - 1;
2567 continue;
2568 }
2569 if (po->op != OP_CALL)
2570 break;
2571 if (po->operand[0].type != OPT_LABEL)
2572 break;
2573 if (po->pp == NULL || po->pp->is_stdcall)
2574 break;
2575 }
2576 }
2577
2578 if (first_pop >= 0) {
2579 // probably 'pop ecx' was used..
2580 return first_pop;
2581 }
2582
2583 return -1;
2584}
2585
2586static void scan_fwd_set_flags(int i, int opcnt, int magic, int flags)
2587{
2588 struct parsed_op *po;
2589 int j;
2590
2591 if (i < 0)
2592 ferr(ops, "%s: followed bad branch?\n", __func__);
2593
2594 for (; i < opcnt; i++) {
2595 po = &ops[i];
2596 if (po->cc_scratch == magic)
2597 return;
2598 po->cc_scratch = magic;
2599 po->flags |= flags;
2600
2601 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
2602 if (po->btj != NULL) {
2603 // jumptable
2604 for (j = 0; j < po->btj->count; j++)
2605 scan_fwd_set_flags(po->btj->d[j].bt_i, opcnt, magic, flags);
2606 return;
2607 }
2608
2609 scan_fwd_set_flags(po->bt_i, opcnt, magic, flags);
2610 if (!(po->flags & OPF_CJMP))
2611 return;
2612 }
2613 if (po->flags & OPF_TAIL)
2614 return;
2615 }
2616}
2617
2618static const struct parsed_proto *try_recover_pp(
2619 struct parsed_op *po, const struct parsed_opr *opr, int *search_instead)
2620{
2621 const struct parsed_proto *pp = NULL;
2622 char buf[256];
2623 char *p;
2624
2625 // maybe an arg of g_func?
2626 if (opr->type == OPT_REGMEM && is_stack_access(po, opr))
2627 {
2628 char ofs_reg[16] = { 0, };
2629 int arg, arg_s, arg_i;
2630 int stack_ra = 0;
2631 int offset = 0;
2632
2633 if (g_header_mode)
2634 return NULL;
2635
2636 parse_stack_access(po, opr->name, ofs_reg,
2637 &offset, &stack_ra, NULL, 0);
2638 if (ofs_reg[0] != 0)
2639 ferr(po, "offset reg on arg access?\n");
2640 if (offset <= stack_ra) {
2641 // search who set the stack var instead
2642 if (search_instead != NULL)
2643 *search_instead = 1;
2644 return NULL;
2645 }
2646
2647 arg_i = (offset - stack_ra - 4) / 4;
2648 for (arg = arg_s = 0; arg < g_func_pp->argc; arg++) {
2649 if (g_func_pp->arg[arg].reg != NULL)
2650 continue;
2651 if (arg_s == arg_i)
2652 break;
2653 arg_s++;
2654 }
2655 if (arg == g_func_pp->argc)
2656 ferr(po, "stack arg %d not in prototype?\n", arg_i);
2657
2658 pp = g_func_pp->arg[arg].fptr;
2659 if (pp == NULL)
2660 ferr(po, "icall sa: arg%d is not a fptr?\n", arg + 1);
2661 check_func_pp(po, pp, "icall arg");
2662 }
2663 else if (opr->type == OPT_REGMEM && strchr(opr->name + 1, '[')) {
2664 // label[index]
2665 p = strchr(opr->name + 1, '[');
2666 memcpy(buf, opr->name, p - opr->name);
2667 buf[p - opr->name] = 0;
2668 pp = proto_parse(g_fhdr, buf, g_quiet_pp);
2669 }
2670 else if (opr->type == OPT_OFFSET || opr->type == OPT_LABEL) {
2671 pp = proto_parse(g_fhdr, opr->name, g_quiet_pp);
2672 if (pp == NULL) {
2673 if (!g_header_mode)
2674 ferr(po, "proto_parse failed for icall to '%s'\n", opr->name);
2675 }
2676 else
2677 check_func_pp(po, pp, "reg-fptr ref");
2678 }
2679
2680 return pp;
2681}
2682
2683static void scan_for_call_type(int i, const struct parsed_opr *opr,
2684 int magic, const struct parsed_proto **pp_found, int *multi)
2685{
2686 const struct parsed_proto *pp = NULL;
2687 struct parsed_op *po;
2688 struct label_ref *lr;
2689
2690 ops[i].cc_scratch = magic;
2691
2692 while (1) {
2693 if (g_labels[i] != NULL) {
2694 lr = &g_label_refs[i];
2695 for (; lr != NULL; lr = lr->next) {
2696 check_i(&ops[i], lr->i);
2697 scan_for_call_type(lr->i, opr, magic, pp_found, multi);
2698 }
2699 if (i > 0 && LAST_OP(i - 1))
2700 return;
2701 }
2702
2703 i--;
2704 if (i < 0)
2705 break;
2706
2707 if (ops[i].cc_scratch == magic)
2708 return;
2709 ops[i].cc_scratch = magic;
2710
2711 if (!(ops[i].flags & OPF_DATA))
2712 continue;
2713 if (!is_opr_modified(opr, &ops[i]))
2714 continue;
2715 if (ops[i].op != OP_MOV && ops[i].op != OP_LEA) {
2716 // most probably trashed by some processing
2717 *pp_found = NULL;
2718 return;
2719 }
2720
2721 opr = &ops[i].operand[1];
2722 if (opr->type != OPT_REG)
2723 break;
2724 }
2725
2726 po = (i >= 0) ? &ops[i] : ops;
2727
2728 if (i < 0) {
2729 // reached the top - can only be an arg-reg
2730 if (opr->type != OPT_REG)
2731 return;
2732
2733 for (i = 0; i < g_func_pp->argc; i++) {
2734 if (g_func_pp->arg[i].reg == NULL)
2735 continue;
2736 if (IS(opr->name, g_func_pp->arg[i].reg))
2737 break;
2738 }
2739 if (i == g_func_pp->argc)
2740 return;
2741 pp = g_func_pp->arg[i].fptr;
2742 if (pp == NULL)
2743 ferr(po, "icall: arg%d (%s) is not a fptr?\n",
2744 i + 1, g_func_pp->arg[i].reg);
2745 check_func_pp(po, pp, "icall reg-arg");
2746 }
2747 else
2748 pp = try_recover_pp(po, opr, NULL);
2749
2750 if (*pp_found != NULL && pp != NULL && *pp_found != pp) {
2751 if (!IS((*pp_found)->ret_type.name, pp->ret_type.name)
2752 || (*pp_found)->is_stdcall != pp->is_stdcall
2753 || (*pp_found)->is_fptr != pp->is_fptr
2754 || (*pp_found)->argc != pp->argc
2755 || (*pp_found)->argc_reg != pp->argc_reg
2756 || (*pp_found)->argc_stack != pp->argc_stack)
2757 {
2758 ferr(po, "icall: parsed_proto mismatch\n");
2759 }
2760 *multi = 1;
2761 }
2762 if (pp != NULL)
2763 *pp_found = pp;
2764}
2765
2766// early check for tail call or branch back
2767static int is_like_tailjmp(int j)
2768{
2769 if (!(ops[j].flags & OPF_JMP))
2770 return 0;
2771
2772 if (ops[j].op == OP_JMP && !ops[j].operand[0].had_ds)
2773 // probably local branch back..
2774 return 1;
2775 if (ops[j].op == OP_CALL)
2776 // probably noreturn call..
2777 return 1;
2778
2779 return 0;
2780}
2781
2782static void scan_prologue_epilogue(int opcnt)
2783{
2784 int ecx_push = 0, esp_sub = 0;
2785 int found;
2786 int i, j, l;
2787
2788 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
2789 && ops[1].op == OP_MOV
2790 && IS(opr_name(&ops[1], 0), "ebp")
2791 && IS(opr_name(&ops[1], 1), "esp"))
2792 {
2793 g_bp_frame = 1;
2794 ops[0].flags |= OPF_RMD | OPF_DONE;
2795 ops[1].flags |= OPF_RMD | OPF_DONE;
2796 i = 2;
2797
2798 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
2799 g_stack_fsz = opr_const(&ops[2], 1);
2800 ops[2].flags |= OPF_RMD | OPF_DONE;
2801 i++;
2802 }
2803 else {
2804 // another way msvc builds stack frame..
2805 i = 2;
2806 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2807 g_stack_fsz += 4;
2808 ops[i].flags |= OPF_RMD | OPF_DONE;
2809 ecx_push++;
2810 i++;
2811 }
2812 // and another way..
2813 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
2814 && ops[i].operand[1].type == OPT_CONST
2815 && ops[i + 1].op == OP_CALL
2816 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
2817 {
2818 g_stack_fsz += ops[i].operand[1].val;
2819 ops[i].flags |= OPF_RMD | OPF_DONE;
2820 i++;
2821 ops[i].flags |= OPF_RMD | OPF_DONE;
2822 i++;
2823 }
2824 }
2825
2826 found = 0;
2827 do {
2828 for (; i < opcnt; i++)
2829 if (ops[i].op == OP_RET)
2830 break;
2831 j = i - 1;
2832 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
2833 if (found && is_like_tailjmp(j))
2834 break;
2835 j--;
2836 }
2837
2838 if ((ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ebp"))
2839 || ops[j].op == OP_LEAVE)
2840 {
2841 ops[j].flags |= OPF_RMD | OPF_DONE;
2842 }
2843 else if (!(g_ida_func_attr & IDAFA_NORETURN))
2844 ferr(&ops[j], "'pop ebp' expected\n");
2845
2846 if (g_stack_fsz != 0) {
2847 if (ops[j - 1].op == OP_MOV
2848 && IS(opr_name(&ops[j - 1], 0), "esp")
2849 && IS(opr_name(&ops[j - 1], 1), "ebp"))
2850 {
2851 ops[j - 1].flags |= OPF_RMD | OPF_DONE;
2852 }
2853 else if (ops[j].op != OP_LEAVE
2854 && !(g_ida_func_attr & IDAFA_NORETURN))
2855 {
2856 ferr(&ops[j - 1], "esp restore expected\n");
2857 }
2858
2859 if (ecx_push && ops[j - 2].op == OP_POP
2860 && IS(opr_name(&ops[j - 2], 0), "ecx"))
2861 {
2862 ferr(&ops[j - 2], "unexpected ecx pop\n");
2863 }
2864 }
2865
2866 found = 1;
2867 i++;
2868 } while (i < opcnt);
2869
2870 return;
2871 }
2872
2873 // non-bp frame
2874 i = 0;
2875 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2876 ops[i].flags |= OPF_RMD | OPF_DONE;
2877 g_stack_fsz += 4;
2878 ecx_push++;
2879 i++;
2880 }
2881
2882 for (; i < opcnt; i++) {
2883 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2884 break;
2885 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2886 && ops[i].operand[1].type == OPT_CONST)
2887 {
2888 g_stack_fsz = ops[i].operand[1].val;
2889 ops[i].flags |= OPF_RMD | OPF_DONE;
2890 esp_sub = 1;
2891 break;
2892 }
2893 }
2894
2895 if (ecx_push && !esp_sub) {
2896 // could actually be args for a call..
2897 for (; i < opcnt; i++)
2898 if (ops[i].op != OP_PUSH)
2899 break;
2900
2901 if (ops[i].op == OP_CALL && ops[i].operand[0].type == OPT_LABEL) {
2902 const struct parsed_proto *pp;
2903 pp = proto_parse(g_fhdr, opr_name(&ops[i], 0), 1);
2904 j = pp ? pp->argc_stack : 0;
2905 while (i > 0 && j > 0) {
2906 i--;
2907 if (ops[i].op == OP_PUSH) {
2908 ops[i].flags &= ~(OPF_RMD | OPF_DONE);
2909 j--;
2910 }
2911 }
2912 if (j != 0)
2913 ferr(&ops[i], "unhandled prologue\n");
2914
2915 // recheck
2916 i = g_stack_fsz = ecx_push = 0;
2917 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
2918 if (!(ops[i].flags & OPF_RMD))
2919 break;
2920 g_stack_fsz += 4;
2921 ecx_push++;
2922 i++;
2923 }
2924 }
2925 }
2926
2927 found = 0;
2928 if (ecx_push || esp_sub)
2929 {
2930 g_sp_frame = 1;
2931
2932 i++;
2933 do {
2934 for (; i < opcnt; i++)
2935 if (ops[i].op == OP_RET)
2936 break;
2937 j = i - 1;
2938 if (i == opcnt && (ops[j].flags & OPF_JMP)) {
2939 if (found && is_like_tailjmp(j))
2940 break;
2941 j--;
2942 }
2943
2944 if (ecx_push > 0) {
2945 for (l = 0; l < ecx_push; l++) {
2946 if (ops[j].op == OP_POP && IS(opr_name(&ops[j], 0), "ecx"))
2947 /* pop ecx */;
2948 else if (ops[j].op == OP_ADD
2949 && IS(opr_name(&ops[j], 0), "esp")
2950 && ops[j].operand[1].type == OPT_CONST)
2951 {
2952 /* add esp, N */
2953 l += ops[j].operand[1].val / 4 - 1;
2954 }
2955 else
2956 ferr(&ops[j], "'pop ecx' expected\n");
2957
2958 ops[j].flags |= OPF_RMD | OPF_DONE;
2959 j--;
2960 }
2961 if (l != ecx_push)
2962 ferr(&ops[j], "epilogue scan failed\n");
2963
2964 found = 1;
2965 }
2966
2967 if (esp_sub) {
2968 if (ops[j].op != OP_ADD
2969 || !IS(opr_name(&ops[j], 0), "esp")
2970 || ops[j].operand[1].type != OPT_CONST
2971 || ops[j].operand[1].val != g_stack_fsz)
2972 ferr(&ops[j], "'add esp' expected\n");
2973
2974 ops[j].flags |= OPF_RMD | OPF_DONE;
2975 ops[j].operand[1].val = 0; // hack for stack arg scanner
2976 found = 1;
2977 }
2978
2979 i++;
2980 } while (i < opcnt);
2981 }
2982}
2983
2984static const struct parsed_proto *resolve_icall(int i, int opcnt,
2985 int *multi_src)
2986{
2987 const struct parsed_proto *pp = NULL;
2988 int search_advice = 0;
2989
2990 *multi_src = 0;
2991
2992 switch (ops[i].operand[0].type) {
2993 case OPT_REGMEM:
2994 case OPT_LABEL:
2995 case OPT_OFFSET:
2996 pp = try_recover_pp(&ops[i], &ops[i].operand[0], &search_advice);
2997 if (!search_advice)
2998 break;
2999 // fallthrough
3000 default:
3001 scan_for_call_type(i, &ops[i].operand[0], i + opcnt * 9, &pp,
3002 multi_src);
3003 break;
3004 }
3005
3006 return pp;
3007}
3008
3009// find an instruction that changed opr before i op
3010// *op_i must be set to -1 by caller
3011// *entry is set to 1 if one source is determined to be the caller
3012// returns 1 if found, *op_i is then set to origin
3013static int resolve_origin(int i, const struct parsed_opr *opr,
3014 int magic, int *op_i, int *is_caller)
3015{
3016 struct label_ref *lr;
3017 int ret = 0;
3018
3019 if (ops[i].cc_scratch == magic)
3020 return 0;
3021 ops[i].cc_scratch = magic;
3022
3023 while (1) {
3024 if (g_labels[i] != NULL) {
3025 lr = &g_label_refs[i];
3026 for (; lr != NULL; lr = lr->next) {
3027 check_i(&ops[i], lr->i);
3028 ret |= resolve_origin(lr->i, opr, magic, op_i, is_caller);
3029 }
3030 if (i > 0 && LAST_OP(i - 1))
3031 return ret;
3032 }
3033
3034 i--;
3035 if (i < 0) {
3036 if (is_caller != NULL)
3037 *is_caller = 1;
3038 return -1;
3039 }
3040
3041 if (ops[i].cc_scratch == magic)
3042 return 0;
3043 ops[i].cc_scratch = magic;
3044
3045 if (!(ops[i].flags & OPF_DATA))
3046 continue;
3047 if (!is_opr_modified(opr, &ops[i]))
3048 continue;
3049
3050 if (*op_i >= 0) {
3051 if (*op_i == i)
3052 return 1;
3053 // XXX: could check if the other op does the same
3054 return -1;
3055 }
3056
3057 *op_i = i;
3058 return 1;
3059 }
3060}
3061
3062static int try_resolve_const(int i, const struct parsed_opr *opr,
3063 int magic, unsigned int *val)
3064{
3065 int s_i = -1;
3066 int ret;
3067
3068 ret = resolve_origin(i, opr, magic, &s_i, NULL);
3069 if (ret == 1) {
3070 i = s_i;
3071 if (ops[i].op != OP_MOV && ops[i].operand[1].type != OPT_CONST)
3072 return -1;
3073
3074 *val = ops[i].operand[1].val;
3075 return 1;
3076 }
3077
3078 return -1;
3079}
3080
3081static struct parsed_proto *process_call_early(int i, int opcnt,
3082 int *adj_i)
3083{
3084 struct parsed_op *po = &ops[i];
3085 struct parsed_proto *pp;
3086 int multipath = 0;
3087 int adj = 0;
3088 int ret;
3089
3090 pp = po->pp;
3091 if (pp == NULL || pp->is_vararg || pp->argc_reg != 0)
3092 // leave for later
3093 return NULL;
3094
3095 // look for and make use of esp adjust
3096 *adj_i = ret = -1;
3097 if (!pp->is_stdcall && pp->argc_stack > 0)
3098 ret = scan_for_esp_adjust(i + 1, opcnt,
3099 pp->argc_stack * 4, &adj, &multipath);
3100 if (ret >= 0) {
3101 if (pp->argc_stack > adj / 4)
3102 return NULL;
3103 if (multipath)
3104 return NULL;
3105 if (ops[ret].op == OP_POP && adj != 4)
3106 return NULL;
3107 }
3108
3109 *adj_i = ret;
3110 return pp;
3111}
3112
3113static void patch_esp_adjust(struct parsed_op *po, int adj)
3114{
3115 ferr_assert(po, po->op == OP_ADD);
3116 ferr_assert(po, IS(opr_name(po, 0), "esp"));
3117 ferr_assert(po, po->operand[1].type == OPT_CONST);
3118
3119 // this is a bit of a hack, but deals with use of
3120 // single adj for multiple calls
3121 po->operand[1].val -= adj;
3122 po->flags |= OPF_RMD;
3123 if (po->operand[1].val == 0)
3124 po->flags |= OPF_DONE;
3125 ferr_assert(po, (int)po->operand[1].val >= 0);
3126}
3127
3128static struct parsed_proto *process_call(int i, int opcnt)
3129{
3130 struct parsed_op *po = &ops[i];
3131 const struct parsed_proto *pp_c;
3132 struct parsed_proto *pp;
3133 const char *tmpname;
3134 int adj = 0, multipath = 0;
3135 int ret, arg;
3136
3137 tmpname = opr_name(po, 0);
3138 pp = po->pp;
3139 if (pp == NULL)
3140 {
3141 // indirect call
3142 pp_c = resolve_icall(i, opcnt, &multipath);
3143 if (pp_c != NULL) {
3144 if (!pp_c->is_func && !pp_c->is_fptr)
3145 ferr(po, "call to non-func: %s\n", pp_c->name);
3146 pp = proto_clone(pp_c);
3147 my_assert_not(pp, NULL);
3148 if (multipath)
3149 // not resolved just to single func
3150 pp->is_fptr = 1;
3151
3152 switch (po->operand[0].type) {
3153 case OPT_REG:
3154 // we resolved this call and no longer need the register
3155 po->regmask_src &= ~(1 << po->operand[0].reg);
3156 break;
3157 case OPT_REGMEM:
3158 pp->is_fptr = 1;
3159 break;
3160 default:
3161 break;
3162 }
3163 }
3164 if (pp == NULL) {
3165 pp = calloc(1, sizeof(*pp));
3166 my_assert_not(pp, NULL);
3167
3168 pp->is_fptr = 1;
3169 ret = scan_for_esp_adjust(i + 1, opcnt, ~0, &adj, &multipath);
3170 if (ret < 0 || adj < 0) {
3171 if (!g_allow_regfunc)
3172 ferr(po, "non-__cdecl indirect call unhandled yet\n");
3173 pp->is_unresolved = 1;
3174 adj = 0;
3175 }
3176 adj /= 4;
3177 if (adj > ARRAY_SIZE(pp->arg))
3178 ferr(po, "esp adjust too large: %d\n", adj);
3179 pp->ret_type.name = strdup("int");
3180 pp->argc = pp->argc_stack = adj;
3181 for (arg = 0; arg < pp->argc; arg++)
3182 pp->arg[arg].type.name = strdup("int");
3183 }
3184 po->pp = pp;
3185 }
3186
3187 // look for and make use of esp adjust
3188 ret = -1;
3189 if (!pp->is_stdcall && pp->argc_stack > 0)
3190 ret = scan_for_esp_adjust(i + 1, opcnt,
3191 pp->argc_stack * 4, &adj, &multipath);
3192 if (ret >= 0) {
3193 if (pp->is_vararg) {
3194 if (adj / 4 < pp->argc_stack) {
3195 fnote(po, "(this call)\n");
3196 ferr(&ops[ret], "esp adjust is too small: %x < %x\n",
3197 adj, pp->argc_stack * 4);
3198 }
3199 // modify pp to make it have varargs as normal args
3200 arg = pp->argc;
3201 pp->argc += adj / 4 - pp->argc_stack;
3202 for (; arg < pp->argc; arg++) {
3203 pp->arg[arg].type.name = strdup("int");
3204 pp->argc_stack++;
3205 }
3206 if (pp->argc > ARRAY_SIZE(pp->arg))
3207 ferr(po, "too many args for '%s'\n", tmpname);
3208 }
3209 if (pp->argc_stack > adj / 4) {
3210 fnote(po, "(this call)\n");
3211 ferr(&ops[ret], "stack tracking failed for '%s': %x %x\n",
3212 tmpname, pp->argc_stack * 4, adj);
3213 }
3214
3215 ops[ret].flags |= OPF_RMD;
3216 if (ops[ret].op == OP_POP) {
3217 if (adj > 4) {
3218 // deal with multi-pop stack adjust
3219 adj = pp->argc_stack;
3220 while (ops[ret].op == OP_POP && adj > 0 && ret < opcnt) {
3221 ops[ret].flags |= OPF_RMD | OPF_DONE;
3222 adj--;
3223 ret++;
3224 }
3225 }
3226 }
3227 else if (!multipath)
3228 patch_esp_adjust(&ops[ret], pp->argc_stack * 4);
3229 }
3230 else if (pp->is_vararg)
3231 ferr(po, "missing esp_adjust for vararg func '%s'\n",
3232 pp->name);
3233
3234 return pp;
3235}
3236
3237static int collect_call_args_early(struct parsed_op *po, int i,
3238 struct parsed_proto *pp, int *regmask)
3239{
3240 int arg, ret;
3241 int j;
3242
3243 for (arg = 0; arg < pp->argc; arg++)
3244 if (pp->arg[arg].reg == NULL)
3245 break;
3246
3247 // first see if it can be easily done
3248 for (j = i; j > 0 && arg < pp->argc; )
3249 {
3250 if (g_labels[j] != NULL)
3251 return -1;
3252 j--;
3253
3254 if (ops[j].op == OP_CALL)
3255 return -1;
3256 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP)
3257 return -1;
3258 else if (ops[j].op == OP_POP)
3259 return -1;
3260 else if (ops[j].flags & OPF_CJMP)
3261 return -1;
3262 else if (ops[j].op == OP_PUSH) {
3263 if (ops[j].flags & (OPF_FARG|OPF_FARGNR))
3264 return -1;
3265 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3266 if (ret >= 0)
3267 return -1;
3268
3269 if (pp->arg[arg].type.is_va_list)
3270 return -1;
3271
3272 // next arg
3273 for (arg++; arg < pp->argc; arg++)
3274 if (pp->arg[arg].reg == NULL)
3275 break;
3276 }
3277 }
3278
3279 if (arg < pp->argc)
3280 return -1;
3281
3282 // now do it
3283 for (arg = 0; arg < pp->argc; arg++)
3284 if (pp->arg[arg].reg == NULL)
3285 break;
3286
3287 for (j = i; j > 0 && arg < pp->argc; )
3288 {
3289 j--;
3290
3291 if (ops[j].op == OP_PUSH)
3292 {
3293 ops[j].p_argnext = -1;
3294 ferr_assert(&ops[j], pp->arg[arg].datap == NULL);
3295 pp->arg[arg].datap = &ops[j];
3296
3297 if (ops[j].operand[0].type == OPT_REG)
3298 *regmask |= 1 << ops[j].operand[0].reg;
3299
3300 ops[j].flags |= OPF_RMD | OPF_DONE | OPF_FARGNR | OPF_FARG;
3301 ops[j].flags &= ~OPF_RSAVE;
3302
3303 // next arg
3304 for (arg++; arg < pp->argc; arg++)
3305 if (pp->arg[arg].reg == NULL)
3306 break;
3307 }
3308 }
3309
3310 return 0;
3311}
3312
3313static int collect_call_args_r(struct parsed_op *po, int i,
3314 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3315 int *arg_grp, int arg, int magic, int need_op_saving, int may_reuse)
3316{
3317 struct parsed_proto *pp_tmp;
3318 struct parsed_op *po_tmp;
3319 struct label_ref *lr;
3320 int need_to_save_current;
3321 int arg_grp_current = 0;
3322 int save_args_seen = 0;
3323 int save_args;
3324 int ret = 0;
3325 int reg;
3326 char buf[32];
3327 int j, k;
3328
3329 if (i < 0) {
3330 ferr(po, "dead label encountered\n");
3331 return -1;
3332 }
3333
3334 for (; arg < pp->argc; arg++)
3335 if (pp->arg[arg].reg == NULL)
3336 break;
3337 magic = (magic & 0xffffff) | (arg << 24);
3338
3339 for (j = i; j >= 0 && (arg < pp->argc || pp->is_unresolved); )
3340 {
3341 if (((ops[j].cc_scratch ^ magic) & 0xffffff) == 0) {
3342 if (ops[j].cc_scratch != magic) {
3343 ferr(&ops[j], "arg collect hit same path with diff args for %s\n",
3344 pp->name);
3345 return -1;
3346 }
3347 // ok: have already been here
3348 return 0;
3349 }
3350 ops[j].cc_scratch = magic;
3351
3352 if (g_labels[j] != NULL && g_label_refs[j].i != -1) {
3353 lr = &g_label_refs[j];
3354 if (lr->next != NULL)
3355 need_op_saving = 1;
3356 for (; lr->next; lr = lr->next) {
3357 check_i(&ops[j], lr->i);
3358 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
3359 may_reuse = 1;
3360 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
3361 arg_grp, arg, magic, need_op_saving, may_reuse);
3362 if (ret < 0)
3363 return ret;
3364 }
3365
3366 check_i(&ops[j], lr->i);
3367 if ((ops[lr->i].flags & (OPF_JMP|OPF_CJMP)) != OPF_JMP)
3368 may_reuse = 1;
3369 if (j > 0 && LAST_OP(j - 1)) {
3370 // follow last branch in reverse
3371 j = lr->i;
3372 continue;
3373 }
3374 need_op_saving = 1;
3375 ret = collect_call_args_r(po, lr->i, pp, regmask, save_arg_vars,
3376 arg_grp, arg, magic, need_op_saving, may_reuse);
3377 if (ret < 0)
3378 return ret;
3379 }
3380 j--;
3381
3382 if (ops[j].op == OP_CALL)
3383 {
3384 if (pp->is_unresolved)
3385 break;
3386
3387 pp_tmp = ops[j].pp;
3388 if (pp_tmp == NULL)
3389 ferr(po, "arg collect hit unparsed call '%s'\n",
3390 ops[j].operand[0].name);
3391 if (may_reuse && pp_tmp->argc_stack > 0)
3392 ferr(po, "arg collect %d/%d hit '%s' with %d stack args\n",
3393 arg, pp->argc, opr_name(&ops[j], 0), pp_tmp->argc_stack);
3394 }
3395 // esp adjust of 0 means we collected it before
3396 else if (ops[j].op == OP_ADD && ops[j].operand[0].reg == xSP
3397 && (ops[j].operand[1].type != OPT_CONST
3398 || ops[j].operand[1].val != 0))
3399 {
3400 if (pp->is_unresolved)
3401 break;
3402
3403 ferr(po, "arg collect %d/%d hit esp adjust of %d\n",
3404 arg, pp->argc, ops[j].operand[1].val);
3405 }
3406 else if (ops[j].op == OP_POP && !(ops[j].flags & OPF_DONE))
3407 {
3408 if (pp->is_unresolved)
3409 break;
3410
3411 ferr(po, "arg collect %d/%d hit pop\n", arg, pp->argc);
3412 }
3413 else if (ops[j].flags & OPF_CJMP)
3414 {
3415 if (pp->is_unresolved)
3416 break;
3417
3418 may_reuse = 1;
3419 }
3420 else if (ops[j].op == OP_PUSH && !(ops[j].flags & OPF_FARGNR))
3421 {
3422 if (pp->is_unresolved && (ops[j].flags & OPF_RMD))
3423 break;
3424
3425 ops[j].p_argnext = -1;
3426 po_tmp = pp->arg[arg].datap;
3427 if (po_tmp != NULL)
3428 ops[j].p_argnext = po_tmp - ops;
3429 pp->arg[arg].datap = &ops[j];
3430
3431 need_to_save_current = 0;
3432 save_args = 0;
3433 reg = -1;
3434 if (ops[j].operand[0].type == OPT_REG)
3435 reg = ops[j].operand[0].reg;
3436
3437 if (!need_op_saving) {
3438 ret = scan_for_mod(&ops[j], j + 1, i, 1);
3439 need_to_save_current = (ret >= 0);
3440 }
3441 if (need_op_saving || need_to_save_current) {
3442 // mark this push as one that needs operand saving
3443 ops[j].flags &= ~OPF_RMD;
3444 if (ops[j].p_argnum == 0) {
3445 ops[j].p_argnum = arg + 1;
3446 save_args |= 1 << arg;
3447 }
3448 else if (ops[j].p_argnum < arg + 1) {
3449 // XXX: might kill valid var..
3450 //*save_arg_vars &= ~(1 << (ops[j].p_argnum - 1));
3451 ops[j].p_argnum = arg + 1;
3452 save_args |= 1 << arg;
3453 }
3454
3455 if (save_args_seen & (1 << (ops[j].p_argnum - 1))) {
3456 save_args_seen = 0;
3457 arg_grp_current++;
3458 if (arg_grp_current >= MAX_ARG_GRP)
3459 ferr(&ops[j], "out of arg groups (arg%d), f %s\n",
3460 ops[j].p_argnum, pp->name);
3461 }
3462 }
3463 else if (ops[j].p_argnum == 0)
3464 ops[j].flags |= OPF_RMD;
3465
3466 // some PUSHes are reused by different calls on other branches,
3467 // but that can't happen if we didn't branch, so they
3468 // can be removed from future searches (handles nested calls)
3469 if (!may_reuse)
3470 ops[j].flags |= OPF_FARGNR;
3471
3472 ops[j].flags |= OPF_FARG;
3473 ops[j].flags &= ~OPF_RSAVE;
3474
3475 // check for __VALIST
3476 if (!pp->is_unresolved && pp->arg[arg].type.is_va_list) {
3477 k = -1;
3478 ret = resolve_origin(j, &ops[j].operand[0],
3479 magic + 1, &k, NULL);
3480 if (ret == 1 && k >= 0)
3481 {
3482 if (ops[k].op == OP_LEA) {
3483 snprintf(buf, sizeof(buf), "arg_%X",
3484 g_func_pp->argc_stack * 4);
3485 if (!g_func_pp->is_vararg
3486 || strstr(ops[k].operand[1].name, buf))
3487 {
3488 ops[k].flags |= OPF_RMD | OPF_DONE;
3489 ops[j].flags |= OPF_RMD | OPF_VAPUSH;
3490 save_args &= ~(1 << arg);
3491 reg = -1;
3492 }
3493 else
3494 ferr(&ops[j], "lea va_list used, but no vararg?\n");
3495 }
3496 // check for va_list from g_func_pp arg too
3497 else if (ops[k].op == OP_MOV
3498 && is_stack_access(&ops[k], &ops[k].operand[1]))
3499 {
3500 ret = stack_frame_access(&ops[k], &ops[k].operand[1],
3501 buf, sizeof(buf), ops[k].operand[1].name, "", 1, 0);
3502 if (ret >= 0) {
3503 ops[k].flags |= OPF_RMD | OPF_DONE;
3504 ops[j].flags |= OPF_RMD;
3505 ops[j].p_argpass = ret + 1;
3506 save_args &= ~(1 << arg);
3507 reg = -1;
3508 }
3509 }
3510 }
3511 }
3512
3513 *save_arg_vars |= save_args;
3514
3515 // tracking reg usage
3516 if (reg >= 0)
3517 *regmask |= 1 << reg;
3518
3519 arg++;
3520 if (!pp->is_unresolved) {
3521 // next arg
3522 for (; arg < pp->argc; arg++)
3523 if (pp->arg[arg].reg == NULL)
3524 break;
3525 }
3526 magic = (magic & 0xffffff) | (arg << 24);
3527 }
3528
3529 if (ops[j].p_arggrp > arg_grp_current) {
3530 save_args_seen = 0;
3531 arg_grp_current = ops[j].p_arggrp;
3532 }
3533 if (ops[j].p_argnum > 0)
3534 save_args_seen |= 1 << (ops[j].p_argnum - 1);
3535 }
3536
3537 if (arg < pp->argc) {
3538 ferr(po, "arg collect failed for '%s': %d/%d\n",
3539 pp->name, arg, pp->argc);
3540 return -1;
3541 }
3542
3543 if (arg_grp_current > *arg_grp)
3544 *arg_grp = arg_grp_current;
3545
3546 return arg;
3547}
3548
3549static int collect_call_args(struct parsed_op *po, int i,
3550 struct parsed_proto *pp, int *regmask, int *save_arg_vars,
3551 int magic)
3552{
3553 // arg group is for cases when pushes for
3554 // multiple funcs are going on
3555 struct parsed_op *po_tmp;
3556 int save_arg_vars_current = 0;
3557 int arg_grp = 0;
3558 int ret;
3559 int a;
3560
3561 ret = collect_call_args_r(po, i, pp, regmask,
3562 &save_arg_vars_current, &arg_grp, 0, magic, 0, 0);
3563 if (ret < 0)
3564 return ret;
3565
3566 if (arg_grp != 0) {
3567 // propagate arg_grp
3568 for (a = 0; a < pp->argc; a++) {
3569 if (pp->arg[a].reg != NULL)
3570 continue;
3571
3572 po_tmp = pp->arg[a].datap;
3573 while (po_tmp != NULL) {
3574 po_tmp->p_arggrp = arg_grp;
3575 if (po_tmp->p_argnext > 0)
3576 po_tmp = &ops[po_tmp->p_argnext];
3577 else
3578 po_tmp = NULL;
3579 }
3580 }
3581 }
3582 save_arg_vars[arg_grp] |= save_arg_vars_current;
3583
3584 if (pp->is_unresolved) {
3585 pp->argc += ret;
3586 pp->argc_stack += ret;
3587 for (a = 0; a < pp->argc; a++)
3588 if (pp->arg[a].type.name == NULL)
3589 pp->arg[a].type.name = strdup("int");
3590 }
3591
3592 return ret;
3593}
3594
3595static void pp_insert_reg_arg(struct parsed_proto *pp, const char *reg)
3596{
3597 int i;
3598
3599 for (i = 0; i < pp->argc; i++)
3600 if (pp->arg[i].reg == NULL)
3601 break;
3602
3603 if (pp->argc_stack)
3604 memmove(&pp->arg[i + 1], &pp->arg[i],
3605 sizeof(pp->arg[0]) * pp->argc_stack);
3606 memset(&pp->arg[i], 0, sizeof(pp->arg[i]));
3607 pp->arg[i].reg = strdup(reg);
3608 pp->arg[i].type.name = strdup("int");
3609 pp->argc++;
3610 pp->argc_reg++;
3611}
3612
3613static void add_label_ref(struct label_ref *lr, int op_i)
3614{
3615 struct label_ref *lr_new;
3616
3617 if (lr->i == -1) {
3618 lr->i = op_i;
3619 return;
3620 }
3621
3622 lr_new = calloc(1, sizeof(*lr_new));
3623 lr_new->i = op_i;
3624 lr_new->next = lr->next;
3625 lr->next = lr_new;
3626}
3627
3628static struct parsed_data *try_resolve_jumptab(int i, int opcnt)
3629{
3630 struct parsed_op *po = &ops[i];
3631 struct parsed_data *pd;
3632 char label[NAMELEN], *p;
3633 int len, j, l;
3634
3635 p = strchr(po->operand[0].name, '[');
3636 if (p == NULL)
3637 return NULL;
3638
3639 len = p - po->operand[0].name;
3640 strncpy(label, po->operand[0].name, len);
3641 label[len] = 0;
3642
3643 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
3644 if (IS(g_func_pd[j].label, label)) {
3645 pd = &g_func_pd[j];
3646 break;
3647 }
3648 }
3649 if (pd == NULL)
3650 //ferr(po, "label '%s' not parsed?\n", label);
3651 return NULL;
3652
3653 if (pd->type != OPT_OFFSET)
3654 ferr(po, "label '%s' with non-offset data?\n", label);
3655
3656 // find all labels, link
3657 for (j = 0; j < pd->count; j++) {
3658 for (l = 0; l < opcnt; l++) {
3659 if (g_labels[l] != NULL && IS(g_labels[l], pd->d[j].u.label)) {
3660 add_label_ref(&g_label_refs[l], i);
3661 pd->d[j].bt_i = l;
3662 break;
3663 }
3664 }
3665 }
3666
3667 return pd;
3668}
3669
3670static void clear_labels(int count)
3671{
3672 int i;
3673
3674 for (i = 0; i < count; i++) {
3675 if (g_labels[i] != NULL) {
3676 free(g_labels[i]);
3677 g_labels[i] = NULL;
3678 }
3679 }
3680}
3681
3682static void output_std_flags(FILE *fout, struct parsed_op *po,
3683 int *pfomask, const char *dst_opr_text)
3684{
3685 if (*pfomask & (1 << PFO_Z)) {
3686 fprintf(fout, "\n cond_z = (%s%s == 0);",
3687 lmod_cast_u(po, po->operand[0].lmod), dst_opr_text);
3688 *pfomask &= ~(1 << PFO_Z);
3689 }
3690 if (*pfomask & (1 << PFO_S)) {
3691 fprintf(fout, "\n cond_s = (%s%s < 0);",
3692 lmod_cast_s(po, po->operand[0].lmod), dst_opr_text);
3693 *pfomask &= ~(1 << PFO_S);
3694 }
3695}
3696
3697static void output_pp_attrs(FILE *fout, const struct parsed_proto *pp,
3698 int is_noreturn)
3699{
3700 if (pp->is_fastcall)
3701 fprintf(fout, "__fastcall ");
3702 else if (pp->is_stdcall && pp->argc_reg == 0)
3703 fprintf(fout, "__stdcall ");
3704 if (pp->is_noreturn || is_noreturn)
3705 fprintf(fout, "noreturn ");
3706}
3707
3708static int get_pp_arg_regmask(const struct parsed_proto *pp)
3709{
3710 int regmask = 0;
3711 int i, reg;
3712
3713 for (i = 0; i < pp->argc; i++) {
3714 if (pp->arg[i].reg != NULL) {
3715 reg = char_array_i(regs_r32,
3716 ARRAY_SIZE(regs_r32), pp->arg[i].reg);
3717 if (reg < 0)
3718 ferr(ops, "arg '%s' of func '%s' is not a reg?\n",
3719 pp->arg[i].reg, pp->name);
3720 regmask |= 1 << reg;
3721 }
3722 }
3723
3724 return regmask;
3725}
3726
3727static char *saved_arg_name(char *buf, size_t buf_size, int grp, int num)
3728{
3729 char buf1[16];
3730
3731 buf1[0] = 0;
3732 if (grp > 0)
3733 snprintf(buf1, sizeof(buf1), "%d", grp);
3734 snprintf(buf, buf_size, "s%s_a%d", buf1, num);
3735
3736 return buf;
3737}
3738
3739static void gen_x_cleanup(int opcnt);
3740
3741static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
3742{
3743 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
3744 struct parsed_opr *last_arith_dst = NULL;
3745 char buf1[256], buf2[256], buf3[256], cast[64];
3746 const struct parsed_proto *pp_c;
3747 struct parsed_proto *pp, *pp_tmp;
3748 struct parsed_data *pd;
3749 const char *tmpname;
3750 unsigned int uval;
3751 int save_arg_vars[MAX_ARG_GRP] = { 0, };
3752 int cond_vars = 0;
3753 int need_tmp_var = 0;
3754 int need_tmp64 = 0;
3755 int had_decl = 0;
3756 int label_pending = 0;
3757 int regmask_save = 0;
3758 int regmask_arg = 0;
3759 int regmask_now = 0;
3760 int regmask_init = 0;
3761 int regmask = 0;
3762 int pfomask = 0;
3763 int found = 0;
3764 int depth = 0;
3765 int no_output;
3766 int i, j, l;
3767 int arg;
3768 int reg;
3769 int ret;
3770
3771 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
3772 g_stack_frame_used = 0;
3773
3774 g_func_pp = proto_parse(fhdr, funcn, 0);
3775 if (g_func_pp == NULL)
3776 ferr(ops, "proto_parse failed for '%s'\n", funcn);
3777
3778 regmask_arg = get_pp_arg_regmask(g_func_pp);
3779
3780 // pass1:
3781 // - handle ebp/esp frame, remove ops related to it
3782 scan_prologue_epilogue(opcnt);
3783
3784 // pass2:
3785 // - parse calls with labels
3786 // - resolve all branches
3787 for (i = 0; i < opcnt; i++)
3788 {
3789 po = &ops[i];
3790 po->bt_i = -1;
3791 po->btj = NULL;
3792
3793 if (po->flags & (OPF_RMD|OPF_DONE))
3794 continue;
3795
3796 if (po->op == OP_CALL) {
3797 pp = NULL;
3798
3799 if (po->operand[0].type == OPT_LABEL) {
3800 tmpname = opr_name(po, 0);
3801 if (IS_START(tmpname, "loc_"))
3802 ferr(po, "call to loc_*\n");
3803 pp_c = proto_parse(fhdr, tmpname, 0);
3804 if (pp_c == NULL)
3805 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
3806
3807 pp = proto_clone(pp_c);
3808 my_assert_not(pp, NULL);
3809 }
3810 else if (po->datap != NULL) {
3811 pp = calloc(1, sizeof(*pp));
3812 my_assert_not(pp, NULL);
3813
3814 ret = parse_protostr(po->datap, pp);
3815 if (ret < 0)
3816 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
3817 free(po->datap);
3818 po->datap = NULL;
3819 }
3820
3821 if (pp != NULL) {
3822 if (pp->is_fptr)
3823 check_func_pp(po, pp, "fptr var call");
3824 if (pp->is_noreturn)
3825 po->flags |= OPF_TAIL;
3826 }
3827 po->pp = pp;
3828 continue;
3829 }
3830
3831 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
3832 continue;
3833
3834 if (po->operand[0].type == OPT_REGMEM) {
3835 pd = try_resolve_jumptab(i, opcnt);
3836 if (pd == NULL)
3837 goto tailcall;
3838
3839 po->btj = pd;
3840 continue;
3841 }
3842
3843 for (l = 0; l < opcnt; l++) {
3844 if (g_labels[l] != NULL
3845 && IS(po->operand[0].name, g_labels[l]))
3846 {
3847 if (l == i + 1 && po->op == OP_JMP) {
3848 // yet another alignment type..
3849 po->flags |= OPF_RMD|OPF_DONE;
3850 break;
3851 }
3852 add_label_ref(&g_label_refs[l], i);
3853 po->bt_i = l;
3854 break;
3855 }
3856 }
3857
3858 if (po->bt_i != -1 || (po->flags & OPF_RMD))
3859 continue;
3860
3861 if (po->operand[0].type == OPT_LABEL)
3862 // assume tail call
3863 goto tailcall;
3864
3865 ferr(po, "unhandled branch\n");
3866
3867tailcall:
3868 po->op = OP_CALL;
3869 po->flags |= OPF_TAIL;
3870 if (i > 0 && ops[i - 1].op == OP_POP)
3871 po->flags |= OPF_ATAIL;
3872 i--; // reprocess
3873 }
3874
3875 // pass3:
3876 // - remove dead labels
3877 // - process trivial calls
3878 for (i = 0; i < opcnt; i++)
3879 {
3880 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
3881 free(g_labels[i]);
3882 g_labels[i] = NULL;
3883 }
3884
3885 po = &ops[i];
3886 if (po->flags & (OPF_RMD|OPF_DONE))
3887 continue;
3888
3889 if (po->op == OP_CALL)
3890 {
3891 pp = process_call_early(i, opcnt, &j);
3892 if (pp != NULL) {
3893 if (!(po->flags & OPF_ATAIL))
3894 // since we know the args, try to collect them
3895 if (collect_call_args_early(po, i, pp, &regmask) != 0)
3896 pp = NULL;
3897 }
3898
3899 if (pp != NULL) {
3900 if (j >= 0) {
3901 // commit esp adjust
3902 ops[j].flags |= OPF_RMD;
3903 if (ops[j].op != OP_POP)
3904 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
3905 else
3906 ops[j].flags |= OPF_DONE;
3907 }
3908
3909 if (strstr(pp->ret_type.name, "int64"))
3910 need_tmp64 = 1;
3911
3912 po->flags |= OPF_DONE;
3913 }
3914 }
3915 }
3916
3917 // pass4:
3918 // - process calls
3919 for (i = 0; i < opcnt; i++)
3920 {
3921 po = &ops[i];
3922 if (po->flags & (OPF_RMD|OPF_DONE))
3923 continue;
3924
3925 if (po->op == OP_CALL && !(po->flags & OPF_DONE))
3926 {
3927 pp = process_call(i, opcnt);
3928
3929 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
3930 // since we know the args, collect them
3931 collect_call_args(po, i, pp, &regmask, save_arg_vars,
3932 i + opcnt * 2);
3933 }
3934
3935 if (strstr(pp->ret_type.name, "int64"))
3936 need_tmp64 = 1;
3937 }
3938 }
3939
3940 // pass5:
3941 // - find POPs for PUSHes, rm both
3942 // - scan for STD/CLD, propagate DF
3943 // - scan for all used registers
3944 // - find flag set ops for their users
3945 // - do unreselved calls
3946 // - declare indirect functions
3947 for (i = 0; i < opcnt; i++)
3948 {
3949 po = &ops[i];
3950 if (po->flags & (OPF_RMD|OPF_DONE))
3951 continue;
3952
3953 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE)) {
3954 reg = po->operand[0].reg;
3955 if (!(regmask & (1 << reg)))
3956 // not a reg save after all, rerun scan_for_pop
3957 po->flags &= ~OPF_RSAVE;
3958 else
3959 regmask_save |= 1 << reg;
3960 }
3961
3962 if (po->op == OP_PUSH && !(po->flags & OPF_FARG)
3963 && !(po->flags & OPF_RSAVE) && !g_func_pp->is_userstack)
3964 {
3965 if (po->operand[0].type == OPT_REG)
3966 {
3967 reg = po->operand[0].reg;
3968 if (reg < 0)
3969 ferr(po, "reg not set for push?\n");
3970
3971 depth = 0;
3972 ret = scan_for_pop(i + 1, opcnt,
3973 po->operand[0].name, i + opcnt * 3, 0, &depth, 0);
3974 if (ret == 1) {
3975 if (depth > 1)
3976 ferr(po, "too much depth: %d\n", depth);
3977
3978 po->flags |= OPF_RMD;
3979 scan_for_pop(i + 1, opcnt, po->operand[0].name,
3980 i + opcnt * 4, 0, &depth, 1);
3981 continue;
3982 }
3983 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
3984 if (ret == 0) {
3985 arg = OPF_RMD;
3986 if (regmask & (1 << reg)) {
3987 if (regmask_save & (1 << reg))
3988 ferr(po, "%s already saved?\n", po->operand[0].name);
3989 arg = OPF_RSAVE;
3990 }
3991 po->flags |= arg;
3992 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
3993 continue;
3994 }
3995 }
3996 else if (po->operand[0].type == OPT_CONST) {
3997 scan_for_pop_const(i, opcnt);
3998 }
3999 }
4000
4001 if (po->op == OP_STD) {
4002 po->flags |= OPF_DF | OPF_RMD | OPF_DONE;
4003 scan_propagate_df(i + 1, opcnt);
4004 }
4005
4006 regmask_now = po->regmask_src | po->regmask_dst;
4007 if (regmask_now & (1 << xBP)) {
4008 if (g_bp_frame && !(po->flags & OPF_EBP_S)) {
4009 if (po->regmask_dst & (1 << xBP))
4010 // compiler decided to drop bp frame and use ebp as scratch
4011 scan_fwd_set_flags(i + 1, opcnt, i + opcnt * 5, OPF_EBP_S);
4012 else
4013 regmask_now &= ~(1 << xBP);
4014 }
4015 }
4016
4017 regmask |= regmask_now;
4018
4019 if (po->flags & OPF_CC)
4020 {
4021 int setters[16], cnt = 0, branched = 0;
4022
4023 ret = scan_for_flag_set(i, i + opcnt * 6,
4024 &branched, setters, &cnt);
4025 if (ret < 0 || cnt <= 0)
4026 ferr(po, "unable to trace flag setter(s)\n");
4027 if (cnt > ARRAY_SIZE(setters))
4028 ferr(po, "too many flag setters\n");
4029
4030 for (j = 0; j < cnt; j++)
4031 {
4032 tmp_op = &ops[setters[j]]; // flag setter
4033 pfomask = 0;
4034
4035 // to get nicer code, we try to delay test and cmp;
4036 // if we can't because of operand modification, or if we
4037 // have arith op, or branch, make it calculate flags explicitly
4038 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP)
4039 {
4040 if (branched || scan_for_mod(tmp_op, setters[j] + 1, i, 0) >= 0)
4041 pfomask = 1 << po->pfo;
4042 }
4043 else if (tmp_op->op == OP_CMPS || tmp_op->op == OP_SCAS) {
4044 pfomask = 1 << po->pfo;
4045 }
4046 else {
4047 // see if we'll be able to handle based on op result
4048 if ((tmp_op->op != OP_AND && tmp_op->op != OP_OR
4049 && po->pfo != PFO_Z && po->pfo != PFO_S
4050 && po->pfo != PFO_P)
4051 || branched
4052 || scan_for_mod_opr0(tmp_op, setters[j] + 1, i) >= 0)
4053 {
4054 pfomask = 1 << po->pfo;
4055 }
4056
4057 if (tmp_op->op == OP_ADD && po->pfo == PFO_C) {
4058 propagate_lmod(tmp_op, &tmp_op->operand[0],
4059 &tmp_op->operand[1]);
4060 if (tmp_op->operand[0].lmod == OPLM_DWORD)
4061 need_tmp64 = 1;
4062 }
4063 }
4064 if (pfomask) {
4065 tmp_op->pfomask |= pfomask;
4066 cond_vars |= pfomask;
4067 }
4068 // note: may overwrite, currently not a problem
4069 po->datap = tmp_op;
4070 }
4071
4072 if (po->op == OP_RCL || po->op == OP_RCR
4073 || po->op == OP_ADC || po->op == OP_SBB)
4074 cond_vars |= 1 << PFO_C;
4075 }
4076
4077 if (po->op == OP_CMPS || po->op == OP_SCAS) {
4078 cond_vars |= 1 << PFO_Z;
4079 }
4080 else if (po->op == OP_MUL
4081 || (po->op == OP_IMUL && po->operand_cnt == 1))
4082 {
4083 if (po->operand[0].lmod == OPLM_DWORD)
4084 need_tmp64 = 1;
4085 }
4086 else if (po->op == OP_CALL) {
4087 // note: resolved non-reg calls are OPF_DONE already
4088 pp = po->pp;
4089 if (pp == NULL)
4090 ferr(po, "NULL pp\n");
4091
4092 if (pp->is_unresolved) {
4093 int regmask_stack = 0;
4094 collect_call_args(po, i, pp, &regmask, save_arg_vars,
4095 i + opcnt * 2);
4096
4097 // this is pretty rough guess:
4098 // see ecx and edx were pushed (and not their saved versions)
4099 for (arg = 0; arg < pp->argc; arg++) {
4100 if (pp->arg[arg].reg != NULL)
4101 continue;
4102
4103 tmp_op = pp->arg[arg].datap;
4104 if (tmp_op == NULL)
4105 ferr(po, "parsed_op missing for arg%d\n", arg);
4106 if (tmp_op->p_argnum == 0 && tmp_op->operand[0].type == OPT_REG)
4107 regmask_stack |= 1 << tmp_op->operand[0].reg;
4108 }
4109
4110 if (!((regmask_stack & (1 << xCX))
4111 && (regmask_stack & (1 << xDX))))
4112 {
4113 if (pp->argc_stack != 0
4114 || ((regmask | regmask_arg) & ((1 << xCX)|(1 << xDX))))
4115 {
4116 pp_insert_reg_arg(pp, "ecx");
4117 pp->is_fastcall = 1;
4118 regmask_init |= 1 << xCX;
4119 regmask |= 1 << xCX;
4120 }
4121 if (pp->argc_stack != 0
4122 || ((regmask | regmask_arg) & (1 << xDX)))
4123 {
4124 pp_insert_reg_arg(pp, "edx");
4125 regmask_init |= 1 << xDX;
4126 regmask |= 1 << xDX;
4127 }
4128 }
4129
4130 // note: __cdecl doesn't fall into is_unresolved category
4131 if (pp->argc_stack > 0)
4132 pp->is_stdcall = 1;
4133 }
4134
4135 for (arg = 0; arg < pp->argc; arg++) {
4136 if (pp->arg[arg].reg != NULL) {
4137 reg = char_array_i(regs_r32,
4138 ARRAY_SIZE(regs_r32), pp->arg[arg].reg);
4139 if (reg < 0)
4140 ferr(ops, "arg '%s' is not a reg?\n", pp->arg[arg].reg);
4141 if (!(regmask & (1 << reg))) {
4142 regmask_init |= 1 << reg;
4143 regmask |= 1 << reg;
4144 }
4145 }
4146 }
4147 }
4148 else if (po->op == OP_MOV && po->operand[0].pp != NULL
4149 && po->operand[1].pp != NULL)
4150 {
4151 // <var> = offset <something>
4152 if ((po->operand[1].pp->is_func || po->operand[1].pp->is_fptr)
4153 && !IS_START(po->operand[1].name, "off_"))
4154 {
4155 if (!po->operand[0].pp->is_fptr)
4156 ferr(po, "%s not declared as fptr when it should be\n",
4157 po->operand[0].name);
4158 if (pp_cmp_func(po->operand[0].pp, po->operand[1].pp)) {
4159 pp_print(buf1, sizeof(buf1), po->operand[0].pp);
4160 pp_print(buf2, sizeof(buf2), po->operand[1].pp);
4161 fnote(po, "var: %s\n", buf1);
4162 fnote(po, "func: %s\n", buf2);
4163 ferr(po, "^ mismatch\n");
4164 }
4165 }
4166 }
4167 else if (po->op == OP_RET && !IS(g_func_pp->ret_type.name, "void"))
4168 regmask |= 1 << xAX;
4169 else if (po->op == OP_DIV || po->op == OP_IDIV) {
4170 // 32bit division is common, look for it
4171 if (po->op == OP_DIV)
4172 ret = scan_for_reg_clear(i, xDX);
4173 else
4174 ret = scan_for_cdq_edx(i);
4175 if (ret >= 0)
4176 po->flags |= OPF_32BIT;
4177 else
4178 need_tmp64 = 1;
4179 }
4180 else if (po->op == OP_CLD)
4181 po->flags |= OPF_RMD | OPF_DONE;
4182
4183 if (po->op == OP_RCL || po->op == OP_RCR || po->op == OP_XCHG) {
4184 need_tmp_var = 1;
4185 }
4186 }
4187
4188 // pass6:
4189 // - confirm regmask_save, it might have been reduced
4190 if (regmask_save != 0)
4191 {
4192 regmask_save = 0;
4193 for (i = 0; i < opcnt; i++) {
4194 po = &ops[i];
4195 if (po->flags & OPF_RMD)
4196 continue;
4197
4198 if (po->op == OP_PUSH && (po->flags & OPF_RSAVE))
4199 regmask_save |= 1 << po->operand[0].reg;
4200 }
4201 }
4202
4203 // output starts here
4204
4205 // define userstack size
4206 if (g_func_pp->is_userstack) {
4207 fprintf(fout, "#ifndef US_SZ_%s\n", g_func_pp->name);
4208 fprintf(fout, "#define US_SZ_%s USERSTACK_SIZE\n", g_func_pp->name);
4209 fprintf(fout, "#endif\n");
4210 }
4211
4212 // the function itself
4213 fprintf(fout, "%s ", g_func_pp->ret_type.name);
4214 output_pp_attrs(fout, g_func_pp, g_ida_func_attr & IDAFA_NORETURN);
4215 fprintf(fout, "%s(", g_func_pp->name);
4216
4217 for (i = 0; i < g_func_pp->argc; i++) {
4218 if (i > 0)
4219 fprintf(fout, ", ");
4220 if (g_func_pp->arg[i].fptr != NULL) {
4221 // func pointer..
4222 pp = g_func_pp->arg[i].fptr;
4223 fprintf(fout, "%s (", pp->ret_type.name);
4224 output_pp_attrs(fout, pp, 0);
4225 fprintf(fout, "*a%d)(", i + 1);
4226 for (j = 0; j < pp->argc; j++) {
4227 if (j > 0)
4228 fprintf(fout, ", ");
4229 if (pp->arg[j].fptr)
4230 ferr(ops, "nested fptr\n");
4231 fprintf(fout, "%s", pp->arg[j].type.name);
4232 }
4233 if (pp->is_vararg) {
4234 if (j > 0)
4235 fprintf(fout, ", ");
4236 fprintf(fout, "...");
4237 }
4238 fprintf(fout, ")");
4239 }
4240 else if (g_func_pp->arg[i].type.is_retreg) {
4241 fprintf(fout, "u32 *r_%s", g_func_pp->arg[i].reg);
4242 }
4243 else {
4244 fprintf(fout, "%s a%d", g_func_pp->arg[i].type.name, i + 1);
4245 }
4246 }
4247 if (g_func_pp->is_vararg) {
4248 if (i > 0)
4249 fprintf(fout, ", ");
4250 fprintf(fout, "...");
4251 }
4252
4253 fprintf(fout, ")\n{\n");
4254
4255 // declare indirect functions
4256 for (i = 0; i < opcnt; i++) {
4257 po = &ops[i];
4258 if (po->flags & OPF_RMD)
4259 continue;
4260
4261 if (po->op == OP_CALL) {
4262 pp = po->pp;
4263 if (pp == NULL)
4264 ferr(po, "NULL pp\n");
4265
4266 if (pp->is_fptr && !(pp->name[0] != 0 && pp->is_arg)) {
4267 if (pp->name[0] != 0) {
4268 memmove(pp->name + 2, pp->name, strlen(pp->name) + 1);
4269 memcpy(pp->name, "i_", 2);
4270
4271 // might be declared already
4272 found = 0;
4273 for (j = 0; j < i; j++) {
4274 if (ops[j].op == OP_CALL && (pp_tmp = ops[j].pp)) {
4275 if (pp_tmp->is_fptr && IS(pp->name, pp_tmp->name)) {
4276 found = 1;
4277 break;
4278 }
4279 }
4280 }
4281 if (found)
4282 continue;
4283 }
4284 else
4285 snprintf(pp->name, sizeof(pp->name), "icall%d", i);
4286
4287 fprintf(fout, " %s (", pp->ret_type.name);
4288 output_pp_attrs(fout, pp, 0);
4289 fprintf(fout, "*%s)(", pp->name);
4290 for (j = 0; j < pp->argc; j++) {
4291 if (j > 0)
4292 fprintf(fout, ", ");
4293 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
4294 }
4295 fprintf(fout, ");\n");
4296 }
4297 }
4298 }
4299
4300 // output LUTs/jumptables
4301 for (i = 0; i < g_func_pd_cnt; i++) {
4302 pd = &g_func_pd[i];
4303 fprintf(fout, " static const ");
4304 if (pd->type == OPT_OFFSET) {
4305 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
4306
4307 for (j = 0; j < pd->count; j++) {
4308 if (j > 0)
4309 fprintf(fout, ", ");
4310 fprintf(fout, "&&%s", pd->d[j].u.label);
4311 }
4312 }
4313 else {
4314 fprintf(fout, "%s %s[] =\n { ",
4315 lmod_type_u(ops, pd->lmod), pd->label);
4316
4317 for (j = 0; j < pd->count; j++) {
4318 if (j > 0)
4319 fprintf(fout, ", ");
4320 fprintf(fout, "%u", pd->d[j].u.val);
4321 }
4322 }
4323 fprintf(fout, " };\n");
4324 had_decl = 1;
4325 }
4326
4327 // declare stack frame, va_arg
4328 if (g_stack_fsz) {
4329 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
4330 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
4331 had_decl = 1;
4332 }
4333
4334 if (g_func_pp->is_userstack) {
4335 fprintf(fout, " u32 fake_sf[US_SZ_%s / 4];\n", g_func_pp->name);
4336 fprintf(fout, " u32 *esp = &fake_sf[sizeof(fake_sf) / 4];\n");
4337 had_decl = 1;
4338 }
4339
4340 if (g_func_pp->is_vararg) {
4341 fprintf(fout, " va_list ap;\n");
4342 had_decl = 1;
4343 }
4344
4345 // declare arg-registers
4346 for (i = 0; i < g_func_pp->argc; i++) {
4347 if (g_func_pp->arg[i].reg != NULL) {
4348 reg = char_array_i(regs_r32,
4349 ARRAY_SIZE(regs_r32), g_func_pp->arg[i].reg);
4350 if (regmask & (1 << reg)) {
4351 if (g_func_pp->arg[i].type.is_retreg)
4352 fprintf(fout, " u32 %s = *r_%s;\n",
4353 g_func_pp->arg[i].reg, g_func_pp->arg[i].reg);
4354 else
4355 fprintf(fout, " u32 %s = (u32)a%d;\n",
4356 g_func_pp->arg[i].reg, i + 1);
4357 }
4358 else {
4359 if (g_func_pp->arg[i].type.is_retreg)
4360 ferr(ops, "retreg '%s' is unused?\n",
4361 g_func_pp->arg[i].reg);
4362 fprintf(fout, " // %s = a%d; // unused\n",
4363 g_func_pp->arg[i].reg, i + 1);
4364 }
4365 had_decl = 1;
4366 }
4367 }
4368
4369 regmask_now = regmask & ~regmask_arg;
4370 regmask_now &= ~(1 << xSP);
4371 if (regmask_now & 0x00ff) {
4372 for (reg = 0; reg < 8; reg++) {
4373 if (regmask_now & (1 << reg)) {
4374 fprintf(fout, " u32 %s", regs_r32[reg]);
4375 if (regmask_init & (1 << reg))
4376 fprintf(fout, " = 0");
4377 fprintf(fout, ";\n");
4378 had_decl = 1;
4379 }
4380 }
4381 }
4382 if (regmask_now & 0xff00) {
4383 for (reg = 8; reg < 16; reg++) {
4384 if (regmask_now & (1 << reg)) {
4385 fprintf(fout, " mmxr %s", regs_r32[reg]);
4386 if (regmask_init & (1 << reg))
4387 fprintf(fout, " = { 0, }");
4388 fprintf(fout, ";\n");
4389 had_decl = 1;
4390 }
4391 }
4392 }
4393
4394 if (regmask_save) {
4395 for (reg = 0; reg < 8; reg++) {
4396 if (regmask_save & (1 << reg)) {
4397 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
4398 had_decl = 1;
4399 }
4400 }
4401 }
4402
4403 for (i = 0; i < ARRAY_SIZE(save_arg_vars); i++) {
4404 if (save_arg_vars[i] == 0)
4405 continue;
4406 for (reg = 0; reg < 32; reg++) {
4407 if (save_arg_vars[i] & (1 << reg)) {
4408 fprintf(fout, " u32 %s;\n",
4409 saved_arg_name(buf1, sizeof(buf1), i, reg + 1));
4410 had_decl = 1;
4411 }
4412 }
4413 }
4414
4415 if (cond_vars) {
4416 for (i = 0; i < 8; i++) {
4417 if (cond_vars & (1 << i)) {
4418 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
4419 had_decl = 1;
4420 }
4421 }
4422 }
4423
4424 if (need_tmp_var) {
4425 fprintf(fout, " u32 tmp;\n");
4426 had_decl = 1;
4427 }
4428
4429 if (need_tmp64) {
4430 fprintf(fout, " u64 tmp64;\n");
4431 had_decl = 1;
4432 }
4433
4434 if (had_decl)
4435 fprintf(fout, "\n");
4436
4437 if (g_func_pp->is_vararg) {
4438 if (g_func_pp->argc_stack == 0)
4439 ferr(ops, "vararg func without stack args?\n");
4440 fprintf(fout, " va_start(ap, a%d);\n", g_func_pp->argc);
4441 }
4442
4443 // output ops
4444 for (i = 0; i < opcnt; i++)
4445 {
4446 if (g_labels[i] != NULL) {
4447 fprintf(fout, "\n%s:\n", g_labels[i]);
4448 label_pending = 1;
4449
4450 delayed_flag_op = NULL;
4451 last_arith_dst = NULL;
4452 }
4453
4454 po = &ops[i];
4455 if (po->flags & OPF_RMD)
4456 continue;
4457
4458 no_output = 0;
4459
4460 #define assert_operand_cnt(n_) \
4461 if (po->operand_cnt != n_) \
4462 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
4463
4464 // conditional/flag using op?
4465 if (po->flags & OPF_CC)
4466 {
4467 int is_delayed = 0;
4468
4469 tmp_op = po->datap;
4470
4471 // we go through all this trouble to avoid using parsed_flag_op,
4472 // which makes generated code much nicer
4473 if (delayed_flag_op != NULL)
4474 {
4475 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op,
4476 po->pfo, po->pfo_inv);
4477 is_delayed = 1;
4478 }
4479 else if (last_arith_dst != NULL
4480 && (po->pfo == PFO_Z || po->pfo == PFO_S || po->pfo == PFO_P
4481 || (tmp_op && (tmp_op->op == OP_AND || tmp_op->op == OP_OR))
4482 ))
4483 {
4484 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4485 out_test_for_cc(buf1, sizeof(buf1), po, po->pfo, po->pfo_inv,
4486 last_arith_dst->lmod, buf3);
4487 is_delayed = 1;
4488 }
4489 else if (tmp_op != NULL) {
4490 // use preprocessed flag calc results
4491 if (!(tmp_op->pfomask & (1 << po->pfo)))
4492 ferr(po, "not prepared for pfo %d\n", po->pfo);
4493
4494 // note: pfo_inv was not yet applied
4495 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
4496 po->pfo_inv ? "!" : "", parsed_flag_op_names[po->pfo]);
4497 }
4498 else {
4499 ferr(po, "all methods of finding comparison failed\n");
4500 }
4501
4502 if (po->flags & OPF_JMP) {
4503 fprintf(fout, " if %s", buf1);
4504 }
4505 else if (po->op == OP_RCL || po->op == OP_RCR
4506 || po->op == OP_ADC || po->op == OP_SBB)
4507 {
4508 if (is_delayed)
4509 fprintf(fout, " cond_%s = %s;\n",
4510 parsed_flag_op_names[po->pfo], buf1);
4511 }
4512 else if (po->flags & OPF_DATA) { // SETcc
4513 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
4514 fprintf(fout, " %s = %s;", buf2, buf1);
4515 }
4516 else {
4517 ferr(po, "unhandled conditional op\n");
4518 }
4519 }
4520
4521 pfomask = po->pfomask;
4522
4523 if (po->flags & (OPF_REPZ|OPF_REPNZ)) {
4524 struct parsed_opr opr = {0,};
4525 opr.type = OPT_REG;
4526 opr.reg = xCX;
4527 opr.lmod = OPLM_DWORD;
4528 ret = try_resolve_const(i, &opr, opcnt * 7 + i, &uval);
4529
4530 if (ret != 1 || uval == 0) {
4531 // we need initial flags for ecx=0 case..
4532 if (i > 0 && ops[i - 1].op == OP_XOR
4533 && IS(ops[i - 1].operand[0].name,
4534 ops[i - 1].operand[1].name))
4535 {
4536 fprintf(fout, " cond_z = ");
4537 if (pfomask & (1 << PFO_C))
4538 fprintf(fout, "cond_c = ");
4539 fprintf(fout, "0;\n");
4540 }
4541 else if (last_arith_dst != NULL) {
4542 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
4543 out_test_for_cc(buf1, sizeof(buf1), po, PFO_Z, 0,
4544 last_arith_dst->lmod, buf3);
4545 fprintf(fout, " cond_z = %s;\n", buf1);
4546 }
4547 else
4548 ferr(po, "missing initial ZF\n");
4549 }
4550 }
4551
4552 switch (po->op)
4553 {
4554 case OP_MOV:
4555 assert_operand_cnt(2);
4556 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4557 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4558 default_cast_to(buf3, sizeof(buf3), &po->operand[0]);
4559 fprintf(fout, " %s = %s;", buf1,
4560 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4561 buf3, 0));
4562 break;
4563
4564 case OP_LEA:
4565 assert_operand_cnt(2);
4566 po->operand[1].lmod = OPLM_DWORD; // always
4567 fprintf(fout, " %s = %s;",
4568 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4569 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4570 NULL, 1));
4571 break;
4572
4573 case OP_MOVZX:
4574 assert_operand_cnt(2);
4575 fprintf(fout, " %s = %s;",
4576 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4577 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4578 break;
4579
4580 case OP_MOVSX:
4581 assert_operand_cnt(2);
4582 switch (po->operand[1].lmod) {
4583 case OPLM_BYTE:
4584 strcpy(buf3, "(s8)");
4585 break;
4586 case OPLM_WORD:
4587 strcpy(buf3, "(s16)");
4588 break;
4589 default:
4590 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
4591 }
4592 fprintf(fout, " %s = %s;",
4593 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4594 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4595 buf3, 0));
4596 break;
4597
4598 case OP_XCHG:
4599 assert_operand_cnt(2);
4600 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4601 fprintf(fout, " tmp = %s;",
4602 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0], "", 0));
4603 fprintf(fout, " %s = %s;",
4604 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4605 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
4606 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
4607 fprintf(fout, " %s = %stmp;",
4608 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[1]),
4609 default_cast_to(buf3, sizeof(buf3), &po->operand[1]));
4610 snprintf(g_comment, sizeof(g_comment), "xchg");
4611 break;
4612
4613 case OP_NOT:
4614 assert_operand_cnt(1);
4615 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4616 fprintf(fout, " %s = ~%s;", buf1, buf1);
4617 break;
4618
4619 case OP_CDQ:
4620 assert_operand_cnt(2);
4621 fprintf(fout, " %s = (s32)%s >> 31;",
4622 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4623 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4624 strcpy(g_comment, "cdq");
4625 break;
4626
4627 case OP_LODS:
4628 assert_operand_cnt(3);
4629 if (po->flags & OPF_REP) {
4630 // hmh..
4631 ferr(po, "TODO\n");
4632 }
4633 else {
4634 fprintf(fout, " eax = %sesi; esi %c= %d;",
4635 lmod_cast_u_ptr(po, po->operand[0].lmod),
4636 (po->flags & OPF_DF) ? '-' : '+',
4637 lmod_bytes(po, po->operand[0].lmod));
4638 strcpy(g_comment, "lods");
4639 }
4640 break;
4641
4642 case OP_STOS:
4643 assert_operand_cnt(3);
4644 if (po->flags & OPF_REP) {
4645 fprintf(fout, " for (; ecx != 0; ecx--, edi %c= %d)\n",
4646 (po->flags & OPF_DF) ? '-' : '+',
4647 lmod_bytes(po, po->operand[0].lmod));
4648 fprintf(fout, " %sedi = eax;",
4649 lmod_cast_u_ptr(po, po->operand[0].lmod));
4650 strcpy(g_comment, "rep stos");
4651 }
4652 else {
4653 fprintf(fout, " %sedi = eax; edi %c= %d;",
4654 lmod_cast_u_ptr(po, po->operand[0].lmod),
4655 (po->flags & OPF_DF) ? '-' : '+',
4656 lmod_bytes(po, po->operand[0].lmod));
4657 strcpy(g_comment, "stos");
4658 }
4659 break;
4660
4661 case OP_MOVS:
4662 assert_operand_cnt(3);
4663 j = lmod_bytes(po, po->operand[0].lmod);
4664 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4665 l = (po->flags & OPF_DF) ? '-' : '+';
4666 if (po->flags & OPF_REP) {
4667 fprintf(fout,
4668 " for (; ecx != 0; ecx--, edi %c= %d, esi %c= %d)\n",
4669 l, j, l, j);
4670 fprintf(fout,
4671 " %sedi = %sesi;", buf1, buf1);
4672 strcpy(g_comment, "rep movs");
4673 }
4674 else {
4675 fprintf(fout, " %sedi = %sesi; edi %c= %d; esi %c= %d;",
4676 buf1, buf1, l, j, l, j);
4677 strcpy(g_comment, "movs");
4678 }
4679 break;
4680
4681 case OP_CMPS:
4682 // repe ~ repeat while ZF=1
4683 assert_operand_cnt(3);
4684 j = lmod_bytes(po, po->operand[0].lmod);
4685 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
4686 l = (po->flags & OPF_DF) ? '-' : '+';
4687 if (po->flags & OPF_REP) {
4688 fprintf(fout,
4689 " for (; ecx != 0; ecx--) {\n");
4690 if (pfomask & (1 << PFO_C)) {
4691 // ugh..
4692 fprintf(fout,
4693 " cond_c = %sesi < %sedi;\n", buf1, buf1);
4694 pfomask &= ~(1 << PFO_C);
4695 }
4696 fprintf(fout,
4697 " cond_z = (%sesi == %sedi); esi %c= %d, edi %c= %d;\n",
4698 buf1, buf1, l, j, l, j);
4699 fprintf(fout,
4700 " if (cond_z %s 0) break;\n",
4701 (po->flags & OPF_REPZ) ? "==" : "!=");
4702 fprintf(fout,
4703 " }");
4704 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
4705 (po->flags & OPF_REPZ) ? "e" : "ne");
4706 }
4707 else {
4708 fprintf(fout,
4709 " cond_z = (%sesi == %sedi); esi %c= %d; edi %c= %d;",
4710 buf1, buf1, l, j, l, j);
4711 strcpy(g_comment, "cmps");
4712 }
4713 pfomask &= ~(1 << PFO_Z);
4714 last_arith_dst = NULL;
4715 delayed_flag_op = NULL;
4716 break;
4717
4718 case OP_SCAS:
4719 // only does ZF (for now)
4720 // repe ~ repeat while ZF=1
4721 assert_operand_cnt(3);
4722 j = lmod_bytes(po, po->operand[0].lmod);
4723 l = (po->flags & OPF_DF) ? '-' : '+';
4724 if (po->flags & OPF_REP) {
4725 fprintf(fout,
4726 " for (; ecx != 0; ecx--) {\n");
4727 fprintf(fout,
4728 " cond_z = (%seax == %sedi); edi %c= %d;\n",
4729 lmod_cast_u(po, po->operand[0].lmod),
4730 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4731 fprintf(fout,
4732 " if (cond_z %s 0) break;\n",
4733 (po->flags & OPF_REPZ) ? "==" : "!=");
4734 fprintf(fout,
4735 " }");
4736 snprintf(g_comment, sizeof(g_comment), "rep%s scas",
4737 (po->flags & OPF_REPZ) ? "e" : "ne");
4738 }
4739 else {
4740 fprintf(fout, " cond_z = (%seax == %sedi); edi %c= %d;",
4741 lmod_cast_u(po, po->operand[0].lmod),
4742 lmod_cast_u_ptr(po, po->operand[0].lmod), l, j);
4743 strcpy(g_comment, "scas");
4744 }
4745 pfomask &= ~(1 << PFO_Z);
4746 last_arith_dst = NULL;
4747 delayed_flag_op = NULL;
4748 break;
4749
4750 // arithmetic w/flags
4751 case OP_AND:
4752 case OP_OR:
4753 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4754 // fallthrough
4755 dualop_arith:
4756 assert_operand_cnt(2);
4757 fprintf(fout, " %s %s= %s;",
4758 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4759 op_to_c(po),
4760 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4761 output_std_flags(fout, po, &pfomask, buf1);
4762 last_arith_dst = &po->operand[0];
4763 delayed_flag_op = NULL;
4764 break;
4765
4766 case OP_SHL:
4767 case OP_SHR:
4768 assert_operand_cnt(2);
4769 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4770 if (pfomask & (1 << PFO_C)) {
4771 if (po->operand[1].type == OPT_CONST) {
4772 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4773 j = po->operand[1].val;
4774 j %= l;
4775 if (j != 0) {
4776 if (po->op == OP_SHL)
4777 j = l - j;
4778 else
4779 j -= 1;
4780 fprintf(fout, " cond_c = (%s >> %d) & 1;\n",
4781 buf1, j);
4782 }
4783 else
4784 ferr(po, "zero shift?\n");
4785 }
4786 else
4787 ferr(po, "TODO\n");
4788 pfomask &= ~(1 << PFO_C);
4789 }
4790 fprintf(fout, " %s %s= %s;", buf1, op_to_c(po),
4791 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4792 output_std_flags(fout, po, &pfomask, buf1);
4793 last_arith_dst = &po->operand[0];
4794 delayed_flag_op = NULL;
4795 break;
4796
4797 case OP_SAR:
4798 assert_operand_cnt(2);
4799 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4800 fprintf(fout, " %s = %s%s >> %s;", buf1,
4801 lmod_cast_s(po, po->operand[0].lmod), buf1,
4802 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4803 output_std_flags(fout, po, &pfomask, buf1);
4804 last_arith_dst = &po->operand[0];
4805 delayed_flag_op = NULL;
4806 break;
4807
4808 case OP_SHRD:
4809 assert_operand_cnt(3);
4810 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4811 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4812 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4813 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4814 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[2]);
4815 fprintf(fout, " %s >>= %s; %s |= %s << (%d - %s);",
4816 buf1, buf3, buf1, buf2, l, buf3);
4817 strcpy(g_comment, "shrd");
4818 output_std_flags(fout, po, &pfomask, buf1);
4819 last_arith_dst = &po->operand[0];
4820 delayed_flag_op = NULL;
4821 break;
4822
4823 case OP_ROL:
4824 case OP_ROR:
4825 assert_operand_cnt(2);
4826 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4827 if (po->operand[1].type == OPT_CONST) {
4828 j = po->operand[1].val;
4829 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
4830 fprintf(fout, po->op == OP_ROL ?
4831 " %s = (%s << %d) | (%s >> %d);" :
4832 " %s = (%s >> %d) | (%s << %d);",
4833 buf1, buf1, j, buf1,
4834 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
4835 }
4836 else
4837 ferr(po, "TODO\n");
4838 output_std_flags(fout, po, &pfomask, buf1);
4839 last_arith_dst = &po->operand[0];
4840 delayed_flag_op = NULL;
4841 break;
4842
4843 case OP_RCL:
4844 case OP_RCR:
4845 assert_operand_cnt(2);
4846 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4847 l = lmod_bytes(po, po->operand[0].lmod) * 8;
4848 if (po->operand[1].type == OPT_CONST) {
4849 j = po->operand[1].val % l;
4850 if (j == 0)
4851 ferr(po, "zero rotate\n");
4852 fprintf(fout, " tmp = (%s >> %d) & 1;\n",
4853 buf1, (po->op == OP_RCL) ? (l - j) : (j - 1));
4854 if (po->op == OP_RCL) {
4855 fprintf(fout,
4856 " %s = (%s << %d) | (cond_c << %d)",
4857 buf1, buf1, j, j - 1);
4858 if (j != 1)
4859 fprintf(fout, " | (%s >> %d)", buf1, l + 1 - j);
4860 }
4861 else {
4862 fprintf(fout,
4863 " %s = (%s >> %d) | (cond_c << %d)",
4864 buf1, buf1, j, l - j);
4865 if (j != 1)
4866 fprintf(fout, " | (%s << %d)", buf1, l + 1 - j);
4867 }
4868 fprintf(fout, ";\n");
4869 fprintf(fout, " cond_c = tmp;");
4870 }
4871 else
4872 ferr(po, "TODO\n");
4873 strcpy(g_comment, (po->op == OP_RCL) ? "rcl" : "rcr");
4874 output_std_flags(fout, po, &pfomask, buf1);
4875 last_arith_dst = &po->operand[0];
4876 delayed_flag_op = NULL;
4877 break;
4878
4879 case OP_XOR:
4880 assert_operand_cnt(2);
4881 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4882 if (IS(opr_name(po, 0), opr_name(po, 1))) {
4883 // special case for XOR
4884 if (pfomask & (1 << PFO_BE)) { // weird, but it happens..
4885 fprintf(fout, " cond_be = 1;\n");
4886 pfomask &= ~(1 << PFO_BE);
4887 }
4888 fprintf(fout, " %s = 0;",
4889 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4890 last_arith_dst = &po->operand[0];
4891 delayed_flag_op = NULL;
4892 break;
4893 }
4894 goto dualop_arith;
4895
4896 case OP_ADD:
4897 assert_operand_cnt(2);
4898 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4899 if (pfomask & (1 << PFO_C)) {
4900 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
4901 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4902 if (po->operand[0].lmod == OPLM_DWORD) {
4903 fprintf(fout, " tmp64 = (u64)%s + %s;\n", buf1, buf2);
4904 fprintf(fout, " cond_c = tmp64 >> 32;\n");
4905 fprintf(fout, " %s = (u32)tmp64;",
4906 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
4907 strcat(g_comment, "add64");
4908 }
4909 else {
4910 fprintf(fout, " cond_c = ((u32)%s + %s) >> %d;\n",
4911 buf1, buf2, lmod_bytes(po, po->operand[0].lmod) * 8);
4912 fprintf(fout, " %s += %s;",
4913 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4914 buf2);
4915 }
4916 pfomask &= ~(1 << PFO_C);
4917 output_std_flags(fout, po, &pfomask, buf1);
4918 last_arith_dst = &po->operand[0];
4919 delayed_flag_op = NULL;
4920 break;
4921 }
4922 goto dualop_arith;
4923
4924 case OP_SUB:
4925 assert_operand_cnt(2);
4926 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4927 if (pfomask & ~((1 << PFO_Z) | (1 << PFO_S))) {
4928 for (j = 0; j <= PFO_LE; j++) {
4929 if (!(pfomask & (1 << j)))
4930 continue;
4931 if (j == PFO_Z || j == PFO_S)
4932 continue;
4933
4934 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
4935 fprintf(fout, " cond_%s = %s;\n",
4936 parsed_flag_op_names[j], buf1);
4937 pfomask &= ~(1 << j);
4938 }
4939 }
4940 goto dualop_arith;
4941
4942 case OP_ADC:
4943 case OP_SBB:
4944 assert_operand_cnt(2);
4945 propagate_lmod(po, &po->operand[0], &po->operand[1]);
4946 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4947 if (po->op == OP_SBB
4948 && IS(po->operand[0].name, po->operand[1].name))
4949 {
4950 // avoid use of unitialized var
4951 fprintf(fout, " %s = -cond_c;", buf1);
4952 // carry remains what it was
4953 pfomask &= ~(1 << PFO_C);
4954 }
4955 else {
4956 fprintf(fout, " %s %s= %s + cond_c;", buf1, op_to_c(po),
4957 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
4958 }
4959 output_std_flags(fout, po, &pfomask, buf1);
4960 last_arith_dst = &po->operand[0];
4961 delayed_flag_op = NULL;
4962 break;
4963
4964 case OP_BSF:
4965 assert_operand_cnt(2);
4966 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
4967 fprintf(fout, " %s = %s ? __builtin_ffs(%s) - 1 : 0;",
4968 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
4969 buf2, buf2);
4970 output_std_flags(fout, po, &pfomask, buf1);
4971 last_arith_dst = &po->operand[0];
4972 delayed_flag_op = NULL;
4973 strcat(g_comment, "bsf");
4974 break;
4975
4976 case OP_DEC:
4977 if (pfomask & ~(PFOB_S | PFOB_S | PFOB_C)) {
4978 for (j = 0; j <= PFO_LE; j++) {
4979 if (!(pfomask & (1 << j)))
4980 continue;
4981 if (j == PFO_Z || j == PFO_S || j == PFO_C)
4982 continue;
4983
4984 out_cmp_for_cc(buf1, sizeof(buf1), po, j, 0);
4985 fprintf(fout, " cond_%s = %s;\n",
4986 parsed_flag_op_names[j], buf1);
4987 pfomask &= ~(1 << j);
4988 }
4989 }
4990 // fallthrough
4991
4992 case OP_INC:
4993 if (pfomask & (1 << PFO_C))
4994 // carry is unaffected by inc/dec.. wtf?
4995 ferr(po, "carry propagation needed\n");
4996
4997 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
4998 if (po->operand[0].type == OPT_REG) {
4999 strcpy(buf2, po->op == OP_INC ? "++" : "--");
5000 fprintf(fout, " %s%s;", buf1, buf2);
5001 }
5002 else {
5003 strcpy(buf2, po->op == OP_INC ? "+" : "-");
5004 fprintf(fout, " %s %s= 1;", buf1, buf2);
5005 }
5006 output_std_flags(fout, po, &pfomask, buf1);
5007 last_arith_dst = &po->operand[0];
5008 delayed_flag_op = NULL;
5009 break;
5010
5011 case OP_NEG:
5012 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5013 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
5014 fprintf(fout, " %s = -%s%s;", buf1,
5015 lmod_cast_s(po, po->operand[0].lmod), buf2);
5016 last_arith_dst = &po->operand[0];
5017 delayed_flag_op = NULL;
5018 if (pfomask & (1 << PFO_C)) {
5019 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
5020 pfomask &= ~(1 << PFO_C);
5021 }
5022 break;
5023
5024 case OP_IMUL:
5025 if (po->operand_cnt == 2) {
5026 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5027 goto dualop_arith;
5028 }
5029 if (po->operand_cnt == 3)
5030 ferr(po, "TODO imul3\n");
5031 // fallthrough
5032 case OP_MUL:
5033 assert_operand_cnt(1);
5034 switch (po->operand[0].lmod) {
5035 case OPLM_DWORD:
5036 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
5037 fprintf(fout, " tmp64 = %seax * %s%s;\n", buf1, buf1,
5038 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
5039 fprintf(fout, " edx = tmp64 >> 32;\n");
5040 fprintf(fout, " eax = tmp64;");
5041 break;
5042 case OPLM_BYTE:
5043 strcpy(buf1, po->op == OP_IMUL ? "(s16)(s8)" : "(u16)(u8)");
5044 fprintf(fout, " LOWORD(eax) = %seax * %s;", buf1,
5045 out_src_opr(buf2, sizeof(buf2), po, &po->operand[0],
5046 buf1, 0));
5047 break;
5048 default:
5049 ferr(po, "TODO: unhandled mul type\n");
5050 break;
5051 }
5052 last_arith_dst = NULL;
5053 delayed_flag_op = NULL;
5054 break;
5055
5056 case OP_DIV:
5057 case OP_IDIV:
5058 assert_operand_cnt(1);
5059 if (po->operand[0].lmod != OPLM_DWORD)
5060 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
5061
5062 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5063 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
5064 po->op == OP_IDIV));
5065 switch (po->operand[0].lmod) {
5066 case OPLM_DWORD:
5067 if (po->flags & OPF_32BIT)
5068 snprintf(buf3, sizeof(buf3), "%seax", buf2);
5069 else {
5070 fprintf(fout, " tmp64 = ((u64)edx << 32) | eax;\n");
5071 snprintf(buf3, sizeof(buf3), "%stmp64",
5072 (po->op == OP_IDIV) ? "(s64)" : "");
5073 }
5074 if (po->operand[0].type == OPT_REG
5075 && po->operand[0].reg == xDX)
5076 {
5077 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
5078 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
5079 }
5080 else {
5081 fprintf(fout, " edx = %s %% %s%s;\n", buf3, buf2, buf1);
5082 fprintf(fout, " eax = %s / %s%s;", buf3, buf2, buf1);
5083 }
5084 break;
5085 default:
5086 ferr(po, "unhandled division type\n");
5087 }
5088 last_arith_dst = NULL;
5089 delayed_flag_op = NULL;
5090 break;
5091
5092 case OP_TEST:
5093 case OP_CMP:
5094 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5095 if (pfomask != 0) {
5096 for (j = 0; j < 8; j++) {
5097 if (pfomask & (1 << j)) {
5098 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
5099 fprintf(fout, " cond_%s = %s;",
5100 parsed_flag_op_names[j], buf1);
5101 }
5102 }
5103 pfomask = 0;
5104 }
5105 else
5106 no_output = 1;
5107 last_arith_dst = NULL;
5108 delayed_flag_op = po;
5109 break;
5110
5111 case OP_SCC:
5112 // SETcc - should already be handled
5113 break;
5114
5115 // note: we reuse OP_Jcc for SETcc, only flags differ
5116 case OP_JCC:
5117 fprintf(fout, "\n goto %s;", po->operand[0].name);
5118 break;
5119
5120 case OP_JECXZ:
5121 fprintf(fout, " if (ecx == 0)\n");
5122 fprintf(fout, " goto %s;", po->operand[0].name);
5123 strcat(g_comment, "jecxz");
5124 break;
5125
5126 case OP_JMP:
5127 assert_operand_cnt(1);
5128 last_arith_dst = NULL;
5129 delayed_flag_op = NULL;
5130
5131 if (po->operand[0].type == OPT_REGMEM) {
5132 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
5133 buf1, buf2);
5134 if (ret != 2)
5135 ferr(po, "parse failure for jmp '%s'\n",
5136 po->operand[0].name);
5137 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
5138 break;
5139 }
5140 else if (po->operand[0].type != OPT_LABEL)
5141 ferr(po, "unhandled jmp type\n");
5142
5143 fprintf(fout, " goto %s;", po->operand[0].name);
5144 break;
5145
5146 case OP_CALL:
5147 assert_operand_cnt(1);
5148 pp = po->pp;
5149 my_assert_not(pp, NULL);
5150
5151 strcpy(buf3, " ");
5152 if (po->flags & OPF_CC) {
5153 // we treat conditional branch to another func
5154 // (yes such code exists..) as conditional tailcall
5155 strcat(buf3, " ");
5156 fprintf(fout, " {\n");
5157 }
5158
5159 if (pp->is_fptr && !pp->is_arg) {
5160 fprintf(fout, "%s%s = %s;\n", buf3, pp->name,
5161 out_src_opr(buf1, sizeof(buf1), po, &po->operand[0],
5162 "(void *)", 0));
5163 if (pp->is_unresolved)
5164 fprintf(fout, "%sunresolved_call(\"%s:%d\", %s);\n",
5165 buf3, asmfn, po->asmln, pp->name);
5166 }
5167
5168 fprintf(fout, "%s", buf3);
5169 if (strstr(pp->ret_type.name, "int64")) {
5170 if (po->flags & OPF_TAIL)
5171 ferr(po, "int64 and tail?\n");
5172 fprintf(fout, "tmp64 = ");
5173 }
5174 else if (!IS(pp->ret_type.name, "void")) {
5175 if (po->flags & OPF_TAIL) {
5176 if (!IS(g_func_pp->ret_type.name, "void")) {
5177 fprintf(fout, "return ");
5178 if (g_func_pp->ret_type.is_ptr != pp->ret_type.is_ptr)
5179 fprintf(fout, "(%s)", g_func_pp->ret_type.name);
5180 }
5181 }
5182 else if (regmask & (1 << xAX)) {
5183 fprintf(fout, "eax = ");
5184 if (pp->ret_type.is_ptr)
5185 fprintf(fout, "(u32)");
5186 }
5187 }
5188
5189 if (pp->name[0] == 0)
5190 ferr(po, "missing pp->name\n");
5191 fprintf(fout, "%s%s(", pp->name,
5192 pp->has_structarg ? "_sa" : "");
5193
5194 if (po->flags & OPF_ATAIL) {
5195 if (pp->argc_stack != g_func_pp->argc_stack
5196 || (pp->argc_stack > 0
5197 && pp->is_stdcall != g_func_pp->is_stdcall))
5198 ferr(po, "incompatible tailcall\n");
5199 if (g_func_pp->has_retreg)
5200 ferr(po, "TODO: retreg+tailcall\n");
5201
5202 for (arg = j = 0; arg < pp->argc; arg++) {
5203 if (arg > 0)
5204 fprintf(fout, ", ");
5205
5206 cast[0] = 0;
5207 if (pp->arg[arg].type.is_ptr)
5208 snprintf(cast, sizeof(cast), "(%s)",
5209 pp->arg[arg].type.name);
5210
5211 if (pp->arg[arg].reg != NULL) {
5212 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5213 continue;
5214 }
5215 // stack arg
5216 for (; j < g_func_pp->argc; j++)
5217 if (g_func_pp->arg[j].reg == NULL)
5218 break;
5219 fprintf(fout, "%sa%d", cast, j + 1);
5220 j++;
5221 }
5222 }
5223 else {
5224 for (arg = 0; arg < pp->argc; arg++) {
5225 if (arg > 0)
5226 fprintf(fout, ", ");
5227
5228 cast[0] = 0;
5229 if (pp->arg[arg].type.is_ptr)
5230 snprintf(cast, sizeof(cast), "(%s)",
5231 pp->arg[arg].type.name);
5232
5233 if (pp->arg[arg].reg != NULL) {
5234 if (pp->arg[arg].type.is_retreg)
5235 fprintf(fout, "&%s", pp->arg[arg].reg);
5236 else
5237 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
5238 continue;
5239 }
5240
5241 // stack arg
5242 tmp_op = pp->arg[arg].datap;
5243 if (tmp_op == NULL)
5244 ferr(po, "parsed_op missing for arg%d\n", arg);
5245
5246 if (tmp_op->flags & OPF_VAPUSH) {
5247 fprintf(fout, "ap");
5248 }
5249 else if (tmp_op->p_argpass != 0) {
5250 fprintf(fout, "a%d", tmp_op->p_argpass);
5251 }
5252 else if (tmp_op->p_argnum != 0) {
5253 fprintf(fout, "%s%s", cast,
5254 saved_arg_name(buf1, sizeof(buf1),
5255 tmp_op->p_arggrp, tmp_op->p_argnum));
5256 }
5257 else {
5258 fprintf(fout, "%s",
5259 out_src_opr(buf1, sizeof(buf1),
5260 tmp_op, &tmp_op->operand[0], cast, 0));
5261 }
5262 }
5263 }
5264 fprintf(fout, ");");
5265
5266 if (strstr(pp->ret_type.name, "int64")) {
5267 fprintf(fout, "\n");
5268 fprintf(fout, "%sedx = tmp64 >> 32;\n", buf3);
5269 fprintf(fout, "%seax = tmp64;", buf3);
5270 }
5271
5272 if (pp->is_unresolved) {
5273 snprintf(buf2, sizeof(buf2), " unresolved %dreg",
5274 pp->argc_reg);
5275 strcat(g_comment, buf2);
5276 }
5277
5278 if (po->flags & OPF_TAIL) {
5279 ret = 0;
5280 if (i == opcnt - 1 || pp->is_noreturn)
5281 ret = 0;
5282 else if (IS(pp->ret_type.name, "void"))
5283 ret = 1;
5284 else if (IS(g_func_pp->ret_type.name, "void"))
5285 ret = 1;
5286 // else already handled as 'return f()'
5287
5288 if (ret) {
5289 if (!IS(g_func_pp->ret_type.name, "void")) {
5290 ferr(po, "int func -> void func tailcall?\n");
5291 }
5292 else {
5293 fprintf(fout, "\n%sreturn;", buf3);
5294 strcat(g_comment, " ^ tailcall");
5295 }
5296 }
5297 else
5298 strcat(g_comment, " tailcall");
5299 }
5300 if (pp->is_noreturn)
5301 strcat(g_comment, " noreturn");
5302 if ((po->flags & OPF_ATAIL) && pp->argc_stack > 0)
5303 strcat(g_comment, " argframe");
5304 if (po->flags & OPF_CC)
5305 strcat(g_comment, " cond");
5306
5307 if (po->flags & OPF_CC)
5308 fprintf(fout, "\n }");
5309
5310 delayed_flag_op = NULL;
5311 last_arith_dst = NULL;
5312 break;
5313
5314 case OP_RET:
5315 if (g_func_pp->is_vararg)
5316 fprintf(fout, " va_end(ap);\n");
5317 if (g_func_pp->has_retreg) {
5318 for (arg = 0; arg < g_func_pp->argc; arg++)
5319 if (g_func_pp->arg[arg].type.is_retreg)
5320 fprintf(fout, " *r_%s = %s;\n",
5321 g_func_pp->arg[arg].reg, g_func_pp->arg[arg].reg);
5322 }
5323
5324 if (IS(g_func_pp->ret_type.name, "void")) {
5325 if (i != opcnt - 1 || label_pending)
5326 fprintf(fout, " return;");
5327 }
5328 else if (g_func_pp->ret_type.is_ptr) {
5329 fprintf(fout, " return (%s)eax;",
5330 g_func_pp->ret_type.name);
5331 }
5332 else if (IS(g_func_pp->ret_type.name, "__int64"))
5333 fprintf(fout, " return ((u64)edx << 32) | eax;");
5334 else
5335 fprintf(fout, " return eax;");
5336
5337 last_arith_dst = NULL;
5338 delayed_flag_op = NULL;
5339 break;
5340
5341 case OP_PUSH:
5342 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5343 if (po->p_argnum != 0) {
5344 // special case - saved func arg
5345 fprintf(fout, " %s = %s;",
5346 saved_arg_name(buf2, sizeof(buf2),
5347 po->p_arggrp, po->p_argnum), buf1);
5348 break;
5349 }
5350 else if (po->flags & OPF_RSAVE) {
5351 fprintf(fout, " s_%s = %s;", buf1, buf1);
5352 break;
5353 }
5354 else if (g_func_pp->is_userstack) {
5355 fprintf(fout, " *(--esp) = %s;", buf1);
5356 break;
5357 }
5358 if (!(g_ida_func_attr & IDAFA_NORETURN))
5359 ferr(po, "stray push encountered\n");
5360 no_output = 1;
5361 break;
5362
5363 case OP_POP:
5364 if (po->flags & OPF_RSAVE) {
5365 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5366 fprintf(fout, " %s = s_%s;", buf1, buf1);
5367 break;
5368 }
5369 else if (po->datap != NULL) {
5370 // push/pop pair
5371 tmp_op = po->datap;
5372 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
5373 fprintf(fout, " %s = %s;", buf1,
5374 out_src_opr(buf2, sizeof(buf2),
5375 tmp_op, &tmp_op->operand[0],
5376 default_cast_to(buf3, sizeof(buf3), &po->operand[0]), 0));
5377 break;
5378 }
5379 else if (g_func_pp->is_userstack) {
5380 fprintf(fout, " %s = *esp++;",
5381 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
5382 break;
5383 }
5384 else
5385 ferr(po, "stray pop encountered\n");
5386 break;
5387
5388 case OP_NOP:
5389 no_output = 1;
5390 break;
5391
5392 // mmx
5393 case OP_EMMS:
5394 strcpy(g_comment, "(emms)");
5395 break;
5396
5397 default:
5398 no_output = 1;
5399 ferr(po, "unhandled op type %d, flags %x\n",
5400 po->op, po->flags);
5401 break;
5402 }
5403
5404 if (g_comment[0] != 0) {
5405 char *p = g_comment;
5406 while (my_isblank(*p))
5407 p++;
5408 fprintf(fout, " // %s", p);
5409 g_comment[0] = 0;
5410 no_output = 0;
5411 }
5412 if (!no_output)
5413 fprintf(fout, "\n");
5414
5415 // some sanity checking
5416 if (po->flags & OPF_REP) {
5417 if (po->op != OP_STOS && po->op != OP_MOVS
5418 && po->op != OP_CMPS && po->op != OP_SCAS)
5419 ferr(po, "unexpected rep\n");
5420 if (!(po->flags & (OPF_REPZ|OPF_REPNZ))
5421 && (po->op == OP_CMPS || po->op == OP_SCAS))
5422 ferr(po, "cmps/scas with plain rep\n");
5423 }
5424 if ((po->flags & (OPF_REPZ|OPF_REPNZ))
5425 && po->op != OP_CMPS && po->op != OP_SCAS)
5426 ferr(po, "unexpected repz/repnz\n");
5427
5428 if (pfomask != 0)
5429 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
5430
5431 // see is delayed flag stuff is still valid
5432 if (delayed_flag_op != NULL && delayed_flag_op != po) {
5433 if (is_any_opr_modified(delayed_flag_op, po, 0))
5434 delayed_flag_op = NULL;
5435 }
5436
5437 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
5438 if (is_opr_modified(last_arith_dst, po))
5439 last_arith_dst = NULL;
5440 }
5441
5442 label_pending = 0;
5443 }
5444
5445 if (g_stack_fsz && !g_stack_frame_used)
5446 fprintf(fout, " (void)sf;\n");
5447
5448 fprintf(fout, "}\n\n");
5449
5450 gen_x_cleanup(opcnt);
5451}
5452
5453static void gen_x_cleanup(int opcnt)
5454{
5455 int i;
5456
5457 for (i = 0; i < opcnt; i++) {
5458 struct label_ref *lr, *lr_del;
5459
5460 lr = g_label_refs[i].next;
5461 while (lr != NULL) {
5462 lr_del = lr;
5463 lr = lr->next;
5464 free(lr_del);
5465 }
5466 g_label_refs[i].i = -1;
5467 g_label_refs[i].next = NULL;
5468
5469 if (ops[i].op == OP_CALL) {
5470 if (ops[i].pp)
5471 proto_release(ops[i].pp);
5472 }
5473 }
5474 g_func_pp = NULL;
5475}
5476
5477struct func_proto_dep;
5478
5479struct func_prototype {
5480 char name[NAMELEN];
5481 int id;
5482 int argc_stack;
5483 int regmask_dep;
5484 int has_ret:3; // -1, 0, 1: unresolved, no, yes
5485 unsigned int dep_resolved:1;
5486 unsigned int is_stdcall:1;
5487 struct func_proto_dep *dep_func;
5488 int dep_func_cnt;
5489};
5490
5491struct func_proto_dep {
5492 char *name;
5493 struct func_prototype *proto;
5494 int regmask_live; // .. at the time of call
5495 unsigned int ret_dep:1; // return from this is caller's return
5496};
5497
5498static struct func_prototype *hg_fp;
5499static int hg_fp_cnt;
5500
5501static struct scanned_var {
5502 char name[NAMELEN];
5503 enum opr_lenmod lmod;
5504 unsigned int is_seeded:1;
5505 unsigned int is_c_str:1;
5506} *hg_vars;
5507static int hg_var_cnt;
5508
5509static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
5510 int count);
5511
5512static struct func_proto_dep *hg_fp_find_dep(struct func_prototype *fp,
5513 const char *name)
5514{
5515 int i;
5516
5517 for (i = 0; i < fp->dep_func_cnt; i++)
5518 if (IS(fp->dep_func[i].name, name))
5519 return &fp->dep_func[i];
5520
5521 return NULL;
5522}
5523
5524static void hg_fp_add_dep(struct func_prototype *fp, const char *name)
5525{
5526 // is it a dupe?
5527 if (hg_fp_find_dep(fp, name))
5528 return;
5529
5530 if ((fp->dep_func_cnt & 0xff) == 0) {
5531 fp->dep_func = realloc(fp->dep_func,
5532 sizeof(fp->dep_func[0]) * (fp->dep_func_cnt + 0x100));
5533 my_assert_not(fp->dep_func, NULL);
5534 memset(&fp->dep_func[fp->dep_func_cnt], 0,
5535 sizeof(fp->dep_func[0]) * 0x100);
5536 }
5537 fp->dep_func[fp->dep_func_cnt].name = strdup(name);
5538 fp->dep_func_cnt++;
5539}
5540
5541static int hg_fp_cmp_name(const void *p1_, const void *p2_)
5542{
5543 const struct func_prototype *p1 = p1_, *p2 = p2_;
5544 return strcmp(p1->name, p2->name);
5545}
5546
5547#if 0
5548static int hg_fp_cmp_id(const void *p1_, const void *p2_)
5549{
5550 const struct func_prototype *p1 = p1_, *p2 = p2_;
5551 return p1->id - p2->id;
5552}
5553#endif
5554
5555static void gen_hdr(const char *funcn, int opcnt)
5556{
5557 int save_arg_vars[MAX_ARG_GRP] = { 0, };
5558 const struct parsed_proto *pp_c;
5559 struct parsed_proto *pp;
5560 struct func_prototype *fp;
5561 struct func_proto_dep *dep;
5562 struct parsed_data *pd;
5563 struct parsed_op *po;
5564 const char *tmpname;
5565 int regmask_dummy = 0;
5566 int regmask_save = 0;
5567 int regmask_dst = 0;
5568 int regmask_dep = 0;
5569 int max_bp_offset = 0;
5570 int has_ret = -1;
5571 int from_caller = 0;
5572 int i, j, l, ret;
5573 int depth, reg;
5574
5575 if ((hg_fp_cnt & 0xff) == 0) {
5576 hg_fp = realloc(hg_fp, sizeof(hg_fp[0]) * (hg_fp_cnt + 0x100));
5577 my_assert_not(hg_fp, NULL);
5578 memset(hg_fp + hg_fp_cnt, 0, sizeof(hg_fp[0]) * 0x100);
5579 }
5580
5581 fp = &hg_fp[hg_fp_cnt];
5582 snprintf(fp->name, sizeof(fp->name), "%s", funcn);
5583 fp->id = hg_fp_cnt;
5584 fp->argc_stack = -1;
5585 hg_fp_cnt++;
5586
5587 // perhaps already in seed header?
5588 pp_c = proto_parse(g_fhdr, funcn, 1);
5589 if (pp_c != NULL) {
5590 fp->argc_stack = pp_c->argc_stack;
5591 fp->regmask_dep = get_pp_arg_regmask(pp_c);
5592 fp->has_ret = !IS(pp_c->ret_type.name, "void");
5593 return;
5594 }
5595
5596 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
5597 g_stack_frame_used = 0;
5598
5599 // pass1:
5600 // - handle ebp/esp frame, remove ops related to it
5601 scan_prologue_epilogue(opcnt);
5602
5603 // pass2:
5604 // - collect calls
5605 // - resolve all branches
5606 for (i = 0; i < opcnt; i++)
5607 {
5608 po = &ops[i];
5609 po->bt_i = -1;
5610 po->btj = NULL;
5611
5612 if (po->flags & (OPF_RMD|OPF_DONE))
5613 continue;
5614
5615 if (po->op == OP_CALL) {
5616 tmpname = opr_name(po, 0);
5617 pp = NULL;
5618 if (po->operand[0].type == OPT_LABEL) {
5619 hg_fp_add_dep(fp, tmpname);
5620
5621 // perhaps a call to already known func?
5622 pp_c = proto_parse(g_fhdr, tmpname, 1);
5623 if (pp_c != NULL)
5624 pp = proto_clone(pp_c);
5625 }
5626 else if (po->datap != NULL) {
5627 pp = calloc(1, sizeof(*pp));
5628 my_assert_not(pp, NULL);
5629
5630 ret = parse_protostr(po->datap, pp);
5631 if (ret < 0)
5632 ferr(po, "bad protostr supplied: %s\n", (char *)po->datap);
5633 free(po->datap);
5634 po->datap = NULL;
5635 }
5636 if (pp != NULL && pp->is_noreturn)
5637 po->flags |= OPF_TAIL;
5638
5639 po->pp = pp;
5640 continue;
5641 }
5642
5643 if (!(po->flags & OPF_JMP) || po->op == OP_RET)
5644 continue;
5645
5646 if (po->operand[0].type == OPT_REGMEM) {
5647 pd = try_resolve_jumptab(i, opcnt);
5648 if (pd == NULL)
5649 goto tailcall;
5650
5651 po->btj = pd;
5652 continue;
5653 }
5654
5655 for (l = 0; l < opcnt; l++) {
5656 if (g_labels[l] != NULL
5657 && IS(po->operand[0].name, g_labels[l]))
5658 {
5659 add_label_ref(&g_label_refs[l], i);
5660 po->bt_i = l;
5661 break;
5662 }
5663 }
5664
5665 if (po->bt_i != -1 || (po->flags & OPF_RMD))
5666 continue;
5667
5668 if (po->operand[0].type == OPT_LABEL)
5669 // assume tail call
5670 goto tailcall;
5671
5672 ferr(po, "unhandled branch\n");
5673
5674tailcall:
5675 po->op = OP_CALL;
5676 po->flags |= OPF_TAIL;
5677 if (i > 0 && ops[i - 1].op == OP_POP)
5678 po->flags |= OPF_ATAIL;
5679 i--; // reprocess
5680 }
5681
5682 // pass3:
5683 // - remove dead labels
5684 // - process trivial calls
5685 // - handle push <const>/pop pairs
5686 for (i = 0; i < opcnt; i++)
5687 {
5688 if (g_labels[i] != NULL && g_label_refs[i].i == -1) {
5689 free(g_labels[i]);
5690 g_labels[i] = NULL;
5691 }
5692
5693 po = &ops[i];
5694 if (po->flags & (OPF_RMD|OPF_DONE))
5695 continue;
5696
5697 if (po->op == OP_CALL)
5698 {
5699 pp = process_call_early(i, opcnt, &j);
5700 if (pp != NULL) {
5701 if (!(po->flags & OPF_ATAIL))
5702 // since we know the args, try to collect them
5703 if (collect_call_args_early(po, i, pp, &regmask_dummy) != 0)
5704 pp = NULL;
5705 }
5706
5707 if (pp != NULL) {
5708 if (j >= 0) {
5709 // commit esp adjust
5710 ops[j].flags |= OPF_RMD;
5711 if (ops[j].op != OP_POP)
5712 patch_esp_adjust(&ops[j], pp->argc_stack * 4);
5713 else
5714 ops[j].flags |= OPF_DONE;
5715 }
5716
5717 po->flags |= OPF_DONE;
5718 }
5719 }
5720 else if (po->op == OP_PUSH && po->operand[0].type == OPT_CONST) {
5721 scan_for_pop_const(i, opcnt);
5722 }
5723 }
5724
5725 // pass4:
5726 // - track saved regs (simple)
5727 // - process calls
5728 for (i = 0; i < opcnt; i++)
5729 {
5730 po = &ops[i];
5731 if (po->flags & (OPF_RMD|OPF_DONE))
5732 continue;
5733
5734 if (po->op == OP_PUSH && po->operand[0].type == OPT_REG)
5735 {
5736 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
5737 if (ret == 0) {
5738 regmask_save |= 1 << po->operand[0].reg;
5739 po->flags |= OPF_RMD;
5740 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, OPF_RMD);
5741 }
5742 }
5743 else if (po->op == OP_CALL && !(po->flags & OPF_DONE))
5744 {
5745 pp = process_call(i, opcnt);
5746
5747 if (!pp->is_unresolved && !(po->flags & OPF_ATAIL)) {
5748 // since we know the args, collect them
5749 collect_call_args(po, i, pp, &regmask_dummy, save_arg_vars,
5750 i + opcnt * 1);
5751 }
5752 }
5753 }
5754
5755 // pass5:
5756 // - track saved regs (part 2)
5757 // - try to figure out arg-regs
5758 // - calculate reg deps
5759 for (i = 0; i < opcnt; i++)
5760 {
5761 po = &ops[i];
5762
5763 if (po->flags & OPF_FARG)
5764 /* (just calculate register deps) */;
5765 else if (po->flags & OPF_RMD)
5766 continue;
5767 else if (po->op == OP_PUSH && po->operand[0].type == OPT_REG
5768 && !(po->flags & OPF_DONE))
5769 {
5770 reg = po->operand[0].reg;
5771 if (reg < 0)
5772 ferr(po, "reg not set for push?\n");
5773
5774 depth = 0;
5775 ret = scan_for_pop(i + 1, opcnt,
5776 po->operand[0].name, i + opcnt * 2, 0, &depth, 0);
5777 if (ret == 1) {
5778 regmask_save |= 1 << reg;
5779 po->flags |= OPF_RMD;
5780 scan_for_pop(i + 1, opcnt,
5781 po->operand[0].name, i + opcnt * 3, 0, &depth, 1);
5782 continue;
5783 }
5784 }
5785 else if (po->op == OP_CALL) {
5786 po->regmask_dst |= 1 << xAX;
5787
5788 dep = hg_fp_find_dep(fp, po->operand[0].name);
5789 if (dep != NULL)
5790 dep->regmask_live = regmask_save | regmask_dst;
5791 }
5792 else if (po->op == OP_RET) {
5793 if (po->operand_cnt > 0) {
5794 fp->is_stdcall = 1;
5795 if (fp->argc_stack >= 0
5796 && fp->argc_stack != po->operand[0].val / 4)
5797 ferr(po, "ret mismatch? (%d)\n", fp->argc_stack * 4);
5798 fp->argc_stack = po->operand[0].val / 4;
5799 }
5800 }
5801
5802 if (has_ret != 0 && (po->flags & OPF_TAIL)) {
5803 if (po->op == OP_CALL) {
5804 j = i;
5805 ret = 1;
5806 }
5807 else {
5808 struct parsed_opr opr = { 0, };
5809 opr.type = OPT_REG;
5810 opr.reg = xAX;
5811 j = -1;
5812 from_caller = 0;
5813 ret = resolve_origin(i, &opr, i + opcnt * 4, &j, &from_caller);
5814 }
5815
5816 if (ret == -1 && from_caller) {
5817 // unresolved eax - probably void func
5818 has_ret = 0;
5819 }
5820 else {
5821 if (ops[j].op == OP_CALL) {
5822 dep = hg_fp_find_dep(fp, po->operand[0].name);
5823 if (dep != NULL)
5824 dep->ret_dep = 1;
5825 else
5826 has_ret = 1;
5827 }
5828 else
5829 has_ret = 1;
5830 }
5831 }
5832
5833 l = regmask_save | regmask_dst;
5834 if (g_bp_frame && !(po->flags & OPF_EBP_S))
5835 l |= 1 << xBP;
5836
5837 l = po->regmask_src & ~l;
5838#if 0
5839 if (l)
5840 fnote(po, "dep |= %04x, dst %04x, save %04x\n", l,
5841 regmask_dst, regmask_save);
5842#endif
5843 regmask_dep |= l;
5844 regmask_dst |= po->regmask_dst;
5845 }
5846
5847 if (has_ret == -1 && (regmask_dep & (1 << xAX)))
5848 has_ret = 1;
5849
5850 for (i = 0; i < g_eqcnt; i++) {
5851 if (g_eqs[i].offset > max_bp_offset && g_eqs[i].offset < 4*32)
5852 max_bp_offset = g_eqs[i].offset;
5853 }
5854
5855 if (fp->argc_stack < 0) {
5856 max_bp_offset = (max_bp_offset + 3) & ~3;
5857 fp->argc_stack = max_bp_offset / 4;
5858 if ((g_ida_func_attr & IDAFA_BP_FRAME) && fp->argc_stack > 0)
5859 fp->argc_stack--;
5860 }
5861
5862 fp->regmask_dep = regmask_dep & ~(1 << xSP);
5863 fp->has_ret = has_ret;
5864 // output_hdr_fp(stdout, fp, 1);
5865
5866 gen_x_cleanup(opcnt);
5867}
5868
5869static void hg_fp_resolve_deps(struct func_prototype *fp)
5870{
5871 struct func_prototype fp_s;
5872 int i;
5873
5874 // this thing is recursive, so mark first..
5875 fp->dep_resolved = 1;
5876
5877 for (i = 0; i < fp->dep_func_cnt; i++) {
5878 strcpy(fp_s.name, fp->dep_func[i].name);
5879 fp->dep_func[i].proto = bsearch(&fp_s, hg_fp, hg_fp_cnt,
5880 sizeof(hg_fp[0]), hg_fp_cmp_name);
5881 if (fp->dep_func[i].proto != NULL) {
5882 if (!fp->dep_func[i].proto->dep_resolved)
5883 hg_fp_resolve_deps(fp->dep_func[i].proto);
5884
5885 fp->regmask_dep |= ~fp->dep_func[i].regmask_live
5886 & fp->dep_func[i].proto->regmask_dep;
5887
5888 if (fp->has_ret == -1)
5889 fp->has_ret = fp->dep_func[i].proto->has_ret;
5890 }
5891 }
5892}
5893
5894static void output_hdr_fp(FILE *fout, const struct func_prototype *fp,
5895 int count)
5896{
5897 const struct parsed_proto *pp;
5898 char *p, namebuf[NAMELEN];
5899 const char *name;
5900 int regmask_dep;
5901 int argc_stack;
5902 int j, arg;
5903
5904 for (; count > 0; count--, fp++) {
5905 if (fp->has_ret == -1)
5906 fprintf(fout, "// ret unresolved\n");
5907#if 0
5908 fprintf(fout, "// dep:");
5909 for (j = 0; j < fp->dep_func_cnt; j++) {
5910 fprintf(fout, " %s/", fp->dep_func[j].name);
5911 if (fp->dep_func[j].proto != NULL)
5912 fprintf(fout, "%04x/%d", fp->dep_func[j].proto->regmask_dep,
5913 fp->dep_func[j].proto->has_ret);
5914 }
5915 fprintf(fout, "\n");
5916#endif
5917
5918 p = strchr(fp->name, '@');
5919 if (p != NULL) {
5920 memcpy(namebuf, fp->name, p - fp->name);
5921 namebuf[p - fp->name] = 0;
5922 name = namebuf;
5923 }
5924 else
5925 name = fp->name;
5926 if (name[0] == '_')
5927 name++;
5928
5929 pp = proto_parse(g_fhdr, name, 1);
5930 if (pp != NULL && pp->is_include)
5931 continue;
5932
5933 regmask_dep = fp->regmask_dep;
5934 argc_stack = fp->argc_stack;
5935
5936 fprintf(fout, fp->has_ret ? "int " : "void ");
5937 if (regmask_dep && (fp->is_stdcall || argc_stack == 0)
5938 && (regmask_dep & ~((1 << xCX) | (1 << xDX))) == 0)
5939 {
5940 fprintf(fout, " __fastcall ");
5941 if (!(regmask_dep & (1 << xDX)) && argc_stack == 0)
5942 argc_stack = 1;
5943 else
5944 argc_stack += 2;
5945 regmask_dep = 0;
5946 }
5947 else if (regmask_dep && !fp->is_stdcall) {
5948 fprintf(fout, "/*__usercall*/ ");
5949 }
5950 else if (regmask_dep) {
5951 fprintf(fout, "/*__userpurge*/ ");
5952 }
5953 else if (fp->is_stdcall)
5954 fprintf(fout, " __stdcall ");
5955 else
5956 fprintf(fout, " __cdecl ");
5957
5958 fprintf(fout, "%s(", name);
5959
5960 arg = 0;
5961 for (j = 0; j < xSP; j++) {
5962 if (regmask_dep & (1 << j)) {
5963 arg++;
5964 if (arg != 1)
5965 fprintf(fout, ", ");
5966 fprintf(fout, "int a%d/*<%s>*/", arg, regs_r32[j]);
5967 }
5968 }
5969
5970 for (j = 0; j < argc_stack; j++) {
5971 arg++;
5972 if (arg != 1)
5973 fprintf(fout, ", ");
5974 fprintf(fout, "int a%d", arg);
5975 }
5976
5977 fprintf(fout, ");\n");
5978 }
5979}
5980
5981static void output_hdr(FILE *fout)
5982{
5983 static const char *lmod_c_names[] = {
5984 [OPLM_UNSPEC] = "???",
5985 [OPLM_BYTE] = "uint8_t",
5986 [OPLM_WORD] = "uint16_t",
5987 [OPLM_DWORD] = "uint32_t",
5988 [OPLM_QWORD] = "uint64_t",
5989 };
5990 const struct scanned_var *var;
5991 int i;
5992
5993 // resolve deps
5994 qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_name);
5995 for (i = 0; i < hg_fp_cnt; i++)
5996 hg_fp_resolve_deps(&hg_fp[i]);
5997
5998 // note: messes up .proto ptr, don't use
5999 //qsort(hg_fp, hg_fp_cnt, sizeof(hg_fp[0]), hg_fp_cmp_id);
6000
6001 // output variables
6002 for (i = 0; i < hg_var_cnt; i++) {
6003 var = &hg_vars[i];
6004
6005 if (var->is_c_str)
6006 fprintf(fout, "extern %-8s %s[];", "char", var->name);
6007 else
6008 fprintf(fout, "extern %-8s %s;",
6009 lmod_c_names[var->lmod], var->name);
6010
6011 if (var->is_seeded)
6012 fprintf(fout, " // seeded");
6013 fprintf(fout, "\n");
6014 }
6015
6016 fprintf(fout, "\n");
6017
6018 // output function prototypes
6019 output_hdr_fp(fout, hg_fp, hg_fp_cnt);
6020}
6021
6022// read a line, truncating it if it doesn't fit
6023static char *my_fgets(char *s, size_t size, FILE *stream)
6024{
6025 char *ret, *ret2;
6026 char buf[64];
6027 int p;
6028
6029 p = size - 2;
6030 if (p >= 0)
6031 s[p] = 0;
6032
6033 ret = fgets(s, size, stream);
6034 if (ret != NULL && p >= 0 && s[p] != 0 && s[p] != '\n') {
6035 p = sizeof(buf) - 2;
6036 do {
6037 buf[p] = 0;
6038 ret2 = fgets(buf, sizeof(buf), stream);
6039 }
6040 while (ret2 != NULL && buf[p] != 0 && buf[p] != '\n');
6041 }
6042
6043 return ret;
6044}
6045
6046// '=' needs special treatment
6047// also ' quote
6048static char *next_word_s(char *w, size_t wsize, char *s)
6049{
6050 size_t i;
6051
6052 s = sskip(s);
6053
6054 i = 0;
6055 if (*s == '\'') {
6056 w[0] = s[0];
6057 for (i = 1; i < wsize - 1; i++) {
6058 if (s[i] == 0) {
6059 printf("warning: missing closing quote: \"%s\"\n", s);
6060 break;
6061 }
6062 if (s[i] == '\'')
6063 break;
6064 w[i] = s[i];
6065 }
6066 }
6067
6068 for (; i < wsize - 1; i++) {
6069 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
6070 break;
6071 w[i] = s[i];
6072 }
6073 w[i] = 0;
6074
6075 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
6076 printf("warning: '%s' truncated\n", w);
6077
6078 return s + i;
6079}
6080
6081static void scan_variables(FILE *fasm)
6082{
6083 const struct parsed_proto *pp_c;
6084 struct scanned_var *var;
6085 char line[256] = { 0, };
6086 char words[3][256];
6087 char *p = NULL;
6088 int wordc;
6089 int l;
6090
6091 while (!feof(fasm))
6092 {
6093 // skip to next data section
6094 while (my_fgets(line, sizeof(line), fasm))
6095 {
6096 asmln++;
6097
6098 p = sskip(line);
6099 if (*p == 0 || *p == ';')
6100 continue;
6101
6102 p = sskip(next_word_s(words[0], sizeof(words[0]), p));
6103 if (*p == 0 || *p == ';')
6104 continue;
6105
6106 if (*p != 's' || !IS_START(p, "segment para public"))
6107 continue;
6108
6109 break;
6110 }
6111
6112 if (p == NULL || !IS_START(p, "segment para public"))
6113 break;
6114 p = sskip(p + 19);
6115
6116 if (!IS_START(p, "'DATA'"))
6117 continue;
6118
6119 // now process it
6120 while (my_fgets(line, sizeof(line), fasm))
6121 {
6122 asmln++;
6123
6124 p = line;
6125 if (my_isblank(*p))
6126 continue;
6127
6128 p = sskip(p);
6129 if (*p == 0 || *p == ';')
6130 continue;
6131
6132 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6133 words[wordc][0] = 0;
6134 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6135 if (*p == 0 || *p == ';') {
6136 wordc++;
6137 break;
6138 }
6139 }
6140
6141 if (wordc == 2 && IS(words[1], "ends"))
6142 break;
6143 if (wordc < 2)
6144 continue;
6145
6146 if ((hg_var_cnt & 0xff) == 0) {
6147 hg_vars = realloc(hg_vars, sizeof(hg_vars[0])
6148 * (hg_var_cnt + 0x100));
6149 my_assert_not(hg_vars, NULL);
6150 memset(hg_vars + hg_var_cnt, 0, sizeof(hg_vars[0]) * 0x100);
6151 }
6152
6153 var = &hg_vars[hg_var_cnt++];
6154 snprintf(var->name, sizeof(var->name), "%s", words[0]);
6155
6156 // maybe already in seed header?
6157 pp_c = proto_parse(g_fhdr, var->name, 1);
6158 if (pp_c != NULL) {
6159 if (pp_c->is_func)
6160 aerr("func?\n");
6161 else if (pp_c->is_fptr) {
6162 var->lmod = OPLM_DWORD;
6163 //var->is_ptr = 1;
6164 }
6165 else if (!guess_lmod_from_c_type(&var->lmod, &pp_c->type))
6166 aerr("unhandled C type '%s' for '%s'\n",
6167 pp_c->type.name, var->name);
6168
6169 var->is_seeded = 1;
6170 continue;
6171 }
6172
6173 if (IS(words[1], "dd"))
6174 var->lmod = OPLM_DWORD;
6175 else if (IS(words[1], "dw"))
6176 var->lmod = OPLM_WORD;
6177 else if (IS(words[1], "db")) {
6178 var->lmod = OPLM_BYTE;
6179 if (wordc >= 3 && (l = strlen(words[2])) > 4) {
6180 if (words[2][0] == '\'' && IS(words[2] + l - 2, ",0"))
6181 var->is_c_str = 1;
6182 }
6183 }
6184 else if (IS(words[1], "dq"))
6185 var->lmod = OPLM_QWORD;
6186 //else if (IS(words[1], "dt"))
6187 else
6188 aerr("type '%s' not known\n", words[1]);
6189 }
6190 }
6191
6192 rewind(fasm);
6193 asmln = 0;
6194}
6195
6196static void set_label(int i, const char *name)
6197{
6198 const char *p;
6199 int len;
6200
6201 len = strlen(name);
6202 p = strchr(name, ':');
6203 if (p != NULL)
6204 len = p - name;
6205
6206 if (g_labels[i] != NULL && !IS_START(g_labels[i], "algn_"))
6207 aerr("dupe label '%s' vs '%s'?\n", name, g_labels[i]);
6208 g_labels[i] = realloc(g_labels[i], len + 1);
6209 my_assert_not(g_labels[i], NULL);
6210 memcpy(g_labels[i], name, len);
6211 g_labels[i][len] = 0;
6212}
6213
6214struct chunk_item {
6215 char *name;
6216 long fptr;
6217 int asmln;
6218};
6219
6220static struct chunk_item *func_chunks;
6221static int func_chunk_cnt;
6222static int func_chunk_alloc;
6223
6224static void add_func_chunk(FILE *fasm, const char *name, int line)
6225{
6226 if (func_chunk_cnt >= func_chunk_alloc) {
6227 func_chunk_alloc *= 2;
6228 func_chunks = realloc(func_chunks,
6229 func_chunk_alloc * sizeof(func_chunks[0]));
6230 my_assert_not(func_chunks, NULL);
6231 }
6232 func_chunks[func_chunk_cnt].fptr = ftell(fasm);
6233 func_chunks[func_chunk_cnt].name = strdup(name);
6234 func_chunks[func_chunk_cnt].asmln = line;
6235 func_chunk_cnt++;
6236}
6237
6238static int cmp_chunks(const void *p1, const void *p2)
6239{
6240 const struct chunk_item *c1 = p1, *c2 = p2;
6241 return strcmp(c1->name, c2->name);
6242}
6243
6244static int cmpstringp(const void *p1, const void *p2)
6245{
6246 return strcmp(*(char * const *)p1, *(char * const *)p2);
6247}
6248
6249static void scan_ahead(FILE *fasm)
6250{
6251 char words[2][256];
6252 char line[256];
6253 long oldpos;
6254 int oldasmln;
6255 int wordc;
6256 char *p;
6257 int i;
6258
6259 oldpos = ftell(fasm);
6260 oldasmln = asmln;
6261
6262 while (my_fgets(line, sizeof(line), fasm))
6263 {
6264 wordc = 0;
6265 asmln++;
6266
6267 p = sskip(line);
6268 if (*p == 0)
6269 continue;
6270
6271 if (*p == ';')
6272 {
6273 // get rid of random tabs
6274 for (i = 0; line[i] != 0; i++)
6275 if (line[i] == '\t')
6276 line[i] = ' ';
6277
6278 if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
6279 {
6280 p += 30;
6281 next_word(words[0], sizeof(words[0]), p);
6282 if (words[0][0] == 0)
6283 aerr("missing name for func chunk?\n");
6284
6285 add_func_chunk(fasm, words[0], asmln);
6286 }
6287 else if (IS_START(p, "; sctend"))
6288 break;
6289
6290 continue;
6291 } // *p == ';'
6292
6293 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6294 words[wordc][0] = 0;
6295 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6296 if (*p == 0 || *p == ';') {
6297 wordc++;
6298 break;
6299 }
6300 }
6301
6302 if (wordc == 2 && IS(words[1], "ends"))
6303 break;
6304 }
6305
6306 fseek(fasm, oldpos, SEEK_SET);
6307 asmln = oldasmln;
6308}
6309
6310int main(int argc, char *argv[])
6311{
6312 FILE *fout, *fasm, *frlist;
6313 struct parsed_data *pd = NULL;
6314 int pd_alloc = 0;
6315 char **rlist = NULL;
6316 int rlist_len = 0;
6317 int rlist_alloc = 0;
6318 int func_chunks_used = 0;
6319 int func_chunks_sorted = 0;
6320 int func_chunk_i = -1;
6321 long func_chunk_ret = 0;
6322 int func_chunk_ret_ln = 0;
6323 int scanned_ahead = 0;
6324 char line[256];
6325 char words[20][256];
6326 enum opr_lenmod lmod;
6327 char *sctproto = NULL;
6328 int in_func = 0;
6329 int pending_endp = 0;
6330 int skip_func = 0;
6331 int skip_warned = 0;
6332 int eq_alloc;
6333 int verbose = 0;
6334 int multi_seg = 0;
6335 int end = 0;
6336 int arg_out;
6337 int arg;
6338 int pi = 0;
6339 int i, j;
6340 int ret, len;
6341 char *p;
6342 int wordc;
6343
6344 for (arg = 1; arg < argc; arg++) {
6345 if (IS(argv[arg], "-v"))
6346 verbose = 1;
6347 else if (IS(argv[arg], "-rf"))
6348 g_allow_regfunc = 1;
6349 else if (IS(argv[arg], "-m"))
6350 multi_seg = 1;
6351 else if (IS(argv[arg], "-hdr"))
6352 g_header_mode = g_quiet_pp = g_allow_regfunc = 1;
6353 else
6354 break;
6355 }
6356
6357 if (argc < arg + 3) {
6358 printf("usage:\n%s [-v] [-rf] [-m] <.c> <.asm> <hdrf> [rlist]*\n"
6359 "%s -hdr <out.h> <.asm> <seed.h> [rlist]*\n",
6360 argv[0], argv[0]);
6361 return 1;
6362 }
6363
6364 arg_out = arg++;
6365
6366 asmfn = argv[arg++];
6367 fasm = fopen(asmfn, "r");
6368 my_assert_not(fasm, NULL);
6369
6370 hdrfn = argv[arg++];
6371 g_fhdr = fopen(hdrfn, "r");
6372 my_assert_not(g_fhdr, NULL);
6373
6374 rlist_alloc = 64;
6375 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
6376 my_assert_not(rlist, NULL);
6377 // needs special handling..
6378 rlist[rlist_len++] = "__alloca_probe";
6379
6380 func_chunk_alloc = 32;
6381 func_chunks = malloc(func_chunk_alloc * sizeof(func_chunks[0]));
6382 my_assert_not(func_chunks, NULL);
6383
6384 memset(words, 0, sizeof(words));
6385
6386 for (; arg < argc; arg++) {
6387 frlist = fopen(argv[arg], "r");
6388 my_assert_not(frlist, NULL);
6389
6390 while (my_fgets(line, sizeof(line), frlist)) {
6391 p = sskip(line);
6392 if (*p == 0 || *p == ';')
6393 continue;
6394 if (*p == '#') {
6395 if (IS_START(p, "#if 0")
6396 || (g_allow_regfunc && IS_START(p, "#if NO_REGFUNC")))
6397 {
6398 skip_func = 1;
6399 }
6400 else if (IS_START(p, "#endif"))
6401 skip_func = 0;
6402 continue;
6403 }
6404 if (skip_func)
6405 continue;
6406
6407 p = next_word(words[0], sizeof(words[0]), p);
6408 if (words[0][0] == 0)
6409 continue;
6410
6411 if (rlist_len >= rlist_alloc) {
6412 rlist_alloc = rlist_alloc * 2 + 64;
6413 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
6414 my_assert_not(rlist, NULL);
6415 }
6416 rlist[rlist_len++] = strdup(words[0]);
6417 }
6418 skip_func = 0;
6419
6420 fclose(frlist);
6421 frlist = NULL;
6422 }
6423
6424 if (rlist_len > 0)
6425 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
6426
6427 fout = fopen(argv[arg_out], "w");
6428 my_assert_not(fout, NULL);
6429
6430 eq_alloc = 128;
6431 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
6432 my_assert_not(g_eqs, NULL);
6433
6434 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
6435 g_label_refs[i].i = -1;
6436 g_label_refs[i].next = NULL;
6437 }
6438
6439 if (g_header_mode)
6440 scan_variables(fasm);
6441
6442 while (my_fgets(line, sizeof(line), fasm))
6443 {
6444 wordc = 0;
6445 asmln++;
6446
6447 p = sskip(line);
6448 if (*p == 0)
6449 continue;
6450
6451 // get rid of random tabs
6452 for (i = 0; line[i] != 0; i++)
6453 if (line[i] == '\t')
6454 line[i] = ' ';
6455
6456 if (*p == ';')
6457 {
6458 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
6459 goto do_pending_endp; // eww..
6460
6461 if (p[2] == 'A' && IS_START(p, "; Attributes:"))
6462 {
6463 static const char *attrs[] = {
6464 "bp-based frame",
6465 "library function",
6466 "static",
6467 "noreturn",
6468 "thunk",
6469 "fpd=",
6470 };
6471
6472 // parse IDA's attribute-list comment
6473 g_ida_func_attr = 0;
6474 p = sskip(p + 13);
6475
6476 for (; *p != 0; p = sskip(p)) {
6477 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
6478 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
6479 g_ida_func_attr |= 1 << i;
6480 p += strlen(attrs[i]);
6481 break;
6482 }
6483 }
6484 if (i == ARRAY_SIZE(attrs)) {
6485 anote("unparsed IDA attr: %s\n", p);
6486 break;
6487 }
6488 if (IS(attrs[i], "fpd=")) {
6489 p = next_word(words[0], sizeof(words[0]), p);
6490 // ignore for now..
6491 }
6492 }
6493 }
6494 else if (p[2] == 'S' && IS_START(p, "; START OF FUNCTION CHUNK FOR "))
6495 {
6496 p += 30;
6497 next_word(words[0], sizeof(words[0]), p);
6498 if (words[0][0] == 0)
6499 aerr("missing name for func chunk?\n");
6500
6501 if (!scanned_ahead) {
6502 add_func_chunk(fasm, words[0], asmln);
6503 func_chunks_sorted = 0;
6504 }
6505 }
6506 else if (p[2] == 'E' && IS_START(p, "; END OF FUNCTION CHUNK"))
6507 {
6508 if (func_chunk_i >= 0) {
6509 if (func_chunk_i < func_chunk_cnt
6510 && IS(func_chunks[func_chunk_i].name, g_func))
6511 {
6512 // move on to next chunk
6513 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
6514 if (ret)
6515 aerr("seek failed for '%s' chunk #%d\n",
6516 g_func, func_chunk_i);
6517 asmln = func_chunks[func_chunk_i].asmln;
6518 func_chunk_i++;
6519 }
6520 else {
6521 if (func_chunk_ret == 0)
6522 aerr("no return from chunk?\n");
6523 fseek(fasm, func_chunk_ret, SEEK_SET);
6524 asmln = func_chunk_ret_ln;
6525 func_chunk_ret = 0;
6526 pending_endp = 1;
6527 }
6528 }
6529 }
6530 else if (p[2] == 'F' && IS_START(p, "; FUNCTION CHUNK AT ")) {
6531 func_chunks_used = 1;
6532 p += 20;
6533 if (IS_START(g_func, "sub_")) {
6534 unsigned long addr = strtoul(p, NULL, 16);
6535 unsigned long f_addr = strtoul(g_func + 4, NULL, 16);
6536 if (addr > f_addr && !scanned_ahead) {
6537 anote("scan_ahead caused by '%s', addr %lx\n",
6538 g_func, addr);
6539 scan_ahead(fasm);
6540 scanned_ahead = 1;
6541 func_chunks_sorted = 0;
6542 }
6543 }
6544 }
6545 continue;
6546 } // *p == ';'
6547
6548parse_words:
6549 for (i = wordc; i < ARRAY_SIZE(words); i++)
6550 words[i][0] = 0;
6551 for (wordc = 0; wordc < ARRAY_SIZE(words); wordc++) {
6552 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
6553 if (*p == 0 || *p == ';') {
6554 wordc++;
6555 break;
6556 }
6557 }
6558 if (*p != 0 && *p != ';')
6559 aerr("too many words\n");
6560
6561 // alow asm patches in comments
6562 if (*p == ';') {
6563 if (IS_START(p, "; sctpatch:")) {
6564 p = sskip(p + 11);
6565 if (*p == 0 || *p == ';')
6566 continue;
6567 goto parse_words; // lame
6568 }
6569 if (IS_START(p, "; sctproto:")) {
6570 sctproto = strdup(p + 11);
6571 }
6572 else if (IS_START(p, "; sctend")) {
6573 end = 1;
6574 if (!pending_endp)
6575 break;
6576 }
6577 }
6578
6579 if (wordc == 0) {
6580 // shouldn't happen
6581 awarn("wordc == 0?\n");
6582 continue;
6583 }
6584
6585 // don't care about this:
6586 if (words[0][0] == '.'
6587 || IS(words[0], "include")
6588 || IS(words[0], "assume") || IS(words[1], "segment")
6589 || IS(words[0], "align"))
6590 {
6591 continue;
6592 }
6593
6594do_pending_endp:
6595 // do delayed endp processing to collect switch jumptables
6596 if (pending_endp) {
6597 if (in_func && !skip_func && !end && wordc >= 2
6598 && ((words[0][0] == 'd' && words[0][2] == 0)
6599 || (words[1][0] == 'd' && words[1][2] == 0)))
6600 {
6601 i = 1;
6602 if (words[1][0] == 'd' && words[1][2] == 0) {
6603 // label
6604 if (g_func_pd_cnt >= pd_alloc) {
6605 pd_alloc = pd_alloc * 2 + 16;
6606 g_func_pd = realloc(g_func_pd,
6607 sizeof(g_func_pd[0]) * pd_alloc);
6608 my_assert_not(g_func_pd, NULL);
6609 }
6610 pd = &g_func_pd[g_func_pd_cnt];
6611 g_func_pd_cnt++;
6612 memset(pd, 0, sizeof(*pd));
6613 strcpy(pd->label, words[0]);
6614 pd->type = OPT_CONST;
6615 pd->lmod = lmod_from_directive(words[1]);
6616 i = 2;
6617 }
6618 else {
6619 if (pd == NULL) {
6620 if (verbose)
6621 anote("skipping alignment byte?\n");
6622 continue;
6623 }
6624 lmod = lmod_from_directive(words[0]);
6625 if (lmod != pd->lmod)
6626 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
6627 }
6628
6629 if (pd->count_alloc < pd->count + wordc) {
6630 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
6631 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
6632 my_assert_not(pd->d, NULL);
6633 }
6634 for (; i < wordc; i++) {
6635 if (IS(words[i], "offset")) {
6636 pd->type = OPT_OFFSET;
6637 i++;
6638 }
6639 p = strchr(words[i], ',');
6640 if (p != NULL)
6641 *p = 0;
6642 if (pd->type == OPT_OFFSET)
6643 pd->d[pd->count].u.label = strdup(words[i]);
6644 else
6645 pd->d[pd->count].u.val = parse_number(words[i]);
6646 pd->d[pd->count].bt_i = -1;
6647 pd->count++;
6648 }
6649 continue;
6650 }
6651
6652 if (in_func && !skip_func) {
6653 if (g_header_mode)
6654 gen_hdr(g_func, pi);
6655 else
6656 gen_func(fout, g_fhdr, g_func, pi);
6657 }
6658
6659 pending_endp = 0;
6660 in_func = 0;
6661 g_ida_func_attr = 0;
6662 skip_warned = 0;
6663 skip_func = 0;
6664 g_func[0] = 0;
6665 func_chunks_used = 0;
6666 func_chunk_i = -1;
6667 if (pi != 0) {
6668 memset(&ops, 0, pi * sizeof(ops[0]));
6669 clear_labels(pi);
6670 pi = 0;
6671 }
6672 g_eqcnt = 0;
6673 for (i = 0; i < g_func_pd_cnt; i++) {
6674 pd = &g_func_pd[i];
6675 if (pd->type == OPT_OFFSET) {
6676 for (j = 0; j < pd->count; j++)
6677 free(pd->d[j].u.label);
6678 }
6679 free(pd->d);
6680 pd->d = NULL;
6681 }
6682 g_func_pd_cnt = 0;
6683 pd = NULL;
6684
6685 if (end)
6686 break;
6687 if (wordc == 0)
6688 continue;
6689 }
6690
6691 if (IS(words[1], "proc")) {
6692 if (in_func)
6693 aerr("proc '%s' while in_func '%s'?\n",
6694 words[0], g_func);
6695 p = words[0];
6696 if (bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
6697 skip_func = 1;
6698 strcpy(g_func, words[0]);
6699 set_label(0, words[0]);
6700 in_func = 1;
6701 continue;
6702 }
6703
6704 if (IS(words[1], "endp"))
6705 {
6706 if (!in_func)
6707 aerr("endp '%s' while not in_func?\n", words[0]);
6708 if (!IS(g_func, words[0]))
6709 aerr("endp '%s' while in_func '%s'?\n",
6710 words[0], g_func);
6711
6712 if ((g_ida_func_attr & IDAFA_THUNK) && pi == 1
6713 && ops[0].op == OP_JMP && ops[0].operand[0].had_ds)
6714 {
6715 // import jump
6716 skip_func = 1;
6717 }
6718
6719 if (!skip_func && func_chunks_used) {
6720 // start processing chunks
6721 struct chunk_item *ci, key = { g_func, 0 };
6722
6723 func_chunk_ret = ftell(fasm);
6724 func_chunk_ret_ln = asmln;
6725 if (!func_chunks_sorted) {
6726 qsort(func_chunks, func_chunk_cnt,
6727 sizeof(func_chunks[0]), cmp_chunks);
6728 func_chunks_sorted = 1;
6729 }
6730 ci = bsearch(&key, func_chunks, func_chunk_cnt,
6731 sizeof(func_chunks[0]), cmp_chunks);
6732 if (ci == NULL)
6733 aerr("'%s' needs chunks, but none found\n", g_func);
6734 func_chunk_i = ci - func_chunks;
6735 for (; func_chunk_i > 0; func_chunk_i--)
6736 if (!IS(func_chunks[func_chunk_i - 1].name, g_func))
6737 break;
6738
6739 ret = fseek(fasm, func_chunks[func_chunk_i].fptr, SEEK_SET);
6740 if (ret)
6741 aerr("seek failed for '%s' chunk #%d\n", g_func, func_chunk_i);
6742 asmln = func_chunks[func_chunk_i].asmln;
6743 func_chunk_i++;
6744 continue;
6745 }
6746 pending_endp = 1;
6747 continue;
6748 }
6749
6750 if (wordc == 2 && IS(words[1], "ends")) {
6751 if (!multi_seg) {
6752 end = 1;
6753 if (pending_endp)
6754 goto do_pending_endp;
6755 break;
6756 }
6757
6758 // scan for next text segment
6759 while (my_fgets(line, sizeof(line), fasm)) {
6760 asmln++;
6761 p = sskip(line);
6762 if (*p == 0 || *p == ';')
6763 continue;
6764
6765 if (strstr(p, "segment para public 'CODE' use32"))
6766 break;
6767 }
6768
6769 continue;
6770 }
6771
6772 p = strchr(words[0], ':');
6773 if (p != NULL) {
6774 set_label(pi, words[0]);
6775 continue;
6776 }
6777
6778 if (!in_func || skip_func) {
6779 if (!skip_warned && !skip_func && g_labels[pi] != NULL) {
6780 if (verbose)
6781 anote("skipping from '%s'\n", g_labels[pi]);
6782 skip_warned = 1;
6783 }
6784 free(g_labels[pi]);
6785 g_labels[pi] = NULL;
6786 continue;
6787 }
6788
6789 if (wordc > 1 && IS(words[1], "="))
6790 {
6791 if (wordc != 5)
6792 aerr("unhandled equ, wc=%d\n", wordc);
6793 if (g_eqcnt >= eq_alloc) {
6794 eq_alloc *= 2;
6795 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
6796 my_assert_not(g_eqs, NULL);
6797 }
6798
6799 len = strlen(words[0]);
6800 if (len > sizeof(g_eqs[0].name) - 1)
6801 aerr("equ name too long: %d\n", len);
6802 strcpy(g_eqs[g_eqcnt].name, words[0]);
6803
6804 if (!IS(words[3], "ptr"))
6805 aerr("unhandled equ\n");
6806 if (IS(words[2], "dword"))
6807 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
6808 else if (IS(words[2], "word"))
6809 g_eqs[g_eqcnt].lmod = OPLM_WORD;
6810 else if (IS(words[2], "byte"))
6811 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
6812 else if (IS(words[2], "qword"))
6813 g_eqs[g_eqcnt].lmod = OPLM_QWORD;
6814 else
6815 aerr("bad lmod: '%s'\n", words[2]);
6816
6817 g_eqs[g_eqcnt].offset = parse_number(words[4]);
6818 g_eqcnt++;
6819 continue;
6820 }
6821
6822 if (pi >= ARRAY_SIZE(ops))
6823 aerr("too many ops\n");
6824
6825 parse_op(&ops[pi], words, wordc);
6826
6827 if (sctproto != NULL) {
6828 if (ops[pi].op == OP_CALL || ops[pi].op == OP_JMP)
6829 ops[pi].datap = sctproto;
6830 sctproto = NULL;
6831 }
6832 pi++;
6833 }
6834
6835 if (g_header_mode)
6836 output_hdr(fout);
6837
6838 fclose(fout);
6839 fclose(fasm);
6840 fclose(g_fhdr);
6841
6842 return 0;
6843}
6844
6845// vim:ts=2:shiftwidth=2:expandtab
Unnamed repository; edit this file 'description' to name the repository.