From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 7706 invoked by alias); 9 Nov 2011 09:00:22 -0000 Received: (qmail 7693 invoked by uid 22791); 9 Nov 2011 09:00:20 -0000 X-SWARE-Spam-Status: No, hits=-2.9 required=5.0 tests=ALL_TRUSTED,AWL,BAYES_00 X-Spam-Check-By: sourceware.org Received: from localhost (HELO gcc.gnu.org) (127.0.0.1) by sourceware.org (qpsmtpd/0.43rc1) with ESMTP; Wed, 09 Nov 2011 09:00:07 +0000 From: "jakub at gcc dot gnu.org" To: gcc-bugs@gcc.gnu.org Subject: [Bug tree-optimization/51042] [4.7 Regression] endless recursion in phi_translate Date: Wed, 09 Nov 2011 09:15:00 -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-Keywords: X-Bugzilla-Severity: normal X-Bugzilla-Who: jakub at gcc dot gnu.org X-Bugzilla-Status: NEW X-Bugzilla-Priority: P3 X-Bugzilla-Assigned-To: unassigned at gcc dot gnu.org X-Bugzilla-Target-Milestone: 4.7.0 X-Bugzilla-Changed-Fields: Status Last reconfirmed CC Component Target Milestone Summary Ever Confirmed Message-ID: In-Reply-To: References: X-Bugzilla-URL: http://gcc.gnu.org/bugzilla/ Auto-Submitted: auto-generated Content-Type: text/plain; charset="UTF-8" MIME-Version: 1.0 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: 2011-11/txt/msg00880.txt.bz2 http://gcc.gnu.org/bugzilla/show_bug.cgi?id=51042 Jakub Jelinek changed: What |Removed |Added ---------------------------------------------------------------------------- Status|UNCONFIRMED |NEW Last reconfirmed| |2011-11-09 CC| |jakub at gcc dot gnu.org Component|c |tree-optimization Target Milestone|--- |4.7.0 Summary|segfault |[4.7 Regression] endless | |recursion in phi_translate Ever Confirmed|0 |1 --- Comment #1 from Jakub Jelinek 2011-11-09 08:59:47 UTC --- Caused by http://gcc.gnu.org/viewcvs?root=gcc&view=rev&rev=155360 int a, b, c, d, e[2][2]; void foo (int x) { while (x) { for (d = 0; d <= 1; d = 1) if (e[c][a]) break; for (b = 0; b <= 0; b = 1) { e[c][a] = a; if (a) break; } } }