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/base/task_queue_selector.h" | 5 #include "components/scheduler/base/task_queue_selector.h" |
6 | 6 |
7 #include "base/bind.h" | 7 #include "base/bind.h" |
8 #include "base/memory/scoped_ptr.h" | 8 #include "base/memory/scoped_ptr.h" |
9 #include "base/pending_task.h" | 9 #include "base/pending_task.h" |
10 #include "components/scheduler/base/task_queue_impl.h" | 10 #include "components/scheduler/base/task_queue_impl.h" |
11 #include "components/scheduler/base/task_queue_sets.h" | 11 #include "components/scheduler/base/task_queue_sets.h" |
12 #include "components/scheduler/base/virtual_time_domain.h" | |
13 #include "testing/gmock/include/gmock/gmock.h" | 12 #include "testing/gmock/include/gmock/gmock.h" |
14 #include "testing/gtest/include/gtest/gtest.h" | 13 #include "testing/gtest/include/gtest/gtest.h" |
15 | 14 |
16 using testing::_; | 15 using testing::_; |
17 | 16 |
18 namespace scheduler { | 17 namespace scheduler { |
19 namespace internal { | 18 namespace internal { |
20 | 19 |
21 class MockObserver : public TaskQueueSelector::Observer { | 20 class MockObserver : public TaskQueueSelector::Observer { |
22 public: | 21 public: |
(...skipping 45 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 chosen_queue->PopTaskFromWorkQueueForTest(); | 67 chosen_queue->PopTaskFromWorkQueueForTest(); |
69 selector_.GetTaskQueueSets()->OnPopQueue(chosen_queue); | 68 selector_.GetTaskQueueSets()->OnPopQueue(chosen_queue); |
70 } | 69 } |
71 return order; | 70 return order; |
72 } | 71 } |
73 | 72 |
74 static void TestFunction() {} | 73 static void TestFunction() {} |
75 | 74 |
76 protected: | 75 protected: |
77 void SetUp() final { | 76 void SetUp() final { |
78 virtual_time_domain_ = make_scoped_refptr<VirtualTimeDomain>( | |
79 new VirtualTimeDomain(base::TimeTicks())); | |
80 for (size_t i = 0; i < kTaskQueueCount; i++) { | 77 for (size_t i = 0; i < kTaskQueueCount; i++) { |
81 scoped_refptr<TaskQueueImpl> task_queue = make_scoped_refptr( | 78 scoped_refptr<TaskQueueImpl> task_queue = |
82 new TaskQueueImpl(nullptr, virtual_time_domain_, | 79 make_scoped_refptr(new TaskQueueImpl( |
83 TaskQueue::Spec("test queue"), "test", "test")); | 80 nullptr, TaskQueue::Spec("test queue"), "test", "test")); |
84 selector_.AddQueue(task_queue.get()); | 81 selector_.AddQueue(task_queue.get()); |
85 task_queues_.push_back(task_queue); | 82 task_queues_.push_back(task_queue); |
86 } | 83 } |
87 for (size_t i = 0; i < kTaskQueueCount; i++) { | 84 for (size_t i = 0; i < kTaskQueueCount; i++) { |
88 EXPECT_TRUE(selector_.IsQueueEnabled(task_queues_[i].get())) << i; | 85 EXPECT_TRUE(selector_.IsQueueEnabled(task_queues_[i].get())) << i; |
89 queue_to_index_map_.insert(std::make_pair(task_queues_[i].get(), i)); | 86 queue_to_index_map_.insert(std::make_pair(task_queues_[i].get(), i)); |
90 } | 87 } |
91 } | 88 } |
92 | 89 |
93 const size_t kTaskQueueCount = 5; | 90 const size_t kTaskQueueCount = 5; |
94 base::Closure test_closure_; | 91 base::Closure test_closure_; |
95 TaskQueueSelector selector_; | 92 TaskQueueSelector selector_; |
96 scoped_refptr<VirtualTimeDomain> virtual_time_domain_; | |
97 std::vector<scoped_refptr<TaskQueueImpl>> task_queues_; | 93 std::vector<scoped_refptr<TaskQueueImpl>> task_queues_; |
98 std::map<TaskQueueImpl*, size_t> queue_to_index_map_; | 94 std::map<TaskQueueImpl*, size_t> queue_to_index_map_; |
99 }; | 95 }; |
100 | 96 |
101 TEST_F(TaskQueueSelectorTest, TestDefaultPriority) { | 97 TEST_F(TaskQueueSelectorTest, TestDefaultPriority) { |
102 std::vector<TaskQueueImpl::Task> tasks = GetTasks(5); | 98 std::vector<TaskQueueImpl::Task> tasks = GetTasks(5); |
103 size_t queue_order[] = {4, 3, 2, 1, 0}; | 99 size_t queue_order[] = {4, 3, 2, 1, 0}; |
104 PushTasks(tasks, queue_order); | 100 PushTasks(tasks, queue_order); |
105 EXPECT_THAT(PopTasks(), testing::ElementsAre(4, 3, 2, 1, 0)); | 101 EXPECT_THAT(PopTasks(), testing::ElementsAre(4, 3, 2, 1, 0)); |
106 } | 102 } |
(...skipping 171 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
278 size_t queue_order[] = {0, 1}; | 274 size_t queue_order[] = {0, 1}; |
279 PushTasks(tasks, queue_order); | 275 PushTasks(tasks, queue_order); |
280 | 276 |
281 EXPECT_FALSE(selector_.EnabledWorkQueuesEmpty()); | 277 EXPECT_FALSE(selector_.EnabledWorkQueuesEmpty()); |
282 PopTasks(); | 278 PopTasks(); |
283 EXPECT_TRUE(selector_.EnabledWorkQueuesEmpty()); | 279 EXPECT_TRUE(selector_.EnabledWorkQueuesEmpty()); |
284 } | 280 } |
285 | 281 |
286 } // namespace internal | 282 } // namespace internal |
287 } // namespace scheduler | 283 } // namespace scheduler |
OLD | NEW |