mirror of
https://github.com/barrucadu/dejafu.git
synced 2024-12-20 20:11:51 +03:00
63 lines
2.1 KiB
Haskell
63 lines
2.1 KiB
Haskell
-- | This is almost Control.Concurrent.Classy.QSemN, but it also has a function to snapshot the remaining quantity.
|
|
module QSemN where
|
|
|
|
import Control.Concurrent.Classy.MVar
|
|
import Control.Monad.Catch (mask_, onException,
|
|
uninterruptibleMask_)
|
|
import Control.Monad.Conc.Class (MonadConc)
|
|
import Data.Maybe
|
|
|
|
newtype QSemN m = QSemN (MVar m (Int, [(Int, MVar m ())], [(Int, MVar m ())]))
|
|
|
|
newQSemN :: MonadConc m => Int -> m (QSemN m)
|
|
newQSemN initial
|
|
| initial < 0 = fail "newQSemN: Initial quantity must be non-negative"
|
|
| otherwise = QSemN <$> newMVar (initial, [], [])
|
|
|
|
remainingQSemN :: MonadConc m => QSemN m -> m Int
|
|
remainingQSemN (QSemN m) = (\(quantity, _, _) -> quantity) <$> readMVar m
|
|
|
|
waitQSemN :: MonadConc m => QSemN m -> Int -> m ()
|
|
waitQSemN (QSemN m) sz = mask_ $ do
|
|
(quantity, b1, b2) <- takeMVar m
|
|
let remaining = quantity - sz
|
|
if remaining < 0
|
|
then do
|
|
b <- newEmptyMVar
|
|
putMVar m (quantity, b1, (sz,b):b2)
|
|
wait b
|
|
else
|
|
putMVar m (remaining, b1, b2)
|
|
where
|
|
wait b = takeMVar b `onException` uninterruptibleMask_ (do
|
|
(quantity, b1, b2) <- takeMVar m
|
|
r <- tryTakeMVar b
|
|
r' <- if isJust r
|
|
then signal sz (quantity, b1, b2)
|
|
else putMVar b () >> pure (quantity, b1, b2)
|
|
putMVar m r')
|
|
|
|
signalQSemN :: MonadConc m => QSemN m -> Int -> m ()
|
|
signalQSemN (QSemN m) sz = uninterruptibleMask_ $ do
|
|
r <- takeMVar m
|
|
r' <- signal sz r
|
|
putMVar m r'
|
|
|
|
signal :: MonadConc m
|
|
=> Int
|
|
-> (Int, [(Int,MVar m ())], [(Int,MVar m ())])
|
|
-> m (Int, [(Int,MVar m ())], [(Int,MVar m ())])
|
|
signal sz0 (i,a1,a2) = loop (sz0 + i) a1 a2 where
|
|
loop 0 bs b2 = pure (0, bs, b2)
|
|
loop sz [] [] = pure (sz, [], [])
|
|
loop sz [] b2 = loop sz (reverse b2) []
|
|
loop sz ((j,b):bs) b2
|
|
| j > sz = do
|
|
r <- isEmptyMVar b
|
|
if r then pure (sz, (j,b):bs, b2)
|
|
else loop sz bs b2
|
|
| otherwise = do
|
|
r <- tryPutMVar b ()
|
|
if r then loop (sz-j) bs b2
|
|
else loop sz bs b2
|