2010-05-11 21:42:16 +02:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2010-05-11 23:36:01 +02:00
|
|
|
// The LLVM Compiler Infrastructure
|
2010-05-11 21:42:16 +02:00
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
// <mutex>
|
|
|
|
|
|
|
|
// class recursive_timed_mutex;
|
|
|
|
|
|
|
|
// template <class Clock, class Duration>
|
|
|
|
// bool try_lock_until(const chrono::time_point<Clock, Duration>& abs_time);
|
|
|
|
|
|
|
|
#include <mutex>
|
|
|
|
#include <thread>
|
|
|
|
#include <cstdlib>
|
|
|
|
#include <cassert>
|
|
|
|
|
|
|
|
std::recursive_timed_mutex m;
|
|
|
|
|
|
|
|
typedef std::chrono::monotonic_clock Clock;
|
|
|
|
typedef Clock::time_point time_point;
|
|
|
|
typedef Clock::duration duration;
|
|
|
|
typedef std::chrono::milliseconds ms;
|
|
|
|
typedef std::chrono::nanoseconds ns;
|
|
|
|
|
|
|
|
void f1()
|
|
|
|
{
|
|
|
|
time_point t0 = Clock::now();
|
|
|
|
assert(m.try_lock_until(Clock::now() + ms(300)) == true);
|
|
|
|
time_point t1 = Clock::now();
|
|
|
|
assert(m.try_lock());
|
|
|
|
m.unlock();
|
|
|
|
m.unlock();
|
|
|
|
ns d = t1 - t0 - ms(250);
|
|
|
|
assert(d < ns(5000000)); // within 5ms
|
|
|
|
}
|
|
|
|
|
|
|
|
void f2()
|
|
|
|
{
|
|
|
|
time_point t0 = Clock::now();
|
|
|
|
assert(m.try_lock_until(Clock::now() + ms(250)) == false);
|
|
|
|
time_point t1 = Clock::now();
|
|
|
|
ns d = t1 - t0 - ms(250);
|
|
|
|
assert(d < ns(5000000)); // within 5ms
|
|
|
|
}
|
|
|
|
|
|
|
|
int main()
|
|
|
|
{
|
|
|
|
{
|
|
|
|
m.lock();
|
|
|
|
std::thread t(f1);
|
|
|
|
std::this_thread::sleep_for(ms(250));
|
|
|
|
m.unlock();
|
|
|
|
t.join();
|
|
|
|
}
|
|
|
|
{
|
|
|
|
m.lock();
|
|
|
|
std::thread t(f2);
|
|
|
|
std::this_thread::sleep_for(ms(300));
|
|
|
|
m.unlock();
|
|
|
|
t.join();
|
|
|
|
}
|
|
|
|
}
|