search for: libfirm

Hi, The libFirm library ( http://www.info.uni-karlsruhe.de/software/libfirm/index.php?title=Main_Page ) is GPLed some time ago. libFirm is a library that provides an intermediate representation and optimizations for compilers. Programs are represented in a graph based SSA form. Several targets are supported, espe...

On 08/22/2017 03:59 AM, Alex Bradbury via llvm-dev wrote: > On 21 August 2017 at 13:23, Martin J. O'Riordan via llvm-dev > <llvm-dev at lists.llvm.org> wrote: >> But there is a downside. >> >> For each of the above I also have variations that are a result of different >> processor and ISA versions, and because of this I have to use >> ‘multiclass/defm’

...x86 code than llvm-2.3 for several spec benchmarks (and produce way slower code for some others where I suspect missing architecture neutral optimisations in firm). > > Someone would have to reproduce their experiment to verify that performance > indeed improves. You can easily download libfirm-1.17.0 and cparser-0.9.9 from http://www.libfirm.org and see for yourself. If you're interested in the valgrind hacks to count the spills/reloads, I uploaded them here: pp.info.uni-karlsruhe.de/~matze/valgrind-3.5.0-countmem.tgz (there's a new valgrind plugin called 'countmem' in i...

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

On Thursday 14 January 2010 15:56, ST 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

...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 the libFirm project. Another research project can be found here: http://www.contrib.andrew.cmu.edu/~jbauman/15745/ It seems to be based on LLVM's BigBlock and takes some inspiration from the paper mentioned above. In both cases, register allocators produce results that are quite comparable or even signif...

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

...arlsruhe.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 the libFirm project. > > Another research project can be found here: > http://www.contrib.andrew.cmu.edu/~jbauman/15745/ > It seems to be based on LLVM's BigBlock and takes some inspiration > from the paper mentioned above. > > In both cases, register allocators produce results that ar...

...ads/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 the libFirm project. >> >> Another research project can be found here: >> http://www.contrib.andrew.cmu.edu/~jbauman/15745/ >> It seems to be based on LLVM's BigBlock and takes some inspiration >> from the paper mentioned above. >> >> In both cases, register alloca...

Hi Leslie, I suggest adding these 3 papers to your reading list. Register allocation for programs in SSA-form Sebastian Hack, Daniel Grund, and Gerhard Goos http://www.rw.cdl.uni-saarland.de/~grund/papers/cc06-ra_ssa.pdf Simple and Efficient Construction of Static Single Assignment Form Matthias Braun , Sebastian Buchwald , Sebastian Hack , Roland Leißa , Christoph Mallon , and Andreas