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
|
// 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)
#ifndef CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H
#define CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H
#include <cds_test/check_size.h>
namespace cds_test {
class intrusive_segmented_queue : public ::testing::Test
{
protected:
struct item {
int nValue;
size_t nDisposeCount;
size_t nDispose2Count;
item()
: nValue( 0 )
, nDisposeCount( 0 )
, nDispose2Count( 0 )
{}
item( int nVal )
: nValue( nVal )
, nDisposeCount( 0 )
, nDispose2Count( 0 )
{}
};
struct big_item : public item
{
big_item()
{}
big_item( int nVal )
: item( nVal )
{}
int arr[80];
};
struct Disposer
{
void operator()( item * p )
{
++p->nDisposeCount;
}
};
struct Disposer2
{
void operator()( item * p )
{
++p->nDispose2Count;
}
};
template <typename Queue, typename Data>
void test( Queue& q, Data& val )
{
typedef typename Queue::value_type value_type;
val.resize( 100 );
for ( size_t i = 0; i < val.size(); ++i )
val[i].nValue = static_cast<int>( i );
ASSERT_TRUE( q.empty());
ASSERT_CONTAINER_SIZE( q, 0u );
// push/enqueue
for ( size_t i = 0; i < val.size(); ++i ) {
if ( i & 1 ) {
ASSERT_TRUE( q.push( val[i] ));
}
else {
ASSERT_TRUE( q.enqueue( val[i] ));
}
ASSERT_CONTAINER_SIZE( q, i + 1 );
}
EXPECT_TRUE( !q.empty());
// pop/dequeue
size_t nCount = 0;
while ( !q.empty()) {
value_type * pVal;
if ( nCount & 1 )
pVal = q.pop();
else
pVal = q.dequeue();
ASSERT_TRUE( pVal != nullptr );
int nSegment = int( nCount / q.quasi_factor());
int nMin = nSegment * int( q.quasi_factor());
int nMax = nMin + int( q.quasi_factor()) - 1;
EXPECT_TRUE( nMin <= pVal->nValue && pVal->nValue <= nMax ) << nMin << " <= " << pVal->nValue << " <= " << nMax;
++nCount;
EXPECT_CONTAINER_SIZE( q, val.size() - nCount );
}
EXPECT_EQ( nCount, val.size());
EXPECT_TRUE( q.empty());
EXPECT_CONTAINER_SIZE( q, 0u );
// pop from empty queue
ASSERT_TRUE( q.pop() == nullptr );
EXPECT_TRUE( q.empty());
EXPECT_CONTAINER_SIZE( q, 0u );
// check that Disposer has not been called
Queue::gc::force_dispose();
for ( size_t i = 0; i < val.size(); ++i ) {
EXPECT_EQ( val[i].nDisposeCount, 0u );
EXPECT_EQ( val[i].nDispose2Count, 0u );
}
// clear
for ( size_t i = 0; i < val.size(); ++i )
EXPECT_TRUE( q.push( val[i] ));
EXPECT_CONTAINER_SIZE( q, val.size());
EXPECT_TRUE( !q.empty());
q.clear();
EXPECT_CONTAINER_SIZE( q, 0u );
EXPECT_TRUE( q.empty());
// check if Disposer has been called
Queue::gc::force_dispose();
for ( size_t i = 0; i < val.size(); ++i ) {
EXPECT_EQ( val[i].nDisposeCount, 1u );
EXPECT_EQ( val[i].nDispose2Count, 0u );
}
// clear_with
for ( size_t i = 0; i < val.size(); ++i )
EXPECT_TRUE( q.push( val[i] ));
EXPECT_CONTAINER_SIZE( q, val.size());
EXPECT_TRUE( !q.empty());
q.clear_with( Disposer2());
EXPECT_CONTAINER_SIZE( q, 0u );
EXPECT_TRUE( q.empty());
// check if Disposer has been called
Queue::gc::force_dispose();
for ( size_t i = 0; i < val.size(); ++i ) {
EXPECT_EQ( val[i].nDisposeCount, 1u );
EXPECT_EQ( val[i].nDispose2Count, 1u );
}
// check clear on destruct
for ( size_t i = 0; i < val.size(); ++i )
EXPECT_TRUE( q.push( val[i] ));
EXPECT_CONTAINER_SIZE( q, val.size());
EXPECT_TRUE( !q.empty());
}
};
} // namespace cds_test
#endif // CDSUNIT_QUEUE_TEST_INTRUSIVE_SEGMENTED_QUEUE_H
|
