[GHC] #5237: Inefficient code generated for x^2

[GHC]

#5237: Inefficient code generated for x^2
-------------------------------+--------------------------------------------
    Reporter:  scpmw           |        Owner:                         
        Type:  bug             |       Status:  patch                  
    Priority:  normal          |    Milestone:  7.4.1                  
   Component:  libraries/base  |      Version:  7.0.3                  
    Keywords:                  |     Testcase:                         
   Blockedby:                  |   Difficulty:                         
          Os:  Linux           |     Blocking:                         
Architecture:  x86_64 (amd64)  |      Failure:  Runtime performance bug
-------------------------------+--------------------------------------------

Comment(by simonpj):

 The usual approach is to say `{-# NOINLINE [1] #-}` on functions that you
 want to match on the LHS of rules.  Did you try that?  Or, can you be more
 specific about what isn't firing?

 Thanks for looking at this.

 Simon

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/5237#comment:5>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler