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: [RFC] propagating loop dependences from trees to RTL (for SMS)

From: Devang Patel <dpatel at apple dot com>
To: Steven Bosscher <stevenb at suse dot de>, Daniel Berlin <dberlin at dberlin dot org>
Cc: Zdenek Dvorak <rakdver at atrey dot karlin dot mff dot cuni dot cz>, Vladimir Yanovsky <YANOV at il dot ibm dot com>, GCC Development <gcc at gcc dot gnu dot org>
Date: Thu, 22 Sep 2005 18:49:51 -0700
Subject: Re: [RFC] propagating loop dependences from trees to RTL (for SMS)
References: <OF27A331BB.8D5F00AC-ON43257083.005BA8C5-43257083.005BCC4C@il.ibm.com> <20050922092527.GB17926@atrey.karlin.mff.cuni.cz> <3194312.1127381579546.SLOX.WebMail.wwwrun@extimap.suse.de>

On Sep 22, 2005, at 2:32 AM, Steven Bosscher wrote:

On Sep 22, 2005 11:25 AM, Zdenek Dvorak <rakdver@atrey.karlin.mff.cuni.cz> wrote:

4. Other ideas?

Preserving the information about loops throughout the optimizations, and just keeping this information attached at the loop description would by far be the cleanest approach -- admitedly also the one that requires the greatest amount of work.

Shouldn't the regions patch allow us to preserve loops quite easily?


Any pointer to this "regions patch" ?
Thanks,
-
Devang

Follow-Ups:
- Re: [RFC] propagating loop dependences from trees to RTL (for SMS)
  - From: Daniel Berlin

References:
- [RFC] propagating loop dependences from trees to RTL (for SMS)
  - From: Vladimir Yanovsky
- Re: [RFC] propagating loop dependences from trees to RTL (for SMS)
  - From: Zdenek Dvorak
- Re: [RFC] propagating loop dependences from trees to RTL (for SMS)
  - From: Steven Bosscher

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