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_bronson_avltree_map.h"
32 #include <cds/urcu/signal_threaded.h>
33 #include <cds/container/bronson_avltree_map_rcu.h>
34 #include <cds/sync/pool_monitor.h>
35 #include <cds/memory/vyukov_queue_pool.h>
37 #include "unit/print_bronsonavltree_stat.h"
38 #include "unit/print_sync_monitor_stat.h"
41 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
42 namespace cc = cds::container;
43 namespace co = cds::opt;
45 typedef cds::urcu::gc< cds::urcu::signal_threaded<> > rcu_type;
48 template <typename Tree>
49 void operator()( Tree const& t )
51 std::cout << t.statistics();
52 std::cout << t.monitor().statistics();
56 typedef cds::memory::vyukov_queue_pool< std::mutex > simple_pool;
57 typedef cds::memory::lazy_vyukov_queue_pool< std::mutex > lazy_pool;
58 typedef cds::memory::bounded_vyukov_queue_pool< std::mutex > bounded_pool;
62 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_less()
64 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
66 cc::bronson_avltree::make_traits<
67 co::less< std::less<key_type> >
68 ,co::sync_monitor< cds::sync::pool_monitor<simple_pool> >
71 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
72 test<map_type, print_stat>();
76 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_less_stat()
78 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
80 cc::bronson_avltree::make_traits<
81 co::less< std::less<key_type> >
82 ,co::stat< cc::bronson_avltree::stat<> >
83 ,co::sync_monitor< cds::sync::pool_monitor<lazy_pool> >
84 ,cc::bronson_avltree::relaxed_insert< false >
87 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
88 test<map_type, print_stat>();
92 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_cmp_ic_stat()
94 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
96 cc::bronson_avltree::make_traits<
97 co::compare< compare >
98 ,co::item_counter< cds::atomicity::item_counter >
99 ,co::stat< cc::bronson_avltree::stat<> >
100 ,co::sync_monitor< cds::sync::pool_monitor<bounded_pool> >
103 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
104 test<map_type, print_stat>();
108 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_cmp_ic_stat_yield()
110 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
111 struct traits: public
112 cc::bronson_avltree::make_traits<
113 co::compare< compare >
114 ,co::item_counter< cds::atomicity::item_counter >
115 ,co::stat< cc::bronson_avltree::stat<> >
116 ,co::back_off< cds::backoff::yield >
117 ,co::sync_monitor< cds::sync::pool_monitor<lazy_pool> >
120 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
121 test<map_type, print_stat>();
125 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_less_relaxed_insert()
127 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
128 struct traits: public
129 cc::bronson_avltree::make_traits<
130 co::less< std::less<key_type> >
131 ,cc::bronson_avltree::relaxed_insert< true >
132 ,co::sync_monitor< cds::sync::pool_monitor<lazy_pool> >
135 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
136 test<map_type, print_stat>();
140 void BronsonAVLTreeHdrTest::BronsonAVLTree_rcu_sht_pool_monitor_less_relaxed_insert_stat()
142 #ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
143 struct traits: public
144 cc::bronson_avltree::make_traits<
145 co::less< std::less<key_type> >
146 ,co::stat< cc::bronson_avltree::stat<> >
147 ,cc::bronson_avltree::relaxed_insert< true >
148 ,co::sync_monitor< cds::sync::pool_monitor<simple_pool> >
151 typedef cc::BronsonAVLTreeMap< rcu_type, key_type, value_type, traits > map_type;
152 test<map_type, print_stat>();