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
|
//===----------------------------------------------------------------------===//
//
// 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: libcpp-has-no-threads
// UNSUPPORTED: c++03, c++11
// XFAIL: dylib-has-no-shared_mutex
// <shared_mutex>
// class shared_timed_mutex;
// template <class Clock, class Duration>
// shared_lock(mutex_type& m, const chrono::time_point<Clock, Duration>& abs_time);
#include <shared_mutex>
#include <thread>
#include <vector>
#include <cstdlib>
#include <cassert>
#include "test_macros.h"
std::shared_timed_mutex m;
typedef std::chrono::steady_clock Clock;
typedef Clock::time_point time_point;
typedef Clock::duration duration;
typedef std::chrono::milliseconds ms;
typedef std::chrono::nanoseconds ns;
ms LongTime = ms(5000);
ms ShortTime = ms(50);
static constexpr unsigned Threads = 5;
std::atomic<unsigned> CountDown(Threads);
void f1()
{
--CountDown;
time_point t0 = Clock::now();
std::shared_lock<std::shared_timed_mutex> lk(m, t0 + LongTime);
time_point t1 = Clock::now();
assert(lk.owns_lock() == true);
assert(t1 - t0 <= LongTime);
}
void f2()
{
time_point t0 = Clock::now();
std::shared_lock<std::shared_timed_mutex> lk(m, t0 + ShortTime);
time_point t1 = Clock::now();
assert(lk.owns_lock() == false);
assert(t1 - t0 >= ShortTime);
}
int main(int, char**)
{
{
m.lock();
std::vector<std::thread> v;
for (unsigned i = 0; i < Threads; ++i)
v.push_back(std::thread(f1));
while (CountDown > 0)
std::this_thread::yield();
std::this_thread::sleep_for(ShortTime);
m.unlock();
for (auto& t : v)
t.join();
}
{
m.lock();
std::vector<std::thread> v;
for (unsigned i = 0; i < Threads; ++i)
v.push_back(std::thread(f2));
for (auto& t : v)
t.join();
m.unlock();
}
return 0;
}
|
