search for: braun09cc

...t least two projects that were using BigBlock, directly or indirectly. One approach is described in the paper "Register Spilling and Live-Range Splitting for SSA-Form Programs" by Matthias Braun and Sebastian Hack. It can be found here: http://pp.info.uni-karlsruhe.de/publication.php?id=braun09cc http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf This approach uses an approach similar to the BigBlock allocator (i.e. the MIN algorithm), but extends it from basic blocks to the whole CFG of a function and does it at the SSA level. The implementation is available as part of th...

Hi all, I'd like to kill off the bigblock register allocator. Is anyone still using it? Cheers, Lang.

Hi I just stumbled upon this paper. While i just skimmed over it it seems as if the authors say that their algorithm is more efficient than the llvm 2.3 algorithm? So i thought that might be interesting? http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf Disclaimer: I have no affiliation with the authors and stumbled in a slightly unrelated search over this paper. ST

..., I think it should be removed. -Chris > > One approach is described in the paper "Register Spilling and > Live-Range Splitting for SSA-Form Programs" by Matthias Braun and > Sebastian Hack. > It can be found here: > http://pp.info.uni-karlsruhe.de/publication.php?id=braun09cc > http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf > This approach uses an approach similar to the BigBlock allocator (i.e. > the MIN algorithm), but extends it from basic blocks to the whole CFG > of a function and does it at the SSA level. The implementation is >...

...wrote: > Hi > > I just stumbled upon this paper. While i just skimmed over it it seems as > if the authors say that their algorithm is more efficient than the llvm 2.3 > algorithm? So i thought that might be interesting? > > http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf Don't trust it. The abstract clearly states they're counting the number of dynamic spills. That has almost nothing to do with performance. Someone would have to reproduce their experiment to verify that performance indeed improves. And alas, our field is notoriously unscientific i...

...ne again. -Roman >> >> One approach is described in the paper "Register Spilling and >> Live-Range Splitting for SSA-Form Programs" by Matthias Braun and >> Sebastian Hack. >> It can be found here: >> http://pp.info.uni-karlsruhe.de/publication.php?id=braun09cc >> http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf >> This approach uses an approach similar to the BigBlock allocator (i.e. >> the MIN algorithm), but extends it from basic blocks to the whole CFG >> of a function and does it at the SSA level. The implem...

For spilling, I plan to use the Hack-Braun generalization of the furthest-first heuristic for SSA: http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf For coloring, there are a few different approaches you can take, e.g. dominator tree scan, puzzle-solving, or a modified graph coloring / coalescing heuristic like IRC. The best quality for the least amount of implementation effort is probably a dominator tree scan with register preferences, s...

...> I just stumbled upon this paper. While i just skimmed over it it seems as > > if the authors say that their algorithm is more efficient than the llvm 2.3 > > algorithm? So i thought that might be interesting? > > > > http://pp.info.uni-karlsruhe.de/uploads/publikationen/braun09cc.pdf As the author of this paper I have to defend it now (of course ;-) > > Don't trust it. The abstract clearly states they're counting the number of > dynamic spills. That has almost nothing to do with performance. So if not the number of dynamic spills/reloads and remateria...

The allocator you are building, is it the Hack's and Goos's polynomial time algorithm? On Tue, Oct 5, 2010 at 7:14 PM, Cameron Zwarich <zwarich at apple.com> wrote: > There is nothing that currently handles this properly, as far as I know. If you have a phi > > c = phi(a, b) > > where a, b and c are all assigned distinct stack slots, then copies must be inserted in