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