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
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
|
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
#include "HybridAllocator.h"
#include <bit>
#include <limits>
#include "common/config_proxy.h"
#include "common/debug.h"
#define dout_context cct
#define dout_subsys ceph_subsys_bluestore
#undef dout_prefix
#define dout_prefix *_dout << "HybridAllocator "
int64_t HybridAllocator::allocate(
uint64_t want,
uint64_t unit,
uint64_t max_alloc_size,
int64_t hint,
PExtentVector* extents)
{
ldout(cct, 10) << __func__ << std::hex
<< " want 0x" << want
<< " unit 0x" << unit
<< " max_alloc_size 0x" << max_alloc_size
<< " hint 0x" << 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<decltype(bluestore_pextent_t::length)>::max();
max_alloc_size >= cap) {
max_alloc_size = p2align(uint64_t(cap), (uint64_t)get_block_size());
}
std::lock_guard l(lock);
int64_t res;
PExtentVector local_extents;
// preserve original 'extents' vector state
auto orig_size = extents->size();
auto orig_pos = extents->end();
if (orig_size) {
--orig_pos;
}
// try bitmap first to avoid unneeded contiguous extents split if
// desired amount is less than shortes range in AVL
if (bmap_alloc && bmap_alloc->get_free() &&
want < _lowest_size_available()) {
res = bmap_alloc->allocate(want, unit, max_alloc_size, hint, extents);
if (res < 0) {
// got a failure, release already allocated and
// start over allocation from avl
if (orig_size) {
local_extents.insert(
local_extents.end(), ++orig_pos, extents->end());
extents->resize(orig_size);
} else {
extents->swap(local_extents);
}
bmap_alloc->release(local_extents);
res = 0;
}
if ((uint64_t)res < want) {
auto res2 = _allocate(want - res, unit, max_alloc_size, hint, extents);
if (res2 < 0) {
res = res2; // caller to do the release
} else {
res += res2;
}
}
} else {
res = _allocate(want, unit, max_alloc_size, hint, extents);
if (res < 0) {
// got a failure, release already allocated and
// start over allocation from bitmap
if (orig_size) {
local_extents.insert(
local_extents.end(), ++orig_pos, extents->end());
extents->resize(orig_size);
} else {
extents->swap(local_extents);
}
_release(local_extents);
res = 0;
}
if ((uint64_t)res < want ) {
auto res2 = bmap_alloc ?
bmap_alloc->allocate(want - res, unit, max_alloc_size, hint, extents) :
0;
if (res2 < 0 ) {
res = res2; // caller to do the release
} else {
res += res2;
}
}
}
return res ? res : -ENOSPC;
}
void HybridAllocator::release(const interval_set<uint64_t>& release_set) {
std::lock_guard l(lock);
// this will attempt to put free ranges into AvlAllocator first and
// fallback to bitmap one via _try_insert_range call
_release(release_set);
}
uint64_t HybridAllocator::get_free()
{
std::lock_guard l(lock);
return (bmap_alloc ? bmap_alloc->get_free() : 0) + _get_free();
}
double HybridAllocator::get_fragmentation()
{
std::lock_guard l(lock);
auto f = AvlAllocator::_get_fragmentation();
auto bmap_free = bmap_alloc ? bmap_alloc->get_free() : 0;
if (bmap_free) {
auto _free = _get_free() + bmap_free;
auto bf = bmap_alloc->get_fragmentation();
f = f * _get_free() / _free + bf * bmap_free / _free;
}
return f;
}
void HybridAllocator::dump()
{
std::lock_guard l(lock);
AvlAllocator::_dump();
if (bmap_alloc) {
bmap_alloc->dump();
}
ldout(cct, 0) << __func__
<< " avl_free: " << _get_free()
<< " bmap_free: " << (bmap_alloc ? bmap_alloc->get_free() : 0)
<< dendl;
}
void HybridAllocator::foreach(
std::function<void(uint64_t offset, uint64_t length)> notify)
{
std::lock_guard l(lock);
AvlAllocator::_foreach(notify);
if (bmap_alloc) {
bmap_alloc->foreach(notify);
}
}
void HybridAllocator::init_rm_free(uint64_t offset, uint64_t length)
{
if (!length)
return;
std::lock_guard l(lock);
ldout(cct, 10) << __func__ << std::hex
<< " offset 0x" << offset
<< " length 0x" << length
<< std::dec << dendl;
_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 {
lderr(cct) << "init_rm_free lambda " << std::hex
<< "Uexpected extent: "
<< " 0x" << o << "~" << l
<< std::dec << dendl;
ceph_assert(false);
}
}
});
}
void HybridAllocator::shutdown()
{
std::lock_guard l(lock);
_shutdown();
if (bmap_alloc) {
bmap_alloc->shutdown();
delete bmap_alloc;
bmap_alloc = nullptr;
}
}
void HybridAllocator::_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__
<< std::hex
<< " constructing fallback allocator"
<< dendl;
bmap_alloc = new BitmapAllocator(cct,
get_capacity(),
get_block_size(),
get_name() + ".fallback");
}
bmap_alloc->init_add_free(start, size);
}
void HybridAllocator::_add_to_tree(uint64_t start, uint64_t size)
{
if (bmap_alloc) {
uint64_t head = bmap_alloc->claim_free_to_left(start);
uint64_t tail = bmap_alloc->claim_free_to_right(start + size);
ceph_assert(head <= start);
start -= head;
size += head + tail;
}
AvlAllocator::_add_to_tree(start, size);
}
|
