X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=ghc%2Fcompiler%2FbasicTypes%2FMkId.lhs;h=067693521126122df226606419c1a7771cb14de5;hb=531d0d264fafd66aece5ca38d2bfcd266a8fd3e5;hp=9da068ab3d53ee98f6d1fb1eb3d475d4cacb8ee5;hpb=30b5ebe424ebae69b162ac3fc547eb14d898535f;p=ghc-hetmet.git diff --git a/ghc/compiler/basicTypes/MkId.lhs b/ghc/compiler/basicTypes/MkId.lhs index 9da068a..0676935 100644 --- a/ghc/compiler/basicTypes/MkId.lhs +++ b/ghc/compiler/basicTypes/MkId.lhs @@ -18,10 +18,9 @@ module MkId ( mkDictFunId, mkDefaultMethodId, mkDictSelId, - mkDataConId, + mkDataConId, mkDataConWrapId, mkRecordSelId, - mkNewTySelId, - mkPrimitiveId, + mkPrimOpId, mkCCallOpId, -- And some particular Ids; see below for why they are wired in wiredInIds, @@ -37,54 +36,63 @@ module MkId ( import TysPrim ( openAlphaTyVars, alphaTyVar, alphaTy, intPrimTy, realWorldStatePrimTy ) -import TysWiredIn ( boolTy, charTy, mkListTy ) -import PrelMods ( pREL_ERR, pREL_GHC ) -import Type ( Type, ThetaType, - mkDictTy, mkTyConApp, mkTyVarTys, mkFunTys, mkFunTy, mkSigmaTy, - isUnLiftedType, mkForAllTys, mkTyVarTy, tyVarsOfTypes, - splitSigmaTy, splitFunTy_maybe, splitAlgTyConApp, - splitFunTys, splitForAllTys, unUsgTy, - mkUsgTy, UsageAnn(..) +import TysWiredIn ( charTy, mkListTy ) +import PrelNames ( pREL_ERR, pREL_GHC ) +import PrelRules ( primOpRule ) +import Rules ( addRule ) +import Type ( Type, ThetaType, mkDictTy, mkDictTys, mkTyConApp, mkTyVarTys, + mkFunTys, mkFunTy, mkSigmaTy, splitSigmaTy, + isUnLiftedType, mkForAllTys, mkTyVarTy, tyVarsOfType, + splitFunTys, splitForAllTys, mkPredTy ) import Module ( Module ) -import CoreUnfold ( mkTopUnfolding, mkCompulsoryUnfolding ) -import Subst ( mkTopTyVarSubst, substTheta ) -import TyCon ( TyCon, isNewTyCon, tyConDataCons, isDataTyCon ) -import Class ( Class, classBigSig, classTyCon ) +import CoreUtils ( exprType, mkInlineMe ) +import CoreUnfold ( mkTopUnfolding, mkCompulsoryUnfolding, mkOtherCon ) +import Literal ( Literal(..) ) +import TyCon ( TyCon, isNewTyCon, tyConTyVars, tyConDataCons, + tyConTheta, isProductTyCon, isDataTyCon ) +import Class ( Class, classTyCon, classTyVars, classSelIds ) import Var ( Id, TyVar ) import VarSet ( isEmptyVarSet ) -import Const ( Con(..) ) -import Name ( mkDerivedName, mkWiredInIdName, mkLocalName, - mkWorkerOcc, mkSuperDictSelOcc, - Name, NamedThing(..), +import Name ( mkWiredInName, mkLocalName, + mkWorkerOcc, mkCCallName, + Name, NamedThing(..), getSrcLoc ) -import OccName ( mkSrcVarOcc ) -import PrimOp ( PrimOp(DataToTagOp), primOpSig, mkPrimOpIdName ) -import Demand ( wwStrict ) -import DataCon ( DataCon, StrictnessMark(..), dataConStrictMarks, dataConFieldLabels, - dataConArgTys, dataConSig, dataConRawArgTys +import OccName ( mkVarOcc ) +import PrimOp ( PrimOp(DataToTagOp, CCallOp), + primOpSig, mkPrimOpIdName, + CCall, pprCCallOp + ) +import Demand ( wwStrict, wwPrim, mkStrictnessInfo ) +import DataCon ( DataCon, StrictnessMark(..), + dataConFieldLabels, dataConRepArity, dataConTyCon, + dataConArgTys, dataConRepType, dataConRepStrictness, + dataConInstOrigArgTys, + dataConName, dataConTheta, + dataConSig, dataConStrictMarks, dataConId, + maybeMarkedUnboxed, splitProductType_maybe ) import Id ( idType, mkId, - mkVanillaId, mkTemplateLocals, - mkTemplateLocal, setInlinePragma + mkVanillaId, mkTemplateLocals, mkTemplateLocalsNum, + mkTemplateLocal, idCprInfo ) -import IdInfo ( vanillaIdInfo, mkIdInfo, - exactArity, setUnfoldingInfo, setCafInfo, - setArityInfo, setInlinePragInfo, +import IdInfo ( IdInfo, constantIdInfo, mkIdInfo, + exactArity, setUnfoldingInfo, setCafInfo, setCprInfo, + setArityInfo, setSpecInfo, setTyGenInfo, mkStrictnessInfo, setStrictnessInfo, - IdFlavour(..), InlinePragInfo(..), CafInfo(..), IdInfo + IdFlavour(..), CafInfo(..), CprInfo(..), TyGenInfo(..) ) -import FieldLabel ( FieldLabel, FieldLabelTag, mkFieldLabel, fieldLabelName, - firstFieldLabelTag, allFieldLabelTags +import FieldLabel ( mkFieldLabel, fieldLabelName, + firstFieldLabelTag, allFieldLabelTags, fieldLabelType ) import CoreSyn import Maybes -import BasicTypes ( Arity ) -import Unique +import PrelNames import Maybe ( isJust ) import Outputable -import Util ( assoc ) -import List ( nub ) +import ListSetOps ( assoc, assocMaybe ) +import UnicodeUtil ( stringToUtf8 ) +import Char ( ord ) \end{code} @@ -101,8 +109,9 @@ wiredInIds -- is 'open'; that is can be unified with an unboxed type -- -- [The interface file format now carry such information, but there's - -- no way yet of expressing at the definition site for these error-reporting - -- functions that they have an 'open' result type. -- sof 1/99] + -- no way yet of expressing at the definition site for these + -- error-reporting + -- functions that they have an 'open' result type. -- sof 1/99] aBSENT_ERROR_ID , eRROR_ID @@ -129,14 +138,22 @@ wiredInIds \begin{code} mkSpecPragmaId occ uniq ty loc - = mkId (mkLocalName uniq occ loc) ty (mkIdInfo SpecPragmaId) + = mkId (mkLocalName uniq occ loc) ty (mkIdInfo SpecPragmaId NoCafRefs) -- Maybe a SysLocal? But then we'd lose the location mkDefaultMethodId dm_name rec_c ty - = mkVanillaId dm_name ty + = mkId dm_name ty info + where + info = constantIdInfo `setTyGenInfo` TyGenNever + -- type is wired-in (see comment at TcClassDcl.tcClassSig), so + -- do not generalise it +mkWorkerId :: Unique -> Id -> Type -> Id +-- A worker gets a local name. CoreTidy will globalise it if necessary. mkWorkerId uniq unwrkr ty - = mkVanillaId (mkDerivedName mkWorkerOcc (getName unwrkr) uniq) ty + = mkVanillaId wkr_name ty + where + wkr_name = mkLocalName uniq (mkWorkerOcc (getOccName unwrkr)) (getSrcLoc unwrkr) \end{code} %************************************************************************ @@ -146,18 +163,34 @@ mkWorkerId uniq unwrkr ty %************************************************************************ \begin{code} -mkDataConId :: DataCon -> Id -mkDataConId data_con - = mkId (getName data_con) - id_ty - (dataConInfo data_con) +mkDataConId :: Name -> DataCon -> Id + -- Makes the *worker* for the data constructor; that is, the function + -- that takes the reprsentation arguments and builds the constructor. +mkDataConId work_name data_con + = mkId work_name (dataConRepType data_con) info where - (tyvars, theta, ex_tyvars, ex_theta, arg_tys, tycon) = dataConSig data_con - id_ty = mkSigmaTy (tyvars ++ ex_tyvars) - (theta ++ ex_theta) - (mkFunTys arg_tys (mkTyConApp tycon (mkTyVarTys tyvars))) + info = mkIdInfo (DataConId data_con) NoCafRefs + `setArityInfo` exactArity arity + `setStrictnessInfo` strict_info + `setCprInfo` cpr_info + + arity = dataConRepArity data_con + + strict_info = mkStrictnessInfo (dataConRepStrictness data_con, False) + + tycon = dataConTyCon data_con + cpr_info | isProductTyCon tycon && + isDataTyCon tycon && + arity > 0 = ReturnsCPR + | otherwise = NoCPRInfo + -- ReturnsCPR is only true for products that are real data types; + -- that is, not unboxed tuples or newtypes \end{code} +The wrapper for a constructor is an ordinary top-level binding that evaluates +any strict args, unboxes any args that are going to be flattened, and calls +the worker. + We're going to build a constructor that looks like: data (Data a, C b) => T a b = T1 !a !Int b @@ -192,61 +225,96 @@ Notice that it in the (common) case where the constructor arg is already evaluated. \begin{code} -dataConInfo :: DataCon -> IdInfo - -dataConInfo data_con - = mkIdInfo (ConstantId (DataCon data_con)) - `setArityInfo` exactArity (n_dicts + n_ex_dicts + n_id_args) - `setUnfoldingInfo` unfolding +mkDataConWrapId data_con + = wrap_id where - unfolding = mkTopUnfolding (Note InlineMe con_rhs) - -- The dictionary constructors of a class don't get a binding, - -- but they are always saturated, so they should always be inlined. - - (tyvars, theta, ex_tyvars, ex_theta, orig_arg_tys, tycon) - = dataConSig data_con - rep_arg_tys = dataConRawArgTys data_con - all_tyvars = tyvars ++ ex_tyvars - - dict_tys = [mkDictTy clas tys | (clas,tys) <- theta] - ex_dict_tys = [mkDictTy clas tys | (clas,tys) <- ex_theta] - - n_dicts = length dict_tys - n_ex_dicts = length ex_dict_tys - n_id_args = length orig_arg_tys - n_rep_args = length rep_arg_tys - - result_ty = mkTyConApp tycon (mkTyVarTys tyvars) - - mkLocals i n tys = (zipWith mkTemplateLocal [i..i+n-1] tys, i+n) - (dict_args, i1) = mkLocals 1 n_dicts dict_tys - (ex_dict_args,i2) = mkLocals i1 n_ex_dicts ex_dict_tys - (id_args,i3) = mkLocals i2 n_id_args orig_arg_tys - - (id_arg1:_) = id_args -- Used for newtype only - strict_marks = dataConStrictMarks data_con - - con_app i rep_ids - | isNewTyCon tycon - = ASSERT( length orig_arg_tys == 1 ) - Note (Coerce result_ty (head orig_arg_tys)) (Var id_arg1) - | otherwise - = mkConApp data_con - (map Type (mkTyVarTys all_tyvars) ++ - map Var (reverse rep_ids)) - - con_rhs = mkLams all_tyvars $ mkLams dict_args $ - mkLams ex_dict_args $ mkLams id_args $ - foldr mk_case con_app + wrap_id = mkId (dataConName data_con) wrap_ty info + work_id = dataConId data_con + + info = mkIdInfo (DataConWrapId data_con) NoCafRefs + `setUnfoldingInfo` mkTopUnfolding (mkInlineMe wrap_rhs) + `setCprInfo` cpr_info + -- The Cpr info can be important inside INLINE rhss, where the + -- wrapper constructor isn't inlined + `setArityInfo` exactArity arity + -- It's important to specify the arity, so that partial + -- applications are treated as values + `setTyGenInfo` TyGenNever + -- No point generalising its type, since it gets eagerly inlined + -- away anyway + + wrap_ty = mkForAllTys all_tyvars $ + mkFunTys all_arg_tys + result_ty + + cpr_info = idCprInfo work_id + + wrap_rhs | isNewTyCon tycon + = ASSERT( null ex_tyvars && null ex_dict_args && length orig_arg_tys == 1 ) + -- No existentials on a newtype, but it can have a context + -- e.g. newtype Eq a => T a = MkT (...) + + mkLams tyvars $ mkLams dict_args $ Lam id_arg1 $ + Note (Coerce result_ty (head orig_arg_tys)) (Var id_arg1) + + | null dict_args && all not_marked_strict strict_marks + = Var work_id -- The common case. Not only is this efficient, + -- but it also ensures that the wrapper is replaced + -- by the worker even when there are no args. + -- f (:) x + -- becomes + -- f $w: x + -- This is really important in rule matching, + -- (We could match on the wrappers, + -- but that makes it less likely that rules will match + -- when we bring bits of unfoldings together.) + -- + -- NB: because of this special case, (map (:) ys) turns into + -- (map $w: ys), and thence into (map (\x xs. $w: x xs) ys) + -- in core-to-stg. The top-level defn for (:) is never used. + -- This is somewhat of a bore, but I'm currently leaving it + -- as is, so that there still is a top level curried (:) for + -- the interpreter to call. + + | otherwise + = mkLams all_tyvars $ mkLams dict_args $ + mkLams ex_dict_args $ mkLams id_args $ + foldr mk_case con_app (zip (ex_dict_args++id_args) strict_marks) i3 [] - mk_case + con_app i rep_ids = mkApps (Var work_id) + (map varToCoreExpr (all_tyvars ++ reverse rep_ids)) + + (tyvars, theta, ex_tyvars, ex_theta, orig_arg_tys, tycon) = dataConSig data_con + all_tyvars = tyvars ++ ex_tyvars + + dict_tys = mkDictTys theta + ex_dict_tys = mkDictTys ex_theta + all_arg_tys = dict_tys ++ ex_dict_tys ++ orig_arg_tys + result_ty = mkTyConApp tycon (mkTyVarTys tyvars) + + mkLocals i tys = (zipWith mkTemplateLocal [i..i+n-1] tys, i+n) + where + n = length tys + + (dict_args, i1) = mkLocals 1 dict_tys + (ex_dict_args,i2) = mkLocals i1 ex_dict_tys + (id_args,i3) = mkLocals i2 orig_arg_tys + arity = i3-1 + (id_arg1:_) = id_args -- Used for newtype only + + strict_marks = dataConStrictMarks data_con + not_marked_strict NotMarkedStrict = True + not_marked_strict other = False + + + mk_case :: (Id, StrictnessMark) -- arg, strictness -> (Int -> [Id] -> CoreExpr) -- body -> Int -- next rep arg id -> [Id] -- rep args so far -> CoreExpr - mk_case (arg,strict) body i rep_args + mk_case (arg,strict) body i rep_args = case strict of NotMarkedStrict -> body i (arg:rep_args) MarkedStrict @@ -255,10 +323,10 @@ dataConInfo data_con Case (Var arg) arg [(DEFAULT,[], body i (arg:rep_args))] MarkedUnboxed con tys -> - Case (Var arg) arg [(DataCon con, con_args, + Case (Var arg) arg [(DataAlt con, con_args, body i' (reverse con_args++rep_args))] - where n_tys = length tys - (con_args,i') = mkLocals i (length tys) tys + where + (con_args,i') = mkLocals i tys \end{code} @@ -279,83 +347,184 @@ We're going to build a record selector unfolding that looks like this: T2 ... x ... -> x other -> error "..." +Similarly for newtypes + + newtype N a = MkN { unN :: a->a } + + unN :: N a -> a -> a + unN n = coerce (a->a) n + +We need to take a little care if the field has a polymorphic type: + + data R = R { f :: forall a. a->a } + +Then we want + + f :: forall a. R -> a -> a + f = /\ a \ r = case r of + R f -> f a + +(not f :: R -> forall a. a->a, which gives the type inference mechanism +problems at call sites) + +Similarly for newtypes + + newtype N = MkN { unN :: forall a. a->a } + + unN :: forall a. N -> a -> a + unN = /\a -> \n:N -> coerce (a->a) n + \begin{code} -mkRecordSelId field_label selector_ty - = ASSERT( null theta && isDataTyCon tycon ) - sel_id +mkRecordSelId tycon field_label unpack_id unpackUtf8_id + -- Assumes that all fields with the same field label have the same type + -- + -- Annoyingly, we have to pass in the unpackCString# Id, because + -- we can't conjure it up out of thin air + = sel_id where - sel_id = mkId (fieldLabelName field_label) selector_ty info - - info = mkIdInfo (RecordSelId field_label) - `setArityInfo` exactArity 1 + sel_id = mkId (fieldLabelName field_label) selector_ty info + + field_ty = fieldLabelType field_label + data_cons = tyConDataCons tycon + tyvars = tyConTyVars tycon -- These scope over the types in + -- the FieldLabels of constructors of this type + data_ty = mkTyConApp tycon tyvar_tys + tyvar_tys = mkTyVarTys tyvars + + tycon_theta = tyConTheta tycon -- The context on the data decl + -- eg data (Eq a, Ord b) => T a b = ... + dict_tys = [mkDictTy cls tys | (cls, tys) <- tycon_theta, + needed_dict (cls, tys)] + needed_dict pred = or [ pred `elem` (dataConTheta dc) + | (DataAlt dc, _, _) <- the_alts] + n_dict_tys = length dict_tys + + (field_tyvars,field_theta,field_tau) = splitSigmaTy field_ty + field_dict_tys = map mkPredTy field_theta + n_field_dict_tys = length field_dict_tys + -- If the field has a universally quantified type we have to + -- be a bit careful. Suppose we have + -- data R = R { op :: forall a => Foo a => a -> a } + -- Then we can't give op the type + -- op :: R -> forall a. Foo a => a -> a + -- because the typechecker doesn't understand foralls to the + -- right of an arrow. The "right" type to give it is + -- op :: forall a. Foo a => a -> a + -- But then we must generat the right unfolding too: + -- op = /\a -> \dfoo -> \ r -> + -- case r of + -- R op -> op a dfoo + -- Note that this is exactly the type we'd infer from a user defn + -- op (R op) = op + + -- Very tiresomely, the selectors are (unnecessarily!) overloaded over + -- just the dictionaries in the types of the constructors that contain + -- the relevant field. Urgh. + -- NB: this code relies on the fact that DataCons are quantified over + -- the identical type variables as their parent TyCon + + selector_ty :: Type + selector_ty = mkForAllTys tyvars $ mkForAllTys field_tyvars $ + mkFunTys dict_tys $ mkFunTys field_dict_tys $ + mkFunTy data_ty field_tau + + arity = 1 + n_dict_tys + n_field_dict_tys + info = mkIdInfo (RecordSelId field_label) caf_info + `setArityInfo` exactArity arity `setUnfoldingInfo` unfolding - + `setTyGenInfo` TyGenNever -- ToDo: consider adding further IdInfo unfolding = mkTopUnfolding sel_rhs - (tyvars, theta, tau) = splitSigmaTy selector_ty - (data_ty,rhs_ty) = expectJust "StdIdInfoRec" (splitFunTy_maybe tau) - -- tau is of form (T a b c -> field-type) - (tycon, _, data_cons) = splitAlgTyConApp data_ty - tyvar_tys = mkTyVarTys tyvars - - [data_id] = mkTemplateLocals [data_ty] + -- Allocate Ids. We do it a funny way round because field_dict_tys is + -- almost always empty + dict_ids = mkTemplateLocalsNum 1 dict_tys + field_dict_ids = mkTemplateLocalsNum (n_dict_tys+1) field_dict_tys + data_id = mkTemplateLocal arity data_ty + alts = map mk_maybe_alt data_cons the_alts = catMaybes alts - default_alt | all isJust alts = [] -- No default needed - | otherwise = [(DEFAULT, [], error_expr)] - sel_rhs = mkLams tyvars $ Lam data_id $ - Case (Var data_id) data_id (the_alts ++ default_alt) + no_default = all isJust alts -- No default needed + default_alt | no_default = [] + | otherwise = [(DEFAULT, [], error_expr)] + + -- the default branch may have CAF refs, because it calls recSelError etc. + caf_info | no_default = NoCafRefs + | otherwise = MayHaveCafRefs + + sel_rhs = mkLams tyvars $ mkLams field_tyvars $ + mkLams dict_ids $ mkLams field_dict_ids $ + Lam data_id $ sel_body + + sel_body | isNewTyCon tycon = Note (Coerce field_tau data_ty) (Var data_id) + | otherwise = Case (Var data_id) data_id (the_alts ++ default_alt) mk_maybe_alt data_con = case maybe_the_arg_id of Nothing -> Nothing - Just the_arg_id -> Just (DataCon data_con, arg_ids, Var the_arg_id) - where - arg_ids = mkTemplateLocals (dataConArgTys data_con tyvar_tys) - -- The first one will shadow data_id, but who cares - field_lbls = dataConFieldLabels data_con - maybe_the_arg_id = assocMaybe (field_lbls `zip` arg_ids) field_label - - error_expr = mkApps (Var rEC_SEL_ERROR_ID) [Type (unUsgTy rhs_ty), mkStringLit full_msg] - -- preserves invariant that type args are *not* usage-annotated on top. KSW 1999-04. + Just the_arg_id -> Just (DataAlt data_con, real_args, expr) + where + body = mkVarApps (mkVarApps (Var the_arg_id) field_tyvars) field_dict_ids + strict_marks = dataConStrictMarks data_con + (expr, real_args) = rebuildConArgs data_con arg_ids strict_marks body + (length arg_ids + 1) + where + arg_ids = mkTemplateLocalsNum (arity+1) (dataConInstOrigArgTys data_con tyvar_tys) + -- arity+1 avoids all shadowing + maybe_the_arg_id = assocMaybe (field_lbls `zip` arg_ids) field_label + field_lbls = dataConFieldLabels data_con + + error_expr = mkApps (Var rEC_SEL_ERROR_ID) [Type field_tau, err_string] + err_string + | all safeChar full_msg + = App (Var unpack_id) (Lit (MachStr (_PK_ full_msg))) + | otherwise + = App (Var unpackUtf8_id) (Lit (MachStr (_PK_ (stringToUtf8 (map ord full_msg))))) + where + safeChar c = c >= '\1' && c <= '\xFF' + -- TODO: Putting this Unicode stuff here is ugly. Find a better + -- generic place to make string literals. This logic is repeated + -- in DsUtils. full_msg = showSDoc (sep [text "No match in record selector", ppr sel_id]) -\end{code} - - -%************************************************************************ -%* * -\subsection{Newtype field selectors} -%* * -%************************************************************************ - -Possibly overkill to do it this way: - -\begin{code} -mkNewTySelId field_label selector_ty = sel_id - where - sel_id = mkId (fieldLabelName field_label) selector_ty info - - - info = mkIdInfo (RecordSelId field_label) - `setArityInfo` exactArity 1 - `setUnfoldingInfo` unfolding - - -- ToDo: consider adding further IdInfo - unfolding = mkTopUnfolding sel_rhs - (tyvars, theta, tau) = splitSigmaTy selector_ty - (data_ty,rhs_ty) = expectJust "StdIdInfoRec" (splitFunTy_maybe tau) - -- tau is of form (T a b c -> field-type) - (tycon, _, data_cons) = splitAlgTyConApp data_ty - tyvar_tys = mkTyVarTys tyvars - - [data_id] = mkTemplateLocals [data_ty] - sel_rhs = mkLams tyvars $ Lam data_id $ - Note (Coerce (unUsgTy rhs_ty) (unUsgTy data_ty)) (Var data_id) +-- this rather ugly function converts the unpacked data con arguments back into +-- their packed form. It is almost the same as the version in DsUtils, except that +-- we use template locals here rather than newDsId (ToDo: merge these). + +rebuildConArgs + :: DataCon -- the con we're matching on + -> [Id] -- the source-level args + -> [StrictnessMark] -- the strictness annotations (per-arg) + -> CoreExpr -- the body + -> Int -- template local + -> (CoreExpr, [Id]) + +rebuildConArgs con [] stricts body i = (body, []) +rebuildConArgs con (arg:args) stricts body i | isTyVar arg + = let (body', args') = rebuildConArgs con args stricts body i + in (body',arg:args') +rebuildConArgs con (arg:args) (str:stricts) body i + = case maybeMarkedUnboxed str of + Just (pack_con1, _) -> + case splitProductType_maybe (idType arg) of + Just (_, tycon_args, pack_con, con_arg_tys) -> + ASSERT( pack_con == pack_con1 ) + let unpacked_args = zipWith mkTemplateLocal [i..] con_arg_tys + (body', real_args) = rebuildConArgs con args stricts body + (i + length con_arg_tys) + in + ( + Let (NonRec arg (mkConApp pack_con + (map Type tycon_args ++ + map Var unpacked_args))) body', + unpacked_args ++ real_args + ) + + _ -> let (body', args') = rebuildConArgs con args stricts body i + in (body', arg:args') \end{code} @@ -366,25 +535,31 @@ mkNewTySelId field_label selector_ty = sel_id %************************************************************************ Selecting a field for a dictionary. If there is just one field, then -there's nothing to do. +there's nothing to do. + +ToDo: unify with mkRecordSelId. \begin{code} -mkDictSelId name clas ty +mkDictSelId :: Name -> Class -> Id +mkDictSelId name clas = sel_id where + ty = exprType rhs sel_id = mkId name ty info - field_lbl = mkFieldLabel name ty tag - tag = assoc "MkId.mkDictSelId" ((sc_sel_ids ++ op_sel_ids) `zip` allFieldLabelTags) sel_id + field_lbl = mkFieldLabel name tycon ty tag + tag = assoc "MkId.mkDictSelId" (classSelIds clas `zip` allFieldLabelTags) sel_id - info = mkIdInfo (RecordSelId field_lbl) + info = mkIdInfo (RecordSelId field_lbl) NoCafRefs + `setArityInfo` exactArity 1 `setUnfoldingInfo` unfolding + `setTyGenInfo` TyGenNever -- We no longer use 'must-inline' on record selectors. They'll -- inline like crazy if they scrutinise a constructor unfolding = mkTopUnfolding rhs - (tyvars, _, sc_sel_ids, op_sel_ids, defms) = classBigSig clas + tyvars = classTyVars clas tycon = classTyCon clas [data_con] = tyConDataCons tycon @@ -399,7 +574,7 @@ mkDictSelId name clas ty Note (Coerce (head arg_tys) dict_ty) (Var dict_id) | otherwise = mkLams tyvars $ Lam dict_id $ Case (Var dict_id) dict_id - [(DataCon data_con, arg_ids, Var the_arg_id)] + [(DataAlt data_con, arg_ids, Var the_arg_id)] \end{code} @@ -410,26 +585,54 @@ mkDictSelId name clas ty %************************************************************************ \begin{code} -mkPrimitiveId :: PrimOp -> Id -mkPrimitiveId prim_op +mkPrimOpId :: PrimOp -> Id +mkPrimOpId prim_op = id where - (tyvars,arg_tys,res_ty) = primOpSig prim_op + (tyvars,arg_tys,res_ty, arity, strict_info) = primOpSig prim_op ty = mkForAllTys tyvars (mkFunTys arg_tys res_ty) - name = mkPrimOpIdName prim_op id + name = mkPrimOpIdName prim_op id = mkId name ty info - info = mkIdInfo (ConstantId (PrimOp prim_op)) - `setUnfoldingInfo` unfolding + info = mkIdInfo (PrimOpId prim_op) NoCafRefs + `setSpecInfo` rules + `setArityInfo` exactArity arity + `setStrictnessInfo` strict_info + + rules = addRule emptyCoreRules id (primOpRule prim_op) + + +-- For each ccall we manufacture a separate CCallOpId, giving it +-- a fresh unique, a type that is correct for this particular ccall, +-- and a CCall structure that gives the correct details about calling +-- convention etc. +-- +-- The *name* of this Id is a local name whose OccName gives the full +-- details of the ccall, type and all. This means that the interface +-- file reader can reconstruct a suitable Id + +mkCCallOpId :: Unique -> CCall -> Type -> Id +mkCCallOpId uniq ccall ty + = ASSERT( isEmptyVarSet (tyVarsOfType ty) ) + -- A CCallOpId should have no free type variables; + -- when doing substitutions won't substitute over it + mkId name ty info + where + occ_str = showSDocIface (braces (pprCCallOp ccall <+> ppr ty)) + -- The "occurrence name" of a ccall is the full info about the + -- ccall; it is encoded, but may have embedded spaces etc! - unfolding = mkCompulsoryUnfolding rhs - -- The mkCompulsoryUnfolding says that this Id absolutely - -- must be inlined. It's only used for primitives, - -- because we don't want to make a closure for each of them. + name = mkCCallName uniq occ_str + prim_op = CCallOp ccall - args = mkTemplateLocals arg_tys - rhs = mkLams tyvars $ mkLams args $ - mkPrimApp prim_op (map Type (mkTyVarTys tyvars) ++ map Var args) + info = mkIdInfo (PrimOpId prim_op) NoCafRefs + `setArityInfo` exactArity arity + `setStrictnessInfo` strict_info + + (_, tau) = splitForAllTys ty + (arg_tys, _) = splitFunTys tau + arity = length arg_tys + strict_info = mkStrictnessInfo (take arity (repeat wwPrim), False) \end{code} @@ -447,12 +650,23 @@ mkDictFunId :: Name -- Name to use for the dict fun; -> ThetaType -> Id -mkDictFunId dfun_name clas inst_tyvars inst_tys inst_decl_theta - = mkVanillaId dfun_name dfun_ty +mkDictFunId dfun_name clas inst_tyvars inst_tys dfun_theta + = mkId dfun_name dfun_ty info where - (class_tyvars, sc_theta, _, _, _) = classBigSig clas - sc_theta' = substTheta (mkTopTyVarSubst class_tyvars inst_tys) sc_theta + dfun_ty = mkSigmaTy inst_tyvars dfun_theta (mkDictTy clas inst_tys) + info = mkIdInfo DictFunId MayHaveCafRefs + `setTyGenInfo` TyGenNever + -- type is wired-in (see comment at TcClassDcl.tcClassSig), so + -- do not generalise it + -- An imported dfun may refer to CAFs, so we assume the worst +{- 1 dec 99: disable the Mark Jones optimisation for the sake + of compatibility with Hugs. + See `types/InstEnv' for a discussion related to this. + + (class_tyvars, sc_theta, _, _) = classBigSig clas + not_const (clas, tys) = not (isEmptyVarSet (tyVarsOfTypes tys)) + sc_theta' = substClasses (mkTopTyVarSubst class_tyvars inst_tys) sc_theta dfun_theta = case inst_decl_theta of [] -> [] -- If inst_decl_theta is empty, then we don't -- want to have any dict arguments, so that we can @@ -472,10 +686,7 @@ mkDictFunId dfun_name clas inst_tyvars inst_tys inst_decl_theta -- class Foo a => Baz a b where ... -- instance Wob b => Baz T b where.. -- Now sc_theta' has Foo T - - dfun_ty = mkSigmaTy inst_tyvars dfun_theta (mkDictTy clas inst_tys) - - not_const (clas, tys) = not (isEmptyVarSet (tyVarsOfTypes tys)) +-} \end{code} @@ -499,8 +710,7 @@ another gun with which to shoot yourself in the foot. unsafeCoerceId = pcMiscPrelId unsafeCoerceIdKey pREL_GHC SLIT("unsafeCoerce#") ty info where - info = vanillaIdInfo - `setUnfoldingInfo` mkCompulsoryUnfolding rhs + info = constantIdInfo `setUnfoldingInfo` mkCompulsoryUnfolding rhs ty = mkForAllTys [openAlphaTyVar,openBetaTyVar] @@ -518,15 +728,16 @@ evaluate its argument and call the dataToTag# primitive. getTagId = pcMiscPrelId getTagIdKey pREL_GHC SLIT("getTag#") ty info where - info = vanillaIdInfo + info = constantIdInfo `setUnfoldingInfo` mkCompulsoryUnfolding rhs -- We don't provide a defn for this; you must inline it ty = mkForAllTys [alphaTyVar] (mkFunTy alphaTy intPrimTy) [x,y] = mkTemplateLocals [alphaTy,alphaTy] rhs = mkLams [alphaTyVar,x] $ - Case (Var x) y [ (DEFAULT, [], - Con (PrimOp DataToTagOp) [Type alphaTy, Var y]) ] + Case (Var x) y [ (DEFAULT, [], mkApps (Var dataToTagId) [Type alphaTy, Var y]) ] + +dataToTagId = mkPrimOpId DataToTagOp \end{code} @realWorld#@ used to be a magic literal, \tr{void#}. If things get @@ -536,7 +747,11 @@ nasty as-is, change it back to a literal (@Literal@). realWorldPrimId -- :: State# RealWorld = pcMiscPrelId realWorldPrimIdKey pREL_GHC SLIT("realWorld#") realWorldStatePrimTy - noCafIdInfo + (noCafIdInfo `setUnfoldingInfo` mkOtherCon []) + -- The mkOtherCon makes it look that realWorld# is evaluated + -- which in turn makes Simplify.interestingArg return True, + -- which in turn makes INLINE things applied to realWorld# likely + -- to be inlined \end{code} @@ -564,10 +779,10 @@ templates, but we don't ever expect to generate code for it. \begin{code} eRROR_ID = pc_bottoming_Id errorIdKey pREL_ERR SLIT("error") errorTy -rEC_SEL_ERROR_ID - = generic_ERROR_ID recSelErrIdKey SLIT("patError") pAT_ERROR_ID = generic_ERROR_ID patErrorIdKey SLIT("patError") +rEC_SEL_ERROR_ID + = generic_ERROR_ID recSelErrIdKey SLIT("recSelError") rEC_CON_ERROR_ID = generic_ERROR_ID recConErrorIdKey SLIT("recConError") rEC_UPD_ERROR_ID @@ -600,7 +815,7 @@ pAR_ERROR_ID pcMiscPrelId :: Unique{-IdKey-} -> Module -> FAST_STRING -> Type -> IdInfo -> Id pcMiscPrelId key mod str ty info = let - name = mkWiredInIdName key mod (mkSrcVarOcc str) imp + name = mkWiredInName mod (mkVarOcc str) key imp = mkId name ty info -- the usual case... in imp @@ -621,16 +836,15 @@ pc_bottoming_Id key mod name ty generic_ERROR_ID u n = pc_bottoming_Id u pREL_ERR n errorTy -- Very useful... -noCafIdInfo = vanillaIdInfo `setCafInfo` NoCafRefs +noCafIdInfo = constantIdInfo `setCafInfo` NoCafRefs (openAlphaTyVar:openBetaTyVar:_) = openAlphaTyVars openAlphaTy = mkTyVarTy openAlphaTyVar openBetaTy = mkTyVarTy openBetaTyVar errorTy :: Type -errorTy = mkUsgTy UsMany $ - mkSigmaTy [openAlphaTyVar] [] (mkFunTys [mkUsgTy UsOnce (mkListTy charTy)] - (mkUsgTy UsMany openAlphaTy)) +errorTy = mkSigmaTy [openAlphaTyVar] [] (mkFunTys [mkListTy charTy] + openAlphaTy) -- Notice the openAlphaTyVar. It says that "error" can be applied -- to unboxed as well as boxed types. This is OK because it never -- returns, so the return type is irrelevant.