-
Notifications
You must be signed in to change notification settings - Fork 6
Expand file tree
/
Copy pathmicro_benchmark.cpp
More file actions
454 lines (392 loc) · 15.6 KB
/
micro_benchmark.cpp
File metadata and controls
454 lines (392 loc) · 15.6 KB
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
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
// Copyright 2019-2025 UnoDB contributors
// Should be the first include
#include "global.hpp" // IWYU pragma: keep
// IWYU pragma: no_include <__vector/vector.h>
// IWYU pragma: no_include <array>
// IWYU pragma: no_include <string>
#include <cstddef>
#include <cstdint>
#include <tuple>
#include <benchmark/benchmark.h>
#include "art_common.hpp"
#include "art_internal.hpp" // IWYU pragma: keep
#include "micro_benchmark_node_utils.hpp"
#include "micro_benchmark_utils.hpp"
#include "node_type.hpp"
namespace {
template <class Db>
void dense_insert(benchmark::State& state) {
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::growing_tree_node_stats<Db> growing_tree_stats;
std::size_t tree_size = 0;
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
state.PauseTiming();
Db test_db;
benchmark::ClobberMemory();
state.ResumeTiming();
for (std::uint64_t i = 0; i < static_cast<std::uint64_t>(state.range(0));
++i)
unodb::benchmark::insert_key(
test_db, i, unodb::value_view{unodb::benchmark::value100});
state.PauseTiming();
#ifdef UNODB_DETAIL_WITH_STATS
growing_tree_stats.get(test_db);
tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
unodb::benchmark::destroy_tree(test_db, state);
}
state.SetItemsProcessed(state.iterations() * state.range(0));
#ifdef UNODB_DETAIL_WITH_STATS
growing_tree_stats.publish(state);
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
template <class Db>
void sparse_insert_dups_allowed(benchmark::State& state) {
unodb::benchmark::batched_prng random_keys;
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::growing_tree_node_stats<Db> growing_tree_stats;
std::size_t tree_size = 0;
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
state.PauseTiming();
Db test_db;
benchmark::ClobberMemory();
state.ResumeTiming();
for (auto i = 0; i < state.range(0); ++i) {
const auto random_key = random_keys.get(state);
unodb::benchmark::insert_key_ignore_dups(
test_db, random_key, unodb::value_view{unodb::benchmark::value100});
}
state.PauseTiming();
#ifdef UNODB_DETAIL_WITH_STATS
growing_tree_stats.get(test_db);
tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
unodb::benchmark::destroy_tree(test_db, state);
}
state.SetItemsProcessed(state.iterations() * state.range(0));
#ifdef UNODB_DETAIL_WITH_STATS
growing_tree_stats.publish(state);
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
constexpr auto full_scan_multiplier = 50;
// inserts a sequences of keys and a fixed value then runs over the
// tree fetching the each key.
template <class Db>
void dense_full_scan(benchmark::State& state) {
Db test_db;
const auto key_limit = static_cast<std::uint64_t>(state.range(0));
for (std::uint64_t i = 0; i < key_limit; ++i)
unodb::benchmark::insert_key(test_db, i,
unodb::value_view{unodb::benchmark::value100});
#ifdef UNODB_DETAIL_WITH_STATS
const auto tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state)
for (auto i = 0; i < full_scan_multiplier; ++i)
for (std::uint64_t j = 0; j < key_limit; ++j)
unodb::benchmark::get_existing_key(test_db, j);
state.SetItemsProcessed(state.iterations() * state.range(0) *
full_scan_multiplier);
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
// decode a uint64_t key.
[[nodiscard]] std::uint64_t decode(unodb::key_view akey) noexcept {
unodb::key_decoder dec{akey};
std::uint64_t k;
dec.decode(k);
return k;
}
// inserts keys and a constant value and then scans all entries in the
// tree using db::scan(), reading both the keys and the values.
template <class Db>
void dense_iter_full_fwd_scan(benchmark::State& state) {
Db test_db;
const auto key_limit = static_cast<std::uint64_t>(state.range(0));
for (std::uint64_t i = 0; i < key_limit; ++i)
unodb::benchmark::insert_key(test_db, i,
unodb::value_view{unodb::benchmark::value100});
#ifdef UNODB_DETAIL_WITH_STATS
const auto tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
for (auto i = 0; i < full_scan_multiplier; ++i) {
std::uint64_t sum = 0;
auto fn =
[&sum](const unodb::visitor<typename Db::iterator>& v) noexcept {
sum += decode(v.get_key());
std::ignore = v.get_value();
return false;
};
test_db.scan(fn);
::benchmark::DoNotOptimize(sum); // ensure that the keys were retrieved.
}
}
state.SetItemsProcessed(state.iterations() * state.range(0) *
full_scan_multiplier);
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
// inserts keys and a constant value and scans the entries in a
// key-range in the tree using db::scan(), reading both the keys and
// the values (this variant has more overhead than a full scan since
// it must check for the end of the range).
template <class Db>
void dense_iter_keyrange_fwd_scan(benchmark::State& state) {
Db test_db;
const auto key_limit = static_cast<std::uint64_t>(state.range(0));
for (std::uint64_t i = 0; i < key_limit; ++i)
unodb::benchmark::insert_key(test_db, i,
unodb::value_view{unodb::benchmark::value100});
#ifdef UNODB_DETAIL_WITH_STATS
const auto tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
for (auto i = 0; i < full_scan_multiplier; ++i) {
std::uint64_t sum = 0;
auto fn =
[&sum](const unodb::visitor<typename Db::iterator>& v) noexcept {
sum += decode(v.get_key());
std::ignore = v.get_value();
return false;
};
test_db.scan_range(0, key_limit,
fn); // scan all keys, but using a key-range.
::benchmark::DoNotOptimize(sum); // ensure that the keys were retrieved.
}
}
state.SetItemsProcessed(state.iterations() * state.range(0) *
full_scan_multiplier);
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
void dense_tree_sparse_deletes_args(benchmark::internal::Benchmark* b) {
for (auto i = 1000; i <= 5000000; i *= 8) {
b->Args({i, 800});
b->Args({i, i});
}
}
template <class Db>
void dense_tree_sparse_deletes(benchmark::State& state) {
// Node shrinking stats almost always zero, thus this test only tests
// non-shrinking Node256 delete
#ifdef UNODB_DETAIL_WITH_STATS
std::size_t start_tree_size = 0;
std::size_t end_tree_size = 0;
std::uint64_t start_leaf_count = 0;
std::uint64_t end_leaf_count = 0;
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
state.PauseTiming();
unodb::benchmark::batched_prng random_keys{
static_cast<std::uint64_t>(state.range(0) - 1)};
Db test_db;
for (std::uint64_t i = 0; i < static_cast<std::uint64_t>(state.range(0));
++i)
unodb::benchmark::insert_key(
test_db, i, unodb::value_view{unodb::benchmark::value100});
#ifdef UNODB_DETAIL_WITH_STATS
start_tree_size = test_db.get_current_memory_use();
start_leaf_count =
test_db.template get_node_count<unodb::node_type::LEAF>();
#endif // UNODB_DETAIL_WITH_STATS
state.ResumeTiming();
for (auto j = 0; j < state.range(1); ++j) {
const auto random_key = random_keys.get(state);
unodb::benchmark::delete_key_if_exists(test_db, random_key);
}
#ifdef UNODB_DETAIL_WITH_STATS
end_tree_size = test_db.get_current_memory_use();
end_leaf_count = test_db.template get_node_count<unodb::node_type::LEAF>();
#endif // UNODB_DETAIL_WITH_STATS
}
state.SetItemsProcessed(state.iterations() * state.range(1));
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::set_size_counter(state, "start size", start_tree_size);
unodb::benchmark::set_size_counter(state, "end size", end_tree_size);
state.counters["start L"] = static_cast<double>(start_leaf_count);
state.counters["end L"] = static_cast<double>(end_leaf_count);
#endif // UNODB_DETAIL_WITH_STATS
}
constexpr auto dense_tree_increasing_keys_delete_insert_pairs = 1000000;
template <class Db>
void dense_tree_increasing_keys(benchmark::State& state) {
for (const auto _ : state) {
state.PauseTiming();
Db test_db;
std::uint64_t key_to_insert;
for (key_to_insert = 0;
key_to_insert < static_cast<std::uint64_t>(state.range(0));
++key_to_insert) {
unodb::benchmark::insert_key(
test_db, key_to_insert,
unodb::value_view{unodb::benchmark::value100});
}
std::uint64_t key_to_delete = 0;
state.ResumeTiming();
for (auto i = 0; i < dense_tree_increasing_keys_delete_insert_pairs; ++i) {
unodb::benchmark::delete_key(test_db, key_to_delete);
++key_to_delete;
unodb::benchmark::insert_key(
test_db, key_to_insert,
unodb::value_view{unodb::benchmark::value100});
++key_to_insert;
}
state.PauseTiming();
unodb::benchmark::destroy_tree(test_db, state);
}
state.SetItemsProcessed(state.iterations() *
dense_tree_increasing_keys_delete_insert_pairs * 2);
}
void dense_insert_value_lengths_args(benchmark::internal::Benchmark* b) {
for (auto i = 100; i <= 1000000; i *= 8)
for (auto j = 0; j < static_cast<int64_t>(unodb::benchmark::values.size());
++j)
b->Args({i, j});
}
template <class Db>
void dense_insert_value_lengths(benchmark::State& state) {
#ifdef UNODB_DETAIL_WITH_STATS
std::size_t tree_size = 0;
#endif // UNODB_DETAIL_WITH_STATS
for (const auto _ : state) {
state.PauseTiming();
Db test_db;
benchmark::ClobberMemory();
state.ResumeTiming();
for (std::uint64_t i = 0; i < static_cast<std::uint64_t>(state.range(0));
++i)
unodb::benchmark::insert_key(
test_db, i,
unodb::benchmark::values[static_cast<
decltype(unodb::benchmark::values)::size_type>(state.range(1))]);
state.PauseTiming();
#ifdef UNODB_DETAIL_WITH_STATS
tree_size = test_db.get_current_memory_use();
#endif // UNODB_DETAIL_WITH_STATS
unodb::benchmark::destroy_tree(test_db, state);
}
state.SetBytesProcessed(
state.iterations() * state.range(0) *
(state.range(1) + static_cast<std::int64_t>(sizeof(std::uint64_t))));
#ifdef UNODB_DETAIL_WITH_STATS
unodb::benchmark::set_size_counter(state, "size", tree_size);
#endif // UNODB_DETAIL_WITH_STATS
}
template <class Db>
void dense_insert_dup_attempts(benchmark::State& state) {
for (const auto _ : state) {
state.PauseTiming();
const auto key_limit = static_cast<std::uint64_t>(state.range(0));
Db test_db;
for (std::uint64_t i = 0; i < key_limit; ++i)
unodb::benchmark::insert_key(
test_db, i, unodb::value_view{unodb::benchmark::value100});
state.ResumeTiming();
for (std::uint64_t i = 0; i < key_limit; ++i)
unodb::benchmark::insert_key_ignore_dups(
test_db, i, unodb::value_view{unodb::benchmark::value100});
state.PauseTiming();
unodb::benchmark::destroy_tree(test_db, state);
}
state.SetItemsProcessed(state.iterations() * state.range(0));
}
} // namespace
UNODB_START_BENCHMARKS()
// TODO(laurynas): only dense Node256 trees have reasonable coverage, need
// to handle sparse Node16/Node48 trees too
BENCHMARK_TEMPLATE(dense_insert, unodb::benchmark::db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert, unodb::benchmark::mutex_db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert, unodb::benchmark::olc_db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(sparse_insert_dups_allowed, unodb::benchmark::db)
->Range(100, 10000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(sparse_insert_dups_allowed, unodb::benchmark::mutex_db)
->Range(100, 10000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(sparse_insert_dups_allowed, unodb::benchmark::olc_db)
->Range(100, 10000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_full_scan, unodb::benchmark::db)
->Range(100, 20000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_full_scan, unodb::benchmark::mutex_db)
->Range(100, 20000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_full_scan, unodb::benchmark::olc_db)
->Range(100, 20000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_full_fwd_scan, unodb::benchmark::db)
->Range(128, 1 << 28)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_full_fwd_scan, unodb::benchmark::mutex_db)
->Range(128, 1 << 20) // less scale since just not interesting.
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_full_fwd_scan, unodb::benchmark::olc_db)
->Range(128, 1 << 28)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_keyrange_fwd_scan, unodb::benchmark::db)
->Range(128, 1 << 28)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_keyrange_fwd_scan, unodb::benchmark::mutex_db)
->Range(128, 1 << 20) // less scale since just not interesting.
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_iter_keyrange_fwd_scan, unodb::benchmark::olc_db)
->Range(128, 1 << 28)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_tree_sparse_deletes, unodb::benchmark::db)
->ArgNames({"", "deletes"})
->Apply(dense_tree_sparse_deletes_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_tree_sparse_deletes, unodb::benchmark::mutex_db)
->ArgNames({"", "deletes"})
->Apply(dense_tree_sparse_deletes_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_tree_sparse_deletes, unodb::benchmark::olc_db)
->ArgNames({"", "deletes"})
->Apply(dense_tree_sparse_deletes_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_tree_increasing_keys, unodb::benchmark::db)
->Range(100, 30000000)
->Unit(benchmark::kMillisecond);
BENCHMARK_TEMPLATE(dense_tree_increasing_keys, unodb::benchmark::mutex_db)
->Range(100, 30000000)
->Unit(benchmark::kMillisecond);
BENCHMARK_TEMPLATE(dense_tree_increasing_keys, unodb::benchmark::olc_db)
->Range(100, 30000000)
->Unit(benchmark::kMillisecond);
BENCHMARK_TEMPLATE(dense_insert_value_lengths, unodb::benchmark::db)
->ArgNames({"", "value len log10"})
->Apply(dense_insert_value_lengths_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert_value_lengths, unodb::benchmark::mutex_db)
->ArgNames({"", "value len log10"})
->Apply(dense_insert_value_lengths_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert_value_lengths, unodb::benchmark::olc_db)
->ArgNames({"", "value len log10"})
->Apply(dense_insert_value_lengths_args)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert_dup_attempts, unodb::benchmark::db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert_dup_attempts, unodb::benchmark::mutex_db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
BENCHMARK_TEMPLATE(dense_insert_dup_attempts, unodb::benchmark::olc_db)
->Range(100, 30000000)
->Unit(benchmark::kMicrosecond);
UNODB_BENCHMARK_MAIN();