4 #include <mutex> //unique_lock
5 #include "map2/map_type.h"
6 #include "cppunit/thread.h"
8 #include <cds/sync/spinlock.h>
13 # define TEST_MAP(IMPL, C, X) void C::X() { test<map_type<IMPL, key_type, value_type>::X >() ; }
14 # define TEST_MAP_EXTRACT(IMPL, C, X) TEST_MAP(IMPL, C, X)
15 # define TEST_MAP_NOLF(IMPL, C, X) void C::X() { test_nolf<map_type<IMPL, key_type, value_type>::X >() ; }
16 # define TEST_MAP_NOLF_EXTRACT(IMPL, C, X) TEST_MAP_NOLF(IMPL, C, X)
18 class Map_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 atomics::atomic<bool> bInitialized;
34 cds::OS::ThreadId threadId ; // insert thread id
36 typedef cds::sync::spin_lock< cds::backoff::pause > lock_type;
37 mutable lock_type m_access;
43 , bInitialized( false )
44 , threadId( cds::OS::get_current_thread_id() )
47 value_type( value_type const& s )
50 , nEnsureCall(s.nEnsureCall.load(atomics::memory_order_relaxed))
51 , bInitialized( s.bInitialized.load(atomics::memory_order_relaxed) )
52 , threadId( cds::OS::get_current_thread_id() )
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.store(v.bInitialized.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed);
67 typedef std::vector<key_type> key_array;
68 key_array m_arrValues;
71 class Inserter: public CppUnitMini::TestThread
75 virtual Inserter * clone()
77 return new Inserter( *this );
80 struct insert_functor {
81 size_t nTestFunctorRef;
87 template <typename Pair>
88 void operator()( Pair& val )
90 operator()( val.first, val.second );
93 template <typename Key, typename Val >
94 void operator()( Key const& key, Val& v )
96 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
102 v.bInitialized.store( true, atomics::memory_order_relaxed);
107 size_t m_nInsertSuccess;
108 size_t m_nInsertFailed;
110 size_t m_nTestFunctorRef;
113 Inserter( CppUnitMini::ThreadPool& pool, Map& rMap )
114 : CppUnitMini::TestThread( pool )
117 Inserter( Inserter& src )
118 : CppUnitMini::TestThread( src )
122 Map_InsDel_func& getTest()
124 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
127 virtual void init() { cds::threading::Manager::attachThread() ; }
128 virtual void fini() { cds::threading::Manager::detachThread() ; }
136 m_nTestFunctorRef = 0;
138 // func is passed by reference
140 key_array const& arr = getTest().m_arrValues;
142 if ( m_nThreadNo & 1 ) {
143 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
144 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
145 if ( rMap.insert_with( *it, std::ref(func) ) )
153 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
154 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
155 if ( rMap.insert_with( *it, std::ref(func) ) )
163 m_nTestFunctorRef = func.nTestFunctorRef;
168 class Ensurer: public CppUnitMini::TestThread
172 virtual Ensurer * clone()
174 return new Ensurer( *this );
177 struct ensure_functor {
186 template <typename Key, typename Val>
187 void operator()( bool bNew, Key const& key, Val& v )
189 std::unique_lock<typename value_type::lock_type> ac( v.m_access );
194 v.bInitialized.store( true, atomics::memory_order_relaxed);
197 v.nEnsureCall.fetch_add( 1, atomics::memory_order_relaxed );
202 template <typename Pair>
203 void operator()( bool bNew, Pair& val )
205 operator()( bNew, val.first, val.second );
208 ensure_functor(const ensure_functor& );
212 size_t m_nEnsureFailed;
213 size_t m_nEnsureCreated;
214 size_t m_nEnsureExisted;
215 size_t m_nFunctorCreated;
216 size_t m_nFunctorModified;
219 Ensurer( CppUnitMini::ThreadPool& pool, Map& rMap )
220 : CppUnitMini::TestThread( pool )
223 Ensurer( Ensurer& src )
224 : CppUnitMini::TestThread( src )
228 Map_InsDel_func& getTest()
230 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
233 virtual void init() { cds::threading::Manager::attachThread() ; }
234 virtual void fini() { cds::threading::Manager::detachThread() ; }
246 key_array const& arr = getTest().m_arrValues;
248 if ( m_nThreadNo & 1 ) {
249 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
250 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
251 //for ( size_t nItem = 0; nItem < c_nMapSize; ++nItem ) {
252 std::pair<bool, bool> ret = rMap.ensure( *it, std::ref( func ) );
265 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
266 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
267 std::pair<bool, bool> ret = rMap.ensure( *it, std::ref( func ) );
280 m_nFunctorCreated = func.nCreated;
281 m_nFunctorModified = func.nModified;
286 class Deleter: public CppUnitMini::TestThread
289 typedef typename Map::mapped_type value_type;
291 virtual Deleter * clone()
293 return new Deleter( *this );
296 struct value_container
309 struct erase_functor {
310 value_container m_cnt;
312 template <typename Key, typename Val>
313 void operator()( Key const& /*key*/, Val& v )
316 if ( v.bInitialized.load( atomics::memory_order_relaxed )) {
317 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
319 if ( m_cnt.nKeyExpected == v.nKey && m_cnt.nKeyExpected * 8 == v.nData )
320 ++m_cnt.nSuccessItem;
328 cds::backoff::yield()();
332 template <typename Pair>
333 void operator ()( Pair& item )
335 operator()( item.first, item.second );
340 size_t m_nDeleteSuccess;
341 size_t m_nDeleteFailed;
343 size_t m_nValueSuccess;
344 size_t m_nValueFailed;
347 Deleter( CppUnitMini::ThreadPool& pool, Map& rMap )
348 : CppUnitMini::TestThread( pool )
351 Deleter( Deleter& src )
352 : CppUnitMini::TestThread( src )
356 Map_InsDel_func& getTest()
358 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
361 virtual void init() { cds::threading::Manager::attachThread() ; }
362 virtual void fini() { cds::threading::Manager::detachThread() ; }
372 key_array const& arr = getTest().m_arrValues;
374 if ( m_nThreadNo & 1 ) {
375 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
376 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
377 func.m_cnt.nKeyExpected = *it;
378 if ( rMap.erase( *it, std::ref(func) ))
386 for ( size_t nPass = 0; nPass < c_nThreadPassCount; ++nPass ) {
387 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
388 func.m_cnt.nKeyExpected = *it;
389 if ( rMap.erase( *it, std::ref(func) ))
397 m_nValueSuccess = func.m_cnt.nSuccessItem;
398 m_nValueFailed = func.m_cnt.nFailedItem;
405 void do_test( Map& testMap )
407 typedef Inserter<Map> InserterThread;
408 typedef Deleter<Map> DeleterThread;
409 typedef Ensurer<Map> EnsurerThread;
410 cds::OS::Timer timer;
413 m_arrValues.reserve( c_nMapSize );
414 for ( size_t i = 0; i < c_nMapSize; ++i )
415 m_arrValues.push_back( i );
416 shuffle( m_arrValues.begin(), m_arrValues.end() );
418 CppUnitMini::ThreadPool pool( *this );
419 pool.add( new InserterThread( pool, testMap ), c_nInsertThreadCount );
420 pool.add( new DeleterThread( pool, testMap ), c_nDeleteThreadCount );
421 pool.add( new EnsurerThread( pool, testMap ), c_nEnsureThreadCount );
423 CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
425 size_t nInsertSuccess = 0;
426 size_t nInsertFailed = 0;
427 size_t nDeleteSuccess = 0;
428 size_t nDeleteFailed = 0;
429 size_t nDelValueSuccess = 0;
430 size_t nDelValueFailed = 0;
431 size_t nEnsureFailed = 0;
432 size_t nEnsureCreated = 0;
433 size_t nEnsureModified = 0;
434 size_t nEnsFuncCreated = 0;
435 size_t nEnsFuncModified = 0;
436 size_t nTestFunctorRef = 0;
438 for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
439 InserterThread * pThread = dynamic_cast<InserterThread *>( *it );
441 nInsertSuccess += pThread->m_nInsertSuccess;
442 nInsertFailed += pThread->m_nInsertFailed;
443 nTestFunctorRef += pThread->m_nTestFunctorRef;
446 DeleterThread * p = dynamic_cast<DeleterThread *>( *it );
448 nDeleteSuccess += p->m_nDeleteSuccess;
449 nDeleteFailed += p->m_nDeleteFailed;
450 nDelValueSuccess += p->m_nValueSuccess;
451 nDelValueFailed += p->m_nValueFailed;
454 EnsurerThread * pEns = static_cast<EnsurerThread *>( *it );
455 nEnsureCreated += pEns->m_nEnsureCreated;
456 nEnsureModified += pEns->m_nEnsureExisted;
457 nEnsureFailed += pEns->m_nEnsureFailed;
458 nEnsFuncCreated += pEns->m_nFunctorCreated;
459 nEnsFuncModified += pEns->m_nFunctorModified;
464 CPPUNIT_MSG( " Totals: Ins succ=" << nInsertSuccess
465 << " Del succ=" << nDeleteSuccess << "\n"
466 << " : Ins fail=" << nInsertFailed
467 << " Del fail=" << nDeleteFailed << "\n"
468 << " : Ensure succ=" << (nEnsureCreated + nEnsureModified) << " fail=" << nEnsureFailed
469 << " create=" << nEnsureCreated << " modify=" << nEnsureModified << "\n"
470 << " Map size=" << testMap.size()
473 CPPUNIT_CHECK_EX( nDelValueFailed == 0, "Functor del failed=" << nDelValueFailed );
474 CPPUNIT_CHECK_EX( nDelValueSuccess == nDeleteSuccess, "Delete success=" << nDeleteSuccess << " functor=" << nDelValueSuccess );
476 CPPUNIT_CHECK( nEnsureFailed == 0 );
478 CPPUNIT_CHECK_EX( nEnsureCreated == nEnsFuncCreated, "Ensure created=" << nEnsureCreated << " functor=" << nEnsFuncCreated );
479 CPPUNIT_CHECK_EX( nEnsureModified == nEnsFuncModified, "Ensure modified=" << nEnsureModified << " functor=" << nEnsFuncModified );
481 // nTestFunctorRef is call count of insert functor
482 CPPUNIT_CHECK_EX( nTestFunctorRef == nInsertSuccess, "nInsertSuccess=" << nInsertSuccess << " functor nTestFunctorRef=" << nTestFunctorRef );
484 check_before_cleanup( testMap );
486 CPPUNIT_MSG( " Clear map (single-threaded)..." );
488 for ( size_t nItem = 0; nItem < c_nMapSize; ++nItem ) {
489 testMap.erase( nItem );
491 CPPUNIT_MSG( " Duration=" << timer.duration() );
492 CPPUNIT_CHECK( testMap.empty() );
494 additional_check( testMap );
495 print_stat( testMap );
496 additional_cleanup( testMap );
502 CPPUNIT_MSG( "Thread count: insert=" << c_nInsertThreadCount
503 << " delete=" << c_nDeleteThreadCount
504 << " ensure=" << c_nEnsureThreadCount
505 << " pass count=" << c_nThreadPassCount
506 << " map size=" << c_nMapSize
509 for ( size_t nLoadFactor = 1; nLoadFactor <= c_nMaxLoadFactor; nLoadFactor *= 2 ) {
510 CPPUNIT_MSG( "Load factor=" << nLoadFactor );
511 Map testMap( c_nMapSize, nLoadFactor );
513 if ( c_bPrintGCState )
522 CPPUNIT_MSG( "Thread count: insert=" << c_nInsertThreadCount
523 << " delete=" << c_nDeleteThreadCount
524 << " ensure=" << c_nEnsureThreadCount
525 << " pass count=" << c_nThreadPassCount
526 << " map size=" << c_nMapSize
531 if ( c_bPrintGCState )
535 typedef CppUnitMini::TestCase Base;
536 void setUpParams( const CppUnitMini::TestCfg& cfg );
538 void run_MichaelMap(const char *in_name, bool invert = false);
539 void run_SplitList(const char *in_name, bool invert = false);
540 void run_StripedMap(const char *in_name, bool invert = false);
541 void run_RefinableMap(const char *in_name, bool invert = false);
542 void run_CuckooMap(const char *in_name, bool invert = false);
543 void run_SkipListMap(const char *in_name, bool invert = false);
544 void run_EllenBinTreeMap(const char *in_name, bool invert = false);
545 void run_BronsonAVLTreeMap(const char *in_name, bool invert = false);
547 virtual void myRun(const char *in_name, bool invert = false);
549 # include "map2/map_defs.h"
550 CDSUNIT_DECLARE_MichaelMap
551 CDSUNIT_DECLARE_SplitList
552 CDSUNIT_DECLARE_SkipListMap
553 CDSUNIT_DECLARE_EllenBinTreeMap
554 CDSUNIT_DECLARE_BronsonAVLTreeMap
555 CDSUNIT_DECLARE_StripedMap
556 CDSUNIT_DECLARE_RefinableMap
557 CDSUNIT_DECLARE_CuckooMap