From mboxrd@z Thu Jan  1 00:00:00 1970
Return-Path: <gcc-bugzilla@gcc.gnu.org>
Received: by sourceware.org (Postfix, from userid 48)
	id 9CA1E3858C50; Mon, 11 Sep 2023 21:45:35 +0000 (GMT)
DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 9CA1E3858C50
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org;
	s=default; t=1694468735;
	bh=lQ7jKVD7/xjPbuf7zH5nsjDwuPJG41aL6TV2wltgZ+w=;
	h=From:To:Subject:Date:In-Reply-To:References:From;
	b=tdAs07Md12wAjzfb8rRhmqUA+toKrRoN1Joj1eoG9eE/eA3mLLTNfG+RHg7zv3A3u
	 uItajMVXChyGn12qQ7hC9lCsJ124Y4t3QS1xLh0QbeTCAiwH9rjJGrgVvzrPGv55OE
	 JqQaK0Gsp6OnEmKOLr6crlS1O328sU92+SKI7Q00=
From: "pinskia at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/107881] (a <= b) == (b >= a) should be
 optimized to (a == b)
Date: Mon, 11 Sep 2023 21:45:35 +0000
X-Bugzilla-Reason: CC
X-Bugzilla-Type: changed
X-Bugzilla-Watch-Reason: None
X-Bugzilla-Product: gcc
X-Bugzilla-Component: tree-optimization
X-Bugzilla-Version: 13.0
X-Bugzilla-Keywords: missed-optimization
X-Bugzilla-Severity: enhancement
X-Bugzilla-Who: pinskia at gcc dot gnu.org
X-Bugzilla-Status: ASSIGNED
X-Bugzilla-Resolution: 
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: pinskia at gcc dot gnu.org
X-Bugzilla-Target-Milestone: ---
X-Bugzilla-Flags: 
X-Bugzilla-Changed-Fields: 
Message-ID: <bug-107881-4-cfVXwi2Fj9@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-107881-4@http.gcc.gnu.org/bugzilla/>
References: <bug-107881-4@http.gcc.gnu.org/bugzilla/>
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/
Auto-Submitted: auto-generated
MIME-Version: 1.0
List-Id: <gcc-bugs.sourceware.org>

https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D107881

--- Comment #15 from Andrew Pinski <pinskia at gcc dot gnu.org> ---
For the ^/!=3D case here are the missing optimizations (note =3D=3D can be =
handled
too):
```
int ltgtxor(int a, int b)
{
        _Bool c =3D a < b;
        _Bool d =3D a > b;
        return c ^ d; // a !=3D b
}

int lteqxor(int a, int b)
{
        _Bool c =3D a < b;
        _Bool d =3D a =3D=3D b;
        return c ^ d; // a <=3D b (basically | here)
}

int ltnexor(int a, int b)
{
        _Bool c =3D a < b;
        _Bool d =3D a !=3D b;
        return c ^ d; // a > b
}
int legexor(int a, int b)
{
        _Bool c =3D a <=3D b;
        _Bool d =3D a >=3D b;
        return c ^ d; // a !=3D b
}

int leeqxor(int a, int b)
{
        _Bool c =3D a <=3D b;
        _Bool d =3D a =3D=3D b;
        return c ^ d; // a < b
}

int lenexor(int a, int b)
{
        _Bool c =3D a <=3D b;
        _Bool d =3D a !=3D b;
        return c ^ d; // a >=3D b
}

```

Match pattern I think:
```
(for op (bit_xor ne)
 (for cmp1 (lt lt lt le le le)
      cmp2 (gt eq ne ge eq ne)
      rcmp (ne le gt ne lt ge)
  (simplify
   (op:c (cmp1:c @0 @1) (cmp2:c @0 @1))
   (rcmp @0 @1))))
```

For eq:
```
(for cmp1 (lt lt lt le le le)
     cmp2 (gt eq ne ge eq ne)
     rcmp (eq ge le eq ge lt)
 (simplify
  (eq:c (cmp1:c @0 @1) (cmp2:c @0 @1))
  (rcmp @0 @1)))
```

Both of these this check though:
(INTEGRAL_TYPE_P (TREE_TYPE (@0)) || POINTER_TYPE_P (TREE_TYPE (@0)))=