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