test/unit/tree/intrusive_ellenbintree_dhp.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 "test_intrusive_tree_hp.h"
  32
  33 #include <cds/intrusive/ellen_bintree_dhp.h>
  34 #include <cds/memory/vyukov_queue_pool.h>
  35 #include <cds/memory/pool_allocator.h>
  36
  37 namespace {
  38     namespace ci = cds::intrusive;
  39     typedef cds::gc::DHP gc_type;
  40
  41     class IntrusiveEllenBinTree_DHP : public cds_test::intrusive_tree_hp
  42     {
  43     protected:
  44         typedef cds_test::intrusive_tree_hp base_class;
  45
  46     protected:
  47         typedef base_class::key_type key_type;
  48
  49         typedef typename base_class::base_int_item< ci::ellen_bintree::node<gc_type>> base_item_type;
  50         typedef ci::ellen_bintree::internal_node< key_type, base_item_type >          internal_base_node;
  51         typedef ci::ellen_bintree::update_desc< base_item_type, internal_base_node >  update_base_desc;
  52
  53         typedef typename base_class::member_int_item< ci::ellen_bintree::node<gc_type>>  member_item_type;
  54         typedef ci::ellen_bintree::internal_node< key_type, member_item_type >           internal_member_node;
  55         typedef ci::ellen_bintree::update_desc< member_item_type, internal_member_node > update_member_desc;
  56
  57         // update_desc pools
  58         struct pool_traits: public cds::memory::vyukov_queue_pool_traits
  59         {
  60             typedef cds::opt::v::static_buffer< update_base_desc, 256 > buffer;
  61         };
  62         typedef cds::memory::vyukov_queue_pool< update_base_desc, pool_traits > pool_type;
  63         typedef cds::memory::lazy_vyukov_queue_pool< update_base_desc, pool_traits > lazy_pool_type;
  64
  65         static pool_type *         s_Pool;
  66         static lazy_pool_type *    s_LazyPool;
  67
  68         struct pool_accessor
  69         {
  70             typedef pool_type::value_type value_type;
  71
  72             pool_type& operator()() const
  73             {
  74                 return *s_Pool;
  75             }
  76         };
  77
  78         struct lazy_pool_accessor
  79         {
  80             typedef lazy_pool_type::value_type value_type;
  81
  82             lazy_pool_type& operator()() const
  83             {
  84                 return *s_LazyPool;
  85             }
  86         };
  87
  88         static void SetUpTestCase()
  89         {
  90             ASSERT_TRUE( s_Pool == nullptr );
  91             ASSERT_TRUE( s_LazyPool == nullptr );
  92             s_Pool = new pool_type;
  93             s_LazyPool = new lazy_pool_type;
  94         }
  95
  96         static void TearDownTestCase()
  97         {
  98             ASSERT_TRUE( s_Pool != nullptr );
  99             ASSERT_TRUE( s_LazyPool != nullptr );
 100             delete s_LazyPool;
 101             delete s_Pool;
 102
 103             s_LazyPool = nullptr;
 104             s_Pool = nullptr;
 105         }
 106
 107         void SetUp()
 108         {
 109             struct list_traits : public ci::ellen_bintree::traits
 110             {
 111                 typedef ci::ellen_bintree::base_hook< ci::opt::gc<gc_type>> hook;
 112             };
 113             typedef ci::EllenBinTree< gc_type, key_type, base_item_type > tree_type;
 114
 115             cds::gc::dhp::GarbageCollector::Construct( 16, tree_type::c_nHazardPtrCount );
 116             cds::threading::Manager::attachThread();
 117         }
 118
 119         void TearDown()
 120         {
 121             cds::threading::Manager::detachThread();
 122             cds::gc::dhp::GarbageCollector::Destruct();
 123         }
 124
 125         struct generic_traits: public ci::ellen_bintree::traits
 126         {
 127             typedef base_class::key_extractor key_extractor;
 128             typedef mock_disposer disposer;
 129         };
 130     };
 131
 132     /*static*/ IntrusiveEllenBinTree_DHP::pool_type *      IntrusiveEllenBinTree_DHP::s_Pool = nullptr;
 133     /*static*/ IntrusiveEllenBinTree_DHP::lazy_pool_type * IntrusiveEllenBinTree_DHP::s_LazyPool = nullptr;
 134
 135     TEST_F( IntrusiveEllenBinTree_DHP, base_cmp )
 136     {
 137         typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
 138             ci::ellen_bintree::make_traits<
 139                 ci::opt::type_traits< generic_traits >
 140                 ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
 141                 ,ci::opt::compare< cmp<base_item_type>>
 142             >::type
 143         > tree_type;
 144
 145         tree_type t;
 146         test( t );
 147     }
 148
 149     TEST_F( IntrusiveEllenBinTree_DHP, base_less )
 150     {
 151         typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
 152             ci::ellen_bintree::make_traits<
 153                 ci::opt::type_traits< generic_traits >
 154                 ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
 155                 ,ci::opt::less< less<base_item_type>>
 156             >::type
 157         > tree_type;
 158
 159         tree_type t;
 160         test( t );
 161     }
 162
 163     TEST_F( IntrusiveEllenBinTree_DHP, base_item_counter )
 164     {
 165         typedef ci::EllenBinTree< gc_type, key_type, base_item_type,
 166             ci::ellen_bintree::make_traits<
 167                 ci::opt::type_traits< generic_traits >
 168                 ,ci::opt::hook< ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >>>
 169                 ,ci::opt::compare< cmp<base_item_type>>
 170                 ,ci::opt::item_counter< simple_item_counter >
 171             >::type
 172         > tree_type;
 173
 174         tree_type t;
 175         test( t );
 176     }
 177
 178     TEST_F( IntrusiveEllenBinTree_DHP, base_backoff )
 179     {
 180         struct tree_traits: public generic_traits
 181         {
 182             typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
 183             typedef cmp<base_item_type> compare;
 184             typedef base_class::less<base_item_type> less;
 185             typedef cds::atomicity::item_counter item_counter;
 186             typedef cds::backoff::yield back_off;
 187         };
 188
 189         typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
 190
 191         tree_type t;
 192         test( t );
 193     }
 194
 195     TEST_F( IntrusiveEllenBinTree_DHP, base_seq_cst )
 196     {
 197         struct tree_traits: public generic_traits
 198         {
 199             typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
 200             typedef cmp<base_item_type> compare;
 201             typedef base_class::less<base_item_type> less;
 202             typedef cds::atomicity::item_counter item_counter;
 203             typedef cds::backoff::pause back_off;
 204             typedef ci::opt::v::sequential_consistent memory_model;
 205         };
 206
 207         typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
 208
 209         tree_type t;
 210         test( t );
 211     }
 212
 213     TEST_F( IntrusiveEllenBinTree_DHP, base_update_desc_pool )
 214     {
 215         struct tree_traits: public generic_traits
 216         {
 217             typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
 218             typedef base_class::less<base_item_type> less;
 219             typedef cds::atomicity::item_counter item_counter;
 220             typedef cds::memory::pool_allocator<update_base_desc, pool_accessor> update_desc_allocator;
 221         };
 222
 223         typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
 224
 225         tree_type t;
 226         test( t );
 227     }
 228
 229     TEST_F( IntrusiveEllenBinTree_DHP, base_update_desc_lazy_pool )
 230     {
 231         struct tree_traits: public generic_traits
 232         {
 233             typedef ci::ellen_bintree::base_hook< ci::opt::gc< gc_type >> hook;
 234             typedef base_class::less<base_item_type> less;
 235             typedef cds::atomicity::item_counter item_counter;
 236             typedef cds::memory::pool_allocator<update_base_desc, lazy_pool_accessor> update_desc_allocator;
 237         };
 238
 239         typedef ci::EllenBinTree< gc_type, key_type, base_item_type, tree_traits > tree_type;
 240
 241         tree_type t;
 242         test( t );
 243     }
 244
 245     // member hook
 246     TEST_F( IntrusiveEllenBinTree_DHP, member_cmp )
 247     {
 248         typedef ci::EllenBinTree< gc_type, key_type, member_item_type,
 249             ci::ellen_bintree::make_traits<
 250                 ci::opt::type_traits< generic_traits >
 251                 ,ci::opt::hook< ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember), ci::opt::gc< gc_type >>>
 252                 ,ci::opt::compare< cmp<member_item_type>>
 253             >::type
 254         > tree_type;
 255
 256         tree_type t;
 257         test( t );
 258     }
 259
 260     TEST_F( IntrusiveEllenBinTree_DHP, member_less )
 261     {
 262         typedef ci::EllenBinTree< gc_type, key_type, member_item_type,
 263             ci::ellen_bintree::make_traits<
 264                 ci::opt::type_traits< generic_traits >
 265                 ,ci::opt::hook< ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >>>
 266                 ,ci::opt::less< less<member_item_type>>
 267             >::type
 268         > tree_type;
 269
 270         tree_type t;
 271         test( t );
 272     }
 273
 274     TEST_F( IntrusiveEllenBinTree_DHP, member_item_counter )
 275     {
 276         typedef ci::EllenBinTree< gc_type, key_type, member_item_type,
 277             ci::ellen_bintree::make_traits<
 278                 ci::opt::type_traits< generic_traits >
 279                 ,ci::opt::hook< ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >>>
 280                 ,ci::opt::compare< cmp<member_item_type>>
 281                 ,ci::opt::item_counter< simple_item_counter >
 282             >::type
 283         > tree_type;
 284
 285         tree_type t;
 286         test( t );
 287     }
 288
 289     TEST_F( IntrusiveEllenBinTree_DHP, member_backoff )
 290     {
 291         struct tree_traits: public generic_traits
 292         {
 293             typedef ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >> hook;
 294             typedef cmp<member_item_type> compare;
 295             typedef base_class::less<member_item_type> less;
 296             typedef cds::atomicity::item_counter item_counter;
 297             typedef cds::backoff::yield back_off;
 298         };
 299
 300         typedef ci::EllenBinTree< gc_type, key_type, member_item_type, tree_traits > tree_type;
 301
 302         tree_type t;
 303         test( t );
 304     }
 305
 306     TEST_F( IntrusiveEllenBinTree_DHP, member_seq_cst )
 307     {
 308         struct tree_traits: public generic_traits
 309         {
 310             typedef ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >> hook;
 311             typedef cmp<member_item_type> compare;
 312             typedef base_class::less<member_item_type> less;
 313             typedef cds::atomicity::item_counter item_counter;
 314             typedef cds::backoff::pause back_off;
 315             typedef ci::opt::v::sequential_consistent memory_model;
 316         };
 317
 318         typedef ci::EllenBinTree< gc_type, key_type, member_item_type, tree_traits > tree_type;
 319
 320         tree_type t;
 321         test( t );
 322     }
 323
 324     TEST_F( IntrusiveEllenBinTree_DHP, member_update_desc_pool )
 325     {
 326         struct tree_traits: public generic_traits
 327         {
 328             typedef ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >> hook;
 329             typedef base_class::less<member_item_type> less;
 330             typedef cds::atomicity::item_counter item_counter;
 331             typedef cds::memory::pool_allocator<update_member_desc, pool_accessor> update_desc_allocator;
 332         };
 333
 334         typedef ci::EllenBinTree< gc_type, key_type, member_item_type, tree_traits > tree_type;
 335
 336         tree_type t;
 337         test( t );
 338     }
 339
 340     TEST_F( IntrusiveEllenBinTree_DHP, member_update_desc_lazy_pool )
 341     {
 342         struct tree_traits: public generic_traits
 343         {
 344             typedef ci::ellen_bintree::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc< gc_type >> hook;
 345             typedef base_class::less<member_item_type> less;
 346             typedef cds::atomicity::item_counter item_counter;
 347             typedef cds::memory::pool_allocator<update_member_desc, lazy_pool_accessor> update_desc_allocator;
 348         };
 349
 350         typedef ci::EllenBinTree< gc_type, key_type, member_item_type, tree_traits > tree_type;
 351
 352         tree_type t;
 353         test( t );
 354     }
 355
 356 } // namespace