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

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

Issue 2718293003: scheduler: Ensure consistent delayed task ordering between task queues (Closed)
Patch Set: Review comments Created 3 years, 9 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 13 matching lines...) Expand all
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 30
31 CancelDelayedWork(queue); 31 CancelDelayedWork(queue);
32 } 32 }
33 33
34 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, 34 void TimeDomain::ScheduleDelayedWork(
35 base::TimeTicks delayed_run_time, 35 internal::TaskQueueImpl* queue,
36 base::TimeTicks now) { 36 internal::TaskQueueImpl::DelayedWakeUp wake_up,
37 base::TimeTicks now) {
37 DCHECK(main_thread_checker_.CalledOnValidThread()); 38 DCHECK(main_thread_checker_.CalledOnValidThread());
38 DCHECK_EQ(queue->GetTimeDomain(), this); 39 DCHECK_EQ(queue->GetTimeDomain(), this);
39 DCHECK(queue->IsQueueEnabled()); 40 DCHECK(queue->IsQueueEnabled());
40 // We only want to store a single wakeup per queue, so we need to remove any 41 // We only want to store a single wakeup per queue, so we need to remove any
41 // previously registered wake up for |queue|. 42 // previously registered wake up for |queue|.
42 if (queue->heap_handle().IsValid()) { 43 if (queue->heap_handle().IsValid()) {
43 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); 44 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks());
44 45
45 // O(log n) 46 // O(log n)
46 delayed_wakeup_queue_.ChangeKey(queue->heap_handle(), 47 delayed_wakeup_queue_.ChangeKey(queue->heap_handle(), {wake_up, queue});
47 {delayed_run_time, queue});
48 } else { 48 } else {
49 // O(log n) 49 // O(log n)
50 delayed_wakeup_queue_.insert({delayed_run_time, queue}); 50 delayed_wakeup_queue_.insert({wake_up, queue});
51 } 51 }
52 52
53 queue->set_scheduled_time_domain_wakeup(delayed_run_time); 53 queue->set_scheduled_time_domain_wakeup(wake_up.time);
54 54
55 // If |queue| is the first wakeup then request the wakeup. 55 // If |queue| is the first wakeup then request the wakeup.
56 if (delayed_wakeup_queue_.min().queue == queue) 56 if (delayed_wakeup_queue_.min().queue == queue)
57 RequestWakeupAt(now, delayed_run_time); 57 RequestWakeupAt(now, wake_up.time);
58 58
59 if (observer_) 59 if (observer_)
60 observer_->OnTimeDomainHasDelayedWork(queue); 60 observer_->OnTimeDomainHasDelayedWork(queue);
61 } 61 }
62 62
63 void TimeDomain::OnQueueHasImmediateWork(internal::TaskQueueImpl* queue) { 63 void TimeDomain::OnQueueHasImmediateWork(internal::TaskQueueImpl* queue) {
64 if (observer_) 64 if (observer_)
65 observer_->OnTimeDomainHasImmediateWork(queue); 65 observer_->OnTimeDomainHasImmediateWork(queue);
66 } 66 }
67 67
68 void TimeDomain::CancelDelayedWork(internal::TaskQueueImpl* queue) { 68 void TimeDomain::CancelDelayedWork(internal::TaskQueueImpl* queue) {
69 DCHECK(main_thread_checker_.CalledOnValidThread()); 69 DCHECK(main_thread_checker_.CalledOnValidThread());
70 DCHECK_EQ(queue->GetTimeDomain(), this); 70 DCHECK_EQ(queue->GetTimeDomain(), this);
71 71
72 // If no wakeup has been requested then bail out. 72 // If no wakeup has been requested then bail out.
73 if (!queue->heap_handle().IsValid()) 73 if (!queue->heap_handle().IsValid())
74 return; 74 return;
75 75
76 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); 76 DCHECK_NE(queue->scheduled_time_domain_wakeup(), base::TimeTicks());
77 DCHECK(!delayed_wakeup_queue_.empty()); 77 DCHECK(!delayed_wakeup_queue_.empty());
78 base::TimeTicks prev_first_wakeup = delayed_wakeup_queue_.min().time; 78 base::TimeTicks prev_first_wakeup = delayed_wakeup_queue_.min().wake_up.time;
79 79
80 // O(log n) 80 // O(log n)
81 delayed_wakeup_queue_.erase(queue->heap_handle()); 81 delayed_wakeup_queue_.erase(queue->heap_handle());
82 82
83 if (delayed_wakeup_queue_.empty()) { 83 if (delayed_wakeup_queue_.empty()) {
84 CancelWakeupAt(prev_first_wakeup); 84 CancelWakeupAt(prev_first_wakeup);
85 } else if (prev_first_wakeup != delayed_wakeup_queue_.min().time) { 85 } else if (prev_first_wakeup != delayed_wakeup_queue_.min().wake_up.time) {
86 CancelWakeupAt(prev_first_wakeup); 86 CancelWakeupAt(prev_first_wakeup);
87 RequestWakeupAt(Now(), delayed_wakeup_queue_.min().time); 87 RequestWakeupAt(Now(), delayed_wakeup_queue_.min().wake_up.time);
88 } 88 }
89 } 89 }
90 90
91 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) { 91 void TimeDomain::WakeupReadyDelayedQueues(LazyNow* lazy_now) {
92 DCHECK(main_thread_checker_.CalledOnValidThread()); 92 DCHECK(main_thread_checker_.CalledOnValidThread());
93 // Wake up any queues with pending delayed work. Note std::multipmap stores 93 // Wake up any queues with pending delayed work. Note std::multimap stores
94 // the elements sorted by key, so the begin() iterator points to the earliest 94 // the elements sorted by key, so the begin() iterator points to the earliest
95 // queue to wakeup. 95 // queue to wakeup.
96 while (!delayed_wakeup_queue_.empty() && 96 while (!delayed_wakeup_queue_.empty() &&
97 delayed_wakeup_queue_.min().time <= lazy_now->Now()) { 97 delayed_wakeup_queue_.min().wake_up.time <= lazy_now->Now()) {
98 internal::TaskQueueImpl* queue = delayed_wakeup_queue_.min().queue; 98 internal::TaskQueueImpl* queue = delayed_wakeup_queue_.min().queue;
99 base::Optional<base::TimeTicks> next_wakeup = 99 base::Optional<internal::TaskQueueImpl::DelayedWakeUp> next_wake_up =
100 queue->WakeUpForDelayedWork(lazy_now); 100 queue->WakeUpForDelayedWork(lazy_now);
101 101
102 if (next_wakeup) { 102 if (next_wake_up) {
103 // O(log n) 103 // O(log n)
104 delayed_wakeup_queue_.ReplaceMin({next_wakeup.value(), queue}); 104 delayed_wakeup_queue_.ReplaceMin({*next_wake_up, queue});
105 queue->set_scheduled_time_domain_wakeup(next_wakeup.value()); 105 queue->set_scheduled_time_domain_wakeup(next_wake_up->time);
106 } else { 106 } else {
107 // O(log n) 107 // O(log n)
108 delayed_wakeup_queue_.pop(); 108 delayed_wakeup_queue_.pop();
109 DCHECK_EQ(queue->scheduled_time_domain_wakeup(), base::TimeTicks()); 109 DCHECK_EQ(queue->scheduled_time_domain_wakeup(), base::TimeTicks());
110 } 110 }
111 } 111 }
112 } 112 }
113 113
114 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { 114 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const {
115 DCHECK(main_thread_checker_.CalledOnValidThread()); 115 DCHECK(main_thread_checker_.CalledOnValidThread());
116 if (delayed_wakeup_queue_.empty()) 116 if (delayed_wakeup_queue_.empty())
117 return false; 117 return false;
118 118
119 *out_time = delayed_wakeup_queue_.min().time; 119 *out_time = delayed_wakeup_queue_.min().wake_up.time;
120 return true; 120 return true;
121 } 121 }
122 122
123 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { 123 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const {
124 DCHECK(main_thread_checker_.CalledOnValidThread()); 124 DCHECK(main_thread_checker_.CalledOnValidThread());
125 if (delayed_wakeup_queue_.empty()) 125 if (delayed_wakeup_queue_.empty())
126 return false; 126 return false;
127 127
128 *out_task_queue = delayed_wakeup_queue_.min().queue; 128 *out_task_queue = delayed_wakeup_queue_.min().queue;
129 return true; 129 return true;
130 } 130 }
131 131
132 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { 132 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const {
133 state->BeginDictionary(); 133 state->BeginDictionary();
134 state->SetString("name", GetName()); 134 state->SetString("name", GetName());
135 state->SetInteger("registered_delay_count", delayed_wakeup_queue_.size()); 135 state->SetInteger("registered_delay_count", delayed_wakeup_queue_.size());
136 if (!delayed_wakeup_queue_.empty()) { 136 if (!delayed_wakeup_queue_.empty()) {
137 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now(); 137 base::TimeDelta delay = delayed_wakeup_queue_.min().wake_up.time - Now();
138 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); 138 state->SetDouble("next_delay_ms", delay.InMillisecondsF());
139 } 139 }
140 AsValueIntoInternal(state); 140 AsValueIntoInternal(state);
141 state->EndDictionary(); 141 state->EndDictionary();
142 } 142 }
143 143
144 } // namespace scheduler 144 } // namespace scheduler
145 } // namespace blink 145 } // namespace blink
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698