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/michael_set.h>
37 namespace ci = cds::intrusive;
38 typedef cds::gc::DHP gc_type;
40 class IntrusiveMichaelSet_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::michael_list::node<gc_type>> base_item_type;
47 typedef typename base_class::member_int_item< 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::MichaelHashSet< 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( IntrusiveMichaelSet_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::MichaelHashSet< gc_type, bucket_type,
82 ci::michael_set::make_traits<
83 ci::opt::hash< hash_int >
87 set_type s( kSize, 2 );
91 TEST_F( IntrusiveMichaelSet_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::MichaelHashSet< gc_type, bucket_type,
103 ci::michael_set::make_traits<
104 ci::opt::hash< hash_int >
108 set_type s( kSize, 2 );
112 TEST_F( IntrusiveMichaelSet_DHP, base_cmpmix )
114 struct list_traits : public ci::michael_list::traits
116 typedef ci::michael_list::base_hook< ci::opt::gc<gc_type>> hook;
117 typedef base_class::less<base_item_type> less;
118 typedef cmp<base_item_type> compare;
119 typedef mock_disposer disposer;
121 typedef ci::MichaelList< gc_type, base_item_type, list_traits > bucket_type;
123 struct set_traits : public ci::michael_set::traits
125 typedef hash_int hash;
126 typedef simple_item_counter item_counter;
128 typedef ci::MichaelHashSet< gc_type, bucket_type, set_traits > set_type;
130 set_type s( kSize, 2 );
135 TEST_F( IntrusiveMichaelSet_DHP, member_cmp )
137 typedef ci::MichaelList< gc_type
139 ,ci::michael_list::make_traits<
140 ci::opt::hook< ci::michael_list::member_hook<
141 offsetof( member_item_type, hMember ),
144 ,ci::opt::compare< cmp<member_item_type> >
145 ,ci::opt::disposer< mock_disposer >
149 typedef ci::MichaelHashSet< gc_type, bucket_type,
150 ci::michael_set::make_traits<
151 ci::opt::hash< hash_int >
155 set_type s( kSize, 2 );
159 TEST_F( IntrusiveMichaelSet_DHP, member_less )
161 typedef ci::MichaelList< gc_type
163 ,ci::michael_list::make_traits<
164 ci::opt::hook< ci::michael_list::member_hook<
165 offsetof( member_item_type, hMember ),
168 ,ci::opt::less< less<member_item_type> >
169 ,ci::opt::disposer< mock_disposer >
173 typedef ci::MichaelHashSet< gc_type, bucket_type,
174 ci::michael_set::make_traits<
175 ci::opt::hash< hash_int >
179 set_type s( kSize, 2 );
183 TEST_F( IntrusiveMichaelSet_DHP, member_cmpmix )
185 struct list_traits : public ci::michael_list::traits
187 typedef ci::michael_list::member_hook< offsetof( member_item_type, hMember ), ci::opt::gc<gc_type>> hook;
188 typedef base_class::less<member_item_type> less;
189 typedef cmp<member_item_type> compare;
190 typedef mock_disposer disposer;
192 typedef ci::MichaelList< gc_type, member_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 );