Uses different pass count for different parallel queue test cases
[libcds.git] / test / stress / sequential / sequential-map / del3 / map_del3.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_del3.h"
32
33 namespace map {
34
35     size_t  Map_Del3::s_nMapSize = 10000;
36     size_t  Map_Del3::s_nInsThreadCount = 4;
37     size_t  Map_Del3::s_nDelThreadCount = 4;
38     size_t  Map_Del3::s_nExtractThreadCount = 4;
39     size_t  Map_Del3::s_nFindThreadCount = 2;
40     size_t  Map_Del3::s_nMaxLoadFactor = 8;
41     size_t  Map_Del3::s_nInsertPassCount = 100;
42     size_t  Map_Del3::s_nOriginalPassCount = 100;
43     size_t  Map_Del3::s_nPassCount = 100;
44     size_t  Map_Del3::s_nFeldmanPassCount = 100;
45     size_t  Map_Del3::s_nBronsonAVLTreeMapPassCount = 100;
46     size_t  Map_Del3::s_nEllenBinTreeMapPassCount= 100;
47     size_t  Map_Del3::s_nMichaelMapPassCount= 100;
48     size_t  Map_Del3::s_nSkipListMapPassCount= 100;
49
50     size_t  Map_Del3::s_nCuckooInitialSize = 1024;
51     size_t  Map_Del3::s_nCuckooProbesetSize = 16;
52     size_t  Map_Del3::s_nCuckooProbesetThreshold = 0;
53
54     size_t Map_Del3::s_nFeldmanMap_HeadBits = 10;
55     size_t Map_Del3::s_nFeldmanMap_ArrayBits = 4;
56
57     size_t Map_Del3::s_nLoadFactor = 1;
58     std::vector<size_t> Map_Del3::m_arrElements;
59
60     void Map_Del3::SetUpTestCase()
61     {
62         cds_test::config const& cfg = get_config( "sequential_real_map_delodd" );
63
64         s_nMapSize = cfg.get_size_t( "MapSize", s_nMapSize );
65         if ( s_nMapSize < 1000 )
66             s_nMapSize = 1000;
67
68         s_nInsThreadCount = cfg.get_size_t( "InsThreadCount", s_nInsThreadCount );
69         if ( s_nInsThreadCount == 0 )
70             s_nInsThreadCount = 1;
71
72         s_nDelThreadCount = cfg.get_size_t( "DelThreadCount", s_nDelThreadCount );
73         s_nExtractThreadCount = cfg.get_size_t( "ExtractThreadCount", s_nExtractThreadCount );
74         s_nFindThreadCount = cfg.get_size_t( "FindThreadCount", s_nFindThreadCount );
75
76         s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
77         if ( s_nMaxLoadFactor == 0 )
78             s_nMaxLoadFactor = 1;
79
80         s_nInsertPassCount = cfg.get_size_t( "InsertPassCount", s_nInsertPassCount );
81         if ( s_nInsertPassCount == 0 )
82             s_nInsertPassCount = 100;
83
84         s_nPassCount = cfg.get_size_t("PassCount", s_nPassCount);
85         if (s_nPassCount == 0)
86           s_nPassCount = 100;
87         s_nOriginalPassCount = s_nPassCount;
88
89         s_nFeldmanPassCount =
90             cfg.get_size_t("FeldmanPassCount", s_nFeldmanPassCount);
91         if (s_nFeldmanPassCount == 0)
92           s_nFeldmanPassCount = 500;
93
94         s_nBronsonAVLTreeMapPassCount = cfg.get_size_t(
95             "BronsonAVLTreeMapPassCount", s_nBronsonAVLTreeMapPassCount);
96         if (s_nBronsonAVLTreeMapPassCount == 0)
97           s_nBronsonAVLTreeMapPassCount = 500;
98
99         s_nEllenBinTreeMapPassCount = cfg.get_size_t(
100             "EllenBinTreeMapPassCount", s_nEllenBinTreeMapPassCount);
101         if (s_nEllenBinTreeMapPassCount == 0)
102           s_nEllenBinTreeMapPassCount = 500;
103
104         s_nMichaelMapPassCount =
105             cfg.get_size_t("MichaelMapPassCount", s_nMichaelMapPassCount);
106         if (s_nMichaelMapPassCount == 0)
107           s_nMichaelMapPassCount = 500;
108
109         s_nSkipListMapPassCount =
110             cfg.get_size_t("SkipListMapPassCount", s_nSkipListMapPassCount);
111         if (s_nSkipListMapPassCount == 0)
112           s_nSkipListMapPassCount = 500;
113
114         s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
115         if ( s_nCuckooInitialSize < 256 )
116             s_nCuckooInitialSize = 256;
117
118         s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
119         if ( s_nCuckooProbesetSize < 8 )
120             s_nCuckooProbesetSize = 8;
121
122         s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
123
124         s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
125         if ( s_nFeldmanMap_HeadBits == 0 )
126             s_nFeldmanMap_HeadBits = 2;
127
128         s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
129         if ( s_nFeldmanMap_ArrayBits == 0 )
130             s_nFeldmanMap_ArrayBits = 2;
131
132         m_arrElements.resize( s_nMapSize );
133         for ( size_t i = 0; i < s_nMapSize; ++i )
134             m_arrElements[i] = i;;
135         shuffle( m_arrElements.begin(), m_arrElements.end());
136     }
137
138     void Map_Del3::TearDownTestCase()
139     {
140         m_arrElements.clear();
141     }
142
143     std::vector<size_t> Map_Del3_LF::get_load_factors()
144     {
145         cds_test::config const& cfg = get_config( "map_delodd" );
146
147         s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
148         if ( s_nMaxLoadFactor == 0 )
149             s_nMaxLoadFactor = 1;
150
151         std::vector<size_t> lf;
152         for ( size_t n = 1; n <= s_nMaxLoadFactor; n *= 2 )
153             lf.push_back( n );
154
155         return lf;
156     }
157
158 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
159     static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
160     {
161         return std::to_string( p.param );
162     }
163     INSTANTIATE_TEST_CASE_P( a, Map_Del3_LF, ::testing::ValuesIn( Map_Del3_LF::get_load_factors()), get_test_parameter_name );
164 #else
165     INSTANTIATE_TEST_CASE_P( a, Map_Del3_LF, ::testing::ValuesIn( Map_Del3_LF::get_load_factors()));
166 #endif
167 } // namespace map