6 #include "set2/set_types.h"
7 #include "cppunit/thread.h"
9 #include <cds/lock/spinlock.h>
13 # define TEST_SET(X) void X() { test<SetTypes<key_type, value_type>::X >() ; }
14 # define TEST_SET_EXTRACT(X) TEST_SET(X)
15 # define TEST_SET_NOLF(X) void X() { test_nolf<SetTypes<key_type, value_type>::X >() ; }
16 # define TEST_SET_NOLF_EXTRACT(X) TEST_SET_NOLF(X)
18 class Set_InsDel_func: public CppUnitMini::TestCase
20 static size_t c_nMapSize ; // map size
21 static size_t c_nInsertThreadCount ; // count of insertion thread
22 static size_t c_nDeleteThreadCount ; // count of deletion thread
23 static size_t c_nEnsureThreadCount ; // count of ensure thread
24 static size_t c_nThreadPassCount ; // pass count for each thread
25 static size_t c_nMaxLoadFactor ; // maximum load factor
26 static bool c_bPrintGCState;
28 typedef size_t key_type;
32 atomics::atomic<size_t> nEnsureCall;
33 bool volatile bInitialized;
34 cds::OS::ThreadId threadId ; // insert thread id
36 typedef cds::lock::Spinlock< cds::backoff::pause > lock_type;
37 mutable lock_type m_access;
43 , bInitialized( false )
44 , threadId( cds::OS::getCurrentThreadId() )
47 value_type( value_type const& s )
50 , nEnsureCall(s.nEnsureCall.load(atomics::memory_order_relaxed))
51 , bInitialized( s.bInitialized )
52 , threadId( cds::OS::getCurrentThreadId() )
55 // boost::container::flat_map requires operator =
56 value_type& operator=( value_type const& v )
60 nEnsureCall.store( v.nEnsureCall.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed );
61 bInitialized = v.bInitialized;
74 class Inserter: public CppUnitMini::TestThread
77 typedef typename Set::value_type keyval_type;
79 virtual Inserter * clone()
81 return new Inserter( *this );
84 struct insert_functor {
85 size_t nTestFunctorRef;
91 void operator()( keyval_type& val )
93 cds::lock::scoped_lock< typename value_type::lock_type> ac( val.val.m_access );
95 val.val.nKey = val.key;
96 val.val.nData = val.key * 8;
99 val.val.bInitialized = true;
104 size_t m_nInsertSuccess;
105 size_t m_nInsertFailed;
107 size_t m_nTestFunctorRef;
110 Inserter( CppUnitMini::ThreadPool& pool, Set& rSet )
111 : CppUnitMini::TestThread( pool )
114 Inserter( Inserter& src )
115 : CppUnitMini::TestThread( src )
119 Set_InsDel_func& getTest()
121 return reinterpret_cast<Set_InsDel_func&>( m_Pool.m_Test );
124 virtual void init() { cds::threading::Manager::attachThread() ; }
125 virtual void fini() { cds::threading::Manager::detachThread() ; }
133 m_nTestFunctorRef = 0;
135 size_t * pKeyFirst = getTest().m_pKeyFirst;
136 size_t * pKeyLast = getTest().m_pKeyLast;
138 // func is passed by reference
141 if ( m_nThreadNo & 1 ) {
142 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
143 for ( size_t * p = pKeyFirst; p < pKeyLast; ++p ) {
144 if ( rSet.insert( *p, std::ref(func) ) )
152 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
153 for ( size_t * p = pKeyLast - 1; p >= pKeyFirst; --p ) {
154 if ( rSet.insert( *p, std::ref(func) ) )
162 m_nTestFunctorRef = func.nTestFunctorRef;
167 class Ensurer: public CppUnitMini::TestThread
170 typedef typename Set::value_type keyval_type;
172 virtual Ensurer * clone()
174 return new Ensurer( *this );
177 struct ensure_functor {
186 void operator()( bool bNew, keyval_type& val, size_t nKey )
188 cds::lock::scoped_lock<typename value_type::lock_type> ac( val.val.m_access );
189 if ( !val.val.bInitialized )
191 val.val.nKey = val.key;
192 val.val.nData = val.key * 8;
193 val.val.bInitialized = true;
200 val.val.nEnsureCall.fetch_add( 1, atomics::memory_order_relaxed );
205 ensure_functor(const ensure_functor& );
209 size_t m_nEnsureFailed;
210 size_t m_nEnsureCreated;
211 size_t m_nEnsureExisted;
212 size_t m_nFunctorCreated;
213 size_t m_nFunctorModified;
216 Ensurer( CppUnitMini::ThreadPool& pool, Set& rSet )
217 : CppUnitMini::TestThread( pool )
220 Ensurer( Ensurer& src )
221 : CppUnitMini::TestThread( src )
225 Set_InsDel_func& getTest()
227 return reinterpret_cast<Set_InsDel_func&>( m_Pool.m_Test );
230 virtual void init() { cds::threading::Manager::attachThread() ; }
231 virtual void fini() { cds::threading::Manager::detachThread() ; }
241 size_t * pKeyFirst = getTest().m_pKeyFirst;
242 size_t * pKeyLast = getTest().m_pKeyLast;
246 if ( m_nThreadNo & 1 ) {
247 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
248 for ( size_t * p = pKeyFirst; p < pKeyLast; ++p ) {
249 std::pair<bool, bool> ret = rSet.ensure( *p, std::ref( func ) );
262 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
263 for ( size_t * p = pKeyLast - 1 ; p >= pKeyFirst; --p ) {
264 std::pair<bool, bool> ret = rSet.ensure( *p, std::ref( func ) );
277 m_nFunctorCreated = func.nCreated;
278 m_nFunctorModified = func.nModified;
283 class Deleter: public CppUnitMini::TestThread
286 typedef typename Set::value_type keyval_type;
288 virtual Deleter * clone()
290 return new Deleter( *this );
293 struct value_container
306 struct erase_functor {
307 value_container m_cnt;
309 void operator ()( keyval_type const& itm )
311 keyval_type& item = const_cast<keyval_type&>(itm);
315 cds::lock::scoped_lock< typename value_type::lock_type> ac( item.val.m_access );
316 if ( item.val.bInitialized ) {
317 if ( m_cnt.nKeyExpected == item.val.nKey && m_cnt.nKeyExpected * 8 == item.val.nData )
318 ++m_cnt.nSuccessItem;
329 cds::backoff::yield()();
335 size_t m_nDeleteSuccess;
336 size_t m_nDeleteFailed;
338 size_t m_nValueSuccess;
339 size_t m_nValueFailed;
342 Deleter( CppUnitMini::ThreadPool& pool, Set& rSet )
343 : CppUnitMini::TestThread( pool )
346 Deleter( Deleter& src )
347 : CppUnitMini::TestThread( src )
351 Set_InsDel_func& getTest()
353 return reinterpret_cast<Set_InsDel_func&>( m_Pool.m_Test );
356 virtual void init() { cds::threading::Manager::attachThread() ; }
357 virtual void fini() { cds::threading::Manager::detachThread() ; }
366 size_t * pKeyFirst = getTest().m_pKeyFirst;
367 size_t * pKeyLast = getTest().m_pKeyLast;
371 if ( m_nThreadNo & 1 ) {
372 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
373 for ( size_t * p = pKeyFirst; p < pKeyLast; ++p ) {
374 func.m_cnt.nKeyExpected = *p;
375 if ( rSet.erase( *p, std::ref(func) ))
383 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
384 for ( size_t * p = pKeyLast - 1; p >= pKeyFirst; --p ) {
385 func.m_cnt.nKeyExpected = *p;
386 if ( rSet.erase( *p, std::ref(func) ))
394 m_nValueSuccess = func.m_cnt.nSuccessItem;
395 m_nValueFailed = func.m_cnt.nFailedItem;
401 void do_test( size_t nLoadFactor )
403 CPPUNIT_MSG( "Load factor=" << nLoadFactor );
405 Set testSet( c_nMapSize, nLoadFactor );
406 do_test_with( testSet );
410 void do_test_with( Set& testSet )
412 typedef Inserter<Set> InserterThread;
413 typedef Deleter<Set> DeleterThread;
414 typedef Ensurer<Set> EnsurerThread;
416 m_pKeyArr = new size_t[ c_nMapSize ];
417 m_pKeyFirst = m_pKeyArr;
418 m_pKeyLast = m_pKeyFirst + c_nMapSize;
419 for ( size_t i = 0; i < c_nMapSize; ++i )
421 std::random_shuffle( m_pKeyFirst, m_pKeyLast );
423 cds::OS::Timer timer;
425 CppUnitMini::ThreadPool pool( *this );
426 pool.add( new InserterThread( pool, testSet ), c_nInsertThreadCount );
427 pool.add( new DeleterThread( pool, testSet ), c_nDeleteThreadCount );
428 pool.add( new EnsurerThread( pool, testSet ), c_nEnsureThreadCount );
430 CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
434 size_t nInsertSuccess = 0;
435 size_t nInsertFailed = 0;
436 size_t nDeleteSuccess = 0;
437 size_t nDeleteFailed = 0;
438 size_t nDelValueSuccess = 0;
439 size_t nDelValueFailed = 0;
440 size_t nEnsureFailed = 0;
441 size_t nEnsureCreated = 0;
442 size_t nEnsureModified = 0;
443 size_t nEnsFuncCreated = 0;
444 size_t nEnsFuncModified = 0;
445 size_t nTestFunctorRef = 0;
447 for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
448 InserterThread * pThread = dynamic_cast<InserterThread *>( *it );
450 nInsertSuccess += pThread->m_nInsertSuccess;
451 nInsertFailed += pThread->m_nInsertFailed;
452 nTestFunctorRef += pThread->m_nTestFunctorRef;
455 DeleterThread * p = dynamic_cast<DeleterThread *>( *it );
457 nDeleteSuccess += p->m_nDeleteSuccess;
458 nDeleteFailed += p->m_nDeleteFailed;
459 nDelValueSuccess += p->m_nValueSuccess;
460 nDelValueFailed += p->m_nValueFailed;
463 EnsurerThread * pEns = static_cast<EnsurerThread *>( *it );
464 nEnsureCreated += pEns->m_nEnsureCreated;
465 nEnsureModified += pEns->m_nEnsureExisted;
466 nEnsureFailed += pEns->m_nEnsureFailed;
467 nEnsFuncCreated += pEns->m_nFunctorCreated;
468 nEnsFuncModified += pEns->m_nFunctorModified;
474 " Totals: Ins succ=" << nInsertSuccess
475 << " Del succ=" << nDeleteSuccess << "\n"
476 << " : Ins fail=" << nInsertFailed
477 << " Del fail=" << nDeleteFailed << "\n"
478 << " : Ensure succ=" << (nEnsureCreated + nEnsureModified) << " fail=" << nEnsureFailed
479 << " create=" << nEnsureCreated << " modify=" << nEnsureModified << "\n"
480 << " Set size=" << testSet.size()
483 CPPUNIT_CHECK_EX( nDelValueFailed == 0, "Functor del failed=" << nDelValueFailed );
484 CPPUNIT_CHECK_EX( nDelValueSuccess == nDeleteSuccess, "Delete success=" << nDeleteSuccess << " functor=" << nDelValueSuccess );
486 CPPUNIT_CHECK( nEnsureFailed == 0 );
488 CPPUNIT_CHECK_EX( nEnsureCreated == nEnsFuncCreated, "Ensure created=" << nEnsureCreated << " functor=" << nEnsFuncCreated );
489 CPPUNIT_CHECK_EX( nEnsureModified == nEnsFuncModified, "Ensure modified=" << nEnsureModified << " functor=" << nEnsFuncModified );
491 // nTestFunctorRef is call count of insert functor
492 CPPUNIT_CHECK_EX( nTestFunctorRef == nInsertSuccess, "nInsertSuccess=" << nInsertSuccess << " functor nTestFunctorRef=" << nTestFunctorRef );
494 CPPUNIT_MSG( " Clear set (single-threaded)..." );
497 CPPUNIT_MSG( " Duration=" << timer.duration() );
498 CPPUNIT_CHECK( testSet.empty() );
500 additional_check( testSet );
501 print_stat( testSet );
503 additional_cleanup( testSet );
509 CPPUNIT_MSG( "Thread count: insert=" << c_nInsertThreadCount
510 << " delete=" << c_nDeleteThreadCount
511 << " ensure=" << c_nEnsureThreadCount
512 << " pass count=" << c_nThreadPassCount
513 << " map size=" << c_nMapSize
516 for ( size_t nLoadFactor = 1; nLoadFactor <= c_nMaxLoadFactor; nLoadFactor *= 2 ) {
517 do_test<Set>( nLoadFactor );
518 if ( c_bPrintGCState )
526 CPPUNIT_MSG( "Thread count: insert=" << c_nInsertThreadCount
527 << " delete=" << c_nDeleteThreadCount
528 << " ensure=" << c_nEnsureThreadCount
529 << " pass count=" << c_nThreadPassCount
530 << " map size=" << c_nMapSize
535 if ( c_bPrintGCState )
539 void setUpParams( const CppUnitMini::TestCfg& cfg ) {
540 c_nInsertThreadCount = cfg.getULong("InsertThreadCount", 4 );
541 c_nDeleteThreadCount = cfg.getULong("DeleteThreadCount", 4 );
542 c_nEnsureThreadCount = cfg.getULong("EnsureThreadCount", 4 );
543 c_nThreadPassCount = cfg.getULong("ThreadPassCount", 4 );
544 c_nMapSize = cfg.getULong("MapSize", 1000000 );
545 c_nMaxLoadFactor = cfg.getULong("MaxLoadFactor", 8 );
546 c_bPrintGCState = cfg.getBool("PrintGCStateFlag", true );
549 void run_MichaelSet(const char *in_name, bool invert = false);
550 void run_SplitList(const char *in_name, bool invert = false);
551 void run_StripedSet(const char *in_name, bool invert = false);
552 void run_RefinableSet(const char *in_name, bool invert = false);
553 void run_CuckooSet(const char *in_name, bool invert = false);
554 void run_SkipListSet(const char *in_name, bool invert = false);
555 void run_EllenBinTreeSet(const char *in_name, bool invert = false);
557 typedef CppUnitMini::TestCase Base;
558 virtual void myRun(const char *in_name, bool invert = false)
560 setUpParams( m_Cfg.get( "Map_InsDel_func" ));
562 run_MichaelSet(in_name, invert);
563 run_SplitList(in_name, invert);
564 run_SkipListSet(in_name, invert);
565 run_EllenBinTreeSet(in_name, invert);
566 run_StripedSet(in_name, invert);
567 run_RefinableSet(in_name, invert);
568 run_CuckooSet(in_name, invert);
574 # include "set2/set_defs.h"
575 CDSUNIT_DECLARE_MichaelSet
576 CDSUNIT_DECLARE_SplitList
577 CDSUNIT_DECLARE_StripedSet
578 CDSUNIT_DECLARE_RefinableSet
579 CDSUNIT_DECLARE_CuckooSet
580 CDSUNIT_DECLARE_SkipListSet
581 CDSUNIT_DECLARE_EllenBinTreeSet