From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 30808 invoked by alias); 7 Oct 2004 22:54:48 -0000 Mailing-List: contact gcc-bugs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-bugs-owner@gcc.gnu.org Received: (qmail 30793 invoked by uid 48); 7 Oct 2004 22:54:47 -0000 Date: Thu, 07 Oct 2004 22:54:00 -0000 Message-ID: <20041007225447.30792.qmail@sourceware.org> From: "pinskia at gcc dot gnu dot org" To: gcc-bugs@gcc.gnu.org In-Reply-To: <20040927204041.17704.tobi@gcc.gnu.org> References: <20040927204041.17704.tobi@gcc.gnu.org> Reply-To: gcc-bugzilla@gcc.gnu.org Subject: [Bug tree-optimization/17704] [4.0 Regression] Infinite recursion in tree-scalar-evolution with -Os X-Bugzilla-Reason: CC X-SW-Source: 2004-10/txt/msg00994.txt.bz2 List-Id: ------- Additional Comments From pinskia at gcc dot gnu dot org 2004-10-07 22:54 ------- Reduced testcase: GO TO 50 20 IF (IEXC.EQ.2) $ GO TO 80 50 IF (IEXC.GT.0) $ GO TO 20 80 K = K + 1 IF( IEXC.EQ.0) $ GO TO 20 DO 150 J = K, IEXC 150 CONTINUE RETURN END Here is a C testcase which makes this a dup of bug 17560: void MAIN__ () { int k; int j; int iexc; goto L50; L20: if (iexc == 2) goto L80; L50: if (iexc > 0) goto L20; L80: k++; if (iexc == 0) goto L20; for(j=k;j