X-Git-Url: http://git.megacz.com/?a=blobdiff_plain;f=GHC%2FWord.hs;h=4af74faf32d2cb362e22a34118a007a8a636dba6;hb=e00b86710c32eff43804226c15e855a1ae65ca81;hp=a2edfe898b553417be7e89de55d0b74d6cc58734;hpb=2839722da39a0027467992b092b129dfcaec0e77;p=ghc-base.git diff --git a/GHC/Word.hs b/GHC/Word.hs index a2edfe8..4af74fa 100644 --- a/GHC/Word.hs +++ b/GHC/Word.hs @@ -1,4 +1,5 @@ -{-# OPTIONS_GHC -fno-implicit-prelude #-} +{-# OPTIONS_GHC -XNoImplicitPrelude #-} +{-# OPTIONS_HADDOCK hide #-} ----------------------------------------------------------------------------- -- | -- Module : GHC.Word @@ -26,6 +27,13 @@ module GHC.Word ( import Data.Bits +#if WORD_SIZE_IN_BITS < 32 +import GHC.IntWord32 +#endif +#if WORD_SIZE_IN_BITS < 64 +import GHC.IntWord64 +#endif + import GHC.Base import GHC.Enum import GHC.Num @@ -82,8 +90,7 @@ instance Num Word where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W# (int2Word# i#) - fromInteger (J# s# d#) = W# (integer2Word# s# d#) + fromInteger i = W# (integerToWord i) instance Real Word where toRational x = toInteger x % 1 @@ -108,27 +115,27 @@ instance Enum Word where enumFromThenTo = integralEnumFromThenTo instance Integral Word where - quot x@(W# x#) y@(W# y#) + quot (W# x#) y@(W# y#) | y /= 0 = W# (x# `quotWord#` y#) | otherwise = divZeroError - rem x@(W# x#) y@(W# y#) + rem (W# x#) y@(W# y#) | y /= 0 = W# (x# `remWord#` y#) | otherwise = divZeroError - div x@(W# x#) y@(W# y#) + div (W# x#) y@(W# y#) | y /= 0 = W# (x# `quotWord#` y#) | otherwise = divZeroError - mod x@(W# x#) y@(W# y#) + mod (W# x#) y@(W# y#) | y /= 0 = W# (x# `remWord#` y#) | otherwise = divZeroError - quotRem x@(W# x#) y@(W# y#) + quotRem (W# x#) y@(W# y#) | y /= 0 = (W# (x# `quotWord#` y#), W# (x# `remWord#` y#)) | otherwise = divZeroError - divMod x@(W# x#) y@(W# y#) + divMod (W# x#) y@(W# y#) | y /= 0 = (W# (x# `quotWord#` y#), W# (x# `remWord#` y#)) | otherwise = divZeroError toInteger (W# x#) - | i# >=# 0# = S# i# - | otherwise = case word2Integer# x# of (# s, d #) -> J# s d + | i# >=# 0# = smallInteger i# + | otherwise = wordToInteger x# where i# = word2Int# x# @@ -146,9 +153,9 @@ instance Bounded Word where #endif instance Ix Word where - range (m,n) = [m..n] - unsafeIndex b@(m,_) i = fromIntegral (i - m) - inRange (m,n) i = m <= i && i <= n + range (m,n) = [m..n] + unsafeIndex (m,_) i = fromIntegral (i - m) + inRange (m,n) i = m <= i && i <= n instance Read Word where readsPrec p s = [(fromInteger x, r) | (x, r) <- readsPrec p s] @@ -168,10 +175,14 @@ instance Bits Word where | otherwise = W# ((x# `uncheckedShiftL#` i'#) `or#` (x# `uncheckedShiftRL#` (wsib -# i'#))) where i'# = word2Int# (int2Word# i# `and#` int2Word# (wsib -# 1#)) - wsib = WORD_SIZE_IN_BITS# {- work around preprocessor problem (??) -} + wsib = WORD_SIZE_IN_BITS# {- work around preprocessor problem (??) -} bitSize _ = WORD_SIZE_IN_BITS isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + {-# RULES "fromIntegral/Int->Word" fromIntegral = \(I# x#) -> W# (int2Word# x#) "fromIntegral/Word->Int" fromIntegral = \(W# x#) -> I# (word2Int# x#) @@ -199,8 +210,7 @@ instance Num Word8 where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W8# (narrow8Word# (int2Word# i#)) - fromInteger (J# s# d#) = W8# (narrow8Word# (integer2Word# s# d#)) + fromInteger i = W8# (narrow8Word# (integerToWord i)) instance Real Word8 where toRational x = toInteger x % 1 @@ -221,34 +231,34 @@ instance Enum Word8 where enumFromThen = boundedEnumFromThen instance Integral Word8 where - quot x@(W8# x#) y@(W8# y#) + quot (W8# x#) y@(W8# y#) | y /= 0 = W8# (x# `quotWord#` y#) | otherwise = divZeroError - rem x@(W8# x#) y@(W8# y#) + rem (W8# x#) y@(W8# y#) | y /= 0 = W8# (x# `remWord#` y#) | otherwise = divZeroError - div x@(W8# x#) y@(W8# y#) + div (W8# x#) y@(W8# y#) | y /= 0 = W8# (x# `quotWord#` y#) | otherwise = divZeroError - mod x@(W8# x#) y@(W8# y#) + mod (W8# x#) y@(W8# y#) | y /= 0 = W8# (x# `remWord#` y#) | otherwise = divZeroError - quotRem x@(W8# x#) y@(W8# y#) + quotRem (W8# x#) y@(W8# y#) | y /= 0 = (W8# (x# `quotWord#` y#), W8# (x# `remWord#` y#)) | otherwise = divZeroError - divMod x@(W8# x#) y@(W8# y#) + divMod (W8# x#) y@(W8# y#) | y /= 0 = (W8# (x# `quotWord#` y#), W8# (x# `remWord#` y#)) | otherwise = divZeroError - toInteger (W8# x#) = S# (word2Int# x#) + toInteger (W8# x#) = smallInteger (word2Int# x#) instance Bounded Word8 where minBound = 0 maxBound = 0xFF instance Ix Word8 where - range (m,n) = [m..n] - unsafeIndex b@(m,_) i = fromIntegral (i - m) - inRange (m,n) i = m <= i && i <= n + range (m,n) = [m..n] + unsafeIndex (m,_) i = fromIntegral (i - m) + inRange (m,n) i = m <= i && i <= n instance Read Word8 where readsPrec p s = [(fromIntegral (x::Int), r) | (x, r) <- readsPrec p s] @@ -272,6 +282,10 @@ instance Bits Word8 where bitSize _ = 8 isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + {-# RULES "fromIntegral/Word8->Word8" fromIntegral = id :: Word8 -> Word8 "fromIntegral/Word8->Integer" fromIntegral = toInteger :: Word8 -> Integer @@ -300,8 +314,7 @@ instance Num Word16 where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W16# (narrow16Word# (int2Word# i#)) - fromInteger (J# s# d#) = W16# (narrow16Word# (integer2Word# s# d#)) + fromInteger i = W16# (narrow16Word# (integerToWord i)) instance Real Word16 where toRational x = toInteger x % 1 @@ -322,34 +335,34 @@ instance Enum Word16 where enumFromThen = boundedEnumFromThen instance Integral Word16 where - quot x@(W16# x#) y@(W16# y#) + quot (W16# x#) y@(W16# y#) | y /= 0 = W16# (x# `quotWord#` y#) | otherwise = divZeroError - rem x@(W16# x#) y@(W16# y#) + rem (W16# x#) y@(W16# y#) | y /= 0 = W16# (x# `remWord#` y#) | otherwise = divZeroError - div x@(W16# x#) y@(W16# y#) + div (W16# x#) y@(W16# y#) | y /= 0 = W16# (x# `quotWord#` y#) | otherwise = divZeroError - mod x@(W16# x#) y@(W16# y#) + mod (W16# x#) y@(W16# y#) | y /= 0 = W16# (x# `remWord#` y#) | otherwise = divZeroError - quotRem x@(W16# x#) y@(W16# y#) + quotRem (W16# x#) y@(W16# y#) | y /= 0 = (W16# (x# `quotWord#` y#), W16# (x# `remWord#` y#)) | otherwise = divZeroError - divMod x@(W16# x#) y@(W16# y#) + divMod (W16# x#) y@(W16# y#) | y /= 0 = (W16# (x# `quotWord#` y#), W16# (x# `remWord#` y#)) | otherwise = divZeroError - toInteger (W16# x#) = S# (word2Int# x#) + toInteger (W16# x#) = smallInteger (word2Int# x#) instance Bounded Word16 where minBound = 0 maxBound = 0xFFFF instance Ix Word16 where - range (m,n) = [m..n] - unsafeIndex b@(m,_) i = fromIntegral (i - m) - inRange (m,n) i = m <= i && i <= n + range (m,n) = [m..n] + unsafeIndex (m,_) i = fromIntegral (i - m) + inRange (m,n) i = m <= i && i <= n instance Read Word16 where readsPrec p s = [(fromIntegral (x::Int), r) | (x, r) <- readsPrec p s] @@ -373,6 +386,10 @@ instance Bits Word16 where bitSize _ = 16 isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + {-# RULES "fromIntegral/Word8->Word16" fromIntegral = \(W8# x#) -> W16# x# "fromIntegral/Word16->Word16" fromIntegral = id :: Word16 -> Word16 @@ -472,29 +489,9 @@ instance Bits Word32 where bitSize _ = 32 isSigned _ = False -foreign import unsafe "stg_eqWord32" eqWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_neWord32" neWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_ltWord32" ltWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_leWord32" leWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_gtWord32" gtWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_geWord32" geWord32# :: Word32# -> Word32# -> Bool -foreign import unsafe "stg_int32ToWord32" int32ToWord32# :: Int32# -> Word32# -foreign import unsafe "stg_word32ToInt32" word32ToInt32# :: Word32# -> Int32# -foreign import unsafe "stg_intToInt32" intToInt32# :: Int# -> Int32# -foreign import unsafe "stg_wordToWord32" wordToWord32# :: Word# -> Word32# -foreign import unsafe "stg_word32ToWord" word32ToWord# :: Word32# -> Word# -foreign import unsafe "stg_plusInt32" plusInt32# :: Int32# -> Int32# -> Int32# -foreign import unsafe "stg_minusInt32" minusInt32# :: Int32# -> Int32# -> Int32# -foreign import unsafe "stg_timesInt32" timesInt32# :: Int32# -> Int32# -> Int32# -foreign import unsafe "stg_negateInt32" negateInt32# :: Int32# -> Int32# -foreign import unsafe "stg_quotWord32" quotWord32# :: Word32# -> Word32# -> Word32# -foreign import unsafe "stg_remWord32" remWord32# :: Word32# -> Word32# -> Word32# -foreign import unsafe "stg_and32" and32# :: Word32# -> Word32# -> Word32# -foreign import unsafe "stg_or32" or32# :: Word32# -> Word32# -> Word32# -foreign import unsafe "stg_xor32" xor32# :: Word32# -> Word32# -> Word32# -foreign import unsafe "stg_not32" not32# :: Word32# -> Word32# -foreign import unsafe "stg_shiftL32" shiftL32# :: Word32# -> Int# -> Word32# -foreign import unsafe "stg_shiftRL32" shiftRL32# :: Word32# -> Int# -> Word32# + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) {-# RULES "fromIntegral/Int->Word32" fromIntegral = \(I# x#) -> W32# (int32ToWord32# (intToInt32# x#)) @@ -523,8 +520,7 @@ instance Num Word32 where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W32# (narrow32Word# (int2Word# i#)) - fromInteger (J# s# d#) = W32# (narrow32Word# (integer2Word# s# d#)) + fromInteger i = W32# (narrow32Word# (integerToWord i)) instance Enum Word32 where succ x @@ -556,32 +552,32 @@ instance Enum Word32 where #endif instance Integral Word32 where - quot x@(W32# x#) y@(W32# y#) + quot (W32# x#) y@(W32# y#) | y /= 0 = W32# (x# `quotWord#` y#) | otherwise = divZeroError - rem x@(W32# x#) y@(W32# y#) + rem (W32# x#) y@(W32# y#) | y /= 0 = W32# (x# `remWord#` y#) | otherwise = divZeroError - div x@(W32# x#) y@(W32# y#) + div (W32# x#) y@(W32# y#) | y /= 0 = W32# (x# `quotWord#` y#) | otherwise = divZeroError - mod x@(W32# x#) y@(W32# y#) + mod (W32# x#) y@(W32# y#) | y /= 0 = W32# (x# `remWord#` y#) | otherwise = divZeroError - quotRem x@(W32# x#) y@(W32# y#) + quotRem (W32# x#) y@(W32# y#) | y /= 0 = (W32# (x# `quotWord#` y#), W32# (x# `remWord#` y#)) | otherwise = divZeroError - divMod x@(W32# x#) y@(W32# y#) + divMod (W32# x#) y@(W32# y#) | y /= 0 = (W32# (x# `quotWord#` y#), W32# (x# `remWord#` y#)) | otherwise = divZeroError toInteger (W32# x#) #if WORD_SIZE_IN_BITS == 32 - | i# >=# 0# = S# i# - | otherwise = case word2Integer# x# of (# s, d #) -> J# s d + | i# >=# 0# = smallInteger i# + | otherwise = wordToInteger x# where i# = word2Int# x# #else - = S# (word2Int# x#) + = smallInteger (word2Int# x#) #endif instance Bits Word32 where @@ -603,6 +599,10 @@ instance Bits Word32 where bitSize _ = 32 isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + {-# RULES "fromIntegral/Word8->Word32" fromIntegral = \(W8# x#) -> W32# x# "fromIntegral/Word16->Word32" fromIntegral = \(W16# x#) -> W32# x# @@ -630,9 +630,9 @@ instance Bounded Word32 where maxBound = 0xFFFFFFFF instance Ix Word32 where - range (m,n) = [m..n] - unsafeIndex b@(m,_) i = fromIntegral (i - m) - inRange (m,n) i = m <= i && i <= n + range (m,n) = [m..n] + unsafeIndex (m,_) i = fromIntegral (i - m) + inRange (m,n) i = m <= i && i <= n instance Read Word32 where #if WORD_SIZE_IN_BITS < 33 @@ -668,8 +668,7 @@ instance Num Word64 where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W64# (int64ToWord64# (intToInt64# i#)) - fromInteger (J# s# d#) = W64# (integerToWord64# s# d#) + fromInteger i = W64# (integerToWord64 i) instance Enum Word64 where succ x @@ -709,9 +708,7 @@ instance Integral Word64 where divMod x@(W64# x#) y@(W64# y#) | y /= 0 = (W64# (x# `quotWord64#` y#), W64# (x# `remWord64#` y#)) | otherwise = divZeroError - toInteger x@(W64# x#) - | x <= 0x7FFFFFFF = S# (word2Int# (word64ToWord# x#)) - | otherwise = case word64ToInteger# x# of (# s, d #) -> J# s d + toInteger (W64# x#) = word64ToInteger x# instance Bits Word64 where {-# INLINE shift #-} @@ -732,6 +729,10 @@ instance Bits Word64 where bitSize _ = 64 isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + -- give the 64-bit shift operations the same treatment as the 32-bit -- ones (see GHC.Base), namely we wrap them in tests to catch the -- cases when we're shifting more than 64 bits to avoid unspecified @@ -740,38 +741,10 @@ instance Bits Word64 where shiftL64#, shiftRL64# :: Word64# -> Int# -> Word64# a `shiftL64#` b | b >=# 64# = wordToWord64# (int2Word# 0#) - | otherwise = a `uncheckedShiftL64#` b + | otherwise = a `uncheckedShiftL64#` b a `shiftRL64#` b | b >=# 64# = wordToWord64# (int2Word# 0#) - | otherwise = a `uncheckedShiftRL64#` b - - -foreign import ccall unsafe "hs_eqWord64" eqWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_neWord64" neWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_ltWord64" ltWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_leWord64" leWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_gtWord64" gtWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_geWord64" geWord64# :: Word64# -> Word64# -> Bool -foreign import ccall unsafe "hs_int64ToWord64" int64ToWord64# :: Int64# -> Word64# -foreign import ccall unsafe "hs_word64ToInt64" word64ToInt64# :: Word64# -> Int64# -foreign import ccall unsafe "hs_intToInt64" intToInt64# :: Int# -> Int64# -foreign import ccall unsafe "hs_wordToWord64" wordToWord64# :: Word# -> Word64# -foreign import ccall unsafe "hs_word64ToWord" word64ToWord# :: Word64# -> Word# -foreign import ccall unsafe "hs_plusInt64" plusInt64# :: Int64# -> Int64# -> Int64# -foreign import ccall unsafe "hs_minusInt64" minusInt64# :: Int64# -> Int64# -> Int64# -foreign import ccall unsafe "hs_timesInt64" timesInt64# :: Int64# -> Int64# -> Int64# -foreign import ccall unsafe "hs_negateInt64" negateInt64# :: Int64# -> Int64# -foreign import ccall unsafe "hs_quotWord64" quotWord64# :: Word64# -> Word64# -> Word64# -foreign import ccall unsafe "hs_remWord64" remWord64# :: Word64# -> Word64# -> Word64# -foreign import ccall unsafe "hs_and64" and64# :: Word64# -> Word64# -> Word64# -foreign import ccall unsafe "hs_or64" or64# :: Word64# -> Word64# -> Word64# -foreign import ccall unsafe "hs_xor64" xor64# :: Word64# -> Word64# -> Word64# -foreign import ccall unsafe "hs_not64" not64# :: Word64# -> Word64# -foreign import ccall unsafe "hs_uncheckedShiftL64" uncheckedShiftL64# :: Word64# -> Int# -> Word64# -foreign import ccall unsafe "hs_uncheckedShiftRL64" uncheckedShiftRL64# :: Word64# -> Int# -> Word64# - -foreign import ccall unsafe "hs_integerToWord64" integerToWord64# :: Int# -> ByteArray# -> Word64# - + | otherwise = a `uncheckedShiftRL64#` b {-# RULES "fromIntegral/Int->Word64" fromIntegral = \(I# x#) -> W64# (int64ToWord64# (intToInt64# x#)) @@ -798,8 +771,7 @@ instance Num Word64 where abs x = x signum 0 = 0 signum _ = 1 - fromInteger (S# i#) = W64# (int2Word# i#) - fromInteger (J# s# d#) = W64# (integer2Word# s# d#) + fromInteger i = W64# (integerToWord i) instance Enum Word64 where succ x @@ -821,27 +793,27 @@ instance Enum Word64 where enumFromThenTo = integralEnumFromThenTo instance Integral Word64 where - quot x@(W64# x#) y@(W64# y#) + quot (W64# x#) y@(W64# y#) | y /= 0 = W64# (x# `quotWord#` y#) | otherwise = divZeroError - rem x@(W64# x#) y@(W64# y#) + rem (W64# x#) y@(W64# y#) | y /= 0 = W64# (x# `remWord#` y#) | otherwise = divZeroError - div x@(W64# x#) y@(W64# y#) + div (W64# x#) y@(W64# y#) | y /= 0 = W64# (x# `quotWord#` y#) | otherwise = divZeroError - mod x@(W64# x#) y@(W64# y#) + mod (W64# x#) y@(W64# y#) | y /= 0 = W64# (x# `remWord#` y#) | otherwise = divZeroError - quotRem x@(W64# x#) y@(W64# y#) + quotRem (W64# x#) y@(W64# y#) | y /= 0 = (W64# (x# `quotWord#` y#), W64# (x# `remWord#` y#)) | otherwise = divZeroError - divMod x@(W64# x#) y@(W64# y#) + divMod (W64# x#) y@(W64# y#) | y /= 0 = (W64# (x# `quotWord#` y#), W64# (x# `remWord#` y#)) | otherwise = divZeroError toInteger (W64# x#) - | i# >=# 0# = S# i# - | otherwise = case word2Integer# x# of (# s, d #) -> J# s d + | i# >=# 0# = smallInteger i# + | otherwise = wordToInteger x# where i# = word2Int# x# @@ -864,12 +836,19 @@ instance Bits Word64 where bitSize _ = 64 isSigned _ = False + {-# INLINE shiftR #-} + -- same as the default definition, but we want it inlined (#2376) + x `shiftR` i = x `shift` (-i) + {-# RULES "fromIntegral/a->Word64" fromIntegral = \x -> case fromIntegral x of W# x# -> W64# x# "fromIntegral/Word64->a" fromIntegral = \(W64# x#) -> fromIntegral (W# x#) #-} +uncheckedShiftL64# :: Word# -> Int# -> Word# uncheckedShiftL64# = uncheckedShiftL# + +uncheckedShiftRL64# :: Word# -> Int# -> Word# uncheckedShiftRL64# = uncheckedShiftRL# #endif @@ -885,9 +864,9 @@ instance Bounded Word64 where maxBound = 0xFFFFFFFFFFFFFFFF instance Ix Word64 where - range (m,n) = [m..n] - unsafeIndex b@(m,_) i = fromIntegral (i - m) - inRange (m,n) i = m <= i && i <= n + range (m,n) = [m..n] + unsafeIndex (m,_) i = fromIntegral (i - m) + inRange (m,n) i = m <= i && i <= n instance Read Word64 where readsPrec p s = [(fromInteger x, r) | (x, r) <- readsPrec p s]