This is the mail archive of the gcc-patches@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: limit code expansion on ifcvt - bbro too?

From: Jan Hubicka <jh at suse dot cz>
To: Richard Henderson <rth at redhat dot com>, tm <tm at mail dot kloo dot net>,jh at suse dot cz, gcc-patches at gcc dot gnu dot org
Date: Wed, 20 Nov 2002 00:37:45 +0100
Subject: Re: limit code expansion on ifcvt - bbro too?
References: <Pine.LNX.4.21.0211181530330.14263-100000@mail.kloo.net> <20021119233521.GN9962@redhat.com>

> On Mon, Nov 18, 2002 at 03:36:20PM -0800, tm wrote:
> > Is maybe_hot_bb_p usable for limiting code expansion on BBRO as well?
> > If so, I'll try to submit a patch for it.
> 
> Instead of spending so much effort trying to selectively disable
> parts of BBRO, why don't you come up with a placement algorithm
> that minimizes (1) branches or (2) sum of branch insn sizes.
> 
> It shouldn't be _that_ hard.
It is NP complette of course :)
But I remember seeing paper with pretty nice sollution, unforutnately I
can't find the citation right now.  I can check harder if needed.  THis
has been studied for embedded machines quite well.

Honza
> 
> 
> r~

References:
- limit code expansion on ifcvt - bbro too?
  - From: tm
- Re: limit code expansion on ifcvt - bbro too?
  - From: Richard Henderson

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