2 * Simplify - do instruction simplification before CSE
4 * Copyright (C) 2004 Linus Torvalds
10 #include "expression.h"
11 #include "linearize.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
)
23 if (bb_list_size(source
->children
) != 1 || bb_list_size(source
->parents
) != 1)
25 return first_basic_block(source
->parents
);
28 static void clear_phi(struct instruction
*insn
)
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
)
41 struct basic_block
*parents
[3];
42 struct basic_block
*bb
, *bb1
, *bb2
, *source
;
43 struct instruction
*br
;
47 if (linearize_ptr_list((struct ptr_list
*)insn
->phi_list
, (void **)array
, 3) != 2)
49 if (linearize_ptr_list((struct ptr_list
*)bb
->parents
, (void **)parents
, 3) != 2)
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]))
62 * See if we can find a common source for this..
64 source
= phi_parent(bb1
, p1
);
65 if (source
!= phi_parent(bb2
, p2
))
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
)
86 * We're in business. Match up true/false with p1/p2.
88 if (br
->bb_true
== bb2
|| br
->bb_false
== bb1
) {
95 * Ok, we can now replace that last
102 * select pseudo, p1, p2
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
);
116 static int clean_up_phi(struct instruction
*insn
)
119 struct instruction
*last
;
124 FOR_EACH_PTR(insn
->phi_list
, phi
) {
125 struct instruction
*def
;
129 if (def
->src1
== VOID
|| !def
->bb
)
132 if (last
->src1
!= def
->src1
)
137 } END_FOR_EACH_PTR(phi
);
140 pseudo_t pseudo
= last
? last
->src1
: VOID
;
141 convert_instruction_target(insn
, pseudo
);
146 return if_convert_phi(insn
);
149 int delete_pseudo_user_list_entry(struct pseudo_user_list
**list
, pseudo_t
*entry
, int count
)
151 struct pseudo_user
*pu
;
153 FOR_EACH_PTR(*list
, pu
) {
154 if (pu
->userp
== entry
) {
155 DELETE_CURRENT_PTR(pu
);
159 } END_FOR_EACH_PTR(pu
);
162 pack_ptr_list((struct ptr_list
**)list
);
166 static inline void remove_usage(pseudo_t p
, pseudo_t
*usep
)
168 if (has_use_list(p
)) {
169 delete_pseudo_user_list_entry(&p
->users
, usep
, 1);
171 kill_instruction(p
->def
);
175 void kill_use(pseudo_t
*usep
)
180 remove_usage(p
, usep
);
184 void kill_instruction(struct instruction
*insn
)
186 if (!insn
|| !insn
->bb
)
189 switch (insn
->opcode
) {
190 case OP_BINARY
... OP_BINCMP_END
:
192 kill_use(&insn
->src1
);
193 kill_use(&insn
->src2
);
194 repeat_phase
|= REPEAT_CSE
;
197 case OP_NOT
: case OP_NEG
:
199 kill_use(&insn
->src1
);
200 repeat_phase
|= REPEAT_CSE
;
205 repeat_phase
|= REPEAT_CSE
;
210 repeat_phase
|= REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
215 repeat_phase
|= REPEAT_CSE
;
216 kill_use(&insn
->src1
);
217 kill_use(&insn
->src2
);
218 kill_use(&insn
->src3
);
224 * Kill trivially dead instructions
226 static int dead_insn(struct instruction
*insn
, pseudo_t
*src1
, pseudo_t
*src2
, pseudo_t
*src3
)
228 struct pseudo_user
*pu
;
229 FOR_EACH_PTR(insn
->target
->users
, pu
) {
230 if (*pu
->userp
!= VOID
)
232 } END_FOR_EACH_PTR(pu
);
241 static inline int constant(pseudo_t pseudo
)
243 return pseudo
->type
== PSEUDO_VAL
;
246 static int replace_with_pseudo(struct instruction
*insn
, pseudo_t pseudo
)
248 convert_instruction_target(insn
, pseudo
);
253 static int simplify_constant_rightside(struct instruction
*insn
)
255 long long value
= insn
->src2
->value
;
257 switch (insn
->opcode
) {
260 insn
->opcode
= OP_ADD
;
261 insn
->src2
= value_pseudo(-value
);
266 case OP_OR
: case OP_XOR
:
269 case OP_LSR
: case OP_ASR
:
271 return replace_with_pseudo(insn
, insn
->src1
);
274 case OP_MULU
: case OP_MULS
:
277 return replace_with_pseudo(insn
, insn
->src1
);
281 return replace_with_pseudo(insn
, insn
->src2
);
287 static int simplify_constant_leftside(struct instruction
*insn
)
289 long long value
= insn
->src1
->value
;
291 switch (insn
->opcode
) {
292 case OP_ADD
: case OP_OR
: case OP_XOR
:
294 return replace_with_pseudo(insn
, insn
->src2
);
298 case OP_LSR
: case OP_ASR
:
300 case OP_MULU
: case OP_MULS
:
302 return replace_with_pseudo(insn
, insn
->src1
);
308 static int simplify_constant_binop(struct instruction
*insn
)
310 /* FIXME! Verify signs and sizes!! */
311 long long left
= insn
->src1
->value
;
312 long long right
= insn
->src2
->value
;
313 unsigned long long ul
, ur
;
314 long long res
, mask
, bits
;
316 mask
= 1ULL << (insn
->size
-1);
317 bits
= mask
| (mask
-1);
326 switch (insn
->opcode
) {
385 /* Binary comparison */
421 replace_with_pseudo(insn
, value_pseudo(res
));
425 static int simplify_binop(struct instruction
*insn
)
427 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, NULL
))
429 if (constant(insn
->src1
)) {
430 if (constant(insn
->src2
))
431 return simplify_constant_binop(insn
);
432 return simplify_constant_leftside(insn
);
434 if (constant(insn
->src2
))
435 return simplify_constant_rightside(insn
);
439 static void switch_pseudo(struct instruction
*insn1
, pseudo_t
*pp1
, struct instruction
*insn2
, pseudo_t
*pp2
)
441 pseudo_t p1
= *pp1
, p2
= *pp2
;
443 use_pseudo(insn1
, p2
, pp1
);
444 use_pseudo(insn2
, p1
, pp2
);
445 remove_usage(p1
, pp1
);
446 remove_usage(p2
, pp2
);
449 static int canonical_order(pseudo_t p1
, pseudo_t p2
)
451 /* symbol/constants on the right */
452 if (p1
->type
== PSEUDO_VAL
)
453 return p2
->type
== PSEUDO_VAL
;
455 if (p1
->type
== PSEUDO_SYM
)
456 return p2
->type
== PSEUDO_SYM
|| p2
->type
== PSEUDO_VAL
;
461 static int simplify_commutative_binop(struct instruction
*insn
)
463 if (!canonical_order(insn
->src1
, insn
->src2
)) {
464 switch_pseudo(insn
, &insn
->src1
, insn
, &insn
->src2
);
470 static inline int simple_pseudo(pseudo_t pseudo
)
472 return pseudo
->type
== PSEUDO_VAL
|| pseudo
->type
== PSEUDO_SYM
;
475 static int simplify_associative_binop(struct instruction
*insn
)
477 struct instruction
*def
;
478 pseudo_t pseudo
= insn
->src1
;
480 if (!simple_pseudo(insn
->src2
))
482 if (pseudo
->type
!= PSEUDO_REG
)
487 if (def
->opcode
!= insn
->opcode
)
489 if (!simple_pseudo(def
->src2
))
491 if (ptr_list_size((struct ptr_list
*)def
->target
->users
) != 1)
493 switch_pseudo(def
, &def
->src1
, insn
, &insn
->src2
);
497 static int simplify_constant_unop(struct instruction
*insn
)
499 long long val
= insn
->src1
->value
;
502 switch (insn
->opcode
) {
512 mask
= 1ULL << (insn
->size
-1);
513 res
&= mask
| (mask
-1);
515 replace_with_pseudo(insn
, value_pseudo(res
));
519 static int simplify_unop(struct instruction
*insn
)
521 if (dead_insn(insn
, &insn
->src1
, NULL
, NULL
))
523 if (constant(insn
->src1
))
524 return simplify_constant_unop(insn
);
528 static int simplify_one_memop(struct instruction
*insn
, pseudo_t orig
)
530 pseudo_t addr
= insn
->src
;
533 if (addr
->type
== PSEUDO_REG
) {
534 struct instruction
*def
= addr
->def
;
535 if (def
->opcode
== OP_SYMADDR
&& def
->src
) {
536 kill_use(&insn
->src
);
537 use_pseudo(insn
, def
->src
, &insn
->src
);
538 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
540 if (def
->opcode
== OP_ADD
) {
560 warning(insn
->pos
, "crazy programmer");
562 insn
->offset
+= off
->value
;
563 use_pseudo(insn
, new, &insn
->src
);
564 remove_usage(addr
, &insn
->src
);
565 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
569 * We walk the whole chain of adds/subs backwards. That's not
570 * only more efficient, but it allows us to find loops.
572 static int simplify_memop(struct instruction
*insn
)
575 pseudo_t orig
= insn
->src
;
578 one
= simplify_one_memop(insn
, orig
);
584 static long long get_cast_value(long long val
, int old_size
, int new_size
, int sign
)
588 if (sign
&& new_size
> old_size
) {
589 mask
= 1 << (old_size
-1);
591 val
|= ~(mask
| (mask
-1));
593 mask
= 1 << (new_size
-1);
594 return val
& (mask
| (mask
-1));
597 static int simplify_cast(struct instruction
*insn
)
599 struct symbol
*orig_type
;
603 if (dead_insn(insn
, &insn
->src
, NULL
, NULL
))
606 orig_type
= insn
->orig_type
;
609 orig_size
= orig_type
->bit_size
;
613 /* A cast of a constant? */
615 int sign
= orig_type
->ctype
.modifiers
& MOD_SIGNED
;
616 long long val
= get_cast_value(src
->value
, orig_size
, size
, sign
);
617 src
= value_pseudo(val
);
621 /* A cast of a "and" might be a no-op.. */
622 if (src
->type
== PSEUDO_REG
) {
623 struct instruction
*def
= src
->def
;
624 if (def
->opcode
== OP_AND
&& def
->size
>= size
) {
625 pseudo_t val
= def
->src2
;
626 if (val
->type
== PSEUDO_VAL
) {
627 unsigned long long value
= val
->value
;
628 if (!(value
>> (size
-1)))
634 if (size
== orig_size
) {
635 int op
= (orig_type
->ctype
.modifiers
& MOD_SIGNED
) ? OP_SCAST
: OP_CAST
;
636 if (insn
->opcode
== op
)
643 return replace_with_pseudo(insn
, src
);
646 static int simplify_select(struct instruction
*insn
)
648 pseudo_t cond
, src1
, src2
;
650 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, &insn
->src3
))
656 if (constant(cond
) || src1
== src2
) {
657 pseudo_t
*kill
, take
;
658 kill_use(&insn
->src1
);
659 take
= cond
->value
? src1
: src2
;
660 kill
= cond
->value
? &insn
->src3
: &insn
->src2
;
662 replace_with_pseudo(insn
, take
);
665 if (constant(src1
) && constant(src2
)) {
666 long long val1
= src1
->value
;
667 long long val2
= src2
->value
;
669 /* The pair 0/1 is special - replace with SETNE/SETEQ */
670 if ((val1
| val2
) == 1) {
671 int opcode
= OP_SET_EQ
;
676 insn
->opcode
= opcode
;
677 /* insn->src1 is already cond */
678 insn
->src2
= src1
; /* Zero */
685 static int is_in_range(pseudo_t src
, long long low
, long long high
)
692 return value
>= low
&& value
<= high
;
698 static int simplify_range(struct instruction
*insn
)
700 pseudo_t src1
, src2
, src3
;
705 if (src2
->type
!= PSEUDO_VAL
|| src3
->type
!= PSEUDO_VAL
)
707 if (is_in_range(src1
, src2
->value
, src3
->value
)) {
708 kill_instruction(insn
);
715 * Simplify "set_ne/eq $0 + br"
717 static int simplify_cond_branch(struct instruction
*br
, pseudo_t cond
, struct instruction
*def
, pseudo_t
*pp
)
719 use_pseudo(br
, *pp
, &br
->cond
);
720 remove_usage(cond
, &br
->cond
);
721 if (def
->opcode
== OP_SET_EQ
) {
722 struct basic_block
*true = br
->bb_true
;
723 struct basic_block
*false = br
->bb_false
;
730 static int simplify_branch(struct instruction
*insn
)
732 pseudo_t cond
= insn
->cond
;
737 /* Constant conditional */
738 if (constant(cond
)) {
739 insert_branch(insn
->bb
, insn
, cond
->value
? insn
->bb_true
: insn
->bb_false
);
744 if (insn
->bb_true
== insn
->bb_false
) {
745 struct basic_block
*bb
= insn
->bb
;
746 struct basic_block
*target
= insn
->bb_false
;
747 remove_bb_from_list(&target
->parents
, bb
, 1);
748 remove_bb_from_list(&bb
->children
, target
, 1);
749 insn
->bb_false
= NULL
;
750 kill_use(&insn
->cond
);
755 /* Conditional on a SETNE $0 or SETEQ $0 */
756 if (cond
->type
== PSEUDO_REG
) {
757 struct instruction
*def
= cond
->def
;
759 if (def
->opcode
== OP_SET_NE
|| def
->opcode
== OP_SET_EQ
) {
760 if (constant(def
->src1
) && !def
->src1
->value
)
761 return simplify_cond_branch(insn
, cond
, def
, &def
->src2
);
762 if (constant(def
->src2
) && !def
->src2
->value
)
763 return simplify_cond_branch(insn
, cond
, def
, &def
->src1
);
765 if (def
->opcode
== OP_SEL
) {
766 if (constant(def
->src2
) && constant(def
->src3
)) {
767 long long val1
= def
->src2
->value
;
768 long long val2
= def
->src3
->value
;
769 if (!val1
&& !val2
) {
770 insert_branch(insn
->bb
, insn
, insn
->bb_false
);
774 insert_branch(insn
->bb
, insn
, insn
->bb_true
);
778 struct basic_block
*true = insn
->bb_true
;
779 struct basic_block
*false = insn
->bb_false
;
780 insn
->bb_false
= true;
781 insn
->bb_true
= false;
783 use_pseudo(insn
, def
->src1
, &insn
->cond
);
784 remove_usage(cond
, &insn
->cond
);
788 if (def
->opcode
== OP_CAST
|| def
->opcode
== OP_SCAST
) {
789 int orig_size
= def
->orig_type
? def
->orig_type
->bit_size
: 0;
790 if (def
->size
> orig_size
) {
791 use_pseudo(insn
, def
->src
, &insn
->cond
);
792 remove_usage(cond
, &insn
->cond
);
800 static int simplify_switch(struct instruction
*insn
)
802 pseudo_t cond
= insn
->cond
;
804 struct multijmp
*jmp
;
808 val
= insn
->cond
->value
;
810 FOR_EACH_PTR(insn
->multijmp_list
, jmp
) {
812 if (jmp
->begin
> jmp
->end
)
814 if (val
>= jmp
->begin
&& val
<= jmp
->end
)
816 } END_FOR_EACH_PTR(jmp
);
817 warning(insn
->pos
, "Impossible case statement");
821 insert_branch(insn
->bb
, insn
, jmp
->target
);
825 int simplify_instruction(struct instruction
*insn
)
829 switch (insn
->opcode
) {
830 case OP_ADD
: case OP_MULS
:
831 case OP_AND
: case OP_OR
: case OP_XOR
:
832 case OP_AND_BOOL
: case OP_OR_BOOL
:
833 if (simplify_binop(insn
))
835 if (simplify_commutative_binop(insn
))
837 return simplify_associative_binop(insn
);
840 case OP_SET_EQ
: case OP_SET_NE
:
841 if (simplify_binop(insn
))
843 return simplify_commutative_binop(insn
);
846 case OP_DIVU
: case OP_DIVS
:
847 case OP_MODU
: case OP_MODS
:
849 case OP_LSR
: case OP_ASR
:
850 case OP_SET_LE
: case OP_SET_GE
:
851 case OP_SET_LT
: case OP_SET_GT
:
852 case OP_SET_B
: case OP_SET_A
:
853 case OP_SET_BE
: case OP_SET_AE
:
854 return simplify_binop(insn
);
856 case OP_NOT
: case OP_NEG
:
857 return simplify_unop(insn
);
858 case OP_LOAD
: case OP_STORE
:
859 return simplify_memop(insn
);
861 if (dead_insn(insn
, NULL
, NULL
, NULL
))
862 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
863 return replace_with_pseudo(insn
, insn
->symbol
);
868 return simplify_cast(insn
);
870 if (dead_insn(insn
, NULL
, NULL
, NULL
)) {
874 return clean_up_phi(insn
);
876 if (dead_insn(insn
, &insn
->phi_src
, NULL
, NULL
))
880 return simplify_select(insn
);
882 return simplify_branch(insn
);
884 return simplify_switch(insn
);
886 return simplify_range(insn
);