#5284: Simplifier performance regression (or infinite loop)
---------------------------------+------------------------------------------
Reporter: simonmar | Owner: igloo
Type: bug | Status: new
Priority: high | Milestone: 7.4.1
Component: Compiler | Version: 7.0.3
Keywords: | Testcase:
Blockedby: | Difficulty:
Os: Unknown/Multiple | Blocking:
Architecture: Unknown/Multiple | Failure: Compile-time performance bug
---------------------------------+------------------------------------------
Comment(by igloo):
In 7.2:
{{{
commit 9506f95ac32c91a9fa6ce659a4474d6f85e55268
Author: Ian Lynagh <[email protected]>
Date: Sat Jul 23 17:56:40 2011 +0100
Don't inline most integer operations
We get lots of code, and the simplifier generally can't do much with
it. We'll instead use builtin rules to do constant folding where
possible.
}}}
It's changeset:94df30b07c20c0031c1a8cc57ee3479423b963ac in the HEAD.
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/5284#comment:5>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
[email protected]
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
