{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE BlockArguments #-}
{-# LANGUAGE DeriveAnyClass #-}
{-# LANGUAGE DerivingStrategies #-}
{-# LANGUAGE MagicHash #-}
{-# LANGUAGE UnboxedTuples #-}
{-# LANGUAGE UnliftedFFITypes #-}
module Lz4.Block
(
compress
, compressU
, compressHighly
, compressHighlyU
, decompress
, decompressU
, compressInto
, requiredBufferSize
) where
import Lz4.Internal (c_hs_compress_HC, requiredBufferSize)
import Control.Monad.ST (runST)
import Control.Monad.ST.Run (runByteArrayST)
import Data.Bytes.Types (Bytes (Bytes))
import Data.Primitive (ByteArray (..), MutableByteArray (..))
import GHC.Exts (ByteArray#, MutableByteArray#)
import GHC.IO (unsafeIOToST)
import GHC.ST (ST (ST))
import qualified Control.Exception
import qualified Data.Primitive as PM
import qualified GHC.Exts as Exts
compressHighly ::
Int ->
Bytes ->
Bytes
compressHighly :: Int -> Bytes -> Bytes
compressHighly !Int
lvl (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) = (forall s. ST s Bytes) -> Bytes
forall a. (forall s. ST s a) -> a
runST do
let maxSz :: Int
maxSz = Int -> Int
requiredBufferSize Int
len
dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) <- Int -> ST s (MutableByteArray (PrimState (ST s)))
forall (m :: * -> *).
PrimMonad m =>
Int -> m (MutableByteArray (PrimState m))
PM.newByteArray Int
maxSz
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
c_hs_compress_HC ByteArray#
arr Int
off MutableByteArray# s
dst# Int
0 Int
len Int
maxSz Int
lvl)
MutableByteArray (PrimState (ST s)) -> Int -> ST s ()
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> Int -> m ()
PM.shrinkMutableByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst Int
actualSz
ByteArray
result <- MutableByteArray (PrimState (ST s)) -> ST s ByteArray
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> m ByteArray
PM.unsafeFreezeByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst
Bytes -> ST s Bytes
forall a. a -> ST s a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ByteArray -> Int -> Int -> Bytes
Bytes ByteArray
result Int
0 Int
actualSz)
compressHighlyU ::
Int ->
Bytes ->
ByteArray
compressHighlyU :: Int -> Bytes -> ByteArray
compressHighlyU !Int
lvl (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) = (forall s. ST s ByteArray) -> ByteArray
forall a. (forall s. ST s a) -> a
runST do
let maxSz :: Int
maxSz = Int -> Int
requiredBufferSize Int
len
dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) <- Int -> ST s (MutableByteArray (PrimState (ST s)))
forall (m :: * -> *).
PrimMonad m =>
Int -> m (MutableByteArray (PrimState m))
PM.newByteArray Int
maxSz
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
c_hs_compress_HC ByteArray#
arr Int
off MutableByteArray# s
dst# Int
0 Int
len Int
maxSz Int
lvl)
MutableByteArray (PrimState (ST s)) -> Int -> ST s ()
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> Int -> m ()
PM.shrinkMutableByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst Int
actualSz
MutableByteArray (PrimState (ST s)) -> ST s ByteArray
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> m ByteArray
PM.unsafeFreezeByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst
compress ::
Int ->
Bytes ->
Bytes
compress :: Int -> Bytes -> Bytes
compress !Int
lvl (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) = (forall s. ST s Bytes) -> Bytes
forall a. (forall s. ST s a) -> a
runST do
let maxSz :: Int
maxSz = Int -> Int
requiredBufferSize Int
len
dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) <- Int -> ST s (MutableByteArray (PrimState (ST s)))
forall (m :: * -> *).
PrimMonad m =>
Int -> m (MutableByteArray (PrimState m))
PM.newByteArray Int
maxSz
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
c_hs_compress_fast ByteArray#
arr Int
off MutableByteArray# s
dst# Int
0 Int
len Int
maxSz Int
lvl)
MutableByteArray (PrimState (ST s)) -> Int -> ST s ()
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> Int -> m ()
PM.shrinkMutableByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst Int
actualSz
ByteArray
result <- MutableByteArray (PrimState (ST s)) -> ST s ByteArray
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> m ByteArray
PM.unsafeFreezeByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst
Bytes -> ST s Bytes
forall a. a -> ST s a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ByteArray -> Int -> Int -> Bytes
Bytes ByteArray
result Int
0 Int
actualSz)
compressInto ::
Int ->
Bytes ->
MutableByteArray s ->
Int ->
Int ->
ST s Int
compressInto :: forall s.
Int -> Bytes -> MutableByteArray s -> Int -> Int -> ST s Int
compressInto !Int
lvl (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) !Int
doff !Int
dlen = do
let maxSz :: Int
maxSz = Int -> Int
requiredBufferSize Int
len
if Int
dlen Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
< Int
maxSz
then IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (Lz4BufferTooSmall -> IO Int
forall e a. Exception e => e -> IO a
Control.Exception.throwIO Lz4BufferTooSmall
Lz4BufferTooSmall)
else do
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
c_hs_compress_fast ByteArray#
arr Int
off MutableByteArray# s
dst# Int
doff Int
len Int
maxSz Int
lvl)
Int -> ST s Int
forall a. a -> ST s a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Int
doff Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
actualSz)
compressU ::
Int ->
Bytes ->
ByteArray
compressU :: Int -> Bytes -> ByteArray
compressU !Int
lvl (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) = (forall s. ST s ByteArray) -> ByteArray
runByteArrayST do
let maxSz :: Int
maxSz = Int -> Int
requiredBufferSize Int
len
dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) <- Int -> ST s (MutableByteArray (PrimState (ST s)))
forall (m :: * -> *).
PrimMonad m =>
Int -> m (MutableByteArray (PrimState m))
PM.newByteArray Int
maxSz
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> Int -> IO Int
c_hs_compress_fast ByteArray#
arr Int
off MutableByteArray# s
dst# Int
0 Int
len Int
maxSz Int
lvl)
MutableByteArray (PrimState (ST s)) -> Int -> ST s ()
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> Int -> m ()
PM.shrinkMutableByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst Int
actualSz
MutableByteArray (PrimState (ST s)) -> ST s ByteArray
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> m ByteArray
PM.unsafeFreezeByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst
decompress ::
Int ->
Bytes ->
Maybe Bytes
decompress :: Int -> Bytes -> Maybe Bytes
decompress !Int
dstSz !Bytes
b = case Int -> Bytes -> Maybe ByteArray
decompressU Int
dstSz Bytes
b of
Maybe ByteArray
Nothing -> Maybe Bytes
forall a. Maybe a
Nothing
Just ByteArray
r -> Bytes -> Maybe Bytes
forall a. a -> Maybe a
Just (ByteArray -> Int -> Int -> Bytes
Bytes ByteArray
r Int
0 Int
dstSz)
decompressU ::
Int ->
Bytes ->
Maybe ByteArray
decompressU :: Int -> Bytes -> Maybe ByteArray
decompressU Int
dstSz (Bytes (ByteArray ByteArray#
arr) Int
off Int
len) = (forall s. ST s (Maybe ByteArray)) -> Maybe ByteArray
forall a. (forall s. ST s a) -> a
runST do
dst :: MutableByteArray s
dst@(MutableByteArray MutableByteArray# s
dst#) <- Int -> ST s (MutableByteArray (PrimState (ST s)))
forall (m :: * -> *).
PrimMonad m =>
Int -> m (MutableByteArray (PrimState m))
PM.newByteArray Int
dstSz
Int
actualSz <- IO Int -> ST s Int
forall a s. IO a -> ST s a
unsafeIOToST (ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> IO Int
forall s.
ByteArray#
-> Int -> MutableByteArray# s -> Int -> Int -> Int -> IO Int
c_hs_decompress_safe ByteArray#
arr Int
off MutableByteArray# s
dst# Int
0 Int
len Int
dstSz)
if Int
actualSz Int -> Int -> Bool
forall a. Eq a => a -> a -> Bool
== Int
dstSz
then do
ByteArray
result <- MutableByteArray (PrimState (ST s)) -> ST s ByteArray
forall (m :: * -> *).
PrimMonad m =>
MutableByteArray (PrimState m) -> m ByteArray
PM.unsafeFreezeByteArray MutableByteArray s
MutableByteArray (PrimState (ST s))
dst
Maybe ByteArray -> ST s (Maybe ByteArray)
forall a. a -> ST s a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (ByteArray -> Maybe ByteArray
forall a. a -> Maybe a
Just ByteArray
result)
else Maybe ByteArray -> ST s (Maybe ByteArray)
forall a. a -> ST s a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Maybe ByteArray
forall a. Maybe a
Nothing
foreign import ccall unsafe "hs_compress_fast"
c_hs_compress_fast ::
ByteArray# ->
Int ->
MutableByteArray# s ->
Int ->
Int ->
Int ->
Int ->
IO Int
foreign import ccall unsafe "hs_decompress_safe"
c_hs_decompress_safe ::
ByteArray# ->
Int ->
MutableByteArray# s ->
Int ->
Int ->
Int ->
IO Int
data Lz4BufferTooSmall = Lz4BufferTooSmall
deriving stock (Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool
(Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool)
-> (Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool)
-> Eq Lz4BufferTooSmall
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool
== :: Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool
$c/= :: Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool
/= :: Lz4BufferTooSmall -> Lz4BufferTooSmall -> Bool
Eq, Int -> Lz4BufferTooSmall -> ShowS
[Lz4BufferTooSmall] -> ShowS
Lz4BufferTooSmall -> String
(Int -> Lz4BufferTooSmall -> ShowS)
-> (Lz4BufferTooSmall -> String)
-> ([Lz4BufferTooSmall] -> ShowS)
-> Show Lz4BufferTooSmall
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> Lz4BufferTooSmall -> ShowS
showsPrec :: Int -> Lz4BufferTooSmall -> ShowS
$cshow :: Lz4BufferTooSmall -> String
show :: Lz4BufferTooSmall -> String
$cshowList :: [Lz4BufferTooSmall] -> ShowS
showList :: [Lz4BufferTooSmall] -> ShowS
Show)
deriving anyclass (Show Lz4BufferTooSmall
Typeable Lz4BufferTooSmall
(Typeable Lz4BufferTooSmall, Show Lz4BufferTooSmall) =>
(Lz4BufferTooSmall -> SomeException)
-> (SomeException -> Maybe Lz4BufferTooSmall)
-> (Lz4BufferTooSmall -> String)
-> Exception Lz4BufferTooSmall
SomeException -> Maybe Lz4BufferTooSmall
Lz4BufferTooSmall -> String
Lz4BufferTooSmall -> SomeException
forall e.
(Typeable e, Show e) =>
(e -> SomeException)
-> (SomeException -> Maybe e) -> (e -> String) -> Exception e
$ctoException :: Lz4BufferTooSmall -> SomeException
toException :: Lz4BufferTooSmall -> SomeException
$cfromException :: SomeException -> Maybe Lz4BufferTooSmall
fromException :: SomeException -> Maybe Lz4BufferTooSmall
$cdisplayException :: Lz4BufferTooSmall -> String
displayException :: Lz4BufferTooSmall -> String
Control.Exception.Exception)