[GHC] #1498: Optimisation: eliminate unnecessary heap check in recursive function

[GHC]

#1498: Optimisation: eliminate unnecessary heap check in recursive function
-------------------------------+--------------------------------------------
  Reporter:  simonmar          |          Owner:         
      Type:  task              |         Status:  new    
  Priority:  normal            |      Milestone:  6.10   
 Component:  Compiler          |        Version:  6.6.1  
  Severity:  normal            |       Keywords:         
Difficulty:  Moderate (1 day)  |             Os:  Unknown
  Testcase:                    |   Architecture:  Unknown
-------------------------------+--------------------------------------------
See [http://www.haskell.org/pipermail/cvs-ghc/2007-July/036496.html]

 In a basic block consisting of some primitive cases, in which only some
 branches require heap, we could push the heap check into the branches as
 long as the primitive operations are safe to repeat, and the stack has not
 been modified.  This might save a heap check in the common recursive case,
 which could be a significant win.

-- 
Ticket URL: <http://hackage.haskell.org/trac/ghc/ticket/1498>
GHC <http://www.haskell.org/ghc/>
The Glasgow Haskell Compiler
-------------- next part --------------
_______________________________________________
Glasgow-haskell-bugs mailing list
Glasgow-haskell-bugs at haskell.org
http://www.haskell.org/mailman/listinfo/glasgow-haskell-bugs