--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#include "pqueue_type.h"
+#include "item.h"
+
+namespace pqueue {
+
+ static size_t s_nThreadCount = 8;
+ static size_t s_nQueueSize = 2000000;
+
+ class pqueue_push: public cds_test::stress_fixture
+ {
+ typedef cds_test::stress_fixture base_class;
+
+ protected:
+ template <class PQueue>
+ class Producer: public cds_test::thread
+ {
+ typedef cds_test::thread base_class;
+
+ public:
+ Producer( cds_test::thread_pool& pool, PQueue& queue )
+ : base_class( pool )
+ , m_Queue( queue )
+ {}
+
+ Producer( Producer& src )
+ : base_class( src )
+ , m_Queue( src.m_Queue )
+ {}
+
+ virtual thread * clone()
+ {
+ return new Producer( *this );
+ }
+
+ virtual void test()
+ {
+ typedef typename PQueue::value_type value_type;
+
+ for ( auto it = m_arr.begin(); it != m_arr.end(); ++it ) {
+ if ( !m_Queue.push( value_type( *it )))
+ ++m_nPushError;
+ }
+ }
+
+ void prepare( size_t nStart, size_t nEnd )
+ {
+ m_arr.reserve( nEnd - nStart );
+ for ( size_t i = nStart; i < nEnd; ++i )
+ m_arr.push_back( i );
+ shuffle( m_arr.begin(), m_arr.end());
+ }
+
+ public:
+ PQueue& m_Queue;
+ size_t m_nPushError = 0;
+ std::vector<size_t> m_arr;
+ };
+
+ protected:
+ template <class PQueue>
+ void analyze( PQueue& q )
+ {
+ cds_test::thread_pool& pool = get_pool();
+
+ for ( size_t i = 0; i < pool.size(); ++i ) {
+ Producer<PQueue>& prod = static_cast<Producer<PQueue>&>(pool.get( i ));
+ EXPECT_EQ( prod.m_nPushError, 0u ) << "producer=" << i;
+ }
+ EXPECT_FALSE( q.empty());
+
+ typedef std::vector<size_t> vector_type;
+ vector_type arr;
+ arr.reserve( s_nQueueSize );
+
+ size_t nPopped = 0;
+ typename PQueue::value_type val;
+ while ( q.pop( val )) {
+ nPopped++;
+ arr.push_back( val.key );
+ }
+
+ EXPECT_EQ( arr.size(), s_nQueueSize );
+ auto it = arr.begin();
+ size_t nPrev = *it;
+ ++it;
+ for ( auto itEnd = arr.end(); it != itEnd; ++it ) {
+ EXPECT_EQ( nPrev - 1, *it );
+ nPrev = *it;
+ }
+ }
+
+ template <class PQueue>
+ void test( PQueue& q )
+ {
+ cds_test::thread_pool& pool = get_pool();
+ pool.add( new Producer<PQueue>( pool, q ), s_nThreadCount );
+
+ size_t nStart = 0;
+ size_t nThreadItemCount = s_nQueueSize / s_nThreadCount;
+ s_nQueueSize = nThreadItemCount * s_nThreadCount;
+
+ for ( size_t i = 0; i < pool.size(); ++i ) {
+ static_cast<Producer<PQueue>&>(pool.get( i )).prepare( nStart, nStart + nThreadItemCount );
+ nStart += nThreadItemCount;
+ }
+
+ propout() << std::make_pair( "thread_count", s_nThreadCount )
+ << std::make_pair( "push_count", s_nQueueSize );
+
+ std::chrono::milliseconds duration = pool.run();
+ propout() << std::make_pair( "duration", duration );
+
+ analyze( q );
+
+ propout() << q.statistics();
+ }
+
+ public:
+ static void SetUpTestCase()
+ {
+ cds_test::config const& cfg = get_config( "pqueue_push" );
+
+ s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
+ s_nQueueSize = cfg.get_size_t( "QueueSize", s_nQueueSize );
+
+ if ( s_nThreadCount == 0u )
+ s_nThreadCount = 1;
+ if ( s_nQueueSize == 0u )
+ s_nQueueSize = 1000;
+ }
+
+ //static void TearDownTestCase();
+ };
+
+#define CDSSTRESS_MSPriorityQueue( fixture_t, pqueue_t ) \
+ TEST_F( fixture_t, pqueue_t ) \
+ { \
+ typedef pqueue::Types<pqueue::simple_value>::pqueue_t pqueue_type; \
+ pqueue_type pq( s_nQueueSize ); \
+ test( pq ); \
+ }
+ CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_dyn_less )
+ CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_dyn_less_stat )
+ CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_dyn_cmp )
+ //CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_dyn_mutex ) // too slow
+
+#define CDSSTRESS_MSPriorityQueue_static( fixture_t, pqueue_t ) \
+ TEST_F( fixture_t, pqueue_t ) \
+ { \
+ typedef pqueue::Types<pqueue::simple_value>::pqueue_t pqueue_type; \
+ std::unique_ptr< pqueue_type > pq( new pqueue_type ); \
+ test( *pq.get()); \
+ }
+ //CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_static_less )
+ //CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_static_less_stat )
+ //CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_static_cmp )
+ //CDSSTRESS_MSPriorityQueue( pqueue_push, MSPriorityQueue_static_mutex )
+
+
+#define CDSSTRESS_PriorityQueue( fixture_t, pqueue_t ) \
+ TEST_F( fixture_t, pqueue_t ) \
+ { \
+ typedef pqueue::Types<pqueue::simple_value>::pqueue_t pqueue_type; \
+ pqueue_type pq; \
+ test( pq ); \
+ }
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_vector )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_vector_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_deque )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_deque_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_boost_deque )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_boost_deque_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_boost_stable_vector )
+ CDSSTRESS_PriorityQueue( pqueue_push, FCPQueue_boost_stable_vector_stat )
+
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_HP_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_HP_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_HP_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_HP_min_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_DHP_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_DHP_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_DHP_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_DHP_min_stat )
+ // CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpi_max )
+ // CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpi_max_stat )
+ // CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpi_min )
+ // CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpi_min_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpb_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpb_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpb_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpb_min_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpt_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpt_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpt_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_gpt_min_stat )
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_shb_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_shb_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_shb_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, EllenBinTree_RCU_shb_min_stat )
+#endif
+
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_HP_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_HP_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_HP_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_HP_min_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_DHP_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_DHP_max_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_DHP_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_DHP_min_stat )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpi_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpi_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpb_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpb_min )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpt_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_gpt_min )
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_shb_max )
+ CDSSTRESS_PriorityQueue( pqueue_push, SkipList32_RCU_shb_min )
+#endif
+
+ CDSSTRESS_PriorityQueue( pqueue_push, StdPQueue_vector_spin )
+ CDSSTRESS_PriorityQueue( pqueue_push, StdPQueue_vector_mutex )
+ CDSSTRESS_PriorityQueue( pqueue_push, StdPQueue_deque_spin )
+ CDSSTRESS_PriorityQueue( pqueue_push, StdPQueue_deque_mutex )
+
+} // namespace queue
+
projects / c11concurrency-benchmarks.git / blobdiff