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 "test_intrusive_set_hp.h"
33 #include <cds/intrusive/michael_list_dhp.h>
34 #include <cds/intrusive/split_list.h>
37 namespace ci = cds::intrusive;
38 typedef cds::gc::DHP gc_type;
40 class IntrusiveSplitListSet_DHP : public cds_test::intrusive_set_hp
43 typedef cds_test::intrusive_set_hp base_class;
46 typedef typename base_class::base_int_item< ci::split_list::node< ci::michael_list::node<gc_type>>> base_item_type;
47 typedef typename base_class::member_int_item< ci::split_list::node< ci::michael_list::node<gc_type>>> member_item_type;
51 struct list_traits : public ci::michael_list::traits
53 typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
55 typedef ci::MichaelList< gc_type, base_item_type, list_traits > list_type;
56 typedef ci::SplitListSet< gc_type, list_type > set_type;
58 cds::gc::dhp::GarbageCollector::Construct( 16, set_type::c_nHazardPtrCount );
59 cds::threading::Manager::attachThread();
64 cds::threading::Manager::detachThread();
65 cds::gc::dhp::GarbageCollector::Destruct();
70 TEST_F( IntrusiveSplitListSet_DHP, base_cmp )
72 typedef ci::MichaelList< gc_type
74 ,ci::michael_list::make_traits<
75 ci::opt::hook< ci::michael_list::base_hook< ci::opt::gc< gc_type > > >
76 ,ci::opt::compare< cmp<base_item_type> >
77 ,ci::opt::disposer< mock_disposer >
81 typedef ci::SplitListSet< gc_type, bucket_type,
82 ci::split_list::make_traits<
83 ci::opt::hash< hash_int >
87 set_type s( kSize, 2 );
91 TEST_F( IntrusiveSplitListSet_DHP, base_less )
93 typedef ci::MichaelList< gc_type
95 ,ci::michael_list::make_traits<
96 ci::opt::hook< ci::michael_list::base_hook< ci::opt::gc< gc_type >>>
97 ,ci::opt::less< less<base_item_type> >
98 ,ci::opt::disposer< mock_disposer >
102 typedef ci::SplitListSet< gc_type, bucket_type,
103 ci::split_list::make_traits<
104 ci::opt::hash< hash_int >
105 ,ci::opt::item_counter< cds::atomicity::item_counter >
109 set_type s( kSize, 2 );
113 TEST_F( IntrusiveSplitListSet_DHP, base_cmpmix )
115 struct list_traits : public ci::michael_list::traits
117 typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
118 typedef base_class::less<base_item_type> less;
119 typedef cmp<base_item_type> compare;
120 typedef mock_disposer disposer;
122 typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
124 struct set_traits : public ci::split_list::traits
126 typedef hash_int hash;
127 typedef simple_item_counter item_counter;
128 typedef ci::split_list::stat<> stat;
130 typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
132 set_type s( kSize, 2 );
137 TEST_F( IntrusiveSplitListSet_DHP, member_cmp )
139 typedef ci::MichaelList< gc_type
141 ,ci::michael_list::make_traits<
142 ci::opt::hook< ci::michael_list::member_hook<
143 offsetof( member_item_type, hMember ),
146 ,ci::opt::compare< cmp<member_item_type> >
147 ,ci::opt::disposer< mock_disposer >
151 typedef ci::SplitListSet< gc_type, bucket_type,
152 ci::split_list::make_traits<
153 ci::opt::hash< hash_int >
157 set_type s( kSize, 2 );
161 TEST_F( IntrusiveSplitListSet_DHP, member_less )
163 typedef ci::MichaelList< gc_type
165 ,ci::michael_list::make_traits<
166 ci::opt::hook< ci::michael_list::member_hook<
167 offsetof( member_item_type, hMember ),
170 ,ci::opt::less< less<member_item_type> >
171 ,ci::opt::disposer< mock_disposer >
175 typedef ci::SplitListSet< gc_type, bucket_type,
176 ci::split_list::make_traits<
177 ci::opt::hash< hash_int >
178 ,ci::opt::back_off< cds::backoff::pause >
182 set_type s( kSize, 2 );
186 TEST_F( IntrusiveSplitListSet_DHP, member_cmpmix )
188 struct list_traits : public ci::michael_list::traits
190 typedef ci::michael_list::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc<gc_type>> hook;
191 typedef base_class::less<member_item_type> less;
192 typedef cmp<member_item_type> compare;
193 typedef mock_disposer disposer;
195 typedef ci::MichaelList< gc_type, member_item_type, list_traits > bucket_type;
197 struct set_traits : public ci::split_list::traits
199 typedef hash_int hash;
200 typedef simple_item_counter item_counter;
202 typedef ci::SplitListSet< gc_type, bucket_type, set_traits > set_type;
204 set_type s( kSize, 2 );