diff options
author | Andrew Pinski <pinskia@gmail.com> | 2023-10-09 11:07:08 -0700 |
---|---|---|
committer | Andrew Pinski <pinskia@gmail.com> | 2023-10-10 10:26:34 -0700 |
commit | 975da6fa9170c9cf1ec4a9a9d8177f8561d464d1 (patch) | |
tree | cb638a627d5e0a38f0f3bd416335096b82928d9d /gcc | |
parent | 5bb6a8766ec83e20550e1b59f2accb1ef25e3369 (diff) | |
download | gcc-975da6fa9170c9cf1ec4a9a9d8177f8561d464d1.zip gcc-975da6fa9170c9cf1ec4a9a9d8177f8561d464d1.tar.gz gcc-975da6fa9170c9cf1ec4a9a9d8177f8561d464d1.tar.bz2 |
MATCH: [PR111679] Add alternative simplification of `a | ((~a) ^ b)`
So currently we have a simplification for `a | ~(a ^ b)` but
that does not match the case where we had originally `(~a) | (a ^ b)`
so we need to add a new pattern that matches that and uses bitwise_inverted_equal_p
that also catches comparisons too.
OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions.
PR tree-optimization/111679
gcc/ChangeLog:
* match.pd (`a | ((~a) ^ b)`): New pattern.
gcc/testsuite/ChangeLog:
* gcc.dg/tree-ssa/bitops-5.c: New test.
Diffstat (limited to 'gcc')
-rw-r--r-- | gcc/match.pd | 8 | ||||
-rw-r--r-- | gcc/testsuite/gcc.dg/tree-ssa/bitops-5.c | 27 |
2 files changed, 35 insertions, 0 deletions
diff --git a/gcc/match.pd b/gcc/match.pd index 31bfd8b..49740d1 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -1350,6 +1350,14 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) && TYPE_PRECISION (TREE_TYPE (@0)) == 1) (bit_ior @0 (bit_xor @1 { build_one_cst (type); })))) +/* a | ((~a) ^ b) --> a | (~b) (alt version of the above 2) */ +(simplify + (bit_ior:c @0 (bit_xor:cs @1 @2)) + (with { bool wascmp; } + (if (bitwise_inverted_equal_p (@0, @1, wascmp) + && (!wascmp || element_precision (type) == 1)) + (bit_ior @0 (bit_not @2))))) + /* (a | b) | (a &^ b) --> a | b */ (for op (bit_and bit_xor) (simplify diff --git a/gcc/testsuite/gcc.dg/tree-ssa/bitops-5.c b/gcc/testsuite/gcc.dg/tree-ssa/bitops-5.c new file mode 100644 index 0000000..990610e --- /dev/null +++ b/gcc/testsuite/gcc.dg/tree-ssa/bitops-5.c @@ -0,0 +1,27 @@ +/* { dg-do compile } */ +/* { dg-options "-O2 -fdump-tree-optimized-raw" } */ +/* PR tree-optimization/111679 */ + +int f1(int a, int b) +{ + return (~a) | (a ^ b); // ~(a & b) or (~a) | (~b) +} + +_Bool fb(_Bool c, _Bool d) +{ + return (!c) | (c ^ d); // ~(c & d) or (~c) | (~d) +} + +_Bool fb1(int x, int y) +{ + _Bool a = x == 10, b = y > 100; + return (!a) | (a ^ b); // ~(a & b) or (~a) | (~b) + // or (x != 10) | (y <= 100) +} + +/* { dg-final { scan-tree-dump-not "bit_xor_expr, " "optimized" } } */ +/* { dg-final { scan-tree-dump-times "bit_not_expr, " 2 "optimized" } } */ +/* { dg-final { scan-tree-dump-times "bit_and_expr, " 2 "optimized" } } */ +/* { dg-final { scan-tree-dump-times "bit_ior_expr, " 1 "optimized" } } */ +/* { dg-final { scan-tree-dump-times "ne_expr, _\[0-9\]+, x_\[0-9\]+" 1 "optimized" } } */ +/* { dg-final { scan-tree-dump-times "le_expr, _\[0-9\]+, y_\[0-9\]+" 1 "optimized" } } */ |