Change the (zero_one ==/!= 0) ? y : z <op> y
patterns to use multiply rather than (-zero_one) & z
Since there is a pattern to convert `(-zero_one) & z` into `zero_one * z` already, it is better if we don't do a secondary transformation. This reduces the extra statements produced by match-and-simplify on the gimple level too. gcc/ChangeLog: * match.pd ((zero_one ==/!= 0) ? y : z <op> y): Use multiply rather than negation/bit_and.
This commit is contained in:
parent
7ceed7e3e2
commit
52c92fb3f4
1 changed files with 4 additions and 4 deletions
|
@ -3695,7 +3695,7 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
|
|||
(cond (le @0 integer_zerop@1) (negate@2 @0) integer_zerop@1)
|
||||
(max @2 @1))
|
||||
|
||||
/* (zero_one == 0) ? y : z <op> y -> (-(typeof(y))zero_one & z) <op> y */
|
||||
/* (zero_one == 0) ? y : z <op> y -> ((typeof(y))zero_one * z) <op> y */
|
||||
(for op (bit_xor bit_ior)
|
||||
(simplify
|
||||
(cond (eq zero_one_valued_p@0
|
||||
|
@ -3705,9 +3705,9 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
|
|||
(if (INTEGRAL_TYPE_P (type)
|
||||
&& TYPE_PRECISION (type) > 1
|
||||
&& (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
|
||||
(op (bit_and (negate (convert:type @0)) @2) @1))))
|
||||
(op (mult (convert:type @0) @2) @1))))
|
||||
|
||||
/* (zero_one != 0) ? z <op> y : y -> (-(typeof(y))zero_one & z) <op> y */
|
||||
/* (zero_one != 0) ? z <op> y : y -> ((typeof(y))zero_one * z) <op> y */
|
||||
(for op (bit_xor bit_ior)
|
||||
(simplify
|
||||
(cond (ne zero_one_valued_p@0
|
||||
|
@ -3717,7 +3717,7 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
|
|||
(if (INTEGRAL_TYPE_P (type)
|
||||
&& TYPE_PRECISION (type) > 1
|
||||
&& (INTEGRAL_TYPE_P (TREE_TYPE (@0))))
|
||||
(op (bit_and (negate (convert:type @0)) @2) @1))))
|
||||
(op (mult (convert:type @0) @2) @1))))
|
||||
|
||||
/* Simplifications of shift and rotates. */
|
||||
|
||||
|
|
Loading…
Add table
Reference in a new issue