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: hubicka at ucw dot cz (Jan Hubicka)
- Cc: wilson at specifixinc dot com (Jim Wilson), loki at inf dot u-szeged dot hu (Gábor Lóki), gcc at gcc dot gnu dot org
- Date: Tue, 17 Feb 2004 23:04:52 +0000 (GMT)
- Subject: Re: Factoring algorithms on rtl ?
>
> > Gábor Lóki wrote:
> > >The attached patch finds those basic blocks of which the first insns
> > >are indentical, and factor out them into the end of parent basic blocks.
> > >This is done only if it has no side effects and the count of original
> > >insns - marked for factoring - is greater than the count of parent basic
> > >blocks.
> >
> > This seems to be the same optmization as cross-jumping, except that
> > cross-jumping only handles the suffix case, and you are trying to handle
> > both prefix and suffix cases.
While my if-convert code handles just the complete equivalence case, but
allows for local registers and an input register. I've started it rewriting
it so that it scans from the end of the block so that the code can be
shared with crossjumping...