From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 11346 invoked by alias); 14 Feb 2008 23:25:46 -0000 Received: (qmail 8861 invoked by uid 48); 14 Feb 2008 23:25:03 -0000 Date: Thu, 14 Feb 2008 23:25:00 -0000 Message-ID: <20080214232503.8858.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug middle-end/35204] [4.3 Regression] crash by too deep recursion in DFS tree-ssa-sccvn.c:1898 In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "steven at gcc dot gnu dot org" Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Id: List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org X-SW-Source: 2008-02/txt/msg01603.txt.bz2 ------- Comment #6 from steven at gcc dot gnu dot org 2008-02-14 23:25 ------- Should be P1. This bug is shows an intrinsic scalability problem with SCC-VN as it is implemented right now (and presented in the literature). The key issue is, SCC-VN should use a non-recursive SCC finding algorithm, but one that still pops the SCCs in topological order. I tried once to write SCC-VN's DFS in a non-recursive way, but I never succeeded. I also tried to find a substitute for Tarjan's algorithm that possesses the properties required for SCC-VN, but also failed there. CCing Danny on this one for advice. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=35204