2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[RnSource]{Main pass of renamer}
9 rnHsType, rnLHsType, rnLHsTypes, rnContext,
10 rnHsSigType, rnHsTypeFVs,
12 -- Patterns and literals
13 rnLPat, rnPat, rnPatsAndThen, -- Here because it's not part
14 rnLit, rnOverLit, -- of any mutual recursion
16 -- Precence related stuff
17 mkOpAppRn, mkNegAppRn, mkOpFormRn,
18 checkPrecMatch, checkSectionPrec,
21 dupFieldErr, patSigErr, checkTupSize
24 import DynFlags ( DynFlag(Opt_WarnUnusedMatches, Opt_GlasgowExts, Opt_ScopedTypeVariables ) )
27 import RdrHsSyn ( extractHsRhoRdrTyVars )
28 import RnHsSyn ( extractHsTyNames, parrTyCon_name, tupleTyCon_name,
31 import RnHsDoc ( rnLHsDoc )
32 import RnEnv ( lookupOccRn, lookupBndrRn, lookupSyntaxName,
33 lookupLocatedOccRn, lookupLocatedBndrRn,
34 lookupLocatedGlobalOccRn, bindTyVarsRn,
35 lookupFixityRn, lookupTyFixityRn,
36 mapFvRn, warnUnusedMatches,
37 newIPNameRn, bindPatSigTyVarsFV, bindLocatedLocalsFV )
39 import RdrName ( RdrName, elemLocalRdrEnv )
40 import PrelNames ( eqClassName, integralClassName, geName, eqName,
41 negateName, minusName, lengthPName, indexPName,
42 plusIntegerName, fromIntegerName, timesIntegerName,
43 ratioDataConName, fromRationalName )
44 import TypeRep ( funTyCon )
45 import Constants ( mAX_TUPLE_SIZE )
47 import SrcLoc ( SrcSpan, Located(..), unLoc, noLoc, combineLocs )
50 import Literal ( inIntRange, inCharRange )
51 import BasicTypes ( compareFixity, funTyFixity, negateFixity,
52 Fixity(..), FixityDirection(..) )
53 import ListSetOps ( removeDups )
56 #include "HsVersions.h"
59 These type renamers are in a separate module, rather than in (say) RnSource,
60 to break several loop.
62 %*********************************************************
64 \subsection{Renaming types}
66 %*********************************************************
69 rnHsTypeFVs :: SDoc -> LHsType RdrName -> RnM (LHsType Name, FreeVars)
70 rnHsTypeFVs doc_str ty
71 = rnLHsType doc_str ty `thenM` \ ty' ->
72 returnM (ty', extractHsTyNames ty')
74 rnHsSigType :: SDoc -> LHsType RdrName -> RnM (LHsType Name)
75 -- rnHsSigType is used for source-language type signatures,
76 -- which use *implicit* universal quantification.
77 rnHsSigType doc_str ty
78 = rnLHsType (text "In the type signature for" <+> doc_str) ty
81 rnHsType is here because we call it from loadInstDecl, and I didn't
82 want a gratuitous knot.
85 rnLHsType :: SDoc -> LHsType RdrName -> RnM (LHsType Name)
86 rnLHsType doc = wrapLocM (rnHsType doc)
88 rnHsType :: SDoc -> HsType RdrName -> RnM (HsType Name)
90 rnHsType doc (HsForAllTy Implicit _ ctxt ty)
91 -- Implicit quantifiction in source code (no kinds on tyvars)
92 -- Given the signature C => T we universally quantify
93 -- over FV(T) \ {in-scope-tyvars}
94 = getLocalRdrEnv `thenM` \ name_env ->
96 mentioned = extractHsRhoRdrTyVars ctxt ty
98 -- Don't quantify over type variables that are in scope;
99 -- when GlasgowExts is off, there usually won't be any, except for
101 -- class C a where { op :: a -> a }
102 forall_tyvars = filter (not . (`elemLocalRdrEnv` name_env) . unLoc) mentioned
103 tyvar_bndrs = userHsTyVarBndrs forall_tyvars
105 rnForAll doc Implicit tyvar_bndrs ctxt ty
107 rnHsType doc (HsForAllTy Explicit forall_tyvars ctxt tau)
108 -- Explicit quantification.
109 -- Check that the forall'd tyvars are actually
110 -- mentioned in the type, and produce a warning if not
112 mentioned = map unLoc (extractHsRhoRdrTyVars ctxt tau)
113 forall_tyvar_names = hsLTyVarLocNames forall_tyvars
115 -- Explicitly quantified but not mentioned in ctxt or tau
116 warn_guys = filter ((`notElem` mentioned) . unLoc) forall_tyvar_names
118 mappM_ (forAllWarn doc tau) warn_guys `thenM_`
119 rnForAll doc Explicit forall_tyvars ctxt tau
121 rnHsType doc (HsTyVar tyvar)
122 = lookupOccRn tyvar `thenM` \ tyvar' ->
123 returnM (HsTyVar tyvar')
125 rnHsType doc ty@(HsOpTy ty1 (L loc op) ty2)
127 do { ty_ops_ok <- doptM Opt_ScopedTypeVariables -- Badly named option
128 ; checkErr ty_ops_ok (opTyErr op ty)
129 ; op' <- lookupOccRn op
130 ; let l_op' = L loc op'
131 ; fix <- lookupTyFixityRn l_op'
132 ; ty1' <- rnLHsType doc ty1
133 ; ty2' <- rnLHsType doc ty2
134 ; mkHsOpTyRn (\t1 t2 -> HsOpTy t1 l_op' t2) (ppr op') fix ty1' ty2' }
136 rnHsType doc (HsParTy ty)
137 = rnLHsType doc ty `thenM` \ ty' ->
138 returnM (HsParTy ty')
140 rnHsType doc (HsBangTy b ty)
141 = rnLHsType doc ty `thenM` \ ty' ->
142 returnM (HsBangTy b ty')
144 rnHsType doc (HsNumTy i)
145 | i == 1 = returnM (HsNumTy i)
146 | otherwise = addErr err_msg `thenM_` returnM (HsNumTy i)
148 err_msg = ptext SLIT("Only unit numeric type pattern is valid")
151 rnHsType doc (HsFunTy ty1 ty2)
152 = rnLHsType doc ty1 `thenM` \ ty1' ->
153 -- Might find a for-all as the arg of a function type
154 rnLHsType doc ty2 `thenM` \ ty2' ->
155 -- Or as the result. This happens when reading Prelude.hi
156 -- when we find return :: forall m. Monad m -> forall a. a -> m a
158 -- Check for fixity rearrangements
159 mkHsOpTyRn HsFunTy (ppr funTyCon) funTyFixity ty1' ty2'
161 rnHsType doc (HsListTy ty)
162 = rnLHsType doc ty `thenM` \ ty' ->
163 returnM (HsListTy ty')
165 rnHsType doc (HsKindSig ty k)
166 = rnLHsType doc ty `thenM` \ ty' ->
167 returnM (HsKindSig ty' k)
169 rnHsType doc (HsPArrTy ty)
170 = rnLHsType doc ty `thenM` \ ty' ->
171 returnM (HsPArrTy ty')
173 -- Unboxed tuples are allowed to have poly-typed arguments. These
174 -- sometimes crop up as a result of CPR worker-wrappering dictionaries.
175 rnHsType doc (HsTupleTy tup_con tys)
176 = mappM (rnLHsType doc) tys `thenM` \ tys' ->
177 returnM (HsTupleTy tup_con tys')
179 rnHsType doc (HsAppTy ty1 ty2)
180 = rnLHsType doc ty1 `thenM` \ ty1' ->
181 rnLHsType doc ty2 `thenM` \ ty2' ->
182 returnM (HsAppTy ty1' ty2')
184 rnHsType doc (HsPredTy pred)
185 = rnPred doc pred `thenM` \ pred' ->
186 returnM (HsPredTy pred')
188 rnHsType doc (HsSpliceTy _)
189 = do { addErr (ptext SLIT("Type splices are not yet implemented"))
192 rnHsType doc (HsDocTy ty haddock_doc)
193 = rnLHsType doc ty `thenM` \ ty' ->
194 rnLHsDoc haddock_doc `thenM` \ haddock_doc' ->
195 returnM (HsDocTy ty' haddock_doc')
197 rnLHsTypes doc tys = mappM (rnLHsType doc) tys
202 rnForAll :: SDoc -> HsExplicitForAll -> [LHsTyVarBndr RdrName]
203 -> LHsContext RdrName -> LHsType RdrName -> RnM (HsType Name)
205 rnForAll doc exp [] (L _ []) (L _ ty) = rnHsType doc ty
206 -- One reason for this case is that a type like Int#
207 -- starts off as (HsForAllTy Nothing [] Int), in case
208 -- there is some quantification. Now that we have quantified
209 -- and discovered there are no type variables, it's nicer to turn
210 -- it into plain Int. If it were Int# instead of Int, we'd actually
211 -- get an error, because the body of a genuine for-all is
214 rnForAll doc exp forall_tyvars ctxt ty
215 = bindTyVarsRn doc forall_tyvars $ \ new_tyvars ->
216 rnContext doc ctxt `thenM` \ new_ctxt ->
217 rnLHsType doc ty `thenM` \ new_ty ->
218 returnM (HsForAllTy exp new_tyvars new_ctxt new_ty)
219 -- Retain the same implicit/explicit flag as before
220 -- so that we can later print it correctly
224 %************************************************************************
226 Fixities and precedence parsing
228 %************************************************************************
230 @mkOpAppRn@ deals with operator fixities. The argument expressions
231 are assumed to be already correctly arranged. It needs the fixities
232 recorded in the OpApp nodes, because fixity info applies to the things
233 the programmer actually wrote, so you can't find it out from the Name.
235 Furthermore, the second argument is guaranteed not to be another
236 operator application. Why? Because the parser parses all
237 operator appications left-associatively, EXCEPT negation, which
238 we need to handle specially.
239 Infix types are read in a *right-associative* way, so that
244 mkHsOpTyRn rearranges where necessary. The two arguments
245 have already been renamed and rearranged. It's made rather tiresome
246 by the presence of ->, which is a separate syntactic construct.
250 -- Building (ty1 `op1` (ty21 `op2` ty22))
251 mkHsOpTyRn :: (LHsType Name -> LHsType Name -> HsType Name)
252 -> SDoc -> Fixity -> LHsType Name -> LHsType Name
255 mkHsOpTyRn mk1 pp_op1 fix1 ty1 (L loc2 (HsOpTy ty21 op2 ty22))
256 = do { fix2 <- lookupTyFixityRn op2
257 ; mk_hs_op_ty mk1 pp_op1 fix1 ty1
258 (\t1 t2 -> HsOpTy t1 op2 t2)
259 (ppr op2) fix2 ty21 ty22 loc2 }
261 mkHsOpTyRn mk1 pp_op1 fix1 ty1 ty2@(L loc2 (HsFunTy ty21 ty22))
262 = mk_hs_op_ty mk1 pp_op1 fix1 ty1
263 HsFunTy (ppr funTyCon) funTyFixity ty21 ty22 loc2
265 mkHsOpTyRn mk1 pp_op1 fix1 ty1 ty2 -- Default case, no rearrangment
266 = return (mk1 ty1 ty2)
269 mk_hs_op_ty :: (LHsType Name -> LHsType Name -> HsType Name)
270 -> SDoc -> Fixity -> LHsType Name
271 -> (LHsType Name -> LHsType Name -> HsType Name)
272 -> SDoc -> Fixity -> LHsType Name -> LHsType Name -> SrcSpan
274 mk_hs_op_ty mk1 pp_op1 fix1 ty1
275 mk2 pp_op2 fix2 ty21 ty22 loc2
276 | nofix_error = do { addErr (precParseErr (quotes pp_op1,fix1)
277 (quotes pp_op2,fix2))
278 ; return (mk1 ty1 (L loc2 (mk2 ty21 ty22))) }
279 | associate_right = return (mk1 ty1 (L loc2 (mk2 ty21 ty22)))
280 | otherwise = do { -- Rearrange to ((ty1 `op1` ty21) `op2` ty22)
281 new_ty <- mkHsOpTyRn mk1 pp_op1 fix1 ty1 ty21
282 ; return (mk2 (noLoc new_ty) ty22) }
284 (nofix_error, associate_right) = compareFixity fix1 fix2
287 ---------------------------
288 mkOpAppRn :: LHsExpr Name -- Left operand; already rearranged
289 -> LHsExpr Name -> Fixity -- Operator and fixity
290 -> LHsExpr Name -- Right operand (not an OpApp, but might
294 -- (e11 `op1` e12) `op2` e2
295 mkOpAppRn e1@(L _ (OpApp e11 op1 fix1 e12)) op2 fix2 e2
297 = addErr (precParseErr (ppr_op op1,fix1) (ppr_op op2,fix2)) `thenM_`
298 returnM (OpApp e1 op2 fix2 e2)
301 = mkOpAppRn e12 op2 fix2 e2 `thenM` \ new_e ->
302 returnM (OpApp e11 op1 fix1 (L loc' new_e))
304 loc'= combineLocs e12 e2
305 (nofix_error, associate_right) = compareFixity fix1 fix2
307 ---------------------------
308 -- (- neg_arg) `op` e2
309 mkOpAppRn e1@(L _ (NegApp neg_arg neg_name)) op2 fix2 e2
311 = addErr (precParseErr (pp_prefix_minus,negateFixity) (ppr_op op2,fix2)) `thenM_`
312 returnM (OpApp e1 op2 fix2 e2)
315 = mkOpAppRn neg_arg op2 fix2 e2 `thenM` \ new_e ->
316 returnM (NegApp (L loc' new_e) neg_name)
318 loc' = combineLocs neg_arg e2
319 (nofix_error, associate_right) = compareFixity negateFixity fix2
321 ---------------------------
323 mkOpAppRn e1 op1 fix1 e2@(L _ (NegApp neg_arg _)) -- NegApp can occur on the right
324 | not associate_right -- We *want* right association
325 = addErr (precParseErr (ppr_op op1, fix1) (pp_prefix_minus, negateFixity)) `thenM_`
326 returnM (OpApp e1 op1 fix1 e2)
328 (_, associate_right) = compareFixity fix1 negateFixity
330 ---------------------------
332 mkOpAppRn e1 op fix e2 -- Default case, no rearrangment
333 = ASSERT2( right_op_ok fix (unLoc e2),
334 ppr e1 $$ text "---" $$ ppr op $$ text "---" $$ ppr fix $$ text "---" $$ ppr e2
336 returnM (OpApp e1 op fix e2)
338 -- Parser left-associates everything, but
339 -- derived instances may have correctly-associated things to
340 -- in the right operarand. So we just check that the right operand is OK
341 right_op_ok fix1 (OpApp _ _ fix2 _)
342 = not error_please && associate_right
344 (error_please, associate_right) = compareFixity fix1 fix2
345 right_op_ok fix1 other
348 -- Parser initially makes negation bind more tightly than any other operator
349 -- And "deriving" code should respect this (use HsPar if not)
350 mkNegAppRn :: LHsExpr id -> SyntaxExpr id -> RnM (HsExpr id)
351 mkNegAppRn neg_arg neg_name
352 = ASSERT( not_op_app (unLoc neg_arg) )
353 returnM (NegApp neg_arg neg_name)
355 not_op_app (OpApp _ _ _ _) = False
356 not_op_app other = True
358 ---------------------------
359 mkOpFormRn :: LHsCmdTop Name -- Left operand; already rearranged
360 -> LHsExpr Name -> Fixity -- Operator and fixity
361 -> LHsCmdTop Name -- Right operand (not an infix)
364 -- (e11 `op1` e12) `op2` e2
365 mkOpFormRn a1@(L loc (HsCmdTop (L _ (HsArrForm op1 (Just fix1) [a11,a12])) _ _ _))
368 = addErr (precParseErr (ppr_op op1,fix1) (ppr_op op2,fix2)) `thenM_`
369 returnM (HsArrForm op2 (Just fix2) [a1, a2])
372 = mkOpFormRn a12 op2 fix2 a2 `thenM` \ new_c ->
373 returnM (HsArrForm op1 (Just fix1)
374 [a11, L loc (HsCmdTop (L loc new_c) [] placeHolderType [])])
375 -- TODO: locs are wrong
377 (nofix_error, associate_right) = compareFixity fix1 fix2
380 mkOpFormRn arg1 op fix arg2 -- Default case, no rearrangment
381 = returnM (HsArrForm op (Just fix) [arg1, arg2])
384 --------------------------------------
385 mkConOpPatRn :: Located Name -> Fixity -> LPat Name -> LPat Name
388 mkConOpPatRn op2 fix2 p1@(L loc (ConPatIn op1 (InfixCon p11 p12))) p2
389 = lookupFixityRn (unLoc op1) `thenM` \ fix1 ->
391 (nofix_error, associate_right) = compareFixity fix1 fix2
394 addErr (precParseErr (ppr_op op1,fix1) (ppr_op op2,fix2)) `thenM_`
395 returnM (ConPatIn op2 (InfixCon p1 p2))
397 if associate_right then
398 mkConOpPatRn op2 fix2 p12 p2 `thenM` \ new_p ->
399 returnM (ConPatIn op1 (InfixCon p11 (L loc new_p))) -- XXX loc right?
401 returnM (ConPatIn op2 (InfixCon p1 p2))
403 mkConOpPatRn op fix p1 p2 -- Default case, no rearrangment
404 = ASSERT( not_op_pat (unLoc p2) )
405 returnM (ConPatIn op (InfixCon p1 p2))
407 not_op_pat (ConPatIn _ (InfixCon _ _)) = False
408 not_op_pat other = True
410 --------------------------------------
411 checkPrecMatch :: Bool -> Name -> MatchGroup Name -> RnM ()
412 -- True indicates an infix lhs
413 -- See comments with rnExpr (OpApp ...) about "deriving"
415 checkPrecMatch False fn match
417 checkPrecMatch True op (MatchGroup ms _)
420 check (L _ (Match (p1:p2:_) _ _))
421 = checkPrec op (unLoc p1) False `thenM_`
422 checkPrec op (unLoc p2) True
425 -- This can happen. Consider
428 -- The infix flag comes from the first binding of the group
429 -- but the second eqn has no args (an error, but not discovered
430 -- until the type checker). So we don't want to crash on the
433 checkPrec op (ConPatIn op1 (InfixCon _ _)) right
434 = lookupFixityRn op `thenM` \ op_fix@(Fixity op_prec op_dir) ->
435 lookupFixityRn (unLoc op1) `thenM` \ op1_fix@(Fixity op1_prec op1_dir) ->
437 inf_ok = op1_prec > op_prec ||
438 (op1_prec == op_prec &&
439 (op1_dir == InfixR && op_dir == InfixR && right ||
440 op1_dir == InfixL && op_dir == InfixL && not right))
442 info = (ppr_op op, op_fix)
443 info1 = (ppr_op op1, op1_fix)
444 (infol, infor) = if right then (info, info1) else (info1, info)
446 checkErr inf_ok (precParseErr infol infor)
448 checkPrec op pat right
451 -- Check precedence of (arg op) or (op arg) respectively
452 -- If arg is itself an operator application, then either
453 -- (a) its precedence must be higher than that of op
454 -- (b) its precedency & associativity must be the same as that of op
455 checkSectionPrec :: FixityDirection -> HsExpr RdrName
456 -> LHsExpr Name -> LHsExpr Name -> RnM ()
457 checkSectionPrec direction section op arg
459 OpApp _ op fix _ -> go_for_it (ppr_op op) fix
460 NegApp _ _ -> go_for_it pp_prefix_minus negateFixity
463 L _ (HsVar op_name) = op
464 go_for_it pp_arg_op arg_fix@(Fixity arg_prec assoc)
465 = lookupFixityRn op_name `thenM` \ op_fix@(Fixity op_prec _) ->
466 checkErr (op_prec < arg_prec
467 || op_prec == arg_prec && direction == assoc)
468 (sectionPrecErr (ppr_op op_name, op_fix)
469 (pp_arg_op, arg_fix) section)
472 Precedence-related error messages
476 = hang (ptext SLIT("precedence parsing error"))
477 4 (hsep [ptext SLIT("cannot mix"), ppr_opfix op1, ptext SLIT("and"),
479 ptext SLIT("in the same infix expression")])
481 sectionPrecErr op arg_op section
482 = vcat [ptext SLIT("The operator") <+> ppr_opfix op <+> ptext SLIT("of a section"),
483 nest 4 (ptext SLIT("must have lower precedence than the operand") <+> ppr_opfix arg_op),
484 nest 4 (ptext SLIT("in the section:") <+> quotes (ppr section))]
486 pp_prefix_minus = ptext SLIT("prefix `-'")
487 ppr_op op = quotes (ppr op) -- Here, op can be a Name or a (Var n), where n is a Name
488 ppr_opfix (pp_op, fixity) = pp_op <+> brackets (ppr fixity)
491 %*********************************************************
493 \subsection{Contexts and predicates}
495 %*********************************************************
498 rnContext :: SDoc -> LHsContext RdrName -> RnM (LHsContext Name)
499 rnContext doc = wrapLocM (rnContext' doc)
501 rnContext' :: SDoc -> HsContext RdrName -> RnM (HsContext Name)
502 rnContext' doc ctxt = mappM (rnLPred doc) ctxt
504 rnLPred :: SDoc -> LHsPred RdrName -> RnM (LHsPred Name)
505 rnLPred doc = wrapLocM (rnPred doc)
507 rnPred doc (HsClassP clas tys)
508 = lookupOccRn clas `thenM` \ clas_name ->
509 rnLHsTypes doc tys `thenM` \ tys' ->
510 returnM (HsClassP clas_name tys')
512 rnPred doc (HsIParam n ty)
513 = newIPNameRn n `thenM` \ name ->
514 rnLHsType doc ty `thenM` \ ty' ->
515 returnM (HsIParam name ty')
519 *********************************************************
521 \subsection{Patterns}
523 *********************************************************
526 rnPatsAndThen :: HsMatchContext Name
528 -> ([LPat Name] -> RnM (a, FreeVars))
530 -- Bring into scope all the binders and type variables
531 -- bound by the patterns; then rename the patterns; then
532 -- do the thing inside.
534 -- Note that we do a single bindLocalsRn for all the
535 -- matches together, so that we spot the repeated variable in
538 rnPatsAndThen ctxt pats thing_inside
539 = bindPatSigTyVarsFV pat_sig_tys $
540 bindLocatedLocalsFV doc_pat bndrs $ \ new_bndrs ->
541 rnLPats pats `thenM` \ (pats', pat_fvs) ->
542 thing_inside pats' `thenM` \ (res, res_fvs) ->
544 unused_binders = filter (not . (`elemNameSet` res_fvs)) new_bndrs
546 warnUnusedMatches unused_binders `thenM_`
547 returnM (res, res_fvs `plusFV` pat_fvs)
549 pat_sig_tys = collectSigTysFromPats pats
550 bndrs = collectLocatedPatsBinders pats
551 doc_pat = ptext SLIT("In") <+> pprMatchContext ctxt
553 rnLPats :: [LPat RdrName] -> RnM ([LPat Name], FreeVars)
554 rnLPats ps = mapFvRn rnLPat ps
556 rnLPat :: LPat RdrName -> RnM (LPat Name, FreeVars)
557 rnLPat = wrapLocFstM rnPat
559 -- -----------------------------------------------------------------------------
562 rnPat :: Pat RdrName -> RnM (Pat Name, FreeVars)
564 rnPat (WildPat _) = returnM (WildPat placeHolderType, emptyFVs)
567 = lookupBndrRn name `thenM` \ vname ->
568 returnM (VarPat vname, emptyFVs)
570 rnPat (SigPatIn pat ty)
571 = doptM Opt_GlasgowExts `thenM` \ glaExts ->
574 then rnLPat pat `thenM` \ (pat', fvs1) ->
575 rnHsTypeFVs doc ty `thenM` \ (ty', fvs2) ->
576 returnM (SigPatIn pat' ty', fvs1 `plusFV` fvs2)
578 else addErr (patSigErr ty) `thenM_`
579 rnPat (unLoc pat) -- XXX shouldn't throw away the loc
581 doc = text "In a pattern type-signature"
585 returnM (LitPat lit, emptyFVs)
587 rnPat (NPat lit mb_neg eq _)
588 = rnOverLit lit `thenM` \ (lit', fvs1) ->
590 Nothing -> returnM (Nothing, emptyFVs)
591 Just _ -> lookupSyntaxName negateName `thenM` \ (neg, fvs) ->
592 returnM (Just neg, fvs)
593 ) `thenM` \ (mb_neg', fvs2) ->
594 lookupSyntaxName eqName `thenM` \ (eq', fvs3) ->
595 returnM (NPat lit' mb_neg' eq' placeHolderType,
596 fvs1 `plusFV` fvs2 `plusFV` fvs3 `addOneFV` eqClassName)
597 -- Needed to find equality on pattern
599 rnPat (NPlusKPat name lit _ _)
600 = rnOverLit lit `thenM` \ (lit', fvs1) ->
601 lookupLocatedBndrRn name `thenM` \ name' ->
602 lookupSyntaxName minusName `thenM` \ (minus, fvs2) ->
603 lookupSyntaxName geName `thenM` \ (ge, fvs3) ->
604 returnM (NPlusKPat name' lit' ge minus,
605 fvs1 `plusFV` fvs2 `plusFV` fvs3 `addOneFV` integralClassName)
606 -- The Report says that n+k patterns must be in Integral
609 = rnLPat pat `thenM` \ (pat', fvs) ->
610 returnM (LazyPat pat', fvs)
613 = rnLPat pat `thenM` \ (pat', fvs) ->
614 returnM (BangPat pat', fvs)
616 rnPat (AsPat name pat)
617 = rnLPat pat `thenM` \ (pat', fvs) ->
618 lookupLocatedBndrRn name `thenM` \ vname ->
619 returnM (AsPat vname pat', fvs)
621 rnPat (ConPatIn con stuff) = rnConPat con stuff
625 = rnLPat pat `thenM` \ (pat', fvs) ->
626 returnM (ParPat pat', fvs)
628 rnPat (ListPat pats _)
629 = rnLPats pats `thenM` \ (patslist, fvs) ->
630 returnM (ListPat patslist placeHolderType, fvs `addOneFV` listTyCon_name)
632 rnPat (PArrPat pats _)
633 = rnLPats pats `thenM` \ (patslist, fvs) ->
634 returnM (PArrPat patslist placeHolderType,
635 fvs `plusFV` implicit_fvs `addOneFV` parrTyCon_name)
637 implicit_fvs = mkFVs [lengthPName, indexPName]
639 rnPat (TuplePat pats boxed _)
640 = checkTupSize tup_size `thenM_`
641 rnLPats pats `thenM` \ (patslist, fvs) ->
642 returnM (TuplePat patslist boxed placeHolderType,
643 fvs `addOneFV` tycon_name)
645 tup_size = length pats
646 tycon_name = tupleTyCon_name boxed tup_size
648 rnPat (TypePat name) =
649 rnHsTypeFVs (text "In a type pattern") name `thenM` \ (name', fvs) ->
650 returnM (TypePat name', fvs)
652 -- -----------------------------------------------------------------------------
655 rnConPat con (PrefixCon pats)
656 = lookupLocatedOccRn con `thenM` \ con' ->
657 rnLPats pats `thenM` \ (pats', fvs) ->
658 returnM (ConPatIn con' (PrefixCon pats'), fvs `addOneFV` unLoc con')
660 rnConPat con (RecCon rpats)
661 = lookupLocatedOccRn con `thenM` \ con' ->
662 rnRpats rpats `thenM` \ (rpats', fvs) ->
663 returnM (ConPatIn con' (RecCon rpats'), fvs `addOneFV` unLoc con')
665 rnConPat con (InfixCon pat1 pat2)
666 = lookupLocatedOccRn con `thenM` \ con' ->
667 rnLPat pat1 `thenM` \ (pat1', fvs1) ->
668 rnLPat pat2 `thenM` \ (pat2', fvs2) ->
669 lookupFixityRn (unLoc con') `thenM` \ fixity ->
670 mkConOpPatRn con' fixity pat1' pat2' `thenM` \ pat' ->
671 returnM (pat', fvs1 `plusFV` fvs2 `addOneFV` unLoc con')
673 -- -----------------------------------------------------------------------------
676 -- Haddock comments for record fields are renamed to Nothing here
677 rnRpats :: [HsRecField RdrName (LPat RdrName)]
678 -> RnM ([HsRecField Name (LPat Name)], FreeVars)
680 = mappM_ field_dup_err dup_fields `thenM_`
681 mapFvRn rn_rpat rpats `thenM` \ (rpats', fvs) ->
682 returnM (rpats', fvs)
684 (_, dup_fields) = removeDups compare [ unLoc f | HsRecField f _ _ <- rpats ]
686 field_dup_err dups = addErr (dupFieldErr "pattern" dups)
688 rn_rpat (HsRecField field pat _)
689 = lookupLocatedGlobalOccRn field `thenM` \ fieldname ->
690 rnLPat pat `thenM` \ (pat', fvs) ->
691 returnM ((mkRecField fieldname pat'), fvs `addOneFV` unLoc fieldname)
696 %************************************************************************
698 \subsubsection{Literals}
700 %************************************************************************
702 When literals occur we have to make sure
703 that the types and classes they involve
707 rnLit :: HsLit -> RnM ()
708 rnLit (HsChar c) = checkErr (inCharRange c) (bogusCharError c)
709 rnLit other = returnM ()
711 rnOverLit (HsIntegral i _)
712 = lookupSyntaxName fromIntegerName `thenM` \ (from_integer_name, fvs) ->
714 returnM (HsIntegral i from_integer_name, fvs)
716 extra_fvs = mkFVs [plusIntegerName, timesIntegerName]
717 -- Big integer literals are built, using + and *,
718 -- out of small integers (DsUtils.mkIntegerLit)
719 -- [NB: plusInteger, timesInteger aren't rebindable...
720 -- they are used to construct the argument to fromInteger,
721 -- which is the rebindable one.]
723 returnM (HsIntegral i from_integer_name, fvs `plusFV` extra_fvs)
725 rnOverLit (HsFractional i _)
726 = lookupSyntaxName fromRationalName `thenM` \ (from_rat_name, fvs) ->
728 extra_fvs = mkFVs [ratioDataConName, plusIntegerName, timesIntegerName]
729 -- We have to make sure that the Ratio type is imported with
730 -- its constructor, because literals of type Ratio t are
731 -- built with that constructor.
732 -- The Rational type is needed too, but that will come in
733 -- as part of the type for fromRational.
734 -- The plus/times integer operations may be needed to construct the numerator
735 -- and denominator (see DsUtils.mkIntegerLit)
737 returnM (HsFractional i from_rat_name, fvs `plusFV` extra_fvs)
742 %*********************************************************
746 %*********************************************************
749 checkTupSize :: Int -> RnM ()
750 checkTupSize tup_size
751 | tup_size <= mAX_TUPLE_SIZE
754 = addErr (sep [ptext SLIT("A") <+> int tup_size <> ptext SLIT("-tuple is too large for GHC"),
755 nest 2 (parens (ptext SLIT("max size is") <+> int mAX_TUPLE_SIZE)),
756 nest 2 (ptext SLIT("Workaround: use nested tuples or define a data type"))])
758 forAllWarn doc ty (L loc tyvar)
759 = ifOptM Opt_WarnUnusedMatches $
760 addWarnAt loc (sep [ptext SLIT("The universally quantified type variable") <+> quotes (ppr tyvar),
761 nest 4 (ptext SLIT("does not appear in the type") <+> quotes (ppr ty))]
766 = hang (ptext SLIT("Illegal operator") <+> quotes (ppr op) <+> ptext SLIT("in type") <+> quotes (ppr ty))
767 2 (parens (ptext SLIT("Use -fscoped-type-variables to allow operators in types")))
770 = ptext SLIT("character literal out of range: '\\") <> char c <> char '\''
773 = (ptext SLIT("Illegal signature in pattern:") <+> ppr ty)
774 $$ nest 4 (ptext SLIT("Use -fglasgow-exts to permit it"))
777 = hsep [ptext SLIT("duplicate field name"),
779 ptext SLIT("in record"), text str]