// Copyright (C) 2009 Tim Blechmann // // 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) //[queue_example #include #include #include #include boost::atomic_int producer_count( 0 ); boost::atomic_int consumer_count( 0 ); boost::lockfree::queue< int > queue( 128 ); const int iterations = 10000000; const int producer_thread_count = 4; const int consumer_thread_count = 4; void producer( void ) { for ( int i = 0; i != iterations; ++i ) { int value = ++producer_count; while ( !queue.push( value ) ) ; } } boost::atomic< bool > done( false ); void consumer( void ) { int value; while ( !done ) { while ( queue.pop( value ) ) ++consumer_count; } while ( queue.pop( value ) ) ++consumer_count; } int main( int argc, char* argv[] ) { using namespace std; cout << "boost::lockfree::queue is "; if ( !queue.is_lock_free() ) cout << "not "; cout << "lockfree" << endl; boost::thread_group producer_threads, consumer_threads; for ( int i = 0; i != producer_thread_count; ++i ) producer_threads.create_thread( producer ); for ( int i = 0; i != consumer_thread_count; ++i ) consumer_threads.create_thread( consumer ); producer_threads.join_all(); done = true; consumer_threads.join_all(); cout << "produced " << producer_count << " objects." << endl; cout << "consumed " << consumer_count << " objects." << endl; } //]