module Control.Linear (St, A, Blank, Pair, Fn, (>>==), rtn,
run, bimap, assoc1, assoc2, drop1, drop2, undrop1, undrop2, swap, apply, curry, distr, assoc3, assoc4, void', bimap',
Exclusive, Semiclosed, Open, Placeholder(Placeholder), open, getStdin, getStdout, getStderr, close, close1, fileSize, setFileSize, eof, seek, tell, char, line, lookahead, contents, putC, putS, random,
Pointer, Linear(Linear), Nonlinear(Nonlinear), Focused(Focused), Fix(In), fixInj1, fixInj2, Weakening(weakening), contraction, new, free, split, ptrSwap,
focus, focusHdl,
peek', poke', changeType,
newNonlinear, peek1, poke1,
fork, join',
helloWorld, printStuff, concurrent
) where
import Control.Arrow
import Control.Category
import Control.Monad
import Control.Parallel
import GHC.Prim
import GHC.IO
import GHC.Base (realWorld#)
import System.IO
import Foreign.ForeignPtr hiding (unsafeForeignPtrToPtr)
import Foreign.ForeignPtr.Unsafe
import Foreign.StablePtr
import Foreign.Ptr
import qualified Foreign.Marshal.Alloc as A
import Foreign.Storable
import Data.Default
import Data.Int
import Prelude hiding (id, (.), curry)
import System.Random hiding (split, random)
import System.IO.Unsafe
data St = St (State# RealWorld)
newtype A t u v = A (u -> (v, t))
type Fn t u = A () (Pair t St) (Pair u St)
data Blank = Blank
data Pair t u = Pair t u
instance (Default a) => Category (A a) where
id = rtn def
a . a2 = a2 >>== \(_ :: a) -> a
instance (Default a) => Arrow (A a) where
arr f = A (\x -> (f x, def))
first (A f) = A (\(x, y) -> let (z, a) = f x in ((z, y), a))
instance (Default a) => ArrowChoice (A a) where
A f +++ A g = A (\ei -> either (\x -> let (y, z) = f x in (Left y, z))
(\x -> let (y, z) = g x in (Right y, z))
ei)
left a = a +++ id
infixl 1 >>==
A f >>== g = A (\x -> case f x of
(y, z) -> case g z of
A h -> h y)
rtn x = A (\y -> (y, x))
run :: A a St St -> IO a
run (A f) = IO $ \world -> case f (St world) of (St world', x) -> (# world', x #)
bimap (A f) (A g) = A (\(Pair a b) -> let
(c, d) = f a
(e, h) = g b in
(c `par` e) `seq` (Pair c e, (d, h)))
assoc1 = A (\(Pair (Pair a b) c) -> (Pair a (Pair b c), ()))
assoc2 = A (\(Pair a (Pair b c)) -> (Pair (Pair a b) c, ()))
drop1 = A (\(Pair Blank x) -> (x, ()))
drop2 = A (\(Pair x Blank) -> (x, ()))
undrop1 = A (\x -> (Pair Blank x, ()))
undrop2 = A (\x -> (Pair x Blank, ()))
swap = A (\(Pair x y) -> (Pair y x, ()))
apply = A (\(Pair (A f) x) -> f x)
curry (A f) = A (\x -> (A (\y -> f (Pair x y)), ()))
distr = A (\(Pair a ei) -> (either (Left . Pair a) (Right . Pair a) ei, ()))
assoc3 ((x, y), z) = (x, (y, z))
assoc4 (x, (y, z)) = ((x, y), z)
void' = (>>== const (rtn ()))
bimap' :: A () t u -> A () v w -> A () (Pair t v) (Pair u w)
bimap' a a2 = void' (bimap a a2)
newtype Exclusive = Exclusive Handle deriving Storable
newtype Semiclosed = Semiclosed Handle deriving Storable
newtype Open p = Open Handle deriving Storable
class Openhandle h where
getHdl :: h -> Handle
instance Openhandle Exclusive where
getHdl (Exclusive h) = h
instance Openhandle (Open p) where
getHdl (Open h) = h
lift f = A $ \(Pair x (St world)) -> let
IO g = f x
(# world', (y, z) #) = g world in (Pair y (St world'), z)
open file mode = lift (\Blank -> liftM (\hdl -> (Exclusive hdl, ())) $ openFile file mode) . undrop1
getStdin = A (\Blank -> (Open stdin, ()))
getStdout = A (\Blank -> (Open stdout, ()))
getStderr = A (\Blank -> (Open stderr, ()))
close = drop1 . lift (\(Exclusive hdl) -> hClose hdl >> return (Blank, ()))
close1 = drop1 . lift (\(Semiclosed hdl) -> hClose hdl >> return (Blank, ()))
fileSize = lift (\h -> liftM ((,) h) (hFileSize (getHdl h)))
setFileSize sz = lift (\h -> hSetFileSize (getHdl h) sz >> return (h, ()))
eof = lift (\h -> liftM ((,) h) (hIsEOF (getHdl h)))
seek mode pos = lift (\h -> hSeek (getHdl h) mode pos >> return (h, ()))
tell = lift (\h -> liftM ((,) h) (hTell (getHdl h)))
char = lift (\h -> liftM ((,) h) (hGetChar (getHdl h)))
line = lift (\h -> liftM ((,) h) (hGetLine (getHdl h)))
lookahead = lift (\h -> liftM ((,) h) (hLookAhead (getHdl h)))
contents = lift (\(Exclusive hdl) -> liftM ((,) (Semiclosed hdl)) (hGetContents hdl))
putC c = lift (\h -> hPutChar (getHdl h) c >> return (h, ()))
putS s = lift (\h -> hPutStr (getHdl h) s >> return (h, ()))
setBinary b = lift (\h -> hSetBinaryMode (getHdl h) b >> return (h, ()))
random rng = A (\Blank -> unsafePerformIO $ getStdGen >>= \g -> let (x, g') = randomR rng g in setStdGen g' >> return (Blank, x))
instance Storable Blank where
sizeOf _ = 0
alignment _ = 1
peek _ = return Blank
poke _ Blank = return ()
align x y = ((sizeOf x 1) `div` alignment y + 1) * alignment y
frst :: (Storable a, Storable b) => Ptr (Pair a b) -> Ptr a
frst = castPtr
secnd :: forall a b. (Storable a, Storable b) => Ptr (Pair a b) -> Ptr b
secnd = castPtr . (`plusPtr` align (undefined :: a) (undefined :: b))
instance (Storable a, Storable b) => Storable (Pair a b) where
sizeOf _ = align (undefined :: a) (undefined :: b) + sizeOf (undefined :: b)
alignment _ = alignment (undefined :: a)
`lcm` alignment (undefined :: b)
peek p = liftM2 Pair (peek (frst p)) (peek (secnd p))
poke p (Pair x y) = do
poke (frst p) x
poke (secnd p) y
coerce :: Ptr Handle -> Ptr Int32
coerce = castPtr
instance Storable Handle where
sizeOf _ = 4
alignment _ = 4
peek = peek . castPtr
poke = poke . castPtr
data Fix f = In (f (Fix f))
fixInj1 :: Pointer p s (Fix f) -> Pointer p s (f (Fix f))
fixInj1 (Pointer fp p) = Pointer fp (castPtr p)
fixInj2 :: Pointer p s (f (Fix f)) -> Pointer p s (Fix f)
fixInj2 (Pointer fp p) = Pointer fp (castPtr p)
data Pointer p s t = Pointer !(ForeignPtr Blank) !(Ptr t)
instance Storable (Pointer p s t) where
sizeOf _ = 8
alignment _ = 4
poke p (Pointer fp p2) = do
sp <- newStablePtr fp
pokeByteOff p 0 sp
pokeByteOff p 4 p2
peek p = do
sp <- peekByteOff p 0
fp <- deRefStablePtr sp
freeStablePtr sp
p2 <- peekByteOff p 4
return (Pointer fp p2)
data Linear = Linear
data Focused = Focused
data Nonlinear = Nonlinear
data Placeholder = Placeholder
class Splittable s
instance Splittable Nonlinear
instance Splittable Focused
dummy :: ForeignPtr Blank
dummy = unsafePerformIO (A.malloc >>= newForeignPtr_)
contraction :: A () (Pointer Nonlinear s t) (Pair (Pointer Nonlinear s t) (Pointer Nonlinear s t))
contraction = A (\p -> (Pair p p, ()))
class Weakening t where
weakening :: A () (Pair t St) St
instance Weakening (Pointer p Focused t) where
weakening = A (\(Pair (Pointer _ _) st) -> (st, ()))
instance Weakening (Pointer p Nonlinear t) where
weakening = drop1 . lift (\(Pointer fp _) -> touchForeignPtr fp >> return (Blank, ()))
instance Weakening (Open p) where
weakening = A (\(Pair (Open _) st) -> (st, ()))
new :: (Storable t) => A () St (Pair (Pointer p Placeholder t) St)
new = lift (\Blank -> liftM (\p -> (Pointer dummy p, ())) A.malloc) . undrop1
free :: A () (Pair (Pointer p2 Placeholder t) St) St
free = drop1 . lift (\(Pointer _ p) -> A.free p >> return (Blank, ()))
split :: forall t u p s. (Storable t, Storable u, Splittable s) => A () (Pointer p s (Pair t u)) (Pair (Pointer p s t) (Pointer p s u))
split = A (\(Pointer fp p) -> (Pair
(Pointer fp (frst p))
(Pointer fp (secnd p)), ()))
ptrSwap :: (Storable t) => Fn (Pair (Pointer p s t) t) (Pair (Pointer p s t) t)
ptrSwap = lift (\(Pair ptr@(Pointer _ p) x) -> peek p >>= \y -> poke p x >> return (Pair ptr y, ()))
focus :: (forall p. A a (Pair (Pointer p Focused t) u) v)
-> A a (Pair (Pointer p s t) u) (Pair (Pointer p s t) v)
focus (A f) = A (\(Pair ptr@(Pointer fp p) x) -> first (Pair ptr) (f (Pair (Pointer fp p) x)))
focusHdl :: (forall p. A a (Pair (Open p) t) u) -> A a (Pair Exclusive t) (Pair Exclusive u)
focusHdl (A f) = A (\(Pair h@(Exclusive hdl) x) -> first (Pair h) (f (Pair (Open hdl) x)))
peek' :: (Storable t) => Fn (Pointer p Linear t) (Pair (Pointer p Placeholder t) t)
peek' = lift (\(Pointer fp p) -> liftM (\x -> (Pair (Pointer fp p) x, ())) (peek p))
poke' :: (Storable t) => Fn (Pair (Pointer p Placeholder t) t) (Pointer p Linear t)
poke' = lift (\(Pair (Pointer fp p) x) -> poke p x >> return (Pointer fp p, ()))
changeType :: forall t u p. (Storable t, Storable u) => A () (Pointer p Placeholder t) (Pointer p Placeholder u)
changeType = if sizeOf (undefined :: u) <= sizeOf (undefined :: t) then
A (\(Pointer fp p) -> (Pointer (castForeignPtr fp) (castPtr p), ()))
else
error "Control.Linear.changeType: value won't fit"
newNonlinear :: (Storable t) => t -> A () Blank (Pointer p Nonlinear t)
newNonlinear x = A (\Blank -> unsafePerformIO $ do
p <- A.malloc
poke p x
fp <- newForeignPtr_ p
return (Pointer (castForeignPtr fp) p, ()))
peek1 :: (Storable t) => A t (Pair (Pointer Nonlinear s t) St) (Pair (Pointer Nonlinear s t) St)
peek1 = lift (\ptr@(Pointer _ p) -> liftM (\x -> (ptr, x)) $ peek p)
poke1 :: (Storable t) => t -> Fn (Pointer p s t) (Pointer p s t)
poke1 x = lift (\ptr@(Pointer _ p) -> poke p x >> return (ptr, ()))
fork :: A () St (Pair St St)
fork = A (\st -> (Pair st st, ()))
join' :: A () (Pair St St) St
join' = A (\(Pair _ st) -> (st, ())) . bimap' id free . assoc1 . bimap' (swap . (new :: A () St (Pair (Pointer p Placeholder Blank) St))) id
helloWorld = undrop1
>>> bimap' getStdout id
>>> putS "Hello world!\n"
>>> weakening
printStuff = undrop1
>>> bimap' getStdout id
>>> iterate (putS "Stuff\n" >>>) id !! 10000
>>> weakening
concurrent = fork
>>> bimap' (open "C:\\users\\james\\videos\\Biggest number.wmv" ReadMode) printStuff
>>> bimap' (contents >>== \text -> last text `seq` close1 >>> undrop1 >>> bimap' getStdout id >>> putS (take 10000 text)) id
>>> bimap' weakening id
>>> join'