//===----------------------------------------------------------------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // class condition_variable; // template // bool // wait_until(unique_lock& lock, // const chrono::time_point& abs_time, // Predicate pred); #include #include #include #include #include struct Clock { typedef std::chrono::milliseconds duration; typedef duration::rep rep; typedef duration::period period; typedef std::chrono::time_point time_point; static const bool is_monotonic = true; static time_point now() { using namespace std::chrono; return time_point(duration_cast( monotonic_clock::now().time_since_epoch() )); } }; class Pred { int& i_; public: explicit Pred(int& i) : i_(i) {} bool operator()() {return i_ != 0;} }; std::condition_variable cv; std::mutex mut; int test1 = 0; int test2 = 0; int runs = 0; void f() { std::unique_lock lk(mut); assert(test2 == 0); test1 = 1; cv.notify_one(); Clock::time_point t0 = Clock::now(); Clock::time_point t = t0 + Clock::duration(250); bool r = cv.wait_until(lk, t, Pred(test2)); Clock::time_point t1 = Clock::now(); if (runs == 0) { assert(t1 - t0 < Clock::duration(250)); assert(test2 != 0); assert(r); } else { assert(t1 - t0 - Clock::duration(250) < Clock::duration(2)); assert(test2 == 0); assert(!r); } ++runs; } int main() { { std::unique_locklk(mut); 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; { std::unique_locklk(mut); std::thread t(f); assert(test1 == 0); while (test1 == 0) cv.wait(lk); assert(test1 != 0); lk.unlock(); t.join(); } }