-
Notifications
You must be signed in to change notification settings - Fork 20
/
channel_test.cpp
729 lines (589 loc) · 14.3 KB
/
channel_test.cpp
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
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
#include <channel>
#include <functional>
#include <array>
#include <gtest/gtest.h>
// N is the number of philosophers, traditionally five
// For comparison, here's the equivalent machine-readable
// CSP code of ChannelTest::DiningPhilosophersDeadlockFree:
//
// N = 5
//
// FORK_ID = {0..N-1}
// PHIL_ID = {0..N-1}
//
// channel picksup, putsdown:FORK_ID.PHIL_ID
//
// PHIL(i) = picksup!i!i -> picksup!((i+1)%N)!i ->
// putsdown!((i+1)%N)!i -> putsdown!i!i -> PHIL(i)
//
// FORK(i) = picksup!i?j -> putsdown!i!j -> FORK(i)
//
// LPHIL(i) = picksup!((i+1)%N)!i -> picksup!i!i ->
// putsdown!((i+1)%N)!i -> putsdown!i!i -> LPHIL(i)
//
// PHILS' = ||| i:PHIL_ID @ if i==0 then LPHIL(0) else PHIL(i)
//
// SYSTEM = PHILS'[|{|picksup, putsdown|}|]FORKS
template<size_t N>
struct dining_table
{
std::array<cpp::channel<size_t>, N> picksup;
std::array<cpp::channel<size_t>, N> putsdown;
};
// Allow fork to be used twice, so it can be picked up and
// put down by the person to the fork's right and left
template<size_t N>
void phil_fork(size_t i, dining_table<N>& t)
{
t.picksup.at(i).recv();
t.putsdown.at(i).recv();
t.picksup.at(i).recv();
t.putsdown.at(i).recv();
}
// Picks up left and then right fork;
// finally, puts down both forks
template<size_t N>
void phil_person(size_t i, dining_table<N>& t)
{
t.picksup.at(i).send(i);
t.picksup.at((i + 1) % N).send(i);
t.putsdown.at(i).send(i);
t.putsdown.at((i + 1) % N).send(i);
}
// Picks up right fork then left fork;
// finally, puts down both forks
template<size_t N>
void phil_different_person(size_t i, dining_table<N>& t)
{
t.picksup.at((i + 1) % N).send(i);
t.picksup.at(i).send(i);
t.putsdown.at(i).send(i);
t.putsdown.at((i + 1) % N).send(i);
}
TEST(ChannelTest, DiningPhilosophersDeadlockFree)
{
constexpr size_t N = 5;
dining_table<N> t;
std::thread forks[N];
std::thread phils[N];
for (int i = 0; i < N; i++)
{
forks[i] = std::thread(phil_fork<N>, i, std::ref(t));
// asymmetric philosophers solution to prevent deadlock
if (i == 0)
phils[i] = std::thread(phil_different_person<N>, i, std::ref(t));
else
phils[i] = std::thread(phil_person<N>, i, std::ref(t));
}
// terminate cleanly
for (int i = 0; i < N; i++)
{
forks[i].join();
phils[i].join();
}
}
// Send the sequence 2, 3, 4, ..., N to channel 'c'
template<size_t N>
void generate_numbers(cpp::ochannel<unsigned> c)
{
unsigned i = 2;
for (unsigned i = 2; i <= N; i++)
{
c.send(i);
}
}
// Copy number n from channel 'in' to channel 'out' if and
// only if n is not divisible by 'prime' and n < N.
template<size_t N>
void filter_numbers(
cpp::ichannel<unsigned> in,
cpp::ochannel<unsigned> out,
const unsigned prime)
{
unsigned i;
do
{
i = in.recv();
if (i % prime != 0)
out.send(i);
}
while (i < N);
}
// The prime sieve up to N: daisy-chain threads together
template<size_t N>
void sieve_numbers(cpp::channel<unsigned> primes)
{
cpp::channel<unsigned> c;
std::vector<std::thread> threads;
threads.emplace_back(generate_numbers<N>, c);
unsigned prime;
for (;;)
{
prime = c.recv();
primes.send(prime);
if (prime >= N)
break;
cpp::channel<unsigned> c_prime;
threads.emplace_back(filter_numbers<N>, c, c_prime, prime);
c = c_prime;
}
for (std::thread& thread : threads)
thread.join();
}
// Classical inefficient concurrent prime sieve
//
// \see http://blog.onideas.ws/eratosthenes.go
// \see http://golang.org/test/chan/sieve1.go
TEST(ChannelTest, Sieve)
{
constexpr unsigned N = 97;
cpp::channel<unsigned> primes;
std::thread sieve(sieve_numbers<N>, primes);
cpp::thread_guard sieve_guard(sieve);
std::vector<unsigned> expected = {2, 3, 5, 7, 11, 13, 17, 19, 23,
29, 31, 37, 41, 43, 47, 53, 59,
61, 67, 71, 73, 79, 83, 89, N};
for (unsigned expect : expected)
{
unsigned actual = primes.recv();
EXPECT_EQ(expect, actual);
}
}
void thread_a(cpp::channel<char> c)
{
c.send('A');
const char r = c.recv();
EXPECT_EQ('B', r);
}
void thread_b(cpp::channel<char> c)
{
char r = c.recv();
c.send('B');
EXPECT_EQ('A', r);
}
TEST(ChannelTest, SenderReceiver)
{
cpp::channel<char> c;
std::thread a(thread_a, c);
cpp::thread_guard a_guard(a);
std::thread b(thread_b, c);
cpp::thread_guard b_guard(b);
}
void sender_thread_a(cpp::channel<char> c)
{
c.send('A');
}
void sender_thread_b(cpp::channel<char> c)
{
c.send('B');
}
void receiver_thread_a(cpp::channel<char> c)
{
char r = c.recv();
EXPECT_TRUE(r == 'A' || r == 'B');
}
void receiver_thread_b(cpp::channel<char> c)
{
char r = c.recv();
EXPECT_TRUE(r == 'A' || r == 'B');
}
TEST(ChannelTest, SenderReceiverWithMultipleChannels)
{
cpp::channel<char> c;
std::thread sa(sender_thread_a, c);
cpp::thread_guard sa_guard(sa);
std::thread sb(sender_thread_b, c);
cpp::thread_guard sb_guard(sb);
std::thread ra(receiver_thread_a, c);
cpp::thread_guard ra_guard(ra);
std::thread rb(receiver_thread_a, c);
cpp::thread_guard rb_guard(rb);
}
TEST(ChannelTest, Copy)
{
cpp::channel<int> c;
cpp::channel<int> d(c);
EXPECT_EQ(c, d);
}
TEST(ChannelTest, Assignment)
{
cpp::channel<int> c;
cpp::channel<int> d;
EXPECT_NE(c, d);
d = c;
EXPECT_EQ(c, d);
}
TEST(ChannelTest, Cast)
{
cpp::channel<int> c;
cpp::ichannel<int> d(c);
cpp::ochannel<int> e(c);
EXPECT_EQ(c, d);
EXPECT_EQ(d, c);
EXPECT_EQ(c, e);
EXPECT_EQ(e, c);
}
TEST(ChannelTest, AssignmentWithCast)
{
cpp::channel<int> c;
cpp::ichannel<int> d(c);
cpp::ochannel<int> e(c);
d = c;
e = c;
EXPECT_EQ(c, d);
EXPECT_EQ(d, c);
EXPECT_EQ(c, e);
EXPECT_EQ(e, c);
}
void sender(cpp::channel<int> c)
{
c.send(7);
}
void receiver(cpp::channel<int> c, bool& done)
{
int r = c.recv();
EXPECT_EQ(7, r);
done = true;
}
TEST(ChannelTest, Channel)
{
bool done = false;
cpp::channel<int> c;
std::thread f(sender, c);
std::thread g(receiver, c, std::ref(done));
f.join();
g.join();
EXPECT_TRUE(done);
}
void out(cpp::ochannel<int> c)
{
c.send(7);
}
void in(cpp::ichannel<int> c, bool& done)
{
int r = c.recv();
EXPECT_EQ(7, r);
done = true;
}
TEST(ChannelTest, DirectedChannel)
{
bool done = false;
cpp::channel<int> c;
std::thread f(out, c);
std::thread g(in, c, std::ref(done));
f.join();
g.join();
EXPECT_TRUE(done);
}
void higher_order(cpp::ichannel<cpp::channel<bool>> c)
{
cpp::channel<bool> done(c.recv());
done.send(true);
}
TEST(ChannelTest, HigherOrderChannel)
{
cpp::channel<cpp::channel<bool>> c;
cpp::channel<bool> done;
std::thread f(higher_order, c);
cpp::thread_guard f_guard(f);
c.send(done);
EXPECT_TRUE(done.recv());
}
void higher_order_with_cast(cpp::ichannel<cpp::channel<bool>> c)
{
cpp::ochannel<bool> done(c.recv());
done.send(true);
}
TEST(ChannelTest, HigherOrderChannelWithCast)
{
cpp::channel<cpp::channel<bool>> c;
cpp::channel<bool> done;
std::thread f(higher_order_with_cast, c);
cpp::thread_guard f_guard(f);
c.send(done);
EXPECT_TRUE(done.recv());
}
// Unless told by noexcept, the compiler doesn't
// know that this is an exception safe class
struct int_wrapper
{
int i;
explicit int_wrapper(int j)
: i(j) {}
int_wrapper(const int_wrapper& other)
: i(other.i) {}
};
void foo_sender(cpp::channel<int_wrapper> c)
{
c.send(int_wrapper(7));
}
void foo_receiver(cpp::channel<int_wrapper> c, bool& done)
{
std::unique_ptr<int_wrapper> foo_ptr(c.recv_ptr());
EXPECT_EQ(7, foo_ptr->i);
done = true;
}
// use channel<T>::recv_ptr()
TEST(ChannelTest, ExceptionUnsafeClassWithPtr)
{
bool done = false;
cpp::channel<int_wrapper> c;
std::thread f(foo_sender, c);
std::thread g(foo_receiver, c, std::ref(done));
f.join();
g.join();
EXPECT_TRUE(done);
}
void bar_sender(cpp::channel<int_wrapper> c)
{
c.send(int_wrapper(7));
}
void bar_receiver(cpp::channel<int_wrapper> c, bool& done)
{
int_wrapper foo(0);
c.recv(foo);
EXPECT_EQ(7, foo.i);
done = true;
}
// use channel<T>::recv(T&)
TEST(ChannelTest, ExceptionUnsafeClassWithArg)
{
bool done = false;
cpp::channel<int_wrapper> c;
std::thread f(bar_sender, c);
std::thread g(bar_receiver, c, std::ref(done));
f.join();
g.join();
EXPECT_TRUE(done);
}
void receive_buffered_chars(cpp::channel<char, 3> c)
{
// nonblocking, elements are received
// in the order they are sent
char char_a(c.recv());
char char_b(c.recv());
char char_c(c.recv());
EXPECT_EQ('A', char_a);
EXPECT_EQ('B', char_b);
EXPECT_EQ('C', char_c);
}
TEST(ChannelTest, InterThreadAsynchronousChannel)
{
cpp::channel<char, 3> c;
// nonblocking
c.send('A');
c.send('B');
c.send('C');
// receive elements in another thread
std::thread f(receive_buffered_chars, c);
cpp::thread_guard f_guard(f);
}
TEST(ChannelTest, IntraThreadAsynchronousChannel)
{
cpp::channel<char, 3> c;
// nonblocking
c.send('A');
c.send('B');
c.send('C');
char char_a(c.recv());
char char_b(c.recv());
char char_c(c.recv());
EXPECT_EQ('A', char_a);
EXPECT_EQ('B', char_b);
EXPECT_EQ('C', char_c);
}
template<char Last>
void send_chars(cpp::ochannel<char> out)
{
for (char i = 'A'; i <= Last; i++)
out.send(i);
}
TEST(ChannelTest, SelectRecv)
{
cpp::channel<char> c;
cpp::ichannel<char> in(c);
char i = '\0';
std::thread a(send_chars<'F'>, c);
cpp::thread_guard a_guard(a);
cpp::select().recv_only(c, i).wait();
EXPECT_EQ('A', i);
cpp::select().recv(c, i, [](){}).wait();
EXPECT_EQ('B', i);
cpp::select().recv_only(in, i).wait();
EXPECT_EQ('C', i);
cpp::select().recv(in, i, [](){}).wait();
EXPECT_EQ('D', i);
cpp::select().recv(c, [&i](const char k) { i = k; }).wait();
EXPECT_EQ('E', i);
cpp::select().recv(in, [&i](const char k) { i = k; }).wait();
EXPECT_EQ('F', i);
}
// N is the number of elements to receive, these are then stored in 'chars'
template<size_t N>
void recv_chars(cpp::ichannel<char> in, std::vector<char>& chars)
{
for(size_t i = 0; i < N; i++)
chars.push_back(in.recv());
}
TEST(ChannelTest, SelectSend)
{
constexpr size_t N = 8;
cpp::channel<char> c;
cpp::ochannel<char> out(c);
std::vector<char> chars;
unsigned i = 0;
std::thread a(recv_chars<N>, c, std::ref(chars));
cpp::thread_guard a_guard(a);
cpp::select().send_only(c, 'A').wait();
char char_b = 'B';
cpp::select().send_only(c, char_b).wait();
cpp::select().send_only(out, 'C').wait();
char char_d = 'D';
cpp::select().send_only(out, char_d).wait();
cpp::select().send(c, 'E', [&i](){ i++; }).wait();
EXPECT_EQ(1, i);
char char_f = 'F';
cpp::select().send(c, char_f, [&i](){ i++; }).wait();
EXPECT_EQ(2, i);
cpp::select().send(out, 'G', [&i](){ i++; }).wait();
EXPECT_EQ(3, i);
char char_h = 'H';
cpp::select().send(out, char_h, [&i](){ i++; }).wait();
EXPECT_EQ(4, i);
a.join();
EXPECT_EQ(N, chars.size());
for (size_t i = 0; i < N; i++)
EXPECT_EQ('A' + i, chars.at(i));
}
// \see http://golang.org/test/chan/select4.go
TEST(ChannelTest, SelectOnlyAvailable)
{
constexpr size_t N = 8;
cpp::channel<unsigned, 1> c;
cpp::channel<unsigned> c_prime;
c.send(42);
unsigned v = 0;
cpp::select select;
select.recv(c_prime, [](const unsigned k){ throw "Bug"; });
select.recv_only(c, v);
select.wait();
EXPECT_EQ(42, v);
}
void select_deque_1(cpp::ichannel<bool> c1)
{
c1.recv();
}
void select_deque_2(
cpp::ichannel<bool> c1,
cpp::ichannel<bool> c2,
cpp::ochannel<bool> c3)
{
cpp::select select;
select.recv(c1, [](const bool k){ throw "Bug"; });
select.recv(c2, [&c3](const bool k){ c3.send(true); });
select.wait();
c1.recv();
}
void select_deque_3(cpp::ochannel<bool> c2)
{
c2.send(true);
}
// \see http://golang.org/test/chan/select6.go
// \see http://code.google.com/p/go/issues/detail?id=2075
TEST(ChannelTest, SelectDeque)
{
cpp::channel<bool> c1;
cpp::channel<bool> c2;
cpp::channel<bool> c3;
std::thread t1(select_deque_1, c1);
cpp::thread_guard t1_guard(t1);
std::thread t2(select_deque_2, c1, c2, c3);
cpp::thread_guard t2_guard(t2);
std::thread t3(select_deque_3, c2);
cpp::thread_guard t3_guard(t3);
c3.recv();
c1.send(true);
c1.send(true);
}
void discard_recv1(cpp::ichannel<int> c)
{
c.recv();
}
void discard_recv2(cpp::ichannel<int> c)
{
int k;
cpp::select().recv_only(c, k).wait();
}
void discard_recv3(cpp::ichannel<int> c)
{
cpp::channel<int> c2;
int k;
cpp::select().recv_only(c, k).recv_only(c2, k).wait();
}
template<class Recv>
void discard_send1(Recv f)
{
cpp::channel<int> c;
std::thread t(f, c);
cpp::thread_guard t_guard(t);
c.send(1);
}
template<class Recv>
void discard_send2(Recv f)
{
cpp::channel<int> c;
std::thread t(f, c);
cpp::thread_guard t_guard(t);
cpp::select().send_only(c, 1).wait();
}
template<class Recv>
void discard_send3(Recv f)
{
cpp::channel<int> c;
std::thread t(f, c);
cpp::thread_guard t_guard(t);
cpp::channel<int> c2;
cpp::select().send_only(c, 1).send_only(c2, 1).wait();
}
// \see http://golang.org/test/chan/select7.go
// TODO: support the case where both ends of a channel are inside a select
TEST(ChannelTest, SelectDiscard)
{
discard_send1(discard_recv1);
discard_send2(discard_recv1);
discard_send3(discard_recv1);
discard_send1(discard_recv2);
// discard_send2(discard_recv2);
// discard_send3(discard_recv2);
discard_send1(discard_recv3);
// discard_send2(discard_recv3);
// discard_send3(discard_recv3);
}
TEST(ChannelTest, SelectWaitSleep)
{
// This test verifies that the semantics of the wait
// do not get changed by optional sleep argument
cpp::channel<char> c;
cpp::ichannel<char> in(c);
char i = '\0';
// Various durations. Hours and minutes bypassed because we don't
// want the test take too long
std::chrono::nanoseconds sleepNano(20);
std::chrono::microseconds sleepMicro(20);
std::chrono::milliseconds sleepMilli(20);
std::chrono::seconds sleepSeconds(1);
std::thread a(send_chars<'F'>, c);
cpp::thread_guard a_guard(a);
cpp::select().recv_only(c, i).wait(sleepNano);
EXPECT_EQ('A', i);
cpp::select().recv(c, i, [](){}).wait(sleepMicro);
EXPECT_EQ('B', i);
cpp::select().recv_only(in, i).wait(sleepMilli);
EXPECT_EQ('C', i);
cpp::select().recv(in, i, [](){}).wait(sleepSeconds);
EXPECT_EQ('D', i);
cpp::select().recv(c, [&i](const char k) { i = k; }).wait(sleepNano);
EXPECT_EQ('E', i);
cpp::select().recv(in, [&i](const char k) { i = k; }).wait(sleepNano);
EXPECT_EQ('F', i);
}