OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 2015 The Chromium Authors. All rights reserved. |
2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
4 | 4 |
5 #include "components/scheduler/base/work_queue.h" | 5 #include "platform/scheduler/base/work_queue.h" |
6 | 6 |
7 #include "components/scheduler/base/work_queue_sets.h" | 7 #include "platform/scheduler/base/work_queue_sets.h" |
8 | 8 |
| 9 namespace blink { |
9 namespace scheduler { | 10 namespace scheduler { |
10 namespace internal { | 11 namespace internal { |
11 | 12 |
12 WorkQueue::WorkQueue(TaskQueueImpl* task_queue, const char* name) | 13 WorkQueue::WorkQueue(TaskQueueImpl* task_queue, const char* name) |
13 : work_queue_sets_(nullptr), | 14 : work_queue_sets_(nullptr), |
14 task_queue_(task_queue), | 15 task_queue_(task_queue), |
15 work_queue_set_index_(0), | 16 work_queue_set_index_(0), |
16 name_(name) {} | 17 name_(name) {} |
17 | 18 |
18 void WorkQueue::AsValueInto(base::trace_event::TracedValue* state) const { | 19 void WorkQueue::AsValueInto(base::trace_event::TracedValue* state) const { |
19 // Remove const to search |work_queue_| in the destructive manner. Restore the | 20 // Remove const to search |work_queue_| in the destructive manner. Restore the |
20 // content from |visited| later. | 21 // content from |visited| later. |
21 std::queue<TaskQueueImpl::Task>* mutable_queue = | 22 std::queue<TaskQueueImpl::Task>* mutable_queue = |
22 const_cast<std::queue<TaskQueueImpl::Task>*>(&work_queue_); | 23 const_cast<std::queue<TaskQueueImpl::Task>*>(&work_queue_); |
23 std::queue<TaskQueueImpl::Task> visited; | 24 std::queue<TaskQueueImpl::Task> visited; |
24 while (!mutable_queue->empty()) { | 25 while (!mutable_queue->empty()) { |
25 TaskQueueImpl::TaskAsValueInto(mutable_queue->front(), state); | 26 TaskQueueImpl::TaskAsValueInto(mutable_queue->front(), state); |
26 visited.push(std::move(mutable_queue->front())); | 27 visited.push(std::move(mutable_queue->front())); |
27 mutable_queue->pop(); | 28 mutable_queue->pop(); |
28 } | 29 } |
29 *mutable_queue = std::move(visited); | 30 *mutable_queue = std::move(visited); |
30 } | 31 } |
31 | 32 |
32 WorkQueue::~WorkQueue() { | 33 WorkQueue::~WorkQueue() { |
33 DCHECK(!work_queue_sets_) << task_queue_ ->GetName() << " : " | 34 DCHECK(!work_queue_sets_) << task_queue_->GetName() << " : " |
34 << work_queue_sets_->name() << " : " << name_; | 35 << work_queue_sets_->name() << " : " << name_; |
35 } | 36 } |
36 | 37 |
37 const TaskQueueImpl::Task* WorkQueue::GetFrontTask() const { | 38 const TaskQueueImpl::Task* WorkQueue::GetFrontTask() const { |
38 if (work_queue_.empty()) | 39 if (work_queue_.empty()) |
39 return nullptr; | 40 return nullptr; |
40 return &work_queue_.front(); | 41 return &work_queue_.front(); |
41 } | 42 } |
42 | 43 |
43 bool WorkQueue::GetFrontTaskEnqueueOrder(EnqueueOrder* enqueue_order) const { | 44 bool WorkQueue::GetFrontTaskEnqueueOrder(EnqueueOrder* enqueue_order) const { |
44 if (work_queue_.empty()) | 45 if (work_queue_.empty()) |
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
102 bool have_task = GetFrontTaskEnqueueOrder(&enqueue_order); | 103 bool have_task = GetFrontTaskEnqueueOrder(&enqueue_order); |
103 bool have_other_task = | 104 bool have_other_task = |
104 other_queue->GetFrontTaskEnqueueOrder(&other_enqueue_order); | 105 other_queue->GetFrontTaskEnqueueOrder(&other_enqueue_order); |
105 DCHECK(have_task); | 106 DCHECK(have_task); |
106 DCHECK(have_other_task); | 107 DCHECK(have_other_task); |
107 return enqueue_order < other_enqueue_order; | 108 return enqueue_order < other_enqueue_order; |
108 } | 109 } |
109 | 110 |
110 } // namespace internal | 111 } // namespace internal |
111 } // namespace scheduler | 112 } // namespace scheduler |
| 113 } // namespace blink |
OLD | NEW |