--- /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.
+*/
+
+#include "test_set_hp.h"
+
+#include <cds/container/michael_list_hp.h>
+#include <cds/container/split_list_set.h>
+#include <cds/intrusive/free_list.h>
+
+namespace {
+ namespace cc = cds::container;
+ typedef cds::gc::HP gc_type;
+
+ class SplitListMichaelSet_HP : public cds_test::container_set_hp
+ {
+ protected:
+ typedef cds_test::container_set_hp base_class;
+
+ void SetUp()
+ {
+ struct set_traits: public cc::split_list::traits {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ // +1 - for guarded_ptr
+ cds::gc::hp::GarbageCollector::Construct( set_type::c_nHazardPtrCount + 1, 1, 16 );
+ cds::threading::Manager::attachThread();
+ }
+
+ void TearDown()
+ {
+ cds::threading::Manager::detachThread();
+ cds::gc::hp::GarbageCollector::Destruct( true );
+ }
+ };
+
+ TEST_F( SplitListMichaelSet_HP, compare )
+ {
+ typedef cc::SplitListSet< gc_type, int_item,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash_int >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, less )
+ {
+ typedef cc::SplitListSet< gc_type, int_item,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash_int >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::less< less >
+ >::type
+ >
+ >::type
+ > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, cmpmix )
+ {
+ typedef cc::SplitListSet< gc_type, int_item,
+ typename cc::split_list::make_traits<
+ cc::split_list::ordered_list< cc::michael_list_tag >
+ , cds::opt::hash< hash_int >
+ , cc::split_list::ordered_list_traits<
+ typename cc::michael_list::make_traits<
+ cds::opt::less< less >
+ , cds::opt::compare< cmp >
+ >::type
+ >
+ >::type
+ > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, item_counting )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 4 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, stat )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cc::split_list::stat<> stat;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::opt::v::sequential_consistent memory_model;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, back_off )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int 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 cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 3 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, free_list )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::intrusive::FreeList free_list;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 3 );
+ test( s );
+ }
+
+ struct set_static_traits: public cc::split_list::traits
+ {
+ static bool const dynamic_bucket_table = false;
+ };
+
+ TEST_F( SplitListMichaelSet_HP, static_bucket_table )
+ {
+ struct set_traits: public set_static_traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 4 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, static_bucket_table_free_list )
+ {
+ struct set_traits: public set_static_traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::intrusive::FreeList free_list;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef cds::backoff::pause back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 4 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_swar )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::swar bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_lookup )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::lookup bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+ TEST_F( SplitListMichaelSet_HP, bit_reversal_muldiv )
+ {
+ struct set_traits: public cc::split_list::traits
+ {
+ typedef cc::michael_list_tag ordered_list;
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ typedef cds::algo::bit_reversal::muldiv bit_reversal;
+
+ struct ordered_list_traits: public cc::michael_list::traits
+ {
+ typedef cmp compare;
+ typedef base_class::less less;
+ typedef cds::backoff::empty back_off;
+ };
+ };
+ typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
+
+ set_type s( kSize, 2 );
+ test( s );
+ }
+
+} // namespace
+
projects / c11concurrency-benchmarks.git / blobdiff