This is the mail archive of the
gcc@gcc.gnu.org
mailing list for the GCC project.
Re: Factoring algorithms on rtl ?
- From: Joern Rennecke <joern dot rennecke at superh dot com>
- To: loki at inf dot u-szeged dot hu (Gábor Lóki)
- Cc: joern dot rennecke at superh dot com (Joern Rennecke), hubicka at ucw dot cz (Jan Hubicka), wilson at specifixinc dot com (Jim Wilson), gcc at gcc dot gnu dot org
- Date: Wed, 18 Feb 2004 16:42:55 +0000 (GMT)
- Subject: Re: Factoring algorithms on rtl ?
> 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?