%
-% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
+% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
%
\section[PrelVals]{Prelude values the compiler ``knows about''}
\begin{code}
+module PrelVals where
+
#include "HsVersions.h"
-module PrelVals where
+import {-# SOURCE #-} CoreUnfold ( mkUnfolding )
-IMP_Ubiq()
-IMPORT_DELOOPER(IdLoop) ( UnfoldingGuidance(..), nullSpecEnv, SpecEnv )
-import Id ( SYN_IE(Id), GenId, mkImported, mkUserId, mkTemplateLocals )
-IMPORT_DELOOPER(PrelLoop)
+import Id ( Id, mkVanillaId, setIdInfo, mkTemplateLocals )
-- friends:
import PrelMods
import TysWiredIn
-- others:
-import CmdLineOpts ( maybe_CompilingGhcInternals )
import CoreSyn -- quite a bit
import IdInfo -- quite a bit
-import Literal ( mkMachInt )
-import Name ( ExportFlag(..) )
-import PragmaInfo
-import PrimOp ( PrimOp(..) )
-import Type ( mkTyVarTy )
-import TyVar ( openAlphaTyVar, alphaTyVar, betaTyVar, gammaTyVar )
+import Name ( mkWiredInIdName, Module )
+import Type
+import Var ( TyVar )
import Unique -- lots of *Keys
-import Util ( panic )
+
+import IOExts
\end{code}
+%************************************************************************
+%* *
+\subsection{Un-definable}
+%* *
+%************************************************************************
+
+These two can't be defined in Haskell.
+
+
+unsafeCoerce# isn't so much a PrimOp as a phantom identifier, that
+just gets expanded into a type coercion wherever it occurs. Hence we
+add it as a built-in Id with an unfolding here.
+
+The type variables we use here are "open" type variables: this means
+they can unify with both unlifted and lifted types. Hence we provide
+another gun with which to shoot yourself in the foot.
+
\begin{code}
--- only used herein:
-pcMiscPrelId :: Unique{-IdKey-} -> FAST_STRING -> FAST_STRING -> Type -> IdInfo -> Id
+unsafeCoerceId
+ = pcMiscPrelId unsafeCoerceIdKey pREL_GHC SLIT("unsafeCoerce#") ty
+ (mk_inline_unfolding template)
+ where
+ (alphaTyVar:betaTyVar:_) = openAlphaTyVars
+ alphaTy = mkTyVarTy alphaTyVar
+ betaTy = mkTyVarTy betaTyVar
+ ty = mkForAllTys [alphaTyVar,betaTyVar] (mkFunTy alphaTy betaTy)
+ [x] = mkTemplateLocals [alphaTy]
+ template = mkLams [alphaTyVar,betaTyVar,x] $
+ Note (Coerce betaTy alphaTy) (Var x)
+\end{code}
-pcMiscPrelId key m n ty info
- = let
- name = mkWiredInName key (OrigName m n) ExportAll
- imp = mkImported name ty info -- the usual case...
- in
- imp
- -- We lie and say the thing is imported; otherwise, we get into
- -- a mess with dependency analysis; e.g., core2stg may heave in
- -- random calls to GHCbase.unpackPS__. If GHCbase is the module
- -- being compiled, then it's just a matter of luck if the definition
- -- will be in "the right place" to be in scope.
+
+@realWorld#@ used to be a magic literal, \tr{void#}. If things get
+nasty as-is, change it back to a literal (@Literal@).
+
+\begin{code}
+realWorldPrimId
+ = pcMiscPrelId realWorldPrimIdKey pREL_GHC SLIT("realWorld#")
+ realWorldStatePrimTy
+ noCafIdInfo
\end{code}
+
%************************************************************************
%* *
\subsection[PrelVals-error-related]{@error@ and friends; @trace@}
@absentErr@ is a thing we put in for ``absent'' arguments. They jolly
well shouldn't be yanked on, but if one is, then you will get a
-friendly message from @absentErr@ (rather a totally random crash).
+friendly message from @absentErr@ (rather than a totally random
+crash).
@parError@ is a special version of @error@ which the compiler does
not know to be a bottoming Id. It is used in the @_par_@ and @_seq_@
pc_bottoming_Id key mod name ty
= pcMiscPrelId key mod name ty bottoming_info
where
- bottoming_info = noIdInfo `addInfo` mkBottomStrictnessInfo
+ bottoming_info = mkBottomStrictnessInfo `setStrictnessInfo` noCafIdInfo
-- these "bottom" out, no matter what their arguments
eRROR_ID
- = pc_bottoming_Id errorIdKey pRELUDE SLIT("error") errorTy
+ = pc_bottoming_Id errorIdKey pREL_ERR SLIT("error") errorTy
generic_ERROR_ID u n
- = pc_bottoming_Id u SLIT("GHCerr") n errorTy
+ = pc_bottoming_Id u pREL_ERR n errorTy
+rEC_SEL_ERROR_ID
+ = generic_ERROR_ID recSelErrIdKey SLIT("patError")
pAT_ERROR_ID
= generic_ERROR_ID patErrorIdKey SLIT("patError")
rEC_CON_ERROR_ID
= generic_ERROR_ID irrefutPatErrorIdKey SLIT("irrefutPatError")
nON_EXHAUSTIVE_GUARDS_ERROR_ID
= generic_ERROR_ID nonExhaustiveGuardsErrorIdKey SLIT("nonExhaustiveGuardsError")
-nO_DEFAULT_METHOD_ERROR_ID
- = generic_ERROR_ID noDefaultMethodErrorIdKey SLIT("noDefaultMethodError")
-nO_EXPLICIT_METHOD_ERROR_ID
- = generic_ERROR_ID nonExplicitMethodErrorIdKey SLIT("noExplicitMethodError")
+nO_METHOD_BINDING_ERROR_ID
+ = generic_ERROR_ID noMethodBindingErrorIdKey SLIT("noMethodBindingError")
aBSENT_ERROR_ID
- = pc_bottoming_Id absentErrorIdKey SLIT("GHCerr") SLIT("absentErr")
+ = pc_bottoming_Id absentErrorIdKey pREL_ERR SLIT("absentErr")
(mkSigmaTy [openAlphaTyVar] [] openAlphaTy)
pAR_ERROR_ID
- = pcMiscPrelId parErrorIdKey SLIT("GHCerr") SLIT("parError")
- (mkSigmaTy [openAlphaTyVar] [] openAlphaTy) noIdInfo
+ = pcMiscPrelId parErrorIdKey pREL_ERR SLIT("parError")
+ (mkSigmaTy [openAlphaTyVar] [] openAlphaTy) noCafIdInfo
openAlphaTy = mkTyVarTy openAlphaTyVar
-- returns, so the return type is irrelevant.
\end{code}
-We want \tr{GHCbase.trace} to be wired in
-because we don't want the strictness analyser to get ahold of it,
-decide that the second argument is strict, evaluate that first (!!),
-and make a jolly old mess.
-\begin{code}
-tRACE_ID
- = pcMiscPrelId traceIdKey gHC__ SLIT("trace") traceTy
- (noIdInfo `addInfo` pcGenerateSpecs traceIdKey tRACE_ID noIdInfo traceTy)
- where
- traceTy = mkSigmaTy [alphaTyVar] [] (mkFunTys [mkListTy charTy, alphaTy] alphaTy)
-\end{code}
%************************************************************************
%* *
-\subsection[PrelVals-Integer-support]{To support @Integer@ and @String@ literals}
+\subsection{Utilities}
%* *
%************************************************************************
-\begin{code}
-packStringForCId
- = pcMiscPrelId packCStringIdKey{-ToDo:rename-} gHC__ SLIT("packStringForC__")
- (mkFunTys [stringTy] byteArrayPrimTy) noIdInfo
-
---------------------------------------------------------------------
-
-unpackCStringId
- = pcMiscPrelId unpackCStringIdKey gHC__ SLIT("unpackPS__")
- (mkFunTys [addrPrimTy{-a char *-}] stringTy) noIdInfo
--- Andy says:
--- (FunTy addrPrimTy{-a char *-} stringTy) (noIdInfo `addInfo` mkArityInfo 1)
--- but I don't like wired-in IdInfos (WDP)
-
-unpackCString2Id -- for cases when a string has a NUL in it
- = pcMiscPrelId unpackCString2IdKey gHC__ SLIT("unpackPS2__")
- (mkFunTys [addrPrimTy{-a char *-}, intPrimTy{-length-}] stringTy)
- noIdInfo
-
---------------------------------------------------------------------
-unpackCStringAppendId
- = pcMiscPrelId unpackCStringAppendIdKey gHC__ SLIT("unpackAppendPS__")
- (mkFunTys [addrPrimTy{-a "char *" pointer-},stringTy] stringTy)
- ((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding unpackCStringAppendIdKey-})
- `addInfo` mkArityInfo 2)
-
-unpackCStringFoldrId
- = pcMiscPrelId unpackCStringFoldrIdKey gHC__ SLIT("unpackFoldrPS__")
- (mkSigmaTy [alphaTyVar] []
- (mkFunTys [addrPrimTy{-a "char *" pointer-},
- mkFunTys [charTy, alphaTy] alphaTy,
- alphaTy]
- alphaTy))
- ((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding unpackCStringFoldrIdKey-})
- `addInfo` mkArityInfo 3)
-\end{code}
+Note IMustBeINLINEd below. These things have the same status as
+constructor functions, i.e. they will *always* be inlined, wherever
+they occur.
-OK, this is Will's idea: we should have magic values for Integers 0,
-+1, +2, and -1 (go ahead, fire me):
\begin{code}
-integerZeroId
- = pcMiscPrelId integerZeroIdKey gHC__ SLIT("integer_0") integerTy noIdInfo
-integerPlusOneId
- = pcMiscPrelId integerPlusOneIdKey gHC__ SLIT("integer_1") integerTy noIdInfo
-integerPlusTwoId
- = pcMiscPrelId integerPlusTwoIdKey gHC__ SLIT("integer_2") integerTy noIdInfo
-integerMinusOneId
- = pcMiscPrelId integerMinusOneIdKey gHC__ SLIT("integer_m1") integerTy noIdInfo
-\end{code}
+mk_inline_unfolding expr = setUnfoldingInfo (mkUnfolding expr) $
+ setInlinePragInfo IMustBeINLINEd noIdInfo
-%************************************************************************
-%* *
-\subsection[PrelVals-parallel]{@seq@ and @par@: for parallel operation (only)}
-%* *
-%************************************************************************
+exactArityInfo n = exactArity n `setArityInfo` noIdInfo
-\begin{code}
-{- OUT:
---------------------------------------------------------------------
--- seqId :: "seq", used w/ GRIP, etc., is really quite similar to
--- dangerousEval
-{-
- OLDER:
- seq = /\ a b -> \ x y -> case x of { _ -> y }
-
- OLD:
- seq = /\ a b -> \ x y -> case seq# x y of { _Lift y' -> y' }
-
- NEW (95/05):
- seq = /\ a b -> \ x::a y::b -> case seq# x of { 0# -> parError#; _ -> y; }
-
--}
-
-seqId = pcMiscPrelId seqIdKey gHC__ SLIT("seq")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding seq_template))
- where
- [x, y, z]
- = mkTemplateLocals [
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
+pcMiscPrelId :: Unique{-IdKey-} -> Module -> FAST_STRING -> Type -> IdInfo -> Id
- seq_template
- = mkLam [alphaTyVar, betaTyVar] [x, y] (
- Case (Prim SeqOp [TyArg alphaTy, VarArg x]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
---------------------------------------------------------------------
--- parId :: "par", also used w/ GRIP, etc.
-{-
- OLDER:
-
- par = /\ a b -> \ x y -> case (par# (case x of { _ -> () })) of { _ -> y }
-
- OLD:
-
- par = /\ a b -> \ x y -> case par# x y of { _Lift y' -> y' }
-
- NEW (95/05):
-
- par = /\ a b -> \ x::a y::b -> case par# x of { 0# -> parError#; _ -> y; }
-
--}
-parId = pcMiscPrelId parIdKey gHC__ SLIT("par")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding par_template))
- where
- [x, y, z]
- = mkTemplateLocals [
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- par_template
- = mkLam [alphaTyVar, betaTyVar] [x, y] (
- Case (Prim ParOp [TyArg alphaTy, VarArg x]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
--- forkId :: "fork", for *required* concurrent threads
-{-
- _fork_ = /\ a b -> \ x::a y::b -> case fork# x of { 0# -> parError#; _ -> y; }
--}
-forkId = pcMiscPrelId forkIdKey gHC__ SLIT("fork")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding fork_template))
- where
- [x, y, z]
- = mkTemplateLocals [
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- fork_template
- = mkLam [alphaTyVar, betaTyVar] [x, y] (
- Case (Prim ForkOp [TyArg alphaTy, VarArg x]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
--}
-\end{code}
-
-GranSim ones:
-\begin{code}
-{- OUT:
-parLocalId = pcMiscPrelId parLocalIdKey gHC__ SLIT("parLocal")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy, alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parLocal_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- parLocal_template
- = mkLam [alphaTyVar, betaTyVar] [w, g, s, p, x, y] (
- Case (Prim ParLocalOp [TyArg alphaTy, TyArg betaTy, VarArg x, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
-parGlobalId = pcMiscPrelId parGlobalIdKey gHC__ SLIT("parGlobal")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy, alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parGlobal_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- parGlobal_template
- = mkLam [alphaTyVar, betaTyVar] [w, g, s, p, x, y] (
- Case (Prim ParGlobalOp [TyArg alphaTy, TyArg betaTy, VarArg x, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
-
-parAtId = pcMiscPrelId parAtIdKey gHC__ SLIT("parAt")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy,
- alphaTy, betaTy, gammaTy] gammaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parAt_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, v, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-v-} alphaTy,
- {-x-} betaTy,
- {-y-} gammaTy,
- {-z-} intPrimTy
- ]
-
- parAt_template
- = mkLam [alphaTyVar, betaTyVar, gammaTyVar] [w, g, s, p, v, x, y] (
- Case (Prim ParAtOp [TyArg alphaTy, TyArg betaTy, TyArg gammaTy, VarArg x, VarArg v, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [gammaTy])]
- (BindDefault z (Var y))))
-
-parAtAbsId = pcMiscPrelId parAtAbsIdKey gHC__ SLIT("parAtAbs")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy, intPrimTy, alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parAtAbs_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, v, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-v-} intPrimTy,
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- parAtAbs_template
- = mkLam [alphaTyVar, betaTyVar] [w, g, s, p, v, x, y] (
- Case (Prim ParAtAbsOp [TyArg alphaTy, TyArg betaTy, VarArg x, VarArg v, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
-parAtRelId = pcMiscPrelId parAtRelIdKey gHC__ SLIT("parAtRel")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy, intPrimTy, alphaTy, betaTy] betaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parAtRel_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, v, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-v-} intPrimTy,
- {-x-} alphaTy,
- {-y-} betaTy,
- {-z-} intPrimTy
- ]
-
- parAtRel_template
- = mkLam [alphaTyVar, betaTyVar] [w, g, s, p, v, x, y] (
- Case (Prim ParAtRelOp [TyArg alphaTy, TyArg betaTy, VarArg x, VarArg v, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [betaTy])]
- (BindDefault z (Var y))))
-
-parAtForNowId = pcMiscPrelId parAtForNowIdKey gHC__ SLIT("parAtForNow")
- (mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [intPrimTy, intPrimTy, intPrimTy, intPrimTy,
- alphaTy, betaTy, gammaTy] gammaTy))
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding parAtForNow_template))
- where
- -- Annotations: w: name, g: gran. info, s: size info, p: par info -- HWL
- [w, g, s, p, v, x, y, z]
- = mkTemplateLocals [
- {-w-} intPrimTy,
- {-g-} intPrimTy,
- {-s-} intPrimTy,
- {-p-} intPrimTy,
- {-v-} alphaTy,
- {-x-} betaTy,
- {-y-} gammaTy,
- {-z-} intPrimTy
- ]
-
- parAtForNow_template
- = mkLam [alphaTyVar, betaTyVar, gammaTyVar] [w, g, s, p, v, x, y] (
- Case (Prim ParAtForNowOp [TyArg alphaTy, TyArg betaTy, TyArg gammaTy, VarArg x, VarArg v, VarArg w, VarArg g, VarArg s, VarArg p, VarArg y]) (
- PrimAlts
- [(mkMachInt 0, mkTyApp (Var pAR_ERROR_ID) [gammaTy])]
- (BindDefault z (Var y))))
-
--- copyable and noFollow are currently merely hooks: they are translated into
--- calls to the macros COPYABLE and NOFOLLOW -- HWL
-
-copyableId = pcMiscPrelId copyableIdKey gHC__ SLIT("copyable")
- (mkSigmaTy [alphaTyVar] []
- alphaTy)
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding copyable_template))
- where
- -- Annotations: x: closure that's tagged to by copyable
- [x, z]
- = mkTemplateLocals [
- {-x-} alphaTy,
- {-z-} alphaTy
- ]
-
- copyable_template
- = mkLam [alphaTyVar] [x] ( Prim CopyableOp [TyArg alphaTy, VarArg x] )
-
-noFollowId = pcMiscPrelId noFollowIdKey gHC__ SLIT("noFollow")
- (mkSigmaTy [alphaTyVar] []
- alphaTy)
- (noIdInfo `addInfo_UF` (mkUnfolding EssentialUnfolding noFollow_template))
- where
- -- Annotations: x: closure that's tagged to not follow
- [x, z]
- = mkTemplateLocals [
- {-x-} alphaTy,
- {-z-} alphaTy
- ]
-
- noFollow_template
- = mkLam [alphaTyVar] [x] ( Prim NoFollowOp [TyArg alphaTy, VarArg x] )
--}
-\end{code}
-
-%************************************************************************
-%* *
-\subsection[PrelVals-runST]{@runST@: Magic start-state-transformer function}
-%* *
-%************************************************************************
-
-@runST@ has a non-Haskell-able type:
-\begin{verbatim}
--- runST :: forall a. (forall s. _ST s a) -> a
--- which is to say ::
--- forall a. (forall s. (_State s -> (a, _State s))) -> a
-
-runST a m = case m _RealWorld (S# _RealWorld realWorld#) of
- (r :: a, wild :: _State _RealWorld) -> r
-\end{verbatim}
-
-We unfold always, just for simplicity:
-\begin{code}
-runSTId
- = pcMiscPrelId runSTIdKey gHC__ SLIT("runST") run_ST_ty id_info
- where
- s_tv = betaTyVar
- s = betaTy
-
- st_ty a = mkSigmaTy [s_tv] [] (mkStateTransformerTy s a)
-
- run_ST_ty
- = mkSigmaTy [alphaTyVar] [] (mkFunTys [st_ty alphaTy] alphaTy)
- -- NB: rank-2 polymorphism! (forall inside the st_ty...)
-
- id_info
- = noIdInfo
- `addInfo` mkArityInfo 1
- `addInfo` mkStrictnessInfo [WwStrict] Nothing
- `addInfo` mkArgUsageInfo [ArgUsage 1]
- -- ABSOLUTELY NO UNFOLDING, e.g.: (mkUnfolding EssentialUnfolding run_ST_template)
- -- see example below
-{- OUT:
- [m, t, r, wild]
- = mkTemplateLocals [
- {-m-} st_ty alphaTy,
- {-t-} realWorldStateTy,
- {-r-} alphaTy,
- {-_-} realWorldStateTy
- ]
-
- run_ST_template
- = mkLam [alphaTyVar] [m] (
- Let (NonRec t (Con stateDataCon [TyArg realWorldTy, VarArg realWorldPrimId])) (
- Case (App (mkTyApp (Var m) [realWorldTy]) (VarArg t)) (
- AlgAlts
- [(mkTupleCon 2, [r, wild], Var r)]
- NoDefault)))
--}
-\end{code}
-
-SLPJ 95/04: Why @runST@ must not have an unfolding; consider:
-\begin{verbatim}
-f x =
- runST ( \ s -> let
- (a, s') = newArray# 100 [] s
- (_, s'') = fill_in_array_or_something a x s'
- in
- freezeArray# a s'' )
-\end{verbatim}
-If we inline @runST@, we'll get:
-\begin{verbatim}
-f x = let
- (a, s') = newArray# 100 [] realWorld#{-NB-}
- (_, s'') = fill_in_array_or_something a x s'
- in
- freezeArray# a s''
-\end{verbatim}
-And now the @newArray#@ binding can be floated to become a CAF, which
-is totally and utterly wrong:
-\begin{verbatim}
-f = let
- (a, s') = newArray# 100 [] realWorld#{-NB-} -- YIKES!!!
+pcMiscPrelId key mod occ ty info
+ = let
+ name = mkWiredInIdName key mod occ imp
+ imp = mkVanillaId name ty `setIdInfo` info -- the usual case...
in
- \ x ->
- let (_, s'') = fill_in_array_or_something a x s' in
- freezeArray# a s''
-\end{verbatim}
-All calls to @f@ will share a {\em single} array! End SLPJ 95/04.
-
-@realWorld#@ used to be a magic literal, \tr{void#}. If things get
-nasty as-is, change it back to a literal (@Literal@).
-\begin{code}
-realWorldPrimId
- = pcMiscPrelId realWorldPrimIdKey gHC_BUILTINS SLIT("realWorld#")
- realWorldStatePrimTy
- noIdInfo
-\end{code}
-
-\begin{code}
-voidId = pcMiscPrelId voidIdKey gHC_BUILTINS SLIT("void") voidTy noIdInfo
-\end{code}
-
-%************************************************************************
-%* *
-\subsection[PrelVals-foldr-build]{Values known about for ``foldr/build''}
-%* *
-%************************************************************************
-
-\begin{code}
-buildId
- = pcMiscPrelId buildIdKey SLIT("GHCerr") SLIT("build") buildTy
- ((((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding buildIdKey-})
- `addInfo` mkStrictnessInfo [WwStrict] Nothing)
- `addInfo` mkArgUsageInfo [ArgUsage 2])
- `addInfo` pcGenerateSpecs buildIdKey buildId noIdInfo{-ToDo-} buildTy)
- -- cheating, but since _build never actually exists ...
- where
- -- The type of this strange object is:
- -- \/ a . (\/ b . (a -> b -> b) -> b -> b) -> [a]
-
- buildTy = mkSigmaTy [alphaTyVar] [] (mkFunTys [build_ty] (mkListTy alphaTy))
- where
- build_ty = mkSigmaTy [betaTyVar] []
- (mkFunTys [mkFunTys [alphaTy, betaTy] betaTy, betaTy] betaTy)
-\end{code}
-
-@mkBuild@ is sugar for building a build!
-
-@mkbuild ty tv c n e@ $Rightarrow$ @build ty (/\ tv -> \ c n -> e)@
-@ty@ is the type of the list.
-@tv@ is always a new type variable.
-@c,n@ are Id's for the abstract cons and nil, @g@ for let binding the argument argument.
- c :: a -> b -> b
- n :: b
- v :: (\/ b . (a -> b -> b) -> b -> b) -> [a]
--- \/ a . (\/ b . (a -> b -> b) -> b -> b) -> [a]
-@e@ is the object right inside the @build@
-
-\begin{code}
-mkBuild :: Type
- -> TyVar
- -> Id
- -> Id
- -> Id
- -> CoreExpr -- template
- -> CoreExpr -- template
-
-mkBuild ty tv c n g expr
- = Let (NonRec g (mkLam [tv] [c,n] expr))
- (App (mkTyApp (Var buildId) [ty]) (VarArg g))
-\end{code}
-
-\begin{code}
-augmentId
- = pcMiscPrelId augmentIdKey SLIT("GHCerr") SLIT("augment") augmentTy
- (((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding augmentIdKey-})
- `addInfo` mkStrictnessInfo [WwStrict,WwLazy False] Nothing)
- `addInfo` mkArgUsageInfo [ArgUsage 2,UnknownArgUsage])
- -- cheating, but since _augment never actually exists ...
- where
- -- The type of this strange object is:
- -- \/ a . (\/ b . (a -> b -> b) -> b -> b) -> [a] -> [a]
-
- augmentTy = mkSigmaTy [alphaTyVar] [] (mkFunTys [aug_ty, mkListTy alphaTy] (mkListTy alphaTy))
- where
- aug_ty = mkSigmaTy [betaTyVar] []
- (mkFunTys [mkFunTys [alphaTy, betaTy] betaTy, betaTy] betaTy)
-\end{code}
+ imp
+ -- We lie and say the thing is imported; otherwise, we get into
+ -- a mess with dependency analysis; e.g., core2stg may heave in
+ -- random calls to GHCbase.unpackPS__. If GHCbase is the module
+ -- being compiled, then it's just a matter of luck if the definition
+ -- will be in "the right place" to be in scope.
-\begin{code}
-foldrId = pcMiscPrelId foldrIdKey pRELUDE SLIT("foldr")
- foldrTy idInfo
- where
- foldrTy =
- mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [mkFunTys [alphaTy, betaTy] betaTy, betaTy, mkListTy alphaTy] betaTy)
-
- idInfo = (((((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding foldrIdKey-})
- `addInfo` mkStrictnessInfo [WwLazy False,WwLazy False,WwStrict] Nothing)
- `addInfo` mkArityInfo 3)
- `addInfo` mkUpdateInfo [2,2,1])
- `addInfo` pcGenerateSpecs foldrIdKey foldrId noIdInfo{-ToDo-} foldrTy)
-
-foldlId = pcMiscPrelId foldlIdKey pRELUDE SLIT("foldl")
- foldlTy idInfo
- where
- foldlTy =
- mkSigmaTy [alphaTyVar, betaTyVar] []
- (mkFunTys [mkFunTys [alphaTy, betaTy] alphaTy, alphaTy, mkListTy betaTy] alphaTy)
-
- idInfo = (((((noIdInfo
- {-LATER:`addInfo_UF` mkMagicUnfolding foldlIdKey-})
- `addInfo` mkStrictnessInfo [WwLazy False,WwLazy False,WwStrict] Nothing)
- `addInfo` mkArityInfo 3)
- `addInfo` mkUpdateInfo [2,2,1])
- `addInfo` pcGenerateSpecs foldlIdKey foldlId noIdInfo{-ToDo-} foldlTy)
-
--- A bit of magic goes no here. We translate appendId into ++,
--- you have to be carefull when you actually compile append:
--- xs ++ ys = augment (\ c n -> foldr c n xs) ys
--- {- unfold augment -}
--- = foldr (:) ys xs
--- {- fold foldr to append -}
--- = ys `appendId` xs
--- = ys ++ xs -- ugg!
--- *BUT* you want (++) and not _append in your interfaces.
---
--- So you have to turn *off* unfolding of foldr inside FoldrBuild.hs inside
--- the prelude.
---
-{- OLD: doesn't apply with 1.3
-appendId
- = pcMiscPrelId appendIdKey pRELUDE_LIST SLIT("++") appendTy idInfo
- where
- appendTy =
- (mkSigmaTy [alphaTyVar] []
- (mkFunTys [mkListTy alphaTy, mkListTy alphaTy] (mkListTy alphaTy)))
- idInfo = (((noIdInfo
- `addInfo` mkStrictnessInfo [WwStrict,WwLazy False] Nothing)
- `addInfo` mkArityInfo 2)
- `addInfo` mkUpdateInfo [1,2])
--}
+-- very useful...
+noCafIdInfo = NoCafRefs `setCafInfo` noIdInfo
\end{code}
-%************************************************************************
-%* *
-\subsection[PrelUtils-specialisations]{Specialisations for builtin values}
-%* *
-%************************************************************************
-
-The specialisations which exist for the builtin values must be recorded in
-their IdInfos.
-
-NOTE: THE USES OF THE pcGenerate... FUNCTIONS MUST CORRESPOND
- TO THE SPECIALISATIONS DECLARED IN THE PRELUDE !!!
-
-HACK: We currently use the same unique for the specialised Ids.
-
-The list @specing_types@ determines the types for which specialised
-versions are created. Note: This should correspond with the
-types passed to the pre-processor with the -genSPECS arg (see ghc.lprl).
-
-ToDo: Create single mkworld definition which is grabbed here and in ghc.lprl
-
-\begin{code}
-pcGenerateSpecs :: Unique -> Id -> IdInfo -> Type -> SpecEnv
-pcGenerateSpecs key id info ty
- = nullSpecEnv
-
-{- LATER:
-
-pc_gen_specs True key id info ty
-
-pc_gen_specs is_id key id info ty
- = mkSpecEnv spec_infos
- where
- spec_infos = [ let spec_ty = specialiseTy ty spec_tys 0
- spec_id = if is_id
- then mkSpecId key {- HACK WARNING: same unique! -}
- id spec_tys spec_ty info
- else panic "SpecData:SpecInfo:SpecId"
- in
- SpecInfo spec_tys (length ctxts) spec_id
- | spec_tys <- specialisations ]
-
- (tyvars, ctxts, _) = splitSigmaTy ty
- no_tyvars = length tyvars
-
- specialisations = if no_tyvars == 0
- then []
- else tail (cross_product no_tyvars specing_types)
-
- -- N.B. tail removes fully polymorphic specialisation
-
-cross_product 0 tys = []
-cross_product 1 tys = map (:[]) tys
-cross_product n tys = concat [map (:cp) tys | cp <- cross_product (n-1) tys]
-
-
-specing_types = [Nothing,
- Just charPrimTy,
- Just doublePrimTy,
- Just intPrimTy ]
--}
-\end{code}
projects / ghc-hetmet.git / blobdiff