search for: cparser

...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 it). Greetings, Ma...

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

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, especially the x86. Many optimizations are very similar to those of LLVM. But there are