blob: 6e537048be6e6b940aa482aae296bfabb53c0717 [file] [log] [blame]
//===----------------------------------------------------------------------===//
//
// 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
// ALLOW_RETRIES: 2
// UNSUPPORTED: availability-shared_mutex-missing
// <shared_mutex>
// class shared_timed_mutex;
// template <class Clock, class Duration>
// bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
#include <shared_mutex>
#include <thread>
#include <cstdlib>
#include <cassert>
#include "make_test_thread.h"
#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 WaitTime = ms(250);
// Thread sanitizer causes more overhead and will sometimes cause this test
// to fail. To prevent this we give Thread sanitizer more time to complete the
// test.
#if !defined(TEST_IS_EXECUTED_IN_A_SLOW_ENVIRONMENT)
ms Tolerance = ms(50);
#else
ms Tolerance = ms(50 * 5);
#endif
void f1()
{
time_point t0 = Clock::now();
assert(m.try_lock_until(Clock::now() + WaitTime + Tolerance) == true);
time_point t1 = Clock::now();
m.unlock();
ns d = t1 - t0 - WaitTime;
assert(d < Tolerance); // within tolerance
}
void f2()
{
time_point t0 = Clock::now();
assert(m.try_lock_until(Clock::now() + WaitTime) == false);
time_point t1 = Clock::now();
ns d = t1 - t0 - WaitTime;
assert(d < Tolerance); // within tolerance
}
int main(int, char**)
{
{
m.lock();
std::thread t = support::make_test_thread(f1);
std::this_thread::sleep_for(WaitTime);
m.unlock();
t.join();
}
{
m.lock();
std::thread t = support::make_test_thread(f2);
std::this_thread::sleep_for(WaitTime + Tolerance);
m.unlock();
t.join();
}
return 0;
}