OLD | NEW |
(Empty) | |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #include "base/task_scheduler/sequence.h" |
| 6 |
| 7 #include <utility> |
| 8 |
| 9 #include "base/logging.h" |
| 10 #include "base/time/time.h" |
| 11 |
| 12 namespace base { |
| 13 namespace internal { |
| 14 |
| 15 Sequence::Sequence() = default; |
| 16 |
| 17 bool Sequence::PushTask(scoped_ptr<Task> task) { |
| 18 DCHECK(task->sequenced_time.is_null()); |
| 19 task->sequenced_time = base::TimeTicks::Now(); |
| 20 |
| 21 AutoSchedulerLock auto_lock(lock_); |
| 22 |
| 23 const TaskPriorityUnderlyingType priority_index = |
| 24 static_cast<TaskPriorityUnderlyingType>(task->traits.priority()); |
| 25 ++num_tasks_per_priority_[priority_index]; |
| 26 |
| 27 queue_.push(std::move(task)); |
| 28 |
| 29 // Return true if the sequence was empty before the push. |
| 30 return queue_.size() == 1; |
| 31 } |
| 32 |
| 33 const Task* Sequence::PeekTask() const { |
| 34 AutoSchedulerLock auto_lock(lock_); |
| 35 |
| 36 if (queue_.empty()) |
| 37 return nullptr; |
| 38 |
| 39 return queue_.front().get(); |
| 40 } |
| 41 |
| 42 bool Sequence::PopTask() { |
| 43 AutoSchedulerLock auto_lock(lock_); |
| 44 DCHECK(!queue_.empty()); |
| 45 |
| 46 const TaskPriorityUnderlyingType priority_index = |
| 47 static_cast<TaskPriorityUnderlyingType>( |
| 48 queue_.front()->traits.priority()); |
| 49 --num_tasks_per_priority_[priority_index]; |
| 50 |
| 51 queue_.pop(); |
| 52 return queue_.empty(); |
| 53 } |
| 54 |
| 55 SequenceSortKey Sequence::GetSortKey() const { |
| 56 AutoSchedulerLock auto_lock(lock_); |
| 57 DCHECK(!queue_.empty()); |
| 58 |
| 59 // Find the highest task priority in the sequence. |
| 60 TaskPriority priority = TaskPriority::LOWEST; |
| 61 for (TaskPriorityUnderlyingType i = |
| 62 static_cast<TaskPriorityUnderlyingType>(TaskPriority::HIGHEST); |
| 63 i > static_cast<TaskPriorityUnderlyingType>(TaskPriority::LOWEST); --i) { |
| 64 if (num_tasks_per_priority_[i] > 0) { |
| 65 priority = static_cast<TaskPriority>(i); |
| 66 break; |
| 67 } |
| 68 } |
| 69 |
| 70 return SequenceSortKey(priority, queue_.front()->sequenced_time); |
| 71 } |
| 72 |
| 73 Sequence::~Sequence() = default; |
| 74 |
| 75 } // namespace internal |
| 76 } // namespace base |
OLD | NEW |