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
|
// 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_intrusive_msqueue.h"
#include <cds/gc/hp.h>
#include <cds/intrusive/optimistic_queue.h>
#include <vector>
namespace {
namespace ci = cds::intrusive;
typedef cds::gc::HP gc_type;
class IntrusiveOptQueue_HP : public cds_test::intrusive_msqueue
{
typedef cds_test::intrusive_msqueue base_class;
protected:
typedef typename base_class::base_hook_item< ci::optimistic_queue::node<gc_type>> base_item_type;
typedef typename base_class::member_hook_item< ci::optimistic_queue::node<gc_type>> member_item_type;
void SetUp()
{
typedef ci::OptimisticQueue< gc_type, base_item_type > queue_type;
cds::gc::hp::GarbageCollector::Construct( queue_type::c_nHazardPtrCount, 1, 16 );
cds::threading::Manager::attachThread();
}
void TearDown()
{
cds::threading::Manager::detachThread();
cds::gc::hp::GarbageCollector::Destruct( true );
}
template <typename V>
void check_array( V& arr )
{
for ( size_t i = 0; i < arr.size() - 1; ++i ) {
ASSERT_EQ( arr[i].nDisposeCount, 2 );
}
ASSERT_EQ( arr.back().nDisposeCount, 1 );
}
};
TEST_F( IntrusiveOptQueue_HP, defaulted )
{
typedef cds::intrusive::OptimisticQueue< gc_type, base_item_type,
typename ci::optimistic_queue::make_traits<
ci::opt::disposer< mock_disposer >
>::type
> test_queue;
std::vector<base_item_type> arr;
arr.resize(100);
{
test_queue q;
test(q, arr);
}
gc_type::scan();
check_array( arr );
}
TEST_F( IntrusiveOptQueue_HP, base_hook )
{
typedef cds::intrusive::OptimisticQueue< gc_type, base_item_type,
typename ci::optimistic_queue::make_traits<
ci::opt::disposer< mock_disposer >
,ci::opt::hook< ci::optimistic_queue::base_hook< ci::opt::gc<gc_type>>>
>::type
> test_queue;
std::vector<base_item_type> arr;
arr.resize(100);
{
test_queue q;
test(q, arr);
}
gc_type::scan();
check_array( arr );
}
TEST_F( IntrusiveOptQueue_HP, base_item_counting )
{
typedef cds::intrusive::OptimisticQueue< gc_type, base_item_type,
typename ci::optimistic_queue::make_traits<
ci::opt::disposer< mock_disposer >
, cds::opt::item_counter< cds::atomicity::item_counter >
, ci::opt::hook< ci::optimistic_queue::base_hook< ci::opt::gc<gc_type>>>
>::type
> test_queue;
std::vector<base_item_type> arr;
arr.resize(100);
{
test_queue q;
test(q, arr);
}
gc_type::scan();
check_array( arr );
}
TEST_F( IntrusiveOptQueue_HP, base_stat )
{
struct traits : public ci::optimistic_queue::traits
{
typedef mock_disposer disposer;
typedef cds::atomicity::item_counter item_counter;
typedef ci::optimistic_queue::stat<> stat;
typedef cds::opt::v::sequential_consistent memory_model;
};
typedef cds::intrusive::OptimisticQueue< gc_type, base_item_type, traits > test_queue;
std::vector<base_item_type> arr;
arr.resize(100);
{
test_queue q;
test(q, arr);
}
gc_type::scan();
check_array( arr );
}
TEST_F( IntrusiveOptQueue_HP, member_hook )
{
typedef cds::intrusive::OptimisticQueue< gc_type, member_item_type,
typename ci::optimistic_queue::make_traits<
ci::opt::disposer< mock_disposer >
,ci::opt::hook< ci::optimistic_queue::member_hook<
offsetof( member_item_type, hMember ),
ci::opt::gc<gc_type>
>>
>::type
> test_queue;
std::vector<member_item_type> arr;
arr.resize( 100 );
{
test_queue q;
test( q, arr );
}
gc_type::scan();
check_array( arr );
}
TEST_F( IntrusiveOptQueue_HP, member_hook_stat )
{
struct traits : public ci::optimistic_queue::traits
{
typedef ci::optimistic_queue::member_hook<
offsetof( member_item_type, hMember ),
ci::opt::gc<gc_type>
> hook;
typedef mock_disposer disposer;
typedef cds::atomicity::item_counter item_counter;
typedef ci::optimistic_queue::stat<> stat;
typedef cds::opt::v::sequential_consistent memory_model;
};
typedef cds::intrusive::OptimisticQueue< gc_type, member_item_type, traits > test_queue;
std::vector<member_item_type> arr;
arr.resize( 100 );
{
test_queue q;
test( q, arr );
}
gc_type::scan();
check_array( arr );
}
} // namespace
|
