From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id 01086385AFA4; Fri, 28 Jul 2023 14:19:31 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 01086385AFA4 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1690553972; bh=xn0C7+KNmVtd5IyJH13NIc4OtbVPlsJJCvA/3CCUjIM=; h=From:To:Subject:Date:In-Reply-To:References:From; b=JUb3gnL+Mpjl6/ZbvkW9wexKWxVcLwlWTQuSajlDriwxazdpLPlwCMd5nK0oVCr14 tvJklc/8xYBL3w8kP2N+U/80YBUpmgXJrp2kqfgXIip0XoLxrXZh0X3L2P1cR/ccXN +Ln6lpIrs3eVSysVTt3cj2h5K9BpzZRWI4mJPpMI= From: "cvs-commit at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/77689] Missing vectorization lead to huge performance loss Date: Fri, 28 Jul 2023 14:19:31 +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: 6.2.1 X-Bugzilla-Keywords: missed-optimization X-Bugzilla-Severity: enhancement X-Bugzilla-Who: cvs-commit at gcc dot gnu.org X-Bugzilla-Status: NEW 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: 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=3D77689 --- Comment #18 from CVS Commits --- The master branch has been updated by Jan Hubicka : https://gcc.gnu.org/g:f5fb9ff2396fd41fdd2e6d35a412e936d2d42f75 commit r14-2852-gf5fb9ff2396fd41fdd2e6d35a412e936d2d42f75 Author: Jan Hubicka Date: Fri Jul 28 16:18:32 2023 +0200 loop-split improvements, part 3 extend tree-ssa-loop-split to understand test of the form if (i=3D=3D0) and if (i!=3D0) which triggers only during the first iteration. Naturally we should also be able to trigger last iteration or split into 3 cases if the test indeed can fire in the middle of the loop. Last iteration is bit trickier pattern matching so I want to do it incrementally, but I implemented easy case using value range that handl= ed loops with constant iterations. The testcase gets misupdated profile, I will also fix that incrementall= y. gcc/ChangeLog: PR middle-end/77689 * tree-ssa-loop-split.cc: Include value-query.h. (split_at_bb_p): Analyze cases where EQ/NE can be turned into LT/LE/GT/GE; return updated guard code. (split_loop): Use guard code. gcc/testsuite/ChangeLog: PR middle-end/77689 * g++.dg/tree-ssa/loop-split-1.C: New test.=