1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
// 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)
//[spsc_queue_example
#include <boost/lockfree/spsc_queue.hpp>
#include <boost/thread/thread.hpp>
#include <iostream>
#include <boost/atomic.hpp>
int producer_count = 0;
boost::atomic_int consumer_count( 0 );
boost::lockfree::spsc_queue< int, boost::lockfree::capacity< 1024 > > spsc_queue;
const int iterations = 10000000;
void producer( void )
{
for ( int i = 0; i != iterations; ++i ) {
int value = ++producer_count;
while ( !spsc_queue.push( value ) )
;
}
}
boost::atomic< bool > done( false );
void consumer( void )
{
int value;
while ( !done ) {
while ( spsc_queue.pop( value ) )
++consumer_count;
}
while ( spsc_queue.pop( value ) )
++consumer_count;
}
int main( int argc, char* argv[] )
{
using namespace std;
cout << "boost::lockfree::queue is ";
if ( !spsc_queue.is_lock_free() )
cout << "not ";
cout << "lockfree" << endl;
boost::thread producer_thread( producer );
boost::thread consumer_thread( consumer );
producer_thread.join();
done = true;
consumer_thread.join();
cout << "produced " << producer_count << " objects." << endl;
cout << "consumed " << consumer_count << " objects." << endl;
}
//]
|
