1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
|
{-# LANGUAGE BangPatterns #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE ConstraintKinds #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE CPP #-}
{-# LANGUAGE DataKinds #-}
{-# LANGUAGE RankNTypes #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE KindSignatures #-}
module Internal.Specialized where
import Control.Monad
import Control.DeepSeq ( NFData(..) )
import Data.Coerce
import Data.Complex
import Data.Functor
import Data.Int
import Data.Typeable (eqT,Proxy)
import Type.Reflection
import Foreign.Marshal.Alloc(free,malloc)
import Foreign.Marshal.Array(newArray,copyArray)
import Foreign.ForeignPtr(castForeignPtr)
import Foreign.Ptr
import Foreign.Storable
import Foreign.C.Types (CInt(..))
import System.IO.Unsafe
#if MIN_VERSION_base(4,11,0)
import GHC.TypeLits hiding (Mod)
#else
import GHC.TypeLits
#endif
import Internal.Vector (Vector,createVector,unsafeFromForeignPtr,unsafeToForeignPtr)
import Internal.Devel
eqt :: (Typeable a, Typeable b) => a -> Maybe (a :~: b)
eqt _ = eqT
eq32 :: (Typeable a) => a -> Maybe (a :~: Int32)
eq32 _ = eqT
eq64 :: (Typeable a) => a -> Maybe (a :~: Int64)
eq64 _ = eqT
eqint :: (Typeable a) => a -> Maybe (a :~: CInt)
eqint _ = eqT
type Element t = (Storable t, Typeable t)
data Specialized a
= SpFloat !(a :~: Float)
| SpDouble !(a :~: Double)
| SpCFloat !(a :~: Complex Float)
| SpCDouble !(a :~: Complex Double)
| SpInt32 !(Vector Int32 -> Vector a) !Int32
| SpInt64 !(Vector Int64 -> Vector a) !Int64
-- | SpModInt32 !Int32 Int32 !(forall f. f Int32 -> f a)
-- | SpModInt64 !Int32 Int64 !(forall f. f Int64 -> f a)
specialize :: forall a. Typeable a => a -> Maybe (Specialized a)
specialize x = foldr1 mplus
[ SpDouble <$> eqt x
, eq64 x <&> \Refl -> SpInt64 id x
, SpFloat <$> eqt x
, eq32 x <&> \Refl -> SpInt32 id x
, SpCDouble <$> eqt x
, SpCFloat <$> eqt x
, eqint x <&> \Refl -> case x of CInt y -> SpInt32 coerce y
-- , em32 x <&> \(nat,Refl) -> case x of Mod y -> SpInt32 (i2f' nat) y
, case typeOf x of
App (App modtyp ntyp) inttyp -> case eqTypeRep (typeRep :: TypeRep (Mod :: Nat -> * -> *)) modtyp of
Just HRefl -> let i = unMod x
in case eqTypeRep (typeRep :: TypeRep Int32) inttyp of
Just HRefl -> Just $ SpInt32 i2f i
_ -> case eqTypeRep (typeRep :: TypeRep Int64) inttyp of
Just HRefl -> Just $ SpInt64 i2f i
_ -> Nothing
Nothing -> Nothing
_ -> Nothing
]
-- | Supported matrix elements.
constantD :: Typeable a => a -> Int -> Vector a
constantD x = case specialize x of
Nothing -> error "constantD"
Just (SpDouble Refl) -> constantAux cconstantR x
Just (SpInt64 out y) -> out . constantAux cconstantL y
Just (SpFloat Refl) -> constantAux cconstantF x
Just (SpInt32 out y) -> out . constantAux cconstantI y
Just (SpCDouble Refl) -> constantAux cconstantC x
Just (SpCFloat Refl) -> constantAux cconstantQ x
-- Just (SpModInt32 _ y ret) -> \n -> ret (constantAux cconstantI y n)
-- | Wrapper with a phantom integer for statically checked modular arithmetic.
newtype Mod (n :: Nat) t = Mod {unMod:: t}
deriving (Storable)
instance (NFData t) => NFData (Mod n t)
where
rnf (Mod x) = rnf x
i2f :: Storable t => Vector t -> Vector (Mod n t)
i2f v = unsafeFromForeignPtr (castForeignPtr fp) (i) (n)
where (fp,i,n) = unsafeToForeignPtr v
{-
extractR :: Typeable a => MatrixOrder -> Matrix a -> CInt -> Vector CInt -> CInt -> Vector CInt -> IO (Matrix a)
setRect :: Typeable a => Int -> Int -> Matrix a -> Matrix a -> IO ()
sortI :: (Typeable a , Ord a ) => Vector a -> Vector CInt
sortV :: (Typeable a , Ord a ) => Vector a -> Vector a
compareV :: (Typeable a , Ord a ) => Vector a -> Vector a -> Vector CInt
selectV :: Typeable a => Vector CInt -> Vector a -> Vector a -> Vector a -> Vector a
remapM :: Typeable a => Matrix CInt -> Matrix CInt -> Matrix a -> Matrix a
rowOp :: Typeable a => Int -> a -> Int -> Int -> Int -> Int -> Matrix a -> IO ()
gemm :: Typeable a => Vector a -> Matrix a -> Matrix a -> Matrix a -> IO ()
reorderV :: Typeable a => Vector CInt-> Vector CInt-> Vector a -> Vector a -- see reorderVector for documentation
instance KnownNat m => Element (Mod m I)
where
constantD x n = i2f (constantD (unMod x) n)
extractR ord m mi is mj js = i2fM <$> extractR ord (f2iM m) mi is mj js
setRect i j m x = setRect i j (f2iM m) (f2iM x)
sortI = sortI . f2i
sortV = i2f . sortV . f2i
compareV u v = compareV (f2i u) (f2i v)
selectV c l e g = i2f (selectV c (f2i l) (f2i e) (f2i g))
remapM i j m = i2fM (remap i j (f2iM m))
rowOp c a i1 i2 j1 j2 x = rowOpAux (c_rowOpMI m') c (unMod a) i1 i2 j1 j2 (f2iM x)
where
m' = fromIntegral . natVal $ (undefined :: Proxy m)
gemm u a b c = gemmg (c_gemmMI m') (f2i u) (f2iM a) (f2iM b) (f2iM c)
where
m' = fromIntegral . natVal $ (undefined :: Proxy m)
instance KnownNat m => Element (Mod m Z)
where
constantD x n = i2f (constantD (unMod x) n)
extractR ord m mi is mj js = i2fM <$> extractR ord (f2iM m) mi is mj js
setRect i j m x = setRect i j (f2iM m) (f2iM x)
sortI = sortI . f2i
sortV = i2f . sortV . f2i
compareV u v = compareV (f2i u) (f2i v)
selectV c l e g = i2f (selectV c (f2i l) (f2i e) (f2i g))
remapM i j m = i2fM (remap i j (f2iM m))
rowOp c a i1 i2 j1 j2 x = rowOpAux (c_rowOpML m') c (unMod a) i1 i2 j1 j2 (f2iM x)
where
m' = fromIntegral . natVal $ (undefined :: Proxy m)
gemm u a b c = gemmg (c_gemmML m') (f2i u) (f2iM a) (f2iM b) (f2iM c)
where
m' = fromIntegral . natVal $ (undefined :: Proxy m)
-}
( extractR , setRect , sortI , sortV , compareV , selectV , remapM , rowOp , gemm , reorderV )
= error "todo Element"
constantAux :: (Storable a1, Storable a)
=> (Ptr a1 -> CInt -> Ptr a -> IO CInt) -> a1 -> Int -> Vector a
constantAux fun x n = unsafePerformIO $ do
v <- createVector n
px <- newArray [x]
(applyRaw v id) (fun px) #|"constantAux"
free px
return v
type TConst t = Ptr t -> CInt -> Ptr t -> IO CInt
foreign import ccall unsafe "constantF" cconstantF :: TConst Float
foreign import ccall unsafe "constantR" cconstantR :: TConst Double
foreign import ccall unsafe "constantQ" cconstantQ :: TConst (Complex Float)
foreign import ccall unsafe "constantC" cconstantC :: TConst (Complex Double)
foreign import ccall unsafe "constantI" cconstantI :: TConst Int32
foreign import ccall unsafe "constantL" cconstantL :: TConst Int64
|
