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.
22 #include "include/cpp-btree/btree_map.h"
25 * describe properties of the OSD cluster.
26 * disks, disk groups, total # osds,
29 #include "include/types.h"
30 #include "osd_types.h"
32 //#include "include/ceph_features.h"
33 #include "crush/CrushWrapper.h"
38 #include "include/memory.h"
41 // forward declaration
45 // FIXME C++11 does not have std::equal for two differently-typed containers.
46 // use this until we move to c++14
47 template<typename A
, typename B
>
48 bool vectors_equal(A a
, B b
)
51 a
.size() == b
.size() &&
53 memcmp((char*)&a
[0], (char*)&b
[0], sizeof(a
[0]) * a
.size()) == 0);
58 * we track up to two intervals during which the osd was alive and
59 * healthy. the most recent is [up_from,up_thru), where up_thru is
60 * the last epoch the osd is known to have _started_. i.e., a lower
61 * bound on the actual osd death. down_at (if it is > up_from) is an
62 * upper bound on the actual osd death.
64 * the second is the last_clean interval [first,last]. in that case,
65 * the last interval is the last epoch known to have been either
66 * _finished_, or during which the osd cleanly shut down. when
67 * possible, we push this forward to the epoch the osd was eventually
70 * the lost_at is used to allow build_prior to proceed without waiting
71 * for an osd to recover. In certain cases, progress may be blocked
72 * because an osd is down that may contain updates (i.e., a pg may have
73 * gone rw during an interval). If the osd can't be brought online, we
74 * can force things to proceed knowing that we _might_ be losing some
75 * acked writes. If the osd comes back to life later, that's fine to,
76 * but those writes will still be lost (the divergent objects will be
80 epoch_t last_clean_begin
; // last interval that ended with a clean osd shutdown
81 epoch_t last_clean_end
;
82 epoch_t up_from
; // epoch osd marked up
83 epoch_t up_thru
; // lower bound on actual osd death (if > up_from)
84 epoch_t down_at
; // upper bound on actual osd death (if > up_from)
85 epoch_t lost_at
; // last epoch we decided data was "lost"
87 osd_info_t() : last_clean_begin(0), last_clean_end(0),
88 up_from(0), up_thru(0), down_at(0), lost_at(0) {}
90 void dump(Formatter
*f
) const;
91 void encode(bufferlist
& bl
) const;
92 void decode(bufferlist::iterator
& bl
);
93 static void generate_test_instances(list
<osd_info_t
*>& o
);
95 WRITE_CLASS_ENCODER(osd_info_t
)
97 ostream
& operator<<(ostream
& out
, const osd_info_t
& info
);
100 utime_t down_stamp
; ///< timestamp when we were last marked down
101 float laggy_probability
; ///< encoded as __u32: 0 = definitely not laggy, 0xffffffff definitely laggy
102 __u32 laggy_interval
; ///< average interval between being marked laggy and recovering
103 uint64_t features
; ///< features supported by this osd we should know about
104 __u32 old_weight
; ///< weight prior to being auto marked out
106 osd_xinfo_t() : laggy_probability(0), laggy_interval(0),
107 features(0), old_weight(0) {}
109 void dump(Formatter
*f
) const;
110 void encode(bufferlist
& bl
) const;
111 void decode(bufferlist::iterator
& bl
);
112 static void generate_test_instances(list
<osd_xinfo_t
*>& o
);
114 WRITE_CLASS_ENCODER(osd_xinfo_t
)
116 ostream
& operator<<(ostream
& out
, const osd_xinfo_t
& xi
);
122 typedef btree::btree_map
<pg_t
,int32_t*> map_t
;
125 void encode(bufferlist
& bl
) const {
126 uint32_t n
= map
.size();
128 for (auto &p
: map
) {
129 ::encode(p
.first
, bl
);
130 bl
.append((char*)p
.second
, (*p
.second
+ 1) * sizeof(int32_t));
133 void decode(bufferlist::iterator
& p
) {
140 bufferlist::iterator pstart
= p
;
141 size_t start_off
= pstart
.get_off();
142 vector
<pair
<pg_t
,size_t>> offsets
;
144 for (unsigned i
=0; i
<n
; ++i
) {
147 offsets
[i
].first
= pgid
;
148 offsets
[i
].second
= p
.get_off() - start_off
;
151 p
.advance(vn
* sizeof(int32_t));
153 size_t len
= p
.get_off() - start_off
;
154 pstart
.copy(len
, data
);
155 if (data
.get_num_buffers() > 1) {
159 char *start
= data
.c_str();
160 for (auto i
: offsets
) {
161 map
.insert(map
.end(), make_pair(i
.first
, (int32_t*)(start
+ i
.second
)));
170 friend bool operator==(const PGTempMap
& l
, const PGTempMap
& r
) {
172 l
.map
.size() == r
.map
.size() &&
173 l
.data
.contents_equal(r
.data
);
177 map_t::const_iterator it
;
178 map_t::const_iterator end
;
179 pair
<pg_t
,vector
<int32_t>> current
;
180 void init_current() {
182 current
.first
= it
->first
;
184 current
.second
.resize(*it
->second
);
185 int32_t *p
= it
->second
+ 1;
186 for (int n
= 0; n
< *it
->second
; ++n
, ++p
) {
187 current
.second
[n
] = *p
;
192 iterator(map_t::const_iterator p
,
193 map_t::const_iterator e
)
198 const pair
<pg_t
,vector
<int32_t>>& operator*() const {
201 const pair
<pg_t
,vector
<int32_t>>* operator->() const {
204 friend bool operator==(const iterator
& l
, const iterator
& r
) {
207 friend bool operator!=(const iterator
& l
, const iterator
& r
) {
210 iterator
& operator++() {
216 iterator
operator++(int) {
224 iterator
begin() const {
225 return iterator(map
.begin(), map
.end());
227 iterator
end() const {
228 return iterator(map
.end(), map
.end());
230 iterator
find(pg_t pgid
) const {
231 return iterator(map
.find(pgid
), map
.end());
233 size_t size() const {
236 size_t count(pg_t pgid
) const {
237 return map
.count(pgid
);
239 void erase(pg_t pgid
) {
246 void set(pg_t pgid
, const mempool::osdmap::vector
<int32_t>& v
) {
247 size_t need
= sizeof(int32_t) * (1 + v
.size());
248 if (need
< data
.get_append_buffer_unused_tail_length()) {
249 bufferptr
z(data
.get_append_buffer_unused_tail_length());
251 data
.append(z
.c_str(), z
.length());
254 map
[pgid
] = (int32_t*)(data
.back().end_c_str()) - (1 + v
.size());
256 mempool::osdmap::vector
<int32_t> get(pg_t pgid
) {
257 mempool::osdmap::vector
<int32_t> v
;
258 int32_t *p
= map
[pgid
];
261 for (size_t i
= 0; i
< n
; ++i
, ++p
) {
267 // trivial implementation
268 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> > pg_temp
;
270 void encode(bufferlist
& bl
) const {
271 ::encode(pg_temp
, bl
);
273 void decode(bufferlist::iterator
& p
) {
274 ::decode(pg_temp
, p
);
276 friend bool operator==(const PGTempMap
& l
, const PGTempMap
& r
) {
278 l
.pg_temp
.size() == r
.pg_temp
.size() &&
279 l
.pg_temp
== r
.pg_temp
;
283 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> >::const_iterator it
;
285 iterator(mempool::osdmap::map
<pg_t
,
286 mempool::osdmap::vector
<int32_t> >::const_iterator p
)
289 pair
<pg_t
,const mempool::osdmap::vector
<int32_t>&> operator*() const {
292 const pair
<const pg_t
,mempool::osdmap::vector
<int32_t>>* operator->() const {
295 friend bool operator==(const iterator
& l
, const iterator
& r
) {
298 friend bool operator!=(const iterator
& l
, const iterator
& r
) {
301 iterator
& operator++() {
305 iterator
operator++(int) {
311 iterator
begin() const {
312 return iterator(pg_temp
.cbegin());
314 iterator
end() const {
315 return iterator(pg_temp
.cend());
317 iterator
find(pg_t pgid
) const {
318 return iterator(pg_temp
.find(pgid
));
320 size_t size() const {
321 return pg_temp
.size();
323 size_t count(pg_t pgid
) const {
324 return pg_temp
.count(pgid
);
326 void erase(pg_t pgid
) {
332 void set(pg_t pgid
, const mempool::osdmap::vector
<int32_t>& v
) {
335 const mempool::osdmap::vector
<int32_t>& get(pg_t pgid
) {
336 return pg_temp
.at(pgid
);
339 void dump(Formatter
*f
) const {
340 for (const auto &pg
: *this) {
341 f
->open_object_section("osds");
342 f
->dump_stream("pgid") << pg
.first
;
343 f
->open_array_section("osds");
344 for (const auto osd
: pg
.second
)
345 f
->dump_int("osd", osd
);
351 WRITE_CLASS_ENCODER(PGTempMap
)
357 MEMPOOL_CLASS_HELPERS();
361 MEMPOOL_CLASS_HELPERS();
363 /// feature bits we were encoded with. the subsequent OSDMap
364 /// encoding should match.
365 uint64_t encode_features
;
367 epoch_t epoch
; // new epoch; we are a diff from epoch-1 to epoch
369 int64_t new_pool_max
; //incremented by the OSDMonitor on each pool create
371 int8_t new_require_osd_release
= -1;
374 bufferlist fullmap
; // in lieu of below.
379 mempool::osdmap::map
<int64_t,pg_pool_t
> new_pools
;
380 mempool::osdmap::map
<int64_t,string
> new_pool_names
;
381 mempool::osdmap::set
<int64_t> old_pools
;
382 mempool::osdmap::map
<string
,map
<string
,string
> > new_erasure_code_profiles
;
383 mempool::osdmap::vector
<string
> old_erasure_code_profiles
;
384 mempool::osdmap::map
<int32_t,entity_addr_t
> new_up_client
;
385 mempool::osdmap::map
<int32_t,entity_addr_t
> new_up_cluster
;
386 mempool::osdmap::map
<int32_t,uint32_t> new_state
; // XORed onto previous state.
387 mempool::osdmap::map
<int32_t,uint32_t> new_weight
;
388 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t> > new_pg_temp
; // [] to remove
389 mempool::osdmap::map
<pg_t
, int32_t> new_primary_temp
; // [-1] to remove
390 mempool::osdmap::map
<int32_t,uint32_t> new_primary_affinity
;
391 mempool::osdmap::map
<int32_t,epoch_t
> new_up_thru
;
392 mempool::osdmap::map
<int32_t,pair
<epoch_t
,epoch_t
> > new_last_clean_interval
;
393 mempool::osdmap::map
<int32_t,epoch_t
> new_lost
;
394 mempool::osdmap::map
<int32_t,uuid_d
> new_uuid
;
395 mempool::osdmap::map
<int32_t,osd_xinfo_t
> new_xinfo
;
397 mempool::osdmap::map
<entity_addr_t
,utime_t
> new_blacklist
;
398 mempool::osdmap::vector
<entity_addr_t
> old_blacklist
;
399 mempool::osdmap::map
<int32_t, entity_addr_t
> new_hb_back_up
;
400 mempool::osdmap::map
<int32_t, entity_addr_t
> new_hb_front_up
;
402 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t>> new_pg_upmap
;
403 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<pair
<int32_t,int32_t>>> new_pg_upmap_items
;
404 mempool::osdmap::set
<pg_t
> old_pg_upmap
, old_pg_upmap_items
;
406 string cluster_snapshot
;
408 float new_nearfull_ratio
= -1;
409 float new_backfillfull_ratio
= -1;
410 float new_full_ratio
= -1;
412 int8_t new_require_min_compat_client
= -1;
414 mutable bool have_crc
; ///< crc values are defined
415 uint32_t full_crc
; ///< crc of the resulting OSDMap
416 mutable uint32_t inc_crc
; ///< crc of this incremental
418 int get_net_marked_out(const OSDMap
*previous
) const;
419 int get_net_marked_down(const OSDMap
*previous
) const;
420 int identify_osd(uuid_d u
) const;
422 void encode_client_old(bufferlist
& bl
) const;
423 void encode_classic(bufferlist
& bl
, uint64_t features
) const;
424 void encode(bufferlist
& bl
, uint64_t features
=CEPH_FEATURES_ALL
) const;
425 void decode_classic(bufferlist::iterator
&p
);
426 void decode(bufferlist::iterator
&bl
);
427 void dump(Formatter
*f
) const;
428 static void generate_test_instances(list
<Incremental
*>& o
);
430 explicit Incremental(epoch_t e
=0) :
432 epoch(e
), new_pool_max(-1), new_flags(-1), new_max_osd(-1),
433 have_crc(false), full_crc(0), inc_crc(0) {
434 memset(&fsid
, 0, sizeof(fsid
));
436 explicit Incremental(bufferlist
&bl
) {
437 bufferlist::iterator p
= bl
.begin();
440 explicit Incremental(bufferlist::iterator
&p
) {
444 pg_pool_t
*get_new_pool(int64_t pool
, const pg_pool_t
*orig
) {
445 if (new_pools
.count(pool
) == 0)
446 new_pools
[pool
] = *orig
;
447 return &new_pools
[pool
];
449 bool has_erasure_code_profile(const string
&name
) const {
450 auto i
= new_erasure_code_profiles
.find(name
);
451 return i
!= new_erasure_code_profiles
.end();
453 void set_erasure_code_profile(const string
&name
,
454 const map
<string
,string
>& profile
) {
455 new_erasure_code_profiles
[name
] = profile
;
458 /// propage update pools' snap metadata to any of their tiers
459 int propagate_snaps_to_tiers(CephContext
*cct
, const OSDMap
&base
);
461 /// filter out osds with any pending state changing
462 size_t get_pending_state_osds(vector
<int> *osds
) {
466 for (auto &p
: new_state
) {
467 osds
->push_back(p
.first
);
473 bool pending_osd_has_state(int osd
, unsigned state
) {
474 return new_state
.count(osd
) && (new_state
[osd
] & state
) != 0;
477 void pending_osd_state_set(int osd
, unsigned state
) {
478 new_state
[osd
] |= state
;
481 // cancel the specified pending osd state if there is any
482 // return ture on success, false otherwise.
483 bool pending_osd_state_clear(int osd
, unsigned state
) {
484 if (!pending_osd_has_state(osd
, state
)) {
485 // never has been set or already has been cancelled.
489 new_state
[osd
] &= ~state
;
497 epoch_t epoch
; // what epoch of the osd cluster descriptor is this
498 utime_t created
, modified
; // epoch start time
499 int32_t pool_max
; // the largest pool num, ever
503 int num_osd
; // not saved; see calc_num_osds
504 int num_up_osd
; // not saved; see calc_num_osds
505 int num_in_osd
; // not saved; see calc_num_osds
508 vector
<uint32_t> osd_state
;
511 mempool::osdmap::vector
<ceph::shared_ptr
<entity_addr_t
> > client_addr
;
512 mempool::osdmap::vector
<ceph::shared_ptr
<entity_addr_t
> > cluster_addr
;
513 mempool::osdmap::vector
<ceph::shared_ptr
<entity_addr_t
> > hb_back_addr
;
514 mempool::osdmap::vector
<ceph::shared_ptr
<entity_addr_t
> > hb_front_addr
;
517 ceph::shared_ptr
<addrs_s
> osd_addrs
;
519 mempool::osdmap::vector
<__u32
> osd_weight
; // 16.16 fixed point, 0x10000 = "in", 0 = "out"
520 mempool::osdmap::vector
<osd_info_t
> osd_info
;
521 ceph::shared_ptr
<PGTempMap
> pg_temp
; // temp pg mapping (e.g. while we rebuild)
522 ceph::shared_ptr
< mempool::osdmap::map
<pg_t
,int32_t > > primary_temp
; // temp primary mapping (e.g. while we rebuild)
523 ceph::shared_ptr
< mempool::osdmap::vector
<__u32
> > osd_primary_affinity
; ///< 16.16 fixed point, 0x10000 = baseline
525 // remap (post-CRUSH, pre-up)
526 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<int32_t>> pg_upmap
; ///< remap pg
527 mempool::osdmap::map
<pg_t
,mempool::osdmap::vector
<pair
<int32_t,int32_t>>> pg_upmap_items
; ///< remap osds in up set
529 mempool::osdmap::map
<int64_t,pg_pool_t
> pools
;
530 mempool::osdmap::map
<int64_t,string
> pool_name
;
531 mempool::osdmap::map
<string
,map
<string
,string
> > erasure_code_profiles
;
532 mempool::osdmap::map
<string
,int64_t> name_pool
;
534 ceph::shared_ptr
< mempool::osdmap::vector
<uuid_d
> > osd_uuid
;
535 mempool::osdmap::vector
<osd_xinfo_t
> osd_xinfo
;
537 mempool::osdmap::unordered_map
<entity_addr_t
,utime_t
> blacklist
;
539 epoch_t cluster_snapshot_epoch
;
540 string cluster_snapshot
;
541 bool new_blacklist_entries
;
543 float full_ratio
= 0, backfillfull_ratio
= 0, nearfull_ratio
= 0;
545 /// min compat client we want to support
546 uint8_t require_min_compat_client
= 0; // CEPH_RELEASE_*
549 /// require osds to run at least this release
550 uint8_t require_osd_release
= 0; // CEPH_RELEASE_*
553 mutable uint64_t cached_up_osd_features
;
555 mutable bool crc_defined
;
556 mutable uint32_t crc
;
558 void _calc_up_osd_features();
561 bool have_crc() const { return crc_defined
; }
562 uint32_t get_crc() const { return crc
; }
564 ceph::shared_ptr
<CrushWrapper
> crush
; // hierarchical map
566 uint32_t crush_version
= 1;
568 friend class OSDMonitor
;
574 num_osd(0), num_up_osd(0), num_in_osd(0),
576 osd_addrs(std::make_shared
<addrs_s
>()),
577 pg_temp(std::make_shared
<PGTempMap
>()),
578 primary_temp(std::make_shared
<mempool::osdmap::map
<pg_t
,int32_t>>()),
579 osd_uuid(std::make_shared
<mempool::osdmap::vector
<uuid_d
>>()),
580 cluster_snapshot_epoch(0),
581 new_blacklist_entries(false),
582 cached_up_osd_features(0),
583 crc_defined(false), crc(0),
584 crush(std::make_shared
<CrushWrapper
>()) {
585 memset(&fsid
, 0, sizeof(fsid
));
590 OSDMap(const OSDMap
& other
) = default;
591 OSDMap
& operator=(const OSDMap
& other
) = default;
594 void deepish_copy_from(const OSDMap
& o
) {
596 primary_temp
.reset(new mempool::osdmap::map
<pg_t
,int32_t>(*o
.primary_temp
));
597 pg_temp
.reset(new PGTempMap(*o
.pg_temp
));
598 osd_uuid
.reset(new mempool::osdmap::vector
<uuid_d
>(*o
.osd_uuid
));
600 if (o
.osd_primary_affinity
)
601 osd_primary_affinity
.reset(new mempool::osdmap::vector
<__u32
>(*o
.osd_primary_affinity
));
603 // NOTE: this still references shared entity_addr_t's.
604 osd_addrs
.reset(new addrs_s(*o
.osd_addrs
));
606 // NOTE: we do not copy crush. note that apply_incremental will
607 // allocate a new CrushWrapper, though.
611 const uuid_d
& get_fsid() const { return fsid
; }
612 void set_fsid(uuid_d
& f
) { fsid
= f
; }
614 epoch_t
get_epoch() const { return epoch
; }
615 void inc_epoch() { epoch
++; }
617 void set_epoch(epoch_t e
);
619 uint32_t get_crush_version() const {
620 return crush_version
;
624 const utime_t
& get_created() const { return created
; }
625 const utime_t
& get_modified() const { return modified
; }
627 bool is_blacklisted(const entity_addr_t
& a
) const;
628 void get_blacklist(list
<pair
<entity_addr_t
,utime_t
> > *bl
) const;
629 void get_blacklist(std::set
<entity_addr_t
> *bl
) const;
631 string
get_cluster_snapshot() const {
632 if (cluster_snapshot_epoch
== epoch
)
633 return cluster_snapshot
;
637 float get_full_ratio() const {
640 float get_backfillfull_ratio() const {
641 return backfillfull_ratio
;
643 float get_nearfull_ratio() const {
644 return nearfull_ratio
;
646 void count_full_nearfull_osds(int *full
, int *backfill
, int *nearfull
) const;
647 void get_full_osd_util(
648 const mempool::pgmap::unordered_map
<int32_t,osd_stat_t
> &osd_stat
,
649 map
<int, float> *full
,
650 map
<int, float> *backfill
,
651 map
<int, float> *nearfull
) const;
653 void get_full_osd_counts(set
<int> *full
, set
<int> *backfill
,
654 set
<int> *nearfull
) const;
657 /***** cluster state *****/
659 int get_max_osd() const { return max_osd
; }
660 void set_max_osd(int m
);
662 unsigned get_num_osds() const {
665 unsigned get_num_up_osds() const {
668 unsigned get_num_in_osds() const {
671 /// recalculate cached values for get_num{,_up,_in}_osds
674 void get_all_osds(set
<int32_t>& ls
) const;
675 void get_up_osds(set
<int32_t>& ls
) const;
676 void get_out_osds(set
<int32_t>& ls
) const;
677 unsigned get_num_pg_temp() const {
678 return pg_temp
->size();
681 int get_flags() const { return flags
; }
682 bool test_flag(int f
) const { return flags
& f
; }
683 void set_flag(int f
) { flags
|= f
; }
684 void clear_flag(int f
) { flags
&= ~f
; }
686 static void calc_state_set(int state
, set
<string
>& st
);
688 int get_state(int o
) const {
692 int get_state(int o
, set
<string
>& st
) const {
694 unsigned t
= osd_state
[o
];
695 calc_state_set(t
, st
);
698 void set_state(int o
, unsigned s
) {
702 void set_weight(int o
, unsigned w
) {
706 osd_state
[o
] |= CEPH_OSD_EXISTS
;
708 unsigned get_weight(int o
) const {
710 return osd_weight
[o
];
712 float get_weightf(int o
) const {
713 return (float)get_weight(o
) / (float)CEPH_OSD_IN
;
715 void adjust_osd_weights(const map
<int,double>& weights
, Incremental
& inc
) const;
717 void set_primary_affinity(int o
, int w
) {
719 if (!osd_primary_affinity
)
720 osd_primary_affinity
.reset(
721 new mempool::osdmap::vector
<__u32
>(
722 max_osd
, CEPH_OSD_DEFAULT_PRIMARY_AFFINITY
));
723 (*osd_primary_affinity
)[o
] = w
;
725 unsigned get_primary_affinity(int o
) const {
727 if (!osd_primary_affinity
)
728 return CEPH_OSD_DEFAULT_PRIMARY_AFFINITY
;
729 return (*osd_primary_affinity
)[o
];
731 float get_primary_affinityf(int o
) const {
732 return (float)get_primary_affinity(o
) / (float)CEPH_OSD_MAX_PRIMARY_AFFINITY
;
735 bool has_erasure_code_profile(const string
&name
) const {
736 auto i
= erasure_code_profiles
.find(name
);
737 return i
!= erasure_code_profiles
.end();
739 int get_erasure_code_profile_default(CephContext
*cct
,
740 map
<string
,string
> &profile_map
,
742 void set_erasure_code_profile(const string
&name
,
743 const map
<string
,string
>& profile
) {
744 erasure_code_profiles
[name
] = profile
;
746 const map
<string
,string
> &get_erasure_code_profile(
747 const string
&name
) const {
748 static map
<string
,string
> empty
;
749 auto i
= erasure_code_profiles
.find(name
);
750 if (i
== erasure_code_profiles
.end())
755 const mempool::osdmap::map
<string
,map
<string
,string
> > &get_erasure_code_profiles() const {
756 return erasure_code_profiles
;
759 bool exists(int osd
) const {
761 return osd
>= 0 && osd
< max_osd
&& (osd_state
[osd
] & CEPH_OSD_EXISTS
);
764 bool is_destroyed(int osd
) const {
765 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_DESTROYED
);
768 bool is_up(int osd
) const {
769 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_UP
);
772 bool has_been_up_since(int osd
, epoch_t epoch
) const {
773 return is_up(osd
) && get_up_from(osd
) <= epoch
;
776 bool is_down(int osd
) const {
780 bool is_out(int osd
) const {
781 return !exists(osd
) || get_weight(osd
) == CEPH_OSD_OUT
;
784 bool is_in(int osd
) const {
788 bool is_noup(int osd
) const {
789 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOUP
);
792 bool is_nodown(int osd
) const {
793 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NODOWN
);
796 bool is_noin(int osd
) const {
797 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOIN
);
800 bool is_noout(int osd
) const {
801 return exists(osd
) && (osd_state
[osd
] & CEPH_OSD_NOOUT
);
804 void get_noup_osds(vector
<int> *osds
) const {
808 for (int i
= 0; i
< max_osd
; i
++) {
815 void get_nodown_osds(vector
<int> *osds
) const {
819 for (int i
= 0; i
< max_osd
; i
++) {
826 void get_noin_osds(vector
<int> *osds
) const {
830 for (int i
= 0; i
< max_osd
; i
++) {
837 void get_noout_osds(vector
<int> *osds
) const {
841 for (int i
= 0; i
< max_osd
; i
++) {
849 * check if an entire crush subtree is down
851 bool subtree_is_down(int id
, set
<int> *down_cache
) const;
852 bool containing_subtree_is_down(CephContext
*cct
, int osd
, int subtree_type
, set
<int> *down_cache
) const;
854 bool subtree_type_is_down(CephContext
*cct
, int id
, int subtree_type
, set
<int> *down_in_osds
, set
<int> *up_in_osds
,
855 set
<int> *subtree_up
, unordered_map
<int, set
<int> > *subtree_type_down
) const;
857 int identify_osd(const entity_addr_t
& addr
) const;
858 int identify_osd(const uuid_d
& u
) const;
859 int identify_osd_on_all_channels(const entity_addr_t
& addr
) const;
861 bool have_addr(const entity_addr_t
& addr
) const {
862 return identify_osd(addr
) >= 0;
864 int find_osd_on_ip(const entity_addr_t
& ip
) const;
865 const entity_addr_t
&get_addr(int osd
) const {
867 return osd_addrs
->client_addr
[osd
] ? *osd_addrs
->client_addr
[osd
] : osd_addrs
->blank
;
869 const entity_addr_t
&get_cluster_addr(int osd
) const {
871 if (!osd_addrs
->cluster_addr
[osd
] || *osd_addrs
->cluster_addr
[osd
] == entity_addr_t())
872 return get_addr(osd
);
873 return *osd_addrs
->cluster_addr
[osd
];
875 const entity_addr_t
&get_hb_back_addr(int osd
) const {
877 return osd_addrs
->hb_back_addr
[osd
] ? *osd_addrs
->hb_back_addr
[osd
] : osd_addrs
->blank
;
879 const entity_addr_t
&get_hb_front_addr(int osd
) const {
881 return osd_addrs
->hb_front_addr
[osd
] ? *osd_addrs
->hb_front_addr
[osd
] : osd_addrs
->blank
;
883 entity_inst_t
get_most_recent_inst(int osd
) const {
885 return entity_inst_t(entity_name_t::OSD(osd
), get_addr(osd
));
887 entity_inst_t
get_inst(int osd
) const {
889 return get_most_recent_inst(osd
);
891 entity_inst_t
get_cluster_inst(int osd
) const {
893 return entity_inst_t(entity_name_t::OSD(osd
), get_cluster_addr(osd
));
895 entity_inst_t
get_hb_back_inst(int osd
) const {
897 return entity_inst_t(entity_name_t::OSD(osd
), get_hb_back_addr(osd
));
899 entity_inst_t
get_hb_front_inst(int osd
) const {
901 return entity_inst_t(entity_name_t::OSD(osd
), get_hb_front_addr(osd
));
904 const uuid_d
& get_uuid(int osd
) const {
906 return (*osd_uuid
)[osd
];
909 const epoch_t
& get_up_from(int osd
) const {
911 return osd_info
[osd
].up_from
;
913 const epoch_t
& get_up_thru(int osd
) const {
915 return osd_info
[osd
].up_thru
;
917 const epoch_t
& get_down_at(int osd
) const {
919 return osd_info
[osd
].down_at
;
921 const osd_info_t
& get_info(int osd
) const {
922 assert(osd
< max_osd
);
923 return osd_info
[osd
];
926 const osd_xinfo_t
& get_xinfo(int osd
) const {
927 assert(osd
< max_osd
);
928 return osd_xinfo
[osd
];
931 int get_next_up_osd_after(int n
) const {
932 if (get_max_osd() == 0)
934 for (int i
= n
+ 1; i
!= n
; ++i
) {
935 if (i
>= get_max_osd())
945 int get_previous_up_osd_before(int n
) const {
946 if (get_max_osd() == 0)
948 for (int i
= n
- 1; i
!= n
; --i
) {
950 i
= get_max_osd() - 1;
960 * get feature bits required by the current structure
962 * @param entity_type [in] what entity type we are asking about
963 * @param mask [out] set of all possible map-related features we could set
964 * @return feature bits used by this map
966 uint64_t get_features(int entity_type
, uint64_t *mask
) const;
969 * get oldest *client* version (firefly, hammer, etc.) that can connect given
970 * the feature bits required (according to get_features()).
972 uint8_t get_min_compat_client() const;
975 * get intersection of features supported by up osds
977 uint64_t get_up_osd_features() const;
979 int apply_incremental(const Incremental
&inc
);
981 /// try to re-use/reference addrs in oldmap from newmap
982 static void dedup(const OSDMap
*oldmap
, OSDMap
*newmap
);
984 static void clean_temps(CephContext
*cct
, const OSDMap
& osdmap
,
985 Incremental
*pending_inc
);
987 // serialize, unserialize
989 void encode_client_old(bufferlist
& bl
) const;
990 void encode_classic(bufferlist
& bl
, uint64_t features
) const;
991 void decode_classic(bufferlist::iterator
& p
);
994 void encode(bufferlist
& bl
, uint64_t features
=CEPH_FEATURES_ALL
) const;
995 void decode(bufferlist
& bl
);
996 void decode(bufferlist::iterator
& bl
);
999 /**** mapping facilities ****/
1004 const string
& nspace
,
1006 int object_locator_to_pg(const object_t
& oid
, const object_locator_t
& loc
,
1008 pg_t
object_locator_to_pg(const object_t
& oid
,
1009 const object_locator_t
& loc
) const {
1011 int ret
= object_locator_to_pg(oid
, loc
, pg
);
1017 static object_locator_t
file_to_object_locator(const file_layout_t
& layout
) {
1018 return object_locator_t(layout
.pool_id
, layout
.pool_ns
);
1021 ceph_object_layout
file_to_object_layout(object_t oid
,
1022 file_layout_t
& layout
) const {
1023 return make_object_layout(oid
, layout
.pool_id
, layout
.pool_ns
);
1026 ceph_object_layout
make_object_layout(object_t oid
, int pg_pool
,
1027 string nspace
) const;
1029 int get_pg_num(int pg_pool
) const
1031 const pg_pool_t
*pool
= get_pg_pool(pg_pool
);
1032 assert(NULL
!= pool
);
1033 return pool
->get_pg_num();
1036 bool pg_exists(pg_t pgid
) const {
1037 const pg_pool_t
*p
= get_pg_pool(pgid
.pool());
1038 return p
&& pgid
.ps() < p
->get_pg_num();
1042 /// pg -> (raw osd list)
1043 void _pg_to_raw_osds(
1044 const pg_pool_t
& pool
, pg_t pg
,
1047 int _pick_primary(const vector
<int>& osds
) const;
1048 void _remove_nonexistent_osds(const pg_pool_t
& pool
, vector
<int>& osds
) const;
1050 void _apply_primary_affinity(ps_t seed
, const pg_pool_t
& pool
,
1051 vector
<int> *osds
, int *primary
) const;
1053 /// apply pg_upmap[_items] mappings
1054 void _apply_remap(const pg_pool_t
& pi
, pg_t pg
, vector
<int> *raw
) const;
1056 /// pg -> (up osd list)
1057 void _raw_to_up_osds(const pg_pool_t
& pool
, const vector
<int>& raw
,
1058 vector
<int> *up
) const;
1062 * Get the pg and primary temp, if they are specified.
1063 * @param temp_pg [out] Will be empty or contain the temp PG mapping on return
1064 * @param temp_primary [out] Will be the value in primary_temp, or a value derived
1065 * from the pg_temp (if specified), or -1 if you should use the calculated (up_)primary.
1067 void _get_temp_osds(const pg_pool_t
& pool
, pg_t pg
,
1068 vector
<int> *temp_pg
, int *temp_primary
) const;
1071 * map to up and acting. Fills in whatever fields are non-NULL.
1073 void _pg_to_up_acting_osds(const pg_t
& pg
, vector
<int> *up
, int *up_primary
,
1074 vector
<int> *acting
, int *acting_primary
,
1075 bool raw_pg_to_pg
= true) const;
1079 * This is suitable only for looking at raw CRUSH outputs. It skips
1080 * applying the temp and up checks and should not be used
1081 * by anybody for data mapping purposes.
1082 * raw and primary must be non-NULL
1084 void pg_to_raw_osds(pg_t pg
, vector
<int> *raw
, int *primary
) const;
1085 /// map a pg to its acting set. @return acting set size
1086 void pg_to_acting_osds(const pg_t
& pg
, vector
<int> *acting
,
1087 int *acting_primary
) const {
1088 _pg_to_up_acting_osds(pg
, NULL
, NULL
, acting
, acting_primary
);
1090 void pg_to_acting_osds(pg_t pg
, vector
<int>& acting
) const {
1091 return pg_to_acting_osds(pg
, &acting
, NULL
);
1094 * This does not apply temp overrides and should not be used
1095 * by anybody for data mapping purposes. Specify both pointers.
1097 void pg_to_raw_up(pg_t pg
, vector
<int> *up
, int *primary
) const;
1099 * map a pg to its acting set as well as its up set. You must use
1100 * the acting set for data mapping purposes, but some users will
1101 * also find the up set useful for things like deciding what to
1103 * Each of these pointers must be non-NULL.
1105 void pg_to_up_acting_osds(pg_t pg
, vector
<int> *up
, int *up_primary
,
1106 vector
<int> *acting
, int *acting_primary
) const {
1107 _pg_to_up_acting_osds(pg
, up
, up_primary
, acting
, acting_primary
);
1109 void pg_to_up_acting_osds(pg_t pg
, vector
<int>& up
, vector
<int>& acting
) const {
1110 int up_primary
, acting_primary
;
1111 pg_to_up_acting_osds(pg
, &up
, &up_primary
, &acting
, &acting_primary
);
1113 bool pg_is_ec(pg_t pg
) const {
1114 auto i
= pools
.find(pg
.pool());
1115 assert(i
!= pools
.end());
1116 return i
->second
.ec_pool();
1118 bool get_primary_shard(const pg_t
& pgid
, spg_t
*out
) const {
1119 auto i
= get_pools().find(pgid
.pool());
1120 if (i
== get_pools().end()) {
1123 if (!i
->second
.ec_pool()) {
1129 pg_to_acting_osds(pgid
, &acting
, &primary
);
1130 for (uint8_t i
= 0; i
< acting
.size(); ++i
) {
1131 if (acting
[i
] == primary
) {
1132 *out
= spg_t(pgid
, shard_id_t(i
));
1139 int64_t lookup_pg_pool_name(const string
& name
) const {
1140 auto p
= name_pool
.find(name
);
1141 if (p
== name_pool
.end())
1146 int64_t get_pool_max() const {
1149 const mempool::osdmap::map
<int64_t,pg_pool_t
>& get_pools() const {
1152 mempool::osdmap::map
<int64_t,pg_pool_t
>& get_pools() {
1155 const string
& get_pool_name(int64_t p
) const {
1156 auto i
= pool_name
.find(p
);
1157 assert(i
!= pool_name
.end());
1160 bool have_pg_pool(int64_t p
) const {
1161 return pools
.count(p
);
1163 const pg_pool_t
* get_pg_pool(int64_t p
) const {
1164 auto i
= pools
.find(p
);
1165 if (i
!= pools
.end())
1169 unsigned get_pg_size(pg_t pg
) const {
1170 auto p
= pools
.find(pg
.pool());
1171 assert(p
!= pools
.end());
1172 return p
->second
.get_size();
1174 int get_pg_type(pg_t pg
) const {
1175 auto p
= pools
.find(pg
.pool());
1176 assert(p
!= pools
.end());
1177 return p
->second
.get_type();
1181 pg_t
raw_pg_to_pg(pg_t pg
) const {
1182 auto p
= pools
.find(pg
.pool());
1183 assert(p
!= pools
.end());
1184 return p
->second
.raw_pg_to_pg(pg
);
1187 // pg -> acting primary osd
1188 int get_pg_acting_primary(pg_t pg
) const {
1190 _pg_to_up_acting_osds(pg
, nullptr, nullptr, nullptr, &primary
);
1195 * check whether an spg_t maps to a particular osd
1197 bool is_up_acting_osd_shard(spg_t pg
, int osd
) const {
1198 vector
<int> up
, acting
;
1199 _pg_to_up_acting_osds(pg
.pgid
, &up
, NULL
, &acting
, NULL
, false);
1200 if (pg
.shard
== shard_id_t::NO_SHARD
) {
1201 if (calc_pg_role(osd
, acting
, acting
.size()) >= 0 ||
1202 calc_pg_role(osd
, up
, up
.size()) >= 0)
1205 if (pg
.shard
< (int)acting
.size() && acting
[pg
.shard
] == osd
)
1207 if (pg
.shard
< (int)up
.size() && up
[pg
.shard
] == osd
)
1214 /* what replica # is a given osd? 0 primary, -1 for none. */
1215 static int calc_pg_rank(int osd
, const vector
<int>& acting
, int nrep
=0);
1216 static int calc_pg_role(int osd
, const vector
<int>& acting
, int nrep
=0);
1217 static bool primary_changed(
1219 const vector
<int> &oldacting
,
1221 const vector
<int> &newacting
);
1223 /* rank is -1 (stray), 0 (primary), 1,2,3,... (replica) */
1224 int get_pg_acting_rank(pg_t pg
, int osd
) const {
1226 pg_to_acting_osds(pg
, group
);
1227 return calc_pg_rank(osd
, group
, group
.size());
1229 /* role is -1 (stray), 0 (primary), 1 (replica) */
1230 int get_pg_acting_role(const pg_t
& pg
, int osd
) const {
1232 pg_to_acting_osds(pg
, group
);
1233 return calc_pg_role(osd
, group
, group
.size());
1236 bool osd_is_valid_op_target(pg_t pg
, int osd
) const {
1239 pg_to_acting_osds(pg
, &group
, &primary
);
1245 return calc_pg_role(osd
, group
, group
.size()) >= 0;
1248 int clean_pg_upmaps(
1250 Incremental
*pending_inc
);
1254 pg_t pg
, ///< pg to potentially remap
1255 const set
<int>& overfull
, ///< osds we'd want to evacuate
1256 const vector
<int>& underfull
, ///< osds to move to, in order of preference
1258 vector
<int> *out
); ///< resulting alternative mapping
1262 float max_deviation
, ///< max deviation from target (value < 1.0)
1263 int max_iterations
, ///< max iterations to run
1264 const set
<int64_t>& pools
, ///< [optional] restrict to pool
1265 Incremental
*pending_inc
1268 int get_osds_by_bucket_name(const string
&name
, set
<int> *osds
) const;
1271 * handy helpers to build simple maps...
1274 * Build an OSD map suitable for basic usage. If **num_osd** is >= 0
1275 * it will be initialized with the specified number of OSDs in a
1276 * single host. If **num_osd** is < 0 the layout of the OSD map will
1277 * be built by reading the content of the configuration file.
1279 * @param cct [in] in core ceph context
1280 * @param e [in] initial epoch
1281 * @param fsid [in] id of the cluster
1282 * @param num_osd [in] number of OSDs if >= 0 or read from conf if < 0
1283 * @return **0** on success, negative errno on error.
1285 int build_simple(CephContext
*cct
, epoch_t e
, uuid_d
&fsid
,
1286 int num_osd
, int pg_bits
, int pgp_bits
);
1287 static int _build_crush_types(CrushWrapper
& crush
);
1288 static int build_simple_crush_map(CephContext
*cct
, CrushWrapper
& crush
,
1289 int num_osd
, ostream
*ss
);
1290 static int build_simple_crush_map_from_conf(CephContext
*cct
,
1291 CrushWrapper
& crush
,
1293 static int build_simple_crush_rules(
1294 CephContext
*cct
, CrushWrapper
& crush
,
1298 bool crush_ruleset_in_use(int ruleset
) const;
1302 primary_temp
->clear();
1306 void print_osd_line(int cur
, ostream
*out
, Formatter
*f
) const;
1308 void print(ostream
& out
) const;
1309 void print_pools(ostream
& out
) const;
1310 void print_summary(Formatter
*f
, ostream
& out
) const;
1311 void print_oneline_summary(ostream
& out
) const;
1314 DUMP_IN
= 1, // only 'in' osds
1315 DUMP_OUT
= 2, // only 'out' osds
1316 DUMP_UP
= 4, // only 'up' osds
1317 DUMP_DOWN
= 8, // only 'down' osds
1319 void print_tree(Formatter
*f
, ostream
*out
, unsigned dump_flags
=0) const;
1321 int summarize_mapping_stats(
1323 const set
<int64_t> *pools
,
1325 Formatter
*f
) const;
1327 string
get_flag_string() const;
1328 static string
get_flag_string(unsigned flags
);
1329 static void dump_erasure_code_profiles(
1330 const mempool::osdmap::map
<string
,map
<string
,string
> > &profiles
,
1332 void dump(Formatter
*f
) const;
1333 static void generate_test_instances(list
<OSDMap
*>& o
);
1334 bool check_new_blacklist_entries() const { return new_blacklist_entries
; }
1336 WRITE_CLASS_ENCODER_FEATURES(OSDMap
)
1337 WRITE_CLASS_ENCODER_FEATURES(OSDMap::Incremental
)
1339 typedef ceph::shared_ptr
<const OSDMap
> OSDMapRef
;
1341 inline ostream
& operator<<(ostream
& out
, const OSDMap
& m
) {
1342 m
.print_oneline_summary(out
);
1346 class PGStatService
;
1348 void print_osd_utilization(const OSDMap
& osdmap
,
1349 const PGStatService
*pgstat
,