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

Side by Side Diff: third_party/WebKit/Source/platform/scheduler/base/time_domain.cc

Issue 2419793002: [Reland] Optimize blink scheduler with an intrusive heap (Closed)
Patch Set: Tiny optimization of MoveHoleDownAndFillWithLeafElement Created 4 years, 2 months 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 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"
(...skipping 11 matching lines...) Expand all
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); 30 UnregisterAsUpdatableTaskQueue(queue);
31 31
32 // If present remove |task_queue| from delayed_wakeup_multimap_. 32 // If no wakeup has been requested then bail out.
33 // O(log n) 33 if (queue->scheduled_time_domain_wakeup().is_null())
34 QueueToDelayedWakeupMultimapIteratorMap::iterator it =
35 queue_to_delayed_wakeup_multimap_iterator_map_.find(queue);
36
37 if (it == queue_to_delayed_wakeup_multimap_iterator_map_.end())
38 return; 34 return;
39 35
40 // O(1) amortized. 36 // O(log n)
41 delayed_wakeup_multimap_.erase(it->second); 37 delayed_wakeup_queue_.EraseHeapIndex(queue->heap_index());
42 queue_to_delayed_wakeup_multimap_iterator_map_.erase(it); 38 queue->set_scheduled_time_domain_wakeup(base::TimeTicks());
43 } 39 }
44 40
45 void TimeDomain::MigrateQueue(internal::TaskQueueImpl* queue, 41 void TimeDomain::MigrateQueue(internal::TaskQueueImpl* queue,
46 TimeDomain* destination_time_domain) { 42 TimeDomain* destination_time_domain) {
47 DCHECK(main_thread_checker_.CalledOnValidThread()); 43 DCHECK(main_thread_checker_.CalledOnValidThread());
48 DCHECK_EQ(queue->GetTimeDomain(), this); 44 DCHECK_EQ(queue->GetTimeDomain(), this);
49 DCHECK(destination_time_domain); 45 DCHECK(destination_time_domain);
50 46
51 // Make sure we remember to update |queue| if it's got incoming immediate 47 // Make sure we remember to update |queue| if it's got incoming immediate
52 // work. 48 // work.
53 if (UnregisterAsUpdatableTaskQueue(queue)) 49 if (UnregisterAsUpdatableTaskQueue(queue))
54 destination_time_domain->updatable_queue_set_.insert(queue); 50 destination_time_domain->updatable_queue_set_.insert(queue);
55 51
56 // If present remove |task_queue| from delayed_wakeup_multimap_. 52 // If no wakeup has been requested then bail out.
57 // O(log n) 53 if (queue->scheduled_time_domain_wakeup().is_null())
58 QueueToDelayedWakeupMultimapIteratorMap::iterator it =
59 queue_to_delayed_wakeup_multimap_iterator_map_.find(queue);
60
61 if (it == queue_to_delayed_wakeup_multimap_iterator_map_.end())
62 return; 54 return;
63 55
56 // O(log n)
57 delayed_wakeup_queue_.EraseHeapIndex(queue->heap_index());
58 queue->set_scheduled_time_domain_wakeup(base::TimeTicks());
altimin 2016/10/14 17:06:36 (I feel like I'm becoming the evangelist of base::
alex clarke (OOO till 29th) 2016/10/14 21:49:46 I don't dislike the idea of Optional (I used it qu
59
64 base::TimeTicks destination_now = destination_time_domain->Now(); 60 base::TimeTicks destination_now = destination_time_domain->Now();
65 destination_time_domain->ScheduleDelayedWork(queue, it->second->first, 61 destination_time_domain->ScheduleDelayedWork(
66 destination_now); 62 queue, queue->scheduled_time_domain_wakeup(), destination_now);
67
68 // O(1) amortized.
69 delayed_wakeup_multimap_.erase(it->second);
70 queue_to_delayed_wakeup_multimap_iterator_map_.erase(it);
71 } 63 }
72 64
73 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, 65 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue,
74 base::TimeTicks delayed_run_time, 66 base::TimeTicks delayed_run_time,
75 base::TimeTicks now) { 67 base::TimeTicks now) {
76 DCHECK(main_thread_checker_.CalledOnValidThread()); 68 DCHECK(main_thread_checker_.CalledOnValidThread());
77 // We only want to store a single wakeup per queue, so we need to remove any 69 // We only want to store a single wakeup per queue, so we need to remove any
78 // previously registered wake up for |queue|. 70 // previously registered wake up for |queue|.
79 QueueToDelayedWakeupMultimapIteratorMap::iterator it = 71 if (!queue->scheduled_time_domain_wakeup().is_null()) {
80 queue_to_delayed_wakeup_multimap_iterator_map_.find(queue); 72 delayed_wakeup_queue_.EraseHeapIndex(queue->heap_index());
73 queue->set_scheduled_time_domain_wakeup(base::TimeTicks());
74 }
81 75
82 if (it != queue_to_delayed_wakeup_multimap_iterator_map_.end()) 76 if (delayed_wakeup_queue_.empty() ||
83 delayed_wakeup_multimap_.erase(it->second); 77 delayed_run_time < delayed_wakeup_queue_.min().time) {
84
85 if (delayed_wakeup_multimap_.empty() ||
86 delayed_run_time < delayed_wakeup_multimap_.begin()->first) {
87 base::TimeDelta delay = std::max(base::TimeDelta(), delayed_run_time - now); 78 base::TimeDelta delay = std::max(base::TimeDelta(), delayed_run_time - now);
88 RequestWakeup(now, delay); 79 RequestWakeup(now, delay);
89 } 80 }
90 81
91 if (it != queue_to_delayed_wakeup_multimap_iterator_map_.end()) { 82 delayed_wakeup_queue_.insert({delayed_run_time, queue});
92 // TODO(alexclarke): Use C++17 extract & insert to more efficiently modify 83 queue->set_scheduled_time_domain_wakeup(delayed_run_time);
93 // |queue_to_delayed_wakeup_multimap_iterator_map_|.
94 it->second = delayed_wakeup_multimap_.insert({delayed_run_time, queue});
95 } else {
96 // Insert the wakeup and store the map iterator for later convenience.
97 queue_to_delayed_wakeup_multimap_iterator_map_.insert(
98 {queue, delayed_wakeup_multimap_.insert({delayed_run_time, queue})});
99 }
100 84
101 if (observer_) 85 if (observer_)
102 observer_->OnTimeDomainHasDelayedWork(queue); 86 observer_->OnTimeDomainHasDelayedWork(queue);
103 } 87 }
104 88
105 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) { 89 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) {
106 { 90 {
107 base::AutoLock lock(newly_updatable_lock_); 91 base::AutoLock lock(newly_updatable_lock_);
108 newly_updatable_.push_back(queue); 92 newly_updatable_.push_back(queue);
109 } 93 }
(...skipping 50 matching lines...) Expand 10 before | Expand all | Expand 10 after
160 updatable_queue_set_.insert(newly_updatable_.back()); 144 updatable_queue_set_.insert(newly_updatable_.back());
161 newly_updatable_.pop_back(); 145 newly_updatable_.pop_back();
162 } 146 }
163 } 147 }
164 148
165 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) { 149 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) {
166 DCHECK(main_thread_checker_.CalledOnValidThread()); 150 DCHECK(main_thread_checker_.CalledOnValidThread());
167 // Wake up any queues with pending delayed work. Note std::multipmap stores 151 // Wake up any queues with pending delayed work. Note std::multipmap stores
168 // the elements sorted by key, so the begin() iterator points to the earliest 152 // the elements sorted by key, so the begin() iterator points to the earliest
169 // queue to wakeup. 153 // queue to wakeup.
170 while (!delayed_wakeup_multimap_.empty()) { 154 while (!delayed_wakeup_queue_.empty() &&
171 DelayedWakeupMultimap::iterator next_wakeup = 155 delayed_wakeup_queue_.min().time <= lazy_now->Now()) {
172 delayed_wakeup_multimap_.begin(); 156 internal::TaskQueueImpl* queue = delayed_wakeup_queue_.min().queue;
173 if (next_wakeup->first > lazy_now->Now()) 157 // O(log n)
174 break; 158 delayed_wakeup_queue_.pop();
175 159
176 internal::TaskQueueImpl* queue = next_wakeup->second; 160 queue->set_scheduled_time_domain_wakeup(base::TimeTicks());
177
178 // O(1) amortized.
179 delayed_wakeup_multimap_.erase(next_wakeup);
180 // O(log n).
181 queue_to_delayed_wakeup_multimap_iterator_map_.erase(queue);
182
183 queue->WakeUpForDelayedWork(lazy_now); 161 queue->WakeUpForDelayedWork(lazy_now);
184 } 162 }
185 } 163 }
186 164
187 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { 165 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const {
188 DCHECK(main_thread_checker_.CalledOnValidThread()); 166 DCHECK(main_thread_checker_.CalledOnValidThread());
189 if (delayed_wakeup_multimap_.empty()) 167 if (delayed_wakeup_queue_.empty())
190 return false; 168 return false;
191 169
192 *out_time = delayed_wakeup_multimap_.begin()->first; 170 *out_time = delayed_wakeup_queue_.min().time;
193 return true; 171 return true;
194 } 172 }
195 173
196 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { 174 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const {
197 DCHECK(main_thread_checker_.CalledOnValidThread()); 175 DCHECK(main_thread_checker_.CalledOnValidThread());
198 if (delayed_wakeup_multimap_.empty()) 176 if (delayed_wakeup_queue_.empty())
199 return false; 177 return false;
200 178
201 *out_task_queue = delayed_wakeup_multimap_.begin()->second; 179 *out_task_queue = delayed_wakeup_queue_.min().queue;
202 return true; 180 return true;
203 } 181 }
204 182
205 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { 183 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const {
206 state->BeginDictionary(); 184 state->BeginDictionary();
207 state->SetString("name", GetName()); 185 state->SetString("name", GetName());
208 state->BeginArray("updatable_queue_set"); 186 state->BeginArray("updatable_queue_set");
209 for (auto* queue : updatable_queue_set_) 187 for (auto* queue : updatable_queue_set_)
210 state->AppendString(queue->GetName()); 188 state->AppendString(queue->GetName());
211 state->EndArray(); 189 state->EndArray();
212 state->SetInteger("registered_delay_count", delayed_wakeup_multimap_.size()); 190 state->SetInteger("registered_delay_count", delayed_wakeup_queue_.size());
213 if (!delayed_wakeup_multimap_.empty()) { 191 if (!delayed_wakeup_queue_.empty()) {
214 base::TimeDelta delay = delayed_wakeup_multimap_.begin()->first - Now(); 192 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now();
215 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); 193 state->SetDouble("next_delay_ms", delay.InMillisecondsF());
216 } 194 }
217 AsValueIntoInternal(state); 195 AsValueIntoInternal(state);
218 state->EndDictionary(); 196 state->EndDictionary();
219 } 197 }
220 198
221 } // namespace scheduler 199 } // namespace scheduler
222 } // namespace blink 200 } // namespace blink
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698