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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "dynamic_array_buffer_type.h"
#include "aligner.h"
#include <algorithm>
#include <cassert>
namespace vespalib::datastore {
template <typename ElemT>
DynamicArrayBufferType<ElemT>::DynamicArrayBufferType(uint32_t array_size, uint32_t min_entries, uint32_t max_entries,
uint32_t num_entries_for_new_buffer, float allocGrowFactor) noexcept
: BufferTypeBase(calc_entry_size(array_size), array_size, min_entries, max_entries, num_entries_for_new_buffer, allocGrowFactor)
{ }
template <typename ElemT>
DynamicArrayBufferType<ElemT>::~DynamicArrayBufferType() = default;
template <typename ElemT>
size_t
DynamicArrayBufferType<ElemT>::calc_entry_size(size_t array_size) noexcept
{
Aligner aligner(std::max(alignof(uint32_t), alignof(ElemType)));
return aligner.align(sizeof(ElemType) * array_size + sizeof(uint32_t));
}
template <typename ElemT>
size_t
DynamicArrayBufferType<ElemT>::calc_array_size(size_t entry_size) noexcept
{
return (entry_size - sizeof(uint32_t)) / sizeof(ElemType);
}
template <typename ElemT>
void
DynamicArrayBufferType<ElemT>::destroy_entries(void* buffer, EntryCount num_entries)
{
uint32_t array_size = _arraySize;
for (uint32_t entry_idx = 0; entry_idx < num_entries; ++entry_idx) {
auto e = get_entry(buffer, entry_idx);
for (uint32_t elem_idx = 0; elem_idx < array_size; ++elem_idx) {
e->~ElemType();
++e;
}
}
}
template <typename ElemT>
void
DynamicArrayBufferType<ElemT>::fallback_copy(void* new_buffer, const void* old_buffer, EntryCount num_entries)
{
uint32_t array_size = _arraySize;
for (uint32_t entry_idx = 0; entry_idx < num_entries; ++entry_idx) {
auto d = get_entry(new_buffer, entry_idx);
auto s = get_entry(old_buffer, entry_idx);
set_dynamic_array_size(d, entry_size(), get_dynamic_array_size(s, entry_size()));
for (uint32_t elem_idx = 0; elem_idx < array_size; ++elem_idx) {
new (static_cast<void*>(d)) ElemType(*s);
++s;
++d;
}
}
}
template <typename ElemT>
void
DynamicArrayBufferType<ElemT>::initialize_reserved_entries(void* buffer, EntryCount reserved_entries)
{
uint32_t array_size = _arraySize;
const auto& empty = empty_entry();
for (uint32_t entry_idx = 0; entry_idx < reserved_entries; ++entry_idx) {
auto e = get_entry(buffer, entry_idx);
set_dynamic_array_size(e, entry_size(), 0);
for (uint32_t elem_idx = 0; elem_idx < array_size; ++elem_idx) {
new (static_cast<void*>(e)) ElemType(empty);
++e;
}
}
}
template <typename ElemT>
void
DynamicArrayBufferType<ElemT>::clean_hold(void* buffer, size_t offset, EntryCount num_entries, CleanContext)
{
uint32_t max_array_size = _arraySize;
const auto& empty = empty_entry();
for (uint32_t entry_idx = 0; entry_idx < num_entries; ++entry_idx) {
auto e = get_entry(buffer, offset + entry_idx);
auto array_size = get_dynamic_array_size(e, entry_size());
assert(array_size <= max_array_size);
for (uint32_t elem_idx = 0; elem_idx < array_size; ++elem_idx) {
*e = empty;
++e;
}
}
}
template <typename ElemT>
const ElemT&
DynamicArrayBufferType<ElemT>::empty_entry() noexcept
{
// It's possible for ElemType to wrap e.g. an Alloc instance, which has a transitive
// dependency on globally constructed allocator object(s). To avoid issues with global
// construction order, initialize the sentinel on the first access.
static ElemType empty = ElemType();
return empty;
}
}
|
