OLD | NEW |
(Empty) | |
| 1 // Copyright 2016 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 "base/task_scheduler/sequence.h" |
| 6 |
| 7 #include "base/macros.h" |
| 8 #include "base/time/time.h" |
| 9 #include "testing/gtest/include/gtest/gtest.h" |
| 10 |
| 11 namespace base { |
| 12 namespace internal { |
| 13 |
| 14 class TaskSchedulerSequenceTest : public testing::Test { |
| 15 public: |
| 16 TaskSchedulerSequenceTest() |
| 17 : task_a_(FROM_HERE, |
| 18 Closure(), |
| 19 TaskTraits().WithPriority(TaskPriority::BACKGROUND), |
| 20 TimeTicks::FromInternalValue(1)), |
| 21 task_b_(FROM_HERE, |
| 22 Closure(), |
| 23 TaskTraits().WithPriority(TaskPriority::USER_VISIBLE), |
| 24 TimeTicks::FromInternalValue(2)), |
| 25 task_c_(FROM_HERE, |
| 26 Closure(), |
| 27 TaskTraits().WithPriority(TaskPriority::USER_BLOCKING), |
| 28 TimeTicks::FromInternalValue(3)), |
| 29 task_d_(FROM_HERE, |
| 30 Closure(), |
| 31 TaskTraits().WithPriority(TaskPriority::USER_BLOCKING), |
| 32 TimeTicks::FromInternalValue(4)) {} |
| 33 |
| 34 protected: |
| 35 const Task task_a_; |
| 36 const Task task_b_; |
| 37 const Task task_c_; |
| 38 const Task task_d_; |
| 39 |
| 40 private: |
| 41 DISALLOW_COPY_AND_ASSIGN(TaskSchedulerSequenceTest); |
| 42 }; |
| 43 |
| 44 TEST_F(TaskSchedulerSequenceTest, PushPopPeek) { |
| 45 scoped_refptr<Sequence> sequence(new Sequence); |
| 46 |
| 47 EXPECT_TRUE(sequence->PushTask(scoped_ptr<Task>(new Task(task_a_)))); |
| 48 EXPECT_EQ(task_a_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 49 |
| 50 EXPECT_FALSE(sequence->PushTask(scoped_ptr<Task>(new Task(task_b_)))); |
| 51 EXPECT_EQ(task_a_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 52 |
| 53 EXPECT_FALSE(sequence->PushTask(scoped_ptr<Task>(new Task(task_c_)))); |
| 54 EXPECT_EQ(task_a_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 55 |
| 56 EXPECT_FALSE(sequence->PushTask(scoped_ptr<Task>(new Task(task_d_)))); |
| 57 EXPECT_EQ(task_a_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 58 |
| 59 EXPECT_FALSE(sequence->PopTask()); |
| 60 EXPECT_EQ(task_b_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 61 |
| 62 EXPECT_FALSE(sequence->PopTask()); |
| 63 EXPECT_EQ(task_c_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 64 |
| 65 EXPECT_FALSE(sequence->PopTask()); |
| 66 EXPECT_EQ(task_d_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 67 |
| 68 EXPECT_FALSE(sequence->PushTask(scoped_ptr<Task>(new Task(task_a_)))); |
| 69 EXPECT_EQ(task_d_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 70 |
| 71 EXPECT_FALSE(sequence->PopTask()); |
| 72 EXPECT_EQ(task_a_.sequenced_time, sequence->PeekTask()->sequenced_time); |
| 73 |
| 74 EXPECT_TRUE(sequence->PopTask()); |
| 75 EXPECT_EQ(nullptr, sequence->PeekTask()); |
| 76 } |
| 77 |
| 78 TEST_F(TaskSchedulerSequenceTest, GetSortKey) { |
| 79 scoped_refptr<Sequence> sequence(new Sequence); |
| 80 |
| 81 sequence->PushTask(scoped_ptr<Task>(new Task(task_a_))); |
| 82 const SequenceSortKey sort_key_1(sequence->GetSortKey()); |
| 83 EXPECT_EQ(TaskPriority::BACKGROUND, sort_key_1.priority_); |
| 84 EXPECT_EQ(task_a_.sequenced_time, sort_key_1.next_task_sequenced_time_); |
| 85 |
| 86 sequence->PushTask(scoped_ptr<Task>(new Task(task_b_))); |
| 87 const SequenceSortKey sort_key_2(sequence->GetSortKey()); |
| 88 EXPECT_EQ(TaskPriority::USER_VISIBLE, sort_key_2.priority_); |
| 89 EXPECT_EQ(task_a_.sequenced_time, sort_key_2.next_task_sequenced_time_); |
| 90 |
| 91 sequence->PushTask(scoped_ptr<Task>(new Task(task_c_))); |
| 92 const SequenceSortKey sort_key_3(sequence->GetSortKey()); |
| 93 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_3.priority_); |
| 94 EXPECT_EQ(task_a_.sequenced_time, sort_key_3.next_task_sequenced_time_); |
| 95 |
| 96 sequence->PushTask(scoped_ptr<Task>(new Task(task_d_))); |
| 97 const SequenceSortKey sort_key_4(sequence->GetSortKey()); |
| 98 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_4.priority_); |
| 99 EXPECT_EQ(task_a_.sequenced_time, sort_key_4.next_task_sequenced_time_); |
| 100 |
| 101 sequence->PopTask(); |
| 102 const SequenceSortKey sort_key_5(sequence->GetSortKey()); |
| 103 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_5.priority_); |
| 104 EXPECT_EQ(task_b_.sequenced_time, sort_key_5.next_task_sequenced_time_); |
| 105 |
| 106 sequence->PopTask(); |
| 107 const SequenceSortKey sort_key_6(sequence->GetSortKey()); |
| 108 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_6.priority_); |
| 109 EXPECT_EQ(task_c_.sequenced_time, sort_key_6.next_task_sequenced_time_); |
| 110 |
| 111 sequence->PopTask(); |
| 112 const SequenceSortKey sort_key_7(sequence->GetSortKey()); |
| 113 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_7.priority_); |
| 114 EXPECT_EQ(task_d_.sequenced_time, sort_key_7.next_task_sequenced_time_); |
| 115 |
| 116 sequence->PushTask(scoped_ptr<Task>(new Task(task_a_))); |
| 117 const SequenceSortKey sort_key_8(sequence->GetSortKey()); |
| 118 EXPECT_EQ(TaskPriority::USER_BLOCKING, sort_key_8.priority_); |
| 119 EXPECT_EQ(task_d_.sequenced_time, sort_key_8.next_task_sequenced_time_); |
| 120 |
| 121 sequence->PopTask(); |
| 122 const SequenceSortKey sort_key_9(sequence->GetSortKey()); |
| 123 EXPECT_EQ(TaskPriority::BACKGROUND, sort_key_9.priority_); |
| 124 EXPECT_EQ(task_a_.sequenced_time, sort_key_9.next_task_sequenced_time_); |
| 125 } |
| 126 |
| 127 } // namespace internal |
| 128 } // namespace base |
OLD | NEW |