Re: gcc 3.1 + graph coloring based reg alloc
On Fri, Apr 26, 2002 at 08:34:21AM -0700, Viral Shah wrote:
> Hello list,
>
> Looking at the projects on gcc.gnu.org, one sees work
> being done on a new graph coloring based register
> allocator for gcc 3.1. I hear that it might even make
> its way into 3.1..
No, it won't. It matured too late.
> The gcc open projects page only says:
>
> New register allocator
>
> Daniel Berlin and Michael Matz are working on an implementation of
> a graph-coloring register allocator. A branch is created in CVS
> with the tag new-regalloc-branch. It is known to bootstrap under
> x86-linux and ppc-linux.
>
> This could obviously result in great improvements for ppc. Has
> anyone tried it, has any performance data etc ?
> I want to ask the list before trying it out myself, if
> I do get around to actually doing it ;-)
You'll have to use a cvs snapshot from that particular branch. It
won't be merged for another month at least.
--
Daniel Jacobowitz Carnegie Mellon University
MontaVista Software Debian GNU/Linux Developer
--
To UNSUBSCRIBE, email to debian-powerpc-request@lists.debian.org
with a subject of "unsubscribe". Trouble? Contact listmaster@lists.debian.org
Reply to: