search for: addintervalforspil

...rithms. I think having some special iterator > functions for that in the LiveIntervalAnalysis class could be very > useful for this purpose. And implementation should be fairly > straightforward by using the information about the beginning and end > points of live ranges. Well yes, See addIntervalForSpills. Iterating through the liveranges, then for each liverange iterate through every instruction index. It's not very inefficient though. > > > 3) This question is related to the previous one. For computation of > spill costs by some register allocation algorithms, it is required...

Hi, I'm trying to sketch an LLVM-based implementation of the Extended Linear Scan algorithm, described in this Vivek Sarkar's paper: http://www.cs.rice.edu/~vs3/PDF/cc2007.pdf Sarkar reports that this version of Linear Scan produces better code than graph-coloring regallocs and is also much faster (15x to 68x). I already started work on the implementation of this algorithm and have a few