synthesizer-llvm-0.5: src/Synthesizer/LLVM/CausalParameterized/Process.hs
{-# LANGUAGE NoImplicitPrelude #-}
{-# LANGUAGE TypeFamilies #-}
{-# LANGUAGE TypeOperators #-}
{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE ExistentialQuantification #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE ForeignFunctionInterface #-}
module Synthesizer.LLVM.CausalParameterized.Process (
T(Cons), simple,
fromSignal, toSignal,
mapAccum, map, mapSimple, zipWithSimple,
apply, compose, first,
feedFst, feedSnd,
loop, take, takeWhile, integrate,
module Synthesizer.LLVM.CausalParameterized.Process
) where
import Synthesizer.LLVM.CausalParameterized.ProcessPrivate
import qualified Synthesizer.LLVM.Plug.Input as PIn
import qualified Synthesizer.LLVM.Plug.Output as POut
import qualified Synthesizer.LLVM.Parameter as Param
import qualified Synthesizer.CausalIO.Process as PIO
import Synthesizer.LLVM.Parameterized.Signal (($#), )
import qualified Synthesizer.LLVM.RingBuffer as RingBuffer
import qualified Synthesizer.LLVM.Parameterized.Signal as Sig
import qualified Synthesizer.LLVM.Frame.Stereo as Stereo
import qualified Synthesizer.LLVM.Frame as Frame
import qualified Synthesizer.LLVM.Execution as Exec
import qualified Synthesizer.LLVM.Simple.Value as Value
import qualified Data.StorableVector.Lazy as SVL
import qualified Data.StorableVector as SV
import qualified Data.StorableVector.Base as SVB
import qualified Synthesizer.Generic.Cut as Cut
import qualified Synthesizer.Plain.Modifier as Modifier
import qualified LLVM.Extra.ScalarOrVector as SoV
import qualified LLVM.Extra.Vector as Vector
import qualified LLVM.Extra.MaybeContinuation as Maybe
import qualified LLVM.Extra.ForeignPtr as ForeignPtr
import qualified LLVM.Extra.Memory as Memory
import qualified LLVM.Extra.Control as C
import qualified LLVM.Extra.Class as Class
import qualified LLVM.Extra.Arithmetic as A
import LLVM.Extra.Class (MakeValueTuple, ValueTuple, Undefined, undefTuple, )
import LLVM.Util.Loop (Phi, )
import LLVM.Core as LLVM
import Types.Data.Num (D2, )
import Types.Data.Ord ((:<:), )
import qualified Types.Data.Num as TypeNum
import qualified Types.Data.Bool as TypeBool
import qualified Control.Monad.HT as M
import qualified Control.Arrow as Arr
import qualified Control.Category as Cat
import Control.Monad.Trans.State (runState, state, evalState, )
import Control.Arrow (arr, (<<<), (>>>), (&&&), )
import Control.Monad (liftM2, liftM3, when, )
import Control.Applicative (liftA2, )
import System.Random (Random, RandomGen, randomR, )
import qualified Algebra.Transcendental as Trans
import qualified Algebra.Field as Field
import qualified Algebra.Ring as Ring
import qualified Algebra.Additive as Additive
import Data.Function.HT (nest, )
import Data.Tuple.HT (swap, )
import Data.Word (Word32, )
import Foreign.Storable.Tuple ()
import Foreign.Storable (Storable, poke, )
import qualified Synthesizer.LLVM.Alloc as Alloc
import qualified Foreign.Marshal.Utils as AllocUtil
import Foreign.ForeignPtr (withForeignPtr, )
import Foreign.Ptr (FunPtr, )
import Control.Exception (bracket, )
import qualified System.Unsafe as Unsafe
import qualified Data.List as List
import qualified Synthesizer.LLVM.Debug.Storable as DebugSt
import qualified Synthesizer.LLVM.Debug.Counter as DebugCnt
import NumericPrelude.Numeric
import NumericPrelude.Base hiding (and, iterate, map, zip, zipWith, take, takeWhile, )
infixl 0 $<, $>, $*, $<#, $>#, $*#
-- infixr 0 $:* -- can be used together with $
applyFst, ($<) :: T p (a,b) c -> Sig.T p a -> T p b c
applyFst proc sig =
proc <<< feedFst sig
applySnd, ($>) :: T p (a,b) c -> Sig.T p b -> T p a c
applySnd proc sig =
proc <<< feedSnd sig
{-
These infix operators may become methods of a type class
that can also have synthesizer-core:Causal.Process as instance.
-}
($*) :: T p a b -> Sig.T p a -> Sig.T p b
($*) = apply
($<) = applyFst
($>) = applySnd
{- |
provide constant input in a comfortable way
-}
($*#) ::
(Storable ah, MakeValueTuple ah, ValueTuple ah ~ a,
Memory.C a) =>
T p a b -> ah -> Sig.T p b
proc $*# x = proc $* (Sig.constant $# x)
($<#) ::
(Storable ah, MakeValueTuple ah, ValueTuple ah ~ a,
Memory.C a) =>
T p (a,b) c -> ah -> T p b c
proc $<# x = proc $< (Sig.constant $# x)
($>#) ::
(Storable bh, MakeValueTuple bh, ValueTuple bh ~ b,
Memory.C b) =>
T p (a,b) c -> bh -> T p a c
proc $># x = proc $> (Sig.constant $# x)
mapAccumSimple ::
(Memory.C s) =>
(forall r. a -> s -> CodeGenFunction r (b,s)) ->
(forall r. CodeGenFunction r s) ->
T p a b
mapAccumSimple f s =
mapAccum (\() -> f) (\() -> s) (return ()) (return ())
-- cf. synthesizer-core:Causal.Process, can be defined for any arrow
{-# INLINE replicateControlled #-}
replicateControlled :: Int -> T p (c,x) x -> T p (c,x) x
replicateControlled n p =
nest n
(Arr.arr fst &&& p >>> )
(Arr.arr snd)
-- cf. synthesizer-core:Causal.Process
{-# INLINE feedbackControlled #-}
feedbackControlled ::
(Storable ch,
MakeValueTuple ch, ValueTuple ch ~ c,
Memory.C c) =>
Param.T p ch ->
T p ((ctrl,a),c) b -> T p (ctrl,b) c -> T p (ctrl,a) b
feedbackControlled initial forth back =
loop initial
(Arr.arr (fst.fst) &&& forth >>> Arr.arr snd &&& back)
fromModifier ::
(Value.Flatten ah, Value.Registers ah ~ al,
Value.Flatten bh, Value.Registers bh ~ bl,
Value.Flatten ch, Value.Registers ch ~ cl,
Value.Flatten sh, Value.Registers sh ~ sl,
Memory.C sl) =>
Modifier.Simple sh ch ah bh -> T p (cl,al) bl
fromModifier (Modifier.Simple initial step) =
mapAccumSimple
(\(c,a) s ->
Value.flatten $
runState
(step (Value.unfold c) (Value.unfold a))
(Value.unfold s))
(Value.flatten initial)
{- |
Run a causal process independently on each stereo channel.
-}
stereoFromMono ::
T p a b -> T p (Stereo.T a) (Stereo.T b)
stereoFromMono =
Stereo.arrowFromMono
stereoFromMonoControlled ::
T p (c,a) b -> T p (c, Stereo.T a) (Stereo.T b)
stereoFromMonoControlled =
Stereo.arrowFromMonoControlled
stereoFromChannels ::
T p a b -> T p a b -> T p (Stereo.T a) (Stereo.T b)
stereoFromChannels =
Stereo.arrowFromChannels
{-
In order to let this work we have to give the disable-mmx option somewhere,
but where?
-}
stereoFromVector ::
(IsPrimitive a, IsPrimitive b) =>
T p (Value (Vector D2 a)) (Value (Vector D2 b)) ->
T p (Stereo.T (Value a)) (Stereo.T (Value b))
stereoFromVector proc =
mapSimple Frame.stereoFromVector <<<
proc <<<
mapSimple Frame.vectorFromStereo
vectorize ::
(Vector.C va, n ~ Vector.Size va, a ~ Vector.Element va,
Vector.C vb, n ~ Vector.Size vb, b ~ Vector.Element vb) =>
T p a b -> T p va vb
vectorize = vectorizeSize undefined
{-
insert and extract instructions will be in opposite order,
no matter whether we use foldr or foldl
and independent from the order of proc and channel in replaceChannel.
However, LLVM neglects the order anyway.
-}
vectorizeSize ::
(Vector.C va, n ~ Vector.Size va, a ~ Vector.Element va,
Vector.C vb, n ~ Vector.Size vb, b ~ Vector.Element vb) =>
n -> T p a b -> T p va vb
vectorizeSize n proc =
foldl
(\acc i -> replaceChannel i proc acc)
(Arr.arr (const $ undefTuple)) $
List.take (TypeNum.fromIntegerT n) [0 ..]
{- |
Given a vector process, replace the i-th output by output
that is generated by a scalar process from the i-th input.
-}
replaceChannel ::
(Vector.C va, n ~ Vector.Size va, a ~ Vector.Element va,
Vector.C vb, n ~ Vector.Size vb, b ~ Vector.Element vb) =>
Int -> T p a b -> T p va vb -> T p va vb
replaceChannel i channel proc =
let li = valueOf $ fromIntegral i
in zipWithSimple (Vector.insert li) <<<
(channel <<< mapSimple (Vector.extract li)) &&&
proc
{- |
Read the i-th element from each array.
-}
arrayElement ::
(IsFirstClass a, LLVM.GetValue (LLVM.Array dim a) index,
LLVM.ValueType (LLVM.Array dim a) index ~ a,
TypeNum.NaturalT index, TypeNum.NaturalT dim,
(index :<: dim) ~ TypeBool.True) =>
index -> T p (Value (LLVM.Array dim a)) (Value a)
arrayElement i =
mapSimple (\array -> LLVM.extractvalue array i)
{- |
Read the i-th element from an aggregate type.
-}
element ::
(IsFirstClass a, LLVM.GetValue agg index,
LLVM.ValueType agg index ~ a) =>
index -> T p (Value agg) (Value a)
element i =
mapSimple (\array -> LLVM.extractvalue array i)
{- |
You may also use '(+)'.
-}
mix ::
(A.Additive a) =>
T p (a, a) a
mix =
zipWithSimple Frame.mix
{- |
You may also use '(+)' and a 'Sig.constant' signal or a number literal.
-}
raise ::
(A.Additive al, Storable a,
MakeValueTuple a, ValueTuple a ~ al, Memory.C al) =>
Param.T p a -> T p al al
raise =
map Frame.mix
{- |
You may also use '(*)'.
-}
envelope ::
(A.PseudoRing a) =>
T p (a, a) a
envelope =
zipWithSimple Frame.amplifyMono
envelopeStereo ::
(A.PseudoRing a) =>
T p (a, Stereo.T a) (Stereo.T a)
envelopeStereo =
zipWithSimple Frame.amplifyStereo
{- |
You may also use '(*)' and a 'Sig.constant' signal or a number literal.
-}
amplify ::
(A.PseudoRing al, Storable a,
MakeValueTuple a, ValueTuple a ~ al, Memory.C al) =>
Param.T p a -> T p al al
amplify =
map Frame.amplifyMono
amplifyStereo ::
(A.PseudoRing al, Storable a,
MakeValueTuple a, ValueTuple a ~ al, Memory.C al) =>
Param.T p a -> T p (Stereo.T al) (Stereo.T al)
amplifyStereo =
map Frame.amplifyStereo
mapLinear ::
(IsArithmetic a, Storable a,
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am,
MakeValueTuple a, ValueTuple a ~ (Value a)) =>
Param.T p a -> Param.T p a -> T p (Value a) (Value a)
mapLinear depth center =
map
(\(d,c) x -> A.add c =<< A.mul d x)
(depth&&¢er)
mapExponential ::
(Trans.C a, IsFloating a, IsConst a, Storable a,
SoV.TranscendentalConstant a,
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am,
MakeValueTuple a, ValueTuple a ~ (Value a)) =>
Param.T p a -> Param.T p a -> T p (Value a) (Value a)
mapExponential depth center =
map
(\(d,c) x ->
A.mul c =<< A.exp =<< A.mul d x)
(log depth &&& center)
{- |
@quantizeLift k f@ applies the process @f@ to every @k@th sample
and repeats the result @k@ times.
Like 'SigP.interpolateConstant' this function can be used
for computation of filter parameters at a lower rate.
This can be useful, if you have a frequency control signal at sample rate
that shall be used both for an oscillator and a frequency filter.
-}
quantizeLift ::
(Memory.C b,
Ring.C c,
IsFloating c, CmpRet c, CmpResult c ~ Bool,
Storable c, MakeValueTuple c, ValueTuple c ~ (Value c),
Memory.FirstClass c, Memory.Stored c ~ cm, IsSized c, IsSized cm,
IsConst c) =>
Param.T p c ->
T p a b ->
T p a b
quantizeLift k
(Cons next start createIOContext deleteIOContext) = Cons
(\(kl,parameter) a0 bState0 -> do
((b1,state1), ss1) <-
Maybe.fromBool $
C.whileLoop
(valueOf True, bState0)
(\(cont1, (_, ss0)) ->
and cont1 =<< A.fcmp FPOLE ss0 (value LLVM.zero))
(\(_,((_,state01), ss0)) ->
Maybe.toBool $ liftM2 (,)
(next parameter a0 state01)
(Maybe.lift $ A.add ss0 (Param.value k kl)))
ss2 <- Maybe.lift $ A.sub ss1 (valueOf Ring.one)
return (b1, ((b1,state1),ss2)))
(fmap (\sa -> ((undefTuple, sa), value LLVM.zero)) . start)
(\p -> do
(ioContext, (nextParam, startParam)) <- createIOContext p
return (ioContext, ((Param.get k p, nextParam), startParam)))
deleteIOContext
{- |
Compute the phases from phase distortions and frequencies.
It's like integrate but with wrap-around performed by @fraction@.
For FM synthesis we need also negative phase distortions,
thus we use 'SoV.addToPhase' which supports that.
-}
osciCore ::
(Memory.FirstClass t, Memory.Stored t ~ tm, IsSized t, IsSized tm,
IsConst t, SoV.Fraction t, Additive.C t) =>
T p (Value t, Value t) (Value t)
osciCore =
zipWithSimple SoV.addToPhase <<<
Arr.second
(mapAccumSimple
(\a s -> do
b <- SoV.incPhase a s
return (s,b))
(return (valueOf Additive.zero)))
-- this is in principle equivalent to mapAccumSimple,
-- but needs more type constraints
-- (loop Additive.zero (arr snd &&& zipWithSimple SoV.incPhase))
osciSimple ::
(Memory.FirstClass t, Memory.Stored t ~ tm, IsSized t, IsSized tm,
IsConst t, SoV.Fraction t, Additive.C t) =>
(forall r. Value t -> CodeGenFunction r y) ->
T p (Value t, Value t) y
osciSimple wave =
mapSimple wave <<< osciCore
shapeModOsci ::
(Memory.FirstClass t, Memory.Stored t ~ tm, IsSized t, IsSized tm,
IsConst t, SoV.Fraction t, Additive.C t) =>
(forall r. c -> Value t -> CodeGenFunction r y) ->
T p (c, (Value t, Value t)) y
shapeModOsci wave =
zipWithSimple wave <<< Arr.second osciCore
{- |
Delay time must be non-negative.
The initial value is needed in order to determine the ring buffer element type.
-}
delay ::
(Storable a,
MakeValueTuple a, ValueTuple a ~ al,
Memory.C al) =>
Param.T p a -> Param.T p Int -> T p al al
delay initial time =
mapSimple RingBuffer.oldest
<<<
RingBuffer.track initial time
{- |
Delay by one sample.
For very small delay times (say up to 8)
it may be more efficient to apply 'delay1' several times
or to use a pipeline,
e.g. @pipeline (id :: T (Vector D4 Float) (Vector D4 Float))@
delays by 4 samples in an efficient way.
In principle it would be also possible to use
@unpack (delay1 (const $ toVector (0,0,0,0)))@
but 'unpack' causes an additional delay.
Thus @unpack (id :: T (Vector D4 Float) (Vector D4 Float))@ may do,
what you want.
-}
delay1 ::
(Storable a,
MakeValueTuple a, ValueTuple a ~ al,
Memory.C al) =>
Param.T p a -> T p al al
delay1 initial =
loop initial (arr swap)
differentiate ::
(A.Additive al,
Storable a,
MakeValueTuple a, ValueTuple a ~ al,
Memory.C al) =>
Param.T p a -> T p al al
differentiate initial =
Cat.id - delay1 initial
{- |
Delay time must be greater than zero!
-}
comb ::
(Ring.C a, Storable a,
IsArithmetic a, MakeValueTuple a, ValueTuple a ~ (Value a),
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am) =>
Param.T p a -> Param.T p Int ->
T p (Value a) (Value a)
comb gain time =
let z = Additive.zero `asTypeOf` gain
in loop z (mix >>> (Cat.id &&&
(delay z (subtract 1 time) >>> amplify gain)))
combStereo ::
(Ring.C a, Storable a,
IsArithmetic a, MakeValueTuple a, ValueTuple a ~ (Value a),
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am) =>
Param.T p a -> Param.T p Int ->
T p (Stereo.T (Value a)) (Stereo.T (Value a))
combStereo gain time =
let z = Additive.zero `asTypeOf` (liftA2 Stereo.cons gain gain)
in loop z (mix >>> (Cat.id &&&
(delay z (subtract 1 time) >>> amplifyStereo gain)))
{- |
Example: apply a stereo reverb to a mono sound.
> traverse
> (\seed -> reverb (Random.mkStdGen seed) 16 (0.92,0.98) (200,1000))
> (Stereo.cons 42 23)
-}
reverb ::
(Field.C a, Random a, Storable a,
IsArithmetic a, MakeValueTuple a, ValueTuple a ~ (Value a),
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am,
RandomGen g) =>
g -> Int -> (a,a) -> (Int,Int) ->
T p (Value a) (Value a)
reverb rnd num gainRange timeRange =
amplify (return (recip (fromIntegral num) `asTypeOf` fst gainRange)) <<<
(foldl (+) Cat.id $
List.take num $
List.map (\(g,t) -> comb $# g $# t) $
flip evalState rnd $
M.repeat $
liftM2 (,)
(state (randomR gainRange))
(state (randomR timeRange)))
{- |
This allows to compute a chain of equal processes efficiently,
if all of these processes can be bundled in one vectorial process.
Applications are an allpass cascade or an FM operator cascade.
The function expects that the vectorial input process
works like parallel scalar processes.
The different pipeline stages may be controlled by different parameters,
but the structure of all pipeline stages must be equal.
Our function feeds the input of the pipelined process
to the zeroth element of the Vector.
The result of processing the i-th element (the i-th channel, so to speak)
is fed to the (i+1)-th element.
The (n-1)-th element of the vectorial process is emitted as output of pipelined process.
The pipeline necessarily introduces a delay of (n-1) values.
For simplification we extend this to n values delay.
If you need to combine the resulting signal from the pipeline
with another signal in a 'zip'-like way,
you may delay that signal with @pipeline id@.
The first input values in later stages of the pipeline
are initialized with zero.
If this is not appropriate for your application,
then we may add a more sensible initialization.
-}
pipeline ::
(Vector.C v, a ~ Vector.Element v,
Class.Zero v, Memory.C v) =>
T p v v -> T p a a
pipeline (Cons next start createIOContext deleteIOContext) = Cons
(\param a0 (v0,s0) -> do
(a1,v1) <- Maybe.lift $ Vector.shiftUp a0 v0
(v2,s2) <- next param v1 s0
return (a1, (v2,s2)))
(\p -> do
s <- start p
return (Class.zeroTuple, s))
createIOContext
deleteIOContext
linearInterpolation ::
(Ring.C a, IsArithmetic a, IsConst a) =>
Value a -> (Value a, Value a) -> CodeGenFunction r (Value a)
linearInterpolation r (a,b) = do
ra <- A.mul a =<< A.sub (valueOf one) r
rb <- A.mul b r
A.add ra rb
{- |
> frequencyModulationLinear signal
is a causal process mapping from a shrinking factor
to the modulated input @signal@.
Similar to 'Sig.interpolateConstant'
but the factor is reciprocal and controllable
and we use linear interpolation.
The shrinking factor must be non-negative.
-}
frequencyModulationLinear ::
(-- Memory.C a,
Ring.C a,
IsFloating a, CmpRet a, CmpResult a ~ Bool,
Storable a, MakeValueTuple a, ValueTuple a ~ (Value a),
Memory.FirstClass a, Memory.Stored a ~ am, IsSized a, IsSized am,
IsConst a) =>
Sig.T p (Value a) -> T p (Value a) (Value a)
frequencyModulationLinear
(Sig.Cons next start createIOContext deleteIOContext) =
Cons
(\parameter k yState0 -> do
(((y02,y12),state2), ss2) <-
Maybe.fromBool $
C.whileLoop
(valueOf True, yState0)
(\(cont0, (_, ss0)) ->
and cont0 =<< A.fcmp FPOGE ss0 (valueOf Ring.one))
(\(_,(((_,y01),state0), ss0)) ->
Maybe.toBool $ liftM2 (,)
(do (y11,state1) <- next parameter state0
return ((y01,y11),state1))
(Maybe.lift $ A.sub ss0 (valueOf Ring.one)))
Maybe.lift $ do
y <- linearInterpolation ss2 (y02,y12)
ss3 <- A.add ss2 k
return (y, (((y02,y12),state2),ss3)))
(\p -> do
sa <- start p
return (((value undef, value undef), sa), valueOf 2))
createIOContext
deleteIOContext
{- |
@trigger fill signal@ send @signal@ to the output
and restart it whenever the Boolean process input is 'True'.
Before the first occurrence of 'True'
and between instances of the signal the output is filled with the @fill@ value.
Attention:
This function will crash if the input generator
uses fromStorableVectorLazy, piecewiseConstant or lazySize,
since these functions contain mutable references and in-place updates,
and thus they cannot read lazy Haskell data multiple times.
-}
trigger ::
(Storable a, MakeValueTuple a, ValueTuple a ~ al, C.Select al,
Memory.C al) =>
Param.T p a ->
Sig.T p al ->
T p (Value Bool) al
trigger fill (Sig.Cons next start createIOContext deleteIOContext) = Cons
(\(nextParam, startParam, f) b0 (active0, s0) -> Maybe.lift $ do
(active1,s1) <-
C.ifThen b0 (active0,s0)
(fmap ((,) (valueOf False)) $ start startParam)
(active2,(a2,s2)) <-
Maybe.toBool $ Maybe.guard active1 >> next nextParam s1
a3 <- C.select active2 a2 (Param.value fill f)
return (a3,(active2,s2)))
(\() -> return (valueOf False, undefTuple))
(\p -> do
(context, (nextParam, startParam)) <- createIOContext p
return (context, ((nextParam, startParam, Param.get fill p), ())))
deleteIOContext
{- |
On each restart the parameters of type @b@ are passed to the signal.
triggerParam ::
(MakeValueTuple a, ValueTuple a ~ al,
MakeValueTuple b, ValueTuple b ~ bl) =>
Param.T p a ->
(Param.T p b -> Sig.T p a) ->
T p (Value Bool, bl) al
triggerParam fill sig =
-}
foreign import ccall safe "dynamic" derefFillPtr ::
Exec.Importer (Ptr param -> Word32 -> Ptr a -> Ptr b -> IO Word32)
runStorable ::
(Storable a, MakeValueTuple a, ValueTuple a ~ valueA, Memory.C valueA,
Storable b, MakeValueTuple b, ValueTuple b ~ valueB, Memory.C valueB) =>
T p valueA valueB ->
IO (p -> SV.Vector a -> SV.Vector b)
runStorable (Cons next start createIOContext deleteIOContext) = do
fill <-
fmap derefFillPtr $
Exec.compileModule $
createNamedFunction ExternalLinkage "fillprocessblock" $
\paramPtr size alPtr blPtr -> do
(nextParam,startParam) <- Memory.load paramPtr
s <- start startParam
(pos,_) <- Maybe.arrayLoop2 size alPtr blPtr s $
\ aPtri bPtri s0 -> do
a <- Maybe.lift $ Memory.load aPtri
(b,s1) <- next nextParam a s0
Maybe.lift $ Memory.store b bPtri
return s1
ret (pos :: Value Word32)
return $ \p as ->
Unsafe.performIO $
bracket (createIOContext p) (deleteIOContext . fst) $
\ (_,params) ->
SVB.withStartPtr as $ \ aPtr len ->
SVB.createAndTrim len $ \ bPtr ->
Alloc.with params $ \paramPtr ->
fmap fromIntegral $
fill (Memory.castStorablePtr paramPtr)
(fromIntegral len)
(Memory.castStorablePtr aPtr)
(Memory.castStorablePtr bPtr)
applyStorable ::
(Storable a, MakeValueTuple a, ValueTuple a ~ valueA, Memory.C valueA,
Storable b, MakeValueTuple b, ValueTuple b ~ valueB, Memory.C valueB) =>
T p valueA valueB ->
p -> SV.Vector a -> SV.Vector b
applyStorable gen = Unsafe.performIO $ runStorable gen
foreign import ccall safe "dynamic" derefChunkPtr ::
Exec.Importer (Ptr nextParamStruct -> Ptr stateStruct -> Word32 ->
Ptr structA -> Ptr structB -> IO Word32)
compileChunky ::
(Memory.C valueA, Memory.Struct valueA ~ structA,
Memory.C valueB, Memory.Struct valueB ~ structB,
Memory.C state, Memory.Struct state ~ stateStruct,
Memory.C startParamValue, Memory.Struct startParamValue ~ startParamStruct,
Memory.C nextParamValue, Memory.Struct nextParamValue ~ nextParamStruct) =>
(forall r.
nextParamValue ->
valueA -> state ->
Maybe.T r (Value Bool, (Value (Ptr structB), state)) (valueB, state)) ->
(forall r.
startParamValue ->
CodeGenFunction r state) ->
IO (FunPtr (Ptr startParamStruct -> IO (Ptr stateStruct)),
FunPtr (Ptr stateStruct -> IO ()),
FunPtr (Ptr nextParamStruct -> Ptr stateStruct -> Word32 ->
Ptr structA -> Ptr structB -> IO Word32))
compileChunky next start =
Exec.compileModule $
liftM3 (,,)
(createNamedFunction ExternalLinkage "startprocess" $
\paramPtr -> do
pptr <- LLVM.malloc
flip Memory.store pptr =<< start =<< Memory.load paramPtr
ret pptr)
(createNamedFunction ExternalLinkage "stopprocess" $
\ pptr -> LLVM.free pptr >> ret ())
(createNamedFunction ExternalLinkage "fillprocess" $
\ paramPtr sptr loopLen aPtr bPtr -> do
param <- Memory.load paramPtr
sInit <- Memory.load sptr
(pos,sExit) <- Maybe.arrayLoop2 loopLen aPtr bPtr sInit $
\ aPtri bPtri s0 -> do
a <- Maybe.lift $ Memory.load aPtri
(b,s1) <- next param a s0
Maybe.lift $ Memory.store b bPtri
return s1
Memory.store sExit sptr
ret (pos :: Value Word32))
foreign import ccall safe "dynamic" derefStartParamPtr ::
Exec.Importer (Ptr startParamStruct -> IO (Ptr stateStruct))
foreign import ccall safe "dynamic" derefStopPtr ::
Exec.Importer (Ptr stateStruct -> IO ())
compilePlugged ::
(Memory.C state, Memory.Struct state ~ stateStruct,
Memory.C startParamValue, Memory.Struct startParamValue ~ startParamStruct,
Memory.C nextParamValue, Memory.Struct nextParamValue ~ nextParamStruct,
Undefined stateIn, Phi stateIn,
Undefined stateOut, Phi stateOut,
Memory.C paramValueIn, Memory.Struct paramValueIn ~ paramStructIn,
Memory.C paramValueOut, Memory.Struct paramValueOut ~ paramStructOut) =>
(forall r.
paramValueIn ->
stateIn -> LLVM.CodeGenFunction r (valueA, stateIn)) ->
(forall r.
paramValueIn ->
LLVM.CodeGenFunction r stateIn) ->
(forall r.
nextParamValue ->
valueA -> state ->
Maybe.T r
(Value Bool, (Value Word32, (stateIn, state, stateOut)))
(valueB, state)) ->
(forall r.
startParamValue ->
CodeGenFunction r state) ->
(forall r.
paramValueOut ->
valueB -> stateOut -> LLVM.CodeGenFunction r stateOut) ->
(forall r.
paramValueOut ->
LLVM.CodeGenFunction r stateOut) ->
IO (FunPtr (Ptr startParamStruct -> IO (Ptr stateStruct)),
FunPtr (Ptr stateStruct -> IO ()),
FunPtr (Ptr nextParamStruct -> Ptr stateStruct -> Word32 ->
Ptr paramStructIn -> Ptr paramStructOut -> IO Word32))
compilePlugged nextIn startIn next start nextOut startOut =
Exec.compileModule $
liftM3 (,,)
(createNamedFunction ExternalLinkage "startprocess" $
\paramPtr -> do
pptr <- LLVM.malloc
flip Memory.store pptr =<< start =<< Memory.load paramPtr
ret pptr)
(createNamedFunction ExternalLinkage "stopprocess" $
\ pptr -> LLVM.free pptr >> ret ())
(createNamedFunction ExternalLinkage "fillprocess" $
\ paramPtr sptr loopLen inPtr outPtr -> do
param <- Memory.load paramPtr
sInit <- Memory.load sptr
inParam <- Memory.load inPtr
outParam <- Memory.load outPtr
inInit <- startIn inParam
outInit <- startOut outParam
(pos,(_,sExit,_)) <-
Maybe.fixedLengthLoop loopLen (inInit, sInit, outInit) $
\ (in0,s0,out0) -> do
(a,in1) <- Maybe.lift $ nextIn inParam in0
(b,s1) <- next param a s0
out1 <- Maybe.lift $ nextOut outParam b out0
return (in1, s1, out1)
Memory.store sExit sptr
ret (pos :: Value Word32))
runStorableChunky ::
(Storable a, MakeValueTuple a, ValueTuple a ~ valueA, Memory.C valueA,
Storable b, MakeValueTuple b, ValueTuple b ~ valueB, Memory.C valueB) =>
T p valueA valueB ->
IO (p -> SVL.Vector a -> SVL.Vector b)
runStorableChunky proc =
fmap ($ const SVL.empty) $
runStorableChunkyCont proc
{- |
This function should be used
instead of @StorableVector.Lazy.Pattern.splitAt@ and subsequent @append@,
because it does not have the risk of a memory leak.
-}
runStorableChunkyCont ::
(Storable a, MakeValueTuple a, ValueTuple a ~ valueA, Memory.C valueA,
Storable b, MakeValueTuple b, ValueTuple b ~ valueB, Memory.C valueB) =>
T p valueA valueB ->
IO ((SVL.Vector a -> SVL.Vector b) ->
p ->
SVL.Vector a -> SVL.Vector b)
runStorableChunkyCont (Cons next start createIOContext deleteIOContext) = do
(startFunc, stopFunc, fill) <- compileChunky next start
return $
\ procRest p sig ->
SVL.fromChunks $ Unsafe.performIO $ do
(ioContext, (nextParam, startParam)) <- createIOContext p
when False $ DebugCnt.with DebugSt.dumpCounter $ do
DebugSt.dump "next-param" nextParam
DebugSt.dump "start-param" startParam
statePtr <- ForeignPtr.newParam stopFunc startFunc startParam
nextParamPtr <-
ForeignPtr.new (deleteIOContext ioContext) nextParam
let go xt =
Unsafe.interleaveIO $
case xt of
[] -> return []
x:xs -> SVB.withStartPtr x $ \aPtr size -> do
v <-
ForeignPtr.with nextParamPtr $ \nptr ->
withForeignPtr statePtr $ \sptr ->
SVB.createAndTrim size $
fmap fromIntegral .
derefChunkPtr fill nptr sptr
(fromIntegral size)
(Memory.castStorablePtr aPtr) .
Memory.castStorablePtr
(if SV.length v > 0
then fmap (v:)
else id) $
(if SV.length v < size
then return $ SVL.chunks $
procRest $ SVL.fromChunks $
SV.drop (SV.length v) x : xs
else go xs)
go (SVL.chunks sig)
applyStorableChunky ::
(Storable a, MakeValueTuple a, ValueTuple a ~ valueA, Memory.C valueA,
Storable b, MakeValueTuple b, ValueTuple b ~ valueB, Memory.C valueB) =>
T p valueA valueB ->
p -> SVL.Vector a -> SVL.Vector b
applyStorableChunky gen =
Unsafe.performIO (runStorableChunky gen)
{-
I liked to write something with signature
> import qualified Synthesizer.Causal.Process as Causal
>
> liftStorableChunk ::
> T p valueA valueB ->
> IO (p -> Causal.T (SV.Vector a) (SV.Vector b))
but it does not quite work this way.
@Causal.T@ from @synthesizer-core@ uses an immutable state internally,
whereas @T@ uses mutable states.
In principle the immutable state of @Causal.T@
could be used for breaking the processing of a stream
and continue it on two different streams in parallel.
I have no function that makes use of this feature,
and thus an @ST@ monad might be a way out.
With this function we can convert an LLVM causal process to an causal IO arrow.
We also need the plugs in order
to read and write LLVM values from and to Haskell data chunks.
In a second step we could convert this to a processor of lazy lists,
and thus to a processor of chunky storable vectors.
-}
processIOCore ::
(Cut.Read a) =>
PIn.T a b ->
T p b c ->
POut.T c d ->
IO (p -> PIO.T a d)
processIOCore
(PIn.Cons nextIn startIn createIn deleteIn)
(Cons next start createIOContext deleteIOContext)
(POut.Cons nextOut startOut createOut deleteOut) = do
(startFunc, stopFunc, fill) <-
compilePlugged nextIn startIn next start nextOut startOut
return $ \p -> PIO.Cons
(\a s@(_, (nextParamPtr,statePtr)) -> do
let maximumSize = Cut.length a
nptr = Memory.castStorablePtr nextParamPtr
sptr = statePtr
(contextIn, paramIn) <- createIn a
(contextOut,paramOut) <- createOut maximumSize
actualSize <-
AllocUtil.with paramIn $ \inptr ->
AllocUtil.with paramOut $ \outptr ->
derefChunkPtr fill nptr sptr
(fromIntegral maximumSize)
(Memory.castStorablePtr inptr)
(Memory.castStorablePtr outptr)
deleteIn contextIn
b <- deleteOut (fromIntegral actualSize) contextOut
return (b, s))
(do
(ioContext, (nextParam, startParam)) <- createIOContext p
when False $ DebugCnt.with DebugSt.dumpCounter $ do
DebugSt.dump "next-param" nextParam
DebugSt.dump "start-param" startParam
nextParamPtr <- Alloc.malloc
poke nextParamPtr nextParam
statePtr <-
AllocUtil.with startParam
(derefStartParamPtr startFunc . Memory.castStorablePtr)
return (ioContext, (nextParamPtr, statePtr)))
(\(ioContext, (nextParamPtr,statePtr)) -> do
derefStopPtr stopFunc statePtr
Alloc.free nextParamPtr
deleteIOContext ioContext)
processIO ::
(Cut.Read a, PIn.Default a, POut.Default d) =>
T p (PIn.Element a) (POut.Element d) ->
IO (p -> PIO.T a d)
processIO proc =
processIOCore PIn.deflt proc POut.deflt