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