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_set_hp.h"
33 #include <cds/container/michael_list_dhp.h>
34 #include <cds/container/split_list_set.h>
35 #include <cds/intrusive/free_list.h>
38 namespace cc = cds::container;
39 typedef cds::gc::DHP gc_type;
41 class SplitListMichaelSet_DHP : public cds_test::container_set_hp
44 typedef cds_test::container_set_hp base_class;
48 struct set_traits: public cc::split_list::traits {
49 typedef cc::michael_list_tag ordered_list;
50 typedef hash_int hash;
51 struct ordered_list_traits: public cc::michael_list::traits
56 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
58 cds::gc::dhp::smr::construct( set_type::c_nHazardPtrCount );
59 cds::threading::Manager::attachThread();
64 cds::threading::Manager::detachThread();
65 cds::gc::dhp::smr::destruct();
69 TEST_F( SplitListMichaelSet_DHP, compare )
71 typedef cc::SplitListSet< gc_type, int_item,
72 typename cc::split_list::make_traits<
73 cc::split_list::ordered_list< cc::michael_list_tag >
74 , cds::opt::hash< hash_int >
75 , cc::split_list::ordered_list_traits<
76 typename cc::michael_list::make_traits<
77 cds::opt::compare< cmp >
83 set_type s( kSize, 2 );
87 TEST_F( SplitListMichaelSet_DHP, less )
89 typedef cc::SplitListSet< gc_type, int_item,
90 typename cc::split_list::make_traits<
91 cc::split_list::ordered_list< cc::michael_list_tag >
92 , cds::opt::hash< hash_int >
93 , cc::split_list::ordered_list_traits<
94 typename cc::michael_list::make_traits<
95 cds::opt::less< less >
105 TEST_F( SplitListMichaelSet_DHP, cmpmix )
107 typedef cc::SplitListSet< gc_type, int_item,
108 typename cc::split_list::make_traits<
109 cc::split_list::ordered_list< cc::michael_list_tag >
110 , cds::opt::hash< hash_int >
111 , cc::split_list::ordered_list_traits<
112 typename cc::michael_list::make_traits<
113 cds::opt::less< less >
114 , cds::opt::compare< cmp >
120 set_type s( kSize, 3 );
124 TEST_F( SplitListMichaelSet_DHP, item_counting )
126 struct set_traits: public cc::split_list::traits
128 typedef cc::michael_list_tag ordered_list;
129 typedef hash_int hash;
130 typedef cds::atomicity::item_counter item_counter;
132 struct ordered_list_traits: public cc::michael_list::traits
135 typedef base_class::less less;
136 typedef cds::backoff::empty back_off;
139 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
141 set_type s( kSize, 4 );
145 TEST_F( SplitListMichaelSet_DHP, stat )
147 struct set_traits: public cc::split_list::traits
149 typedef cc::michael_list_tag ordered_list;
150 typedef hash_int hash;
151 typedef cds::atomicity::item_counter item_counter;
152 typedef cc::split_list::stat<> stat;
154 struct ordered_list_traits: public cc::michael_list::traits
156 typedef base_class::less less;
157 typedef cds::opt::v::sequential_consistent memory_model;
160 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
162 set_type s( kSize, 2 );
166 TEST_F( SplitListMichaelSet_DHP, back_off )
168 struct set_traits: public cc::split_list::traits
170 typedef cc::michael_list_tag ordered_list;
171 typedef hash_int hash;
172 typedef cds::atomicity::item_counter item_counter;
173 typedef cds::backoff::yield back_off;
174 typedef cds::opt::v::sequential_consistent memory_model;
176 struct ordered_list_traits: public cc::michael_list::traits
179 typedef cds::backoff::pause back_off;
182 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
184 set_type s( kSize, 2 );
188 TEST_F( SplitListMichaelSet_DHP, free_list )
190 struct set_traits: public cc::split_list::traits
192 typedef cc::michael_list_tag ordered_list;
193 typedef hash_int hash;
194 typedef cds::intrusive::FreeList free_list;
196 struct ordered_list_traits: public cc::michael_list::traits
199 typedef cds::backoff::pause back_off;
202 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
204 set_type s( kSize, 2 );
208 struct set_static_traits: public cc::split_list::traits
210 static bool const dynamic_bucket_table = false;
213 TEST_F( SplitListMichaelSet_DHP, static_bucket_table )
215 struct set_traits: public set_static_traits
217 typedef cc::michael_list_tag ordered_list;
218 typedef hash_int hash;
219 typedef cds::atomicity::item_counter item_counter;
221 struct ordered_list_traits: public cc::michael_list::traits
224 typedef cds::backoff::pause back_off;
227 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
229 set_type s( kSize, 4 );
233 TEST_F( SplitListMichaelSet_DHP, static_bucket_table_free_list )
235 struct set_traits: public set_static_traits
237 typedef cc::michael_list_tag ordered_list;
238 typedef hash_int hash;
239 typedef cds::atomicity::item_counter item_counter;
240 typedef cds::intrusive::FreeList free_list;
242 struct ordered_list_traits: public cc::michael_list::traits
245 typedef cds::backoff::pause back_off;
248 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
250 set_type s( kSize, 4 );
254 TEST_F( SplitListMichaelSet_DHP, bit_reversal_swar )
256 struct set_traits: public cc::split_list::traits
258 typedef cc::michael_list_tag ordered_list;
259 typedef hash_int hash;
260 typedef cds::atomicity::item_counter item_counter;
261 typedef cds::algo::bit_reversal::swar bit_reversal;
263 struct ordered_list_traits: public cc::michael_list::traits
266 typedef base_class::less less;
267 typedef cds::backoff::empty back_off;
270 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
272 set_type s( kSize, 2 );
276 TEST_F( SplitListMichaelSet_DHP, bit_reversal_lookup )
278 struct set_traits: public cc::split_list::traits
280 typedef cc::michael_list_tag ordered_list;
281 typedef hash_int hash;
282 typedef cds::atomicity::item_counter item_counter;
283 typedef cds::algo::bit_reversal::lookup bit_reversal;
285 struct ordered_list_traits: public cc::michael_list::traits
288 typedef base_class::less less;
289 typedef cds::backoff::empty back_off;
292 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
294 set_type s( kSize, 2 );
298 TEST_F( SplitListMichaelSet_DHP, bit_reversal_muldiv )
300 struct set_traits: public cc::split_list::traits
302 typedef cc::michael_list_tag ordered_list;
303 typedef hash_int hash;
304 typedef cds::atomicity::item_counter item_counter;
305 typedef cds::algo::bit_reversal::muldiv bit_reversal;
307 struct ordered_list_traits: public cc::michael_list::traits
310 typedef base_class::less less;
311 typedef cds::backoff::empty back_off;
314 typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
316 set_type s( kSize, 2 );