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.
30 #ifndef CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H
31 #define CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H
33 #include "test_intrusive_list.h"
37 class intrusive_list_rcu : public intrusive_list_common
40 template <typename List>
41 void test_rcu( List& l )
43 // Precondition: list is empty
44 // Postcondition: list is empty
46 static const size_t nSize = 20;
47 typedef typename List::value_type value_type;
48 value_type arr[ nSize ];
50 for ( size_t i = 0; i < nSize; ++i ) {
51 arr[i].nKey = static_cast<int>( i );
52 arr[i].nVal = arr[i].nKey * 10;
54 shuffle( arr, arr + nSize );
56 typedef typename List::exempt_ptr exempt_ptr;
57 typedef typename List::raw_ptr raw_ptr;
58 typedef typename List::rcu_lock rcu_lock;
60 ASSERT_TRUE( l.empty() );
61 ASSERT_CONTAINER_SIZE( l, 0 );
64 for ( auto& i : arr ) {
67 raw_ptr rp = l.get( i.nKey );
69 rp = l.get_with( other_item( i.nKey ), other_less());
73 EXPECT_TRUE( l.insert( i ));
77 raw_ptr rp = l.get( i.nKey );
79 EXPECT_EQ( rp->nKey, i.nKey );
80 EXPECT_EQ( rp->nVal, i.nVal );
84 raw_ptr rp = l.get_with( other_item( i.nKey ), other_less() );
86 EXPECT_EQ( rp->nKey, i.nKey );
87 EXPECT_EQ( rp->nVal, i.nVal );
94 if ( List::c_bExtractLockExternal ) {
95 for ( int i = 0; i < static_cast<int>(nSize); ++i ) {
102 gp = l.extract_with( other_item(i), other_less());
104 EXPECT_EQ( gp->nKey, i );
112 gp = l.extract_with( other_item( i ), other_less() );
118 for ( int i = 0; i < static_cast<int>(nSize); ++i ) {
122 gp = l.extract_with( other_item( i ), other_less() );
124 EXPECT_EQ( gp->nKey, i );
128 gp = l.extract_with( other_item( i ), other_less() );
133 ASSERT_TRUE( l.empty() );
134 ASSERT_CONTAINER_SIZE( l, 0 );
136 List::gc::force_dispose();
137 for ( auto const& i : arr ) {
138 EXPECT_EQ( i.s.nDisposeCount, 1 );
139 EXPECT_FALSE( l.contains( i ) );
144 } // namespace cds_test
146 #endif // CDSUNIT_LIST_TEST_INTRUSIVE_LIST_RCU_H