[LLVMdev] Graph Coloring Regalloc

[Roman Levenstein]

--- David Greene <greened at obbligato.org> wrote:

> Roman Levenstein wrote:
> > The allocator does not handle register aliases and register classes
> > correctly, which makes it rather unusable for most architectures.
> One
> > idea that can be used for improving handling of irregular
> architectures
> > is described in the "A Generalized Algorithm for Graph-Coloring
> > Register Allocation" by Michael D. Smith, Norman Ramsey and Glenn
> > Holloway:
> > http://www.eecs.harvard.edu/~nr/pubs/gcra-abstract.html
> > 
> > There exists also an implementation of the algorithm described in
> the
> > paper for the SUIF compiler suite. I was planning to port it to
> LLVM,
> > but a bit later. 
> 
> Are you saying the SUIF allocator implements the
> Smith/Ramsey/Holloway algorithm, or something different?

Yes, the SUIF allocator (or at least one of them) implements the
Smith/Ramsey/Holloway algorithm. This is what I understand by looking
at the coloring reggister allocator code in the SUIF distribution. The
SUIF code of this allocator is not very well commented, but I'm pretty
sure.

Roman


 
____________________________________________________________________________________
8:00? 8:25? 8:40? Find a flick in no time 
with the Yahoo! Search movie showtime shortcut.
http://tools.search.yahoo.com/shortcuts/#news