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
|
//===----------------------------------------------------------------------===//
//
// The LLVM Compiler Infrastructure
//
// This file is dual licensed under the MIT and the University of Illinois Open
// Source Licenses. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
// <condition_variable>
// class condition_variable;
// void notify_one();
#include <condition_variable>
#include <mutex>
#include <thread>
#include <cassert>
std::condition_variable cv;
std::mutex mut;
int test0 = 0;
int test1 = 0;
int test2 = 0;
void f1()
{
std::unique_lock<std::mutex> lk(mut);
assert(test1 == 0);
while (test1 == 0)
cv.wait(lk);
assert(test1 == 1);
test1 = 2;
}
void f2()
{
std::unique_lock<std::mutex> lk(mut);
assert(test2 == 0);
while (test2 == 0)
cv.wait(lk);
assert(test2 == 1);
test2 = 2;
}
int main()
{
std::thread t1(f1);
std::thread t2(f2);
std::this_thread::sleep_for(std::chrono::milliseconds(100));
{
std::unique_lock<std::mutex>lk(mut);
test1 = 1;
test2 = 1;
}
cv.notify_one();
{
std::this_thread::sleep_for(std::chrono::milliseconds(100));
std::unique_lock<std::mutex>lk(mut);
}
if (test1 == 2)
{
t1.join();
test1 = 0;
}
else if (test2 == 2)
{
t2.join();
test2 = 0;
}
else
assert(false);
cv.notify_one();
{
std::this_thread::sleep_for(std::chrono::milliseconds(100));
std::unique_lock<std::mutex>lk(mut);
}
if (test1 == 2)
{
t1.join();
test1 = 0;
}
else if (test2 == 2)
{
t2.join();
test2 = 0;
}
else
assert(false);
}
|
