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 265A13858022; Tue, 18 Jan 2022 15:29:00 +0000 (GMT)
DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 265A13858022
From: "law at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/103388] [12 Regression] missed optimization
 for dead code elimination at -O3 (trunk vs 11.2.0)
Date: Tue, 18 Jan 2022 15:28:59 +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: missed-optimization
X-Bugzilla-Severity: normal
X-Bugzilla-Who: law at gcc dot gnu.org
X-Bugzilla-Status: ASSIGNED
X-Bugzilla-Resolution: 
X-Bugzilla-Priority: P3
X-Bugzilla-Assigned-To: law at gcc dot gnu.org
X-Bugzilla-Target-Milestone: 12.0
X-Bugzilla-Flags: 
X-Bugzilla-Changed-Fields: 
Message-ID: <bug-103388-4-chZni3Qz9v@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-103388-4@http.gcc.gnu.org/bugzilla/>
References: <bug-103388-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
X-BeenThere: gcc-bugs@gcc.gnu.org
X-Mailman-Version: 2.1.29
Precedence: list
List-Id: Gcc-bugs mailing list <gcc-bugs.gcc.gnu.org>
List-Unsubscribe: <https://gcc.gnu.org/mailman/options/gcc-bugs>,
 <mailto:gcc-bugs-request@gcc.gnu.org?subject=unsubscribe>
List-Archive: <https://gcc.gnu.org/pipermail/gcc-bugs/>
List-Post: <mailto:gcc-bugs@gcc.gnu.org>
List-Help: <mailto:gcc-bugs-request@gcc.gnu.org?subject=help>
List-Subscribe: <https://gcc.gnu.org/mailman/listinfo/gcc-bugs>,
 <mailto:gcc-bugs-request@gcc.gnu.org?subject=subscribe>
X-List-Received-Date: Tue, 18 Jan 2022 15:29:00 -0000

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

--- Comment #5 from Jeffrey A. Law <law at gcc dot gnu.org> ---
We thread one edge at a time, so we don't know ahead of time how many copies
there would be.

It could be restructured to go ahead and register these threads, then compu=
te
the copy cost on a more global basis.  That would allow us to bump up the
threshold to register the thread, but still reject things later if the cost
appears to be too high.

The book keeping necessary to do that would actually be step #0 for the real
solution which would be to fix the new copier to coalesce cases where multi=
ple
incoming edges thread to the same outgoing edge in a manner similar to what
tree-ssa-threadupdate does.=