2 * Simplify - do instruction simplification before CSE
4 * Copyright (C) 2004 Linus Torvalds
10 #include "expression.h"
11 #include "linearize.h"
15 /* Find the trivial parent for a phi-source */
16 static struct basic_block
*phi_parent(struct basic_block
*source
, pseudo_t pseudo
)
18 /* Can't go upwards if the pseudo is defined in the bb it came from.. */
19 if (pseudo
->type
== PSEUDO_REG
) {
20 struct instruction
*def
= pseudo
->def
;
21 if (def
->bb
== source
)
24 if (bb_list_size(source
->children
) != 1 || bb_list_size(source
->parents
) != 1)
26 return first_basic_block(source
->parents
);
29 static int if_convert_phi(struct instruction
*insn
)
32 struct basic_block
*parents
[3];
33 struct basic_block
*bb
, *bb1
, *bb2
, *source
;
34 struct instruction
*br
;
38 if (linearize_ptr_list((struct ptr_list
*)insn
->phi_list
, (void **)array
, 3) != 2)
40 if (linearize_ptr_list((struct ptr_list
*)bb
->parents
, (void **)parents
, 3) != 2)
42 p1
= array
[0]->def
->src1
;
43 bb1
= array
[0]->def
->bb
;
44 p2
= array
[1]->def
->src1
;
45 bb2
= array
[1]->def
->bb
;
47 /* Only try the simple "direct parents" case */
48 if ((bb1
!= parents
[0] || bb2
!= parents
[1]) &&
49 (bb1
!= parents
[1] || bb2
!= parents
[0]))
53 * See if we can find a common source for this..
55 source
= phi_parent(bb1
, p1
);
56 if (source
!= phi_parent(bb2
, p2
))
60 * Cool. We now know that 'source' is the exclusive
61 * parent of both phi-nodes, so the exit at the
62 * end of it fully determines which one it is, and
63 * we can turn it into a select.
65 * HOWEVER, right now we only handle regular
66 * conditional branches. No multijumps or computed
67 * stuff. Verify that here.
69 br
= last_instruction(source
->insns
);
70 if (!br
|| br
->opcode
!= OP_CBR
)
77 * We're in business. Match up true/false with p1/p2.
79 if (br
->bb_true
== bb2
|| br
->bb_false
== bb1
) {
86 * OK, we can now replace that last
93 * select pseudo, p1, p2
96 * and remove the phi-node. If it then
97 * turns out that 'a' or 'b' is entirely
98 * empty (common case), and now no longer
99 * a phi-source, we'll be able to simplify
100 * the conditional branch too.
102 insert_select(source
, br
, insn
, p1
, p2
);
103 kill_instruction(insn
);
107 static int clean_up_phi(struct instruction
*insn
)
110 struct instruction
*last
;
115 FOR_EACH_PTR(insn
->phi_list
, phi
) {
116 struct instruction
*def
;
120 if (def
->src1
== VOID
|| !def
->bb
)
123 if (last
->src1
!= def
->src1
)
128 } END_FOR_EACH_PTR(phi
);
131 pseudo_t pseudo
= last
? last
->src1
: VOID
;
132 convert_instruction_target(insn
, pseudo
);
133 kill_instruction(insn
);
137 return if_convert_phi(insn
);
140 static int delete_pseudo_user_list_entry(struct pseudo_user_list
**list
, pseudo_t
*entry
, int count
)
142 struct pseudo_user
*pu
;
144 FOR_EACH_PTR(*list
, pu
) {
145 if (pu
->userp
== entry
) {
146 DELETE_CURRENT_PTR(pu
);
150 } END_FOR_EACH_PTR(pu
);
153 pack_ptr_list((struct ptr_list
**)list
);
157 static inline void remove_usage(pseudo_t p
, pseudo_t
*usep
)
159 if (has_use_list(p
)) {
160 delete_pseudo_user_list_entry(&p
->users
, usep
, 1);
162 kill_instruction(p
->def
);
166 void kill_use(pseudo_t
*usep
)
171 remove_usage(p
, usep
);
175 static void kill_use_list(struct pseudo_list
*list
)
178 FOR_EACH_PTR(list
, p
) {
181 kill_use(THIS_ADDRESS(p
));
182 } END_FOR_EACH_PTR(p
);
186 * kill an instruction:
187 * - remove it from its bb
188 * - remove the usage of all its operands
189 * If forse is zero, the normal case, the function only for
190 * instructions free of (possible) side-effects. Otherwise
191 * the function does that unconditionally (must only be used
192 * for unreachable instructions.
194 void kill_insn(struct instruction
*insn
, int force
)
196 if (!insn
|| !insn
->bb
)
199 switch (insn
->opcode
) {
202 kill_use(&insn
->src3
);
205 case OP_BINARY
... OP_BINCMP_END
:
206 kill_use(&insn
->src2
);
214 case OP_NOT
: case OP_NEG
:
216 kill_use(&insn
->src1
);
220 kill_use_list(insn
->phi_list
);
223 kill_use(&insn
->phi_src
);
227 repeat_phase
|= REPEAT_SYMBOL_CLEANUP
;
231 case OP_COMPUTEDGOTO
:
232 kill_use(&insn
->cond
);
237 /* a "pure" function can be killed too */
238 if (!(insn
->func
->type
== PSEUDO_SYM
))
240 if (!(insn
->func
->sym
->ctype
.modifiers
& MOD_PURE
))
243 kill_use_list(insn
->arguments
);
244 if (insn
->func
->type
== PSEUDO_REG
)
245 kill_use(&insn
->func
);
249 if (!force
&& insn
->type
->ctype
.modifiers
& MOD_VOLATILE
)
251 kill_use(&insn
->src
);
257 kill_use(&insn
->src
);
258 kill_use(&insn
->target
);
271 repeat_phase
|= REPEAT_CSE
;
276 * Kill trivially dead instructions
278 static int dead_insn(struct instruction
*insn
, pseudo_t
*src1
, pseudo_t
*src2
, pseudo_t
*src3
)
280 struct pseudo_user
*pu
;
281 FOR_EACH_PTR(insn
->target
->users
, pu
) {
282 if (*pu
->userp
!= VOID
)
284 } END_FOR_EACH_PTR(pu
);
293 static inline int constant(pseudo_t pseudo
)
295 return pseudo
->type
== PSEUDO_VAL
;
298 static int replace_with_pseudo(struct instruction
*insn
, pseudo_t pseudo
)
300 convert_instruction_target(insn
, pseudo
);
302 switch (insn
->opcode
) {
305 kill_use(&insn
->src3
);
306 case OP_BINARY
... OP_BINCMP_END
:
307 kill_use(&insn
->src2
);
315 kill_use(&insn
->src1
);
325 static unsigned int value_size(long long value
)
340 * Try to determine the maximum size of bits in a pseudo.
342 * Right now this only follow casts and constant values, but we
343 * could look at things like logical 'and' instructions etc.
345 static unsigned int operand_size(struct instruction
*insn
, pseudo_t pseudo
)
347 unsigned int size
= insn
->size
;
349 if (pseudo
->type
== PSEUDO_REG
) {
350 struct instruction
*src
= pseudo
->def
;
351 if (src
&& src
->opcode
== OP_CAST
&& src
->orig_type
) {
352 unsigned int orig_size
= src
->orig_type
->bit_size
;
353 if (orig_size
< size
)
357 if (pseudo
->type
== PSEUDO_VAL
) {
358 unsigned int orig_size
= value_size(pseudo
->value
);
359 if (orig_size
< size
)
365 static int simplify_asr(struct instruction
*insn
, pseudo_t pseudo
, long long value
)
367 unsigned int size
= operand_size(insn
, pseudo
);
370 warning(insn
->pos
, "right shift by bigger than source value");
371 return replace_with_pseudo(insn
, value_pseudo(0));
374 return replace_with_pseudo(insn
, pseudo
);
378 static int simplify_mul_div(struct instruction
*insn
, long long value
)
380 unsigned long long sbit
= 1ULL << (insn
->size
- 1);
381 unsigned long long bits
= sbit
| (sbit
- 1);
384 return replace_with_pseudo(insn
, insn
->src1
);
386 switch (insn
->opcode
) {
390 return replace_with_pseudo(insn
, insn
->src2
);
393 if (!(value
& sbit
)) // positive
398 insn
->opcode
= OP_NEG
;
406 static int compare_opcode(int opcode
, int inverse
)
412 case OP_SET_EQ
: return OP_SET_NE
;
413 case OP_SET_NE
: return OP_SET_EQ
;
415 case OP_SET_LT
: return OP_SET_GE
;
416 case OP_SET_LE
: return OP_SET_GT
;
417 case OP_SET_GT
: return OP_SET_LE
;
418 case OP_SET_GE
: return OP_SET_LT
;
420 case OP_SET_A
: return OP_SET_BE
;
421 case OP_SET_AE
: return OP_SET_B
;
422 case OP_SET_B
: return OP_SET_AE
;
423 case OP_SET_BE
: return OP_SET_A
;
430 static int simplify_seteq_setne(struct instruction
*insn
, long long value
)
432 pseudo_t old
= insn
->src1
;
433 struct instruction
*def
= old
->def
;
438 if (value
!= 0 && value
!= 1)
444 inverse
= (insn
->opcode
== OP_SET_NE
) == value
;
445 opcode
= def
->opcode
;
447 case OP_BINCMP
... OP_BINCMP_END
:
449 // setcc.n %t <- %a, %b
450 // setne.m %r <- %t, $0
452 // setcc.n %t <- %a, %b
453 // setcc.m %r <- %a, $b
454 // and similar for setne/eq ... 0/1
457 insn
->opcode
= compare_opcode(opcode
, inverse
);
458 use_pseudo(insn
, src1
, &insn
->src1
);
459 use_pseudo(insn
, src2
, &insn
->src2
);
460 remove_usage(old
, &insn
->src1
);
468 static int simplify_constant_rightside(struct instruction
*insn
)
470 long long value
= insn
->src2
->value
;
472 switch (insn
->opcode
) {
475 return replace_with_pseudo(insn
, insn
->src2
);
476 goto case_neutral_zero
;
480 insn
->opcode
= OP_ADD
;
481 insn
->src2
= value_pseudo(-value
);
486 case OP_OR
: case OP_XOR
:
491 return replace_with_pseudo(insn
, insn
->src1
);
494 return simplify_asr(insn
, insn
->src1
, value
);
496 case OP_MODU
: case OP_MODS
:
498 return replace_with_pseudo(insn
, value_pseudo(0));
501 case OP_DIVU
: case OP_DIVS
:
502 case OP_MULU
: case OP_MULS
:
503 return simplify_mul_div(insn
, value
);
507 return replace_with_pseudo(insn
, insn
->src1
);
511 return replace_with_pseudo(insn
, insn
->src2
);
516 return simplify_seteq_setne(insn
, value
);
521 static int simplify_constant_leftside(struct instruction
*insn
)
523 long long value
= insn
->src1
->value
;
525 switch (insn
->opcode
) {
526 case OP_ADD
: case OP_OR
: case OP_XOR
:
528 return replace_with_pseudo(insn
, insn
->src2
);
532 case OP_LSR
: case OP_ASR
:
534 case OP_MULU
: case OP_MULS
:
536 return replace_with_pseudo(insn
, insn
->src1
);
542 static int simplify_constant_binop(struct instruction
*insn
)
544 /* FIXME! Verify signs and sizes!! */
545 long long left
= insn
->src1
->value
;
546 long long right
= insn
->src2
->value
;
547 unsigned long long ul
, ur
;
548 long long res
, mask
, bits
;
550 mask
= 1ULL << (insn
->size
-1);
551 bits
= mask
| (mask
-1);
560 switch (insn
->opcode
) {
581 if (left
== mask
&& right
== -1)
593 if (left
== mask
&& right
== -1)
623 /* Binary comparison */
659 replace_with_pseudo(insn
, value_pseudo(res
));
663 static int simplify_binop_same_args(struct instruction
*insn
, pseudo_t arg
)
665 switch (insn
->opcode
) {
667 case OP_SET_LT
: case OP_SET_GT
:
668 case OP_SET_B
: case OP_SET_A
:
669 if (Wtautological_compare
)
670 warning(insn
->pos
, "self-comparison always evaluates to false");
673 return replace_with_pseudo(insn
, value_pseudo(0));
676 case OP_SET_LE
: case OP_SET_GE
:
677 case OP_SET_BE
: case OP_SET_AE
:
678 if (Wtautological_compare
)
679 warning(insn
->pos
, "self-comparison always evaluates to true");
680 return replace_with_pseudo(insn
, value_pseudo(1));
684 return replace_with_pseudo(insn
, arg
);
688 remove_usage(arg
, &insn
->src2
);
689 insn
->src2
= value_pseudo(0);
690 insn
->opcode
= OP_SET_NE
;
700 static int simplify_binop(struct instruction
*insn
)
702 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, NULL
))
704 if (constant(insn
->src1
)) {
705 if (constant(insn
->src2
))
706 return simplify_constant_binop(insn
);
707 return simplify_constant_leftside(insn
);
709 if (constant(insn
->src2
))
710 return simplify_constant_rightside(insn
);
711 if (insn
->src1
== insn
->src2
)
712 return simplify_binop_same_args(insn
, insn
->src1
);
716 static void switch_pseudo(struct instruction
*insn1
, pseudo_t
*pp1
, struct instruction
*insn2
, pseudo_t
*pp2
)
718 pseudo_t p1
= *pp1
, p2
= *pp2
;
720 use_pseudo(insn1
, p2
, pp1
);
721 use_pseudo(insn2
, p1
, pp2
);
722 remove_usage(p1
, pp1
);
723 remove_usage(p2
, pp2
);
726 static int canonical_order(pseudo_t p1
, pseudo_t p2
)
728 /* symbol/constants on the right */
729 if (p1
->type
== PSEUDO_VAL
)
730 return p2
->type
== PSEUDO_VAL
;
732 if (p1
->type
== PSEUDO_SYM
)
733 return p2
->type
== PSEUDO_SYM
|| p2
->type
== PSEUDO_VAL
;
738 static int simplify_commutative_binop(struct instruction
*insn
)
740 if (!canonical_order(insn
->src1
, insn
->src2
)) {
741 switch_pseudo(insn
, &insn
->src1
, insn
, &insn
->src2
);
747 static inline int simple_pseudo(pseudo_t pseudo
)
749 return pseudo
->type
== PSEUDO_VAL
|| pseudo
->type
== PSEUDO_SYM
;
752 static int simplify_associative_binop(struct instruction
*insn
)
754 struct instruction
*def
;
755 pseudo_t pseudo
= insn
->src1
;
757 if (!simple_pseudo(insn
->src2
))
759 if (pseudo
->type
!= PSEUDO_REG
)
764 if (def
->opcode
!= insn
->opcode
)
766 if (!simple_pseudo(def
->src2
))
768 if (ptr_list_size((struct ptr_list
*)def
->target
->users
) != 1)
770 switch_pseudo(def
, &def
->src1
, insn
, &insn
->src2
);
774 static int simplify_constant_unop(struct instruction
*insn
)
776 long long val
= insn
->src1
->value
;
779 switch (insn
->opcode
) {
789 mask
= 1ULL << (insn
->size
-1);
790 res
&= mask
| (mask
-1);
792 replace_with_pseudo(insn
, value_pseudo(res
));
796 static int simplify_unop(struct instruction
*insn
)
798 if (dead_insn(insn
, &insn
->src1
, NULL
, NULL
))
800 if (constant(insn
->src1
))
801 return simplify_constant_unop(insn
);
803 switch (insn
->opcode
) {
804 struct instruction
*def
;
807 def
= insn
->src
->def
;
808 if (def
&& def
->opcode
== OP_NOT
)
809 return replace_with_pseudo(insn
, def
->src
);
812 def
= insn
->src
->def
;
813 if (def
&& def
->opcode
== OP_NEG
)
814 return replace_with_pseudo(insn
, def
->src
);
822 static int simplify_one_memop(struct instruction
*insn
, pseudo_t orig
)
824 pseudo_t addr
= insn
->src
;
827 if (addr
->type
== PSEUDO_REG
) {
828 struct instruction
*def
= addr
->def
;
829 if (def
->opcode
== OP_SYMADDR
&& def
->src
) {
830 kill_use(&insn
->src
);
831 use_pseudo(insn
, def
->src
, &insn
->src
);
832 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
834 if (def
->opcode
== OP_ADD
) {
854 warning(insn
->pos
, "crazy programmer");
856 insn
->offset
+= off
->value
;
857 use_pseudo(insn
, new, &insn
->src
);
858 remove_usage(addr
, &insn
->src
);
859 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
863 * We walk the whole chain of adds/subs backwards. That's not
864 * only more efficient, but it allows us to find loops.
866 static int simplify_memop(struct instruction
*insn
)
869 pseudo_t orig
= insn
->src
;
872 one
= simplify_one_memop(insn
, orig
);
878 static long long get_cast_value(long long val
, int old_size
, int new_size
, int sign
)
882 if (sign
&& new_size
> old_size
) {
883 mask
= 1 << (old_size
-1);
885 val
|= ~(mask
| (mask
-1));
887 mask
= 1 << (new_size
-1);
888 return val
& (mask
| (mask
-1));
891 static int simplify_cast(struct instruction
*insn
)
893 struct symbol
*orig_type
;
897 if (dead_insn(insn
, &insn
->src
, NULL
, NULL
))
900 orig_type
= insn
->orig_type
;
904 /* Keep casts with pointer on either side (not only case of OP_PTRCAST) */
905 if (is_ptr_type(orig_type
) || is_ptr_type(insn
->type
))
908 orig_size
= orig_type
->bit_size
;
912 /* A cast of a constant? */
914 int sign
= orig_type
->ctype
.modifiers
& MOD_SIGNED
;
915 long long val
= get_cast_value(src
->value
, orig_size
, size
, sign
);
916 src
= value_pseudo(val
);
920 /* A cast of a "and" might be a no-op.. */
921 if (src
->type
== PSEUDO_REG
) {
922 struct instruction
*def
= src
->def
;
923 if (def
->opcode
== OP_AND
&& def
->size
>= size
) {
924 pseudo_t val
= def
->src2
;
925 if (val
->type
== PSEUDO_VAL
) {
926 unsigned long long value
= val
->value
;
927 if (!(value
>> (size
-1)))
933 if (size
== orig_size
) {
934 int op
= (orig_type
->ctype
.modifiers
& MOD_SIGNED
) ? OP_SCAST
: OP_CAST
;
935 if (insn
->opcode
== op
)
937 if (insn
->opcode
== OP_FPCAST
&& is_float_type(orig_type
))
944 return replace_with_pseudo(insn
, src
);
947 static int simplify_select(struct instruction
*insn
)
949 pseudo_t cond
, src1
, src2
;
951 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, &insn
->src3
))
957 if (constant(cond
) || src1
== src2
) {
958 pseudo_t
*kill
, take
;
959 kill_use(&insn
->src1
);
960 take
= cond
->value
? src1
: src2
;
961 kill
= cond
->value
? &insn
->src3
: &insn
->src2
;
963 replace_with_pseudo(insn
, take
);
966 if (constant(src1
) && constant(src2
)) {
967 long long val1
= src1
->value
;
968 long long val2
= src2
->value
;
970 /* The pair 0/1 is special - replace with SETNE/SETEQ */
971 if ((val1
| val2
) == 1) {
972 int opcode
= OP_SET_EQ
;
977 insn
->opcode
= opcode
;
978 /* insn->src1 is already cond */
979 insn
->src2
= src1
; /* Zero */
986 static int is_in_range(pseudo_t src
, long long low
, long long high
)
993 return value
>= low
&& value
<= high
;
999 static int simplify_range(struct instruction
*insn
)
1001 pseudo_t src1
, src2
, src3
;
1006 if (src2
->type
!= PSEUDO_VAL
|| src3
->type
!= PSEUDO_VAL
)
1008 if (is_in_range(src1
, src2
->value
, src3
->value
)) {
1009 kill_instruction(insn
);
1016 * Simplify "set_ne/eq $0 + br"
1018 static int simplify_cond_branch(struct instruction
*br
, pseudo_t cond
, struct instruction
*def
, pseudo_t
*pp
)
1020 use_pseudo(br
, *pp
, &br
->cond
);
1021 remove_usage(cond
, &br
->cond
);
1022 if (def
->opcode
== OP_SET_EQ
) {
1023 struct basic_block
*true = br
->bb_true
;
1024 struct basic_block
*false = br
->bb_false
;
1025 br
->bb_false
= true;
1026 br
->bb_true
= false;
1031 static int simplify_branch(struct instruction
*insn
)
1033 pseudo_t cond
= insn
->cond
;
1035 /* Constant conditional */
1036 if (constant(cond
)) {
1037 insert_branch(insn
->bb
, insn
, cond
->value
? insn
->bb_true
: insn
->bb_false
);
1042 if (insn
->bb_true
== insn
->bb_false
) {
1043 struct basic_block
*bb
= insn
->bb
;
1044 struct basic_block
*target
= insn
->bb_false
;
1045 remove_bb_from_list(&target
->parents
, bb
, 1);
1046 remove_bb_from_list(&bb
->children
, target
, 1);
1047 insn
->bb_false
= NULL
;
1048 kill_use(&insn
->cond
);
1050 insn
->opcode
= OP_BR
;
1054 /* Conditional on a SETNE $0 or SETEQ $0 */
1055 if (cond
->type
== PSEUDO_REG
) {
1056 struct instruction
*def
= cond
->def
;
1058 if (def
->opcode
== OP_SET_NE
|| def
->opcode
== OP_SET_EQ
) {
1059 if (constant(def
->src1
) && !def
->src1
->value
)
1060 return simplify_cond_branch(insn
, cond
, def
, &def
->src2
);
1061 if (constant(def
->src2
) && !def
->src2
->value
)
1062 return simplify_cond_branch(insn
, cond
, def
, &def
->src1
);
1064 if (def
->opcode
== OP_SEL
) {
1065 if (constant(def
->src2
) && constant(def
->src3
)) {
1066 long long val1
= def
->src2
->value
;
1067 long long val2
= def
->src3
->value
;
1068 if (!val1
&& !val2
) {
1069 insert_branch(insn
->bb
, insn
, insn
->bb_false
);
1073 insert_branch(insn
->bb
, insn
, insn
->bb_true
);
1077 struct basic_block
*true = insn
->bb_true
;
1078 struct basic_block
*false = insn
->bb_false
;
1079 insn
->bb_false
= true;
1080 insn
->bb_true
= false;
1082 use_pseudo(insn
, def
->src1
, &insn
->cond
);
1083 remove_usage(cond
, &insn
->cond
);
1087 if (def
->opcode
== OP_CAST
|| def
->opcode
== OP_SCAST
) {
1088 int orig_size
= def
->orig_type
? def
->orig_type
->bit_size
: 0;
1089 if (def
->size
> orig_size
) {
1090 use_pseudo(insn
, def
->src
, &insn
->cond
);
1091 remove_usage(cond
, &insn
->cond
);
1099 static int simplify_switch(struct instruction
*insn
)
1101 pseudo_t cond
= insn
->cond
;
1103 struct multijmp
*jmp
;
1105 if (!constant(cond
))
1107 val
= insn
->cond
->value
;
1109 FOR_EACH_PTR(insn
->multijmp_list
, jmp
) {
1111 if (jmp
->begin
> jmp
->end
)
1113 if (val
>= jmp
->begin
&& val
<= jmp
->end
)
1115 } END_FOR_EACH_PTR(jmp
);
1116 warning(insn
->pos
, "Impossible case statement");
1120 insert_branch(insn
->bb
, insn
, jmp
->target
);
1124 int simplify_instruction(struct instruction
*insn
)
1128 switch (insn
->opcode
) {
1129 case OP_ADD
: case OP_MULS
:
1130 case OP_AND
: case OP_OR
: case OP_XOR
:
1131 case OP_AND_BOOL
: case OP_OR_BOOL
:
1132 if (simplify_binop(insn
))
1134 if (simplify_commutative_binop(insn
))
1136 return simplify_associative_binop(insn
);
1139 case OP_SET_EQ
: case OP_SET_NE
:
1140 if (simplify_binop(insn
))
1142 return simplify_commutative_binop(insn
);
1145 case OP_DIVU
: case OP_DIVS
:
1146 case OP_MODU
: case OP_MODS
:
1148 case OP_LSR
: case OP_ASR
:
1149 case OP_SET_LE
: case OP_SET_GE
:
1150 case OP_SET_LT
: case OP_SET_GT
:
1151 case OP_SET_B
: case OP_SET_A
:
1152 case OP_SET_BE
: case OP_SET_AE
:
1153 return simplify_binop(insn
);
1155 case OP_NOT
: case OP_NEG
:
1156 return simplify_unop(insn
);
1157 case OP_LOAD
: case OP_STORE
:
1158 return simplify_memop(insn
);
1160 if (dead_insn(insn
, NULL
, NULL
, NULL
))
1161 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
1162 return replace_with_pseudo(insn
, insn
->symbol
);
1167 return simplify_cast(insn
);
1169 if (dead_insn(insn
, NULL
, NULL
, NULL
)) {
1170 kill_use_list(insn
->phi_list
);
1173 return clean_up_phi(insn
);
1175 if (dead_insn(insn
, &insn
->phi_src
, NULL
, NULL
))
1179 return simplify_select(insn
);
1181 return simplify_branch(insn
);
1183 return simplify_switch(insn
);
1185 return simplify_range(insn
);