2 This file is a part of libcds - Concurrent Data Structures library
4 (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
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_list_hp.h"
32 #include <cds/intrusive/michael_list_hp.h>
35 namespace ci = cds::intrusive;
36 typedef cds::gc::HP gc_type;
38 class IntrusiveMichaelList_HP : public cds_test::intrusive_list_hp
41 typedef cds_test::intrusive_list_hp::base_item< ci::michael_list::node< gc_type>> base_item;
42 typedef cds_test::intrusive_list_hp::member_item< ci::michael_list::node< gc_type>> member_item;
47 struct traits: public ci::michael_list::traits
49 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
51 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
53 // +1 - for guarded_ptr
54 cds::gc::hp::GarbageCollector::Construct( list_type::c_nHazardPtrCount + 1, 1, 16 );
55 cds::threading::Manager::attachThread();
60 cds::threading::Manager::detachThread();
61 cds::gc::hp::GarbageCollector::Destruct( true );
65 TEST_F( IntrusiveMichaelList_HP, base_hook )
67 typedef ci::MichaelList< gc_type, base_item,
68 typename ci::michael_list::make_traits<
69 ci::opt::hook< ci::michael_list::base_hook< cds::opt::gc< gc_type >>>
70 ,ci::opt::disposer< mock_disposer >
71 ,cds::opt::less< less< base_item >>
77 test_ordered_iterator( l );
81 TEST_F( IntrusiveMichaelList_HP, base_hook_cmp )
83 typedef ci::MichaelList< gc_type, base_item,
84 typename ci::michael_list::make_traits<
85 ci::opt::hook< ci::michael_list::base_hook< cds::opt::gc< gc_type >>>
86 , ci::opt::disposer< mock_disposer >
87 , cds::opt::compare< cmp< base_item >>
93 test_ordered_iterator( l );
97 TEST_F( IntrusiveMichaelList_HP, base_hook_item_counting )
99 struct traits : public ci::michael_list::traits {
100 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
101 typedef mock_disposer disposer;
102 typedef cmp< base_item > compare;
103 typedef intrusive_list_common::less< base_item > less;
104 typedef cds::atomicity::item_counter item_counter;
106 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
110 test_ordered_iterator( l );
114 TEST_F( IntrusiveMichaelList_HP, base_hook_cache_friendly_item_counting )
116 struct traits: public ci::michael_list::traits {
117 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
118 typedef mock_disposer disposer;
119 typedef cmp< base_item > compare;
120 typedef intrusive_list_common::less< base_item > less;
121 typedef cds::atomicity::cache_friendly_item_counter item_counter;
123 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
127 test_ordered_iterator( l );
131 TEST_F( IntrusiveMichaelList_HP, base_hook_backoff )
133 struct traits : public ci::michael_list::traits {
134 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
135 typedef mock_disposer disposer;
136 typedef cmp< base_item > compare;
137 typedef intrusive_list_common::less< base_item > less;
138 typedef cds::atomicity::item_counter item_counter;
139 typedef cds::backoff::pause back_off;
141 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
145 test_ordered_iterator( l );
149 TEST_F( IntrusiveMichaelList_HP, base_hook_seqcst )
151 struct traits : public ci::michael_list::traits {
152 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
153 typedef mock_disposer disposer;
154 typedef cmp< base_item > compare;
155 typedef intrusive_list_common::less< base_item > less;
156 typedef cds::atomicity::item_counter item_counter;
157 typedef cds::opt::v::sequential_consistent memory_model;
159 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
163 test_ordered_iterator( l );
167 TEST_F( IntrusiveMichaelList_HP, base_hook_stat )
169 struct traits: public ci::michael_list::traits {
170 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
171 typedef mock_disposer disposer;
172 typedef cmp< base_item > compare;
173 typedef intrusive_list_common::less< base_item > less;
174 typedef cds::intrusive::michael_list::stat<> stat;
176 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
180 test_ordered_iterator( l );
184 TEST_F( IntrusiveMichaelList_HP, base_hook_wrapped_stat )
186 struct traits: public ci::michael_list::traits {
187 typedef ci::michael_list::base_hook< cds::opt::gc< gc_type >> hook;
188 typedef mock_disposer disposer;
189 typedef cmp< base_item > compare;
190 typedef cds::intrusive::michael_list::wrapped_stat<> stat;
192 typedef ci::MichaelList< gc_type, base_item, traits > list_type;
194 cds::intrusive::michael_list::stat<> st;
197 test_ordered_iterator( l );
201 TEST_F( IntrusiveMichaelList_HP, member_hook )
203 typedef ci::MichaelList< gc_type, member_item,
204 typename ci::michael_list::make_traits<
205 ci::opt::hook< ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >>>
206 ,ci::opt::disposer< mock_disposer >
207 ,cds::opt::less< less< member_item >>
213 test_ordered_iterator( l );
217 TEST_F( IntrusiveMichaelList_HP, member_hook_cmp )
219 typedef ci::MichaelList< gc_type, member_item,
220 typename ci::michael_list::make_traits<
221 ci::opt::hook< ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >>>
222 ,ci::opt::disposer< mock_disposer >
223 ,cds::opt::compare< cmp< member_item >>
229 test_ordered_iterator( l );
233 TEST_F( IntrusiveMichaelList_HP, member_hook_item_counting )
235 struct traits : public ci::michael_list::traits {
236 typedef ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
237 typedef mock_disposer disposer;
238 typedef cmp< member_item > compare;
239 typedef intrusive_list_common::less< member_item > less;
240 typedef cds::atomicity::item_counter item_counter;
242 typedef ci::MichaelList< gc_type, member_item, traits > list_type;
246 test_ordered_iterator( l );
250 TEST_F( IntrusiveMichaelList_HP, member_hook_seqcst )
252 struct traits : public ci::michael_list::traits {
253 typedef ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
254 typedef mock_disposer disposer;
255 typedef cmp< member_item > compare;
256 typedef intrusive_list_common::less< member_item > less;
257 typedef cds::atomicity::item_counter item_counter;
258 typedef cds::opt::v::sequential_consistent memory_model;
260 typedef ci::MichaelList< gc_type, member_item, traits > list_type;
264 test_ordered_iterator( l );
268 TEST_F( IntrusiveMichaelList_HP, member_hook_back_off )
270 struct traits : public ci::michael_list::traits {
271 typedef ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
272 typedef mock_disposer disposer;
273 typedef cmp< member_item > compare;
274 typedef intrusive_list_common::less< member_item > less;
275 typedef cds::atomicity::item_counter item_counter;
276 typedef cds::backoff::empty back_off;
278 typedef ci::MichaelList< gc_type, member_item, traits > list_type;
282 test_ordered_iterator( l );
286 TEST_F( IntrusiveMichaelList_HP, member_hook_stat )
288 struct traits: public ci::michael_list::traits {
289 typedef ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
290 typedef mock_disposer disposer;
291 typedef cmp< member_item > compare;
292 typedef intrusive_list_common::less< member_item > less;
293 typedef cds::intrusive::michael_list::stat<> stat;
295 typedef ci::MichaelList< gc_type, member_item, traits > list_type;
299 test_ordered_iterator( l );
303 TEST_F( IntrusiveMichaelList_HP, member_hook_wrapped_stat )
305 struct traits: public ci::michael_list::traits {
306 typedef ci::michael_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
307 typedef mock_disposer disposer;
308 typedef cmp< member_item > compare;
309 typedef cds::intrusive::michael_list::wrapped_stat<> stat;
311 typedef ci::MichaelList< gc_type, member_item, traits > list_type;
313 cds::intrusive::michael_list::stat<> st;
316 test_ordered_iterator( l );