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: Graph coloring for register allocation?

To: Daniel Berlin <dberlin at redhat dot com>
Subject: Re: Graph coloring for register allocation?
From: Richard Henderson <rth at redhat dot com>
Date: Mon, 22 Jan 2001 14:23:24 -0800
Cc: Michael Matz <matzmich at cs dot tu-berlin dot de>, Michael Hayes <m dot hayes at elec dot canterbury dot ac dot nz>, Robert Dewar <dewar at gnat dot com>, Untitled <gcc at gcc dot gnu dot org>, Stan Shebs <shebs at apple dot com>
References: <Pine.LNX.4.31.0101211250250.4158-100000@www.cgsoftware.com> <Pine.LNX.4.31.0101211641250.6684-100000@www.cgsoftware.com>

On Sun, Jan 21, 2001 at 04:44:20PM -0500, Daniel Berlin wrote:
> Also, it gets rid of reload unless it's comment at the top of the file is
> lying (we can force).

No, you'll never get rid of reload.  Not without replicating
it anyway, which seems a less than winning proposition.

It's job is to fix up the mistakes the register allocator makes.
As such, the best you can do is give it no work to do by finding
a perfect allocation.

r~

Follow-Ups:
- Re: Graph coloring for register allocation?
  - From: Daniel Berlin

References:
- Re: Graph coloring for register allocation?
  - From: Daniel Berlin
- Re: Graph coloring for register allocation?
  - From: Daniel Berlin

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