This is the mail archive of the
mailing list for the GCC project.
Re: Graph coloring for register allocation?
- To: Richard Henderson <rth at redhat dot com>
- Subject: Re: Graph coloring for register allocation?
- From: Daniel Berlin <dberlin at redhat dot com>
- Date: Mon, 22 Jan 2001 17:31:17 -0500 (EST)
- cc: Daniel Berlin <dberlin at redhat dot com>, 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>
On Mon, 22 Jan 2001, Richard Henderson wrote:
> 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.
Thinks like forcing things that need to be in hard regs into hard regs,
making sure certain things have certain registers, combinations of
these two, etc, are already going to be taken care of for us by the new
> As such, the best you can do is give it no work to do by finding
> a perfect allocation.