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_list_hp.h"
32 #include <cds/intrusive/lazy_list_hp.h>
35 namespace ci = cds::intrusive;
36 typedef cds::gc::HP gc_type;
38 class IntrusiveLazyList_HP : public cds_test::intrusive_list_hp
41 typedef cds_test::intrusive_list_hp::base_item< ci::lazy_list::node< gc_type>> base_item;
42 typedef cds_test::intrusive_list_hp::member_item< ci::lazy_list::node< gc_type>> member_item;
44 typedef cds_test::intrusive_list_hp::base_item< ci::lazy_list::node< gc_type, std::mutex>> base_mutex_item;
45 typedef cds_test::intrusive_list_hp::member_item< ci::lazy_list::node< gc_type, std::mutex>> member_mutex_item;
50 struct traits: public ci::lazy_list::traits
52 typedef ci::lazy_list::base_hook< cds::opt::gc< gc_type >> hook;
54 typedef ci::LazyList< gc_type, base_item, traits > list_type;
56 // +1 - for guarded_ptr
57 cds::gc::hp::GarbageCollector::Construct( list_type::c_nHazardPtrCount + 1, 1, 16 );
58 cds::threading::Manager::attachThread();
63 cds::threading::Manager::detachThread();
64 cds::gc::hp::GarbageCollector::Destruct( true );
68 TEST_F( IntrusiveLazyList_HP, base_hook )
70 typedef ci::LazyList< gc_type, base_item,
71 typename ci::lazy_list::make_traits<
72 ci::opt::hook< ci::lazy_list::base_hook< cds::opt::gc< gc_type >>>
73 ,ci::opt::disposer< mock_disposer >
74 ,cds::opt::less< less< base_item >>
80 test_sorted_iterator( l );
84 TEST_F( IntrusiveLazyList_HP, base_hook_cmp )
86 typedef ci::LazyList< gc_type, base_item,
87 typename ci::lazy_list::make_traits<
88 ci::opt::hook< ci::lazy_list::base_hook< cds::opt::gc< gc_type >>>
89 , ci::opt::disposer< mock_disposer >
90 , cds::opt::compare< cmp< base_item >>
96 test_sorted_iterator( l );
100 TEST_F( IntrusiveLazyList_HP, base_hook_item_counting )
102 struct traits : public ci::lazy_list::traits {
103 typedef ci::lazy_list::base_hook< cds::opt::gc< gc_type >> hook;
104 typedef mock_disposer disposer;
105 typedef cmp< base_item > compare;
106 typedef intrusive_list_common::less< base_item > less;
107 typedef cds::atomicity::item_counter item_counter;
109 typedef ci::LazyList< gc_type, base_item, traits > list_type;
113 test_sorted_iterator( l );
117 TEST_F( IntrusiveLazyList_HP, base_hook_mutex )
119 struct traits : public ci::lazy_list::traits {
120 typedef ci::lazy_list::base_hook< cds::opt::gc< gc_type >, cds::opt::lock_type< std::mutex>> hook;
121 typedef mock_disposer disposer;
122 typedef cmp< base_mutex_item > compare;
123 typedef intrusive_list_common::less< base_mutex_item > less;
124 typedef cds::atomicity::item_counter item_counter;
126 typedef ci::LazyList< gc_type, base_mutex_item, traits > list_type;
130 test_sorted_iterator( l );
134 TEST_F( IntrusiveLazyList_HP, base_hook_backoff )
136 struct traits : public ci::lazy_list::traits {
137 typedef ci::lazy_list::base_hook< cds::opt::gc< gc_type >> hook;
138 typedef mock_disposer disposer;
139 typedef cmp< base_item > compare;
140 typedef intrusive_list_common::less< base_item > less;
141 typedef cds::atomicity::item_counter item_counter;
142 typedef cds::backoff::pause back_off;
144 typedef ci::LazyList< gc_type, base_item, traits > list_type;
148 test_sorted_iterator( l );
152 TEST_F( IntrusiveLazyList_HP, base_hook_seqcst )
154 struct traits : public ci::lazy_list::traits {
155 typedef ci::lazy_list::base_hook< cds::opt::gc< gc_type >> hook;
156 typedef mock_disposer disposer;
157 typedef cmp< base_item > compare;
158 typedef intrusive_list_common::less< base_item > less;
159 typedef cds::atomicity::item_counter item_counter;
160 typedef cds::opt::v::sequential_consistent memory_model;
162 typedef ci::LazyList< gc_type, base_item, traits > list_type;
166 test_sorted_iterator( l );
170 TEST_F( IntrusiveLazyList_HP, member_hook )
172 typedef ci::LazyList< gc_type, member_item,
173 typename ci::lazy_list::make_traits<
174 ci::opt::hook< ci::lazy_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >>>
175 ,ci::opt::disposer< mock_disposer >
176 ,cds::opt::less< less< member_item >>
182 test_sorted_iterator( l );
186 TEST_F( IntrusiveLazyList_HP, member_hook_cmp )
188 typedef ci::LazyList< gc_type, member_item,
189 typename ci::lazy_list::make_traits<
190 ci::opt::hook< ci::lazy_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >>>
191 ,ci::opt::disposer< mock_disposer >
192 ,cds::opt::compare< cmp< member_item >>
198 test_sorted_iterator( l );
202 TEST_F( IntrusiveLazyList_HP, member_hook_item_counting )
204 struct traits : public ci::lazy_list::traits {
205 typedef ci::lazy_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
206 typedef mock_disposer disposer;
207 typedef cmp< member_item > compare;
208 typedef intrusive_list_common::less< member_item > less;
209 typedef cds::atomicity::item_counter item_counter;
211 typedef ci::LazyList< gc_type, member_item, traits > list_type;
215 test_sorted_iterator( l );
219 TEST_F( IntrusiveLazyList_HP, member_hook_seqcst )
221 struct traits : public ci::lazy_list::traits {
222 typedef ci::lazy_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
223 typedef mock_disposer disposer;
224 typedef cmp< member_item > compare;
225 typedef intrusive_list_common::less< member_item > less;
226 typedef cds::atomicity::item_counter item_counter;
227 typedef cds::opt::v::sequential_consistent memory_model;
229 typedef ci::LazyList< gc_type, member_item, traits > list_type;
233 test_sorted_iterator( l );
237 TEST_F( IntrusiveLazyList_HP, member_hook_mutex )
239 struct traits : public ci::lazy_list::traits {
240 typedef ci::lazy_list::member_hook< offsetof( member_mutex_item, hMember ), cds::opt::gc< gc_type >, cds::opt::lock_type< std::mutex >> hook;
241 typedef mock_disposer disposer;
242 typedef cmp< member_mutex_item > compare;
243 typedef intrusive_list_common::less< member_mutex_item > less;
244 typedef cds::atomicity::item_counter item_counter;
245 typedef cds::opt::v::sequential_consistent memory_model;
247 typedef ci::LazyList< gc_type, member_mutex_item, traits > list_type;
251 test_sorted_iterator( l );
255 TEST_F( IntrusiveLazyList_HP, member_hook_back_off )
257 struct traits : public ci::lazy_list::traits {
258 typedef ci::lazy_list::member_hook< offsetof( member_item, hMember ), cds::opt::gc< gc_type >> hook;
259 typedef mock_disposer disposer;
260 typedef cmp< member_item > compare;
261 typedef intrusive_list_common::less< member_item > less;
262 typedef cds::atomicity::item_counter item_counter;
263 typedef cds::backoff::empty back_off;
265 typedef ci::LazyList< gc_type, member_item, traits > list_type;
269 test_sorted_iterator( l );