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.
36 class Map_InsDelFind: public cds_test::stress_fixture
39 static size_t s_nMapSize; // initial map size
40 static size_t s_nThreadCount; // thread count
41 static size_t s_nPassCount; // pass count
43 static size_t s_nBronsonAVLTreeMapPassCount;
45 static size_t s_nHpEllenBinTreeMapPassCount;
46 static size_t s_nHpFeldmanPassCount;
47 static size_t s_nHpMichaelMapPassCount;
48 static size_t s_nHpMichaelIterableMapPassCount;
49 static size_t s_nHpSkipListMapPassCount;
50 static size_t s_nHpSplitListMapPassCount;
51 static size_t s_nHpSplitListIterableMapPassCount;
53 static size_t s_nRcuEllenBinTreeMapPassCount;
54 static size_t s_nRcuFeldmanPassCount;
55 static size_t s_nRcuMichaelMapPassCount;
56 static size_t s_nRcuSkipListMapPassCount;
57 static size_t s_nRcuSplitListMapPassCount;
59 static size_t s_nMaxLoadFactor; // maximum load factor
60 static unsigned int s_nInsertPercentage;
61 static unsigned int s_nDeletePercentage;
62 static unsigned int s_nDuration; // test duration, seconds
64 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
65 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
66 static size_t s_nCuckooProbesetThreshold; // CuckooMap probeset threshold (o - use default)
68 static size_t s_nFeldmanMap_HeadBits;
69 static size_t s_nFeldmanMap_ArrayBits;
71 static size_t s_nLoadFactor; // current load factor
73 static void SetUpTestCase();
74 //static void TearDownTestCase();
83 static const unsigned int c_nShuffleSize = 100;
84 static actions s_arrShuffle[c_nShuffleSize];
87 typedef size_t key_type;
88 typedef size_t value_type;
91 class Worker: public cds_test::thread
93 typedef cds_test::thread base_class;
97 size_t m_nInsertSuccess = 0;
98 size_t m_nInsertFailed = 0;
99 size_t m_nDeleteSuccess = 0;
100 size_t m_nDeleteFailed = 0;
101 size_t m_nFindSuccess = 0;
102 size_t m_nFindFailed = 0;
105 Worker( cds_test::thread_pool& pool, Map& map )
110 Worker( Worker& src )
115 virtual thread * clone()
117 return new Worker( *this );
120 typedef std::pair< key_type const, value_type > map_value_type;
122 struct update_functor {
123 template <typename Q>
124 void operator()( bool /*bNew*/, map_value_type& /*cur*/, Q const& /*val*/ ) const
128 void operator()( map_value_type& /*cur*/, map_value_type* /*old*/) const
132 void operator()( bool /*bNew*/, map_value_type& /*cur*/ ) const
136 void operator()( bool /*bNew*/, key_type /*key*/, value_type& /*val*/ ) const
145 size_t const nNormalize = size_t(-1) / ( s_nMapSize * 2 );
148 for (size_t pCount = 0; pCount < s_nPassCount; pCount++) {
149 nRand = cds::bitop::RandXorShift( nRand );
150 size_t key = nRand / nNormalize;
151 nRand = cds::bitop::RandXorShift( nRand );
152 size_t value = nRand / nNormalize;
153 switch ( s_arrShuffle[i] ) {
155 if ( rMap.contains( key ))
162 if ( rMap.insert( key, value ))
168 if ( rMap.update( key, update_functor(), true ).first )
175 if ( rMap.erase( key ))
182 if ( ++i >= c_nShuffleSize )
190 void do_test( Map& testMap )
192 typedef Worker<Map> worker;
193 cds_test::thread_pool& pool = get_pool();
194 pool.add( new worker( pool, testMap ), s_nThreadCount );
196 std::chrono::milliseconds duration = pool.run();
198 size_t nInsertSuccess = 0;
199 size_t nInsertFailed = 0;
200 size_t nDeleteSuccess = 0;
201 size_t nDeleteFailed = 0;
202 size_t nFindSuccess = 0;
203 size_t nFindFailed = 0;
204 for ( size_t i = 0; i < pool.size(); ++i ) {
205 worker& thr = static_cast<worker&>( pool.get( i ));
207 nInsertSuccess += thr.m_nInsertSuccess;
208 nInsertFailed += thr.m_nInsertFailed;
209 nDeleteSuccess += thr.m_nDeleteSuccess;
210 nDeleteFailed += thr.m_nDeleteFailed;
211 nFindSuccess += thr.m_nFindSuccess;
212 nFindFailed += thr.m_nFindFailed;
216 << std::make_pair( "insert_success", nInsertSuccess )
217 << std::make_pair( "insert_failed", nInsertFailed )
218 << std::make_pair( "delete_success", nDeleteSuccess )
219 << std::make_pair( "delete_failed", nDeleteFailed )
220 << std::make_pair( "find_success", nFindSuccess )
221 << std::make_pair( "find_failed", nFindFailed )
222 << std::make_pair( "finish_map_size", testMap.size());
225 size_t nTotalOps = nInsertSuccess + nInsertFailed + nDeleteSuccess + nDeleteFailed + nFindSuccess + nFindFailed;
226 propout() << std::make_pair( "avg_speed", nTotalOps / std::chrono::duration_cast<std::chrono::seconds>( duration ).count());
229 check_before_cleanup( testMap );
232 EXPECT_TRUE( testMap.empty());
234 additional_check( testMap );
235 print_stat( propout(), testMap );
236 additional_cleanup( testMap );
242 Map testMap( *this );
247 void run_bronson_avl_tree() {
248 Map_InsDelFind::s_nPassCount =
249 Map_InsDelFind::s_nBronsonAVLTreeMapPassCount;
254 void run_ellen_bin_tree_hp() {
255 Map_InsDelFind::s_nPassCount =
256 Map_InsDelFind::s_nHpEllenBinTreeMapPassCount;
261 void run_skip_list_hp() {
262 Map_InsDelFind::s_nPassCount =
263 Map_InsDelFind::s_nHpSkipListMapPassCount;
268 void run_feldman_hp() {
269 Map_InsDelFind::s_nPassCount =
270 Map_InsDelFind::s_nHpFeldmanPassCount;
275 void run_ellen_bin_tree_rcu() {
276 Map_InsDelFind::s_nPassCount =
277 Map_InsDelFind::s_nRcuEllenBinTreeMapPassCount;
282 void run_skip_list_rcu() {
283 Map_InsDelFind::s_nPassCount =
284 Map_InsDelFind::s_nRcuSkipListMapPassCount;
289 void run_feldman_rcu() {
290 Map_InsDelFind::s_nPassCount =
291 Map_InsDelFind::s_nRcuFeldmanPassCount;
296 class Map_InsDelFind_LF: public Map_InsDelFind
297 , public ::testing::WithParamInterface<size_t>
303 s_nLoadFactor = GetParam();
304 propout() << std::make_pair( "load_factor", s_nLoadFactor );
305 Map_InsDelFind::run_test<Map>();
309 void run_michael_hp() {
310 Map_InsDelFind::s_nPassCount =
311 Map_InsDelFind::s_nHpMichaelMapPassCount;
312 Map_InsDelFind_LF::run_test<Map>();
316 void run_split_list_hp() {
317 Map_InsDelFind::s_nPassCount =
318 Map_InsDelFind::s_nHpSplitListMapPassCount;
319 Map_InsDelFind_LF::run_test<Map>();
323 void run_iterable_michael_hp() {
324 Map_InsDelFind::s_nPassCount =
325 Map_InsDelFind::s_nHpMichaelIterableMapPassCount;
326 Map_InsDelFind_LF::run_test<Map>();
330 void run_iterable_split_list_hp() {
331 Map_InsDelFind::s_nPassCount =
332 Map_InsDelFind::s_nHpSplitListIterableMapPassCount;
333 Map_InsDelFind_LF::run_test<Map>();
337 void run_michael_rcu() {
338 Map_InsDelFind::s_nPassCount =
339 Map_InsDelFind::s_nRcuMichaelMapPassCount;
340 Map_InsDelFind_LF::run_test<Map>();
344 void run_split_list_rcu() {
345 Map_InsDelFind::s_nPassCount =
346 Map_InsDelFind::s_nRcuSplitListMapPassCount;
347 Map_InsDelFind_LF::run_test<Map>();
350 static std::vector<size_t> get_load_factors();