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_CASE(TAG, X) void X();
15 //# define TEST_MAP(IMPL, C, X) void C::X() { test<map_type<IMPL, key_type, value_type>::X >() ; }
16 //# define TEST_MAP_EXTRACT(IMPL, C, X) TEST_MAP(IMPL, C, X)
17 //# define TEST_MAP_NOLF(IMPL, C, X) void C::X() { test_nolf<map_type<IMPL, key_type, value_type>::X >() ; }
18 //# define TEST_MAP_NOLF_EXTRACT(IMPL, C, X) TEST_MAP_NOLF(IMPL, C, X)
20 class Map_InsDel_func: public CppUnitMini::TestCase
23 size_t c_nMapSize = 1000000; // map size
24 size_t c_nInsertThreadCount = 4; // count of insertion thread
25 size_t c_nDeleteThreadCount = 4; // count of deletion thread
26 size_t c_nUpdateThreadCount = 4; // count of updating thread
27 size_t c_nThreadPassCount = 4; // pass count for each thread
28 size_t c_nMaxLoadFactor = 8; // maximum load factor
29 bool c_bPrintGCState = true;
31 size_t c_nCuckooInitialSize = 1024;// initial size for CuckooMap
32 size_t c_nCuckooProbesetSize = 16; // CuckooMap probeset size (only for list-based probeset)
33 size_t c_nCuckooProbesetThreshold = 0; // CUckooMap probeset threshold (o - use default)
35 size_t c_nMultiLevelMap_HeadBits = 10;
36 size_t c_nMultiLevelMap_ArrayBits = 4;
38 size_t c_nLoadFactor; // current load factor
41 typedef size_t key_type;
45 atomics::atomic<size_t> nUpdateCall;
46 atomics::atomic<bool> bInitialized;
47 cds::OS::ThreadId threadId ; // insert thread id
49 typedef cds::sync::spin_lock< cds::backoff::pause > lock_type;
50 mutable lock_type m_access;
56 , bInitialized( false )
57 , threadId( cds::OS::get_current_thread_id() )
60 value_type( value_type const& s )
63 , nUpdateCall(s.nUpdateCall.load(atomics::memory_order_relaxed))
64 , bInitialized( s.bInitialized.load(atomics::memory_order_relaxed) )
65 , threadId( cds::OS::get_current_thread_id() )
68 // boost::container::flat_map requires operator =
69 value_type& operator=( value_type const& v )
73 nUpdateCall.store( v.nUpdateCall.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed );
74 bInitialized.store(v.bInitialized.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed);
80 typedef std::vector<key_type> key_array;
81 key_array m_arrValues;
84 class Inserter: public CppUnitMini::TestThread
88 virtual Inserter * clone()
90 return new Inserter( *this );
93 struct insert_functor {
94 size_t nTestFunctorRef;
100 template <typename Pair>
101 void operator()( Pair& val )
103 operator()( val.first, val.second );
106 template <typename Key, typename Val >
107 void operator()( Key const& key, Val& v )
109 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
115 v.bInitialized.store( true, atomics::memory_order_relaxed);
120 size_t m_nInsertSuccess;
121 size_t m_nInsertFailed;
123 size_t m_nTestFunctorRef;
126 Inserter( CppUnitMini::ThreadPool& pool, Map& rMap )
127 : CppUnitMini::TestThread( pool )
130 Inserter( Inserter& src )
131 : CppUnitMini::TestThread( src )
135 Map_InsDel_func& getTest()
137 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
140 virtual void init() { cds::threading::Manager::attachThread() ; }
141 virtual void fini() { cds::threading::Manager::detachThread() ; }
149 m_nTestFunctorRef = 0;
151 // func is passed by reference
153 key_array const& arr = getTest().m_arrValues;
154 size_t const nPassCount = getTest().c_nThreadPassCount;
156 if ( m_nThreadNo & 1 ) {
157 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
158 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
159 if ( rMap.insert_with( *it, std::ref(func) ) )
167 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
168 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
169 if ( rMap.insert_with( *it, std::ref(func) ) )
177 m_nTestFunctorRef = func.nTestFunctorRef;
182 class Updater: public CppUnitMini::TestThread
186 virtual Updater * clone()
188 return new Updater( *this );
191 struct update_functor {
200 template <typename Key, typename Val>
201 void operator()( bool bNew, Key const& key, Val& v )
203 std::unique_lock<typename value_type::lock_type> ac( v.m_access );
208 v.bInitialized.store( true, atomics::memory_order_relaxed);
211 v.nUpdateCall.fetch_add( 1, atomics::memory_order_relaxed );
216 template <typename Pair>
217 void operator()( bool bNew, Pair& val )
219 operator()( bNew, val.first, val.second );
222 // For MultiLevelHashMap
223 template <typename Val>
224 void operator()( Val& cur, Val * old )
226 operator()( old != nullptr, cur.first, cur.second );
230 update_functor(const update_functor& ) = delete;
234 size_t m_nUpdateFailed;
235 size_t m_nUpdateCreated;
236 size_t m_nUpdateExisted;
237 size_t m_nFunctorCreated;
238 size_t m_nFunctorModified;
241 Updater( CppUnitMini::ThreadPool& pool, Map& rMap )
242 : CppUnitMini::TestThread( pool )
245 Updater( Updater& src )
246 : CppUnitMini::TestThread( src )
250 Map_InsDel_func& getTest()
252 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
255 virtual void init() { cds::threading::Manager::attachThread() ; }
256 virtual void fini() { cds::threading::Manager::detachThread() ; }
268 key_array const& arr = getTest().m_arrValues;
269 size_t const nPassCount = getTest().c_nThreadPassCount;
271 if ( m_nThreadNo & 1 ) {
272 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
273 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
274 //for ( size_t nItem = 0; nItem < c_nMapSize; ++nItem ) {
275 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ) );
288 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
289 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
290 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ) );
303 m_nFunctorCreated = func.nCreated;
304 m_nFunctorModified = func.nModified;
309 class Deleter: public CppUnitMini::TestThread
312 typedef typename Map::mapped_type value_type;
314 virtual Deleter * clone()
316 return new Deleter( *this );
319 struct value_container
332 struct erase_functor {
333 value_container m_cnt;
335 template <typename Key, typename Val>
336 void operator()( Key const& /*key*/, Val& v )
339 if ( v.bInitialized.load( atomics::memory_order_relaxed )) {
340 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
342 if ( m_cnt.nKeyExpected == v.nKey && m_cnt.nKeyExpected * 8 == v.nData )
343 ++m_cnt.nSuccessItem;
351 cds::backoff::yield()();
355 template <typename Pair>
356 void operator ()( Pair& item )
358 operator()( item.first, item.second );
363 size_t m_nDeleteSuccess;
364 size_t m_nDeleteFailed;
366 size_t m_nValueSuccess;
367 size_t m_nValueFailed;
370 Deleter( CppUnitMini::ThreadPool& pool, Map& rMap )
371 : CppUnitMini::TestThread( pool )
374 Deleter( Deleter& src )
375 : CppUnitMini::TestThread( src )
379 Map_InsDel_func& getTest()
381 return reinterpret_cast<Map_InsDel_func&>( m_Pool.m_Test );
384 virtual void init() { cds::threading::Manager::attachThread() ; }
385 virtual void fini() { cds::threading::Manager::detachThread() ; }
395 key_array const& arr = getTest().m_arrValues;
396 size_t const nPassCount = getTest().c_nThreadPassCount;
398 if ( m_nThreadNo & 1 ) {
399 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
400 for ( key_array::const_iterator it = arr.begin(), itEnd = arr.end(); it != itEnd; ++it ) {
401 func.m_cnt.nKeyExpected = *it;
402 if ( rMap.erase( *it, std::ref(func) ))
410 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
411 for ( key_array::const_reverse_iterator it = arr.rbegin(), itEnd = arr.rend(); it != itEnd; ++it ) {
412 func.m_cnt.nKeyExpected = *it;
413 if ( rMap.erase( *it, std::ref(func) ))
421 m_nValueSuccess = func.m_cnt.nSuccessItem;
422 m_nValueFailed = func.m_cnt.nFailedItem;
429 void do_test( Map& testMap )
431 typedef Inserter<Map> InserterThread;
432 typedef Deleter<Map> DeleterThread;
433 typedef Updater<Map> UpdaterThread;
434 cds::OS::Timer timer;
437 m_arrValues.reserve( c_nMapSize );
438 for ( size_t i = 0; i < c_nMapSize; ++i )
439 m_arrValues.push_back( i );
440 shuffle( m_arrValues.begin(), m_arrValues.end() );
442 CppUnitMini::ThreadPool pool( *this );
443 pool.add( new InserterThread( pool, testMap ), c_nInsertThreadCount );
444 pool.add( new DeleterThread( pool, testMap ), c_nDeleteThreadCount );
445 pool.add( new UpdaterThread( pool, testMap ), c_nUpdateThreadCount );
447 CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
449 size_t nInsertSuccess = 0;
450 size_t nInsertFailed = 0;
451 size_t nDeleteSuccess = 0;
452 size_t nDeleteFailed = 0;
453 size_t nDelValueSuccess = 0;
454 size_t nDelValueFailed = 0;
455 size_t nUpdateFailed = 0;
456 size_t nUpdateCreated = 0;
457 size_t nUpdateModified = 0;
458 size_t nEnsFuncCreated = 0;
459 size_t nEnsFuncModified = 0;
460 size_t nTestFunctorRef = 0;
462 for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
463 InserterThread * pThread = dynamic_cast<InserterThread *>( *it );
465 nInsertSuccess += pThread->m_nInsertSuccess;
466 nInsertFailed += pThread->m_nInsertFailed;
467 nTestFunctorRef += pThread->m_nTestFunctorRef;
470 DeleterThread * p = dynamic_cast<DeleterThread *>( *it );
472 nDeleteSuccess += p->m_nDeleteSuccess;
473 nDeleteFailed += p->m_nDeleteFailed;
474 nDelValueSuccess += p->m_nValueSuccess;
475 nDelValueFailed += p->m_nValueFailed;
478 UpdaterThread * pEns = static_cast<UpdaterThread *>( *it );
479 nUpdateCreated += pEns->m_nUpdateCreated;
480 nUpdateModified += pEns->m_nUpdateExisted;
481 nUpdateFailed += pEns->m_nUpdateFailed;
482 nEnsFuncCreated += pEns->m_nFunctorCreated;
483 nEnsFuncModified += pEns->m_nFunctorModified;
488 CPPUNIT_MSG( " Totals: Ins succ=" << nInsertSuccess
489 << " Del succ=" << nDeleteSuccess << "\n"
490 << " : Ins fail=" << nInsertFailed
491 << " Del fail=" << nDeleteFailed << "\n"
492 << " : Update succ=" << (nUpdateCreated + nUpdateModified) << " fail=" << nUpdateFailed
493 << " create=" << nUpdateCreated << " modify=" << nUpdateModified << "\n"
494 << " Map size=" << testMap.size()
497 CPPUNIT_CHECK_EX( nDelValueFailed == 0, "Functor del failed=" << nDelValueFailed );
498 CPPUNIT_CHECK_EX( nDelValueSuccess == nDeleteSuccess, "Delete success=" << nDeleteSuccess << " functor=" << nDelValueSuccess );
500 CPPUNIT_CHECK( nUpdateFailed == 0 );
502 CPPUNIT_CHECK_EX( nUpdateCreated == nEnsFuncCreated, "Update created=" << nUpdateCreated << " functor=" << nEnsFuncCreated );
503 CPPUNIT_CHECK_EX( nUpdateModified == nEnsFuncModified, "Update modified=" << nUpdateModified << " functor=" << nEnsFuncModified );
505 // nTestFunctorRef is call count of insert functor
506 CPPUNIT_CHECK_EX( nTestFunctorRef == nInsertSuccess, "nInsertSuccess=" << nInsertSuccess << " functor nTestFunctorRef=" << nTestFunctorRef );
508 check_before_cleanup( testMap );
510 CPPUNIT_MSG( " Clear map (single-threaded)..." );
512 for ( size_t nItem = 0; nItem < c_nMapSize; ++nItem ) {
513 testMap.erase( nItem );
515 CPPUNIT_MSG( " Duration=" << timer.duration() );
516 CPPUNIT_CHECK( testMap.empty() );
518 additional_check( testMap );
519 print_stat( testMap );
520 additional_cleanup( testMap );
526 CPPUNIT_MSG( "Thread count: insert=" << c_nInsertThreadCount
527 << " delete=" << c_nDeleteThreadCount
528 << " update=" << c_nUpdateThreadCount
529 << " pass count=" << c_nThreadPassCount
530 << " map size=" << c_nMapSize
533 if ( Map::c_bLoadFactorDepended ) {
534 for ( size_t c_nLoadFactor = 1; c_nLoadFactor <= c_nMaxLoadFactor; c_nLoadFactor *= 2 ) {
535 CPPUNIT_MSG( "Load factor=" << c_nLoadFactor );
536 Map testMap( *this );
538 if ( c_bPrintGCState )
543 Map testMap( *this );
545 if ( c_bPrintGCState )
550 typedef CppUnitMini::TestCase Base;
551 void setUpParams( const CppUnitMini::TestCfg& cfg );
553 # include "map2/map_defs.h"
554 CDSUNIT_DECLARE_MichaelMap
555 CDSUNIT_DECLARE_SplitList
556 CDSUNIT_DECLARE_SkipListMap
557 CDSUNIT_DECLARE_EllenBinTreeMap
558 CDSUNIT_DECLARE_BronsonAVLTreeMap
559 CDSUNIT_DECLARE_MultiLevelHashMap
560 CDSUNIT_DECLARE_StripedMap
561 CDSUNIT_DECLARE_RefinableMap
562 CDSUNIT_DECLARE_CuckooMap
564 CPPUNIT_TEST_SUITE(Map_InsDel_func)
565 CDSUNIT_TEST_MichaelMap
566 CDSUNIT_TEST_SplitList
567 CDSUNIT_TEST_SkipListMap
568 CDSUNIT_TEST_EllenBinTreeMap
569 CDSUNIT_TEST_BronsonAVLTreeMap
570 CDSUNIT_TEST_MultiLevelHashMap
571 CDSUNIT_TEST_CuckooMap
572 CDSUNIT_TEST_StripedMap
573 CDSUNIT_TEST_RefinableMap
574 CPPUNIT_TEST_SUITE_END();