From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: by sourceware.org (Postfix, from userid 48) id CF51C3856606; Wed, 31 May 2023 11:27:09 +0000 (GMT) DKIM-Filter: OpenDKIM Filter v2.11.0 sourceware.org CF51C3856606 DKIM-Signature: v=1; a=rsa-sha256; c=relaxed/relaxed; d=gcc.gnu.org; s=default; t=1685532429; bh=F9N9X5lccKG6HIOdcTsYaD1hIFjHocHQPlmejJ9XIp4=; h=From:To:Subject:Date:In-Reply-To:References:From; b=PszXcy5wBNF+s1w8BaOz8W54Eha50ckbAmwz46HW87+KjNDmrNhfesExuvrfLNpx2 GyughPgNz3ho9D0rRo9O+0g4LHP8RFoXIMJag1atuMJdVgCRqB8aFKWFQOXIVUXnSe +WkGmu5GypcsImHovsaQqOVmhS8fUkFiS5JgKV44= From: "cvs-commit at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug ipa/109983] [12/13/14 regression] Wireshark compilation hangs with -O2 -fipa-pta Date: Wed, 31 May 2023 11:27:08 +0000 X-Bugzilla-Reason: CC X-Bugzilla-Type: changed X-Bugzilla-Watch-Reason: None X-Bugzilla-Product: gcc X-Bugzilla-Component: ipa X-Bugzilla-Version: 14.0 X-Bugzilla-Keywords: compile-time-hog X-Bugzilla-Severity: normal X-Bugzilla-Who: cvs-commit at gcc dot gnu.org X-Bugzilla-Status: ASSIGNED X-Bugzilla-Resolution: X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: rguenth at gcc dot gnu.org X-Bugzilla-Target-Milestone: 12.4 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=3D109983 --- Comment #14 from CVS Commits --- The master branch has been updated by Richard Biener : https://gcc.gnu.org/g:95e5c38a98cc64a797b1d766a20f8c0d0c807a74 commit r14-1429-g95e5c38a98cc64a797b1d766a20f8c0d0c807a74 Author: Richard Biener Date: Wed May 31 12:07:42 2023 +0200 ipa/109983 - (IPA) PTA speedup This improves the edge avoidance heuristic by re-ordering the topological sort of the graph to make sure the component with the ESCAPED node is processed first. This improves the number of created edges which directly correlates with the number of bitmap_ior_into calls from 141447426 to 239596 and the compile-time from 1083s to 3s. It also improves the compile-time for the related PR109143 from 81s to 27s. I've modernized the topological sorting API on the way as well. PR ipa/109983 PR tree-optimization/109143 * tree-ssa-structalias.cc (struct topo_info): Remove. (init_topo_info): Likewise. (free_topo_info): Likewise. (compute_topo_order): Simplify API, put the component with ESCAPED last so it's processed first. (topo_visit): Adjust. (solve_graph): Likewise.=