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.
31 #include "map_insdelfind.h"
35 size_t Map_InsDelFind::s_nMapSize = 500000;
36 size_t Map_InsDelFind::s_nThreadCount = 8;
37 size_t Map_InsDelFind::s_nPassCount = 100000;
38 size_t Map_InsDelFind::s_nBronsonAVLTreeMapPassCount = 100;
40 size_t Map_InsDelFind::s_nHpFeldmanPassCount = 100;
41 size_t Map_InsDelFind::s_nHpEllenBinTreeMapPassCount = 100;
42 size_t Map_InsDelFind::s_nHpMichaelMapPassCount = 100;
43 size_t Map_InsDelFind::s_nHpMichaelIterableMapPassCount = 100;
44 size_t Map_InsDelFind::s_nHpSkipListMapPassCount = 100;
45 size_t Map_InsDelFind::s_nHpSplitListMapPassCount = 100;
46 size_t Map_InsDelFind::s_nHpSplitListIterableMapPassCount = 100;
48 size_t Map_InsDelFind::s_nRcuFeldmanPassCount = 100;
49 size_t Map_InsDelFind::s_nRcuEllenBinTreeMapPassCount = 100;
50 size_t Map_InsDelFind::s_nRcuMichaelMapPassCount = 100;
51 size_t Map_InsDelFind::s_nRcuSkipListMapPassCount = 100;
52 size_t Map_InsDelFind::s_nRcuSplitListMapPassCount = 100;
54 size_t Map_InsDelFind::s_nMaxLoadFactor = 8;
55 unsigned int Map_InsDelFind::s_nInsertPercentage = 5;
56 unsigned int Map_InsDelFind::s_nDeletePercentage = 5;
57 unsigned int Map_InsDelFind::s_nDuration = 30;
60 size_t Map_InsDelFind::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
61 size_t Map_InsDelFind::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
62 size_t Map_InsDelFind::s_nCuckooProbesetThreshold = 0; // CUckooSet probeset threshold (0 - use default)
64 size_t Map_InsDelFind::s_nFeldmanMap_HeadBits = 10;
65 size_t Map_InsDelFind::s_nFeldmanMap_ArrayBits = 4;
67 size_t Map_InsDelFind::s_nLoadFactor = 1;
68 Map_InsDelFind::actions Map_InsDelFind::s_arrShuffle[Map_InsDelFind::c_nShuffleSize];
70 void Map_InsDelFind::SetUpTestCase()
72 cds_test::config const& cfg = get_config( "map_insdelfind" );
74 s_nMapSize = cfg.get_size_t( "InitialMapSize", s_nMapSize );
75 if ( s_nMapSize < 1000 )
78 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
79 if ( s_nThreadCount == 0 )
80 s_nThreadCount = std::min( 16u, std::thread::hardware_concurrency() * 2 );
82 s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount );
83 if ( s_nPassCount == 0 )
86 s_nHpFeldmanPassCount =
87 cfg.get_size_t("HpFeldmanPassCount", s_nHpFeldmanPassCount);
88 if (s_nHpFeldmanPassCount == 0)
89 s_nHpFeldmanPassCount = 500;
91 s_nRcuFeldmanPassCount =
92 cfg.get_size_t("RcuFeldmanPassCount", s_nRcuFeldmanPassCount);
93 if (s_nRcuFeldmanPassCount == 0)
94 s_nRcuFeldmanPassCount = 500;
96 s_nHpEllenBinTreeMapPassCount = cfg.get_size_t(
97 "HpEllenBinTreeMapPassCount", s_nHpEllenBinTreeMapPassCount);
98 if (s_nHpEllenBinTreeMapPassCount == 0)
99 s_nHpEllenBinTreeMapPassCount = 500;
101 s_nRcuEllenBinTreeMapPassCount = cfg.get_size_t(
102 "RcuEllenBinTreeMapPassCount", s_nRcuEllenBinTreeMapPassCount);
103 if (s_nRcuEllenBinTreeMapPassCount == 0)
104 s_nRcuEllenBinTreeMapPassCount = 500;
106 s_nHpMichaelMapPassCount =
107 cfg.get_size_t("HpMichaelMapPassCount", s_nHpMichaelMapPassCount);
108 if (s_nHpMichaelMapPassCount == 0)
109 s_nHpMichaelMapPassCount = 500;
111 s_nRcuMichaelMapPassCount =
112 cfg.get_size_t("RcuMichaelMapPassCount", s_nRcuMichaelMapPassCount);
113 if (s_nRcuMichaelMapPassCount == 0)
114 s_nRcuMichaelMapPassCount = 500;
116 s_nHpSkipListMapPassCount =
117 cfg.get_size_t("HpSkipListMapPassCount", s_nHpSkipListMapPassCount);
118 if (s_nHpSkipListMapPassCount == 0)
119 s_nHpSkipListMapPassCount = 500;
121 s_nRcuSkipListMapPassCount =
122 cfg.get_size_t("RcuSkipListMapPassCount", s_nRcuSkipListMapPassCount);
123 if (s_nRcuSkipListMapPassCount == 0)
124 s_nRcuSkipListMapPassCount = 500;
126 s_nHpSplitListMapPassCount =
127 cfg.get_size_t("HpSplitListMapPassCount", s_nHpSplitListMapPassCount);
128 if (s_nHpSplitListMapPassCount == 0)
129 s_nHpSplitListMapPassCount = 500;
131 s_nRcuSplitListMapPassCount =
132 cfg.get_size_t("RcuSplitListMapPassCount", s_nRcuSplitListMapPassCount);
133 if (s_nRcuSplitListMapPassCount == 0)
134 s_nRcuSplitListMapPassCount = 500;
136 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
137 if ( s_nMaxLoadFactor == 0 )
138 s_nMaxLoadFactor = 1;
140 s_nInsertPercentage = cfg.get_uint( "InsertPercentage", s_nInsertPercentage );
141 if ( s_nInsertPercentage >= 100 )
142 s_nInsertPercentage = 99;
144 s_nDeletePercentage = cfg.get_uint( "DeletePercentage", s_nDeletePercentage );
145 if ( s_nDeletePercentage >= 100 )
146 s_nDeletePercentage = 99;
148 if ( s_nInsertPercentage + s_nDeletePercentage > 100 ) {
149 unsigned int total = s_nInsertPercentage + s_nDeletePercentage;
150 s_nInsertPercentage = s_nInsertPercentage * 100 / total;
151 s_nDeletePercentage = s_nDeletePercentage * 100 / total;
154 s_nDuration = cfg.get_uint( "Duration", s_nDuration );
155 if ( s_nDuration < 5 )
158 s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
159 if ( s_nCuckooInitialSize < 256 )
160 s_nCuckooInitialSize = 256;
162 s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
163 if ( s_nCuckooProbesetSize < 8 )
164 s_nCuckooProbesetSize = 8;
166 s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
168 s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
169 if ( s_nFeldmanMap_HeadBits == 0 )
170 s_nFeldmanMap_HeadBits = 2;
172 s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
173 if ( s_nFeldmanMap_ArrayBits == 0 )
174 s_nFeldmanMap_ArrayBits = 2;
176 actions * pFirst = s_arrShuffle;
177 actions * pLast = s_arrShuffle + s_nInsertPercentage;
178 std::fill( pFirst, pLast, do_insert );
180 pLast += s_nDeletePercentage;
181 std::fill( pFirst, pLast, do_delete );
183 pLast = s_arrShuffle + sizeof( s_arrShuffle ) / sizeof( s_arrShuffle[0] );
184 if ( pFirst < pLast )
185 std::fill( pFirst, pLast, do_find );
186 shuffle( s_arrShuffle, pLast );
189 std::vector<size_t> Map_InsDelFind_LF::get_load_factors()
191 cds_test::config const& cfg = get_config( "map_insdelfind" );
193 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
194 if ( s_nMaxLoadFactor == 0 )
195 s_nMaxLoadFactor = 1;
197 // Only test with max load factor.
198 std::vector<size_t> lf = {s_nMaxLoadFactor};
199 // for (size_t n = 1; n <= s_nMaxLoadFactor; n *= 2)
205 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
206 static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
208 return std::to_string( p.param );
210 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
212 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()));