Merged branch 'master' of https://github.com/Nemo1369/libcds
[libcds.git] / test / unit / list / iterable_hp.cpp
1 /*
2     This file is a part of libcds - Concurrent Data Structures library
3
4     (C) Copyright Maxim Khizhinsky (libcds.dev@gmail.com) 2006-2017
5
6     Source code repo: http://github.com/khizmax/libcds/
7     Download: http://sourceforge.net/projects/libcds/files/
8
9     Redistribution and use in source and binary forms, with or without
10     modification, are permitted provided that the following conditions are met:
11
12     * Redistributions of source code must retain the above copyright notice, this
13       list of conditions and the following disclaimer.
14
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.
18
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.
29 */
30
31 #include "test_iterable_list_hp.h"
32 #include <cds/container/iterable_list_hp.h>
33
34 namespace {
35     namespace cc = cds::container;
36     typedef cds::gc::HP gc_type;
37
38     class IterableList_HP : public cds_test::iterable_list_hp
39     {
40     protected:
41         void SetUp()
42         {
43             typedef cc::IterableList< gc_type, item > list_type;
44
45             // +3 - for guarded_ptr, iterators
46             cds::gc::hp::GarbageCollector::Construct( list_type::c_nHazardPtrCount + 3, 1, 16 );
47             cds::threading::Manager::attachThread();
48         }
49
50         void TearDown()
51         {
52             cds::threading::Manager::detachThread();
53             cds::gc::hp::GarbageCollector::Destruct( true );
54         }
55     };
56
57     TEST_F( IterableList_HP, less_ordered )
58     {
59         typedef cc::IterableList< gc_type, item,
60             typename cc::iterable_list::make_traits<
61                 cds::opt::less< lt<item> >
62                 ,cds::opt::item_counter< cds::atomicity::item_counter >
63             >::type
64         > list_type;
65
66         list_type l;
67         test_common( l );
68         test_ordered_iterator( l );
69         test_hp( l );
70     }
71
72     TEST_F( IterableList_HP, compare_ordered )
73     {
74         typedef cc::IterableList< gc_type, item,
75             typename cc::iterable_list::make_traits<
76                 cds::opt::compare< cmp<item> >
77                 , cds::opt::item_counter< cds::atomicity::item_counter >
78             >::type
79         > list_type;
80
81         list_type l;
82         test_common( l );
83         test_ordered_iterator( l );
84         test_hp( l );
85     }
86
87     TEST_F( IterableList_HP, mix_ordered )
88     {
89         typedef cc::IterableList< gc_type, item,
90             typename cc::iterable_list::make_traits<
91                 cds::opt::compare< cmp<item> >
92                 ,cds::opt::less< lt<item> >
93                 , cds::opt::item_counter< cds::atomicity::item_counter >
94             >::type
95         > list_type;
96
97         list_type l;
98         test_common( l );
99         test_ordered_iterator( l );
100         test_hp( l );
101     }
102
103     TEST_F( IterableList_HP, backoff )
104     {
105         struct traits : public cc::iterable_list::traits
106         {
107             typedef lt<item> less;
108             typedef cds::atomicity::item_counter item_counter;
109             typedef cds::backoff::empty back_off;
110         };
111         typedef cc::IterableList<gc_type, item, traits > list_type;
112
113         list_type l;
114         test_common( l );
115         test_ordered_iterator( l );
116         test_hp( l );
117     }
118
119     TEST_F( IterableList_HP, seq_cst )
120     {
121         struct traits : public cc::iterable_list::traits
122         {
123             typedef lt<item> less;
124             typedef cds::atomicity::item_counter item_counter;
125             typedef cds::opt::v::sequential_consistent memory_model;
126         };
127         typedef cc::IterableList<gc_type, item, traits > list_type;
128
129         list_type l;
130         test_common( l );
131         test_ordered_iterator( l );
132         test_hp( l );
133     }
134
135     TEST_F( IterableList_HP, stat )
136     {
137         struct traits: public cc::iterable_list::traits
138         {
139             typedef lt<item> less;
140             typedef cds::atomicity::item_counter item_counter;
141             typedef cds::container::iterable_list::stat<> stat;
142
143         };
144         typedef cc::IterableList<gc_type, item, traits > list_type;
145
146         list_type l;
147         test_common( l );
148         test_ordered_iterator( l );
149         test_hp( l );
150     }
151
152     TEST_F( IterableList_HP, wrapped_stat )
153     {
154         struct traits: public cc::iterable_list::traits
155         {
156             typedef lt<item> less;
157             typedef cds::atomicity::item_counter item_counter;
158             typedef cds::container::iterable_list::wrapped_stat<> stat;
159
160         };
161         typedef cc::IterableList<gc_type, item, traits > list_type;
162
163         cds::container::iterable_list::stat<> st;
164         list_type l( st );
165         test_common( l );
166         test_ordered_iterator( l );
167         test_hp( l );
168     }
169
170 } // namespace