From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 8607 invoked by alias); 22 Dec 2009 14:57:05 -0000 Received: (qmail 8578 invoked by uid 48); 22 Dec 2009 14:56:53 -0000 Date: Tue, 22 Dec 2009 14:57:00 -0000 Message-ID: <20091222145653.8577.qmail@sourceware.org> X-Bugzilla-Reason: CC References: Subject: [Bug tree-optimization/40760] [4.3/4.4/4.5 Regression] unbounded recursion in the gimplifier In-Reply-To: Reply-To: gcc-bugzilla@gcc.gnu.org To: gcc-bugs@gcc.gnu.org From: "aldyh 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: 2009-12/txt/msg02113.txt.bz2 ------- Comment #2 from aldyh at gcc dot gnu dot org 2009-12-22 14:56 ------- The problem here is a recursive call to gimplify_stmt in gimplify_cond_expr with the true/false statements. This would only happen on thousands of nested ifs. Should this really be a P2? Can't we change this to a won't fix? I can't see this happening in real code. -- http://gcc.gnu.org/bugzilla/show_bug.cgi?id=40760