Adds parallel test organization (actual test cases are still sequential)
[libcds.git] / test / stress / parallel / parallel-map / insdelfind / map_insdelfind.cpp
1 /*
2     This file is a part of libcds - Concurrent Data Structures library
3
4     (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
5
6     Source code repo: http://github.com/khizmax/libcds/
7     Download: http://sourceforge.net/projects/libcds/files/
8
9     Redistribution and use in source and binary forms, with or without
10     modification, are permitted provided that the following conditions are met:
11
12     * Redistributions of source code must retain the above copyright notice, this
13       list of conditions and the following disclaimer.
14
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.
18
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.
29 */
30
31 #include "map_insdelfind.h"
32
33 namespace map {
34
35     size_t Map_InsDelFind::s_nMapSize = 500000;
36     size_t Map_InsDelFind::s_nThreadCount = 8;
37
38     size_t Map_InsDelFind::s_nPassCount = 100;
39     size_t Map_InsDelFind::s_nBronsonAVLTreeMapPassCount = 100;
40
41     size_t Map_InsDelFind::s_nHpFeldmanPassCount = 100;
42     size_t Map_InsDelFind::s_nHpEllenBinTreeMapPassCount = 100;
43     size_t Map_InsDelFind::s_nHpMichaelMapPassCount = 100;
44     size_t Map_InsDelFind::s_nHpSkipListMapPassCount = 100;
45     size_t Map_InsDelFind::s_nHpSplitListMapPassCount = 100;
46
47     size_t Map_InsDelFind::s_nRcuFeldmanPassCount = 100;
48     size_t Map_InsDelFind::s_nRcuEllenBinTreeMapPassCount = 100;
49     size_t Map_InsDelFind::s_nRcuMichaelMapPassCount = 100;
50     size_t Map_InsDelFind::s_nRcuSkipListMapPassCount = 100;
51     size_t Map_InsDelFind::s_nRcuSplitListMapPassCount = 100;
52
53     size_t Map_InsDelFind::s_nMaxLoadFactor = 8;
54     unsigned int Map_InsDelFind::s_nInsertPercentage = 5;
55     unsigned int Map_InsDelFind::s_nDeletePercentage = 5;
56     unsigned int Map_InsDelFind::s_nDuration = 30;
57
58
59     size_t Map_InsDelFind::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
60     size_t Map_InsDelFind::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
61     size_t Map_InsDelFind::s_nCuckooProbesetThreshold = 0; // CUckooSet probeset threshold (0 - use default)
62
63     size_t Map_InsDelFind::s_nFeldmanMap_HeadBits = 10;
64     size_t Map_InsDelFind::s_nFeldmanMap_ArrayBits = 4;
65
66     size_t Map_InsDelFind::s_nLoadFactor = 1;
67     Map_InsDelFind::actions Map_InsDelFind::s_arrShuffle[Map_InsDelFind::c_nShuffleSize];
68
69     void Map_InsDelFind::SetUpTestCase()
70     {
71         cds_test::config const& cfg = get_config( "sequential_real_map_insdelfind" );
72
73         s_nMapSize = cfg.get_size_t( "InitialMapSize", s_nMapSize );
74         if ( s_nMapSize < 1000 )
75             s_nMapSize = 1000;
76
77         s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
78         if ( s_nThreadCount == 0 )
79             s_nThreadCount = std::min( 16u, std::thread::hardware_concurrency() * 2 );
80
81         s_nPassCount =
82             cfg.get_size_t("PassCount", s_nPassCount);
83         if (s_nPassCount == 0)
84           s_nPassCount = 500;
85
86         s_nBronsonAVLTreeMapPassCount = cfg.get_size_t(
87             "BronsonAVLTreeMapPassCount", s_nBronsonAVLTreeMapPassCount);
88         if (s_nBronsonAVLTreeMapPassCount == 0)
89           s_nBronsonAVLTreeMapPassCount = 500;
90
91         s_nHpFeldmanPassCount =
92             cfg.get_size_t("HpFeldmanPassCount", s_nHpFeldmanPassCount);
93         if (s_nHpFeldmanPassCount == 0)
94           s_nHpFeldmanPassCount = 500;
95
96         s_nRcuFeldmanPassCount =
97             cfg.get_size_t("RcuFeldmanPassCount", s_nRcuFeldmanPassCount);
98         if (s_nRcuFeldmanPassCount == 0)
99           s_nRcuFeldmanPassCount = 500;
100
101         s_nHpEllenBinTreeMapPassCount = cfg.get_size_t(
102             "HpEllenBinTreeMapPassCount", s_nHpEllenBinTreeMapPassCount);
103         if (s_nHpEllenBinTreeMapPassCount == 0)
104           s_nHpEllenBinTreeMapPassCount = 500;
105
106         s_nRcuEllenBinTreeMapPassCount = cfg.get_size_t(
107             "RcuEllenBinTreeMapPassCount", s_nRcuEllenBinTreeMapPassCount);
108         if (s_nRcuEllenBinTreeMapPassCount == 0)
109           s_nRcuEllenBinTreeMapPassCount = 500;
110
111         s_nHpMichaelMapPassCount =
112             cfg.get_size_t("HpMichaelMapPassCount", s_nHpMichaelMapPassCount);
113         if (s_nHpMichaelMapPassCount == 0)
114           s_nHpMichaelMapPassCount = 500;
115
116         s_nRcuMichaelMapPassCount =
117             cfg.get_size_t("RcuMichaelMapPassCount", s_nRcuMichaelMapPassCount);
118         if (s_nRcuMichaelMapPassCount == 0)
119           s_nRcuMichaelMapPassCount = 500;
120
121         s_nHpSkipListMapPassCount =
122             cfg.get_size_t("HpSkipListMapPassCount", s_nHpSkipListMapPassCount);
123         if (s_nHpSkipListMapPassCount == 0)
124           s_nHpSkipListMapPassCount = 500;
125
126         s_nRcuSkipListMapPassCount =
127             cfg.get_size_t("RcuSkipListMapPassCount", s_nRcuSkipListMapPassCount);
128         if (s_nRcuSkipListMapPassCount == 0)
129           s_nRcuSkipListMapPassCount = 500;
130
131         s_nHpSplitListMapPassCount =
132             cfg.get_size_t("HpSplitListMapPassCount", s_nHpSplitListMapPassCount);
133         if (s_nHpSplitListMapPassCount == 0)
134           s_nHpSplitListMapPassCount = 500;
135
136         s_nRcuSplitListMapPassCount =
137             cfg.get_size_t("RcuSplitListMapPassCount", s_nRcuSplitListMapPassCount);
138         if (s_nRcuSplitListMapPassCount == 0)
139           s_nRcuSplitListMapPassCount = 500;
140
141         s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
142         if ( s_nMaxLoadFactor == 0 )
143             s_nMaxLoadFactor = 1;
144
145         s_nInsertPercentage = cfg.get_uint( "InsertPercentage", s_nInsertPercentage );
146         if ( s_nInsertPercentage >= 100 )
147             s_nInsertPercentage = 99;
148
149         s_nDeletePercentage = cfg.get_uint( "DeletePercentage", s_nDeletePercentage );
150         if ( s_nDeletePercentage >= 100 )
151             s_nDeletePercentage = 99;
152
153         if ( s_nInsertPercentage + s_nDeletePercentage > 100 ) {
154             unsigned int total = s_nInsertPercentage + s_nDeletePercentage;
155             s_nInsertPercentage = s_nInsertPercentage * 100 / total;
156             s_nDeletePercentage = s_nDeletePercentage * 100 / total;
157         }
158
159         s_nDuration = cfg.get_uint( "Duration", s_nDuration );
160         if ( s_nDuration < 5 )
161             s_nDuration = 5;
162
163         s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
164         if ( s_nCuckooInitialSize < 256 )
165             s_nCuckooInitialSize = 256;
166
167         s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
168         if ( s_nCuckooProbesetSize < 8 )
169             s_nCuckooProbesetSize = 8;
170
171         s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
172
173         s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
174         if ( s_nFeldmanMap_HeadBits == 0 )
175             s_nFeldmanMap_HeadBits = 2;
176
177         s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
178         if ( s_nFeldmanMap_ArrayBits == 0 )
179             s_nFeldmanMap_ArrayBits = 2;
180
181         actions * pFirst = s_arrShuffle;
182         actions * pLast = s_arrShuffle + s_nInsertPercentage;
183         std::fill( pFirst, pLast, do_insert );
184         pFirst = pLast;
185         pLast += s_nDeletePercentage;
186         std::fill( pFirst, pLast, do_delete );
187         pFirst = pLast;
188         pLast = s_arrShuffle + sizeof( s_arrShuffle ) / sizeof( s_arrShuffle[0] );
189         if ( pFirst < pLast )
190             std::fill( pFirst, pLast, do_find );
191         shuffle( s_arrShuffle, pLast );
192     }
193
194     std::vector<size_t> Map_InsDelFind_LF::get_load_factors()
195     {
196       cds_test::config const &cfg =
197           get_config("sequential_real_map_insdelfind");
198
199       s_nMaxLoadFactor = cfg.get_size_t("MaxLoadFactor", s_nMaxLoadFactor);
200       if (s_nMaxLoadFactor == 0)
201         s_nMaxLoadFactor = 1;
202
203       // Only test with max load factor.
204       std::vector<size_t> lf = {s_nMaxLoadFactor};
205 //      for (size_t n = 1; n <= s_nMaxLoadFactor; n *= 2)
206 //        lf.push_back(n);
207
208       return lf;
209     }
210
211 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
212     static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
213     {
214         return std::to_string( p.param );
215     }
216     INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
217 #else
218     INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()));
219 #endif
220
221 } // namespace map