[LLVMdev] Graph Coloring Regalloc

[Domagoj Babic]

Hi,

I'm not very familiar with the code generation, but this seems like a
good opportunity to ask...

Has anyone tried optimal graph coloring algorithms? Yeah, it's NP,
but the chances are that you are not looking at that many variables
at the same time. I'm wondering how much could one improve the
register allocation by using optimal algorithms, and how much impact
would that have on the speed of the produced native code?

Thx,
   Domagoj Babic