mirror of
https://github.com/boostorg/fiber.git
synced 2026-02-12 12:02:54 +00:00
68 lines
1.3 KiB
C++
68 lines
1.3 KiB
C++
|
|
// Copyright Oliver Kowalke 2013.
|
|
// 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)
|
|
|
|
#include "boost/fiber/condition.hpp"
|
|
|
|
#include <boost/foreach.hpp>
|
|
|
|
#ifdef BOOST_HAS_ABI_HEADERS
|
|
# include BOOST_ABI_PREFIX
|
|
#endif
|
|
|
|
namespace boost {
|
|
namespace fibers {
|
|
|
|
condition::condition() :
|
|
splk_(),
|
|
waiting_()
|
|
{}
|
|
|
|
condition::~condition()
|
|
{ BOOST_ASSERT( waiting_.empty() ); }
|
|
|
|
void
|
|
condition::notify_one()
|
|
{
|
|
detail::fiber_base * n = 0;
|
|
|
|
unique_lock< detail::spinlock > lk( splk_);
|
|
// get one waiting fiber
|
|
if ( ! waiting_.empty() ) {
|
|
n = waiting_.front();
|
|
waiting_.pop_front();
|
|
}
|
|
lk.unlock();
|
|
|
|
// notify waiting fiber
|
|
if ( n) n->set_ready();
|
|
}
|
|
|
|
void
|
|
condition::notify_all()
|
|
{
|
|
std::deque< detail::fiber_base * > waiting;
|
|
|
|
unique_lock< detail::spinlock > lk( splk_);
|
|
// get all waiting fibers
|
|
waiting.swap( waiting_);
|
|
lk.unlock();
|
|
|
|
// notify all waiting fibers
|
|
while ( ! waiting.empty() )
|
|
{
|
|
detail::fiber_base * n( waiting.front() );
|
|
waiting.pop_front();
|
|
BOOST_ASSERT( n);
|
|
n->set_ready();
|
|
}
|
|
}
|
|
|
|
}}
|
|
|
|
#ifdef BOOST_HAS_ABI_HEADERS
|
|
# include BOOST_ABI_SUFFIX
|
|
#endif
|