queue.cpp 1.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869
  1. // Copyright (C) 2009 Tim Blechmann
  2. //
  3. // Distributed under the Boost Software License, Version 1.0. (See
  4. // accompanying file LICENSE_1_0.txt or copy at
  5. // http://www.boost.org/LICENSE_1_0.txt)
  6. //[queue_example
  7. #include <boost/thread/thread.hpp>
  8. #include <boost/lockfree/queue.hpp>
  9. #include <iostream>
  10. #include <boost/atomic.hpp>
  11. boost::atomic_int producer_count(0);
  12. boost::atomic_int consumer_count(0);
  13. boost::lockfree::queue<int> queue(128);
  14. const int iterations = 10000000;
  15. const int producer_thread_count = 4;
  16. const int consumer_thread_count = 4;
  17. void producer(void)
  18. {
  19. for (int i = 0; i != iterations; ++i) {
  20. int value = ++producer_count;
  21. while (!queue.push(value))
  22. ;
  23. }
  24. }
  25. boost::atomic<bool> done (false);
  26. void consumer(void)
  27. {
  28. int value;
  29. while (!done) {
  30. while (queue.pop(value))
  31. ++consumer_count;
  32. }
  33. while (queue.pop(value))
  34. ++consumer_count;
  35. }
  36. int main(int argc, char* argv[])
  37. {
  38. using namespace std;
  39. cout << "boost::lockfree::queue is ";
  40. if (!queue.is_lock_free())
  41. cout << "not ";
  42. cout << "lockfree" << endl;
  43. boost::thread_group producer_threads, consumer_threads;
  44. for (int i = 0; i != producer_thread_count; ++i)
  45. producer_threads.create_thread(producer);
  46. for (int i = 0; i != consumer_thread_count; ++i)
  47. consumer_threads.create_thread(consumer);
  48. producer_threads.join_all();
  49. done = true;
  50. consumer_threads.join_all();
  51. cout << "produced " << producer_count << " objects." << endl;
  52. cout << "consumed " << consumer_count << " objects." << endl;
  53. }
  54. //]