{-# OPTIONS_HADDOCK prune #-}
{-# LANGUAGE BangPatterns #-}
module Crypto.PRNG (
Gen
, new
, new_system
, from_state
, word64
, word64_range
, int_range
, double
, copy
, jump
, long_jump
) where
import Control.Monad.Primitive (PrimMonad, PrimState)
import Control.Monad.ST (ST)
import qualified Crypto.Range as Range
import Crypto.Xoshiro (S(..))
import qualified Crypto.Xoshiro as X
import Data.Bits ((.>>.))
import qualified Data.Primitive.PrimArray as PA
import Data.Word (Word64)
import GHC.Exts (RealWorld)
fi :: (Integral a, Num b) => a -> b
fi :: forall a b. (Integral a, Num b) => a -> b
fi = a -> b
forall a b. (Integral a, Num b) => a -> b
fromIntegral
{-# INLINE fi #-}
newtype Gen s = Gen (PA.MutablePrimArray s Word64)
read_s :: PrimMonad m => Gen (PrimState m) -> m S
read_s :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m S
read_s (Gen MutablePrimArray (PrimState m) Word64
g) = do
!s0 <- MutablePrimArray (PrimState m) Word64 -> Int -> m Word64
forall a (m :: * -> *).
(Prim a, PrimMonad m) =>
MutablePrimArray (PrimState m) a -> Int -> m a
PA.readPrimArray MutablePrimArray (PrimState m) Word64
g Int
0
!s1 <- PA.readPrimArray g 1
!s2 <- PA.readPrimArray g 2
!s3 <- PA.readPrimArray g 3
pure $! S s0 s1 s2 s3
{-# INLINE read_s #-}
write_s :: PrimMonad m => Gen (PrimState m) -> S -> m ()
write_s :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> S -> m ()
write_s (Gen MutablePrimArray (PrimState m) Word64
g) (S Word64
s0 Word64
s1 Word64
s2 Word64
s3) = do
MutablePrimArray (PrimState m) Word64 -> Int -> Word64 -> m ()
forall a (m :: * -> *).
(Prim a, PrimMonad m) =>
MutablePrimArray (PrimState m) a -> Int -> a -> m ()
PA.writePrimArray MutablePrimArray (PrimState m) Word64
g Int
0 Word64
s0
MutablePrimArray (PrimState m) Word64 -> Int -> Word64 -> m ()
forall a (m :: * -> *).
(Prim a, PrimMonad m) =>
MutablePrimArray (PrimState m) a -> Int -> a -> m ()
PA.writePrimArray MutablePrimArray (PrimState m) Word64
g Int
1 Word64
s1
MutablePrimArray (PrimState m) Word64 -> Int -> Word64 -> m ()
forall a (m :: * -> *).
(Prim a, PrimMonad m) =>
MutablePrimArray (PrimState m) a -> Int -> a -> m ()
PA.writePrimArray MutablePrimArray (PrimState m) Word64
g Int
2 Word64
s2
MutablePrimArray (PrimState m) Word64 -> Int -> Word64 -> m ()
forall a (m :: * -> *).
(Prim a, PrimMonad m) =>
MutablePrimArray (PrimState m) a -> Int -> a -> m ()
PA.writePrimArray MutablePrimArray (PrimState m) Word64
g Int
3 Word64
s3
{-# INLINE write_s #-}
alloc :: PrimMonad m => S -> m (Gen (PrimState m))
alloc :: forall (m :: * -> *). PrimMonad m => S -> m (Gen (PrimState m))
alloc S
s = do
g <- (MutablePrimArray (PrimState m) Word64 -> Gen (PrimState m))
-> m (MutablePrimArray (PrimState m) Word64)
-> m (Gen (PrimState m))
forall a b. (a -> b) -> m a -> m b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap MutablePrimArray (PrimState m) Word64 -> Gen (PrimState m)
forall s. MutablePrimArray s Word64 -> Gen s
Gen (Int -> m (MutablePrimArray (PrimState m) Word64)
forall (m :: * -> *) a.
(PrimMonad m, Prim a) =>
Int -> m (MutablePrimArray (PrimState m) a)
PA.newPrimArray Int
4)
write_s g s
pure g
{-# INLINE alloc #-}
new :: PrimMonad m => Word64 -> m (Gen (PrimState m))
new :: forall (m :: * -> *).
PrimMonad m =>
Word64 -> m (Gen (PrimState m))
new = S -> m (Gen (PrimState m))
forall (m :: * -> *). PrimMonad m => S -> m (Gen (PrimState m))
alloc (S -> m (Gen (PrimState m)))
-> (Word64 -> S) -> Word64 -> m (Gen (PrimState m))
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Word64 -> S
X.seed
{-# INLINABLE new #-}
{-# SPECIALIZE new :: Word64 -> IO (Gen RealWorld) #-}
{-# SPECIALIZE new :: Word64 -> ST s (Gen s) #-}
from_state
:: PrimMonad m
=> Word64
-> Word64
-> Word64
-> Word64
-> m (Maybe (Gen (PrimState m)))
from_state :: forall (m :: * -> *).
PrimMonad m =>
Word64
-> Word64 -> Word64 -> Word64 -> m (Maybe (Gen (PrimState m)))
from_state Word64
s0 Word64
s1 Word64
s2 Word64
s3 = (S -> m (Gen (PrimState m)))
-> Maybe S -> m (Maybe (Gen (PrimState m)))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Maybe a -> f (Maybe b)
traverse S -> m (Gen (PrimState m))
forall (m :: * -> *). PrimMonad m => S -> m (Gen (PrimState m))
alloc (Word64 -> Word64 -> Word64 -> Word64 -> Maybe S
X.from_words Word64
s0 Word64
s1 Word64
s2 Word64
s3)
{-# INLINABLE from_state #-}
new_system :: IO (Maybe (Gen RealWorld))
new_system :: IO (Maybe (Gen RealWorld))
new_system = IO (Maybe S)
X.system IO (Maybe S)
-> (Maybe S -> IO (Maybe (Gen RealWorld)))
-> IO (Maybe (Gen RealWorld))
forall a b. IO a -> (a -> IO b) -> IO b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= (S -> IO (Gen RealWorld)) -> Maybe S -> IO (Maybe (Gen RealWorld))
forall (t :: * -> *) (f :: * -> *) a b.
(Traversable t, Applicative f) =>
(a -> f b) -> t a -> f (t b)
forall (f :: * -> *) a b.
Applicative f =>
(a -> f b) -> Maybe a -> f (Maybe b)
traverse S -> IO (Gen RealWorld)
S -> IO (Gen (PrimState IO))
forall (m :: * -> *). PrimMonad m => S -> m (Gen (PrimState m))
alloc
word64 :: PrimMonad m => Gen (PrimState m) -> m Word64
word64 :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m Word64
word64 Gen (PrimState m)
gen = do
!s <- Gen (PrimState m) -> m S
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m S
read_s Gen (PrimState m)
gen
write_s gen (X.next s)
pure $! X.output s
{-# INLINE word64 #-}
word64_range
:: PrimMonad m => Word64 -> Word64 -> Gen (PrimState m) -> m Word64
word64_range :: forall (m :: * -> *).
PrimMonad m =>
Word64 -> Word64 -> Gen (PrimState m) -> m Word64
word64_range Word64
a Word64
b Gen (PrimState m)
gen = do
let !lo :: Word64
lo = Word64 -> Word64 -> Word64
forall a. Ord a => a -> a -> a
min Word64
a Word64
b
!hi :: Word64
hi = Word64 -> Word64 -> Word64
forall a. Ord a => a -> a -> a
max Word64
a Word64
b
!r <- m Word64 -> Word64 -> m Word64
forall (m :: * -> *). Monad m => m Word64 -> Word64 -> m Word64
Range.upto (Gen (PrimState m) -> m Word64
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m Word64
word64 Gen (PrimState m)
gen) (Word64
hi Word64 -> Word64 -> Word64
forall a. Num a => a -> a -> a
- Word64
lo)
pure $! lo + r
{-# INLINE word64_range #-}
int_range :: PrimMonad m => Int -> Int -> Gen (PrimState m) -> m Int
int_range :: forall (m :: * -> *).
PrimMonad m =>
Int -> Int -> Gen (PrimState m) -> m Int
int_range Int
a Int
b Gen (PrimState m)
gen = do
let !lo :: Int
lo = Int -> Int -> Int
forall a. Ord a => a -> a -> a
min Int
a Int
b
!hi :: Int
hi = Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
a Int
b
!r <- m Word64 -> Word64 -> m Word64
forall (m :: * -> *). Monad m => m Word64 -> Word64 -> m Word64
Range.upto (Gen (PrimState m) -> m Word64
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m Word64
word64 Gen (PrimState m)
gen) (Int -> Word64
forall a b. (Integral a, Num b) => a -> b
fi Int
hi Word64 -> Word64 -> Word64
forall a. Num a => a -> a -> a
- Int -> Word64
forall a b. (Integral a, Num b) => a -> b
fi Int
lo)
pure $! lo + fi r
{-# INLINE int_range #-}
double :: PrimMonad m => Gen (PrimState m) -> m Double
double :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m Double
double Gen (PrimState m)
gen = do
!w <- Gen (PrimState m) -> m Word64
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m Word64
word64 Gen (PrimState m)
gen
pure $! fi (w .>>. 11) * 1.1102230246251565e-16
{-# INLINE double #-}
copy :: PrimMonad m => Gen (PrimState m) -> m (Gen (PrimState m))
copy :: forall (m :: * -> *).
PrimMonad m =>
Gen (PrimState m) -> m (Gen (PrimState m))
copy Gen (PrimState m)
gen = Gen (PrimState m) -> m S
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m S
read_s Gen (PrimState m)
gen m S -> (S -> m (Gen (PrimState m))) -> m (Gen (PrimState m))
forall a b. m a -> (a -> m b) -> m b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= S -> m (Gen (PrimState m))
forall (m :: * -> *). PrimMonad m => S -> m (Gen (PrimState m))
alloc
{-# INLINE copy #-}
jump :: PrimMonad m => Gen (PrimState m) -> m ()
jump :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m ()
jump Gen (PrimState m)
gen = do
!s <- Gen (PrimState m) -> m S
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m S
read_s Gen (PrimState m)
gen
write_s gen (X.jump s)
{-# INLINABLE jump #-}
long_jump :: PrimMonad m => Gen (PrimState m) -> m ()
long_jump :: forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m ()
long_jump Gen (PrimState m)
gen = do
!s <- Gen (PrimState m) -> m S
forall (m :: * -> *). PrimMonad m => Gen (PrimState m) -> m S
read_s Gen (PrimState m)
gen
write_s gen (X.long_jump s)
{-# INLINABLE long_jump #-}