search for: donsbot

I found this interesting: http://donsbot.wordpress.com/2010/02/21/smoking-fast-haskell-code-using-ghcs-new-llvm-codegen/

On 22 February 2010 19:43, Chris Lattner <clattner at apple.com> wrote: > I found this interesting: > http://donsbot.wordpress.com/2010/02/21/smoking-fast-haskell-code-using-ghcs-new-llvm-codegen/ David Terei sent it a few days ago too, as part of another thread. (which prevented me of sharing too) ;) It's really interesting how the optimizations scrambled the code to a point of non-recognition, but making...

..., Jul 29, 2013 at 4:24 PM, Hal Finkel <hfinkel at anl.gov> wrote: > > Out of curiosity, has anyone tried to optimize the pass ordering in some > (quasi-)automated way? Naively, a genetic algorithm seems like a perfect > fit for this. > This is the closest I've seen: http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/ However, it deals with a "toy" example. Doing something similar over an entire benchmark suite would be interesting (and it may find non-obvious, highly-profitable interactions between passes that we aren't cur...

...upport and the integrated JIT. > E.g., is it natural to expect that the LLVM-based implementation of the > language Concurrent Clean be any faster than its reference implementation? You should probably get in touch with David Terei. His LLVM ghc backend seems to be doing fairly well: http://donsbot.wordpress.com/2010/02/21/smoking-fast-haskell-code-using-ghcs-new-llvm-codegen/ Albert -- Dr. Albert Gr"af Dept. of Music-Informatics, University of Mainz, Germany Email: Dr.Graef at t-online.de, ag at muwiinfa.geschichte.uni-mainz.de WWW: http://www.musikinformatik.uni-mainz.de/ag

Hi, are there any attempts to use LLVM in graph-rewriting (term-rewriting) language implementations? How good is LLVM for this? E.g., is it natural to expect that the LLVM-based implementation of the language Concurrent Clean be any faster than its reference implementation? Best regards -- Valery A.Khamenya -------------- next part -------------- An HTML attachment was scrubbed... URL:

On Feb 21, 2010, at 4:53 PM, Garrison Venn wrote: > Hi David, > > Your paper is linked on an LLVM site, but I can't give you the url as we are > currently down for maintenance. If I remember correctly it was under "recent papers" > off of the home site. It's here: http://llvm.org/pubs/2009-10-TereiThesis.html -Chris > > Garrison > > On Feb 21,

http://donsbot.wordpress.com/2010/03/01/evolving-faster-haskell-programs-now-with-llvm/ The timings are a bit too short (0.3s) to mean that much, but the way his GA found the best flags is nice... -- cheers, --renato http://systemcall.org/ Reclaim your digital rights, eliminate DRM, learn more at http://www...

On 23 Feb 2013, at 18:54, Reed Kotler <rkotler at mips.com> wrote: > Hmmm. You don't remember which tweaks you tried? I don't, I'm afraid. I more or less just ran opt with vaguely sensible sounding combinations of passes to find the smallest one. Eventually we just removed some features from the bootloader to make it fit. One of the things on my to-do-eventually list if

Hi David, Your paper is linked on an LLVM site, but I can't give you the url as we are currently down for maintenance. If I remember correctly it was under "recent papers" off of the home site. Garrison On Feb 21, 2010, at 18:55, David Terei wrote: > Just to correct, the GCC back-end isn't being depreciated in favour of > the LLVM back-end (as much as I would to claim

----- Original Message ----- > > On Jul 27, 2013, at 5:47 PM, Shuxin Yang <shuxin.llvm at gmail.com> > wrote: > > > Hi, Sean: > > > > I'm sorry I lie. I didn't mean to lie. I did try to avoid making > > a *BIG* change > > to the IPO pass-ordering for now. However, when I make a minor > > change to > >

On Jul 27, 2013, at 5:47 PM, Shuxin Yang <shuxin.llvm at gmail.com> wrote: > Hi, Sean: > > I'm sorry I lie. I didn't mean to lie. I did try to avoid making a *BIG* change > to the IPO pass-ordering for now. However, when I make a minor change to > populateLTOPassManager() by separating module-pass and non-module-passes, I > saw quite a few performance