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_sets.h" | 5 #include "components/scheduler/base/task_queue_sets.h" |
6 | 6 |
7 #include "components/scheduler/base/task_queue_impl.h" | 7 #include "components/scheduler/base/task_queue_impl.h" |
| 8 #include "components/scheduler/base/time_domain.h" |
8 #include "testing/gmock/include/gmock/gmock.h" | 9 #include "testing/gmock/include/gmock/gmock.h" |
9 | 10 |
10 namespace scheduler { | 11 namespace scheduler { |
| 12 class TimeDomain; |
| 13 |
11 namespace internal { | 14 namespace internal { |
12 | 15 |
13 class TaskQueueSetsTest : public testing::Test { | 16 class TaskQueueSetsTest : public testing::Test { |
14 public: | 17 public: |
15 void SetUp() override { task_queue_sets_.reset(new TaskQueueSets(kNumSets)); } | 18 void SetUp() override { task_queue_sets_.reset(new TaskQueueSets(kNumSets)); } |
16 | 19 |
17 protected: | 20 protected: |
18 enum { | 21 enum { |
19 kNumSets = 5 // An arbitary choice. | 22 kNumSets = 5 // An arbitary choice. |
20 }; | 23 }; |
21 | 24 |
22 TaskQueueImpl* NewTaskQueue(const char* queue_name) { | 25 TaskQueueImpl* NewTaskQueue(const char* queue_name) { |
23 scoped_refptr<internal::TaskQueueImpl> queue = | 26 scoped_refptr<internal::TaskQueueImpl> queue = |
24 make_scoped_refptr(new internal::TaskQueueImpl( | 27 make_scoped_refptr(new internal::TaskQueueImpl( |
25 nullptr, TaskQueue::Spec(queue_name), "test", "test")); | 28 nullptr, scoped_refptr<TimeDomain>(), TaskQueue::Spec(queue_name), |
| 29 "test", "test")); |
26 task_queues_.push_back(queue); | 30 task_queues_.push_back(queue); |
27 return queue.get(); | 31 return queue.get(); |
28 } | 32 } |
29 | 33 |
30 TaskQueueImpl::Task FakeTaskWithEnqueueOrder(int enqueue_order) { | 34 TaskQueueImpl::Task FakeTaskWithEnqueueOrder(int enqueue_order) { |
31 TaskQueueImpl::Task fake_task(FROM_HERE, base::Closure(), 0, true); | 35 TaskQueueImpl::Task fake_task(FROM_HERE, base::Closure(), 0, true); |
32 fake_task.set_enqueue_order(enqueue_order); | 36 fake_task.set_enqueue_order(enqueue_order); |
33 return fake_task; | 37 return fake_task; |
34 } | 38 } |
35 | 39 |
(...skipping 194 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
230 task_queue_sets_->AssignQueueToSet(queue, set); | 234 task_queue_sets_->AssignQueueToSet(queue, set); |
231 EXPECT_FALSE(task_queue_sets_->IsSetEmpty(set)); | 235 EXPECT_FALSE(task_queue_sets_->IsSetEmpty(set)); |
232 | 236 |
233 queue->PopTaskFromWorkQueueForTest(); | 237 queue->PopTaskFromWorkQueueForTest(); |
234 task_queue_sets_->OnPopQueue(queue); | 238 task_queue_sets_->OnPopQueue(queue); |
235 EXPECT_TRUE(task_queue_sets_->IsSetEmpty(set)); | 239 EXPECT_TRUE(task_queue_sets_->IsSetEmpty(set)); |
236 } | 240 } |
237 | 241 |
238 } // namespace internal | 242 } // namespace internal |
239 } // namespace scheduler | 243 } // namespace scheduler |
OLD | NEW |