Chromium Code Reviews| OLD | NEW |
|---|---|
| (Empty) | |
| 1 // Copyright 2014 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 "content/renderer/scheduler/task_queue_manager.h" | |
| 6 | |
| 7 #include "base/bind.h" | |
| 8 #include "base/debug/trace_event.h" | |
| 9 #include "content/renderer/scheduler/task_queue_scheduler_default.h" | |
| 10 | |
| 11 namespace content { | |
| 12 | |
| 13 TaskQueueManager::TaskRunner::TaskRunner(TaskQueueManager* task_queue_manager, | |
| 14 QueueId queue) | |
| 15 : task_queue_manager_(task_queue_manager), queue_(queue) { | |
| 16 } | |
| 17 | |
| 18 TaskQueueManager::TaskRunner::~TaskRunner() { | |
| 19 } | |
| 20 | |
| 21 bool TaskQueueManager::TaskRunner::RunsTasksOnCurrentThread() const { | |
| 22 return task_queue_manager_->RunsTasksOnCurrentThread(); | |
| 23 } | |
| 24 | |
| 25 bool TaskQueueManager::TaskRunner::PostDelayedTask( | |
| 26 const tracked_objects::Location& from_here, | |
| 27 const base::Closure& task, | |
| 28 base::TimeDelta delay) { | |
| 29 return task_queue_manager_->PostDelayedTask(queue_, from_here, task, delay); | |
| 30 } | |
| 31 | |
| 32 bool TaskQueueManager::TaskRunner::PostNonNestableDelayedTask( | |
| 33 const tracked_objects::Location& from_here, | |
| 34 const base::Closure& task, | |
| 35 base::TimeDelta delay) { | |
| 36 return task_queue_manager_->PostNonNestableDelayedTask( | |
| 37 queue_, from_here, task, delay); | |
| 38 } | |
| 39 | |
| 40 TaskQueueManager::TaskQueue::TaskQueue(QueueId id) : id(id) { | |
| 41 } | |
| 42 | |
| 43 TaskQueueManager::TaskQueue::~TaskQueue() { | |
| 44 } | |
| 45 | |
| 46 TaskQueueManager::TaskQueueManager( | |
| 47 scoped_refptr<base::SingleThreadTaskRunner> main_task_runner) | |
| 48 : main_task_runner_(main_task_runner), weak_factory_(this) { | |
| 49 DCHECK(main_task_runner->RunsTasksOnCurrentThread()); | |
| 50 for (size_t i = 0; i < kTaskQueueCount; i++) { | |
| 51 QueueId id = static_cast<QueueId>(i); | |
| 52 scoped_ptr<TaskQueue> queue(new TaskQueue(id)); | |
| 53 queue->task_runner = make_scoped_refptr(new TaskRunner(this, id)); | |
| 54 queues_.push_back(queue.release()); | |
| 55 } | |
| 56 SetScheduler(make_scoped_ptr(new TaskQueueSchedulerDefault())); | |
| 57 } | |
| 58 | |
| 59 TaskQueueManager::~TaskQueueManager() { | |
| 60 } | |
| 61 | |
| 62 void TaskQueueManager::SetScheduler(scoped_ptr<TaskQueueScheduler> scheduler) { | |
| 63 scheduler_ = scheduler.Pass(); | |
| 64 std::vector<const base::TaskQueue*> work_queues; | |
| 65 for (size_t i = 0; i < queues_.size(); i++) | |
| 66 work_queues.push_back(&queues_[i]->work_queue); | |
| 67 scheduler_->SetWorkQueues(work_queues); | |
| 68 } | |
| 69 | |
| 70 scoped_refptr<base::SingleThreadTaskRunner> | |
| 71 TaskQueueManager::TaskRunnerForQueue(QueueId queue) { | |
| 72 DCHECK_LT(queue, queues_.size()); | |
| 73 return queues_[queue]->task_runner; | |
| 74 } | |
| 75 | |
| 76 bool TaskQueueManager::ReloadWorkQueue(QueueId queue) { | |
| 77 main_thread_checker_.CalledOnValidThread(); | |
| 78 DCHECK_LT(queue, queues_.size()); | |
| 79 DCHECK(queues_[queue]->work_queue.empty()); | |
| 80 base::AutoLock lock(queues_[queue]->incoming_queue_lock); | |
| 81 queues_[queue]->work_queue.Swap(&queues_[queue]->incoming_queue); | |
| 82 return queues_[queue]->work_queue.empty(); | |
| 83 } | |
| 84 | |
| 85 void TaskQueueManager::EnqueueTask(QueueId queue, | |
| 86 base::PendingTask pending_task) { | |
| 87 DCHECK_LT(queue, queues_.size()); | |
| 88 { | |
| 89 base::AutoLock lock(queues_[queue]->incoming_queue_lock); | |
| 90 queues_[queue]->incoming_queue.push(pending_task); | |
| 91 } | |
| 92 scheduler_->DidQueueTask(queue); | |
| 93 ScheduleWork(); | |
| 94 } | |
| 95 | |
| 96 void TaskQueueManager::ScheduleWork() { | |
| 97 main_task_runner_->PostTask( | |
| 98 FROM_HERE, | |
| 99 base::Bind(&TaskQueueManager::DoWork, weak_factory_.GetWeakPtr())); | |
| 100 } | |
| 101 | |
| 102 bool TaskQueueManager::ReloadWorkQueues() { | |
| 103 bool has_work = false; | |
| 104 for (auto& queue : queues_) { | |
| 105 if (!queue->work_queue.empty()) { | |
| 106 has_work = true; | |
| 107 continue; | |
| 108 } | |
| 109 if (scheduler_->ShouldReloadWorkQueue(queue->id)) | |
| 110 has_work |= ReloadWorkQueue(queue->id); | |
| 111 } | |
| 112 return has_work; | |
| 113 } | |
| 114 | |
| 115 void TaskQueueManager::DoWork() { | |
| 116 main_thread_checker_.CalledOnValidThread(); | |
| 117 | |
| 118 // FIXME: Can this ever happen? | |
|
alexclarke
2014/10/13 10:06:22
Right now I suspect no, but if you where to post D
Sami
2014/10/13 18:16:21
Right, let's figure out how idle tasks fit into al
| |
| 119 if (!ReloadWorkQueues()) | |
| 120 return; | |
| 121 | |
| 122 QueueId queue; | |
| 123 if (!scheduler_->ChooseWorkQueueToService(&queue)) | |
| 124 return; | |
| 125 RunTaskFromWorkQueue(queue); | |
| 126 } | |
| 127 | |
| 128 void TaskQueueManager::RunTaskFromWorkQueue(QueueId queue) { | |
| 129 main_thread_checker_.CalledOnValidThread(); | |
| 130 DCHECK_LT(queue, queues_.size()); | |
| 131 DCHECK(!queues_[queue]->work_queue.empty()); | |
| 132 base::PendingTask pending_task = queues_[queue]->work_queue.front(); | |
| 133 queues_[queue]->work_queue.pop(); | |
| 134 task_annotator_.RunTask( | |
| 135 "TaskQueueManager::PostTask", "TaskQueueManager::DoWork", pending_task); | |
| 136 } | |
| 137 | |
| 138 bool TaskQueueManager::RunsTasksOnCurrentThread() const { | |
| 139 return main_task_runner_->RunsTasksOnCurrentThread(); | |
| 140 } | |
| 141 | |
| 142 bool TaskQueueManager::PostDelayedTask( | |
| 143 QueueId queue, | |
| 144 const tracked_objects::Location& from_here, | |
| 145 const base::Closure& task, | |
| 146 base::TimeDelta delay) { | |
| 147 int sequence_num = task_sequence_num_.GetNext(); | |
| 148 | |
| 149 base::PendingTask pending_task(from_here, task); | |
| 150 pending_task.sequence_num = sequence_num; | |
| 151 | |
| 152 task_annotator_.DidQueueTask("TaskQueueManager::PostTask", pending_task); | |
| 153 if (delay > base::TimeDelta()) { | |
| 154 return main_task_runner_->PostDelayedTask( | |
| 155 from_here, | |
| 156 base::Bind(&TaskQueueManager::EnqueueTask, | |
| 157 weak_factory_.GetWeakPtr(), | |
| 158 queue, | |
| 159 pending_task), | |
| 160 delay); | |
| 161 } | |
| 162 EnqueueTask(queue, pending_task); | |
| 163 return true; | |
| 164 } | |
| 165 | |
| 166 bool TaskQueueManager::PostNonNestableDelayedTask( | |
| 167 QueueId queue, | |
| 168 const tracked_objects::Location& from_here, | |
| 169 const base::Closure& task, | |
| 170 base::TimeDelta delay) { | |
| 171 // Defer non-nestable work to the main task runner. | |
| 172 return main_task_runner_->PostNonNestableDelayedTask(from_here, task, delay); | |
| 173 } | |
| 174 | |
| 175 } // namespace content | |
| OLD | NEW |