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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "rcuvector.h"
#include <vespa/vespalib/util/array.hpp>
#include <cassert>
namespace vespalib {
template <typename T>
RcuVectorHeld<T>::RcuVectorHeld(size_t size, T&& data)
: GenerationHeldBase(size),
_data(std::move(data))
{ }
template <typename T>
RcuVectorHeld<T>::~RcuVectorHeld() = default;
template <typename T>
size_t RcuVectorBase<T>::calcNewSize(size_t baseSize) const {
size_t delta = (baseSize * _growStrategy.getGrowFactor()) + _growStrategy.getGrowDelta();
size_t newSize = baseSize + std::max(delta, static_cast<size_t>(1));
return std::max(newSize, _growStrategy.getMinimumCapacity());
}
template <typename T>
size_t RcuVectorBase<T>::calcNewSize() const {
return calcNewSize(_data.capacity());
}
template <typename T>
void
RcuVectorBase<T>::unsafe_resize(size_t n) {
_data.resize(n);
update_vector_start();
}
template <typename T>
void
RcuVectorBase<T>::unsafe_reserve(size_t n) {
_data.reserve(n);
update_vector_start();
}
template <typename T>
void
RcuVectorBase<T>::ensure_size(size_t n, T fill) {
reserve(n);
while (size() < n) {
_data.push_back(fill);
}
}
template <typename T>
void
RcuVectorBase<T>::reset() {
// Assumes no readers at this moment
_data.reset();
_data.reserve(16);
}
template <typename T>
RcuVectorBase<T>::~RcuVectorBase() = default;
template <typename T>
void
RcuVectorBase<T>::expand(size_t newCapacity) {
auto tmpData = create_replacement_vector();
tmpData.reserve(newCapacity);
for (const T & v : _data) {
tmpData.push_back_fast(v);
}
replaceVector(std::move(tmpData));
}
template <typename T>
void
RcuVectorBase<T>::replaceVector(ArrayType replacement) {
std::atomic_thread_fence(std::memory_order_release);
replacement.swap(_data); // atomic switch of underlying data
size_t holdSize = replacement.capacity() * sizeof(T);
auto hold = std::make_unique<RcuVectorHeld<ArrayType>>(holdSize, std::move(replacement));
_genHolder.hold(std::move(hold));
onReallocation();
}
template <typename T>
void
RcuVectorBase<T>::expandAndInsert(const T & v)
{
expand(calcNewSize());
assert(_data.size() < _data.capacity());
_data.push_back(v);
}
template <typename T>
void
RcuVectorBase<T>::shrink(size_t newSize)
{
assert(newSize <= _data.size());
_data.resize(newSize);
size_t wantedCapacity = calcNewSize(newSize);
if (wantedCapacity >= _data.capacity()) {
return;
}
if (!_data.try_unreserve(wantedCapacity)) {
auto tmpData = create_replacement_vector();
tmpData.reserve(wantedCapacity);
tmpData.resize(newSize);
for (uint32_t i = 0; i < newSize; ++i) {
tmpData[i] = _data[i];
}
std::atomic_thread_fence(std::memory_order_release);
// Users of RCU vector must ensure that no readers use old size
// after swap. Attribute vectors uses _committedDocIdLimit for this.
tmpData.swap(_data); // atomic switch of underlying data
size_t holdSize = tmpData.capacity() * sizeof(T);
auto hold = std::make_unique<RcuVectorHeld<ArrayType>>(holdSize, std::move(tmpData));
_genHolder.hold(std::move(hold));
onReallocation();
}
}
template <typename T>
RcuVectorBase<T>::RcuVectorBase(GrowStrategy growStrategy,
GenerationHolderType &genHolder,
const Alloc &initialAlloc)
: _data(initialAlloc),
_vector_start(nullptr),
_growStrategy(growStrategy),
_genHolder(genHolder)
{
_data.reserve(_growStrategy.getInitialCapacity());
update_vector_start();
}
template <typename T>
MemoryUsage
RcuVectorBase<T>::getMemoryUsage() const
{
MemoryUsage retval;
retval.incAllocatedBytes(_data.capacity() * sizeof(T));
retval.incUsedBytes(_data.size() * sizeof(T));
return retval;
}
template <typename T>
void
RcuVectorBase<T>::update_vector_start()
{
_vector_start.store(_data.data(), std::memory_order_release);
}
template <typename T>
void
RcuVectorBase<T>::onReallocation()
{
update_vector_start();
}
template <typename T>
void
RcuVector<T>::onReallocation() {
RcuVectorBase<T>::onReallocation();
_genHolderStore.transferHoldLists(_generation);
}
template <typename T>
RcuVector<T>::RcuVector()
: RcuVectorBase<T>(GrowStrategy(16, 1.0, 0, 0), _genHolderStore),
_generation(0),
_genHolderStore()
{ }
template <typename T>
RcuVector<T>::RcuVector(GrowStrategy growStrategy)
: RcuVectorBase<T>(growStrategy, _genHolderStore),
_generation(0),
_genHolderStore()
{ }
template <typename T>
RcuVector<T>::~RcuVector()
{
_genHolderStore.clearHoldLists();
}
template <typename T>
void
RcuVector<T>::removeOldGenerations(generation_t firstUsed)
{
_genHolderStore.trimHoldLists(firstUsed);
}
template <typename T>
MemoryUsage
RcuVector<T>::getMemoryUsage() const
{
MemoryUsage retval(RcuVectorBase<T>::getMemoryUsage());
retval.mergeGenerationHeldBytes(_genHolderStore.getHeldBytes());
return retval;
}
}
|
