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 "platform/scheduler/base/time_domain.h" | 5 #include "platform/scheduler/base/time_domain.h" |
6 | 6 |
7 #include <set> | 7 #include <set> |
8 | 8 |
9 #include "platform/scheduler/base/task_queue_impl.h" | 9 #include "platform/scheduler/base/task_queue_impl.h" |
10 #include "platform/scheduler/base/task_queue_manager_delegate.h" | 10 #include "platform/scheduler/base/task_queue_manager_delegate.h" |
11 #include "platform/scheduler/base/work_queue.h" | 11 #include "platform/scheduler/base/work_queue.h" |
12 | 12 |
13 namespace blink { | 13 namespace blink { |
14 namespace scheduler { | 14 namespace scheduler { |
15 | 15 |
16 TimeDomain::TimeDomain(Observer* observer) : observer_(observer) {} | 16 TimeDomain::TimeDomain(Observer* observer) : observer_(observer) {} |
17 | 17 |
18 TimeDomain::~TimeDomain() { | 18 TimeDomain::~TimeDomain() { |
19 DCHECK(main_thread_checker_.CalledOnValidThread()); | 19 DCHECK(main_thread_checker_.CalledOnValidThread()); |
20 } | 20 } |
21 | 21 |
22 void TimeDomain::RegisterQueue(internal::TaskQueueImpl* queue) { | 22 void TimeDomain::RegisterQueue(internal::TaskQueueImpl* queue) { |
23 DCHECK(main_thread_checker_.CalledOnValidThread()); | 23 DCHECK(main_thread_checker_.CalledOnValidThread()); |
24 DCHECK_EQ(queue->GetTimeDomain(), this); | 24 DCHECK_EQ(queue->GetTimeDomain(), this); |
25 } | 25 } |
26 | 26 |
27 void TimeDomain::UnregisterQueue(internal::TaskQueueImpl* queue) { | 27 void TimeDomain::UnregisterQueue(internal::TaskQueueImpl* queue) { |
28 DCHECK(main_thread_checker_.CalledOnValidThread()); | 28 DCHECK(main_thread_checker_.CalledOnValidThread()); |
29 DCHECK_EQ(queue->GetTimeDomain(), this); | 29 DCHECK_EQ(queue->GetTimeDomain(), this); |
30 UnregisterAsUpdatableTaskQueue(queue); | |
31 | 30 |
32 // If no wakeup has been requested then bail out. | 31 CancelDelayedWork(queue); |
33 if (!queue->heap_handle().IsValid()) | |
34 return; | |
35 | |
36 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); | |
37 | |
38 // O(log n) | |
39 delayed_wakeup_queue_.erase(queue->heap_handle()); | |
40 } | 32 } |
41 | 33 |
42 void TimeDomain::MigrateQueue(internal::TaskQueueImpl* queue, | 34 base::TimeTicks TimeDomain::MigrateQueue(internal::TaskQueueImpl* queue, |
43 TimeDomain* destination_time_domain) { | 35 TimeDomain* destination_time_domain) { |
44 DCHECK(main_thread_checker_.CalledOnValidThread()); | 36 DCHECK(main_thread_checker_.CalledOnValidThread()); |
45 DCHECK_EQ(queue->GetTimeDomain(), this); | 37 DCHECK_EQ(queue->GetTimeDomain(), this); |
46 DCHECK(destination_time_domain); | 38 DCHECK(destination_time_domain); |
47 | 39 |
48 // Make sure we remember to update |queue| if it's got incoming immediate | |
49 // work. | |
50 if (UnregisterAsUpdatableTaskQueue(queue)) | |
51 destination_time_domain->updatable_queue_set_.insert(queue); | |
52 | |
53 // If no wakeup has been requested then bail out. | 40 // If no wakeup has been requested then bail out. |
54 if (!queue->heap_handle().IsValid()) | 41 if (!queue->heap_handle().IsValid()) |
55 return; | 42 return base::TimeTicks(); |
56 | 43 |
57 base::TimeTicks wake_up_time = queue->scheduled_time_domain_wakeup(); | 44 base::TimeTicks wake_up_time = queue->scheduled_time_domain_wakeup(); |
58 DCHECK_NE(wake_up_time, base::TimeTicks()); | 45 DCHECK_NE(wake_up_time, base::TimeTicks()); |
59 | 46 |
60 // O(log n) | 47 // O(log n) |
61 delayed_wakeup_queue_.erase(queue->heap_handle()); | 48 delayed_wakeup_queue_.erase(queue->heap_handle()); |
62 | 49 |
63 base::TimeTicks destination_now = destination_time_domain->Now(); | 50 return wake_up_time; |
64 destination_time_domain->ScheduleDelayedWork(queue, wake_up_time, | |
65 destination_now); | |
66 } | 51 } |
67 | 52 |
68 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, | 53 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, |
69 base::TimeTicks delayed_run_time, | 54 base::TimeTicks delayed_run_time, |
70 base::TimeTicks now) { | 55 base::TimeTicks now) { |
71 DCHECK(main_thread_checker_.CalledOnValidThread()); | 56 DCHECK(main_thread_checker_.CalledOnValidThread()); |
| 57 DCHECK_EQ(queue->GetTimeDomain(), this); |
72 // We only want to store a single wakeup per queue, so we need to remove any | 58 // We only want to store a single wakeup per queue, so we need to remove any |
73 // previously registered wake up for |queue|. | 59 // previously registered wake up for |queue|. |
74 if (queue->heap_handle().IsValid()) { | 60 if (queue->heap_handle().IsValid()) { |
75 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); | 61 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); |
76 | 62 |
77 // O(log n) | 63 // O(log n) |
78 delayed_wakeup_queue_.ChangeKey(queue->heap_handle(), | 64 delayed_wakeup_queue_.ChangeKey(queue->heap_handle(), |
79 {delayed_run_time, queue}); | 65 {delayed_run_time, queue}); |
80 } else { | 66 } else { |
81 // O(log n) | 67 // O(log n) |
82 delayed_wakeup_queue_.insert({delayed_run_time, queue}); | 68 delayed_wakeup_queue_.insert({delayed_run_time, queue}); |
83 } | 69 } |
84 | 70 |
85 queue->set_scheduled_time_domain_wakeup(delayed_run_time); | 71 queue->set_scheduled_time_domain_wakeup(delayed_run_time); |
86 | 72 |
87 // If |queue| is the first wakeup then request the wakeup. | 73 // If |queue| is the first wakeup then request the wakeup. |
88 if (delayed_wakeup_queue_.min().queue == queue) { | 74 if (delayed_wakeup_queue_.min().queue == queue) { |
89 base::TimeDelta delay = std::max(base::TimeDelta(), delayed_run_time - now); | 75 base::TimeDelta delay = std::max(base::TimeDelta(), delayed_run_time - now); |
90 RequestWakeup(now, delay); | 76 RequestWakeup(now, delay); |
91 } | 77 } |
92 | 78 |
93 if (observer_) | 79 if (observer_) |
94 observer_->OnTimeDomainHasDelayedWork(queue); | 80 observer_->OnTimeDomainHasDelayedWork(queue); |
95 } | 81 } |
96 | 82 |
97 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) { | 83 void TimeDomain::CancelDelayedWork(internal::TaskQueueImpl* queue) { |
98 { | 84 DCHECK(main_thread_checker_.CalledOnValidThread()); |
99 base::AutoLock lock(newly_updatable_lock_); | 85 DCHECK_EQ(queue->GetTimeDomain(), this); |
100 newly_updatable_.push_back(queue); | 86 |
101 } | 87 // If no wakeup has been requested then bail out. |
| 88 if (!queue->heap_handle().IsValid()) |
| 89 return; |
| 90 |
| 91 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); |
| 92 |
| 93 // O(log n) |
| 94 delayed_wakeup_queue_.erase(queue->heap_handle()); |
| 95 } |
| 96 |
| 97 void TimeDomain::OnQueueHasImmediateWork(internal::TaskQueueImpl* queue) { |
102 if (observer_) | 98 if (observer_) |
103 observer_->OnTimeDomainHasImmediateWork(queue); | 99 observer_->OnTimeDomainHasImmediateWork(queue); |
104 } | 100 } |
105 | 101 |
106 bool TimeDomain::UnregisterAsUpdatableTaskQueue( | |
107 internal::TaskQueueImpl* queue) { | |
108 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
109 | |
110 bool was_updatable = updatable_queue_set_.erase(queue) != 0; | |
111 | |
112 base::AutoLock lock(newly_updatable_lock_); | |
113 // Remove all copies of |queue| from |newly_updatable_|. | |
114 for (size_t i = 0; i < newly_updatable_.size();) { | |
115 if (newly_updatable_[i] == queue) { | |
116 // Move last element into slot #i and then compact. | |
117 newly_updatable_[i] = newly_updatable_.back(); | |
118 newly_updatable_.pop_back(); | |
119 was_updatable = true; | |
120 } else { | |
121 i++; | |
122 } | |
123 } | |
124 return was_updatable; | |
125 } | |
126 | |
127 void TimeDomain::UpdateWorkQueues(LazyNow lazy_now) { | |
128 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
129 | |
130 // Move any ready delayed tasks into the Incoming queues. | |
131 WakeupReadyDelayedQueues(&lazy_now); | |
132 | |
133 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); | |
134 | |
135 std::set<internal::TaskQueueImpl*>::iterator iter = | |
136 updatable_queue_set_.begin(); | |
137 while (iter != updatable_queue_set_.end()) { | |
138 std::set<internal::TaskQueueImpl*>::iterator queue_it = iter++; | |
139 internal::TaskQueueImpl* queue = *queue_it; | |
140 | |
141 // Update the queue and remove from the set if subsequent updates are not | |
142 // required. | |
143 if (!queue->MaybeUpdateImmediateWorkQueues()) | |
144 updatable_queue_set_.erase(queue_it); | |
145 } | |
146 } | |
147 | |
148 void TimeDomain::MoveNewlyUpdatableQueuesIntoUpdatableQueueSet() { | |
149 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
150 base::AutoLock lock(newly_updatable_lock_); | |
151 while (!newly_updatable_.empty()) { | |
152 updatable_queue_set_.insert(newly_updatable_.back()); | |
153 newly_updatable_.pop_back(); | |
154 } | |
155 } | |
156 | |
157 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) { | 102 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) { |
158 DCHECK(main_thread_checker_.CalledOnValidThread()); | 103 DCHECK(main_thread_checker_.CalledOnValidThread()); |
159 // Wake up any queues with pending delayed work. Note std::multipmap stores | 104 // Wake up any queues with pending delayed work. Note std::multipmap stores |
160 // the elements sorted by key, so the begin() iterator points to the earliest | 105 // the elements sorted by key, so the begin() iterator points to the earliest |
161 // queue to wakeup. | 106 // queue to wakeup. |
162 while (!delayed_wakeup_queue_.empty() && | 107 while (!delayed_wakeup_queue_.empty() && |
163 delayed_wakeup_queue_.min().time <= lazy_now->Now()) { | 108 delayed_wakeup_queue_.min().time <= lazy_now->Now()) { |
164 internal::TaskQueueImpl* queue = delayed_wakeup_queue_.min().queue; | 109 internal::TaskQueueImpl* queue = delayed_wakeup_queue_.min().queue; |
165 // O(log n) | 110 base::Optional<base::TimeTicks> next_wakeup = |
166 delayed_wakeup_queue_.pop(); | 111 queue->WakeUpForDelayedWork(lazy_now); |
167 | 112 |
168 queue->WakeUpForDelayedWork(lazy_now); | 113 if (next_wakeup) { |
| 114 // O(log n) |
| 115 delayed_wakeup_queue_.ReplaceMin({next_wakeup.value(), queue}); |
| 116 queue->set_scheduled_time_domain_wakeup(next_wakeup.value()); |
| 117 } else { |
| 118 // O(log n) |
| 119 delayed_wakeup_queue_.pop(); |
| 120 DCHECK_EQ(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); |
| 121 } |
169 } | 122 } |
170 } | 123 } |
171 | 124 |
172 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { | 125 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { |
173 DCHECK(main_thread_checker_.CalledOnValidThread()); | 126 DCHECK(main_thread_checker_.CalledOnValidThread()); |
174 if (delayed_wakeup_queue_.empty()) | 127 if (delayed_wakeup_queue_.empty()) |
175 return false; | 128 return false; |
176 | 129 |
177 *out_time = delayed_wakeup_queue_.min().time; | 130 *out_time = delayed_wakeup_queue_.min().time; |
178 return true; | 131 return true; |
179 } | 132 } |
180 | 133 |
181 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { | 134 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { |
182 DCHECK(main_thread_checker_.CalledOnValidThread()); | 135 DCHECK(main_thread_checker_.CalledOnValidThread()); |
183 if (delayed_wakeup_queue_.empty()) | 136 if (delayed_wakeup_queue_.empty()) |
184 return false; | 137 return false; |
185 | 138 |
186 *out_task_queue = delayed_wakeup_queue_.min().queue; | 139 *out_task_queue = delayed_wakeup_queue_.min().queue; |
187 return true; | 140 return true; |
188 } | 141 } |
189 | 142 |
190 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { | 143 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { |
191 state->BeginDictionary(); | 144 state->BeginDictionary(); |
192 state->SetString("name", GetName()); | 145 state->SetString("name", GetName()); |
193 state->BeginArray("updatable_queue_set"); | |
194 for (auto* queue : updatable_queue_set_) | |
195 state->AppendString(queue->GetName()); | |
196 state->EndArray(); | |
197 state->SetInteger("registered_delay_count", delayed_wakeup_queue_.size()); | 146 state->SetInteger("registered_delay_count", delayed_wakeup_queue_.size()); |
198 if (!delayed_wakeup_queue_.empty()) { | 147 if (!delayed_wakeup_queue_.empty()) { |
199 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now(); | 148 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now(); |
200 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); | 149 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); |
201 } | 150 } |
202 AsValueIntoInternal(state); | 151 AsValueIntoInternal(state); |
203 state->EndDictionary(); | 152 state->EndDictionary(); |
204 } | 153 } |
205 | 154 |
206 } // namespace scheduler | 155 } // namespace scheduler |
207 } // namespace blink | 156 } // namespace blink |
OLD | NEW |