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/time_domain.h" | 5 #include "components/scheduler/base/time_domain.h" |
6 | 6 |
7 #include <set> | 7 #include <set> |
8 | 8 |
9 #include "components/scheduler/base/task_queue_impl.h" | 9 #include "components/scheduler/base/task_queue_impl.h" |
10 #include "components/scheduler/base/task_queue_manager_delegate.h" | 10 #include "components/scheduler/base/task_queue_manager_delegate.h" |
11 #include "components/scheduler/scheduler_export.h" | 11 #include "components/scheduler/scheduler_export.h" |
12 | 12 |
13 namespace scheduler { | 13 namespace scheduler { |
14 | 14 |
15 TimeDomain::TimeDomain() {} | 15 TimeDomain::TimeDomain() : observer_(nullptr) {} |
16 | 16 |
17 TimeDomain::~TimeDomain() {} | 17 TimeDomain::~TimeDomain() {} |
18 | 18 |
19 void TimeDomain::UnregisterQueue(internal::TaskQueueImpl* queue) { | 19 void TimeDomain::UnregisterQueue(internal::TaskQueueImpl* queue) { |
20 // We need to remove |task_queue| from delayed_wakeup_multimap_ which is a | 20 // We need to remove |task_queue| from delayed_wakeup_multimap_ which is a |
21 // little awkward since it's keyed by time. O(n) running time. | 21 // little awkward since it's keyed by time. O(n) running time. |
22 for (DelayedWakeupMultimap::iterator iter = delayed_wakeup_multimap_.begin(); | 22 for (DelayedWakeupMultimap::iterator iter = delayed_wakeup_multimap_.begin(); |
23 iter != delayed_wakeup_multimap_.end();) { | 23 iter != delayed_wakeup_multimap_.end();) { |
24 if (iter->second == queue) { | 24 if (iter->second == queue) { |
25 DelayedWakeupMultimap::iterator temp = iter; | 25 DelayedWakeupMultimap::iterator temp = iter; |
(...skipping 39 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
65 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, | 65 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, |
66 base::TimeTicks delayed_run_time, | 66 base::TimeTicks delayed_run_time, |
67 LazyNow* lazy_now) { | 67 LazyNow* lazy_now) { |
68 DCHECK(main_thread_checker_.CalledOnValidThread()); | 68 DCHECK(main_thread_checker_.CalledOnValidThread()); |
69 | 69 |
70 if (delayed_wakeup_multimap_.empty() || | 70 if (delayed_wakeup_multimap_.empty() || |
71 delayed_run_time < delayed_wakeup_multimap_.begin()->first) { | 71 delayed_run_time < delayed_wakeup_multimap_.begin()->first) { |
72 base::TimeDelta delay = | 72 base::TimeDelta delay = |
73 std::max(base::TimeDelta(), delayed_run_time - lazy_now->Now()); | 73 std::max(base::TimeDelta(), delayed_run_time - lazy_now->Now()); |
74 RequestWakeup(lazy_now, delay); | 74 RequestWakeup(lazy_now, delay); |
75 if (observer_) | |
76 observer_->OnRequestWakeup(); | |
75 } | 77 } |
76 delayed_wakeup_multimap_.insert(std::make_pair(delayed_run_time, queue)); | 78 delayed_wakeup_multimap_.insert(std::make_pair(delayed_run_time, queue)); |
77 } | 79 } |
78 | 80 |
79 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) { | 81 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) { |
80 base::AutoLock lock(newly_updatable_lock_); | 82 { |
81 newly_updatable_.push_back(queue); | 83 base::AutoLock lock(newly_updatable_lock_); |
84 newly_updatable_.push_back(queue); | |
85 } | |
86 if (observer_) | |
87 observer_->OnRegisterAsUpdatableTaskQueue(); | |
82 } | 88 } |
83 | 89 |
84 void TimeDomain::UnregisterAsUpdatableTaskQueue( | 90 void TimeDomain::UnregisterAsUpdatableTaskQueue( |
85 internal::TaskQueueImpl* queue) { | 91 internal::TaskQueueImpl* queue) { |
86 DCHECK(main_thread_checker_.CalledOnValidThread()); | 92 DCHECK(main_thread_checker_.CalledOnValidThread()); |
87 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); | 93 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); |
88 #ifndef NDEBUG | 94 #ifndef NDEBUG |
89 { | 95 { |
90 base::AutoLock lock(newly_updatable_lock_); | 96 base::AutoLock lock(newly_updatable_lock_); |
91 DCHECK(!(updatable_queue_set_.find(queue) == updatable_queue_set_.end() && | 97 DCHECK(!(updatable_queue_set_.find(queue) == updatable_queue_set_.end() && |
(...skipping 49 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
141 // deduping calls to MoveReadyDelayedTasksToIncomingQueue since it takes a | 147 // deduping calls to MoveReadyDelayedTasksToIncomingQueue since it takes a |
142 // lock. NOTE the order in which these are called matters since the order | 148 // lock. NOTE the order in which these are called matters since the order |
143 // in which EnqueueTaskLocks is called is respected when choosing which | 149 // in which EnqueueTaskLocks is called is respected when choosing which |
144 // queue to execute a task from. | 150 // queue to execute a task from. |
145 if (dedup_set.insert(next_wakeup->second).second) | 151 if (dedup_set.insert(next_wakeup->second).second) |
146 next_wakeup->second->MoveReadyDelayedTasksToIncomingQueue(lazy_now); | 152 next_wakeup->second->MoveReadyDelayedTasksToIncomingQueue(lazy_now); |
147 delayed_wakeup_multimap_.erase(next_wakeup); | 153 delayed_wakeup_multimap_.erase(next_wakeup); |
148 } | 154 } |
149 } | 155 } |
150 | 156 |
157 void TimeDomain::SetObserver(Observer* observer) { | |
Sami
2015/11/24 12:48:48
Can we require this to be passed in at constructio
alex clarke (OOO till 29th)
2015/11/25 12:29:36
Agreed this is a bit subtle thanks to the ownershi
| |
158 observer_ = observer; | |
159 } | |
160 | |
151 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { | 161 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { |
152 if (delayed_wakeup_multimap_.empty()) | 162 if (delayed_wakeup_multimap_.empty()) |
153 return false; | 163 return false; |
154 | 164 |
155 *out_time = delayed_wakeup_multimap_.begin()->first; | 165 *out_time = delayed_wakeup_multimap_.begin()->first; |
156 return true; | 166 return true; |
157 } | 167 } |
158 | 168 |
159 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { | 169 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { |
160 if (delayed_wakeup_multimap_.empty()) | 170 if (delayed_wakeup_multimap_.empty()) |
161 return false; | 171 return false; |
162 | 172 |
163 *out_task_queue = delayed_wakeup_multimap_.begin()->second; | 173 *out_task_queue = delayed_wakeup_multimap_.begin()->second; |
164 return true; | 174 return true; |
165 } | 175 } |
166 | 176 |
167 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { | 177 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { |
168 state->BeginDictionary(); | 178 state->BeginDictionary(); |
169 state->SetString("name", GetName()); | 179 state->SetString("name", GetName()); |
170 state->BeginArray("updatable_queue_set"); | 180 state->BeginArray("updatable_queue_set"); |
171 for (auto& queue : updatable_queue_set_) | 181 for (auto& queue : updatable_queue_set_) |
172 state->AppendString(queue->GetName()); | 182 state->AppendString(queue->GetName()); |
173 state->EndArray(); | 183 state->EndArray(); |
174 AsValueIntoInternal(state); | 184 AsValueIntoInternal(state); |
175 state->EndDictionary(); | 185 state->EndDictionary(); |
176 } | 186 } |
177 | 187 |
178 } // namespace scheduler | 188 } // namespace scheduler |
OLD | NEW |