3 #include "map2/map_types.h"
4 #include "cppunit/thread.h"
5 #include <algorithm> // random_shuffle
10 # define TEST_MAP(X) void X() { test<MapTypes<key_type, value_type>::X >() ; }
11 # define TEST_MAP_NOLF(X) void X() { test_nolf<MapTypes<key_type, value_type>::X >() ; }
12 # define TEST_MAP_EXTRACT(X) TEST_MAP(X)
13 # define TEST_MAP_NOLF_EXTRACT(X) TEST_MAP_NOLF(X)
16 static size_t c_nInitialMapSize = 500000 ; // initial map size
17 static size_t c_nThreadCount = 8 ; // thread count
18 static size_t c_nMaxLoadFactor = 8 ; // maximum load factor
19 static unsigned int c_nInsertPercentage = 5;
20 static unsigned int c_nDeletePercentage = 5;
21 static unsigned int c_nDuration = 30 ; // test duration, seconds
22 static bool c_bPrintGCState = true;
25 class Map_InsDelFind: public CppUnitMini::TestCase
34 static const unsigned int c_nShuffleSize = 100;
35 actions m_arrShuffle[c_nShuffleSize];
38 typedef size_t key_type;
39 typedef size_t value_type;
42 class WorkThread: public CppUnitMini::TestThread
46 virtual WorkThread * clone()
48 return new WorkThread( *this );
51 size_t m_nInsertSuccess;
52 size_t m_nInsertFailed;
53 size_t m_nDeleteSuccess;
54 size_t m_nDeleteFailed;
55 size_t m_nFindSuccess;
59 WorkThread( CppUnitMini::ThreadPool& pool, MAP& rMap )
60 : CppUnitMini::TestThread( pool )
63 WorkThread( WorkThread& src )
64 : CppUnitMini::TestThread( src )
68 Map_InsDelFind& getTest()
70 return reinterpret_cast<Map_InsDelFind&>( m_Pool.m_Test );
73 virtual void init() { cds::threading::Manager::attachThread() ; }
74 virtual void fini() { cds::threading::Manager::detachThread() ; }
87 actions * pAct = getTest().m_arrShuffle;
89 size_t const nNormalize = size_t(-1) / (c_nInitialMapSize * 2);
92 while ( !time_elapsed() ) {
93 nRand = cds::bitop::RandXorShift(nRand);
94 size_t n = nRand / nNormalize;
103 if ( rMap.insert( n, n ))
109 if ( rMap.erase( n ))
116 if ( ++i >= c_nShuffleSize )
124 void do_test( MAP& testMap )
126 typedef WorkThread<MAP> work_thread;
127 cds::OS::Timer timer;
129 // fill map - only odd number
131 std::vector<size_t> arr;
132 arr.reserve( c_nInitialMapSize );
133 for ( size_t i = 0; i < c_nInitialMapSize; ++i )
134 arr.push_back( i * 2 + 1);
135 std::random_shuffle( arr.begin(), arr.end() );
136 for ( size_t i = 0; i < c_nInitialMapSize; ++i )
137 testMap.insert( arr[i], arr[i] );
139 CPPUNIT_MSG( " Insert " << c_nInitialMapSize << " items time (single-threaded)=" << timer.duration() );
142 CppUnitMini::ThreadPool pool( *this );
143 pool.add( new work_thread( pool, testMap ), c_nThreadCount );
144 pool.run( c_nDuration );
145 //CPPUNIT_MSG( " Duration=" << pool.avgDuration() );
147 size_t nInsertSuccess = 0;
148 size_t nInsertFailed = 0;
149 size_t nDeleteSuccess = 0;
150 size_t nDeleteFailed = 0;
151 size_t nFindSuccess = 0;
152 size_t nFindFailed = 0;
153 for ( CppUnitMini::ThreadPool::iterator it = pool.begin(); it != pool.end(); ++it ) {
154 work_thread * pThread = static_cast<work_thread *>( *it );
155 assert( pThread != nullptr );
156 nInsertSuccess += pThread->m_nInsertSuccess;
157 nInsertFailed += pThread->m_nInsertFailed;
158 nDeleteSuccess += pThread->m_nDeleteSuccess;
159 nDeleteFailed += pThread->m_nDeleteFailed;
160 nFindSuccess += pThread->m_nFindSuccess;
161 nFindFailed += pThread->m_nFindFailed;
164 size_t nTotalOps = nInsertSuccess + nInsertFailed + nDeleteSuccess + nDeleteFailed + nFindSuccess + nFindFailed;
166 CPPUNIT_MSG( " Totals (success/failed): \n\t"
167 << " Insert=" << nInsertSuccess << '/' << nInsertFailed << "\n\t"
168 << " Delete=" << nDeleteSuccess << '/' << nDeleteFailed << "\n\t"
169 << " Find=" << nFindSuccess << '/' << nFindFailed << "\n\t"
170 << " Speed=" << (nFindSuccess + nFindFailed) / c_nDuration << " find/sec\n\t"
171 << " " << (nInsertSuccess + nDeleteSuccess) / c_nDuration << " modify/sec\n\t"
172 << " Total ops=" << nTotalOps << "\n\t"
173 << " speed=" << nTotalOps / c_nDuration << " ops/sec\n\t"
174 << " Map size=" << testMap.size()
178 CPPUNIT_MSG( " Clear map (single-threaded)..." );
181 CPPUNIT_MSG( " Duration=" << timer.duration() );
182 CPPUNIT_ASSERT_EX( testMap.empty(), ((long long) testMap.size()) );
184 additional_check( testMap );
185 print_stat( testMap );
186 additional_cleanup( testMap );
192 CPPUNIT_MSG( "Thread count=" << c_nThreadCount
193 << " initial map size=" << c_nInitialMapSize
194 << " insert=" << c_nInsertPercentage << '%'
195 << " delete=" << c_nDeletePercentage << '%'
196 << " duration=" << c_nDuration << "s"
199 for ( size_t nLoadFactor = 1; nLoadFactor <= c_nMaxLoadFactor; nLoadFactor *= 2 ) {
200 CPPUNIT_MSG( "Load factor=" << nLoadFactor );
201 MAP testMap( c_nInitialMapSize, nLoadFactor );
203 if ( c_bPrintGCState )
212 CPPUNIT_MSG( "Thread count=" << c_nThreadCount
213 << " initial map size=" << c_nInitialMapSize
214 << " insert=" << c_nInsertPercentage << '%'
215 << " delete=" << c_nDeletePercentage << '%'
216 << " duration=" << c_nDuration << "s"
221 if ( c_bPrintGCState )
225 void setUpParams( const CppUnitMini::TestCfg& cfg ) {
226 c_nInitialMapSize = cfg.getULong("InitialMapSize", 500000 );
227 c_nThreadCount = cfg.getULong("ThreadCount", 8 );
228 c_nMaxLoadFactor = cfg.getULong("MaxLoadFactor", 8 );
229 c_nInsertPercentage = cfg.getUInt("InsertPercentage", 5 );
230 c_nDeletePercentage = cfg.getUInt("DeletePercentage", 5 );
231 c_nDuration = cfg.getUInt("Duration", 30 );
232 c_bPrintGCState = cfg.getBool("PrintGCStateFlag", true );
234 if ( c_nThreadCount == 0 )
235 c_nThreadCount = cds::OS::topology::processor_count() * 2;
237 CPPUNIT_ASSERT( c_nInsertPercentage + c_nDeletePercentage <= 100 );
239 actions * pFirst = m_arrShuffle;
240 actions * pLast = m_arrShuffle + c_nInsertPercentage;
241 std::fill( pFirst, pLast, do_insert );
243 pLast += c_nDeletePercentage;
244 std::fill( pFirst, pLast, do_delete );
246 pLast = m_arrShuffle + sizeof(m_arrShuffle)/sizeof(m_arrShuffle[0]);
247 std::fill( pFirst, pLast, do_find );
248 std::random_shuffle( m_arrShuffle, pLast );
251 # include "map2/map_defs.h"
252 CDSUNIT_DECLARE_MichaelMap
253 CDSUNIT_DECLARE_SplitList
254 CDSUNIT_DECLARE_SkipListMap
255 CDSUNIT_DECLARE_EllenBinTreeMap
256 CDSUNIT_DECLARE_BronsonAVLTreeMap
257 CDSUNIT_DECLARE_StripedMap
258 CDSUNIT_DECLARE_RefinableMap
259 CDSUNIT_DECLARE_CuckooMap
260 CDSUNIT_DECLARE_StdMap
262 CPPUNIT_TEST_SUITE( Map_InsDelFind )
263 CDSUNIT_TEST_MichaelMap
264 CDSUNIT_TEST_SplitList
265 CDSUNIT_TEST_SkipListMap
266 CDSUNIT_TEST_EllenBinTreeMap
267 CDSUNIT_TEST_BronsonAVLTreeMap
268 CDSUNIT_TEST_StripedMap
269 CDSUNIT_TEST_RefinableMap
270 CDSUNIT_TEST_CuckooMap
272 CPPUNIT_TEST_SUITE_END()
275 CPPUNIT_TEST_SUITE_REGISTRATION( Map_InsDelFind );