Safe Haskell	Safe-Infered

Ganeti.JQScheduler.Filtering

Description

Filtering of jobs for the Ganeti job queue.

Synopsis

Documentation

accessOpCodeField :: OpCode -> String -> ErrorResult JSValueSource

opCodesOf :: QueuedJob -> [OpCode]Source

reasonsOf :: QueuedJob -> [ReasonElem]Source

userOf :: QueuedJob -> String -> StringSource

evaluateFilterComparator :: Ord field => Filter field -> (Comparator -> field -> FilterValue -> Maybe Bool) -> BoolSource

matchPredicate Source

Arguments

:: QueuedJob
-> JobId	the watermark to compare against if the predicate references it
-> FilterPredicate
-> Bool

Whether a FilterPredicate is true for a job.

matches :: QueuedJob -> FilterRule -> BoolSource

Whether all predicates of the filter rule are true for the job.

orderFilters :: Set FilterRule -> [FilterRule]Source

applyingFilter :: Set FilterRule -> QueuedJob -> Maybe FilterRule Source

Finds the first filter whose predicates all match the job and whose action is not Continue. This is the applying filter.

type RateLimitSlotMap = SlotMap ByteStringSource

data FilterChainState Source

Constructors

FilterChainState
Fields rateLimitSlotMap :: RateLimitSlotMap

Instances

Eq FilterChainState
Ord FilterChainState
Show FilterChainState

tryFitSlots :: FilterChainState -> CountMap ByteString -> Maybe FilterChainState Source

queueRateLimitSlotMap :: Queue -> Set FilterRule -> RateLimitSlotMap Source

jobFiltering :: Queue -> Set FilterRule -> [JobWithStat] -> [JobWithStat]Source

Implements job filtering as specified in `doc/design-optables.rst`.

Importantly, the filter that *applies* is the first one of which all predicates match; this is implemented in applyingFilter.

The initial FilterChainState is currently not cached across selectJobsToRun invocations because the number of running jobs is typically small (< 100).