%
-% (c) The GRASP/AQUA Project, Glasgow University, 1992-1996
+% (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
%
\section[PrimOp]{Primitive operations (machine-level)}
\begin{code}
module PrimOp (
PrimOp(..), allThePrimOps,
- tagOf_PrimOp, -- ToDo: rm
- primOp_str, -- sigh
- primOpType, isCompareOp,
- commutableOp,
+ primOpType, primOpSig,
+ primOpTag, maxPrimOpTag, primOpOcc,
- PrimOpResultInfo(..),
- getPrimOpResultInfo,
+ primOpOutOfLine, primOpNeedsWrapper,
+ primOpOkForSpeculation, primOpIsCheap, primOpIsDupable,
- primOpCanTriggerGC, primOpNeedsWrapper,
- primOpOkForSpeculation, primOpIsCheap,
- fragilePrimOp,
- HeapRequirement(..), primOpHeapReq,
- StackRequirement(..), primOpStackRequired,
-
- -- export for the Native Code Generator
- primOpInfo, -- needed for primOpNameInfo
- PrimOpInfo(..),
-
- pprPrimOp, showPrimOp
+ getPrimOpResultInfo, PrimOpResultInfo(..)
) where
#include "HsVersions.h"
-import PrimRep -- most of it
import TysPrim
import TysWiredIn
-import CStrings ( identToC )
-import CallConv ( CallConv, pprCallConv )
-import Constants ( mIN_MP_INT_SIZE, mP_STRUCT_SIZE )
-import HeapOffs ( addOff, intOff, totHdrSize, HeapOffset )
+import NewDemand
+import Var ( TyVar )
+import OccName ( OccName, pprOccName, mkVarOccFS )
+import TyCon ( TyCon, isPrimTyCon, tyConPrimRep, PrimRep(..) )
+import Type ( Type, mkForAllTys, mkFunTy, mkFunTys, tyConAppTyCon,
+ typePrimRep )
+import BasicTypes ( Arity, Boxity(..) )
import Outputable
-import PprType ( pprParendType )
-import SMRep ( SMRep(..), SMSpecRepKind(..), SMUpdateKind(..) )
-import TyCon ( TyCon{-instances-} )
-import Type ( mkForAllTys, mkFunTy, mkFunTys, mkTyConApp, typePrimRep,
- splitAlgTyConApp, Type
- )
-import TyVar --( alphaTyVar, betaTyVar, gammaTyVar )
-import Unique ( Unique{-instance Eq-} )
-import Util ( panic#, assoc, panic{-ToDo:rm-} )
-
-import GlaExts ( Int(..), Int#, (==#) )
+import FastTypes
\end{code}
%************************************************************************
These are in \tr{state-interface.verb} order.
\begin{code}
-data PrimOp
- -- dig the FORTRAN/C influence on the names...
-
- -- comparisons:
-
- = CharGtOp | CharGeOp | CharEqOp | CharNeOp | CharLtOp | CharLeOp
- | IntGtOp | IntGeOp | IntEqOp | IntNeOp | IntLtOp | IntLeOp
- | WordGtOp | WordGeOp | WordEqOp | WordNeOp | WordLtOp | WordLeOp
- | AddrGtOp | AddrGeOp | AddrEqOp | AddrNeOp | AddrLtOp | AddrLeOp
- | FloatGtOp | FloatGeOp | FloatEqOp | FloatNeOp | FloatLtOp | FloatLeOp
- | DoubleGtOp | DoubleGeOp | DoubleEqOp | DoubleNeOp | DoubleLtOp | DoubleLeOp
-
- -- Char#-related ops:
- | OrdOp | ChrOp
-
- -- Int#-related ops:
- -- IntAbsOp unused?? ADR
- | IntAddOp | IntSubOp | IntMulOp | IntQuotOp
- | IntRemOp | IntNegOp | IntAbsOp
- | ISllOp | ISraOp | ISrlOp -- shift {left,right} {arithmetic,logical}
-
- -- Word#-related ops:
- | WordQuotOp | WordRemOp
- | AndOp | OrOp | NotOp | XorOp
- | SllOp | SrlOp -- shift {left,right} {logical}
- | Int2WordOp | Word2IntOp -- casts
-
- -- Addr#-related ops:
- | Int2AddrOp | Addr2IntOp -- casts
-
- -- Float#-related ops:
- | FloatAddOp | FloatSubOp | FloatMulOp | FloatDivOp | FloatNegOp
- | Float2IntOp | Int2FloatOp
-
- | FloatExpOp | FloatLogOp | FloatSqrtOp
- | FloatSinOp | FloatCosOp | FloatTanOp
- | FloatAsinOp | FloatAcosOp | FloatAtanOp
- | FloatSinhOp | FloatCoshOp | FloatTanhOp
- -- not all machines have these available conveniently:
- -- | FloatAsinhOp | FloatAcoshOp | FloatAtanhOp
- | FloatPowerOp -- ** op
-
- -- Double#-related ops:
- | DoubleAddOp | DoubleSubOp | DoubleMulOp | DoubleDivOp | DoubleNegOp
- | Double2IntOp | Int2DoubleOp
- | Double2FloatOp | Float2DoubleOp
-
- | DoubleExpOp | DoubleLogOp | DoubleSqrtOp
- | DoubleSinOp | DoubleCosOp | DoubleTanOp
- | DoubleAsinOp | DoubleAcosOp | DoubleAtanOp
- | DoubleSinhOp | DoubleCoshOp | DoubleTanhOp
- -- not all machines have these available conveniently:
- -- | DoubleAsinhOp | DoubleAcoshOp | DoubleAtanhOp
- | DoublePowerOp -- ** op
-
- -- Integer (and related...) ops:
- -- slightly weird -- to match GMP package.
- | IntegerAddOp | IntegerSubOp | IntegerMulOp
- | IntegerQuotRemOp | IntegerDivModOp | IntegerNegOp
-
- | IntegerCmpOp
-
- | Integer2IntOp | Integer2WordOp
- | Int2IntegerOp | Word2IntegerOp
- | Addr2IntegerOp -- "Addr" is *always* a literal string
- -- casting to/from Integer and 64-bit (un)signed quantities.
- | IntegerToInt64Op | Int64ToIntegerOp
- | IntegerToWord64Op | Word64ToIntegerOp
- -- ?? gcd, etc?
-
- | FloatEncodeOp | FloatDecodeOp
- | DoubleEncodeOp | DoubleDecodeOp
-
- -- primitive ops for primitive arrays
-
- | NewArrayOp
- | NewByteArrayOp PrimRep
-
- | SameMutableArrayOp
- | SameMutableByteArrayOp
-
- | ReadArrayOp | WriteArrayOp | IndexArrayOp -- for arrays of Haskell ptrs
-
- | ReadByteArrayOp PrimRep
- | WriteByteArrayOp PrimRep
- | IndexByteArrayOp PrimRep
- | IndexOffAddrOp PrimRep
- -- PrimRep can be one of {Char,Int,Addr,Float,Double}Kind.
- -- This is just a cheesy encoding of a bunch of ops.
- -- Note that ForeignObjRep is not included -- the only way of
- -- creating a ForeignObj is with a ccall or casm.
- | IndexOffForeignObjOp PrimRep
- | WriteOffAddrOp PrimRep
-
- | UnsafeFreezeArrayOp | UnsafeFreezeByteArrayOp
- | SizeofByteArrayOp | SizeofMutableByteArrayOp
-
- | NewSynchVarOp -- for MVars and IVars
- | SameMVarOp
- | TakeMVarOp | PutMVarOp
- | ReadIVarOp | WriteIVarOp
-
- | MakeForeignObjOp -- foreign objects (malloc pointers or any old URL)
- | WriteForeignObjOp -- modifying foreign objects [obscuro factor: 200]
- | MakeStablePtrOp | DeRefStablePtrOp
-\end{code}
-A special ``trap-door'' to use in making calls direct to C functions:
-\begin{code}
- | CCallOp (Either
- FAST_STRING -- Left fn => An "unboxed" ccall# to `fn'.
- Unique) -- Right u => first argument (an Addr#) is the function pointer
- -- (unique is used to
-
-
- Bool -- True <=> really a "casm"
- Bool -- True <=> might invoke Haskell GC
- CallConv -- calling convention to use.
- [Type] -- Unboxed arguments; the state-token
- -- argument will have been put *first*
- Type -- Return type; one of the "StateAnd<blah>#" types
-
- -- (... to be continued ... )
+-- supplies:
+-- data PrimOp = ...
+#include "primop-data-decl.hs-incl"
\end{code}
-The ``type'' of @CCallOp foo [t1, ... tm] r@ is @t1 -> ... tm -> r@.
-(See @primOpInfo@ for details.)
-
-Note: that first arg and part of the result should be the system state
-token (which we carry around to fool over-zealous optimisers) but
-which isn't actually passed.
-
-For example, we represent
-\begin{pseudocode}
-((ccall# foo [StablePtr# a, Int] Float) sp# i#) :: (Float, IoWorld)
-\end{pseudocode}
-by
-\begin{pseudocode}
-Case
- ( Prim
- (CCallOp "foo" [Universe#, StablePtr# a, Int#] FloatPrimAndUniverse False)
- -- :: Universe# -> StablePtr# a -> Int# -> FloatPrimAndUniverse
- []
- [w#, sp# i#]
- )
- (AlgAlts [ ( FloatPrimAndIoWorld,
- [f#, w#],
- Con (TupleCon 2) [Float, IoWorld] [F# f#, World w#]
- ) ]
- NoDefault
- )
-\end{pseudocode}
-
-Nota Bene: there are some people who find the empty list of types in
-the @Prim@ somewhat puzzling and would represent the above by
-\begin{pseudocode}
-Case
- ( Prim
- (CCallOp "foo" [alpha1, alpha2, alpha3] alpha4 False)
- -- :: /\ alpha1, alpha2 alpha3, alpha4.
- -- alpha1 -> alpha2 -> alpha3 -> alpha4
- [Universe#, StablePtr# a, Int#, FloatPrimAndIoWorld]
- [w#, sp# i#]
- )
- (AlgAlts [ ( FloatPrimAndIoWorld,
- [f#, w#],
- Con (TupleCon 2) [Float, IoWorld] [F# f#, World w#]
- ) ]
- NoDefault
- )
-\end{pseudocode}
-
-But, this is a completely different way of using @CCallOp@. The most
-major changes required if we switch to this are in @primOpInfo@, and
-the desugarer. The major difficulty is in moving the HeapRequirement
-stuff somewhere appropriate. (The advantage is that we could simplify
-@CCallOp@ and record just the number of arguments with corresponding
-simplifications in reading pragma unfoldings, the simplifier,
-instantiation (etc) of core expressions, ... . Maybe we should think
-about using it this way?? ADR)
+Used for the Ord instance
\begin{code}
- -- (... continued from above ... )
-
- -- one to support "errorIO" (and, thereby, "error")
- | ErrorIOPrimOp
-
- -- Operation to test two closure addresses for equality (yes really!)
- -- BLAME ALASTAIR REID FOR THIS! THE REST OF US ARE INNOCENT!
- | ReallyUnsafePtrEqualityOp
-
- -- three for parallel stuff
- | SeqOp
- | ParOp
- | ForkOp
-
- -- three for concurrency
- | DelayOp
- | WaitReadOp
- | WaitWriteOp
-
- | ParGlobalOp -- named global par
- | ParLocalOp -- named local par
- | ParAtOp -- specifies destination of local par
- | ParAtAbsOp -- specifies destination of local par (abs processor)
- | ParAtRelOp -- specifies destination of local par (rel processor)
- | ParAtForNowOp -- specifies initial destination of global par
- | CopyableOp -- marks copyable code
- | NoFollowOp -- marks non-followup expression
+primOpTag :: PrimOp -> Int
+primOpTag op = iBox (tagOf_PrimOp op)
-\end{code}
+-- supplies
+-- tagOf_PrimOp :: PrimOp -> FastInt
+#include "primop-tag.hs-incl"
-Deriving Ix is what we really want! ToDo
-(Chk around before deleting...)
-\begin{code}
-tagOf_PrimOp CharGtOp = (ILIT(1) :: FAST_INT)
-tagOf_PrimOp CharGeOp = ILIT( 2)
-tagOf_PrimOp CharEqOp = ILIT( 3)
-tagOf_PrimOp CharNeOp = ILIT( 4)
-tagOf_PrimOp CharLtOp = ILIT( 5)
-tagOf_PrimOp CharLeOp = ILIT( 6)
-tagOf_PrimOp IntGtOp = ILIT( 7)
-tagOf_PrimOp IntGeOp = ILIT( 8)
-tagOf_PrimOp IntEqOp = ILIT( 9)
-tagOf_PrimOp IntNeOp = ILIT( 10)
-tagOf_PrimOp IntLtOp = ILIT( 11)
-tagOf_PrimOp IntLeOp = ILIT( 12)
-tagOf_PrimOp WordGtOp = ILIT( 13)
-tagOf_PrimOp WordGeOp = ILIT( 14)
-tagOf_PrimOp WordEqOp = ILIT( 15)
-tagOf_PrimOp WordNeOp = ILIT( 16)
-tagOf_PrimOp WordLtOp = ILIT( 17)
-tagOf_PrimOp WordLeOp = ILIT( 18)
-tagOf_PrimOp AddrGtOp = ILIT( 19)
-tagOf_PrimOp AddrGeOp = ILIT( 20)
-tagOf_PrimOp AddrEqOp = ILIT( 21)
-tagOf_PrimOp AddrNeOp = ILIT( 22)
-tagOf_PrimOp AddrLtOp = ILIT( 23)
-tagOf_PrimOp AddrLeOp = ILIT( 24)
-tagOf_PrimOp FloatGtOp = ILIT( 25)
-tagOf_PrimOp FloatGeOp = ILIT( 26)
-tagOf_PrimOp FloatEqOp = ILIT( 27)
-tagOf_PrimOp FloatNeOp = ILIT( 28)
-tagOf_PrimOp FloatLtOp = ILIT( 29)
-tagOf_PrimOp FloatLeOp = ILIT( 30)
-tagOf_PrimOp DoubleGtOp = ILIT( 31)
-tagOf_PrimOp DoubleGeOp = ILIT( 32)
-tagOf_PrimOp DoubleEqOp = ILIT( 33)
-tagOf_PrimOp DoubleNeOp = ILIT( 34)
-tagOf_PrimOp DoubleLtOp = ILIT( 35)
-tagOf_PrimOp DoubleLeOp = ILIT( 36)
-tagOf_PrimOp OrdOp = ILIT( 37)
-tagOf_PrimOp ChrOp = ILIT( 38)
-tagOf_PrimOp IntAddOp = ILIT( 39)
-tagOf_PrimOp IntSubOp = ILIT( 40)
-tagOf_PrimOp IntMulOp = ILIT( 41)
-tagOf_PrimOp IntQuotOp = ILIT( 42)
-tagOf_PrimOp IntRemOp = ILIT( 43)
-tagOf_PrimOp IntNegOp = ILIT( 44)
-tagOf_PrimOp IntAbsOp = ILIT( 45)
-tagOf_PrimOp WordQuotOp = ILIT( 46)
-tagOf_PrimOp WordRemOp = ILIT( 47)
-tagOf_PrimOp AndOp = ILIT( 48)
-tagOf_PrimOp OrOp = ILIT( 49)
-tagOf_PrimOp NotOp = ILIT( 50)
-tagOf_PrimOp XorOp = ILIT( 51)
-tagOf_PrimOp SllOp = ILIT( 52)
-tagOf_PrimOp SrlOp = ILIT( 53)
-tagOf_PrimOp ISllOp = ILIT( 54)
-tagOf_PrimOp ISraOp = ILIT( 55)
-tagOf_PrimOp ISrlOp = ILIT( 56)
-tagOf_PrimOp Int2WordOp = ILIT( 57)
-tagOf_PrimOp Word2IntOp = ILIT( 58)
-tagOf_PrimOp Int2AddrOp = ILIT( 59)
-tagOf_PrimOp Addr2IntOp = ILIT( 60)
-
-tagOf_PrimOp FloatAddOp = ILIT( 61)
-tagOf_PrimOp FloatSubOp = ILIT( 62)
-tagOf_PrimOp FloatMulOp = ILIT( 63)
-tagOf_PrimOp FloatDivOp = ILIT( 64)
-tagOf_PrimOp FloatNegOp = ILIT( 65)
-tagOf_PrimOp Float2IntOp = ILIT( 66)
-tagOf_PrimOp Int2FloatOp = ILIT( 67)
-tagOf_PrimOp FloatExpOp = ILIT( 68)
-tagOf_PrimOp FloatLogOp = ILIT( 69)
-tagOf_PrimOp FloatSqrtOp = ILIT( 70)
-tagOf_PrimOp FloatSinOp = ILIT( 71)
-tagOf_PrimOp FloatCosOp = ILIT( 72)
-tagOf_PrimOp FloatTanOp = ILIT( 73)
-tagOf_PrimOp FloatAsinOp = ILIT( 74)
-tagOf_PrimOp FloatAcosOp = ILIT( 75)
-tagOf_PrimOp FloatAtanOp = ILIT( 76)
-tagOf_PrimOp FloatSinhOp = ILIT( 77)
-tagOf_PrimOp FloatCoshOp = ILIT( 78)
-tagOf_PrimOp FloatTanhOp = ILIT( 79)
-tagOf_PrimOp FloatPowerOp = ILIT( 80)
-tagOf_PrimOp DoubleAddOp = ILIT( 81)
-tagOf_PrimOp DoubleSubOp = ILIT( 82)
-tagOf_PrimOp DoubleMulOp = ILIT( 83)
-tagOf_PrimOp DoubleDivOp = ILIT( 84)
-tagOf_PrimOp DoubleNegOp = ILIT( 85)
-tagOf_PrimOp Double2IntOp = ILIT( 86)
-tagOf_PrimOp Int2DoubleOp = ILIT( 87)
-tagOf_PrimOp Double2FloatOp = ILIT( 88)
-tagOf_PrimOp Float2DoubleOp = ILIT( 89)
-tagOf_PrimOp DoubleExpOp = ILIT( 90)
-tagOf_PrimOp DoubleLogOp = ILIT( 91)
-tagOf_PrimOp DoubleSqrtOp = ILIT( 92)
-tagOf_PrimOp DoubleSinOp = ILIT( 93)
-tagOf_PrimOp DoubleCosOp = ILIT( 94)
-tagOf_PrimOp DoubleTanOp = ILIT( 95)
-tagOf_PrimOp DoubleAsinOp = ILIT( 96)
-tagOf_PrimOp DoubleAcosOp = ILIT( 97)
-tagOf_PrimOp DoubleAtanOp = ILIT( 98)
-tagOf_PrimOp DoubleSinhOp = ILIT( 99)
-tagOf_PrimOp DoubleCoshOp = ILIT(100)
-tagOf_PrimOp DoubleTanhOp = ILIT(101)
-tagOf_PrimOp DoublePowerOp = ILIT(102)
-tagOf_PrimOp IntegerAddOp = ILIT(103)
-tagOf_PrimOp IntegerSubOp = ILIT(104)
-tagOf_PrimOp IntegerMulOp = ILIT(105)
-tagOf_PrimOp IntegerQuotRemOp = ILIT(106)
-tagOf_PrimOp IntegerDivModOp = ILIT(107)
-tagOf_PrimOp IntegerNegOp = ILIT(108)
-tagOf_PrimOp IntegerCmpOp = ILIT(109)
-tagOf_PrimOp Integer2IntOp = ILIT(110)
-tagOf_PrimOp Integer2WordOp = ILIT(111)
-tagOf_PrimOp Int2IntegerOp = ILIT(112)
-tagOf_PrimOp Word2IntegerOp = ILIT(113)
-tagOf_PrimOp Addr2IntegerOp = ILIT(114)
-tagOf_PrimOp IntegerToInt64Op = ILIT(115)
-tagOf_PrimOp Int64ToIntegerOp = ILIT(116)
-tagOf_PrimOp IntegerToWord64Op = ILIT(117)
-tagOf_PrimOp Word64ToIntegerOp = ILIT(118)
-tagOf_PrimOp FloatEncodeOp = ILIT(119)
-tagOf_PrimOp FloatDecodeOp = ILIT(120)
-tagOf_PrimOp DoubleEncodeOp = ILIT(121)
-tagOf_PrimOp DoubleDecodeOp = ILIT(122)
-tagOf_PrimOp NewArrayOp = ILIT(123)
-tagOf_PrimOp (NewByteArrayOp CharRep) = ILIT(124)
-tagOf_PrimOp (NewByteArrayOp IntRep) = ILIT(125)
-tagOf_PrimOp (NewByteArrayOp WordRep) = ILIT(126)
-tagOf_PrimOp (NewByteArrayOp AddrRep) = ILIT(127)
-tagOf_PrimOp (NewByteArrayOp FloatRep) = ILIT(128)
-tagOf_PrimOp (NewByteArrayOp DoubleRep) = ILIT(129)
-tagOf_PrimOp (NewByteArrayOp StablePtrRep) = ILIT(130)
-tagOf_PrimOp SameMutableArrayOp = ILIT(131)
-tagOf_PrimOp SameMutableByteArrayOp = ILIT(132)
-tagOf_PrimOp ReadArrayOp = ILIT(133)
-tagOf_PrimOp WriteArrayOp = ILIT(134)
-tagOf_PrimOp IndexArrayOp = ILIT(135)
-tagOf_PrimOp (ReadByteArrayOp CharRep) = ILIT(136)
-tagOf_PrimOp (ReadByteArrayOp IntRep) = ILIT(137)
-tagOf_PrimOp (ReadByteArrayOp WordRep) = ILIT(138)
-tagOf_PrimOp (ReadByteArrayOp AddrRep) = ILIT(139)
-tagOf_PrimOp (ReadByteArrayOp FloatRep) = ILIT(140)
-tagOf_PrimOp (ReadByteArrayOp DoubleRep) = ILIT(141)
-tagOf_PrimOp (ReadByteArrayOp StablePtrRep) = ILIT(142)
-tagOf_PrimOp (ReadByteArrayOp Int64Rep) = ILIT(143)
-tagOf_PrimOp (ReadByteArrayOp Word64Rep) = ILIT(144)
-tagOf_PrimOp (WriteByteArrayOp CharRep) = ILIT(145)
-tagOf_PrimOp (WriteByteArrayOp AddrRep) = ILIT(146)
-tagOf_PrimOp (WriteByteArrayOp IntRep) = ILIT(147)
-tagOf_PrimOp (WriteByteArrayOp WordRep) = ILIT(148)
-tagOf_PrimOp (WriteByteArrayOp FloatRep) = ILIT(149)
-tagOf_PrimOp (WriteByteArrayOp DoubleRep) = ILIT(150)
-tagOf_PrimOp (WriteByteArrayOp StablePtrRep) = ILIT(151)
-tagOf_PrimOp (WriteByteArrayOp Int64Rep) = ILIT(152)
-tagOf_PrimOp (WriteByteArrayOp Word64Rep) = ILIT(153)
-tagOf_PrimOp (IndexByteArrayOp CharRep) = ILIT(154)
-tagOf_PrimOp (IndexByteArrayOp IntRep) = ILIT(155)
-tagOf_PrimOp (IndexByteArrayOp WordRep) = ILIT(156)
-tagOf_PrimOp (IndexByteArrayOp AddrRep) = ILIT(157)
-tagOf_PrimOp (IndexByteArrayOp FloatRep) = ILIT(158)
-tagOf_PrimOp (IndexByteArrayOp DoubleRep) = ILIT(159)
-tagOf_PrimOp (IndexByteArrayOp StablePtrRep) = ILIT(160)
-tagOf_PrimOp (IndexByteArrayOp Int64Rep) = ILIT(161)
-tagOf_PrimOp (IndexByteArrayOp Word64Rep) = ILIT(162)
-tagOf_PrimOp (IndexOffAddrOp CharRep) = ILIT(163)
-tagOf_PrimOp (IndexOffAddrOp IntRep) = ILIT(164)
-tagOf_PrimOp (IndexOffAddrOp WordRep) = ILIT(165)
-tagOf_PrimOp (IndexOffAddrOp AddrRep) = ILIT(166)
-tagOf_PrimOp (IndexOffAddrOp FloatRep) = ILIT(167)
-tagOf_PrimOp (IndexOffAddrOp DoubleRep) = ILIT(168)
-tagOf_PrimOp (IndexOffAddrOp StablePtrRep) = ILIT(169)
-tagOf_PrimOp (IndexOffAddrOp Int64Rep) = ILIT(170)
-tagOf_PrimOp (IndexOffAddrOp Word64Rep) = ILIT(171)
-tagOf_PrimOp (IndexOffForeignObjOp CharRep) = ILIT(172)
-tagOf_PrimOp (IndexOffForeignObjOp IntRep) = ILIT(173)
-tagOf_PrimOp (IndexOffForeignObjOp WordRep) = ILIT(174)
-tagOf_PrimOp (IndexOffForeignObjOp AddrRep) = ILIT(175)
-tagOf_PrimOp (IndexOffForeignObjOp FloatRep) = ILIT(176)
-tagOf_PrimOp (IndexOffForeignObjOp DoubleRep) = ILIT(177)
-tagOf_PrimOp (IndexOffForeignObjOp StablePtrRep) = ILIT(178)
-tagOf_PrimOp (IndexOffForeignObjOp Int64Rep) = ILIT(179)
-tagOf_PrimOp (IndexOffForeignObjOp Word64Rep) = ILIT(180)
-tagOf_PrimOp (WriteOffAddrOp CharRep) = ILIT(181)
-tagOf_PrimOp (WriteOffAddrOp IntRep) = ILIT(182)
-tagOf_PrimOp (WriteOffAddrOp WordRep) = ILIT(183)
-tagOf_PrimOp (WriteOffAddrOp AddrRep) = ILIT(184)
-tagOf_PrimOp (WriteOffAddrOp FloatRep) = ILIT(185)
-tagOf_PrimOp (WriteOffAddrOp DoubleRep) = ILIT(186)
-tagOf_PrimOp (WriteOffAddrOp StablePtrRep) = ILIT(187)
-tagOf_PrimOp (WriteOffAddrOp ForeignObjRep) = ILIT(188)
-tagOf_PrimOp (WriteOffAddrOp Int64Rep) = ILIT(189)
-tagOf_PrimOp (WriteOffAddrOp Word64Rep) = ILIT(190)
-tagOf_PrimOp UnsafeFreezeArrayOp = ILIT(191)
-tagOf_PrimOp UnsafeFreezeByteArrayOp = ILIT(192)
-tagOf_PrimOp SizeofByteArrayOp = ILIT(193)
-tagOf_PrimOp SizeofMutableByteArrayOp = ILIT(194)
-tagOf_PrimOp NewSynchVarOp = ILIT(195)
-tagOf_PrimOp TakeMVarOp = ILIT(196)
-tagOf_PrimOp PutMVarOp = ILIT(197)
-tagOf_PrimOp ReadIVarOp = ILIT(198)
-tagOf_PrimOp WriteIVarOp = ILIT(199)
-tagOf_PrimOp MakeForeignObjOp = ILIT(200)
-tagOf_PrimOp WriteForeignObjOp = ILIT(201)
-tagOf_PrimOp MakeStablePtrOp = ILIT(202)
-tagOf_PrimOp DeRefStablePtrOp = ILIT(203)
-tagOf_PrimOp (CCallOp _ _ _ _ _ _) = ILIT(204)
-tagOf_PrimOp ErrorIOPrimOp = ILIT(205)
-tagOf_PrimOp ReallyUnsafePtrEqualityOp = ILIT(206)
-tagOf_PrimOp SeqOp = ILIT(207)
-tagOf_PrimOp ParOp = ILIT(208)
-tagOf_PrimOp ForkOp = ILIT(209)
-tagOf_PrimOp DelayOp = ILIT(210)
-tagOf_PrimOp WaitReadOp = ILIT(211)
-tagOf_PrimOp WaitWriteOp = ILIT(212)
-tagOf_PrimOp ParGlobalOp = ILIT(213)
-tagOf_PrimOp ParLocalOp = ILIT(214)
-tagOf_PrimOp ParAtOp = ILIT(215)
-tagOf_PrimOp ParAtAbsOp = ILIT(216)
-tagOf_PrimOp ParAtRelOp = ILIT(217)
-tagOf_PrimOp ParAtForNowOp = ILIT(218)
-tagOf_PrimOp CopyableOp = ILIT(219)
-tagOf_PrimOp NoFollowOp = ILIT(220)
-tagOf_PrimOp SameMVarOp = ILIT(221)
-
-tagOf_PrimOp _ = panic# "tagOf_PrimOp: pattern-match"
instance Eq PrimOp where
- op == op2 = tagOf_PrimOp op _EQ_ tagOf_PrimOp op2
+ op1 == op2 = tagOf_PrimOp op1 ==# tagOf_PrimOp op2
+
+instance Ord PrimOp where
+ op1 < op2 = tagOf_PrimOp op1 <# tagOf_PrimOp op2
+ op1 <= op2 = tagOf_PrimOp op1 <=# tagOf_PrimOp op2
+ op1 >= op2 = tagOf_PrimOp op1 >=# tagOf_PrimOp op2
+ op1 > op2 = tagOf_PrimOp op1 ># tagOf_PrimOp op2
+ op1 `compare` op2 | op1 < op2 = LT
+ | op1 == op2 = EQ
+ | otherwise = GT
+
+instance Outputable PrimOp where
+ ppr op = pprPrimOp op
+
+instance Show PrimOp where
+ showsPrec p op = showsPrecSDoc p (pprPrimOp op)
\end{code}
An @Enum@-derived list would be better; meanwhile... (ToDo)
+
\begin{code}
-allThePrimOps
- = [ CharGtOp,
- CharGeOp,
- CharEqOp,
- CharNeOp,
- CharLtOp,
- CharLeOp,
- IntGtOp,
- IntGeOp,
- IntEqOp,
- IntNeOp,
- IntLtOp,
- IntLeOp,
- WordGtOp,
- WordGeOp,
- WordEqOp,
- WordNeOp,
- WordLtOp,
- WordLeOp,
- AddrGtOp,
- AddrGeOp,
- AddrEqOp,
- AddrNeOp,
- AddrLtOp,
- AddrLeOp,
- FloatGtOp,
- FloatGeOp,
- FloatEqOp,
- FloatNeOp,
- FloatLtOp,
- FloatLeOp,
- DoubleGtOp,
- DoubleGeOp,
- DoubleEqOp,
- DoubleNeOp,
- DoubleLtOp,
- DoubleLeOp,
- OrdOp,
- ChrOp,
- IntAddOp,
- IntSubOp,
- IntMulOp,
- IntQuotOp,
- IntRemOp,
- IntNegOp,
- WordQuotOp,
- WordRemOp,
- AndOp,
- OrOp,
- NotOp,
- XorOp,
- SllOp,
- SrlOp,
- ISllOp,
- ISraOp,
- ISrlOp,
- Int2WordOp,
- Word2IntOp,
- Int2AddrOp,
- Addr2IntOp,
-
- FloatAddOp,
- FloatSubOp,
- FloatMulOp,
- FloatDivOp,
- FloatNegOp,
- Float2IntOp,
- Int2FloatOp,
- FloatExpOp,
- FloatLogOp,
- FloatSqrtOp,
- FloatSinOp,
- FloatCosOp,
- FloatTanOp,
- FloatAsinOp,
- FloatAcosOp,
- FloatAtanOp,
- FloatSinhOp,
- FloatCoshOp,
- FloatTanhOp,
- FloatPowerOp,
- DoubleAddOp,
- DoubleSubOp,
- DoubleMulOp,
- DoubleDivOp,
- DoubleNegOp,
- Double2IntOp,
- Int2DoubleOp,
- Double2FloatOp,
- Float2DoubleOp,
- DoubleExpOp,
- DoubleLogOp,
- DoubleSqrtOp,
- DoubleSinOp,
- DoubleCosOp,
- DoubleTanOp,
- DoubleAsinOp,
- DoubleAcosOp,
- DoubleAtanOp,
- DoubleSinhOp,
- DoubleCoshOp,
- DoubleTanhOp,
- DoublePowerOp,
- IntegerAddOp,
- IntegerSubOp,
- IntegerMulOp,
- IntegerQuotRemOp,
- IntegerDivModOp,
- IntegerNegOp,
- IntegerCmpOp,
- Integer2IntOp,
- Integer2WordOp,
- Int2IntegerOp,
- Word2IntegerOp,
- Addr2IntegerOp,
- IntegerToInt64Op,
- Int64ToIntegerOp,
- IntegerToWord64Op,
- Word64ToIntegerOp,
- FloatEncodeOp,
- FloatDecodeOp,
- DoubleEncodeOp,
- DoubleDecodeOp,
- NewArrayOp,
- NewByteArrayOp CharRep,
- NewByteArrayOp IntRep,
- NewByteArrayOp WordRep,
- NewByteArrayOp AddrRep,
- NewByteArrayOp FloatRep,
- NewByteArrayOp DoubleRep,
- NewByteArrayOp StablePtrRep,
- SameMutableArrayOp,
- SameMutableByteArrayOp,
- ReadArrayOp,
- WriteArrayOp,
- IndexArrayOp,
- ReadByteArrayOp CharRep,
- ReadByteArrayOp IntRep,
- ReadByteArrayOp WordRep,
- ReadByteArrayOp AddrRep,
- ReadByteArrayOp FloatRep,
- ReadByteArrayOp DoubleRep,
- ReadByteArrayOp StablePtrRep,
- ReadByteArrayOp Int64Rep,
- ReadByteArrayOp Word64Rep,
- WriteByteArrayOp CharRep,
- WriteByteArrayOp IntRep,
- WriteByteArrayOp WordRep,
- WriteByteArrayOp AddrRep,
- WriteByteArrayOp FloatRep,
- WriteByteArrayOp DoubleRep,
- WriteByteArrayOp StablePtrRep,
- WriteByteArrayOp Int64Rep,
- WriteByteArrayOp Word64Rep,
- IndexByteArrayOp CharRep,
- IndexByteArrayOp IntRep,
- IndexByteArrayOp WordRep,
- IndexByteArrayOp AddrRep,
- IndexByteArrayOp FloatRep,
- IndexByteArrayOp DoubleRep,
- IndexByteArrayOp StablePtrRep,
- IndexByteArrayOp Int64Rep,
- IndexByteArrayOp Word64Rep,
- IndexOffAddrOp CharRep,
- IndexOffAddrOp IntRep,
- IndexOffAddrOp WordRep,
- IndexOffAddrOp AddrRep,
- IndexOffAddrOp FloatRep,
- IndexOffAddrOp DoubleRep,
- IndexOffAddrOp StablePtrRep,
- IndexOffAddrOp Int64Rep,
- IndexOffAddrOp Word64Rep,
- IndexOffForeignObjOp CharRep,
- IndexOffForeignObjOp AddrRep,
- IndexOffForeignObjOp IntRep,
- IndexOffForeignObjOp WordRep,
- IndexOffForeignObjOp FloatRep,
- IndexOffForeignObjOp DoubleRep,
- IndexOffForeignObjOp StablePtrRep,
- IndexOffForeignObjOp Int64Rep,
- IndexOffForeignObjOp Word64Rep,
- WriteOffAddrOp CharRep,
- WriteOffAddrOp IntRep,
- WriteOffAddrOp WordRep,
- WriteOffAddrOp AddrRep,
- WriteOffAddrOp FloatRep,
- WriteOffAddrOp DoubleRep,
- WriteOffAddrOp StablePtrRep,
- WriteOffAddrOp ForeignObjRep,
- WriteOffAddrOp Int64Rep,
- WriteOffAddrOp Word64Rep,
- UnsafeFreezeArrayOp,
- UnsafeFreezeByteArrayOp,
- SizeofByteArrayOp,
- SizeofMutableByteArrayOp,
- NewSynchVarOp,
- SameMVarOp,
- ReadArrayOp,
- TakeMVarOp,
- PutMVarOp,
- ReadIVarOp,
- WriteIVarOp,
- MakeForeignObjOp,
- WriteForeignObjOp,
- MakeStablePtrOp,
- DeRefStablePtrOp,
- ReallyUnsafePtrEqualityOp,
- ErrorIOPrimOp,
- ParGlobalOp,
- ParLocalOp,
- ParAtOp,
- ParAtAbsOp,
- ParAtRelOp,
- ParAtForNowOp,
- CopyableOp,
- NoFollowOp,
- SeqOp,
- ParOp,
- ForkOp,
- DelayOp,
- WaitReadOp,
- WaitWriteOp
- ]
+allThePrimOps :: [PrimOp]
+allThePrimOps =
+#include "primop-list.hs-incl"
\end{code}
%************************************************************************
(slightly) more convenient to use than @TyCons@.
\begin{code}
data PrimOpInfo
- = Dyadic FAST_STRING -- string :: T -> T -> T
- Type
- | Monadic FAST_STRING -- string :: T -> T
- Type
- | Compare FAST_STRING -- string :: T -> T -> Bool
+ = Dyadic OccName -- string :: T -> T -> T
Type
- | Coercing FAST_STRING -- string :: T1 -> T2
+ | Monadic OccName -- string :: T -> T
Type
+ | Compare OccName -- string :: T -> T -> Bool
Type
- | PrimResult FAST_STRING
- [TyVar] [Type] TyCon PrimRep [Type]
- -- "PrimResult tvs [t1,..,tn] D# kind [s1,..,sm]"
- -- has type Forall tvs. t1 -> ... -> tn -> (D# s1 ... sm)
- -- D# is a primitive type constructor.
- -- (the kind is the same info as D#, in another convenient form)
-
- | AlgResult FAST_STRING
- [TyVar] [Type] TyCon [Type]
- -- "AlgResult tvs [t1,..,tn] T [s1,..,sm]"
- -- has type Forall tvs. t1 -> ... -> tn -> (T s1 ... sm)
-
--- ToDo: Specialised calls to PrimOps are prohibited but may be desirable
-\end{code}
-
-Utility bits:
-\begin{code}
-one_Integer_ty = [intPrimTy, intPrimTy, byteArrayPrimTy]
-two_Integer_tys
- = [intPrimTy, intPrimTy, byteArrayPrimTy, -- first Integer pieces
- intPrimTy, intPrimTy, byteArrayPrimTy] -- second '' pieces
-an_Integer_and_Int_tys
- = [intPrimTy, intPrimTy, byteArrayPrimTy, -- Integer
- intPrimTy]
-
-integerMonadic name = AlgResult name [] one_Integer_ty integerTyCon []
-
-integerDyadic name = AlgResult name [] two_Integer_tys integerTyCon []
-
-integerDyadic2Results name = AlgResult name [] two_Integer_tys return2GMPsTyCon []
-
-integerCompare name = PrimResult name [] two_Integer_tys intPrimTyCon IntRep []
-\end{code}
-
-@primOpInfo@ gives all essential information (from which everything
-else, notably a type, can be constructed) for each @PrimOp@.
-
-\begin{code}
-primOpInfo :: PrimOp -> PrimOpInfo
-\end{code}
-
-There's plenty of this stuff!
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-comparison]{PrimOpInfo basic comparison ops}
-%* *
-%************************************************************************
-
-\begin{code}
-primOpInfo CharGtOp = Compare SLIT("gtChar#") charPrimTy
-primOpInfo CharGeOp = Compare SLIT("geChar#") charPrimTy
-primOpInfo CharEqOp = Compare SLIT("eqChar#") charPrimTy
-primOpInfo CharNeOp = Compare SLIT("neChar#") charPrimTy
-primOpInfo CharLtOp = Compare SLIT("ltChar#") charPrimTy
-primOpInfo CharLeOp = Compare SLIT("leChar#") charPrimTy
-
-primOpInfo IntGtOp = Compare SLIT(">#") intPrimTy
-primOpInfo IntGeOp = Compare SLIT(">=#") intPrimTy
-primOpInfo IntEqOp = Compare SLIT("==#") intPrimTy
-primOpInfo IntNeOp = Compare SLIT("/=#") intPrimTy
-primOpInfo IntLtOp = Compare SLIT("<#") intPrimTy
-primOpInfo IntLeOp = Compare SLIT("<=#") intPrimTy
-
-primOpInfo WordGtOp = Compare SLIT("gtWord#") wordPrimTy
-primOpInfo WordGeOp = Compare SLIT("geWord#") wordPrimTy
-primOpInfo WordEqOp = Compare SLIT("eqWord#") wordPrimTy
-primOpInfo WordNeOp = Compare SLIT("neWord#") wordPrimTy
-primOpInfo WordLtOp = Compare SLIT("ltWord#") wordPrimTy
-primOpInfo WordLeOp = Compare SLIT("leWord#") wordPrimTy
-
-primOpInfo AddrGtOp = Compare SLIT("gtAddr#") addrPrimTy
-primOpInfo AddrGeOp = Compare SLIT("geAddr#") addrPrimTy
-primOpInfo AddrEqOp = Compare SLIT("eqAddr#") addrPrimTy
-primOpInfo AddrNeOp = Compare SLIT("neAddr#") addrPrimTy
-primOpInfo AddrLtOp = Compare SLIT("ltAddr#") addrPrimTy
-primOpInfo AddrLeOp = Compare SLIT("leAddr#") addrPrimTy
-
-primOpInfo FloatGtOp = Compare SLIT("gtFloat#") floatPrimTy
-primOpInfo FloatGeOp = Compare SLIT("geFloat#") floatPrimTy
-primOpInfo FloatEqOp = Compare SLIT("eqFloat#") floatPrimTy
-primOpInfo FloatNeOp = Compare SLIT("neFloat#") floatPrimTy
-primOpInfo FloatLtOp = Compare SLIT("ltFloat#") floatPrimTy
-primOpInfo FloatLeOp = Compare SLIT("leFloat#") floatPrimTy
-
-primOpInfo DoubleGtOp = Compare SLIT(">##") doublePrimTy
-primOpInfo DoubleGeOp = Compare SLIT(">=##") doublePrimTy
-primOpInfo DoubleEqOp = Compare SLIT("==##") doublePrimTy
-primOpInfo DoubleNeOp = Compare SLIT("/=##") doublePrimTy
-primOpInfo DoubleLtOp = Compare SLIT("<##") doublePrimTy
-primOpInfo DoubleLeOp = Compare SLIT("<=##") doublePrimTy
-
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Char]{PrimOpInfo for @Char#@s}
-%* *
-%************************************************************************
-
-\begin{code}
-primOpInfo OrdOp = Coercing SLIT("ord#") charPrimTy intPrimTy
-primOpInfo ChrOp = Coercing SLIT("chr#") intPrimTy charPrimTy
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Int]{PrimOpInfo for @Int#@s}
-%* *
-%************************************************************************
-
-\begin{code}
-primOpInfo IntAddOp = Dyadic SLIT("+#") intPrimTy
-primOpInfo IntSubOp = Dyadic SLIT("-#") intPrimTy
-primOpInfo IntMulOp = Dyadic SLIT("*#") intPrimTy
-primOpInfo IntQuotOp = Dyadic SLIT("quotInt#") intPrimTy
-primOpInfo IntRemOp = Dyadic SLIT("remInt#") intPrimTy
-
-primOpInfo IntNegOp = Monadic SLIT("negateInt#") intPrimTy
-primOpInfo IntAbsOp = Monadic SLIT("absInt#") intPrimTy
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Word]{PrimOpInfo for @Word#@s}
-%* *
-%************************************************************************
-
-A @Word#@ is an unsigned @Int#@.
-
-\begin{code}
-primOpInfo WordQuotOp = Dyadic SLIT("quotWord#") wordPrimTy
-primOpInfo WordRemOp = Dyadic SLIT("remWord#") wordPrimTy
-
-primOpInfo AndOp = Dyadic SLIT("and#") wordPrimTy
-primOpInfo OrOp = Dyadic SLIT("or#") wordPrimTy
-primOpInfo XorOp = Dyadic SLIT("xor#") wordPrimTy
-primOpInfo NotOp = Monadic SLIT("not#") wordPrimTy
-
-primOpInfo SllOp
- = PrimResult SLIT("shiftL#") [] [wordPrimTy, intPrimTy] wordPrimTyCon WordRep []
-primOpInfo SrlOp
- = PrimResult SLIT("shiftRL#") [] [wordPrimTy, intPrimTy] wordPrimTyCon WordRep []
-
-primOpInfo ISllOp
- = PrimResult SLIT("iShiftL#") [] [intPrimTy, intPrimTy] intPrimTyCon IntRep []
-primOpInfo ISraOp
- = PrimResult SLIT("iShiftRA#") [] [intPrimTy, intPrimTy] intPrimTyCon IntRep []
-primOpInfo ISrlOp
- = PrimResult SLIT("iShiftRL#") [] [intPrimTy, intPrimTy] intPrimTyCon IntRep []
-
-primOpInfo Int2WordOp = Coercing SLIT("int2Word#") intPrimTy wordPrimTy
-primOpInfo Word2IntOp = Coercing SLIT("word2Int#") wordPrimTy intPrimTy
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Addr]{PrimOpInfo for @Addr#@s}
-%* *
-%************************************************************************
+ | GenPrimOp OccName -- string :: \/a1..an . T1 -> .. -> Tk -> T
+ [TyVar]
+ [Type]
+ Type
-\begin{code}
-primOpInfo Int2AddrOp = Coercing SLIT("int2Addr#") intPrimTy addrPrimTy
-primOpInfo Addr2IntOp = Coercing SLIT("addr2Int#") addrPrimTy intPrimTy
+mkDyadic str ty = Dyadic (mkVarOccFS str) ty
+mkMonadic str ty = Monadic (mkVarOccFS str) ty
+mkCompare str ty = Compare (mkVarOccFS str) ty
+mkGenPrimOp str tvs tys ty = GenPrimOp (mkVarOccFS str) tvs tys ty
\end{code}
-
%************************************************************************
%* *
-\subsubsection[PrimOp-Float]{PrimOpInfo for @Float#@s}
+\subsubsection{Strictness}
%* *
%************************************************************************
-@encodeFloat#@ and @decodeFloat#@ are given w/ Integer-stuff (it's
-similar).
+Not all primops are strict!
\begin{code}
-primOpInfo FloatAddOp = Dyadic SLIT("plusFloat#") floatPrimTy
-primOpInfo FloatSubOp = Dyadic SLIT("minusFloat#") floatPrimTy
-primOpInfo FloatMulOp = Dyadic SLIT("timesFloat#") floatPrimTy
-primOpInfo FloatDivOp = Dyadic SLIT("divideFloat#") floatPrimTy
-primOpInfo FloatNegOp = Monadic SLIT("negateFloat#") floatPrimTy
-
-primOpInfo Float2IntOp = Coercing SLIT("float2Int#") floatPrimTy intPrimTy
-primOpInfo Int2FloatOp = Coercing SLIT("int2Float#") intPrimTy floatPrimTy
-
-primOpInfo FloatExpOp = Monadic SLIT("expFloat#") floatPrimTy
-primOpInfo FloatLogOp = Monadic SLIT("logFloat#") floatPrimTy
-primOpInfo FloatSqrtOp = Monadic SLIT("sqrtFloat#") floatPrimTy
-primOpInfo FloatSinOp = Monadic SLIT("sinFloat#") floatPrimTy
-primOpInfo FloatCosOp = Monadic SLIT("cosFloat#") floatPrimTy
-primOpInfo FloatTanOp = Monadic SLIT("tanFloat#") floatPrimTy
-primOpInfo FloatAsinOp = Monadic SLIT("asinFloat#") floatPrimTy
-primOpInfo FloatAcosOp = Monadic SLIT("acosFloat#") floatPrimTy
-primOpInfo FloatAtanOp = Monadic SLIT("atanFloat#") floatPrimTy
-primOpInfo FloatSinhOp = Monadic SLIT("sinhFloat#") floatPrimTy
-primOpInfo FloatCoshOp = Monadic SLIT("coshFloat#") floatPrimTy
-primOpInfo FloatTanhOp = Monadic SLIT("tanhFloat#") floatPrimTy
-primOpInfo FloatPowerOp = Dyadic SLIT("powerFloat#") floatPrimTy
+primOpStrictness :: PrimOp -> Arity -> StrictSig
+ -- See Demand.StrictnessInfo for discussion of what the results
+ -- The arity should be the arity of the primop; that's why
+ -- this function isn't exported.
+#include "primop-strictness.hs-incl"
\end{code}
%************************************************************************
%* *
-\subsubsection[PrimOp-Double]{PrimOpInfo for @Double#@s}
-%* *
-%************************************************************************
-
-@encodeDouble#@ and @decodeDouble#@ are given w/ Integer-stuff (it's
-similar).
-
-\begin{code}
-primOpInfo DoubleAddOp = Dyadic SLIT("+##") doublePrimTy
-primOpInfo DoubleSubOp = Dyadic SLIT("-##") doublePrimTy
-primOpInfo DoubleMulOp = Dyadic SLIT("*##") doublePrimTy
-primOpInfo DoubleDivOp = Dyadic SLIT("/##") doublePrimTy
-primOpInfo DoubleNegOp = Monadic SLIT("negateDouble#") doublePrimTy
-
-primOpInfo Double2IntOp = Coercing SLIT("double2Int#") doublePrimTy intPrimTy
-primOpInfo Int2DoubleOp = Coercing SLIT("int2Double#") intPrimTy doublePrimTy
-
-primOpInfo Double2FloatOp = Coercing SLIT("double2Float#") doublePrimTy floatPrimTy
-primOpInfo Float2DoubleOp = Coercing SLIT("float2Double#") floatPrimTy doublePrimTy
-
-primOpInfo DoubleExpOp = Monadic SLIT("expDouble#") doublePrimTy
-primOpInfo DoubleLogOp = Monadic SLIT("logDouble#") doublePrimTy
-primOpInfo DoubleSqrtOp = Monadic SLIT("sqrtDouble#") doublePrimTy
-primOpInfo DoubleSinOp = Monadic SLIT("sinDouble#") doublePrimTy
-primOpInfo DoubleCosOp = Monadic SLIT("cosDouble#") doublePrimTy
-primOpInfo DoubleTanOp = Monadic SLIT("tanDouble#") doublePrimTy
-primOpInfo DoubleAsinOp = Monadic SLIT("asinDouble#") doublePrimTy
-primOpInfo DoubleAcosOp = Monadic SLIT("acosDouble#") doublePrimTy
-primOpInfo DoubleAtanOp = Monadic SLIT("atanDouble#") doublePrimTy
-primOpInfo DoubleSinhOp = Monadic SLIT("sinhDouble#") doublePrimTy
-primOpInfo DoubleCoshOp = Monadic SLIT("coshDouble#") doublePrimTy
-primOpInfo DoubleTanhOp = Monadic SLIT("tanhDouble#") doublePrimTy
-primOpInfo DoublePowerOp= Dyadic SLIT("**##") doublePrimTy
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Integer]{PrimOpInfo for @Integer@ (and related!)}
+\subsubsection[PrimOp-comparison]{PrimOpInfo basic comparison ops}
%* *
%************************************************************************
-\begin{code}
-primOpInfo IntegerNegOp = integerMonadic SLIT("negateInteger#")
-
-primOpInfo IntegerAddOp = integerDyadic SLIT("plusInteger#")
-primOpInfo IntegerSubOp = integerDyadic SLIT("minusInteger#")
-primOpInfo IntegerMulOp = integerDyadic SLIT("timesInteger#")
-
-primOpInfo IntegerCmpOp = integerCompare SLIT("cmpInteger#")
-
-primOpInfo IntegerQuotRemOp = integerDyadic2Results SLIT("quotRemInteger#")
-primOpInfo IntegerDivModOp = integerDyadic2Results SLIT("divModInteger#")
-
-primOpInfo Integer2IntOp
- = PrimResult SLIT("integer2Int#") [] one_Integer_ty intPrimTyCon IntRep []
-
-primOpInfo Integer2WordOp
- = PrimResult SLIT("integer2Word#") [] one_Integer_ty wordPrimTyCon IntRep []
-
-primOpInfo Int2IntegerOp
- = AlgResult SLIT("int2Integer#") [] [intPrimTy] integerTyCon []
-
-primOpInfo Word2IntegerOp
- = AlgResult SLIT("word2Integer#") [] [wordPrimTy] integerTyCon []
-
-primOpInfo Addr2IntegerOp
- = AlgResult SLIT("addr2Integer#") [] [addrPrimTy] integerTyCon []
-
-primOpInfo IntegerToInt64Op
- = PrimResult SLIT("integerToInt64#") [] one_Integer_ty int64PrimTyCon Int64Rep []
-
-primOpInfo Int64ToIntegerOp
- = AlgResult SLIT("int64ToInteger#") [] [int64PrimTy] integerTyCon []
-
-primOpInfo Word64ToIntegerOp
- = AlgResult SLIT("word64ToInteger#") [] [word64PrimTy] integerTyCon []
-
-primOpInfo IntegerToWord64Op
- = PrimResult SLIT("integerToWord64#") [] one_Integer_ty word64PrimTyCon Word64Rep []
-\end{code}
-
-Encoding and decoding of floating-point numbers is sorta
-Integer-related.
+@primOpInfo@ gives all essential information (from which everything
+else, notably a type, can be constructed) for each @PrimOp@.
\begin{code}
-primOpInfo FloatEncodeOp
- = PrimResult SLIT("encodeFloat#") [] an_Integer_and_Int_tys
- floatPrimTyCon FloatRep []
-
-primOpInfo DoubleEncodeOp
- = PrimResult SLIT("encodeDouble#") [] an_Integer_and_Int_tys
- doublePrimTyCon DoubleRep []
-
-primOpInfo FloatDecodeOp
- = AlgResult SLIT("decodeFloat#") [] [floatPrimTy] returnIntAndGMPTyCon []
-
-primOpInfo DoubleDecodeOp
- = AlgResult SLIT("decodeDouble#") [] [doublePrimTy] returnIntAndGMPTyCon []
+primOpInfo :: PrimOp -> PrimOpInfo
+#include "primop-primop-info.hs-incl"
\end{code}
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Arrays]{PrimOpInfo for primitive arrays}
-%* *
-%************************************************************************
-
-\begin{code}
-primOpInfo NewArrayOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("newArray#") [s_tv, elt_tv] [intPrimTy, elt, mkStatePrimTy s]
- stateAndMutableArrayPrimTyCon [s, elt]
-
-primOpInfo (NewByteArrayOp kind)
- = let
- s = alphaTy; s_tv = alphaTyVar
-
- (str, _, prim_tycon) = getPrimRepInfo kind
-
- op_str = _PK_ ("new" ++ str ++ "Array#")
- in
- AlgResult op_str [s_tv]
- [intPrimTy, mkStatePrimTy s]
- stateAndMutableByteArrayPrimTyCon [s]
-
----------------------------------------------------------------------------
-
-primOpInfo SameMutableArrayOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
- mut_arr_ty = mkMutableArrayPrimTy s elt
- } in
- AlgResult SLIT("sameMutableArray#") [s_tv, elt_tv] [mut_arr_ty, mut_arr_ty]
- boolTyCon []
-
-primOpInfo SameMutableByteArrayOp
- = let {
- s = alphaTy; s_tv = alphaTyVar;
- mut_arr_ty = mkMutableByteArrayPrimTy s
- } in
- AlgResult SLIT("sameMutableByteArray#") [s_tv] [mut_arr_ty, mut_arr_ty]
- boolTyCon []
-
----------------------------------------------------------------------------
--- Primitive arrays of Haskell pointers:
-
-primOpInfo ReadArrayOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("readArray#") [s_tv, elt_tv]
- [mkMutableArrayPrimTy s elt, intPrimTy, mkStatePrimTy s]
- stateAndPtrPrimTyCon [s, elt]
-
-
-primOpInfo WriteArrayOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- PrimResult SLIT("writeArray#") [s_tv, elt_tv]
- [mkMutableArrayPrimTy s elt, intPrimTy, elt, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-
-primOpInfo IndexArrayOp
- = let { elt = alphaTy; elt_tv = alphaTyVar } in
- AlgResult SLIT("indexArray#") [elt_tv] [mkArrayPrimTy elt, intPrimTy]
- liftTyCon [elt]
-
----------------------------------------------------------------------------
--- Primitive arrays full of unboxed bytes:
-
-primOpInfo (ReadByteArrayOp kind)
- = let
- s = alphaTy; s_tv = alphaTyVar
-
- (str, _, prim_tycon) = getPrimRepInfo kind
-
- op_str = _PK_ ("read" ++ str ++ "Array#")
- relevant_tycon = (assoc "primOpInfo{ReadByteArrayOp}" tbl kind)
-
- (tycon_args, tvs)
- | kind == StablePtrRep = ([s, betaTy], [s_tv, betaTyVar])
- | otherwise = ([s], [s_tv])
- in
- AlgResult op_str tvs
- [mkMutableByteArrayPrimTy s, intPrimTy, mkStatePrimTy s]
- relevant_tycon tycon_args
- where
- tbl = [ (CharRep, stateAndCharPrimTyCon),
- (IntRep, stateAndIntPrimTyCon),
- (WordRep, stateAndWordPrimTyCon),
- (AddrRep, stateAndAddrPrimTyCon),
- (FloatRep, stateAndFloatPrimTyCon),
- (StablePtrRep, stateAndStablePtrPrimTyCon),
- (DoubleRep, stateAndDoublePrimTyCon) ]
-
- -- How come there's no Word byte arrays? ADR
-
-primOpInfo (WriteByteArrayOp kind)
- = let
- s = alphaTy; s_tv = alphaTyVar
-
- (str, prim_ty, _) = getPrimRepInfo kind
- op_str = _PK_ ("write" ++ str ++ "Array#")
-
- (the_prim_ty, tvs)
- | kind == StablePtrRep = (mkStablePtrPrimTy betaTy, [s_tv, betaTyVar])
- | otherwise = (prim_ty, [s_tv])
-
- in
- -- NB: *Prim*Result --
- PrimResult op_str tvs
- [mkMutableByteArrayPrimTy s, intPrimTy, the_prim_ty, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-
-primOpInfo (IndexByteArrayOp kind)
- = let
- (str, _, prim_tycon) = getPrimRepInfo kind
- op_str = _PK_ ("index" ++ str ++ "Array#")
-
- (prim_tycon_args, tvs)
- | kind == StablePtrRep = ([alphaTy], [alphaTyVar])
- | otherwise = ([],[])
- in
- -- NB: *Prim*Result --
- PrimResult op_str tvs [byteArrayPrimTy, intPrimTy] prim_tycon kind prim_tycon_args
-
-primOpInfo (IndexOffAddrOp kind)
- = let
- (str, _, prim_tycon) = getPrimRepInfo kind
- op_str = _PK_ ("index" ++ str ++ "OffAddr#")
-
- (prim_tycon_args, tvs)
- | kind == StablePtrRep = ([alphaTy], [alphaTyVar])
- | otherwise = ([], [])
- in
- PrimResult op_str tvs [addrPrimTy, intPrimTy] prim_tycon kind prim_tycon_args
-
-primOpInfo (IndexOffForeignObjOp kind)
- = let
- (str, _, prim_tycon) = getPrimRepInfo kind
- op_str = _PK_ ("index" ++ str ++ "OffForeignObj#")
-
- (prim_tycon_args, tvs)
- | kind == StablePtrRep = ([alphaTy], [alphaTyVar])
- | otherwise = ([], [])
- in
- PrimResult op_str tvs [foreignObjPrimTy, intPrimTy] prim_tycon kind prim_tycon_args
-
-primOpInfo (WriteOffAddrOp kind)
- = let
- s = betaTy; s_tv = betaTyVar
-
- (str, prim_ty, _) = getPrimRepInfo kind
- op_str = _PK_ ("write" ++ str ++ "OffAddr#")
-
- tvs
- | kind == StablePtrRep = [s_tv,alphaTyVar]
- | otherwise = [s_tv]
- in
- -- NB: *Prim*Result --
- PrimResult op_str tvs
- [addrPrimTy, intPrimTy, prim_ty, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-
----------------------------------------------------------------------------
-primOpInfo UnsafeFreezeArrayOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("unsafeFreezeArray#") [s_tv, elt_tv]
- [mkMutableArrayPrimTy s elt, mkStatePrimTy s]
- stateAndArrayPrimTyCon [s, elt]
-
-primOpInfo UnsafeFreezeByteArrayOp
- = let { s = alphaTy; s_tv = alphaTyVar } in
- AlgResult SLIT("unsafeFreezeByteArray#") [s_tv]
- [mkMutableByteArrayPrimTy s, mkStatePrimTy s]
- stateAndByteArrayPrimTyCon [s]
----------------------------------------------------------------------------
-primOpInfo SizeofByteArrayOp
- = PrimResult
- SLIT("sizeofByteArray#") []
- [byteArrayPrimTy]
- intPrimTyCon IntRep []
-
-primOpInfo SizeofMutableByteArrayOp
- = let { s = alphaTy; s_tv = alphaTyVar } in
- PrimResult
- SLIT("sizeofMutableByteArray#") [s_tv]
- [mkMutableByteArrayPrimTy s]
- intPrimTyCon IntRep []
+Here are a load of comments from the old primOp info:
-\end{code}
+A @Word#@ is an unsigned @Int#@.
-%************************************************************************
-%* *
-\subsubsection[PrimOp-SynchVars]{PrimOpInfo for synchronizing Variables}
-%* *
-%************************************************************************
+@decodeFloat#@ is given w/ Integer-stuff (it's similar).
-\begin{code}
-primOpInfo NewSynchVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("newSynchVar#") [s_tv, elt_tv] [mkStatePrimTy s]
- stateAndSynchVarPrimTyCon [s, elt]
-
-primOpInfo SameMVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
- mvar_ty = mkSynchVarPrimTy s elt
- } in
- AlgResult SLIT("sameMVar#") [s_tv, elt_tv] [mvar_ty, mvar_ty]
- boolTyCon []
-
-primOpInfo TakeMVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("takeMVar#") [s_tv, elt_tv]
- [mkSynchVarPrimTy s elt, mkStatePrimTy s]
- stateAndPtrPrimTyCon [s, elt]
-
-primOpInfo PutMVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("putMVar#") [s_tv, elt_tv]
- [mkSynchVarPrimTy s elt, elt, mkStatePrimTy s]
- statePrimTyCon [s]
-
-primOpInfo ReadIVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("readIVar#") [s_tv, elt_tv]
- [mkSynchVarPrimTy s elt, mkStatePrimTy s]
- stateAndPtrPrimTyCon [s, elt]
-
-primOpInfo WriteIVarOp
- = let {
- elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
- } in
- AlgResult SLIT("writeIVar#") [s_tv, elt_tv]
- [mkSynchVarPrimTy s elt, elt, mkStatePrimTy s]
- statePrimTyCon [s]
+@decodeDouble#@ is given w/ Integer-stuff (it's similar).
-\end{code}
+Decoding of floating-point numbers is sorta Integer-related. Encoding
+is done with plain ccalls now (see PrelNumExtra.lhs).
-%************************************************************************
-%* *
-\subsubsection[PrimOp-Wait]{PrimOpInfo for delay/wait operations}
-%* *
-%************************************************************************
+A @Weak@ Pointer is created by the @mkWeak#@ primitive:
-\begin{code}
+ mkWeak# :: k -> v -> f -> State# RealWorld
+ -> (# State# RealWorld, Weak# v #)
-primOpInfo DelayOp
- = let {
- s = alphaTy; s_tv = alphaTyVar
- } in
- PrimResult SLIT("delay#") [s_tv]
- [intPrimTy, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-
-primOpInfo WaitReadOp
- = let {
- s = alphaTy; s_tv = alphaTyVar
- } in
- PrimResult SLIT("waitRead#") [s_tv]
- [intPrimTy, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-
-primOpInfo WaitWriteOp
- = let {
- s = alphaTy; s_tv = alphaTyVar
- } in
- PrimResult SLIT("waitWrite#") [s_tv]
- [intPrimTy, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-\end{code}
+In practice, you'll use the higher-level
-%************************************************************************
-%* *
-\subsubsection[PrimOps-ForeignObj]{PrimOpInfo for Foreign Objects}
-%* *
-%************************************************************************
+ data Weak v = Weak# v
+ mkWeak :: k -> v -> IO () -> IO (Weak v)
-Not everything should/can be in the Haskell heap. As an example, in an
-image processing application written in Haskell, you really would like
-to avoid heaving huge images between different space or generations of
-a garbage collector. Instead use @ForeignObj@ (formerly known as @MallocPtr@),
-which refer to some externally allocated structure/value. Using @ForeignObj@,
-just a reference to an image is present in the heap, the image could then
-be stored outside the Haskell heap, i.e., as a malloc'ed structure or in
-a completely separate address space alltogether.
+The following operation dereferences a weak pointer. The weak pointer
+may have been finalized, so the operation returns a result code which
+must be inspected before looking at the dereferenced value.
-When a @ForeignObj@ becomes garbage, a user-defined finalisation routine
-associated with the object is invoked (currently, each ForeignObj has a
-direct reference to its finaliser). -- SOF
+ deRefWeak# :: Weak# v -> State# RealWorld ->
+ (# State# RealWorld, v, Int# #)
-A @ForeignObj@ is created by the @makeForeignObj#@ primitive:
+Only look at v if the Int# returned is /= 0 !!
-\begin{pseudocode}
-makeForeignObj# :: Addr# -- foreign object
- -> Addr# -- ptr to its finaliser routine
- -> StateAndForeignObj# _RealWorld# ForeignObj#
-\end{pseudocode}
+The higher-level op is
+ deRefWeak :: Weak v -> IO (Maybe v)
-\begin{code}
-primOpInfo MakeForeignObjOp
- = AlgResult SLIT("makeForeignObj#") []
- [addrPrimTy, addrPrimTy, realWorldStatePrimTy]
- stateAndForeignObjPrimTyCon [realWorldTy]
-\end{code}
+Weak pointers can be finalized early by using the finalize# operation:
+
+ finalizeWeak# :: Weak# v -> State# RealWorld ->
+ (# State# RealWorld, Int#, IO () #)
-[Experimental--SOF]
-In addition, another @ForeignObj@ primitive is provided for destructively modifying
-the external object wrapped up inside a @ForeignObj@. This primitive is used
-when a mixed programming interface of implicit and explicit de-allocation is used,
-e.g., if @ForeignObj@s are used to implement @Handle@s, then @Handle@s can be
-released either explicitly (through @hClose@) or implicitly (via a finaliser).
-When releasing/closing the @Handle@ explicitly, care must be taken to avoid having
-the finaliser for the embedded @ForeignObj@ attempt the same thing later.
-We deal with this situation, by allowing the programmer to destructively modify
-the data field of the @ForeignObj@ to hold a special value the finaliser recognises,
-and does not attempt to free (e.g., filling the data slot with \tr{NULL}).
-
-\begin{pseudocode}
-writeForeignObj# :: ForeignObj# -- foreign object
- -> Addr# -- new data value
- -> StateAndForeignObj# _RealWorld# ForeignObj#
-\end{pseudocode}
+The Int# returned is either
-\begin{code}
-primOpInfo WriteForeignObjOp
- = let {
- s = alphaTy; s_tv = alphaTyVar
- } in
- PrimResult SLIT("writeForeignObj#") [s_tv]
- [foreignObjPrimTy, addrPrimTy, mkStatePrimTy s]
- statePrimTyCon VoidRep [s]
-\end{code}
+ 0 if the weak pointer has already been finalized, or it has no
+ finalizer (the third component is then invalid).
-%************************************************************************
-%* *
-\subsubsection[PrimOp-stable-pointers]{PrimOpInfo for ``stable pointers''}
-%* *
-%************************************************************************
+ 1 if the weak pointer is still alive, with the finalizer returned
+ as the third component.
-A {\em stable pointer} is an index into a table of pointers into the
-heap. Since the garbage collector is told about stable pointers, it
-is safe to pass a stable pointer to external systems such as C
+A {\em stable name/pointer} is an index into a table of stable name
+entries. Since the garbage collector is told about stable pointers,
+it is safe to pass a stable pointer to external systems such as C
routines.
-Here's what the operations and types are supposed to be (from
-state-interface document).
-
\begin{verbatim}
-makeStablePtr# :: a -> State# _RealWorld -> StateAndStablePtr# _RealWorld a
-freeStablePtr# :: StablePtr# a -> State# _RealWorld -> State# _RealWorld
-deRefStablePtr# :: StablePtr# a -> State# _RealWorld -> StateAndPtr _RealWorld a
+makeStablePtr# :: a -> State# RealWorld -> (# State# RealWorld, StablePtr# a #)
+freeStablePtr :: StablePtr# a -> State# RealWorld -> State# RealWorld
+deRefStablePtr# :: StablePtr# a -> State# RealWorld -> (# State# RealWorld, a #)
+eqStablePtr# :: StablePtr# a -> StablePtr# a -> Int#
\end{verbatim}
-It may seem a bit surprising that @makeStablePtr#@ is a @PrimIO@
+It may seem a bit surprising that @makeStablePtr#@ is a @IO@
operation since it doesn't (directly) involve IO operations. The
reason is that if some optimisation pass decided to duplicate calls to
@makeStablePtr#@ and we only pass one of the stable pointers over, a
-massive space leak can result. Putting it into the PrimIO monad
+massive space leak can result. Putting it into the IO monad
prevents this. (Another reason for putting them in a monad is to
-ensure correct sequencing wrt the side-effecting @freeStablePtr#@
+ensure correct sequencing wrt the side-effecting @freeStablePtr@
operation.)
+An important property of stable pointers is that if you call
+makeStablePtr# twice on the same object you get the same stable
+pointer back.
+
Note that we can implement @freeStablePtr#@ using @_ccall_@ (and,
besides, it's not likely to be used from Haskell) so it's not a
primop.
-Question: Why @_RealWorld@ - won't any instance of @_ST@ do the job? [ADR]
+Question: Why @RealWorld@ - won't any instance of @_ST@ do the job? [ADR]
-\begin{code}
-primOpInfo MakeStablePtrOp
- = AlgResult SLIT("makeStablePtr#") [alphaTyVar]
- [alphaTy, realWorldStatePrimTy]
- stateAndStablePtrPrimTyCon [realWorldTy, alphaTy]
-
-primOpInfo DeRefStablePtrOp
- = AlgResult SLIT("deRefStablePtr#") [alphaTyVar]
- [mkStablePtrPrimTy alphaTy, realWorldStatePrimTy]
- stateAndPtrPrimTyCon [realWorldTy, alphaTy]
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-unsafePointerEquality]{PrimOpInfo for Pointer Equality}
-%* *
-%************************************************************************
+Stable Names
+~~~~~~~~~~~~
-[Alastair Reid is to blame for this!]
+A stable name is like a stable pointer, but with three important differences:
-These days, (Glasgow) Haskell seems to have a bit of everything from
-other languages: strict operations, mutable variables, sequencing,
-pointers, etc. About the only thing left is LISP's ability to test
-for pointer equality. So, let's add it in!
+ (a) You can't deRef one to get back to the original object.
+ (b) You can convert one to an Int.
+ (c) You don't need to 'freeStableName'
-\begin{verbatim}
-reallyUnsafePtrEquality :: a -> a -> Int#
-\end{verbatim}
+The existence of a stable name doesn't guarantee to keep the object it
+points to alive (unlike a stable pointer), hence (a).
-which tests any two closures (of the same type) to see if they're the
-same. (Returns $0$ for @False@, $\neq 0$ for @True@ - to avoid
-difficulties of trying to box up the result.)
+Invariants:
+
+ (a) makeStableName always returns the same value for a given
+ object (same as stable pointers).
-NB This is {\em really unsafe\/} because even something as trivial as
-a garbage collection might change the answer by removing indirections.
-Still, no-one's forcing you to use it. If you're worried about little
-things like loss of referential transparency, you might like to wrap
-it all up in a monad-like thing as John O'Donnell and John Hughes did
-for non-determinism (1989 (Fraserburgh) Glasgow FP Workshop
-Proceedings?)
+ (b) if two stable names are equal, it implies that the objects
+ from which they were created were the same.
-I'm thinking of using it to speed up a critical equality test in some
-graphics stuff in a context where the possibility of saying that
-denotationally equal things aren't isn't a problem (as long as it
-doesn't happen too often.) ADR
+ (c) stableNameToInt always returns the same Int for a given
+ stable name.
-To Will: Jim said this was already in, but I can't see it so I'm
-adding it. Up to you whether you add it. (Note that this could have
-been readily implemented using a @veryDangerousCCall@ before they were
-removed...)
-\begin{code}
-primOpInfo ReallyUnsafePtrEqualityOp
- = PrimResult SLIT("reallyUnsafePtrEquality#") [alphaTyVar]
- [alphaTy, alphaTy] intPrimTyCon IntRep []
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-parallel]{PrimOpInfo for parallelism op(s)}
-%* *
-%************************************************************************
-
-\begin{code}
-primOpInfo SeqOp -- seq# :: a -> Int#
- = PrimResult SLIT("seq#") [alphaTyVar] [alphaTy] intPrimTyCon IntRep []
-
-primOpInfo ParOp -- par# :: a -> Int#
- = PrimResult SLIT("par#") [alphaTyVar] [alphaTy] intPrimTyCon IntRep []
-
-primOpInfo ForkOp -- fork# :: a -> Int#
- = PrimResult SLIT("fork#") [alphaTyVar] [alphaTy] intPrimTyCon IntRep []
-
-\end{code}
-
-\begin{code}
-- HWL: The first 4 Int# in all par... annotations denote:
-- name, granularity info, size of result, degree of parallelism
-- Same structure as _seq_ i.e. returns Int#
+-- KSW: v, the second arg in parAt# and parAtForNow#, is used only to determine
+-- `the processor containing the expression v'; it is not evaluated
-primOpInfo ParGlobalOp -- parGlobal# :: Int# -> Int# -> Int# -> Int# -> a -> b -> b
- = PrimResult SLIT("parGlobal#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTyCon IntRep [] -- liftTyCon [betaTy]
+These primops are pretty wierd.
-primOpInfo ParLocalOp -- parLocal# :: Int# -> Int# -> Int# -> Int# -> a -> b -> b
- = PrimResult SLIT("parLocal#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTyCon IntRep [] -- liftTyCon [betaTy]
+ dataToTag# :: a -> Int (arg must be an evaluated data type)
+ tagToEnum# :: Int -> a (result type must be an enumerated type)
-primOpInfo ParAtOp -- parAt# :: Int# -> Int# -> Int# -> Int# -> a -> b -> c -> c
- = PrimResult SLIT("parAt#") [alphaTyVar,betaTyVar,gammaTyVar] [betaTy,alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,gammaTy] intPrimTyCon IntRep [] -- liftTyCon [gammaTy]
-
-primOpInfo ParAtAbsOp -- parAtAbs# :: Int# -> Int# -> Int# -> Int# -> Int# -> a -> b -> b
- = PrimResult SLIT("parAtAbs#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTyCon IntRep [] -- liftTyCon [betaTy]
-
-primOpInfo ParAtRelOp -- parAtRel# :: Int# -> Int# -> Int# -> Int# -> Int# -> a -> b -> b
- = PrimResult SLIT("parAtRel#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTyCon IntRep [] -- liftTyCon [betaTy]
-
-primOpInfo ParAtForNowOp -- parAtForNow# :: Int# -> Int# -> Int# -> Int# -> a -> b -> c -> c
- = PrimResult SLIT("parAtForNow#") [alphaTyVar,betaTyVar,gammaTyVar] [betaTy,alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,gammaTy] intPrimTyCon IntRep [] -- liftTyCon [gammaTy]
-
-primOpInfo CopyableOp -- copyable# :: a -> a
- = PrimResult SLIT("copyable#") [alphaTyVar] [alphaTy] intPrimTyCon IntRep [] -- liftTyCon [alphaTy]
-
-primOpInfo NoFollowOp -- noFollow# :: a -> a
- = PrimResult SLIT("noFollow#") [alphaTyVar] [alphaTy] intPrimTyCon IntRep [] -- liftTyCon [alphaTy]
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-errorIO]{PrimOpInfo for @errorIO#@}
-%* *
-%************************************************************************
-
-\begin{code}
--- errorIO# :: (State# RealWorld# -> a) -> State# RealWorld#
-primOpInfo ErrorIOPrimOp
- = PrimResult SLIT("errorIO#") [alphaTyVar]
- [mkFunTy realWorldStatePrimTy alphaTy]
- statePrimTyCon VoidRep [realWorldTy]
-\end{code}
-
-%************************************************************************
-%* *
-\subsubsection[PrimOp-IO-etc]{PrimOpInfo for C calls, and I/O-ish things}
-%* *
-%************************************************************************
+The constraints aren't currently checked by the front end, but the
+code generator will fall over if they aren't satisfied.
\begin{code}
-primOpInfo (CCallOp _ _ _ _ arg_tys result_ty)
- = AlgResult SLIT("ccall#") [] arg_tys result_tycon tys_applied
- where
- (result_tycon, tys_applied, _) = splitAlgTyConApp result_ty
-
#ifdef DEBUG
-primOpInfo op = panic ("primOpInfo:"++ show (I# (tagOf_PrimOp op)))
+primOpInfo op = pprPanic "primOpInfo:" (ppr op)
#endif
\end{code}
%************************************************************************
%* *
-\subsection[PrimOp-utils]{Utilities for @PrimitiveOps@}
+\subsubsection[PrimOp-ool]{Which PrimOps are out-of-line}
%* *
%************************************************************************
-The primitive-array-creation @PrimOps@ and {\em most} of those to do
-with @Integers@ can trigger GC. Here we describe the heap requirements
-of the various @PrimOps@. For most, no heap is required. For a few,
-a fixed amount of heap is required, and the needs of the @PrimOp@ can
-be combined with the rest of the heap usage in the basic block. For an
-unfortunate few, some unknown amount of heap is required (these are the
-ops which can trigger GC).
+Some PrimOps need to be called out-of-line because they either need to
+perform a heap check or they block.
-\begin{code}
-data HeapRequirement
- = NoHeapRequired
- | FixedHeapRequired HeapOffset
- | VariableHeapRequired
-
-primOpHeapReq :: PrimOp -> HeapRequirement
-
-primOpHeapReq NewArrayOp = VariableHeapRequired
-primOpHeapReq (NewByteArrayOp _)= VariableHeapRequired
-
-primOpHeapReq IntegerAddOp = VariableHeapRequired
-primOpHeapReq IntegerSubOp = VariableHeapRequired
-primOpHeapReq IntegerMulOp = VariableHeapRequired
-primOpHeapReq IntegerQuotRemOp = VariableHeapRequired
-primOpHeapReq IntegerDivModOp = VariableHeapRequired
-primOpHeapReq IntegerNegOp = VariableHeapRequired
-primOpHeapReq Int2IntegerOp = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq Word2IntegerOp = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq Addr2IntegerOp = VariableHeapRequired
-primOpHeapReq IntegerToInt64Op = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq Word64ToIntegerOp = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq Int64ToIntegerOp = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq IntegerToWord64Op = FixedHeapRequired
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE))
-primOpHeapReq FloatDecodeOp = FixedHeapRequired
- (addOff (intOff (getPrimRepSize IntRep + mP_STRUCT_SIZE))
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE)))
-primOpHeapReq DoubleDecodeOp = FixedHeapRequired
- (addOff (intOff (getPrimRepSize IntRep + mP_STRUCT_SIZE))
- (addOff (totHdrSize (DataRep mIN_MP_INT_SIZE))
- (intOff mIN_MP_INT_SIZE)))
-
-{-
- ccall may allocate heap if it is explicitly allowed to (_ccall_gc_)
- or if it returns a ForeignObj.
-
- Hmm..the allocation for makeForeignObj# is known (and fixed), so
- why do we need to be so indeterminate about it? --SOF
--}
-primOpHeapReq (CCallOp _ _ mayGC@True _ _ _) = VariableHeapRequired
-primOpHeapReq (CCallOp _ _ mayGC@False _ _ _) = NoHeapRequired
-
-primOpHeapReq MakeForeignObjOp = VariableHeapRequired
-primOpHeapReq WriteForeignObjOp = NoHeapRequired
-
--- this occasionally has to expand the Stable Pointer table
-primOpHeapReq MakeStablePtrOp = VariableHeapRequired
-
--- These four only need heap space with the native code generator
--- ToDo!: parameterize, so we know if native code generation is taking place(JSM)
-
-primOpHeapReq IntegerCmpOp = FixedHeapRequired (intOff (2 * mP_STRUCT_SIZE))
-primOpHeapReq Integer2IntOp = FixedHeapRequired (intOff mP_STRUCT_SIZE)
-primOpHeapReq Integer2WordOp = FixedHeapRequired (intOff mP_STRUCT_SIZE)
-primOpHeapReq FloatEncodeOp = FixedHeapRequired (intOff mP_STRUCT_SIZE)
-primOpHeapReq DoubleEncodeOp = FixedHeapRequired (intOff mP_STRUCT_SIZE)
-
--- a NewSynchVarOp creates a three-word mutuple in the heap.
-primOpHeapReq NewSynchVarOp = FixedHeapRequired
- (addOff (totHdrSize (MuTupleRep 3)) (intOff 3))
-
--- Sparking ops no longer allocate any heap; however, _fork_ may
--- require a context switch to clear space in the required thread
--- pool, and that requires liveness information.
-
-primOpHeapReq ParOp = NoHeapRequired
-primOpHeapReq ForkOp = VariableHeapRequired
-
--- A SeqOp requires unknown space to evaluate its argument
-primOpHeapReq SeqOp = VariableHeapRequired
-
--- GranSim sparks are stgMalloced i.e. no heap required
-primOpHeapReq ParGlobalOp = NoHeapRequired
-primOpHeapReq ParLocalOp = NoHeapRequired
-primOpHeapReq ParAtOp = NoHeapRequired
-primOpHeapReq ParAtAbsOp = NoHeapRequired
-primOpHeapReq ParAtRelOp = NoHeapRequired
-primOpHeapReq ParAtForNowOp = NoHeapRequired
--- CopyableOp and NoFolowOp don't require heap; don't rely on default
-primOpHeapReq CopyableOp = NoHeapRequired
-primOpHeapReq NoFollowOp = NoHeapRequired
-
-primOpHeapReq other_op = NoHeapRequired
-\end{code}
-
-The amount of stack required by primops.
\begin{code}
-data StackRequirement
- = NoStackRequired
- | FixedStackRequired Int {-AStack-} Int {-BStack-}
- | VariableStackRequired
-
-primOpStackRequired SeqOp = FixedStackRequired 0 {-AStack-} 2 {-BStack-}
-primOpStackRequired _ = VariableStackRequired
--- ToDo: be more specific for certain primops (currently only used for seq)
+primOpOutOfLine :: PrimOp -> Bool
+#include "primop-out-of-line.hs-incl"
\end{code}
-Primops which can trigger GC have to be called carefully.
-In particular, their arguments are guaranteed to be in registers,
-and a liveness mask tells which regs are live.
-
-\begin{code}
-primOpCanTriggerGC op
- = case op of
- TakeMVarOp -> True
- ReadIVarOp -> True
- DelayOp -> True
- WaitReadOp -> True
- WaitWriteOp -> True
- _ ->
- case primOpHeapReq op of
- VariableHeapRequired -> True
- _ -> False
-\end{code}
+primOpOkForSpeculation
+~~~~~~~~~~~~~~~~~~~~~~
Sometimes we may choose to execute a PrimOp even though it isn't
certain that its result will be required; ie execute them
``speculatively''. The same thing as ``cheap eagerness.'' Usually
this is OK, because PrimOps are usually cheap, but it isn't OK for
(a)~expensive PrimOps and (b)~PrimOps which can fail.
+PrimOps that have side effects also should not be executed speculatively.
+
+Ok-for-speculation also means that it's ok *not* to execute the
+primop. For example
+ case op a b of
+ r -> 3
+Here the result is not used, so we can discard the primop. Anything
+that has side effects mustn't be dicarded in this way, of course!
+
See also @primOpIsCheap@ (below).
-There should be no worries about side effects; that's all taken care
-of by data dependencies.
\begin{code}
primOpOkForSpeculation :: PrimOp -> Bool
-
--- Int.
-primOpOkForSpeculation IntQuotOp = False -- Divide by zero
-primOpOkForSpeculation IntRemOp = False -- Divide by zero
-
--- Integer
-primOpOkForSpeculation IntegerQuotRemOp = False -- Divide by zero
-primOpOkForSpeculation IntegerDivModOp = False -- Divide by zero
-
--- Float. ToDo: tan? tanh?
-primOpOkForSpeculation FloatDivOp = False -- Divide by zero
-primOpOkForSpeculation FloatLogOp = False -- Log of zero
-primOpOkForSpeculation FloatAsinOp = False -- Arg out of domain
-primOpOkForSpeculation FloatAcosOp = False -- Arg out of domain
-
--- Double. ToDo: tan? tanh?
-primOpOkForSpeculation DoubleDivOp = False -- Divide by zero
-primOpOkForSpeculation DoubleLogOp = False -- Log of zero
-primOpOkForSpeculation DoubleAsinOp = False -- Arg out of domain
-primOpOkForSpeculation DoubleAcosOp = False -- Arg out of domain
-
--- CCall
-primOpOkForSpeculation (CCallOp _ _ _ _ _ _) = False -- Could be expensive!
-
--- errorIO#
-primOpOkForSpeculation ErrorIOPrimOp = False -- Could be disastrous!
-
--- parallel
-primOpOkForSpeculation ParOp = False -- Could be expensive!
-primOpOkForSpeculation ForkOp = False -- Likewise
-primOpOkForSpeculation SeqOp = False -- Likewise
-
-primOpOkForSpeculation ParGlobalOp = False -- Could be expensive!
-primOpOkForSpeculation ParLocalOp = False -- Could be expensive!
-primOpOkForSpeculation ParAtOp = False -- Could be expensive!
-primOpOkForSpeculation ParAtAbsOp = False -- Could be expensive!
-primOpOkForSpeculation ParAtRelOp = False -- Could be expensive!
-primOpOkForSpeculation ParAtForNowOp = False -- Could be expensive!
-primOpOkForSpeculation CopyableOp = False -- only tags closure
-primOpOkForSpeculation NoFollowOp = False -- only tags closure
-
--- The default is "yes it's ok for speculation"
-primOpOkForSpeculation other_op = True
+ -- See comments with CoreUtils.exprOkForSpeculation
+primOpOkForSpeculation op
+ = not (primOpHasSideEffects op || primOpOutOfLine op || primOpCanFail op)
\end{code}
+
+primOpIsCheap
+~~~~~~~~~~~~~
@primOpIsCheap@, as used in \tr{SimplUtils.lhs}. For now (HACK
WARNING), we just borrow some other predicates for a
-what-should-be-good-enough test.
+what-should-be-good-enough test. "Cheap" means willing to call it more
+than once, and/or push it inside a lambda. The latter could change the
+behaviour of 'seq' for primops that can fail, so we don't treat them as cheap.
+
\begin{code}
-primOpIsCheap op
- = primOpOkForSpeculation op && not (primOpCanTriggerGC op)
+primOpIsCheap :: PrimOp -> Bool
+primOpIsCheap op = primOpOkForSpeculation op
+-- In March 2001, we changed this to
+-- primOpIsCheap op = False
+-- thereby making *no* primops seem cheap. But this killed eta
+-- expansion on case (x ==# y) of True -> \s -> ...
+-- which is bad. In particular a loop like
+-- doLoop n = loop 0
+-- where
+-- loop i | i == n = return ()
+-- | otherwise = bar i >> loop (i+1)
+-- allocated a closure every time round because it doesn't eta expand.
+--
+-- The problem that originally gave rise to the change was
+-- let x = a +# b *# c in x +# x
+-- were we don't want to inline x. But primopIsCheap doesn't control
+-- that (it's exprIsDupable that does) so the problem doesn't occur
+-- even if primOpIsCheap sometimes says 'True'.
\end{code}
-And some primops have side-effects and so, for example, must not be
-duplicated.
+primOpIsDupable
+~~~~~~~~~~~~~~~
+primOpIsDupable means that the use of the primop is small enough to
+duplicate into different case branches. See CoreUtils.exprIsDupable.
\begin{code}
-fragilePrimOp :: PrimOp -> Bool
-
-fragilePrimOp ParOp = True
-fragilePrimOp ForkOp = True
-fragilePrimOp SeqOp = True
-fragilePrimOp MakeForeignObjOp = True -- SOF
-fragilePrimOp WriteForeignObjOp = True -- SOF
-fragilePrimOp MakeStablePtrOp = True
-fragilePrimOp DeRefStablePtrOp = True -- ??? JSM & ADR
-
-fragilePrimOp ParGlobalOp = True
-fragilePrimOp ParLocalOp = True
-fragilePrimOp ParAtOp = True
-fragilePrimOp ParAtAbsOp = True
-fragilePrimOp ParAtRelOp = True
-fragilePrimOp ParAtForNowOp = True
-fragilePrimOp CopyableOp = True -- Possibly not. ASP
-fragilePrimOp NoFollowOp = True -- Possibly not. ASP
-
-fragilePrimOp other = False
+primOpIsDupable :: PrimOp -> Bool
+ -- See comments with CoreUtils.exprIsDupable
+ -- We say it's dupable it isn't implemented by a C call with a wrapper
+primOpIsDupable op = not (primOpNeedsWrapper op)
\end{code}
-Primitive operations that perform calls need wrappers to save any live variables
-that are stored in caller-saves registers
\begin{code}
-primOpNeedsWrapper :: PrimOp -> Bool
-
-primOpNeedsWrapper (CCallOp _ _ _ _ _ _) = True
-
-primOpNeedsWrapper NewArrayOp = True -- ToDo: for nativeGen only!(JSM)
-primOpNeedsWrapper (NewByteArrayOp _) = True
-
-primOpNeedsWrapper IntegerAddOp = True
-primOpNeedsWrapper IntegerSubOp = True
-primOpNeedsWrapper IntegerMulOp = True
-primOpNeedsWrapper IntegerQuotRemOp = True
-primOpNeedsWrapper IntegerDivModOp = True
-primOpNeedsWrapper IntegerNegOp = True
-primOpNeedsWrapper IntegerCmpOp = True
-primOpNeedsWrapper Integer2IntOp = True
-primOpNeedsWrapper Integer2WordOp = True
-primOpNeedsWrapper Int2IntegerOp = True
-primOpNeedsWrapper Word2IntegerOp = True
-primOpNeedsWrapper Addr2IntegerOp = True
-primOpNeedsWrapper IntegerToInt64Op = True
-primOpNeedsWrapper IntegerToWord64Op = True
-primOpNeedsWrapper Word64ToIntegerOp = True
-primOpNeedsWrapper Int64ToIntegerOp = True
-
-primOpNeedsWrapper FloatExpOp = True
-primOpNeedsWrapper FloatLogOp = True
-primOpNeedsWrapper FloatSqrtOp = True
-primOpNeedsWrapper FloatSinOp = True
-primOpNeedsWrapper FloatCosOp = True
-primOpNeedsWrapper FloatTanOp = True
-primOpNeedsWrapper FloatAsinOp = True
-primOpNeedsWrapper FloatAcosOp = True
-primOpNeedsWrapper FloatAtanOp = True
-primOpNeedsWrapper FloatSinhOp = True
-primOpNeedsWrapper FloatCoshOp = True
-primOpNeedsWrapper FloatTanhOp = True
-primOpNeedsWrapper FloatPowerOp = True
-primOpNeedsWrapper FloatEncodeOp = True
-primOpNeedsWrapper FloatDecodeOp = True
-
-primOpNeedsWrapper DoubleExpOp = True
-primOpNeedsWrapper DoubleLogOp = True
-primOpNeedsWrapper DoubleSqrtOp = True
-primOpNeedsWrapper DoubleSinOp = True
-primOpNeedsWrapper DoubleCosOp = True
-primOpNeedsWrapper DoubleTanOp = True
-primOpNeedsWrapper DoubleAsinOp = True
-primOpNeedsWrapper DoubleAcosOp = True
-primOpNeedsWrapper DoubleAtanOp = True
-primOpNeedsWrapper DoubleSinhOp = True
-primOpNeedsWrapper DoubleCoshOp = True
-primOpNeedsWrapper DoubleTanhOp = True
-primOpNeedsWrapper DoublePowerOp = True
-primOpNeedsWrapper DoubleEncodeOp = True
-primOpNeedsWrapper DoubleDecodeOp = True
-
-primOpNeedsWrapper MakeForeignObjOp = True
-primOpNeedsWrapper WriteForeignObjOp = True
-primOpNeedsWrapper MakeStablePtrOp = True
-primOpNeedsWrapper DeRefStablePtrOp = True
-
-primOpNeedsWrapper TakeMVarOp = True
-primOpNeedsWrapper PutMVarOp = True
-primOpNeedsWrapper ReadIVarOp = True
-
-primOpNeedsWrapper DelayOp = True
-primOpNeedsWrapper WaitReadOp = True
-primOpNeedsWrapper WaitWriteOp = True
-
-primOpNeedsWrapper other_op = False
+primOpCanFail :: PrimOp -> Bool
+#include "primop-can-fail.hs-incl"
\end{code}
+And some primops have side-effects and so, for example, must not be
+duplicated.
+
\begin{code}
-primOp_str op
- = case (primOpInfo op) of
- Dyadic str _ -> str
- Monadic str _ -> str
- Compare str _ -> str
- Coercing str _ _ -> str
- PrimResult str _ _ _ _ _ -> str
- AlgResult str _ _ _ _ -> str
+primOpHasSideEffects :: PrimOp -> Bool
+#include "primop-has-side-effects.hs-incl"
\end{code}
-@primOpType@ duplicates some work of @primOpId@, but since we
-grab types pretty often...
+Inline primitive operations that perform calls need wrappers to save
+any live variables that are stored in caller-saves registers.
+
\begin{code}
-primOpType :: PrimOp -> Type
+primOpNeedsWrapper :: PrimOp -> Bool
+#include "primop-needs-wrapper.hs-incl"
+\end{code}
+\begin{code}
+primOpType :: PrimOp -> Type -- you may want to use primOpSig instead
primOpType op
= case (primOpInfo op) of
- Dyadic str ty -> dyadic_fun_ty ty
- Monadic str ty -> monadic_fun_ty ty
- Compare str ty -> compare_fun_ty ty
- Coercing str ty1 ty2 -> mkFunTy ty1 ty2
-
- PrimResult str tyvars arg_tys prim_tycon kind res_tys ->
- mkForAllTys tyvars (mkFunTys arg_tys (mkTyConApp prim_tycon res_tys))
-
- AlgResult str tyvars arg_tys tycon res_tys ->
- mkForAllTys tyvars (mkFunTys arg_tys (mkTyConApp tycon res_tys))
+ Dyadic occ ty -> dyadic_fun_ty ty
+ Monadic occ ty -> monadic_fun_ty ty
+ Compare occ ty -> compare_fun_ty ty
+
+ GenPrimOp occ tyvars arg_tys res_ty ->
+ mkForAllTys tyvars (mkFunTys arg_tys res_ty)
+
+primOpOcc :: PrimOp -> OccName
+primOpOcc op = case (primOpInfo op) of
+ Dyadic occ _ -> occ
+ Monadic occ _ -> occ
+ Compare occ _ -> occ
+ GenPrimOp occ _ _ _ -> occ
+
+-- primOpSig is like primOpType but gives the result split apart:
+-- (type variables, argument types, result type)
+-- It also gives arity, strictness info
+
+primOpSig :: PrimOp -> ([TyVar], [Type], Type, Arity, StrictSig)
+primOpSig op
+ = (tyvars, arg_tys, res_ty, arity, primOpStrictness op arity)
+ where
+ arity = length arg_tys
+ (tyvars, arg_tys, res_ty)
+ = case (primOpInfo op) of
+ Monadic occ ty -> ([], [ty], ty )
+ Dyadic occ ty -> ([], [ty,ty], ty )
+ Compare occ ty -> ([], [ty,ty], boolTy)
+ GenPrimOp occ tyvars arg_tys res_ty
+ -> (tyvars, arg_tys, res_ty)
\end{code}
\begin{code}
= ReturnsPrim PrimRep
| ReturnsAlg TyCon
--- ToDo: Deal with specialised PrimOps
--- Will need to return specialised tycon and data constructors
+-- Some PrimOps need not return a manifest primitive or algebraic value
+-- (i.e. they might return a polymorphic value). These PrimOps *must*
+-- be out of line, or the code generator won't work.
getPrimOpResultInfo :: PrimOp -> PrimOpResultInfo
-
getPrimOpResultInfo op
= case (primOpInfo op) of
- Dyadic _ ty -> ReturnsPrim (typePrimRep ty)
- Monadic _ ty -> ReturnsPrim (typePrimRep ty)
- Compare _ ty -> ReturnsAlg boolTyCon
- Coercing _ _ ty -> ReturnsPrim (typePrimRep ty)
- PrimResult _ _ _ _ kind _ -> ReturnsPrim kind
- AlgResult _ _ _ tycon _ -> ReturnsAlg tycon
-
-isCompareOp :: PrimOp -> Bool
-
-isCompareOp op
- = case primOpInfo op of
- Compare _ _ -> True
- _ -> False
+ Dyadic _ ty -> ReturnsPrim (typePrimRep ty)
+ Monadic _ ty -> ReturnsPrim (typePrimRep ty)
+ Compare _ ty -> ReturnsAlg boolTyCon
+ GenPrimOp _ _ _ ty | isPrimTyCon tc -> ReturnsPrim (tyConPrimRep tc)
+ | otherwise -> ReturnsAlg tc
+ where
+ tc = tyConAppTyCon ty
+ -- All primops return a tycon-app result
+ -- The tycon can be an unboxed tuple, though, which
+ -- gives rise to a ReturnAlg
\end{code}
The commutable ops are those for which we will try to move constants
\begin{code}
commutableOp :: PrimOp -> Bool
-
-commutableOp CharEqOp = True
-commutableOp CharNeOp = True
-commutableOp IntAddOp = True
-commutableOp IntMulOp = True
-commutableOp AndOp = True
-commutableOp OrOp = True
-commutableOp XorOp = True
-commutableOp IntEqOp = True
-commutableOp IntNeOp = True
-commutableOp IntegerAddOp = True
-commutableOp IntegerMulOp = True
-commutableOp FloatAddOp = True
-commutableOp FloatMulOp = True
-commutableOp FloatEqOp = True
-commutableOp FloatNeOp = True
-commutableOp DoubleAddOp = True
-commutableOp DoubleMulOp = True
-commutableOp DoubleEqOp = True
-commutableOp DoubleNeOp = True
-commutableOp _ = False
+#include "primop-commutable.hs-incl"
\end{code}
Utils:
Output stuff:
\begin{code}
pprPrimOp :: PrimOp -> SDoc
-showPrimOp :: PrimOp -> String
-
-showPrimOp op = showSDoc (pprPrimOp op)
-
-pprPrimOp (CCallOp fun is_casm may_gc cconv arg_tys res_ty)
- = let
- callconv = text "{-" <> pprCallConv cconv <> text "-}"
-
- before
- | is_casm && may_gc = "_casm_GC_ ``"
- | is_casm = "casm_ ``"
- | may_gc = "_ccall_GC_ "
- | otherwise = "_ccall_ "
-
- after
- | is_casm = text "''"
- | otherwise = empty
-
- pp_tys
- = hsep (map pprParendType (res_ty:arg_tys))
-
- ppr_fun =
- case fun of
- Right _ -> ptext SLIT("<dynamic>")
- Left fn -> ptext fn
-
- in
- hcat [ ifPprDebug callconv
- , text before , ppr_fun , after, space, brackets pp_tys]
-
-pprPrimOp other_op
- = getPprStyle $ \ sty ->
- if codeStyle sty then -- For C just print the primop itself
- identToC str
- else if ifaceStyle sty then -- For interfaces Print it qualified with PrelGHC.
- ptext SLIT("PrelGHC.") <> ptext str
- else -- Unqualified is good enough
- ptext str
- where
- str = primOp_str other_op
-
-
-instance Outputable PrimOp where
- ppr op = pprPrimOp op
+pprPrimOp other_op = pprOccName (primOpOcc other_op)
\end{code}
+
projects / ghc-hetmet.git / blobdiff