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
41 static size_t s_nPassCount;
42 static size_t s_nBronsonAVLTreeMapPassCount;
43 static size_t s_nEllenBinTreeMapPassCount;
44 static size_t s_nFeldmanPassCount;
45 static size_t s_nMichaelMapPassCount;
46 static size_t s_nSkipListMapPassCount;
47 static size_t s_nSplitListMapPassCount;
49 static size_t s_nThreadCount; // thread count
50 static size_t s_nMaxLoadFactor; // maximum load factor
51 static unsigned int s_nInsertPercentage;
52 static unsigned int s_nDeletePercentage;
53 static unsigned int s_nDuration; // test duration, seconds
55 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
56 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
57 static size_t s_nCuckooProbesetThreshold; // CuckooMap probeset threshold (o - use default)
59 static size_t s_nFeldmanMap_HeadBits;
60 static size_t s_nFeldmanMap_ArrayBits;
62 static size_t s_nLoadFactor; // current load factor
64 static void SetUpTestCase();
65 //static void TearDownTestCase();
74 static const unsigned int c_nShuffleSize = 100;
75 static actions s_arrShuffle[c_nShuffleSize];
78 typedef size_t key_type;
79 typedef size_t value_type;
82 class Worker: public cds_test::thread
84 typedef cds_test::thread base_class;
88 size_t m_nInsertSuccess = 0;
89 size_t m_nInsertFailed = 0;
90 size_t m_nDeleteSuccess = 0;
91 size_t m_nDeleteFailed = 0;
92 size_t m_nFindSuccess = 0;
93 size_t m_nFindFailed = 0;
96 Worker( cds_test::thread_pool& pool, Map& map )
101 Worker( Worker& src )
106 virtual thread * clone()
108 return new Worker( *this );
111 typedef std::pair< key_type const, value_type > map_value_type;
113 struct update_functor {
114 template <typename Q>
115 void operator()( bool /*bNew*/, map_value_type& /*cur*/, Q const& /*val*/ ) const
119 void operator()( map_value_type& /*cur*/, map_value_type* /*old*/) const
123 void operator()( bool /*bNew*/, map_value_type& /*cur*/ ) const
127 void operator()( bool /*bNew*/, key_type /*key*/, value_type& /*val*/ ) const
134 Map_InsDelFind& fixture = pool().template fixture<Map_InsDelFind>();
135 size_t pass_count = fixture.s_nPassCount;
138 size_t const nNormalize = size_t(-1) / ( s_nMapSize * 2 );
141 while ( pass_count-- ) {
142 nRand = cds::bitop::RandXorShift( nRand );
143 size_t n = nRand / nNormalize;
144 switch ( s_arrShuffle[i] ) {
146 if ( rMap.contains( n ))
153 if ( rMap.insert( n, n ))
159 if ( rMap.update( n, update_functor(), true ).first )
166 if ( rMap.erase( n ))
173 if ( ++i >= c_nShuffleSize )
181 void do_test( Map& testMap )
183 typedef Worker<Map> worker;
185 // fill map - only odd number
187 std::vector<size_t> arr;
188 arr.reserve( s_nMapSize );
189 for ( size_t i = 0; i < s_nMapSize; ++i )
190 arr.push_back( i * 2 + 1);
191 shuffle( arr.begin(), arr.end());
192 for ( size_t i = 0; i < s_nMapSize; ++i )
193 testMap.insert( arr[i], arr[i] );
196 cds_test::thread_pool& pool = get_pool();
197 std::unique_ptr<worker> worker_thrd(new worker(pool, testMap));
201 EXPECT_TRUE( testMap.empty());
202 additional_cleanup( testMap );
208 Map testMap( *this );
213 void run_bronson_avl_tree() {
214 Map_InsDelFind::s_nPassCount =
215 Map_InsDelFind::s_nBronsonAVLTreeMapPassCount;
220 void run_ellen_bin_tree() {
221 Map_InsDelFind::s_nPassCount =
222 Map_InsDelFind::s_nEllenBinTreeMapPassCount;
227 void run_skip_list() {
228 Map_InsDelFind::s_nPassCount =
229 Map_InsDelFind::s_nSkipListMapPassCount;
235 Map_InsDelFind::s_nPassCount =
236 Map_InsDelFind::s_nFeldmanPassCount;
241 class Map_InsDelFind_LF: public Map_InsDelFind
242 , public ::testing::WithParamInterface<size_t>
248 s_nLoadFactor = GetParam();
249 propout() << std::make_pair( "load_factor", s_nLoadFactor );
250 Map_InsDelFind::run_test<Map>();
255 Map_InsDelFind::s_nPassCount =
256 Map_InsDelFind::s_nMichaelMapPassCount;
257 Map_InsDelFind_LF::run_test<Map>();
261 void run_split_list() {
262 Map_InsDelFind::s_nPassCount =
263 Map_InsDelFind::s_nSplitListMapPassCount;
264 Map_InsDelFind_LF::run_test<Map>();
267 static std::vector<size_t> get_load_factors();