From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 1314) id 921773858C52; Sat, 26 Nov 2022 18:00:59 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 921773858C52 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1669485659; bh=ge0aLjQwZG4LoDB/vKeD0ivVrmOCQiuAis383C5sMzc=; h=From:To:Subject:Date:From; b=U0fULefqUG7JIla6T20yMa7mP3N1EnQRGWV/2oQMlSwN76HhqctfFxhZ6FFPNCiAl 8fCG2eonBXC3yBSAefNtUMkKffn19IiR0BAQ3WFixxUcTET+d9CDJAJuP3ZUwkBJZz Vnfs7/e695ldOokd0FrmnwML7L3BRFQVZdQeGt+k= MIME-Version: 1.0 Content-Transfer-Encoding: 7bit Content-Type: text/plain; charset="utf-8" From: Andrew Pinski To: gcc-cvs@gcc.gnu.org Subject: [gcc r13-4311] tree-optimization/103356 Add missing (~a) == b folding for _Bool X-Act-Checkin: gcc X-Git-Author: Andrew Pinski X-Git-Refname: refs/heads/trunk X-Git-Oldrev: d769c5040874bf9546f2524f3f1d2a894165f92a X-Git-Newrev: f9378e3cc390f9bcc310ce206c6773a817aff2ca Message-Id: <20221126180059.921773858C52@sourceware.org> Date: Sat, 26 Nov 2022 18:00:59 +0000 (GMT) List-Id: https://gcc.gnu.org/g:f9378e3cc390f9bcc310ce206c6773a817aff2ca commit r13-4311-gf9378e3cc390f9bcc310ce206c6773a817aff2ca Author: Andrew Pinski Date: Sat Nov 26 07:37:40 2022 +0000 tree-optimization/103356 Add missing (~a) == b folding for _Bool The following makes sure to fold (~a) == b to a ^ b for truth values. OK? Bootstrapped and tested on x86_64-linux-gnu with no regressions. Thanks, Andrew Pinski PR tree-optimization/103356 gcc/ChangeLog: * match.pd: ((~a) == b -> a ^ b): New pattern. gcc/testsuite/ChangeLog: * gcc.dg/pr103356-1.c: New test. Diff: --- gcc/match.pd | 7 +++++++ gcc/testsuite/gcc.dg/pr103356-1.c | 9 +++++++++ 2 files changed, 16 insertions(+) diff --git a/gcc/match.pd b/gcc/match.pd index a4d1386fd9f..67a0a682f31 100644 --- a/gcc/match.pd +++ b/gcc/match.pd @@ -1999,6 +1999,13 @@ DEFINE_INT_AND_FLOAT_ROUND_FN (RINT) && TYPE_PRECISION (TREE_TYPE (@0)) == 1) (convert (eq @0 @1)))) +/* (~a) == b is a ^ b for truth valued a and b. */ +(simplify + (eq:c (bit_not:s truth_valued_p@0) truth_valued_p@1) + (if (INTEGRAL_TYPE_P (TREE_TYPE (@0)) + && TYPE_PRECISION (TREE_TYPE (@0)) == 1) + (convert (bit_xor @0 @1)))) + /* (x & ~m) | (y & m) -> ((x ^ y) & m) ^ x */ (simplify (bit_ior:c (bit_and:cs @0 (bit_not @2)) (bit_and:cs @1 @2)) diff --git a/gcc/testsuite/gcc.dg/pr103356-1.c b/gcc/testsuite/gcc.dg/pr103356-1.c new file mode 100644 index 00000000000..61d0b81da22 --- /dev/null +++ b/gcc/testsuite/gcc.dg/pr103356-1.c @@ -0,0 +1,9 @@ +/* { dg-do compile } */ +/* { dg-options "-O -fdump-tree-forwprop1" } */ + +_Bool foo (_Bool a, _Bool b) +{ + return a == (!b); +} + +/* { dg-final { scan-tree-dump "\[ab\]_\[0-9\]+\\(D\\) \\\^ \[ba\]_\[0-9\]+\\(D\\)" "forwprop1" } } */