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/priority_queue.h" | |
6 | |
7 #include "base/bind.h" | |
8 #include "base/macros.h" | |
9 #include "base/memory/ref_counted.h" | |
10 #include "base/task_scheduler/sequence.h" | |
11 #include "base/task_scheduler/task.h" | |
12 #include "base/task_scheduler/task_traits.h" | |
13 #include "base/time/time.h" | |
14 #include "testing/gmock/include/gmock/gmock.h" | |
15 #include "testing/gtest/include/gtest/gtest.h" | |
16 | |
17 namespace base { | |
18 namespace internal { | |
19 | |
20 namespace { | |
21 class TaskSchedulerPriorityQueueTest : public testing::Test { | |
22 public: | |
23 TaskSchedulerPriorityQueueTest() { | |
24 sequence_a_ = new Sequence; | |
25 sequence_a_->PushTask(make_scoped_ptr( | |
gab
2016/02/23 03:02:10
make_scoped_ptr is for scoped_ptr not scoped_refpt
fdoray
2016/02/23 17:02:14
PushTask expects a scoped_ptr<Task>, not a scoped_
| |
26 new Task(FROM_HERE, Closure(), | |
27 TaskTraits().WithPriority(TaskPriority::USER_VISIBLE)))); | |
robliao
2016/02/23 02:10:58
Maybe we should get some BACKGROUND tasks for comp
fdoray
2016/02/23 17:02:14
Done.
| |
28 | |
29 sequence_b_ = new Sequence; | |
30 sequence_b_->PushTask(make_scoped_ptr( | |
31 new Task(FROM_HERE, Closure(), | |
32 TaskTraits().WithPriority(TaskPriority::USER_BLOCKING)))); | |
33 | |
34 sequence_c_ = new Sequence; | |
35 sequence_c_->PushTask(make_scoped_ptr( | |
36 new Task(FROM_HERE, Closure(), | |
37 TaskTraits().WithPriority(TaskPriority::USER_BLOCKING)))); | |
38 } | |
39 | |
40 protected: | |
41 MOCK_METHOD0(SequenceInsertedInPriorityQueue, void()); | |
gab
2016/02/23 03:02:10
Unused I think (seems to be using PriorityQueueCal
fdoray
2016/02/23 17:02:14
Done.
| |
42 | |
43 scoped_refptr<Sequence> sequence_a_; | |
44 scoped_refptr<Sequence> sequence_b_; | |
45 scoped_refptr<Sequence> sequence_c_; | |
46 | |
47 private: | |
48 DISALLOW_COPY_AND_ASSIGN(TaskSchedulerPriorityQueueTest); | |
49 }; | |
50 | |
51 class PriorityQueueCallbackMock { | |
52 public: | |
53 PriorityQueueCallbackMock() = default; | |
54 MOCK_METHOD0(SequenceInsertedInPriorityQueue, void()); | |
55 | |
56 private: | |
57 DISALLOW_COPY_AND_ASSIGN(PriorityQueueCallbackMock); | |
58 }; | |
59 | |
60 void ExpectSequenceAndSortKey(const PriorityQueue::SequenceAndSortKey& expected, | |
61 const PriorityQueue::SequenceAndSortKey& actual) { | |
62 EXPECT_EQ(expected.sequence, actual.sequence); | |
63 EXPECT_EQ(expected.sort_key.priority, actual.sort_key.priority); | |
64 EXPECT_EQ(expected.sort_key.next_task_sequenced_time, | |
65 actual.sort_key.next_task_sequenced_time); | |
66 } | |
67 | |
68 } // namespace | |
69 | |
70 TEST_F(TaskSchedulerPriorityQueueTest, PushPopPeek) { | |
71 const SequenceSortKey sort_key_a = sequence_a_->GetSortKey(); | |
72 const SequenceSortKey sort_key_b = sequence_b_->GetSortKey(); | |
73 const SequenceSortKey sort_key_c = sequence_c_->GetSortKey(); | |
74 | |
75 PriorityQueueCallbackMock mock; | |
gab
2016/02/23 03:02:10
I think you can make this verify precisely what yo
fdoray
2016/02/23 17:02:14
Done.
| |
76 PriorityQueue pq( | |
77 Bind(&PriorityQueueCallbackMock::SequenceInsertedInPriorityQueue, | |
78 Unretained(&mock))); | |
79 scoped_ptr<PriorityQueue::Transaction> transaction(pq.BeginTransaction()); | |
80 | |
81 EXPECT_EQ(nullptr, transaction->PeekSequence().sequence.get()); | |
82 | |
83 transaction->PushSequence(sequence_a_, sort_key_a); | |
84 ExpectSequenceAndSortKey( | |
85 PriorityQueue::SequenceAndSortKey(sequence_a_, sort_key_a), | |
86 transaction->PeekSequence()); | |
87 | |
88 transaction->PushSequence(sequence_b_, sort_key_b); | |
89 ExpectSequenceAndSortKey( | |
90 PriorityQueue::SequenceAndSortKey(sequence_b_, sort_key_b), | |
91 transaction->PeekSequence()); | |
92 | |
93 transaction->PushSequence(sequence_c_, sort_key_c); | |
94 ExpectSequenceAndSortKey( | |
95 PriorityQueue::SequenceAndSortKey(sequence_b_, sort_key_b), | |
96 transaction->PeekSequence()); | |
97 | |
98 transaction->PopSequence(); | |
99 ExpectSequenceAndSortKey( | |
100 PriorityQueue::SequenceAndSortKey(sequence_c_, sort_key_c), | |
101 transaction->PeekSequence()); | |
102 | |
103 transaction->PopSequence(); | |
104 ExpectSequenceAndSortKey( | |
105 PriorityQueue::SequenceAndSortKey(sequence_a_, sort_key_a), | |
106 transaction->PeekSequence()); | |
107 | |
108 transaction->PopSequence(); | |
109 EXPECT_EQ(nullptr, transaction->PeekSequence().sequence.get()); | |
gab
2016/02/23 03:02:10
PeekSequence().is_null() would be nicer here if ab
fdoray
2016/02/23 17:02:14
Done.
| |
110 | |
111 EXPECT_CALL(mock, SequenceInsertedInPriorityQueue()).Times(3); | |
112 transaction.reset(); | |
113 } | |
114 | |
115 } // namespace internal | |
116 } // namespace base | |
OLD | NEW |