News for hackers. Stuff that matters.
Re:Optimising Haskell for a tight inner loop by carterschonwald on Wednesday January 08, 2014 @07:45PM (#7027981)
GHC has an llvm backend.

If you read the blog post, you'll see Neil mentions " tried the LLVM backend, but it generated significantly worse assembly code https://github.com/ndmitchell/blogs/blob/master/inner-loop/I...

@tenslsi : theres certainly room for improving llvm, the ghc native code gen, and pretty much any compiler generally (ghc is no different). I'm actively involved in GHC dev, and i've somewhat committed to spending some volunteer time this year improving the NCG and various backend optimization tooling.

anyways, the reddit discussion of the blog post is also pretty interesting

Re:Optimising Haskell for a tight inner loop by axman6 on Thursday January 09, 2014 @01:35AM (#7029126)
> ... tried the LLVM backend, but it generated significantly worse assembly code.

It's worth noting the LLVM version Neil tried was 2.8, from Dec 2010. LLVM has come a long way since then and I'd be surprised to see if produce such horrible code. I'm hoping Neil will do an updated post using LLVM 3.4 released last week.

Re:Optimising Haskell for a tight inner loop by sanxiyn on Thursday January 09, 2014 @06:10AM (#7029814)
My understanding is that the main problem is translating from Haskell to LLVM IR is a lossy process, not the difference between LLVM 2.8 and LLVM 3.4. This blog post demonstrates one such issue:

http://blog.omega-prime.co.uk/?p=135

Quote: "In particular, LLVM conservatively assumes that GHC's stack and the heap may alias". LLVM has to assume that short of Haskell-specific analysis, so updating to LLVM 3.4 won't help with such issues.

Re:Optimising Haskell for a tight inner loop by carterschonwald on Thursday January 09, 2014 @02:33PM (#7032605)
not quite, I think the issue is that llvm doesn't understand ghc's stack, so which I guess is the same issue :)