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 54EA93858428; Wed, 15 Feb 2023 14:06:05 +0000 (GMT)
DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org 54EA93858428
DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org;
	s=default; t=1676469966;
	bh=75wYxKnX5ZFLHGtQvnydcBQ+D5/SwdUxLNUReEPa/Z4=;
	h=From:To:Subject:Date:In-Reply-To:References:From;
	b=HovU48nt4MC19EjC8/R8ackrUDjjhCdPFXscIGW9my7ogSTmkLGpQot8zLOW9ePHa
	 QwdcpVe4lFP/tSH8N5is1rJ4C9xpOzRzJ0PCFpTgzKhIHdob3vtacsMnoYB9DSMkgF
	 nMGkuVZgRlo7K6ok164QlfS3iyNiTcd2pSN76aJ4=
From: "cvs-commit at gcc dot gnu.org" <gcc-bugzilla@gcc.gnu.org>
To: gcc-bugs@gcc.gnu.org
Subject: [Bug tree-optimization/26854] Inordinate compile times on large
 routines
Date: Wed, 15 Feb 2023 14:05: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: 4.3.0
X-Bugzilla-Keywords: compile-time-hog, memory-hog
X-Bugzilla-Severity: normal
X-Bugzilla-Who: cvs-commit at gcc dot gnu.org
X-Bugzilla-Status: NEW
X-Bugzilla-Resolution: 
X-Bugzilla-Priority: P2
X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org
X-Bugzilla-Target-Milestone: ---
X-Bugzilla-Flags: 
X-Bugzilla-Changed-Fields: 
Message-ID: <bug-26854-4-D9DkJjDXDj@http.gcc.gnu.org/bugzilla/>
In-Reply-To: <bug-26854-4@http.gcc.gnu.org/bugzilla/>
References: <bug-26854-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
List-Id: <gcc-bugs.sourceware.org>

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

--- Comment #151 from CVS Commits <cvs-commit at gcc dot gnu.org> ---
The master branch has been updated by Richard Biener <rguenth@gcc.gnu.org>:

https://gcc.gnu.org/g:053d4dda0a205aba6af85fd9662118dd8109df9f

commit r13-6061-g053d4dda0a205aba6af85fd9662118dd8109df9f
Author: Richard Biener <rguenther@suse.de>
Date:   Tue Feb 14 14:46:47 2023 +0100

    Speedup DF dataflow solver

    The following makes sure to process blocks that follow the current
    block in the iteration order in the same iteration and only postpone
    blocks that would be visited earlier to the next iteration.

    For the all.i testcase in PR26854 at -O2 this shaves off 50% of
    the time to solve the DF RD problem, other problems also improve
    but not as drastically.

            PR middle-end/26854
            * df-core.cc (df_worklist_propagate_forward): Put later
            blocks on worklist and only earlier blocks on pending.
            (df_worklist_propagate_backward): Likewise.
            (df_worklist_dataflow_doublequeue): Change the iteration
            to process new blocks in the same iteration if that
            maintains the iteration order.=