Verify that output/input asm constraints really look like outputs/inputs.
[smatch.git] / simplify.c
blobe294efb03b99b6d0c615246be9b3e02f32b0a063
1 /*
2 * Simplify - do instruction simplification before CSE
4 * Copyright (C) 2004 Linus Torvalds
5 */
7 #include <assert.h>
9 #include "parse.h"
10 #include "expression.h"
11 #include "linearize.h"
12 #include "flow.h"
14 /* Find the trivial parent for a phi-source */
15 static struct basic_block *phi_parent(struct basic_block *source, pseudo_t pseudo)
17 /* Can't go upwards if the pseudo is defined in the bb it came from.. */
18 if (pseudo->type == PSEUDO_REG) {
19 struct instruction *def = pseudo->def;
20 if (def->bb == source)
21 return source;
23 if (bb_list_size(source->children) != 1 || bb_list_size(source->parents) != 1)
24 return source;
25 return first_basic_block(source->parents);
28 static void clear_phi(struct instruction *insn)
30 pseudo_t phi;
32 insn->bb = NULL;
33 FOR_EACH_PTR(insn->phi_list, phi) {
34 *THIS_ADDRESS(phi) = VOID;
35 } END_FOR_EACH_PTR(phi);
38 static int if_convert_phi(struct instruction *insn)
40 pseudo_t array[3];
41 struct basic_block *parents[3];
42 struct basic_block *bb, *bb1, *bb2, *source;
43 struct instruction *br;
44 pseudo_t p1, p2;
46 bb = insn->bb;
47 if (linearize_ptr_list((struct ptr_list *)insn->phi_list, (void **)array, 3) != 2)
48 return 0;
49 if (linearize_ptr_list((struct ptr_list *)bb->parents, (void **)parents, 3) != 2)
50 return 0;
51 p1 = array[0]->def->src1;
52 bb1 = array[0]->def->bb;
53 p2 = array[1]->def->src1;
54 bb2 = array[1]->def->bb;
56 /* Only try the simple "direct parents" case */
57 if ((bb1 != parents[0] || bb2 != parents[1]) &&
58 (bb1 != parents[1] || bb2 != parents[0]))
59 return 0;
62 * See if we can find a common source for this..
64 source = phi_parent(bb1, p1);
65 if (source != phi_parent(bb2, p2))
66 return 0;
69 * Cool. We now know that 'source' is the exclusive
70 * parent of both phi-nodes, so the exit at the
71 * end of it fully determines which one it is, and
72 * we can turn it into a select.
74 * HOWEVER, right now we only handle regular
75 * conditional branches. No multijumps or computed
76 * stuff. Verify that here.
78 br = last_instruction(source->insns);
79 if (!br || br->opcode != OP_BR)
80 return 0;
82 assert(br->cond);
83 assert(br->bb_false);
86 * We're in business. Match up true/false with p1/p2.
88 if (br->bb_true == bb2 || br->bb_false == bb1) {
89 pseudo_t p = p1;
90 p1 = p2;
91 p2 = p;
95 * Ok, we can now replace that last
97 * br cond, a, b
99 * with the sequence
101 * setcc cond
102 * select pseudo, p1, p2
103 * br cond, a, b
105 * and remove the phi-node. If it then
106 * turns out that 'a' or 'b' is entirely
107 * empty (common case), and now no longer
108 * a phi-source, we'll be able to simplify
109 * the conditional branch too.
111 insert_select(source, br, insn, p1, p2);
112 clear_phi(insn);
113 return REPEAT_CSE;
116 static int clean_up_phi(struct instruction *insn)
118 pseudo_t phi;
119 struct instruction *last;
120 int same;
122 last = NULL;
123 same = 1;
124 FOR_EACH_PTR(insn->phi_list, phi) {
125 struct instruction *def;
126 if (phi == VOID)
127 continue;
128 def = phi->def;
129 if (def->src1 == VOID || !def->bb)
130 continue;
131 if (last) {
132 if (last->src1 != def->src1)
133 same = 0;
134 continue;
136 last = def;
137 } END_FOR_EACH_PTR(phi);
139 if (same) {
140 pseudo_t pseudo = last ? last->src1 : VOID;
141 convert_instruction_target(insn, pseudo);
142 clear_phi(insn);
143 return REPEAT_CSE;
146 return if_convert_phi(insn);
149 static inline void remove_usage(pseudo_t p, pseudo_t *usep)
151 if (has_use_list(p)) {
152 delete_ptr_list_entry((struct ptr_list **)&p->users, usep, 1);
153 if (!p->users)
154 kill_instruction(p->def);
158 void kill_use(pseudo_t *usep)
160 if (usep) {
161 pseudo_t p = *usep;
162 *usep = VOID;
163 remove_usage(p, usep);
167 void kill_instruction(struct instruction *insn)
169 if (!insn || !insn->bb)
170 return;
172 switch (insn->opcode) {
173 case OP_BINARY ... OP_BINCMP_END:
174 insn->bb = NULL;
175 kill_use(&insn->src1);
176 kill_use(&insn->src2);
177 repeat_phase |= REPEAT_CSE;
178 return;
180 case OP_NOT: case OP_NEG:
181 insn->bb = NULL;
182 kill_use(&insn->src1);
183 repeat_phase |= REPEAT_CSE;
184 return;
186 case OP_PHI:
187 insn->bb = NULL;
188 repeat_phase |= REPEAT_CSE;
189 return;
191 case OP_SETVAL:
192 insn->bb = NULL;
193 repeat_phase |= REPEAT_CSE;
194 if (insn->symbol)
195 repeat_phase |= REPEAT_SYMBOL_CLEANUP;
196 return;
201 * Kill trivially dead instructions
203 static int dead_insn(struct instruction *insn, pseudo_t *src1, pseudo_t *src2, pseudo_t *src3)
205 pseudo_t *usep;
206 FOR_EACH_PTR(insn->target->users, usep) {
207 if (*usep != VOID)
208 return 0;
209 } END_FOR_EACH_PTR(usep);
211 insn->bb = NULL;
212 kill_use(src1);
213 kill_use(src2);
214 kill_use(src3);
215 return REPEAT_CSE;
218 static inline int constant(pseudo_t pseudo)
220 return pseudo->type == PSEUDO_VAL;
223 static int replace_with_pseudo(struct instruction *insn, pseudo_t pseudo)
225 convert_instruction_target(insn, pseudo);
226 insn->bb = NULL;
227 return REPEAT_CSE;
230 static int simplify_constant_rightside(struct instruction *insn)
232 long long value = insn->src2->value;
234 switch (insn->opcode) {
235 case OP_SUB:
236 if (value) {
237 insn->opcode = OP_ADD;
238 insn->src2 = value_pseudo(-value);
239 return REPEAT_CSE;
241 /* Fallthrough */
242 case OP_ADD:
243 case OP_OR: case OP_XOR:
244 case OP_SHL: case OP_SHR:
245 if (!value)
246 return replace_with_pseudo(insn, insn->src1);
247 return 0;
249 case OP_AND: case OP_MUL:
250 if (!value)
251 return replace_with_pseudo(insn, insn->src2);
252 return 0;
254 return 0;
257 static int simplify_constant_leftside(struct instruction *insn)
259 long long value = insn->src1->value;
261 switch (insn->opcode) {
262 case OP_ADD: case OP_OR: case OP_XOR:
263 if (!value)
264 return replace_with_pseudo(insn, insn->src2);
265 return 0;
267 case OP_SHL: case OP_SHR:
268 case OP_AND: case OP_MUL:
269 if (!value)
270 return replace_with_pseudo(insn, insn->src1);
271 return 0;
273 return 0;
276 static int simplify_constant_binop(struct instruction *insn)
278 /* FIXME! Verify signs and sizes!! */
279 long long left = insn->src1->value;
280 long long right = insn->src2->value;
281 long long res, mask;
283 switch (insn->opcode) {
284 case OP_ADD:
285 res = left + right;
286 break;
287 case OP_SUB:
288 res = left - right;
289 break;
290 case OP_MUL:
291 /* FIXME! Check sign! */
292 res = left * right;
293 break;
294 case OP_DIV:
295 if (!right)
296 return 0;
297 /* FIXME! Check sign! */
298 res = left / right;
299 break;
300 case OP_MOD:
301 if (!right)
302 return 0;
303 /* FIXME! Check sign! */
304 res = left % right;
305 break;
306 case OP_SHL:
307 res = left << right;
308 break;
309 case OP_SHR:
310 /* FIXME! Check sign! */
311 res = left >> right;
312 break;
313 /* Logical */
314 case OP_AND:
315 res = left & right;
316 break;
317 case OP_OR:
318 res = left | right;
319 break;
320 case OP_XOR:
321 res = left ^ right;
322 break;
323 case OP_AND_BOOL:
324 res = left && right;
325 break;
326 case OP_OR_BOOL:
327 res = left || right;
328 break;
330 /* Binary comparison */
331 case OP_SET_EQ:
332 res = left == right;
333 break;
334 case OP_SET_NE:
335 res = left != right;
336 break;
337 case OP_SET_LE:
338 /* FIXME! Check sign! */
339 res = left <= right;
340 break;
341 case OP_SET_GE:
342 /* FIXME! Check sign! */
343 res = left >= right;
344 break;
345 case OP_SET_LT:
346 /* FIXME! Check sign! */
347 res = left < right;
348 break;
349 case OP_SET_GT:
350 /* FIXME! Check sign! */
351 res = left > right;
352 break;
353 case OP_SET_B:
354 /* FIXME! Check sign! */
355 res = (unsigned long long) left < (unsigned long long) right;
356 break;
357 case OP_SET_A:
358 /* FIXME! Check sign! */
359 res = (unsigned long long) left > (unsigned long long) right;
360 break;
361 case OP_SET_BE:
362 /* FIXME! Check sign! */
363 res = (unsigned long long) left <= (unsigned long long) right;
364 break;
365 case OP_SET_AE:
366 /* FIXME! Check sign! */
367 res = (unsigned long long) left >= (unsigned long long) right;
368 break;
369 default:
370 return 0;
372 mask = 1ULL << (insn->size-1);
373 res &= mask | (mask-1);
375 /* FIXME!! Sign??? */
376 replace_with_pseudo(insn, value_pseudo(res));
377 return REPEAT_CSE;
380 static int simplify_binop(struct instruction *insn)
382 if (dead_insn(insn, &insn->src1, &insn->src2, NULL))
383 return REPEAT_CSE;
384 if (constant(insn->src1)) {
385 if (constant(insn->src2))
386 return simplify_constant_binop(insn);
387 return simplify_constant_leftside(insn);
389 if (constant(insn->src2))
390 return simplify_constant_rightside(insn);
391 return 0;
394 static void switch_pseudo(pseudo_t *pp1, pseudo_t *pp2)
396 pseudo_t p1 = *pp1, p2 = *pp2;
398 use_pseudo(p2, pp1);
399 use_pseudo(p1, pp2);
400 remove_usage(p1, pp1);
401 remove_usage(p2, pp2);
404 static int canonical_order(pseudo_t p1, pseudo_t p2)
406 /* symbol/constants on the right */
407 if (p1->type == PSEUDO_VAL)
408 return p2->type == PSEUDO_VAL;
410 if (p1->type == PSEUDO_SYM)
411 return p2->type == PSEUDO_SYM || p2->type == PSEUDO_VAL;
413 return 1;
416 static int simplify_commutative_binop(struct instruction *insn)
418 if (!canonical_order(insn->src1, insn->src2)) {
419 switch_pseudo(&insn->src1, &insn->src2);
420 return REPEAT_CSE;
422 return 0;
425 static inline int simple_pseudo(pseudo_t pseudo)
427 return pseudo->type == PSEUDO_VAL || pseudo->type == PSEUDO_SYM;
430 static int simplify_associative_binop(struct instruction *insn)
432 struct instruction *def;
433 pseudo_t pseudo = insn->src1;
435 if (!simple_pseudo(insn->src2))
436 return 0;
437 if (pseudo->type != PSEUDO_REG)
438 return 0;
439 def = pseudo->def;
440 if (def->opcode != insn->opcode)
441 return 0;
442 if (!simple_pseudo(def->src2))
443 return 0;
444 if (ptr_list_size((struct ptr_list *)def->target->users) != 1)
445 return 0;
446 switch_pseudo(&def->src1, &insn->src2);
447 return REPEAT_CSE;
450 static int simplify_constant_unop(struct instruction *insn)
452 long long val = insn->src1->value;
453 long long res, mask;
455 switch (insn->opcode) {
456 case OP_NOT:
457 res = ~val;
458 break;
459 case OP_NEG:
460 res = -val;
461 break;
462 default:
463 return 0;
465 mask = 1ULL << (insn->size-1);
466 res &= mask | (mask-1);
468 replace_with_pseudo(insn, value_pseudo(res));
469 return REPEAT_CSE;
472 static int simplify_unop(struct instruction *insn)
474 if (dead_insn(insn, &insn->src1, NULL, NULL))
475 return REPEAT_CSE;
476 if (constant(insn->src1))
477 return simplify_constant_unop(insn);
478 return 0;
481 static int simplify_one_memop(struct instruction *insn, pseudo_t orig)
483 pseudo_t addr = insn->src;
484 pseudo_t new, off;
486 if (addr->type == PSEUDO_REG) {
487 struct instruction *def = addr->def;
488 if (def->opcode == OP_SETVAL && def->src) {
489 kill_use(&insn->src);
490 use_pseudo(def->src, &insn->src);
491 return REPEAT_CSE | REPEAT_SYMBOL_CLEANUP;
493 if (def->opcode == OP_ADD) {
494 new = def->src1;
495 off = def->src2;
496 if (constant(off))
497 goto offset;
498 new = off;
499 off = def->src1;
500 if (constant(off))
501 goto offset;
502 return 0;
505 return 0;
507 offset:
508 /* Invalid code */
509 if (new == orig) {
510 if (new == VOID)
511 return 0;
512 new = VOID;
513 warning(insn->bb->pos, "crazy programmer");
515 insn->offset += off->value;
516 use_pseudo(new, &insn->src);
517 remove_usage(addr, &insn->src);
518 return REPEAT_CSE | REPEAT_SYMBOL_CLEANUP;
522 * We walk the whole chain of adds/subs backwards. That's not
523 * only more efficient, but it allows us to find looops.
525 static int simplify_memop(struct instruction *insn)
527 int one, ret = 0;
528 pseudo_t orig = insn->src;
530 do {
531 one = simplify_one_memop(insn, orig);
532 ret |= one;
533 } while (one);
534 return ret;
537 static int simplify_cast(struct instruction *insn)
539 int orig_size;
541 if (dead_insn(insn, &insn->src, NULL, NULL))
542 return REPEAT_CSE;
543 if (insn->opcode == OP_PTRCAST)
544 return 0;
545 orig_size = insn->orig_type ? insn->orig_type->bit_size : 0;
546 if (orig_size < 0)
547 orig_size = 0;
548 if (insn->size != orig_size)
549 return 0;
550 return replace_with_pseudo(insn, insn->src);
553 static int simplify_select(struct instruction *insn)
555 pseudo_t cond, src1, src2;
557 if (dead_insn(insn, &insn->src1, &insn->src2, &insn->src3))
558 return REPEAT_CSE;
560 cond = insn->src1;
561 src1 = insn->src2;
562 src2 = insn->src3;
563 if (constant(cond) || src1 == src2) {
564 pseudo_t *kill, take;
565 kill_use(&insn->src1);
566 take = cond->value ? src1 : src2;
567 kill = cond->value ? &insn->src3 : &insn->src2;
568 kill_use(kill);
569 replace_with_pseudo(insn, take);
570 return REPEAT_CSE;
572 if (constant(src1) && constant(src2)) {
573 long long val1 = src1->value;
574 long long val2 = src2->value;
576 /* The pair 0/1 is special - replace with SETNE/SETEQ */
577 if ((val1 | val2) == 1) {
578 int opcode = OP_SET_EQ;
579 if (val1) {
580 src1 = src2;
581 opcode = OP_SET_NE;
583 insn->opcode = opcode;
584 /* insn->src1 is already cond */
585 insn->src2 = src1; /* Zero */
586 return REPEAT_CSE;
589 return 0;
593 * Simplify "set_ne/eq $0 + br"
595 static int simplify_cond_branch(struct instruction *br, pseudo_t cond, struct instruction *def, pseudo_t *pp)
597 use_pseudo(*pp, &br->cond);
598 remove_usage(cond, &br->cond);
599 if (def->opcode == OP_SET_EQ) {
600 struct basic_block *true = br->bb_true;
601 struct basic_block *false = br->bb_false;
602 br->bb_false = true;
603 br->bb_true = false;
605 return REPEAT_CSE;
608 static int simplify_branch(struct instruction *insn)
610 pseudo_t cond = insn->cond;
612 if (!cond)
613 return 0;
615 /* Constant conditional */
616 if (constant(cond)) {
617 insert_branch(insn->bb, insn, cond->value ? insn->bb_true : insn->bb_false);
618 return REPEAT_CSE;
621 /* Same target? */
622 if (insn->bb_true == insn->bb_false) {
623 struct basic_block *bb = insn->bb;
624 struct basic_block *target = insn->bb_false;
625 remove_bb_from_list(&target->parents, bb, 1);
626 remove_bb_from_list(&bb->children, target, 1);
627 insn->bb_false = NULL;
628 kill_use(&insn->cond);
629 insn->cond = NULL;
630 return REPEAT_CSE;
633 /* Conditional on a SETNE $0 or SETEQ $0 */
634 if (cond->type == PSEUDO_REG) {
635 struct instruction *def = cond->def;
637 if (def->opcode == OP_SET_NE || def->opcode == OP_SET_EQ) {
638 if (constant(def->src1) && !def->src1->value)
639 return simplify_cond_branch(insn, cond, def, &def->src2);
640 if (constant(def->src2) && !def->src2->value)
641 return simplify_cond_branch(insn, cond, def, &def->src1);
643 if (def->opcode == OP_SEL) {
644 if (constant(def->src2) && constant(def->src3)) {
645 long long val1 = def->src2->value;
646 long long val2 = def->src3->value;
647 if (!val1 && !val2) {
648 insert_branch(insn->bb, insn, insn->bb_false);
649 return REPEAT_CSE;
651 if (val1 && val2) {
652 insert_branch(insn->bb, insn, insn->bb_true);
653 return REPEAT_CSE;
655 if (val2) {
656 struct basic_block *true = insn->bb_true;
657 struct basic_block *false = insn->bb_false;
658 insn->bb_false = true;
659 insn->bb_true = false;
661 use_pseudo(def->src1, &insn->cond);
662 remove_usage(cond, &insn->cond);
663 return REPEAT_CSE;
667 return 0;
670 static int simplify_switch(struct instruction *insn)
672 pseudo_t cond = insn->cond;
673 long long val;
674 struct multijmp *jmp;
676 if (!constant(cond))
677 return 0;
678 val = insn->cond->value;
680 FOR_EACH_PTR(insn->multijmp_list, jmp) {
681 /* Default case */
682 if (jmp->begin > jmp->end)
683 goto found;
684 if (val >= jmp->begin && val <= jmp->end)
685 goto found;
686 } END_FOR_EACH_PTR(jmp);
687 warning(insn->bb->pos, "Impossible case statement");
688 return 0;
690 found:
691 insert_branch(insn->bb, insn, jmp->target);
692 return REPEAT_CSE;
695 int simplify_instruction(struct instruction *insn)
697 if (!insn->bb)
698 return 0;
699 switch (insn->opcode) {
700 case OP_ADD:
701 case OP_AND: case OP_OR: case OP_XOR:
702 case OP_AND_BOOL: case OP_OR_BOOL:
703 if (simplify_binop(insn))
704 return REPEAT_CSE;
705 if (simplify_commutative_binop(insn))
706 return REPEAT_CSE;
707 return simplify_associative_binop(insn);
710 * Multiplication isn't associative in 2's complement,
711 * but we could do it if signed.
713 case OP_MUL:
714 case OP_SET_EQ: case OP_SET_NE:
715 if (simplify_binop(insn))
716 return REPEAT_CSE;
717 return simplify_commutative_binop(insn);
719 case OP_SUB: case OP_DIV: case OP_MOD:
720 case OP_SHL: case OP_SHR:
721 case OP_SET_LE: case OP_SET_GE:
722 case OP_SET_LT: case OP_SET_GT:
723 case OP_SET_B: case OP_SET_A:
724 case OP_SET_BE: case OP_SET_AE:
725 return simplify_binop(insn);
727 case OP_NOT: case OP_NEG:
728 return simplify_unop(insn);
729 case OP_LOAD: case OP_STORE:
730 return simplify_memop(insn);
731 case OP_SETVAL:
732 if (dead_insn(insn, NULL, NULL, NULL))
733 return REPEAT_CSE | REPEAT_SYMBOL_CLEANUP;
734 return replace_with_pseudo(insn, insn->symbol);
735 case OP_PTRCAST:
736 case OP_CAST:
737 return simplify_cast(insn);
738 case OP_PHI:
739 if (dead_insn(insn, NULL, NULL, NULL)) {
740 clear_phi(insn);
741 return REPEAT_CSE;
743 return clean_up_phi(insn);
744 case OP_PHISOURCE:
745 if (dead_insn(insn, &insn->phi_src, NULL, NULL))
746 return REPEAT_CSE;
747 break;
748 case OP_SEL:
749 return simplify_select(insn);
750 case OP_BR:
751 return simplify_branch(insn);
752 case OP_SWITCH:
753 return simplify_switch(insn);
755 return 0;