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
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
|
// 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_michael_iterable_hp.h"
#include <cds/container/iterable_list_hp.h>
#include <cds/container/michael_set.h>
namespace {
namespace cc = cds::container;
typedef cds::gc::HP gc_type;
class MichaelIterableSet_HP : public cds_test::michael_iterable_set_hp
{
protected:
typedef cds_test::michael_iterable_set_hp base_class;
void SetUp()
{
typedef cc::IterableList< gc_type, int_item > list_type;
typedef cc::MichaelHashSet< gc_type, list_type > set_type;
// +3 - for guarded_ptr, iterators
cds::gc::hp::GarbageCollector::Construct( set_type::c_nHazardPtrCount + 3, 1, 16 );
cds::threading::Manager::attachThread();
}
void TearDown()
{
cds::threading::Manager::detachThread();
cds::gc::hp::GarbageCollector::Destruct( true );
}
};
TEST_F( MichaelIterableSet_HP, compare )
{
typedef cc::IterableList< gc_type, int_item,
typename cc::iterable_list::make_traits<
cds::opt::compare< cmp >
>::type
> list_type;
typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( MichaelIterableSet_HP, less )
{
typedef cc::IterableList< gc_type, int_item,
typename cc::iterable_list::make_traits<
cds::opt::less< base_class::less >
>::type
> list_type;
typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( MichaelIterableSet_HP, cmpmix )
{
struct list_traits : public cc::iterable_list::traits
{
typedef base_class::less less;
typedef cmp compare;
};
typedef cc::IterableList< gc_type, int_item, list_traits > list_type;
typedef cc::MichaelHashSet< gc_type, list_type,
typename cc::michael_set::make_traits<
cds::opt::hash< hash_int >
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( MichaelIterableSet_HP, item_counting )
{
struct list_traits : public cc::iterable_list::traits
{
typedef cmp compare;
};
typedef cc::IterableList< gc_type, int_item, list_traits > list_type;
struct set_traits: public cc::michael_set::traits
{
typedef hash_int hash;
typedef simple_item_counter item_counter;
};
typedef cc::MichaelHashSet< gc_type, list_type, set_traits > set_type;
set_type s( kSize, 3 );
test( s );
}
TEST_F( MichaelIterableSet_HP, backoff )
{
struct list_traits : public cc::iterable_list::traits
{
typedef cmp compare;
typedef cds::backoff::make_exponential_t<cds::backoff::pause, cds::backoff::yield> back_off;
};
typedef cc::IterableList< 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 );
}
TEST_F( MichaelIterableSet_HP, seq_cst )
{
struct list_traits : public cc::iterable_list::traits
{
typedef base_class::less less;
typedef cds::backoff::pause back_off;
typedef cds::opt::v::sequential_consistent memory_model;
};
typedef cc::IterableList< 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 );
}
TEST_F( MichaelIterableSet_HP, stat )
{
struct list_traits: public cc::iterable_list::traits
{
typedef base_class::less less;
typedef cds::backoff::pause back_off;
typedef cc::iterable_list::stat<> stat;
};
typedef cc::IterableList< 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( MichaelIterableSet_HP, wrapped_stat )
{
struct list_traits: public cc::iterable_list::traits
{
typedef base_class::less less;
typedef cds::backoff::pause back_off;
typedef cc::iterable_list::wrapped_stat<> stat;
};
typedef cc::IterableList< 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
|
