I've tried PBQP in the past. Not sure if I've tried with 2.9. In the past it had compilation problems and didn't really have much of an affect on the performance. It would be worthwhile trying again in 3.0 and with the alias analysis pass.
On 2 October 2011 10:24, Nathan Howell <[email protected]> wrote: > On Fri, Sep 30, 2011 at 4:08 PM, David Terei <[email protected]> wrote: >> >> Are you using LLVM 2.9 or the unreleased 3.0? I'm >> excited about the new register allocator in 3.0. I don't know if it >> will help but more then any other improvement in the last few releases >> it seems to have the potential to. I was hoping the new register >> allocator combined with your alias pass would be a winning >> combination. > > Have you tried using PBQP on 2.9? I've seen it perform better (sometimes > much better) than the linear scan allocator... though this was on very large > function bodies compared to the typical code emitted by GHC. > _______________________________________________ > Cvs-ghc mailing list > [email protected] > http://www.haskell.org/mailman/listinfo/cvs-ghc > > _______________________________________________ Cvs-ghc mailing list [email protected] http://www.haskell.org/mailman/listinfo/cvs-ghc
