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
|
//===----------------------------------------------------------------------===//
//
// 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
// UNSUPPORTED: c++03, c++11, c++14, c++17
// XFAIL: availability-synchronization_library-missing
// This is a regression test for https://llvm.org/PR47013.
// <semaphore>
#include <barrier>
#include <semaphore>
#include <thread>
#include <vector>
#include "make_test_thread.h"
static std::counting_semaphore<> s(0);
static std::barrier<> b(8 + 1);
void acquire() {
for (int i = 0; i < 10'000; ++i) {
s.acquire();
b.arrive_and_wait();
}
}
void release() {
for (int i = 0; i < 10'000; ++i) {
s.release(1);
s.release(1);
s.release(1);
s.release(1);
s.release(1);
s.release(1);
s.release(1);
s.release(1);
b.arrive_and_wait();
}
}
int main(int, char**) {
for (int run = 0; run < 20; ++run) {
std::vector<std::thread> threads;
for (int i = 0; i < 8; ++i)
threads.push_back(support::make_test_thread(acquire));
threads.push_back(support::make_test_thread(release));
for (auto& thread : threads)
thread.join();
}
return 0;
}
|
