+++ /dev/null
-/*
- This file is a part of libcds - Concurrent Data Structures library
-
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
-
- 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.
-*/
-
-#ifndef CDSTEST_HDR_QUEUE_SEGMENTED_QUEUE_H
-#define CDSTEST_HDR_QUEUE_SEGMENTED_QUEUE_H
-
-#include "cppunit/cppunit_proxy.h"
-#include <cds/intrusive/details/base.h>
-#include "size_check.h"
-
-namespace queue {
-
- class HdrSegmentedQueue: public CppUnitMini::TestCase
- {
- struct item {
- size_t nVal;
-
- item() {}
- item( size_t v ): nVal(v) {}
- item( size_t nMajor, size_t nMinor ): nVal( nMajor * 16 + nMinor ) {}
- };
-
- struct other_item {
- size_t nVal;
- };
-
- template <typename Queue>
- void test()
- {
- for ( size_t nQuasiFactor = 2; nQuasiFactor <= 256; ++nQuasiFactor ) {
- CPPUNIT_MSG( "QuasiFactor=" << nQuasiFactor << "..." );
- test_qf<Queue>( nQuasiFactor );
- }
- }
-
- template <typename Queue>
- void test_qf( size_t nQuasiFactor )
- {
- typedef typename Queue::value_type value_type;
-
- static size_t const c_nItemCount = 1000;
-
- {
- Queue q( nQuasiFactor );
- CPPUNIT_CHECK( q.quasi_factor() == cds::beans::ceil2(nQuasiFactor) );
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
-
- // push/enqueue
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- if ( i & 1 ) {
- CPPUNIT_ASSERT( q.push(item(i)) );
- }
- else {
- CPPUNIT_ASSERT( q.enqueue(item(i)) );
- }
- CPPUNIT_CHECK( misc::check_size( q, i + 1 ));
- CPPUNIT_CHECK( !q.empty() );
- }
-
- // pop/dequeue
- size_t nCount = 0;
- while ( !q.empty() ) {
- value_type v;
- if ( nCount & 1 ) {
- CPPUNIT_ASSERT( q.pop( v ) );
- }
- else {
- CPPUNIT_ASSERT( q.dequeue( v ));
- }
-
- int nSegment = int( nCount / q.quasi_factor() );
- int nMin = nSegment * int(q.quasi_factor());
- int nMax = nMin + int(q.quasi_factor()) - 1;
- CPPUNIT_CHECK_EX( nMin <= static_cast<int>(v.nVal) && static_cast<int>( v.nVal ) <= nMax, nMin << " <= " << v.nVal << " <= " << nMax );
-
- ++nCount;
- CPPUNIT_CHECK( misc::check_size( q, c_nItemCount - nCount ));
- }
- CPPUNIT_CHECK( nCount == c_nItemCount );
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
-
-
- // push/pop with functor
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- other_item itm;
- itm.nVal = i;
- if ( i & 1 ) {
- CPPUNIT_ASSERT( q.push_with( [&itm]( item& dest ) { dest.nVal = itm.nVal; } ));
- }
- else {
- CPPUNIT_ASSERT( q.enqueue_with( [&itm]( item& dest ) { dest.nVal = itm.nVal; } ));
- }
- CPPUNIT_CHECK( misc::check_size( q, i + 1 ));
- CPPUNIT_CHECK( !q.empty() );
- }
-
- {
- other_item v;
-
- nCount = 0;
- size_t nFuncCount = 0;
- while ( !q.empty() ) {
- if ( nCount & 1 ) {
- CPPUNIT_ASSERT( q.pop_with( [&v, &nFuncCount]( item& src ) {v.nVal = src.nVal; ++nFuncCount; } ));
- }
- else {
- CPPUNIT_ASSERT( q.dequeue_with( [&v, &nFuncCount]( item& src ) {v.nVal = src.nVal; ++nFuncCount; } ));
- }
-
- // It is possible c_nItemCount % quasi_factor() != 0
- // In this case the segment cannot be calculated here
- size_t nMin = nCount > q.quasi_factor() ? nCount - q.quasi_factor() : 0;
- size_t nMax = nCount + q.quasi_factor();
- CPPUNIT_CHECK_EX( nMin <= v.nVal && v.nVal <= nMax, nMin << " <= " << v.nVal << " <= " << nMax );
-
- ++nCount;
- CPPUNIT_CHECK( nFuncCount == nCount );
- CPPUNIT_CHECK( misc::check_size( q, c_nItemCount - nCount ));
- }
- CPPUNIT_CHECK( nCount == c_nItemCount );
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
- }
-
- //emplace
- {
- size_t nMajor = 0;
- size_t nMinor = 0;
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- CPPUNIT_CHECK( q.emplace( nMajor, nMinor ));
- if ( nMinor == 15 ) {
- ++nMajor;
- nMinor = 0;
- }
- else
- ++nMinor;
- CPPUNIT_CHECK( !q.empty() );
- }
- CPPUNIT_CHECK( misc::check_size( q, c_nItemCount ));
-
- nCount = 0;
- while ( !q.empty() ) {
- value_type v;
- if ( nCount & 1 ) {
- CPPUNIT_ASSERT( q.pop( v ) );
- }
- else {
- CPPUNIT_ASSERT( q.dequeue( v ));
- }
-
- size_t nMin = nCount > q.quasi_factor() ? nCount - q.quasi_factor() : 0;
- size_t nMax = nCount + q.quasi_factor();
- CPPUNIT_CHECK_EX( nMin <= v.nVal && v.nVal <= nMax, nMin << " <= " << v.nVal << " <= " << nMax );
-
- ++nCount;
- CPPUNIT_CHECK( misc::check_size( q, c_nItemCount - nCount ));
- }
- CPPUNIT_CHECK( nCount == c_nItemCount );
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
- }
-
- // pop from empty queue
- {
- value_type v;
- v.nVal = c_nItemCount + 1;
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_ASSERT( !q.pop( v ));
- CPPUNIT_CHECK( q.empty() );
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
- CPPUNIT_CHECK( v.nVal == c_nItemCount + 1 );
- }
-
- // clear
- for ( size_t i = 0; i < c_nItemCount; ++i ) {
- if ( i & 1 ) {
- CPPUNIT_ASSERT( q.push(item(i)) );
- }
- else {
- CPPUNIT_ASSERT( q.enqueue(item(i)) );
- }
- CPPUNIT_CHECK( misc::check_size( q, i + 1 ));
- CPPUNIT_CHECK( !q.empty() );
- }
-
- q.clear();
- CPPUNIT_CHECK( misc::check_size( q, 0 ));
- CPPUNIT_CHECK( q.empty() );
- }
- }
-
- void SegmQueue_HP();
- void SegmQueue_HP_mutex();
- void SegmQueue_HP_shuffle();
- void SegmQueue_HP_stat();
- void SegmQueue_HP_cacheline_padding();
- void SegmQueue_HP_mutex_cacheline_padding();
- void SegmQueue_HP_shuffle_cacheline_padding();
- void SegmQueue_HP_stat_cacheline_padding();
-
- void SegmQueue_DHP();
- void SegmQueue_DHP_mutex();
- void SegmQueue_DHP_shuffle();
- void SegmQueue_DHP_stat();
- void SegmQueue_DHP_cacheline_padding();
- void SegmQueue_DHP_mutex_cacheline_padding();
- void SegmQueue_DHP_shuffle_cacheline_padding();
- void SegmQueue_DHP_stat_cacheline_padding();
-
- CPPUNIT_TEST_SUITE(HdrSegmentedQueue)
- CPPUNIT_TEST( SegmQueue_HP )
- CPPUNIT_TEST( SegmQueue_HP_mutex )
- CPPUNIT_TEST( SegmQueue_HP_shuffle )
- CPPUNIT_TEST( SegmQueue_HP_stat )
- CPPUNIT_TEST( SegmQueue_HP_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_HP_mutex_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_HP_shuffle_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_HP_stat_cacheline_padding )
-
- CPPUNIT_TEST( SegmQueue_DHP )
- CPPUNIT_TEST( SegmQueue_DHP_mutex )
- CPPUNIT_TEST( SegmQueue_DHP_shuffle )
- CPPUNIT_TEST( SegmQueue_DHP_stat )
- CPPUNIT_TEST( SegmQueue_DHP_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_DHP_mutex_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_DHP_shuffle_cacheline_padding )
- CPPUNIT_TEST( SegmQueue_DHP_stat_cacheline_padding )
- CPPUNIT_TEST_SUITE_END()
-
- };
-} // namespace queue
-
-#endif //#ifndef CDSTEST_HDR_QUEUE_SEGMENTED_QUEUE_H
projects / libcds.git / blobdiff