2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
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 "tree/hdr_intrusive_bintree.h"
32 #include <cds/urcu/general_instant.h>
33 #include <cds/intrusive/ellen_bintree_rcu.h>
35 #include "tree/hdr_intrusive_ellen_bintree_pool_rcu.h"
36 #include "unit/print_ellenbintree_stat.h"
39 namespace ci = cds::intrusive;
40 namespace co = cds::opt;
42 typedef cds::urcu::gc< cds::urcu::general_instant<> > rcu_type;
44 typedef ci::ellen_bintree::node<rcu_type> leaf_node;
45 typedef IntrusiveBinTreeHdrTest::base_hook_value< leaf_node > base_value;
48 template <typename Tree>
49 void operator()( Tree const& t)
51 std::cout << t.statistics();
55 typedef ci::ellen_bintree::internal_node< IntrusiveBinTreeHdrTest::key_type, leaf_node > internal_node;
56 typedef ci::ellen_bintree::update_desc< leaf_node, internal_node > update_desc;
59 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_less()
61 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
62 ci::ellen_bintree::make_traits<
63 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
64 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
65 ,co::less< less< base_value > >
66 ,ci::opt::disposer< disposer< base_value > >
70 test_rcu<tree_type, print_stat>();
73 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_less_stat()
75 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
76 ci::ellen_bintree::make_traits<
77 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
78 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
79 ,co::less< less< base_value > >
80 ,ci::opt::disposer< disposer< base_value > >
81 ,co::stat< ci::ellen_bintree::stat<> >
85 test_rcu<tree_type, print_stat>();
88 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_cmp()
90 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
91 ci::ellen_bintree::make_traits<
92 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
93 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
94 ,co::compare< compare< base_value > >
95 ,ci::opt::disposer< disposer< base_value > >
99 test_rcu<tree_type, print_stat>();
102 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_cmpless()
104 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
105 ci::ellen_bintree::make_traits<
106 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
107 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
108 ,co::compare< compare< base_value > >
109 ,co::less< less< base_value > >
110 ,ci::opt::disposer< disposer< base_value > >
114 test_rcu<tree_type, print_stat>();
117 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_less_ic()
119 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
120 ci::ellen_bintree::make_traits<
121 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
122 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
123 ,co::less< less< base_value > >
124 ,ci::opt::disposer< disposer< base_value > >
125 ,co::item_counter< cds::atomicity::item_counter >
129 test_rcu<tree_type, print_stat>();
132 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_cmp_ic()
134 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
135 ci::ellen_bintree::make_traits<
136 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
137 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
138 ,co::compare< compare< base_value > >
139 ,ci::opt::disposer< disposer< base_value > >
140 ,co::item_counter< cds::atomicity::item_counter >
144 test_rcu<tree_type, print_stat>();
147 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_cmp_ic_stat()
149 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
150 ci::ellen_bintree::make_traits<
151 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
152 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
153 ,co::compare< compare< base_value > >
154 ,ci::opt::disposer< disposer< base_value > >
155 ,co::item_counter< cds::atomicity::item_counter >
156 ,co::stat< ci::ellen_bintree::stat<> >
160 test_rcu<tree_type, print_stat>();
163 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_cmp_ic_stat_yield()
165 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
166 ci::ellen_bintree::make_traits<
167 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
168 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
169 ,co::compare< compare< base_value > >
170 ,ci::opt::disposer< disposer< base_value > >
171 ,co::item_counter< cds::atomicity::item_counter >
172 ,co::stat< ci::ellen_bintree::stat<> >
173 , co::back_off< cds::backoff::yield >
177 test_rcu<tree_type, print_stat>();
180 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_less_pool()
182 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
183 ci::ellen_bintree::make_traits<
184 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
185 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
186 ,co::less< less< base_value > >
187 ,ci::opt::disposer< disposer< base_value > >
188 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_rcu::internal_node_pool_accessor > >
189 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_rcu::update_desc_pool_accessor > >
193 test_rcu<tree_type, print_stat>();
196 void IntrusiveBinTreeHdrTest::EllenBinTree_rcu_gpi_base_less_pool_ic_stat()
198 typedef ci::EllenBinTree< rcu_type, key_type, base_value,
199 ci::ellen_bintree::make_traits<
200 ci::opt::hook< ci::ellen_bintree::base_hook< co::gc< rcu_type > > >
201 ,ci::ellen_bintree::key_extractor< key_extractor< base_value > >
202 ,co::less< less< base_value > >
203 ,ci::opt::disposer< disposer< base_value > >
204 ,co::node_allocator< cds::memory::pool_allocator< internal_node, ellen_bintree_rcu::internal_node_pool_accessor > >
205 ,ci::ellen_bintree::update_desc_allocator< cds::memory::pool_allocator< update_desc, ellen_bintree_rcu::update_desc_pool_accessor > >
206 ,co::item_counter< cds::atomicity::item_counter >
207 ,co::stat< ci::ellen_bintree::stat<> >
211 test_rcu<tree_type, print_stat>();