@@ -1,292 +1,233 @@
11{-# LANGUAGE RankNTypes, MagicHash, BangPatterns, CPP #-}
22
3−-----------------------------------------------------------------------------
4−-- |
5−-- Module : Data.Binary.Bits.Get
6−-- Copyright : (c) Lennart Kolmodin 2010-2011
7−-- (c) Sylvain Henry 2015
8−-- License : BSD3-style (see LICENSE)
9−--
10−-- Maintainer : kolmodin@gmail.com
11−-- Stability : experimental
12−-- Portability : portable (should run where the package binary runs)
13−--
14−-- Parse bits easily. Parsing can be done either in a monadic style, or more
15−-- efficiently, using the 'Applicative' style.
16−--
17−-- For the monadic style, write your parser as a 'BitGet' monad using the
18−--
19−-- * 'getBool'
20−--
21−-- * 'getWord8'
22−--
23−-- * 'getWord16be'
24−--
25−-- * 'getWord32be'
26−--
27−-- * 'getWord64be'
28−--
29−-- * 'getByteString'
30−--
31−-- functions and run it with 'runBitGet'.
32−--
33−-- For the applicative style, compose the fuctions
34−--
35−-- * 'bool'
36−--
37−-- * 'word8'
38−--
39−-- * 'word16be'
40−--
41−-- * 'word32be'
42−--
43−-- * 'word64be'
44−--
45−-- * 'byteString'
46−--
47−-- to make a 'Block'.
48−-- Use 'block' to turn it into the 'BitGet' monad to be able to run it with
49−-- 'runBitGet'.
50−-----------------------------------------------------------------------------
51−
523module Data.Binary.Bits.Get
53− (
54− -- * BitGet monad
55−
56− -- $bitget
57−
58− BitGet
4+ ( BitGet
595 , runBitGet
606
61− -- ** Get bytes
627 , getBool
63− , getBool#
648 , getWord8
65− , getWord16
66− , getWord32
67− , getWord64
689 , getWord16be
6910 , getWord32be
7011 , getWord64be
7112
72− -- ** Skip bits
73− , skipBits
74− , alignByte
75−
76− -- * Blocks
77−
78− -- $blocks
79− , Block
80− , block
81−
82− -- ** Read in Blocks
8313 , bool
8414 , word8
85− , word16
86− , word32
87− , word64
8815 , word16be
8916 , word32be
9017 , word64be
91− , byteString
92− , Data.Binary.Bits.Get.getByteString
93− , Data.Binary.Bits.Get.getLazyByteString
94− , Data.Binary.Bits.Get.isEmpty
9518
19+ , block
20+
21+ , Data.Binary.Bits.Get.getByteString
9622 ) where
9723
98−import Data.Binary.Get as B ( Get, getLazyByteString, isEmpty )
99−import 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
24+import Data.Binary.Get as B ( runGet, Get, getByteString )
10325
10426import Data.ByteString as B
105−import qualified Data.ByteString.Lazy as L
27+import Data.ByteString.Internal
10628import Data.ByteString.Unsafe
107−import Foreign.Marshal.Alloc (mallocBytes)
108−import Foreign.Ptr
109−import Foreign.Storable (poke)
110−import System.IO.Unsafe (unsafePerformIO)
29+
30+import qualified Data.ByteString.Lazy as L
11131
11232import Data.Bits
11333import Data.Word
34+import Data.List as List ( reverse )
35+
11436import Control.Applicative
115−import Control.Monad (when,foldM_)
11637
11738import Prelude as P
39+
40+#if defined(__GLASGOW_HASKELL__) && !defined(__HADDOCK__)
41+import GHC.Base
11842import GHC.Word
119−import GHC.Base (uncheckedShiftLWord8#, wordToWord8#, Int (..), andWord8#, Word8#, (-#), Int#, xorI#, eqWord8#, TYPE)
120−
121−-- $bitget
122−-- Parse bits using a monad.
123−--
124−-- @
125−--myBitParser :: 'Get' ('Word8', 'Word8')
126−--myBitParser = 'runGetBit' parse4by4
127−--
128−--parse4by4 :: 'BitGet' ('Word8', 'Word8')
129−--parse4by4 = do
130−-- bits <- 'getWord8' 4
131−-- more <- 'getWord8' 4
132−-- return (bits,more)
133−-- @
134−
135−-- $blocks
136−-- Parse more efficiently in blocks. Each block is read with only one boundry
137−-- check (checking that there is enough input) as the size of the block can be
138−-- calculated statically. This is somewhat limiting as you cannot make the
139−-- parsing depend on the input being parsed.
140−--
141−-- @
142−--data IPV6Header = IPV6Header {
143−-- ipv6Version :: 'Word8'
144−-- , ipv6TrafficClass :: 'Word8'
145−-- , ipv6FlowLabel :: 'Word32
146−-- , ipv6PayloadLength :: 'Word16'
147−-- , ipv6NextHeader :: 'Word8'
148−-- , ipv6HopLimit :: 'Word8'
149−-- , ipv6SourceAddress :: 'ByteString'
150−-- , ipv6DestinationAddress :: 'ByteString'
151−-- }
152−--
153−-- ipv6headerblock =
154−-- IPV6Header '<$>' 'word8' 4
155−-- '<*>' 'word8' 8
156−-- '<*>' 'word32be' 24
157−-- '<*>' 'word16be' 16
158−-- '<*>' 'word8' 8
159−-- '<*>' 'word8' 8
160−-- '<*>' 'byteString' 16
161−-- '<*>' 'byteString' 16
162−--
163−--ipv6Header :: 'Get' IPV6Header
164−--ipv6Header = 'runBitGet' ('block' ipv6headerblock)
165−-- @
166−
167−data S = S {-# UNPACK #-} !ByteString -- Input
168− {-# UNPACK #-} !Int -- Bit offset (0-7)
169− !BitOrder -- Bit order
43+import GHC.Int
44+#endif
45+
46+data T a b = !a :*: !b deriving (Show)
47+
48+data S = S !ByteString -- ^ Input
49+ !Int -- ^ Bit offset (0-7)
17050 deriving (Show)
17151
172−-- | Increment the current bit offset
173−incS :: 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'
52+-- | A block that will be read with only one boundry check.
53+data Block a = Block Int (S -> a)
54+
55+instance Functor Block where
56+ fmap f (Block i p) = Block i (\s -> f (p s))
57+
58+instance Applicative Block where
59+ pure a = Block 0 (\_ -> a)
60+ (Block i p) <*> (Block j q) = Block (i+j) (\s -> p s $ q (incS i s))
61+ (Block i _) *> (Block j q) = Block (i+j) (q . incS i)
62+ (Block i p) <* (Block j _) = Block (i+j) p
63+
64+block :: Block a -> BitGet a
65+block (Block i p) = do
66+ ensureBits i
67+ modifyState (\s -> (incS i s, p s))
68+
69+-- | make_mask 3 = 00000111
70+make_mask :: Bits a => Int -> a
71+make_mask n = (1 `shiftL` fromIntegral n) - 1
72+{-# SPECIALIZE make_mask :: Int -> Int #-}
73+{-# SPECIALIZE make_mask :: Int -> Word #-}
74+{-# SPECIALIZE make_mask :: Int -> Word8 #-}
75+{-# SPECIALIZE make_mask :: Int -> Word16 #-}
76+{-# SPECIALIZE make_mask :: Int -> Word32 #-}
77+{-# SPECIALIZE make_mask :: Int -> Word64 #-}
17978
180−-- | Read a single bit
18179readBool :: 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
80+readBool (S bs n) = testBit (unsafeHead bs) (7-n)
81+
82+incS :: Int -> S -> S
83+incS o (S bs n) =
84+ let !o' = (n+o)
85+ !d = o' `shiftR` 3
86+ !n' = o' .&. make_mask 3
87+ in S (unsafeDrop d bs) n'
88+
25589readByteString :: 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)
90+readByteString n s@(S bs o)
91+ -- no offset, easy.
92+ | o == 0 = unsafeTake n bs
93+ -- offset. ugg. this is really naive and slow. but also pretty easy :)
94+ | otherwise = B.pack (P.map (readWord8 8) (P.take n (iterate (incS 8) s)))
95+
96+readWord8 :: Int -> S -> Word8
97+readWord8 n s@(S bs o)
98+ -- no bits at all, return 0
99+ | n == 0 = 0
100+
101+ -- all bits are in the same byte
102+ -- we just need to shift and mask them right
103+ | n <= 8 - o = let w = unsafeHead bs
104+ m = make_mask n
105+ w' = (w `shiftr_w8` (8 - o - n)) .&. m
106+ in w'
107+
108+ -- the bits are in two different bytes
109+ -- make a word16 using both bytes, and then shift and mask
110+ | n <= 8 = let w = (fromIntegral (unsafeHead bs) `shiftl_w16` 8) .|.
111+ (fromIntegral (unsafeIndex bs 1))
112+ m = make_mask n
113+ w' = (w `shiftr_w16` (16 - o - n)) .&. m
114+ in fromIntegral w'
115+
116+bit_offset :: Int -> Int
117+bit_offset n = make_mask 3 .&. n
118+
119+byte_offset :: Int -> Int
120+byte_offset n = n `shiftR` 3
121+
122+readWord16be :: Int -> S -> Word16
123+readWord16be n s@(S bs o)
124+
125+ -- 8 or fewer bits, use readWord8
126+ | n <= 8 = fromIntegral (readWord8 n s)
127+
128+ -- handle 9 or more bits, stored in two bytes
129+
130+ -- no offset, plain and simple 16 bytes
131+ | o == 0 && n == 16 = let msb = fromIntegral (unsafeHead bs)
132+ lsb = fromIntegral (unsafeIndex bs 1)
133+ w = (msb `shiftl_w16` 8) .|. lsb
134+ in w
135+
136+ -- no offset, but not full 16 bytes
137+ | o == 0 = let msb = fromIntegral (unsafeHead bs)
138+ lsb = fromIntegral (unsafeIndex bs 1)
139+ w = (msb `shiftl_w16` (n-8)) .|. (lsb `shiftr_w16` (16-n))
140+ in w
141+
142+ -- with offset, and n=9-16
143+ | n <= 16 = readWithOffset s shiftl_w16 shiftr_w16 n
144+
145+ | otherwise = error "readWord16be: tried to read more than 16 bits"
146+
147+readWithoutOffset :: (Bits a, Num a)
148+ => S -> (a -> Int -> a) -> (a -> Int -> a) -> Int -> a
149+readWithoutOffset s@(S bs o) shifterL shifterR n
150+ | o /= 0 = error "readWithoutOffset: there is an offset"
151+
152+ | bit_offset n == 0 && byte_offset n <= 4 =
153+ let segs = byte_offset n
154+ bn 0 = fromIntegral (unsafeHead bs)
155+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
156+
157+ in bn (segs-1)
158+
159+ | n <= 64 = let segs = byte_offset n
160+ o' = bit_offset (n - 8 + o)
161+
162+ bn 0 = fromIntegral (unsafeHead bs)
163+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
164+
165+ msegs = bn (segs-1) `shifterL` o'
166+
167+ last = (fromIntegral (unsafeIndex bs segs)) `shifterR` (8 - o')
168+
169+ w = msegs .|. last
170+ in w
171+
172+readWithOffset :: (Bits a, Num a)
173+ => S -> (a -> Int -> a) -> (a -> Int -> a) -> Int -> a
174+readWithOffset s@(S bs o) shifterL shifterR n
175+ | n <= 64 = let bits_in_msb = 8 - o
176+ (n',top) = (n - bits_in_msb
177+ , (fromIntegral (unsafeHead bs) .&. make_mask bits_in_msb) `shifterL` n')
178+
179+ segs = byte_offset n'
180+
181+ bn 0 = 0
182+ bn n = (bn (n-1) `shifterL` 8) .|. fromIntegral (unsafeIndex bs n)
281183
184+ o' = bit_offset n'
185+
186+ mseg = bn segs `shifterL` o'
187+
188+ last | o' > 0 = (fromIntegral (unsafeIndex bs (segs + 1))) `shifterR` (8 - o')
189+ | otherwise = 0
190+
191+ w = top .|. mseg .|. last
192+ in w
193+
194+
195+readWord32be :: Int -> S -> Word32
196+readWord32be n s@(S bs o)
197+ -- 8 or fewer bits, use readWord8
198+ | n <= 8 = fromIntegral (readWord8 n s)
199+
200+ -- 16 or fewer bits, use readWord16be
201+ | n <= 16 = fromIntegral (readWord16be n s)
202+
203+ | o == 0 = readWithoutOffset s shiftl_w32 shiftr_w32 n
204+
205+ | n <= 32 = readWithOffset s shiftl_w32 shiftr_w32 n
206+
207+ | otherwise = error "readWord32be: tried to read more than 32 bits"
208+
209+
210+readWord64be :: Int -> S -> Word64
211+readWord64be n s@(S bs o)
212+ -- 8 or fewer bits, use readWord8
213+ | n <= 8 = fromIntegral (readWord8 n s)
214+
215+ -- 16 or fewer bits, use readWord16be
216+ | n <= 16 = fromIntegral (readWord16be n s)
217+
218+ | o == 0 = readWithoutOffset s shiftl_w64 shiftr_w64 n
219+
220+ | n <= 64 = readWithOffset s shiftl_w64 shiftr_w64 n
221+
222+ | otherwise = error "readWord64be: tried to read more than 64 bits"
282223
283224------------------------------------------------------------------------
284−-- | 'BitGet' is a monad, applicative and a functor. See 'runBitGet'
285−-- for how to run it.
225+-- unrolled codensity/state monad
286226newtype BitGet a = B { runState :: S -> Get (S,a) }
287227
288228instance Monad BitGet where
289229 return x = B $ \s -> return (s,x)
230+ fail str = B $ \_s -> fail str
290231 (B f) >>= g = B $ \s -> do (s',a) <- f s
291232 runState (g a) s'
292233
@@ -297,200 +238,192 @@ instance Applicative BitGet where
297238 pure x = return x
298239 fm <*> m = fm >>= \f -> m >>= \v -> return (f v)
299240
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−
323−-- | Run a 'BitGet' within the Binary packages 'Get' monad. If a byte has
324−-- been partially consumed it will be discarded once 'runBitGet' is finished.
325241runBitGet :: BitGet a -> Get a
326242runBitGet bg = do
327− s <- mkInitState
328− (s',a) <- runState bg s
329− putBackState s'
243+ (_,a) <- runState bg (S B.empty 0)
330244 return a
331245
332−mkInitState :: Get S
333−mkInitState = do
334− bs <- get
335− put B.empty
336− return (S bs 0 BB)
337−
338−putBackState :: S -> Get ()
339−putBackState (S bs o _) = do
340− remaining <- get
341− let bs' = case o of
342− 0 -> bs
343− _ -> unsafeDrop 1 bs
344− put (bs' `B.append` remaining)
345−
346246getState :: BitGet S
347247getState = B $ \s -> return (s,s)
348248
349249putState :: S -> BitGet ()
350250putState s = B $ \_ -> return (s,())
351251
352−withState :: (S -> S) -> BitGet ()
353−withState f = do
354− s <- getState
355− putState $! f s
252+modifyState :: (S -> (S,a)) -> BitGet a
253+modifyState f = B $ \s -> return (f s)
356254
357255-- | Make sure there are at least @n@ bits.
358256ensureBits :: Int -> BitGet ()
359257ensureBits n = do
360− (S bs o bo) <- getState
258+ s@(S bs o) <- getState
361259 if n <= (B.length bs * 8 - o)
362260 then return ()
363261 else do let currentBits = B.length bs * 8 - o
364− let byteCount = byte_offset (n - currentBits + 7)
365− B $ \_ -> do B.ensureN byteCount
366− bs' <- B.get
367− 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)
376−
377−-- | Get 1 bit as a 'Bool'.
262+ let byteCount = (n - currentBits + 7) `div` 8
263+ B $ \s -> do bs' <- B.getByteString byteCount
264+ return (S (bs`append`bs') o, ())
265+
378266getBool :: BitGet Bool
379267getBool = block bool
380268
381−-- | Get 1 bit as a 'Bool'.
382−getBool# :: BitGet Int
383−getBool# = block bool#
384−
385−-- | Get @n@ bits as a 'Word8'. @n@ must be within @[0..8]@.
386269getWord8 :: Int -> BitGet Word8
387270getWord8 n = block (word8 n)
388271
389−-- | Get @n@ bits as a 'Word16'. @n@ must be within @[0..16]@.
390−getWord16 :: Int -> BitGet Word16
391−getWord16 n = block (word16 n)
392−
393272getWord16be :: Int -> BitGet Word16
394−getWord16be = getWord16
395−{-# DEPRECATED getWord16be "Use 'getWord16' instead" #-}
396−
397−-- | Get @n@ bits as a 'Word32'. @n@ must be within @[0..32]@.
398−getWord32 :: Int -> BitGet Word32
399−getWord32 n = block (word32 n)
273+getWord16be n = block (word16be n)
400274
401275getWord32be :: Int -> BitGet Word32
402−getWord32be = getWord32
403−{-# DEPRECATED getWord32be "Use 'getWord32' instead" #-}
404−
405−-- | Get @n@ bits as a 'Word64'. @n@ must be within @[0..64]@.
406−getWord64 :: Int -> BitGet Word64
407−getWord64 n = block (word64 n)
276+getWord32be n = block (word32be n)
408277
409278getWord64be :: Int -> BitGet Word64
410−getWord64be = getWord64
411−{-# DEPRECATED getWord64be "Use 'getWord64' instead" #-}
279+getWord64be n = block (word64be n)
412280
413−-- | Get @n@ bytes as a 'ByteString'.
414281getByteString :: Int -> BitGet ByteString
415282getByteString n = block (byteString n)
416283
417−-- | Get @n@ bytes as a lazy ByteString.
418−getLazyByteString :: 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
455−
456−-- | Read a 1 bit 'Bool'.
457284bool :: Block Bool
458285bool = Block 1 readBool
459286
460−-- | Read a 1 bit 'Bool'.
461−bool# :: Block Int
462−bool# = Block 1 readBool#
463−
464−-- | Read @n@ bits as a 'Word8'. @n@ must be within @[0..8]@.
465287word8 :: Int -> Block Word8
466−word8 n = Block n (readWordChecked 8 n)
467−
468−-- | 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)
288+word8 n = Block n (readWord8 n)
471289
472290word16be :: Int -> Block Word16
473−word16be = word16
474−{-# DEPRECATED word16be "Use 'word16' instead" #-}
475−
476−-- | 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)
291+word16be n = Block n (readWord16be n)
479292
480293word32be :: Int -> Block Word32
481−word32be = word32
482−{-# DEPRECATED word32be "Use 'word32' instead" #-}
483−
484−-- | 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)
294+word32be n = Block n (readWord32be n)
487295
488296word64be :: Int -> Block Word64
489−word64be = word64
490−{-# DEPRECATED word64be "Use 'word64' instead" #-}
297+word64be n = Block n (readWord64be n)
491298
492−-- | Read @n@ bytes as a 'ByteString'.
493299byteString :: Int -> Block ByteString
494−byteString n | n > 0 = Block (n*8) (readByteString n)
495− | otherwise = Block 0 (\_ -> B.empty)
300+byteString n = Block (n*8) (readByteString n)
301+
302+------------------------------------------------------------------------
303+-- Unchecked shifts, from the package binary
304+
305+shiftl_w16 :: Word16 -> Int -> Word16
306+shiftl_w32 :: Word32 -> Int -> Word32
307+shiftl_w64 :: Word64 -> Int -> Word64
308+
309+#if defined(__GLASGOW_HASKELL__) && !defined(__HADDOCK__)
310+shiftl_w8 (W8# w) (I# i) = W8# (w `uncheckedShiftL#` i)
311+shiftl_w16 (W16# w) (I# i) = W16# (w `uncheckedShiftL#` i)
312+shiftl_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftL#` i)
313+
314+shiftr_w8 (W8# w) (I# i) = W8# (w `uncheckedShiftRL#` i)
315+shiftr_w16 (W16# w) (I# i) = W16# (w `uncheckedShiftRL#` i)
316+shiftr_w32 (W32# w) (I# i) = W32# (w `uncheckedShiftRL#` i)
317+
318+
319+#if WORD_SIZE_IN_BITS < 64
320+shiftl_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftL64#` i)
321+shiftr_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftRL64#` i)
322+
323+#if __GLASGOW_HASKELL__ <= 606
324+-- Exported by GHC.Word in GHC 6.8 and higher
325+foreign import ccall unsafe "stg_uncheckedShiftL64"
326+ uncheckedShiftL64# :: Word64# -> Int# -> Word64#
327+foreign import ccall unsafe "stg_uncheckedShiftRL64"
328+ uncheckedShiftRL64# :: Word64# -> Int# -> Word64#
329+#endif
330+
331+#else
332+shiftl_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftL#` i)
333+shiftr_w64 (W64# w) (I# i) = W64# (w `uncheckedShiftRL#` i)
334+#endif
335+
336+#else
337+shiftl_w8 = shiftL
338+shiftl_w16 = shiftL
339+shiftl_w32 = shiftL
340+shiftl_w64 = shiftL
341+
342+shiftr_w8 = shiftR
343+shiftr_w16 = shiftR
344+shiftr_w32 = shiftR
345+shiftr_w64 = shiftR
346+#endif
347+
348+{-
349+data R a where
350+ RBool :: R Bool
351+ RWord8 :: Int -> R Word8
352+ RWord16be :: Int -> R Word16
353+ RWord32be :: Int -> R Word32
354+ RByteString :: Int -> R ByteString
355+ RThis :: a -> R a
356+ RNextTo :: R a -> R b -> R (T a b)
357+ RMap :: R b -> (b -> R a) -> R a
358+ RMapPure :: R a -> (a -> b) -> R b
359+ RList :: Int -> R a -> R [a]
360+ RCheck :: R a -> (a -> Bool) -> String -> R a
361+
362+instance Functor R where
363+ fmap f m = RMapPure m f
364+
365+instance Show (R a) where
366+ show r = case r of
367+ RBool -> "Bool"
368+
369+size_in_bits :: forall a. R a -- ^ The record
370+ -> Int -- ^ Number of bits
371+size_in_bits r = case r of
372+ RBool -> 1
373+ RWord8 n -> min n 8
374+ RWord16be n -> min n 16
375+ RWord32be n -> min n 16
376+ RByteString n -> 8 * n
377+ RThis _ -> 0
378+ RList n r -> n * size_in_bits r
379+ RMap r _ -> size_in_bits r
380+ RMapPure r _ -> size_in_bits r
381+ RCheck r _ _ -> size_in_bits r
382+ RNextTo a b -> size_in_bits a + size_in_bits b
383+
384+size_in_bytes :: forall a. R a
385+ -> Int
386+size_in_bytes r = byte_offset (size_in_bits r + 7)
387+
388+get :: R a -> Get a
389+get r = do
390+ bs <- getByteString (size_in_bytes r)
391+ a :*: s <- getR (S bs 0) r
392+ return a
393+
394+getR :: S -> R a -> Get (T a S)
395+getR s0 r = do
396+ case r of
397+ RBool -> return (readBool s0)
398+ RWord8 n -> return (readWord8 s0 n)
399+ RWord16be n -> return (readWord16be s0 n)
400+ RWord32be n -> return (readWord32be s0 n)
401+ RByteString n -> return (readByteString s0 n)
402+ RThis x -> return (x :*: s0)
403+ RNextTo a b -> do
404+ t :*: s <- getR s0 a
405+ u :*: s' <- getR s b
406+ return (t:*:u:*:s')
407+ RMap r p -> do
408+ a :*: s@(S bs o) <- getR s0 r
409+ let codepath = p a
410+ required_bytes = byte_offset (size_in_bits r - o)
411+ bs' <- getByteString required_bytes
412+ getR (S (bs `append` bs') o) codepath
413+ RMapPure r f -> do
414+ a :*: s <- getR s0 r
415+ return (f a :*: s)
416+ RList n r ->
417+ let loop 0 s acc = return (List.reverse acc :*: s)
418+ loop m s acc = do
419+ a :*: s' <- getR s r
420+ loop (m-1) s' (a:acc)
421+ in loop n s0 []
422+ RCheck r c m -> do
423+ a :*: s <- getR s0 r
424+ if c a
425+ then return (a :*: s)
426+ else fail m
427+-}
428+
496429