From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Received: (qmail 13141 invoked by alias); 18 Feb 2003 08:14:53 -0000 Mailing-List: contact gcc-prs-help@gcc.gnu.org; run by ezmlm Precedence: bulk List-Archive: List-Post: List-Help: Sender: gcc-prs-owner@gcc.gnu.org Received: (qmail 13111 invoked by uid 48); 18 Feb 2003 08:14:53 -0000 Date: Tue, 18 Feb 2003 08:14:00 -0000 Message-ID: <20030218081453.13110.qmail@sources.redhat.com> To: binsh00@hotmail.com, gcc-bugs@gcc.gnu.org, gcc-prs@gcc.gnu.org, nobody@gcc.gnu.org From: ebotcazou@gcc.gnu.org Reply-To: ebotcazou@gcc.gnu.org, binsh00@hotmail.com, gcc-bugs@gcc.gnu.org, gcc-prs@gcc.gnu.org, nobody@gcc.gnu.org, gcc-gnats@gcc.gnu.org Subject: Re: optimization/9553: No induction variable elimination X-SW-Source: 2003-02/txt/msg00775.txt.bz2 List-Id: Synopsis: No induction variable elimination State-Changed-From-To: open->analyzed State-Changed-By: ebotcazou State-Changed-When: Tue Feb 18 08:14:53 2003 State-Changed-Why: Confirmed. GCC doesn't know how to prove that two (independent) basic induction variables are equal throughout the whole loop. I'm not sure whether that would be really useful in practice though. http://gcc.gnu.org/cgi-bin/gnatsweb.pl?cmd=view%20audit-trail&database=gcc&pr=9553