This is the mail archive of the gcc@gcc.gnu.org mailing list for the GCC project.

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]
Other format:	[Raw text]

Re: loop optimizations

From: Richard Henderson <rth at redhat dot com>
To: Jan Hubicka <jh at suse dot cz>
Cc: Marko Mlinar <markom at opencores dot org>, gcc at gcc dot gnu dot org
Date: Fri, 25 Jan 2002 16:41:47 -0800
Subject: Re: loop optimizations
References: <017201c1a577$4aa800a0$4901010a@tyr> <20020125233109.GB816@atrey.karlin.mff.cuni.cz>

On Sat, Jan 26, 2002 at 12:31:09AM +0100, Jan Hubicka wrote:
> Not exactly.  Gcc is able to do loop reversal that would do the trick you
> suggest, but only when the induction variable (i) is used only as the
> iteration counter, not for something else. (or gcc figures out way how to
> replace that uses by different construct, such as autoincrement addressing).

We'll do this when generating decrement-and-branch instructions.


r~

References:
- loop optimizations
  - From: Marko Mlinar
- Re: loop optimizations
  - From: Jan Hubicka

Index Nav:	[Date Index] [Subject Index] [Author Index] [Thread Index]
Message Nav:	[Date Prev] [Date Next]	[Thread Prev] [Thread Next]