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 #ifndef CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H
32 #define CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H
34 #include <cds_test/check_size.h>
38 class intrusive_segmented_queue : public ::testing::Test
45 size_t nDispose2Count;
60 struct big_item : public item
74 void operator()( item * p )
82 void operator()( item * p )
88 template <typename Queue, typename Data>
89 void test( Queue& q, Data& val )
91 typedef typename Queue::value_type value_type;
93 for ( size_t i = 0; i < val.size(); ++i )
94 val[i].nValue = static_cast<int>( i );
96 ASSERT_TRUE( q.empty());
97 ASSERT_CONTAINER_SIZE( q, 0u );
100 for ( size_t i = 0; i < val.size(); ++i ) {
102 ASSERT_TRUE( q.push( val[i] ));
105 ASSERT_TRUE( q.enqueue( val[i] ));
108 ASSERT_CONTAINER_SIZE( q, i + 1 );
110 EXPECT_TRUE( !q.empty());
114 while ( !q.empty()) {
121 ASSERT_TRUE( pVal != nullptr );
123 int nSegment = int( nCount / q.quasi_factor());
124 int nMin = nSegment * int( q.quasi_factor());
125 int nMax = nMin + int( q.quasi_factor()) - 1;
126 EXPECT_TRUE( nMin <= pVal->nValue && pVal->nValue <= nMax ) << nMin << " <= " << pVal->nValue << " <= " << nMax;
129 EXPECT_CONTAINER_SIZE( q, val.size() - nCount );
131 EXPECT_EQ( nCount, val.size());
132 EXPECT_TRUE( q.empty());
133 EXPECT_CONTAINER_SIZE( q, 0u );
135 // pop from empty queue
136 ASSERT_TRUE( q.pop() == nullptr );
137 EXPECT_TRUE( q.empty());
138 EXPECT_CONTAINER_SIZE( q, 0u );
140 // check that Disposer has not been called
141 Queue::gc::force_dispose();
142 for ( size_t i = 0; i < val.size(); ++i ) {
143 EXPECT_EQ( val[i].nDisposeCount, 0u );
144 EXPECT_EQ( val[i].nDispose2Count, 0u );
148 for ( size_t i = 0; i < val.size(); ++i )
149 EXPECT_TRUE( q.push( val[i] ));
150 EXPECT_CONTAINER_SIZE( q, val.size());
151 EXPECT_TRUE( !q.empty());
154 EXPECT_CONTAINER_SIZE( q, 0u );
155 EXPECT_TRUE( q.empty());
157 // check if Disposer has been called
158 Queue::gc::force_dispose();
159 for ( size_t i = 0; i < val.size(); ++i ) {
160 EXPECT_EQ( val[i].nDisposeCount, 1u );
161 EXPECT_EQ( val[i].nDispose2Count, 0u );
165 for ( size_t i = 0; i < val.size(); ++i )
166 EXPECT_TRUE( q.push( val[i] ));
167 EXPECT_CONTAINER_SIZE( q, val.size());
168 EXPECT_TRUE( !q.empty());
170 q.clear_with( Disposer2());
171 EXPECT_CONTAINER_SIZE( q, 0u );
172 EXPECT_TRUE( q.empty());
174 // check if Disposer has been called
175 Queue::gc::force_dispose();
176 for ( size_t i = 0; i < val.size(); ++i ) {
177 EXPECT_EQ( val[i].nDisposeCount, 1u );
178 EXPECT_EQ( val[i].nDispose2Count, 1u );
181 // check clear on destruct
182 for ( size_t i = 0; i < val.size(); ++i )
183 EXPECT_TRUE( q.push( val[i] ));
184 EXPECT_CONTAINER_SIZE( q, val.size());
185 EXPECT_TRUE( !q.empty());
189 } // namespace cds_test
191 #endif // CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H