Date: Mon, 4 Oct 1999 11:12:32 +0300 (EEST)
From: Erhan Bilgili <erhan AT altay DOT adm DOT deu DOT edu DOT tr>
To: pgcc AT delorie DOT com
cc: grenie AT math DOT jussieu DOT fr
Subject: Re: Optimization pug in pgcc-2.95.1
In-Reply-To: <199910031434.QAA10824@riemann.math.jussieu.fr>
Message-ID: <Pine.LNX.4.10.9910041110080.1235-100000@altay.adm.deu.edu.tr>
MIME-Version: 1.0
Content-Type: TEXT/PLAIN; charset=US-ASCII
Reply-To: pgcc AT delorie DOT com
X-Mailing-List: pgcc AT delorie DOT com
X-Unsubscribes-To: listserv AT delorie DOT com
Precedence: bulk


>      Hello,
> 
>      I've found a bug in pgcc-2.95.1. When I compile the following program:
> 
> func(void)
> {
>     int tab[512], i;
> 
>     for (i = 0; i < 511; i++)
>         tab[i+1] = tab[i];
> }
> 

	hello,

	did not check the sources , but -fno-comapre-elim does not
	not generate code that segfaults.

	Erhan Bilgili