?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
Saner type for __builtin_va_list
[smatch.git] / linearize.c
blob1a192149093a356fdb8faa3c32b5d54d5d197d6c
1 /*
2 * Linearize - walk the statement tree (but _not_ the expressions)
3 * to generate a linear version of it and the basic blocks.
4 *
5 * NOTE! We're not interested in the actual sub-expressions yet,
6 * even though they can generate conditional branches and
7 * subroutine calls. That's all "local" behaviour.
8 *
9 * Copyright (C) 2004 Linus Torvalds
10 * Copyright (C) 2004 Christopher Li
11 */
12
13 #include <string.h>
14 #include <stdarg.h>
15 #include <stdlib.h>
16 #include <stdio.h>
17 #include <assert.h>
18
19 #include "parse.h"
20 #include "expression.h"
21 #include "linearize.h"
22 #include "flow.h"
23 #include "target.h"
24
25 pseudo_t linearize_statement(struct entrypoint *ep, struct statement *stmt);
26 pseudo_t linearize_expression(struct entrypoint *ep, struct expression *expr);
27
28 static pseudo_t add_binary_op(struct entrypoint *ep, struct symbol *ctype, int op, pseudo_t left, pseudo_t right);
29 static pseudo_t add_setval(struct entrypoint *ep, struct symbol *ctype, struct expression *val);
30 static pseudo_t linearize_one_symbol(struct entrypoint *ep, struct symbol *sym);
31
32 struct access_data;
33 static pseudo_t add_load(struct entrypoint *ep, struct access_data *);
34 static pseudo_t linearize_initializer(struct entrypoint *ep, struct expression *initializer, struct access_data *);
35
36 struct pseudo void_pseudo = {};
37
38 static struct position current_pos;
39
40 ALLOCATOR(pseudo_user, "pseudo_user");
41
42 static struct instruction *alloc_instruction(int opcode, int size)
43 {
44 struct instruction * insn = __alloc_instruction(0);
45 insn->opcode = opcode;
46 insn->size = size;
47 insn->pos = current_pos;
48 return insn;
49 }
50
51 static inline int type_size(struct symbol *type)
52 {
53 return type ? type->bit_size > 0 ? type->bit_size : 0 : 0;
54 }
55
56 static struct instruction *alloc_typed_instruction(int opcode, struct symbol *type)
57 {
58 struct instruction *insn = alloc_instruction(opcode, type_size(type));
59 insn->type = type;
60 return insn;
61 }
62
63 static struct entrypoint *alloc_entrypoint(void)
64 {
65 return __alloc_entrypoint(0);
66 }
67
68 static struct basic_block *alloc_basic_block(struct entrypoint *ep, struct position pos)
69 {
70 struct basic_block *bb = __alloc_basic_block(0);
71 bb->context = -1;
72 bb->pos = pos;
73 bb->ep = ep;
74 return bb;
75 }
76
77 static struct multijmp *alloc_multijmp(struct basic_block *target, int begin, int end)
78 {
79 struct multijmp *multijmp = __alloc_multijmp(0);
80 multijmp->target = target;
81 multijmp->begin = begin;
82 multijmp->end = end;
83 return multijmp;
84 }
85
86 static inline int regno(pseudo_t n)
87 {
88 int retval = -1;
89 if (n && n->type == PSEUDO_REG)
90 retval = n->nr;
91 return retval;
92 }
93
94 const char *show_pseudo(pseudo_t pseudo)
95 {
96 static int n;
97 static char buffer[4][64];
98 char *buf;
99 int i;
100
101 if (!pseudo)
102 return "no pseudo";
103 if (pseudo == VOID)
104 return "VOID";
105 buf = buffer[3 & ++n];
106 switch(pseudo->type) {
107 case PSEUDO_SYM: {
108 struct symbol *sym = pseudo->sym;
109 struct expression *expr;
110
111 if (sym->bb_target) {
112 snprintf(buf, 64, ".L%p", sym->bb_target);
113 break;
114 }
115 if (sym->ident) {
116 snprintf(buf, 64, "%s", show_ident(sym->ident));
117 break;
118 }
119 expr = sym->initializer;
120 snprintf(buf, 64, "<anon symbol:%p>", sym);
121 if (expr) {
122 switch (expr->type) {
123 case EXPR_VALUE:
124 snprintf(buf, 64, "<symbol value: %lld>", expr->value);
125 break;
126 case EXPR_STRING:
127 return show_string(expr->string);
128 default:
129 break;
130 }
131 }
132 break;
133 }
134 case PSEUDO_REG:
135 i = snprintf(buf, 64, "%%r%d", pseudo->nr);
136 if (pseudo->ident)
137 sprintf(buf+i, "(%s)", show_ident(pseudo->ident));
138 break;
139 case PSEUDO_VAL: {
140 long long value = pseudo->value;
141 if (value > 1000 || value < -1000)
142 snprintf(buf, 64, "$%#llx", value);
143 else
144 snprintf(buf, 64, "$%lld", value);
145 break;
146 }
147 case PSEUDO_ARG:
148 snprintf(buf, 64, "%%arg%d", pseudo->nr);
149 break;
150 case PSEUDO_PHI:
151 i = snprintf(buf, 64, "%%phi%d", pseudo->nr);
152 if (pseudo->ident)
153 sprintf(buf+i, "(%s)", show_ident(pseudo->ident));
154 break;
155 default:
156 snprintf(buf, 64, "<bad pseudo type %d>", pseudo->type);
157 }
158 return buf;
159 }
160
161 static const char *opcodes[] = {
162 [OP_BADOP] = "bad_op",
163
164 /* Fn entrypoint */
165 [OP_ENTRY] = "<entry-point>",
166
167 /* Terminator */
168 [OP_RET] = "ret",
169 [OP_BR] = "br",
170 [OP_SWITCH] = "switch",
171 [OP_INVOKE] = "invoke",
172 [OP_COMPUTEDGOTO] = "jmp *",
173 [OP_UNWIND] = "unwind",
174
175 /* Binary */
176 [OP_ADD] = "add",
177 [OP_SUB] = "sub",
178 [OP_MULU] = "mulu",
179 [OP_MULS] = "muls",
180 [OP_DIVU] = "divu",
181 [OP_DIVS] = "divs",
182 [OP_MODU] = "modu",
183 [OP_MODS] = "mods",
184 [OP_SHL] = "shl",
185 [OP_LSR] = "lsr",
186 [OP_ASR] = "asr",
187
188 /* Logical */
189 [OP_AND] = "and",
190 [OP_OR] = "or",
191 [OP_XOR] = "xor",
192 [OP_AND_BOOL] = "and-bool",
193 [OP_OR_BOOL] = "or-bool",
194
195 /* Binary comparison */
196 [OP_SET_EQ] = "seteq",
197 [OP_SET_NE] = "setne",
198 [OP_SET_LE] = "setle",
199 [OP_SET_GE] = "setge",
200 [OP_SET_LT] = "setlt",
201 [OP_SET_GT] = "setgt",
202 [OP_SET_B] = "setb",
203 [OP_SET_A] = "seta",
204 [OP_SET_BE] = "setbe",
205 [OP_SET_AE] = "setae",
206
207 /* Uni */
208 [OP_NOT] = "not",
209 [OP_NEG] = "neg",
210
211 /* Special three-input */
212 [OP_SEL] = "select",
213
214 /* Memory */
215 [OP_MALLOC] = "malloc",
216 [OP_FREE] = "free",
217 [OP_ALLOCA] = "alloca",
218 [OP_LOAD] = "load",
219 [OP_STORE] = "store",
220 [OP_SETVAL] = "set",
221 [OP_SYMADDR] = "symaddr",
222 [OP_GET_ELEMENT_PTR] = "getelem",
223
224 /* Other */
225 [OP_PHI] = "phi",
226 [OP_PHISOURCE] = "phisrc",
227 [OP_CAST] = "cast",
228 [OP_SCAST] = "scast",
229 [OP_FPCAST] = "fpcast",
230 [OP_PTRCAST] = "ptrcast",
231 [OP_INLINED_CALL] = "# call",
232 [OP_CALL] = "call",
233 [OP_VANEXT] = "va_next",
234 [OP_VAARG] = "va_arg",
235 [OP_SLICE] = "slice",
236 [OP_SNOP] = "snop",
237 [OP_LNOP] = "lnop",
238 [OP_NOP] = "nop",
239 [OP_DEATHNOTE] = "dead",
240 [OP_ASM] = "asm",
241
242 /* Sparse tagging (line numbers, context, whatever) */
243 [OP_CONTEXT] = "context",
244 [OP_RANGE] = "range-check",
245
246 [OP_COPY] = "copy",
247 };
248
249 static char *show_asm_constraints(char *buf, const char *sep, struct asm_constraint_list *list)
250 {
251 struct asm_constraint *entry;
252
253 FOR_EACH_PTR(list, entry) {
254 buf += sprintf(buf, "%s\"%s\"", sep, entry->constraint);
255 if (entry->pseudo)
256 buf += sprintf(buf, " (%s)", show_pseudo(entry->pseudo));
257 if (entry->ident)
258 buf += sprintf(buf, " [%s]", show_ident(entry->ident));
259 sep = ", ";
260 } END_FOR_EACH_PTR(entry);
261 return buf;
262 }
263
264 static char *show_asm(char *buf, struct instruction *insn)
265 {
266 struct asm_rules *rules = insn->asm_rules;
267
268 buf += sprintf(buf, "\"%s\"", insn->string);
269 buf = show_asm_constraints(buf, "\n\t\tout: ", rules->outputs);
270 buf = show_asm_constraints(buf, "\n\t\tin: ", rules->inputs);
271 buf = show_asm_constraints(buf, "\n\t\tclobber: ", rules->clobbers);
272 return buf;
273 }
274
275 const char *show_instruction(struct instruction *insn)
276 {
277 int opcode = insn->opcode;
278 static char buffer[4096];
279 char *buf;
280
281 buf = buffer;
282 if (!insn->bb)
283 buf += sprintf(buf, "# ");
284
285 if (opcode < sizeof(opcodes)/sizeof(char *)) {
286 const char *op = opcodes[opcode];
287 if (!op)
288 buf += sprintf(buf, "opcode:%d", opcode);
289 else
290 buf += sprintf(buf, "%s", op);
291 if (insn->size)
292 buf += sprintf(buf, ".%d", insn->size);
293 memset(buf, ' ', 20);
294 buf++;
295 }
296
297 if (buf < buffer + 12)
298 buf = buffer + 12;
299 switch (opcode) {
300 case OP_RET:
301 if (insn->src && insn->src != VOID)
302 buf += sprintf(buf, "%s", show_pseudo(insn->src));
303 break;
304 case OP_BR:
305 if (insn->bb_true && insn->bb_false) {
306 buf += sprintf(buf, "%s, .L%p, .L%p", show_pseudo(insn->cond), insn->bb_true, insn->bb_false);
307 break;
308 }
309 buf += sprintf(buf, ".L%p", insn->bb_true ? insn->bb_true : insn->bb_false);
310 break;
311
312 case OP_SYMADDR: {
313 struct symbol *sym = insn->symbol->sym;
314 buf += sprintf(buf, "%s <- ", show_pseudo(insn->target));
315
316 if (sym->bb_target) {
317 buf += sprintf(buf, ".L%p", sym->bb_target);
318 break;
319 }
320 if (sym->ident) {
321 buf += sprintf(buf, "%s", show_ident(sym->ident));
322 break;
323 }
324 buf += sprintf(buf, "<anon symbol:%p>", sym);
325 break;
326 }
327
328 case OP_SETVAL: {
329 struct expression *expr = insn->val;
330 buf += sprintf(buf, "%s <- ", show_pseudo(insn->target));
331
332 if (!expr) {
333 buf += sprintf(buf, "%s", "<none>");
334 break;
335 }
336
337 switch (expr->type) {
338 case EXPR_VALUE:
339 buf += sprintf(buf, "%lld", expr->value);
340 break;
341 case EXPR_FVALUE:
342 buf += sprintf(buf, "%Lf", expr->fvalue);
343 break;
344 case EXPR_STRING:
345 buf += sprintf(buf, "%.40s", show_string(expr->string));
346 break;
347 case EXPR_SYMBOL:
348 buf += sprintf(buf, "%s", show_ident(expr->symbol->ident));
349 break;
350 case EXPR_LABEL:
351 buf += sprintf(buf, ".L%p", expr->symbol->bb_target);
352 break;
353 default:
354 buf += sprintf(buf, "SETVAL EXPR TYPE %d", expr->type);
355 }
356 break;
357 }
358 case OP_SWITCH: {
359 struct multijmp *jmp;
360 buf += sprintf(buf, "%s", show_pseudo(insn->target));
361 FOR_EACH_PTR(insn->multijmp_list, jmp) {
362 if (jmp->begin == jmp->end)
363 buf += sprintf(buf, ", %d -> .L%p", jmp->begin, jmp->target);
364 else if (jmp->begin < jmp->end)
365 buf += sprintf(buf, ", %d ... %d -> .L%p", jmp->begin, jmp->end, jmp->target);
366 else
367 buf += sprintf(buf, ", default -> .L%p", jmp->target);
368 } END_FOR_EACH_PTR(jmp);
369 break;
370 }
371 case OP_COMPUTEDGOTO: {
372 struct multijmp *jmp;
373 buf += sprintf(buf, "%s", show_pseudo(insn->target));
374 FOR_EACH_PTR(insn->multijmp_list, jmp) {
375 buf += sprintf(buf, ", .L%p", jmp->target);
376 } END_FOR_EACH_PTR(jmp);
377 break;
378 }
379
380 case OP_PHISOURCE: {
381 struct instruction *phi;
382 buf += sprintf(buf, "%s <- %s ", show_pseudo(insn->target), show_pseudo(insn->phi_src));
383 FOR_EACH_PTR(insn->phi_users, phi) {
384 buf += sprintf(buf, " (%s)", show_pseudo(phi->target));
385 } END_FOR_EACH_PTR(phi);
386 break;
387 }
388
389 case OP_PHI: {
390 pseudo_t phi;
391 const char *s = " <-";
392 buf += sprintf(buf, "%s", show_pseudo(insn->target));
393 FOR_EACH_PTR(insn->phi_list, phi) {
394 buf += sprintf(buf, "%s %s", s, show_pseudo(phi));
395 s = ",";
396 } END_FOR_EACH_PTR(phi);
397 break;
398 }
399 case OP_LOAD: case OP_LNOP:
400 buf += sprintf(buf, "%s <- %d[%s]", show_pseudo(insn->target), insn->offset, show_pseudo(insn->src));
401 break;
402 case OP_STORE: case OP_SNOP:
403 buf += sprintf(buf, "%s -> %d[%s]", show_pseudo(insn->target), insn->offset, show_pseudo(insn->src));
404 break;
405 case OP_INLINED_CALL:
406 case OP_CALL: {
407 struct pseudo *arg;
408 if (insn->target && insn->target != VOID)
409 buf += sprintf(buf, "%s <- ", show_pseudo(insn->target));
410 buf += sprintf(buf, "%s", show_pseudo(insn->func));
411 FOR_EACH_PTR(insn->arguments, arg) {
412 buf += sprintf(buf, ", %s", show_pseudo(arg));
413 } END_FOR_EACH_PTR(arg);
414 break;
415 }
416 case OP_CAST:
417 case OP_SCAST:
418 case OP_FPCAST:
419 case OP_PTRCAST:
420 buf += sprintf(buf, "%s <- (%d) %s",
421 show_pseudo(insn->target),
422 type_size(insn->orig_type),
423 show_pseudo(insn->src));
424 break;
425 case OP_BINARY ... OP_BINARY_END:
426 case OP_BINCMP ... OP_BINCMP_END:
427 buf += sprintf(buf, "%s <- %s, %s", show_pseudo(insn->target), show_pseudo(insn->src1), show_pseudo(insn->src2));
428 break;
429
430 case OP_SEL:
431 buf += sprintf(buf, "%s <- %s, %s, %s", show_pseudo(insn->target),
432 show_pseudo(insn->src1), show_pseudo(insn->src2), show_pseudo(insn->src3));
433 break;
434
435 case OP_SLICE:
436 buf += sprintf(buf, "%s <- %s, %d, %d", show_pseudo(insn->target), show_pseudo(insn->base), insn->from, insn->len);
437 break;
438
439 case OP_NOT: case OP_NEG:
440 buf += sprintf(buf, "%s <- %s", show_pseudo(insn->target), show_pseudo(insn->src1));
441 break;
442
443 case OP_CONTEXT:
444 buf += sprintf(buf, "%s%d", insn->check ? "check: " : "", insn->increment);
445 break;
446 case OP_RANGE:
447 buf += sprintf(buf, "%s between %s..%s", show_pseudo(insn->src1), show_pseudo(insn->src2), show_pseudo(insn->src3));
448 break;
449 case OP_NOP:
450 buf += sprintf(buf, "%s <- %s", show_pseudo(insn->target), show_pseudo(insn->src1));
451 break;
452 case OP_DEATHNOTE:
453 buf += sprintf(buf, "%s", show_pseudo(insn->target));
454 break;
455 case OP_ASM:
456 buf = show_asm(buf, insn);
457 break;
458 case OP_COPY:
459 buf += sprintf(buf, "%s <- %s", show_pseudo(insn->target), show_pseudo(insn->src));
460 break;
461 default:
462 break;
463 }
464
465 if (buf >= buffer + sizeof(buffer))
466 die("instruction buffer overflowed %td\n", buf - buffer);
467 do { --buf; } while (*buf == ' ');
468 *++buf = 0;
469 return buffer;
470 }
471
472 void show_bb(struct basic_block *bb)
473 {
474 struct instruction *insn;
475
476 printf(".L%p:\n", bb);
477 if (verbose) {
478 pseudo_t needs, defines;
479 printf("%s:%d\n", stream_name(bb->pos.stream), bb->pos.line);
480
481 FOR_EACH_PTR(bb->needs, needs) {
482 struct instruction *def = needs->def;
483 if (def->opcode != OP_PHI) {
484 printf(" **uses %s (from .L%p)**\n", show_pseudo(needs), def->bb);
485 } else {
486 pseudo_t phi;
487 const char *sep = " ";
488 printf(" **uses %s (from", show_pseudo(needs));
489 FOR_EACH_PTR(def->phi_list, phi) {
490 if (phi == VOID)
491 continue;
492 printf("%s(%s:.L%p)", sep, show_pseudo(phi), phi->def->bb);
493 sep = ", ";
494 } END_FOR_EACH_PTR(phi);
495 printf(")**\n");
496 }
497 } END_FOR_EACH_PTR(needs);
498
499 FOR_EACH_PTR(bb->defines, defines) {
500 printf(" **defines %s **\n", show_pseudo(defines));
501 } END_FOR_EACH_PTR(defines);
502
503 if (bb->parents) {
504 struct basic_block *from;
505 FOR_EACH_PTR(bb->parents, from) {
506 printf(" **from %p (%s:%d:%d)**\n", from,
507 stream_name(from->pos.stream), from->pos.line, from->pos.pos);
508 } END_FOR_EACH_PTR(from);
509 }
510
511 if (bb->children) {
512 struct basic_block *to;
513 FOR_EACH_PTR(bb->children, to) {
514 printf(" **to %p (%s:%d:%d)**\n", to,
515 stream_name(to->pos.stream), to->pos.line, to->pos.pos);
516 } END_FOR_EACH_PTR(to);
517 }
518 }
519
520 FOR_EACH_PTR(bb->insns, insn) {
521 if (!insn->bb && verbose < 2)
522 continue;
523 printf("\t%s\n", show_instruction(insn));
524 } END_FOR_EACH_PTR(insn);
525 if (!bb_terminated(bb))
526 printf("\tEND\n");
527 }
528
529 static void show_symbol_usage(pseudo_t pseudo)
530 {
531 struct pseudo_user *pu;
532
533 if (pseudo) {
534 FOR_EACH_PTR(pseudo->users, pu) {
535 printf("\t%s\n", show_instruction(pu->insn));
536 } END_FOR_EACH_PTR(pu);
537 }
538 }
539
540 void show_entry(struct entrypoint *ep)
541 {
542 struct symbol *sym;
543 struct basic_block *bb;
544
545 printf("%s:\n", show_ident(ep->name->ident));
546
547 if (verbose) {
548 printf("ep %p: %s\n", ep, show_ident(ep->name->ident));
549
550 FOR_EACH_PTR(ep->syms, sym) {
551 if (!sym->pseudo)
552 continue;
553 if (!sym->pseudo->users)
554 continue;
555 printf(" sym: %p %s\n", sym, show_ident(sym->ident));
556 if (sym->ctype.modifiers & (MOD_EXTERN | MOD_STATIC | MOD_ADDRESSABLE))
557 printf("\texternal visibility\n");
558 show_symbol_usage(sym->pseudo);
559 } END_FOR_EACH_PTR(sym);
560
561 printf("\n");
562 }
563
564 FOR_EACH_PTR(ep->bbs, bb) {
565 if (!bb)
566 continue;
567 if (!bb->parents && !bb->children && !bb->insns && verbose < 2)
568 continue;
569 show_bb(bb);
570 printf("\n");
571 } END_FOR_EACH_PTR(bb);
572
573 printf("\n");
574 }
575
576 static void bind_label(struct symbol *label, struct basic_block *bb, struct position pos)
577 {
578 if (label->bb_target)
579 warning(pos, "label '%s' already bound", show_ident(label->ident));
580 label->bb_target = bb;
581 }
582
583 static struct basic_block * get_bound_block(struct entrypoint *ep, struct symbol *label)
584 {
585 struct basic_block *bb = label->bb_target;
586
587 if (!bb) {
588 bb = alloc_basic_block(ep, label->pos);
589 label->bb_target = bb;
590 }
591 return bb;
592 }
593
594 static void finish_block(struct entrypoint *ep)
595 {
596 struct basic_block *src = ep->active;
597 if (bb_reachable(src))
598 ep->active = NULL;
599 }
600
601 static void add_goto(struct entrypoint *ep, struct basic_block *dst)
602 {
603 struct basic_block *src = ep->active;
604 if (bb_reachable(src)) {
605 struct instruction *br = alloc_instruction(OP_BR, 0);
606 br->bb_true = dst;
607 add_bb(&dst->parents, src);
608 add_bb(&src->children, dst);
609 br->bb = src;
610 add_instruction(&src->insns, br);
611 ep->active = NULL;
612 }
613 }
614
615 static void add_one_insn(struct entrypoint *ep, struct instruction *insn)
616 {
617 struct basic_block *bb = ep->active;
618
619 if (bb_reachable(bb)) {
620 insn->bb = bb;
621 add_instruction(&bb->insns, insn);
622 }
623 }
624
625 static void set_activeblock(struct entrypoint *ep, struct basic_block *bb)
626 {
627 if (!bb_terminated(ep->active))
628 add_goto(ep, bb);
629
630 ep->active = bb;
631 if (bb_reachable(bb))
632 add_bb(&ep->bbs, bb);
633 }
634
635 static void remove_parent(struct basic_block *child, struct basic_block *parent)
636 {
637 remove_bb_from_list(&child->parents, parent, 1);
638 if (!child->parents)
639 kill_bb(child);
640 }
641
642 /* Change a "switch" into a branch */
643 void insert_branch(struct basic_block *bb, struct instruction *jmp, struct basic_block *target)
644 {
645 struct instruction *br, *old;
646 struct basic_block *child;
647
648 /* Remove the switch */
649 old = delete_last_instruction(&bb->insns);
650 assert(old == jmp);
651
652 br = alloc_instruction(OP_BR, 0);
653 br->bb = bb;
654 br->bb_true = target;
655 add_instruction(&bb->insns, br);
656
657 FOR_EACH_PTR(bb->children, child) {
658 if (child == target) {
659 target = NULL; /* Trigger just once */
660 continue;
661 }
662 DELETE_CURRENT_PTR(child);
663 remove_parent(child, bb);
664 } END_FOR_EACH_PTR(child);
665 PACK_PTR_LIST(&bb->children);
666 }
667
668
669 void insert_select(struct basic_block *bb, struct instruction *br, struct instruction *phi_node, pseudo_t true, pseudo_t false)
670 {
671 pseudo_t target;
672 struct instruction *select;
673
674 /* Remove the 'br' */
675 delete_last_instruction(&bb->insns);
676
677 select = alloc_instruction(OP_SEL, phi_node->size);
678 select->bb = bb;
679
680 assert(br->cond);
681 use_pseudo(select, br->cond, &select->src1);
682
683 target = phi_node->target;
684 assert(target->def == phi_node);
685 select->target = target;
686 target->def = select;
687
688 use_pseudo(select, true, &select->src2);
689 use_pseudo(select, false, &select->src3);
690
691 add_instruction(&bb->insns, select);
692 add_instruction(&bb->insns, br);
693 }
694
695 static inline int bb_empty(struct basic_block *bb)
696 {
697 return !bb->insns;
698 }
699
700 /* Add a label to the currently active block, return new active block */
701 static struct basic_block * add_label(struct entrypoint *ep, struct symbol *label)
702 {
703 struct basic_block *bb = label->bb_target;
704
705 if (bb) {
706 set_activeblock(ep, bb);
707 return bb;
708 }
709 bb = ep->active;
710 if (!bb_reachable(bb) || !bb_empty(bb)) {
711 bb = alloc_basic_block(ep, label->pos);
712 set_activeblock(ep, bb);
713 }
714 label->bb_target = bb;
715 return bb;
716 }
717
718 static void add_branch(struct entrypoint *ep, struct expression *expr, pseudo_t cond, struct basic_block *bb_true, struct basic_block *bb_false)
719 {
720 struct basic_block *bb = ep->active;
721 struct instruction *br;
722
723 if (bb_reachable(bb)) {
724 br = alloc_instruction(OP_BR, 0);
725 use_pseudo(br, cond, &br->cond);
726 br->bb_true = bb_true;
727 br->bb_false = bb_false;
728 add_bb(&bb_true->parents, bb);
729 add_bb(&bb_false->parents, bb);
730 add_bb(&bb->children, bb_true);
731 add_bb(&bb->children, bb_false);
732 add_one_insn(ep, br);
733 }
734 }
735
736 /* Dummy pseudo allocator */
737 pseudo_t alloc_pseudo(struct instruction *def)
738 {
739 static int nr = 0;
740 struct pseudo * pseudo = __alloc_pseudo(0);
741 pseudo->type = PSEUDO_REG;
742 pseudo->nr = ++nr;
743 pseudo->def = def;
744 return pseudo;
745 }
746
747 static void clear_symbol_pseudos(struct entrypoint *ep)
748 {
749 pseudo_t pseudo;
750
751 FOR_EACH_PTR(ep->accesses, pseudo) {
752 pseudo->sym->pseudo = NULL;
753 } END_FOR_EACH_PTR(pseudo);
754 }
755
756 static pseudo_t symbol_pseudo(struct entrypoint *ep, struct symbol *sym)
757 {
758 pseudo_t pseudo;
759
760 if (!sym)
761 return VOID;
762
763 pseudo = sym->pseudo;
764 if (!pseudo) {
765 pseudo = __alloc_pseudo(0);
766 pseudo->nr = -1;
767 pseudo->type = PSEUDO_SYM;
768 pseudo->sym = sym;
769 pseudo->ident = sym->ident;
770 sym->pseudo = pseudo;
771 add_pseudo(&ep->accesses, pseudo);
772 }
773 /* Symbol pseudos have neither nr, usage nor def */
774 return pseudo;
775 }
776
777 pseudo_t value_pseudo(long long val)
778 {
779 #define MAX_VAL_HASH 64
780 static struct pseudo_list *prev[MAX_VAL_HASH];
781 int hash = val & (MAX_VAL_HASH-1);
782 struct pseudo_list **list = prev + hash;
783 pseudo_t pseudo;
784
785 FOR_EACH_PTR(*list, pseudo) {
786 if (pseudo->value == val)
787 return pseudo;
788 } END_FOR_EACH_PTR(pseudo);
789
790 pseudo = __alloc_pseudo(0);
791 pseudo->type = PSEUDO_VAL;
792 pseudo->value = val;
793 add_pseudo(list, pseudo);
794
795 /* Value pseudos have neither nr, usage nor def */
796 return pseudo;
797 }
798
799 static pseudo_t argument_pseudo(struct entrypoint *ep, int nr)
800 {
801 pseudo_t pseudo = __alloc_pseudo(0);
802 struct instruction *entry = ep->entry;
803
804 pseudo->type = PSEUDO_ARG;
805 pseudo->nr = nr;
806 pseudo->def = entry;
807 add_pseudo(&entry->arg_list, pseudo);
808
809 /* Argument pseudos have neither usage nor def */
810 return pseudo;
811 }
812
813 pseudo_t alloc_phi(struct basic_block *source, pseudo_t pseudo, int size)
814 {
815 struct instruction *insn = alloc_instruction(OP_PHISOURCE, size);
816 pseudo_t phi = __alloc_pseudo(0);
817 static int nr = 0;
818
819 phi->type = PSEUDO_PHI;
820 phi->nr = ++nr;
821 phi->def = insn;
822
823 use_pseudo(insn, pseudo, &insn->phi_src);
824 insn->bb = source;
825 insn->target = phi;
826 add_instruction(&source->insns, insn);
827 return phi;
828 }
829
830 /*
831 * We carry the "access_data" structure around for any accesses,
832 * which simplifies things a lot. It contains all the access
833 * information in one place.
834 */
835 struct access_data {
836 struct symbol *result_type; // result ctype
837 struct symbol *source_type; // source ctype
838 pseudo_t address; // pseudo containing address ..
839 pseudo_t origval; // pseudo for original value ..
840 unsigned int offset, alignment; // byte offset
841 unsigned int bit_size, bit_offset; // which bits
842 struct position pos;
843 };
844
845 static void finish_address_gen(struct entrypoint *ep, struct access_data *ad)
846 {
847 }
848
849 static int linearize_simple_address(struct entrypoint *ep,
850 struct expression *addr,
851 struct access_data *ad)
852 {
853 if (addr->type == EXPR_SYMBOL) {
854 linearize_one_symbol(ep, addr->symbol);
855 ad->address = symbol_pseudo(ep, addr->symbol);
856 return 1;
857 }
858 if (addr->type == EXPR_BINOP) {
859 if (addr->right->type == EXPR_VALUE) {
860 if (addr->op == '+') {
861 ad->offset += get_expression_value(addr->right);
862 return linearize_simple_address(ep, addr->left, ad);
863 }
864 }
865 }
866 ad->address = linearize_expression(ep, addr);
867 return 1;
868 }
869
870 static struct symbol *base_type(struct symbol *sym)
871 {
872 struct symbol *base = sym;
873
874 if (sym) {
875 if (sym->type == SYM_NODE)
876 base = base->ctype.base_type;
877 if (base->type == SYM_BITFIELD)
878 return base->ctype.base_type;
879 }
880 return sym;
881 }
882
883 static int linearize_address_gen(struct entrypoint *ep,
884 struct expression *expr,
885 struct access_data *ad)
886 {
887 struct symbol *ctype = expr->ctype;
888
889 if (!ctype)
890 return 0;
891 ad->pos = expr->pos;
892 ad->result_type = ctype;
893 ad->source_type = base_type(ctype);
894 ad->bit_size = ctype->bit_size;
895 ad->alignment = ctype->ctype.alignment;
896 ad->bit_offset = ctype->bit_offset;
897 if (expr->type == EXPR_PREOP && expr->op == '*')
898 return linearize_simple_address(ep, expr->unop, ad);
899
900 warning(expr->pos, "generating address of non-lvalue (%d)", expr->type);
901 return 0;
902 }
903
904 static pseudo_t add_load(struct entrypoint *ep, struct access_data *ad)
905 {
906 struct instruction *insn;
907 pseudo_t new;
908
909 new = ad->origval;
910 if (0 && new)
911 return new;
912
913 insn = alloc_typed_instruction(OP_LOAD, ad->source_type);
914 new = alloc_pseudo(insn);
915 ad->origval = new;
916
917 insn->target = new;
918 insn->offset = ad->offset;
919 use_pseudo(insn, ad->address, &insn->src);
920 add_one_insn(ep, insn);
921 return new;
922 }
923
924 static void add_store(struct entrypoint *ep, struct access_data *ad, pseudo_t value)
925 {
926 struct basic_block *bb = ep->active;
927
928 if (bb_reachable(bb)) {
929 struct instruction *store = alloc_typed_instruction(OP_STORE, ad->source_type);
930 store->offset = ad->offset;
931 use_pseudo(store, value, &store->target);
932 use_pseudo(store, ad->address, &store->src);
933 add_one_insn(ep, store);
934 }
935 }
936
937 static pseudo_t linearize_store_gen(struct entrypoint *ep,
938 pseudo_t value,
939 struct access_data *ad)
940 {
941 pseudo_t store = value;
942
943 if (type_size(ad->source_type) != type_size(ad->result_type)) {
944 pseudo_t orig = add_load(ep, ad);
945 int shift = ad->bit_offset;
946 unsigned long long mask = (1ULL << ad->bit_size)-1;
947
948 if (shift) {
949 store = add_binary_op(ep, ad->source_type, OP_SHL, value, value_pseudo(shift));
950 mask <<= shift;
951 }
952 orig = add_binary_op(ep, ad->source_type, OP_AND, orig, value_pseudo(~mask));
953 store = add_binary_op(ep, ad->source_type, OP_OR, orig, store);
954 }
955 add_store(ep, ad, store);
956 return value;
957 }
958
959 static pseudo_t add_binary_op(struct entrypoint *ep, struct symbol *ctype, int op, pseudo_t left, pseudo_t right)
960 {
961 struct instruction *insn = alloc_typed_instruction(op, ctype);
962 pseudo_t target = alloc_pseudo(insn);
963 insn->target = target;
964 use_pseudo(insn, left, &insn->src1);
965 use_pseudo(insn, right, &insn->src2);
966 add_one_insn(ep, insn);
967 return target;
968 }
969
970 static pseudo_t add_setval(struct entrypoint *ep, struct symbol *ctype, struct expression *val)
971 {
972 struct instruction *insn = alloc_typed_instruction(OP_SETVAL, ctype);
973 pseudo_t target = alloc_pseudo(insn);
974 insn->target = target;
975 insn->val = val;
976 add_one_insn(ep, insn);
977 return target;
978 }
979
980 static pseudo_t add_symbol_address(struct entrypoint *ep, struct symbol *sym)
981 {
982 struct instruction *insn = alloc_instruction(OP_SYMADDR, bits_in_pointer);
983 pseudo_t target = alloc_pseudo(insn);
984
985 insn->target = target;
986 use_pseudo(insn, symbol_pseudo(ep, sym), &insn->symbol);
987 add_one_insn(ep, insn);
988 return target;
989 }
990
991 static pseudo_t linearize_load_gen(struct entrypoint *ep, struct access_data *ad)
992 {
993 pseudo_t new = add_load(ep, ad);
994
995 if (ad->bit_offset) {
996 pseudo_t shift = value_pseudo(ad->bit_offset);
997 pseudo_t newval = add_binary_op(ep, ad->source_type, OP_LSR, new, shift);
998 new = newval;
999 }
1000
1001 return new;
1002 }
1003
1004 static pseudo_t linearize_access(struct entrypoint *ep, struct expression *expr)
1005 {
1006 struct access_data ad = { NULL, };
1007 pseudo_t value;
1008
1009 if (!linearize_address_gen(ep, expr, &ad))
1010 return VOID;
1011 value = linearize_load_gen(ep, &ad);
1012 finish_address_gen(ep, &ad);
1013 return value;
1014 }
1015
1016 /* FIXME: FP */
1017 static pseudo_t linearize_inc_dec(struct entrypoint *ep, struct expression *expr, int postop)
1018 {
1019 struct access_data ad = { NULL, };
1020 pseudo_t old, new, one;
1021 int op = expr->op == SPECIAL_INCREMENT ? OP_ADD : OP_SUB;
1022
1023 if (!linearize_address_gen(ep, expr->unop, &ad))
1024 return VOID;
1025
1026 old = linearize_load_gen(ep, &ad);
1027 one = value_pseudo(expr->op_value);
1028 new = add_binary_op(ep, expr->ctype, op, old, one);
1029 linearize_store_gen(ep, new, &ad);
1030 finish_address_gen(ep, &ad);
1031 return postop ? old : new;
1032 }
1033
1034 static pseudo_t add_uniop(struct entrypoint *ep, struct expression *expr, int op, pseudo_t src)
1035 {
1036 struct instruction *insn = alloc_typed_instruction(op, expr->ctype);
1037 pseudo_t new = alloc_pseudo(insn);
1038
1039 insn->target = new;
1040 use_pseudo(insn, src, &insn->src1);
1041 add_one_insn(ep, insn);
1042 return new;
1043 }
1044
1045 static pseudo_t linearize_slice(struct entrypoint *ep, struct expression *expr)
1046 {
1047 pseudo_t pre = linearize_expression(ep, expr->base);
1048 struct instruction *insn = alloc_typed_instruction(OP_SLICE, expr->ctype);
1049 pseudo_t new = alloc_pseudo(insn);
1050
1051 insn->target = new;
1052 insn->from = expr->r_bitpos;
1053 insn->len = expr->r_nrbits;
1054 use_pseudo(insn, pre, &insn->base);
1055 add_one_insn(ep, insn);
1056 return new;
1057 }
1058
1059 static pseudo_t linearize_regular_preop(struct entrypoint *ep, struct expression *expr)
1060 {
1061 pseudo_t pre = linearize_expression(ep, expr->unop);
1062 switch (expr->op) {
1063 case '+':
1064 return pre;
1065 case '!': {
1066 pseudo_t zero = value_pseudo(0);
1067 return add_binary_op(ep, expr->unop->ctype, OP_SET_EQ, pre, zero);
1068 }
1069 case '~':
1070 return add_uniop(ep, expr, OP_NOT, pre);
1071 case '-':
1072 return add_uniop(ep, expr, OP_NEG, pre);
1073 }
1074 return VOID;
1075 }
1076
1077 static pseudo_t linearize_preop(struct entrypoint *ep, struct expression *expr)
1078 {
1079 /*
1080 * '*' is an lvalue access, and is fundamentally different
1081 * from an arithmetic operation. Maybe it should have an
1082 * expression type of its own..
1083 */
1084 if (expr->op == '*')
1085 return linearize_access(ep, expr);
1086 if (expr->op == SPECIAL_INCREMENT || expr->op == SPECIAL_DECREMENT)
1087 return linearize_inc_dec(ep, expr, 0);
1088 return linearize_regular_preop(ep, expr);
1089 }
1090
1091 static pseudo_t linearize_postop(struct entrypoint *ep, struct expression *expr)
1092 {
1093 return linearize_inc_dec(ep, expr, 1);
1094 }
1095
1096 /*
1097 * Casts to pointers are "less safe" than other casts, since
1098 * they imply type-unsafe accesses. "void *" is a special
1099 * case, since you can't access through it anyway without another
1100 * cast.
1101 */
1102 static struct instruction *alloc_cast_instruction(struct symbol *src, struct symbol *ctype)
1103 {
1104 int opcode = OP_CAST;
1105 struct symbol *base = src;
1106
1107 if (base->ctype.modifiers & MOD_SIGNED)
1108 opcode = OP_SCAST;
1109 if (base->type == SYM_NODE)
1110 base = base->ctype.base_type;
1111 if (base->type == SYM_PTR) {
1112 base = base->ctype.base_type;
1113 if (base != &void_ctype)
1114 opcode = OP_PTRCAST;
1115 }
1116 if (base->ctype.base_type == &fp_type)
1117 opcode = OP_FPCAST;
1118 return alloc_typed_instruction(opcode, ctype);
1119 }
1120
1121 static pseudo_t cast_pseudo(struct entrypoint *ep, pseudo_t src, struct symbol *from, struct symbol *to)
1122 {
1123 pseudo_t result;
1124 struct instruction *insn;
1125
1126 if (src == VOID)
1127 return VOID;
1128 if (!from || !to)
1129 return VOID;
1130 if (from->bit_size < 0 || to->bit_size < 0)
1131 return VOID;
1132 insn = alloc_cast_instruction(from, to);
1133 result = alloc_pseudo(insn);
1134 insn->target = result;
1135 insn->orig_type = from;
1136 use_pseudo(insn, src, &insn->src);
1137 add_one_insn(ep, insn);
1138 return result;
1139 }
1140
1141 static int opcode_sign(int opcode, struct symbol *ctype)
1142 {
1143 if (ctype && (ctype->ctype.modifiers & MOD_SIGNED)) {
1144 switch(opcode) {
1145 case OP_MULU: case OP_DIVU: case OP_MODU: case OP_LSR:
1146 opcode++;
1147 }
1148 }
1149 return opcode;
1150 }
1151
1152 static pseudo_t linearize_assignment(struct entrypoint *ep, struct expression *expr)
1153 {
1154 struct access_data ad = { NULL, };
1155 struct expression *target = expr->left;
1156 struct expression *src = expr->right;
1157 pseudo_t value;
1158
1159 value = linearize_expression(ep, src);
1160 if (!target || !linearize_address_gen(ep, target, &ad))
1161 return value;
1162 if (expr->op != '=') {
1163 pseudo_t oldvalue = linearize_load_gen(ep, &ad);
1164 pseudo_t dst;
1165 static const int op_trans[] = {
1166 [SPECIAL_ADD_ASSIGN - SPECIAL_BASE] = OP_ADD,
1167 [SPECIAL_SUB_ASSIGN - SPECIAL_BASE] = OP_SUB,
1168 [SPECIAL_MUL_ASSIGN - SPECIAL_BASE] = OP_MULU,
1169 [SPECIAL_DIV_ASSIGN - SPECIAL_BASE] = OP_DIVU,
1170 [SPECIAL_MOD_ASSIGN - SPECIAL_BASE] = OP_MODU,
1171 [SPECIAL_SHL_ASSIGN - SPECIAL_BASE] = OP_SHL,
1172 [SPECIAL_SHR_ASSIGN - SPECIAL_BASE] = OP_LSR,
1173 [SPECIAL_AND_ASSIGN - SPECIAL_BASE] = OP_AND,
1174 [SPECIAL_OR_ASSIGN - SPECIAL_BASE] = OP_OR,
1175 [SPECIAL_XOR_ASSIGN - SPECIAL_BASE] = OP_XOR
1176 };
1177 int opcode;
1178
1179 if (!src)
1180 return VOID;
1181
1182 oldvalue = cast_pseudo(ep, oldvalue, src->ctype, expr->ctype);
1183 opcode = opcode_sign(op_trans[expr->op - SPECIAL_BASE], src->ctype);
1184 dst = add_binary_op(ep, src->ctype, opcode, oldvalue, value);
1185 value = cast_pseudo(ep, dst, expr->ctype, src->ctype);
1186 }
1187 value = linearize_store_gen(ep, value, &ad);
1188 finish_address_gen(ep, &ad);
1189 return value;
1190 }
1191
1192 static pseudo_t linearize_call_expression(struct entrypoint *ep, struct expression *expr)
1193 {
1194 struct expression *arg, *fn;
1195 struct instruction *insn = alloc_typed_instruction(OP_CALL, expr->ctype);
1196 pseudo_t retval, call;
1197 struct ctype *ctype = NULL;
1198 struct context *context;
1199
1200 if (!expr->ctype) {
1201 warning(expr->pos, "call with no type!");
1202 return VOID;
1203 }
1204
1205 FOR_EACH_PTR(expr->args, arg) {
1206 pseudo_t new = linearize_expression(ep, arg);
1207 use_pseudo(insn, new, add_pseudo(&insn->arguments, new));
1208 } END_FOR_EACH_PTR(arg);
1209
1210 fn = expr->fn;
1211
1212 if (fn->ctype)
1213 ctype = &fn->ctype->ctype;
1214
1215 if (fn->type == EXPR_PREOP) {
1216 if (fn->unop->type == EXPR_SYMBOL) {
1217 struct symbol *sym = fn->unop->symbol;
1218 if (sym->ctype.base_type->type == SYM_FN)
1219 fn = fn->unop;
1220 }
1221 }
1222 if (fn->type == EXPR_SYMBOL) {
1223 call = symbol_pseudo(ep, fn->symbol);
1224 } else {
1225 call = linearize_expression(ep, fn);
1226 }
1227 use_pseudo(insn, call, &insn->func);
1228 retval = VOID;
1229 if (expr->ctype != &void_ctype)
1230 retval = alloc_pseudo(insn);
1231 insn->target = retval;
1232 add_one_insn(ep, insn);
1233
1234 if (ctype) {
1235 FOR_EACH_PTR(ctype->contexts, context) {
1236 int in = context->in;
1237 int out = context->out;
1238 int check = 0;
1239 int context_diff;
1240 if (in < 0) {
1241 check = 1;
1242 in = 0;
1243 }
1244 if (out < 0) {
1245 check = 0;
1246 out = 0;
1247 }
1248 context_diff = out - in;
1249 if (check || context_diff) {
1250 insn = alloc_instruction(OP_CONTEXT, 0);
1251 insn->increment = context_diff;
1252 insn->check = check;
1253 insn->context_expr = context->context;
1254 add_one_insn(ep, insn);
1255 }
1256 } END_FOR_EACH_PTR(context);
1257 }
1258
1259 return retval;
1260 }
1261
1262 static pseudo_t linearize_binop(struct entrypoint *ep, struct expression *expr)
1263 {
1264 pseudo_t src1, src2, dst;
1265 static const int opcode[] = {
1266 ['+'] = OP_ADD, ['-'] = OP_SUB,
1267 ['*'] = OP_MULU, ['/'] = OP_DIVU,
1268 ['%'] = OP_MODU, ['&'] = OP_AND,
1269 ['|'] = OP_OR, ['^'] = OP_XOR,
1270 [SPECIAL_LEFTSHIFT] = OP_SHL,
1271 [SPECIAL_RIGHTSHIFT] = OP_LSR,
1272 [SPECIAL_LOGICAL_AND] = OP_AND_BOOL,
1273 [SPECIAL_LOGICAL_OR] = OP_OR_BOOL,
1274 };
1275 int op;
1276
1277 src1 = linearize_expression(ep, expr->left);
1278 src2 = linearize_expression(ep, expr->right);
1279 op = opcode_sign(opcode[expr->op], expr->ctype);
1280 dst = add_binary_op(ep, expr->ctype, op, src1, src2);
1281 return dst;
1282 }
1283
1284 static pseudo_t linearize_logical_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false);
1285
1286 pseudo_t linearize_cond_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false);
1287
1288 static pseudo_t linearize_select(struct entrypoint *ep, struct expression *expr)
1289 {
1290 pseudo_t cond, true, false, res;
1291 struct instruction *insn;
1292
1293 true = linearize_expression(ep, expr->cond_true);
1294 false = linearize_expression(ep, expr->cond_false);
1295 cond = linearize_expression(ep, expr->conditional);
1296
1297 insn = alloc_typed_instruction(OP_SEL, expr->ctype);
1298 if (!expr->cond_true)
1299 true = cond;
1300 use_pseudo(insn, cond, &insn->src1);
1301 use_pseudo(insn, true, &insn->src2);
1302 use_pseudo(insn, false, &insn->src3);
1303
1304 res = alloc_pseudo(insn);
1305 insn->target = res;
1306 add_one_insn(ep, insn);
1307 return res;
1308 }
1309
1310 static pseudo_t add_join_conditional(struct entrypoint *ep, struct expression *expr,
1311 pseudo_t phi1, pseudo_t phi2)
1312 {
1313 pseudo_t target;
1314 struct instruction *phi_node;
1315
1316 if (phi1 == VOID)
1317 return phi2;
1318 if (phi2 == VOID)
1319 return phi1;
1320
1321 phi_node = alloc_typed_instruction(OP_PHI, expr->ctype);
1322 use_pseudo(phi_node, phi1, add_pseudo(&phi_node->phi_list, phi1));
1323 use_pseudo(phi_node, phi2, add_pseudo(&phi_node->phi_list, phi2));
1324 phi_node->target = target = alloc_pseudo(phi_node);
1325 add_one_insn(ep, phi_node);
1326 return target;
1327 }
1328
1329 static pseudo_t linearize_short_conditional(struct entrypoint *ep, struct expression *expr,
1330 struct expression *cond,
1331 struct expression *expr_false)
1332 {
1333 pseudo_t src1, src2;
1334 struct basic_block *bb_false;
1335 struct basic_block *merge = alloc_basic_block(ep, expr->pos);
1336 pseudo_t phi1, phi2;
1337 int size = type_size(expr->ctype);
1338
1339 if (!expr_false || !ep->active)
1340 return VOID;
1341
1342 bb_false = alloc_basic_block(ep, expr_false->pos);
1343 src1 = linearize_expression(ep, cond);
1344 phi1 = alloc_phi(ep->active, src1, size);
1345 add_branch(ep, expr, src1, merge, bb_false);
1346
1347 set_activeblock(ep, bb_false);
1348 src2 = linearize_expression(ep, expr_false);
1349 phi2 = alloc_phi(ep->active, src2, size);
1350 set_activeblock(ep, merge);
1351
1352 return add_join_conditional(ep, expr, phi1, phi2);
1353 }
1354
1355 static pseudo_t linearize_conditional(struct entrypoint *ep, struct expression *expr,
1356 struct expression *cond,
1357 struct expression *expr_true,
1358 struct expression *expr_false)
1359 {
1360 pseudo_t src1, src2;
1361 pseudo_t phi1, phi2;
1362 struct basic_block *bb_true, *bb_false, *merge;
1363 int size = type_size(expr->ctype);
1364
1365 if (!cond || !expr_true || !expr_false || !ep->active)
1366 return VOID;
1367 bb_true = alloc_basic_block(ep, expr_true->pos);
1368 bb_false = alloc_basic_block(ep, expr_false->pos);
1369 merge = alloc_basic_block(ep, expr->pos);
1370
1371 linearize_cond_branch(ep, cond, bb_true, bb_false);
1372
1373 set_activeblock(ep, bb_true);
1374 src1 = linearize_expression(ep, expr_true);
1375 phi1 = alloc_phi(ep->active, src1, size);
1376 add_goto(ep, merge);
1377
1378 set_activeblock(ep, bb_false);
1379 src2 = linearize_expression(ep, expr_false);
1380 phi2 = alloc_phi(ep->active, src2, size);
1381 set_activeblock(ep, merge);
1382
1383 return add_join_conditional(ep, expr, phi1, phi2);
1384 }
1385
1386 static pseudo_t linearize_logical(struct entrypoint *ep, struct expression *expr)
1387 {
1388 struct expression *shortcut;
1389
1390 shortcut = alloc_const_expression(expr->pos, expr->op == SPECIAL_LOGICAL_OR);
1391 shortcut->ctype = expr->ctype;
1392 return linearize_conditional(ep, expr, expr->left, shortcut, expr->right);
1393 }
1394
1395 static pseudo_t linearize_compare(struct entrypoint *ep, struct expression *expr)
1396 {
1397 static const int cmpop[] = {
1398 ['>'] = OP_SET_GT, ['<'] = OP_SET_LT,
1399 [SPECIAL_EQUAL] = OP_SET_EQ,
1400 [SPECIAL_NOTEQUAL] = OP_SET_NE,
1401 [SPECIAL_GTE] = OP_SET_GE,
1402 [SPECIAL_LTE] = OP_SET_LE,
1403 [SPECIAL_UNSIGNED_LT] = OP_SET_B,
1404 [SPECIAL_UNSIGNED_GT] = OP_SET_A,
1405 [SPECIAL_UNSIGNED_LTE] = OP_SET_BE,
1406 [SPECIAL_UNSIGNED_GTE] = OP_SET_AE,
1407 };
1408
1409 pseudo_t src1 = linearize_expression(ep, expr->left);
1410 pseudo_t src2 = linearize_expression(ep, expr->right);
1411 pseudo_t dst = add_binary_op(ep, expr->left->ctype, cmpop[expr->op], src1, src2);
1412 return dst;
1413 }
1414
1415
1416 pseudo_t linearize_cond_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false)
1417 {
1418 pseudo_t cond;
1419
1420 if (!expr || !bb_reachable(ep->active))
1421 return VOID;
1422
1423 switch (expr->type) {
1424
1425 case EXPR_STRING:
1426 case EXPR_VALUE:
1427 add_goto(ep, expr->value ? bb_true : bb_false);
1428 return VOID;
1429
1430 case EXPR_FVALUE:
1431 add_goto(ep, expr->fvalue ? bb_true : bb_false);
1432 return VOID;
1433
1434 case EXPR_LOGICAL:
1435 linearize_logical_branch(ep, expr, bb_true, bb_false);
1436 return VOID;
1437
1438 case EXPR_COMPARE:
1439 cond = linearize_compare(ep, expr);
1440 add_branch(ep, expr, cond, bb_true, bb_false);
1441 break;
1442
1443 case EXPR_PREOP:
1444 if (expr->op == '!')
1445 return linearize_cond_branch(ep, expr->unop, bb_false, bb_true);
1446 /* fall through */
1447 default: {
1448 cond = linearize_expression(ep, expr);
1449 add_branch(ep, expr, cond, bb_true, bb_false);
1450
1451 return VOID;
1452 }
1453 }
1454 return VOID;
1455 }
1456
1457
1458
1459 static pseudo_t linearize_logical_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false)
1460 {
1461 struct basic_block *next = alloc_basic_block(ep, expr->pos);
1462
1463 if (expr->op == SPECIAL_LOGICAL_OR)
1464 linearize_cond_branch(ep, expr->left, bb_true, next);
1465 else
1466 linearize_cond_branch(ep, expr->left, next, bb_false);
1467 set_activeblock(ep, next);
1468 linearize_cond_branch(ep, expr->right, bb_true, bb_false);
1469 return VOID;
1470 }
1471
1472 static pseudo_t linearize_cast(struct entrypoint *ep, struct expression *expr)
1473 {
1474 pseudo_t src;
1475 struct expression *orig = expr->cast_expression;
1476
1477 if (!orig)
1478 return VOID;
1479
1480 src = linearize_expression(ep, orig);
1481 return cast_pseudo(ep, src, orig->ctype, expr->ctype);
1482 }
1483
1484 static pseudo_t linearize_position(struct entrypoint *ep, struct expression *pos, struct access_data *ad)
1485 {
1486 struct expression *init_expr = pos->init_expr;
1487
1488 ad->offset = pos->init_offset;
1489 ad->source_type = base_type(init_expr->ctype);
1490 ad->result_type = init_expr->ctype;
1491 return linearize_initializer(ep, init_expr, ad);
1492 }
1493
1494 static pseudo_t linearize_initializer(struct entrypoint *ep, struct expression *initializer, struct access_data *ad)
1495 {
1496 switch (initializer->type) {
1497 case EXPR_INITIALIZER: {
1498 struct expression *expr;
1499 FOR_EACH_PTR(initializer->expr_list, expr) {
1500 linearize_initializer(ep, expr, ad);
1501 } END_FOR_EACH_PTR(expr);
1502 break;
1503 }
1504 case EXPR_POS:
1505 linearize_position(ep, initializer, ad);
1506 break;
1507 default: {
1508 pseudo_t value = linearize_expression(ep, initializer);
1509 ad->source_type = base_type(initializer->ctype);
1510 ad->result_type = initializer->ctype;
1511 linearize_store_gen(ep, value, ad);
1512 return value;
1513 }
1514 }
1515
1516 return VOID;
1517 }
1518
1519 static void linearize_argument(struct entrypoint *ep, struct symbol *arg, int nr)
1520 {
1521 struct access_data ad = { NULL, };
1522
1523 ad.source_type = arg;
1524 ad.result_type = arg;
1525 ad.address = symbol_pseudo(ep, arg);
1526 linearize_store_gen(ep, argument_pseudo(ep, nr), &ad);
1527 finish_address_gen(ep, &ad);
1528 }
1529
1530 pseudo_t linearize_expression(struct entrypoint *ep, struct expression *expr)
1531 {
1532 if (!expr)
1533 return VOID;
1534
1535 current_pos = expr->pos;
1536 switch (expr->type) {
1537 case EXPR_SYMBOL:
1538 linearize_one_symbol(ep, expr->symbol);
1539 return add_symbol_address(ep, expr->symbol);
1540
1541 case EXPR_VALUE:
1542 return value_pseudo(expr->value);
1543
1544 case EXPR_STRING: case EXPR_FVALUE: case EXPR_LABEL:
1545 return add_setval(ep, expr->ctype, expr);
1546
1547 case EXPR_STATEMENT:
1548 return linearize_statement(ep, expr->statement);
1549
1550 case EXPR_CALL:
1551 return linearize_call_expression(ep, expr);
1552
1553 case EXPR_BINOP:
1554 return linearize_binop(ep, expr);
1555
1556 case EXPR_LOGICAL:
1557 return linearize_logical(ep, expr);
1558
1559 case EXPR_COMPARE:
1560 return linearize_compare(ep, expr);
1561
1562 case EXPR_SELECT:
1563 return linearize_select(ep, expr);
1564
1565 case EXPR_CONDITIONAL:
1566 if (!expr->cond_true)
1567 return linearize_short_conditional(ep, expr, expr->conditional, expr->cond_false);
1568
1569 return linearize_conditional(ep, expr, expr->conditional,
1570 expr->cond_true, expr->cond_false);
1571
1572 case EXPR_COMMA:
1573 linearize_expression(ep, expr->left);
1574 return linearize_expression(ep, expr->right);
1575
1576 case EXPR_ASSIGNMENT:
1577 return linearize_assignment(ep, expr);
1578
1579 case EXPR_PREOP:
1580 return linearize_preop(ep, expr);
1581
1582 case EXPR_POSTOP:
1583 return linearize_postop(ep, expr);
1584
1585 case EXPR_CAST:
1586 case EXPR_FORCE_CAST:
1587 case EXPR_IMPLIED_CAST:
1588 return linearize_cast(ep, expr);
1589
1590 case EXPR_SLICE:
1591 return linearize_slice(ep, expr);
1592
1593 case EXPR_INITIALIZER:
1594 case EXPR_POS:
1595 warning(expr->pos, "unexpected initializer expression (%d %d)", expr->type, expr->op);
1596 return VOID;
1597 default:
1598 warning(expr->pos, "unknown expression (%d %d)", expr->type, expr->op);
1599 return VOID;
1600 }
1601 return VOID;
1602 }
1603
1604 static pseudo_t linearize_one_symbol(struct entrypoint *ep, struct symbol *sym)
1605 {
1606 struct access_data ad = { NULL, };
1607 pseudo_t value;
1608
1609 if (!sym || !sym->initializer || sym->initialized)
1610 return VOID;
1611
1612 /* We need to output these puppies some day too.. */
1613 if (sym->ctype.modifiers & (MOD_STATIC | MOD_TOPLEVEL))
1614 return VOID;
1615
1616 sym->initialized = 1;
1617 ad.address = symbol_pseudo(ep, sym);
1618 value = linearize_initializer(ep, sym->initializer, &ad);
1619 finish_address_gen(ep, &ad);
1620 return value;
1621 }
1622
1623 static pseudo_t linearize_compound_statement(struct entrypoint *ep, struct statement *stmt)
1624 {
1625 pseudo_t pseudo;
1626 struct statement *s;
1627 struct symbol *ret = stmt->ret;
1628
1629 pseudo = VOID;
1630 FOR_EACH_PTR(stmt->stmts, s) {
1631 pseudo = linearize_statement(ep, s);
1632 } END_FOR_EACH_PTR(s);
1633
1634 if (ret) {
1635 struct basic_block *bb = add_label(ep, ret);
1636 struct instruction *phi_node = first_instruction(bb->insns);
1637
1638 if (!phi_node)
1639 return pseudo;
1640
1641 if (pseudo_list_size(phi_node->phi_list)==1) {
1642 pseudo = first_pseudo(phi_node->phi_list);
1643 assert(pseudo->type == PSEUDO_PHI);
1644 return pseudo->def->src1;
1645 }
1646 return phi_node->target;
1647 }
1648
1649 return pseudo;
1650 }
1651
1652 static pseudo_t linearize_inlined_call(struct entrypoint *ep, struct statement *stmt)
1653 {
1654 struct instruction *insn = alloc_instruction(OP_INLINED_CALL, 0);
1655 struct statement *args = stmt->args;
1656 struct basic_block *bb;
1657 pseudo_t pseudo;
1658
1659 if (args) {
1660 struct symbol *sym;
1661
1662 concat_symbol_list(args->declaration, &ep->syms);
1663 FOR_EACH_PTR(args->declaration, sym) {
1664 pseudo_t value = linearize_one_symbol(ep, sym);
1665 use_pseudo(insn, value, add_pseudo(&insn->arguments, value));
1666 } END_FOR_EACH_PTR(sym);
1667 }
1668
1669 insn->target = pseudo = linearize_compound_statement(ep, stmt);
1670 use_pseudo(insn, symbol_pseudo(ep, stmt->inline_fn), &insn->func);
1671 bb = ep->active;
1672 if (bb && !bb->insns)
1673 bb->pos = stmt->pos;
1674 add_one_insn(ep, insn);
1675 return pseudo;
1676 }
1677
1678 static pseudo_t linearize_context(struct entrypoint *ep, struct statement *stmt)
1679 {
1680 struct instruction *insn = alloc_instruction(OP_CONTEXT, 0);
1681 struct expression *expr = stmt->expression;
1682 int value = 0;
1683
1684 if (expr->type == EXPR_VALUE)
1685 value = expr->value;
1686
1687 insn->increment = value;
1688 insn->context_expr = stmt->context;
1689 add_one_insn(ep, insn);
1690 return VOID;
1691 }
1692
1693 static pseudo_t linearize_range(struct entrypoint *ep, struct statement *stmt)
1694 {
1695 struct instruction *insn = alloc_instruction(OP_RANGE, 0);
1696
1697 use_pseudo(insn, linearize_expression(ep, stmt->range_expression), &insn->src1);
1698 use_pseudo(insn, linearize_expression(ep, stmt->range_low), &insn->src2);
1699 use_pseudo(insn, linearize_expression(ep, stmt->range_high), &insn->src3);
1700 add_one_insn(ep, insn);
1701 return VOID;
1702 }
1703
1704 ALLOCATOR(asm_rules, "asm rules");
1705 ALLOCATOR(asm_constraint, "asm constraints");
1706
1707 static void add_asm_input(struct entrypoint *ep, struct instruction *insn, struct expression *expr,
1708 const char *constraint, const struct ident *ident)
1709 {
1710 pseudo_t pseudo = linearize_expression(ep, expr);
1711 struct asm_constraint *rule = __alloc_asm_constraint(0);
1712
1713 rule->ident = ident;
1714 rule->constraint = constraint;
1715 use_pseudo(insn, pseudo, &rule->pseudo);
1716 add_ptr_list(&insn->asm_rules->inputs, rule);
1717 }
1718
1719 static void add_asm_output(struct entrypoint *ep, struct instruction *insn, struct expression *expr,
1720 const char *constraint, const struct ident *ident)
1721 {
1722 struct access_data ad = { NULL, };
1723 pseudo_t pseudo = alloc_pseudo(insn);
1724 struct asm_constraint *rule;
1725
1726 if (!expr || !linearize_address_gen(ep, expr, &ad))
1727 return;
1728 linearize_store_gen(ep, pseudo, &ad);
1729 finish_address_gen(ep, &ad);
1730 rule = __alloc_asm_constraint(0);
1731 rule->ident = ident;
1732 rule->constraint = constraint;
1733 use_pseudo(insn, pseudo, &rule->pseudo);
1734 add_ptr_list(&insn->asm_rules->outputs, rule);
1735 }
1736
1737 static pseudo_t linearize_asm_statement(struct entrypoint *ep, struct statement *stmt)
1738 {
1739 int state;
1740 struct expression *expr;
1741 struct instruction *insn;
1742 struct asm_rules *rules;
1743 const char *constraint;
1744 struct ident *ident;
1745
1746 insn = alloc_instruction(OP_ASM, 0);
1747 expr = stmt->asm_string;
1748 if (!expr || expr->type != EXPR_STRING) {
1749 warning(stmt->pos, "expected string in inline asm");
1750 return VOID;
1751 }
1752 insn->string = expr->string->data;
1753
1754 rules = __alloc_asm_rules(0);
1755 insn->asm_rules = rules;
1756
1757 /* Gather the inputs.. */
1758 state = 0;
1759 ident = NULL;
1760 constraint = NULL;
1761 FOR_EACH_PTR(stmt->asm_inputs, expr) {
1762 switch (state) {
1763 case 0: /* Identifier */
1764 state = 1;
1765 ident = (struct ident *)expr;
1766 continue;
1767
1768 case 1: /* Constraint */
1769 state = 2;
1770 constraint = expr ? expr->string->data : "";
1771 continue;
1772
1773 case 2: /* Expression */
1774 state = 0;
1775 add_asm_input(ep, insn, expr, constraint, ident);
1776 }
1777 } END_FOR_EACH_PTR(expr);
1778
1779 add_one_insn(ep, insn);
1780
1781 /* Assign the outputs */
1782 state = 0;
1783 ident = NULL;
1784 constraint = NULL;
1785 FOR_EACH_PTR(stmt->asm_outputs, expr) {
1786 switch (state) {
1787 case 0: /* Identifier */
1788 state = 1;
1789 ident = (struct ident *)expr;
1790 continue;
1791
1792 case 1: /* Constraint */
1793 state = 2;
1794 constraint = expr ? expr->string->data : "";
1795 continue;
1796
1797 case 2:
1798 state = 0;
1799 add_asm_output(ep, insn, expr, constraint, ident);
1800 }
1801 } END_FOR_EACH_PTR(expr);
1802
1803 return VOID;
1804 }
1805
1806 static int multijmp_cmp(const void *_a, const void *_b)
1807 {
1808 const struct multijmp *a = _a;
1809 const struct multijmp *b = _b;
1810
1811 // "default" case?
1812 if (a->begin > a->end) {
1813 if (b->begin > b->end)
1814 return 0;
1815 return 1;
1816 }
1817 if (b->begin > b->end)
1818 return -1;
1819 if (a->begin == b->begin) {
1820 if (a->end == b->end)
1821 return 0;
1822 return (a->end < b->end) ? -1 : 1;
1823 }
1824 return a->begin < b->begin ? -1 : 1;
1825 }
1826
1827 static void sort_switch_cases(struct instruction *insn)
1828 {
1829 sort_list((struct ptr_list **)&insn->multijmp_list, multijmp_cmp);
1830 }
1831
1832 static pseudo_t linearize_declaration(struct entrypoint *ep, struct statement *stmt)
1833 {
1834 struct symbol *sym;
1835
1836 concat_symbol_list(stmt->declaration, &ep->syms);
1837
1838 FOR_EACH_PTR(stmt->declaration, sym) {
1839 linearize_one_symbol(ep, sym);
1840 } END_FOR_EACH_PTR(sym);
1841 return VOID;
1842 }
1843
1844 pseudo_t linearize_statement(struct entrypoint *ep, struct statement *stmt)
1845 {
1846 struct basic_block *bb;
1847
1848 if (!stmt)
1849 return VOID;
1850
1851 bb = ep->active;
1852 if (bb && !bb->insns)
1853 bb->pos = stmt->pos;
1854 current_pos = stmt->pos;
1855
1856 switch (stmt->type) {
1857 case STMT_NONE:
1858 break;
1859
1860 case STMT_DECLARATION:
1861 return linearize_declaration(ep, stmt);
1862
1863 case STMT_CONTEXT:
1864 return linearize_context(ep, stmt);
1865
1866 case STMT_RANGE:
1867 return linearize_range(ep, stmt);
1868
1869 case STMT_EXPRESSION:
1870 return linearize_expression(ep, stmt->expression);
1871
1872 case STMT_ASM:
1873 return linearize_asm_statement(ep, stmt);
1874
1875 case STMT_RETURN: {
1876 struct expression *expr = stmt->expression;
1877 struct basic_block *bb_return = get_bound_block(ep, stmt->ret_target);
1878 struct basic_block *active;
1879 pseudo_t src = linearize_expression(ep, expr);
1880 active = ep->active;
1881 if (active && src != &void_pseudo) {
1882 struct instruction *phi_node = first_instruction(bb_return->insns);
1883 pseudo_t phi;
1884 if (!phi_node) {
1885 phi_node = alloc_typed_instruction(OP_PHI, expr->ctype);
1886 phi_node->target = alloc_pseudo(phi_node);
1887 phi_node->bb = bb_return;
1888 add_instruction(&bb_return->insns, phi_node);
1889 }
1890 phi = alloc_phi(active, src, type_size(expr->ctype));
1891 phi->ident = &return_ident;
1892 use_pseudo(phi_node, phi, add_pseudo(&phi_node->phi_list, phi));
1893 }
1894 add_goto(ep, bb_return);
1895 return VOID;
1896 }
1897
1898 case STMT_CASE: {
1899 add_label(ep, stmt->case_label);
1900 linearize_statement(ep, stmt->case_statement);
1901 break;
1902 }
1903
1904 case STMT_LABEL: {
1905 struct symbol *label = stmt->label_identifier;
1906
1907 if (label->used) {
1908 add_label(ep, label);
1909 linearize_statement(ep, stmt->label_statement);
1910 }
1911 break;
1912 }
1913
1914 case STMT_GOTO: {
1915 struct symbol *sym;
1916 struct expression *expr;
1917 struct instruction *goto_ins;
1918 struct basic_block *active;
1919 pseudo_t pseudo;
1920
1921 active = ep->active;
1922 if (!bb_reachable(active))
1923 break;
1924
1925 if (stmt->goto_label) {
1926 add_goto(ep, get_bound_block(ep, stmt->goto_label));
1927 break;
1928 }
1929
1930 expr = stmt->goto_expression;
1931 if (!expr)
1932 break;
1933
1934 /* This can happen as part of simplification */
1935 if (expr->type == EXPR_LABEL) {
1936 add_goto(ep, get_bound_block(ep, expr->label_symbol));
1937 break;
1938 }
1939
1940 pseudo = linearize_expression(ep, expr);
1941 goto_ins = alloc_instruction(OP_COMPUTEDGOTO, 0);
1942 use_pseudo(goto_ins, pseudo, &goto_ins->target);
1943 add_one_insn(ep, goto_ins);
1944
1945 FOR_EACH_PTR(stmt->target_list, sym) {
1946 struct basic_block *bb_computed = get_bound_block(ep, sym);
1947 struct multijmp *jmp = alloc_multijmp(bb_computed, 1, 0);
1948 add_multijmp(&goto_ins->multijmp_list, jmp);
1949 add_bb(&bb_computed->parents, ep->active);
1950 add_bb(&active->children, bb_computed);
1951 } END_FOR_EACH_PTR(sym);
1952
1953 finish_block(ep);
1954 break;
1955 }
1956
1957 case STMT_COMPOUND:
1958 if (stmt->inline_fn)
1959 return linearize_inlined_call(ep, stmt);
1960 return linearize_compound_statement(ep, stmt);
1961
1962 /*
1963 * This could take 'likely/unlikely' into account, and
1964 * switch the arms around appropriately..
1965 */
1966 case STMT_IF: {
1967 struct basic_block *bb_true, *bb_false, *endif;
1968 struct expression *cond = stmt->if_conditional;
1969
1970 bb_true = alloc_basic_block(ep, stmt->pos);
1971 bb_false = endif = alloc_basic_block(ep, stmt->pos);
1972
1973 linearize_cond_branch(ep, cond, bb_true, bb_false);
1974
1975 set_activeblock(ep, bb_true);
1976 linearize_statement(ep, stmt->if_true);
1977
1978 if (stmt->if_false) {
1979 endif = alloc_basic_block(ep, stmt->pos);
1980 add_goto(ep, endif);
1981 set_activeblock(ep, bb_false);
1982 linearize_statement(ep, stmt->if_false);
1983 }
1984 set_activeblock(ep, endif);
1985 break;
1986 }
1987
1988 case STMT_SWITCH: {
1989 struct symbol *sym;
1990 struct instruction *switch_ins;
1991 struct basic_block *switch_end = alloc_basic_block(ep, stmt->pos);
1992 struct basic_block *active, *default_case;
1993 struct multijmp *jmp;
1994 pseudo_t pseudo;
1995
1996 pseudo = linearize_expression(ep, stmt->switch_expression);
1997
1998 active = ep->active;
1999 if (!bb_reachable(active))
2000 break;
2001
2002 switch_ins = alloc_instruction(OP_SWITCH, 0);
2003 use_pseudo(switch_ins, pseudo, &switch_ins->cond);
2004 add_one_insn(ep, switch_ins);
2005 finish_block(ep);
2006
2007 default_case = NULL;
2008 FOR_EACH_PTR(stmt->switch_case->symbol_list, sym) {
2009 struct statement *case_stmt = sym->stmt;
2010 struct basic_block *bb_case = get_bound_block(ep, sym);
2011
2012 if (!case_stmt->case_expression) {
2013 default_case = bb_case;
2014 continue;
2015 } else {
2016 int begin, end;
2017
2018 begin = end = case_stmt->case_expression->value;
2019 if (case_stmt->case_to)
2020 end = case_stmt->case_to->value;
2021 if (begin > end)
2022 jmp = alloc_multijmp(bb_case, end, begin);
2023 else
2024 jmp = alloc_multijmp(bb_case, begin, end);
2025
2026 }
2027 add_multijmp(&switch_ins->multijmp_list, jmp);
2028 add_bb(&bb_case->parents, active);
2029 add_bb(&active->children, bb_case);
2030 } END_FOR_EACH_PTR(sym);
2031
2032 bind_label(stmt->switch_break, switch_end, stmt->pos);
2033
2034 /* And linearize the actual statement */
2035 linearize_statement(ep, stmt->switch_statement);
2036 set_activeblock(ep, switch_end);
2037
2038 if (!default_case)
2039 default_case = switch_end;
2040
2041 jmp = alloc_multijmp(default_case, 1, 0);
2042 add_multijmp(&switch_ins->multijmp_list, jmp);
2043 add_bb(&default_case->parents, active);
2044 add_bb(&active->children, default_case);
2045 sort_switch_cases(switch_ins);
2046
2047 break;
2048 }
2049
2050 case STMT_ITERATOR: {
2051 struct statement *pre_statement = stmt->iterator_pre_statement;
2052 struct expression *pre_condition = stmt->iterator_pre_condition;
2053 struct statement *statement = stmt->iterator_statement;
2054 struct statement *post_statement = stmt->iterator_post_statement;
2055 struct expression *post_condition = stmt->iterator_post_condition;
2056 struct basic_block *loop_top, *loop_body, *loop_continue, *loop_end;
2057
2058 concat_symbol_list(stmt->iterator_syms, &ep->syms);
2059 linearize_statement(ep, pre_statement);
2060
2061 loop_body = loop_top = alloc_basic_block(ep, stmt->pos);
2062 loop_continue = alloc_basic_block(ep, stmt->pos);
2063 loop_end = alloc_basic_block(ep, stmt->pos);
2064
2065 /* An empty post-condition means that it's the same as the pre-condition */
2066 if (!post_condition) {
2067 loop_top = alloc_basic_block(ep, stmt->pos);
2068 set_activeblock(ep, loop_top);
2069 }
2070
2071 if (pre_condition)
2072 linearize_cond_branch(ep, pre_condition, loop_body, loop_end);
2073
2074 bind_label(stmt->iterator_continue, loop_continue, stmt->pos);
2075 bind_label(stmt->iterator_break, loop_end, stmt->pos);
2076
2077 set_activeblock(ep, loop_body);
2078 linearize_statement(ep, statement);
2079 add_goto(ep, loop_continue);
2080
2081 set_activeblock(ep, loop_continue);
2082 linearize_statement(ep, post_statement);
2083 if (!post_condition)
2084 add_goto(ep, loop_top);
2085 else
2086 linearize_cond_branch(ep, post_condition, loop_top, loop_end);
2087 set_activeblock(ep, loop_end);
2088 break;
2089 }
2090
2091 default:
2092 break;
2093 }
2094 return VOID;
2095 }
2096
2097 static struct entrypoint *linearize_fn(struct symbol *sym, struct symbol *base_type)
2098 {
2099 struct entrypoint *ep;
2100 struct basic_block *bb;
2101 struct symbol *arg;
2102 struct instruction *entry;
2103 pseudo_t result;
2104 int i;
2105
2106 if (!base_type->stmt)
2107 return NULL;
2108
2109 ep = alloc_entrypoint();
2110 bb = alloc_basic_block(ep, sym->pos);
2111
2112 ep->name = sym;
2113 sym->ep = ep;
2114 set_activeblock(ep, bb);
2115
2116 entry = alloc_instruction(OP_ENTRY, 0);
2117 add_one_insn(ep, entry);
2118 ep->entry = entry;
2119
2120 concat_symbol_list(base_type->arguments, &ep->syms);
2121
2122 /* FIXME!! We should do something else about varargs.. */
2123 i = 0;
2124 FOR_EACH_PTR(base_type->arguments, arg) {
2125 linearize_argument(ep, arg, ++i);
2126 } END_FOR_EACH_PTR(arg);
2127
2128 result = linearize_statement(ep, base_type->stmt);
2129 if (bb_reachable(ep->active) && !bb_terminated(ep->active)) {
2130 struct symbol *ret_type = base_type->ctype.base_type;
2131 struct instruction *insn = alloc_typed_instruction(OP_RET, ret_type);
2132
2133 if (type_size(ret_type) > 0)
2134 use_pseudo(insn, result, &insn->src);
2135 add_one_insn(ep, insn);
2136 }
2137
2138 /*
2139 * Do trivial flow simplification - branches to
2140 * branches, kill dead basicblocks etc
2141 */
2142 kill_unreachable_bbs(ep);
2143
2144 /*
2145 * Turn symbols into pseudos
2146 */
2147 simplify_symbol_usage(ep);
2148
2149 repeat:
2150 /*
2151 * Remove trivial instructions, and try to CSE
2152 * the rest.
2153 */
2154 do {
2155 cleanup_and_cse(ep);
2156 pack_basic_blocks(ep);
2157 } while (repeat_phase & REPEAT_CSE);
2158
2159 kill_unreachable_bbs(ep);
2160 vrfy_flow(ep);
2161
2162 /* Cleanup */
2163 clear_symbol_pseudos(ep);
2164
2165 /* And track pseudo register usage */
2166 track_pseudo_liveness(ep);
2167
2168 /*
2169 * Some flow optimizations can only effectively
2170 * be done when we've done liveness analysis. But
2171 * if they trigger, we need to start all over
2172 * again
2173 */
2174 if (simplify_flow(ep)) {
2175 clear_liveness(ep);
2176 goto repeat;
2177 }
2178
2179 /* Finally, add deathnotes to pseudos now that we have them */
2180 if (dbg_dead)
2181 track_pseudo_death(ep);
2182
2183 return ep;
2184 }
2185
2186 struct entrypoint *linearize_symbol(struct symbol *sym)
2187 {
2188 struct symbol *base_type;
2189
2190 if (!sym)
2191 return NULL;
2192 current_pos = sym->pos;
2193 base_type = sym->ctype.base_type;
2194 if (!base_type)
2195 return NULL;
2196 if (base_type->type == SYM_FN)
2197 return linearize_fn(sym, base_type);
2198 return NULL;
2199 }
Static analysis for C