From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 744FC385480A; Tue, 8 Jun 2021 06:42:23 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 744FC385480A From: "pinskia at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/100958] New: two_value_replacement should move to match.pd Date: Tue, 08 Jun 2021 06:42:23 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: new X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: tree-optimization X-Bugzilla-Version: 12.0 X-Bugzilla-Keywords: missed-optimization X-Bugzilla-Severity: enhancement X-Bugzilla-Who: pinskia at gcc dot gnu.org X-Bugzilla-Status: UNCONFIRMED 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: bug_id short_desc product version bug_status keywords bug_severity priority component assigned_to reporter target_milestone Message-ID: 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: Tue, 08 Jun 2021 06:42:23 -0000 https://gcc.gnu.org/bugzilla/show_bug.cgi?id=3D100958 Bug ID: 100958 Summary: two_value_replacement should move to match.pd Product: gcc Version: 12.0 Status: UNCONFIRMED Keywords: missed-optimization Severity: enhancement Priority: P3 Component: tree-optimization Assignee: pinskia at gcc dot gnu.org Reporter: pinskia at gcc dot gnu.org Target Milestone: --- two_value_replacement can be fully implemented in match.pd now. So it should move. I did not do it originally but it. Comment from two_value_replacement : /* Optimize # x_5 in range [cst1, cst2] where cst2 =3D cst1 + 1 if (x_5 op cstN) # where op is =3D=3D or !=3D and N is 1 or 2 goto bb3; else goto bb4; bb3: bb4: # r_6 =3D PHI # where cst3 =3D=3D cst4 + 1 or cst4 =3D= =3D cst3 + 1 to r_6 =3D x_5 + (min (cst3, cst4) - cst1) or r_6 =3D (min (cst3, cst4) + cst1) - x_5 depending on op, N and which of cst3 and cst4 is smaller. */=