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_nMaxLoadFactor = 8;
39 unsigned int Map_InsDelFind::s_nInsertPercentage = 5;
40 unsigned int Map_InsDelFind::s_nDeletePercentage = 5;
41 unsigned int Map_InsDelFind::s_nDuration = 30;
44 size_t Map_InsDelFind::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
45 size_t Map_InsDelFind::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
46 size_t Map_InsDelFind::s_nCuckooProbesetThreshold = 0; // CUckooSet probeset threshold (0 - use default)
48 size_t Map_InsDelFind::s_nFeldmanMap_HeadBits = 10;
49 size_t Map_InsDelFind::s_nFeldmanMap_ArrayBits = 4;
51 size_t Map_InsDelFind::s_nLoadFactor = 1;
52 Map_InsDelFind::actions Map_InsDelFind::s_arrShuffle[Map_InsDelFind::c_nShuffleSize];
54 void Map_InsDelFind::SetUpTestCase()
56 cds_test::config const& cfg = get_config( "map_insdelfind" );
58 s_nMapSize = cfg.get_size_t( "InitialMapSize", s_nMapSize );
59 if ( s_nMapSize < 1000 )
62 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
63 if ( s_nThreadCount == 0 )
64 s_nThreadCount = std::min( 16u, std::thread::hardware_concurrency() * 2 );
66 s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount );
67 if ( s_nPassCount == 0 )
68 s_nThreadCount = 1000;
70 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
71 if ( s_nMaxLoadFactor == 0 )
74 s_nInsertPercentage = cfg.get_uint( "InsertPercentage", s_nInsertPercentage );
75 if ( s_nInsertPercentage >= 100 )
76 s_nInsertPercentage = 99;
78 s_nDeletePercentage = cfg.get_uint( "DeletePercentage", s_nDeletePercentage );
79 if ( s_nDeletePercentage >= 100 )
80 s_nDeletePercentage = 99;
82 if ( s_nInsertPercentage + s_nDeletePercentage > 100 ) {
83 unsigned int total = s_nInsertPercentage + s_nDeletePercentage;
84 s_nInsertPercentage = s_nInsertPercentage * 100 / total;
85 s_nDeletePercentage = s_nDeletePercentage * 100 / total;
88 s_nDuration = cfg.get_uint( "Duration", s_nDuration );
89 if ( s_nDuration < 5 )
92 s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
93 if ( s_nCuckooInitialSize < 256 )
94 s_nCuckooInitialSize = 256;
96 s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
97 if ( s_nCuckooProbesetSize < 8 )
98 s_nCuckooProbesetSize = 8;
100 s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
102 s_nFeldmanMap_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanMap_HeadBits );
103 if ( s_nFeldmanMap_HeadBits == 0 )
104 s_nFeldmanMap_HeadBits = 2;
106 s_nFeldmanMap_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanMap_ArrayBits );
107 if ( s_nFeldmanMap_ArrayBits == 0 )
108 s_nFeldmanMap_ArrayBits = 2;
110 actions * pFirst = s_arrShuffle;
111 actions * pLast = s_arrShuffle + s_nInsertPercentage;
112 std::fill( pFirst, pLast, do_insert );
114 pLast += s_nDeletePercentage;
115 std::fill( pFirst, pLast, do_delete );
117 pLast = s_arrShuffle + sizeof( s_arrShuffle ) / sizeof( s_arrShuffle[0] );
118 if ( pFirst < pLast )
119 std::fill( pFirst, pLast, do_find );
120 shuffle( s_arrShuffle, pLast );
123 std::vector<size_t> Map_InsDelFind_LF::get_load_factors()
125 cds_test::config const& cfg = get_config( "map_insdelfind" );
127 s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
128 if ( s_nMaxLoadFactor == 0 )
129 s_nMaxLoadFactor = 1;
131 std::vector<size_t> lf;
132 for ( size_t n = 1; n <= s_nMaxLoadFactor; n *= 2 )
138 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
139 static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
141 return std::to_string( p.param );
143 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
145 INSTANTIATE_TEST_CASE_P( a, Map_InsDelFind_LF, ::testing::ValuesIn( Map_InsDelFind_LF::get_load_factors()));