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(), 0 );
91 // pop from empty queue
93 ASSERT_TRUE( pv == nullptr );
94 ASSERT_TRUE( q.empty() );
95 ASSERT_EQ( q.size(), 0 );
98 ASSERT_TRUE( pv == nullptr );
99 ASSERT_TRUE( q.empty() );
100 ASSERT_EQ( q.size(), 0 );
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(), 0 );
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(), 0 );
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(), 0 );
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_mutex )
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 std::mutex lock_type;
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_elimination )
189 typedef base_hook_item< boost::intrusive::list_base_hook<> > value_type;
190 struct traits : public
191 cds::intrusive::fcqueue::make_traits <
192 cds::intrusive::opt::disposer< disposer >
193 , cds::opt::enable_elimination < true >
196 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type >, traits > queue_type;
202 TEST_F( IntrusiveFCQueue, member )
204 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
205 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
207 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
208 cds::intrusive::fcqueue::make_traits<
209 cds::intrusive::opt::disposer< disposer >
217 TEST_F( IntrusiveFCQueue, member_mutex )
219 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
220 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
222 struct traits : public cds::intrusive::fcqueue::traits
224 typedef IntrusiveFCQueue::disposer disposer;
225 typedef std::mutex lock_type;
226 typedef cds::intrusive::fcqueue::stat<> stat;
228 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >, traits > queue_type;
234 TEST_F( IntrusiveFCQueue, member_elimination )
236 typedef member_hook_item< boost::intrusive::list_member_hook<> > value_type;
237 typedef boost::intrusive::member_hook<value_type, boost::intrusive::list_member_hook<>, &value_type::hMember> member_option;
239 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::list< value_type, member_option >,
240 cds::intrusive::fcqueue::make_traits<
241 cds::intrusive::opt::disposer< disposer >
242 ,cds::opt::enable_elimination< true >
250 TEST_F( IntrusiveFCQueue, slist_base )
252 typedef base_hook_item< boost::intrusive::slist_base_hook<>> value_type;
253 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, boost::intrusive::cache_last< true >>,
254 cds::intrusive::fcqueue::make_traits<
255 cds::intrusive::opt::disposer< disposer >
263 TEST_F( IntrusiveFCQueue, slist_base_elimination )
265 typedef base_hook_item< boost::intrusive::slist_base_hook<> > value_type;
266 struct traits : public
267 cds::intrusive::fcqueue::make_traits <
268 cds::intrusive::opt::disposer< disposer >
269 , cds::opt::enable_elimination < true >
270 , cds::opt::lock_type< std::mutex >
273 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, boost::intrusive::cache_last< true >>, traits > queue_type;
279 TEST_F( IntrusiveFCQueue, slist_member )
281 typedef member_hook_item< boost::intrusive::slist_member_hook<> > value_type;
282 typedef boost::intrusive::member_hook<value_type, boost::intrusive::slist_member_hook<>, &value_type::hMember> member_option;
284 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, member_option, boost::intrusive::cache_last< true >>,
285 cds::intrusive::fcqueue::make_traits<
286 cds::intrusive::opt::disposer< disposer >
294 TEST_F( IntrusiveFCQueue, slist_member_elimination )
296 typedef member_hook_item< boost::intrusive::slist_member_hook<> > value_type;
297 typedef boost::intrusive::member_hook<value_type, boost::intrusive::slist_member_hook<>, &value_type::hMember> member_option;
299 typedef cds::intrusive::FCQueue< value_type, boost::intrusive::slist< value_type, member_option, boost::intrusive::cache_last< true >>,
300 cds::intrusive::fcqueue::make_traits<
301 cds::intrusive::opt::disposer< disposer >
302 ,cds::opt::enable_elimination< true >