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.
56 lines
1.1 KiB
C++
56 lines
1.1 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.
|
|
|
|
// <mutex>
|
|
|
|
// class recursive_timed_mutex;
|
|
|
|
// void lock();
|
|
|
|
#include <mutex>
|
|
#include <thread>
|
|
#include <cstdlib>
|
|
#include <cassert>
|
|
|
|
#include "test_macros.h"
|
|
|
|
std::recursive_timed_mutex m;
|
|
|
|
typedef std::chrono::system_clock Clock;
|
|
typedef Clock::time_point time_point;
|
|
typedef Clock::duration duration;
|
|
typedef std::chrono::milliseconds ms;
|
|
typedef std::chrono::nanoseconds ns;
|
|
|
|
void f()
|
|
{
|
|
time_point t0 = Clock::now();
|
|
m.lock();
|
|
time_point t1 = Clock::now();
|
|
m.lock();
|
|
m.unlock();
|
|
m.unlock();
|
|
ns d = t1 - t0 - ms(250);
|
|
assert(d < ms(50)); // within 50ms
|
|
}
|
|
|
|
int main(int, char**)
|
|
{
|
|
m.lock();
|
|
std::thread t(f);
|
|
std::this_thread::sleep_for(ms(250));
|
|
m.unlock();
|
|
t.join();
|
|
|
|
return 0;
|
|
}
|