| OLD | NEW |
| (Empty) |
| 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 | |
| 3 // found in the LICENSE file. | |
| 4 | |
| 5 #include "components/scheduler/base/time_domain.h" | |
| 6 | |
| 7 #include <set> | |
| 8 | |
| 9 #include "components/scheduler/base/task_queue_impl.h" | |
| 10 #include "components/scheduler/base/task_queue_manager_delegate.h" | |
| 11 #include "components/scheduler/base/work_queue.h" | |
| 12 #include "components/scheduler/scheduler_export.h" | |
| 13 | |
| 14 namespace scheduler { | |
| 15 | |
| 16 TimeDomain::TimeDomain(Observer* observer) : observer_(observer) {} | |
| 17 | |
| 18 TimeDomain::~TimeDomain() { | |
| 19 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 20 } | |
| 21 | |
| 22 void TimeDomain::RegisterQueue(internal::TaskQueueImpl* queue) { | |
| 23 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 24 DCHECK_EQ(queue->GetTimeDomain(), this); | |
| 25 } | |
| 26 | |
| 27 void TimeDomain::UnregisterQueue(internal::TaskQueueImpl* queue) { | |
| 28 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 29 DCHECK_EQ(queue->GetTimeDomain(), this); | |
| 30 UnregisterAsUpdatableTaskQueue(queue); | |
| 31 | |
| 32 // We need to remove |task_queue| from delayed_wakeup_multimap_ which is a | |
| 33 // little awkward since it's keyed by time. O(n) running time. | |
| 34 for (DelayedWakeupMultimap::iterator iter = delayed_wakeup_multimap_.begin(); | |
| 35 iter != delayed_wakeup_multimap_.end();) { | |
| 36 if (iter->second == queue) { | |
| 37 // O(1) amortized. | |
| 38 iter = delayed_wakeup_multimap_.erase(iter); | |
| 39 } else { | |
| 40 iter++; | |
| 41 } | |
| 42 } | |
| 43 } | |
| 44 | |
| 45 void TimeDomain::MigrateQueue(internal::TaskQueueImpl* queue, | |
| 46 TimeDomain* destination_time_domain) { | |
| 47 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 48 DCHECK_EQ(queue->GetTimeDomain(), this); | |
| 49 DCHECK(destination_time_domain); | |
| 50 UnregisterAsUpdatableTaskQueue(queue); | |
| 51 | |
| 52 base::TimeTicks destination_now = destination_time_domain->Now(); | |
| 53 // We need to remove |task_queue| from delayed_wakeup_multimap_ which is a | |
| 54 // little awkward since it's keyed by time. O(n) running time. | |
| 55 for (DelayedWakeupMultimap::iterator iter = delayed_wakeup_multimap_.begin(); | |
| 56 iter != delayed_wakeup_multimap_.end();) { | |
| 57 if (iter->second == queue) { | |
| 58 destination_time_domain->ScheduleDelayedWork(queue, iter->first, | |
| 59 destination_now); | |
| 60 // O(1) amortized. | |
| 61 iter = delayed_wakeup_multimap_.erase(iter); | |
| 62 } else { | |
| 63 iter++; | |
| 64 } | |
| 65 } | |
| 66 } | |
| 67 | |
| 68 void TimeDomain::ScheduleDelayedWork(internal::TaskQueueImpl* queue, | |
| 69 base::TimeTicks delayed_run_time, | |
| 70 base::TimeTicks now) { | |
| 71 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 72 if (delayed_wakeup_multimap_.empty() || | |
| 73 delayed_run_time < delayed_wakeup_multimap_.begin()->first) { | |
| 74 base::TimeDelta delay = std::max(base::TimeDelta(), delayed_run_time - now); | |
| 75 RequestWakeup(now, delay); | |
| 76 } | |
| 77 | |
| 78 delayed_wakeup_multimap_.insert(std::make_pair(delayed_run_time, queue)); | |
| 79 if (observer_) | |
| 80 observer_->OnTimeDomainHasDelayedWork(); | |
| 81 } | |
| 82 | |
| 83 void TimeDomain::RegisterAsUpdatableTaskQueue(internal::TaskQueueImpl* queue) { | |
| 84 { | |
| 85 base::AutoLock lock(newly_updatable_lock_); | |
| 86 newly_updatable_.push_back(queue); | |
| 87 } | |
| 88 if (observer_) | |
| 89 observer_->OnTimeDomainHasImmediateWork(); | |
| 90 } | |
| 91 | |
| 92 void TimeDomain::UnregisterAsUpdatableTaskQueue( | |
| 93 internal::TaskQueueImpl* queue) { | |
| 94 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 95 | |
| 96 updatable_queue_set_.erase(queue); | |
| 97 | |
| 98 base::AutoLock lock(newly_updatable_lock_); | |
| 99 // Remove all copies of |queue| from |newly_updatable_|. | |
| 100 for (size_t i = 0; i < newly_updatable_.size();) { | |
| 101 if (newly_updatable_[i] == queue) { | |
| 102 // Move last element into slot #i and then compact. | |
| 103 newly_updatable_[i] = newly_updatable_.back(); | |
| 104 newly_updatable_.pop_back(); | |
| 105 } else { | |
| 106 i++; | |
| 107 } | |
| 108 } | |
| 109 } | |
| 110 | |
| 111 void TimeDomain::UpdateWorkQueues( | |
| 112 bool should_trigger_wakeup, | |
| 113 const internal::TaskQueueImpl::Task* previous_task, | |
| 114 LazyNow lazy_now) { | |
| 115 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 116 | |
| 117 // Move any ready delayed tasks into the Incoming queues. | |
| 118 WakeupReadyDelayedQueues(&lazy_now, should_trigger_wakeup, previous_task); | |
| 119 | |
| 120 MoveNewlyUpdatableQueuesIntoUpdatableQueueSet(); | |
| 121 | |
| 122 auto iter = updatable_queue_set_.begin(); | |
| 123 while (iter != updatable_queue_set_.end()) { | |
| 124 internal::TaskQueueImpl* queue = *iter++; | |
| 125 // NOTE Update work queue may erase itself from |updatable_queue_set_|. | |
| 126 // This is fine, erasing an element won't invalidate any interator, as long | |
| 127 // as the iterator isn't the element being delated. | |
| 128 if (queue->immediate_work_queue()->Empty()) | |
| 129 queue->UpdateImmediateWorkQueue(should_trigger_wakeup, previous_task); | |
| 130 } | |
| 131 } | |
| 132 | |
| 133 void TimeDomain::MoveNewlyUpdatableQueuesIntoUpdatableQueueSet() { | |
| 134 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 135 base::AutoLock lock(newly_updatable_lock_); | |
| 136 while (!newly_updatable_.empty()) { | |
| 137 updatable_queue_set_.insert(newly_updatable_.back()); | |
| 138 newly_updatable_.pop_back(); | |
| 139 } | |
| 140 } | |
| 141 | |
| 142 void TimeDomain::WakeupReadyDelayedQueues( | |
| 143 LazyNow* lazy_now, | |
| 144 bool should_trigger_wakeup, | |
| 145 const internal::TaskQueueImpl::Task* previous_task) { | |
| 146 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 147 // Wake up any queues with pending delayed work. Note std::multipmap stores | |
| 148 // the elements sorted by key, so the begin() iterator points to the earliest | |
| 149 // queue to wakeup. | |
| 150 std::set<internal::TaskQueueImpl*> dedup_set; | |
| 151 while (!delayed_wakeup_multimap_.empty()) { | |
| 152 DelayedWakeupMultimap::iterator next_wakeup = | |
| 153 delayed_wakeup_multimap_.begin(); | |
| 154 if (next_wakeup->first > lazy_now->Now()) | |
| 155 break; | |
| 156 // A queue could have any number of delayed tasks pending so it's worthwhile | |
| 157 // deduping calls to UpdateDelayedWorkQueue since it takes a lock. | |
| 158 // NOTE the order in which these are called matters since the order | |
| 159 // in which EnqueueTaskLocks is called is respected when choosing which | |
| 160 // queue to execute a task from. | |
| 161 if (dedup_set.insert(next_wakeup->second).second) { | |
| 162 next_wakeup->second->UpdateDelayedWorkQueue( | |
| 163 lazy_now, should_trigger_wakeup, previous_task); | |
| 164 } | |
| 165 delayed_wakeup_multimap_.erase(next_wakeup); | |
| 166 } | |
| 167 } | |
| 168 | |
| 169 void TimeDomain::ClearExpiredWakeups() { | |
| 170 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 171 LazyNow lazy_now(CreateLazyNow()); | |
| 172 while (!delayed_wakeup_multimap_.empty()) { | |
| 173 DelayedWakeupMultimap::iterator next_wakeup = | |
| 174 delayed_wakeup_multimap_.begin(); | |
| 175 if (next_wakeup->first > lazy_now.Now()) | |
| 176 break; | |
| 177 delayed_wakeup_multimap_.erase(next_wakeup); | |
| 178 } | |
| 179 } | |
| 180 | |
| 181 bool TimeDomain::NextScheduledRunTime(base::TimeTicks* out_time) const { | |
| 182 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 183 if (delayed_wakeup_multimap_.empty()) | |
| 184 return false; | |
| 185 | |
| 186 *out_time = delayed_wakeup_multimap_.begin()->first; | |
| 187 return true; | |
| 188 } | |
| 189 | |
| 190 bool TimeDomain::NextScheduledTaskQueue(TaskQueue** out_task_queue) const { | |
| 191 DCHECK(main_thread_checker_.CalledOnValidThread()); | |
| 192 if (delayed_wakeup_multimap_.empty()) | |
| 193 return false; | |
| 194 | |
| 195 *out_task_queue = delayed_wakeup_multimap_.begin()->second; | |
| 196 return true; | |
| 197 } | |
| 198 | |
| 199 void TimeDomain::AsValueInto(base::trace_event::TracedValue* state) const { | |
| 200 state->BeginDictionary(); | |
| 201 state->SetString("name", GetName()); | |
| 202 state->BeginArray("updatable_queue_set"); | |
| 203 for (auto& queue : updatable_queue_set_) | |
| 204 state->AppendString(queue->GetName()); | |
| 205 state->EndArray(); | |
| 206 state->SetInteger("registered_delay_count", delayed_wakeup_multimap_.size()); | |
| 207 if (!delayed_wakeup_multimap_.empty()) { | |
| 208 base::TimeDelta delay = delayed_wakeup_multimap_.begin()->first - Now(); | |
| 209 state->SetDouble("next_delay_ms", delay.InMillisecondsF()); | |
| 210 } | |
| 211 AsValueIntoInternal(state); | |
| 212 state->EndDictionary(); | |
| 213 } | |
| 214 | |
| 215 } // namespace scheduler | |
| OLD | NEW |