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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/vespalib/btree/btreebuilder.h>
#include <vespa/vespalib/btree/btreenodeallocator.h>
#include <vespa/vespalib/btree/btree.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/datastore/buffer_type.hpp>
#include <vespa/vespalib/util/rand48.h>
#include <vespa/vespalib/util/time.h>
#include <cinttypes>
#include <unistd.h>
#include <vespa/log/log.h>
LOG_SETUP("iteratespeed");
namespace vespalib::btree {
enum class IterateMethod
{
FORWARD,
BACKWARDS,
LAMBDA
};
class IterateSpeed
{
template <typename Traits, IterateMethod iterateMethod>
void
workLoop(int loops, bool enableForward, bool enableBackwards,
bool enableLambda, int leafSlots);
void usage();
public:
int main(int argc, char **argv);
};
namespace {
const char *iterateMethodName(IterateMethod iterateMethod)
{
switch (iterateMethod) {
case IterateMethod::FORWARD:
return "forward";
case IterateMethod::BACKWARDS:
return "backwards";
default:
return "lambda";
}
}
}
template <typename Traits, IterateMethod iterateMethod>
void
IterateSpeed::workLoop(int loops, bool enableForward, bool enableBackwards,
bool enableLambda, int leafSlots)
{
if ((iterateMethod == IterateMethod::FORWARD && !enableForward) ||
(iterateMethod == IterateMethod::BACKWARDS && !enableBackwards) ||
(iterateMethod == IterateMethod::LAMBDA && !enableLambda) ||
(leafSlots != 0 &&
leafSlots != static_cast<int>(Traits::LEAF_SLOTS)))
return;
vespalib::GenerationHandler g;
using Tree = BTree<int, int, btree::NoAggregated, std::less<int>, Traits>;
using Builder = typename Tree::Builder;
using ConstIterator = typename Tree::ConstIterator;
Tree tree;
Builder builder(tree.getAllocator());
size_t numEntries = 1000000;
size_t numInnerLoops = 1000;
for (size_t i = 0; i < numEntries; ++i) {
builder.insert(i, 0);
}
tree.assign(builder);
assert(numEntries == tree.size());
assert(tree.isValid());
for (int l = 0; l < loops; ++l) {
vespalib::Timer timer;
uint64_t sum = 0;
for (size_t innerl = 0; innerl < numInnerLoops; ++innerl) {
if (iterateMethod == IterateMethod::FORWARD) {
ConstIterator itr(BTreeNode::Ref(), tree.getAllocator());
itr.begin(tree.getRoot());
while (itr.valid()) {
sum += itr.getKey();
++itr;
}
} else if (iterateMethod == IterateMethod::BACKWARDS) {
ConstIterator itr(BTreeNode::Ref(), tree.getAllocator());
itr.end(tree.getRoot());
--itr;
while (itr.valid()) {
sum += itr.getKey();
--itr;
}
} else {
tree.getAllocator().foreach_key(tree.getRoot(),
[&](int key) { sum += key; } );
}
}
double used = vespalib::to_s(timer.elapsed());
printf("Elapsed time for iterating %ld steps is %8.5f, "
"direction=%s, fanout=%u,%u, sum=%" PRIu64 "\n",
numEntries * numInnerLoops,
used,
iterateMethodName(iterateMethod),
static_cast<int>(Traits::LEAF_SLOTS),
static_cast<int>(Traits::INTERNAL_SLOTS),
sum);
fflush(stdout);
}
}
void
IterateSpeed::usage()
{
printf("iteratspeed "
"[-F <leafSlots>] "
"[-b] "
"[-c <numLoops>] "
"[-f] "
"[-l]\n");
}
int
IterateSpeed::main(int argc, char **argv)
{
int c;
int loops = 1;
bool backwards = false;
bool forwards = false;
bool lambda = false;
int leafSlots = 0;
while ((c = getopt(argc, argv, "F:bc:fl")) != -1) {
switch (c) {
case 'F':
leafSlots = atoi(optarg);
break;
case 'b':
backwards = true;
break;
case 'c':
loops = atoi(optarg);
break;
case 'f':
forwards = true;
break;
case 'l':
lambda = true;
break;
default:
usage();
return 1;
}
}
if (!backwards && !forwards && !lambda) {
backwards = true;
forwards = true;
lambda = true;
}
using SmallTraits = BTreeTraits<4, 4, 31, false>;
using DefTraits = BTreeDefaultTraits;
using LargeTraits = BTreeTraits<32, 16, 10, true>;
using HugeTraits = BTreeTraits<64, 16, 10, true>;
workLoop<SmallTraits, IterateMethod::FORWARD>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<DefTraits, IterateMethod::FORWARD>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<LargeTraits, IterateMethod::FORWARD>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<HugeTraits, IterateMethod::FORWARD>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<SmallTraits, IterateMethod::BACKWARDS>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<DefTraits, IterateMethod::BACKWARDS>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<LargeTraits, IterateMethod::BACKWARDS>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<HugeTraits, IterateMethod::BACKWARDS>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<SmallTraits, IterateMethod::LAMBDA>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<DefTraits, IterateMethod::LAMBDA>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<LargeTraits, IterateMethod::LAMBDA>(loops, forwards, backwards,
lambda, leafSlots);
workLoop<HugeTraits, IterateMethod::LAMBDA>(loops, forwards, backwards,
lambda, leafSlots);
return 0;
}
}
int main(int argc, char **argv) {
vespalib::btree::IterateSpeed app;
return app.main(argc, argv);
}
|
