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 #include "test_bounded_queue.h"
33 #include <cds/container/weak_ringbuffer.h>
34 #include <cds_test/fixture.h>
37 namespace cc = cds::container;
39 class WeakRingBuffer: public cds_test::bounded_queue
42 template <typename Queue>
43 void test_array( Queue& q )
45 typedef typename Queue::value_type value_type;
47 const size_t nSize = q.capacity();
48 static const size_t nArrSize = 16;
49 const size_t nArrCount = nSize / nArrSize;
52 value_type el[nArrSize];
54 for ( unsigned pass = 0; pass < 3; ++pass ) {
56 for ( size_t i = 0; i < nSize; i += nArrSize ) {
57 for ( size_t k = 0; k < nArrSize; ++k )
58 el[k] = static_cast<value_type>( i + k );
60 if ( i + nArrSize <= nSize ) {
61 ASSERT_TRUE( q.push( el, nArrSize ));
64 ASSERT_FALSE( q.push( el, nArrSize ));
68 ASSERT_TRUE( !q.empty());
69 if ( nSize % nArrSize != 0 ) {
70 ASSERT_FALSE( q.full());
71 ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
72 for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
73 ASSERT_TRUE( q.enqueue( static_cast<value_type>( i )) );
76 ASSERT_TRUE( q.full());
77 ASSERT_CONTAINER_SIZE( q, nSize );
80 value_type expected = 0;
81 while ( q.pop( el, nArrSize )) {
82 for ( size_t i = 0; i < nArrSize; ++i ) {
83 ASSERT_EQ( el[i], expected );
88 if ( nSize % nArrSize == 0 ) {
89 ASSERT_TRUE( q.empty());
92 ASSERT_FALSE( q.empty());
93 ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
96 ASSERT_TRUE( q.empty());
97 ASSERT_FALSE( q.full());
98 ASSERT_CONTAINER_SIZE( q, 0u );
103 // batch push with functor
106 auto func_push = []( value_type& dest, size_t src ) { dest = static_cast<value_type>( src * 10 ); };
108 for ( unsigned pass = 0; pass < 3; ++pass ) {
109 for ( size_t i = 0; i < nSize; i += nArrSize ) {
110 for ( size_t k = 0; k < nArrSize; ++k )
113 if ( i + nArrSize <= nSize ) {
114 ASSERT_TRUE( q.push( el, nArrSize, func_push ));
117 ASSERT_FALSE( q.push( el, nArrSize, func_push ));
121 ASSERT_TRUE( !q.empty());
122 if ( nSize % nArrSize != 0 ) {
123 ASSERT_FALSE( q.full());
124 ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
125 for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
126 ASSERT_TRUE( q.push( &i, 1, func_push ));
129 ASSERT_TRUE( q.full());
130 ASSERT_CONTAINER_SIZE( q, nSize );
132 // batch pop with functor
133 auto func_pop = []( size_t& dest, value_type src ) { dest = static_cast<size_t>( src / 10 ); };
135 while ( q.pop( el, nArrSize, func_pop )) {
136 for ( size_t i = 0; i < nArrSize; ++i ) {
137 ASSERT_EQ( el[i], expected );
142 if ( nSize % nArrSize == 0 ) {
143 ASSERT_TRUE( q.empty());
146 ASSERT_FALSE( q.empty());
147 ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
149 while ( q.pop( &v, 1, func_pop )) {
150 ASSERT_EQ( v, expected );
154 ASSERT_TRUE( q.empty());
155 ASSERT_FALSE( q.full());
156 ASSERT_CONTAINER_SIZE( q, 0u );
160 for ( unsigned pass = 0; pass < 3; ++pass ) {
161 for ( size_t i = 0; i < nSize; i += nArrSize ) {
162 for ( size_t k = 0; k < nArrSize; ++k )
165 if ( i + nArrSize <= nSize ) {
166 ASSERT_TRUE( q.push( el, nArrSize, func_push ));
169 ASSERT_FALSE( q.push( el, nArrSize, func_push ));
173 ASSERT_TRUE( !q.empty());
174 if ( nSize % nArrSize != 0 ) {
175 ASSERT_FALSE( q.full());
176 ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
177 for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
178 ASSERT_TRUE( q.push( &i, 1, func_push ));
181 ASSERT_TRUE( q.full());
182 ASSERT_CONTAINER_SIZE( q, nSize );
185 while ( !q.empty()) {
186 value_type* front = q.front();
187 ASSERT_TRUE( front != nullptr );
188 ASSERT_EQ( cur, *front );
189 ASSERT_TRUE( q.pop_front());
193 ASSERT_TRUE( q.empty());
194 ASSERT_TRUE( q.front() == nullptr );
195 ASSERT_FALSE( q.pop_front());
200 template <typename Queue>
201 void test_varsize_buffer( Queue& q )
203 size_t const capacity = q.capacity();
205 ASSERT_TRUE( q.empty());
206 ASSERT_EQ( q.size(), 0u );
207 ASSERT_TRUE( q.front().first == nullptr );
208 ASSERT_FALSE( q.pop_front());
210 size_t total_push = 0;
212 while ( total_push < capacity * 4 ) {
213 unsigned buf_size = cds_test::fixture::rand( static_cast<unsigned>( capacity / 4 )) + 1;
214 total_push += buf_size;
216 void* buf = q.back( buf_size );
217 ASSERT_TRUE( buf != nullptr );
219 memset( buf, chfill, buf_size );
222 ASSERT_GE( q.size(), buf_size );
224 auto pair = q.front();
225 ASSERT_TRUE( pair.first != nullptr );
226 ASSERT_EQ( pair.second, buf_size );
227 for ( size_t i = 0; i < pair.second; ++i )
228 ASSERT_EQ( *reinterpret_cast<uint8_t*>( pair.first ), chfill );
230 ASSERT_TRUE( q.pop_front());
231 ASSERT_FALSE( q.pop_front());
234 ASSERT_TRUE( q.empty());
235 ASSERT_EQ( q.size(), 0u );
236 ASSERT_TRUE( q.front().first == nullptr );
237 ASSERT_FALSE( q.pop_front());
241 TEST_F( WeakRingBuffer, defaulted )
243 typedef cds::container::WeakRingBuffer< int > test_queue;
250 TEST_F( WeakRingBuffer, stat )
252 struct traits: public cds::container::weak_ringbuffer::traits
254 typedef cds::opt::v::uninitialized_static_buffer<int, 128> buffer;
256 typedef cds::container::WeakRingBuffer< int, traits > test_queue;
263 TEST_F( WeakRingBuffer, dynamic )
265 struct traits: public cds::container::weak_ringbuffer::traits
267 typedef cds::opt::v::uninitialized_dynamic_buffer<int> buffer;
269 typedef cds::container::WeakRingBuffer< int, traits > test_queue;
276 TEST_F( WeakRingBuffer, dynamic_mod )
278 struct traits: public cds::container::weak_ringbuffer::traits
280 typedef cds::opt::v::uninitialized_dynamic_buffer<int, CDS_DEFAULT_ALLOCATOR, false> buffer;
282 typedef cds::container::WeakRingBuffer< int, traits > test_queue;
289 TEST_F( WeakRingBuffer, dynamic_padding )
291 struct traits: public cds::container::weak_ringbuffer::traits
293 typedef cds::opt::v::uninitialized_dynamic_buffer<int> buffer;
294 enum { padding = 32 };
296 typedef cds::container::WeakRingBuffer< int, traits > test_queue;
303 TEST_F( WeakRingBuffer, var_sized )
305 typedef cds::container::WeakRingBuffer< void > test_queue;
307 test_queue q( 1024 * 64 );
308 test_varsize_buffer( q );
311 TEST_F( WeakRingBuffer, var_sized_static )
313 struct traits: public cds::container::weak_ringbuffer::traits
315 typedef cds::opt::v::uninitialized_static_buffer<int, 1024 * 64> buffer;
317 typedef cds::container::WeakRingBuffer< void, traits > test_queue;
320 test_varsize_buffer( q );