tests/test-hdr/tree/hdr_intrusive_ellen_bintree_rcu_gpi_member.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-2016
   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 "tree/hdr_intrusive_bintree.h"
  32 #include <cds/urcu/general_instant.h>
  33 #include <cds/intrusive/ellen_bintree_rcu.h>
  34
  35 #include "tree/hdr_intrusive_ellen_bintree_pool_rcu.h"
  36 #include "unit/print_ellenbintree_stat.h"
  37
  38 namespace tree {
  39     namespace ci = cds::intrusive;
  40     namespace co = cds::opt;
  41     namespace {
  42         typedef cds::urcu::gc< cds::urcu::general_instant<> > rcu_type;
  43
  44         typedef ci::ellen_bintree::node<rcu_type>                           leaf_node;
  45         typedef IntrusiveBinTreeHdrTest::member_hook_value< leaf_node >     member_value;
  46
  47         typedef ci::opt::hook< ci::ellen_bintree::member_hook< offsetof(member_value, hook), co::gc< rcu_type > > > member_hook;
  48
  49         struct print_stat {
  50             template <typename Tree>
  51             void operator()( Tree const& t)
  52             {
  53                 std::cout << t.statistics();
  54             }
  55         };
  56
  57         typedef ci::ellen_bintree::internal_node< IntrusiveBinTreeHdrTest::key_type, leaf_node > internal_node;
  58         typedef ci::ellen_bintree::update_desc< leaf_node, internal_node >   update_desc;
  59     }
  60
  61     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_less()
  62     {
  63         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
  64             ci::ellen_bintree::make_traits<
  65                 member_hook
  66                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
  67                 ,co::less< less< member_value > >
  68                 ,ci::opt::disposer< disposer< member_value > >
  69             >::type
  70         > tree_type;
  71
  72         test_rcu<tree_type, print_stat>();
  73     }
  74
  75     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_less_stat()
  76     {
  77         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
  78             ci::ellen_bintree::make_traits<
  79                 member_hook
  80                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
  81                 ,co::less< less< member_value > >
  82                 ,ci::opt::disposer< disposer< member_value > >
  83                 ,co::stat< ci::ellen_bintree::stat<> >
  84             >::type
  85         > tree_type;
  86
  87         test_rcu<tree_type, print_stat>();
  88     }
  89
  90     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_cmp()
  91     {
  92         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
  93             ci::ellen_bintree::make_traits<
  94                 member_hook
  95                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
  96                 ,co::compare< compare< member_value > >
  97                 ,ci::opt::disposer< disposer< member_value > >
  98             >::type
  99         > tree_type;
 100
 101         test_rcu<tree_type, print_stat>();
 102     }
 103
 104     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_cmpless()
 105     {
 106         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 107             ci::ellen_bintree::make_traits<
 108                 member_hook
 109                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 110                 ,co::compare< compare< member_value > >
 111                 ,co::less< less< member_value > >
 112                 ,ci::opt::disposer< disposer< member_value > >
 113             >::type
 114         > tree_type;
 115
 116         test_rcu<tree_type, print_stat>();
 117     }
 118
 119     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_less_ic()
 120     {
 121         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 122             ci::ellen_bintree::make_traits<
 123                 member_hook
 124                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 125                 ,co::less< less< member_value > >
 126                 ,ci::opt::disposer< disposer< member_value > >
 127                 ,co::item_counter< cds::atomicity::item_counter >
 128             >::type
 129         > tree_type;
 130
 131         test_rcu<tree_type, print_stat>();
 132     }
 133
 134     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_cmp_ic()
 135     {
 136         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 137             ci::ellen_bintree::make_traits<
 138                 member_hook
 139                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 140                 ,co::compare< compare< member_value > >
 141                 ,ci::opt::disposer< disposer< member_value > >
 142                 ,co::item_counter< cds::atomicity::item_counter >
 143             >::type
 144         > tree_type;
 145
 146         test_rcu<tree_type, print_stat>();
 147     }
 148
 149     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_cmp_ic_stat()
 150     {
 151         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 152             ci::ellen_bintree::make_traits<
 153                 member_hook
 154                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 155                 ,co::compare< compare< member_value > >
 156                 ,ci::opt::disposer< disposer< member_value > >
 157                 ,co::item_counter< cds::atomicity::item_counter >
 158                 ,co::stat< ci::ellen_bintree::stat<> >
 159             >::type
 160         > tree_type;
 161
 162         test_rcu<tree_type, print_stat>();
 163     }
 164
 165     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_cmp_ic_stat_yield()
 166     {
 167         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 168             ci::ellen_bintree::make_traits<
 169                 member_hook
 170                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 171                 ,co::compare< compare< member_value > >
 172                 ,ci::opt::disposer< disposer< member_value > >
 173                 ,co::item_counter< cds::atomicity::item_counter >
 174                 ,co::stat< ci::ellen_bintree::stat<> >
 175                 , co::back_off< cds::backoff::yield >
 176             >::type
 177         > tree_type;
 178
 179         test_rcu<tree_type, print_stat>();
 180     }
 181
 182     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_less_pool()
 183     {
 184         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 185             ci::ellen_bintree::make_traits<
 186                 member_hook
 187                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 188                 ,co::less< less< member_value > >
 189                 ,ci::opt::disposer< disposer< member_value > >
 190                 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_rcu::internal_node_pool_accessor > >
 191                 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_rcu::update_desc_pool_accessor > >
 192             >::type
 193         > tree_type;
 194
 195         test_rcu<tree_type, print_stat>();
 196     }
 197
 198     void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_member_less_pool_ic_stat()
 199     {
 200         typedef ci::EllenBinTree< rcu_type, key_type, member_value,
 201             ci::ellen_bintree::make_traits<
 202                 member_hook
 203                 ,ci::ellen_bintree::key_extractor< key_extractor< member_value > >
 204                 ,co::less< less< member_value > >
 205                 ,ci::opt::disposer< disposer< member_value > >
 206                 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_rcu::internal_node_pool_accessor > >
 207                 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_rcu::update_desc_pool_accessor > >
 208                 ,co::item_counter< cds::atomicity::item_counter >
 209                 ,co::stat< ci::ellen_bintree::stat<> >
 210             >::type
 211         > tree_type;
 212
 213         test_rcu<tree_type, print_stat>();
 214     }
 215
 216
 217 } //namespace tree