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]

Re: if-conversion a performance bottleneck

To: Michael Matz <matzmich at cs dot tu-berlin dot de>
Subject: Re: if-conversion a performance bottleneck
From: Richard Henderson <rth at cygnus dot com>
Date: Thu, 4 May 2000 11:54:59 -0700
Cc: Brad Lucier <lucier at math dot purdue dot edu>, gcc at gcc dot gnu dot org
References: <Pine.SOL.4.10.10005021433160.25835-100000@platon> <Pine.SOL.4.10.10005030741450.1121-200000@platon>

On Wed, May 03, 2000 at 07:53:00AM +0200, Michael Matz wrote:
> I then also implemented a poor man's topological sort for cyclic graphs
> ;), which again gave a better performance. (I also did this once for doms,
> but there it didn't make a great difference on Brads test cases)

Would you split this off into a new function?  Perhaps called
order_bb_for_backward_flow or something?  This could be useful elsewhere.

r~

References:
- Re: if-conversion a performance bottleneck
  - From: Michael Matz
- Re: if-conversion a performance bottleneck
  - From: Michael Matz

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