#5237: Inefficient code generated for x^2
--------------------------------------+-------------------------------------
Reporter: scpmw | Owner: daniel.is.fischer
Type: bug | Status: closed
Priority: normal | Milestone: 7.4.1
Component: libraries/base | Version: 7.0.3
Resolution: fixed | Keywords:
Testcase: | Blockedby:
Difficulty: | Os: Linux
Blocking: | Architecture: x86_64 (amd64)
Failure: Runtime performance bug |
--------------------------------------+-------------------------------------
Changes (by daniel.is.fischer):
* status: new => closed
* resolution: => fixed
Comment:
Works great.
Fixed by
{{{
commit 088c9661321de044b4092756e2b563ffd23c6f96
Author: Daniel Fischer <daniel.is.fisc...@googlemail.com>
Date: Fri Nov 25 03:46:46 2011 +0100
Rules for powers with small exponents (fixes #5237)
Calculating small powers by direct multiplication is more efficient
than using (^). For small exponents known at compile time, there are
now rewrite rules.
}}}
Regression test: perf/should_run/T5237.hs
--
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/5237#comment:22>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
_______________________________________________
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs@haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs
