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
|
#include <mbgl/util/async_task.hpp>
#include <mbgl/actor/actor_ref.hpp>
#include <mbgl/actor/scheduler.hpp>
#include <mbgl/test/util.hpp>
#include <mbgl/util/run_loop.hpp>
#include <atomic>
#include <future>
#include <vector>
using namespace mbgl;
using namespace mbgl::util;
namespace {
class TestWorker {
public:
TestWorker(AsyncTask *async_)
: async(async_) {}
void run() {
for (unsigned i = 0; i < 100000; ++i) {
async->send();
}
}
void runWithCallback(std::function<void()> cb) {
for (unsigned i = 0; i < 100000; ++i) {
async->send();
}
cb();
}
void sync(std::promise<void> barrier) {
barrier.set_value();
}
private:
AsyncTask *async;
};
} // namespace
TEST(AsyncTask, RequestCoalescing) {
RunLoop loop;
unsigned count = 0;
AsyncTask async([&count] { ++count; });
async.send();
async.send();
async.send();
async.send();
async.send();
loop.runOnce();
EXPECT_EQ(count, 1u);
}
TEST(AsyncTask, DestroyShouldNotRunQueue) {
RunLoop loop;
unsigned count = 0;
auto async = std::make_unique<AsyncTask>([&count] { ++count; });
async->send();
async.reset();
EXPECT_EQ(count, 0u);
}
TEST(AsyncTask, DestroyAfterSignaling) {
RunLoop loop;
// We're creating two tasks and signal both of them; the one that gets fired first destroys
// the other one. Make sure that the second one we destroyed doesn't fire.
std::unique_ptr<AsyncTask> task1, task2;
task1 = std::make_unique<AsyncTask>([&] {
task2.reset();
if (!task1) {
FAIL() << "Task was destroyed but invoked anyway";
}
});
task2 = std::make_unique<AsyncTask>([&] {
task1.reset();
if (!task2) {
FAIL() << "Task was destroyed but invoked anyway";
}
});
task1->send();
task2->send();
loop.runOnce();
}
TEST(AsyncTask, RequestCoalescingMultithreaded) {
RunLoop loop;
unsigned count = 0, numThreads = 25;
AsyncTask async([&count] { ++count; });
std::shared_ptr<Scheduler> retainer = Scheduler::GetBackground();
auto mailbox = std::make_shared<Mailbox>(*retainer);
TestWorker worker(&async);
ActorRef<TestWorker> workerRef(worker, mailbox);
for (unsigned i = 0; i < numThreads; ++i) {
workerRef.invoke(&TestWorker::run);
}
std::promise<void> barrier;
std::future<void> barrierFuture = barrier.get_future();
workerRef.invoke(&TestWorker::sync, std::move(barrier));
barrierFuture.wait();
loop.runOnce();
EXPECT_EQ(count, 1u);
}
TEST(AsyncTask, ThreadSafety) {
RunLoop loop;
unsigned count = 0, numThreads = 25;
std::atomic_uint completed(numThreads);
AsyncTask async([&count] { ++count; });
std::shared_ptr<Scheduler> retainer = Scheduler::GetBackground();
auto mailbox = std::make_shared<Mailbox>(*retainer);
TestWorker worker(&async);
ActorRef<TestWorker> workerRef(worker, mailbox);
for (unsigned i = 0; i < numThreads; ++i) {
// The callback runs on the worker, thus the atomic type.
workerRef.invoke(&TestWorker::runWithCallback, [&] { if (!--completed) loop.stop(); });
}
loop.run();
// We expect here more than 1 but 1 would also be
// a valid result, although very unlikely (I hope).
EXPECT_GT(count, 0u);
}
TEST(AsyncTask, scheduleAndReplyValue) {
RunLoop loop;
std::thread::id caller_id = std::this_thread::get_id();
auto runInBackground = [caller_id]() -> int {
EXPECT_NE(caller_id, std::this_thread::get_id());
return 42;
};
auto onResult = [caller_id, &loop](int res) {
EXPECT_EQ(caller_id, std::this_thread::get_id());
EXPECT_EQ(42, res);
loop.stop();
};
std::shared_ptr<Scheduler> sheduler = Scheduler::GetBackground();
sheduler->scheduleAndReplyValue(runInBackground, onResult);
loop.run();
}
TEST(AsyncTask, SequencedScheduler) {
RunLoop loop;
std::thread::id caller_id = std::this_thread::get_id();
std::thread::id bg_id;
int count = 0;
auto first = [caller_id, &bg_id, &count]() {
EXPECT_EQ(0, count);
bg_id = std::this_thread::get_id();
EXPECT_NE(caller_id, bg_id);
count++;
};
auto second = [&bg_id, &count]() {
EXPECT_EQ(1, count);
EXPECT_EQ(bg_id, std::this_thread::get_id());
count++;
};
auto third = [&bg_id, &count, &loop]() {
EXPECT_EQ(2, count);
EXPECT_EQ(bg_id, std::this_thread::get_id());
loop.stop();
};
std::shared_ptr<Scheduler> sheduler = Scheduler::GetSequenced();
sheduler->schedule(first);
sheduler->schedule(second);
sheduler->schedule(third);
loop.run();
}
TEST(AsyncTask, MultipleSequencedSchedulers) {
std::vector<std::shared_ptr<Scheduler>> shedulers;
for (int i = 0; i < 10; ++i) {
std::shared_ptr<Scheduler> scheduler = Scheduler::GetSequenced();
EXPECT_TRUE(std::none_of(
shedulers.begin(), shedulers.end(), [&scheduler](const auto &item) { return item == scheduler; }));
shedulers.emplace_back(std::move(scheduler));
}
EXPECT_EQ(shedulers.front(), std::shared_ptr<Scheduler>(Scheduler::GetSequenced()));
}
|
