2 % (c) The AQUA Project, Glasgow University, 1998
4 \section[StdIdInfo]{Standard unfoldings}
6 This module contains definitions for the IdInfo for things that
7 have a standard form, namely:
11 * method and superclass selectors
12 * primitive operations
16 mkSpecPragmaId, mkWorkerId,
18 mkDictFunId, mkDefaultMethodId,
21 mkDataConId, mkDataConWrapId,
23 mkPrimOpId, mkCCallOpId,
25 -- And some particular Ids; see below for why they are wired in
27 unsafeCoerceId, realWorldPrimId,
28 eRROR_ID, rEC_SEL_ERROR_ID, pAT_ERROR_ID, rEC_CON_ERROR_ID,
29 rEC_UPD_ERROR_ID, iRREFUT_PAT_ERROR_ID, nON_EXHAUSTIVE_GUARDS_ERROR_ID,
30 nO_METHOD_BINDING_ERROR_ID, aBSENT_ERROR_ID, pAR_ERROR_ID
33 #include "HsVersions.h"
36 import TysPrim ( openAlphaTyVars, alphaTyVar, alphaTy,
37 intPrimTy, realWorldStatePrimTy
39 import TysWiredIn ( boolTy, charTy, mkListTy )
40 import PrelNames ( pREL_ERR, pREL_GHC )
41 import PrelRules ( primOpRule )
42 import Rules ( addRule )
43 import Type ( Type, ClassContext, mkDictTy, mkDictTys, mkTyConApp, mkTyVarTys,
44 mkFunTys, mkFunTy, mkSigmaTy, classesToPreds,
45 isUnLiftedType, mkForAllTys, mkTyVarTy, tyVarsOfType, tyVarsOfTypes,
46 splitSigmaTy, splitFunTy_maybe,
47 splitFunTys, splitForAllTys, unUsgTy,
50 import PprType ( pprParendType )
51 import Module ( Module )
52 import CoreUtils ( exprType, mkInlineMe )
53 import CoreUnfold ( mkTopUnfolding, mkCompulsoryUnfolding, mkOtherCon )
54 import Literal ( Literal(..) )
55 import Subst ( mkTopTyVarSubst, substClasses )
56 import TyCon ( TyCon, isNewTyCon, tyConTyVars, tyConDataCons, isDataTyCon,
57 tyConTheta, isProductTyCon, isUnboxedTupleTyCon )
58 import Class ( Class, classBigSig, classTyCon, classTyVars, classSelIds )
59 import Var ( Id, TyVar )
60 import VarSet ( isEmptyVarSet )
61 import Name ( mkDerivedName, mkWiredInIdName, mkLocalName,
62 mkWorkerOcc, mkSuperDictSelOcc, mkCCallName,
65 import OccName ( mkSrcVarOcc )
66 import PrimOp ( PrimOp(DataToTagOp, CCallOp),
67 primOpSig, mkPrimOpIdName,
70 import Demand ( wwStrict, wwPrim, mkStrictnessInfo )
71 import DataCon ( DataCon, StrictnessMark(..),
72 dataConFieldLabels, dataConRepArity, dataConTyCon,
73 dataConArgTys, dataConRepType, dataConRepStrictness,
74 dataConName, dataConTheta,
75 dataConSig, dataConStrictMarks, dataConId
77 import Id ( idType, mkId,
78 mkVanillaId, mkTemplateLocals,
79 mkTemplateLocal, setInlinePragma, idCprInfo
81 import IdInfo ( IdInfo, vanillaIdInfo, mkIdInfo,
82 exactArity, setUnfoldingInfo, setCafInfo, setCprInfo,
83 setArityInfo, setInlinePragInfo, setSpecInfo,
84 mkStrictnessInfo, setStrictnessInfo,
85 IdFlavour(..), InlinePragInfo(..), CafInfo(..), StrictnessInfo(..), CprInfo(..)
87 import FieldLabel ( FieldLabel, FieldLabelTag, mkFieldLabel, fieldLabelName,
88 firstFieldLabelTag, allFieldLabelTags, fieldLabelType
92 import BasicTypes ( Arity )
94 import Maybe ( isJust )
101 %************************************************************************
103 \subsection{Wired in Ids}
105 %************************************************************************
109 = [ -- These error-y things are wired in because we don't yet have
110 -- a way to express in an interface file that the result type variable
111 -- is 'open'; that is can be unified with an unboxed type
113 -- [The interface file format now carry such information, but there's
114 -- no way yet of expressing at the definition site for these error-reporting
115 -- functions that they have an 'open' result type. -- sof 1/99]
119 , iRREFUT_PAT_ERROR_ID
120 , nON_EXHAUSTIVE_GUARDS_ERROR_ID
121 , nO_METHOD_BINDING_ERROR_ID
127 -- These two can't be defined in Haskell
134 %************************************************************************
136 \subsection{Easy ones}
138 %************************************************************************
141 mkSpecPragmaId occ uniq ty loc
142 = mkId (mkLocalName uniq occ loc) ty (mkIdInfo SpecPragmaId)
143 -- Maybe a SysLocal? But then we'd lose the location
145 mkDefaultMethodId dm_name rec_c ty
146 = mkVanillaId dm_name ty
148 mkWorkerId uniq unwrkr ty
149 = mkVanillaId (mkDerivedName mkWorkerOcc (getName unwrkr) uniq) ty
152 %************************************************************************
154 \subsection{Data constructors}
156 %************************************************************************
159 mkDataConId :: Name -> DataCon -> Id
160 -- Makes the *worker* for the data constructor; that is, the function
161 -- that takes the reprsentation arguments and builds the constructor.
162 mkDataConId work_name data_con
163 = mkId work_name (dataConRepType data_con) info
165 info = mkIdInfo (DataConId data_con)
166 `setArityInfo` exactArity arity
167 `setStrictnessInfo` strict_info
168 `setCprInfo` cpr_info
170 arity = dataConRepArity data_con
172 strict_info = mkStrictnessInfo (dataConRepStrictness data_con, False)
174 cpr_info | isProductTyCon tycon &&
175 not (isUnboxedTupleTyCon tycon) &&
176 arity > 0 = ReturnsCPR
177 | otherwise = NoCPRInfo
179 tycon = dataConTyCon data_con
180 -- Newtypes don't have a worker at all
182 -- If we are a product with 0 args we must be void(like)
183 -- We can't create an unboxed tuple with 0 args for this
184 -- and since Void has only one, constant value it should
185 -- just mean returning a pointer to a pre-existing cell.
186 -- So we won't really gain from doing anything fancy
187 -- and we treat this case as Top.
190 The wrapper for a constructor is an ordinary top-level binding that evaluates
191 any strict args, unboxes any args that are going to be flattened, and calls
194 We're going to build a constructor that looks like:
196 data (Data a, C b) => T a b = T1 !a !Int b
199 \d1::Data a, d2::C b ->
200 \p q r -> case p of { p ->
202 Con T1 [a,b] [p,q,r]}}
206 * d2 is thrown away --- a context in a data decl is used to make sure
207 one *could* construct dictionaries at the site the constructor
208 is used, but the dictionary isn't actually used.
210 * We have to check that we can construct Data dictionaries for
211 the types a and Int. Once we've done that we can throw d1 away too.
213 * We use (case p of q -> ...) to evaluate p, rather than "seq" because
214 all that matters is that the arguments are evaluated. "seq" is
215 very careful to preserve evaluation order, which we don't need
218 You might think that we could simply give constructors some strictness
219 info, like PrimOps, and let CoreToStg do the let-to-case transformation.
220 But we don't do that because in the case of primops and functions strictness
221 is a *property* not a *requirement*. In the case of constructors we need to
222 do something active to evaluate the argument.
224 Making an explicit case expression allows the simplifier to eliminate
225 it in the (common) case where the constructor arg is already evaluated.
228 mkDataConWrapId data_con
231 wrap_id = mkId (dataConName data_con) wrap_ty info
232 work_id = dataConId data_con
234 info = mkIdInfo (DataConWrapId data_con)
235 `setUnfoldingInfo` mkTopUnfolding (mkInlineMe wrap_rhs)
236 `setCprInfo` cpr_info
237 -- The Cpr info can be important inside INLINE rhss, where the
238 -- wrapper constructor isn't inlined
239 `setArityInfo` exactArity arity
240 -- It's important to specify the arity, so that partial
241 -- applications are treated as values
242 `setCafInfo` NoCafRefs
243 -- The wrapper Id ends up in STG code as an argument,
244 -- sometimes before its definition, so we want to
245 -- signal that it has no CAFs
247 wrap_ty = mkForAllTys all_tyvars $
251 cpr_info = idCprInfo work_id
253 wrap_rhs | isNewTyCon tycon
254 = ASSERT( null ex_tyvars && null ex_dict_args && length orig_arg_tys == 1 )
255 -- No existentials on a newtype, but it can have a contex
256 -- e.g. newtype Eq a => T a = MkT (...)
258 mkLams tyvars $ mkLams dict_args $ Lam id_arg1 $
259 Note (Coerce result_ty (head orig_arg_tys)) (Var id_arg1)
261 {- I nuked this because map (:) xs would create a
262 new local lambda for the (:) in core-to-stg.
263 There isn't a defn for the worker!
265 | null dict_args && all not_marked_strict strict_marks
266 = Var work_id -- The common case. Not only is this efficient,
267 -- but it also ensures that the wrapper is replaced
268 -- by the worker even when there are no args.
272 -- This is really important in rule matching,
273 -- which is a bit sad. (We could match on the wrappers,
274 -- but that makes it less likely that rules will match
275 -- when we bring bits of unfoldings together
279 = mkLams all_tyvars $ mkLams dict_args $
280 mkLams ex_dict_args $ mkLams id_args $
281 foldr mk_case con_app
282 (zip (ex_dict_args++id_args) strict_marks) i3 []
284 con_app i rep_ids = mkApps (Var work_id)
285 (map varToCoreExpr (all_tyvars ++ reverse rep_ids))
287 (tyvars, theta, ex_tyvars, ex_theta, orig_arg_tys, tycon) = dataConSig data_con
288 all_tyvars = tyvars ++ ex_tyvars
290 dict_tys = mkDictTys theta
291 ex_dict_tys = mkDictTys ex_theta
292 all_arg_tys = dict_tys ++ ex_dict_tys ++ orig_arg_tys
293 result_ty = mkTyConApp tycon (mkTyVarTys tyvars)
295 mkLocals i tys = (zipWith mkTemplateLocal [i..i+n-1] tys, i+n)
299 (dict_args, i1) = mkLocals 1 dict_tys
300 (ex_dict_args,i2) = mkLocals i1 ex_dict_tys
301 (id_args,i3) = mkLocals i2 orig_arg_tys
303 (id_arg1:_) = id_args -- Used for newtype only
305 strict_marks = dataConStrictMarks data_con
306 not_marked_strict NotMarkedStrict = True
307 not_marked_strict other = False
311 :: (Id, StrictnessMark) -- arg, strictness
312 -> (Int -> [Id] -> CoreExpr) -- body
313 -> Int -- next rep arg id
314 -> [Id] -- rep args so far
316 mk_case (arg,strict) body i rep_args
318 NotMarkedStrict -> body i (arg:rep_args)
320 | isUnLiftedType (idType arg) -> body i (arg:rep_args)
322 Case (Var arg) arg [(DEFAULT,[], body i (arg:rep_args))]
324 MarkedUnboxed con tys ->
325 Case (Var arg) arg [(DataAlt con, con_args,
326 body i' (reverse con_args++rep_args))]
327 where n_tys = length tys
328 (con_args,i') = mkLocals i tys
332 %************************************************************************
334 \subsection{Record selectors}
336 %************************************************************************
338 We're going to build a record selector unfolding that looks like this:
340 data T a b c = T1 { ..., op :: a, ...}
341 | T2 { ..., op :: a, ...}
344 sel = /\ a b c -> \ d -> case d of
349 Similarly for newtypes
351 newtype N a = MkN { unN :: a->a }
354 unN n = coerce (a->a) n
356 We need to take a little care if the field has a polymorphic type:
358 data R = R { f :: forall a. a->a }
362 f :: forall a. R -> a -> a
363 f = /\ a \ r = case r of
366 (not f :: R -> forall a. a->a, which gives the type inference mechanism
367 problems at call sites)
369 Similarly for newtypes
371 newtype N = MkN { unN :: forall a. a->a }
373 unN :: forall a. N -> a -> a
374 unN = /\a -> \n:N -> coerce (a->a) n
377 mkRecordSelId tycon field_label unpack_id
378 -- Assumes that all fields with the same field label have the same type
380 -- Annoyingly, we have to pass in the unpackCString# Id, because
381 -- we can't conjure it up out of thin air
384 sel_id = mkId (fieldLabelName field_label) selector_ty info
386 field_ty = fieldLabelType field_label
387 field_name = fieldLabelName field_label
388 data_cons = tyConDataCons tycon
389 tyvars = tyConTyVars tycon -- These scope over the types in
390 -- the FieldLabels of constructors of this type
391 tycon_theta = tyConTheta tycon -- The context on the data decl
392 -- eg data (Eq a, Ord b) => T a b = ...
393 (field_tyvars,field_tau) = splitForAllTys field_ty
395 data_ty = mkTyConApp tycon tyvar_tys
396 tyvar_tys = mkTyVarTys tyvars
398 -- Very tiresomely, the selectors are (unnecessarily!) overloaded over
399 -- just the dictionaries in the types of the constructors that contain
400 -- the relevant field. Urgh.
401 -- NB: this code relies on the fact that DataCons are quantified over
402 -- the identical type variables as their parent TyCon
403 dict_tys = [mkDictTy cls tys | (cls, tys) <- tycon_theta, needed_dict (cls, tys)]
404 needed_dict pred = or [ pred `elem` (dataConTheta dc)
405 | (DataAlt dc, _, _) <- the_alts]
408 selector_ty = mkForAllTys tyvars $ mkForAllTys field_tyvars $
409 mkFunTys dict_tys $ mkFunTy data_ty field_tau
411 info = mkIdInfo (RecordSelId field_label)
412 `setArityInfo` exactArity 1
413 `setUnfoldingInfo` unfolding
414 `setCafInfo` NoCafRefs
415 -- ToDo: consider adding further IdInfo
417 unfolding = mkTopUnfolding sel_rhs
420 (data_id:dict_ids) = mkTemplateLocals (data_ty:dict_tys)
421 alts = map mk_maybe_alt data_cons
422 the_alts = catMaybes alts
423 default_alt | all isJust alts = [] -- No default needed
424 | otherwise = [(DEFAULT, [], error_expr)]
426 sel_rhs | isNewTyCon tycon = new_sel_rhs
427 | otherwise = data_sel_rhs
429 data_sel_rhs = mkLams tyvars $ mkLams field_tyvars $
430 mkLams dict_ids $ Lam data_id $
431 Case (Var data_id) data_id (the_alts ++ default_alt)
433 new_sel_rhs = mkLams tyvars $ mkLams field_tyvars $ Lam data_id $
434 Note (Coerce (unUsgTy field_tau) (unUsgTy data_ty)) (Var data_id)
436 mk_maybe_alt data_con
437 = case maybe_the_arg_id of
439 Just the_arg_id -> Just (DataAlt data_con, arg_ids,
440 mkVarApps (Var the_arg_id) field_tyvars)
442 arg_ids = mkTemplateLocals (dataConArgTys data_con tyvar_tys)
443 -- The first one will shadow data_id, but who cares
444 field_lbls = dataConFieldLabels data_con
445 maybe_the_arg_id = assocMaybe (field_lbls `zip` arg_ids) field_label
447 error_expr = mkApps (Var rEC_SEL_ERROR_ID) [Type (unUsgTy field_tau), err_string]
448 -- preserves invariant that type args are *not* usage-annotated on top. KSW 1999-04.
449 err_string = App (Var unpack_id) (Lit (MachStr (_PK_ full_msg)))
450 full_msg = showSDoc (sep [text "No match in record selector", ppr sel_id])
454 %************************************************************************
456 \subsection{Dictionary selectors}
458 %************************************************************************
460 Selecting a field for a dictionary. If there is just one field, then
461 there's nothing to do.
463 ToDo: unify with mkRecordSelId.
466 mkDictSelId :: Name -> Class -> Id
467 mkDictSelId name clas
471 sel_id = mkId name ty info
472 field_lbl = mkFieldLabel name tycon ty tag
473 tag = assoc "MkId.mkDictSelId" (classSelIds clas `zip` allFieldLabelTags) sel_id
475 info = mkIdInfo (RecordSelId field_lbl)
476 `setArityInfo` exactArity 1
477 `setUnfoldingInfo` unfolding
478 `setCafInfo` NoCafRefs
480 -- We no longer use 'must-inline' on record selectors. They'll
481 -- inline like crazy if they scrutinise a constructor
483 unfolding = mkTopUnfolding rhs
485 tyvars = classTyVars clas
487 tycon = classTyCon clas
488 [data_con] = tyConDataCons tycon
489 tyvar_tys = mkTyVarTys tyvars
490 arg_tys = dataConArgTys data_con tyvar_tys
491 the_arg_id = arg_ids !! (tag - firstFieldLabelTag)
493 dict_ty = mkDictTy clas tyvar_tys
494 (dict_id:arg_ids) = mkTemplateLocals (dict_ty : arg_tys)
496 rhs | isNewTyCon tycon = mkLams tyvars $ Lam dict_id $
497 Note (Coerce (head arg_tys) dict_ty) (Var dict_id)
498 | otherwise = mkLams tyvars $ Lam dict_id $
499 Case (Var dict_id) dict_id
500 [(DataAlt data_con, arg_ids, Var the_arg_id)]
504 %************************************************************************
506 \subsection{Primitive operations
508 %************************************************************************
511 mkPrimOpId :: PrimOp -> Id
515 (tyvars,arg_tys,res_ty, arity, strict_info) = primOpSig prim_op
516 ty = mkForAllTys tyvars (mkFunTys arg_tys res_ty)
517 name = mkPrimOpIdName prim_op id
518 id = mkId name ty info
520 info = mkIdInfo (PrimOpId prim_op)
522 `setArityInfo` exactArity arity
523 `setStrictnessInfo` strict_info
525 rules = addRule id emptyCoreRules (primOpRule prim_op)
528 -- For each ccall we manufacture a separate CCallOpId, giving it
529 -- a fresh unique, a type that is correct for this particular ccall,
530 -- and a CCall structure that gives the correct details about calling
533 -- The *name* of this Id is a local name whose OccName gives the full
534 -- details of the ccall, type and all. This means that the interface
535 -- file reader can reconstruct a suitable Id
537 mkCCallOpId :: Unique -> CCall -> Type -> Id
538 mkCCallOpId uniq ccall ty
539 = ASSERT( isEmptyVarSet (tyVarsOfType ty) )
540 -- A CCallOpId should have no free type variables;
541 -- when doing substitutions won't substitute over it
544 occ_str = showSDocIface (braces (pprCCallOp ccall <+> ppr ty))
545 -- The "occurrence name" of a ccall is the full info about the
546 -- ccall; it is encoded, but may have embedded spaces etc!
548 name = mkCCallName uniq occ_str
549 prim_op = CCallOp ccall
551 info = mkIdInfo (PrimOpId prim_op)
552 `setArityInfo` exactArity arity
553 `setStrictnessInfo` strict_info
555 (_, tau) = splitForAllTys ty
556 (arg_tys, _) = splitFunTys tau
557 arity = length arg_tys
558 strict_info = mkStrictnessInfo (take arity (repeat wwPrim), False)
562 %************************************************************************
564 \subsection{DictFuns}
566 %************************************************************************
569 mkDictFunId :: Name -- Name to use for the dict fun;
576 mkDictFunId dfun_name clas inst_tyvars inst_tys inst_decl_theta
577 = mkVanillaId dfun_name dfun_ty
579 (class_tyvars, sc_theta, _, _) = classBigSig clas
580 sc_theta' = substClasses (mkTopTyVarSubst class_tyvars inst_tys) sc_theta
582 dfun_theta = classesToPreds inst_decl_theta
584 {- 1 dec 99: disable the Mark Jones optimisation for the sake
585 of compatibility with Hugs.
586 See `types/InstEnv' for a discussion related to this.
588 dfun_theta = case inst_decl_theta of
589 [] -> [] -- If inst_decl_theta is empty, then we don't
590 -- want to have any dict arguments, so that we can
591 -- expose the constant methods.
593 other -> nub (inst_decl_theta ++ filter not_const sc_theta')
594 -- Otherwise we pass the superclass dictionaries to
595 -- the dictionary function; the Mark Jones optimisation.
597 -- NOTE the "nub". I got caught by this one:
598 -- class Monad m => MonadT t m where ...
599 -- instance Monad m => MonadT (EnvT env) m where ...
600 -- Here, the inst_decl_theta has (Monad m); but so
601 -- does the sc_theta'!
603 -- NOTE the "not_const". I got caught by this one too:
604 -- class Foo a => Baz a b where ...
605 -- instance Wob b => Baz T b where..
606 -- Now sc_theta' has Foo T
608 dfun_ty = mkSigmaTy inst_tyvars dfun_theta (mkDictTy clas inst_tys)
610 not_const (clas, tys) = not (isEmptyVarSet (tyVarsOfTypes tys))
614 %************************************************************************
616 \subsection{Un-definable}
618 %************************************************************************
620 These two can't be defined in Haskell.
622 unsafeCoerce# isn't so much a PrimOp as a phantom identifier, that
623 just gets expanded into a type coercion wherever it occurs. Hence we
624 add it as a built-in Id with an unfolding here.
626 The type variables we use here are "open" type variables: this means
627 they can unify with both unlifted and lifted types. Hence we provide
628 another gun with which to shoot yourself in the foot.
632 = pcMiscPrelId unsafeCoerceIdKey pREL_GHC SLIT("unsafeCoerce#") ty info
635 `setUnfoldingInfo` mkCompulsoryUnfolding rhs
638 ty = mkForAllTys [openAlphaTyVar,openBetaTyVar]
639 (mkFunTy openAlphaTy openBetaTy)
640 [x] = mkTemplateLocals [openAlphaTy]
641 rhs = mkLams [openAlphaTyVar,openBetaTyVar,x] $
642 Note (Coerce openBetaTy openAlphaTy) (Var x)
646 @getTag#@ is another function which can't be defined in Haskell. It needs to
647 evaluate its argument and call the dataToTag# primitive.
651 = pcMiscPrelId getTagIdKey pREL_GHC SLIT("getTag#") ty info
654 `setUnfoldingInfo` mkCompulsoryUnfolding rhs
655 -- We don't provide a defn for this; you must inline it
657 ty = mkForAllTys [alphaTyVar] (mkFunTy alphaTy intPrimTy)
658 [x,y] = mkTemplateLocals [alphaTy,alphaTy]
659 rhs = mkLams [alphaTyVar,x] $
660 Case (Var x) y [ (DEFAULT, [], mkApps (Var dataToTagId) [Type alphaTy, Var y]) ]
662 dataToTagId = mkPrimOpId DataToTagOp
665 @realWorld#@ used to be a magic literal, \tr{void#}. If things get
666 nasty as-is, change it back to a literal (@Literal@).
669 realWorldPrimId -- :: State# RealWorld
670 = pcMiscPrelId realWorldPrimIdKey pREL_GHC SLIT("realWorld#")
672 (noCafIdInfo `setUnfoldingInfo` mkOtherCon [])
673 -- The mkOtherCon makes it look that realWorld# is evaluated
674 -- which in turn makes Simplify.interestingArg return True,
675 -- which in turn makes INLINE things applied to realWorld# likely
680 %************************************************************************
682 \subsection[PrelVals-error-related]{@error@ and friends; @trace@}
684 %************************************************************************
686 GHC randomly injects these into the code.
688 @patError@ is just a version of @error@ for pattern-matching
689 failures. It knows various ``codes'' which expand to longer
690 strings---this saves space!
692 @absentErr@ is a thing we put in for ``absent'' arguments. They jolly
693 well shouldn't be yanked on, but if one is, then you will get a
694 friendly message from @absentErr@ (rather than a totally random
697 @parError@ is a special version of @error@ which the compiler does
698 not know to be a bottoming Id. It is used in the @_par_@ and @_seq_@
699 templates, but we don't ever expect to generate code for it.
703 = pc_bottoming_Id errorIdKey pREL_ERR SLIT("error") errorTy
705 = generic_ERROR_ID patErrorIdKey SLIT("patError")
707 = generic_ERROR_ID recSelErrIdKey SLIT("recSelError")
709 = generic_ERROR_ID recConErrorIdKey SLIT("recConError")
711 = generic_ERROR_ID recUpdErrorIdKey SLIT("recUpdError")
713 = generic_ERROR_ID irrefutPatErrorIdKey SLIT("irrefutPatError")
714 nON_EXHAUSTIVE_GUARDS_ERROR_ID
715 = generic_ERROR_ID nonExhaustiveGuardsErrorIdKey SLIT("nonExhaustiveGuardsError")
716 nO_METHOD_BINDING_ERROR_ID
717 = generic_ERROR_ID noMethodBindingErrorIdKey SLIT("noMethodBindingError")
720 = pc_bottoming_Id absentErrorIdKey pREL_ERR SLIT("absentErr")
721 (mkSigmaTy [openAlphaTyVar] [] openAlphaTy)
724 = pcMiscPrelId parErrorIdKey pREL_ERR SLIT("parError")
725 (mkSigmaTy [openAlphaTyVar] [] openAlphaTy) noCafIdInfo
730 %************************************************************************
732 \subsection{Utilities}
734 %************************************************************************
737 pcMiscPrelId :: Unique{-IdKey-} -> Module -> FAST_STRING -> Type -> IdInfo -> Id
738 pcMiscPrelId key mod str ty info
740 name = mkWiredInIdName key mod (mkSrcVarOcc str) imp
741 imp = mkId name ty info -- the usual case...
744 -- We lie and say the thing is imported; otherwise, we get into
745 -- a mess with dependency analysis; e.g., core2stg may heave in
746 -- random calls to GHCbase.unpackPS__. If GHCbase is the module
747 -- being compiled, then it's just a matter of luck if the definition
748 -- will be in "the right place" to be in scope.
750 pc_bottoming_Id key mod name ty
751 = pcMiscPrelId key mod name ty bottoming_info
753 bottoming_info = noCafIdInfo
754 `setStrictnessInfo` mkStrictnessInfo ([wwStrict], True)
756 -- these "bottom" out, no matter what their arguments
758 generic_ERROR_ID u n = pc_bottoming_Id u pREL_ERR n errorTy
761 noCafIdInfo = vanillaIdInfo `setCafInfo` NoCafRefs
763 (openAlphaTyVar:openBetaTyVar:_) = openAlphaTyVars
764 openAlphaTy = mkTyVarTy openAlphaTyVar
765 openBetaTy = mkTyVarTy openBetaTyVar
768 errorTy = mkUsgTy UsMany $
769 mkSigmaTy [openAlphaTyVar] [] (mkFunTys [mkUsgTy UsOnce (mkListTy charTy)]
770 (mkUsgTy UsMany openAlphaTy))
771 -- Notice the openAlphaTyVar. It says that "error" can be applied
772 -- to unboxed as well as boxed types. This is OK because it never
773 -- returns, so the return type is irrelevant.