From 01c977d0ea29512c67fc2ea273a1f9126b0719b3 Mon Sep 17 00:00:00 2001
From: Matteo Nicoli <matteo.nicoli001@gmail.com>
Date: Fri, 29 Aug 2025 13:43:16 +0200
Subject: [PATCH] tree-optimization/117760 - `a != b` implies that a or b is
 also non-zero

  * gcc/match.pd: added the following optimizations for bitwise operations:
    - (a != b) & ((a|b) != 0) -> (a != b)
    - (a != b) | ((a|b) != 0) -> ((a|b) != 0)
    - (a == b) & ((a|b) == 0) -> ((a|b) == 0)
    - (a == b) | ((a|b) == 0) -> (a == b)
    - (a != b) & ((a|b) == 0) -> false
    - (a == b) | ((a|b) != 0) -> true 

  * gcc.dg/int-bwise-opt-1.c: Tests the following optimisation patterns:
    - (a != b) & ((a|b) != 0) -> (a != b)
    - (a == b) | ((a|b) == 0) -> (a == b)
    - (a != b) & ((a|b) == 0) -> false
    - (a == b) | ((a|b) != 0) -> true 
  * gcc.dg/int-bwise-opt-2.c: Tests the following optimisation patterns:
    - (a != b) | ((a|b) != 0) -> ((a|b) != 0)
    - (a == b) & ((a|b) == 0) -> ((a|b) == 0)

Signed-off-by: Matteo Nicoli <matteo.nicoli001@gmail.com>
---
 gcc/match.pd                           | 28 ++++++++++++++++++++++++++
 gcc/testsuite/gcc.dg/int-bwise-opt-1.c | 25 +++++++++++++++++++++++
 gcc/testsuite/gcc.dg/int-bwise-opt-2.c | 15 ++++++++++++++
 3 files changed, 68 insertions(+)
 create mode 100644 gcc/testsuite/gcc.dg/int-bwise-opt-1.c
 create mode 100644 gcc/testsuite/gcc.dg/int-bwise-opt-2.c

diff --git a/gcc/match.pd b/gcc/match.pd
index b1d7a3a1b73..25a3eb644d3 100644
--- a/gcc/match.pd
+++ b/gcc/match.pd
@@ -6743,6 +6743,34 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT)
    @2))
 )
 
+#if GIMPLE
+/* Given two integers a and b:
+   (a != b) & ((a|b) != 0) -> (a != b)
+   (a != b) | ((a|b) != 0) -> ((a|b) != 0)
+   (a == b) & ((a|b) == 0) -> ((a|b) == 0)
+   (a == b) | ((a|b) == 0) -> (a == b)
+   (a != b) & ((a|b) == 0) -> false
+   (a == b) | ((a|b) != 0) -> true  */
+(simplify
+ (bit_and:c (ne:c @0 @1) (ne:c (bit_ior @0 @1) integer_zerop))
+ (ne:c @0 @1))
+(simplify
+ (bit_ior:c (ne:c @0 @1) (ne:c (bit_ior @0 @1) integer_zerop))
+ (ne (bit_ior @0 @1) { integer_zero_node; }))
+(simplify
+ (bit_and:c (eq:c @0 @1) (eq:c (bit_ior @0 @1) integer_zerop))
+ (eq (bit_ior @0 @1) { integer_zero_node; }))
+(simplify
+ (bit_ior:c (eq:c @0 @1) (eq:c (bit_ior @0 @1) integer_zerop))
+ (eq:c @0 @1))
+(simplify
+ (bit_and:c (ne:c @0 @1) (eq:c (bit_ior @0 @1) integer_zerop))
+ { integer_zero_node; })
+(simplify
+ (bit_ior:c (eq:c @0 @1) (ne:c (bit_ior @0 @1) integer_zerop))
+ { integer_one_node; })
+#endif
+
 /* These was part of minmax phiopt.  */
 /* Optimize (a CMP b) ? minmax<a, c> : minmax<b, c>
    to minmax<min/max<a, b>, c> */
diff --git a/gcc/testsuite/gcc.dg/int-bwise-opt-1.c b/gcc/testsuite/gcc.dg/int-bwise-opt-1.c
new file mode 100644
index 00000000000..abf3b3ac874
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/int-bwise-opt-1.c
@@ -0,0 +1,25 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-optimized" } */
+
+int f1(int a, int b)
+{
+  return (a != b) & ((a | b) != 0);
+}
+
+int f2(int a, int b)
+{
+  return (a == b) | ((a | b) == 0);
+}
+
+int f3(int a, int b)
+{
+  return (a != b) & ((a | b) == 0);
+}
+
+int f4(int a, int b)
+{
+  return (a == b) | ((a | b) != 0);
+}
+
+/* { dg-final { scan-tree-dump-times "\\\|" 0 "optimized" } } */
+/* { dg-final { scan-tree-dump-times "\&" 0 "optimized" } } */
diff --git a/gcc/testsuite/gcc.dg/int-bwise-opt-2.c b/gcc/testsuite/gcc.dg/int-bwise-opt-2.c
new file mode 100644
index 00000000000..cc1a48b061a
--- /dev/null
+++ b/gcc/testsuite/gcc.dg/int-bwise-opt-2.c
@@ -0,0 +1,15 @@
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-optimized" } */
+
+int f1(int a, int b)
+{
+  return (a != b) | ((a | b) != 0);
+}
+
+int f2(int a, int b)
+{
+  return (a == b) & ((a | b) == 0);
+}
+
+ /* { dg-final { scan-tree-dump-times "a == b" 0 "optimized" } } */
+ /* { dg-final { scan-tree-dump-times "a != b" 0 "optimized" } } */
-- 
2.39.5 (Apple Git-154)

