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 static 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
);
222 repeat_phase
|= REPEAT_CSE
;
224 kill_use(&insn
->cond
);
230 * Kill trivially dead instructions
232 static int dead_insn(struct instruction
*insn
, pseudo_t
*src1
, pseudo_t
*src2
, pseudo_t
*src3
)
234 struct pseudo_user
*pu
;
235 FOR_EACH_PTR(insn
->target
->users
, pu
) {
236 if (*pu
->userp
!= VOID
)
238 } END_FOR_EACH_PTR(pu
);
247 static inline int constant(pseudo_t pseudo
)
249 return pseudo
->type
== PSEUDO_VAL
;
252 static int replace_with_pseudo(struct instruction
*insn
, pseudo_t pseudo
)
254 convert_instruction_target(insn
, pseudo
);
259 static unsigned int value_size(long long value
)
274 * Try to determine the maximum size of bits in a pseudo.
276 * Right now this only follow casts and constant values, but we
277 * could look at things like logical 'and' instructions etc.
279 static unsigned int operand_size(struct instruction
*insn
, pseudo_t pseudo
)
281 unsigned int size
= insn
->size
;
283 if (pseudo
->type
== PSEUDO_REG
) {
284 struct instruction
*src
= pseudo
->def
;
285 if (src
&& src
->opcode
== OP_CAST
&& src
->orig_type
) {
286 unsigned int orig_size
= src
->orig_type
->bit_size
;
287 if (orig_size
< size
)
291 if (pseudo
->type
== PSEUDO_VAL
) {
292 unsigned int orig_size
= value_size(pseudo
->value
);
293 if (orig_size
< size
)
299 static int simplify_asr(struct instruction
*insn
, pseudo_t pseudo
, long long value
)
301 unsigned int size
= operand_size(insn
, pseudo
);
304 warning(insn
->pos
, "right shift by bigger than source value");
305 return replace_with_pseudo(insn
, value_pseudo(0));
308 return replace_with_pseudo(insn
, pseudo
);
312 static int simplify_constant_rightside(struct instruction
*insn
)
314 long long value
= insn
->src2
->value
;
316 switch (insn
->opcode
) {
319 insn
->opcode
= OP_ADD
;
320 insn
->src2
= value_pseudo(-value
);
325 case OP_OR
: case OP_XOR
:
330 return replace_with_pseudo(insn
, insn
->src1
);
333 return simplify_asr(insn
, insn
->src1
, value
);
335 case OP_MULU
: case OP_MULS
:
338 return replace_with_pseudo(insn
, insn
->src1
);
342 return replace_with_pseudo(insn
, insn
->src2
);
348 static int simplify_constant_leftside(struct instruction
*insn
)
350 long long value
= insn
->src1
->value
;
352 switch (insn
->opcode
) {
353 case OP_ADD
: case OP_OR
: case OP_XOR
:
355 return replace_with_pseudo(insn
, insn
->src2
);
359 case OP_LSR
: case OP_ASR
:
361 case OP_MULU
: case OP_MULS
:
363 return replace_with_pseudo(insn
, insn
->src1
);
369 static int simplify_constant_binop(struct instruction
*insn
)
371 /* FIXME! Verify signs and sizes!! */
372 long long left
= insn
->src1
->value
;
373 long long right
= insn
->src2
->value
;
374 unsigned long long ul
, ur
;
375 long long res
, mask
, bits
;
377 mask
= 1ULL << (insn
->size
-1);
378 bits
= mask
| (mask
-1);
387 switch (insn
->opcode
) {
446 /* Binary comparison */
482 replace_with_pseudo(insn
, value_pseudo(res
));
486 static int simplify_binop(struct instruction
*insn
)
488 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, NULL
))
490 if (constant(insn
->src1
)) {
491 if (constant(insn
->src2
))
492 return simplify_constant_binop(insn
);
493 return simplify_constant_leftside(insn
);
495 if (constant(insn
->src2
))
496 return simplify_constant_rightside(insn
);
500 static void switch_pseudo(struct instruction
*insn1
, pseudo_t
*pp1
, struct instruction
*insn2
, pseudo_t
*pp2
)
502 pseudo_t p1
= *pp1
, p2
= *pp2
;
504 use_pseudo(insn1
, p2
, pp1
);
505 use_pseudo(insn2
, p1
, pp2
);
506 remove_usage(p1
, pp1
);
507 remove_usage(p2
, pp2
);
510 static int canonical_order(pseudo_t p1
, pseudo_t p2
)
512 /* symbol/constants on the right */
513 if (p1
->type
== PSEUDO_VAL
)
514 return p2
->type
== PSEUDO_VAL
;
516 if (p1
->type
== PSEUDO_SYM
)
517 return p2
->type
== PSEUDO_SYM
|| p2
->type
== PSEUDO_VAL
;
522 static int simplify_commutative_binop(struct instruction
*insn
)
524 if (!canonical_order(insn
->src1
, insn
->src2
)) {
525 switch_pseudo(insn
, &insn
->src1
, insn
, &insn
->src2
);
531 static inline int simple_pseudo(pseudo_t pseudo
)
533 return pseudo
->type
== PSEUDO_VAL
|| pseudo
->type
== PSEUDO_SYM
;
536 static int simplify_associative_binop(struct instruction
*insn
)
538 struct instruction
*def
;
539 pseudo_t pseudo
= insn
->src1
;
541 if (!simple_pseudo(insn
->src2
))
543 if (pseudo
->type
!= PSEUDO_REG
)
548 if (def
->opcode
!= insn
->opcode
)
550 if (!simple_pseudo(def
->src2
))
552 if (ptr_list_size((struct ptr_list
*)def
->target
->users
) != 1)
554 switch_pseudo(def
, &def
->src1
, insn
, &insn
->src2
);
558 static int simplify_constant_unop(struct instruction
*insn
)
560 long long val
= insn
->src1
->value
;
563 switch (insn
->opcode
) {
573 mask
= 1ULL << (insn
->size
-1);
574 res
&= mask
| (mask
-1);
576 replace_with_pseudo(insn
, value_pseudo(res
));
580 static int simplify_unop(struct instruction
*insn
)
582 if (dead_insn(insn
, &insn
->src1
, NULL
, NULL
))
584 if (constant(insn
->src1
))
585 return simplify_constant_unop(insn
);
589 static int simplify_one_memop(struct instruction
*insn
, pseudo_t orig
)
591 pseudo_t addr
= insn
->src
;
594 if (addr
->type
== PSEUDO_REG
) {
595 struct instruction
*def
= addr
->def
;
596 if (def
->opcode
== OP_SYMADDR
&& def
->src
) {
597 kill_use(&insn
->src
);
598 use_pseudo(insn
, def
->src
, &insn
->src
);
599 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
601 if (def
->opcode
== OP_ADD
) {
621 warning(insn
->pos
, "crazy programmer");
623 insn
->offset
+= off
->value
;
624 use_pseudo(insn
, new, &insn
->src
);
625 remove_usage(addr
, &insn
->src
);
626 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
630 * We walk the whole chain of adds/subs backwards. That's not
631 * only more efficient, but it allows us to find loops.
633 static int simplify_memop(struct instruction
*insn
)
636 pseudo_t orig
= insn
->src
;
639 one
= simplify_one_memop(insn
, orig
);
645 static long long get_cast_value(long long val
, int old_size
, int new_size
, int sign
)
649 if (sign
&& new_size
> old_size
) {
650 mask
= 1 << (old_size
-1);
652 val
|= ~(mask
| (mask
-1));
654 mask
= 1 << (new_size
-1);
655 return val
& (mask
| (mask
-1));
658 static int simplify_cast(struct instruction
*insn
)
660 struct symbol
*orig_type
;
664 if (dead_insn(insn
, &insn
->src
, NULL
, NULL
))
667 orig_type
= insn
->orig_type
;
670 orig_size
= orig_type
->bit_size
;
674 /* A cast of a constant? */
676 int sign
= orig_type
->ctype
.modifiers
& MOD_SIGNED
;
677 long long val
= get_cast_value(src
->value
, orig_size
, size
, sign
);
678 src
= value_pseudo(val
);
682 /* A cast of a "and" might be a no-op.. */
683 if (src
->type
== PSEUDO_REG
) {
684 struct instruction
*def
= src
->def
;
685 if (def
->opcode
== OP_AND
&& def
->size
>= size
) {
686 pseudo_t val
= def
->src2
;
687 if (val
->type
== PSEUDO_VAL
) {
688 unsigned long long value
= val
->value
;
689 if (!(value
>> (size
-1)))
695 if (size
== orig_size
) {
696 int op
= (orig_type
->ctype
.modifiers
& MOD_SIGNED
) ? OP_SCAST
: OP_CAST
;
697 if (insn
->opcode
== op
)
704 return replace_with_pseudo(insn
, src
);
707 static int simplify_select(struct instruction
*insn
)
709 pseudo_t cond
, src1
, src2
;
711 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, &insn
->src3
))
717 if (constant(cond
) || src1
== src2
) {
718 pseudo_t
*kill
, take
;
719 kill_use(&insn
->src1
);
720 take
= cond
->value
? src1
: src2
;
721 kill
= cond
->value
? &insn
->src3
: &insn
->src2
;
723 replace_with_pseudo(insn
, take
);
726 if (constant(src1
) && constant(src2
)) {
727 long long val1
= src1
->value
;
728 long long val2
= src2
->value
;
730 /* The pair 0/1 is special - replace with SETNE/SETEQ */
731 if ((val1
| val2
) == 1) {
732 int opcode
= OP_SET_EQ
;
737 insn
->opcode
= opcode
;
738 /* insn->src1 is already cond */
739 insn
->src2
= src1
; /* Zero */
746 static int is_in_range(pseudo_t src
, long long low
, long long high
)
753 return value
>= low
&& value
<= high
;
759 static int simplify_range(struct instruction
*insn
)
761 pseudo_t src1
, src2
, src3
;
766 if (src2
->type
!= PSEUDO_VAL
|| src3
->type
!= PSEUDO_VAL
)
768 if (is_in_range(src1
, src2
->value
, src3
->value
)) {
769 kill_instruction(insn
);
776 * Simplify "set_ne/eq $0 + br"
778 static int simplify_cond_branch(struct instruction
*br
, pseudo_t cond
, struct instruction
*def
, pseudo_t
*pp
)
780 use_pseudo(br
, *pp
, &br
->cond
);
781 remove_usage(cond
, &br
->cond
);
782 if (def
->opcode
== OP_SET_EQ
) {
783 struct basic_block
*true = br
->bb_true
;
784 struct basic_block
*false = br
->bb_false
;
791 static int simplify_branch(struct instruction
*insn
)
793 pseudo_t cond
= insn
->cond
;
798 /* Constant conditional */
799 if (constant(cond
)) {
800 insert_branch(insn
->bb
, insn
, cond
->value
? insn
->bb_true
: insn
->bb_false
);
805 if (insn
->bb_true
== insn
->bb_false
) {
806 struct basic_block
*bb
= insn
->bb
;
807 struct basic_block
*target
= insn
->bb_false
;
808 remove_bb_from_list(&target
->parents
, bb
, 1);
809 remove_bb_from_list(&bb
->children
, target
, 1);
810 insn
->bb_false
= NULL
;
811 kill_use(&insn
->cond
);
816 /* Conditional on a SETNE $0 or SETEQ $0 */
817 if (cond
->type
== PSEUDO_REG
) {
818 struct instruction
*def
= cond
->def
;
820 if (def
->opcode
== OP_SET_NE
|| def
->opcode
== OP_SET_EQ
) {
821 if (constant(def
->src1
) && !def
->src1
->value
)
822 return simplify_cond_branch(insn
, cond
, def
, &def
->src2
);
823 if (constant(def
->src2
) && !def
->src2
->value
)
824 return simplify_cond_branch(insn
, cond
, def
, &def
->src1
);
826 if (def
->opcode
== OP_SEL
) {
827 if (constant(def
->src2
) && constant(def
->src3
)) {
828 long long val1
= def
->src2
->value
;
829 long long val2
= def
->src3
->value
;
830 if (!val1
&& !val2
) {
831 insert_branch(insn
->bb
, insn
, insn
->bb_false
);
835 insert_branch(insn
->bb
, insn
, insn
->bb_true
);
839 struct basic_block
*true = insn
->bb_true
;
840 struct basic_block
*false = insn
->bb_false
;
841 insn
->bb_false
= true;
842 insn
->bb_true
= false;
844 use_pseudo(insn
, def
->src1
, &insn
->cond
);
845 remove_usage(cond
, &insn
->cond
);
849 if (def
->opcode
== OP_CAST
|| def
->opcode
== OP_SCAST
) {
850 int orig_size
= def
->orig_type
? def
->orig_type
->bit_size
: 0;
851 if (def
->size
> orig_size
) {
852 use_pseudo(insn
, def
->src
, &insn
->cond
);
853 remove_usage(cond
, &insn
->cond
);
861 static int simplify_switch(struct instruction
*insn
)
863 pseudo_t cond
= insn
->cond
;
865 struct multijmp
*jmp
;
869 val
= insn
->cond
->value
;
871 FOR_EACH_PTR(insn
->multijmp_list
, jmp
) {
873 if (jmp
->begin
> jmp
->end
)
875 if (val
>= jmp
->begin
&& val
<= jmp
->end
)
877 } END_FOR_EACH_PTR(jmp
);
878 warning(insn
->pos
, "Impossible case statement");
882 insert_branch(insn
->bb
, insn
, jmp
->target
);
886 int simplify_instruction(struct instruction
*insn
)
890 switch (insn
->opcode
) {
891 case OP_ADD
: case OP_MULS
:
892 case OP_AND
: case OP_OR
: case OP_XOR
:
893 case OP_AND_BOOL
: case OP_OR_BOOL
:
894 if (simplify_binop(insn
))
896 if (simplify_commutative_binop(insn
))
898 return simplify_associative_binop(insn
);
901 case OP_SET_EQ
: case OP_SET_NE
:
902 if (simplify_binop(insn
))
904 return simplify_commutative_binop(insn
);
907 case OP_DIVU
: case OP_DIVS
:
908 case OP_MODU
: case OP_MODS
:
910 case OP_LSR
: case OP_ASR
:
911 case OP_SET_LE
: case OP_SET_GE
:
912 case OP_SET_LT
: case OP_SET_GT
:
913 case OP_SET_B
: case OP_SET_A
:
914 case OP_SET_BE
: case OP_SET_AE
:
915 return simplify_binop(insn
);
917 case OP_NOT
: case OP_NEG
:
918 return simplify_unop(insn
);
919 case OP_LOAD
: case OP_STORE
:
920 return simplify_memop(insn
);
922 if (dead_insn(insn
, NULL
, NULL
, NULL
))
923 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
924 return replace_with_pseudo(insn
, insn
->symbol
);
929 return simplify_cast(insn
);
931 if (dead_insn(insn
, NULL
, NULL
, NULL
)) {
935 return clean_up_phi(insn
);
937 if (dead_insn(insn
, &insn
->phi_src
, NULL
, NULL
))
941 return simplify_select(insn
);
943 return simplify_branch(insn
);
945 return simplify_switch(insn
);
947 return simplify_range(insn
);