1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
|
// Copyright (c) 2006-2018 Maxim Khizhinsky
//
// Distributed under the Boost Software License, Version 1.0. (See accompanying
// file LICENSE or copy at http://www.boost.org/LICENSE_1_0.txt)
#include "test_list_hp.h"
#include <cds/container/michael_list_dhp.h>
namespace {
namespace cc = cds::container;
typedef cds::gc::DHP gc_type;
class MichaelList_DHP : public cds_test::list_hp
{
protected:
void SetUp()
{
typedef cc::MichaelList< gc_type, item > list_type;
cds::gc::dhp::GarbageCollector::Construct( list_type::c_nHazardPtrCount );
cds::threading::Manager::attachThread();
}
void TearDown()
{
cds::threading::Manager::detachThread();
cds::gc::dhp::GarbageCollector::Destruct();
}
};
TEST_F( MichaelList_DHP, less_ordered )
{
typedef cc::MichaelList< gc_type, item,
typename cc::michael_list::make_traits<
cds::opt::less< lt<item> >
>::type
> list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, compare_ordered )
{
typedef cc::MichaelList< gc_type, item,
typename cc::michael_list::make_traits<
cds::opt::compare< cmp<item> >
>::type
> list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, mix_ordered )
{
typedef cc::MichaelList< gc_type, item,
typename cc::michael_list::make_traits<
cds::opt::compare< cmp<item> >
,cds::opt::less< lt<item> >
>::type
> list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, item_counting )
{
struct traits : public cc::michael_list::traits
{
typedef lt<item> less;
typedef cds::atomicity::item_counter item_counter;
};
typedef cc::MichaelList<gc_type, item, traits > list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, backoff )
{
struct traits : public cc::michael_list::traits
{
typedef lt<item> less;
typedef cds::atomicity::item_counter item_counter;
typedef cds::backoff::empty back_off;
};
typedef cc::MichaelList<gc_type, item, traits > list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, seq_cst )
{
struct traits : public cc::michael_list::traits
{
typedef lt<item> less;
typedef cds::atomicity::item_counter item_counter;
typedef cds::opt::v::sequential_consistent memory_model;
};
typedef cc::MichaelList<gc_type, item, traits > list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, stat )
{
struct traits: public cc::michael_list::traits
{
typedef lt<item> less;
typedef cds::atomicity::item_counter item_counter;
typedef cds::container::michael_list::stat<> stat;
};
typedef cc::MichaelList<gc_type, item, traits > list_type;
list_type l;
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
TEST_F( MichaelList_DHP, wrapped_stat )
{
struct traits: public cc::michael_list::traits
{
typedef lt<item> less;
typedef cds::atomicity::item_counter item_counter;
typedef cds::container::michael_list::wrapped_stat<> stat;
};
typedef cc::MichaelList<gc_type, item, traits > list_type;
cds::container::michael_list::stat<> st;
list_type l( st );
test_common( l );
test_ordered_iterator( l );
test_hp( l );
}
} // namespace
|
