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 Set_InsDelFind: public cds_test::stress_fixture
38 static size_t s_nSetSize; // initial set size
39 static size_t s_nPassCount; // initial set 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 CuckooSet
47 static size_t s_nCuckooProbesetSize; // CuckooSet probeset size (only for list-based probeset)
48 static size_t s_nCuckooProbesetThreshold; // CUckooSet probeset threshold (0 - use default)
50 static size_t s_nFeldmanSet_HeadBits;
51 static size_t s_nFeldmanSet_ArrayBits;
53 static size_t s_nLoadFactor;
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, Set& set )
97 virtual thread * clone()
99 return new Worker( *this );
105 Set_InsDelFind& fixture = pool().template fixture<Set_InsDelFind>();
108 size_t const nNormalize = size_t(-1) / ( fixture.s_nSetSize * 2);
109 size_t pass_count = fixture.s_nPassCount;
112 while ( pass_count-- ) {
113 nRand = cds::bitop::RandXorShift(nRand);
114 size_t n = nRand / nNormalize;
115 switch ( s_arrShuffle[i] ) {
117 if ( rSet.contains( n ))
123 if ( rSet.insert( n ))
129 if ( rSet.erase( n ))
136 if ( ++i >= c_nShuffleSize )
144 void do_test( Set& testSet )
146 typedef Worker<Set> work_thread;
148 // fill map - only odd number
150 size_t * pInitArr = new size_t[ s_nSetSize ];
151 size_t * pEnd = pInitArr + s_nSetSize;
152 for ( size_t i = 0; i < s_nSetSize; ++i )
153 pInitArr[i] = i * 2 + 1;
154 shuffle( pInitArr, pEnd );
155 for ( size_t * p = pInitArr; p < pEnd; ++p )
156 testSet.insert( typename Set::value_type( *p, *p ));
161 cds_test::thread_pool& pool = get_pool();
162 std::unique_ptr<work_thread> worker(new work_thread(pool, testSet));
165 propout() << std::make_pair( "thread_count", s_nThreadCount )
166 << std::make_pair( "set_size", s_nSetSize )
167 << std::make_pair( "insert_percentage", s_nInsertPercentage )
168 << std::make_pair( "delete_percentage", s_nDeletePercentage )
169 << std::make_pair( "total_duration", s_nDuration );
171 size_t nInsertSuccess = 0;
172 size_t nInsertFailed = 0;
173 size_t nDeleteSuccess = 0;
174 size_t nDeleteFailed = 0;
175 size_t nFindSuccess = 0;
176 size_t nFindFailed = 0;
177 work_thread &thr = *worker;
178 nInsertSuccess += thr.m_nInsertSuccess;
179 nInsertFailed += thr.m_nInsertFailed;
180 nDeleteSuccess += thr.m_nDeleteSuccess;
181 nDeleteFailed += thr.m_nDeleteFailed;
182 nFindSuccess += thr.m_nFindSuccess;
183 nFindFailed += thr.m_nFindFailed;
186 << std::make_pair( "insert_success", nInsertSuccess )
187 << std::make_pair( "insert_failed", nInsertFailed )
188 << std::make_pair( "delete_success", nDeleteSuccess )
189 << std::make_pair( "delete_failed", nDeleteFailed )
190 << std::make_pair( "find_success", nFindSuccess )
191 << std::make_pair( "find_failed", nFindFailed );
194 EXPECT_TRUE( testSet.empty()) << "set size=" << testSet.size();
196 additional_check( testSet );
197 print_stat( propout(), testSet );
198 additional_cleanup( testSet );
209 class Set_InsDelFind_LF: public Set_InsDelFind
210 , public ::testing::WithParamInterface<size_t>
216 s_nLoadFactor = GetParam();
217 propout() << std::make_pair( "load_factor", s_nLoadFactor );
218 Set_InsDelFind::run_test<Set>();
221 static std::vector<size_t> get_load_factors();