// Copyright (C) 2014 Ian Forbed // Copyright (C) 2014-2017 Vicente J. Botet Escriba // // Distributed under the Boost Software License, Version 1.0. (See accompanying // file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt) // #ifndef BOOST_THREAD_SYNC_TIMED_QUEUE_HPP #define BOOST_THREAD_SYNC_TIMED_QUEUE_HPP #include #include #include #include #include #include #include // std::min #include namespace boost { namespace concurrent { namespace detail { // fixme: shouldn't the timepoint be configurable template struct scheduled_type { typedef T value_type; typedef Clock clock; typedef TimePoint time_point; T data; time_point time; BOOST_THREAD_COPYABLE_AND_MOVABLE(scheduled_type) scheduled_type(T const& pdata, time_point tp) : data(pdata), time(tp) {} scheduled_type(BOOST_THREAD_RV_REF(T) pdata, time_point tp) : data(boost::move(pdata)), time(tp) {} scheduled_type(scheduled_type const& other) : data(other.data), time(other.time) {} scheduled_type& operator=(BOOST_THREAD_COPY_ASSIGN_REF(scheduled_type) other) { data = other.data; time = other.time; return *this; } scheduled_type(BOOST_THREAD_RV_REF(scheduled_type) other) : data(boost::move(other.data)), time(other.time) {} scheduled_type& operator=(BOOST_THREAD_RV_REF(scheduled_type) other) { data = boost::move(other.data); time = other.time; return *this; } bool operator <(const scheduled_type & other) const { return this->time > other.time; } }; //end struct template chrono::time_point limit_timepoint(chrono::time_point const& tp) { // Clock == chrono::steady_clock return tp; } template chrono::time_point limit_timepoint(chrono::time_point const& tp) { // Clock != chrono::steady_clock // The system time may jump while wait_until() is waiting. To compensate for this and time out near // the correct time, we limit how long wait_until() can wait before going around the loop again. const chrono::time_point tpmax(chrono::time_point_cast(Clock::now() + chrono::milliseconds(BOOST_THREAD_POLL_INTERVAL_MILLISECONDS))); return (std::min)(tp, tpmax); } template chrono::steady_clock::time_point convert_to_steady_clock_timepoint(chrono::time_point const& tp) { // Clock == chrono::steady_clock return chrono::time_point_cast(tp); } template chrono::steady_clock::time_point convert_to_steady_clock_timepoint(chrono::time_point const& tp) { // Clock != chrono::steady_clock // The system time may jump while wait_until() is waiting. To compensate for this and time out near // the correct time, we limit how long wait_until() can wait before going around the loop again. const chrono::steady_clock::duration dura(chrono::duration_cast(tp - Clock::now())); const chrono::steady_clock::duration duramax(chrono::milliseconds(BOOST_THREAD_POLL_INTERVAL_MILLISECONDS)); return chrono::steady_clock::now() + (std::min)(dura, duramax); } } //end detail namespace template class sync_timed_queue : private sync_priority_queue > { typedef detail::scheduled_type stype; typedef sync_priority_queue super; public: typedef T value_type; typedef Clock clock; typedef typename clock::duration duration; typedef typename clock::time_point time_point; typedef typename super::underlying_queue_type underlying_queue_type; typedef typename super::size_type size_type; typedef typename super::op_status op_status; sync_timed_queue() : super() {}; ~sync_timed_queue() {} using super::size; using super::empty; using super::full; using super::close; using super::closed; T pull(); void pull(T& elem); template queue_op_status pull_until(chrono::time_point const& tp, T& elem); template queue_op_status pull_for(chrono::duration const& dura, T& elem); queue_op_status try_pull(T& elem); queue_op_status wait_pull(T& elem); queue_op_status nonblocking_pull(T& elem); template void push(const T& elem, chrono::time_point const& tp); template void push(const T& elem, chrono::duration const& dura); template void push(BOOST_THREAD_RV_REF(T) elem, chrono::time_point const& tp); template void push(BOOST_THREAD_RV_REF(T) elem, chrono::duration const& dura); template queue_op_status try_push(const T& elem, chrono::time_point const& tp); template queue_op_status try_push(const T& elem, chrono::duration const& dura); template queue_op_status try_push(BOOST_THREAD_RV_REF(T) elem, chrono::time_point const& tp); template queue_op_status try_push(BOOST_THREAD_RV_REF(T) elem, chrono::duration const& dura); private: inline bool not_empty_and_time_reached(unique_lock& lk) const; inline bool not_empty_and_time_reached(lock_guard& lk) const; bool wait_to_pull(unique_lock&); queue_op_status wait_to_pull_until(unique_lock&, TimePoint const& tp); template queue_op_status wait_to_pull_for(unique_lock& lk, chrono::duration const& dura); T pull(unique_lock&); T pull(lock_guard&); void pull(unique_lock&, T& elem); void pull(lock_guard&, T& elem); queue_op_status try_pull(unique_lock&, T& elem); queue_op_status try_pull(lock_guard&, T& elem); queue_op_status wait_pull(unique_lock& lk, T& elem); sync_timed_queue(const sync_timed_queue&); sync_timed_queue& operator=(const sync_timed_queue&); sync_timed_queue(BOOST_THREAD_RV_REF(sync_timed_queue)); sync_timed_queue& operator=(BOOST_THREAD_RV_REF(sync_timed_queue)); }; //end class template template void sync_timed_queue::push(const T& elem, chrono::time_point const& tp) { super::push(stype(elem,tp)); } template template void sync_timed_queue::push(const T& elem, chrono::duration const& dura) { push(elem, clock::now() + dura); } template template void sync_timed_queue::push(BOOST_THREAD_RV_REF(T) elem, chrono::time_point const& tp) { super::push(stype(boost::move(elem),tp)); } template template void sync_timed_queue::push(BOOST_THREAD_RV_REF(T) elem, chrono::duration const& dura) { push(boost::move(elem), clock::now() + dura); } template template queue_op_status sync_timed_queue::try_push(const T& elem, chrono::time_point const& tp) { return super::try_push(stype(elem,tp)); } template template queue_op_status sync_timed_queue::try_push(const T& elem, chrono::duration const& dura) { return try_push(elem,clock::now() + dura); } template template queue_op_status sync_timed_queue::try_push(BOOST_THREAD_RV_REF(T) elem, chrono::time_point const& tp) { return super::try_push(stype(boost::move(elem), tp)); } template template queue_op_status sync_timed_queue::try_push(BOOST_THREAD_RV_REF(T) elem, chrono::duration const& dura) { return try_push(boost::move(elem), clock::now() + dura); } /////////////////////////// template bool sync_timed_queue::not_empty_and_time_reached(unique_lock& lk) const { return ! super::empty(lk) && clock::now() >= super::data_.top().time; } template bool sync_timed_queue::not_empty_and_time_reached(lock_guard& lk) const { return ! super::empty(lk) && clock::now() >= super::data_.top().time; } /////////////////////////// template bool sync_timed_queue::wait_to_pull(unique_lock& lk) { for (;;) { if (not_empty_and_time_reached(lk)) return false; // success if (super::closed(lk)) return true; // closed super::wait_until_not_empty_or_closed(lk); if (not_empty_and_time_reached(lk)) return false; // success if (super::closed(lk)) return true; // closed const time_point tpmin(detail::limit_timepoint(super::data_.top().time)); super::cond_.wait_until(lk, tpmin); } } template queue_op_status sync_timed_queue::wait_to_pull_until(unique_lock& lk, TimePoint const& tp) { for (;;) { if (not_empty_and_time_reached(lk)) return queue_op_status::success; if (super::closed(lk)) return queue_op_status::closed; if (clock::now() >= tp) return super::empty(lk) ? queue_op_status::timeout : queue_op_status::not_ready; super::wait_until_not_empty_or_closed_until(lk, tp); if (not_empty_and_time_reached(lk)) return queue_op_status::success; if (super::closed(lk)) return queue_op_status::closed; if (clock::now() >= tp) return super::empty(lk) ? queue_op_status::timeout : queue_op_status::not_ready; const time_point tpmin((std::min)(tp, detail::limit_timepoint(super::data_.top().time))); super::cond_.wait_until(lk, tpmin); } } template template queue_op_status sync_timed_queue::wait_to_pull_for(unique_lock& lk, chrono::duration const& dura) { const chrono::steady_clock::time_point tp(chrono::steady_clock::now() + chrono::duration_cast(dura)); for (;;) { if (not_empty_and_time_reached(lk)) return queue_op_status::success; if (super::closed(lk)) return queue_op_status::closed; if (chrono::steady_clock::now() >= tp) return super::empty(lk) ? queue_op_status::timeout : queue_op_status::not_ready; super::wait_until_not_empty_or_closed_until(lk, tp); if (not_empty_and_time_reached(lk)) return queue_op_status::success; if (super::closed(lk)) return queue_op_status::closed; if (chrono::steady_clock::now() >= tp) return super::empty(lk) ? queue_op_status::timeout : queue_op_status::not_ready; const chrono::steady_clock::time_point tpmin((std::min)(tp, detail::convert_to_steady_clock_timepoint(super::data_.top().time))); super::cond_.wait_until(lk, tpmin); } } /////////////////////////// template T sync_timed_queue::pull(unique_lock&) { #if ! defined BOOST_NO_CXX11_RVALUE_REFERENCES return boost::move(super::data_.pull().data); #else return super::data_.pull().data; #endif } template T sync_timed_queue::pull(lock_guard&) { #if ! defined BOOST_NO_CXX11_RVALUE_REFERENCES return boost::move(super::data_.pull().data); #else return super::data_.pull().data; #endif } template T sync_timed_queue::pull() { unique_lock lk(super::mtx_); const bool has_been_closed = wait_to_pull(lk); if (has_been_closed) super::throw_if_closed(lk); return pull(lk); } /////////////////////////// template void sync_timed_queue::pull(unique_lock&, T& elem) { #if ! defined BOOST_NO_CXX11_RVALUE_REFERENCES elem = boost::move(super::data_.pull().data); #else elem = super::data_.pull().data; #endif } template void sync_timed_queue::pull(lock_guard&, T& elem) { #if ! defined BOOST_NO_CXX11_RVALUE_REFERENCES elem = boost::move(super::data_.pull().data); #else elem = super::data_.pull().data; #endif } template void sync_timed_queue::pull(T& elem) { unique_lock lk(super::mtx_); const bool has_been_closed = wait_to_pull(lk); if (has_been_closed) super::throw_if_closed(lk); pull(lk, elem); } ////////////////////// template template queue_op_status sync_timed_queue::pull_until(chrono::time_point const& tp, T& elem) { unique_lock lk(super::mtx_); const queue_op_status rc = wait_to_pull_until(lk, chrono::time_point_cast(tp)); if (rc == queue_op_status::success) pull(lk, elem); return rc; } ////////////////////// template template queue_op_status sync_timed_queue::pull_for(chrono::duration const& dura, T& elem) { unique_lock lk(super::mtx_); const queue_op_status rc = wait_to_pull_for(lk, dura); if (rc == queue_op_status::success) pull(lk, elem); return rc; } /////////////////////////// template queue_op_status sync_timed_queue::try_pull(unique_lock& lk, T& elem) { if (not_empty_and_time_reached(lk)) { pull(lk, elem); return queue_op_status::success; } if (super::closed(lk)) return queue_op_status::closed; if (super::empty(lk)) return queue_op_status::empty; return queue_op_status::not_ready; } template queue_op_status sync_timed_queue::try_pull(lock_guard& lk, T& elem) { if (not_empty_and_time_reached(lk)) { pull(lk, elem); return queue_op_status::success; } if (super::closed(lk)) return queue_op_status::closed; if (super::empty(lk)) return queue_op_status::empty; return queue_op_status::not_ready; } template queue_op_status sync_timed_queue::try_pull(T& elem) { lock_guard lk(super::mtx_); return try_pull(lk, elem); } /////////////////////////// template queue_op_status sync_timed_queue::wait_pull(unique_lock& lk, T& elem) { const bool has_been_closed = wait_to_pull(lk); if (has_been_closed) return queue_op_status::closed; pull(lk, elem); return queue_op_status::success; } template queue_op_status sync_timed_queue::wait_pull(T& elem) { unique_lock lk(super::mtx_); return wait_pull(lk, elem); } /////////////////////////// template queue_op_status sync_timed_queue::nonblocking_pull(T& elem) { unique_lock lk(super::mtx_, try_to_lock); if (! lk.owns_lock()) return queue_op_status::busy; return try_pull(lk, elem); } } //end concurrent namespace using concurrent::sync_timed_queue; } //end boost namespace #include #endif