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: Jim Wilson <wilson at specifixinc dot com>
To: Gábor Lóki <loki at inf dot u-szeged dot hu>
Cc: gcc at gcc dot gnu dot org
Date: Tue, 17 Feb 2004 13:18:18 -0800
Subject: Re: Factoring algorithms on rtl ?
References: <403205E4.8080007@inf.u-szeged.hu>

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.

See try_crossjump_bb in cfgcleanup.c.
--
Jim Wilson, GNU Tools Support, http://www.SpecifixInc.com

Follow-Ups:
- Re: Factoring algorithms on rtl ?
  - From: Jan Hubicka

References:
- Factoring algorithms on rtl ?
  - From: Gábor Lóki

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