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
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
|
// Copyright 2014 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 "cc/raster/task_graph_runner.h"
#include <vector>
#include "base/bind.h"
#include "base/synchronization/lock.h"
#include "base/threading/simple_thread.h"
#include "cc/base/scoped_ptr_deque.h"
#include "testing/gtest/include/gtest/gtest.h"
namespace cc {
namespace {
const int kNamespaceCount = 3;
class TaskGraphRunnerTestBase {
public:
struct TaskInfo {
TaskInfo(int namespace_index,
unsigned id,
unsigned dependent_id,
unsigned dependent_count,
unsigned priority)
: namespace_index(namespace_index),
id(id),
dependent_id(dependent_id),
dependent_count(dependent_count),
priority(priority) {}
int namespace_index;
unsigned id;
unsigned dependent_id;
unsigned dependent_count;
unsigned priority;
};
TaskGraphRunnerTestBase() : task_graph_runner_(new TaskGraphRunner) {}
void ResetIds(int namespace_index) {
run_task_ids_[namespace_index].clear();
on_task_completed_ids_[namespace_index].clear();
}
void RunAllTasks(int namespace_index) {
task_graph_runner_->WaitForTasksToFinishRunning(
namespace_token_[namespace_index]);
Task::Vector completed_tasks;
task_graph_runner_->CollectCompletedTasks(namespace_token_[namespace_index],
&completed_tasks);
for (Task::Vector::const_iterator it = completed_tasks.begin();
it != completed_tasks.end();
++it) {
FakeTaskImpl* task = static_cast<FakeTaskImpl*>(it->get());
task->CompleteOnOriginThread();
}
}
void RunTaskOnWorkerThread(int namespace_index, unsigned id) {
base::AutoLock lock(run_task_ids_lock_);
run_task_ids_[namespace_index].push_back(id);
}
void OnTaskCompleted(int namespace_index, unsigned id) {
on_task_completed_ids_[namespace_index].push_back(id);
}
const std::vector<unsigned>& run_task_ids(int namespace_index) {
return run_task_ids_[namespace_index];
}
const std::vector<unsigned>& on_task_completed_ids(int namespace_index) {
return on_task_completed_ids_[namespace_index];
}
void ScheduleTasks(int namespace_index, const std::vector<TaskInfo>& tasks) {
Task::Vector new_tasks;
Task::Vector new_dependents;
TaskGraph new_graph;
for (std::vector<TaskInfo>::const_iterator it = tasks.begin();
it != tasks.end();
++it) {
scoped_refptr<FakeTaskImpl> new_task(
new FakeTaskImpl(this, it->namespace_index, it->id));
new_graph.nodes.push_back(
TaskGraph::Node(new_task.get(), it->priority, 0u));
for (unsigned i = 0; i < it->dependent_count; ++i) {
scoped_refptr<FakeDependentTaskImpl> new_dependent_task(
new FakeDependentTaskImpl(
this, it->namespace_index, it->dependent_id));
new_graph.nodes.push_back(
TaskGraph::Node(new_dependent_task.get(), it->priority, 1u));
new_graph.edges.push_back(
TaskGraph::Edge(new_task.get(), new_dependent_task.get()));
new_dependents.push_back(new_dependent_task.get());
}
new_tasks.push_back(new_task.get());
}
task_graph_runner_->ScheduleTasks(namespace_token_[namespace_index],
&new_graph);
dependents_[namespace_index].swap(new_dependents);
tasks_[namespace_index].swap(new_tasks);
}
protected:
class FakeTaskImpl : public Task {
public:
FakeTaskImpl(TaskGraphRunnerTestBase* test, int namespace_index, int id)
: test_(test), namespace_index_(namespace_index), id_(id) {}
// Overridden from Task:
void RunOnWorkerThread() override {
test_->RunTaskOnWorkerThread(namespace_index_, id_);
}
virtual void CompleteOnOriginThread() {
test_->OnTaskCompleted(namespace_index_, id_);
}
protected:
~FakeTaskImpl() override {}
private:
TaskGraphRunnerTestBase* test_;
int namespace_index_;
int id_;
DISALLOW_COPY_AND_ASSIGN(FakeTaskImpl);
};
class FakeDependentTaskImpl : public FakeTaskImpl {
public:
FakeDependentTaskImpl(TaskGraphRunnerTestBase* test,
int namespace_index,
int id)
: FakeTaskImpl(test, namespace_index, id) {}
// Overridden from FakeTaskImpl:
void CompleteOnOriginThread() override {}
private:
~FakeDependentTaskImpl() override {}
DISALLOW_COPY_AND_ASSIGN(FakeDependentTaskImpl);
};
scoped_ptr<TaskGraphRunner> task_graph_runner_;
NamespaceToken namespace_token_[kNamespaceCount];
Task::Vector tasks_[kNamespaceCount];
Task::Vector dependents_[kNamespaceCount];
std::vector<unsigned> run_task_ids_[kNamespaceCount];
base::Lock run_task_ids_lock_;
std::vector<unsigned> on_task_completed_ids_[kNamespaceCount];
};
class TaskGraphRunnerTest : public TaskGraphRunnerTestBase,
public testing::TestWithParam<int>,
public base::DelegateSimpleThread::Delegate {
public:
// Overridden from testing::Test:
void SetUp() override {
const size_t num_threads = GetParam();
while (workers_.size() < num_threads) {
scoped_ptr<base::DelegateSimpleThread> worker =
make_scoped_ptr(new base::DelegateSimpleThread(this, "TestWorker"));
worker->Start();
workers_.push_back(worker.Pass());
}
for (int i = 0; i < kNamespaceCount; ++i)
namespace_token_[i] = task_graph_runner_->GetNamespaceToken();
}
void TearDown() override {
task_graph_runner_->Shutdown();
while (workers_.size()) {
scoped_ptr<base::DelegateSimpleThread> worker = workers_.take_front();
worker->Join();
}
}
private:
// Overridden from base::DelegateSimpleThread::Delegate:
void Run() override { task_graph_runner_->Run(); }
ScopedPtrDeque<base::DelegateSimpleThread> workers_;
};
TEST_P(TaskGraphRunnerTest, Basic) {
for (int i = 0; i < kNamespaceCount; ++i) {
EXPECT_EQ(0u, run_task_ids(i).size());
EXPECT_EQ(0u, on_task_completed_ids(i).size());
ScheduleTasks(i, std::vector<TaskInfo>(1, TaskInfo(i, 0u, 0u, 0u, 0u)));
}
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
EXPECT_EQ(1u, run_task_ids(i).size());
EXPECT_EQ(1u, on_task_completed_ids(i).size());
}
for (int i = 0; i < kNamespaceCount; ++i)
ScheduleTasks(i, std::vector<TaskInfo>(1, TaskInfo(i, 0u, 0u, 1u, 0u)));
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
EXPECT_EQ(3u, run_task_ids(i).size());
EXPECT_EQ(2u, on_task_completed_ids(i).size());
}
for (int i = 0; i < kNamespaceCount; ++i)
ScheduleTasks(i, std::vector<TaskInfo>(1, TaskInfo(i, 0u, 0u, 2u, 0u)));
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
EXPECT_EQ(6u, run_task_ids(i).size());
EXPECT_EQ(3u, on_task_completed_ids(i).size());
}
}
TEST_P(TaskGraphRunnerTest, Dependencies) {
for (int i = 0; i < kNamespaceCount; ++i) {
ScheduleTasks(i,
std::vector<TaskInfo>(1,
TaskInfo(i,
0u,
1u,
1u, // 1 dependent
0u)));
}
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
// Check if task ran before dependent.
ASSERT_EQ(2u, run_task_ids(i).size());
EXPECT_EQ(0u, run_task_ids(i)[0]);
EXPECT_EQ(1u, run_task_ids(i)[1]);
ASSERT_EQ(1u, on_task_completed_ids(i).size());
EXPECT_EQ(0u, on_task_completed_ids(i)[0]);
}
for (int i = 0; i < kNamespaceCount; ++i) {
ScheduleTasks(i,
std::vector<TaskInfo>(1,
TaskInfo(i,
2u,
3u,
2u, // 2 dependents
0u)));
}
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
// Task should only run once.
ASSERT_EQ(5u, run_task_ids(i).size());
EXPECT_EQ(2u, run_task_ids(i)[2]);
EXPECT_EQ(3u, run_task_ids(i)[3]);
EXPECT_EQ(3u, run_task_ids(i)[4]);
ASSERT_EQ(2u, on_task_completed_ids(i).size());
EXPECT_EQ(2u, on_task_completed_ids(i)[1]);
}
}
INSTANTIATE_TEST_CASE_P(TaskGraphRunnerTests,
TaskGraphRunnerTest,
::testing::Range(1, 5));
class TaskGraphRunnerSingleThreadTest
: public TaskGraphRunnerTestBase,
public testing::Test,
public base::DelegateSimpleThread::Delegate {
public:
// Overridden from testing::Test:
void SetUp() override {
worker_.reset(new base::DelegateSimpleThread(this, "TestWorker"));
worker_->Start();
for (int i = 0; i < kNamespaceCount; ++i)
namespace_token_[i] = task_graph_runner_->GetNamespaceToken();
}
void TearDown() override {
task_graph_runner_->Shutdown();
worker_->Join();
}
private:
// Overridden from base::DelegateSimpleThread::Delegate:
void Run() override { task_graph_runner_->Run(); }
scoped_ptr<base::DelegateSimpleThread> worker_;
};
TEST_F(TaskGraphRunnerSingleThreadTest, Priority) {
for (int i = 0; i < kNamespaceCount; ++i) {
TaskInfo tasks[] = {TaskInfo(i, 0u, 2u, 1u, 1u), // Priority 1
TaskInfo(i, 1u, 3u, 1u, 0u) // Priority 0
};
ScheduleTasks(i, std::vector<TaskInfo>(tasks, tasks + arraysize(tasks)));
}
for (int i = 0; i < kNamespaceCount; ++i) {
RunAllTasks(i);
// Check if tasks ran in order of priority.
ASSERT_EQ(4u, run_task_ids(i).size());
EXPECT_EQ(1u, run_task_ids(i)[0]);
EXPECT_EQ(3u, run_task_ids(i)[1]);
EXPECT_EQ(0u, run_task_ids(i)[2]);
EXPECT_EQ(2u, run_task_ids(i)[3]);
ASSERT_EQ(2u, on_task_completed_ids(i).size());
EXPECT_EQ(1u, on_task_completed_ids(i)[0]);
EXPECT_EQ(0u, on_task_completed_ids(i)[1]);
}
}
} // namespace
} // namespace cc
|