This is the mail archive of the
gcc@gcc.gnu.org
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: Daniel Berlin <dberlin at redhat dot com>
- Date: Sun, 21 Jan 2001 16:44:20 -0500 (EST)
- 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>
>
> 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?
Also, it gets rid of reload unless it's comment at the top of the file is
lying (we can force).
That means we replace about 25000 lines of code (24,775 according to wc)
with like 1000 or 2000.
If you can do something in 25x less code than you do now, it usually means
your current way is a *bit* complex.
--Dan