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 "hdr_intrusive_msqueue.h"
32 #include <cds/gc/hp.h>
33 #include <cds/intrusive/optimistic_queue.h>
37 #define TEST(X) void IntrusiveQueueHeaderTest::test_##X() { test<X>(); }
40 struct base_hook_item: public ci::optimistic_queue::node< cds::gc::HP >
50 struct member_hook_item
54 ci::optimistic_queue::node< cds::gc::HP > hMember;
61 struct traits_OptimisticQueue_HP_default : public ci::optimistic_queue::traits
63 typedef IntrusiveQueueHeaderTest::faked_disposer disposer;
65 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item, traits_OptimisticQueue_HP_default > OptimisticQueue_HP_default;
68 struct traits_OptimisticQueue_HP_default_ic : public traits_OptimisticQueue_HP_default
70 typedef cds::atomicity::item_counter item_counter;
72 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item, traits_OptimisticQueue_HP_default_ic > OptimisticQueue_HP_default_ic;
75 struct traits_OptimisticQueue_HP_default_stat : public
76 ci::optimistic_queue::make_traits <
77 ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
78 , co::stat< ci::optimistic_queue::stat<> >
79 , co::memory_model< co::v::sequential_consistent >
82 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item, traits_OptimisticQueue_HP_default_stat > OptimisticQueue_HP_default_stat;
85 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
86 typename ci::optimistic_queue::make_traits<
88 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
90 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
91 ,co::memory_model< co::v::relaxed_ordering >
93 > OptimisticQueue_HP_base;
96 struct traits_OptimisticQueue_HP_member : public OptimisticQueue_HP_base::traits
98 typedef ci::optimistic_queue::member_hook <
99 offsetof( member_hook_item, hMember ),
100 ci::opt::gc < cds::gc::HP >
103 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item, traits_OptimisticQueue_HP_member > OptimisticQueue_HP_member;
105 /// HP base hook + item counter
106 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
107 typename ci::optimistic_queue::make_traits<
108 ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
110 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
112 ,co::item_counter< cds::atomicity::item_counter >
114 > OptimisticQueue_HP_base_ic;
116 // HP member hook + item counter
117 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item,
118 typename ci::optimistic_queue::make_traits<
119 cds::opt::type_traits< traits_OptimisticQueue_HP_member >
120 ,co::item_counter< cds::atomicity::item_counter >
122 > OptimisticQueue_HP_member_ic;
124 // HP base hook + stat
125 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
126 typename ci::optimistic_queue::make_traits<
128 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
130 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
131 ,co::stat< ci::optimistic_queue::stat<> >
133 > OptimisticQueue_HP_base_stat;
135 // HP member hook + stat
136 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item,
137 typename ci::optimistic_queue::make_traits<
138 cds::opt::type_traits< OptimisticQueue_HP_base_stat::traits >
140 ci::optimistic_queue::member_hook<
141 offsetof(member_hook_item, hMember),
142 ci::opt::gc<cds::gc::HP>
146 > OptimisticQueue_HP_member_stat;
148 // HP base hook + padding
149 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
150 typename ci::optimistic_queue::make_traits<
151 ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
153 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
157 > OptimisticQueue_HP_base_align;
159 // HP member hook + padding
160 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item,
161 typename ci::optimistic_queue::make_traits<
163 ci::optimistic_queue::member_hook<
164 offsetof(member_hook_item, hMember),
165 ci::opt::gc<cds::gc::HP>
169 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
171 > OptimisticQueue_HP_member_align;
173 // HP base hook + no padding
174 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
175 typename ci::optimistic_queue::make_traits<
177 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
179 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
180 ,co::padding< co::no_special_padding >
182 > OptimisticQueue_HP_base_noalign;
184 // HP member hook + no padding
185 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item,
186 typename ci::optimistic_queue::make_traits<
187 ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
189 ci::optimistic_queue::member_hook<
190 offsetof(member_hook_item, hMember),
191 ci::opt::gc<cds::gc::HP>
194 ,co::padding< co::no_special_padding >
196 > OptimisticQueue_HP_member_noalign;
199 // HP base hook + cache padding
200 typedef ci::OptimisticQueue< cds::gc::HP, base_hook_item,
201 typename ci::optimistic_queue::make_traits<
203 ci::optimistic_queue::base_hook< ci::opt::gc<cds::gc::HP> >
205 ,co::padding< co::cache_line_padding >
206 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
208 > OptimisticQueue_HP_base_cachealign;
210 // HP member hook + cache padding
211 typedef ci::OptimisticQueue< cds::gc::HP, member_hook_item,
212 typename ci::optimistic_queue::make_traits<
214 ci::optimistic_queue::member_hook<
215 offsetof(member_hook_item, hMember),
216 ci::opt::gc<cds::gc::HP>
219 ,co::padding< co::cache_line_padding >
220 ,ci::opt::disposer< IntrusiveQueueHeaderTest::faked_disposer >
222 > OptimisticQueue_HP_member_cachealign;
225 TEST(OptimisticQueue_HP_default)
226 TEST(OptimisticQueue_HP_default_ic)
227 TEST(OptimisticQueue_HP_default_stat)
228 TEST(OptimisticQueue_HP_base)
229 TEST(OptimisticQueue_HP_member)
230 TEST(OptimisticQueue_HP_base_ic)
231 TEST(OptimisticQueue_HP_member_ic)
232 TEST(OptimisticQueue_HP_base_stat)
233 TEST(OptimisticQueue_HP_member_stat)
234 TEST(OptimisticQueue_HP_base_align)
235 TEST(OptimisticQueue_HP_member_align)
236 TEST(OptimisticQueue_HP_base_noalign)
237 TEST(OptimisticQueue_HP_member_noalign)
238 TEST(OptimisticQueue_HP_base_cachealign)
239 TEST(OptimisticQueue_HP_member_cachealign)