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
|
//===----------------------------------------------------------------------===//
//
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
// See https://llvm.org/LICENSE.txt for license information.
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
//
//===----------------------------------------------------------------------===//
//
// UNSUPPORTED: no-threads
// ALLOW_RETRIES: 2
// <condition_variable>
// class condition_variable_any;
// template <class Lock, class Predicate>
// void wait(Lock& lock, Predicate pred);
#include <condition_variable>
#include <mutex>
#include <thread>
#include <functional>
#include <cassert>
#include "make_test_thread.h"
#include "test_macros.h"
std::condition_variable_any cv;
typedef std::timed_mutex L0;
typedef std::unique_lock<L0> L1;
L0 m0;
int test1 = 0;
int test2 = 0;
class Pred
{
int& i_;
public:
explicit Pred(int& i) : i_(i) {}
bool operator()() {return i_ != 0;}
};
void f()
{
L1 lk(m0);
assert(test2 == 0);
test1 = 1;
cv.notify_one();
cv.wait(lk, Pred(test2));
assert(test2 != 0);
}
int main(int, char**)
{
L1 lk(m0);
std::thread t = support::make_test_thread(f);
assert(test1 == 0);
while (test1 == 0)
cv.wait(lk);
assert(test1 != 0);
test2 = 1;
lk.unlock();
cv.notify_one();
t.join();
return 0;
}
|
