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
|
// Copyright 2017 Yahoo Holdings. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "datastore.h"
#include "allocator.hpp"
#include "free_list_allocator.hpp"
#include "raw_allocator.hpp"
#include <vespa/vespalib/util/array.hpp>
namespace search {
namespace datastore {
template <typename RefT>
DataStoreT<RefT>::DataStoreT()
: DataStoreBase(RefType::numBuffers(),
RefType::offsetSize() / RefType::align(1))
{
}
template <typename RefT>
DataStoreT<RefT>::~DataStoreT()
{
}
template <typename RefT>
void
DataStoreT<RefT>::freeElem(EntryRef ref, uint64_t len)
{
RefType intRef(ref);
BufferState &state = getBufferState(intRef.bufferId());
if (state.isActive()) {
if (state.freeListList() != NULL && len == state.getClusterSize()) {
if (state.freeList().empty()) {
state.addToFreeListList();
}
state.freeList().push_back(ref);
}
} else {
assert(state.isOnHold());
}
state.incDeadElems(len);
state.cleanHold(getBuffer(intRef.bufferId()),
(intRef.offset() / RefType::align(1)) *
state.getClusterSize(), len);
}
template <typename RefT>
void
DataStoreT<RefT>::holdElem(EntryRef ref, uint64_t len, size_t extraBytes)
{
RefType intRef(ref);
uint64_t alignedLen = RefType::align(len);
BufferState &state = getBufferState(intRef.bufferId());
assert(state.isActive());
if (state.hasDisabledElemHoldList()) {
state.incDeadElems(alignedLen);
return;
}
_elemHold1List.push_back(ElemHold1ListElem(ref, alignedLen));
state.incHoldElems(alignedLen);
state.incExtraHoldBytes(extraBytes);
}
template <typename RefT>
void
DataStoreT<RefT>::trimElemHoldList(generation_t usedGen)
{
ElemHold2List &elemHold2List = _elemHold2List;
ElemHold2List::iterator it(elemHold2List.begin());
ElemHold2List::iterator ite(elemHold2List.end());
uint32_t freed = 0;
for (; it != ite; ++it) {
if (static_cast<sgeneration_t>(it->_generation - usedGen) >= 0)
break;
RefType intRef(it->_ref);
BufferState &state = getBufferState(intRef.bufferId());
freeElem(it->_ref, it->_len);
state.decHoldElems(it->_len);
++freed;
}
if (freed != 0) {
elemHold2List.erase(elemHold2List.begin(), it);
}
}
template <typename RefT>
void
DataStoreT<RefT>::clearElemHoldList()
{
ElemHold2List &elemHold2List = _elemHold2List;
ElemHold2List::iterator it(elemHold2List.begin());
ElemHold2List::iterator ite(elemHold2List.end());
for (; it != ite; ++it) {
RefType intRef(it->_ref);
BufferState &state = getBufferState(intRef.bufferId());
freeElem(it->_ref, it->_len);
state.decHoldElems(it->_len);
}
elemHold2List.clear();
}
template <typename RefT>
template <typename EntryT>
Allocator<EntryT, RefT>
DataStoreT<RefT>::allocator(uint32_t typeId)
{
return Allocator<EntryT, RefT>(*this, typeId);
}
template <typename RefT>
template <typename EntryT, typename ReclaimerT>
FreeListAllocator<EntryT, RefT, ReclaimerT>
DataStoreT<RefT>::freeListAllocator(uint32_t typeId)
{
return FreeListAllocator<EntryT, RefT, ReclaimerT>(*this, typeId);
}
template <typename RefT>
template <typename EntryT>
RawAllocator<EntryT, RefT>
DataStoreT<RefT>::rawAllocator(uint32_t typeId)
{
return RawAllocator<EntryT, RefT>(*this, typeId);
}
template <typename EntryType, typename RefT>
DataStore<EntryType, RefT>::DataStore()
: ParentType(),
_type(1, RefType::offsetSize(), RefType::offsetSize())
{
addType(&_type);
initActiveBuffers();
}
template <typename EntryType, typename RefT>
DataStore<EntryType, RefT>::~DataStore()
{
dropBuffers(); // Drop buffers before type handlers are dropped
}
template <typename EntryType, typename RefT>
EntryRef
DataStore<EntryType, RefT>::addEntry(const EntryType &e)
{
ensureBufferCapacity(0, 1);
uint32_t activeBufferId = _activeBufferIds[0];
BufferState &state = this->getBufferState(activeBufferId);
size_t oldSize = state.size();
EntryType *be = static_cast<EntryType *>(this->getBuffer(activeBufferId)) + oldSize;
new (static_cast<void *>(be)) EntryType(e);
RefType ref(oldSize, activeBufferId);
state.pushed_back(1);
return ref;
}
template <typename EntryType, typename RefT>
EntryRef
DataStore<EntryType, RefT>::addEntry2(const EntryType &e)
{
BufferState::FreeListList &freeListList = _freeListLists[0];
if (freeListList._head == NULL)
return addEntry(e);
BufferState &state = *freeListList._head;
assert(state.isActive());
RefType ref(state.popFreeList());
EntryType *be =
this->template
getBufferEntry<EntryType>(ref.bufferId(), ref.offset());
*be = e;
return ref;
}
template <typename EntryType, typename RefT>
const EntryType &
DataStore<EntryType, RefT>::getEntry(EntryRef ref) const
{
RefType intRef(ref);
const EntryType *be =
this->template
getBufferEntry<EntryType>(intRef.bufferId(), intRef.offset());
return *be;
}
extern template class DataStoreT<EntryRefT<22> >;
} // namespace search::datastore
} // namespace search
|
