2 % (c) The AQUA Project, Glasgow University, 1997
4 \section[Word]{Module @Word@}
6 GHC implementation of the standard Hugs/GHC @Word@
7 interface, types and operations over unsigned, sized
14 ( Word8 -- all abstract.
15 , Word16 -- instances: Eq, Ord
16 , Word32 -- Num, Bounded, Real,
17 , Word64 -- Integral, Ix, Enum,
19 -- CCallable, CReturnable
20 -- (last two are GHC specific.)
22 , word8ToWord16 -- :: Word8 -> Word16
23 , word8ToWord32 -- :: Word8 -> Word32
24 , word8ToWord64 -- :: Word8 -> Word64
26 , word16ToWord8 -- :: Word16 -> Word32
27 , word16ToWord32 -- :: Word16 -> Word32
28 , word16ToWord64 -- :: Word8 -> Word64
30 , word32ToWord8 -- :: Word32 -> Word8
31 , word32ToWord16 -- :: Word32 -> Word16
32 , word32ToWord64 -- :: Word32 -> Word64
34 , word64ToWord8 -- :: Word64 -> Word8
35 , word64ToWord16 -- :: Word64 -> Word16
36 , word64ToWord32 -- :: Word64 -> Word32
38 , word8ToInt -- :: Word8 -> Int
39 , word16ToInt -- :: Word16 -> Int
40 , word32ToInt -- :: Word32 -> Int
41 , word64ToInt -- :: Word64 -> Int
43 , intToWord8 -- :: Int -> Word8
44 , intToWord16 -- :: Int -> Word16
45 , intToWord32 -- :: Int -> Word32
46 , intToWord64 -- :: Int -> Word64
48 , word8ToInteger -- :: Word8 -> Integer
49 , word16ToInteger -- :: Word16 -> Integer
50 , word32ToInteger -- :: Word32 -> Integer
51 , word64ToInteger -- :: Word64 -> Integer
53 , integerToWord8 -- :: Integer -> Word8
54 , integerToWord16 -- :: Integer -> Word16
55 , integerToWord32 -- :: Integer -> Word32
56 , integerToWord64 -- :: Integer -> Word64
59 , wordToWord8 -- :: Word -> Word8
60 , wordToWord16 -- :: Word -> Word16
61 , wordToWord32 -- :: Word -> Word32
62 , wordToWord64 -- :: Word -> Word64
64 , word8ToWord -- :: Word8 -> Word
65 , word16ToWord -- :: Word16 -> Word
66 , word32ToWord -- :: Word32 -> Word
67 , word64ToWord -- :: Word64 -> Word
69 -- The "official" place to get these from is Addr.
90 -- The "official" place to get these from is Foreign
91 #ifndef __PARALLEL_HASKELL__
92 , indexWord8OffForeignObj
93 , indexWord16OffForeignObj
94 , indexWord32OffForeignObj
95 , indexWord64OffForeignObj
97 , readWord8OffForeignObj
98 , readWord16OffForeignObj
99 , readWord32OffForeignObj
100 , readWord64OffForeignObj
102 , writeWord8OffForeignObj
103 , writeWord16OffForeignObj
104 , writeWord32OffForeignObj
105 , writeWord64OffForeignObj
108 -- non-standard, GHC specific
111 -- Internal, do not use.
119 import PreludeBuiltin
128 import PrelNum ( Num(..), Integral(..) ) -- To get fromInt/toInt
131 import Numeric (readDec, showInt)
133 -----------------------------------------------------------------------------
134 -- The "official" coercion functions
135 -----------------------------------------------------------------------------
137 word8ToWord32 :: Word8 -> Word32
138 word16ToWord32 :: Word16 -> Word32
139 word32ToWord8 :: Word32 -> Word8
140 word32ToWord16 :: Word32 -> Word16
142 word8ToInt :: Word8 -> Int
143 word16ToInt :: Word16 -> Int
144 intToWord8 :: Int -> Word8
145 intToWord16 :: Int -> Word16
147 integerToWord8 :: Integer -> Word8
148 integerToWord16 :: Integer -> Word16
150 word8ToInt = word32ToInt . word8ToWord32
151 intToWord8 = word32ToWord8 . intToWord32
152 word16ToInt = word32ToInt . word16ToWord32
153 intToWord16 = word32ToWord16 . intToWord32
154 word8ToInteger = word32ToInteger . word8ToWord32
155 word16ToInteger = word32ToInteger . word16ToWord32
156 integerToWord8 = fromInteger
157 integerToWord16 = fromInteger
159 intToWord32 :: Int -> Word32
160 intToWord32 (I# x) = W32# ((int2Word# x) `and#` (case (maxBound::Word32) of W32# x# -> x#))
161 --intToWord32 (I# x) = W32# (int2Word# x)
163 word32ToInt :: Word32 -> Int
164 word32ToInt (W32# x) = I# (word2Int# x)
166 word32ToInteger :: Word32 -> Integer
167 word32ToInteger (W32# x) = word2Integer x
169 integerToWord32 :: Integer -> Word32
170 integerToWord32 = fromInteger
174 \subsection[Word8]{The @Word8@ interface}
176 The byte type @Word8@ is represented in the Haskell
177 heap by boxing up a 32-bit quantity, @Word#@. An invariant
178 for this representation is that the higher 24 bits are
179 *always* zeroed out. A consequence of this is that
180 operations that could possibly overflow have to mask
181 out the top three bytes before building the resulting @Word8@.
184 data Word8 = W8# Word#
186 instance CCallable Word8
187 instance CReturnable Word8
189 word8ToWord32 (W8# x) = W32# x
190 word8ToWord16 (W8# x) = W16# x
191 word32ToWord8 (W32# x) = W8# (wordToWord8# x)
193 -- mask out upper three bytes.
194 intToWord8# :: Int# -> Word#
195 intToWord8# i# = (int2Word# i#) `and#` (int2Word# 0xff#)
197 wordToWord8# :: Word# -> Word#
198 wordToWord8# w# = w# `and#` (int2Word# 0xff#)
200 instance Eq Word8 where
201 (W8# x) == (W8# y) = x `eqWord#` y
202 (W8# x) /= (W8# y) = x `neWord#` y
204 instance Ord Word8 where
205 compare (W8# x#) (W8# y#) = compareWord# x# y#
206 (<) (W8# x) (W8# y) = x `ltWord#` y
207 (<=) (W8# x) (W8# y) = x `leWord#` y
208 (>=) (W8# x) (W8# y) = x `geWord#` y
209 (>) (W8# x) (W8# y) = x `gtWord#` y
210 max x@(W8# x#) y@(W8# y#) =
211 case (compareWord# x# y#) of { LT -> y ; EQ -> x ; GT -> x }
212 min x@(W8# x#) y@(W8# y#) =
213 case (compareWord# x# y#) of { LT -> x ; EQ -> x ; GT -> y }
215 -- Helper function, used by Ord Word* instances.
216 compareWord# :: Word# -> Word# -> Ordering
218 | x# `ltWord#` y# = LT
219 | x# `eqWord#` y# = EQ
222 instance Num Word8 where
224 W8# (intToWord8# (word2Int# x +# word2Int# y))
226 W8# (intToWord8# (word2Int# x -# word2Int# y))
228 W8# (intToWord8# (word2Int# x *# word2Int# y))
232 else W8# (int2Word# (0x100# -# x'))
237 fromInteger (S# i#) = W8# (wordToWord8# (int2Word# i#))
238 fromInteger (J# s# d#) = W8# (wordToWord8# (integer2Word# s# d#))
241 instance Bounded Word8 where
245 instance Real Word8 where
246 toRational x = toInteger x % 1
248 -- Note: no need to mask results here
249 -- as they cannot overflow.
250 instance Integral Word8 where
251 div x@(W8# x#) (W8# y#)
252 | y# `neWord#` (int2Word# 0#) = W8# (x# `quotWord#` y#)
253 | otherwise = divZeroError "div{Word8}" x
255 quot x@(W8# x#) (W8# y#)
256 | y# `neWord#` (int2Word# 0#) = W8# (x# `quotWord#` y#)
257 | otherwise = divZeroError "quot{Word8}" x
259 rem x@(W8# x#) (W8# y#)
260 | y# `neWord#` (int2Word# 0#) = W8# (x# `remWord#` y#)
261 | otherwise = divZeroError "rem{Word8}" x
263 mod x@(W8# x#) (W8# y#)
264 | y# `neWord#` (int2Word# 0#) = W8# (x# `remWord#` y#)
265 | otherwise = divZeroError "mod{Word8}" x
267 quotRem (W8# x) (W8# y) = (W8# (x `quotWord#` y), W8# (x `remWord#` y))
268 divMod (W8# x) (W8# y) = (W8# (x `quotWord#` y), W8# (x `remWord#` y))
270 toInteger (W8# x) = word2Integer x
271 toInt x = word8ToInt x
273 instance Ix Word8 where
276 | inRange b i = word8ToInt (i-m)
277 | otherwise = indexError i b "Word8"
278 inRange (m,n) i = m <= i && i <= n
280 instance Enum Word8 where
282 | w == maxBound = succError "Word8"
285 | w == minBound = predError "Word8"
289 | i >= toInt (minBound::Word8) && i <= toInt (maxBound::Word8)
290 = W8# (intToWord8# i#)
292 = toEnumError "Word8" i (minBound::Word8,maxBound::Word8)
294 fromEnum (W8# w) = I# (word2Int# w)
295 enumFrom c = map toEnum [fromEnum c .. fromEnum (maxBound::Word8)]
296 enumFromThen c d = map toEnum [fromEnum c, fromEnum d .. fromEnum last]
301 | otherwise = maxBound
303 instance Read Word8 where
304 readsPrec _ = readDec
306 instance Show Word8 where
307 showsPrec _ = showInt
310 -- Word8s are represented by an (unboxed) 32-bit Word.
311 -- The invariant is that the upper 24 bits are always zeroed out.
313 instance Bits Word8 where
314 (W8# x) .&. (W8# y) = W8# (x `and#` y)
315 (W8# x) .|. (W8# y) = W8# (x `or#` y)
316 (W8# x) `xor` (W8# y) = W8# (x `xor#` y)
317 complement (W8# x) = W8# (x `xor#` int2Word# 0xff#)
318 shift (W8# x#) i@(I# i#)
319 | i > 0 = W8# (wordToWord8# (shiftL# x# i#))
320 | otherwise = W8# (wordToWord8# (shiftRL# x# (negateInt# i#)))
321 w@(W8# x) `rotate` (I# i)
323 | i ># 0# = W8# ((wordToWord8# (shiftL# x i')) `or#`
325 (int2Word# (0x100# -# pow2# i2)))
327 | otherwise = rotate w (I# (8# +# i))
329 i' = word2Int# (int2Word# i `and#` int2Word# 7#)
333 | i# >=# 0# && i# <=# 7# = W8# (wordToWord8# (shiftL# (int2Word# 1#) i#))
334 | otherwise = 0 -- We'll be overbearing, for now..
336 setBit x i = x .|. bit i
337 clearBit x i = x .&. complement (bit i)
338 complementBit x i = x `xor` bit i
340 testBit (W8# x#) (I# i#)
341 | i# <# 8# && i# >=# 0# = (word2Int# (x# `and#` (shiftL# (int2Word# 1#) i#))) /=# 0#
342 | otherwise = False -- for now, this is really an error.
347 pow2# :: Int# -> Int#
348 pow2# x# = word2Int# (shiftL# (int2Word# 1#) x#)
350 word2Integer :: Word# -> Integer
351 word2Integer w = case word2Integer# w of
354 pow2_64# :: Int# -> Int64#
355 pow2_64# x# = word64ToInt64# (shiftL64# (wordToWord64# (int2Word# 1#)) x#)
357 sizeofWord8 :: Word32
362 \subsection[Word16]{The @Word16@ interface}
364 The double byte type @Word16@ is represented in the Haskell
365 heap by boxing up a machine word, @Word#@. An invariant
366 for this representation is that only the lower 16 bits are
367 `active', any bits above are {\em always} zeroed out.
368 A consequence of this is that operations that could possibly
369 overflow have to mask out anything above the lower two bytes
370 before putting together the resulting @Word16@.
373 data Word16 = W16# Word#
374 instance CCallable Word16
375 instance CReturnable Word16
377 word16ToWord32 (W16# x) = W32# x
378 word16ToWord8 (W16# x) = W8# (wordToWord8# x)
379 word32ToWord16 (W32# x) = W16# (wordToWord16# x)
381 -- mask out upper 16 bits.
382 intToWord16# :: Int# -> Word#
383 intToWord16# i# = ((int2Word# i#) `and#` (int2Word# 0xffff#))
385 wordToWord16# :: Word# -> Word#
386 wordToWord16# w# = w# `and#` (int2Word# 0xffff#)
388 instance Eq Word16 where
389 (W16# x) == (W16# y) = x `eqWord#` y
390 (W16# x) /= (W16# y) = x `neWord#` y
392 instance Ord Word16 where
393 compare (W16# x#) (W16# y#) = compareWord# x# y#
394 (<) (W16# x) (W16# y) = x `ltWord#` y
395 (<=) (W16# x) (W16# y) = x `leWord#` y
396 (>=) (W16# x) (W16# y) = x `geWord#` y
397 (>) (W16# x) (W16# y) = x `gtWord#` y
398 max x@(W16# x#) y@(W16# y#) =
399 case (compareWord# x# y#) of { LT -> y ; EQ -> x ; GT -> x }
400 min x@(W16# x#) y@(W16# y#) =
401 case (compareWord# x# y#) of { LT -> x ; EQ -> x ; GT -> y }
403 instance Num Word16 where
404 (W16# x) + (W16# y) =
405 W16# (intToWord16# (word2Int# x +# word2Int# y))
406 (W16# x) - (W16# y) =
407 W16# (intToWord16# (word2Int# x -# word2Int# y))
408 (W16# x) * (W16# y) =
409 W16# (intToWord16# (word2Int# x *# word2Int# y))
413 else W16# (int2Word# (0x10000# -# x'))
418 fromInteger (S# i#) = W16# (wordToWord16# (int2Word# i#))
419 fromInteger (J# s# d#) = W16# (wordToWord16# (integer2Word# s# d#))
420 fromInt = intToWord16
422 instance Bounded Word16 where
426 instance Real Word16 where
427 toRational x = toInteger x % 1
429 instance Integral Word16 where
430 div x@(W16# x#) (W16# y#)
431 | y# `neWord#` (int2Word# 0#) = W16# (x# `quotWord#` y#)
432 | otherwise = divZeroError "div{Word16}" x
434 quot x@(W16# x#) (W16# y#)
435 | y# `neWord#`(int2Word# 0#) = W16# (x# `quotWord#` y#)
436 | otherwise = divZeroError "quot{Word16}" x
438 rem x@(W16# x#) (W16# y#)
439 | y# `neWord#` (int2Word# 0#) = W16# (x# `remWord#` y#)
440 | otherwise = divZeroError "rem{Word16}" x
442 mod x@(W16# x#) (W16# y#)
443 | y# `neWord#` (int2Word# 0#) = W16# (x# `remWord#` y#)
444 | otherwise = divZeroError "mod{Word16}" x
446 quotRem (W16# x) (W16# y) = (W16# (x `quotWord#` y), W16# (x `remWord#` y))
447 divMod (W16# x) (W16# y) = (W16# (x `quotWord#` y), W16# (x `remWord#` y))
449 toInteger (W16# x) = word2Integer x
450 toInt x = word16ToInt x
452 instance Ix Word16 where
455 | inRange b i = word16ToInt (i - m)
456 | otherwise = indexError i b "Word16"
457 inRange (m,n) i = m <= i && i <= n
459 instance Enum Word16 where
461 | w == maxBound = succError "Word16"
464 | w == minBound = predError "Word16"
468 | i >= toInt (minBound::Word16) && i <= toInt (maxBound::Word16)
469 = W16# (intToWord16# i#)
471 = toEnumError "Word16" i (minBound::Word16,maxBound::Word16)
473 fromEnum (W16# w) = I# (word2Int# w)
474 enumFrom c = map toEnum [fromEnum c .. fromEnum (maxBound::Word16)]
475 enumFromThen c d = map toEnum [fromEnum c, fromEnum d .. fromEnum last]
480 | otherwise = maxBound
482 instance Read Word16 where
483 readsPrec _ = readDec
485 instance Show Word16 where
486 showsPrec _ = showInt
488 instance Bits Word16 where
489 (W16# x) .&. (W16# y) = W16# (x `and#` y)
490 (W16# x) .|. (W16# y) = W16# (x `or#` y)
491 (W16# x) `xor` (W16# y) = W16# (x `xor#` y)
492 complement (W16# x) = W16# (x `xor#` int2Word# 0xffff#)
493 shift (W16# x#) i@(I# i#)
494 | i > 0 = W16# (wordToWord16# (shiftL# x# i#))
495 | otherwise = W16# (shiftRL# x# (negateInt# i#))
496 w@(W16# x) `rotate` (I# i)
498 | i ># 0# = W16# ((wordToWord16# (shiftL# x i')) `or#`
500 (int2Word# (0x10000# -# pow2# i2)))
502 | otherwise = rotate w (I# (16# +# i'))
504 i' = word2Int# (int2Word# i `and#` int2Word# 15#)
507 | i# >=# 0# && i# <=# 15# = W16# (shiftL# (int2Word# 1#) i#)
508 | otherwise = 0 -- We'll be overbearing, for now..
510 setBit x i = x .|. bit i
511 clearBit x i = x .&. complement (bit i)
512 complementBit x i = x `xor` bit i
514 testBit (W16# x#) (I# i#)
515 | i# <# 16# && i# >=# 0# = (word2Int# (x# `and#` (shiftL# (int2Word# 1#) i#))) /=# 0#
516 | otherwise = False -- for now, this is really an error.
522 sizeofWord16 :: Word32
527 \subsection[Word32]{The @Word32@ interface}
529 The quad byte type @Word32@ is represented in the Haskell
530 heap by boxing up a machine word, @Word#@. An invariant
531 for this representation is that any bits above the lower
532 32 are {\em always} zeroed out. A consequence of this is that
533 operations that could possibly overflow have to mask
534 the result before building the resulting @Word16@.
537 data Word32 = W32# Word#
539 instance CCallable Word32
540 instance CReturnable Word32
542 instance Eq Word32 where
543 (W32# x) == (W32# y) = x `eqWord#` y
544 (W32# x) /= (W32# y) = x `neWord#` y
546 instance Ord Word32 where
547 compare (W32# x#) (W32# y#) = compareWord# x# y#
548 (<) (W32# x) (W32# y) = x `ltWord#` y
549 (<=) (W32# x) (W32# y) = x `leWord#` y
550 (>=) (W32# x) (W32# y) = x `geWord#` y
551 (>) (W32# x) (W32# y) = x `gtWord#` y
552 max x@(W32# x#) y@(W32# y#) =
553 case (compareWord# x# y#) of { LT -> y ; EQ -> x ; GT -> x }
554 min x@(W32# x#) y@(W32# y#) =
555 case (compareWord# x# y#) of { LT -> x ; EQ -> x ; GT -> y }
557 instance Num Word32 where
558 (W32# x) + (W32# y) =
559 W32# (intToWord32# (word2Int# x +# word2Int# y))
560 (W32# x) - (W32# y) =
561 W32# (intToWord32# (word2Int# x -# word2Int# y))
562 (W32# x) * (W32# y) =
563 W32# (intToWord32# (word2Int# x *# word2Int# y))
564 #if WORD_SIZE_IN_BYTES == 8
568 else W32# (intToWord32# (0x100000000# -# x'))
572 negate (W32# x) = W32# (intToWord32# (negateInt# (word2Int# x)))
576 fromInteger (S# i#) = W32# (intToWord32# i#)
577 fromInteger (J# s# d#) = W32# (wordToWord32# (integer2Word# s# d#))
578 fromInt (I# x) = W32# (intToWord32# x)
579 -- ToDo: restrict fromInt{eger} range.
581 intToWord32# :: Int# -> Word#
582 wordToWord32# :: Word# -> Word#
584 #if WORD_SIZE_IN_BYTES == 8
585 intToWord32# i# = (int2Word# i#) `and#` (int2Word# 0xffffffff#)
586 wordToWord32# w# = w# `and#` (int2Word# 0xffffffff#)
587 wordToWord64# w# = w#
589 intToWord32# i# = int2Word# i#
590 wordToWord32# w# = w#
594 instance Bounded Word32 where
596 #if WORD_SIZE_IN_BYTES == 8
597 maxBound = 0xffffffff
599 maxBound = minBound - 1
602 instance Real Word32 where
603 toRational x = toInteger x % 1
605 instance Integral Word32 where
607 | y /= 0 = quotWord32 x y
608 | otherwise = divZeroError "div{Word32}" x
611 | y /= 0 = quotWord32 x y
612 | otherwise = divZeroError "quot{Word32}" x
615 | y /= 0 = remWord32 x y
616 | otherwise = divZeroError "rem{Word32}" x
619 | y /= 0 = remWord32 x y
620 | otherwise = divZeroError "mod{Word32}" x
622 quotRem a b = (a `quotWord32` b, a `remWord32` b)
623 divMod x y = quotRem x y
625 toInteger (W32# x) = word2Integer x
626 toInt (W32# x) = I# (word2Int# x)
628 {-# INLINE quotWord32 #-}
629 {-# INLINE remWord32 #-}
630 remWord32, quotWord32 :: Word32 -> Word32 -> Word32
631 (W32# x) `quotWord32` (W32# y) = W32# (x `quotWord#` y)
632 (W32# x) `remWord32` (W32# y) = W32# (x `remWord#` y)
634 instance Ix Word32 where
637 | inRange b i = word32ToInt (i - m)
638 | otherwise = indexError i b "Word32"
639 inRange (m,n) i = m <= i && i <= n
641 instance Enum Word32 where
643 | w == maxBound = succError "Word32"
646 | w == minBound = predError "Word32"
649 -- the toEnum/fromEnum will fail if the mapping isn't legal,
650 -- use the intTo* & *ToInt coercion functions to 'bypass' these range checks.
652 | x >= 0 = intToWord32 x
654 = toEnumError "Word32" x (minBound::Word32,maxBound::Word32)
657 | x <= intToWord32 (maxBound::Int)
660 = fromEnumError "Word32" x
662 enumFrom w = [w .. maxBound]
664 | w1 <= w2 = eftt32 True{-increasing-} w1 diff_f last
670 enumFromThen w1 w2 = [w1,w2 .. last]
675 | otherwise = minBound
677 enumFromThenTo w1 w2 wend = eftt32 increasing w1 step_f last
679 increasing = w1 <= w2
684 | increasing = (> wend)
685 | otherwise = (< wend)
688 | increasing = \ x -> x + diff1
689 | otherwise = \ x -> x - diff2
692 eftt32 :: Bool -> Word32 -> (Word32 -> Word32) -> (Word32-> Bool) -> [Word32]
693 eftt32 increasing init stepper done = go init
697 | increasing && now > nxt = [now] -- oflow
698 | not increasing && now < nxt = [now] -- uflow
699 | otherwise = now : go nxt
704 instance Read Word32 where
705 readsPrec _ = readDec
707 instance Show Word32 where
708 showsPrec _ = showInt
710 instance Bits Word32 where
711 (W32# x) .&. (W32# y) = W32# (x `and#` y)
712 (W32# x) .|. (W32# y) = W32# (x `or#` y)
713 (W32# x) `xor` (W32# y) = W32# (x `xor#` y)
714 complement (W32# x) = W32# (x `xor#` mb#) where (W32# mb#) = maxBound
715 shift (W32# x) i@(I# i#)
716 | i > 0 = W32# (wordToWord32# (shiftL# x i#))
717 | otherwise = W32# (shiftRL# x (negateInt# i#))
718 w@(W32# x) `rotate` (I# i)
720 | i ># 0# = W32# ((wordToWord32# (shiftL# x i')) `or#`
722 (int2Word# (word2Int# maxBound# -# pow2# i2 +# 1#)))
724 | otherwise = rotate w (I# (32# +# i))
726 i' = word2Int# (int2Word# i `and#` int2Word# 31#)
728 (W32# maxBound#) = maxBound
731 | i# >=# 0# && i# <=# 31# = W32# (shiftL# (int2Word# 1#) i#)
732 | otherwise = 0 -- We'll be overbearing, for now..
734 setBit x i = x .|. bit i
735 clearBit x i = x .&. complement (bit i)
736 complementBit x i = x `xor` bit i
738 testBit (W32# x#) (I# i#)
739 | i# <# 32# && i# >=# 0# = (word2Int# (x# `and#` (shiftL# (int2Word# 1#) i#))) /=# 0#
740 | otherwise = False -- for now, this is really an error.
744 sizeofWord32 :: Word32
748 \subsection[Word64]{The @Word64@ interface}
751 #if WORD_SIZE_IN_BYTES == 8
752 --data Word64 = W64# Word#
754 word32ToWord64 :: Word32 -> Word64
755 word32ToWord64 (W32 w#) = W64# w#
757 word8ToWord64 :: Word8 -> Word64
758 word8ToWord64 (W8# w#) = W64# w#
760 word64ToWord8 :: Word64 -> Word8
761 word64ToWord8 (W64# w#) = W8# (w# `and#` (int2Word# 0xff#))
763 word16ToWord64 :: Word16 -> Word64
764 word16ToWord64 (W16# w#) = W64# w#
766 word64ToWord16 :: Word64 -> Word16
767 word64ToWord16 (W64# w#) = W16# (w# `and#` (int2Word# 0xffff#))
769 wordToWord32# :: Word# -> Word#
770 wordToWord32# w# = w# `and#` (case (maxBound::Word32) of W# x# -> x#)
772 word64ToWord32 :: Word64 -> Word32
773 word64ToWord32 (W64# w#) = W32# (wordToWord32# w#)
775 wordToWord64# w# = w#
776 word64ToWord# w# = w#
778 instance Eq Word64 where
779 (W64# x) == (W64# y) = x `eqWord#` y
780 (W64# x) /= (W64# y) = x `neWord#` y
782 instance Ord Word64 where
783 compare (W64# x#) (W64# y#) = compareWord# x# y#
784 (<) (W64# x) (W64# y) = x `ltWord#` y
785 (<=) (W64# x) (W64# y) = x `leWord#` y
786 (>=) (W64# x) (W64# y) = x `geWord#` y
787 (>) (W64# x) (W64# y) = x `gtWord#` y
788 max x@(W64# x#) y@(W64# y#) =
789 case (compareWord# x# y#) of { LT -> y ; EQ -> x ; GT -> x }
790 min x@(W64# x#) y@(W64# y#) =
791 case (compareWord# x# y#) of { LT -> x ; EQ -> x ; GT -> y }
793 instance Num Word64 where
794 (W64# x) + (W64# y) =
795 W64# (intToWord64# (word2Int# x +# word2Int# y))
796 (W64# x) - (W64# y) =
797 W64# (intToWord64# (word2Int# x -# word2Int# y))
798 (W64# x) * (W64# y) =
799 W64# (intToWord64# (word2Int# x *# word2Int# y))
803 else W64# (int2Word# (0x100# -# x'))
808 fromInteger (S# i#) = W64# (int2Word# i#)
809 fromInteger (J# s# d#) = W64# (integer2Word# s# d#)
810 fromInt = intToWord64
812 -- Note: no need to mask results here
813 -- as they cannot overflow.
814 instance Integral Word64 where
815 div x@(W64# x#) (W64# y#)
816 | y# `neWord#` (int2Word# 0#) = W64# (x# `quotWord#` y#)
817 | otherwise = divZeroError "div{Word64}" x
819 quot x@(W64# x#) (W64# y#)
820 | y# `neWord#` (int2Word# 0#) = W64# (x# `quotWord#` y#)
821 | otherwise = divZeroError "quot{Word64}" x
823 rem x@(W64# x#) (W64# y#)
824 | y# `neWord#` (int2Word# 0#) = W64# (x# `remWord#` y#)
825 | otherwise = divZeroError "rem{Word64}" x
827 mod (W64# x) (W64# y)
828 | y# `neWord#` (int2Word# 0#) = W64# (x `remWord#` y)
829 | otherwise = divZeroError "mod{Word64}" x
831 quotRem (W64# x) (W64# y) = (W64# (x `quotWord#` y), W64# (x `remWord#` y))
832 divMod (W64# x) (W64# y) = (W64# (x `quotWord#` y), W64# (x `remWord#` y))
834 toInteger (W64# x) = word2Integer# x
835 toInt x = word64ToInt x
838 instance Bits Word64 where
839 (W64# x) .&. (W64# y) = W64# (x `and#` y)
840 (W64# x) .|. (W64# y) = W64# (x `or#` y)
841 (W64# x) `xor` (W64# y) = W64# (x `xor#` y)
842 complement (W64# x) = W64# (x `xor#` (case (maxBound::Word64) of W64# x# -> x#))
843 shift (W64# x#) i@(I# i#)
844 | i > 0 = W64# (shiftL# x# i#)
845 | otherwise = W64# (shiftRL# x# (negateInt# i#))
847 w@(W64# x) `rotate` (I# i)
849 | i ># 0# = W64# (shiftL# x i') `or#`
851 (int2Word# (word2Int# maxBound# -# pow2# i2 +# 1#)))
853 | otherwise = rotate w (I# (64# +# i))
855 i' = word2Int# (int2Word# i `and#` int2Word# 63#)
857 (W64# maxBound#) = maxBound
860 | i# >=# 0# && i# <=# 63# = W64# (shiftL# (int2Word# 1#) i#)
861 | otherwise = 0 -- We'll be overbearing, for now..
863 setBit x i = x .|. bit i
864 clearBit x i = x .&. complement (bit i)
865 complementBit x i = x `xor` bit i
867 testBit (W64# x#) (I# i#)
868 | i# <# 64# && i# >=# 0# = (word2Int# (x# `and#` (shiftL# (int2Word# 1#) i#))) /=# 0#
869 | otherwise = False -- for now, this is really an error.
875 --defined in PrelCCall: data Word64 = W64 Word64# deriving (Eq, Ord, Bounded)
877 -- for completeness sake
878 word32ToWord64 :: Word32 -> Word64
879 word32ToWord64 (W32# w#) = W64# (wordToWord64# w#)
881 word64ToWord32 :: Word64 -> Word32
882 word64ToWord32 (W64# w#) = W32# (word64ToWord# w#)
884 word8ToWord64 :: Word8 -> Word64
885 word8ToWord64 (W8# w#) = W64# (wordToWord64# w#)
887 word64ToWord8 :: Word64 -> Word8
888 word64ToWord8 (W64# w#) = W8# ((word64ToWord# w#) `and#` (int2Word# 0xff#))
890 word16ToWord64 :: Word16 -> Word64
891 word16ToWord64 (W16# w#) = W64# (wordToWord64# w#)
893 word64ToWord16 :: Word64 -> Word16
894 word64ToWord16 (W64# w#) = W16# ((word64ToWord# w#) `and#` (int2Word# 0xffff#))
897 word64ToInteger :: Word64 -> Integer
898 word64ToInteger (W64# w#) =
899 case word64ToInteger# w# of
900 (# s#, p# #) -> J# s# p#
902 word64ToInt :: Word64 -> Int
904 case w `quotRem` 0x100000000 of
905 (_,l) -> toInt (word64ToWord32 l)
907 intToWord64# :: Int# -> Word64#
908 intToWord64# i# = wordToWord64# (int2Word# i#)
910 intToWord64 :: Int -> Word64
911 intToWord64 (I# i#) = W64# (intToWord64# i#)
913 integerToWord64 :: Integer -> Word64
914 integerToWord64 (J# s# d#) = W64# (integerToWord64# s# d#)
916 instance Eq Word64 where
917 (W64# x) == (W64# y) = x `eqWord64#` y
918 (W64# x) /= (W64# y) = not (x `eqWord64#` y)
920 instance Ord Word64 where
921 compare (W64# x#) (W64# y#) = compareWord64# x# y#
922 (<) (W64# x) (W64# y) = x `ltWord64#` y
923 (<=) (W64# x) (W64# y) = x `leWord64#` y
924 (>=) (W64# x) (W64# y) = x `geWord64#` y
925 (>) (W64# x) (W64# y) = x `gtWord64#` y
926 max x@(W64# x#) y@(W64# y#) =
927 case (compareWord64# x# y#) of { LT -> y ; EQ -> x ; GT -> x }
928 min x@(W64# x#) y@(W64# y#) =
929 case (compareWord64# x# y#) of { LT -> x ; EQ -> x ; GT -> y }
931 instance Num Word64 where
932 (W64# x) + (W64# y) =
933 W64# (int64ToWord64# (word64ToInt64# x `plusInt64#` word64ToInt64# y))
934 (W64# x) - (W64# y) =
935 W64# (int64ToWord64# (word64ToInt64# x `minusInt64#` word64ToInt64# y))
936 (W64# x) * (W64# y) =
937 W64# (int64ToWord64# (word64ToInt64# x `timesInt64#` word64ToInt64# y))
940 | otherwise = maxBound - w
944 fromInteger i = integerToWord64 i
945 fromInt = intToWord64
947 -- Note: no need to mask results here
948 -- as they cannot overflow.
949 -- ToDo: protect against div by zero.
950 instance Integral Word64 where
951 div (W64# x) (W64# y) = W64# (x `quotWord64#` y)
952 quot (W64# x) (W64# y) = W64# (x `quotWord64#` y)
953 rem (W64# x) (W64# y) = W64# (x `remWord64#` y)
954 mod (W64# x) (W64# y) = W64# (x `remWord64#` y)
955 quotRem (W64# x) (W64# y) = (W64# (x `quotWord64#` y), W64# (x `remWord64#` y))
956 divMod (W64# x) (W64# y) = (W64# (x `quotWord64#` y), W64# (x `remWord64#` y))
957 toInteger w64 = word64ToInteger w64
958 toInt x = word64ToInt x
961 instance Bits Word64 where
962 (W64# x) .&. (W64# y) = W64# (x `and64#` y)
963 (W64# x) .|. (W64# y) = W64# (x `or64#` y)
964 (W64# x) `xor` (W64# y) = W64# (x `xor64#` y)
965 complement (W64# x) = W64# (x `xor64#` (case (maxBound::Word64) of W64# x# -> x#))
966 shift (W64# x#) i@(I# i#)
967 | i > 0 = W64# (shiftL64# x# i#)
968 | otherwise = W64# (shiftRL64# x# (negateInt# i#))
970 w@(W64# x) `rotate` (I# i)
972 | i ># 0# = W64# ((shiftL64# x i') `or64#`
973 (shiftRL64# (x `and64#`
974 (int64ToWord64# ((word64ToInt64# maxBound#) `minusInt64#`
975 (pow2_64# i2 `plusInt64#` (intToInt64# 1#))))))
977 | otherwise = rotate w (I# (64# +# i))
979 i' = word2Int# (int2Word# i `and#` int2Word# 63#)
981 (W64# maxBound#) = maxBound
984 | i# >=# 0# && i# <=# 63# = W64# (shiftL64# (wordToWord64# (int2Word# 1#)) i#)
985 | otherwise = 0 -- We'll be overbearing, for now..
987 setBit x i = x .|. bit i
988 clearBit x i = x .&. complement (bit i)
989 complementBit x i = x `xor` bit i
991 testBit (W64# x#) (I# i#)
992 | i# <# 64# && i# >=# 0# = (word2Int# (word64ToWord# (x# `and64#` (shiftL64# (wordToWord64# (int2Word# 1#)) i#)))) /=# 0#
993 | otherwise = False -- for now, this is really an error.
998 compareWord64# :: Word64# -> Word64# -> Ordering
1000 | i# `ltWord64#` j# = LT
1001 | i# `eqWord64#` j# = EQ
1004 -- Word64# primop wrappers:
1006 ltWord64# :: Word64# -> Word64# -> Bool
1007 ltWord64# x# y# = unsafePerformIO $ do
1008 v <- _ccall_ stg_ltWord64 x# y#
1013 leWord64# :: Word64# -> Word64# -> Bool
1014 leWord64# x# y# = unsafePerformIO $ do
1015 v <- _ccall_ stg_leWord64 x# y#
1020 eqWord64# :: Word64# -> Word64# -> Bool
1021 eqWord64# x# y# = unsafePerformIO $ do
1022 v <- _ccall_ stg_eqWord64 x# y#
1027 neWord64# :: Word64# -> Word64# -> Bool
1028 neWord64# x# y# = unsafePerformIO $ do
1029 v <- _ccall_ stg_neWord64 x# y#
1034 geWord64# :: Word64# -> Word64# -> Bool
1035 geWord64# x# y# = unsafePerformIO $ do
1036 v <- _ccall_ stg_geWord64 x# y#
1041 gtWord64# :: Word64# -> Word64# -> Bool
1042 gtWord64# x# y# = unsafePerformIO $ do
1043 v <- _ccall_ stg_gtWord64 x# y#
1048 plusInt64# :: Int64# -> Int64# -> Int64#
1050 case (unsafePerformIO (_ccall_ stg_plusInt64 a# b#)) of
1053 minusInt64# :: Int64# -> Int64# -> Int64#
1055 case (unsafePerformIO (_ccall_ stg_minusInt64 a# b#)) of
1058 timesInt64# :: Int64# -> Int64# -> Int64#
1060 case (unsafePerformIO (_ccall_ stg_timesInt64 a# b#)) of
1063 quotWord64# :: Word64# -> Word64# -> Word64#
1065 case (unsafePerformIO (_ccall_ stg_quotWord64 a# b#)) of
1068 remWord64# :: Word64# -> Word64# -> Word64#
1070 case (unsafePerformIO (_ccall_ stg_remWord64 a# b#)) of
1073 negateInt64# :: Int64# -> Int64#
1075 case (unsafePerformIO (_ccall_ stg_negateInt64 a#)) of
1078 and64# :: Word64# -> Word64# -> Word64#
1080 case (unsafePerformIO (_ccall_ stg_and64 a# b#)) of
1083 or64# :: Word64# -> Word64# -> Word64#
1085 case (unsafePerformIO (_ccall_ stg_or64 a# b#)) of
1088 xor64# :: Word64# -> Word64# -> Word64#
1090 case (unsafePerformIO (_ccall_ stg_xor64 a# b#)) of
1093 not64# :: Word64# -> Word64#
1095 case (unsafePerformIO (_ccall_ stg_not64 a#)) of
1098 shiftL64# :: Word64# -> Int# -> Word64#
1100 case (unsafePerformIO (_ccall_ stg_shiftL64 a# b#)) of
1103 shiftRL64# :: Word64# -> Int# -> Word64#
1105 case (unsafePerformIO (_ccall_ stg_shiftRL64 a# b#)) of
1108 word64ToWord# :: Word64# -> Word#
1109 word64ToWord# w64# =
1110 case (unsafePerformIO (_ccall_ stg_word64ToWord w64#)) of
1113 wordToWord64# :: Word# -> Word64#
1115 case (unsafePerformIO (_ccall_ stg_wordToWord64 w#)) of
1118 word64ToInt64# :: Word64# -> Int64#
1119 word64ToInt64# w64# =
1120 case (unsafePerformIO (_ccall_ stg_word64ToInt64 w64#)) of
1123 int64ToWord64# :: Int64# -> Word64#
1124 int64ToWord64# i64# =
1125 case (unsafePerformIO (_ccall_ stg_int64ToWord64 i64#)) of
1128 intToInt64# :: Int# -> Int64#
1130 case (unsafePerformIO (_ccall_ stg_intToInt64 i#)) of
1135 instance Enum Word64 where
1137 | w == maxBound = succError "Word64"
1140 | w == minBound = predError "Word64"
1144 | i >= 0 = intToWord64 i
1146 = toEnumError "Word64" i (minBound::Word64,maxBound::Word64)
1149 | w <= intToWord64 (maxBound::Int)
1152 = fromEnumError "Word64" w
1154 enumFrom e1 = map integerToWord64 [word64ToInteger e1 .. word64ToInteger maxBound]
1155 enumFromTo e1 e2 = map integerToWord64 [word64ToInteger e1 .. word64ToInteger e2]
1156 enumFromThen e1 e2 = map integerToWord64 [word64ToInteger e1, word64ToInteger e2 .. word64ToInteger last]
1160 | e2 < e1 = minBound
1161 | otherwise = maxBound
1163 enumFromThenTo e1 e2 e3 = map integerToWord64 [word64ToInteger e1, word64ToInteger e2 .. word64ToInteger e3]
1165 instance Show Word64 where
1166 showsPrec p x = showsPrec p (word64ToInteger x)
1168 instance Read Word64 where
1169 readsPrec _ s = [ (integerToWord64 x,r) | (x,r) <- readDec s ]
1171 instance Ix Word64 where
1172 range (m,n) = [m..n]
1174 | inRange b i = word64ToInt (i-m)
1175 | otherwise = indexError i b "Word64"
1176 inRange (m,n) i = m <= i && i <= n
1178 instance Bounded Word64 where
1180 maxBound = minBound - 1
1182 instance Real Word64 where
1183 toRational x = toInteger x % 1
1185 sizeofWord64 :: Word32
1192 The Hugs-GHC extension libraries provide functions for going between
1193 Int and the various (un)signed ints. Here we provide the same for
1194 the GHC specific Word type:
1197 wordToWord8 :: Word -> Word8
1198 wordToWord16 :: Word -> Word16
1199 wordToWord32 :: Word -> Word32
1201 word8ToWord :: Word8 -> Word
1202 word16ToWord :: Word16 -> Word
1203 word32ToWord :: Word32 -> Word
1205 word8ToWord# :: Word8 -> Word#
1206 word16ToWord# :: Word16 -> Word#
1207 word32ToWord# :: Word32 -> Word#
1209 word8ToWord (W8# w#) = W# w#
1210 word8ToWord# (W8# w#) = w#
1212 wordToWord8 (W# w#) = W8# (w# `and#` (case (maxBound::Word8) of W8# x# -> x#))
1213 word16ToWord (W16# w#) = W# w#
1214 word16ToWord# (W16# w#) = w#
1216 wordToWord16 (W# w#) = W16# (w# `and#` (case (maxBound::Word16) of W16# x# -> x#))
1217 wordToWord32 (W# w#) = W32# (w# `and#` (case (maxBound::Word32) of W32# x# -> x#))
1219 word32ToWord (W32# w#) = W# w#
1220 word32ToWord# (W32# w#) = w#
1222 wordToWord64 :: Word -> Word64
1223 wordToWord64 (W# w#) = W64# (wordToWord64# w#)
1225 -- lossy on 32-bit platforms, but provided nontheless.
1226 word64ToWord :: Word64 -> Word
1227 word64ToWord (W64# w#) = W# (word64ToWord# w#)
1232 --End of exported definitions
1234 The remainder of this file consists of definitions which are only
1235 used in the implementation.
1238 signumReal :: (Ord a, Num a) => a -> a
1239 signumReal x | x == 0 = 0
1245 NOTE: the index is in units of the size of the type, *not* bytes.
1248 indexWord8OffAddr :: Addr -> Int -> Word8
1249 indexWord8OffAddr (A# a#) (I# i#) = intToWord8 (I# (ord# (indexCharOffAddr# a# i#)))
1251 indexWord16OffAddr :: Addr -> Int -> Word16
1252 indexWord16OffAddr a i =
1253 #ifdef WORDS_BIGENDIAN
1254 intToWord16 ( word8ToInt l + (word8ToInt maxBound) * word8ToInt h)
1256 intToWord16 ( word8ToInt h + (word8ToInt maxBound) * word8ToInt l)
1260 l = indexWord8OffAddr a byte_idx
1261 h = indexWord8OffAddr a (byte_idx+1)
1263 indexWord32OffAddr :: Addr -> Int -> Word32
1264 indexWord32OffAddr (A# a#) i = wordToWord32 (W# (indexWordOffAddr# a# i'#))
1266 -- adjust index to be in Word units, not Word32 ones.
1268 #if WORD_SIZE_IN_BYTES==8
1274 indexWord64OffAddr :: Addr -> Int -> Word64
1275 indexWord64OffAddr (A# a#) (I# i#)
1276 #if WORD_SIZE_IN_BYTES==8
1277 = W64# (indexWordOffAddr# a# i#)
1279 = W64# (indexWord64OffAddr# a# i#)
1282 #ifndef __PARALLEL_HASKELL__
1284 indexWord8OffForeignObj :: ForeignObj -> Int -> Word8
1285 indexWord8OffForeignObj (ForeignObj fo#) (I# i#) = intToWord8 (I# (ord# (indexCharOffForeignObj# fo# i#)))
1287 indexWord16OffForeignObj :: ForeignObj -> Int -> Word16
1288 indexWord16OffForeignObj fo i =
1289 #ifdef WORDS_BIGENDIAN
1290 intToWord16 ( word8ToInt l + (word8ToInt maxBound) * word8ToInt h)
1292 intToWord16 ( word8ToInt h + (word8ToInt maxBound) * word8ToInt l)
1296 l = indexWord8OffForeignObj fo byte_idx
1297 h = indexWord8OffForeignObj fo (byte_idx+1)
1299 indexWord32OffForeignObj :: ForeignObj -> Int -> Word32
1300 indexWord32OffForeignObj (ForeignObj fo#) i = wordToWord32 (W# (indexWordOffForeignObj# fo# i'#))
1302 -- adjust index to be in Word units, not Word32 ones.
1304 #if WORD_SIZE_IN_BYTES==8
1310 indexWord64OffForeignObj :: ForeignObj -> Int -> Word64
1311 indexWord64OffForeignObj (ForeignObj fo#) (I# i#)
1312 #if WORD_SIZE_IN_BYTES==8
1313 = W64# (indexWordOffForeignObj# fo# i#)
1315 = W64# (indexWord64OffForeignObj# fo# i#)
1321 Read words out of mutable memory:
1324 readWord8OffAddr :: Addr -> Int -> IO Word8
1325 readWord8OffAddr a i = _casm_ `` %r=((StgWord8*)%0)[(StgInt)%1]; '' a i
1327 readWord16OffAddr :: Addr -> Int -> IO Word16
1328 readWord16OffAddr a i = _casm_ `` %r=((StgWord16*)%0)[(StgInt)%1]; '' a i
1330 readWord32OffAddr :: Addr -> Int -> IO Word32
1331 readWord32OffAddr a i = _casm_ `` %r=((StgWord32*)%0)[(StgInt)%1]; '' a i
1333 readWord64OffAddr :: Addr -> Int -> IO Word64
1334 #if WORD_SIZE_IN_BYTES==8
1335 readWord64OffAddr a i = _casm_ `` %r=((StgWord*)%0)[(StgInt)%1]; '' a i
1337 readWord64OffAddr a i = _casm_ `` %r=((StgWord64*)%0)[(StgInt)%1]; '' a i
1340 #ifndef __PARALLEL_HASKELL__
1341 readWord8OffForeignObj :: ForeignObj -> Int -> IO Word8
1342 readWord8OffForeignObj fo i = _casm_ `` %r=((StgWord8*)%0)[(StgInt)%1]; '' fo i
1344 readWord16OffForeignObj :: ForeignObj -> Int -> IO Word16
1345 readWord16OffForeignObj fo i = _casm_ `` %r=((StgWord16*)%0)[(StgInt)%1]; '' fo i
1347 readWord32OffForeignObj :: ForeignObj -> Int -> IO Word32
1348 readWord32OffForeignObj fo i = _casm_ `` %r=((StgWord32*)%0)[(StgInt)%1]; '' fo i
1350 readWord64OffForeignObj :: ForeignObj -> Int -> IO Word64
1351 #if WORD_SIZE_IN_BYTES==8
1352 readWord64OffForeignObj fo i = _casm_ `` %r=((StgWord*)%0)[(StgInt)%1]; '' fo i
1354 readWord64OffForeignObj fo i = _casm_ `` %r=((StgWord64*)%0)[(StgInt)%1]; '' fo i
1361 Note: we provide primops for the writing via Addrs since that's used
1362 in the IO implementation (a place where we *really* do care about cycles.)
1365 writeWord8OffAddr :: Addr -> Int -> Word8 -> IO ()
1366 writeWord8OffAddr (A# a#) (I# i#) (W8# w#) = IO $ \ s# ->
1367 case (writeCharOffAddr# a# i# (chr# (word2Int# w#)) s#) of s2# -> (# s2#, () #)
1369 writeWord16OffAddr :: Addr -> Int -> Word16 -> IO ()
1370 writeWord16OffAddr a i e = _casm_ `` (((StgWord16*)%0)[(StgInt)%1])=(StgWord16)%2; '' a i e
1372 writeWord32OffAddr :: Addr -> Int -> Word32 -> IO ()
1373 writeWord32OffAddr (A# a#) i (W32# w#) = IO $ \ s# ->
1374 case (writeWordOffAddr# a# i'# w# s#) of s2# -> (# s2#, () #)
1376 -- adjust index to be in Word units, not Word32 ones.
1378 #if WORD_SIZE_IN_BYTES==8
1384 writeWord64OffAddr :: Addr -> Int -> Word64 -> IO ()
1385 #if WORD_SIZE_IN_BYTES==8
1386 writeWord64OffAddr (A# a#) (I# i#) (W64# w#) = IO $ \ s# ->
1387 case (writeWordOffAddr# a# i# w# s#) of s2# -> (# s2#, () #)
1389 writeWord64OffAddr (A# a#) (I# i#) (W64# w#) = IO $ \ s# ->
1390 case (writeWord64OffAddr# a# i# w# s#) of s2# -> (# s2#, () #)
1393 #ifndef __PARALLEL_HASKELL__
1395 writeWord8OffForeignObj :: ForeignObj -> Int -> Word8 -> IO ()
1396 writeWord8OffForeignObj fo i w = _casm_ `` (((StgWord8*)%0)[(StgInt)%1])=(StgWord8)%2; '' fo i w
1398 writeWord16OffForeignObj :: ForeignObj -> Int -> Word16 -> IO ()
1399 writeWord16OffForeignObj fo i w = _casm_ `` (((StgWord16*)%0)[(StgInt)%1])=(StgWord16)%2; '' fo i w
1401 writeWord32OffForeignObj :: ForeignObj -> Int -> Word32 -> IO ()
1402 writeWord32OffForeignObj fo i w = _casm_ `` (((StgWord32*)%0)[(StgInt)%1])=(StgWord32)%2; '' fo i' w
1404 -- adjust index to be in Word units, not Word32 ones.
1406 #if WORD_SIZE_IN_BYTES==8
1412 writeWord64OffForeignObj :: ForeignObj -> Int -> Word64 -> IO ()
1413 # if WORD_SIZE_IN_BYTES==8
1414 writeWord64OffForeignObj fo i e = _casm_ `` (((StgWord*)%0)[(StgInt)%1])=(StgWord)%2; '' fo i e
1416 writeWord64OffForeignObj fo i e = _casm_ `` (((StgWord64*)%0)[(StgInt)%1])=(StgWord64)%2; '' fo i e
1423 Utils for generating friendly error messages.
1426 {-# NOINLINE indexError #-}
1427 indexError :: (Show a) => a -> (a,a) -> String -> b
1429 = error (showString "Ix{" . showString tp . showString "}.index: Index " .
1430 showParen True (showsPrec 0 i) .
1431 showString " out of range " $
1432 showParen True (showsPrec 0 rng) "")
1434 toEnumError :: (Show a,Show b) => String -> a -> (b,b) -> c
1435 toEnumError inst_ty tag bnds
1436 = error ("Enum.toEnum{" ++ inst_ty ++ "}: tag " ++
1437 (showParen True (showsPrec 0 tag) $
1438 " is outside of bounds " ++
1441 fromEnumError :: (Show a,Show b) => String -> a -> b
1442 fromEnumError inst_ty tag
1443 = error ("Enum.fromEnum{" ++ inst_ty ++ "}: value " ++
1444 (showParen True (showsPrec 0 tag) $
1445 " is outside of Int's bounds " ++
1446 show (minBound::Int,maxBound::Int)))
1448 succError :: String -> a
1450 = error ("Enum.succ{" ++ inst_ty ++ "}: tried to take `succ' of maxBound")
1452 predError :: String -> a
1454 = error ("Enum.pred{" ++ inst_ty ++ "}: tried to take `pred' of minBound")
1456 divZeroError :: (Show a) => String -> a -> b
1458 = error ("Integral." ++ meth ++ ": divide by 0 (" ++ show v ++ " / 0)")