/*
This file is a part of libcds - Concurrent Data Structures library
- (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2016
+ (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:
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.
+ OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "test_set_hp.h"
typedef cc::LazyList< gc_type, int_item > list_type;
typedef cc::MichaelHashSet< gc_type, list_type > set_type;
- cds::gc::dhp::GarbageCollector::Construct( 16, set_type::c_nHazardPtrCount );
+ cds::gc::dhp::smr::construct( set_type::c_nHazardPtrCount );
cds::threading::Manager::attachThread();
}
void TearDown()
{
cds::threading::Manager::detachThread();
- cds::gc::dhp::GarbageCollector::Destruct();
+ cds::gc::dhp::smr::destruct();
}
};
>::type
> list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
>::type
> list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
};
typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
- typedef cc::MichaelHashSet< gc_type, list_type,
+ typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
struct list_traits : public cc::lazy_list::traits
{
typedef cmp compare;
- typedef cds::backoff::exponential<cds::backoff::pause, cds::backoff::yield> back_off;
+ typedef cds::backoff::make_exponential_t<cds::backoff::pause, cds::backoff::yield> back_off;
};
typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
test( s );
}
+ TEST_F( MichaelLazySet_DHP, stat )
+ {
+ struct list_traits: public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::backoff::pause back_off;
+ typedef cc::lazy_list::stat<> stat;
+ };
+ typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
+
+ struct set_traits: public cc::michael_set::traits
+ {
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashSet< gc_type, list_type, set_traits >set_type;
+
+ set_type s( kSize, 4 );
+ test( s );
+ EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
+ }
+
+ TEST_F( MichaelLazySet_DHP, wrapped_stat )
+ {
+ struct list_traits: public cc::lazy_list::traits
+ {
+ typedef base_class::less less;
+ typedef cds::backoff::pause back_off;
+ typedef cc::lazy_list::wrapped_stat<> stat;
+ };
+ typedef cc::LazyList< gc_type, int_item, list_traits > list_type;
+
+ struct set_traits: public cc::michael_set::traits
+ {
+ typedef hash_int hash;
+ typedef cds::atomicity::item_counter item_counter;
+ };
+ typedef cc::MichaelHashSet< gc_type, list_type, set_traits >set_type;
+
+ set_type s( kSize, 4 );
+ test( s );
+ EXPECT_GE( s.statistics().m_nInsertSuccess, 0u );
+ }
+
} // namespace