2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[Main_match]{The @match@ function}
7 module Match ( match, matchWrapper, matchSimply, matchSinglePat ) where
9 #include "HsVersions.h"
11 import DynFlags ( DynFlag(..), dopt )
13 import TcHsSyn ( hsPatType )
14 import Check ( check, ExhaustivePat )
16 import CoreUtils ( bindNonRec, exprType )
18 import DsBinds ( dsHsNestedBinds )
19 import DsGRHSs ( dsGRHSs )
21 import Id ( idName, idType, Id )
22 import DataCon ( dataConFieldLabels, dataConInstOrigArgTys, isVanillaDataCon )
23 import MatchCon ( matchConFamily )
24 import MatchLit ( matchLiterals, matchNPlusKPats, matchNPats, tidyLitPat, tidyNPat )
25 import PrelInfo ( pAT_ERROR_ID )
26 import TcType ( Type, tcTyConAppArgs )
27 import Type ( splitFunTysN )
28 import TysWiredIn ( consDataCon, mkTupleTy, mkListTy,
29 tupleCon, parrFakeCon, mkPArrTy )
30 import BasicTypes ( Boxity(..) )
31 import ListSetOps ( runs )
32 import SrcLoc ( noSrcSpan, noLoc, unLoc, Located(..) )
33 import Util ( lengthExceeds, notNull )
38 This function is a wrapper of @match@, it must be called from all the parts where
39 it was called match, but only substitutes the firs call, ....
40 if the associated flags are declared, warnings will be issued.
41 It can not be called matchWrapper because this name already exists :-(
46 matchCheck :: DsMatchContext
47 -> [Id] -- Vars rep'ing the exprs we're matching with
48 -> Type -- Type of the case expression
49 -> [EquationInfo] -- Info about patterns, etc. (type synonym below)
50 -> DsM MatchResult -- Desugared result!
52 matchCheck ctx vars ty qs
53 = getDOptsDs `thenDs` \ dflags ->
54 matchCheck_really dflags ctx vars ty qs
56 matchCheck_really dflags ctx vars ty qs
57 | incomplete && shadow =
58 dsShadowWarn ctx eqns_shadow `thenDs` \ () ->
59 dsIncompleteWarn ctx pats `thenDs` \ () ->
62 dsIncompleteWarn ctx pats `thenDs` \ () ->
65 dsShadowWarn ctx eqns_shadow `thenDs` \ () ->
69 where (pats, eqns_shadow) = check qs
70 incomplete = want_incomplete && (notNull pats)
71 want_incomplete = case ctx of
72 DsMatchContext RecUpd _ _ ->
73 dopt Opt_WarnIncompletePatternsRecUpd dflags
75 dopt Opt_WarnIncompletePatterns dflags
76 shadow = dopt Opt_WarnOverlappingPatterns dflags
77 && not (null eqns_shadow)
80 This variable shows the maximum number of lines of output generated for warnings.
81 It will limit the number of patterns/equations displayed to@ maximum_output@.
83 (ToDo: add command-line option?)
89 The next two functions create the warning message.
92 dsShadowWarn :: DsMatchContext -> [EquationInfo] -> DsM ()
93 dsShadowWarn ctx@(DsMatchContext kind _ _) qs = dsWarn warn
95 warn | qs `lengthExceeds` maximum_output
96 = pp_context ctx (ptext SLIT("are overlapped"))
97 (\ f -> vcat (map (ppr_eqn f kind) (take maximum_output qs)) $$
100 = pp_context ctx (ptext SLIT("are overlapped"))
101 (\ f -> vcat $ map (ppr_eqn f kind) qs)
104 dsIncompleteWarn :: DsMatchContext -> [ExhaustivePat] -> DsM ()
105 dsIncompleteWarn ctx@(DsMatchContext kind _ _) pats = dsWarn warn
107 warn = pp_context ctx (ptext SLIT("are non-exhaustive"))
108 (\f -> hang (ptext SLIT("Patterns not matched:"))
109 4 ((vcat $ map (ppr_incomplete_pats kind)
110 (take maximum_output pats))
113 dots | pats `lengthExceeds` maximum_output = ptext SLIT("...")
116 pp_context (DsMatchContext kind pats loc) msg rest_of_msg_fun
117 = (loc, vcat [ptext SLIT("Pattern match(es)") <+> msg,
118 sep [ptext SLIT("In") <+> ppr_match <> char ':', nest 4 (rest_of_msg_fun pref)]])
122 FunRhs fun -> (pprMatchContext kind, \ pp -> ppr fun <+> pp)
123 other -> (pprMatchContext kind, \ pp -> pp)
125 ppr_pats pats = sep (map ppr pats)
127 ppr_shadow_pats kind pats
128 = sep [ppr_pats pats, matchSeparator kind, ptext SLIT("...")]
130 ppr_incomplete_pats kind (pats,[]) = ppr_pats pats
131 ppr_incomplete_pats kind (pats,constraints) =
132 sep [ppr_pats pats, ptext SLIT("with"),
133 sep (map ppr_constraint constraints)]
136 ppr_constraint (var,pats) = sep [ppr var, ptext SLIT("`notElem`"), ppr pats]
138 ppr_eqn prefixF kind eqn = prefixF (ppr_shadow_pats kind (eqn_pats eqn))
142 The function @match@ is basically the same as in the Wadler chapter,
143 except it is monadised, to carry around the name supply, info about
146 Notes on @match@'s arguments, assuming $m$ equations and $n$ patterns:
149 A list of $n$ variable names, those variables presumably bound to the
150 $n$ expressions being matched against the $n$ patterns. Using the
151 list of $n$ expressions as the first argument showed no benefit and
155 The second argument, a list giving the ``equation info'' for each of
159 the $n$ patterns for that equation, and
161 a list of Core bindings [@(Id, CoreExpr)@ pairs] to be ``stuck on
162 the front'' of the matching code, as in:
168 and finally: (ToDo: fill in)
170 The right way to think about the ``after-match function'' is that it
171 is an embryonic @CoreExpr@ with a ``hole'' at the end for the
172 final ``else expression''.
175 There is a type synonym, @EquationInfo@, defined in module @DsUtils@.
177 An experiment with re-ordering this information about equations (in
178 particular, having the patterns available in column-major order)
182 A default expression---what to evaluate if the overall pattern-match
183 fails. This expression will (almost?) always be
184 a measly expression @Var@, unless we know it will only be used once
185 (as we do in @glue_success_exprs@).
187 Leaving out this third argument to @match@ (and slamming in lots of
188 @Var "fail"@s) is a positively {\em bad} idea, because it makes it
189 impossible to share the default expressions. (Also, it stands no
190 chance of working in our post-upheaval world of @Locals@.)
192 So, the full type signature:
194 match :: [Id] -- Variables rep'ing the exprs we're matching with
195 -> Type -- Type of the case expression
196 -> [EquationInfo] -- Info about patterns, etc. (type synonym below)
197 -> DsM MatchResult -- Desugared result!
200 Note: @match@ is often called via @matchWrapper@ (end of this module),
201 a function that does much of the house-keeping that goes with a call
204 It is also worth mentioning the {\em typical} way a block of equations
205 is desugared with @match@. At each stage, it is the first column of
206 patterns that is examined. The steps carried out are roughly:
209 Tidy the patterns in column~1 with @tidyEqnInfo@ (this may add
210 bindings to the second component of the equation-info):
213 Remove the `as' patterns from column~1.
215 Make all constructor patterns in column~1 into @ConPats@, notably
216 @ListPats@ and @TuplePats@.
218 Handle any irrefutable (or ``twiddle'') @LazyPats@.
221 Now {\em unmix} the equations into {\em blocks} [w/ local function
222 @unmix_eqns@], in which the equations in a block all have variable
223 patterns in column~1, or they all have constructor patterns in ...
224 (see ``the mixture rule'' in SLPJ).
226 Call @matchEqnBlock@ on each block of equations; it will do the
227 appropriate thing for each kind of column-1 pattern, usually ending up
228 in a recursive call to @match@.
231 %************************************************************************
233 %* match: empty rule *
235 %************************************************************************
236 \subsection[Match-empty-rule]{The ``empty rule''}
238 We are a little more paranoid about the ``empty rule'' (SLPJ, p.~87)
239 than the Wadler-chapter code for @match@ (p.~93, first @match@ clause).
240 And gluing the ``success expressions'' together isn't quite so pretty.
243 match [] ty eqns_info
244 = ASSERT( not (null eqns_info) )
245 returnDs (foldr1 combineMatchResults match_results)
247 match_results = [ ASSERT( null (eqn_pats eqn) )
248 adjustMatchResult (eqn_wrap eqn) (eqn_rhs eqn)
253 %************************************************************************
255 %* match: non-empty rule *
257 %************************************************************************
258 \subsection[Match-nonempty]{@match@ when non-empty: unmixing}
260 This (more interesting) clause of @match@ uses @tidy_and_unmix_eqns@
261 (a)~to get `as'- and `twiddle'-patterns out of the way (tidying), and
262 (b)~to do ``the mixture rule'' (SLPJ, p.~88) [which really {\em
263 un}mixes the equations], producing a list of equation-info
264 blocks, each block having as its first column of patterns either all
265 constructors, or all variables (or similar beasts), etc.
267 @match_unmixed_eqn_blks@ simply takes the place of the @foldr@ in the
268 Wadler-chapter @match@ (p.~93, last clause), and @match_unmixed_blk@
269 corresponds roughly to @matchVarCon@.
272 match vars@(v:_) ty eqns_info
273 = do { tidy_eqns <- mappM (tidyEqnInfo v) eqns_info
274 ; let eqns_blks = runs same_family tidy_eqns
275 ; match_results <- mappM match_block eqns_blks
276 ; ASSERT( not (null match_results) )
277 return (foldr1 combineMatchResults match_results) }
279 same_family eqn1 eqn2
280 = samePatFamily (firstPat eqn1) (firstPat eqn2)
283 = case firstPat (head eqns) of
284 WildPat {} -> matchVariables vars ty eqns
285 ConPatOut {} -> matchConFamily vars ty eqns
286 NPlusKPat {} -> matchNPlusKPats vars ty eqns
287 NPat {} -> matchNPats vars ty eqns
288 LitPat {} -> matchLiterals vars ty eqns
290 -- After tidying, there are only five kinds of patterns
291 samePatFamily (WildPat {}) (WildPat {}) = True
292 samePatFamily (ConPatOut {}) (ConPatOut {}) = True
293 samePatFamily (NPlusKPat {}) (NPlusKPat {}) = True
294 samePatFamily (NPat {}) (NPat {}) = True
295 samePatFamily (LitPat {}) (LitPat {}) = True
296 samePatFamily _ _ = False
298 matchVariables :: [Id] -> Type -> [EquationInfo] -> DsM MatchResult
299 -- Real true variables, just like in matchVar, SLPJ p 94
300 -- No binding to do: they'll all be wildcards by now (done in tidy)
301 matchVariables (var:vars) ty eqns = match vars ty (shiftEqns eqns)
307 Tidy up the leftmost pattern in an @EquationInfo@, given the variable @v@
308 which will be scrutinised. This means:
311 Replace variable patterns @x@ (@x /= v@) with the pattern @_@,
312 together with the binding @x = v@.
314 Replace the `as' pattern @x@@p@ with the pattern p and a binding @x = v@.
316 Removing lazy (irrefutable) patterns (you don't want to know...).
318 Converting explicit tuple-, list-, and parallel-array-pats into ordinary
321 Convert the literal pat "" to [].
324 The result of this tidying is that the column of patterns will include
328 The @VarPat@ information isn't needed any more after this.
331 @ListPats@, @TuplePats@, etc., are all converted into @ConPats@.
333 \item[@LitPats@ and @NPats@:]
334 @LitPats@/@NPats@ of ``known friendly types'' (Int, Char,
335 Float, Double, at least) are converted to unboxed form; e.g.,
336 \tr{(NPat (HsInt i) _ _)} is converted to:
338 (ConPat I# _ _ [LitPat (HsIntPrim i)])
343 tidyEqnInfo :: Id -> EquationInfo -> DsM EquationInfo
344 -- DsM'd because of internal call to dsHsNestedBinds
345 -- and mkSelectorBinds.
346 -- "tidy1" does the interesting stuff, looking at
347 -- one pattern and fiddling the list of bindings.
349 -- POST CONDITION: head pattern in the EqnInfo is
357 tidyEqnInfo v eqn@(EqnInfo { eqn_wrap = wrap, eqn_pats = pat : pats })
358 = tidy1 v wrap pat `thenDs` \ (wrap', pat') ->
359 returnDs (eqn { eqn_wrap = wrap', eqn_pats = pat' : pats })
361 tidy1 :: Id -- The Id being scrutinised
362 -> DsWrapper -- Previous wrapping bindings
363 -> Pat Id -- The pattern against which it is to be matched
364 -> DsM (DsWrapper, -- Extra bindings around what to do afterwards
365 Pat Id) -- Equivalent pattern
367 -- The extra bindings etc are all wrapped around the RHS of the match
368 -- so they are only available when matching is complete. But that's ok
369 -- becuase, for example, in the pattern x@(...), the x can only be
370 -- used in the RHS, not in the nested pattern, nor subsquent patterns
372 -- However this does have an awkward consequence. The bindings in
373 -- a VarPatOut get wrapped around the result in right to left order,
374 -- rather than left to right. This only matters if one set of
375 -- bindings can mention things used in another, and that can happen
376 -- if we allow equality dictionary bindings of form d1=d2.
377 -- bindIInstsOfLocalFuns is now careful not to do this, but it's a wart.
378 -- (Without this care in bindInstsOfLocalFuns, compiling
379 -- Data.Generics.Schemes.hs fails in function everywhereBut.)
381 -------------------------------------------------------
382 -- (pat', mr') = tidy1 v pat mr
383 -- tidies the *outer level only* of pat, giving pat'
384 -- It eliminates many pattern forms (as-patterns, variable patterns,
385 -- list patterns, etc) yielding one of:
392 tidy1 v wrap (ParPat pat) = tidy1 v wrap (unLoc pat)
393 tidy1 v wrap (SigPatOut pat _) = tidy1 v wrap (unLoc pat)
394 tidy1 v wrap (WildPat ty) = returnDs (wrap, WildPat ty)
396 -- case v of { x -> mr[] }
397 -- = case v of { _ -> let x=v in mr[] }
398 tidy1 v wrap (VarPat var)
399 = returnDs (wrap . wrapBind var v, WildPat (idType var))
401 tidy1 v wrap (VarPatOut var binds)
402 = do { prs <- dsHsNestedBinds binds
403 ; return (wrap . wrapBind var v . mkDsLet (Rec prs),
404 WildPat (idType var)) }
406 -- case v of { x@p -> mr[] }
407 -- = case v of { p -> let x=v in mr[] }
408 tidy1 v wrap (AsPat (L _ var) pat)
409 = tidy1 v (wrap . wrapBind var v) (unLoc pat)
412 {- now, here we handle lazy patterns:
413 tidy1 v ~p bs = (v, v1 = case v of p -> v1 :
414 v2 = case v of p -> v2 : ... : bs )
416 where the v_i's are the binders in the pattern.
418 ToDo: in "v_i = ... -> v_i", are the v_i's really the same thing?
420 The case expr for v_i is just: match [v] [(p, [], \ x -> Var v_i)] any_expr
423 tidy1 v wrap (LazyPat pat)
424 = do { v' <- newSysLocalDs (idType v)
425 ; sel_prs <- mkSelectorBinds pat (Var v)
426 ; let sel_binds = [NonRec b rhs | (b,rhs) <- sel_prs]
427 ; returnDs (wrap . wrapBind v' v . mkDsLets sel_binds,
428 WildPat (idType v)) }
430 -- re-express <con-something> as (ConPat ...) [directly]
432 tidy1 v wrap (ConPatOut (L loc con) ex_tvs dicts binds ps pat_ty)
433 = returnDs (wrap, ConPatOut (L loc con) ex_tvs dicts binds tidy_ps pat_ty)
435 tidy_ps = PrefixCon (tidy_con con pat_ty ps)
437 tidy1 v wrap (ListPat pats ty)
438 = returnDs (wrap, unLoc list_ConPat)
440 list_ty = mkListTy ty
441 list_ConPat = foldr (\ x y -> mkPrefixConPat consDataCon [x, y] list_ty)
445 -- Introduce fake parallel array constructors to be able to handle parallel
446 -- arrays with the existing machinery for constructor pattern
447 tidy1 v wrap (PArrPat pats ty)
448 = returnDs (wrap, unLoc parrConPat)
451 parrConPat = mkPrefixConPat (parrFakeCon arity) pats (mkPArrTy ty)
453 tidy1 v wrap (TuplePat pats boxity)
454 = returnDs (wrap, unLoc tuple_ConPat)
457 tuple_ConPat = mkPrefixConPat (tupleCon boxity arity) pats
458 (mkTupleTy boxity arity (map hsPatType pats))
460 tidy1 v wrap (DictPat dicts methods)
461 = case num_of_d_and_ms of
462 0 -> tidy1 v wrap (TuplePat [] Boxed)
463 1 -> tidy1 v wrap (unLoc (head dict_and_method_pats))
464 _ -> tidy1 v wrap (TuplePat dict_and_method_pats Boxed)
466 num_of_d_and_ms = length dicts + length methods
467 dict_and_method_pats = map nlVarPat (dicts ++ methods)
469 -- LitPats: we *might* be able to replace these w/ a simpler form
470 tidy1 v wrap pat@(LitPat lit)
471 = returnDs (wrap, unLoc (tidyLitPat lit (noLoc pat)))
473 -- NPats: we *might* be able to replace these w/ a simpler form
474 tidy1 v wrap pat@(NPat lit mb_neg _ lit_ty)
475 = returnDs (wrap, unLoc (tidyNPat lit mb_neg lit_ty (noLoc pat)))
477 -- and everything else goes through unchanged...
479 tidy1 v wrap non_interesting_pat
480 = returnDs (wrap, non_interesting_pat)
483 tidy_con data_con pat_ty (PrefixCon ps) = ps
484 tidy_con data_con pat_ty (InfixCon p1 p2) = [p1,p2]
485 tidy_con data_con pat_ty (RecCon rpats)
487 = -- Special case for C {}, which can be used for
488 -- a constructor that isn't declared to have
490 map (noLoc . WildPat) con_arg_tys'
493 = ASSERT( isVanillaDataCon data_con )
494 -- We're in a record case, so the data con must be vanilla
495 -- and hence no existentials to worry about
496 map mk_pat tagged_arg_tys
498 -- Boring stuff to find the arg-tys of the constructor
500 inst_tys = tcTyConAppArgs pat_ty -- Newtypes must be opaque
501 con_arg_tys' = dataConInstOrigArgTys data_con inst_tys
502 tagged_arg_tys = con_arg_tys' `zip` dataConFieldLabels data_con
504 -- mk_pat picks a WildPat of the appropriate type for absent fields,
505 -- and the specified pattern for present fields
506 mk_pat (arg_ty, lbl) =
507 case [ pat | (sel_id,pat) <- rpats, idName (unLoc sel_id) == lbl] of
508 (pat:pats) -> ASSERT( null pats ) pat
509 [] -> noLoc (WildPat arg_ty)
513 {\bf Previous @matchTwiddled@ stuff:}
515 Now we get to the only interesting part; note: there are choices for
516 translation [from Simon's notes]; translation~1:
523 s = case w of [s,t] -> s
524 t = case w of [s,t] -> t
528 Here \tr{w} is a fresh variable, and the \tr{w}-binding prevents multiple
529 evaluation of \tr{e}. An alternative translation (No.~2):
531 [ w = case e of [s,t] -> (s,t)
532 s = case w of (s,t) -> s
533 t = case w of (s,t) -> t
537 %************************************************************************
539 \subsubsection[improved-unmixing]{UNIMPLEMENTED idea for improved unmixing}
541 %************************************************************************
543 We might be able to optimise unmixing when confronted by
544 only-one-constructor-possible, of which tuples are the most notable
552 This definition would normally be unmixed into four equation blocks,
553 one per equation. But it could be unmixed into just one equation
554 block, because if the one equation matches (on the first column),
555 the others certainly will.
557 You have to be careful, though; the example
565 {\em must} be broken into two blocks at the line shown; otherwise, you
566 are forcing unnecessary evaluation. In any case, the top-left pattern
567 always gives the cue. You could then unmix blocks into groups of...
569 \item[all variables:]
571 \item[constructors or variables (mixed):]
572 Need to make sure the right names get bound for the variable patterns.
573 \item[literals or variables (mixed):]
574 Presumably just a variant on the constructor case (as it is now).
577 %************************************************************************
579 %* matchWrapper: a convenient way to call @match@ *
581 %************************************************************************
582 \subsection[matchWrapper]{@matchWrapper@: a convenient interface to @match@}
584 Calls to @match@ often involve similar (non-trivial) work; that work
585 is collected here, in @matchWrapper@. This function takes as
589 Typchecked @Matches@ (of a function definition, or a case or lambda
590 expression)---the main input;
592 An error message to be inserted into any (runtime) pattern-matching
596 As results, @matchWrapper@ produces:
599 A list of variables (@Locals@) that the caller must ``promise'' to
600 bind to appropriate values; and
602 a @CoreExpr@, the desugared output (main result).
605 The main actions of @matchWrapper@ include:
608 Flatten the @[TypecheckedMatch]@ into a suitable list of
611 Create as many new variables as there are patterns in a pattern-list
612 (in any one of the @EquationInfo@s).
614 Create a suitable ``if it fails'' expression---a call to @error@ using
615 the error-string input; the {\em type} of this fail value can be found
616 by examining one of the RHS expressions in one of the @EquationInfo@s.
618 Call @match@ with all of this information!
622 matchWrapper :: HsMatchContext Name -- For shadowing warning messages
623 -> MatchGroup Id -- Matches being desugared
624 -> DsM ([Id], CoreExpr) -- Results
627 There is one small problem with the Lambda Patterns, when somebody
628 writes something similar to:
632 he/she don't want a warning about incomplete patterns, that is done with
633 the flag @opt_WarnSimplePatterns@.
634 This problem also appears in the:
636 \item @do@ patterns, but if the @do@ can fail
637 it creates another equation if the match can fail
638 (see @DsExpr.doDo@ function)
639 \item @let@ patterns, are treated by @matchSimply@
640 List Comprension Patterns, are treated by @matchSimply@ also
643 We can't call @matchSimply@ with Lambda patterns,
644 due to the fact that lambda patterns can have more than
645 one pattern, and match simply only accepts one pattern.
650 matchWrapper ctxt (MatchGroup matches match_ty)
651 = do { eqns_info <- mapM mk_eqn_info matches
652 ; dflags <- getDOptsDs
653 ; locn <- getSrcSpanDs
654 ; let ds_ctxt = DsMatchContext ctxt arg_pats locn
655 error_string = matchContextErrString ctxt
657 ; new_vars <- selectMatchVars arg_pats pat_tys
658 ; match_result <- match_fun dflags ds_ctxt new_vars rhs_ty eqns_info
660 ; fail_expr <- mkErrorAppDs pAT_ERROR_ID rhs_ty error_string
661 ; result_expr <- extractMatchResult match_result fail_expr
662 ; return (new_vars, result_expr) }
664 arg_pats = map unLoc (hsLMatchPats (head matches))
665 n_pats = length arg_pats
666 (pat_tys, rhs_ty) = splitFunTysN n_pats match_ty
668 mk_eqn_info (L _ (Match pats _ grhss))
669 = do { let upats = map unLoc pats
670 ; match_result <- dsGRHSs ctxt upats grhss rhs_ty
671 ; return (EqnInfo { eqn_wrap = idWrapper,
673 eqn_rhs = match_result}) }
675 match_fun dflags ds_ctxt
677 LambdaExpr | dopt Opt_WarnSimplePatterns dflags -> matchCheck ds_ctxt
679 _ -> matchCheck ds_ctxt
682 %************************************************************************
684 \subsection[matchSimply]{@matchSimply@: match a single expression against a single pattern}
686 %************************************************************************
688 @mkSimpleMatch@ is a wrapper for @match@ which deals with the
689 situation where we want to match a single expression against a single
690 pattern. It returns an expression.
693 matchSimply :: CoreExpr -- Scrutinee
694 -> HsMatchContext Name -- Match kind
695 -> LPat Id -- Pattern it should match
696 -> CoreExpr -- Return this if it matches
697 -> CoreExpr -- Return this if it doesn't
700 matchSimply scrut hs_ctx pat result_expr fail_expr
702 match_result = cantFailMatchResult result_expr
703 rhs_ty = exprType fail_expr
704 -- Use exprType of fail_expr, because won't refine in the case of failure!
706 matchSinglePat scrut hs_ctx pat rhs_ty match_result `thenDs` \ match_result' ->
707 extractMatchResult match_result' fail_expr
710 matchSinglePat :: CoreExpr -> HsMatchContext Name -> LPat Id
711 -> Type -> MatchResult -> DsM MatchResult
712 matchSinglePat (Var var) hs_ctx (L _ pat) ty match_result
713 = getDOptsDs `thenDs` \ dflags ->
714 getSrcSpanDs `thenDs` \ locn ->
717 | dopt Opt_WarnSimplePatterns dflags = matchCheck ds_ctx
720 ds_ctx = DsMatchContext hs_ctx [pat] locn
722 match_fn dflags [var] ty [EqnInfo { eqn_wrap = idWrapper,
724 eqn_rhs = match_result }]
726 matchSinglePat scrut hs_ctx pat ty match_result
727 = selectSimpleMatchVarL pat `thenDs` \ var ->
728 matchSinglePat (Var var) hs_ctx pat ty match_result `thenDs` \ match_result' ->
729 returnDs (adjustMatchResult (bindNonRec var scrut) match_result')