module Ecluse.Core.Server.Admission.Meter (
MemoryMeter,
MeterSettings (..),
newMemoryMeter,
meterLine,
steerMeter,
meterSnapshot,
meterFigures,
takeLargestCharge,
MemoryTicket,
withMemoryEntry,
tryMemoryEntry,
charge,
newChargeRegion,
newChargePair,
ChargePart,
newChargePart,
chargePart,
servingPart,
stepDown,
awaitingFlight,
servingFlight,
) where
import Control.Concurrent.MVar qualified as MVar
import Control.Concurrent.STM (retry, stateTVar)
import Data.IntSet qualified as IntSet
import Data.Map.Strict qualified as Map
import UnliftIO (MonadUnliftIO)
import UnliftIO.Exception qualified as UE
import Ecluse.Core.Deadline (Deadlines, withDeadlineFlag)
import Ecluse.Core.Server.Admission.Budget (
EntryGate (..),
GrowthGate (..),
MeterView (..),
entryDecision,
entryReady,
growthDecision,
roundUpToStep,
)
import Ecluse.Core.Server.Admission.Overflow (Line, newLine, signalLine)
import Ecluse.Core.Server.Admission.Types (BrakeLevel (Calm), FlightKey, MeterSnapshot (..), Shed (..))
import Ecluse.Core.Server.MemoryModel (saturatingCharge)
import Ecluse.Core.Telemetry.Record (MetricsPort (..))
data MeterSettings = MeterSettings
{ MeterSettings -> Int
msBudgetBytes :: Int
, MeterSettings -> Int
msStepBytes :: Int
, MeterSettings -> Int
msEntryRoom :: Int
, MeterSettings -> Int
msEntryWaitMicros :: Int
}
deriving stock (MeterSettings -> MeterSettings -> Bool
(MeterSettings -> MeterSettings -> Bool)
-> (MeterSettings -> MeterSettings -> Bool) -> Eq MeterSettings
forall a. (a -> a -> Bool) -> (a -> a -> Bool) -> Eq a
$c== :: MeterSettings -> MeterSettings -> Bool
== :: MeterSettings -> MeterSettings -> Bool
$c/= :: MeterSettings -> MeterSettings -> Bool
/= :: MeterSettings -> MeterSettings -> Bool
Eq, Int -> MeterSettings -> ShowS
[MeterSettings] -> ShowS
MeterSettings -> String
(Int -> MeterSettings -> ShowS)
-> (MeterSettings -> String)
-> ([MeterSettings] -> ShowS)
-> Show MeterSettings
forall a.
(Int -> a -> ShowS) -> (a -> String) -> ([a] -> ShowS) -> Show a
$cshowsPrec :: Int -> MeterSettings -> ShowS
showsPrec :: Int -> MeterSettings -> ShowS
$cshow :: MeterSettings -> String
show :: MeterSettings -> String
$cshowList :: [MeterSettings] -> ShowS
showList :: [MeterSettings] -> ShowS
Show)
data MemoryMeter = MemoryMeter
{ MemoryMeter -> TVar Int
mmBudget :: TVar Int
, MemoryMeter -> TVar Int
mmCharged :: TVar Int
, MemoryMeter -> TVar (Map Int (Maybe FlightKey))
mmWaiters :: TVar (Map Int (Maybe FlightKey))
, MemoryMeter -> TVar (Map FlightKey IntSet)
mmInterest :: TVar (Map FlightKey IntSet)
, MemoryMeter -> TVar (Maybe Int)
mmToken :: TVar (Maybe Int)
, MemoryMeter -> TVar Int
mmEntryWaiting :: TVar Int
, MemoryMeter -> TVar BrakeLevel
mmBrakeLevel :: TVar BrakeLevel
, MemoryMeter -> TVar Int
mmLargest :: TVar Int
, MemoryMeter -> IORef Int
mmNextTicket :: IORef Int
, MemoryMeter -> Int
mmStepBytes :: Int
, MemoryMeter -> Int
mmEntryRoom :: Int
, MemoryMeter -> Int
mmEntryWaitMicros :: Int
, MemoryMeter -> Deadlines
mmDeadlines :: Deadlines
, MemoryMeter -> Line
mmLine :: Line
}
newMemoryMeter :: Deadlines -> MeterSettings -> IO MemoryMeter
newMemoryMeter :: Deadlines -> MeterSettings -> IO MemoryMeter
newMemoryMeter Deadlines
deadlines MeterSettings
settings =
TVar Int
-> TVar Int
-> TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter
MemoryMeter
(TVar Int
-> TVar Int
-> TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar Int)
-> IO
(TVar Int
-> TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Int -> IO (TVar Int)
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 (MeterSettings -> Int
msBudgetBytes MeterSettings
settings))
IO
(TVar Int
-> TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar Int)
-> IO
(TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO (TVar Int)
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Int
0
IO
(TVar (Map Int (Maybe FlightKey))
-> TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar (Map Int (Maybe FlightKey)))
-> IO
(TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Map Int (Maybe FlightKey) -> IO (TVar (Map Int (Maybe FlightKey)))
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Map Int (Maybe FlightKey)
forall k a. Map k a
Map.empty
IO
(TVar (Map FlightKey IntSet)
-> TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar (Map FlightKey IntSet))
-> IO
(TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Map FlightKey IntSet -> IO (TVar (Map FlightKey IntSet))
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Map FlightKey IntSet
forall k a. Map k a
Map.empty
IO
(TVar (Maybe Int)
-> TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar (Maybe Int))
-> IO
(TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Maybe Int -> IO (TVar (Maybe Int))
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Maybe Int
forall a. Maybe a
Nothing
IO
(TVar Int
-> TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar Int)
-> IO
(TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO (TVar Int)
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Int
0
IO
(TVar BrakeLevel
-> TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar BrakeLevel)
-> IO
(TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> BrakeLevel -> IO (TVar BrakeLevel)
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO BrakeLevel
Calm
IO
(TVar Int
-> IORef Int
-> Int
-> Int
-> Int
-> Deadlines
-> Line
-> MemoryMeter)
-> IO (TVar Int)
-> IO
(IORef Int
-> Int -> Int -> Int -> Deadlines -> Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO (TVar Int)
forall (m :: * -> *) a. MonadIO m => a -> m (TVar a)
newTVarIO Int
0
IO
(IORef Int
-> Int -> Int -> Int -> Deadlines -> Line -> MemoryMeter)
-> IO (IORef Int)
-> IO (Int -> Int -> Int -> Deadlines -> Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO (IORef Int)
forall (m :: * -> *) a. MonadIO m => a -> m (IORef a)
newIORef Int
0
IO (Int -> Int -> Int -> Deadlines -> Line -> MemoryMeter)
-> IO Int -> IO (Int -> Int -> Deadlines -> Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO Int
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
1 (MeterSettings -> Int
msStepBytes MeterSettings
settings))
IO (Int -> Int -> Deadlines -> Line -> MemoryMeter)
-> IO Int -> IO (Int -> Deadlines -> Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO Int
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 (MeterSettings -> Int
msEntryRoom MeterSettings
settings))
IO (Int -> Deadlines -> Line -> MemoryMeter)
-> IO Int -> IO (Deadlines -> Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Int -> IO Int
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 (MeterSettings -> Int
msEntryWaitMicros MeterSettings
settings))
IO (Deadlines -> Line -> MemoryMeter)
-> IO Deadlines -> IO (Line -> MemoryMeter)
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> Deadlines -> IO Deadlines
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Deadlines
deadlines
IO (Line -> MemoryMeter) -> IO Line -> IO MemoryMeter
forall a b. IO (a -> b) -> IO a -> IO b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> IO Line
newLine
meterLine :: MemoryMeter -> Line
meterLine :: MemoryMeter -> Line
meterLine = MemoryMeter -> Line
mmLine
steerMeter :: MemoryMeter -> Int -> BrakeLevel -> IO ()
steerMeter :: MemoryMeter -> Int -> BrakeLevel -> IO ()
steerMeter MemoryMeter
meter Int
budget BrakeLevel
level = STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (STM () -> IO ()) -> STM () -> IO ()
forall a b. (a -> b) -> a -> b
$ do
TVar Int -> Int -> STM ()
forall a. TVar a -> a -> STM ()
writeTVar (MemoryMeter -> TVar Int
mmBudget MemoryMeter
meter) (Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 Int
budget)
TVar BrakeLevel -> BrakeLevel -> STM ()
forall a. TVar a -> a -> STM ()
writeTVar (MemoryMeter -> TVar BrakeLevel
mmBrakeLevel MemoryMeter
meter) BrakeLevel
level
meterSnapshot :: MemoryMeter -> IO MeterSnapshot
meterSnapshot :: MemoryMeter -> IO MeterSnapshot
meterSnapshot = STM MeterSnapshot -> IO MeterSnapshot
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (STM MeterSnapshot -> IO MeterSnapshot)
-> (MemoryMeter -> STM MeterSnapshot)
-> MemoryMeter
-> IO MeterSnapshot
forall b c a. (b -> c) -> (a -> b) -> a -> c
. MemoryMeter -> STM MeterSnapshot
meterFigures
meterFigures :: MemoryMeter -> STM MeterSnapshot
meterFigures :: MemoryMeter -> STM MeterSnapshot
meterFigures MemoryMeter
meter =
Int -> Int -> Int -> Int -> BrakeLevel -> MeterSnapshot
MeterSnapshot
(Int -> Int -> Int -> Int -> BrakeLevel -> MeterSnapshot)
-> STM Int
-> STM (Int -> Int -> Int -> BrakeLevel -> MeterSnapshot)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar Int
mmBudget MemoryMeter
meter)
STM (Int -> Int -> Int -> BrakeLevel -> MeterSnapshot)
-> STM Int -> STM (Int -> Int -> BrakeLevel -> MeterSnapshot)
forall a b. STM (a -> b) -> STM a -> STM b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar Int
mmCharged MemoryMeter
meter)
STM (Int -> Int -> BrakeLevel -> MeterSnapshot)
-> STM Int -> STM (Int -> BrakeLevel -> MeterSnapshot)
forall a b. STM (a -> b) -> STM a -> STM b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar Int
mmEntryWaiting MemoryMeter
meter)
STM (Int -> BrakeLevel -> MeterSnapshot)
-> STM Int -> STM (BrakeLevel -> MeterSnapshot)
forall a b. STM (a -> b) -> STM a -> STM b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> (Map Int (Maybe FlightKey) -> Int
forall k a. Map k a -> Int
Map.size (Map Int (Maybe FlightKey) -> Int)
-> STM (Map Int (Maybe FlightKey)) -> STM Int
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> TVar (Map Int (Maybe FlightKey)) -> STM (Map Int (Maybe FlightKey))
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar (Map Int (Maybe FlightKey))
mmWaiters MemoryMeter
meter))
STM (BrakeLevel -> MeterSnapshot)
-> STM BrakeLevel -> STM MeterSnapshot
forall a b. STM (a -> b) -> STM a -> STM b
forall (f :: * -> *) a b. Applicative f => f (a -> b) -> f a -> f b
<*> TVar BrakeLevel -> STM BrakeLevel
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar BrakeLevel
mmBrakeLevel MemoryMeter
meter)
takeLargestCharge :: MemoryMeter -> IO Int
takeLargestCharge :: MemoryMeter -> IO Int
takeLargestCharge MemoryMeter
meter = STM Int -> IO Int
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (TVar Int -> (Int -> (Int, Int)) -> STM Int
forall s a. TVar s -> (s -> (a, s)) -> STM a
stateTVar (MemoryMeter -> TVar Int
mmLargest MemoryMeter
meter) (,Int
0))
data MemoryTicket = MemoryTicket
{ MemoryTicket -> MemoryMeter
tMeter :: MemoryMeter
, MemoryTicket -> Int
tId :: Int
, MemoryTicket -> TVar Int
tCharged :: TVar Int
, MemoryTicket -> IORef Int
tHeadroom :: IORef Int
, MemoryTicket -> Maybe FlightKey
tServes :: Maybe FlightKey
, MemoryTicket -> MetricsPort
tMetrics :: MetricsPort
}
withMemoryEntry :: (MonadUnliftIO m) => MetricsPort -> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
withMemoryEntry :: forall (m :: * -> *) a.
MonadUnliftIO m =>
MetricsPort
-> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
withMemoryEntry MetricsPort
metrics MemoryMeter
meter MemoryTicket -> m a
body = do
result <- MetricsPort
-> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
forall (m :: * -> *) a.
MonadUnliftIO m =>
MetricsPort
-> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
tryMemoryEntry MetricsPort
metrics MemoryMeter
meter MemoryTicket -> m a
body
when (isLeft result) (liftIO (mpMemoryAdmissionShed metrics))
pure result
tryMemoryEntry :: (MonadUnliftIO m) => MetricsPort -> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
tryMemoryEntry :: forall (m :: * -> *) a.
MonadUnliftIO m =>
MetricsPort
-> MemoryMeter -> (MemoryTicket -> m a) -> m (Either Shed a)
tryMemoryEntry MetricsPort
metrics MemoryMeter
meter MemoryTicket -> m a
body =
((forall a. m a -> m a) -> m (Either Shed a)) -> m (Either Shed a)
forall (m :: * -> *) b.
MonadUnliftIO m =>
((forall a. m a -> m a) -> m b) -> m b
UE.mask (((forall a. m a -> m a) -> m (Either Shed a))
-> m (Either Shed a))
-> ((forall a. m a -> m a) -> m (Either Shed a))
-> m (Either Shed a)
forall a b. (a -> b) -> a -> b
$ \forall a. m a -> m a
restore -> do
ticket <- IO MemoryTicket -> m MemoryTicket
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (MetricsPort -> MemoryMeter -> IO MemoryTicket
newTicket MetricsPort
metrics MemoryMeter
meter)
entered <- liftIO (enter ticket)
case entered of
Left Shed
why -> Either Shed a -> m (Either Shed a)
forall a. a -> m a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Shed -> Either Shed a
forall a b. a -> Either a b
Left Shed
why)
Right Bool
waited ->
a -> Either Shed a
forall a b. b -> Either a b
Right
(a -> Either Shed a) -> m a -> m (Either Shed a)
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> ( m a -> m a
forall a. m a -> m a
restore (IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (Bool -> IO () -> IO ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when Bool
waited (MetricsPort -> IO ()
mpMemoryAdmissionQueued MetricsPort
metrics)) m () -> m a -> m a
forall a b. m a -> m b -> m b
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> MemoryTicket -> m a
body MemoryTicket
ticket)
m a -> m () -> m a
forall (m :: * -> *) a b. MonadUnliftIO m => m a -> m b -> m a
`UE.finally` IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (MemoryTicket -> IO ()
releaseTicket MemoryTicket
ticket)
)
newTicket :: MetricsPort -> MemoryMeter -> IO MemoryTicket
newTicket :: MetricsPort -> MemoryMeter -> IO MemoryTicket
newTicket MetricsPort
metrics MemoryMeter
meter = do
ticketId <- IORef Int -> (Int -> (Int, Int)) -> IO Int
forall (m :: * -> *) a b.
MonadIO m =>
IORef a -> (a -> (a, b)) -> m b
atomicModifyIORef' (MemoryMeter -> IORef Int
mmNextTicket MemoryMeter
meter) (\Int
n -> (Int
n Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1, Int
n))
charged <- newTVarIO 0
headroom <- newIORef 0
pure MemoryTicket{tMeter = meter, tId = ticketId, tCharged = charged, tHeadroom = headroom, tServes = Nothing, tMetrics = metrics}
enter :: MemoryTicket -> IO (Either Shed Bool)
enter :: MemoryTicket -> IO (Either Shed Bool)
enter MemoryTicket
ticket = do
gate <- STM EntryGate -> IO EntryGate
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (STM EntryGate -> IO EntryGate) -> STM EntryGate -> IO EntryGate
forall a b. (a -> b) -> a -> b
$ do
view <- MemoryMeter -> STM MeterView
readView MemoryMeter
meter
waiting <- readTVar (mmEntryWaiting meter)
case entryDecision view waiting (mmEntryRoom meter) step of
EntryGate
EntryAdmit -> MemoryTicket -> Int -> STM ()
takeBytes MemoryTicket
ticket Int
step STM () -> EntryGate -> STM EntryGate
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> EntryGate
EntryAdmit
EntryGate
EntryQueue -> TVar Int -> Int -> STM ()
forall a. TVar a -> a -> STM ()
writeTVar (MemoryMeter -> TVar Int
mmEntryWaiting MemoryMeter
meter) (Int
waiting Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
1) STM () -> EntryGate -> STM EntryGate
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> EntryGate
EntryQueue
EntryGate
EntryRefuse -> EntryGate -> STM EntryGate
forall a. a -> STM a
forall (f :: * -> *) a. Applicative f => a -> f a
pure EntryGate
EntryRefuse
case gate of
EntryGate
EntryAdmit -> IO ()
openHeadroom IO () -> Either Shed Bool -> IO (Either Shed Bool)
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> Bool -> Either Shed Bool
forall a b. b -> Either a b
Right Bool
False
EntryGate
EntryRefuse -> Either Shed Bool -> IO (Either Shed Bool)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Shed -> Either Shed Bool
forall a b. a -> Either a b
Left Shed
RoomFull)
EntryGate
EntryQueue -> do
admitted <-
Deadlines -> Int -> (TVar Bool -> IO Bool) -> IO Bool
forall a. Deadlines -> Int -> (TVar Bool -> IO a) -> IO a
withDeadlineFlag (MemoryMeter -> Deadlines
mmDeadlines MemoryMeter
meter) (MemoryMeter -> Int
mmEntryWaitMicros MemoryMeter
meter) (STM Bool -> IO Bool
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (STM Bool -> IO Bool)
-> (TVar Bool -> STM Bool) -> TVar Bool -> IO Bool
forall b c a. (b -> c) -> (a -> b) -> a -> c
. TVar Bool -> STM Bool
entryOrExpire)
IO Bool -> IO () -> IO Bool
forall (m :: * -> *) a b. MonadUnliftIO m => m a -> m b -> m a
`UE.finally` STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (TVar Int -> (Int -> Int) -> STM ()
forall a. TVar a -> (a -> a) -> STM ()
modifyTVar' (MemoryMeter -> TVar Int
mmEntryWaiting MemoryMeter
meter) (Int -> Int -> Int
forall a. Num a => a -> a -> a
subtract Int
1) STM () -> STM () -> STM ()
forall a b. STM a -> STM b -> STM b
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> Line -> STM ()
signalLine (MemoryMeter -> Line
mmLine MemoryMeter
meter))
if admitted then openHeadroom $> Right True else pure (Left WaitExpired)
where
meter :: MemoryMeter
meter = MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket
step :: Int
step = MemoryMeter -> Int
mmStepBytes MemoryMeter
meter
openHeadroom :: IO ()
openHeadroom = IORef Int -> Int -> IO ()
forall (m :: * -> *) a. MonadIO m => IORef a -> a -> m ()
writeIORef (MemoryTicket -> IORef Int
tHeadroom MemoryTicket
ticket) Int
step
entryOrExpire :: TVar Bool -> STM Bool
entryOrExpire TVar Bool
deadline = do
view <- MemoryMeter -> STM MeterView
readView MemoryMeter
meter
if entryReady view step
then takeBytes ticket step $> True
else do
expired <- readTVar deadline
if expired then pure False else retry
readView :: MemoryMeter -> STM MeterView
readView :: MemoryMeter -> STM MeterView
readView MemoryMeter
meter = do
interest <- TVar (Map FlightKey IntSet) -> STM (Map FlightKey IntSet)
forall a. TVar a -> STM a
readTVar (MemoryMeter -> TVar (Map FlightKey IntSet)
mmInterest MemoryMeter
meter)
waiters <- readTVar (mmWaiters meter)
MeterView
<$> readTVar (mmBudget meter)
<*> readTVar (mmCharged meter)
<*> readTVar (mmToken meter)
<*> pure (Map.foldlWithKey' (oldestWaiter interest) Nothing waiters)
where
oldestWaiter :: Map FlightKey IntSet
-> Maybe Int -> Int -> Maybe FlightKey -> Maybe Int
oldestWaiter Map FlightKey IntSet
interest Maybe Int
oldest Int
waiter Maybe FlightKey
serves =
let !priority :: Int
priority = Int -> (Int -> Int) -> Maybe Int -> Int
forall b a. b -> (a -> b) -> Maybe a -> b
maybe Int
effective (Int -> Int -> Int
forall a. Ord a => a -> a -> a
min Int
effective) Maybe Int
oldest
effective :: Int
effective = Map FlightKey IntSet -> Int -> Maybe FlightKey -> Int
oldestOf Map FlightKey IntSet
interest Int
waiter Maybe FlightKey
serves
in Int -> Maybe Int
forall a. a -> Maybe a
Just Int
priority
oldestOf :: Map FlightKey IntSet -> Int -> Maybe FlightKey -> Int
oldestOf Map FlightKey IntSet
interest Int
waiter Maybe FlightKey
serves = Int -> (Int -> Int) -> Maybe Int -> Int
forall b a. b -> (a -> b) -> Maybe a -> b
maybe Int
waiter (Int -> Int -> Int
forall a. Ord a => a -> a -> a
min Int
waiter) (IntSet -> Maybe Int
smallest (Map FlightKey IntSet -> Maybe FlightKey -> IntSet
waitingOn Map FlightKey IntSet
interest Maybe FlightKey
serves))
smallest :: IntSet -> Maybe Int
smallest :: IntSet -> Maybe Int
smallest = ((Int, IntSet) -> Int) -> Maybe (Int, IntSet) -> Maybe Int
forall a b. (a -> b) -> Maybe a -> Maybe b
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
fmap (Int, IntSet) -> Int
forall a b. (a, b) -> a
fst (Maybe (Int, IntSet) -> Maybe Int)
-> (IntSet -> Maybe (Int, IntSet)) -> IntSet -> Maybe Int
forall b c a. (b -> c) -> (a -> b) -> a -> c
. IntSet -> Maybe (Int, IntSet)
IntSet.minView
waitingOn :: Map FlightKey IntSet -> Maybe FlightKey -> IntSet
waitingOn :: Map FlightKey IntSet -> Maybe FlightKey -> IntSet
waitingOn Map FlightKey IntSet
interest = IntSet -> (FlightKey -> IntSet) -> Maybe FlightKey -> IntSet
forall b a. b -> (a -> b) -> Maybe a -> b
maybe IntSet
IntSet.empty (\FlightKey
key -> IntSet -> FlightKey -> Map FlightKey IntSet -> IntSet
forall k a. Ord k => a -> k -> Map k a -> a
Map.findWithDefault IntSet
IntSet.empty FlightKey
key Map FlightKey IntSet
interest)
takeBytes :: MemoryTicket -> Int -> STM ()
takeBytes :: MemoryTicket -> Int -> STM ()
takeBytes MemoryTicket
ticket Int
bytes = do
let meter :: MemoryMeter
meter = MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket
TVar Int -> (Int -> Int) -> STM ()
forall a. TVar a -> (a -> a) -> STM ()
modifyTVar' (MemoryMeter -> TVar Int
mmCharged MemoryMeter
meter) (Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
bytes)
total <- (Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
bytes) (Int -> Int) -> STM Int -> STM Int
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryTicket -> TVar Int
tCharged MemoryTicket
ticket)
writeTVar (tCharged ticket) total
modifyTVar' (mmLargest meter) (max total)
releaseTicket :: MemoryTicket -> IO ()
releaseTicket :: MemoryTicket -> IO ()
releaseTicket MemoryTicket
ticket = STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (STM () -> IO ()) -> STM () -> IO ()
forall a b. (a -> b) -> a -> b
$ do
let meter :: MemoryMeter
meter = MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket
held <- TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryTicket -> TVar Int
tCharged MemoryTicket
ticket)
writeTVar (tCharged ticket) 0
modifyTVar' (mmCharged meter) (subtract held)
holder <- readTVar (mmToken meter)
when (holder == Just (tId ticket)) (writeTVar (mmToken meter) Nothing)
awaitingFlight :: (MonadUnliftIO m) => MemoryTicket -> FlightKey -> m a -> m a
awaitingFlight :: forall (m :: * -> *) a.
MonadUnliftIO m =>
MemoryTicket -> FlightKey -> m a -> m a
awaitingFlight MemoryTicket
ticket FlightKey
key =
m () -> m () -> m a -> m a
forall (m :: * -> *) a b c.
MonadUnliftIO m =>
m a -> m b -> m c -> m c
UE.bracket_ (IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically ((IntSet -> IntSet) -> STM ()
update (Int -> IntSet -> IntSet
IntSet.insert (MemoryTicket -> Int
tId MemoryTicket
ticket))))) (IO () -> m ()
forall a. IO a -> m a
forall (m :: * -> *) a. MonadIO m => IO a -> m a
liftIO (STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically ((IntSet -> IntSet) -> STM ()
update (Int -> IntSet -> IntSet
IntSet.delete (MemoryTicket -> Int
tId MemoryTicket
ticket)))))
where
interest :: TVar (Map FlightKey IntSet)
interest = MemoryMeter -> TVar (Map FlightKey IntSet)
mmInterest (MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket)
update :: (IntSet -> IntSet) -> STM ()
update IntSet -> IntSet
change = TVar (Map FlightKey IntSet)
-> (Map FlightKey IntSet -> Map FlightKey IntSet) -> STM ()
forall a. TVar a -> (a -> a) -> STM ()
modifyTVar' TVar (Map FlightKey IntSet)
interest ((Maybe IntSet -> Maybe IntSet)
-> FlightKey -> Map FlightKey IntSet -> Map FlightKey IntSet
forall k a.
Ord k =>
(Maybe a -> Maybe a) -> k -> Map k a -> Map k a
Map.alter (IntSet -> Maybe IntSet
nonEmptySet (IntSet -> Maybe IntSet)
-> (Maybe IntSet -> IntSet) -> Maybe IntSet -> Maybe IntSet
forall b c a. (b -> c) -> (a -> b) -> a -> c
. IntSet -> IntSet
change (IntSet -> IntSet)
-> (Maybe IntSet -> IntSet) -> Maybe IntSet -> IntSet
forall b c a. (b -> c) -> (a -> b) -> a -> c
. IntSet -> Maybe IntSet -> IntSet
forall a. a -> Maybe a -> a
fromMaybe IntSet
IntSet.empty) FlightKey
key)
nonEmptySet :: IntSet -> Maybe IntSet
nonEmptySet IntSet
set = if IntSet -> Bool
IntSet.null IntSet
set then Maybe IntSet
forall a. Maybe a
Nothing else IntSet -> Maybe IntSet
forall a. a -> Maybe a
Just IntSet
set
servingFlight :: FlightKey -> MemoryTicket -> MemoryTicket
servingFlight :: FlightKey -> MemoryTicket -> MemoryTicket
servingFlight FlightKey
key MemoryTicket
ticket = MemoryTicket
ticket{tServes = Just key}
newChargeRegion :: (Int -> IO ()) -> IO (Int -> IO ())
newChargeRegion :: (Int -> IO ()) -> IO (Int -> IO ())
newChargeRegion Int -> IO ()
pay = do
highWater <- Int -> IO (MVar Int)
forall a. a -> IO (MVar a)
MVar.newMVar Int
0
pure $ \Int
requested -> MVar Int -> (Int -> IO Int) -> IO ()
forall a. MVar a -> (a -> IO a) -> IO ()
MVar.modifyMVar_ MVar Int
highWater ((Int -> IO Int) -> IO ()) -> (Int -> IO Int) -> IO ()
forall a b. (a -> b) -> a -> b
$ \Int
previous -> do
let next :: Int
next = Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
previous Int
requested
Bool -> IO () -> IO ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Int
next Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
previous) (Int -> IO ()
pay (Int
next Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
previous))
Int -> IO Int
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Int
next
newChargePair :: (Int -> IO ()) -> IO (Int -> IO (), Int -> IO ())
newChargePair :: (Int -> IO ()) -> IO (Int -> IO (), Int -> IO ())
newChargePair Int -> IO ()
pay = do
portions <- (Int, Int) -> IO (MVar (Int, Int))
forall a. a -> IO (MVar a)
MVar.newMVar (Int
0, Int
0)
let reserve (Int, Int) -> (Int, Int)
change = MVar (Int, Int) -> ((Int, Int) -> IO (Int, Int)) -> IO ()
forall a. MVar a -> (a -> IO a) -> IO ()
MVar.modifyMVar_ MVar (Int, Int)
portions (((Int, Int) -> IO (Int, Int)) -> IO ())
-> ((Int, Int) -> IO (Int, Int)) -> IO ()
forall a b. (a -> b) -> a -> b
$ \(Int, Int)
previous -> do
let next :: (Int, Int)
next@(Int
former, Int
latter) = (Int, Int) -> (Int, Int)
change (Int, Int)
previous
Int -> IO ()
pay (Integer -> Int
saturatingCharge (Int -> Integer
forall a. Integral a => a -> Integer
toInteger Int
former Integer -> Integer -> Integer
forall a. Num a => a -> a -> a
+ Int -> Integer
forall a. Integral a => a -> Integer
toInteger Int
latter))
(Int, Int) -> IO (Int, Int)
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure (Int, Int)
next
pure (\Int
former -> ((Int, Int) -> (Int, Int)) -> IO ()
reserve (\(Int
_, Int
latter) -> (Int
former, Int
latter)), \Int
latter -> ((Int, Int) -> (Int, Int)) -> IO ()
reserve (\(Int
former, Int
_) -> (Int
former, Int
latter)))
data ChargePart = ChargePart MemoryTicket (IORef Int)
newChargePart :: MemoryTicket -> IO ChargePart
newChargePart :: MemoryTicket -> IO ChargePart
newChargePart MemoryTicket
ticket = MemoryTicket -> IORef Int -> ChargePart
ChargePart MemoryTicket
ticket (IORef Int -> ChargePart) -> IO (IORef Int) -> IO ChargePart
forall (f :: * -> *) a b. Functor f => (a -> b) -> f a -> f b
<$> Int -> IO (IORef Int)
forall (m :: * -> *) a. MonadIO m => a -> m (IORef a)
newIORef Int
0
chargePart :: ChargePart -> Int -> IO ()
chargePart :: ChargePart -> Int -> IO ()
chargePart (ChargePart MemoryTicket
ticket IORef Int
paid) Int
cost = Bool -> IO () -> IO ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Int
cost Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0) (IO () -> IO ()) -> IO () -> IO ()
forall a b. (a -> b) -> a -> b
$ do
MemoryTicket -> Int -> IO ()
charge MemoryTicket
ticket Int
cost
IORef Int -> (Int -> (Int, ())) -> IO ()
forall (m :: * -> *) a b.
MonadIO m =>
IORef a -> (a -> (a, b)) -> m b
atomicModifyIORef' IORef Int
paid (\Int
total -> (Int
total Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
cost, ()))
servingPart :: FlightKey -> ChargePart -> ChargePart
servingPart :: FlightKey -> ChargePart -> ChargePart
servingPart FlightKey
key (ChargePart MemoryTicket
ticket IORef Int
paid) = MemoryTicket -> IORef Int -> ChargePart
ChargePart (FlightKey -> MemoryTicket -> MemoryTicket
servingFlight FlightKey
key MemoryTicket
ticket) IORef Int
paid
stepDown :: ChargePart -> Int -> IO ()
stepDown :: ChargePart -> Int -> IO ()
stepDown (ChargePart MemoryTicket
ticket IORef Int
paid) Int
kept = IO () -> IO ()
forall (m :: * -> *) a. MonadUnliftIO m => m a -> m a
UE.mask_ (IO () -> IO ()) -> IO () -> IO ()
forall a b. (a -> b) -> a -> b
$ do
surplus <- IORef Int -> (Int -> (Int, Int)) -> IO Int
forall (m :: * -> *) a b.
MonadIO m =>
IORef a -> (a -> (a, b)) -> m b
atomicModifyIORef' IORef Int
paid (\Int
total -> let back :: Int
back = Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 (Int
total Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int -> Int -> Int
forall a. Ord a => a -> a -> a
max Int
0 Int
kept) in (Int
total Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
back, Int
back))
when (surplus > 0) (atomically (giveBack ticket surplus))
giveBack :: MemoryTicket -> Int -> STM ()
giveBack :: MemoryTicket -> Int -> STM ()
giveBack MemoryTicket
ticket Int
bytes = do
held <- TVar Int -> STM Int
forall a. TVar a -> STM a
readTVar (MemoryTicket -> TVar Int
tCharged MemoryTicket
ticket)
let returned = Int -> Int -> Int
forall a. Ord a => a -> a -> a
min Int
held Int
bytes
writeTVar (tCharged ticket) (held - returned)
modifyTVar' (mmCharged (tMeter ticket)) (subtract returned)
charge :: MemoryTicket -> Int -> IO ()
charge :: MemoryTicket -> Int -> IO ()
charge MemoryTicket
ticket Int
cost = Bool -> IO () -> IO ()
forall (f :: * -> *). Applicative f => Bool -> f () -> f ()
when (Int
cost Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
> Int
0) (IO () -> IO ()) -> IO () -> IO ()
forall a b. (a -> b) -> a -> b
$ do
shortfall <- IORef Int -> (Int -> (Int, Int)) -> IO Int
forall (m :: * -> *) a b.
MonadIO m =>
IORef a -> (a -> (a, b)) -> m b
atomicModifyIORef' (MemoryTicket -> IORef Int
tHeadroom MemoryTicket
ticket) ((Int -> (Int, Int)) -> IO Int) -> (Int -> (Int, Int)) -> IO Int
forall a b. (a -> b) -> a -> b
$ \Int
headroom ->
if Int
cost Int -> Int -> Bool
forall a. Ord a => a -> a -> Bool
<= Int
headroom then (Int
headroom Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
cost, Int
0) else (Int
0, Int
cost Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
headroom)
when (shortfall > 0) $ do
let want = Int -> Int -> Int
roundUpToStep (MemoryMeter -> Int
mmStepBytes (MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket)) Int
shortfall
grow ticket want
atomicModifyIORef' (tHeadroom ticket) (\Int
headroom -> (Int
headroom Int -> Int -> Int
forall a. Num a => a -> a -> a
+ Int
want Int -> Int -> Int
forall a. Num a => a -> a -> a
- Int
shortfall, ()))
grow :: MemoryTicket -> Int -> IO ()
grow :: MemoryTicket -> Int -> IO ()
grow MemoryTicket
ticket Int
want = do
immediate <- STM (Maybe Bool) -> IO (Maybe Bool)
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (MemoryTicket -> Int -> STM (Maybe Bool)
attempt MemoryTicket
ticket Int
want)
overdrew <- case immediate of
Just Bool
overdrew -> Bool -> IO Bool
forall a. a -> IO a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Bool
overdrew
Maybe Bool
Nothing -> do
MetricsPort -> IO ()
mpMemoryAdmissionPause (MemoryTicket -> MetricsPort
tMetrics MemoryTicket
ticket)
(STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (TVar (Map Int (Maybe FlightKey))
-> (Map Int (Maybe FlightKey) -> Map Int (Maybe FlightKey))
-> STM ()
forall a. TVar a -> (a -> a) -> STM ()
modifyTVar' TVar (Map Int (Maybe FlightKey))
waiters (Int
-> Maybe FlightKey
-> Map Int (Maybe FlightKey)
-> Map Int (Maybe FlightKey)
forall k a. Ord k => k -> a -> Map k a -> Map k a
Map.insert (MemoryTicket -> Int
tId MemoryTicket
ticket) (MemoryTicket -> Maybe FlightKey
tServes MemoryTicket
ticket))) IO () -> IO Bool -> IO Bool
forall a b. IO a -> IO b -> IO b
forall (m :: * -> *) a b. Monad m => m a -> m b -> m b
>> STM Bool -> IO Bool
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (MemoryTicket -> Int -> STM (Maybe Bool)
attempt MemoryTicket
ticket Int
want STM (Maybe Bool) -> (Maybe Bool -> STM Bool) -> STM Bool
forall a b. STM a -> (a -> STM b) -> STM b
forall (m :: * -> *) a b. Monad m => m a -> (a -> m b) -> m b
>>= STM Bool -> (Bool -> STM Bool) -> Maybe Bool -> STM Bool
forall b a. b -> (a -> b) -> Maybe a -> b
maybe STM Bool
forall a. STM a
retry Bool -> STM Bool
forall a. a -> STM a
forall (f :: * -> *) a. Applicative f => a -> f a
pure))
IO Bool -> IO () -> IO Bool
forall (m :: * -> *) a b. MonadUnliftIO m => m a -> m b -> m a
`UE.finally` STM () -> IO ()
forall (m :: * -> *) a. MonadIO m => STM a -> m a
atomically (TVar (Map Int (Maybe FlightKey))
-> (Map Int (Maybe FlightKey) -> Map Int (Maybe FlightKey))
-> STM ()
forall a. TVar a -> (a -> a) -> STM ()
modifyTVar' TVar (Map Int (Maybe FlightKey))
waiters (Int -> Map Int (Maybe FlightKey) -> Map Int (Maybe FlightKey)
forall k a. Ord k => k -> Map k a -> Map k a
Map.delete (MemoryTicket -> Int
tId MemoryTicket
ticket)))
when overdrew (mpMemoryAdmissionOverdraw (tMetrics ticket))
where
waiters :: TVar (Map Int (Maybe FlightKey))
waiters = MemoryMeter -> TVar (Map Int (Maybe FlightKey))
mmWaiters (MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket)
attempt :: MemoryTicket -> Int -> STM (Maybe Bool)
attempt :: MemoryTicket -> Int -> STM (Maybe Bool)
attempt MemoryTicket
ticket Int
want = do
let meter :: MemoryMeter
meter = MemoryTicket -> MemoryMeter
tMeter MemoryTicket
ticket
view <- MemoryMeter -> STM MeterView
readView MemoryMeter
meter
served <- IntSet.insert (tId ticket) . (`waitingOn` tServes ticket) <$> readTVar (mmInterest meter)
case growthDecision view served want of
GrowthGate
GrowWithin -> MemoryTicket -> Int -> STM ()
takeBytes MemoryTicket
ticket Int
want STM () -> Maybe Bool -> STM (Maybe Bool)
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
False
GrowthGate
GrowOnToken -> MemoryTicket -> Int -> STM ()
takeBytes MemoryTicket
ticket Int
want STM () -> Maybe Bool -> STM (Maybe Bool)
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
True
GrowthGate
GrowTakeToken -> do
TVar (Maybe Int) -> Maybe Int -> STM ()
forall a. TVar a -> a -> STM ()
writeTVar (MemoryMeter -> TVar (Maybe Int)
mmToken MemoryMeter
meter) (Int -> Maybe Int
forall a. a -> Maybe a
Just (MemoryTicket -> Int
tId MemoryTicket
ticket))
MemoryTicket -> Int -> STM ()
takeBytes MemoryTicket
ticket Int
want STM () -> Maybe Bool -> STM (Maybe Bool)
forall (f :: * -> *) a b. Functor f => f a -> b -> f b
$> Bool -> Maybe Bool
forall a. a -> Maybe a
Just Bool
True
GrowthGate
GrowWait -> Maybe Bool -> STM (Maybe Bool)
forall a. a -> STM a
forall (f :: * -> *) a. Applicative f => a -> f a
pure Maybe Bool
forall a. Maybe a
Nothing