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
|
// Copyright Yahoo. Licensed under the terms of the Apache 2.0 license. See LICENSE in the project root.
#pragma once
#include "free_list_raw_allocator.h"
namespace vespalib::datastore {
template <typename EntryT, typename RefT>
FreeListRawAllocator<EntryT, RefT>::FreeListRawAllocator(DataStoreBase &store, uint32_t typeId)
: ParentType(store, typeId)
{
}
template <typename EntryT, typename RefT>
typename FreeListRawAllocator<EntryT, RefT>::HandleType
FreeListRawAllocator<EntryT, RefT>::alloc(size_t num_entries)
{
auto& free_list = _store.getFreeList(_typeId);
if (free_list.empty()) {
return ParentType::alloc(num_entries);
}
assert(num_entries == 1);
RefT ref = free_list.pop_entry();
auto& state = _store.getBufferState(ref.bufferId());
auto array_size = state.getArraySize();
// We must scale the offset according to array size as it was divided when the entry ref was created.
EntryT *entry = _store.template getEntryArray<EntryT>(ref, array_size);
return HandleType(ref, entry);
}
template <typename EntryT, typename RefT>
template <typename BufferType>
typename FreeListRawAllocator<EntryT, RefT>::HandleType
FreeListRawAllocator<EntryT, RefT>::alloc_dynamic_array(size_t array_size)
{
auto& free_list = _store.getFreeList(_typeId);
if (free_list.empty()) {
return ParentType::template alloc_dynamic_array<BufferType>(array_size);
}
RefT ref = free_list.pop_entry();
auto entry_size = _store.get_entry_size(_typeId);
assert(_store.getBufferState(ref.bufferId()).getArraySize() >= array_size);
EntryT* entry = BufferType::get_entry(_store.getBuffer(ref.bufferId()), ref.offset(), entry_size);
BufferType::set_dynamic_array_size(entry, array_size);
return HandleType(ref, entry);
}
}
|
