tests: silence warnings

test/freelist_test.cpp

@@ -169,6 +169,7 @@ struct freelist_tester
                 dummy* node = fl.template construct< true, bounded >();
                 if ( node ) {
                     bool success = working_set.insert( node );
+                    (void)success;
                     assert( success );
                     allocated_nodes.push( node );
                     break;
@@ -183,6 +184,7 @@ struct freelist_tester
             dummy* node;
             if ( allocated_nodes.pop( node ) ) {
                 bool success = working_set.erase( node );
+                (void)success;
                 assert( success );
                 fl.template destruct< true >( node );
             }
@@ -198,6 +200,7 @@ struct freelist_tester
         dummy* node;
         while ( allocated_nodes.pop( node ) ) {
             bool success = working_set.erase( node );
+            (void)success;
             assert( success );
             fl.template destruct< true >( node );
         }

test/queue_interprocess_test.cpp

@@ -5,7 +5,6 @@
 //  http://www.boost.org/LICENSE_1_0.txt)
 
 #include <cstdlib> //std::system
-#include <sstream>
 
 #include <boost/interprocess/managed_shared_memory.hpp>
 #include <boost/lockfree/queue.hpp>
@@ -52,6 +51,7 @@ int main( int argc, char* argv[] )
         int from_queue;
         for ( int i = 0; i != 1024; ++i ) {
             bool success = q->pop( from_queue );
+            (void)success;
             assert( success );
             assert( from_queue == i );
         }

test/spsc_queue_stress_test.cpp

@@ -25,9 +25,9 @@ using namespace boost::lockfree;
 using namespace std;
 
 #ifndef BOOST_LOCKFREE_STRESS_TEST
-static const boost::uint32_t nodes_per_thread = 100000;
+static const size_t nodes_per_thread = 100000;
 #else
-static const boost::uint32_t nodes_per_thread = 100000000;
+static const size_t nodes_per_thread = 100000000;
 #endif
 
 struct spsc_queue_tester
@@ -50,7 +50,7 @@ struct spsc_queue_tester
 
     void add( void )
     {
-        for ( boost::uint32_t i = 0; i != nodes_per_thread; ++i ) {
+        for ( size_t i = 0; i != nodes_per_thread; ++i ) {
             int id = generate_id< int >();
             working_set.insert( id );
 
@@ -70,6 +70,7 @@ struct spsc_queue_tester
             ++received_nodes;
             --spsc_queue_cnt;
             bool erased = working_set.erase( data );
+            (void)erased;
             assert( erased );
             return true;
         } else
@@ -143,7 +144,7 @@ struct spsc_queue_tester_buffering
     void add( void )
     {
         boost::array< int, buf_size > input_buffer;
-        for ( boost::uint32_t i = 0; i != nodes_per_thread; i += buf_size ) {
+        for ( size_t i = 0; i != nodes_per_thread; i += buf_size ) {
             for ( size_t i = 0; i != buf_size; ++i ) {
                 int id = generate_id< int >();
                 working_set.insert( id );
@@ -168,11 +169,12 @@ struct spsc_queue_tester_buffering
         size_t popd = sf.pop( output_buffer.c_array(), output_buffer.size() );
 
         if ( popd ) {
-            received_nodes += popd;
-            spsc_queue_cnt -= popd;
+            received_nodes += size_t( popd );
+            spsc_queue_cnt -= long( popd );
 
             for ( size_t i = 0; i != popd; ++i ) {
                 bool erased = working_set.erase( output_buffer[ i ] );
+                (void)erased;
                 assert( erased );
             }
 

test/stack_interprocess_test.cpp

@@ -5,7 +5,6 @@
 //  http://www.boost.org/LICENSE_1_0.txt)
 
 #include <cstdlib> //std::system
-#include <sstream>
 
 #include <boost/interprocess/managed_shared_memory.hpp>
 #include <boost/lockfree/stack.hpp>
@@ -52,6 +51,7 @@ int main( int argc, char* argv[] )
         int from_queue;
         for ( int i = 0; i != 1024; ++i ) {
             bool success = queue->pop( from_queue );
+            (void)success;
             assert( success );
             assert( from_queue == 1023 - i );
         }

test/test_common.hpp

@@ -52,6 +52,7 @@ struct queue_stress_tester
 
             bool inserted = data.insert( id );
             assert( inserted );
+            (void)inserted;
 
             if ( Bounded )
                 while ( stk.bounded_push( id ) == false ) {
@@ -83,6 +84,8 @@ struct queue_stress_tester
 
         bool erased   = data.erase( id );
         bool inserted = dequeued.insert( id );
+        (void)erased;
+        (void)inserted;
         assert( erased );
         assert( inserted );
         ++pop_count;