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 <cds_test/stress_test.h>
33 #include <cds/intrusive/free_list.h>
34 #include <cds/intrusive/free_list_cached.h>
35 #ifdef CDS_DCAS_SUPPORT
36 # include <cds/intrusive/free_list_tagged.h>
40 class put_get_single: public cds_test::stress_fixture
43 static size_t s_nThreadCount;
44 static size_t s_nPassCount;
46 template <typename FreeList >
47 struct value_type: public FreeList::node
49 atomics::atomic<size_t> counter;
56 template <class FreeList>
57 class Worker: public cds_test::thread
59 typedef cds_test::thread base_class;
62 size_t m_nSuccess = 0;
65 Worker( cds_test::thread_pool& pool, FreeList& s )
72 , m_FreeList( src.m_FreeList )
75 virtual thread * clone()
77 return new Worker( *this );
82 typedef value_type<FreeList> item_type;
84 for ( size_t pass = 0; pass < s_nPassCount; ++pass ) {
86 while ( (p = static_cast<item_type*>( m_FreeList.get())) == nullptr );
87 p->counter.fetch_add( 1, atomics::memory_order_relaxed );
94 static void SetUpTestCase()
96 cds_test::config const& cfg = get_config( "free_list" );
98 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
99 s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount );
101 if ( s_nThreadCount == 0 )
103 if ( s_nPassCount == 0 )
106 //static void TearDownTestCase();
110 template <typename FreeList>
111 void test( FreeList& list )
113 cds_test::thread_pool& pool = get_pool();
115 value_type<FreeList> item;;
118 pool.add( new Worker<FreeList>( pool, list ), s_nThreadCount );
120 propout() << std::make_pair( "work_thread", s_nThreadCount )
121 << std::make_pair( "pass_count", s_nPassCount );
123 std::chrono::milliseconds duration = pool.run();
125 propout() << std::make_pair( "duration", duration );
128 EXPECT_EQ( item.counter.load( atomics::memory_order_relaxed ), s_nPassCount * s_nThreadCount );
130 list.clear( []( typename FreeList::node* ) {} );
134 size_t put_get_single::s_nThreadCount = 4;
135 size_t put_get_single::s_nPassCount = 100000;
137 #define CDSSTRESS_FREELIST_F( name, freelist_type ) \
138 TEST_F( put_get_single, name ) \
144 CDSSTRESS_FREELIST_F( FreeList, cds::intrusive::FreeList )
146 typedef cds::intrusive::CachedFreeList<cds::intrusive::FreeList> cached_free_list;
147 CDSSTRESS_FREELIST_F( CachedFreeList, cached_free_list )
149 #ifdef CDS_DCAS_SUPPORT
150 TEST_F( put_get_single, TaggetFreeList )
157 atomics::atomic<tagged_ptr> tp;
158 if ( tp.is_lock_free()) {
159 cds::intrusive::TaggedFreeList fl;
163 std::cout << "Double-width CAS is not supported\n";