[PATCH] casts are not lvalues
[smatch.git] / linearize.c
blob22e3fbe7c033d9efb5841db1c9d4a0aa32f58d4e
1 /*
2 * Linearize - walk the statement tree (but _not_ the expressions)
3 * to generate a linear version of it and the basic blocks.
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.
9 * Copyright (C) 2004 Linus Torvalds
10 * Copyright (C) 2004 Christopher Li
13 #include <string.h>
14 #include <stdarg.h>
15 #include <stdlib.h>
16 #include <stdio.h>
18 #include "parse.h"
19 #include "expression.h"
20 #include "linearize.h"
22 pseudo_t linearize_statement(struct entrypoint *ep, struct statement *stmt);
23 pseudo_t linearize_expression(struct entrypoint *ep, struct expression *expr);
25 static void add_setcc(struct entrypoint *ep, struct expression *expr, pseudo_t val);
26 static pseudo_t add_binary_op(struct entrypoint *ep, struct expression *expr, int op, pseudo_t left, pseudo_t right);
27 static pseudo_t add_setval(struct entrypoint *ep, struct symbol *ctype, struct expression *val);
28 static pseudo_t add_const_value(struct entrypoint *ep, struct position pos, struct symbol *ctype, int val);
29 static pseudo_t add_load(struct entrypoint *ep, struct expression *expr, pseudo_t addr);
32 struct pseudo void_pseudo = {};
34 static struct instruction *alloc_instruction(int opcode, struct symbol *type)
36 struct instruction * insn = __alloc_instruction(0);
37 insn->type = type;
38 insn->opcode = opcode;
39 return insn;
42 static struct entrypoint *alloc_entrypoint(void)
44 return __alloc_entrypoint(0);
47 static struct basic_block *alloc_basic_block(void)
49 return __alloc_basic_block(0);
52 static struct multijmp* alloc_multijmp(struct basic_block *target, int begin, int end)
54 struct multijmp *multijmp = __alloc_multijmp(0);
55 multijmp->target = target;
56 multijmp->begin = begin;
57 multijmp->end = end;
58 return multijmp;
61 static struct phi* alloc_phi(struct basic_block *source, pseudo_t pseudo)
63 struct phi *phi = __alloc_phi(0);
64 phi->source = source;
65 phi->pseudo = pseudo;
66 return phi;
69 static void show_instruction(struct instruction *insn)
71 int op = insn->opcode;
73 switch (op) {
74 case OP_BADOP:
75 printf("\tAIEEE! (%d %d)\n", insn->target->nr, insn->src->nr);
76 break;
77 case OP_RET:
78 if (insn->type && insn->type != &void_ctype)
79 printf("\tret %%r%d\n", insn->src->nr);
80 else
81 printf("\tret\n");
82 break;
83 case OP_BR:
84 if (insn->bb_true && insn->bb_false) {
85 printf("\tbr\t%%r%d, .L%p, .L%p\n", insn->cond->nr, insn->bb_true, insn->bb_false);
86 break;
88 printf("\tbr\t.L%p\n", insn->bb_true ? insn->bb_true : insn->bb_false);
89 break;
91 case OP_SETVAL: {
92 struct expression *expr = insn->val;
93 switch (expr->type) {
94 case EXPR_VALUE:
95 printf("\t%%r%d <- %lld\n",
96 insn->target->nr, expr->value);
97 break;
98 case EXPR_FVALUE:
99 printf("\t%%r%d <- %Lf\n",
100 insn->target->nr, expr->fvalue);
101 break;
102 case EXPR_STRING:
103 printf("\t%%r%d <- %s\n",
104 insn->target->nr, show_string(expr->string));
105 break;
106 case EXPR_SYMBOL:
107 printf("\t%%r%d <- %s\n",
108 insn->target->nr, show_ident(expr->symbol->ident));
109 break;
110 case EXPR_LABEL:
111 printf("\t%%r%d <- .L%p\n",
112 insn->target->nr, expr->symbol->bb_target);
113 break;
114 default:
115 printf("\t%%r%d <- SETVAL EXPR TYPE %d\n",
116 insn->target->nr, expr->type);
118 break;
120 case OP_SWITCH: {
121 struct multijmp *jmp;
122 printf("\tswitch %%r%d", insn->cond->nr);
123 FOR_EACH_PTR(insn->multijmp_list, jmp) {
124 if (jmp->begin == jmp->end)
125 printf(", %d -> .L%p", jmp->begin, jmp->target);
126 else if (jmp->begin < jmp->end)
127 printf(", %d ... %d -> .L%p", jmp->begin, jmp->end, jmp->target);
128 else
129 printf(", default -> .L%p\n", jmp->target);
130 } END_FOR_EACH_PTR;
131 printf("\n");
132 break;
134 case OP_COMPUTEDGOTO: {
135 struct multijmp *jmp;
136 printf("\tjmp *%%r%d", insn->target->nr);
137 FOR_EACH_PTR(insn->multijmp_list, jmp) {
138 printf(", .L%p", jmp->target);
139 } END_FOR_EACH_PTR;
140 printf("\n");
141 break;
144 case OP_PHI: {
145 struct phi *phi;
146 char *s = " ";
147 printf("\t%%r%d <- phi", insn->target->nr);
148 FOR_EACH_PTR(insn->phi_list, phi) {
149 printf("%s(%%r%d, .L%p)", s, phi->pseudo->nr, phi->source);
150 s = ", ";
151 } END_FOR_EACH_PTR;
152 printf("\n");
153 break;
155 case OP_LOAD:
156 printf("\tload %%r%d <- [%%r%d]\n", insn->target->nr, insn->src->nr);
157 break;
158 case OP_STORE:
159 printf("\tstore %%r%d -> [%%r%d]\n", insn->target->nr, insn->src->nr);
160 break;
161 case OP_CALL: {
162 struct pseudo *arg;
163 printf("\t%%r%d <- CALL %%r%d", insn->target->nr, insn->func->nr);
164 FOR_EACH_PTR(insn->arguments, arg) {
165 printf(", %%r%d", arg->nr);
166 } END_FOR_EACH_PTR;
167 printf("\n");
168 break;
170 case OP_CAST:
171 printf("\t%%r%d <- CAST(%d->%d) %%r%d\n",
172 insn->target->nr,
173 insn->orig_type->bit_size, insn->type->bit_size,
174 insn->src->nr);
175 break;
176 case OP_BINARY ... OP_BINARY_END: {
177 static const char *opname[] = {
178 [OP_ADD - OP_BINARY] = "add", [OP_SUB - OP_BINARY] = "sub",
179 [OP_MUL - OP_BINARY] = "mul", [OP_DIV - OP_BINARY] = "div",
180 [OP_MOD - OP_BINARY] = "mod", [OP_AND - OP_BINARY] = "and",
181 [OP_OR - OP_BINARY] = "or", [OP_XOR - OP_BINARY] = "xor",
182 [OP_SHL - OP_BINARY] = "shl", [OP_SHR - OP_BINARY] = "shr",
183 [OP_AND_BOOL - OP_BINARY] = "and-bool",
184 [OP_OR_BOOL - OP_BINARY] = "or-bool",
185 [OP_SEL - OP_BINARY] = "select",
187 printf("\t%%r%d <- %s %%r%d, %%r%d\n",
188 insn->target->nr,
189 opname[op - OP_BINARY], insn->src1->nr, insn->src2->nr);
190 break;
193 case OP_SLICE:
194 printf("\t%%r%d <- slice %%r%d, %d, %d\n",
195 insn->target->nr,
196 insn->base->nr, insn->from, insn->len);
197 break;
199 case OP_BINCMP ... OP_BINCMP_END: {
200 static const char *opname[] = {
201 [OP_SET_EQ - OP_BINCMP] = "seteq",
202 [OP_SET_NE - OP_BINCMP] = "setne",
203 [OP_SET_LE - OP_BINCMP] = "setle",
204 [OP_SET_GE - OP_BINCMP] = "setge",
205 [OP_SET_LT - OP_BINCMP] = "setlt",
206 [OP_SET_GT - OP_BINCMP] = "setgt",
207 [OP_SET_BE - OP_BINCMP] = "setbe",
208 [OP_SET_AE - OP_BINCMP] = "setae",
209 [OP_SET_A - OP_BINCMP] = "seta",
210 [OP_SET_B - OP_BINCMP] = "setb",
212 printf("\t%%r%d <- %s %%r%d, %%r%d\n",
213 insn->target->nr,
214 opname[op - OP_BINCMP], insn->src1->nr, insn->src2->nr);
215 break;
218 case OP_NOT: case OP_NEG:
219 printf("\t%%r%d <- %s %%r%d\n",
220 insn->target->nr,
221 op == OP_NOT ? "not" : "neg", insn->src1->nr);
222 break;
223 case OP_SETCC:
224 printf("\tsetcc %%r%d\n", insn->src->nr);
225 break;
226 default:
227 printf("\top %d ???\n", op);
231 static void show_bb(struct basic_block *bb)
233 struct instruction *insn;
235 printf("bb: %p\n", bb);
236 if (bb->parents) {
237 struct basic_block *from;
238 FOR_EACH_PTR(bb->parents, from) {
239 printf(" **from %p**\n", from);
240 } END_FOR_EACH_PTR;
242 FOR_EACH_PTR(bb->insns, insn) {
243 show_instruction(insn);
244 } END_FOR_EACH_PTR;
245 if (!bb_terminated(bb))
246 printf("\tEND\n");
247 printf("\n");
250 void show_entry(struct entrypoint *ep)
252 struct symbol *sym;
253 struct basic_block *bb;
255 printf("ep %p: %s\n", ep, show_ident(ep->name->ident));
257 FOR_EACH_PTR(ep->syms, sym) {
258 printf(" sym: %p %s\n", sym, show_ident(sym->ident));
259 } END_FOR_EACH_PTR;
261 printf("\n");
263 FOR_EACH_PTR(ep->bbs, bb) {
264 show_bb(bb);
265 } END_FOR_EACH_PTR;
267 printf("\n");
270 static void bind_label(struct symbol *label, struct basic_block *bb, struct position pos)
272 if (label->bb_target)
273 warn(pos, "label '%s' already bound", show_ident(label->ident));
274 label->bb_target = bb;
277 static struct basic_block * get_bound_block(struct entrypoint *ep, struct symbol *label)
279 struct basic_block *bb = label->bb_target;
281 if (!bb) {
282 label->bb_target = bb = alloc_basic_block();
283 bb->flags |= BB_REACHABLE;
285 return bb;
288 static void finish_block(struct entrypoint *ep)
290 struct basic_block *src = ep->active;
291 if (bb_reachable(src))
292 ep->active = NULL;
295 static void add_goto(struct entrypoint *ep, struct basic_block *dst)
297 struct basic_block *src = ep->active;
298 if (bb_reachable(src)) {
299 struct instruction *br = alloc_instruction(OP_BR, NULL);
300 br->bb_true = dst;
301 add_bb(&dst->parents, src);
302 add_instruction(&src->insns, br);
303 ep->active = NULL;
307 static void add_one_insn(struct entrypoint *ep, struct position pos, struct instruction *insn)
309 struct basic_block *bb = ep->active;
311 if (bb_reachable(bb))
312 add_instruction(&bb->insns, insn);
315 static void set_activeblock(struct entrypoint *ep, struct basic_block *bb)
317 if (!bb_terminated(ep->active))
318 add_goto(ep, bb);
320 ep->active = bb;
321 if (bb_reachable(bb))
322 add_bb(&ep->bbs, bb);
325 static void add_setcc(struct entrypoint *ep, struct expression *expr, pseudo_t val)
327 struct basic_block *bb = ep->active;
329 if (bb_reachable(bb)) {
330 struct instruction *cc = alloc_instruction(OP_SETCC, &bool_ctype);
331 cc->src = val;
332 add_one_insn(ep, expr->pos, cc);
336 static void add_branch(struct entrypoint *ep, struct expression *expr, pseudo_t cond, struct basic_block *bb_true, struct basic_block *bb_false)
338 struct basic_block *bb = ep->active;
339 struct instruction *br;
341 if (bb_reachable(bb)) {
342 br = alloc_instruction(OP_BR, expr->ctype);
343 br->cond = cond;
344 br->bb_true = bb_true;
345 br->bb_false = bb_false;
346 add_bb(&bb_true->parents, bb);
347 add_bb(&bb_false->parents, bb);
348 add_one_insn(ep, expr->pos, br);
352 /* Dummy pseudo allocator */
353 static pseudo_t alloc_pseudo(void)
355 static int nr = 0;
356 struct pseudo * pseudo = __alloc_pseudo(0);
357 pseudo->nr = ++nr;
358 return pseudo;
362 * FIXME! Not all accesses are memory loads. We should
363 * check what kind of symbol is behind the dereference.
365 static pseudo_t linearize_address_gen(struct entrypoint *ep, struct expression *expr)
367 if (expr->type == EXPR_PREOP)
368 return linearize_expression(ep, expr->unop);
369 if (expr->type == EXPR_BITFIELD)
370 return linearize_expression(ep, expr->address);
371 warn(expr->pos, "generating address of non-lvalue");
372 return VOID;
375 static void linearize_store_gen(struct entrypoint *ep, pseudo_t value, struct expression *expr, pseudo_t addr)
377 struct instruction *store = alloc_instruction(OP_STORE, expr->ctype);
379 if (expr->type == EXPR_BITFIELD) {
380 unsigned long mask = ((1<<expr->nrbits)-1) << expr->bitpos;
381 pseudo_t andmask, ormask, shift, orig;
382 if (expr->bitpos) {
383 shift = add_const_value(ep, expr->pos, &uint_ctype, expr->bitpos);
384 value = add_binary_op(ep, expr, OP_SHL, value, shift);
386 orig = add_load(ep, expr, addr);
387 andmask = add_const_value(ep, expr->pos, &uint_ctype, ~mask);
388 value = add_binary_op(ep, expr, OP_AND, orig, andmask);
389 ormask = add_const_value(ep, expr->pos, &uint_ctype, mask);
390 value = add_binary_op(ep, expr, OP_OR, orig, ormask);
393 store->target = value;
394 store->src = addr;
395 add_one_insn(ep, expr->pos, store);
398 static pseudo_t add_binary_op(struct entrypoint *ep, struct expression *expr, int op, pseudo_t left, pseudo_t right)
400 struct instruction *insn = alloc_instruction(op, expr->ctype);
401 pseudo_t target = alloc_pseudo();
402 insn->target = target;
403 insn->src1 = left;
404 insn->src2 = right;
405 add_one_insn(ep, expr->pos, insn);
406 return target;
409 static pseudo_t add_setval(struct entrypoint *ep, struct symbol *ctype, struct expression *val)
411 struct instruction *insn = alloc_instruction(OP_SETVAL, ctype);
412 pseudo_t target = alloc_pseudo();
413 insn->target = target;
414 insn->val = val;
415 add_one_insn(ep, val->pos, insn);
416 return target;
419 static pseudo_t add_const_value(struct entrypoint *ep, struct position pos, struct symbol *ctype, int val)
421 struct expression *expr = alloc_const_expression(pos, val);
422 return add_setval(ep, ctype, expr);
425 static pseudo_t add_load(struct entrypoint *ep, struct expression *expr, pseudo_t addr)
427 pseudo_t new = alloc_pseudo();
428 struct instruction *insn = alloc_instruction(OP_LOAD, expr->ctype);
430 insn->target = new;
431 insn->src = addr;
432 add_one_insn(ep, expr->pos, insn);
433 return new;
436 static pseudo_t linearize_load_gen(struct entrypoint *ep, struct expression *expr, pseudo_t addr)
438 pseudo_t new = add_load(ep, expr, addr);
439 if (expr->type == EXPR_PREOP)
440 return new;
442 if (expr->type == EXPR_BITFIELD) {
443 pseudo_t mask;
444 if (expr->bitpos) {
445 pseudo_t shift = add_const_value(ep, expr->pos, &uint_ctype, expr->bitpos);
446 new = add_binary_op(ep, expr, OP_SHR, new, shift);
448 mask = add_const_value(ep, expr->pos, &uint_ctype, (1<<expr->nrbits)-1);
449 return add_binary_op(ep, expr, OP_AND, new, mask);
452 warn(expr->pos, "loading unknown expression");
453 return new;
456 static pseudo_t linearize_access(struct entrypoint *ep, struct expression *expr)
458 pseudo_t addr = linearize_address_gen(ep, expr);
459 return linearize_load_gen(ep, expr, addr);
462 /* FIXME: FP */
463 static pseudo_t linearize_inc_dec(struct entrypoint *ep, struct expression *expr, int postop)
465 pseudo_t addr = linearize_address_gen(ep, expr->unop);
466 pseudo_t old, new, one;
467 int op = expr->op == SPECIAL_INCREMENT ? OP_ADD : OP_SUB;
469 old = linearize_load_gen(ep, expr->unop, addr);
470 one = add_const_value(ep, expr->pos, expr->ctype, 1);
471 new = add_binary_op(ep, expr, op, old, one);
472 linearize_store_gen(ep, new, expr->unop, addr);
473 return postop ? old : new;
476 static pseudo_t add_uniop(struct entrypoint *ep, struct expression *expr, int op, pseudo_t src)
478 pseudo_t new = alloc_pseudo();
479 struct instruction *insn = alloc_instruction(op, expr->ctype);
480 insn->target = new;
481 insn->src1 = src;
482 add_one_insn(ep, expr->pos, insn);
483 return new;
486 static pseudo_t linearize_slice(struct entrypoint *ep, struct expression *expr)
488 pseudo_t pre = linearize_expression(ep, expr->base);
489 pseudo_t new = alloc_pseudo();
490 struct instruction *insn = alloc_instruction(OP_SLICE, expr->ctype);
491 insn->target = new;
492 insn->base = pre;
493 insn->from = expr->r_bitpos;
494 insn->len = expr->r_nrbits;
495 add_one_insn(ep, expr->pos, insn);
496 return new;
499 static pseudo_t linearize_regular_preop(struct entrypoint *ep, struct expression *expr)
501 pseudo_t pre = linearize_expression(ep, expr->unop);
502 switch (expr->op) {
503 case '+':
504 return pre;
505 case '!': {
506 pseudo_t zero = add_const_value(ep, expr->pos, expr->ctype, 0);
507 return add_binary_op(ep, expr, OP_SET_EQ, pre, zero);
509 case '~':
510 return add_uniop(ep, expr, OP_NOT, pre);
511 case '-':
512 return add_uniop(ep, expr, OP_NEG, pre);
514 return VOID;
517 static pseudo_t linearize_preop(struct entrypoint *ep, struct expression *expr)
520 * '*' is an lvalue access, and is fundamentally different
521 * from an arithmetic operation. Maybe it should have an
522 * expression type of its own..
524 if (expr->op == '*')
525 return linearize_access(ep, expr);
526 if (expr->op == SPECIAL_INCREMENT || expr->op == SPECIAL_DECREMENT)
527 return linearize_inc_dec(ep, expr, 0);
528 return linearize_regular_preop(ep, expr);
531 static pseudo_t linearize_postop(struct entrypoint *ep, struct expression *expr)
533 return linearize_inc_dec(ep, expr, 1);
536 static pseudo_t linearize_assignment(struct entrypoint *ep, struct expression *expr)
538 struct expression *target = expr->left;
539 pseudo_t value, address;
541 value = linearize_expression(ep, expr->right);
542 address = linearize_address_gen(ep, target);
543 if (expr->op != '=') {
544 static const int opcode[] = {
545 [SPECIAL_ADD_ASSIGN - SPECIAL_BASE] = OP_ADD,
546 [SPECIAL_SUB_ASSIGN - SPECIAL_BASE] = OP_SUB,
547 [SPECIAL_MUL_ASSIGN - SPECIAL_BASE] = OP_MUL,
548 [SPECIAL_DIV_ASSIGN - SPECIAL_BASE] = OP_DIV,
549 [SPECIAL_MOD_ASSIGN - SPECIAL_BASE] = OP_MOD,
550 [SPECIAL_SHL_ASSIGN - SPECIAL_BASE] = OP_SHL,
551 [SPECIAL_SHR_ASSIGN - SPECIAL_BASE] = OP_SHR,
552 [SPECIAL_AND_ASSIGN - SPECIAL_BASE] = OP_AND,
553 [SPECIAL_OR_ASSIGN - SPECIAL_BASE] = OP_OR,
554 [SPECIAL_XOR_ASSIGN - SPECIAL_BASE] = OP_XOR
556 pseudo_t left = linearize_load_gen(ep, target, address);
557 value = add_binary_op(ep, expr, opcode[expr->op - SPECIAL_BASE], left, value);
559 linearize_store_gen(ep, value, target, address);
560 return value;
563 static pseudo_t linearize_call_expression(struct entrypoint *ep, struct expression *expr)
565 struct expression *arg, *fn;
566 struct instruction *insn = alloc_instruction(OP_CALL, expr->ctype);
567 pseudo_t retval;
569 if (!expr->ctype) {
570 warn(expr->pos, "call with no type!");
571 return VOID;
574 FOR_EACH_PTR(expr->args, arg) {
575 pseudo_t new = linearize_expression(ep, arg);
576 add_pseudo(&insn->arguments, new);
577 } END_FOR_EACH_PTR;
579 fn = expr->fn;
580 if (fn->type == EXPR_PREOP) {
581 if (fn->unop->type == EXPR_SYMBOL) {
582 struct symbol *sym = fn->unop->symbol;
583 if (sym->ctype.base_type->type == SYM_FN)
584 fn = fn->unop;
587 insn->func = linearize_expression(ep, fn);
588 insn->target = retval = alloc_pseudo();
589 add_one_insn(ep, expr->pos, insn);
591 return retval;
594 static pseudo_t linearize_binop(struct entrypoint *ep, struct expression *expr)
596 pseudo_t src1, src2;
597 static const int opcode[] = {
598 ['+'] = OP_ADD, ['-'] = OP_SUB,
599 ['*'] = OP_MUL, ['/'] = OP_DIV,
600 ['%'] = OP_MOD, ['&'] = OP_AND,
601 ['|'] = OP_OR, ['^'] = OP_XOR,
602 [SPECIAL_LEFTSHIFT] = OP_SHL,
603 [SPECIAL_RIGHTSHIFT] = OP_SHR,
604 [SPECIAL_LOGICAL_AND] = OP_AND_BOOL,
605 [SPECIAL_LOGICAL_OR] = OP_OR_BOOL,
608 src1 = linearize_expression(ep, expr->left);
609 src2 = linearize_expression(ep, expr->right);
610 return add_binary_op(ep, expr, opcode[expr->op], src1, src2);
613 static pseudo_t linearize_logical_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false);
615 pseudo_t linearize_cond_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false);
617 static pseudo_t linearize_select(struct entrypoint *ep, struct expression *expr)
619 pseudo_t cond, true, false;
621 true = NULL;
622 if (expr->cond_true)
623 true = linearize_expression(ep, expr->cond_true);
624 false = linearize_expression(ep, expr->cond_false);
625 cond = linearize_expression(ep, expr->conditional);
626 if (!true)
627 true = cond;
629 add_setcc(ep, expr, cond);
630 return add_binary_op(ep, expr, OP_SEL, true, false);
633 static pseudo_t linearize_conditional(struct entrypoint *ep, struct expression *expr,
634 struct expression *cond, struct expression *expr_true,
635 struct expression *expr_false)
637 pseudo_t src1, src2, target;
638 struct basic_block *bb_true = alloc_basic_block();
639 struct basic_block *bb_false = alloc_basic_block();
640 struct basic_block *merge = alloc_basic_block();
642 if (expr_true) {
643 linearize_cond_branch(ep, cond, bb_true, bb_false);
645 set_activeblock(ep, bb_true);
646 src1 = linearize_expression(ep, expr_true);
647 bb_true = ep->active;
648 add_goto(ep, merge);
649 } else {
650 src1 = linearize_expression(ep, cond);
651 add_branch(ep, expr, src1, merge, bb_false);
654 set_activeblock(ep, bb_false);
655 src2 = linearize_expression(ep, expr_false);
656 bb_false = ep->active;
657 set_activeblock(ep, merge);
659 if (src1 != VOID && src2 != VOID) {
660 struct instruction *phi_node = alloc_instruction(OP_PHI, expr->ctype);
661 add_phi(&phi_node->phi_list, alloc_phi(bb_true, src1));
662 add_phi(&phi_node->phi_list, alloc_phi(bb_false, src2));
663 phi_node->target = target = alloc_pseudo();
664 add_one_insn(ep, expr->pos, phi_node);
665 set_activeblock(ep, alloc_basic_block());
666 return target;
669 return src1 != VOID ? src1 : src2;
672 static pseudo_t linearize_logical(struct entrypoint *ep, struct expression *expr)
674 struct expression *shortcut;
676 shortcut = alloc_const_expression(expr->pos, expr->op == SPECIAL_LOGICAL_OR);
677 shortcut->ctype = expr->ctype;
678 return linearize_conditional(ep, expr, expr->left, shortcut, expr->right);
681 static pseudo_t linearize_compare(struct entrypoint *ep, struct expression *expr)
683 static const int cmpop[] = {
684 ['>'] = OP_SET_GT, ['<'] = OP_SET_LT,
685 [SPECIAL_EQUAL] = OP_SET_EQ,
686 [SPECIAL_NOTEQUAL] = OP_SET_NE,
687 [SPECIAL_GTE] = OP_SET_GE,
688 [SPECIAL_LTE] = OP_SET_LE,
689 [SPECIAL_UNSIGNED_LT] = OP_SET_B,
690 [SPECIAL_UNSIGNED_GT] = OP_SET_A,
691 [SPECIAL_UNSIGNED_LTE] = OP_SET_BE,
692 [SPECIAL_UNSIGNED_GTE] = OP_SET_AE,
695 pseudo_t src1 = linearize_expression(ep, expr->left);
696 pseudo_t src2 = linearize_expression(ep, expr->right);
697 return add_binary_op(ep, expr, cmpop[expr->op], src1, src2);
701 pseudo_t linearize_cond_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false)
703 pseudo_t cond;
705 if (!expr || !bb_reachable(ep->active))
706 return VOID;
708 switch (expr->type) {
710 case EXPR_STRING:
711 case EXPR_VALUE:
712 add_goto(ep, expr->value ? bb_true : bb_false);
713 return VOID;
715 case EXPR_FVALUE:
716 add_goto(ep, expr->fvalue ? bb_true : bb_false);
717 return VOID;
719 case EXPR_LOGICAL:
720 linearize_logical_branch(ep, expr, bb_true, bb_false);
721 return VOID;
723 case EXPR_COMPARE:
724 cond = linearize_compare(ep, expr);
725 add_branch(ep, expr, cond, bb_true, bb_false);
726 break;
728 case EXPR_PREOP:
729 if (expr->op == '!')
730 return linearize_cond_branch(ep, expr->unop, bb_false, bb_true);
731 /* fall through */
732 default: {
733 cond = linearize_expression(ep, expr);
734 add_branch(ep, expr, cond, bb_true, bb_false);
736 return VOID;
739 return VOID;
744 static pseudo_t linearize_logical_branch(struct entrypoint *ep, struct expression *expr, struct basic_block *bb_true, struct basic_block *bb_false)
746 struct basic_block *next = alloc_basic_block();
748 if (expr->op == SPECIAL_LOGICAL_OR)
749 linearize_cond_branch(ep, expr->left, bb_true, next);
750 else
751 linearize_cond_branch(ep, expr->left, next, bb_false);
752 set_activeblock(ep, next);
753 linearize_cond_branch(ep, expr->right, bb_true, bb_false);
754 return VOID;
757 pseudo_t linearize_cast(struct entrypoint *ep, struct expression *expr)
759 pseudo_t src, result;
760 struct instruction *insn;
762 src = linearize_expression(ep, expr->cast_expression);
763 if (src == VOID)
764 return VOID;
765 insn = alloc_instruction(OP_CAST, expr->ctype);
766 result = alloc_pseudo();
767 insn->target = result;
768 insn->src = src;
769 insn->orig_type = expr->cast_expression->ctype;
770 add_one_insn(ep, expr->pos, insn);
771 return result;
774 pseudo_t linearize_expression(struct entrypoint *ep, struct expression *expr)
776 if (!expr)
777 return VOID;
779 switch (expr->type) {
780 case EXPR_VALUE: case EXPR_STRING: case EXPR_SYMBOL: case EXPR_FVALUE: case EXPR_LABEL:
781 return add_setval(ep, expr->ctype, expr);
783 case EXPR_STATEMENT:
784 return linearize_statement(ep, expr->statement);
786 case EXPR_CALL:
787 return linearize_call_expression(ep, expr);
789 case EXPR_BINOP:
790 return linearize_binop(ep, expr);
792 case EXPR_LOGICAL:
793 return linearize_logical(ep, expr);
795 case EXPR_COMPARE:
796 return linearize_compare(ep, expr);
798 case EXPR_SELECT:
799 return linearize_select(ep, expr);
801 case EXPR_CONDITIONAL:
802 return linearize_conditional(ep, expr, expr->conditional,
803 expr->cond_true, expr->cond_false);
805 case EXPR_COMMA: {
806 linearize_expression(ep, expr->left);
807 return linearize_expression(ep, expr->right);
810 case EXPR_ASSIGNMENT:
811 return linearize_assignment(ep, expr);
813 case EXPR_PREOP:
814 return linearize_preop(ep, expr);
816 case EXPR_POSTOP:
817 return linearize_postop(ep, expr);
819 case EXPR_CAST:
820 return linearize_cast(ep, expr);
822 case EXPR_BITFIELD:
823 return linearize_access(ep, expr);
825 case EXPR_SLICE:
826 return linearize_slice(ep, expr);
828 default:
829 warn(expr->pos, "unknown expression (%d %d)", expr->type, expr->op);
830 return VOID;
832 return VOID;
835 pseudo_t linearize_statement(struct entrypoint *ep, struct statement *stmt)
837 if (!stmt)
838 return VOID;
840 switch (stmt->type) {
841 case STMT_NONE:
842 break;
844 case STMT_EXPRESSION:
845 return linearize_expression(ep, stmt->expression);
847 case STMT_ASM:
848 /* FIXME */
849 break;
851 case STMT_RETURN: {
852 struct expression *expr = stmt->expression;
853 struct basic_block *bb_return = stmt->ret_target->bb_target;
854 struct basic_block *active;
855 pseudo_t src = linearize_expression(ep, expr);
856 active = ep->active;
857 add_goto(ep, bb_return);
858 if (src != &void_pseudo) {
859 struct instruction *phi_node = first_instruction(bb_return->insns);
860 if (!phi_node) {
861 phi_node = alloc_instruction(OP_PHI, expr->ctype);
862 phi_node->target = alloc_pseudo();
863 add_instruction(&bb_return->insns, phi_node);
865 add_phi(&phi_node->phi_list, alloc_phi(active, src));
867 return VOID;
870 case STMT_CASE: {
871 struct basic_block *bb = get_bound_block(ep, stmt->case_label);
872 set_activeblock(ep, bb);
873 linearize_statement(ep, stmt->case_statement);
874 break;
877 case STMT_LABEL: {
878 struct symbol *label = stmt->label_identifier;
879 struct basic_block *bb;
881 if (label->used) {
882 bb = get_bound_block(ep, stmt->label_identifier);
883 set_activeblock(ep, bb);
884 linearize_statement(ep, stmt->label_statement);
886 break;
889 case STMT_GOTO: {
890 struct symbol *sym;
891 struct expression *expr;
892 struct instruction *goto_ins;
893 pseudo_t pseudo;
895 if (stmt->goto_label) {
896 add_goto(ep, get_bound_block(ep, stmt->goto_label));
897 break;
900 /* This can happen as part of simplification */
901 expr = stmt->goto_expression;
902 if (expr->type == EXPR_LABEL) {
903 add_goto(ep, get_bound_block(ep, expr->label_symbol));
904 break;
907 pseudo = linearize_expression(ep, expr);
908 goto_ins = alloc_instruction(OP_COMPUTEDGOTO, NULL);
909 add_one_insn(ep, stmt->pos, goto_ins);
910 goto_ins->target = pseudo;
912 FOR_EACH_PTR(stmt->target_list, sym) {
913 struct basic_block *bb_computed = get_bound_block(ep, sym);
914 struct multijmp *jmp = alloc_multijmp(bb_computed, 1, 0);
915 add_multijmp(&goto_ins->multijmp_list, jmp);
916 add_bb(&bb_computed->parents, ep->active);
917 } END_FOR_EACH_PTR;
919 finish_block(ep);
920 break;
923 case STMT_COMPOUND: {
924 pseudo_t pseudo = NULL;
925 struct statement *s;
926 struct symbol *ret = stmt->ret;
927 concat_symbol_list(stmt->syms, &ep->syms);
928 if (ret)
929 ret->bb_target = alloc_basic_block();
930 FOR_EACH_PTR(stmt->stmts, s) {
931 pseudo = linearize_statement(ep, s);
932 } END_FOR_EACH_PTR;
933 if (ret) {
934 struct basic_block *bb = ret->bb_target;
935 struct instruction *phi = first_instruction(bb->insns);
937 if (!phi)
938 return pseudo;
940 set_activeblock(ep, bb);
941 if (phi_list_size(phi->phi_list)==1) {
942 pseudo = first_phi(phi->phi_list)->pseudo;
943 delete_last_instruction(&bb->insns);
944 return pseudo;
946 return phi->target;
948 return pseudo;
952 * This could take 'likely/unlikely' into account, and
953 * switch the arms around appropriately..
955 case STMT_IF: {
956 struct basic_block *bb_true, *bb_false, *endif;
957 struct expression *cond = stmt->if_conditional;
959 bb_true = alloc_basic_block();
960 bb_false = endif = alloc_basic_block();
962 linearize_cond_branch(ep, cond, bb_true, bb_false);
964 set_activeblock(ep, bb_true);
965 linearize_statement(ep, stmt->if_true);
967 if (stmt->if_false) {
968 endif = alloc_basic_block();
969 add_goto(ep, endif);
970 set_activeblock(ep, bb_false);
971 linearize_statement(ep, stmt->if_false);
973 set_activeblock(ep, endif);
974 break;
977 case STMT_SWITCH: {
978 struct symbol *sym;
979 struct instruction *switch_ins;
980 struct basic_block *switch_end = alloc_basic_block();
981 pseudo_t pseudo;
983 pseudo = linearize_expression(ep, stmt->switch_expression);
984 switch_ins = alloc_instruction(OP_SWITCH, NULL);
985 switch_ins->cond = pseudo;
986 add_one_insn(ep, stmt->pos, switch_ins);
988 FOR_EACH_PTR(stmt->switch_case->symbol_list, sym) {
989 struct statement *case_stmt = sym->stmt;
990 struct basic_block *bb_case = get_bound_block(ep, sym);
991 struct multijmp *jmp;
993 if (!case_stmt->case_expression) {
994 jmp = alloc_multijmp(bb_case, 1, 0);
995 } else {
996 int begin, end;
998 begin = end = case_stmt->case_expression->value;
999 if (case_stmt->case_to)
1000 end = case_stmt->case_to->value;
1001 if (begin > end)
1002 jmp = alloc_multijmp(bb_case, end, begin);
1003 else
1004 jmp = alloc_multijmp(bb_case, begin, end);
1007 add_multijmp(&switch_ins->multijmp_list, jmp);
1008 add_bb(&bb_case->parents, ep->active);
1009 } END_FOR_EACH_PTR;
1011 bind_label(stmt->switch_break, switch_end, stmt->pos);
1013 /* And linearize the actual statement */
1014 linearize_statement(ep, stmt->switch_statement);
1015 set_activeblock(ep, switch_end);
1017 break;
1020 case STMT_ITERATOR: {
1021 struct statement *pre_statement = stmt->iterator_pre_statement;
1022 struct expression *pre_condition = stmt->iterator_pre_condition;
1023 struct statement *statement = stmt->iterator_statement;
1024 struct statement *post_statement = stmt->iterator_post_statement;
1025 struct expression *post_condition = stmt->iterator_post_condition;
1026 struct basic_block *loop_top, *loop_body, *loop_continue, *loop_end;
1028 concat_symbol_list(stmt->iterator_syms, &ep->syms);
1029 linearize_statement(ep, pre_statement);
1031 loop_body = loop_top = alloc_basic_block();
1032 loop_continue = alloc_basic_block();
1033 loop_end = alloc_basic_block();
1035 if (pre_condition == post_condition) {
1036 loop_top = alloc_basic_block();
1037 loop_top->flags |= BB_REACHABLE;
1038 set_activeblock(ep, loop_top);
1041 loop_top->flags |= BB_REACHABLE;
1042 if (pre_condition)
1043 linearize_cond_branch(ep, pre_condition, loop_body, loop_end);
1045 bind_label(stmt->iterator_continue, loop_continue, stmt->pos);
1046 bind_label(stmt->iterator_break, loop_end, stmt->pos);
1048 set_activeblock(ep, loop_body);
1049 linearize_statement(ep, statement);
1050 add_goto(ep, loop_continue);
1052 if (post_condition) {
1053 set_activeblock(ep, loop_continue);
1054 linearize_statement(ep, post_statement);
1055 if (pre_condition == post_condition)
1056 add_goto(ep, loop_top);
1057 else
1058 linearize_cond_branch(ep, post_condition, loop_top, loop_end);
1061 set_activeblock(ep, loop_end);
1062 break;
1065 default:
1066 break;
1068 return VOID;
1071 void mark_bb_reachable(struct basic_block *bb)
1073 struct basic_block *child;
1074 struct terminator_iterator term;
1075 struct basic_block_list *bbstack = NULL;
1077 if (!bb || bb->flags & BB_REACHABLE)
1078 return;
1080 add_bb(&bbstack, bb);
1081 while (bbstack) {
1082 bb = delete_last_basic_block(&bbstack);
1083 if (bb->flags & BB_REACHABLE)
1084 continue;
1085 bb->flags |= BB_REACHABLE;
1086 init_terminator_iterator(last_instruction(bb->insns), &term);
1087 while ((child=next_terminator_bb(&term)) != NULL) {
1088 if (!(child->flags & BB_REACHABLE))
1089 add_bb(&bbstack, child);
1094 void remove_unreachable_bbs(struct basic_block_list **bblist)
1096 struct basic_block *bb, *child;
1097 struct list_iterator iterator;
1098 struct terminator_iterator term;
1100 init_iterator((struct ptr_list **) bblist, &iterator, 0);
1101 while((bb=next_basic_block(&iterator)) != NULL)
1102 bb->flags &= ~BB_REACHABLE;
1104 init_iterator((struct ptr_list **) bblist, &iterator, 0);
1105 mark_bb_reachable(next_basic_block(&iterator));
1106 while((bb=next_basic_block(&iterator)) != NULL) {
1107 if (bb->flags & BB_REACHABLE)
1108 continue;
1109 init_terminator_iterator(last_instruction(bb->insns), &term);
1110 while ((child=next_terminator_bb(&term)) != NULL)
1111 replace_basic_block_list(&child->parents, bb, NULL);
1112 delete_iterator(&iterator);
1116 void pack_basic_blocks(struct basic_block_list **bblist)
1118 struct basic_block *bb;
1119 struct list_iterator iterator;
1121 remove_unreachable_bbs(bblist);
1122 init_bb_iterator(bblist, &iterator, 0);
1123 while((bb=next_basic_block(&iterator)) != NULL) {
1124 struct list_iterator it_parents;
1125 struct terminator_iterator term;
1126 struct instruction *jmp;
1127 struct basic_block *target, *sibling, *parent;
1129 if (!is_branch_goto(jmp=last_instruction(bb->insns)))
1130 continue;
1132 target = jmp->bb_true ? jmp->bb_true : jmp->bb_false;
1133 if (target == bb)
1134 continue;
1135 if (bb_list_size(target->parents) != 1 && jmp != first_instruction(bb->insns))
1136 continue;
1138 /* Transfer the parents' terminator to target directly. */
1139 replace_basic_block_list(&target->parents, bb, NULL);
1140 init_bb_iterator(&bb->parents, &it_parents, 0);
1141 while((parent=next_basic_block(&it_parents)) != NULL) {
1142 init_terminator_iterator(last_instruction(parent->insns), &term);
1143 while ((sibling=next_terminator_bb(&term)) != NULL) {
1144 if (sibling == bb) {
1145 replace_terminator_bb(&term, target);
1146 add_bb(&target->parents, parent);
1151 /* Move the instructions to the target block. */
1152 delete_last_instruction(&bb->insns);
1153 if (bb->insns) {
1154 concat_instruction_list(target->insns, &bb->insns);
1155 free_instruction_list(&target->insns);
1156 target->insns = bb->insns;
1158 delete_iterator(&iterator);
1162 struct entrypoint *linearize_symbol(struct symbol *sym)
1164 struct symbol *base_type;
1165 struct entrypoint *ret_ep = NULL;
1167 if (!sym)
1168 return NULL;
1169 base_type = sym->ctype.base_type;
1170 if (!base_type)
1171 return NULL;
1172 if (base_type->type == SYM_FN) {
1173 if (base_type->stmt) {
1174 struct entrypoint *ep = alloc_entrypoint();
1175 struct basic_block *bb = alloc_basic_block();
1176 pseudo_t result;
1178 ep->name = sym;
1179 bb->flags |= BB_REACHABLE;
1180 set_activeblock(ep, bb);
1181 concat_symbol_list(base_type->arguments, &ep->syms);
1182 result = linearize_statement(ep, base_type->stmt);
1183 if (bb_reachable(ep->active) && !bb_terminated(ep->active)) {
1184 struct symbol *ret_type = base_type->ctype.base_type;
1185 struct instruction *insn = alloc_instruction(OP_RET, ret_type);
1186 struct position pos = base_type->stmt->pos;
1188 insn->src = result;
1189 add_one_insn(ep, pos, insn);
1191 pack_basic_blocks(&ep->bbs);
1192 ret_ep = ep;
1196 return ret_ep;