1 -----------------------------------------------------------------------------
3 -- Module : Control.Concurrent.QSem
4 -- Copyright : (c) The University of Glasgow 2001
5 -- License : BSD-style (see the file libraries/base/LICENSE)
7 -- Maintainer : libraries@haskell.org
8 -- Stability : experimental
9 -- Portability : non-portable (concurrency)
11 -- Simple quantity semaphores.
13 -----------------------------------------------------------------------------
15 module Control.Concurrent.QSem
16 ( -- * Simple Quantity Semaphores
18 newQSem, -- :: Int -> IO QSem
19 waitQSem, -- :: QSem -> IO ()
20 signalQSem -- :: QSem -> IO ()
24 import Control.Concurrent.MVar
29 -- General semaphores are also implemented readily in terms of shared
30 -- @MVar@s, only have to catch the case when the semaphore is tried
31 -- waited on when it is empty (==0). Implement this in the same way as
32 -- shared variables are implemented - maintaining a list of @MVar@s
33 -- representing threads currently waiting. The counter is a shared
34 -- variable, ensuring the mutual exclusion on its access.
36 -- |A 'QSem' is a simple quantity semaphore, in which the available
37 -- \"quantity\" is always dealt with in units of one.
38 newtype QSem = QSem (MVar (Int, [MVar ()]))
40 INSTANCE_TYPEABLE0(QSem,qSemTc,"QSem")
42 -- |Build a new 'QSem'
43 newQSem :: Int -> IO QSem
46 then fail "newQSem: Initial quantity must be non-negative"
47 else do sem <- newMVar (initial, [])
50 -- |Wait for a unit to become available
51 waitQSem :: QSem -> IO ()
52 waitQSem (QSem sem) = do
53 (avail,blocked) <- takeMVar sem -- gain ex. access
55 putMVar sem (avail-1,[])
59 Stuff the reader at the back of the queue,
60 so as to preserve waiting order. A signalling
61 process then only have to pick the MVar at the
62 front of the blocked list.
64 The version of waitQSem given in the paper could
67 putMVar sem (0, blocked++[block])
70 -- |Signal that a unit of the 'QSem' is available
71 signalQSem :: QSem -> IO ()
72 signalQSem (QSem sem) = do
73 (avail,blocked) <- takeMVar sem
75 [] -> putMVar sem (avail+1,[])
77 (block:blocked') -> do
78 putMVar sem (0,blocked')