2 % (c) The AQUA Project, Glasgow University, 1994-1996
4 \section[SimplCase]{Simplification of `case' expression}
6 Support code for @Simplify@.
9 #include "HsVersions.h"
11 module SimplCase ( simplCase, bindLargeRhs ) where
14 IMPORT_DELOOPER(SmplLoop) ( simplBind, simplExpr, MagicUnfoldingFun )
16 import BinderInfo -- too boring to try to select things...
17 import CmdLineOpts ( SimplifierSwitch(..) )
19 import CoreUnfold ( Unfolding(..), UnfoldingGuidance(..),
20 SimpleUnfolding, FormSummary
22 import CoreUtils ( coreAltsType, nonErrorRHSs, maybeErrorApp,
25 import Id ( idType, isDataCon, getIdDemandInfo,
26 SYN_IE(DataCon), GenId{-instance Eq-}
28 import IdInfo ( willBeDemanded, DemandInfo )
29 import Literal ( isNoRepLit, Literal{-instance Eq-} )
30 import Maybes ( maybeToBool )
31 import PrelVals ( voidId )
32 import PrimOp ( primOpOkForSpeculation, PrimOp{-instance Eq-} )
35 import SimplUtils ( mkValLamTryingEta )
36 import Type ( isPrimType, getAppDataTyConExpandingDicts, mkFunTy, mkFunTys, eqTy )
37 import TysPrim ( voidTy )
38 import Unique ( Unique{-instance Eq-} )
39 import Usage ( GenUsage{-instance Eq-} )
40 import Util ( isIn, isSingleton, zipEqual, panic, assertPanic )
43 Float let out of case.
47 -> InExpr -- Scrutinee
48 -> InAlts -- Alternatives
49 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Rhs handler
50 -> OutType -- Type of result expression
53 simplCase env (Let bind body) alts rhs_c result_ty
54 | not (switchIsSet env SimplNoLetFromCase)
55 = -- Float the let outside the case scrutinee (if not disabled by flag)
56 tick LetFloatFromCase `thenSmpl_`
57 simplBind env bind (\env -> simplCase env body alts rhs_c result_ty) result_ty
60 OK to do case-of-case if
62 * we allow arbitrary code duplication
66 * the inner case has one alternative
67 case (case e of (a,b) -> rhs) of
78 IF neither of these two things are the case, we avoid code-duplication
79 by abstracting the outer rhss wrt the pattern variables. For example
81 case (case e of { p1->rhs1; ...; pn -> rhsn }) of
87 p1 -> case rhs1 of (x,y) -> b x y
89 pn -> case rhsn of (x,y) -> b x y
92 OK, so outer case expression gets duplicated, but that's all. Furthermore,
93 (a) the binding for "b" will be let-no-escaped, so no heap allocation
94 will take place; the "call" to b will simply be a stack adjustment
96 (b) very commonly, at least some of the rhsi's will be constructors, which
97 makes life even simpler.
99 All of this works equally well if the outer case has multiple rhss.
103 simplCase env (Case inner_scrut inner_alts) outer_alts rhs_c result_ty
104 | switchIsSet env SimplCaseOfCase
105 = -- Ha! Do case-of-case
106 tick CaseOfCase `thenSmpl_`
108 if no_need_to_bind_large_alts
110 simplCase env inner_scrut inner_alts
111 (\env rhs -> simplCase env rhs outer_alts rhs_c result_ty) result_ty
113 bindLargeAlts env outer_alts rhs_c result_ty `thenSmpl` \ (extra_bindings, outer_alts') ->
115 rhs_c' = \env rhs -> simplExpr env rhs []
117 simplCase env inner_scrut inner_alts
118 (\env rhs -> simplCase env rhs outer_alts' rhs_c' result_ty)
120 `thenSmpl` \ case_expr ->
121 returnSmpl (mkCoLetsNoUnboxed extra_bindings case_expr)
124 no_need_to_bind_large_alts = switchIsSet env SimplOkToDupCode ||
125 isSingleton (nonErrorRHSs inner_alts)
128 Case of an application of error.
131 simplCase env scrut alts rhs_c result_ty
132 | maybeToBool maybe_error_app
133 = -- Look for an application of an error id
134 tick CaseOfError `thenSmpl_`
135 rhs_c env retyped_error_app
137 alts_ty = coreAltsType (unTagBindersAlts alts)
138 maybe_error_app = maybeErrorApp scrut (Just alts_ty)
139 Just retyped_error_app = maybe_error_app
142 Finally the default case
145 simplCase env other_scrut alts rhs_c result_ty
146 = -- Float the let outside the case scrutinee
147 simplExpr env other_scrut [] `thenSmpl` \ scrut' ->
148 completeCase env scrut' alts rhs_c
152 %************************************************************************
154 \subsection[Simplify-case]{Completing case-expression simplification}
156 %************************************************************************
161 -> OutExpr -- The already-simplified scrutinee
162 -> InAlts -- The un-simplified alternatives
163 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Rhs handler
164 -> SmplM OutExpr -- The whole case expression
167 Scrutinising a literal or constructor.
168 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
169 It's an obvious win to do:
171 case (C a b) of {...; C p q -> rhs; ...} ===> rhs[a/p,b/q]
173 and the similar thing for primitive case. If we have
177 and x is known to be of constructor form, then we'll already have
178 inlined the constructor to give (case (C a b) of ...), so we don't
179 need to check for the variable case separately.
181 Sanity check: we don't have a good
182 story to tell about case analysis on NoRep things. ToDo.
185 completeCase env (Lit lit) alts rhs_c
186 | not (isNoRepLit lit)
187 = -- Ha! Select the appropriate alternative
188 tick KnownBranch `thenSmpl_`
189 completePrimCaseWithKnownLit env lit alts rhs_c
191 completeCase env expr@(Con con con_args) alts rhs_c
192 = -- Ha! Staring us in the face -- select the appropriate alternative
193 tick KnownBranch `thenSmpl_`
194 completeAlgCaseWithKnownCon env con con_args alts rhs_c
199 Start with a simple situation:
201 case x# of ===> e[x#/y#]
204 (when x#, y# are of primitive type, of course).
205 We can't (in general) do this for algebraic cases, because we might
206 turn bottom into non-bottom!
208 Actually, we generalise this idea to look for a case where we're
209 scrutinising a variable, and we know that only the default case can
214 other -> ...(case x of
218 Here the inner case can be eliminated. This really only shows up in
219 eliminating error-checking code.
221 Lastly, we generalise the transformation to handle this:
227 We only do this for very cheaply compared r's (constructors, literals
228 and variables). If pedantic bottoms is on, we only do it when the
229 scrutinee is a PrimOp which can't fail.
231 We do it *here*, looking at un-simplified alternatives, because we
232 have to check that r doesn't mention the variables bound by the
233 pattern in each alternative, so the binder-info is rather useful.
235 So the case-elimination algorithm is:
237 1. Eliminate alternatives which can't match
239 2. Check whether all the remaining alternatives
240 (a) do not mention in their rhs any of the variables bound in their pattern
241 and (b) have equal rhss
243 3. Check we can safely ditch the case:
244 * PedanticBottoms is off,
245 or * the scrutinee is an already-evaluated variable
246 or * the scrutinee is a primop which is ok for speculation
247 -- ie we want to preserve divide-by-zero errors, and
248 -- calls to error itself!
250 or * [Prim cases] the scrutinee is a primitive variable
252 or * [Alg cases] the scrutinee is a variable and
253 either * the rhs is the same variable
254 (eg case x of C a b -> x ===> x)
255 or * there is only one alternative, the default alternative,
256 and the binder is used strictly in its scope.
257 [NB this is helped by the "use default binder where
258 possible" transformation; see below.]
261 If so, then we can replace the case with one of the rhss.
264 completeCase env scrut alts rhs_c
265 | switchIsSet env SimplDoCaseElim &&
271 (not (switchIsSet env SimplPedanticBottoms) ||
273 scrut_is_eliminable_primitive ||
275 scrut_is_var_and_single_strict_default
278 = tick CaseElim `thenSmpl_`
281 -- Find the non-excluded rhss of the case; always at least one
282 (rhs1:rhss) = possible_rhss
283 all_rhss_same = all (cheap_eq rhs1) rhss
285 -- Find the reduced set of possible rhss, along with an indication of
286 -- whether none of their binders are used
287 (binders_unused, possible_rhss, new_env)
289 PrimAlts alts deflt -> (deflt_binder_unused, -- No binders other than deflt
293 (deflt_binder_unused, deflt_rhs, new_env) = elim_deflt_binder deflt
295 -- Eliminate unused rhss if poss
296 rhss = case scrut_form of
297 OtherLit not_these -> [rhs | (alt_lit,rhs) <- alts,
298 not (alt_lit `is_elem` not_these)
300 other -> [rhs | (_,rhs) <- alts]
302 AlgAlts alts deflt -> (deflt_binder_unused && all alt_binders_unused possible_alts,
303 deflt_rhs ++ [rhs | (_,_,rhs) <- possible_alts],
306 (deflt_binder_unused, deflt_rhs, new_env) = elim_deflt_binder deflt
308 -- Eliminate unused alts if poss
309 possible_alts = case scrut_form of
310 OtherCon not_these ->
311 -- Remove alts which can't match
312 [alt | alt@(alt_con,_,_) <- alts,
313 not (alt_con `is_elem` not_these)]
317 alt_binders_unused (con, args, rhs) = all is_dead args
318 is_dead (_, DeadCode) = True
319 is_dead other_arg = False
321 -- If the scrutinee is a variable, look it up to see what we know about it
322 scrut_form = case scrut of
323 Var v -> lookupRhsInfo env v
326 -- If the scrut is already eval'd then there's no worry about
327 -- eliminating the case
328 scrut_is_evald = isEvaluated scrut_form
330 scrut_is_eliminable_primitive
332 Prim op _ -> primOpOkForSpeculation op
333 Var _ -> case alts of
334 PrimAlts _ _ -> True -- Primitive, hence non-bottom
335 AlgAlts _ _ -> False -- Not primitive
338 -- case v of w -> e{strict in w} ===> e[v/w]
339 scrut_is_var_and_single_strict_default
341 Var _ -> case alts of
342 AlgAlts [] (BindDefault (v,_) _) -> willBeDemanded (getIdDemandInfo v)
346 elim_deflt_binder NoDefault -- No Binder
348 elim_deflt_binder (BindDefault (id, DeadCode) rhs) -- Binder unused
350 elim_deflt_binder (BindDefault used_binder rhs) -- Binder used
352 Var v -> -- Binder used, but can be eliminated in favour of scrut
353 (True, [rhs], extendIdEnvWithAtom env used_binder (VarArg v))
354 non_var -> -- Binder used, and can't be elimd
357 -- Check whether the chosen unique rhs (ie rhs1) is the same as
358 -- the scrutinee. Remember that the rhs is as yet unsimplified.
359 rhs1_is_scrutinee = case (scrut, rhs1) of
360 (Var scrut_var, Var rhs_var)
361 -> case lookupId env rhs_var of
362 VarArg rhs_var' -> rhs_var' == scrut_var
366 is_elem x ys = isIn "completeCase" x ys
369 Scrutinising anything else. If it's a variable, it can't be bound to a
370 constructor or literal, because that would have been inlined
373 completeCase env scrut alts rhs_c
374 = simplAlts env scrut alts rhs_c `thenSmpl` \ alts' ->
375 mkCoCase env scrut alts'
382 bindLargeAlts :: SimplEnv
384 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Old rhs handler
385 -> OutType -- Result type
386 -> SmplM ([OutBinding], -- Extra bindings
387 InAlts) -- Modified alts
389 bindLargeAlts env the_lot@(AlgAlts alts deflt) rhs_c rhs_ty
390 = mapAndUnzipSmpl do_alt alts `thenSmpl` \ (alt_bindings, alts') ->
391 bindLargeDefault env deflt rhs_ty rhs_c `thenSmpl` \ (deflt_bindings, deflt') ->
392 returnSmpl (deflt_bindings ++ alt_bindings, AlgAlts alts' deflt')
394 do_alt (con,args,rhs) = bindLargeRhs env args rhs_ty
395 (\env -> rhs_c env rhs) `thenSmpl` \ (bind,rhs') ->
396 returnSmpl (bind, (con,args,rhs'))
398 bindLargeAlts env the_lot@(PrimAlts alts deflt) rhs_c rhs_ty
399 = mapAndUnzipSmpl do_alt alts `thenSmpl` \ (alt_bindings, alts') ->
400 bindLargeDefault env deflt rhs_ty rhs_c `thenSmpl` \ (deflt_bindings, deflt') ->
401 returnSmpl (deflt_bindings ++ alt_bindings, PrimAlts alts' deflt')
403 do_alt (lit,rhs) = bindLargeRhs env [] rhs_ty
404 (\env -> rhs_c env rhs) `thenSmpl` \ (bind,rhs') ->
405 returnSmpl (bind, (lit,rhs'))
407 bindLargeDefault env NoDefault rhs_ty rhs_c
408 = returnSmpl ([], NoDefault)
409 bindLargeDefault env (BindDefault binder rhs) rhs_ty rhs_c
410 = bindLargeRhs env [binder] rhs_ty
411 (\env -> rhs_c env rhs) `thenSmpl` \ (bind,rhs') ->
412 returnSmpl ([bind], BindDefault binder rhs')
415 bindLargeRhs env [x1,..,xn] rhs rhs_ty rhs_c
416 | otherwise = (rhs_id = \x1..xn -> rhs_c rhs,
420 bindLargeRhs :: SimplEnv
421 -> [InBinder] -- The args wrt which the rhs should be abstracted
423 -> (SimplEnv -> SmplM OutExpr) -- Rhs handler
424 -> SmplM (OutBinding, -- New bindings (singleton or empty)
425 InExpr) -- Modified rhs
427 bindLargeRhs env args rhs_ty rhs_c
428 | null used_args && isPrimType rhs_ty
429 -- If we try to lift a primitive-typed something out
430 -- for let-binding-purposes, we will *caseify* it (!),
431 -- with potentially-disastrous strictness results. So
432 -- instead we turn it into a function: \v -> e
433 -- where v::Void. Since arguments of type
434 -- VoidPrim don't generate any code, this gives the
437 -- The general structure is just the same as for the common "otherwise~ case
438 = newId prim_rhs_fun_ty `thenSmpl` \ prim_rhs_fun_id ->
439 newId voidTy `thenSmpl` \ void_arg_id ->
440 rhs_c env `thenSmpl` \ prim_new_body ->
442 returnSmpl (NonRec prim_rhs_fun_id (mkValLam [void_arg_id] prim_new_body),
443 App (Var prim_rhs_fun_id) (VarArg voidId))
446 = -- Make the new binding Id. NB: it's an OutId
447 newId rhs_fun_ty `thenSmpl` \ rhs_fun_id ->
450 cloneIds env used_args `thenSmpl` \ used_args' ->
452 new_env = extendIdEnvWithClones env used_args used_args'
454 rhs_c new_env `thenSmpl` \ rhs' ->
457 = (if switchIsSet new_env SimplDoEtaReduction
458 then mkValLamTryingEta
459 else mkValLam) used_args' rhs'
461 returnSmpl (NonRec rhs_fun_id final_rhs,
462 foldl App (Var rhs_fun_id) used_arg_atoms)
463 -- This is slightly wierd. We're retuning an OutId as part of the
464 -- modified rhs, which is meant to be an InExpr. However, that's ok, because when
465 -- it's processed the OutId won't be found in the environment, so it
466 -- will be left unmodified.
468 rhs_fun_ty :: OutType
469 rhs_fun_ty = mkFunTys [simplTy env (idType id) | (id,_) <- used_args] rhs_ty
471 used_args = [arg | arg@(_,usage) <- args, not (dead usage)]
472 used_arg_atoms = [VarArg arg_id | (arg_id,_) <- used_args]
476 prim_rhs_fun_ty = mkFunTy voidTy rhs_ty
479 Case alternatives when we don't know the scrutinee
480 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
482 A special case for case default. If we have
488 it is best to make sure that \tr{default_e} mentions \tr{x} in
489 preference to \tr{y}. The code generator can do a cheaper job if it
490 doesn't have to come up with a binding for \tr{y}.
493 simplAlts :: SimplEnv
494 -> OutExpr -- Simplified scrutinee;
495 -- only of interest if its a var,
496 -- in which case we record its form
498 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Rhs handler
501 simplAlts env scrut (AlgAlts alts deflt) rhs_c
502 = mapSmpl do_alt alts `thenSmpl` \ alts' ->
503 simplDefault env scrut deflt deflt_form rhs_c `thenSmpl` \ deflt' ->
504 returnSmpl (AlgAlts alts' deflt')
506 deflt_form = OtherCon [con | (con,_,_) <- alts]
507 do_alt (con, con_args, rhs)
508 = cloneIds env con_args `thenSmpl` \ con_args' ->
510 env1 = extendIdEnvWithClones env con_args con_args'
511 new_env = case scrut of
512 Var v -> extendEnvGivenNewRhs env1 v (Con con args)
514 (_, ty_args, _) = getAppDataTyConExpandingDicts (idType v)
515 args = map TyArg ty_args ++ map VarArg con_args'
519 rhs_c new_env rhs `thenSmpl` \ rhs' ->
520 returnSmpl (con, con_args', rhs')
522 simplAlts env scrut (PrimAlts alts deflt) rhs_c
523 = mapSmpl do_alt alts `thenSmpl` \ alts' ->
524 simplDefault env scrut deflt deflt_form rhs_c `thenSmpl` \ deflt' ->
525 returnSmpl (PrimAlts alts' deflt')
527 deflt_form = OtherLit [lit | (lit,_) <- alts]
530 new_env = case scrut of
531 Var v -> extendEnvGivenNewRhs env v (Lit lit)
534 rhs_c new_env rhs `thenSmpl` \ rhs' ->
535 returnSmpl (lit, rhs')
538 Use default binder where possible
539 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
540 There's one complication when simplifying the default clause of
541 a case expression. If we see
546 we'd like to convert it to
551 Reason 1: then there might be just one occurrence of x, and it can be
552 inlined as the case scrutinee. So we spot this case when dealing with
553 the default clause, and add a binding to the environment mapping x to
556 Reason 2: if the body is strict in x' then we can eliminate the
557 case altogether. By using x' in preference to x we give the max chance
558 of the strictness analyser finding that the body is strict in x'.
560 On the other hand, if x does *not* get inlined, then we'll actually
561 get somewhat better code from the former expression. So when
562 doing Core -> STG we convert back!
567 -> OutExpr -- Simplified scrutinee
568 -> InDefault -- Default alternative to be completed
569 -> RhsInfo -- Gives form of scrutinee
570 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Old rhs handler
573 simplDefault env scrut NoDefault form rhs_c
574 = returnSmpl NoDefault
576 -- Special case for variable scrutinee; see notes above.
577 simplDefault env (Var scrut_var) (BindDefault binder@(_,occ_info) rhs)
578 info_from_this_case rhs_c
579 = cloneId env binder `thenSmpl` \ binder' ->
581 env1 = extendIdEnvWithClone env binder binder'
582 env2 = extendEnvGivenRhsInfo env1 binder' occ_info info_from_this_case
584 -- Add form details for the default binder
585 scrut_info = lookupRhsInfo env scrut_var
586 env3 = extendEnvGivenRhsInfo env2 binder' occ_info scrut_info
587 new_env = extendEnvGivenNewRhs env3 scrut_var (Var binder')
589 rhs_c new_env rhs `thenSmpl` \ rhs' ->
590 returnSmpl (BindDefault binder' rhs')
592 simplDefault env scrut (BindDefault binder@(_,occ_info) rhs)
593 info_from_this_case rhs_c
594 = cloneId env binder `thenSmpl` \ binder' ->
596 env1 = extendIdEnvWithClone env binder binder'
597 new_env = extendEnvGivenRhsInfo env1 binder' occ_info info_from_this_case
599 rhs_c new_env rhs `thenSmpl` \ rhs' ->
600 returnSmpl (BindDefault binder' rhs')
603 Case alternatives when we know what the scrutinee is
604 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
607 completePrimCaseWithKnownLit
611 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Rhs handler
614 completePrimCaseWithKnownLit env lit (PrimAlts alts deflt) rhs_c
617 search_alts :: [(Literal, InExpr)] -> SmplM OutExpr
619 search_alts ((alt_lit, rhs) : _)
621 = -- Matching alternative!
624 search_alts (_ : other_alts)
625 = -- This alternative doesn't match; keep looking
626 search_alts other_alts
630 NoDefault -> -- Blargh!
631 panic "completePrimCaseWithKnownLit: No matching alternative and no default"
633 BindDefault binder rhs -> -- OK, there's a default case
634 -- Just bind the Id to the atom and continue
636 new_env = extendIdEnvWithAtom env binder (LitArg lit)
641 @completeAlgCaseWithKnownCon@: We know the constructor, so we can
642 select one case alternative (or default). If we choose the default:
643 we do different things depending on whether the constructor was
644 staring us in the face (e.g., \tr{case (p:ps) of {y -> ...}})
645 [let-bind it] or we just know the \tr{y} is now the same as some other
646 var [substitute \tr{y} out of existence].
649 completeAlgCaseWithKnownCon
651 -> DataCon -> [InArg]
652 -- Scrutinee is (con, type, value arguments)
654 -> (SimplEnv -> InExpr -> SmplM OutExpr) -- Rhs handler
657 completeAlgCaseWithKnownCon env con con_args (AlgAlts alts deflt) rhs_c
658 = ASSERT(isDataCon con)
661 search_alts :: [(Id, [InBinder], InExpr)] -> SmplM OutExpr
663 search_alts ((alt_con, alt_args, rhs) : _)
665 = -- Matching alternative!
667 new_env = extendIdEnvWithAtoms env
668 (zipEqual "SimplCase" alt_args (filter isValArg con_args))
672 search_alts (_ : other_alts)
673 = -- This alternative doesn't match; keep looking
674 search_alts other_alts
677 = -- No matching alternative
679 NoDefault -> -- Blargh!
680 panic "completeAlgCaseWithKnownCon: No matching alternative and no default"
682 BindDefault binder@(_,occ_info) rhs -> -- OK, there's a default case
683 -- let-bind the binder to the constructor
684 cloneId env binder `thenSmpl` \ id' ->
686 env1 = extendIdEnvWithClone env binder id'
687 new_env = extendEnvGivenBinding env1 occ_info id' (Con con con_args)
689 rhs_c new_env rhs `thenSmpl` \ rhs' ->
690 returnSmpl (Let (NonRec id' (Con con con_args)) rhs')
693 Case absorption and identity-case elimination
694 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
697 mkCoCase :: SimplEnv -> OutExpr -> OutAlts -> SmplM OutExpr
700 @mkCoCase@ tries the following transformation (if possible):
702 case v of ==> case v of
703 p1 -> rhs1 p1 -> rhs1
705 pm -> rhsm pm -> rhsm
706 d -> case v of pn -> rhsn[v/d] {or (alg) let d=v in rhsn}
707 {or (prim) case v of d -> rhsn}
710 po -> rhso d -> rhsd[d/d'] {or let d'=d in rhsd}
713 which merges two cases in one case when -- the default alternative of
714 the outer case scrutises the same variable as the outer case This
715 transformation is called Case Merging. It avoids that the same
716 variable is scrutinised multiple times.
718 There's a closely-related transformation:
720 case e of ==> case e of
721 p1 -> rhs1 p1 -> rhs1
723 pm -> rhsm pm -> rhsm
724 d -> case d of pn -> let d = pn in rhsn
726 ... po -> let d = po in rhso
727 po -> rhso d -> rhsd[d/d'] {or let d'=d in rhsd}
730 Here, the let's are essential, because d isn't in scope any more.
731 Sigh. Of course, they may be unused, in which case they'll be
732 eliminated on the next round. Unfortunately, we can't figure out
733 whether or not they are used at this juncture.
735 NB: The binder in a BindDefault USED TO BE guaranteed unused if the
736 scrutinee is a variable, because it'll be mapped to the scrutinised
737 variable. Hence the [v/d] substitions can be omitted.
739 ALAS, now the default binder is used by preference, so we have to
740 generate trivial lets to express the substitutions, which will be
741 eliminated on the next pass.
743 The following code handles *both* these transformations (one
744 equation for AlgAlts, one for PrimAlts):
747 mkCoCase env scrut (AlgAlts outer_alts
748 (BindDefault deflt_var
749 (Case (Var scrut_var')
750 (AlgAlts inner_alts inner_deflt))))
751 | switchIsSet env SimplCaseMerge &&
752 ((scrut_is_var && scrut_var == scrut_var') || -- First transformation
753 deflt_var == scrut_var') -- Second transformation
754 = -- Aha! The default-absorption rule applies
755 tick CaseMerge `thenSmpl_`
756 returnSmpl (Case scrut (AlgAlts (outer_alts ++ munged_reduced_inner_alts)
757 (munge_alg_deflt deflt_var inner_deflt)))
758 -- NB: see comment in this location for the PrimAlts case
761 scrut_is_var = case scrut of {Var v -> True; other -> False}
762 scrut_var = case scrut of Var v -> v
764 -- Eliminate any inner alts which are shadowed by the outer ones
765 reduced_inner_alts = [alt | alt@(con,_,_) <- inner_alts,
766 not (con `is_elem` outer_cons)]
767 outer_cons = [con | (con,_,_) <- outer_alts]
768 is_elem = isIn "mkAlgAlts"
770 -- Add the lets if necessary
771 munged_reduced_inner_alts = map munge_alt reduced_inner_alts
773 munge_alt (con, args, rhs) = (con, args, Let (NonRec deflt_var v) rhs)
775 v | scrut_is_var = Var scrut_var
776 | otherwise = Con con (map TyArg arg_tys ++ map VarArg args)
778 arg_tys = case (getAppDataTyConExpandingDicts (idType deflt_var)) of
779 (_, arg_tys, _) -> arg_tys
781 mkCoCase env scrut (PrimAlts
783 (BindDefault deflt_var (Case
785 (PrimAlts inner_alts inner_deflt))))
786 | switchIsSet env SimplCaseMerge &&
787 ((scrut_is_var && scrut_var == scrut_var') ||
788 deflt_var == scrut_var')
789 = -- Aha! The default-absorption rule applies
790 tick CaseMerge `thenSmpl_`
791 returnSmpl (Case scrut (PrimAlts (outer_alts ++ munged_reduced_inner_alts)
792 (munge_prim_deflt deflt_var inner_deflt)))
794 -- Nota Bene: we don't recurse to mkCoCase again, because the
795 -- default will now have a binding in it that prevents
796 -- mkCoCase doing anything useful. Much worse, in this
797 -- PrimAlts case the binding in the default branch is another
798 -- Case, so if we recurse to mkCoCase we will get into an
801 -- ToDo: think of a better way to do this. At the moment
802 -- there is at most one case merge per round. That's probably
803 -- plenty but it seems unclean somehow.
806 scrut_is_var = case scrut of {Var v -> True; other -> False}
807 scrut_var = case scrut of Var v -> v
809 -- Eliminate any inner alts which are shadowed by the outer ones
810 reduced_inner_alts = [alt | alt@(lit,_) <- inner_alts,
811 not (lit `is_elem` outer_lits)]
812 outer_lits = [lit | (lit,_) <- outer_alts]
813 is_elem = isIn "mkPrimAlts"
815 -- Add the lets (well cases actually) if necessary
816 -- The munged alternative looks like
817 -- lit -> case lit of d -> rhs
818 -- The next pass will certainly eliminate the inner case, but
819 -- it isn't easy to do so right away.
820 munged_reduced_inner_alts = map munge_alt reduced_inner_alts
823 | scrut_is_var = (lit, Case (Var scrut_var)
824 (PrimAlts [] (BindDefault deflt_var rhs)))
825 | otherwise = (lit, Case (Lit lit)
826 (PrimAlts [] (BindDefault deflt_var rhs)))
829 Now the identity-case transformation:
838 mkCoCase env scrut alts
840 = tick CaseIdentity `thenSmpl_`
843 identity_alts (AlgAlts alts deflt) = all identity_alg_alt alts && identity_deflt deflt
844 identity_alts (PrimAlts alts deflt) = all identity_prim_alt alts && identity_deflt deflt
846 identity_alg_alt (con, args, Con con' args')
848 && and (zipWith eq_arg args args')
849 && length args == length args'
850 identity_alg_alt other
853 identity_prim_alt (lit, Lit lit') = lit == lit'
854 identity_prim_alt other = False
856 -- For the default case we want to spot both
859 -- case y of { ... ; x -> y }
860 -- as "identity" defaults
861 identity_deflt NoDefault = True
862 identity_deflt (BindDefault binder (Var x)) = x == binder ||
866 identity_deflt _ = False
868 eq_arg binder (VarArg x) = binder == x
875 mkCoCase env other_scrut other_alts = returnSmpl (Case other_scrut other_alts)
878 Boring local functions used above. They simply introduce a trivial binding
879 for the binder, d', in an inner default; either
880 let d' = deflt_var in rhs
882 case deflt_var of d' -> rhs
883 depending on whether it's an algebraic or primitive case.
886 munge_prim_deflt _ NoDefault = NoDefault
888 munge_prim_deflt deflt_var (BindDefault d' rhs)
889 = BindDefault deflt_var (Case (Var deflt_var)
890 (PrimAlts [] (BindDefault d' rhs)))
892 munge_alg_deflt _ NoDefault = NoDefault
894 munge_alg_deflt deflt_var (BindDefault d' rhs)
895 = BindDefault deflt_var (Let (NonRec d' (Var deflt_var)) rhs)
897 -- This line caused a generic version of munge_deflt (ie one used for
898 -- both alg and prim) to space leak massively. No idea why.
899 -- = BindDefault deflt_var (mkCoLetUnboxedToCase (NonRec d' (Var deflt_var)) rhs)
903 cheap_eq :: InExpr -> InExpr -> Bool
904 -- A cheap equality test which bales out fast!
906 cheap_eq (Var v1) (Var v2) = v1==v2
907 cheap_eq (Lit l1) (Lit l2) = l1==l2
908 cheap_eq (Con con1 args1) (Con con2 args2)
909 = con1 == con2 && args1 `eq_args` args2
911 cheap_eq (Prim op1 args1) (Prim op2 args2)
912 = op1 ==op2 && args1 `eq_args` args2
914 cheap_eq (App f1 a1) (App f2 a2)
915 = f1 `cheap_eq` f2 && a1 `eq_arg` a2
919 -- ToDo: make CoreArg an instance of Eq
920 eq_args (a1:as1) (a2:as2) = a1 `eq_arg` a2 && as1 `eq_args` as2
924 eq_arg (LitArg l1) (LitArg l2) = l1 == l2
925 eq_arg (VarArg v1) (VarArg v2) = v1 == v2
926 eq_arg (TyArg t1) (TyArg t2) = t1 `eqTy` t2
927 eq_arg (UsageArg u1) (UsageArg u2) = u1 == u2