2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
6 Source code repo: http://github.com/khizmax/libcds/
7 Download: http://sourceforge.net/projects/libcds/files/
9 Redistribution and use in source and binary forms, with or without
10 modification, are permitted provided that the following conditions are met:
12 * Redistributions of source code must retain the above copyright notice, this
13 list of conditions and the following disclaimer.
15 * Redistributions in binary form must reproduce the above copyright notice,
16 this list of conditions and the following disclaimer in the documentation
17 and/or other materials provided with the distribution.
19 THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
20 AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
22 DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
23 FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
25 SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
26 CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
27 OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
28 OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
35 class Map_InsDel_func: public cds_test::stress_fixture
38 static size_t s_nMapSize; // map size
39 static size_t s_nInsertThreadCount; // count of insertion thread
40 static size_t s_nDeleteThreadCount; // count of deletion thread
41 static size_t s_nUpdateThreadCount; // count of updating thread
42 static size_t s_nThreadPassCount; // pass count for each thread
43 static size_t s_nMaxLoadFactor; // maximum load factor
45 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
46 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
47 static size_t s_nCuckooProbesetThreshold; // CuckooMap probeset threshold (o - use default)
49 static size_t s_nFeldmanMap_HeadBits;
50 static size_t s_nFeldmanMap_ArrayBits;
52 static size_t s_nLoadFactor; // current load factor
54 static void SetUpTestCase();
55 static void TearDownTestCase();
57 typedef size_t key_type;
62 atomics::atomic<bool> bInitialized;
63 cds::OS::ThreadId threadId; // inserter thread id
65 typedef cds::sync::spin_lock< cds::backoff::pause > lock_type;
66 mutable lock_type m_access;
72 , bInitialized( false )
73 , threadId( cds::OS::get_current_thread_id())
76 value_type( value_type const& s )
79 , nUpdateCall( s.nUpdateCall )
80 , bInitialized( s.bInitialized.load(atomics::memory_order_relaxed))
81 , threadId( cds::OS::get_current_thread_id())
85 // boost::container::flat_map requires operator =
86 // cppcheck-suppress operatorEqVarError
87 value_type& operator=( value_type const& v )
91 nUpdateCall = v.nUpdateCall;
92 threadId = v.threadId;
93 bInitialized.store(v.bInitialized.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed);
99 typedef std::vector<key_type> key_array;
100 static key_array s_arrKeys;
110 class Inserter: public cds_test::thread
112 typedef cds_test::thread base_class;
115 struct insert_functor {
116 size_t nTestFunctorRef;
122 template <typename Pair>
123 void operator()( Pair& val )
125 operator()( val.first, val.second );
128 template <typename Key, typename Val >
129 void operator()( Key const& key, Val& v )
131 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
137 v.bInitialized.store( true, atomics::memory_order_relaxed);
142 size_t m_nInsertSuccess = 0;
143 size_t m_nInsertFailed = 0;
145 size_t m_nTestFunctorRef = 0;
148 Inserter( cds_test::thread_pool& pool, Map& map )
149 : base_class( pool, insert_thread )
153 Inserter( Inserter& src )
158 virtual thread * clone()
160 return new Inserter( *this );
167 // func is passed by reference
169 size_t const nPassCount = s_nThreadPassCount;
172 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
173 for ( key_array::const_iterator it = s_arrKeys.begin(), itEnd = s_arrKeys.end(); it != itEnd; ++it ) {
174 if ( rMap.insert_with( *it, std::ref(func)))
182 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
183 for ( key_array::const_reverse_iterator it = s_arrKeys.rbegin(), itEnd = s_arrKeys.rend(); it != itEnd; ++it ) {
184 if ( rMap.insert_with( *it, std::ref(func)))
192 m_nTestFunctorRef = func.nTestFunctorRef;
197 class Updater: public cds_test::thread
199 typedef cds_test::thread base_class;
202 struct update_functor {
204 size_t nModified = 0;
206 update_functor() = default;
208 template <typename Key, typename Val>
209 void operator()( bool /*bNew*/, Key const& key, Val& v )
211 std::unique_lock<typename value_type::lock_type> ac( v.m_access );
212 if ( !v.bInitialized.load( atomics::memory_order_acquire )) {
216 v.bInitialized.store( true, atomics::memory_order_relaxed);
224 template <typename Pair>
225 void operator()( bool bNew, Pair& val )
227 operator()( bNew, val.first, val.second );
230 // For FeldmanHashMap, IterableList
231 template <typename Val>
232 void operator()( Val& cur, Val * old )
235 // If a key exists, FeldmanHashMap creates a new node too
236 // We should manually copy important values from old to cur
237 std::unique_lock<typename value_type::lock_type> ac( cur.second.m_access );
238 cur.second.nKey = cur.first;
239 cur.second.nData = cur.first * 8;
240 cur.second.bInitialized.store( true, atomics::memory_order_release );
242 operator()( old == nullptr, cur.first, cur.second );
246 update_functor(const update_functor& ) = delete;
250 size_t m_nUpdateFailed = 0;
251 size_t m_nUpdateCreated = 0;
252 size_t m_nUpdateExisted = 0;
253 size_t m_nFunctorCreated = 0;
254 size_t m_nFunctorModified = 0;
257 Updater( cds_test::thread_pool& pool, Map& map )
258 : base_class( pool, update_thread )
262 Updater( Updater& src )
267 virtual thread * clone()
269 return new Updater( *this );
277 size_t const nPassCount = s_nThreadPassCount;
280 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
281 for ( key_array::const_iterator it = s_arrKeys.begin(), itEnd = s_arrKeys.end(); it != itEnd; ++it ) {
282 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ));
295 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
296 for ( key_array::const_reverse_iterator it = s_arrKeys.rbegin(), itEnd = s_arrKeys.rend(); it != itEnd; ++it ) {
297 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ));
310 m_nFunctorCreated = func.nCreated;
311 m_nFunctorModified = func.nModified;
316 class Deleter: public cds_test::thread
319 typedef cds_test::thread base_class;
320 typedef typename Map::mapped_type value_type;
322 struct value_container
336 struct erase_functor {
337 value_container m_cnt;
339 template <typename Key, typename Val>
340 void operator()( Key const& /*key*/, Val& v )
343 if ( v.bInitialized.load( atomics::memory_order_relaxed )) {
344 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
346 if ( m_cnt.nKeyExpected == v.nKey && m_cnt.nKeyExpected * 8 == v.nData )
347 ++m_cnt.nSuccessItem;
355 cds::backoff::yield()();
359 template <typename Pair>
360 void operator ()( Pair& item )
362 operator()( item.first, item.second );
367 size_t m_nDeleteSuccess = 0;
368 size_t m_nDeleteFailed = 0;
369 size_t m_nValueSuccess = 0;
370 size_t m_nValueFailed = 0;
373 Deleter( cds_test::thread_pool& pool, Map& map )
374 : base_class( pool, delete_thread )
378 Deleter( Deleter& src )
383 virtual thread * clone()
385 return new Deleter( *this );
393 size_t const nPassCount = s_nThreadPassCount;
396 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
397 for ( key_array::const_iterator it = s_arrKeys.cbegin(), itEnd = s_arrKeys.cend(); it != itEnd; ++it ) {
398 func.m_cnt.nKeyExpected = *it;
399 if ( rMap.erase( *it, std::ref(func)))
407 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
408 for ( key_array::const_reverse_iterator it = s_arrKeys.crbegin(), itEnd = s_arrKeys.crend(); it != itEnd; ++it ) {
409 func.m_cnt.nKeyExpected = *it;
410 if ( rMap.erase( *it, std::ref(func)))
418 m_nValueSuccess = func.m_cnt.nSuccessItem;
419 m_nValueFailed = func.m_cnt.nFailedItem;
426 void do_test( Map& testMap )
428 typedef Inserter<Map> inserter;
429 typedef Deleter<Map> deleter;
430 typedef Updater<Map> updater;
432 cds_test::thread_pool& pool = get_pool();
433 pool.add( new inserter( pool, testMap ), s_nInsertThreadCount );
434 pool.add( new deleter( pool, testMap ), s_nDeleteThreadCount );
435 if ( s_nUpdateThreadCount )
436 pool.add( new updater( pool, testMap ), s_nUpdateThreadCount );
438 propout() << std::make_pair( "insert_thread_count", s_nInsertThreadCount )
439 << std::make_pair( "delete_thread_count", s_nDeleteThreadCount )
440 << std::make_pair( "update_thread_count", s_nUpdateThreadCount )
441 << std::make_pair( "pass_count", s_nThreadPassCount )
442 << std::make_pair( "map_size", s_nMapSize );
444 std::chrono::milliseconds duration = pool.run();
446 propout() << std::make_pair( "duration", duration );
448 size_t nInsertSuccess = 0;
449 size_t nInsertFailed = 0;
450 size_t nDeleteSuccess = 0;
451 size_t nDeleteFailed = 0;
452 size_t nDelValueSuccess = 0;
453 size_t nDelValueFailed = 0;
454 size_t nUpdateFailed = 0;
455 size_t nUpdateCreated = 0;
456 size_t nUpdateModified = 0;
457 size_t nEnsFuncCreated = 0;
458 size_t nEnsFuncModified = 0;
459 size_t nInsFuncCalled = 0;
461 for ( size_t i = 0; i < pool.size(); ++i ) {
462 cds_test::thread& thr = pool.get( i );
463 switch ( thr.type()) {
466 inserter& t = static_cast<inserter&>( thr );
467 nInsertSuccess += t.m_nInsertSuccess;
468 nInsertFailed += t.m_nInsertFailed;
469 nInsFuncCalled += t.m_nTestFunctorRef;
474 deleter& t = static_cast<deleter&>(thr);
475 nDeleteSuccess += t.m_nDeleteSuccess;
476 nDeleteFailed += t.m_nDeleteFailed;
477 nDelValueSuccess += t.m_nValueSuccess;
478 nDelValueFailed += t.m_nValueFailed;
483 updater& t = static_cast<updater&>(thr);
484 nUpdateCreated += t.m_nUpdateCreated;
485 nUpdateModified += t.m_nUpdateExisted;
486 nUpdateFailed += t.m_nUpdateFailed;
487 nEnsFuncCreated += t.m_nFunctorCreated;
488 nEnsFuncModified += t.m_nFunctorModified;
497 << std::make_pair( "insert_success", nInsertSuccess )
498 << std::make_pair( "insert_failed", nInsertFailed )
499 << std::make_pair( "delete_success", nDeleteSuccess )
500 << std::make_pair( "delete_failed", nDeleteFailed )
501 << std::make_pair( "update_success", nUpdateCreated + nUpdateModified )
502 << std::make_pair( "update_failed", nUpdateFailed )
503 << std::make_pair( "update_functor_create", nEnsFuncCreated )
504 << std::make_pair( "update_functor_modify", nEnsFuncModified )
505 << std::make_pair( "finish_map_size", testMap.size());
507 EXPECT_EQ( nDelValueFailed, 0u );
508 EXPECT_EQ( nDelValueSuccess, nDeleteSuccess );
509 EXPECT_EQ( nUpdateFailed, 0u );
510 EXPECT_EQ( nUpdateCreated + nUpdateModified, nEnsFuncCreated + nEnsFuncModified );
512 // nInsFuncCalled is call count of insert functor
513 EXPECT_EQ( nInsFuncCalled, nInsertSuccess );
515 check_before_cleanup( testMap );
517 for ( size_t nItem = 0; nItem < s_nMapSize; ++nItem )
518 testMap.erase( nItem );
520 EXPECT_TRUE( testMap.empty());
521 EXPECT_EQ( testMap.size(), 0u );
523 additional_check( testMap );
524 print_stat( propout(), testMap );
525 additional_cleanup( testMap );
531 Map testMap( *this );
538 Map testMap( *this );
541 if ( testMap.size() != 0 ) {
542 for ( auto it = testMap.begin(); it != testMap.end(); ++it ) {
543 std::cout << "key=" << it->first << std::endl;
549 class Map_InsDel_func_LF: public Map_InsDel_func
550 , public ::testing::WithParamInterface<size_t>
556 s_nLoadFactor = GetParam();
557 propout() << std::make_pair( "load_factor", s_nLoadFactor );
558 Map_InsDel_func::run_test<Set>();
564 s_nLoadFactor = GetParam();
565 propout() << std::make_pair( "load_factor", s_nLoadFactor );
566 Map_InsDel_func::run_test2<Set>();
569 static std::vector<size_t> get_load_factors();