-
Notifications
You must be signed in to change notification settings - Fork 1
/
bluestore_types.h
1376 lines (1234 loc) · 37.8 KB
/
bluestore_types.h
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
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
// vim: ts=8 sw=2 smarttab
/*
* Ceph - scalable distributed file system
*
* Copyright (C) 2014 Red Hat
*
* This is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License version 2.1, as published by the Free Software
* Foundation. See file COPYING.
*
*/
#ifndef CEPH_OSD_BLUESTORE_BLUESTORE_TYPES_H
#define CEPH_OSD_BLUESTORE_BLUESTORE_TYPES_H
#include <ostream>
#include <type_traits>
#include <vector>
#include <array>
#include "include/mempool.h"
#include "include/types.h"
#include "include/interval_set.h"
#include "include/utime.h"
#include "common/hobject.h"
#include "compressor/Compressor.h"
#include "common/Checksummer.h"
#include "include/mempool.h"
#include "include/ceph_hash.h"
namespace ceph {
class Formatter;
}
/// label for block device
struct bluestore_bdev_label_t {
uuid_d osd_uuid; ///< osd uuid
uint64_t size = 0; ///< device size
utime_t btime; ///< birth time
std::string description; ///< device description
std::map<std::string,std::string> meta; ///< {read,write}_meta() content from ObjectStore
void encode(ceph::buffer::list& bl) const;
void decode(ceph::buffer::list::const_iterator& p);
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_bdev_label_t*>& o);
};
WRITE_CLASS_ENCODER(bluestore_bdev_label_t)
std::ostream& operator<<(std::ostream& out, const bluestore_bdev_label_t& l);
/// collection metadata
struct bluestore_cnode_t {
uint32_t bits; ///< how many bits of coll pgid are significant
explicit bluestore_cnode_t(int b=0) : bits(b) {}
DENC(bluestore_cnode_t, v, p) {
DENC_START(1, 1, p);
denc(v.bits, p);
DENC_FINISH(p);
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_cnode_t*>& o);
};
WRITE_CLASS_DENC(bluestore_cnode_t)
std::ostream& operator<<(std::ostream& out, const bluestore_cnode_t& l);
template <typename OFFS_TYPE, typename LEN_TYPE>
struct bluestore_interval_t
{
static const uint64_t INVALID_OFFSET = ~0ull;
OFFS_TYPE offset = 0;
LEN_TYPE length = 0;
bluestore_interval_t(){}
bluestore_interval_t(uint64_t o, uint64_t l) : offset(o), length(l) {}
bool is_valid() const {
return offset != INVALID_OFFSET;
}
uint64_t end() const {
return offset != INVALID_OFFSET ? offset + length : INVALID_OFFSET;
}
bool operator==(const bluestore_interval_t& other) const {
return offset == other.offset && length == other.length;
}
};
/// pextent: physical extent
struct bluestore_pextent_t : public bluestore_interval_t<uint64_t, uint32_t>
{
bluestore_pextent_t() {}
bluestore_pextent_t(uint64_t o, uint64_t l) : bluestore_interval_t(o, l) {}
bluestore_pextent_t(const bluestore_interval_t &ext) :
bluestore_interval_t(ext.offset, ext.length) {}
DENC(bluestore_pextent_t, v, p) {
denc_lba(v.offset, p);
denc_varint_lowz(v.length, p);
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_pextent_t*>& ls);
};
WRITE_CLASS_DENC(bluestore_pextent_t)
std::ostream& operator<<(std::ostream& out, const bluestore_pextent_t& o);
typedef mempool::bluestore_cache_other::vector<bluestore_pextent_t> PExtentVector;
template<>
struct denc_traits<PExtentVector> {
static constexpr bool supported = true;
static constexpr bool bounded = false;
static constexpr bool featured = false;
static constexpr bool need_contiguous = true;
static void bound_encode(const PExtentVector& v, size_t& p) {
p += sizeof(uint32_t);
const auto size = v.size();
if (size) {
size_t per = 0;
denc(v.front(), per);
p += per * size;
}
}
static void encode(const PExtentVector& v,
ceph::buffer::list::contiguous_appender& p) {
denc_varint(v.size(), p);
for (auto& i : v) {
denc(i, p);
}
}
static void decode(PExtentVector& v, ceph::buffer::ptr::const_iterator& p) {
unsigned num;
denc_varint(num, p);
v.clear();
v.resize(num);
for (unsigned i=0; i<num; ++i) {
denc(v[i], p);
}
}
};
/// extent_map: a std::map of reference counted extents
struct bluestore_extent_ref_map_t {
struct record_t {
uint32_t length;
uint32_t refs;
record_t(uint32_t l=0, uint32_t r=0) : length(l), refs(r) {}
DENC(bluestore_extent_ref_map_t::record_t, v, p) {
denc_varint_lowz(v.length, p);
denc_varint(v.refs, p);
}
};
typedef mempool::bluestore_cache_other::map<uint64_t,record_t> map_t;
map_t ref_map;
void _check() const;
void _maybe_merge_left(map_t::iterator& p);
void clear() {
ref_map.clear();
}
bool empty() const {
return ref_map.empty();
}
void get(uint64_t offset, uint32_t len);
void put(uint64_t offset, uint32_t len, PExtentVector *release,
bool *maybe_unshared);
bool contains(uint64_t offset, uint32_t len) const;
bool intersects(uint64_t offset, uint32_t len) const;
void bound_encode(size_t& p) const {
denc_varint((uint32_t)0, p);
if (!ref_map.empty()) {
size_t elem_size = 0;
denc_varint_lowz((uint64_t)0, elem_size);
ref_map.begin()->second.bound_encode(elem_size);
p += elem_size * ref_map.size();
}
}
void encode(ceph::buffer::list::contiguous_appender& p) const {
const uint32_t n = ref_map.size();
denc_varint(n, p);
if (n) {
auto i = ref_map.begin();
denc_varint_lowz(i->first, p);
i->second.encode(p);
int64_t pos = i->first;
while (++i != ref_map.end()) {
denc_varint_lowz((int64_t)i->first - pos, p);
i->second.encode(p);
pos = i->first;
}
}
}
void decode(ceph::buffer::ptr::const_iterator& p) {
uint32_t n;
denc_varint(n, p);
if (n) {
int64_t pos;
denc_varint_lowz(pos, p);
ref_map[pos].decode(p);
while (--n) {
int64_t delta;
denc_varint_lowz(delta, p);
pos += delta;
ref_map[pos].decode(p);
}
}
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_extent_ref_map_t*>& o);
};
WRITE_CLASS_DENC(bluestore_extent_ref_map_t)
std::ostream& operator<<(std::ostream& out, const bluestore_extent_ref_map_t& rm);
static inline bool operator==(const bluestore_extent_ref_map_t::record_t& l,
const bluestore_extent_ref_map_t::record_t& r) {
return l.length == r.length && l.refs == r.refs;
}
static inline bool operator==(const bluestore_extent_ref_map_t& l,
const bluestore_extent_ref_map_t& r) {
return l.ref_map == r.ref_map;
}
static inline bool operator!=(const bluestore_extent_ref_map_t& l,
const bluestore_extent_ref_map_t& r) {
return !(l == r);
}
/// blob_use_tracker: a set of per-alloc unit ref buckets to track blob usage
struct bluestore_blob_use_tracker_t {
// N.B.: There is no need to minimize au_size/num_au
// as much as possible (e.g. have just a single byte for au_size) since:
// 1) Struct isn't packed hence it's padded. And even if it's packed see 2)
// 2) Mem manager has its own granularity, most probably >= 8 bytes
//
uint32_t au_size; // Allocation (=tracking) unit size,
// == 0 if uninitialized
uint32_t num_au; // Amount of allocation units tracked
// == 0 if single unit or the whole blob is tracked
uint32_t alloc_au; // Amount of allocation units allocated
union {
uint32_t* bytes_per_au;
uint32_t total_bytes;
};
bluestore_blob_use_tracker_t()
: au_size(0), num_au(0), alloc_au(0), bytes_per_au(nullptr) {
}
bluestore_blob_use_tracker_t(const bluestore_blob_use_tracker_t& tracker);
bluestore_blob_use_tracker_t& operator=(const bluestore_blob_use_tracker_t& rhs);
~bluestore_blob_use_tracker_t() {
clear();
}
void clear() {
release(alloc_au, bytes_per_au);
num_au = 0;
alloc_au = 0;
bytes_per_au = 0;
au_size = 0;
}
uint32_t get_referenced_bytes() const {
uint32_t total = 0;
if (!num_au) {
total = total_bytes;
} else {
for (size_t i = 0; i < num_au; ++i) {
total += bytes_per_au[i];
}
}
return total;
}
bool is_not_empty() const {
if (!num_au) {
return total_bytes != 0;
} else {
for (size_t i = 0; i < num_au; ++i) {
if (bytes_per_au[i]) {
return true;
}
}
}
return false;
}
bool is_empty() const {
return !is_not_empty();
}
void prune_tail(uint32_t new_len) {
if (num_au) {
new_len = round_up_to(new_len, au_size);
uint32_t _num_au = new_len / au_size;
ceph_assert(_num_au <= num_au);
if (_num_au) {
num_au = _num_au; // bytes_per_au array is left unmodified
} else {
clear();
}
}
}
void add_tail(uint32_t new_len, uint32_t _au_size) {
auto full_size = au_size * (num_au ? num_au : 1);
ceph_assert(new_len >= full_size);
if (new_len == full_size) {
return;
}
if (!num_au) {
uint32_t old_total = total_bytes;
total_bytes = 0;
init(new_len, _au_size);
ceph_assert(num_au);
bytes_per_au[0] = old_total;
} else {
ceph_assert(_au_size == au_size);
new_len = round_up_to(new_len, au_size);
uint32_t _num_au = new_len / au_size;
ceph_assert(_num_au >= num_au);
if (_num_au > num_au) {
auto old_bytes = bytes_per_au;
auto old_num_au = num_au;
auto old_alloc_au = alloc_au;
alloc_au = num_au = 0; // to bypass an assertion in allocate()
bytes_per_au = nullptr;
allocate(_num_au);
for (size_t i = 0; i < old_num_au; i++) {
bytes_per_au[i] = old_bytes[i];
}
for (size_t i = old_num_au; i < num_au; i++) {
bytes_per_au[i] = 0;
}
release(old_alloc_au, old_bytes);
}
}
}
void init(
uint32_t full_length,
uint32_t _au_size);
void get(
uint32_t offset,
uint32_t len);
/// put: return true if the blob has no references any more after the call,
/// no release_units is filled for the sake of performance.
/// return false if there are some references to the blob,
/// in this case release_units contains pextents
/// (identified by their offsets relative to the blob start)
/// that are not used any more and can be safely deallocated.
bool put(
uint32_t offset,
uint32_t len,
PExtentVector *release);
bool can_split() const;
bool can_split_at(uint32_t blob_offset) const;
void split(
uint32_t blob_offset,
bluestore_blob_use_tracker_t* r);
bool equal(
const bluestore_blob_use_tracker_t& other) const;
void bound_encode(size_t& p) const {
denc_varint(au_size, p);
if (au_size) {
denc_varint(num_au, p);
if (!num_au) {
denc_varint(total_bytes, p);
} else {
size_t elem_size = 0;
denc_varint((uint32_t)0, elem_size);
p += elem_size * num_au;
}
}
}
void encode(ceph::buffer::list::contiguous_appender& p) const {
denc_varint(au_size, p);
if (au_size) {
denc_varint(num_au, p);
if (!num_au) {
denc_varint(total_bytes, p);
} else {
size_t elem_size = 0;
denc_varint((uint32_t)0, elem_size);
for (size_t i = 0; i < num_au; ++i) {
denc_varint(bytes_per_au[i], p);
}
}
}
}
void decode(ceph::buffer::ptr::const_iterator& p) {
clear();
denc_varint(au_size, p);
if (au_size) {
uint32_t _num_au;
denc_varint(_num_au, p);
if (!_num_au) {
num_au = 0;
denc_varint(total_bytes, p);
} else {
allocate(_num_au);
for (size_t i = 0; i < _num_au; ++i) {
denc_varint(bytes_per_au[i], p);
}
}
}
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_blob_use_tracker_t*>& o);
private:
void allocate(uint32_t _num_au);
void release(uint32_t _num_au, uint32_t* ptr);
};
WRITE_CLASS_DENC(bluestore_blob_use_tracker_t)
std::ostream& operator<<(std::ostream& out, const bluestore_blob_use_tracker_t& rm);
/// blob: a piece of data on disk
struct bluestore_blob_t {
private:
PExtentVector extents; ///< raw data position on device
uint32_t logical_length = 0; ///< original length of data stored in the blob
uint32_t compressed_length = 0; ///< compressed length if any
public:
enum {
LEGACY_FLAG_MUTABLE = 1, ///< [legacy] blob can be overwritten or split
FLAG_COMPRESSED = 2, ///< blob is compressed
FLAG_CSUM = 4, ///< blob has checksums
FLAG_HAS_UNUSED = 8, ///< blob has unused std::map
FLAG_SHARED = 16, ///< blob is shared; see external SharedBlob
};
static std::string get_flags_string(unsigned flags);
uint32_t flags = 0; ///< FLAG_*
typedef uint16_t unused_t;
unused_t unused = 0; ///< portion that has never been written to (bitmap)
uint8_t csum_type = Checksummer::CSUM_NONE; ///< CSUM_*
uint8_t csum_chunk_order = 0; ///< csum block size is 1<<block_order bytes
ceph::buffer::ptr csum_data; ///< opaque std::vector of csum data
bluestore_blob_t(uint32_t f = 0) : flags(f) {}
const PExtentVector& get_extents() const {
return extents;
}
PExtentVector& dirty_extents() {
return extents;
}
DENC_HELPERS;
void bound_encode(size_t& p, uint64_t struct_v) const {
ceph_assert(struct_v == 1 || struct_v == 2);
denc(extents, p);
denc_varint(flags, p);
denc_varint_lowz(logical_length, p);
denc_varint_lowz(compressed_length, p);
denc(csum_type, p);
denc(csum_chunk_order, p);
denc_varint(csum_data.length(), p);
p += csum_data.length();
p += sizeof(unused_t);
}
void encode(ceph::buffer::list::contiguous_appender& p, uint64_t struct_v) const {
ceph_assert(struct_v == 1 || struct_v == 2);
denc(extents, p);
denc_varint(flags, p);
if (is_compressed()) {
denc_varint_lowz(logical_length, p);
denc_varint_lowz(compressed_length, p);
}
if (has_csum()) {
denc(csum_type, p);
denc(csum_chunk_order, p);
denc_varint(csum_data.length(), p);
memcpy(p.get_pos_add(csum_data.length()), csum_data.c_str(),
csum_data.length());
}
if (has_unused()) {
denc(unused, p);
}
}
void decode(ceph::buffer::ptr::const_iterator& p, uint64_t struct_v) {
ceph_assert(struct_v == 1 || struct_v == 2);
denc(extents, p);
denc_varint(flags, p);
if (is_compressed()) {
denc_varint_lowz(logical_length, p);
denc_varint_lowz(compressed_length, p);
} else {
logical_length = get_ondisk_length();
}
if (has_csum()) {
denc(csum_type, p);
denc(csum_chunk_order, p);
int len;
denc_varint(len, p);
csum_data = p.get_ptr(len);
csum_data.reassign_to_mempool(mempool::mempool_bluestore_cache_other);
}
if (has_unused()) {
denc(unused, p);
}
}
bool can_split() const {
return
!has_flag(FLAG_SHARED) &&
!has_flag(FLAG_COMPRESSED) &&
!has_flag(FLAG_HAS_UNUSED); // splitting unused set is complex
}
bool can_split_at(uint32_t blob_offset) const {
return !has_csum() || blob_offset % get_csum_chunk_size() == 0;
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_blob_t*>& ls);
bool has_flag(unsigned f) const {
return flags & f;
}
void set_flag(unsigned f) {
flags |= f;
}
void clear_flag(unsigned f) {
flags &= ~f;
}
std::string get_flags_string() const {
return get_flags_string(flags);
}
void set_compressed(uint64_t clen_orig, uint64_t clen) {
set_flag(FLAG_COMPRESSED);
logical_length = clen_orig;
compressed_length = clen;
}
bool is_mutable() const {
return !is_compressed() && !is_shared();
}
bool is_compressed() const {
return has_flag(FLAG_COMPRESSED);
}
bool has_csum() const {
return has_flag(FLAG_CSUM);
}
bool has_unused() const {
return has_flag(FLAG_HAS_UNUSED);
}
bool is_shared() const {
return has_flag(FLAG_SHARED);
}
/// return chunk (i.e. min readable block) size for the blob
uint64_t get_chunk_size(uint64_t dev_block_size) const {
return has_csum() ?
std::max<uint64_t>(dev_block_size, get_csum_chunk_size()) : dev_block_size;
}
uint32_t get_csum_chunk_size() const {
return 1 << csum_chunk_order;
}
uint32_t get_compressed_payload_length() const {
return is_compressed() ? compressed_length : 0;
}
uint64_t calc_offset(uint64_t x_off, uint64_t *plen) const {
auto p = extents.begin();
ceph_assert(p != extents.end());
while (x_off >= p->length) {
x_off -= p->length;
++p;
ceph_assert(p != extents.end());
}
if (plen)
*plen = p->length - x_off;
return p->offset + x_off;
}
// validate whether or not the status of pextents within the given range
// meets the requirement(allocated or unallocated).
bool _validate_range(uint64_t b_off, uint64_t b_len,
bool require_allocated) const {
auto p = extents.begin();
ceph_assert(p != extents.end());
while (b_off >= p->length) {
b_off -= p->length;
if (++p == extents.end())
return false;
}
b_len += b_off;
while (b_len) {
if (require_allocated != p->is_valid()) {
return false;
}
if (p->length >= b_len) {
return true;
}
b_len -= p->length;
if (++p == extents.end())
return false;
}
ceph_abort_msg("we should not get here");
return false;
}
/// return true if the entire range is allocated
/// (mapped to extents on disk)
bool is_allocated(uint64_t b_off, uint64_t b_len) const {
return _validate_range(b_off, b_len, true);
}
/// return true if the entire range is unallocated
/// (not mapped to extents on disk)
bool is_unallocated(uint64_t b_off, uint64_t b_len) const {
return _validate_range(b_off, b_len, false);
}
/// return true if the logical range has never been used
bool is_unused(uint64_t offset, uint64_t length) const {
if (!has_unused()) {
return false;
}
ceph_assert(!is_compressed());
uint64_t blob_len = get_logical_length();
ceph_assert((blob_len % (sizeof(unused)*8)) == 0);
ceph_assert(offset + length <= blob_len);
uint64_t chunk_size = blob_len / (sizeof(unused)*8);
uint64_t start = offset / chunk_size;
uint64_t end = round_up_to(offset + length, chunk_size) / chunk_size;
auto i = start;
while (i < end && (unused & (1u << i))) {
i++;
}
return i >= end;
}
/// mark a range that has never been used
void add_unused(uint64_t offset, uint64_t length) {
ceph_assert(!is_compressed());
uint64_t blob_len = get_logical_length();
ceph_assert((blob_len % (sizeof(unused)*8)) == 0);
ceph_assert(offset + length <= blob_len);
uint64_t chunk_size = blob_len / (sizeof(unused)*8);
uint64_t start = round_up_to(offset, chunk_size) / chunk_size;
uint64_t end = (offset + length) / chunk_size;
for (auto i = start; i < end; ++i) {
unused |= (1u << i);
}
if (start != end) {
set_flag(FLAG_HAS_UNUSED);
}
}
/// indicate that a range has (now) been used.
void mark_used(uint64_t offset, uint64_t length) {
if (has_unused()) {
ceph_assert(!is_compressed());
uint64_t blob_len = get_logical_length();
ceph_assert((blob_len % (sizeof(unused)*8)) == 0);
ceph_assert(offset + length <= blob_len);
uint64_t chunk_size = blob_len / (sizeof(unused)*8);
uint64_t start = offset / chunk_size;
uint64_t end = round_up_to(offset + length, chunk_size) / chunk_size;
for (auto i = start; i < end; ++i) {
unused &= ~(1u << i);
}
if (unused == 0) {
clear_flag(FLAG_HAS_UNUSED);
}
}
}
// map_f_invoke templates intended to mask parameters which are not expected
// by the provided callback
template<class F, typename std::enable_if<std::is_invocable_r_v<
int,
F,
uint64_t,
uint64_t>>::type* = nullptr>
int map_f_invoke(uint64_t lo,
const bluestore_pextent_t& p,
uint64_t o,
uint64_t l, F&& f) const{
return f(o, l);
}
template<class F, typename std::enable_if<std::is_invocable_r_v<
int,
F,
uint64_t,
uint64_t,
uint64_t>>::type * = nullptr>
int map_f_invoke(uint64_t lo,
const bluestore_pextent_t& p,
uint64_t o,
uint64_t l, F&& f) const {
return f(lo, o, l);
}
template<class F, typename std::enable_if<std::is_invocable_r_v<
int,
F,
const bluestore_pextent_t&,
uint64_t,
uint64_t>>::type * = nullptr>
int map_f_invoke(uint64_t lo,
const bluestore_pextent_t& p,
uint64_t o,
uint64_t l, F&& f) const {
return f(p, o, l);
}
template<class F>
int map(uint64_t x_off, uint64_t x_len, F&& f) const {
auto x_off0 = x_off;
auto p = extents.begin();
ceph_assert(p != extents.end());
while (x_off >= p->length) {
x_off -= p->length;
++p;
ceph_assert(p != extents.end());
}
while (x_len > 0 && p != extents.end()) {
uint64_t l = std::min(p->length - x_off, x_len);
int r = map_f_invoke(x_off0, *p, p->offset + x_off, l, f);
if (r < 0)
return r;
x_off = 0;
x_len -= l;
x_off0 += l;
++p;
}
return 0;
}
template<class F>
void map_bl(uint64_t x_off,
ceph::buffer::list& bl,
F&& f) const {
static_assert(std::is_invocable_v<F, uint64_t, ceph::buffer::list&>);
auto p = extents.begin();
ceph_assert(p != extents.end());
while (x_off >= p->length) {
x_off -= p->length;
++p;
ceph_assert(p != extents.end());
}
ceph::buffer::list::iterator it = bl.begin();
uint64_t x_len = bl.length();
while (x_len > 0) {
ceph_assert(p != extents.end());
uint64_t l = std::min(p->length - x_off, x_len);
ceph::buffer::list t;
it.copy(l, t);
f(p->offset + x_off, t);
x_off = 0;
x_len -= l;
++p;
}
}
uint32_t get_ondisk_length() const {
uint32_t len = 0;
for (auto &p : extents) {
len += p.length;
}
return len;
}
uint32_t get_logical_length() const {
return logical_length;
}
size_t get_csum_value_size() const;
size_t get_csum_count() const {
size_t vs = get_csum_value_size();
if (!vs)
return 0;
return csum_data.length() / vs;
}
uint64_t get_csum_item(unsigned i) const {
size_t cs = get_csum_value_size();
const char *p = csum_data.c_str();
switch (cs) {
case 0:
ceph_abort_msg("no csum data, bad index");
case 1:
return reinterpret_cast<const uint8_t*>(p)[i];
case 2:
return reinterpret_cast<const ceph_le16*>(p)[i];
case 4:
return reinterpret_cast<const ceph_le32*>(p)[i];
case 8:
return reinterpret_cast<const ceph_le64*>(p)[i];
default:
ceph_abort_msg("unrecognized csum word size");
}
}
const char *get_csum_item_ptr(unsigned i) const {
size_t cs = get_csum_value_size();
return csum_data.c_str() + (cs * i);
}
char *get_csum_item_ptr(unsigned i) {
size_t cs = get_csum_value_size();
return csum_data.c_str() + (cs * i);
}
void init_csum(unsigned type, unsigned order, unsigned len) {
flags |= FLAG_CSUM;
csum_type = type;
csum_chunk_order = order;
csum_data = ceph::buffer::create(get_csum_value_size() * len / get_csum_chunk_size());
csum_data.zero();
csum_data.reassign_to_mempool(mempool::mempool_bluestore_cache_other);
}
/// calculate csum for the buffer at the given b_off
void calc_csum(uint64_t b_off, const ceph::buffer::list& bl);
/// verify csum: return -EOPNOTSUPP for unsupported checksum type;
/// return -1 and valid(nonnegative) b_bad_off for checksum error;
/// return 0 if all is well.
int verify_csum(uint64_t b_off, const ceph::buffer::list& bl, int* b_bad_off,
uint64_t *bad_csum) const;
bool can_prune_tail() const {
return
extents.size() > 1 && // if it's all invalid it's not pruning.
!extents.back().is_valid() &&
!has_unused();
}
void prune_tail() {
const auto &p = extents.back();
logical_length -= p.length;
extents.pop_back();
if (has_csum()) {
ceph::buffer::ptr t;
t.swap(csum_data);
csum_data = ceph::buffer::ptr(t.c_str(),
get_logical_length() / get_csum_chunk_size() *
get_csum_value_size());
}
}
void add_tail(uint32_t new_len) {
ceph_assert(is_mutable());
ceph_assert(!has_unused());
ceph_assert(new_len > logical_length);
extents.emplace_back(
bluestore_pextent_t(
bluestore_pextent_t::INVALID_OFFSET,
new_len - logical_length));
logical_length = new_len;
if (has_csum()) {
ceph::buffer::ptr t;
t.swap(csum_data);
csum_data = ceph::buffer::create(
get_csum_value_size() * logical_length / get_csum_chunk_size());
csum_data.copy_in(0, t.length(), t.c_str());
csum_data.zero(t.length(), csum_data.length() - t.length());
}
}
uint32_t get_release_size(uint32_t min_alloc_size) const {
if (is_compressed()) {
return get_logical_length();
}
uint32_t res = get_csum_chunk_size();
if (!has_csum() || res < min_alloc_size) {
res = min_alloc_size;
}
return res;
}
void split(uint32_t blob_offset, bluestore_blob_t& rb);
void allocated(uint32_t b_off, uint32_t length, const PExtentVector& allocs);
void allocated_test(const bluestore_pextent_t& alloc); // intended for UT only
/// updates blob's pextents container and return unused pextents eligible
/// for release.
/// all - indicates that the whole blob to be released.
/// logical - specifies set of logical extents within blob's
/// to be released
/// Returns true if blob has no more valid pextents
bool release_extents(
bool all,
const PExtentVector& logical,
PExtentVector* r);
};
WRITE_CLASS_DENC_FEATURED(bluestore_blob_t)
std::ostream& operator<<(std::ostream& out, const bluestore_blob_t& o);
/// shared blob state
struct bluestore_shared_blob_t {
MEMPOOL_CLASS_HELPERS();
uint64_t sbid; ///> shared blob id
bluestore_extent_ref_map_t ref_map; ///< shared blob extents
bluestore_shared_blob_t(uint64_t _sbid) : sbid(_sbid) {}
bluestore_shared_blob_t(uint64_t _sbid,
bluestore_extent_ref_map_t&& _ref_map )
: sbid(_sbid), ref_map(std::move(_ref_map)) {}
DENC(bluestore_shared_blob_t, v, p) {
DENC_START(1, 1, p);
denc(v.ref_map, p);
DENC_FINISH(p);
}
void dump(ceph::Formatter *f) const;
static void generate_test_instances(std::list<bluestore_shared_blob_t*>& ls);
bool empty() const {
return ref_map.empty();
}
};
WRITE_CLASS_DENC(bluestore_shared_blob_t)
std::ostream& operator<<(std::ostream& out, const bluestore_shared_blob_t& o);
/// onode: per-object metadata
struct bluestore_onode_t {
uint64_t nid = 0; ///< numeric id (locally unique)
uint64_t size = 0; ///< object size
// mempool to be assigned to buffer::ptr manually
std::map<mempool::bluestore_cache_meta::string, ceph::buffer::ptr> attrs;
struct shard_info {
uint32_t offset = 0; ///< logical offset for start of shard
uint32_t bytes = 0; ///< encoded bytes
DENC(shard_info, v, p) {
denc_varint(v.offset, p);
denc_varint(v.bytes, p);
}
void dump(ceph::Formatter *f) const;
};
std::vector<shard_info> extent_map_shards; ///< extent std::map shards (if any)
uint32_t expected_object_size = 0;
uint32_t expected_write_size = 0;
uint32_t alloc_hint_flags = 0;
uint8_t flags = 0;
std::map<uint32_t, uint64_t> zone_offset_refs; ///< (zone, offset) refs to this onode
enum {
FLAG_OMAP = 1, ///< object may have omap data
FLAG_PGMETA_OMAP = 2, ///< omap data is in meta omap prefix
FLAG_PERPOOL_OMAP = 4, ///< omap data is in per-pool prefix; per-pool keys
FLAG_PERPG_OMAP = 8, ///< omap data is in per-pg prefix; per-pg keys
};
std::string get_flags_string() const {
std::string s;
if (flags & FLAG_OMAP) {
s = "omap";
}
if (flags & FLAG_PGMETA_OMAP) {
s += "+pgmeta_omap";
}
if (flags & FLAG_PERPOOL_OMAP) {
s += "+per_pool_omap";
}
if (flags & FLAG_PERPG_OMAP) {
s += "+per_pg_omap";
}
return s;
}
bool has_flag(unsigned f) const {
return flags & f;
}
void set_flag(unsigned f) {
flags |= f;
}
void clear_flag(unsigned f) {