x is never equal to ~x, so we can fold such comparisons to constants.
2021-01-04 Jakub Jelinek <jakub@redhat.com>
PR tree-optimization/96782
* match.pd (x == ~x -> false, x != ~x -> true): New simplifications.
* gcc.dg/tree-ssa/pr96782.c: New test.
(if (!flag_trapping_math)
{ constant_boolean_node (false, type); }))
+/* x == ~x -> false */
+/* x != ~x -> true */
+(for cmp (eq ne)
+ (simplify
+ (cmp:c @0 (bit_not @0))
+ { constant_boolean_node (cmp == NE_EXPR, type); }))
+
/* Fold ~X op ~Y as Y op X. */
(for cmp (simple_comparison)
(simplify
--- /dev/null
+/* PR tree-optimization/96782 */
+/* { dg-do compile } */
+/* { dg-options "-O2 -fdump-tree-optimized" } */
+/* { dg-final { scan-tree-dump-times "return 0;" 1 "optimized" } } */
+/* { dg-final { scan-tree-dump-times "return 1;" 1 "optimized" } } */
+
+int
+foo (int a)
+{
+ return a == ~a;
+}
+
+int
+bar (int b)
+{
+ return ~b != b;
+}