{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE MultiParamTypeClasses #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE ViewPatterns #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Data.Vector.Unboxed.Bit.Internal
( Bit
, U.Vector(BitVec)
, U.MVector(BitMVec)
, padWith
, pad
, indexWord
, readWord
, writeWord
, cloneWords
) where
import Control.Monad
import Control.Monad.ST
import Control.Monad.Primitive
import Data.Bit.Internal
import Data.Bits
import qualified Data.Vector.Generic as V
import qualified Data.Vector.Generic.Mutable as MV
import qualified Data.Vector.Unboxed as U
data instance U.MVector s Bit = BitMVec !Int !Int !(U.MVector s Word)
data instance U.Vector Bit = BitVec !Int !Int !(U.Vector Word)
indexWord :: U.Vector Bit -> Int -> Word
indexWord (BitVec 0 n v) i
| aligned i = masked b lo
| j + 1 == nWords n = masked b (extractWord k lo 0 )
| otherwise = masked b (extractWord k lo hi)
where
b = n - i
j = divWordSize i
k = modWordSize i
lo = v V.! j
hi = v V.! (j+1)
indexWord (BitVec s n v) i = indexWord (BitVec 0 (n + s) v) (i + s)
readWord :: PrimMonad m => U.MVector (PrimState m) Bit -> Int -> m Word
readWord (BitMVec 0 n v) i
| aligned i = liftM (masked b) lo
| j + 1 == nWords n = liftM (masked b) (liftM2 (extractWord k) lo (return 0))
| otherwise = liftM (masked b) (liftM2 (extractWord k) lo hi)
where
b = n - i
j = divWordSize i
k = modWordSize i
lo = MV.read v j
hi = MV.read v (j+1)
readWord (BitMVec s n v) i = readWord (BitMVec 0 (n + s) v) (i + s)
writeWord :: PrimMonad m => U.MVector (PrimState m) Bit -> Int -> Word -> m ()
writeWord (BitMVec 0 n v) i x
| aligned i =
if b < wordSize
then do
y <- MV.read v j
MV.write v j (meld b x y)
else MV.write v j x
| j + 1 == nWords n = do
lo <- MV.read v j
let x' = if b < wordSize
then meld b x (extractWord k lo 0)
else x
(lo', _hi) = spliceWord k lo 0 x'
MV.write v j lo'
| otherwise = do
lo <- MV.read v j
hi <- if j + 1 == nWords n
then return 0
else MV.read v (j+1)
let x' = if b < wordSize
then meld b x (extractWord k lo hi)
else x
(lo', hi') = spliceWord k lo hi x'
MV.write v j lo'
MV.write v (j+1) hi'
where
b = n - i
j = divWordSize i
k = modWordSize i
writeWord (BitMVec s n v) i x = writeWord (BitMVec 0 (n + s) v) (i + s) x
{-# INLINE cloneWords #-}
cloneWords :: PrimMonad m => U.MVector (PrimState m) Bit -> m (U.MVector (PrimState m) Word)
cloneWords v@(BitMVec _ n _) = do
ws <- MV.new (nWords n)
let loop !i !j
| i >= n = return ()
| otherwise = do
readWord v i >>= MV.write ws j
loop (i + wordSize) (j + 1)
loop 0 0
return ws
instance U.Unbox Bit
loMask :: Int -> Word
loMask n = 1 `shiftL` n - 1
hiMask :: Int -> Word
hiMask n = complement (1 `shiftL` n - 1)
instance MV.MVector U.MVector Bit where
{-# INLINE basicInitialize #-}
basicInitialize (BitMVec _ 0 _) = pure ()
basicInitialize (BitMVec 0 n v) = case modWordSize n of
0 -> MV.basicInitialize v
nMod -> do
let vLen = MV.basicLength v
MV.basicInitialize (MV.slice 0 (vLen - 1) v)
MV.modify v (\val -> val .&. hiMask nMod) (vLen - 1)
basicInitialize (BitMVec s n v) = case modWordSize (s + n) of
0 -> do
let vLen = MV.basicLength v
MV.basicInitialize (MV.slice 1 (vLen - 1) v)
MV.modify v (\val -> val .&. loMask s) 0
nMod -> do
let vLen = MV.basicLength v
lohiMask = loMask s .|. hiMask nMod
if vLen == 1
then MV.modify v (\val -> val .&. lohiMask) 0
else do
MV.basicInitialize (MV.slice 1 (vLen - 2) v)
MV.modify v (\val -> val .&. loMask s) 0
MV.modify v (\val -> val .&. hiMask nMod) (vLen - 1)
{-# INLINE basicUnsafeNew #-}
basicUnsafeNew n = liftM (BitMVec 0 n) (MV.basicUnsafeNew (nWords n))
{-# INLINE basicUnsafeReplicate #-}
basicUnsafeReplicate n x = liftM (BitMVec 0 n) (MV.basicUnsafeReplicate (nWords n) (extendToWord x))
{-# INLINE basicOverlaps #-}
basicOverlaps (BitMVec _ _ v1) (BitMVec _ _ v2) = MV.basicOverlaps v1 v2
{-# INLINE basicLength #-}
basicLength (BitMVec _ n _) = n
{-# INLINE basicUnsafeRead #-}
basicUnsafeRead (BitMVec s _ v) !i' = let i = s + i' in liftM (readBit (modWordSize i)) (MV.basicUnsafeRead v (divWordSize i))
{-# INLINE basicUnsafeWrite #-}
basicUnsafeWrite (BitMVec s _ v) !i' !x = do
let i = s + i'
let j = divWordSize i; k = modWordSize i; kk = 1 `unsafeShiftL` k
w <- MV.basicUnsafeRead v j
when (fromBool (w .&. kk /= 0) /= x) $
MV.basicUnsafeWrite v j (w `xor` kk)
{-# INLINE basicClear #-}
basicClear _ = pure ()
{-# INLINE basicSet #-}
basicSet (BitMVec _ 0 _) _ = pure ()
basicSet (BitMVec 0 n v) (extendToWord -> x) = case modWordSize n of
0 -> MV.basicSet v x
nMod -> do
let vLen = MV.basicLength v
MV.basicSet (MV.slice 0 (vLen - 1) v) x
MV.modify v (\val -> val .&. hiMask nMod .|. x .&. loMask nMod) (vLen - 1)
basicSet (BitMVec s n v) (extendToWord -> x) = case modWordSize (s + n) of
0 -> do
let vLen = MV.basicLength v
MV.basicSet (MV.slice 1 (vLen - 1) v) x
MV.modify v (\val -> val .&. loMask s .|. x .&. hiMask s) 0
nMod -> do
let vLen = MV.basicLength v
lohiMask = loMask s .|. hiMask nMod
if vLen == 1
then MV.modify v (\val -> val .&. lohiMask .|. x .&. complement lohiMask) 0
else do
MV.basicSet (MV.slice 1 (vLen - 2) v) x
MV.modify v (\val -> val .&. loMask s .|. x .&. hiMask s) 0
MV.modify v (\val -> val .&. hiMask nMod .|. x .&. loMask nMod) (vLen - 1)
{-# INLINE basicUnsafeCopy #-}
basicUnsafeCopy _ (BitMVec _ 0 _) = pure ()
basicUnsafeCopy (BitMVec 0 _ dst) (BitMVec 0 n src) = case modWordSize n of
0 -> MV.basicUnsafeCopy dst src
nMod -> do
let vLen = MV.basicLength src
MV.basicUnsafeCopy (MV.slice 0 (vLen - 1) dst) (MV.slice 0 (vLen - 1) src)
valSrc <- MV.basicUnsafeRead src (vLen - 1)
MV.modify dst (\val -> val .&. hiMask nMod .|. valSrc .&. loMask nMod) (vLen - 1)
basicUnsafeCopy (BitMVec dstShift _ dst) (BitMVec s n src)
| dstShift == s = case modWordSize (s + n) of
0 -> do
let vLen = MV.basicLength src
MV.basicUnsafeCopy (MV.slice 1 (vLen - 1) dst) (MV.slice 1 (vLen - 1) src)
valSrc <- MV.basicUnsafeRead src 0
MV.modify dst (\val -> val .&. loMask s .|. valSrc .&. hiMask s) 0
nMod -> do
let vLen = MV.basicLength src
lohiMask = loMask s .|. hiMask nMod
if vLen == 1
then do
valSrc <- MV.basicUnsafeRead src 0
MV.modify dst (\val -> val .&. lohiMask .|. valSrc .&. complement lohiMask) 0
else do
MV.basicUnsafeCopy (MV.slice 1 (vLen - 2) dst) (MV.slice 1 (vLen - 2) src)
valSrcFirst <- MV.basicUnsafeRead src 0
MV.modify dst (\val -> val .&. loMask s .|. valSrcFirst .&. hiMask s) 0
valSrcLast <- MV.basicUnsafeRead src (vLen - 1)
MV.modify dst (\val -> val .&. hiMask nMod .|. valSrcLast .&. loMask nMod) (vLen - 1)
basicUnsafeCopy dst@(BitMVec _ len _) src = do_copy 0
where
n = alignUp len
do_copy i
| i < n = do
x <- readWord src i
writeWord dst i x
do_copy (i+wordSize)
| otherwise = return ()
{-# INLINE basicUnsafeMove #-}
basicUnsafeMove !dst !src@(BitMVec srcShift srcLen _)
| MV.basicOverlaps dst src = do
srcCopy <- BitMVec srcShift srcLen <$> MV.basicUnsafeNew (nWords (srcShift + srcLen))
MV.basicUnsafeCopy srcCopy src
MV.basicUnsafeCopy dst srcCopy
| otherwise = MV.basicUnsafeCopy dst src
{-# INLINE basicUnsafeSlice #-}
basicUnsafeSlice offset n (BitMVec s _ v) =
BitMVec relStartBit n (MV.basicUnsafeSlice startWord (endWord - startWord) v)
where
absStartBit = s + offset
relStartBit = modWordSize absStartBit
absEndBit = absStartBit + n
endWord = nWords absEndBit
startWord = divWordSize absStartBit
{-# INLINE basicUnsafeGrow #-}
basicUnsafeGrow (BitMVec s n v) by =
BitMVec s (n + by) <$> if delta == 0 then pure v else MV.basicUnsafeGrow v delta
where
delta = nWords (s + n + by) - nWords (s + n)
instance V.Vector U.Vector Bit where
basicUnsafeFreeze (BitMVec s n v) = liftM (BitVec s n) (V.basicUnsafeFreeze v)
basicUnsafeThaw (BitVec s n v) = liftM (BitMVec s n) (V.basicUnsafeThaw v)
basicLength (BitVec _ n _) = n
basicUnsafeIndexM (BitVec s _ v) !i' = let i = s + i' in liftM (readBit (modWordSize i)) (V.basicUnsafeIndexM v (divWordSize i))
basicUnsafeCopy dst src = do
src1 <- V.basicUnsafeThaw src
MV.basicUnsafeCopy dst src1
{-# INLINE basicUnsafeSlice #-}
basicUnsafeSlice offset n (BitVec s _ v) =
BitVec relStartBit n (V.basicUnsafeSlice startWord (endWord - startWord) v)
where
absStartBit = s + offset
relStartBit = modWordSize absStartBit
absEndBit = absStartBit + n
endWord = nWords absEndBit
startWord = divWordSize absStartBit
padWith :: Bit -> Int -> U.Vector Bit -> U.Vector Bit
padWith b n' bitvec@(BitVec _ n _)
| n' <= n = bitvec
| otherwise = runST $ do
mv@(BitMVec mvStart _ ws) <- MV.replicate n' b
when (mvStart /= 0) (fail "assertion failed: offset /= 0 after MV.new")
V.copy (MV.basicUnsafeSlice 0 n mv) bitvec
when (notAligned n) $ do
let i = divWordSize n
j = modWordSize n
x <- MV.read ws i
MV.write ws i (meld j x (extendToWord b))
V.unsafeFreeze mv
pad :: Int -> U.Vector Bit -> U.Vector Bit
pad = padWith (fromBool False)