Repository : ssh://darcs.haskell.org//srv/darcs/ghc On branch : supercompiler
http://hackage.haskell.org/trac/ghc/changeset/0a2664ce044b22c3a12800da2a50299b0e3f6c35 >--------------------------------------------------------------- commit 0a2664ce044b22c3a12800da2a50299b0e3f6c35 Author: Max Bolingbroke <batterseapo...@hotmail.com> Date: Thu Oct 18 20:58:23 2012 +0100 FIx stupid bug with summary given to GHC heuristics >--------------------------------------------------------------- .../Supercompile/Evaluator/Evaluate.hs | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/compiler/supercompile/Supercompile/Evaluator/Evaluate.hs b/compiler/supercompile/Supercompile/Evaluator/Evaluate.hs index e6b044b..c182c5b 100644 --- a/compiler/supercompile/Supercompile/Evaluator/Evaluate.hs +++ b/compiler/supercompile/Supercompile/Evaluator/Evaluate.hs @@ -363,7 +363,7 @@ step' normalising ei_state = {-# SCC "step'" #-} -- -- Perhaps if we had deep normalisation + GC we could get these results by penalising heap allocation heavily? -- If so we must remember to do it for heap bindings *and* letrecs. - let k_summary = summariseContext h k + let k_summary = summariseContext h (Car kf k) guard $ case () of _ -- If the lambda is marked SUPERINLINABLE, always inline it | super _______________________________________________ Cvs-ghc mailing list Cvs-ghc@haskell.org http://www.haskell.org/mailman/listinfo/cvs-ghc