2 % (c) The AQUA Project, Glasgow University, 1994-1996
5 \section[Concurrent]{Concurrent Haskell constructs}
7 A common interface to a collection of useful concurrency abstractions.
8 Currently, the collection only contains the abstractions found in the
9 {\em Concurrent Haskell} paper (presented at the Haskell Workshop
10 1995, draft available via \tr{ftp} from
11 \tr{ftp.dcs.gla.ac.uk/pub/glasgow-fp/drafts}.) plus a couple of
12 others. See the paper and the individual files containing the module
13 definitions for explanation on what they do.
24 -- Forking and suchlike
25 , forkIO -- :: IO () -> IO ThreadId
26 , myThreadId -- :: IO ThreadId
27 , killThread -- :: ThreadId -> IO ()
28 , raiseInThread -- :: ThreadId -> Exception -> IO ()
29 , par -- :: a -> b -> b
30 , seq -- :: a -> b -> b
31 , fork -- :: a -> b -> b
34 , threadDelay -- :: Int -> IO ()
35 , threadWaitRead -- :: Int -> IO ()
36 , threadWaitWrite -- :: Int -> IO ()
40 , newMVar -- :: a -> IO (MVar a)
41 , newEmptyMVar -- :: IO (MVar a)
42 , takeMVar -- :: MVar a -> IO a
43 , putMVar -- :: MVar a -> a -> IO ()
44 , readMVar -- :: MVar a -> IO a
45 , swapMVar -- :: MVar a -> a -> IO a
46 , isEmptyMVar -- :: MVar a -> IO Bool
49 , mergeIO -- :: [a] -> [a] -> IO [a]
50 , nmergeIO -- :: [[a]] -> IO [a]
60 import PrelIOBase ( IO(..) )
62 import PrelAddr ( Addr )
63 import PrelArr ( ByteArray )
64 import PrelPack ( packString )
65 import PrelIOBase ( unsafePerformIO , unsafeInterleaveIO )
66 import PrelBase ( fork# )
67 import PrelGHC ( Addr#, unsafeCoerce# )
72 Thread Ids, specifically the instances of Eq and Ord for these things.
73 The ThreadId type itself is defined in std/PrelConc.lhs.
75 Rather than define a new primitve, we use a little helper function
76 cmp_thread in the RTS.
79 foreign import ccall "cmp_thread" unsafe cmp_thread :: Addr# -> Addr# -> Int
82 cmpThread :: ThreadId -> ThreadId -> Ordering
83 cmpThread (ThreadId t1) (ThreadId t2) =
84 case cmp_thread (unsafeCoerce# t1) (unsafeCoerce# t2) of
89 instance Eq ThreadId where
91 case t1 `cmpThread` t2 of
95 instance Ord ThreadId where
100 forkIO :: IO () -> IO ThreadId
101 forkIO action = IO $ \ s ->
102 case (fork# action_plus s) of (# s1, id #) -> (# s1, ThreadId id #)
105 catchException action
106 (topHandler False{-don't quit on exception raised-})
110 fork x y = unsafePerformIO (forkIO (x `seq` return ())) `seq` y
118 mergeIO :: [a] -> [a] -> IO [a]
119 nmergeIO :: [[a]] -> IO [a]
122 = newEmptyMVar >>= \ tail_node ->
123 newMVar tail_node >>= \ tail_list ->
124 newQSem max_buff_size >>= \ e ->
125 newMVar 2 >>= \ branches_running ->
129 forkIO (suckIO branches_running buff ls) >>
130 forkIO (suckIO branches_running buff rs) >>
131 takeMVar tail_node >>= \ val ->
136 = (MVar (MVar [a]), QSem)
138 suckIO :: MVar Int -> Buffer a -> [a] -> IO ()
140 suckIO branches_running buff@(tail_list,e) vs
142 [] -> takeMVar branches_running >>= \ val ->
144 takeMVar tail_list >>= \ node ->
146 putMVar tail_list node
148 putMVar branches_running (val-1)
151 takeMVar tail_list >>= \ node ->
152 newEmptyMVar >>= \ next_node ->
154 takeMVar next_node >>= \ x ->
156 return x) >>= \ next_node_val ->
157 putMVar node (x:next_node_val) >>
158 putMVar tail_list next_node >>
159 suckIO branches_running buff xs
165 newEmptyMVar >>= \ tail_node ->
166 newMVar tail_node >>= \ tail_list ->
167 newQSem max_buff_size >>= \ e ->
168 newMVar len >>= \ branches_running ->
172 mapIO (\ x -> forkIO (suckIO branches_running buff x)) lss >>
173 takeMVar tail_node >>= \ val ->
177 mapIO f xs = sequence (map f xs)