test/stress/sequential/sequential-set/insdel_find/set_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 "set_insdelfind.h"
  32
  33 namespace set {
  34
  35     size_t Set_InsDelFind::s_nSetSize = 500000;      // initial set size
  36     size_t Set_InsDelFind::s_nPassCount = 500000;      // initial pass count
  37     size_t Set_InsDelFind::s_nFeldmanPassCount = 100;
  38     size_t Set_InsDelFind::s_nBronsonAVLTreeMapPassCount = 100;
  39     size_t Set_InsDelFind::s_nEllenBinTreeMapPassCount = 100;
  40     size_t Set_InsDelFind::s_nMichaelMapPassCount = 100;
  41     size_t Set_InsDelFind::s_nSkipListMapPassCount = 100;
  42     size_t Set_InsDelFind::s_nSplitListMapPassCount = 100;
  43
  44     size_t Set_InsDelFind::s_nThreadCount = 8;       // thread count
  45     size_t Set_InsDelFind::s_nMaxLoadFactor = 8;     // maximum load factor
  46     unsigned int Set_InsDelFind::s_nInsertPercentage = 5;
  47     unsigned int Set_InsDelFind::s_nDeletePercentage = 5;
  48     unsigned int Set_InsDelFind::s_nDuration = 30;   // test duration, seconds
  49
  50     size_t Set_InsDelFind::s_nCuckooInitialSize = 1024;// initial size for CuckooSet
  51     size_t Set_InsDelFind::s_nCuckooProbesetSize = 16; // CuckooSet probeset size (only for list-based probeset)
  52     size_t Set_InsDelFind::s_nCuckooProbesetThreshold = 0; // CUckooSet probeset threshold (0 - use default)
  53
  54     size_t Set_InsDelFind::s_nFeldmanSet_HeadBits = 10;
  55     size_t Set_InsDelFind::s_nFeldmanSet_ArrayBits = 4;
  56
  57     size_t Set_InsDelFind::s_nLoadFactor = 2;
  58     Set_InsDelFind::actions Set_InsDelFind::s_arrShuffle[Set_InsDelFind::c_nShuffleSize];
  59
  60     void Set_InsDelFind::SetUpTestCase()
  61     {
  62         cds_test::config const& cfg = get_config( "sequential_set_insdelfind" );
  63
  64         s_nSetSize = cfg.get_size_t( "InitialMapSize", s_nSetSize );
  65         if ( s_nSetSize < 1000 )
  66             s_nSetSize = 1000;
  67
  68         s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount);
  69         if ( s_nPassCount < 1000 )
  70             s_nPassCount = 1000;
  71
  72         s_nFeldmanPassCount =
  73             cfg.get_size_t("FeldmanPassCount", s_nFeldmanPassCount);
  74         if (s_nFeldmanPassCount == 0)
  75           s_nFeldmanPassCount = 500;
  76
  77         s_nBronsonAVLTreeMapPassCount = cfg.get_size_t(
  78             "BronsonAVLTreeMapPassCount", s_nBronsonAVLTreeMapPassCount);
  79         if (s_nBronsonAVLTreeMapPassCount == 0)
  80           s_nBronsonAVLTreeMapPassCount = 500;
  81
  82         s_nEllenBinTreeMapPassCount = cfg.get_size_t(
  83             "EllenBinTreeMapPassCount", s_nEllenBinTreeMapPassCount);
  84         if (s_nEllenBinTreeMapPassCount == 0)
  85           s_nEllenBinTreeMapPassCount = 500;
  86
  87         s_nMichaelMapPassCount =
  88             cfg.get_size_t("MichaelMapPassCount", s_nMichaelMapPassCount);
  89         if (s_nMichaelMapPassCount == 0)
  90           s_nMichaelMapPassCount = 500;
  91
  92         s_nSkipListMapPassCount =
  93             cfg.get_size_t("SkipListMapPassCount", s_nSkipListMapPassCount);
  94         if (s_nSkipListMapPassCount == 0)
  95           s_nSkipListMapPassCount = 500;
  96
  97         s_nSplitListMapPassCount =
  98             cfg.get_size_t("SplitListMapPassCount", s_nSplitListMapPassCount);
  99         if (s_nSplitListMapPassCount == 0)
 100           s_nSplitListMapPassCount = 500;
 101
 102         s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
 103         if ( s_nThreadCount == 0 )
 104             s_nThreadCount = 2;
 105
 106         s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
 107         if ( s_nMaxLoadFactor == 0 )
 108             s_nMaxLoadFactor = 1;
 109
 110         s_nInsertPercentage = cfg.get_uint( "InsertPercentage", s_nInsertPercentage );
 111         if ( s_nInsertPercentage == 0 || s_nInsertPercentage > 90 )
 112             s_nInsertPercentage = 5;
 113
 114         s_nDeletePercentage = cfg.get_uint( "DeletePercentage", s_nDeletePercentage );
 115         if ( s_nDeletePercentage == 0 || s_nDeletePercentage > 90 )
 116             s_nDeletePercentage = 5;
 117
 118         s_nDuration = cfg.get_uint( "Duration", s_nDuration );
 119         if ( s_nDuration == 0 )
 120             s_nDuration = 5;
 121
 122         s_nCuckooInitialSize = cfg.get_size_t( "CuckooInitialSize", s_nCuckooInitialSize );
 123         if ( s_nCuckooInitialSize < 256 )
 124             s_nCuckooInitialSize = 256;
 125
 126         s_nCuckooProbesetSize = cfg.get_size_t( "CuckooProbesetSize", s_nCuckooProbesetSize );
 127         if ( s_nCuckooProbesetSize < 8 )
 128             s_nCuckooProbesetSize = 8;
 129
 130         s_nCuckooProbesetThreshold = cfg.get_size_t( "CuckooProbesetThreshold", s_nCuckooProbesetThreshold );
 131
 132         s_nFeldmanSet_HeadBits = cfg.get_size_t( "FeldmanMapHeadBits", s_nFeldmanSet_HeadBits );
 133         if ( s_nFeldmanSet_HeadBits == 0 )
 134             s_nFeldmanSet_HeadBits = 2;
 135
 136         s_nFeldmanSet_ArrayBits = cfg.get_size_t( "FeldmanMapArrayBits", s_nFeldmanSet_ArrayBits );
 137         if ( s_nFeldmanSet_ArrayBits == 0 )
 138             s_nFeldmanSet_ArrayBits = 2;
 139
 140         actions * pFirst = s_arrShuffle;
 141         actions * pLast = s_arrShuffle + s_nInsertPercentage;
 142         std::fill( pFirst, pLast, do_insert );
 143         pFirst = pLast;
 144         pLast += s_nDeletePercentage;
 145         std::fill( pFirst, pLast, do_delete );
 146         pFirst = pLast;
 147         pLast = s_arrShuffle + sizeof( s_arrShuffle ) / sizeof( s_arrShuffle[0] );
 148         if ( pFirst < pLast )
 149             std::fill( pFirst, pLast, do_find );
 150         shuffle( s_arrShuffle, pLast );
 151     }
 152
 153     std::vector<size_t> Set_InsDelFind_LF::get_load_factors()
 154     {
 155         cds_test::config const& cfg = get_config( "map_delodd" );
 156
 157         s_nMaxLoadFactor = cfg.get_size_t( "MaxLoadFactor", s_nMaxLoadFactor );
 158         if ( s_nMaxLoadFactor == 0 )
 159             s_nMaxLoadFactor = 1;
 160
 161         std::vector<size_t> lf;
 162         for ( size_t n = 1; n <= s_nMaxLoadFactor; n *= 2 )
 163             lf.push_back( n );
 164
 165         return lf;
 166     }
 167
 168 #ifdef CDSTEST_GTEST_INSTANTIATE_TEST_CASE_P_HAS_4TH_ARG
 169     static std::string get_test_parameter_name( testing::TestParamInfo<size_t> const& p )
 170     {
 171         return std::to_string( p.param );
 172     }
 173     INSTANTIATE_TEST_CASE_P( a, Set_InsDelFind_LF, ::testing::ValuesIn( Set_InsDelFind_LF::get_load_factors()), get_test_parameter_name );
 174 #else
 175     INSTANTIATE_TEST_CASE_P( a, Set_InsDelFind_LF, ::testing::ValuesIn( Set_InsDelFind_LF::get_load_factors()));
 176 #endif
 177
 178 } // namespace set