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: Pop Sébastian <pop at gauvain dot u-strasbg dot fr>
To: Daniel Berlin <dberlin at dberlin dot org>
Cc: gcc at gcc dot gnu dot org
Date: Fri, 28 Feb 2003 11:39:34 +0100
Subject: Re: Dropping of old loop optimizer
References: <20030227161448.GB15920@gauvain.u-strasbg.fr> <D57BBB0E-4A87-11D7-8451-000393575BCC@dberlin.org>

On Thu, Feb 27, 2003 at 02:15:29PM -0500, Daniel Berlin wrote:
> 
> 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.
> 
You're right.  I just read the old version of their paper, in the new one 
they extend ME to distance intervals.  However I'm not yet convinced why 
ME is faster than CR even when ME computes closed forms... 

	Sebastian

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

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