diff options
| author | Andrew Pinski <apinski@marvell.com> | 2023-04-08 18:46:37 -0700 |
|---|---|---|
| committer | Andrew Pinski <apinski@marvell.com> | 2023-04-30 13:35:36 -0700 |
| commit | c53237cefbad0c52799927d6fd99775426a8a92a (patch) | |
| tree | de10d15a2276f0cbe6ce3d5617e3e027e594ea0c /gcc/match.pd | |
| parent | 55b708895149ac5e108f50150e12a3c5ba00e83d (diff) | |
| download | gcc-c53237cefbad0c52799927d6fd99775426a8a92a.zip gcc-c53237cefbad0c52799927d6fd99775426a8a92a.tar.gz gcc-c53237cefbad0c52799927d6fd99775426a8a92a.tar.bz2 | |
MATCH: add some of what phiopt's builtin_zero_pattern did
This adds the patterns for
POPCOUNT BSWAP FFS PARITY CLZ and CTZ.
For "a != 0 ? FUNC(a) : CST".
CLRSB, CLRSBL, and CLRSBLL will be moved next.
Note this is not enough to remove
cond_removal_in_builtin_zero_pattern as we need to handle
the case where there is an NOP_CONVERT inside the conditional
to move out of the condition inside match_simplify_replacement.
OK? Bootstrapped and tested on x86_64-linux-gnu.
gcc/ChangeLog:
* match.pd: Add patterns for "a != 0 ? FUNC(a) : CST"
for FUNC of POPCOUNT BSWAP FFS PARITY CLZ and CTZ.
Diffstat (limited to 'gcc/match.pd')
| -rw-r--r-- | gcc/match.pd | 41 |
1 files changed, 39 insertions, 2 deletions
diff --git a/gcc/match.pd b/gcc/match.pd index e17597e..0e782cd 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -52,6 +52,8 @@ along with GCC; see the file COPYING3. If not see gt ge eq ne le lt unordered ordered ungt unge unlt unle uneq ltgt) (define_operator_list simple_comparison lt le eq ne ge gt) (define_operator_list swapped_simple_comparison gt ge eq ne le lt) +(define_operator_list BSWAP BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 + BUILT_IN_BSWAP64 BUILT_IN_BSWAP128) #include "cfn-operators.pd" @@ -4313,8 +4315,7 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) (complex (convert:itype @0) (negate (convert:itype @1))))) /* BSWAP simplifications, transforms checked by gcc.dg/builtin-bswap-8.c. */ -(for bswap (BUILT_IN_BSWAP16 BUILT_IN_BSWAP32 - BUILT_IN_BSWAP64 BUILT_IN_BSWAP128) +(for bswap (BSWAP) (simplify (bswap (bswap @0)) @0) @@ -7780,6 +7781,42 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) (bit_xor (PARITY:s @0) (PARITY:s @1)) (PARITY (bit_xor @0 @1))) +/* a != 0 ? FUN(a) : 0 -> Fun(a) for some builtin functions. */ +(for func (POPCOUNT BSWAP FFS PARITY) + (simplify + (cond (ne @0 integer_zerop@1) (func@4 (convert? @2)) integer_zerop@3) + @4)) + +#if GIMPLE +/* a != 0 ? CLZ(a) : CST -> .CLZ(a) where CST is the result of the internal function for 0. */ +(for func (CLZ) + (simplify + (cond (ne @0 integer_zerop@1) (func (convert?@4 @2)) INTEGER_CST@3) + (with { int val; + internal_fn ifn = IFN_LAST; + if (direct_internal_fn_supported_p (IFN_CLZ, type, OPTIMIZE_FOR_BOTH) + && CLZ_DEFINED_VALUE_AT_ZERO (SCALAR_INT_TYPE_MODE (type), + val) == 2) + ifn = IFN_CLZ; + } + (if (ifn == IFN_CLZ && wi::to_widest (@3) == val) + (IFN_CLZ @4))))) + +/* a != 0 ? CTZ(a) : CST -> .CTZ(a) where CST is the result of the internal function for 0. */ +(for func (CTZ) + (simplify + (cond (ne @0 integer_zerop@1) (func (convert?@4 @2)) INTEGER_CST@3) + (with { int val; + internal_fn ifn = IFN_LAST; + if (direct_internal_fn_supported_p (IFN_CTZ, type, OPTIMIZE_FOR_BOTH) + && CTZ_DEFINED_VALUE_AT_ZERO (SCALAR_INT_TYPE_MODE (type), + val) == 2) + ifn = IFN_CTZ; + } + (if (ifn == IFN_CTZ && wi::to_widest (@3) == val) + (IFN_CTZ @4))))) +#endif + /* Common POPCOUNT/PARITY simplifications. */ /* popcount(X&C1) is (X>>C2)&1 when C1 == 1<<C2. Same for parity(X&C1). */ (for pfun (POPCOUNT PARITY) |