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
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#pragma once
#include "HybridAllocator.h"
#define dout_context (T::get_context())
#define dout_subsys ceph_subsys_bluestore
#undef dout_prefix
#define dout_prefix *_dout << (std::string(this->get_type()) + "::")
template <typename T>
int64_t HybridAllocatorBase<T>::allocate(
uint64_t want,
uint64_t unit,
uint64_t max_alloc_size,
int64_t hint,
PExtentVector* extents)
{
dout(10) << __func__ << std::hex
<< " 0x" << want
<< "/" << unit
<< "," << max_alloc_size
<< "," << hint
<< std::dec << dendl;
ceph_assert(std::has_single_bit(unit));
ceph_assert(want % unit == 0);
if (max_alloc_size == 0) {
max_alloc_size = want;
}
if (constexpr auto cap = std::numeric_limits<uint32_t>::max();
max_alloc_size >= cap) {
max_alloc_size = p2align(uint64_t(cap), (uint64_t)T::get_block_size());
}
std::lock_guard l(T::get_lock());
// try bitmap first to avoid unneeded contiguous extents split if
// desired amount is less than shortes range in AVL or Btree2
bool primary_first = !(bmap_alloc &&
bmap_alloc->get_free() &&
want < T::_lowest_size_available());
int64_t res = _allocate_or_rollback(primary_first,
want, unit, max_alloc_size, hint, extents);
ceph_assert(res >= 0);
if ((uint64_t)res < want) {
auto orig_size = extents->size();
int64_t res2 = 0;
// try alternate allocator
if (!primary_first) {
res2 = T::_allocate(want - res, unit, max_alloc_size, hint, extents);
} else if (bmap_alloc) {
res2 =
bmap_alloc->allocate(want - res, unit, max_alloc_size, hint, extents);
}
if (res2 >= 0) {
res += res2;
} else {
// allocator shouldn't return new extents on error
ceph_assert(orig_size == extents->size());
}
}
return res ? res : -ENOSPC;
}
template <typename T>
void HybridAllocatorBase<T>::dump()
{
std::lock_guard l(T::get_lock());
T::_dump();
if (bmap_alloc) {
bmap_alloc->dump();
}
dout(0) << __func__
<< " avl_free: " << T::_get_free()
<< " bmap_free: " << (bmap_alloc ? bmap_alloc->get_free() : 0)
<< dendl;
}
template <typename T>
void HybridAllocatorBase<T>::init_rm_free(uint64_t offset, uint64_t length)
{
if (!length)
return;
std::lock_guard l(T::get_lock());
dout(10) << __func__ << std::hex
<< " offset 0x" << offset
<< " length 0x" << length
<< std::dec << dendl;
T::_try_remove_from_tree(offset, length,
[&](uint64_t o, uint64_t l, bool found) {
if (!found) {
if (bmap_alloc) {
bmap_alloc->init_rm_free(o, l);
} else {
derr << __func__ << " lambda " << std::hex
<< "Uexpected extent: "
<< " 0x" << o << "~" << l
<< std::dec << dendl;
ceph_assert(false);
}
}
});
}
template <typename T>
void HybridAllocatorBase<T>::_spillover_range(uint64_t start, uint64_t end)
{
auto size = end - start;
dout(20) << __func__
<< std::hex << " "
<< start << "~" << size
<< std::dec
<< dendl;
ceph_assert(size);
if (!bmap_alloc) {
dout(1) << __func__
<< " constructing fallback allocator"
<< dendl;
bmap_alloc = new BitmapAllocator(T::get_context(),
T::get_capacity(),
T::get_block_size(),
T::get_name() + ".fallback");
}
bmap_alloc->init_add_free(start, size);
}
template <typename T>
uint64_t HybridAllocatorBase<T>::_spillover_allocate(uint64_t want,
uint64_t unit,
uint64_t max_alloc_size,
int64_t hint,
PExtentVector* extents)
{
return _allocate_or_rollback(false,
want,
unit,
max_alloc_size,
hint,
extents);
}
template <typename PrimaryAllocator>
uint64_t HybridAllocatorBase<PrimaryAllocator>::_allocate_or_rollback(
bool primary,
uint64_t want,
uint64_t unit,
uint64_t max_alloc_size,
int64_t hint,
PExtentVector* extents)
{
int64_t res = 0;
ceph_assert(extents);
// preserve original 'extents' vector state
auto orig_size = extents->size();
if (primary) {
res = PrimaryAllocator::_allocate(want, unit, max_alloc_size, hint, extents);
} else if (bmap_alloc) {
res = bmap_alloc->allocate(want, unit, max_alloc_size, hint, extents);
}
if (res < 0) {
// got a failure, release already allocated
PExtentVector local_extents;
PExtentVector* e = extents;
if (orig_size) {
local_extents.insert(
local_extents.end(), extents->begin() + orig_size, extents->end());
e = &local_extents;
}
if (e->size()) {
if(primary) {
PrimaryAllocator::_release(*e);
} else if (bmap_alloc) {
bmap_alloc->release(*e);
}
}
extents->resize(orig_size);
res = 0;
}
return (uint64_t)res;
}
|
