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