This is the mail archive of the
mailing list for the GCC project.
Re: Graph coloring for register allocation?
- To: Daniel Berlin <dberlin at redhat dot com>
- Subject: Re: Graph coloring for register allocation?
- From: Michael Matz <matzmich at cs dot tu-berlin dot de>
- Date: Tue, 23 Jan 2001 12:22:14 +0100 (MET)
- cc: 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 Sun, 21 Jan 2001, Daniel Berlin wrote:
> > Yep, I have them, but not looked at them closely due to missing time.
> > Also, meanwhile I was playing with the thought of building the
> > interference graph incrementally (as proposed in one of the newer
> > articles), and for that u/d-d/u-chains are not the best source. But at
> > least for gathering the info your routines seem very handy.
> What papers show how to build it incrementally?
> I couldn't find any.
Well, not incrementally, but sparse construction which can be more easily
extended for incremental updates (it only needs all def/use site of a
variable, no global information, and no incremental update of local
liveness per basic block). It's from the MLRISC guys in their new register
> Because there are so many implementations available, i've started with
> Iterated Register Coalescing, and will convert it to optimistic when it's
> Works well so far.
Cool. Any code, CVS branches or similar stuff?
> Just so we are all on the same page, everyone realizes that the new
> register allocator will replace the regmove, the local-alloc, and the
> global-alloc passes, right?
Yep, and probably much (though not all) of reload*.c.