Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| Graph Coloring rsherry8@comcast.net (Robert Sherry) (2004-02-01) |
| Re: Graph Coloring jle@forest.owlnet.rice.edu (2004-02-04) |
| Re: graph coloring Robert.Thorpe@antenova.com (Robert Thorpe) (2004-02-08) |
| Re: graph coloring jmcenerney@austin.rr.com (John McEnerney) (2004-02-12) |
| Re: Graph Coloring touati@prism.uvsq.fr (TOUATI Sid) (2004-02-12) |
| graph coloring bsr@cs.clemson.edu (Ramesh B S) (1996-03-20) |
| Re: graph coloring dgillies@hpax.cup.hp.com (David Gillies) (1996-03-22) |
| Re: graph coloring napi@ms.mimos.my (1996-03-25) |
| graph coloring meleis@ece.neu.edu (1997-06-13) |
| From: | David Gillies <dgillies@hpax.cup.hp.com> |
| Newsgroups: | comp.compilers |
| Date: | 22 Mar 1996 21:34:44 -0500 |
| Organization: | Hewlett Packard California Language Lab |
| References: | 96-03-124 |
| Keywords: | optimize |
Ramesh B S wrote:
> Are there any standard compilers that use any of the graph coloring
> techniques (like live range analysis, hierarchical coloring etc) to do
> register allocation?
Sure, there's lots of production compilers that use graph coloring
register allocators. I know from first hand experience that the HP
PA-Risc and IBM XL-series compilers use graph coloring techniques that
essentially boil down to Chaitin's method. However, I think gcc does
not in order to avoid any conflict with IBM's patent on the technique.
Maybe someone can confirm this.
Dave Gillies
Hewlett Packard
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.