Home | History | Annotate | Download | only in base

Lines Matching defs:Priority

20 // We rely on the priority enum values being sequential having starting at 0,
31 typedef PrioritizedDispatcher::Priority Priority;
39 Priority priority,
43 priority_(priority),
73 EXPECT_EQ(priority_, handle_.priority());
79 void ChangePriority(Priority priority) {
85 handle_ = dispatcher_->ChangePriority(handle_, priority);
93 EXPECT_EQ(priority, handle_.priority());
131 Priority priority_;
144 TestJob* AddJob(char data, Priority priority) {
145 TestJob* job = new TestJob(dispatcher_.get(), data, priority, &log_);
151 TestJob* AddJobAtHead(char data, Priority priority) {
152 TestJob* job = new TestJob(dispatcher_.get(), data, priority, &log_);
181 for (size_t priority = MINIMUM_PRIORITY; priority <= MAXIMUM_PRIORITY;
182 ++priority) {
183 EXPECT_EQ(original_limits.reserved_slots[priority],
184 retrieved_limits.reserved_slots[priority]);
197 for (size_t priority = MINIMUM_PRIORITY; priority <= MAXIMUM_PRIORITY;
198 ++priority) {
199 EXPECT_EQ(new_limits.reserved_slots[priority],
200 retrieved_limits.reserved_slots[priority]);
321 // Reserve one slot only for HIGHEST priority requests.
342 // Increasing |job_e|'s priority to HIGHEST should result in it being