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.
31 #include "test_list_hp.h"
32 #include <cds/container/michael_list_dhp.h>
35 namespace cc = cds::container;
36 typedef cds::gc::DHP gc_type;
38 class MichaelList_DHP : public cds_test::list_hp
43 typedef cc::MichaelList< gc_type, item > list_type;
45 cds::gc::dhp::GarbageCollector::Construct( 16, list_type::c_nHazardPtrCount );
46 cds::threading::Manager::attachThread();
51 cds::threading::Manager::detachThread();
52 cds::gc::hp::GarbageCollector::Destruct();
56 TEST_F( MichaelList_DHP, less_ordered )
58 typedef cc::MichaelList< gc_type, item,
59 typename cc::michael_list::make_traits<
60 cds::opt::less< lt<item> >
66 test_ordered_iterator( l );
70 TEST_F( MichaelList_DHP, compare_ordered )
72 typedef cc::MichaelList< gc_type, item,
73 typename cc::michael_list::make_traits<
74 cds::opt::compare< cmp<item> >
80 test_ordered_iterator( l );
84 TEST_F( MichaelList_DHP, mix_ordered )
86 typedef cc::MichaelList< gc_type, item,
87 typename cc::michael_list::make_traits<
88 cds::opt::compare< cmp<item> >
89 ,cds::opt::less< lt<item> >
95 test_ordered_iterator( l );
99 TEST_F( MichaelList_DHP, item_counting )
101 struct traits : public cc::michael_list::traits
103 typedef lt<item> less;
104 typedef cds::atomicity::item_counter item_counter;
106 typedef cc::MichaelList<gc_type, item, traits > list_type;
110 test_ordered_iterator( l );
114 TEST_F( MichaelList_DHP, backoff )
116 struct traits : public cc::michael_list::traits
118 typedef lt<item> less;
119 typedef cds::atomicity::item_counter item_counter;
120 typedef cds::backoff::empty back_off;
122 typedef cc::MichaelList<gc_type, item, traits > list_type;
126 test_ordered_iterator( l );
130 TEST_F( MichaelList_DHP, seq_cst )
132 struct traits : public cc::michael_list::traits
134 typedef lt<item> less;
135 typedef cds::atomicity::item_counter item_counter;
136 typedef cds::opt::v::sequential_consistent memory_model;
138 typedef cc::MichaelList<gc_type, item, traits > list_type;
142 test_ordered_iterator( l );