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: Joern Rennecke <joern dot rennecke at superh dot com>,Jan Hubicka <hubicka at ucw dot cz>, gcc at gcc dot gnu dot org
Date: 18 Feb 2004 12:04:53 -0800
Subject: Re: Factoring algorithms on rtl ?
References: <200402172304.i1HN4qR19092@linsvr3.uk.superh.com> <4033387E.1020803@inf.u-szeged.hu>

On Wed, 2004-02-18 at 02:03, GÃbor LÃki 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 have taken no position on this work.  I simply pointed out that it
appeared to be a generalization of cross-jumping, which is something you
didn't mention, so I wasn't sure if you were aware of it.

I don't have time to support optimization work, I have only been
focusing on bug fixing and maintenance work.
-- 
Jim Wilson, GNU Tools Support, http://www.SpecifixInc.com

Follow-Ups:
- Re: Factoring algorithms on rtl ?
  - From: Daniel Berlin

References:
- Re: Factoring algorithms on rtl ?
  - From: Joern Rennecke
- Re: 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]