2 | import Control.Monad.Resource
3 | import Data.C.Integer
5 | import Data.Linear.ELift1
8 | import public Data.Fin
9 | import public Data.Linear.Token
10 | import public Data.Array.Index
16 | export %foreign "scheme,chez:(lambda (x y z) (foreign-set! 'unsigned-8 x y z))"
17 | prim__setbits8 : AnyPtr -> Integer -> Bits8 -> PrimIO ()
19 | export %foreign "scheme,chez:(lambda (x y) (foreign-ref 'unsigned-8 x y))"
20 | prim__getbits8 : AnyPtr -> Integer -> Bits8
27 | record CIArray8 (n : Nat) where
32 | at : CIArray8 n -> Fin n -> Bits8
33 | at r x = prim__getbits8 r.ptr (cast $
finToNat x)
36 | ix : CIArray8 n -> (0 m : Nat) -> (x : Ix (S m) n) => Bits8
37 | ix r m = at r (ixToFin x)
40 | atNat : CIArray8 n -> (m : Nat) -> (0 lt : LT m n) => Bits8
41 | atNat r m = at r (natToFinLT m)
43 | foldrI : (m : Nat) -> (0 _ : LTE m n) => (Bits8 -> b -> b) -> b -> CIArray8 n -> b
45 | foldrI (S k) f x r = foldrI k f (f (atNat r k) x) r
49 | -> {auto 0 prf : LTE m n}
50 | -> (Fin n -> Bits8 -> b -> b)
54 | foldrKV_ 0 _ x r = x
55 | foldrKV_ (S k) f x r =
56 | let fin := natToFinLT k @{prf} in foldrKV_ k f (f fin (at r fin) x) r
58 | foldlI : (m : Nat) -> (x : Ix m n) => (b -> Bits8 -> b) -> b -> CIArray8 n -> b
60 | foldlI (S k) f v r = foldlI k f (f v (ix r k)) r
64 | -> {auto x : Ix m n}
65 | -> (Fin n -> b -> Bits8 -> b)
69 | foldlKV_ 0 _ v r = v
70 | foldlKV_ (S k) f v r =
71 | let fin := ixToFin x in foldlKV_ k f (f fin v (at r fin)) r
77 | -> {auto 0 lt : LTE k n}
79 | ontoVect r vs 0 = rewrite plusCommutative m 0 in vs
80 | ontoVect r vs (S x) =
81 | let v := atNat r x {lt}
82 | in rewrite sym (plusSuccRightSucc m x) in ontoVect r (v::vs) x
86 | toVect : {n : _} -> (r : CIArray8 n) -> Vect n Bits8
87 | toVect r = ontoVect r [] n
91 | foldrKV : {n : _} -> (Fin n -> Bits8 -> b -> b) -> b -> CIArray8 n -> b
92 | foldrKV = foldrKV_ n
96 | foldr : {n : _} -> (Bits8 -> b -> b) -> b -> CIArray8 n -> b
101 | foldlKV : {n : _} -> (Fin n -> b -> Bits8 -> b) -> b -> CIArray8 n -> b
102 | foldlKV = foldlKV_ n
106 | foldl : {n : _} -> (b -> Bits8 -> b) -> b -> CIArray8 n -> b
127 | record PrimCArray8 (s : Type) (b : Bool) (n : Nat) where
133 | 0 CArray8 : (s : Type) -> (n : Nat) -> Type
134 | CArray8 s n = PrimCArray8 s False n
138 | 0 CArray8S : (s : Type) -> (n : Nat) -> Type
139 | CArray8S s n = PrimCArray8 s True n
143 | 0 CArray8IO : (n : Nat) -> Type
144 | CArray8IO n = PrimCArray8 World False n
148 | 0 CArray8IOS : (n : Nat) -> Type
149 | CArray8IOS n = PrimCArray8 World True n
152 | unsafeUnwrap : CArray8 s n -> AnyPtr
156 | unsafeWrap : AnyPtr -> CArray8 s n
165 | malloc1 : (n : Nat) -> F1 s (PrimCArray8 s b n)
167 | let p := prim__malloc (cast n)
172 | calloc1 : (n : Nat) -> F1 s (PrimCArray8 s b n)
174 | let p := prim__calloc (cast n) 1
180 | free1 : (r : CArray8 s n) -> F1' s
181 | free1 r = ffi (prim__free r.ptr)
186 | frees1 : {n : Nat} -> (r : CArray8S s n) -> F1' s
188 | let () # t := ffi (prim__scrub r.ptr (cast n)) t
189 | in ffi (prim__free r.ptr) t
191 | parameters {0 n : Nat}
192 | (r : PrimCArray8 s b n)
196 | get : Fin n -> F1 s Bits8
197 | get x t = prim__getbits8 r.ptr (cast $
finToNat x) # t
201 | getIx : (0 m : Nat) -> (x : Ix (S m) n) => F1 s Bits8
202 | getIx m = get (ixToFin x)
206 | getNat : (m : Nat) -> (0 lt : LT m n) => F1 s Bits8
207 | getNat m = get (natToFinLT m)
211 | set : Fin n -> Bits8 -> F1' s
212 | set x v = ffi $
prim__setbits8 r.ptr (cast $
finToNat x) v
216 | setIx : (0 m : Nat) -> (x : Ix (S m) n) => Bits8 -> F1' s
217 | setIx m = set (ixToFin x)
221 | setNat : (m : Nat) -> (0 lt : LT m n) => Bits8 -> F1' s
222 | setNat m = set (natToFinLT m)
224 | writeVect1 : Vect k Bits8 -> Ix k n => F1' s
225 | writeVect1 [] t = () # t
226 | writeVect1 {k = S m} (x :: xs) t =
227 | let _ # t := Array8.setIx m x t
232 | writeVect : Vect n Bits8 -> F1' s
233 | writeVect as = writeVect1 as
242 | withIArray : (CIArray8 n -> c) -> F1 s c
243 | withIArray f t = f (IA r.ptr) # t
247 | writeList : (as : List Bits8) -> PrimCArray8 s b (length as) -> F1' s
248 | writeList as r = writeVect r (fromList as)
259 | -> (release : forall s . PrimCArray8 s b n -> F1' s)
260 | -> (f : forall s . PrimCArray8 s b n -> F1 s c)
262 | withPrimCArray8 n release f =
264 | let r # t := Array8.malloc1 n t
266 | () # t := release r t
274 | -> (f : forall s . CArray8 s n -> F1 s b)
277 | withPrimCArray8 n free1 f
284 | -> (f : forall s . CArray8S s n -> F1 s b)
287 | withPrimCArray8 n frees1 f
293 | parameters {auto has : Lift1 s f}
297 | malloc : (n : Nat) -> f (PrimCArray8 s b n)
298 | malloc n = lift1 (malloc1 n)
302 | calloc : (n : Nat) -> f (PrimCArray8 s b n)
303 | calloc n = lift1 (calloc1 n)
316 | free : CArray8 s n -> f ()
317 | free arr = lift1 (free1 arr)
330 | frees : {n : Nat} -> CArray8S s n -> f ()
331 | frees arr = lift1 (frees1 arr)
334 | fromList : (as : List Bits8) -> f (PrimCArray8 s b (length as))
335 | fromList as = Prelude.do
336 | arr <- Array8.malloc (length as)
337 | lift1 $
writeList as arr
345 | ELift1 s f => Resource f (CArray8 s n) where
346 | cleanup arr = lift1 (free1 arr)
349 | {n : Nat} -> ELift1 s f => Resource f (CArray8S s n) where
350 | cleanup arr = lift1 (frees1 arr)