mirror of
https://github.com/boostorg/fiber.git
synced 2026-02-02 20:52:21 +00:00
130 lines
3.2 KiB
C++
130 lines
3.2 KiB
C++
|
||
// Copyright Oliver Kowalke 2009.
|
||
// 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 <cstdio>
|
||
#include <sstream>
|
||
#include <string>
|
||
|
||
#include <boost/atomic.hpp>
|
||
#include <boost/test/unit_test.hpp>
|
||
#include <boost/thread.hpp>
|
||
#include <boost/utility.hpp>
|
||
|
||
#include <boost/fiber/all.hpp>
|
||
|
||
#define MAXCOUNT 100
|
||
|
||
#include <cstdio>
|
||
#include <sstream>
|
||
|
||
boost::atomic< bool > fini( false);
|
||
boost::fibers::round_robin_ws * other_ds = 0;
|
||
|
||
boost::fibers::future< int > fibonacci( int);
|
||
|
||
int fibonacci_( int n)
|
||
{
|
||
boost::this_fiber::yield();
|
||
|
||
int res = 1;
|
||
|
||
if ( 0 != n && 1 != n)
|
||
{
|
||
boost::fibers::future< int > f1 = fibonacci( n - 1);
|
||
boost::fibers::future< int > f2 = fibonacci( n - 2);
|
||
|
||
res = f1.get() + f2.get();
|
||
}
|
||
|
||
return res;
|
||
}
|
||
|
||
boost::fibers::future< int > fibonacci( int n)
|
||
{
|
||
boost::fibers::packaged_task< int() > pt( boost::bind( fibonacci_, n) );
|
||
boost::fibers::future< int > f( pt.get_future() );
|
||
boost::fibers::fiber( boost::move( pt) ).detach();
|
||
return boost::move( f);
|
||
}
|
||
|
||
int create_fiber( int n)
|
||
{
|
||
return fibonacci( n).get();
|
||
}
|
||
|
||
void fn_create_fibers( boost::fibers::round_robin_ws * ds, boost::barrier * b)
|
||
{
|
||
boost::fibers::set_scheduling_algorithm( ds);
|
||
|
||
b->wait();
|
||
|
||
int result = boost::fibers::async( boost::bind( create_fiber, 10) ).get();
|
||
BOOST_CHECK( 89 == result);
|
||
fprintf( stderr, "fibonacci(10) = %d", result);
|
||
|
||
fini = true;
|
||
}
|
||
|
||
void fn_migrate_fibers( boost::fibers::round_robin_ws * other_ds, boost::barrier * b, int * count)
|
||
{
|
||
BOOST_ASSERT( other_ds);
|
||
|
||
boost::fibers::round_robin_ws ds;
|
||
boost::fibers::set_scheduling_algorithm( & ds);
|
||
|
||
b->wait();
|
||
|
||
while ( ! fini)
|
||
{
|
||
// To guarantee progress, we must ensure that
|
||
// threads that have work to do are not unreasonably delayed by (thief) threads
|
||
// which are idle except for task-stealing.
|
||
// This call yields the thief ’s processor to another thread, allowing
|
||
// descheduled threads to regain a processor and make progress.
|
||
boost::this_thread::yield();
|
||
|
||
boost::fibers::fiber f( other_ds->steal_from() );
|
||
if ( f)
|
||
{
|
||
++( * count);
|
||
ds.migrate_to( f);
|
||
f.detach();
|
||
}
|
||
while ( boost::fibers::detail::scheduler::instance()->run() );
|
||
}
|
||
}
|
||
|
||
void test_migrate_fiber()
|
||
{
|
||
for ( int i = 0; i < MAXCOUNT; ++i) {
|
||
fprintf(stderr, "%d. ", i);
|
||
|
||
fini = false;
|
||
int count = 0;
|
||
|
||
boost::fibers::round_robin_ws * ds = new boost::fibers::round_robin_ws();
|
||
boost::barrier b( 2);
|
||
boost::thread t1( boost::bind( fn_create_fibers, ds, &b) );
|
||
boost::thread t2( boost::bind( fn_migrate_fibers, ds, &b, &count) );
|
||
|
||
t1.join();
|
||
t2.join();
|
||
|
||
fprintf(stderr, ", %d fibers stolen\n", count);
|
||
delete ds;
|
||
}
|
||
}
|
||
|
||
boost::unit_test::test_suite * init_unit_test_suite( int, char* [])
|
||
{
|
||
boost::unit_test::test_suite * test =
|
||
BOOST_TEST_SUITE("Boost.Fiber: migration test suite");
|
||
|
||
test->add( BOOST_TEST_CASE( & test_migrate_fiber) );
|
||
|
||
return test;
|
||
}
|