1 // -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*-
2 // vim: ts=8 sw=2 smarttab
4 * Ceph - scalable distributed file system
6 * Copyright (C) 2004-2006 Sage Weil <sage@newdream.net>
7 * Copyright (C) 2013,2014 Cloudwatt <libre.licensing@cloudwatt.com>
9 * Author: Loic Dachary <loic@dachary.org>
11 * This is free software; you can redistribute it and/or
12 * modify it under the terms of the GNU Lesser General Public
13 * License version 2.1, as published by the Free Software
14 * Foundation. See file COPYING.
23 * describe properties of the OSD cluster.
24 * disks, disk groups, total # osds,
33 #include <boost/smart_ptr/local_shared_ptr.hpp>
34 #include "include/btree_map.h"
35 #include "include/common_fwd.h"
36 #include "include/types.h"
37 #include "common/ceph_releases.h"
38 #include "osd_types.h"
40 //#include "include/ceph_features.h"
41 #include "crush/CrushWrapper.h"
43 // forward declaration
45 class health_check_map_t
;
48 * we track up to two intervals during which the osd was alive and
49 * healthy. the most recent is [up_from,up_thru), where up_thru is
50 * the last epoch the osd is known to have _started_. i.e., a lower
51 * bound on the actual osd death. down_at (if it is > up_from) is an
52 * upper bound on the actual osd death.
54 * the second is the last_clean interval [begin,end). in that case,
55 * the last interval is the last epoch known to have been either
56 * _finished_, or during which the osd cleanly shut down. when
57 * possible, we push this forward to the epoch the osd was eventually
60 * the lost_at is used to allow build_prior to proceed without waiting
61 * for an osd to recover. In certain cases, progress may be blocked
62 * because an osd is down that may contain updates (i.e., a pg may have
63 * gone rw during an interval). If the osd can't be brought online, we
64 * can force things to proceed knowing that we _might_ be losing some
65 * acked writes. If the osd comes back to life later, that's fine to,
66 * but those writes will still be lost (the divergent objects will be
70 epoch_t last_clean_begin
; // last interval that ended with a clean osd shutdown
71 epoch_t last_clean_end
;
72 epoch_t up_from
; // epoch osd marked up
73 epoch_t up_thru
; // lower bound on actual osd death (if > up_from)
74 epoch_t down_at
; // upper bound on actual osd death (if > up_from)
75 epoch_t lost_at
; // last epoch we decided data was "lost"
77 osd_info_t() : last_clean_begin(0), last_clean_end(0),
78 up_from(0), up_thru(0), down_at(0), lost_at(0) {}
80 void dump(ceph::Formatter
*f
) const;
81 void encode(ceph::buffer::list
& bl
) const;
82 void decode(ceph::buffer::list::const_iterator
& bl
);
83 static void generate_test_instances(std::list
<osd_info_t
*>& o
);
85 WRITE_CLASS_ENCODER(osd_info_t
)
87 std::ostream
& operator<<(std::ostream
& out
, const osd_info_t
& info
);
90 utime_t down_stamp
; ///< timestamp when we were last marked down
91 float laggy_probability
; ///< encoded as __u32: 0 = definitely not laggy, 0xffffffff definitely laggy
92 __u32 laggy_interval
; ///< average interval between being marked laggy and recovering
93 uint64_t features
; ///< features supported by this osd we should know about
94 __u32 old_weight
; ///< weight prior to being auto marked out
95 utime_t last_purged_snaps_scrub
; ///< last scrub of purged_snaps
96 epoch_t dead_epoch
= 0; ///< last epoch we were confirmed dead (not just down)
98 osd_xinfo_t() : laggy_probability(0), laggy_interval(0),
99 features(0), old_weight(0) {}
101 void dump(ceph::Formatter
*f
) const;
102 void encode(ceph::buffer::list
& bl
, uint64_t features
) const;
103 void decode(ceph::buffer::list::const_iterator
& bl
);
104 static void generate_test_instances(std::list
<osd_xinfo_t
*>& o
);
106 WRITE_CLASS_ENCODER_FEATURES(osd_xinfo_t
)
108 std::ostream
& operator<<(std::ostream
& out
, const osd_xinfo_t
& xi
);
113 ceph::buffer::list data
;
114 typedef btree::btree_map
<pg_t
,ceph_le32
*> map_t
;
117 void encode(ceph::buffer::list
& bl
) const {
119 uint32_t n
= map
.size();
121 for (auto &p
: map
) {
123 bl
.append((char*)p
.second
, (*p
.second
+ 1) * sizeof(ceph_le32
));
126 void decode(ceph::buffer::list::const_iterator
& p
) {
135 size_t start_off
= pstart
.get_off();
136 std::vector
<std::pair
<pg_t
,size_t>> offsets
;
138 for (unsigned i
=0; i
<n
; ++i
) {
141 offsets
[i
].first
= pgid
;
142 offsets
[i
].second
= p
.get_off() - start_off
;
145 p
+= vn
* sizeof(int32_t);
147 size_t len
= p
.get_off() - start_off
;
148 pstart
.copy(len
, data
);
149 if (data
.get_num_buffers() > 1) {
153 char *start
= data
.c_str();
154 for (auto i
: offsets
) {
155 map
.insert(map
.end(), std::make_pair(i
.first
, (ceph_le32
*)(start
+ i
.second
)));
159 ceph::buffer::list bl
;
161 auto p
= std::cbegin(bl
);
164 friend bool operator==(const PGTempMap
& l
, const PGTempMap
& r
) {
166 l
.map
.size() == r
.map
.size() &&
167 l
.data
.contents_equal(r
.data
);
171 map_t::const_iterator it
;
172 map_t::const_iterator end
;
173 std::pair
<pg_t
,std::vector
<int32_t>> current
;
174 void init_current() {
176 current
.first
= it
->first
;
177 ceph_assert(it
->second
);
178 current
.second
.resize(*it
->second
);
179 ceph_le32
*p
= it
->second
+ 1;
180 for (uint32_t n
= 0; n
< *it
->second
; ++n
, ++p
) {
181 current
.second
[n
] = *p
;
186 iterator(map_t::const_iterator p
,
187 map_t::const_iterator e
)
192 const std::pair
<pg_t
,std::vector
<int32_t>>& operator*() const {
195 const std::pair
<pg_t
,std::vector
<int32_t>>* operator->() const {
198 friend bool operator==(const iterator
& l
, const iterator
& r
) {
201 friend bool operator!=(const iterator
& l
, const iterator
& r
) {
204 iterator
& operator++() {
210 iterator
operator++(int) {
218 iterator
begin() const {
219 return iterator(map
.begin(), map
.end());
221 iterator
end() const {
222 return iterator(map
.end(), map
.end());
224 iterator
find(pg_t pgid
) const {
225 return iterator(map
.find(pgid
), map
.end());
227 size_t size() const {
230 size_t count(pg_t pgid
) const {
231 return map
.count(pgid
);
233 void erase(pg_t pgid
) {
240 void set(pg_t pgid
, const mempool::osdmap::vector
<int32_t>& v
) {
242 size_t need
= sizeof(ceph_le32
) * (1 + v
.size());
243 if (need
< data
.get_append_buffer_unused_tail_length()) {
244 ceph::buffer::ptr
z(data
.get_append_buffer_unused_tail_length());
246 data
.append(z
.c_str(), z
.length());
249 map
[pgid
] = (ceph_le32
*)(data
.back().end_c_str()) - (1 + v
.size());
251 mempool::osdmap::vector
<int32_t> get(pg_t pgid
) {
252 mempool::osdmap::vector
<int32_t> v
;
253 ceph_le32
*p
= map
[pgid
];
256 for (size_t i
= 0; i
< n
; ++i
, ++p
) {
262 // trivial implementation
263 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> > pg_temp
;
265 void encode(ceph::buffer::list
& bl
) const {
268 void decode(ceph::buffer::list::const_iterator
& p
) {
271 friend bool operator==(const PGTempMap
& l
, const PGTempMap
& r
) {
273 l
.pg_temp
.size() == r
.pg_temp
.size() &&
274 l
.pg_temp
== r
.pg_temp
;
278 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> >::const_iterator it
;
280 iterator(mempool::osdmap::map
<pg_t
,
281 mempool::osdmap::vector
<int32_t> >::const_iterator p
)
284 std::pair
<pg_t
,const mempool::osdmap::vector
<int32_t>&> operator*() const {
287 const std::pair
<const pg_t
,mempool::osdmap::vector
<int32_t>>* operator->() const {
290 friend bool operator==(const iterator
& l
, const iterator
& r
) {
293 friend bool operator!=(const iterator
& l
, const iterator
& r
) {
296 iterator
& operator++() {
300 iterator
operator++(int) {
306 iterator
begin() const {
307 return iterator(pg_temp
.cbegin());
309 iterator
end() const {
310 return iterator(pg_temp
.cend());
312 iterator
find(pg_t pgid
) const {
313 return iterator(pg_temp
.find(pgid
));
315 size_t size() const {
316 return pg_temp
.size();
318 size_t count(pg_t pgid
) const {
319 return pg_temp
.count(pgid
);
321 void erase(pg_t pgid
) {
327 void set(pg_t pgid
, const mempool::osdmap::vector
<int32_t>& v
) {
330 const mempool::osdmap::vector
<int32_t>& get(pg_t pgid
) {
331 return pg_temp
.at(pgid
);
334 void dump(ceph::Formatter
*f
) const {
335 for (const auto &pg
: *this) {
336 f
->open_object_section("osds");
337 f
->dump_stream("pgid") << pg
.first
;
338 f
->open_array_section("osds");
339 for (const auto osd
: pg
.second
)
340 f
->dump_int("osd", osd
);
346 WRITE_CLASS_ENCODER(PGTempMap
)
352 MEMPOOL_CLASS_HELPERS();
356 MEMPOOL_CLASS_HELPERS();
358 /// feature bits we were encoded with. the subsequent OSDMap
359 /// encoding should match.
360 uint64_t encode_features
;
362 epoch_t epoch
; // new epoch; we are a diff from epoch-1 to epoch
364 int64_t new_pool_max
; //incremented by the OSDMonitor on each pool create
366 ceph_release_t new_require_osd_release
{0xff};
367 uint32_t new_stretch_bucket_count
{0};
368 uint32_t new_degraded_stretch_mode
{0};
369 uint32_t new_recovering_stretch_mode
{0};
370 int32_t new_stretch_mode_bucket
{0};
371 bool stretch_mode_enabled
{false};
372 bool change_stretch_mode
{false};
375 ceph::buffer::list fullmap
; // in lieu of below.
376 ceph::buffer::list crush
;
380 mempool::osdmap::map
<int64_t,pg_pool_t
> new_pools
;
381 mempool::osdmap::map
<int64_t,std::string
> new_pool_names
;
382 mempool::osdmap::set
<int64_t> old_pools
;
383 mempool::osdmap::map
<std::string
,std::map
<std::string
,std::string
> > new_erasure_code_profiles
;
384 mempool::osdmap::vector
<std::string
> old_erasure_code_profiles
;
385 mempool::osdmap::map
<int32_t,entity_addrvec_t
> new_up_client
;
386 mempool::osdmap::map
<int32_t,entity_addrvec_t
> new_up_cluster
;
387 mempool::osdmap::map
<int32_t,uint32_t> new_state
; // XORed onto previous state.
388 mempool::osdmap::map
<int32_t,uint32_t> new_weight
;
389 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> > new_pg_temp
; // [] to remove
390 mempool::osdmap::map
<pg_t
, int32_t> new_primary_temp
; // [-1] to remove
391 mempool::osdmap::map
<int32_t,uint32_t> new_primary_affinity
;
392 mempool::osdmap::map
<int32_t,epoch_t
> new_up_thru
;
393 mempool::osdmap::map
<int32_t,std::pair
<epoch_t
,epoch_t
> > new_last_clean_interval
;
394 mempool::osdmap::map
<int32_t,epoch_t
> new_lost
;
395 mempool::osdmap::map
<int32_t,uuid_d
> new_uuid
;
396 mempool::osdmap::map
<int32_t,osd_xinfo_t
> new_xinfo
;
398 mempool::osdmap::map
<entity_addr_t
,utime_t
> new_blocklist
;
399 mempool::osdmap::vector
<entity_addr_t
> old_blocklist
;
400 mempool::osdmap::map
<entity_addr_t
,utime_t
> new_range_blocklist
;
401 mempool::osdmap::vector
<entity_addr_t
> old_range_blocklist
;
402 mempool::osdmap::map
<int32_t, entity_addrvec_t
> new_hb_back_up
;
403 mempool::osdmap::map
<int32_t, entity_addrvec_t
> new_hb_front_up
;
405 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t>> new_pg_upmap
;
406 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<std::pair
<int32_t,int32_t>>> new_pg_upmap_items
;
407 mempool::osdmap::set
<pg_t
> old_pg_upmap
, old_pg_upmap_items
;
408 mempool::osdmap::map
<int64_t, snap_interval_set_t
> new_removed_snaps
;
409 mempool::osdmap::map
<int64_t, snap_interval_set_t
> new_purged_snaps
;
411 mempool::osdmap::map
<int32_t,uint32_t> new_crush_node_flags
;
412 mempool::osdmap::map
<int32_t,uint32_t> new_device_class_flags
;
414 std::string cluster_snapshot
;
416 float new_nearfull_ratio
= -1;
417 float new_backfillfull_ratio
= -1;
418 float new_full_ratio
= -1;
420 ceph_release_t new_require_min_compat_client
{0xff};
422 utime_t new_last_up_change
, new_last_in_change
;
424 mutable bool have_crc
; ///< crc values are defined
425 uint32_t full_crc
; ///< crc of the resulting OSDMap
426 mutable uint32_t inc_crc
; ///< crc of this incremental
428 int get_net_marked_out(const OSDMap
*previous
) const;
429 int get_net_marked_down(const OSDMap
*previous
) const;
430 int identify_osd(uuid_d u
) const;
432 void encode_client_old(ceph::buffer::list
& bl
) const;
433 void encode_classic(ceph::buffer::list
& bl
, uint64_t features
) const;
434 void encode(ceph::buffer::list
& bl
, uint64_t features
=CEPH_FEATURES_ALL
) const;
435 void decode_classic(ceph::buffer::list::const_iterator
&p
);
436 void decode(ceph::buffer::list::const_iterator
&bl
);
437 void dump(ceph::Formatter
*f
) const;
438 static void generate_test_instances(std::list
<Incremental
*>& o
);
440 explicit Incremental(epoch_t e
=0) :
442 epoch(e
), new_pool_max(-1), new_flags(-1), new_max_osd(-1),
443 have_crc(false), full_crc(0), inc_crc(0) {
445 explicit Incremental(ceph::buffer::list
&bl
) {
446 auto p
= std::cbegin(bl
);
449 explicit Incremental(ceph::buffer::list::const_iterator
&p
) {
453 pg_pool_t
*get_new_pool(int64_t pool
, const pg_pool_t
*orig
) {
454 if (new_pools
.count(pool
) == 0)
455 new_pools
[pool
] = *orig
;
456 return &new_pools
[pool
];
458 bool has_erasure_code_profile(const std::string
&name
) const {
459 auto i
= new_erasure_code_profiles
.find(name
);
460 return i
!= new_erasure_code_profiles
.end();
462 void set_erasure_code_profile(const std::string
&name
,
463 const std::map
<std::string
,std::string
>& profile
) {
464 new_erasure_code_profiles
[name
] = profile
;
466 mempool::osdmap::map
<std::string
,std::map
<std::string
,std::string
>> get_erasure_code_profiles() const {
467 return new_erasure_code_profiles
;
470 /// propagate update pools' (snap and other) metadata to any of their tiers
471 int propagate_base_properties_to_tiers(CephContext
*cct
, const OSDMap
&base
);
473 /// filter out osds with any pending state changing
474 size_t get_pending_state_osds(std::vector
<int> *osds
) {
478 for (auto &p
: new_state
) {
479 osds
->push_back(p
.first
);
485 bool pending_osd_has_state(int osd
, unsigned state
) {
486 return new_state
.count(osd
) && (new_state
[osd
] & state
) != 0;
489 bool pending_osd_state_set(int osd
, unsigned state
) {
490 if (pending_osd_has_state(osd
, state
))
492 new_state
[osd
] |= state
;
496 // cancel the specified pending osd state if there is any
497 // return ture on success, false otherwise.
498 bool pending_osd_state_clear(int osd
, unsigned state
) {
499 if (!pending_osd_has_state(osd
, state
)) {
500 // never has been set or already has been cancelled.
504 new_state
[osd
] &= ~state
;
505 if (!new_state
[osd
]) {
507 new_state
.erase(osd
);
512 bool in_new_removed_snaps(int64_t pool
, snapid_t snap
) const {
513 auto p
= new_removed_snaps
.find(pool
);
514 if (p
== new_removed_snaps
.end()) {
517 return p
->second
.contains(snap
);
523 epoch_t epoch
; // what epoch of the osd cluster descriptor is this
524 utime_t created
, modified
; // epoch start time
525 int32_t pool_max
; // the largest pool num, ever
529 int num_osd
; // not saved; see calc_num_osds
530 int num_up_osd
; // not saved; see calc_num_osds
531 int num_in_osd
; // not saved; see calc_num_osds
534 std::vector
<uint32_t> osd_state
;
536 mempool::osdmap::map
<int32_t,uint32_t> crush_node_flags
; // crush node -> CEPH_OSD_* flags
537 mempool::osdmap::map
<int32_t,uint32_t> device_class_flags
; // device class -> CEPH_OSD_* flags
539 utime_t last_up_change
, last_in_change
;
541 // These features affect OSDMap[::Incremental] encoding, or the
542 // encoding of some type embedded therein (CrushWrapper, something
543 // from osd_types, etc.).
544 static constexpr uint64_t SIGNIFICANT_FEATURES
=
545 CEPH_FEATUREMASK_PGID64
|
546 CEPH_FEATUREMASK_PGPOOL3
|
547 CEPH_FEATUREMASK_OSDENC
|
548 CEPH_FEATUREMASK_OSDMAP_ENC
|
549 CEPH_FEATUREMASK_OSD_POOLRESEND
|
550 CEPH_FEATUREMASK_NEW_OSDOP_ENCODING
|
551 CEPH_FEATUREMASK_MSG_ADDR2
|
552 CEPH_FEATUREMASK_CRUSH_TUNABLES5
|
553 CEPH_FEATUREMASK_CRUSH_CHOOSE_ARGS
|
554 CEPH_FEATUREMASK_SERVER_LUMINOUS
|
555 CEPH_FEATUREMASK_SERVER_MIMIC
|
556 CEPH_FEATUREMASK_SERVER_NAUTILUS
|
557 CEPH_FEATUREMASK_SERVER_OCTOPUS
;
560 mempool::osdmap::vector
<std::shared_ptr
<entity_addrvec_t
> > client_addrs
;
561 mempool::osdmap::vector
<std::shared_ptr
<entity_addrvec_t
> > cluster_addrs
;
562 mempool::osdmap::vector
<std::shared_ptr
<entity_addrvec_t
> > hb_back_addrs
;
563 mempool::osdmap::vector
<std::shared_ptr
<entity_addrvec_t
> > hb_front_addrs
;
565 std::shared_ptr
<addrs_s
> osd_addrs
;
567 entity_addrvec_t _blank_addrvec
;
569 mempool::osdmap::vector
<__u32
> osd_weight
; // 16.16 fixed point, 0x10000 = "in", 0 = "out"
570 mempool::osdmap::vector
<osd_info_t
> osd_info
;
571 std::shared_ptr
<PGTempMap
> pg_temp
; // temp pg mapping (e.g. while we rebuild)
572 std::shared_ptr
< mempool::osdmap::map
<pg_t
,int32_t > > primary_temp
; // temp primary mapping (e.g. while we rebuild)
573 std::shared_ptr
< mempool::osdmap::vector
<__u32
> > osd_primary_affinity
; ///< 16.16 fixed point, 0x10000 = baseline
575 // remap (post-CRUSH, pre-up)
576 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t>> pg_upmap
; ///< remap pg
577 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<std::pair
<int32_t,int32_t>>> pg_upmap_items
; ///< remap osds in up set
579 mempool::osdmap::map
<int64_t,pg_pool_t
> pools
;
580 mempool::osdmap::map
<int64_t,std::string
> pool_name
;
581 mempool::osdmap::map
<std::string
, std::map
<std::string
,std::string
>> erasure_code_profiles
;
582 mempool::osdmap::map
<std::string
,int64_t, std::less
<>> name_pool
;
584 std::shared_ptr
< mempool::osdmap::vector
<uuid_d
> > osd_uuid
;
585 mempool::osdmap::vector
<osd_xinfo_t
> osd_xinfo
;
589 uint64_t upper_64_bits
, lower_64_bits
;
590 uint64_t upper_mask
, lower_mask
;
601 static void get_ipv6_bytes(unsigned const char *addr
,
602 uint64_t *upper
, uint64_t *lower
);
605 range_bits(const entity_addr_t
& addr
);
606 void parse(const entity_addr_t
& addr
);
607 bool matches(const entity_addr_t
& addr
) const;
609 mempool::osdmap::unordered_map
<entity_addr_t
,utime_t
> blocklist
;
610 mempool::osdmap::map
<entity_addr_t
,utime_t
> range_blocklist
;
611 mempool::osdmap::map
<entity_addr_t
,range_bits
> calculated_ranges
;
613 /// queue of snaps to remove
614 mempool::osdmap::map
<int64_t, snap_interval_set_t
> removed_snaps_queue
;
616 /// removed_snaps additions this epoch
617 mempool::osdmap::map
<int64_t, snap_interval_set_t
> new_removed_snaps
;
619 /// removed_snaps removals this epoch
620 mempool::osdmap::map
<int64_t, snap_interval_set_t
> new_purged_snaps
;
622 epoch_t cluster_snapshot_epoch
;
623 std::string cluster_snapshot
;
624 bool new_blocklist_entries
;
626 float full_ratio
= 0, backfillfull_ratio
= 0, nearfull_ratio
= 0;
628 /// min compat client we want to support
629 ceph_release_t require_min_compat_client
{ceph_release_t::unknown
};
632 /// require osds to run at least this release
633 ceph_release_t require_osd_release
{ceph_release_t::unknown
};
636 mutable uint64_t cached_up_osd_features
;
638 mutable bool crc_defined
;
639 mutable uint32_t crc
;
641 void _calc_up_osd_features();
644 bool have_crc() const { return crc_defined
; }
645 uint32_t get_crc() const { return crc
; }
647 std::shared_ptr
<CrushWrapper
> crush
; // hierarchical map
648 bool stretch_mode_enabled
; // we are in stretch mode, requiring multiple sites
649 uint32_t stretch_bucket_count
; // number of sites we expect to be in
650 uint32_t degraded_stretch_mode
; // 0 if not degraded; else count of up sites
651 uint32_t recovering_stretch_mode
; // 0 if not recovering; else 1
652 int32_t stretch_mode_bucket
; // the bucket type we're stretched across
654 uint32_t crush_version
= 1;
656 friend class OSDMonitor
;
662 num_osd(0), num_up_osd(0), num_in_osd(0),
664 osd_addrs(std::make_shared
<addrs_s
>()),
665 pg_temp(std::make_shared
<PGTempMap
>()),
666 primary_temp(std::make_shared
<mempool::osdmap::map
<pg_t
,int32_t>>()),
667 osd_uuid(std::make_shared
<mempool::osdmap::vector
<uuid_d
>>()),
668 cluster_snapshot_epoch(0),
669 new_blocklist_entries(false),
670 cached_up_osd_features(0),
671 crc_defined(false), crc(0),
672 crush(std::make_shared
<CrushWrapper
>()),
673 stretch_mode_enabled(false), stretch_bucket_count(0),
674 degraded_stretch_mode(0), recovering_stretch_mode(0), stretch_mode_bucket(0) {
678 OSDMap(const OSDMap
& other
) = default;
679 OSDMap
& operator=(const OSDMap
& other
) = default;
682 /// return feature mask subset that is relevant to OSDMap encoding
683 static uint64_t get_significant_features(uint64_t features
) {
684 return SIGNIFICANT_FEATURES
& features
;
687 uint64_t get_encoding_features() const;
689 void deepish_copy_from(const OSDMap
& o
) {
691 primary_temp
.reset(new mempool::osdmap::map
<pg_t
,int32_t>(*o
.primary_temp
));
692 pg_temp
.reset(new PGTempMap(*o
.pg_temp
));
693 osd_uuid
.reset(new mempool::osdmap::vector
<uuid_d
>(*o
.osd_uuid
));
695 if (o
.osd_primary_affinity
)
696 osd_primary_affinity
.reset(new mempool::osdmap::vector
<__u32
>(*o
.osd_primary_affinity
));
698 // NOTE: this still references shared entity_addrvec_t's.
699 osd_addrs
.reset(new addrs_s(*o
.osd_addrs
));
701 // NOTE: we do not copy crush. note that apply_incremental will
702 // allocate a new CrushWrapper, though.
706 const uuid_d
& get_fsid() const { return fsid
; }
707 void set_fsid(uuid_d
& f
) { fsid
= f
; }
709 epoch_t
get_epoch() const { return epoch
; }
710 void inc_epoch() { epoch
++; }
712 void set_epoch(epoch_t e
);
714 uint32_t get_crush_version() const {
715 return crush_version
;
719 const utime_t
& get_created() const { return created
; }
720 const utime_t
& get_modified() const { return modified
; }
722 bool is_blocklisted(const entity_addr_t
& a
, CephContext
*cct
=nullptr) const;
723 bool is_blocklisted(const entity_addrvec_t
& a
, CephContext
*cct
=nullptr) const;
724 void get_blocklist(std::list
<std::pair
<entity_addr_t
,utime_t
> > *bl
,
725 std::list
<std::pair
<entity_addr_t
,utime_t
> > *rl
) const;
726 void get_blocklist(std::set
<entity_addr_t
> *bl
,
727 std::set
<entity_addr_t
> *rl
) const;
729 std::string
get_cluster_snapshot() const {
730 if (cluster_snapshot_epoch
== epoch
)
731 return cluster_snapshot
;
732 return std::string();
735 float get_full_ratio() const {
738 float get_backfillfull_ratio() const {
739 return backfillfull_ratio
;
741 float get_nearfull_ratio() const {
742 return nearfull_ratio
;
744 void get_full_pools(CephContext
*cct
,
745 std::set
<int64_t> *full
,
746 std::set
<int64_t> *backfillfull
,
747 std::set
<int64_t> *nearfull
) const;
748 void get_full_osd_counts(std::set
<int> *full
, std::set
<int> *backfill
,
749 std::set
<int> *nearfull
) const;
752 /***** cluster state *****/
754 int get_max_osd() const { return max_osd
; }
755 void set_max_osd(int m
);
757 unsigned get_num_osds() const {
760 unsigned get_num_up_osds() const {
763 unsigned get_num_in_osds() const {
766 /// recalculate cached values for get_num{,_up,_in}_osds
769 void get_all_osds(std::set
<int32_t>& ls
) const;
770 void get_up_osds(std::set
<int32_t>& ls
) const;
771 void get_out_existing_osds(std::set
<int32_t>& ls
) const;
772 unsigned get_num_pg_temp() const {
773 return pg_temp
->size();
776 int get_flags() const { return flags
; }
777 bool test_flag(int f
) const { return flags
& f
; }
778 void set_flag(int f
) { flags
|= f
; }
779 void clear_flag(int f
) { flags
&= ~f
; }
781 void get_flag_set(std::set
<std::string
> *flagset
) const;
783 static void calc_state_set(int state
, std::set
<std::string
>& st
);
785 int get_state(int o
) const {
786 ceph_assert(o
< max_osd
);
789 int get_state(int o
, std::set
<std::string
>& st
) const {
790 ceph_assert(o
< max_osd
);
791 unsigned t
= osd_state
[o
];
792 calc_state_set(t
, st
);
795 void set_state(int o
, unsigned s
) {
796 ceph_assert(o
< max_osd
);
799 void set_weight(int o
, unsigned w
) {
800 ceph_assert(o
< max_osd
);
803 osd_state
[o
] |= CEPH_OSD_EXISTS
;
805 unsigned get_weight(int o
) const {
806 ceph_assert(o
< max_osd
);
807 return osd_weight
[o
];
809 float get_weightf(int o
) const {
810 return (float)get_weight(o
) / (float)CEPH_OSD_IN
;
812 void adjust_osd_weights(const std::map
<int,double>& weights
, Incremental
& inc
) const;
814 void set_primary_affinity(int o
, int w
) {
815 ceph_assert(o
< max_osd
);
816 if (!osd_primary_affinity
)
817 osd_primary_affinity
.reset(
818 new mempool::osdmap::vector
<__u32
>(
819 max_osd
, CEPH_OSD_DEFAULT_PRIMARY_AFFINITY
));
820 (*osd_primary_affinity
)[o
] = w
;
822 unsigned get_primary_affinity(int o
) const {
823 ceph_assert(o
< max_osd
);
824 if (!osd_primary_affinity
)
825 return CEPH_OSD_DEFAULT_PRIMARY_AFFINITY
;
826 return (*osd_primary_affinity
)[o
];
828 float get_primary_affinityf(int o
) const {
829 return (float)get_primary_affinity(o
) / (float)CEPH_OSD_MAX_PRIMARY_AFFINITY
;
832 bool has_erasure_code_profile(const std::string
&name
) const {
833 auto i
= erasure_code_profiles
.find(name
);
834 return i
!= erasure_code_profiles
.end();
836 int get_erasure_code_profile_default(CephContext
*cct
,
837 std::map
<std::string
,std::string
> &profile_map
,
839 void set_erasure_code_profile(const std::string
&name
,
840 const std::map
<std::string
,std::string
>& profile
) {
841 erasure_code_profiles
[name
] = profile
;
843 const std::map
<std::string
,std::string
> &get_erasure_code_profile(
844 const std::string
&name
) const {
845 static std::map
<std::string
,std::string
> empty
;
846 auto i
= erasure_code_profiles
.find(name
);
847 if (i
== erasure_code_profiles
.end())
852 const mempool::osdmap::map
<std::string
,std::map
<std::string
,std::string
>> &get_erasure_code_profiles() const {
853 return erasure_code_profiles
;
856 bool exists(int osd
) const {
858 return osd
>= 0 && osd
< max_osd
&& (osd_state
[osd
] & CEPH_OSD_EXISTS
);
861 bool is_destroyed(int osd
) const {
862 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_DESTROYED
);
865 bool is_up(int osd
) const {
866 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_UP
);
869 bool has_been_up_since(int osd
, epoch_t epoch
) const {
870 return is_up(osd
) && get_up_from(osd
) <= epoch
;
873 bool is_down(int osd
) const {
877 bool is_stop(int osd
) const {
878 return exists(osd
) && is_down(osd
) &&
879 (osd_state
[osd
] & CEPH_OSD_STOP
);
882 bool is_out(int osd
) const {
883 return !exists(osd
) || get_weight(osd
) == CEPH_OSD_OUT
;
886 bool is_in(int osd
) const {
890 bool is_dead(int osd
) const {
892 return false; // unclear if they know they are removed from map
894 return get_xinfo(osd
).dead_epoch
> get_info(osd
).up_from
;
897 unsigned get_osd_crush_node_flags(int osd
) const;
898 unsigned get_crush_node_flags(int id
) const;
899 unsigned get_device_class_flags(int id
) const;
901 bool is_noup_by_osd(int osd
) const {
902 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOUP
);
905 bool is_nodown_by_osd(int osd
) const {
906 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NODOWN
);
909 bool is_noin_by_osd(int osd
) const {
910 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOIN
);
913 bool is_noout_by_osd(int osd
) const {
914 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOOUT
);
917 bool is_noup(int osd
) const {
918 if (test_flag(CEPH_OSDMAP_NOUP
)) // global?
920 if (is_noup_by_osd(osd
)) // by osd?
922 if (get_osd_crush_node_flags(osd
) & CEPH_OSD_NOUP
) // by crush-node?
924 if (auto class_id
= crush
->get_item_class_id(osd
); class_id
>= 0 &&
925 get_device_class_flags(class_id
) & CEPH_OSD_NOUP
) // by device-class?
930 bool is_nodown(int osd
) const {
931 if (test_flag(CEPH_OSDMAP_NODOWN
))
933 if (is_nodown_by_osd(osd
))
935 if (get_osd_crush_node_flags(osd
) & CEPH_OSD_NODOWN
)
937 if (auto class_id
= crush
->get_item_class_id(osd
); class_id
>= 0 &&
938 get_device_class_flags(class_id
) & CEPH_OSD_NODOWN
)
943 bool is_noin(int osd
) const {
944 if (test_flag(CEPH_OSDMAP_NOIN
))
946 if (is_noin_by_osd(osd
))
948 if (get_osd_crush_node_flags(osd
) & CEPH_OSD_NOIN
)
950 if (auto class_id
= crush
->get_item_class_id(osd
); class_id
>= 0 &&
951 get_device_class_flags(class_id
) & CEPH_OSD_NOIN
)
956 bool is_noout(int osd
) const {
957 if (test_flag(CEPH_OSDMAP_NOOUT
))
959 if (is_noout_by_osd(osd
))
961 if (get_osd_crush_node_flags(osd
) & CEPH_OSD_NOOUT
)
963 if (auto class_id
= crush
->get_item_class_id(osd
); class_id
>= 0 &&
964 get_device_class_flags(class_id
) & CEPH_OSD_NOOUT
)
970 * check if an entire crush subtree is down
972 bool subtree_is_down(int id
, std::set
<int> *down_cache
) const;
973 bool containing_subtree_is_down(CephContext
*cct
, int osd
, int subtree_type
, std::set
<int> *down_cache
) const;
975 bool subtree_type_is_down(CephContext
*cct
, int id
, int subtree_type
, std::set
<int> *down_in_osds
, std::set
<int> *up_in_osds
,
976 std::set
<int> *subtree_up
, std::unordered_map
<int, std::set
<int> > *subtree_type_down
) const;
978 int identify_osd(const entity_addr_t
& addr
) const;
979 int identify_osd(const uuid_d
& u
) const;
980 int identify_osd_on_all_channels(const entity_addr_t
& addr
) const;
982 bool have_addr(const entity_addr_t
& addr
) const {
983 return identify_osd(addr
) >= 0;
985 int find_osd_on_ip(const entity_addr_t
& ip
) const;
987 const entity_addrvec_t
& get_addrs(int osd
) const {
988 ceph_assert(exists(osd
));
989 return osd_addrs
->client_addrs
[osd
] ?
990 *osd_addrs
->client_addrs
[osd
] : _blank_addrvec
;
992 const entity_addrvec_t
& get_most_recent_addrs(int osd
) const {
993 return get_addrs(osd
);
995 const entity_addrvec_t
&get_cluster_addrs(int osd
) const {
996 ceph_assert(exists(osd
));
997 return osd_addrs
->cluster_addrs
[osd
] ?
998 *osd_addrs
->cluster_addrs
[osd
] : _blank_addrvec
;
1000 const entity_addrvec_t
&get_hb_back_addrs(int osd
) const {
1001 ceph_assert(exists(osd
));
1002 return osd_addrs
->hb_back_addrs
[osd
] ?
1003 *osd_addrs
->hb_back_addrs
[osd
] : _blank_addrvec
;
1005 const entity_addrvec_t
&get_hb_front_addrs(int osd
) const {
1006 ceph_assert(exists(osd
));
1007 return osd_addrs
->hb_front_addrs
[osd
] ?
1008 *osd_addrs
->hb_front_addrs
[osd
] : _blank_addrvec
;
1011 const uuid_d
& get_uuid(int osd
) const {
1012 ceph_assert(exists(osd
));
1013 return (*osd_uuid
)[osd
];
1016 const epoch_t
& get_up_from(int osd
) const {
1017 ceph_assert(exists(osd
));
1018 return osd_info
[osd
].up_from
;
1020 const epoch_t
& get_up_thru(int osd
) const {
1021 ceph_assert(exists(osd
));
1022 return osd_info
[osd
].up_thru
;
1024 const epoch_t
& get_down_at(int osd
) const {
1025 ceph_assert(exists(osd
));
1026 return osd_info
[osd
].down_at
;
1028 const osd_info_t
& get_info(int osd
) const {
1029 ceph_assert(osd
< max_osd
);
1030 return osd_info
[osd
];
1033 const osd_xinfo_t
& get_xinfo(int osd
) const {
1034 ceph_assert(osd
< max_osd
);
1035 return osd_xinfo
[osd
];
1038 int get_next_up_osd_after(int n
) const {
1039 if (get_max_osd() == 0)
1041 for (int i
= n
+ 1; i
!= n
; ++i
) {
1042 if (i
>= get_max_osd())
1052 int get_previous_up_osd_before(int n
) const {
1053 if (get_max_osd() == 0)
1055 for (int i
= n
- 1; i
!= n
; --i
) {
1057 i
= get_max_osd() - 1;
1067 void get_random_up_osds_by_subtree(int n
, // whoami
1068 std::string
&subtree
,
1069 int limit
, // how many
1071 std::set
<int> *want
) const;
1074 * get feature bits required by the current structure
1076 * @param entity_type [in] what entity type we are asking about
1077 * @param mask [out] std::set of all possible map-related features we could std::set
1078 * @return feature bits used by this map
1080 uint64_t get_features(int entity_type
, uint64_t *mask
) const;
1083 * get oldest *client* version (firefly, hammer, etc.) that can connect given
1084 * the feature bits required (according to get_features()).
1086 ceph_release_t
get_min_compat_client() const;
1089 * gets the required minimum *client* version that can connect to the cluster.
1091 ceph_release_t
get_require_min_compat_client() const;
1094 * get intersection of features supported by up osds
1096 uint64_t get_up_osd_features() const;
1098 void get_upmap_pgs(std::vector
<pg_t
> *upmap_pgs
) const;
1099 bool check_pg_upmaps(
1101 const std::vector
<pg_t
>& to_check
,
1102 std::vector
<pg_t
> *to_cancel
,
1103 std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int,int>>> *to_remap
) const;
1104 void clean_pg_upmaps(
1106 Incremental
*pending_inc
,
1107 const std::vector
<pg_t
>& to_cancel
,
1108 const std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int,int>>>& to_remap
) const;
1109 bool clean_pg_upmaps(CephContext
*cct
, Incremental
*pending_inc
) const;
1111 int apply_incremental(const Incremental
&inc
);
1113 /// try to re-use/reference addrs in oldmap from newmap
1114 static void dedup(const OSDMap
*oldmap
, OSDMap
*newmap
);
1116 static void clean_temps(CephContext
*cct
,
1117 const OSDMap
& oldmap
,
1118 const OSDMap
& nextmap
,
1119 Incremental
*pending_inc
);
1121 // serialize, unserialize
1123 void encode_client_old(ceph::buffer::list
& bl
) const;
1124 void encode_classic(ceph::buffer::list
& bl
, uint64_t features
) const;
1125 void decode_classic(ceph::buffer::list::const_iterator
& p
);
1128 void encode(ceph::buffer::list
& bl
, uint64_t features
=CEPH_FEATURES_ALL
) const;
1129 void decode(ceph::buffer::list
& bl
);
1130 void decode(ceph::buffer::list::const_iterator
& bl
);
1133 /**** mapping facilities ****/
1136 const std::string
& name
,
1137 const std::string
& key
,
1138 const std::string
& nspace
,
1140 int object_locator_to_pg(const object_t
& oid
, const object_locator_t
& loc
,
1142 pg_t
object_locator_to_pg(const object_t
& oid
,
1143 const object_locator_t
& loc
) const {
1145 int ret
= object_locator_to_pg(oid
, loc
, pg
);
1146 ceph_assert(ret
== 0);
1151 static object_locator_t
file_to_object_locator(const file_layout_t
& layout
) {
1152 return object_locator_t(layout
.pool_id
, layout
.pool_ns
);
1155 ceph_object_layout
file_to_object_layout(object_t oid
,
1156 file_layout_t
& layout
) const {
1157 return make_object_layout(oid
, layout
.pool_id
, layout
.pool_ns
);
1160 ceph_object_layout
make_object_layout(object_t oid
, int pg_pool
,
1161 std::string nspace
) const;
1163 int get_pg_num(int pg_pool
) const
1165 const pg_pool_t
*pool
= get_pg_pool(pg_pool
);
1166 ceph_assert(NULL
!= pool
);
1167 return pool
->get_pg_num();
1170 bool pg_exists(pg_t pgid
) const {
1171 const pg_pool_t
*p
= get_pg_pool(pgid
.pool());
1172 return p
&& pgid
.ps() < p
->get_pg_num();
1175 int get_pg_pool_min_size(pg_t pgid
) const {
1176 if (!pg_exists(pgid
)) {
1179 const pg_pool_t
*p
= get_pg_pool(pgid
.pool());
1181 return p
->get_min_size();
1184 int get_pg_pool_size(pg_t pgid
) const {
1185 if (!pg_exists(pgid
)) {
1188 const pg_pool_t
*p
= get_pg_pool(pgid
.pool());
1190 return p
->get_size();
1193 int get_pg_pool_crush_rule(pg_t pgid
) const {
1194 if (!pg_exists(pgid
)) {
1197 const pg_pool_t
*p
= get_pg_pool(pgid
.pool());
1199 return p
->get_crush_rule();
1203 /// pg -> (raw osd std::list)
1204 void _pg_to_raw_osds(
1205 const pg_pool_t
& pool
, pg_t pg
,
1206 std::vector
<int> *osds
,
1208 int _pick_primary(const std::vector
<int>& osds
) const;
1209 void _remove_nonexistent_osds(const pg_pool_t
& pool
, std::vector
<int>& osds
) const;
1211 void _apply_primary_affinity(ps_t seed
, const pg_pool_t
& pool
,
1212 std::vector
<int> *osds
, int *primary
) const;
1214 /// apply pg_upmap[_items] mappings
1215 void _apply_upmap(const pg_pool_t
& pi
, pg_t pg
, std::vector
<int> *raw
) const;
1217 /// pg -> (up osd std::list)
1218 void _raw_to_up_osds(const pg_pool_t
& pool
, const std::vector
<int>& raw
,
1219 std::vector
<int> *up
) const;
1223 * Get the pg and primary temp, if they are specified.
1224 * @param temp_pg [out] Will be empty or contain the temp PG mapping on return
1225 * @param temp_primary [out] Will be the value in primary_temp, or a value derived
1226 * from the pg_temp (if specified), or -1 if you should use the calculated (up_)primary.
1228 void _get_temp_osds(const pg_pool_t
& pool
, pg_t pg
,
1229 std::vector
<int> *temp_pg
, int *temp_primary
) const;
1232 * map to up and acting. Fills in whatever fields are non-NULL.
1234 void _pg_to_up_acting_osds(const pg_t
& pg
, std::vector
<int> *up
, int *up_primary
,
1235 std::vector
<int> *acting
, int *acting_primary
,
1236 bool raw_pg_to_pg
= true) const;
1240 * This is suitable only for looking at raw CRUSH outputs. It skips
1241 * applying the temp and up checks and should not be used
1242 * by anybody for data mapping purposes.
1243 * raw and primary must be non-NULL
1245 void pg_to_raw_osds(pg_t pg
, std::vector
<int> *raw
, int *primary
) const;
1246 void pg_to_raw_upmap(pg_t pg
, std::vector
<int> *raw
,
1247 std::vector
<int> *raw_upmap
) const;
1248 /// map a pg to its acting set. @return acting set size
1249 void pg_to_acting_osds(const pg_t
& pg
, std::vector
<int> *acting
,
1250 int *acting_primary
) const {
1251 _pg_to_up_acting_osds(pg
, NULL
, NULL
, acting
, acting_primary
);
1253 void pg_to_acting_osds(pg_t pg
, std::vector
<int>& acting
) const {
1254 return pg_to_acting_osds(pg
, &acting
, NULL
);
1257 * This does not apply temp overrides and should not be used
1258 * by anybody for data mapping purposes. Specify both pointers.
1260 void pg_to_raw_up(pg_t pg
, std::vector
<int> *up
, int *primary
) const;
1262 * map a pg to its acting set as well as its up set. You must use
1263 * the acting set for data mapping purposes, but some users will
1264 * also find the up set useful for things like deciding what to
1266 * Each of these pointers must be non-NULL.
1268 void pg_to_up_acting_osds(pg_t pg
, std::vector
<int> *up
, int *up_primary
,
1269 std::vector
<int> *acting
, int *acting_primary
) const {
1270 _pg_to_up_acting_osds(pg
, up
, up_primary
, acting
, acting_primary
);
1272 void pg_to_up_acting_osds(pg_t pg
, std::vector
<int>& up
, std::vector
<int>& acting
) const {
1273 int up_primary
, acting_primary
;
1274 pg_to_up_acting_osds(pg
, &up
, &up_primary
, &acting
, &acting_primary
);
1276 bool pg_is_ec(pg_t pg
) const {
1277 auto i
= pools
.find(pg
.pool());
1278 ceph_assert(i
!= pools
.end());
1279 return i
->second
.is_erasure();
1281 bool get_primary_shard(const pg_t
& pgid
, spg_t
*out
) const {
1282 auto i
= get_pools().find(pgid
.pool());
1283 if (i
== get_pools().end()) {
1286 if (!i
->second
.is_erasure()) {
1291 std::vector
<int> acting
;
1292 pg_to_acting_osds(pgid
, &acting
, &primary
);
1293 for (uint8_t i
= 0; i
< acting
.size(); ++i
) {
1294 if (acting
[i
] == primary
) {
1295 *out
= spg_t(pgid
, shard_id_t(i
));
1301 bool get_primary_shard(const pg_t
& pgid
, int *primary
, spg_t
*out
) const {
1302 auto i
= get_pools().find(pgid
.pool());
1303 if (i
== get_pools().end()) {
1306 std::vector
<int> acting
;
1307 pg_to_acting_osds(pgid
, &acting
, primary
);
1308 if (i
->second
.is_erasure()) {
1309 for (uint8_t i
= 0; i
< acting
.size(); ++i
) {
1310 if (acting
[i
] == *primary
) {
1311 *out
= spg_t(pgid
, shard_id_t(i
));
1322 bool in_removed_snaps_queue(int64_t pool
, snapid_t snap
) const {
1323 auto p
= removed_snaps_queue
.find(pool
);
1324 if (p
== removed_snaps_queue
.end()) {
1327 return p
->second
.contains(snap
);
1330 const mempool::osdmap::map
<int64_t,snap_interval_set_t
>&
1331 get_removed_snaps_queue() const {
1332 return removed_snaps_queue
;
1334 const mempool::osdmap::map
<int64_t,snap_interval_set_t
>&
1335 get_new_removed_snaps() const {
1336 return new_removed_snaps
;
1338 const mempool::osdmap::map
<int64_t,snap_interval_set_t
>&
1339 get_new_purged_snaps() const {
1340 return new_purged_snaps
;
1343 int64_t lookup_pg_pool_name(std::string_view name
) const {
1344 auto p
= name_pool
.find(name
);
1345 if (p
== name_pool
.end())
1350 int64_t get_pool_max() const {
1353 const mempool::osdmap::map
<int64_t,pg_pool_t
>& get_pools() const {
1356 mempool::osdmap::map
<int64_t,pg_pool_t
>& get_pools() {
1359 void get_pool_ids_by_rule(int rule_id
, std::set
<int64_t> *pool_ids
) const {
1360 ceph_assert(pool_ids
);
1361 for (auto &p
: pools
) {
1362 if (p
.second
.get_crush_rule() == rule_id
) {
1363 pool_ids
->insert(p
.first
);
1367 void get_pool_ids_by_osd(CephContext
*cct
,
1369 std::set
<int64_t> *pool_ids
) const;
1370 const std::string
& get_pool_name(int64_t p
) const {
1371 auto i
= pool_name
.find(p
);
1372 ceph_assert(i
!= pool_name
.end());
1375 const mempool::osdmap::map
<int64_t,std::string
>& get_pool_names() const {
1378 bool have_pg_pool(int64_t p
) const {
1379 return pools
.count(p
);
1381 const pg_pool_t
* get_pg_pool(int64_t p
) const {
1382 auto i
= pools
.find(p
);
1383 if (i
!= pools
.end())
1387 unsigned get_pg_size(pg_t pg
) const {
1388 auto p
= pools
.find(pg
.pool());
1389 ceph_assert(p
!= pools
.end());
1390 return p
->second
.get_size();
1392 int get_pg_type(pg_t pg
) const {
1393 auto p
= pools
.find(pg
.pool());
1394 ceph_assert(p
!= pools
.end());
1395 return p
->second
.get_type();
1397 int get_pool_crush_rule(int64_t pool_id
) const {
1398 auto pool
= get_pg_pool(pool_id
);
1401 return pool
->get_crush_rule();
1405 pg_t
raw_pg_to_pg(pg_t pg
) const {
1406 auto p
= pools
.find(pg
.pool());
1407 ceph_assert(p
!= pools
.end());
1408 return p
->second
.raw_pg_to_pg(pg
);
1411 // pg -> acting primary osd
1412 int get_pg_acting_primary(pg_t pg
) const {
1414 _pg_to_up_acting_osds(pg
, nullptr, nullptr, nullptr, &primary
);
1419 * check whether an spg_t maps to a particular osd
1421 bool is_up_acting_osd_shard(spg_t pg
, int osd
) const {
1422 std::vector
<int> up
, acting
;
1423 _pg_to_up_acting_osds(pg
.pgid
, &up
, NULL
, &acting
, NULL
, false);
1424 if (calc_pg_role(pg_shard_t(osd
, pg
.shard
), acting
) >= 0 ||
1425 calc_pg_role(pg_shard_t(osd
, pg
.shard
), up
) >= 0) {
1432 static int calc_pg_role_broken(int osd
, const std::vector
<int>& acting
, int nrep
=0);
1433 static int calc_pg_role(pg_shard_t who
, const std::vector
<int>& acting
);
1434 static bool primary_changed_broken(
1436 const std::vector
<int> &oldacting
,
1438 const std::vector
<int> &newacting
);
1440 /* rank is -1 (stray), 0 (primary), 1,2,3,... (replica) */
1441 int get_pg_acting_role(spg_t pg
, int osd
) const {
1442 std::vector
<int> group
;
1443 pg_to_acting_osds(pg
.pgid
, group
);
1444 return calc_pg_role(pg_shard_t(osd
, pg
.shard
), group
);
1449 pg_t pg
, ///< pg to potentially remap
1450 const std::set
<int>& overfull
, ///< osds we'd want to evacuate
1451 const std::vector
<int>& underfull
, ///< osds to move to, in order of preference
1452 const std::vector
<int>& more_underfull
, ///< less full osds to move to, in order of preference
1453 std::vector
<int> *orig
,
1454 std::vector
<int> *out
); ///< resulting alternative mapping
1458 uint32_t max_deviation
, ///< max deviation from target (value >= 1)
1459 int max_iterations
, ///< max iterations to run
1460 const std::set
<int64_t>& pools
, ///< [optional] restrict to pool
1461 Incremental
*pending_inc
,
1462 std::random_device::result_type
*p_seed
= nullptr ///< [optional] for regression tests
1465 private: // Bunch of internal functions used only by calc_pg_upmaps (result of code refactoring)
1466 float build_pool_pgs_info (
1468 const std::set
<int64_t>& pools
, ///< [optional] restrict to pool
1469 const OSDMap
& tmp_osd_map
,
1471 std::map
<int, std::set
<pg_t
>>& pgs_by_osd
,
1472 std::map
<int,float>& osd_weight
1473 ); // return total weight of all OSDs
1475 float calc_deviations (
1477 const std::map
<int,std::set
<pg_t
>>& pgs_by_osd
,
1478 const std::map
<int,float>& osd_weight
,
1479 float pgs_per_weight
,
1480 std::map
<int,float>& osd_deviation
,
1481 std::multimap
<float,int>& deviation_osd
,
1483 ); // return current max deviation
1485 void fill_overfull_underfull (
1487 const std::multimap
<float,int>& deviation_osd
,
1489 std::set
<int>& overfull
,
1490 std::set
<int>& more_overfull
,
1491 std::vector
<int>& underfull
,
1492 std::vector
<int>& more_underfull
1495 int pack_upmap_results(
1497 const std::set
<pg_t
>& to_unmap
,
1498 const std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int, int>>>& to_upmap
,
1499 OSDMap
& tmp_osd_map
,
1500 OSDMap::Incremental
*pending_inc
1503 std::default_random_engine
get_random_engine(
1505 std::random_device::result_type
*p_seed
1508 bool try_drop_remap_overfull(
1510 const std::vector
<pg_t
>& pgs
,
1511 const OSDMap
& tmp_osd_map
,
1513 std::map
<int,std::set
<pg_t
>>& temp_pgs_by_osd
,
1514 std::set
<pg_t
>& to_unmap
,
1515 std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int32_t,int32_t>>>& to_upmap
1518 typedef std::vector
<std::pair
<pg_t
, mempool::osdmap::vector
<std::pair
<int, int>>>>
1521 bool try_drop_remap_underfull(
1523 const candidates_t
& candidates
,
1525 std::map
<int,std::set
<pg_t
>>& temp_pgs_by_osd
,
1526 std::set
<pg_t
>& to_unmap
,
1527 std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int32_t,int32_t>>>& to_upmap
1530 void add_remap_pair(
1535 size_t pg_pool_size
,
1537 std::set
<int>& existing
,
1538 std::map
<int,std::set
<pg_t
>>& temp_pgs_by_osd
,
1539 mempool::osdmap::vector
<std::pair
<int32_t,int32_t>> new_upmap_items
,
1540 std::map
<pg_t
, mempool::osdmap::vector
<std::pair
<int32_t,int32_t>>>& to_upmap
1543 int find_best_remap (
1545 const std::vector
<int>& orig
,
1546 const std::vector
<int>& out
,
1547 const std::set
<int>& existing
,
1548 const std::map
<int,float> osd_deviation
1551 candidates_t
build_candidates(
1553 const OSDMap
& tmp_osd_map
,
1554 const std::set
<pg_t
> to_skip
,
1555 const std::set
<int64_t>& only_pools
,
1557 std::random_device::result_type
*p_seed
1561 int get_osds_by_bucket_name(const std::string
&name
, std::set
<int> *osds
) const;
1563 bool have_pg_upmaps(pg_t pg
) const {
1564 return pg_upmap
.count(pg
) ||
1565 pg_upmap_items
.count(pg
);
1568 bool check_full(const std::set
<pg_shard_t
> &missing_on
) const {
1569 for (auto shard
: missing_on
) {
1570 if (get_state(shard
.osd
) & CEPH_OSD_FULL
)
1577 * handy helpers to build simple maps...
1580 * Build an OSD map suitable for basic usage. If **num_osd** is >= 0
1581 * it will be initialized with the specified number of OSDs in a
1582 * single host. If **num_osd** is < 0 the layout of the OSD map will
1583 * be built by reading the content of the configuration file.
1585 * @param cct [in] in core ceph context
1586 * @param e [in] initial epoch
1587 * @param fsid [in] id of the cluster
1588 * @param num_osd [in] number of OSDs if >= 0 or read from conf if < 0
1589 * @return **0** on success, negative errno on error.
1592 int build_simple_optioned(CephContext
*cct
, epoch_t e
, uuid_d
&fsid
,
1593 int num_osd
, int pg_bits
, int pgp_bits
,
1596 int build_simple(CephContext
*cct
, epoch_t e
, uuid_d
&fsid
,
1598 return build_simple_optioned(cct
, e
, fsid
, num_osd
, 0, 0, false);
1600 int build_simple_with_pool(CephContext
*cct
, epoch_t e
, uuid_d
&fsid
,
1601 int num_osd
, int pg_bits
, int pgp_bits
) {
1602 return build_simple_optioned(cct
, e
, fsid
, num_osd
,
1603 pg_bits
, pgp_bits
, true);
1605 static int _build_crush_types(CrushWrapper
& crush
);
1606 static int build_simple_crush_map(CephContext
*cct
, CrushWrapper
& crush
,
1607 int num_osd
, std::ostream
*ss
);
1608 static int build_simple_crush_map_from_conf(CephContext
*cct
,
1609 CrushWrapper
& crush
,
1611 static int build_simple_crush_rules(
1612 CephContext
*cct
, CrushWrapper
& crush
,
1613 const std::string
& root
,
1616 bool crush_rule_in_use(int rule_id
) const;
1618 int validate_crush_rules(CrushWrapper
*crush
, std::ostream
*ss
) const;
1622 primary_temp
->clear();
1626 void print_osd_line(int cur
, std::ostream
*out
, ceph::Formatter
*f
) const;
1628 void print(std::ostream
& out
) const;
1629 void print_osd(int id
, std::ostream
& out
) const;
1630 void print_osds(std::ostream
& out
) const;
1631 void print_pools(std::ostream
& out
) const;
1632 void print_summary(ceph::Formatter
*f
, std::ostream
& out
,
1633 const std::string
& prefix
, bool extra
=false) const;
1634 void print_oneline_summary(std::ostream
& out
) const;
1637 DUMP_IN
= 1, // only 'in' osds
1638 DUMP_OUT
= 2, // only 'out' osds
1639 DUMP_UP
= 4, // only 'up' osds
1640 DUMP_DOWN
= 8, // only 'down' osds
1641 DUMP_DESTROYED
= 16, // only 'destroyed' osds
1643 void print_tree(ceph::Formatter
*f
, std::ostream
*out
,
1644 unsigned dump_flags
=0, std::string bucket
="") const;
1646 int summarize_mapping_stats(
1648 const std::set
<int64_t> *pools
,
1650 ceph::Formatter
*f
) const;
1652 std::string
get_flag_string() const;
1653 static std::string
get_flag_string(unsigned flags
);
1654 static void dump_erasure_code_profiles(
1655 const mempool::osdmap::map
<std::string
,std::map
<std::string
,std::string
> > &profiles
,
1656 ceph::Formatter
*f
);
1657 void dump(ceph::Formatter
*f
) const;
1658 void dump_osd(int id
, ceph::Formatter
*f
) const;
1659 void dump_osds(ceph::Formatter
*f
) const;
1660 static void generate_test_instances(std::list
<OSDMap
*>& o
);
1661 bool check_new_blocklist_entries() const { return new_blocklist_entries
; }
1663 void check_health(CephContext
*cct
, health_check_map_t
*checks
) const;
1665 int parse_osd_id_list(const std::vector
<std::string
>& ls
,
1667 std::ostream
*ss
) const;
1669 float pool_raw_used_rate(int64_t poolid
) const;
1670 std::optional
<std::string
> pending_require_osd_release() const;
1673 WRITE_CLASS_ENCODER_FEATURES(OSDMap
)
1674 WRITE_CLASS_ENCODER_FEATURES(OSDMap::Incremental
)
1677 using OSDMapRef
= boost::local_shared_ptr
<const OSDMap
>;
1679 using OSDMapRef
= std::shared_ptr
<const OSDMap
>;
1683 inline std::ostream
& operator<<(std::ostream
& out
, const OSDMap
& m
) {
1684 m
.print_oneline_summary(out
);
1690 void print_osd_utilization(const OSDMap
& osdmap
,
1695 const std::string
& filter
);