mirror of
https://github.com/boostorg/fiber.git
synced 2026-02-20 14:42:21 +00:00
114 lines
2.3 KiB
C++
Executable File
114 lines
2.3 KiB
C++
Executable File
|
|
// 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 <iostream>
|
|
#include <cstdlib>
|
|
#include <stdexcept>
|
|
#include <utility>
|
|
|
|
#include <boost/assert.hpp>
|
|
#include <boost/bind.hpp>
|
|
#include <boost/optional.hpp>
|
|
#include <boost/thread.hpp>
|
|
|
|
#include "boost/task.hpp"
|
|
|
|
namespace tsk = boost::tasks;
|
|
|
|
typedef tsk::static_pool< tsk::unbounded_fifo > pool_type;
|
|
|
|
int serial_fib( int n)
|
|
{
|
|
if( n < 2)
|
|
return n;
|
|
else
|
|
return serial_fib( n - 1) + serial_fib( n - 2);
|
|
}
|
|
|
|
int parallel_fib( int n, int cutof)
|
|
{
|
|
if ( n < cutof) return serial_fib( n);
|
|
else
|
|
{
|
|
BOOST_ASSERT( boost::this_task::runs_in_pool() );
|
|
tsk::task< int > t1(
|
|
parallel_fib,
|
|
n - 1,
|
|
cutof);
|
|
tsk::task< int > t2(
|
|
parallel_fib,
|
|
n - 2,
|
|
cutof);
|
|
tsk::handle< int > h1(
|
|
tsk::async(
|
|
boost::move( t1),
|
|
tsk::as_sub_task() ) ) ;
|
|
tsk::handle< int > h2(
|
|
tsk::async(
|
|
boost::move( t2),
|
|
tsk::as_sub_task() ) );
|
|
return h1.get() + h2.get();
|
|
}
|
|
}
|
|
|
|
inline
|
|
void submit(
|
|
tsk::spin::unbounded_channel< int > & send,
|
|
tsk::spin::unbounded_channel< std::pair< int , int > > & recv,
|
|
int n)
|
|
{
|
|
for ( int i = 0; i <= n; ++i)
|
|
send.put( i);
|
|
send.deactivate();
|
|
boost::optional< std::pair< int , int > > r;
|
|
while ( recv.take( r) )
|
|
{
|
|
BOOST_ASSERT( r);
|
|
printf("fib(%d) == %d\n", r->first, r->second);
|
|
}
|
|
}
|
|
|
|
inline
|
|
void calculate(
|
|
tsk::spin::unbounded_channel< int > & recv,
|
|
tsk::spin::unbounded_channel< std::pair< int , int > > & send)
|
|
{
|
|
boost::optional< int > n;
|
|
while ( recv.take( n) )
|
|
{
|
|
BOOST_ASSERT( n);
|
|
int r = parallel_fib( * n, 5);
|
|
send.put( std::make_pair( * n, r) );
|
|
}
|
|
send.deactivate();
|
|
}
|
|
|
|
int main( int argc, char *argv[])
|
|
{
|
|
try
|
|
{
|
|
pool_type pool( tsk::poolsize( 2) );
|
|
|
|
tsk::spin::unbounded_channel< int > buf1;
|
|
tsk::spin::unbounded_channel< std::pair< int , int > > buf2;
|
|
|
|
tsk::async(
|
|
tsk::make_task( submit, buf1, buf2, 15),
|
|
pool);
|
|
tsk::async(
|
|
tsk::make_task( calculate, buf1, buf2),
|
|
pool);
|
|
|
|
return EXIT_SUCCESS;
|
|
}
|
|
catch ( std::exception const& e)
|
|
{ std::cerr << "exception: " << e.what() << std::endl; }
|
|
catch ( ... )
|
|
{ std::cerr << "unhandled" << std::endl; }
|
|
|
|
return EXIT_FAILURE;
|
|
}
|