2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[DsExpr]{Matching expressions (Exprs)}
7 module DsExpr ( dsExpr, dsLExpr, dsLocalBinds, dsValBinds, dsLit ) where
9 #include "HsVersions.h"
10 #if defined(GHCI) && defined(BREAKPOINT)
11 import Foreign.StablePtr ( newStablePtr, castStablePtrToPtr )
12 import GHC.Exts ( Ptr(..), Int(..), addr2Int# )
13 import IOEnv ( ioToIOEnv )
14 import PrelNames ( breakpointJumpName, breakpointCondJumpName )
15 import TysWiredIn ( unitTy )
16 import TypeRep ( Type(..) )
17 import TyCon ( isUnLiftedTyCon )
20 import Match ( matchWrapper, matchSinglePat, matchEquations )
21 import MatchLit ( dsLit, dsOverLit )
22 import DsBinds ( dsLHsBinds, dsCoercion )
23 import DsGRHSs ( dsGuarded )
24 import DsListComp ( dsListComp, dsPArrComp )
25 import DsUtils ( mkErrorAppDs, mkStringExpr, mkConsExpr, mkNilExpr,
26 extractMatchResult, cantFailMatchResult, matchCanFail,
27 mkCoreTupTy, selectSimpleMatchVarL, lookupEvidence, selectMatchVar )
28 import DsArrows ( dsProcExpr )
32 -- Template Haskell stuff iff bootstrapped
33 import DsMeta ( dsBracket )
37 import TcHsSyn ( hsPatType, mkVanillaTuplePat )
39 -- NB: The desugarer, which straddles the source and Core worlds, sometimes
40 -- needs to see source types (newtypes etc), and sometimes not
41 -- So WATCH OUT; check each use of split*Ty functions.
42 -- Sigh. This is a pain.
44 import TcType ( tcSplitAppTy, tcSplitFunTys, tcTyConAppTyCon,
45 tcTyConAppArgs, isUnLiftedType, Type, mkAppTy )
46 import Type ( splitFunTys, isUnboxedTupleType, mkFunTy )
48 import CoreUtils ( exprType, mkIfThenElse, bindNonRec )
50 import CostCentre ( mkUserCC )
51 import Id ( Id, idType, idName, idDataCon )
52 import PrelInfo ( rEC_CON_ERROR_ID )
53 import DataCon ( DataCon, dataConWrapId, dataConFieldLabels, dataConInstOrigArgTys )
54 import DataCon ( isVanillaDataCon )
55 import TyCon ( FieldLabel, tyConDataCons )
56 import TysWiredIn ( tupleCon )
57 import BasicTypes ( RecFlag(..), Boxity(..), ipNameName )
58 import PrelNames ( toPName,
59 returnMName, bindMName, thenMName, failMName,
61 import SrcLoc ( Located(..), unLoc, getLoc, noLoc )
62 import Util ( zipEqual, zipWithEqual )
63 import Bag ( bagToList )
69 %************************************************************************
71 dsLocalBinds, dsValBinds
73 %************************************************************************
76 dsLocalBinds :: HsLocalBinds Id -> CoreExpr -> DsM CoreExpr
77 dsLocalBinds EmptyLocalBinds body = return body
78 dsLocalBinds (HsValBinds binds) body = dsValBinds binds body
79 dsLocalBinds (HsIPBinds binds) body = dsIPBinds binds body
81 -------------------------
82 dsValBinds :: HsValBinds Id -> CoreExpr -> DsM CoreExpr
83 dsValBinds (ValBindsOut binds _) body = foldrDs ds_val_bind body binds
85 -------------------------
86 dsIPBinds (IPBinds ip_binds dict_binds) body
87 = do { prs <- dsLHsBinds dict_binds
88 ; let inner = Let (Rec prs) body
89 -- The dict bindings may not be in
90 -- dependency order; hence Rec
91 ; foldrDs ds_ip_bind inner ip_binds }
93 ds_ip_bind (L _ (IPBind n e)) body
94 = dsLExpr e `thenDs` \ e' ->
95 returnDs (Let (NonRec (ipNameName n) e') body)
97 -------------------------
98 ds_val_bind :: (RecFlag, LHsBinds Id) -> CoreExpr -> DsM CoreExpr
99 -- Special case for bindings which bind unlifted variables
100 -- We need to do a case right away, rather than building
101 -- a tuple and doing selections.
102 -- Silently ignore INLINE and SPECIALISE pragmas...
103 ds_val_bind (NonRecursive, hsbinds) body
104 | [L _ (AbsBinds [] [] exports binds)] <- bagToList hsbinds,
105 (L loc bind : null_binds) <- bagToList binds,
107 || isUnboxedTupleBind bind
108 || or [isUnLiftedType (idType g) | (_, g, _, _) <- exports]
110 body_w_exports = foldr bind_export body exports
111 bind_export (tvs, g, l, _) body = ASSERT( null tvs )
112 bindNonRec g (Var l) body
114 ASSERT (null null_binds)
115 -- Non-recursive, non-overloaded bindings only come in ones
116 -- ToDo: in some bizarre case it's conceivable that there
117 -- could be dict binds in the 'binds'. (See the notes
118 -- below. Then pattern-match would fail. Urk.)
121 FunBind { fun_id = L _ fun, fun_matches = matches, fun_co_fn = co_fn }
122 -> matchWrapper (FunRhs (idName fun)) matches `thenDs` \ (args, rhs) ->
123 ASSERT( null args ) -- Functions aren't lifted
124 ASSERT( isIdCoercion co_fn )
125 returnDs (bindNonRec fun rhs body_w_exports)
127 PatBind {pat_lhs = pat, pat_rhs = grhss, pat_rhs_ty = ty }
128 -> -- let C x# y# = rhs in body
129 -- ==> case rhs of C x# y# -> body
131 do { rhs <- dsGuarded grhss ty
132 ; let upat = unLoc pat
133 eqn = EqnInfo { eqn_wrap = idWrapper, eqn_pats = [upat],
134 eqn_rhs = cantFailMatchResult body_w_exports }
135 ; var <- selectMatchVar upat ty
136 ; result <- matchEquations PatBindRhs [var] [eqn] (exprType body)
137 ; return (scrungleMatch var rhs result) }
139 other -> pprPanic "dsLet: unlifted" (pprLHsBinds hsbinds $$ ppr body)
142 -- Ordinary case for bindings; none should be unlifted
143 ds_val_bind (is_rec, binds) body
144 = do { prs <- dsLHsBinds binds
145 ; ASSERT( not (any (isUnLiftedType . idType . fst) prs) )
148 other -> return (Let (Rec prs) body) }
149 -- Use a Rec regardless of is_rec.
150 -- Why? Because it allows the binds to be all
151 -- mixed up, which is what happens in one rare case
152 -- Namely, for an AbsBind with no tyvars and no dicts,
153 -- but which does have dictionary bindings.
154 -- See notes with TcSimplify.inferLoop [NO TYVARS]
155 -- It turned out that wrapping a Rec here was the easiest solution
157 -- NB The previous case dealt with unlifted bindings, so we
158 -- only have to deal with lifted ones now; so Rec is ok
160 isUnboxedTupleBind :: HsBind Id -> Bool
161 isUnboxedTupleBind (PatBind { pat_rhs_ty = ty }) = isUnboxedTupleType ty
162 isUnboxedTupleBind other = False
164 scrungleMatch :: Id -> CoreExpr -> CoreExpr -> CoreExpr
165 -- Returns something like (let var = scrut in body)
166 -- but if var is an unboxed-tuple type, it inlines it in a fragile way
167 -- Special case to handle unboxed tuple patterns; they can't appear nested
169 -- case e of (# p1, p2 #) -> rhs
171 -- case e of (# x1, x2 #) -> ... match p1, p2 ...
173 -- let x = e in case x of ....
175 -- But there may be a big
176 -- let fail = ... in case e of ...
177 -- wrapping the whole case, which complicates matters slightly
178 -- It all seems a bit fragile. Test is dsrun013.
180 scrungleMatch var scrut body
181 | isUnboxedTupleType (idType var) = scrungle body
182 | otherwise = bindNonRec var scrut body
184 scrungle (Case (Var x) bndr ty alts)
185 | x == var = Case scrut bndr ty alts
186 scrungle (Let binds body) = Let binds (scrungle body)
187 scrungle other = panic ("scrungleMatch: tuple pattern:\n" ++ showSDoc (ppr other))
190 %************************************************************************
192 \subsection[DsExpr-vars-and-cons]{Variables, constructors, literals}
194 %************************************************************************
197 dsLExpr :: LHsExpr Id -> DsM CoreExpr
198 dsLExpr (L loc e) = putSrcSpanDs loc $ dsExpr e
200 dsExpr :: HsExpr Id -> DsM CoreExpr
202 dsExpr (HsPar e) = dsLExpr e
203 dsExpr (ExprWithTySigOut e _) = dsLExpr e
204 dsExpr (HsVar var) = returnDs (Var var)
205 dsExpr (HsIPVar ip) = returnDs (Var (ipNameName ip))
206 dsExpr (HsLit lit) = dsLit lit
207 dsExpr (HsOverLit lit) = dsOverLit lit
209 dsExpr (NegApp expr neg_expr)
210 = do { core_expr <- dsLExpr expr
211 ; core_neg <- dsExpr neg_expr
212 ; return (core_neg `App` core_expr) }
214 dsExpr expr@(HsLam a_Match)
215 = matchWrapper LambdaExpr a_Match `thenDs` \ (binders, matching_code) ->
216 returnDs (mkLams binders matching_code)
218 #if defined(GHCI) && defined(BREAKPOINT)
219 dsExpr (HsApp (L _ (HsApp realFun@(L _ (HsCoerce _ fun)) (L loc arg))) _)
221 , idName funId `elem` [breakpointJumpName, breakpointCondJumpName]
222 , ids <- filter (isValidType . idType) (extractIds arg)
223 = do warnDs (text "Extracted ids:" <+> ppr ids <+> ppr (map idType ids))
224 stablePtr <- ioToIOEnv $ newStablePtr ids
225 -- Yes, I know... I'm gonna burn in hell.
226 let Ptr addr# = castStablePtrToPtr stablePtr
227 funCore <- dsLExpr realFun
228 argCore <- dsLExpr (L loc (HsLit (HsInt (fromIntegral (I# (addr2Int# addr#))))))
229 hvalCore <- dsLExpr (L loc (extractHVals ids))
230 return ((funCore `App` argCore) `App` hvalCore)
231 where extractIds :: HsExpr Id -> [Id]
232 extractIds (HsApp fn arg)
233 | HsVar argId <- unLoc arg
234 = argId:extractIds (unLoc fn)
235 | TyApp arg' ts <- unLoc arg
236 , HsVar argId <- unLoc arg'
237 = error (showSDoc (ppr ts)) -- argId:extractIds (unLoc fn)
239 extractHVals ids = ExplicitList unitTy (map (L loc . HsVar) ids)
240 -- checks for tyvars and unlifted kinds.
241 isValidType (TyVarTy _) = False
242 isValidType (FunTy a b) = isValidType a && isValidType b
243 isValidType (NoteTy _ t) = isValidType t
244 isValidType (AppTy a b) = isValidType a && isValidType b
245 isValidType (TyConApp con ts) = not (isUnLiftedTyCon con) && all isValidType ts
249 dsExpr expr@(HsApp fun arg)
250 = dsLExpr fun `thenDs` \ core_fun ->
251 dsLExpr arg `thenDs` \ core_arg ->
252 returnDs (core_fun `App` core_arg)
255 Operator sections. At first it looks as if we can convert
264 But no! expr might be a redex, and we can lose laziness badly this
269 for example. So we convert instead to
271 let y = expr in \x -> op y x
273 If \tr{expr} is actually just a variable, say, then the simplifier
277 dsExpr (OpApp e1 op _ e2)
278 = dsLExpr op `thenDs` \ core_op ->
279 -- for the type of y, we need the type of op's 2nd argument
280 dsLExpr e1 `thenDs` \ x_core ->
281 dsLExpr e2 `thenDs` \ y_core ->
282 returnDs (mkApps core_op [x_core, y_core])
284 dsExpr (SectionL expr op) -- Desugar (e !) to ((!) e)
285 = dsLExpr op `thenDs` \ core_op ->
286 dsLExpr expr `thenDs` \ x_core ->
287 returnDs (App core_op x_core)
289 -- dsLExpr (SectionR op expr) -- \ x -> op x expr
290 dsExpr (SectionR op expr)
291 = dsLExpr op `thenDs` \ core_op ->
292 -- for the type of x, we need the type of op's 2nd argument
294 (x_ty:y_ty:_, _) = splitFunTys (exprType core_op)
295 -- See comment with SectionL
297 dsLExpr expr `thenDs` \ y_core ->
298 newSysLocalDs x_ty `thenDs` \ x_id ->
299 newSysLocalDs y_ty `thenDs` \ y_id ->
301 returnDs (bindNonRec y_id y_core $
302 Lam x_id (mkApps core_op [Var x_id, Var y_id]))
304 dsExpr (HsSCC cc expr)
305 = dsLExpr expr `thenDs` \ core_expr ->
306 getModuleDs `thenDs` \ mod_name ->
307 returnDs (Note (SCC (mkUserCC cc mod_name)) core_expr)
310 -- hdaume: core annotation
312 dsExpr (HsCoreAnn fs expr)
313 = dsLExpr expr `thenDs` \ core_expr ->
314 returnDs (Note (CoreNote $ unpackFS fs) core_expr)
316 dsExpr (HsCase discrim matches)
317 = dsLExpr discrim `thenDs` \ core_discrim ->
318 matchWrapper CaseAlt matches `thenDs` \ ([discrim_var], matching_code) ->
319 returnDs (scrungleMatch discrim_var core_discrim matching_code)
321 dsExpr (HsLet binds body)
322 = dsLExpr body `thenDs` \ body' ->
323 dsLocalBinds binds body'
325 -- We need the `ListComp' form to use `deListComp' (rather than the "do" form)
326 -- because the interpretation of `stmts' depends on what sort of thing it is.
328 dsExpr (HsDo ListComp stmts body result_ty)
329 = -- Special case for list comprehensions
330 dsListComp stmts body elt_ty
332 [elt_ty] = tcTyConAppArgs result_ty
334 dsExpr (HsDo DoExpr stmts body result_ty)
335 = dsDo stmts body result_ty
337 dsExpr (HsDo (MDoExpr tbl) stmts body result_ty)
338 = dsMDo tbl stmts body result_ty
340 dsExpr (HsDo PArrComp stmts body result_ty)
341 = -- Special case for array comprehensions
342 dsPArrComp (map unLoc stmts) body elt_ty
344 [elt_ty] = tcTyConAppArgs result_ty
346 dsExpr (HsIf guard_expr then_expr else_expr)
347 = dsLExpr guard_expr `thenDs` \ core_guard ->
348 dsLExpr then_expr `thenDs` \ core_then ->
349 dsLExpr else_expr `thenDs` \ core_else ->
350 returnDs (mkIfThenElse core_guard core_then core_else)
355 \underline{\bf Type lambda and application}
356 % ~~~~~~~~~~~~~~~~~~~~~~~~~~~
358 dsExpr (TyLam tyvars expr)
359 = dsLExpr expr `thenDs` \ core_expr ->
360 returnDs (mkLams tyvars core_expr)
362 dsExpr (TyApp expr tys)
363 = dsLExpr expr `thenDs` \ core_expr ->
364 returnDs (mkTyApps core_expr tys)
369 \underline{\bf Various data construction things}
370 % ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
372 dsExpr (ExplicitList ty xs)
375 go [] = returnDs (mkNilExpr ty)
376 go (x:xs) = dsLExpr x `thenDs` \ core_x ->
377 go xs `thenDs` \ core_xs ->
378 returnDs (mkConsExpr ty core_x core_xs)
380 -- we create a list from the array elements and convert them into a list using
383 -- * the main disadvantage to this scheme is that `toP' traverses the list
384 -- twice: once to determine the length and a second time to put to elements
385 -- into the array; this inefficiency could be avoided by exposing some of
386 -- the innards of `PrelPArr' to the compiler (ie, have a `PrelPArrBase') so
387 -- that we can exploit the fact that we already know the length of the array
388 -- here at compile time
390 dsExpr (ExplicitPArr ty xs)
391 = dsLookupGlobalId toPName `thenDs` \toP ->
392 dsExpr (ExplicitList ty xs) `thenDs` \coreList ->
393 returnDs (mkApps (Var toP) [Type ty, coreList])
395 dsExpr (ExplicitTuple expr_list boxity)
396 = mappM dsLExpr expr_list `thenDs` \ core_exprs ->
397 returnDs (mkConApp (tupleCon boxity (length expr_list))
398 (map (Type . exprType) core_exprs ++ core_exprs))
400 dsExpr (ArithSeq expr (From from))
401 = dsExpr expr `thenDs` \ expr2 ->
402 dsLExpr from `thenDs` \ from2 ->
403 returnDs (App expr2 from2)
405 dsExpr (ArithSeq expr (FromTo from two))
406 = dsExpr expr `thenDs` \ expr2 ->
407 dsLExpr from `thenDs` \ from2 ->
408 dsLExpr two `thenDs` \ two2 ->
409 returnDs (mkApps expr2 [from2, two2])
411 dsExpr (ArithSeq expr (FromThen from thn))
412 = dsExpr expr `thenDs` \ expr2 ->
413 dsLExpr from `thenDs` \ from2 ->
414 dsLExpr thn `thenDs` \ thn2 ->
415 returnDs (mkApps expr2 [from2, thn2])
417 dsExpr (ArithSeq expr (FromThenTo from thn two))
418 = dsExpr expr `thenDs` \ expr2 ->
419 dsLExpr from `thenDs` \ from2 ->
420 dsLExpr thn `thenDs` \ thn2 ->
421 dsLExpr two `thenDs` \ two2 ->
422 returnDs (mkApps expr2 [from2, thn2, two2])
424 dsExpr (PArrSeq expr (FromTo from two))
425 = dsExpr expr `thenDs` \ expr2 ->
426 dsLExpr from `thenDs` \ from2 ->
427 dsLExpr two `thenDs` \ two2 ->
428 returnDs (mkApps expr2 [from2, two2])
430 dsExpr (PArrSeq expr (FromThenTo from thn two))
431 = dsExpr expr `thenDs` \ expr2 ->
432 dsLExpr from `thenDs` \ from2 ->
433 dsLExpr thn `thenDs` \ thn2 ->
434 dsLExpr two `thenDs` \ two2 ->
435 returnDs (mkApps expr2 [from2, thn2, two2])
437 dsExpr (PArrSeq expr _)
438 = panic "DsExpr.dsExpr: Infinite parallel array!"
439 -- the parser shouldn't have generated it and the renamer and typechecker
440 -- shouldn't have let it through
444 \underline{\bf Record construction and update}
445 % ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
446 For record construction we do this (assuming T has three arguments)
450 let err = /\a -> recConErr a
451 T (recConErr t1 "M.lhs/230/op1")
453 (recConErr t1 "M.lhs/230/op3")
455 @recConErr@ then converts its arugment string into a proper message
456 before printing it as
458 M.lhs, line 230: missing field op1 was evaluated
461 We also handle @C{}@ as valid construction syntax for an unlabelled
462 constructor @C@, setting all of @C@'s fields to bottom.
465 dsExpr (RecordCon (L _ data_con_id) con_expr rbinds)
466 = dsExpr con_expr `thenDs` \ con_expr' ->
468 (arg_tys, _) = tcSplitFunTys (exprType con_expr')
469 -- A newtype in the corner should be opaque;
470 -- hence TcType.tcSplitFunTys
472 mk_arg (arg_ty, lbl) -- Selector id has the field label as its name
473 = case [rhs | (L _ sel_id, rhs) <- rbinds, lbl == idName sel_id] of
474 (rhs:rhss) -> ASSERT( null rhss )
476 [] -> mkErrorAppDs rEC_CON_ERROR_ID arg_ty (showSDoc (ppr lbl))
477 unlabelled_bottom arg_ty = mkErrorAppDs rEC_CON_ERROR_ID arg_ty ""
479 labels = dataConFieldLabels (idDataCon data_con_id)
480 -- The data_con_id is guaranteed to be the wrapper id of the constructor
484 then mappM unlabelled_bottom arg_tys
485 else mappM mk_arg (zipEqual "dsExpr:RecordCon" arg_tys labels))
486 `thenDs` \ con_args ->
488 returnDs (mkApps con_expr' con_args)
491 Record update is a little harder. Suppose we have the decl:
493 data T = T1 {op1, op2, op3 :: Int}
494 | T2 {op4, op2 :: Int}
497 Then we translate as follows:
503 T1 op1 _ op3 -> T1 op1 op2 op3
504 T2 op4 _ -> T2 op4 op2
505 other -> recUpdError "M.lhs/230"
507 It's important that we use the constructor Ids for @T1@, @T2@ etc on the
508 RHSs, and do not generate a Core constructor application directly, because the constructor
509 might do some argument-evaluation first; and may have to throw away some
513 dsExpr (RecordUpd record_expr [] record_in_ty record_out_ty)
514 = dsLExpr record_expr
516 dsExpr expr@(RecordUpd record_expr rbinds record_in_ty record_out_ty)
517 = dsLExpr record_expr `thenDs` \ record_expr' ->
519 -- Desugar the rbinds, and generate let-bindings if
520 -- necessary so that we don't lose sharing
523 in_inst_tys = tcTyConAppArgs record_in_ty -- Newtype opaque
524 out_inst_tys = tcTyConAppArgs record_out_ty -- Newtype opaque
525 in_out_ty = mkFunTy record_in_ty record_out_ty
527 mk_val_arg field old_arg_id
528 = case [rhs | (L _ sel_id, rhs) <- rbinds, field == idName sel_id] of
529 (rhs:rest) -> ASSERT(null rest) rhs
530 [] -> nlHsVar old_arg_id
533 = newSysLocalsDs (dataConInstOrigArgTys con in_inst_tys) `thenDs` \ arg_ids ->
534 -- This call to dataConInstOrigArgTys won't work for existentials
535 -- but existentials don't have record types anyway
537 val_args = zipWithEqual "dsExpr:RecordUpd" mk_val_arg
538 (dataConFieldLabels con) arg_ids
539 rhs = foldl (\a b -> nlHsApp a b)
540 (noLoc $ TyApp (nlHsVar (dataConWrapId con))
544 returnDs (mkSimpleMatch [noLoc $ ConPatOut (noLoc con) [] [] emptyLHsBinds
545 (PrefixCon (map nlVarPat arg_ids)) record_in_ty]
548 -- Record stuff doesn't work for existentials
549 -- The type checker checks for this, but we need
550 -- worry only about the constructors that are to be updated
551 ASSERT2( all isVanillaDataCon cons_to_upd, ppr expr )
553 -- It's important to generate the match with matchWrapper,
554 -- and the right hand sides with applications of the wrapper Id
555 -- so that everything works when we are doing fancy unboxing on the
556 -- constructor aguments.
557 mappM mk_alt cons_to_upd `thenDs` \ alts ->
558 matchWrapper RecUpd (MatchGroup alts in_out_ty) `thenDs` \ ([discrim_var], matching_code) ->
560 returnDs (bindNonRec discrim_var record_expr' matching_code)
563 updated_fields :: [FieldLabel]
564 updated_fields = [ idName sel_id | (L _ sel_id,_) <- rbinds]
566 -- Get the type constructor from the record_in_ty
567 -- so that we are sure it'll have all its DataCons
568 -- (In GHCI, it's possible that some TyCons may not have all
569 -- their constructors, in a module-loop situation.)
570 tycon = tcTyConAppTyCon record_in_ty
571 data_cons = tyConDataCons tycon
572 cons_to_upd = filter has_all_fields data_cons
574 has_all_fields :: DataCon -> Bool
575 has_all_fields con_id
576 = all (`elem` con_fields) updated_fields
578 con_fields = dataConFieldLabels con_id
583 \underline{\bf Dictionary lambda and application}
584 % ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
585 @DictLam@ and @DictApp@ turn into the regular old things.
586 (OLD:) @DictFunApp@ also becomes a curried application, albeit slightly more
587 complicated; reminiscent of fully-applied constructors.
589 dsExpr (DictLam dictvars expr)
590 = dsLExpr expr `thenDs` \ core_expr ->
591 returnDs (mkLams dictvars core_expr)
595 dsExpr (DictApp expr dicts) -- becomes a curried application
596 = dsLExpr expr `thenDs` \ core_expr ->
597 returnDs (foldl (\f d -> f `App` (Var d)) core_expr dicts)
599 dsExpr (HsCoerce co_fn e) = dsCoercion co_fn (dsExpr e)
602 Here is where we desugar the Template Haskell brackets and escapes
605 -- Template Haskell stuff
607 #ifdef GHCI /* Only if bootstrapping */
608 dsExpr (HsBracketOut x ps) = dsBracket x ps
609 dsExpr (HsSpliceE s) = pprPanic "dsExpr:splice" (ppr s)
612 -- Arrow notation extension
613 dsExpr (HsProc pat cmd) = dsProcExpr pat cmd
620 -- HsSyn constructs that just shouldn't be here:
621 dsExpr (ExprWithTySig _ _) = panic "dsExpr:ExprWithTySig"
626 %--------------------------------------------------------------------
628 Desugar 'do' and 'mdo' expressions (NOT list comprehensions, they're
629 handled in DsListComp). Basically does the translation given in the
635 -> Type -- Type of the whole expression
638 dsDo stmts body result_ty
639 = go (map unLoc stmts)
643 go (ExprStmt rhs then_expr _ : stmts)
644 = do { rhs2 <- dsLExpr rhs
645 ; then_expr2 <- dsExpr then_expr
647 ; returnDs (mkApps then_expr2 [rhs2, rest]) }
649 go (LetStmt binds : stmts)
650 = do { rest <- go stmts
651 ; dsLocalBinds binds rest }
653 go (BindStmt pat rhs bind_op fail_op : stmts)
654 = do { body <- go stmts
655 ; var <- selectSimpleMatchVarL pat
656 ; match <- matchSinglePat (Var var) (StmtCtxt DoExpr) pat
657 result_ty (cantFailMatchResult body)
658 ; match_code <- handle_failure pat match fail_op
659 ; rhs' <- dsLExpr rhs
660 ; bind_op' <- dsExpr bind_op
661 ; returnDs (mkApps bind_op' [rhs', Lam var match_code]) }
663 -- In a do expression, pattern-match failure just calls
664 -- the monadic 'fail' rather than throwing an exception
665 handle_failure pat match fail_op
667 = do { fail_op' <- dsExpr fail_op
668 ; fail_msg <- mkStringExpr (mk_fail_msg pat)
669 ; extractMatchResult match (App fail_op' fail_msg) }
671 = extractMatchResult match (error "It can't fail")
673 mk_fail_msg pat = "Pattern match failure in do expression at " ++
674 showSDoc (ppr (getLoc pat))
677 Translation for RecStmt's:
678 -----------------------------
679 We turn (RecStmt [v1,..vn] stmts) into:
681 (v1,..,vn) <- mfix (\~(v1,..vn). do stmts
688 -> Type -- Type of the whole expression
691 dsMDo tbl stmts body result_ty
692 = go (map unLoc stmts)
694 (m_ty, b_ty) = tcSplitAppTy result_ty -- result_ty must be of the form (m b)
695 mfix_id = lookupEvidence tbl mfixName
696 return_id = lookupEvidence tbl returnMName
697 bind_id = lookupEvidence tbl bindMName
698 then_id = lookupEvidence tbl thenMName
699 fail_id = lookupEvidence tbl failMName
704 go (LetStmt binds : stmts)
705 = do { rest <- go stmts
706 ; dsLocalBinds binds rest }
708 go (ExprStmt rhs _ rhs_ty : stmts)
709 = do { rhs2 <- dsLExpr rhs
711 ; returnDs (mkApps (Var then_id) [Type rhs_ty, Type b_ty, rhs2, rest]) }
713 go (BindStmt pat rhs _ _ : stmts)
714 = do { body <- go stmts
715 ; var <- selectSimpleMatchVarL pat
716 ; match <- matchSinglePat (Var var) (StmtCtxt ctxt) pat
717 result_ty (cantFailMatchResult body)
718 ; fail_msg <- mkStringExpr (mk_fail_msg pat)
719 ; let fail_expr = mkApps (Var fail_id) [Type b_ty, fail_msg]
720 ; match_code <- extractMatchResult match fail_expr
722 ; rhs' <- dsLExpr rhs
723 ; returnDs (mkApps (Var bind_id) [Type (hsPatType pat), Type b_ty,
724 rhs', Lam var match_code]) }
726 go (RecStmt rec_stmts later_ids rec_ids rec_rets binds : stmts)
727 = ASSERT( length rec_ids > 0 )
728 ASSERT( length rec_ids == length rec_rets )
729 go (new_bind_stmt : let_stmt : stmts)
731 new_bind_stmt = mkBindStmt (mk_tup_pat later_pats) mfix_app
732 let_stmt = LetStmt (HsValBinds (ValBindsOut [(Recursive, binds)] []))
735 -- Remove the later_ids that appear (without fancy coercions)
736 -- in rec_rets, because there's no need to knot-tie them separately
737 -- See Note [RecStmt] in HsExpr
738 later_ids' = filter (`notElem` mono_rec_ids) later_ids
739 mono_rec_ids = [ id | HsVar id <- rec_rets ]
741 mfix_app = nlHsApp (noLoc $ TyApp (nlHsVar mfix_id) [tup_ty]) mfix_arg
742 mfix_arg = noLoc $ HsLam (MatchGroup [mkSimpleMatch [mfix_pat] body]
743 (mkFunTy tup_ty body_ty))
745 -- The rec_tup_pat must bind the rec_ids only; remember that the
746 -- trimmed_laters may share the same Names
747 -- Meanwhile, the later_pats must bind the later_vars
748 rec_tup_pats = map mk_wild_pat later_ids' ++ map nlVarPat rec_ids
749 later_pats = map nlVarPat later_ids' ++ map mk_later_pat rec_ids
750 rets = map nlHsVar later_ids' ++ map noLoc rec_rets
752 mfix_pat = noLoc $ LazyPat $ mk_tup_pat rec_tup_pats
753 body = noLoc $ HsDo ctxt rec_stmts return_app body_ty
754 body_ty = mkAppTy m_ty tup_ty
755 tup_ty = mkCoreTupTy (map idType (later_ids' ++ rec_ids))
756 -- mkCoreTupTy deals with singleton case
758 return_app = nlHsApp (noLoc $ TyApp (nlHsVar return_id) [tup_ty])
761 mk_wild_pat :: Id -> LPat Id
762 mk_wild_pat v = noLoc $ WildPat $ idType v
764 mk_later_pat :: Id -> LPat Id
765 mk_later_pat v | v `elem` later_ids' = mk_wild_pat v
766 | otherwise = nlVarPat v
768 mk_tup_pat :: [LPat Id] -> LPat Id
770 mk_tup_pat ps = noLoc $ mkVanillaTuplePat ps Boxed
772 mk_ret_tup :: [LHsExpr Id] -> LHsExpr Id
774 mk_ret_tup rs = noLoc $ ExplicitTuple rs Boxed