Repository : ssh://darcs.haskell.org//srv/darcs/ghc On branch : supercompiler
http://hackage.haskell.org/trac/ghc/changeset/ec93b3895db8cdc51c631bf9d04c23f780ee771a >--------------------------------------------------------------- commit ec93b3895db8cdc51c631bf9d04c23f780ee771a Author: Max Bolingbroke <batterseapo...@hotmail.com> Date: Fri Apr 27 10:44:23 2012 +0100 Remove spurious trace >--------------------------------------------------------------- compiler/supercompile/Supercompile/Drive/MSG.hs | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/compiler/supercompile/Supercompile/Drive/MSG.hs b/compiler/supercompile/Supercompile/Drive/MSG.hs index 7397775..67503d2 100644 --- a/compiler/supercompile/Supercompile/Drive/MSG.hs +++ b/compiler/supercompile/Supercompile/Drive/MSG.hs @@ -176,7 +176,7 @@ msgPend rn2 x0 pending = MSG $ \e s0 -> case lookupUpdatePending s0 of s2 = s1 { msgInScopeSet = extendInScopeSet (msgInScopeSet s1) x2, -- NB: binderization *never* changes the unique -- exploit that to avoid a loop msgPending = (x, pending) : msgPending s1 } res = unMSG (binderise x2) (e { msgLostWorkSharing = False }) s2 -- This thing will be bound in the top letrec, outside any lambdas - Right (_, x) = trace "forcing knot" res + Right (_, x) = res where lookupUpdatePending :: MSGState -> Either (Maybe Var, -- Are both sides equal vars, and if so what are they equal to? _______________________________________________ Cvs-ghc mailing list Cvs-ghc@haskell.org http://www.haskell.org/mailman/listinfo/cvs-ghc
