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;
38 size_t Map_InsDelFind::s_nPassCount = 100;
39 size_t Map_InsDelFind::s_nFeldmanPassCount = 100;
40 size_t Map_InsDelFind::s_nBronsonAVLTreeMapPassCount = 100;
41 size_t Map_InsDelFind::s_nEllenBinTreeMapPassCount = 100;
42 size_t Map_InsDelFind::s_nMichaelMapPassCount = 100;
43 size_t Map_InsDelFind::s_nSkipListMapPassCount = 100;
44 size_t Map_InsDelFind::s_nSplitListMapPassCount = 100;
46 size_t Map_InsDelFind::s_nMaxLoadFactor = 8;
47 unsigned int Map_InsDelFind::s_nInsertPercentage = 5;
48 unsigned int Map_InsDelFind::s_nDeletePercentage = 5;
49 unsigned int Map_InsDelFind::s_nDuration = 30;
52 size_t Map_InsDelFind::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
53 size_t Map_InsDelFind::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
54 size_t Map_InsDelFind::s_nCuckooProbesetThreshold = 0; // CUckooSet probeset threshold (0 - use default)
56 size_t Map_InsDelFind::s_nFeldmanMap_HeadBits = 10;
57 size_t Map_InsDelFind::s_nFeldmanMap_ArrayBits = 4;
59 size_t Map_InsDelFind::s_nLoadFactor = 1;
60 Map_InsDelFind::actions Map_InsDelFind::s_arrShuffle[Map_InsDelFind::c_nShuffleSize];
62 void Map_InsDelFind::SetUpTestCase()
64 cds_test::config const& cfg = get_config( "sequential_real_map_insdelfind" );
66 s_nMapSize = cfg.get_size_t( "InitialMapSize", s_nMapSize );
67 if ( s_nMapSize < 1000 )
70 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
71 if ( s_nThreadCount == 0 )
72 s_nThreadCount = std::min( 16u, std::thread::hardware_concurrency() * 2 );
75 cfg.get_size_t("PassCount", s_nPassCount);
76 if (s_nPassCount == 0)
80 cfg.get_size_t("FeldmanPassCount", s_nFeldmanPassCount);
81 if (s_nFeldmanPassCount == 0)
82 s_nFeldmanPassCount = 500;
84 s_nBronsonAVLTreeMapPassCount = cfg.get_size_t(
85 "BronsonAVLTreeMapPassCount", s_nBronsonAVLTreeMapPassCount);
86 if (s_nBronsonAVLTreeMapPassCount == 0)
87 s_nBronsonAVLTreeMapPassCount = 500;
89 s_nEllenBinTreeMapPassCount = cfg.get_size_t(
90 "EllenBinTreeMapPassCount", s_nEllenBinTreeMapPassCount);
91 if (s_nEllenBinTreeMapPassCount == 0)
92 s_nEllenBinTreeMapPassCount = 500;
94 s_nMichaelMapPassCount =
95 cfg.get_size_t("MichaelMapPassCount", s_nMichaelMapPassCount);
96 if (s_nMichaelMapPassCount == 0)
97 s_nMichaelMapPassCount = 500;
99 s_nSkipListMapPassCount =
100 cfg.get_size_t("SkipListMapPassCount", s_nSkipListMapPassCount);
101 if (s_nSkipListMapPassCount == 0)
102 s_nSkipListMapPassCount = 500;
104 s_nSplitListMapPassCount =
105 cfg.get_size_t("SplitListMapPassCount", s_nSplitListMapPassCount);
106 if (s_nSplitListMapPassCount == 0)
107 s_nSplitListMapPassCount = 500;
109 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
110 if ( s_nMaxLoadFactor == 0 )
111 s_nMaxLoadFactor = 1;
113 s_nInsertPercentage = cfg.get_uint( "InsertPercentage", s_nInsertPercentage );
114 if ( s_nInsertPercentage >= 100 )
115 s_nInsertPercentage = 99;
117 s_nDeletePercentage = cfg.get_uint( "DeletePercentage", s_nDeletePercentage );
118 if ( s_nDeletePercentage >= 100 )
119 s_nDeletePercentage = 99;
121 if ( s_nInsertPercentage + s_nDeletePercentage > 100 ) {
122 unsigned int total = s_nInsertPercentage + s_nDeletePercentage;
123 s_nInsertPercentage = s_nInsertPercentage * 100 / total;
124 s_nDeletePercentage = s_nDeletePercentage * 100 / total;
127 s_nDuration = cfg.get_uint( "Duration", s_nDuration );
128 if ( s_nDuration < 5 )
131 s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
132 if ( s_nCuckooInitialSize < 256 )
133 s_nCuckooInitialSize = 256;
135 s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
136 if ( s_nCuckooProbesetSize < 8 )
137 s_nCuckooProbesetSize = 8;
139 s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
141 s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
142 if ( s_nFeldmanMap_HeadBits == 0 )
143 s_nFeldmanMap_HeadBits = 2;
145 s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
146 if ( s_nFeldmanMap_ArrayBits == 0 )
147 s_nFeldmanMap_ArrayBits = 2;
149 actions * pFirst = s_arrShuffle;
150 actions * pLast = s_arrShuffle + s_nInsertPercentage;
151 std::fill( pFirst, pLast, do_insert );
153 pLast += s_nDeletePercentage;
154 std::fill( pFirst, pLast, do_delete );
156 pLast = s_arrShuffle + sizeof( s_arrShuffle ) / sizeof( s_arrShuffle[0] );
157 if ( pFirst < pLast )
158 std::fill( pFirst, pLast, do_find );
159 shuffle( s_arrShuffle, pLast );
162 std::vector<size_t> Map_InsDelFind_LF::get_load_factors()
164 cds_test::config const& cfg = get_config( "map_insdelfind" );
166 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
167 if ( s_nMaxLoadFactor == 0 )
168 s_nMaxLoadFactor = 1;
170 std::vector<size_t> lf;
171 for ( size_t n = 1; n <= s_nMaxLoadFactor; n *= 2 )
177 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
178 static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
180 return std::to_string( p.param );
182 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
184 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()));