[LLVMdev] Register Allocation by Graph Coloring

[Fernando Magno Quintao Pereira]

Hi, Prabhat,

     I have the implementation of a register allocator at 
http://compilers.cs.ucla.edu/fernando/projects/puzzles
     It is not graph-based, but if you want to use it, I would be happy 
to help you to install. It is working for LLVM 2.1.

best,

Fernando

> Dear all,
> I was looking for to compile some benchmarks and generate code using
> different register allocation algorithms. As i can see, the built in
> options for register allocation in llvm are
> 1. Simple
> 2. Local
> 3. Linear Scan
>
> I want to compare the generating code also with a graph coloring based
> register allocation approach. Is this also built in by default by
> llvm. Are there some other projects, whose code i can borrow for this
> task.
>
> To summarize: I want to compare the generated code of various
> benchmarks (generated using linear scan based reg allocation vs graph
> based register allocation).
>
> Any suggestions would be helpful.
>
> Regards
> Prabhat
> _______________________________________________
> LLVM Developers mailing list
> LLVMdev at cs.uiuc.edu         http://llvm.cs.uiuc.edu
> http://lists.cs.uiuc.edu/mailman/listinfo/llvmdev
>