Removed unused vars

diff --git a/cds/container/cuckoo_map.h b/cds/container/cuckoo_map.h
index cf15043f3a13d7910b1f7e2b3a8856a02d7984e0..11885552fd406121a39496e3920f61f0ff3f07cc 100644 (file)
--- a/cds/container/cuckoo_map.h
+++ b/cds/container/cuckoo_map.h
@@ -550,6 +550,7 @@ namespace cds { namespace container {
         template <typename K, typename Predicate>
         bool erase_with( K const& key, Predicate pred )
         {
+            CDS_UNUSED( pred );
             node_type * pNode = base_class::erase_with(key, cds::details::predicate_wrapper<node_type, Predicate, key_accessor>());
             if ( pNode ) {
                 free_node( pNode );
@@ -598,6 +599,7 @@ namespace cds { namespace container {
         template <typename K, typename Predicate, typename Func>
         bool erase_with( K const& key, Predicate pred, Func f )
         {
+            CDS_UNUSED( pred );
             node_type * pNode = base_class::erase_with( key, cds::details::predicate_wrapper<node_type, Predicate, key_accessor>() );
             if ( pNode ) {
                 f( pNode->m_val );
@@ -640,6 +642,7 @@ namespace cds { namespace container {
         template <typename K, typename Predicate, typename Func>
         bool find_with( K const& key, Predicate pred, Func f )
         {
+            CDS_UNUSED( pred );
             return base_class::find_with( key, cds::details::predicate_wrapper<node_type, Predicate, key_accessor>(),
                 [&f](node_type& item, K const& ) { f( item.m_val );});
         }
@@ -667,6 +670,7 @@ namespace cds { namespace container {
         template <typename K, typename Predicate>
         bool find_with( K const& key, Predicate pred )
         {
+            CDS_UNUSED( pred );
             return base_class::find_with( key, cds::details::predicate_wrapper<node_type, Predicate, key_accessor>() );
         }
 

diff --git a/tests/test-hdr/ordered_list/hdr_intrusive_lazy.h b/tests/test-hdr/ordered_list/hdr_intrusive_lazy.h
index a07c6b55127ec6a3c2c32f9ae3674f116fa7ba36..8402f73215ab8c508ecc506b9f92ccd42695c801 100644 (file)
--- a/tests/test-hdr/ordered_list/hdr_intrusive_lazy.h
+++ b/tests/test-hdr/ordered_list/hdr_intrusive_lazy.h
@@ -173,7 +173,7 @@ namespace ordlist {
         struct ensure_functor
         {
             template <typename T>
-            void operator ()(bool bNew, T& item, T& val )
+            void operator ()(bool bNew, T& item, T& /*val*/ )
             {
                 if ( bNew )
                     ++item.s.nEnsureNewCall;
@@ -185,7 +185,7 @@ namespace ordlist {
         struct find_functor
         {
             template <typename T, typename Q>
-            void operator ()( T& item, Q& val )
+            void operator ()( T& item, Q& /*val*/ )
             {
                 ++item.s.nFindCall;
             }

diff --git a/tests/test-hdr/ordered_list/hdr_intrusive_michael.h b/tests/test-hdr/ordered_list/hdr_intrusive_michael.h
index 606d7f34390f4da54858d81fde493bdbaf9693b9..52c717351c4421a34b4277019dc21ca44a0ba093 100644 (file)
--- a/tests/test-hdr/ordered_list/hdr_intrusive_michael.h
+++ b/tests/test-hdr/ordered_list/hdr_intrusive_michael.h
@@ -173,7 +173,7 @@ namespace ordlist {
         struct ensure_functor
         {
             template <typename T>
-            void operator ()(bool bNew, T& item, T& val )
+            void operator ()(bool bNew, T& item, T& /*val*/ )
             {
                 if ( bNew )
                     ++item.s.nEnsureNewCall;
@@ -185,7 +185,7 @@ namespace ordlist {
         struct find_functor
         {
             template <typename T, typename Q>
-            void operator ()( T& item, Q& val )
+            void operator ()( T& item, Q& /*val*/ )
             {
                 ++item.s.nFindCall;
             }

diff --git a/tests/test-hdr/ordered_list/hdr_lazy.h b/tests/test-hdr/ordered_list/hdr_lazy.h
index 0b6bde9d551ece1ea141cbc7cef80e5b0e4146b5..28c388874eb1f34058ec6ddb8035ecfad1090b76 100644 (file)
--- a/tests/test-hdr/ordered_list/hdr_lazy.h
+++ b/tests/test-hdr/ordered_list/hdr_lazy.h
@@ -179,7 +179,7 @@ namespace ordlist {
         };
 
         struct ensure_functor {
-            void operator()( bool /*bNew*/, item& i, int n )
+            void operator()( bool /*bNew*/, item& i, int /*n*/ )
             {
                 i.nVal = i.nKey * 1024;
             }

diff --git a/tests/unit/alloc/michael_allocator.h b/tests/unit/alloc/michael_allocator.h
index 7ef01a619bb178daefc15e0dff582363c0b4f413..4b4c54aef4cc7fd93d2b9891f3a252160cc071d3 100644 (file)
--- a/tests/unit/alloc/michael_allocator.h
+++ b/tests/unit/alloc/michael_allocator.h
@@ -35,12 +35,12 @@ namespace memory {
         };
 
 
-        pointer allocate( size_t nSize, const void * pHint )
+        pointer allocate( size_t nSize, const void * /*pHint*/ )
         {
             return reinterpret_cast<pointer>( s_MichaelHeap_NoStat.alloc( sizeof(T) * nSize ) );
         }
 
-        void deallocate( pointer p, size_t nCount )
+        void deallocate( pointer p, size_t /*nCount*/ )
         {
             s_MichaelHeap_NoStat.free( p );
         }
@@ -59,7 +59,7 @@ namespace memory {
             alignment = 1
         };
 
-        static void stat(summary_stat& s)
+        static void stat(summary_stat& /*s*/)
         {}
     };
 
@@ -74,12 +74,12 @@ namespace memory {
             alignment = 1
         };
 
-        pointer allocate( size_t nSize, const void * pHint )
+        pointer allocate( size_t nSize, const void * /*pHint*/ )
         {
             return reinterpret_cast<pointer>( s_MichaelHeap_Stat.alloc( sizeof(T) * nSize ) );
         }
 
-        void deallocate( pointer p, size_t nCount )
+        void deallocate( pointer p, size_t /*nCount*/ )
         {
             s_MichaelHeap_Stat.free( p );
         }
@@ -101,12 +101,12 @@ namespace memory {
             alignment = ALIGN
         };
 
-        pointer allocate( size_t nSize, const void * pHint )
+        pointer allocate( size_t nSize, const void * /*pHint*/ )
         {
             return reinterpret_cast<pointer>( s_MichaelHeap_NoStat.alloc_aligned( sizeof(T) * nSize, ALIGN ) );
         }
 
-        void deallocate( pointer p, size_t nCount )
+        void deallocate( pointer p, size_t /*nCount*/ )
         {
             s_MichaelHeap_NoStat.free_aligned( p );
         }
@@ -127,12 +127,12 @@ namespace memory {
             alignment = ALIGN
         };
 
-        pointer allocate( size_t nSize, const void * pHint )
+        pointer allocate( size_t nSize, const void * /*pHint*/ )
         {
             return reinterpret_cast<pointer>( s_MichaelHeap_Stat.alloc_aligned( sizeof(T) * nSize, ALIGN ) );
         }
 
-        void deallocate( pointer p, size_t nCount )
+        void deallocate( pointer p, size_t /*nCount*/ )
         {
             s_MichaelHeap_Stat.free_aligned( p );
         }
@@ -154,17 +154,17 @@ namespace memory {
             alignment = ALIGN
         };
 
-        pointer allocate( size_t nSize, const void * pHint )
+        pointer allocate( size_t nSize, const void * /*pHint*/ )
         {
             return reinterpret_cast<pointer>( cds::OS::aligned_malloc( sizeof(T) * nSize, ALIGN ) );
         }
 
-        void deallocate( pointer p, size_t nCount )
+        void deallocate( pointer p, size_t /*nCount*/ )
         {
             cds::OS::aligned_free( p );
         }
 
-        static void stat(summary_stat& s)
+        static void stat(summary_stat& /*s*/)
         {}
     };
 

diff --git a/tests/unit/map2/map_types.h b/tests/unit/map2/map_types.h
index c17629593bcb6f7b67313cede9148100bed23a9f..44c6494da9468b6c462d7af8644fb93a436842fc 100644 (file)
--- a/tests/unit/map2/map_types.h
+++ b/tests/unit/map2/map_types.h
@@ -127,7 +127,7 @@ namespace map2 {
         {}
 
         template <typename Q, typename Pred>
-        bool erase_with( Q const& key, Pred pred )
+        bool erase_with( Q const& key, Pred /*pred*/ )
         {
             return cuckoo_base_class::erase_with( key, typename std::conditional< cuckoo_base_class::c_isSorted, Pred, typename Pred::equal_to>::type() );
         }
@@ -1124,7 +1124,7 @@ namespace map2 {
 
             resizing_policy_t   m_placeHolder;
         public:
-            StripedHashMap_ord( size_t nCapacity, size_t nLoadFactor )
+            StripedHashMap_ord( size_t /*nCapacity*/, size_t nLoadFactor )
                 : base_class( 0, *(new(&m_placeHolder) resizing_policy_t( nLoadFactor * 1024 )) )
             {}
         };
@@ -1228,7 +1228,7 @@ namespace map2 {
 
             resizing_policy_t   m_placeHolder;
         public:
-            RefinableHashMap_ord( size_t nCapacity, size_t nLoadFactor )
+            RefinableHashMap_ord( size_t /*nCapacity*/, size_t nLoadFactor )
                 : base_class( 0, *(new(&m_placeHolder) resizing_policy_t( nLoadFactor * 1024 )) )
             {}
         };
@@ -1726,15 +1726,15 @@ namespace map2 {
     };
 
     template <typename Map>
-    static inline void print_stat( Map const& m )
+    static inline void print_stat( Map const& /*m*/ )
     {}
 
     template <typename Map>
-    static inline void additional_cleanup( Map& m )
+    static inline void additional_cleanup( Map& /*m*/ )
     {}
 
     template <typename Map>
-    static inline void additional_check( Map& m )
+    static inline void additional_check( Map& /*m*/ )
     {}
 
 
@@ -1763,12 +1763,12 @@ namespace map2 {
         CPPUNIT_MSG( s.statistics() );
     }
     template <typename GC, typename Key, typename T, typename Traits>
-    static inline void additional_cleanup( cc::EllenBinTreeMap<GC, Key, T, Traits>& s )
+    static inline void additional_cleanup( cc::EllenBinTreeMap<GC, Key, T, Traits>& /*s*/ )
     {
         ellen_bintree_pool::internal_node_counter::reset();
     }
     namespace ellen_bintree_check {
-        static inline void check_stat( cds::intrusive::ellen_bintree::empty_stat const& s )
+        static inline void check_stat( cds::intrusive::ellen_bintree::empty_stat const& /*s*/ )
         {
             // This check is not valid for thread-based RCU
             /*

diff --git a/tests/unit/map2/std_hash_map.h b/tests/unit/map2/std_hash_map.h
index 0c808963e6954a4b3cd6f7f0c69929999338c023..cb9cd407e68f7c8d156ced347129b68aec266978 100644 (file)
--- a/tests/unit/map2/std_hash_map.h
+++ b/tests/unit/map2/std_hash_map.h
@@ -32,7 +32,7 @@ namespace map2 {
         typedef typename base_class::mapped_type value_type;
         typedef size_t      item_counter;
 
-        StdHashMap( size_t nMapSize, size_t nLoadFactor )
+        StdHashMap( size_t /*nMapSize*/, size_t /*nLoadFactor*/ )
         {}
 
         bool find( const Key& key )

diff --git a/tests/unit/map2/std_map.h b/tests/unit/map2/std_map.h
index 28517449c3d53fd72d2fc2d712ab003b55659712..58508cd60427092c07f39250698cd47095403bd5 100644 (file)
--- a/tests/unit/map2/std_map.h
+++ b/tests/unit/map2/std_map.h
@@ -21,7 +21,7 @@ namespace map2 {
         typedef typename base_class::value_type  pair_type;
         typedef size_t      item_counter;
 
-        StdMap( size_t nMapSize, size_t nLoadFactor )
+        StdMap( size_t /*nMapSize*/, size_t /*nLoadFactor*/ )
         {}
 
         bool find( const Key& key )

diff --git a/tests/unit/pqueue/pqueue_type.h b/tests/unit/pqueue/pqueue_type.h
index 5c271d6a14b4e6acf31ae2d091eb1b3923717255..2eb0dece00c83e0fbf1095f3391cbc25ba73fda6 100644 (file)
--- a/tests/unit/pqueue/pqueue_type.h
+++ b/tests/unit/pqueue/pqueue_type.h
@@ -288,7 +288,7 @@ namespace pqueue {
 
 
     template <typename Stat>
-    static inline void check_statistics( Stat const& s )
+    static inline void check_statistics( Stat const& /*s*/ )
     {}
 
     static inline void check_statistics( cds::container::ellen_bintree::stat<> const& s )

diff --git a/tests/unit/queue/intrusive_queue_reader_writer.cpp b/tests/unit/queue/intrusive_queue_reader_writer.cpp
index c6fa491718180860d36e6e73c4102ea36dfeb85c..7a0c718ee1755c7fa5418db2c35c07b63406542b 100644 (file)
--- a/tests/unit/queue/intrusive_queue_reader_writer.cpp
+++ b/tests/unit/queue/intrusive_queue_reader_writer.cpp
@@ -211,7 +211,7 @@ namespace queue {
 
     protected:
         template <class Queue>
-        void analyze( CppUnitMini::ThreadPool& pool, Queue& testQueue, size_t nLeftOffset, size_t nRightOffset )
+        void analyze( CppUnitMini::ThreadPool& pool, Queue& testQueue, size_t /*nLeftOffset*/, size_t nRightOffset )
         {
             typedef Consumer<Queue> Reader;
             typedef Producer<Queue> Writer;

diff --git a/tests/unit/queue/intrusive_queue_type.h b/tests/unit/queue/intrusive_queue_type.h
index 8e5882531f35b2c252ab7e910c56ea340b156728..67c30d76ea4aebc8602fafe9e8981eecc24ef039 100644 (file)
--- a/tests/unit/queue/intrusive_queue_type.h
+++ b/tests/unit/queue/intrusive_queue_type.h
@@ -507,7 +507,7 @@ namespace std {
             << "\t\tAdd basket attempts: " << s.m_TryAddBasket.get() << "\n"
             << "\t\t Add basket success: " << s.m_AddBasketCount.get() << "\n";
     }
-    static inline std::ostream& operator <<(std::ostream& o, cds::intrusive::basket_queue::empty_stat const& s)
+    static inline std::ostream& operator <<(std::ostream& o, cds::intrusive::basket_queue::empty_stat const& /*s*/)
     {
         return o;
     }
@@ -525,7 +525,7 @@ namespace std {
             << "\t\t          Bad tail: " << s.m_BadTail.get() << "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::msqueue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::msqueue::empty_stat const& /*s*/ )
     {
         return o;
     }
@@ -550,7 +550,7 @@ namespace std {
             << "\t\t     fix list call: " << s.m_FixListCount.get() << "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::optimistic_queue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::optimistic_queue::empty_stat const& /*s*/ )
     {
         return o;
     }
@@ -577,12 +577,12 @@ namespace std {
                 << "\t      Release pub-record: " << s.m_nReleasePubRecCount.get()<< "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::fcqueue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::fcqueue::empty_stat const& /*s*/ )
     {
         return o;
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, queue::details::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, queue::details::empty_stat const& /*s*/ )
     {
         return o;
     }

diff --git a/tests/unit/queue/queue_type.h b/tests/unit/queue/queue_type.h
index dc2826ccebbe19a273cbd05b3a54ed487f3a0630..818e05febc32daca3b12b4ef207ba38c3638b857 100644 (file)
--- a/tests/unit/queue/queue_type.h
+++ b/tests/unit/queue/queue_type.h
@@ -544,7 +544,7 @@ namespace std {
             << "\t\tAdd basket attempts: " << s.m_TryAddBasket.get() << "\n"
             << "\t\t Add basket success: " << s.m_AddBasketCount.get() << "\n";
     }
-    static inline std::ostream& operator <<(std::ostream& o, cds::container::basket_queue::empty_stat const& s)
+    static inline std::ostream& operator <<(std::ostream& o, cds::container::basket_queue::empty_stat const& /*s*/)
     {
         return o;
     }
@@ -562,7 +562,7 @@ namespace std {
             << "\t\t          Bad tail: " << s.m_BadTail.get() << "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::container::msqueue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::container::msqueue::empty_stat const& /*s*/ )
     {
         return o;
     }
@@ -587,7 +587,7 @@ namespace std {
             << "\t\t      fix list call: " << s.m_FixListCount.get() << "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::optimistic_queue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::intrusive::optimistic_queue::empty_stat const& /*s*/ )
     {
         return o;
     }
@@ -615,12 +615,12 @@ namespace std {
                 << "\t      Release pub-record: " << s.m_nReleasePubRecCount.get()<< "\n";
     }
 
-    static inline std::ostream& operator <<( std::ostream& o, cds::container::fcqueue::empty_stat const& s )
+    static inline std::ostream& operator <<( std::ostream& o, cds::container::fcqueue::empty_stat const& /*s*/ )
     {
         return o;
     }
 
-    static inline ostream& operator <<( ostream& o, cds::container::fcdeque::empty_stat const& s )
+    static inline ostream& operator <<( ostream& o, cds::container::fcdeque::empty_stat const& /*s*/ )
     {
         return o;
     }

diff --git a/tests/unit/set2/set_delodd.cpp b/tests/unit/set2/set_delodd.cpp
index 25ca23de25889d8e9fff1d870ce8f60ed7b8188f..dc2b56adfa523c123c2c91a1fcc93da265a4794f 100644 (file)
--- a/tests/unit/set2/set_delodd.cpp
+++ b/tests/unit/set2/set_delodd.cpp
@@ -128,7 +128,7 @@ namespace boost {
 namespace set2 {
 
     template <typename Set>
-    static inline void check_before_clear( Set& s )
+    static inline void check_before_clear( Set& /*s*/ )
     {}
 
     template <typename GC, typename Key, typename T, typename Traits>
@@ -161,7 +161,7 @@ namespace set2 {
             struct ensure_func
             {
                 template <typename Q>
-                void operator()( bool bNew, key_value_pair const&, Q const& )
+                void operator()( bool /*bNew*/, key_value_pair const&, Q const& )
                 {}
             };
         public:

diff --git a/tests/unit/set2/set_insdel_func.h b/tests/unit/set2/set_insdel_func.h
index df0ebc04e63c9912c27fb6bcdc6610644ab975ad..313ba0df5a00d41ff970fcc257870a5473134407 100644 (file)
--- a/tests/unit/set2/set_insdel_func.h
+++ b/tests/unit/set2/set_insdel_func.h
@@ -184,9 +184,9 @@ namespace set2 {
                     , nModified(0)
                 {}
 
-                void operator()( bool bNew, keyval_type& val, size_t nKey )
+                void operator()( bool bNew, keyval_type& val, size_t /*nKey*/ )
                 {
-                    std::unique_lock<typename value_type::lock_type>    ac( val.val.m_access );
+                    std::unique_lock<typename value_type::lock_type> ac( val.val.m_access );
                     if ( !val.val.bInitialized )
                     {
                         val.val.nKey = val.key;

diff --git a/tests/unit/set2/set_types.h b/tests/unit/set2/set_types.h
index 340411b3becc9c3e9b26f8f77de10be34903d92e..20f54a9844d306c65025bb35c60ad5ccdae18b99 100644 (file)
--- a/tests/unit/set2/set_types.h
+++ b/tests/unit/set2/set_types.h
@@ -87,7 +87,7 @@ namespace set2 {
         {}
 
         template <typename Q, typename Pred>
-        bool erase_with( Q const& key, Pred pred )
+        bool erase_with( Q const& key, Pred /*pred*/ )
         {
             return cuckoo_base_class::erase_with( key, typename std::conditional< cuckoo_base_class::c_isSorted, Pred, typename Pred::equal_to>::type() );
         }
@@ -1014,7 +1014,7 @@ namespace set2 {
             {}
 
             template <typename Q, typename Less>
-            bool erase_with( Q const& v, Less pred )
+            bool erase_with( Q const& v, Less /*pred*/ )
             {
                 return base_class::erase( v );
             }
@@ -1038,12 +1038,12 @@ namespace set2 {
 
             resizing_policy_t   m_placeHolder;
         public:
-            StripedHashSet_ord( size_t nCapacity, size_t nLoadFactor )
+            StripedHashSet_ord( size_t /*nCapacity*/, size_t nLoadFactor )
                 : base_class( 0, *(new(&m_placeHolder) resizing_policy_t( nLoadFactor * 1024 )) )
             {}
 
             template <typename Q, typename Less>
-            bool erase_with( Q const& v, Less pred )
+            bool erase_with( Q const& v, Less /*pred*/ )
             {
                 return base_class::erase( v );
             }
@@ -1142,7 +1142,7 @@ namespace set2 {
             {}
 
             template <typename Q, typename Less>
-            bool erase_with( Q const& v, Less pred )
+            bool erase_with( Q const& v, Less /*pred*/ )
             {
                 return base_class::erase( v );
             }
@@ -1166,12 +1166,12 @@ namespace set2 {
 
             resizing_policy_t   m_placeHolder;
         public:
-            RefinableHashSet_ord( size_t nCapacity, size_t nLoadFactor )
+            RefinableHashSet_ord( size_t /*nCapacity*/, size_t nLoadFactor )
                 : base_class( 0, *(new(&m_placeHolder) resizing_policy_t( nLoadFactor * 1024 )) )
             {}
 
             template <typename Q, typename Less>
-            bool erase_with( Q const& v, Less pred )
+            bool erase_with( Q const& v, Less /*pred*/ )
             {
                 return base_class::erase( v );
             }
@@ -1723,7 +1723,7 @@ namespace set2 {
     // *************************************************
 
     template <typename Set>
-    static inline void print_stat( Set const& s )
+    static inline void print_stat( Set const& /*s*/ )
     {}
 
     template <typename GC, typename T, typename Traits>
@@ -1763,15 +1763,15 @@ namespace set2 {
     //*******************************************************
 
     template <typename Set>
-    static inline void additional_check( Set& set )
+    static inline void additional_check( Set& /*set*/ )
     {}
 
     template <typename Set>
-    static inline void additional_cleanup( Set& set )
+    static inline void additional_cleanup( Set& /*set*/ )
     {}
 
     namespace ellen_bintree_check {
-        static inline void check_stat( cds::intrusive::ellen_bintree::empty_stat const& s )
+        static inline void check_stat( cds::intrusive::ellen_bintree::empty_stat const& /*s*/ )
         {
             // Not true for threaded RCU
             /*
@@ -1801,7 +1801,7 @@ namespace set2 {
     }
 
     template <typename GC, typename Key, typename T, typename Traits>
-    static inline void additional_cleanup( cc::EllenBinTreeSet<GC, Key, T, Traits>& s )
+    static inline void additional_cleanup( cc::EllenBinTreeSet<GC, Key, T, Traits>& /*s*/ )
     {
         ellen_bintree_pool::internal_node_counter::reset();
     }

diff --git a/tests/unit/stack/intrusive_stack_type.h b/tests/unit/stack/intrusive_stack_type.h
index b65309469934adb8695ad842d5b3f36bee21b16d..e49fbebf4bc5b0f541a386457d847f1b8a799bb9 100644 (file)
--- a/tests/unit/stack/intrusive_stack_type.h
+++ b/tests/unit/stack/intrusive_stack_type.h
@@ -361,12 +361,12 @@ namespace std {
             << "\t     m_EliminationFailed: " << s.m_EliminationFailed.get()      << "\n";
     }
 
-    static inline ostream& operator <<( ostream& o, cds::intrusive::treiber_stack::empty_stat const& s )
+    static inline ostream& operator <<( ostream& o, cds::intrusive::treiber_stack::empty_stat const& /*s*/ )
     {
         return o;
     }
 
-    static inline ostream& operator <<( ostream& o, cds::intrusive::fcstack::empty_stat const& s )
+    static inline ostream& operator <<( ostream& o, cds::intrusive::fcstack::empty_stat const& /*s*/ )
     {
         return o;
     }

diff --git a/tests/unit/stack/stack_intrusive_pushpop.cpp b/tests/unit/stack/stack_intrusive_pushpop.cpp
index 6c4aa401989fa699ade90b8a5984312de28d91b7..4369bf1c6bdcebc2889c2e1919b092351c477ec8 100644 (file)
--- a/tests/unit/stack/stack_intrusive_pushpop.cpp
+++ b/tests/unit/stack/stack_intrusive_pushpop.cpp
@@ -191,7 +191,7 @@ namespace istack {
         }
 
         template <class Stack>
-        void analyze( CppUnitMini::ThreadPool& pool, Stack& testStack  )
+        void analyze( CppUnitMini::ThreadPool& pool, Stack& /*testStack*/  )
         {
             size_t nPushError = 0;
             size_t nPopEmpty = 0;

diff --git a/tests/unit/stack/stack_pushpop.cpp b/tests/unit/stack/stack_pushpop.cpp
index e6f8078d680d8244bef20d03413aab1156dfa179..65f65e9ec15332dbd3a36ca040768e0ecef8b030 100644 (file)
--- a/tests/unit/stack/stack_pushpop.cpp
+++ b/tests/unit/stack/stack_pushpop.cpp
@@ -156,7 +156,7 @@ namespace stack {
         }
 
         template <class Stack>
-        void analyze( CppUnitMini::ThreadPool& pool, Stack& testStack  )
+        void analyze( CppUnitMini::ThreadPool& pool, Stack& /*testStack*/  )
         {
             size_t nPushError = 0;
             size_t nPopEmpty = 0;

diff --git a/tests/unit/stack/stack_type.h b/tests/unit/stack/stack_type.h
index 45d2167c3212fa2ee13c1fbc7d4cc96fa5d47db2..7fd2fee4be1a5515df80fbdfae6d5195b5accda8 100644 (file)
--- a/tests/unit/stack/stack_type.h
+++ b/tests/unit/stack/stack_type.h
@@ -407,12 +407,12 @@ namespace std {
             << "\t     m_EliminationFailed: " << s.m_EliminationFailed.get()      << "\n";
     }
 
-    static inline ostream& operator <<(ostream& o, cds::container::treiber_stack::empty_stat const& s)
+    static inline ostream& operator <<(ostream& o, cds::container::treiber_stack::empty_stat const& /*s*/)
     {
         return o;
     }
 
-    static inline ostream& operator <<( ostream& o, cds::container::fcstack::empty_stat const& s )
+    static inline ostream& operator <<( ostream& o, cds::container::fcstack::empty_stat const& /*s*/ )
     {
         return o;
     }
@@ -438,7 +438,7 @@ namespace std {
             << "\t      Release pub-record: " << s.m_nReleasePubRecCount.get()<< "\n";
     }
 
-    static inline ostream& operator <<( ostream& o, cds::container::fcdeque::empty_stat const& s )
+    static inline ostream& operator <<( ostream& o, cds::container::fcdeque::empty_stat const& /*s*/ )
     {
         return o;
     }