--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
+
+ Source code repo: http://github.com/khizmax/libcds/
+ Download: http://sourceforge.net/projects/libcds/files/
+
+ Redistribution and use in source and binary forms, with or without
+ modification, are permitted provided that the following conditions are met:
+
+ * Redistributions of source code must retain the above copyright notice, this
+ list of conditions and the following disclaimer.
+
+ * Redistributions in binary form must reproduce the above copyright notice,
+ this list of conditions and the following disclaimer in the documentation
+ and/or other materials provided with the distribution.
+
+ THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+ AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+ DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+ FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+ CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+ OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+*/
+
+#ifndef CDSUNIT_TREE_TEST_TREE_MAP_RCU_H
+#define CDSUNIT_TREE_TEST_TREE_MAP_RCU_H
+
+#include "test_tree_map.h"
+
+namespace cds_test {
+
+ class container_tree_map_rcu: public container_tree_map
+ {
+ typedef container_tree_map base_class;
+
+ protected:
+ template <class Map>
+ void test( Map& m )
+ {
+ // Precondition: map is empty
+ // Postcondition: map is empty
+
+ base_class::test( m );
+
+ ASSERT_TRUE( m.empty());
+ ASSERT_CONTAINER_SIZE( m, 0 );
+
+ size_t const kkSize = base_class::kSize;
+
+ std::vector<key_type> arrKeys;
+ for ( int i = 0; i < static_cast<int>(kkSize); ++i )
+ arrKeys.push_back( key_type( i ));
+ shuffle( arrKeys.begin(), arrKeys.end());
+
+ std::vector< value_type > arrVals;
+ for ( size_t i = 0; i < kkSize; ++i ) {
+ value_type val;
+ val.nVal = static_cast<int>( i );
+ val.strVal = std::to_string( i );
+ arrVals.push_back( val );
+ }
+
+ for ( auto const& i : arrKeys )
+ ASSERT_TRUE( m.insert( i ));
+ ASSERT_FALSE( m.empty());
+ ASSERT_CONTAINER_SIZE( m, kkSize );
+
+ typedef typename Map::exempt_ptr exempt_ptr;
+ typedef typename Map::value_type * raw_ptr;
+ typedef typename Map::rcu_lock rcu_lock;
+
+ // get/extract
+ shuffle( arrKeys.begin(), arrKeys.end());
+
+ exempt_ptr xp;
+ for ( auto const& i : arrKeys ) {
+ value_type const& val = arrVals.at( i.nKey );
+
+ {
+ rcu_lock l;
+ raw_ptr rp;
+
+ rp = m.get( i.nKey );
+ ASSERT_FALSE( !rp );
+ EXPECT_EQ( rp->first.nKey, i.nKey );
+ rp->second.nVal = rp->first.nKey * 2;
+
+ rp = m.get( i );
+ ASSERT_FALSE( !rp );
+ EXPECT_EQ( rp->first.nKey, i.nKey );
+ EXPECT_EQ( rp->second.nVal, rp->first.nKey * 2 );
+ rp->second.nVal = rp->first.nKey * 3;
+
+ rp = m.get_with( other_item( i.nKey ), other_less());
+ ASSERT_FALSE( !rp );
+ EXPECT_EQ( rp->first.nKey, i.nKey );
+ EXPECT_EQ( rp->second.nVal, rp->first.nKey * 3 );
+ rp->second.nVal = rp->first.nKey;
+ }
+
+ if ( Map::c_bExtractLockExternal ) {
+ {
+ rcu_lock l;
+
+ switch ( i.nKey % 4 ) {
+ case 0:
+ xp = m.extract( i.nKey );
+ break;
+ case 1:
+ xp = m.extract( i );
+ break;
+ case 2:
+ xp = m.extract( val.strVal );
+ break;
+ case 3:
+ xp = m.extract_with( other_item( i.nKey ), other_less());
+ break;
+ }
+ ASSERT_FALSE( !xp );
+ EXPECT_EQ( xp->first.nKey, i.nKey );
+ EXPECT_EQ( xp->second.nVal, xp->first.nKey );
+ }
+ xp.release();
+
+ {
+ rcu_lock l;
+
+ switch ( i.nKey % 4 ) {
+ case 0:
+ xp = m.extract( i.nKey );
+ break;
+ case 1:
+ xp = m.extract( i );
+ break;
+ case 2:
+ xp = m.extract( val.strVal );
+ break;
+ case 3:
+ xp = m.extract_with( other_item( i.nKey ), other_less());
+ break;
+ }
+ EXPECT_TRUE( !xp );
+ }
+ }
+ else {
+ switch ( i.nKey % 4 ) {
+ case 0:
+ xp = m.extract( i.nKey );
+ break;
+ case 1:
+ xp = m.extract( i );
+ break;
+ case 2:
+ xp = m.extract( val.strVal );
+ break;
+ case 3:
+ xp = m.extract_with( other_item( i.nKey ), other_less());
+ break;
+ }
+ ASSERT_FALSE( !xp );
+ EXPECT_EQ( xp->first.nKey, i.nKey );
+ EXPECT_EQ( xp->second.nVal, xp->first.nKey );
+
+ switch ( i.nKey % 4 ) {
+ case 0:
+ xp = m.extract( i.nKey );
+ break;
+ case 1:
+ xp = m.extract( i );
+ break;
+ case 2:
+ xp = m.extract( val.strVal );
+ break;
+ case 3:
+ xp = m.extract_with( other_item( i.nKey ), other_less());
+ break;
+ }
+ EXPECT_TRUE( !xp );
+ }
+
+ {
+ rcu_lock l;
+ raw_ptr rp;
+
+ rp = m.get( i.nKey );
+ ASSERT_TRUE( !rp );
+ rp = m.get( i );
+ ASSERT_TRUE( !rp );
+ rp = m.get_with( other_item( i.nKey ), other_less());
+ ASSERT_TRUE( !rp );
+ }
+ }
+
+ ASSERT_TRUE( m.empty());
+ ASSERT_CONTAINER_SIZE( m, 0 );
+
+
+ // extract_min
+ for ( auto const& i : arrKeys )
+ ASSERT_TRUE( m.insert( i ));
+
+ size_t nCount = 0;
+ int nKey = -1;
+ while ( !m.empty()) {
+ xp = m.extract_min();
+ ASSERT_FALSE( !xp );
+ EXPECT_EQ( xp->first.nKey, nKey + 1 );
+ nKey = xp->first.nKey;
+ ++nCount;
+ }
+ xp = m.extract_min();
+ ASSERT_TRUE( !xp );
+ xp = m.extract_max();
+ ASSERT_TRUE( !xp );
+ EXPECT_EQ( kkSize, nCount );
+ ASSERT_TRUE( m.empty());
+ ASSERT_CONTAINER_SIZE( m, 0 );
+
+ // extract_max
+ xp = m.extract_min();
+ EXPECT_TRUE( !xp );
+ xp = m.extract_max();
+ EXPECT_TRUE( !xp );
+
+ for ( auto const& i : arrKeys )
+ ASSERT_TRUE( m.insert( i ));
+
+ nKey = kkSize;
+ nCount = 0;
+ while ( !m.empty()) {
+ xp = m.extract_max();
+ ASSERT_FALSE( !xp );
+ EXPECT_EQ( xp->first.nKey, nKey - 1 );
+ nKey = xp->first.nKey;
+ ++nCount;
+ }
+
+ xp = m.extract_min();
+ ASSERT_TRUE( !xp );
+ xp = m.extract_max();
+ ASSERT_TRUE( !xp );
+ EXPECT_EQ( kkSize, nCount );
+ ASSERT_TRUE( m.empty());
+ ASSERT_CONTAINER_SIZE( m, 0 );
+ }
+ };
+
+} // namespace cds_test
+
+#endif // #ifndef CDSUNIT_TREE_TEST_TREE_MAP_RCU_H
projects / c11concurrency-benchmarks.git / blobdiff