search for: basicc

Hi Fernando, > Hi, Roman, > > we have an implementation of an allocator for LLVM that, like > Sarkar's, allows to split live ranges at any program point. You can > find > its description here: > > http://compilers.cs.ucla.edu/fernando/publications/drafts/long_PereiraPalsberg07.pdf > I've read your paper already. It is a very interesting approach! But

Hi Fernando, For some reason, I discovered your mail just today. Fernando Magno Quintao Pereira wrote: > > Hi, Roman, > >> Well, I cannot find anything about in my copy of the paper. The paper >> neither talk about splitting in the interior of basicc blocks, nor >> about handling of pre-colored registers. And Sarkar also does not claim >> the optimality of the algorithm. He claims that it is inherently more >> scalable and efficient, i.e. linear as compared to O(n^2) for Graph >> coloring. >> >> But of course...

> Actually, Sarkar's algorithm can split only at block boundaries, as far > as I understand. This can be an obstacle for very long basic blocks. > One of the interesting ideas could be to introduce live-range splitting > into his algorithm. As far as I understand it, it can also split in the interior of basic blocks, because of pre-colored registers, otherwise it would not be