Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(78)

Side by Side Diff: components/scheduler/base/task_queue_manager.cc

Issue 1432263002: (reland) Adds TimeDomains to the TaskQueueManager (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master
Patch Set: Rebased Created 5 years, 1 month ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2014 The Chromium Authors. All rights reserved. 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 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/task_queue_manager.h" 5 #include "components/scheduler/base/task_queue_manager.h"
6 6
7 #include <queue> 7 #include <queue>
8 #include <set> 8 #include <set>
9 9
10 #include "base/bind.h" 10 #include "base/bind.h"
11 #include "components/scheduler/base/lazy_now.h" 11 #include "components/scheduler/base/delayed_task_delegate_impl.h"
12 #include "components/scheduler/base/task_queue_impl.h" 12 #include "components/scheduler/base/task_queue_impl.h"
13 #include "components/scheduler/base/task_queue_manager_delegate.h" 13 #include "components/scheduler/base/task_queue_manager_delegate.h"
14 #include "components/scheduler/base/task_queue_selector.h" 14 #include "components/scheduler/base/task_queue_selector.h"
15 #include "components/scheduler/base/task_queue_sets.h" 15 #include "components/scheduler/base/task_queue_sets.h"
16 16
17 namespace { 17 namespace {
18 const int64_t kMaxTimeTicks = std::numeric_limits<int64>::max(); 18 const int64_t kMaxTimeTicks = std::numeric_limits<int64>::max();
19 } 19 }
20 20
21 namespace scheduler { 21 namespace scheduler {
(...skipping 17 matching lines...) Expand all
39 weak_factory_(this) { 39 weak_factory_(this) {
40 DCHECK(delegate->RunsTasksOnCurrentThread()); 40 DCHECK(delegate->RunsTasksOnCurrentThread());
41 TRACE_EVENT_OBJECT_CREATED_WITH_ID(disabled_by_default_tracing_category, 41 TRACE_EVENT_OBJECT_CREATED_WITH_ID(disabled_by_default_tracing_category,
42 "TaskQueueManager", this); 42 "TaskQueueManager", this);
43 selector_.SetTaskQueueSelectorObserver(this); 43 selector_.SetTaskQueueSelectorObserver(this);
44 44
45 decrement_pending_and_do_work_closure_ = 45 decrement_pending_and_do_work_closure_ =
46 base::Bind(&TaskQueueManager::DoWork, weak_factory_.GetWeakPtr(), true); 46 base::Bind(&TaskQueueManager::DoWork, weak_factory_.GetWeakPtr(), true);
47 do_work_closure_ = 47 do_work_closure_ =
48 base::Bind(&TaskQueueManager::DoWork, weak_factory_.GetWeakPtr(), false); 48 base::Bind(&TaskQueueManager::DoWork, weak_factory_.GetWeakPtr(), false);
49
50 delayed_task_delegate_ = make_scoped_refptr(
51 new DelayedTaskDelegateImpl(delegate.get(), do_work_closure_));
49 } 52 }
50 53
51 TaskQueueManager::~TaskQueueManager() { 54 TaskQueueManager::~TaskQueueManager() {
52 TRACE_EVENT_OBJECT_DELETED_WITH_ID(disabled_by_default_tracing_category_, 55 TRACE_EVENT_OBJECT_DELETED_WITH_ID(disabled_by_default_tracing_category_,
53 "TaskQueueManager", this); 56 "TaskQueueManager", this);
54 57
55 while (!queues_.empty()) 58 while (!queues_.empty())
56 (*queues_.begin())->UnregisterTaskQueue(); 59 (*queues_.begin())->UnregisterTaskQueue();
57 60
58 selector_.SetTaskQueueSelectorObserver(nullptr); 61 selector_.SetTaskQueueSelectorObserver(nullptr);
59 } 62 }
60 63
61 scoped_refptr<internal::TaskQueueImpl> TaskQueueManager::NewTaskQueue( 64 scoped_refptr<internal::TaskQueueImpl> TaskQueueManager::NewTaskQueue(
62 const TaskQueue::Spec& spec) { 65 const TaskQueue::Spec& spec) {
63 TRACE_EVENT1(tracing_category_, 66 TRACE_EVENT1(tracing_category_,
64 "TaskQueueManager::NewTaskQueue", "queue_name", spec.name); 67 "TaskQueueManager::NewTaskQueue", "queue_name", spec.name);
65 DCHECK(main_thread_checker_.CalledOnValidThread()); 68 DCHECK(main_thread_checker_.CalledOnValidThread());
66 scoped_refptr<internal::TaskQueueImpl> queue( 69 scoped_refptr<internal::TaskQueueImpl> queue(
67 make_scoped_refptr(new internal::TaskQueueImpl( 70 make_scoped_refptr(new internal::TaskQueueImpl(
68 this, spec, disabled_by_default_tracing_category_, 71 this, spec.delayed_task_delegate ? spec.delayed_task_delegate
72 : delayed_task_delegate_,
73 spec, disabled_by_default_tracing_category_,
69 disabled_by_default_verbose_tracing_category_))); 74 disabled_by_default_verbose_tracing_category_)));
70 queues_.insert(queue); 75 queues_.insert(queue);
71 selector_.AddQueue(queue.get()); 76 selector_.AddQueue(queue.get());
72 return queue; 77 return queue;
73 } 78 }
74 79
75 void TaskQueueManager::SetObserver(Observer* observer) { 80 void TaskQueueManager::SetObserver(Observer* observer) {
76 DCHECK(main_thread_checker_.CalledOnValidThread()); 81 DCHECK(main_thread_checker_.CalledOnValidThread());
77 observer_ = observer; 82 observer_ = observer;
78 } 83 }
79 84
80 void TaskQueueManager::UnregisterTaskQueue( 85 void TaskQueueManager::UnregisterTaskQueue(
81 scoped_refptr<internal::TaskQueueImpl> task_queue) { 86 scoped_refptr<internal::TaskQueueImpl> task_queue) {
82 TRACE_EVENT1(tracing_category_, 87 TRACE_EVENT1(tracing_category_,
83 "TaskQueueManager::UnregisterTaskQueue", "queue_name", 88 "TaskQueueManager::UnregisterTaskQueue", "queue_name",
84 task_queue->GetName()); 89 task_queue->GetName());
85 DCHECK(main_thread_checker_.CalledOnValidThread()); 90 DCHECK(main_thread_checker_.CalledOnValidThread());
86 if (observer_) 91 if (observer_)
87 observer_->OnUnregisterTaskQueue(task_queue); 92 observer_->OnUnregisterTaskQueue(task_queue);
88 93
89 // Add |task_queue| to |queues_to_delete_| so we can prevent it from being 94 // Add |task_queue| to |queues_to_delete_| so we can prevent it from being
90 // freed while any of our structures hold hold a raw pointer to it. 95 // freed while any of our structures hold hold a raw pointer to it.
91 queues_to_delete_.insert(task_queue); 96 queues_to_delete_.insert(task_queue);
92 queues_.erase(task_queue); 97 queues_.erase(task_queue);
93 selector_.RemoveQueue(task_queue.get()); 98 selector_.RemoveQueue(task_queue.get());
94 99
95 // We need to remove |task_queue| from delayed_wakeup_multimap_ which is a
96 // little awkward since it's keyed by time. O(n) running time.
97 for (DelayedWakeupMultimap::iterator iter = delayed_wakeup_multimap_.begin();
98 iter != delayed_wakeup_multimap_.end();) {
99 if (iter->second == task_queue.get()) {
100 DelayedWakeupMultimap::iterator temp = iter;
101 iter++;
102 // O(1) amortized.
103 delayed_wakeup_multimap_.erase(temp);
104 } else {
105 iter++;
106 }
107 }
108
109 // |newly_updatable_| might contain |task_queue|, we use 100 // |newly_updatable_| might contain |task_queue|, we use
110 // MoveNewlyUpdatableQueuesIntoUpdatableQueueSet to flush it out. 101 // MoveNewlyUpdatableQueuesIntoUpdatableQueueSet to flush it out.
111 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); 102 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet();
112 updatable_queue_set_.erase(task_queue.get()); 103 updatable_queue_set_.erase(task_queue.get());
113 } 104 }
114 105
115 base::TimeTicks TaskQueueManager::NextPendingDelayedTaskRunTime() { 106 base::TimeTicks TaskQueueManager::NextPendingDelayedTaskRunTime() {
116 DCHECK(main_thread_checker_.CalledOnValidThread()); 107 DCHECK(main_thread_checker_.CalledOnValidThread());
117 bool found_pending_task = false; 108 bool found_pending_task = false;
118 base::TimeTicks next_pending_delayed_task( 109 base::TimeTicks next_pending_delayed_task(
(...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after
164 newly_updatable_.pop_back(); 155 newly_updatable_.pop_back();
165 } 156 }
166 } 157 }
167 158
168 void TaskQueueManager::UpdateWorkQueues( 159 void TaskQueueManager::UpdateWorkQueues(
169 bool should_trigger_wakeup, 160 bool should_trigger_wakeup,
170 const internal::TaskQueueImpl::Task* previous_task) { 161 const internal::TaskQueueImpl::Task* previous_task) {
171 DCHECK(main_thread_checker_.CalledOnValidThread()); 162 DCHECK(main_thread_checker_.CalledOnValidThread());
172 TRACE_EVENT0(disabled_by_default_tracing_category_, 163 TRACE_EVENT0(disabled_by_default_tracing_category_,
173 "TaskQueueManager::UpdateWorkQueues"); 164 "TaskQueueManager::UpdateWorkQueues");
174 internal::LazyNow lazy_now(delegate().get()); 165 delayed_task_delegate_->InvalidateNowCache();
175 166
176 // Move any ready delayed tasks into the incomming queues. 167 // Move any ready delayed tasks into the incomming queues.
177 WakeupReadyDelayedQueues(&lazy_now); 168 delayed_task_delegate_->WakeupReadyDelayedQueues();
178 169
179 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); 170 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet();
180 171
181 auto iter = updatable_queue_set_.begin(); 172 auto iter = updatable_queue_set_.begin();
182 while (iter != updatable_queue_set_.end()) { 173 while (iter != updatable_queue_set_.end()) {
183 internal::TaskQueueImpl* queue = *iter++; 174 internal::TaskQueueImpl* queue = *iter++;
184 // NOTE Update work queue may erase itself from |updatable_queue_set_|. 175 // NOTE Update work queue may erase itself from |updatable_queue_set_|.
185 // This is fine, erasing an element won't invalidate any interator, as long 176 // This is fine, erasing an element won't invalidate any interator, as long
186 // as the iterator isn't the element being delated. 177 // as the iterator isn't the element being delated.
187 if (queue->work_queue().empty()) 178 if (queue->work_queue().empty())
188 queue->UpdateWorkQueue(&lazy_now, should_trigger_wakeup, previous_task); 179 queue->UpdateWorkQueue(should_trigger_wakeup, previous_task);
189 } 180 }
190 } 181 }
191 182
192 void TaskQueueManager::ScheduleDelayedWorkTask(
193 scoped_refptr<internal::TaskQueueImpl> queue,
194 base::TimeTicks delayed_run_time) {
195 internal::LazyNow lazy_now(delegate().get());
196 ScheduleDelayedWork(queue.get(), delayed_run_time, &lazy_now);
197 }
198
199 void TaskQueueManager::ScheduleDelayedWork(internal::TaskQueueImpl* queue,
200 base::TimeTicks delayed_run_time,
201 internal::LazyNow* lazy_now) {
202 if (!delegate_->BelongsToCurrentThread()) {
203 // NOTE posting a delayed task from a different thread is not expected to be
204 // common. This pathway is less optimal than perhaps it could be because
205 // it causes two main thread tasks to be run. Should this assumption prove
206 // to be false in future, we may need to revisit this.
207 delegate_->PostTask(
208 FROM_HERE, base::Bind(&TaskQueueManager::ScheduleDelayedWorkTask,
209 weak_factory_.GetWeakPtr(),
210 scoped_refptr<internal::TaskQueueImpl>(queue),
211 delayed_run_time));
212 return;
213 }
214
215 // Make sure there's one (and only one) task posted to |delegate_|
216 // to call |DelayedDoWork| at |delayed_run_time|.
217 if (delayed_wakeup_multimap_.find(delayed_run_time) ==
218 delayed_wakeup_multimap_.end()) {
219 base::TimeDelta delay =
220 std::max(base::TimeDelta(), delayed_run_time - lazy_now->Now());
221 delegate_->PostDelayedTask(FROM_HERE, do_work_closure_, delay);
222 }
223 delayed_wakeup_multimap_.insert(std::make_pair(delayed_run_time, queue));
224 }
225
226 void TaskQueueManager::WakeupReadyDelayedQueues(internal::LazyNow* lazy_now) {
227 // Wake up any queues with pending delayed work. Note std::multipmap stores
228 // the elements sorted by key, so the begin() iterator points to the earliest
229 // queue to wakeup.
230 std::set<internal::TaskQueueImpl*> dedup_set;
231 while (!delayed_wakeup_multimap_.empty()) {
232 DelayedWakeupMultimap::iterator next_wakeup =
233 delayed_wakeup_multimap_.begin();
234 if (next_wakeup->first > lazy_now->Now())
235 break;
236 // A queue could have any number of delayed tasks pending so it's worthwhile
237 // deduping calls to MoveReadyDelayedTasksToIncomingQueue since it takes a
238 // lock. NOTE the order in which these are called matters since the order
239 // in which EnqueueTaskLocks is called is respected when choosing which
240 // queue to execute a task from.
241 if (dedup_set.insert(next_wakeup->second).second)
242 next_wakeup->second->MoveReadyDelayedTasksToIncomingQueue(lazy_now);
243 delayed_wakeup_multimap_.erase(next_wakeup);
244 }
245 }
246
247 void TaskQueueManager::MaybePostDoWorkOnMainRunner() { 183 void TaskQueueManager::MaybePostDoWorkOnMainRunner() {
248 bool on_main_thread = delegate_->BelongsToCurrentThread(); 184 bool on_main_thread = delegate_->BelongsToCurrentThread();
249 if (on_main_thread) { 185 if (on_main_thread) {
250 // We only want one pending DoWork posted from the main thread, or we risk 186 // We only want one pending DoWork posted from the main thread, or we risk
251 // an explosion of pending DoWorks which could starve out everything else. 187 // an explosion of pending DoWorks which could starve out everything else.
252 if (pending_dowork_count_ > 0) { 188 if (pending_dowork_count_ > 0) {
253 return; 189 return;
254 } 190 }
255 pending_dowork_count_++; 191 pending_dowork_count_++;
256 delegate_->PostTask(FROM_HERE, decrement_pending_and_do_work_closure_); 192 delegate_->PostTask(FROM_HERE, decrement_pending_and_do_work_closure_);
(...skipping 177 matching lines...) Expand 10 before | Expand all | Expand 10 after
434 } 370 }
435 371
436 void TaskQueueManager::OnTaskQueueEnabled(internal::TaskQueueImpl* queue) { 372 void TaskQueueManager::OnTaskQueueEnabled(internal::TaskQueueImpl* queue) {
437 DCHECK(main_thread_checker_.CalledOnValidThread()); 373 DCHECK(main_thread_checker_.CalledOnValidThread());
438 // Only schedule DoWork if there's something to do. 374 // Only schedule DoWork if there's something to do.
439 if (!queue->work_queue().empty()) 375 if (!queue->work_queue().empty())
440 MaybePostDoWorkOnMainRunner(); 376 MaybePostDoWorkOnMainRunner();
441 } 377 }
442 378
443 } // namespace scheduler 379 } // namespace scheduler
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698