%
-% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
+% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
%
\section[RnExpr]{Renaming of expressions}
Basically dependency analysis.
-Handles @Match@, @GRHSsAndBinds@, @HsExpr@, and @Qual@ datatypes. In
+Handles @Match@, @GRHSs@, @HsExpr@, and @Qualifier@ datatypes. In
general, all of these functions return a renamed thing, and a set of
free variables.
\begin{code}
-#include "HsVersions.h"
-
module RnExpr (
- rnMatch, rnGRHSsAndBinds, rnPat,
- checkPrecMatch
+ rnLExpr, rnExpr, rnStmts
) where
-import Ubiq
-import RnLoop -- break the RnPass/RnExpr/RnBinds loops
+#include "HsVersions.h"
+import RnSource ( rnSrcDecls, rnSplice, checkTH )
+import RnBinds ( rnLocalBindsAndThen, rnValBinds,
+ rnMatchGroup, trimWith )
import HsSyn
-import RdrHsSyn
import RnHsSyn
-import RnMonad
-
-import ErrUtils ( addErrLoc, addShortErrLocLine )
-import Name ( isLocallyDefinedName, pprSym, Name, RdrName )
-import Pretty
-import UniqFM ( lookupUFM, ufmToList{-ToDo:rm-} )
-import UniqSet ( emptyUniqSet, unitUniqSet,
- unionUniqSets, unionManyUniqSets,
- UniqSet(..)
- )
-import Util ( Ord3(..), removeDups, panic )
+import TcRnMonad
+import RnEnv
+import OccName ( plusOccEnv )
+import RnNames ( getLocalDeclBinders, extendRdrEnvRn )
+import RnTypes ( rnHsTypeFVs, rnLPat, rnOverLit, rnPatsAndThen, rnLit,
+ mkOpFormRn, mkOpAppRn, mkNegAppRn, checkSectionPrec,
+ dupFieldErr, checkTupSize )
+import DynFlags ( DynFlag(..) )
+import BasicTypes ( FixityDirection(..) )
+import PrelNames ( thFAKE, hasKey, assertIdKey, assertErrorName,
+ loopAName, choiceAName, appAName, arrAName, composeAName, firstAName,
+ negateName, thenMName, bindMName, failMName )
+import Name ( Name, nameOccName, nameIsLocalOrFrom )
+import NameSet
+import RdrName ( RdrName, emptyGlobalRdrEnv, extendLocalRdrEnv, lookupLocalRdrEnv )
+import LoadIface ( loadHomeInterface )
+import UniqFM ( isNullUFM )
+import UniqSet ( emptyUniqSet )
+import List ( nub )
+import Util ( isSingleton )
+import ListSetOps ( removeDups )
+import Maybes ( fromJust )
+import Outputable
+import SrcLoc ( Located(..), unLoc, getLoc, cmpLocated )
+import FastString
+
+import List ( unzip4 )
\end{code}
-*********************************************************
-* *
-\subsection{Patterns}
-* *
-*********************************************************
+%************************************************************************
+%* *
+\subsubsection{Expressions}
+%* *
+%************************************************************************
\begin{code}
-rnPat :: RdrNamePat -> RnM_Fixes s RenamedPat
-
-rnPat WildPatIn = returnRn WildPatIn
-
-rnPat (VarPatIn name)
- = lookupValue name `thenRn` \ vname ->
- returnRn (VarPatIn vname)
-
-rnPat (LitPatIn n) = returnRn (LitPatIn n)
-
-rnPat (LazyPatIn pat)
- = rnPat pat `thenRn` \ pat' ->
- returnRn (LazyPatIn pat')
-
-rnPat (AsPatIn name pat)
- = rnPat pat `thenRn` \ pat' ->
- lookupValue name `thenRn` \ vname ->
- returnRn (AsPatIn vname pat')
-
-rnPat (ConPatIn con pats)
- = lookupConstr con `thenRn` \ con' ->
- mapRn rnPat pats `thenRn` \ patslist ->
- returnRn (ConPatIn con' patslist)
-
-rnPat (ConOpPatIn pat1 con pat2)
- = lookupConstr con `thenRn` \ con' ->
- rnPat pat1 `thenRn` \ pat1' ->
- rnPat pat2 `thenRn` \ pat2' ->
- precParsePat (ConOpPatIn pat1' con' pat2')
-
-rnPat neg@(NegPatIn pat)
- = getSrcLocRn `thenRn` \ src_loc ->
- addErrIfRn (not (valid_neg_pat pat)) (negPatErr neg src_loc)
- `thenRn_`
- rnPat pat `thenRn` \ pat' ->
- returnRn (NegPatIn pat')
- where
- valid_neg_pat (LitPatIn (HsInt _)) = True
- valid_neg_pat (LitPatIn (HsFrac _)) = True
- valid_neg_pat _ = False
-
-rnPat (ParPatIn pat)
- = rnPat pat `thenRn` \ pat' ->
- returnRn (ParPatIn pat')
-
-rnPat (ListPatIn pats)
- = mapRn rnPat pats `thenRn` \ patslist ->
- returnRn (ListPatIn patslist)
-
-rnPat (TuplePatIn pats)
- = mapRn rnPat pats `thenRn` \ patslist ->
- returnRn (TuplePatIn patslist)
-
-rnPat (RecPatIn con rpats)
- = lookupConstr con `thenRn` \ con' ->
- rnRpats rpats `thenRn` \ rpats' ->
- returnRn (RecPatIn con' rpats')
+rnExprs :: [LHsExpr RdrName] -> RnM ([LHsExpr Name], FreeVars)
+rnExprs ls = rnExprs' ls emptyUniqSet
+ where
+ rnExprs' [] acc = returnM ([], acc)
+ rnExprs' (expr:exprs) acc
+ = rnLExpr expr `thenM` \ (expr', fvExpr) ->
+
+ -- Now we do a "seq" on the free vars because typically it's small
+ -- or empty, especially in very long lists of constants
+ let
+ acc' = acc `plusFV` fvExpr
+ in
+ (grubby_seqNameSet acc' rnExprs') exprs acc' `thenM` \ (exprs', fvExprs) ->
+ returnM (expr':exprs', fvExprs)
+
+-- Grubby little function to do "seq" on namesets; replace by proper seq when GHC can do seq
+grubby_seqNameSet ns result | isNullUFM ns = result
+ | otherwise = result
\end{code}
-************************************************************************
-* *
-\subsection{Match}
-* *
-************************************************************************
+Variables. We look up the variable and return the resulting name.
\begin{code}
-rnMatch :: RdrNameMatch -> RnM_Fixes s (RenamedMatch, FreeVars)
+rnLExpr :: LHsExpr RdrName -> RnM (LHsExpr Name, FreeVars)
+rnLExpr = wrapLocFstM rnExpr
+
+rnExpr :: HsExpr RdrName -> RnM (HsExpr Name, FreeVars)
+
+rnExpr (HsVar v)
+ = lookupOccRn v `thenM` \ name ->
+ doptM Opt_IgnoreAsserts `thenM` \ ignore_asserts ->
+ if name `hasKey` assertIdKey && not ignore_asserts then
+ -- We expand it to (GHC.Err.assertError location_string)
+ mkAssertErrorExpr `thenM` \ (e, fvs) ->
+ returnM (e, fvs `addOneFV` name)
+ -- Keep 'assert' as a free var, to ensure it's not reported as unused!
+ else
+ -- The normal case. Even if the Id was 'assert', if we are
+ -- ignoring assertions we leave it as GHC.Base.assert;
+ -- this function just ignores its first arg.
+ returnM (HsVar name, unitFV name)
+
+rnExpr (HsIPVar v)
+ = newIPNameRn v `thenM` \ name ->
+ returnM (HsIPVar name, emptyFVs)
+
+rnExpr (HsLit lit)
+ = rnLit lit `thenM_`
+ returnM (HsLit lit, emptyFVs)
+
+rnExpr (HsOverLit lit)
+ = rnOverLit lit `thenM` \ (lit', fvs) ->
+ returnM (HsOverLit lit', fvs)
+
+rnExpr (HsApp fun arg)
+ = rnLExpr fun `thenM` \ (fun',fvFun) ->
+ rnLExpr arg `thenM` \ (arg',fvArg) ->
+ returnM (HsApp fun' arg', fvFun `plusFV` fvArg)
+
+rnExpr (OpApp e1 op _ e2)
+ = rnLExpr e1 `thenM` \ (e1', fv_e1) ->
+ rnLExpr e2 `thenM` \ (e2', fv_e2) ->
+ rnLExpr op `thenM` \ (op'@(L _ (HsVar op_name)), fv_op) ->
+
+ -- Deal with fixity
+ -- When renaming code synthesised from "deriving" declarations
+ -- we used to avoid fixity stuff, but we can't easily tell any
+ -- more, so I've removed the test. Adding HsPars in TcGenDeriv
+ -- should prevent bad things happening.
+ lookupFixityRn op_name `thenM` \ fixity ->
+ mkOpAppRn e1' op' fixity e2' `thenM` \ final_e ->
+
+ returnM (final_e,
+ fv_e1 `plusFV` fv_op `plusFV` fv_e2)
+
+rnExpr (NegApp e _)
+ = rnLExpr e `thenM` \ (e', fv_e) ->
+ lookupSyntaxName negateName `thenM` \ (neg_name, fv_neg) ->
+ mkNegAppRn e' neg_name `thenM` \ final_e ->
+ returnM (final_e, fv_e `plusFV` fv_neg)
-rnMatch match
- = getSrcLocRn `thenRn` \ src_loc ->
- newLocalNames "variable in pattern"
- (binders `zip` repeat src_loc) `thenRn` \ new_binders ->
- extendSS2 new_binders (rnMatch_aux match)
+rnExpr (HsPar e)
+ = rnLExpr e `thenM` \ (e', fvs_e) ->
+ returnM (HsPar e', fvs_e)
+
+-- Template Haskell extensions
+-- Don't ifdef-GHCI them because we want to fail gracefully
+-- (not with an rnExpr crash) in a stage-1 compiler.
+rnExpr e@(HsBracket br_body)
+ = checkTH e "bracket" `thenM_`
+ rnBracket br_body `thenM` \ (body', fvs_e) ->
+ returnM (HsBracket body', fvs_e)
+
+rnExpr e@(HsSpliceE splice)
+ = rnSplice splice `thenM` \ (splice', fvs) ->
+ returnM (HsSpliceE splice', fvs)
+
+rnExpr section@(SectionL expr op)
+ = rnLExpr expr `thenM` \ (expr', fvs_expr) ->
+ rnLExpr op `thenM` \ (op', fvs_op) ->
+ checkSectionPrec InfixL section op' expr' `thenM_`
+ returnM (SectionL expr' op', fvs_op `plusFV` fvs_expr)
+
+rnExpr section@(SectionR op expr)
+ = rnLExpr op `thenM` \ (op', fvs_op) ->
+ rnLExpr expr `thenM` \ (expr', fvs_expr) ->
+ checkSectionPrec InfixR section op' expr' `thenM_`
+ returnM (SectionR op' expr', fvs_op `plusFV` fvs_expr)
+
+rnExpr (HsCoreAnn ann expr)
+ = rnLExpr expr `thenM` \ (expr', fvs_expr) ->
+ returnM (HsCoreAnn ann expr', fvs_expr)
+
+rnExpr (HsSCC lbl expr)
+ = rnLExpr expr `thenM` \ (expr', fvs_expr) ->
+ returnM (HsSCC lbl expr', fvs_expr)
+
+rnExpr (HsLam matches)
+ = rnMatchGroup LambdaExpr matches `thenM` \ (matches', fvMatch) ->
+ returnM (HsLam matches', fvMatch)
+
+rnExpr (HsCase expr matches)
+ = rnLExpr expr `thenM` \ (new_expr, e_fvs) ->
+ rnMatchGroup CaseAlt matches `thenM` \ (new_matches, ms_fvs) ->
+ returnM (HsCase new_expr new_matches, e_fvs `plusFV` ms_fvs)
+
+rnExpr (HsLet binds expr)
+ = rnLocalBindsAndThen binds $ \ binds' ->
+ rnLExpr expr `thenM` \ (expr',fvExpr) ->
+ returnM (HsLet binds' expr', fvExpr)
+
+rnExpr e@(HsDo do_or_lc stmts body _)
+ = do { ((stmts', body'), fvs) <- rnStmts do_or_lc stmts $
+ rnLExpr body
+ ; return (HsDo do_or_lc stmts' body' placeHolderType, fvs) }
+
+rnExpr (ExplicitList _ exps)
+ = rnExprs exps `thenM` \ (exps', fvs) ->
+ returnM (ExplicitList placeHolderType exps', fvs `addOneFV` listTyCon_name)
+
+rnExpr (ExplicitPArr _ exps)
+ = rnExprs exps `thenM` \ (exps', fvs) ->
+ returnM (ExplicitPArr placeHolderType exps', fvs)
+
+rnExpr e@(ExplicitTuple exps boxity)
+ = checkTupSize tup_size `thenM_`
+ rnExprs exps `thenM` \ (exps', fvs) ->
+ returnM (ExplicitTuple exps' boxity, fvs `addOneFV` tycon_name)
where
- binders = collect_binders match
+ tup_size = length exps
+ tycon_name = tupleTyCon_name boxity tup_size
- collect_binders :: RdrNameMatch -> [RdrName]
+rnExpr (RecordCon con_id _ rbinds)
+ = lookupLocatedOccRn con_id `thenM` \ conname ->
+ rnRbinds "construction" rbinds `thenM` \ (rbinds', fvRbinds) ->
+ returnM (RecordCon conname noPostTcExpr rbinds',
+ fvRbinds `addOneFV` unLoc conname)
- collect_binders (GRHSMatch _) = []
- collect_binders (PatMatch pat match)
- = collectPatBinders pat ++ collect_binders match
+rnExpr (RecordUpd expr rbinds _ _)
+ = rnLExpr expr `thenM` \ (expr', fvExpr) ->
+ rnRbinds "update" rbinds `thenM` \ (rbinds', fvRbinds) ->
+ returnM (RecordUpd expr' rbinds' placeHolderType placeHolderType,
+ fvExpr `plusFV` fvRbinds)
-rnMatch_aux (PatMatch pat match)
- = rnPat pat `thenRn` \ pat' ->
- rnMatch_aux match `thenRn` \ (match', fvMatch) ->
- returnRn (PatMatch pat' match', fvMatch)
+rnExpr (ExprWithTySig expr pty)
+ = rnLExpr expr `thenM` \ (expr', fvExpr) ->
+ rnHsTypeFVs doc pty `thenM` \ (pty', fvTy) ->
+ returnM (ExprWithTySig expr' pty', fvExpr `plusFV` fvTy)
+ where
+ doc = text "In an expression type signature"
+
+rnExpr (HsIf p b1 b2)
+ = rnLExpr p `thenM` \ (p', fvP) ->
+ rnLExpr b1 `thenM` \ (b1', fvB1) ->
+ rnLExpr b2 `thenM` \ (b2', fvB2) ->
+ returnM (HsIf p' b1' b2', plusFVs [fvP, fvB1, fvB2])
+
+rnExpr (HsType a)
+ = rnHsTypeFVs doc a `thenM` \ (t, fvT) ->
+ returnM (HsType t, fvT)
+ where
+ doc = text "In a type argument"
+
+rnExpr (ArithSeq _ seq)
+ = rnArithSeq seq `thenM` \ (new_seq, fvs) ->
+ returnM (ArithSeq noPostTcExpr new_seq, fvs)
+
+rnExpr (PArrSeq _ seq)
+ = rnArithSeq seq `thenM` \ (new_seq, fvs) ->
+ returnM (PArrSeq noPostTcExpr new_seq, fvs)
+\end{code}
+
+These three are pattern syntax appearing in expressions.
+Since all the symbols are reservedops we can simply reject them.
+We return a (bogus) EWildPat in each case.
-rnMatch_aux (GRHSMatch grhss_and_binds)
- = rnGRHSsAndBinds grhss_and_binds `thenRn` \ (grhss_and_binds', fvs) ->
- returnRn (GRHSMatch grhss_and_binds', fvs)
+\begin{code}
+rnExpr e@EWildPat = patSynErr e
+rnExpr e@(EAsPat {}) = patSynErr e
+rnExpr e@(ELazyPat {}) = patSynErr e
\end{code}
%************************************************************************
%* *
-\subsubsection{Guarded right-hand sides (GRHSsAndBinds)}
+ Arrow notation
%* *
%************************************************************************
\begin{code}
-rnGRHSsAndBinds :: RdrNameGRHSsAndBinds -> RnM_Fixes s (RenamedGRHSsAndBinds, FreeVars)
-
-rnGRHSsAndBinds (GRHSsAndBindsIn grhss binds)
- = rnBinds binds `thenRn` \ (binds', fvBinds, scope) ->
- extendSS2 scope (rnGRHSs grhss) `thenRn` \ (grhss', fvGRHS) ->
- returnRn (GRHSsAndBindsIn grhss' binds', fvBinds `unionUniqSets` fvGRHS)
+rnExpr (HsProc pat body)
+ = newArrowScope $
+ rnPatsAndThen ProcExpr [pat] $ \ [pat'] ->
+ rnCmdTop body `thenM` \ (body',fvBody) ->
+ returnM (HsProc pat' body', fvBody)
+
+rnExpr (HsArrApp arrow arg _ ho rtl)
+ = select_arrow_scope (rnLExpr arrow) `thenM` \ (arrow',fvArrow) ->
+ rnLExpr arg `thenM` \ (arg',fvArg) ->
+ returnM (HsArrApp arrow' arg' placeHolderType ho rtl,
+ fvArrow `plusFV` fvArg)
where
- rnGRHSs [] = returnRn ([], emptyUniqSet)
-
- rnGRHSs (grhs:grhss)
- = rnGRHS grhs `thenRn` \ (grhs', fvs) ->
- rnGRHSs grhss `thenRn` \ (grhss', fvss) ->
- returnRn (grhs' : grhss', fvs `unionUniqSets` fvss)
-
- rnGRHS (GRHS guard expr locn)
- = pushSrcLocRn locn $
- rnExpr guard `thenRn` \ (guard', fvsg) ->
- rnExpr expr `thenRn` \ (expr', fvse) ->
- returnRn (GRHS guard' expr' locn, fvsg `unionUniqSets` fvse)
-
- rnGRHS (OtherwiseGRHS expr locn)
- = pushSrcLocRn locn $
- rnExpr expr `thenRn` \ (expr', fvs) ->
- returnRn (OtherwiseGRHS expr' locn, fvs)
+ select_arrow_scope tc = case ho of
+ HsHigherOrderApp -> tc
+ HsFirstOrderApp -> escapeArrowScope tc
+
+-- infix form
+rnExpr (HsArrForm op (Just _) [arg1, arg2])
+ = escapeArrowScope (rnLExpr op)
+ `thenM` \ (op'@(L _ (HsVar op_name)),fv_op) ->
+ rnCmdTop arg1 `thenM` \ (arg1',fv_arg1) ->
+ rnCmdTop arg2 `thenM` \ (arg2',fv_arg2) ->
+
+ -- Deal with fixity
+
+ lookupFixityRn op_name `thenM` \ fixity ->
+ mkOpFormRn arg1' op' fixity arg2' `thenM` \ final_e ->
+
+ returnM (final_e,
+ fv_arg1 `plusFV` fv_op `plusFV` fv_arg2)
+
+rnExpr (HsArrForm op fixity cmds)
+ = escapeArrowScope (rnLExpr op) `thenM` \ (op',fvOp) ->
+ rnCmdArgs cmds `thenM` \ (cmds',fvCmds) ->
+ returnM (HsArrForm op' fixity cmds', fvOp `plusFV` fvCmds)
+
+rnExpr other = pprPanic "rnExpr: unexpected expression" (ppr other)
+ -- DictApp, DictLam, TyApp, TyLam
\end{code}
+
%************************************************************************
%* *
-\subsubsection{Expressions}
+ Arrow commands
%* *
%************************************************************************
\begin{code}
-rnExprs :: [RdrNameHsExpr] -> RnM_Fixes s ([RenamedHsExpr], FreeVars)
+rnCmdArgs [] = returnM ([], emptyFVs)
+rnCmdArgs (arg:args)
+ = rnCmdTop arg `thenM` \ (arg',fvArg) ->
+ rnCmdArgs args `thenM` \ (args',fvArgs) ->
+ returnM (arg':args', fvArg `plusFV` fvArgs)
+
+
+rnCmdTop = wrapLocFstM rnCmdTop'
+ where
+ rnCmdTop' (HsCmdTop cmd _ _ _)
+ = rnLExpr (convertOpFormsLCmd cmd) `thenM` \ (cmd', fvCmd) ->
+ let
+ cmd_names = [arrAName, composeAName, firstAName] ++
+ nameSetToList (methodNamesCmd (unLoc cmd'))
+ in
+ -- Generate the rebindable syntax for the monad
+ lookupSyntaxTable cmd_names `thenM` \ (cmd_names', cmd_fvs) ->
+
+ returnM (HsCmdTop cmd' [] placeHolderType cmd_names',
+ fvCmd `plusFV` cmd_fvs)
+
+---------------------------------------------------
+-- convert OpApp's in a command context to HsArrForm's
+
+convertOpFormsLCmd :: LHsCmd id -> LHsCmd id
+convertOpFormsLCmd = fmap convertOpFormsCmd
+
+convertOpFormsCmd :: HsCmd id -> HsCmd id
+
+convertOpFormsCmd (HsApp c e) = HsApp (convertOpFormsLCmd c) e
+convertOpFormsCmd (HsLam match) = HsLam (convertOpFormsMatch match)
+convertOpFormsCmd (OpApp c1 op fixity c2)
+ = let
+ arg1 = L (getLoc c1) $ HsCmdTop (convertOpFormsLCmd c1) [] placeHolderType []
+ arg2 = L (getLoc c2) $ HsCmdTop (convertOpFormsLCmd c2) [] placeHolderType []
+ in
+ HsArrForm op (Just fixity) [arg1, arg2]
-rnExprs [] = returnRn ([], emptyUniqSet)
+convertOpFormsCmd (HsPar c) = HsPar (convertOpFormsLCmd c)
-rnExprs (expr:exprs)
- = rnExpr expr `thenRn` \ (expr', fvExpr) ->
- rnExprs exprs `thenRn` \ (exprs', fvExprs) ->
- returnRn (expr':exprs', fvExpr `unionUniqSets` fvExprs)
-\end{code}
+-- gaw 2004
+convertOpFormsCmd (HsCase exp matches)
+ = HsCase exp (convertOpFormsMatch matches)
-Variables. We look up the variable and return the resulting name. The
-interesting question is what the free-variable set should be. We
-don't want to return imported or prelude things as free vars. So we
-look at the RnName returned from the lookup, and make it part of the
-free-var set iff if it's a LocallyDefined RnName.
+convertOpFormsCmd (HsIf exp c1 c2)
+ = HsIf exp (convertOpFormsLCmd c1) (convertOpFormsLCmd c2)
-ToDo: what about RnClassOps ???
-\end{itemize}
+convertOpFormsCmd (HsLet binds cmd)
+ = HsLet binds (convertOpFormsLCmd cmd)
-\begin{code}
-fv_set vname@(RnName n) | isLocallyDefinedName n
- = unitUniqSet vname
-fv_set _ = emptyUniqSet
+convertOpFormsCmd (HsDo ctxt stmts body ty)
+ = HsDo ctxt (map (fmap convertOpFormsStmt) stmts)
+ (convertOpFormsLCmd body) ty
+-- Anything else is unchanged. This includes HsArrForm (already done),
+-- things with no sub-commands, and illegal commands (which will be
+-- caught by the type checker)
+convertOpFormsCmd c = c
-rnExpr :: RdrNameHsExpr -> RnM_Fixes s (RenamedHsExpr, FreeVars)
+convertOpFormsStmt (BindStmt pat cmd _ _)
+ = BindStmt pat (convertOpFormsLCmd cmd) noSyntaxExpr noSyntaxExpr
+convertOpFormsStmt (ExprStmt cmd _ _)
+ = ExprStmt (convertOpFormsLCmd cmd) noSyntaxExpr placeHolderType
+convertOpFormsStmt (RecStmt stmts lvs rvs es binds)
+ = RecStmt (map (fmap convertOpFormsStmt) stmts) lvs rvs es binds
+convertOpFormsStmt stmt = stmt
-rnExpr (HsVar v)
- = lookupValue v `thenRn` \ vname ->
- returnRn (HsVar vname, fv_set vname)
+convertOpFormsMatch (MatchGroup ms ty)
+ = MatchGroup (map (fmap convert) ms) ty
+ where convert (Match pat mty grhss)
+ = Match pat mty (convertOpFormsGRHSs grhss)
-rnExpr (HsLit lit)
- = returnRn (HsLit lit, emptyUniqSet)
+convertOpFormsGRHSs (GRHSs grhss binds)
+ = GRHSs (map convertOpFormsGRHS grhss) binds
-rnExpr (HsLam match)
- = rnMatch match `thenRn` \ (match', fvMatch) ->
- returnRn (HsLam match', fvMatch)
+convertOpFormsGRHS = fmap convert
+ where
+ convert (GRHS stmts cmd) = GRHS stmts (convertOpFormsLCmd cmd)
-rnExpr (HsApp fun arg)
- = rnExpr fun `thenRn` \ (fun',fvFun) ->
- rnExpr arg `thenRn` \ (arg',fvArg) ->
- returnRn (HsApp fun' arg', fvFun `unionUniqSets` fvArg)
-
-rnExpr (OpApp e1 op e2)
- = rnExpr e1 `thenRn` \ (e1', fvs_e1) ->
- rnExpr op `thenRn` \ (op', fvs_op) ->
- rnExpr e2 `thenRn` \ (e2', fvs_e2) ->
- precParseExpr (OpApp e1' op' e2') `thenRn` \ exp ->
- returnRn (exp, (fvs_op `unionUniqSets` fvs_e1) `unionUniqSets` fvs_e2)
-
-rnExpr (NegApp e n)
- = rnExpr e `thenRn` \ (e', fvs_e) ->
- rnExpr n `thenRn` \ (n', fvs_n) ->
- returnRn (NegApp e' n', fvs_e `unionUniqSets` fvs_n)
+---------------------------------------------------
+type CmdNeeds = FreeVars -- Only inhabitants are
+ -- appAName, choiceAName, loopAName
-rnExpr (HsPar e)
- = rnExpr e `thenRn` \ (e', fvs_e) ->
- returnRn (HsPar e', fvs_e)
+-- find what methods the Cmd needs (loop, choice, apply)
+methodNamesLCmd :: LHsCmd Name -> CmdNeeds
+methodNamesLCmd = methodNamesCmd . unLoc
-rnExpr (SectionL expr op)
- = rnExpr expr `thenRn` \ (expr', fvs_expr) ->
- rnExpr op `thenRn` \ (op', fvs_op) ->
- returnRn (SectionL expr' op', fvs_op `unionUniqSets` fvs_expr)
+methodNamesCmd :: HsCmd Name -> CmdNeeds
-rnExpr (SectionR op expr)
- = rnExpr op `thenRn` \ (op', fvs_op) ->
- rnExpr expr `thenRn` \ (expr', fvs_expr) ->
- returnRn (SectionR op' expr', fvs_op `unionUniqSets` fvs_expr)
+methodNamesCmd cmd@(HsArrApp _arrow _arg _ HsFirstOrderApp _rtl)
+ = emptyFVs
+methodNamesCmd cmd@(HsArrApp _arrow _arg _ HsHigherOrderApp _rtl)
+ = unitFV appAName
+methodNamesCmd cmd@(HsArrForm {}) = emptyFVs
-rnExpr (CCall fun args may_gc is_casm fake_result_ty)
- = rnExprs args `thenRn` \ (args', fvs_args) ->
- returnRn (CCall fun args' may_gc is_casm fake_result_ty, fvs_args)
+methodNamesCmd (HsPar c) = methodNamesLCmd c
-rnExpr (HsSCC label expr)
- = rnExpr expr `thenRn` \ (expr', fvs_expr) ->
- returnRn (HsSCC label expr', fvs_expr)
+methodNamesCmd (HsIf p c1 c2)
+ = methodNamesLCmd c1 `plusFV` methodNamesLCmd c2 `addOneFV` choiceAName
-rnExpr (HsCase expr ms src_loc)
- = pushSrcLocRn src_loc $
- rnExpr expr `thenRn` \ (new_expr, e_fvs) ->
- mapAndUnzipRn rnMatch ms `thenRn` \ (new_ms, ms_fvs) ->
- returnRn (HsCase new_expr new_ms src_loc, unionManyUniqSets (e_fvs : ms_fvs))
+methodNamesCmd (HsLet b c) = methodNamesLCmd c
-rnExpr (HsLet binds expr)
- = rnBinds binds `thenRn` \ (binds', fvBinds, new_binders) ->
- extendSS2 new_binders (rnExpr expr) `thenRn` \ (expr',fvExpr) ->
- returnRn (HsLet binds' expr', fvBinds `unionUniqSets` fvExpr)
-
-rnExpr (HsDo stmts src_loc)
- = pushSrcLocRn src_loc $
- rnStmts stmts `thenRn` \ (stmts', fvStmts) ->
- returnRn (HsDo stmts' src_loc, fvStmts)
-
-rnExpr (ListComp expr quals)
- = rnQuals quals `thenRn` \ ((quals', qual_binders), fvQuals) ->
- extendSS2 qual_binders (rnExpr expr) `thenRn` \ (expr', fvExpr) ->
- returnRn (ListComp expr' quals', fvExpr `unionUniqSets` fvQuals)
-
-rnExpr (ExplicitList exps)
- = rnExprs exps `thenRn` \ (exps', fvs) ->
- returnRn (ExplicitList exps', fvs)
-
-rnExpr (ExplicitTuple exps)
- = rnExprs exps `thenRn` \ (exps', fvExps) ->
- returnRn (ExplicitTuple exps', fvExps)
-
-rnExpr (RecordCon (HsVar con) rbinds)
- = lookupConstr con `thenRn` \ conname ->
- rnRbinds "construction" rbinds `thenRn` \ (rbinds', fvRbinds) ->
- returnRn (RecordCon (HsVar conname) rbinds', fvRbinds)
-
-rnExpr (RecordUpd expr rbinds)
- = rnExpr expr `thenRn` \ (expr', fvExpr) ->
- rnRbinds "update" rbinds `thenRn` \ (rbinds', fvRbinds) ->
- returnRn (RecordUpd expr' rbinds', fvExpr `unionUniqSets` fvRbinds)
+methodNamesCmd (HsDo sc stmts body ty)
+ = methodNamesStmts stmts `plusFV` methodNamesLCmd body
-rnExpr (ExprWithTySig expr pty)
- = rnExpr expr `thenRn` \ (expr', fvExpr) ->
- rnPolyType nullTyVarNamesEnv pty `thenRn` \ pty' ->
- returnRn (ExprWithTySig expr' pty', fvExpr)
-
-rnExpr (HsIf p b1 b2 src_loc)
- = pushSrcLocRn src_loc $
- rnExpr p `thenRn` \ (p', fvP) ->
- rnExpr b1 `thenRn` \ (b1', fvB1) ->
- rnExpr b2 `thenRn` \ (b2', fvB2) ->
- returnRn (HsIf p' b1' b2' src_loc, unionManyUniqSets [fvP, fvB1, fvB2])
-
-rnExpr (ArithSeqIn seq)
- = rn_seq seq `thenRn` \ (new_seq, fvs) ->
- returnRn (ArithSeqIn new_seq, fvs)
- where
- rn_seq (From expr)
- = rnExpr expr `thenRn` \ (expr', fvExpr) ->
- returnRn (From expr', fvExpr)
-
- rn_seq (FromThen expr1 expr2)
- = rnExpr expr1 `thenRn` \ (expr1', fvExpr1) ->
- rnExpr expr2 `thenRn` \ (expr2', fvExpr2) ->
- returnRn (FromThen expr1' expr2', fvExpr1 `unionUniqSets` fvExpr2)
-
- rn_seq (FromTo expr1 expr2)
- = rnExpr expr1 `thenRn` \ (expr1', fvExpr1) ->
- rnExpr expr2 `thenRn` \ (expr2', fvExpr2) ->
- returnRn (FromTo expr1' expr2', fvExpr1 `unionUniqSets` fvExpr2)
-
- rn_seq (FromThenTo expr1 expr2 expr3)
- = rnExpr expr1 `thenRn` \ (expr1', fvExpr1) ->
- rnExpr expr2 `thenRn` \ (expr2', fvExpr2) ->
- rnExpr expr3 `thenRn` \ (expr3', fvExpr3) ->
- returnRn (FromThenTo expr1' expr2' expr3',
- unionManyUniqSets [fvExpr1, fvExpr2, fvExpr3])
+methodNamesCmd (HsApp c e) = methodNamesLCmd c
+
+methodNamesCmd (HsLam match) = methodNamesMatch match
+
+methodNamesCmd (HsCase scrut matches)
+ = methodNamesMatch matches `addOneFV` choiceAName
+
+methodNamesCmd other = emptyFVs
+ -- Other forms can't occur in commands, but it's not convenient
+ -- to error here so we just do what's convenient.
+ -- The type checker will complain later
+
+---------------------------------------------------
+methodNamesMatch (MatchGroup ms ty)
+ = plusFVs (map do_one ms)
+ where
+ do_one (L _ (Match pats sig_ty grhss)) = methodNamesGRHSs grhss
+
+-------------------------------------------------
+-- gaw 2004
+methodNamesGRHSs (GRHSs grhss binds) = plusFVs (map methodNamesGRHS grhss)
+
+-------------------------------------------------
+methodNamesGRHS (L _ (GRHS stmts rhs)) = methodNamesLCmd rhs
+
+---------------------------------------------------
+methodNamesStmts stmts = plusFVs (map methodNamesLStmt stmts)
+
+---------------------------------------------------
+methodNamesLStmt = methodNamesStmt . unLoc
+
+methodNamesStmt (ExprStmt cmd _ _) = methodNamesLCmd cmd
+methodNamesStmt (BindStmt pat cmd _ _) = methodNamesLCmd cmd
+methodNamesStmt (RecStmt stmts _ _ _ _)
+ = methodNamesStmts stmts `addOneFV` loopAName
+methodNamesStmt (LetStmt b) = emptyFVs
+methodNamesStmt (ParStmt ss) = emptyFVs
+ -- ParStmt can't occur in commands, but it's not convenient to error
+ -- here so we just do what's convenient
\end{code}
+
%************************************************************************
%* *
-\subsubsection{@Rbinds@s and @Rpats@s: in record expressions}
+ Arithmetic sequences
%* *
%************************************************************************
\begin{code}
-rnRbinds str rbinds
- = mapRn field_dup_err dup_fields `thenRn_`
- mapAndUnzipRn rn_rbind rbinds `thenRn` \ (rbinds', fvRbind_s) ->
- returnRn (rbinds', unionManyUniqSets fvRbind_s)
- where
- (_, dup_fields) = removeDups cmp [ f | (f,_,_) <- rbinds ]
+rnArithSeq (From expr)
+ = rnLExpr expr `thenM` \ (expr', fvExpr) ->
+ returnM (From expr', fvExpr)
+
+rnArithSeq (FromThen expr1 expr2)
+ = rnLExpr expr1 `thenM` \ (expr1', fvExpr1) ->
+ rnLExpr expr2 `thenM` \ (expr2', fvExpr2) ->
+ returnM (FromThen expr1' expr2', fvExpr1 `plusFV` fvExpr2)
+
+rnArithSeq (FromTo expr1 expr2)
+ = rnLExpr expr1 `thenM` \ (expr1', fvExpr1) ->
+ rnLExpr expr2 `thenM` \ (expr2', fvExpr2) ->
+ returnM (FromTo expr1' expr2', fvExpr1 `plusFV` fvExpr2)
+
+rnArithSeq (FromThenTo expr1 expr2 expr3)
+ = rnLExpr expr1 `thenM` \ (expr1', fvExpr1) ->
+ rnLExpr expr2 `thenM` \ (expr2', fvExpr2) ->
+ rnLExpr expr3 `thenM` \ (expr3', fvExpr3) ->
+ returnM (FromThenTo expr1' expr2' expr3',
+ plusFVs [fvExpr1, fvExpr2, fvExpr3])
+\end{code}
- field_dup_err dups = getSrcLocRn `thenRn` \ src_loc ->
- addErrRn (dupFieldErr str src_loc dups)
- rn_rbind (field, expr, pun)
- = lookupField field `thenRn` \ fieldname ->
- rnExpr expr `thenRn` \ (expr', fvExpr) ->
- returnRn ((fieldname, expr', pun), fvExpr)
+%************************************************************************
+%* *
+\subsubsection{@Rbinds@s and @Rpats@s: in record expressions}
+%* *
+%************************************************************************
-rnRpats rpats
- = mapRn field_dup_err dup_fields `thenRn_`
- mapRn rn_rpat rpats
+\begin{code}
+rnRbinds str rbinds
+ = mappM_ field_dup_err dup_fields `thenM_`
+ mapFvRn rn_rbind rbinds `thenM` \ (rbinds', fvRbind) ->
+ returnM (rbinds', fvRbind)
where
- (_, dup_fields) = removeDups cmp [ f | (f,_,_) <- rpats ]
+ (_, dup_fields) = removeDups cmpLocated [ f | (f,_) <- rbinds ]
- field_dup_err dups = getSrcLocRn `thenRn` \ src_loc ->
- addErrRn (dupFieldErr "pattern" src_loc dups)
+ field_dup_err dups = mappM_ (\f -> addLocErr f (dupFieldErr str)) dups
- rn_rpat (field, pat, pun)
- = lookupField field `thenRn` \ fieldname ->
- rnPat pat `thenRn` \ pat' ->
- returnRn (fieldname, pat', pun)
+ rn_rbind (field, expr)
+ = lookupLocatedGlobalOccRn field `thenM` \ fieldname ->
+ rnLExpr expr `thenM` \ (expr', fvExpr) ->
+ returnM ((fieldname, expr'), fvExpr `addOneFV` unLoc fieldname)
\end{code}
%************************************************************************
%* *
-\subsubsection{@Qual@s: in list comprehensions}
+ Template Haskell brackets
%* *
%************************************************************************
-Note that although some bound vars may appear in the free var set for
-the first qual, these will eventually be removed by the caller. For
-example, if we have @[p | r <- s, q <- r, p <- q]@, when doing
-@[q <- r, p <- q]@, the free var set for @q <- r@ will
-be @{r}@, and the free var set for the entire Quals will be @{r}@. This
-@r@ will be removed only when we finally return from examining all the
-Quals.
-
\begin{code}
-rnQuals :: [RdrNameQual]
- -> RnM_Fixes s (([RenamedQual], -- renamed qualifiers
- [RnName]), -- qualifiers' binders
- FreeVars) -- free variables
-
-rnQuals [qual] -- must be at least one qual
- = rnQual qual `thenRn` \ ((new_qual, bs), fvs) ->
- returnRn (([new_qual], bs), fvs)
-
-rnQuals (qual: quals)
- = rnQual qual `thenRn` \ ((qual', bs1), fvQuals1) ->
- extendSS2 bs1 (rnQuals quals) `thenRn` \ ((quals', bs2), fvQuals2) ->
- returnRn
- ((qual' : quals', bs1 ++ bs2), -- The ones on the right (bs2) shadow the
- -- ones on the left (bs1)
- fvQuals1 `unionUniqSets` fvQuals2)
-
-rnQual (GeneratorQual pat expr)
- = rnExpr expr `thenRn` \ (expr', fvExpr) ->
- let
- binders = collectPatBinders pat
- in
- getSrcLocRn `thenRn` \ src_loc ->
- newLocalNames "variable in list-comprehension-generator pattern"
- (binders `zip` repeat src_loc) `thenRn` \ new_binders ->
- extendSS new_binders (rnPat pat) `thenRn` \ pat' ->
-
- returnRn ((GeneratorQual pat' expr', new_binders), fvExpr)
-
-rnQual (FilterQual expr)
- = rnExpr expr `thenRn` \ (expr', fvs) ->
- returnRn ((FilterQual expr', []), fvs)
-
-rnQual (LetQual binds)
- = rnBinds binds `thenRn` \ (binds', binds_fvs, new_binders) ->
- returnRn ((LetQual binds', new_binders), binds_fvs)
+rnBracket (VarBr n) = do { name <- lookupOccRn n
+ ; this_mod <- getModule
+ ; checkM (nameIsLocalOrFrom this_mod name) $ -- Reason: deprecation checking asumes the
+ do { loadHomeInterface msg name -- home interface is loaded, and this is the
+ ; return () } -- only way that is going to happen
+ ; returnM (VarBr name, unitFV name) }
+ where
+ msg = ptext SLIT("Need interface for Template Haskell quoted Name")
+
+rnBracket (ExpBr e) = do { (e', fvs) <- rnLExpr e
+ ; return (ExpBr e', fvs) }
+rnBracket (PatBr p) = do { (p', fvs) <- rnLPat p
+ ; return (PatBr p', fvs) }
+rnBracket (TypBr t) = do { (t', fvs) <- rnHsTypeFVs doc t
+ ; return (TypBr t', fvs) }
+ where
+ doc = ptext SLIT("In a Template-Haskell quoted type")
+rnBracket (DecBr group)
+ = do { gbl_env <- getGblEnv
+
+ ; let gbl_env1 = gbl_env { tcg_mod = thFAKE }
+ -- Note the thFAKE. The top-level names from the bracketed
+ -- declarations will go into the name cache, and we don't want them to
+ -- confuse the Names for the current module.
+ -- By using a pretend module, thFAKE, we keep them safely out of the way.
+
+ ; names <- getLocalDeclBinders gbl_env1 group
+ ; rdr_env' <- extendRdrEnvRn emptyGlobalRdrEnv names
+ -- Furthermore, the names in the bracket shouldn't conflict with
+ -- existing top-level names E.g.
+ -- foo = 1
+ -- bar = [d| foo = 1|]
+ -- But both 'foo's get a LocalDef provenance, so we'd get a complaint unless
+ -- we start with an emptyGlobalRdrEnv
+
+ ; setGblEnv (gbl_env { tcg_rdr_env = tcg_rdr_env gbl_env1 `plusOccEnv` rdr_env',
+ tcg_dus = emptyDUs }) $ do
+ -- Notice plusOccEnv, not plusGlobalRdrEnv. In this situation we want
+ -- to *shadow* top-level bindings. (See the 'foo' example above.)
+ -- If we don't shadow, we'll get an ambiguity complaint when we do
+ -- a lookupTopBndrRn (which uses lookupGreLocalRn) on the binder of the 'foo'
+ --
+ -- Furthermore, arguably if the splice does define foo, that should hide
+ -- any foo's further out
+ --
+ -- The emptyDUs is so that we just collect uses for this group alone
+
+ { (tcg_env, group') <- rnSrcDecls group
+ -- Discard the tcg_env; it contains only extra info about fixity
+ ; return (DecBr group', allUses (tcg_dus tcg_env)) } }
\end{code}
-
%************************************************************************
%* *
\subsubsection{@Stmt@s: in @do@ expressions}
%************************************************************************
\begin{code}
-rnStmts :: [RdrNameStmt] -> RnM_Fixes s ([RenamedStmt], FreeVars)
-
-rnStmts [stmt@(ExprStmt _ _)] -- last stmt must be ExprStmt
- = rnStmt stmt `thenRn` \ ((stmt',[]), fvStmt) ->
- returnRn ([stmt'], fvStmt)
-
-rnStmts (stmt:stmts)
- = rnStmt stmt `thenRn` \ ((stmt',bs), fvStmt) ->
- extendSS2 bs (rnStmts stmts) `thenRn` \ (stmts', fvStmts) ->
- returnRn (stmt':stmts', fvStmt `unionUniqSets` fvStmts)
-
-
-rnStmt (BindStmt pat expr src_loc)
- = pushSrcLocRn src_loc $
- rnExpr expr `thenRn` \ (expr', fvExpr) ->
+rnStmts :: HsStmtContext Name -> [LStmt RdrName]
+ -> RnM (thing, FreeVars)
+ -> RnM (([LStmt Name], thing), FreeVars)
+
+rnStmts (MDoExpr _) = rnMDoStmts
+rnStmts ctxt = rnNormalStmts ctxt
+
+rnNormalStmts :: HsStmtContext Name -> [LStmt RdrName]
+ -> RnM (thing, FreeVars)
+ -> RnM (([LStmt Name], thing), FreeVars)
+-- Used for cases *other* than recursive mdo
+-- Implements nested scopes
+
+rnNormalStmts ctxt [] thing_inside
+ = do { (thing, fvs) <- thing_inside
+ ; return (([],thing), fvs) }
+
+rnNormalStmts ctxt (L loc stmt : stmts) thing_inside
+ = do { ((stmt', (stmts', thing)), fvs)
+ <- rnStmt ctxt stmt $
+ rnNormalStmts ctxt stmts thing_inside
+ ; return (((L loc stmt' : stmts'), thing), fvs) }
+
+rnStmt :: HsStmtContext Name -> Stmt RdrName
+ -> RnM (thing, FreeVars)
+ -> RnM ((Stmt Name, thing), FreeVars)
+
+rnStmt ctxt (ExprStmt expr _ _) thing_inside
+ = do { (expr', fv_expr) <- rnLExpr expr
+ ; (then_op, fvs1) <- lookupSyntaxName thenMName
+ ; (thing, fvs2) <- thing_inside
+ ; return ((ExprStmt expr' then_op placeHolderType, thing),
+ fv_expr `plusFV` fvs1 `plusFV` fvs2) }
+
+rnStmt ctxt (BindStmt pat expr _ _) thing_inside
+ = do { (expr', fv_expr) <- rnLExpr expr
+ -- The binders do not scope over the expression
+ ; (bind_op, fvs1) <- lookupSyntaxName bindMName
+ ; (fail_op, fvs2) <- lookupSyntaxName failMName
+ ; rnPatsAndThen (StmtCtxt ctxt) [pat] $ \ [pat'] -> do
+ { (thing, fvs3) <- thing_inside
+ ; return ((BindStmt pat' expr' bind_op fail_op, thing),
+ fv_expr `plusFV` fvs1 `plusFV` fvs2 `plusFV` fvs3) }}
+ -- fv_expr shouldn't really be filtered by the rnPatsAndThen
+ -- but it does not matter because the names are unique
+
+rnStmt ctxt (LetStmt binds) thing_inside
+ = do { checkErr (ok ctxt binds)
+ (badIpBinds (ptext SLIT("a parallel list comprehension:")) binds)
+ ; rnLocalBindsAndThen binds $ \ binds' -> do
+ { (thing, fvs) <- thing_inside
+ ; return ((LetStmt binds', thing), fvs) }}
+ where
+ -- We do not allow implicit-parameter bindings in a parallel
+ -- list comprehension. I'm not sure what it might mean.
+ ok (ParStmtCtxt _) (HsIPBinds _) = False
+ ok _ _ = True
+
+rnStmt ctxt (RecStmt rec_stmts _ _ _ _) thing_inside
+ = bindLocatedLocalsRn doc (collectLStmtsBinders rec_stmts) $ \ bndrs ->
+ rn_rec_stmts bndrs rec_stmts `thenM` \ segs ->
+ thing_inside `thenM` \ (thing, fvs) ->
let
- binders = collectPatBinders pat
- in
- newLocalNames "variable in do binding"
- (binders `zip` repeat src_loc) `thenRn` \ new_binders ->
- extendSS new_binders (rnPat pat) `thenRn` \ pat' ->
-
- returnRn ((BindStmt pat' expr' src_loc, new_binders), fvExpr)
-
-rnStmt (ExprStmt expr src_loc)
- =
- rnExpr expr `thenRn` \ (expr', fvs) ->
- returnRn ((ExprStmt expr' src_loc, []), fvs)
-
-rnStmt (LetStmt binds)
- = rnBinds binds `thenRn` \ (binds', binds_fvs, new_binders) ->
- returnRn ((LetStmt binds', new_binders), binds_fvs)
-
+ segs_w_fwd_refs = addFwdRefs segs
+ (ds, us, fs, rec_stmts') = unzip4 segs_w_fwd_refs
+ later_vars = nameSetToList (plusFVs ds `intersectNameSet` fvs)
+ fwd_vars = nameSetToList (plusFVs fs)
+ uses = plusFVs us
+ rec_stmt = RecStmt rec_stmts' later_vars fwd_vars [] emptyLHsBinds
+ in
+ returnM ((rec_stmt, thing), uses `plusFV` fvs)
+ where
+ doc = text "In a recursive do statement"
+
+rnStmt ctxt (ParStmt segs) thing_inside
+ = do { opt_GlasgowExts <- doptM Opt_GlasgowExts
+ ; checkM opt_GlasgowExts parStmtErr
+ ; orig_lcl_env <- getLocalRdrEnv
+ ; ((segs',thing), fvs) <- go orig_lcl_env [] segs
+ ; return ((ParStmt segs', thing), fvs) }
+ where
+-- type ParSeg id = [([LStmt id], [id])]
+-- go :: NameSet -> [ParSeg RdrName]
+-- -> RnM (([ParSeg Name], thing), FreeVars)
+
+ go orig_lcl_env bndrs []
+ = do { let { (bndrs', dups) = removeDups cmpByOcc bndrs
+ ; inner_env = extendLocalRdrEnv orig_lcl_env bndrs' }
+ ; mappM dupErr dups
+ ; (thing, fvs) <- setLocalRdrEnv inner_env thing_inside
+ ; return (([], thing), fvs) }
+
+ go orig_lcl_env bndrs_so_far ((stmts, _) : segs)
+ = do { ((stmts', (bndrs, segs', thing)), fvs)
+ <- rnNormalStmts par_ctxt stmts $ do
+ { -- Find the Names that are bound by stmts
+ lcl_env <- getLocalRdrEnv
+ ; let { rdr_bndrs = collectLStmtsBinders stmts
+ ; bndrs = map ( fromJust
+ . lookupLocalRdrEnv lcl_env
+ . unLoc) rdr_bndrs
+ ; new_bndrs = nub bndrs ++ bndrs_so_far
+ -- The nub is because there might be shadowing
+ -- x <- e1; x <- e2
+ -- So we'll look up (Unqual x) twice, getting
+ -- the second binding both times, which is the
+ } -- one we want
+
+ -- Typecheck the thing inside, passing on all
+ -- the Names bound, but separately; revert the envt
+ ; ((segs', thing), fvs) <- setLocalRdrEnv orig_lcl_env $
+ go orig_lcl_env new_bndrs segs
+
+ -- Figure out which of the bound names are used
+ ; let used_bndrs = filter (`elemNameSet` fvs) bndrs
+ ; return ((used_bndrs, segs', thing), fvs) }
+
+ ; let seg' = (stmts', bndrs)
+ ; return (((seg':segs'), thing),
+ delListFromNameSet fvs bndrs) }
+
+ par_ctxt = ParStmtCtxt ctxt
+
+ cmpByOcc n1 n2 = nameOccName n1 `compare` nameOccName n2
+ dupErr vs = addErr (ptext SLIT("Duplicate binding in parallel list comprehension for:")
+ <+> quotes (ppr (head vs)))
\end{code}
+
%************************************************************************
%* *
-\subsubsection{Precedence Parsing}
+\subsubsection{mdo expressions}
%* *
%************************************************************************
\begin{code}
-precParseExpr :: RenamedHsExpr -> RnM_Fixes s RenamedHsExpr
-precParsePat :: RenamedPat -> RnM_Fixes s RenamedPat
-
-precParseExpr exp@(OpApp (NegApp e1 n) (HsVar op) e2)
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- if 6 < op_prec then
- -- negate precedence 6 wired in
- -- (-x)*y ==> -(x*y)
- precParseExpr (OpApp e1 (HsVar op) e2) `thenRn` \ op_app ->
- returnRn (NegApp op_app n)
- else
- returnRn exp
-
-precParseExpr exp@(OpApp (OpApp e11 (HsVar op1) e12) (HsVar op) e2)
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- lookupFixity op1 `thenRn` \ (op1_fix, op1_prec) ->
- -- pprTrace "precParse:" (ppCat [ppr PprDebug op, ppInt op_prec, ppr PprDebug op1, ppInt op1_prec]) $
- case (op1_prec `cmp` op_prec) of
- LT_ -> rearrange
- EQ_ -> case (op1_fix, op_fix) of
- (INFIXR, INFIXR) -> rearrange
- (INFIXL, INFIXL) -> returnRn exp
- _ -> getSrcLocRn `thenRn` \ src_loc ->
- failButContinueRn exp
- (precParseErr (op1,op1_fix,op1_prec) (op,op_fix,op_prec) src_loc)
- GT__ -> returnRn exp
+type FwdRefs = NameSet
+type Segment stmts = (Defs,
+ Uses, -- May include defs
+ FwdRefs, -- A subset of uses that are
+ -- (a) used before they are bound in this segment, or
+ -- (b) used here, and bound in subsequent segments
+ stmts) -- Either Stmt or [Stmt]
+
+
+----------------------------------------------------
+rnMDoStmts :: [LStmt RdrName]
+ -> RnM (thing, FreeVars)
+ -> RnM (([LStmt Name], thing), FreeVars)
+rnMDoStmts stmts thing_inside
+ = -- Step1: bring all the binders of the mdo into scope
+ -- Remember that this also removes the binders from the
+ -- finally-returned free-vars
+ bindLocatedLocalsRn doc (collectLStmtsBinders stmts) $ \ bndrs ->
+ do {
+ -- Step 2: Rename each individual stmt, making a
+ -- singleton segment. At this stage the FwdRefs field
+ -- isn't finished: it's empty for all except a BindStmt
+ -- for which it's the fwd refs within the bind itself
+ -- (This set may not be empty, because we're in a recursive
+ -- context.)
+ segs <- rn_rec_stmts bndrs stmts
+
+ ; (thing, fvs_later) <- thing_inside
+
+ ; let
+ -- Step 3: Fill in the fwd refs.
+ -- The segments are all singletons, but their fwd-ref
+ -- field mentions all the things used by the segment
+ -- that are bound after their use
+ segs_w_fwd_refs = addFwdRefs segs
+
+ -- Step 4: Group together the segments to make bigger segments
+ -- Invariant: in the result, no segment uses a variable
+ -- bound in a later segment
+ grouped_segs = glomSegments segs_w_fwd_refs
+
+ -- Step 5: Turn the segments into Stmts
+ -- Use RecStmt when and only when there are fwd refs
+ -- Also gather up the uses from the end towards the
+ -- start, so we can tell the RecStmt which things are
+ -- used 'after' the RecStmt
+ (stmts', fvs) = segsToStmts grouped_segs fvs_later
+
+ ; return ((stmts', thing), fvs) }
where
- rearrange = precParseExpr (OpApp e12 (HsVar op) e2) `thenRn` \ e2' ->
- returnRn (OpApp e11 (HsVar op1) e2')
-
-precParseExpr exp = returnRn exp
+ doc = text "In a recursive mdo-expression"
+
+---------------------------------------------
+rn_rec_stmts :: [Name] -> [LStmt RdrName] -> RnM [Segment (LStmt Name)]
+rn_rec_stmts bndrs stmts = mappM (rn_rec_stmt bndrs) stmts `thenM` \ segs_s ->
+ returnM (concat segs_s)
+
+----------------------------------------------------
+rn_rec_stmt :: [Name] -> LStmt RdrName -> RnM [Segment (LStmt Name)]
+ -- Rename a Stmt that is inside a RecStmt (or mdo)
+ -- Assumes all binders are already in scope
+ -- Turns each stmt into a singleton Stmt
+
+rn_rec_stmt all_bndrs (L loc (ExprStmt expr _ _))
+ = rnLExpr expr `thenM` \ (expr', fvs) ->
+ lookupSyntaxName thenMName `thenM` \ (then_op, fvs1) ->
+ returnM [(emptyNameSet, fvs `plusFV` fvs1, emptyNameSet,
+ L loc (ExprStmt expr' then_op placeHolderType))]
+
+rn_rec_stmt all_bndrs (L loc (BindStmt pat expr _ _))
+ = rnLExpr expr `thenM` \ (expr', fv_expr) ->
+ rnLPat pat `thenM` \ (pat', fv_pat) ->
+ lookupSyntaxName bindMName `thenM` \ (bind_op, fvs1) ->
+ lookupSyntaxName failMName `thenM` \ (fail_op, fvs2) ->
+ let
+ bndrs = mkNameSet (collectPatBinders pat')
+ fvs = fv_expr `plusFV` fv_pat `plusFV` fvs1 `plusFV` fvs2
+ in
+ returnM [(bndrs, fvs, bndrs `intersectNameSet` fvs,
+ L loc (BindStmt pat' expr' bind_op fail_op))]
+rn_rec_stmt all_bndrs (L loc (LetStmt binds@(HsIPBinds _)))
+ = do { addErr (badIpBinds (ptext SLIT("an mdo expression")) binds)
+ ; failM }
-precParsePat pat@(ConOpPatIn (NegPatIn e1) op e2)
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- if 6 < op_prec then
- -- negate precedence 6 wired in
- getSrcLocRn `thenRn` \ src_loc ->
- failButContinueRn pat (precParseNegPatErr (op,op_fix,op_prec) src_loc)
- else
- returnRn pat
-
-precParsePat pat@(ConOpPatIn (ConOpPatIn p11 op1 p12) op p2)
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- lookupFixity op1 `thenRn` \ (op1_fix, op1_prec) ->
- case (op1_prec `cmp` op_prec) of
- LT_ -> rearrange
- EQ_ -> case (op1_fix, op_fix) of
- (INFIXR, INFIXR) -> rearrange
- (INFIXL, INFIXL) -> returnRn pat
- _ -> getSrcLocRn `thenRn` \ src_loc ->
- failButContinueRn pat
- (precParseErr (op1,op1_fix,op1_prec) (op,op_fix,op_prec) src_loc)
- GT__ -> returnRn pat
- where
- rearrange = precParsePat (ConOpPatIn p12 op p2) `thenRn` \ p2' ->
- returnRn (ConOpPatIn p11 op1 p2')
+rn_rec_stmt all_bndrs (L loc (LetStmt (HsValBinds binds)))
+ = rnValBinds (trimWith all_bndrs) binds `thenM` \ (binds', du_binds) ->
+ returnM [(duDefs du_binds, duUses du_binds,
+ emptyNameSet, L loc (LetStmt (HsValBinds binds')))]
-precParsePat pat = returnRn pat
+rn_rec_stmt all_bndrs (L loc (RecStmt stmts _ _ _ _)) -- Flatten Rec inside Rec
+ = rn_rec_stmts all_bndrs stmts
+rn_rec_stmt all_bndrs stmt@(L _ (ParStmt _)) -- Syntactically illegal in mdo
+ = pprPanic "rn_rec_stmt" (ppr stmt)
-data INFIX = INFIXL | INFIXR | INFIXN deriving Eq
+---------------------------------------------
+addFwdRefs :: [Segment a] -> [Segment a]
+-- So far the segments only have forward refs *within* the Stmt
+-- (which happens for bind: x <- ...x...)
+-- This function adds the cross-seg fwd ref info
-lookupFixity :: RnName -> RnM_Fixes s (INFIX, Int)
-lookupFixity op
- = getExtraRn `thenRn` \ fixity_fm ->
- -- pprTrace "lookupFixity:" (ppAboves [ppCat [pprUnique u, ppr PprDebug i_f] | (u,i_f) <- ufmToList fixity_fm]) $
- case lookupUFM fixity_fm op of
- Nothing -> returnRn (INFIXL, 9)
- Just (InfixL _ n) -> returnRn (INFIXL, n)
- Just (InfixR _ n) -> returnRn (INFIXR, n)
- Just (InfixN _ n) -> returnRn (INFIXN, n)
+addFwdRefs pairs
+ = fst (foldr mk_seg ([], emptyNameSet) pairs)
+ where
+ mk_seg (defs, uses, fwds, stmts) (segs, later_defs)
+ = (new_seg : segs, all_defs)
+ where
+ new_seg = (defs, uses, new_fwds, stmts)
+ all_defs = later_defs `unionNameSets` defs
+ new_fwds = fwds `unionNameSets` (uses `intersectNameSet` later_defs)
+ -- Add the downstream fwd refs here
+
+----------------------------------------------------
+-- Glomming the singleton segments of an mdo into
+-- minimal recursive groups.
+--
+-- At first I thought this was just strongly connected components, but
+-- there's an important constraint: the order of the stmts must not change.
+--
+-- Consider
+-- mdo { x <- ...y...
+-- p <- z
+-- y <- ...x...
+-- q <- x
+-- z <- y
+-- r <- x }
+--
+-- Here, the first stmt mention 'y', which is bound in the third.
+-- But that means that the innocent second stmt (p <- z) gets caught
+-- up in the recursion. And that in turn means that the binding for
+-- 'z' has to be included... and so on.
+--
+-- Start at the tail { r <- x }
+-- Now add the next one { z <- y ; r <- x }
+-- Now add one more { q <- x ; z <- y ; r <- x }
+-- Now one more... but this time we have to group a bunch into rec
+-- { rec { y <- ...x... ; q <- x ; z <- y } ; r <- x }
+-- Now one more, which we can add on without a rec
+-- { p <- z ;
+-- rec { y <- ...x... ; q <- x ; z <- y } ;
+-- r <- x }
+-- Finally we add the last one; since it mentions y we have to
+-- glom it togeher with the first two groups
+-- { rec { x <- ...y...; p <- z ; y <- ...x... ;
+-- q <- x ; z <- y } ;
+-- r <- x }
+
+glomSegments :: [Segment (LStmt Name)] -> [Segment [LStmt Name]]
+
+glomSegments [] = []
+glomSegments ((defs,uses,fwds,stmt) : segs)
+ -- Actually stmts will always be a singleton
+ = (seg_defs, seg_uses, seg_fwds, seg_stmts) : others
+ where
+ segs' = glomSegments segs
+ (extras, others) = grab uses segs'
+ (ds, us, fs, ss) = unzip4 extras
+
+ seg_defs = plusFVs ds `plusFV` defs
+ seg_uses = plusFVs us `plusFV` uses
+ seg_fwds = plusFVs fs `plusFV` fwds
+ seg_stmts = stmt : concat ss
+
+ grab :: NameSet -- The client
+ -> [Segment a]
+ -> ([Segment a], -- Needed by the 'client'
+ [Segment a]) -- Not needed by the client
+ -- The result is simply a split of the input
+ grab uses dus
+ = (reverse yeses, reverse noes)
+ where
+ (noes, yeses) = span not_needed (reverse dus)
+ not_needed (defs,_,_,_) = not (intersectsNameSet defs uses)
+
+
+----------------------------------------------------
+segsToStmts :: [Segment [LStmt Name]]
+ -> FreeVars -- Free vars used 'later'
+ -> ([LStmt Name], FreeVars)
+
+segsToStmts [] fvs_later = ([], fvs_later)
+segsToStmts ((defs, uses, fwds, ss) : segs) fvs_later
+ = ASSERT( not (null ss) )
+ (new_stmt : later_stmts, later_uses `plusFV` uses)
+ where
+ (later_stmts, later_uses) = segsToStmts segs fvs_later
+ new_stmt | non_rec = head ss
+ | otherwise = L (getLoc (head ss)) $
+ RecStmt ss (nameSetToList used_later) (nameSetToList fwds)
+ [] emptyLHsBinds
+ where
+ non_rec = isSingleton ss && isEmptyNameSet fwds
+ used_later = defs `intersectNameSet` later_uses
+ -- The ones needed after the RecStmt
\end{code}
+%************************************************************************
+%* *
+\subsubsection{Assertion utils}
+%* *
+%************************************************************************
+
\begin{code}
-checkPrecMatch :: Bool -> RnName -> RenamedMatch -> RnM_Fixes s ()
-
-checkPrecMatch False fn match
- = returnRn ()
-checkPrecMatch True op (PatMatch p1 (PatMatch p2 (GRHSMatch _)))
- = checkPrec op p1 False `thenRn_`
- checkPrec op p2 True
-checkPrecMatch True op _
- = panic "checkPrecMatch"
-
-checkPrec op (ConOpPatIn _ op1 _) right
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- lookupFixity op1 `thenRn` \ (op1_fix, op1_prec) ->
- getSrcLocRn `thenRn` \ src_loc ->
+mkAssertErrorExpr :: RnM (HsExpr Name, FreeVars)
+-- Return an expression for (assertError "Foo.hs:27")
+mkAssertErrorExpr
+ = getSrcSpanM `thenM` \ sloc ->
let
- inf_ok = op1_prec > op_prec ||
- (op1_prec == op_prec &&
- (op1_fix == INFIXR && op_fix == INFIXR && right ||
- op1_fix == INFIXL && op_fix == INFIXL && not right))
-
- info = (op,op_fix,op_prec)
- info1 = (op1,op1_fix,op1_prec)
- (infol, infor) = if right then (info, info1) else (info1, info)
+ expr = HsApp (L sloc (HsVar assertErrorName)) (L sloc (HsLit msg))
+ msg = HsStringPrim (mkFastString (showSDoc (ppr sloc)))
in
- addErrIfRn (not inf_ok) (precParseErr infol infor src_loc)
-
-checkPrec op (NegPatIn _) right
- = lookupFixity op `thenRn` \ (op_fix, op_prec) ->
- getSrcLocRn `thenRn` \ src_loc ->
- addErrIfRn (6 < op_prec) (precParseNegPatErr (op,op_fix,op_prec) src_loc)
-
-checkPrec op pat right
- = returnRn ()
+ returnM (expr, emptyFVs)
\end{code}
+%************************************************************************
+%* *
+\subsubsection{Errors}
+%* *
+%************************************************************************
+
\begin{code}
-dupFieldErr str src_loc (dup:rest)
- = addShortErrLocLine src_loc (\ sty ->
- ppBesides [ppStr "duplicate field name `", ppr sty dup, ppStr "' in record ", ppStr str])
-
-negPatErr pat src_loc
- = addShortErrLocLine src_loc (\ sty ->
- ppSep [ppStr "prefix `-' not applied to literal in pattern", ppr sty pat])
-
-precParseNegPatErr op src_loc
- = addErrLoc src_loc "precedence parsing error" (\ sty ->
- ppBesides [ppStr "prefix `-' has lower precedence than ", pp_op sty op, ppStr " in pattern"])
-
-precParseErr op1 op2 src_loc
- = addErrLoc src_loc "precedence parsing error" (\ sty ->
- ppBesides [ppStr "cannot mix ", pp_op sty op1, ppStr " and ", pp_op sty op2,
- ppStr " in the same infix expression"])
-
-pp_op sty (op, fix, prec) = ppBesides [pprSym sty op, ppLparen, pp_fix fix, ppSP, ppInt prec, ppRparen]
-pp_fix INFIXL = ppStr "infixl"
-pp_fix INFIXR = ppStr "infixr"
-pp_fix INFIXN = ppStr "infix"
+patSynErr e = do { addErr (sep [ptext SLIT("Pattern syntax in expression context:"),
+ nest 4 (ppr e)])
+ ; return (EWildPat, emptyFVs) }
+
+parStmtErr = addErr (ptext SLIT("Illegal parallel list comprehension: use -fglasgow-exts"))
+
+badIpBinds what binds
+ = hang (ptext SLIT("Implicit-parameter bindings illegal in") <+> what)
+ 2 (ppr binds)
\end{code}
projects / ghc-hetmet.git / blobdiff