#include "test_bounded_queue.h"
#include <cds/container/weak_ringbuffer.h>
+#include <cds_test/fixture.h>
namespace {
namespace cc = cds::container;
{
value_type el[nArrSize];
- // batch push
- for ( size_t i = 0; i < nSize; i += nArrSize ) {
- for ( size_t k = 0; k < nArrSize; ++k )
- el[k] = static_cast<value_type>( i + k );
+ for ( unsigned pass = 0; pass < 3; ++pass ) {
+ // batch push
+ for ( size_t i = 0; i < nSize; i += nArrSize ) {
+ for ( size_t k = 0; k < nArrSize; ++k )
+ el[k] = static_cast<value_type>( i + k );
+
+ if ( i + nArrSize <= nSize ) {
+ ASSERT_TRUE( q.push( el, nArrSize ) );
+ }
+ else {
+ ASSERT_FALSE( q.push( el, nArrSize ) );
+ }
+ }
- if ( i + nArrSize <= nSize ) {
- ASSERT_TRUE( q.push( el, nArrSize ) );
+ ASSERT_TRUE( !q.empty() );
+ if ( nSize % nArrSize != 0 ) {
+ ASSERT_FALSE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
+ for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
+ ASSERT_TRUE( q.enqueue( static_cast<value_type>( i ) ) );
+ }
}
- else {
- ASSERT_FALSE( q.push( el, nArrSize ) );
+ ASSERT_TRUE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nSize );
+
+ // batch pop
+ value_type expected = 0;
+ while ( q.pop( el, nArrSize ) ) {
+ for ( size_t i = 0; i < nArrSize; ++i ) {
+ ASSERT_EQ( el[i], expected );
+ ++expected;
+ }
}
- }
- ASSERT_TRUE( !q.empty() );
- if ( nSize % nArrSize != 0 ) {
- ASSERT_FALSE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
- for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
- ASSERT_TRUE( q.enqueue( static_cast<value_type>( i ) ) );
+ if ( nSize % nArrSize == 0 ) {
+ ASSERT_TRUE( q.empty() );
}
- }
- ASSERT_TRUE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nSize );
-
- // batch pop
- value_type expected = 0;
- while ( q.pop( el, nArrSize ) ) {
- for ( size_t i = 0; i < nArrSize; ++i ) {
- ASSERT_EQ( el[i], expected );
- ++expected;
+ else {
+ ASSERT_FALSE( q.empty() );
+ ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
+ q.clear();
}
- }
-
- if ( nSize % nArrSize == 0 ) {
ASSERT_TRUE( q.empty() );
+ ASSERT_FALSE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, 0u );
}
- else {
- ASSERT_FALSE( q.empty() );
- ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
- q.clear();
- }
- ASSERT_TRUE( q.empty() );
- ASSERT_FALSE( q.full() );
- ASSERT_CONTAINER_SIZE( q, 0u );
}
{
size_t el[nArrSize];
auto func_push = []( value_type& dest, size_t src ) { dest = static_cast<value_type>( src * 10 ); };
- for ( size_t i = 0; i < nSize; i += nArrSize ) {
- for ( size_t k = 0; k < nArrSize; ++k )
- el[k] = i + k;
- if ( i + nArrSize <= nSize ) {
- ASSERT_TRUE( q.push( el, nArrSize, func_push ) );
+ for ( unsigned pass = 0; pass < 3; ++pass ) {
+ for ( size_t i = 0; i < nSize; i += nArrSize ) {
+ for ( size_t k = 0; k < nArrSize; ++k )
+ el[k] = i + k;
+
+ if ( i + nArrSize <= nSize ) {
+ ASSERT_TRUE( q.push( el, nArrSize, func_push ) );
+ }
+ else {
+ ASSERT_FALSE( q.push( el, nArrSize, func_push ) );
+ }
}
- else {
- ASSERT_FALSE( q.push( el, nArrSize, func_push ) );
- }
- }
- ASSERT_TRUE( !q.empty() );
- if ( nSize % nArrSize != 0 ) {
- ASSERT_FALSE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
- for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
- ASSERT_TRUE( q.push( &i, 1, func_push ) );
+ ASSERT_TRUE( !q.empty() );
+ if ( nSize % nArrSize != 0 ) {
+ ASSERT_FALSE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
+ for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
+ ASSERT_TRUE( q.push( &i, 1, func_push ) );
+ }
}
- }
- ASSERT_TRUE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nSize );
-
- // batch pop with functor
- auto func_pop = []( size_t& dest, value_type src ) { dest = static_cast<size_t>( src / 10 ); };
- size_t expected = 0;
- while ( q.pop( el, nArrSize, func_pop ) ) {
- for ( size_t i = 0; i < nArrSize; ++i ) {
- ASSERT_EQ( el[i], expected );
- ++expected;
+ ASSERT_TRUE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nSize );
+
+ // batch pop with functor
+ auto func_pop = []( size_t& dest, value_type src ) { dest = static_cast<size_t>( src / 10 ); };
+ size_t expected = 0;
+ while ( q.pop( el, nArrSize, func_pop ) ) {
+ for ( size_t i = 0; i < nArrSize; ++i ) {
+ ASSERT_EQ( el[i], expected );
+ ++expected;
+ }
}
- }
- if ( nSize % nArrSize == 0 ) {
- ASSERT_TRUE( q.empty() );
- }
- else {
- ASSERT_FALSE( q.empty() );
- ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
- size_t v;
- while ( q.pop( &v, 1, func_pop ) ) {
- ASSERT_EQ( v, expected );
- ++expected;
+ if ( nSize % nArrSize == 0 ) {
+ ASSERT_TRUE( q.empty() );
}
+ else {
+ ASSERT_FALSE( q.empty() );
+ ASSERT_CONTAINER_SIZE( q, nSize % nArrSize );
+ size_t v;
+ while ( q.pop( &v, 1, func_pop ) ) {
+ ASSERT_EQ( v, expected );
+ ++expected;
+ }
+ }
+ ASSERT_TRUE( q.empty() );
+ ASSERT_FALSE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, 0u );
}
- ASSERT_TRUE( q.empty() );
- ASSERT_FALSE( q.full() );
- ASSERT_CONTAINER_SIZE( q, 0u );
// front/pop_front
- for ( size_t i = 0; i < nSize; i += nArrSize ) {
- for ( size_t k = 0; k < nArrSize; ++k )
- el[k] = i + k;
+ for ( unsigned pass = 0; pass < 3; ++pass ) {
+ for ( size_t i = 0; i < nSize; i += nArrSize ) {
+ for ( size_t k = 0; k < nArrSize; ++k )
+ el[k] = i + k;
+
+ if ( i + nArrSize <= nSize ) {
+ ASSERT_TRUE( q.push( el, nArrSize, func_push ) );
+ }
+ else {
+ ASSERT_FALSE( q.push( el, nArrSize, func_push ) );
+ }
+ }
- if ( i + nArrSize <= nSize ) {
- ASSERT_TRUE( q.push( el, nArrSize, func_push ) );
+ ASSERT_TRUE( !q.empty() );
+ if ( nSize % nArrSize != 0 ) {
+ ASSERT_FALSE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
+ for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
+ ASSERT_TRUE( q.push( &i, 1, func_push ) );
+ }
}
- else {
- ASSERT_FALSE( q.push( el, nArrSize, func_push ) );
+ ASSERT_TRUE( q.full() );
+ ASSERT_CONTAINER_SIZE( q, nSize );
+
+ value_type cur = 0;
+ while ( !q.empty() ) {
+ value_type* front = q.front();
+ ASSERT_TRUE( front != nullptr );
+ ASSERT_EQ( cur, *front );
+ ASSERT_TRUE( q.pop_front() );
+ cur += 10;
}
- }
- ASSERT_TRUE( !q.empty() );
- if ( nSize % nArrSize != 0 ) {
- ASSERT_FALSE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nArrCount * nArrSize );
- for ( size_t i = nArrCount * nArrSize; i < nSize; ++i ) {
- ASSERT_TRUE( q.push( &i, 1, func_push ) );
- }
- }
- ASSERT_TRUE( q.full() );
- ASSERT_CONTAINER_SIZE( q, nSize );
-
- value_type cur = 0;
- while ( !q.empty() ) {
- value_type* front = q.front();
- ASSERT_TRUE( front != nullptr );
- ASSERT_EQ( cur, *front );
- ASSERT_TRUE( q.pop_front() );
- cur += 10;
+ ASSERT_TRUE( q.empty() );
+ ASSERT_TRUE( q.front() == nullptr );
+ ASSERT_FALSE( q.pop_front() );
}
+ }
+ }
+
+ template <typename Queue>
+ void test_varsize_buffer( Queue& q )
+ {
+ size_t const capacity = q.capacity();
+
+ ASSERT_TRUE( q.empty() );
+ ASSERT_EQ( q.size(), 0u );
+ ASSERT_TRUE( q.front().first == nullptr );
+ ASSERT_FALSE( q.pop_front() );
+
+ size_t total_push = 0;
+ uint8_t chfill = 0;
+ while ( total_push < capacity * 4 ) {
+ unsigned buf_size = cds_test::fixture::rand( static_cast<unsigned>( capacity / 4 )) + 1;
+ total_push += buf_size;
+
+ void* buf = q.back( buf_size );
+ ASSERT_TRUE( buf != nullptr );
+
+ memset( buf, chfill, buf_size );
+ q.push_back();
+
+ ASSERT_GE( q.size(), buf_size );
+
+ auto pair = q.front();
+ ASSERT_TRUE( pair.first != nullptr );
+ ASSERT_EQ( pair.second, buf_size );
+ for ( size_t i = 0; i < pair.second; ++i )
+ ASSERT_EQ( *reinterpret_cast<uint8_t*>( pair.first ), chfill );
- ASSERT_TRUE( q.empty() );
- ASSERT_TRUE( q.front() == nullptr );
+ ASSERT_TRUE( q.pop_front() );
ASSERT_FALSE( q.pop_front() );
}
+
+ ASSERT_TRUE( q.empty() );
+ ASSERT_EQ( q.size(), 0u );
+ ASSERT_TRUE( q.front().first == nullptr );
+ ASSERT_FALSE( q.pop_front() );
}
};
test_array( q );
}
+ TEST_F( WeakRingBuffer, var_sized )
+ {
+ typedef cds::container::WeakRingBuffer< void > test_queue;
+
+ test_queue q( 1024 * 64 );
+ test_varsize_buffer( q );
+ }
+
+ TEST_F( WeakRingBuffer, var_sized_static )
+ {
+ struct traits: public cds::container::weak_ringbuffer::traits
+ {
+ typedef cds::opt::v::uninitialized_static_buffer<int, 1024 * 64> buffer;
+ };
+ typedef cds::container::WeakRingBuffer< void, traits > test_queue;
+
+ test_queue q;
+ test_varsize_buffer( q );
+ }
+
} // namespace
\ No newline at end of file
projects / libcds.git / blobdiff