Lines Matching defs:Priority
15 // A priority-based dispatcher of jobs. Dispatch order is by priority (highest
21 // non-thread-safe PriorityQueue. All operations are O(p) time for p priority
28 typedef PriorityQueue<Job*>::Priority Priority;
32 // for at most 30 running jobs in total. Jobs at priority 0 can't use slots
35 // jobs at priority 1 or below can start. After one more job starts, no jobs
36 // at priority 2 or below can start, since the remaining 5 slots are reserved
37 // for priority 3 or above.
39 Limits(Priority num_priorities, size_t total_jobs);
44 // Number of slots reserved for each priority and higher.
75 // Adds |job| with |priority| to the dispatcher. If limits permit, |job| is
79 Handle Add(Job* job, Priority priority);
82 // priorities of |priority|.
83 Handle AddAtHead(Job* job, Priority priority);
89 // Cancels and returns the oldest-lowest-priority Job invalidating any
93 // Moves the queued job with |handle| to the end of all values with priority
94 // |priority| and returns the updated handle, or null-handle if it starts the
95 // job. Invalidates |handle|. No-op if priority did not change.
96 Handle ChangePriority(const Handle& handle, Priority priority);
103 // reserved for the lowest priority will always be 0, even if it was non-zero
115 // Attempts to dispatch the job with |handle| at priority |priority| (might be
116 // different than |handle.priority()|. Returns true if successful. If so
118 bool MaybeDispatchJob(const Handle& handle, Priority priority);
120 // Attempts to dispatch the next highest priority job in the queue. Returns
127 // priority is started. If a greater or equal number of jobs are running, then
