X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=compiler%2FsimplCore%2FSimplify.lhs;h=c73ee138a421bf3b64546e80dfc769e1bffd0505;hb=0e98e80cfd63c35d4f1705d9ec5a2037ef920f16;hp=dd2a22b63e96914c9986d05e7157de0df983e0f4;hpb=b812bfb914a0164f5ce3b206cb9769dc70253374;p=ghc-hetmet.git diff --git a/compiler/simplCore/Simplify.lhs b/compiler/simplCore/Simplify.lhs index dd2a22b..c73ee13 100644 --- a/compiler/simplCore/Simplify.lhs +++ b/compiler/simplCore/Simplify.lhs @@ -15,11 +15,11 @@ import SimplMonad import SimplEnv import SimplUtils ( mkCase, mkLam, SimplCont(..), DupFlag(..), LetRhsFlag(..), - mkRhsStop, mkBoringStop, pushContArgs, + mkRhsStop, mkBoringStop, mkLazyArgStop, pushContArgs, contResultType, countArgs, contIsDupable, contIsRhsOrArg, getContArgs, interestingCallContext, interestingArg, isStrictType, preInlineUnconditionally, postInlineUnconditionally, - inlineMode, activeInline, activeRule + interestingArgContext, inlineMode, activeInline, activeRule ) import Id ( Id, idType, idInfo, idArity, isDataConWorkId, idUnfolding, setIdUnfolding, isDeadBinder, @@ -364,7 +364,10 @@ simplNonRecX env bndr new_rhs thing_inside let body' = wrapFloats floats body in returnSmpl (emptyFloats env, Case new_rhs bndr' (exprType body') [(DEFAULT, [], body')]) - | preInlineUnconditionally env NotTopLevel bndr new_rhs +{- No, no, no! Do not try preInlineUnconditionally + Doing so risks exponential behaviour, because new_rhs has been simplified once already + In the cases described by the folowing commment, postInlineUnconditionally will + catch many of the relevant cases. -- This happens; for example, the case_bndr during case of -- known constructor: case (a,b) of x { (p,q) -> ... } -- Here x isn't mentioned in the RHS, so we don't want to @@ -373,8 +376,12 @@ simplNonRecX env bndr new_rhs thing_inside -- Similarly, single occurrences can be inlined vigourously -- e.g. case (f x, g y) of (a,b) -> .... -- If a,b occur once we can avoid constructing the let binding for them. + | preInlineUnconditionally env NotTopLevel bndr new_rhs = thing_inside (extendIdSubst env bndr (DoneEx new_rhs)) + -- NB: completeLazyBind uses postInlineUnconditionally; no need to do that here +-} + | otherwise = simplBinder env bndr `thenSmpl` \ (env, bndr') -> completeNonRecX env False {- Non-strict; pessimistic -} @@ -706,7 +713,7 @@ simplExprF env (Var v) cont = simplVar env v cont simplExprF env (Lit lit) cont = rebuild env (Lit lit) cont simplExprF env expr@(Lam _ _) cont = simplLam env expr cont simplExprF env (Note note expr) cont = simplNote env note expr cont -simplExprF env (App fun arg) cont = simplExprF env fun (ApplyTo NoDup arg env cont) +simplExprF env (App fun arg) cont = simplExprF env fun (ApplyTo NoDup arg (Just env) cont) simplExprF env (Type ty) cont = ASSERT( contIsRhsOrArg cont ) @@ -766,25 +773,32 @@ simplLam env fun cont cont_ty = contResultType cont -- Type-beta reduction - go env (Lam bndr body) (ApplyTo _ (Type ty_arg) arg_se body_cont) + go env (Lam bndr body) (ApplyTo _ (Type ty_arg) mb_arg_se body_cont) = ASSERT( isTyVar bndr ) - tick (BetaReduction bndr) `thenSmpl_` - simplType (setInScope arg_se env) ty_arg `thenSmpl` \ ty_arg' -> - go (extendTvSubst env bndr ty_arg') body body_cont + do { tick (BetaReduction bndr) + ; ty_arg' <- case mb_arg_se of + Just arg_se -> simplType (setInScope arg_se env) ty_arg + Nothing -> return ty_arg + ; go (extendTvSubst env bndr ty_arg') body body_cont } -- Ordinary beta reduction - go env (Lam bndr body) cont@(ApplyTo _ arg arg_se body_cont) - = tick (BetaReduction bndr) `thenSmpl_` - simplNonRecBind env (zap_it bndr) arg arg_se cont_ty $ \ env -> - go env body body_cont + go env (Lam bndr body) cont@(ApplyTo _ arg (Just arg_se) body_cont) + = do { tick (BetaReduction bndr) + ; simplNonRecBind env (zap_it bndr) arg arg_se cont_ty $ \ env -> + go env body body_cont } + + go env (Lam bndr body) cont@(ApplyTo _ arg Nothing body_cont) + = do { tick (BetaReduction bndr) + ; simplNonRecX env (zap_it bndr) arg $ \ env -> + go env body body_cont } -- Not enough args, so there are real lambdas left to put in the result go env lam@(Lam _ _) cont - = simplLamBndrs env bndrs `thenSmpl` \ (env, bndrs') -> - simplExpr env body `thenSmpl` \ body' -> - mkLam env bndrs' body' cont `thenSmpl` \ (floats, new_lam) -> - addFloats env floats $ \ env -> - rebuild env new_lam cont + = do { (env, bndrs') <- simplLamBndrs env bndrs + ; body' <- simplExpr env body + ; (floats, new_lam) <- mkLam env bndrs' body' cont + ; addFloats env floats $ \ env -> + rebuild env new_lam cont } where (bndrs,body) = collectBinders lam @@ -834,7 +848,7 @@ simplNote env (Coerce to from) body cont | otherwise = CoerceIt t1 cont -- They don't cancel, but -- the inner one is redundant - addCoerce t1t2 s1s2 (ApplyTo dup arg arg_se cont) + addCoerce t1t2 s1s2 (ApplyTo dup arg mb_arg_se cont) | not (isTypeArg arg), -- This whole case only works for value args -- Could upgrade to have equiv thing for type apps too Just (s1, s2) <- splitFunTy_maybe s1s2 @@ -851,10 +865,12 @@ simplNote env (Coerce to from) body cont -- But it isn't a common case. = let (t1,t2) = splitFunTy t1t2 - new_arg = mkCoerce2 s1 t1 (substExpr arg_env arg) - arg_env = setInScope arg_se env + new_arg = mkCoerce2 s1 t1 arg' + arg' = case mb_arg_se of + Nothing -> arg + Just arg_se -> substExpr (setInScope arg_se env) arg in - ApplyTo dup new_arg (zapSubstEnv env) (addCoerce t2 s2 cont) + ApplyTo dup new_arg Nothing (addCoerce t2 s2 cont) addCoerce to' _ cont = CoerceIt to' cont in @@ -869,9 +885,6 @@ simplNote env (SCC cc) e cont = simplExpr (setEnclosingCC env currentCCS) e `thenSmpl` \ e' -> rebuild env (mkSCC cc e') cont -simplNote env InlineCall e cont - = simplExprF env e (InlinePlease cont) - -- See notes with SimplMonad.inlineMode simplNote env InlineMe e cont | contIsRhsOrArg cont -- Totally boring continuation; see notes above @@ -919,11 +932,12 @@ completeCall env var occ_info cont = -- Simplify the arguments getDOptsSmpl `thenSmpl` \ dflags -> let - chkr = getSwitchChecker env - (args, call_cont, inline_call) = getContArgs chkr var cont - fn_ty = idType var + chkr = getSwitchChecker env + (args, call_cont) = getContArgs chkr var cont + fn_ty = idType var in - simplifyArgs env fn_ty args (contResultType call_cont) $ \ env args -> + simplifyArgs env fn_ty (interestingArgContext var call_cont) args + (contResultType call_cont) $ \ env args -> -- Next, look for rules or specialisations that match -- @@ -976,13 +990,11 @@ completeCall env var occ_info cont -- Next, look for an inlining let arg_infos = [ interestingArg arg | arg <- args, isValArg arg] - interesting_cont = interestingCallContext (notNull args) (notNull arg_infos) call_cont - active_inline = activeInline env var occ_info - maybe_inline = callSiteInline dflags active_inline inline_call occ_info + maybe_inline = callSiteInline dflags active_inline occ_info var arg_infos interesting_cont in case maybe_inline of { @@ -995,7 +1007,7 @@ completeCall env var occ_info cont text "Cont: " <+> ppr call_cont]) else id) $ - makeThatCall env var unfolding args call_cont + simplExprF env unfolding (pushContArgs args call_cont) ; Nothing -> -- No inlining! @@ -1003,43 +1015,7 @@ completeCall env var occ_info cont -- Done rebuild env (mkApps (Var var) args) call_cont }} - -makeThatCall :: SimplEnv - -> Id - -> InExpr -- Inlined function rhs - -> [OutExpr] -- Arguments, already simplified - -> SimplCont -- After the call - -> SimplM FloatsWithExpr --- Similar to simplLam, but this time --- the arguments are already simplified -makeThatCall orig_env var fun@(Lam _ _) args cont - = go orig_env fun args - where - zap_it = mkLamBndrZapper fun (length args) - - -- Type-beta reduction - go env (Lam bndr body) (Type ty_arg : args) - = ASSERT( isTyVar bndr ) - tick (BetaReduction bndr) `thenSmpl_` - go (extendTvSubst env bndr ty_arg) body args - - -- Ordinary beta reduction - go env (Lam bndr body) (arg : args) - = tick (BetaReduction bndr) `thenSmpl_` - simplNonRecX env (zap_it bndr) arg $ \ env -> - go env body args - - -- Not enough args, so there are real lambdas left to put in the result - go env fun args - = simplExprF env fun (pushContArgs orig_env args cont) - -- NB: orig_env; the correct environment to capture with - -- the arguments.... env has been augmented with substitutions - -- from the beta reductions. - -makeThatCall env var fun args cont - = simplExprF env fun (pushContArgs env args cont) -\end{code} - +\end{code} %************************************************************************ %* * @@ -1053,7 +1029,8 @@ makeThatCall env var fun args cont simplifyArgs :: SimplEnv -> OutType -- Type of the function - -> [(InExpr, SimplEnv, Bool)] -- Details of the arguments + -> Bool -- True if the fn has RULES + -> [(InExpr, Maybe SimplEnv, Bool)] -- Details of the arguments -> OutType -- Type of the continuation -> (SimplEnv -> [OutExpr] -> SimplM FloatsWithExpr) -> SimplM FloatsWithExpr @@ -1083,19 +1060,22 @@ simplifyArgs :: SimplEnv -- discard the entire application and replace it with (error "foo"). Getting -- all this at once is TOO HARD! -simplifyArgs env fn_ty args cont_ty thing_inside +simplifyArgs env fn_ty has_rules args cont_ty thing_inside = go env fn_ty args thing_inside where go env fn_ty [] thing_inside = thing_inside env [] - go env fn_ty (arg:args) thing_inside = simplifyArg env fn_ty arg cont_ty $ \ env arg' -> + go env fn_ty (arg:args) thing_inside = simplifyArg env fn_ty has_rules arg cont_ty $ \ env arg' -> go env (applyTypeToArg fn_ty arg') args $ \ env args' -> thing_inside env (arg':args') -simplifyArg env fn_ty (Type ty_arg, se, _) cont_ty thing_inside +simplifyArg env fn_ty has_rules (arg, Nothing, _) cont_ty thing_inside + = thing_inside env arg -- Already simplified + +simplifyArg env fn_ty has_rules (Type ty_arg, Just se, _) cont_ty thing_inside = simplType (setInScope se env) ty_arg `thenSmpl` \ new_ty_arg -> thing_inside env (Type new_ty_arg) -simplifyArg env fn_ty (val_arg, arg_se, is_strict) cont_ty thing_inside +simplifyArg env fn_ty has_rules (val_arg, Just arg_se, is_strict) cont_ty thing_inside | is_strict = simplStrictArg AnArg env val_arg arg_se arg_ty cont_ty thing_inside @@ -1105,8 +1085,8 @@ simplifyArg env fn_ty (val_arg, arg_se, is_strict) cont_ty thing_inside -- have to be very careful about bogus strictness through -- floating a demanded let. = simplExprC (setInScope arg_se env) val_arg - (mkBoringStop arg_ty) `thenSmpl` \ arg1 -> - thing_inside env arg1 + (mkLazyArgStop arg_ty has_rules) `thenSmpl` \ arg1 -> + thing_inside env arg1 where arg_ty = funArgTy fn_ty @@ -1255,13 +1235,16 @@ rebuild :: SimplEnv -> OutExpr -> SimplCont -> SimplM FloatsWithExpr rebuild env expr (Stop _ _ _) = rebuildDone env expr rebuild env expr (ArgOf _ _ _ cont_fn) = cont_fn env expr rebuild env expr (CoerceIt to_ty cont) = rebuild env (mkCoerce to_ty expr) cont -rebuild env expr (InlinePlease cont) = rebuild env (Note InlineCall expr) cont rebuild env expr (Select _ bndr alts se cont) = rebuildCase (setInScope se env) expr bndr alts cont -rebuild env expr (ApplyTo _ arg se cont) = rebuildApp (setInScope se env) expr arg cont +rebuild env expr (ApplyTo _ arg mb_se cont) = rebuildApp env expr arg mb_se cont -rebuildApp env fun arg cont - = simplExpr env arg `thenSmpl` \ arg' -> - rebuild env (App fun arg') cont +rebuildApp env fun arg mb_se cont + = do { arg' <- simplArg env arg mb_se + ; rebuild env (App fun arg') cont } + +simplArg :: SimplEnv -> CoreExpr -> Maybe SimplEnv -> SimplM CoreExpr +simplArg env arg Nothing = return arg -- The arg is already simplified +simplArg env arg (Just arg_env) = simplExpr (setInScope arg_env env) arg rebuildDone env expr = returnSmpl (emptyFloats env, expr) \end{code} @@ -1290,11 +1273,11 @@ rebuildCase env scrut case_bndr alts cont | Just (con,args) <- exprIsConApp_maybe scrut -- Works when the scrutinee is a variable with a known unfolding -- as well as when it's an explicit constructor application - = knownCon env (DataAlt con) args case_bndr alts cont + = knownCon env scrut (DataAlt con) args case_bndr alts cont | Lit lit <- scrut -- No need for same treatment as constructors -- because literals are inlined more vigorously - = knownCon env (LitAlt lit) [] case_bndr alts cont + = knownCon env scrut (LitAlt lit) [] case_bndr alts cont | otherwise = -- Prepare the continuation; @@ -1724,37 +1707,43 @@ and then All this should happen in one sweep. \begin{code} -knownCon :: SimplEnv -> AltCon -> [OutExpr] +knownCon :: SimplEnv -> OutExpr -> AltCon -> [OutExpr] -> InId -> [InAlt] -> SimplCont -> SimplM FloatsWithExpr -knownCon env con args bndr alts cont - = tick (KnownBranch bndr) `thenSmpl_` +knownCon env scrut con args bndr alts cont + = tick (KnownBranch bndr) `thenSmpl_` case findAlt con alts of (DEFAULT, bs, rhs) -> ASSERT( null bs ) simplNonRecX env bndr scrut $ \ env -> - -- This might give rise to a binding with non-atomic args - -- like x = Node (f x) (g x) - -- but no harm will be done + -- This might give rise to a binding with non-atomic args + -- like x = Node (f x) (g x) + -- but simplNonRecX will atomic-ify it simplExprF env rhs cont - where - scrut = case con of - LitAlt lit -> Lit lit - DataAlt dc -> mkConApp dc args (LitAlt lit, bs, rhs) -> ASSERT( null bs ) - simplNonRecX env bndr (Lit lit) $ \ env -> + simplNonRecX env bndr scrut $ \ env -> simplExprF env rhs cont (DataAlt dc, bs, rhs) -> ASSERT( n_drop_tys + length bs == length args ) bind_args env bs (drop n_drop_tys args) $ \ env -> let - con_app = mkConApp dc (take n_drop_tys args ++ con_args) + -- It's useful to bind bndr to scrut, rather than to a fresh + -- binding x = Con arg1 .. argn + -- because very often the scrut is a variable, so we avoid + -- creating, and then subsequently eliminating, a let-binding + -- BUT, if scrut is a not a variable, we must be careful + -- about duplicating the arg redexes; in that case, make + -- a new con-app from the args + bndr_rhs = case scrut of + Var v -> scrut + other -> con_app + con_app = mkConApp dc (take n_drop_tys args ++ con_args) con_args = [substExpr env (varToCoreExpr b) | b <- bs] -- args are aready OutExprs, but bs are InIds in - simplNonRecX env bndr con_app $ \ env -> + simplNonRecX env bndr bndr_rhs $ \ env -> simplExprF env rhs cont where n_drop_tys | isVanillaDataCon dc = tyConArity (dataConTyCon dc) @@ -1769,6 +1758,8 @@ bind_args env (b:bs) (Type ty : args) thing_inside bind_args (extendTvSubst env b ty) bs args thing_inside bind_args env (b:bs) (arg : args) thing_inside +-- Note that the binder might be "dead", because it doesn't occur in the RHS +-- Nevertheless we bind it here, in case we need it for the con_app for the case_bndr = ASSERT( isId b ) simplNonRecX env b arg $ \ env -> bind_args env bs args thing_inside @@ -1806,10 +1797,6 @@ mkDupableCont env (CoerceIt ty cont) = mkDupableCont env cont `thenSmpl` \ (floats, (dup_cont, nondup_cont)) -> returnSmpl (floats, (CoerceIt ty dup_cont, nondup_cont)) -mkDupableCont env (InlinePlease cont) - = mkDupableCont env cont `thenSmpl` \ (floats, (dup_cont, nondup_cont)) -> - returnSmpl (floats, (InlinePlease dup_cont, nondup_cont)) - mkDupableCont env cont@(ArgOf _ arg_ty _ _) = returnSmpl (emptyFloats env, (mkBoringStop arg_ty, cont)) -- Do *not* duplicate an ArgOf continuation @@ -1838,16 +1825,85 @@ mkDupableCont env cont@(ArgOf _ arg_ty _ _) -- let $j = \a -> ...strict-fn... -- in $j [...hole...] -mkDupableCont env (ApplyTo _ arg se cont) +mkDupableCont env (ApplyTo _ arg mb_se cont) = -- e.g. [...hole...] (...arg...) -- ==> -- let a = ...arg... -- in [...hole...] a do { (floats, (dup_cont, nondup_cont)) <- mkDupableCont env cont ; addFloats env floats $ \ env -> do - { arg1 <- simplExpr (setInScope se env) arg + { arg1 <- simplArg env arg mb_se ; (floats2, arg2) <- mkDupableArg env arg1 - ; return (floats2, (ApplyTo OkToDup arg2 (zapSubstEnv se) dup_cont, nondup_cont)) }} + ; return (floats2, (ApplyTo OkToDup arg2 Nothing dup_cont, nondup_cont)) }} + +mkDupableCont env cont@(Select _ case_bndr [(_,bs,rhs)] se case_cont) +-- | not (exprIsDupable rhs && contIsDupable case_cont) -- See notes below +-- | not (isDeadBinder case_bndr) + | all isDeadBinder bs + = returnSmpl (emptyFloats env, (mkBoringStop scrut_ty, cont)) + where + scrut_ty = substTy se (idType case_bndr) + +{- Note [Single-alternative cases] + ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~ +This case is just like the ArgOf case. Here's an example: + data T a = MkT !a + ...(MkT (abs x))... +Then we get + case (case x of I# x' -> + case x' <# 0# of + True -> I# (negate# x') + False -> I# x') of y { + DEFAULT -> MkT y +Because the (case x) has only one alternative, we'll transform to + case x of I# x' -> + case (case x' <# 0# of + True -> I# (negate# x') + False -> I# x') of y { + DEFAULT -> MkT y +But now we do *NOT* want to make a join point etc, giving + case x of I# x' -> + let $j = \y -> MkT y + in case x' <# 0# of + True -> $j (I# (negate# x')) + False -> $j (I# x') +In this case the $j will inline again, but suppose there was a big +strict computation enclosing the orginal call to MkT. Then, it won't +"see" the MkT any more, because it's big and won't get duplicated. +And, what is worse, nothing was gained by the case-of-case transform. + +When should use this case of mkDupableCont? +However, matching on *any* single-alternative case is a *disaster*; + e.g. case (case ....) of (a,b) -> (# a,b #) + We must push the outer case into the inner one! +Other choices: + + * Match [(DEFAULT,_,_)], but in the common case of Int, + the alternative-filling-in code turned the outer case into + case (...) of y { I# _ -> MkT y } + + * Match on single alternative plus (not (isDeadBinder case_bndr)) + Rationale: pushing the case inwards won't eliminate the construction. + But there's a risk of + case (...) of y { (a,b) -> let z=(a,b) in ... } + Now y looks dead, but it'll come alive again. Still, this + seems like the best option at the moment. + + * Match on single alternative plus (all (isDeadBinder bndrs)) + Rationale: this is essentially seq. + + * Match when the rhs is *not* duplicable, and hence would lead to a + join point. This catches the disaster-case above. We can test + the *un-simplified* rhs, which is fine. It might get bigger or + smaller after simplification; if it gets smaller, this case might + fire next time round. NB also that we must test contIsDupable + case_cont *btoo, because case_cont might be big! + + HOWEVER: I found that this version doesn't work well, because + we can get let x = case (...) of { small } in ...case x... + When x is inlined into its full context, we find that it was a bad + idea to have pushed the outer case inside the (...) case. +-} mkDupableCont env (Select _ case_bndr alts se cont) = -- e.g. (case [...hole...] of { pi -> ei })