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: Factoring algorithms on rtl ?

From: Gábor Lóki <loki at inf dot u-szeged dot hu>
To: Joern Rennecke <joern dot rennecke at superh dot com>
Cc: Jan Hubicka <hubicka at ucw dot cz>, Jim Wilson <wilson at specifixinc dot com>, gcc at gcc dot gnu dot org
Date: Thu, 19 Feb 2004 09:33:51 +0100
Subject: Re: Factoring algorithms on rtl ?
References: <200402181642.i1IGgtj18733@linsvr1.uk.superh.com>

Joern Rennecke wrote:

We would very much like to continue this work, because even in this very
simple code motion algorithm we have extra gain beside the mentioned
algorithm when optimizing for size. I expect significant reductions from
the more sophisticated factorings. Do you support this?

I wonder how to make sure that local registers are actually local to
the common sequences.  Do we have accurate REG_DEAD notes at the
point you want to do this factoring?


No. The patch uses the def-use info to decide if the change could be
done.

References:
- Re: Factoring algorithms on rtl ?
  - From: Joern Rennecke

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