-
Notifications
You must be signed in to change notification settings - Fork 17
Expand file tree
/
Copy pathheap_chunk_selector.cpp
More file actions
633 lines (544 loc) · 27.1 KB
/
Copy pathheap_chunk_selector.cpp
File metadata and controls
633 lines (544 loc) · 27.1 KB
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
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
#include "heap_chunk_selector.h"
#include <execution>
#include <algorithm>
#include <utility>
#include <sisl/logging/logging.h>
namespace homeobject {
// https://github.com/eBay/HomeObject/pull/30#discussion_r1331112743
// we make the following assumptions
// 1 homestore will initialize HeapChunkSelector by adding all the chunks single threaded
// 2 we do not need dynamic chunk requirements
// it means after the single thread initialization,
// 1 the key collection of m_per_dev_heap will never change.
// 2 the key collection of m_chunks will never change
// this should only be called when initializing HeapChunkSelector in Homestore
void HeapChunkSelector::add_chunk(csharedChunk& chunk) {
m_chunks.emplace(VChunk(chunk).get_chunk_id(), std::make_shared< ExtendedVChunk >(chunk));
}
void HeapChunkSelector::add_chunk_internal(const chunk_num_t p_chunk_id, bool add_to_heap) {
// private function p_chunk_id must belong to m_chunks
auto chunk = m_chunks[p_chunk_id];
auto pdevID = chunk->get_pdev_id();
// add this find here, since we don`t want to call make_shared in try_emplace every time.
auto it = m_per_dev_heap.find(pdevID);
if (it == m_per_dev_heap.end()) {
it = m_per_dev_heap.emplace(pdevID, std::make_shared< ChunkHeap >()).first;
it->second->pdev_name = chunk->get_pdev_name();
}
// build total blks for every chunk on this device;
it->second->m_total_blks += chunk->get_total_blks();
if (add_to_heap) {
std::lock_guard< std::mutex > l(it->second->mtx);
auto& heap = it->second->m_heap;
heap.emplace(chunk);
it->second->available_blk_count += chunk->available_blks();
}
}
// select_chunk will only be called in homestore when creating a shard.
csharedChunk HeapChunkSelector::select_chunk(homestore::blk_count_t count, const homestore::blk_alloc_hints& hint) {
auto& chunkIdHint = hint.chunk_id_hint;
if (chunkIdHint.has_value()) {
LOGWARNMOD(homeobject, "should not allocated a chunk with exiting chunkIdHint={} in hint!",
chunkIdHint.value());
return nullptr;
}
if (!hint.application_hint.has_value()) {
LOGWARNMOD(homeobject, "should not allocated a chunk without exiting application_hint in hint!");
return nullptr;
} else {
// Both chunk_num_t and pg_id_t are of type uint16_t.
static_assert(std::is_same< pg_id_t, uint16_t >::value, "pg_id_t is not uint16_t");
static_assert(std::is_same< homestore::chunk_num_t, uint16_t >::value, "chunk_num_t is not uint16_t");
auto application_hint = hint.application_hint.value();
pg_id_t pg_id = (uint16_t)(application_hint >> 16 & 0xFFFF);
homestore::chunk_num_t v_chunk_id = (uint16_t)(application_hint & 0xFFFF);
return select_specific_chunk(pg_id, v_chunk_id);
}
}
bool HeapChunkSelector::try_mark_chunk_to_gc_state(const chunk_num_t chunk_id, bool force) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto chunk_it = m_chunks.find(chunk_id);
if (chunk_it == m_chunks.end()) {
LOGWARNMOD(homeobject, "No chunk found for chunk_id={}", chunk_id);
return false;
}
auto& chunk_state = chunk_it->second->m_state;
if (chunk_state == ChunkState::GC) {
LOGWARNMOD(homeobject, "gc: chunk is already in gc state, chunk_id={}", chunk_id);
return false; // already in gc state, no need to change
}
if (chunk_state == ChunkState::INUSE && !force) {
LOGWARNMOD(homeobject, "gc: chunk is inuse, chunk_id={}", chunk_id);
return false;
}
chunk_state = ChunkState::GC;
return true;
}
void HeapChunkSelector::mark_chunk_out_of_gc_state(const chunk_num_t chunk_id, const ChunkState final_state,
const uint64_t task_id) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto chunk_it = m_chunks.find(chunk_id);
RELEASE_ASSERT(chunk_it != m_chunks.end(), "chunk_id={} should be in m_chunks, but not found", chunk_id);
auto& chunk_state = chunk_it->second->m_state;
RELEASE_ASSERT(chunk_state == ChunkState::GC, "chunk_id={} should be in gc state, but in {} state", chunk_id,
chunk_state);
chunk_state = final_state;
LOGDEBUGMOD(homeobject, "gc task_id={}, chunk_id={} is marked out of gc state, final_state={}", task_id, chunk_id,
final_state);
}
csharedChunk HeapChunkSelector::select_specific_chunk(const pg_id_t pg_id, const chunk_num_t v_chunk_id) {
homestore::shared< ExtendedVChunk > chunk;
while (true) {
{
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return nullptr;
}
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
std::scoped_lock lock(pg_chunk_collection->mtx);
if (v_chunk_id >= pg_chunks.size()) {
LOGWARNMOD(homeobject, "No chunk found for v_chunk_id={}", v_chunk_id);
return nullptr;
}
chunk = pg_chunks[v_chunk_id];
if (chunk->m_state == ChunkState::GC) {
LOGDEBUGMOD(homeobject, "v_chunk_id={} for pg={} is pchunk_id={}, in GC state, wait and retry!",
v_chunk_id, pg_id, chunk->get_chunk_id());
} else {
if (chunk->m_state == ChunkState::AVAILABLE) {
chunk->m_state = ChunkState::INUSE;
--pg_chunk_collection->available_num_chunks;
pg_chunk_collection->available_blk_count -= chunk->available_blks();
}
break;
}
}
// if the chunk is not available, probably being gc. we wait for a while and retry
std::this_thread::sleep_for(std::chrono::seconds(1));
}
LOGDEBUGMOD(homeobject, "chunk={} is selected for v_chunk_id={}, pg={}", chunk->get_chunk_id(), v_chunk_id, pg_id);
return chunk->get_internal_chunk();
}
void HeapChunkSelector::foreach_chunks(std::function< void(csharedChunk&) >&& cb) {
// we should call `cb` on all the chunks, selected or not
std::for_each(std::execution::par_unseq, m_chunks.begin(), m_chunks.end(),
[cb = std::move(cb)](auto& p) { cb(p.second->get_internal_chunk()); });
}
bool HeapChunkSelector::release_chunk(const pg_id_t pg_id, const chunk_num_t v_chunk_id) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return false;
}
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
if (v_chunk_id >= pg_chunks.size()) {
LOGWARNMOD(homeobject, "No chunk found for v_chunk_id={}", v_chunk_id);
return false;
}
std::scoped_lock lock(pg_chunk_collection->mtx);
auto chunk = pg_chunks[v_chunk_id];
if (chunk->m_state == ChunkState::INUSE) {
chunk->m_state = ChunkState::AVAILABLE;
++pg_chunk_collection->available_num_chunks;
pg_chunk_collection->available_blk_count += chunk->available_blks();
}
return true;
}
bool HeapChunkSelector::reset_pg_chunks(pg_id_t pg_id) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return false;
}
{
auto pg_chunk_collection = pg_it->second;
std::scoped_lock lock(pg_chunk_collection->mtx);
for (auto& chunk : pg_chunk_collection->m_pg_chunks) {
LOGDEBUGMOD(homeobject, "reset chunk={} in pg={} for destruction", chunk->get_chunk_id(), pg_id);
chunk->reset();
}
}
return true;
}
bool HeapChunkSelector::return_pg_chunks_to_dev_heap(const pg_id_t pg_id) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return false;
}
auto pg_chunk_collection = pg_it->second;
auto pdev_id = pg_chunk_collection->m_pg_chunks[0]->get_pdev_id();
auto pdev_it = m_per_dev_heap.find(pdev_id);
RELEASE_ASSERT(pdev_it != m_per_dev_heap.end(), "pdev_id={} should in per dev heap", pdev_id);
auto pdev_heap = pdev_it->second;
{
std::scoped_lock lock(pdev_heap->mtx, pg_chunk_collection->mtx);
for (auto& chunk : pg_chunk_collection->m_pg_chunks) {
if (chunk->m_state == ChunkState::INUSE) {
chunk->m_state = ChunkState::AVAILABLE;
} // with shard which should be first
chunk->m_pg_id = std::nullopt;
chunk->m_v_chunk_id = std::nullopt;
pdev_heap->m_heap.emplace(chunk);
pdev_heap->available_blk_count += chunk->available_blks();
}
}
m_per_pg_chunks.erase(pg_it);
return true;
}
uint32_t HeapChunkSelector::get_chunk_size() const {
const auto chunk = m_chunks.begin()->second;
return chunk->size();
}
homestore::cshared< HeapChunkSelector::ExtendedVChunk >
HeapChunkSelector::get_pg_vchunk(const pg_id_t pg_id, const chunk_num_t v_chunk_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return nullptr;
}
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
if (v_chunk_id >= pg_chunks.size()) {
LOGWARNMOD(homeobject, "No chunk found for v_chunk_id={}", v_chunk_id);
return nullptr;
}
std::scoped_lock lock(pg_chunk_collection->mtx);
return pg_chunks[v_chunk_id];
}
bool HeapChunkSelector::is_chunk_available(const pg_id_t pg_id, const chunk_num_t v_chunk_id) const {
auto Exvchunk = get_pg_vchunk(pg_id, v_chunk_id);
if (Exvchunk) return Exvchunk->available();
return false;
}
std::optional< uint32_t > HeapChunkSelector::select_chunks_for_pg(pg_id_t pg_id, uint64_t pg_size) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
const auto chunk_size = get_chunk_size();
if (pg_size < chunk_size) {
LOGWARNMOD(homeobject, "pg_size={} is less than chunk_size={}", pg_size, chunk_size);
return std::nullopt;
}
const uint32_t num_chunk = sisl::round_down(pg_size, chunk_size) / chunk_size;
if (m_per_pg_chunks.find(pg_id) != m_per_pg_chunks.end()) {
// leader may call select_chunks_for_pg multiple times
RELEASE_ASSERT(num_chunk == m_per_pg_chunks[pg_id]->m_pg_chunks.size(), "num_chunk should be same");
LOGWARNMOD(homeobject, "PG had already created, pg={}", pg_id);
return num_chunk;
}
// Select a pdev with the most available num chunk
auto most_avail_dev_it = std::max_element(m_per_dev_heap.begin(), m_per_dev_heap.end(),
[](const std::pair< const uint32_t, std::shared_ptr< ChunkHeap > >& lhs,
const std::pair< const uint32_t, std::shared_ptr< ChunkHeap > >& rhs) {
return lhs.second->size() < rhs.second->size();
});
auto& pdev_heap = most_avail_dev_it->second;
if (num_chunk > pdev_heap->size()) {
LOGWARNMOD(homeobject, "Pdev has no enough space to create pg={} with num_chunk={}, available_num_chunk={}",
pg_id, num_chunk, pdev_heap->size());
return std::nullopt;
}
LOGINFOMOD(homeobject, "select pdev[id={}, name={}] for pg_id={}, num_chunk={}", most_avail_dev_it->first,
most_avail_dev_it->second->pdev_name, pg_id, num_chunk);
auto pg_it = m_per_pg_chunks.emplace(pg_id, std::make_shared< PGChunkCollection >()).first;
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
std::scoped_lock lock(pdev_heap->mtx, pg_chunk_collection->mtx);
pg_chunks.reserve(num_chunk);
// v_chunk_id start from 0.
for (chunk_num_t v_chunk_id = 0; v_chunk_id < num_chunk; ++v_chunk_id) {
auto chunk = pdev_heap->m_heap.top();
// sanity check
RELEASE_ASSERT(chunk->get_total_blks() == chunk->available_blks(), "chunk should be empty");
RELEASE_ASSERT(chunk->available(), "chunk state should be available");
pdev_heap->m_heap.pop();
pdev_heap->available_blk_count -= chunk->available_blks();
chunk->m_pg_id = pg_id;
chunk->m_v_chunk_id = v_chunk_id;
pg_chunks.emplace_back(chunk);
++pg_chunk_collection->available_num_chunks;
pg_chunk_collection->m_total_blks += chunk->get_total_blks();
pg_chunk_collection->available_blk_count += chunk->available_blks();
}
return num_chunk;
}
void HeapChunkSelector::update_vchunk_info_after_gc(const chunk_num_t move_from_chunk, const chunk_num_t move_to_chunk,
const ChunkState final_state, const pg_id_t pg_id,
const chunk_num_t vchunk_id, const uint64_t task_id) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
// if the state of move_to_chunk is updated to inuse or available, then it might be selected for gc immediately. if
// we change the state of move_to_chunk before gc_task_sb is destroyed, when crash recovery and redo the gc task,
// the move_to_chunk will probably has new data written into it, which is different from the data we copied from
// move_from_chunk. so, we need to switch the chunk state after gc_task_sb is destroyed.
auto move_to_vchunk = get_extend_vchunk(move_to_chunk);
auto move_from_vchunk = get_extend_vchunk(move_from_chunk);
RELEASE_ASSERT(move_from_vchunk->m_state == ChunkState::GC, "move_from_chunk={} should be in gc state",
move_from_chunk);
RELEASE_ASSERT(move_to_vchunk->m_state == ChunkState::GC, "move_to_chunk={} should be in gc state", move_to_chunk);
RELEASE_ASSERT(!(move_to_vchunk->m_pg_id.has_value()), "move_to_chunk={} should not belongs to a pg",
move_to_chunk);
// 1 change the pg_id and vchunk_id of the move_to_chunk according to metablk
move_to_vchunk->m_pg_id = pg_id;
move_to_vchunk->m_v_chunk_id = vchunk_id;
// 2 update the chunk state of move_from_chunk, now it is a reserved chunk
move_from_vchunk->m_pg_id = std::nullopt;
move_from_vchunk->m_v_chunk_id = std::nullopt;
// 3 update the state of move_to_chunk, so that it can be used for creating shard or putting blob. we need to do
// this after reserved_chunk meta blk is updated, so that if crash happens, we recovery the move_to_chunk is the
// same as that before crash. here, the same means not new put_blob or create_shard happens to it, the data on the
// chunk is the same as before.
move_to_vchunk->m_state = final_state;
LOGDEBUGMOD(homeobject,
"gc task_id={}, update vchunk info after gc, move_to_chunk={} now in pg={}, vchunk={}, state={}",
task_id, move_to_chunk, pg_id, vchunk_id, final_state);
}
void HeapChunkSelector::switch_chunks_for_pg(const pg_id_t pg_id, const chunk_num_t old_chunk_id,
const chunk_num_t new_chunk_id, const uint64_t task_id) {
LOGDEBUGMOD(homeobject, "gc task_id={}, switch chunks for pg_id={}, old_chunk={}, new_chunk={}", task_id, pg_id,
old_chunk_id, new_chunk_id);
auto EXVchunk_old = get_extend_vchunk(old_chunk_id);
auto EXVchunk_new = get_extend_vchunk(new_chunk_id);
auto old_available_blks = EXVchunk_old->available_blks();
auto new_available_blks = EXVchunk_new->available_blks();
RELEASE_ASSERT(EXVchunk_old->m_v_chunk_id.has_value(), "old_chunk_id={} should has a vchunk_id", old_chunk_id);
RELEASE_ASSERT(EXVchunk_old->m_pg_id.has_value(), "old_chunk_id={} should belongs to a pg", old_chunk_id);
RELEASE_ASSERT(EXVchunk_old->m_pg_id.value() == pg_id, "old_chunk_id={} should belongs to pg={}", old_chunk_id,
pg_id);
auto v_chunk_id = EXVchunk_old->m_v_chunk_id.value();
std::unique_lock lock(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
RELEASE_ASSERT(pg_it != m_per_pg_chunks.end(), "No pg_chunk_collection found for pg={}", pg_id);
auto& pg_chunk_collection = pg_it->second;
std::unique_lock lk(pg_chunk_collection->mtx);
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
if (sisl_unlikely(pg_chunks[v_chunk_id]->get_chunk_id() == new_chunk_id)) {
// this might happens when crash recovery. the crash happens after pg metablk is updated but before gc task
// metablk is destroyed.
LOGDEBUGMOD(homeobject,
"gc task_id={}, the pchunk_id for vchunk={} in chunkselector for pg_id={} is already {}, skip "
"switching chunks!",
task_id, v_chunk_id, pg_id, new_chunk_id);
return;
} else {
RELEASE_ASSERT(
pg_chunks[v_chunk_id]->get_chunk_id() == old_chunk_id,
"gc task_id={}, vchunk={} for pg={} in chunkselector should have a pchunk={} , but have a pchunk={}",
task_id, v_chunk_id, pg_id, old_chunk_id, pg_chunks[v_chunk_id]->get_chunk_id());
pg_chunks[v_chunk_id] = EXVchunk_new;
LOGDEBUGMOD(homeobject,
"gc task_id={}, vchunk={} in pg_chunk_collection for pg_id={} has been update from pchunk_id={} to "
"pchunk_id={}",
task_id, v_chunk_id, pg_id, old_chunk_id, new_chunk_id);
}
pg_chunk_collection->available_blk_count += new_available_blks - old_available_blks;
}
bool HeapChunkSelector::recover_pg_chunks(pg_id_t pg_id, std::vector< chunk_num_t >&& p_chunk_ids) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
// check pg exist
if (m_per_pg_chunks.find(pg_id) != m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "pg={} had been recovered", pg_id);
return false;
}
if (p_chunk_ids.size() == 0) {
LOGWARNMOD(homeobject, "Unexpected empty pg={}", pg_id);
return false;
}
// check chunks valid, must belong to m_chunks and have same pdev_id
std::optional< uint32_t > last_pdev_id;
for (auto p_chunk_id : p_chunk_ids) {
auto it = m_chunks.find(p_chunk_id);
if (it == m_chunks.end()) {
LOGWARNMOD(homeobject, "No chunk found for p_chunk_id={}", p_chunk_id);
return false;
}
auto chunk = it->second;
if (last_pdev_id.has_value() && last_pdev_id.value() != chunk->get_pdev_id()) {
LOGWARNMOD(homeobject, "The pdev value is different, last_pdev_id={}, pdev_id={}", last_pdev_id.value(),
chunk->get_pdev_id());
return false;
} else {
last_pdev_id = chunk->get_pdev_id();
}
}
auto pg_it = m_per_pg_chunks.emplace(pg_id, std::make_shared< PGChunkCollection >()).first;
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
std::scoped_lock lock(pg_chunk_collection->mtx);
pg_chunks.reserve(p_chunk_ids.size());
// v_chunk_id start from 0.
for (chunk_num_t v_chunk_id = 0; v_chunk_id < p_chunk_ids.size(); ++v_chunk_id) {
chunk_num_t p_chunk_id = p_chunk_ids[v_chunk_id];
auto chunk = m_chunks[p_chunk_id];
chunk->m_pg_id = pg_id;
chunk->m_v_chunk_id = v_chunk_id;
pg_chunks.emplace_back(chunk);
}
return true;
}
void HeapChunkSelector::build_pdev_available_chunk_heap() {
std::unique_lock lock_guard(m_chunk_selector_mtx);
for (auto [p_chunk_id, chunk] : m_chunks) {
// if selected for pg, or it is marked as GC state(reserved chunk), not add to pdev.
bool add_to_heap = !chunk->m_pg_id.has_value() && chunk->m_state != ChunkState::GC;
add_chunk_internal(p_chunk_id, add_to_heap);
}
}
bool HeapChunkSelector::recover_pg_chunks_states(pg_id_t pg_id,
const std::unordered_set< chunk_num_t >& excluding_v_chunk_ids) {
std::unique_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "PG chunks should be recovered beforhand, pg={}", pg_id);
return false;
}
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
std::scoped_lock lock(pg_chunk_collection->mtx);
for (size_t v_chunk_id = 0; v_chunk_id < pg_chunks.size(); ++v_chunk_id) {
auto chunk = pg_chunks[v_chunk_id];
pg_chunk_collection->m_total_blks += chunk->get_total_blks();
if (excluding_v_chunk_ids.find(v_chunk_id) == excluding_v_chunk_ids.end()) {
chunk->m_state = ChunkState::AVAILABLE;
++pg_chunk_collection->available_num_chunks;
pg_chunk_collection->available_blk_count += chunk->available_blks();
} else {
chunk->m_state = ChunkState::INUSE;
}
}
return true;
}
std::shared_ptr< const std::vector< homestore::chunk_num_t > > HeapChunkSelector::get_pg_chunks(pg_id_t pg_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "pg={} had never been created", pg_id);
return nullptr;
}
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
std::scoped_lock lock(pg_chunk_collection->mtx);
auto p_chunk_ids = std::make_shared< std::vector< homestore::chunk_num_t > >();
p_chunk_ids->reserve(pg_chunks.size());
for (auto chunk : pg_chunks) {
p_chunk_ids->emplace_back(chunk->get_chunk_id());
}
return p_chunk_ids;
}
std::optional< homestore::chunk_num_t > HeapChunkSelector::get_most_available_blk_chunk(uint64_t ctx, pg_id_t pg_id) {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return std::nullopt;
}
std::scoped_lock lock(pg_it->second->mtx);
auto pg_chunk_collection = pg_it->second;
auto& pg_chunks = pg_chunk_collection->m_pg_chunks;
auto max_it =
std::max_element(pg_chunks.begin(), pg_chunks.end(),
[](const std::shared_ptr< ExtendedVChunk >& a, const std::shared_ptr< ExtendedVChunk >& b) {
return !a->available() || (b->available() && a->available_blks() < b->available_blks());
});
if (!(*max_it)->available()) {
LOGWARNMOD(homeobject, "No available chunk for pg={}, ctx=0x{:x}", pg_id, ctx);
return std::nullopt;
}
auto v_chunk_id = std::distance(pg_chunks.begin(), max_it);
LOGDEBUGMOD(homeobject, "Picked v_chunk_id={} : [p_chunk_id={}, avail={}], ctx=0x{:x}", v_chunk_id,
pg_chunks[v_chunk_id]->get_chunk_id(), pg_chunks[v_chunk_id]->available_blks(), ctx);
pg_chunks[v_chunk_id]->m_state = ChunkState::INUSE;
--pg_chunk_collection->available_num_chunks;
pg_chunk_collection->available_blk_count -= pg_chunks[v_chunk_id]->available_blks();
return v_chunk_id;
}
// return the maximum number of chunks that can be allocated on pdev
uint32_t HeapChunkSelector::most_avail_num_chunks() const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
uint32_t max_avail_num_chunks = 0ul;
for (auto const& [_, pdev_heap] : m_per_dev_heap) {
max_avail_num_chunks = std::max(max_avail_num_chunks, pdev_heap->size());
}
return max_avail_num_chunks;
}
uint32_t HeapChunkSelector::avail_num_chunks(pg_id_t pg_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return 0;
}
return pg_it->second->available_num_chunks.load();
}
uint32_t HeapChunkSelector::total_chunks() const { return m_chunks.size(); }
uint64_t HeapChunkSelector::avail_blks(pg_id_t pg_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg={}", pg_id);
return 0;
}
return pg_it->second->available_blk_count.load();
}
uint64_t HeapChunkSelector::total_blks(uint32_t dev_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto it = m_per_dev_heap.find(dev_id);
if (it == m_per_dev_heap.end()) {
LOGWARNMOD(homeobject, "No pdev found for pdev {}", dev_id);
return 0;
}
return it->second->m_total_blks;
}
uint64_t HeapChunkSelector::get_used_blks() const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
uint64_t used_blks = 0;
for (const auto& [_, chunk] : m_chunks) {
if (chunk->m_state != ChunkState::GC) { used_blks += chunk->get_used_blks(); }
}
return used_blks;
}
std::unordered_map< uint32_t, std::vector< homestore::chunk_num_t > > HeapChunkSelector::get_pdev_chunks() const {
std::unordered_map< uint32_t, std::vector< homestore::chunk_num_t > > pdev_chunks;
for (const auto& [_, EXvchunk] : m_chunks) {
auto pdev_id = EXvchunk->get_pdev_id();
pdev_chunks.try_emplace(pdev_id, std::vector< homestore::chunk_num_t >());
pdev_chunks[pdev_id].emplace_back(EXvchunk->get_chunk_id());
}
return pdev_chunks;
}
homestore::cshared< HeapChunkSelector::ExtendedVChunk >
HeapChunkSelector::get_extend_vchunk(const homestore::chunk_num_t chunk_id) const {
auto it = m_chunks.find(chunk_id);
if (it != m_chunks.end()) { return it->second; }
return nullptr;
}
// dump chunks info for given pg_id, return json format
nlohmann::json HeapChunkSelector::dump_chunks_info(pg_id_t pg_id) const {
std::shared_lock lock_guard(m_chunk_selector_mtx);
auto pg_it = m_per_pg_chunks.find(pg_id);
if (pg_it == m_per_pg_chunks.end()) {
LOGWARNMOD(homeobject, "No pg found for pg_id {}", pg_id);
return nlohmann::json::object(); // Return an empty JSON object if pg_id is not found
}
nlohmann::json pg_chunk_info;
pg_chunk_info["pg"]["id"] = pg_id;
nlohmann::json chunks_array = nlohmann::json::array();
for (const auto& chunk : pg_it->second->m_pg_chunks) {
nlohmann::json chunk_json;
chunk_json["vchunk_id"] = chunk->m_v_chunk_id.value();
chunk_json["available_blk_count"] = chunk->available_blks();
chunk_json["state"] = chunk->m_state;
chunk_json["p_chunk_id"] = chunk->get_chunk_id();
chunks_array.push_back(chunk_json);
}
pg_chunk_info["pg"]["chunk_num"] = pg_it->second->m_pg_chunks.size();
pg_chunk_info["pg"]["chunks"] = chunks_array;
return pg_chunk_info;
}
} // namespace homeobject