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_test/stress_test.h>
33 #include <cds/intrusive/free_list.h>
34 #include <cds/intrusive/free_list_cached.h>
35 #include <cds/intrusive/free_list_tagged.h>
38 class put_get: public cds_test::stress_fixture
41 static size_t s_nThreadCount;
42 static size_t s_nPassCount;
43 static size_t const c_nArraySize = 100;
45 template <typename FreeList >
46 struct value_type: public FreeList::node
55 template <class FreeList>
56 class Worker: public cds_test::thread
58 typedef cds_test::thread base_class;
61 size_t m_nSuccess = 0;
64 Worker( cds_test::thread_pool& pool, FreeList& s )
71 , m_FreeList( src.m_FreeList )
74 virtual thread * clone()
76 return new Worker( *this );
81 typedef value_type<FreeList> item_type;
82 item_type* arr[ c_nArraySize ];
84 for ( size_t pass = 0; pass < s_nPassCount; ++pass ) {
88 while ( (p = static_cast<item_type*>( m_FreeList.get())) != nullptr ) {
95 for ( size_t i = 0; i < n; ++i )
96 m_FreeList.put( arr[i] );
102 static void SetUpTestCase()
104 cds_test::config const& cfg = get_config( "free_list" );
106 s_nThreadCount = cfg.get_size_t( "ThreadCount", s_nThreadCount );
107 s_nPassCount = cfg.get_size_t( "PassCount", s_nPassCount );
109 if ( s_nThreadCount == 0 )
111 if ( s_nPassCount == 0 )
114 //static void TearDownTestCase();
118 template <typename FreeList>
119 void test( FreeList& list )
121 cds_test::thread_pool& pool = get_pool();
123 value_type<FreeList> arr[c_nArraySize];
125 for ( auto& i : arr )
128 pool.add( new Worker<FreeList>( pool, list ), s_nThreadCount );
130 propout() << std::make_pair( "work_thread", s_nThreadCount )
131 << std::make_pair( "pass_count", s_nPassCount );
133 std::chrono::milliseconds duration = pool.run();
135 propout() << std::make_pair( "duration", duration );
139 for ( auto const& i : arr )
143 for ( size_t threadNo = 0; threadNo < pool.size(); ++threadNo )
144 nSuccess += static_cast<Worker<FreeList>&>( pool.get( threadNo )).m_nSuccess;
146 EXPECT_EQ( nSuccess, nTotal );
148 list.clear( []( typename FreeList::node* ) {} );
152 size_t put_get::s_nThreadCount = 4;
153 size_t put_get::s_nPassCount = 100000;
155 #define CDSSTRESS_FREELIST_F( name, freelist_type ) \
156 TEST_F( put_get, name ) \
162 CDSSTRESS_FREELIST_F( FreeList, cds::intrusive::FreeList )
164 typedef cds::intrusive::CachedFreeList<cds::intrusive::FreeList> cached_free_list;
165 CDSSTRESS_FREELIST_F( CachedFreeList, cached_free_list )
167 #ifdef CDS_DCAS_SUPPORT
168 TEST_F( put_get, TaggetFreeList )
175 atomics::atomic<tagged_ptr> tp;
176 if ( tp.is_lock_free() ) {
177 cds::intrusive::TaggedFreeList fl;
181 std::cout << "Double-width CAS is not supported\n";