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
|
//===----------------------------------------------------------------------===//
//
// 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.
//
//===----------------------------------------------------------------------===//
//
// UNSUPPORTED: libcpp-has-no-threads
// UNSUPPORTED: c++98, c++03
// This test is designed to cause and allow TSAN to detect a race condition
// in std::async, as reported in https://bugs.llvm.org/show_bug.cgi?id=38682.
#include <cassert>
#include <functional>
#include <future>
#include <numeric>
#include <vector>
static int worker(std::vector<int> const& data) {
return std::accumulate(data.begin(), data.end(), 0);
}
static int& worker_ref(int& i) { return i; }
static void worker_void() { }
int main() {
// future<T>
{
std::vector<int> const v{1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
for (int i = 0; i != 20; ++i) {
std::future<int> fut = std::async(std::launch::async, worker, v);
int answer = fut.get();
assert(answer == 55);
}
}
// future<T&>
{
for (int i = 0; i != 20; ++i) {
std::future<int&> fut = std::async(std::launch::async, worker_ref, std::ref(i));
int& answer = fut.get();
assert(answer == i);
}
}
// future<void>
{
for (int i = 0; i != 20; ++i) {
std::future<void> fut = std::async(std::launch::async, worker_void);
fut.get();
}
}
}
|
