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