X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Frename%2FRnExpr.lhs;h=bed32e3b1e7717652ea4bc35eb91be6d7b874b5d;hb=d72417969c6112d5d81669757a4863782e7998fb;hp=9e2697fde69865de4c5abe8b1302b32b8b16fae1;hpb=ae45ff0e9831a0dc862a5d68d03e355d7e323c62;p=ghc-hetmet.git diff --git a/ghc/compiler/rename/RnExpr.lhs b/ghc/compiler/rename/RnExpr.lhs index 9e2697f..bed32e3 100644 --- a/ghc/compiler/rename/RnExpr.lhs +++ b/ghc/compiler/rename/RnExpr.lhs @@ -1,39 +1,58 @@ % -% (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 @Qualifier@ 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 + rnMatch, rnGRHSs, rnPat, rnExpr, rnExprs, + rnStmt, rnStmts, checkPrecMatch ) where -IMP_Ubiq() -IMPORT_DELOOPER(RnLoop) -- break the RnPass/RnExpr/RnBinds loops +#include "HsVersions.h" + +import {-# SOURCE #-} RnSource ( rnSrcDecls, rnBinds ) 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 RnTypes ( rnHsTypeFVs, precParseErr, sectionPrecErr ) +import CmdLineOpts ( DynFlag(..), opt_IgnoreAsserts ) +import Literal ( inIntRange, inCharRange ) +import BasicTypes ( Fixity(..), FixityDirection(..), IPName(..), + defaultFixity, negateFixity, compareFixity ) +import PrelNames ( hasKey, assertIdKey, + eqClassName, foldrName, buildName, eqStringName, + cCallableClassName, cReturnableClassName, + enumClassName, ordClassName, + ratioDataConName, splitName, fstName, sndName, + ioDataConName, plusIntegerName, timesIntegerName, + replicatePName, mapPName, filterPName, + crossPName, zipPName, lengthPName, indexPName, toPName, + enumFromToPName, enumFromThenToPName, assertErrorName, + fromIntegerName, fromRationalName, minusName, negateName, + qTyConName, monadNames ) +import TysPrim ( charPrimTyCon, addrPrimTyCon, intPrimTyCon, + floatPrimTyCon, doublePrimTyCon ) +import TysWiredIn ( intTyCon ) +import RdrName ( RdrName ) +import Name ( Name, NamedThing(..), mkSystemName, nameSrcLoc, nameOccName ) +import NameSet +import UnicodeUtil ( stringToUtf8 ) +import UniqFM ( isNullUFM ) +import UniqSet ( emptyUniqSet ) +import List ( intersectBy ) +import ListSetOps ( removeDups ) +import Outputable +import FastString \end{code} @@ -44,65 +63,116 @@ import Util ( Ord3(..), removeDups, panic ) ********************************************************* \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') +rnPat :: RdrNamePat -> RnM (RenamedPat, FreeVars) + +rnPat (WildPat _) = returnM (WildPat placeHolderType, emptyFVs) + +rnPat (VarPat name) + = lookupBndrRn name `thenM` \ vname -> + returnM (VarPat vname, emptyFVs) + +rnPat (SigPatIn pat ty) + = doptM Opt_GlasgowExts `thenM` \ glaExts -> + + if glaExts + then rnPat pat `thenM` \ (pat', fvs1) -> + rnHsTypeFVs doc ty `thenM` \ (ty', fvs2) -> + returnM (SigPatIn pat' ty', fvs1 `plusFV` fvs2) + + else addErr (patSigErr ty) `thenM_` + rnPat pat + where + doc = text "In a pattern type-signature" + +rnPat (LitPat s@(HsString _)) + = returnM (LitPat s, unitFV eqStringName) + +rnPat (LitPat lit) + = litFVs lit `thenM` \ fvs -> + returnM (LitPat lit, fvs) + +rnPat (NPatIn lit mb_neg) + = rnOverLit lit `thenM` \ (lit', fvs1) -> + (case mb_neg of + Nothing -> returnM (Nothing, emptyFVs) + Just _ -> lookupSyntaxName negateName `thenM` \ (neg, fvs) -> + returnM (Just neg, fvs) + ) `thenM` \ (mb_neg', fvs2) -> + returnM (NPatIn lit' mb_neg', + fvs1 `plusFV` fvs2 `addOneFV` eqClassName) + -- Needed to find equality on pattern + +rnPat (NPlusKPatIn name lit _) + = rnOverLit lit `thenM` \ (lit', fvs1) -> + lookupBndrRn name `thenM` \ name' -> + lookupSyntaxName minusName `thenM` \ (minus, fvs2) -> + returnM (NPlusKPatIn name' lit' minus, + fvs1 `plusFV` fvs2 `addOneFV` ordClassName) + +rnPat (LazyPat pat) + = rnPat pat `thenM` \ (pat', fvs) -> + returnM (LazyPat pat', fvs) + +rnPat (AsPat name pat) + = rnPat pat `thenM` \ (pat', fvs) -> + lookupBndrRn name `thenM` \ vname -> + returnM (AsPat vname pat', fvs) + +rnPat (ConPatIn con stuff) = rnConPat con stuff + + +rnPat (ParPat pat) + = rnPat pat `thenM` \ (pat', fvs) -> + returnM (ParPat pat', fvs) + +rnPat (ListPat pats _) + = mapFvRn rnPat pats `thenM` \ (patslist, fvs) -> + returnM (ListPat patslist placeHolderType, fvs `addOneFV` listTyCon_name) + +rnPat (PArrPat pats _) + = mapFvRn rnPat pats `thenM` \ (patslist, fvs) -> + returnM (PArrPat patslist placeHolderType, + fvs `plusFV` implicit_fvs `addOneFV` parrTyCon_name) 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') + implicit_fvs = mkFVs [lengthPName, indexPName] + +rnPat (TuplePat pats boxed) + = mapFvRn rnPat pats `thenM` \ (patslist, fvs) -> + returnM (TuplePat patslist boxed, fvs `addOneFV` tycon_name) + where + tycon_name = tupleTyCon_name boxed (length pats) + +rnPat (TypePat name) = + rnHsTypeFVs (text "In a type pattern") name `thenM` \ (name', fvs) -> + returnM (TypePat name', fvs) + +------------------------------ +rnConPat con (PrefixCon pats) + = lookupOccRn con `thenM` \ con' -> + mapFvRn rnPat pats `thenM` \ (pats', fvs) -> + returnM (ConPatIn con' (PrefixCon pats'), fvs `addOneFV` con') + +rnConPat con (RecCon rpats) + = lookupOccRn con `thenM` \ con' -> + rnRpats rpats `thenM` \ (rpats', fvs) -> + returnM (ConPatIn con' (RecCon rpats'), fvs `addOneFV` con') + +rnConPat con (InfixCon pat1 pat2) + = lookupOccRn con `thenM` \ con' -> + rnPat pat1 `thenM` \ (pat1', fvs1) -> + rnPat pat2 `thenM` \ (pat2', fvs2) -> + + getModeRn `thenM` \ mode -> + -- See comments with rnExpr (OpApp ...) + (if isInterfaceMode mode + then returnM (ConPatIn con' (InfixCon pat1' pat2')) + else lookupFixityRn con' `thenM` \ fixity -> + mkConOpPatRn con' fixity pat1' pat2' + ) `thenM` \ pat' -> + returnM (pat', fvs1 `plusFV` fvs2 `addOneFV` con') \end{code} + ************************************************************************ * * \subsection{Match} @@ -110,63 +180,82 @@ rnPat (RecPatIn con rpats) ************************************************************************ \begin{code} -rnMatch :: RdrNameMatch -> RnM_Fixes s (RenamedMatch, FreeVars) - -rnMatch match - = getSrcLocRn `thenRn` \ src_loc -> - newLocalNames "variable in pattern" - (binders `zip` repeat src_loc) `thenRn` \ new_binders -> - extendSS2 new_binders (rnMatch_aux match) - where - binders = collect_binders match - - collect_binders :: RdrNameMatch -> [RdrName] +rnMatch :: HsMatchContext RdrName -> RdrNameMatch -> RnM (RenamedMatch, FreeVars) - collect_binders (GRHSMatch _) = [] - collect_binders (PatMatch pat match) - = collectPatBinders pat ++ collect_binders match +rnMatch ctxt match@(Match pats maybe_rhs_sig grhss) + = addSrcLoc (getMatchLoc match) $ -rnMatch_aux (PatMatch pat match) - = rnPat pat `thenRn` \ pat' -> - rnMatch_aux match `thenRn` \ (match', fvMatch) -> - returnRn (PatMatch pat' match', fvMatch) + -- Bind pattern-bound type variables + let + rhs_sig_tys = case maybe_rhs_sig of + Nothing -> [] + Just ty -> [ty] + pat_sig_tys = collectSigTysFromPats pats + doc_sig = text "In a result type-signature" + doc_pat = pprMatchContext ctxt + in + bindPatSigTyVars (rhs_sig_tys ++ pat_sig_tys) $ + + -- Note that we do a single bindLocalsRn for all the + -- matches together, so that we spot the repeated variable in + -- f x x = 1 + bindLocalsFVRn doc_pat (collectPatsBinders pats) $ \ new_binders -> + + mapFvRn rnPat pats `thenM` \ (pats', pat_fvs) -> + rnGRHSs grhss `thenM` \ (grhss', grhss_fvs) -> + doptM Opt_GlasgowExts `thenM` \ opt_GlasgowExts -> + (case maybe_rhs_sig of + Nothing -> returnM (Nothing, emptyFVs) + Just ty | opt_GlasgowExts -> rnHsTypeFVs doc_sig ty `thenM` \ (ty', ty_fvs) -> + returnM (Just ty', ty_fvs) + | otherwise -> addErr (patSigErr ty) `thenM_` + returnM (Nothing, emptyFVs) + ) `thenM` \ (maybe_rhs_sig', ty_fvs) -> -rnMatch_aux (GRHSMatch grhss_and_binds) - = rnGRHSsAndBinds grhss_and_binds `thenRn` \ (grhss_and_binds', fvs) -> - returnRn (GRHSMatch grhss_and_binds', fvs) + let + binder_set = mkNameSet new_binders + unused_binders = nameSetToList (binder_set `minusNameSet` grhss_fvs) + all_fvs = grhss_fvs `plusFV` pat_fvs `plusFV` ty_fvs + in + warnUnusedMatches unused_binders `thenM_` + + returnM (Match pats' maybe_rhs_sig' grhss', all_fvs) + -- The bindLocals and bindTyVars will remove the bound FVs \end{code} + %************************************************************************ %* * -\subsubsection{Guarded right-hand sides (GRHSsAndBinds)} +\subsubsection{Guarded right-hand sides (GRHSs)} %* * %************************************************************************ \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) +rnGRHSs :: RdrNameGRHSs -> RnM (RenamedGRHSs, FreeVars) + +rnGRHSs (GRHSs grhss binds _) + = rnBinds binds $ \ binds' -> + mapFvRn rnGRHS grhss `thenM` \ (grhss', fvGRHSs) -> + returnM (GRHSs grhss' binds' placeHolderType, fvGRHSs) + +rnGRHS (GRHS guarded locn) + = doptM Opt_GlasgowExts `thenM` \ opt_GlasgowExts -> + addSrcLoc locn $ + (if not (opt_GlasgowExts || is_standard_guard guarded) then + addWarn (nonStdGuardErr guarded) + else + returnM () + ) `thenM_` + + rnStmts guarded `thenM` \ ((_, guarded'), fvs) -> + returnM (GRHS guarded' locn, fvs) 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) + -- Standard Haskell 1.4 guards are just a single boolean + -- expression, rather than a list of qualifiers as in the + -- Glasgow extension + is_standard_guard [ResultStmt _ _] = True + is_standard_guard [ExprStmt _ _ _, ResultStmt _ _] = True + is_standard_guard other = False \end{code} %************************************************************************ @@ -176,160 +265,289 @@ rnGRHSsAndBinds (GRHSsAndBindsIn grhss binds) %************************************************************************ \begin{code} -rnExprs :: [RdrNameHsExpr] -> RnM_Fixes s ([RenamedHsExpr], FreeVars) - -rnExprs [] = returnRn ([], emptyUniqSet) +rnExprs :: [RdrNameHsExpr] -> RnM ([RenamedHsExpr], FreeVars) +rnExprs ls = rnExprs' ls emptyUniqSet + where + rnExprs' [] acc = returnM ([], acc) + rnExprs' (expr:exprs) acc + = rnExpr 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) -rnExprs (expr:exprs) - = rnExpr expr `thenRn` \ (expr', fvExpr) -> - rnExprs exprs `thenRn` \ (exprs', fvExprs) -> - returnRn (expr':exprs', fvExpr `unionUniqSets` 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} -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. - -ToDo: what about RnClassOps ??? -\end{itemize} +Variables. We look up the variable and return the resulting name. \begin{code} -fv_set vname@(RnName n) | isLocallyDefinedName n - = unitUniqSet vname -fv_set _ = emptyUniqSet - - -rnExpr :: RdrNameHsExpr -> RnM_Fixes s (RenamedHsExpr, FreeVars) +rnExpr :: RdrNameHsExpr -> RnM (RenamedHsExpr, FreeVars) rnExpr (HsVar v) - = lookupValue v `thenRn` \ vname -> - returnRn (HsVar vname, fv_set vname) - -rnExpr (HsLit lit) - = returnRn (HsLit lit, emptyUniqSet) + = lookupOccRn v `thenM` \ name -> + if name `hasKey` assertIdKey && not opt_IgnoreAsserts then + -- We expand it to (GHC.Err.assertError location_string) + mkAssertErrorExpr + 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) + = newIPName v `thenM` \ name -> + let + fvs = case name of + Linear _ -> mkFVs [splitName, fstName, sndName] + Dupable _ -> emptyFVs + in + returnM (HsIPVar name, fvs) + +rnExpr (HsLit lit) + = litFVs lit `thenM` \ fvs -> + returnM (HsLit lit, fvs) + +rnExpr (HsOverLit lit) + = rnOverLit lit `thenM` \ (lit', fvs) -> + returnM (HsOverLit lit', fvs) rnExpr (HsLam match) - = rnMatch match `thenRn` \ (match', fvMatch) -> - returnRn (HsLam match', fvMatch) + = rnMatch LambdaExpr match `thenM` \ (match', fvMatch) -> + returnM (HsLam match', fvMatch) 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) + = rnExpr fun `thenM` \ (fun',fvFun) -> + rnExpr arg `thenM` \ (arg',fvArg) -> + returnM (HsApp fun' arg', fvFun `plusFV` fvArg) + +rnExpr (OpApp e1 op _ e2) + = rnExpr e1 `thenM` \ (e1', fv_e1) -> + rnExpr e2 `thenM` \ (e2', fv_e2) -> + rnExpr op `thenM` \ (op'@(HsVar op_name), fv_op) -> + + -- Deal with fixity + -- When renaming code synthesised from "deriving" declarations + -- we're in Interface mode, and we should ignore fixity; assume + -- that the deriving code generator got the association correct + -- Don't even look up the fixity when in interface mode + getModeRn `thenM` \ mode -> + (if isInterfaceMode mode + then returnM (OpApp e1' op' defaultFixity e2') + else 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 _) + = rnExpr 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) rnExpr (HsPar e) - = rnExpr e `thenRn` \ (e', fvs_e) -> - returnRn (HsPar e', fvs_e) - -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) - -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) - -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) - -rnExpr (HsSCC label expr) - = rnExpr expr `thenRn` \ (expr', fvs_expr) -> - returnRn (HsSCC label expr', fvs_expr) + = rnExpr e `thenM` \ (e', fvs_e) -> + returnM (HsPar e', fvs_e) + +-- Template Haskell extensions +rnExpr (HsBracket br_body) + = checkGHCI (thErr "bracket") `thenM_` + rnBracket br_body `thenM` \ (body', fvs_e) -> + returnM (HsBracket body', fvs_e `addOneFV` qTyConName) + -- We use the Q tycon as a proxy to haul in all the smart + -- constructors; see the hack in RnIfaces + +rnExpr (HsSplice n e) + = checkGHCI (thErr "splice") `thenM_` + getSrcLocM `thenM` \ loc -> + newLocalsRn [(n,loc)] `thenM` \ [n'] -> + rnExpr e `thenM` \ (e', fvs_e) -> + returnM (HsSplice n' e', fvs_e) + +rnExpr section@(SectionL expr op) + = rnExpr expr `thenM` \ (expr', fvs_expr) -> + rnExpr 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) + = rnExpr op `thenM` \ (op', fvs_op) -> + rnExpr expr `thenM` \ (expr', fvs_expr) -> + checkSectionPrec InfixR section op' expr' `thenM_` + returnM (SectionR op' expr', fvs_op `plusFV` fvs_expr) + +rnExpr (HsCCall fun args may_gc is_casm _) + -- Check out the comment on RnIfaces.getNonWiredDataDecl about ccalls + = rnExprs args `thenM` \ (args', fvs_args) -> + returnM (HsCCall fun args' may_gc is_casm placeHolderType, + fvs_args `plusFV` mkFVs [cCallableClassName, + cReturnableClassName, + ioDataConName]) + +rnExpr (HsSCC lbl expr) + = rnExpr expr `thenM` \ (expr', fvs_expr) -> + returnM (HsSCC lbl expr', fvs_expr) 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)) + = addSrcLoc src_loc $ + rnExpr expr `thenM` \ (new_expr, e_fvs) -> + mapFvRn (rnMatch CaseAlt) ms `thenM` \ (new_ms, ms_fvs) -> + returnM (HsCase new_expr new_ms src_loc, e_fvs `plusFV` ms_fvs) 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) + = rnBinds binds $ \ binds' -> + rnExpr expr `thenM` \ (expr',fvExpr) -> + returnM (HsLet binds' expr', fvExpr) + +rnExpr (HsWith expr binds is_with) + = warnIf is_with withWarning `thenM_` + rnExpr expr `thenM` \ (expr',fvExpr) -> + rnIPBinds binds `thenM` \ (binds',fvBinds) -> + returnM (HsWith expr' binds' is_with, fvExpr `plusFV` fvBinds) + +rnExpr e@(HsDo do_or_lc stmts _ ty src_loc) + = addSrcLoc src_loc $ + rnStmts stmts `thenM` \ ((_, stmts'), fvs) -> + + -- Check the statement list ends in an expression + case last stmts' of { + ResultStmt _ _ -> returnM () ; + _ -> addErr (doStmtListErr e) + } `thenM_` + + -- Generate the rebindable syntax for the monad + (case do_or_lc of + DoExpr -> mapAndUnzipM lookupSyntaxName monadNames + other -> returnM ([], []) + ) `thenM` \ (monad_names', monad_fvs) -> + + returnM (HsDo do_or_lc stmts' monad_names' placeHolderType src_loc, + fvs `plusFV` implicit_fvs `plusFV` plusFVs monad_fvs) + where + implicit_fvs = case do_or_lc of + PArrComp -> mkFVs [replicatePName, mapPName, filterPName, + crossPName, zipPName] + ListComp -> mkFVs [foldrName, buildName] + DoExpr -> emptyFVs + +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 `addOneFV` toPName `addOneFV` parrTyCon_name) + +rnExpr (ExplicitTuple exps boxity) + = rnExprs exps `thenM` \ (exps', fvs) -> + returnM (ExplicitTuple exps' boxity, fvs `addOneFV` tycon_name) + where + tycon_name = tupleTyCon_name boxity (length exps) -rnExpr (RecordCon (HsVar con) rbinds) - = lookupConstr con `thenRn` \ conname -> - rnRbinds "construction" rbinds `thenRn` \ (rbinds', fvRbinds) -> - returnRn (RecordCon (HsVar conname) rbinds', fvRbinds) +rnExpr (RecordCon con_id rbinds) + = lookupOccRn con_id `thenM` \ conname -> + rnRbinds "construction" rbinds `thenM` \ (rbinds', fvRbinds) -> + returnM (RecordCon conname rbinds', fvRbinds `addOneFV` conname) rnExpr (RecordUpd expr rbinds) - = rnExpr expr `thenRn` \ (expr', fvExpr) -> - rnRbinds "update" rbinds `thenRn` \ (rbinds', fvRbinds) -> - returnRn (RecordUpd expr' rbinds', fvExpr `unionUniqSets` fvRbinds) + = rnExpr expr `thenM` \ (expr', fvExpr) -> + rnRbinds "update" rbinds `thenM` \ (rbinds', fvRbinds) -> + returnM (RecordUpd expr' rbinds', fvExpr `plusFV` fvRbinds) rnExpr (ExprWithTySig expr pty) - = rnExpr expr `thenRn` \ (expr', fvExpr) -> - rnPolyType nullTyVarNamesEnv pty `thenRn` \ pty' -> - returnRn (ExprWithTySig expr' pty', fvExpr) + = rnExpr 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 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]) + = addSrcLoc src_loc $ + rnExpr p `thenM` \ (p', fvP) -> + rnExpr b1 `thenM` \ (b1', fvB1) -> + rnExpr b2 `thenM` \ (b2', fvB2) -> + returnM (HsIf p' b1' b2' src_loc, 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 (ArithSeqIn seq) - = rn_seq seq `thenRn` \ (new_seq, fvs) -> - returnRn (ArithSeqIn new_seq, fvs) + = rn_seq seq `thenM` \ (new_seq, fvs) -> + returnM (ArithSeqIn new_seq, fvs `addOneFV` enumClassName) where rn_seq (From expr) - = rnExpr expr `thenRn` \ (expr', fvExpr) -> - returnRn (From expr', fvExpr) + = rnExpr expr `thenM` \ (expr', fvExpr) -> + returnM (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) + = rnExpr expr1 `thenM` \ (expr1', fvExpr1) -> + rnExpr expr2 `thenM` \ (expr2', fvExpr2) -> + returnM (FromThen expr1' expr2', fvExpr1 `plusFV` fvExpr2) rn_seq (FromTo expr1 expr2) - = rnExpr expr1 `thenRn` \ (expr1', fvExpr1) -> - rnExpr expr2 `thenRn` \ (expr2', fvExpr2) -> - returnRn (FromTo expr1' expr2', fvExpr1 `unionUniqSets` fvExpr2) + = rnExpr expr1 `thenM` \ (expr1', fvExpr1) -> + rnExpr expr2 `thenM` \ (expr2', fvExpr2) -> + returnM (FromTo expr1' expr2', fvExpr1 `plusFV` 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]) + = rnExpr expr1 `thenM` \ (expr1', fvExpr1) -> + rnExpr expr2 `thenM` \ (expr2', fvExpr2) -> + rnExpr expr3 `thenM` \ (expr3', fvExpr3) -> + returnM (FromThenTo expr1' expr2' expr3', + plusFVs [fvExpr1, fvExpr2, fvExpr3]) + +rnExpr (PArrSeqIn seq) + = rn_seq seq `thenM` \ (new_seq, fvs) -> + returnM (PArrSeqIn new_seq, + fvs `plusFV` mkFVs [enumFromToPName, enumFromThenToPName]) + where + + -- the parser shouldn't generate these two + -- + rn_seq (From _ ) = panic "RnExpr.rnExpr: Infinite parallel array!" + rn_seq (FromThen _ _) = panic "RnExpr.rnExpr: Infinite parallel array!" + + rn_seq (FromTo expr1 expr2) + = rnExpr expr1 `thenM` \ (expr1', fvExpr1) -> + rnExpr expr2 `thenM` \ (expr2', fvExpr2) -> + returnM (FromTo expr1' expr2', fvExpr1 `plusFV` fvExpr2) + rn_seq (FromThenTo expr1 expr2 expr3) + = rnExpr expr1 `thenM` \ (expr1', fvExpr1) -> + rnExpr expr2 `thenM` \ (expr2', fvExpr2) -> + rnExpr expr3 `thenM` \ (expr3', fvExpr3) -> + returnM (FromThenTo expr1' expr2' expr3', + plusFVs [fvExpr1, fvExpr2, fvExpr3]) +\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. + +\begin{code} +rnExpr e@EWildPat = addErr (patSynErr e) `thenM_` + returnM (EWildPat, emptyFVs) + +rnExpr e@(EAsPat _ _) = addErr (patSynErr e) `thenM_` + returnM (EWildPat, emptyFVs) + +rnExpr e@(ELazyPat _) = addErr (patSynErr e) `thenM_` + returnM (EWildPat, emptyFVs) \end{code} + + %************************************************************************ %* * \subsubsection{@Rbinds@s and @Rpats@s: in record expressions} @@ -338,129 +556,147 @@ rnExpr (ArithSeqIn seq) \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) + = mappM_ field_dup_err dup_fields `thenM_` + mapFvRn rn_rbind rbinds `thenM` \ (rbinds', fvRbind) -> + returnM (rbinds', fvRbind) where - (_, dup_fields) = removeDups cmp [ f | (f,_,_) <- rbinds ] + (_, dup_fields) = removeDups compare [ f | (f,_) <- rbinds ] - field_dup_err dups = getSrcLocRn `thenRn` \ src_loc -> - addErrRn (dupFieldErr str src_loc dups) + field_dup_err dups = addErr (dupFieldErr str dups) - rn_rbind (field, expr, pun) - = lookupField field `thenRn` \ fieldname -> - rnExpr expr `thenRn` \ (expr', fvExpr) -> - returnRn ((fieldname, expr', pun), fvExpr) + rn_rbind (field, expr) + = lookupGlobalOccRn field `thenM` \ fieldname -> + rnExpr expr `thenM` \ (expr', fvExpr) -> + returnM ((fieldname, expr'), fvExpr `addOneFV` fieldname) rnRpats rpats - = mapRn field_dup_err dup_fields `thenRn_` - mapRn rn_rpat rpats + = mappM_ field_dup_err dup_fields `thenM_` + mapFvRn rn_rpat rpats `thenM` \ (rpats', fvs) -> + returnM (rpats', fvs) where - (_, dup_fields) = removeDups cmp [ f | (f,_,_) <- rpats ] + (_, dup_fields) = removeDups compare [ f | (f,_) <- rpats ] - field_dup_err dups = getSrcLocRn `thenRn` \ src_loc -> - addErrRn (dupFieldErr "pattern" src_loc dups) + field_dup_err dups = addErr (dupFieldErr "pattern" dups) - rn_rpat (field, pat, pun) - = lookupField field `thenRn` \ fieldname -> - rnPat pat `thenRn` \ pat' -> - returnRn (fieldname, pat', pun) + rn_rpat (field, pat) + = lookupGlobalOccRn field `thenM` \ fieldname -> + rnPat pat `thenM` \ (pat', fvs) -> + returnM ((fieldname, pat'), fvs `addOneFV` fieldname) \end{code} %************************************************************************ %* * -\subsubsection{@Qualifier@s: in list comprehensions} +\subsubsection{@rnIPBinds@s: in implicit parameter bindings} * %* * %************************************************************************ -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' -> +rnIPBinds [] = returnM ([], emptyFVs) +rnIPBinds ((n, expr) : binds) + = newIPName n `thenM` \ name -> + rnExpr expr `thenM` \ (expr',fvExpr) -> + rnIPBinds binds `thenM` \ (binds',fvBinds) -> + returnM ((name, expr') : binds', fvExpr `plusFV` fvBinds) - returnRn ((GeneratorQual pat' expr', new_binders), fvExpr) +\end{code} -rnQual (FilterQual expr) - = rnExpr expr `thenRn` \ (expr', fvs) -> - returnRn ((FilterQual expr', []), fvs) +%************************************************************************ +%* * + Template Haskell brackets +%* * +%************************************************************************ -rnQual (LetQual binds) - = rnBinds binds `thenRn` \ (binds', binds_fvs, new_binders) -> - returnRn ((LetQual binds', new_binders), binds_fvs) +\begin{code} +rnBracket (ExpBr e) = rnExpr e `thenM` \ (e', fvs) -> + returnM (ExpBr e', fvs) +rnBracket (PatBr p) = rnPat p `thenM` \ (p', fvs) -> + returnM (PatBr p', fvs) +rnBracket (TypBr t) = rnHsTypeFVs doc t `thenM` \ (t', fvs) -> + returnM (TypBr t', fvs) + where + doc = ptext SLIT("In a Template-Haskell quoted type") +rnBracket (DecBr ds) = rnSrcDecls ds `thenM` \ (tcg_env, ds', fvs) -> + -- Discard the tcg_env; it contains the extended global RdrEnv + -- because there is no scope that these decls cover (yet!) + returnM (DecBr ds', fvs) \end{code} - %************************************************************************ %* * \subsubsection{@Stmt@s: in @do@ expressions} %* * %************************************************************************ +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} -rnStmts :: [RdrNameStmt] -> RnM_Fixes s ([RenamedStmt], FreeVars) +rnStmts :: [RdrNameStmt] + -> RnM (([Name], [RenamedStmt]), FreeVars) -rnStmts [stmt@(ExprStmt _ _)] -- last stmt must be ExprStmt - = rnStmt stmt `thenRn` \ ((stmt',[]), fvStmt) -> - returnRn ([stmt'], fvStmt) +rnStmts [] + = returnM (([], []), emptyFVs) 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) -> - let - binders = collectPatBinders pat + = getLocalRdrEnv `thenM` \ name_env -> + rnStmt stmt $ \ stmt' -> + rnStmts stmts `thenM` \ ((binders, stmts'), fvs) -> + returnM ((binders, stmt' : stmts'), fvs) + +rnStmt :: RdrNameStmt + -> (RenamedStmt -> RnM (([Name], a), FreeVars)) + -> RnM (([Name], a), FreeVars) +-- The thing list of names returned is the list returned by the +-- thing_inside, plus the binders of the arguments stmt + +rnStmt (ParStmt stmtss) thing_inside + = mapFvRn rnStmts stmtss `thenM` \ (bndrstmtss, fv_stmtss) -> + let binderss = map fst bndrstmtss + checkBndrs all_bndrs bndrs + = checkErr (null (intersectBy eqOcc all_bndrs bndrs)) err `thenM_` + returnM (bndrs ++ all_bndrs) + eqOcc n1 n2 = nameOccName n1 == nameOccName n2 + err = text "duplicate binding in parallel list comprehension" 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) - + foldlM checkBndrs [] binderss `thenM` \ new_binders -> + bindLocalNamesFV new_binders $ + thing_inside (ParStmtOut bndrstmtss)`thenM` \ ((rest_bndrs, result), fv_rest) -> + returnM ((new_binders ++ rest_bndrs, result), fv_stmtss `plusFV` fv_rest) + +rnStmt (BindStmt pat expr src_loc) thing_inside + = addSrcLoc src_loc $ + rnExpr expr `thenM` \ (expr', fv_expr) -> + bindPatSigTyVars (collectSigTysFromPat pat) $ + bindLocalsFVRn doc (collectPatBinders pat) $ \ new_binders -> + rnPat pat `thenM` \ (pat', fv_pat) -> + thing_inside (BindStmt pat' expr' src_loc) `thenM` \ ((rest_binders, result), fvs) -> + returnM ((new_binders ++ rest_binders, result), + fv_expr `plusFV` fvs `plusFV` fv_pat) + where + doc = text "In a pattern in 'do' binding" + +rnStmt (ExprStmt expr _ src_loc) thing_inside + = addSrcLoc src_loc $ + rnExpr expr `thenM` \ (expr', fv_expr) -> + thing_inside (ExprStmt expr' placeHolderType src_loc) `thenM` \ (result, fvs) -> + returnM (result, fv_expr `plusFV` fvs) + +rnStmt (ResultStmt expr src_loc) thing_inside + = addSrcLoc src_loc $ + rnExpr expr `thenM` \ (expr', fv_expr) -> + thing_inside (ResultStmt expr' src_loc) `thenM` \ (result, fvs) -> + returnM (result, fv_expr `plusFV` fvs) + +rnStmt (LetStmt binds) thing_inside + = rnBinds binds $ \ binds' -> + let new_binders = collectHsBinders binds' in + thing_inside (LetStmt binds') `thenM` \ ((rest_binders, result), fvs) -> + returnM ((new_binders ++ rest_binders, result), fvs ) \end{code} %************************************************************************ @@ -469,137 +705,286 @@ rnStmt (LetStmt binds) %* * %************************************************************************ +@mkOpAppRn@ deals with operator fixities. The argument expressions +are assumed to be already correctly arranged. It needs the fixities +recorded in the OpApp nodes, because fixity info applies to the things +the programmer actually wrote, so you can't find it out from the Name. + +Furthermore, the second argument is guaranteed not to be another +operator application. Why? Because the parser parses all +operator appications left-associatively, EXCEPT negation, which +we need to handle specially. + \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 +mkOpAppRn :: RenamedHsExpr -- Left operand; already rearranged + -> RenamedHsExpr -> Fixity -- Operator and fixity + -> RenamedHsExpr -- Right operand (not an OpApp, but might + -- be a NegApp) + -> RnM RenamedHsExpr + +--------------------------- +-- (e11 `op1` e12) `op2` e2 +mkOpAppRn e1@(OpApp e11 op1 fix1 e12) op2 fix2 e2 + | nofix_error + = addErr (precParseErr (ppr_op op1,fix1) (ppr_op op2,fix2)) `thenM_` + returnM (OpApp e1 op2 fix2 e2) + + | associate_right + = mkOpAppRn e12 op2 fix2 e2 `thenM` \ new_e -> + returnM (OpApp e11 op1 fix1 new_e) + where + (nofix_error, associate_right) = compareFixity fix1 fix2 + +--------------------------- +-- (- neg_arg) `op` e2 +mkOpAppRn e1@(NegApp neg_arg neg_name) op2 fix2 e2 + | nofix_error + = addErr (precParseErr (pp_prefix_minus,negateFixity) (ppr_op op2,fix2)) `thenM_` + returnM (OpApp e1 op2 fix2 e2) + + | associate_right + = mkOpAppRn neg_arg op2 fix2 e2 `thenM` \ new_e -> + returnM (NegApp new_e neg_name) + where + (nofix_error, associate_right) = compareFixity negateFixity fix2 + +--------------------------- +-- e1 `op` - neg_arg +mkOpAppRn e1 op1 fix1 e2@(NegApp neg_arg _) -- NegApp can occur on the right + | not associate_right -- We *want* right association + = addErr (precParseErr (ppr_op op1, fix1) (pp_prefix_minus, negateFixity)) `thenM_` + returnM (OpApp e1 op1 fix1 e2) where - rearrange = precParseExpr (OpApp e12 (HsVar op) e2) `thenRn` \ e2' -> - returnRn (OpApp e11 (HsVar op1) e2') + (_, associate_right) = compareFixity fix1 negateFixity + +--------------------------- +-- Default case +mkOpAppRn e1 op fix e2 -- Default case, no rearrangment + = ASSERT2( right_op_ok fix e2, + ppr e1 $$ text "---" $$ ppr op $$ text "---" $$ ppr fix $$ text "---" $$ ppr e2 + ) + returnM (OpApp e1 op fix e2) + +-- Parser left-associates everything, but +-- derived instances may have correctly-associated things to +-- in the right operarand. So we just check that the right operand is OK +right_op_ok fix1 (OpApp _ _ fix2 _) + = not error_please && associate_right + where + (error_please, associate_right) = compareFixity fix1 fix2 +right_op_ok fix1 other + = True -precParseExpr exp = returnRn exp +-- Parser initially makes negation bind more tightly than any other operator +mkNegAppRn neg_arg neg_name + = +#ifdef DEBUG + getModeRn `thenM` \ mode -> + ASSERT( not_op_app mode neg_arg ) +#endif + returnM (NegApp neg_arg neg_name) + +not_op_app SourceMode (OpApp _ _ _ _) = False +not_op_app mode other = True +\end{code} +\begin{code} +mkConOpPatRn :: Name -> Fixity -> RenamedPat -> RenamedPat + -> RnM RenamedPat -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) +mkConOpPatRn op2 fix2 p1@(ConPatIn op1 (InfixCon p11 p12)) p2 + = lookupFixityRn op1 `thenM` \ fix1 -> + let + (nofix_error, associate_right) = compareFixity fix1 fix2 + in + if nofix_error then + addErr (precParseErr (ppr_op op1,fix1) (ppr_op op2,fix2)) `thenM_` + returnM (ConPatIn op2 (InfixCon p1 p2)) + else + if associate_right then + mkConOpPatRn op2 fix2 p12 p2 `thenM` \ new_p -> + returnM (ConPatIn op1 (InfixCon p11 new_p)) 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') - -precParsePat pat = returnRn pat + returnM (ConPatIn op2 (InfixCon p1 p2)) +mkConOpPatRn op fix p1 p2 -- Default case, no rearrangment + = ASSERT( not_op_pat p2 ) + returnM (ConPatIn op (InfixCon p1 p2)) -data INFIX = INFIXL | INFIXR | INFIXN deriving Eq - -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) +not_op_pat (ConPatIn _ (InfixCon _ _)) = False +not_op_pat other = True \end{code} \begin{code} -checkPrecMatch :: Bool -> RnName -> RenamedMatch -> RnM_Fixes s () +checkPrecMatch :: Bool -> Name -> RenamedMatch -> RnM () 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 -> + = returnM () + +checkPrecMatch True op (Match (p1:p2:_) _ _) + -- True indicates an infix lhs + = getModeRn `thenM` \ mode -> + -- See comments with rnExpr (OpApp ...) + if isInterfaceMode mode + then returnM () + else checkPrec op p1 False `thenM_` + checkPrec op p2 True + +checkPrecMatch True op _ = panic "checkPrecMatch" + +checkPrec op (ConPatIn op1 (InfixCon _ _)) right + = lookupFixityRn op `thenM` \ op_fix@(Fixity op_prec op_dir) -> + lookupFixityRn op1 `thenM` \ op1_fix@(Fixity op1_prec op1_dir) -> 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)) + (op1_dir == InfixR && op_dir == InfixR && right || + op1_dir == InfixL && op_dir == InfixL && not right)) - info = (op,op_fix,op_prec) - info1 = (op1,op1_fix,op1_prec) + info = (ppr_op op, op_fix) + info1 = (ppr_op op1, op1_fix) (infol, infor) = if right then (info, info1) else (info1, info) 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) + checkErr inf_ok (precParseErr infol infor) checkPrec op pat right - = returnRn () + = returnM () + +-- Check precedence of (arg op) or (op arg) respectively +-- If arg is itself an operator application, then either +-- (a) its precedence must be higher than that of op +-- (b) its precedency & associativity must be the same as that of op +checkSectionPrec direction section op arg + = case arg of + OpApp _ op fix _ -> go_for_it (ppr_op op) fix + NegApp _ _ -> go_for_it pp_prefix_minus negateFixity + other -> returnM () + where + HsVar op_name = op + go_for_it pp_arg_op arg_fix@(Fixity arg_prec assoc) + = lookupFixityRn op_name `thenM` \ op_fix@(Fixity op_prec _) -> + checkErr (op_prec < arg_prec + || op_prec == arg_prec && direction == assoc) + (sectionPrecErr (ppr_op op_name, op_fix) + (pp_arg_op, arg_fix) section) +\end{code} + + +%************************************************************************ +%* * +\subsubsection{Literals} +%* * +%************************************************************************ + +When literals occur we have to make sure +that the types and classes they involve +are made available. + +\begin{code} +litFVs (HsChar c) + = checkErr (inCharRange c) (bogusCharError c) `thenM_` + returnM (unitFV charTyCon_name) + +litFVs (HsCharPrim c) = returnM (unitFV (getName charPrimTyCon)) +litFVs (HsString s) = returnM (mkFVs [listTyCon_name, charTyCon_name]) +litFVs (HsStringPrim s) = returnM (unitFV (getName addrPrimTyCon)) +litFVs (HsInt i) = returnM (unitFV (getName intTyCon)) +litFVs (HsIntPrim i) = returnM (unitFV (getName intPrimTyCon)) +litFVs (HsFloatPrim f) = returnM (unitFV (getName floatPrimTyCon)) +litFVs (HsDoublePrim d) = returnM (unitFV (getName doublePrimTyCon)) +litFVs (HsLitLit l bogus_ty) = returnM (unitFV cCallableClassName) +litFVs lit = pprPanic "RnExpr.litFVs" (ppr lit) -- HsInteger and HsRat only appear + -- in post-typechecker translations + +rnOverLit (HsIntegral i _) + = lookupSyntaxName fromIntegerName `thenM` \ (from_integer_name, fvs) -> + if inIntRange i then + returnM (HsIntegral i from_integer_name, fvs) + else let + extra_fvs = mkFVs [plusIntegerName, timesIntegerName] + -- Big integer literals are built, using + and *, + -- out of small integers (DsUtils.mkIntegerLit) + -- [NB: plusInteger, timesInteger aren't rebindable... + -- they are used to construct the argument to fromInteger, + -- which is the rebindable one.] + in + returnM (HsIntegral i from_integer_name, fvs `plusFV` extra_fvs) + +rnOverLit (HsFractional i _) + = lookupSyntaxName fromRationalName `thenM` \ (from_rat_name, fvs) -> + let + extra_fvs = mkFVs [ratioDataConName, plusIntegerName, timesIntegerName] + -- We have to make sure that the Ratio type is imported with + -- its constructor, because literals of type Ratio t are + -- built with that constructor. + -- The Rational type is needed too, but that will come in + -- as part of the type for fromRational. + -- The plus/times integer operations may be needed to construct the numerator + -- and denominator (see DsUtils.mkIntegerLit) + in + returnM (HsFractional i from_rat_name, fvs `plusFV` extra_fvs) +\end{code} + +%************************************************************************ +%* * +\subsubsection{Assertion utils} +%* * +%************************************************************************ + +\begin{code} +mkAssertErrorExpr :: RnM (RenamedHsExpr, FreeVars) +-- Return an expression for (assertError "Foo.hs:27") +mkAssertErrorExpr + = getSrcLocM `thenM` \ sloc -> + let + expr = HsApp (HsVar assertErrorName) (HsLit msg) + msg = HsStringPrim (mkFastString (stringToUtf8 (showSDoc (ppr sloc)))) + in + returnM (expr, unitFV assertErrorName) \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" +ppr_op op = quotes (ppr op) -- Here, op can be a Name or a (Var n), where n is a Name +pp_prefix_minus = ptext SLIT("prefix `-'") + +dupFieldErr str (dup:rest) + = hsep [ptext SLIT("duplicate field name"), + quotes (ppr dup), + ptext SLIT("in record"), text str] + +nonStdGuardErr guard + = hang (ptext + SLIT("accepting non-standard pattern guards (-fglasgow-exts to suppress this message)") + ) 4 (ppr guard) + +patSigErr ty + = (ptext SLIT("Illegal signature in pattern:") <+> ppr ty) + $$ nest 4 (ptext SLIT("Use -fglasgow-exts to permit it")) + +patSynErr e + = sep [ptext SLIT("Pattern syntax in expression context:"), + nest 4 (ppr e)] + +thErr what + = ptext SLIT("Template Haskell") <+> text what <+> + ptext SLIT("illegal in a stage-1 compiler") + +doStmtListErr e + = sep [ptext SLIT("`do' statements must end in expression:"), + nest 4 (ppr e)] + +bogusCharError c + = ptext SLIT("character literal out of range: '\\") <> int c <> char '\'' + +withWarning + = sep [quotes (ptext SLIT("with")), + ptext SLIT("is deprecated, use"), + quotes (ptext SLIT("let")), + ptext SLIT("instead")] \end{code}