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
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
|
// Copyright Oliver Kowalke 2013.
// Distributed under the Boost Software License, Version 1.0.
// (See accompanying file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
//
// This test is based on the tests of Boost.Thread
#include <chrono>
#include <cstdlib>
#include <iostream>
#include <map>
#include <mutex>
#include <stdexcept>
#include <vector>
#include <boost/test/unit_test.hpp>
#include <boost/fiber/all.hpp>
typedef std::chrono::nanoseconds ns;
typedef std::chrono::milliseconds ms;
int value1 = 0;
int value2 = 0;
template< typename M >
void fn1( M & mtx) {
typedef M mutex_type;
typename std::unique_lock< mutex_type > lk( mtx);
++value1;
for ( int i = 0; i < 3; ++i)
boost::this_fiber::yield();
}
template< typename M >
void fn2( M & mtx) {
typedef M mutex_type;
++value2;
typename std::unique_lock< mutex_type > lk( mtx);
++value2;
}
void fn3( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
m.lock();
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(2500000)+ms(2000)); // within 2.5 ms
}
void fn4( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
while ( ! m.try_lock() );
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(50000000)+ms(2000)); // within 50 ms
}
void fn5( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK( m.try_lock_for(ms(300)+ms(2000)) == true);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5 ms
}
void fn6( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_for(ms(250)) == false);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5 ms
}
void fn7( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_until(std::chrono::steady_clock::now() + ms(300) + ms(1000)) == true);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5ms
}
void fn8( boost::fibers::timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_until(std::chrono::steady_clock::now() + ms(250)) == false);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
ns d = t1 - t0 - ms(250);
ns r = ns(5000000)+ms(2000); // within 6ms
BOOST_CHECK(d < r); // within 6ms
}
void fn9( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
m.lock();
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.lock();
m.unlock();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ms(2500)+ms(2000)); // within 2.5 ms
}
void fn10( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
while (!m.try_lock()) ;
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock());
m.unlock();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ms(50000)+ms(2000)); // within 50 ms
}
void fn11( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_for(ms(300)+ms(1000)) == true);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock());
m.unlock();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5 ms
}
void fn12( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_for(ms(250)) == false);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ms(5000)+ms(2000)); // within 5 ms
}
void fn13( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_until(std::chrono::steady_clock::now() + ms(300) + ms(1000)) == true);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5 ms
}
void fn14( boost::fibers::recursive_timed_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock_until(std::chrono::steady_clock::now() + ms(250)) == false);
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(5000000)+ms(2000)); // within 5 ms
}
void fn15( boost::fibers::recursive_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
m.lock();
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.lock();
m.unlock();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(2500000)+ms(2000)); // within 2.5 ms
}
void fn16( boost::fibers::recursive_mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
while (!m.try_lock());
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
BOOST_CHECK(m.try_lock());
m.unlock();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(50000000)+ms(2000)); // within 50 ms
}
void fn17( boost::fibers::mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
m.lock();
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ms(2500)+ms(2000)); // within 2.5 ms
}
void fn18( boost::fibers::mutex & m) {
std::chrono::steady_clock::time_point t0 = std::chrono::steady_clock::now();
while (!m.try_lock()) ;
std::chrono::steady_clock::time_point t1 = std::chrono::steady_clock::now();
m.unlock();
ns d = t1 - t0 - ms(250);
BOOST_CHECK(d < ns(50000000)+ms(2000)); // within 50 ms
}
template< typename M >
struct test_lock {
typedef M mutex_type;
typedef typename std::unique_lock< M > lock_type;
void operator()() {
mutex_type mtx;
// Test the lock's constructors.
{
lock_type lk(mtx, std::defer_lock);
BOOST_CHECK(!lk);
}
lock_type lk(mtx);
BOOST_CHECK(lk ? true : false);
// Test the lock and unlock methods.
lk.unlock();
BOOST_CHECK(!lk);
lk.lock();
BOOST_CHECK(lk ? true : false);
}
};
template< typename M >
struct test_exclusive {
typedef M mutex_type;
typedef typename std::unique_lock< M > lock_type;
void operator()() {
value1 = 0;
value2 = 0;
BOOST_CHECK_EQUAL( 0, value1);
BOOST_CHECK_EQUAL( 0, value2);
mutex_type mtx;
boost::fibers::fiber f1( boost::fibers::launch::dispatch, & fn1< mutex_type >, std::ref( mtx) );
boost::fibers::fiber f2( boost::fibers::launch::dispatch, & fn2< mutex_type >, std::ref( mtx) );
BOOST_ASSERT( f1.joinable() );
BOOST_ASSERT( f2.joinable() );
f1.join();
f2.join();
BOOST_CHECK_EQUAL( 1, value1);
BOOST_CHECK_EQUAL( 2, value2);
}
};
template< typename M >
struct test_recursive_lock {
typedef M mutex_type;
typedef typename std::unique_lock< M > lock_type;
void operator()() {
mutex_type mx;
lock_type lock1(mx);
lock_type lock2(mx);
}
};
void do_test_mutex() {
test_lock< boost::fibers::mutex >()();
test_exclusive< boost::fibers::mutex >()();
{
boost::fibers::mutex mtx;
mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn17, std::ref( mtx) );
boost::this_fiber::sleep_for( ms(250) );
mtx.unlock();
f.join();
}
{
boost::fibers::mutex mtx;
mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn18, std::ref( mtx) );
boost::this_fiber::sleep_for( ms(250) );
mtx.unlock();
f.join();
}
}
void test_mutex() {
boost::fibers::fiber( boost::fibers::launch::dispatch, & do_test_mutex).join();
}
void do_test_recursive_mutex() {
test_lock< boost::fibers::recursive_mutex >()();
test_exclusive< boost::fibers::recursive_mutex >()();
test_recursive_lock< boost::fibers::recursive_mutex >()();
{
boost::fibers::recursive_mutex mtx;
mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn15, std::ref( mtx) );
boost::this_fiber::sleep_for( ms(250) );
mtx.unlock();
f.join();
}
{
boost::fibers::recursive_mutex mtx;
mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn16, std::ref( mtx) );
boost::this_fiber::sleep_for( ms(250) );
mtx.unlock();
f.join();
}
}
void test_recursive_mutex() {
boost::fibers::fiber( boost::fibers::launch::dispatch, do_test_recursive_mutex).join();
}
void do_test_timed_mutex() {
test_lock< boost::fibers::timed_mutex >()();
test_exclusive< boost::fibers::timed_mutex >()();
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn3, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn4, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn5, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn6, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(300) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn7, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn8, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(300) + ms(1000) );
timed_mtx.unlock();
f.join();
}
}
void test_timed_mutex() {
boost::fibers::fiber( boost::fibers::launch::dispatch, & do_test_timed_mutex).join();
}
void do_test_recursive_timed_mutex() {
test_lock< boost::fibers::recursive_timed_mutex >()();
test_exclusive< boost::fibers::recursive_timed_mutex >()();
test_recursive_lock< boost::fibers::recursive_timed_mutex >()();
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn9, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn10, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn11, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn12, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(400) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn13, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(250) );
timed_mtx.unlock();
f.join();
}
{
boost::fibers::recursive_timed_mutex timed_mtx;
timed_mtx.lock();
boost::fibers::fiber f( boost::fibers::launch::dispatch, & fn14, std::ref( timed_mtx) );
boost::this_fiber::sleep_for( ms(300) );
timed_mtx.unlock();
f.join();
}
}
void test_recursive_timed_mutex() {
boost::fibers::fiber( boost::fibers::launch::dispatch, & do_test_recursive_timed_mutex).join();
}
boost::unit_test::test_suite * init_unit_test_suite( int, char* []) {
boost::unit_test::test_suite * test =
BOOST_TEST_SUITE("Boost.Fiber: mutex test suite");
test->add( BOOST_TEST_CASE( & test_mutex) );
test->add( BOOST_TEST_CASE( & test_recursive_mutex) );
test->add( BOOST_TEST_CASE( & test_timed_mutex) );
test->add( BOOST_TEST_CASE( & test_recursive_timed_mutex) );
return test;
}
|
