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/lazy_list_dhp.h>
34 #include <cds/intrusive/michael_set.h>
39 namespace ci = cds::intrusive;
40 typedef cds::gc::DHP gc_type;
42 class IntrusiveMichaelLazySet_DHP : public cds_test::intrusive_set_hp
45 typedef cds_test::intrusive_set_hp base_class;
48 typedef typename base_class::base_int_item< ci::lazy_list::node<gc_type>> base_item_type;
49 typedef typename base_class::base_int_item< ci::lazy_list::node<gc_type, std::mutex>> base_mutex_item_type;
50 typedef typename base_class::member_int_item< ci::lazy_list::node<gc_type>> member_item_type;
51 typedef typename base_class::member_int_item< ci::lazy_list::node<gc_type, std::mutex>> member_mutex_item_type;
55 struct list_traits : public ci::lazy_list::traits
57 typedef ci::lazy_list::base_hook< ci::opt::gc<gc_type>> hook;
59 typedef ci::LazyList< gc_type, base_item_type, list_traits > list_type;
60 typedef ci::MichaelHashSet< gc_type, list_type > set_type;
62 cds::gc::dhp::GarbageCollector::Construct( 16, set_type::c_nHazardPtrCount );
63 cds::threading::Manager::attachThread();
68 cds::threading::Manager::detachThread();
69 cds::gc::dhp::GarbageCollector::Destruct();
74 TEST_F( IntrusiveMichaelLazySet_DHP, base_cmp )
76 typedef ci::LazyList< gc_type
78 ,ci::lazy_list::make_traits<
79 ci::opt::hook< ci::lazy_list::base_hook< ci::opt::gc< gc_type > > >
80 ,ci::opt::compare< cmp<base_item_type> >
81 ,ci::opt::disposer< mock_disposer >
82 ,ci::opt::back_off< cds::backoff::pause >
86 typedef ci::MichaelHashSet< gc_type, bucket_type,
87 ci::michael_set::make_traits<
88 ci::opt::hash< hash_int >
92 set_type s( kSize, 2 );
96 TEST_F( IntrusiveMichaelLazySet_DHP, base_less )
98 typedef ci::LazyList< gc_type
100 ,ci::lazy_list::make_traits<
101 ci::opt::hook< ci::lazy_list::base_hook< ci::opt::gc< gc_type >>>
102 ,ci::opt::less< less<base_item_type> >
103 ,ci::opt::disposer< mock_disposer >
107 typedef ci::MichaelHashSet< gc_type, bucket_type,
108 ci::michael_set::make_traits<
109 ci::opt::hash< hash_int >
113 set_type s( kSize, 2 );
117 TEST_F( IntrusiveMichaelLazySet_DHP, base_cmpmix )
119 struct list_traits : public ci::lazy_list::traits
121 typedef ci::lazy_list::base_hook< ci::opt::gc<gc_type>> hook;
122 typedef base_class::less<base_item_type> less;
123 typedef cmp<base_item_type> compare;
124 typedef mock_disposer disposer;
126 typedef ci::LazyList< gc_type, base_item_type, list_traits > bucket_type;
128 struct set_traits : public ci::michael_set::traits
130 typedef hash_int hash;
131 typedef simple_item_counter item_counter;
133 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
135 set_type s( kSize, 2 );
139 TEST_F( IntrusiveMichaelLazySet_DHP, base_mutex )
141 struct list_traits : public ci::lazy_list::traits
143 typedef ci::lazy_list::base_hook< ci::opt::gc<gc_type>, ci::opt::lock_type<std::mutex>> hook;
144 typedef base_class::less<base_mutex_item_type> less;
145 typedef cmp<base_mutex_item_type> compare;
146 typedef mock_disposer disposer;
148 typedef ci::LazyList< gc_type, base_mutex_item_type, list_traits > bucket_type;
150 struct set_traits : public ci::michael_set::traits
152 typedef hash_int hash;
153 typedef simple_item_counter item_counter;
155 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
157 set_type s( kSize, 2 );
161 TEST_F( IntrusiveMichaelLazySet_DHP, base_stat )
163 struct list_traits: public ci::lazy_list::traits
165 typedef ci::lazy_list::base_hook< ci::opt::gc<gc_type>> hook;
166 typedef base_class::less<base_item_type> less;
167 typedef mock_disposer disposer;
168 typedef ci::lazy_list::stat<> stat;
170 typedef ci::LazyList< gc_type, base_item_type, list_traits > bucket_type;
172 struct set_traits: public ci::michael_set::traits
174 typedef hash_int hash;
175 typedef simple_item_counter item_counter;
177 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
179 set_type s( kSize, 2 );
183 TEST_F( IntrusiveMichaelLazySet_DHP, base_wrapped_stat )
185 struct list_traits: public ci::lazy_list::traits
187 typedef ci::lazy_list::base_hook< ci::opt::gc<gc_type>> hook;
188 typedef base_class::less<base_item_type> less;
189 typedef mock_disposer disposer;
190 typedef ci::lazy_list::wrapped_stat<> stat;
192 typedef ci::LazyList< gc_type, base_item_type, list_traits > bucket_type;
194 struct set_traits: public ci::michael_set::traits
196 typedef hash_int hash;
197 typedef simple_item_counter item_counter;
199 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
201 set_type s( kSize, 2 );
205 TEST_F( IntrusiveMichaelLazySet_DHP, member_cmp )
207 typedef ci::LazyList< gc_type
209 ,ci::lazy_list::make_traits<
210 ci::opt::hook< ci::lazy_list::member_hook<
211 offsetof( member_item_type, hMember ),
214 ,ci::opt::compare< cmp<member_item_type> >
215 ,ci::opt::disposer< mock_disposer >
219 typedef ci::MichaelHashSet< gc_type, bucket_type,
220 ci::michael_set::make_traits<
221 ci::opt::hash< hash_int >
225 set_type s( kSize, 2 );
229 TEST_F( IntrusiveMichaelLazySet_DHP, member_less )
231 typedef ci::LazyList< gc_type
233 ,ci::lazy_list::make_traits<
234 ci::opt::hook< ci::lazy_list::member_hook<
235 offsetof( member_item_type, hMember ),
238 ,ci::opt::less< less<member_item_type> >
239 ,ci::opt::disposer< mock_disposer >
243 typedef ci::MichaelHashSet< gc_type, bucket_type,
244 ci::michael_set::make_traits<
245 ci::opt::hash< hash_int >
249 set_type s( kSize, 2 );
253 TEST_F( IntrusiveMichaelLazySet_DHP, member_cmpmix )
255 struct list_traits : public ci::lazy_list::traits
257 typedef ci::lazy_list::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc<gc_type>> hook;
258 typedef base_class::less<member_item_type> less;
259 typedef cmp<member_item_type> compare;
260 typedef mock_disposer disposer;
262 typedef ci::LazyList< gc_type, member_item_type, list_traits > bucket_type;
264 struct set_traits : public ci::michael_set::traits
266 typedef hash_int hash;
267 typedef simple_item_counter item_counter;
269 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
271 set_type s( kSize, 2 );
275 TEST_F( IntrusiveMichaelLazySet_DHP, member_mutex )
277 struct list_traits : public ci::lazy_list::traits
279 typedef ci::lazy_list::member_hook< offsetof( member_mutex_item_type, hMember ), ci::opt::gc<gc_type>, ci::opt::lock_type<std::mutex>> hook;
280 typedef base_class::less<member_mutex_item_type> less;
281 typedef cmp<member_mutex_item_type> compare;
282 typedef mock_disposer disposer;
284 typedef ci::LazyList< gc_type, member_mutex_item_type, list_traits > bucket_type;
286 struct set_traits : public ci::michael_set::traits
288 typedef hash_int hash;
289 typedef simple_item_counter item_counter;
291 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
293 set_type s( kSize, 2 );
297 TEST_F( IntrusiveMichaelLazySet_DHP, member_stat )
299 struct list_traits: public ci::lazy_list::traits
301 typedef ci::lazy_list::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc<gc_type>> hook;
302 typedef cmp<member_item_type> compare;
303 typedef mock_disposer disposer;
304 typedef ci::lazy_list::stat<> stat;
306 typedef ci::LazyList< gc_type, member_item_type, list_traits > bucket_type;
308 struct set_traits: public ci::michael_set::traits
310 typedef hash_int hash;
311 typedef simple_item_counter item_counter;
313 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
315 set_type s( kSize, 2 );
319 TEST_F( IntrusiveMichaelLazySet_DHP, member_wrapped_stat )
321 struct list_traits: public ci::lazy_list::traits
323 typedef ci::lazy_list::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc<gc_type>> hook;
324 typedef cmp<member_item_type> compare;
325 typedef mock_disposer disposer;
326 typedef ci::lazy_list::wrapped_stat<> stat;
328 typedef ci::LazyList< gc_type, member_item_type, list_traits > bucket_type;
330 struct set_traits: public ci::michael_set::traits
332 typedef hash_int hash;
333 typedef simple_item_counter item_counter;
335 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
337 set_type s( kSize, 2 );