2 % (c) The University of Glasgow 2006
3 % (c) The AQUA Project, Glasgow University, 1998
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 mkDictFunId, mkDefaultMethodId,
21 mkPrimOpId, mkFCallId,
23 mkReboxingAlt, wrapNewTypeBody, unwrapNewTypeBody,
24 mkUnpackCase, mkProductBox,
26 -- And some particular Ids; see below for why they are wired in
27 wiredInIds, ghcPrimIds,
28 unsafeCoerceId, realWorldPrimId, voidArgId, nullAddrId, seqId,
29 lazyId, lazyIdUnfolding, lazyIdKey,
32 rEC_CON_ERROR_ID, iRREFUT_PAT_ERROR_ID, rUNTIME_ERROR_ID,
33 nON_EXHAUSTIVE_GUARDS_ERROR_ID, nO_METHOD_BINDING_ERROR_ID,
34 pAT_ERROR_ID, eRROR_ID,
39 #include "HsVersions.h"
62 import Var ( Var, TyVar)
70 import BasicTypes hiding ( SuccessFlag(..) )
77 %************************************************************************
79 \subsection{Wired in Ids}
81 %************************************************************************
85 = [ -- These error-y things are wired in because we don't yet have
86 -- a way to express in an interface file that the result type variable
87 -- is 'open'; that is can be unified with an unboxed type
89 -- [The interface file format now carry such information, but there's
90 -- no way yet of expressing at the definition site for these
91 -- error-reporting functions that they have an 'open'
92 -- result type. -- sof 1/99]
94 eRROR_ID, -- This one isn't used anywhere else in the compiler
95 -- But we still need it in wiredInIds so that when GHC
96 -- compiles a program that mentions 'error' we don't
97 -- import its type from the interface file; we just get
98 -- the Id defined here. Which has an 'open-tyvar' type.
101 iRREFUT_PAT_ERROR_ID,
102 nON_EXHAUSTIVE_GUARDS_ERROR_ID,
103 nO_METHOD_BINDING_ERROR_ID,
110 -- These Ids are exported from GHC.Prim
112 = [ -- These can't be defined in Haskell, but they have
113 -- perfectly reasonable unfoldings in Core
121 %************************************************************************
123 \subsection{Data constructors}
125 %************************************************************************
127 The wrapper for a constructor is an ordinary top-level binding that evaluates
128 any strict args, unboxes any args that are going to be flattened, and calls
131 We're going to build a constructor that looks like:
133 data (Data a, C b) => T a b = T1 !a !Int b
136 \d1::Data a, d2::C b ->
137 \p q r -> case p of { p ->
139 Con T1 [a,b] [p,q,r]}}
143 * d2 is thrown away --- a context in a data decl is used to make sure
144 one *could* construct dictionaries at the site the constructor
145 is used, but the dictionary isn't actually used.
147 * We have to check that we can construct Data dictionaries for
148 the types a and Int. Once we've done that we can throw d1 away too.
150 * We use (case p of q -> ...) to evaluate p, rather than "seq" because
151 all that matters is that the arguments are evaluated. "seq" is
152 very careful to preserve evaluation order, which we don't need
155 You might think that we could simply give constructors some strictness
156 info, like PrimOps, and let CoreToStg do the let-to-case transformation.
157 But we don't do that because in the case of primops and functions strictness
158 is a *property* not a *requirement*. In the case of constructors we need to
159 do something active to evaluate the argument.
161 Making an explicit case expression allows the simplifier to eliminate
162 it in the (common) case where the constructor arg is already evaluated.
164 [Wrappers for data instance tycons]
165 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
166 In the case of data instances, the wrapper also applies the coercion turning
167 the representation type into the family instance type to cast the result of
168 the wrapper. For example, consider the declarations
170 data family Map k :: * -> *
171 data instance Map (a, b) v = MapPair (Map a (Pair b v))
173 The tycon to which the datacon MapPair belongs gets a unique internal name of
174 the form :R123Map, and we call it the representation tycon. In contrast, Map
175 is the family tycon (accessible via tyConFamInst_maybe). The wrapper and work
176 of MapPair get the types
178 $WMapPair :: forall a b v. Map a (Map a b v) -> Map (a, b) v
179 $wMapPair :: forall a b v. Map a (Map a b v) -> :R123Map a b v
181 which implies that the wrapper code will have to apply the coercion moving
182 between representation and family type. It is accessible via
183 tyConFamilyCoercion_maybe and has kind
185 Co123Map a b v :: {Map (a, b) v :=: :R123Map a b v}
187 This coercion is conditionally applied by wrapFamInstBody.
190 mkDataConIds :: Name -> Name -> DataCon -> DataConIds
191 mkDataConIds wrap_name wkr_name data_con
193 = DCIds Nothing nt_work_id -- Newtype, only has a worker
195 | any isMarkedStrict all_strict_marks -- Algebraic, needs wrapper
196 || not (null eq_spec) -- NB: LoadIface.ifaceDeclSubBndrs
197 || isFamInstTyCon tycon -- depends on this test
198 = DCIds (Just alg_wrap_id) wrk_id
200 | otherwise -- Algebraic, no wrapper
201 = DCIds Nothing wrk_id
203 (univ_tvs, ex_tvs, eq_spec,
204 theta, orig_arg_tys) = dataConFullSig data_con
205 tycon = dataConTyCon data_con
207 ----------- Wrapper --------------
208 -- We used to include the stupid theta in the wrapper's args
209 -- but now we don't. Instead the type checker just injects these
210 -- extra constraints where necessary.
211 wrap_tvs = (univ_tvs `minusList` map fst eq_spec) ++ ex_tvs
212 subst = mkTopTvSubst eq_spec
213 famSubst = ASSERT( length (tyConTyVars tycon ) ==
214 length (mkTyVarTys univ_tvs) )
215 zipTopTvSubst (tyConTyVars tycon) (mkTyVarTys univ_tvs)
216 -- substitution mapping the type constructor's type
217 -- arguments to the universals of the data constructor
218 -- (crucial when type checking interfaces)
219 dict_tys = mkPredTys theta
220 result_ty_args = map (substTyVar subst) univ_tvs
221 result_ty = case tyConFamInst_maybe tycon of
222 -- ordinary constructor
223 Nothing -> mkTyConApp tycon result_ty_args
224 -- family instance constructor
227 mkTyConApp familyTyCon ( substTys subst
230 wrap_ty = mkForAllTys wrap_tvs $ mkFunTys dict_tys $
231 mkFunTys orig_arg_tys $ result_ty
232 -- NB: watch out here if you allow user-written equality
233 -- constraints in data constructor signatures
235 ----------- Worker (algebraic data types only) --------------
236 -- The *worker* for the data constructor is the function that
237 -- takes the representation arguments and builds the constructor.
238 wrk_id = mkGlobalId (DataConWorkId data_con) wkr_name
239 (dataConRepType data_con) wkr_info
241 wkr_arity = dataConRepArity data_con
242 wkr_info = noCafIdInfo
243 `setArityInfo` wkr_arity
244 `setAllStrictnessInfo` Just wkr_sig
245 `setUnfoldingInfo` evaldUnfolding -- Record that it's evaluated,
248 wkr_sig = mkStrictSig (mkTopDmdType (replicate wkr_arity topDmd) cpr_info)
249 -- Note [Data-con worker strictness]
250 -- Notice that we do *not* say the worker is strict
251 -- even if the data constructor is declared strict
252 -- e.g. data T = MkT !(Int,Int)
253 -- Why? Because the *wrapper* is strict (and its unfolding has case
254 -- expresssions that do the evals) but the *worker* itself is not.
255 -- If we pretend it is strict then when we see
256 -- case x of y -> $wMkT y
257 -- the simplifier thinks that y is "sure to be evaluated" (because
258 -- $wMkT is strict) and drops the case. No, $wMkT is not strict.
260 -- When the simplifer sees a pattern
261 -- case e of MkT x -> ...
262 -- it uses the dataConRepStrictness of MkT to mark x as evaluated;
263 -- but that's fine... dataConRepStrictness comes from the data con
264 -- not from the worker Id.
266 cpr_info | isProductTyCon tycon &&
269 wkr_arity <= mAX_CPR_SIZE = retCPR
271 -- RetCPR is only true for products that are real data types;
272 -- that is, not unboxed tuples or [non-recursive] newtypes
274 ----------- Workers for newtypes --------------
275 nt_work_id = mkGlobalId (DataConWrapId data_con) wkr_name wrap_ty nt_work_info
276 nt_work_info = noCafIdInfo -- The NoCaf-ness is set by noCafIdInfo
277 `setArityInfo` 1 -- Arity 1
278 `setUnfoldingInfo` newtype_unf
279 newtype_unf = ASSERT( isVanillaDataCon data_con &&
280 isSingleton orig_arg_tys )
281 -- No existentials on a newtype, but it can have a context
282 -- e.g. newtype Eq a => T a = MkT (...)
283 mkCompulsoryUnfolding $
284 mkLams wrap_tvs $ Lam id_arg1 $
285 wrapNewTypeBody tycon result_ty_args
288 id_arg1 = mkTemplateLocal 1 (head orig_arg_tys)
290 ----------- Wrappers for algebraic data types --------------
291 alg_wrap_id = mkGlobalId (DataConWrapId data_con) wrap_name wrap_ty alg_wrap_info
292 alg_wrap_info = noCafIdInfo -- The NoCaf-ness is set by noCafIdInfo
293 `setArityInfo` alg_arity
294 -- It's important to specify the arity, so that partial
295 -- applications are treated as values
296 `setUnfoldingInfo` alg_unf
297 `setAllStrictnessInfo` Just wrap_sig
299 all_strict_marks = dataConExStricts data_con ++ dataConStrictMarks data_con
300 wrap_sig = mkStrictSig (mkTopDmdType arg_dmds cpr_info)
301 arg_dmds = map mk_dmd all_strict_marks
302 mk_dmd str | isMarkedStrict str = evalDmd
303 | otherwise = lazyDmd
304 -- The Cpr info can be important inside INLINE rhss, where the
305 -- wrapper constructor isn't inlined.
306 -- And the argument strictness can be important too; we
307 -- may not inline a contructor when it is partially applied.
309 -- data W = C !Int !Int !Int
310 -- ...(let w = C x in ...(w p q)...)...
311 -- we want to see that w is strict in its two arguments
313 alg_unf = mkTopUnfolding $ Note InlineMe $
315 mkLams dict_args $ mkLams id_args $
316 foldr mk_case con_app
317 (zip (dict_args ++ id_args) all_strict_marks)
320 con_app _ rep_ids = wrapFamInstBody tycon result_ty_args $
321 Var wrk_id `mkTyApps` result_ty_args
323 `mkTyApps` map snd eq_spec
324 `mkVarApps` reverse rep_ids
326 (dict_args,i2) = mkLocals 1 dict_tys
327 (id_args,i3) = mkLocals i2 orig_arg_tys
331 :: (Id, StrictnessMark) -- Arg, strictness
332 -> (Int -> [Id] -> CoreExpr) -- Body
333 -> Int -- Next rep arg id
334 -> [Id] -- Rep args so far, reversed
336 mk_case (arg,strict) body i rep_args
338 NotMarkedStrict -> body i (arg:rep_args)
340 | isUnLiftedType (idType arg) -> body i (arg:rep_args)
342 Case (Var arg) arg result_ty [(DEFAULT,[], body i (arg:rep_args))]
345 -> unboxProduct i (Var arg) (idType arg) the_body
347 the_body i con_args = body i (reverse con_args ++ rep_args)
349 mAX_CPR_SIZE :: Arity
351 -- We do not treat very big tuples as CPR-ish:
352 -- a) for a start we get into trouble because there aren't
353 -- "enough" unboxed tuple types (a tiresome restriction,
355 -- b) more importantly, big unboxed tuples get returned mainly
356 -- on the stack, and are often then allocated in the heap
357 -- by the caller. So doing CPR for them may in fact make
360 mkLocals i tys = (zipWith mkTemplateLocal [i..i+n-1] tys, i+n)
364 -- If the type constructor is a representation type of a data instance, wrap
365 -- the expression into a cast adjusting the expression type, which is an
366 -- instance of the representation type, to the corresponding instance of the
367 -- family instance type.
369 wrapFamInstBody :: TyCon -> [Type] -> CoreExpr -> CoreExpr
370 wrapFamInstBody tycon args result_expr
371 | Just co_con <- tyConFamilyCoercion_maybe tycon
372 = mkCoerce (mkSymCoercion (mkTyConApp co_con args)) result_expr
378 %************************************************************************
380 \subsection{Record selectors}
382 %************************************************************************
384 We're going to build a record selector unfolding that looks like this:
386 data T a b c = T1 { ..., op :: a, ...}
387 | T2 { ..., op :: a, ...}
390 sel = /\ a b c -> \ d -> case d of
395 Similarly for newtypes
397 newtype N a = MkN { unN :: a->a }
400 unN n = coerce (a->a) n
402 We need to take a little care if the field has a polymorphic type:
404 data R = R { f :: forall a. a->a }
408 f :: forall a. R -> a -> a
409 f = /\ a \ r = case r of
412 (not f :: R -> forall a. a->a, which gives the type inference mechanism
413 problems at call sites)
415 Similarly for (recursive) newtypes
417 newtype N = MkN { unN :: forall a. a->a }
419 unN :: forall b. N -> b -> b
420 unN = /\b -> \n:N -> (coerce (forall a. a->a) n)
423 Note [Naughty record selectors]
424 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
425 A "naughty" field is one for which we can't define a record
426 selector, because an existential type variable would escape. For example:
427 data T = forall a. MkT { x,y::a }
428 We obviously can't define
430 Nevertheless we *do* put a RecordSelId into the type environment
431 so that if the user tries to use 'x' as a selector we can bleat
432 helpfully, rather than saying unhelpfully that 'x' is not in scope.
433 Hence the sel_naughty flag, to identify record selectors that don't really exist.
435 In general, a field is naughty if its type mentions a type variable that
436 isn't in the result type of the constructor.
438 Note [GADT record selectors]
439 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~
440 For GADTs, we require that all constructors with a common field 'f' have the same
441 result type (modulo alpha conversion). [Checked in TcTyClsDecls.checkValidTyCon]
444 T1 { f :: a } :: T [a]
445 T2 { f :: a, y :: b } :: T [a]
446 and now the selector takes that type as its argument:
447 f :: forall a. T [a] -> a
451 Note the forall'd tyvars of the selector are just the free tyvars
452 of the result type; there may be other tyvars in the constructor's
453 type (e.g. 'b' in T2).
457 -- Steps for handling "naughty" vs "non-naughty" selectors:
458 -- 1. Determine naughtiness by comparing field type vs result type
459 -- 2. Install naughty ones with selector_ty of type _|_ and fill in mzero for info
460 -- 3. If it's not naughty, do the normal plan.
462 mkRecordSelId :: TyCon -> FieldLabel -> Id
463 mkRecordSelId tycon field_label
464 -- Assumes that all fields with the same field label have the same type
465 | is_naughty = naughty_id
468 is_naughty = not (tyVarsOfType field_ty `subVarSet` res_tv_set)
469 sel_id_details = RecordSelId tycon field_label is_naughty
471 -- Escapist case here for naughty construcotrs
472 -- We give it no IdInfo, and a type of forall a.a (never looked at)
473 naughty_id = mkGlobalId sel_id_details field_label forall_a_a noCafIdInfo
474 forall_a_a = mkForAllTy alphaTyVar (mkTyVarTy alphaTyVar)
476 -- Normal case starts here
477 sel_id = mkGlobalId sel_id_details field_label selector_ty info
478 data_cons = tyConDataCons tycon
479 data_cons_w_field = filter has_field data_cons -- Can't be empty!
480 has_field con = field_label `elem` dataConFieldLabels con
482 con1 = head data_cons_w_field
483 res_tys = dataConResTys con1
484 res_tv_set = tyVarsOfTypes res_tys
485 res_tvs = varSetElems res_tv_set
486 data_ty = mkTyConApp tycon res_tys
487 field_ty = dataConFieldType con1 field_label
489 -- *Very* tiresomely, the selectors are (unnecessarily!) overloaded over
490 -- just the dictionaries in the types of the constructors that contain
491 -- the relevant field. [The Report says that pattern matching on a
492 -- constructor gives the same constraints as applying it.] Urgh.
494 -- However, not all data cons have all constraints (because of
495 -- BuildTyCl.mkDataConStupidTheta). So we need to find all the data cons
496 -- involved in the pattern match and take the union of their constraints.
497 stupid_dict_tys = mkPredTys (dataConsStupidTheta data_cons_w_field)
498 n_stupid_dicts = length stupid_dict_tys
500 (field_tyvars,pre_field_theta,field_tau) = tcSplitSigmaTy field_ty
502 field_theta = filter (not . isEqPred) pre_field_theta
503 field_dict_tys = mkPredTys field_theta
504 n_field_dict_tys = length field_dict_tys
505 -- If the field has a universally quantified type we have to
506 -- be a bit careful. Suppose we have
507 -- data R = R { op :: forall a. Foo a => a -> a }
508 -- Then we can't give op the type
509 -- op :: R -> forall a. Foo a => a -> a
510 -- because the typechecker doesn't understand foralls to the
511 -- right of an arrow. The "right" type to give it is
512 -- op :: forall a. Foo a => R -> a -> a
513 -- But then we must generate the right unfolding too:
514 -- op = /\a -> \dfoo -> \ r ->
517 -- Note that this is exactly the type we'd infer from a user defn
521 selector_ty = mkForAllTys res_tvs $ mkForAllTys field_tyvars $
522 mkFunTys stupid_dict_tys $ mkFunTys field_dict_tys $
523 mkFunTy data_ty field_tau
525 arity = 1 + n_stupid_dicts + n_field_dict_tys
527 (strict_sig, rhs_w_str) = dmdAnalTopRhs sel_rhs
528 -- Use the demand analyser to work out strictness.
529 -- With all this unpackery it's not easy!
532 `setCafInfo` caf_info
534 `setUnfoldingInfo` mkTopUnfolding rhs_w_str
535 `setAllStrictnessInfo` Just strict_sig
537 -- Allocate Ids. We do it a funny way round because field_dict_tys is
538 -- almost always empty. Also note that we use max_dict_tys
539 -- rather than n_dict_tys, because the latter gives an infinite loop:
540 -- n_dict tys depends on the_alts, which depens on arg_ids, which depends
541 -- on arity, which depends on n_dict tys. Sigh! Mega sigh!
542 stupid_dict_ids = mkTemplateLocalsNum 1 stupid_dict_tys
543 max_stupid_dicts = length (tyConStupidTheta tycon)
544 field_dict_base = max_stupid_dicts + 1
545 field_dict_ids = mkTemplateLocalsNum field_dict_base field_dict_tys
546 dict_id_base = field_dict_base + n_field_dict_tys
547 data_id = mkTemplateLocal dict_id_base data_ty
548 arg_base = dict_id_base + 1
550 the_alts :: [CoreAlt]
551 the_alts = map mk_alt data_cons_w_field -- Already sorted by data-con
552 no_default = length data_cons == length data_cons_w_field -- No default needed
554 default_alt | no_default = []
555 | otherwise = [(DEFAULT, [], error_expr)]
557 -- The default branch may have CAF refs, because it calls recSelError etc.
558 caf_info | no_default = NoCafRefs
559 | otherwise = MayHaveCafRefs
561 sel_rhs = mkLams res_tvs $ mkLams field_tyvars $
562 mkLams stupid_dict_ids $ mkLams field_dict_ids $
563 Lam data_id $ mk_result sel_body
565 -- NB: A newtype always has a vanilla DataCon; no existentials etc
566 -- res_tys will simply be the dataConUnivTyVars
567 sel_body | isNewTyCon tycon = unwrapNewTypeBody tycon res_tys (Var data_id)
568 | otherwise = Case (Var data_id) data_id field_ty (default_alt ++ the_alts)
570 mk_result poly_result = mkVarApps (mkVarApps poly_result field_tyvars) field_dict_ids
571 -- We pull the field lambdas to the top, so we need to
572 -- apply them in the body. For example:
573 -- data T = MkT { foo :: forall a. a->a }
575 -- foo :: forall a. T -> a -> a
576 -- foo = /\a. \t:T. case t of { MkT f -> f a }
579 = ASSERT2( res_ty `tcEqType` field_ty, ppr data_con $$ ppr res_ty $$ ppr field_ty )
580 mkReboxingAlt rebox_uniqs data_con (ex_tvs ++ co_tvs ++ arg_vs) rhs
582 -- get pattern binders with types appropriately instantiated
583 arg_uniqs = map mkBuiltinUnique [arg_base..]
584 (ex_tvs, co_tvs, arg_vs) = dataConOrigInstPat arg_uniqs data_con res_tys
586 rebox_base = arg_base + length ex_tvs + length co_tvs + length arg_vs
587 rebox_uniqs = map mkBuiltinUnique [rebox_base..]
589 -- data T :: *->* where T1 { fld :: Maybe b } -> T [b]
590 -- Hence T1 :: forall a b. (a=[b]) => b -> T a
591 -- fld :: forall b. T [b] -> Maybe b
592 -- fld = /\b.\(t:T[b]). case t of
593 -- T1 b' (c : [b]=[b']) (x:Maybe b')
594 -- -> x `cast` Maybe (sym (right c))
597 -- Generate the refinement for b'=b,
598 -- and apply to (Maybe b'), to get (Maybe b)
599 Succeeded refinement = gadtRefine emptyRefinement ex_tvs co_tvs
600 the_arg_id_ty = idType the_arg_id
601 (rhs, res_ty) = case refineType refinement the_arg_id_ty of
602 Just (co, res_ty) -> (Cast (Var the_arg_id) co, res_ty)
603 Nothing -> (Var the_arg_id, the_arg_id_ty)
605 field_vs = filter (not . isPredTy . idType) arg_vs
606 the_arg_id = assoc "mkRecordSelId:mk_alt" (field_lbls `zip` field_vs) field_label
607 field_lbls = dataConFieldLabels data_con
609 error_expr = mkRuntimeErrorApp rEC_SEL_ERROR_ID field_ty full_msg
610 full_msg = showSDoc (sep [text "No match in record selector", ppr sel_id])
612 -- unbox a product type...
613 -- we will recurse into newtypes, casting along the way, and unbox at the
614 -- first product data constructor we find. e.g.
616 -- data PairInt = PairInt Int Int
617 -- newtype S = MkS PairInt
620 -- If we have e = MkT (MkS (PairInt 0 1)) and some body expecting a list of
621 -- ids, we get (modulo int passing)
623 -- case (e `cast` CoT) `cast` CoS of
624 -- PairInt a b -> body [a,b]
626 -- The Ints passed around are just for creating fresh locals
627 unboxProduct :: Int -> CoreExpr -> Type -> (Int -> [Id] -> CoreExpr) -> CoreExpr
628 unboxProduct i arg arg_ty body
631 result = mkUnpackCase the_id arg con_args boxing_con rhs
632 (_tycon, _tycon_args, boxing_con, tys) = deepSplitProductType "unboxProduct" arg_ty
633 ([the_id], i') = mkLocals i [arg_ty]
634 (con_args, i'') = mkLocals i' tys
635 rhs = body i'' con_args
637 mkUnpackCase :: Id -> CoreExpr -> [Id] -> DataCon -> CoreExpr -> CoreExpr
638 -- (mkUnpackCase x e args Con body)
640 -- case (e `cast` ...) of bndr { Con args -> body }
642 -- the type of the bndr passed in is irrelevent
643 mkUnpackCase bndr arg unpk_args boxing_con body
644 = Case cast_arg (setIdType bndr bndr_ty) (exprType body) [(DataAlt boxing_con, unpk_args, body)]
646 (cast_arg, bndr_ty) = go (idType bndr) arg
648 | (tycon, tycon_args, _, _) <- splitProductType "mkUnpackCase" ty
649 , isNewTyCon tycon && not (isRecursiveTyCon tycon)
650 = go (newTyConInstRhs tycon tycon_args)
651 (unwrapNewTypeBody tycon tycon_args arg)
652 | otherwise = (arg, ty)
655 reboxProduct :: [Unique] -- uniques to create new local binders
656 -> Type -- type of product to box
657 -> ([Unique], -- remaining uniques
658 CoreExpr, -- boxed product
659 [Id]) -- Ids being boxed into product
662 (_tycon, _tycon_args, _pack_con, con_arg_tys) = deepSplitProductType "reboxProduct" ty
664 us' = dropList con_arg_tys us
666 arg_ids = zipWith (mkSysLocal FSLIT("rb")) us con_arg_tys
668 bind_rhs = mkProductBox arg_ids ty
671 (us', bind_rhs, arg_ids)
673 mkProductBox :: [Id] -> Type -> CoreExpr
674 mkProductBox arg_ids ty
677 (tycon, tycon_args, pack_con, _con_arg_tys) = splitProductType "mkProductBox" ty
680 | isNewTyCon tycon && not (isRecursiveTyCon tycon)
681 = wrap (mkProductBox arg_ids (newTyConInstRhs tycon tycon_args))
682 | otherwise = mkConApp pack_con (map Type tycon_args ++ map Var arg_ids)
684 wrap expr = wrapNewTypeBody tycon tycon_args expr
687 -- (mkReboxingAlt us con xs rhs) basically constructs the case
688 -- alternative (con, xs, rhs)
689 -- but it does the reboxing necessary to construct the *source*
690 -- arguments, xs, from the representation arguments ys.
692 -- data T = MkT !(Int,Int) Bool
694 -- mkReboxingAlt MkT [x,b] r
695 -- = (DataAlt MkT, [y::Int,z::Int,b], let x = (y,z) in r)
697 -- mkDataAlt should really be in DataCon, but it can't because
698 -- it manipulates CoreSyn.
701 :: [Unique] -- Uniques for the new Ids
703 -> [Var] -- Source-level args, including existential dicts
707 mkReboxingAlt us con args rhs
708 | not (any isMarkedUnboxed stricts)
709 = (DataAlt con, args, rhs)
713 (binds, args') = go args stricts us
715 (DataAlt con, args', mkLets binds rhs)
718 stricts = dataConExStricts con ++ dataConStrictMarks con
720 go [] _stricts _us = ([], [])
722 -- Type variable case
723 go (arg:args) stricts us
725 = let (binds, args') = go args stricts us
726 in (binds, arg:args')
728 -- Term variable case
729 go (arg:args) (str:stricts) us
730 | isMarkedUnboxed str
732 let (binds, unpacked_args') = go args stricts us'
733 (us', bind_rhs, unpacked_args) = reboxProduct us (idType arg)
735 (NonRec arg bind_rhs : binds, unpacked_args ++ unpacked_args')
737 = let (binds, args') = go args stricts us
738 in (binds, arg:args')
742 %************************************************************************
744 \subsection{Dictionary selectors}
746 %************************************************************************
748 Selecting a field for a dictionary. If there is just one field, then
749 there's nothing to do.
751 Dictionary selectors may get nested forall-types. Thus:
754 op :: forall b. Ord b => a -> b -> b
756 Then the top-level type for op is
758 op :: forall a. Foo a =>
762 This is unlike ordinary record selectors, which have all the for-alls
763 at the outside. When dealing with classes it's very convenient to
764 recover the original type signature from the class op selector.
767 mkDictSelId :: Name -> Class -> Id
768 mkDictSelId name clas
769 = mkGlobalId (ClassOpId clas) name sel_ty info
771 sel_ty = mkForAllTys tyvars (mkFunTy (idType dict_id) (idType the_arg_id))
772 -- We can't just say (exprType rhs), because that would give a type
774 -- for a single-op class (after all, the selector is the identity)
775 -- But it's type must expose the representation of the dictionary
776 -- to gat (say) C a -> (a -> a)
780 `setUnfoldingInfo` mkTopUnfolding rhs
781 `setAllStrictnessInfo` Just strict_sig
783 -- We no longer use 'must-inline' on record selectors. They'll
784 -- inline like crazy if they scrutinise a constructor
786 -- The strictness signature is of the form U(AAAVAAAA) -> T
787 -- where the V depends on which item we are selecting
788 -- It's worth giving one, so that absence info etc is generated
789 -- even if the selector isn't inlined
790 strict_sig = mkStrictSig (mkTopDmdType [arg_dmd] TopRes)
791 arg_dmd | isNewTyCon tycon = evalDmd
792 | otherwise = Eval (Prod [ if the_arg_id == id then evalDmd else Abs
795 tycon = classTyCon clas
796 [data_con] = tyConDataCons tycon
797 tyvars = dataConUnivTyVars data_con
798 arg_tys = ASSERT( isVanillaDataCon data_con ) dataConRepArgTys data_con
799 the_arg_id = assoc "MkId.mkDictSelId" (map idName (classSelIds clas) `zip` arg_ids) name
801 pred = mkClassPred clas (mkTyVarTys tyvars)
802 (dict_id:arg_ids) = mkTemplateLocals (mkPredTy pred : arg_tys)
804 rhs = mkLams tyvars (Lam dict_id rhs_body)
805 rhs_body | isNewTyCon tycon = unwrapNewTypeBody tycon (map mkTyVarTy tyvars) (Var dict_id)
806 | otherwise = Case (Var dict_id) dict_id (idType the_arg_id)
807 [(DataAlt data_con, arg_ids, Var the_arg_id)]
809 wrapNewTypeBody :: TyCon -> [Type] -> CoreExpr -> CoreExpr
810 -- The wrapper for the data constructor for a newtype looks like this:
811 -- newtype T a = MkT (a,Int)
812 -- MkT :: forall a. (a,Int) -> T a
813 -- MkT = /\a. \(x:(a,Int)). x `cast` sym (CoT a)
814 -- where CoT is the coercion TyCon assoicated with the newtype
816 -- The call (wrapNewTypeBody T [a] e) returns the
817 -- body of the wrapper, namely
818 -- e `cast` (CoT [a])
820 -- If a coercion constructor is prodivided in the newtype, then we use
821 -- it, otherwise the wrap/unwrap are both no-ops
823 -- If the we are dealing with a newtype instance, we have a second coercion
824 -- identifying the family instance with the constructor of the newtype
825 -- instance. This coercion is applied in any case (ie, composed with the
826 -- coercion constructor of the newtype or applied by itself).
828 wrapNewTypeBody tycon args result_expr
829 = wrapFamInstBody tycon args inner
832 | Just co_con <- newTyConCo_maybe tycon
833 = mkCoerce (mkSymCoercion (mkTyConApp co_con args)) result_expr
837 -- When unwrapping, we do *not* apply any family coercion, because this will
838 -- be done via a CoPat by the type checker. We have to do it this way as
839 -- computing the right type arguments for the coercion requires more than just
840 -- a spliting operation (cf, TcPat.tcConPat).
842 unwrapNewTypeBody :: TyCon -> [Type] -> CoreExpr -> CoreExpr
843 unwrapNewTypeBody tycon args result_expr
844 | Just co_con <- newTyConCo_maybe tycon
845 = mkCoerce (mkTyConApp co_con args) result_expr
853 %************************************************************************
855 \subsection{Primitive operations
857 %************************************************************************
860 mkPrimOpId :: PrimOp -> Id
864 (tyvars,arg_tys,res_ty, arity, strict_sig) = primOpSig prim_op
865 ty = mkForAllTys tyvars (mkFunTys arg_tys res_ty)
866 name = mkWiredInName gHC_PRIM (primOpOcc prim_op)
867 (mkPrimOpIdUnique (primOpTag prim_op))
869 id = mkGlobalId (PrimOpId prim_op) name ty info
872 `setSpecInfo` mkSpecInfo (primOpRules prim_op name)
874 `setAllStrictnessInfo` Just strict_sig
876 -- For each ccall we manufacture a separate CCallOpId, giving it
877 -- a fresh unique, a type that is correct for this particular ccall,
878 -- and a CCall structure that gives the correct details about calling
881 -- The *name* of this Id is a local name whose OccName gives the full
882 -- details of the ccall, type and all. This means that the interface
883 -- file reader can reconstruct a suitable Id
885 mkFCallId :: Unique -> ForeignCall -> Type -> Id
886 mkFCallId uniq fcall ty
887 = ASSERT( isEmptyVarSet (tyVarsOfType ty) )
888 -- A CCallOpId should have no free type variables;
889 -- when doing substitutions won't substitute over it
890 mkGlobalId (FCallId fcall) name ty info
892 occ_str = showSDoc (braces (ppr fcall <+> ppr ty))
893 -- The "occurrence name" of a ccall is the full info about the
894 -- ccall; it is encoded, but may have embedded spaces etc!
896 name = mkFCallName uniq occ_str
900 `setAllStrictnessInfo` Just strict_sig
902 (_, tau) = tcSplitForAllTys ty
903 (arg_tys, _) = tcSplitFunTys tau
904 arity = length arg_tys
905 strict_sig = mkStrictSig (mkTopDmdType (replicate arity evalDmd) TopRes)
909 %************************************************************************
911 \subsection{DictFuns and default methods}
913 %************************************************************************
915 Important notes about dict funs and default methods
916 ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
917 Dict funs and default methods are *not* ImplicitIds. Their definition
918 involves user-written code, so we can't figure out their strictness etc
919 based on fixed info, as we can for constructors and record selectors (say).
921 We build them as LocalIds, but with External Names. This ensures that
922 they are taken to account by free-variable finding and dependency
923 analysis (e.g. CoreFVs.exprFreeVars).
925 Why shouldn't they be bound as GlobalIds? Because, in particular, if
926 they are globals, the specialiser floats dict uses above their defns,
927 which prevents good simplifications happening. Also the strictness
928 analyser treats a occurrence of a GlobalId as imported and assumes it
929 contains strictness in its IdInfo, which isn't true if the thing is
930 bound in the same module as the occurrence.
932 It's OK for dfuns to be LocalIds, because we form the instance-env to
933 pass on to the next module (md_insts) in CoreTidy, afer tidying
934 and globalising the top-level Ids.
936 BUT make sure they are *exported* LocalIds (mkExportedLocalId) so
937 that they aren't discarded by the occurrence analyser.
940 mkDefaultMethodId dm_name ty = mkExportedLocalId dm_name ty
942 mkDictFunId :: Name -- Name to use for the dict fun;
949 mkDictFunId dfun_name inst_tyvars dfun_theta clas inst_tys
950 = mkExportedLocalId dfun_name dfun_ty
952 dfun_ty = mkSigmaTy inst_tyvars dfun_theta (mkDictTy clas inst_tys)
954 {- 1 dec 99: disable the Mark Jones optimisation for the sake
955 of compatibility with Hugs.
956 See `types/InstEnv' for a discussion related to this.
958 (class_tyvars, sc_theta, _, _) = classBigSig clas
959 not_const (clas, tys) = not (isEmptyVarSet (tyVarsOfTypes tys))
960 sc_theta' = substClasses (zipTopTvSubst class_tyvars inst_tys) sc_theta
961 dfun_theta = case inst_decl_theta of
962 [] -> [] -- If inst_decl_theta is empty, then we don't
963 -- want to have any dict arguments, so that we can
964 -- expose the constant methods.
966 other -> nub (inst_decl_theta ++ filter not_const sc_theta')
967 -- Otherwise we pass the superclass dictionaries to
968 -- the dictionary function; the Mark Jones optimisation.
970 -- NOTE the "nub". I got caught by this one:
971 -- class Monad m => MonadT t m where ...
972 -- instance Monad m => MonadT (EnvT env) m where ...
973 -- Here, the inst_decl_theta has (Monad m); but so
974 -- does the sc_theta'!
976 -- NOTE the "not_const". I got caught by this one too:
977 -- class Foo a => Baz a b where ...
978 -- instance Wob b => Baz T b where..
979 -- Now sc_theta' has Foo T
984 %************************************************************************
986 \subsection{Un-definable}
988 %************************************************************************
990 These Ids can't be defined in Haskell. They could be defined in
991 unfoldings in the wired-in GHC.Prim interface file, but we'd have to
992 ensure that they were definitely, definitely inlined, because there is
993 no curried identifier for them. That's what mkCompulsoryUnfolding
994 does. If we had a way to get a compulsory unfolding from an interface
995 file, we could do that, but we don't right now.
997 unsafeCoerce# isn't so much a PrimOp as a phantom identifier, that
998 just gets expanded into a type coercion wherever it occurs. Hence we
999 add it as a built-in Id with an unfolding here.
1001 The type variables we use here are "open" type variables: this means
1002 they can unify with both unlifted and lifted types. Hence we provide
1003 another gun with which to shoot yourself in the foot.
1006 mkWiredInIdName mod fs uniq id
1007 = mkWiredInName mod (mkOccNameFS varName fs) uniq (AnId id) UserSyntax
1009 unsafeCoerceName = mkWiredInIdName gHC_PRIM FSLIT("unsafeCoerce#") unsafeCoerceIdKey unsafeCoerceId
1010 nullAddrName = mkWiredInIdName gHC_PRIM FSLIT("nullAddr#") nullAddrIdKey nullAddrId
1011 seqName = mkWiredInIdName gHC_PRIM FSLIT("seq") seqIdKey seqId
1012 realWorldName = mkWiredInIdName gHC_PRIM FSLIT("realWorld#") realWorldPrimIdKey realWorldPrimId
1013 lazyIdName = mkWiredInIdName gHC_BASE FSLIT("lazy") lazyIdKey lazyId
1015 errorName = mkWiredInIdName gHC_ERR FSLIT("error") errorIdKey eRROR_ID
1016 recSelErrorName = mkWiredInIdName gHC_ERR FSLIT("recSelError") recSelErrorIdKey rEC_SEL_ERROR_ID
1017 runtimeErrorName = mkWiredInIdName gHC_ERR FSLIT("runtimeError") runtimeErrorIdKey rUNTIME_ERROR_ID
1018 irrefutPatErrorName = mkWiredInIdName gHC_ERR FSLIT("irrefutPatError") irrefutPatErrorIdKey iRREFUT_PAT_ERROR_ID
1019 recConErrorName = mkWiredInIdName gHC_ERR FSLIT("recConError") recConErrorIdKey rEC_CON_ERROR_ID
1020 patErrorName = mkWiredInIdName gHC_ERR FSLIT("patError") patErrorIdKey pAT_ERROR_ID
1021 noMethodBindingErrorName = mkWiredInIdName gHC_ERR FSLIT("noMethodBindingError")
1022 noMethodBindingErrorIdKey nO_METHOD_BINDING_ERROR_ID
1023 nonExhaustiveGuardsErrorName
1024 = mkWiredInIdName gHC_ERR FSLIT("nonExhaustiveGuardsError")
1025 nonExhaustiveGuardsErrorIdKey nON_EXHAUSTIVE_GUARDS_ERROR_ID
1029 -- unsafeCoerce# :: forall a b. a -> b
1031 = pcMiscPrelId unsafeCoerceName ty info
1033 info = noCafIdInfo `setUnfoldingInfo` mkCompulsoryUnfolding rhs
1036 ty = mkForAllTys [openAlphaTyVar,openBetaTyVar]
1037 (mkFunTy openAlphaTy openBetaTy)
1038 [x] = mkTemplateLocals [openAlphaTy]
1039 rhs = mkLams [openAlphaTyVar,openBetaTyVar,x] $
1040 -- Note (Coerce openBetaTy openAlphaTy) (Var x)
1041 Cast (Var x) (mkUnsafeCoercion openAlphaTy openBetaTy)
1043 -- nullAddr# :: Addr#
1044 -- The reason is is here is because we don't provide
1045 -- a way to write this literal in Haskell.
1047 = pcMiscPrelId nullAddrName addrPrimTy info
1049 info = noCafIdInfo `setUnfoldingInfo`
1050 mkCompulsoryUnfolding (Lit nullAddrLit)
1053 = pcMiscPrelId seqName ty info
1055 info = noCafIdInfo `setUnfoldingInfo` mkCompulsoryUnfolding rhs
1058 ty = mkForAllTys [alphaTyVar,openBetaTyVar]
1059 (mkFunTy alphaTy (mkFunTy openBetaTy openBetaTy))
1060 [x,y] = mkTemplateLocals [alphaTy, openBetaTy]
1061 rhs = mkLams [alphaTyVar,openBetaTyVar,x,y] (Case (Var x) x openBetaTy [(DEFAULT, [], Var y)])
1063 -- lazy :: forall a?. a? -> a? (i.e. works for unboxed types too)
1064 -- Used to lazify pseq: pseq a b = a `seq` lazy b
1066 -- Also, no strictness: by being a built-in Id, all the info about lazyId comes from here,
1067 -- not from GHC.Base.hi. This is important, because the strictness
1068 -- analyser will spot it as strict!
1070 -- Also no unfolding in lazyId: it gets "inlined" by a HACK in the worker/wrapper pass
1071 -- (see WorkWrap.wwExpr)
1072 -- We could use inline phases to do this, but that would be vulnerable to changes in
1073 -- phase numbering....we must inline precisely after strictness analysis.
1075 = pcMiscPrelId lazyIdName ty info
1078 ty = mkForAllTys [alphaTyVar] (mkFunTy alphaTy alphaTy)
1080 lazyIdUnfolding :: CoreExpr -- Used to expand 'lazyId' after strictness anal
1081 lazyIdUnfolding = mkLams [openAlphaTyVar,x] (Var x)
1083 [x] = mkTemplateLocals [openAlphaTy]
1086 @realWorld#@ used to be a magic literal, \tr{void#}. If things get
1087 nasty as-is, change it back to a literal (@Literal@).
1089 voidArgId is a Local Id used simply as an argument in functions
1090 where we just want an arg to avoid having a thunk of unlifted type.
1092 x = \ void :: State# RealWorld -> (# p, q #)
1094 This comes up in strictness analysis
1097 realWorldPrimId -- :: State# RealWorld
1098 = pcMiscPrelId realWorldName realWorldStatePrimTy
1099 (noCafIdInfo `setUnfoldingInfo` evaldUnfolding)
1100 -- The evaldUnfolding makes it look that realWorld# is evaluated
1101 -- which in turn makes Simplify.interestingArg return True,
1102 -- which in turn makes INLINE things applied to realWorld# likely
1105 voidArgId -- :: State# RealWorld
1106 = mkSysLocal FSLIT("void") voidArgIdKey realWorldStatePrimTy
1110 %************************************************************************
1112 \subsection[PrelVals-error-related]{@error@ and friends; @trace@}
1114 %************************************************************************
1116 GHC randomly injects these into the code.
1118 @patError@ is just a version of @error@ for pattern-matching
1119 failures. It knows various ``codes'' which expand to longer
1120 strings---this saves space!
1122 @absentErr@ is a thing we put in for ``absent'' arguments. They jolly
1123 well shouldn't be yanked on, but if one is, then you will get a
1124 friendly message from @absentErr@ (rather than a totally random
1127 @parError@ is a special version of @error@ which the compiler does
1128 not know to be a bottoming Id. It is used in the @_par_@ and @_seq_@
1129 templates, but we don't ever expect to generate code for it.
1133 :: Id -- Should be of type (forall a. Addr# -> a)
1134 -- where Addr# points to a UTF8 encoded string
1135 -> Type -- The type to instantiate 'a'
1136 -> String -- The string to print
1139 mkRuntimeErrorApp err_id res_ty err_msg
1140 = mkApps (Var err_id) [Type res_ty, err_string]
1142 err_string = Lit (mkStringLit err_msg)
1144 rEC_SEL_ERROR_ID = mkRuntimeErrorId recSelErrorName
1145 rUNTIME_ERROR_ID = mkRuntimeErrorId runtimeErrorName
1146 iRREFUT_PAT_ERROR_ID = mkRuntimeErrorId irrefutPatErrorName
1147 rEC_CON_ERROR_ID = mkRuntimeErrorId recConErrorName
1148 pAT_ERROR_ID = mkRuntimeErrorId patErrorName
1149 nO_METHOD_BINDING_ERROR_ID = mkRuntimeErrorId noMethodBindingErrorName
1150 nON_EXHAUSTIVE_GUARDS_ERROR_ID = mkRuntimeErrorId nonExhaustiveGuardsErrorName
1152 -- The runtime error Ids take a UTF8-encoded string as argument
1153 mkRuntimeErrorId name = pc_bottoming_Id name runtimeErrorTy
1154 runtimeErrorTy = mkSigmaTy [openAlphaTyVar] [] (mkFunTy addrPrimTy openAlphaTy)
1158 eRROR_ID = pc_bottoming_Id errorName errorTy
1161 errorTy = mkSigmaTy [openAlphaTyVar] [] (mkFunTys [mkListTy charTy] openAlphaTy)
1162 -- Notice the openAlphaTyVar. It says that "error" can be applied
1163 -- to unboxed as well as boxed types. This is OK because it never
1164 -- returns, so the return type is irrelevant.
1168 %************************************************************************
1170 \subsection{Utilities}
1172 %************************************************************************
1175 pcMiscPrelId :: Name -> Type -> IdInfo -> Id
1176 pcMiscPrelId name ty info
1177 = mkVanillaGlobal name ty info
1178 -- We lie and say the thing is imported; otherwise, we get into
1179 -- a mess with dependency analysis; e.g., core2stg may heave in
1180 -- random calls to GHCbase.unpackPS__. If GHCbase is the module
1181 -- being compiled, then it's just a matter of luck if the definition
1182 -- will be in "the right place" to be in scope.
1184 pc_bottoming_Id name ty
1185 = pcMiscPrelId name ty bottoming_info
1187 bottoming_info = vanillaIdInfo `setAllStrictnessInfo` Just strict_sig
1188 -- Do *not* mark them as NoCafRefs, because they can indeed have
1189 -- CAF refs. For example, pAT_ERROR_ID calls GHC.Err.untangle,
1190 -- which has some CAFs
1191 -- In due course we may arrange that these error-y things are
1192 -- regarded by the GC as permanently live, in which case we
1193 -- can give them NoCaf info. As it is, any function that calls
1194 -- any pc_bottoming_Id will itself have CafRefs, which bloats
1197 strict_sig = mkStrictSig (mkTopDmdType [evalDmd] BotRes)
1198 -- These "bottom" out, no matter what their arguments