</ClCompile>\r
<ClCompile Include="..\..\..\test\unit\map\michael_michael_rcu_shb.cpp" />\r
<ClCompile Include="..\..\..\test\unit\map\michael_michael_rcu_sht.cpp" />\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_dhp.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_hp.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_nogc.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpb.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpi.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpt.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_shb.cpp" />\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_sht.cpp" />\r
<ClCompile Include="..\..\..\test\unit\map\split_michael_dhp.cpp">\r
<DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
<DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
<DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
<DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
</ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpb.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpi.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpt.cpp">\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|Win32'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Debug|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='DebugVLD|x64'">4503</DisableSpecificWarnings>\r
+ <DisableSpecificWarnings Condition="'$(Configuration)|$(Platform)'=='Release|x64'">4503</DisableSpecificWarnings>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_shb.cpp" />\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_sht.cpp" />\r
</ItemGroup>\r
<ItemGroup>\r
<ClInclude Include="..\..\..\test\unit\map\test_map.h" />\r
<ClInclude Include="..\..\..\test\unit\map\test_map_rcu.h" />\r
<ClInclude Include="..\..\..\test\unit\map\test_michael_lazy_rcu.h" />\r
<ClInclude Include="..\..\..\test\unit\map\test_michael_michael_rcu.h" />\r
+ <ClInclude Include="..\..\..\test\unit\map\test_split_lazy_rcu.h" />\r
+ <ClInclude Include="..\..\..\test\unit\map\test_split_michael_rcu.h" />\r
</ItemGroup>\r
<PropertyGroup Label="Globals">\r
<ProjectGuid>{42B7E892-DDDA-4D00-9AB7-378E0E7E9433}</ProjectGuid>\r
<ClCompile Include="..\..\..\test\unit\map\split_michael_nogc.cpp">\r
<Filter>Source Files\SplitListMap</Filter>\r
</ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpb.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpi.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_gpt.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_shb.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_michael_rcu_sht.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_hp.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_dhp.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_nogc.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpb.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpi.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_gpt.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_shb.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
+ <ClCompile Include="..\..\..\test\unit\map\split_lazy_rcu_sht.cpp">\r
+ <Filter>Source Files\SplitListMap</Filter>\r
+ </ClCompile>\r
</ItemGroup>\r
<ItemGroup>\r
<ClInclude Include="..\..\..\test\unit\map\test_map.h">\r
<ClInclude Include="..\..\..\test\unit\map\test_map_nogc.h">\r
<Filter>Header Files</Filter>\r
</ClInclude>\r
+ <ClInclude Include="..\..\..\test\unit\map\test_split_michael_rcu.h">\r
+ <Filter>Header Files</Filter>\r
+ </ClInclude>\r
+ <ClInclude Include="..\..\..\test\unit\map\test_split_lazy_rcu.h">\r
+ <Filter>Header Files</Filter>\r
+ </ClInclude>\r
</ItemGroup>\r
</Project>
\ No newline at end of file
michael_michael_rcu_gpt.cpp
michael_michael_rcu_shb.cpp
michael_michael_rcu_sht.cpp
+ split_lazy_hp.cpp
+ split_lazy_dhp.cpp
+ split_lazy_nogc.cpp
+ split_lazy_rcu_gpb.cpp
+ split_lazy_rcu_gpi.cpp
+ split_lazy_rcu_gpt.cpp
+ split_lazy_rcu_shb.cpp
+ split_lazy_rcu_sht.cpp
split_michael_hp.cpp
split_michael_dhp.cpp
split_michael_nogc.cpp
+ split_michael_rcu_gpb.cpp
+ split_michael_rcu_gpi.cpp
+ split_michael_rcu_gpt.cpp
+ split_michael_rcu_shb.cpp
+ split_michael_rcu_sht.cpp
)
include_directories(
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include "test_map_hp.h"
+
+#include <cds/container/lazy_list_dhp.h>
+#include <cds/container/split_list_map.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::DHP gc_type;
+
+ class SplitListLazyMap_DHP : public cds_test::container_map_hp
+ {
+ protected:
+ typedef cds_test::container_map_hp base_class;
+
+ void SetUp()
+ {
+ struct map_traits: public cc::split_list::traits {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ cds::gc::dhp::GarbageCollector::Construct( 16, map_type::c_nHazardPtrCount );
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ cds::gc::dhp::GarbageCollector::Destruct();
+ }
+ };
+
+ TEST_F( SplitListLazyMap_DHP, compare )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, less )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 1 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, cmpmix )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ , cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, item_counting )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, stat )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, back_off )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 3 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_DHP, mutex )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ typedef std::mutex lock_type;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+
+ TEST_F( SplitListLazyMap_DHP, static_bucket_table )
+ {
+ struct map_traits: public set_static_traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+} // namespace
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include "test_map_hp.h"
+
+#include <cds/container/lazy_list_hp.h>
+#include <cds/container/split_list_map.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::HP gc_type;
+
+ class SplitListLazyMap_HP : public cds_test::container_map_hp
+ {
+ protected:
+ typedef cds_test::container_map_hp base_class;
+
+ void SetUp()
+ {
+ struct map_traits: public cc::split_list::traits {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ // +1 - for guarded_ptr
+ cds::gc::hp::GarbageCollector::Construct( map_type::c_nHazardPtrCount + 1, 1, 16 );
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ cds::gc::hp::GarbageCollector::Destruct( true );
+ }
+ };
+
+ TEST_F( SplitListLazyMap_HP, compare )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, less )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, cmpmix )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ , cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 3 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, item_counting )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, stat )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, back_off )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_HP, mutex )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ typedef std::mutex lock_type;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+
+ TEST_F( SplitListLazyMap_HP, static_bucket_table )
+ {
+ struct map_traits: public set_static_traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+} // namespace
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include "test_map_nogc.h"
+
+#include <cds/container/lazy_list_nogc.h>
+#include <cds/container/split_list_map_nogc.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::nogc gc_type;
+
+ class SplitListLazyMap_NoGC : public cds_test::container_map_nogc
+ {
+ protected:
+ typedef cds_test::container_map_nogc base_class;
+
+ //void SetUp()
+ //{}
+
+ //void TearDown()
+ //{}
+ };
+
+ TEST_F( SplitListLazyMap_NoGC, compare )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, less )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, cmpmix )
+ {
+ typedef cc::SplitListMap< gc_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< less >
+ , cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( kSize, 1 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, item_counting )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 3 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, stat )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, back_off )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 2 );
+ test( m );
+ }
+
+ TEST_F( SplitListLazyMap_NoGC, mutex )
+ {
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ typedef std::mutex lock_type;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 3 );
+ test( m );
+ }
+
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+
+ TEST_F( SplitListLazyMap_NoGC, static_bucket_table )
+ {
+ struct map_traits: public set_static_traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< gc_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( kSize, 4 );
+ test( m );
+ }
+
+
+} // namespace
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_buffered.h>
+
+#include "test_split_lazy_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_buffered<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPB, SplitListLazyMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_instant.h>
+
+#include "test_split_lazy_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_instant<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPI, SplitListLazyMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_threaded.h>
+
+#include "test_split_lazy_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_threaded<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPT, SplitListLazyMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/signal_buffered.h>
+
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+
+#include "test_split_lazy_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::signal_buffered<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHB, SplitListLazyMap, rcu_implementation );
+
+#endif // CDS_URCU_SIGNAL_HANDLING_ENABLED
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/signal_threaded.h>
+
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+
+#include "test_split_lazy_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::signal_threaded<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHT, SplitListLazyMap, rcu_implementation );
+
+#endif // CDS_URCU_SIGNAL_HANDLING_ENABLED
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_buffered.h>
+
+#include "test_split_michael_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_buffered<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPB, SplitListMichaelMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_instant.h>
+
+#include "test_split_michael_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_instant<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPI, SplitListMichaelMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/general_threaded.h>
+
+#include "test_split_michael_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::general_threaded<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_GPT, SplitListMichaelMap, rcu_implementation );
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/signal_buffered.h>
+
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+
+#include "test_split_michael_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::signal_buffered<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHB, SplitListMichaelMap, rcu_implementation );
+
+#endif // CDS_URCU_SIGNAL_HANDLING_ENABLED
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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.
+*/
+
+#include <cds/urcu/signal_threaded.h>
+
+#ifdef CDS_URCU_SIGNAL_HANDLING_ENABLED
+
+#include "test_split_michael_rcu.h"
+
+namespace {
+
+ typedef cds::urcu::signal_threaded<> rcu_implementation;
+
+} // namespace
+
+INSTANTIATE_TYPED_TEST_CASE_P( RCU_SHT, SplitListMichaelMap, rcu_implementation );
+
+#endif // CDS_URCU_SIGNAL_HANDLING_ENABLED
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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_MAP_TEST_SPLIT_LIST_LAZY_RCU_H
+#define CDSUNIT_MAP_TEST_SPLIT_LIST_LAZY_RCU_H
+
+#include "test_map_rcu.h"
+#include <cds/container/lazy_list_rcu.h>
+#include <cds/container/split_list_map_rcu.h>
+
+namespace cc = cds::container;
+
+template <class RCU>
+class SplitListLazyMap: public cds_test::container_map_rcu
+{
+ typedef cds_test::container_map_rcu base_class;
+public:
+ typedef cds::urcu::gc<RCU> rcu_type;
+
+protected:
+ void SetUp()
+ {
+ RCU::Construct();
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ RCU::Destruct();
+ }
+};
+
+TYPED_TEST_CASE_P( SplitListLazyMap );
+
+//TYPED_TEST_P( SplitListLazyMap, compare )
+TYPED_TEST_P( SplitListLazyMap, compare )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::compare< typename TestFixture::cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, less )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< typename TestFixture::less >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 4 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, cmpmix )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::lazy_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::lazy_list::make_traits<
+ cds::opt::less< typename TestFixture::less >
+ , cds::opt::compare< typename TestFixture::cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, item_counting )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef typename TestFixture::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 1 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, stat )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef typename TestFixture::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 3 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, back_off )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListLazyMap, mutex )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef cds::backoff::pause back_off;
+ typedef std::mutex lock_type;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+namespace {
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+}
+
+TYPED_TEST_P( SplitListLazyMap, static_bucket_table )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public set_static_traits
+ {
+ typedef cc::lazy_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::lazy_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 4 );
+ this->test( m );
+}
+
+REGISTER_TYPED_TEST_CASE_P( SplitListLazyMap,
+ compare, less, cmpmix, item_counting, stat, back_off, mutex, static_bucket_table
+);
+
+
+#endif // CDSUNIT_MAP_TEST_SPLIT_LIST_LAZY_RCU_H
+
\ No newline at end of file
--- /dev/null
+/*
+ This file is a part of libcds - Concurrent Data Structures library
+
+ (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+
+ 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_MAP_TEST_SPLIT_LIST_MICHAEL_RCU_H
+#define CDSUNIT_MAP_TEST_SPLIT_LIST_MICHAEL_RCU_H
+
+#include "test_map_rcu.h"
+#include <cds/container/michael_list_rcu.h>
+#include <cds/container/split_list_map_rcu.h>
+
+namespace cc = cds::container;
+
+template <class RCU>
+class SplitListMichaelMap: public cds_test::container_map_rcu
+{
+ typedef cds_test::container_map_rcu base_class;
+public:
+ typedef cds::urcu::gc<RCU> rcu_type;
+
+protected:
+ void SetUp()
+ {
+ RCU::Construct();
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ RCU::Destruct();
+ }
+};
+
+TYPED_TEST_CASE_P( SplitListMichaelMap );
+
+TYPED_TEST_P( SplitListMichaelMap, compare )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< typename TestFixture::cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, less )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::less< typename TestFixture::less >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, cmpmix )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ typedef cc::SplitListMap< rcu_type, key_type, value_type,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash1 >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::less< typename TestFixture::less >
+ , cds::opt::compare< typename TestFixture::cmp >
+ >::type
+ >
+ >::type
+ > map_type;
+
+ map_type m( TestFixture::kSize, 3 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, item_counting )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef typename TestFixture::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 8 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, stat )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 4 );
+ this->test( m );
+}
+
+TYPED_TEST_P( SplitListMichaelMap, back_off )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::backoff::yield back_off;
+ typedef cds::opt::v::sequential_consistent memory_model;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 2 );
+ this->test( m );
+}
+
+namespace {
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+}
+
+TYPED_TEST_P( SplitListMichaelMap, static_bucket_table )
+{
+ typedef typename TestFixture::rcu_type rcu_type;
+ typedef typename TestFixture::key_type key_type;
+ typedef typename TestFixture::value_type value_type;
+ typedef typename TestFixture::hash1 hash1;
+
+ struct map_traits: public set_static_traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash1 hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef typename TestFixture::cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListMap< rcu_type, key_type, value_type, map_traits > map_type;
+
+ map_type m( TestFixture::kSize, 4 );
+ this->test( m );
+}
+
+REGISTER_TYPED_TEST_CASE_P( SplitListMichaelMap,
+ compare, less, cmpmix, item_counting, stat, back_off, static_bucket_table
+);
+
+
+#endif // CDSUNIT_MAP_TEST_SPLIT_LIST_MICHAEL_RCU_H
+
\ No newline at end of file
projects / libcds.git / commitdiff