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 "components/scheduler/child/task_queue_sets.h" | 5 #include "components/scheduler/child/task_queue_sets.h" |
6 | 6 |
7 #include "base/logging.h" | 7 #include "base/logging.h" |
8 #include "components/scheduler/child/task_queue_impl.h" | 8 #include "components/scheduler/child/task_queue_impl.h" |
9 | 9 |
10 namespace scheduler { | 10 namespace scheduler { |
11 namespace internal { | 11 namespace internal { |
12 | 12 |
13 TaskQueueSets::TaskQueueSets(size_t num_sets) : age_to_queue_maps_(num_sets) {} | 13 TaskQueueSets::TaskQueueSets(size_t num_sets) |
| 14 : enqueue_order_to_queue_maps_(num_sets) {} |
14 | 15 |
15 TaskQueueSets::~TaskQueueSets() {} | 16 TaskQueueSets::~TaskQueueSets() {} |
16 | 17 |
17 void TaskQueueSets::RemoveQueue(internal::TaskQueueImpl* queue) { | 18 void TaskQueueSets::RemoveQueue(internal::TaskQueueImpl* queue) { |
18 int age; | 19 int enqueue_order; |
19 bool has_age = queue->GetWorkQueueFrontTaskAge(&age); | 20 bool has_enqueue_order = |
20 if (!has_age) | 21 queue->GetWorkQueueFrontTaskEnqueueOrder(&enqueue_order); |
| 22 if (!has_enqueue_order) |
21 return; | 23 return; |
22 size_t set_index = queue->get_task_queue_set_index(); | 24 size_t set_index = queue->get_task_queue_set_index(); |
23 DCHECK_LT(set_index, age_to_queue_maps_.size()); | 25 DCHECK_LT(set_index, enqueue_order_to_queue_maps_.size()); |
24 age_to_queue_maps_[set_index].erase(age); | 26 enqueue_order_to_queue_maps_[set_index].erase(enqueue_order); |
25 } | 27 } |
26 | 28 |
27 void TaskQueueSets::AssignQueueToSet(internal::TaskQueueImpl* queue, | 29 void TaskQueueSets::AssignQueueToSet(internal::TaskQueueImpl* queue, |
28 size_t set_index) { | 30 size_t set_index) { |
29 DCHECK_LT(set_index, age_to_queue_maps_.size()); | 31 DCHECK_LT(set_index, enqueue_order_to_queue_maps_.size()); |
30 int age; | 32 int enqueue_order; |
31 bool has_age = queue->GetWorkQueueFrontTaskAge(&age); | 33 bool has_enqueue_order = |
| 34 queue->GetWorkQueueFrontTaskEnqueueOrder(&enqueue_order); |
32 size_t old_set = queue->get_task_queue_set_index(); | 35 size_t old_set = queue->get_task_queue_set_index(); |
33 DCHECK_LT(old_set, age_to_queue_maps_.size()); | 36 DCHECK_LT(old_set, enqueue_order_to_queue_maps_.size()); |
34 queue->set_task_queue_set_index(set_index); | 37 queue->set_task_queue_set_index(set_index); |
35 if (!has_age) | 38 if (!has_enqueue_order) |
36 return; | 39 return; |
37 age_to_queue_maps_[old_set].erase(age); | 40 enqueue_order_to_queue_maps_[old_set].erase(enqueue_order); |
38 age_to_queue_maps_[set_index].insert(std::make_pair(age, queue)); | 41 enqueue_order_to_queue_maps_[set_index].insert( |
| 42 std::make_pair(enqueue_order, queue)); |
39 } | 43 } |
40 | 44 |
41 void TaskQueueSets::OnPushQueue(internal::TaskQueueImpl* queue) { | 45 void TaskQueueSets::OnPushQueue(internal::TaskQueueImpl* queue) { |
42 int age; | 46 int enqueue_order; |
43 bool has_age = queue->GetWorkQueueFrontTaskAge(&age); | 47 bool has_enqueue_order = |
44 DCHECK(has_age); | 48 queue->GetWorkQueueFrontTaskEnqueueOrder(&enqueue_order); |
| 49 DCHECK(has_enqueue_order); |
45 size_t set_index = queue->get_task_queue_set_index(); | 50 size_t set_index = queue->get_task_queue_set_index(); |
46 DCHECK_LT(set_index, age_to_queue_maps_.size()) << " set_index = " | 51 DCHECK_LT(set_index, enqueue_order_to_queue_maps_.size()) << " set_index = " |
47 << set_index; | 52 << set_index; |
48 age_to_queue_maps_[set_index].insert(std::make_pair(age, queue)); | 53 enqueue_order_to_queue_maps_[set_index].insert( |
| 54 std::make_pair(enqueue_order, queue)); |
49 } | 55 } |
50 | 56 |
51 void TaskQueueSets::OnPopQueue(internal::TaskQueueImpl* queue) { | 57 void TaskQueueSets::OnPopQueue(internal::TaskQueueImpl* queue) { |
52 size_t set_index = queue->get_task_queue_set_index(); | 58 size_t set_index = queue->get_task_queue_set_index(); |
53 DCHECK_LT(set_index, age_to_queue_maps_.size()); | 59 DCHECK_LT(set_index, enqueue_order_to_queue_maps_.size()); |
54 DCHECK(!age_to_queue_maps_[set_index].empty()) << " set_index = " | 60 DCHECK(!enqueue_order_to_queue_maps_[set_index].empty()) << " set_index = " |
55 << set_index; | 61 << set_index; |
56 DCHECK_EQ(age_to_queue_maps_[set_index].begin()->second, queue) | 62 DCHECK_EQ(enqueue_order_to_queue_maps_[set_index].begin()->second, queue) |
57 << " set_index = " << set_index; | 63 << " set_index = " << set_index; |
58 // O(1) amortised. | 64 // O(1) amortised. |
59 age_to_queue_maps_[set_index].erase(age_to_queue_maps_[set_index].begin()); | 65 enqueue_order_to_queue_maps_[set_index].erase( |
60 int age; | 66 enqueue_order_to_queue_maps_[set_index].begin()); |
61 bool has_age = queue->GetWorkQueueFrontTaskAge(&age); | 67 int enqueue_order; |
62 if (!has_age) | 68 bool has_enqueue_order = |
| 69 queue->GetWorkQueueFrontTaskEnqueueOrder(&enqueue_order); |
| 70 if (!has_enqueue_order) |
63 return; | 71 return; |
64 age_to_queue_maps_[set_index].insert(std::make_pair(age, queue)); | 72 enqueue_order_to_queue_maps_[set_index].insert( |
| 73 std::make_pair(enqueue_order, queue)); |
65 } | 74 } |
66 | 75 |
67 bool TaskQueueSets::GetOldestQueueInSet( | 76 bool TaskQueueSets::GetOldestQueueInSet( |
68 size_t set_index, | 77 size_t set_index, |
69 internal::TaskQueueImpl** out_queue) const { | 78 internal::TaskQueueImpl** out_queue) const { |
70 DCHECK_LT(set_index, age_to_queue_maps_.size()); | 79 DCHECK_LT(set_index, enqueue_order_to_queue_maps_.size()); |
71 if (age_to_queue_maps_[set_index].empty()) | 80 if (enqueue_order_to_queue_maps_[set_index].empty()) |
72 return false; | 81 return false; |
73 *out_queue = age_to_queue_maps_[set_index].begin()->second; | 82 *out_queue = enqueue_order_to_queue_maps_[set_index].begin()->second; |
74 return true; | 83 return true; |
75 } | 84 } |
76 | 85 |
77 } // namespace internal | 86 } // namespace internal |
78 } // namespace scheduler | 87 } // namespace scheduler |
OLD | NEW |