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 void clear_phi(struct instruction
*insn
)
34 FOR_EACH_PTR(insn
->phi_list
, phi
) {
35 *THIS_ADDRESS(phi
) = VOID
;
36 } END_FOR_EACH_PTR(phi
);
39 static int if_convert_phi(struct instruction
*insn
)
42 struct basic_block
*parents
[3];
43 struct basic_block
*bb
, *bb1
, *bb2
, *source
;
44 struct instruction
*br
;
48 if (linearize_ptr_list((struct ptr_list
*)insn
->phi_list
, (void **)array
, 3) != 2)
50 if (linearize_ptr_list((struct ptr_list
*)bb
->parents
, (void **)parents
, 3) != 2)
52 p1
= array
[0]->def
->src1
;
53 bb1
= array
[0]->def
->bb
;
54 p2
= array
[1]->def
->src1
;
55 bb2
= array
[1]->def
->bb
;
57 /* Only try the simple "direct parents" case */
58 if ((bb1
!= parents
[0] || bb2
!= parents
[1]) &&
59 (bb1
!= parents
[1] || bb2
!= parents
[0]))
63 * See if we can find a common source for this..
65 source
= phi_parent(bb1
, p1
);
66 if (source
!= phi_parent(bb2
, p2
))
70 * Cool. We now know that 'source' is the exclusive
71 * parent of both phi-nodes, so the exit at the
72 * end of it fully determines which one it is, and
73 * we can turn it into a select.
75 * HOWEVER, right now we only handle regular
76 * conditional branches. No multijumps or computed
77 * stuff. Verify that here.
79 br
= last_instruction(source
->insns
);
80 if (!br
|| br
->opcode
!= OP_BR
)
87 * We're in business. Match up true/false with p1/p2.
89 if (br
->bb_true
== bb2
|| br
->bb_false
== bb1
) {
96 * OK, we can now replace that last
103 * select pseudo, p1, p2
106 * and remove the phi-node. If it then
107 * turns out that 'a' or 'b' is entirely
108 * empty (common case), and now no longer
109 * a phi-source, we'll be able to simplify
110 * the conditional branch too.
112 insert_select(source
, br
, insn
, p1
, p2
);
113 kill_instruction(insn
);
117 static int clean_up_phi(struct instruction
*insn
)
120 struct instruction
*last
;
125 FOR_EACH_PTR(insn
->phi_list
, phi
) {
126 struct instruction
*def
;
130 if (def
->src1
== VOID
|| !def
->bb
)
133 if (last
->src1
!= def
->src1
)
138 } END_FOR_EACH_PTR(phi
);
141 pseudo_t pseudo
= last
? last
->src1
: VOID
;
142 convert_instruction_target(insn
, pseudo
);
143 kill_instruction(insn
);
147 return if_convert_phi(insn
);
150 static int delete_pseudo_user_list_entry(struct pseudo_user_list
**list
, pseudo_t
*entry
, int count
)
152 struct pseudo_user
*pu
;
154 FOR_EACH_PTR(*list
, pu
) {
155 if (pu
->userp
== entry
) {
156 DELETE_CURRENT_PTR(pu
);
160 } END_FOR_EACH_PTR(pu
);
163 pack_ptr_list((struct ptr_list
**)list
);
167 static inline void remove_usage(pseudo_t p
, pseudo_t
*usep
)
169 if (has_use_list(p
)) {
170 delete_pseudo_user_list_entry(&p
->users
, usep
, 1);
172 kill_instruction(p
->def
);
176 void kill_use(pseudo_t
*usep
)
181 remove_usage(p
, usep
);
185 static void kill_use_list(struct pseudo_list
*list
)
188 FOR_EACH_PTR(list
, p
) {
191 kill_use(THIS_ADDRESS(p
));
192 } END_FOR_EACH_PTR(p
);
195 void kill_instruction(struct instruction
*insn
)
197 if (!insn
|| !insn
->bb
)
200 switch (insn
->opcode
) {
203 kill_use(&insn
->src3
);
206 case OP_BINARY
... OP_BINCMP_END
:
207 kill_use(&insn
->src2
);
215 case OP_NOT
: case OP_NEG
:
217 kill_use(&insn
->src1
);
221 kill_use_list(insn
->phi_list
);
224 kill_use(&insn
->phi_src
);
228 repeat_phase
|= REPEAT_SYMBOL_CLEANUP
;
232 if (!insn
->bb_true
|| !insn
->bb_false
)
236 case OP_COMPUTEDGOTO
:
237 kill_use(&insn
->cond
);
247 repeat_phase
|= REPEAT_CSE
;
252 * Kill trivially dead instructions
254 static int dead_insn(struct instruction
*insn
, pseudo_t
*src1
, pseudo_t
*src2
, pseudo_t
*src3
)
256 struct pseudo_user
*pu
;
257 FOR_EACH_PTR(insn
->target
->users
, pu
) {
258 if (*pu
->userp
!= VOID
)
260 } END_FOR_EACH_PTR(pu
);
269 static inline int constant(pseudo_t pseudo
)
271 return pseudo
->type
== PSEUDO_VAL
;
274 static int replace_with_pseudo(struct instruction
*insn
, pseudo_t pseudo
)
276 convert_instruction_target(insn
, pseudo
);
278 switch (insn
->opcode
) {
281 kill_use(&insn
->src3
);
282 case OP_BINARY
... OP_BINCMP_END
:
283 kill_use(&insn
->src2
);
291 kill_use(&insn
->src1
);
301 static unsigned int value_size(long long value
)
316 * Try to determine the maximum size of bits in a pseudo.
318 * Right now this only follow casts and constant values, but we
319 * could look at things like logical 'and' instructions etc.
321 static unsigned int operand_size(struct instruction
*insn
, pseudo_t pseudo
)
323 unsigned int size
= insn
->size
;
325 if (pseudo
->type
== PSEUDO_REG
) {
326 struct instruction
*src
= pseudo
->def
;
327 if (src
&& src
->opcode
== OP_CAST
&& src
->orig_type
) {
328 unsigned int orig_size
= src
->orig_type
->bit_size
;
329 if (orig_size
< size
)
333 if (pseudo
->type
== PSEUDO_VAL
) {
334 unsigned int orig_size
= value_size(pseudo
->value
);
335 if (orig_size
< size
)
341 static int simplify_asr(struct instruction
*insn
, pseudo_t pseudo
, long long value
)
343 unsigned int size
= operand_size(insn
, pseudo
);
346 warning(insn
->pos
, "right shift by bigger than source value");
347 return replace_with_pseudo(insn
, value_pseudo(0));
350 return replace_with_pseudo(insn
, pseudo
);
354 static int simplify_mul_div(struct instruction
*insn
, long long value
)
356 unsigned long long sbit
= 1ULL << (insn
->size
- 1);
357 unsigned long long bits
= sbit
| (sbit
- 1);
360 return replace_with_pseudo(insn
, insn
->src1
);
362 switch (insn
->opcode
) {
366 return replace_with_pseudo(insn
, insn
->src2
);
369 if (!(value
& sbit
)) // positive
374 insn
->opcode
= OP_NEG
;
382 static int compare_opcode(int opcode
, int inverse
)
388 case OP_SET_EQ
: return OP_SET_NE
;
389 case OP_SET_NE
: return OP_SET_EQ
;
391 case OP_SET_LT
: return OP_SET_GE
;
392 case OP_SET_LE
: return OP_SET_GT
;
393 case OP_SET_GT
: return OP_SET_LE
;
394 case OP_SET_GE
: return OP_SET_LT
;
396 case OP_SET_A
: return OP_SET_BE
;
397 case OP_SET_AE
: return OP_SET_B
;
398 case OP_SET_B
: return OP_SET_AE
;
399 case OP_SET_BE
: return OP_SET_A
;
406 static int simplify_seteq_setne(struct instruction
*insn
, long long value
)
408 struct instruction
*def
= insn
->src1
->def
;
413 if (value
!= 0 && value
!= 1)
419 inverse
= (insn
->opcode
== OP_SET_NE
) == value
;
420 opcode
= def
->opcode
;
422 case OP_BINCMP
... OP_BINCMP_END
:
424 // setcc.n %t <- %a, %b
425 // setne.m %r <- %t, $0
427 // setcc.n %t <- %a, %b
428 // setcc.m %r <- %a, $b
429 // and similar for setne/eq ... 0/1
432 remove_usage(insn
->src1
, &insn
->src1
);
433 insn
->opcode
= compare_opcode(opcode
, inverse
);
434 use_pseudo(insn
, src1
, &insn
->src1
);
435 use_pseudo(insn
, src2
, &insn
->src2
);
443 static int simplify_constant_rightside(struct instruction
*insn
)
445 long long value
= insn
->src2
->value
;
447 switch (insn
->opcode
) {
450 return replace_with_pseudo(insn
, insn
->src2
);
451 goto case_neutral_zero
;
455 insn
->opcode
= OP_ADD
;
456 insn
->src2
= value_pseudo(-value
);
461 case OP_OR
: case OP_XOR
:
466 return replace_with_pseudo(insn
, insn
->src1
);
469 return simplify_asr(insn
, insn
->src1
, value
);
471 case OP_MODU
: case OP_MODS
:
473 return replace_with_pseudo(insn
, value_pseudo(0));
476 case OP_DIVU
: case OP_DIVS
:
477 case OP_MULU
: case OP_MULS
:
478 return simplify_mul_div(insn
, value
);
482 return replace_with_pseudo(insn
, insn
->src1
);
486 return replace_with_pseudo(insn
, insn
->src2
);
491 return simplify_seteq_setne(insn
, value
);
496 static int simplify_constant_leftside(struct instruction
*insn
)
498 long long value
= insn
->src1
->value
;
500 switch (insn
->opcode
) {
501 case OP_ADD
: case OP_OR
: case OP_XOR
:
503 return replace_with_pseudo(insn
, insn
->src2
);
507 case OP_LSR
: case OP_ASR
:
509 case OP_MULU
: case OP_MULS
:
511 return replace_with_pseudo(insn
, insn
->src1
);
517 static int simplify_constant_binop(struct instruction
*insn
)
519 /* FIXME! Verify signs and sizes!! */
520 long long left
= insn
->src1
->value
;
521 long long right
= insn
->src2
->value
;
522 unsigned long long ul
, ur
;
523 long long res
, mask
, bits
;
525 mask
= 1ULL << (insn
->size
-1);
526 bits
= mask
| (mask
-1);
535 switch (insn
->opcode
) {
556 if (left
== mask
&& right
== -1)
568 if (left
== mask
&& right
== -1)
598 /* Binary comparison */
634 replace_with_pseudo(insn
, value_pseudo(res
));
638 static int simplify_binop_same_args(struct instruction
*insn
, pseudo_t arg
)
640 switch (insn
->opcode
) {
642 case OP_SET_LT
: case OP_SET_GT
:
643 case OP_SET_B
: case OP_SET_A
:
644 if (Wtautological_compare
)
645 warning(insn
->pos
, "self-comparison always evaluates to false");
648 return replace_with_pseudo(insn
, value_pseudo(0));
651 case OP_SET_LE
: case OP_SET_GE
:
652 case OP_SET_BE
: case OP_SET_AE
:
653 if (Wtautological_compare
)
654 warning(insn
->pos
, "self-comparison always evaluates to true");
655 return replace_with_pseudo(insn
, value_pseudo(1));
659 return replace_with_pseudo(insn
, arg
);
663 remove_usage(arg
, &insn
->src2
);
664 insn
->src2
= value_pseudo(0);
665 insn
->opcode
= OP_SET_NE
;
675 static int simplify_binop(struct instruction
*insn
)
677 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, NULL
))
679 if (constant(insn
->src1
)) {
680 if (constant(insn
->src2
))
681 return simplify_constant_binop(insn
);
682 return simplify_constant_leftside(insn
);
684 if (constant(insn
->src2
))
685 return simplify_constant_rightside(insn
);
686 if (insn
->src1
== insn
->src2
)
687 return simplify_binop_same_args(insn
, insn
->src1
);
691 static void switch_pseudo(struct instruction
*insn1
, pseudo_t
*pp1
, struct instruction
*insn2
, pseudo_t
*pp2
)
693 pseudo_t p1
= *pp1
, p2
= *pp2
;
695 use_pseudo(insn1
, p2
, pp1
);
696 use_pseudo(insn2
, p1
, pp2
);
697 remove_usage(p1
, pp1
);
698 remove_usage(p2
, pp2
);
701 static int canonical_order(pseudo_t p1
, pseudo_t p2
)
703 /* symbol/constants on the right */
704 if (p1
->type
== PSEUDO_VAL
)
705 return p2
->type
== PSEUDO_VAL
;
707 if (p1
->type
== PSEUDO_SYM
)
708 return p2
->type
== PSEUDO_SYM
|| p2
->type
== PSEUDO_VAL
;
713 static int simplify_commutative_binop(struct instruction
*insn
)
715 if (!canonical_order(insn
->src1
, insn
->src2
)) {
716 switch_pseudo(insn
, &insn
->src1
, insn
, &insn
->src2
);
722 static inline int simple_pseudo(pseudo_t pseudo
)
724 return pseudo
->type
== PSEUDO_VAL
|| pseudo
->type
== PSEUDO_SYM
;
727 static int simplify_associative_binop(struct instruction
*insn
)
729 struct instruction
*def
;
730 pseudo_t pseudo
= insn
->src1
;
732 if (!simple_pseudo(insn
->src2
))
734 if (pseudo
->type
!= PSEUDO_REG
)
739 if (def
->opcode
!= insn
->opcode
)
741 if (!simple_pseudo(def
->src2
))
743 if (ptr_list_size((struct ptr_list
*)def
->target
->users
) != 1)
745 switch_pseudo(def
, &def
->src1
, insn
, &insn
->src2
);
749 static int simplify_constant_unop(struct instruction
*insn
)
751 long long val
= insn
->src1
->value
;
754 switch (insn
->opcode
) {
764 mask
= 1ULL << (insn
->size
-1);
765 res
&= mask
| (mask
-1);
767 replace_with_pseudo(insn
, value_pseudo(res
));
771 static int simplify_unop(struct instruction
*insn
)
773 if (dead_insn(insn
, &insn
->src1
, NULL
, NULL
))
775 if (constant(insn
->src1
))
776 return simplify_constant_unop(insn
);
778 switch (insn
->opcode
) {
779 struct instruction
*def
;
782 def
= insn
->src
->def
;
783 if (def
&& def
->opcode
== OP_NOT
)
784 return replace_with_pseudo(insn
, def
->src
);
787 def
= insn
->src
->def
;
788 if (def
&& def
->opcode
== OP_NEG
)
789 return replace_with_pseudo(insn
, def
->src
);
797 static int simplify_one_memop(struct instruction
*insn
, pseudo_t orig
)
799 pseudo_t addr
= insn
->src
;
802 if (addr
->type
== PSEUDO_REG
) {
803 struct instruction
*def
= addr
->def
;
804 if (def
->opcode
== OP_SYMADDR
&& def
->src
) {
805 kill_use(&insn
->src
);
806 use_pseudo(insn
, def
->src
, &insn
->src
);
807 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
809 if (def
->opcode
== OP_ADD
) {
829 warning(insn
->pos
, "crazy programmer");
831 insn
->offset
+= off
->value
;
832 use_pseudo(insn
, new, &insn
->src
);
833 remove_usage(addr
, &insn
->src
);
834 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
838 * We walk the whole chain of adds/subs backwards. That's not
839 * only more efficient, but it allows us to find loops.
841 static int simplify_memop(struct instruction
*insn
)
844 pseudo_t orig
= insn
->src
;
847 one
= simplify_one_memop(insn
, orig
);
853 static long long get_cast_value(long long val
, int old_size
, int new_size
, int sign
)
857 if (sign
&& new_size
> old_size
) {
858 mask
= 1 << (old_size
-1);
860 val
|= ~(mask
| (mask
-1));
862 mask
= 1 << (new_size
-1);
863 return val
& (mask
| (mask
-1));
866 static int simplify_cast(struct instruction
*insn
)
868 struct symbol
*orig_type
;
872 if (dead_insn(insn
, &insn
->src
, NULL
, NULL
))
875 orig_type
= insn
->orig_type
;
879 /* Keep casts with pointer on either side (not only case of OP_PTRCAST) */
880 if (is_ptr_type(orig_type
) || is_ptr_type(insn
->type
))
883 orig_size
= orig_type
->bit_size
;
887 /* A cast of a constant? */
889 int sign
= orig_type
->ctype
.modifiers
& MOD_SIGNED
;
890 long long val
= get_cast_value(src
->value
, orig_size
, size
, sign
);
891 src
= value_pseudo(val
);
895 /* A cast of a "and" might be a no-op.. */
896 if (src
->type
== PSEUDO_REG
) {
897 struct instruction
*def
= src
->def
;
898 if (def
->opcode
== OP_AND
&& def
->size
>= size
) {
899 pseudo_t val
= def
->src2
;
900 if (val
->type
== PSEUDO_VAL
) {
901 unsigned long long value
= val
->value
;
902 if (!(value
>> (size
-1)))
908 if (size
== orig_size
) {
909 int op
= (orig_type
->ctype
.modifiers
& MOD_SIGNED
) ? OP_SCAST
: OP_CAST
;
910 if (insn
->opcode
== op
)
917 return replace_with_pseudo(insn
, src
);
920 static int simplify_select(struct instruction
*insn
)
922 pseudo_t cond
, src1
, src2
;
924 if (dead_insn(insn
, &insn
->src1
, &insn
->src2
, &insn
->src3
))
930 if (constant(cond
) || src1
== src2
) {
931 pseudo_t
*kill
, take
;
932 kill_use(&insn
->src1
);
933 take
= cond
->value
? src1
: src2
;
934 kill
= cond
->value
? &insn
->src3
: &insn
->src2
;
936 replace_with_pseudo(insn
, take
);
939 if (constant(src1
) && constant(src2
)) {
940 long long val1
= src1
->value
;
941 long long val2
= src2
->value
;
943 /* The pair 0/1 is special - replace with SETNE/SETEQ */
944 if ((val1
| val2
) == 1) {
945 int opcode
= OP_SET_EQ
;
950 insn
->opcode
= opcode
;
951 /* insn->src1 is already cond */
952 insn
->src2
= src1
; /* Zero */
959 static int is_in_range(pseudo_t src
, long long low
, long long high
)
966 return value
>= low
&& value
<= high
;
972 static int simplify_range(struct instruction
*insn
)
974 pseudo_t src1
, src2
, src3
;
979 if (src2
->type
!= PSEUDO_VAL
|| src3
->type
!= PSEUDO_VAL
)
981 if (is_in_range(src1
, src2
->value
, src3
->value
)) {
982 kill_instruction(insn
);
989 * Simplify "set_ne/eq $0 + br"
991 static int simplify_cond_branch(struct instruction
*br
, pseudo_t cond
, struct instruction
*def
, pseudo_t
*pp
)
993 use_pseudo(br
, *pp
, &br
->cond
);
994 remove_usage(cond
, &br
->cond
);
995 if (def
->opcode
== OP_SET_EQ
) {
996 struct basic_block
*true = br
->bb_true
;
997 struct basic_block
*false = br
->bb_false
;
1004 static int simplify_branch(struct instruction
*insn
)
1006 pseudo_t cond
= insn
->cond
;
1011 /* Constant conditional */
1012 if (constant(cond
)) {
1013 insert_branch(insn
->bb
, insn
, cond
->value
? insn
->bb_true
: insn
->bb_false
);
1018 if (insn
->bb_true
== insn
->bb_false
) {
1019 struct basic_block
*bb
= insn
->bb
;
1020 struct basic_block
*target
= insn
->bb_false
;
1021 remove_bb_from_list(&target
->parents
, bb
, 1);
1022 remove_bb_from_list(&bb
->children
, target
, 1);
1023 insn
->bb_false
= NULL
;
1024 kill_use(&insn
->cond
);
1029 /* Conditional on a SETNE $0 or SETEQ $0 */
1030 if (cond
->type
== PSEUDO_REG
) {
1031 struct instruction
*def
= cond
->def
;
1033 if (def
->opcode
== OP_SET_NE
|| def
->opcode
== OP_SET_EQ
) {
1034 if (constant(def
->src1
) && !def
->src1
->value
)
1035 return simplify_cond_branch(insn
, cond
, def
, &def
->src2
);
1036 if (constant(def
->src2
) && !def
->src2
->value
)
1037 return simplify_cond_branch(insn
, cond
, def
, &def
->src1
);
1039 if (def
->opcode
== OP_SEL
) {
1040 if (constant(def
->src2
) && constant(def
->src3
)) {
1041 long long val1
= def
->src2
->value
;
1042 long long val2
= def
->src3
->value
;
1043 if (!val1
&& !val2
) {
1044 insert_branch(insn
->bb
, insn
, insn
->bb_false
);
1048 insert_branch(insn
->bb
, insn
, insn
->bb_true
);
1052 struct basic_block
*true = insn
->bb_true
;
1053 struct basic_block
*false = insn
->bb_false
;
1054 insn
->bb_false
= true;
1055 insn
->bb_true
= false;
1057 use_pseudo(insn
, def
->src1
, &insn
->cond
);
1058 remove_usage(cond
, &insn
->cond
);
1062 if (def
->opcode
== OP_CAST
|| def
->opcode
== OP_SCAST
) {
1063 int orig_size
= def
->orig_type
? def
->orig_type
->bit_size
: 0;
1064 if (def
->size
> orig_size
) {
1065 use_pseudo(insn
, def
->src
, &insn
->cond
);
1066 remove_usage(cond
, &insn
->cond
);
1074 static int simplify_switch(struct instruction
*insn
)
1076 pseudo_t cond
= insn
->cond
;
1078 struct multijmp
*jmp
;
1080 if (!constant(cond
))
1082 val
= insn
->cond
->value
;
1084 FOR_EACH_PTR(insn
->multijmp_list
, jmp
) {
1086 if (jmp
->begin
> jmp
->end
)
1088 if (val
>= jmp
->begin
&& val
<= jmp
->end
)
1090 } END_FOR_EACH_PTR(jmp
);
1091 warning(insn
->pos
, "Impossible case statement");
1095 insert_branch(insn
->bb
, insn
, jmp
->target
);
1099 int simplify_instruction(struct instruction
*insn
)
1103 switch (insn
->opcode
) {
1104 case OP_ADD
: case OP_MULS
:
1105 case OP_AND
: case OP_OR
: case OP_XOR
:
1106 case OP_AND_BOOL
: case OP_OR_BOOL
:
1107 if (simplify_binop(insn
))
1109 if (simplify_commutative_binop(insn
))
1111 return simplify_associative_binop(insn
);
1114 case OP_SET_EQ
: case OP_SET_NE
:
1115 if (simplify_binop(insn
))
1117 return simplify_commutative_binop(insn
);
1120 case OP_DIVU
: case OP_DIVS
:
1121 case OP_MODU
: case OP_MODS
:
1123 case OP_LSR
: case OP_ASR
:
1124 case OP_SET_LE
: case OP_SET_GE
:
1125 case OP_SET_LT
: case OP_SET_GT
:
1126 case OP_SET_B
: case OP_SET_A
:
1127 case OP_SET_BE
: case OP_SET_AE
:
1128 return simplify_binop(insn
);
1130 case OP_NOT
: case OP_NEG
:
1131 return simplify_unop(insn
);
1132 case OP_LOAD
: case OP_STORE
:
1133 return simplify_memop(insn
);
1135 if (dead_insn(insn
, NULL
, NULL
, NULL
))
1136 return REPEAT_CSE
| REPEAT_SYMBOL_CLEANUP
;
1137 return replace_with_pseudo(insn
, insn
->symbol
);
1142 return simplify_cast(insn
);
1144 if (dead_insn(insn
, NULL
, NULL
, NULL
)) {
1145 kill_use_list(insn
->phi_list
);
1148 return clean_up_phi(insn
);
1150 if (dead_insn(insn
, &insn
->phi_src
, NULL
, NULL
))
1154 return simplify_select(insn
);
1156 return simplify_branch(insn
);
1158 return simplify_switch(insn
);
1160 return simplify_range(insn
);