{-# LANGUAGE MagicHash #-}
{-# OPTIONS_GHC -fno-warn-orphans #-}
module Foreign.CUDA.Internal.C2HS (
withCStringLenIntConv, peekCStringLenIntConv, withIntConv, withFloatConv,
peekIntConv, peekFloatConv, withBool, peekBool, withEnum, peekEnum,
peekArrayWith,
nothingIf, nothingIfNull,
combineBitMasks, containsBitMask, extractBitMasks,
cIntConv, cFloatConv, cToBool, cFromBool, cToEnum, cFromEnum
) where
import Foreign
import Foreign.C
import Control.Monad ( liftM )
import GHC.Int
import GHC.Word
import GHC.Base
withCStringLenIntConv :: String -> (CStringLen -> IO a) -> IO a
withCStringLenIntConv :: String -> (CStringLen -> IO a) -> IO a
withCStringLenIntConv String
s CStringLen -> IO a
f = String -> (CStringLen -> IO a) -> IO a
forall a. String -> (CStringLen -> IO a) -> IO a
withCStringLen String
s ((CStringLen -> IO a) -> IO a) -> (CStringLen -> IO a) -> IO a
forall a b. (a -> b) -> a -> b
$ \(Ptr CChar
p, Int
n) -> CStringLen -> IO a
f (Ptr CChar
p, Int -> Int
forall a b. (Integral a, Integral b) => a -> b
cIntConv Int
n)
peekCStringLenIntConv :: CStringLen -> IO String
peekCStringLenIntConv :: CStringLen -> IO String
peekCStringLenIntConv (Ptr CChar
s, Int
n) = CStringLen -> IO String
peekCStringLen (Ptr CChar
s, Int -> Int
forall a b. (Integral a, Integral b) => a -> b
cIntConv Int
n)
withIntConv :: (Storable b, Integral a, Integral b) => a -> (Ptr b -> IO c) -> IO c
withIntConv :: a -> (Ptr b -> IO c) -> IO c
withIntConv = b -> (Ptr b -> IO c) -> IO c
forall a b. Storable a => a -> (Ptr a -> IO b) -> IO b
with (b -> (Ptr b -> IO c) -> IO c)
-> (a -> b) -> a -> (Ptr b -> IO c) -> IO c
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
forall a b. (Integral a, Integral b) => a -> b
cIntConv
withFloatConv :: (Storable b, RealFloat a, RealFloat b) => a -> (Ptr b -> IO c) -> IO c
withFloatConv :: a -> (Ptr b -> IO c) -> IO c
withFloatConv = b -> (Ptr b -> IO c) -> IO c
forall a b. Storable a => a -> (Ptr a -> IO b) -> IO b
with (b -> (Ptr b -> IO c) -> IO c)
-> (a -> b) -> a -> (Ptr b -> IO c) -> IO c
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
forall a b. (RealFloat a, RealFloat b) => a -> b
cFloatConv
peekIntConv :: (Storable a, Integral a, Integral b) => Ptr a -> IO b
peekIntConv :: Ptr a -> IO b
peekIntConv = (a -> b) -> IO a -> IO b
forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM a -> b
forall a b. (Integral a, Integral b) => a -> b
cIntConv (IO a -> IO b) -> (Ptr a -> IO a) -> Ptr a -> IO b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ptr a -> IO a
forall a. Storable a => Ptr a -> IO a
peek
peekFloatConv :: (Storable a, RealFloat a, RealFloat b) => Ptr a -> IO b
peekFloatConv :: Ptr a -> IO b
peekFloatConv = (a -> b) -> IO a -> IO b
forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM a -> b
forall a b. (RealFloat a, RealFloat b) => a -> b
cFloatConv (IO a -> IO b) -> (Ptr a -> IO a) -> Ptr a -> IO b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ptr a -> IO a
forall a. Storable a => Ptr a -> IO a
peek
withBool :: (Integral a, Storable a) => Bool -> (Ptr a -> IO b) -> IO b
withBool :: Bool -> (Ptr a -> IO b) -> IO b
withBool = a -> (Ptr a -> IO b) -> IO b
forall a b. Storable a => a -> (Ptr a -> IO b) -> IO b
with (a -> (Ptr a -> IO b) -> IO b)
-> (Bool -> a) -> Bool -> (Ptr a -> IO b) -> IO b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Bool -> a
forall a. Num a => Bool -> a
fromBool
peekBool :: (Integral a, Storable a) => Ptr a -> IO Bool
peekBool :: Ptr a -> IO Bool
peekBool = (a -> Bool) -> IO a -> IO Bool
forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM a -> Bool
forall a. (Eq a, Num a) => a -> Bool
toBool (IO a -> IO Bool) -> (Ptr a -> IO a) -> Ptr a -> IO Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ptr a -> IO a
forall a. Storable a => Ptr a -> IO a
peek
peekArrayWith :: Storable a => (a -> b) -> Int -> Ptr a -> IO [b]
peekArrayWith :: (a -> b) -> Int -> Ptr a -> IO [b]
peekArrayWith a -> b
f Int
n Ptr a
p = (a -> b) -> [a] -> [b]
forall a b. (a -> b) -> [a] -> [b]
map a -> b
f ([a] -> [b]) -> IO [a] -> IO [b]
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
`fmap` Int -> Ptr a -> IO [a]
forall a. Storable a => Int -> Ptr a -> IO [a]
peekArray Int
n Ptr a
p
withEnum :: (Enum a, Integral b, Storable b) => a -> (Ptr b -> IO c) -> IO c
withEnum :: a -> (Ptr b -> IO c) -> IO c
withEnum = b -> (Ptr b -> IO c) -> IO c
forall a b. Storable a => a -> (Ptr a -> IO b) -> IO b
with (b -> (Ptr b -> IO c) -> IO c)
-> (a -> b) -> a -> (Ptr b -> IO c) -> IO c
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> b
forall e i. (Enum e, Integral i) => e -> i
cFromEnum
peekEnum :: (Enum a, Integral b, Storable b) => Ptr b -> IO a
peekEnum :: Ptr b -> IO a
peekEnum = (b -> a) -> IO b -> IO a
forall (m :: * -> *) a1 r. Monad m => (a1 -> r) -> m a1 -> m r
liftM b -> a
forall i e. (Integral i, Enum e) => i -> e
cToEnum (IO b -> IO a) -> (Ptr b -> IO b) -> Ptr b -> IO a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. Ptr b -> IO b
forall a. Storable a => Ptr a -> IO a
peek
nothingIf :: (a -> Bool) -> (a -> b) -> a -> Maybe b
nothingIf :: (a -> Bool) -> (a -> b) -> a -> Maybe b
nothingIf a -> Bool
p a -> b
f a
x = if a -> Bool
p a
x then Maybe b
forall a. Maybe a
Nothing else b -> Maybe b
forall a. a -> Maybe a
Just (b -> Maybe b) -> b -> Maybe b
forall a b. (a -> b) -> a -> b
$ a -> b
f a
x
nothingIfNull :: (Ptr a -> b) -> Ptr a -> Maybe b
nothingIfNull :: (Ptr a -> b) -> Ptr a -> Maybe b
nothingIfNull = (Ptr a -> Bool) -> (Ptr a -> b) -> Ptr a -> Maybe b
forall a b. (a -> Bool) -> (a -> b) -> a -> Maybe b
nothingIf (Ptr a -> Ptr a -> Bool
forall a. Eq a => a -> a -> Bool
== Ptr a
forall a. Ptr a
nullPtr)
combineBitMasks :: (Enum a, Num b, Bits b) => [a] -> b
combineBitMasks :: [a] -> b
combineBitMasks = (b -> b -> b) -> b -> [b] -> b
forall (t :: * -> *) b a.
Foldable t =>
(b -> a -> b) -> b -> t a -> b
foldl b -> b -> b
forall a. Bits a => a -> a -> a
(.|.) b
0 ([b] -> b) -> ([a] -> [b]) -> [a] -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. (a -> b) -> [a] -> [b]
forall a b. (a -> b) -> [a] -> [b]
map (Int -> b
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Int -> b) -> (a -> Int) -> a -> b
forall b c a. (b -> c) -> (a -> b) -> a -> c
. a -> Int
forall a. Enum a => a -> Int
fromEnum)
containsBitMask :: (Num a, Bits a, Enum b) => a -> b -> Bool
a
bits containsBitMask :: a -> b -> Bool
`containsBitMask` b
bm = let bm' :: a
bm' = Int -> a
forall a b. (Integral a, Num b) => a -> b
fromIntegral (Int -> a) -> (b -> Int) -> b -> a
forall b c a. (b -> c) -> (a -> b) -> a -> c
. b -> Int
forall a. Enum a => a -> Int
fromEnum (b -> a) -> b -> a
forall a b. (a -> b) -> a -> b
$ b
bm
in
a
bm' a -> a -> a
forall a. Bits a => a -> a -> a
.&. a
bits a -> a -> Bool
forall a. Eq a => a -> a -> Bool
== a
bm'
extractBitMasks :: (Num a, Bits a, Enum b, Bounded b) => a -> [b]
a
bits =
[b
bm | b
bm <- [b
forall a. Bounded a => a
minBound..b
forall a. Bounded a => a
maxBound], a
bits a -> b -> Bool
forall a b. (Num a, Bits a, Enum b) => a -> b -> Bool
`containsBitMask` b
bm]
{-# INLINE [1] cIntConv #-}
cIntConv :: (Integral a, Integral b) => a -> b
cIntConv :: a -> b
cIntConv = a -> b
forall a b. (Integral a, Num b) => a -> b
fromIntegral
{-# RULES
"fromIntegral/Int->CInt" fromIntegral = \(I# i#) -> CInt (I32# (narrow32Int# i#)) ;
"fromIntegral/Int->CLLong" fromIntegral = \(I# i#) -> CLLong (I64# i#) ;
#-}
{-# RULES
"fromIntegral/Int->CUInt" fromIntegral = \(I# i#) -> CUInt (W32# (narrow32Word# (int2Word# i#))) ;
"fromIntegral/Int->CULLong" fromIntegral = \(I# i#) -> CULLong (W64# (int2Word# i#)) ;
#-}
{-# INLINE [1] cFloatConv #-}
cFloatConv :: (RealFloat a, RealFloat b) => a -> b
cFloatConv :: a -> b
cFloatConv = a -> b
forall a b. (Real a, Fractional b) => a -> b
realToFrac
{-# RULES
"realToFrac/Float->Float" realToFrac = \(x::Float) -> x ;
"realToFrac/Float->CFloat" realToFrac = \(x::Float) -> CFloat x ;
"realToFrac/CFloat->Float" realToFrac = \(CFloat x) -> x ;
#-}
{-# RULES
"realToFrac/Double->Double" realToFrac = \(x::Double) -> x;
"realToFrac/Double->CDouble" realToFrac = \(x::Double) -> CDouble x ;
"realToFrac/CDouble->Double" realToFrac = \(CDouble x) -> x ;
#-}
{-# INLINE [1] cFromBool #-}
cFromBool :: Num a => Bool -> a
cFromBool :: Bool -> a
cFromBool = Bool -> a
forall a. Num a => Bool -> a
fromBool
{-# INLINE [1] cToBool #-}
cToBool :: (Eq a, Num a) => a -> Bool
cToBool :: a -> Bool
cToBool = a -> Bool
forall a. (Eq a, Num a) => a -> Bool
toBool
{-# INLINE [1] cToEnum #-}
cToEnum :: (Integral i, Enum e) => i -> e
cToEnum :: i -> e
cToEnum = Int -> e
forall a. Enum a => Int -> a
toEnum (Int -> e) -> (i -> Int) -> i -> e
forall b c a. (b -> c) -> (a -> b) -> a -> c
. i -> Int
forall a b. (Integral a, Integral b) => a -> b
cIntConv
{-# INLINE [1] cFromEnum #-}
cFromEnum :: (Enum e, Integral i) => e -> i
= Int -> i
forall a b. (Integral a, Integral b) => a -> b
cIntConv (Int -> i) -> (e -> Int) -> e -> i
forall b c a. (b -> c) -> (a -> b) -> a -> c
. e -> Int
forall a. Enum a => a -> Int
fromEnum