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
|
// Copyright Verizon Media. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#include <vespa/searchcommon/attribute/config.h>
#include <vespa/searchcommon/attribute/status.h>
#include <vespa/searchlib/attribute/postingstore.h>
#include <vespa/searchlib/attribute/enumstore.hpp>
#include <vespa/vespalib/btree/btreenodeallocator.hpp>
#include <vespa/vespalib/btree/btreerootbase.hpp>
#include <vespa/vespalib/btree/btreeroot.hpp>
#include <vespa/searchlib/attribute/postingstore.hpp>
#include <vespa/vespalib/datastore/buffer_type.hpp>
#include <vespa/vespalib/gtest/gtest.h>
#include <ostream>
using vespalib::GenerationHandler;
using vespalib::datastore::EntryRef;
namespace search::attribute {
using MyValueStore = EnumStoreT<int32_t>;
using MyPostingStore = PostingStore<int32_t>;
namespace {
static constexpr uint32_t lid_limit = 20000;
static constexpr uint32_t huge_sequence_length = 800;
struct PostingStoreSetup {
bool enable_bitvectors;
bool enable_only_bitvector;
PostingStoreSetup(bool enable_bitvectors_in, bool enable_only_bitvector_in)
: enable_bitvectors(enable_bitvectors_in),
enable_only_bitvector(enable_only_bitvector_in)
{
}
};
std::ostream& operator<<(std::ostream& os, const PostingStoreSetup setup)
{
os << (setup.enable_bitvectors ? "bv" : "nobv") << "_" << (setup.enable_only_bitvector ? "onlybv" : "mixed");
return os;
}
Config make_config(PostingStoreSetup param) {
Config cfg;
cfg.setEnableBitVectors(param.enable_bitvectors);
cfg.setEnableOnlyBitVector(param.enable_only_bitvector);
return cfg;
}
}
class PostingStoreTest : public ::testing::TestWithParam<PostingStoreSetup>
{
protected:
GenerationHandler _gen_handler;
Config _config;
Status _status;
MyValueStore _value_store;
MyPostingStore _store;
PostingStoreTest();
~PostingStoreTest() override;
void inc_generation()
{
_store.freeze();
_store.transferHoldLists(_gen_handler.getCurrentGeneration());
_gen_handler.incGeneration();
_store.trimHoldLists(_gen_handler.getFirstUsedGeneration());
}
EntryRef add_sequence(int start_key, int end_key)
{
std::vector<MyPostingStore::KeyDataType> additions;
std::vector<MyPostingStore::KeyType> removals;
EntryRef root;
for (int i = start_key; i < end_key; ++i) {
additions.emplace_back(i, 0);
}
_store.apply(root,
&additions[0], &additions[0] + additions.size(),
&removals[0], &removals[0] + removals.size());
return root;
}
static std::vector<int> make_exp_sequence(int start_key, int end_key)
{
std::vector<int> sequence;
for (int i = start_key; i < end_key; ++i) {
sequence.emplace_back(i);
}
return sequence;
}
std::vector<int> get_sequence(EntryRef root) const {
std::vector<int> sequence;
_store.foreach_frozen_key(root, [&sequence](int key) { sequence.emplace_back(key); });
return sequence;
}
std::vector<EntryRef> populate(uint32_t sequence_length);
void test_compact_btree_nodes(uint32_t sequence_length);
void test_compact_sequence(uint32_t sequence_length);
};
PostingStoreTest::PostingStoreTest()
: _gen_handler(),
_config(make_config(GetParam())),
_status(),
_value_store(true, _config.get_dictionary_config()),
_store(_value_store.get_dictionary(), _status, _config)
{
_store.resizeBitVectors(lid_limit, lid_limit);
}
PostingStoreTest::~PostingStoreTest()
{
_store.clearBuilder();
inc_generation();
}
std::vector<EntryRef>
PostingStoreTest::populate(uint32_t sequence_length)
{
auto &store = _store;
EntryRef ref1 = add_sequence(4, 4 + sequence_length);
EntryRef ref2 = add_sequence(5, 5 + sequence_length);
std::vector<EntryRef> refs;
for (int i = 0; i < 1000; ++i) {
refs.emplace_back(add_sequence(i + 6, i + 6 + sequence_length));
}
for (auto& ref : refs) {
store.clear(ref);
}
inc_generation();
return { ref1, ref2 };
}
void
PostingStoreTest::test_compact_sequence(uint32_t sequence_length)
{
auto populated_refs = populate(sequence_length);
auto &store = _store;
EntryRef ref1 = populated_refs[0];
EntryRef ref2 = populated_refs[1];
auto usage_before = store.getMemoryUsage();
for (uint32_t pass = 0; pass < 15; ++pass) {
auto to_hold = store.start_compact_worst_buffers();
ref1 = store.move(ref1);
ref2 = store.move(ref2);
store.finishCompact(to_hold);
inc_generation();
}
EXPECT_NE(populated_refs[0], ref1);
EXPECT_NE(populated_refs[1], ref2);
EXPECT_EQ(make_exp_sequence(4, 4 + sequence_length), get_sequence(ref1));
EXPECT_EQ(make_exp_sequence(5, 5 + sequence_length), get_sequence(ref2));
auto usage_after = store.getMemoryUsage();
EXPECT_GT(usage_before.deadBytes(), usage_after.deadBytes());
store.clear(ref1);
store.clear(ref2);
}
void
PostingStoreTest::test_compact_btree_nodes(uint32_t sequence_length)
{
auto populated_refs = populate(sequence_length);
auto &store = _store;
EntryRef ref1 = populated_refs[0];
EntryRef ref2 = populated_refs[1];
auto usage_before = store.getMemoryUsage();
for (uint32_t pass = 0; pass < 15; ++pass) {
auto to_hold = store.start_compact_worst_btree_nodes();
store.move_btree_nodes(ref1);
store.move_btree_nodes(ref2);
store.finish_compact_worst_btree_nodes(to_hold);
inc_generation();
}
EXPECT_EQ(make_exp_sequence(4, 4 + sequence_length), get_sequence(ref1));
EXPECT_EQ(make_exp_sequence(5, 5 + sequence_length), get_sequence(ref2));
auto usage_after = store.getMemoryUsage();
if (sequence_length < huge_sequence_length ||
!_config.getEnableBitVectors() ||
!_config.getEnableOnlyBitVector()) {
EXPECT_GT(usage_before.deadBytes(), usage_after.deadBytes());
} else {
EXPECT_EQ(usage_before.deadBytes(), usage_after.deadBytes());
}
store.clear(ref1);
store.clear(ref2);
}
VESPA_GTEST_INSTANTIATE_TEST_SUITE_P(PostingStoreMultiTest,
PostingStoreTest,
testing::Values(PostingStoreSetup(false, false), PostingStoreSetup(true, false), PostingStoreSetup(true, true)), testing::PrintToStringParamName());
TEST_P(PostingStoreTest, require_that_nodes_for_multiple_small_btrees_are_compacted)
{
test_compact_btree_nodes(30);
}
TEST_P(PostingStoreTest, require_that_nodes_for_multiple_large_btrees_are_compacted)
{
test_compact_btree_nodes(huge_sequence_length);
}
TEST_P(PostingStoreTest, require_that_short_arrays_are_compacted)
{
test_compact_sequence(4);
}
TEST_P(PostingStoreTest, require_that_btree_roots_are_compacted)
{
test_compact_sequence(10);
}
TEST_P(PostingStoreTest, require_that_bitvectors_are_compacted)
{
test_compact_sequence(huge_sequence_length);
}
}
GTEST_MAIN_RUN_ALL_TESTS()
|
