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

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

Issue 2644553002: Refactor TimeDomain::MaybeAdvanceTime in preparation for DoWork deduping (Closed)
Patch Set: Add tests for ComputeDelayTillNextTask Created 3 years, 11 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 106 matching lines...) Expand 10 before | Expand all | Expand 10 after
117 newly_updatable_[i] = newly_updatable_.back(); 117 newly_updatable_[i] = newly_updatable_.back();
118 newly_updatable_.pop_back(); 118 newly_updatable_.pop_back();
119 was_updatable = true; 119 was_updatable = true;
120 } else { 120 } else {
121 i++; 121 i++;
122 } 122 }
123 } 123 }
124 return was_updatable; 124 return was_updatable;
125 } 125 }
126 126
127 void TimeDomain::UpdateWorkQueues(LazyNow lazy_now) { 127 void TimeDomain::UpdateWorkQueues(LazyNow* lazy_now) {
128 DCHECK(main_thread_checker_.CalledOnValidThread()); 128 DCHECK(main_thread_checker_.CalledOnValidThread());
129 129
130 // Move any ready delayed tasks into the Incoming queues. 130 // Move any ready delayed tasks into the Incoming queues.
131 WakeupReadyDelayedQueues(&lazy_now); 131 WakeupReadyDelayedQueues(lazy_now);
132 132
133 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); 133 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet();
134 134
135 std::set<internal::TaskQueueImpl*>::iterator iter = 135 std::set<internal::TaskQueueImpl*>::iterator iter =
136 updatable_queue_set_.begin(); 136 updatable_queue_set_.begin();
137 while (iter != updatable_queue_set_.end()) { 137 while (iter != updatable_queue_set_.end()) {
138 std::set<internal::TaskQueueImpl*>::iterator queue_it = iter++; 138 std::set<internal::TaskQueueImpl*>::iterator queue_it = iter++;
139 internal::TaskQueueImpl* queue = *queue_it; 139 internal::TaskQueueImpl* queue = *queue_it;
140 140
141 // Update the queue and remove from the set if subsequent updates are not 141 // Update the queue and remove from the set if subsequent updates are not
(...skipping 56 matching lines...) Expand 10 before | Expand all | Expand 10 after
198 if (!delayed_wakeup_queue_.empty()) { 198 if (!delayed_wakeup_queue_.empty()) {
199 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now(); 199 base::TimeDelta delay = delayed_wakeup_queue_.min().time - Now();
200 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); 200 state->SetDouble("next_delay_ms", delay.InMillisecondsF());
201 } 201 }
202 AsValueIntoInternal(state); 202 AsValueIntoInternal(state);
203 state->EndDictionary(); 203 state->EndDictionary();
204 } 204 }
205 205
206 } // namespace scheduler 206 } // namespace scheduler
207 } // namespace blink 207 } // namespace blink
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698