2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[TcType]{Types used in the typechecker}
6 This module provides the Type interface for front-end parts of the
9 * treat "source types" as opaque:
10 newtypes, and predicates are meaningful.
11 * look through usage types
13 The "tc" prefix is for "TypeChecker", because the type checker
14 is the principal client.
18 --------------------------------
20 TcType, TcSigmaType, TcRhoType, TcTauType, TcPredType, TcThetaType,
21 TcTyVar, TcTyVarSet, TcKind,
23 BoxyTyVar, BoxySigmaType, BoxyRhoType, BoxyThetaType, BoxyType,
25 --------------------------------
27 UserTypeCtxt(..), pprUserTypeCtxt,
28 TcTyVarDetails(..), BoxInfo(..), pprTcTyVarDetails,
29 MetaDetails(Flexi, Indirect), SkolemInfo(..), pprSkolTvBinding, pprSkolInfo,
30 isImmutableTyVar, isSkolemTyVar, isMetaTyVar, isBoxyTyVar, isSigTyVar, isExistentialTyVar,
34 --------------------------------
38 --------------------------------
40 -- These are important because they do not look through newtypes
42 tcSplitForAllTys, tcSplitPhiTy,
43 tcSplitFunTy_maybe, tcSplitFunTys, tcFunArgTy, tcFunResultTy, tcSplitFunTysN,
44 tcSplitTyConApp, tcSplitTyConApp_maybe, tcTyConAppTyCon, tcTyConAppArgs,
45 tcSplitAppTy_maybe, tcSplitAppTy, tcSplitAppTys, repSplitAppTy_maybe,
46 tcValidInstHeadTy, tcGetTyVar_maybe, tcGetTyVar,
47 tcSplitSigmaTy, tcMultiSplitSigmaTy,
49 ---------------------------------
51 -- Again, newtypes are opaque
52 tcEqType, tcEqTypes, tcEqPred, tcCmpType, tcCmpTypes, tcCmpPred, tcEqTypeX,
54 isSigmaTy, isOverloadedTy, isRigidTy, isBoxyTy,
55 isDoubleTy, isFloatTy, isIntTy, isStringTy,
56 isIntegerTy, isBoolTy, isUnitTy,
57 isTauTy, isTauTyCon, tcIsTyVarTy, tcIsForAllTy,
59 ---------------------------------
60 -- Misc type manipulators
61 deNoteType, classesOfTheta,
62 tyClsNamesOfType, tyClsNamesOfDFunHead,
65 ---------------------------------
67 getClassPredTys_maybe, getClassPredTys,
68 isClassPred, isTyVarClassPred, isEqPred,
69 mkDictTy, tcSplitPredTy_maybe,
70 isPredTy, isDictTy, tcSplitDFunTy, tcSplitDFunHead, predTyUnique,
71 mkClassPred, isInheritablePred, isIPPred, mkPredName,
72 dataConsStupidTheta, isRefineableTy,
74 ---------------------------------
75 -- Foreign import and export
76 isFFIArgumentTy, -- :: DynFlags -> Safety -> Type -> Bool
77 isFFIImportResultTy, -- :: DynFlags -> Type -> Bool
78 isFFIExportResultTy, -- :: Type -> Bool
79 isFFIExternalTy, -- :: Type -> Bool
80 isFFIDynArgumentTy, -- :: Type -> Bool
81 isFFIDynResultTy, -- :: Type -> Bool
82 isFFILabelTy, -- :: Type -> Bool
83 isFFIDotnetTy, -- :: DynFlags -> Type -> Bool
84 isFFIDotnetObjTy, -- :: Type -> Bool
85 isFFITy, -- :: Type -> Bool
86 tcSplitIOType_maybe, -- :: Type -> Maybe Type
87 toDNType, -- :: Type -> DNType
89 --------------------------------
90 -- Rexported from Type
91 Kind, -- Stuff to do with kinds is insensitive to pre/post Tc
92 unliftedTypeKind, liftedTypeKind, argTypeKind,
93 openTypeKind, mkArrowKind, mkArrowKinds,
94 isLiftedTypeKind, isUnliftedTypeKind, isSubOpenTypeKind,
95 isSubArgTypeKind, isSubKind, defaultKind,
96 kindVarRef, mkKindVar,
98 Type, PredType(..), ThetaType,
99 mkForAllTy, mkForAllTys,
100 mkFunTy, mkFunTys, zipFunTys,
101 mkTyConApp, mkAppTy, mkAppTys, applyTy, applyTys,
102 mkTyVarTy, mkTyVarTys, mkTyConTy, mkPredTy, mkPredTys,
104 -- Type substitutions
105 TvSubst(..), -- Representation visible to a few friends
106 TvSubstEnv, emptyTvSubst, substEqSpec,
107 mkOpenTvSubst, zipOpenTvSubst, zipTopTvSubst, mkTopTvSubst, notElemTvSubst,
108 getTvSubstEnv, setTvSubstEnv, getTvInScope, extendTvInScope, lookupTyVar,
109 extendTvSubst, extendTvSubstList, isInScope, mkTvSubst, zipTyEnv,
110 substTy, substTys, substTyWith, substTheta, substTyVar, substTyVarBndr,
112 isUnLiftedType, -- Source types are always lifted
113 isUnboxedTupleType, -- Ditto
116 tidyTopType, tidyType, tidyPred, tidyTypes, tidyFreeTyVars, tidyOpenType, tidyOpenTypes,
117 tidyTyVarBndr, tidyOpenTyVar, tidyOpenTyVars, tidySkolemTyVar,
120 tyVarsOfType, tyVarsOfTypes, tyVarsOfPred, tyVarsOfTheta,
121 tcTyVarsOfType, tcTyVarsOfTypes, exactTyVarsOfType, exactTyVarsOfTypes,
123 pprKind, pprParendKind,
124 pprType, pprParendType, pprTyThingCategory,
125 pprPred, pprTheta, pprThetaArrow, pprClassPred
129 #include "HsVersions.h"
132 import TypeRep ( Type(..), funTyCon, Kind ) -- friend
134 import Type ( -- Re-exports
135 tyVarsOfType, tyVarsOfTypes, tyVarsOfPred,
136 tyVarsOfTheta, Kind, PredType(..), KindVar,
137 ThetaType, isUnliftedTypeKind, unliftedTypeKind,
139 liftedTypeKind, openTypeKind, mkArrowKind,
140 tySuperKind, isLiftedTypeKind,
141 mkArrowKinds, mkForAllTy, mkForAllTys,
142 defaultKind, isSubArgTypeKind, isSubOpenTypeKind,
143 mkFunTy, mkFunTys, zipFunTys,
145 mkAppTys, applyTy, applyTys,
146 mkTyVarTy, mkTyVarTys, mkTyConTy, mkPredTy,
147 mkPredTys, isUnLiftedType,
148 isUnboxedTupleType, isPrimitiveType,
150 tidyTopType, tidyType, tidyPred, tidyTypes,
151 tidyFreeTyVars, tidyOpenType, tidyOpenTypes,
152 tidyTyVarBndr, tidyOpenTyVar,
153 tidyOpenTyVars, tidyKind,
156 tcEqType, tcEqTypes, tcCmpType, tcCmpTypes,
157 tcEqPred, tcCmpPred, tcEqTypeX, eqKind,
160 TvSubstEnv, emptyTvSubst, mkTvSubst, zipTyEnv,
161 mkOpenTvSubst, zipOpenTvSubst, zipTopTvSubst, mkTopTvSubst,
162 getTvSubstEnv, setTvSubstEnv, getTvInScope, extendTvInScope,
163 extendTvSubst, extendTvSubstList, isInScope, notElemTvSubst,
164 substTy, substTys, substTyWith, substTheta,
165 substTyVar, substTyVarBndr, substPred, lookupTyVar,
167 typeKind, repType, coreView, repSplitAppTy_maybe,
168 pprKind, pprParendKind,
169 pprType, pprParendType, pprTyThingCategory,
170 pprPred, pprTheta, pprThetaArrow, pprClassPred
172 import TyCon ( TyCon, isUnLiftedTyCon, isSynTyCon, isOpenTyCon,
173 synTyConDefn, tyConUnique )
174 import DataCon ( DataCon, dataConStupidTheta, dataConResTys )
175 import Class ( Class )
176 import Var ( TyVar, Id, isCoVar, isTcTyVar, mkTcTyVar, tyVarName, tyVarKind, tcTyVarDetails )
177 import ForeignCall ( Safety, DNType(..) )
178 import Unify ( tcMatchTys )
182 import DynFlags ( DynFlags, DynFlag( Opt_GlasgowExts ), dopt )
183 import Name ( Name, NamedThing(..), mkInternalName, getSrcLoc, mkSystemName )
185 import VarEnv ( TidyEnv )
186 import OccName ( OccName, mkDictOcc, mkOccName, tvName )
187 import PrelNames -- Lots (e.g. in isFFIArgumentTy)
188 import TysWiredIn ( unitTyCon, charTyCon, listTyCon )
189 import BasicTypes ( Arity, ipNameName )
190 import SrcLoc ( SrcLoc, SrcSpan )
191 import Util ( equalLength )
192 import Maybes ( maybeToBool, expectJust, mapCatMaybes )
193 import ListSetOps ( hasNoDups )
194 import List ( nubBy )
200 %************************************************************************
204 %************************************************************************
206 The type checker divides the generic Type world into the
207 following more structured beasts:
209 sigma ::= forall tyvars. phi
210 -- A sigma type is a qualified type
212 -- Note that even if 'tyvars' is empty, theta
213 -- may not be: e.g. (?x::Int) => Int
215 -- Note that 'sigma' is in prenex form:
216 -- all the foralls are at the front.
217 -- A 'phi' type has no foralls to the right of
225 -- A 'tau' type has no quantification anywhere
226 -- Note that the args of a type constructor must be taus
228 | tycon tau_1 .. tau_n
232 -- In all cases, a (saturated) type synonym application is legal,
233 -- provided it expands to the required form.
236 type TcTyVar = TyVar -- Used only during type inference
237 type TcType = Type -- A TcType can have mutable type variables
238 -- Invariant on ForAllTy in TcTypes:
240 -- a cannot occur inside a MutTyVar in T; that is,
241 -- T is "flattened" before quantifying over a
243 -- These types do not have boxy type variables in them
244 type TcPredType = PredType
245 type TcThetaType = ThetaType
246 type TcSigmaType = TcType
247 type TcRhoType = TcType
248 type TcTauType = TcType
250 type TcTyVarSet = TyVarSet
252 -- These types may have boxy type variables in them
253 type BoxyTyVar = TcTyVar
254 type BoxyRhoType = TcType
255 type BoxyThetaType = TcThetaType
256 type BoxySigmaType = TcType
257 type BoxyType = TcType
261 %************************************************************************
263 \subsection{TyVarDetails}
265 %************************************************************************
267 TyVarDetails gives extra info about type variables, used during type
268 checking. It's attached to mutable type variables only.
269 It's knot-tied back to Var.lhs. There is no reason in principle
270 why Var.lhs shouldn't actually have the definition, but it "belongs" here.
273 Note [Signature skolems]
274 ~~~~~~~~~~~~~~~~~~~~~~~~
279 (x,y,z) = ([y,z], z, head x)
281 Here, x and y have type sigs, which go into the environment. We used to
282 instantiate their types with skolem constants, and push those types into
283 the RHS, so we'd typecheck the RHS with type
285 where a*, b* are skolem constants, and c is an ordinary meta type varible.
287 The trouble is that the occurrences of z in the RHS force a* and b* to
288 be the *same*, so we can't make them into skolem constants that don't unify
289 with each other. Alas.
291 One solution would be insist that in the above defn the programmer uses
292 the same type variable in both type signatures. But that takes explanation.
294 The alternative (currently implemented) is to have a special kind of skolem
295 constant, SigTv, which can unify with other SigTvs. These are *not* treated
296 as righd for the purposes of GADTs. And they are used *only* for pattern
297 bindings and mutually recursive function bindings. See the function
298 TcBinds.tcInstSig, and its use_skols parameter.
302 -- A TyVarDetails is inside a TyVar
304 = SkolemTv SkolemInfo -- A skolem constant
306 | MetaTv BoxInfo (IORef MetaDetails)
309 = BoxTv -- The contents is a (non-boxy) sigma-type
310 -- That is, this MetaTv is a "box"
312 | TauTv -- The contents is a (non-boxy) tau-type
313 -- That is, this MetaTv is an ordinary unification variable
315 | SigTv SkolemInfo -- A variant of TauTv, except that it should not be
316 -- unified with a type, only with a type variable
317 -- SigTvs are only distinguished to improve error messages
318 -- see Note [Signature skolems]
319 -- The MetaDetails, if filled in, will
320 -- always be another SigTv or a SkolemTv
323 -- A TauTv is always filled in with a tau-type, which
324 -- never contains any BoxTvs, nor any ForAlls
326 -- However, a BoxTv can contain a type that contains further BoxTvs
327 -- Notably, when typechecking an explicit list, say [e1,e2], with
328 -- expected type being a box b1, we fill in b1 with (List b2), where
329 -- b2 is another (currently empty) box.
332 = Flexi -- Flexi type variables unify to become
335 | Indirect TcType -- INVARIANT:
336 -- For a BoxTv, this type must be non-boxy
337 -- For a TauTv, this type must be a tau-type
340 = SigSkol UserTypeCtxt -- A skolem that is created by instantiating
341 -- a programmer-supplied type signature
342 -- Location of the binding site is on the TyVar
344 -- The rest are for non-scoped skolems
345 | ClsSkol Class -- Bound at a class decl
346 | InstSkol Id -- Bound at an instance decl
347 | FamInstSkol TyCon -- Bound at a family instance decl
348 | PatSkol DataCon -- An existential type variable bound by a pattern for
349 SrcSpan -- a data constructor with an existential type. E.g.
350 -- data T = forall a. Eq a => MkT a
352 -- The pattern MkT x will allocate an existential type
354 | ArrowSkol SrcSpan -- An arrow form (see TcArrows)
356 | GenSkol [TcTyVar] -- Bound when doing a subsumption check for
357 TcType -- (forall tvs. ty)
360 | UnkSkol -- Unhelpful info (until I improve it)
362 -------------------------------------
363 -- UserTypeCtxt describes the places where a
364 -- programmer-written type signature can occur
366 = FunSigCtxt Name -- Function type signature
367 -- Also used for types in SPECIALISE pragmas
368 | ExprSigCtxt -- Expression type signature
369 | ConArgCtxt Name -- Data constructor argument
370 | TySynCtxt Name -- RHS of a type synonym decl
371 | GenPatCtxt -- Pattern in generic decl
372 -- f{| a+b |} (Inl x) = ...
373 | LamPatSigCtxt -- Type sig in lambda pattern
375 | BindPatSigCtxt -- Type sig in pattern binding pattern
377 | ResSigCtxt -- Result type sig
379 | ForSigCtxt Name -- Foreign inport or export signature
380 | RuleSigCtxt Name -- Signature on a forall'd variable in a RULE
381 | DefaultDeclCtxt -- Types in a default declaration
382 | SpecInstCtxt -- SPECIALISE instance pragma
384 -- Notes re TySynCtxt
385 -- We allow type synonyms that aren't types; e.g. type List = []
387 -- If the RHS mentions tyvars that aren't in scope, we'll
388 -- quantify over them:
389 -- e.g. type T = a->a
390 -- will become type T = forall a. a->a
392 -- With gla-exts that's right, but for H98 we should complain.
394 ---------------------------------
397 mkKindName :: Unique -> Name
398 mkKindName unique = mkSystemName unique kind_var_occ
400 kindVarRef :: KindVar -> IORef MetaDetails
402 ASSERT ( isTcTyVar tc )
403 case tcTyVarDetails tc of
404 MetaTv TauTv ref -> ref
405 other -> pprPanic "kindVarRef" (ppr tc)
407 mkKindVar :: Unique -> IORef MetaDetails -> KindVar
409 = mkTcTyVar (mkKindName u)
410 tySuperKind -- not sure this is right,
411 -- do we need kind vars for
415 kind_var_occ :: OccName -- Just one for all KindVars
416 -- They may be jiggled by tidying
417 kind_var_occ = mkOccName tvName "k"
421 %************************************************************************
425 %************************************************************************
428 pprTcTyVarDetails :: TcTyVarDetails -> SDoc
430 pprTcTyVarDetails (SkolemTv _) = ptext SLIT("sk")
431 pprTcTyVarDetails (MetaTv BoxTv _) = ptext SLIT("box")
432 pprTcTyVarDetails (MetaTv TauTv _) = ptext SLIT("tau")
433 pprTcTyVarDetails (MetaTv (SigTv _) _) = ptext SLIT("sig")
435 pprUserTypeCtxt :: UserTypeCtxt -> SDoc
436 pprUserTypeCtxt (FunSigCtxt n) = ptext SLIT("the type signature for") <+> quotes (ppr n)
437 pprUserTypeCtxt ExprSigCtxt = ptext SLIT("an expression type signature")
438 pprUserTypeCtxt (ConArgCtxt c) = ptext SLIT("the type of the constructor") <+> quotes (ppr c)
439 pprUserTypeCtxt (TySynCtxt c) = ptext SLIT("the RHS of the type synonym") <+> quotes (ppr c)
440 pprUserTypeCtxt GenPatCtxt = ptext SLIT("the type pattern of a generic definition")
441 pprUserTypeCtxt LamPatSigCtxt = ptext SLIT("a pattern type signature")
442 pprUserTypeCtxt BindPatSigCtxt = ptext SLIT("a pattern type signature")
443 pprUserTypeCtxt ResSigCtxt = ptext SLIT("a result type signature")
444 pprUserTypeCtxt (ForSigCtxt n) = ptext SLIT("the foreign declaration for") <+> quotes (ppr n)
445 pprUserTypeCtxt (RuleSigCtxt n) = ptext SLIT("the type signature for") <+> quotes (ppr n)
446 pprUserTypeCtxt DefaultDeclCtxt = ptext SLIT("a type in a `default' declaration")
447 pprUserTypeCtxt SpecInstCtxt = ptext SLIT("a SPECIALISE instance pragma")
450 --------------------------------
451 tidySkolemTyVar :: TidyEnv -> TcTyVar -> (TidyEnv, TcTyVar)
452 -- Tidy the type inside a GenSkol, preparatory to printing it
453 tidySkolemTyVar env tv
454 = ASSERT( isSkolemTyVar tv || isSigTyVar tv )
455 (env1, mkTcTyVar (tyVarName tv) (tyVarKind tv) info1)
457 (env1, info1) = case tcTyVarDetails tv of
458 SkolemTv info -> (env1, SkolemTv info')
460 (env1, info') = tidy_skol_info env info
461 MetaTv (SigTv info) box -> (env1, MetaTv (SigTv info') box)
463 (env1, info') = tidy_skol_info env info
466 tidy_skol_info env (GenSkol tvs ty loc) = (env2, GenSkol tvs1 ty1 loc)
468 (env1, tvs1) = tidyOpenTyVars env tvs
469 (env2, ty1) = tidyOpenType env1 ty
470 tidy_skol_info env info = (env, info)
472 pprSkolTvBinding :: TcTyVar -> SDoc
473 -- Print info about the binding of a skolem tyvar,
474 -- or nothing if we don't have anything useful to say
476 = ASSERT ( isTcTyVar tv )
477 ppr_details (tcTyVarDetails tv)
479 ppr_details (MetaTv TauTv _) = quotes (ppr tv) <+> ptext SLIT("is a meta type variable")
480 ppr_details (MetaTv BoxTv _) = quotes (ppr tv) <+> ptext SLIT("is a boxy type variable")
481 ppr_details (MetaTv (SigTv info) _) = ppr_skol info
482 ppr_details (SkolemTv info) = ppr_skol info
484 ppr_skol UnkSkol = empty -- Unhelpful; omit
485 ppr_skol (SigSkol ctxt) = sep [quotes (ppr tv) <+> ptext SLIT("is bound by") <+> pprUserTypeCtxt ctxt,
486 nest 2 (ptext SLIT("at") <+> ppr (getSrcLoc tv))]
487 ppr_skol info = quotes (ppr tv) <+> pprSkolInfo info
489 pprSkolInfo :: SkolemInfo -> SDoc
490 pprSkolInfo (SigSkol ctxt) = ptext SLIT("is bound by") <+> pprUserTypeCtxt ctxt
491 pprSkolInfo (ClsSkol cls) = ptext SLIT("is bound by the class declaration for") <+> quotes (ppr cls)
492 pprSkolInfo (InstSkol df) =
493 ptext SLIT("is bound by the instance declaration at") <+> ppr (getSrcLoc df)
494 pprSkolInfo (FamInstSkol tc) =
495 ptext SLIT("is bound by the family instance declaration at") <+>
497 pprSkolInfo (ArrowSkol loc) =
498 ptext SLIT("is bound by the arrow form at") <+> ppr loc
499 pprSkolInfo (PatSkol dc loc) = sep [ptext SLIT("is bound by the pattern for") <+> quotes (ppr dc),
500 nest 2 (ptext SLIT("at") <+> ppr loc)]
501 pprSkolInfo (GenSkol tvs ty loc) = sep [sep [ptext SLIT("is bound by the polymorphic type"),
502 nest 2 (quotes (ppr (mkForAllTys tvs ty)))],
503 nest 2 (ptext SLIT("at") <+> ppr loc)]
505 -- For type variables the others are dealt with by pprSkolTvBinding.
506 -- For Insts, these cases should not happen
507 pprSkolInfo UnkSkol = panic "UnkSkol"
509 instance Outputable MetaDetails where
510 ppr Flexi = ptext SLIT("Flexi")
511 ppr (Indirect ty) = ptext SLIT("Indirect") <+> ppr ty
515 %************************************************************************
519 %************************************************************************
522 isImmutableTyVar, isSkolemTyVar, isExistentialTyVar, isBoxyTyVar, isMetaTyVar :: TyVar -> Bool
524 | isTcTyVar tv = isSkolemTyVar tv
528 = ASSERT( isTcTyVar tv )
529 case tcTyVarDetails tv of
533 isExistentialTyVar tv -- Existential type variable, bound by a pattern
534 = ASSERT( isTcTyVar tv )
535 case tcTyVarDetails tv of
536 SkolemTv (PatSkol _ _) -> True
540 = ASSERT2( isTcTyVar tv, ppr tv )
541 case tcTyVarDetails tv of
546 = ASSERT( isTcTyVar tv )
547 case tcTyVarDetails tv of
548 MetaTv BoxTv _ -> True
552 = ASSERT( isTcTyVar tv )
553 case tcTyVarDetails tv of
554 MetaTv (SigTv _) _ -> True
557 metaTvRef :: TyVar -> IORef MetaDetails
559 = ASSERT( isTcTyVar tv )
560 case tcTyVarDetails tv of
562 other -> pprPanic "metaTvRef" (ppr tv)
564 isFlexi, isIndirect :: MetaDetails -> Bool
566 isFlexi other = False
568 isIndirect (Indirect _) = True
569 isIndirect other = False
573 %************************************************************************
575 \subsection{Tau, sigma and rho}
577 %************************************************************************
580 mkSigmaTy :: [TyVar] -> [PredType] -> Type -> Type
581 mkSigmaTy tyvars theta tau = mkForAllTys tyvars (mkPhiTy theta tau)
583 mkPhiTy :: [PredType] -> Type -> Type
584 mkPhiTy theta ty = foldr (\p r -> FunTy (mkPredTy p) r) ty theta
587 @isTauTy@ tests for nested for-alls. It should not be called on a boxy type.
590 isTauTy :: Type -> Bool
591 isTauTy ty | Just ty' <- tcView ty = isTauTy ty'
592 isTauTy (TyVarTy tv) = ASSERT( not (isTcTyVar tv && isBoxyTyVar tv) )
594 isTauTy (TyConApp tc tys) = all isTauTy tys && isTauTyCon tc
595 isTauTy (AppTy a b) = isTauTy a && isTauTy b
596 isTauTy (FunTy a b) = isTauTy a && isTauTy b
597 isTauTy (PredTy p) = True -- Don't look through source types
598 isTauTy other = False
601 isTauTyCon :: TyCon -> Bool
602 -- Returns False for type synonyms whose expansion is a polytype
604 | isSynTyCon tc && not (isOpenTyCon tc) = isTauTy (snd (synTyConDefn tc))
608 isBoxyTy :: TcType -> Bool
609 isBoxyTy ty = any isBoxyTyVar (varSetElems (tcTyVarsOfType ty))
611 isRigidTy :: TcType -> Bool
612 -- A type is rigid if it has no meta type variables in it
613 isRigidTy ty = all isSkolemTyVar (varSetElems (tcTyVarsOfType ty))
615 isRefineableTy :: TcType -> Bool
616 -- A type should have type refinements applied to it if it has
617 -- free type variables, and they are all rigid
618 isRefineableTy ty = not (null tc_tvs) && all isSkolemTyVar tc_tvs
620 tc_tvs = varSetElems (tcTyVarsOfType ty)
623 getDFunTyKey :: Type -> OccName -- Get some string from a type, to be used to
624 -- construct a dictionary function name
625 getDFunTyKey ty | Just ty' <- tcView ty = getDFunTyKey ty'
626 getDFunTyKey (TyVarTy tv) = getOccName tv
627 getDFunTyKey (TyConApp tc _) = getOccName tc
628 getDFunTyKey (AppTy fun _) = getDFunTyKey fun
629 getDFunTyKey (FunTy arg _) = getOccName funTyCon
630 getDFunTyKey (ForAllTy _ t) = getDFunTyKey t
631 getDFunTyKey ty = pprPanic "getDFunTyKey" (pprType ty)
632 -- PredTy shouldn't happen
636 %************************************************************************
638 \subsection{Expanding and splitting}
640 %************************************************************************
642 These tcSplit functions are like their non-Tc analogues, but
643 a) they do not look through newtypes
644 b) they do not look through PredTys
645 c) [future] they ignore usage-type annotations
647 However, they are non-monadic and do not follow through mutable type
648 variables. It's up to you to make sure this doesn't matter.
651 tcSplitForAllTys :: Type -> ([TyVar], Type)
652 tcSplitForAllTys ty = split ty ty []
654 split orig_ty ty tvs | Just ty' <- tcView ty = split orig_ty ty' tvs
655 split orig_ty (ForAllTy tv ty) tvs
656 | not (isCoVar tv) = split ty ty (tv:tvs)
657 split orig_ty t tvs = (reverse tvs, orig_ty)
659 tcIsForAllTy ty | Just ty' <- tcView ty = tcIsForAllTy ty'
660 tcIsForAllTy (ForAllTy tv ty) = not (isCoVar tv)
661 tcIsForAllTy t = False
663 tcSplitPhiTy :: Type -> (ThetaType, Type)
664 tcSplitPhiTy ty = split ty ty []
666 split orig_ty ty tvs | Just ty' <- tcView ty = split orig_ty ty' tvs
668 split orig_ty (ForAllTy tv ty) ts
669 | isCoVar tv = split ty ty (eq_pred:ts)
671 PredTy eq_pred = tyVarKind tv
672 split orig_ty (FunTy arg res) ts
673 | Just p <- tcSplitPredTy_maybe arg = split res res (p:ts)
674 split orig_ty ty ts = (reverse ts, orig_ty)
676 tcSplitSigmaTy ty = case tcSplitForAllTys ty of
677 (tvs, rho) -> case tcSplitPhiTy rho of
678 (theta, tau) -> (tvs, theta, tau)
680 -----------------------
683 -> ( [([TyVar], ThetaType)], -- forall as.C => forall bs.D
684 TcSigmaType) -- The rest of the type
686 -- We need a loop here because we are now prepared to entertain
688 -- f:: forall a. Eq a => forall b. Baz b => tau
689 -- We want to instantiate this to
690 -- f2::tau {f2 = f1 b (Baz b), f1 = f a (Eq a)}
692 tcMultiSplitSigmaTy sigma
693 = case (tcSplitSigmaTy sigma) of
694 ([],[],ty) -> ([], sigma)
695 (tvs, theta, ty) -> case tcMultiSplitSigmaTy ty of
696 (pairs, rest) -> ((tvs,theta):pairs, rest)
698 -----------------------
699 tcTyConAppTyCon :: Type -> TyCon
700 tcTyConAppTyCon ty = case tcSplitTyConApp_maybe ty of
702 Nothing -> pprPanic "tcTyConAppTyCon" (pprType ty)
704 tcTyConAppArgs :: Type -> [Type]
705 tcTyConAppArgs ty = case tcSplitTyConApp_maybe ty of
706 Just (_, args) -> args
707 Nothing -> pprPanic "tcTyConAppArgs" (pprType ty)
709 tcSplitTyConApp :: Type -> (TyCon, [Type])
710 tcSplitTyConApp ty = case tcSplitTyConApp_maybe ty of
712 Nothing -> pprPanic "tcSplitTyConApp" (pprType ty)
714 tcSplitTyConApp_maybe :: Type -> Maybe (TyCon, [Type])
715 tcSplitTyConApp_maybe ty | Just ty' <- tcView ty = tcSplitTyConApp_maybe ty'
716 tcSplitTyConApp_maybe (TyConApp tc tys) = Just (tc, tys)
717 tcSplitTyConApp_maybe (FunTy arg res) = Just (funTyCon, [arg,res])
718 -- Newtypes are opaque, so they may be split
719 -- However, predicates are not treated
720 -- as tycon applications by the type checker
721 tcSplitTyConApp_maybe other = Nothing
723 -----------------------
724 tcSplitFunTys :: Type -> ([Type], Type)
725 tcSplitFunTys ty = case tcSplitFunTy_maybe ty of
727 Just (arg,res) -> (arg:args, res')
729 (args,res') = tcSplitFunTys res
731 tcSplitFunTy_maybe :: Type -> Maybe (Type, Type)
732 tcSplitFunTy_maybe ty | Just ty' <- tcView ty = tcSplitFunTy_maybe ty'
733 tcSplitFunTy_maybe (FunTy arg res) = Just (arg, res)
734 tcSplitFunTy_maybe other = Nothing
738 -> Arity -- N: Number of desired args
739 -> ([TcSigmaType], -- Arg types (N or fewer)
740 TcSigmaType) -- The rest of the type
742 tcSplitFunTysN ty n_args
745 | Just (arg,res) <- tcSplitFunTy_maybe ty
746 = case tcSplitFunTysN res (n_args - 1) of
747 (args, res) -> (arg:args, res)
751 tcSplitFunTy ty = expectJust "tcSplitFunTy" (tcSplitFunTy_maybe ty)
752 tcFunArgTy ty = fst (tcSplitFunTy ty)
753 tcFunResultTy ty = snd (tcSplitFunTy ty)
755 -----------------------
756 tcSplitAppTy_maybe :: Type -> Maybe (Type, Type)
757 tcSplitAppTy_maybe ty | Just ty' <- tcView ty = tcSplitAppTy_maybe ty'
758 tcSplitAppTy_maybe ty = repSplitAppTy_maybe ty
760 tcSplitAppTy :: Type -> (Type, Type)
761 tcSplitAppTy ty = case tcSplitAppTy_maybe ty of
763 Nothing -> pprPanic "tcSplitAppTy" (pprType ty)
765 tcSplitAppTys :: Type -> (Type, [Type])
769 go ty args = case tcSplitAppTy_maybe ty of
770 Just (ty', arg) -> go ty' (arg:args)
773 -----------------------
774 tcGetTyVar_maybe :: Type -> Maybe TyVar
775 tcGetTyVar_maybe ty | Just ty' <- tcView ty = tcGetTyVar_maybe ty'
776 tcGetTyVar_maybe (TyVarTy tv) = Just tv
777 tcGetTyVar_maybe other = Nothing
779 tcGetTyVar :: String -> Type -> TyVar
780 tcGetTyVar msg ty = expectJust msg (tcGetTyVar_maybe ty)
782 tcIsTyVarTy :: Type -> Bool
783 tcIsTyVarTy ty = maybeToBool (tcGetTyVar_maybe ty)
785 -----------------------
786 tcSplitDFunTy :: Type -> ([TyVar], [PredType], Class, [Type])
787 -- Split the type of a dictionary function
789 = case tcSplitSigmaTy ty of { (tvs, theta, tau) ->
790 case tcSplitDFunHead tau of { (clas, tys) ->
791 (tvs, theta, clas, tys) }}
793 tcSplitDFunHead :: Type -> (Class, [Type])
795 = case tcSplitPredTy_maybe tau of
796 Just (ClassP clas tys) -> (clas, tys)
797 other -> panic "tcSplitDFunHead"
799 tcValidInstHeadTy :: Type -> Bool
800 -- Used in Haskell-98 mode, for the argument types of an instance head
801 -- These must not be type synonyms, but everywhere else type synonyms
802 -- are transparent, so we need a special function here
805 NoteTy _ ty -> tcValidInstHeadTy ty
806 TyConApp tc tys -> not (isSynTyCon tc) && ok tys
807 FunTy arg res -> ok [arg, res]
810 -- Check that all the types are type variables,
811 -- and that each is distinct
812 ok tys = equalLength tvs tys && hasNoDups tvs
814 tvs = mapCatMaybes get_tv tys
816 get_tv (NoteTy _ ty) = get_tv ty -- Again, do not look
817 get_tv (TyVarTy tv) = Just tv -- through synonyms
818 get_tv other = Nothing
823 %************************************************************************
825 \subsection{Predicate types}
827 %************************************************************************
830 tcSplitPredTy_maybe :: Type -> Maybe PredType
831 -- Returns Just for predicates only
832 tcSplitPredTy_maybe ty | Just ty' <- tcView ty = tcSplitPredTy_maybe ty'
833 tcSplitPredTy_maybe (PredTy p) = Just p
834 tcSplitPredTy_maybe other = Nothing
836 predTyUnique :: PredType -> Unique
837 predTyUnique (IParam n _) = getUnique (ipNameName n)
838 predTyUnique (ClassP clas tys) = getUnique clas
840 mkPredName :: Unique -> SrcLoc -> PredType -> Name
841 mkPredName uniq loc (ClassP cls tys) = mkInternalName uniq (mkDictOcc (getOccName cls)) loc
842 mkPredName uniq loc (IParam ip ty) = mkInternalName uniq (getOccName (ipNameName ip)) loc
846 --------------------- Dictionary types ---------------------------------
849 mkClassPred clas tys = ClassP clas tys
851 isClassPred :: PredType -> Bool
852 isClassPred (ClassP clas tys) = True
853 isClassPred other = False
855 isTyVarClassPred (ClassP clas tys) = all tcIsTyVarTy tys
856 isTyVarClassPred other = False
858 getClassPredTys_maybe :: PredType -> Maybe (Class, [Type])
859 getClassPredTys_maybe (ClassP clas tys) = Just (clas, tys)
860 getClassPredTys_maybe _ = Nothing
862 getClassPredTys :: PredType -> (Class, [Type])
863 getClassPredTys (ClassP clas tys) = (clas, tys)
864 getClassPredTys other = panic "getClassPredTys"
866 isEqPred :: PredType -> Bool
867 isEqPred (EqPred {}) = True
870 mkDictTy :: Class -> [Type] -> Type
871 mkDictTy clas tys = mkPredTy (ClassP clas tys)
873 isDictTy :: Type -> Bool
874 isDictTy ty | Just ty' <- tcView ty = isDictTy ty'
875 isDictTy (PredTy p) = isClassPred p
876 isDictTy other = False
879 --------------------- Implicit parameters ---------------------------------
882 isIPPred :: PredType -> Bool
883 isIPPred (IParam _ _) = True
884 isIPPred other = False
886 isInheritablePred :: PredType -> Bool
887 -- Can be inherited by a context. For example, consider
888 -- f x = let g y = (?v, y+x)
889 -- in (g 3 with ?v = 8,
891 -- The point is that g's type must be quantifed over ?v:
892 -- g :: (?v :: a) => a -> a
893 -- but it doesn't need to be quantified over the Num a dictionary
894 -- which can be free in g's rhs, and shared by both calls to g
895 isInheritablePred (ClassP _ _) = True
896 isInheritablePred other = False
899 --------------------- Equality predicates ---------------------------------
901 substEqSpec :: TvSubst -> [(TyVar,Type)] -> [(TcType,TcType)]
902 substEqSpec subst eq_spec = [ (substTyVar subst tv, substTy subst ty)
903 | (tv,ty) <- eq_spec]
906 --------------------- The stupid theta (sigh) ---------------------------------
909 dataConsStupidTheta :: [DataCon] -> ThetaType
910 -- Union the stupid thetas from all the specified constructors (non-empty)
911 -- All the constructors should have the same result type, modulo alpha conversion
912 -- The resulting ThetaType uses type variables from the *first* constructor in the list
914 -- It's here because it's used in MkId.mkRecordSelId, and in TcExpr
915 dataConsStupidTheta (con1:cons)
916 = nubBy tcEqPred all_preds
918 all_preds = dataConStupidTheta con1 ++ other_stupids
919 res_tys1 = dataConResTys con1
920 tvs1 = tyVarsOfTypes res_tys1
921 other_stupids = [ substPred subst pred
923 , let Just subst = tcMatchTys tvs1 res_tys1 (dataConResTys con)
924 , pred <- dataConStupidTheta con ]
925 dataConsStupidTheta [] = panic "dataConsStupidTheta"
929 %************************************************************************
931 \subsection{Predicates}
933 %************************************************************************
935 isSigmaTy returns true of any qualified type. It doesn't *necessarily* have
937 f :: (?x::Int) => Int -> Int
940 isSigmaTy :: Type -> Bool
941 isSigmaTy ty | Just ty' <- tcView ty = isSigmaTy ty'
942 isSigmaTy (ForAllTy tyvar ty) = True
943 isSigmaTy (FunTy a b) = isPredTy a
946 isOverloadedTy :: Type -> Bool
947 isOverloadedTy ty | Just ty' <- tcView ty = isOverloadedTy ty'
948 isOverloadedTy (ForAllTy tyvar ty) = isOverloadedTy ty
949 isOverloadedTy (FunTy a b) = isPredTy a
950 isOverloadedTy _ = False
952 isPredTy :: Type -> Bool -- Belongs in TcType because it does
953 -- not look through newtypes, or predtypes (of course)
954 isPredTy ty | Just ty' <- tcView ty = isPredTy ty'
955 isPredTy (PredTy sty) = True
960 isFloatTy = is_tc floatTyConKey
961 isDoubleTy = is_tc doubleTyConKey
962 isIntegerTy = is_tc integerTyConKey
963 isIntTy = is_tc intTyConKey
964 isBoolTy = is_tc boolTyConKey
965 isUnitTy = is_tc unitTyConKey
967 is_tc :: Unique -> Type -> Bool
968 -- Newtypes are opaque to this
969 is_tc uniq ty = case tcSplitTyConApp_maybe ty of
970 Just (tc, _) -> uniq == getUnique tc
975 %************************************************************************
979 %************************************************************************
982 deNoteType :: Type -> Type
983 -- Remove all *outermost* type synonyms and other notes
984 deNoteType ty | Just ty' <- tcView ty = deNoteType ty'
989 tcTyVarsOfType :: Type -> TcTyVarSet
990 -- Just the *TcTyVars* free in the type
991 -- (Types.tyVarsOfTypes finds all free TyVars)
992 tcTyVarsOfType (TyVarTy tv) = if isTcTyVar tv then unitVarSet tv
994 tcTyVarsOfType (TyConApp tycon tys) = tcTyVarsOfTypes tys
995 tcTyVarsOfType (NoteTy _ ty) = tcTyVarsOfType ty
996 tcTyVarsOfType (PredTy sty) = tcTyVarsOfPred sty
997 tcTyVarsOfType (FunTy arg res) = tcTyVarsOfType arg `unionVarSet` tcTyVarsOfType res
998 tcTyVarsOfType (AppTy fun arg) = tcTyVarsOfType fun `unionVarSet` tcTyVarsOfType arg
999 tcTyVarsOfType (ForAllTy tyvar ty) = (tcTyVarsOfType ty `delVarSet` tyvar)
1000 `unionVarSet` tcTyVarsOfTyVar tyvar
1001 -- We do sometimes quantify over skolem TcTyVars
1003 tcTyVarsOfTyVar :: TcTyVar -> TyVarSet
1004 tcTyVarsOfTyVar tv | isCoVar tv = tcTyVarsOfType (tyVarKind tv)
1005 | otherwise = emptyVarSet
1007 tcTyVarsOfTypes :: [Type] -> TyVarSet
1008 tcTyVarsOfTypes tys = foldr (unionVarSet.tcTyVarsOfType) emptyVarSet tys
1010 tcTyVarsOfPred :: PredType -> TyVarSet
1011 tcTyVarsOfPred (IParam _ ty) = tcTyVarsOfType ty
1012 tcTyVarsOfPred (ClassP _ tys) = tcTyVarsOfTypes tys
1013 tcTyVarsOfPred (EqPred ty1 ty2) = tcTyVarsOfType ty1 `unionVarSet` tcTyVarsOfType ty2
1016 Note [Silly type synonym]
1017 ~~~~~~~~~~~~~~~~~~~~~~~~~
1020 What are the free tyvars of (T x)? Empty, of course!
1021 Here's the example that Ralf Laemmel showed me:
1022 foo :: (forall a. C u a -> C u a) -> u
1023 mappend :: Monoid u => u -> u -> u
1025 bar :: Monoid u => u
1026 bar = foo (\t -> t `mappend` t)
1027 We have to generalise at the arg to f, and we don't
1028 want to capture the constraint (Monad (C u a)) because
1029 it appears to mention a. Pretty silly, but it was useful to him.
1031 exactTyVarsOfType is used by the type checker to figure out exactly
1032 which type variables are mentioned in a type. It's also used in the
1033 smart-app checking code --- see TcExpr.tcIdApp
1036 exactTyVarsOfType :: TcType -> TyVarSet
1037 -- Find the free type variables (of any kind)
1038 -- but *expand* type synonyms. See Note [Silly type synonym] above.
1039 exactTyVarsOfType ty
1042 go ty | Just ty' <- tcView ty = go ty' -- This is the key line
1043 go (TyVarTy tv) = unitVarSet tv
1044 go (TyConApp tycon tys) = exactTyVarsOfTypes tys
1045 go (PredTy ty) = go_pred ty
1046 go (FunTy arg res) = go arg `unionVarSet` go res
1047 go (AppTy fun arg) = go fun `unionVarSet` go arg
1048 go (ForAllTy tyvar ty) = delVarSet (go ty) tyvar
1049 `unionVarSet` go_tv tyvar
1051 go_pred (IParam _ ty) = go ty
1052 go_pred (ClassP _ tys) = exactTyVarsOfTypes tys
1053 go_pred (EqPred ty1 ty2) = go ty1 `unionVarSet` go ty2
1055 go_tv tyvar | isCoVar tyvar = go (tyVarKind tyvar)
1056 | otherwise = emptyVarSet
1058 exactTyVarsOfTypes :: [TcType] -> TyVarSet
1059 exactTyVarsOfTypes tys = foldr (unionVarSet . exactTyVarsOfType) emptyVarSet tys
1062 Find the free tycons and classes of a type. This is used in the front
1063 end of the compiler.
1066 tyClsNamesOfType :: Type -> NameSet
1067 tyClsNamesOfType (TyVarTy tv) = emptyNameSet
1068 tyClsNamesOfType (TyConApp tycon tys) = unitNameSet (getName tycon) `unionNameSets` tyClsNamesOfTypes tys
1069 tyClsNamesOfType (NoteTy _ ty2) = tyClsNamesOfType ty2
1070 tyClsNamesOfType (PredTy (IParam n ty)) = tyClsNamesOfType ty
1071 tyClsNamesOfType (PredTy (ClassP cl tys)) = unitNameSet (getName cl) `unionNameSets` tyClsNamesOfTypes tys
1072 tyClsNamesOfType (PredTy (EqPred ty1 ty2)) = tyClsNamesOfType ty1 `unionNameSets` tyClsNamesOfType ty2
1073 tyClsNamesOfType (FunTy arg res) = tyClsNamesOfType arg `unionNameSets` tyClsNamesOfType res
1074 tyClsNamesOfType (AppTy fun arg) = tyClsNamesOfType fun `unionNameSets` tyClsNamesOfType arg
1075 tyClsNamesOfType (ForAllTy tyvar ty) = tyClsNamesOfType ty
1077 tyClsNamesOfTypes tys = foldr (unionNameSets . tyClsNamesOfType) emptyNameSet tys
1079 tyClsNamesOfDFunHead :: Type -> NameSet
1080 -- Find the free type constructors and classes
1081 -- of the head of the dfun instance type
1082 -- The 'dfun_head_type' is because of
1083 -- instance Foo a => Baz T where ...
1084 -- The decl is an orphan if Baz and T are both not locally defined,
1085 -- even if Foo *is* locally defined
1086 tyClsNamesOfDFunHead dfun_ty
1087 = case tcSplitSigmaTy dfun_ty of
1088 (tvs,_,head_ty) -> tyClsNamesOfType head_ty
1090 classesOfTheta :: ThetaType -> [Class]
1091 -- Looks just for ClassP things; maybe it should check
1092 classesOfTheta preds = [ c | ClassP c _ <- preds ]
1096 %************************************************************************
1098 \subsection[TysWiredIn-ext-type]{External types}
1100 %************************************************************************
1102 The compiler's foreign function interface supports the passing of a
1103 restricted set of types as arguments and results (the restricting factor
1107 tcSplitIOType_maybe :: Type -> Maybe (TyCon, Type)
1108 -- (isIOType t) returns (Just (IO,t')) if t is of the form (IO t'), or
1109 -- some newtype wrapping thereof
1110 -- returns Nothing otherwise
1111 tcSplitIOType_maybe ty
1112 | Just (io_tycon, [io_res_ty]) <- tcSplitTyConApp_maybe ty,
1113 -- This split absolutely has to be a tcSplit, because we must
1114 -- see the IO type; and it's a newtype which is transparent to splitTyConApp.
1115 io_tycon `hasKey` ioTyConKey
1116 = Just (io_tycon, io_res_ty)
1118 | Just ty' <- coreView ty -- Look through non-recursive newtypes
1119 = tcSplitIOType_maybe ty'
1124 isFFITy :: Type -> Bool
1125 -- True for any TyCon that can possibly be an arg or result of an FFI call
1126 isFFITy ty = checkRepTyCon legalFFITyCon ty
1128 isFFIArgumentTy :: DynFlags -> Safety -> Type -> Bool
1129 -- Checks for valid argument type for a 'foreign import'
1130 isFFIArgumentTy dflags safety ty
1131 = checkRepTyCon (legalOutgoingTyCon dflags safety) ty
1133 isFFIExternalTy :: Type -> Bool
1134 -- Types that are allowed as arguments of a 'foreign export'
1135 isFFIExternalTy ty = checkRepTyCon legalFEArgTyCon ty
1137 isFFIImportResultTy :: DynFlags -> Type -> Bool
1138 isFFIImportResultTy dflags ty
1139 = checkRepTyCon (legalFIResultTyCon dflags) ty
1141 isFFIExportResultTy :: Type -> Bool
1142 isFFIExportResultTy ty = checkRepTyCon legalFEResultTyCon ty
1144 isFFIDynArgumentTy :: Type -> Bool
1145 -- The argument type of a foreign import dynamic must be Ptr, FunPtr, Addr,
1146 -- or a newtype of either.
1147 isFFIDynArgumentTy = checkRepTyConKey [ptrTyConKey, funPtrTyConKey]
1149 isFFIDynResultTy :: Type -> Bool
1150 -- The result type of a foreign export dynamic must be Ptr, FunPtr, Addr,
1151 -- or a newtype of either.
1152 isFFIDynResultTy = checkRepTyConKey [ptrTyConKey, funPtrTyConKey]
1154 isFFILabelTy :: Type -> Bool
1155 -- The type of a foreign label must be Ptr, FunPtr, Addr,
1156 -- or a newtype of either.
1157 isFFILabelTy = checkRepTyConKey [ptrTyConKey, funPtrTyConKey]
1159 isFFIDotnetTy :: DynFlags -> Type -> Bool
1160 isFFIDotnetTy dflags ty
1161 = checkRepTyCon (\ tc -> (legalFIResultTyCon dflags tc ||
1162 isFFIDotnetObjTy ty || isStringTy ty)) ty
1164 -- Support String as an argument or result from a .NET FFI call.
1166 case tcSplitTyConApp_maybe (repType ty) of
1168 | tc == listTyCon ->
1169 case tcSplitTyConApp_maybe (repType arg_ty) of
1170 Just (cc,[]) -> cc == charTyCon
1174 -- Support String as an argument or result from a .NET FFI call.
1175 isFFIDotnetObjTy ty =
1177 (_, t_ty) = tcSplitForAllTys ty
1179 case tcSplitTyConApp_maybe (repType t_ty) of
1180 Just (tc, [arg_ty]) | getName tc == objectTyConName -> True
1183 toDNType :: Type -> DNType
1185 | isStringTy ty = DNString
1186 | isFFIDotnetObjTy ty = DNObject
1187 | Just (tc,argTys) <- tcSplitTyConApp_maybe ty
1188 = case lookup (getUnique tc) dn_assoc of
1191 | tc `hasKey` ioTyConKey -> toDNType (head argTys)
1192 | otherwise -> pprPanic ("toDNType: unsupported .NET type")
1193 (pprType ty <+> parens (hcat (map pprType argTys)) <+> ppr tc)
1194 | otherwise = panic "toDNType" -- Is this right?
1196 dn_assoc :: [ (Unique, DNType) ]
1197 dn_assoc = [ (unitTyConKey, DNUnit)
1198 , (intTyConKey, DNInt)
1199 , (int8TyConKey, DNInt8)
1200 , (int16TyConKey, DNInt16)
1201 , (int32TyConKey, DNInt32)
1202 , (int64TyConKey, DNInt64)
1203 , (wordTyConKey, DNInt)
1204 , (word8TyConKey, DNWord8)
1205 , (word16TyConKey, DNWord16)
1206 , (word32TyConKey, DNWord32)
1207 , (word64TyConKey, DNWord64)
1208 , (floatTyConKey, DNFloat)
1209 , (doubleTyConKey, DNDouble)
1210 , (ptrTyConKey, DNPtr)
1211 , (funPtrTyConKey, DNPtr)
1212 , (charTyConKey, DNChar)
1213 , (boolTyConKey, DNBool)
1216 checkRepTyCon :: (TyCon -> Bool) -> Type -> Bool
1217 -- Look through newtypes
1218 -- Non-recursive ones are transparent to splitTyConApp,
1219 -- but recursive ones aren't. Manuel had:
1220 -- newtype T = MkT (Ptr T)
1221 -- and wanted it to work...
1222 checkRepTyCon check_tc ty
1223 | Just (tc,_) <- splitTyConApp_maybe (repType ty) = check_tc tc
1226 checkRepTyConKey :: [Unique] -> Type -> Bool
1227 -- Like checkRepTyCon, but just looks at the TyCon key
1228 checkRepTyConKey keys
1229 = checkRepTyCon (\tc -> tyConUnique tc `elem` keys)
1232 ----------------------------------------------
1233 These chaps do the work; they are not exported
1234 ----------------------------------------------
1237 legalFEArgTyCon :: TyCon -> Bool
1239 -- It's illegal to make foreign exports that take unboxed
1240 -- arguments. The RTS API currently can't invoke such things. --SDM 7/2000
1241 = boxedMarshalableTyCon tc
1243 legalFIResultTyCon :: DynFlags -> TyCon -> Bool
1244 legalFIResultTyCon dflags tc
1245 | tc == unitTyCon = True
1246 | otherwise = marshalableTyCon dflags tc
1248 legalFEResultTyCon :: TyCon -> Bool
1249 legalFEResultTyCon tc
1250 | tc == unitTyCon = True
1251 | otherwise = boxedMarshalableTyCon tc
1253 legalOutgoingTyCon :: DynFlags -> Safety -> TyCon -> Bool
1254 -- Checks validity of types going from Haskell -> external world
1255 legalOutgoingTyCon dflags safety tc
1256 = marshalableTyCon dflags tc
1258 legalFFITyCon :: TyCon -> Bool
1259 -- True for any TyCon that can possibly be an arg or result of an FFI call
1261 = isUnLiftedTyCon tc || boxedMarshalableTyCon tc || tc == unitTyCon
1263 marshalableTyCon dflags tc
1264 = (dopt Opt_GlasgowExts dflags && isUnLiftedTyCon tc)
1265 || boxedMarshalableTyCon tc
1267 boxedMarshalableTyCon tc
1268 = getUnique tc `elem` [ intTyConKey, int8TyConKey, int16TyConKey
1269 , int32TyConKey, int64TyConKey
1270 , wordTyConKey, word8TyConKey, word16TyConKey
1271 , word32TyConKey, word64TyConKey
1272 , floatTyConKey, doubleTyConKey
1273 , ptrTyConKey, funPtrTyConKey