This patch removes many annotations that are not relevant anymore since we don't support or test back-deploying to macOS < 10.13. It also cleans up raw usage of target triples to identify versions of dylibs shipped on prior versions of macOS, and uses the target-agnostic Lit features instead. Finally, it reorders both the Lit backdeployment features and the corresponding availability macros in the library in a way that makes more sense, and reformulates the Lit backdeployment features in terms of when a version of LLVM was introduced instead of encoding the system versions on which it hasn't been introduced yet. Although one can be derived from the other, encoding the negative form is extremely error-prone. Fixes #80901
66 lines
1.7 KiB
C++
66 lines
1.7 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// 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
|
|
|
|
// This test requires the fix for http://llvm.org/PR38682 (616ef1863fae). We mark the
|
|
// test as UNSUPPORTED instead of XFAIL because the test doesn't fail consistently.
|
|
// UNSUPPORTED: using-built-library-before-llvm-10
|
|
|
|
// This test is designed to cause and allow TSAN to detect a race condition
|
|
// in std::async, as reported in https://llvm.org/PR38682.
|
|
|
|
#include <cassert>
|
|
#include <functional>
|
|
#include <future>
|
|
#include <numeric>
|
|
#include <vector>
|
|
|
|
#include "test_macros.h"
|
|
|
|
|
|
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(int, char**) {
|
|
// 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();
|
|
}
|
|
}
|
|
|
|
return 0;
|
|
}
|