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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/testapp.h>
#include <vespa/vespalib/util/eventbarrier.hpp>
using namespace vespalib;
struct MyBarrier {
bool done;
MyBarrier() : done(false) {}
void completeBarrier() {
done = true;
}
};
class Test : public TestApp
{
public:
void testEmpty();
void testSimple();
void testBarrierChain();
void testEventAfter();
void testReorder();
int Main() override;
};
void
Test::testEmpty()
{
// waiting for an empty set of events
MyBarrier b;
EventBarrier<MyBarrier> eb;
EXPECT_TRUE(!eb.startBarrier(b));
EXPECT_TRUE(!b.done);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
uint32_t token = eb.startEvent();
eb.completeEvent(token);
EXPECT_TRUE(!eb.startBarrier(b));
EXPECT_TRUE(!b.done);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
}
void
Test::testSimple()
{
// a single barrier waiting for a single event
MyBarrier b;
EventBarrier<MyBarrier> eb;
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
uint32_t token = eb.startEvent();
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
EXPECT_TRUE(eb.startBarrier(b));
EXPECT_TRUE(!b.done);
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 1u);
eb.completeEvent(token);
EXPECT_TRUE(b.done);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
}
void
Test::testBarrierChain()
{
// more than one barrier waiting for the same set of events
MyBarrier b1;
MyBarrier b2;
MyBarrier b3;
EventBarrier<MyBarrier> eb;
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
uint32_t token = eb.startEvent();
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
EXPECT_TRUE(eb.startBarrier(b1));
EXPECT_TRUE(eb.startBarrier(b2));
EXPECT_TRUE(eb.startBarrier(b3));
EXPECT_TRUE(!b1.done);
EXPECT_TRUE(!b2.done);
EXPECT_TRUE(!b3.done);
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 3u);
eb.completeEvent(token);
EXPECT_TRUE(b1.done);
EXPECT_TRUE(b2.done);
EXPECT_TRUE(b3.done);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
}
void
Test::testEventAfter()
{
// new events starting after the start of a barrier
MyBarrier b;
EventBarrier<MyBarrier> eb;
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
uint32_t token = eb.startEvent();
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
EXPECT_TRUE(eb.startBarrier(b));
EXPECT_TRUE(!b.done);
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 1u);
uint32_t t2 = eb.startEvent();
EXPECT_TRUE(!b.done);
EXPECT_EQUAL(eb.countEvents(), 2u);
EXPECT_EQUAL(eb.countBarriers(), 1u);
eb.completeEvent(token);
EXPECT_TRUE(b.done);
EXPECT_EQUAL(eb.countEvents(), 1u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
eb.completeEvent(t2);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
}
void
Test::testReorder()
{
// events completing in a different order than they started
MyBarrier b1;
MyBarrier b2;
MyBarrier b3;
EventBarrier<MyBarrier> eb;
uint32_t t1 = eb.startEvent();
eb.startBarrier(b1);
uint32_t t2 = eb.startEvent();
eb.startBarrier(b2);
uint32_t t3 = eb.startEvent();
eb.startBarrier(b3);
uint32_t t4 = eb.startEvent();
EXPECT_EQUAL(eb.countEvents(), 4u);
EXPECT_EQUAL(eb.countBarriers(), 3u);
EXPECT_TRUE(!b1.done);
EXPECT_TRUE(!b2.done);
EXPECT_TRUE(!b3.done);
eb.completeEvent(t4);
EXPECT_TRUE(!b1.done);
EXPECT_TRUE(!b2.done);
EXPECT_TRUE(!b3.done);
eb.completeEvent(t3);
EXPECT_TRUE(!b1.done);
EXPECT_TRUE(!b2.done);
EXPECT_TRUE(!b3.done);
eb.completeEvent(t1);
EXPECT_TRUE(b1.done);
EXPECT_TRUE(!b2.done);
EXPECT_TRUE(!b3.done);
eb.completeEvent(t2);
EXPECT_TRUE(b1.done);
EXPECT_TRUE(b2.done);
EXPECT_TRUE(b3.done);
EXPECT_EQUAL(eb.countEvents(), 0u);
EXPECT_EQUAL(eb.countBarriers(), 0u);
}
int
Test::Main()
{
TEST_INIT("eventbarrier_test");
testEmpty();
testSimple();
testBarrierChain();
testEventAfter();
testReorder();
TEST_DONE();
}
TEST_APPHOOK(Test);
|
