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 <gtest/gtest.h>
32 #include <cds/intrusive/fcqueue.h>
35 #include <boost/intrusive/slist.hpp>
39 class IntrusiveFCQueue : public ::testing::Test
42 template <typename Hook>
43 struct base_hook_item : public Hook
53 template <typename Hook>
54 struct member_hook_item
69 void operator ()( T * p )
76 template <typename Queue>
79 typedef typename Queue::value_type value_type;
81 size_t const nSize = 100;
83 std::vector<value_type> arr;
85 for ( size_t i = 0; i < nSize; ++i )
86 arr[i].nVal = static_cast<int>(i);
88 ASSERT_TRUE( q.empty() );
89 ASSERT_EQ( q.size(), 0u );
91 // pop from empty queue
93 ASSERT_TRUE( pv == nullptr );
94 ASSERT_TRUE( q.empty() );
95 ASSERT_EQ( q.size(), 0u );
98 ASSERT_TRUE( pv == nullptr );
99 ASSERT_TRUE( q.empty() );
100 ASSERT_EQ( q.size(), 0u );
103 for ( size_t i = 0; i < nSize; ++i ) {
108 ASSERT_FALSE( q.empty() );
109 ASSERT_EQ( q.size(), i + 1 );
112 for ( size_t i = 0; i < nSize; ++i ) {
113 ASSERT_FALSE( q.empty() );
114 ASSERT_EQ( q.size(), nSize - i );
119 ASSERT_FALSE( pv == nullptr );
120 ASSERT_EQ( pv->nVal, static_cast<int>(i) );
122 ASSERT_TRUE( q.empty() );
123 ASSERT_EQ( q.size(), 0u );
125 // pop() doesn't call disposer
126 for ( size_t i = 0; i < nSize; ++i ) {
127 ASSERT_EQ( arr[i].nDisposeCount, 0 );
130 // clear with disposer
131 for ( size_t i = 0; i < nSize; ++i )
134 ASSERT_FALSE( q.empty() );
135 ASSERT_EQ( q.size(), nSize );
138 ASSERT_TRUE( q.empty() );
139 ASSERT_EQ( q.size(), 0u );
141 for ( size_t i = 0; i < nSize; ++i ) {
142 ASSERT_EQ( arr[i].nDisposeCount, 1 );
145 // clear without disposer
146 for ( size_t i = 0; i < nSize; ++i )
150 ASSERT_TRUE( q.empty() );
151 ASSERT_EQ( q.size(), 0u );
153 for ( size_t i = 0; i < nSize; ++i ) {
154 ASSERT_EQ( arr[i].nDisposeCount, 1 );
159 TEST_F( IntrusiveFCQueue, base )
161 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
162 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >,
163 cds::intrusive::fcqueue::make_traits<
164 cds::intrusive::opt::disposer< disposer >
172 TEST_F( IntrusiveFCQueue, base_empty_wait_strategy )
174 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
175 struct traits: public cds::intrusive::fcqueue::traits
177 typedef IntrusiveFCQueue::disposer disposer;
178 typedef cds::algo::flat_combining::wait_strategy::empty wait_strategy;
179 typedef cds::intrusive::fcqueue::stat<> stat;
181 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
187 TEST_F( IntrusiveFCQueue, base_single_mutex_single_condvar )
189 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
190 struct traits: public cds::intrusive::fcqueue::traits
192 typedef IntrusiveFCQueue::disposer disposer;
193 typedef cds::algo::flat_combining::wait_strategy::single_mutex_single_condvar<> wait_strategy;
194 typedef cds::intrusive::fcqueue::stat<> stat;
196 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
202 TEST_F( IntrusiveFCQueue, base_mutex )
204 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
205 struct traits : public cds::intrusive::fcqueue::traits
207 typedef IntrusiveFCQueue::disposer disposer;
208 typedef std::mutex lock_type;
209 typedef cds::intrusive::fcqueue::stat<> stat;
211 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
217 TEST_F( IntrusiveFCQueue, base_mutex_single_mutex_multi_condvar )
219 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
220 struct traits: public cds::intrusive::fcqueue::traits
222 typedef IntrusiveFCQueue::disposer disposer;
223 typedef std::mutex lock_type;
224 typedef cds::intrusive::fcqueue::stat<> stat;
225 typedef cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar<> wait_strategy;
227 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
233 TEST_F( IntrusiveFCQueue, base_elimination )
235 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
236 struct traits : public
237 cds::intrusive::fcqueue::make_traits <
238 cds::intrusive::opt::disposer< disposer >
239 , cds::opt::enable_elimination < true >
242 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
248 TEST_F( IntrusiveFCQueue, base_elimination_multi_mutex_multi_condvar )
250 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
251 struct traits: public
252 cds::intrusive::fcqueue::make_traits <
253 cds::intrusive::opt::disposer< disposer >
254 , cds::opt::enable_elimination < true >
255 , cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar<>>
258 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
264 TEST_F( IntrusiveFCQueue, member )
266 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
267 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
269 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
270 cds::intrusive::fcqueue::make_traits<
271 cds::intrusive::opt::disposer< disposer >
279 TEST_F( IntrusiveFCQueue, member_mutex )
281 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
282 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
284 struct traits : public cds::intrusive::fcqueue::traits
286 typedef IntrusiveFCQueue::disposer disposer;
287 typedef std::mutex lock_type;
288 typedef cds::intrusive::fcqueue::stat<> stat;
290 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >, traits > queue_type;
296 TEST_F( IntrusiveFCQueue, member_empty_wait_strategy )
298 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
299 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
301 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
302 cds::intrusive::fcqueue::make_traits<
303 cds::intrusive::opt::disposer< disposer >
304 , cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::empty >
312 TEST_F( IntrusiveFCQueue, member_single_mutex_single_condvar )
314 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
315 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
317 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
318 cds::intrusive::fcqueue::make_traits<
319 cds::intrusive::opt::disposer< disposer >
320 , cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::single_mutex_single_condvar<2>>
328 TEST_F( IntrusiveFCQueue, member_multi_mutex_multi_condvar )
330 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
331 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
333 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
334 cds::intrusive::fcqueue::make_traits<
335 cds::intrusive::opt::disposer< disposer >
336 , cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::multi_mutex_multi_condvar<>>
344 TEST_F( IntrusiveFCQueue, member_elimination )
346 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
347 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
349 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
350 cds::intrusive::fcqueue::make_traits<
351 cds::intrusive::opt::disposer< disposer >
352 ,cds::opt::enable_elimination< true >
360 TEST_F( IntrusiveFCQueue, member_elimination_single_mutex_multi_condvar )
362 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
363 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
365 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
366 cds::intrusive::fcqueue::make_traits<
367 cds::intrusive::opt::disposer< disposer >
368 ,cds::opt::enable_elimination< true >
369 , cds::opt::wait_strategy< cds::algo::flat_combining::wait_strategy::single_mutex_multi_condvar<2>>
377 TEST_F( IntrusiveFCQueue, slist_base )
379 typedef base_hook_item< boost::intrusive::slist_base_hook<>> value_type;
380 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, boost::intrusive::cache_last< true >>,
381 cds::intrusive::fcqueue::make_traits<
382 cds::intrusive::opt::disposer< disposer >
390 TEST_F( IntrusiveFCQueue, slist_base_elimination )
392 typedef base_hook_item< boost::intrusive::slist_base_hook<> > value_type;
393 struct traits : public
394 cds::intrusive::fcqueue::make_traits <
395 cds::intrusive::opt::disposer< disposer >
396 , cds::opt::enable_elimination < true >
397 , cds::opt::lock_type< std::mutex >
400 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, boost::intrusive::cache_last< true >>, traits > queue_type;
406 TEST_F( IntrusiveFCQueue, slist_member )
408 typedef member_hook_item< boost::intrusive::slist_member_hook<> > value_type;
409 typedef boost::intrusive::member_hook<value_type, boost::intrusive::slist_member_hook<>, &value_type::hMember> member_option;
411 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, member_option, boost::intrusive::cache_last< true >>,
412 cds::intrusive::fcqueue::make_traits<
413 cds::intrusive::opt::disposer< disposer >
421 TEST_F( IntrusiveFCQueue, slist_member_elimination )
423 typedef member_hook_item< boost::intrusive::slist_member_hook<> > value_type;
424 typedef boost::intrusive::member_hook<value_type, boost::intrusive::slist_member_hook<>, &value_type::hMember> member_option;
426 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, member_option, boost::intrusive::cache_last< true >>,
427 cds::intrusive::fcqueue::make_traits<
428 cds::intrusive::opt::disposer< disposer >
429 ,cds::opt::enable_elimination< true >