notaz.gp2x.de / ia32rtools.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
improved type handling and cast generation
[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 = "";
4c45fa73 1152 char ofs_reg[16] = { 0, };
91977a1c 1153 struct parsed_equ *eq;
1154 int i, arg_i, arg_s;
d4e3b5db 1155 const char *bp_arg;
1156 int stack_ra = 0;
39b168b8 1157 int offset = 0;
850c9265 1158 int sf_ofs;
91977a1c 1159
4c45fa73 1160 bp_arg = parse_stack_el(name, ofs_reg);
91977a1c 1161 snprintf(g_comment, sizeof(g_comment), "%s", bp_arg);
39b168b8 1162 eq = equ_find(po, bp_arg, &offset);
d4e3b5db 1163 if (eq == NULL)
1164 ferr(po, "detected but missing eq\n");
91977a1c 1165
39b168b8 1166 offset += eq->offset;
1167
d4e3b5db 1168 if (!strncmp(name, "ebp", 3))
1169 stack_ra = 4;
1170
39b168b8 1171 if (stack_ra <= offset && offset < stack_ra + 4)
1172 ferr(po, "reference to ra? %d %d\n", offset, stack_ra);
d4e3b5db 1173
39b168b8 1174 if (offset > stack_ra) {
1175 arg_i = (offset - stack_ra - 4) / 4;
91977a1c 1176 if (arg_i < 0 || arg_i >= g_func_pp.argc_stack)
1bafb621 1177 ferr(po, "offset %d (%s) doesn't map to any arg\n",
39b168b8 1178 offset, bp_arg);
4c45fa73 1179 if (ofs_reg[0] != 0)
7ba45c34 1180 ferr(po, "offset reg on arg access?\n");
91977a1c 1181
1182 for (i = arg_s = 0; i < g_func_pp.argc; i++) {
1183 if (g_func_pp.arg[i].reg != NULL)
1184 continue;
1185 if (arg_s == arg_i)
1186 break;
1187 arg_s++;
1188 }
1189 if (i == g_func_pp.argc)
1190 ferr(po, "arg %d not in prototype?\n", arg_i);
850c9265 1191 if (is_lea)
1192 ferr(po, "lea to arg?\n");
1193
7ba45c34 1194 switch (lmod)
1195 {
1196 case OPLM_BYTE:
1197 if (is_src && (offset & 3) == 0)
1198 snprintf(buf, buf_size, "(u8)a%d", i + 1);
1199 else
1200 snprintf(buf, buf_size, "BYTE%d(a%d)", offset & 3, i + 1);
1201 break;
1202
1203 case OPLM_WORD:
1204 if (offset & 1)
1205 ferr(po, "unaligned arg access\n");
1206 if (is_src && (offset & 2) == 0)
1207 snprintf(buf, buf_size, "(u16)a%d", i + 1);
1208 else
1209 snprintf(buf, buf_size, "%sWORD(a%d)",
1210 (offset & 2) ? "HI" : "LO", i + 1);
1211 break;
1212
1213 case OPLM_DWORD:
1214 if (offset & 3)
1215 ferr(po, "unaligned arg access\n");
3ebea2cf 1216 if (cast[0])
1217 prefix = cast;
1218 else if (is_src)
1219 prefix = "(u32)";
1220 snprintf(buf, buf_size, "%sa%d", prefix, i + 1);
7ba45c34 1221 break;
1222
1223 default:
1224 ferr(po, "bp_arg bad lmod: %d\n", lmod);
1225 }
1226
1227 // common problem
3ebea2cf 1228 guess_lmod_from_c_type(&tmp_lmod, &g_func_pp.arg[i].type);
1229 if ((offset & 3) && tmp_lmod != OPLM_DWORD)
7ba45c34 1230 ferr(po, "bp_arg arg/w offset %d and type '%s'\n",
3ebea2cf 1231 offset, g_func_pp.arg[i].type.name);
91977a1c 1232 }
1233 else {
1bafb621 1234 if (g_stack_fsz == 0)
1235 ferr(po, "stack var access without stackframe\n");
850c9265 1236
39b168b8 1237 sf_ofs = g_stack_fsz + offset;
850c9265 1238 if (sf_ofs < 0)
39b168b8 1239 ferr(po, "bp_stack offset %d/%d\n", offset, g_stack_fsz);
850c9265 1240
1241 if (is_lea)
33c35af6 1242 prefix = "(u32)&";
3ebea2cf 1243 else
1244 prefix = cast;
850c9265 1245
1246 switch (lmod)
1247 {
1248 case OPLM_BYTE:
7ba45c34 1249 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1250 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
850c9265 1251 break;
7ba45c34 1252
850c9265 1253 case OPLM_WORD:
7ba45c34 1254 if ((sf_ofs & 1) || ofs_reg[0] != 0) {
1255 // known unaligned or possibly unaligned
1256 strcat(g_comment, " unaligned");
1257 if (prefix[0] == 0)
1258 prefix = "*(u16 *)&";
1259 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1260 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1261 break;
1262 }
1263 snprintf(buf, buf_size, "%ssf.w[%d]", prefix, sf_ofs / 2);
850c9265 1264 break;
7ba45c34 1265
850c9265 1266 case OPLM_DWORD:
7ba45c34 1267 if ((sf_ofs & 3) || ofs_reg[0] != 0) {
1268 // known unaligned or possibly unaligned
1269 strcat(g_comment, " unaligned");
1270 if (prefix[0] == 0)
1271 prefix = "*(u32 *)&";
1272 snprintf(buf, buf_size, "%ssf.b[%d%s%s]",
1273 prefix, sf_ofs, ofs_reg[0] ? "+" : "", ofs_reg);
1274 break;
1275 }
1276 snprintf(buf, buf_size, "%ssf.d[%d]", prefix, sf_ofs / 4);
850c9265 1277 break;
7ba45c34 1278
850c9265 1279 default:
1280 ferr(po, "bp_stack bad lmod: %d\n", lmod);
1281 }
91977a1c 1282 }
1283}
c36e914d 1284
3ebea2cf 1285static void check_label_read_ref(struct parsed_op *po, const char *name)
1286{
1287 if (IS_START(name, "sub_"))
1288 ferr(po, "func reference?\n");
1289}
1290
91977a1c 1291static char *out_src_opr(char *buf, size_t buf_size,
3ebea2cf 1292 struct parsed_op *po, struct parsed_opr *popr, const char *cast,
1293 int is_lea)
91977a1c 1294{
850c9265 1295 char tmp1[256], tmp2[256];
1296 char expr[256];
1297 int ret;
1298
3ebea2cf 1299 if (cast == NULL)
1300 cast = "";
1301
91977a1c 1302 switch (popr->type) {
1303 case OPT_REG:
850c9265 1304 if (is_lea)
1305 ferr(po, "lea from reg?\n");
1306
91977a1c 1307 switch (popr->lmod) {
1308 case OPLM_DWORD:
3ebea2cf 1309 snprintf(buf, buf_size, "%s%s", cast, opr_reg_p(po, popr));
91977a1c 1310 break;
850c9265 1311 case OPLM_WORD:
1312 snprintf(buf, buf_size, "(u16)%s", opr_reg_p(po, popr));
1313 break;
1314 case OPLM_BYTE:
5101a5f9 1315 if (popr->name[1] == 'h') // XXX..
1316 snprintf(buf, buf_size, "(u8)(%s >> 8)", opr_reg_p(po, popr));
1317 else
1318 snprintf(buf, buf_size, "(u8)%s", opr_reg_p(po, popr));
850c9265 1319 break;
91977a1c 1320 default:
1321 ferr(po, "invalid src lmod: %d\n", popr->lmod);
1322 }
1323 break;
850c9265 1324
91977a1c 1325 case OPT_REGMEM:
4c45fa73 1326 if (parse_stack_el(popr->name, NULL)) {
1bafb621 1327 stack_frame_access(po, popr->lmod, buf, buf_size,
3ebea2cf 1328 popr->name, cast, 1, is_lea);
91977a1c 1329 break;
1330 }
850c9265 1331
1332 strcpy(expr, popr->name);
1333 if (strchr(expr, '[')) {
1334 // special case: '[' can only be left for label[reg] form
1335 ret = sscanf(expr, "%[^[][%[^]]]", tmp1, tmp2);
1336 if (ret != 2)
1337 ferr(po, "parse failure for '%s'\n", expr);
33c35af6 1338 snprintf(expr, sizeof(expr), "(u32)&%s + %s", tmp1, tmp2);
850c9265 1339 }
1340
1341 // XXX: do we need more parsing?
1342 if (is_lea) {
1343 snprintf(buf, buf_size, "%s", expr);
1344 break;
1345 }
1346
3ebea2cf 1347 if (cast[0] == 0)
1348 cast = lmod_cast_u_ptr(po, popr->lmod);
1349 snprintf(buf, buf_size, "%s(%s)", cast, expr);
91977a1c 1350 break;
850c9265 1351
91977a1c 1352 case OPT_LABEL:
3ebea2cf 1353 check_label_read_ref(po, popr->name);
1354 if (cast[0] == 0 && popr->is_ptr)
1355 cast = "(u32)";
850c9265 1356 if (is_lea)
1357 snprintf(buf, buf_size, "(u32)&%s", popr->name);
1358 else
3ebea2cf 1359 snprintf(buf, buf_size, "%s%s%s", cast, popr->name,
7ba45c34 1360 popr->is_array ? "[0]" : "");
850c9265 1361 break;
1362
1363 case OPT_OFFSET:
3ebea2cf 1364 check_label_read_ref(po, popr->name);
1365 if (cast[0] == 0)
1366 cast = "(u32)";
850c9265 1367 if (is_lea)
1368 ferr(po, "lea an offset?\n");
3ebea2cf 1369 snprintf(buf, buf_size, "%s&%s", cast, popr->name);
91977a1c 1370 break;
850c9265 1371
91977a1c 1372 case OPT_CONST:
850c9265 1373 if (is_lea)
1374 ferr(po, "lea from const?\n");
1375
3ebea2cf 1376 snprintf(buf, buf_size, "%s", cast);
1377 ret = strlen(buf);
1378 printf_number(buf + ret, buf_size - ret, popr->val);
91977a1c 1379 break;
850c9265 1380
91977a1c 1381 default:
1382 ferr(po, "invalid src type: %d\n", popr->type);
1383 }
1384
1385 return buf;
1386}
c36e914d 1387
91977a1c 1388static char *out_dst_opr(char *buf, size_t buf_size,
1389 struct parsed_op *po, struct parsed_opr *popr)
1390{
1391 switch (popr->type) {
1392 case OPT_REG:
1393 switch (popr->lmod) {
1394 case OPLM_DWORD:
1395 snprintf(buf, buf_size, "%s", opr_reg_p(po, popr));
1396 break;
850c9265 1397 case OPLM_WORD:
1398 // ugh..
1399 snprintf(buf, buf_size, "LOWORD(%s)", opr_reg_p(po, popr));
1400 break;
1401 case OPLM_BYTE:
1402 // ugh..
5101a5f9 1403 if (popr->name[1] == 'h') // XXX..
1404 snprintf(buf, buf_size, "BYTE1(%s)", opr_reg_p(po, popr));
1405 else
1406 snprintf(buf, buf_size, "LOBYTE(%s)", opr_reg_p(po, popr));
850c9265 1407 break;
91977a1c 1408 default:
1409 ferr(po, "invalid dst lmod: %d\n", popr->lmod);
1410 }
1411 break;
850c9265 1412
1413 case OPT_REGMEM:
4c45fa73 1414 if (parse_stack_el(popr->name, NULL)) {
1bafb621 1415 stack_frame_access(po, popr->lmod, buf, buf_size,
3ebea2cf 1416 popr->name, "", 0, 0);
850c9265 1417 break;
1418 }
1419
3ebea2cf 1420 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
850c9265 1421
bfa4a6ee 1422 case OPT_LABEL:
7ba45c34 1423 snprintf(buf, buf_size, "%s%s", popr->name,
1424 popr->is_array ? "[0]" : "");
bfa4a6ee 1425 break;
1426
91977a1c 1427 default:
1428 ferr(po, "invalid dst type: %d\n", popr->type);
1429 }
1430
1431 return buf;
1432}
c36e914d 1433
3ebea2cf 1434static char *out_src_opr_u32(char *buf, size_t buf_size,
1435 struct parsed_op *po, struct parsed_opr *popr)
1436{
1437 return out_src_opr(buf, buf_size, po, popr, NULL, 0);
1438}
1439
69a3cdfc 1440static enum parsed_flag_op split_cond(struct parsed_op *po,
940e8e66 1441 enum op_op op, int *is_inv)
91977a1c 1442{
940e8e66 1443 *is_inv = 0;
91977a1c 1444
69a3cdfc 1445 switch (op) {
1446 case OP_JO:
1447 return PFO_O;
1448 case OP_JC:
1449 return PFO_C;
1450 case OP_JZ:
1451 return PFO_Z;
1452 case OP_JBE:
1453 return PFO_BE;
1454 case OP_JS:
1455 return PFO_S;
1456 case OP_JP:
1457 return PFO_P;
1458 case OP_JL:
1459 return PFO_L;
1460 case OP_JLE:
1461 return PFO_LE;
1462
91977a1c 1463 case OP_JNO:
940e8e66 1464 *is_inv = 1;
69a3cdfc 1465 return PFO_O;
91977a1c 1466 case OP_JNC:
940e8e66 1467 *is_inv = 1;
69a3cdfc 1468 return PFO_C;
91977a1c 1469 case OP_JNZ:
940e8e66 1470 *is_inv = 1;
69a3cdfc 1471 return PFO_Z;
1472 case OP_JA:
940e8e66 1473 *is_inv = 1;
69a3cdfc 1474 return PFO_BE;
91977a1c 1475 case OP_JNS:
940e8e66 1476 *is_inv = 1;
69a3cdfc 1477 return PFO_S;
91977a1c 1478 case OP_JNP:
940e8e66 1479 *is_inv = 1;
69a3cdfc 1480 return PFO_P;
850c9265 1481 case OP_JGE:
940e8e66 1482 *is_inv = 1;
69a3cdfc 1483 return PFO_L;
91977a1c 1484 case OP_JG:
940e8e66 1485 *is_inv = 1;
69a3cdfc 1486 return PFO_LE;
1487
1488 case OP_ADC:
1489 case OP_SBB:
1490 return PFO_C;
1491
91977a1c 1492 default:
69a3cdfc 1493 ferr(po, "split_cond: bad op %d\n", op);
1494 return -1;
91977a1c 1495 }
1496}
c36e914d 1497
91977a1c 1498static void out_test_for_cc(char *buf, size_t buf_size,
940e8e66 1499 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
69a3cdfc 1500 enum opr_lenmod lmod, const char *expr)
91977a1c 1501{
69a3cdfc 1502 const char *cast, *scast;
91977a1c 1503
69a3cdfc 1504 cast = lmod_cast_u(po, lmod);
1505 scast = lmod_cast_s(po, lmod);
1506
1507 switch (pfo) {
1508 case PFO_Z:
87bf6cec 1509 case PFO_BE: // CF=1||ZF=1; CF=0
850c9265 1510 snprintf(buf, buf_size, "(%s%s %s 0)",
940e8e66 1511 cast, expr, is_inv ? "!=" : "==");
91977a1c 1512 break;
850c9265 1513
5101a5f9 1514 case PFO_S:
1515 case PFO_L: // SF!=OF; OF=0
1516 snprintf(buf, buf_size, "(%s%s %s 0)",
940e8e66 1517 scast, expr, is_inv ? ">=" : "<");
5101a5f9 1518 break;
1519
87bf6cec 1520 case PFO_LE: // ZF=1||SF!=OF; OF=0
69a3cdfc 1521 snprintf(buf, buf_size, "(%s%s %s 0)",
940e8e66 1522 scast, expr, is_inv ? ">" : "<=");
850c9265 1523 break;
1524
91977a1c 1525 default:
69a3cdfc 1526 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
91977a1c 1527 }
1528}
c36e914d 1529
850c9265 1530static void out_cmp_for_cc(char *buf, size_t buf_size,
940e8e66 1531 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv,
69a3cdfc 1532 enum opr_lenmod lmod, const char *expr1, const char *expr2)
850c9265 1533{
69a3cdfc 1534 const char *cast, *scast;
850c9265 1535
69a3cdfc 1536 cast = lmod_cast_u(po, lmod);
1537 scast = lmod_cast_s(po, lmod);
850c9265 1538
69a3cdfc 1539 switch (pfo) {
5101a5f9 1540 case PFO_C:
1541 // note: must be unsigned compare
1542 snprintf(buf, buf_size, "(%s%s %s %s%s)",
940e8e66 1543 cast, expr1, is_inv ? ">=" : "<", cast, expr2);
5101a5f9 1544 break;
1545
69a3cdfc 1546 case PFO_Z:
850c9265 1547 snprintf(buf, buf_size, "(%s%s %s %s%s)",
940e8e66 1548 cast, expr1, is_inv ? "!=" : "==", cast, expr2);
850c9265 1549 break;
1550
5101a5f9 1551 case PFO_BE: // !a
850c9265 1552 // note: must be unsigned compare
1553 snprintf(buf, buf_size, "(%s%s %s %s%s)",
940e8e66 1554 cast, expr1, is_inv ? ">" : "<=", cast, expr2);
5101a5f9 1555 break;
1556
1557 // note: must be signed compare
1558 case PFO_S:
1559 snprintf(buf, buf_size, "(%s(%s - %s) %s 0)",
940e8e66 1560 scast, expr1, expr2, is_inv ? ">=" : "<");
850c9265 1561 break;
1562
5101a5f9 1563 case PFO_L: // !ge
850c9265 1564 snprintf(buf, buf_size, "(%s%s %s %s%s)",
940e8e66 1565 scast, expr1, is_inv ? ">=" : "<", scast, expr2);
850c9265 1566 break;
1567
5101a5f9 1568 case PFO_LE:
1569 snprintf(buf, buf_size, "(%s%s %s %s%s)",
940e8e66 1570 scast, expr1, is_inv ? ">" : "<=", scast, expr2);
5101a5f9 1571 break;
1572
850c9265 1573 default:
69a3cdfc 1574 ferr(po, "%s: unhandled parsed_flag_op: %d\n", __func__, pfo);
850c9265 1575 }
1576}
1577
69a3cdfc 1578static void out_cmp_test(char *buf, size_t buf_size,
940e8e66 1579 struct parsed_op *po, enum parsed_flag_op pfo, int is_inv)
69a3cdfc 1580{
1581 char buf1[256], buf2[256], buf3[256];
1582
1583 if (po->op == OP_TEST) {
1584 if (IS(opr_name(po, 0), opr_name(po, 1))) {
3ebea2cf 1585 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[0]);
69a3cdfc 1586 }
1587 else {
3ebea2cf 1588 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
1589 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]);
69a3cdfc 1590 snprintf(buf3, sizeof(buf3), "(%s & %s)", buf1, buf2);
1591 }
940e8e66 1592 out_test_for_cc(buf, buf_size, po, pfo, is_inv,
69a3cdfc 1593 po->operand[0].lmod, buf3);
1594 }
1595 else if (po->op == OP_CMP) {
3ebea2cf 1596 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
1597 out_src_opr_u32(buf3, sizeof(buf3), po, &po->operand[1]);
940e8e66 1598 out_cmp_for_cc(buf, buf_size, po, pfo, is_inv,
69a3cdfc 1599 po->operand[0].lmod, buf2, buf3);
1600 }
1601 else
1602 ferr(po, "%s: unhandled op: %d\n", __func__, po->op);
1603}
1604
850c9265 1605static void propagate_lmod(struct parsed_op *po, struct parsed_opr *popr1,
91977a1c 1606 struct parsed_opr *popr2)
1607{
1608 if (popr1->lmod == OPLM_UNSPEC && popr2->lmod == OPLM_UNSPEC)
1609 ferr(po, "missing lmod for both operands\n");
1610
1611 if (popr1->lmod == OPLM_UNSPEC)
1612 popr1->lmod = popr2->lmod;
1613 else if (popr2->lmod == OPLM_UNSPEC)
1614 popr2->lmod = popr1->lmod;
1615 else if (popr1->lmod != popr2->lmod)
1616 ferr(po, "conflicting lmods: %d vs %d\n", popr1->lmod, popr2->lmod);
1617}
c36e914d 1618
850c9265 1619static const char *op_to_c(struct parsed_op *po)
1620{
1621 switch (po->op)
1622 {
1623 case OP_ADD:
5101a5f9 1624 case OP_ADC:
850c9265 1625 return "+";
1626 case OP_SUB:
5101a5f9 1627 case OP_SBB:
850c9265 1628 return "-";
1629 case OP_AND:
1630 return "&";
1631 case OP_OR:
1632 return "|";
1633 case OP_XOR:
1634 return "^";
1635 case OP_SHL:
1636 return "<<";
1637 case OP_SHR:
1638 return ">>";
1639 case OP_MUL:
1640 case OP_IMUL:
1641 return "*";
1642 default:
1643 ferr(po, "op_to_c was supplied with %d\n", po->op);
1644 }
1645}
1646
d4e3b5db 1647static void set_flag_no_dup(struct parsed_op *po, enum op_flags flag,
1648 enum op_flags flag_check)
1649{
1650 if (po->flags & flag)
1651 ferr(po, "flag %x already set\n", flag);
1652 if (po->flags & flag_check)
1653 ferr(po, "flag_check %x already set\n", flag_check);
1654
1655 po->flags |= flag;
1656}
1657
87bf6cec 1658static int scan_for_pop(int i, int opcnt, const char *reg,
d4e3b5db 1659 int magic, int depth, int *maxdepth, int do_flags)
850c9265 1660{
87bf6cec 1661 struct parsed_op *po;
1662 int ret = 0;
4c45fa73 1663 int j;
87bf6cec 1664
850c9265 1665 for (; i < opcnt; i++) {
87bf6cec 1666 po = &ops[i];
1667 if (po->cc_scratch == magic)
1668 break; // already checked
1669 po->cc_scratch = magic;
1670
1671 if (po->flags & OPF_TAIL)
1672 return -1; // deadend
1673
1bafb621 1674 if ((po->flags & OPF_RMD)
1675 || (po->op == OP_PUSH && po->argmask)) // arg push
850c9265 1676 continue;
1677
87bf6cec 1678 if ((po->flags & OPF_JMP) && po->op != OP_CALL) {
4c45fa73 1679 if (po->btj != NULL) {
1680 // jumptable
1681 for (j = 0; j < po->btj->count - 1; j++) {
1682 ret |= scan_for_pop(po->btj->d[j].bt_i, opcnt, reg, magic,
1683 depth, maxdepth, do_flags);
1684 if (ret < 0)
1685 return ret; // dead end
1686 }
1687 // follow last jumptable entry
1688 i = po->btj->d[j].bt_i - 1;
1689 continue;
1690 }
1691
87bf6cec 1692 if (po->bt_i < 0) {
1693 ferr(po, "dead branch\n");
1694 return -1;
1695 }
850c9265 1696
87bf6cec 1697 if (po->flags & OPF_CC) {
d4e3b5db 1698 ret |= scan_for_pop(po->bt_i, opcnt, reg, magic,
1699 depth, maxdepth, do_flags);
87bf6cec 1700 if (ret < 0)
1701 return ret; // dead end
1702 }
1703 else {
1704 i = po->bt_i - 1;
1705 }
1706 continue;
1707 }
1708
d4e3b5db 1709 if ((po->op == OP_POP || po->op == OP_PUSH)
1710 && po->operand[0].type == OPT_REG
87bf6cec 1711 && IS(po->operand[0].name, reg))
1712 {
d4e3b5db 1713 if (po->op == OP_PUSH) {
1714 depth++;
1715 if (depth > *maxdepth)
1716 *maxdepth = depth;
1717 if (do_flags)
1718 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1719 }
1720 else if (depth == 0) {
1721 if (do_flags)
1722 set_flag_no_dup(po, OPF_RMD, OPF_RSAVE);
1723 return 1;
1724 }
1725 else {
1726 depth--;
1727 if (depth < 0) // should not happen
1728 ferr(po, "fail with depth\n");
1729 if (do_flags)
1730 set_flag_no_dup(po, OPF_RSAVE, OPF_RMD);
1731 }
87bf6cec 1732 }
850c9265 1733 }
1734
87bf6cec 1735 return ret;
850c9265 1736}
1737
69a3cdfc 1738// scan for pop starting from 'ret' op (all paths)
d4e3b5db 1739static int scan_for_pop_ret(int i, int opcnt, const char *reg,
1740 int flag_set)
850c9265 1741{
1742 int found = 0;
1743 int j;
1744
1745 for (; i < opcnt; i++) {
87bf6cec 1746 if (!(ops[i].flags & OPF_TAIL))
850c9265 1747 continue;
1748
1749 for (j = i - 1; j >= 0; j--) {
69a3cdfc 1750 if (ops[j].flags & OPF_RMD)
1751 continue;
1752 if (ops[j].flags & OPF_JMP)
850c9265 1753 return -1;
1754
1755 if (ops[j].op == OP_POP && ops[j].operand[0].type == OPT_REG
1756 && IS(ops[j].operand[0].name, reg))
1757 {
1758 found = 1;
d4e3b5db 1759 ops[j].flags |= flag_set;
850c9265 1760 break;
1761 }
1762
1763 if (g_labels[j][0] != 0)
1764 return -1;
1765 }
1766 }
1767
1768 return found ? 0 : -1;
1769}
1770
5101a5f9 1771// is operand 'opr modified' by parsed_op 'po'?
1772static int is_opr_modified(const struct parsed_opr *opr,
69a3cdfc 1773 const struct parsed_op *po)
1774{
1775 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1776 return 0;
1777
1778 if (opr->type == OPT_REG && po->operand[0].type == OPT_REG) {
1779 if (po->regmask_dst & (1 << opr->reg))
1780 return 1;
1781 else
1782 return 0;
1783 }
1784
1785 return IS(po->operand[0].name, opr->name);
1786}
1787
5101a5f9 1788// is any operand of parsed_op 'po_test' modified by parsed_op 'po'?
1789static int is_any_opr_modified(const struct parsed_op *po_test,
1790 const struct parsed_op *po)
1791{
1792 int i;
1793
1794 if ((po->flags & OPF_RMD) || !(po->flags & OPF_DATA))
1795 return 0;
1796
1797 if (po_test->regmask_src & po->regmask_dst)
1798 return 1;
1799
1800 for (i = 0; i < po_test->operand_cnt; i++)
1801 if (IS(po_test->operand[i].name, po->operand[0].name))
1802 return 1;
1803
1804 return 0;
1805}
1806
940e8e66 1807// scan for any po_test operand modification in range given
5101a5f9 1808static int scan_for_mod(struct parsed_op *po_test, int i, int opcnt)
69a3cdfc 1809{
1810 for (; i < opcnt; i++) {
5101a5f9 1811 if (is_any_opr_modified(po_test, &ops[i]))
69a3cdfc 1812 return i;
1813 }
1814
1815 return -1;
1816}
1817
940e8e66 1818// scan for po_test operand[0] modification in range given
1819static int scan_for_mod_opr0(struct parsed_op *po_test,
1820 int i, int opcnt)
1821{
1822 for (; i < opcnt; i++) {
1823 if (is_opr_modified(&po_test->operand[0], &ops[i]))
1824 return i;
1825 }
1826
1827 return -1;
1828}
1829
5101a5f9 1830static int scan_for_flag_set(int i)
69a3cdfc 1831{
1832 for (; i >= 0; i--) {
1833 if (ops[i].flags & OPF_FLAGS)
1834 return i;
1835
1836 if ((ops[i].flags & OPF_JMP) && !(ops[i].flags & OPF_CC))
1837 return -1;
1838 if (g_labels[i][0] != 0)
1839 return -1;
1840 }
1841
1842 return -1;
1843}
1844
5101a5f9 1845// scan back for cdq, if anything modifies edx, fail
1846static int scan_for_cdq_edx(int i)
1847{
1848 for (; i >= 0; i--) {
1849 if (ops[i].op == OP_CDQ)
1850 return i;
1851
1852 if (ops[i].regmask_dst & (1 << xDX))
1853 return -1;
1854 if (g_labels[i][0] != 0)
1855 return -1;
1856 }
1857
1858 return -1;
1859}
1860
64c59faf 1861static int scan_for_reg_clear(int i, int reg)
1862{
1863 for (; i >= 0; i--) {
1864 if (ops[i].op == OP_XOR
1865 && ops[i].operand[0].lmod == OPLM_DWORD
1866 && ops[i].operand[0].reg == ops[i].operand[1].reg
1867 && ops[i].operand[0].reg == reg)
1868 return i;
1869
1870 if (ops[i].regmask_dst & (1 << reg))
1871 return -1;
1872 if (g_labels[i][0] != 0)
1873 return -1;
1874 }
1875
1876 return -1;
1877}
1878
1bafb621 1879// scan for positive, constant esp adjust
1880static int scan_for_esp_adjust(int i, int opcnt, int *adj)
1881{
7ba45c34 1882 struct parsed_op *po;
1883 *adj = 0;
1884
1bafb621 1885 for (; i < opcnt; i++) {
7ba45c34 1886 po = &ops[i];
1887
1888 if (po->op == OP_ADD && po->operand[0].reg == xSP) {
1889 if (po->operand[1].type != OPT_CONST)
1bafb621 1890 ferr(&ops[i], "non-const esp adjust?\n");
7ba45c34 1891 *adj += po->operand[1].val;
1bafb621 1892 if (*adj & 3)
1893 ferr(&ops[i], "unaligned esp adjust: %x\n", *adj);
1894 return i;
1895 }
7ba45c34 1896 else if (po->op == OP_PUSH)
1897 *adj -= lmod_bytes(po, po->operand[0].lmod);
1898 else if (po->op == OP_POP)
1899 *adj += lmod_bytes(po, po->operand[0].lmod);
1900 else if ((po->flags & (OPF_JMP|OPF_TAIL)) && po->op != OP_CALL)
1bafb621 1901 return -1;
7ba45c34 1902
1bafb621 1903 if (g_labels[i][0] != 0)
1904 return -1;
1905 }
1906
1907 return -1;
1908}
1909
4c45fa73 1910static void add_label_ref(struct label_ref *lr, int op_i)
1911{
1912 struct label_ref *lr_new;
1913
1914 if (lr->i == -1) {
1915 lr->i = op_i;
1916 return;
1917 }
1918
1919 lr_new = calloc(1, sizeof(*lr_new));
1920 lr_new->i = op_i;
1921 lr->next = lr_new;
1922}
1923
91977a1c 1924static void gen_func(FILE *fout, FILE *fhdr, const char *funcn, int opcnt)
1925{
69a3cdfc 1926 struct parsed_op *po, *delayed_flag_op = NULL, *tmp_op;
850c9265 1927 struct parsed_opr *last_arith_dst = NULL;
3ebea2cf 1928 char buf1[256], buf2[256], buf3[256], cast[64];
940e8e66 1929 struct parsed_proto *pp, *pp_tmp;
4c45fa73 1930 struct parsed_data *pd;
91977a1c 1931 const char *tmpname;
940e8e66 1932 enum parsed_flag_op pfo;
69a3cdfc 1933 int save_arg_vars = 0;
1934 int cmp_result_vars = 0;
87bf6cec 1935 int need_mul_var = 0;
91977a1c 1936 int had_decl = 0;
3ebea2cf 1937 int label_pending = 0;
d4e3b5db 1938 int regmask_save = 0;
91977a1c 1939 int regmask_arg = 0;
1940 int regmask = 0;
940e8e66 1941 int pfomask = 0;
64c59faf 1942 int found = 0;
d4e3b5db 1943 int depth = 0;
91977a1c 1944 int no_output;
4c45fa73 1945 int i, j, l;
69a3cdfc 1946 int dummy;
91977a1c 1947 int arg;
91977a1c 1948 int reg;
1949 int ret;
1950
1bafb621 1951 g_bp_frame = g_sp_frame = g_stack_fsz = 0;
91977a1c 1952
1953 ret = proto_parse(fhdr, funcn, &g_func_pp);
1954 if (ret)
1955 ferr(ops, "proto_parse failed for '%s'\n", funcn);
1956
3ebea2cf 1957 fprintf(fout, "%s %s(", g_func_pp.ret_type.name, funcn);
91977a1c 1958 for (i = 0; i < g_func_pp.argc; i++) {
1959 if (i > 0)
1960 fprintf(fout, ", ");
3ebea2cf 1961 fprintf(fout, "%s a%d", g_func_pp.arg[i].type.name, i + 1);
91977a1c 1962 }
1963 fprintf(fout, ")\n{\n");
1964
1965 // pass1:
1bafb621 1966 // - handle ebp/esp frame, remove ops related to it
91977a1c 1967 if (ops[0].op == OP_PUSH && IS(opr_name(&ops[0], 0), "ebp")
1968 && ops[1].op == OP_MOV
1969 && IS(opr_name(&ops[1], 0), "ebp")
1970 && IS(opr_name(&ops[1], 1), "esp"))
1971 {
87bf6cec 1972 int ecx_push = 0;
1973
91977a1c 1974 g_bp_frame = 1;
69a3cdfc 1975 ops[0].flags |= OPF_RMD;
1976 ops[1].flags |= OPF_RMD;
4c45fa73 1977 i = 2;
91977a1c 1978
1979 if (ops[2].op == OP_SUB && IS(opr_name(&ops[2], 0), "esp")) {
1bafb621 1980 g_stack_fsz = opr_const(&ops[2], 1);
69a3cdfc 1981 ops[2].flags |= OPF_RMD;
4c45fa73 1982 i++;
91977a1c 1983 }
87bf6cec 1984 else {
1985 // another way msvc builds stack frame..
1986 i = 2;
1987 while (ops[i].op == OP_PUSH && IS(opr_name(&ops[i], 0), "ecx")) {
1bafb621 1988 g_stack_fsz += 4;
87bf6cec 1989 ops[i].flags |= OPF_RMD;
1990 ecx_push++;
1991 i++;
1992 }
4c45fa73 1993 // and another way..
1994 if (i == 2 && ops[i].op == OP_MOV && ops[i].operand[0].reg == xAX
1995 && ops[i].operand[1].type == OPT_CONST
1996 && ops[i + 1].op == OP_CALL
1997 && IS(opr_name(&ops[i + 1], 0), "__alloca_probe"))
1998 {
1999 g_stack_fsz += ops[i].operand[1].val;
2000 ops[i].flags |= OPF_RMD;
2001 i++;
2002 ops[i].flags |= OPF_RMD;
2003 i++;
2004 }
87bf6cec 2005 }
91977a1c 2006
64c59faf 2007 found = 0;
91977a1c 2008 do {
2009 for (; i < opcnt; i++)
2010 if (ops[i].op == OP_RET)
2011 break;
64c59faf 2012 if (i == opcnt && (ops[i - 1].flags & OPF_JMP) && found)
2013 break;
2014
91977a1c 2015 if (ops[i - 1].op != OP_POP || !IS(opr_name(&ops[i - 1], 0), "ebp"))
2016 ferr(&ops[i - 1], "'pop ebp' expected\n");
69a3cdfc 2017 ops[i - 1].flags |= OPF_RMD;
91977a1c 2018
1bafb621 2019 if (g_stack_fsz != 0) {
91977a1c 2020 if (ops[i - 2].op != OP_MOV
2021 || !IS(opr_name(&ops[i - 2], 0), "esp")
2022 || !IS(opr_name(&ops[i - 2], 1), "ebp"))
2023 {
2024 ferr(&ops[i - 2], "esp restore expected\n");
2025 }
69a3cdfc 2026 ops[i - 2].flags |= OPF_RMD;
87bf6cec 2027
2028 if (ecx_push && ops[i - 3].op == OP_POP
2029 && IS(opr_name(&ops[i - 3], 0), "ecx"))
2030 {
2031 ferr(&ops[i - 3], "unexpected ecx pop\n");
2032 }
91977a1c 2033 }
87bf6cec 2034
64c59faf 2035 found = 1;
91977a1c 2036 i++;
2037 } while (i < opcnt);
2038 }
1bafb621 2039 else {
2040 for (i = 0; i < opcnt; i++) {
2041 if (ops[i].op == OP_PUSH || (ops[i].flags & (OPF_JMP|OPF_TAIL)))
2042 break;
2043 if (ops[i].op == OP_SUB && ops[i].operand[0].reg == xSP
2044 && ops[i].operand[1].type == OPT_CONST)
2045 {
2046 g_sp_frame = 1;
2047 break;
2048 }
2049 }
2050
2051 if (g_sp_frame)
2052 {
2053 g_stack_fsz = ops[i].operand[1].val;
2054 ops[i].flags |= OPF_RMD;
2055
2056 i++;
2057 do {
2058 for (; i < opcnt; i++)
2059 if (ops[i].op == OP_RET)
2060 break;
2061 if (ops[i - 1].op != OP_ADD
2062 || !IS(opr_name(&ops[i - 1], 0), "esp")
2063 || ops[i - 1].operand[1].type != OPT_CONST
2064 || ops[i - 1].operand[1].val != g_stack_fsz)
2065 ferr(&ops[i - 1], "'add esp' expected\n");
2066 ops[i - 1].flags |= OPF_RMD;
2067
2068 i++;
2069 } while (i < opcnt);
2070 }
2071 }
91977a1c 2072
2073 // pass2:
87bf6cec 2074 // - resolve all branches
2075 for (i = 0; i < opcnt; i++) {
2076 po = &ops[i];
2077 po->bt_i = -1;
4c45fa73 2078 po->btj = NULL;
87bf6cec 2079
2080 if ((po->flags & OPF_RMD) || !(po->flags & OPF_JMP)
2081 || po->op == OP_CALL || po->op == OP_RET)
2082 continue;
2083
4c45fa73 2084 if (po->operand[0].type == OPT_REGMEM) {
2085 char *p = strchr(po->operand[0].name, '[');
2086 if (p == NULL)
2087 ferr(po, "unhandled indirect branch\n");
2088 ret = p - po->operand[0].name;
2089 strncpy(buf1, po->operand[0].name, ret);
2090 buf1[ret] = 0;
2091
2092 for (j = 0, pd = NULL; j < g_func_pd_cnt; j++) {
2093 if (IS(g_func_pd[j].label, buf1)) {
2094 pd = &g_func_pd[j];
2095 break;
2096 }
2097 }
2098 if (pd == NULL)
2099 ferr(po, "label '%s' not parsed?\n", buf1);
2100 if (pd->type != OPT_OFFSET)
2101 ferr(po, "label '%s' with non-offset data?\n", buf1);
2102
2103 // find all labels, link
2104 for (j = 0; j < pd->count; j++) {
2105 for (l = 0; l < opcnt; l++) {
2106 if (g_labels[l][0] && IS(g_labels[l], pd->d[j].u.label)) {
2107 add_label_ref(&g_label_refs[l], i);
2108 pd->d[j].bt_i = l;
2109 break;
2110 }
2111 }
2112 }
2113
2114 po->btj = pd;
2115 continue;
2116 }
2117
2118 for (l = 0; l < opcnt; l++) {
2119 if (g_labels[l][0] && IS(po->operand[0].name, g_labels[l])) {
2120 add_label_ref(&g_label_refs[l], i);
2121 po->bt_i = l;
87bf6cec 2122 break;
2123 }
2124 }
2125
4c45fa73 2126 if (po->bt_i != -1)
2127 continue;
2128
2129 if (po->operand[0].type == OPT_LABEL) {
87bf6cec 2130 // assume tail call
2131 po->op = OP_CALL;
2132 po->flags |= OPF_TAIL;
4c45fa73 2133 continue;
87bf6cec 2134 }
4c45fa73 2135
2136 ferr(po, "unhandled branch\n");
87bf6cec 2137 }
2138
2139 // pass3:
91977a1c 2140 // - process calls
1bafb621 2141 for (i = 0; i < opcnt; i++)
2142 {
69a3cdfc 2143 po = &ops[i];
2144 if (po->flags & OPF_RMD)
91977a1c 2145 continue;
850c9265 2146
d4e3b5db 2147 if (po->op == OP_CALL)
69a3cdfc 2148 {
1bafb621 2149 pp = calloc(1, sizeof(*pp));
91977a1c 2150 my_assert_not(pp, NULL);
1bafb621 2151 tmpname = opr_name(po, 0);
2152 if (po->operand[0].type != OPT_LABEL)
2153 {
2154 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
2155 if (ret < 0)
2156 ferr(po, "non-__cdecl indirect call unhandled yet\n");
2157 j /= 4;
2158 if (j > ARRAY_SIZE(pp->arg))
2159 ferr(po, "esp adjust too large?\n");
3ebea2cf 2160 pp->ret_type.name = strdup("int");
1bafb621 2161 pp->argc = pp->argc_stack = j;
2162 for (arg = 0; arg < pp->argc; arg++)
3ebea2cf 2163 pp->arg[arg].type.name = strdup("int");
1bafb621 2164 }
2165 else {
2166 ret = proto_parse(fhdr, tmpname, pp);
2167 if (ret)
2168 ferr(po, "proto_parse failed for call '%s'\n", tmpname);
2169 }
2170
7ba45c34 2171 // look for and make use of esp adjust
2172 ret = -1;
2173 if (!pp->is_stdcall)
2174 ret = scan_for_esp_adjust(i + 1, opcnt, &j);
1bafb621 2175 if (ret >= 0) {
7ba45c34 2176 if (pp->is_vararg) {
2177 if (j / 4 < pp->argc_stack)
2178 ferr(po, "esp adjust is too small: %x < %x\n",
2179 j, pp->argc_stack * 4);
2180 // modify pp to make it have varargs as normal args
2181 arg = pp->argc;
2182 pp->argc += j / 4 - pp->argc_stack;
2183 for (; arg < pp->argc; arg++) {
3ebea2cf 2184 pp->arg[arg].type.name = strdup("int");
7ba45c34 2185 pp->argc_stack++;
2186 }
2187 if (pp->argc > ARRAY_SIZE(pp->arg))
2188 ferr(po, "too many args\n");
2189 }
1bafb621 2190 if (pp->argc_stack != j / 4)
2191 ferr(po, "stack tracking failed: %x %x\n",
7ba45c34 2192 pp->argc_stack * 4, j);
2193
1bafb621 2194 ops[ret].flags |= OPF_RMD;
7ba45c34 2195 // a bit of a hack, but deals with use of
2196 // single adj for multiple calls
2197 ops[ret].operand[1].val -= j;
1bafb621 2198 }
7ba45c34 2199 else if (pp->is_vararg)
2200 ferr(po, "missing esp_adjust for vararg func '%s'\n",
2201 pp->name);
91977a1c 2202
39b168b8 2203 // can't call functions with non-__cdecl callbacks yet
2204 for (arg = 0; arg < pp->argc; arg++) {
2205 if (pp->arg[arg].fptr != NULL) {
2206 pp_tmp = pp->arg[arg].fptr;
2207 if (pp_tmp->is_stdcall || pp_tmp->argc != pp_tmp->argc_stack)
2208 ferr(po, "'%s' has a non-__cdecl callback\n", tmpname);
2209 }
2210 }
2211
4c45fa73 2212 // collect all stack args
91977a1c 2213 for (arg = 0; arg < pp->argc; arg++)
2214 if (pp->arg[arg].reg == NULL)
2215 break;
2216
1bafb621 2217 for (j = i; j >= 0 && arg < pp->argc; )
2218 {
2219 if (g_labels[j][0] != 0) {
2220 if (j > 0 && ((ops[j - 1].flags & OPF_TAIL)
2221 || (ops[j - 1].flags & (OPF_JMP|OPF_CC)) == OPF_JMP))
2222 {
2223 // follow the branch in reverse
4c45fa73 2224 if (g_label_refs[j].i == -1)
1bafb621 2225 ferr(po, "no refs for '%s'?\n", g_labels[j]);
4c45fa73 2226 if (g_label_refs[j].next != NULL)
2227 ferr(po, "unhandled multiple refs to '%s'\n", g_labels[j]);
2228 j = g_label_refs[j].i + 1;
1bafb621 2229 continue;
2230 }
2231 break;
2232 }
2233 j--;
2234
2235 if (ops[j].op == OP_CALL)
2236 {
940e8e66 2237 pp_tmp = ops[j].datap;
2238 if (pp_tmp == NULL)
2239 ferr(po, "arg collect hit unparsed call\n");
2240 if (pp_tmp->argc_stack > 0)
2241 ferr(po, "arg collect hit '%s' with %d stack args\n",
2242 opr_name(&ops[j], 0), pp_tmp->argc_stack);
2243 }
2244 else if ((ops[j].flags & OPF_TAIL)
2245 || (ops[j].flags & (OPF_JMP|OPF_CC)) == OPF_JMP)
2246 {
2247 break;
69a3cdfc 2248 }
1bafb621 2249 else if (ops[j].op == OP_PUSH)
2250 {
940e8e66 2251 pp->arg[arg].datap = &ops[j];
2252 ret = scan_for_mod(&ops[j], j + 1, i);
2253 if (ret >= 0) {
2254 // mark this push as one that needs operand saving
1bafb621 2255 ops[j].flags &= ~OPF_RMD;
940e8e66 2256 ops[j].argmask |= 1 << arg;
2257 save_arg_vars |= 1 << arg;
2258 }
2259 else
2260 ops[j].flags |= OPF_RMD;
2261
2262 // next arg
2263 for (arg++; arg < pp->argc; arg++)
2264 if (pp->arg[arg].reg == NULL)
2265 break;
2266 }
91977a1c 2267 }
2268 if (arg < pp->argc)
64c59faf 2269 ferr(po, "arg collect failed for '%s': %d/%d\n",
2270 tmpname, arg, pp->argc);
69a3cdfc 2271 po->datap = pp;
91977a1c 2272 }
d4e3b5db 2273 }
2274
2275 // pass4:
2276 // - find POPs for PUSHes, rm both
2277 // - scan for all used registers
2278 // - find flag set ops for their users
1bafb621 2279 // - declare indirect functions
d4e3b5db 2280 for (i = 0; i < opcnt; i++) {
2281 po = &ops[i];
2282 if (po->flags & OPF_RMD)
2283 continue;
2284
2285 if (po->op == OP_PUSH
2286 && po->argmask == 0 && !(po->flags & OPF_RSAVE)
2287 && po->operand[0].type == OPT_REG)
2288 {
2289 reg = po->operand[0].reg;
2290 if (reg < 0)
2291 ferr(po, "reg not set for push?\n");
2292
2293 depth = 0;
2294 ret = scan_for_pop(i + 1, opcnt,
2295 po->operand[0].name, i + opcnt, 0, &depth, 0);
2296 if (ret == 1) {
2297 if (depth > 1)
2298 ferr(po, "too much depth: %d\n", depth);
2299 if (depth > 0)
2300 regmask_save |= 1 << reg;
2301
2302 po->flags |= OPF_RMD;
2303 scan_for_pop(i + 1, opcnt, po->operand[0].name,
2304 i + opcnt * 2, 0, &depth, 1);
2305 continue;
2306 }
2307 ret = scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, 0);
2308 if (ret == 0) {
2309 arg = OPF_RMD;
2310 if (regmask & (1 << reg)) {
2311 if (regmask_save & (1 << reg))
2312 ferr(po, "%s already saved?\n", po->operand[0].name);
2313 arg = OPF_RSAVE;
2314 }
2315 po->flags |= arg;
2316 scan_for_pop_ret(i + 1, opcnt, po->operand[0].name, arg);
2317 continue;
2318 }
2319 }
2320
2321 regmask |= po->regmask_src | po->regmask_dst;
2322
2323 if (po->flags & OPF_CC)
2324 {
2325 ret = scan_for_flag_set(i - 1);
2326 if (ret < 0)
2327 ferr(po, "unable to trace flag setter\n");
2328
2329 tmp_op = &ops[ret]; // flag setter
2330 pfo = split_cond(po, po->op, &dummy);
2331 pfomask = 0;
2332
2333 // to get nicer code, we try to delay test and cmp;
2334 // if we can't because of operand modification, or if we
2335 // have math op, make it calculate flags explicitly
2336 if (tmp_op->op == OP_TEST || tmp_op->op == OP_CMP) {
2337 if (scan_for_mod(tmp_op, ret + 1, i) >= 0)
2338 pfomask = 1 << pfo;
2339 }
7ba45c34 2340 else if (tmp_op->op == OP_CMPS) {
2341 pfomask = 1 << PFO_Z;
2342 }
d4e3b5db 2343 else {
2344 if ((pfo != PFO_Z && pfo != PFO_S && pfo != PFO_P)
2345 || scan_for_mod_opr0(tmp_op, ret + 1, i) >= 0)
2346 pfomask = 1 << pfo;
2347 }
2348 if (pfomask) {
2349 tmp_op->pfomask |= pfomask;
2350 cmp_result_vars |= pfomask;
2351 po->datap = tmp_op;
2352 }
2353
2354 if (po->op == OP_ADC || po->op == OP_SBB)
2355 cmp_result_vars |= 1 << PFO_C;
2356 }
87bf6cec 2357 else if (po->op == OP_MUL
2358 || (po->op == OP_IMUL && po->operand_cnt == 1))
2359 {
2360 need_mul_var = 1;
2361 }
1bafb621 2362 else if (po->op == OP_CALL && po->operand[0].type != OPT_LABEL) {
2363 pp = po->datap;
2364 my_assert_not(pp, NULL);
3ebea2cf 2365 fprintf(fout, " %s (*icall%d)(", pp->ret_type.name, i);
1bafb621 2366 for (j = 0; j < pp->argc; j++) {
2367 if (j > 0)
2368 fprintf(fout, ", ");
3ebea2cf 2369 fprintf(fout, "%s a%d", pp->arg[j].type.name, j + 1);
1bafb621 2370 }
2371 fprintf(fout, ");\n");
2372 }
91977a1c 2373 }
2374
4c45fa73 2375 // output LUTs/jumptables
2376 for (i = 0; i < g_func_pd_cnt; i++) {
2377 pd = &g_func_pd[i];
2378 fprintf(fout, " static const ");
2379 if (pd->type == OPT_OFFSET) {
2380 fprintf(fout, "void *jt_%s[] =\n { ", pd->label);
2381
2382 for (j = 0; j < pd->count; j++) {
2383 if (j > 0)
2384 fprintf(fout, ", ");
2385 fprintf(fout, "&&%s", pd->d[j].u.label);
2386 }
2387 }
2388 else {
2389 fprintf(fout, "%s %s[] =\n { ",
2390 lmod_type_u(ops, pd->lmod), pd->label);
2391
2392 for (j = 0; j < pd->count; j++) {
2393 if (j > 0)
2394 fprintf(fout, ", ");
2395 fprintf(fout, "%u", pd->d[j].u.val);
2396 }
2397 }
2398 fprintf(fout, " };\n");
2399 }
2400
850c9265 2401 // declare stack frame
1bafb621 2402 if (g_stack_fsz)
850c9265 2403 fprintf(fout, " union { u32 d[%d]; u16 w[%d]; u8 b[%d]; } sf;\n",
1bafb621 2404 (g_stack_fsz + 3) / 4, (g_stack_fsz + 1) / 2, g_stack_fsz);
850c9265 2405
940e8e66 2406 // declare arg-registers
91977a1c 2407 for (i = 0; i < g_func_pp.argc; i++) {
2408 if (g_func_pp.arg[i].reg != NULL) {
2409 reg = char_array_i(regs_r32,
2410 ARRAY_SIZE(regs_r32), g_func_pp.arg[i].reg);
2411 if (reg < 0)
2412 ferr(ops, "arg '%s' is not a reg?\n", g_func_pp.arg[i].reg);
2413
2414 regmask_arg |= 1 << reg;
2415 fprintf(fout, " u32 %s = (u32)a%d;\n",
850c9265 2416 g_func_pp.arg[i].reg, i + 1);
91977a1c 2417 had_decl = 1;
2418 }
2419 }
2420
940e8e66 2421 // declare other regs - special case for eax
3ebea2cf 2422 if (!((regmask | regmask_arg) & 1)
2423 && !IS(g_func_pp.ret_type.name, "void"))
2424 {
91977a1c 2425 fprintf(fout, " u32 eax = 0;\n");
2426 had_decl = 1;
2427 }
2428
2429 regmask &= ~regmask_arg;
d4e3b5db 2430 regmask &= ~(1 << xSP);
91977a1c 2431 if (g_bp_frame)
2432 regmask &= ~(1 << xBP);
2433 if (regmask) {
2434 for (reg = 0; reg < 8; reg++) {
2435 if (regmask & (1 << reg)) {
2436 fprintf(fout, " u32 %s;\n", regs_r32[reg]);
2437 had_decl = 1;
2438 }
2439 }
2440 }
2441
d4e3b5db 2442 if (regmask_save) {
2443 for (reg = 0; reg < 8; reg++) {
2444 if (regmask_save & (1 << reg)) {
2445 fprintf(fout, " u32 s_%s;\n", regs_r32[reg]);
2446 had_decl = 1;
2447 }
2448 }
2449 }
2450
69a3cdfc 2451 if (save_arg_vars) {
2452 for (reg = 0; reg < 32; reg++) {
2453 if (save_arg_vars & (1 << reg)) {
2454 fprintf(fout, " u32 s_a%d;\n", reg + 1);
2455 had_decl = 1;
2456 }
2457 }
2458 }
2459
2460 if (cmp_result_vars) {
2461 for (i = 0; i < 8; i++) {
2462 if (cmp_result_vars & (1 << i)) {
2463 fprintf(fout, " u32 cond_%s;\n", parsed_flag_op_names[i]);
2464 had_decl = 1;
2465 }
2466 }
2467 }
2468
87bf6cec 2469 if (need_mul_var) {
2470 fprintf(fout, " u64 mul_tmp;\n");
2471 had_decl = 1;
2472 }
2473
91977a1c 2474 if (had_decl)
2475 fprintf(fout, "\n");
2476
2477 // output ops
69a3cdfc 2478 for (i = 0; i < opcnt; i++)
2479 {
3ebea2cf 2480 if (g_labels[i][0] != 0 && g_label_refs[i].i != -1) {
91977a1c 2481 fprintf(fout, "\n%s:\n", g_labels[i]);
3ebea2cf 2482 label_pending = 1;
2483 }
91977a1c 2484
69a3cdfc 2485 po = &ops[i];
2486 if (po->flags & OPF_RMD)
91977a1c 2487 continue;
2488
2489 no_output = 0;
2490
91977a1c 2491 #define assert_operand_cnt(n_) \
850c9265 2492 if (po->operand_cnt != n_) \
2493 ferr(po, "operand_cnt is %d/%d\n", po->operand_cnt, n_)
2494
69a3cdfc 2495 // conditional/flag using op?
2496 if (po->flags & OPF_CC)
850c9265 2497 {
940e8e66 2498 int is_delayed = 0;
2499 int is_inv = 0;
69a3cdfc 2500
940e8e66 2501 pfo = split_cond(po, po->op, &is_inv);
850c9265 2502
69a3cdfc 2503 // we go through all this trouble to avoid using parsed_flag_op,
2504 // which makes generated code much nicer
2505 if (delayed_flag_op != NULL)
850c9265 2506 {
940e8e66 2507 out_cmp_test(buf1, sizeof(buf1), delayed_flag_op, pfo, is_inv);
2508 is_delayed = 1;
91977a1c 2509 }
850c9265 2510 else if (last_arith_dst != NULL
69a3cdfc 2511 && (pfo == PFO_Z || pfo == PFO_S || pfo == PFO_P))
850c9265 2512 {
3ebea2cf 2513 out_src_opr_u32(buf3, sizeof(buf3), po, last_arith_dst);
940e8e66 2514 out_test_for_cc(buf1, sizeof(buf1), po, pfo, is_inv,
850c9265 2515 last_arith_dst->lmod, buf3);
940e8e66 2516 is_delayed = 1;
850c9265 2517 }
69a3cdfc 2518 else if (po->datap != NULL) {
7ba45c34 2519 // use preprocessed flag calc results
69a3cdfc 2520 tmp_op = po->datap;
2521 if (!tmp_op || !(tmp_op->pfomask & (1 << pfo)))
2522 ferr(po, "not prepared for pfo %d\n", pfo);
2523
940e8e66 2524 // note: is_inv was not yet applied
69a3cdfc 2525 snprintf(buf1, sizeof(buf1), "(%scond_%s)",
940e8e66 2526 is_inv ? "!" : "", parsed_flag_op_names[pfo]);
69a3cdfc 2527 }
2528 else {
2529 ferr(po, "all methods of finding comparison failed\n");
2530 }
850c9265 2531
69a3cdfc 2532 if (po->flags & OPF_JMP) {
850c9265 2533 fprintf(fout, " if %s\n", buf1);
2534 }
5101a5f9 2535 else if (po->op == OP_ADC || po->op == OP_SBB) {
940e8e66 2536 if (is_delayed)
2537 fprintf(fout, " cond_%s = %s;\n",
2538 parsed_flag_op_names[pfo], buf1);
850c9265 2539 }
5101a5f9 2540 else if (po->flags & OPF_DATA) { // SETcc
850c9265 2541 out_dst_opr(buf2, sizeof(buf2), po, &po->operand[0]);
2542 fprintf(fout, " %s = %s;", buf2, buf1);
91977a1c 2543 }
69a3cdfc 2544 else {
2545 ferr(po, "unhandled conditional op\n");
2546 }
91977a1c 2547 }
2548
940e8e66 2549 pfomask = po->pfomask;
2550
850c9265 2551 switch (po->op)
91977a1c 2552 {
2553 case OP_MOV:
2554 assert_operand_cnt(2);
850c9265 2555 propagate_lmod(po, &po->operand[0], &po->operand[1]);
3ebea2cf 2556 fprintf(fout, " %s = %s;",
850c9265 2557 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3ebea2cf 2558 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2559 po->operand[0].is_ptr ? "(void *)" : "", 0));
850c9265 2560 break;
2561
2562 case OP_LEA:
2563 assert_operand_cnt(2);
87bf6cec 2564 po->operand[1].lmod = OPLM_DWORD; // always
850c9265 2565 fprintf(fout, " %s = %s;",
2566 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3ebea2cf 2567 out_src_opr(buf2, sizeof(buf2), po, &po->operand[1],
2568 NULL, 1));
850c9265 2569 break;
2570
2571 case OP_MOVZX:
2572 assert_operand_cnt(2);
91977a1c 2573 fprintf(fout, " %s = %s;",
850c9265 2574 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3ebea2cf 2575 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
850c9265 2576 break;
2577
2578 case OP_MOVSX:
2579 assert_operand_cnt(2);
2580 switch (po->operand[1].lmod) {
2581 case OPLM_BYTE:
2582 strcpy(buf3, "(s8)");
2583 break;
2584 case OPLM_WORD:
2585 strcpy(buf3, "(s16)");
2586 break;
2587 default:
2588 ferr(po, "invalid src lmod: %d\n", po->operand[1].lmod);
2589 }
2590 fprintf(fout, " %s = %s%s;",
2591 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2592 buf3,
3ebea2cf 2593 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
850c9265 2594 break;
2595
2596 case OP_NOT:
2597 assert_operand_cnt(1);
2598 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2599 fprintf(fout, " %s = ~%s;", buf1, buf1);
2600 break;
2601
5101a5f9 2602 case OP_CDQ:
2603 assert_operand_cnt(2);
2604 fprintf(fout, " %s = (s32)%s >> 31;",
2605 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
3ebea2cf 2606 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5101a5f9 2607 strcpy(g_comment, "cdq");
2608 break;
2609
33c35af6 2610 case OP_STOS:
2611 // assumes DF=0
2612 assert_operand_cnt(3);
2613 if (po->flags & OPF_REP) {
2614 fprintf(fout, " for (; ecx != 0; ecx--, edi += %d)\n",
2615 lmod_bytes(po, po->operand[0].lmod));
d4e3b5db 2616 fprintf(fout, " %sedi = eax;",
2617 lmod_cast_u_ptr(po, po->operand[0].lmod));
33c35af6 2618 strcpy(g_comment, "rep stos");
2619 }
2620 else {
d4e3b5db 2621 fprintf(fout, " %sedi = eax; edi += %d;",
2622 lmod_cast_u_ptr(po, po->operand[0].lmod),
33c35af6 2623 lmod_bytes(po, po->operand[0].lmod));
2624 strcpy(g_comment, "stos");
2625 }
2626 break;
2627
d4e3b5db 2628 case OP_MOVS:
2629 // assumes DF=0
2630 assert_operand_cnt(3);
2631 j = lmod_bytes(po, po->operand[0].lmod);
2632 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2633 if (po->flags & OPF_REP) {
2634 fprintf(fout,
2635 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2636 j, j);
2637 fprintf(fout,
2638 " %sedi = %sesi;", buf1, buf1);
2639 strcpy(g_comment, "rep movs");
2640 }
2641 else {
2642 fprintf(fout, " %sedi = %sesi; edi += %d; esi += %d;",
2643 buf1, buf1, j, j);
2644 strcpy(g_comment, "movs");
2645 }
2646 break;
2647
7ba45c34 2648 case OP_CMPS:
2649 // assumes DF=0
2650 // repe ~ repeat while ZF=1
2651 assert_operand_cnt(3);
2652 j = lmod_bytes(po, po->operand[0].lmod);
2653 strcpy(buf1, lmod_cast_u_ptr(po, po->operand[0].lmod));
2654 if (po->flags & OPF_REP) {
2655 fprintf(fout,
2656 " for (; ecx != 0; ecx--, edi += %d, esi += %d)\n",
2657 j, j);
2658 fprintf(fout,
2659 " if ((cond_z = (%sedi == %sesi)) %s 0)\n",
2660 buf1, buf1, (po->flags & OPF_REPZ) ? "==" : "!=");
2661 fprintf(fout,
2662 " break;");
2663 snprintf(g_comment, sizeof(g_comment), "rep%s cmps",
2664 (po->flags & OPF_REPZ) ? "e" : "ne");
2665 }
2666 else {
2667 fprintf(fout,
2668 " cond_z = (%sedi = %sesi); edi += %d; esi += %d;",
2669 buf1, buf1, j, j);
2670 strcpy(g_comment, "cmps");
2671 }
2672 pfomask &= ~(1 << PFO_Z);
2673 last_arith_dst = NULL;
2674 delayed_flag_op = NULL;
2675 break;
2676
850c9265 2677 // arithmetic w/flags
2678 case OP_ADD:
2679 case OP_SUB:
2680 case OP_AND:
2681 case OP_OR:
5101a5f9 2682 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2683 // fallthrough
850c9265 2684 case OP_SHL:
2685 case OP_SHR:
2686 dualop_arith:
2687 assert_operand_cnt(2);
850c9265 2688 fprintf(fout, " %s %s= %s;",
2689 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2690 op_to_c(po),
3ebea2cf 2691 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
850c9265 2692 last_arith_dst = &po->operand[0];
69a3cdfc 2693 delayed_flag_op = NULL;
850c9265 2694 break;
2695
d4e3b5db 2696 case OP_SAR:
2697 assert_operand_cnt(2);
2698 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2699 fprintf(fout, " %s = %s%s >> %s;", buf1,
2700 lmod_cast_s(po, po->operand[0].lmod), buf1,
3ebea2cf 2701 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
d4e3b5db 2702 last_arith_dst = &po->operand[0];
2703 delayed_flag_op = NULL;
2704 break;
2705
2706 case OP_ROL:
2707 case OP_ROR:
2708 assert_operand_cnt(2);
2709 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
2710 if (po->operand[1].type == OPT_CONST) {
2711 j = po->operand[1].val;
2712 j %= lmod_bytes(po, po->operand[0].lmod) * 8;
2713 fprintf(fout, po->op == OP_ROL ?
2714 " %s = (%s << %d) | (%s >> %d);" :
2715 " %s = (%s >> %d) | (%s << %d);",
2716 buf1, buf1, j, buf1,
2717 lmod_bytes(po, po->operand[0].lmod) * 8 - j);
2718 }
2719 else
2720 ferr(po, "TODO\n");
2721 last_arith_dst = &po->operand[0];
2722 delayed_flag_op = NULL;
2723 break;
2724
5101a5f9 2725 case OP_XOR:
850c9265 2726 assert_operand_cnt(2);
2727 propagate_lmod(po, &po->operand[0], &po->operand[1]);
5101a5f9 2728 if (IS(opr_name(po, 0), opr_name(po, 1))) {
2729 // special case for XOR
2730 fprintf(fout, " %s = 0;",
2731 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]));
2732 last_arith_dst = &po->operand[0];
2733 delayed_flag_op = NULL;
850c9265 2734 break;
850c9265 2735 }
5101a5f9 2736 goto dualop_arith;
2737
5101a5f9 2738 case OP_ADC:
850c9265 2739 case OP_SBB:
5101a5f9 2740 assert_operand_cnt(2);
2741 propagate_lmod(po, &po->operand[0], &po->operand[1]);
2742 fprintf(fout, " %s %s= %s + cond_c;",
2743 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]),
2744 op_to_c(po),
3ebea2cf 2745 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[1]));
5101a5f9 2746 last_arith_dst = &po->operand[0];
2747 delayed_flag_op = NULL;
850c9265 2748 break;
2749
2750 case OP_INC:
2751 case OP_DEC:
2752 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
1bafb621 2753 if (po->operand[0].type == OPT_REG) {
2754 strcpy(buf2, po->op == OP_INC ? "++" : "--");
2755 fprintf(fout, " %s%s;", buf1, buf2);
2756 }
2757 else {
2758 strcpy(buf2, po->op == OP_INC ? "+" : "-");
2759 fprintf(fout, " %s %s= 1;", buf1, buf2);
2760 }
5101a5f9 2761 last_arith_dst = &po->operand[0];
2762 delayed_flag_op = NULL;
2763 break;
2764
2765 case OP_NEG:
2766 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
3ebea2cf 2767 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]);
5101a5f9 2768 fprintf(fout, " %s = -%s%s;", buf1,
2769 lmod_cast_s(po, po->operand[0].lmod), buf2);
850c9265 2770 last_arith_dst = &po->operand[0];
69a3cdfc 2771 delayed_flag_op = NULL;
940e8e66 2772 if (pfomask & (1 << PFO_C)) {
2773 fprintf(fout, "\n cond_c = (%s != 0);", buf1);
2774 pfomask &= ~(1 << PFO_C);
2775 }
850c9265 2776 break;
2777
2778 case OP_IMUL:
2779 if (po->operand_cnt == 2)
2780 goto dualop_arith;
87bf6cec 2781 if (po->operand_cnt == 3)
2782 ferr(po, "TODO imul3\n");
2783 // fallthrough
2784 case OP_MUL:
2785 assert_operand_cnt(1);
2786 strcpy(buf1, po->op == OP_IMUL ? "(s64)(s32)" : "(u64)");
2787 fprintf(fout, " mul_tmp = %seax * %s%s;\n", buf1, buf1,
3ebea2cf 2788 out_src_opr_u32(buf2, sizeof(buf2), po, &po->operand[0]));
87bf6cec 2789 fprintf(fout, " edx = mul_tmp >> 32;\n");
2790 fprintf(fout, " eax = mul_tmp;");
2791 last_arith_dst = NULL;
69a3cdfc 2792 delayed_flag_op = NULL;
91977a1c 2793 break;
2794
5101a5f9 2795 case OP_DIV:
2796 case OP_IDIV:
2797 assert_operand_cnt(1);
2798 if (po->operand[0].lmod != OPLM_DWORD)
2799 ferr(po, "unhandled lmod %d\n", po->operand[0].lmod);
2800
2801 // 32bit division is common, look for it
64c59faf 2802 if (po->op == OP_DIV)
2803 ret = scan_for_reg_clear(i - 1, xDX);
2804 else
2805 ret = scan_for_cdq_edx(i - 1);
2806 if (ret >= 0) {
3ebea2cf 2807 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
5101a5f9 2808 strcpy(buf2, lmod_cast(po, po->operand[0].lmod,
2809 po->op == OP_IDIV));
2810 fprintf(fout, " edx = %seax %% %s%s;\n", buf2, buf2, buf1);
2811 fprintf(fout, " eax = %seax / %s%s;", buf2, buf2, buf1);
2812 }
2813 else
2814 ferr(po, "TODO 64bit divident\n");
87bf6cec 2815 last_arith_dst = NULL;
2816 delayed_flag_op = NULL;
5101a5f9 2817 break;
2818
91977a1c 2819 case OP_TEST:
2820 case OP_CMP:
850c9265 2821 propagate_lmod(po, &po->operand[0], &po->operand[1]);
940e8e66 2822 if (pfomask != 0) {
69a3cdfc 2823 for (j = 0; j < 8; j++) {
940e8e66 2824 if (pfomask & (1 << j)) {
69a3cdfc 2825 out_cmp_test(buf1, sizeof(buf1), po, j, 0);
2826 fprintf(fout, " cond_%s = %s;",
2827 parsed_flag_op_names[j], buf1);
2828 }
2829 }
940e8e66 2830 pfomask = 0;
69a3cdfc 2831 }
2832 else
2833 no_output = 1;
7ba45c34 2834 last_arith_dst = NULL;
69a3cdfc 2835 delayed_flag_op = po;
91977a1c 2836 break;
2837
69a3cdfc 2838 // note: we reuse OP_Jcc for SETcc, only flags differ
91977a1c 2839 case OP_JO ... OP_JG:
5101a5f9 2840 if (po->flags & OPF_JMP)
850c9265 2841 fprintf(fout, " goto %s;", po->operand[0].name);
5101a5f9 2842 // else SETcc - should already be handled
850c9265 2843 break;
2844
2845 case OP_JMP:
87bf6cec 2846 assert_operand_cnt(1);
4c45fa73 2847 if (po->operand[0].type == OPT_REGMEM) {
2848 ret = sscanf(po->operand[0].name, "%[^[][%[^*]*4]",
2849 buf1, buf2);
2850 if (ret != 2)
2851 ferr(po, "parse failure for jmp '%s'\n",
2852 po->operand[0].name);
2853 fprintf(fout, " goto *jt_%s[%s];", buf1, buf2);
2854 break;
2855 }
2856 else if (po->operand[0].type != OPT_LABEL)
2857 ferr(po, "unhandled jmp type\n");
87bf6cec 2858
850c9265 2859 fprintf(fout, " goto %s;", po->operand[0].name);
91977a1c 2860 break;
2861
2862 case OP_CALL:
5101a5f9 2863 assert_operand_cnt(1);
850c9265 2864 pp = po->datap;
91977a1c 2865 if (pp == NULL)
850c9265 2866 ferr(po, "NULL pp\n");
91977a1c 2867
1bafb621 2868 if (po->operand[0].type != OPT_LABEL)
2869 fprintf(fout, " icall%d = (void *)%s;\n", i,
3ebea2cf 2870 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]));
1bafb621 2871
91977a1c 2872 fprintf(fout, " ");
3ebea2cf 2873 if (!IS(pp->ret_type.name, "void")) {
87bf6cec 2874 if (po->flags & OPF_TAIL)
2875 fprintf(fout, "return ");
2876 else
2877 fprintf(fout, "eax = ");
3ebea2cf 2878 if (pp->ret_type.is_ptr)
91977a1c 2879 fprintf(fout, "(u32)");
2880 }
87bf6cec 2881
39b168b8 2882 if (po->operand[0].type != OPT_LABEL) {
1bafb621 2883 fprintf(fout, "icall%d(", i);
39b168b8 2884 }
2885 else {
2886 if (pp->name[0] == 0)
2887 ferr(po, "missing pp->name\n");
2888 fprintf(fout, "%s(", pp->name);
2889 }
2890
91977a1c 2891 for (arg = 0; arg < pp->argc; arg++) {
2892 if (arg > 0)
2893 fprintf(fout, ", ");
87bf6cec 2894
3ebea2cf 2895 cast[0] = 0;
2896 if (pp->arg[arg].type.is_ptr)
2897 snprintf(cast, sizeof(cast), "(%s)", pp->arg[arg].type.name);
87bf6cec 2898
91977a1c 2899 if (pp->arg[arg].reg != NULL) {
3ebea2cf 2900 fprintf(fout, "%s%s", cast, pp->arg[arg].reg);
91977a1c 2901 continue;
2902 }
2903
2904 // stack arg
2905 tmp_op = pp->arg[arg].datap;
2906 if (tmp_op == NULL)
850c9265 2907 ferr(po, "parsed_op missing for arg%d\n", arg);
940e8e66 2908 if (tmp_op->argmask) {
3ebea2cf 2909 fprintf(fout, "%ss_a%d", cast, arg + 1);
69a3cdfc 2910 }
2911 else {
2912 fprintf(fout, "%s",
2913 out_src_opr(buf1, sizeof(buf1),
3ebea2cf 2914 tmp_op, &tmp_op->operand[0], cast, 0));
69a3cdfc 2915 }
91977a1c 2916 }
2917 fprintf(fout, ");");
87bf6cec 2918
2919 if (po->flags & OPF_TAIL) {
2920 strcpy(g_comment, "tailcall");
3ebea2cf 2921 if (IS(pp->ret_type.name, "void")) {
87bf6cec 2922 fprintf(fout, "\n return;");
3ebea2cf 2923 strcpy(g_comment, "^ tailcall");
2924 }
87bf6cec 2925 }
2926 delayed_flag_op = NULL;
2927 last_arith_dst = NULL;
91977a1c 2928 break;
2929
2930 case OP_RET:
3ebea2cf 2931 if (IS(g_func_pp.ret_type.name, "void")) {
2932 if (i != opcnt - 1 || label_pending)
2933 fprintf(fout, " return;");
2934 }
2935 else if (g_func_pp.ret_type.is_ptr) {
d4e3b5db 2936 fprintf(fout, " return (%s)eax;",
3ebea2cf 2937 g_func_pp.ret_type.name);
2938 }
91977a1c 2939 else
2940 fprintf(fout, " return eax;");
2941 break;
2942
2943 case OP_PUSH:
940e8e66 2944 if (po->argmask) {
69a3cdfc 2945 // special case - saved func arg
3ebea2cf 2946 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
940e8e66 2947 for (j = 0; j < 32; j++) {
d4e3b5db 2948 if (po->argmask & (1 << j))
2949 fprintf(fout, " s_a%d = %s;", j + 1, buf1);
940e8e66 2950 }
69a3cdfc 2951 break;
2952 }
d4e3b5db 2953 else if (po->flags & OPF_RSAVE) {
3ebea2cf 2954 out_src_opr_u32(buf1, sizeof(buf1), po, &po->operand[0]);
d4e3b5db 2955 fprintf(fout, " s_%s = %s;", buf1, buf1);
2956 break;
2957 }
2958 ferr(po, "stray push encountered\n");
91977a1c 2959 break;
2960
2961 case OP_POP:
d4e3b5db 2962 if (po->flags & OPF_RSAVE) {
3ebea2cf 2963 out_dst_opr(buf1, sizeof(buf1), po, &po->operand[0]);
d4e3b5db 2964 fprintf(fout, " %s = s_%s;", buf1, buf1);
2965 break;
2966 }
2967 ferr(po, "stray pop encountered\n");
91977a1c 2968 break;
2969
33c35af6 2970 case OP_NOP:
2971 break;
2972
91977a1c 2973 default:
2974 no_output = 1;
69a3cdfc 2975 ferr(po, "unhandled op type %d, flags %x\n",
2976 po->op, po->flags);
91977a1c 2977 break;
2978 }
2979
7ba45c34 2980 // some sanity checking
2981 if ((po->flags & OPF_REP) && po->op != OP_STOS
2982 && po->op != OP_MOVS && po->op != OP_CMPS)
2983 ferr(po, "unexpected rep\n");
2984 if ((po->flags & (OPF_REPZ|OPF_REPNZ)) && po->op != OP_CMPS)
2985 ferr(po, "unexpected repz/repnz\n");
2986
91977a1c 2987 if (g_comment[0] != 0) {
2988 fprintf(fout, " // %s", g_comment);
2989 g_comment[0] = 0;
2990 no_output = 0;
2991 }
2992 if (!no_output)
2993 fprintf(fout, "\n");
5101a5f9 2994
940e8e66 2995 if (pfomask != 0)
7ba45c34 2996 ferr(po, "missed flag calc, pfomask=%x\n", pfomask);
940e8e66 2997
5101a5f9 2998 // see is delayed flag stuff is still valid
2999 if (delayed_flag_op != NULL && delayed_flag_op != po) {
3000 if (is_any_opr_modified(delayed_flag_op, po))
3001 delayed_flag_op = NULL;
3002 }
3003
3004 if (last_arith_dst != NULL && last_arith_dst != &po->operand[0]) {
3005 if (is_opr_modified(last_arith_dst, po))
3006 last_arith_dst = NULL;
3007 }
3ebea2cf 3008
3009 label_pending = 0;
91977a1c 3010 }
3011
3012 fprintf(fout, "}\n\n");
3013
3014 // cleanup
3015 for (i = 0; i < opcnt; i++) {
4c45fa73 3016 struct label_ref *lr, *lr_del;
3017
3018 lr = g_label_refs[i].next;
3019 while (lr != NULL) {
3020 lr_del = lr;
3021 lr = lr->next;
3022 free(lr_del);
3023 }
3024 g_label_refs[i].i = -1;
3025 g_label_refs[i].next = NULL;
3026
91977a1c 3027 if (ops[i].op == OP_CALL) {
3028 pp = ops[i].datap;
3029 if (pp) {
3030 proto_release(pp);
3031 free(pp);
3032 }
3033 }
3034 }
3035 proto_release(&g_func_pp);
3036}
c36e914d 3037
d4e3b5db 3038static void set_label(int i, const char *name)
3039{
3040 const char *p;
3041 int len;
3042
3043 len = strlen(name);
3044 p = strchr(name, ':');
3045 if (p != NULL)
3046 len = p - name;
3047
3048 if (len > sizeof(g_labels[0]) - 1)
3049 aerr("label '%s' too long: %d\n", name, len);
3050 if (g_labels[i][0] != 0)
3051 aerr("dupe label '%s'?\n", name);
3052 memcpy(g_labels[i], name, len);
3053 g_labels[i][len] = 0;
3054}
3055
bfa4a6ee 3056// '=' needs special treatment..
3057static char *next_word_s(char *w, size_t wsize, char *s)
3058{
3059 size_t i;
3060
3061 s = sskip(s);
3062
3063 for (i = 0; i < wsize - 1; i++) {
3064 if (s[i] == 0 || my_isblank(s[i]) || (s[i] == '=' && i > 0))
3065 break;
3066 w[i] = s[i];
3067 }
3068 w[i] = 0;
3069
3070 if (s[i] != 0 && !my_isblank(s[i]) && s[i] != '=')
3071 printf("warning: '%s' truncated\n", w);
3072
3073 return s + i;
3074}
3075
3076static int cmpstringp(const void *p1, const void *p2)
3077{
3078 return strcmp(*(char * const *)p1, *(char * const *)p2);
3079}
3080
91977a1c 3081int main(int argc, char *argv[])
3082{
06c5d854 3083 FILE *fout, *fasm, *frlist;
4c45fa73 3084 struct parsed_data *pd = NULL;
3085 int pd_alloc = 0;
3086 char **rlist = NULL;
3087 int rlist_len = 0;
3088 int rlist_alloc = 0;
91977a1c 3089 char line[256];
3090 char words[16][256];
4c45fa73 3091 enum opr_lenmod lmod;
91977a1c 3092 int in_func = 0;
4c45fa73 3093 int pending_endp = 0;
bfa4a6ee 3094 int skip_func = 0;
940e8e66 3095 int skip_warned = 0;
91977a1c 3096 int eq_alloc;
bfa4a6ee 3097 int verbose = 0;
3098 int arg_out;
3099 int arg = 1;
91977a1c 3100 int pi = 0;
4c45fa73 3101 int i, j, len;
91977a1c 3102 char *p;
3103 int wordc;
3104
bfa4a6ee 3105 if (argv[1] && IS(argv[1], "-v")) {
3106 verbose = 1;
3107 arg++;
3108 }
3109
3110 if (argc < arg + 3) {
3111 printf("usage:\n%s [-v] <.c> <.asm> <hdrf> [rlist]*\n",
91977a1c 3112 argv[0]);
3113 return 1;
3114 }
3115
bfa4a6ee 3116 arg_out = arg++;
91977a1c 3117
bfa4a6ee 3118 asmfn = argv[arg++];
91977a1c 3119 fasm = fopen(asmfn, "r");
3120 my_assert_not(fasm, NULL);
3121
bfa4a6ee 3122 hdrfn = argv[arg++];
06c5d854 3123 g_fhdr = fopen(hdrfn, "r");
3124 my_assert_not(g_fhdr, NULL);
bfa4a6ee 3125
3126 rlist_alloc = 64;
3127 rlist = malloc(rlist_alloc * sizeof(rlist[0]));
3128 my_assert_not(rlist, NULL);
3129 // needs special handling..
3130 rlist[rlist_len++] = "__alloca_probe";
3131
3132 for (; arg < argc; arg++) {
3133 frlist = fopen(argv[arg], "r");
3134 my_assert_not(frlist, NULL);
3135
3136 while (fgets(line, sizeof(line), frlist)) {
3137 p = sskip(line);
3138 if (*p == 0 || *p == ';' || *p == '#')
3139 continue;
3140
3141 p = next_word(words[0], sizeof(words[0]), p);
3142 if (words[0][0] == 0)
3143 continue;
3144
3145 if (rlist_len >= rlist_alloc) {
3146 rlist_alloc = rlist_alloc * 2 + 64;
3147 rlist = realloc(rlist, rlist_alloc * sizeof(rlist[0]));
3148 my_assert_not(rlist, NULL);
3149 }
3150 rlist[rlist_len++] = strdup(words[0]);
3151 }
3152
3153 fclose(frlist);
3154 frlist = NULL;
3155 }
3156
3157 if (rlist_len > 0)
3158 qsort(rlist, rlist_len, sizeof(rlist[0]), cmpstringp);
3159
3160 fout = fopen(argv[arg_out], "w");
91977a1c 3161 my_assert_not(fout, NULL);
3162
3163 eq_alloc = 128;
3164 g_eqs = malloc(eq_alloc * sizeof(g_eqs[0]));
3165 my_assert_not(g_eqs, NULL);
3166
4c45fa73 3167 for (i = 0; i < ARRAY_SIZE(g_label_refs); i++) {
3168 g_label_refs[i].i = -1;
3169 g_label_refs[i].next = NULL;
3170 }
3171
91977a1c 3172 while (fgets(line, sizeof(line), fasm))
3173 {
4c45fa73 3174 wordc = 0;
91977a1c 3175 asmln++;
3176
3177 p = sskip(line);
1bafb621 3178 if (*p == 0)
91977a1c 3179 continue;
3180
1bafb621 3181 if (*p == ';') {
3182 static const char *attrs[] = {
3183 "bp-based frame",
3184 "library function",
3185 "static",
3186 "noreturn",
3187 "thunk",
3188 "fpd=",
3189 };
4c45fa73 3190 if (p[2] == '=' && IS_START(p, "; =============== S U B"))
3191 goto do_pending_endp; // eww..
3192
3193 if (p[2] != 'A' || !IS_START(p, "; Attributes:"))
1bafb621 3194 continue;
3195
3196 // parse IDA's attribute-list comment
4c45fa73 3197 g_ida_func_attr = 0;
1bafb621 3198 p = sskip(p + 13);
3199 // get rid of random tabs
3200 for (i = 0; p[i] != 0; i++)
3201 if (p[i] == '\t')
3202 p[i] = ' ';
3203
3204 for (; *p != 0; p = sskip(p)) {
3205 for (i = 0; i < ARRAY_SIZE(attrs); i++) {
3206 if (!strncmp(p, attrs[i], strlen(attrs[i]))) {
4c45fa73 3207 g_ida_func_attr |= 1 << i;
1bafb621 3208 p += strlen(attrs[i]);
3209 break;
3210 }
3211 }
3212 if (i == ARRAY_SIZE(attrs)) {
3213 anote("unparsed IDA attr: %s\n", p);
3214 break;
3215 }
3216 if (IS(attrs[i], "fpd=")) {
3217 p = next_word(words[0], sizeof(words[0]), p);
3218 // ignore for now..
3219 }
3220 }
3221 continue;
3222 }
3223
06c5d854 3224parse_words:
91977a1c 3225 memset(words, 0, sizeof(words));
3226 for (wordc = 0; wordc < 16; wordc++) {
bfa4a6ee 3227 p = sskip(next_word_s(words[wordc], sizeof(words[0]), p));
91977a1c 3228 if (*p == 0 || *p == ';') {
3229 wordc++;
3230 break;
3231 }
3232 }
3233
06c5d854 3234 // alow asm patches in comments
3ebea2cf 3235 if (*p == ';' && IS_START(p, "; sctpatch:")) {
3236 p = sskip(p + 11);
06c5d854 3237 if (*p == 0 || *p == ';')
3238 continue;
3239 goto parse_words; // lame
3240 }
3241
91977a1c 3242 if (wordc == 0) {
3243 // shouldn't happen
3244 awarn("wordc == 0?\n");
3245 continue;
3246 }
3247
3248 // don't care about this:
3249 if (words[0][0] == '.'
3250 || IS(words[0], "include")
3251 || IS(words[0], "assume") || IS(words[1], "segment")
3252 || IS(words[0], "align"))
3253 {
3254 continue;
3255 }
3256
4c45fa73 3257do_pending_endp:
3258 // do delayed endp processing to collect switch jumptables
3259 if (pending_endp) {
3260 if (in_func && !skip_func && wordc >= 2
3261 && ((words[0][0] == 'd' && words[0][2] == 0)
3262 || (words[1][0] == 'd' && words[1][2] == 0)))
3263 {
3264 i = 1;
3265 if (words[1][0] == 'd' && words[1][2] == 0) {
3266 // label
3267 if (g_func_pd_cnt >= pd_alloc) {
3268 pd_alloc = pd_alloc * 2 + 16;
3269 g_func_pd = realloc(g_func_pd,
3270 sizeof(g_func_pd[0]) * pd_alloc);
3271 my_assert_not(g_func_pd, NULL);
3272 }
3273 pd = &g_func_pd[g_func_pd_cnt];
3274 g_func_pd_cnt++;
3275 memset(pd, 0, sizeof(*pd));
3276 strcpy(pd->label, words[0]);
3277 pd->type = OPT_CONST;
3278 pd->lmod = lmod_from_directive(words[1]);
3279 i = 2;
3280 }
3281 else {
3282 lmod = lmod_from_directive(words[0]);
3283 if (lmod != pd->lmod)
3284 aerr("lmod change? %d->%d\n", pd->lmod, lmod);
3285 }
3286
3287 if (pd->count_alloc < pd->count + wordc) {
3288 pd->count_alloc = pd->count_alloc * 2 + 14 + wordc;
3289 pd->d = realloc(pd->d, sizeof(pd->d[0]) * pd->count_alloc);
3290 my_assert_not(pd->d, NULL);
3291 }
3292 for (; i < wordc; i++) {
3293 if (IS(words[i], "offset")) {
3294 pd->type = OPT_OFFSET;
3295 i++;
3296 }
3297 p = strchr(words[i], ',');
3298 if (p != NULL)
3299 *p = 0;
3300 if (pd->type == OPT_OFFSET)
3301 pd->d[pd->count].u.label = strdup(words[i]);
3302 else
3303 pd->d[pd->count].u.val = parse_number(words[i]);
3304 pd->d[pd->count].bt_i = -1;
3305 pd->count++;
3306 }
3307 continue;
3308 }
3309
3310 if (in_func && !skip_func)
3311 gen_func(fout, g_fhdr, g_func, pi);
3312
3313 pending_endp = 0;
3314 in_func = 0;
3315 g_ida_func_attr = 0;
3316 skip_warned = 0;
3317 skip_func = 0;
3318 g_func[0] = 0;
3319 if (pi != 0) {
3320 memset(&ops, 0, pi * sizeof(ops[0]));
3321 memset(g_labels, 0, pi * sizeof(g_labels[0]));
3322 pi = 0;
3323 }
3324 g_eqcnt = 0;
3325 for (i = 0; i < g_func_pd_cnt; i++) {
3326 pd = &g_func_pd[i];
3327 if (pd->type == OPT_OFFSET) {
3328 for (j = 0; j < pd->count; j++)
3329 free(pd->d[j].u.label);
3330 }
3331 free(pd->d);
3332 pd->d = NULL;
3333 }
3334 g_func_pd_cnt = 0;
3335 pd = NULL;
3336 if (wordc == 0)
3337 continue;
3338 }
3339
91977a1c 3340 if (IS(words[1], "proc")) {
3341 if (in_func)
3342 aerr("proc '%s' while in_func '%s'?\n",
3343 words[0], g_func);
bfa4a6ee 3344 p = words[0];
4c45fa73 3345 if ((g_ida_func_attr & IDAFA_THUNK)
1bafb621 3346 || bsearch(&p, rlist, rlist_len, sizeof(rlist[0]), cmpstringp))
bfa4a6ee 3347 skip_func = 1;
91977a1c 3348 strcpy(g_func, words[0]);
d4e3b5db 3349 set_label(0, words[0]);
91977a1c 3350 in_func = 1;
3351 continue;
3352 }
3353
3354 if (IS(words[1], "endp")) {
3355 if (!in_func)
3356 aerr("endp '%s' while not in_func?\n", words[0]);
3357 if (!IS(g_func, words[0]))
3358 aerr("endp '%s' while in_func '%s'?\n",
3359 words[0], g_func);
bfa4a6ee 3360
4c45fa73 3361 pending_endp = 1;
91977a1c 3362 continue;
3363 }
3364
bfa4a6ee 3365 p = strchr(words[0], ':');
3366 if (p != NULL) {
d4e3b5db 3367 set_label(pi, words[0]);
bfa4a6ee 3368 continue;
3369 }
3370
3371 if (!in_func || skip_func) {
3372 if (!skip_warned && !skip_func && g_labels[pi][0] != 0) {
3373 if (verbose)
3374 anote("skipping from '%s'\n", g_labels[pi]);
3375 skip_warned = 1;
3376 }
3377 g_labels[pi][0] = 0;
3378 continue;
3379 }
3380
4c45fa73 3381 if (wordc > 1 && IS(words[1], "=")) {
91977a1c 3382 if (wordc != 5)
3383 aerr("unhandled equ, wc=%d\n", wordc);
3384 if (g_eqcnt >= eq_alloc) {
3385 eq_alloc *= 2;
3386 g_eqs = realloc(g_eqs, eq_alloc * sizeof(g_eqs[0]));
3387 my_assert_not(g_eqs, NULL);
3388 }
3389
3390 len = strlen(words[0]);
3391 if (len > sizeof(g_eqs[0].name) - 1)
3392 aerr("equ name too long: %d\n", len);
3393 strcpy(g_eqs[g_eqcnt].name, words[0]);
3394
3395 if (!IS(words[3], "ptr"))
3396 aerr("unhandled equ\n");
3397 if (IS(words[2], "dword"))
3398 g_eqs[g_eqcnt].lmod = OPLM_DWORD;
3399 else if (IS(words[2], "word"))
3400 g_eqs[g_eqcnt].lmod = OPLM_WORD;
3401 else if (IS(words[2], "byte"))
3402 g_eqs[g_eqcnt].lmod = OPLM_BYTE;
3403 else
3404 aerr("bad lmod: '%s'\n", words[2]);
3405
3406 g_eqs[g_eqcnt].offset = parse_number(words[4]);
3407 g_eqcnt++;
3408 continue;
3409 }
3410
3411 if (pi >= ARRAY_SIZE(ops))
3412 aerr("too many ops\n");
3413
91977a1c 3414 parse_op(&ops[pi], words, wordc);
3415 pi++;
91977a1c 3416 }
3417
3418 fclose(fout);
3419 fclose(fasm);
06c5d854 3420 fclose(g_fhdr);
91977a1c 3421
3422 return 0;
c36e914d 3423}
91977a1c 3424
3425// vim:ts=2:shiftwidth=2:expandtab
Unnamed repository; edit this file 'description' to name the repository.