1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
|
// Copyright 2016 The Chromium Authors. All rights reserved.
// Use of this source code is governed by a BSD-style license that can be
// found in the LICENSE file.
#include "base/task_scheduler/scheduler_worker_stack.h"
#include "base/logging.h"
#include "base/memory/ptr_util.h"
#include "base/memory/ref_counted.h"
#include "base/task_scheduler/scheduler_worker.h"
#include "base/task_scheduler/sequence.h"
#include "base/task_scheduler/task_tracker.h"
#include "base/task_scheduler/test_utils.h"
#include "base/threading/platform_thread.h"
#include "base/time/time.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace base {
namespace internal {
namespace {
class MockSchedulerWorkerDelegate : public SchedulerWorker::Delegate {
public:
void OnMainEntry(SchedulerWorker* worker) override {}
scoped_refptr<Sequence> GetWork(SchedulerWorker* worker) override {
return nullptr;
}
void ReEnqueueSequence(scoped_refptr<Sequence> sequence) override {
ADD_FAILURE() << "This delegate not expect to have sequences to reenqueue.";
}
TimeDelta GetSleepTimeout() override {
return TimeDelta::Max();
}
bool CanDetach(SchedulerWorker* worker) override {
return false;
}
};
class TaskSchedulerWorkerStackTest : public testing::Test {
protected:
void SetUp() override {
worker_a_ = SchedulerWorker::Create(
ThreadPriority::NORMAL,
WrapUnique(new MockSchedulerWorkerDelegate), &task_tracker_,
SchedulerWorker::InitialState::ALIVE);
ASSERT_TRUE(worker_a_);
worker_b_ = SchedulerWorker::Create(
ThreadPriority::NORMAL,
WrapUnique(new MockSchedulerWorkerDelegate), &task_tracker_,
SchedulerWorker::InitialState::ALIVE);
ASSERT_TRUE(worker_b_);
worker_c_ = SchedulerWorker::Create(
ThreadPriority::NORMAL,
WrapUnique(new MockSchedulerWorkerDelegate), &task_tracker_,
SchedulerWorker::InitialState::ALIVE);
ASSERT_TRUE(worker_c_);
}
void TearDown() override {
worker_a_->JoinForTesting();
worker_b_->JoinForTesting();
worker_c_->JoinForTesting();
}
std::unique_ptr<SchedulerWorker> worker_a_;
std::unique_ptr<SchedulerWorker> worker_b_;
std::unique_ptr<SchedulerWorker> worker_c_;
private:
TaskTracker task_tracker_;
};
} // namespace
// Verify that Push() and Pop() add/remove values in FIFO order.
TEST_F(TaskSchedulerWorkerStackTest, PushPop) {
SchedulerWorkerStack stack;
EXPECT_TRUE(stack.IsEmpty());
EXPECT_EQ(0U, stack.Size());
stack.Push(worker_a_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(1U, stack.Size());
stack.Push(worker_b_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(2U, stack.Size());
stack.Push(worker_c_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(3U, stack.Size());
EXPECT_EQ(worker_c_.get(), stack.Pop());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(2U, stack.Size());
stack.Push(worker_c_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(3U, stack.Size());
EXPECT_EQ(worker_c_.get(), stack.Pop());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(2U, stack.Size());
EXPECT_EQ(worker_b_.get(), stack.Pop());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(1U, stack.Size());
EXPECT_EQ(worker_a_.get(), stack.Pop());
EXPECT_TRUE(stack.IsEmpty());
EXPECT_EQ(0U, stack.Size());
}
// Verify that a value can be removed by Remove().
TEST_F(TaskSchedulerWorkerStackTest, Remove) {
SchedulerWorkerStack stack;
EXPECT_TRUE(stack.IsEmpty());
EXPECT_EQ(0U, stack.Size());
stack.Push(worker_a_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(1U, stack.Size());
stack.Push(worker_b_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(2U, stack.Size());
stack.Push(worker_c_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(3U, stack.Size());
stack.Remove(worker_b_.get());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(2U, stack.Size());
EXPECT_EQ(worker_c_.get(), stack.Pop());
EXPECT_FALSE(stack.IsEmpty());
EXPECT_EQ(1U, stack.Size());
EXPECT_EQ(worker_a_.get(), stack.Pop());
EXPECT_TRUE(stack.IsEmpty());
EXPECT_EQ(0U, stack.Size());
}
// Verify that a value can be pushed again after it has been removed.
TEST_F(TaskSchedulerWorkerStackTest, PushAfterRemove) {
SchedulerWorkerStack stack;
EXPECT_EQ(0U, stack.Size());
EXPECT_TRUE(stack.IsEmpty());
stack.Push(worker_a_.get());
EXPECT_EQ(1U, stack.Size());
EXPECT_FALSE(stack.IsEmpty());
stack.Remove(worker_a_.get());
EXPECT_EQ(0U, stack.Size());
EXPECT_TRUE(stack.IsEmpty());
stack.Push(worker_a_.get());
EXPECT_EQ(1U, stack.Size());
EXPECT_FALSE(stack.IsEmpty());
}
// Verify that Push() DCHECKs when a value is inserted twice.
TEST_F(TaskSchedulerWorkerStackTest, PushTwice) {
SchedulerWorkerStack stack;
stack.Push(worker_a_.get());
EXPECT_DCHECK_DEATH({ stack.Push(worker_a_.get()); }, "");
}
} // namespace internal
} // namespace base
|
