You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
96 lines
2.0 KiB
C++
96 lines
2.0 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: libcpp-has-no-threads
|
|
|
|
// FLAKY_TEST.
|
|
|
|
// <condition_variable>
|
|
|
|
// class condition_variable_any;
|
|
|
|
// template <class Lock, class Rep, class Period>
|
|
// cv_status
|
|
// wait_for(Lock& lock, const chrono::duration<Rep, Period>& rel_time);
|
|
|
|
#include <condition_variable>
|
|
#include <mutex>
|
|
#include <thread>
|
|
#include <chrono>
|
|
#include <cassert>
|
|
|
|
#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;
|
|
|
|
int runs = 0;
|
|
|
|
void f()
|
|
{
|
|
typedef std::chrono::system_clock Clock;
|
|
typedef std::chrono::milliseconds milliseconds;
|
|
L1 lk(m0);
|
|
assert(test2 == 0);
|
|
test1 = 1;
|
|
cv.notify_one();
|
|
Clock::time_point t0 = Clock::now();
|
|
while (test2 == 0 &&
|
|
cv.wait_for(lk, milliseconds(250)) == std::cv_status::no_timeout)
|
|
;
|
|
Clock::time_point t1 = Clock::now();
|
|
if (runs == 0)
|
|
{
|
|
assert(t1 - t0 < milliseconds(250));
|
|
assert(test2 != 0);
|
|
}
|
|
else
|
|
{
|
|
assert(t1 - t0 - milliseconds(250) < milliseconds(50));
|
|
assert(test2 == 0);
|
|
}
|
|
++runs;
|
|
}
|
|
|
|
int main(int, char**)
|
|
{
|
|
{
|
|
L1 lk(m0);
|
|
std::thread t(f);
|
|
assert(test1 == 0);
|
|
while (test1 == 0)
|
|
cv.wait(lk);
|
|
assert(test1 != 0);
|
|
test2 = 1;
|
|
lk.unlock();
|
|
cv.notify_one();
|
|
t.join();
|
|
}
|
|
test1 = 0;
|
|
test2 = 0;
|
|
{
|
|
L1 lk(m0);
|
|
std::thread t(f);
|
|
assert(test1 == 0);
|
|
while (test1 == 0)
|
|
cv.wait(lk);
|
|
assert(test1 != 0);
|
|
lk.unlock();
|
|
t.join();
|
|
}
|
|
|
|
return 0;
|
|
}
|