1 // vim: ts=8 sw=2 smarttab
3 * Ceph - scalable distributed file system
5 * Copyright (C) 2014 Red Hat
7 * This is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU Lesser General Public
9 * License version 2.1, as published by the Free Software
10 * Foundation. See file COPYING.
16 #include <sys/types.h>
20 #include "include/cpp-btree/btree_set.h"
22 #include "BlueStore.h"
24 #include "include/compat.h"
25 #include "include/intarith.h"
26 #include "include/stringify.h"
27 #include "common/errno.h"
28 #include "common/safe_io.h"
29 #include "Allocator.h"
30 #include "FreelistManager.h"
32 #include "BlueRocksEnv.h"
33 #include "auth/Crypto.h"
34 #include "common/EventTrace.h"
36 #define dout_context cct
37 #define dout_subsys ceph_subsys_bluestore
39 using bid_t
= decltype(BlueStore::Blob::id
);
41 // bluestore_cache_onode
42 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::Onode
, bluestore_onode
,
43 bluestore_cache_onode
);
45 // bluestore_cache_other
46 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::Buffer
, bluestore_buffer
,
47 bluestore_cache_other
);
48 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::Extent
, bluestore_extent
,
49 bluestore_cache_other
);
50 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::Blob
, bluestore_blob
,
51 bluestore_cache_other
);
52 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::SharedBlob
, bluestore_shared_blob
,
53 bluestore_cache_other
);
56 MEMPOOL_DEFINE_OBJECT_FACTORY(BlueStore::TransContext
, bluestore_transcontext
,
61 const string PREFIX_SUPER
= "S"; // field -> value
62 const string PREFIX_STAT
= "T"; // field -> value(int64 array)
63 const string PREFIX_COLL
= "C"; // collection name -> cnode_t
64 const string PREFIX_OBJ
= "O"; // object name -> onode_t
65 const string PREFIX_OMAP
= "M"; // u64 + keyname -> value
66 const string PREFIX_DEFERRED
= "L"; // id -> deferred_transaction_t
67 const string PREFIX_ALLOC
= "B"; // u64 offset -> u64 length (freelist)
68 const string PREFIX_SHARED_BLOB
= "X"; // u64 offset -> shared_blob_t
70 // write a label in the first block. always use this size. note that
71 // bluefs makes a matching assumption about the location of its
72 // superblock (always the second block of the device).
73 #define BDEV_LABEL_BLOCK_SIZE 4096
75 // reserve: label (4k) + bluefs super (4k), which means we start at 8k.
76 #define SUPER_RESERVED 8192
78 #define OBJECT_MAX_SIZE 0xffffffff // 32 bits
82 * extent map blob encoding
84 * we use the low bits of the blobid field to indicate some common scenarios
85 * and spanning vs local ids. See ExtentMap::{encode,decode}_some().
87 #define BLOBID_FLAG_CONTIGUOUS 0x1 // this extent starts at end of previous
88 #define BLOBID_FLAG_ZEROOFFSET 0x2 // blob_offset is 0
89 #define BLOBID_FLAG_SAMELENGTH 0x4 // length matches previous extent
90 #define BLOBID_FLAG_SPANNING 0x8 // has spanning blob id
91 #define BLOBID_SHIFT_BITS 4
94 * object name key structure
96 * encoded u8: shard + 2^7 (so that it sorts properly)
97 * encoded u64: poolid + 2^63 (so that it sorts properly)
98 * encoded u32: hash (bit reversed)
100 * escaped string: namespace
102 * escaped string: key or object name
103 * 1 char: '<', '=', or '>'. if =, then object key == object name, and
104 * we are done. otherwise, we are followed by the object name.
105 * escaped string: object name (unless '=' above)
108 * encoded u64: generation
111 #define ONODE_KEY_SUFFIX 'o'
120 #define EXTENT_SHARD_KEY_SUFFIX 'x'
123 * string encoding in the key
125 * The key string needs to lexicographically sort the same way that
126 * ghobject_t does. We do this by escaping anything <= to '#' with #
127 * plus a 2 digit hex string, and anything >= '~' with ~ plus the two
130 * We use ! as a terminator for strings; this works because it is < #
131 * and will get escaped if it is present in the string.
135 static void append_escaped(const string
&in
, S
*out
)
137 char hexbyte
[in
.length() * 3 + 1];
138 char* ptr
= &hexbyte
[0];
139 for (string::const_iterator i
= in
.begin(); i
!= in
.end(); ++i
) {
142 *ptr
++ = "0123456789abcdef"[(*i
>> 4) & 0x0f];
143 *ptr
++ = "0123456789abcdef"[*i
& 0x0f];
144 } else if (*i
>= '~') {
146 *ptr
++ = "0123456789abcdef"[(*i
>> 4) & 0x0f];
147 *ptr
++ = "0123456789abcdef"[*i
& 0x0f];
153 out
->append(hexbyte
, ptr
- &hexbyte
[0]);
156 inline unsigned h2i(char c
)
158 if ((c
>= '0') && (c
<= '9')) {
160 } else if ((c
>= 'a') && (c
<= 'f')) {
162 } else if ((c
>= 'A') && (c
<= 'F')) {
165 return 256; // make it always larger than 255
169 static int decode_escaped(const char *p
, string
*out
)
172 char* ptr
= &buff
[0];
173 char* max
= &buff
[252];
174 const char *orig_p
= p
;
175 while (*p
&& *p
!= '!') {
176 if (*p
== '#' || *p
== '~') {
179 hex
= h2i(*p
++) << 4;
192 out
->append(buff
, ptr
-buff
);
197 out
->append(buff
, ptr
-buff
);
202 // some things we encode in binary (as le32 or le64); print the
203 // resulting key strings nicely
205 static string
pretty_binary_string(const S
& in
)
209 out
.reserve(in
.length() * 3);
210 enum { NONE
, HEX
, STRING
} mode
= NONE
;
211 unsigned from
= 0, i
;
212 for (i
=0; i
< in
.length(); ++i
) {
213 if ((in
[i
] < 32 || (unsigned char)in
[i
] > 126) ||
214 (mode
== HEX
&& in
.length() - i
>= 4 &&
215 ((in
[i
] < 32 || (unsigned char)in
[i
] > 126) ||
216 (in
[i
+1] < 32 || (unsigned char)in
[i
+1] > 126) ||
217 (in
[i
+2] < 32 || (unsigned char)in
[i
+2] > 126) ||
218 (in
[i
+3] < 32 || (unsigned char)in
[i
+3] > 126)))) {
219 if (mode
== STRING
) {
220 out
.append(in
.c_str() + from
, i
- from
);
227 if (in
.length() - i
>= 4) {
228 // print a whole u32 at once
229 snprintf(buf
, sizeof(buf
), "%08x",
230 (uint32_t)(((unsigned char)in
[i
] << 24) |
231 ((unsigned char)in
[i
+1] << 16) |
232 ((unsigned char)in
[i
+2] << 8) |
233 ((unsigned char)in
[i
+3] << 0)));
236 snprintf(buf
, sizeof(buf
), "%02x", (int)(unsigned char)in
[i
]);
240 if (mode
!= STRING
) {
247 if (mode
== STRING
) {
248 out
.append(in
.c_str() + from
, i
- from
);
255 static void _key_encode_shard(shard_id_t shard
, T
*key
)
257 key
->push_back((char)((uint8_t)shard
.id
+ (uint8_t)0x80));
260 static const char *_key_decode_shard(const char *key
, shard_id_t
*pshard
)
262 pshard
->id
= (uint8_t)*key
- (uint8_t)0x80;
266 static void get_coll_key_range(const coll_t
& cid
, int bits
,
267 string
*temp_start
, string
*temp_end
,
268 string
*start
, string
*end
)
276 if (cid
.is_pg(&pgid
)) {
277 _key_encode_shard(pgid
.shard
, start
);
278 *temp_start
= *start
;
280 _key_encode_u64(pgid
.pool() + 0x8000000000000000ull
, start
);
281 _key_encode_u64((-2ll - pgid
.pool()) + 0x8000000000000000ull
, temp_start
);
284 *temp_end
= *temp_start
;
286 uint32_t reverse_hash
= hobject_t::_reverse_bits(pgid
.ps());
287 _key_encode_u32(reverse_hash
, start
);
288 _key_encode_u32(reverse_hash
, temp_start
);
290 uint64_t end_hash
= reverse_hash
+ (1ull << (32 - bits
));
291 if (end_hash
> 0xffffffffull
)
292 end_hash
= 0xffffffffull
;
294 _key_encode_u32(end_hash
, end
);
295 _key_encode_u32(end_hash
, temp_end
);
297 _key_encode_shard(shard_id_t::NO_SHARD
, start
);
298 _key_encode_u64(-1ull + 0x8000000000000000ull
, start
);
300 _key_encode_u32(0, start
);
301 _key_encode_u32(0xffffffff, end
);
303 // no separate temp section
309 static void get_shared_blob_key(uint64_t sbid
, string
*key
)
312 _key_encode_u64(sbid
, key
);
315 static int get_key_shared_blob(const string
& key
, uint64_t *sbid
)
317 const char *p
= key
.c_str();
318 if (key
.length() < sizeof(uint64_t))
320 _key_decode_u64(p
, sbid
);
325 static int get_key_object(const S
& key
, ghobject_t
*oid
)
328 const char *p
= key
.c_str();
330 if (key
.length() < 1 + 8 + 4)
332 p
= _key_decode_shard(p
, &oid
->shard_id
);
335 p
= _key_decode_u64(p
, &pool
);
336 oid
->hobj
.pool
= pool
- 0x8000000000000000ull
;
339 p
= _key_decode_u32(p
, &hash
);
341 oid
->hobj
.set_bitwise_key_u32(hash
);
343 r
= decode_escaped(p
, &oid
->hobj
.nspace
);
349 r
= decode_escaped(p
, &k
);
356 oid
->hobj
.oid
.name
= k
;
357 } else if (*p
== '<' || *p
== '>') {
360 r
= decode_escaped(p
, &oid
->hobj
.oid
.name
);
364 oid
->hobj
.set_key(k
);
370 p
= _key_decode_u64(p
, &oid
->hobj
.snap
.val
);
371 p
= _key_decode_u64(p
, &oid
->generation
);
373 if (*p
!= ONODE_KEY_SUFFIX
) {
378 // if we get something other than a null terminator here,
379 // something goes wrong.
387 static void get_object_key(CephContext
*cct
, const ghobject_t
& oid
, S
*key
)
391 size_t max_len
= 1 + 8 + 4 +
392 (oid
.hobj
.nspace
.length() * 3 + 1) +
393 (oid
.hobj
.get_key().length() * 3 + 1) +
394 1 + // for '<', '=', or '>'
395 (oid
.hobj
.oid
.name
.length() * 3 + 1) +
397 key
->reserve(max_len
);
399 _key_encode_shard(oid
.shard_id
, key
);
400 _key_encode_u64(oid
.hobj
.pool
+ 0x8000000000000000ull
, key
);
401 _key_encode_u32(oid
.hobj
.get_bitwise_key_u32(), key
);
403 append_escaped(oid
.hobj
.nspace
, key
);
405 if (oid
.hobj
.get_key().length()) {
406 // is a key... could be < = or >.
407 append_escaped(oid
.hobj
.get_key(), key
);
408 // (ASCII chars < = and > sort in that order, yay)
409 int r
= oid
.hobj
.get_key().compare(oid
.hobj
.oid
.name
);
411 key
->append(r
> 0 ? ">" : "<");
412 append_escaped(oid
.hobj
.oid
.name
, key
);
419 append_escaped(oid
.hobj
.oid
.name
, key
);
423 _key_encode_u64(oid
.hobj
.snap
, key
);
424 _key_encode_u64(oid
.generation
, key
);
426 key
->push_back(ONODE_KEY_SUFFIX
);
431 int r
= get_key_object(*key
, &t
);
433 derr
<< " r " << r
<< dendl
;
434 derr
<< "key " << pretty_binary_string(*key
) << dendl
;
435 derr
<< "oid " << oid
<< dendl
;
436 derr
<< " t " << t
<< dendl
;
437 assert(r
== 0 && t
== oid
);
443 // extent shard keys are the onode key, plus a u32, plus 'x'. the trailing
444 // char lets us quickly test whether it is a shard key without decoding any
445 // of the prefix bytes.
447 static void get_extent_shard_key(const S
& onode_key
, uint32_t offset
,
451 key
->reserve(onode_key
.length() + 4 + 1);
452 key
->append(onode_key
.c_str(), onode_key
.size());
453 _key_encode_u32(offset
, key
);
454 key
->push_back(EXTENT_SHARD_KEY_SUFFIX
);
457 static void rewrite_extent_shard_key(uint32_t offset
, string
*key
)
459 assert(key
->size() > sizeof(uint32_t) + 1);
460 assert(*key
->rbegin() == EXTENT_SHARD_KEY_SUFFIX
);
461 _key_encode_u32(offset
, key
->size() - sizeof(uint32_t) - 1, key
);
465 static void generate_extent_shard_key_and_apply(
469 std::function
<void(const string
& final_key
)> apply
)
471 if (key
->empty()) { // make full key
472 assert(!onode_key
.empty());
473 get_extent_shard_key(onode_key
, offset
, key
);
475 rewrite_extent_shard_key(offset
, key
);
480 int get_key_extent_shard(const string
& key
, string
*onode_key
, uint32_t *offset
)
482 assert(key
.size() > sizeof(uint32_t) + 1);
483 assert(*key
.rbegin() == EXTENT_SHARD_KEY_SUFFIX
);
484 int okey_len
= key
.size() - sizeof(uint32_t) - 1;
485 *onode_key
= key
.substr(0, okey_len
);
486 const char *p
= key
.data() + okey_len
;
487 _key_decode_u32(p
, offset
);
491 static bool is_extent_shard_key(const string
& key
)
493 return *key
.rbegin() == EXTENT_SHARD_KEY_SUFFIX
;
497 static void get_omap_header(uint64_t id
, string
*out
)
499 _key_encode_u64(id
, out
);
503 // hmm, I don't think there's any need to escape the user key since we
504 // have a clean prefix.
505 static void get_omap_key(uint64_t id
, const string
& key
, string
*out
)
507 _key_encode_u64(id
, out
);
512 static void rewrite_omap_key(uint64_t id
, string old
, string
*out
)
514 _key_encode_u64(id
, out
);
515 out
->append(old
.c_str() + out
->length(), old
.size() - out
->length());
518 static void decode_omap_key(const string
& key
, string
*user_key
)
520 *user_key
= key
.substr(sizeof(uint64_t) + 1);
523 static void get_omap_tail(uint64_t id
, string
*out
)
525 _key_encode_u64(id
, out
);
529 static void get_deferred_key(uint64_t seq
, string
*out
)
531 _key_encode_u64(seq
, out
);
537 struct Int64ArrayMergeOperator
: public KeyValueDB::MergeOperator
{
538 void merge_nonexistent(
539 const char *rdata
, size_t rlen
, std::string
*new_value
) override
{
540 *new_value
= std::string(rdata
, rlen
);
543 const char *ldata
, size_t llen
,
544 const char *rdata
, size_t rlen
,
545 std::string
*new_value
) override
{
546 assert(llen
== rlen
);
547 assert((rlen
% 8) == 0);
548 new_value
->resize(rlen
);
549 const __le64
* lv
= (const __le64
*)ldata
;
550 const __le64
* rv
= (const __le64
*)rdata
;
551 __le64
* nv
= &(__le64
&)new_value
->at(0);
552 for (size_t i
= 0; i
< rlen
>> 3; ++i
) {
553 nv
[i
] = lv
[i
] + rv
[i
];
556 // We use each operator name and each prefix to construct the
557 // overall RocksDB operator name for consistency check at open time.
558 string
name() const override
{
559 return "int64_array";
566 ostream
& operator<<(ostream
& out
, const BlueStore::Buffer
& b
)
568 out
<< "buffer(" << &b
<< " space " << b
.space
<< " 0x" << std::hex
569 << b
.offset
<< "~" << b
.length
<< std::dec
570 << " " << BlueStore::Buffer::get_state_name(b
.state
);
572 out
<< " " << BlueStore::Buffer::get_flag_name(b
.flags
);
578 void BlueStore::GarbageCollector::process_protrusive_extents(
579 const BlueStore::ExtentMap
& extent_map
,
580 uint64_t start_offset
,
582 uint64_t start_touch_offset
,
583 uint64_t end_touch_offset
,
584 uint64_t min_alloc_size
)
586 assert(start_offset
<= start_touch_offset
&& end_offset
>= end_touch_offset
);
588 uint64_t lookup_start_offset
= P2ALIGN(start_offset
, min_alloc_size
);
589 uint64_t lookup_end_offset
= ROUND_UP_TO(end_offset
, min_alloc_size
);
591 dout(30) << __func__
<< " (hex): [" << std::hex
592 << lookup_start_offset
<< ", " << lookup_end_offset
593 << ")" << std::dec
<< dendl
;
595 for (auto it
= extent_map
.seek_lextent(lookup_start_offset
);
596 it
!= extent_map
.extent_map
.end() &&
597 it
->logical_offset
< lookup_end_offset
;
599 uint64_t alloc_unit_start
= it
->logical_offset
/ min_alloc_size
;
600 uint64_t alloc_unit_end
= (it
->logical_end() - 1) / min_alloc_size
;
602 dout(30) << __func__
<< " " << *it
603 << "alloc_units: " << alloc_unit_start
<< ".." << alloc_unit_end
606 Blob
* b
= it
->blob
.get();
608 if (it
->logical_offset
>=start_touch_offset
&&
609 it
->logical_end() <= end_touch_offset
) {
610 // Process extents within the range affected by
611 // the current write request.
612 // Need to take into account if existing extents
613 // can be merged with them (uncompressed case)
614 if (!b
->get_blob().is_compressed()) {
615 if (blob_info_counted
&& used_alloc_unit
== alloc_unit_start
) {
616 --blob_info_counted
->expected_allocations
; // don't need to allocate
617 // new AU for compressed
618 // data since another
619 // collocated uncompressed
620 // blob already exists
621 dout(30) << __func__
<< " --expected:"
622 << alloc_unit_start
<< dendl
;
624 used_alloc_unit
= alloc_unit_end
;
625 blob_info_counted
= nullptr;
627 } else if (b
->get_blob().is_compressed()) {
629 // additionally we take compressed blobs that were not impacted
630 // by the write into account too
632 affected_blobs
.emplace(
633 b
, BlobInfo(b
->get_referenced_bytes())).first
->second
;
636 (used_alloc_unit
&& used_alloc_unit
== alloc_unit_start
) ? 0 : 1;
637 bi
.expected_allocations
+= alloc_unit_end
- alloc_unit_start
+ adjust
;
638 dout(30) << __func__
<< " expected_allocations="
639 << bi
.expected_allocations
<< " end_au:"
640 << alloc_unit_end
<< dendl
;
642 blob_info_counted
= &bi
;
643 used_alloc_unit
= alloc_unit_end
;
645 assert(it
->length
<= bi
.referenced_bytes
);
646 bi
.referenced_bytes
-= it
->length
;
647 dout(30) << __func__
<< " affected_blob:" << *b
648 << " unref 0x" << std::hex
<< it
->length
649 << " referenced = 0x" << bi
.referenced_bytes
650 << std::dec
<< dendl
;
651 // NOTE: we can't move specific blob to resulting GC list here
652 // when reference counter == 0 since subsequent extents might
653 // decrement its expected_allocation.
654 // Hence need to enumerate all the extents first.
655 if (!bi
.collect_candidate
) {
656 bi
.first_lextent
= it
;
657 bi
.collect_candidate
= true;
659 bi
.last_lextent
= it
;
661 if (blob_info_counted
&& used_alloc_unit
== alloc_unit_start
) {
662 // don't need to allocate new AU for compressed data since another
663 // collocated uncompressed blob already exists
664 --blob_info_counted
->expected_allocations
;
665 dout(30) << __func__
<< " --expected_allocations:"
666 << alloc_unit_start
<< dendl
;
668 used_alloc_unit
= alloc_unit_end
;
669 blob_info_counted
= nullptr;
673 for (auto b_it
= affected_blobs
.begin();
674 b_it
!= affected_blobs
.end();
676 Blob
* b
= b_it
->first
;
677 BlobInfo
& bi
= b_it
->second
;
678 if (bi
.referenced_bytes
== 0) {
679 uint64_t len_on_disk
= b_it
->first
->get_blob().get_ondisk_length();
680 int64_t blob_expected_for_release
=
681 ROUND_UP_TO(len_on_disk
, min_alloc_size
) / min_alloc_size
;
683 dout(30) << __func__
<< " " << *(b_it
->first
)
684 << " expected4release=" << blob_expected_for_release
685 << " expected_allocations=" << bi
.expected_allocations
687 int64_t benefit
= blob_expected_for_release
- bi
.expected_allocations
;
688 if (benefit
>= g_conf
->bluestore_gc_enable_blob_threshold
) {
689 if (bi
.collect_candidate
) {
690 auto it
= bi
.first_lextent
;
693 if (it
->blob
.get() == b
) {
694 extents_to_collect
.emplace_back(it
->logical_offset
, it
->length
);
696 bExit
= it
== bi
.last_lextent
;
700 expected_for_release
+= blob_expected_for_release
;
701 expected_allocations
+= bi
.expected_allocations
;
707 int64_t BlueStore::GarbageCollector::estimate(
708 uint64_t start_offset
,
710 const BlueStore::ExtentMap
& extent_map
,
711 const BlueStore::old_extent_map_t
& old_extents
,
712 uint64_t min_alloc_size
)
715 affected_blobs
.clear();
716 extents_to_collect
.clear();
717 used_alloc_unit
= boost::optional
<uint64_t >();
718 blob_info_counted
= nullptr;
720 gc_start_offset
= start_offset
;
721 gc_end_offset
= start_offset
+ length
;
723 uint64_t end_offset
= start_offset
+ length
;
725 for (auto it
= old_extents
.begin(); it
!= old_extents
.end(); ++it
) {
726 Blob
* b
= it
->e
.blob
.get();
727 if (b
->get_blob().is_compressed()) {
729 // update gc_start_offset/gc_end_offset if needed
730 gc_start_offset
= min(gc_start_offset
, (uint64_t)it
->e
.blob_start());
731 gc_end_offset
= max(gc_end_offset
, (uint64_t)it
->e
.blob_end());
733 auto o
= it
->e
.logical_offset
;
734 auto l
= it
->e
.length
;
736 uint64_t ref_bytes
= b
->get_referenced_bytes();
737 // micro optimization to bypass blobs that have no more references
738 if (ref_bytes
!= 0) {
739 dout(30) << __func__
<< " affected_blob:" << *b
740 << " unref 0x" << std::hex
<< o
<< "~" << l
741 << std::dec
<< dendl
;
742 affected_blobs
.emplace(b
, BlobInfo(ref_bytes
));
746 dout(30) << __func__
<< " gc range(hex): [" << std::hex
747 << gc_start_offset
<< ", " << gc_end_offset
748 << ")" << std::dec
<< dendl
;
750 // enumerate preceeding extents to check if they reference affected blobs
751 if (gc_start_offset
< start_offset
|| gc_end_offset
> end_offset
) {
752 process_protrusive_extents(extent_map
,
759 return expected_for_release
- expected_allocations
;
764 BlueStore::Cache
*BlueStore::Cache::create(CephContext
* cct
, string type
,
765 PerfCounters
*logger
)
770 c
= new LRUCache(cct
);
771 else if (type
== "2q")
772 c
= new TwoQCache(cct
);
774 assert(0 == "unrecognized cache type");
780 void BlueStore::Cache::trim_all()
782 std::lock_guard
<std::recursive_mutex
> l(lock
);
786 void BlueStore::Cache::trim(
787 uint64_t target_bytes
,
788 float target_meta_ratio
,
789 float target_data_ratio
,
790 float bytes_per_onode
)
792 std::lock_guard
<std::recursive_mutex
> l(lock
);
793 uint64_t current_meta
= _get_num_onodes() * bytes_per_onode
;
794 uint64_t current_buffer
= _get_buffer_bytes();
795 uint64_t current
= current_meta
+ current_buffer
;
797 uint64_t target_meta
= target_bytes
* target_meta_ratio
;
798 uint64_t target_buffer
= target_bytes
* target_data_ratio
;
800 // correct for overflow or float imprecision
801 target_meta
= min(target_bytes
, target_meta
);
802 target_buffer
= min(target_bytes
- target_meta
, target_buffer
);
804 if (current
<= target_bytes
) {
806 << " shard target " << pretty_si_t(target_bytes
)
807 << " meta/data ratios " << target_meta_ratio
808 << " + " << target_data_ratio
<< " ("
809 << pretty_si_t(target_meta
) << " + "
810 << pretty_si_t(target_buffer
) << "), "
811 << " current " << pretty_si_t(current
) << " ("
812 << pretty_si_t(current_meta
) << " + "
813 << pretty_si_t(current_buffer
) << ")"
818 uint64_t need_to_free
= current
- target_bytes
;
819 uint64_t free_buffer
= 0;
820 uint64_t free_meta
= 0;
821 if (current_buffer
> target_buffer
) {
822 free_buffer
= current_buffer
- target_buffer
;
823 if (free_buffer
> need_to_free
) {
824 free_buffer
= need_to_free
;
827 free_meta
= need_to_free
- free_buffer
;
829 // start bounds at what we have now
830 uint64_t max_buffer
= current_buffer
- free_buffer
;
831 uint64_t max_meta
= current_meta
- free_meta
;
832 uint64_t max_onodes
= max_meta
/ bytes_per_onode
;
835 << " shard target " << pretty_si_t(target_bytes
)
836 << " ratio " << target_meta_ratio
<< " ("
837 << pretty_si_t(target_meta
) << " + "
838 << pretty_si_t(target_buffer
) << "), "
839 << " current " << pretty_si_t(current
) << " ("
840 << pretty_si_t(current_meta
) << " + "
841 << pretty_si_t(current_buffer
) << "),"
842 << " need_to_free " << pretty_si_t(need_to_free
) << " ("
843 << pretty_si_t(free_meta
) << " + "
844 << pretty_si_t(free_buffer
) << ")"
845 << " -> max " << max_onodes
<< " onodes + "
846 << max_buffer
<< " buffer"
848 _trim(max_onodes
, max_buffer
);
854 #define dout_prefix *_dout << "bluestore.LRUCache(" << this << ") "
856 void BlueStore::LRUCache::_touch_onode(OnodeRef
& o
)
858 auto p
= onode_lru
.iterator_to(*o
);
860 onode_lru
.push_front(*o
);
863 void BlueStore::LRUCache::_trim(uint64_t onode_max
, uint64_t buffer_max
)
865 dout(20) << __func__
<< " onodes " << onode_lru
.size() << " / " << onode_max
866 << " buffers " << buffer_size
<< " / " << buffer_max
869 _audit("trim start");
872 while (buffer_size
> buffer_max
) {
873 auto i
= buffer_lru
.rbegin();
874 if (i
== buffer_lru
.rend()) {
875 // stop if buffer_lru is now empty
880 assert(b
->is_clean());
881 dout(20) << __func__
<< " rm " << *b
<< dendl
;
882 b
->space
->_rm_buffer(this, b
);
886 int num
= onode_lru
.size() - onode_max
;
888 return; // don't even try
890 auto p
= onode_lru
.end();
891 assert(p
!= onode_lru
.begin());
894 int max_skipped
= g_conf
->bluestore_cache_trim_max_skip_pinned
;
897 int refs
= o
->nref
.load();
899 dout(20) << __func__
<< " " << o
->oid
<< " has " << refs
900 << " refs, skipping" << dendl
;
901 if (++skipped
>= max_skipped
) {
902 dout(20) << __func__
<< " maximum skip pinned reached; stopping with "
903 << num
<< " left to trim" << dendl
;
907 if (p
== onode_lru
.begin()) {
915 dout(30) << __func__
<< " rm " << o
->oid
<< dendl
;
916 if (p
!= onode_lru
.begin()) {
917 onode_lru
.erase(p
--);
922 o
->get(); // paranoia
923 o
->c
->onode_map
.remove(o
->oid
);
930 void BlueStore::LRUCache::_audit(const char *when
)
932 dout(10) << __func__
<< " " << when
<< " start" << dendl
;
934 for (auto i
= buffer_lru
.begin(); i
!= buffer_lru
.end(); ++i
) {
937 if (s
!= buffer_size
) {
938 derr
<< __func__
<< " buffer_size " << buffer_size
<< " actual " << s
940 for (auto i
= buffer_lru
.begin(); i
!= buffer_lru
.end(); ++i
) {
941 derr
<< __func__
<< " " << *i
<< dendl
;
943 assert(s
== buffer_size
);
945 dout(20) << __func__
<< " " << when
<< " buffer_size " << buffer_size
952 #define dout_prefix *_dout << "bluestore.2QCache(" << this << ") "
955 void BlueStore::TwoQCache::_touch_onode(OnodeRef
& o
)
957 auto p
= onode_lru
.iterator_to(*o
);
959 onode_lru
.push_front(*o
);
962 void BlueStore::TwoQCache::_add_buffer(Buffer
*b
, int level
, Buffer
*near
)
964 dout(20) << __func__
<< " level " << level
<< " near " << near
966 << " which has cache_private " << b
->cache_private
<< dendl
;
968 b
->cache_private
= near
->cache_private
;
969 switch (b
->cache_private
) {
971 buffer_warm_in
.insert(buffer_warm_in
.iterator_to(*near
), *b
);
973 case BUFFER_WARM_OUT
:
974 assert(b
->is_empty());
975 buffer_warm_out
.insert(buffer_warm_out
.iterator_to(*near
), *b
);
978 buffer_hot
.insert(buffer_hot
.iterator_to(*near
), *b
);
981 assert(0 == "bad cache_private");
983 } else if (b
->cache_private
== BUFFER_NEW
) {
984 b
->cache_private
= BUFFER_WARM_IN
;
986 buffer_warm_in
.push_front(*b
);
988 // take caller hint to start at the back of the warm queue
989 buffer_warm_in
.push_back(*b
);
992 // we got a hint from discard
993 switch (b
->cache_private
) {
995 // stay in warm_in. move to front, even though 2Q doesn't actually
997 dout(20) << __func__
<< " move to front of warm " << *b
<< dendl
;
998 buffer_warm_in
.push_front(*b
);
1000 case BUFFER_WARM_OUT
:
1001 b
->cache_private
= BUFFER_HOT
;
1002 // move to hot. fall-thru
1004 dout(20) << __func__
<< " move to front of hot " << *b
<< dendl
;
1005 buffer_hot
.push_front(*b
);
1008 assert(0 == "bad cache_private");
1011 if (!b
->is_empty()) {
1012 buffer_bytes
+= b
->length
;
1013 buffer_list_bytes
[b
->cache_private
] += b
->length
;
1017 void BlueStore::TwoQCache::_rm_buffer(Buffer
*b
)
1019 dout(20) << __func__
<< " " << *b
<< dendl
;
1020 if (!b
->is_empty()) {
1021 assert(buffer_bytes
>= b
->length
);
1022 buffer_bytes
-= b
->length
;
1023 assert(buffer_list_bytes
[b
->cache_private
] >= b
->length
);
1024 buffer_list_bytes
[b
->cache_private
] -= b
->length
;
1026 switch (b
->cache_private
) {
1027 case BUFFER_WARM_IN
:
1028 buffer_warm_in
.erase(buffer_warm_in
.iterator_to(*b
));
1030 case BUFFER_WARM_OUT
:
1031 buffer_warm_out
.erase(buffer_warm_out
.iterator_to(*b
));
1034 buffer_hot
.erase(buffer_hot
.iterator_to(*b
));
1037 assert(0 == "bad cache_private");
1041 void BlueStore::TwoQCache::_move_buffer(Cache
*srcc
, Buffer
*b
)
1043 TwoQCache
*src
= static_cast<TwoQCache
*>(srcc
);
1046 // preserve which list we're on (even if we can't preserve the order!)
1047 switch (b
->cache_private
) {
1048 case BUFFER_WARM_IN
:
1049 assert(!b
->is_empty());
1050 buffer_warm_in
.push_back(*b
);
1052 case BUFFER_WARM_OUT
:
1053 assert(b
->is_empty());
1054 buffer_warm_out
.push_back(*b
);
1057 assert(!b
->is_empty());
1058 buffer_hot
.push_back(*b
);
1061 assert(0 == "bad cache_private");
1063 if (!b
->is_empty()) {
1064 buffer_bytes
+= b
->length
;
1065 buffer_list_bytes
[b
->cache_private
] += b
->length
;
1069 void BlueStore::TwoQCache::_adjust_buffer_size(Buffer
*b
, int64_t delta
)
1071 dout(20) << __func__
<< " delta " << delta
<< " on " << *b
<< dendl
;
1072 if (!b
->is_empty()) {
1073 assert((int64_t)buffer_bytes
+ delta
>= 0);
1074 buffer_bytes
+= delta
;
1075 assert((int64_t)buffer_list_bytes
[b
->cache_private
] + delta
>= 0);
1076 buffer_list_bytes
[b
->cache_private
] += delta
;
1080 void BlueStore::TwoQCache::_trim(uint64_t onode_max
, uint64_t buffer_max
)
1082 dout(20) << __func__
<< " onodes " << onode_lru
.size() << " / " << onode_max
1083 << " buffers " << buffer_bytes
<< " / " << buffer_max
1086 _audit("trim start");
1089 if (buffer_bytes
> buffer_max
) {
1090 uint64_t kin
= buffer_max
* cct
->_conf
->bluestore_2q_cache_kin_ratio
;
1091 uint64_t khot
= buffer_max
- kin
;
1093 // pre-calculate kout based on average buffer size too,
1094 // which is typical(the warm_in and hot lists may change later)
1096 uint64_t buffer_num
= buffer_hot
.size() + buffer_warm_in
.size();
1098 uint64_t buffer_avg_size
= buffer_bytes
/ buffer_num
;
1099 assert(buffer_avg_size
);
1100 uint64_t calculated_buffer_num
= buffer_max
/ buffer_avg_size
;
1101 kout
= calculated_buffer_num
* cct
->_conf
->bluestore_2q_cache_kout_ratio
;
1104 if (buffer_list_bytes
[BUFFER_HOT
] < khot
) {
1105 // hot is small, give slack to warm_in
1106 kin
+= khot
- buffer_list_bytes
[BUFFER_HOT
];
1107 } else if (buffer_list_bytes
[BUFFER_WARM_IN
] < kin
) {
1108 // warm_in is small, give slack to hot
1109 khot
+= kin
- buffer_list_bytes
[BUFFER_WARM_IN
];
1112 // adjust warm_in list
1113 int64_t to_evict_bytes
= buffer_list_bytes
[BUFFER_WARM_IN
] - kin
;
1114 uint64_t evicted
= 0;
1116 while (to_evict_bytes
> 0) {
1117 auto p
= buffer_warm_in
.rbegin();
1118 if (p
== buffer_warm_in
.rend()) {
1119 // stop if warm_in list is now empty
1124 assert(b
->is_clean());
1125 dout(20) << __func__
<< " buffer_warm_in -> out " << *b
<< dendl
;
1126 assert(buffer_bytes
>= b
->length
);
1127 buffer_bytes
-= b
->length
;
1128 assert(buffer_list_bytes
[BUFFER_WARM_IN
] >= b
->length
);
1129 buffer_list_bytes
[BUFFER_WARM_IN
] -= b
->length
;
1130 to_evict_bytes
-= b
->length
;
1131 evicted
+= b
->length
;
1132 b
->state
= Buffer::STATE_EMPTY
;
1134 buffer_warm_in
.erase(buffer_warm_in
.iterator_to(*b
));
1135 buffer_warm_out
.push_front(*b
);
1136 b
->cache_private
= BUFFER_WARM_OUT
;
1140 dout(20) << __func__
<< " evicted " << prettybyte_t(evicted
)
1141 << " from warm_in list, done evicting warm_in buffers"
1146 to_evict_bytes
= buffer_list_bytes
[BUFFER_HOT
] - khot
;
1149 while (to_evict_bytes
> 0) {
1150 auto p
= buffer_hot
.rbegin();
1151 if (p
== buffer_hot
.rend()) {
1152 // stop if hot list is now empty
1157 dout(20) << __func__
<< " buffer_hot rm " << *b
<< dendl
;
1158 assert(b
->is_clean());
1159 // adjust evict size before buffer goes invalid
1160 to_evict_bytes
-= b
->length
;
1161 evicted
+= b
->length
;
1162 b
->space
->_rm_buffer(this, b
);
1166 dout(20) << __func__
<< " evicted " << prettybyte_t(evicted
)
1167 << " from hot list, done evicting hot buffers"
1171 // adjust warm out list too, if necessary
1172 int64_t num
= buffer_warm_out
.size() - kout
;
1174 Buffer
*b
= &*buffer_warm_out
.rbegin();
1175 assert(b
->is_empty());
1176 dout(20) << __func__
<< " buffer_warm_out rm " << *b
<< dendl
;
1177 b
->space
->_rm_buffer(this, b
);
1182 int num
= onode_lru
.size() - onode_max
;
1184 return; // don't even try
1186 auto p
= onode_lru
.end();
1187 assert(p
!= onode_lru
.begin());
1190 int max_skipped
= g_conf
->bluestore_cache_trim_max_skip_pinned
;
1193 dout(20) << __func__
<< " considering " << o
<< dendl
;
1194 int refs
= o
->nref
.load();
1196 dout(20) << __func__
<< " " << o
->oid
<< " has " << refs
1197 << " refs; skipping" << dendl
;
1198 if (++skipped
>= max_skipped
) {
1199 dout(20) << __func__
<< " maximum skip pinned reached; stopping with "
1200 << num
<< " left to trim" << dendl
;
1204 if (p
== onode_lru
.begin()) {
1212 dout(30) << __func__
<< " " << o
->oid
<< " num=" << num
<<" lru size="<<onode_lru
.size()<< dendl
;
1213 if (p
!= onode_lru
.begin()) {
1214 onode_lru
.erase(p
--);
1219 o
->get(); // paranoia
1220 o
->c
->onode_map
.remove(o
->oid
);
1227 void BlueStore::TwoQCache::_audit(const char *when
)
1229 dout(10) << __func__
<< " " << when
<< " start" << dendl
;
1231 for (auto i
= buffer_hot
.begin(); i
!= buffer_hot
.end(); ++i
) {
1235 uint64_t hot_bytes
= s
;
1236 if (hot_bytes
!= buffer_list_bytes
[BUFFER_HOT
]) {
1237 derr
<< __func__
<< " hot_list_bytes "
1238 << buffer_list_bytes
[BUFFER_HOT
]
1239 << " != actual " << hot_bytes
1241 assert(hot_bytes
== buffer_list_bytes
[BUFFER_HOT
]);
1244 for (auto i
= buffer_warm_in
.begin(); i
!= buffer_warm_in
.end(); ++i
) {
1248 uint64_t warm_in_bytes
= s
- hot_bytes
;
1249 if (warm_in_bytes
!= buffer_list_bytes
[BUFFER_WARM_IN
]) {
1250 derr
<< __func__
<< " warm_in_list_bytes "
1251 << buffer_list_bytes
[BUFFER_WARM_IN
]
1252 << " != actual " << warm_in_bytes
1254 assert(warm_in_bytes
== buffer_list_bytes
[BUFFER_WARM_IN
]);
1257 if (s
!= buffer_bytes
) {
1258 derr
<< __func__
<< " buffer_bytes " << buffer_bytes
<< " actual " << s
1260 assert(s
== buffer_bytes
);
1263 dout(20) << __func__
<< " " << when
<< " buffer_bytes " << buffer_bytes
1272 #define dout_prefix *_dout << "bluestore.BufferSpace(" << this << " in " << cache << ") "
1274 void BlueStore::BufferSpace::_clear(Cache
* cache
)
1276 // note: we already hold cache->lock
1277 ldout(cache
->cct
, 20) << __func__
<< dendl
;
1278 while (!buffer_map
.empty()) {
1279 _rm_buffer(cache
, buffer_map
.begin());
1283 int BlueStore::BufferSpace::_discard(Cache
* cache
, uint32_t offset
, uint32_t length
)
1285 // note: we already hold cache->lock
1286 ldout(cache
->cct
, 20) << __func__
<< std::hex
<< " 0x" << offset
<< "~" << length
1287 << std::dec
<< dendl
;
1288 int cache_private
= 0;
1289 cache
->_audit("discard start");
1290 auto i
= _data_lower_bound(offset
);
1291 uint32_t end
= offset
+ length
;
1292 while (i
!= buffer_map
.end()) {
1293 Buffer
*b
= i
->second
.get();
1294 if (b
->offset
>= end
) {
1297 if (b
->cache_private
> cache_private
) {
1298 cache_private
= b
->cache_private
;
1300 if (b
->offset
< offset
) {
1301 int64_t front
= offset
- b
->offset
;
1302 if (b
->end() > end
) {
1303 // drop middle (split)
1304 uint32_t tail
= b
->end() - end
;
1305 if (b
->data
.length()) {
1307 bl
.substr_of(b
->data
, b
->length
- tail
, tail
);
1308 Buffer
*nb
= new Buffer(this, b
->state
, b
->seq
, end
, bl
);
1309 nb
->maybe_rebuild();
1310 _add_buffer(cache
, nb
, 0, b
);
1312 _add_buffer(cache
, new Buffer(this, b
->state
, b
->seq
, end
, tail
),
1315 if (!b
->is_writing()) {
1316 cache
->_adjust_buffer_size(b
, front
- (int64_t)b
->length
);
1320 cache
->_audit("discard end 1");
1324 if (!b
->is_writing()) {
1325 cache
->_adjust_buffer_size(b
, front
- (int64_t)b
->length
);
1333 if (b
->end() <= end
) {
1334 // drop entire buffer
1335 _rm_buffer(cache
, i
++);
1339 uint32_t keep
= b
->end() - end
;
1340 if (b
->data
.length()) {
1342 bl
.substr_of(b
->data
, b
->length
- keep
, keep
);
1343 Buffer
*nb
= new Buffer(this, b
->state
, b
->seq
, end
, bl
);
1344 nb
->maybe_rebuild();
1345 _add_buffer(cache
, nb
, 0, b
);
1347 _add_buffer(cache
, new Buffer(this, b
->state
, b
->seq
, end
, keep
), 0, b
);
1349 _rm_buffer(cache
, i
);
1350 cache
->_audit("discard end 2");
1353 return cache_private
;
1356 void BlueStore::BufferSpace::read(
1360 BlueStore::ready_regions_t
& res
,
1361 interval_set
<uint32_t>& res_intervals
)
1364 res_intervals
.clear();
1365 uint32_t want_bytes
= length
;
1366 uint32_t end
= offset
+ length
;
1369 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1370 for (auto i
= _data_lower_bound(offset
);
1371 i
!= buffer_map
.end() && offset
< end
&& i
->first
< end
;
1373 Buffer
*b
= i
->second
.get();
1374 assert(b
->end() > offset
);
1375 if (b
->is_writing() || b
->is_clean()) {
1376 if (b
->offset
< offset
) {
1377 uint32_t skip
= offset
- b
->offset
;
1378 uint32_t l
= MIN(length
, b
->length
- skip
);
1379 res
[offset
].substr_of(b
->data
, skip
, l
);
1380 res_intervals
.insert(offset
, l
);
1383 if (!b
->is_writing()) {
1384 cache
->_touch_buffer(b
);
1388 if (b
->offset
> offset
) {
1389 uint32_t gap
= b
->offset
- offset
;
1390 if (length
<= gap
) {
1396 if (!b
->is_writing()) {
1397 cache
->_touch_buffer(b
);
1399 if (b
->length
> length
) {
1400 res
[offset
].substr_of(b
->data
, 0, length
);
1401 res_intervals
.insert(offset
, length
);
1404 res
[offset
].append(b
->data
);
1405 res_intervals
.insert(offset
, b
->length
);
1406 if (b
->length
== length
)
1408 offset
+= b
->length
;
1409 length
-= b
->length
;
1415 uint64_t hit_bytes
= res_intervals
.size();
1416 assert(hit_bytes
<= want_bytes
);
1417 uint64_t miss_bytes
= want_bytes
- hit_bytes
;
1418 cache
->logger
->inc(l_bluestore_buffer_hit_bytes
, hit_bytes
);
1419 cache
->logger
->inc(l_bluestore_buffer_miss_bytes
, miss_bytes
);
1422 void BlueStore::BufferSpace::finish_write(Cache
* cache
, uint64_t seq
)
1424 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1426 auto i
= writing
.begin();
1427 while (i
!= writing
.end()) {
1437 assert(b
->is_writing());
1439 if (b
->flags
& Buffer::FLAG_NOCACHE
) {
1441 ldout(cache
->cct
, 20) << __func__
<< " discard " << *b
<< dendl
;
1442 buffer_map
.erase(b
->offset
);
1444 b
->state
= Buffer::STATE_CLEAN
;
1447 b
->data
.reassign_to_mempool(mempool::mempool_bluestore_cache_data
);
1448 cache
->_add_buffer(b
, 1, nullptr);
1449 ldout(cache
->cct
, 20) << __func__
<< " added " << *b
<< dendl
;
1453 cache
->_audit("finish_write end");
1456 void BlueStore::BufferSpace::split(Cache
* cache
, size_t pos
, BlueStore::BufferSpace
&r
)
1458 std::lock_guard
<std::recursive_mutex
> lk(cache
->lock
);
1459 if (buffer_map
.empty())
1462 auto p
= --buffer_map
.end();
1464 if (p
->second
->end() <= pos
)
1467 if (p
->second
->offset
< pos
) {
1468 ldout(cache
->cct
, 30) << __func__
<< " cut " << *p
->second
<< dendl
;
1469 size_t left
= pos
- p
->second
->offset
;
1470 size_t right
= p
->second
->length
- left
;
1471 if (p
->second
->data
.length()) {
1473 bl
.substr_of(p
->second
->data
, left
, right
);
1474 r
._add_buffer(cache
, new Buffer(&r
, p
->second
->state
, p
->second
->seq
, 0, bl
),
1475 0, p
->second
.get());
1477 r
._add_buffer(cache
, new Buffer(&r
, p
->second
->state
, p
->second
->seq
, 0, right
),
1478 0, p
->second
.get());
1480 cache
->_adjust_buffer_size(p
->second
.get(), -right
);
1481 p
->second
->truncate(left
);
1485 assert(p
->second
->end() > pos
);
1486 ldout(cache
->cct
, 30) << __func__
<< " move " << *p
->second
<< dendl
;
1487 if (p
->second
->data
.length()) {
1488 r
._add_buffer(cache
, new Buffer(&r
, p
->second
->state
, p
->second
->seq
,
1489 p
->second
->offset
- pos
, p
->second
->data
),
1490 0, p
->second
.get());
1492 r
._add_buffer(cache
, new Buffer(&r
, p
->second
->state
, p
->second
->seq
,
1493 p
->second
->offset
- pos
, p
->second
->length
),
1494 0, p
->second
.get());
1496 if (p
== buffer_map
.begin()) {
1497 _rm_buffer(cache
, p
);
1500 _rm_buffer(cache
, p
--);
1503 assert(writing
.empty());
1509 #define dout_prefix *_dout << "bluestore.OnodeSpace(" << this << " in " << cache << ") "
1511 BlueStore::OnodeRef
BlueStore::OnodeSpace::add(const ghobject_t
& oid
, OnodeRef o
)
1513 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1514 auto p
= onode_map
.find(oid
);
1515 if (p
!= onode_map
.end()) {
1516 ldout(cache
->cct
, 30) << __func__
<< " " << oid
<< " " << o
1517 << " raced, returning existing " << p
->second
1521 ldout(cache
->cct
, 30) << __func__
<< " " << oid
<< " " << o
<< dendl
;
1523 cache
->_add_onode(o
, 1);
1527 BlueStore::OnodeRef
BlueStore::OnodeSpace::lookup(const ghobject_t
& oid
)
1529 ldout(cache
->cct
, 30) << __func__
<< dendl
;
1534 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1535 ceph::unordered_map
<ghobject_t
,OnodeRef
>::iterator p
= onode_map
.find(oid
);
1536 if (p
== onode_map
.end()) {
1537 ldout(cache
->cct
, 30) << __func__
<< " " << oid
<< " miss" << dendl
;
1539 ldout(cache
->cct
, 30) << __func__
<< " " << oid
<< " hit " << p
->second
1541 cache
->_touch_onode(p
->second
);
1548 cache
->logger
->inc(l_bluestore_onode_hits
);
1550 cache
->logger
->inc(l_bluestore_onode_misses
);
1555 void BlueStore::OnodeSpace::clear()
1557 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1558 ldout(cache
->cct
, 10) << __func__
<< dendl
;
1559 for (auto &p
: onode_map
) {
1560 cache
->_rm_onode(p
.second
);
1565 bool BlueStore::OnodeSpace::empty()
1567 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1568 return onode_map
.empty();
1571 void BlueStore::OnodeSpace::rename(
1573 const ghobject_t
& old_oid
,
1574 const ghobject_t
& new_oid
,
1575 const mempool::bluestore_cache_other::string
& new_okey
)
1577 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1578 ldout(cache
->cct
, 30) << __func__
<< " " << old_oid
<< " -> " << new_oid
1580 ceph::unordered_map
<ghobject_t
,OnodeRef
>::iterator po
, pn
;
1581 po
= onode_map
.find(old_oid
);
1582 pn
= onode_map
.find(new_oid
);
1585 assert(po
!= onode_map
.end());
1586 if (pn
!= onode_map
.end()) {
1587 ldout(cache
->cct
, 30) << __func__
<< " removing target " << pn
->second
1589 cache
->_rm_onode(pn
->second
);
1590 onode_map
.erase(pn
);
1592 OnodeRef o
= po
->second
;
1594 // install a non-existent onode at old location
1595 oldo
.reset(new Onode(o
->c
, old_oid
, o
->key
));
1597 cache
->_add_onode(po
->second
, 1);
1599 // add at new position and fix oid, key
1600 onode_map
.insert(make_pair(new_oid
, o
));
1601 cache
->_touch_onode(o
);
1606 bool BlueStore::OnodeSpace::map_any(std::function
<bool(OnodeRef
)> f
)
1608 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
);
1609 ldout(cache
->cct
, 20) << __func__
<< dendl
;
1610 for (auto& i
: onode_map
) {
1622 #define dout_prefix *_dout << "bluestore.sharedblob(" << this << ") "
1624 ostream
& operator<<(ostream
& out
, const BlueStore::SharedBlob
& sb
)
1626 out
<< "SharedBlob(" << &sb
;
1629 out
<< " loaded " << *sb
.persistent
;
1631 out
<< " sbid 0x" << std::hex
<< sb
.sbid_unloaded
<< std::dec
;
1636 BlueStore::SharedBlob::SharedBlob(uint64_t i
, Collection
*_coll
)
1637 : coll(_coll
), sbid_unloaded(i
)
1639 assert(sbid_unloaded
> 0);
1641 get_cache()->add_blob();
1645 BlueStore::SharedBlob::~SharedBlob()
1647 if (get_cache()) { // the dummy instances have a nullptr
1648 std::lock_guard
<std::recursive_mutex
> l(get_cache()->lock
);
1649 bc
._clear(get_cache());
1650 get_cache()->rm_blob();
1652 if (loaded
&& persistent
) {
1657 void BlueStore::SharedBlob::put()
1660 ldout(coll
->store
->cct
, 20) << __func__
<< " " << this
1661 << " removing self from set " << get_parent()
1664 if (get_parent()->remove(this)) {
1667 ldout(coll
->store
->cct
, 20)
1668 << __func__
<< " " << this << " lost race to remove myself from set"
1677 void BlueStore::SharedBlob::get_ref(uint64_t offset
, uint32_t length
)
1680 persistent
->ref_map
.get(offset
, length
);
1683 void BlueStore::SharedBlob::put_ref(uint64_t offset
, uint32_t length
,
1685 set
<SharedBlob
*> *maybe_unshared
)
1689 persistent
->ref_map
.put(offset
, length
, r
, maybe_unshared
? &maybe
: nullptr);
1690 if (maybe_unshared
&& maybe
) {
1691 maybe_unshared
->insert(this);
1698 #define dout_prefix *_dout << "bluestore.blob(" << this << ") "
1700 ostream
& operator<<(ostream
& out
, const BlueStore::Blob
& b
)
1702 out
<< "Blob(" << &b
;
1703 if (b
.is_spanning()) {
1704 out
<< " spanning " << b
.id
;
1706 out
<< " " << b
.get_blob() << " " << b
.get_blob_use_tracker();
1707 if (b
.shared_blob
) {
1708 out
<< " " << *b
.shared_blob
;
1710 out
<< " (shared_blob=NULL)";
1716 void BlueStore::Blob::discard_unallocated(Collection
*coll
)
1718 if (get_blob().is_shared()) {
1721 if (get_blob().is_compressed()) {
1722 bool discard
= false;
1723 bool all_invalid
= true;
1724 for (auto e
: get_blob().get_extents()) {
1725 if (!e
.is_valid()) {
1728 all_invalid
= false;
1731 assert(discard
== all_invalid
); // in case of compressed blob all
1732 // or none pextents are invalid.
1734 shared_blob
->bc
.discard(shared_blob
->get_cache(), 0,
1735 get_blob().get_logical_length());
1739 for (auto e
: get_blob().get_extents()) {
1740 if (!e
.is_valid()) {
1741 ldout(coll
->store
->cct
, 20) << __func__
<< " 0x" << std::hex
<< pos
1743 << std::dec
<< dendl
;
1744 shared_blob
->bc
.discard(shared_blob
->get_cache(), pos
, e
.length
);
1748 if (get_blob().can_prune_tail()) {
1749 dirty_blob().prune_tail();
1750 used_in_blob
.prune_tail(get_blob().get_ondisk_length());
1751 auto cct
= coll
->store
->cct
; //used by dout
1752 dout(20) << __func__
<< " pruned tail, now " << get_blob() << dendl
;
1757 void BlueStore::Blob::get_ref(
1762 // Caller has to initialize Blob's logical length prior to increment
1763 // references. Otherwise one is neither unable to determine required
1764 // amount of counters in case of per-au tracking nor obtain min_release_size
1765 // for single counter mode.
1766 assert(get_blob().get_logical_length() != 0);
1767 auto cct
= coll
->store
->cct
;
1768 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
1769 << std::dec
<< " " << *this << dendl
;
1771 if (used_in_blob
.is_empty()) {
1772 uint32_t min_release_size
=
1773 get_blob().get_release_size(coll
->store
->min_alloc_size
);
1774 uint64_t l
= get_blob().get_logical_length();
1775 dout(20) << __func__
<< " init 0x" << std::hex
<< l
<< ", "
1776 << min_release_size
<< std::dec
<< dendl
;
1777 used_in_blob
.init(l
, min_release_size
);
1784 bool BlueStore::Blob::put_ref(
1790 PExtentVector logical
;
1792 auto cct
= coll
->store
->cct
;
1793 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
1794 << std::dec
<< " " << *this << dendl
;
1796 bool empty
= used_in_blob
.put(
1801 // nothing to release
1802 if (!empty
&& logical
.empty()) {
1806 bluestore_blob_t
& b
= dirty_blob();
1807 return b
.release_extents(empty
, logical
, r
);
1810 bool BlueStore::Blob::can_reuse_blob(uint32_t min_alloc_size
,
1811 uint32_t target_blob_size
,
1813 uint32_t *length0
) {
1814 assert(min_alloc_size
);
1815 assert(target_blob_size
);
1816 if (!get_blob().is_mutable()) {
1820 uint32_t length
= *length0
;
1821 uint32_t end
= b_offset
+ length
;
1823 // Currently for the sake of simplicity we omit blob reuse if data is
1824 // unaligned with csum chunk. Later we can perform padding if needed.
1825 if (get_blob().has_csum() &&
1826 ((b_offset
% get_blob().get_csum_chunk_size()) != 0 ||
1827 (end
% get_blob().get_csum_chunk_size()) != 0)) {
1831 auto blen
= get_blob().get_logical_length();
1832 uint32_t new_blen
= blen
;
1834 // make sure target_blob_size isn't less than current blob len
1835 target_blob_size
= MAX(blen
, target_blob_size
);
1837 if (b_offset
>= blen
) {
1838 // new data totally stands out of the existing blob
1841 // new data overlaps with the existing blob
1842 new_blen
= MAX(blen
, end
);
1844 uint32_t overlap
= 0;
1845 if (new_blen
> blen
) {
1846 overlap
= blen
- b_offset
;
1851 if (!get_blob().is_unallocated(b_offset
, overlap
)) {
1852 // abort if any piece of the overlap has already been allocated
1857 if (new_blen
> blen
) {
1858 int64_t overflow
= int64_t(new_blen
) - target_blob_size
;
1859 // Unable to decrease the provided length to fit into max_blob_size
1860 if (overflow
>= length
) {
1864 // FIXME: in some cases we could reduce unused resolution
1865 if (get_blob().has_unused()) {
1870 new_blen
-= overflow
;
1875 if (new_blen
> blen
) {
1876 dirty_blob().add_tail(new_blen
);
1877 used_in_blob
.add_tail(new_blen
,
1878 get_blob().get_release_size(min_alloc_size
));
1884 void BlueStore::Blob::split(Collection
*coll
, uint32_t blob_offset
, Blob
*r
)
1886 auto cct
= coll
->store
->cct
; //used by dout
1887 dout(10) << __func__
<< " 0x" << std::hex
<< blob_offset
<< std::dec
1888 << " start " << *this << dendl
;
1889 assert(blob
.can_split());
1890 assert(used_in_blob
.can_split());
1891 bluestore_blob_t
&lb
= dirty_blob();
1892 bluestore_blob_t
&rb
= r
->dirty_blob();
1896 &(r
->used_in_blob
));
1898 lb
.split(blob_offset
, rb
);
1899 shared_blob
->bc
.split(shared_blob
->get_cache(), blob_offset
, r
->shared_blob
->bc
);
1901 dout(10) << __func__
<< " 0x" << std::hex
<< blob_offset
<< std::dec
1902 << " finish " << *this << dendl
;
1903 dout(10) << __func__
<< " 0x" << std::hex
<< blob_offset
<< std::dec
1904 << " and " << *r
<< dendl
;
1907 #ifndef CACHE_BLOB_BL
1908 void BlueStore::Blob::decode(
1910 bufferptr::iterator
& p
,
1913 bool include_ref_map
)
1915 denc(blob
, p
, struct_v
);
1916 if (blob
.is_shared()) {
1919 if (include_ref_map
) {
1921 used_in_blob
.decode(p
);
1923 used_in_blob
.clear();
1924 bluestore_extent_ref_map_t legacy_ref_map
;
1925 legacy_ref_map
.decode(p
);
1926 for (auto r
: legacy_ref_map
.ref_map
) {
1930 r
.second
.refs
* r
.second
.length
);
1939 ostream
& operator<<(ostream
& out
, const BlueStore::Extent
& e
)
1941 return out
<< std::hex
<< "0x" << e
.logical_offset
<< "~" << e
.length
1942 << ": 0x" << e
.blob_offset
<< "~" << e
.length
<< std::dec
1947 BlueStore::OldExtent
* BlueStore::OldExtent::create(CollectionRef c
,
1952 OldExtent
* oe
= new OldExtent(lo
, o
, l
, b
);
1953 b
->put_ref(c
.get(), o
, l
, &(oe
->r
));
1954 oe
->blob_empty
= b
->get_referenced_bytes() == 0;
1961 #define dout_prefix *_dout << "bluestore.extentmap(" << this << ") "
1963 BlueStore::ExtentMap::ExtentMap(Onode
*o
)
1966 o
->c
->store
->cct
->_conf
->bluestore_extent_map_inline_shard_prealloc_size
) {
1969 void BlueStore::ExtentMap::update(KeyValueDB::Transaction t
,
1972 auto cct
= onode
->c
->store
->cct
; //used by dout
1973 dout(20) << __func__
<< " " << onode
->oid
<< (force
? " force" : "") << dendl
;
1974 if (onode
->onode
.extent_map_shards
.empty()) {
1975 if (inline_bl
.length() == 0) {
1977 // we need to encode inline_bl to measure encoded length
1978 bool never_happen
= encode_some(0, OBJECT_MAX_SIZE
, inline_bl
, &n
);
1979 assert(!never_happen
);
1980 size_t len
= inline_bl
.length();
1981 dout(20) << __func__
<< " inline shard " << len
<< " bytes from " << n
1982 << " extents" << dendl
;
1983 if (!force
&& len
> cct
->_conf
->bluestore_extent_map_shard_max_size
) {
1984 request_reshard(0, OBJECT_MAX_SIZE
);
1988 // will persist in the onode key.
1990 // pending shard update
1991 struct dirty_shard_t
{
1994 dirty_shard_t(Shard
*s
) : shard(s
) {}
1996 vector
<dirty_shard_t
> encoded_shards
;
1997 // allocate slots for all shards in a single call instead of
1998 // doing multiple allocations - one per each dirty shard
1999 encoded_shards
.reserve(shards
.size());
2001 auto p
= shards
.begin();
2003 while (p
!= shards
.end()) {
2004 assert(p
->shard_info
->offset
>= prev_p
->shard_info
->offset
);
2009 if (n
== shards
.end()) {
2010 endoff
= OBJECT_MAX_SIZE
;
2012 endoff
= n
->shard_info
->offset
;
2014 encoded_shards
.emplace_back(dirty_shard_t(&(*p
)));
2015 bufferlist
& bl
= encoded_shards
.back().bl
;
2016 if (encode_some(p
->shard_info
->offset
, endoff
- p
->shard_info
->offset
,
2019 derr
<< __func__
<< " encode_some needs reshard" << dendl
;
2023 size_t len
= bl
.length();
2025 dout(20) << __func__
<< " shard 0x" << std::hex
2026 << p
->shard_info
->offset
<< std::dec
<< " is " << len
2027 << " bytes (was " << p
->shard_info
->bytes
<< ") from "
2028 << p
->extents
<< " extents" << dendl
;
2031 if (len
> cct
->_conf
->bluestore_extent_map_shard_max_size
) {
2032 // we are big; reshard ourselves
2033 request_reshard(p
->shard_info
->offset
, endoff
);
2035 // avoid resharding the trailing shard, even if it is small
2036 else if (n
!= shards
.end() &&
2037 len
< g_conf
->bluestore_extent_map_shard_min_size
) {
2038 assert(endoff
!= OBJECT_MAX_SIZE
);
2039 if (p
== shards
.begin()) {
2040 // we are the first shard, combine with next shard
2041 request_reshard(p
->shard_info
->offset
, endoff
+ 1);
2043 // combine either with the previous shard or the next,
2044 // whichever is smaller
2045 if (prev_p
->shard_info
->bytes
> n
->shard_info
->bytes
) {
2046 request_reshard(p
->shard_info
->offset
, endoff
+ 1);
2048 request_reshard(prev_p
->shard_info
->offset
, endoff
);
2057 if (needs_reshard()) {
2061 // schedule DB update for dirty shards
2063 for (auto& it
: encoded_shards
) {
2064 it
.shard
->dirty
= false;
2065 it
.shard
->shard_info
->bytes
= it
.bl
.length();
2066 generate_extent_shard_key_and_apply(
2068 it
.shard
->shard_info
->offset
,
2070 [&](const string
& final_key
) {
2071 t
->set(PREFIX_OBJ
, final_key
, it
.bl
);
2078 bid_t
BlueStore::ExtentMap::allocate_spanning_blob_id()
2080 if (spanning_blob_map
.empty())
2082 bid_t bid
= spanning_blob_map
.rbegin()->first
+ 1;
2083 // bid is valid and available.
2086 // Find next unused bid;
2087 bid
= rand() % (numeric_limits
<bid_t
>::max() + 1);
2088 const auto begin_bid
= bid
;
2090 if (!spanning_blob_map
.count(bid
))
2094 if (bid
< 0) bid
= 0;
2096 } while (bid
!= begin_bid
);
2097 assert(0 == "no available blob id");
2100 void BlueStore::ExtentMap::reshard(
2102 KeyValueDB::Transaction t
)
2104 auto cct
= onode
->c
->store
->cct
; // used by dout
2106 dout(10) << __func__
<< " 0x[" << std::hex
<< needs_reshard_begin
<< ","
2107 << needs_reshard_end
<< ")" << std::dec
2108 << " of " << onode
->onode
.extent_map_shards
.size()
2109 << " shards on " << onode
->oid
<< dendl
;
2110 for (auto& p
: spanning_blob_map
) {
2111 dout(20) << __func__
<< " spanning blob " << p
.first
<< " " << *p
.second
2114 // determine shard index range
2115 unsigned si_begin
= 0, si_end
= 0;
2116 if (!shards
.empty()) {
2117 while (si_begin
+ 1 < shards
.size() &&
2118 shards
[si_begin
+ 1].shard_info
->offset
<= needs_reshard_begin
) {
2121 needs_reshard_begin
= shards
[si_begin
].shard_info
->offset
;
2122 for (si_end
= si_begin
; si_end
< shards
.size(); ++si_end
) {
2123 if (shards
[si_end
].shard_info
->offset
>= needs_reshard_end
) {
2124 needs_reshard_end
= shards
[si_end
].shard_info
->offset
;
2128 if (si_end
== shards
.size()) {
2129 needs_reshard_end
= OBJECT_MAX_SIZE
;
2131 dout(20) << __func__
<< " shards [" << si_begin
<< "," << si_end
<< ")"
2132 << " over 0x[" << std::hex
<< needs_reshard_begin
<< ","
2133 << needs_reshard_end
<< ")" << std::dec
<< dendl
;
2136 fault_range(db
, needs_reshard_begin
, needs_reshard_end
);
2138 // we may need to fault in a larger interval later must have all
2139 // referring extents for spanning blobs loaded in order to have
2140 // accurate use_tracker values.
2141 uint32_t spanning_scan_begin
= needs_reshard_begin
;
2142 uint32_t spanning_scan_end
= needs_reshard_end
;
2146 for (unsigned i
= si_begin
; i
< si_end
; ++i
) {
2147 generate_extent_shard_key_and_apply(
2148 onode
->key
, shards
[i
].shard_info
->offset
, &key
,
2149 [&](const string
& final_key
) {
2150 t
->rmkey(PREFIX_OBJ
, final_key
);
2155 // calculate average extent size
2157 unsigned extents
= 0;
2158 if (onode
->onode
.extent_map_shards
.empty()) {
2159 bytes
= inline_bl
.length();
2160 extents
= extent_map
.size();
2162 for (unsigned i
= si_begin
; i
< si_end
; ++i
) {
2163 bytes
+= shards
[i
].shard_info
->bytes
;
2164 extents
+= shards
[i
].extents
;
2167 unsigned target
= cct
->_conf
->bluestore_extent_map_shard_target_size
;
2168 unsigned slop
= target
*
2169 cct
->_conf
->bluestore_extent_map_shard_target_size_slop
;
2170 unsigned extent_avg
= bytes
/ MAX(1, extents
);
2171 dout(20) << __func__
<< " extent_avg " << extent_avg
<< ", target " << target
2172 << ", slop " << slop
<< dendl
;
2175 unsigned estimate
= 0;
2176 unsigned offset
= needs_reshard_begin
;
2177 vector
<bluestore_onode_t::shard_info
> new_shard_info
;
2178 unsigned max_blob_end
= 0;
2179 Extent
dummy(needs_reshard_begin
);
2180 for (auto e
= extent_map
.lower_bound(dummy
);
2181 e
!= extent_map
.end();
2183 if (e
->logical_offset
>= needs_reshard_end
) {
2186 dout(30) << " extent " << *e
<< dendl
;
2188 // disfavor shard boundaries that span a blob
2189 bool would_span
= (e
->logical_offset
< max_blob_end
) || e
->blob_offset
;
2191 estimate
+ extent_avg
> target
+ (would_span
? slop
: 0)) {
2193 if (offset
== needs_reshard_begin
) {
2194 new_shard_info
.emplace_back(bluestore_onode_t::shard_info());
2195 new_shard_info
.back().offset
= offset
;
2196 dout(20) << __func__
<< " new shard 0x" << std::hex
<< offset
2197 << std::dec
<< dendl
;
2199 offset
= e
->logical_offset
;
2200 new_shard_info
.emplace_back(bluestore_onode_t::shard_info());
2201 new_shard_info
.back().offset
= offset
;
2202 dout(20) << __func__
<< " new shard 0x" << std::hex
<< offset
2203 << std::dec
<< dendl
;
2206 estimate
+= extent_avg
;
2207 unsigned bs
= e
->blob_start();
2208 if (bs
< spanning_scan_begin
) {
2209 spanning_scan_begin
= bs
;
2211 uint32_t be
= e
->blob_end();
2212 if (be
> max_blob_end
) {
2215 if (be
> spanning_scan_end
) {
2216 spanning_scan_end
= be
;
2219 if (new_shard_info
.empty() && (si_begin
> 0 ||
2220 si_end
< shards
.size())) {
2221 // we resharded a partial range; we must produce at least one output
2223 new_shard_info
.emplace_back(bluestore_onode_t::shard_info());
2224 new_shard_info
.back().offset
= needs_reshard_begin
;
2225 dout(20) << __func__
<< " new shard 0x" << std::hex
<< needs_reshard_begin
2226 << std::dec
<< " (singleton degenerate case)" << dendl
;
2229 auto& sv
= onode
->onode
.extent_map_shards
;
2230 dout(20) << __func__
<< " new " << new_shard_info
<< dendl
;
2231 dout(20) << __func__
<< " old " << sv
<< dendl
;
2233 // no old shards to keep
2234 sv
.swap(new_shard_info
);
2235 init_shards(true, true);
2237 // splice in new shards
2238 sv
.erase(sv
.begin() + si_begin
, sv
.begin() + si_end
);
2239 shards
.erase(shards
.begin() + si_begin
, shards
.begin() + si_end
);
2241 sv
.begin() + si_begin
,
2242 new_shard_info
.begin(),
2243 new_shard_info
.end());
2244 shards
.insert(shards
.begin() + si_begin
, new_shard_info
.size(), Shard());
2245 si_end
= si_begin
+ new_shard_info
.size();
2247 assert(sv
.size() == shards
.size());
2249 // note that we need to update every shard_info of shards here,
2250 // as sv might have been totally re-allocated above
2251 for (unsigned i
= 0; i
< shards
.size(); i
++) {
2252 shards
[i
].shard_info
= &sv
[i
];
2255 // mark newly added shards as dirty
2256 for (unsigned i
= si_begin
; i
< si_end
; ++i
) {
2257 shards
[i
].loaded
= true;
2258 shards
[i
].dirty
= true;
2261 dout(20) << __func__
<< " fin " << sv
<< dendl
;
2265 // no more shards; unspan all previously spanning blobs
2266 auto p
= spanning_blob_map
.begin();
2267 while (p
!= spanning_blob_map
.end()) {
2269 dout(30) << __func__
<< " un-spanning " << *p
->second
<< dendl
;
2270 p
= spanning_blob_map
.erase(p
);
2273 // identify new spanning blobs
2274 dout(20) << __func__
<< " checking spanning blobs 0x[" << std::hex
2275 << spanning_scan_begin
<< "," << spanning_scan_end
<< ")" << dendl
;
2276 if (spanning_scan_begin
< needs_reshard_begin
) {
2277 fault_range(db
, spanning_scan_begin
,
2278 needs_reshard_begin
- spanning_scan_begin
);
2280 if (spanning_scan_end
> needs_reshard_end
) {
2281 fault_range(db
, needs_reshard_end
,
2282 spanning_scan_end
- needs_reshard_end
);
2284 auto sp
= sv
.begin() + si_begin
;
2285 auto esp
= sv
.end();
2286 unsigned shard_start
= sp
->offset
;
2290 shard_end
= OBJECT_MAX_SIZE
;
2292 shard_end
= sp
->offset
;
2294 Extent
dummy(needs_reshard_begin
);
2295 for (auto e
= extent_map
.lower_bound(dummy
); e
!= extent_map
.end(); ++e
) {
2296 if (e
->logical_offset
>= needs_reshard_end
) {
2299 dout(30) << " extent " << *e
<< dendl
;
2300 while (e
->logical_offset
>= shard_end
) {
2301 shard_start
= shard_end
;
2305 shard_end
= OBJECT_MAX_SIZE
;
2307 shard_end
= sp
->offset
;
2309 dout(30) << __func__
<< " shard 0x" << std::hex
<< shard_start
2310 << " to 0x" << shard_end
<< std::dec
<< dendl
;
2312 if (e
->blob_escapes_range(shard_start
, shard_end
- shard_start
)) {
2313 if (!e
->blob
->is_spanning()) {
2314 // We have two options: (1) split the blob into pieces at the
2315 // shard boundaries (and adjust extents accordingly), or (2)
2316 // mark it spanning. We prefer to cut the blob if we can. Note that
2317 // we may have to split it multiple times--potentially at every
2319 bool must_span
= false;
2320 BlobRef b
= e
->blob
;
2321 if (b
->can_split()) {
2322 uint32_t bstart
= e
->blob_start();
2323 uint32_t bend
= e
->blob_end();
2324 for (const auto& sh
: shards
) {
2325 if (bstart
< sh
.shard_info
->offset
&&
2326 bend
> sh
.shard_info
->offset
) {
2327 uint32_t blob_offset
= sh
.shard_info
->offset
- bstart
;
2328 if (b
->can_split_at(blob_offset
)) {
2329 dout(20) << __func__
<< " splitting blob, bstart 0x"
2330 << std::hex
<< bstart
<< " blob_offset 0x"
2331 << blob_offset
<< std::dec
<< " " << *b
<< dendl
;
2332 b
= split_blob(b
, blob_offset
, sh
.shard_info
->offset
);
2333 // switch b to the new right-hand side, in case it
2334 // *also* has to get split.
2335 bstart
+= blob_offset
;
2336 onode
->c
->store
->logger
->inc(l_bluestore_blob_split
);
2347 auto bid
= allocate_spanning_blob_id();
2349 spanning_blob_map
[b
->id
] = b
;
2350 dout(20) << __func__
<< " adding spanning " << *b
<< dendl
;
2354 if (e
->blob
->is_spanning()) {
2355 spanning_blob_map
.erase(e
->blob
->id
);
2357 dout(30) << __func__
<< " un-spanning " << *e
->blob
<< dendl
;
2363 clear_needs_reshard();
2366 bool BlueStore::ExtentMap::encode_some(
2372 auto cct
= onode
->c
->store
->cct
; //used by dout
2373 Extent
dummy(offset
);
2374 auto start
= extent_map
.lower_bound(dummy
);
2375 uint32_t end
= offset
+ length
;
2377 __u8 struct_v
= 2; // Version 2 differs from v1 in blob's ref_map
2378 // serialization only. Hence there is no specific
2379 // handling at ExtentMap level.
2383 bool must_reshard
= false;
2384 for (auto p
= start
;
2385 p
!= extent_map
.end() && p
->logical_offset
< end
;
2387 assert(p
->logical_offset
>= offset
);
2388 p
->blob
->last_encoded_id
= -1;
2389 if (!p
->blob
->is_spanning() && p
->blob_escapes_range(offset
, length
)) {
2390 dout(30) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
2391 << std::dec
<< " hit new spanning blob " << *p
<< dendl
;
2392 request_reshard(p
->blob_start(), p
->blob_end());
2393 must_reshard
= true;
2395 if (!must_reshard
) {
2396 denc_varint(0, bound
); // blobid
2397 denc_varint(0, bound
); // logical_offset
2398 denc_varint(0, bound
); // len
2399 denc_varint(0, bound
); // blob_offset
2401 p
->blob
->bound_encode(
2404 p
->blob
->shared_blob
->get_sbid(),
2412 denc(struct_v
, bound
);
2413 denc_varint(0, bound
); // number of extents
2416 auto app
= bl
.get_contiguous_appender(bound
);
2417 denc(struct_v
, app
);
2418 denc_varint(n
, app
);
2425 uint64_t prev_len
= 0;
2426 for (auto p
= start
;
2427 p
!= extent_map
.end() && p
->logical_offset
< end
;
2430 bool include_blob
= false;
2431 if (p
->blob
->is_spanning()) {
2432 blobid
= p
->blob
->id
<< BLOBID_SHIFT_BITS
;
2433 blobid
|= BLOBID_FLAG_SPANNING
;
2434 } else if (p
->blob
->last_encoded_id
< 0) {
2435 p
->blob
->last_encoded_id
= n
+ 1; // so it is always non-zero
2436 include_blob
= true;
2437 blobid
= 0; // the decoder will infer the id from n
2439 blobid
= p
->blob
->last_encoded_id
<< BLOBID_SHIFT_BITS
;
2441 if (p
->logical_offset
== pos
) {
2442 blobid
|= BLOBID_FLAG_CONTIGUOUS
;
2444 if (p
->blob_offset
== 0) {
2445 blobid
|= BLOBID_FLAG_ZEROOFFSET
;
2447 if (p
->length
== prev_len
) {
2448 blobid
|= BLOBID_FLAG_SAMELENGTH
;
2450 prev_len
= p
->length
;
2452 denc_varint(blobid
, app
);
2453 if ((blobid
& BLOBID_FLAG_CONTIGUOUS
) == 0) {
2454 denc_varint_lowz(p
->logical_offset
- pos
, app
);
2456 if ((blobid
& BLOBID_FLAG_ZEROOFFSET
) == 0) {
2457 denc_varint_lowz(p
->blob_offset
, app
);
2459 if ((blobid
& BLOBID_FLAG_SAMELENGTH
) == 0) {
2460 denc_varint_lowz(p
->length
, app
);
2462 pos
= p
->logical_end();
2464 p
->blob
->encode(app
, struct_v
, p
->blob
->shared_blob
->get_sbid(), false);
2468 /*derr << __func__ << bl << dendl;
2469 derr << __func__ << ":";
2476 unsigned BlueStore::ExtentMap::decode_some(bufferlist
& bl
)
2478 auto cct
= onode
->c
->store
->cct
; //used by dout
2480 derr << __func__ << ":";
2485 assert(bl
.get_num_buffers() <= 1);
2486 auto p
= bl
.front().begin_deep();
2489 // Version 2 differs from v1 in blob's ref_map
2490 // serialization only. Hence there is no specific
2491 // handling at ExtentMap level below.
2492 assert(struct_v
== 1 || struct_v
== 2);
2495 denc_varint(num
, p
);
2496 vector
<BlobRef
> blobs(num
);
2498 uint64_t prev_len
= 0;
2502 Extent
*le
= new Extent();
2504 denc_varint(blobid
, p
);
2505 if ((blobid
& BLOBID_FLAG_CONTIGUOUS
) == 0) {
2507 denc_varint_lowz(gap
, p
);
2510 le
->logical_offset
= pos
;
2511 if ((blobid
& BLOBID_FLAG_ZEROOFFSET
) == 0) {
2512 denc_varint_lowz(le
->blob_offset
, p
);
2514 le
->blob_offset
= 0;
2516 if ((blobid
& BLOBID_FLAG_SAMELENGTH
) == 0) {
2517 denc_varint_lowz(prev_len
, p
);
2519 le
->length
= prev_len
;
2521 if (blobid
& BLOBID_FLAG_SPANNING
) {
2522 dout(30) << __func__
<< " getting spanning blob "
2523 << (blobid
>> BLOBID_SHIFT_BITS
) << dendl
;
2524 le
->assign_blob(get_spanning_blob(blobid
>> BLOBID_SHIFT_BITS
));
2526 blobid
>>= BLOBID_SHIFT_BITS
;
2528 le
->assign_blob(blobs
[blobid
- 1]);
2531 Blob
*b
= new Blob();
2533 b
->decode(onode
->c
, p
, struct_v
, &sbid
, false);
2535 onode
->c
->open_shared_blob(sbid
, b
);
2538 // we build ref_map dynamically for non-spanning blobs
2546 extent_map
.insert(*le
);
2553 void BlueStore::ExtentMap::bound_encode_spanning_blobs(size_t& p
)
2555 // Version 2 differs from v1 in blob's ref_map
2556 // serialization only. Hence there is no specific
2557 // handling at ExtentMap level.
2561 denc_varint((uint32_t)0, p
);
2562 size_t key_size
= 0;
2563 denc_varint((uint32_t)0, key_size
);
2564 p
+= spanning_blob_map
.size() * key_size
;
2565 for (const auto& i
: spanning_blob_map
) {
2566 i
.second
->bound_encode(p
, struct_v
, i
.second
->shared_blob
->get_sbid(), true);
2570 void BlueStore::ExtentMap::encode_spanning_blobs(
2571 bufferlist::contiguous_appender
& p
)
2573 // Version 2 differs from v1 in blob's ref_map
2574 // serialization only. Hence there is no specific
2575 // handling at ExtentMap level.
2579 denc_varint(spanning_blob_map
.size(), p
);
2580 for (auto& i
: spanning_blob_map
) {
2581 denc_varint(i
.second
->id
, p
);
2582 i
.second
->encode(p
, struct_v
, i
.second
->shared_blob
->get_sbid(), true);
2586 void BlueStore::ExtentMap::decode_spanning_blobs(
2587 bufferptr::iterator
& p
)
2591 // Version 2 differs from v1 in blob's ref_map
2592 // serialization only. Hence there is no specific
2593 // handling at ExtentMap level.
2594 assert(struct_v
== 1 || struct_v
== 2);
2599 BlobRef
b(new Blob());
2600 denc_varint(b
->id
, p
);
2601 spanning_blob_map
[b
->id
] = b
;
2603 b
->decode(onode
->c
, p
, struct_v
, &sbid
, true);
2604 onode
->c
->open_shared_blob(sbid
, b
);
2608 void BlueStore::ExtentMap::init_shards(bool loaded
, bool dirty
)
2610 shards
.resize(onode
->onode
.extent_map_shards
.size());
2612 for (auto &s
: onode
->onode
.extent_map_shards
) {
2613 shards
[i
].shard_info
= &s
;
2614 shards
[i
].loaded
= loaded
;
2615 shards
[i
].dirty
= dirty
;
2620 void BlueStore::ExtentMap::fault_range(
2625 auto cct
= onode
->c
->store
->cct
; //used by dout
2626 dout(30) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
2627 << std::dec
<< dendl
;
2628 auto start
= seek_shard(offset
);
2629 auto last
= seek_shard(offset
+ length
);
2634 assert(last
>= start
);
2636 while (start
<= last
) {
2637 assert((size_t)start
< shards
.size());
2638 auto p
= &shards
[start
];
2640 dout(30) << __func__
<< " opening shard 0x" << std::hex
2641 << p
->shard_info
->offset
<< std::dec
<< dendl
;
2643 generate_extent_shard_key_and_apply(
2644 onode
->key
, p
->shard_info
->offset
, &key
,
2645 [&](const string
& final_key
) {
2646 int r
= db
->get(PREFIX_OBJ
, final_key
, &v
);
2648 derr
<< __func__
<< " missing shard 0x" << std::hex
2649 << p
->shard_info
->offset
<< std::dec
<< " for " << onode
->oid
2655 p
->extents
= decode_some(v
);
2657 dout(20) << __func__
<< " open shard 0x" << std::hex
2658 << p
->shard_info
->offset
<< std::dec
2659 << " (" << v
.length() << " bytes)" << dendl
;
2660 assert(p
->dirty
== false);
2661 assert(v
.length() == p
->shard_info
->bytes
);
2662 onode
->c
->store
->logger
->inc(l_bluestore_onode_shard_misses
);
2664 onode
->c
->store
->logger
->inc(l_bluestore_onode_shard_hits
);
2670 void BlueStore::ExtentMap::dirty_range(
2674 auto cct
= onode
->c
->store
->cct
; //used by dout
2675 dout(30) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
2676 << std::dec
<< dendl
;
2677 if (shards
.empty()) {
2678 dout(20) << __func__
<< " mark inline shard dirty" << dendl
;
2682 auto start
= seek_shard(offset
);
2683 auto last
= seek_shard(offset
+ length
);
2687 assert(last
>= start
);
2688 while (start
<= last
) {
2689 assert((size_t)start
< shards
.size());
2690 auto p
= &shards
[start
];
2692 dout(20) << __func__
<< " shard 0x" << std::hex
<< p
->shard_info
->offset
2693 << std::dec
<< " is not loaded, can't mark dirty" << dendl
;
2694 assert(0 == "can't mark unloaded shard dirty");
2697 dout(20) << __func__
<< " mark shard 0x" << std::hex
2698 << p
->shard_info
->offset
<< std::dec
<< " dirty" << dendl
;
2705 BlueStore::extent_map_t::iterator
BlueStore::ExtentMap::find(
2708 Extent
dummy(offset
);
2709 return extent_map
.find(dummy
);
2712 BlueStore::extent_map_t::iterator
BlueStore::ExtentMap::seek_lextent(
2715 Extent
dummy(offset
);
2716 auto fp
= extent_map
.lower_bound(dummy
);
2717 if (fp
!= extent_map
.begin()) {
2719 if (fp
->logical_end() <= offset
) {
2726 BlueStore::extent_map_t::const_iterator
BlueStore::ExtentMap::seek_lextent(
2727 uint64_t offset
) const
2729 Extent
dummy(offset
);
2730 auto fp
= extent_map
.lower_bound(dummy
);
2731 if (fp
!= extent_map
.begin()) {
2733 if (fp
->logical_end() <= offset
) {
2740 bool BlueStore::ExtentMap::has_any_lextents(uint64_t offset
, uint64_t length
)
2742 auto fp
= seek_lextent(offset
);
2743 if (fp
== extent_map
.end() || fp
->logical_offset
>= offset
+ length
) {
2749 int BlueStore::ExtentMap::compress_extent_map(
2753 auto cct
= onode
->c
->store
->cct
; //used by dout
2754 if (extent_map
.empty())
2757 auto p
= seek_lextent(offset
);
2758 if (p
!= extent_map
.begin()) {
2759 --p
; // start to the left of offset
2761 // the caller should have just written to this region
2762 assert(p
!= extent_map
.end());
2764 // identify the *next* shard
2765 auto pshard
= shards
.begin();
2766 while (pshard
!= shards
.end() &&
2767 p
->logical_offset
>= pshard
->shard_info
->offset
) {
2771 if (pshard
!= shards
.end()) {
2772 shard_end
= pshard
->shard_info
->offset
;
2774 shard_end
= OBJECT_MAX_SIZE
;
2778 for (++n
; n
!= extent_map
.end(); p
= n
++) {
2779 if (n
->logical_offset
> offset
+ length
) {
2780 break; // stop after end
2782 while (n
!= extent_map
.end() &&
2783 p
->logical_end() == n
->logical_offset
&&
2784 p
->blob
== n
->blob
&&
2785 p
->blob_offset
+ p
->length
== n
->blob_offset
&&
2786 n
->logical_offset
< shard_end
) {
2787 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
2788 << " next shard 0x" << shard_end
<< std::dec
2789 << " merging " << *p
<< " and " << *n
<< dendl
;
2790 p
->length
+= n
->length
;
2794 if (n
== extent_map
.end()) {
2797 if (n
->logical_offset
>= shard_end
) {
2798 assert(pshard
!= shards
.end());
2800 if (pshard
!= shards
.end()) {
2801 shard_end
= pshard
->shard_info
->offset
;
2803 shard_end
= OBJECT_MAX_SIZE
;
2807 if (removed
&& onode
) {
2808 onode
->c
->store
->logger
->inc(l_bluestore_extent_compress
, removed
);
2813 void BlueStore::ExtentMap::punch_hole(
2817 old_extent_map_t
*old_extents
)
2819 auto p
= seek_lextent(offset
);
2820 uint64_t end
= offset
+ length
;
2821 while (p
!= extent_map
.end()) {
2822 if (p
->logical_offset
>= end
) {
2825 if (p
->logical_offset
< offset
) {
2826 if (p
->logical_end() > end
) {
2827 // split and deref middle
2828 uint64_t front
= offset
- p
->logical_offset
;
2829 OldExtent
* oe
= OldExtent::create(c
, offset
, p
->blob_offset
+ front
,
2831 old_extents
->push_back(*oe
);
2833 p
->blob_offset
+ front
+ length
,
2834 p
->length
- front
- length
,
2840 assert(p
->logical_end() > offset
); // else seek_lextent bug
2841 uint64_t keep
= offset
- p
->logical_offset
;
2842 OldExtent
* oe
= OldExtent::create(c
, offset
, p
->blob_offset
+ keep
,
2843 p
->length
- keep
, p
->blob
);
2844 old_extents
->push_back(*oe
);
2850 if (p
->logical_offset
+ p
->length
<= end
) {
2851 // deref whole lextent
2852 OldExtent
* oe
= OldExtent::create(c
, p
->logical_offset
, p
->blob_offset
,
2853 p
->length
, p
->blob
);
2854 old_extents
->push_back(*oe
);
2859 uint64_t keep
= p
->logical_end() - end
;
2860 OldExtent
* oe
= OldExtent::create(c
, p
->logical_offset
, p
->blob_offset
,
2861 p
->length
- keep
, p
->blob
);
2862 old_extents
->push_back(*oe
);
2864 add(end
, p
->blob_offset
+ p
->length
- keep
, keep
, p
->blob
);
2870 BlueStore::Extent
*BlueStore::ExtentMap::set_lextent(
2872 uint64_t logical_offset
,
2873 uint64_t blob_offset
, uint64_t length
, BlobRef b
,
2874 old_extent_map_t
*old_extents
)
2876 // We need to have completely initialized Blob to increment its ref counters.
2877 assert(b
->get_blob().get_logical_length() != 0);
2879 // Do get_ref prior to punch_hole to prevent from putting reused blob into
2880 // old_extents list if we overwre the blob totally
2881 // This might happen during WAL overwrite.
2882 b
->get_ref(onode
->c
, blob_offset
, length
);
2885 punch_hole(c
, logical_offset
, length
, old_extents
);
2888 Extent
*le
= new Extent(logical_offset
, blob_offset
, length
, b
);
2889 extent_map
.insert(*le
);
2890 if (spans_shard(logical_offset
, length
)) {
2891 request_reshard(logical_offset
, logical_offset
+ length
);
2896 BlueStore::BlobRef
BlueStore::ExtentMap::split_blob(
2898 uint32_t blob_offset
,
2901 auto cct
= onode
->c
->store
->cct
; //used by dout
2903 uint32_t end_pos
= pos
+ lb
->get_blob().get_logical_length() - blob_offset
;
2904 dout(20) << __func__
<< " 0x" << std::hex
<< pos
<< " end 0x" << end_pos
2905 << " blob_offset 0x" << blob_offset
<< std::dec
<< " " << *lb
2907 BlobRef rb
= onode
->c
->new_blob();
2908 lb
->split(onode
->c
, blob_offset
, rb
.get());
2910 for (auto ep
= seek_lextent(pos
);
2911 ep
!= extent_map
.end() && ep
->logical_offset
< end_pos
;
2913 if (ep
->blob
!= lb
) {
2916 if (ep
->logical_offset
< pos
) {
2918 size_t left
= pos
- ep
->logical_offset
;
2919 Extent
*ne
= new Extent(pos
, 0, ep
->length
- left
, rb
);
2920 extent_map
.insert(*ne
);
2922 dout(30) << __func__
<< " split " << *ep
<< dendl
;
2923 dout(30) << __func__
<< " to " << *ne
<< dendl
;
2926 assert(ep
->blob_offset
>= blob_offset
);
2929 ep
->blob_offset
-= blob_offset
;
2930 dout(30) << __func__
<< " adjusted " << *ep
<< dendl
;
2939 #define dout_prefix *_dout << "bluestore.onode(" << this << ")." << __func__ << " "
2941 void BlueStore::Onode::flush()
2943 if (flushing_count
.load()) {
2944 ldout(c
->store
->cct
, 20) << __func__
<< " cnt:" << flushing_count
<< dendl
;
2945 std::unique_lock
<std::mutex
> l(flush_lock
);
2946 while (flushing_count
.load()) {
2950 ldout(c
->store
->cct
, 20) << __func__
<< " done" << dendl
;
2953 // =======================================================
2956 /// Checks for writes to the same pextent within a blob
2957 bool BlueStore::WriteContext::has_conflict(
2961 uint64_t min_alloc_size
)
2963 assert((loffs
% min_alloc_size
) == 0);
2964 assert((loffs_end
% min_alloc_size
) == 0);
2965 for (auto w
: writes
) {
2967 auto loffs2
= P2ALIGN(w
.logical_offset
, min_alloc_size
);
2968 auto loffs2_end
= P2ROUNDUP(w
.logical_offset
+ w
.length0
, min_alloc_size
);
2969 if ((loffs
<= loffs2
&& loffs_end
> loffs2
) ||
2970 (loffs
>= loffs2
&& loffs
< loffs2_end
)) {
2978 // =======================================================
2982 #define dout_prefix *_dout << "bluestore.DeferredBatch(" << this << ") "
2984 void BlueStore::DeferredBatch::prepare_write(
2986 uint64_t seq
, uint64_t offset
, uint64_t length
,
2987 bufferlist::const_iterator
& blp
)
2989 _discard(cct
, offset
, length
);
2990 auto i
= iomap
.insert(make_pair(offset
, deferred_io()));
2991 assert(i
.second
); // this should be a new insertion
2992 i
.first
->second
.seq
= seq
;
2993 blp
.copy(length
, i
.first
->second
.bl
);
2994 i
.first
->second
.bl
.reassign_to_mempool(
2995 mempool::mempool_bluestore_writing_deferred
);
2996 dout(20) << __func__
<< " seq " << seq
2997 << " 0x" << std::hex
<< offset
<< "~" << length
2998 << " crc " << i
.first
->second
.bl
.crc32c(-1)
2999 << std::dec
<< dendl
;
3000 seq_bytes
[seq
] += length
;
3001 #ifdef DEBUG_DEFERRED
3006 void BlueStore::DeferredBatch::_discard(
3007 CephContext
*cct
, uint64_t offset
, uint64_t length
)
3009 generic_dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
3010 << std::dec
<< dendl
;
3011 auto p
= iomap
.lower_bound(offset
);
3012 if (p
!= iomap
.begin()) {
3014 auto end
= p
->first
+ p
->second
.bl
.length();
3017 head
.substr_of(p
->second
.bl
, 0, offset
- p
->first
);
3018 dout(20) << __func__
<< " keep head " << p
->second
.seq
3019 << " 0x" << std::hex
<< p
->first
<< "~" << p
->second
.bl
.length()
3020 << " -> 0x" << head
.length() << std::dec
<< dendl
;
3021 auto i
= seq_bytes
.find(p
->second
.seq
);
3022 assert(i
!= seq_bytes
.end());
3023 if (end
> offset
+ length
) {
3025 tail
.substr_of(p
->second
.bl
, offset
+ length
- p
->first
,
3026 end
- (offset
+ length
));
3027 dout(20) << __func__
<< " keep tail " << p
->second
.seq
3028 << " 0x" << std::hex
<< p
->first
<< "~" << p
->second
.bl
.length()
3029 << " -> 0x" << tail
.length() << std::dec
<< dendl
;
3030 auto &n
= iomap
[offset
+ length
];
3032 n
.seq
= p
->second
.seq
;
3033 i
->second
-= length
;
3035 i
->second
-= end
- offset
;
3037 assert(i
->second
>= 0);
3038 p
->second
.bl
.swap(head
);
3042 while (p
!= iomap
.end()) {
3043 if (p
->first
>= offset
+ length
) {
3046 auto i
= seq_bytes
.find(p
->second
.seq
);
3047 assert(i
!= seq_bytes
.end());
3048 auto end
= p
->first
+ p
->second
.bl
.length();
3049 if (end
> offset
+ length
) {
3050 unsigned drop_front
= offset
+ length
- p
->first
;
3051 unsigned keep_tail
= end
- (offset
+ length
);
3052 dout(20) << __func__
<< " truncate front " << p
->second
.seq
3053 << " 0x" << std::hex
<< p
->first
<< "~" << p
->second
.bl
.length()
3054 << " drop_front 0x" << drop_front
<< " keep_tail 0x" << keep_tail
3055 << " to 0x" << (offset
+ length
) << "~" << keep_tail
3056 << std::dec
<< dendl
;
3057 auto &s
= iomap
[offset
+ length
];
3058 s
.seq
= p
->second
.seq
;
3059 s
.bl
.substr_of(p
->second
.bl
, drop_front
, keep_tail
);
3060 i
->second
-= drop_front
;
3062 dout(20) << __func__
<< " drop " << p
->second
.seq
3063 << " 0x" << std::hex
<< p
->first
<< "~" << p
->second
.bl
.length()
3064 << std::dec
<< dendl
;
3065 i
->second
-= p
->second
.bl
.length();
3067 assert(i
->second
>= 0);
3072 void BlueStore::DeferredBatch::_audit(CephContext
*cct
)
3074 map
<uint64_t,int> sb
;
3075 for (auto p
: seq_bytes
) {
3076 sb
[p
.first
] = 0; // make sure we have the same set of keys
3079 for (auto& p
: iomap
) {
3080 assert(p
.first
>= pos
);
3081 sb
[p
.second
.seq
] += p
.second
.bl
.length();
3082 pos
= p
.first
+ p
.second
.bl
.length();
3084 assert(sb
== seq_bytes
);
3091 #define dout_prefix *_dout << "bluestore(" << store->path << ").collection(" << cid << " " << this << ") "
3093 BlueStore::Collection::Collection(BlueStore
*ns
, Cache
*c
, coll_t cid
)
3097 lock("BlueStore::Collection::lock", true, false),
3103 void BlueStore::Collection::open_shared_blob(uint64_t sbid
, BlobRef b
)
3105 assert(!b
->shared_blob
);
3106 const bluestore_blob_t
& blob
= b
->get_blob();
3107 if (!blob
.is_shared()) {
3108 b
->shared_blob
= new SharedBlob(this);
3112 b
->shared_blob
= shared_blob_set
.lookup(sbid
);
3113 if (b
->shared_blob
) {
3114 ldout(store
->cct
, 10) << __func__
<< " sbid 0x" << std::hex
<< sbid
3115 << std::dec
<< " had " << *b
->shared_blob
<< dendl
;
3117 b
->shared_blob
= new SharedBlob(sbid
, this);
3118 shared_blob_set
.add(this, b
->shared_blob
.get());
3119 ldout(store
->cct
, 10) << __func__
<< " sbid 0x" << std::hex
<< sbid
3120 << std::dec
<< " opened " << *b
->shared_blob
3125 void BlueStore::Collection::load_shared_blob(SharedBlobRef sb
)
3127 if (!sb
->is_loaded()) {
3131 auto sbid
= sb
->get_sbid();
3132 get_shared_blob_key(sbid
, &key
);
3133 int r
= store
->db
->get(PREFIX_SHARED_BLOB
, key
, &v
);
3135 lderr(store
->cct
) << __func__
<< " sbid 0x" << std::hex
<< sbid
3136 << std::dec
<< " not found at key "
3137 << pretty_binary_string(key
) << dendl
;
3138 assert(0 == "uh oh, missing shared_blob");
3142 sb
->persistent
= new bluestore_shared_blob_t(sbid
);
3143 bufferlist::iterator p
= v
.begin();
3144 ::decode(*(sb
->persistent
), p
);
3145 ldout(store
->cct
, 10) << __func__
<< " sbid 0x" << std::hex
<< sbid
3146 << std::dec
<< " loaded shared_blob " << *sb
<< dendl
;
3150 void BlueStore::Collection::make_blob_shared(uint64_t sbid
, BlobRef b
)
3152 ldout(store
->cct
, 10) << __func__
<< " " << *b
<< dendl
;
3153 assert(!b
->shared_blob
->is_loaded());
3156 bluestore_blob_t
& blob
= b
->dirty_blob();
3157 blob
.set_flag(bluestore_blob_t::FLAG_SHARED
);
3159 // update shared blob
3160 b
->shared_blob
->loaded
= true;
3161 b
->shared_blob
->persistent
= new bluestore_shared_blob_t(sbid
);
3162 shared_blob_set
.add(this, b
->shared_blob
.get());
3163 for (auto p
: blob
.get_extents()) {
3165 b
->shared_blob
->get_ref(
3170 ldout(store
->cct
, 20) << __func__
<< " now " << *b
<< dendl
;
3173 uint64_t BlueStore::Collection::make_blob_unshared(SharedBlob
*sb
)
3175 ldout(store
->cct
, 10) << __func__
<< " " << *sb
<< dendl
;
3176 assert(sb
->is_loaded());
3178 uint64_t sbid
= sb
->get_sbid();
3179 shared_blob_set
.remove(sb
);
3181 delete sb
->persistent
;
3182 sb
->sbid_unloaded
= 0;
3183 ldout(store
->cct
, 20) << __func__
<< " now " << *sb
<< dendl
;
3187 BlueStore::OnodeRef
BlueStore::Collection::get_onode(
3188 const ghobject_t
& oid
,
3191 assert(create
? lock
.is_wlocked() : lock
.is_locked());
3194 if (cid
.is_pg(&pgid
)) {
3195 if (!oid
.match(cnode
.bits
, pgid
.ps())) {
3196 lderr(store
->cct
) << __func__
<< " oid " << oid
<< " not part of "
3197 << pgid
<< " bits " << cnode
.bits
<< dendl
;
3202 OnodeRef o
= onode_map
.lookup(oid
);
3206 mempool::bluestore_cache_other::string key
;
3207 get_object_key(store
->cct
, oid
, &key
);
3209 ldout(store
->cct
, 20) << __func__
<< " oid " << oid
<< " key "
3210 << pretty_binary_string(key
) << dendl
;
3213 int r
= store
->db
->get(PREFIX_OBJ
, key
.c_str(), key
.size(), &v
);
3214 ldout(store
->cct
, 20) << " r " << r
<< " v.len " << v
.length() << dendl
;
3216 if (v
.length() == 0) {
3217 assert(r
== -ENOENT
);
3218 if (!store
->cct
->_conf
->bluestore_debug_misc
&&
3222 // new object, new onode
3223 on
= new Onode(this, oid
, key
);
3227 on
= new Onode(this, oid
, key
);
3229 bufferptr::iterator p
= v
.front().begin_deep();
3230 on
->onode
.decode(p
);
3232 // initialize extent_map
3233 on
->extent_map
.decode_spanning_blobs(p
);
3234 if (on
->onode
.extent_map_shards
.empty()) {
3235 denc(on
->extent_map
.inline_bl
, p
);
3236 on
->extent_map
.decode_some(on
->extent_map
.inline_bl
);
3238 on
->extent_map
.init_shards(false, false);
3242 return onode_map
.add(oid
, o
);
3245 void BlueStore::Collection::split_cache(
3248 ldout(store
->cct
, 10) << __func__
<< " to " << dest
<< dendl
;
3250 // lock (one or both) cache shards
3251 std::lock(cache
->lock
, dest
->cache
->lock
);
3252 std::lock_guard
<std::recursive_mutex
> l(cache
->lock
, std::adopt_lock
);
3253 std::lock_guard
<std::recursive_mutex
> l2(dest
->cache
->lock
, std::adopt_lock
);
3255 int destbits
= dest
->cnode
.bits
;
3257 bool is_pg
= dest
->cid
.is_pg(&destpg
);
3260 auto p
= onode_map
.onode_map
.begin();
3261 while (p
!= onode_map
.onode_map
.end()) {
3262 if (!p
->second
->oid
.match(destbits
, destpg
.pgid
.ps())) {
3263 // onode does not belong to this child
3266 OnodeRef o
= p
->second
;
3267 ldout(store
->cct
, 20) << __func__
<< " moving " << o
<< " " << o
->oid
3270 cache
->_rm_onode(p
->second
);
3271 p
= onode_map
.onode_map
.erase(p
);
3274 dest
->cache
->_add_onode(o
, 1);
3275 dest
->onode_map
.onode_map
[o
->oid
] = o
;
3276 dest
->onode_map
.cache
= dest
->cache
;
3278 // move over shared blobs and buffers. cover shared blobs from
3279 // both extent map and spanning blob map (the full extent map
3280 // may not be faulted in)
3281 vector
<SharedBlob
*> sbvec
;
3282 for (auto& e
: o
->extent_map
.extent_map
) {
3283 sbvec
.push_back(e
.blob
->shared_blob
.get());
3285 for (auto& b
: o
->extent_map
.spanning_blob_map
) {
3286 sbvec
.push_back(b
.second
->shared_blob
.get());
3288 for (auto sb
: sbvec
) {
3289 if (sb
->coll
== dest
) {
3290 ldout(store
->cct
, 20) << __func__
<< " already moved " << *sb
3294 ldout(store
->cct
, 20) << __func__
<< " moving " << *sb
<< dendl
;
3296 if (sb
->get_sbid()) {
3297 ldout(store
->cct
, 20) << __func__
3298 << " moving registration " << *sb
<< dendl
;
3299 shared_blob_set
.remove(sb
);
3300 dest
->shared_blob_set
.add(dest
, sb
);
3302 if (dest
->cache
!= cache
) {
3303 for (auto& i
: sb
->bc
.buffer_map
) {
3304 if (!i
.second
->is_writing()) {
3305 ldout(store
->cct
, 20) << __func__
<< " moving " << *i
.second
3307 dest
->cache
->_move_buffer(cache
, i
.second
.get());
3316 // =======================================================
3318 void *BlueStore::MempoolThread::entry()
3320 Mutex::Locker
l(lock
);
3322 uint64_t meta_bytes
=
3323 mempool::bluestore_cache_other::allocated_bytes() +
3324 mempool::bluestore_cache_onode::allocated_bytes();
3325 uint64_t onode_num
=
3326 mempool::bluestore_cache_onode::allocated_items();
3328 if (onode_num
< 2) {
3332 float bytes_per_onode
= (float)meta_bytes
/ (float)onode_num
;
3333 size_t num_shards
= store
->cache_shards
.size();
3334 float target_ratio
= store
->cache_meta_ratio
+ store
->cache_data_ratio
;
3335 // A little sloppy but should be close enough
3336 uint64_t shard_target
= target_ratio
* (store
->cache_size
/ num_shards
);
3338 for (auto i
: store
->cache_shards
) {
3339 i
->trim(shard_target
,
3340 store
->cache_meta_ratio
,
3341 store
->cache_data_ratio
,
3345 store
->_update_cache_logger();
3348 wait
+= store
->cct
->_conf
->bluestore_cache_trim_interval
;
3349 cond
.WaitInterval(lock
, wait
);
3355 // =======================================================
3360 #define dout_prefix *_dout << "bluestore.OmapIteratorImpl(" << this << ") "
3362 BlueStore::OmapIteratorImpl::OmapIteratorImpl(
3363 CollectionRef c
, OnodeRef o
, KeyValueDB::Iterator it
)
3364 : c(c
), o(o
), it(it
)
3366 RWLock::RLocker
l(c
->lock
);
3367 if (o
->onode
.has_omap()) {
3368 get_omap_key(o
->onode
.nid
, string(), &head
);
3369 get_omap_tail(o
->onode
.nid
, &tail
);
3370 it
->lower_bound(head
);
3374 int BlueStore::OmapIteratorImpl::seek_to_first()
3376 RWLock::RLocker
l(c
->lock
);
3377 if (o
->onode
.has_omap()) {
3378 it
->lower_bound(head
);
3380 it
= KeyValueDB::Iterator();
3385 int BlueStore::OmapIteratorImpl::upper_bound(const string
& after
)
3387 RWLock::RLocker
l(c
->lock
);
3388 if (o
->onode
.has_omap()) {
3390 get_omap_key(o
->onode
.nid
, after
, &key
);
3391 ldout(c
->store
->cct
,20) << __func__
<< " after " << after
<< " key "
3392 << pretty_binary_string(key
) << dendl
;
3393 it
->upper_bound(key
);
3395 it
= KeyValueDB::Iterator();
3400 int BlueStore::OmapIteratorImpl::lower_bound(const string
& to
)
3402 RWLock::RLocker
l(c
->lock
);
3403 if (o
->onode
.has_omap()) {
3405 get_omap_key(o
->onode
.nid
, to
, &key
);
3406 ldout(c
->store
->cct
,20) << __func__
<< " to " << to
<< " key "
3407 << pretty_binary_string(key
) << dendl
;
3408 it
->lower_bound(key
);
3410 it
= KeyValueDB::Iterator();
3415 bool BlueStore::OmapIteratorImpl::valid()
3417 RWLock::RLocker
l(c
->lock
);
3418 bool r
= o
->onode
.has_omap() && it
&& it
->valid() &&
3419 it
->raw_key().second
<= tail
;
3420 if (it
&& it
->valid()) {
3421 ldout(c
->store
->cct
,20) << __func__
<< " is at "
3422 << pretty_binary_string(it
->raw_key().second
)
3428 int BlueStore::OmapIteratorImpl::next(bool validate
)
3430 RWLock::RLocker
l(c
->lock
);
3431 if (o
->onode
.has_omap()) {
3439 string
BlueStore::OmapIteratorImpl::key()
3441 RWLock::RLocker
l(c
->lock
);
3442 assert(it
->valid());
3443 string db_key
= it
->raw_key().second
;
3445 decode_omap_key(db_key
, &user_key
);
3449 bufferlist
BlueStore::OmapIteratorImpl::value()
3451 RWLock::RLocker
l(c
->lock
);
3452 assert(it
->valid());
3457 // =====================================
3460 #define dout_prefix *_dout << "bluestore(" << path << ") "
3463 static void aio_cb(void *priv
, void *priv2
)
3465 BlueStore
*store
= static_cast<BlueStore
*>(priv
);
3466 BlueStore::AioContext
*c
= static_cast<BlueStore::AioContext
*>(priv2
);
3467 c
->aio_finish(store
);
3470 BlueStore::BlueStore(CephContext
*cct
, const string
& path
)
3471 : ObjectStore(cct
, path
),
3472 throttle_bytes(cct
, "bluestore_throttle_bytes",
3473 cct
->_conf
->bluestore_throttle_bytes
),
3474 throttle_deferred_bytes(cct
, "bluestore_throttle_deferred_bytes",
3475 cct
->_conf
->bluestore_throttle_bytes
+
3476 cct
->_conf
->bluestore_throttle_deferred_bytes
),
3477 kv_sync_thread(this),
3478 kv_finalize_thread(this),
3479 mempool_thread(this)
3482 cct
->_conf
->add_observer(this);
3483 set_cache_shards(1);
3486 BlueStore::BlueStore(CephContext
*cct
,
3488 uint64_t _min_alloc_size
)
3489 : ObjectStore(cct
, path
),
3490 throttle_bytes(cct
, "bluestore_throttle_bytes",
3491 cct
->_conf
->bluestore_throttle_bytes
),
3492 throttle_deferred_bytes(cct
, "bluestore_throttle_deferred_bytes",
3493 cct
->_conf
->bluestore_throttle_bytes
+
3494 cct
->_conf
->bluestore_throttle_deferred_bytes
),
3495 kv_sync_thread(this),
3496 kv_finalize_thread(this),
3497 min_alloc_size(_min_alloc_size
),
3498 min_alloc_size_order(ctz(_min_alloc_size
)),
3499 mempool_thread(this)
3502 cct
->_conf
->add_observer(this);
3503 set_cache_shards(1);
3506 BlueStore::~BlueStore()
3508 for (auto f
: finishers
) {
3513 cct
->_conf
->remove_observer(this);
3517 assert(bluefs
== NULL
);
3518 assert(fsid_fd
< 0);
3519 assert(path_fd
< 0);
3520 for (auto i
: cache_shards
) {
3523 cache_shards
.clear();
3526 const char **BlueStore::get_tracked_conf_keys() const
3528 static const char* KEYS
[] = {
3529 "bluestore_csum_type",
3530 "bluestore_compression_mode",
3531 "bluestore_compression_algorithm",
3532 "bluestore_compression_min_blob_size",
3533 "bluestore_compression_min_blob_size_ssd",
3534 "bluestore_compression_min_blob_size_hdd",
3535 "bluestore_compression_max_blob_size",
3536 "bluestore_compression_max_blob_size_ssd",
3537 "bluestore_compression_max_blob_size_hdd",
3538 "bluestore_compression_required_ratio",
3539 "bluestore_max_alloc_size",
3540 "bluestore_prefer_deferred_size",
3541 "bluestore_deferred_batch_ops",
3542 "bluestore_deferred_batch_ops_hdd",
3543 "bluestore_deferred_batch_ops_ssd",
3544 "bluestore_throttle_bytes",
3545 "bluestore_throttle_deferred_bytes",
3546 "bluestore_throttle_cost_per_io_hdd",
3547 "bluestore_throttle_cost_per_io_ssd",
3548 "bluestore_throttle_cost_per_io",
3549 "bluestore_max_blob_size",
3550 "bluestore_max_blob_size_ssd",
3551 "bluestore_max_blob_size_hdd",
3557 void BlueStore::handle_conf_change(const struct md_config_t
*conf
,
3558 const std::set
<std::string
> &changed
)
3560 if (changed
.count("bluestore_csum_type")) {
3563 if (changed
.count("bluestore_compression_mode") ||
3564 changed
.count("bluestore_compression_algorithm") ||
3565 changed
.count("bluestore_compression_min_blob_size") ||
3566 changed
.count("bluestore_compression_max_blob_size")) {
3571 if (changed
.count("bluestore_max_blob_size") ||
3572 changed
.count("bluestore_max_blob_size_ssd") ||
3573 changed
.count("bluestore_max_blob_size_hdd")) {
3575 // only after startup
3579 if (changed
.count("bluestore_prefer_deferred_size") ||
3580 changed
.count("bluestore_max_alloc_size") ||
3581 changed
.count("bluestore_deferred_batch_ops") ||
3582 changed
.count("bluestore_deferred_batch_ops_hdd") ||
3583 changed
.count("bluestore_deferred_batch_ops_ssd")) {
3585 // only after startup
3589 if (changed
.count("bluestore_throttle_cost_per_io") ||
3590 changed
.count("bluestore_throttle_cost_per_io_hdd") ||
3591 changed
.count("bluestore_throttle_cost_per_io_ssd")) {
3593 _set_throttle_params();
3596 if (changed
.count("bluestore_throttle_bytes")) {
3597 throttle_bytes
.reset_max(conf
->bluestore_throttle_bytes
);
3598 throttle_deferred_bytes
.reset_max(
3599 conf
->bluestore_throttle_bytes
+ conf
->bluestore_throttle_deferred_bytes
);
3601 if (changed
.count("bluestore_throttle_deferred_bytes")) {
3602 throttle_deferred_bytes
.reset_max(
3603 conf
->bluestore_throttle_bytes
+ conf
->bluestore_throttle_deferred_bytes
);
3607 void BlueStore::_set_compression()
3609 auto m
= Compressor::get_comp_mode_type(cct
->_conf
->bluestore_compression_mode
);
3613 derr
<< __func__
<< " unrecognized value '"
3614 << cct
->_conf
->bluestore_compression_mode
3615 << "' for bluestore_compression_mode, reverting to 'none'"
3617 comp_mode
= Compressor::COMP_NONE
;
3620 compressor
= nullptr;
3622 if (comp_mode
== Compressor::COMP_NONE
) {
3623 dout(10) << __func__
<< " compression mode set to 'none', "
3624 << "ignore other compression setttings" << dendl
;
3628 if (cct
->_conf
->bluestore_compression_max_blob_size
) {
3629 comp_min_blob_size
= cct
->_conf
->bluestore_compression_max_blob_size
;
3632 if (bdev
->is_rotational()) {
3633 comp_min_blob_size
= cct
->_conf
->bluestore_compression_min_blob_size_hdd
;
3635 comp_min_blob_size
= cct
->_conf
->bluestore_compression_min_blob_size_ssd
;
3639 if (cct
->_conf
->bluestore_compression_max_blob_size
) {
3640 comp_max_blob_size
= cct
->_conf
->bluestore_compression_max_blob_size
;
3643 if (bdev
->is_rotational()) {
3644 comp_max_blob_size
= cct
->_conf
->bluestore_compression_max_blob_size_hdd
;
3646 comp_max_blob_size
= cct
->_conf
->bluestore_compression_max_blob_size_ssd
;
3650 auto& alg_name
= cct
->_conf
->bluestore_compression_algorithm
;
3651 if (!alg_name
.empty()) {
3652 compressor
= Compressor::create(cct
, alg_name
);
3654 derr
<< __func__
<< " unable to initialize " << alg_name
.c_str() << " compressor"
3659 dout(10) << __func__
<< " mode " << Compressor::get_comp_mode_name(comp_mode
)
3660 << " alg " << (compressor
? compressor
->get_type_name() : "(none)")
3664 void BlueStore::_set_csum()
3666 csum_type
= Checksummer::CSUM_NONE
;
3667 int t
= Checksummer::get_csum_string_type(cct
->_conf
->bluestore_csum_type
);
3668 if (t
> Checksummer::CSUM_NONE
)
3671 dout(10) << __func__
<< " csum_type "
3672 << Checksummer::get_csum_type_string(csum_type
)
3676 void BlueStore::_set_throttle_params()
3678 if (cct
->_conf
->bluestore_throttle_cost_per_io
) {
3679 throttle_cost_per_io
= cct
->_conf
->bluestore_throttle_cost_per_io
;
3682 if (bdev
->is_rotational()) {
3683 throttle_cost_per_io
= cct
->_conf
->bluestore_throttle_cost_per_io_hdd
;
3685 throttle_cost_per_io
= cct
->_conf
->bluestore_throttle_cost_per_io_ssd
;
3689 dout(10) << __func__
<< " throttle_cost_per_io " << throttle_cost_per_io
3692 void BlueStore::_set_blob_size()
3694 if (cct
->_conf
->bluestore_max_blob_size
) {
3695 max_blob_size
= cct
->_conf
->bluestore_max_blob_size
;
3698 if (bdev
->is_rotational()) {
3699 max_blob_size
= cct
->_conf
->bluestore_max_blob_size_hdd
;
3701 max_blob_size
= cct
->_conf
->bluestore_max_blob_size_ssd
;
3704 dout(10) << __func__
<< " max_blob_size 0x" << std::hex
<< max_blob_size
3705 << std::dec
<< dendl
;
3708 int BlueStore::_set_cache_sizes()
3711 if (cct
->_conf
->bluestore_cache_size
) {
3712 cache_size
= cct
->_conf
->bluestore_cache_size
;
3714 // choose global cache size based on backend type
3715 if (bdev
->is_rotational()) {
3716 cache_size
= cct
->_conf
->bluestore_cache_size_hdd
;
3718 cache_size
= cct
->_conf
->bluestore_cache_size_ssd
;
3721 cache_meta_ratio
= cct
->_conf
->bluestore_cache_meta_ratio
;
3722 cache_kv_ratio
= cct
->_conf
->bluestore_cache_kv_ratio
;
3724 double cache_kv_max
= cct
->_conf
->bluestore_cache_kv_max
;
3725 double cache_kv_max_ratio
= 0;
3727 // if cache_kv_max is negative, disable it
3728 if (cache_size
> 0 && cache_kv_max
>= 0) {
3729 cache_kv_max_ratio
= (double) cache_kv_max
/ (double) cache_size
;
3730 if (cache_kv_max_ratio
< 1.0 && cache_kv_max_ratio
< cache_kv_ratio
) {
3731 dout(1) << __func__
<< " max " << cache_kv_max_ratio
3732 << " < ratio " << cache_kv_ratio
3734 cache_meta_ratio
= cache_meta_ratio
+ cache_kv_ratio
- cache_kv_max_ratio
;
3735 cache_kv_ratio
= cache_kv_max_ratio
;
3740 (double)1.0 - (double)cache_meta_ratio
- (double)cache_kv_ratio
;
3742 if (cache_meta_ratio
< 0 || cache_meta_ratio
> 1.0) {
3743 derr
<< __func__
<< " bluestore_cache_meta_ratio (" << cache_meta_ratio
3744 << ") must be in range [0,1.0]" << dendl
;
3747 if (cache_kv_ratio
< 0 || cache_kv_ratio
> 1.0) {
3748 derr
<< __func__
<< " bluestore_cache_kv_ratio (" << cache_kv_ratio
3749 << ") must be in range [0,1.0]" << dendl
;
3752 if (cache_meta_ratio
+ cache_kv_ratio
> 1.0) {
3753 derr
<< __func__
<< " bluestore_cache_meta_ratio (" << cache_meta_ratio
3754 << ") + bluestore_cache_kv_ratio (" << cache_kv_ratio
3755 << ") = " << cache_meta_ratio
+ cache_kv_ratio
<< "; must be <= 1.0"
3759 if (cache_data_ratio
< 0) {
3760 // deal with floating point imprecision
3761 cache_data_ratio
= 0;
3763 dout(1) << __func__
<< " cache_size " << cache_size
3764 << " meta " << cache_meta_ratio
3765 << " kv " << cache_kv_ratio
3766 << " data " << cache_data_ratio
3771 void BlueStore::_init_logger()
3773 PerfCountersBuilder
b(cct
, "bluestore",
3774 l_bluestore_first
, l_bluestore_last
);
3775 b
.add_time_avg(l_bluestore_kv_flush_lat
, "kv_flush_lat",
3776 "Average kv_thread flush latency",
3777 "fl_l", PerfCountersBuilder::PRIO_INTERESTING
);
3778 b
.add_time_avg(l_bluestore_kv_commit_lat
, "kv_commit_lat",
3779 "Average kv_thread commit latency");
3780 b
.add_time_avg(l_bluestore_kv_lat
, "kv_lat",
3781 "Average kv_thread sync latency",
3782 "k_l", PerfCountersBuilder::PRIO_INTERESTING
);
3783 b
.add_time_avg(l_bluestore_state_prepare_lat
, "state_prepare_lat",
3784 "Average prepare state latency");
3785 b
.add_time_avg(l_bluestore_state_aio_wait_lat
, "state_aio_wait_lat",
3786 "Average aio_wait state latency",
3787 "io_l", PerfCountersBuilder::PRIO_INTERESTING
);
3788 b
.add_time_avg(l_bluestore_state_io_done_lat
, "state_io_done_lat",
3789 "Average io_done state latency");
3790 b
.add_time_avg(l_bluestore_state_kv_queued_lat
, "state_kv_queued_lat",
3791 "Average kv_queued state latency");
3792 b
.add_time_avg(l_bluestore_state_kv_committing_lat
, "state_kv_commiting_lat",
3793 "Average kv_commiting state latency");
3794 b
.add_time_avg(l_bluestore_state_kv_done_lat
, "state_kv_done_lat",
3795 "Average kv_done state latency");
3796 b
.add_time_avg(l_bluestore_state_deferred_queued_lat
, "state_deferred_queued_lat",
3797 "Average deferred_queued state latency");
3798 b
.add_time_avg(l_bluestore_state_deferred_aio_wait_lat
, "state_deferred_aio_wait_lat",
3799 "Average aio_wait state latency");
3800 b
.add_time_avg(l_bluestore_state_deferred_cleanup_lat
, "state_deferred_cleanup_lat",
3801 "Average cleanup state latency");
3802 b
.add_time_avg(l_bluestore_state_finishing_lat
, "state_finishing_lat",
3803 "Average finishing state latency");
3804 b
.add_time_avg(l_bluestore_state_done_lat
, "state_done_lat",
3805 "Average done state latency");
3806 b
.add_time_avg(l_bluestore_throttle_lat
, "throttle_lat",
3807 "Average submit throttle latency",
3808 "th_l", PerfCountersBuilder::PRIO_CRITICAL
);
3809 b
.add_time_avg(l_bluestore_submit_lat
, "submit_lat",
3810 "Average submit latency",
3811 "s_l", PerfCountersBuilder::PRIO_CRITICAL
);
3812 b
.add_time_avg(l_bluestore_commit_lat
, "commit_lat",
3813 "Average commit latency",
3814 "c_l", PerfCountersBuilder::PRIO_CRITICAL
);
3815 b
.add_time_avg(l_bluestore_read_lat
, "read_lat",
3816 "Average read latency",
3817 "r_l", PerfCountersBuilder::PRIO_CRITICAL
);
3818 b
.add_time_avg(l_bluestore_read_onode_meta_lat
, "read_onode_meta_lat",
3819 "Average read onode metadata latency");
3820 b
.add_time_avg(l_bluestore_read_wait_aio_lat
, "read_wait_aio_lat",
3821 "Average read latency");
3822 b
.add_time_avg(l_bluestore_compress_lat
, "compress_lat",
3823 "Average compress latency");
3824 b
.add_time_avg(l_bluestore_decompress_lat
, "decompress_lat",
3825 "Average decompress latency");
3826 b
.add_time_avg(l_bluestore_csum_lat
, "csum_lat",
3827 "Average checksum latency");
3828 b
.add_u64_counter(l_bluestore_compress_success_count
, "compress_success_count",
3829 "Sum for beneficial compress ops");
3830 b
.add_u64_counter(l_bluestore_compress_rejected_count
, "compress_rejected_count",
3831 "Sum for compress ops rejected due to low net gain of space");
3832 b
.add_u64_counter(l_bluestore_write_pad_bytes
, "write_pad_bytes",
3833 "Sum for write-op padded bytes");
3834 b
.add_u64_counter(l_bluestore_deferred_write_ops
, "deferred_write_ops",
3835 "Sum for deferred write op");
3836 b
.add_u64_counter(l_bluestore_deferred_write_bytes
, "deferred_write_bytes",
3837 "Sum for deferred write bytes", "def");
3838 b
.add_u64_counter(l_bluestore_write_penalty_read_ops
, "write_penalty_read_ops",
3839 "Sum for write penalty read ops");
3840 b
.add_u64(l_bluestore_allocated
, "bluestore_allocated",
3841 "Sum for allocated bytes");
3842 b
.add_u64(l_bluestore_stored
, "bluestore_stored",
3843 "Sum for stored bytes");
3844 b
.add_u64(l_bluestore_compressed
, "bluestore_compressed",
3845 "Sum for stored compressed bytes");
3846 b
.add_u64(l_bluestore_compressed_allocated
, "bluestore_compressed_allocated",
3847 "Sum for bytes allocated for compressed data");
3848 b
.add_u64(l_bluestore_compressed_original
, "bluestore_compressed_original",
3849 "Sum for original bytes that were compressed");
3851 b
.add_u64(l_bluestore_onodes
, "bluestore_onodes",
3852 "Number of onodes in cache");
3853 b
.add_u64_counter(l_bluestore_onode_hits
, "bluestore_onode_hits",
3854 "Sum for onode-lookups hit in the cache");
3855 b
.add_u64_counter(l_bluestore_onode_misses
, "bluestore_onode_misses",
3856 "Sum for onode-lookups missed in the cache");
3857 b
.add_u64_counter(l_bluestore_onode_shard_hits
, "bluestore_onode_shard_hits",
3858 "Sum for onode-shard lookups hit in the cache");
3859 b
.add_u64_counter(l_bluestore_onode_shard_misses
,
3860 "bluestore_onode_shard_misses",
3861 "Sum for onode-shard lookups missed in the cache");
3862 b
.add_u64(l_bluestore_extents
, "bluestore_extents",
3863 "Number of extents in cache");
3864 b
.add_u64(l_bluestore_blobs
, "bluestore_blobs",
3865 "Number of blobs in cache");
3866 b
.add_u64(l_bluestore_buffers
, "bluestore_buffers",
3867 "Number of buffers in cache");
3868 b
.add_u64(l_bluestore_buffer_bytes
, "bluestore_buffer_bytes",
3869 "Number of buffer bytes in cache");
3870 b
.add_u64(l_bluestore_buffer_hit_bytes
, "bluestore_buffer_hit_bytes",
3871 "Sum for bytes of read hit in the cache");
3872 b
.add_u64(l_bluestore_buffer_miss_bytes
, "bluestore_buffer_miss_bytes",
3873 "Sum for bytes of read missed in the cache");
3875 b
.add_u64_counter(l_bluestore_write_big
, "bluestore_write_big",
3876 "Large aligned writes into fresh blobs");
3877 b
.add_u64_counter(l_bluestore_write_big_bytes
, "bluestore_write_big_bytes",
3878 "Large aligned writes into fresh blobs (bytes)");
3879 b
.add_u64_counter(l_bluestore_write_big_blobs
, "bluestore_write_big_blobs",
3880 "Large aligned writes into fresh blobs (blobs)");
3881 b
.add_u64_counter(l_bluestore_write_small
, "bluestore_write_small",
3882 "Small writes into existing or sparse small blobs");
3883 b
.add_u64_counter(l_bluestore_write_small_bytes
, "bluestore_write_small_bytes",
3884 "Small writes into existing or sparse small blobs (bytes)");
3885 b
.add_u64_counter(l_bluestore_write_small_unused
,
3886 "bluestore_write_small_unused",
3887 "Small writes into unused portion of existing blob");
3888 b
.add_u64_counter(l_bluestore_write_small_deferred
,
3889 "bluestore_write_small_deferred",
3890 "Small overwrites using deferred");
3891 b
.add_u64_counter(l_bluestore_write_small_pre_read
,
3892 "bluestore_write_small_pre_read",
3893 "Small writes that required we read some data (possibly "
3894 "cached) to fill out the block");
3895 b
.add_u64_counter(l_bluestore_write_small_new
, "bluestore_write_small_new",
3896 "Small write into new (sparse) blob");
3898 b
.add_u64_counter(l_bluestore_txc
, "bluestore_txc", "Transactions committed");
3899 b
.add_u64_counter(l_bluestore_onode_reshard
, "bluestore_onode_reshard",
3900 "Onode extent map reshard events");
3901 b
.add_u64_counter(l_bluestore_blob_split
, "bluestore_blob_split",
3902 "Sum for blob splitting due to resharding");
3903 b
.add_u64_counter(l_bluestore_extent_compress
, "bluestore_extent_compress",
3904 "Sum for extents that have been removed due to compression");
3905 b
.add_u64_counter(l_bluestore_gc_merged
, "bluestore_gc_merged",
3906 "Sum for extents that have been merged due to garbage "
3908 logger
= b
.create_perf_counters();
3909 cct
->get_perfcounters_collection()->add(logger
);
3912 int BlueStore::_reload_logger()
3914 struct store_statfs_t store_statfs
;
3916 int r
= statfs(&store_statfs
);
3918 logger
->set(l_bluestore_allocated
, store_statfs
.allocated
);
3919 logger
->set(l_bluestore_stored
, store_statfs
.stored
);
3920 logger
->set(l_bluestore_compressed
, store_statfs
.compressed
);
3921 logger
->set(l_bluestore_compressed_allocated
, store_statfs
.compressed_allocated
);
3922 logger
->set(l_bluestore_compressed_original
, store_statfs
.compressed_original
);
3927 void BlueStore::_shutdown_logger()
3929 cct
->get_perfcounters_collection()->remove(logger
);
3933 int BlueStore::get_block_device_fsid(CephContext
* cct
, const string
& path
,
3936 bluestore_bdev_label_t label
;
3937 int r
= _read_bdev_label(cct
, path
, &label
);
3940 *fsid
= label
.osd_uuid
;
3944 int BlueStore::_open_path()
3946 assert(path_fd
< 0);
3947 path_fd
= TEMP_FAILURE_RETRY(::open(path
.c_str(), O_DIRECTORY
));
3950 derr
<< __func__
<< " unable to open " << path
<< ": " << cpp_strerror(r
)
3957 void BlueStore::_close_path()
3959 VOID_TEMP_FAILURE_RETRY(::close(path_fd
));
3963 int BlueStore::_write_bdev_label(string path
, bluestore_bdev_label_t label
)
3965 dout(10) << __func__
<< " path " << path
<< " label " << label
<< dendl
;
3967 ::encode(label
, bl
);
3968 uint32_t crc
= bl
.crc32c(-1);
3970 assert(bl
.length() <= BDEV_LABEL_BLOCK_SIZE
);
3971 bufferptr
z(BDEV_LABEL_BLOCK_SIZE
- bl
.length());
3973 bl
.append(std::move(z
));
3975 int fd
= TEMP_FAILURE_RETRY(::open(path
.c_str(), O_WRONLY
));
3978 derr
<< __func__
<< " failed to open " << path
<< ": " << cpp_strerror(fd
)
3982 int r
= bl
.write_fd(fd
);
3984 derr
<< __func__
<< " failed to write to " << path
3985 << ": " << cpp_strerror(r
) << dendl
;
3987 VOID_TEMP_FAILURE_RETRY(::close(fd
));
3991 int BlueStore::_read_bdev_label(CephContext
* cct
, string path
,
3992 bluestore_bdev_label_t
*label
)
3994 dout(10) << __func__
<< dendl
;
3995 int fd
= TEMP_FAILURE_RETRY(::open(path
.c_str(), O_RDONLY
));
3998 derr
<< __func__
<< " failed to open " << path
<< ": " << cpp_strerror(fd
)
4003 int r
= bl
.read_fd(fd
, BDEV_LABEL_BLOCK_SIZE
);
4004 VOID_TEMP_FAILURE_RETRY(::close(fd
));
4006 derr
<< __func__
<< " failed to read from " << path
4007 << ": " << cpp_strerror(r
) << dendl
;
4011 uint32_t crc
, expected_crc
;
4012 bufferlist::iterator p
= bl
.begin();
4014 ::decode(*label
, p
);
4016 t
.substr_of(bl
, 0, p
.get_off());
4018 ::decode(expected_crc
, p
);
4020 catch (buffer::error
& e
) {
4021 derr
<< __func__
<< " unable to decode label at offset " << p
.get_off()
4026 if (crc
!= expected_crc
) {
4027 derr
<< __func__
<< " bad crc on label, expected " << expected_crc
4028 << " != actual " << crc
<< dendl
;
4031 dout(10) << __func__
<< " got " << *label
<< dendl
;
4035 int BlueStore::_check_or_set_bdev_label(
4036 string path
, uint64_t size
, string desc
, bool create
)
4038 bluestore_bdev_label_t label
;
4040 label
.osd_uuid
= fsid
;
4042 label
.btime
= ceph_clock_now();
4043 label
.description
= desc
;
4044 int r
= _write_bdev_label(path
, label
);
4048 int r
= _read_bdev_label(cct
, path
, &label
);
4051 if (cct
->_conf
->bluestore_debug_permit_any_bdev_label
) {
4052 dout(20) << __func__
<< " bdev " << path
<< " fsid " << label
.osd_uuid
4053 << " and fsid " << fsid
<< " check bypassed" << dendl
;
4055 else if (label
.osd_uuid
!= fsid
) {
4056 derr
<< __func__
<< " bdev " << path
<< " fsid " << label
.osd_uuid
4057 << " does not match our fsid " << fsid
<< dendl
;
4064 void BlueStore::_set_alloc_sizes(void)
4066 max_alloc_size
= cct
->_conf
->bluestore_max_alloc_size
;
4068 if (cct
->_conf
->bluestore_prefer_deferred_size
) {
4069 prefer_deferred_size
= cct
->_conf
->bluestore_prefer_deferred_size
;
4072 if (bdev
->is_rotational()) {
4073 prefer_deferred_size
= cct
->_conf
->bluestore_prefer_deferred_size_hdd
;
4075 prefer_deferred_size
= cct
->_conf
->bluestore_prefer_deferred_size_ssd
;
4079 if (cct
->_conf
->bluestore_deferred_batch_ops
) {
4080 deferred_batch_ops
= cct
->_conf
->bluestore_deferred_batch_ops
;
4083 if (bdev
->is_rotational()) {
4084 deferred_batch_ops
= cct
->_conf
->bluestore_deferred_batch_ops_hdd
;
4086 deferred_batch_ops
= cct
->_conf
->bluestore_deferred_batch_ops_ssd
;
4090 dout(10) << __func__
<< " min_alloc_size 0x" << std::hex
<< min_alloc_size
4091 << std::dec
<< " order " << min_alloc_size_order
4092 << " max_alloc_size 0x" << std::hex
<< max_alloc_size
4093 << " prefer_deferred_size 0x" << prefer_deferred_size
4095 << " deferred_batch_ops " << deferred_batch_ops
4099 int BlueStore::_open_bdev(bool create
)
4101 assert(bdev
== NULL
);
4102 string p
= path
+ "/block";
4103 bdev
= BlockDevice::create(cct
, p
, aio_cb
, static_cast<void*>(this));
4104 int r
= bdev
->open(p
);
4108 if (bdev
->supported_bdev_label()) {
4109 r
= _check_or_set_bdev_label(p
, bdev
->get_size(), "main", create
);
4114 // initialize global block parameters
4115 block_size
= bdev
->get_block_size();
4116 block_mask
= ~(block_size
- 1);
4117 block_size_order
= ctz(block_size
);
4118 assert(block_size
== 1u << block_size_order
);
4119 // and set cache_size based on device type
4120 r
= _set_cache_sizes();
4134 void BlueStore::_close_bdev()
4142 int BlueStore::_open_fm(bool create
)
4145 fm
= FreelistManager::create(cct
, freelist_type
, db
, PREFIX_ALLOC
);
4148 // initialize freespace
4149 dout(20) << __func__
<< " initializing freespace" << dendl
;
4150 KeyValueDB::Transaction t
= db
->get_transaction();
4153 bl
.append(freelist_type
);
4154 t
->set(PREFIX_SUPER
, "freelist_type", bl
);
4156 fm
->create(bdev
->get_size(), t
);
4158 // allocate superblock reserved space. note that we do not mark
4159 // bluefs space as allocated in the freelist; we instead rely on
4161 fm
->allocate(0, SUPER_RESERVED
, t
);
4163 uint64_t reserved
= 0;
4164 if (cct
->_conf
->bluestore_bluefs
) {
4165 assert(bluefs_extents
.num_intervals() == 1);
4166 interval_set
<uint64_t>::iterator p
= bluefs_extents
.begin();
4167 reserved
= p
.get_start() + p
.get_len();
4168 dout(20) << __func__
<< " reserved 0x" << std::hex
<< reserved
<< std::dec
4169 << " for bluefs" << dendl
;
4171 ::encode(bluefs_extents
, bl
);
4172 t
->set(PREFIX_SUPER
, "bluefs_extents", bl
);
4173 dout(20) << __func__
<< " bluefs_extents 0x" << std::hex
<< bluefs_extents
4174 << std::dec
<< dendl
;
4176 reserved
= SUPER_RESERVED
;
4179 if (cct
->_conf
->bluestore_debug_prefill
> 0) {
4180 uint64_t end
= bdev
->get_size() - reserved
;
4181 dout(1) << __func__
<< " pre-fragmenting freespace, using "
4182 << cct
->_conf
->bluestore_debug_prefill
<< " with max free extent "
4183 << cct
->_conf
->bluestore_debug_prefragment_max
<< dendl
;
4184 uint64_t start
= P2ROUNDUP(reserved
, min_alloc_size
);
4185 uint64_t max_b
= cct
->_conf
->bluestore_debug_prefragment_max
/ min_alloc_size
;
4186 float r
= cct
->_conf
->bluestore_debug_prefill
;
4190 while (!stop
&& start
< end
) {
4191 uint64_t l
= (rand() % max_b
+ 1) * min_alloc_size
;
4192 if (start
+ l
> end
) {
4194 l
= P2ALIGN(l
, min_alloc_size
);
4196 assert(start
+ l
<= end
);
4198 uint64_t u
= 1 + (uint64_t)(r
* (double)l
);
4199 u
= P2ROUNDUP(u
, min_alloc_size
);
4200 if (start
+ l
+ u
> end
) {
4201 u
= end
- (start
+ l
);
4202 // trim to align so we don't overflow again
4203 u
= P2ALIGN(u
, min_alloc_size
);
4206 assert(start
+ l
+ u
<= end
);
4208 dout(20) << " free 0x" << std::hex
<< start
<< "~" << l
4209 << " use 0x" << u
<< std::dec
<< dendl
;
4212 // break if u has been trimmed to nothing
4216 fm
->allocate(start
+ l
, u
, t
);
4220 db
->submit_transaction_sync(t
);
4225 derr
<< __func__
<< " freelist init failed: " << cpp_strerror(r
) << dendl
;
4233 void BlueStore::_close_fm()
4235 dout(10) << __func__
<< dendl
;
4242 int BlueStore::_open_alloc()
4244 assert(alloc
== NULL
);
4245 assert(bdev
->get_size());
4246 alloc
= Allocator::create(cct
, cct
->_conf
->bluestore_allocator
,
4250 lderr(cct
) << __func__
<< " Allocator::unknown alloc type "
4251 << cct
->_conf
->bluestore_allocator
4256 uint64_t num
= 0, bytes
= 0;
4258 dout(1) << __func__
<< " opening allocation metadata" << dendl
;
4259 // initialize from freelist
4260 fm
->enumerate_reset();
4261 uint64_t offset
, length
;
4262 while (fm
->enumerate_next(&offset
, &length
)) {
4263 alloc
->init_add_free(offset
, length
);
4267 fm
->enumerate_reset();
4268 dout(1) << __func__
<< " loaded " << pretty_si_t(bytes
)
4269 << " in " << num
<< " extents"
4272 // also mark bluefs space as allocated
4273 for (auto e
= bluefs_extents
.begin(); e
!= bluefs_extents
.end(); ++e
) {
4274 alloc
->init_rm_free(e
.get_start(), e
.get_len());
4276 dout(10) << __func__
<< " marked bluefs_extents 0x" << std::hex
4277 << bluefs_extents
<< std::dec
<< " as allocated" << dendl
;
4282 void BlueStore::_close_alloc()
4290 int BlueStore::_open_fsid(bool create
)
4292 assert(fsid_fd
< 0);
4296 fsid_fd
= ::openat(path_fd
, "fsid", flags
, 0644);
4299 derr
<< __func__
<< " " << cpp_strerror(err
) << dendl
;
4305 int BlueStore::_read_fsid(uuid_d
*uuid
)
4308 memset(fsid_str
, 0, sizeof(fsid_str
));
4309 int ret
= safe_read(fsid_fd
, fsid_str
, sizeof(fsid_str
));
4311 derr
<< __func__
<< " failed: " << cpp_strerror(ret
) << dendl
;
4318 if (!uuid
->parse(fsid_str
)) {
4319 derr
<< __func__
<< " unparsable uuid " << fsid_str
<< dendl
;
4325 int BlueStore::_write_fsid()
4327 int r
= ::ftruncate(fsid_fd
, 0);
4330 derr
<< __func__
<< " fsid truncate failed: " << cpp_strerror(r
) << dendl
;
4333 string str
= stringify(fsid
) + "\n";
4334 r
= safe_write(fsid_fd
, str
.c_str(), str
.length());
4336 derr
<< __func__
<< " fsid write failed: " << cpp_strerror(r
) << dendl
;
4339 r
= ::fsync(fsid_fd
);
4342 derr
<< __func__
<< " fsid fsync failed: " << cpp_strerror(r
) << dendl
;
4348 void BlueStore::_close_fsid()
4350 VOID_TEMP_FAILURE_RETRY(::close(fsid_fd
));
4354 int BlueStore::_lock_fsid()
4357 memset(&l
, 0, sizeof(l
));
4359 l
.l_whence
= SEEK_SET
;
4360 int r
= ::fcntl(fsid_fd
, F_SETLK
, &l
);
4363 derr
<< __func__
<< " failed to lock " << path
<< "/fsid"
4364 << " (is another ceph-osd still running?)"
4365 << cpp_strerror(err
) << dendl
;
4371 bool BlueStore::is_rotational()
4374 return bdev
->is_rotational();
4377 bool rotational
= true;
4378 int r
= _open_path();
4381 r
= _open_fsid(false);
4384 r
= _read_fsid(&fsid
);
4390 r
= _open_bdev(false);
4393 rotational
= bdev
->is_rotational();
4403 bool BlueStore::is_journal_rotational()
4406 dout(5) << __func__
<< " bluefs disabled, default to store media type"
4408 return is_rotational();
4410 dout(10) << __func__
<< " " << (int)bluefs
->wal_is_rotational() << dendl
;
4411 return bluefs
->wal_is_rotational();
4414 bool BlueStore::test_mount_in_use()
4416 // most error conditions mean the mount is not in use (e.g., because
4417 // it doesn't exist). only if we fail to lock do we conclude it is
4420 int r
= _open_path();
4423 r
= _open_fsid(false);
4428 ret
= true; // if we can't lock, it is in use
4435 int BlueStore::_open_db(bool create
)
4439 string fn
= path
+ "/db";
4442 ceph::shared_ptr
<Int64ArrayMergeOperator
> merge_op(new Int64ArrayMergeOperator
);
4446 kv_backend
= cct
->_conf
->bluestore_kvbackend
;
4448 r
= read_meta("kv_backend", &kv_backend
);
4450 derr
<< __func__
<< " unable to read 'kv_backend' meta" << dendl
;
4454 dout(10) << __func__
<< " kv_backend = " << kv_backend
<< dendl
;
4458 do_bluefs
= cct
->_conf
->bluestore_bluefs
;
4461 r
= read_meta("bluefs", &s
);
4463 derr
<< __func__
<< " unable to read 'bluefs' meta" << dendl
;
4468 } else if (s
== "0") {
4471 derr
<< __func__
<< " bluefs = " << s
<< " : not 0 or 1, aborting"
4476 dout(10) << __func__
<< " do_bluefs = " << do_bluefs
<< dendl
;
4478 rocksdb::Env
*env
= NULL
;
4480 dout(10) << __func__
<< " initializing bluefs" << dendl
;
4481 if (kv_backend
!= "rocksdb") {
4482 derr
<< " backend must be rocksdb to use bluefs" << dendl
;
4485 bluefs
= new BlueFS(cct
);
4490 bfn
= path
+ "/block.db";
4491 if (::stat(bfn
.c_str(), &st
) == 0) {
4492 r
= bluefs
->add_block_device(BlueFS::BDEV_DB
, bfn
);
4494 derr
<< __func__
<< " add block device(" << bfn
<< ") returned: "
4495 << cpp_strerror(r
) << dendl
;
4499 if (bluefs
->bdev_support_label(BlueFS::BDEV_DB
)) {
4500 r
= _check_or_set_bdev_label(
4502 bluefs
->get_block_device_size(BlueFS::BDEV_DB
),
4503 "bluefs db", create
);
4506 << " check block device(" << bfn
<< ") label returned: "
4507 << cpp_strerror(r
) << dendl
;
4512 bluefs
->add_block_extent(
4515 bluefs
->get_block_device_size(BlueFS::BDEV_DB
) - SUPER_RESERVED
);
4517 bluefs_shared_bdev
= BlueFS::BDEV_SLOW
;
4518 bluefs_single_shared_device
= false;
4519 } else if (::lstat(bfn
.c_str(), &st
) == -1) {
4520 bluefs_shared_bdev
= BlueFS::BDEV_DB
;
4522 //symlink exist is bug
4523 derr
<< __func__
<< " " << bfn
<< " link target doesn't exist" << dendl
;
4529 bfn
= path
+ "/block";
4530 r
= bluefs
->add_block_device(bluefs_shared_bdev
, bfn
);
4532 derr
<< __func__
<< " add block device(" << bfn
<< ") returned: "
4533 << cpp_strerror(r
) << dendl
;
4537 // note: we always leave the first SUPER_RESERVED (8k) of the device unused
4539 bdev
->get_size() * (cct
->_conf
->bluestore_bluefs_min_ratio
+
4540 cct
->_conf
->bluestore_bluefs_gift_ratio
);
4541 initial
= MAX(initial
, cct
->_conf
->bluestore_bluefs_min
);
4542 // align to bluefs's alloc_size
4543 initial
= P2ROUNDUP(initial
, cct
->_conf
->bluefs_alloc_size
);
4544 // put bluefs in the middle of the device in case it is an HDD
4545 uint64_t start
= P2ALIGN((bdev
->get_size() - initial
) / 2,
4546 cct
->_conf
->bluefs_alloc_size
);
4547 bluefs
->add_block_extent(bluefs_shared_bdev
, start
, initial
);
4548 bluefs_extents
.insert(start
, initial
);
4551 bfn
= path
+ "/block.wal";
4552 if (::stat(bfn
.c_str(), &st
) == 0) {
4553 r
= bluefs
->add_block_device(BlueFS::BDEV_WAL
, bfn
);
4555 derr
<< __func__
<< " add block device(" << bfn
<< ") returned: "
4556 << cpp_strerror(r
) << dendl
;
4560 if (bluefs
->bdev_support_label(BlueFS::BDEV_WAL
)) {
4561 r
= _check_or_set_bdev_label(
4563 bluefs
->get_block_device_size(BlueFS::BDEV_WAL
),
4564 "bluefs wal", create
);
4566 derr
<< __func__
<< " check block device(" << bfn
4567 << ") label returned: " << cpp_strerror(r
) << dendl
;
4573 bluefs
->add_block_extent(
4574 BlueFS::BDEV_WAL
, BDEV_LABEL_BLOCK_SIZE
,
4575 bluefs
->get_block_device_size(BlueFS::BDEV_WAL
) -
4576 BDEV_LABEL_BLOCK_SIZE
);
4578 cct
->_conf
->set_val("rocksdb_separate_wal_dir", "true");
4579 bluefs_single_shared_device
= false;
4580 } else if (::lstat(bfn
.c_str(), &st
) == -1) {
4581 cct
->_conf
->set_val("rocksdb_separate_wal_dir", "false");
4583 //symlink exist is bug
4584 derr
<< __func__
<< " " << bfn
<< " link target doesn't exist" << dendl
;
4592 r
= bluefs
->mount();
4594 derr
<< __func__
<< " failed bluefs mount: " << cpp_strerror(r
) << dendl
;
4597 if (cct
->_conf
->bluestore_bluefs_env_mirror
) {
4598 rocksdb::Env
*a
= new BlueRocksEnv(bluefs
);
4599 rocksdb::Env
*b
= rocksdb::Env::Default();
4601 string cmd
= "rm -rf " + path
+ "/db " +
4602 path
+ "/db.slow " +
4604 int r
= system(cmd
.c_str());
4607 env
= new rocksdb::EnvMirror(b
, a
, false, true);
4609 env
= new BlueRocksEnv(bluefs
);
4611 // simplify the dir names, too, as "seen" by rocksdb
4615 if (bluefs_shared_bdev
== BlueFS::BDEV_SLOW
) {
4616 // we have both block.db and block; tell rocksdb!
4617 // note: the second (last) size value doesn't really matter
4618 ostringstream db_paths
;
4619 uint64_t db_size
= bluefs
->get_block_device_size(BlueFS::BDEV_DB
);
4620 uint64_t slow_size
= bluefs
->get_block_device_size(BlueFS::BDEV_SLOW
);
4621 db_paths
<< fn
<< ","
4622 << (uint64_t)(db_size
* 95 / 100) << " "
4623 << fn
+ ".slow" << ","
4624 << (uint64_t)(slow_size
* 95 / 100);
4625 cct
->_conf
->set_val("rocksdb_db_paths", db_paths
.str(), false);
4626 dout(10) << __func__
<< " set rocksdb_db_paths to "
4627 << cct
->_conf
->get_val
<std::string
>("rocksdb_db_paths") << dendl
;
4632 if (cct
->_conf
->rocksdb_separate_wal_dir
)
4633 env
->CreateDir(fn
+ ".wal");
4634 if (cct
->_conf
->get_val
<std::string
>("rocksdb_db_paths").length())
4635 env
->CreateDir(fn
+ ".slow");
4637 } else if (create
) {
4638 int r
= ::mkdir(fn
.c_str(), 0755);
4641 if (r
< 0 && r
!= -EEXIST
) {
4642 derr
<< __func__
<< " failed to create " << fn
<< ": " << cpp_strerror(r
)
4648 if (cct
->_conf
->rocksdb_separate_wal_dir
) {
4649 string walfn
= path
+ "/db.wal";
4650 r
= ::mkdir(walfn
.c_str(), 0755);
4653 if (r
< 0 && r
!= -EEXIST
) {
4654 derr
<< __func__
<< " failed to create " << walfn
4655 << ": " << cpp_strerror(r
)
4662 db
= KeyValueDB::create(cct
,
4665 static_cast<void*>(env
));
4667 derr
<< __func__
<< " error creating db" << dendl
;
4673 // delete env manually here since we can't depend on db to do this
4680 FreelistManager::setup_merge_operators(db
);
4681 db
->set_merge_operator(PREFIX_STAT
, merge_op
);
4683 db
->set_cache_size(cache_size
* cache_kv_ratio
);
4685 if (kv_backend
== "rocksdb")
4686 options
= cct
->_conf
->bluestore_rocksdb_options
;
4689 r
= db
->create_and_open(err
);
4693 derr
<< __func__
<< " erroring opening db: " << err
.str() << dendl
;
4703 dout(1) << __func__
<< " opened " << kv_backend
4704 << " path " << fn
<< " options " << options
<< dendl
;
4714 void BlueStore::_close_db()
4726 int BlueStore::_reconcile_bluefs_freespace()
4728 dout(10) << __func__
<< dendl
;
4729 interval_set
<uint64_t> bset
;
4730 int r
= bluefs
->get_block_extents(bluefs_shared_bdev
, &bset
);
4732 if (bset
== bluefs_extents
) {
4733 dout(10) << __func__
<< " we agree bluefs has 0x" << std::hex
<< bset
4734 << std::dec
<< dendl
;
4737 dout(10) << __func__
<< " bluefs says 0x" << std::hex
<< bset
<< std::dec
4739 dout(10) << __func__
<< " super says 0x" << std::hex
<< bluefs_extents
4740 << std::dec
<< dendl
;
4742 interval_set
<uint64_t> overlap
;
4743 overlap
.intersection_of(bset
, bluefs_extents
);
4745 bset
.subtract(overlap
);
4746 if (!bset
.empty()) {
4747 derr
<< __func__
<< " bluefs extra 0x" << std::hex
<< bset
<< std::dec
4752 interval_set
<uint64_t> super_extra
;
4753 super_extra
= bluefs_extents
;
4754 super_extra
.subtract(overlap
);
4755 if (!super_extra
.empty()) {
4756 // This is normal: it can happen if we commit to give extents to
4757 // bluefs and we crash before bluefs commits that it owns them.
4758 dout(10) << __func__
<< " super extra " << super_extra
<< dendl
;
4759 for (interval_set
<uint64_t>::iterator p
= super_extra
.begin();
4760 p
!= super_extra
.end();
4762 bluefs
->add_block_extent(bluefs_shared_bdev
, p
.get_start(), p
.get_len());
4769 int BlueStore::_balance_bluefs_freespace(PExtentVector
*extents
)
4774 vector
<pair
<uint64_t,uint64_t>> bluefs_usage
; // <free, total> ...
4775 bluefs
->get_usage(&bluefs_usage
);
4776 assert(bluefs_usage
.size() > bluefs_shared_bdev
);
4778 // fixme: look at primary bdev only for now
4779 uint64_t bluefs_free
= bluefs_usage
[bluefs_shared_bdev
].first
;
4780 uint64_t bluefs_total
= bluefs_usage
[bluefs_shared_bdev
].second
;
4781 float bluefs_free_ratio
= (float)bluefs_free
/ (float)bluefs_total
;
4783 uint64_t my_free
= alloc
->get_free();
4784 uint64_t total
= bdev
->get_size();
4785 float my_free_ratio
= (float)my_free
/ (float)total
;
4787 uint64_t total_free
= bluefs_free
+ my_free
;
4789 float bluefs_ratio
= (float)bluefs_free
/ (float)total_free
;
4791 dout(10) << __func__
4792 << " bluefs " << pretty_si_t(bluefs_free
)
4793 << " free (" << bluefs_free_ratio
4794 << ") bluestore " << pretty_si_t(my_free
)
4795 << " free (" << my_free_ratio
4796 << "), bluefs_ratio " << bluefs_ratio
4800 uint64_t reclaim
= 0;
4801 if (bluefs_ratio
< cct
->_conf
->bluestore_bluefs_min_ratio
) {
4802 gift
= cct
->_conf
->bluestore_bluefs_gift_ratio
* total_free
;
4803 dout(10) << __func__
<< " bluefs_ratio " << bluefs_ratio
4804 << " < min_ratio " << cct
->_conf
->bluestore_bluefs_min_ratio
4805 << ", should gift " << pretty_si_t(gift
) << dendl
;
4806 } else if (bluefs_ratio
> cct
->_conf
->bluestore_bluefs_max_ratio
) {
4807 reclaim
= cct
->_conf
->bluestore_bluefs_reclaim_ratio
* total_free
;
4808 if (bluefs_total
- reclaim
< cct
->_conf
->bluestore_bluefs_min
)
4809 reclaim
= bluefs_total
- cct
->_conf
->bluestore_bluefs_min
;
4810 dout(10) << __func__
<< " bluefs_ratio " << bluefs_ratio
4811 << " > max_ratio " << cct
->_conf
->bluestore_bluefs_max_ratio
4812 << ", should reclaim " << pretty_si_t(reclaim
) << dendl
;
4814 if (bluefs_total
< cct
->_conf
->bluestore_bluefs_min
&&
4815 cct
->_conf
->bluestore_bluefs_min
<
4816 (uint64_t)(cct
->_conf
->bluestore_bluefs_max_ratio
* total_free
)) {
4817 uint64_t g
= cct
->_conf
->bluestore_bluefs_min
- bluefs_total
;
4818 dout(10) << __func__
<< " bluefs_total " << bluefs_total
4819 << " < min " << cct
->_conf
->bluestore_bluefs_min
4820 << ", should gift " << pretty_si_t(g
) << dendl
;
4827 // round up to alloc size
4828 gift
= P2ROUNDUP(gift
, cct
->_conf
->bluefs_alloc_size
);
4830 // hard cap to fit into 32 bits
4831 gift
= MIN(gift
, 1ull<<31);
4832 dout(10) << __func__
<< " gifting " << gift
4833 << " (" << pretty_si_t(gift
) << ")" << dendl
;
4835 // fixme: just do one allocation to start...
4836 int r
= alloc
->reserve(gift
);
4839 AllocExtentVector exts
;
4840 int64_t alloc_len
= alloc
->allocate(gift
, cct
->_conf
->bluefs_alloc_size
,
4843 if (alloc_len
< (int64_t)gift
) {
4844 derr
<< __func__
<< " allocate failed on 0x" << std::hex
<< gift
4845 << " min_alloc_size 0x" << min_alloc_size
<< std::dec
<< dendl
;
4847 assert(0 == "allocate failed, wtf");
4850 for (auto& p
: exts
) {
4851 bluestore_pextent_t e
= bluestore_pextent_t(p
);
4852 dout(1) << __func__
<< " gifting " << e
<< " to bluefs" << dendl
;
4853 extents
->push_back(e
);
4860 // reclaim from bluefs?
4862 // round up to alloc size
4863 reclaim
= P2ROUNDUP(reclaim
, cct
->_conf
->bluefs_alloc_size
);
4865 // hard cap to fit into 32 bits
4866 reclaim
= MIN(reclaim
, 1ull<<31);
4867 dout(10) << __func__
<< " reclaiming " << reclaim
4868 << " (" << pretty_si_t(reclaim
) << ")" << dendl
;
4870 while (reclaim
> 0) {
4871 // NOTE: this will block and do IO.
4872 AllocExtentVector extents
;
4873 int r
= bluefs
->reclaim_blocks(bluefs_shared_bdev
, reclaim
,
4876 derr
<< __func__
<< " failed to reclaim space from bluefs"
4880 for (auto e
: extents
) {
4881 bluefs_extents
.erase(e
.offset
, e
.length
);
4882 bluefs_extents_reclaiming
.insert(e
.offset
, e
.length
);
4883 reclaim
-= e
.length
;
4893 void BlueStore::_commit_bluefs_freespace(
4894 const PExtentVector
& bluefs_gift_extents
)
4896 dout(10) << __func__
<< dendl
;
4897 for (auto& p
: bluefs_gift_extents
) {
4898 bluefs
->add_block_extent(bluefs_shared_bdev
, p
.offset
, p
.length
);
4902 int BlueStore::_open_collections(int *errors
)
4904 assert(coll_map
.empty());
4905 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_COLL
);
4906 for (it
->upper_bound(string());
4910 if (cid
.parse(it
->key())) {
4914 cache_shards
[cid
.hash_to_shard(cache_shards
.size())],
4916 bufferlist bl
= it
->value();
4917 bufferlist::iterator p
= bl
.begin();
4919 ::decode(c
->cnode
, p
);
4920 } catch (buffer::error
& e
) {
4921 derr
<< __func__
<< " failed to decode cnode, key:"
4922 << pretty_binary_string(it
->key()) << dendl
;
4925 dout(20) << __func__
<< " opened " << cid
<< " " << c
<< dendl
;
4928 derr
<< __func__
<< " unrecognized collection " << it
->key() << dendl
;
4936 void BlueStore::_open_statfs()
4939 int r
= db
->get(PREFIX_STAT
, "bluestore_statfs", &bl
);
4941 if (size_t(bl
.length()) >= sizeof(vstatfs
.values
)) {
4942 auto it
= bl
.begin();
4945 dout(10) << __func__
<< " store_statfs is corrupt, using empty" << dendl
;
4949 dout(10) << __func__
<< " store_statfs missed, using empty" << dendl
;
4953 int BlueStore::_setup_block_symlink_or_file(
4959 dout(20) << __func__
<< " name " << name
<< " path " << epath
4960 << " size " << size
<< " create=" << (int)create
<< dendl
;
4965 if (epath
.length()) {
4966 r
= ::symlinkat(epath
.c_str(), path_fd
, name
.c_str());
4969 derr
<< __func__
<< " failed to create " << name
<< " symlink to "
4970 << epath
<< ": " << cpp_strerror(r
) << dendl
;
4974 if (!epath
.compare(0, strlen(SPDK_PREFIX
), SPDK_PREFIX
)) {
4975 int fd
= ::openat(path_fd
, epath
.c_str(), flags
, 0644);
4978 derr
<< __func__
<< " failed to open " << epath
<< " file: "
4979 << cpp_strerror(r
) << dendl
;
4982 string serial_number
= epath
.substr(strlen(SPDK_PREFIX
));
4983 r
= ::write(fd
, serial_number
.c_str(), serial_number
.size());
4984 assert(r
== (int)serial_number
.size());
4985 dout(1) << __func__
<< " created " << name
<< " symlink to "
4987 VOID_TEMP_FAILURE_RETRY(::close(fd
));
4991 int fd
= ::openat(path_fd
, name
.c_str(), flags
, 0644);
4993 // block file is present
4995 int r
= ::fstat(fd
, &st
);
4997 S_ISREG(st
.st_mode
) && // if it is a regular file
4998 st
.st_size
== 0) { // and is 0 bytes
4999 r
= ::ftruncate(fd
, size
);
5002 derr
<< __func__
<< " failed to resize " << name
<< " file to "
5003 << size
<< ": " << cpp_strerror(r
) << dendl
;
5004 VOID_TEMP_FAILURE_RETRY(::close(fd
));
5008 if (cct
->_conf
->bluestore_block_preallocate_file
) {
5009 #ifdef HAVE_POSIX_FALLOCATE
5010 r
= ::posix_fallocate(fd
, 0, size
);
5012 derr
<< __func__
<< " failed to prefallocate " << name
<< " file to "
5013 << size
<< ": " << cpp_strerror(r
) << dendl
;
5014 VOID_TEMP_FAILURE_RETRY(::close(fd
));
5018 char data
[1024*128];
5019 for (uint64_t off
= 0; off
< size
; off
+= sizeof(data
)) {
5020 if (off
+ sizeof(data
) > size
)
5021 r
= ::write(fd
, data
, size
- off
);
5023 r
= ::write(fd
, data
, sizeof(data
));
5026 derr
<< __func__
<< " failed to prefallocate w/ write " << name
<< " file to "
5027 << size
<< ": " << cpp_strerror(r
) << dendl
;
5028 VOID_TEMP_FAILURE_RETRY(::close(fd
));
5034 dout(1) << __func__
<< " resized " << name
<< " file to "
5035 << pretty_si_t(size
) << "B" << dendl
;
5037 VOID_TEMP_FAILURE_RETRY(::close(fd
));
5041 derr
<< __func__
<< " failed to open " << name
<< " file: "
5042 << cpp_strerror(r
) << dendl
;
5050 int BlueStore::mkfs()
5052 dout(1) << __func__
<< " path " << path
<< dendl
;
5058 r
= read_meta("mkfs_done", &done
);
5060 dout(1) << __func__
<< " already created" << dendl
;
5061 if (cct
->_conf
->bluestore_fsck_on_mkfs
) {
5062 r
= fsck(cct
->_conf
->bluestore_fsck_on_mkfs_deep
);
5064 derr
<< __func__
<< " fsck found fatal error: " << cpp_strerror(r
)
5069 derr
<< __func__
<< " fsck found " << r
<< " errors" << dendl
;
5073 return r
; // idempotent
5079 r
= read_meta("type", &type
);
5081 if (type
!= "bluestore") {
5082 derr
<< __func__
<< " expected bluestore, but type is " << type
<< dendl
;
5086 r
= write_meta("type", "bluestore");
5092 freelist_type
= "bitmap";
5098 r
= _open_fsid(true);
5104 goto out_close_fsid
;
5106 r
= _read_fsid(&old_fsid
);
5107 if (r
< 0 || old_fsid
.is_zero()) {
5108 if (fsid
.is_zero()) {
5109 fsid
.generate_random();
5110 dout(1) << __func__
<< " generated fsid " << fsid
<< dendl
;
5112 dout(1) << __func__
<< " using provided fsid " << fsid
<< dendl
;
5114 // we'll write it later.
5116 if (!fsid
.is_zero() && fsid
!= old_fsid
) {
5117 derr
<< __func__
<< " on-disk fsid " << old_fsid
5118 << " != provided " << fsid
<< dendl
;
5120 goto out_close_fsid
;
5125 r
= _setup_block_symlink_or_file("block", cct
->_conf
->bluestore_block_path
,
5126 cct
->_conf
->bluestore_block_size
,
5127 cct
->_conf
->bluestore_block_create
);
5129 goto out_close_fsid
;
5130 if (cct
->_conf
->bluestore_bluefs
) {
5131 r
= _setup_block_symlink_or_file("block.wal", cct
->_conf
->bluestore_block_wal_path
,
5132 cct
->_conf
->bluestore_block_wal_size
,
5133 cct
->_conf
->bluestore_block_wal_create
);
5135 goto out_close_fsid
;
5136 r
= _setup_block_symlink_or_file("block.db", cct
->_conf
->bluestore_block_db_path
,
5137 cct
->_conf
->bluestore_block_db_size
,
5138 cct
->_conf
->bluestore_block_db_create
);
5140 goto out_close_fsid
;
5143 r
= _open_bdev(true);
5145 goto out_close_fsid
;
5149 goto out_close_bdev
;
5156 KeyValueDB::Transaction t
= db
->get_transaction();
5159 ::encode((uint64_t)0, bl
);
5160 t
->set(PREFIX_SUPER
, "nid_max", bl
);
5161 t
->set(PREFIX_SUPER
, "blobid_max", bl
);
5164 // choose min_alloc_size
5165 if (cct
->_conf
->bluestore_min_alloc_size
) {
5166 min_alloc_size
= cct
->_conf
->bluestore_min_alloc_size
;
5169 if (bdev
->is_rotational()) {
5170 min_alloc_size
= cct
->_conf
->bluestore_min_alloc_size_hdd
;
5172 min_alloc_size
= cct
->_conf
->bluestore_min_alloc_size_ssd
;
5176 // make sure min_alloc_size is power of 2 aligned.
5177 if (!ISP2(min_alloc_size
)) {
5178 derr
<< __func__
<< " min_alloc_size 0x"
5179 << std::hex
<< min_alloc_size
<< std::dec
5180 << " is not power of 2 aligned!"
5188 ::encode((uint64_t)min_alloc_size
, bl
);
5189 t
->set(PREFIX_SUPER
, "min_alloc_size", bl
);
5192 ondisk_format
= latest_ondisk_format
;
5193 _prepare_ondisk_format_super(t
);
5194 db
->submit_transaction_sync(t
);
5198 r
= write_meta("kv_backend", cct
->_conf
->bluestore_kvbackend
);
5202 r
= write_meta("bluefs", stringify((int)cct
->_conf
->bluestore_bluefs
));
5206 if (fsid
!= old_fsid
) {
5209 derr
<< __func__
<< " error writing fsid: " << cpp_strerror(r
) << dendl
;
5226 cct
->_conf
->bluestore_fsck_on_mkfs
) {
5227 int rc
= fsck(cct
->_conf
->bluestore_fsck_on_mkfs_deep
);
5231 derr
<< __func__
<< " fsck found " << rc
<< " errors" << dendl
;
5237 // indicate success by writing the 'mkfs_done' file
5238 r
= write_meta("mkfs_done", "yes");
5242 derr
<< __func__
<< " failed, " << cpp_strerror(r
) << dendl
;
5244 dout(0) << __func__
<< " success" << dendl
;
5249 void BlueStore::set_cache_shards(unsigned num
)
5251 dout(10) << __func__
<< " " << num
<< dendl
;
5252 size_t old
= cache_shards
.size();
5254 cache_shards
.resize(num
);
5255 for (unsigned i
= old
; i
< num
; ++i
) {
5256 cache_shards
[i
] = Cache::create(cct
, cct
->_conf
->bluestore_cache_type
,
5261 int BlueStore::_mount(bool kv_only
)
5263 dout(1) << __func__
<< " path " << path
<< dendl
;
5267 int r
= read_meta("type", &type
);
5269 derr
<< __func__
<< " failed to load os-type: " << cpp_strerror(r
)
5274 if (type
!= "bluestore") {
5275 derr
<< __func__
<< " expected bluestore, but type is " << type
<< dendl
;
5280 if (cct
->_conf
->bluestore_fsck_on_mount
) {
5281 int rc
= fsck(cct
->_conf
->bluestore_fsck_on_mount_deep
);
5285 derr
<< __func__
<< " fsck found " << rc
<< " errors" << dendl
;
5290 int r
= _open_path();
5293 r
= _open_fsid(false);
5297 r
= _read_fsid(&fsid
);
5305 r
= _open_bdev(false);
5309 r
= _open_db(false);
5316 r
= _open_super_meta();
5320 r
= _open_fm(false);
5328 r
= _open_collections();
5332 r
= _reload_logger();
5337 r
= _reconcile_bluefs_freespace();
5344 r
= _deferred_replay();
5348 mempool_thread
.init();
5373 int BlueStore::umount()
5376 dout(1) << __func__
<< dendl
;
5379 _osr_unregister_all();
5381 mempool_thread
.shutdown();
5383 dout(20) << __func__
<< " stopping kv thread" << dendl
;
5385 _reap_collections();
5387 dout(20) << __func__
<< " closing" << dendl
;
5397 if (cct
->_conf
->bluestore_fsck_on_umount
) {
5398 int rc
= fsck(cct
->_conf
->bluestore_fsck_on_umount_deep
);
5402 derr
<< __func__
<< " fsck found " << rc
<< " errors" << dendl
;
5409 static void apply(uint64_t off
,
5411 uint64_t granularity
,
5412 BlueStore::mempool_dynamic_bitset
&bitset
,
5414 std::function
<void(uint64_t,
5415 BlueStore::mempool_dynamic_bitset
&)> f
) {
5416 auto end
= ROUND_UP_TO(off
+ len
, granularity
);
5418 uint64_t pos
= off
/ granularity
;
5424 int BlueStore::_fsck_check_extents(
5425 const ghobject_t
& oid
,
5426 const PExtentVector
& extents
,
5428 mempool_dynamic_bitset
&used_blocks
,
5429 store_statfs_t
& expected_statfs
)
5431 dout(30) << __func__
<< " oid " << oid
<< " extents " << extents
<< dendl
;
5433 for (auto e
: extents
) {
5436 expected_statfs
.allocated
+= e
.length
;
5438 expected_statfs
.compressed_allocated
+= e
.length
;
5440 bool already
= false;
5442 e
.offset
, e
.length
, block_size
, used_blocks
, __func__
,
5443 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5450 derr
<< " " << oid
<< " extent " << e
5451 << " or a subset is already allocated" << dendl
;
5454 if (e
.end() > bdev
->get_size()) {
5455 derr
<< " " << oid
<< " extent " << e
5456 << " past end of block device" << dendl
;
5463 int BlueStore::fsck(bool deep
)
5465 dout(1) << __func__
<< (deep
? " (deep)" : " (shallow)") << " start" << dendl
;
5468 typedef btree::btree_set
<
5469 uint64_t,std::less
<uint64_t>,
5470 mempool::bluestore_fsck::pool_allocator
<uint64_t>> uint64_t_btree_t
;
5471 uint64_t_btree_t used_nids
;
5472 uint64_t_btree_t used_omap_head
;
5473 uint64_t_btree_t used_sbids
;
5475 mempool_dynamic_bitset used_blocks
;
5476 KeyValueDB::Iterator it
;
5477 store_statfs_t expected_statfs
, actual_statfs
;
5479 list
<ghobject_t
> oids
;
5481 bluestore_extent_ref_map_t ref_map
;
5484 mempool::bluestore_fsck::map
<uint64_t,sb_info_t
> sb_info
;
5486 uint64_t num_objects
= 0;
5487 uint64_t num_extents
= 0;
5488 uint64_t num_blobs
= 0;
5489 uint64_t num_spanning_blobs
= 0;
5490 uint64_t num_shared_blobs
= 0;
5491 uint64_t num_sharded_objects
= 0;
5492 uint64_t num_object_shards
= 0;
5494 utime_t start
= ceph_clock_now();
5496 int r
= _open_path();
5499 r
= _open_fsid(false);
5503 r
= _read_fsid(&fsid
);
5511 r
= _open_bdev(false);
5515 r
= _open_db(false);
5519 r
= _open_super_meta();
5523 r
= _open_fm(false);
5531 r
= _open_collections(&errors
);
5535 mempool_thread
.init();
5537 // we need finishers and kv_{sync,finalize}_thread *just* for replay
5539 r
= _deferred_replay();
5544 used_blocks
.resize(bdev
->get_size() / block_size
);
5546 0, SUPER_RESERVED
, block_size
, used_blocks
, "0~SUPER_RESERVED",
5547 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5553 for (auto e
= bluefs_extents
.begin(); e
!= bluefs_extents
.end(); ++e
) {
5555 e
.get_start(), e
.get_len(), block_size
, used_blocks
, "bluefs",
5556 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5569 // get expected statfs; fill unaffected fields to be able to compare
5571 statfs(&actual_statfs
);
5572 expected_statfs
.total
= actual_statfs
.total
;
5573 expected_statfs
.available
= actual_statfs
.available
;
5576 dout(1) << __func__
<< " walking object keyspace" << dendl
;
5577 it
= db
->get_iterator(PREFIX_OBJ
);
5581 mempool::bluestore_fsck::list
<string
> expecting_shards
;
5582 for (it
->lower_bound(string()); it
->valid(); it
->next()) {
5583 if (g_conf
->bluestore_debug_fsck_abort
) {
5586 dout(30) << " key " << pretty_binary_string(it
->key()) << dendl
;
5587 if (is_extent_shard_key(it
->key())) {
5588 while (!expecting_shards
.empty() &&
5589 expecting_shards
.front() < it
->key()) {
5590 derr
<< __func__
<< " error: missing shard key "
5591 << pretty_binary_string(expecting_shards
.front())
5594 expecting_shards
.pop_front();
5596 if (!expecting_shards
.empty() &&
5597 expecting_shards
.front() == it
->key()) {
5599 expecting_shards
.pop_front();
5605 get_key_extent_shard(it
->key(), &okey
, &offset
);
5606 derr
<< __func__
<< " error: stray shard 0x" << std::hex
<< offset
5607 << std::dec
<< dendl
;
5608 if (expecting_shards
.empty()) {
5609 derr
<< __func__
<< " error: " << pretty_binary_string(it
->key())
5610 << " is unexpected" << dendl
;
5614 while (expecting_shards
.front() > it
->key()) {
5615 derr
<< __func__
<< " error: saw " << pretty_binary_string(it
->key())
5617 derr
<< __func__
<< " error: exp "
5618 << pretty_binary_string(expecting_shards
.front()) << dendl
;
5620 expecting_shards
.pop_front();
5621 if (expecting_shards
.empty()) {
5629 int r
= get_key_object(it
->key(), &oid
);
5631 derr
<< __func__
<< " error: bad object key "
5632 << pretty_binary_string(it
->key()) << dendl
;
5637 oid
.shard_id
!= pgid
.shard
||
5638 oid
.hobj
.pool
!= (int64_t)pgid
.pool() ||
5639 !c
->contains(oid
)) {
5641 for (ceph::unordered_map
<coll_t
, CollectionRef
>::iterator p
=
5643 p
!= coll_map
.end();
5645 if (p
->second
->contains(oid
)) {
5651 derr
<< __func__
<< " error: stray object " << oid
5652 << " not owned by any collection" << dendl
;
5656 c
->cid
.is_pg(&pgid
);
5657 dout(20) << __func__
<< " collection " << c
->cid
<< dendl
;
5660 if (!expecting_shards
.empty()) {
5661 for (auto &k
: expecting_shards
) {
5662 derr
<< __func__
<< " error: missing shard key "
5663 << pretty_binary_string(k
) << dendl
;
5666 expecting_shards
.clear();
5669 dout(10) << __func__
<< " " << oid
<< dendl
;
5670 RWLock::RLocker
l(c
->lock
);
5671 OnodeRef o
= c
->get_onode(oid
, false);
5673 if (o
->onode
.nid
> nid_max
) {
5674 derr
<< __func__
<< " error: " << oid
<< " nid " << o
->onode
.nid
5675 << " > nid_max " << nid_max
<< dendl
;
5678 if (used_nids
.count(o
->onode
.nid
)) {
5679 derr
<< __func__
<< " error: " << oid
<< " nid " << o
->onode
.nid
5680 << " already in use" << dendl
;
5682 continue; // go for next object
5684 used_nids
.insert(o
->onode
.nid
);
5687 num_spanning_blobs
+= o
->extent_map
.spanning_blob_map
.size();
5688 o
->extent_map
.fault_range(db
, 0, OBJECT_MAX_SIZE
);
5691 if (!o
->extent_map
.shards
.empty()) {
5692 ++num_sharded_objects
;
5693 num_object_shards
+= o
->extent_map
.shards
.size();
5695 for (auto& s
: o
->extent_map
.shards
) {
5696 dout(20) << __func__
<< " shard " << *s
.shard_info
<< dendl
;
5697 expecting_shards
.push_back(string());
5698 get_extent_shard_key(o
->key
, s
.shard_info
->offset
,
5699 &expecting_shards
.back());
5700 if (s
.shard_info
->offset
>= o
->onode
.size
) {
5701 derr
<< __func__
<< " error: " << oid
<< " shard 0x" << std::hex
5702 << s
.shard_info
->offset
<< " past EOF at 0x" << o
->onode
.size
5703 << std::dec
<< dendl
;
5708 map
<BlobRef
,bluestore_blob_t::unused_t
> referenced
;
5710 mempool::bluestore_fsck::map
<BlobRef
,
5711 bluestore_blob_use_tracker_t
> ref_map
;
5712 for (auto& l
: o
->extent_map
.extent_map
) {
5713 dout(20) << __func__
<< " " << l
<< dendl
;
5714 if (l
.logical_offset
< pos
) {
5715 derr
<< __func__
<< " error: " << oid
<< " lextent at 0x"
5716 << std::hex
<< l
.logical_offset
5717 << " overlaps with the previous, which ends at 0x" << pos
5718 << std::dec
<< dendl
;
5721 if (o
->extent_map
.spans_shard(l
.logical_offset
, l
.length
)) {
5722 derr
<< __func__
<< " error: " << oid
<< " lextent at 0x"
5723 << std::hex
<< l
.logical_offset
<< "~" << l
.length
5724 << " spans a shard boundary"
5725 << std::dec
<< dendl
;
5728 pos
= l
.logical_offset
+ l
.length
;
5729 expected_statfs
.stored
+= l
.length
;
5731 const bluestore_blob_t
& blob
= l
.blob
->get_blob();
5733 auto& ref
= ref_map
[l
.blob
];
5734 if (ref
.is_empty()) {
5735 uint32_t min_release_size
= blob
.get_release_size(min_alloc_size
);
5736 uint32_t l
= blob
.get_logical_length();
5737 ref
.init(l
, min_release_size
);
5743 if (blob
.has_unused()) {
5744 auto p
= referenced
.find(l
.blob
);
5745 bluestore_blob_t::unused_t
*pu
;
5746 if (p
== referenced
.end()) {
5747 pu
= &referenced
[l
.blob
];
5751 uint64_t blob_len
= blob
.get_logical_length();
5752 assert((blob_len
% (sizeof(*pu
)*8)) == 0);
5753 assert(l
.blob_offset
+ l
.length
<= blob_len
);
5754 uint64_t chunk_size
= blob_len
/ (sizeof(*pu
)*8);
5755 uint64_t start
= l
.blob_offset
/ chunk_size
;
5757 ROUND_UP_TO(l
.blob_offset
+ l
.length
, chunk_size
) / chunk_size
;
5758 for (auto i
= start
; i
< end
; ++i
) {
5763 for (auto &i
: referenced
) {
5764 dout(20) << __func__
<< " referenced 0x" << std::hex
<< i
.second
5765 << std::dec
<< " for " << *i
.first
<< dendl
;
5766 const bluestore_blob_t
& blob
= i
.first
->get_blob();
5767 if (i
.second
& blob
.unused
) {
5768 derr
<< __func__
<< " error: " << oid
<< " blob claims unused 0x"
5769 << std::hex
<< blob
.unused
5770 << " but extents reference 0x" << i
.second
5771 << " on blob " << *i
.first
<< dendl
;
5774 if (blob
.has_csum()) {
5775 uint64_t blob_len
= blob
.get_logical_length();
5776 uint64_t unused_chunk_size
= blob_len
/ (sizeof(blob
.unused
)*8);
5777 unsigned csum_count
= blob
.get_csum_count();
5778 unsigned csum_chunk_size
= blob
.get_csum_chunk_size();
5779 for (unsigned p
= 0; p
< csum_count
; ++p
) {
5780 unsigned pos
= p
* csum_chunk_size
;
5781 unsigned firstbit
= pos
/ unused_chunk_size
; // [firstbit,lastbit]
5782 unsigned lastbit
= (pos
+ csum_chunk_size
- 1) / unused_chunk_size
;
5783 unsigned mask
= 1u << firstbit
;
5784 for (unsigned b
= firstbit
+ 1; b
<= lastbit
; ++b
) {
5787 if ((blob
.unused
& mask
) == mask
) {
5788 // this csum chunk region is marked unused
5789 if (blob
.get_csum_item(p
) != 0) {
5790 derr
<< __func__
<< " error: " << oid
5791 << " blob claims csum chunk 0x" << std::hex
<< pos
5792 << "~" << csum_chunk_size
5793 << " is unused (mask 0x" << mask
<< " of unused 0x"
5794 << blob
.unused
<< ") but csum is non-zero 0x"
5795 << blob
.get_csum_item(p
) << std::dec
<< " on blob "
5796 << *i
.first
<< dendl
;
5803 for (auto &i
: ref_map
) {
5805 const bluestore_blob_t
& blob
= i
.first
->get_blob();
5806 bool equal
= i
.first
->get_blob_use_tracker().equal(i
.second
);
5808 derr
<< __func__
<< " error: " << oid
<< " blob " << *i
.first
5809 << " doesn't match expected ref_map " << i
.second
<< dendl
;
5812 if (blob
.is_compressed()) {
5813 expected_statfs
.compressed
+= blob
.get_compressed_payload_length();
5814 expected_statfs
.compressed_original
+=
5815 i
.first
->get_referenced_bytes();
5817 if (blob
.is_shared()) {
5818 if (i
.first
->shared_blob
->get_sbid() > blobid_max
) {
5819 derr
<< __func__
<< " error: " << oid
<< " blob " << blob
5820 << " sbid " << i
.first
->shared_blob
->get_sbid() << " > blobid_max "
5821 << blobid_max
<< dendl
;
5823 } else if (i
.first
->shared_blob
->get_sbid() == 0) {
5824 derr
<< __func__
<< " error: " << oid
<< " blob " << blob
5825 << " marked as shared but has uninitialized sbid"
5829 sb_info_t
& sbi
= sb_info
[i
.first
->shared_blob
->get_sbid()];
5830 sbi
.sb
= i
.first
->shared_blob
;
5831 sbi
.oids
.push_back(oid
);
5832 sbi
.compressed
= blob
.is_compressed();
5833 for (auto e
: blob
.get_extents()) {
5835 sbi
.ref_map
.get(e
.offset
, e
.length
);
5839 errors
+= _fsck_check_extents(oid
, blob
.get_extents(),
5840 blob
.is_compressed(),
5847 int r
= _do_read(c
.get(), o
, 0, o
->onode
.size
, bl
, 0);
5850 derr
<< __func__
<< " error: " << oid
<< " error during read: "
5851 << cpp_strerror(r
) << dendl
;
5855 if (o
->onode
.has_omap()) {
5856 if (used_omap_head
.count(o
->onode
.nid
)) {
5857 derr
<< __func__
<< " error: " << oid
<< " omap_head " << o
->onode
.nid
5858 << " already in use" << dendl
;
5861 used_omap_head
.insert(o
->onode
.nid
);
5866 dout(1) << __func__
<< " checking shared_blobs" << dendl
;
5867 it
= db
->get_iterator(PREFIX_SHARED_BLOB
);
5869 for (it
->lower_bound(string()); it
->valid(); it
->next()) {
5870 string key
= it
->key();
5872 if (get_key_shared_blob(key
, &sbid
)) {
5873 derr
<< __func__
<< " error: bad key '" << key
5874 << "' in shared blob namespace" << dendl
;
5878 auto p
= sb_info
.find(sbid
);
5879 if (p
== sb_info
.end()) {
5880 derr
<< __func__
<< " error: found stray shared blob data for sbid 0x"
5881 << std::hex
<< sbid
<< std::dec
<< dendl
;
5885 sb_info_t
& sbi
= p
->second
;
5886 bluestore_shared_blob_t
shared_blob(sbid
);
5887 bufferlist bl
= it
->value();
5888 bufferlist::iterator blp
= bl
.begin();
5889 ::decode(shared_blob
, blp
);
5890 dout(20) << __func__
<< " " << *sbi
.sb
<< " " << shared_blob
<< dendl
;
5891 if (shared_blob
.ref_map
!= sbi
.ref_map
) {
5892 derr
<< __func__
<< " error: shared blob 0x" << std::hex
<< sbid
5893 << std::dec
<< " ref_map " << shared_blob
.ref_map
5894 << " != expected " << sbi
.ref_map
<< dendl
;
5897 PExtentVector extents
;
5898 for (auto &r
: shared_blob
.ref_map
.ref_map
) {
5899 extents
.emplace_back(bluestore_pextent_t(r
.first
, r
.second
.length
));
5901 errors
+= _fsck_check_extents(p
->second
.oids
.front(),
5903 p
->second
.compressed
,
5904 used_blocks
, expected_statfs
);
5909 for (auto &p
: sb_info
) {
5910 derr
<< __func__
<< " error: shared_blob 0x" << p
.first
5911 << " key is missing (" << *p
.second
.sb
<< ")" << dendl
;
5914 if (!(actual_statfs
== expected_statfs
)) {
5915 derr
<< __func__
<< " error: actual " << actual_statfs
5916 << " != expected " << expected_statfs
<< dendl
;
5920 dout(1) << __func__
<< " checking for stray omap data" << dendl
;
5921 it
= db
->get_iterator(PREFIX_OMAP
);
5923 for (it
->lower_bound(string()); it
->valid(); it
->next()) {
5925 _key_decode_u64(it
->key().c_str(), &omap_head
);
5926 if (used_omap_head
.count(omap_head
) == 0) {
5927 derr
<< __func__
<< " error: found stray omap data on omap_head "
5928 << omap_head
<< dendl
;
5934 dout(1) << __func__
<< " checking deferred events" << dendl
;
5935 it
= db
->get_iterator(PREFIX_DEFERRED
);
5937 for (it
->lower_bound(string()); it
->valid(); it
->next()) {
5938 bufferlist bl
= it
->value();
5939 bufferlist::iterator p
= bl
.begin();
5940 bluestore_deferred_transaction_t wt
;
5943 } catch (buffer::error
& e
) {
5944 derr
<< __func__
<< " error: failed to decode deferred txn "
5945 << pretty_binary_string(it
->key()) << dendl
;
5949 dout(20) << __func__
<< " deferred " << wt
.seq
5950 << " ops " << wt
.ops
.size()
5951 << " released 0x" << std::hex
<< wt
.released
<< std::dec
<< dendl
;
5952 for (auto e
= wt
.released
.begin(); e
!= wt
.released
.end(); ++e
) {
5954 e
.get_start(), e
.get_len(), block_size
, used_blocks
, "deferred",
5955 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5963 dout(1) << __func__
<< " checking freelist vs allocated" << dendl
;
5965 // remove bluefs_extents from used set since the freelist doesn't
5966 // know they are allocated.
5967 for (auto e
= bluefs_extents
.begin(); e
!= bluefs_extents
.end(); ++e
) {
5969 e
.get_start(), e
.get_len(), block_size
, used_blocks
, "bluefs_extents",
5970 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5975 fm
->enumerate_reset();
5976 uint64_t offset
, length
;
5977 while (fm
->enumerate_next(&offset
, &length
)) {
5978 bool intersects
= false;
5980 offset
, length
, block_size
, used_blocks
, "free",
5981 [&](uint64_t pos
, mempool_dynamic_bitset
&bs
) {
5990 derr
<< __func__
<< " error: free extent 0x" << std::hex
<< offset
5991 << "~" << length
<< std::dec
5992 << " intersects allocated blocks" << dendl
;
5996 fm
->enumerate_reset();
5997 size_t count
= used_blocks
.count();
5998 if (used_blocks
.size() == count
+ 1) {
5999 // this due to http://tracker.ceph.com/issues/21089
6000 bufferlist fm_bpb_bl
, fm_blocks_bl
, fm_bpk_bl
;
6001 db
->get(PREFIX_ALLOC
, "bytes_per_block", &fm_bpb_bl
);
6002 db
->get(PREFIX_ALLOC
, "blocks", &fm_blocks_bl
);
6003 db
->get(PREFIX_ALLOC
, "blocks_per_key", &fm_bpk_bl
);
6004 uint64_t fm_blocks
= 0;
6005 uint64_t fm_bsize
= 1;
6006 uint64_t fm_blocks_per_key
= 1;
6008 auto p
= fm_blocks_bl
.begin();
6009 ::decode(fm_blocks
, p
);
6010 auto q
= fm_bpb_bl
.begin();
6011 ::decode(fm_bsize
, q
);
6012 auto r
= fm_bpk_bl
.begin();
6013 ::decode(fm_blocks_per_key
, r
);
6014 } catch (buffer::error
& e
) {
6016 uint64_t dev_bsize
= bdev
->get_block_size();
6017 uint64_t bad_size
= bdev
->get_size() & ~fm_bsize
;
6018 if (used_blocks
.test(bad_size
/ dev_bsize
) == 0) {
6019 // this is the last block of the device that we previously
6020 // (incorrectly) truncated off of the effective device size. this
6021 // prevented BitmapFreelistManager from marking it as used along with
6022 // the other "past-eof" blocks in the last key slot. mark it used
6024 derr
<< __func__
<< " warning: fixing leaked block 0x" << std::hex
6025 << bad_size
<< "~" << fm_bsize
<< std::dec
<< " due to old bug"
6027 KeyValueDB::Transaction t
= db
->get_transaction();
6028 // fix freelistmanager metadata (the internal 'blocks' count is
6029 // rounded up to include the trailing key, past eof)
6030 uint64_t new_blocks
= bdev
->get_size() / fm_bsize
;
6031 if (new_blocks
/ fm_blocks_per_key
* fm_blocks_per_key
!= new_blocks
) {
6032 new_blocks
= (new_blocks
/ fm_blocks_per_key
+ 1) *
6035 if (new_blocks
!= fm_blocks
) {
6036 // the fm block count increased
6037 derr
<< __func__
<< " freelist block and key count changed, fixing 0x"
6038 << std::hex
<< bdev
->get_size() << "~"
6039 << ((new_blocks
* fm_bsize
) - bdev
->get_size()) << std::dec
6042 ::encode(new_blocks
, bl
);
6043 t
->set(PREFIX_ALLOC
, "blocks", bl
);
6044 fm
->allocate(bdev
->get_size(),
6045 (new_blocks
* fm_bsize
) - bdev
->get_size(),
6048 // block count is the same, but size changed; fix just the size
6049 derr
<< __func__
<< " fixing just the stray block at 0x"
6050 << std::hex
<< bad_size
<< "~" << fm_bsize
<< std::dec
<< dendl
;
6051 fm
->allocate(bad_size
, fm_bsize
, t
);
6054 ::encode(bdev
->get_size(), sizebl
);
6055 t
->set(PREFIX_ALLOC
, "size", sizebl
);
6056 int r
= db
->submit_transaction_sync(t
);
6059 used_blocks
.set(bad_size
/ dev_bsize
);
6063 if (used_blocks
.size() != count
) {
6064 assert(used_blocks
.size() > count
);
6067 size_t start
= used_blocks
.find_first();
6068 while (start
!= decltype(used_blocks
)::npos
) {
6071 size_t next
= used_blocks
.find_next(cur
);
6072 if (next
!= cur
+ 1) {
6073 derr
<< __func__
<< " error: leaked extent 0x" << std::hex
6074 << ((uint64_t)start
* block_size
) << "~"
6075 << ((cur
+ 1 - start
) * block_size
) << std::dec
6088 mempool_thread
.shutdown();
6095 it
.reset(); // before db is closed
6104 // fatal errors take precedence
6108 dout(2) << __func__
<< " " << num_objects
<< " objects, "
6109 << num_sharded_objects
<< " of them sharded. "
6111 dout(2) << __func__
<< " " << num_extents
<< " extents to "
6112 << num_blobs
<< " blobs, "
6113 << num_spanning_blobs
<< " spanning, "
6114 << num_shared_blobs
<< " shared."
6117 utime_t duration
= ceph_clock_now() - start
;
6118 dout(1) << __func__
<< " finish with " << errors
<< " errors in "
6119 << duration
<< " seconds" << dendl
;
6123 void BlueStore::collect_metadata(map
<string
,string
> *pm
)
6125 dout(10) << __func__
<< dendl
;
6126 bdev
->collect_metadata("bluestore_bdev_", pm
);
6128 (*pm
)["bluefs"] = "1";
6129 (*pm
)["bluefs_single_shared_device"] = stringify((int)bluefs_single_shared_device
);
6130 bluefs
->collect_metadata(pm
);
6132 (*pm
)["bluefs"] = "0";
6136 int BlueStore::statfs(struct store_statfs_t
*buf
)
6139 buf
->total
= bdev
->get_size();
6140 buf
->available
= alloc
->get_free();
6143 // part of our shared device is "free" according to BlueFS
6144 // Don't include bluestore_bluefs_min because that space can't
6145 // be used for any other purpose.
6146 buf
->available
+= bluefs
->get_free(bluefs_shared_bdev
) - cct
->_conf
->bluestore_bluefs_min
;
6148 // include dedicated db, too, if that isn't the shared device.
6149 if (bluefs_shared_bdev
!= BlueFS::BDEV_DB
) {
6150 buf
->total
+= bluefs
->get_total(BlueFS::BDEV_DB
);
6155 std::lock_guard
<std::mutex
> l(vstatfs_lock
);
6157 buf
->allocated
= vstatfs
.allocated();
6158 buf
->stored
= vstatfs
.stored();
6159 buf
->compressed
= vstatfs
.compressed();
6160 buf
->compressed_original
= vstatfs
.compressed_original();
6161 buf
->compressed_allocated
= vstatfs
.compressed_allocated();
6164 dout(20) << __func__
<< *buf
<< dendl
;
6171 BlueStore::CollectionRef
BlueStore::_get_collection(const coll_t
& cid
)
6173 RWLock::RLocker
l(coll_lock
);
6174 ceph::unordered_map
<coll_t
,CollectionRef
>::iterator cp
= coll_map
.find(cid
);
6175 if (cp
== coll_map
.end())
6176 return CollectionRef();
6180 void BlueStore::_queue_reap_collection(CollectionRef
& c
)
6182 dout(10) << __func__
<< " " << c
<< " " << c
->cid
<< dendl
;
6183 std::lock_guard
<std::mutex
> l(reap_lock
);
6184 removed_collections
.push_back(c
);
6187 void BlueStore::_reap_collections()
6189 list
<CollectionRef
> removed_colls
;
6191 std::lock_guard
<std::mutex
> l(reap_lock
);
6192 removed_colls
.swap(removed_collections
);
6195 bool all_reaped
= true;
6197 for (list
<CollectionRef
>::iterator p
= removed_colls
.begin();
6198 p
!= removed_colls
.end();
6200 CollectionRef c
= *p
;
6201 dout(10) << __func__
<< " " << c
<< " " << c
->cid
<< dendl
;
6202 if (c
->onode_map
.map_any([&](OnodeRef o
) {
6204 if (o
->flushing_count
.load()) {
6205 dout(10) << __func__
<< " " << c
<< " " << c
->cid
<< " " << o
->oid
6206 << " flush_txns " << o
->flushing_count
<< dendl
;
6214 c
->onode_map
.clear();
6215 dout(10) << __func__
<< " " << c
<< " " << c
->cid
<< " done" << dendl
;
6219 dout(10) << __func__
<< " all reaped" << dendl
;
6223 void BlueStore::_update_cache_logger()
6225 uint64_t num_onodes
= 0;
6226 uint64_t num_extents
= 0;
6227 uint64_t num_blobs
= 0;
6228 uint64_t num_buffers
= 0;
6229 uint64_t num_buffer_bytes
= 0;
6230 for (auto c
: cache_shards
) {
6231 c
->add_stats(&num_onodes
, &num_extents
, &num_blobs
,
6232 &num_buffers
, &num_buffer_bytes
);
6234 logger
->set(l_bluestore_onodes
, num_onodes
);
6235 logger
->set(l_bluestore_extents
, num_extents
);
6236 logger
->set(l_bluestore_blobs
, num_blobs
);
6237 logger
->set(l_bluestore_buffers
, num_buffers
);
6238 logger
->set(l_bluestore_buffer_bytes
, num_buffer_bytes
);
6244 ObjectStore::CollectionHandle
BlueStore::open_collection(const coll_t
& cid
)
6246 return _get_collection(cid
);
6249 bool BlueStore::exists(const coll_t
& cid
, const ghobject_t
& oid
)
6251 CollectionHandle c
= _get_collection(cid
);
6254 return exists(c
, oid
);
6257 bool BlueStore::exists(CollectionHandle
&c_
, const ghobject_t
& oid
)
6259 Collection
*c
= static_cast<Collection
*>(c_
.get());
6260 dout(10) << __func__
<< " " << c
->cid
<< " " << oid
<< dendl
;
6267 RWLock::RLocker
l(c
->lock
);
6268 OnodeRef o
= c
->get_onode(oid
, false);
6269 if (!o
|| !o
->exists
)
6276 int BlueStore::stat(
6278 const ghobject_t
& oid
,
6282 CollectionHandle c
= _get_collection(cid
);
6285 return stat(c
, oid
, st
, allow_eio
);
6288 int BlueStore::stat(
6289 CollectionHandle
&c_
,
6290 const ghobject_t
& oid
,
6294 Collection
*c
= static_cast<Collection
*>(c_
.get());
6297 dout(10) << __func__
<< " " << c
->get_cid() << " " << oid
<< dendl
;
6300 RWLock::RLocker
l(c
->lock
);
6301 OnodeRef o
= c
->get_onode(oid
, false);
6302 if (!o
|| !o
->exists
)
6304 st
->st_size
= o
->onode
.size
;
6305 st
->st_blksize
= 4096;
6306 st
->st_blocks
= (st
->st_size
+ st
->st_blksize
- 1) / st
->st_blksize
;
6311 if (_debug_mdata_eio(oid
)) {
6313 derr
<< __func__
<< " " << c
->cid
<< " " << oid
<< " INJECT EIO" << dendl
;
6317 int BlueStore::set_collection_opts(
6319 const pool_opts_t
& opts
)
6321 CollectionHandle ch
= _get_collection(cid
);
6324 Collection
*c
= static_cast<Collection
*>(ch
.get());
6325 dout(15) << __func__
<< " " << cid
<< " options " << opts
<< dendl
;
6328 RWLock::WLocker
l(c
->lock
);
6329 c
->pool_opts
= opts
;
6333 int BlueStore::read(
6335 const ghobject_t
& oid
,
6341 CollectionHandle c
= _get_collection(cid
);
6344 return read(c
, oid
, offset
, length
, bl
, op_flags
);
6347 int BlueStore::read(
6348 CollectionHandle
&c_
,
6349 const ghobject_t
& oid
,
6355 utime_t start
= ceph_clock_now();
6356 Collection
*c
= static_cast<Collection
*>(c_
.get());
6357 const coll_t
&cid
= c
->get_cid();
6358 dout(15) << __func__
<< " " << cid
<< " " << oid
6359 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
6367 RWLock::RLocker
l(c
->lock
);
6368 utime_t start1
= ceph_clock_now();
6369 OnodeRef o
= c
->get_onode(oid
, false);
6370 logger
->tinc(l_bluestore_read_onode_meta_lat
, ceph_clock_now() - start1
);
6371 if (!o
|| !o
->exists
) {
6376 if (offset
== length
&& offset
== 0)
6377 length
= o
->onode
.size
;
6379 r
= _do_read(c
, o
, offset
, length
, bl
, op_flags
);
6383 if (r
== 0 && _debug_data_eio(oid
)) {
6385 derr
<< __func__
<< " " << c
->cid
<< " " << oid
<< " INJECT EIO" << dendl
;
6386 } else if (cct
->_conf
->bluestore_debug_random_read_err
&&
6387 (rand() % (int)(cct
->_conf
->bluestore_debug_random_read_err
* 100.0)) == 0) {
6388 dout(0) << __func__
<< ": inject random EIO" << dendl
;
6391 dout(10) << __func__
<< " " << cid
<< " " << oid
6392 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
6393 << " = " << r
<< dendl
;
6394 logger
->tinc(l_bluestore_read_lat
, ceph_clock_now() - start
);
6398 // --------------------------------------------------------
6399 // intermediate data structures used while reading
6401 uint64_t logical_offset
;
6402 uint64_t blob_xoffset
; //region offset within the blob
6406 // used later in read process
6410 region_t(uint64_t offset
, uint64_t b_offs
, uint64_t len
)
6411 : logical_offset(offset
),
6412 blob_xoffset(b_offs
),
6414 region_t(const region_t
& from
)
6415 : logical_offset(from
.logical_offset
),
6416 blob_xoffset(from
.blob_xoffset
),
6417 length(from
.length
){}
6419 friend ostream
& operator<<(ostream
& out
, const region_t
& r
) {
6420 return out
<< "0x" << std::hex
<< r
.logical_offset
<< ":"
6421 << r
.blob_xoffset
<< "~" << r
.length
<< std::dec
;
6425 typedef list
<region_t
> regions2read_t
;
6426 typedef map
<BlueStore::BlobRef
, regions2read_t
> blobs2read_t
;
6428 int BlueStore::_do_read(
6439 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
6440 << " size 0x" << o
->onode
.size
<< " (" << std::dec
6441 << o
->onode
.size
<< ")" << dendl
;
6444 if (offset
>= o
->onode
.size
) {
6448 // generally, don't buffer anything, unless the client explicitly requests
6450 bool buffered
= false;
6451 if (op_flags
& CEPH_OSD_OP_FLAG_FADVISE_WILLNEED
) {
6452 dout(20) << __func__
<< " will do buffered read" << dendl
;
6454 } else if (cct
->_conf
->bluestore_default_buffered_read
&&
6455 (op_flags
& (CEPH_OSD_OP_FLAG_FADVISE_DONTNEED
|
6456 CEPH_OSD_OP_FLAG_FADVISE_NOCACHE
)) == 0) {
6457 dout(20) << __func__
<< " defaulting to buffered read" << dendl
;
6461 if (offset
+ length
> o
->onode
.size
) {
6462 length
= o
->onode
.size
- offset
;
6465 utime_t start
= ceph_clock_now();
6466 o
->extent_map
.fault_range(db
, offset
, length
);
6467 logger
->tinc(l_bluestore_read_onode_meta_lat
, ceph_clock_now() - start
);
6470 ready_regions_t ready_regions
;
6472 // build blob-wise list to of stuff read (that isn't cached)
6473 blobs2read_t blobs2read
;
6474 unsigned left
= length
;
6475 uint64_t pos
= offset
;
6476 unsigned num_regions
= 0;
6477 auto lp
= o
->extent_map
.seek_lextent(offset
);
6478 while (left
> 0 && lp
!= o
->extent_map
.extent_map
.end()) {
6479 if (pos
< lp
->logical_offset
) {
6480 unsigned hole
= lp
->logical_offset
- pos
;
6484 dout(30) << __func__
<< " hole 0x" << std::hex
<< pos
<< "~" << hole
6485 << std::dec
<< dendl
;
6489 BlobRef bptr
= lp
->blob
;
6490 unsigned l_off
= pos
- lp
->logical_offset
;
6491 unsigned b_off
= l_off
+ lp
->blob_offset
;
6492 unsigned b_len
= std::min(left
, lp
->length
- l_off
);
6494 ready_regions_t cache_res
;
6495 interval_set
<uint32_t> cache_interval
;
6496 bptr
->shared_blob
->bc
.read(
6497 bptr
->shared_blob
->get_cache(), b_off
, b_len
, cache_res
, cache_interval
);
6498 dout(20) << __func__
<< " blob " << *bptr
<< std::hex
6499 << " need 0x" << b_off
<< "~" << b_len
6500 << " cache has 0x" << cache_interval
6501 << std::dec
<< dendl
;
6503 auto pc
= cache_res
.begin();
6506 if (pc
!= cache_res
.end() &&
6507 pc
->first
== b_off
) {
6508 l
= pc
->second
.length();
6509 ready_regions
[pos
].claim(pc
->second
);
6510 dout(30) << __func__
<< " use cache 0x" << std::hex
<< pos
<< ": 0x"
6511 << b_off
<< "~" << l
<< std::dec
<< dendl
;
6515 if (pc
!= cache_res
.end()) {
6516 assert(pc
->first
> b_off
);
6517 l
= pc
->first
- b_off
;
6519 dout(30) << __func__
<< " will read 0x" << std::hex
<< pos
<< ": 0x"
6520 << b_off
<< "~" << l
<< std::dec
<< dendl
;
6521 blobs2read
[bptr
].emplace_back(region_t(pos
, b_off
, l
));
6532 // read raw blob data. use aio if we have >1 blobs to read.
6533 start
= ceph_clock_now(); // for the sake of simplicity
6534 // measure the whole block below.
6535 // The error isn't that much...
6536 vector
<bufferlist
> compressed_blob_bls
;
6537 IOContext
ioc(cct
, NULL
);
6538 for (auto& p
: blobs2read
) {
6539 BlobRef bptr
= p
.first
;
6540 dout(20) << __func__
<< " blob " << *bptr
<< std::hex
6541 << " need " << p
.second
<< std::dec
<< dendl
;
6542 if (bptr
->get_blob().is_compressed()) {
6543 // read the whole thing
6544 if (compressed_blob_bls
.empty()) {
6545 // ensure we avoid any reallocation on subsequent blobs
6546 compressed_blob_bls
.reserve(blobs2read
.size());
6548 compressed_blob_bls
.push_back(bufferlist());
6549 bufferlist
& bl
= compressed_blob_bls
.back();
6550 r
= bptr
->get_blob().map(
6551 0, bptr
->get_blob().get_ondisk_length(),
6552 [&](uint64_t offset
, uint64_t length
) {
6554 // use aio if there are more regions to read than those in this blob
6555 if (num_regions
> p
.second
.size()) {
6556 r
= bdev
->aio_read(offset
, length
, &bl
, &ioc
);
6558 r
= bdev
->read(offset
, length
, &bl
, &ioc
, false);
6567 for (auto& reg
: p
.second
) {
6568 // determine how much of the blob to read
6569 uint64_t chunk_size
= bptr
->get_blob().get_chunk_size(block_size
);
6570 reg
.r_off
= reg
.blob_xoffset
;
6571 uint64_t r_len
= reg
.length
;
6572 reg
.front
= reg
.r_off
% chunk_size
;
6574 reg
.r_off
-= reg
.front
;
6577 unsigned tail
= r_len
% chunk_size
;
6579 r_len
+= chunk_size
- tail
;
6581 dout(20) << __func__
<< " region 0x" << std::hex
6582 << reg
.logical_offset
6583 << ": 0x" << reg
.blob_xoffset
<< "~" << reg
.length
6584 << " reading 0x" << reg
.r_off
<< "~" << r_len
<< std::dec
6588 r
= bptr
->get_blob().map(
6590 [&](uint64_t offset
, uint64_t length
) {
6592 // use aio if there is more than one region to read
6593 if (num_regions
> 1) {
6594 r
= bdev
->aio_read(offset
, length
, ®
.bl
, &ioc
);
6596 r
= bdev
->read(offset
, length
, ®
.bl
, &ioc
, false);
6603 assert(reg
.bl
.length() == r_len
);
6607 if (ioc
.has_pending_aios()) {
6608 bdev
->aio_submit(&ioc
);
6609 dout(20) << __func__
<< " waiting for aio" << dendl
;
6612 logger
->tinc(l_bluestore_read_wait_aio_lat
, ceph_clock_now() - start
);
6614 // enumerate and decompress desired blobs
6615 auto p
= compressed_blob_bls
.begin();
6616 blobs2read_t::iterator b2r_it
= blobs2read
.begin();
6617 while (b2r_it
!= blobs2read
.end()) {
6618 BlobRef bptr
= b2r_it
->first
;
6619 dout(20) << __func__
<< " blob " << *bptr
<< std::hex
6620 << " need 0x" << b2r_it
->second
<< std::dec
<< dendl
;
6621 if (bptr
->get_blob().is_compressed()) {
6622 assert(p
!= compressed_blob_bls
.end());
6623 bufferlist
& compressed_bl
= *p
++;
6624 if (_verify_csum(o
, &bptr
->get_blob(), 0, compressed_bl
,
6625 b2r_it
->second
.front().logical_offset
) < 0) {
6629 r
= _decompress(compressed_bl
, &raw_bl
);
6633 bptr
->shared_blob
->bc
.did_read(bptr
->shared_blob
->get_cache(), 0,
6636 for (auto& i
: b2r_it
->second
) {
6637 ready_regions
[i
.logical_offset
].substr_of(
6638 raw_bl
, i
.blob_xoffset
, i
.length
);
6641 for (auto& reg
: b2r_it
->second
) {
6642 if (_verify_csum(o
, &bptr
->get_blob(), reg
.r_off
, reg
.bl
,
6643 reg
.logical_offset
) < 0) {
6647 bptr
->shared_blob
->bc
.did_read(bptr
->shared_blob
->get_cache(),
6651 // prune and keep result
6652 ready_regions
[reg
.logical_offset
].substr_of(
6653 reg
.bl
, reg
.front
, reg
.length
);
6659 // generate a resulting buffer
6660 auto pr
= ready_regions
.begin();
6661 auto pr_end
= ready_regions
.end();
6663 while (pos
< length
) {
6664 if (pr
!= pr_end
&& pr
->first
== pos
+ offset
) {
6665 dout(30) << __func__
<< " assemble 0x" << std::hex
<< pos
6666 << ": data from 0x" << pr
->first
<< "~" << pr
->second
.length()
6667 << std::dec
<< dendl
;
6668 pos
+= pr
->second
.length();
6669 bl
.claim_append(pr
->second
);
6672 uint64_t l
= length
- pos
;
6674 assert(pr
->first
> pos
+ offset
);
6675 l
= pr
->first
- (pos
+ offset
);
6677 dout(30) << __func__
<< " assemble 0x" << std::hex
<< pos
6678 << ": zeros for 0x" << (pos
+ offset
) << "~" << l
6679 << std::dec
<< dendl
;
6684 assert(bl
.length() == length
);
6685 assert(pos
== length
);
6686 assert(pr
== pr_end
);
6691 int BlueStore::_verify_csum(OnodeRef
& o
,
6692 const bluestore_blob_t
* blob
, uint64_t blob_xoffset
,
6693 const bufferlist
& bl
,
6694 uint64_t logical_offset
) const
6698 utime_t start
= ceph_clock_now();
6699 int r
= blob
->verify_csum(blob_xoffset
, bl
, &bad
, &bad_csum
);
6705 blob
->get_csum_chunk_size(),
6706 [&](uint64_t offset
, uint64_t length
) {
6707 pex
.emplace_back(bluestore_pextent_t(offset
, length
));
6710 derr
<< __func__
<< " bad "
6711 << Checksummer::get_csum_type_string(blob
->csum_type
)
6712 << "/0x" << std::hex
<< blob
->get_csum_chunk_size()
6713 << " checksum at blob offset 0x" << bad
6714 << ", got 0x" << bad_csum
<< ", expected 0x"
6715 << blob
->get_csum_item(bad
/ blob
->get_csum_chunk_size()) << std::dec
6716 << ", device location " << pex
6717 << ", logical extent 0x" << std::hex
6718 << (logical_offset
+ bad
- blob_xoffset
) << "~"
6719 << blob
->get_csum_chunk_size() << std::dec
6720 << ", object " << o
->oid
6723 derr
<< __func__
<< " failed with exit code: " << cpp_strerror(r
) << dendl
;
6726 logger
->tinc(l_bluestore_csum_lat
, ceph_clock_now() - start
);
6730 int BlueStore::_decompress(bufferlist
& source
, bufferlist
* result
)
6733 utime_t start
= ceph_clock_now();
6734 bufferlist::iterator i
= source
.begin();
6735 bluestore_compression_header_t chdr
;
6737 int alg
= int(chdr
.type
);
6738 CompressorRef cp
= compressor
;
6739 if (!cp
|| (int)cp
->get_type() != alg
) {
6740 cp
= Compressor::create(cct
, alg
);
6744 // if compressor isn't available - error, because cannot return
6745 // decompressed data?
6746 derr
<< __func__
<< " can't load decompressor " << alg
<< dendl
;
6749 r
= cp
->decompress(i
, chdr
.length
, *result
);
6751 derr
<< __func__
<< " decompression failed with exit code " << r
<< dendl
;
6755 logger
->tinc(l_bluestore_decompress_lat
, ceph_clock_now() - start
);
6759 // this stores fiemap into interval_set, other variations
6760 // use it internally
6761 int BlueStore::_fiemap(
6762 CollectionHandle
&c_
,
6763 const ghobject_t
& oid
,
6766 interval_set
<uint64_t>& destset
)
6768 Collection
*c
= static_cast<Collection
*>(c_
.get());
6772 RWLock::RLocker
l(c
->lock
);
6774 OnodeRef o
= c
->get_onode(oid
, false);
6775 if (!o
|| !o
->exists
) {
6780 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
6781 << " size 0x" << o
->onode
.size
<< std::dec
<< dendl
;
6783 boost::intrusive::set
<Extent
>::iterator ep
, eend
;
6784 if (offset
>= o
->onode
.size
)
6787 if (offset
+ length
> o
->onode
.size
) {
6788 length
= o
->onode
.size
- offset
;
6791 o
->extent_map
.fault_range(db
, offset
, length
);
6792 eend
= o
->extent_map
.extent_map
.end();
6793 ep
= o
->extent_map
.seek_lextent(offset
);
6794 while (length
> 0) {
6795 dout(20) << __func__
<< " offset " << offset
<< dendl
;
6796 if (ep
!= eend
&& ep
->logical_offset
+ ep
->length
<= offset
) {
6801 uint64_t x_len
= length
;
6802 if (ep
!= eend
&& ep
->logical_offset
<= offset
) {
6803 uint64_t x_off
= offset
- ep
->logical_offset
;
6804 x_len
= MIN(x_len
, ep
->length
- x_off
);
6805 dout(30) << __func__
<< " lextent 0x" << std::hex
<< offset
<< "~"
6806 << x_len
<< std::dec
<< " blob " << ep
->blob
<< dendl
;
6807 destset
.insert(offset
, x_len
);
6810 if (x_off
+ x_len
== ep
->length
)
6815 ep
->logical_offset
> offset
&&
6816 ep
->logical_offset
- offset
< x_len
) {
6817 x_len
= ep
->logical_offset
- offset
;
6825 dout(20) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
6826 << " size = 0x(" << destset
<< ")" << std::dec
<< dendl
;
6830 int BlueStore::fiemap(
6832 const ghobject_t
& oid
,
6837 CollectionHandle c
= _get_collection(cid
);
6840 return fiemap(c
, oid
, offset
, len
, bl
);
6843 int BlueStore::fiemap(
6844 CollectionHandle
&c_
,
6845 const ghobject_t
& oid
,
6850 interval_set
<uint64_t> m
;
6851 int r
= _fiemap(c_
, oid
, offset
, length
, m
);
6858 int BlueStore::fiemap(
6860 const ghobject_t
& oid
,
6863 map
<uint64_t, uint64_t>& destmap
)
6865 CollectionHandle c
= _get_collection(cid
);
6868 return fiemap(c
, oid
, offset
, len
, destmap
);
6871 int BlueStore::fiemap(
6872 CollectionHandle
&c_
,
6873 const ghobject_t
& oid
,
6876 map
<uint64_t, uint64_t>& destmap
)
6878 interval_set
<uint64_t> m
;
6879 int r
= _fiemap(c_
, oid
, offset
, length
, m
);
6881 m
.move_into(destmap
);
6886 int BlueStore::getattr(
6888 const ghobject_t
& oid
,
6892 CollectionHandle c
= _get_collection(cid
);
6895 return getattr(c
, oid
, name
, value
);
6898 int BlueStore::getattr(
6899 CollectionHandle
&c_
,
6900 const ghobject_t
& oid
,
6904 Collection
*c
= static_cast<Collection
*>(c_
.get());
6905 dout(15) << __func__
<< " " << c
->cid
<< " " << oid
<< " " << name
<< dendl
;
6911 RWLock::RLocker
l(c
->lock
);
6912 mempool::bluestore_cache_other::string
k(name
);
6914 OnodeRef o
= c
->get_onode(oid
, false);
6915 if (!o
|| !o
->exists
) {
6920 if (!o
->onode
.attrs
.count(k
)) {
6924 value
= o
->onode
.attrs
[k
];
6928 if (r
== 0 && _debug_mdata_eio(oid
)) {
6930 derr
<< __func__
<< " " << c
->cid
<< " " << oid
<< " INJECT EIO" << dendl
;
6932 dout(10) << __func__
<< " " << c
->cid
<< " " << oid
<< " " << name
6933 << " = " << r
<< dendl
;
6938 int BlueStore::getattrs(
6940 const ghobject_t
& oid
,
6941 map
<string
,bufferptr
>& aset
)
6943 CollectionHandle c
= _get_collection(cid
);
6946 return getattrs(c
, oid
, aset
);
6949 int BlueStore::getattrs(
6950 CollectionHandle
&c_
,
6951 const ghobject_t
& oid
,
6952 map
<string
,bufferptr
>& aset
)
6954 Collection
*c
= static_cast<Collection
*>(c_
.get());
6955 dout(15) << __func__
<< " " << c
->cid
<< " " << oid
<< dendl
;
6961 RWLock::RLocker
l(c
->lock
);
6963 OnodeRef o
= c
->get_onode(oid
, false);
6964 if (!o
|| !o
->exists
) {
6968 for (auto& i
: o
->onode
.attrs
) {
6969 aset
.emplace(i
.first
.c_str(), i
.second
);
6975 if (r
== 0 && _debug_mdata_eio(oid
)) {
6977 derr
<< __func__
<< " " << c
->cid
<< " " << oid
<< " INJECT EIO" << dendl
;
6979 dout(10) << __func__
<< " " << c
->cid
<< " " << oid
6980 << " = " << r
<< dendl
;
6984 int BlueStore::list_collections(vector
<coll_t
>& ls
)
6986 RWLock::RLocker
l(coll_lock
);
6987 for (ceph::unordered_map
<coll_t
, CollectionRef
>::iterator p
= coll_map
.begin();
6988 p
!= coll_map
.end();
6990 ls
.push_back(p
->first
);
6994 bool BlueStore::collection_exists(const coll_t
& c
)
6996 RWLock::RLocker
l(coll_lock
);
6997 return coll_map
.count(c
);
7000 int BlueStore::collection_empty(const coll_t
& cid
, bool *empty
)
7002 dout(15) << __func__
<< " " << cid
<< dendl
;
7003 vector
<ghobject_t
> ls
;
7005 int r
= collection_list(cid
, ghobject_t(), ghobject_t::get_max(), 1,
7008 derr
<< __func__
<< " collection_list returned: " << cpp_strerror(r
)
7012 *empty
= ls
.empty();
7013 dout(10) << __func__
<< " " << cid
<< " = " << (int)(*empty
) << dendl
;
7017 int BlueStore::collection_bits(const coll_t
& cid
)
7019 dout(15) << __func__
<< " " << cid
<< dendl
;
7020 CollectionRef c
= _get_collection(cid
);
7023 RWLock::RLocker
l(c
->lock
);
7024 dout(10) << __func__
<< " " << cid
<< " = " << c
->cnode
.bits
<< dendl
;
7025 return c
->cnode
.bits
;
7028 int BlueStore::collection_list(
7029 const coll_t
& cid
, const ghobject_t
& start
, const ghobject_t
& end
, int max
,
7030 vector
<ghobject_t
> *ls
, ghobject_t
*pnext
)
7032 CollectionHandle c
= _get_collection(cid
);
7035 return collection_list(c
, start
, end
, max
, ls
, pnext
);
7038 int BlueStore::collection_list(
7039 CollectionHandle
&c_
, const ghobject_t
& start
, const ghobject_t
& end
, int max
,
7040 vector
<ghobject_t
> *ls
, ghobject_t
*pnext
)
7042 Collection
*c
= static_cast<Collection
*>(c_
.get());
7043 dout(15) << __func__
<< " " << c
->cid
7044 << " start " << start
<< " end " << end
<< " max " << max
<< dendl
;
7047 RWLock::RLocker
l(c
->lock
);
7048 r
= _collection_list(c
, start
, end
, max
, ls
, pnext
);
7051 dout(10) << __func__
<< " " << c
->cid
7052 << " start " << start
<< " end " << end
<< " max " << max
7053 << " = " << r
<< ", ls.size() = " << ls
->size()
7054 << ", next = " << (pnext
? *pnext
: ghobject_t()) << dendl
;
7058 int BlueStore::_collection_list(
7059 Collection
*c
, const ghobject_t
& start
, const ghobject_t
& end
, int max
,
7060 vector
<ghobject_t
> *ls
, ghobject_t
*pnext
)
7067 ghobject_t static_next
;
7068 KeyValueDB::Iterator it
;
7069 string temp_start_key
, temp_end_key
;
7070 string start_key
, end_key
;
7071 bool set_next
= false;
7076 pnext
= &static_next
;
7078 if (start
== ghobject_t::get_max() ||
7079 start
.hobj
.is_max()) {
7082 get_coll_key_range(c
->cid
, c
->cnode
.bits
, &temp_start_key
, &temp_end_key
,
7083 &start_key
, &end_key
);
7084 dout(20) << __func__
7085 << " range " << pretty_binary_string(temp_start_key
)
7086 << " to " << pretty_binary_string(temp_end_key
)
7087 << " and " << pretty_binary_string(start_key
)
7088 << " to " << pretty_binary_string(end_key
)
7089 << " start " << start
<< dendl
;
7090 it
= db
->get_iterator(PREFIX_OBJ
);
7091 if (start
== ghobject_t() ||
7092 start
.hobj
== hobject_t() ||
7093 start
== c
->cid
.get_min_hobj()) {
7094 it
->upper_bound(temp_start_key
);
7098 get_object_key(cct
, start
, &k
);
7099 if (start
.hobj
.is_temp()) {
7101 assert(k
>= temp_start_key
&& k
< temp_end_key
);
7104 assert(k
>= start_key
&& k
< end_key
);
7106 dout(20) << " start from " << pretty_binary_string(k
)
7107 << " temp=" << (int)temp
<< dendl
;
7110 if (end
.hobj
.is_max()) {
7111 pend
= temp
? temp_end_key
: end_key
;
7113 get_object_key(cct
, end
, &end_key
);
7114 if (end
.hobj
.is_temp()) {
7120 pend
= temp
? temp_end_key
: end_key
;
7123 dout(20) << __func__
<< " pend " << pretty_binary_string(pend
) << dendl
;
7125 if (!it
->valid() || it
->key() >= pend
) {
7127 dout(20) << __func__
<< " iterator not valid (end of db?)" << dendl
;
7129 dout(20) << __func__
<< " key " << pretty_binary_string(it
->key())
7130 << " >= " << end
<< dendl
;
7132 if (end
.hobj
.is_temp()) {
7135 dout(30) << __func__
<< " switch to non-temp namespace" << dendl
;
7137 it
->upper_bound(start_key
);
7139 dout(30) << __func__
<< " pend " << pretty_binary_string(pend
) << dendl
;
7144 dout(30) << __func__
<< " key " << pretty_binary_string(it
->key()) << dendl
;
7145 if (is_extent_shard_key(it
->key())) {
7150 int r
= get_key_object(it
->key(), &oid
);
7152 dout(20) << __func__
<< " oid " << oid
<< " end " << end
<< dendl
;
7153 if (ls
->size() >= (unsigned)max
) {
7154 dout(20) << __func__
<< " reached max " << max
<< dendl
;
7164 *pnext
= ghobject_t::get_max();
7170 int BlueStore::omap_get(
7171 const coll_t
& cid
, ///< [in] Collection containing oid
7172 const ghobject_t
&oid
, ///< [in] Object containing omap
7173 bufferlist
*header
, ///< [out] omap header
7174 map
<string
, bufferlist
> *out
/// < [out] Key to value map
7177 CollectionHandle c
= _get_collection(cid
);
7180 return omap_get(c
, oid
, header
, out
);
7183 int BlueStore::omap_get(
7184 CollectionHandle
&c_
, ///< [in] Collection containing oid
7185 const ghobject_t
&oid
, ///< [in] Object containing omap
7186 bufferlist
*header
, ///< [out] omap header
7187 map
<string
, bufferlist
> *out
/// < [out] Key to value map
7190 Collection
*c
= static_cast<Collection
*>(c_
.get());
7191 dout(15) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< dendl
;
7194 RWLock::RLocker
l(c
->lock
);
7196 OnodeRef o
= c
->get_onode(oid
, false);
7197 if (!o
|| !o
->exists
) {
7201 if (!o
->onode
.has_omap())
7205 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_OMAP
);
7207 get_omap_header(o
->onode
.nid
, &head
);
7208 get_omap_tail(o
->onode
.nid
, &tail
);
7209 it
->lower_bound(head
);
7210 while (it
->valid()) {
7211 if (it
->key() == head
) {
7212 dout(30) << __func__
<< " got header" << dendl
;
7213 *header
= it
->value();
7214 } else if (it
->key() >= tail
) {
7215 dout(30) << __func__
<< " reached tail" << dendl
;
7219 decode_omap_key(it
->key(), &user_key
);
7220 dout(30) << __func__
<< " got " << pretty_binary_string(it
->key())
7221 << " -> " << user_key
<< dendl
;
7222 (*out
)[user_key
] = it
->value();
7228 dout(10) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< " = " << r
7233 int BlueStore::omap_get_header(
7234 const coll_t
& cid
, ///< [in] Collection containing oid
7235 const ghobject_t
&oid
, ///< [in] Object containing omap
7236 bufferlist
*header
, ///< [out] omap header
7237 bool allow_eio
///< [in] don't assert on eio
7240 CollectionHandle c
= _get_collection(cid
);
7243 return omap_get_header(c
, oid
, header
, allow_eio
);
7246 int BlueStore::omap_get_header(
7247 CollectionHandle
&c_
, ///< [in] Collection containing oid
7248 const ghobject_t
&oid
, ///< [in] Object containing omap
7249 bufferlist
*header
, ///< [out] omap header
7250 bool allow_eio
///< [in] don't assert on eio
7253 Collection
*c
= static_cast<Collection
*>(c_
.get());
7254 dout(15) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< dendl
;
7257 RWLock::RLocker
l(c
->lock
);
7259 OnodeRef o
= c
->get_onode(oid
, false);
7260 if (!o
|| !o
->exists
) {
7264 if (!o
->onode
.has_omap())
7269 get_omap_header(o
->onode
.nid
, &head
);
7270 if (db
->get(PREFIX_OMAP
, head
, header
) >= 0) {
7271 dout(30) << __func__
<< " got header" << dendl
;
7273 dout(30) << __func__
<< " no header" << dendl
;
7277 dout(10) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< " = " << r
7282 int BlueStore::omap_get_keys(
7283 const coll_t
& cid
, ///< [in] Collection containing oid
7284 const ghobject_t
&oid
, ///< [in] Object containing omap
7285 set
<string
> *keys
///< [out] Keys defined on oid
7288 CollectionHandle c
= _get_collection(cid
);
7291 return omap_get_keys(c
, oid
, keys
);
7294 int BlueStore::omap_get_keys(
7295 CollectionHandle
&c_
, ///< [in] Collection containing oid
7296 const ghobject_t
&oid
, ///< [in] Object containing omap
7297 set
<string
> *keys
///< [out] Keys defined on oid
7300 Collection
*c
= static_cast<Collection
*>(c_
.get());
7301 dout(15) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< dendl
;
7304 RWLock::RLocker
l(c
->lock
);
7306 OnodeRef o
= c
->get_onode(oid
, false);
7307 if (!o
|| !o
->exists
) {
7311 if (!o
->onode
.has_omap())
7315 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_OMAP
);
7317 get_omap_key(o
->onode
.nid
, string(), &head
);
7318 get_omap_tail(o
->onode
.nid
, &tail
);
7319 it
->lower_bound(head
);
7320 while (it
->valid()) {
7321 if (it
->key() >= tail
) {
7322 dout(30) << __func__
<< " reached tail" << dendl
;
7326 decode_omap_key(it
->key(), &user_key
);
7327 dout(30) << __func__
<< " got " << pretty_binary_string(it
->key())
7328 << " -> " << user_key
<< dendl
;
7329 keys
->insert(user_key
);
7334 dout(10) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< " = " << r
7339 int BlueStore::omap_get_values(
7340 const coll_t
& cid
, ///< [in] Collection containing oid
7341 const ghobject_t
&oid
, ///< [in] Object containing omap
7342 const set
<string
> &keys
, ///< [in] Keys to get
7343 map
<string
, bufferlist
> *out
///< [out] Returned keys and values
7346 CollectionHandle c
= _get_collection(cid
);
7349 return omap_get_values(c
, oid
, keys
, out
);
7352 int BlueStore::omap_get_values(
7353 CollectionHandle
&c_
, ///< [in] Collection containing oid
7354 const ghobject_t
&oid
, ///< [in] Object containing omap
7355 const set
<string
> &keys
, ///< [in] Keys to get
7356 map
<string
, bufferlist
> *out
///< [out] Returned keys and values
7359 Collection
*c
= static_cast<Collection
*>(c_
.get());
7360 dout(15) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< dendl
;
7363 RWLock::RLocker
l(c
->lock
);
7366 OnodeRef o
= c
->get_onode(oid
, false);
7367 if (!o
|| !o
->exists
) {
7371 if (!o
->onode
.has_omap())
7374 _key_encode_u64(o
->onode
.nid
, &final_key
);
7375 final_key
.push_back('.');
7376 for (set
<string
>::const_iterator p
= keys
.begin(); p
!= keys
.end(); ++p
) {
7377 final_key
.resize(9); // keep prefix
7380 if (db
->get(PREFIX_OMAP
, final_key
, &val
) >= 0) {
7381 dout(30) << __func__
<< " got " << pretty_binary_string(final_key
)
7382 << " -> " << *p
<< dendl
;
7383 out
->insert(make_pair(*p
, val
));
7387 dout(10) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< " = " << r
7392 int BlueStore::omap_check_keys(
7393 const coll_t
& cid
, ///< [in] Collection containing oid
7394 const ghobject_t
&oid
, ///< [in] Object containing omap
7395 const set
<string
> &keys
, ///< [in] Keys to check
7396 set
<string
> *out
///< [out] Subset of keys defined on oid
7399 CollectionHandle c
= _get_collection(cid
);
7402 return omap_check_keys(c
, oid
, keys
, out
);
7405 int BlueStore::omap_check_keys(
7406 CollectionHandle
&c_
, ///< [in] Collection containing oid
7407 const ghobject_t
&oid
, ///< [in] Object containing omap
7408 const set
<string
> &keys
, ///< [in] Keys to check
7409 set
<string
> *out
///< [out] Subset of keys defined on oid
7412 Collection
*c
= static_cast<Collection
*>(c_
.get());
7413 dout(15) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< dendl
;
7416 RWLock::RLocker
l(c
->lock
);
7419 OnodeRef o
= c
->get_onode(oid
, false);
7420 if (!o
|| !o
->exists
) {
7424 if (!o
->onode
.has_omap())
7427 _key_encode_u64(o
->onode
.nid
, &final_key
);
7428 final_key
.push_back('.');
7429 for (set
<string
>::const_iterator p
= keys
.begin(); p
!= keys
.end(); ++p
) {
7430 final_key
.resize(9); // keep prefix
7433 if (db
->get(PREFIX_OMAP
, final_key
, &val
) >= 0) {
7434 dout(30) << __func__
<< " have " << pretty_binary_string(final_key
)
7435 << " -> " << *p
<< dendl
;
7438 dout(30) << __func__
<< " miss " << pretty_binary_string(final_key
)
7439 << " -> " << *p
<< dendl
;
7443 dout(10) << __func__
<< " " << c
->get_cid() << " oid " << oid
<< " = " << r
7448 ObjectMap::ObjectMapIterator
BlueStore::get_omap_iterator(
7449 const coll_t
& cid
, ///< [in] collection
7450 const ghobject_t
&oid
///< [in] object
7453 CollectionHandle c
= _get_collection(cid
);
7455 dout(10) << __func__
<< " " << cid
<< "doesn't exist" <<dendl
;
7456 return ObjectMap::ObjectMapIterator();
7458 return get_omap_iterator(c
, oid
);
7461 ObjectMap::ObjectMapIterator
BlueStore::get_omap_iterator(
7462 CollectionHandle
&c_
, ///< [in] collection
7463 const ghobject_t
&oid
///< [in] object
7466 Collection
*c
= static_cast<Collection
*>(c_
.get());
7467 dout(10) << __func__
<< " " << c
->get_cid() << " " << oid
<< dendl
;
7469 return ObjectMap::ObjectMapIterator();
7471 RWLock::RLocker
l(c
->lock
);
7472 OnodeRef o
= c
->get_onode(oid
, false);
7473 if (!o
|| !o
->exists
) {
7474 dout(10) << __func__
<< " " << oid
<< "doesn't exist" <<dendl
;
7475 return ObjectMap::ObjectMapIterator();
7478 dout(10) << __func__
<< " has_omap = " << (int)o
->onode
.has_omap() <<dendl
;
7479 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_OMAP
);
7480 return ObjectMap::ObjectMapIterator(new OmapIteratorImpl(c
, o
, it
));
7483 // -----------------
7486 void BlueStore::_prepare_ondisk_format_super(KeyValueDB::Transaction
& t
)
7488 dout(10) << __func__
<< " ondisk_format " << ondisk_format
7489 << " min_compat_ondisk_format " << min_compat_ondisk_format
7491 assert(ondisk_format
== latest_ondisk_format
);
7494 ::encode(ondisk_format
, bl
);
7495 t
->set(PREFIX_SUPER
, "ondisk_format", bl
);
7499 ::encode(min_compat_ondisk_format
, bl
);
7500 t
->set(PREFIX_SUPER
, "min_compat_ondisk_format", bl
);
7504 int BlueStore::_open_super_meta()
7510 db
->get(PREFIX_SUPER
, "nid_max", &bl
);
7511 bufferlist::iterator p
= bl
.begin();
7516 } catch (buffer::error
& e
) {
7517 derr
<< __func__
<< " unable to read nid_max" << dendl
;
7520 dout(10) << __func__
<< " old nid_max " << nid_max
<< dendl
;
7521 nid_last
= nid_max
.load();
7528 db
->get(PREFIX_SUPER
, "blobid_max", &bl
);
7529 bufferlist::iterator p
= bl
.begin();
7534 } catch (buffer::error
& e
) {
7535 derr
<< __func__
<< " unable to read blobid_max" << dendl
;
7538 dout(10) << __func__
<< " old blobid_max " << blobid_max
<< dendl
;
7539 blobid_last
= blobid_max
.load();
7545 db
->get(PREFIX_SUPER
, "freelist_type", &bl
);
7547 freelist_type
= std::string(bl
.c_str(), bl
.length());
7548 dout(10) << __func__
<< " freelist_type " << freelist_type
<< dendl
;
7550 assert("Not Support extent freelist manager" == 0);
7555 if (cct
->_conf
->bluestore_bluefs
) {
7556 bluefs_extents
.clear();
7558 db
->get(PREFIX_SUPER
, "bluefs_extents", &bl
);
7559 bufferlist::iterator p
= bl
.begin();
7561 ::decode(bluefs_extents
, p
);
7563 catch (buffer::error
& e
) {
7564 derr
<< __func__
<< " unable to read bluefs_extents" << dendl
;
7567 dout(10) << __func__
<< " bluefs_extents 0x" << std::hex
<< bluefs_extents
7568 << std::dec
<< dendl
;
7572 int32_t compat_ondisk_format
= 0;
7575 int r
= db
->get(PREFIX_SUPER
, "ondisk_format", &bl
);
7577 // base case: kraken bluestore is v1 and readable by v1
7578 dout(20) << __func__
<< " missing ondisk_format; assuming kraken"
7581 compat_ondisk_format
= 1;
7583 auto p
= bl
.begin();
7585 ::decode(ondisk_format
, p
);
7586 } catch (buffer::error
& e
) {
7587 derr
<< __func__
<< " unable to read ondisk_format" << dendl
;
7592 r
= db
->get(PREFIX_SUPER
, "min_compat_ondisk_format", &bl
);
7594 auto p
= bl
.begin();
7596 ::decode(compat_ondisk_format
, p
);
7597 } catch (buffer::error
& e
) {
7598 derr
<< __func__
<< " unable to read compat_ondisk_format" << dendl
;
7603 dout(10) << __func__
<< " ondisk_format " << ondisk_format
7604 << " compat_ondisk_format " << compat_ondisk_format
7608 if (latest_ondisk_format
< compat_ondisk_format
) {
7609 derr
<< __func__
<< " compat_ondisk_format is "
7610 << compat_ondisk_format
<< " but we only understand version "
7611 << latest_ondisk_format
<< dendl
;
7614 if (ondisk_format
< latest_ondisk_format
) {
7615 int r
= _upgrade_super();
7623 db
->get(PREFIX_SUPER
, "min_alloc_size", &bl
);
7624 auto p
= bl
.begin();
7628 min_alloc_size
= val
;
7629 min_alloc_size_order
= ctz(val
);
7630 assert(min_alloc_size
== 1u << min_alloc_size_order
);
7631 } catch (buffer::error
& e
) {
7632 derr
<< __func__
<< " unable to read min_alloc_size" << dendl
;
7635 dout(10) << __func__
<< " min_alloc_size 0x" << std::hex
<< min_alloc_size
7636 << std::dec
<< dendl
;
7640 _set_throttle_params();
7649 int BlueStore::_upgrade_super()
7651 dout(1) << __func__
<< " from " << ondisk_format
<< ", latest "
7652 << latest_ondisk_format
<< dendl
;
7653 assert(ondisk_format
> 0);
7654 assert(ondisk_format
< latest_ondisk_format
);
7656 if (ondisk_format
== 1) {
7658 // - super: added ondisk_format
7659 // - super: added min_readable_ondisk_format
7660 // - super: added min_compat_ondisk_format
7661 // - super: added min_alloc_size
7662 // - super: removed min_min_alloc_size
7663 KeyValueDB::Transaction t
= db
->get_transaction();
7666 db
->get(PREFIX_SUPER
, "min_min_alloc_size", &bl
);
7667 auto p
= bl
.begin();
7671 min_alloc_size
= val
;
7672 } catch (buffer::error
& e
) {
7673 derr
<< __func__
<< " failed to read min_min_alloc_size" << dendl
;
7676 t
->set(PREFIX_SUPER
, "min_alloc_size", bl
);
7677 t
->rmkey(PREFIX_SUPER
, "min_min_alloc_size");
7680 _prepare_ondisk_format_super(t
);
7681 int r
= db
->submit_transaction_sync(t
);
7686 dout(1) << __func__
<< " done" << dendl
;
7690 void BlueStore::_assign_nid(TransContext
*txc
, OnodeRef o
)
7696 uint64_t nid
= ++nid_last
;
7697 dout(20) << __func__
<< " " << nid
<< dendl
;
7699 txc
->last_nid
= nid
;
7703 uint64_t BlueStore::_assign_blobid(TransContext
*txc
)
7705 uint64_t bid
= ++blobid_last
;
7706 dout(20) << __func__
<< " " << bid
<< dendl
;
7707 txc
->last_blobid
= bid
;
7711 void BlueStore::get_db_statistics(Formatter
*f
)
7713 db
->get_statistics(f
);
7716 BlueStore::TransContext
*BlueStore::_txc_create(OpSequencer
*osr
)
7718 TransContext
*txc
= new TransContext(cct
, osr
);
7719 txc
->t
= db
->get_transaction();
7720 osr
->queue_new(txc
);
7721 dout(20) << __func__
<< " osr " << osr
<< " = " << txc
7722 << " seq " << txc
->seq
<< dendl
;
7726 void BlueStore::_txc_calc_cost(TransContext
*txc
)
7728 // this is about the simplest model for transaction cost you can
7729 // imagine. there is some fixed overhead cost by saying there is a
7730 // minimum of one "io". and then we have some cost per "io" that is
7731 // a configurable (with different hdd and ssd defaults), and add
7732 // that to the bytes value.
7733 int ios
= 1; // one "io" for the kv commit
7734 for (auto& p
: txc
->ioc
.pending_aios
) {
7735 ios
+= p
.iov
.size();
7737 auto cost
= throttle_cost_per_io
.load();
7738 txc
->cost
= ios
* cost
+ txc
->bytes
;
7739 dout(10) << __func__
<< " " << txc
<< " cost " << txc
->cost
<< " ("
7740 << ios
<< " ios * " << cost
<< " + " << txc
->bytes
7741 << " bytes)" << dendl
;
7744 void BlueStore::_txc_update_store_statfs(TransContext
*txc
)
7746 if (txc
->statfs_delta
.is_empty())
7749 logger
->inc(l_bluestore_allocated
, txc
->statfs_delta
.allocated());
7750 logger
->inc(l_bluestore_stored
, txc
->statfs_delta
.stored());
7751 logger
->inc(l_bluestore_compressed
, txc
->statfs_delta
.compressed());
7752 logger
->inc(l_bluestore_compressed_allocated
, txc
->statfs_delta
.compressed_allocated());
7753 logger
->inc(l_bluestore_compressed_original
, txc
->statfs_delta
.compressed_original());
7756 std::lock_guard
<std::mutex
> l(vstatfs_lock
);
7757 vstatfs
+= txc
->statfs_delta
;
7761 txc
->statfs_delta
.encode(bl
);
7763 txc
->t
->merge(PREFIX_STAT
, "bluestore_statfs", bl
);
7764 txc
->statfs_delta
.reset();
7767 void BlueStore::_txc_state_proc(TransContext
*txc
)
7770 dout(10) << __func__
<< " txc " << txc
7771 << " " << txc
->get_state_name() << dendl
;
7772 switch (txc
->state
) {
7773 case TransContext::STATE_PREPARE
:
7774 txc
->log_state_latency(logger
, l_bluestore_state_prepare_lat
);
7775 if (txc
->ioc
.has_pending_aios()) {
7776 txc
->state
= TransContext::STATE_AIO_WAIT
;
7777 txc
->had_ios
= true;
7778 _txc_aio_submit(txc
);
7783 case TransContext::STATE_AIO_WAIT
:
7784 txc
->log_state_latency(logger
, l_bluestore_state_aio_wait_lat
);
7785 _txc_finish_io(txc
); // may trigger blocked txc's too
7788 case TransContext::STATE_IO_DONE
:
7789 //assert(txc->osr->qlock.is_locked()); // see _txc_finish_io
7791 ++txc
->osr
->txc_with_unstable_io
;
7793 txc
->log_state_latency(logger
, l_bluestore_state_io_done_lat
);
7794 txc
->state
= TransContext::STATE_KV_QUEUED
;
7795 if (cct
->_conf
->bluestore_sync_submit_transaction
) {
7796 if (txc
->last_nid
>= nid_max
||
7797 txc
->last_blobid
>= blobid_max
) {
7798 dout(20) << __func__
7799 << " last_{nid,blobid} exceeds max, submit via kv thread"
7801 } else if (txc
->osr
->kv_committing_serially
) {
7802 dout(20) << __func__
<< " prior txc submitted via kv thread, us too"
7804 // note: this is starvation-prone. once we have a txc in a busy
7805 // sequencer that is committing serially it is possible to keep
7806 // submitting new transactions fast enough that we get stuck doing
7807 // so. the alternative is to block here... fixme?
7808 } else if (txc
->osr
->txc_with_unstable_io
) {
7809 dout(20) << __func__
<< " prior txc(s) with unstable ios "
7810 << txc
->osr
->txc_with_unstable_io
.load() << dendl
;
7811 } else if (cct
->_conf
->bluestore_debug_randomize_serial_transaction
&&
7812 rand() % cct
->_conf
->bluestore_debug_randomize_serial_transaction
7814 dout(20) << __func__
<< " DEBUG randomly forcing submit via kv thread"
7817 txc
->state
= TransContext::STATE_KV_SUBMITTED
;
7818 int r
= cct
->_conf
->bluestore_debug_omit_kv_commit
? 0 : db
->submit_transaction(txc
->t
);
7820 _txc_applied_kv(txc
);
7824 std::lock_guard
<std::mutex
> l(kv_lock
);
7825 kv_queue
.push_back(txc
);
7826 kv_cond
.notify_one();
7827 if (txc
->state
!= TransContext::STATE_KV_SUBMITTED
) {
7828 kv_queue_unsubmitted
.push_back(txc
);
7829 ++txc
->osr
->kv_committing_serially
;
7833 kv_throttle_costs
+= txc
->cost
;
7836 case TransContext::STATE_KV_SUBMITTED
:
7837 txc
->log_state_latency(logger
, l_bluestore_state_kv_committing_lat
);
7838 txc
->state
= TransContext::STATE_KV_DONE
;
7839 _txc_committed_kv(txc
);
7842 case TransContext::STATE_KV_DONE
:
7843 txc
->log_state_latency(logger
, l_bluestore_state_kv_done_lat
);
7844 if (txc
->deferred_txn
) {
7845 txc
->state
= TransContext::STATE_DEFERRED_QUEUED
;
7846 _deferred_queue(txc
);
7849 txc
->state
= TransContext::STATE_FINISHING
;
7852 case TransContext::STATE_DEFERRED_CLEANUP
:
7853 txc
->log_state_latency(logger
, l_bluestore_state_deferred_cleanup_lat
);
7854 txc
->state
= TransContext::STATE_FINISHING
;
7857 case TransContext::STATE_FINISHING
:
7858 txc
->log_state_latency(logger
, l_bluestore_state_finishing_lat
);
7863 derr
<< __func__
<< " unexpected txc " << txc
7864 << " state " << txc
->get_state_name() << dendl
;
7865 assert(0 == "unexpected txc state");
7871 void BlueStore::_txc_finish_io(TransContext
*txc
)
7873 dout(20) << __func__
<< " " << txc
<< dendl
;
7876 * we need to preserve the order of kv transactions,
7877 * even though aio will complete in any order.
7880 OpSequencer
*osr
= txc
->osr
.get();
7881 std::lock_guard
<std::mutex
> l(osr
->qlock
);
7882 txc
->state
= TransContext::STATE_IO_DONE
;
7884 // release aio contexts (including pinned buffers).
7885 txc
->ioc
.running_aios
.clear();
7887 OpSequencer::q_list_t::iterator p
= osr
->q
.iterator_to(*txc
);
7888 while (p
!= osr
->q
.begin()) {
7890 if (p
->state
< TransContext::STATE_IO_DONE
) {
7891 dout(20) << __func__
<< " " << txc
<< " blocked by " << &*p
<< " "
7892 << p
->get_state_name() << dendl
;
7895 if (p
->state
> TransContext::STATE_IO_DONE
) {
7901 _txc_state_proc(&*p
++);
7902 } while (p
!= osr
->q
.end() &&
7903 p
->state
== TransContext::STATE_IO_DONE
);
7905 if (osr
->kv_submitted_waiters
&&
7906 osr
->_is_all_kv_submitted()) {
7907 osr
->qcond
.notify_all();
7911 void BlueStore::_txc_write_nodes(TransContext
*txc
, KeyValueDB::Transaction t
)
7913 dout(20) << __func__
<< " txc " << txc
7914 << " onodes " << txc
->onodes
7915 << " shared_blobs " << txc
->shared_blobs
7919 for (auto o
: txc
->onodes
) {
7920 // finalize extent_map shards
7921 o
->extent_map
.update(t
, false);
7922 if (o
->extent_map
.needs_reshard()) {
7923 o
->extent_map
.reshard(db
, t
);
7924 o
->extent_map
.update(t
, true);
7925 if (o
->extent_map
.needs_reshard()) {
7926 dout(20) << __func__
<< " warning: still wants reshard, check options?"
7928 o
->extent_map
.clear_needs_reshard();
7930 logger
->inc(l_bluestore_onode_reshard
);
7935 denc(o
->onode
, bound
);
7936 o
->extent_map
.bound_encode_spanning_blobs(bound
);
7937 if (o
->onode
.extent_map_shards
.empty()) {
7938 denc(o
->extent_map
.inline_bl
, bound
);
7943 unsigned onode_part
, blob_part
, extent_part
;
7945 auto p
= bl
.get_contiguous_appender(bound
, true);
7947 onode_part
= p
.get_logical_offset();
7948 o
->extent_map
.encode_spanning_blobs(p
);
7949 blob_part
= p
.get_logical_offset() - onode_part
;
7950 if (o
->onode
.extent_map_shards
.empty()) {
7951 denc(o
->extent_map
.inline_bl
, p
);
7953 extent_part
= p
.get_logical_offset() - onode_part
- blob_part
;
7956 dout(20) << " onode " << o
->oid
<< " is " << bl
.length()
7957 << " (" << onode_part
<< " bytes onode + "
7958 << blob_part
<< " bytes spanning blobs + "
7959 << extent_part
<< " bytes inline extents)"
7961 t
->set(PREFIX_OBJ
, o
->key
.c_str(), o
->key
.size(), bl
);
7962 o
->flushing_count
++;
7965 // objects we modified but didn't affect the onode
7966 auto p
= txc
->modified_objects
.begin();
7967 while (p
!= txc
->modified_objects
.end()) {
7968 if (txc
->onodes
.count(*p
) == 0) {
7969 (*p
)->flushing_count
++;
7972 // remove dups with onodes list to avoid problems in _txc_finish
7973 p
= txc
->modified_objects
.erase(p
);
7977 // finalize shared_blobs
7978 for (auto sb
: txc
->shared_blobs
) {
7980 auto sbid
= sb
->get_sbid();
7981 get_shared_blob_key(sbid
, &key
);
7982 if (sb
->persistent
->empty()) {
7983 dout(20) << " shared_blob 0x" << std::hex
<< sbid
<< std::dec
7984 << " is empty" << dendl
;
7985 t
->rmkey(PREFIX_SHARED_BLOB
, key
);
7988 ::encode(*(sb
->persistent
), bl
);
7989 dout(20) << " shared_blob 0x" << std::hex
<< sbid
<< std::dec
7990 << " is " << bl
.length() << " " << *sb
<< dendl
;
7991 t
->set(PREFIX_SHARED_BLOB
, key
, bl
);
7996 void BlueStore::BSPerfTracker::update_from_perfcounters(
7997 PerfCounters
&logger
)
7999 os_commit_latency
.consume_next(
8001 l_bluestore_commit_lat
));
8002 os_apply_latency
.consume_next(
8004 l_bluestore_commit_lat
));
8007 void BlueStore::_txc_finalize_kv(TransContext
*txc
, KeyValueDB::Transaction t
)
8009 dout(20) << __func__
<< " txc " << txc
<< std::hex
8010 << " allocated 0x" << txc
->allocated
8011 << " released 0x" << txc
->released
8012 << std::dec
<< dendl
;
8014 // We have to handle the case where we allocate *and* deallocate the
8015 // same region in this transaction. The freelist doesn't like that.
8016 // (Actually, the only thing that cares is the BitmapFreelistManager
8017 // debug check. But that's important.)
8018 interval_set
<uint64_t> tmp_allocated
, tmp_released
;
8019 interval_set
<uint64_t> *pallocated
= &txc
->allocated
;
8020 interval_set
<uint64_t> *preleased
= &txc
->released
;
8021 if (!txc
->allocated
.empty() && !txc
->released
.empty()) {
8022 interval_set
<uint64_t> overlap
;
8023 overlap
.intersection_of(txc
->allocated
, txc
->released
);
8024 if (!overlap
.empty()) {
8025 tmp_allocated
= txc
->allocated
;
8026 tmp_allocated
.subtract(overlap
);
8027 tmp_released
= txc
->released
;
8028 tmp_released
.subtract(overlap
);
8029 dout(20) << __func__
<< " overlap 0x" << std::hex
<< overlap
8030 << ", new allocated 0x" << tmp_allocated
8031 << " released 0x" << tmp_released
<< std::dec
8033 pallocated
= &tmp_allocated
;
8034 preleased
= &tmp_released
;
8038 // update freelist with non-overlap sets
8039 for (interval_set
<uint64_t>::iterator p
= pallocated
->begin();
8040 p
!= pallocated
->end();
8042 fm
->allocate(p
.get_start(), p
.get_len(), t
);
8044 for (interval_set
<uint64_t>::iterator p
= preleased
->begin();
8045 p
!= preleased
->end();
8047 dout(20) << __func__
<< " release 0x" << std::hex
<< p
.get_start()
8048 << "~" << p
.get_len() << std::dec
<< dendl
;
8049 fm
->release(p
.get_start(), p
.get_len(), t
);
8052 _txc_update_store_statfs(txc
);
8055 void BlueStore::_txc_applied_kv(TransContext
*txc
)
8057 for (auto ls
: { &txc
->onodes
, &txc
->modified_objects
}) {
8058 for (auto& o
: *ls
) {
8059 dout(20) << __func__
<< " onode " << o
<< " had " << o
->flushing_count
8061 if (--o
->flushing_count
== 0) {
8062 std::lock_guard
<std::mutex
> l(o
->flush_lock
);
8063 o
->flush_cond
.notify_all();
8069 void BlueStore::_txc_committed_kv(TransContext
*txc
)
8071 dout(20) << __func__
<< " txc " << txc
<< dendl
;
8073 // warning: we're calling onreadable_sync inside the sequencer lock
8074 if (txc
->onreadable_sync
) {
8075 txc
->onreadable_sync
->complete(0);
8076 txc
->onreadable_sync
= NULL
;
8078 unsigned n
= txc
->osr
->parent
->shard_hint
.hash_to_shard(m_finisher_num
);
8079 if (txc
->oncommit
) {
8080 logger
->tinc(l_bluestore_commit_lat
, ceph_clock_now() - txc
->start
);
8081 finishers
[n
]->queue(txc
->oncommit
);
8082 txc
->oncommit
= NULL
;
8084 if (txc
->onreadable
) {
8085 finishers
[n
]->queue(txc
->onreadable
);
8086 txc
->onreadable
= NULL
;
8089 if (!txc
->oncommits
.empty()) {
8090 finishers
[n
]->queue(txc
->oncommits
);
8094 void BlueStore::_txc_finish(TransContext
*txc
)
8096 dout(20) << __func__
<< " " << txc
<< " onodes " << txc
->onodes
<< dendl
;
8097 assert(txc
->state
== TransContext::STATE_FINISHING
);
8099 for (auto& sb
: txc
->shared_blobs_written
) {
8100 sb
->bc
.finish_write(sb
->get_cache(), txc
->seq
);
8102 txc
->shared_blobs_written
.clear();
8104 while (!txc
->removed_collections
.empty()) {
8105 _queue_reap_collection(txc
->removed_collections
.front());
8106 txc
->removed_collections
.pop_front();
8109 OpSequencerRef osr
= txc
->osr
;
8111 bool submit_deferred
= false;
8112 OpSequencer::q_list_t releasing_txc
;
8114 std::lock_guard
<std::mutex
> l(osr
->qlock
);
8115 txc
->state
= TransContext::STATE_DONE
;
8116 bool notify
= false;
8117 while (!osr
->q
.empty()) {
8118 TransContext
*txc
= &osr
->q
.front();
8119 dout(20) << __func__
<< " txc " << txc
<< " " << txc
->get_state_name()
8121 if (txc
->state
!= TransContext::STATE_DONE
) {
8122 if (txc
->state
== TransContext::STATE_PREPARE
&&
8123 deferred_aggressive
) {
8124 // for _osr_drain_preceding()
8127 if (txc
->state
== TransContext::STATE_DEFERRED_QUEUED
&&
8128 osr
->q
.size() > g_conf
->bluestore_max_deferred_txc
) {
8129 submit_deferred
= true;
8135 releasing_txc
.push_back(*txc
);
8139 osr
->qcond
.notify_all();
8141 if (osr
->q
.empty()) {
8142 dout(20) << __func__
<< " osr " << osr
<< " q now empty" << dendl
;
8146 while (!releasing_txc
.empty()) {
8147 // release to allocator only after all preceding txc's have also
8148 // finished any deferred writes that potentially land in these
8150 auto txc
= &releasing_txc
.front();
8151 _txc_release_alloc(txc
);
8152 releasing_txc
.pop_front();
8153 txc
->log_state_latency(logger
, l_bluestore_state_done_lat
);
8157 if (submit_deferred
) {
8158 // we're pinning memory; flush! we could be more fine-grained here but
8159 // i'm not sure it's worth the bother.
8160 deferred_try_submit();
8163 if (empty
&& osr
->zombie
) {
8164 dout(10) << __func__
<< " reaping empty zombie osr " << osr
<< dendl
;
8169 void BlueStore::_txc_release_alloc(TransContext
*txc
)
8171 // update allocator with full released set
8172 if (!cct
->_conf
->bluestore_debug_no_reuse_blocks
) {
8173 dout(10) << __func__
<< " " << txc
<< " " << txc
->released
<< dendl
;
8174 for (interval_set
<uint64_t>::iterator p
= txc
->released
.begin();
8175 p
!= txc
->released
.end();
8177 alloc
->release(p
.get_start(), p
.get_len());
8181 txc
->allocated
.clear();
8182 txc
->released
.clear();
8185 void BlueStore::_osr_drain_preceding(TransContext
*txc
)
8187 OpSequencer
*osr
= txc
->osr
.get();
8188 dout(10) << __func__
<< " " << txc
<< " osr " << osr
<< dendl
;
8189 ++deferred_aggressive
; // FIXME: maybe osr-local aggressive flag?
8191 // submit anything pending
8192 deferred_lock
.lock();
8193 if (osr
->deferred_pending
) {
8194 _deferred_submit_unlock(osr
);
8196 deferred_lock
.unlock();
8200 // wake up any previously finished deferred events
8201 std::lock_guard
<std::mutex
> l(kv_lock
);
8202 kv_cond
.notify_one();
8204 osr
->drain_preceding(txc
);
8205 --deferred_aggressive
;
8206 dout(10) << __func__
<< " " << osr
<< " done" << dendl
;
8209 void BlueStore::_osr_drain_all()
8211 dout(10) << __func__
<< dendl
;
8213 set
<OpSequencerRef
> s
;
8215 std::lock_guard
<std::mutex
> l(osr_lock
);
8218 dout(20) << __func__
<< " osr_set " << s
<< dendl
;
8220 ++deferred_aggressive
;
8222 // submit anything pending
8223 deferred_try_submit();
8226 // wake up any previously finished deferred events
8227 std::lock_guard
<std::mutex
> l(kv_lock
);
8228 kv_cond
.notify_one();
8231 std::lock_guard
<std::mutex
> l(kv_finalize_lock
);
8232 kv_finalize_cond
.notify_one();
8234 for (auto osr
: s
) {
8235 dout(20) << __func__
<< " drain " << osr
<< dendl
;
8238 --deferred_aggressive
;
8240 dout(10) << __func__
<< " done" << dendl
;
8243 void BlueStore::_osr_unregister_all()
8245 set
<OpSequencerRef
> s
;
8247 std::lock_guard
<std::mutex
> l(osr_lock
);
8250 dout(10) << __func__
<< " " << s
<< dendl
;
8251 for (auto osr
: s
) {
8255 // break link from Sequencer to us so that this OpSequencer
8256 // instance can die with this mount/umount cycle. note that
8257 // we assume umount() will not race against ~Sequencer.
8258 assert(osr
->parent
);
8259 osr
->parent
->p
.reset();
8262 // nobody should be creating sequencers during umount either.
8264 std::lock_guard
<std::mutex
> l(osr_lock
);
8265 assert(osr_set
.empty());
8269 void BlueStore::_kv_start()
8271 dout(10) << __func__
<< dendl
;
8273 if (cct
->_conf
->bluestore_shard_finishers
) {
8274 if (cct
->_conf
->osd_op_num_shards
) {
8275 m_finisher_num
= cct
->_conf
->osd_op_num_shards
;
8278 if (bdev
->is_rotational()) {
8279 m_finisher_num
= cct
->_conf
->osd_op_num_shards_hdd
;
8281 m_finisher_num
= cct
->_conf
->osd_op_num_shards_ssd
;
8286 assert(m_finisher_num
!= 0);
8288 for (int i
= 0; i
< m_finisher_num
; ++i
) {
8290 oss
<< "finisher-" << i
;
8291 Finisher
*f
= new Finisher(cct
, oss
.str(), "finisher");
8292 finishers
.push_back(f
);
8295 for (auto f
: finishers
) {
8298 kv_sync_thread
.create("bstore_kv_sync");
8299 kv_finalize_thread
.create("bstore_kv_final");
8302 void BlueStore::_kv_stop()
8304 dout(10) << __func__
<< dendl
;
8306 std::unique_lock
<std::mutex
> l(kv_lock
);
8307 while (!kv_sync_started
) {
8311 kv_cond
.notify_all();
8314 std::unique_lock
<std::mutex
> l(kv_finalize_lock
);
8315 while (!kv_finalize_started
) {
8316 kv_finalize_cond
.wait(l
);
8318 kv_finalize_stop
= true;
8319 kv_finalize_cond
.notify_all();
8321 kv_sync_thread
.join();
8322 kv_finalize_thread
.join();
8324 std::lock_guard
<std::mutex
> l(kv_lock
);
8328 std::lock_guard
<std::mutex
> l(kv_finalize_lock
);
8329 kv_finalize_stop
= false;
8331 dout(10) << __func__
<< " stopping finishers" << dendl
;
8332 for (auto f
: finishers
) {
8333 f
->wait_for_empty();
8336 dout(10) << __func__
<< " stopped" << dendl
;
8339 void BlueStore::_kv_sync_thread()
8341 dout(10) << __func__
<< " start" << dendl
;
8342 std::unique_lock
<std::mutex
> l(kv_lock
);
8343 assert(!kv_sync_started
);
8344 kv_sync_started
= true;
8345 kv_cond
.notify_all();
8347 assert(kv_committing
.empty());
8348 if (kv_queue
.empty() &&
8349 ((deferred_done_queue
.empty() && deferred_stable_queue
.empty()) ||
8350 !deferred_aggressive
)) {
8353 dout(20) << __func__
<< " sleep" << dendl
;
8355 dout(20) << __func__
<< " wake" << dendl
;
8357 deque
<TransContext
*> kv_submitting
;
8358 deque
<DeferredBatch
*> deferred_done
, deferred_stable
;
8359 uint64_t aios
= 0, costs
= 0;
8361 dout(20) << __func__
<< " committing " << kv_queue
.size()
8362 << " submitting " << kv_queue_unsubmitted
.size()
8363 << " deferred done " << deferred_done_queue
.size()
8364 << " stable " << deferred_stable_queue
.size()
8366 kv_committing
.swap(kv_queue
);
8367 kv_submitting
.swap(kv_queue_unsubmitted
);
8368 deferred_done
.swap(deferred_done_queue
);
8369 deferred_stable
.swap(deferred_stable_queue
);
8371 costs
= kv_throttle_costs
;
8373 kv_throttle_costs
= 0;
8374 utime_t start
= ceph_clock_now();
8377 dout(30) << __func__
<< " committing " << kv_committing
<< dendl
;
8378 dout(30) << __func__
<< " submitting " << kv_submitting
<< dendl
;
8379 dout(30) << __func__
<< " deferred_done " << deferred_done
<< dendl
;
8380 dout(30) << __func__
<< " deferred_stable " << deferred_stable
<< dendl
;
8382 bool force_flush
= false;
8383 // if bluefs is sharing the same device as data (only), then we
8384 // can rely on the bluefs commit to flush the device and make
8385 // deferred aios stable. that means that if we do have done deferred
8386 // txcs AND we are not on a single device, we need to force a flush.
8387 if (bluefs_single_shared_device
&& bluefs
) {
8390 } else if (kv_committing
.empty() && kv_submitting
.empty() &&
8391 deferred_stable
.empty()) {
8392 force_flush
= true; // there's nothing else to commit!
8393 } else if (deferred_aggressive
) {
8400 dout(20) << __func__
<< " num_aios=" << aios
8401 << " force_flush=" << (int)force_flush
8402 << ", flushing, deferred done->stable" << dendl
;
8403 // flush/barrier on block device
8406 // if we flush then deferred done are now deferred stable
8407 deferred_stable
.insert(deferred_stable
.end(), deferred_done
.begin(),
8408 deferred_done
.end());
8409 deferred_done
.clear();
8411 utime_t after_flush
= ceph_clock_now();
8413 // we will use one final transaction to force a sync
8414 KeyValueDB::Transaction synct
= db
->get_transaction();
8416 // increase {nid,blobid}_max? note that this covers both the
8417 // case where we are approaching the max and the case we passed
8418 // it. in either case, we increase the max in the earlier txn
8420 uint64_t new_nid_max
= 0, new_blobid_max
= 0;
8421 if (nid_last
+ cct
->_conf
->bluestore_nid_prealloc
/2 > nid_max
) {
8422 KeyValueDB::Transaction t
=
8423 kv_submitting
.empty() ? synct
: kv_submitting
.front()->t
;
8424 new_nid_max
= nid_last
+ cct
->_conf
->bluestore_nid_prealloc
;
8426 ::encode(new_nid_max
, bl
);
8427 t
->set(PREFIX_SUPER
, "nid_max", bl
);
8428 dout(10) << __func__
<< " new_nid_max " << new_nid_max
<< dendl
;
8430 if (blobid_last
+ cct
->_conf
->bluestore_blobid_prealloc
/2 > blobid_max
) {
8431 KeyValueDB::Transaction t
=
8432 kv_submitting
.empty() ? synct
: kv_submitting
.front()->t
;
8433 new_blobid_max
= blobid_last
+ cct
->_conf
->bluestore_blobid_prealloc
;
8435 ::encode(new_blobid_max
, bl
);
8436 t
->set(PREFIX_SUPER
, "blobid_max", bl
);
8437 dout(10) << __func__
<< " new_blobid_max " << new_blobid_max
<< dendl
;
8440 for (auto txc
: kv_committing
) {
8441 if (txc
->state
== TransContext::STATE_KV_QUEUED
) {
8442 txc
->log_state_latency(logger
, l_bluestore_state_kv_queued_lat
);
8443 int r
= cct
->_conf
->bluestore_debug_omit_kv_commit
? 0 : db
->submit_transaction(txc
->t
);
8445 _txc_applied_kv(txc
);
8446 --txc
->osr
->kv_committing_serially
;
8447 txc
->state
= TransContext::STATE_KV_SUBMITTED
;
8448 if (txc
->osr
->kv_submitted_waiters
) {
8449 std::lock_guard
<std::mutex
> l(txc
->osr
->qlock
);
8450 if (txc
->osr
->_is_all_kv_submitted()) {
8451 txc
->osr
->qcond
.notify_all();
8456 assert(txc
->state
== TransContext::STATE_KV_SUBMITTED
);
8457 txc
->log_state_latency(logger
, l_bluestore_state_kv_queued_lat
);
8460 --txc
->osr
->txc_with_unstable_io
;
8464 // release throttle *before* we commit. this allows new ops
8465 // to be prepared and enter pipeline while we are waiting on
8466 // the kv commit sync/flush. then hopefully on the next
8467 // iteration there will already be ops awake. otherwise, we
8468 // end up going to sleep, and then wake up when the very first
8469 // transaction is ready for commit.
8470 throttle_bytes
.put(costs
);
8472 PExtentVector bluefs_gift_extents
;
8474 after_flush
- bluefs_last_balance
>
8475 cct
->_conf
->bluestore_bluefs_balance_interval
) {
8476 bluefs_last_balance
= after_flush
;
8477 int r
= _balance_bluefs_freespace(&bluefs_gift_extents
);
8480 for (auto& p
: bluefs_gift_extents
) {
8481 bluefs_extents
.insert(p
.offset
, p
.length
);
8484 ::encode(bluefs_extents
, bl
);
8485 dout(10) << __func__
<< " bluefs_extents now 0x" << std::hex
8486 << bluefs_extents
<< std::dec
<< dendl
;
8487 synct
->set(PREFIX_SUPER
, "bluefs_extents", bl
);
8491 // cleanup sync deferred keys
8492 for (auto b
: deferred_stable
) {
8493 for (auto& txc
: b
->txcs
) {
8494 bluestore_deferred_transaction_t
& wt
= *txc
.deferred_txn
;
8495 if (!wt
.released
.empty()) {
8496 // kraken replay compat only
8497 txc
.released
= wt
.released
;
8498 dout(10) << __func__
<< " deferred txn has released "
8500 << " (we just upgraded from kraken) on " << &txc
<< dendl
;
8501 _txc_finalize_kv(&txc
, synct
);
8503 // cleanup the deferred
8505 get_deferred_key(wt
.seq
, &key
);
8506 synct
->rm_single_key(PREFIX_DEFERRED
, key
);
8510 // submit synct synchronously (block and wait for it to commit)
8511 int r
= cct
->_conf
->bluestore_debug_omit_kv_commit
? 0 : db
->submit_transaction_sync(synct
);
8515 nid_max
= new_nid_max
;
8516 dout(10) << __func__
<< " nid_max now " << nid_max
<< dendl
;
8518 if (new_blobid_max
) {
8519 blobid_max
= new_blobid_max
;
8520 dout(10) << __func__
<< " blobid_max now " << blobid_max
<< dendl
;
8524 utime_t finish
= ceph_clock_now();
8525 utime_t dur_flush
= after_flush
- start
;
8526 utime_t dur_kv
= finish
- after_flush
;
8527 utime_t dur
= finish
- start
;
8528 dout(20) << __func__
<< " committed " << kv_committing
.size()
8529 << " cleaned " << deferred_stable
.size()
8531 << " (" << dur_flush
<< " flush + " << dur_kv
<< " kv commit)"
8533 logger
->tinc(l_bluestore_kv_flush_lat
, dur_flush
);
8534 logger
->tinc(l_bluestore_kv_commit_lat
, dur_kv
);
8535 logger
->tinc(l_bluestore_kv_lat
, dur
);
8539 if (!bluefs_gift_extents
.empty()) {
8540 _commit_bluefs_freespace(bluefs_gift_extents
);
8542 for (auto p
= bluefs_extents_reclaiming
.begin();
8543 p
!= bluefs_extents_reclaiming
.end();
8545 dout(20) << __func__
<< " releasing old bluefs 0x" << std::hex
8546 << p
.get_start() << "~" << p
.get_len() << std::dec
8548 alloc
->release(p
.get_start(), p
.get_len());
8550 bluefs_extents_reclaiming
.clear();
8554 std::unique_lock
<std::mutex
> m(kv_finalize_lock
);
8555 if (kv_committing_to_finalize
.empty()) {
8556 kv_committing_to_finalize
.swap(kv_committing
);
8558 kv_committing_to_finalize
.insert(
8559 kv_committing_to_finalize
.end(),
8560 kv_committing
.begin(),
8561 kv_committing
.end());
8562 kv_committing
.clear();
8564 if (deferred_stable_to_finalize
.empty()) {
8565 deferred_stable_to_finalize
.swap(deferred_stable
);
8567 deferred_stable_to_finalize
.insert(
8568 deferred_stable_to_finalize
.end(),
8569 deferred_stable
.begin(),
8570 deferred_stable
.end());
8571 deferred_stable
.clear();
8573 kv_finalize_cond
.notify_one();
8577 // previously deferred "done" are now "stable" by virtue of this
8579 deferred_stable_queue
.swap(deferred_done
);
8582 dout(10) << __func__
<< " finish" << dendl
;
8583 kv_sync_started
= false;
8586 void BlueStore::_kv_finalize_thread()
8588 deque
<TransContext
*> kv_committed
;
8589 deque
<DeferredBatch
*> deferred_stable
;
8590 dout(10) << __func__
<< " start" << dendl
;
8591 std::unique_lock
<std::mutex
> l(kv_finalize_lock
);
8592 assert(!kv_finalize_started
);
8593 kv_finalize_started
= true;
8594 kv_finalize_cond
.notify_all();
8596 assert(kv_committed
.empty());
8597 assert(deferred_stable
.empty());
8598 if (kv_committing_to_finalize
.empty() &&
8599 deferred_stable_to_finalize
.empty()) {
8600 if (kv_finalize_stop
)
8602 dout(20) << __func__
<< " sleep" << dendl
;
8603 kv_finalize_cond
.wait(l
);
8604 dout(20) << __func__
<< " wake" << dendl
;
8606 kv_committed
.swap(kv_committing_to_finalize
);
8607 deferred_stable
.swap(deferred_stable_to_finalize
);
8609 dout(20) << __func__
<< " kv_committed " << kv_committed
<< dendl
;
8610 dout(20) << __func__
<< " deferred_stable " << deferred_stable
<< dendl
;
8612 while (!kv_committed
.empty()) {
8613 TransContext
*txc
= kv_committed
.front();
8614 assert(txc
->state
== TransContext::STATE_KV_SUBMITTED
);
8615 _txc_state_proc(txc
);
8616 kv_committed
.pop_front();
8619 for (auto b
: deferred_stable
) {
8620 auto p
= b
->txcs
.begin();
8621 while (p
!= b
->txcs
.end()) {
8622 TransContext
*txc
= &*p
;
8623 p
= b
->txcs
.erase(p
); // unlink here because
8624 _txc_state_proc(txc
); // this may destroy txc
8628 deferred_stable
.clear();
8630 if (!deferred_aggressive
) {
8631 if (deferred_queue_size
>= deferred_batch_ops
.load() ||
8632 throttle_deferred_bytes
.past_midpoint()) {
8633 deferred_try_submit();
8637 // this is as good a place as any ...
8638 _reap_collections();
8643 dout(10) << __func__
<< " finish" << dendl
;
8644 kv_finalize_started
= false;
8647 bluestore_deferred_op_t
*BlueStore::_get_deferred_op(
8648 TransContext
*txc
, OnodeRef o
)
8650 if (!txc
->deferred_txn
) {
8651 txc
->deferred_txn
= new bluestore_deferred_transaction_t
;
8653 txc
->deferred_txn
->ops
.push_back(bluestore_deferred_op_t());
8654 return &txc
->deferred_txn
->ops
.back();
8657 void BlueStore::_deferred_queue(TransContext
*txc
)
8659 dout(20) << __func__
<< " txc " << txc
<< " osr " << txc
->osr
<< dendl
;
8660 deferred_lock
.lock();
8661 if (!txc
->osr
->deferred_pending
&&
8662 !txc
->osr
->deferred_running
) {
8663 deferred_queue
.push_back(*txc
->osr
);
8665 if (!txc
->osr
->deferred_pending
) {
8666 txc
->osr
->deferred_pending
= new DeferredBatch(cct
, txc
->osr
.get());
8668 ++deferred_queue_size
;
8669 txc
->osr
->deferred_pending
->txcs
.push_back(*txc
);
8670 bluestore_deferred_transaction_t
& wt
= *txc
->deferred_txn
;
8671 for (auto opi
= wt
.ops
.begin(); opi
!= wt
.ops
.end(); ++opi
) {
8672 const auto& op
= *opi
;
8673 assert(op
.op
== bluestore_deferred_op_t::OP_WRITE
);
8674 bufferlist::const_iterator p
= op
.data
.begin();
8675 for (auto e
: op
.extents
) {
8676 txc
->osr
->deferred_pending
->prepare_write(
8677 cct
, wt
.seq
, e
.offset
, e
.length
, p
);
8680 if (deferred_aggressive
&&
8681 !txc
->osr
->deferred_running
) {
8682 _deferred_submit_unlock(txc
->osr
.get());
8684 deferred_lock
.unlock();
8688 void BlueStore::deferred_try_submit()
8690 dout(20) << __func__
<< " " << deferred_queue
.size() << " osrs, "
8691 << deferred_queue_size
<< " txcs" << dendl
;
8692 std::lock_guard
<std::mutex
> l(deferred_lock
);
8693 vector
<OpSequencerRef
> osrs
;
8694 osrs
.reserve(deferred_queue
.size());
8695 for (auto& osr
: deferred_queue
) {
8696 osrs
.push_back(&osr
);
8698 for (auto& osr
: osrs
) {
8699 if (osr
->deferred_pending
&& !osr
->deferred_running
) {
8700 _deferred_submit_unlock(osr
.get());
8701 deferred_lock
.lock();
8706 void BlueStore::_deferred_submit_unlock(OpSequencer
*osr
)
8708 dout(10) << __func__
<< " osr " << osr
8709 << " " << osr
->deferred_pending
->iomap
.size() << " ios pending "
8711 assert(osr
->deferred_pending
);
8712 assert(!osr
->deferred_running
);
8714 auto b
= osr
->deferred_pending
;
8715 deferred_queue_size
-= b
->seq_bytes
.size();
8716 assert(deferred_queue_size
>= 0);
8718 osr
->deferred_running
= osr
->deferred_pending
;
8719 osr
->deferred_pending
= nullptr;
8721 uint64_t start
= 0, pos
= 0;
8723 auto i
= b
->iomap
.begin();
8725 if (i
== b
->iomap
.end() || i
->first
!= pos
) {
8727 dout(20) << __func__
<< " write 0x" << std::hex
8728 << start
<< "~" << bl
.length()
8729 << " crc " << bl
.crc32c(-1) << std::dec
<< dendl
;
8730 if (!g_conf
->bluestore_debug_omit_block_device_write
) {
8731 logger
->inc(l_bluestore_deferred_write_ops
);
8732 logger
->inc(l_bluestore_deferred_write_bytes
, bl
.length());
8733 int r
= bdev
->aio_write(start
, bl
, &b
->ioc
, false);
8737 if (i
== b
->iomap
.end()) {
8744 dout(20) << __func__
<< " seq " << i
->second
.seq
<< " 0x"
8745 << std::hex
<< pos
<< "~" << i
->second
.bl
.length() << std::dec
8750 pos
+= i
->second
.bl
.length();
8751 bl
.claim_append(i
->second
.bl
);
8755 // demote to deferred_submit_lock, then drop that too
8756 std::lock_guard
<std::mutex
> l(deferred_submit_lock
);
8757 deferred_lock
.unlock();
8758 bdev
->aio_submit(&b
->ioc
);
8761 void BlueStore::_deferred_aio_finish(OpSequencer
*osr
)
8763 dout(10) << __func__
<< " osr " << osr
<< dendl
;
8764 assert(osr
->deferred_running
);
8765 DeferredBatch
*b
= osr
->deferred_running
;
8768 std::lock_guard
<std::mutex
> l(deferred_lock
);
8769 assert(osr
->deferred_running
== b
);
8770 osr
->deferred_running
= nullptr;
8771 if (!osr
->deferred_pending
) {
8772 auto q
= deferred_queue
.iterator_to(*osr
);
8773 deferred_queue
.erase(q
);
8774 } else if (deferred_aggressive
) {
8775 dout(20) << __func__
<< " queuing async deferred_try_submit" << dendl
;
8776 finishers
[0]->queue(new FunctionContext([&](int) {
8777 deferred_try_submit();
8784 std::lock_guard
<std::mutex
> l2(osr
->qlock
);
8785 for (auto& i
: b
->txcs
) {
8786 TransContext
*txc
= &i
;
8787 txc
->state
= TransContext::STATE_DEFERRED_CLEANUP
;
8790 osr
->qcond
.notify_all();
8791 throttle_deferred_bytes
.put(costs
);
8792 std::lock_guard
<std::mutex
> l(kv_lock
);
8793 deferred_done_queue
.emplace_back(b
);
8796 // in the normal case, do not bother waking up the kv thread; it will
8797 // catch us on the next commit anyway.
8798 if (deferred_aggressive
) {
8799 std::lock_guard
<std::mutex
> l(kv_lock
);
8800 kv_cond
.notify_one();
8804 int BlueStore::_deferred_replay()
8806 dout(10) << __func__
<< " start" << dendl
;
8807 OpSequencerRef osr
= new OpSequencer(cct
, this);
8810 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_DEFERRED
);
8811 for (it
->lower_bound(string()); it
->valid(); it
->next(), ++count
) {
8812 dout(20) << __func__
<< " replay " << pretty_binary_string(it
->key())
8814 bluestore_deferred_transaction_t
*deferred_txn
=
8815 new bluestore_deferred_transaction_t
;
8816 bufferlist bl
= it
->value();
8817 bufferlist::iterator p
= bl
.begin();
8819 ::decode(*deferred_txn
, p
);
8820 } catch (buffer::error
& e
) {
8821 derr
<< __func__
<< " failed to decode deferred txn "
8822 << pretty_binary_string(it
->key()) << dendl
;
8823 delete deferred_txn
;
8827 TransContext
*txc
= _txc_create(osr
.get());
8828 txc
->deferred_txn
= deferred_txn
;
8829 txc
->state
= TransContext::STATE_KV_DONE
;
8830 _txc_state_proc(txc
);
8833 dout(20) << __func__
<< " draining osr" << dendl
;
8836 dout(10) << __func__
<< " completed " << count
<< " events" << dendl
;
8840 // ---------------------------
8843 int BlueStore::queue_transactions(
8845 vector
<Transaction
>& tls
,
8847 ThreadPool::TPHandle
*handle
)
8850 Context
*onreadable
;
8852 Context
*onreadable_sync
;
8853 ObjectStore::Transaction::collect_contexts(
8854 tls
, &onreadable
, &ondisk
, &onreadable_sync
);
8856 if (cct
->_conf
->objectstore_blackhole
) {
8857 dout(0) << __func__
<< " objectstore_blackhole = TRUE, dropping transaction"
8861 delete onreadable_sync
;
8864 utime_t start
= ceph_clock_now();
8865 // set up the sequencer
8869 osr
= static_cast<OpSequencer
*>(posr
->p
.get());
8870 dout(10) << __func__
<< " existing " << osr
<< " " << *osr
<< dendl
;
8872 osr
= new OpSequencer(cct
, this);
8875 dout(10) << __func__
<< " new " << osr
<< " " << *osr
<< dendl
;
8879 TransContext
*txc
= _txc_create(osr
);
8880 txc
->onreadable
= onreadable
;
8881 txc
->onreadable_sync
= onreadable_sync
;
8882 txc
->oncommit
= ondisk
;
8884 for (vector
<Transaction
>::iterator p
= tls
.begin(); p
!= tls
.end(); ++p
) {
8886 txc
->bytes
+= (*p
).get_num_bytes();
8887 _txc_add_transaction(txc
, &(*p
));
8889 _txc_calc_cost(txc
);
8891 _txc_write_nodes(txc
, txc
->t
);
8893 // journal deferred items
8894 if (txc
->deferred_txn
) {
8895 txc
->deferred_txn
->seq
= ++deferred_seq
;
8897 ::encode(*txc
->deferred_txn
, bl
);
8899 get_deferred_key(txc
->deferred_txn
->seq
, &key
);
8900 txc
->t
->set(PREFIX_DEFERRED
, key
, bl
);
8903 _txc_finalize_kv(txc
, txc
->t
);
8905 handle
->suspend_tp_timeout();
8907 utime_t tstart
= ceph_clock_now();
8908 throttle_bytes
.get(txc
->cost
);
8909 if (txc
->deferred_txn
) {
8910 // ensure we do not block here because of deferred writes
8911 if (!throttle_deferred_bytes
.get_or_fail(txc
->cost
)) {
8912 dout(10) << __func__
<< " failed get throttle_deferred_bytes, aggressive"
8914 ++deferred_aggressive
;
8915 deferred_try_submit();
8916 throttle_deferred_bytes
.get(txc
->cost
);
8917 --deferred_aggressive
;
8920 utime_t tend
= ceph_clock_now();
8923 handle
->reset_tp_timeout();
8925 logger
->inc(l_bluestore_txc
);
8928 _txc_state_proc(txc
);
8930 logger
->tinc(l_bluestore_submit_lat
, ceph_clock_now() - start
);
8931 logger
->tinc(l_bluestore_throttle_lat
, tend
- tstart
);
8935 void BlueStore::_txc_aio_submit(TransContext
*txc
)
8937 dout(10) << __func__
<< " txc " << txc
<< dendl
;
8938 bdev
->aio_submit(&txc
->ioc
);
8941 void BlueStore::_txc_add_transaction(TransContext
*txc
, Transaction
*t
)
8943 Transaction::iterator i
= t
->begin();
8945 _dump_transaction(t
);
8947 vector
<CollectionRef
> cvec(i
.colls
.size());
8949 for (vector
<coll_t
>::iterator p
= i
.colls
.begin(); p
!= i
.colls
.end();
8951 cvec
[j
] = _get_collection(*p
);
8953 vector
<OnodeRef
> ovec(i
.objects
.size());
8955 for (int pos
= 0; i
.have_op(); ++pos
) {
8956 Transaction::Op
*op
= i
.decode_op();
8960 if (op
->op
== Transaction::OP_NOP
)
8963 // collection operations
8964 CollectionRef
&c
= cvec
[op
->cid
];
8966 case Transaction::OP_RMCOLL
:
8968 const coll_t
&cid
= i
.get_cid(op
->cid
);
8969 r
= _remove_collection(txc
, cid
, &c
);
8975 case Transaction::OP_MKCOLL
:
8978 const coll_t
&cid
= i
.get_cid(op
->cid
);
8979 r
= _create_collection(txc
, cid
, op
->split_bits
, &c
);
8985 case Transaction::OP_SPLIT_COLLECTION
:
8986 assert(0 == "deprecated");
8989 case Transaction::OP_SPLIT_COLLECTION2
:
8991 uint32_t bits
= op
->split_bits
;
8992 uint32_t rem
= op
->split_rem
;
8993 r
= _split_collection(txc
, c
, cvec
[op
->dest_cid
], bits
, rem
);
8999 case Transaction::OP_COLL_HINT
:
9001 uint32_t type
= op
->hint_type
;
9004 bufferlist::iterator hiter
= hint
.begin();
9005 if (type
== Transaction::COLL_HINT_EXPECTED_NUM_OBJECTS
) {
9008 ::decode(pg_num
, hiter
);
9009 ::decode(num_objs
, hiter
);
9010 dout(10) << __func__
<< " collection hint objects is a no-op, "
9011 << " pg_num " << pg_num
<< " num_objects " << num_objs
9015 dout(10) << __func__
<< " unknown collection hint " << type
<< dendl
;
9021 case Transaction::OP_COLL_SETATTR
:
9025 case Transaction::OP_COLL_RMATTR
:
9029 case Transaction::OP_COLL_RENAME
:
9030 assert(0 == "not implemented");
9034 derr
<< __func__
<< " error " << cpp_strerror(r
)
9035 << " not handled on operation " << op
->op
9036 << " (op " << pos
<< ", counting from 0)" << dendl
;
9037 _dump_transaction(t
, 0);
9038 assert(0 == "unexpected error");
9041 // these operations implicity create the object
9042 bool create
= false;
9043 if (op
->op
== Transaction::OP_TOUCH
||
9044 op
->op
== Transaction::OP_WRITE
||
9045 op
->op
== Transaction::OP_ZERO
) {
9049 // object operations
9050 RWLock::WLocker
l(c
->lock
);
9051 OnodeRef
&o
= ovec
[op
->oid
];
9053 ghobject_t oid
= i
.get_oid(op
->oid
);
9054 o
= c
->get_onode(oid
, create
);
9056 if (!create
&& (!o
|| !o
->exists
)) {
9057 dout(10) << __func__
<< " op " << op
->op
<< " got ENOENT on "
9058 << i
.get_oid(op
->oid
) << dendl
;
9064 case Transaction::OP_TOUCH
:
9065 r
= _touch(txc
, c
, o
);
9068 case Transaction::OP_WRITE
:
9070 uint64_t off
= op
->off
;
9071 uint64_t len
= op
->len
;
9072 uint32_t fadvise_flags
= i
.get_fadvise_flags();
9075 r
= _write(txc
, c
, o
, off
, len
, bl
, fadvise_flags
);
9079 case Transaction::OP_ZERO
:
9081 uint64_t off
= op
->off
;
9082 uint64_t len
= op
->len
;
9083 r
= _zero(txc
, c
, o
, off
, len
);
9087 case Transaction::OP_TRIMCACHE
:
9089 // deprecated, no-op
9093 case Transaction::OP_TRUNCATE
:
9095 uint64_t off
= op
->off
;
9096 r
= _truncate(txc
, c
, o
, off
);
9100 case Transaction::OP_REMOVE
:
9102 r
= _remove(txc
, c
, o
);
9106 case Transaction::OP_SETATTR
:
9108 string name
= i
.decode_string();
9111 r
= _setattr(txc
, c
, o
, name
, bp
);
9115 case Transaction::OP_SETATTRS
:
9117 map
<string
, bufferptr
> aset
;
9118 i
.decode_attrset(aset
);
9119 r
= _setattrs(txc
, c
, o
, aset
);
9123 case Transaction::OP_RMATTR
:
9125 string name
= i
.decode_string();
9126 r
= _rmattr(txc
, c
, o
, name
);
9130 case Transaction::OP_RMATTRS
:
9132 r
= _rmattrs(txc
, c
, o
);
9136 case Transaction::OP_CLONE
:
9138 OnodeRef
& no
= ovec
[op
->dest_oid
];
9140 const ghobject_t
& noid
= i
.get_oid(op
->dest_oid
);
9141 no
= c
->get_onode(noid
, true);
9143 r
= _clone(txc
, c
, o
, no
);
9147 case Transaction::OP_CLONERANGE
:
9148 assert(0 == "deprecated");
9151 case Transaction::OP_CLONERANGE2
:
9153 OnodeRef
& no
= ovec
[op
->dest_oid
];
9155 const ghobject_t
& noid
= i
.get_oid(op
->dest_oid
);
9156 no
= c
->get_onode(noid
, true);
9158 uint64_t srcoff
= op
->off
;
9159 uint64_t len
= op
->len
;
9160 uint64_t dstoff
= op
->dest_off
;
9161 r
= _clone_range(txc
, c
, o
, no
, srcoff
, len
, dstoff
);
9165 case Transaction::OP_COLL_ADD
:
9166 assert(0 == "not implemented");
9169 case Transaction::OP_COLL_REMOVE
:
9170 assert(0 == "not implemented");
9173 case Transaction::OP_COLL_MOVE
:
9174 assert(0 == "deprecated");
9177 case Transaction::OP_COLL_MOVE_RENAME
:
9178 case Transaction::OP_TRY_RENAME
:
9180 assert(op
->cid
== op
->dest_cid
);
9181 const ghobject_t
& noid
= i
.get_oid(op
->dest_oid
);
9182 OnodeRef
& no
= ovec
[op
->dest_oid
];
9184 no
= c
->get_onode(noid
, false);
9186 r
= _rename(txc
, c
, o
, no
, noid
);
9190 case Transaction::OP_OMAP_CLEAR
:
9192 r
= _omap_clear(txc
, c
, o
);
9195 case Transaction::OP_OMAP_SETKEYS
:
9198 i
.decode_attrset_bl(&aset_bl
);
9199 r
= _omap_setkeys(txc
, c
, o
, aset_bl
);
9202 case Transaction::OP_OMAP_RMKEYS
:
9205 i
.decode_keyset_bl(&keys_bl
);
9206 r
= _omap_rmkeys(txc
, c
, o
, keys_bl
);
9209 case Transaction::OP_OMAP_RMKEYRANGE
:
9212 first
= i
.decode_string();
9213 last
= i
.decode_string();
9214 r
= _omap_rmkey_range(txc
, c
, o
, first
, last
);
9217 case Transaction::OP_OMAP_SETHEADER
:
9221 r
= _omap_setheader(txc
, c
, o
, bl
);
9225 case Transaction::OP_SETALLOCHINT
:
9227 r
= _set_alloc_hint(txc
, c
, o
,
9228 op
->expected_object_size
,
9229 op
->expected_write_size
,
9230 op
->alloc_hint_flags
);
9235 derr
<< __func__
<< "bad op " << op
->op
<< dendl
;
9243 if (r
== -ENOENT
&& !(op
->op
== Transaction::OP_CLONERANGE
||
9244 op
->op
== Transaction::OP_CLONE
||
9245 op
->op
== Transaction::OP_CLONERANGE2
||
9246 op
->op
== Transaction::OP_COLL_ADD
||
9247 op
->op
== Transaction::OP_SETATTR
||
9248 op
->op
== Transaction::OP_SETATTRS
||
9249 op
->op
== Transaction::OP_RMATTR
||
9250 op
->op
== Transaction::OP_OMAP_SETKEYS
||
9251 op
->op
== Transaction::OP_OMAP_RMKEYS
||
9252 op
->op
== Transaction::OP_OMAP_RMKEYRANGE
||
9253 op
->op
== Transaction::OP_OMAP_SETHEADER
))
9254 // -ENOENT is usually okay
9260 const char *msg
= "unexpected error code";
9262 if (r
== -ENOENT
&& (op
->op
== Transaction::OP_CLONERANGE
||
9263 op
->op
== Transaction::OP_CLONE
||
9264 op
->op
== Transaction::OP_CLONERANGE2
))
9265 msg
= "ENOENT on clone suggests osd bug";
9268 // For now, if we hit _any_ ENOSPC, crash, before we do any damage
9269 // by partially applying transactions.
9270 msg
= "ENOSPC from bluestore, misconfigured cluster";
9272 if (r
== -ENOTEMPTY
) {
9273 msg
= "ENOTEMPTY suggests garbage data in osd data dir";
9276 derr
<< __func__
<< " error " << cpp_strerror(r
)
9277 << " not handled on operation " << op
->op
9278 << " (op " << pos
<< ", counting from 0)"
9280 derr
<< msg
<< dendl
;
9281 _dump_transaction(t
, 0);
9282 assert(0 == "unexpected error");
9290 // -----------------
9293 int BlueStore::_touch(TransContext
*txc
,
9297 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
9299 _assign_nid(txc
, o
);
9300 txc
->write_onode(o
);
9301 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
9305 void BlueStore::_dump_onode(OnodeRef o
, int log_level
)
9307 if (!cct
->_conf
->subsys
.should_gather(ceph_subsys_bluestore
, log_level
))
9309 dout(log_level
) << __func__
<< " " << o
<< " " << o
->oid
9310 << " nid " << o
->onode
.nid
9311 << " size 0x" << std::hex
<< o
->onode
.size
9312 << " (" << std::dec
<< o
->onode
.size
<< ")"
9313 << " expected_object_size " << o
->onode
.expected_object_size
9314 << " expected_write_size " << o
->onode
.expected_write_size
9315 << " in " << o
->onode
.extent_map_shards
.size() << " shards"
9316 << ", " << o
->extent_map
.spanning_blob_map
.size()
9317 << " spanning blobs"
9319 for (auto p
= o
->onode
.attrs
.begin();
9320 p
!= o
->onode
.attrs
.end();
9322 dout(log_level
) << __func__
<< " attr " << p
->first
9323 << " len " << p
->second
.length() << dendl
;
9325 _dump_extent_map(o
->extent_map
, log_level
);
9328 void BlueStore::_dump_extent_map(ExtentMap
&em
, int log_level
)
9331 for (auto& s
: em
.shards
) {
9332 dout(log_level
) << __func__
<< " shard " << *s
.shard_info
9333 << (s
.loaded
? " (loaded)" : "")
9334 << (s
.dirty
? " (dirty)" : "")
9337 for (auto& e
: em
.extent_map
) {
9338 dout(log_level
) << __func__
<< " " << e
<< dendl
;
9339 assert(e
.logical_offset
>= pos
);
9340 pos
= e
.logical_offset
+ e
.length
;
9341 const bluestore_blob_t
& blob
= e
.blob
->get_blob();
9342 if (blob
.has_csum()) {
9344 unsigned n
= blob
.get_csum_count();
9345 for (unsigned i
= 0; i
< n
; ++i
)
9346 v
.push_back(blob
.get_csum_item(i
));
9347 dout(log_level
) << __func__
<< " csum: " << std::hex
<< v
<< std::dec
9350 std::lock_guard
<std::recursive_mutex
> l(e
.blob
->shared_blob
->get_cache()->lock
);
9351 for (auto& i
: e
.blob
->shared_blob
->bc
.buffer_map
) {
9352 dout(log_level
) << __func__
<< " 0x" << std::hex
<< i
.first
9353 << "~" << i
.second
->length
<< std::dec
9354 << " " << *i
.second
<< dendl
;
9359 void BlueStore::_dump_transaction(Transaction
*t
, int log_level
)
9361 dout(log_level
) << " transaction dump:\n";
9362 JSONFormatter
f(true);
9363 f
.open_object_section("transaction");
9370 void BlueStore::_pad_zeros(
9371 bufferlist
*bl
, uint64_t *offset
,
9372 uint64_t chunk_size
)
9374 auto length
= bl
->length();
9375 dout(30) << __func__
<< " 0x" << std::hex
<< *offset
<< "~" << length
9376 << " chunk_size 0x" << chunk_size
<< std::dec
<< dendl
;
9377 dout(40) << "before:\n";
9378 bl
->hexdump(*_dout
);
9381 size_t front_pad
= *offset
% chunk_size
;
9382 size_t back_pad
= 0;
9383 size_t pad_count
= 0;
9385 size_t front_copy
= MIN(chunk_size
- front_pad
, length
);
9386 bufferptr z
= buffer::create_page_aligned(chunk_size
);
9387 z
.zero(0, front_pad
, false);
9388 pad_count
+= front_pad
;
9389 bl
->copy(0, front_copy
, z
.c_str() + front_pad
);
9390 if (front_copy
+ front_pad
< chunk_size
) {
9391 back_pad
= chunk_size
- (length
+ front_pad
);
9392 z
.zero(front_pad
+ length
, back_pad
, false);
9393 pad_count
+= back_pad
;
9397 t
.substr_of(old
, front_copy
, length
- front_copy
);
9399 bl
->claim_append(t
);
9400 *offset
-= front_pad
;
9401 length
+= pad_count
;
9405 uint64_t end
= *offset
+ length
;
9406 unsigned back_copy
= end
% chunk_size
;
9408 assert(back_pad
== 0);
9409 back_pad
= chunk_size
- back_copy
;
9410 assert(back_copy
<= length
);
9411 bufferptr
tail(chunk_size
);
9412 bl
->copy(length
- back_copy
, back_copy
, tail
.c_str());
9413 tail
.zero(back_copy
, back_pad
, false);
9416 bl
->substr_of(old
, 0, length
- back_copy
);
9419 pad_count
+= back_pad
;
9421 dout(20) << __func__
<< " pad 0x" << std::hex
<< front_pad
<< " + 0x"
9422 << back_pad
<< " on front/back, now 0x" << *offset
<< "~"
9423 << length
<< std::dec
<< dendl
;
9424 dout(40) << "after:\n";
9425 bl
->hexdump(*_dout
);
9428 logger
->inc(l_bluestore_write_pad_bytes
, pad_count
);
9429 assert(bl
->length() == length
);
9432 void BlueStore::_do_write_small(
9436 uint64_t offset
, uint64_t length
,
9437 bufferlist::iterator
& blp
,
9440 dout(10) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
9441 << std::dec
<< dendl
;
9442 assert(length
< min_alloc_size
);
9443 uint64_t end_offs
= offset
+ length
;
9445 logger
->inc(l_bluestore_write_small
);
9446 logger
->inc(l_bluestore_write_small_bytes
, length
);
9449 blp
.copy(length
, bl
);
9451 // Look for an existing mutable blob we can use.
9452 auto begin
= o
->extent_map
.extent_map
.begin();
9453 auto end
= o
->extent_map
.extent_map
.end();
9454 auto ep
= o
->extent_map
.seek_lextent(offset
);
9457 if (ep
->blob_end() <= offset
) {
9462 if (prev_ep
!= begin
) {
9465 prev_ep
= end
; // to avoid this extent check as it's a duplicate
9468 auto max_bsize
= MAX(wctx
->target_blob_size
, min_alloc_size
);
9469 auto min_off
= offset
>= max_bsize
? offset
- max_bsize
: 0;
9470 uint32_t alloc_len
= min_alloc_size
;
9471 auto offset0
= P2ALIGN(offset
, alloc_len
);
9475 // search suitable extent in both forward and reverse direction in
9476 // [offset - target_max_blob_size, offset + target_max_blob_size] range
9477 // then check if blob can be reused via can_reuse_blob func or apply
9478 // direct/deferred write (the latter for extents including or higher
9479 // than 'offset' only).
9483 if (ep
!= end
&& ep
->logical_offset
< offset
+ max_bsize
) {
9484 BlobRef b
= ep
->blob
;
9485 auto bstart
= ep
->blob_start();
9486 dout(20) << __func__
<< " considering " << *b
9487 << " bstart 0x" << std::hex
<< bstart
<< std::dec
<< dendl
;
9488 if (bstart
>= end_offs
) {
9489 dout(20) << __func__
<< " ignoring distant " << *b
<< dendl
;
9490 } else if (!b
->get_blob().is_mutable()) {
9491 dout(20) << __func__
<< " ignoring immutable " << *b
<< dendl
;
9492 } else if (ep
->logical_offset
% min_alloc_size
!=
9493 ep
->blob_offset
% min_alloc_size
) {
9494 dout(20) << __func__
<< " ignoring offset-skewed " << *b
<< dendl
;
9496 uint64_t chunk_size
= b
->get_blob().get_chunk_size(block_size
);
9497 // can we pad our head/tail out with zeros?
9498 uint64_t head_pad
, tail_pad
;
9499 head_pad
= P2PHASE(offset
, chunk_size
);
9500 tail_pad
= P2NPHASE(end_offs
, chunk_size
);
9501 if (head_pad
|| tail_pad
) {
9502 o
->extent_map
.fault_range(db
, offset
- head_pad
,
9503 end_offs
- offset
+ head_pad
+ tail_pad
);
9506 o
->extent_map
.has_any_lextents(offset
- head_pad
, chunk_size
)) {
9509 if (tail_pad
&& o
->extent_map
.has_any_lextents(end_offs
, tail_pad
)) {
9513 uint64_t b_off
= offset
- head_pad
- bstart
;
9514 uint64_t b_len
= length
+ head_pad
+ tail_pad
;
9516 // direct write into unused blocks of an existing mutable blob?
9517 if ((b_off
% chunk_size
== 0 && b_len
% chunk_size
== 0) &&
9518 b
->get_blob().get_ondisk_length() >= b_off
+ b_len
&&
9519 b
->get_blob().is_unused(b_off
, b_len
) &&
9520 b
->get_blob().is_allocated(b_off
, b_len
)) {
9521 _apply_padding(head_pad
, tail_pad
, bl
);
9523 dout(20) << __func__
<< " write to unused 0x" << std::hex
9524 << b_off
<< "~" << b_len
9525 << " pad 0x" << head_pad
<< " + 0x" << tail_pad
9526 << std::dec
<< " of mutable " << *b
<< dendl
;
9527 _buffer_cache_write(txc
, b
, b_off
, bl
,
9528 wctx
->buffered
? 0 : Buffer::FLAG_NOCACHE
);
9530 if (!g_conf
->bluestore_debug_omit_block_device_write
) {
9531 if (b_len
<= prefer_deferred_size
) {
9532 dout(20) << __func__
<< " deferring small 0x" << std::hex
9533 << b_len
<< std::dec
<< " unused write via deferred" << dendl
;
9534 bluestore_deferred_op_t
*op
= _get_deferred_op(txc
, o
);
9535 op
->op
= bluestore_deferred_op_t::OP_WRITE
;
9538 [&](uint64_t offset
, uint64_t length
) {
9539 op
->extents
.emplace_back(bluestore_pextent_t(offset
, length
));
9544 b
->get_blob().map_bl(
9546 [&](uint64_t offset
, bufferlist
& t
) {
9547 bdev
->aio_write(offset
, t
,
9548 &txc
->ioc
, wctx
->buffered
);
9552 b
->dirty_blob().calc_csum(b_off
, bl
);
9553 dout(20) << __func__
<< " lex old " << *ep
<< dendl
;
9554 Extent
*le
= o
->extent_map
.set_lextent(c
, offset
, b_off
+ head_pad
, length
,
9556 &wctx
->old_extents
);
9557 b
->dirty_blob().mark_used(le
->blob_offset
, le
->length
);
9558 txc
->statfs_delta
.stored() += le
->length
;
9559 dout(20) << __func__
<< " lex " << *le
<< dendl
;
9560 logger
->inc(l_bluestore_write_small_unused
);
9563 // read some data to fill out the chunk?
9564 uint64_t head_read
= P2PHASE(b_off
, chunk_size
);
9565 uint64_t tail_read
= P2NPHASE(b_off
+ b_len
, chunk_size
);
9566 if ((head_read
|| tail_read
) &&
9567 (b
->get_blob().get_ondisk_length() >= b_off
+ b_len
+ tail_read
) &&
9568 head_read
+ tail_read
< min_alloc_size
) {
9570 b_len
+= head_read
+ tail_read
;
9573 head_read
= tail_read
= 0;
9576 // chunk-aligned deferred overwrite?
9577 if (b
->get_blob().get_ondisk_length() >= b_off
+ b_len
&&
9578 b_off
% chunk_size
== 0 &&
9579 b_len
% chunk_size
== 0 &&
9580 b
->get_blob().is_allocated(b_off
, b_len
)) {
9582 _apply_padding(head_pad
, tail_pad
, bl
);
9584 dout(20) << __func__
<< " reading head 0x" << std::hex
<< head_read
9585 << " and tail 0x" << tail_read
<< std::dec
<< dendl
;
9588 int r
= _do_read(c
.get(), o
, offset
- head_pad
- head_read
, head_read
,
9590 assert(r
>= 0 && r
<= (int)head_read
);
9591 size_t zlen
= head_read
- r
;
9593 head_bl
.append_zero(zlen
);
9594 logger
->inc(l_bluestore_write_pad_bytes
, zlen
);
9596 bl
.claim_prepend(head_bl
);
9597 logger
->inc(l_bluestore_write_penalty_read_ops
);
9601 int r
= _do_read(c
.get(), o
, offset
+ length
+ tail_pad
, tail_read
,
9603 assert(r
>= 0 && r
<= (int)tail_read
);
9604 size_t zlen
= tail_read
- r
;
9606 tail_bl
.append_zero(zlen
);
9607 logger
->inc(l_bluestore_write_pad_bytes
, zlen
);
9609 bl
.claim_append(tail_bl
);
9610 logger
->inc(l_bluestore_write_penalty_read_ops
);
9612 logger
->inc(l_bluestore_write_small_pre_read
);
9614 bluestore_deferred_op_t
*op
= _get_deferred_op(txc
, o
);
9615 op
->op
= bluestore_deferred_op_t::OP_WRITE
;
9616 _buffer_cache_write(txc
, b
, b_off
, bl
,
9617 wctx
->buffered
? 0 : Buffer::FLAG_NOCACHE
);
9619 int r
= b
->get_blob().map(
9621 [&](uint64_t offset
, uint64_t length
) {
9622 op
->extents
.emplace_back(bluestore_pextent_t(offset
, length
));
9626 if (b
->get_blob().csum_type
) {
9627 b
->dirty_blob().calc_csum(b_off
, bl
);
9630 dout(20) << __func__
<< " deferred write 0x" << std::hex
<< b_off
<< "~"
9631 << b_len
<< std::dec
<< " of mutable " << *b
9632 << " at " << op
->extents
<< dendl
;
9633 Extent
*le
= o
->extent_map
.set_lextent(c
, offset
, offset
- bstart
, length
,
9634 b
, &wctx
->old_extents
);
9635 b
->dirty_blob().mark_used(le
->blob_offset
, le
->length
);
9636 txc
->statfs_delta
.stored() += le
->length
;
9637 dout(20) << __func__
<< " lex " << *le
<< dendl
;
9638 logger
->inc(l_bluestore_write_small_deferred
);
9641 // try to reuse blob if we can
9642 if (b
->can_reuse_blob(min_alloc_size
,
9646 assert(alloc_len
== min_alloc_size
); // expecting data always
9647 // fit into reused blob
9648 // Need to check for pending writes desiring to
9649 // reuse the same pextent. The rationale is that during GC two chunks
9650 // from garbage blobs(compressed?) can share logical space within the same
9651 // AU. That's in turn might be caused by unaligned len in clone_range2.
9652 // Hence the second write will fail in an attempt to reuse blob at
9653 // do_alloc_write().
9654 if (!wctx
->has_conflict(b
,
9656 offset0
+ alloc_len
,
9659 // we can't reuse pad_head/pad_tail since they might be truncated
9660 // due to existent extents
9661 uint64_t b_off
= offset
- bstart
;
9662 uint64_t b_off0
= b_off
;
9663 _pad_zeros(&bl
, &b_off0
, chunk_size
);
9665 dout(20) << __func__
<< " reuse blob " << *b
<< std::hex
9666 << " (0x" << b_off0
<< "~" << bl
.length() << ")"
9667 << " (0x" << b_off
<< "~" << length
<< ")"
9668 << std::dec
<< dendl
;
9670 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
->old_extents
);
9671 wctx
->write(offset
, b
, alloc_len
, b_off0
, bl
, b_off
, length
,
9673 logger
->inc(l_bluestore_write_small_unused
);
9680 } // if (ep != end && ep->logical_offset < offset + max_bsize)
9682 // check extent for reuse in reverse order
9683 if (prev_ep
!= end
&& prev_ep
->logical_offset
>= min_off
) {
9684 BlobRef b
= prev_ep
->blob
;
9685 auto bstart
= prev_ep
->blob_start();
9686 dout(20) << __func__
<< " considering " << *b
9687 << " bstart 0x" << std::hex
<< bstart
<< std::dec
<< dendl
;
9688 if (b
->can_reuse_blob(min_alloc_size
,
9692 assert(alloc_len
== min_alloc_size
); // expecting data always
9693 // fit into reused blob
9694 // Need to check for pending writes desiring to
9695 // reuse the same pextent. The rationale is that during GC two chunks
9696 // from garbage blobs(compressed?) can share logical space within the same
9697 // AU. That's in turn might be caused by unaligned len in clone_range2.
9698 // Hence the second write will fail in an attempt to reuse blob at
9699 // do_alloc_write().
9700 if (!wctx
->has_conflict(b
,
9702 offset0
+ alloc_len
,
9705 uint64_t chunk_size
= b
->get_blob().get_chunk_size(block_size
);
9706 uint64_t b_off
= offset
- bstart
;
9707 uint64_t b_off0
= b_off
;
9708 _pad_zeros(&bl
, &b_off0
, chunk_size
);
9710 dout(20) << __func__
<< " reuse blob " << *b
<< std::hex
9711 << " (0x" << b_off0
<< "~" << bl
.length() << ")"
9712 << " (0x" << b_off
<< "~" << length
<< ")"
9713 << std::dec
<< dendl
;
9715 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
->old_extents
);
9716 wctx
->write(offset
, b
, alloc_len
, b_off0
, bl
, b_off
, length
,
9718 logger
->inc(l_bluestore_write_small_unused
);
9722 if (prev_ep
!= begin
) {
9726 prev_ep
= end
; // to avoid useless first extent re-check
9728 } // if (prev_ep != end && prev_ep->logical_offset >= min_off)
9729 } while (any_change
);
9733 BlobRef b
= c
->new_blob();
9734 uint64_t b_off
= P2PHASE(offset
, alloc_len
);
9735 uint64_t b_off0
= b_off
;
9736 _pad_zeros(&bl
, &b_off0
, block_size
);
9737 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
->old_extents
);
9738 wctx
->write(offset
, b
, alloc_len
, b_off0
, bl
, b_off
, length
, true, true);
9739 logger
->inc(l_bluestore_write_small_new
);
9744 void BlueStore::_do_write_big(
9748 uint64_t offset
, uint64_t length
,
9749 bufferlist::iterator
& blp
,
9752 dout(10) << __func__
<< " 0x" << std::hex
<< offset
<< "~" << length
9753 << " target_blob_size 0x" << wctx
->target_blob_size
<< std::dec
9754 << " compress " << (int)wctx
->compress
9756 logger
->inc(l_bluestore_write_big
);
9757 logger
->inc(l_bluestore_write_big_bytes
, length
);
9758 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
->old_extents
);
9759 auto max_bsize
= MAX(wctx
->target_blob_size
, min_alloc_size
);
9760 while (length
> 0) {
9761 bool new_blob
= false;
9762 uint32_t l
= MIN(max_bsize
, length
);
9766 //attempting to reuse existing blob
9767 if (!wctx
->compress
) {
9768 // look for an existing mutable blob we can reuse
9769 auto begin
= o
->extent_map
.extent_map
.begin();
9770 auto end
= o
->extent_map
.extent_map
.end();
9771 auto ep
= o
->extent_map
.seek_lextent(offset
);
9773 if (prev_ep
!= begin
) {
9776 prev_ep
= end
; // to avoid this extent check as it's a duplicate
9778 auto min_off
= offset
>= max_bsize
? offset
- max_bsize
: 0;
9779 // search suitable extent in both forward and reverse direction in
9780 // [offset - target_max_blob_size, offset + target_max_blob_size] range
9781 // then check if blob can be reused via can_reuse_blob func.
9785 if (ep
!= end
&& ep
->logical_offset
< offset
+ max_bsize
) {
9786 if (offset
>= ep
->blob_start() &&
9787 ep
->blob
->can_reuse_blob(min_alloc_size
, max_bsize
,
9788 offset
- ep
->blob_start(),
9791 b_off
= offset
- ep
->blob_start();
9792 prev_ep
= end
; // to avoid check below
9793 dout(20) << __func__
<< " reuse blob " << *b
<< std::hex
9794 << " (0x" << b_off
<< "~" << l
<< ")" << std::dec
<< dendl
;
9801 if (prev_ep
!= end
&& prev_ep
->logical_offset
>= min_off
) {
9802 if (prev_ep
->blob
->can_reuse_blob(min_alloc_size
, max_bsize
,
9803 offset
- prev_ep
->blob_start(),
9806 b_off
= offset
- prev_ep
->blob_start();
9807 dout(20) << __func__
<< " reuse blob " << *b
<< std::hex
9808 << " (0x" << b_off
<< "~" << l
<< ")" << std::dec
<< dendl
;
9809 } else if (prev_ep
!= begin
) {
9813 prev_ep
= end
; // to avoid useless first extent re-check
9816 } while (b
== nullptr && any_change
);
9826 wctx
->write(offset
, b
, l
, b_off
, t
, b_off
, l
, false, new_blob
);
9829 logger
->inc(l_bluestore_write_big_blobs
);
9833 int BlueStore::_do_alloc_write(
9839 dout(20) << __func__
<< " txc " << txc
9840 << " " << wctx
->writes
.size() << " blobs"
9844 auto max_bsize
= MAX(wctx
->target_blob_size
, min_alloc_size
);
9845 for (auto &wi
: wctx
->writes
) {
9846 need
+= wi
.blob_length
;
9848 int r
= alloc
->reserve(need
);
9850 derr
<< __func__
<< " failed to reserve 0x" << std::hex
<< need
<< std::dec
9858 if (wctx
->compress
) {
9860 "compression_algorithm",
9864 if (coll
->pool_opts
.get(pool_opts_t::COMPRESSION_ALGORITHM
, &val
)) {
9865 CompressorRef cp
= compressor
;
9866 if (!cp
|| cp
->get_type_name() != val
) {
9867 cp
= Compressor::create(cct
, val
);
9869 return boost::optional
<CompressorRef
>(cp
);
9871 return boost::optional
<CompressorRef
>();
9875 crr
= select_option(
9876 "compression_required_ratio",
9877 cct
->_conf
->bluestore_compression_required_ratio
,
9880 if(coll
->pool_opts
.get(pool_opts_t::COMPRESSION_REQUIRED_RATIO
, &val
)) {
9881 return boost::optional
<double>(val
);
9883 return boost::optional
<double>();
9889 int csum
= csum_type
.load();
9890 csum
= select_option(
9895 if(coll
->pool_opts
.get(pool_opts_t::CSUM_TYPE
, &val
)) {
9896 return boost::optional
<int>(val
);
9898 return boost::optional
<int>();
9902 for (auto& wi
: wctx
->writes
) {
9904 bluestore_blob_t
& dblob
= b
->dirty_blob();
9905 uint64_t b_off
= wi
.b_off
;
9906 bufferlist
*l
= &wi
.bl
;
9907 uint64_t final_length
= wi
.blob_length
;
9908 uint64_t csum_length
= wi
.blob_length
;
9909 unsigned csum_order
= block_size_order
;
9910 bufferlist compressed_bl
;
9911 bool compressed
= false;
9912 if(c
&& wi
.blob_length
> min_alloc_size
) {
9914 utime_t start
= ceph_clock_now();
9918 assert(wi
.blob_length
== l
->length());
9919 bluestore_compression_header_t chdr
;
9920 chdr
.type
= c
->get_type();
9921 // FIXME: memory alignment here is bad
9924 r
= c
->compress(*l
, t
);
9927 chdr
.length
= t
.length();
9928 ::encode(chdr
, compressed_bl
);
9929 compressed_bl
.claim_append(t
);
9930 uint64_t rawlen
= compressed_bl
.length();
9931 uint64_t newlen
= P2ROUNDUP(rawlen
, min_alloc_size
);
9932 uint64_t want_len_raw
= final_length
* crr
;
9933 uint64_t want_len
= P2ROUNDUP(want_len_raw
, min_alloc_size
);
9934 if (newlen
<= want_len
&& newlen
< final_length
) {
9935 // Cool. We compressed at least as much as we were hoping to.
9936 // pad out to min_alloc_size
9937 compressed_bl
.append_zero(newlen
- rawlen
);
9938 logger
->inc(l_bluestore_write_pad_bytes
, newlen
- rawlen
);
9939 dout(20) << __func__
<< std::hex
<< " compressed 0x" << wi
.blob_length
9940 << " -> 0x" << rawlen
<< " => 0x" << newlen
9941 << " with " << c
->get_type()
9942 << std::dec
<< dendl
;
9943 txc
->statfs_delta
.compressed() += rawlen
;
9944 txc
->statfs_delta
.compressed_original() += l
->length();
9945 txc
->statfs_delta
.compressed_allocated() += newlen
;
9947 final_length
= newlen
;
9948 csum_length
= newlen
;
9949 csum_order
= ctz(newlen
);
9950 dblob
.set_compressed(wi
.blob_length
, rawlen
);
9952 logger
->inc(l_bluestore_compress_success_count
);
9954 dout(20) << __func__
<< std::hex
<< " 0x" << l
->length()
9955 << " compressed to 0x" << rawlen
<< " -> 0x" << newlen
9956 << " with " << c
->get_type()
9957 << ", which is more than required 0x" << want_len_raw
9958 << " -> 0x" << want_len
9959 << ", leaving uncompressed"
9960 << std::dec
<< dendl
;
9961 logger
->inc(l_bluestore_compress_rejected_count
);
9963 logger
->tinc(l_bluestore_compress_lat
,
9964 ceph_clock_now() - start
);
9966 if (!compressed
&& wi
.new_blob
) {
9967 // initialize newly created blob only
9968 assert(dblob
.is_mutable());
9969 if (l
->length() != wi
.blob_length
) {
9970 // hrm, maybe we could do better here, but let's not bother.
9971 dout(20) << __func__
<< " forcing csum_order to block_size_order "
9972 << block_size_order
<< dendl
;
9973 csum_order
= block_size_order
;
9975 csum_order
= std::min(wctx
->csum_order
, ctz(l
->length()));
9977 // try to align blob with max_blob_size to improve
9978 // its reuse ratio, e.g. in case of reverse write
9979 uint32_t suggested_boff
=
9980 (wi
.logical_offset
- (wi
.b_off0
- wi
.b_off
)) % max_bsize
;
9981 if ((suggested_boff
% (1 << csum_order
)) == 0 &&
9982 suggested_boff
+ final_length
<= max_bsize
&&
9983 suggested_boff
> b_off
) {
9984 dout(20) << __func__
<< " forcing blob_offset to "
9985 << std::hex
<< suggested_boff
<< std::dec
<< dendl
;
9986 assert(suggested_boff
>= b_off
);
9987 csum_length
+= suggested_boff
- b_off
;
9988 b_off
= suggested_boff
;
9992 AllocExtentVector extents
;
9993 extents
.reserve(4); // 4 should be (more than) enough for most allocations
9994 int64_t got
= alloc
->allocate(final_length
, min_alloc_size
,
9995 max_alloc_size
.load(),
9997 assert(got
== (int64_t)final_length
);
9999 txc
->statfs_delta
.allocated() += got
;
10000 for (auto& p
: extents
) {
10001 bluestore_pextent_t e
= bluestore_pextent_t(p
);
10002 txc
->allocated
.insert(e
.offset
, e
.length
);
10005 dblob
.allocated(P2ALIGN(b_off
, min_alloc_size
), final_length
, extents
);
10007 dout(20) << __func__
<< " blob " << *b
10008 << " csum_type " << Checksummer::get_csum_type_string(csum
)
10009 << " csum_order " << csum_order
10010 << " csum_length 0x" << std::hex
<< csum_length
<< std::dec
10013 if (csum
!= Checksummer::CSUM_NONE
) {
10014 if (!dblob
.has_csum()) {
10015 dblob
.init_csum(csum
, csum_order
, csum_length
);
10017 dblob
.calc_csum(b_off
, *l
);
10019 if (wi
.mark_unused
) {
10020 auto b_end
= b_off
+ wi
.bl
.length();
10022 dblob
.add_unused(0, b_off
);
10024 if (b_end
< wi
.blob_length
) {
10025 dblob
.add_unused(b_end
, wi
.blob_length
- b_end
);
10029 Extent
*le
= o
->extent_map
.set_lextent(coll
, wi
.logical_offset
,
10030 b_off
+ (wi
.b_off0
- wi
.b_off
),
10034 wi
.b
->dirty_blob().mark_used(le
->blob_offset
, le
->length
);
10035 txc
->statfs_delta
.stored() += le
->length
;
10036 dout(20) << __func__
<< " lex " << *le
<< dendl
;
10037 _buffer_cache_write(txc
, wi
.b
, b_off
, wi
.bl
,
10038 wctx
->buffered
? 0 : Buffer::FLAG_NOCACHE
);
10041 if (!g_conf
->bluestore_debug_omit_block_device_write
) {
10042 if (l
->length() <= prefer_deferred_size
.load()) {
10043 dout(20) << __func__
<< " deferring small 0x" << std::hex
10044 << l
->length() << std::dec
<< " write via deferred" << dendl
;
10045 bluestore_deferred_op_t
*op
= _get_deferred_op(txc
, o
);
10046 op
->op
= bluestore_deferred_op_t::OP_WRITE
;
10047 int r
= b
->get_blob().map(
10048 b_off
, l
->length(),
10049 [&](uint64_t offset
, uint64_t length
) {
10050 op
->extents
.emplace_back(bluestore_pextent_t(offset
, length
));
10056 b
->get_blob().map_bl(
10058 [&](uint64_t offset
, bufferlist
& t
) {
10059 bdev
->aio_write(offset
, t
, &txc
->ioc
, false);
10065 alloc
->unreserve(need
);
10070 void BlueStore::_wctx_finish(
10074 WriteContext
*wctx
,
10075 set
<SharedBlob
*> *maybe_unshared_blobs
)
10077 auto oep
= wctx
->old_extents
.begin();
10078 while (oep
!= wctx
->old_extents
.end()) {
10080 oep
= wctx
->old_extents
.erase(oep
);
10081 dout(20) << __func__
<< " lex_old " << lo
.e
<< dendl
;
10082 BlobRef b
= lo
.e
.blob
;
10083 const bluestore_blob_t
& blob
= b
->get_blob();
10084 if (blob
.is_compressed()) {
10085 if (lo
.blob_empty
) {
10086 txc
->statfs_delta
.compressed() -= blob
.get_compressed_payload_length();
10088 txc
->statfs_delta
.compressed_original() -= lo
.e
.length
;
10091 txc
->statfs_delta
.stored() -= lo
.e
.length
;
10093 dout(20) << __func__
<< " blob release " << r
<< dendl
;
10094 if (blob
.is_shared()) {
10095 PExtentVector final
;
10096 c
->load_shared_blob(b
->shared_blob
);
10098 b
->shared_blob
->put_ref(
10099 e
.offset
, e
.length
, &final
,
10100 b
->is_referenced() ? nullptr : maybe_unshared_blobs
);
10102 dout(20) << __func__
<< " shared_blob release " << final
10103 << " from " << *b
->shared_blob
<< dendl
;
10104 txc
->write_shared_blob(b
->shared_blob
);
10109 // we can't invalidate our logical extents as we drop them because
10110 // other lextents (either in our onode or others) may still
10111 // reference them. but we can throw out anything that is no
10112 // longer allocated. Note that this will leave behind edge bits
10113 // that are no longer referenced but not deallocated (until they
10114 // age out of the cache naturally).
10115 b
->discard_unallocated(c
.get());
10117 dout(20) << __func__
<< " release " << e
<< dendl
;
10118 txc
->released
.insert(e
.offset
, e
.length
);
10119 txc
->statfs_delta
.allocated() -= e
.length
;
10120 if (blob
.is_compressed()) {
10121 txc
->statfs_delta
.compressed_allocated() -= e
.length
;
10125 if (b
->is_spanning() && !b
->is_referenced()) {
10126 dout(20) << __func__
<< " spanning_blob_map removing empty " << *b
10128 o
->extent_map
.spanning_blob_map
.erase(b
->id
);
10133 void BlueStore::_do_write_data(
10140 WriteContext
*wctx
)
10142 uint64_t end
= offset
+ length
;
10143 bufferlist::iterator p
= bl
.begin();
10145 if (offset
/ min_alloc_size
== (end
- 1) / min_alloc_size
&&
10146 (length
!= min_alloc_size
)) {
10147 // we fall within the same block
10148 _do_write_small(txc
, c
, o
, offset
, length
, p
, wctx
);
10150 uint64_t head_offset
, head_length
;
10151 uint64_t middle_offset
, middle_length
;
10152 uint64_t tail_offset
, tail_length
;
10154 head_offset
= offset
;
10155 head_length
= P2NPHASE(offset
, min_alloc_size
);
10157 tail_offset
= P2ALIGN(end
, min_alloc_size
);
10158 tail_length
= P2PHASE(end
, min_alloc_size
);
10160 middle_offset
= head_offset
+ head_length
;
10161 middle_length
= length
- head_length
- tail_length
;
10164 _do_write_small(txc
, c
, o
, head_offset
, head_length
, p
, wctx
);
10167 if (middle_length
) {
10168 _do_write_big(txc
, c
, o
, middle_offset
, middle_length
, p
, wctx
);
10172 _do_write_small(txc
, c
, o
, tail_offset
, tail_length
, p
, wctx
);
10177 void BlueStore::_choose_write_options(
10180 uint32_t fadvise_flags
,
10181 WriteContext
*wctx
)
10183 if (fadvise_flags
& CEPH_OSD_OP_FLAG_FADVISE_WILLNEED
) {
10184 dout(20) << __func__
<< " will do buffered write" << dendl
;
10185 wctx
->buffered
= true;
10186 } else if (cct
->_conf
->bluestore_default_buffered_write
&&
10187 (fadvise_flags
& (CEPH_OSD_OP_FLAG_FADVISE_DONTNEED
|
10188 CEPH_OSD_OP_FLAG_FADVISE_NOCACHE
)) == 0) {
10189 dout(20) << __func__
<< " defaulting to buffered write" << dendl
;
10190 wctx
->buffered
= true;
10193 // apply basic csum block size
10194 wctx
->csum_order
= block_size_order
;
10196 // compression parameters
10197 unsigned alloc_hints
= o
->onode
.alloc_hint_flags
;
10198 auto cm
= select_option(
10199 "compression_mode",
10203 if(c
->pool_opts
.get(pool_opts_t::COMPRESSION_MODE
, &val
)) {
10204 return boost::optional
<Compressor::CompressionMode
>(
10205 Compressor::get_comp_mode_type(val
));
10207 return boost::optional
<Compressor::CompressionMode
>();
10211 wctx
->compress
= (cm
!= Compressor::COMP_NONE
) &&
10212 ((cm
== Compressor::COMP_FORCE
) ||
10213 (cm
== Compressor::COMP_AGGRESSIVE
&&
10214 (alloc_hints
& CEPH_OSD_ALLOC_HINT_FLAG_INCOMPRESSIBLE
) == 0) ||
10215 (cm
== Compressor::COMP_PASSIVE
&&
10216 (alloc_hints
& CEPH_OSD_ALLOC_HINT_FLAG_COMPRESSIBLE
)));
10218 if ((alloc_hints
& CEPH_OSD_ALLOC_HINT_FLAG_SEQUENTIAL_READ
) &&
10219 (alloc_hints
& CEPH_OSD_ALLOC_HINT_FLAG_RANDOM_READ
) == 0 &&
10220 (alloc_hints
& (CEPH_OSD_ALLOC_HINT_FLAG_IMMUTABLE
|
10221 CEPH_OSD_ALLOC_HINT_FLAG_APPEND_ONLY
)) &&
10222 (alloc_hints
& CEPH_OSD_ALLOC_HINT_FLAG_RANDOM_WRITE
) == 0) {
10224 dout(20) << __func__
<< " will prefer large blob and csum sizes" << dendl
;
10226 if (o
->onode
.expected_write_size
) {
10227 wctx
->csum_order
= std::max(min_alloc_size_order
,
10228 (uint8_t)ctz(o
->onode
.expected_write_size
));
10230 wctx
->csum_order
= min_alloc_size_order
;
10233 if (wctx
->compress
) {
10234 wctx
->target_blob_size
= select_option(
10235 "compression_max_blob_size",
10236 comp_max_blob_size
.load(),
10239 if(c
->pool_opts
.get(pool_opts_t::COMPRESSION_MAX_BLOB_SIZE
, &val
)) {
10240 return boost::optional
<uint64_t>((uint64_t)val
);
10242 return boost::optional
<uint64_t>();
10247 if (wctx
->compress
) {
10248 wctx
->target_blob_size
= select_option(
10249 "compression_min_blob_size",
10250 comp_min_blob_size
.load(),
10253 if(c
->pool_opts
.get(pool_opts_t::COMPRESSION_MIN_BLOB_SIZE
, &val
)) {
10254 return boost::optional
<uint64_t>((uint64_t)val
);
10256 return boost::optional
<uint64_t>();
10262 uint64_t max_bsize
= max_blob_size
.load();
10263 if (wctx
->target_blob_size
== 0 || wctx
->target_blob_size
> max_bsize
) {
10264 wctx
->target_blob_size
= max_bsize
;
10267 // set the min blob size floor at 2x the min_alloc_size, or else we
10268 // won't be able to allocate a smaller extent for the compressed
10270 if (wctx
->compress
&&
10271 wctx
->target_blob_size
< min_alloc_size
* 2) {
10272 wctx
->target_blob_size
= min_alloc_size
* 2;
10275 dout(20) << __func__
<< " prefer csum_order " << wctx
->csum_order
10276 << " target_blob_size 0x" << std::hex
<< wctx
->target_blob_size
10277 << std::dec
<< dendl
;
10280 int BlueStore::_do_gc(
10284 const GarbageCollector
& gc
,
10285 const WriteContext
& wctx
,
10286 uint64_t *dirty_start
,
10287 uint64_t *dirty_end
)
10289 auto& extents_to_collect
= gc
.get_extents_to_collect();
10291 WriteContext wctx_gc
;
10292 wctx_gc
.fork(wctx
); // make a clone for garbage collection
10294 for (auto it
= extents_to_collect
.begin();
10295 it
!= extents_to_collect
.end();
10298 int r
= _do_read(c
.get(), o
, it
->offset
, it
->length
, bl
, 0);
10299 assert(r
== (int)it
->length
);
10301 o
->extent_map
.fault_range(db
, it
->offset
, it
->length
);
10302 _do_write_data(txc
, c
, o
, it
->offset
, it
->length
, bl
, &wctx_gc
);
10303 logger
->inc(l_bluestore_gc_merged
, it
->length
);
10305 if (*dirty_start
> it
->offset
) {
10306 *dirty_start
= it
->offset
;
10309 if (*dirty_end
< it
->offset
+ it
->length
) {
10310 *dirty_end
= it
->offset
+ it
->length
;
10314 dout(30) << __func__
<< " alloc write" << dendl
;
10315 int r
= _do_alloc_write(txc
, c
, o
, &wctx_gc
);
10317 derr
<< __func__
<< " _do_alloc_write failed with " << cpp_strerror(r
)
10322 _wctx_finish(txc
, c
, o
, &wctx_gc
);
10326 int BlueStore::_do_write(
10333 uint32_t fadvise_flags
)
10337 dout(20) << __func__
10339 << " 0x" << std::hex
<< offset
<< "~" << length
10340 << " - have 0x" << o
->onode
.size
10341 << " (" << std::dec
<< o
->onode
.size
<< ")"
10343 << " fadvise_flags 0x" << std::hex
<< fadvise_flags
<< std::dec
10351 uint64_t end
= offset
+ length
;
10353 GarbageCollector
gc(c
->store
->cct
);
10355 auto dirty_start
= offset
;
10356 auto dirty_end
= end
;
10359 _choose_write_options(c
, o
, fadvise_flags
, &wctx
);
10360 o
->extent_map
.fault_range(db
, offset
, length
);
10361 _do_write_data(txc
, c
, o
, offset
, length
, bl
, &wctx
);
10362 r
= _do_alloc_write(txc
, c
, o
, &wctx
);
10364 derr
<< __func__
<< " _do_alloc_write failed with " << cpp_strerror(r
)
10369 // NB: _wctx_finish() will empty old_extents
10370 // so we must do gc estimation before that
10371 benefit
= gc
.estimate(offset
,
10377 _wctx_finish(txc
, c
, o
, &wctx
);
10378 if (end
> o
->onode
.size
) {
10379 dout(20) << __func__
<< " extending size to 0x" << std::hex
<< end
10380 << std::dec
<< dendl
;
10381 o
->onode
.size
= end
;
10384 if (benefit
>= g_conf
->bluestore_gc_enable_total_threshold
) {
10385 if (!gc
.get_extents_to_collect().empty()) {
10386 dout(20) << __func__
<< " perform garbage collection, "
10387 << "expected benefit = " << benefit
<< " AUs" << dendl
;
10388 r
= _do_gc(txc
, c
, o
, gc
, wctx
, &dirty_start
, &dirty_end
);
10390 derr
<< __func__
<< " _do_gc failed with " << cpp_strerror(r
)
10397 o
->extent_map
.compress_extent_map(dirty_start
, dirty_end
- dirty_start
);
10398 o
->extent_map
.dirty_range(dirty_start
, dirty_end
- dirty_start
);
10406 int BlueStore::_write(TransContext
*txc
,
10409 uint64_t offset
, size_t length
,
10411 uint32_t fadvise_flags
)
10413 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10414 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10417 if (offset
+ length
>= OBJECT_MAX_SIZE
) {
10420 _assign_nid(txc
, o
);
10421 r
= _do_write(txc
, c
, o
, offset
, length
, bl
, fadvise_flags
);
10422 txc
->write_onode(o
);
10424 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10425 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10426 << " = " << r
<< dendl
;
10430 int BlueStore::_zero(TransContext
*txc
,
10433 uint64_t offset
, size_t length
)
10435 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10436 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10439 if (offset
+ length
>= OBJECT_MAX_SIZE
) {
10442 _assign_nid(txc
, o
);
10443 r
= _do_zero(txc
, c
, o
, offset
, length
);
10445 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10446 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10447 << " = " << r
<< dendl
;
10451 int BlueStore::_do_zero(TransContext
*txc
,
10454 uint64_t offset
, size_t length
)
10456 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10457 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10464 o
->extent_map
.fault_range(db
, offset
, length
);
10465 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
.old_extents
);
10466 o
->extent_map
.dirty_range(offset
, length
);
10467 _wctx_finish(txc
, c
, o
, &wctx
);
10469 if (offset
+ length
> o
->onode
.size
) {
10470 o
->onode
.size
= offset
+ length
;
10471 dout(20) << __func__
<< " extending size to " << offset
+ length
10474 txc
->write_onode(o
);
10476 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10477 << " 0x" << std::hex
<< offset
<< "~" << length
<< std::dec
10478 << " = " << r
<< dendl
;
10482 void BlueStore::_do_truncate(
10483 TransContext
*txc
, CollectionRef
& c
, OnodeRef o
, uint64_t offset
,
10484 set
<SharedBlob
*> *maybe_unshared_blobs
)
10486 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10487 << " 0x" << std::hex
<< offset
<< std::dec
<< dendl
;
10489 _dump_onode(o
, 30);
10491 if (offset
== o
->onode
.size
)
10494 if (offset
< o
->onode
.size
) {
10496 uint64_t length
= o
->onode
.size
- offset
;
10497 o
->extent_map
.fault_range(db
, offset
, length
);
10498 o
->extent_map
.punch_hole(c
, offset
, length
, &wctx
.old_extents
);
10499 o
->extent_map
.dirty_range(offset
, length
);
10500 _wctx_finish(txc
, c
, o
, &wctx
, maybe_unshared_blobs
);
10502 // if we have shards past EOF, ask for a reshard
10503 if (!o
->onode
.extent_map_shards
.empty() &&
10504 o
->onode
.extent_map_shards
.back().offset
>= offset
) {
10505 dout(10) << __func__
<< " request reshard past EOF" << dendl
;
10507 o
->extent_map
.request_reshard(offset
- 1, offset
+ length
);
10509 o
->extent_map
.request_reshard(0, length
);
10514 o
->onode
.size
= offset
;
10516 txc
->write_onode(o
);
10519 int BlueStore::_truncate(TransContext
*txc
,
10524 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10525 << " 0x" << std::hex
<< offset
<< std::dec
10528 if (offset
>= OBJECT_MAX_SIZE
) {
10531 _do_truncate(txc
, c
, o
, offset
);
10533 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10534 << " 0x" << std::hex
<< offset
<< std::dec
10535 << " = " << r
<< dendl
;
10539 int BlueStore::_do_remove(
10544 set
<SharedBlob
*> maybe_unshared_blobs
;
10545 bool is_gen
= !o
->oid
.is_no_gen();
10546 _do_truncate(txc
, c
, o
, 0, is_gen
? &maybe_unshared_blobs
: nullptr);
10547 if (o
->onode
.has_omap()) {
10549 _do_omap_clear(txc
, o
->onode
.nid
);
10553 for (auto &s
: o
->extent_map
.shards
) {
10554 dout(20) << __func__
<< " removing shard 0x" << std::hex
10555 << s
.shard_info
->offset
<< std::dec
<< dendl
;
10556 generate_extent_shard_key_and_apply(o
->key
, s
.shard_info
->offset
, &key
,
10557 [&](const string
& final_key
) {
10558 txc
->t
->rmkey(PREFIX_OBJ
, final_key
);
10562 txc
->t
->rmkey(PREFIX_OBJ
, o
->key
.c_str(), o
->key
.size());
10564 o
->extent_map
.clear();
10565 o
->onode
= bluestore_onode_t();
10566 _debug_obj_on_delete(o
->oid
);
10568 if (!is_gen
|| maybe_unshared_blobs
.empty()) {
10572 // see if we can unshare blobs still referenced by the head
10573 dout(10) << __func__
<< " gen and maybe_unshared_blobs "
10574 << maybe_unshared_blobs
<< dendl
;
10575 ghobject_t nogen
= o
->oid
;
10576 nogen
.generation
= ghobject_t::NO_GEN
;
10577 OnodeRef h
= c
->onode_map
.lookup(nogen
);
10579 if (!h
|| !h
->exists
) {
10583 dout(20) << __func__
<< " checking for unshareable blobs on " << h
10584 << " " << h
->oid
<< dendl
;
10585 map
<SharedBlob
*,bluestore_extent_ref_map_t
> expect
;
10586 for (auto& e
: h
->extent_map
.extent_map
) {
10587 const bluestore_blob_t
& b
= e
.blob
->get_blob();
10588 SharedBlob
*sb
= e
.blob
->shared_blob
.get();
10589 if (b
.is_shared() &&
10591 maybe_unshared_blobs
.count(sb
)) {
10592 b
.map(e
.blob_offset
, e
.length
, [&](uint64_t off
, uint64_t len
) {
10593 expect
[sb
].get(off
, len
);
10599 vector
<SharedBlob
*> unshared_blobs
;
10600 unshared_blobs
.reserve(maybe_unshared_blobs
.size());
10601 for (auto& p
: expect
) {
10602 dout(20) << " ? " << *p
.first
<< " vs " << p
.second
<< dendl
;
10603 if (p
.first
->persistent
->ref_map
== p
.second
) {
10604 SharedBlob
*sb
= p
.first
;
10605 dout(20) << __func__
<< " unsharing " << *sb
<< dendl
;
10606 unshared_blobs
.push_back(sb
);
10607 txc
->unshare_blob(sb
);
10608 uint64_t sbid
= c
->make_blob_unshared(sb
);
10610 get_shared_blob_key(sbid
, &key
);
10611 txc
->t
->rmkey(PREFIX_SHARED_BLOB
, key
);
10615 if (unshared_blobs
.empty()) {
10619 for (auto& e
: h
->extent_map
.extent_map
) {
10620 const bluestore_blob_t
& b
= e
.blob
->get_blob();
10621 SharedBlob
*sb
= e
.blob
->shared_blob
.get();
10622 if (b
.is_shared() &&
10623 std::find(unshared_blobs
.begin(), unshared_blobs
.end(),
10624 sb
) != unshared_blobs
.end()) {
10625 dout(20) << __func__
<< " unsharing " << e
<< dendl
;
10626 bluestore_blob_t
& blob
= e
.blob
->dirty_blob();
10627 blob
.clear_flag(bluestore_blob_t::FLAG_SHARED
);
10628 h
->extent_map
.dirty_range(e
.logical_offset
, 1);
10631 txc
->write_onode(h
);
10636 int BlueStore::_remove(TransContext
*txc
,
10640 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10641 int r
= _do_remove(txc
, c
, o
);
10642 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10646 int BlueStore::_setattr(TransContext
*txc
,
10649 const string
& name
,
10652 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10653 << " " << name
<< " (" << val
.length() << " bytes)"
10656 if (val
.is_partial())
10657 o
->onode
.attrs
[name
.c_str()] = bufferptr(val
.c_str(), val
.length());
10659 o
->onode
.attrs
[name
.c_str()] = val
;
10660 txc
->write_onode(o
);
10661 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10662 << " " << name
<< " (" << val
.length() << " bytes)"
10663 << " = " << r
<< dendl
;
10667 int BlueStore::_setattrs(TransContext
*txc
,
10670 const map
<string
,bufferptr
>& aset
)
10672 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10673 << " " << aset
.size() << " keys"
10676 for (map
<string
,bufferptr
>::const_iterator p
= aset
.begin();
10677 p
!= aset
.end(); ++p
) {
10678 if (p
->second
.is_partial())
10679 o
->onode
.attrs
[p
->first
.c_str()] =
10680 bufferptr(p
->second
.c_str(), p
->second
.length());
10682 o
->onode
.attrs
[p
->first
.c_str()] = p
->second
;
10684 txc
->write_onode(o
);
10685 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10686 << " " << aset
.size() << " keys"
10687 << " = " << r
<< dendl
;
10692 int BlueStore::_rmattr(TransContext
*txc
,
10695 const string
& name
)
10697 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10698 << " " << name
<< dendl
;
10700 auto it
= o
->onode
.attrs
.find(name
.c_str());
10701 if (it
== o
->onode
.attrs
.end())
10704 o
->onode
.attrs
.erase(it
);
10705 txc
->write_onode(o
);
10708 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10709 << " " << name
<< " = " << r
<< dendl
;
10713 int BlueStore::_rmattrs(TransContext
*txc
,
10717 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10720 if (o
->onode
.attrs
.empty())
10723 o
->onode
.attrs
.clear();
10724 txc
->write_onode(o
);
10727 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10731 void BlueStore::_do_omap_clear(TransContext
*txc
, uint64_t id
)
10733 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_OMAP
);
10734 string prefix
, tail
;
10735 get_omap_header(id
, &prefix
);
10736 get_omap_tail(id
, &tail
);
10737 it
->lower_bound(prefix
);
10738 while (it
->valid()) {
10739 if (it
->key() >= tail
) {
10740 dout(30) << __func__
<< " stop at " << pretty_binary_string(tail
)
10744 txc
->t
->rmkey(PREFIX_OMAP
, it
->key());
10745 dout(30) << __func__
<< " rm " << pretty_binary_string(it
->key()) << dendl
;
10750 int BlueStore::_omap_clear(TransContext
*txc
,
10754 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10756 if (o
->onode
.has_omap()) {
10758 _do_omap_clear(txc
, o
->onode
.nid
);
10759 o
->onode
.clear_omap_flag();
10760 txc
->write_onode(o
);
10762 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10766 int BlueStore::_omap_setkeys(TransContext
*txc
,
10771 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10773 bufferlist::iterator p
= bl
.begin();
10775 if (!o
->onode
.has_omap()) {
10776 o
->onode
.set_omap_flag();
10777 txc
->write_onode(o
);
10779 txc
->note_modified_object(o
);
10782 _key_encode_u64(o
->onode
.nid
, &final_key
);
10783 final_key
.push_back('.');
10789 ::decode(value
, p
);
10790 final_key
.resize(9); // keep prefix
10792 dout(30) << __func__
<< " " << pretty_binary_string(final_key
)
10793 << " <- " << key
<< dendl
;
10794 txc
->t
->set(PREFIX_OMAP
, final_key
, value
);
10797 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10801 int BlueStore::_omap_setheader(TransContext
*txc
,
10806 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10809 if (!o
->onode
.has_omap()) {
10810 o
->onode
.set_omap_flag();
10811 txc
->write_onode(o
);
10813 txc
->note_modified_object(o
);
10815 get_omap_header(o
->onode
.nid
, &key
);
10816 txc
->t
->set(PREFIX_OMAP
, key
, bl
);
10818 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10822 int BlueStore::_omap_rmkeys(TransContext
*txc
,
10827 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10829 bufferlist::iterator p
= bl
.begin();
10833 if (!o
->onode
.has_omap()) {
10836 _key_encode_u64(o
->onode
.nid
, &final_key
);
10837 final_key
.push_back('.');
10842 final_key
.resize(9); // keep prefix
10844 dout(30) << __func__
<< " rm " << pretty_binary_string(final_key
)
10845 << " <- " << key
<< dendl
;
10846 txc
->t
->rmkey(PREFIX_OMAP
, final_key
);
10848 txc
->note_modified_object(o
);
10851 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10855 int BlueStore::_omap_rmkey_range(TransContext
*txc
,
10858 const string
& first
, const string
& last
)
10860 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< dendl
;
10861 KeyValueDB::Iterator it
;
10862 string key_first
, key_last
;
10864 if (!o
->onode
.has_omap()) {
10868 it
= db
->get_iterator(PREFIX_OMAP
);
10869 get_omap_key(o
->onode
.nid
, first
, &key_first
);
10870 get_omap_key(o
->onode
.nid
, last
, &key_last
);
10871 it
->lower_bound(key_first
);
10872 while (it
->valid()) {
10873 if (it
->key() >= key_last
) {
10874 dout(30) << __func__
<< " stop at " << pretty_binary_string(key_last
)
10878 txc
->t
->rmkey(PREFIX_OMAP
, it
->key());
10879 dout(30) << __func__
<< " rm " << pretty_binary_string(it
->key()) << dendl
;
10882 txc
->note_modified_object(o
);
10885 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
<< " = " << r
<< dendl
;
10889 int BlueStore::_set_alloc_hint(
10893 uint64_t expected_object_size
,
10894 uint64_t expected_write_size
,
10897 dout(15) << __func__
<< " " << c
->cid
<< " " << o
->oid
10898 << " object_size " << expected_object_size
10899 << " write_size " << expected_write_size
10900 << " flags " << ceph_osd_alloc_hint_flag_string(flags
)
10903 o
->onode
.expected_object_size
= expected_object_size
;
10904 o
->onode
.expected_write_size
= expected_write_size
;
10905 o
->onode
.alloc_hint_flags
= flags
;
10906 txc
->write_onode(o
);
10907 dout(10) << __func__
<< " " << c
->cid
<< " " << o
->oid
10908 << " object_size " << expected_object_size
10909 << " write_size " << expected_write_size
10910 << " flags " << ceph_osd_alloc_hint_flag_string(flags
)
10911 << " = " << r
<< dendl
;
10915 int BlueStore::_clone(TransContext
*txc
,
10920 dout(15) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
10921 << newo
->oid
<< dendl
;
10923 if (oldo
->oid
.hobj
.get_hash() != newo
->oid
.hobj
.get_hash()) {
10924 derr
<< __func__
<< " mismatched hash on " << oldo
->oid
10925 << " and " << newo
->oid
<< dendl
;
10929 _assign_nid(txc
, newo
);
10933 _do_truncate(txc
, c
, newo
, 0);
10934 if (cct
->_conf
->bluestore_clone_cow
) {
10935 _do_clone_range(txc
, c
, oldo
, newo
, 0, oldo
->onode
.size
, 0);
10938 r
= _do_read(c
.get(), oldo
, 0, oldo
->onode
.size
, bl
, 0);
10941 r
= _do_write(txc
, c
, newo
, 0, oldo
->onode
.size
, bl
, 0);
10947 newo
->onode
.attrs
= oldo
->onode
.attrs
;
10950 if (newo
->onode
.has_omap()) {
10951 dout(20) << __func__
<< " clearing old omap data" << dendl
;
10953 _do_omap_clear(txc
, newo
->onode
.nid
);
10955 if (oldo
->onode
.has_omap()) {
10956 dout(20) << __func__
<< " copying omap data" << dendl
;
10957 if (!newo
->onode
.has_omap()) {
10958 newo
->onode
.set_omap_flag();
10960 KeyValueDB::Iterator it
= db
->get_iterator(PREFIX_OMAP
);
10962 get_omap_header(oldo
->onode
.nid
, &head
);
10963 get_omap_tail(oldo
->onode
.nid
, &tail
);
10964 it
->lower_bound(head
);
10965 while (it
->valid()) {
10966 if (it
->key() >= tail
) {
10967 dout(30) << __func__
<< " reached tail" << dendl
;
10970 dout(30) << __func__
<< " got header/data "
10971 << pretty_binary_string(it
->key()) << dendl
;
10973 rewrite_omap_key(newo
->onode
.nid
, it
->key(), &key
);
10974 txc
->t
->set(PREFIX_OMAP
, key
, it
->value());
10979 newo
->onode
.clear_omap_flag();
10982 txc
->write_onode(newo
);
10986 dout(10) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
10987 << newo
->oid
<< " = " << r
<< dendl
;
10991 int BlueStore::_do_clone_range(
11000 dout(15) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
11002 << " 0x" << std::hex
<< srcoff
<< "~" << length
<< " -> "
11003 << " 0x" << dstoff
<< "~" << length
<< std::dec
<< dendl
;
11004 oldo
->extent_map
.fault_range(db
, srcoff
, length
);
11005 newo
->extent_map
.fault_range(db
, dstoff
, length
);
11009 // hmm, this could go into an ExtentMap::dup() method.
11010 vector
<BlobRef
> id_to_blob(oldo
->extent_map
.extent_map
.size());
11011 for (auto &e
: oldo
->extent_map
.extent_map
) {
11012 e
.blob
->last_encoded_id
= -1;
11015 uint64_t end
= srcoff
+ length
;
11016 uint32_t dirty_range_begin
= 0;
11017 uint32_t dirty_range_end
= 0;
11018 bool src_dirty
= false;
11019 for (auto ep
= oldo
->extent_map
.seek_lextent(srcoff
);
11020 ep
!= oldo
->extent_map
.extent_map
.end();
11023 if (e
.logical_offset
>= end
) {
11026 dout(20) << __func__
<< " src " << e
<< dendl
;
11028 bool blob_duped
= true;
11029 if (e
.blob
->last_encoded_id
>= 0) {
11030 // blob is already duped
11031 cb
= id_to_blob
[e
.blob
->last_encoded_id
];
11032 blob_duped
= false;
11035 const bluestore_blob_t
& blob
= e
.blob
->get_blob();
11036 // make sure it is shared
11037 if (!blob
.is_shared()) {
11038 c
->make_blob_shared(_assign_blobid(txc
), e
.blob
);
11041 dirty_range_begin
= e
.logical_offset
;
11043 assert(e
.logical_end() > 0);
11044 // -1 to exclude next potential shard
11045 dirty_range_end
= e
.logical_end() - 1;
11047 c
->load_shared_blob(e
.blob
->shared_blob
);
11050 e
.blob
->last_encoded_id
= n
;
11051 id_to_blob
[n
] = cb
;
11053 // bump the extent refs on the copied blob's extents
11054 for (auto p
: blob
.get_extents()) {
11055 if (p
.is_valid()) {
11056 e
.blob
->shared_blob
->get_ref(p
.offset
, p
.length
);
11059 txc
->write_shared_blob(e
.blob
->shared_blob
);
11060 dout(20) << __func__
<< " new " << *cb
<< dendl
;
11063 int skip_front
, skip_back
;
11064 if (e
.logical_offset
< srcoff
) {
11065 skip_front
= srcoff
- e
.logical_offset
;
11069 if (e
.logical_end() > end
) {
11070 skip_back
= e
.logical_end() - end
;
11074 Extent
*ne
= new Extent(e
.logical_offset
+ skip_front
+ dstoff
- srcoff
,
11075 e
.blob_offset
+ skip_front
,
11076 e
.length
- skip_front
- skip_back
, cb
);
11077 newo
->extent_map
.extent_map
.insert(*ne
);
11078 ne
->blob
->get_ref(c
.get(), ne
->blob_offset
, ne
->length
);
11079 // fixme: we may leave parts of new blob unreferenced that could
11080 // be freed (relative to the shared_blob).
11081 txc
->statfs_delta
.stored() += ne
->length
;
11082 if (e
.blob
->get_blob().is_compressed()) {
11083 txc
->statfs_delta
.compressed_original() += ne
->length
;
11085 txc
->statfs_delta
.compressed() +=
11086 cb
->get_blob().get_compressed_payload_length();
11089 dout(20) << __func__
<< " dst " << *ne
<< dendl
;
11093 oldo
->extent_map
.dirty_range(dirty_range_begin
,
11094 dirty_range_end
- dirty_range_begin
);
11095 txc
->write_onode(oldo
);
11097 txc
->write_onode(newo
);
11099 if (dstoff
+ length
> newo
->onode
.size
) {
11100 newo
->onode
.size
= dstoff
+ length
;
11102 newo
->extent_map
.dirty_range(dstoff
, length
);
11108 int BlueStore::_clone_range(TransContext
*txc
,
11112 uint64_t srcoff
, uint64_t length
, uint64_t dstoff
)
11114 dout(15) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
11115 << newo
->oid
<< " from 0x" << std::hex
<< srcoff
<< "~" << length
11116 << " to offset 0x" << dstoff
<< std::dec
<< dendl
;
11119 if (srcoff
+ length
>= OBJECT_MAX_SIZE
||
11120 dstoff
+ length
>= OBJECT_MAX_SIZE
) {
11124 if (srcoff
+ length
> oldo
->onode
.size
) {
11129 _assign_nid(txc
, newo
);
11132 if (cct
->_conf
->bluestore_clone_cow
) {
11133 _do_zero(txc
, c
, newo
, dstoff
, length
);
11134 _do_clone_range(txc
, c
, oldo
, newo
, srcoff
, length
, dstoff
);
11137 r
= _do_read(c
.get(), oldo
, srcoff
, length
, bl
, 0);
11140 r
= _do_write(txc
, c
, newo
, dstoff
, bl
.length(), bl
, 0);
11146 txc
->write_onode(newo
);
11150 dout(10) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
11151 << newo
->oid
<< " from 0x" << std::hex
<< srcoff
<< "~" << length
11152 << " to offset 0x" << dstoff
<< std::dec
11153 << " = " << r
<< dendl
;
11157 int BlueStore::_rename(TransContext
*txc
,
11161 const ghobject_t
& new_oid
)
11163 dout(15) << __func__
<< " " << c
->cid
<< " " << oldo
->oid
<< " -> "
11164 << new_oid
<< dendl
;
11166 ghobject_t old_oid
= oldo
->oid
;
11167 mempool::bluestore_cache_other::string new_okey
;
11170 if (newo
->exists
) {
11174 assert(txc
->onodes
.count(newo
) == 0);
11177 txc
->t
->rmkey(PREFIX_OBJ
, oldo
->key
.c_str(), oldo
->key
.size());
11181 oldo
->extent_map
.fault_range(db
, 0, oldo
->onode
.size
);
11182 get_object_key(cct
, new_oid
, &new_okey
);
11184 for (auto &s
: oldo
->extent_map
.shards
) {
11185 generate_extent_shard_key_and_apply(oldo
->key
, s
.shard_info
->offset
, &key
,
11186 [&](const string
& final_key
) {
11187 txc
->t
->rmkey(PREFIX_OBJ
, final_key
);
11195 txc
->write_onode(newo
);
11197 // this adjusts oldo->{oid,key}, and reset oldo to a fresh empty
11198 // Onode in the old slot
11199 c
->onode_map
.rename(oldo
, old_oid
, new_oid
, new_okey
);
11203 dout(10) << __func__
<< " " << c
->cid
<< " " << old_oid
<< " -> "
11204 << new_oid
<< " = " << r
<< dendl
;
11210 int BlueStore::_create_collection(
11216 dout(15) << __func__
<< " " << cid
<< " bits " << bits
<< dendl
;
11221 RWLock::WLocker
l(coll_lock
);
11229 cache_shards
[cid
.hash_to_shard(cache_shards
.size())],
11231 (*c
)->cnode
.bits
= bits
;
11232 coll_map
[cid
] = *c
;
11234 ::encode((*c
)->cnode
, bl
);
11235 txc
->t
->set(PREFIX_COLL
, stringify(cid
), bl
);
11239 dout(10) << __func__
<< " " << cid
<< " bits " << bits
<< " = " << r
<< dendl
;
11243 int BlueStore::_remove_collection(TransContext
*txc
, const coll_t
&cid
,
11246 dout(15) << __func__
<< " " << cid
<< dendl
;
11250 RWLock::WLocker
l(coll_lock
);
11255 size_t nonexistent_count
= 0;
11256 assert((*c
)->exists
);
11257 if ((*c
)->onode_map
.map_any([&](OnodeRef o
) {
11259 dout(10) << __func__
<< " " << o
->oid
<< " " << o
11260 << " exists in onode_map" << dendl
;
11263 ++nonexistent_count
;
11270 vector
<ghobject_t
> ls
;
11272 // Enumerate onodes in db, up to nonexistent_count + 1
11273 // then check if all of them are marked as non-existent.
11274 // Bypass the check if returned number is greater than nonexistent_count
11275 r
= _collection_list(c
->get(), ghobject_t(), ghobject_t::get_max(),
11276 nonexistent_count
+ 1, &ls
, &next
);
11278 bool exists
= false; //ls.size() > nonexistent_count;
11279 for (auto it
= ls
.begin(); !exists
&& it
< ls
.end(); ++it
) {
11280 dout(10) << __func__
<< " oid " << *it
<< dendl
;
11281 auto onode
= (*c
)->onode_map
.lookup(*it
);
11282 exists
= !onode
|| onode
->exists
;
11284 dout(10) << __func__
<< " " << *it
11285 << " exists in db" << dendl
;
11289 coll_map
.erase(cid
);
11290 txc
->removed_collections
.push_back(*c
);
11291 (*c
)->exists
= false;
11293 txc
->t
->rmkey(PREFIX_COLL
, stringify(cid
));
11296 dout(10) << __func__
<< " " << cid
11297 << " is non-empty" << dendl
;
11304 dout(10) << __func__
<< " " << cid
<< " = " << r
<< dendl
;
11308 int BlueStore::_split_collection(TransContext
*txc
,
11311 unsigned bits
, int rem
)
11313 dout(15) << __func__
<< " " << c
->cid
<< " to " << d
->cid
<< " "
11314 << " bits " << bits
<< dendl
;
11315 RWLock::WLocker
l(c
->lock
);
11316 RWLock::WLocker
l2(d
->lock
);
11319 // flush all previous deferred writes on this sequencer. this is a bit
11320 // heavyweight, but we need to make sure all deferred writes complete
11321 // before we split as the new collection's sequencer may need to order
11322 // this after those writes, and we don't bother with the complexity of
11323 // moving those TransContexts over to the new osr.
11324 _osr_drain_preceding(txc
);
11326 // move any cached items (onodes and referenced shared blobs) that will
11327 // belong to the child collection post-split. leave everything else behind.
11328 // this may include things that don't strictly belong to the now-smaller
11329 // parent split, but the OSD will always send us a split for every new
11332 spg_t pgid
, dest_pgid
;
11333 bool is_pg
= c
->cid
.is_pg(&pgid
);
11335 is_pg
= d
->cid
.is_pg(&dest_pgid
);
11338 // the destination should initially be empty.
11339 assert(d
->onode_map
.empty());
11340 assert(d
->shared_blob_set
.empty());
11341 assert(d
->cnode
.bits
== bits
);
11343 c
->split_cache(d
.get());
11345 // adjust bits. note that this will be redundant for all but the first
11346 // split call for this parent (first child).
11347 c
->cnode
.bits
= bits
;
11348 assert(d
->cnode
.bits
== bits
);
11352 ::encode(c
->cnode
, bl
);
11353 txc
->t
->set(PREFIX_COLL
, stringify(c
->cid
), bl
);
11355 dout(10) << __func__
<< " " << c
->cid
<< " to " << d
->cid
<< " "
11356 << " bits " << bits
<< " = " << r
<< dendl
;
11360 // DB key value Histogram
11361 #define KEY_SLAB 32
11362 #define VALUE_SLAB 64
11364 const string prefix_onode
= "o";
11365 const string prefix_onode_shard
= "x";
11366 const string prefix_other
= "Z";
11368 int BlueStore::DBHistogram::get_key_slab(size_t sz
)
11370 return (sz
/KEY_SLAB
);
11373 string
BlueStore::DBHistogram::get_key_slab_to_range(int slab
)
11375 int lower_bound
= slab
* KEY_SLAB
;
11376 int upper_bound
= (slab
+ 1) * KEY_SLAB
;
11377 string ret
= "[" + stringify(lower_bound
) + "," + stringify(upper_bound
) + ")";
11381 int BlueStore::DBHistogram::get_value_slab(size_t sz
)
11383 return (sz
/VALUE_SLAB
);
11386 string
BlueStore::DBHistogram::get_value_slab_to_range(int slab
)
11388 int lower_bound
= slab
* VALUE_SLAB
;
11389 int upper_bound
= (slab
+ 1) * VALUE_SLAB
;
11390 string ret
= "[" + stringify(lower_bound
) + "," + stringify(upper_bound
) + ")";
11394 void BlueStore::DBHistogram::update_hist_entry(map
<string
, map
<int, struct key_dist
> > &key_hist
,
11395 const string
&prefix
, size_t key_size
, size_t value_size
)
11397 uint32_t key_slab
= get_key_slab(key_size
);
11398 uint32_t value_slab
= get_value_slab(value_size
);
11399 key_hist
[prefix
][key_slab
].count
++;
11400 key_hist
[prefix
][key_slab
].max_len
= MAX(key_size
, key_hist
[prefix
][key_slab
].max_len
);
11401 key_hist
[prefix
][key_slab
].val_map
[value_slab
].count
++;
11402 key_hist
[prefix
][key_slab
].val_map
[value_slab
].max_len
=
11403 MAX(value_size
, key_hist
[prefix
][key_slab
].val_map
[value_slab
].max_len
);
11406 void BlueStore::DBHistogram::dump(Formatter
*f
)
11408 f
->open_object_section("rocksdb_value_distribution");
11409 for (auto i
: value_hist
) {
11410 f
->dump_unsigned(get_value_slab_to_range(i
.first
).data(), i
.second
);
11412 f
->close_section();
11414 f
->open_object_section("rocksdb_key_value_histogram");
11415 for (auto i
: key_hist
) {
11416 f
->dump_string("prefix", i
.first
);
11417 f
->open_object_section("key_hist");
11418 for ( auto k
: i
.second
) {
11419 f
->dump_unsigned(get_key_slab_to_range(k
.first
).data(), k
.second
.count
);
11420 f
->dump_unsigned("max_len", k
.second
.max_len
);
11421 f
->open_object_section("value_hist");
11422 for ( auto j
: k
.second
.val_map
) {
11423 f
->dump_unsigned(get_value_slab_to_range(j
.first
).data(), j
.second
.count
);
11424 f
->dump_unsigned("max_len", j
.second
.max_len
);
11426 f
->close_section();
11428 f
->close_section();
11430 f
->close_section();
11433 //Itrerates through the db and collects the stats
11434 void BlueStore::generate_db_histogram(Formatter
*f
)
11437 uint64_t num_onodes
= 0;
11438 uint64_t num_shards
= 0;
11439 uint64_t num_super
= 0;
11440 uint64_t num_coll
= 0;
11441 uint64_t num_omap
= 0;
11442 uint64_t num_deferred
= 0;
11443 uint64_t num_alloc
= 0;
11444 uint64_t num_stat
= 0;
11445 uint64_t num_others
= 0;
11446 uint64_t num_shared_shards
= 0;
11447 size_t max_key_size
=0, max_value_size
= 0;
11448 uint64_t total_key_size
= 0, total_value_size
= 0;
11449 size_t key_size
= 0, value_size
= 0;
11452 utime_t start
= ceph_clock_now();
11454 KeyValueDB::WholeSpaceIterator iter
= db
->get_iterator();
11455 iter
->seek_to_first();
11456 while (iter
->valid()) {
11457 dout(30) << __func__
<< " Key: " << iter
->key() << dendl
;
11458 key_size
= iter
->key_size();
11459 value_size
= iter
->value_size();
11460 hist
.value_hist
[hist
.get_value_slab(value_size
)]++;
11461 max_key_size
= MAX(max_key_size
, key_size
);
11462 max_value_size
= MAX(max_value_size
, value_size
);
11463 total_key_size
+= key_size
;
11464 total_value_size
+= value_size
;
11466 pair
<string
,string
> key(iter
->raw_key());
11468 if (key
.first
== PREFIX_SUPER
) {
11469 hist
.update_hist_entry(hist
.key_hist
, PREFIX_SUPER
, key_size
, value_size
);
11471 } else if (key
.first
== PREFIX_STAT
) {
11472 hist
.update_hist_entry(hist
.key_hist
, PREFIX_STAT
, key_size
, value_size
);
11474 } else if (key
.first
== PREFIX_COLL
) {
11475 hist
.update_hist_entry(hist
.key_hist
, PREFIX_COLL
, key_size
, value_size
);
11477 } else if (key
.first
== PREFIX_OBJ
) {
11478 if (key
.second
.back() == ONODE_KEY_SUFFIX
) {
11479 hist
.update_hist_entry(hist
.key_hist
, prefix_onode
, key_size
, value_size
);
11482 hist
.update_hist_entry(hist
.key_hist
, prefix_onode_shard
, key_size
, value_size
);
11485 } else if (key
.first
== PREFIX_OMAP
) {
11486 hist
.update_hist_entry(hist
.key_hist
, PREFIX_OMAP
, key_size
, value_size
);
11488 } else if (key
.first
== PREFIX_DEFERRED
) {
11489 hist
.update_hist_entry(hist
.key_hist
, PREFIX_DEFERRED
, key_size
, value_size
);
11491 } else if (key
.first
== PREFIX_ALLOC
|| key
.first
== "b" ) {
11492 hist
.update_hist_entry(hist
.key_hist
, PREFIX_ALLOC
, key_size
, value_size
);
11494 } else if (key
.first
== PREFIX_SHARED_BLOB
) {
11495 hist
.update_hist_entry(hist
.key_hist
, PREFIX_SHARED_BLOB
, key_size
, value_size
);
11496 num_shared_shards
++;
11498 hist
.update_hist_entry(hist
.key_hist
, prefix_other
, key_size
, value_size
);
11504 utime_t duration
= ceph_clock_now() - start
;
11505 f
->open_object_section("rocksdb_key_value_stats");
11506 f
->dump_unsigned("num_onodes", num_onodes
);
11507 f
->dump_unsigned("num_shards", num_shards
);
11508 f
->dump_unsigned("num_super", num_super
);
11509 f
->dump_unsigned("num_coll", num_coll
);
11510 f
->dump_unsigned("num_omap", num_omap
);
11511 f
->dump_unsigned("num_deferred", num_deferred
);
11512 f
->dump_unsigned("num_alloc", num_alloc
);
11513 f
->dump_unsigned("num_stat", num_stat
);
11514 f
->dump_unsigned("num_shared_shards", num_shared_shards
);
11515 f
->dump_unsigned("num_others", num_others
);
11516 f
->dump_unsigned("max_key_size", max_key_size
);
11517 f
->dump_unsigned("max_value_size", max_value_size
);
11518 f
->dump_unsigned("total_key_size", total_key_size
);
11519 f
->dump_unsigned("total_value_size", total_value_size
);
11520 f
->close_section();
11524 dout(20) << __func__
<< " finished in " << duration
<< " seconds" << dendl
;
11528 void BlueStore::_flush_cache()
11530 dout(10) << __func__
<< dendl
;
11531 for (auto i
: cache_shards
) {
11533 assert(i
->empty());
11535 for (auto& p
: coll_map
) {
11536 assert(p
.second
->onode_map
.empty());
11537 assert(p
.second
->shared_blob_set
.empty());
11542 // For external caller.
11543 // We use a best-effort policy instead, e.g.,
11544 // we don't care if there are still some pinned onodes/data in the cache
11545 // after this command is completed.
11546 void BlueStore::flush_cache()
11548 dout(10) << __func__
<< dendl
;
11549 for (auto i
: cache_shards
) {
11554 void BlueStore::_apply_padding(uint64_t head_pad
,
11556 bufferlist
& padded
)
11559 padded
.prepend_zero(head_pad
);
11562 padded
.append_zero(tail_pad
);
11564 if (head_pad
|| tail_pad
) {
11565 dout(20) << __func__
<< " can pad head 0x" << std::hex
<< head_pad
11566 << " tail 0x" << tail_pad
<< std::dec
<< dendl
;
11567 logger
->inc(l_bluestore_write_pad_bytes
, head_pad
+ tail_pad
);
11571 // ===========================================