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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/testkit/test_kit.h>
#include <vespa/vespalib/btree/btreeroot.h>
#include <vespa/vespalib/btree/btreebuilder.h>
#include <vespa/vespalib/btree/btreenodeallocator.h>
#include <vespa/vespalib/btree/btree.h>
#include <vespa/vespalib/btree/btreestore.h>
#include <vespa/vespalib/util/rand48.h>
#include <vespa/vespalib/btree/btreenodeallocator.hpp>
#include <vespa/vespalib/btree/btreenode.hpp>
#include <vespa/vespalib/btree/btreenodestore.hpp>
#include <vespa/vespalib/btree/btreeiterator.hpp>
#include <vespa/vespalib/btree/btreeroot.hpp>
#include <vespa/vespalib/btree/btreebuilder.hpp>
#include <vespa/vespalib/btree/btree.hpp>
#include <vespa/vespalib/btree/btreestore.hpp>
#include <vespa/vespalib/btree/btreeaggregator.hpp>
#include <vespa/vespalib/util/threadstackexecutor.h>
#include <vespa/vespalib/util/lambdatask.h>
#include <vespa/log/log.h>
LOG_SETUP("btreestress_test");
using MyTree = search::btree::BTree<uint32_t, uint32_t>;
using MyTreeIterator = typename MyTree::Iterator;
using MyTreeConstIterator = typename MyTree::ConstIterator;
using GenerationHandler = vespalib::GenerationHandler;
using vespalib::makeLambdaTask;
struct Fixture
{
GenerationHandler _generationHandler;
MyTree _tree;
MyTreeIterator _writeItr;
vespalib::ThreadStackExecutor _writer; // 1 write thread
vespalib::ThreadStackExecutor _readers; // multiple reader threads
vespalib::Rand48 _rnd;
uint32_t _keyLimit;
std::atomic<long> _readSeed;
std::atomic<long> _doneWriteWork;
std::atomic<long> _doneReadWork;
std::atomic<int> _stopRead;
bool _reportWork;
Fixture();
~Fixture();
void commit();
void adjustWriteIterator(uint32_t key);
void insert(uint32_t key);
void remove(uint32_t key);
void readWork(uint32_t cnt);
void readWork();
void writeWork(uint32_t cnt);
};
Fixture::Fixture()
: _generationHandler(),
_tree(),
_writeItr(_tree.begin()),
_writer(1, 128 * 1024),
_readers(4, 128 * 1024),
_rnd(),
_keyLimit(1000000),
_readSeed(50),
_doneWriteWork(0),
_doneReadWork(0),
_stopRead(0),
_reportWork(false)
{
_rnd.srand48(32);
}
Fixture::~Fixture()
{
_readers.sync();
_readers.shutdown();
_writer.sync();
_writer.shutdown();
commit();
if (_reportWork) {
LOG(info,
"readWork=%ld, writeWork=%ld",
_doneReadWork.load(), _doneWriteWork.load());
}
}
void
Fixture::commit()
{
auto &allocator = _tree.getAllocator();
allocator.freeze();
allocator.transferHoldLists(_generationHandler.getCurrentGeneration());
_generationHandler.incGeneration();
allocator.trimHoldLists(_generationHandler.getFirstUsedGeneration());
}
void
Fixture::adjustWriteIterator(uint32_t key)
{
if (_writeItr.valid() && _writeItr.getKey() < key) {
_writeItr.binarySeek(key);
} else {
_writeItr.lower_bound(key);
}
}
void
Fixture::insert(uint32_t key)
{
adjustWriteIterator(key);
assert(!_writeItr.valid() || _writeItr.getKey() >= key);
if (!_writeItr.valid() || _writeItr.getKey() != key) {
_tree.insert(_writeItr, key, 0u);
}
}
void
Fixture::remove(uint32_t key)
{
adjustWriteIterator(key);
assert(!_writeItr.valid() || _writeItr.getKey() >= key);
if (_writeItr.valid() && _writeItr.getKey() == key) {
_tree.remove(_writeItr);
}
}
void
Fixture::readWork(uint32_t cnt)
{
vespalib::Rand48 rnd;
rnd.srand48(++_readSeed);
uint32_t i;
for (i = 0; i < cnt && _stopRead.load() == 0; ++i) {
auto guard = _generationHandler.takeGuard();
uint32_t key = rnd.lrand48() % (_keyLimit + 1);
MyTreeConstIterator itr = _tree.getFrozenView().lowerBound(key);
assert(!itr.valid() || itr.getKey() >= key);
}
_doneReadWork += i;
LOG(info, "done %u read work", i);
}
void
Fixture::readWork()
{
readWork(std::numeric_limits<uint32_t>::max());
}
void
Fixture::writeWork(uint32_t cnt)
{
vespalib::Rand48 &rnd(_rnd);
for (uint32_t i = 0; i < cnt; ++i) {
uint32_t key = rnd.lrand48() % _keyLimit;
if ((rnd.lrand48() & 1) == 0) {
insert(key);
} else {
remove(key);
}
commit();
}
_doneWriteWork += cnt;
_stopRead = 1;
LOG(info, "done %u write work", cnt);
}
TEST_F("Test manual lower bound call", Fixture)
{
f.insert(1);
f.remove(2);
f.insert(1);
f.insert(5);
f.insert(4);
f.remove(3);
f.remove(5);
f.commit();
auto itr = f._tree.getFrozenView().lowerBound(3);
EXPECT_TRUE(itr.valid());
EXPECT_EQUAL(4u, itr.getKey());
}
TEST_F("Test single threaded lower_bound reader without updates", Fixture)
{
f._reportWork = true;
f.writeWork(10);
f._stopRead = 0;
f.readWork(10);
}
TEST_F("Test single threaded lower_bound reader during updates", Fixture)
{
uint32_t cnt = 1000000;
f._reportWork = true;
f._writer.execute(makeLambdaTask([=]() { f.writeWork(cnt); }));
f._readers.execute(makeLambdaTask([=]() { f.readWork(); }));
}
TEST_F("Test multithreaded lower_bound reader during updates", Fixture)
{
uint32_t cnt = 1000000;
f._reportWork = true;
f._writer.execute(makeLambdaTask([=]() { f.writeWork(cnt); }));
f._readers.execute(makeLambdaTask([=]() { f.readWork(); }));
f._readers.execute(makeLambdaTask([=]() { f.readWork(); }));
f._readers.execute(makeLambdaTask([=]() { f.readWork(); }));
f._readers.execute(makeLambdaTask([=]() { f.readWork(); }));
}
TEST_MAIN() { TEST_RUN_ALL(); }
|
