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
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
|
// 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_set_hp.h"
#include <cds/container/michael_list_hp.h>
#include <cds/container/split_list_set.h>
#include <cds/intrusive/free_list.h>
namespace {
namespace cc = cds::container;
typedef cds::gc::HP gc_type;
class SplitListMichaelSet_HP : public cds_test::container_set_hp
{
protected:
typedef cds_test::container_set_hp base_class;
void SetUp()
{
struct set_traits: public cc::split_list::traits {
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
// +1 - for guarded_ptr
cds::gc::hp::GarbageCollector::Construct( set_type::c_nHazardPtrCount + 1, 1, 16 );
cds::threading::Manager::attachThread();
}
void TearDown()
{
cds::threading::Manager::detachThread();
cds::gc::hp::GarbageCollector::Destruct( true );
}
};
TEST_F( SplitListMichaelSet_HP, compare )
{
typedef cc::SplitListSet< gc_type, int_item,
typename cc::split_list::make_traits<
cc::split_list::ordered_list< cc::michael_list_tag >
, cds::opt::hash< hash_int >
, cc::split_list::ordered_list_traits<
typename cc::michael_list::make_traits<
cds::opt::compare< cmp >
>::type
>
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, less )
{
typedef cc::SplitListSet< gc_type, int_item,
typename cc::split_list::make_traits<
cc::split_list::ordered_list< cc::michael_list_tag >
, cds::opt::hash< hash_int >
, cc::split_list::ordered_list_traits<
typename cc::michael_list::make_traits<
cds::opt::less< less >
>::type
>
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, cmpmix )
{
typedef cc::SplitListSet< gc_type, int_item,
typename cc::split_list::make_traits<
cc::split_list::ordered_list< cc::michael_list_tag >
, cds::opt::hash< hash_int >
, cc::split_list::ordered_list_traits<
typename cc::michael_list::make_traits<
cds::opt::less< less >
, cds::opt::compare< cmp >
>::type
>
>::type
> set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, item_counting )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef base_class::less less;
typedef cds::backoff::empty back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 4 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, stat )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cc::split_list::stat<> stat;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef base_class::less less;
typedef cds::opt::v::sequential_consistent memory_model;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, back_off )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::backoff::yield back_off;
typedef cds::opt::v::sequential_consistent memory_model;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef cds::backoff::pause back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 3 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, free_list )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::intrusive::FreeList free_list;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef cds::backoff::pause back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 3 );
test( s );
}
struct set_static_traits: public cc::split_list::traits
{
static bool const dynamic_bucket_table = false;
};
TEST_F( SplitListMichaelSet_HP, static_bucket_table )
{
struct set_traits: public set_static_traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef cds::backoff::pause back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 4 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, static_bucket_table_free_list )
{
struct set_traits: public set_static_traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::intrusive::FreeList free_list;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef cds::backoff::pause back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 4 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, bit_reversal_swar )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::algo::bit_reversal::swar bit_reversal;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef base_class::less less;
typedef cds::backoff::empty back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, bit_reversal_lookup )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::algo::bit_reversal::lookup bit_reversal;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef base_class::less less;
typedef cds::backoff::empty back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 2 );
test( s );
}
TEST_F( SplitListMichaelSet_HP, bit_reversal_muldiv )
{
struct set_traits: public cc::split_list::traits
{
typedef cc::michael_list_tag ordered_list;
typedef hash_int hash;
typedef cds::atomicity::item_counter item_counter;
typedef cds::algo::bit_reversal::muldiv bit_reversal;
struct ordered_list_traits: public cc::michael_list::traits
{
typedef cmp compare;
typedef base_class::less less;
typedef cds::backoff::empty back_off;
};
};
typedef cc::SplitListSet< gc_type, int_item, set_traits > set_type;
set_type s( kSize, 2 );
test( s );
}
} // namespace
|
