From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 5FBFC3858D35; Wed, 29 Dec 2021 13:03:32 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 5FBFC3858D35 From: "jakub at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/103857] implement ternary without jump (and comparison) Date: Wed, 29 Dec 2021 13:03:32 +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: 12.0 X-Bugzilla-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: jakub at gcc dot gnu.org X-Bugzilla-Status: UNCONFIRMED X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: --- X-Bugzilla-Flags: X-Bugzilla-Changed-Fields: cc Message-ID: In-Reply-To: References: 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 X-BeenThere: gcc-bugs@gcc.gnu.org X-Mailman-Version: 2.1.29 Precedence: list List-Id: Gcc-bugs mailing list List-Unsubscribe: , List-Archive: List-Post: List-Help: List-Subscribe: , X-List-Received-Date: Wed, 29 Dec 2021 13:03:32 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D103857 Jakub Jelinek changed: What |Removed |Added ---------------------------------------------------------------------------- CC| |jakub at gcc dot gnu.org --- Comment #1 from Jakub Jelinek --- I don't think that's equivalent. For a[i] equal to b it will be and simila= rly it will be for a[i] equal to c, but not for all the other values. E.g. 13 =3D=3D 42 ? 24 : 42 is 42, but 13 ^ (24 ^ 42) is 63. So, we could do this only if something assures us that a[i] only has 2 poss= ible values, either equal to b or to c. So that would rule out non-constant b o= r c, perhaps it could be done if value range is two adjacent constants equal to b and c, or perhaps if the non-zero bits has a single bit and one of b or c i= s 0 and the other one is that non-zero bitmask of the other comparison operand.=