@@ -4,7 +4,6 @@
44-- |
55-- Module : Data.Binary.Bits.Get
66-- Copyright : (c) Lennart Kolmodin 2010-2011
7−-- (c) Sylvain Henry 2015
87-- License : BSD3-style (see LICENSE)
98--
109-- Maintainer : kolmodin@gmail.com
@@ -60,19 +59,11 @@ module Data.Binary.Bits.Get
6059
6160 -- ** Get bytes
6261 , getBool
63− , getBool#
6462 , getWord8
65− , getWord16
66− , getWord32
67− , getWord64
6863 , getWord16be
6964 , getWord32be
7065 , getWord64be
7166
72− -- ** Skip bits
73− , skipBits
74− , alignByte
75−
7667 -- * Blocks
7768
7869 -- $blocks
@@ -82,41 +73,33 @@ module Data.Binary.Bits.Get
8273 -- ** Read in Blocks
8374 , bool
8475 , word8
85− , word16
86− , word32
87− , word64
8876 , word16be
8977 , word32be
9078 , word64be
9179 , byteString
9280 , Data.Binary.Bits.Get.getByteString
93− , Data.Binary.Bits.Get.getLazyByteString
94− , Data.Binary.Bits.Get.isEmpty
9581
9682 ) where
9783
98−import Data.Binary.Get as B ( Get, getLazyByteString, isEmpty )
84+import Data.Binary.Get as B ( runGet, Get, getByteString, getLazyByteString )
9985import Data.Binary.Get.Internal as B ( get, put, ensureN )
100−import Data.Binary.Bits.BitOrder
101−import Data.Binary.Bits.Internal
102−import Data.Binary.Bits.Alignment
10386
10487import Data.ByteString as B
10588import qualified Data.ByteString.Lazy as L
10689import Data.ByteString.Unsafe
107−import Foreign.Marshal.Alloc (mallocBytes)
108−import Foreign.Ptr
109−import Foreign.Storable (poke)
110−import System.IO.Unsafe (unsafePerformIO)
11190
11291import Data.Bits
11392import Data.Word
93+
11494import Control.Applicative
115−import Control.Monad (when,foldM_)
11695
11796import Prelude as P
97+
98+#if defined(__GLASGOW_HASKELL__) && !defined(__HADDOCK__)
99+import GHC.Base
118100import GHC.Word
119−import GHC.Base (uncheckedShiftLWord8#, wordToWord8#, Int (..), andWord8#, Word8#, (-#), Int#, xorI#, eqWord8#, TYPE)
101+#endif
102+
120103
121104-- $bitget
122105-- Parse bits using a monad.
@@ -165,120 +148,191 @@ import GHC.Base (uncheckedShiftLWord8#, wordToWord8#, Int (..), andWord8#, Word8
165148-- @
166149
167150data S = S {-# UNPACK #-} !ByteString -- Input
168− {-# UNPACK #-} !Int -- Bit offset (0-7)
169− !BitOrder -- Bit order
151+ {-# UNPACK #-} !Int -- Bit offset (0-7)
170152 deriving (Show)
171153
172−-- | Increment the current bit offset
154+-- | A block that will be read with only one boundry check. Needs to know the
155+-- number of bits in advance.
156+data Block a = Block Int (S -> a)
157+
158+instance Functor Block where
159+ fmap f (Block i p) = Block i (\s -> f (p s))
160+
161+instance Applicative Block where
162+ pure a = Block 0 (\_ -> a)
163+ (Block i p) <*> (Block j q) = Block (i+j) (\s -> p s $ q (incS i s))
164+ (Block i _) *> (Block j q) = Block (i+j) (q . incS i)
165+ (Block i p) <* (Block j _) = Block (i+j) p
166+
167+-- | Get a block. Will be read with one single boundry check, and
168+-- therefore requires a statically known number of bits.
169+-- Build blocks using 'bool', 'word8', 'word16be', 'word32be', 'word64be',
170+-- 'byteString' and 'Applicative'.
171+block :: Block a -> BitGet a
172+block (Block i p) = do
173+ ensureBits i
174+ s <- getState
175+ putState $! (incS i s)
176+ return $! p s
177+
173178incS :: Int -> S -> S
174−incS o (S bs n bo) = S (unsafeDrop d bs) n' bo
175− where
176− !o' = (n+o)
177− !d = byte_offset o'
178− !n' = bit_offset o'
179+incS o (S bs n) =
180+ let !o' = (n+o)
181+ !d = o' `shiftR` 3
182+ !n' = o' .&. make_mask 3
183+ in S (unsafeDrop d bs) n'
184+
185+-- | make_mask 3 = 00000111
186+make_mask :: (Bits a, Num a) => Int -> a
187+make_mask n = (1 `shiftL` fromIntegral n) - 1
188+{-# SPECIALIZE make_mask :: Int -> Int #-}
189+{-# SPECIALIZE make_mask :: Int -> Word #-}
190+{-# SPECIALIZE make_mask :: Int -> Word8 #-}
191+{-# SPECIALIZE make_mask :: Int -> Word16 #-}
192+{-# SPECIALIZE make_mask :: Int -> Word32 #-}
193+{-# SPECIALIZE make_mask :: Int -> Word64 #-}
194+
195+bit_offset :: Int -> Int
196+bit_offset n = make_mask 3 .&. n
197+
198+byte_offset :: Int -> Int
199+byte_offset n = n `shiftR` 3
179200
180−-- | Read a single bit
181201readBool :: S -> Bool
182−readBool (S bs o bo) = case bo of
183− BB -> testBit (unsafeHead bs) (7-o)
184− BL -> testBit (unsafeHead bs) (7-o)
185− LL -> testBit (unsafeHead bs) o
186− LB -> testBit (unsafeHead bs) o
187−
188−-- | Read a single bit
189−readBool# :: S -> Int
190−readBool# (S bs (I# o) bo) = case bo of
191− BB -> testBit# (7# -# o)
192− BL -> testBit# (7# -# o)
193− LL -> testBit# o
194− LB -> testBit# o
195− where
196− !(W8# w) = unsafeHead bs
197− testBit# n = I# (((w `andWord8#` (wordToWord8# 1## `uncheckedShiftLWord8#` n)) `eqWord8#` wordToWord8# 0##) `xorI#` 1#)
198−
199−
200−-- | Extract a range of bits from (ws :: ByteString)
201−--
202−-- Constraint: 8 * (length ws -1 ) < o+n <= 8 * length ws
203−extract :: (Num a, FastBits a) => BitOrder -> ByteString -> Int -> Int -> a
204−extract bo bs o n
205− | n == 0 = 0
206− | B.length bs == 0 = error "Empty ByteString"
207− | otherwise = rev . mask n . foldlWithIndex' f 0 $ bs
208− where
209− -- B.foldl' with index
210− foldlWithIndex' op b = fst . B.foldl' g (b,0)
211− where g (b',i) w = (op b' w i, (i+1))
212−
213− -- 'or' correctly shifted words
214− f b w i = b .|. (fromIntegral w `fastShift` off i)
215−
216− -- co-offset
217− r = B.length bs * 8 - (o + n)
218−
219− -- shift offset depending on the byte position (0..B.length-1)
220− off i = case bo of
221− LL -> 8*i - o
222− LB -> 8*i - o
223− BB -> (B.length bs -1 - i) * 8 - r
224− BL -> (B.length bs -1 - i) * 8 - r
225−
226− -- reverse bits if necessary
227− rev = case bo of
228− LB -> reverseBits n
229− BL -> reverseBits n
230− BB -> id
231− LL -> id
232−
233−
234−-- | Generic readWord
235−readWord :: (Num a, FastBits a) => Int -> S -> a
236−readWord n (S bs o bo)
237− | n == 0 = 0
238− | otherwise = extract bo (unsafeTake nbytes bs) o n
239− where nbytes = byte_offset (o+n+7)
240−
241−-- | Check that the number of bits to read is not greater than the first parameter
242−{-# INLINE readWordChecked #-}
243−readWordChecked :: (Num a, FastBits a) => Int -> Int -> S -> a
244−readWordChecked m n s
245− | n > m = error $ "Tried to read more than " ++ show m ++ " bits (" ++ show n ++")"
246− | otherwise = readWord n s
247−
248−-- | Read the given number of bytes and return them in Big-Endian order
249−--
250−-- Examples:
251−-- BB: xxxABCDE FGHIJKLM NOPxxxxx -> ABCDEFGH IJKLMNOP
252−-- LL: LMNOPxxx DEFGHIJK xxxxxABC -> ABCDEFGH IJKLMNOP
253−-- BL: xxxPONML KJIHGFED CBAxxxxx -> ABCDEFGH IJKLMNOP
254−-- LB: EDCBAxxx MLKJIHGF xxxxxPON -> ABCDEFGH IJKLMNOP
202+readBool (S bs n) = testBit (unsafeHead bs) (7-n)
203+
204+{-# INLINE readWord8 #-}
205+readWord8 :: Int -> S -> Word8
206+readWord8 n (S bs o)
207+ -- no bits at all, return 0
208+ | n == 0 = 0
209+
210+ -- all bits are in the same byte
211+ -- we just need to shift and mask them right
212+ | n <= 8 - o = let w = unsafeHead bs
213+ m = make_mask n
214+ w' = (w `shiftr_w8` (8 - o - n)) .&. m
215+ in w'
216+
217+ -- the bits are in two different bytes
218+ -- make a word16 using both bytes, and then shift and mask
219+ | n <= 8 = let w = (fromIntegral (unsafeHead bs) `shiftl_w16` 8) .|.
220+ (fromIntegral (unsafeIndex bs 1))
221+ m = make_mask n
222+ w' = (w `shiftr_w16` (16 - o - n)) .&. m
223+ in fromIntegral w'
224+
225+{-# INLINE readWord16be #-}
226+readWord16be :: Int -> S -> Word16
227+readWord16be n s@(S bs o)
228+
229+ -- 8 or fewer bits, use readWord8
230+ | n <= 8 = fromIntegral (readWord8 n s)
231+
232+ -- handle 9 or more bits, stored in two bytes
233+
234+ -- no offset, plain and simple 16 bytes
235+ | o == 0 && n == 16 = let msb = fromIntegral (unsafeHead bs)
236+ lsb = fromIntegral (unsafeIndex bs 1)
237+ w = (msb `shiftl_w16` 8) .|. lsb
238+ in w
239+
240+ -- no offset, but not full 16 bytes
241+ | o == 0 = let msb = fromIntegral (unsafeHead bs)
242+ lsb = fromIntegral (unsafeIndex bs 1)
243+ w = (msb `shiftl_w16` (n-8)) .|. (lsb `shiftr_w16` (16-n))
244+ in w
245+
246+ -- with offset, and n=9-16
247+ | n <= 16 = readWithOffset s shiftl_w16 shiftr_w16 n
248+
249+ | otherwise = error "readWord16be: tried to read more than 16 bits"
250+
251+{-# INLINE readWord32be #-}
252+readWord32be :: Int -> S -> Word32
253+readWord32be n s@(S _ o)
254+ -- 8 or fewer bits, use readWord8
255+ | n <= 8 = fromIntegral (readWord8 n s)
256+
257+ -- 16 or fewer bits, use readWord16be
258+ | n <= 16 = fromIntegral (readWord16be n s)
259+
260+ | o == 0 = readWithoutOffset s shiftl_w32 shiftr_w32 n
261+
262+ | n <= 32 = readWithOffset s shiftl_w32 shiftr_w32 n
263+
264+ | otherwise = error "readWord32be: tried to read more than 32 bits"
265+
266+
267+{-# INLINE readWord64be #-}
268+readWord64be :: Int -> S -> Word64
269+readWord64be n s@(S _ o)
270+ -- 8 or fewer bits, use readWord8
271+ | n <= 8 = fromIntegral (readWord8 n s)
272+
273+ -- 16 or fewer bits, use readWord16be
274+ | n <= 16 = fromIntegral (readWord16be n s)
275+
276+ | o == 0 = readWithoutOffset s shiftl_w64 shiftr_w64 n
277+
278+ | n <= 64 = readWithOffset s shiftl_w64 shiftr_w64 n
279+
280+ | otherwise = error "readWord64be: tried to read more than 64 bits"
281+
282+
255283readByteString :: Int -> S -> ByteString
256−readByteString n (S bs o bo) =
257− let
258− bs' = unsafeTake (n+1) bs
259− bs'' = unsafeTake n bs
260− rev = B.map (reverseBits 8)
261− in case (o,bo) of
262− (0,BB) -> bs''
263− (0,LL) -> B.reverse bs''
264− (0,LB) -> rev bs''
265− (0,BL) -> rev . B.reverse $ bs''
266− (_,LL) -> readByteString n (S (B.reverse bs') (8-o) BB)
267− (_,BL) -> rev . B.reverse $ readByteString n (S bs' o BB)
268− (_,LB) -> rev . B.reverse $ readByteString n (S bs' o LL)
269− (_,BB) -> unsafePerformIO $ do
270− let len = n+1
271− ptr <- mallocBytes len
272− let f r i = do
273− let
274− w = unsafeIndex bs (len-i)
275− w' = (w `fastShiftL` o) .|. r
276− r' = w `fastShiftR` (8-o)
277− poke (ptr `plusPtr` (len-i)) w'
278− return r'
279− foldM_ f 0 [1..len]
280− unsafeInit <$> unsafePackMallocCStringLen (ptr,len)
284+readByteString n s@(S bs o)
285+ -- no offset, easy.
286+ | o == 0 = unsafeTake n bs
287+ -- offset. ugg. this is really naive and slow. but also pretty easy :)
288+ | otherwise = B.pack (P.map (readWord8 8) (P.take n (iterate (incS 8) s)))
289+
290+readWithoutOffset :: (Bits a, Num a)
291+ => S -> (a -> Int -> a) -> (a -> Int -> a) -> Int -> a
292+readWithoutOffset (S bs o) shifterL shifterR n
293+ | o /= 0 = error "readWithoutOffset: there is an offset"
294+
295+ | bit_offset n == 0 && byte_offset n <= 4 =
296+ let segs = byte_offset n
297+ bn 0 = fromIntegral (unsafeHead bs)
298+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
299+
300+ in bn (segs-1)
301+
302+ | n <= 64 = let segs = byte_offset n
303+ o' = bit_offset (n - 8 + o)
281304
305+ bn 0 = fromIntegral (unsafeHead bs)
306+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
307+
308+ msegs = bn (segs-1) `shifterL` o'
309+
310+ last = (fromIntegral (unsafeIndex bs segs)) `shifterR` (8 - o')
311+
312+ w = msegs .|. last
313+ in w
314+
315+readWithOffset :: (Bits a, Num a)
316+ => S -> (a -> Int -> a) -> (a -> Int -> a) -> Int -> a
317+readWithOffset (S bs o) shifterL shifterR n
318+ | n <= 64 = let bits_in_msb = 8 - o
319+ (n',top) = (n - bits_in_msb
320+ , (fromIntegral (unsafeHead bs) .&. make_mask bits_in_msb) `shifterL` n')
321+
322+ segs = byte_offset n'
323+
324+ bn 0 = 0
325+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
326+
327+ o' = bit_offset n'
328+
329+ mseg = bn segs `shifterL` o'
330+
331+ last | o' > 0 = (fromIntegral (unsafeIndex bs (segs + 1))) `shifterR` (8 - o')
332+ | otherwise = 0
333+
334+ w = top .|. mseg .|. last
335+ in w
282336
283337------------------------------------------------------------------------
284338-- | 'BitGet' is a monad, applicative and a functor. See 'runBitGet'
@@ -287,6 +341,7 @@ newtype BitGet a = B { runState :: S -> Get (S,a) }
287341
288342instance Monad BitGet where
289343 return x = B $ \s -> return (s,x)
344+ fail str = B $ \(S inp n) -> putBackState inp n >> fail str
290345 (B f) >>= g = B $ \s -> do (s',a) <- f s
291346 runState (g a) s'
292347
@@ -297,51 +352,25 @@ instance Applicative BitGet where
297352 pure x = return x
298353 fm <*> m = fm >>= \f -> m >>= \v -> return (f v)
299354
300−instance BitOrderable BitGet where
301− setBitOrder bo = do
302− (S bs o _) <- getState
303− putState (S bs o bo)
304−
305− getBitOrder = do
306− (S _ _ bo) <- getState
307− return bo
308−
309−instance Alignable BitGet where
310− -- | Skip the given number of bits
311− skipBits n = do
312− ensureBits n
313− withState (incS n)
314−
315− -- | Skip bits if necessary to align to the next byte
316− alignByte = do
317− (S _ o _) <- getState
318− when (o /= 0) $
319− skipBits (8-o)
320−
321−
322−
323355-- | Run a 'BitGet' within the Binary packages 'Get' monad. If a byte has
324356-- been partially consumed it will be discarded once 'runBitGet' is finished.
325357runBitGet :: BitGet a -> Get a
326358runBitGet bg = do
327359 s <- mkInitState
328− (s',a) <- runState bg s
329− putBackState s'
360+ ((S str' n),a) <- runState bg s
361+ putBackState str' n
330362 return a
331363
332364mkInitState :: Get S
333365mkInitState = do
334− bs <- get
366+ str <- get
335367 put B.empty
336− return (S bs 0 BB)
368+ return (S str 0)
337369
338−putBackState :: S -> Get ()
339−putBackState (S bs o _) = do
370+putBackState :: B.ByteString -> Int -> Get ()
371+putBackState bs n = do
340372 remaining <- get
341− let bs' = case o of
342− 0 -> bs
343− _ -> unsafeDrop 1 bs
344− put (bs' `B.append` remaining)
373+ put (B.drop (if n==0 then 0 else 1) bs `B.append` remaining)
345374
346375getState :: BitGet S
347376getState = B $ \s -> return (s,s)
@@ -349,148 +378,116 @@ getState = B $ \s -> return (s,s)
349378putState :: S -> BitGet ()
350379putState s = B $ \_ -> return (s,())
351380
352−withState :: (S -> S) -> BitGet ()
353−withState f = do
354− s <- getState
355− putState $! f s
356−
357381-- | Make sure there are at least @n@ bits.
358382ensureBits :: Int -> BitGet ()
359383ensureBits n = do
360− (S bs o bo) <- getState
384+ (S bs o) <- getState
361385 if n <= (B.length bs * 8 - o)
362386 then return ()
363387 else do let currentBits = B.length bs * 8 - o
364− let byteCount = byte_offset (n - currentBits + 7)
388+ let byteCount = (n - currentBits + 7) `div` 8
365389 B $ \_ -> do B.ensureN byteCount
366390 bs' <- B.get
367391 put B.empty
368− return (S (bs`append`bs') o bo, ())
369−
370−-- | Test whether all input has been consumed, i.e. there are no remaining
371−-- undecoded bytes.
372−isEmpty :: BitGet Bool
373−isEmpty = B $ \ (S bs o bo) -> if B.null bs
374− then B.isEmpty >>= \e -> return (S bs o bo, e)
375− else return (S bs o bo, False)
392+ return (S (bs`append`bs') o, ())
376393
377394-- | Get 1 bit as a 'Bool'.
378395getBool :: BitGet Bool
379396getBool = block bool
380397
381−-- | Get 1 bit as a 'Bool'.
382−getBool# :: BitGet Int
383−getBool# = block bool#
384−
385398-- | Get @n@ bits as a 'Word8'. @n@ must be within @[0..8]@.
386399getWord8 :: Int -> BitGet Word8
387400getWord8 n = block (word8 n)
388401
389402-- | Get @n@ bits as a 'Word16'. @n@ must be within @[0..16]@.
390−getWord16 :: Int -> BitGet Word16
391−getWord16 n = block (word16 n)
392−
393403getWord16be :: Int -> BitGet Word16
394−getWord16be = getWord16
395−{-# DEPRECATED getWord16be "Use 'getWord16' instead" #-}
404+getWord16be n = block (word16be n)
396405
397406-- | Get @n@ bits as a 'Word32'. @n@ must be within @[0..32]@.
398−getWord32 :: Int -> BitGet Word32
399−getWord32 n = block (word32 n)
400−
401407getWord32be :: Int -> BitGet Word32
402−getWord32be = getWord32
403−{-# DEPRECATED getWord32be "Use 'getWord32' instead" #-}
408+getWord32be n = block (word32be n)
404409
405410-- | Get @n@ bits as a 'Word64'. @n@ must be within @[0..64]@.
406−getWord64 :: Int -> BitGet Word64
407−getWord64 n = block (word64 n)
408−
409411getWord64be :: Int -> BitGet Word64
410−getWord64be = getWord64
411−{-# DEPRECATED getWord64be "Use 'getWord64' instead" #-}
412+getWord64be n = block (word64be n)
412413
413414-- | Get @n@ bytes as a 'ByteString'.
414415getByteString :: Int -> BitGet ByteString
415416getByteString n = block (byteString n)
416417
417−-- | Get @n@ bytes as a lazy ByteString.
418418getLazyByteString :: Int -> BitGet L.ByteString
419−getLazyByteString n = do
420− (S _ o bo) <- getState
421− case o of
422− 0 -> B $ \s -> do
423− putBackState s
424− lbs <- B.getLazyByteString (fromIntegral n)
425− return (S B.empty 0 bo, lbs)
426− _ -> L.fromChunks . (:[]) <$> Data.Binary.Bits.Get.getByteString n
427−
428−
429−
430−
431−
432−-- | A block that will be read with only one boundary check. Needs to know the
433−-- number of bits in advance.
434−data Block a = Block Int (S -> a)
435−
436−instance Functor Block where
437− fmap f (Block i p) = Block i (\s -> f (p s))
438−
439−instance Applicative Block where
440− pure a = Block 0 (\_ -> a)
441− (Block i p) <*> (Block j q) = Block (i+j) (\s -> p s $ q (incS i s))
442− (Block i _) *> (Block j q) = Block (i+j) (q . incS i)
443− (Block i p) <* (Block j _) = Block (i+j) p
444−
445−-- | Get a block. Will be read with one single boundry check, and
446−-- therefore requires a statically known number of bits.
447−-- Build blocks using 'bool', 'word8', 'word16be', 'word32be', 'word64be',
448−-- 'byteString' and 'Applicative'.
449−block :: Block a -> BitGet a
450−block (Block i p) = do
451− ensureBits i
452− s <- getState
453− putState $! (incS i s)
454− return $! p s
419+getLazyByteString m = B $ \ (S n bs) -> do
420+ putBackState n bs
421+ lbs <- B.getLazyByteString (fromIntegral m)
422+ return (S B.empty 0, lbs)
455423
456424-- | Read a 1 bit 'Bool'.
457425bool :: Block Bool
458426bool = Block 1 readBool
459427
460−-- | Read a 1 bit 'Bool'.
461−bool# :: Block Int
462−bool# = Block 1 readBool#
463−
464428-- | Read @n@ bits as a 'Word8'. @n@ must be within @[0..8]@.
465429word8 :: Int -> Block Word8
466−word8 n = Block n (readWordChecked 8 n)
430+word8 n = Block n (readWord8 n)
467431
468432-- | Read @n@ bits as a 'Word16'. @n@ must be within @[0..16]@.
469−word16 :: Int -> Block Word16
470−word16 n = Block n (readWordChecked 16 n)
471−
472433word16be :: Int -> Block Word16
473−word16be = word16
474−{-# DEPRECATED word16be "Use 'word16' instead" #-}
434+word16be n = Block n (readWord16be n)
475435
476436-- | Read @n@ bits as a 'Word32'. @n@ must be within @[0..32]@.
477−word32 :: Int -> Block Word32
478−word32 n = Block n (readWordChecked 32 n)
479−
480437word32be :: Int -> Block Word32
481−word32be = word32
482−{-# DEPRECATED word32be "Use 'word32' instead" #-}
438+word32be n = Block n (readWord32be n)
483439
484440-- | Read @n@ bits as a 'Word64'. @n@ must be within @[0..64]@.
485−word64 :: Int -> Block Word64
486−word64 n = Block n (readWordChecked 64 n)
487−
488441word64be :: Int -> Block Word64
489−word64be = word64
490−{-# DEPRECATED word64be "Use 'word64' instead" #-}
442+word64be n = Block n (readWord64be n)
491443
492444-- | Read @n@ bytes as a 'ByteString'.
493445byteString :: Int -> Block ByteString
494446byteString n | n > 0 = Block (n*8) (readByteString n)
495447 | otherwise = Block 0 (\_ -> B.empty)
496448
449+------------------------------------------------------------------------
450+-- Unchecked shifts, from the package binary
451+
452+shiftl_w16 :: Word16 -> Int -> Word16
453+shiftl_w32 :: Word32 -> Int -> Word32
454+shiftl_w64 :: Word64 -> Int -> Word64
455+
456+#if defined(__GLASGOW_HASKELL__) && !defined(__HADDOCK__)
457+shiftl_w8 (W8# w) (I# i) = W8# (w `uncheckedShiftL#` i)
458+shiftl_w16 (W16# w) (I# i) = W16# (w `uncheckedShiftL#` i)
459+shiftl_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftL#` i)
460+
461+shiftr_w8 (W8# w) (I# i) = W8# (w `uncheckedShiftRL#` i)
462+shiftr_w16 (W16# w) (I# i) = W16# (w `uncheckedShiftRL#` i)
463+shiftr_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftRL#` i)
464+
465+
466+#if WORD_SIZE_IN_BITS < 64
467+shiftl_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftL64#` i)
468+shiftr_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftRL64#` i)
469+
470+#if __GLASGOW_HASKELL__ <= 606
471+-- Exported by GHC.Word in GHC 6.8 and higher
472+foreign import ccall unsafe "stg_uncheckedShiftL64"
473+ uncheckedShiftL64# :: Word64# -> Int# -> Word64#
474+foreign import ccall unsafe "stg_uncheckedShiftRL64"
475+ uncheckedShiftRL64# :: Word64# -> Int# -> Word64#
476+#endif
477+
478+#else
479+shiftl_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftL#` i)
480+shiftr_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftRL#` i)
481+#endif
482+
483+#else
484+shiftl_w8 = shiftL
485+shiftl_w16 = shiftL
486+shiftl_w32 = shiftL
487+shiftl_w64 = shiftL
488+
489+shiftr_w8 = shiftR
490+shiftr_w16 = shiftR
491+shiftr_w32 = shiftR
492+shiftr_w64 = shiftR
493+#endif