X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Frename%2FRnBinds.lhs;h=7b2cf88e7cc8c26e7c6d4a5d1512e30bee2bd6de;hb=e7b69c553c58133ddbdc756bec03a43d35b0be5e;hp=3c27d75f93caca4d0b69a64631aa061f91c89d43;hpb=ca5a4a480d10d61e5b7a52eb4d556e8b8c33e69d;p=ghc-hetmet.git diff --git a/ghc/compiler/rename/RnBinds.lhs b/ghc/compiler/rename/RnBinds.lhs index 3c27d75..7b2cf88 100644 --- a/ghc/compiler/rename/RnBinds.lhs +++ b/ghc/compiler/rename/RnBinds.lhs @@ -1,5 +1,5 @@ % -% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996 +% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998 % \section[RnBinds]{Renaming and dependency analysis of bindings} @@ -9,36 +9,36 @@ type-synonym declarations; those cannot be done at this stage because they may be affected by renaming (which isn't fully worked out yet). \begin{code} -#include "HsVersions.h" - module RnBinds ( - rnTopBinds, - rnMethodBinds, + rnTopBinds, rnTopMonoBinds, + rnMethodBinds, renameSigs, renameSigsFVs, rnBinds, - FreeVars(..), - DefinedVars(..) + unknownSigErr ) where -import Ubiq -import RnLoop -- break the RnPass/RnExpr/RnBinds loops +#include "HsVersions.h" + +import {-# SOURCE #-} RnSource ( rnHsSigType, rnHsType ) import HsSyn -import HsPragmas ( isNoGenPragmas, noGenPragmas ) +import HsBinds ( eqHsSig, sigName, hsSigDoc ) import RdrHsSyn import RnHsSyn import RnMonad -import RnExpr ( rnMatch, rnGRHSsAndBinds, rnPat, checkPrecMatch ) - -import CmdLineOpts ( opt_SigsRequired ) -import Digraph ( stronglyConnComp ) -import ErrUtils ( addErrLoc, addShortErrLocLine ) -import Name ( RdrName ) -import Maybes ( catMaybes ) -import Pretty -import UniqSet ( emptyUniqSet, unitUniqSet, mkUniqSet, - unionUniqSets, unionManyUniqSets, - elementOfUniqSet, uniqSetToList, UniqSet(..) ) -import Util ( thenCmp, isIn, removeDups, panic, panic#, assertPanic ) +import RnExpr ( rnMatch, rnGRHSs, rnPat, checkPrecMatch ) +import RnEnv ( bindLocatedLocalsRn, lookupBndrRn, + lookupGlobalOccRn, lookupSigOccRn, + warnUnusedLocalBinds, mapFvRn, extendTyVarEnvFVRn, + ) +import CmdLineOpts ( DynFlag(..) ) +import Digraph ( stronglyConnComp, SCC(..) ) +import Name ( Name, nameOccName, nameSrcLoc ) +import NameSet +import RdrName ( RdrName, rdrNameOcc ) +import BasicTypes ( RecFlag(..) ) +import List ( partition ) +import Outputable +import PrelNames ( isUnboundName ) \end{code} -- ToDo: Put the annotations into the monad, so that they arrive in the proper @@ -63,23 +63,12 @@ This is precisely what the function @rnBinds@ does. ToDo: deal with case where a single monobinds binds the same variable twice. -Sets of variable names are represented as sets explicitly, rather than lists. - -\begin{code} -type DefinedVars = UniqSet RnName -type FreeVars = UniqSet RnName -\end{code} - -i.e., binders. - The vertag tag is a unique @Int@; the tags only need to be unique within one @MonoBinds@, so that unique-Int plumbing is done explicitly (heavy monad machinery not needed). \begin{code} type VertexTag = Int -type Cycle = [VertexTag] -type Edge = (VertexTag, VertexTag) \end{code} %************************************************************************ @@ -87,6 +76,7 @@ type Edge = (VertexTag, VertexTag) %* naming conventions * %* * %************************************************************************ + \subsection[name-conventions]{Name conventions} The basic algorithm involves walking over the tree and returning a tuple @@ -113,6 +103,7 @@ a set of variables free in @Exp@ is written @fvExp@ %* analysing polymorphic bindings (HsBinds, Bind, MonoBinds) * %* * %************************************************************************ + \subsubsection[dep-HsBinds]{Polymorphic bindings} Non-recursive expressions are reconstructed without any changes at top @@ -153,242 +144,264 @@ instance declarations. It expects only to see @FunMonoBind@s, and it expects the global environment to contain bindings for the binders (which are all class operations). -\begin{code} -rnTopBinds :: RdrNameHsBinds -> RnM_Fixes s RenamedHsBinds -rnMethodBinds :: RnName{-class-} -> RdrNameMonoBinds -> RnM_Fixes s RenamedMonoBinds -rnBinds :: RdrNameHsBinds -> RnM_Fixes s (RenamedHsBinds, FreeVars, [RnName]) - -rnTopBinds EmptyBinds = returnRn EmptyBinds -rnTopBinds (SingleBind (RecBind bind)) = rnTopMonoBinds bind [] -rnTopBinds (BindWith (RecBind bind) sigs) = rnTopMonoBinds bind sigs - -- the parser doesn't produce other forms - --- ******************************************************************** +%************************************************************************ +%* * +\subsubsection{ Top-level bindings} +%* * +%************************************************************************ -rnMethodBinds class_name EmptyMonoBinds = returnRn EmptyMonoBinds +@rnTopBinds@ assumes that the environment already +contains bindings for the binders of this particular binding. -rnMethodBinds class_name (AndMonoBinds mb1 mb2) - = andRn AndMonoBinds (rnMethodBinds class_name mb1) - (rnMethodBinds class_name mb2) +\begin{code} +rnTopBinds :: RdrNameHsBinds -> RnMS (RenamedHsBinds, FreeVars) -rnMethodBinds class_name (FunMonoBind occname inf matches locn) - = pushSrcLocRn locn $ - lookupClassOp class_name occname `thenRn` \ op_name -> - mapAndUnzipRn rnMatch matches `thenRn` \ (new_matches, _) -> - mapRn (checkPrecMatch inf op_name) new_matches `thenRn_` - returnRn (FunMonoBind op_name inf new_matches locn) +rnTopBinds EmptyBinds = returnRn (EmptyBinds, emptyFVs) +rnTopBinds (MonoBind bind sigs _) = rnTopMonoBinds bind sigs + -- The parser doesn't produce other forms -rnMethodBinds class_name (PatMonoBind (VarPatIn occname) grhss_and_binds locn) - = pushSrcLocRn locn $ - lookupClassOp class_name occname `thenRn` \ op_name -> - rnGRHSsAndBinds grhss_and_binds `thenRn` \ (grhss_and_binds', _) -> - returnRn (PatMonoBind (VarPatIn op_name) grhss_and_binds' locn) --- Can't handle method pattern-bindings which bind multiple methods. -rnMethodBinds _ mbind@(PatMonoBind other_pat _ locn) - = failButContinueRn EmptyMonoBinds (methodBindErr mbind locn) +rnTopMonoBinds mbinds sigs + = mapRn lookupBndrRn binder_rdr_names `thenRn` \ binder_names -> + let + bndr_name_set = mkNameSet binder_names + in + renameSigsFVs (okBindSig bndr_name_set) sigs `thenRn` \ (siglist, sig_fvs) -> --- ******************************************************************** + ifOptRn Opt_WarnMissingSigs ( + let + type_sig_vars = [n | Sig n _ _ <- siglist] + un_sigd_binders = nameSetToList (delListFromNameSet bndr_name_set type_sig_vars) + in + mapRn_ missingSigWarn un_sigd_binders + ) `thenRn_` -rnBinds EmptyBinds = returnRn (EmptyBinds,emptyUniqSet,[]) -rnBinds (SingleBind (RecBind bind)) = rnNestedMonoBinds bind [] -rnBinds (BindWith (RecBind bind) sigs) = rnNestedMonoBinds bind sigs - -- the parser doesn't produce other forms + rn_mono_binds siglist mbinds `thenRn` \ (final_binds, bind_fvs) -> + returnRn (final_binds, bind_fvs `plusFV` sig_fvs) + where + binder_rdr_names = collectMonoBinders mbinds \end{code} -@rnNestedMonoBinds@ - - collects up the binders for this declaration group, - - checkes that they form a set - - extends the environment to bind them to new local names - - calls @rnMonoBinds@ to do the real work +%************************************************************************ +%* * +%* Nested binds +%* * +%************************************************************************ -In contrast, @rnTopMonoBinds@ doesn't extend the environment, because that's -already done in pass3. All it does is call @rnMonoBinds@ and discards -the free var info. +\subsubsection{Nested binds} +@rnMonoBinds@ +\begin{itemize} +\item collects up the binders for this declaration group, +\item checks that they form a set +\item extends the environment to bind them to new local names +\item calls @rnMonoBinds@ to do the real work +\end{itemize} +% \begin{code} -rnTopMonoBinds :: RdrNameMonoBinds -> [RdrNameSig] -> RnM_Fixes s RenamedHsBinds - -rnTopMonoBinds EmptyMonoBinds sigs = returnRn EmptyBinds - -rnTopMonoBinds mbs sigs - = rnBindSigs True{-top-level-} (collectMonoBinders mbs) sigs `thenRn` \ siglist -> - rnMonoBinds mbs siglist `thenRn` \ (new_binds, fv_set) -> - returnRn new_binds +rnBinds :: RdrNameHsBinds + -> (RenamedHsBinds -> RnMS (result, FreeVars)) + -> RnMS (result, FreeVars) +rnBinds EmptyBinds thing_inside = thing_inside EmptyBinds +rnBinds (MonoBind bind sigs _) thing_inside = rnMonoBinds bind sigs thing_inside + -- the parser doesn't produce other forms -rnNestedMonoBinds :: RdrNameMonoBinds -> [RdrNameSig] - -> RnM_Fixes s (RenamedHsBinds, FreeVars, [RnName]) -rnNestedMonoBinds EmptyMonoBinds sigs - = returnRn (EmptyBinds, emptyUniqSet, []) +rnMonoBinds :: RdrNameMonoBinds + -> [RdrNameSig] + -> (RenamedHsBinds -> RnMS (result, FreeVars)) + -> RnMS (result, FreeVars) -rnNestedMonoBinds mbinds sigs -- Non-empty monobinds - = - -- Extract all the binders in this group, +rnMonoBinds mbinds sigs thing_inside -- Non-empty monobinds + = -- Extract all the binders in this group, -- and extend current scope, inventing new names for the new binders -- This also checks that the names form a set + bindLocatedLocalsRn (text "a binding group") + mbinders_w_srclocs $ \ new_mbinders -> + let + binder_set = mkNameSet new_mbinders + in + -- Rename the signatures + renameSigsFVs (okBindSig binder_set) sigs `thenRn` \ (siglist, sig_fvs) -> + + -- Report the fixity declarations in this group that + -- don't refer to any of the group's binders. + -- Then install the fixity declarations that do apply here + -- Notice that they scope over thing_inside too + let + fixity_sigs = [(name,sig) | FixSig sig@(FixitySig name _ _) <- siglist ] + in + extendFixityEnv fixity_sigs $ + + rn_mono_binds siglist mbinds `thenRn` \ (binds, bind_fvs) -> + + -- Now do the "thing inside", and deal with the free-variable calculations + thing_inside binds `thenRn` \ (result,result_fvs) -> let - mbinders_w_srclocs = collectMonoBindersAndLocs mbinds - mbinders = map fst mbinders_w_srclocs + all_fvs = result_fvs `plusFV` bind_fvs `plusFV` sig_fvs + unused_binders = nameSetToList (binder_set `minusNameSet` all_fvs) in - newLocalNames "variable" - mbinders_w_srclocs `thenRn` \ new_mbinders -> - - extendSS2 new_mbinders ( - rnBindSigs False{-not top- level-} mbinders sigs `thenRn` \ siglist -> - rnMonoBinds mbinds siglist - ) `thenRn` \ (new_binds, fv_set) -> - returnRn (new_binds, fv_set, new_mbinders) + warnUnusedLocalBinds unused_binders `thenRn_` + returnRn (result, delListFromNameSet all_fvs new_mbinders) + where + mbinders_w_srclocs = collectLocatedMonoBinders mbinds \end{code} -@rnMonoBinds@ is used by *both* top-level and nested bindings. It -assumes that all variables bound in this group are already in scope. -This is done *either* by pass 3 (for the top-level bindings), -*or* by @rnNestedMonoBinds@ (for the nested ones). + +%************************************************************************ +%* * +\subsubsection{ MonoBinds -- the main work is done here} +%* * +%************************************************************************ + +@rn_mono_binds@ is used by {\em both} top-level and nested bindings. +It assumes that all variables bound in this group are already in scope. +This is done {\em either} by pass 3 (for the top-level bindings), +{\em or} by @rnMonoBinds@ (for the nested ones). \begin{code} -rnMonoBinds :: RdrNameMonoBinds - -> [RenamedSig] -- Signatures attached to this group - -> RnM_Fixes s (RenamedHsBinds, FreeVars) +rn_mono_binds :: [RenamedSig] -- Signatures attached to this group + -> RdrNameMonoBinds + -> RnMS (RenamedHsBinds, -- Dependency analysed + FreeVars) -- Free variables -rnMonoBinds mbinds siglist +rn_mono_binds siglist mbinds = -- Rename the bindings, returning a MonoBindsInfo -- which is a list of indivisible vertices so far as -- the strongly-connected-components (SCC) analysis is concerned - flattenMonoBinds 0 siglist mbinds `thenRn` \ (_, mbinds_info) -> + flattenMonoBinds siglist mbinds `thenRn` \ mbinds_info -> -- Do the SCC analysis - let vertices = mkVertices mbinds_info - edges = mkEdges vertices mbinds_info - - scc_result = stronglyConnComp (==) edges vertices + let + edges = mkEdges (mbinds_info `zip` [(0::Int)..]) + scc_result = stronglyConnComp edges + final_binds = foldr (ThenBinds . reconstructCycle) EmptyBinds scc_result -- Deal with bound and free-var calculation - rhs_free_vars = foldr f emptyUniqSet mbinds_info - - final_binds = reconstructRec scc_result edges mbinds_info - - happy_answer = returnRn (final_binds, rhs_free_vars) + rhs_fvs = plusFVs [fvs | (_,fvs,_,_) <- mbinds_info] in - case (inline_sigs_in_recursive_binds final_binds) of - Nothing -> happy_answer - Just names_n_locns -> --- SLPJ: sometimes want recursive INLINE for worker wrapper style stuff --- addErrRn (inlineInRecursiveBindsErr names_n_locns) `thenRn_` - {-not so-}happy_answer - where - f :: (a,b, FreeVars, c,d) -> FreeVars -> FreeVars - - f (_, _, fvs_body, _, _) fvs_sofar = fvs_sofar `unionUniqSets` fvs_body - - inline_sigs_in_recursive_binds (BindWith (RecBind _) sigs) - = case [(n, locn) | (InlineSig n locn) <- sigs ] of - [] -> Nothing - sigh -> -#if OMIT_DEFORESTER - Just sigh -#else - -- Allow INLINEd recursive functions if they are - -- designated DEFORESTable too. - case [(n, locn) | (DeforestSig n locn) <- sigs ] of - [] -> Just sigh - sigh -> Nothing -#endif - - inline_sigs_in_recursive_binds (ThenBinds b1 b2) - = case (inline_sigs_in_recursive_binds b1) of - Nothing -> inline_sigs_in_recursive_binds b2 - Just x -> Just x -- NB: won't report error(s) in b2 - - inline_sigs_in_recursive_binds anything_else = Nothing + returnRn (final_binds, rhs_fvs) \end{code} @flattenMonoBinds@ is ever-so-slightly magical in that it sticks unique ``vertex tags'' on its output; minor plumbing required. +Sigh --- need to pass along the signatures for the group of bindings, +in case any of them \fbox{\ ???\ } + \begin{code} -flattenMonoBinds :: Int -- Next free vertex tag - -> [RenamedSig] -- Signatures +flattenMonoBinds :: [RenamedSig] -- Signatures -> RdrNameMonoBinds - -> RnM_Fixes s (Int, FlatMonoBindsInfo) + -> RnMS [FlatMonoBindsInfo] -flattenMonoBinds uniq sigs EmptyMonoBinds = returnRn (uniq, []) +flattenMonoBinds sigs EmptyMonoBinds = returnRn [] -flattenMonoBinds uniq sigs (AndMonoBinds mB1 mB2) - = flattenMonoBinds uniq sigs mB1 `thenRn` \ (uniq1, flat1) -> - flattenMonoBinds uniq1 sigs mB2 `thenRn` \ (uniq2, flat2) -> - returnRn (uniq2, flat1 ++ flat2) +flattenMonoBinds sigs (AndMonoBinds bs1 bs2) + = flattenMonoBinds sigs bs1 `thenRn` \ flat1 -> + flattenMonoBinds sigs bs2 `thenRn` \ flat2 -> + returnRn (flat1 ++ flat2) -flattenMonoBinds uniq sigs (PatMonoBind pat grhss_and_binds locn) +flattenMonoBinds sigs (PatMonoBind pat grhss locn) = pushSrcLocRn locn $ - rnPat pat `thenRn` \ pat' -> - rnGRHSsAndBinds grhss_and_binds `thenRn` \ (grhss_and_binds', fvs) -> + rnPat pat `thenRn` \ (pat', pat_fvs) -> -- Find which things are bound in this group let - names_bound_here = collectPatBinders pat' - - sigs_etc_for_here = foldl (sig_for_here (\ n -> n `is_elem` names_bound_here)) - [] sigs - - sigs_fvs = foldr sig_fv emptyUniqSet sigs_etc_for_here - - is_elem = isIn "flattenMonoBinds" + names_bound_here = mkNameSet (collectPatBinders pat') in - returnRn ( - uniq + 1, - [(uniq, - mkUniqSet names_bound_here, - fvs `unionUniqSets` sigs_fvs, - PatMonoBind pat' grhss_and_binds' locn, - sigs_etc_for_here + sigsForMe names_bound_here sigs `thenRn` \ sigs_for_me -> + rnGRHSs grhss `thenRn` \ (grhss', fvs) -> + returnRn + [(names_bound_here, + fvs `plusFV` pat_fvs, + PatMonoBind pat' grhss' locn, + sigs_for_me )] - ) -flattenMonoBinds uniq sigs (FunMonoBind name inf matches locn) - = pushSrcLocRn locn $ - lookupValue name `thenRn` \ name' -> - mapAndUnzipRn rnMatch matches `thenRn` \ (new_matches, fv_lists) -> - mapRn (checkPrecMatch inf name') new_matches `thenRn_` +flattenMonoBinds sigs (FunMonoBind name inf matches locn) + = pushSrcLocRn locn $ + lookupBndrRn name `thenRn` \ new_name -> let - fvs = unionManyUniqSets fv_lists - - sigs_for_me = foldl (sig_for_here (\ n -> n == name')) [] sigs - - sigs_fvs = foldr sig_fv emptyUniqSet sigs_for_me + names_bound_here = unitNameSet new_name in - returnRn ( - uniq + 1, - [(uniq, - unitUniqSet name', - fvs `unionUniqSets` sigs_fvs, - FunMonoBind name' inf new_matches locn, + sigsForMe names_bound_here sigs `thenRn` \ sigs_for_me -> + mapFvRn rnMatch matches `thenRn` \ (new_matches, fvs) -> + mapRn_ (checkPrecMatch inf new_name) new_matches `thenRn_` + returnRn + [(unitNameSet new_name, + fvs, + FunMonoBind new_name inf new_matches locn, sigs_for_me )] - ) + + +sigsForMe names_bound_here sigs + = foldlRn check [] (filter (sigForThisGroup names_bound_here) sigs) + where + check sigs sig = case filter (eqHsSig sig) sigs of + [] -> returnRn (sig:sigs) + other -> dupSigDeclErr sig `thenRn_` + returnRn sigs \end{code} -Grab type-signatures/user-pragmas of interest: + +@rnMethodBinds@ is used for the method bindings of a class and an instance +declaration. Like @rnMonoBinds@ but without dependency analysis. + +NOTA BENE: we record each {\em binder} of a method-bind group as a free variable. +That's crucial when dealing with an instance decl: +\begin{verbatim} + instance Foo (T a) where + op x = ... +\end{verbatim} +This might be the {\em sole} occurrence of @op@ for an imported class @Foo@, +and unless @op@ occurs we won't treat the type signature of @op@ in the class +decl for @Foo@ as a source of instance-decl gates. But we should! Indeed, +in many ways the @op@ in an instance decl is just like an occurrence, not +a binder. + \begin{code} -sig_for_here want_me acc s@(Sig n _ _ _) | want_me n = s:acc -sig_for_here want_me acc s@(InlineSig n _) | want_me n = s:acc -sig_for_here want_me acc s@(DeforestSig n _) | want_me n = s:acc -sig_for_here want_me acc s@(SpecSig n _ _ _) | want_me n = s:acc -sig_for_here want_me acc s@(MagicUnfoldingSig n _ _) - | want_me n = s:acc -sig_for_here want_me acc other_wise = acc - --- If a SPECIALIZE pragma is of the "... = blah" form, --- then we'd better make sure "blah" is taken into --- acct in the dependency analysis (or we get an --- unexpected out-of-scope error)! WDP 95/07 - -sig_fv (SpecSig _ _ (Just blah) _) acc = acc `unionUniqSets` unitUniqSet blah -sig_fv _ acc = acc +rnMethodBinds :: [Name] -- Names for generic type variables + -> RdrNameMonoBinds + -> RnMS (RenamedMonoBinds, FreeVars) + +rnMethodBinds gen_tyvars EmptyMonoBinds = returnRn (EmptyMonoBinds, emptyFVs) + +rnMethodBinds gen_tyvars (AndMonoBinds mb1 mb2) + = rnMethodBinds gen_tyvars mb1 `thenRn` \ (mb1', fvs1) -> + rnMethodBinds gen_tyvars mb2 `thenRn` \ (mb2', fvs2) -> + returnRn (mb1' `AndMonoBinds` mb2', fvs1 `plusFV` fvs2) + +rnMethodBinds gen_tyvars (FunMonoBind name inf matches locn) + = pushSrcLocRn locn $ + + lookupGlobalOccRn name `thenRn` \ sel_name -> + -- We use the selector name as the binder + + mapFvRn rn_match matches `thenRn` \ (new_matches, fvs) -> + mapRn_ (checkPrecMatch inf sel_name) new_matches `thenRn_` + returnRn (FunMonoBind sel_name inf new_matches locn, fvs `addOneFV` sel_name) + where + -- Gruesome; bring into scope the correct members of the generic type variables + -- See comments in RnSource.rnSourceDecl(ClassDecl) + rn_match match@(Match _ (TypePatIn ty : _) _ _) + = extendTyVarEnvFVRn gen_tvs (rnMatch match) + where + tvs = map rdrNameOcc (extractHsTyRdrNames ty) + gen_tvs = [tv | tv <- gen_tyvars, nameOccName tv `elem` tvs] + + rn_match match = rnMatch match + + +-- Can't handle method pattern-bindings which bind multiple methods. +rnMethodBinds gen_tyvars mbind@(PatMonoBind other_pat _ locn) + = pushSrcLocRn locn $ + failWithRn (EmptyMonoBinds, emptyFVs) (methodBindErr mbind) \end{code} + %************************************************************************ %* * \subsection[reconstruct-deps]{Reconstructing dependencies} @@ -399,60 +412,22 @@ This @MonoBinds@- and @ClassDecls@-specific code is segregated here, as the two cases are similar. \begin{code} -reconstructRec :: [Cycle] -- Result of SCC analysis; at least one - -> [Edge] -- Original edges - -> FlatMonoBindsInfo - -> RenamedHsBinds +reconstructCycle :: SCC FlatMonoBindsInfo + -> RenamedHsBinds -reconstructRec cycles edges mbi - = foldr1 ThenBinds (map (reconstructCycle mbi) cycles) - where - reconstructCycle :: FlatMonoBindsInfo -> Cycle -> RenamedHsBinds +reconstructCycle (AcyclicSCC (_, _, binds, sigs)) + = MonoBind binds sigs NonRecursive - reconstructCycle mbi2 cycle - = case [(binds,sigs) | (vertex, _, _, binds, sigs) <- mbi2, vertex `is_elem` cycle] - of { relevant_binds_and_sigs -> - - case (unzip relevant_binds_and_sigs) of { (binds, sig_lists) -> - - case (foldr AndMonoBinds EmptyMonoBinds binds) of { this_gp_binds -> - let - this_gp_sigs = foldr1 (++) sig_lists - have_sigs = not (null sig_lists) - -- ToDo: this might not be the right - -- thing to call this predicate; - -- e.g. "have_sigs [[], [], []]" ??????????? - in - mk_binds this_gp_binds this_gp_sigs (isCyclic edges cycle) have_sigs - }}} - where - is_elem = isIn "reconstructRec" - - mk_binds :: RenamedMonoBinds -> [RenamedSig] - -> Bool -> Bool -> RenamedHsBinds - - mk_binds bs ss True False = SingleBind (RecBind bs) - mk_binds bs ss True True{-have sigs-} = BindWith (RecBind bs) ss - mk_binds bs ss False False = SingleBind (NonRecBind bs) - mk_binds bs ss False True{-have sigs-} = BindWith (NonRecBind bs) ss - - -- moved from Digraph, as this is the only use here - -- (avoid overloading cost). We have to use elem - -- (not FiniteMaps or whatever), because there may be - -- many edges out of one vertex. We give it its own - -- "elem" just for speed. - - isCyclic es [] = panic "isCyclic: empty component" - isCyclic es [v] = (v,v) `elem` es - isCyclic es vs = True - - elem _ [] = False - elem x (y:ys) = x==y || elem x ys +reconstructCycle (CyclicSCC cycle) + = MonoBind this_gp_binds this_gp_sigs Recursive + where + this_gp_binds = foldr1 AndMonoBinds [binds | (_, _, binds, _) <- cycle] + this_gp_sigs = foldr1 (++) [sigs | (_, _, _, sigs) <- cycle] \end{code} %************************************************************************ %* * -%* Manipulating FlatMonoBindInfo * +\subsubsection{ Manipulating FlatMonoBindInfo} %* * %************************************************************************ @@ -463,35 +438,24 @@ renamed. \begin{code} type FlatMonoBindsInfo - = [(VertexTag, -- Identifies the vertex - UniqSet RnName, -- Set of names defined in this vertex - UniqSet RnName, -- Set of names used in this vertex - RenamedMonoBinds, -- Binding for this vertex (always just one binding, either fun or pat) - [RenamedSig]) -- Signatures, if any, for this vertex - ] + = (NameSet, -- Set of names defined in this vertex + NameSet, -- Set of names used in this vertex + RenamedMonoBinds, + [RenamedSig]) -- Signatures, if any, for this vertex + +mkEdges :: [(FlatMonoBindsInfo, VertexTag)] -> [(FlatMonoBindsInfo, VertexTag, [VertexTag])] -mkVertices :: FlatMonoBindsInfo -> [VertexTag] -mkVertices info = [ vertex | (vertex,_,_,_,_) <- info] - -mkEdges :: [VertexTag] -> FlatMonoBindsInfo -> [Edge] - -mkEdges vertices flat_info - -- An edge (v,v') indicates that v depends on v' - = [ (source_vertex, target_vertex) - | (source_vertex, _, used_names, _, _) <- flat_info, - target_name <- uniqSetToList used_names, - target_vertex <- vertices_defining target_name flat_info - ] - where - -- If each name only has one binding in this group, then - -- vertices_defining will always return the empty list, or a - -- singleton. The case when there is more than one binding (an - -- error) needs more thought. - - vertices_defining name flat_info2 - = [ vertex | (vertex, names_defined, _, _, _) <- flat_info2, - name `elementOfUniqSet` names_defined - ] +mkEdges flat_info + = [ (info, tag, dest_vertices (nameSetToList names_used)) + | (info@(names_defined, names_used, mbind, sigs), tag) <- flat_info + ] + where + -- An edge (v,v') indicates that v depends on v' + dest_vertices src_mentions = [ target_vertex + | ((names_defined, _, _, _), target_vertex) <- flat_info, + mentioned_name <- src_mentions, + mentioned_name `elemNameSet` names_defined + ] \end{code} @@ -501,143 +465,114 @@ mkEdges vertices flat_info %* * %************************************************************************ -@rnBindSigs@ checks for: (a)~more than one sig for one thing; -(b)~signatures given for things not bound here; (c)~with suitably -flaggery, that all top-level things have type signatures. +@renameSigs@ checks for: +\begin{enumerate} +\item more than one sig for one thing; +\item signatures given for things not bound here; +\item with suitably flaggery, that all top-level things have type signatures. +\end{enumerate} +% +At the moment we don't gather free-var info from the types in +signatures. We'd only need this if we wanted to report unused tyvars. \begin{code} -rnBindSigs :: Bool -- True <=> top-level binders - -> [RdrName] -- Binders for this decl group +renameSigsFVs ok_sig sigs + = renameSigs ok_sig sigs `thenRn` \ sigs' -> + returnRn (sigs', hsSigsFVs sigs') + +renameSigs :: (RenamedSig -> Bool) -- OK-sig predicate -> [RdrNameSig] - -> RnM_Fixes s [RenamedSig] -- List of Sig constructors + -> RnMS [RenamedSig] -rnBindSigs is_toplev binder_occnames sigs - = - -- Rename the signatures - -- Will complain about sigs for variables not in this group - mapRn rename_sig sigs `thenRn` \ sigs_maybe -> - let - sigs' = catMaybes sigs_maybe +renameSigs ok_sig [] = returnRn [] - -- Discard unbound ones we've already complained about, so we - -- complain about duplicate ones. +renameSigs ok_sig sigs + = -- Rename the signatures + mapRn renameSig sigs `thenRn` \ sigs' -> - (goodies, dups) = removeDups compare (filter not_unbound sigs') + -- Check for (a) duplicate signatures + -- (b) signatures for things not in this group + let + in_scope = filter is_in_scope sigs' + is_in_scope sig = case sigName sig of + Just n -> not (isUnboundName n) + Nothing -> True + (goods, bads) = partition ok_sig in_scope in - mapRn (addErrRn . dupSigDeclErr) dups `thenRn_` - - getSrcLocRn `thenRn` \ locn -> - - (if (is_toplev && opt_SigsRequired) then - let - sig_frees = catMaybes (map (sig_free sigs) binder_occnames) - in - mapRn (addErrRn . missingSigErr locn) sig_frees - else - returnRn [] - ) `thenRn_` + mapRn_ unknownSigErr bads `thenRn_` + returnRn goods + +-- We use lookupSigOccRn in the signatures, which is a little bit unsatisfactory +-- because this won't work for: +-- instance Foo T where +-- {-# INLINE op #-} +-- Baz.op = ... +-- We'll just rename the INLINE prag to refer to whatever other 'op' +-- is in scope. (I'm assuming that Baz.op isn't in scope unqualified.) +-- Doesn't seem worth much trouble to sort this. + +renameSig :: Sig RdrName -> RnMS (Sig Name) +-- ClassOpSig is renamed elsewhere. +renameSig (Sig v ty src_loc) + = pushSrcLocRn src_loc $ + lookupSigOccRn v `thenRn` \ new_v -> + rnHsSigType (quotes (ppr v)) ty `thenRn` \ new_ty -> + returnRn (Sig new_v new_ty src_loc) + +renameSig (SpecInstSig ty src_loc) + = pushSrcLocRn src_loc $ + rnHsType (text "A SPECIALISE instance pragma") ty `thenRn` \ new_ty -> + returnRn (SpecInstSig new_ty src_loc) + +renameSig (InlineInstSig p src_loc) + = returnRn (InlineInstSig p src_loc) + +renameSig (SpecSig v ty src_loc) + = pushSrcLocRn src_loc $ + lookupSigOccRn v `thenRn` \ new_v -> + rnHsSigType (quotes (ppr v)) ty `thenRn` \ new_ty -> + returnRn (SpecSig new_v new_ty src_loc) + +renameSig (FixSig (FixitySig v fix src_loc)) + = pushSrcLocRn src_loc $ + lookupSigOccRn v `thenRn` \ new_v -> + returnRn (FixSig (FixitySig new_v fix src_loc)) + +renameSig (InlineSig v p src_loc) + = pushSrcLocRn src_loc $ + lookupSigOccRn v `thenRn` \ new_v -> + returnRn (InlineSig new_v p src_loc) + +renameSig (NoInlineSig v p src_loc) + = pushSrcLocRn src_loc $ + lookupSigOccRn v `thenRn` \ new_v -> + returnRn (NoInlineSig new_v p src_loc) +\end{code} - returnRn sigs' -- bad ones and all: - -- we need bindings of *some* sort for every name - where - rename_sig (Sig v ty pragmas src_loc) - = pushSrcLocRn src_loc $ - if not (v `elem` binder_occnames) then - addErrRn (unknownSigDeclErr "type signature" v src_loc) `thenRn_` - returnRn Nothing - else - lookupValue v `thenRn` \ new_v -> - rnPolyType nullTyVarNamesEnv ty `thenRn` \ new_ty -> - - ASSERT(isNoGenPragmas pragmas) - returnRn (Just (Sig new_v new_ty noGenPragmas src_loc)) - - -- and now, the various flavours of value-modifying user-pragmas: - - rename_sig (SpecSig v ty using src_loc) - = pushSrcLocRn src_loc $ - if not (v `elem` binder_occnames) then - addErrRn (unknownSigDeclErr "SPECIALIZE pragma" v src_loc) `thenRn_` - returnRn Nothing - else - lookupValue v `thenRn` \ new_v -> - rnPolyType nullTyVarNamesEnv ty `thenRn` \ new_ty -> - rn_using using `thenRn` \ new_using -> - returnRn (Just (SpecSig new_v new_ty new_using src_loc)) - where - rn_using Nothing = returnRn Nothing - rn_using (Just x) = lookupValue x `thenRn` \ new_x -> - returnRn (Just new_x) - - rename_sig (InlineSig v src_loc) - = pushSrcLocRn src_loc $ - if not (v `elem` binder_occnames) then - addErrRn (unknownSigDeclErr "INLINE pragma" v src_loc) `thenRn_` - returnRn Nothing - else - lookupValue v `thenRn` \ new_v -> - returnRn (Just (InlineSig new_v src_loc)) - - rename_sig (DeforestSig v src_loc) - = pushSrcLocRn src_loc $ - if not (v `elem` binder_occnames) then - addErrRn (unknownSigDeclErr "DEFOREST pragma" v src_loc) `thenRn_` - returnRn Nothing - else - lookupValue v `thenRn` \ new_v -> - returnRn (Just (DeforestSig new_v src_loc)) - - rename_sig (MagicUnfoldingSig v str src_loc) - = pushSrcLocRn src_loc $ - if not (v `elem` binder_occnames) then - addErrRn (unknownSigDeclErr "MAGIC_UNFOLDING pragma" v src_loc) `thenRn_` - returnRn Nothing - else - lookupValue v `thenRn` \ new_v -> - returnRn (Just (MagicUnfoldingSig new_v str src_loc)) - - not_unbound :: RenamedSig -> Bool - - not_unbound (Sig n _ _ _) = not (isRnUnbound n) - not_unbound (SpecSig n _ _ _) = not (isRnUnbound n) - not_unbound (InlineSig n _) = not (isRnUnbound n) - not_unbound (DeforestSig n _) = not (isRnUnbound n) - not_unbound (MagicUnfoldingSig n _ _) = not (isRnUnbound n) - - ------------------------------------- - sig_free :: [RdrNameSig] -> RdrName -> Maybe RdrName - -- Return "Just x" if "x" has no type signature in - -- sigs. Nothing, otherwise. - - sig_free [] ny = Just ny - sig_free (Sig nx _ _ _ : rest) ny - = if (nx == ny) then Nothing else sig_free rest ny - sig_free (_ : rest) ny = sig_free rest ny - - ------------------------------------- - compare :: RenamedSig -> RenamedSig -> TAG_ - compare (Sig n1 _ _ _) (Sig n2 _ _ _) = n1 `cmp` n2 - compare (InlineSig n1 _) (InlineSig n2 _) = n1 `cmp` n2 - compare (MagicUnfoldingSig n1 _ _) (MagicUnfoldingSig n2 _ _) = n1 `cmp` n2 - compare (SpecSig n1 ty1 _ _) (SpecSig n2 ty2 _ _) - = -- may have many specialisations for one value; - -- but not ones that are exactly the same... - thenCmp (n1 `cmp` n2) (cmpPolyType cmp ty1 ty2) - - compare other_1 other_2 -- tags *must* be different - = let tag1 = tag other_1 - tag2 = tag other_2 - in - if tag1 _LT_ tag2 then LT_ else GT_ - - tag (Sig n1 _ _ _) = (ILIT(1) :: FAST_INT) - tag (SpecSig n1 _ _ _) = ILIT(2) - tag (InlineSig n1 _) = ILIT(3) - tag (MagicUnfoldingSig n1 _ _) = ILIT(4) - tag (DeforestSig n1 _) = ILIT(5) - tag _ = panic# "tag(RnBinds)" +\begin{code} +renameIE :: (RdrName -> RnMS Name) -> IE RdrName -> RnMS (IE Name, FreeVars) +renameIE lookup_occ_nm (IEVar v) + = lookup_occ_nm v `thenRn` \ new_v -> + returnRn (IEVar new_v, unitFV new_v) + +renameIE lookup_occ_nm (IEThingAbs v) + = lookup_occ_nm v `thenRn` \ new_v -> + returnRn (IEThingAbs new_v, unitFV new_v) + +renameIE lookup_occ_nm (IEThingAll v) + = lookup_occ_nm v `thenRn` \ new_v -> + returnRn (IEThingAll new_v, unitFV new_v) + +renameIE lookup_occ_nm (IEThingWith v vs) + = lookup_occ_nm v `thenRn` \ new_v -> + mapRn lookup_occ_nm vs `thenRn` \ new_vs -> + returnRn (IEThingWith new_v new_vs, plusFVs [ unitFV x | x <- new_v:new_vs ]) + +renameIE lookup_occ_nm (IEModuleContents m) + = returnRn (IEModuleContents m, emptyFVs) \end{code} + %************************************************************************ %* * \subsection{Error messages} @@ -645,46 +580,25 @@ rnBindSigs is_toplev binder_occnames sigs %************************************************************************ \begin{code} -dupSigDeclErr sigs - = let - undup_sigs = fst (removeDups cmp_sig sigs) - in - addErrLoc locn1 - ("more than one "++what_it_is++"\n\thas been given for these variables") ( \ sty -> - ppAboves (map (ppr sty) undup_sigs) ) +dupSigDeclErr sig + = pushSrcLocRn loc $ + addErrRn (sep [ptext SLIT("Duplicate") <+> ptext what_it_is <> colon, + ppr sig]) + where + (what_it_is, loc) = hsSigDoc sig + +unknownSigErr sig + = pushSrcLocRn loc $ + addErrRn (sep [ptext SLIT("Misplaced") <+> ptext what_it_is <> colon, + ppr sig]) where - (what_it_is, locn1) - = case (head sigs) of - Sig _ _ _ loc -> ("type signature",loc) - ClassOpSig _ _ _ loc -> ("class-method type signature", loc) - SpecSig _ _ _ loc -> ("SPECIALIZE pragma",loc) - InlineSig _ loc -> ("INLINE pragma",loc) - MagicUnfoldingSig _ _ loc -> ("MAGIC_UNFOLDING pragma",loc) - - cmp_sig a b = get_name a `cmp` get_name b - - get_name (Sig n _ _ _) = n - get_name (ClassOpSig n _ _ _) = n - get_name (SpecSig n _ _ _) = n - get_name (InlineSig n _) = n - get_name (MagicUnfoldingSig n _ _) = n - ------------------------- -methodBindErr mbind locn - = addErrLoc locn "Can't handle multiple methods defined by one pattern binding" - (\ sty -> ppr sty mbind) - --------------------------- -missingSigErr locn var - = addShortErrLocLine locn ( \ sty -> - ppBesides [ppStr "a definition but no type signature for `", - ppr sty var, - ppStr "'."]) - --------------------------------- -unknownSigDeclErr flavor var locn - = addShortErrLocLine locn ( \ sty -> - ppBesides [ppStr flavor, ppStr " but no definition for `", - ppr sty var, - ppStr "'."]) + (what_it_is, loc) = hsSigDoc sig + +missingSigWarn var + = pushSrcLocRn (nameSrcLoc var) $ + addWarnRn (sep [ptext SLIT("Definition but no type signature for"), quotes (ppr var)]) + +methodBindErr mbind + = hang (ptext SLIT("Can't handle multiple methods defined by one pattern binding")) + 4 (ppr mbind) \end{code}