2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[RnBinds]{Renaming and dependency analysis of bindings}
6 This module does renaming and dependency analysis on value bindings in
7 the abstract syntax. It does {\em not} do cycle-checks on class or
8 type-synonym declarations; those cannot be done at this stage because
9 they may be affected by renaming (which isn't fully worked out yet).
14 rnLocalBindsAndThen, rnValBindsAndThen, rnValBinds, trimWith,
15 rnMethodBinds, renameSigs, mkSigTvFn,
19 #include "HsVersions.h"
21 import {-# SOURCE #-} RnExpr( rnLExpr, rnStmts )
27 import RnTypes ( rnHsSigType, rnLHsType, rnHsTypeFVs,
28 rnLPat, rnPatsAndThen, patSigErr, checkPrecMatch )
29 import RnEnv ( bindLocatedLocalsRn, lookupLocatedBndrRn,
30 lookupLocatedInstDeclBndr, newIPNameRn,
31 lookupLocatedSigOccRn, bindPatSigTyVarsFV,
32 bindLocalFixities, bindSigTyVarsFV,
33 warnUnusedLocalBinds, mapFvRn, extendTyVarEnvFVRn,
35 import DynFlags ( DynFlag(..) )
36 import Name ( Name, nameOccName, nameSrcLoc )
39 import PrelNames ( isUnboundName )
40 import RdrName ( RdrName, rdrNameOcc )
41 import SrcLoc ( mkSrcSpan, Located(..), unLoc )
42 import ListSetOps ( findDupsEq )
43 import BasicTypes ( RecFlag(..) )
44 import Digraph ( SCC(..), stronglyConnComp )
47 import Maybes ( orElse )
48 import Util ( filterOut )
49 import Monad ( foldM )
52 -- ToDo: Put the annotations into the monad, so that they arrive in the proper
53 -- place and can be used when complaining.
55 The code tree received by the function @rnBinds@ contains definitions
56 in where-clauses which are all apparently mutually recursive, but which may
57 not really depend upon each other. For example, in the top level program
62 the definitions of @a@ and @y@ do not depend on each other at all.
63 Unfortunately, the typechecker cannot always check such definitions.
64 \footnote{Mycroft, A. 1984. Polymorphic type schemes and recursive
65 definitions. In Proceedings of the International Symposium on Programming,
66 Toulouse, pp. 217-39. LNCS 167. Springer Verlag.}
67 However, the typechecker usually can check definitions in which only the
68 strongly connected components have been collected into recursive bindings.
69 This is precisely what the function @rnBinds@ does.
71 ToDo: deal with case where a single monobinds binds the same variable
74 The vertag tag is a unique @Int@; the tags only need to be unique
75 within one @MonoBinds@, so that unique-Int plumbing is done explicitly
76 (heavy monad machinery not needed).
79 %************************************************************************
81 %* naming conventions *
83 %************************************************************************
85 \subsection[name-conventions]{Name conventions}
87 The basic algorithm involves walking over the tree and returning a tuple
88 containing the new tree plus its free variables. Some functions, such
89 as those walking polymorphic bindings (HsBinds) and qualifier lists in
90 list comprehensions (@Quals@), return the variables bound in local
91 environments. These are then used to calculate the free variables of the
92 expression evaluated in these environments.
94 Conventions for variable names are as follows:
97 new code is given a prime to distinguish it from the old.
100 a set of variables defined in @Exp@ is written @dvExp@
103 a set of variables free in @Exp@ is written @fvExp@
106 %************************************************************************
108 %* analysing polymorphic bindings (HsBindGroup, HsBind)
110 %************************************************************************
112 \subsubsection[dep-HsBinds]{Polymorphic bindings}
114 Non-recursive expressions are reconstructed without any changes at top
115 level, although their component expressions may have to be altered.
116 However, non-recursive expressions are currently not expected as
117 \Haskell{} programs, and this code should not be executed.
119 Monomorphic bindings contain information that is returned in a tuple
120 (a @FlatMonoBinds@) containing:
124 a unique @Int@ that serves as the ``vertex tag'' for this binding.
127 the name of a function or the names in a pattern. These are a set
128 referred to as @dvLhs@, the defined variables of the left hand side.
131 the free variables of the body. These are referred to as @fvBody@.
134 the definition's actual code. This is referred to as just @code@.
137 The function @nonRecDvFv@ returns two sets of variables. The first is
138 the set of variables defined in the set of monomorphic bindings, while the
139 second is the set of free variables in those bindings.
141 The set of variables defined in a non-recursive binding is just the
142 union of all of them, as @union@ removes duplicates. However, the
143 free variables in each successive set of cumulative bindings is the
144 union of those in the previous set plus those of the newest binding after
145 the defined variables of the previous set have been removed.
147 @rnMethodBinds@ deals only with the declarations in class and
148 instance declarations. It expects only to see @FunMonoBind@s, and
149 it expects the global environment to contain bindings for the binders
150 (which are all class operations).
152 %************************************************************************
154 \subsubsection{ Top-level bindings}
156 %************************************************************************
158 @rnTopMonoBinds@ assumes that the environment already
159 contains bindings for the binders of this particular binding.
162 rnTopBinds :: HsValBinds RdrName -> RnM (HsValBinds Name, DefUses)
164 -- The binders of the binding are in scope already;
165 -- the top level scope resolution does that
168 = do { is_boot <- tcIsHsBoot
169 ; if is_boot then rnTopBindsBoot binds
170 else rnTopBindsSrc binds }
172 rnTopBindsBoot :: HsValBinds RdrName -> RnM (HsValBinds Name, DefUses)
173 -- A hs-boot file has no bindings.
174 -- Return a single HsBindGroup with empty binds and renamed signatures
175 rnTopBindsBoot (ValBindsIn mbinds sigs)
176 = do { checkErr (isEmptyLHsBinds mbinds) (bindsInHsBootFile mbinds)
177 ; sigs' <- renameSigs okHsBootSig sigs
178 ; return (ValBindsOut [] sigs', usesOnly (hsSigsFVs sigs')) }
180 rnTopBindsSrc :: HsValBinds RdrName -> RnM (HsValBinds Name, DefUses)
181 rnTopBindsSrc binds@(ValBindsIn mbinds _)
182 = do { (binds', dus) <- rnValBinds noTrim binds
184 -- Warn about missing signatures,
185 ; let { ValBindsOut _ sigs' = binds'
186 ; ty_sig_vars = mkNameSet [ unLoc n | L _ (TypeSig n _) <- sigs']
187 ; un_sigd_bndrs = duDefs dus `minusNameSet` ty_sig_vars }
189 ; warn_missing_sigs <- doptM Opt_WarnMissingSigs
190 ; ifM (warn_missing_sigs)
191 (mappM_ missingSigWarn (nameSetToList un_sigd_bndrs))
193 ; return (binds', dus)
199 %*********************************************************
203 %*********************************************************
207 :: HsLocalBinds RdrName
208 -> (HsLocalBinds Name -> RnM (result, FreeVars))
209 -> RnM (result, FreeVars)
210 -- This version (a) assumes that the binding vars are not already in scope
211 -- (b) removes the binders from the free vars of the thing inside
212 -- The parser doesn't produce ThenBinds
213 rnLocalBindsAndThen EmptyLocalBinds thing_inside
214 = thing_inside EmptyLocalBinds
216 rnLocalBindsAndThen (HsValBinds val_binds) thing_inside
217 = rnValBindsAndThen val_binds $ \ val_binds' ->
218 thing_inside (HsValBinds val_binds')
220 rnLocalBindsAndThen (HsIPBinds binds) thing_inside
221 = rnIPBinds binds `thenM` \ (binds',fv_binds) ->
222 thing_inside (HsIPBinds binds') `thenM` \ (thing, fvs_thing) ->
223 returnM (thing, fvs_thing `plusFV` fv_binds)
226 rnIPBinds (IPBinds ip_binds _no_dict_binds)
227 = do { (ip_binds', fvs_s) <- mapAndUnzipM (wrapLocFstM rnIPBind) ip_binds
228 ; return (IPBinds ip_binds' emptyLHsBinds, plusFVs fvs_s) }
230 rnIPBind (IPBind n expr)
231 = newIPNameRn n `thenM` \ name ->
232 rnLExpr expr `thenM` \ (expr',fvExpr) ->
233 return (IPBind name expr', fvExpr)
237 %************************************************************************
241 %************************************************************************
244 rnValBindsAndThen :: HsValBinds RdrName
245 -> (HsValBinds Name -> RnM (result, FreeVars))
246 -> RnM (result, FreeVars)
248 rnValBindsAndThen binds@(ValBindsIn mbinds sigs) thing_inside
249 = -- Extract all the binders in this group, and extend the
250 -- current scope, inventing new names for the new binders
251 -- This also checks that the names form a set
252 bindLocatedLocalsRn doc mbinders_w_srclocs $ \ bndrs ->
254 -- Then install local fixity declarations
255 -- Notice that they scope over thing_inside too
256 bindLocalFixities [sig | L _ (FixSig sig) <- sigs ] $
259 rnValBinds (trimWith bndrs) binds `thenM` \ (binds, bind_dus) ->
261 -- Now do the "thing inside"
262 thing_inside binds `thenM` \ (result,result_fvs) ->
264 -- Final error checking
266 all_uses = duUses bind_dus `plusFV` result_fvs
267 -- duUses: It's important to return all the uses, not the 'real uses'
268 -- used for warning about unused bindings. Otherwise consider:
270 -- y = let p = x in 'x' -- NB: p not used
271 -- If we don't "see" the dependency of 'y' on 'x', we may put the
272 -- bindings in the wrong order, and the type checker will complain
273 -- that x isn't in scope
275 unused_bndrs = [ b | b <- bndrs, not (b `elemNameSet` all_uses)]
277 warnUnusedLocalBinds unused_bndrs `thenM_`
279 returnM (result, delListFromNameSet all_uses bndrs)
281 mbinders_w_srclocs = collectHsBindLocatedBinders mbinds
282 doc = text "In the binding group for:"
283 <+> pprWithCommas ppr (map unLoc mbinders_w_srclocs)
285 ---------------------
286 rnValBinds :: (FreeVars -> FreeVars)
287 -> HsValBinds RdrName
288 -> RnM (HsValBinds Name, DefUses)
289 -- Assumes the binders of the binding are in scope already
291 rnValBinds trim (ValBindsIn mbinds sigs)
292 = do { sigs' <- rename_sigs sigs
294 ; binds_w_dus <- mapBagM (rnBind (mkSigTvFn sigs') trim) mbinds
296 ; let (binds', bind_dus) = depAnalBinds binds_w_dus
298 -- We do the check-sigs after renaming the bindings,
299 -- so that we have convenient access to the binders
300 ; check_sigs (okBindSig (duDefs bind_dus)) sigs'
302 ; return (ValBindsOut binds' sigs',
303 usesOnly (hsSigsFVs sigs') `plusDU` bind_dus) }
306 ---------------------
307 depAnalBinds :: Bag (LHsBind Name, [Name], Uses)
308 -> ([(RecFlag, LHsBinds Name)], DefUses)
309 -- Dependency analysis; this is important so that
310 -- unused-binding reporting is accurate
311 depAnalBinds binds_w_dus
312 = (map get_binds sccs, map get_du sccs)
314 sccs = stronglyConnComp edges
316 keyd_nodes = bagToList binds_w_dus `zip` [0::Int ..]
318 edges = [ (node, key, [key | n <- nameSetToList uses,
319 Just key <- [lookupNameEnv key_map n] ])
320 | (node@(_,_,uses), key) <- keyd_nodes ]
322 key_map :: NameEnv Int -- Which binding it comes from
323 key_map = mkNameEnv [(bndr, key) | ((_, bndrs, _), key) <- keyd_nodes
326 get_binds (AcyclicSCC (bind, _, _)) = (NonRecursive, unitBag bind)
327 get_binds (CyclicSCC binds_w_dus) = (Recursive, listToBag [b | (b,d,u) <- binds_w_dus])
329 get_du (AcyclicSCC (_, bndrs, uses)) = (Just (mkNameSet bndrs), uses)
330 get_du (CyclicSCC binds_w_dus) = (Just defs, uses)
332 defs = mkNameSet [b | (_,bs,_) <- binds_w_dus, b <- bs]
333 uses = unionManyNameSets [u | (_,_,u) <- binds_w_dus]
336 ---------------------
337 -- Bind the top-level forall'd type variables in the sigs.
340 -- The 'a' scopes over the rhs
342 -- NB: there'll usually be just one (for a function binding)
343 -- but if there are many, one may shadow the rest; too bad!
344 -- e.g x :: [a] -> [a]
347 -- In e, 'a' will be in scope, and it'll be the one from 'y'!
349 mkSigTvFn :: [LSig Name] -> (Name -> [Name])
350 -- Return a lookup function that maps an Id Name to the names
351 -- of the type variables that should scope over its body..
353 = \n -> lookupNameEnv env n `orElse` []
355 env :: NameEnv [Name]
356 env = mkNameEnv [ (name, map hsLTyVarName ltvs)
357 | L _ (TypeSig (L _ name)
358 (L _ (HsForAllTy Explicit ltvs _ _))) <- sigs]
359 -- Note the pattern-match on "Explicit"; we only bind
360 -- type variables from signatures with an explicit top-level for-all
362 -- The trimming function trims the free vars we attach to a
363 -- binding so that it stays reasonably small
364 noTrim :: FreeVars -> FreeVars
365 noTrim fvs = fvs -- Used at top level
367 trimWith :: [Name] -> FreeVars -> FreeVars
368 -- Nested bindings; trim by intersection with the names bound here
369 trimWith bndrs = intersectNameSet (mkNameSet bndrs)
371 ---------------------
372 rnBind :: (Name -> [Name]) -- Signature tyvar function
373 -> (FreeVars -> FreeVars) -- Trimming function for rhs free vars
375 -> RnM (LHsBind Name, [Name], Uses)
376 rnBind sig_fn trim (L loc (PatBind { pat_lhs = pat, pat_rhs = grhss }))
378 do { (pat', pat_fvs) <- rnLPat pat
380 ; let bndrs = collectPatBinders pat'
382 ; (grhss', fvs) <- bindSigTyVarsFV (concatMap sig_fn bndrs) $
383 rnGRHSs PatBindRhs grhss
385 ; return (L loc (PatBind { pat_lhs = pat', pat_rhs = grhss',
386 pat_rhs_ty = placeHolderType, bind_fvs = trim fvs }),
387 bndrs, pat_fvs `plusFV` fvs) }
389 rnBind sig_fn trim (L loc (FunBind { fun_id = name, fun_infix = inf, fun_matches = matches }))
391 do { new_name <- lookupLocatedBndrRn name
392 ; let plain_name = unLoc new_name
394 ; (matches', fvs) <- bindSigTyVarsFV (sig_fn plain_name) $
395 rnMatchGroup (FunRhs plain_name) matches
397 ; checkPrecMatch inf plain_name matches'
399 ; return (L loc (FunBind { fun_id = new_name, fun_infix = inf, fun_matches = matches',
400 bind_fvs = trim fvs, fun_co_fn = idCoercion }),
406 @rnMethodBinds@ is used for the method bindings of a class and an instance
407 declaration. Like @rnBinds@ but without dependency analysis.
409 NOTA BENE: we record each {\em binder} of a method-bind group as a free variable.
410 That's crucial when dealing with an instance decl:
412 instance Foo (T a) where
415 This might be the {\em sole} occurrence of @op@ for an imported class @Foo@,
416 and unless @op@ occurs we won't treat the type signature of @op@ in the class
417 decl for @Foo@ as a source of instance-decl gates. But we should! Indeed,
418 in many ways the @op@ in an instance decl is just like an occurrence, not
422 rnMethodBinds :: Name -- Class name
423 -> (Name -> [Name]) -- Signature tyvar function
424 -> [Name] -- Names for generic type variables
426 -> RnM (LHsBinds Name, FreeVars)
428 rnMethodBinds cls sig_fn gen_tyvars binds
429 = foldM do_one (emptyBag,emptyFVs) (bagToList binds)
430 where do_one (binds,fvs) bind = do
431 (bind', fvs_bind) <- rnMethodBind cls sig_fn gen_tyvars bind
432 return (bind' `unionBags` binds, fvs_bind `plusFV` fvs)
434 rnMethodBind cls sig_fn gen_tyvars (L loc (FunBind { fun_id = name, fun_infix = inf,
435 fun_matches = MatchGroup matches _ }))
437 lookupLocatedInstDeclBndr cls name `thenM` \ sel_name ->
438 let plain_name = unLoc sel_name in
439 -- We use the selector name as the binder
441 bindSigTyVarsFV (sig_fn plain_name) $
442 mapFvRn (rn_match plain_name) matches `thenM` \ (new_matches, fvs) ->
444 new_group = MatchGroup new_matches placeHolderType
446 checkPrecMatch inf plain_name new_group `thenM_`
447 returnM (unitBag (L loc (FunBind { fun_id = sel_name, fun_infix = inf, fun_matches = new_group,
448 bind_fvs = fvs, fun_co_fn = idCoercion })),
449 fvs `addOneFV` plain_name)
450 -- The 'fvs' field isn't used for method binds
452 -- Truly gruesome; bring into scope the correct members of the generic
453 -- type variables. See comments in RnSource.rnSourceDecl(ClassDecl)
454 rn_match sel_name match@(L _ (Match (L _ (TypePat ty) : _) _ _))
455 = extendTyVarEnvFVRn gen_tvs $
456 rnMatch (FunRhs sel_name) match
458 tvs = map (rdrNameOcc.unLoc) (extractHsTyRdrTyVars ty)
459 gen_tvs = [tv | tv <- gen_tyvars, nameOccName tv `elem` tvs]
461 rn_match sel_name match = rnMatch (FunRhs sel_name) match
464 -- Can't handle method pattern-bindings which bind multiple methods.
465 rnMethodBind cls sig_fn gen_tyvars mbind@(L loc (PatBind other_pat _ _ _))
466 = addLocErr mbind methodBindErr `thenM_`
467 returnM (emptyBag, emptyFVs)
471 %************************************************************************
473 \subsubsection[dep-Sigs]{Signatures (and user-pragmas for values)}
475 %************************************************************************
477 @renameSigs@ checks for:
479 \item more than one sig for one thing;
480 \item signatures given for things not bound here;
481 \item with suitably flaggery, that all top-level things have type signatures.
484 At the moment we don't gather free-var info from the types in
485 signatures. We'd only need this if we wanted to report unused tyvars.
488 renameSigs :: (LSig Name -> Bool) -> [LSig RdrName] -> RnM [LSig Name]
489 -- Renames the signatures and performs error checks
490 renameSigs ok_sig sigs
491 = do { sigs' <- rename_sigs sigs
492 ; check_sigs ok_sig sigs'
495 ----------------------
496 rename_sigs :: [LSig RdrName] -> RnM [LSig Name]
497 rename_sigs sigs = mappM (wrapLocM renameSig)
498 (filter (not . isFixityLSig) sigs)
499 -- Remove fixity sigs which have been dealt with already
501 ----------------------
502 check_sigs :: (LSig Name -> Bool) -> [LSig Name] -> RnM ()
503 -- Used for class and instance decls, as well as regular bindings
504 check_sigs ok_sig sigs
505 -- Check for (a) duplicate signatures
506 -- (b) signatures for things not in this group
507 = do { mappM_ unknownSigErr (filter (not . ok_sig) sigs')
508 ; mappM_ dupSigDeclErr (findDupsEq eqHsSig sigs') }
510 -- Don't complain about an unbound name again
511 sigs' = filterOut bad_name sigs
512 bad_name sig = case sigName sig of
513 Just n -> isUnboundName n
516 -- We use lookupLocatedSigOccRn in the signatures, which is a little bit unsatisfactory
517 -- because this won't work for:
518 -- instance Foo T where
521 -- We'll just rename the INLINE prag to refer to whatever other 'op'
522 -- is in scope. (I'm assuming that Baz.op isn't in scope unqualified.)
523 -- Doesn't seem worth much trouble to sort this.
525 renameSig :: Sig RdrName -> RnM (Sig Name)
526 -- FixitSig is renamed elsewhere.
527 renameSig (TypeSig v ty)
528 = lookupLocatedSigOccRn v `thenM` \ new_v ->
529 rnHsSigType (quotes (ppr v)) ty `thenM` \ new_ty ->
530 returnM (TypeSig new_v new_ty)
532 renameSig (SpecInstSig ty)
533 = rnLHsType (text "A SPECIALISE instance pragma") ty `thenM` \ new_ty ->
534 returnM (SpecInstSig new_ty)
536 renameSig (SpecSig v ty inl)
537 = lookupLocatedSigOccRn v `thenM` \ new_v ->
538 rnHsSigType (quotes (ppr v)) ty `thenM` \ new_ty ->
539 returnM (SpecSig new_v new_ty inl)
541 renameSig (InlineSig v s)
542 = lookupLocatedSigOccRn v `thenM` \ new_v ->
543 returnM (InlineSig new_v s)
547 ************************************************************************
551 ************************************************************************
554 rnMatchGroup :: HsMatchContext Name -> MatchGroup RdrName -> RnM (MatchGroup Name, FreeVars)
555 rnMatchGroup ctxt (MatchGroup ms _)
556 = mapFvRn (rnMatch ctxt) ms `thenM` \ (new_ms, ms_fvs) ->
557 returnM (MatchGroup new_ms placeHolderType, ms_fvs)
559 rnMatch :: HsMatchContext Name -> LMatch RdrName -> RnM (LMatch Name, FreeVars)
560 rnMatch ctxt = wrapLocFstM (rnMatch' ctxt)
562 rnMatch' ctxt match@(Match pats maybe_rhs_sig grhss)
564 -- Deal with the rhs type signature
565 bindPatSigTyVarsFV rhs_sig_tys $
566 doptM Opt_GlasgowExts `thenM` \ opt_GlasgowExts ->
567 (case maybe_rhs_sig of
568 Nothing -> returnM (Nothing, emptyFVs)
569 Just ty | opt_GlasgowExts -> rnHsTypeFVs doc_sig ty `thenM` \ (ty', ty_fvs) ->
570 returnM (Just ty', ty_fvs)
571 | otherwise -> addLocErr ty patSigErr `thenM_`
572 returnM (Nothing, emptyFVs)
573 ) `thenM` \ (maybe_rhs_sig', ty_fvs) ->
575 -- Now the main event
576 rnPatsAndThen ctxt pats $ \ pats' ->
577 rnGRHSs ctxt grhss `thenM` \ (grhss', grhss_fvs) ->
579 returnM (Match pats' maybe_rhs_sig' grhss', grhss_fvs `plusFV` ty_fvs)
580 -- The bindPatSigTyVarsFV and rnPatsAndThen will remove the bound FVs
582 rhs_sig_tys = case maybe_rhs_sig of
585 doc_sig = text "In a result type-signature"
589 %************************************************************************
591 \subsubsection{Guarded right-hand sides (GRHSs)}
593 %************************************************************************
596 rnGRHSs :: HsMatchContext Name -> GRHSs RdrName -> RnM (GRHSs Name, FreeVars)
598 rnGRHSs ctxt (GRHSs grhss binds)
599 = rnLocalBindsAndThen binds $ \ binds' ->
600 mapFvRn (rnGRHS ctxt) grhss `thenM` \ (grhss', fvGRHSs) ->
601 returnM (GRHSs grhss' binds', fvGRHSs)
603 rnGRHS :: HsMatchContext Name -> LGRHS RdrName -> RnM (LGRHS Name, FreeVars)
604 rnGRHS ctxt = wrapLocFstM (rnGRHS' ctxt)
606 rnGRHS' ctxt (GRHS guards rhs)
607 = do { opt_GlasgowExts <- doptM Opt_GlasgowExts
608 ; ((guards', rhs'), fvs) <- rnStmts (PatGuard ctxt) guards $
611 ; checkM (opt_GlasgowExts || is_standard_guard guards')
612 (addWarn (nonStdGuardErr guards'))
614 ; return (GRHS guards' rhs', fvs) }
616 -- Standard Haskell 1.4 guards are just a single boolean
617 -- expression, rather than a list of qualifiers as in the
619 is_standard_guard [] = True
620 is_standard_guard [L _ (ExprStmt _ _ _)] = True
621 is_standard_guard other = False
624 %************************************************************************
626 \subsection{Error messages}
628 %************************************************************************
631 dupSigDeclErr sigs@(L loc sig : _)
633 vcat [ptext SLIT("Duplicate") <+> what_it_is <> colon,
634 nest 2 (vcat (map ppr_sig sigs))]
636 what_it_is = hsSigDoc sig
637 ppr_sig (L loc sig) = ppr loc <> colon <+> ppr sig
639 unknownSigErr (L loc sig)
641 sep [ptext SLIT("Misplaced") <+> what_it_is <> colon, ppr sig]
643 what_it_is = hsSigDoc sig
646 = addWarnAt (mkSrcSpan loc loc) $
647 sep [ptext SLIT("Definition but no type signature for"), quotes (ppr var)]
649 loc = nameSrcLoc var -- TODO: make a proper span
652 = hang (ptext SLIT("Pattern bindings (except simple variables) not allowed in instance declarations"))
655 bindsInHsBootFile mbinds
656 = hang (ptext SLIT("Bindings in hs-boot files are not allowed"))
659 nonStdGuardErr guards
660 = hang (ptext SLIT("accepting non-standard pattern guards (-fglasgow-exts to suppress this message)"))
661 4 (interpp'SP guards)