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