2 % (c) The GRASP/AQUA Project, Glasgow University, 1992-1998
4 \section[PrimOp]{Primitive operations (machine-level)}
8 PrimOp(..), allThePrimOps,
9 tagOf_PrimOp, -- ToDo: rm
11 primOpUniq, primOpOcc,
15 primOpOutOfLine, primOpNeedsWrapper, primOpStrictness,
16 primOpOkForSpeculation, primOpIsCheap,
19 getPrimOpResultInfo, PrimOpResultInfo(..),
24 #include "HsVersions.h"
26 import PrimRep -- most of it
30 import Demand ( Demand, wwLazy, wwPrim, wwStrict )
32 import CallConv ( CallConv, pprCallConv )
33 import PprType ( pprParendType )
34 import OccName ( OccName, pprOccName, mkSrcVarOcc )
35 import TyCon ( TyCon, tyConArity )
36 import Type ( mkForAllTys, mkForAllTy, mkFunTy, mkFunTys, mkTyVarTys,
37 mkTyConTy, mkTyConApp, typePrimRep,
38 splitAlgTyConApp, Type, isUnboxedTupleType,
39 splitAlgTyConApp_maybe
41 import Unique ( Unique, mkPrimOpIdUnique )
44 import GlaExts ( Int(..), Int#, (==#) )
47 %************************************************************************
49 \subsection[PrimOp-datatype]{Datatype for @PrimOp@ (an enumeration)}
51 %************************************************************************
53 These are in \tr{state-interface.verb} order.
57 -- dig the FORTRAN/C influence on the names...
61 = CharGtOp | CharGeOp | CharEqOp | CharNeOp | CharLtOp | CharLeOp
62 | IntGtOp | IntGeOp | IntEqOp | IntNeOp | IntLtOp | IntLeOp
63 | WordGtOp | WordGeOp | WordEqOp | WordNeOp | WordLtOp | WordLeOp
64 | AddrGtOp | AddrGeOp | AddrEqOp | AddrNeOp | AddrLtOp | AddrLeOp
65 | FloatGtOp | FloatGeOp | FloatEqOp | FloatNeOp | FloatLtOp | FloatLeOp
66 | DoubleGtOp | DoubleGeOp | DoubleEqOp | DoubleNeOp | DoubleLtOp | DoubleLeOp
72 -- IntAbsOp unused?? ADR
73 | IntAddOp | IntSubOp | IntMulOp | IntQuotOp
74 | IntRemOp | IntNegOp | IntAbsOp
75 | ISllOp | ISraOp | ISrlOp -- shift {left,right} {arithmetic,logical}
81 | WordQuotOp | WordRemOp
82 | AndOp | OrOp | NotOp | XorOp
83 | SllOp | SrlOp -- shift {left,right} {logical}
84 | Int2WordOp | Word2IntOp -- casts
87 | Int2AddrOp | Addr2IntOp -- casts
89 -- Float#-related ops:
90 | FloatAddOp | FloatSubOp | FloatMulOp | FloatDivOp | FloatNegOp
91 | Float2IntOp | Int2FloatOp
93 | FloatExpOp | FloatLogOp | FloatSqrtOp
94 | FloatSinOp | FloatCosOp | FloatTanOp
95 | FloatAsinOp | FloatAcosOp | FloatAtanOp
96 | FloatSinhOp | FloatCoshOp | FloatTanhOp
97 -- not all machines have these available conveniently:
98 -- | FloatAsinhOp | FloatAcoshOp | FloatAtanhOp
99 | FloatPowerOp -- ** op
101 -- Double#-related ops:
102 | DoubleAddOp | DoubleSubOp | DoubleMulOp | DoubleDivOp | DoubleNegOp
103 | Double2IntOp | Int2DoubleOp
104 | Double2FloatOp | Float2DoubleOp
106 | DoubleExpOp | DoubleLogOp | DoubleSqrtOp
107 | DoubleSinOp | DoubleCosOp | DoubleTanOp
108 | DoubleAsinOp | DoubleAcosOp | DoubleAtanOp
109 | DoubleSinhOp | DoubleCoshOp | DoubleTanhOp
110 -- not all machines have these available conveniently:
111 -- | DoubleAsinhOp | DoubleAcoshOp | DoubleAtanhOp
112 | DoublePowerOp -- ** op
114 -- Integer (and related...) ops:
115 -- slightly weird -- to match GMP package.
116 | IntegerAddOp | IntegerSubOp | IntegerMulOp | IntegerGcdOp
117 | IntegerQuotRemOp | IntegerDivModOp | IntegerNegOp
122 | Integer2IntOp | Integer2WordOp
123 | Int2IntegerOp | Word2IntegerOp
125 -- casting to/from Integer and 64-bit (un)signed quantities.
126 | IntegerToInt64Op | Int64ToIntegerOp
127 | IntegerToWord64Op | Word64ToIntegerOp
130 | FloatEncodeOp | FloatDecodeOp
131 | DoubleEncodeOp | DoubleDecodeOp
133 -- primitive ops for primitive arrays
136 | NewByteArrayOp PrimRep
139 | SameMutableByteArrayOp
141 | ReadArrayOp | WriteArrayOp | IndexArrayOp -- for arrays of Haskell ptrs
143 | ReadByteArrayOp PrimRep
144 | WriteByteArrayOp PrimRep
145 | IndexByteArrayOp PrimRep
146 | IndexOffAddrOp PrimRep
147 | WriteOffAddrOp PrimRep
148 -- PrimRep can be one of {Char,Int,Addr,Float,Double}Kind.
149 -- This is just a cheesy encoding of a bunch of ops.
150 -- Note that ForeignObjRep is not included -- the only way of
151 -- creating a ForeignObj is with a ccall or casm.
152 | IndexOffForeignObjOp PrimRep
154 | UnsafeFreezeArrayOp | UnsafeFreezeByteArrayOp
155 | SizeofByteArrayOp | SizeofMutableByteArrayOp
190 A special ``trap-door'' to use in making calls direct to C functions:
193 FAST_STRING -- Left fn => An "unboxed" ccall# to `fn'.
194 Unique) -- Right u => first argument (an Addr#) is the function pointer
195 -- (unique is used to generate a 'typedef' to cast
196 -- the function pointer if compiling the ccall# down to
197 -- .hc code - can't do this inline for tedious reasons.)
199 Bool -- True <=> really a "casm"
200 Bool -- True <=> might invoke Haskell GC
201 CallConv -- calling convention to use.
203 -- (... to be continued ... )
206 The ``type'' of @CCallOp foo [t1, ... tm] r@ is @t1 -> ... tm -> r@.
207 (See @primOpInfo@ for details.)
209 Note: that first arg and part of the result should be the system state
210 token (which we carry around to fool over-zealous optimisers) but
211 which isn't actually passed.
213 For example, we represent
215 ((ccall# foo [StablePtr# a, Int] Float) sp# i#) :: (Float, IoWorld)
221 (CCallOp "foo" [Universe#, StablePtr# a, Int#] FloatPrimAndUniverse False)
222 -- :: Universe# -> StablePtr# a -> Int# -> FloatPrimAndUniverse
226 (AlgAlts [ ( FloatPrimAndIoWorld,
228 Con (TupleCon 2) [Float, IoWorld] [F# f#, World w#]
234 Nota Bene: there are some people who find the empty list of types in
235 the @Prim@ somewhat puzzling and would represent the above by
239 (CCallOp "foo" [alpha1, alpha2, alpha3] alpha4 False)
240 -- :: /\ alpha1, alpha2 alpha3, alpha4.
241 -- alpha1 -> alpha2 -> alpha3 -> alpha4
242 [Universe#, StablePtr# a, Int#, FloatPrimAndIoWorld]
245 (AlgAlts [ ( FloatPrimAndIoWorld,
247 Con (TupleCon 2) [Float, IoWorld] [F# f#, World w#]
253 But, this is a completely different way of using @CCallOp@. The most
254 major changes required if we switch to this are in @primOpInfo@, and
255 the desugarer. The major difficulty is in moving the HeapRequirement
256 stuff somewhere appropriate. (The advantage is that we could simplify
257 @CCallOp@ and record just the number of arguments with corresponding
258 simplifications in reading pragma unfoldings, the simplifier,
259 instantiation (etc) of core expressions, ... . Maybe we should think
260 about using it this way?? ADR)
263 -- (... continued from above ... )
265 -- Operation to test two closure addresses for equality (yes really!)
266 -- BLAME ALASTAIR REID FOR THIS! THE REST OF US ARE INNOCENT!
267 | ReallyUnsafePtrEqualityOp
280 | ParGlobalOp -- named global par
281 | ParLocalOp -- named local par
282 | ParAtOp -- specifies destination of local par
283 | ParAtAbsOp -- specifies destination of local par (abs processor)
284 | ParAtRelOp -- specifies destination of local par (rel processor)
285 | ParAtForNowOp -- specifies initial destination of global par
286 | CopyableOp -- marks copyable code
287 | NoFollowOp -- marks non-followup expression
290 Used for the Ord instance
293 tagOf_PrimOp CharGtOp = (ILIT( 1) :: FAST_INT)
294 tagOf_PrimOp CharGeOp = ILIT( 2)
295 tagOf_PrimOp CharEqOp = ILIT( 3)
296 tagOf_PrimOp CharNeOp = ILIT( 4)
297 tagOf_PrimOp CharLtOp = ILIT( 5)
298 tagOf_PrimOp CharLeOp = ILIT( 6)
299 tagOf_PrimOp IntGtOp = ILIT( 7)
300 tagOf_PrimOp IntGeOp = ILIT( 8)
301 tagOf_PrimOp IntEqOp = ILIT( 9)
302 tagOf_PrimOp IntNeOp = ILIT( 10)
303 tagOf_PrimOp IntLtOp = ILIT( 11)
304 tagOf_PrimOp IntLeOp = ILIT( 12)
305 tagOf_PrimOp WordGtOp = ILIT( 13)
306 tagOf_PrimOp WordGeOp = ILIT( 14)
307 tagOf_PrimOp WordEqOp = ILIT( 15)
308 tagOf_PrimOp WordNeOp = ILIT( 16)
309 tagOf_PrimOp WordLtOp = ILIT( 17)
310 tagOf_PrimOp WordLeOp = ILIT( 18)
311 tagOf_PrimOp AddrGtOp = ILIT( 19)
312 tagOf_PrimOp AddrGeOp = ILIT( 20)
313 tagOf_PrimOp AddrEqOp = ILIT( 21)
314 tagOf_PrimOp AddrNeOp = ILIT( 22)
315 tagOf_PrimOp AddrLtOp = ILIT( 23)
316 tagOf_PrimOp AddrLeOp = ILIT( 24)
317 tagOf_PrimOp FloatGtOp = ILIT( 25)
318 tagOf_PrimOp FloatGeOp = ILIT( 26)
319 tagOf_PrimOp FloatEqOp = ILIT( 27)
320 tagOf_PrimOp FloatNeOp = ILIT( 28)
321 tagOf_PrimOp FloatLtOp = ILIT( 29)
322 tagOf_PrimOp FloatLeOp = ILIT( 30)
323 tagOf_PrimOp DoubleGtOp = ILIT( 31)
324 tagOf_PrimOp DoubleGeOp = ILIT( 32)
325 tagOf_PrimOp DoubleEqOp = ILIT( 33)
326 tagOf_PrimOp DoubleNeOp = ILIT( 34)
327 tagOf_PrimOp DoubleLtOp = ILIT( 35)
328 tagOf_PrimOp DoubleLeOp = ILIT( 36)
329 tagOf_PrimOp OrdOp = ILIT( 37)
330 tagOf_PrimOp ChrOp = ILIT( 38)
331 tagOf_PrimOp IntAddOp = ILIT( 39)
332 tagOf_PrimOp IntSubOp = ILIT( 40)
333 tagOf_PrimOp IntMulOp = ILIT( 41)
334 tagOf_PrimOp IntQuotOp = ILIT( 42)
335 tagOf_PrimOp IntRemOp = ILIT( 43)
336 tagOf_PrimOp IntNegOp = ILIT( 44)
337 tagOf_PrimOp IntAbsOp = ILIT( 45)
338 tagOf_PrimOp WordQuotOp = ILIT( 46)
339 tagOf_PrimOp WordRemOp = ILIT( 47)
340 tagOf_PrimOp AndOp = ILIT( 48)
341 tagOf_PrimOp OrOp = ILIT( 49)
342 tagOf_PrimOp NotOp = ILIT( 50)
343 tagOf_PrimOp XorOp = ILIT( 51)
344 tagOf_PrimOp SllOp = ILIT( 52)
345 tagOf_PrimOp SrlOp = ILIT( 53)
346 tagOf_PrimOp ISllOp = ILIT( 54)
347 tagOf_PrimOp ISraOp = ILIT( 55)
348 tagOf_PrimOp ISrlOp = ILIT( 56)
349 tagOf_PrimOp IntAddCOp = ILIT( 57)
350 tagOf_PrimOp IntSubCOp = ILIT( 58)
351 tagOf_PrimOp IntMulCOp = ILIT( 59)
352 tagOf_PrimOp Int2WordOp = ILIT( 60)
353 tagOf_PrimOp Word2IntOp = ILIT( 61)
354 tagOf_PrimOp Int2AddrOp = ILIT( 62)
355 tagOf_PrimOp Addr2IntOp = ILIT( 63)
357 tagOf_PrimOp FloatAddOp = ILIT( 64)
358 tagOf_PrimOp FloatSubOp = ILIT( 65)
359 tagOf_PrimOp FloatMulOp = ILIT( 66)
360 tagOf_PrimOp FloatDivOp = ILIT( 67)
361 tagOf_PrimOp FloatNegOp = ILIT( 68)
362 tagOf_PrimOp Float2IntOp = ILIT( 69)
363 tagOf_PrimOp Int2FloatOp = ILIT( 70)
364 tagOf_PrimOp FloatExpOp = ILIT( 71)
365 tagOf_PrimOp FloatLogOp = ILIT( 72)
366 tagOf_PrimOp FloatSqrtOp = ILIT( 73)
367 tagOf_PrimOp FloatSinOp = ILIT( 74)
368 tagOf_PrimOp FloatCosOp = ILIT( 75)
369 tagOf_PrimOp FloatTanOp = ILIT( 76)
370 tagOf_PrimOp FloatAsinOp = ILIT( 77)
371 tagOf_PrimOp FloatAcosOp = ILIT( 78)
372 tagOf_PrimOp FloatAtanOp = ILIT( 79)
373 tagOf_PrimOp FloatSinhOp = ILIT( 80)
374 tagOf_PrimOp FloatCoshOp = ILIT( 81)
375 tagOf_PrimOp FloatTanhOp = ILIT( 82)
376 tagOf_PrimOp FloatPowerOp = ILIT( 83)
378 tagOf_PrimOp DoubleAddOp = ILIT( 84)
379 tagOf_PrimOp DoubleSubOp = ILIT( 85)
380 tagOf_PrimOp DoubleMulOp = ILIT( 86)
381 tagOf_PrimOp DoubleDivOp = ILIT( 87)
382 tagOf_PrimOp DoubleNegOp = ILIT( 88)
383 tagOf_PrimOp Double2IntOp = ILIT( 89)
384 tagOf_PrimOp Int2DoubleOp = ILIT( 90)
385 tagOf_PrimOp Double2FloatOp = ILIT( 91)
386 tagOf_PrimOp Float2DoubleOp = ILIT( 92)
387 tagOf_PrimOp DoubleExpOp = ILIT( 93)
388 tagOf_PrimOp DoubleLogOp = ILIT( 94)
389 tagOf_PrimOp DoubleSqrtOp = ILIT( 95)
390 tagOf_PrimOp DoubleSinOp = ILIT( 96)
391 tagOf_PrimOp DoubleCosOp = ILIT( 97)
392 tagOf_PrimOp DoubleTanOp = ILIT( 98)
393 tagOf_PrimOp DoubleAsinOp = ILIT( 99)
394 tagOf_PrimOp DoubleAcosOp = ILIT(100)
395 tagOf_PrimOp DoubleAtanOp = ILIT(101)
396 tagOf_PrimOp DoubleSinhOp = ILIT(102)
397 tagOf_PrimOp DoubleCoshOp = ILIT(103)
398 tagOf_PrimOp DoubleTanhOp = ILIT(104)
399 tagOf_PrimOp DoublePowerOp = ILIT(105)
401 tagOf_PrimOp IntegerAddOp = ILIT(106)
402 tagOf_PrimOp IntegerSubOp = ILIT(107)
403 tagOf_PrimOp IntegerMulOp = ILIT(108)
404 tagOf_PrimOp IntegerGcdOp = ILIT(109)
405 tagOf_PrimOp IntegerQuotRemOp = ILIT(110)
406 tagOf_PrimOp IntegerDivModOp = ILIT(111)
407 tagOf_PrimOp IntegerNegOp = ILIT(112)
408 tagOf_PrimOp IntegerCmpOp = ILIT(113)
409 tagOf_PrimOp IntegerCmpIntOp = ILIT(114)
410 tagOf_PrimOp Integer2IntOp = ILIT(115)
411 tagOf_PrimOp Integer2WordOp = ILIT(116)
412 tagOf_PrimOp Int2IntegerOp = ILIT(117)
413 tagOf_PrimOp Word2IntegerOp = ILIT(118)
414 tagOf_PrimOp Addr2IntegerOp = ILIT(119)
415 tagOf_PrimOp IntegerToInt64Op = ILIT(120)
416 tagOf_PrimOp Int64ToIntegerOp = ILIT(121)
417 tagOf_PrimOp IntegerToWord64Op = ILIT(122)
418 tagOf_PrimOp Word64ToIntegerOp = ILIT(123)
419 tagOf_PrimOp FloatEncodeOp = ILIT(124)
420 tagOf_PrimOp FloatDecodeOp = ILIT(125)
421 tagOf_PrimOp DoubleEncodeOp = ILIT(126)
422 tagOf_PrimOp DoubleDecodeOp = ILIT(127)
424 tagOf_PrimOp NewArrayOp = ILIT(128)
425 tagOf_PrimOp (NewByteArrayOp CharRep) = ILIT(129)
426 tagOf_PrimOp (NewByteArrayOp IntRep) = ILIT(130)
427 tagOf_PrimOp (NewByteArrayOp WordRep) = ILIT(131)
428 tagOf_PrimOp (NewByteArrayOp AddrRep) = ILIT(132)
429 tagOf_PrimOp (NewByteArrayOp FloatRep) = ILIT(133)
430 tagOf_PrimOp (NewByteArrayOp DoubleRep) = ILIT(134)
431 tagOf_PrimOp (NewByteArrayOp StablePtrRep) = ILIT(135)
433 tagOf_PrimOp SameMutableArrayOp = ILIT(136)
434 tagOf_PrimOp SameMutableByteArrayOp = ILIT(137)
435 tagOf_PrimOp ReadArrayOp = ILIT(138)
436 tagOf_PrimOp WriteArrayOp = ILIT(139)
437 tagOf_PrimOp IndexArrayOp = ILIT(140)
439 tagOf_PrimOp (ReadByteArrayOp CharRep) = ILIT(141)
440 tagOf_PrimOp (ReadByteArrayOp IntRep) = ILIT(142)
441 tagOf_PrimOp (ReadByteArrayOp WordRep) = ILIT(143)
442 tagOf_PrimOp (ReadByteArrayOp AddrRep) = ILIT(144)
443 tagOf_PrimOp (ReadByteArrayOp FloatRep) = ILIT(145)
444 tagOf_PrimOp (ReadByteArrayOp DoubleRep) = ILIT(146)
445 tagOf_PrimOp (ReadByteArrayOp StablePtrRep) = ILIT(147)
446 tagOf_PrimOp (ReadByteArrayOp Int64Rep) = ILIT(148)
447 tagOf_PrimOp (ReadByteArrayOp Word64Rep) = ILIT(149)
449 tagOf_PrimOp (WriteByteArrayOp CharRep) = ILIT(150)
450 tagOf_PrimOp (WriteByteArrayOp IntRep) = ILIT(151)
451 tagOf_PrimOp (WriteByteArrayOp WordRep) = ILIT(152)
452 tagOf_PrimOp (WriteByteArrayOp AddrRep) = ILIT(153)
453 tagOf_PrimOp (WriteByteArrayOp FloatRep) = ILIT(154)
454 tagOf_PrimOp (WriteByteArrayOp DoubleRep) = ILIT(155)
455 tagOf_PrimOp (WriteByteArrayOp StablePtrRep) = ILIT(156)
456 tagOf_PrimOp (WriteByteArrayOp Int64Rep) = ILIT(157)
457 tagOf_PrimOp (WriteByteArrayOp Word64Rep) = ILIT(158)
459 tagOf_PrimOp (IndexByteArrayOp CharRep) = ILIT(159)
460 tagOf_PrimOp (IndexByteArrayOp IntRep) = ILIT(160)
461 tagOf_PrimOp (IndexByteArrayOp WordRep) = ILIT(161)
462 tagOf_PrimOp (IndexByteArrayOp AddrRep) = ILIT(162)
463 tagOf_PrimOp (IndexByteArrayOp FloatRep) = ILIT(163)
464 tagOf_PrimOp (IndexByteArrayOp DoubleRep) = ILIT(164)
465 tagOf_PrimOp (IndexByteArrayOp StablePtrRep) = ILIT(165)
466 tagOf_PrimOp (IndexByteArrayOp Int64Rep) = ILIT(166)
467 tagOf_PrimOp (IndexByteArrayOp Word64Rep) = ILIT(167)
469 tagOf_PrimOp (IndexOffAddrOp CharRep) = ILIT(168)
470 tagOf_PrimOp (IndexOffAddrOp IntRep) = ILIT(169)
471 tagOf_PrimOp (IndexOffAddrOp WordRep) = ILIT(170)
472 tagOf_PrimOp (IndexOffAddrOp AddrRep) = ILIT(171)
473 tagOf_PrimOp (IndexOffAddrOp FloatRep) = ILIT(172)
474 tagOf_PrimOp (IndexOffAddrOp DoubleRep) = ILIT(173)
475 tagOf_PrimOp (IndexOffAddrOp StablePtrRep) = ILIT(174)
476 tagOf_PrimOp (IndexOffAddrOp Int64Rep) = ILIT(175)
477 tagOf_PrimOp (IndexOffAddrOp Word64Rep) = ILIT(176)
479 tagOf_PrimOp (IndexOffForeignObjOp CharRep) = ILIT(177)
480 tagOf_PrimOp (IndexOffForeignObjOp IntRep) = ILIT(178)
481 tagOf_PrimOp (IndexOffForeignObjOp WordRep) = ILIT(179)
482 tagOf_PrimOp (IndexOffForeignObjOp AddrRep) = ILIT(180)
483 tagOf_PrimOp (IndexOffForeignObjOp FloatRep) = ILIT(181)
484 tagOf_PrimOp (IndexOffForeignObjOp DoubleRep) = ILIT(182)
485 tagOf_PrimOp (IndexOffForeignObjOp StablePtrRep) = ILIT(183)
486 tagOf_PrimOp (IndexOffForeignObjOp Int64Rep) = ILIT(184)
487 tagOf_PrimOp (IndexOffForeignObjOp Word64Rep) = ILIT(185)
489 tagOf_PrimOp (WriteOffAddrOp CharRep) = ILIT(186)
490 tagOf_PrimOp (WriteOffAddrOp IntRep) = ILIT(187)
491 tagOf_PrimOp (WriteOffAddrOp WordRep) = ILIT(188)
492 tagOf_PrimOp (WriteOffAddrOp AddrRep) = ILIT(189)
493 tagOf_PrimOp (WriteOffAddrOp FloatRep) = ILIT(190)
494 tagOf_PrimOp (WriteOffAddrOp DoubleRep) = ILIT(191)
495 tagOf_PrimOp (WriteOffAddrOp StablePtrRep) = ILIT(192)
496 tagOf_PrimOp (WriteOffAddrOp ForeignObjRep) = ILIT(193)
497 tagOf_PrimOp (WriteOffAddrOp Int64Rep) = ILIT(194)
498 tagOf_PrimOp (WriteOffAddrOp Word64Rep) = ILIT(195)
500 tagOf_PrimOp UnsafeFreezeArrayOp = ILIT(196)
501 tagOf_PrimOp UnsafeFreezeByteArrayOp = ILIT(197)
502 tagOf_PrimOp SizeofByteArrayOp = ILIT(198)
503 tagOf_PrimOp SizeofMutableByteArrayOp = ILIT(199)
505 tagOf_PrimOp NewMVarOp = ILIT(200)
506 tagOf_PrimOp TakeMVarOp = ILIT(201)
507 tagOf_PrimOp PutMVarOp = ILIT(202)
508 tagOf_PrimOp SameMVarOp = ILIT(203)
509 tagOf_PrimOp IsEmptyMVarOp = ILIT(204)
510 tagOf_PrimOp MakeForeignObjOp = ILIT(205)
511 tagOf_PrimOp WriteForeignObjOp = ILIT(206)
512 tagOf_PrimOp MkWeakOp = ILIT(207)
513 tagOf_PrimOp DeRefWeakOp = ILIT(208)
514 tagOf_PrimOp FinalizeWeakOp = ILIT(209)
515 tagOf_PrimOp MakeStableNameOp = ILIT(210)
516 tagOf_PrimOp EqStableNameOp = ILIT(211)
517 tagOf_PrimOp StableNameToIntOp = ILIT(212)
518 tagOf_PrimOp MakeStablePtrOp = ILIT(213)
519 tagOf_PrimOp DeRefStablePtrOp = ILIT(214)
520 tagOf_PrimOp EqStablePtrOp = ILIT(215)
521 tagOf_PrimOp (CCallOp _ _ _ _) = ILIT(216)
522 tagOf_PrimOp ReallyUnsafePtrEqualityOp = ILIT(217)
523 tagOf_PrimOp SeqOp = ILIT(218)
524 tagOf_PrimOp ParOp = ILIT(219)
525 tagOf_PrimOp ForkOp = ILIT(220)
526 tagOf_PrimOp KillThreadOp = ILIT(221)
527 tagOf_PrimOp DelayOp = ILIT(222)
528 tagOf_PrimOp WaitReadOp = ILIT(223)
529 tagOf_PrimOp WaitWriteOp = ILIT(224)
530 tagOf_PrimOp ParGlobalOp = ILIT(225)
531 tagOf_PrimOp ParLocalOp = ILIT(226)
532 tagOf_PrimOp ParAtOp = ILIT(227)
533 tagOf_PrimOp ParAtAbsOp = ILIT(228)
534 tagOf_PrimOp ParAtRelOp = ILIT(229)
535 tagOf_PrimOp ParAtForNowOp = ILIT(230)
536 tagOf_PrimOp CopyableOp = ILIT(231)
537 tagOf_PrimOp NoFollowOp = ILIT(232)
538 tagOf_PrimOp NewMutVarOp = ILIT(233)
539 tagOf_PrimOp ReadMutVarOp = ILIT(234)
540 tagOf_PrimOp WriteMutVarOp = ILIT(235)
541 tagOf_PrimOp SameMutVarOp = ILIT(236)
542 tagOf_PrimOp CatchOp = ILIT(237)
543 tagOf_PrimOp RaiseOp = ILIT(238)
545 tagOf_PrimOp op = pprPanic# "tagOf_PrimOp: pattern-match" (ppr op)
546 --panic# "tagOf_PrimOp: pattern-match"
548 instance Eq PrimOp where
549 op1 == op2 = tagOf_PrimOp op1 _EQ_ tagOf_PrimOp op2
551 instance Ord PrimOp where
552 op1 < op2 = tagOf_PrimOp op1 _LT_ tagOf_PrimOp op2
553 op1 <= op2 = tagOf_PrimOp op1 _LE_ tagOf_PrimOp op2
554 op1 >= op2 = tagOf_PrimOp op1 _GE_ tagOf_PrimOp op2
555 op1 > op2 = tagOf_PrimOp op1 _GT_ tagOf_PrimOp op2
556 op1 `compare` op2 | op1 < op2 = LT
560 instance Outputable PrimOp where
561 ppr op = pprPrimOp op
563 instance Show PrimOp where
564 showsPrec p op = showsPrecSDoc p (pprPrimOp op)
567 An @Enum@-derived list would be better; meanwhile... (ToDo)
698 NewByteArrayOp CharRep,
699 NewByteArrayOp IntRep,
700 NewByteArrayOp WordRep,
701 NewByteArrayOp AddrRep,
702 NewByteArrayOp FloatRep,
703 NewByteArrayOp DoubleRep,
704 NewByteArrayOp StablePtrRep,
706 SameMutableByteArrayOp,
710 ReadByteArrayOp CharRep,
711 ReadByteArrayOp IntRep,
712 ReadByteArrayOp WordRep,
713 ReadByteArrayOp AddrRep,
714 ReadByteArrayOp FloatRep,
715 ReadByteArrayOp DoubleRep,
716 ReadByteArrayOp StablePtrRep,
717 ReadByteArrayOp Int64Rep,
718 ReadByteArrayOp Word64Rep,
719 WriteByteArrayOp CharRep,
720 WriteByteArrayOp IntRep,
721 WriteByteArrayOp WordRep,
722 WriteByteArrayOp AddrRep,
723 WriteByteArrayOp FloatRep,
724 WriteByteArrayOp DoubleRep,
725 WriteByteArrayOp StablePtrRep,
726 WriteByteArrayOp Int64Rep,
727 WriteByteArrayOp Word64Rep,
728 IndexByteArrayOp CharRep,
729 IndexByteArrayOp IntRep,
730 IndexByteArrayOp WordRep,
731 IndexByteArrayOp AddrRep,
732 IndexByteArrayOp FloatRep,
733 IndexByteArrayOp DoubleRep,
734 IndexByteArrayOp StablePtrRep,
735 IndexByteArrayOp Int64Rep,
736 IndexByteArrayOp Word64Rep,
737 IndexOffForeignObjOp CharRep,
738 IndexOffForeignObjOp AddrRep,
739 IndexOffForeignObjOp IntRep,
740 IndexOffForeignObjOp WordRep,
741 IndexOffForeignObjOp FloatRep,
742 IndexOffForeignObjOp DoubleRep,
743 IndexOffForeignObjOp StablePtrRep,
744 IndexOffForeignObjOp Int64Rep,
745 IndexOffForeignObjOp Word64Rep,
746 IndexOffAddrOp CharRep,
747 IndexOffAddrOp IntRep,
748 IndexOffAddrOp WordRep,
749 IndexOffAddrOp AddrRep,
750 IndexOffAddrOp FloatRep,
751 IndexOffAddrOp DoubleRep,
752 IndexOffAddrOp StablePtrRep,
753 IndexOffAddrOp Int64Rep,
754 IndexOffAddrOp Word64Rep,
755 WriteOffAddrOp CharRep,
756 WriteOffAddrOp IntRep,
757 WriteOffAddrOp WordRep,
758 WriteOffAddrOp AddrRep,
759 WriteOffAddrOp FloatRep,
760 WriteOffAddrOp DoubleRep,
761 WriteOffAddrOp ForeignObjRep,
762 WriteOffAddrOp StablePtrRep,
763 WriteOffAddrOp Int64Rep,
764 WriteOffAddrOp Word64Rep,
766 UnsafeFreezeByteArrayOp,
768 SizeofMutableByteArrayOp,
791 ReallyUnsafePtrEqualityOp,
810 %************************************************************************
812 \subsection[PrimOp-info]{The essential info about each @PrimOp@}
814 %************************************************************************
816 The @String@ in the @PrimOpInfos@ is the ``base name'' by which the user may
817 refer to the primitive operation. The conventional \tr{#}-for-
818 unboxed ops is added on later.
820 The reason for the funny characters in the names is so we do not
821 interfere with the programmer's Haskell name spaces.
823 We use @PrimKinds@ for the ``type'' information, because they're
824 (slightly) more convenient to use than @TyCons@.
827 = Dyadic OccName -- string :: T -> T -> T
829 | Monadic OccName -- string :: T -> T
831 | Compare OccName -- string :: T -> T -> Bool
834 | GenPrimOp OccName -- string :: \/a1..an . T1 -> .. -> Tk -> T
839 mkDyadic str ty = Dyadic (mkSrcVarOcc str) ty
840 mkMonadic str ty = Monadic (mkSrcVarOcc str) ty
841 mkCompare str ty = Compare (mkSrcVarOcc str) ty
842 mkGenPrimOp str tvs tys ty = GenPrimOp (mkSrcVarOcc str) tvs tys ty
847 one_Integer_ty = [intPrimTy, byteArrayPrimTy]
849 = [intPrimTy, byteArrayPrimTy, -- first Integer pieces
850 intPrimTy, byteArrayPrimTy] -- second '' pieces
851 an_Integer_and_Int_tys
852 = [intPrimTy, byteArrayPrimTy, -- Integer
855 unboxedPair = mkUnboxedTupleTy 2
856 unboxedTriple = mkUnboxedTupleTy 3
857 unboxedQuadruple = mkUnboxedTupleTy 4
859 integerMonadic name = mkGenPrimOp name [] one_Integer_ty
860 (unboxedPair one_Integer_ty)
862 integerDyadic name = mkGenPrimOp name [] two_Integer_tys
863 (unboxedPair one_Integer_ty)
865 integerDyadic2Results name = mkGenPrimOp name [] two_Integer_tys
866 (unboxedQuadruple two_Integer_tys)
868 integerCompare name = mkGenPrimOp name [] two_Integer_tys intPrimTy
871 %************************************************************************
873 \subsubsection{Strictness}
875 %************************************************************************
877 Not all primops are strict!
880 primOpStrictness :: PrimOp -> ([Demand], Bool)
881 -- See IdInfo.StrictnessInfo for discussion of what the results
882 -- **NB** as a cheap hack, to avoid having to look up the PrimOp's arity,
883 -- the list of demands may be infinite!
884 -- Use only the ones you ned.
886 primOpStrictness SeqOp = ([wwLazy], False)
887 primOpStrictness ParOp = ([wwLazy], False)
888 primOpStrictness ForkOp = ([wwLazy, wwPrim], False)
890 primOpStrictness NewArrayOp = ([wwPrim, wwLazy, wwPrim], False)
891 primOpStrictness WriteArrayOp = ([wwPrim, wwPrim, wwLazy, wwPrim], False)
893 primOpStrictness NewMutVarOp = ([wwLazy, wwPrim], False)
894 primOpStrictness WriteMutVarOp = ([wwPrim, wwLazy, wwPrim], False)
896 primOpStrictness PutMVarOp = ([wwPrim, wwLazy, wwPrim], False)
898 primOpStrictness CatchOp = ([wwLazy, wwLazy], False)
899 primOpStrictness RaiseOp = ([wwLazy], True) -- NB: True => result is bottom
901 primOpStrictness MkWeakOp = ([wwLazy, wwLazy, wwLazy, wwPrim], False)
902 primOpStrictness MakeStableNameOp = ([wwLazy, wwPrim], False)
903 primOpStrictness MakeStablePtrOp = ([wwLazy, wwPrim], False)
905 -- The rest all have primitive-typed arguments
906 primOpStrictness other = (repeat wwPrim, False)
909 %************************************************************************
911 \subsubsection[PrimOp-comparison]{PrimOpInfo basic comparison ops}
913 %************************************************************************
915 @primOpInfo@ gives all essential information (from which everything
916 else, notably a type, can be constructed) for each @PrimOp@.
919 primOpInfo :: PrimOp -> PrimOpInfo
922 There's plenty of this stuff!
925 primOpInfo CharGtOp = mkCompare SLIT("gtChar#") charPrimTy
926 primOpInfo CharGeOp = mkCompare SLIT("geChar#") charPrimTy
927 primOpInfo CharEqOp = mkCompare SLIT("eqChar#") charPrimTy
928 primOpInfo CharNeOp = mkCompare SLIT("neChar#") charPrimTy
929 primOpInfo CharLtOp = mkCompare SLIT("ltChar#") charPrimTy
930 primOpInfo CharLeOp = mkCompare SLIT("leChar#") charPrimTy
932 primOpInfo IntGtOp = mkCompare SLIT(">#") intPrimTy
933 primOpInfo IntGeOp = mkCompare SLIT(">=#") intPrimTy
934 primOpInfo IntEqOp = mkCompare SLIT("==#") intPrimTy
935 primOpInfo IntNeOp = mkCompare SLIT("/=#") intPrimTy
936 primOpInfo IntLtOp = mkCompare SLIT("<#") intPrimTy
937 primOpInfo IntLeOp = mkCompare SLIT("<=#") intPrimTy
939 primOpInfo WordGtOp = mkCompare SLIT("gtWord#") wordPrimTy
940 primOpInfo WordGeOp = mkCompare SLIT("geWord#") wordPrimTy
941 primOpInfo WordEqOp = mkCompare SLIT("eqWord#") wordPrimTy
942 primOpInfo WordNeOp = mkCompare SLIT("neWord#") wordPrimTy
943 primOpInfo WordLtOp = mkCompare SLIT("ltWord#") wordPrimTy
944 primOpInfo WordLeOp = mkCompare SLIT("leWord#") wordPrimTy
946 primOpInfo AddrGtOp = mkCompare SLIT("gtAddr#") addrPrimTy
947 primOpInfo AddrGeOp = mkCompare SLIT("geAddr#") addrPrimTy
948 primOpInfo AddrEqOp = mkCompare SLIT("eqAddr#") addrPrimTy
949 primOpInfo AddrNeOp = mkCompare SLIT("neAddr#") addrPrimTy
950 primOpInfo AddrLtOp = mkCompare SLIT("ltAddr#") addrPrimTy
951 primOpInfo AddrLeOp = mkCompare SLIT("leAddr#") addrPrimTy
953 primOpInfo FloatGtOp = mkCompare SLIT("gtFloat#") floatPrimTy
954 primOpInfo FloatGeOp = mkCompare SLIT("geFloat#") floatPrimTy
955 primOpInfo FloatEqOp = mkCompare SLIT("eqFloat#") floatPrimTy
956 primOpInfo FloatNeOp = mkCompare SLIT("neFloat#") floatPrimTy
957 primOpInfo FloatLtOp = mkCompare SLIT("ltFloat#") floatPrimTy
958 primOpInfo FloatLeOp = mkCompare SLIT("leFloat#") floatPrimTy
960 primOpInfo DoubleGtOp = mkCompare SLIT(">##") doublePrimTy
961 primOpInfo DoubleGeOp = mkCompare SLIT(">=##") doublePrimTy
962 primOpInfo DoubleEqOp = mkCompare SLIT("==##") doublePrimTy
963 primOpInfo DoubleNeOp = mkCompare SLIT("/=##") doublePrimTy
964 primOpInfo DoubleLtOp = mkCompare SLIT("<##") doublePrimTy
965 primOpInfo DoubleLeOp = mkCompare SLIT("<=##") doublePrimTy
969 %************************************************************************
971 \subsubsection[PrimOp-Char]{PrimOpInfo for @Char#@s}
973 %************************************************************************
976 primOpInfo OrdOp = mkGenPrimOp SLIT("ord#") [] [charPrimTy] intPrimTy
977 primOpInfo ChrOp = mkGenPrimOp SLIT("chr#") [] [intPrimTy] charPrimTy
980 %************************************************************************
982 \subsubsection[PrimOp-Int]{PrimOpInfo for @Int#@s}
984 %************************************************************************
987 primOpInfo IntAddOp = mkDyadic SLIT("+#") intPrimTy
988 primOpInfo IntSubOp = mkDyadic SLIT("-#") intPrimTy
989 primOpInfo IntMulOp = mkDyadic SLIT("*#") intPrimTy
990 primOpInfo IntQuotOp = mkDyadic SLIT("quotInt#") intPrimTy
991 primOpInfo IntRemOp = mkDyadic SLIT("remInt#") intPrimTy
993 primOpInfo IntNegOp = mkMonadic SLIT("negateInt#") intPrimTy
994 primOpInfo IntAbsOp = mkMonadic SLIT("absInt#") intPrimTy
996 primOpInfo IntAddCOp =
997 mkGenPrimOp SLIT("addIntC#") [] [intPrimTy, intPrimTy]
998 (unboxedPair [intPrimTy, intPrimTy])
1000 primOpInfo IntSubCOp =
1001 mkGenPrimOp SLIT("subIntC#") [] [intPrimTy, intPrimTy]
1002 (unboxedPair [intPrimTy, intPrimTy])
1004 primOpInfo IntMulCOp =
1005 mkGenPrimOp SLIT("mulIntC#") [] [intPrimTy, intPrimTy]
1006 (unboxedPair [intPrimTy, intPrimTy])
1009 %************************************************************************
1011 \subsubsection[PrimOp-Word]{PrimOpInfo for @Word#@s}
1013 %************************************************************************
1015 A @Word#@ is an unsigned @Int#@.
1018 primOpInfo WordQuotOp = mkDyadic SLIT("quotWord#") wordPrimTy
1019 primOpInfo WordRemOp = mkDyadic SLIT("remWord#") wordPrimTy
1021 primOpInfo AndOp = mkDyadic SLIT("and#") wordPrimTy
1022 primOpInfo OrOp = mkDyadic SLIT("or#") wordPrimTy
1023 primOpInfo XorOp = mkDyadic SLIT("xor#") wordPrimTy
1024 primOpInfo NotOp = mkMonadic SLIT("not#") wordPrimTy
1027 = mkGenPrimOp SLIT("shiftL#") [] [wordPrimTy, intPrimTy] wordPrimTy
1029 = mkGenPrimOp SLIT("shiftRL#") [] [wordPrimTy, intPrimTy] wordPrimTy
1032 = mkGenPrimOp SLIT("iShiftL#") [] [intPrimTy, intPrimTy] intPrimTy
1034 = mkGenPrimOp SLIT("iShiftRA#") [] [intPrimTy, intPrimTy] intPrimTy
1036 = mkGenPrimOp SLIT("iShiftRL#") [] [intPrimTy, intPrimTy] intPrimTy
1038 primOpInfo Int2WordOp = mkGenPrimOp SLIT("int2Word#") [] [intPrimTy] wordPrimTy
1039 primOpInfo Word2IntOp = mkGenPrimOp SLIT("word2Int#") [] [wordPrimTy] intPrimTy
1042 %************************************************************************
1044 \subsubsection[PrimOp-Addr]{PrimOpInfo for @Addr#@s}
1046 %************************************************************************
1049 primOpInfo Int2AddrOp = mkGenPrimOp SLIT("int2Addr#") [] [intPrimTy] addrPrimTy
1050 primOpInfo Addr2IntOp = mkGenPrimOp SLIT("addr2Int#") [] [addrPrimTy] intPrimTy
1054 %************************************************************************
1056 \subsubsection[PrimOp-Float]{PrimOpInfo for @Float#@s}
1058 %************************************************************************
1060 @encodeFloat#@ and @decodeFloat#@ are given w/ Integer-stuff (it's
1064 primOpInfo FloatAddOp = mkDyadic SLIT("plusFloat#") floatPrimTy
1065 primOpInfo FloatSubOp = mkDyadic SLIT("minusFloat#") floatPrimTy
1066 primOpInfo FloatMulOp = mkDyadic SLIT("timesFloat#") floatPrimTy
1067 primOpInfo FloatDivOp = mkDyadic SLIT("divideFloat#") floatPrimTy
1068 primOpInfo FloatNegOp = mkMonadic SLIT("negateFloat#") floatPrimTy
1070 primOpInfo Float2IntOp = mkGenPrimOp SLIT("float2Int#") [] [floatPrimTy] intPrimTy
1071 primOpInfo Int2FloatOp = mkGenPrimOp SLIT("int2Float#") [] [intPrimTy] floatPrimTy
1073 primOpInfo FloatExpOp = mkMonadic SLIT("expFloat#") floatPrimTy
1074 primOpInfo FloatLogOp = mkMonadic SLIT("logFloat#") floatPrimTy
1075 primOpInfo FloatSqrtOp = mkMonadic SLIT("sqrtFloat#") floatPrimTy
1076 primOpInfo FloatSinOp = mkMonadic SLIT("sinFloat#") floatPrimTy
1077 primOpInfo FloatCosOp = mkMonadic SLIT("cosFloat#") floatPrimTy
1078 primOpInfo FloatTanOp = mkMonadic SLIT("tanFloat#") floatPrimTy
1079 primOpInfo FloatAsinOp = mkMonadic SLIT("asinFloat#") floatPrimTy
1080 primOpInfo FloatAcosOp = mkMonadic SLIT("acosFloat#") floatPrimTy
1081 primOpInfo FloatAtanOp = mkMonadic SLIT("atanFloat#") floatPrimTy
1082 primOpInfo FloatSinhOp = mkMonadic SLIT("sinhFloat#") floatPrimTy
1083 primOpInfo FloatCoshOp = mkMonadic SLIT("coshFloat#") floatPrimTy
1084 primOpInfo FloatTanhOp = mkMonadic SLIT("tanhFloat#") floatPrimTy
1085 primOpInfo FloatPowerOp = mkDyadic SLIT("powerFloat#") floatPrimTy
1088 %************************************************************************
1090 \subsubsection[PrimOp-Double]{PrimOpInfo for @Double#@s}
1092 %************************************************************************
1094 @encodeDouble#@ and @decodeDouble#@ are given w/ Integer-stuff (it's
1098 primOpInfo DoubleAddOp = mkDyadic SLIT("+##") doublePrimTy
1099 primOpInfo DoubleSubOp = mkDyadic SLIT("-##") doublePrimTy
1100 primOpInfo DoubleMulOp = mkDyadic SLIT("*##") doublePrimTy
1101 primOpInfo DoubleDivOp = mkDyadic SLIT("/##") doublePrimTy
1102 primOpInfo DoubleNegOp = mkMonadic SLIT("negateDouble#") doublePrimTy
1104 primOpInfo Double2IntOp = mkGenPrimOp SLIT("double2Int#") [] [doublePrimTy] intPrimTy
1105 primOpInfo Int2DoubleOp = mkGenPrimOp SLIT("int2Double#") [] [intPrimTy] doublePrimTy
1107 primOpInfo Double2FloatOp = mkGenPrimOp SLIT("double2Float#") [] [doublePrimTy] floatPrimTy
1108 primOpInfo Float2DoubleOp = mkGenPrimOp SLIT("float2Double#") [] [floatPrimTy] doublePrimTy
1110 primOpInfo DoubleExpOp = mkMonadic SLIT("expDouble#") doublePrimTy
1111 primOpInfo DoubleLogOp = mkMonadic SLIT("logDouble#") doublePrimTy
1112 primOpInfo DoubleSqrtOp = mkMonadic SLIT("sqrtDouble#") doublePrimTy
1113 primOpInfo DoubleSinOp = mkMonadic SLIT("sinDouble#") doublePrimTy
1114 primOpInfo DoubleCosOp = mkMonadic SLIT("cosDouble#") doublePrimTy
1115 primOpInfo DoubleTanOp = mkMonadic SLIT("tanDouble#") doublePrimTy
1116 primOpInfo DoubleAsinOp = mkMonadic SLIT("asinDouble#") doublePrimTy
1117 primOpInfo DoubleAcosOp = mkMonadic SLIT("acosDouble#") doublePrimTy
1118 primOpInfo DoubleAtanOp = mkMonadic SLIT("atanDouble#") doublePrimTy
1119 primOpInfo DoubleSinhOp = mkMonadic SLIT("sinhDouble#") doublePrimTy
1120 primOpInfo DoubleCoshOp = mkMonadic SLIT("coshDouble#") doublePrimTy
1121 primOpInfo DoubleTanhOp = mkMonadic SLIT("tanhDouble#") doublePrimTy
1122 primOpInfo DoublePowerOp= mkDyadic SLIT("**##") doublePrimTy
1125 %************************************************************************
1127 \subsubsection[PrimOp-Integer]{PrimOpInfo for @Integer@ (and related!)}
1129 %************************************************************************
1132 primOpInfo IntegerNegOp = integerMonadic SLIT("negateInteger#")
1134 primOpInfo IntegerAddOp = integerDyadic SLIT("plusInteger#")
1135 primOpInfo IntegerSubOp = integerDyadic SLIT("minusInteger#")
1136 primOpInfo IntegerMulOp = integerDyadic SLIT("timesInteger#")
1137 primOpInfo IntegerGcdOp = integerDyadic SLIT("gcdInteger#")
1139 primOpInfo IntegerCmpOp = integerCompare SLIT("cmpInteger#")
1140 primOpInfo IntegerCmpIntOp
1141 = mkGenPrimOp SLIT("cmpIntegerInt#") [] an_Integer_and_Int_tys intPrimTy
1143 primOpInfo IntegerQuotRemOp = integerDyadic2Results SLIT("quotRemInteger#")
1144 primOpInfo IntegerDivModOp = integerDyadic2Results SLIT("divModInteger#")
1146 primOpInfo Integer2IntOp
1147 = mkGenPrimOp SLIT("integer2Int#") [] one_Integer_ty intPrimTy
1149 primOpInfo Integer2WordOp
1150 = mkGenPrimOp SLIT("integer2Word#") [] one_Integer_ty wordPrimTy
1152 primOpInfo Int2IntegerOp
1153 = mkGenPrimOp SLIT("int2Integer#") [] [intPrimTy]
1154 (unboxedPair one_Integer_ty)
1156 primOpInfo Word2IntegerOp
1157 = mkGenPrimOp SLIT("word2Integer#") [] [wordPrimTy]
1158 (unboxedPair one_Integer_ty)
1160 primOpInfo Addr2IntegerOp
1161 = mkGenPrimOp SLIT("addr2Integer#") [] [addrPrimTy]
1162 (unboxedPair one_Integer_ty)
1164 primOpInfo IntegerToInt64Op
1165 = mkGenPrimOp SLIT("integerToInt64#") [] one_Integer_ty int64PrimTy
1167 primOpInfo Int64ToIntegerOp
1168 = mkGenPrimOp SLIT("int64ToInteger#") [] [int64PrimTy]
1169 (unboxedPair one_Integer_ty)
1171 primOpInfo Word64ToIntegerOp
1172 = mkGenPrimOp SLIT("word64ToInteger#") [] [word64PrimTy]
1173 (unboxedPair one_Integer_ty)
1175 primOpInfo IntegerToWord64Op
1176 = mkGenPrimOp SLIT("integerToWord64#") [] one_Integer_ty word64PrimTy
1179 Encoding and decoding of floating-point numbers is sorta
1183 primOpInfo FloatEncodeOp
1184 = mkGenPrimOp SLIT("encodeFloat#") [] an_Integer_and_Int_tys floatPrimTy
1186 primOpInfo DoubleEncodeOp
1187 = mkGenPrimOp SLIT("encodeDouble#") [] an_Integer_and_Int_tys doublePrimTy
1189 primOpInfo FloatDecodeOp
1190 = mkGenPrimOp SLIT("decodeFloat#") [] [floatPrimTy]
1191 (unboxedTriple [intPrimTy, intPrimTy, byteArrayPrimTy])
1192 primOpInfo DoubleDecodeOp
1193 = mkGenPrimOp SLIT("decodeDouble#") [] [doublePrimTy]
1194 (unboxedTriple [intPrimTy, intPrimTy, byteArrayPrimTy])
1197 %************************************************************************
1199 \subsubsection[PrimOp-Arrays]{PrimOpInfo for primitive arrays}
1201 %************************************************************************
1204 primOpInfo NewArrayOp
1206 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1207 state = mkStatePrimTy s
1209 mkGenPrimOp SLIT("newArray#") [s_tv, elt_tv]
1210 [intPrimTy, elt, state]
1211 (unboxedPair [state, mkMutableArrayPrimTy s elt])
1213 primOpInfo (NewByteArrayOp kind)
1215 s = alphaTy; s_tv = alphaTyVar
1217 op_str = _PK_ ("new" ++ primRepString kind ++ "Array#")
1218 state = mkStatePrimTy s
1220 mkGenPrimOp op_str [s_tv]
1222 (unboxedPair [state, mkMutableByteArrayPrimTy s])
1224 ---------------------------------------------------------------------------
1226 primOpInfo SameMutableArrayOp
1228 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1229 mut_arr_ty = mkMutableArrayPrimTy s elt
1231 mkGenPrimOp SLIT("sameMutableArray#") [s_tv, elt_tv] [mut_arr_ty, mut_arr_ty]
1234 primOpInfo SameMutableByteArrayOp
1236 s = alphaTy; s_tv = alphaTyVar;
1237 mut_arr_ty = mkMutableByteArrayPrimTy s
1239 mkGenPrimOp SLIT("sameMutableByteArray#") [s_tv] [mut_arr_ty, mut_arr_ty]
1242 ---------------------------------------------------------------------------
1243 -- Primitive arrays of Haskell pointers:
1245 primOpInfo ReadArrayOp
1247 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1248 state = mkStatePrimTy s
1250 mkGenPrimOp SLIT("readArray#") [s_tv, elt_tv]
1251 [mkMutableArrayPrimTy s elt, intPrimTy, state]
1252 (unboxedPair [state, elt])
1255 primOpInfo WriteArrayOp
1257 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1259 mkGenPrimOp SLIT("writeArray#") [s_tv, elt_tv]
1260 [mkMutableArrayPrimTy s elt, intPrimTy, elt, mkStatePrimTy s]
1263 primOpInfo IndexArrayOp
1264 = let { elt = alphaTy; elt_tv = alphaTyVar } in
1265 mkGenPrimOp SLIT("indexArray#") [elt_tv] [mkArrayPrimTy elt, intPrimTy]
1266 (unboxedPair [realWorldStatePrimTy, elt])
1268 ---------------------------------------------------------------------------
1269 -- Primitive arrays full of unboxed bytes:
1271 primOpInfo (ReadByteArrayOp kind)
1273 s = alphaTy; s_tv = alphaTyVar
1275 op_str = _PK_ ("read" ++ primRepString kind ++ "Array#")
1276 (tvs, prim_ty) = mkPrimTyApp betaTyVars kind
1277 state = mkStatePrimTy s
1279 mkGenPrimOp op_str (s_tv:tvs)
1280 [mkMutableByteArrayPrimTy s, intPrimTy, state]
1281 (unboxedPair [state, prim_ty])
1283 primOpInfo (WriteByteArrayOp kind)
1285 s = alphaTy; s_tv = alphaTyVar
1286 op_str = _PK_ ("write" ++ primRepString kind ++ "Array#")
1287 (tvs, prim_ty) = mkPrimTyApp betaTyVars kind
1289 mkGenPrimOp op_str (s_tv:tvs)
1290 [mkMutableByteArrayPrimTy s, intPrimTy, prim_ty, mkStatePrimTy s]
1293 primOpInfo (IndexByteArrayOp kind)
1295 op_str = _PK_ ("index" ++ primRepString kind ++ "Array#")
1296 (tvs, prim_ty) = mkPrimTyApp alphaTyVars kind
1298 mkGenPrimOp op_str tvs [byteArrayPrimTy, intPrimTy] prim_ty
1300 primOpInfo (IndexOffForeignObjOp kind)
1302 op_str = _PK_ ("index" ++ primRepString kind ++ "OffForeignObj#")
1303 (tvs, prim_ty) = mkPrimTyApp alphaTyVars kind
1305 mkGenPrimOp op_str tvs [foreignObjPrimTy, intPrimTy] prim_ty
1307 primOpInfo (IndexOffAddrOp kind)
1309 op_str = _PK_ ("index" ++ primRepString kind ++ "OffAddr#")
1310 (tvs, prim_ty) = mkPrimTyApp alphaTyVars kind
1312 mkGenPrimOp op_str tvs [addrPrimTy, intPrimTy] prim_ty
1314 primOpInfo (WriteOffAddrOp kind)
1316 s = alphaTy; s_tv = alphaTyVar
1317 op_str = _PK_ ("write" ++ primRepString kind ++ "OffAddr#")
1318 (tvs, prim_ty) = mkPrimTyApp betaTyVars kind
1320 mkGenPrimOp op_str (s_tv:tvs)
1321 [addrPrimTy, intPrimTy, prim_ty, mkStatePrimTy s]
1324 ---------------------------------------------------------------------------
1325 primOpInfo UnsafeFreezeArrayOp
1327 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1328 state = mkStatePrimTy s
1330 mkGenPrimOp SLIT("unsafeFreezeArray#") [s_tv, elt_tv]
1331 [mkMutableArrayPrimTy s elt, state]
1332 (unboxedPair [state, mkArrayPrimTy elt])
1334 primOpInfo UnsafeFreezeByteArrayOp
1336 s = alphaTy; s_tv = alphaTyVar;
1337 state = mkStatePrimTy s
1339 mkGenPrimOp SLIT("unsafeFreezeByteArray#") [s_tv]
1340 [mkMutableByteArrayPrimTy s, state]
1341 (unboxedPair [state, byteArrayPrimTy])
1343 ---------------------------------------------------------------------------
1344 primOpInfo SizeofByteArrayOp
1346 SLIT("sizeofByteArray#") []
1350 primOpInfo SizeofMutableByteArrayOp
1351 = let { s = alphaTy; s_tv = alphaTyVar } in
1353 SLIT("sizeofMutableByteArray#") [s_tv]
1354 [mkMutableByteArrayPrimTy s]
1359 %************************************************************************
1361 \subsubsection[PrimOp-MutVars]{PrimOpInfo for mutable variable ops}
1363 %************************************************************************
1366 primOpInfo NewMutVarOp
1368 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1369 state = mkStatePrimTy s
1371 mkGenPrimOp SLIT("newMutVar#") [s_tv, elt_tv]
1373 (unboxedPair [state, mkMutVarPrimTy s elt])
1375 primOpInfo ReadMutVarOp
1377 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1378 state = mkStatePrimTy s
1380 mkGenPrimOp SLIT("readMutVar#") [s_tv, elt_tv]
1381 [mkMutVarPrimTy s elt, state]
1382 (unboxedPair [state, elt])
1385 primOpInfo WriteMutVarOp
1387 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1389 mkGenPrimOp SLIT("writeMutVar#") [s_tv, elt_tv]
1390 [mkMutVarPrimTy s elt, elt, mkStatePrimTy s]
1393 primOpInfo SameMutVarOp
1395 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar;
1396 mut_var_ty = mkMutVarPrimTy s elt
1398 mkGenPrimOp SLIT("sameMutVar#") [s_tv, elt_tv] [mut_var_ty, mut_var_ty]
1402 %************************************************************************
1404 \subsubsection[PrimOp-Exceptions]{PrimOpInfo for exceptions}
1406 %************************************************************************
1408 catch :: IO a -> (IOError -> IO a) -> IO a
1409 catch :: a -> (b -> a) -> a
1414 a = alphaTy; a_tv = alphaTyVar
1415 b = betaTy; b_tv = betaTyVar;
1417 mkGenPrimOp SLIT("catch#") [a_tv, b_tv] [a, mkFunTy b a] a
1421 a = alphaTy; a_tv = alphaTyVar
1422 b = betaTy; b_tv = betaTyVar;
1424 mkGenPrimOp SLIT("raise#") [a_tv, b_tv] [a] b
1427 %************************************************************************
1429 \subsubsection[PrimOp-MVars]{PrimOpInfo for synchronizing Variables}
1431 %************************************************************************
1434 primOpInfo NewMVarOp
1436 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1437 state = mkStatePrimTy s
1439 mkGenPrimOp SLIT("newMVar#") [s_tv, elt_tv] [state]
1440 (unboxedPair [state, mkMVarPrimTy s elt])
1442 primOpInfo TakeMVarOp
1444 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1445 state = mkStatePrimTy s
1447 mkGenPrimOp SLIT("takeMVar#") [s_tv, elt_tv]
1448 [mkMVarPrimTy s elt, state]
1449 (unboxedPair [state, elt])
1451 primOpInfo PutMVarOp
1453 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1455 mkGenPrimOp SLIT("putMVar#") [s_tv, elt_tv]
1456 [mkMVarPrimTy s elt, elt, mkStatePrimTy s]
1459 primOpInfo SameMVarOp
1461 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1462 mvar_ty = mkMVarPrimTy s elt
1464 mkGenPrimOp SLIT("sameMVar#") [s_tv, elt_tv] [mvar_ty, mvar_ty] boolTy
1466 primOpInfo IsEmptyMVarOp
1468 elt = alphaTy; elt_tv = alphaTyVar; s = betaTy; s_tv = betaTyVar
1469 state = mkStatePrimTy s
1471 mkGenPrimOp SLIT("isEmptyMVar#") [s_tv, elt_tv]
1472 [mkMVarPrimTy s elt, mkStatePrimTy s]
1473 (unboxedPair [state, intPrimTy])
1477 %************************************************************************
1479 \subsubsection[PrimOp-Wait]{PrimOpInfo for delay/wait operations}
1481 %************************************************************************
1487 s = alphaTy; s_tv = alphaTyVar
1489 mkGenPrimOp SLIT("delay#") [s_tv]
1490 [intPrimTy, mkStatePrimTy s] (mkStatePrimTy s)
1492 primOpInfo WaitReadOp
1494 s = alphaTy; s_tv = alphaTyVar
1496 mkGenPrimOp SLIT("waitRead#") [s_tv]
1497 [intPrimTy, mkStatePrimTy s] (mkStatePrimTy s)
1499 primOpInfo WaitWriteOp
1501 s = alphaTy; s_tv = alphaTyVar
1503 mkGenPrimOp SLIT("waitWrite#") [s_tv]
1504 [intPrimTy, mkStatePrimTy s] (mkStatePrimTy s)
1507 %************************************************************************
1509 \subsubsection[PrimOp-Concurrency]{Concurrency Primitives}
1511 %************************************************************************
1514 -- fork# :: a -> State# RealWorld -> (# State# RealWorld, ThreadId# #)
1516 = mkGenPrimOp SLIT("fork#") [alphaTyVar]
1517 [alphaTy, realWorldStatePrimTy]
1518 (unboxedPair [realWorldStatePrimTy, threadIdPrimTy])
1520 -- killThread# :: ThreadId# -> State# RealWorld -> State# RealWorld
1521 primOpInfo KillThreadOp
1522 = mkGenPrimOp SLIT("killThread#") []
1523 [threadIdPrimTy, realWorldStatePrimTy]
1524 realWorldStatePrimTy
1527 ************************************************************************
1529 \subsubsection[PrimOps-Foreign]{PrimOpInfo for Foreign Objects}
1531 %************************************************************************
1534 primOpInfo MakeForeignObjOp
1535 = mkGenPrimOp SLIT("makeForeignObj#") []
1536 [addrPrimTy, realWorldStatePrimTy]
1537 (unboxedPair [realWorldStatePrimTy, foreignObjPrimTy])
1539 primOpInfo WriteForeignObjOp
1541 s = alphaTy; s_tv = alphaTyVar
1543 mkGenPrimOp SLIT("writeForeignObj#") [s_tv]
1544 [foreignObjPrimTy, addrPrimTy, mkStatePrimTy s] (mkStatePrimTy s)
1547 ************************************************************************
1549 \subsubsection[PrimOps-Weak]{PrimOpInfo for Weak Pointers}
1551 %************************************************************************
1553 A @Weak@ Pointer is created by the @mkWeak#@ primitive:
1555 mkWeak# :: k -> v -> f -> State# RealWorld
1556 -> (# State# RealWorld, Weak# v #)
1558 In practice, you'll use the higher-level
1560 data Weak v = Weak# v
1561 mkWeak :: k -> v -> IO () -> IO (Weak v)
1565 = mkGenPrimOp SLIT("mkWeak#") [alphaTyVar, betaTyVar, gammaTyVar]
1566 [alphaTy, betaTy, gammaTy, realWorldStatePrimTy]
1567 (unboxedPair [realWorldStatePrimTy, mkWeakPrimTy betaTy])
1570 The following operation dereferences a weak pointer. The weak pointer
1571 may have been finalized, so the operation returns a result code which
1572 must be inspected before looking at the dereferenced value.
1574 deRefWeak# :: Weak# v -> State# RealWorld ->
1575 (# State# RealWorld, v, Int# #)
1577 Only look at v if the Int# returned is /= 0 !!
1579 The higher-level op is
1581 deRefWeak :: Weak v -> IO (Maybe v)
1584 primOpInfo DeRefWeakOp
1585 = mkGenPrimOp SLIT("deRefWeak#") [alphaTyVar]
1586 [mkWeakPrimTy alphaTy, realWorldStatePrimTy]
1587 (unboxedTriple [realWorldStatePrimTy, intPrimTy, alphaTy])
1590 Weak pointers can be finalized early by using the finalize# operation:
1592 finalizeWeak# :: Weak# v -> State# RealWorld ->
1593 (# State# RealWorld, Int#, IO () #)
1595 The Int# returned is either
1597 0 if the weak pointer has already been finalized, or it has no
1598 finalizer (the third component is then invalid).
1600 1 if the weak pointer is still alive, with the finalizer returned
1601 as the third component.
1604 primOpInfo FinalizeWeakOp
1605 = mkGenPrimOp SLIT("finalizeWeak#") [alphaTyVar]
1606 [mkWeakPrimTy alphaTy, realWorldStatePrimTy]
1607 (unboxedTriple [realWorldStatePrimTy, intPrimTy,
1608 mkFunTy realWorldStatePrimTy
1609 (unboxedPair [realWorldStatePrimTy,unitTy])])
1612 %************************************************************************
1614 \subsubsection[PrimOp-stable-pointers]{PrimOpInfo for stable pointers and stable names}
1616 %************************************************************************
1618 A {\em stable name/pointer} is an index into a table of stable name
1619 entries. Since the garbage collector is told about stable pointers,
1620 it is safe to pass a stable pointer to external systems such as C
1624 makeStablePtr# :: a -> State# RealWorld -> (# State# RealWorld, a #)
1625 freeStablePtr :: StablePtr# a -> State# RealWorld -> State# RealWorld
1626 deRefStablePtr# :: StablePtr# a -> State# RealWorld -> (# State# RealWorld, a #)
1627 eqStablePtr# :: StablePtr# a -> StablePtr# a -> Int#
1630 It may seem a bit surprising that @makeStablePtr#@ is a @IO@
1631 operation since it doesn't (directly) involve IO operations. The
1632 reason is that if some optimisation pass decided to duplicate calls to
1633 @makeStablePtr#@ and we only pass one of the stable pointers over, a
1634 massive space leak can result. Putting it into the IO monad
1635 prevents this. (Another reason for putting them in a monad is to
1636 ensure correct sequencing wrt the side-effecting @freeStablePtr@
1639 An important property of stable pointers is that if you call
1640 makeStablePtr# twice on the same object you get the same stable
1643 Note that we can implement @freeStablePtr#@ using @_ccall_@ (and,
1644 besides, it's not likely to be used from Haskell) so it's not a
1647 Question: Why @RealWorld@ - won't any instance of @_ST@ do the job? [ADR]
1652 A stable name is like a stable pointer, but with three important differences:
1654 (a) You can't deRef one to get back to the original object.
1655 (b) You can convert one to an Int.
1656 (c) You don't need to 'freeStableName'
1658 The existence of a stable name doesn't guarantee to keep the object it
1659 points to alive (unlike a stable pointer), hence (a).
1663 (a) makeStableName always returns the same value for a given
1664 object (same as stable pointers).
1666 (b) if two stable names are equal, it implies that the objects
1667 from which they were created were the same.
1669 (c) stableNameToInt always returns the same Int for a given
1673 primOpInfo MakeStablePtrOp
1674 = mkGenPrimOp SLIT("makeStablePtr#") [alphaTyVar]
1675 [alphaTy, realWorldStatePrimTy]
1676 (unboxedPair [realWorldStatePrimTy,
1677 mkTyConApp stablePtrPrimTyCon [alphaTy]])
1679 primOpInfo DeRefStablePtrOp
1680 = mkGenPrimOp SLIT("deRefStablePtr#") [alphaTyVar]
1681 [mkStablePtrPrimTy alphaTy, realWorldStatePrimTy]
1682 (unboxedPair [realWorldStatePrimTy, alphaTy])
1684 primOpInfo EqStablePtrOp
1685 = mkGenPrimOp SLIT("eqStablePtr#") [alphaTyVar, betaTyVar]
1686 [mkStablePtrPrimTy alphaTy, mkStablePtrPrimTy betaTy]
1689 primOpInfo MakeStableNameOp
1690 = mkGenPrimOp SLIT("makeStableName#") [alphaTyVar]
1691 [alphaTy, realWorldStatePrimTy]
1692 (unboxedPair [realWorldStatePrimTy,
1693 mkTyConApp stableNamePrimTyCon [alphaTy]])
1695 primOpInfo EqStableNameOp
1696 = mkGenPrimOp SLIT("eqStableName#") [alphaTyVar, betaTyVar]
1697 [mkStableNamePrimTy alphaTy, mkStableNamePrimTy betaTy]
1700 primOpInfo StableNameToIntOp
1701 = mkGenPrimOp SLIT("stableNameToInt#") [alphaTyVar]
1702 [mkStableNamePrimTy alphaTy]
1706 %************************************************************************
1708 \subsubsection[PrimOp-unsafePointerEquality]{PrimOpInfo for Pointer Equality}
1710 %************************************************************************
1712 [Alastair Reid is to blame for this!]
1714 These days, (Glasgow) Haskell seems to have a bit of everything from
1715 other languages: strict operations, mutable variables, sequencing,
1716 pointers, etc. About the only thing left is LISP's ability to test
1717 for pointer equality. So, let's add it in!
1720 reallyUnsafePtrEquality :: a -> a -> Int#
1723 which tests any two closures (of the same type) to see if they're the
1724 same. (Returns $0$ for @False@, $\neq 0$ for @True@ - to avoid
1725 difficulties of trying to box up the result.)
1727 NB This is {\em really unsafe\/} because even something as trivial as
1728 a garbage collection might change the answer by removing indirections.
1729 Still, no-one's forcing you to use it. If you're worried about little
1730 things like loss of referential transparency, you might like to wrap
1731 it all up in a monad-like thing as John O'Donnell and John Hughes did
1732 for non-determinism (1989 (Fraserburgh) Glasgow FP Workshop
1735 I'm thinking of using it to speed up a critical equality test in some
1736 graphics stuff in a context where the possibility of saying that
1737 denotationally equal things aren't isn't a problem (as long as it
1738 doesn't happen too often.) ADR
1740 To Will: Jim said this was already in, but I can't see it so I'm
1741 adding it. Up to you whether you add it. (Note that this could have
1742 been readily implemented using a @veryDangerousCCall@ before they were
1746 primOpInfo ReallyUnsafePtrEqualityOp
1747 = mkGenPrimOp SLIT("reallyUnsafePtrEquality#") [alphaTyVar]
1748 [alphaTy, alphaTy] intPrimTy
1751 %************************************************************************
1753 \subsubsection[PrimOp-parallel]{PrimOpInfo for parallelism op(s)}
1755 %************************************************************************
1758 primOpInfo SeqOp -- seq# :: a -> Int#
1759 = mkGenPrimOp SLIT("seq#") [alphaTyVar] [alphaTy] intPrimTy
1761 primOpInfo ParOp -- par# :: a -> Int#
1762 = mkGenPrimOp SLIT("par#") [alphaTyVar] [alphaTy] intPrimTy
1766 -- HWL: The first 4 Int# in all par... annotations denote:
1767 -- name, granularity info, size of result, degree of parallelism
1768 -- Same structure as _seq_ i.e. returns Int#
1770 primOpInfo ParGlobalOp -- parGlobal# :: Int# -> Int# -> Int# -> Int# -> a -> b -> b
1771 = mkGenPrimOp SLIT("parGlobal#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTy
1773 primOpInfo ParLocalOp -- parLocal# :: Int# -> Int# -> Int# -> Int# -> a -> b -> b
1774 = mkGenPrimOp SLIT("parLocal#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTy
1776 primOpInfo ParAtOp -- parAt# :: Int# -> Int# -> Int# -> Int# -> a -> b -> c -> c
1777 = mkGenPrimOp SLIT("parAt#") [alphaTyVar,betaTyVar,gammaTyVar] [betaTy,alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,gammaTy] intPrimTy
1779 primOpInfo ParAtAbsOp -- parAtAbs# :: Int# -> Int# -> Int# -> Int# -> Int# -> a -> b -> b
1780 = mkGenPrimOp SLIT("parAtAbs#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTy
1782 primOpInfo ParAtRelOp -- parAtRel# :: Int# -> Int# -> Int# -> Int# -> Int# -> a -> b -> b
1783 = mkGenPrimOp SLIT("parAtRel#") [alphaTyVar,betaTyVar] [alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,betaTy] intPrimTy
1785 primOpInfo ParAtForNowOp -- parAtForNow# :: Int# -> Int# -> Int# -> Int# -> a -> b -> c -> c
1786 = mkGenPrimOp SLIT("parAtForNow#") [alphaTyVar,betaTyVar,gammaTyVar] [betaTy,alphaTy,intPrimTy,intPrimTy,intPrimTy,intPrimTy,gammaTy] intPrimTy
1788 primOpInfo CopyableOp -- copyable# :: a -> a
1789 = mkGenPrimOp SLIT("copyable#") [alphaTyVar] [alphaTy] intPrimTy
1791 primOpInfo NoFollowOp -- noFollow# :: a -> a
1792 = mkGenPrimOp SLIT("noFollow#") [alphaTyVar] [alphaTy] intPrimTy
1795 %************************************************************************
1797 \subsubsection[PrimOp-IO-etc]{PrimOpInfo for C calls, and I/O-ish things}
1799 %************************************************************************
1802 primOpInfo (CCallOp _ _ _ _)
1803 = mkGenPrimOp SLIT("ccall#") [alphaTyVar] [] alphaTy
1806 primOpInfo (CCallOp _ _ _ _ arg_tys result_ty)
1807 = mkGenPrimOp SLIT("ccall#") [] arg_tys result_tycon tys_applied
1809 (result_tycon, tys_applied, _) = splitAlgTyConApp result_ty
1812 primOpInfo op = panic ("primOpInfo:"++ show (I# (tagOf_PrimOp op)))
1816 Some PrimOps need to be called out-of-line because they either need to
1817 perform a heap check or they block.
1830 NewByteArrayOp _ -> True
1831 IntegerAddOp -> True
1832 IntegerSubOp -> True
1833 IntegerMulOp -> True
1834 IntegerGcdOp -> True
1835 IntegerQuotRemOp -> True
1836 IntegerDivModOp -> True
1837 Int2IntegerOp -> True
1838 Word2IntegerOp -> True
1839 Addr2IntegerOp -> True
1840 Word64ToIntegerOp -> True
1841 Int64ToIntegerOp -> True
1842 FloatDecodeOp -> True
1843 DoubleDecodeOp -> True
1845 FinalizeWeakOp -> True
1846 MakeStableNameOp -> True
1847 MakeForeignObjOp -> True
1851 KillThreadOp -> True
1852 CCallOp _ _ may_gc@True _ -> True -- _ccall_GC_
1856 Sometimes we may choose to execute a PrimOp even though it isn't
1857 certain that its result will be required; ie execute them
1858 ``speculatively''. The same thing as ``cheap eagerness.'' Usually
1859 this is OK, because PrimOps are usually cheap, but it isn't OK for
1860 (a)~expensive PrimOps and (b)~PrimOps which can fail.
1862 See also @primOpIsCheap@ (below).
1864 PrimOps that have side effects also should not be executed speculatively
1865 or by data dependencies.
1868 primOpOkForSpeculation :: PrimOp -> Bool
1869 primOpOkForSpeculation op
1870 = not (primOpCanFail op || primOpHasSideEffects op || primOpOutOfLine op)
1873 @primOpIsCheap@, as used in \tr{SimplUtils.lhs}. For now (HACK
1874 WARNING), we just borrow some other predicates for a
1875 what-should-be-good-enough test. "Cheap" means willing to call it more
1876 than once. Evaluation order is unaffected.
1879 primOpIsCheap op = not (primOpHasSideEffects op || primOpOutOfLine op)
1883 primOpCanFail :: PrimOp -> Bool
1885 primOpCanFail IntQuotOp = True -- Divide by zero
1886 primOpCanFail IntRemOp = True -- Divide by zero
1889 primOpCanFail IntegerQuotRemOp = True -- Divide by zero
1890 primOpCanFail IntegerDivModOp = True -- Divide by zero
1892 -- Float. ToDo: tan? tanh?
1893 primOpCanFail FloatDivOp = True -- Divide by zero
1894 primOpCanFail FloatLogOp = True -- Log of zero
1895 primOpCanFail FloatAsinOp = True -- Arg out of domain
1896 primOpCanFail FloatAcosOp = True -- Arg out of domain
1898 -- Double. ToDo: tan? tanh?
1899 primOpCanFail DoubleDivOp = True -- Divide by zero
1900 primOpCanFail DoubleLogOp = True -- Log of zero
1901 primOpCanFail DoubleAsinOp = True -- Arg out of domain
1902 primOpCanFail DoubleAcosOp = True -- Arg out of domain
1904 primOpCanFail other_op = False
1907 And some primops have side-effects and so, for example, must not be
1911 primOpHasSideEffects :: PrimOp -> Bool
1913 primOpHasSideEffects TakeMVarOp = True
1914 primOpHasSideEffects DelayOp = True
1915 primOpHasSideEffects WaitReadOp = True
1916 primOpHasSideEffects WaitWriteOp = True
1918 primOpHasSideEffects ParOp = True
1919 primOpHasSideEffects ForkOp = True
1920 primOpHasSideEffects KillThreadOp = True
1921 primOpHasSideEffects SeqOp = True
1923 primOpHasSideEffects MakeForeignObjOp = True
1924 primOpHasSideEffects WriteForeignObjOp = True
1925 primOpHasSideEffects MkWeakOp = True
1926 primOpHasSideEffects DeRefWeakOp = True
1927 primOpHasSideEffects FinalizeWeakOp = True
1928 primOpHasSideEffects MakeStablePtrOp = True
1929 primOpHasSideEffects MakeStableNameOp = True
1930 primOpHasSideEffects EqStablePtrOp = True -- SOF
1931 primOpHasSideEffects DeRefStablePtrOp = True -- ??? JSM & ADR
1933 primOpHasSideEffects ParGlobalOp = True
1934 primOpHasSideEffects ParLocalOp = True
1935 primOpHasSideEffects ParAtOp = True
1936 primOpHasSideEffects ParAtAbsOp = True
1937 primOpHasSideEffects ParAtRelOp = True
1938 primOpHasSideEffects ParAtForNowOp = True
1939 primOpHasSideEffects CopyableOp = True -- Possibly not. ASP
1940 primOpHasSideEffects NoFollowOp = True -- Possibly not. ASP
1943 primOpHasSideEffects (CCallOp _ _ _ _) = True
1945 primOpHasSideEffects other = False
1948 Inline primitive operations that perform calls need wrappers to save
1949 any live variables that are stored in caller-saves registers.
1952 primOpNeedsWrapper :: PrimOp -> Bool
1954 primOpNeedsWrapper (CCallOp _ _ _ _) = True
1956 primOpNeedsWrapper Integer2IntOp = True
1957 primOpNeedsWrapper Integer2WordOp = True
1958 primOpNeedsWrapper IntegerCmpOp = True
1959 primOpNeedsWrapper IntegerCmpIntOp = True
1961 primOpNeedsWrapper FloatExpOp = True
1962 primOpNeedsWrapper FloatLogOp = True
1963 primOpNeedsWrapper FloatSqrtOp = True
1964 primOpNeedsWrapper FloatSinOp = True
1965 primOpNeedsWrapper FloatCosOp = True
1966 primOpNeedsWrapper FloatTanOp = True
1967 primOpNeedsWrapper FloatAsinOp = True
1968 primOpNeedsWrapper FloatAcosOp = True
1969 primOpNeedsWrapper FloatAtanOp = True
1970 primOpNeedsWrapper FloatSinhOp = True
1971 primOpNeedsWrapper FloatCoshOp = True
1972 primOpNeedsWrapper FloatTanhOp = True
1973 primOpNeedsWrapper FloatPowerOp = True
1974 primOpNeedsWrapper FloatEncodeOp = True
1976 primOpNeedsWrapper DoubleExpOp = True
1977 primOpNeedsWrapper DoubleLogOp = True
1978 primOpNeedsWrapper DoubleSqrtOp = True
1979 primOpNeedsWrapper DoubleSinOp = True
1980 primOpNeedsWrapper DoubleCosOp = True
1981 primOpNeedsWrapper DoubleTanOp = True
1982 primOpNeedsWrapper DoubleAsinOp = True
1983 primOpNeedsWrapper DoubleAcosOp = True
1984 primOpNeedsWrapper DoubleAtanOp = True
1985 primOpNeedsWrapper DoubleSinhOp = True
1986 primOpNeedsWrapper DoubleCoshOp = True
1987 primOpNeedsWrapper DoubleTanhOp = True
1988 primOpNeedsWrapper DoublePowerOp = True
1989 primOpNeedsWrapper DoubleEncodeOp = True
1991 primOpNeedsWrapper MakeStableNameOp = True
1992 primOpNeedsWrapper DeRefStablePtrOp = True
1994 primOpNeedsWrapper DelayOp = True
1995 primOpNeedsWrapper WaitReadOp = True
1996 primOpNeedsWrapper WaitWriteOp = True
1998 primOpNeedsWrapper other_op = False
2003 = case (primOpInfo op) of
2005 Monadic occ _ -> occ
2006 Compare occ _ -> occ
2007 GenPrimOp occ _ _ _ -> occ
2011 primOpUniq :: PrimOp -> Unique
2012 primOpUniq op = mkPrimOpIdUnique (IBOX(tagOf_PrimOp op))
2014 primOpType :: PrimOp -> Type
2016 = case (primOpInfo op) of
2017 Dyadic occ ty -> dyadic_fun_ty ty
2018 Monadic occ ty -> monadic_fun_ty ty
2019 Compare occ ty -> compare_fun_ty ty
2021 GenPrimOp occ tyvars arg_tys res_ty ->
2022 mkForAllTys tyvars (mkFunTys arg_tys res_ty)
2026 data PrimOpResultInfo
2027 = ReturnsPrim PrimRep
2030 -- Some PrimOps need not return a manifest primitive or algebraic value
2031 -- (i.e. they might return a polymorphic value). These PrimOps *must*
2032 -- be out of line, or the code generator won't work.
2034 getPrimOpResultInfo :: PrimOp -> PrimOpResultInfo
2036 getPrimOpResultInfo op
2037 = case (primOpInfo op) of
2038 Dyadic _ ty -> ReturnsPrim (typePrimRep ty)
2039 Monadic _ ty -> ReturnsPrim (typePrimRep ty)
2040 Compare _ ty -> ReturnsAlg boolTyCon
2041 GenPrimOp _ _ _ ty ->
2042 let rep = typePrimRep ty in
2044 PtrRep -> case splitAlgTyConApp_maybe ty of
2045 Nothing -> panic "getPrimOpResultInfo"
2046 Just (tc,_,_) -> ReturnsAlg tc
2047 other -> ReturnsPrim other
2049 isCompareOp :: PrimOp -> Bool
2052 = case primOpInfo op of
2057 The commutable ops are those for which we will try to move constants
2058 to the right hand side for strength reduction.
2061 commutableOp :: PrimOp -> Bool
2063 commutableOp CharEqOp = True
2064 commutableOp CharNeOp = True
2065 commutableOp IntAddOp = True
2066 commutableOp IntMulOp = True
2067 commutableOp AndOp = True
2068 commutableOp OrOp = True
2069 commutableOp XorOp = True
2070 commutableOp IntEqOp = True
2071 commutableOp IntNeOp = True
2072 commutableOp IntegerAddOp = True
2073 commutableOp IntegerMulOp = True
2074 commutableOp IntegerGcdOp = True
2075 commutableOp FloatAddOp = True
2076 commutableOp FloatMulOp = True
2077 commutableOp FloatEqOp = True
2078 commutableOp FloatNeOp = True
2079 commutableOp DoubleAddOp = True
2080 commutableOp DoubleMulOp = True
2081 commutableOp DoubleEqOp = True
2082 commutableOp DoubleNeOp = True
2083 commutableOp _ = False
2088 mkPrimTyApp :: [TyVar] -> PrimRep -> ([TyVar], Type)
2089 -- CharRep --> ([], Char#)
2090 -- StablePtrRep --> ([a], StablePtr# a)
2091 mkPrimTyApp tvs kind
2092 = (forall_tvs, mkTyConApp tycon (mkTyVarTys forall_tvs))
2094 tycon = primRepTyCon kind
2095 forall_tvs = take (tyConArity tycon) tvs
2097 dyadic_fun_ty ty = mkFunTys [ty, ty] ty
2098 monadic_fun_ty ty = mkFunTy ty ty
2099 compare_fun_ty ty = mkFunTys [ty, ty] boolTy
2104 pprPrimOp :: PrimOp -> SDoc
2106 pprPrimOp (CCallOp fun is_casm may_gc cconv)
2108 callconv = text "{-" <> pprCallConv cconv <> text "-}"
2111 | is_casm && may_gc = "casm_GC ``"
2112 | is_casm = "casm ``"
2113 | may_gc = "ccall_GC "
2114 | otherwise = "ccall "
2117 | is_casm = text "''"
2122 Right _ -> text "dyn_"
2127 Right _ -> text "\"\""
2131 hcat [ ifPprDebug callconv
2132 , text "__", ppr_dyn
2133 , text before , ppr_fun , after]
2136 = getPprStyle $ \ sty ->
2137 if ifaceStyle sty then -- For interfaces Print it qualified with PrelGHC.
2138 ptext SLIT("PrelGHC.") <> pprOccName occ
2142 occ = primOpOcc other_op