2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #include "queue_type.h"
33 // Multi-threaded queue test for pop operation
36 static size_t s_nThreadCount = 8;
37 static size_t s_nQueueSize = 20000000 ; // no more than 20 million records
42 SimpleValue(): nNo(0) {}
43 SimpleValue( size_t n ): nNo(n) {}
44 size_t getNo() const { return nNo; }
47 class queue_pop: public cds_test::stress_fixture
58 value_type( size_t n )
63 template <class Queue>
64 class Consumer: public cds_test::thread
66 typedef cds_test::thread base_class;
69 Consumer( cds_test::thread_pool& pool, Queue& queue )
72 , m_arr( new uint8_t[ s_nQueueSize ])
76 Consumer( Consumer& src )
78 , m_Queue( src.m_Queue )
79 , m_arr( new uint8_t[ s_nQueueSize ])
83 virtual thread * clone()
85 return new Consumer( *this );
90 memset( m_arr.get(), 0, sizeof( m_arr[0] ) * s_nQueueSize );
91 typedef typename Queue::value_type value_type;
94 while ( m_Queue.pop( value )) {
98 m_nPopCount = nPopCount;
103 std::unique_ptr< uint8_t[] > m_arr;
108 static void SetUpTestCase()
110 cds_test::config const& cfg = get_config( "queue_pop" );
112 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
113 s_nQueueSize = cfg.get_size_t( "QueueSize", s_nQueueSize );
115 if ( s_nThreadCount == 0 )
117 if ( s_nQueueSize == 0 )
121 //static void TearDownTestCase();
124 template <class Queue>
125 void analyze( Queue& q )
127 cds_test::thread_pool& pool = get_pool();
128 std::unique_ptr< uint8_t[] > arr( new uint8_t[s_nQueueSize] );
129 memset(arr.get(), 0, sizeof(arr[0]) * s_nQueueSize );
131 size_t nTotalPops = 0;
132 for ( size_t i = 0; i < pool.size(); ++i ) {
133 Consumer<Queue>& thread = static_cast<Consumer<Queue>&>(pool.get( i ));
134 for ( size_t i = 0; i < s_nQueueSize; ++i )
135 arr[i] += thread.m_arr[i];
136 nTotalPops += thread.m_nPopCount;
138 EXPECT_EQ( nTotalPops, s_nQueueSize );
139 EXPECT_TRUE( q.empty());
141 for ( size_t i = 0; i < s_nQueueSize; ++i ) {
142 EXPECT_EQ( arr[i], 1 ) << "i=" << i;
146 template <class Queue>
147 void test( Queue& q )
149 cds_test::thread_pool& pool = get_pool();
151 pool.add( new Consumer<Queue>( pool, q ), s_nThreadCount );
153 for ( size_t i = 0; i < s_nQueueSize; ++i )
156 propout() << std::make_pair( "thread_count", s_nThreadCount )
157 << std::make_pair( "push_count", s_nQueueSize );
159 std::chrono::milliseconds duration = pool.run();
161 propout() << std::make_pair( "duration", duration );
165 propout() << q.statistics();
169 CDSSTRESS_MSQueue( queue_pop )
170 CDSSTRESS_MoirQueue( queue_pop )
171 CDSSTRESS_BasketQueue( queue_pop )
172 CDSSTRESS_OptimsticQueue( queue_pop )
173 CDSSTRESS_FCQueue( queue_pop )
174 CDSSTRESS_FCDeque( queue_pop )
175 CDSSTRESS_RWQueue( queue_pop )
176 CDSSTRESS_StdQueue( queue_pop )
178 #undef CDSSTRESS_Queue_F
179 #define CDSSTRESS_Queue_F( test_fixture, type_name ) \
180 TEST_F( test_fixture, type_name ) \
182 typedef queue::Types< value_type >::type_name queue_type; \
183 queue_type queue( s_nQueueSize ); \
187 CDSSTRESS_VyukovQueue( queue_pop )
189 #undef CDSSTRESS_Queue_F
192 // ********************************************************************
193 // SegmentedQueue test
195 class segmented_queue_pop
197 , public ::testing::WithParamInterface< size_t >
199 typedef queue_pop base_class;
202 template <typename Queue>
205 size_t quasi_factor = GetParam();
207 Queue q( quasi_factor );
208 propout() << std::make_pair( "quasi_factor", quasi_factor );
209 base_class::test( q );
213 static std::vector< size_t > get_test_parameters()
215 cds_test::config const& cfg = cds_test::stress_fixture::get_config( "queue_pop" );
216 bool bIterative = cfg.get_bool( "SegmentedQueue_Iterate", false );
217 size_t quasi_factor = cfg.get_size_t( "SegmentedQueue_SegmentSize", 256 );
219 std::vector<size_t> args;
220 if ( bIterative && quasi_factor > 4 ) {
221 for ( size_t qf = 4; qf <= quasi_factor; qf *= 2 )
222 args.push_back( qf );
225 if ( quasi_factor > 2 )
226 args.push_back( quasi_factor );
235 #define CDSSTRESS_Queue_F( test_fixture, type_name ) \
236 TEST_P( test_fixture, type_name ) \
238 typedef typename queue::Types<value_type>::type_name queue_type; \
239 test< queue_type >(); \
242 CDSSTRESS_SegmentedQueue( segmented_queue_pop )
244 INSTANTIATE_TEST_CASE_P( SQ,
246 ::testing::ValuesIn( segmented_queue_pop::get_test_parameters()));