X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2Ftypecheck%2FTcDeriv.lhs;h=da42749e842dcc28b84df7e122c26fdaf201c5d0;hb=58fa6794af94c320f2481bec4fba31b18c308d0a;hp=1e178fa59503a0dd4f7ff180a1220e7b9d254ee7;hpb=272807076575eb2d82ed3227be184e61c9e2a58e;p=ghc-hetmet.git diff --git a/ghc/compiler/typecheck/TcDeriv.lhs b/ghc/compiler/typecheck/TcDeriv.lhs index 1e178fa..da42749 100644 --- a/ghc/compiler/typecheck/TcDeriv.lhs +++ b/ghc/compiler/typecheck/TcDeriv.lhs @@ -10,26 +10,24 @@ module TcDeriv ( tcDeriving ) where #include "HsVersions.h" -import HsSyn ( HsBinds(..), MonoBinds(..), TyClDecl(..), - collectMonoBinders ) -import RdrHsSyn ( RdrNameMonoBinds ) -import RnHsSyn ( RenamedHsBinds, RenamedMonoBinds, RenamedTyClDecl, RenamedHsPred ) +import HsSyn import CmdLineOpts ( DynFlag(..) ) +import Generics ( mkTyConGenericBinds ) import TcRnMonad -import TcEnv ( tcExtendTempInstEnv, newDFunName, - InstInfo(..), pprInstInfo, InstBindings(..), +import TcEnv ( newDFunName, + InstInfo(..), InstBindings(..), pprInstInfoDetails, tcLookupTyCon, tcExtendTyVarEnv ) import TcGenDeriv -- Deriv stuff -import InstEnv ( simpleDFunClassTyCon ) -import TcMonoType ( tcHsPred ) +import InstEnv ( simpleDFunClassTyCon, extendInstEnv ) +import TcHsType ( tcHsPred ) import TcSimplify ( tcSimplifyDeriv ) -import RnBinds ( rnMethodBinds, rnTopMonoBinds ) -import RnEnv ( bindLocalsFV ) +import RnBinds ( rnMethodBinds, rnTopBinds ) +import RnEnv ( bindLocalNames ) import TcRnMonad ( thenM, returnM, mapAndUnzipM ) -import HscTypes ( DFunId ) +import HscTypes ( DFunId, FixityEnv ) import BasicTypes ( NewOrData(..) ) import Class ( className, classArity, classKey, classTyVars, classSCTheta, Class ) @@ -37,24 +35,28 @@ import Subst ( mkTyVarSubst, substTheta ) import ErrUtils ( dumpIfSet_dyn ) import MkId ( mkDictFunId ) import DataCon ( dataConOrigArgTys, isNullaryDataCon, isExistentialDataCon ) -import Maybes ( maybeToBool, catMaybes ) -import Name ( Name, getSrcLoc, nameUnique ) -import NameSet +import Maybes ( catMaybes ) import RdrName ( RdrName ) +import Name ( Name, getSrcLoc ) +import NameSet ( NameSet, emptyNameSet, duDefs ) +import Unique ( Unique, getUnique ) -import TyCon ( tyConTyVars, tyConDataCons, tyConArity, - tyConTheta, maybeTyConSingleCon, isDataTyCon, +import TyCon ( tyConTyVars, tyConDataCons, tyConArity, tyConHasGenerics, + tyConTheta, isProductTyCon, isDataTyCon, isEnumerationTyCon, isRecursiveTyCon, TyCon ) -import TcType ( TcType, ThetaType, mkTyVarTys, mkTyConApp, getClassPredTys_maybe, - isUnLiftedType, mkClassPred, tyVarsOfTypes, tcSplitFunTys, - tcEqTypes, tcSplitAppTys, mkAppTys ) -import Var ( TyVar, tyVarKind ) +import TcType ( TcType, ThetaType, mkTyVarTy, mkTyVarTys, mkTyConApp, + getClassPredTys_maybe, tcTyConAppTyCon, + isUnLiftedType, mkClassPred, tyVarsOfTypes, tcSplitFunTys, isTypeKind, + tcEqTypes, tcSplitAppTys, mkAppTys, tcSplitDFunTy ) +import Var ( TyVar, tyVarKind, idType, varName ) import VarSet ( mkVarSet, subVarSet ) import PrelNames +import SrcLoc ( srcLocSpan, Located(..) ) import Util ( zipWithEqual, sortLt, notNull ) import ListSetOps ( removeDups, assoc ) import Outputable +import Bag \end{code} %************************************************************************ @@ -191,89 +193,79 @@ version. So now all classes are "offending". %************************************************************************ \begin{code} -tcDeriving :: [RenamedTyClDecl] -- All type constructors - -> TcM ([InstInfo], -- The generated "instance decls". - RenamedHsBinds, -- Extra generated bindings - FreeVars) -- These are free in the generated bindings +tcDeriving :: [LTyClDecl Name] -- All type constructors + -> TcM ([InstInfo], -- The generated "instance decls" + [HsBindGroup Name], -- Extra generated top-level bindings + NameSet) -- Binders to keep alive tcDeriving tycl_decls - = recoverM (returnM ([], EmptyBinds, emptyFVs)) $ - getDOpts `thenM` \ dflags -> - - -- Fish the "deriving"-related information out of the TcEnv - -- and make the necessary "equations". - makeDerivEqns tycl_decls `thenM` \ (ordinary_eqns, newtype_inst_info) -> - tcExtendTempInstEnv (map iDFunId newtype_inst_info) $ - -- Add the newtype-derived instances to the inst env - -- before tacking the "ordinary" ones - - deriveOrdinaryStuff ordinary_eqns `thenM` \ (ordinary_inst_info, binds, fvs) -> - let - inst_info = newtype_inst_info ++ ordinary_inst_info - in - - ioToTcRn (dumpIfSet_dyn dflags Opt_D_dump_deriv "Derived instances" - (ddump_deriving inst_info binds)) `thenM_` - - returnM (inst_info, binds, fvs) - + = recoverM (returnM ([], [], emptyNameSet)) $ + do { -- Fish the "deriving"-related information out of the TcEnv + -- and make the necessary "equations". + ; (ordinary_eqns, newtype_inst_info) <- makeDerivEqns tycl_decls + + ; (ordinary_inst_info, deriv_binds) + <- extendLocalInstEnv (map iDFunId newtype_inst_info) $ + deriveOrdinaryStuff ordinary_eqns + -- Add the newtype-derived instances to the inst env + -- before tacking the "ordinary" ones + + -- Generate the generic to/from functions from each type declaration + ; gen_binds <- mkGenericBinds tycl_decls + ; let inst_info = newtype_inst_info ++ ordinary_inst_info + + -- Rename these extra bindings, discarding warnings about unused bindings etc + -- Set -fglasgow exts so that we can have type signatures in patterns, + -- which is used in the generic binds + ; (rn_binds, gen_bndrs) + <- discardWarnings $ setOptM Opt_GlasgowExts $ do + { (rn_deriv, _dus1) <- rnTopBinds deriv_binds [] + ; (rn_gen, dus_gen) <- rnTopBinds gen_binds [] + ; return (rn_deriv ++ rn_gen, duDefs dus_gen) } + + + ; dflags <- getDOpts + ; ioToTcRn (dumpIfSet_dyn dflags Opt_D_dump_deriv "Derived instances" + (ddump_deriving inst_info rn_binds)) + + ; returnM (inst_info, rn_binds, gen_bndrs) + } where - ddump_deriving :: [InstInfo] -> RenamedHsBinds -> SDoc + ddump_deriving :: [InstInfo] -> [HsBindGroup Name] -> SDoc ddump_deriving inst_infos extra_binds - = vcat (map ppr_info inst_infos) $$ ppr extra_binds - - ppr_info inst_info = pprInstInfo inst_info $$ - nest 4 (pprInstInfoDetails inst_info) - -- pprInstInfo doesn't print much: only the type + = vcat (map pprInstInfoDetails inst_infos) $$ vcat (map ppr extra_binds) ----------------------------------------- deriveOrdinaryStuff [] -- Short cut - = returnM ([], EmptyBinds, emptyFVs) + = returnM ([], emptyBag) deriveOrdinaryStuff eqns - = -- Take the equation list and solve it, to deliver a list of - -- solutions, a.k.a. the contexts for the instance decls - -- required for the corresponding equations. - solveDerivEqns eqns `thenM` \ new_dfuns -> - - -- Now augment the InstInfos, adding in the rather boring - -- actual-code-to-do-the-methods binds. We may also need to - -- generate extra not-one-inst-decl-specific binds, notably - -- "con2tag" and/or "tag2con" functions. We do these - -- separately. - gen_taggery_Names new_dfuns `thenM` \ nm_alist_etc -> + = do { -- Take the equation list and solve it, to deliver a list of + -- solutions, a.k.a. the contexts for the instance decls + -- required for the corresponding equations. + ; new_dfuns <- solveDerivEqns eqns - let - extra_mbind_list = map gen_tag_n_con_monobind nm_alist_etc - extra_mbinds = foldr AndMonoBinds EmptyMonoBinds extra_mbind_list - mbinders = collectMonoBinders extra_mbinds - in - mappM gen_bind new_dfuns `thenM` \ method_binds_s -> - - traceTc (text "tcDeriv" <+> ppr method_binds_s) `thenM_` - getModule `thenM` \ this_mod -> - initRn (InterfaceMode this_mod) ( - -- Rename to get RenamedBinds. - -- The only tricky bit is that the extra_binds must scope - -- over the method bindings for the instances. - bindLocalsFV (ptext (SLIT("deriving"))) mbinders $ \ _ -> - rnTopMonoBinds extra_mbinds [] `thenM` \ (rn_extra_binds, dus) -> - mapAndUnzipM rn_meths method_binds_s `thenM` \ (rn_method_binds_s, fvs_s) -> - returnM ((rn_method_binds_s, rn_extra_binds), - duUses dus `plusFV` plusFVs fvs_s) - ) `thenM` \ ((rn_method_binds_s, rn_extra_binds), fvs) -> - let - new_inst_infos = zipWith gen_inst_info new_dfuns rn_method_binds_s - in - returnM (new_inst_infos, rn_extra_binds, fvs) + -- Generate the InstInfo for each dfun, + -- plus any auxiliary bindings it needs + ; (inst_infos, aux_binds_s) <- mapAndUnzipM genInst new_dfuns - where - -- Make a Real dfun instead of the dummy one we have so far - gen_inst_info :: DFunId -> RenamedMonoBinds -> InstInfo - gen_inst_info dfun binds - = InstInfo { iDFunId = dfun, iBinds = VanillaInst binds [] } + -- Generate any extra not-one-inst-decl-specific binds, + -- notably "con2tag" and/or "tag2con" functions. + ; extra_binds <- genTaggeryBinds new_dfuns - rn_meths (cls, meths) = rnMethodBinds cls [] meths + -- Done + ; returnM (inst_infos, unionManyBags (extra_binds : aux_binds_s)) + } + +----------------------------------------- +mkGenericBinds tycl_decls + = do { tcs <- mapM tcLookupTyCon + [ tc_name | + L _ (TyData { tcdLName = L _ tc_name }) <- tycl_decls] + -- We are only interested in the data type declarations + ; return (unionManyBags [ mkTyConGenericBinds tc | + tc <- tcs, tyConHasGenerics tc ]) } + -- And then only in the ones whose 'has-generics' flag is on \end{code} @@ -299,7 +291,7 @@ or} has just one data constructor (e.g., tuples). all those. \begin{code} -makeDerivEqns :: [RenamedTyClDecl] +makeDerivEqns :: [LTyClDecl Name] -> TcM ([DerivEqn], -- Ordinary derivings [InstInfo]) -- Special newtype derivings @@ -308,71 +300,78 @@ makeDerivEqns tycl_decls returnM (catMaybes maybe_ordinaries, catMaybes maybe_newtypes) where ------------------------------------------------------------------ - derive_these :: [(NewOrData, Name, RenamedHsPred)] + derive_these :: [(NewOrData, Name, LHsPred Name)] -- Find the (nd, TyCon, Pred) pairs that must be `derived' -- NB: only source-language decls have deriving, no imported ones do derive_these = [ (nd, tycon, pred) - | TyData {tcdND = nd, tcdName = tycon, tcdDerivs = Just preds} <- tycl_decls, + | L _ (TyData { tcdND = nd, tcdLName = L _ tycon, + tcdDerivs = Just (L _ preds) }) <- tycl_decls, pred <- preds ] ------------------------------------------------------------------ - mk_eqn :: (NewOrData, Name, RenamedHsPred) -> TcM (Maybe DerivEqn, Maybe InstInfo) + mk_eqn :: (NewOrData, Name, LHsPred Name) -> TcM (Maybe DerivEqn, Maybe InstInfo) -- We swizzle the tyvars and datacons out of the tycon -- to make the rest of the equation mk_eqn (new_or_data, tycon_name, pred) = tcLookupTyCon tycon_name `thenM` \ tycon -> - addSrcLoc (getSrcLoc tycon) $ + addSrcSpan (srcLocSpan (getSrcLoc tycon)) $ addErrCtxt (derivCtxt Nothing tycon) $ tcExtendTyVarEnv (tyConTyVars tycon) $ -- Deriving preds may (now) mention -- the type variables for the type constructor tcHsPred pred `thenM` \ pred' -> case getClassPredTys_maybe pred' of Nothing -> bale_out (malformedPredErr tycon pred) - Just (clas, tys) -> mk_eqn_help new_or_data tycon clas tys + Just (clas, tys) -> doptM Opt_GlasgowExts `thenM` \ gla_exts -> + mk_eqn_help gla_exts new_or_data tycon clas tys ------------------------------------------------------------------ - mk_eqn_help DataType tycon clas tys - | Just err <- chk_out clas tycon tys + mk_eqn_help gla_exts DataType tycon clas tys + | Just err <- checkSideConditions gla_exts clas tycon tys = bale_out (derivingThingErr clas tys tycon tyvars err) | otherwise = new_dfun_name clas tycon `thenM` \ dfun_name -> returnM (Just (dfun_name, clas, tycon, tyvars, constraints), Nothing) where - tyvars = tyConTyVars tycon - data_cons = tyConDataCons tycon - constraints = extra_constraints ++ - [ mkClassPred clas [arg_ty] - | data_con <- tyConDataCons tycon, - arg_ty <- dataConOrigArgTys data_con, - -- Use the same type variables - -- as the type constructor, - -- hence no need to instantiate - not (isUnLiftedType arg_ty) -- No constraints for unlifted types? - ] - - -- "extra_constraints": see note [Data decl contexts] above + tyvars = tyConTyVars tycon + constraints = extra_constraints ++ ordinary_constraints + -- "extra_constraints": see note [Data decl contexts] above extra_constraints = tyConTheta tycon - mk_eqn_help NewType tycon clas tys - = doptM Opt_GlasgowExts `thenM` \ gla_exts -> - if can_derive_via_isomorphism && (gla_exts || standard_instance) then - -- Go ahead and use the isomorphism + ordinary_constraints + | clas `hasKey` typeableClassKey -- For the Typeable class, the constraints + -- don't involve the constructor ags, only + -- the tycon tyvars + -- e.g. data T a b = ... + -- we want + -- instance (Typeable a, Typable b) + -- => Typeable (T a b) where + = [mkClassPred clas [mkTyVarTy tv] | tv <- tyvars] + | otherwise + = [ mkClassPred clas [arg_ty] + | data_con <- tyConDataCons tycon, + arg_ty <- dataConOrigArgTys data_con, + -- Use the same type variables + -- as the type constructor, + -- hence no need to instantiate + not (isUnLiftedType arg_ty) -- No constraints for unlifted types? + ] + + mk_eqn_help gla_exts NewType tycon clas tys + | can_derive_via_isomorphism && (gla_exts || std_class_via_iso clas) + = -- Go ahead and use the isomorphism traceTc (text "newtype deriving:" <+> ppr tycon <+> ppr rep_tys) `thenM_` new_dfun_name clas tycon `thenM` \ dfun_name -> returnM (Nothing, Just (InstInfo { iDFunId = mk_dfun dfun_name, iBinds = NewTypeDerived rep_tys })) - else - if standard_instance then - mk_eqn_help DataType tycon clas [] -- Go via bale-out route - else - -- Non-standard instance - if gla_exts then - -- Too hard - bale_out cant_derive_err - else - -- Just complain about being a non-std instance - bale_out non_std_err + | std_class gla_exts clas + = mk_eqn_help gla_exts DataType tycon clas tys -- Go via bale-out route + + | otherwise -- Non-standard instance + = bale_out (if gla_exts then + cant_derive_err -- Too hard + else + non_std_err) -- Just complain about being a non-std instance where -- Here is the plan for newtype derivings. We see -- newtype T a1...an = T (t ak...an) deriving (.., C s1 .. sm, ...) @@ -457,18 +456,18 @@ makeDerivEqns tycl_decls ------------------------------------------------------------------- -- Figuring out whether we can only do this newtype-deriving thing - standard_instance = null tys && classKey clas `elem` derivableClassKeys right_arity = length tys + 1 == classArity clas + -- Never derive Read,Show,Typeable,Data this way + non_iso_classes = [readClassKey, showClassKey, typeableClassKey, dataClassKey] can_derive_via_isomorphism - = not (clas `hasKey` readClassKey) -- Never derive Read,Show this way - && not (clas `hasKey` showClassKey) + = not (getUnique clas `elem` non_iso_classes) && right_arity -- Well kinded; -- eg not: newtype T ... deriving( ST ) -- because ST needs *2* type params - && n_tyvars_to_keep >= 0 -- Well kinded; + && n_tyvars_to_keep >= 0 -- Type constructor has right kind: -- eg not: newtype T = T Int deriving( Monad ) - && n_args_to_keep >= 0 -- Well kinded: + && n_args_to_keep >= 0 -- Rep type has right kind: -- eg not: newtype T a = T Int deriving( Monad ) && eta_ok -- Eta reduction works && not (isRecursiveTyCon tycon) -- Does not work for recursive tycons: @@ -476,6 +475,11 @@ makeDerivEqns tycl_decls -- Don't want -- instance Eq [A] => Eq A !! + -- Here's a recursive newtype that's actually OK + -- newtype S1 = S1 [T1 ()] + -- newtype T1 a = T1 (StateT S1 IO a ) deriving( Monad ) + -- It's currently rejected. Oh well. + -- Check that eta reduction is OK -- (a) the dropped-off args are identical -- (b) the remaining type args mention @@ -485,16 +489,19 @@ makeDerivEqns tycl_decls cant_derive_err = derivingThingErr clas tys tycon tyvars_to_keep (vcat [ptext SLIT("even with cunning newtype deriving:"), - if right_arity then empty else - quotes (ppr (mkClassPred clas tys)) <+> ptext SLIT("does not have arity 1"), - if n_tyvars_to_keep >= 0 && n_args_to_keep >= 0 then empty else - ptext SLIT("the type constructor has wrong kind"), - if n_args_to_keep >= 0 then empty else - ptext SLIT("representation type has wrong kind"), - if eta_ok then empty else - ptext SLIT("the eta-reduction property does not hold"), - if not (isRecursiveTyCon tycon) then empty else + if isRecursiveTyCon tycon then ptext SLIT("the newtype is recursive") + else empty, + if not right_arity then + quotes (ppr (mkClassPred clas tys)) <+> ptext SLIT("does not have arity 1") + else empty, + if not (n_tyvars_to_keep >= 0) then + ptext SLIT("the type constructor has wrong kind") + else if not (n_args_to_keep >= 0) then + ptext SLIT("the representation type has wrong kind") + else if not eta_ok then + ptext SLIT("the eta-reduction property does not hold") + else empty ]) non_std_err = derivingThingErr clas tys tycon tyvars_to_keep @@ -503,37 +510,106 @@ makeDerivEqns tycl_decls bale_out err = addErrTc err `thenM_` returnM (Nothing, Nothing) - ------------------------------------------------------------------ - chk_out :: Class -> TyCon -> [TcType] -> Maybe SDoc - chk_out clas tycon tys - | notNull tys = Just ty_args_why - | not (getUnique clas `elem` derivableClassKeys) = Just (non_std_why clas) - | clas `hasKey` enumClassKey && not is_enumeration = Just nullary_why - | clas `hasKey` boundedClassKey && not is_enumeration_or_single = Just single_nullary_why - | clas `hasKey` ixClassKey && not is_enumeration_or_single = Just single_nullary_why - | null data_cons = Just no_cons_why - | any isExistentialDataCon data_cons = Just existential_why - | otherwise = Nothing - where - data_cons = tyConDataCons tycon - is_enumeration = isEnumerationTyCon tycon - is_single_con = maybeToBool (maybeTyConSingleCon tycon) - is_enumeration_or_single = is_enumeration || is_single_con - - single_nullary_why = ptext SLIT("one constructor data type or type with all nullary constructors expected") - nullary_why = quotes (ppr tycon) <+> ptext SLIT("has non-nullary constructors") - no_cons_why = quotes (ppr tycon) <+> ptext SLIT("has no data constructors") - ty_args_why = quotes (ppr pred) <+> ptext SLIT("is not a class") - existential_why = quotes (ppr tycon) <+> ptext SLIT("has existentially-quantified constructor(s)") - - pred = mkClassPred clas tys +std_class gla_exts clas + = key `elem` derivableClassKeys + || (gla_exts && (key == typeableClassKey || key == dataClassKey)) + where + key = classKey clas + +std_class_via_iso clas -- These standard classes can be derived for a newtype + -- using the isomorphism trick *even if no -fglasgow-exts* + = classKey clas `elem` [eqClassKey, ordClassKey, ixClassKey, boundedClassKey] + -- Not Read/Show because they respect the type + -- Not Enum, becuase newtypes are never in Enum -non_std_why clas = quotes (ppr clas) <+> ptext SLIT("is not a derivable class") new_dfun_name clas tycon -- Just a simple wrapper = newDFunName clas [mkTyConApp tycon []] (getSrcLoc tycon) -- The type passed to newDFunName is only used to generate -- a suitable string; hence the empty type arg list + +------------------------------------------------------------------ +-- Check side conditions that dis-allow derivability for particular classes +-- This is *apart* from the newtype-deriving mechanism + +checkSideConditions :: Bool -> Class -> TyCon -> [TcType] -> Maybe SDoc +checkSideConditions gla_exts clas tycon tys + | notNull tys + = Just ty_args_why -- e.g. deriving( Foo s ) + | otherwise + = case [cond | (key,cond) <- sideConditions, key == getUnique clas] of + [] -> Just (non_std_why clas) + [cond] -> cond (gla_exts, tycon) + other -> pprPanic "checkSideConditions" (ppr clas) + where + ty_args_why = quotes (ppr (mkClassPred clas tys)) <+> ptext SLIT("is not a class") + +non_std_why clas = quotes (ppr clas) <+> ptext SLIT("is not a derivable class") + +sideConditions :: [(Unique, Condition)] +sideConditions + = [ (eqClassKey, cond_std), + (ordClassKey, cond_std), + (readClassKey, cond_std), + (showClassKey, cond_std), + (enumClassKey, cond_std `andCond` cond_isEnumeration), + (ixClassKey, cond_std `andCond` (cond_isEnumeration `orCond` cond_isProduct)), + (boundedClassKey, cond_std `andCond` (cond_isEnumeration `orCond` cond_isProduct)), + (typeableClassKey, cond_glaExts `andCond` cond_allTypeKind), + (dataClassKey, cond_glaExts `andCond` cond_std) + ] + +type Condition = (Bool, TyCon) -> Maybe SDoc -- Nothing => OK + +orCond :: Condition -> Condition -> Condition +orCond c1 c2 tc + = case c1 tc of + Nothing -> Nothing -- c1 succeeds + Just x -> case c2 tc of -- c1 fails + Nothing -> Nothing + Just y -> Just (x $$ ptext SLIT(" and") $$ y) + -- Both fail + +andCond c1 c2 tc = case c1 tc of + Nothing -> c2 tc -- c1 succeeds + Just x -> Just x -- c1 fails + +cond_std :: Condition +cond_std (gla_exts, tycon) + | any isExistentialDataCon data_cons = Just existential_why + | null data_cons = Just no_cons_why + | otherwise = Nothing + where + data_cons = tyConDataCons tycon + no_cons_why = quotes (ppr tycon) <+> ptext SLIT("has no data constructors") + existential_why = quotes (ppr tycon) <+> ptext SLIT("has existentially-quantified constructor(s)") + +cond_isEnumeration :: Condition +cond_isEnumeration (gla_exts, tycon) + | isEnumerationTyCon tycon = Nothing + | otherwise = Just why + where + why = quotes (ppr tycon) <+> ptext SLIT("has non-nullary constructors") + +cond_isProduct :: Condition +cond_isProduct (gla_exts, tycon) + | isProductTyCon tycon = Nothing + | otherwise = Just why + where + why = quotes (ppr tycon) <+> ptext SLIT("has more than one constructor") + +cond_allTypeKind :: Condition +cond_allTypeKind (gla_exts, tycon) + | all (isTypeKind . tyVarKind) (tyConTyVars tycon) = Nothing + | otherwise = Just why + where + why = quotes (ppr tycon) <+> ptext SLIT("is parameterised over arguments of kind other than `*'") + +cond_glaExts :: Condition +cond_glaExts (gla_exts, tycon) | gla_exts = Nothing + | otherwise = Just why + where + why = ptext SLIT("You need -fglasgow-exts to derive an instance for this class") \end{code} %************************************************************************ @@ -589,7 +665,7 @@ solveDerivEqns orig_eqns checkNoErrs ( -- Extend the inst info from the explicit instance decls -- with the current set of solutions, and simplify each RHS - tcExtendTempInstEnv dfuns $ + extendLocalInstEnv dfuns $ mappM gen_soln orig_eqns ) `thenM` \ new_solns -> if (current_solns == new_solns) then @@ -600,7 +676,7 @@ solveDerivEqns orig_eqns ------------------------------------------------------------------ gen_soln (_, clas, tc,tyvars,deriv_rhs) - = addSrcLoc (getSrcLoc tc) $ + = addSrcSpan (srcLocSpan (getSrcLoc tc)) $ addErrCtxt (derivCtxt (Just clas) tc) $ tcSimplifyDeriv tyvars deriv_rhs `thenM` \ theta -> returnM (sortLt (<) theta) -- Canonicalise before returning the soluction @@ -608,6 +684,15 @@ solveDerivEqns orig_eqns mk_deriv_dfun (dfun_name, clas, tycon, tyvars, _) theta = mkDictFunId dfun_name tyvars theta clas [mkTyConApp tycon (mkTyVarTys tyvars)] + +extendLocalInstEnv :: [DFunId] -> TcM a -> TcM a +-- Add new locall-defined instances; don't bother to check +-- for functional dependency errors -- that'll happen in TcInstDcls +extendLocalInstEnv dfuns thing_inside + = do { env <- getGblEnv + ; let inst_env' = foldl extendInstEnv (tcg_inst_env env) dfuns + env' = env { tcg_inst_env = inst_env' } + ; setGblEnv env' thing_inside } \end{code} %************************************************************************ @@ -665,37 +750,51 @@ Much less often (really just for deriving @Ix@), we use a \item We use the renamer!!! Reason: we're supposed to be -producing @RenamedMonoBinds@ for the methods, but that means +producing @LHsBinds Name@ for the methods, but that means producing correctly-uniquified code on the fly. This is entirely possible (the @TcM@ monad has a @UniqueSupply@), but it is painful. -So, instead, we produce @RdrNameMonoBinds@ then heave 'em through +So, instead, we produce @MonoBinds RdrName@ then heave 'em through the renamer. What a great hack! \end{itemize} \begin{code} --- Generate the method bindings for the required instance --- (paired with class name, as we need that when renaming --- the method binds) -gen_bind :: DFunId -> TcM (Name, RdrNameMonoBinds) -gen_bind dfun +-- Generate the InstInfo for the required instance, +-- plus any auxiliary bindings required +genInst :: DFunId -> TcM (InstInfo, LHsBinds RdrName) +genInst dfun = getFixityEnv `thenM` \ fix_env -> - returnM (cls_nm, gen_binds_fn fix_env cls_nm tycon) - where - cls_nm = className clas - (clas, tycon) = simpleDFunClassTyCon dfun - -gen_binds_fn fix_env cls_nm - = assoc "gen_bind:bad derived class" - gen_list (nameUnique cls_nm) - where - gen_list = [(eqClassKey, gen_Eq_binds) - ,(ordClassKey, gen_Ord_binds) - ,(enumClassKey, gen_Enum_binds) - ,(boundedClassKey, gen_Bounded_binds) - ,(ixClassKey, gen_Ix_binds) - ,(showClassKey, gen_Show_binds fix_env) - ,(readClassKey, gen_Read_binds fix_env) - ] + let + (tyvars,_,clas,[ty]) = tcSplitDFunTy (idType dfun) + clas_nm = className clas + tycon = tcTyConAppTyCon ty + (meth_binds, aux_binds) = assoc "gen_bind:bad derived class" + gen_list (getUnique clas) fix_env tycon + in + -- Bring the right type variables into + -- scope, and rename the method binds + bindLocalNames (map varName tyvars) $ + rnMethodBinds clas_nm [] meth_binds `thenM` \ (rn_meth_binds, _fvs) -> + + -- Build the InstInfo + returnM (InstInfo { iDFunId = dfun, iBinds = VanillaInst rn_meth_binds [] }, + aux_binds) + +gen_list :: [(Unique, FixityEnv -> TyCon -> (LHsBinds RdrName, LHsBinds RdrName))] +gen_list = [(eqClassKey, no_aux_binds (ignore_fix_env gen_Eq_binds)) + ,(ordClassKey, no_aux_binds (ignore_fix_env gen_Ord_binds)) + ,(enumClassKey, no_aux_binds (ignore_fix_env gen_Enum_binds)) + ,(boundedClassKey, no_aux_binds (ignore_fix_env gen_Bounded_binds)) + ,(ixClassKey, no_aux_binds (ignore_fix_env gen_Ix_binds)) + ,(typeableClassKey,no_aux_binds (ignore_fix_env gen_Typeable_binds)) + ,(showClassKey, no_aux_binds gen_Show_binds) + ,(readClassKey, no_aux_binds gen_Read_binds) + ,(dataClassKey, gen_Data_binds) + ] + + -- no_aux_binds is used for generators that don't + -- need to produce any auxiliary bindings +no_aux_binds f fix_env tc = (f fix_env tc, emptyBag) +ignore_fix_env f fix_env tc = f tc \end{code} @@ -732,14 +831,11 @@ We're deriving @Enum@, or @Ix@ (enum type only???) If we have a @tag2con@ function, we also generate a @maxtag@ constant. \begin{code} -gen_taggery_Names :: [DFunId] - -> TcM [(RdrName, -- for an assoc list - TyCon, -- related tycon - TagThingWanted)] - -gen_taggery_Names dfuns - = foldlM do_con2tag [] tycons_of_interest `thenM` \ names_so_far -> - foldlM do_tag2con names_so_far tycons_of_interest +genTaggeryBinds :: [DFunId] -> TcM (LHsBinds RdrName) +genTaggeryBinds dfuns + = do { names_so_far <- foldlM do_con2tag [] tycons_of_interest + ; nm_alist_etc <- foldlM do_tag2con names_so_far tycons_of_interest + ; return (listToBag (map gen_tag_n_con_monobind nm_alist_etc)) } where all_CTs = map simpleDFunClassTyCon dfuns all_tycons = map snd all_CTs @@ -750,7 +846,7 @@ gen_taggery_Names dfuns ((we_are_deriving eqClassKey tycon && any isNullaryDataCon (tyConDataCons tycon)) || (we_are_deriving ordClassKey tycon - && not (maybeToBool (maybeTyConSingleCon tycon))) + && not (isProductTyCon tycon)) || (we_are_deriving enumClassKey tycon) || (we_are_deriving ixClassKey tycon))