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.
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_nMaxLoadFactor; // maximum load factor
42 static unsigned int s_nInsertPercentage;
43 static unsigned int s_nDeletePercentage;
44 static unsigned int s_nDuration; // test duration, seconds
46 static size_t s_nCuckooInitialSize; // initial size for CuckooMap
47 static size_t s_nCuckooProbesetSize; // CuckooMap probeset size (only for list-based probeset)
48 static size_t s_nCuckooProbesetThreshold; // CuckooMap probeset threshold (o - use default)
50 static size_t s_nFeldmanMap_HeadBits;
51 static size_t s_nFeldmanMap_ArrayBits;
53 static size_t s_nLoadFactor; // current load factor
55 static void SetUpTestCase();
56 //static void TearDownTestCase();
65 static const unsigned int c_nShuffleSize = 100;
66 static actions s_arrShuffle[c_nShuffleSize];
69 typedef size_t key_type;
70 typedef size_t value_type;
73 class Worker: public cds_test::thread
75 typedef cds_test::thread base_class;
79 size_t m_nInsertSuccess = 0;
80 size_t m_nInsertFailed = 0;
81 size_t m_nDeleteSuccess = 0;
82 size_t m_nDeleteFailed = 0;
83 size_t m_nFindSuccess = 0;
84 size_t m_nFindFailed = 0;
87 Worker( cds_test::thread_pool& pool, Map& map )
97 virtual thread * clone()
99 return new Worker( *this );
102 typedef std::pair< key_type const, value_type > map_value_type;
104 struct update_functor {
105 template <typename Q>
106 void operator()( bool /*bNew*/, map_value_type& /*cur*/, Q const& /*val*/ )
110 void operator()( map_value_type& /*cur*/, map_value_type * /*old*/)
114 void operator()( bool /*bNew*/, map_value_type& /*cur*/ )
118 void operator()( bool /*bNew*/, key_type /*key*/, value_type& /*val*/ )
127 size_t const nNormalize = size_t(-1) / ( s_nMapSize * 2 );
130 while ( !time_elapsed() ) {
131 nRand = cds::bitop::RandXorShift( nRand );
132 size_t n = nRand / nNormalize;
133 switch ( s_arrShuffle[i] ) {
135 if ( rMap.contains( n ))
142 if ( rMap.insert( n, n ))
148 if ( rMap.update( n, update_functor(), true ).first )
155 if ( rMap.erase( n ))
162 if ( ++i >= c_nShuffleSize )
170 void do_test( Map& testMap )
172 typedef Worker<Map> worker;
174 // fill map - only odd number
176 std::vector<size_t> arr;
177 arr.reserve( s_nMapSize );
178 for ( size_t i = 0; i < s_nMapSize; ++i )
179 arr.push_back( i * 2 + 1);
180 shuffle( arr.begin(), arr.end() );
181 for ( size_t i = 0; i < s_nMapSize; ++i )
182 testMap.insert( arr[i], arr[i] );
185 cds_test::thread_pool& pool = get_pool();
186 pool.add( new worker( pool, testMap ), s_nThreadCount );
188 propout() << std::make_pair( "thread_count", s_nThreadCount )
189 << std::make_pair( "insert_percentage", s_nInsertPercentage )
190 << std::make_pair( "delete_percentage", s_nDeletePercentage )
191 << std::make_pair( "map_size", s_nMapSize );
193 std::chrono::milliseconds duration = pool.run( std::chrono::seconds( s_nDuration ));
195 propout() << std::make_pair( "duration", duration );
197 size_t nInsertSuccess = 0;
198 size_t nInsertFailed = 0;
199 size_t nDeleteSuccess = 0;
200 size_t nDeleteFailed = 0;
201 size_t nFindSuccess = 0;
202 size_t nFindFailed = 0;
203 for ( size_t i = 0; i < pool.size(); ++i ) {
204 worker& thr = static_cast<worker&>( pool.get( i ));
206 nInsertSuccess += thr.m_nInsertSuccess;
207 nInsertFailed += thr.m_nInsertFailed;
208 nDeleteSuccess += thr.m_nDeleteSuccess;
209 nDeleteFailed += thr.m_nDeleteFailed;
210 nFindSuccess += thr.m_nFindSuccess;
211 nFindFailed += thr.m_nFindFailed;
215 << std::make_pair( "insert_success", nInsertSuccess )
216 << std::make_pair( "insert_failed", nInsertFailed )
217 << std::make_pair( "delete_success", nDeleteSuccess )
218 << std::make_pair( "delete_failed", nDeleteFailed )
219 << std::make_pair( "find_success", nFindSuccess )
220 << std::make_pair( "find_failed", nFindFailed )
221 << std::make_pair( "finish_map_size", testMap.size() );
224 ASSERT_TRUE( std::chrono::duration_cast<std::chrono::seconds>(duration).count() > 0 );
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 class Map_InsDelFind_LF: public Map_InsDelFind
248 , public ::testing::WithParamInterface<size_t>
254 s_nLoadFactor = GetParam();
255 propout() << std::make_pair( "load_factor", s_nLoadFactor );
256 Map_InsDelFind::run_test<Map>();
259 static std::vector<size_t> get_load_factors();