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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "array_store.h"
#include "compacting_buffers.h"
#include "compaction_context.h"
#include "compaction_strategy.h"
#include "datastore.hpp"
#include "entry_ref_filter.h"
#include "large_array_buffer_type.hpp"
#include "small_array_buffer_type.hpp"
#include <algorithm>
#include <atomic>
namespace vespalib::datastore {
template <typename EntryT, typename RefT, typename TypeMapperT>
void
ArrayStore<EntryT, RefT, TypeMapperT>::initArrayTypes(const ArrayStoreConfig &cfg, std::shared_ptr<alloc::MemoryAllocator> memory_allocator)
{
_largeArrayTypeId = _store.addType(&_largeArrayType);
assert(_largeArrayTypeId == 0);
_smallArrayTypes.reserve(_maxSmallArrayTypeId);
for (uint32_t type_id = 1; type_id <= _maxSmallArrayTypeId; ++type_id) {
const AllocSpec &spec = cfg.spec_for_type_id(type_id);
size_t arraySize = _mapper.get_array_size(type_id);
_smallArrayTypes.emplace_back(arraySize, spec, memory_allocator, _mapper);
uint32_t act_type_id = _store.addType(&_smallArrayTypes.back());
assert(type_id == act_type_id);
}
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ArrayStore<EntryT, RefT, TypeMapperT>::ArrayStore(const ArrayStoreConfig &cfg, std::shared_ptr<alloc::MemoryAllocator> memory_allocator)
: ArrayStore(cfg, memory_allocator, TypeMapper())
{
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ArrayStore<EntryT, RefT, TypeMapperT>::ArrayStore(const ArrayStoreConfig &cfg, std::shared_ptr<alloc::MemoryAllocator> memory_allocator,
TypeMapper&& mapper)
: _largeArrayTypeId(0),
_maxSmallArrayTypeId(cfg.maxSmallArrayTypeId()),
_maxSmallArraySize(mapper.get_array_size(_maxSmallArrayTypeId)),
_store(),
_mapper(std::move(mapper)),
_smallArrayTypes(),
_largeArrayType(cfg.spec_for_type_id(0), memory_allocator, _mapper),
_compaction_spec()
{
initArrayTypes(cfg, std::move(memory_allocator));
_store.init_primary_buffers();
if (cfg.enable_free_lists()) {
_store.enableFreeLists();
}
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ArrayStore<EntryT, RefT, TypeMapperT>::~ArrayStore()
{
_store.reclaim_all_memory();
_store.dropBuffers();
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::add(const ConstArrayRef &array)
{
if (array.size() == 0) {
return EntryRef();
}
if (array.size() <= _maxSmallArraySize) {
return addSmallArray(array);
} else {
return addLargeArray(array);
}
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::allocate(size_t array_size)
{
if (array_size == 0) {
return EntryRef();
}
if (array_size <= _maxSmallArraySize) {
return allocate_small_array(array_size);
} else {
return allocate_large_array(array_size);
}
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::addSmallArray(const ConstArrayRef &array)
{
uint32_t typeId = _mapper.get_type_id(array.size());
using NoOpReclaimer = DefaultReclaimer<EntryT>;
return _store.template freeListAllocator<EntryT, NoOpReclaimer>(typeId).allocArray(array).ref;
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::allocate_small_array(size_t array_size)
{
uint32_t type_id = _mapper.get_type_id(array_size);
return _store.template freeListRawAllocator<EntryT>(type_id).alloc(array_size).ref;
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::addLargeArray(const ConstArrayRef &array)
{
using NoOpReclaimer = DefaultReclaimer<LargeArray>;
auto handle = _store.template freeListAllocator<LargeArray, NoOpReclaimer>(_largeArrayTypeId)
.alloc(array.cbegin(), array.cend());
auto& state = _store.getBufferState(RefT(handle.ref).bufferId());
state.stats().inc_extra_used_bytes(sizeof(EntryT) * array.size());
return handle.ref;
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::allocate_large_array(size_t array_size)
{
using NoOpReclaimer = DefaultReclaimer<LargeArray>;
auto handle = _store.template freeListAllocator<LargeArray, NoOpReclaimer>(_largeArrayTypeId).alloc(array_size);
auto& state = _store.getBufferState(RefT(handle.ref).bufferId());
state.stats().inc_extra_used_bytes(sizeof(EntryT) * array_size);
return handle.ref;
}
template <typename EntryT, typename RefT, typename TypeMapperT>
void
ArrayStore<EntryT, RefT, TypeMapperT>::remove(EntryRef ref)
{
if (ref.valid()) {
RefT internalRef(ref);
uint32_t typeId = _store.getTypeId(internalRef.bufferId());
if (typeId != _largeArrayTypeId) {
size_t arraySize = _mapper.get_array_size(typeId);
_store.holdElem(ref, arraySize);
} else {
_store.holdElem(ref, 1, sizeof(EntryT) * get(ref).size());
}
}
}
template <typename EntryT, typename RefT, typename TypeMapperT>
EntryRef
ArrayStore<EntryT, RefT, TypeMapperT>::move_on_compact(EntryRef ref)
{
return add(get(ref));
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ICompactionContext::UP
ArrayStore<EntryT, RefT, TypeMapperT>::compact_worst(const CompactionStrategy &compaction_strategy)
{
auto compacting_buffers = _store.start_compact_worst_buffers(_compaction_spec, compaction_strategy);
return std::make_unique<CompactionContext>(*this, std::move(compacting_buffers));
}
template <typename EntryT, typename RefT, typename TypeMapperT>
std::unique_ptr<CompactingBuffers>
ArrayStore<EntryT, RefT, TypeMapperT>::start_compact_worst_buffers(const CompactionStrategy &compaction_strategy)
{
return _store.start_compact_worst_buffers(_compaction_spec, compaction_strategy);
}
template <typename EntryT, typename RefT, typename TypeMapperT>
vespalib::AddressSpace
ArrayStore<EntryT, RefT, TypeMapperT>::addressSpaceUsage() const
{
return _store.getAddressSpaceUsage();
}
template <typename EntryT, typename RefT, typename TypeMapperT>
vespalib::MemoryUsage
ArrayStore<EntryT, RefT, TypeMapperT>::update_stat(const CompactionStrategy& compaction_strategy)
{
auto address_space_usage = _store.getAddressSpaceUsage();
auto memory_usage = _store.getMemoryUsage();
_compaction_spec = compaction_strategy.should_compact(memory_usage, address_space_usage);
return memory_usage;
}
template <typename EntryT, typename RefT, typename TypeMapperT>
const BufferState &
ArrayStore<EntryT, RefT, TypeMapperT>::bufferState(EntryRef ref) const
{
RefT internalRef(ref);
return _store.getBufferState(internalRef.bufferId());
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ArrayStoreConfig
ArrayStore<EntryT, RefT, TypeMapperT>::optimizedConfigForHugePage(uint32_t maxSmallArrayTypeId,
size_t hugePageSize,
size_t smallPageSize,
size_t minNumArraysForNewBuffer,
float allocGrowFactor)
{
TypeMapper mapper;
return optimizedConfigForHugePage(maxSmallArrayTypeId,
mapper,
hugePageSize,
smallPageSize,
minNumArraysForNewBuffer,
allocGrowFactor);
}
template <typename EntryT, typename RefT, typename TypeMapperT>
ArrayStoreConfig
ArrayStore<EntryT, RefT, TypeMapperT>::optimizedConfigForHugePage(uint32_t maxSmallArrayTypeId,
const TypeMapper& mapper,
size_t hugePageSize,
size_t smallPageSize,
size_t minNumArraysForNewBuffer,
float allocGrowFactor)
{
return ArrayStoreConfig::optimizeForHugePage(maxSmallArrayTypeId,
[&](uint32_t type_id) noexcept { return mapper.get_array_size(type_id); },
hugePageSize,
smallPageSize,
sizeof(EntryT),
RefT::offsetSize(),
minNumArraysForNewBuffer,
allocGrowFactor);
}
}
|
