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: Dropping of old loop optimizer

From: Daniel Berlin <dberlin at dberlin dot org>
To: Pop Sébastian <pop at gauvain dot u-strasbg dot fr>
Cc: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>,tm_gccmail at mail dot kloo dot net,gcc at gcc dot gnu dot org,m dot hayes at elec dot canterbury dot ac dot nz,rth at redhat dot com,law at redhat dot com,dan at dberlin dot org,jh at suse dot cz
Date: Thu, 27 Feb 2003 14:15:29 -0500
Subject: Re: Dropping of old loop optimizer

On Thursday, February 27, 2003, at 11:14 AM, Pop Sébastian wrote:

On Thu, Feb 27, 2003 at 10:43:28AM -0500, Daniel Berlin wrote:
I had started to work on this method, but decided it was too complex,
and moved to monotonic evolution.
In contrast to the CR method, monotonic evolution (ME) gives approximate data dependences: you'll have the direction but not the distance vector of a dependence. Fact: not all optimizers use approximate vectors.

Um, actually, all the papers i have on ME describe a distance extended lattice to solve this problem. I wouldn't have considered ME if it couldn't do distance information.

Follow-Ups:
- Re: Dropping of old loop optimizer
  - From: Pop Sébastian

References:
- Re: Dropping of old loop optimizer
  - From: Pop Sébastian

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