search for: long_pereirapalsberg07

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 We handle register classes using an abstraction called puzzles. Also, we perform register allocation while the program is still in SSA-form. This requires breaking critical edges before RA, and removing phi-functions while taking register assignment in consideration, once RA is done. We ha...

Hi David, --- David Greene <dag at cray.com> schrieb: > On Thursday 31 January 2008 07:05, Roman Levenstein wrote: > > > I already started work on the implementation of this algorithm and > have > > a few hopefully rather simple questions: > > Roman, > > I'm excited to hear that you are working on this algorithm. Do you > plan to contribute it

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 my impression was that it is rather complex solution and requires quite some bits of implementation. I also looked at your sources. Looks like they introduce a lot of new code into LLVM. IMHO, one of the attractiv...