2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[TcInstDecls]{Typechecking instance declarations}
7 module TcInstDcls ( tcInstDecls1, tcInstDecls2 ) where
9 #include "HsVersions.h"
12 import TcBinds ( mkPragFun, tcPrags, badBootDeclErr )
13 import TcTyClsDecls ( tcIdxTyInstDecl )
14 import TcClassDcl ( tcMethodBind, mkMethodBind, badMethodErr, badATErr,
15 omittedATWarn, tcClassDecl2, getGenericInstances )
17 import TcMType ( tcSkolSigType, checkValidInstance,
19 import TcType ( TcType, mkClassPred, tcSplitSigmaTy,
20 tcSplitDFunHead, SkolemInfo(InstSkol),
22 tcSplitDFunTy, mkFunTy )
23 import Inst ( newDictBndr, newDictBndrs, instToId, showLIE,
24 getOverlapFlag, tcExtendLocalInstEnv )
25 import InstEnv ( mkLocalInstance, instanceDFunId )
26 import FamInst ( tcExtendLocalFamInstEnv )
27 import FamInstEnv ( extractFamInsts )
28 import TcDeriv ( tcDeriving )
29 import TcEnv ( InstInfo(..), InstBindings(..),
30 newDFunName, tcExtendIdEnv, tcExtendGlobalEnv
32 import TcHsType ( kcHsSigType, tcHsKindedType )
33 import TcUnify ( checkSigTyVars )
34 import TcSimplify ( tcSimplifySuperClasses )
35 import Type ( zipOpenTvSubst, substTheta, mkTyConApp, mkTyVarTy,
36 TyThing(ATyCon), isTyVarTy, tcEqType,
37 substTys, emptyTvSubst, extendTvSubst )
38 import Coercion ( mkSymCoercion )
39 import TyCon ( TyCon, tyConName, newTyConCo_maybe, tyConTyVars,
40 isTyConAssoc, tyConFamInst_maybe, tyConDataCons,
41 assocTyConArgPoss_maybe )
42 import DataCon ( classDataCon, dataConInstArgTys )
43 import Class ( Class, classTyCon, classBigSig, classATs )
44 import Var ( TyVar, Id, idName, idType, tyVarName )
45 import MkId ( mkDictFunId )
46 import Name ( Name, getSrcLoc, nameOccName )
47 import NameSet ( addListToNameSet, emptyNameSet, minusNameSet,
49 import Maybe ( fromJust, catMaybes )
52 import DynFlags ( DynFlag(Opt_WarnMissingMethods) )
53 import SrcLoc ( srcLocSpan, unLoc, noLoc, Located(..), srcSpanStart,
55 import ListSetOps ( minusList )
56 import Util ( snocView, dropList )
59 import BasicTypes ( Activation( AlwaysActive ), InlineSpec(..) )
60 import HscTypes ( implicitTyThings )
64 Typechecking instance declarations is done in two passes. The first
65 pass, made by @tcInstDecls1@, collects information to be used in the
68 This pre-processed info includes the as-yet-unprocessed bindings
69 inside the instance declaration. These are type-checked in the second
70 pass, when the class-instance envs and GVE contain all the info from
71 all the instance and value decls. Indeed that's the reason we need
72 two passes over the instance decls.
74 Here is the overall algorithm.
75 Assume that we have an instance declaration
77 instance c => k (t tvs) where b
81 $LIE_c$ is the LIE for the context of class $c$
83 $betas_bar$ is the free variables in the class method type, excluding the
86 $LIE_cop$ is the LIE constraining a particular class method
88 $tau_cop$ is the tau type of a class method
90 $LIE_i$ is the LIE for the context of instance $i$
92 $X$ is the instance constructor tycon
94 $gammas_bar$ is the set of type variables of the instance
96 $LIE_iop$ is the LIE for a particular class method instance
98 $tau_iop$ is the tau type for this instance of a class method
100 $alpha$ is the class variable
102 $LIE_cop' = LIE_cop [X gammas_bar / alpha, fresh betas_bar]$
104 $tau_cop' = tau_cop [X gammas_bar / alpha, fresh betas_bar]$
107 ToDo: Update the list above with names actually in the code.
111 First, make the LIEs for the class and instance contexts, which means
112 instantiate $thetaC [X inst_tyvars / alpha ]$, yielding LIElistC' and LIEC',
113 and make LIElistI and LIEI.
115 Then process each method in turn.
117 order the instance methods according to the ordering of the class methods
119 express LIEC' in terms of LIEI, yielding $dbinds_super$ or an error
121 Create final dictionary function from bindings generated already
123 df = lambda inst_tyvars
130 in <op1,op2,...,opn,sd1,...,sdm>
132 Here, Bop1 \ldots Bopn bind the methods op1 \ldots opn,
133 and $dbinds_super$ bind the superclass dictionaries sd1 \ldots sdm.
137 %************************************************************************
139 \subsection{Extracting instance decls}
141 %************************************************************************
143 Gather up the instance declarations from their various sources
146 tcInstDecls1 -- Deal with both source-code and imported instance decls
147 :: [LTyClDecl Name] -- For deriving stuff
148 -> [LInstDecl Name] -- Source code instance decls
149 -> TcM (TcGblEnv, -- The full inst env
150 [InstInfo], -- Source-code instance decls to process;
151 -- contains all dfuns for this module
152 HsValBinds Name) -- Supporting bindings for derived instances
154 tcInstDecls1 tycl_decls inst_decls
156 do { -- Stop if addInstInfos etc discovers any errors
157 -- (they recover, so that we get more than one error each
160 -- (1) Do class instance declarations and instances of indexed
162 ; let { idxty_decls = filter (isIdxTyDecl . unLoc) tycl_decls }
163 ; local_info_tycons <- mappM tcLocalInstDecl1 inst_decls
164 ; idx_tycons <- mappM tcIdxTyInstDeclTL idxty_decls
166 ; let { (local_infos,
167 at_tycons) = unzip local_info_tycons
168 ; local_info = concat local_infos
169 ; at_idx_tycon = concat at_tycons ++ catMaybes idx_tycons
170 ; clas_decls = filter (isClassDecl.unLoc) tycl_decls
171 ; implicit_things = concatMap implicitTyThings at_idx_tycon
174 -- (2) Add the tycons of indexed types and their implicit
175 -- tythings to the global environment
176 ; tcExtendGlobalEnv (at_idx_tycon ++ implicit_things) $ do {
178 -- (3) Instances from generic class declarations
179 ; generic_inst_info <- getGenericInstances clas_decls
181 -- Next, construct the instance environment so far, consisting
183 -- a) local instance decls
184 -- b) generic instances
185 -- c) local family instance decls
186 ; addInsts local_info $ do {
187 ; addInsts generic_inst_info $ do {
188 ; addFamInsts at_idx_tycon $ do {
190 -- (4) Compute instances from "deriving" clauses;
191 -- This stuff computes a context for the derived instance
192 -- decl, so it needs to know about all the instances possible
193 ; (deriv_inst_info, deriv_binds) <- tcDeriving tycl_decls
194 ; addInsts deriv_inst_info $ do {
196 ; gbl_env <- getGblEnv
198 generic_inst_info ++ deriv_inst_info ++ local_info,
202 -- Make sure that toplevel type instance are not for associated types.
203 -- !!!TODO: Need to perform this check for the TyThing of type functions,
205 tcIdxTyInstDeclTL ldecl@(L loc decl) =
206 do { tything <- tcIdxTyInstDecl ldecl
208 when (isAssocFamily tything) $
209 addErr $ assocInClassErr (tcdName decl)
212 isAssocFamily (Just (ATyCon tycon)) =
213 case tyConFamInst_maybe tycon of
214 Nothing -> panic "isAssocFamily: no family?!?"
215 Just (fam, _) -> isTyConAssoc fam
216 isAssocFamily (Just _ ) = panic "isAssocFamily: no tycon?!?"
217 isAssocFamily Nothing = False
219 assocInClassErr name =
220 ptext SLIT("Associated type") <+> quotes (ppr name) <+>
221 ptext SLIT("must be inside a class instance")
223 addInsts :: [InstInfo] -> TcM a -> TcM a
224 addInsts infos thing_inside
225 = tcExtendLocalInstEnv (map iSpec infos) thing_inside
227 addFamInsts :: [TyThing] -> TcM a -> TcM a
228 addFamInsts tycons thing_inside
229 = tcExtendLocalFamInstEnv (extractFamInsts tycons) thing_inside
233 tcLocalInstDecl1 :: LInstDecl Name
234 -> TcM ([InstInfo], [TyThing]) -- [] if there was an error
235 -- A source-file instance declaration
236 -- Type-check all the stuff before the "where"
238 -- We check for respectable instance type, and context
239 tcLocalInstDecl1 decl@(L loc (InstDecl poly_ty binds uprags ats))
240 = -- Prime error recovery, set source location
241 recoverM (returnM ([], [])) $
243 addErrCtxt (instDeclCtxt1 poly_ty) $
245 do { is_boot <- tcIsHsBoot
246 ; checkTc (not is_boot || (isEmptyLHsBinds binds && null uprags))
249 -- Typecheck the instance type itself. We can't use
250 -- tcHsSigType, because it's not a valid user type.
251 ; kinded_ty <- kcHsSigType poly_ty
252 ; poly_ty' <- tcHsKindedType kinded_ty
253 ; let (tyvars, theta, tau) = tcSplitSigmaTy poly_ty'
255 -- Next, process any associated types.
256 ; idx_tycons <- mappM tcIdxTyInstDecl ats
258 -- Now, check the validity of the instance.
259 ; (clas, inst_tys) <- checkValidInstHead tau
260 ; checkValidInstance tyvars theta clas inst_tys
261 ; checkValidAndMissingATs clas (tyvars, inst_tys)
264 -- Finally, construct the Core representation of the instance.
265 -- (This no longer includes the associated types.)
266 ; dfun_name <- newDFunName clas inst_tys (srcSpanStart loc)
267 ; overlap_flag <- getOverlapFlag
268 ; let dfun = mkDictFunId dfun_name tyvars theta clas inst_tys
269 ispec = mkLocalInstance dfun overlap_flag
271 ; return ([InstInfo { iSpec = ispec,
272 iBinds = VanillaInst binds uprags }],
273 catMaybes idx_tycons)
276 -- We pass in the source form and the type checked form of the ATs. We
277 -- really need the source form only to be able to produce more informative
279 checkValidAndMissingATs :: Class
280 -> ([TyVar], [TcType]) -- instance types
281 -> [(LTyClDecl Name, -- source form of AT
282 Maybe TyThing)] -- Core form of AT
284 checkValidAndMissingATs clas inst_tys ats
285 = do { -- Issue a warning for each class AT that is not defined in this
287 ; let classDefATs = listToNameSet . map tyConName . classATs $ clas
288 definedATs = listToNameSet . map (tcdName.unLoc.fst) $ ats
289 omitted = classDefATs `minusNameSet` definedATs
290 ; warn <- doptM Opt_WarnMissingMethods
291 ; mapM_ (warnTc warn . omittedATWarn) (nameSetToList omitted)
293 -- Ensure that all AT indexes that correspond to class parameters
294 -- coincide with the types in the instance head. All remaining
295 -- AT arguments must be variables. Also raise an error for any
296 -- type instances that are not associated with this class.
297 ; mapM_ (checkIndexes clas inst_tys) ats
300 checkIndexes _ _ (hsAT, Nothing) =
301 return () -- skip, we already had an error here
302 checkIndexes clas inst_tys (hsAT, Just (ATyCon tycon)) =
303 -- !!!TODO: check that this does the Right Thing for indexed synonyms, too!
304 checkIndexes' clas inst_tys hsAT
306 snd . fromJust . tyConFamInst_maybe $ tycon)
307 checkIndexes _ _ _ = panic "checkIndexes"
309 checkIndexes' clas (instTvs, instTys) hsAT (atTvs, atTys)
310 = let atName = tcdName . unLoc $ hsAT
312 setSrcSpan (getLoc hsAT) $
313 addErrCtxt (atInstCtxt atName) $
314 case find ((atName ==) . tyConName) (classATs clas) of
315 Nothing -> addErrTc $ badATErr clas atName -- not in this class
317 case assocTyConArgPoss_maybe atDecl of
318 Nothing -> panic "checkIndexes': AT has no args poss?!?"
321 -- The following is tricky! We need to deal with three
322 -- complications: (1) The AT possibly only uses a subset of
323 -- the class parameters as indexes and those it uses may be in
324 -- a different order; (2) the AT may have extra arguments,
325 -- which must be type variables; and (3) variables in AT and
326 -- instance head will be different `Name's even if their
327 -- source lexemes are identical.
329 -- Re (1), `poss' contains a permutation vector to extract the
330 -- class parameters in the right order.
332 -- Re (2), we wrap the (permuted) class parameters in a Maybe
333 -- type and use Nothing for any extra AT arguments. (First
334 -- equation of `checkIndex' below.)
336 -- Re (3), we replace any type variable in the AT parameters
337 -- that has the same source lexeme as some variable in the
338 -- instance types with the instance type variable sharing its
341 let relevantInstTys = map (instTys !!) poss
342 instArgs = map Just relevantInstTys ++
343 repeat Nothing -- extra arguments
344 renaming = substSameTyVar atTvs instTvs
346 zipWithM_ checkIndex (substTys renaming atTys) instArgs
348 checkIndex ty Nothing
349 | isTyVarTy ty = return ()
350 | otherwise = addErrTc $ mustBeVarArgErr ty
351 checkIndex ty (Just instTy)
352 | ty `tcEqType` instTy = return ()
353 | otherwise = addErrTc $ wrongATArgErr ty instTy
355 listToNameSet = addListToNameSet emptyNameSet
357 substSameTyVar [] _ = emptyTvSubst
358 substSameTyVar (tv:tvs) replacingTvs =
359 let replacement = case find (tv `sameLexeme`) replacingTvs of
360 Nothing -> mkTyVarTy tv
361 Just rtv -> mkTyVarTy rtv
363 tv1 `sameLexeme` tv2 =
364 nameOccName (tyVarName tv1) == nameOccName (tyVarName tv2)
366 extendTvSubst (substSameTyVar tvs replacingTvs) tv replacement
370 %************************************************************************
372 \subsection{Type-checking instance declarations, pass 2}
374 %************************************************************************
377 tcInstDecls2 :: [LTyClDecl Name] -> [InstInfo]
378 -> TcM (LHsBinds Id, TcLclEnv)
379 -- (a) From each class declaration,
380 -- generate any default-method bindings
381 -- (b) From each instance decl
382 -- generate the dfun binding
384 tcInstDecls2 tycl_decls inst_decls
385 = do { -- (a) Default methods from class decls
386 (dm_binds_s, dm_ids_s) <- mapAndUnzipM tcClassDecl2 $
387 filter (isClassDecl.unLoc) tycl_decls
388 ; tcExtendIdEnv (concat dm_ids_s) $ do
390 -- (b) instance declarations
391 ; inst_binds_s <- mappM tcInstDecl2 inst_decls
394 ; let binds = unionManyBags dm_binds_s `unionBags`
395 unionManyBags inst_binds_s
396 ; tcl_env <- getLclEnv -- Default method Ids in here
397 ; returnM (binds, tcl_env) }
400 ======= New documentation starts here (Sept 92) ==============
402 The main purpose of @tcInstDecl2@ is to return a @HsBinds@ which defines
403 the dictionary function for this instance declaration. For example
405 instance Foo a => Foo [a] where
409 might generate something like
411 dfun.Foo.List dFoo_a = let op1 x = ...
417 HOWEVER, if the instance decl has no context, then it returns a
418 bigger @HsBinds@ with declarations for each method. For example
420 instance Foo [a] where
426 dfun.Foo.List a = Dict [Foo.op1.List a, Foo.op2.List a]
427 const.Foo.op1.List a x = ...
428 const.Foo.op2.List a y = ...
430 This group may be mutually recursive, because (for example) there may
431 be no method supplied for op2 in which case we'll get
433 const.Foo.op2.List a = default.Foo.op2 (dfun.Foo.List a)
435 that is, the default method applied to the dictionary at this type.
437 What we actually produce in either case is:
439 AbsBinds [a] [dfun_theta_dicts]
440 [(dfun.Foo.List, d)] ++ (maybe) [(const.Foo.op1.List, op1), ...]
441 { d = (sd1,sd2, ..., op1, op2, ...)
446 The "maybe" says that we only ask AbsBinds to make global constant methods
447 if the dfun_theta is empty.
450 For an instance declaration, say,
452 instance (C1 a, C2 b) => C (T a b) where
455 where the {\em immediate} superclasses of C are D1, D2, we build a dictionary
456 function whose type is
458 (C1 a, C2 b, D1 (T a b), D2 (T a b)) => C (T a b)
460 Notice that we pass it the superclass dictionaries at the instance type; this
461 is the ``Mark Jones optimisation''. The stuff before the "=>" here
462 is the @dfun_theta@ below.
464 First comes the easy case of a non-local instance decl.
468 tcInstDecl2 :: InstInfo -> TcM (LHsBinds Id)
469 -- Returns a binding for the dfun
471 ------------------------
472 -- Derived newtype instances; surprisingly tricky!
474 -- In the case of a newtype, things are rather easy
475 -- class Show a => Foo a b where ...
476 -- newtype T a = MkT (Tree [a]) deriving( Foo Int )
477 -- The newtype gives an FC axiom looking like
478 -- axiom CoT a :: T a :=: Tree [a]
479 -- (see Note [Newtype coercions] in TyCon for this unusual form of axiom)
481 -- So all need is to generate a binding looking like:
482 -- dfunFooT :: forall a. (Foo Int (Tree [a], Show (T a)) => Foo Int (T a)
483 -- dfunFooT = /\a. \(ds:Show (T a)) (df:Foo (Tree [a])).
484 -- case df `cast` (Foo Int (sym (CoT a))) of
485 -- Foo _ op1 .. opn -> Foo ds op1 .. opn
487 -- If there are no superclasses, matters are simpler, because we don't need the case
488 -- see Note [Newtype deriving superclasses] in TcDeriv.lhs
490 tcInstDecl2 (InstInfo { iSpec = ispec, iBinds = NewTypeDerived mb_preds })
491 = do { let dfun_id = instanceDFunId ispec
492 rigid_info = InstSkol dfun_id
493 origin = SigOrigin rigid_info
494 inst_ty = idType dfun_id
495 ; (tvs, theta, inst_head_ty) <- tcSkolSigType rigid_info inst_ty
496 -- inst_head_ty is a PredType
498 ; inst_loc <- getInstLoc origin
499 ; (rep_dict_id : sc_dict_ids, wrap_fn, sc_binds)
500 <- make_wrapper inst_loc tvs theta mb_preds
501 -- Here, we are relying on the order of dictionary
502 -- arguments built by NewTypeDerived in TcDeriv;
503 -- namely, that the rep_dict_id comes first
505 ; let (cls, cls_inst_tys) = tcSplitDFunHead inst_head_ty
506 cls_tycon = classTyCon cls
507 the_coercion = make_coercion cls_tycon cls_inst_tys
508 coerced_rep_dict = mkHsCoerce the_coercion (HsVar rep_dict_id)
510 ; body <- make_body cls_tycon cls_inst_tys sc_dict_ids coerced_rep_dict
512 ; return (sc_binds `snocBag` (noLoc $ VarBind dfun_id $ noLoc $ mkHsCoerce wrap_fn body)) }
515 -----------------------
517 -- We distinguish two cases:
518 -- (a) there is no tyvar abstraction in the dfun, so all dicts are constant,
519 -- and the new dict can just be a constant
520 -- (mb_preds = Just preds)
521 -- (b) there are tyvars, so we must make a dict *fun*
522 -- (mb_preds = Nothing)
523 -- See the defn of NewTypeDerived for the meaning of mb_preds
524 make_wrapper inst_loc tvs theta (Just preds) -- Case (a)
525 = ASSERT( null tvs && null theta )
526 do { dicts <- newDictBndrs inst_loc preds
527 ; sc_binds <- addErrCtxt superClassCtxt (tcSimplifySuperClasses [] [] dicts)
528 -- Use tcSimplifySuperClasses to avoid creating loops, for the
529 -- same reason as Note [SUPERCLASS-LOOP 1] in TcSimplify
530 ; return (map instToId dicts, idCoercion, sc_binds) }
532 make_wrapper inst_loc tvs theta Nothing -- Case (b)
533 = do { dicts <- newDictBndrs inst_loc theta
534 ; let dict_ids = map instToId dicts
535 ; return (dict_ids, mkCoTyLams tvs <.> mkCoLams dict_ids, emptyBag) }
537 -----------------------
539 -- The inst_head looks like (C s1 .. sm (T a1 .. ak))
540 -- But we want the coercion (C s1 .. sm (sym (CoT a1 .. ak)))
541 -- with kind (C s1 .. sm (T a1 .. ak) :=: C s1 .. sm <rep_ty>)
542 -- where rep_ty is the (eta-reduced) type rep of T
543 -- So we just replace T with CoT, and insert a 'sym'
544 -- NB: we know that k will be >= arity of CoT, because the latter fully eta-reduced
546 make_coercion cls_tycon cls_inst_tys
547 | Just (all_tys_but_last, last_ty) <- snocView cls_inst_tys
548 , (tycon, tc_args) <- tcSplitTyConApp last_ty -- Should not fail
549 , Just co_con <- newTyConCo_maybe tycon
550 , let co = mkSymCoercion (mkTyConApp co_con tc_args)
551 = ExprCoFn (mkTyConApp cls_tycon (all_tys_but_last ++ [co]))
552 | otherwise -- The newtype is transparent; no need for a cast
555 -----------------------
557 -- Two cases; see Note [Newtype deriving superclasses] in TcDeriv.lhs
558 -- (a) no superclasses; then we can just use the coerced dict
559 -- (b) one or more superclasses; then new need to do the unpack/repack
561 make_body cls_tycon cls_inst_tys sc_dict_ids coerced_rep_dict
562 | null sc_dict_ids -- Case (a)
563 = return coerced_rep_dict
564 | otherwise -- Case (b)
565 = do { op_ids <- newSysLocalIds FSLIT("op") op_tys
566 ; dummy_sc_dict_ids <- newSysLocalIds FSLIT("sc") (map idType sc_dict_ids)
567 ; let the_pat = ConPatOut { pat_con = noLoc cls_data_con, pat_tvs = [],
568 pat_dicts = dummy_sc_dict_ids,
569 pat_binds = emptyLHsBinds,
570 pat_args = PrefixCon (map nlVarPat op_ids),
572 the_match = mkSimpleMatch [noLoc the_pat] the_rhs
573 the_rhs = mkHsConApp cls_data_con cls_inst_tys $
574 map HsVar (sc_dict_ids ++ op_ids)
576 -- Warning: this HsCase scrutinises a value with a PredTy, which is
577 -- never otherwise seen in Haskell source code. It'd be
578 -- nicer to generate Core directly!
579 ; return (HsCase (noLoc coerced_rep_dict) $
580 MatchGroup [the_match] (mkFunTy pat_ty pat_ty)) }
582 pat_ty = mkTyConApp cls_tycon cls_inst_tys
583 cls_data_con = head (tyConDataCons cls_tycon)
584 cls_arg_tys = dataConInstArgTys cls_data_con cls_inst_tys
585 op_tys = dropList sc_dict_ids cls_arg_tys
587 ------------------------
588 -- Ordinary instances
590 tcInstDecl2 (InstInfo { iSpec = ispec, iBinds = VanillaInst monobinds uprags })
592 dfun_id = instanceDFunId ispec
593 rigid_info = InstSkol dfun_id
594 inst_ty = idType dfun_id
596 -- Prime error recovery
597 recoverM (returnM emptyLHsBinds) $
598 setSrcSpan (srcLocSpan (getSrcLoc dfun_id)) $
599 addErrCtxt (instDeclCtxt2 (idType dfun_id)) $
601 -- Instantiate the instance decl with skolem constants
602 tcSkolSigType rigid_info inst_ty `thenM` \ (inst_tyvars', dfun_theta', inst_head') ->
603 -- These inst_tyvars' scope over the 'where' part
604 -- Those tyvars are inside the dfun_id's type, which is a bit
605 -- bizarre, but OK so long as you realise it!
607 (clas, inst_tys') = tcSplitDFunHead inst_head'
608 (class_tyvars, sc_theta, _, op_items) = classBigSig clas
610 -- Instantiate the super-class context with inst_tys
611 sc_theta' = substTheta (zipOpenTvSubst class_tyvars inst_tys') sc_theta
612 origin = SigOrigin rigid_info
614 -- Create dictionary Ids from the specified instance contexts.
615 getInstLoc InstScOrigin `thenM` \ sc_loc ->
616 newDictBndrs sc_loc sc_theta' `thenM` \ sc_dicts ->
617 getInstLoc origin `thenM` \ inst_loc ->
618 newDictBndrs inst_loc dfun_theta' `thenM` \ dfun_arg_dicts ->
619 newDictBndr inst_loc (mkClassPred clas inst_tys') `thenM` \ this_dict ->
620 -- Default-method Ids may be mentioned in synthesised RHSs,
621 -- but they'll already be in the environment.
623 -- Typecheck the methods
624 let -- These insts are in scope; quite a few, eh?
625 avail_insts = [this_dict] ++ dfun_arg_dicts ++ sc_dicts
627 tcMethods origin clas inst_tyvars'
628 dfun_theta' inst_tys' avail_insts
629 op_items monobinds uprags `thenM` \ (meth_ids, meth_binds) ->
631 -- Figure out bindings for the superclass context
632 -- Don't include this_dict in the 'givens', else
633 -- sc_dicts get bound by just selecting from this_dict!!
634 addErrCtxt superClassCtxt
635 (tcSimplifySuperClasses inst_tyvars'
637 sc_dicts) `thenM` \ sc_binds ->
639 -- It's possible that the superclass stuff might unified one
640 -- of the inst_tyavars' with something in the envt
641 checkSigTyVars inst_tyvars' `thenM_`
643 -- Deal with 'SPECIALISE instance' pragmas
644 tcPrags dfun_id (filter isSpecInstLSig uprags) `thenM` \ prags ->
646 -- Create the result bindings
648 dict_constr = classDataCon clas
649 scs_and_meths = map instToId sc_dicts ++ meth_ids
650 this_dict_id = instToId this_dict
651 inline_prag | null dfun_arg_dicts = []
652 | otherwise = [InlinePrag (Inline AlwaysActive True)]
653 -- Always inline the dfun; this is an experimental decision
654 -- because it makes a big performance difference sometimes.
655 -- Often it means we can do the method selection, and then
656 -- inline the method as well. Marcin's idea; see comments below.
658 -- BUT: don't inline it if it's a constant dictionary;
659 -- we'll get all the benefit without inlining, and we get
660 -- a **lot** of code duplication if we inline it
662 -- See Note [Inline dfuns] below
665 = mkHsConApp dict_constr inst_tys' (map HsVar scs_and_meths)
666 -- We don't produce a binding for the dict_constr; instead we
667 -- rely on the simplifier to unfold this saturated application
668 -- We do this rather than generate an HsCon directly, because
669 -- it means that the special cases (e.g. dictionary with only one
670 -- member) are dealt with by the common MkId.mkDataConWrapId code rather
671 -- than needing to be repeated here.
673 dict_bind = noLoc (VarBind this_dict_id dict_rhs)
674 all_binds = dict_bind `consBag` (sc_binds `unionBags` meth_binds)
676 main_bind = noLoc $ AbsBinds
678 (map instToId dfun_arg_dicts)
679 [(inst_tyvars', dfun_id, this_dict_id,
680 inline_prag ++ prags)]
683 showLIE (text "instance") `thenM_`
684 returnM (unitBag main_bind)
687 tcMethods origin clas inst_tyvars' dfun_theta' inst_tys'
688 avail_insts op_items monobinds uprags
689 = -- Check that all the method bindings come from this class
691 sel_names = [idName sel_id | (sel_id, _) <- op_items]
692 bad_bndrs = collectHsBindBinders monobinds `minusList` sel_names
694 mappM (addErrTc . badMethodErr clas) bad_bndrs `thenM_`
696 -- Make the method bindings
698 mk_method_bind = mkMethodBind origin clas inst_tys' monobinds
700 mapAndUnzipM mk_method_bind op_items `thenM` \ (meth_insts, meth_infos) ->
702 -- And type check them
703 -- It's really worth making meth_insts available to the tcMethodBind
704 -- Consider instance Monad (ST s) where
705 -- {-# INLINE (>>) #-}
706 -- (>>) = ...(>>=)...
707 -- If we don't include meth_insts, we end up with bindings like this:
708 -- rec { dict = MkD then bind ...
709 -- then = inline_me (... (GHC.Base.>>= dict) ...)
711 -- The trouble is that (a) 'then' and 'dict' are mutually recursive,
712 -- and (b) the inline_me prevents us inlining the >>= selector, which
713 -- would unravel the loop. Result: (>>) ends up as a loop breaker, and
714 -- is not inlined across modules. Rather ironic since this does not
715 -- happen without the INLINE pragma!
717 -- Solution: make meth_insts available, so that 'then' refers directly
718 -- to the local 'bind' rather than going via the dictionary.
720 -- BUT WATCH OUT! If the method type mentions the class variable, then
721 -- this optimisation is not right. Consider
725 -- instance C Int where
727 -- The occurrence of 'op' on the rhs gives rise to a constraint
729 -- The trouble is that the 'meth_inst' for op, which is 'available', also
730 -- looks like 'op at Int'. But they are not the same.
732 prag_fn = mkPragFun uprags
733 all_insts = avail_insts ++ catMaybes meth_insts
734 sig_fn n = Just [] -- No scoped type variables, but every method has
735 -- a type signature, in effect, so that we check
736 -- the method has the right type
737 tc_method_bind = tcMethodBind inst_tyvars' dfun_theta' all_insts sig_fn prag_fn
738 meth_ids = [meth_id | (_,meth_id,_) <- meth_infos]
741 mapM tc_method_bind meth_infos `thenM` \ meth_binds_s ->
743 returnM (meth_ids, unionManyBags meth_binds_s)
747 ------------------------------
748 [Inline dfuns] Inlining dfuns unconditionally
749 ------------------------------
751 The code above unconditionally inlines dict funs. Here's why.
752 Consider this program:
754 test :: Int -> Int -> Bool
755 test x y = (x,y) == (y,x) || test y x
756 -- Recursive to avoid making it inline.
758 This needs the (Eq (Int,Int)) instance. If we inline that dfun
759 the code we end up with is good:
762 \r -> case ==# [ww ww1] of wild {
763 PrelBase.False -> Test.$wtest ww1 ww;
765 case ==# [ww1 ww] of wild1 {
766 PrelBase.False -> Test.$wtest ww1 ww;
767 PrelBase.True -> PrelBase.True [];
770 Test.test = \r [w w1]
773 case w1 of w3 { PrelBase.I# ww1 -> Test.$wtest ww ww1; };
776 If we don't inline the dfun, the code is not nearly as good:
778 (==) = case PrelTup.$fEq(,) PrelBase.$fEqInt PrelBase.$fEqInt of tpl {
779 PrelBase.:DEq tpl1 tpl2 -> tpl2;
784 let { y = PrelBase.I#! [ww1]; } in
785 let { x = PrelBase.I#! [ww]; } in
786 let { sat_slx = PrelTup.(,)! [y x]; } in
787 let { sat_sly = PrelTup.(,)! [x y];
789 case == sat_sly sat_slx of wild {
790 PrelBase.False -> Test.$wtest ww1 ww;
791 PrelBase.True -> PrelBase.True [];
798 case w1 of w3 { PrelBase.I# ww1 -> Test.$wtest ww ww1; };
801 Why doesn't GHC inline $fEq? Because it looks big:
803 PrelTup.zdfEqZ1T{-rcX-}
804 = \ @ a{-reT-} :: * @ b{-reS-} :: *
805 zddEq{-rf6-} _Ks :: {PrelBase.Eq{-23-} a{-reT-}}
806 zddEq1{-rf7-} _Ks :: {PrelBase.Eq{-23-} b{-reS-}} ->
808 zeze{-rf0-} _Kl :: (b{-reS-} -> b{-reS-} -> PrelBase.Bool{-3c-})
809 zeze{-rf0-} = PrelBase.zeze{-01L-}@ b{-reS-} zddEq1{-rf7-} } in
811 zeze1{-rf3-} _Kl :: (a{-reT-} -> a{-reT-} -> PrelBase.Bool{-3c-})
812 zeze1{-rf3-} = PrelBase.zeze{-01L-} @ a{-reT-} zddEq{-rf6-} } in
814 zeze2{-reN-} :: ((a{-reT-}, b{-reS-}) -> (a{-reT-}, b{-reS-})-> PrelBase.Bool{-3c-})
815 zeze2{-reN-} = \ ds{-rf5-} _Ks :: (a{-reT-}, b{-reS-})
816 ds1{-rf4-} _Ks :: (a{-reT-}, b{-reS-}) ->
818 of wild{-reW-} _Kd { (a1{-rf2-} _Ks, a2{-reZ-} _Ks) ->
820 of wild1{-reX-} _Kd { (b1{-rf1-} _Ks, b2{-reY-} _Ks) ->
822 (zeze1{-rf3-} a1{-rf2-} b1{-rf1-})
823 (zeze{-rf0-} a2{-reZ-} b2{-reY-})
827 a1{-reR-} :: ((a{-reT-}, b{-reS-})-> (a{-reT-}, b{-reS-})-> PrelBase.Bool{-3c-})
828 a1{-reR-} = \ a2{-reV-} _Ks :: (a{-reT-}, b{-reS-})
829 b1{-reU-} _Ks :: (a{-reT-}, b{-reS-}) ->
830 PrelBase.not{-r6I-} (zeze2{-reN-} a2{-reV-} b1{-reU-})
832 PrelBase.zdwZCDEq{-r8J-} @ (a{-reT-}, b{-reS-}) a1{-reR-} zeze2{-reN-})
834 and it's not as bad as it seems, because it's further dramatically
835 simplified: only zeze2 is extracted and its body is simplified.
838 %************************************************************************
840 \subsection{Error messages}
842 %************************************************************************
845 instDeclCtxt1 hs_inst_ty
846 = inst_decl_ctxt (case unLoc hs_inst_ty of
847 HsForAllTy _ _ _ (L _ (HsPredTy pred)) -> ppr pred
848 HsPredTy pred -> ppr pred
849 other -> ppr hs_inst_ty) -- Don't expect this
850 instDeclCtxt2 dfun_ty
851 = inst_decl_ctxt (ppr (mkClassPred cls tys))
853 (_,_,cls,tys) = tcSplitDFunTy dfun_ty
855 inst_decl_ctxt doc = ptext SLIT("In the instance declaration for") <+> quotes doc
857 superClassCtxt = ptext SLIT("When checking the super-classes of an instance declaration")
859 atInstCtxt name = ptext SLIT("In the associated type instance for") <+>
863 sep [ ptext SLIT("Arguments that do not correspond to a class parameter") <+>
864 ptext SLIT("must be variables")
865 , ptext SLIT("Instead of a variable, found") <+> ppr ty
868 wrongATArgErr ty instTy =
869 sep [ ptext SLIT("Type indexes must match class instance head")
870 , ptext SLIT("Found") <+> ppr ty <+> ptext SLIT("but expected") <+>