2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
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 value_type& operator=( value_type const& v )
90 nUpdateCall = v.nUpdateCall;
91 threadId = v.threadId;
92 bInitialized.store(v.bInitialized.load(atomics::memory_order_relaxed), atomics::memory_order_relaxed);
98 typedef std::vector<key_type> key_array;
99 static key_array s_arrKeys;
109 class Inserter: public cds_test::thread
111 typedef cds_test::thread base_class;
114 struct insert_functor {
115 size_t nTestFunctorRef;
121 template <typename Pair>
122 void operator()( Pair& val )
124 operator()( val.first, val.second );
127 template <typename Key, typename Val >
128 void operator()( Key const& key, Val& v )
130 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
136 v.bInitialized.store( true, atomics::memory_order_relaxed);
141 size_t m_nInsertSuccess = 0;
142 size_t m_nInsertFailed = 0;
144 size_t m_nTestFunctorRef = 0;
147 Inserter( cds_test::thread_pool& pool, Map& map )
148 : base_class( pool, insert_thread )
152 Inserter( Inserter& src )
157 virtual thread * clone()
159 return new Inserter( *this );
166 // func is passed by reference
168 size_t const nPassCount = s_nThreadPassCount;
171 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
172 for ( key_array::const_iterator it = s_arrKeys.begin(), itEnd = s_arrKeys.end(); it != itEnd; ++it ) {
173 if ( rMap.insert_with( *it, std::ref(func)))
181 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
182 for ( key_array::const_reverse_iterator it = s_arrKeys.rbegin(), itEnd = s_arrKeys.rend(); it != itEnd; ++it ) {
183 if ( rMap.insert_with( *it, std::ref(func)))
191 m_nTestFunctorRef = func.nTestFunctorRef;
196 class Updater: public cds_test::thread
198 typedef cds_test::thread base_class;
201 struct update_functor {
203 size_t nModified = 0;
205 update_functor() = default;
207 template <typename Key, typename Val>
208 void operator()( bool /*bNew*/, Key const& key, Val& v )
210 std::unique_lock<typename value_type::lock_type> ac( v.m_access );
211 if ( !v.bInitialized.load( atomics::memory_order_acquire )) {
215 v.bInitialized.store( true, atomics::memory_order_relaxed);
223 template <typename Pair>
224 void operator()( bool bNew, Pair& val )
226 operator()( bNew, val.first, val.second );
229 // For FeldmanHashMap
230 template <typename Val>
231 void operator()( Val& cur, Val * old )
234 // If a key exists, FeldmanHashMap creates a new node too
235 // We should manually copy important values from old to cur
236 std::unique_lock<typename value_type::lock_type> ac( cur.second.m_access );
237 cur.second.nKey = cur.first;
238 cur.second.nData = cur.first * 8;
239 cur.second.bInitialized.store( true, atomics::memory_order_release );
241 operator()( old == nullptr, cur.first, cur.second );
245 update_functor(const update_functor& ) = delete;
249 size_t m_nUpdateFailed = 0;
250 size_t m_nUpdateCreated = 0;
251 size_t m_nUpdateExisted = 0;
252 size_t m_nFunctorCreated = 0;
253 size_t m_nFunctorModified = 0;
256 Updater( cds_test::thread_pool& pool, Map& map )
257 : base_class( pool, update_thread )
261 Updater( Updater& src )
266 virtual thread * clone()
268 return new Updater( *this );
276 size_t const nPassCount = s_nThreadPassCount;
279 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
280 for ( key_array::const_iterator it = s_arrKeys.begin(), itEnd = s_arrKeys.end(); it != itEnd; ++it ) {
281 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ));
294 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
295 for ( key_array::const_reverse_iterator it = s_arrKeys.rbegin(), itEnd = s_arrKeys.rend(); it != itEnd; ++it ) {
296 std::pair<bool, bool> ret = rMap.update( *it, std::ref( func ));
309 m_nFunctorCreated = func.nCreated;
310 m_nFunctorModified = func.nModified;
315 class Deleter: public cds_test::thread
318 typedef cds_test::thread base_class;
319 typedef typename Map::mapped_type value_type;
321 struct value_container
335 struct erase_functor {
336 value_container m_cnt;
338 template <typename Key, typename Val>
339 void operator()( Key const& /*key*/, Val& v )
342 if ( v.bInitialized.load( atomics::memory_order_relaxed )) {
343 std::unique_lock< typename value_type::lock_type> ac( v.m_access );
345 if ( m_cnt.nKeyExpected == v.nKey && m_cnt.nKeyExpected * 8 == v.nData )
346 ++m_cnt.nSuccessItem;
354 cds::backoff::yield()();
358 template <typename Pair>
359 void operator ()( Pair& item )
361 operator()( item.first, item.second );
366 size_t m_nDeleteSuccess = 0;
367 size_t m_nDeleteFailed = 0;
368 size_t m_nValueSuccess = 0;
369 size_t m_nValueFailed = 0;
372 Deleter( cds_test::thread_pool& pool, Map& map )
373 : base_class( pool, delete_thread )
377 Deleter( Deleter& src )
382 virtual thread * clone()
384 return new Deleter( *this );
392 size_t const nPassCount = s_nThreadPassCount;
395 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
396 for ( key_array::const_iterator it = s_arrKeys.cbegin(), itEnd = s_arrKeys.cend(); it != itEnd; ++it ) {
397 func.m_cnt.nKeyExpected = *it;
398 if ( rMap.erase( *it, std::ref(func)))
406 for ( size_t nPass = 0; nPass < nPassCount; ++nPass ) {
407 for ( key_array::const_reverse_iterator it = s_arrKeys.crbegin(), itEnd = s_arrKeys.crend(); it != itEnd; ++it ) {
408 func.m_cnt.nKeyExpected = *it;
409 if ( rMap.erase( *it, std::ref(func)))
417 m_nValueSuccess = func.m_cnt.nSuccessItem;
418 m_nValueFailed = func.m_cnt.nFailedItem;
425 void do_test( Map& testMap )
427 typedef Inserter<Map> inserter;
428 typedef Deleter<Map> deleter;
429 typedef Updater<Map> updater;
431 cds_test::thread_pool& pool = get_pool();
432 pool.add( new inserter( pool, testMap ), s_nInsertThreadCount );
433 pool.add( new deleter( pool, testMap ), s_nDeleteThreadCount );
434 pool.add( new updater( pool, testMap ), s_nUpdateThreadCount );
436 propout() << std::make_pair( "insert_thread_count", s_nInsertThreadCount )
437 << std::make_pair( "delete_thread_count", s_nDeleteThreadCount )
438 << std::make_pair( "update_thread_count", s_nUpdateThreadCount )
439 << std::make_pair( "pass_count", s_nThreadPassCount )
440 << std::make_pair( "map_size", s_nMapSize );
442 std::chrono::milliseconds duration = pool.run();
444 propout() << std::make_pair( "duration", duration );
446 size_t nInsertSuccess = 0;
447 size_t nInsertFailed = 0;
448 size_t nDeleteSuccess = 0;
449 size_t nDeleteFailed = 0;
450 size_t nDelValueSuccess = 0;
451 size_t nDelValueFailed = 0;
452 size_t nUpdateFailed = 0;
453 size_t nUpdateCreated = 0;
454 size_t nUpdateModified = 0;
455 size_t nEnsFuncCreated = 0;
456 size_t nEnsFuncModified = 0;
457 size_t nInsFuncCalled = 0;
459 for ( size_t i = 0; i < pool.size(); ++i ) {
460 cds_test::thread& thr = pool.get( i );
461 switch ( thr.type() ) {
464 inserter& t = static_cast<inserter&>( thr );
465 nInsertSuccess += t.m_nInsertSuccess;
466 nInsertFailed += t.m_nInsertFailed;
467 nInsFuncCalled += t.m_nTestFunctorRef;
472 deleter& t = static_cast<deleter&>(thr);
473 nDeleteSuccess += t.m_nDeleteSuccess;
474 nDeleteFailed += t.m_nDeleteFailed;
475 nDelValueSuccess += t.m_nValueSuccess;
476 nDelValueFailed += t.m_nValueFailed;
481 updater& t = static_cast<updater&>(thr);
482 nUpdateCreated += t.m_nUpdateCreated;
483 nUpdateModified += t.m_nUpdateExisted;
484 nUpdateFailed += t.m_nUpdateFailed;
485 nEnsFuncCreated += t.m_nFunctorCreated;
486 nEnsFuncModified += t.m_nFunctorModified;
495 << std::make_pair( "insert_success", nInsertSuccess )
496 << std::make_pair( "insert_failed", nInsertFailed )
497 << std::make_pair( "delete_success", nDeleteSuccess )
498 << std::make_pair( "delete_failed", nDeleteFailed )
499 << std::make_pair( "update_success", nUpdateCreated + nUpdateModified )
500 << std::make_pair( "update_failed", nUpdateFailed )
501 << std::make_pair( "update_functor_create", nEnsFuncCreated )
502 << std::make_pair( "update_functor_modify", nEnsFuncModified )
503 << std::make_pair( "finish_map_size", testMap.size() );
505 EXPECT_EQ( nDelValueFailed, 0 );
506 EXPECT_EQ( nDelValueSuccess, nDeleteSuccess );
507 EXPECT_EQ( nUpdateFailed, 0 );
508 EXPECT_EQ( nUpdateCreated + nUpdateModified, nEnsFuncCreated + nEnsFuncModified );
510 // nInsFuncCalled is call count of insert functor
511 EXPECT_EQ( nInsFuncCalled, nInsertSuccess );
513 check_before_cleanup( testMap );
515 for ( size_t nItem = 0; nItem < s_nMapSize; ++nItem )
516 testMap.erase( nItem );
518 EXPECT_TRUE( testMap.empty());
520 additional_check( testMap );
521 print_stat( propout(), testMap );
522 additional_cleanup( testMap );
528 Map testMap( *this );
533 class Map_InsDel_func_LF: public Map_InsDel_func
534 , public ::testing::WithParamInterface<size_t>
540 s_nLoadFactor = GetParam();
541 propout() << std::make_pair( "load_factor", s_nLoadFactor );
542 Map_InsDel_func::run_test<Set>();
545 static std::vector<size_t> get_load_factors();