[gcc r14-3722] MATCH: Add pattern for `(x | y) & (x & z)`

[gcc r14-3722] MATCH: Add pattern for `(x | y) & (x & z)`

[Andrew Pinski]

https://gcc.gnu.org/g:8e995e84233661a1a246807a66cc84003426b1df

commit r14-3722-g8e995e84233661a1a246807a66cc84003426b1df
Author: Andrew Pinski <apinski@marvell.com>
Date:   Sun Sep 3 10:17:29 2023 -0700

    MATCH: Add pattern for `(x | y) & (x & z)`
    
    Like the pattern already there for `(x | y) & x`,
    this adds a simple pattern to optimize `(x | y) & (x & z)`
    to just `x & z`.
    
    OK? Bootstrapped and tested on x86-64-linux-gnu with no regressions.
    
    gcc/ChangeLog:
    
            PR tree-optimization/103536
            * match.pd (`(x | y) & (x & z)`,
            `(x & y) | (x | z)`): New patterns.
    
    gcc/testsuite/ChangeLog:
    
            PR tree-optimization/103536
            * gcc.dg/tree-ssa/andor-6.c: New test.
            * gcc.dg/tree-ssa/andor-bool-1.c: New test.

Diff:
---
 gcc/match.pd                                 |  7 ++++++-
 gcc/testsuite/gcc.dg/tree-ssa/andor-6.c      | 19 +++++++++++++++++++
 gcc/testsuite/gcc.dg/tree-ssa/andor-bool-1.c | 13 +++++++++++++
 3 files changed, 38 insertions(+), 1 deletion(-)

diff --git a/gcc/match.pd b/gcc/match.pd
index 41382f73a2f9..bc9ddd65fe31 100644
--- a/gcc/match.pd
+++ b/gcc/match.pd
@@ -2070,7 +2070,12 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
   (with { bool wascmp; }
    (if (bitwise_inverted_equal_p (@0, @2, wascmp)
 	&& (!wascmp || element_precision (type) == 1))
-    (bitop @0 @1)))))
+    (bitop @0 @1))))
+  /* (x | y) & (x & z) -> (x & z) */
+  /* (x & y) | (x | z) -> (x | z) */
+ (simplify
+  (bitop:c (rbitop:c @0 @1) (bitop:c@3 @0 @2))
+  @3))
 
 /* ((x | y) & z) | x -> (z & y) | x
    ((x ^ y) & z) | x -> (z & y) | x  */
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/andor-6.c b/gcc/testsuite/gcc.dg/tree-ssa/andor-6.c
new file mode 100644
index 000000000000..32e11730f988
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/andor-6.c
@@ -0,0 +1,19 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-original" } */
+/* PR tree-optimization/103536 */
+
+int
+orand(int a, int b, int c)
+{
+    return (a | b) & (a & c); // a & c
+}
+
+/* { dg-final { scan-tree-dump "return a \& c;" "original" } } */
+
+int
+andor(int d, int e, int f)
+{
+    return (d & e) | (d | f); // d | f
+}
+
+/* { dg-final { scan-tree-dump "return d \\| f;" "original" } } */
diff --git a/gcc/testsuite/gcc.dg/tree-ssa/andor-bool-1.c b/gcc/testsuite/gcc.dg/tree-ssa/andor-bool-1.c
new file mode 100644
index 000000000000..a1b974f38597
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/tree-ssa/andor-bool-1.c
@@ -0,0 +1,13 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-optimized" } */
+/* PR tree-optimization/103536 */
+
+_Bool
+src_1 (_Bool a, _Bool b)
+{
+    return (a || b) && (a && b);
+}
+
+/* { dg-final { scan-tree-dump "a_\[0-9\]+.D. \& b_\[0-9\]+.D." "optimized" } } */
+/* { dg-final { scan-tree-dump-not "a_\[0-9\]+.D. \\\| b_\[0-9\]+.D." "optimized" } } */
+/* { dg-final { scan-tree-dump-not "if " "optimized" } } */