module Data.Primitive.SIMD.Int16X8 (Int16X8) where
import Data.Primitive.SIMD.Class
import GHC.Int
import GHC.Types
import GHC.Prim
import GHC.Ptr
import GHC.ST
import Foreign.Storable
import Control.Monad.Primitive
import Data.Primitive.Types
import Data.Primitive.ByteArray
import Data.Primitive.Addr
import Data.Monoid
import Data.Typeable
import qualified Data.Vector.Primitive as PV
import qualified Data.Vector.Primitive.Mutable as PMV
import Data.Vector.Unboxed (Unbox)
import qualified Data.Vector.Unboxed as UV
import Data.Vector.Generic (Vector(..))
import Data.Vector.Generic.Mutable (MVector(..))
data Int16X8 = Int16X8 Int16X8# deriving Typeable
abs' :: Int16 -> Int16
abs' (I16# x) = I16# (abs# x)
abs# :: Int# -> Int#
abs# x = case abs (I16# x) of
I16# y -> y
signum' :: Int16 -> Int16
signum' (I16# x) = I16# (signum# x)
signum# :: Int# -> Int#
signum# x = case signum (I16# x) of
I16# y -> y
instance Eq Int16X8 where
a == b = case unpackInt16X8 a of
(x1, x2, x3, x4, x5, x6, x7, x8) -> case unpackInt16X8 b of
(y1, y2, y3, y4, y5, y6, y7, y8) -> x1 == y1 && x2 == y2 && x3 == y3 && x4 == y4 && x5 == y5 && x6 == y6 && x7 == y7 && x8 == y8
instance Ord Int16X8 where
a `compare` b = case unpackInt16X8 a of
(x1, x2, x3, x4, x5, x6, x7, x8) -> case unpackInt16X8 b of
(y1, y2, y3, y4, y5, y6, y7, y8) -> x1 `compare` y1 <> x2 `compare` y2 <> x3 `compare` y3 <> x4 `compare` y4 <> x5 `compare` y5 <> x6 `compare` y6 <> x7 `compare` y7 <> x8 `compare` y8
instance Show Int16X8 where
showsPrec _ a s = case unpackInt16X8 a of
(x1, x2, x3, x4, x5, x6, x7, x8) -> "Int16X8 (" ++ shows x1 (", " ++ shows x2 (", " ++ shows x3 (", " ++ shows x4 (", " ++ shows x5 (", " ++ shows x6 (", " ++ shows x7 (", " ++ shows x8 (")" ++ s))))))))
instance Num Int16X8 where
(+) = plusInt16X8
() = minusInt16X8
(*) = timesInt16X8
negate = negateInt16X8
abs = mapVector abs'
signum = mapVector signum'
fromInteger = broadcastVector . fromInteger
instance Bounded Int16X8 where
minBound = broadcastVector minBound
maxBound = broadcastVector maxBound
instance Storable Int16X8 where
sizeOf x = vectorSize x * elementSize x
alignment = sizeOf
peek (Ptr a) = readOffAddr (Addr a) 0
poke (Ptr a) = writeOffAddr (Addr a) 0
instance SIMDVector Int16X8 where
type Elem Int16X8 = Int16
type ElemTuple Int16X8 = (Int16, Int16, Int16, Int16, Int16, Int16, Int16, Int16)
nullVector = broadcastVector 0
vectorSize _ = 8
elementSize _ = 2
broadcastVector = broadcastInt16X8
unsafeInsertVector = unsafeInsertInt16X8
packVector = packInt16X8
unpackVector = unpackInt16X8
mapVector = mapInt16X8
zipVector = zipInt16X8
foldVector = foldInt16X8
instance SIMDIntVector Int16X8 where
quotVector = quotInt16X8
remVector = remInt16X8
instance Prim Int16X8 where
sizeOf# a = let !(I# x) = sizeOf a in x
alignment# a = let !(I# x) = alignment a in x
indexByteArray# ba i = indexInt16X8Array (ByteArray ba) (I# i)
readByteArray# mba i s = let (ST r) = readInt16X8Array (MutableByteArray mba) (I# i) in r s
writeByteArray# mba i v s = let (ST r) = writeInt16X8Array (MutableByteArray mba) (I# i) v in case r s of { (# s', _ #) -> s' }
setByteArray# mba off n v s = let (ST r) = setByteArrayGeneric (MutableByteArray mba) (I# off) (I# n) v in case r s of { (# s', _ #) -> s' }
indexOffAddr# addr i = indexInt16X8OffAddr (Addr addr) (I# i)
readOffAddr# addr i s = let (ST r) = readInt16X8OffAddr (Addr addr) (I# i) in r s
writeOffAddr# addr i v s = let (ST r) = writeInt16X8OffAddr (Addr addr) (I# i) v in case r s of { (# s', _ #) -> s' }
setOffAddr# addr off n v s = let (ST r) = setOffAddrGeneric (Addr addr) (I# off) (I# n) v in case r s of { (# s', _ #) -> s' }
newtype instance UV.Vector Int16X8 = V_Int16X8 (PV.Vector Int16X8)
newtype instance UV.MVector s Int16X8 = MV_Int16X8 (PMV.MVector s Int16X8)
instance Vector UV.Vector Int16X8 where
basicUnsafeFreeze (MV_Int16X8 v) = V_Int16X8 <$> PV.unsafeFreeze v
basicUnsafeThaw (V_Int16X8 v) = MV_Int16X8 <$> PV.unsafeThaw v
basicLength (V_Int16X8 v) = PV.length v
basicUnsafeSlice start len (V_Int16X8 v) = V_Int16X8(PV.unsafeSlice start len v)
basicUnsafeIndexM (V_Int16X8 v) = PV.unsafeIndexM v
basicUnsafeCopy (MV_Int16X8 m) (V_Int16X8 v) = PV.unsafeCopy m v
elemseq _ = seq
instance MVector UV.MVector Int16X8 where
basicLength (MV_Int16X8 v) = PMV.length v
basicUnsafeSlice start len (MV_Int16X8 v) = MV_Int16X8(PMV.unsafeSlice start len v)
basicOverlaps (MV_Int16X8 v) (MV_Int16X8 w) = PMV.overlaps v w
basicUnsafeNew len = MV_Int16X8 <$> PMV.unsafeNew len
#if MIN_VERSION_vector(0,11,0)
basicInitialize (MV_Int16X8 v) = basicInitialize v
#endif
basicUnsafeRead (MV_Int16X8 v) = PMV.unsafeRead v
basicUnsafeWrite (MV_Int16X8 v) = PMV.unsafeWrite v
instance Unbox Int16X8
broadcastInt16X8 :: Int16 -> Int16X8
broadcastInt16X8 (I16# x) = Int16X8 (broadcastInt16X8# x)
packInt16X8 :: (Int16, Int16, Int16, Int16, Int16, Int16, Int16, Int16) -> Int16X8
packInt16X8 (I16# x1, I16# x2, I16# x3, I16# x4, I16# x5, I16# x6, I16# x7, I16# x8) = Int16X8 (packInt16X8# (# x1, x2, x3, x4, x5, x6, x7, x8 #))
unpackInt16X8 :: Int16X8 -> (Int16, Int16, Int16, Int16, Int16, Int16, Int16, Int16)
unpackInt16X8 (Int16X8 m1) = case unpackInt16X8# m1 of
(# x1, x2, x3, x4, x5, x6, x7, x8 #) -> (I16# x1, I16# x2, I16# x3, I16# x4, I16# x5, I16# x6, I16# x7, I16# x8)
unsafeInsertInt16X8 :: Int16X8 -> Int16 -> Int -> Int16X8
unsafeInsertInt16X8 (Int16X8 m1) (I16# y) _i@(I# ip) = Int16X8 (insertInt16X8# m1 y (ip -# 0#))
mapInt16X8 :: (Int16 -> Int16) -> Int16X8 -> Int16X8
mapInt16X8 f = mapInt16X8# (\ x -> case f (I16# x) of { I16# y -> y})
mapInt16X8# :: (Int# -> Int#) -> Int16X8 -> Int16X8
mapInt16X8# f = \ v -> case unpackInt16X8 v of
(I16# x1, I16# x2, I16# x3, I16# x4, I16# x5, I16# x6, I16# x7, I16# x8) -> packInt16X8 (I16# (f x1), I16# (f x2), I16# (f x3), I16# (f x4), I16# (f x5), I16# (f x6), I16# (f x7), I16# (f x8))
zipInt16X8 :: (Int16 -> Int16 -> Int16) -> Int16X8 -> Int16X8 -> Int16X8
zipInt16X8 f = \ v1 v2 -> case unpackInt16X8 v1 of
(x1, x2, x3, x4, x5, x6, x7, x8) -> case unpackInt16X8 v2 of
(y1, y2, y3, y4, y5, y6, y7, y8) -> packInt16X8 (f x1 y1, f x2 y2, f x3 y3, f x4 y4, f x5 y5, f x6 y6, f x7 y7, f x8 y8)
foldInt16X8 :: (Int16 -> Int16 -> Int16) -> Int16X8 -> Int16
foldInt16X8 f' = \ v -> case unpackInt16X8 v of
(x1, x2, x3, x4, x5, x6, x7, x8) -> x1 `f` x2 `f` x3 `f` x4 `f` x5 `f` x6 `f` x7 `f` x8
where f !x !y = f' x y
plusInt16X8 :: Int16X8 -> Int16X8 -> Int16X8
plusInt16X8 (Int16X8 m1_1) (Int16X8 m1_2) = Int16X8 (plusInt16X8# m1_1 m1_2)
minusInt16X8 :: Int16X8 -> Int16X8 -> Int16X8
minusInt16X8 (Int16X8 m1_1) (Int16X8 m1_2) = Int16X8 (minusInt16X8# m1_1 m1_2)
timesInt16X8 :: Int16X8 -> Int16X8 -> Int16X8
timesInt16X8 (Int16X8 m1_1) (Int16X8 m1_2) = Int16X8 (timesInt16X8# m1_1 m1_2)
quotInt16X8 :: Int16X8 -> Int16X8 -> Int16X8
quotInt16X8 (Int16X8 m1_1) (Int16X8 m1_2) = Int16X8 (quotInt16X8# m1_1 m1_2)
remInt16X8 :: Int16X8 -> Int16X8 -> Int16X8
remInt16X8 (Int16X8 m1_1) (Int16X8 m1_2) = Int16X8 (remInt16X8# m1_1 m1_2)
negateInt16X8 :: Int16X8 -> Int16X8
negateInt16X8 (Int16X8 m1_1) = Int16X8 (negateInt16X8# m1_1)
indexInt16X8Array :: ByteArray -> Int -> Int16X8
indexInt16X8Array (ByteArray a) (I# i) = Int16X8 (indexInt16X8Array# a i)
readInt16X8Array :: PrimMonad m => MutableByteArray (PrimState m) -> Int -> m Int16X8
readInt16X8Array (MutableByteArray a) (I# i) = primitive (\ s0 -> case readInt16X8Array# a ((i *# 1#) +# 0#) s0 of
(# s1, m1 #) -> (# s1, Int16X8 m1 #))
writeInt16X8Array :: PrimMonad m => MutableByteArray (PrimState m) -> Int -> Int16X8 -> m ()
writeInt16X8Array (MutableByteArray a) (I# i) (Int16X8 m1) = primitive_ (writeInt16X8Array# a ((i *# 1#) +# 0#) m1)
indexInt16X8OffAddr :: Addr -> Int -> Int16X8
indexInt16X8OffAddr (Addr a) (I# i) = Int16X8 (indexInt16X8OffAddr# (plusAddr# a (i *# 16#)) 0#)
readInt16X8OffAddr :: PrimMonad m => Addr -> Int -> m Int16X8
readInt16X8OffAddr (Addr a) (I# i) = primitive (\ s0 -> case (\ addr i' -> readInt16X8OffAddr# (plusAddr# addr i') 0#) a ((i *# 16#) +# 0#) s0 of
(# s1, m1 #) -> (# s1, Int16X8 m1 #))
writeInt16X8OffAddr :: PrimMonad m => Addr -> Int -> Int16X8 -> m ()
writeInt16X8OffAddr (Addr a) (I# i) (Int16X8 m1) = primitive_ (writeInt16X8OffAddr# (plusAddr# a ((i *# 16#) +# 0#)) 0# m1)