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
|
// Copyright Vespa.ai. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "unique_store.h"
#include "unique_store_dictionary.h"
#include "unique_store_remapper.h"
#include "datastore.hpp"
#include "unique_store_allocator.hpp"
#include "unique_store_builder.hpp"
#include "unique_store_dictionary.hpp"
#include "unique_store_enumerator.hpp"
#include "unique_store_remapper.hpp"
#include <atomic>
#include <algorithm>
namespace vespalib::datastore {
namespace uniquestore {
using DefaultDictionaryTraits = btree::BTreeTraits<32, 32, 7, true>;
using DefaultDictionary = btree::BTree<AtomicEntryRef, btree::BTreeNoLeafData,
btree::NoAggregated,
EntryComparatorWrapper,
DefaultDictionaryTraits>;
using DefaultUniqueStoreDictionary = UniqueStoreDictionary<DefaultDictionary>;
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
UniqueStore<EntryT, RefT, Comparator, Allocator>::UniqueStore(std::shared_ptr<alloc::MemoryAllocator> memory_allocator, const std::function<ComparatorType(const DataStoreType&)>& comparator_factory)
: _allocator(std::move(memory_allocator)),
_store(_allocator.get_data_store()),
_comparator(comparator_factory(_store)),
_dict(std::make_unique<uniquestore::DefaultUniqueStoreDictionary>(std::unique_ptr<EntryComparator>()))
{
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
UniqueStore<EntryT, RefT, Comparator, Allocator>::~UniqueStore() = default;
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
void
UniqueStore<EntryT, RefT, Comparator, Allocator>::set_dictionary(std::unique_ptr<IUniqueStoreDictionary> dict)
{
_dict = std::move(dict);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
UniqueStoreAddResult
UniqueStore<EntryT, RefT, Comparator, Allocator>::add(EntryConstRefType value)
{
auto comp = _comparator.make_for_lookup(value);
UniqueStoreAddResult result = _dict->add(comp, [this, &value]() -> EntryRef { return _allocator.allocate(value); });
_allocator.get_wrapped(result.ref()).inc_ref_count();
return result;
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
EntryRef
UniqueStore<EntryT, RefT, Comparator, Allocator>::find(EntryConstRefType value)
{
auto comp = _comparator.make_for_lookup(value);
return _dict->find(comp);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
void
UniqueStore<EntryT, RefT, Comparator, Allocator>::remove(EntryRef ref)
{
auto &wrapped_entry = _allocator.get_wrapped(ref);
auto ref_count = wrapped_entry.get_ref_count();
assert(ref_count > 0u);
wrapped_entry.dec_ref_count();
if (ref_count == 1u) {
_dict->remove(_comparator, ref);
_allocator.hold(ref);
}
}
namespace uniquestore {
template <typename RefT>
class CompactionContext : public UniqueStoreRemapper<RefT>, public ICompactable {
private:
using DictionaryTraits = btree::BTreeTraits<32, 32, 7, true>;
using Dictionary = btree::BTree<EntryRef, uint32_t,
btree::NoAggregated,
EntryComparatorWrapper,
DictionaryTraits>;
using UniqueStoreRemapper<RefT>::_filter;
using UniqueStoreRemapper<RefT>::_mapping;
IUniqueStoreDictionary &_dict;
ICompactable &_store;
std::unique_ptr<CompactingBuffers> _compacting_buffers;
void allocMapping() {
auto& data_store = _compacting_buffers->get_store();
_mapping.resize(data_store.get_bufferid_limit_relaxed());
for (const auto bufferId : _compacting_buffers->get_buffer_ids()) {
BufferState &state = data_store.getBufferState(bufferId);
_mapping[bufferId].resize(state.size());
}
}
EntryRef move_on_compact(EntryRef oldRef) override {
RefT iRef(oldRef);
uint32_t buffer_id = iRef.bufferId();
auto &inner_mapping = _mapping[buffer_id];
assert(iRef.offset() < inner_mapping.size());
EntryRef &mappedRef = inner_mapping[iRef.offset()];
assert(!mappedRef.valid());
EntryRef newRef = _store.move_on_compact(oldRef);
mappedRef = newRef;
return newRef;
}
void fillMapping() {
_dict.move_keys_on_compact(*this, _filter);
}
public:
CompactionContext(IUniqueStoreDictionary &dict,
ICompactable &store,
std::unique_ptr<CompactingBuffers> compacting_buffers)
: UniqueStoreRemapper<RefT>(compacting_buffers->make_entry_ref_filter()),
ICompactable(),
_dict(dict),
_store(store),
_compacting_buffers(std::move(compacting_buffers))
{
if (!_compacting_buffers->empty()) {
allocMapping();
fillMapping();
}
}
void done() override {
_compacting_buffers->finish();
}
~CompactionContext() override {
assert(_compacting_buffers->empty());
}
};
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
std::unique_ptr<typename UniqueStore<EntryT, RefT, Comparator, Allocator>::Remapper>
UniqueStore<EntryT, RefT, Comparator, Allocator>::compact_worst(CompactionSpec compaction_spec, const CompactionStrategy& compaction_strategy)
{
auto compacting_buffers = _store.start_compact_worst_buffers(compaction_spec, compaction_strategy);
if (compacting_buffers->empty()) {
return std::unique_ptr<Remapper>();
} else {
return std::make_unique<uniquestore::CompactionContext<RefT>>(*_dict, _allocator, std::move(compacting_buffers));
}
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
vespalib::MemoryUsage
UniqueStore<EntryT, RefT, Comparator, Allocator>::getMemoryUsage() const
{
vespalib::MemoryUsage usage = get_values_memory_usage();
usage.merge(get_dictionary_memory_usage());
return usage;
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
vespalib::AddressSpace
UniqueStore<EntryT, RefT, Comparator, Allocator>::get_values_address_space_usage() const
{
return _allocator.get_data_store().getAddressSpaceUsage();
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
const BufferState &
UniqueStore<EntryT, RefT, Comparator, Allocator>::bufferState(EntryRef ref) const
{
RefT internalRef(ref);
return _store.getBufferState(internalRef.bufferId());
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
void
UniqueStore<EntryT, RefT, Comparator, Allocator>::assign_generation(generation_t current_gen)
{
_dict->assign_generation(current_gen);
_store.assign_generation(current_gen);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
void
UniqueStore<EntryT, RefT, Comparator, Allocator>::reclaim_memory(generation_t oldest_used_gen)
{
_dict->reclaim_memory(oldest_used_gen);
_store.reclaim_memory(oldest_used_gen);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
void
UniqueStore<EntryT, RefT, Comparator, Allocator>::freeze()
{
_dict->freeze();
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
typename UniqueStore<EntryT, RefT, Comparator, Allocator>::Builder
UniqueStore<EntryT, RefT, Comparator, Allocator>::getBuilder(uint32_t uniqueValuesHint)
{
return Builder(_allocator, *_dict, uniqueValuesHint);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
typename UniqueStore<EntryT, RefT, Comparator, Allocator>::Enumerator
UniqueStore<EntryT, RefT, Comparator, Allocator>::getEnumerator(bool sort_unique_values)
{
return Enumerator(*_dict, _store, sort_unique_values);
}
template <typename EntryT, typename RefT, typename Comparator, typename Allocator>
uint32_t
UniqueStore<EntryT, RefT, Comparator, Allocator>::getNumUniques() const
{
return _dict->get_num_uniques();
}
}
|
