From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id E8EC63858D35; Tue, 21 Nov 2023 23:23:14 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org E8EC63858D35 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1700608994; bh=sQSUn34f26aQBT4a42UOhSQQJTWvPUFwax2d7A5VQZE=; h=From:To:Subject:Date:In-Reply-To:References:From; b=uX/qGtVnRW84vHIWETJQd6ewcgCawq3xbLGZbHNYEklaVd4ySNeQ5DNdxEv2gDLiX errMiz93IK16LSCDHJj6UXE3HuaoqAECw/WxUD2JlBVEovUPhcV/MohcUdV0Gb6TmG thFsT5SoBNkMx9ZUg6ydAii/j7NL8g7/oJ3nm6J0= From: "pinskia at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug middle-end/112662] missed-optimization: loop increment until wrap Date: Tue, 21 Nov 2023 23:23:14 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: middle-end X-Bugzilla-Version: 13.2.1 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: keywords everconfirmed bug_severity bug_status assigned_to cf_reconfirmed_on 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 List-Id: https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D112662 Andrew Pinski changed: What |Removed |Added ---------------------------------------------------------------------------- Keywords| |missed-optimization Ever confirmed|0 |1 Severity|normal |enhancement Status|UNCONFIRMED |ASSIGNED Assignee|unassigned at gcc dot gnu.org |pinskia at gcc dot = gnu.org Last reconfirmed| |2023-11-21 --- Comment #1 from Andrew Pinski --- ``` unsigned f(unsigned a) { unsigned t =3D a+1; bool tt =3D t > 999; unsigned t3 =3D ~a; unsigned t4; if (tt) t4 =3D t3; else t4 =3D 0; return t+t4; } ``` Is only optimized by PRE. Which does not optimize GIMPLE_COND plus it is too late. Anyways we have: _6 =3D a_2(D) + 1; _7 =3D _6 > 999; _8 =3D ~a_2(D); _9 =3D _7 ? _8 : 0; a_4 =3D _6 + _9; Which could be optimized to: _6 =3D a_2(D) + 1; _7 =3D _6 > 999; a_4 =3D _7 ? 0 : _6; Maybe something like: ``` (simplify (plus:c (plus@0 @1 integer_onep) (cond @2 (bit_not @0) integer_zerop@3)) (cond @2 @3 @0)) ``` I will look into this further, maybe that is it.=