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 <cds/intrusive/tsigas_cycle_queue.h>
32 #include "test_intrusive_bounded_queue.h"
36 class IntrusiveTsigasQueue : public cds_test::intrusive_bounded_queue
40 void operator()( item * p )
47 static const size_t c_Capacity = 64;
48 static const size_t c_RealCapacity = c_Capacity - 2;
50 TEST_F( IntrusiveTsigasQueue, defaulted )
52 cds::intrusive::TsigasCycleQueue< item > q( c_Capacity );
53 ASSERT_EQ( q.capacity(), c_RealCapacity );
57 TEST_F( IntrusiveTsigasQueue, disposer )
59 struct traits : public cds::intrusive::tsigas_queue::traits
61 typedef IntrusiveTsigasQueue::disposer disposer;
62 typedef cds::atomicity::item_counter item_counter;
65 cds::intrusive::TsigasCycleQueue< item, traits > q( c_Capacity );
66 ASSERT_EQ( q.capacity(), c_RealCapacity );
70 TEST_F( IntrusiveTsigasQueue, static_buffer )
72 struct traits : public cds::intrusive::tsigas_queue::traits
74 typedef cds::opt::v::initialized_static_buffer< int, c_Capacity > buffer;
75 typedef IntrusiveTsigasQueue::disposer disposer;
78 cds::intrusive::TsigasCycleQueue< item, traits > q;
79 ASSERT_EQ( q.capacity(), c_RealCapacity );
83 TEST_F( IntrusiveTsigasQueue, dynamic_buffer )
85 typedef typename cds::intrusive::tsigas_queue::make_traits<
86 cds::opt::buffer< cds::opt::v::initialized_dynamic_buffer< int >>
87 ,cds::opt::item_counter< cds::atomicity::item_counter >
88 ,cds::opt::back_off< cds::backoff::pause >
89 ,cds::intrusive::opt::disposer< disposer >
92 cds::intrusive::TsigasCycleQueue< item, traits > q( c_Capacity );
93 ASSERT_EQ( q.capacity(), c_RealCapacity );
97 TEST_F( IntrusiveTsigasQueue, padding )
99 struct traits : public cds::intrusive::tsigas_queue::traits
101 typedef cds::opt::v::initialized_static_buffer< int, c_Capacity > buffer;
102 typedef IntrusiveTsigasQueue::disposer disposer;
103 enum { padding = 16 | cds::opt::padding_tiny_data_only };
106 cds::intrusive::TsigasCycleQueue< item, traits > q;
107 ASSERT_EQ( q.capacity(), c_RealCapacity );