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: optimization/6007: cfg cleanup tremendous performance hog with -O1

From: Richard Henderson <rth at redhat dot com>
To: Jan Hubicka <jh at suse dot cz>
Cc: Brad Lucier <lucier at math dot purdue dot edu>, David Edelsohn <dje at watson dot ibm dot com>, gcc at gcc dot gnu dot org, mark at codesourcery dot com, feeley at iro dot umontreal dot ca
Date: Mon, 25 Mar 2002 00:47:49 -0800
Subject: Re: optimization/6007: cfg cleanup tremendous performance hog with -O1
References: <20020322114115.GM22936@atrey.karlin.mff.cuni.cz> <200203250159.g2P1xGG24661@banach.math.purdue.edu> <20020325084109.GC22301@atrey.karlin.mff.cuni.cz>

On Mon, Mar 25, 2002 at 09:41:09AM +0100, Jan Hubicka wrote:
> The graph is already n^2 in size and I need to find matching outgoing edges
> running tiny loop as n^3 that probably makes difference.

We already look at the complexity of the cfg to decide whether or
not to run gcse.  No reason we can't do the same for crossjump.

r~

Follow-Ups:
- Re: optimization/6007: cfg cleanup tremendous performance hog with -O1
  - From: Jan Hubicka

References:
- Re: optimization/6007: cfg cleanup tremendous performance hog with -O1
  - From: Jan Hubicka
- Re: optimization/6007: cfg cleanup tremendous performance hog with -O1
  - From: Brad Lucier
- Re: optimization/6007: cfg cleanup tremendous performance hog with -O1
  - From: Jan Hubicka

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