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>
8 * This is free software; you can redistribute it and/or
9 * modify it under the terms of the GNU Lesser General Public
10 * License version 2.1, as published by the Free Software
11 * Foundation. See file COPYING.
16 // #include "msg/Messenger.h"
17 #include "messages/MOSDRepScrub.h"
18 // #include "common/cmdparse.h"
19 // #include "common/ceph_context.h"
21 #include "common/errno.h"
22 #include "common/config.h"
24 #include "OpRequest.h"
25 #include "ScrubStore.h"
28 #include "common/Timer.h"
29 #include "common/perf_counters.h"
31 #include "messages/MOSDOp.h"
32 #include "messages/MOSDPGNotify.h"
33 // #include "messages/MOSDPGLog.h"
34 #include "messages/MOSDPGRemove.h"
35 #include "messages/MOSDPGInfo.h"
36 #include "messages/MOSDPGTrim.h"
37 #include "messages/MOSDPGScan.h"
38 #include "messages/MOSDPGBackfill.h"
39 #include "messages/MOSDPGBackfillRemove.h"
40 #include "messages/MBackfillReserve.h"
41 #include "messages/MRecoveryReserve.h"
42 #include "messages/MOSDPGPush.h"
43 #include "messages/MOSDPGPushReply.h"
44 #include "messages/MOSDPGPull.h"
45 #include "messages/MOSDECSubOpWrite.h"
46 #include "messages/MOSDECSubOpWriteReply.h"
47 #include "messages/MOSDECSubOpRead.h"
48 #include "messages/MOSDECSubOpReadReply.h"
49 #include "messages/MOSDPGUpdateLogMissing.h"
50 #include "messages/MOSDPGUpdateLogMissingReply.h"
51 #include "messages/MOSDBackoff.h"
52 #include "messages/MOSDScrubReserve.h"
53 #include "messages/MOSDSubOp.h"
54 #include "messages/MOSDRepOp.h"
55 #include "messages/MOSDSubOpReply.h"
56 #include "messages/MOSDRepOpReply.h"
57 #include "messages/MOSDRepScrubMap.h"
58 #include "messages/MOSDPGRecoveryDelete.h"
59 #include "messages/MOSDPGRecoveryDeleteReply.h"
61 #include "common/BackTrace.h"
62 #include "common/EventTrace.h"
65 #define TRACEPOINT_DEFINE
66 #define TRACEPOINT_PROBE_DYNAMIC_LINKAGE
67 #include "tracing/pg.h"
68 #undef TRACEPOINT_PROBE_DYNAMIC_LINKAGE
69 #undef TRACEPOINT_DEFINE
71 #define tracepoint(...)
76 #define dout_context cct
77 #define dout_subsys ceph_subsys_osd
79 #define dout_prefix _prefix(_dout, this)
81 // prefix pgmeta_oid keys with _ so that PGLog::read_log_and_missing() can
83 const string
infover_key("_infover");
84 const string
info_key("_info");
85 const string
biginfo_key("_biginfo");
86 const string
epoch_key("_epoch");
87 const string
fastinfo_key("_fastinfo");
90 static ostream
& _prefix(std::ostream
*_dout
, T
*t
)
92 return *_dout
<< t
->gen_prefix();
95 MEMPOOL_DEFINE_OBJECT_FACTORY(PG::CephPeeringEvt
, pg_peering_evt
, osd
);
97 void PGStateHistory::enter(PG
* pg
, const utime_t entime
, const char* state
)
99 // Ignore trimming state machine for now
100 if (::strstr(state
, "Trimming") != NULL
) {
102 } else if (pi
!= nullptr) {
103 pi
->enter_state(entime
, state
);
105 // Store current state since we can't reliably take the PG lock here
106 if ( tmppi
== nullptr) {
107 tmppi
= std::unique_ptr
<PGStateInstance
>(new PGStateInstance
);
111 tmppi
->enter_state(entime
, state
);
115 void PGStateHistory::exit(const char* state
) {
116 // Ignore trimming state machine for now
117 // Do nothing if PG is being destroyed!
118 if (::strstr(state
, "Trimming") != NULL
|| pg_in_destructor
) {
121 bool ilocked
= false;
122 if(!thispg
->is_locked()) {
127 buffer
.push_back(std::unique_ptr
<PGStateInstance
>(tmppi
.release()));
128 pi
= buffer
.back().get();
129 pi
->setepoch(thispg
->get_osdmap()->get_epoch());
132 pi
->exit_state(ceph_clock_now());
133 if (::strcmp(state
, "Reset") == 0) {
142 void PGStateHistory::dump(Formatter
* f
) const {
143 f
->open_array_section("history");
144 for (auto pi
= buffer
.begin(); pi
!= buffer
.end(); ++pi
) {
145 f
->open_object_section("states");
146 f
->dump_stream("epoch") << (*pi
)->this_epoch
;
147 for (auto she
: (*pi
)->state_history
) {
148 f
->dump_string("state", std::get
<2>(she
));
149 f
->dump_stream("enter") << std::get
<0>(she
);
150 f
->dump_stream("exit") << std::get
<1>(she
);
157 void PG::get(const char* tag
)
161 Mutex::Locker
l(_ref_id_lock
);
166 void PG::put(const char* tag
)
170 Mutex::Locker
l(_ref_id_lock
);
171 auto tag_counts_entry
= _tag_counts
.find(tag
);
172 assert(tag_counts_entry
!= _tag_counts
.end());
173 --tag_counts_entry
->second
;
174 if (tag_counts_entry
->second
== 0) {
175 _tag_counts
.erase(tag_counts_entry
);
184 uint64_t PG::get_with_id()
187 Mutex::Locker
l(_ref_id_lock
);
188 uint64_t id
= ++_ref_id
;
192 dout(20) << __func__
<< ": " << info
.pgid
<< " got id " << id
<< " (new) ref==" << ref
<< dendl
;
193 assert(!_live_ids
.count(id
));
194 _live_ids
.insert(make_pair(id
, ss
.str()));
198 void PG::put_with_id(uint64_t id
)
200 dout(20) << __func__
<< ": " << info
.pgid
<< " put id " << id
<< " (current) ref==" << ref
<< dendl
;
202 Mutex::Locker
l(_ref_id_lock
);
203 assert(_live_ids
.count(id
));
210 void PG::dump_live_ids()
212 Mutex::Locker
l(_ref_id_lock
);
213 dout(0) << "\t" << __func__
<< ": " << info
.pgid
<< " live ids:" << dendl
;
214 for (map
<uint64_t, string
>::iterator i
= _live_ids
.begin();
215 i
!= _live_ids
.end();
217 dout(0) << "\t\tid: " << *i
<< dendl
;
219 dout(0) << "\t" << __func__
<< ": " << info
.pgid
<< " live tags:" << dendl
;
220 for (map
<string
, uint64_t>::iterator i
= _tag_counts
.begin();
221 i
!= _tag_counts
.end();
223 dout(0) << "\t\tid: " << *i
<< dendl
;
229 void PGPool::update(OSDMapRef map
)
231 const pg_pool_t
*pi
= map
->get_pg_pool(id
);
235 name
= map
->get_pool_name(id
);
236 bool updated
= false;
237 if ((map
->get_epoch() != cached_epoch
+ 1) ||
238 (pi
->get_snap_epoch() == map
->get_epoch())) {
240 pi
->build_removed_snaps(newly_removed_snaps
);
241 interval_set
<snapid_t
> intersection
;
242 intersection
.intersection_of(newly_removed_snaps
, cached_removed_snaps
);
243 if (intersection
== cached_removed_snaps
) {
244 newly_removed_snaps
.subtract(cached_removed_snaps
);
245 cached_removed_snaps
.union_of(newly_removed_snaps
);
247 lgeneric_subdout(cct
, osd
, 0) << __func__
248 << " cached_removed_snaps shrank from " << cached_removed_snaps
249 << " to " << newly_removed_snaps
<< dendl
;
250 cached_removed_snaps
= newly_removed_snaps
;
251 newly_removed_snaps
.clear();
253 snapc
= pi
->get_snap_context();
255 /* 1) map->get_epoch() == cached_epoch + 1 &&
256 * 2) pi->get_snap_epoch() != map->get_epoch()
258 * From the if branch, 1 && 2 must be true. From 2, we know that
259 * this map didn't change the set of removed snaps. From 1, we
260 * know that our cached_removed_snaps matches the previous map.
261 * Thus, from 1 && 2, cached_removed snaps matches the current
262 * set of removed snaps and all we have to do is clear
263 * newly_removed_snaps.
265 newly_removed_snaps
.clear();
267 cached_epoch
= map
->get_epoch();
268 lgeneric_subdout(cct
, osd
, 20)
269 << "PGPool::update cached_removed_snaps "
270 << cached_removed_snaps
271 << " newly_removed_snaps "
272 << newly_removed_snaps
273 << " snapc " << snapc
274 << (updated
? " (updated)":" (no change)")
278 PG::PG(OSDService
*o
, OSDMapRef curmap
,
279 const PGPool
&_pool
, spg_t p
) :
282 osdriver(osd
->store
, coll_t(), OSD::make_snapmapper_oid()),
287 p
.get_split_bits(curmap
->get_pg_num(_pool
.id
)),
290 osdmap_ref(curmap
), last_persisted_osdmap_ref(curmap
), pool(_pool
),
293 _ref_id_lock("PG::_ref_id_lock"), _ref_id(0),
296 trace_endpoint("0.0.0.0", 0, "PG"),
297 dirty_info(false), dirty_big_info(false),
302 pgmeta_oid(p
.make_pgmeta_oid()),
305 curmap
->get_pools().at(p
.pgid
.pool()).ec_pool(),
307 stat_queue_item(this),
309 recovery_queued(false),
310 recovery_ops_active(0),
314 pg_whoami(osd
->whoami
, p
.shard
),
316 last_peering_reset(0),
317 heartbeat_peer_lock("PG::heartbeat_peer_lock"),
318 backfill_reserved(false),
319 backfill_reserving(false),
320 flushes_in_progress(0),
321 pg_stats_publish_lock("PG::pg_stats_publish_lock"),
322 pg_stats_publish_valid(false),
323 osr(osd
->osr_registry
.lookup_or_create(p
, (stringify(p
)))),
324 finish_sync_event(NULL
),
325 backoff_lock("PG::backoff_lock"),
326 scrub_after_recovery(false),
328 recovery_state(this),
330 peer_features(CEPH_FEATURES_SUPPORTED_DEFAULT
),
331 acting_features(CEPH_FEATURES_SUPPORTED_DEFAULT
),
332 upacting_features(CEPH_FEATURES_SUPPORTED_DEFAULT
),
336 osd
->add_pgid(p
, this);
339 std::stringstream ss
;
340 ss
<< "PG " << info
.pgid
;
341 trace_endpoint
.copy_name(ss
.str());
348 pgstate_history
.set_pg_in_destructor();
350 osd
->remove_pgid(info
.pgid
, this);
354 void PG::lock_suspend_timeout(ThreadPool::TPHandle
&handle
)
356 handle
.suspend_tp_timeout();
358 handle
.reset_tp_timeout();
361 void PG::lock(bool no_lockdep
) const
363 _lock
.Lock(no_lockdep
);
364 // if we have unrecorded dirty state with the lock dropped, there is a bug
366 assert(!dirty_big_info
);
368 dout(30) << "lock" << dendl
;
371 std::string
PG::gen_prefix() const
374 OSDMapRef mapref
= osdmap_ref
;
375 if (_lock
.is_locked_by_me()) {
376 out
<< "osd." << osd
->whoami
377 << " pg_epoch: " << (mapref
? mapref
->get_epoch():0)
378 << " " << *this << " ";
380 out
<< "osd." << osd
->whoami
381 << " pg_epoch: " << (mapref
? mapref
->get_epoch():0)
382 << " pg[" << info
.pgid
<< "(unlocked)] ";
387 /********* PG **********/
389 void PG::proc_master_log(
390 ObjectStore::Transaction
& t
, pg_info_t
&oinfo
,
391 pg_log_t
&olog
, pg_missing_t
& omissing
, pg_shard_t from
)
393 dout(10) << "proc_master_log for osd." << from
<< ": "
394 << olog
<< " " << omissing
<< dendl
;
395 assert(!is_peered() && is_primary());
397 // merge log into our own log to build master log. no need to
398 // make any adjustments to their missing map; we are taking their
399 // log to be authoritative (i.e., their entries are by definitely
401 merge_log(t
, oinfo
, olog
, from
);
402 peer_info
[from
] = oinfo
;
403 dout(10) << " peer osd." << from
<< " now " << oinfo
<< " " << omissing
<< dendl
;
404 might_have_unfound
.insert(from
);
406 // See doc/dev/osd_internals/last_epoch_started
407 if (oinfo
.last_epoch_started
> info
.last_epoch_started
) {
408 info
.last_epoch_started
= oinfo
.last_epoch_started
;
411 if (oinfo
.last_interval_started
> info
.last_interval_started
) {
412 info
.last_interval_started
= oinfo
.last_interval_started
;
415 update_history(oinfo
.history
);
416 assert(cct
->_conf
->osd_find_best_info_ignore_history_les
||
417 info
.last_epoch_started
>= info
.history
.last_epoch_started
);
419 peer_missing
[from
].claim(omissing
);
422 void PG::proc_replica_log(
424 const pg_log_t
&olog
,
425 pg_missing_t
& omissing
,
428 dout(10) << "proc_replica_log for osd." << from
<< ": "
429 << oinfo
<< " " << olog
<< " " << omissing
<< dendl
;
431 pg_log
.proc_replica_log(oinfo
, olog
, omissing
, from
);
433 peer_info
[from
] = oinfo
;
434 dout(10) << " peer osd." << from
<< " now " << oinfo
<< " " << omissing
<< dendl
;
435 might_have_unfound
.insert(from
);
437 for (map
<hobject_t
, pg_missing_item
>::const_iterator i
=
438 omissing
.get_items().begin();
439 i
!= omissing
.get_items().end();
441 dout(20) << " after missing " << i
->first
<< " need " << i
->second
.need
442 << " have " << i
->second
.have
<< dendl
;
444 peer_missing
[from
].claim(omissing
);
447 bool PG::proc_replica_info(
448 pg_shard_t from
, const pg_info_t
&oinfo
, epoch_t send_epoch
)
450 map
<pg_shard_t
, pg_info_t
>::iterator p
= peer_info
.find(from
);
451 if (p
!= peer_info
.end() && p
->second
.last_update
== oinfo
.last_update
) {
452 dout(10) << " got dup osd." << from
<< " info " << oinfo
<< ", identical to ours" << dendl
;
456 if (!get_osdmap()->has_been_up_since(from
.osd
, send_epoch
)) {
457 dout(10) << " got info " << oinfo
<< " from down osd." << from
458 << " discarding" << dendl
;
462 dout(10) << " got osd." << from
<< " " << oinfo
<< dendl
;
463 assert(is_primary());
464 peer_info
[from
] = oinfo
;
465 might_have_unfound
.insert(from
);
467 update_history(oinfo
.history
);
470 if (!is_up(from
) && !is_acting(from
)) {
471 dout(10) << " osd." << from
<< " has stray content: " << oinfo
<< dendl
;
472 stray_set
.insert(from
);
478 // was this a new info? if so, update peers!
479 if (p
== peer_info
.end())
480 update_heartbeat_peers();
485 void PG::remove_snap_mapped_object(
486 ObjectStore::Transaction
&t
, const hobject_t
&soid
)
490 ghobject_t(soid
, ghobject_t::NO_GEN
, pg_whoami
.shard
));
491 clear_object_snap_mapping(&t
, soid
);
494 void PG::clear_object_snap_mapping(
495 ObjectStore::Transaction
*t
, const hobject_t
&soid
)
497 OSDriver::OSTransaction
_t(osdriver
.get_transaction(t
));
498 if (soid
.snap
< CEPH_MAXSNAP
) {
499 int r
= snap_mapper
.remove_oid(
502 if (!(r
== 0 || r
== -ENOENT
)) {
503 derr
<< __func__
<< ": remove_oid returned " << cpp_strerror(r
) << dendl
;
509 void PG::update_object_snap_mapping(
510 ObjectStore::Transaction
*t
, const hobject_t
&soid
, const set
<snapid_t
> &snaps
)
512 OSDriver::OSTransaction
_t(osdriver
.get_transaction(t
));
513 assert(soid
.snap
< CEPH_MAXSNAP
);
514 int r
= snap_mapper
.remove_oid(
517 if (!(r
== 0 || r
== -ENOENT
)) {
518 derr
<< __func__
<< ": remove_oid returned " << cpp_strerror(r
) << dendl
;
528 ObjectStore::Transaction
& t
, pg_info_t
&oinfo
, pg_log_t
&olog
, pg_shard_t from
)
530 PGLogEntryHandler rollbacker
{this, &t
};
532 oinfo
, olog
, from
, info
, &rollbacker
, dirty_info
, dirty_big_info
);
535 void PG::rewind_divergent_log(ObjectStore::Transaction
& t
, eversion_t newhead
)
537 PGLogEntryHandler rollbacker
{this, &t
};
538 pg_log
.rewind_divergent_log(
539 newhead
, info
, &rollbacker
, dirty_info
, dirty_big_info
);
543 * Process information from a replica to determine if it could have any
544 * objects that i need.
546 * TODO: if the missing set becomes very large, this could get expensive.
547 * Instead, we probably want to just iterate over our unfound set.
549 bool PG::search_for_missing(
550 const pg_info_t
&oinfo
, const pg_missing_t
&omissing
,
554 uint64_t num_unfound_before
= missing_loc
.num_unfound();
555 bool found_missing
= missing_loc
.add_source_info(
556 from
, oinfo
, omissing
, ctx
->handle
);
557 if (found_missing
&& num_unfound_before
!= missing_loc
.num_unfound())
558 publish_stats_to_osd();
560 (get_osdmap()->get_features(CEPH_ENTITY_TYPE_OSD
, NULL
) &
561 CEPH_FEATURE_OSD_ERASURE_CODES
)) {
562 pg_info_t
tinfo(oinfo
);
563 tinfo
.pgid
.shard
= pg_whoami
.shard
;
564 (*(ctx
->info_map
))[from
.osd
].push_back(
567 from
.shard
, pg_whoami
.shard
,
568 get_osdmap()->get_epoch(),
569 get_osdmap()->get_epoch(),
573 return found_missing
;
576 bool PG::MissingLoc::readable_with_acting(
577 const hobject_t
&hoid
,
578 const set
<pg_shard_t
> &acting
) const {
579 if (!needs_recovery(hoid
))
581 if (is_deleted(hoid
))
583 auto missing_loc_entry
= missing_loc
.find(hoid
);
584 if (missing_loc_entry
== missing_loc
.end())
586 const set
<pg_shard_t
> &locs
= missing_loc_entry
->second
;
587 ldout(pg
->cct
, 10) << __func__
<< ": locs:" << locs
<< dendl
;
588 set
<pg_shard_t
> have_acting
;
589 for (set
<pg_shard_t
>::const_iterator i
= locs
.begin();
592 if (acting
.count(*i
))
593 have_acting
.insert(*i
);
595 return (*is_readable
)(have_acting
);
598 void PG::MissingLoc::add_batch_sources_info(
599 const set
<pg_shard_t
> &sources
, ThreadPool::TPHandle
* handle
)
601 ldout(pg
->cct
, 10) << __func__
<< ": adding sources in batch "
602 << sources
.size() << dendl
;
604 for (map
<hobject_t
, pg_missing_item
>::const_iterator i
= needs_recovery_map
.begin();
605 i
!= needs_recovery_map
.end();
607 if (handle
&& ++loop
>= pg
->cct
->_conf
->osd_loop_before_reset_tphandle
) {
608 handle
->reset_tp_timeout();
611 if (i
->second
.is_delete())
613 missing_loc
[i
->first
].insert(sources
.begin(), sources
.end());
614 missing_loc_sources
.insert(sources
.begin(), sources
.end());
618 bool PG::MissingLoc::add_source_info(
620 const pg_info_t
&oinfo
,
621 const pg_missing_t
&omissing
,
622 ThreadPool::TPHandle
* handle
)
624 bool found_missing
= false;
627 for (map
<hobject_t
,pg_missing_item
>::const_iterator p
= needs_recovery_map
.begin();
628 p
!= needs_recovery_map
.end();
630 const hobject_t
&soid(p
->first
);
631 eversion_t need
= p
->second
.need
;
632 if (handle
&& ++loop
>= pg
->cct
->_conf
->osd_loop_before_reset_tphandle
) {
633 handle
->reset_tp_timeout();
636 if (p
->second
.is_delete()) {
637 ldout(pg
->cct
, 10) << __func__
<< " " << soid
638 << " delete, ignoring source" << dendl
;
639 found_missing
= true;
642 if (oinfo
.last_update
< need
) {
643 ldout(pg
->cct
, 10) << "search_for_missing " << soid
<< " " << need
644 << " also missing on osd." << fromosd
645 << " (last_update " << oinfo
.last_update
646 << " < needed " << need
<< ")" << dendl
;
649 if (!oinfo
.last_backfill
.is_max() &&
650 !oinfo
.last_backfill_bitwise
) {
651 ldout(pg
->cct
, 10) << "search_for_missing " << soid
<< " " << need
652 << " also missing on osd." << fromosd
653 << " (last_backfill " << oinfo
.last_backfill
654 << " but with wrong sort order)"
658 if (p
->first
>= oinfo
.last_backfill
) {
659 // FIXME: this is _probably_ true, although it could conceivably
660 // be in the undefined region! Hmm!
661 ldout(pg
->cct
, 10) << "search_for_missing " << soid
<< " " << need
662 << " also missing on osd." << fromosd
663 << " (past last_backfill " << oinfo
.last_backfill
667 if (oinfo
.last_complete
< need
) {
668 if (omissing
.is_missing(soid
)) {
669 ldout(pg
->cct
, 10) << "search_for_missing " << soid
<< " " << need
670 << " also missing on osd." << fromosd
<< dendl
;
675 ldout(pg
->cct
, 10) << "search_for_missing " << soid
<< " " << need
676 << " is on osd." << fromosd
<< dendl
;
678 missing_loc
[soid
].insert(fromosd
);
679 missing_loc_sources
.insert(fromosd
);
680 found_missing
= true;
683 ldout(pg
->cct
, 20) << "needs_recovery_map missing " << needs_recovery_map
685 return found_missing
;
688 void PG::discover_all_missing(map
<int, map
<spg_t
,pg_query_t
> > &query_map
)
690 auto &missing
= pg_log
.get_missing();
691 uint64_t unfound
= get_num_unfound();
694 dout(10) << __func__
<< " "
695 << missing
.num_missing() << " missing, "
696 << unfound
<< " unfound"
699 std::set
<pg_shard_t
>::const_iterator m
= might_have_unfound
.begin();
700 std::set
<pg_shard_t
>::const_iterator mend
= might_have_unfound
.end();
701 for (; m
!= mend
; ++m
) {
704 if (!get_osdmap()->is_up(peer
.osd
)) {
705 dout(20) << __func__
<< " skipping down osd." << peer
<< dendl
;
709 map
<pg_shard_t
, pg_info_t
>::const_iterator iter
= peer_info
.find(peer
);
710 if (iter
!= peer_info
.end() &&
711 (iter
->second
.is_empty() || iter
->second
.dne())) {
712 // ignore empty peers
716 // If we've requested any of this stuff, the pg_missing_t information
717 // should be on its way.
718 // TODO: coalsce requested_* into a single data structure
719 if (peer_missing
.find(peer
) != peer_missing
.end()) {
720 dout(20) << __func__
<< ": osd." << peer
721 << ": we already have pg_missing_t" << dendl
;
724 if (peer_log_requested
.find(peer
) != peer_log_requested
.end()) {
725 dout(20) << __func__
<< ": osd." << peer
726 << ": in peer_log_requested" << dendl
;
729 if (peer_missing_requested
.find(peer
) != peer_missing_requested
.end()) {
730 dout(20) << __func__
<< ": osd." << peer
731 << ": in peer_missing_requested" << dendl
;
736 dout(10) << __func__
<< ": osd." << peer
<< ": requesting pg_missing_t"
738 peer_missing_requested
.insert(peer
);
739 query_map
[peer
.osd
][spg_t(info
.pgid
.pgid
, peer
.shard
)] =
742 peer
.shard
, pg_whoami
.shard
,
743 info
.history
, get_osdmap()->get_epoch());
747 /******* PG ***********/
748 bool PG::needs_recovery() const
750 assert(is_primary());
752 auto &missing
= pg_log
.get_missing();
754 if (missing
.num_missing()) {
755 dout(10) << __func__
<< " primary has " << missing
.num_missing()
756 << " missing" << dendl
;
760 assert(!actingbackfill
.empty());
761 set
<pg_shard_t
>::const_iterator end
= actingbackfill
.end();
762 set
<pg_shard_t
>::const_iterator a
= actingbackfill
.begin();
763 for (; a
!= end
; ++a
) {
764 if (*a
== get_primary()) continue;
765 pg_shard_t peer
= *a
;
766 map
<pg_shard_t
, pg_missing_t
>::const_iterator pm
= peer_missing
.find(peer
);
767 if (pm
== peer_missing
.end()) {
768 dout(10) << __func__
<< " osd." << peer
<< " doesn't have missing set"
772 if (pm
->second
.num_missing()) {
773 dout(10) << __func__
<< " osd." << peer
<< " has "
774 << pm
->second
.num_missing() << " missing" << dendl
;
779 dout(10) << __func__
<< " is recovered" << dendl
;
783 bool PG::needs_backfill() const
785 assert(is_primary());
787 // We can assume that only possible osds that need backfill
788 // are on the backfill_targets vector nodes.
789 set
<pg_shard_t
>::const_iterator end
= backfill_targets
.end();
790 set
<pg_shard_t
>::const_iterator a
= backfill_targets
.begin();
791 for (; a
!= end
; ++a
) {
792 pg_shard_t peer
= *a
;
793 map
<pg_shard_t
, pg_info_t
>::const_iterator pi
= peer_info
.find(peer
);
794 if (!pi
->second
.last_backfill
.is_max()) {
795 dout(10) << __func__
<< " osd." << peer
<< " has last_backfill " << pi
->second
.last_backfill
<< dendl
;
800 dout(10) << __func__
<< " does not need backfill" << dendl
;
805 void PG::check_past_interval_bounds() const
807 auto rpib
= get_required_past_interval_bounds(
809 osd
->get_superblock().oldest_map
);
810 if (rpib
.first
>= rpib
.second
) {
811 if (!past_intervals
.empty()) {
812 osd
->clog
->error() << info
.pgid
<< " required past_interval bounds are"
813 << " empty [" << rpib
<< ") but past_intervals is not: "
815 derr
<< info
.pgid
<< " required past_interval bounds are"
816 << " empty [" << rpib
<< ") but past_intervals is not: "
817 << past_intervals
<< dendl
;
820 if (past_intervals
.empty()) {
821 osd
->clog
->error() << info
.pgid
<< " required past_interval bounds are"
822 << " not empty [" << rpib
<< ") but past_intervals "
823 << past_intervals
<< " is empty";
824 derr
<< info
.pgid
<< " required past_interval bounds are"
825 << " not empty [" << rpib
<< ") but past_intervals "
826 << past_intervals
<< " is empty" << dendl
;
827 assert(!past_intervals
.empty());
830 auto apib
= past_intervals
.get_bounds();
831 if (apib
.first
> rpib
.first
) {
832 osd
->clog
->error() << info
.pgid
<< " past_intervals [" << apib
833 << ") start interval does not contain the required"
834 << " bound [" << rpib
<< ") start";
835 derr
<< info
.pgid
<< " past_intervals [" << apib
836 << ") start interval does not contain the required"
837 << " bound [" << rpib
<< ") start" << dendl
;
838 assert(0 == "past_interval start interval mismatch");
840 if (apib
.second
!= rpib
.second
) {
841 osd
->clog
->error() << info
.pgid
<< " past_interal bound [" << apib
842 << ") end does not match required [" << rpib
844 derr
<< info
.pgid
<< " past_interal bound [" << apib
845 << ") end does not match required [" << rpib
847 assert(0 == "past_interval end mismatch");
852 bool PG::adjust_need_up_thru(const OSDMapRef osdmap
)
854 epoch_t up_thru
= osdmap
->get_up_thru(osd
->whoami
);
856 up_thru
>= info
.history
.same_interval_since
) {
857 dout(10) << "adjust_need_up_thru now " << up_thru
<< ", need_up_thru now false" << dendl
;
858 need_up_thru
= false;
864 void PG::remove_down_peer_info(const OSDMapRef osdmap
)
866 // Remove any downed osds from peer_info
867 bool removed
= false;
868 map
<pg_shard_t
, pg_info_t
>::iterator p
= peer_info
.begin();
869 while (p
!= peer_info
.end()) {
870 if (!osdmap
->is_up(p
->first
.osd
)) {
871 dout(10) << " dropping down osd." << p
->first
<< " info " << p
->second
<< dendl
;
872 peer_missing
.erase(p
->first
);
873 peer_log_requested
.erase(p
->first
);
874 peer_missing_requested
.erase(p
->first
);
875 peer_info
.erase(p
++);
881 // if we removed anyone, update peers (which include peer_info)
883 update_heartbeat_peers();
884 check_recovery_sources(osdmap
);
888 * Returns true unless there is a non-lost OSD in might_have_unfound.
890 bool PG::all_unfound_are_queried_or_lost(const OSDMapRef osdmap
) const
892 assert(is_primary());
894 set
<pg_shard_t
>::const_iterator peer
= might_have_unfound
.begin();
895 set
<pg_shard_t
>::const_iterator mend
= might_have_unfound
.end();
896 for (; peer
!= mend
; ++peer
) {
897 if (peer_missing
.count(*peer
))
899 map
<pg_shard_t
, pg_info_t
>::const_iterator iter
= peer_info
.find(*peer
);
900 if (iter
!= peer_info
.end() &&
901 (iter
->second
.is_empty() || iter
->second
.dne()))
903 if (!osdmap
->exists(peer
->osd
))
905 const osd_info_t
&osd_info(osdmap
->get_info(peer
->osd
));
906 if (osd_info
.lost_at
<= osd_info
.up_from
) {
907 // If there is even one OSD in might_have_unfound that isn't lost, we
908 // still might retrieve our unfound.
912 dout(10) << "all_unfound_are_queried_or_lost all of might_have_unfound " << might_have_unfound
913 << " have been queried or are marked lost" << dendl
;
917 PastIntervals::PriorSet
PG::build_prior()
921 for (map
<pg_shard_t
,pg_info_t
>::iterator it
= peer_info
.begin();
922 it
!= peer_info
.end();
924 assert(info
.history
.last_epoch_started
>= it
->second
.history
.last_epoch_started
);
928 const OSDMap
&osdmap
= *get_osdmap();
929 PastIntervals::PriorSet prior
= past_intervals
.get_prior_set(
931 info
.history
.last_epoch_started
,
932 get_pgbackend()->get_is_recoverable_predicate(),
933 [&](epoch_t start
, int osd
, epoch_t
*lost_at
) {
934 const osd_info_t
*pinfo
= 0;
935 if (osdmap
.exists(osd
)) {
936 pinfo
= &osdmap
.get_info(osd
);
938 *lost_at
= pinfo
->lost_at
;
941 if (osdmap
.is_up(osd
)) {
942 return PastIntervals::UP
;
944 return PastIntervals::DNE
;
945 } else if (pinfo
->lost_at
> start
) {
946 return PastIntervals::LOST
;
948 return PastIntervals::DOWN
;
956 state_set(PG_STATE_DOWN
);
959 if (get_osdmap()->get_up_thru(osd
->whoami
) < info
.history
.same_interval_since
) {
960 dout(10) << "up_thru " << get_osdmap()->get_up_thru(osd
->whoami
)
961 << " < same_since " << info
.history
.same_interval_since
962 << ", must notify monitor" << dendl
;
965 dout(10) << "up_thru " << get_osdmap()->get_up_thru(osd
->whoami
)
966 << " >= same_since " << info
.history
.same_interval_since
967 << ", all is well" << dendl
;
968 need_up_thru
= false;
970 set_probe_targets(prior
.probe
);
974 void PG::clear_primary_state()
976 dout(10) << "clear_primary_state" << dendl
;
978 // clear peering state
980 peer_log_requested
.clear();
981 peer_missing_requested
.clear();
983 peer_missing
.clear();
984 need_up_thru
= false;
985 peer_last_complete_ondisk
.clear();
986 peer_activated
.clear();
987 min_last_complete_ondisk
= eversion_t();
988 pg_trim_to
= eversion_t();
989 might_have_unfound
.clear();
990 projected_log
= PGLog::IndexedLog();
992 last_update_ondisk
= eversion_t();
996 finish_sync_event
= 0; // so that _finish_recovery doesn't go off in another thread
1000 release_pg_backoffs();
1002 pg_log
.reset_recovery_pointers();
1004 scrubber
.reserved_peers
.clear();
1005 scrub_after_recovery
= false;
1010 PG::Scrubber::Scrubber()
1011 : reserved(false), reserve_failed(false),
1014 waiting_on(0), shallow_errors(0), deep_errors(0), fixed(0),
1015 must_scrub(false), must_deep_scrub(false), must_repair(false),
1017 num_digest_updates_pending(0),
1023 PG::Scrubber::~Scrubber() {}
1028 * Returns an iterator to the best info in infos sorted by:
1029 * 1) Prefer newer last_update
1030 * 2) Prefer longer tail if it brings another info into contiguity
1031 * 3) Prefer current primary
1033 map
<pg_shard_t
, pg_info_t
>::const_iterator
PG::find_best_info(
1034 const map
<pg_shard_t
, pg_info_t
> &infos
,
1035 bool restrict_to_up_acting
,
1036 bool *history_les_bound
) const
1038 assert(history_les_bound
);
1039 /* See doc/dev/osd_internals/last_epoch_started.rst before attempting
1040 * to make changes to this process. Also, make sure to update it
1041 * when you find bugs! */
1042 eversion_t min_last_update_acceptable
= eversion_t::max();
1043 epoch_t max_last_epoch_started_found
= 0;
1044 for (map
<pg_shard_t
, pg_info_t
>::const_iterator i
= infos
.begin();
1047 if (!cct
->_conf
->osd_find_best_info_ignore_history_les
&&
1048 max_last_epoch_started_found
< i
->second
.history
.last_epoch_started
) {
1049 *history_les_bound
= true;
1050 max_last_epoch_started_found
= i
->second
.history
.last_epoch_started
;
1052 if (!i
->second
.is_incomplete() &&
1053 max_last_epoch_started_found
< i
->second
.last_epoch_started
) {
1054 max_last_epoch_started_found
= i
->second
.last_epoch_started
;
1057 for (map
<pg_shard_t
, pg_info_t
>::const_iterator i
= infos
.begin();
1060 if (max_last_epoch_started_found
<= i
->second
.last_epoch_started
) {
1061 if (min_last_update_acceptable
> i
->second
.last_update
)
1062 min_last_update_acceptable
= i
->second
.last_update
;
1065 if (min_last_update_acceptable
== eversion_t::max())
1068 map
<pg_shard_t
, pg_info_t
>::const_iterator best
= infos
.end();
1069 // find osd with newest last_update (oldest for ec_pool).
1070 // if there are multiples, prefer
1071 // - a longer tail, if it brings another peer into log contiguity
1072 // - the current primary
1073 for (map
<pg_shard_t
, pg_info_t
>::const_iterator p
= infos
.begin();
1076 if (restrict_to_up_acting
&& !is_up(p
->first
) &&
1077 !is_acting(p
->first
))
1079 // Only consider peers with last_update >= min_last_update_acceptable
1080 if (p
->second
.last_update
< min_last_update_acceptable
)
1082 // Disqualify anyone with a too old last_epoch_started
1083 if (p
->second
.last_epoch_started
< max_last_epoch_started_found
)
1085 // Disqualify anyone who is incomplete (not fully backfilled)
1086 if (p
->second
.is_incomplete())
1088 if (best
== infos
.end()) {
1092 // Prefer newer last_update
1093 if (pool
.info
.require_rollback()) {
1094 if (p
->second
.last_update
> best
->second
.last_update
)
1096 if (p
->second
.last_update
< best
->second
.last_update
) {
1101 if (p
->second
.last_update
< best
->second
.last_update
)
1103 if (p
->second
.last_update
> best
->second
.last_update
) {
1109 // Prefer longer tail
1110 if (p
->second
.log_tail
> best
->second
.log_tail
) {
1112 } else if (p
->second
.log_tail
< best
->second
.log_tail
) {
1117 // prefer current primary (usually the caller), all things being equal
1118 if (p
->first
== pg_whoami
) {
1119 dout(10) << "calc_acting prefer osd." << p
->first
1120 << " because it is current primary" << dendl
;
1128 void PG::calc_ec_acting(
1129 map
<pg_shard_t
, pg_info_t
>::const_iterator auth_log_shard
,
1131 const vector
<int> &acting
,
1132 pg_shard_t acting_primary
,
1133 const vector
<int> &up
,
1134 pg_shard_t up_primary
,
1135 const map
<pg_shard_t
, pg_info_t
> &all_info
,
1136 bool restrict_to_up_acting
,
1138 set
<pg_shard_t
> *backfill
,
1139 set
<pg_shard_t
> *acting_backfill
,
1140 pg_shard_t
*want_primary
,
1143 vector
<int> want(size
, CRUSH_ITEM_NONE
);
1144 map
<shard_id_t
, set
<pg_shard_t
> > all_info_by_shard
;
1145 unsigned usable
= 0;
1146 for (map
<pg_shard_t
, pg_info_t
>::const_iterator i
= all_info
.begin();
1147 i
!= all_info
.end();
1149 all_info_by_shard
[i
->first
.shard
].insert(i
->first
);
1151 for (uint8_t i
= 0; i
< want
.size(); ++i
) {
1152 ss
<< "For position " << (unsigned)i
<< ": ";
1153 if (up
.size() > (unsigned)i
&& up
[i
] != CRUSH_ITEM_NONE
&&
1154 !all_info
.find(pg_shard_t(up
[i
], shard_id_t(i
)))->second
.is_incomplete() &&
1155 all_info
.find(pg_shard_t(up
[i
], shard_id_t(i
)))->second
.last_update
>=
1156 auth_log_shard
->second
.log_tail
) {
1157 ss
<< " selecting up[i]: " << pg_shard_t(up
[i
], shard_id_t(i
)) << std::endl
;
1162 if (up
.size() > (unsigned)i
&& up
[i
] != CRUSH_ITEM_NONE
) {
1163 ss
<< " backfilling up[i]: " << pg_shard_t(up
[i
], shard_id_t(i
))
1165 backfill
->insert(pg_shard_t(up
[i
], shard_id_t(i
)));
1168 if (acting
.size() > (unsigned)i
&& acting
[i
] != CRUSH_ITEM_NONE
&&
1169 !all_info
.find(pg_shard_t(acting
[i
], shard_id_t(i
)))->second
.is_incomplete() &&
1170 all_info
.find(pg_shard_t(acting
[i
], shard_id_t(i
)))->second
.last_update
>=
1171 auth_log_shard
->second
.log_tail
) {
1172 ss
<< " selecting acting[i]: " << pg_shard_t(acting
[i
], shard_id_t(i
)) << std::endl
;
1173 want
[i
] = acting
[i
];
1175 } else if (!restrict_to_up_acting
) {
1176 for (set
<pg_shard_t
>::iterator j
= all_info_by_shard
[shard_id_t(i
)].begin();
1177 j
!= all_info_by_shard
[shard_id_t(i
)].end();
1179 assert(j
->shard
== i
);
1180 if (!all_info
.find(*j
)->second
.is_incomplete() &&
1181 all_info
.find(*j
)->second
.last_update
>=
1182 auth_log_shard
->second
.log_tail
) {
1183 ss
<< " selecting stray: " << *j
<< std::endl
;
1189 if (want
[i
] == CRUSH_ITEM_NONE
)
1190 ss
<< " failed to fill position " << (int)i
<< std::endl
;
1194 bool found_primary
= false;
1195 for (uint8_t i
= 0; i
< want
.size(); ++i
) {
1196 if (want
[i
] != CRUSH_ITEM_NONE
) {
1197 acting_backfill
->insert(pg_shard_t(want
[i
], shard_id_t(i
)));
1198 if (!found_primary
) {
1199 *want_primary
= pg_shard_t(want
[i
], shard_id_t(i
));
1200 found_primary
= true;
1204 acting_backfill
->insert(backfill
->begin(), backfill
->end());
1209 * calculate the desired acting set.
1211 * Choose an appropriate acting set. Prefer up[0], unless it is
1212 * incomplete, or another osd has a longer tail that allows us to
1213 * bring other up nodes up to date.
1215 void PG::calc_replicated_acting(
1216 map
<pg_shard_t
, pg_info_t
>::const_iterator auth_log_shard
,
1218 const vector
<int> &acting
,
1219 pg_shard_t acting_primary
,
1220 const vector
<int> &up
,
1221 pg_shard_t up_primary
,
1222 const map
<pg_shard_t
, pg_info_t
> &all_info
,
1223 bool restrict_to_up_acting
,
1225 set
<pg_shard_t
> *backfill
,
1226 set
<pg_shard_t
> *acting_backfill
,
1227 pg_shard_t
*want_primary
,
1230 ss
<< "calc_acting newest update on osd." << auth_log_shard
->first
1231 << " with " << auth_log_shard
->second
1232 << (restrict_to_up_acting
? " restrict_to_up_acting" : "") << std::endl
;
1233 pg_shard_t auth_log_shard_id
= auth_log_shard
->first
;
1236 map
<pg_shard_t
,pg_info_t
>::const_iterator primary
;
1238 !all_info
.find(up_primary
)->second
.is_incomplete() &&
1239 all_info
.find(up_primary
)->second
.last_update
>=
1240 auth_log_shard
->second
.log_tail
) {
1241 ss
<< "up_primary: " << up_primary
<< ") selected as primary" << std::endl
;
1242 primary
= all_info
.find(up_primary
); // prefer up[0], all thing being equal
1244 assert(!auth_log_shard
->second
.is_incomplete());
1245 ss
<< "up[0] needs backfill, osd." << auth_log_shard_id
1246 << " selected as primary instead" << std::endl
;
1247 primary
= auth_log_shard
;
1250 ss
<< "calc_acting primary is osd." << primary
->first
1251 << " with " << primary
->second
<< std::endl
;
1252 *want_primary
= primary
->first
;
1253 want
->push_back(primary
->first
.osd
);
1254 acting_backfill
->insert(primary
->first
);
1255 unsigned usable
= 1;
1257 // select replicas that have log contiguity with primary.
1258 // prefer up, then acting, then any peer_info osds
1259 for (vector
<int>::const_iterator i
= up
.begin();
1262 pg_shard_t up_cand
= pg_shard_t(*i
, shard_id_t::NO_SHARD
);
1263 if (up_cand
== primary
->first
)
1265 const pg_info_t
&cur_info
= all_info
.find(up_cand
)->second
;
1266 if (cur_info
.is_incomplete() ||
1267 cur_info
.last_update
< MIN(
1268 primary
->second
.log_tail
,
1269 auth_log_shard
->second
.log_tail
)) {
1270 /* We include auth_log_shard->second.log_tail because in GetLog,
1271 * we will request logs back to the min last_update over our
1272 * acting_backfill set, which will result in our log being extended
1273 * as far backwards as necessary to pick up any peers which can
1274 * be log recovered by auth_log_shard's log */
1275 ss
<< " shard " << up_cand
<< " (up) backfill " << cur_info
<< std::endl
;
1276 backfill
->insert(up_cand
);
1277 acting_backfill
->insert(up_cand
);
1279 want
->push_back(*i
);
1280 acting_backfill
->insert(up_cand
);
1282 ss
<< " osd." << *i
<< " (up) accepted " << cur_info
<< std::endl
;
1286 // This no longer has backfill OSDs, but they are covered above.
1287 for (vector
<int>::const_iterator i
= acting
.begin();
1290 pg_shard_t
acting_cand(*i
, shard_id_t::NO_SHARD
);
1294 // skip up osds we already considered above
1295 if (acting_cand
== primary
->first
)
1297 vector
<int>::const_iterator up_it
= find(up
.begin(), up
.end(), acting_cand
.osd
);
1298 if (up_it
!= up
.end())
1301 const pg_info_t
&cur_info
= all_info
.find(acting_cand
)->second
;
1302 if (cur_info
.is_incomplete() ||
1303 cur_info
.last_update
< primary
->second
.log_tail
) {
1304 ss
<< " shard " << acting_cand
<< " (stray) REJECTED "
1305 << cur_info
<< std::endl
;
1307 want
->push_back(*i
);
1308 acting_backfill
->insert(acting_cand
);
1309 ss
<< " shard " << acting_cand
<< " (stray) accepted "
1310 << cur_info
<< std::endl
;
1315 if (restrict_to_up_acting
) {
1318 for (map
<pg_shard_t
,pg_info_t
>::const_iterator i
= all_info
.begin();
1319 i
!= all_info
.end();
1324 // skip up osds we already considered above
1325 if (i
->first
== primary
->first
)
1327 vector
<int>::const_iterator up_it
= find(up
.begin(), up
.end(), i
->first
.osd
);
1328 if (up_it
!= up
.end())
1330 vector
<int>::const_iterator acting_it
= find(
1331 acting
.begin(), acting
.end(), i
->first
.osd
);
1332 if (acting_it
!= acting
.end())
1335 if (i
->second
.is_incomplete() ||
1336 i
->second
.last_update
< primary
->second
.log_tail
) {
1337 ss
<< " shard " << i
->first
<< " (stray) REJECTED "
1338 << i
->second
<< std::endl
;
1340 want
->push_back(i
->first
.osd
);
1341 acting_backfill
->insert(i
->first
);
1342 ss
<< " shard " << i
->first
<< " (stray) accepted "
1343 << i
->second
<< std::endl
;
1352 * calculate the desired acting, and request a change with the monitor
1353 * if it differs from the current acting.
1355 * if restrict_to_up_acting=true, we filter out anything that's not in
1356 * up/acting. in order to lift this restriction, we need to
1357 * 1) check whether it's worth switching the acting set any time we get
1358 * a new pg info (not just here, when recovery finishes)
1359 * 2) check whether anything in want_acting went down on each new map
1360 * (and, if so, calculate a new want_acting)
1361 * 3) remove the assertion in PG::RecoveryState::Active::react(const AdvMap)
1364 bool PG::choose_acting(pg_shard_t
&auth_log_shard_id
,
1365 bool restrict_to_up_acting
,
1366 bool *history_les_bound
)
1368 map
<pg_shard_t
, pg_info_t
> all_info(peer_info
.begin(), peer_info
.end());
1369 all_info
[pg_whoami
] = info
;
1371 for (map
<pg_shard_t
, pg_info_t
>::iterator p
= all_info
.begin();
1372 p
!= all_info
.end();
1374 dout(10) << "calc_acting osd." << p
->first
<< " " << p
->second
<< dendl
;
1377 map
<pg_shard_t
, pg_info_t
>::const_iterator auth_log_shard
=
1378 find_best_info(all_info
, restrict_to_up_acting
, history_les_bound
);
1380 if (auth_log_shard
== all_info
.end()) {
1382 dout(10) << "choose_acting no suitable info found (incomplete backfills?),"
1383 << " reverting to up" << dendl
;
1386 osd
->queue_want_pg_temp(info
.pgid
.pgid
, empty
);
1388 dout(10) << "choose_acting failed" << dendl
;
1389 assert(want_acting
.empty());
1394 assert(!auth_log_shard
->second
.is_incomplete());
1395 auth_log_shard_id
= auth_log_shard
->first
;
1397 set
<pg_shard_t
> want_backfill
, want_acting_backfill
;
1399 pg_shard_t want_primary
;
1401 if (!pool
.info
.ec_pool())
1402 calc_replicated_acting(
1404 get_osdmap()->get_pg_size(info
.pgid
.pgid
),
1410 restrict_to_up_acting
,
1413 &want_acting_backfill
,
1419 get_osdmap()->get_pg_size(info
.pgid
.pgid
),
1425 restrict_to_up_acting
,
1428 &want_acting_backfill
,
1431 dout(10) << ss
.str() << dendl
;
1433 unsigned num_want_acting
= 0;
1434 set
<pg_shard_t
> have
;
1435 for (int i
= 0; i
< (int)want
.size(); ++i
) {
1436 if (want
[i
] != CRUSH_ITEM_NONE
) {
1441 pool
.info
.ec_pool() ? shard_id_t(i
) : shard_id_t::NO_SHARD
));
1445 // We go incomplete if below min_size for ec_pools since backfill
1446 // does not currently maintain rollbackability
1447 // Otherwise, we will go "peered", but not "active"
1448 if (num_want_acting
< pool
.info
.min_size
&&
1449 (pool
.info
.ec_pool() ||
1450 !cct
->_conf
->osd_allow_recovery_below_min_size
)) {
1451 want_acting
.clear();
1452 dout(10) << "choose_acting failed, below min size" << dendl
;
1456 /* Check whether we have enough acting shards to later perform recovery */
1457 boost::scoped_ptr
<IsPGRecoverablePredicate
> recoverable_predicate(
1458 get_pgbackend()->get_is_recoverable_predicate());
1459 if (!(*recoverable_predicate
)(have
)) {
1460 want_acting
.clear();
1461 dout(10) << "choose_acting failed, not recoverable" << dendl
;
1465 if (want
!= acting
) {
1466 dout(10) << "choose_acting want " << want
<< " != acting " << acting
1467 << ", requesting pg_temp change" << dendl
;
1470 if (want_acting
== up
) {
1471 // There can't be any pending backfill if
1472 // want is the same as crush map up OSDs.
1473 assert(want_backfill
.empty());
1475 osd
->queue_want_pg_temp(info
.pgid
.pgid
, empty
);
1477 osd
->queue_want_pg_temp(info
.pgid
.pgid
, want
);
1480 want_acting
.clear();
1481 actingbackfill
= want_acting_backfill
;
1482 dout(10) << "actingbackfill is " << actingbackfill
<< dendl
;
1483 assert(backfill_targets
.empty() || backfill_targets
== want_backfill
);
1484 if (backfill_targets
.empty()) {
1485 // Caller is GetInfo
1486 backfill_targets
= want_backfill
;
1488 // Will not change if already set because up would have had to change
1489 // Verify that nothing in backfill is in stray_set
1490 for (set
<pg_shard_t
>::iterator i
= want_backfill
.begin();
1491 i
!= want_backfill
.end();
1493 assert(stray_set
.find(*i
) == stray_set
.end());
1495 dout(10) << "choose_acting want " << want
<< " (== acting) backfill_targets "
1496 << want_backfill
<< dendl
;
1500 /* Build the might_have_unfound set.
1502 * This is used by the primary OSD during recovery.
1504 * This set tracks the OSDs which might have unfound objects that the primary
1505 * OSD needs. As we receive pg_missing_t from each OSD in might_have_unfound, we
1506 * will remove the OSD from the set.
1508 void PG::build_might_have_unfound()
1510 assert(might_have_unfound
.empty());
1511 assert(is_primary());
1513 dout(10) << __func__
<< dendl
;
1515 check_past_interval_bounds();
1517 might_have_unfound
= past_intervals
.get_might_have_unfound(
1519 pool
.info
.ec_pool());
1521 // include any (stray) peers
1522 for (map
<pg_shard_t
, pg_info_t
>::iterator p
= peer_info
.begin();
1523 p
!= peer_info
.end();
1525 might_have_unfound
.insert(p
->first
);
1527 dout(15) << __func__
<< ": built " << might_have_unfound
<< dendl
;
1530 struct C_PG_ActivateCommitted
: public Context
{
1533 epoch_t activation_epoch
;
1534 C_PG_ActivateCommitted(PG
*p
, epoch_t e
, epoch_t ae
)
1535 : pg(p
), epoch(e
), activation_epoch(ae
) {}
1536 void finish(int r
) override
{
1537 pg
->_activate_committed(epoch
, activation_epoch
);
1541 void PG::activate(ObjectStore::Transaction
& t
,
1542 epoch_t activation_epoch
,
1543 list
<Context
*>& tfin
,
1544 map
<int, map
<spg_t
,pg_query_t
> >& query_map
,
1548 PastIntervals
> > > *activator_map
,
1551 assert(!is_peered());
1552 assert(scrubber
.callbacks
.empty());
1553 assert(callbacks_for_degraded_object
.empty());
1556 state_clear(PG_STATE_DOWN
);
1558 send_notify
= false;
1561 // only update primary last_epoch_started if we will go active
1562 if (acting
.size() >= pool
.info
.min_size
) {
1563 assert(cct
->_conf
->osd_find_best_info_ignore_history_les
||
1564 info
.last_epoch_started
<= activation_epoch
);
1565 info
.last_epoch_started
= activation_epoch
;
1566 info
.last_interval_started
= info
.history
.same_interval_since
;
1568 } else if (is_acting(pg_whoami
)) {
1569 /* update last_epoch_started on acting replica to whatever the primary sent
1570 * unless it's smaller (could happen if we are going peered rather than
1571 * active, see doc/dev/osd_internals/last_epoch_started.rst) */
1572 if (info
.last_epoch_started
< activation_epoch
) {
1573 info
.last_epoch_started
= activation_epoch
;
1574 info
.last_interval_started
= info
.history
.same_interval_since
;
1578 auto &missing
= pg_log
.get_missing();
1581 last_update_ondisk
= info
.last_update
;
1582 min_last_complete_ondisk
= eversion_t(0,0); // we don't know (yet)!
1584 last_update_applied
= info
.last_update
;
1585 last_rollback_info_trimmed_to_applied
= pg_log
.get_can_rollback_to();
1587 need_up_thru
= false;
1589 // write pg info, log
1591 dirty_big_info
= true; // maybe
1593 // find out when we commit
1594 t
.register_on_complete(
1595 new C_PG_ActivateCommitted(
1597 get_osdmap()->get_epoch(),
1600 // initialize snap_trimq
1602 dout(20) << "activate - purged_snaps " << info
.purged_snaps
1603 << " cached_removed_snaps " << pool
.cached_removed_snaps
<< dendl
;
1604 snap_trimq
= pool
.cached_removed_snaps
;
1605 interval_set
<snapid_t
> intersection
;
1606 intersection
.intersection_of(snap_trimq
, info
.purged_snaps
);
1607 if (intersection
== info
.purged_snaps
) {
1608 snap_trimq
.subtract(info
.purged_snaps
);
1610 dout(0) << "warning: info.purged_snaps (" << info
.purged_snaps
1611 << ") is not a subset of pool.cached_removed_snaps ("
1612 << pool
.cached_removed_snaps
<< ")" << dendl
;
1613 snap_trimq
.subtract(intersection
);
1617 // init complete pointer
1618 if (missing
.num_missing() == 0) {
1619 dout(10) << "activate - no missing, moving last_complete " << info
.last_complete
1620 << " -> " << info
.last_update
<< dendl
;
1621 info
.last_complete
= info
.last_update
;
1622 pg_log
.reset_recovery_pointers();
1624 dout(10) << "activate - not complete, " << missing
<< dendl
;
1625 pg_log
.activate_not_complete(info
);
1633 // start up replicas
1635 assert(!actingbackfill
.empty());
1636 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
1637 i
!= actingbackfill
.end();
1639 if (*i
== pg_whoami
) continue;
1640 pg_shard_t peer
= *i
;
1641 assert(peer_info
.count(peer
));
1642 pg_info_t
& pi
= peer_info
[peer
];
1644 dout(10) << "activate peer osd." << peer
<< " " << pi
<< dendl
;
1647 assert(peer_missing
.count(peer
));
1648 pg_missing_t
& pm
= peer_missing
[peer
];
1650 bool needs_past_intervals
= pi
.dne();
1653 * cover case where peer sort order was different and
1654 * last_backfill cannot be interpreted
1656 bool force_restart_backfill
=
1657 !pi
.last_backfill
.is_max() &&
1658 !pi
.last_backfill_bitwise
;
1660 if (pi
.last_update
== info
.last_update
&& !force_restart_backfill
) {
1662 if (!pi
.last_backfill
.is_max())
1663 osd
->clog
->info() << info
.pgid
<< " continuing backfill to osd."
1665 << " from (" << pi
.log_tail
<< "," << pi
.last_update
1666 << "] " << pi
.last_backfill
1667 << " to " << info
.last_update
;
1668 if (!pi
.is_empty() && activator_map
) {
1669 dout(10) << "activate peer osd." << peer
<< " is up to date, queueing in pending_activators" << dendl
;
1670 (*activator_map
)[peer
.osd
].push_back(
1673 peer
.shard
, pg_whoami
.shard
,
1674 get_osdmap()->get_epoch(),
1675 get_osdmap()->get_epoch(),
1679 dout(10) << "activate peer osd." << peer
<< " is up to date, but sending pg_log anyway" << dendl
;
1681 i
->shard
, pg_whoami
.shard
,
1682 get_osdmap()->get_epoch(), info
);
1685 pg_log
.get_tail() > pi
.last_update
||
1686 pi
.last_backfill
== hobject_t() ||
1687 force_restart_backfill
||
1688 (backfill_targets
.count(*i
) && pi
.last_backfill
.is_max())) {
1689 /* ^ This last case covers a situation where a replica is not contiguous
1690 * with the auth_log, but is contiguous with this replica. Reshuffling
1691 * the active set to handle this would be tricky, so instead we just go
1692 * ahead and backfill it anyway. This is probably preferrable in any
1693 * case since the replica in question would have to be significantly
1697 osd
->clog
->debug() << info
.pgid
<< " starting backfill to osd." << peer
1698 << " from (" << pi
.log_tail
<< "," << pi
.last_update
1699 << "] " << pi
.last_backfill
1700 << " to " << info
.last_update
;
1702 pi
.last_update
= info
.last_update
;
1703 pi
.last_complete
= info
.last_update
;
1704 pi
.set_last_backfill(hobject_t());
1705 pi
.last_epoch_started
= info
.last_epoch_started
;
1706 pi
.last_interval_started
= info
.last_interval_started
;
1707 pi
.history
= info
.history
;
1708 pi
.hit_set
= info
.hit_set
;
1709 pi
.stats
.stats
.clear();
1711 // initialize peer with our purged_snaps.
1712 pi
.purged_snaps
= info
.purged_snaps
;
1715 i
->shard
, pg_whoami
.shard
,
1716 get_osdmap()->get_epoch(), pi
);
1718 // send some recent log, so that op dup detection works well.
1719 m
->log
.copy_up_to(pg_log
.get_log(), cct
->_conf
->osd_min_pg_log_entries
);
1720 m
->info
.log_tail
= m
->log
.tail
;
1721 pi
.log_tail
= m
->log
.tail
; // sigh...
1726 assert(pg_log
.get_tail() <= pi
.last_update
);
1728 i
->shard
, pg_whoami
.shard
,
1729 get_osdmap()->get_epoch(), info
);
1730 // send new stuff to append to replicas log
1731 m
->log
.copy_after(pg_log
.get_log(), pi
.last_update
);
1734 // share past_intervals if we are creating the pg on the replica
1735 // based on whether our info for that peer was dne() *before*
1736 // updating pi.history in the backfill block above.
1737 if (m
&& needs_past_intervals
)
1738 m
->past_intervals
= past_intervals
;
1740 // update local version of peer's missing list!
1741 if (m
&& pi
.last_backfill
!= hobject_t()) {
1742 for (list
<pg_log_entry_t
>::iterator p
= m
->log
.log
.begin();
1743 p
!= m
->log
.log
.end();
1745 if (p
->soid
<= pi
.last_backfill
&&
1747 if (perform_deletes_during_peering() && p
->is_delete()) {
1748 pm
.rm(p
->soid
, p
->version
);
1750 pm
.add_next_event(*p
);
1757 dout(10) << "activate peer osd." << peer
<< " sending " << m
->log
<< dendl
;
1758 //m->log.print(cout);
1759 osd
->send_message_osd_cluster(peer
.osd
, m
, get_osdmap()->get_epoch());
1763 pi
.last_update
= info
.last_update
;
1765 // update our missing
1766 if (pm
.num_missing() == 0) {
1767 pi
.last_complete
= pi
.last_update
;
1768 dout(10) << "activate peer osd." << peer
<< " " << pi
<< " uptodate" << dendl
;
1770 dout(10) << "activate peer osd." << peer
<< " " << pi
<< " missing " << pm
<< dendl
;
1774 // Set up missing_loc
1775 set
<pg_shard_t
> complete_shards
;
1776 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
1777 i
!= actingbackfill
.end();
1779 dout(20) << __func__
<< " setting up missing_loc from shard " << *i
<< " " << dendl
;
1780 if (*i
== get_primary()) {
1781 missing_loc
.add_active_missing(missing
);
1782 if (!missing
.have_missing())
1783 complete_shards
.insert(*i
);
1785 auto peer_missing_entry
= peer_missing
.find(*i
);
1786 assert(peer_missing_entry
!= peer_missing
.end());
1787 missing_loc
.add_active_missing(peer_missing_entry
->second
);
1788 if (!peer_missing_entry
->second
.have_missing() &&
1789 peer_info
[*i
].last_backfill
.is_max())
1790 complete_shards
.insert(*i
);
1793 // If necessary, create might_have_unfound to help us find our unfound objects.
1794 // NOTE: It's important that we build might_have_unfound before trimming the
1796 might_have_unfound
.clear();
1797 if (needs_recovery()) {
1798 // If only one shard has missing, we do a trick to add all others as recovery
1799 // source, this is considered safe since the PGLogs have been merged locally,
1800 // and covers vast majority of the use cases, like one OSD/host is down for
1801 // a while for hardware repairing
1802 if (complete_shards
.size() + 1 == actingbackfill
.size()) {
1803 missing_loc
.add_batch_sources_info(complete_shards
, ctx
->handle
);
1805 missing_loc
.add_source_info(pg_whoami
, info
, pg_log
.get_missing(),
1807 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
1808 i
!= actingbackfill
.end();
1810 if (*i
== pg_whoami
) continue;
1811 dout(10) << __func__
<< ": adding " << *i
<< " as a source" << dendl
;
1812 assert(peer_missing
.count(*i
));
1813 assert(peer_info
.count(*i
));
1814 missing_loc
.add_source_info(
1821 for (map
<pg_shard_t
, pg_missing_t
>::iterator i
= peer_missing
.begin();
1822 i
!= peer_missing
.end();
1824 if (is_actingbackfill(i
->first
))
1826 assert(peer_info
.count(i
->first
));
1828 peer_info
[i
->first
],
1834 build_might_have_unfound();
1836 state_set(PG_STATE_DEGRADED
);
1838 discover_all_missing(query_map
);
1842 if (get_osdmap()->get_pg_size(info
.pgid
.pgid
) > actingset
.size()) {
1843 state_set(PG_STATE_DEGRADED
);
1844 state_set(PG_STATE_UNDERSIZED
);
1847 state_set(PG_STATE_ACTIVATING
);
1848 release_pg_backoffs();
1849 projected_last_update
= info
.last_update
;
1851 if (acting
.size() >= pool
.info
.min_size
) {
1852 PGLogEntryHandler handler
{this, &t
};
1853 pg_log
.roll_forward(&handler
);
1857 bool PG::op_has_sufficient_caps(OpRequestRef
& op
)
1859 // only check MOSDOp
1860 if (op
->get_req()->get_type() != CEPH_MSG_OSD_OP
)
1863 const MOSDOp
*req
= static_cast<const MOSDOp
*>(op
->get_req());
1865 Session
*session
= static_cast<Session
*>(req
->get_connection()->get_priv());
1867 dout(0) << "op_has_sufficient_caps: no session for op " << *req
<< dendl
;
1870 OSDCap
& caps
= session
->caps
;
1873 const string
&key
= req
->get_hobj().get_key().empty() ?
1874 req
->get_oid().name
:
1875 req
->get_hobj().get_key();
1877 bool cap
= caps
.is_capable(pool
.name
, req
->get_hobj().nspace
,
1879 op
->need_read_cap(),
1880 op
->need_write_cap(),
1883 dout(20) << "op_has_sufficient_caps "
1884 << "session=" << session
1885 << " pool=" << pool
.id
<< " (" << pool
.name
1886 << " " << req
->get_hobj().nspace
1887 << ") owner=" << pool
.auid
1888 << " need_read_cap=" << op
->need_read_cap()
1889 << " need_write_cap=" << op
->need_write_cap()
1890 << " classes=" << op
->classes()
1891 << " -> " << (cap
? "yes" : "NO")
1896 void PG::_activate_committed(epoch_t epoch
, epoch_t activation_epoch
)
1899 if (pg_has_reset_since(epoch
)) {
1900 dout(10) << "_activate_committed " << epoch
1901 << ", that was an old interval" << dendl
;
1902 } else if (is_primary()) {
1903 peer_activated
.insert(pg_whoami
);
1904 dout(10) << "_activate_committed " << epoch
1905 << " peer_activated now " << peer_activated
1906 << " last_interval_started " << info
.history
.last_interval_started
1907 << " last_epoch_started " << info
.history
.last_epoch_started
1908 << " same_interval_since " << info
.history
.same_interval_since
<< dendl
;
1909 assert(!actingbackfill
.empty());
1910 if (peer_activated
.size() == actingbackfill
.size())
1911 all_activated_and_committed();
1913 dout(10) << "_activate_committed " << epoch
<< " telling primary" << dendl
;
1914 MOSDPGInfo
*m
= new MOSDPGInfo(epoch
);
1915 pg_notify_t i
= pg_notify_t(
1916 get_primary().shard
, pg_whoami
.shard
,
1917 get_osdmap()->get_epoch(),
1918 get_osdmap()->get_epoch(),
1921 i
.info
.history
.last_epoch_started
= activation_epoch
;
1922 i
.info
.history
.last_interval_started
= i
.info
.history
.same_interval_since
;
1923 if (acting
.size() >= pool
.info
.min_size
) {
1924 state_set(PG_STATE_ACTIVE
);
1926 state_set(PG_STATE_PEERED
);
1929 m
->pg_list
.push_back(make_pair(i
, PastIntervals()));
1930 osd
->send_message_osd_cluster(get_primary().osd
, m
, get_osdmap()->get_epoch());
1933 if (flushes_in_progress
== 0) {
1934 requeue_ops(waiting_for_peered
);
1938 assert(!dirty_info
);
1944 * update info.history.last_epoch_started ONLY after we and all
1945 * replicas have activated AND committed the activate transaction
1946 * (i.e. the peering results are stable on disk).
1948 void PG::all_activated_and_committed()
1950 dout(10) << "all_activated_and_committed" << dendl
;
1951 assert(is_primary());
1952 assert(peer_activated
.size() == actingbackfill
.size());
1953 assert(!actingbackfill
.empty());
1954 assert(blocked_by
.empty());
1956 queue_peering_event(
1958 std::make_shared
<CephPeeringEvt
>(
1959 get_osdmap()->get_epoch(),
1960 get_osdmap()->get_epoch(),
1961 AllReplicasActivated())));
1964 bool PG::requeue_scrub(bool high_priority
)
1966 assert(is_locked());
1968 dout(10) << __func__
<< ": already queued" << dendl
;
1971 dout(10) << __func__
<< ": queueing" << dendl
;
1972 scrub_queued
= true;
1973 osd
->queue_for_scrub(this, high_priority
);
1978 void PG::queue_recovery()
1980 if (!is_primary() || !is_peered()) {
1981 dout(10) << "queue_recovery -- not primary or not peered " << dendl
;
1982 assert(!recovery_queued
);
1983 } else if (recovery_queued
) {
1984 dout(10) << "queue_recovery -- already queued" << dendl
;
1986 dout(10) << "queue_recovery -- queuing" << dendl
;
1987 recovery_queued
= true;
1988 osd
->queue_for_recovery(this);
1992 bool PG::queue_scrub()
1994 assert(is_locked());
1995 if (is_scrubbing()) {
1998 scrubber
.priority
= scrubber
.must_scrub
?
1999 cct
->_conf
->osd_requested_scrub_priority
: get_scrub_priority();
2000 scrubber
.must_scrub
= false;
2001 state_set(PG_STATE_SCRUBBING
);
2002 if (scrubber
.must_deep_scrub
) {
2003 state_set(PG_STATE_DEEP_SCRUB
);
2004 scrubber
.must_deep_scrub
= false;
2006 if (scrubber
.must_repair
|| scrubber
.auto_repair
) {
2007 state_set(PG_STATE_REPAIR
);
2008 scrubber
.must_repair
= false;
2014 unsigned PG::get_scrub_priority()
2016 // a higher value -> a higher priority
2017 int pool_scrub_priority
= 0;
2018 pool
.info
.opts
.get(pool_opts_t::SCRUB_PRIORITY
, &pool_scrub_priority
);
2019 return pool_scrub_priority
> 0 ? pool_scrub_priority
: cct
->_conf
->osd_scrub_priority
;
2022 struct C_PG_FinishRecovery
: public Context
{
2024 explicit C_PG_FinishRecovery(PG
*p
) : pg(p
) {}
2025 void finish(int r
) override
{
2026 pg
->_finish_recovery(this);
2030 void PG::mark_clean()
2032 if (actingset
.size() == get_osdmap()->get_pg_size(info
.pgid
.pgid
)) {
2033 state_clear(PG_STATE_FORCED_BACKFILL
| PG_STATE_FORCED_RECOVERY
);
2034 state_set(PG_STATE_CLEAN
);
2035 info
.history
.last_epoch_clean
= get_osdmap()->get_epoch();
2036 info
.history
.last_interval_clean
= info
.history
.same_interval_since
;
2037 past_intervals
.clear();
2038 dirty_big_info
= true;
2045 void PG::_change_recovery_force_mode(int new_mode
, bool clear
)
2048 // we can't and shouldn't do anything if the PG is being deleted locally
2050 state_clear(new_mode
);
2052 state_set(new_mode
);
2054 publish_stats_to_osd();
2058 inline int PG::clamp_recovery_priority(int priority
)
2060 static_assert(OSD_RECOVERY_PRIORITY_MIN
< OSD_RECOVERY_PRIORITY_MAX
, "Invalid priority range");
2061 static_assert(OSD_RECOVERY_PRIORITY_MIN
>= 0, "Priority range must match unsigned type");
2063 // Clamp to valid range
2064 if (priority
> OSD_RECOVERY_PRIORITY_MAX
) {
2065 return OSD_RECOVERY_PRIORITY_MAX
;
2066 } else if (priority
< OSD_RECOVERY_PRIORITY_MIN
) {
2067 return OSD_RECOVERY_PRIORITY_MIN
;
2073 unsigned PG::get_recovery_priority()
2075 // a higher value -> a higher priority
2078 if (state
& PG_STATE_FORCED_RECOVERY
) {
2079 ret
= OSD_RECOVERY_PRIORITY_FORCED
;
2081 pool
.info
.opts
.get(pool_opts_t::RECOVERY_PRIORITY
, &ret
);
2082 ret
= clamp_recovery_priority(OSD_RECOVERY_PRIORITY_BASE
+ ret
);
2084 dout(20) << __func__
<< " recovery priority for " << *this << " is " << ret
<< ", state is " << state
<< dendl
;
2085 return static_cast<unsigned>(ret
);
2088 unsigned PG::get_backfill_priority()
2090 // a higher value -> a higher priority
2091 int ret
= OSD_BACKFILL_PRIORITY_BASE
;
2092 if (state
& PG_STATE_FORCED_BACKFILL
) {
2093 ret
= OSD_RECOVERY_PRIORITY_FORCED
;
2095 if (acting
.size() < pool
.info
.min_size
) {
2096 // inactive: no. of replicas < min_size, highest priority since it blocks IO
2097 ret
= OSD_BACKFILL_INACTIVE_PRIORITY_BASE
+ (pool
.info
.min_size
- acting
.size());
2099 } else if (is_undersized()) {
2100 // undersized: OSD_BACKFILL_DEGRADED_PRIORITY_BASE + num missing replicas
2101 assert(pool
.info
.size
> actingset
.size());
2102 ret
= OSD_BACKFILL_DEGRADED_PRIORITY_BASE
+ (pool
.info
.size
- actingset
.size());
2104 } else if (is_degraded()) {
2105 // degraded: baseline degraded
2106 ret
= OSD_BACKFILL_DEGRADED_PRIORITY_BASE
;
2109 // Adjust with pool's recovery priority
2110 int pool_recovery_priority
= 0;
2111 pool
.info
.opts
.get(pool_opts_t::RECOVERY_PRIORITY
, &pool_recovery_priority
);
2113 ret
= clamp_recovery_priority(pool_recovery_priority
+ ret
);
2116 return static_cast<unsigned>(ret
);
2119 void PG::finish_recovery(list
<Context
*>& tfin
)
2121 dout(10) << "finish_recovery" << dendl
;
2122 assert(info
.last_complete
== info
.last_update
);
2124 clear_recovery_state();
2127 * sync all this before purging strays. but don't block!
2129 finish_sync_event
= new C_PG_FinishRecovery(this);
2130 tfin
.push_back(finish_sync_event
);
2133 void PG::_finish_recovery(Context
*c
)
2140 if (c
== finish_sync_event
) {
2141 dout(10) << "_finish_recovery" << dendl
;
2142 finish_sync_event
= 0;
2145 publish_stats_to_osd();
2147 if (scrub_after_recovery
) {
2148 dout(10) << "_finish_recovery requeueing for scrub" << dendl
;
2149 scrub_after_recovery
= false;
2150 scrubber
.must_deep_scrub
= true;
2154 dout(10) << "_finish_recovery -- stale" << dendl
;
2159 void PG::start_recovery_op(const hobject_t
& soid
)
2161 dout(10) << "start_recovery_op " << soid
2162 #ifdef DEBUG_RECOVERY_OIDS
2163 << " (" << recovering_oids
<< ")"
2166 assert(recovery_ops_active
>= 0);
2167 recovery_ops_active
++;
2168 #ifdef DEBUG_RECOVERY_OIDS
2169 assert(recovering_oids
.count(soid
) == 0);
2170 recovering_oids
.insert(soid
);
2172 osd
->start_recovery_op(this, soid
);
2175 void PG::finish_recovery_op(const hobject_t
& soid
, bool dequeue
)
2177 dout(10) << "finish_recovery_op " << soid
2178 #ifdef DEBUG_RECOVERY_OIDS
2179 << " (" << recovering_oids
<< ")"
2182 assert(recovery_ops_active
> 0);
2183 recovery_ops_active
--;
2184 #ifdef DEBUG_RECOVERY_OIDS
2185 assert(recovering_oids
.count(soid
));
2186 recovering_oids
.erase(soid
);
2188 osd
->finish_recovery_op(this, soid
, dequeue
);
2195 void PG::split_into(pg_t child_pgid
, PG
*child
, unsigned split_bits
)
2197 child
->update_snap_mapper_bits(split_bits
);
2198 child
->update_osdmap_ref(get_osdmap());
2203 pg_log
.split_into(child_pgid
, split_bits
, &(child
->pg_log
));
2204 child
->info
.last_complete
= info
.last_complete
;
2206 info
.last_update
= pg_log
.get_head();
2207 child
->info
.last_update
= child
->pg_log
.get_head();
2209 child
->info
.last_user_version
= info
.last_user_version
;
2211 info
.log_tail
= pg_log
.get_tail();
2212 child
->info
.log_tail
= child
->pg_log
.get_tail();
2214 if (info
.last_complete
< pg_log
.get_tail())
2215 info
.last_complete
= pg_log
.get_tail();
2216 if (child
->info
.last_complete
< child
->pg_log
.get_tail())
2217 child
->info
.last_complete
= child
->pg_log
.get_tail();
2220 child
->info
.history
= info
.history
;
2221 child
->info
.history
.epoch_created
= get_osdmap()->get_epoch();
2222 child
->info
.purged_snaps
= info
.purged_snaps
;
2224 if (info
.last_backfill
.is_max()) {
2225 child
->info
.set_last_backfill(hobject_t::get_max());
2227 // restart backfill on parent and child to be safe. we could
2228 // probably do better in the bitwise sort case, but it's more
2229 // fragile (there may be special work to do on backfill completion
2231 info
.set_last_backfill(hobject_t());
2232 child
->info
.set_last_backfill(hobject_t());
2233 // restarting backfill implies that the missing set is empty,
2234 // since it is only used for objects prior to last_backfill
2235 pg_log
.reset_backfill();
2236 child
->pg_log
.reset_backfill();
2239 child
->info
.stats
= info
.stats
;
2240 child
->info
.stats
.parent_split_bits
= split_bits
;
2241 info
.stats
.stats_invalid
= true;
2242 child
->info
.stats
.stats_invalid
= true;
2243 child
->info
.last_epoch_started
= info
.last_epoch_started
;
2244 child
->info
.last_interval_started
= info
.last_interval_started
;
2246 child
->snap_trimq
= snap_trimq
;
2248 // There can't be recovery/backfill going on now
2249 int primary
, up_primary
;
2250 vector
<int> newup
, newacting
;
2251 get_osdmap()->pg_to_up_acting_osds(
2252 child
->info
.pgid
.pgid
, &newup
, &up_primary
, &newacting
, &primary
);
2253 child
->init_primary_up_acting(
2258 child
->role
= OSDMap::calc_pg_role(osd
->whoami
, child
->acting
);
2260 // this comparison includes primary rank via pg_shard_t
2261 if (get_primary() != child
->get_primary())
2262 child
->info
.history
.same_primary_since
= get_osdmap()->get_epoch();
2264 child
->info
.stats
.up
= up
;
2265 child
->info
.stats
.up_primary
= up_primary
;
2266 child
->info
.stats
.acting
= acting
;
2267 child
->info
.stats
.acting_primary
= primary
;
2268 child
->info
.stats
.mapping_epoch
= get_osdmap()->get_epoch();
2271 child
->past_intervals
= past_intervals
;
2273 _split_into(child_pgid
, child
, split_bits
);
2275 // release all backoffs for simplicity
2276 release_backoffs(hobject_t(), hobject_t::get_max());
2278 child
->on_new_interval();
2280 child
->dirty_info
= true;
2281 child
->dirty_big_info
= true;
2283 dirty_big_info
= true;
2286 void PG::add_backoff(SessionRef s
, const hobject_t
& begin
, const hobject_t
& end
)
2288 ConnectionRef con
= s
->con
;
2289 if (!con
) // OSD::ms_handle_reset clears s->con without a lock
2291 BackoffRef
b(s
->have_backoff(info
.pgid
, begin
));
2293 derr
<< __func__
<< " already have backoff for " << s
<< " begin " << begin
2294 << " " << *b
<< dendl
;
2297 Mutex::Locker
l(backoff_lock
);
2299 b
= new Backoff(info
.pgid
, this, s
, ++s
->backoff_seq
, begin
, end
);
2300 backoffs
[begin
].insert(b
);
2302 dout(10) << __func__
<< " session " << s
<< " added " << *b
<< dendl
;
2307 get_osdmap()->get_epoch(),
2308 CEPH_OSD_BACKOFF_OP_BLOCK
,
2314 void PG::release_backoffs(const hobject_t
& begin
, const hobject_t
& end
)
2316 dout(10) << __func__
<< " [" << begin
<< "," << end
<< ")" << dendl
;
2317 vector
<BackoffRef
> bv
;
2319 Mutex::Locker
l(backoff_lock
);
2320 auto p
= backoffs
.lower_bound(begin
);
2321 while (p
!= backoffs
.end()) {
2322 int r
= cmp(p
->first
, end
);
2323 dout(20) << __func__
<< " ? " << r
<< " " << p
->first
2324 << " " << p
->second
<< dendl
;
2325 // note: must still examine begin=end=p->first case
2326 if (r
> 0 || (r
== 0 && begin
< end
)) {
2329 dout(20) << __func__
<< " checking " << p
->first
2330 << " " << p
->second
<< dendl
;
2331 auto q
= p
->second
.begin();
2332 while (q
!= p
->second
.end()) {
2333 dout(20) << __func__
<< " checking " << *q
<< dendl
;
2334 int r
= cmp((*q
)->begin
, begin
);
2335 if (r
== 0 || (r
> 0 && (*q
)->end
< end
)) {
2337 q
= p
->second
.erase(q
);
2342 if (p
->second
.empty()) {
2343 p
= backoffs
.erase(p
);
2350 Mutex::Locker
l(b
->lock
);
2351 dout(10) << __func__
<< " " << *b
<< dendl
;
2353 assert(b
->pg
== this);
2354 ConnectionRef con
= b
->session
->con
;
2355 if (con
) { // OSD::ms_handle_reset clears s->con without a lock
2359 get_osdmap()->get_epoch(),
2360 CEPH_OSD_BACKOFF_OP_UNBLOCK
,
2366 b
->state
= Backoff::STATE_DELETING
;
2368 b
->session
->rm_backoff(b
);
2376 void PG::clear_backoffs()
2378 dout(10) << __func__
<< " " << dendl
;
2379 map
<hobject_t
,set
<BackoffRef
>> ls
;
2381 Mutex::Locker
l(backoff_lock
);
2384 for (auto& p
: ls
) {
2385 for (auto& b
: p
.second
) {
2386 Mutex::Locker
l(b
->lock
);
2387 dout(10) << __func__
<< " " << *b
<< dendl
;
2389 assert(b
->pg
== this);
2391 b
->state
= Backoff::STATE_DELETING
;
2393 b
->session
->rm_backoff(b
);
2402 // called by Session::clear_backoffs()
2403 void PG::rm_backoff(BackoffRef b
)
2405 dout(10) << __func__
<< " " << *b
<< dendl
;
2406 Mutex::Locker
l(backoff_lock
);
2407 assert(b
->lock
.is_locked_by_me());
2408 assert(b
->pg
== this);
2409 auto p
= backoffs
.find(b
->begin
);
2410 // may race with release_backoffs()
2411 if (p
!= backoffs
.end()) {
2412 auto q
= p
->second
.find(b
);
2413 if (q
!= p
->second
.end()) {
2415 if (p
->second
.empty()) {
2422 void PG::clear_recovery_state()
2424 dout(10) << "clear_recovery_state" << dendl
;
2426 pg_log
.reset_recovery_pointers();
2427 finish_sync_event
= 0;
2430 while (recovery_ops_active
> 0) {
2431 #ifdef DEBUG_RECOVERY_OIDS
2432 soid
= *recovering_oids
.begin();
2434 finish_recovery_op(soid
, true);
2437 backfill_targets
.clear();
2438 backfill_info
.clear();
2439 peer_backfill_info
.clear();
2440 waiting_on_backfill
.clear();
2441 _clear_recovery_state(); // pg impl specific hook
2444 void PG::cancel_recovery()
2446 dout(10) << "cancel_recovery" << dendl
;
2447 clear_recovery_state();
2451 void PG::purge_strays()
2453 dout(10) << "purge_strays " << stray_set
<< dendl
;
2455 bool removed
= false;
2456 for (set
<pg_shard_t
>::iterator p
= stray_set
.begin();
2457 p
!= stray_set
.end();
2459 assert(!is_actingbackfill(*p
));
2460 if (get_osdmap()->is_up(p
->osd
)) {
2461 dout(10) << "sending PGRemove to osd." << *p
<< dendl
;
2462 vector
<spg_t
> to_remove
;
2463 to_remove
.push_back(spg_t(info
.pgid
.pgid
, p
->shard
));
2464 MOSDPGRemove
*m
= new MOSDPGRemove(
2465 get_osdmap()->get_epoch(),
2467 osd
->send_message_osd_cluster(p
->osd
, m
, get_osdmap()->get_epoch());
2469 dout(10) << "not sending PGRemove to down osd." << *p
<< dendl
;
2471 peer_missing
.erase(*p
);
2472 peer_info
.erase(*p
);
2473 peer_purged
.insert(*p
);
2477 // if we removed anyone, update peers (which include peer_info)
2479 update_heartbeat_peers();
2483 // clear _requested maps; we may have to peer() again if we discover
2484 // (more) stray content
2485 peer_log_requested
.clear();
2486 peer_missing_requested
.clear();
2489 void PG::set_probe_targets(const set
<pg_shard_t
> &probe_set
)
2491 Mutex::Locker
l(heartbeat_peer_lock
);
2492 probe_targets
.clear();
2493 for (set
<pg_shard_t
>::iterator i
= probe_set
.begin();
2494 i
!= probe_set
.end();
2496 probe_targets
.insert(i
->osd
);
2500 void PG::clear_probe_targets()
2502 Mutex::Locker
l(heartbeat_peer_lock
);
2503 probe_targets
.clear();
2506 void PG::update_heartbeat_peers()
2508 assert(is_locked());
2514 for (unsigned i
=0; i
<acting
.size(); i
++) {
2515 if (acting
[i
] != CRUSH_ITEM_NONE
)
2516 new_peers
.insert(acting
[i
]);
2518 for (unsigned i
=0; i
<up
.size(); i
++) {
2519 if (up
[i
] != CRUSH_ITEM_NONE
)
2520 new_peers
.insert(up
[i
]);
2522 for (map
<pg_shard_t
,pg_info_t
>::iterator p
= peer_info
.begin();
2523 p
!= peer_info
.end();
2525 new_peers
.insert(p
->first
.osd
);
2527 bool need_update
= false;
2528 heartbeat_peer_lock
.Lock();
2529 if (new_peers
== heartbeat_peers
) {
2530 dout(10) << "update_heartbeat_peers " << heartbeat_peers
<< " unchanged" << dendl
;
2532 dout(10) << "update_heartbeat_peers " << heartbeat_peers
<< " -> " << new_peers
<< dendl
;
2533 heartbeat_peers
.swap(new_peers
);
2536 heartbeat_peer_lock
.Unlock();
2539 osd
->need_heartbeat_peer_update();
2543 bool PG::check_in_progress_op(
2544 const osd_reqid_t
&r
,
2545 eversion_t
*version
,
2546 version_t
*user_version
,
2547 int *return_code
) const
2550 projected_log
.get_request(r
, version
, user_version
, return_code
) ||
2551 pg_log
.get_log().get_request(r
, version
, user_version
, return_code
));
2554 void PG::_update_calc_stats()
2556 info
.stats
.version
= info
.last_update
;
2557 info
.stats
.created
= info
.history
.epoch_created
;
2558 info
.stats
.last_scrub
= info
.history
.last_scrub
;
2559 info
.stats
.last_scrub_stamp
= info
.history
.last_scrub_stamp
;
2560 info
.stats
.last_deep_scrub
= info
.history
.last_deep_scrub
;
2561 info
.stats
.last_deep_scrub_stamp
= info
.history
.last_deep_scrub_stamp
;
2562 info
.stats
.last_clean_scrub_stamp
= info
.history
.last_clean_scrub_stamp
;
2563 info
.stats
.last_epoch_clean
= info
.history
.last_epoch_clean
;
2565 info
.stats
.log_size
= pg_log
.get_head().version
- pg_log
.get_tail().version
;
2566 info
.stats
.ondisk_log_size
= info
.stats
.log_size
;
2567 info
.stats
.log_start
= pg_log
.get_tail();
2568 info
.stats
.ondisk_log_start
= pg_log
.get_tail();
2570 // If actingset is larger then upset we will have misplaced,
2571 // so we will report based on actingset size.
2573 // If upset is larger then we will have degraded,
2574 // so we will report based on upset size.
2576 // If target is the largest of them all, it will contribute to
2577 // the degraded count because num_object_copies is
2578 // computed using target and eventual used to get degraded total.
2580 unsigned target
= get_osdmap()->get_pg_size(info
.pgid
.pgid
);
2581 unsigned nrep
= MAX(actingset
.size(), upset
.size());
2582 // calc num_object_copies
2583 info
.stats
.stats
.calc_copies(MAX(target
, nrep
));
2584 info
.stats
.stats
.sum
.num_objects_degraded
= 0;
2585 info
.stats
.stats
.sum
.num_objects_unfound
= 0;
2586 info
.stats
.stats
.sum
.num_objects_misplaced
= 0;
2587 if ((is_degraded() || is_undersized() || !is_clean()) && is_peered()) {
2588 // NOTE: we only generate copies, degraded, misplaced and unfound
2589 // values for the summation, not individual stat categories.
2590 int64_t num_objects
= info
.stats
.stats
.sum
.num_objects
;
2592 // Total sum of all missing
2593 int64_t missing
= 0;
2594 // Objects that have arrived backfilled to up OSDs (not in acting)
2595 int64_t backfilled
= 0;
2596 // A misplaced object is not stored on the correct OSD
2597 int64_t misplaced
= 0;
2598 // Total of object copies/shards found
2599 int64_t object_copies
= 0;
2601 // num_objects_missing on each peer
2602 for (map
<pg_shard_t
, pg_info_t
>::iterator pi
=
2604 pi
!= peer_info
.end();
2606 map
<pg_shard_t
, pg_missing_t
>::const_iterator pm
=
2607 peer_missing
.find(pi
->first
);
2608 if (pm
!= peer_missing
.end()) {
2609 pi
->second
.stats
.stats
.sum
.num_objects_missing
=
2610 pm
->second
.num_missing();
2614 assert(!actingbackfill
.empty());
2615 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
2616 i
!= actingbackfill
.end();
2618 const pg_shard_t
&p
= *i
;
2620 bool in_up
= (upset
.find(p
) != upset
.end());
2621 bool in_acting
= (actingset
.find(p
) != actingset
.end());
2622 assert(in_up
|| in_acting
);
2624 // in acting Compute total objects excluding num_missing
2625 // in acting and not in up Compute misplaced objects excluding num_missing
2626 // in up and not in acting Compute total objects already backfilled
2628 unsigned osd_missing
;
2630 if (p
== pg_whoami
) {
2631 osd_missing
= pg_log
.get_missing().num_missing();
2632 info
.stats
.stats
.sum
.num_objects_missing_on_primary
=
2634 object_copies
+= num_objects
; // My local (primary) count
2636 assert(peer_missing
.count(p
));
2637 osd_missing
= peer_missing
[p
].num_missing();
2638 object_copies
+= peer_info
[p
].stats
.stats
.sum
.num_objects
;
2640 missing
+= osd_missing
;
2641 // Count non-missing objects not in up as misplaced
2642 if (!in_up
&& num_objects
> osd_missing
)
2643 misplaced
+= num_objects
- osd_missing
;
2645 assert(in_up
&& !in_acting
);
2647 // If this peer has more objects then it should, ignore them
2648 backfilled
+= MIN(num_objects
, peer_info
[p
].stats
.stats
.sum
.num_objects
);
2652 // Any objects that have been backfilled to up OSDs can deducted from misplaced
2653 misplaced
= MAX(0, misplaced
- backfilled
);
2655 // Deduct computed total missing on acting nodes
2656 object_copies
-= missing
;
2657 // Include computed backfilled objects on up nodes
2658 object_copies
+= backfilled
;
2659 // a degraded objects has fewer replicas or EC shards than the
2660 // pool specifies. num_object_copies will never be smaller than target * num_copies.
2661 int64_t degraded
= MAX(0, info
.stats
.stats
.sum
.num_object_copies
- object_copies
);
2663 info
.stats
.stats
.sum
.num_objects_degraded
= degraded
;
2664 info
.stats
.stats
.sum
.num_objects_unfound
= get_num_unfound();
2665 info
.stats
.stats
.sum
.num_objects_misplaced
= misplaced
;
2669 void PG::_update_blocked_by()
2671 // set a max on the number of blocking peers we report. if we go
2672 // over, report a random subset. keep the result sorted.
2673 unsigned keep
= MIN(blocked_by
.size(), cct
->_conf
->osd_max_pg_blocked_by
);
2674 unsigned skip
= blocked_by
.size() - keep
;
2675 info
.stats
.blocked_by
.clear();
2676 info
.stats
.blocked_by
.resize(keep
);
2678 for (set
<int>::iterator p
= blocked_by
.begin();
2679 p
!= blocked_by
.end() && keep
> 0;
2681 if (skip
> 0 && (rand() % (skip
+ keep
) < skip
)) {
2684 info
.stats
.blocked_by
[pos
++] = *p
;
2690 void PG::publish_stats_to_osd()
2695 pg_stats_publish_lock
.Lock();
2697 if (info
.stats
.stats
.sum
.num_scrub_errors
)
2698 state_set(PG_STATE_INCONSISTENT
);
2700 state_clear(PG_STATE_INCONSISTENT
);
2702 utime_t now
= ceph_clock_now();
2703 if (info
.stats
.state
!= state
) {
2704 info
.stats
.last_change
= now
;
2705 // Optimistic estimation, if we just find out an inactive PG,
2706 // assumt it is active till now.
2707 if (!(state
& PG_STATE_ACTIVE
) &&
2708 (info
.stats
.state
& PG_STATE_ACTIVE
))
2709 info
.stats
.last_active
= now
;
2711 if ((state
& PG_STATE_ACTIVE
) &&
2712 !(info
.stats
.state
& PG_STATE_ACTIVE
))
2713 info
.stats
.last_became_active
= now
;
2714 if ((state
& (PG_STATE_ACTIVE
|PG_STATE_PEERED
)) &&
2715 !(info
.stats
.state
& (PG_STATE_ACTIVE
|PG_STATE_PEERED
)))
2716 info
.stats
.last_became_peered
= now
;
2717 if (!(state
& PG_STATE_CREATING
) &&
2718 (info
.stats
.state
& PG_STATE_CREATING
)) {
2719 osd
->send_pg_created(get_pgid().pgid
);
2721 info
.stats
.state
= state
;
2724 _update_calc_stats();
2725 _update_blocked_by();
2727 bool publish
= false;
2728 pg_stat_t pre_publish
= info
.stats
;
2729 pre_publish
.stats
.add(unstable_stats
);
2730 utime_t cutoff
= now
;
2731 cutoff
-= cct
->_conf
->osd_pg_stat_report_interval_max
;
2732 if (pg_stats_publish_valid
&& pre_publish
== pg_stats_publish
&&
2733 info
.stats
.last_fresh
> cutoff
) {
2734 dout(15) << "publish_stats_to_osd " << pg_stats_publish
.reported_epoch
2735 << ": no change since " << info
.stats
.last_fresh
<< dendl
;
2737 // update our stat summary and timestamps
2738 info
.stats
.reported_epoch
= get_osdmap()->get_epoch();
2739 ++info
.stats
.reported_seq
;
2741 info
.stats
.last_fresh
= now
;
2743 if (info
.stats
.state
& PG_STATE_CLEAN
)
2744 info
.stats
.last_clean
= now
;
2745 if (info
.stats
.state
& PG_STATE_ACTIVE
)
2746 info
.stats
.last_active
= now
;
2747 if (info
.stats
.state
& (PG_STATE_ACTIVE
|PG_STATE_PEERED
))
2748 info
.stats
.last_peered
= now
;
2749 info
.stats
.last_unstale
= now
;
2750 if ((info
.stats
.state
& PG_STATE_DEGRADED
) == 0)
2751 info
.stats
.last_undegraded
= now
;
2752 if ((info
.stats
.state
& PG_STATE_UNDERSIZED
) == 0)
2753 info
.stats
.last_fullsized
= now
;
2755 // do not send pgstat to mon anymore once we are luminous, since mgr takes
2756 // care of this by sending MMonMgrReport to mon.
2758 osd
->osd
->get_osdmap()->require_osd_release
< CEPH_RELEASE_LUMINOUS
;
2759 pg_stats_publish_valid
= true;
2760 pg_stats_publish
= pre_publish
;
2762 dout(15) << "publish_stats_to_osd " << pg_stats_publish
.reported_epoch
2763 << ":" << pg_stats_publish
.reported_seq
<< dendl
;
2765 pg_stats_publish_lock
.Unlock();
2768 osd
->pg_stat_queue_enqueue(this);
2771 void PG::clear_publish_stats()
2773 dout(15) << "clear_stats" << dendl
;
2774 pg_stats_publish_lock
.Lock();
2775 pg_stats_publish_valid
= false;
2776 pg_stats_publish_lock
.Unlock();
2778 osd
->pg_stat_queue_dequeue(this);
2782 * initialize a newly instantiated pg
2784 * Initialize PG state, as when a PG is initially created, or when it
2785 * is first instantiated on the current node.
2787 * @param role our role/rank
2788 * @param newup up set
2789 * @param newacting acting set
2790 * @param history pg history
2791 * @param pi past_intervals
2792 * @param backfill true if info should be marked as backfill
2793 * @param t transaction to write out our new state in
2797 const vector
<int>& newup
, int new_up_primary
,
2798 const vector
<int>& newacting
, int new_acting_primary
,
2799 const pg_history_t
& history
,
2800 const PastIntervals
& pi
,
2802 ObjectStore::Transaction
*t
)
2804 dout(10) << "init role " << role
<< " up " << newup
<< " acting " << newacting
2805 << " history " << history
2806 << " past_intervals " << pi
2812 init_primary_up_acting(
2816 new_acting_primary
);
2818 info
.history
= history
;
2819 past_intervals
= pi
;
2822 info
.stats
.up_primary
= new_up_primary
;
2823 info
.stats
.acting
= acting
;
2824 info
.stats
.acting_primary
= new_acting_primary
;
2825 info
.stats
.mapping_epoch
= info
.history
.same_interval_since
;
2828 dout(10) << __func__
<< ": Setting backfill" << dendl
;
2829 info
.set_last_backfill(hobject_t());
2830 info
.last_complete
= info
.last_update
;
2831 pg_log
.mark_log_for_rewrite();
2837 dirty_big_info
= true;
2841 #pragma GCC diagnostic ignored "-Wpragmas"
2842 #pragma GCC diagnostic push
2843 #pragma GCC diagnostic ignored "-Wdeprecated-declarations"
2845 void PG::upgrade(ObjectStore
*store
)
2847 assert(info_struct_v
<= 10);
2848 ObjectStore::Transaction t
;
2850 assert(info_struct_v
>= 7);
2853 if (info_struct_v
<= 7) {
2854 pg_log
.mark_log_for_rewrite();
2855 ghobject_t
log_oid(OSD::make_pg_log_oid(pg_id
));
2856 ghobject_t
biginfo_oid(OSD::make_pg_biginfo_oid(pg_id
));
2857 t
.remove(coll_t::meta(), log_oid
);
2858 t
.remove(coll_t::meta(), biginfo_oid
);
2859 t
.touch(coll
, pgmeta_oid
);
2863 if (info_struct_v
<= 8) {
2864 // no special action needed.
2868 if (info_struct_v
<= 9) {
2869 // previous versions weren't (as) aggressively clearing past_intervals
2870 if (info
.history
.last_epoch_clean
>= info
.history
.same_interval_since
) {
2871 dout(20) << __func__
<< " clearing past_intervals" << dendl
;
2872 past_intervals
.clear();
2876 // update infover_key
2877 if (info_struct_v
< cur_struct_v
) {
2878 map
<string
,bufferlist
> v
;
2879 __u8 ver
= cur_struct_v
;
2880 ::encode(ver
, v
[infover_key
]);
2881 t
.omap_setkeys(coll
, pgmeta_oid
, v
);
2885 dirty_big_info
= true;
2888 ceph::shared_ptr
<ObjectStore::Sequencer
> osr (std::make_shared
<
2889 ObjectStore::Sequencer
>("upgrade"));
2890 int r
= store
->apply_transaction(osr
.get(), std::move(t
));
2892 derr
<< __func__
<< ": apply_transaction returned "
2893 << cpp_strerror(r
) << dendl
;
2899 if (!osr
->flush_commit(&waiter
)) {
2904 #pragma GCC diagnostic pop
2905 #pragma GCC diagnostic warning "-Wpragmas"
2907 int PG::_prepare_write_info(CephContext
* cct
,
2908 map
<string
,bufferlist
> *km
,
2910 pg_info_t
&info
, pg_info_t
&last_written_info
,
2911 PastIntervals
&past_intervals
,
2912 bool dirty_big_info
,
2915 PerfCounters
*logger
)
2918 ::encode(epoch
, (*km
)[epoch_key
]);
2922 logger
->inc(l_osd_pg_info
);
2924 // try to do info efficiently?
2925 if (!dirty_big_info
&& try_fast_info
&&
2926 info
.last_update
> last_written_info
.last_update
) {
2927 pg_fast_info_t fast
;
2928 fast
.populate_from(info
);
2929 bool did
= fast
.try_apply_to(&last_written_info
);
2930 assert(did
); // we verified last_update increased above
2931 if (info
== last_written_info
) {
2932 ::encode(fast
, (*km
)[fastinfo_key
]);
2934 logger
->inc(l_osd_pg_fastinfo
);
2937 generic_dout(30) << __func__
<< " fastinfo failed, info:\n";
2939 JSONFormatter
jf(true);
2940 jf
.dump_object("info", info
);
2944 *_dout
<< "\nlast_written_info:\n";
2945 JSONFormatter
jf(true);
2946 jf
.dump_object("last_written_info", last_written_info
);
2951 last_written_info
= info
;
2953 // info. store purged_snaps separately.
2954 interval_set
<snapid_t
> purged_snaps
;
2955 purged_snaps
.swap(info
.purged_snaps
);
2956 ::encode(info
, (*km
)[info_key
]);
2957 purged_snaps
.swap(info
.purged_snaps
);
2959 if (dirty_big_info
) {
2960 // potentially big stuff
2961 bufferlist
& bigbl
= (*km
)[biginfo_key
];
2962 ::encode(past_intervals
, bigbl
);
2963 ::encode(info
.purged_snaps
, bigbl
);
2964 //dout(20) << "write_info bigbl " << bigbl.length() << dendl;
2966 logger
->inc(l_osd_pg_biginfo
);
2972 void PG::_create(ObjectStore::Transaction
& t
, spg_t pgid
, int bits
)
2975 t
.create_collection(coll
, bits
);
2978 void PG::_init(ObjectStore::Transaction
& t
, spg_t pgid
, const pg_pool_t
*pool
)
2983 // Give a hint to the PG collection
2985 uint32_t pg_num
= pool
->get_pg_num();
2986 uint64_t expected_num_objects_pg
= pool
->expected_num_objects
/ pg_num
;
2987 ::encode(pg_num
, hint
);
2988 ::encode(expected_num_objects_pg
, hint
);
2989 uint32_t hint_type
= ObjectStore::Transaction::COLL_HINT_EXPECTED_NUM_OBJECTS
;
2990 t
.collection_hint(coll
, hint_type
, hint
);
2993 ghobject_t
pgmeta_oid(pgid
.make_pgmeta_oid());
2994 t
.touch(coll
, pgmeta_oid
);
2995 map
<string
,bufferlist
> values
;
2996 __u8 struct_v
= cur_struct_v
;
2997 ::encode(struct_v
, values
[infover_key
]);
2998 t
.omap_setkeys(coll
, pgmeta_oid
, values
);
3001 void PG::prepare_write_info(map
<string
,bufferlist
> *km
)
3003 info
.stats
.stats
.add(unstable_stats
);
3004 unstable_stats
.clear();
3006 bool need_update_epoch
= last_epoch
< get_osdmap()->get_epoch();
3007 int ret
= _prepare_write_info(cct
, km
, get_osdmap()->get_epoch(),
3011 dirty_big_info
, need_update_epoch
,
3012 cct
->_conf
->osd_fast_info
,
3015 if (need_update_epoch
)
3016 last_epoch
= get_osdmap()->get_epoch();
3017 last_persisted_osdmap_ref
= osdmap_ref
;
3020 dirty_big_info
= false;
3023 #pragma GCC diagnostic ignored "-Wpragmas"
3024 #pragma GCC diagnostic push
3025 #pragma GCC diagnostic ignored "-Wdeprecated-declarations"
3027 bool PG::_has_removal_flag(ObjectStore
*store
,
3031 ghobject_t
pgmeta_oid(pgid
.make_pgmeta_oid());
3033 // first try new way
3035 keys
.insert("_remove");
3036 map
<string
,bufferlist
> values
;
3037 if (store
->omap_get_values(coll
, pgmeta_oid
, keys
, &values
) == 0 &&
3044 int PG::peek_map_epoch(ObjectStore
*store
,
3050 ghobject_t
legacy_infos_oid(OSD::make_infos_oid());
3051 ghobject_t
pgmeta_oid(pgid
.make_pgmeta_oid());
3052 epoch_t cur_epoch
= 0;
3056 // validate collection name
3057 assert(coll
.is_pg());
3062 keys
.insert(infover_key
);
3063 keys
.insert(epoch_key
);
3064 map
<string
,bufferlist
> values
;
3065 int r
= store
->omap_get_values(coll
, pgmeta_oid
, keys
, &values
);
3067 assert(values
.size() == 2);
3069 // sanity check version
3070 bufferlist::iterator bp
= values
[infover_key
].begin();
3072 ::decode(struct_v
, bp
);
3073 assert(struct_v
>= 8);
3076 bp
= values
[epoch_key
].begin();
3077 ::decode(cur_epoch
, bp
);
3079 // probably bug 10617; see OSD::load_pgs()
3083 *pepoch
= cur_epoch
;
3087 #pragma GCC diagnostic pop
3088 #pragma GCC diagnostic warning "-Wpragmas"
3090 void PG::write_if_dirty(ObjectStore::Transaction
& t
)
3092 map
<string
,bufferlist
> km
;
3093 if (dirty_big_info
|| dirty_info
)
3094 prepare_write_info(&km
);
3095 pg_log
.write_log_and_missing(t
, &km
, coll
, pgmeta_oid
, pool
.info
.require_rollback());
3097 t
.omap_setkeys(coll
, pgmeta_oid
, km
);
3102 assert(is_primary());
3104 dout(10) << __func__
<< " to " << pg_trim_to
<< dendl
;
3105 if (pg_trim_to
!= eversion_t()) {
3106 // inform peers to trim log
3107 assert(!actingbackfill
.empty());
3108 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
3109 i
!= actingbackfill
.end();
3111 if (*i
== pg_whoami
) continue;
3112 osd
->send_message_osd_cluster(
3115 get_osdmap()->get_epoch(),
3116 spg_t(info
.pgid
.pgid
, i
->shard
),
3118 get_osdmap()->get_epoch());
3121 // trim primary as well
3122 pg_log
.trim(pg_trim_to
, info
);
3127 void PG::add_log_entry(const pg_log_entry_t
& e
, bool applied
)
3129 // raise last_complete only if we were previously up to date
3130 if (info
.last_complete
== info
.last_update
)
3131 info
.last_complete
= e
.version
;
3133 // raise last_update.
3134 assert(e
.version
> info
.last_update
);
3135 info
.last_update
= e
.version
;
3137 // raise user_version, if it increased (it may have not get bumped
3138 // by all logged updates)
3139 if (e
.user_version
> info
.last_user_version
)
3140 info
.last_user_version
= e
.user_version
;
3143 pg_log
.add(e
, applied
);
3144 dout(10) << "add_log_entry " << e
<< dendl
;
3148 void PG::append_log(
3149 const vector
<pg_log_entry_t
>& logv
,
3151 eversion_t roll_forward_to
,
3152 ObjectStore::Transaction
&t
,
3153 bool transaction_applied
)
3155 if (transaction_applied
)
3156 update_snap_map(logv
, t
);
3158 /* The primary has sent an info updating the history, but it may not
3159 * have arrived yet. We want to make sure that we cannot remember this
3160 * write without remembering that it happened in an interval which went
3161 * active in epoch history.last_epoch_started.
3163 if (info
.last_epoch_started
!= info
.history
.last_epoch_started
) {
3164 info
.history
.last_epoch_started
= info
.last_epoch_started
;
3166 if (info
.last_interval_started
!= info
.history
.last_interval_started
) {
3167 info
.history
.last_interval_started
= info
.last_interval_started
;
3169 dout(10) << "append_log " << pg_log
.get_log() << " " << logv
<< dendl
;
3171 PGLogEntryHandler handler
{this, &t
};
3172 if (!transaction_applied
) {
3173 /* We must be a backfill peer, so it's ok if we apply
3174 * out-of-turn since we won't be considered when
3175 * determining a min possible last_update.
3177 pg_log
.roll_forward(&handler
);
3180 for (vector
<pg_log_entry_t
>::const_iterator p
= logv
.begin();
3183 add_log_entry(*p
, transaction_applied
);
3185 /* We don't want to leave the rollforward artifacts around
3186 * here past last_backfill. It's ok for the same reason as
3188 if (transaction_applied
&&
3189 p
->soid
> info
.last_backfill
) {
3190 pg_log
.roll_forward(&handler
);
3193 auto last
= logv
.rbegin();
3194 if (is_primary() && last
!= logv
.rend()) {
3195 projected_log
.skip_can_rollback_to_to_head();
3196 projected_log
.trim(cct
, last
->version
, nullptr, nullptr, nullptr);
3199 if (transaction_applied
&& roll_forward_to
> pg_log
.get_can_rollback_to()) {
3200 pg_log
.roll_forward_to(
3203 t
.register_on_applied(
3204 new C_UpdateLastRollbackInfoTrimmedToApplied(
3206 get_osdmap()->get_epoch(),
3210 pg_log
.trim(trim_to
, info
);
3212 // update the local pg, pg log
3217 bool PG::check_log_for_corruption(ObjectStore
*store
)
3219 /// TODO: this method needs to work with the omap log
3223 //! Get the name we're going to save our corrupt page log as
3224 std::string
PG::get_corrupt_pg_log_name() const
3226 const int MAX_BUF
= 512;
3229 time_t my_time(time(NULL
));
3230 const struct tm
*t
= localtime_r(&my_time
, &tm_buf
);
3231 int ret
= strftime(buf
, sizeof(buf
), "corrupt_log_%Y-%m-%d_%k:%M_", t
);
3233 dout(0) << "strftime failed" << dendl
;
3234 return "corrupt_log_unknown_time";
3237 out
+= stringify(info
.pgid
);
3242 ObjectStore
*store
, spg_t pgid
, const coll_t
&coll
, bufferlist
&bl
,
3243 pg_info_t
&info
, PastIntervals
&past_intervals
,
3246 // try for v8 or later
3248 keys
.insert(infover_key
);
3249 keys
.insert(info_key
);
3250 keys
.insert(biginfo_key
);
3251 keys
.insert(fastinfo_key
);
3252 ghobject_t
pgmeta_oid(pgid
.make_pgmeta_oid());
3253 map
<string
,bufferlist
> values
;
3254 int r
= store
->omap_get_values(coll
, pgmeta_oid
, keys
, &values
);
3256 assert(values
.size() == 3 ||
3257 values
.size() == 4);
3259 bufferlist::iterator p
= values
[infover_key
].begin();
3260 ::decode(struct_v
, p
);
3261 assert(struct_v
>= 8);
3263 p
= values
[info_key
].begin();
3266 p
= values
[biginfo_key
].begin();
3267 if (struct_v
>= 10) {
3268 ::decode(past_intervals
, p
);
3270 past_intervals
.decode_classic(p
);
3272 ::decode(info
.purged_snaps
, p
);
3274 p
= values
[fastinfo_key
].begin();
3276 pg_fast_info_t fast
;
3278 fast
.try_apply_to(&info
);
3284 ghobject_t
infos_oid(OSD::make_infos_oid());
3285 bufferlist::iterator p
= bl
.begin();
3286 ::decode(struct_v
, p
);
3287 assert(struct_v
== 7);
3289 // get info out of leveldb
3290 string k
= get_info_key(info
.pgid
);
3291 string bk
= get_biginfo_key(info
.pgid
);
3296 store
->omap_get_values(coll_t::meta(), ghobject_t(infos_oid
), keys
, &values
);
3297 assert(values
.size() == 2);
3299 p
= values
[k
].begin();
3302 p
= values
[bk
].begin();
3303 ::decode(past_intervals
, p
);
3304 interval_set
<snapid_t
> snap_collections
; // obsolete
3305 ::decode(snap_collections
, p
);
3306 ::decode(info
.purged_snaps
, p
);
3310 void PG::read_state(ObjectStore
*store
, bufferlist
&bl
)
3312 int r
= read_info(store
, pg_id
, coll
, bl
, info
, past_intervals
,
3316 last_written_info
= info
;
3318 // if we are upgrading from jewel, we need to force rebuild of
3319 // missing set. v9 was fastinfo, added v11.0.2-331-g1d5dc29a13
3320 // (before kraken). persisted missing set was circa
3321 // v11.0.0-866-gb0e239da95 (a bit earlier, also before kraken).
3322 // v8 was pre-jewel (per-pg meta object).
3323 bool force_rebuild_missing
= info_struct_v
< 9;
3324 if (force_rebuild_missing
) {
3325 dout(10) << __func__
<< " detected upgrade from jewel, force_rebuild_missing"
3330 pg_log
.read_log_and_missing(
3333 info_struct_v
< 8 ? coll_t::meta() : coll
,
3334 ghobject_t(info_struct_v
< 8 ? OSD::make_pg_log_oid(pg_id
) : pgmeta_oid
),
3336 force_rebuild_missing
,
3338 cct
->_conf
->osd_ignore_stale_divergent_priors
,
3339 cct
->_conf
->osd_debug_verify_missing_on_start
);
3341 osd
->clog
->error() << oss
.rdbuf();
3343 if (force_rebuild_missing
) {
3344 dout(10) << __func__
<< " forced rebuild of missing got "
3345 << pg_log
.get_missing()
3349 // log any weirdness
3353 void PG::log_weirdness()
3355 if (pg_log
.get_tail() != info
.log_tail
)
3356 osd
->clog
->error() << info
.pgid
3357 << " info mismatch, log.tail " << pg_log
.get_tail()
3358 << " != info.log_tail " << info
.log_tail
;
3359 if (pg_log
.get_head() != info
.last_update
)
3360 osd
->clog
->error() << info
.pgid
3361 << " info mismatch, log.head " << pg_log
.get_head()
3362 << " != info.last_update " << info
.last_update
;
3364 if (!pg_log
.get_log().empty()) {
3366 if ((pg_log
.get_log().log
.begin()->version
<= pg_log
.get_tail()))
3367 osd
->clog
->error() << info
.pgid
3368 << " log bound mismatch, info (tail,head] ("
3369 << pg_log
.get_tail() << "," << pg_log
.get_head() << "]"
3371 << pg_log
.get_log().log
.begin()->version
<< ","
3372 << pg_log
.get_log().log
.rbegin()->version
<< "]";
3375 if (pg_log
.get_log().caller_ops
.size() > pg_log
.get_log().log
.size()) {
3376 osd
->clog
->error() << info
.pgid
3377 << " caller_ops.size " << pg_log
.get_log().caller_ops
.size()
3378 << " > log size " << pg_log
.get_log().log
.size();
3382 void PG::update_snap_map(
3383 const vector
<pg_log_entry_t
> &log_entries
,
3384 ObjectStore::Transaction
&t
)
3386 for (vector
<pg_log_entry_t
>::const_iterator i
= log_entries
.begin();
3387 i
!= log_entries
.end();
3389 OSDriver::OSTransaction
_t(osdriver
.get_transaction(&t
));
3390 if (i
->soid
.snap
< CEPH_MAXSNAP
) {
3391 if (i
->is_delete()) {
3392 int r
= snap_mapper
.remove_oid(
3396 } else if (i
->is_update()) {
3397 assert(i
->snaps
.length() > 0);
3398 vector
<snapid_t
> snaps
;
3399 bufferlist snapbl
= i
->snaps
;
3400 bufferlist::iterator p
= snapbl
.begin();
3406 set
<snapid_t
> _snaps(snaps
.begin(), snaps
.end());
3408 if (i
->is_clone() || i
->is_promote()) {
3409 snap_mapper
.add_oid(
3413 } else if (i
->is_modify()) {
3414 assert(i
->is_modify());
3415 int r
= snap_mapper
.update_snaps(
3422 assert(i
->is_clean());
3430 * filter trimming|trimmed snaps out of snapcontext
3432 void PG::filter_snapc(vector
<snapid_t
> &snaps
)
3434 //nothing needs to trim, we can return immediately
3435 if(snap_trimq
.empty() && info
.purged_snaps
.empty())
3438 bool filtering
= false;
3439 vector
<snapid_t
> newsnaps
;
3440 for (vector
<snapid_t
>::iterator p
= snaps
.begin();
3443 if (snap_trimq
.contains(*p
) || info
.purged_snaps
.contains(*p
)) {
3445 // start building a new vector with what we've seen so far
3446 dout(10) << "filter_snapc filtering " << snaps
<< dendl
;
3447 newsnaps
.insert(newsnaps
.begin(), snaps
.begin(), p
);
3450 dout(20) << "filter_snapc removing trimq|purged snap " << *p
<< dendl
;
3453 newsnaps
.push_back(*p
); // continue building new vector
3457 snaps
.swap(newsnaps
);
3458 dout(10) << "filter_snapc result " << snaps
<< dendl
;
3462 void PG::requeue_object_waiters(map
<hobject_t
, list
<OpRequestRef
>>& m
)
3464 for (map
<hobject_t
, list
<OpRequestRef
>>::iterator it
= m
.begin();
3467 requeue_ops(it
->second
);
3471 void PG::requeue_op(OpRequestRef op
)
3473 auto p
= waiting_for_map
.find(op
->get_source());
3474 if (p
!= waiting_for_map
.end()) {
3475 dout(20) << __func__
<< " " << op
<< " (waiting_for_map " << p
->first
<< ")"
3477 p
->second
.push_front(op
);
3479 dout(20) << __func__
<< " " << op
<< dendl
;
3480 osd
->enqueue_front(info
.pgid
, PGQueueable(op
, get_osdmap()->get_epoch()));
3484 void PG::requeue_ops(list
<OpRequestRef
> &ls
)
3486 for (list
<OpRequestRef
>::reverse_iterator i
= ls
.rbegin();
3489 auto p
= waiting_for_map
.find((*i
)->get_source());
3490 if (p
!= waiting_for_map
.end()) {
3491 dout(20) << __func__
<< " " << *i
<< " (waiting_for_map " << p
->first
3493 p
->second
.push_front(*i
);
3495 dout(20) << __func__
<< " " << *i
<< dendl
;
3496 osd
->enqueue_front(info
.pgid
, PGQueueable(*i
, get_osdmap()->get_epoch()));
3502 void PG::requeue_map_waiters()
3504 epoch_t epoch
= get_osdmap()->get_epoch();
3505 auto p
= waiting_for_map
.begin();
3506 while (p
!= waiting_for_map
.end()) {
3507 if (epoch
< p
->second
.front()->min_epoch
) {
3508 dout(20) << __func__
<< " " << p
->first
<< " front op "
3509 << p
->second
.front() << " must still wait, doing nothing"
3513 dout(20) << __func__
<< " " << p
->first
<< " " << p
->second
<< dendl
;
3514 for (auto q
= p
->second
.rbegin(); q
!= p
->second
.rend(); ++q
) {
3515 osd
->enqueue_front(info
.pgid
, PGQueueable(*q
, epoch
));
3517 p
= waiting_for_map
.erase(p
);
3523 // ==========================================================================================
3527 * when holding pg and sched_scrub_lock, then the states are:
3529 * scrubber.reserved = true
3530 * scrub_rserved_peers includes whoami
3531 * osd->scrub_pending++
3532 * scheduling, replica declined:
3533 * scrubber.reserved = true
3534 * scrubber.reserved_peers includes -1
3535 * osd->scrub_pending++
3537 * scrubber.reserved = true
3538 * scrubber.reserved_peers.size() == acting.size();
3540 * osd->scrub_pending++
3542 * scrubber.reserved = false;
3543 * scrubber.reserved_peers empty
3544 * osd->scrubber.active++
3547 // returns true if a scrub has been newly kicked off
3548 bool PG::sched_scrub()
3550 bool nodeep_scrub
= false;
3551 assert(is_locked());
3552 if (!(is_primary() && is_active() && is_clean() && !is_scrubbing())) {
3556 double deep_scrub_interval
= 0;
3557 pool
.info
.opts
.get(pool_opts_t::DEEP_SCRUB_INTERVAL
, &deep_scrub_interval
);
3558 if (deep_scrub_interval
<= 0) {
3559 deep_scrub_interval
= cct
->_conf
->osd_deep_scrub_interval
;
3561 bool time_for_deep
= ceph_clock_now() >=
3562 info
.history
.last_deep_scrub_stamp
+ deep_scrub_interval
;
3564 bool deep_coin_flip
= false;
3565 // Only add random deep scrubs when NOT user initiated scrub
3566 if (!scrubber
.must_scrub
)
3567 deep_coin_flip
= (rand() % 100) < cct
->_conf
->osd_deep_scrub_randomize_ratio
* 100;
3568 dout(20) << __func__
<< ": time_for_deep=" << time_for_deep
<< " deep_coin_flip=" << deep_coin_flip
<< dendl
;
3570 time_for_deep
= (time_for_deep
|| deep_coin_flip
);
3572 //NODEEP_SCRUB so ignore time initiated deep-scrub
3573 if (osd
->osd
->get_osdmap()->test_flag(CEPH_OSDMAP_NODEEP_SCRUB
) ||
3574 pool
.info
.has_flag(pg_pool_t::FLAG_NODEEP_SCRUB
)) {
3575 time_for_deep
= false;
3576 nodeep_scrub
= true;
3579 if (!scrubber
.must_scrub
) {
3580 assert(!scrubber
.must_deep_scrub
);
3582 //NOSCRUB so skip regular scrubs
3583 if ((osd
->osd
->get_osdmap()->test_flag(CEPH_OSDMAP_NOSCRUB
) ||
3584 pool
.info
.has_flag(pg_pool_t::FLAG_NOSCRUB
)) && !time_for_deep
) {
3585 if (scrubber
.reserved
) {
3586 // cancel scrub if it is still in scheduling,
3587 // so pgs from other pools where scrub are still legal
3588 // have a chance to go ahead with scrubbing.
3589 clear_scrub_reserved();
3590 scrub_unreserve_replicas();
3596 if (cct
->_conf
->osd_scrub_auto_repair
3597 && get_pgbackend()->auto_repair_supported()
3599 // respect the command from user, and not do auto-repair
3600 && !scrubber
.must_repair
3601 && !scrubber
.must_scrub
3602 && !scrubber
.must_deep_scrub
) {
3603 dout(20) << __func__
<< ": auto repair with deep scrubbing" << dendl
;
3604 scrubber
.auto_repair
= true;
3606 // this happens when user issue the scrub/repair command during
3607 // the scheduling of the scrub/repair (e.g. request reservation)
3608 scrubber
.auto_repair
= false;
3612 if (!scrubber
.reserved
) {
3613 assert(scrubber
.reserved_peers
.empty());
3614 if (osd
->inc_scrubs_pending()) {
3615 dout(20) << "sched_scrub: reserved locally, reserving replicas" << dendl
;
3616 scrubber
.reserved
= true;
3617 scrubber
.reserved_peers
.insert(pg_whoami
);
3618 scrub_reserve_replicas();
3620 dout(20) << "sched_scrub: failed to reserve locally" << dendl
;
3624 if (scrubber
.reserved
) {
3625 if (scrubber
.reserve_failed
) {
3626 dout(20) << "sched_scrub: failed, a peer declined" << dendl
;
3627 clear_scrub_reserved();
3628 scrub_unreserve_replicas();
3630 } else if (scrubber
.reserved_peers
.size() == acting
.size()) {
3631 dout(20) << "sched_scrub: success, reserved self and replicas" << dendl
;
3632 if (time_for_deep
) {
3633 dout(10) << "sched_scrub: scrub will be deep" << dendl
;
3634 state_set(PG_STATE_DEEP_SCRUB
);
3635 } else if (!scrubber
.must_deep_scrub
&& info
.stats
.stats
.sum
.num_deep_scrub_errors
) {
3636 if (!nodeep_scrub
) {
3637 osd
->clog
->info() << "osd." << osd
->whoami
3638 << " pg " << info
.pgid
3639 << " Deep scrub errors, upgrading scrub to deep-scrub";
3640 state_set(PG_STATE_DEEP_SCRUB
);
3641 } else if (!scrubber
.must_scrub
) {
3642 osd
->clog
->error() << "osd." << osd
->whoami
3643 << " pg " << info
.pgid
3644 << " Regular scrub skipped due to deep-scrub errors and nodeep-scrub set";
3645 clear_scrub_reserved();
3646 scrub_unreserve_replicas();
3649 osd
->clog
->error() << "osd." << osd
->whoami
3650 << " pg " << info
.pgid
3651 << " Regular scrub request, deep-scrub details will be lost";
3656 // none declined, since scrubber.reserved is set
3657 dout(20) << "sched_scrub: reserved " << scrubber
.reserved_peers
<< ", waiting for replicas" << dendl
;
3664 void PG::reg_next_scrub()
3670 if (scrubber
.must_scrub
||
3671 (info
.stats
.stats_invalid
&& cct
->_conf
->osd_scrub_invalid_stats
)) {
3672 reg_stamp
= ceph_clock_now();
3674 reg_stamp
= info
.history
.last_scrub_stamp
;
3676 // note down the sched_time, so we can locate this scrub, and remove it
3678 double scrub_min_interval
= 0, scrub_max_interval
= 0;
3679 pool
.info
.opts
.get(pool_opts_t::SCRUB_MIN_INTERVAL
, &scrub_min_interval
);
3680 pool
.info
.opts
.get(pool_opts_t::SCRUB_MAX_INTERVAL
, &scrub_max_interval
);
3681 assert(scrubber
.scrub_reg_stamp
== utime_t());
3682 scrubber
.scrub_reg_stamp
= osd
->reg_pg_scrub(info
.pgid
,
3686 scrubber
.must_scrub
);
3689 void PG::unreg_next_scrub()
3692 osd
->unreg_pg_scrub(info
.pgid
, scrubber
.scrub_reg_stamp
);
3693 scrubber
.scrub_reg_stamp
= utime_t();
3697 void PG::do_replica_scrub_map(OpRequestRef op
)
3699 const MOSDRepScrubMap
*m
= static_cast<const MOSDRepScrubMap
*>(op
->get_req());
3700 dout(7) << __func__
<< " " << *m
<< dendl
;
3701 if (m
->map_epoch
< info
.history
.same_interval_since
) {
3702 dout(10) << __func__
<< " discarding old from "
3703 << m
->map_epoch
<< " < " << info
.history
.same_interval_since
3707 if (!scrubber
.is_chunky_scrub_active()) {
3708 dout(10) << __func__
<< " scrub isn't active" << dendl
;
3714 bufferlist::iterator p
= const_cast<bufferlist
&>(m
->get_data()).begin();
3715 scrubber
.received_maps
[m
->from
].decode(p
, info
.pgid
.pool());
3716 dout(10) << "map version is "
3717 << scrubber
.received_maps
[m
->from
].valid_through
3720 --scrubber
.waiting_on
;
3721 scrubber
.waiting_on_whom
.erase(m
->from
);
3722 if (scrubber
.waiting_on
== 0) {
3723 if (ops_blocked_by_scrub()) {
3724 requeue_scrub(true);
3726 requeue_scrub(false);
3731 void PG::sub_op_scrub_map(OpRequestRef op
)
3733 // for legacy jewel compatibility only
3734 const MOSDSubOp
*m
= static_cast<const MOSDSubOp
*>(op
->get_req());
3735 assert(m
->get_type() == MSG_OSD_SUBOP
);
3736 dout(7) << "sub_op_scrub_map" << dendl
;
3738 if (m
->map_epoch
< info
.history
.same_interval_since
) {
3739 dout(10) << "sub_op_scrub discarding old sub_op from "
3740 << m
->map_epoch
<< " < " << info
.history
.same_interval_since
<< dendl
;
3744 if (!scrubber
.is_chunky_scrub_active()) {
3745 dout(10) << "sub_op_scrub_map scrub isn't active" << dendl
;
3751 dout(10) << " got " << m
->from
<< " scrub map" << dendl
;
3752 bufferlist::iterator p
= const_cast<bufferlist
&>(m
->get_data()).begin();
3754 scrubber
.received_maps
[m
->from
].decode(p
, info
.pgid
.pool());
3755 dout(10) << "map version is "
3756 << scrubber
.received_maps
[m
->from
].valid_through
3759 --scrubber
.waiting_on
;
3760 scrubber
.waiting_on_whom
.erase(m
->from
);
3762 if (scrubber
.waiting_on
== 0) {
3763 if (ops_blocked_by_scrub()) {
3764 requeue_scrub(true);
3766 requeue_scrub(false);
3771 // send scrub v3 messages (chunky scrub)
3772 void PG::_request_scrub_map(
3773 pg_shard_t replica
, eversion_t version
,
3774 hobject_t start
, hobject_t end
,
3775 bool deep
, uint32_t seed
)
3777 assert(replica
!= pg_whoami
);
3778 dout(10) << "scrub requesting scrubmap from osd." << replica
3779 << " deep " << (int)deep
<< " seed " << seed
<< dendl
;
3780 MOSDRepScrub
*repscrubop
= new MOSDRepScrub(
3781 spg_t(info
.pgid
.pgid
, replica
.shard
), version
,
3782 get_osdmap()->get_epoch(),
3783 get_last_peering_reset(),
3784 start
, end
, deep
, seed
);
3785 // default priority, we want the rep scrub processed prior to any recovery
3786 // or client io messages (we are holding a lock!)
3787 osd
->send_message_osd_cluster(
3788 replica
.osd
, repscrubop
, get_osdmap()->get_epoch());
3791 void PG::handle_scrub_reserve_request(OpRequestRef op
)
3793 dout(7) << __func__
<< " " << *op
->get_req() << dendl
;
3795 if (scrubber
.reserved
) {
3796 dout(10) << __func__
<< " ignoring reserve request: Already reserved"
3800 scrubber
.reserved
= osd
->inc_scrubs_pending();
3801 if (op
->get_req()->get_type() == MSG_OSD_SCRUB_RESERVE
) {
3802 const MOSDScrubReserve
*m
=
3803 static_cast<const MOSDScrubReserve
*>(op
->get_req());
3804 Message
*reply
= new MOSDScrubReserve(
3805 spg_t(info
.pgid
.pgid
, primary
.shard
),
3807 scrubber
.reserved
? MOSDScrubReserve::GRANT
: MOSDScrubReserve::REJECT
,
3809 osd
->send_message_osd_cluster(reply
, op
->get_req()->get_connection());
3811 // for jewel compat only
3812 const MOSDSubOp
*req
= static_cast<const MOSDSubOp
*>(op
->get_req());
3813 assert(req
->get_type() == MSG_OSD_SUBOP
);
3814 MOSDSubOpReply
*reply
= new MOSDSubOpReply(
3815 req
, pg_whoami
, 0, get_osdmap()->get_epoch(), CEPH_OSD_FLAG_ACK
);
3816 ::encode(scrubber
.reserved
, reply
->get_data());
3817 osd
->send_message_osd_cluster(reply
, op
->get_req()->get_connection());
3821 void PG::handle_scrub_reserve_grant(OpRequestRef op
, pg_shard_t from
)
3823 dout(7) << __func__
<< " " << *op
->get_req() << dendl
;
3825 if (!scrubber
.reserved
) {
3826 dout(10) << "ignoring obsolete scrub reserve reply" << dendl
;
3829 if (scrubber
.reserved_peers
.find(from
) != scrubber
.reserved_peers
.end()) {
3830 dout(10) << " already had osd." << from
<< " reserved" << dendl
;
3832 dout(10) << " osd." << from
<< " scrub reserve = success" << dendl
;
3833 scrubber
.reserved_peers
.insert(from
);
3838 void PG::handle_scrub_reserve_reject(OpRequestRef op
, pg_shard_t from
)
3840 dout(7) << __func__
<< " " << *op
->get_req() << dendl
;
3842 if (!scrubber
.reserved
) {
3843 dout(10) << "ignoring obsolete scrub reserve reply" << dendl
;
3846 if (scrubber
.reserved_peers
.find(from
) != scrubber
.reserved_peers
.end()) {
3847 dout(10) << " already had osd." << from
<< " reserved" << dendl
;
3849 /* One decline stops this pg from being scheduled for scrubbing. */
3850 dout(10) << " osd." << from
<< " scrub reserve = fail" << dendl
;
3851 scrubber
.reserve_failed
= true;
3856 void PG::handle_scrub_reserve_release(OpRequestRef op
)
3858 dout(7) << __func__
<< " " << *op
->get_req() << dendl
;
3860 clear_scrub_reserved();
3863 void PG::reject_reservation()
3865 osd
->send_message_osd_cluster(
3867 new MBackfillReserve(
3868 MBackfillReserve::REJECT
,
3869 spg_t(info
.pgid
.pgid
, primary
.shard
),
3870 get_osdmap()->get_epoch()),
3871 get_osdmap()->get_epoch());
3874 void PG::schedule_backfill_full_retry()
3876 Mutex::Locker
lock(osd
->recovery_request_lock
);
3877 osd
->recovery_request_timer
.add_event_after(
3878 cct
->_conf
->osd_backfill_retry_interval
,
3879 new QueuePeeringEvt
<RequestBackfill
>(
3880 this, get_osdmap()->get_epoch(),
3881 RequestBackfill()));
3884 void PG::schedule_recovery_full_retry()
3886 Mutex::Locker
lock(osd
->recovery_request_lock
);
3887 osd
->recovery_request_timer
.add_event_after(
3888 cct
->_conf
->osd_recovery_retry_interval
,
3889 new QueuePeeringEvt
<DoRecovery
>(
3890 this, get_osdmap()->get_epoch(),
3894 void PG::clear_scrub_reserved()
3896 scrubber
.reserved_peers
.clear();
3897 scrubber
.reserve_failed
= false;
3899 if (scrubber
.reserved
) {
3900 scrubber
.reserved
= false;
3901 osd
->dec_scrubs_pending();
3905 void PG::scrub_reserve_replicas()
3907 assert(backfill_targets
.empty());
3908 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
3909 i
!= actingbackfill
.end();
3911 if (*i
== pg_whoami
) continue;
3912 dout(10) << "scrub requesting reserve from osd." << *i
<< dendl
;
3913 if (HAVE_FEATURE(get_min_acting_features(), SERVER_LUMINOUS
)) {
3914 osd
->send_message_osd_cluster(
3916 new MOSDScrubReserve(spg_t(info
.pgid
.pgid
, i
->shard
),
3917 get_osdmap()->get_epoch(),
3918 MOSDScrubReserve::REQUEST
, pg_whoami
),
3919 get_osdmap()->get_epoch());
3921 // for jewel compat only
3922 vector
<OSDOp
> scrub(1);
3923 scrub
[0].op
.op
= CEPH_OSD_OP_SCRUB_RESERVE
;
3927 MOSDSubOp
*subop
= new MOSDSubOp(
3928 reqid
, pg_whoami
, spg_t(info
.pgid
.pgid
, i
->shard
), poid
, 0,
3929 get_osdmap()->get_epoch(), osd
->get_tid(), v
);
3931 osd
->send_message_osd_cluster(
3932 i
->osd
, subop
, get_osdmap()->get_epoch());
3937 void PG::scrub_unreserve_replicas()
3939 assert(backfill_targets
.empty());
3940 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
3941 i
!= actingbackfill
.end();
3943 if (*i
== pg_whoami
) continue;
3944 dout(10) << "scrub requesting unreserve from osd." << *i
<< dendl
;
3945 if (HAVE_FEATURE(get_min_acting_features(), SERVER_LUMINOUS
)) {
3946 osd
->send_message_osd_cluster(
3948 new MOSDScrubReserve(spg_t(info
.pgid
.pgid
, i
->shard
),
3949 get_osdmap()->get_epoch(),
3950 MOSDScrubReserve::RELEASE
, pg_whoami
),
3951 get_osdmap()->get_epoch());
3953 // for jewel compat only
3954 vector
<OSDOp
> scrub(1);
3955 scrub
[0].op
.op
= CEPH_OSD_OP_SCRUB_UNRESERVE
;
3959 MOSDSubOp
*subop
= new MOSDSubOp(
3960 reqid
, pg_whoami
, spg_t(info
.pgid
.pgid
, i
->shard
), poid
, 0,
3961 get_osdmap()->get_epoch(), osd
->get_tid(), v
);
3963 osd
->send_message_osd_cluster(i
->osd
, subop
, get_osdmap()->get_epoch());
3968 void PG::_scan_rollback_obs(
3969 const vector
<ghobject_t
> &rollback_obs
,
3970 ThreadPool::TPHandle
&handle
)
3972 ObjectStore::Transaction t
;
3973 eversion_t trimmed_to
= last_rollback_info_trimmed_to_applied
;
3974 for (vector
<ghobject_t
>::const_iterator i
= rollback_obs
.begin();
3975 i
!= rollback_obs
.end();
3977 if (i
->generation
< trimmed_to
.version
) {
3978 osd
->clog
->error() << "osd." << osd
->whoami
3979 << " pg " << info
.pgid
3980 << " found obsolete rollback obj "
3981 << *i
<< " generation < trimmed_to "
3988 derr
<< __func__
<< ": queueing trans to clean up obsolete rollback objs"
3990 osd
->store
->queue_transaction(osr
.get(), std::move(t
), NULL
);
3994 void PG::_scan_snaps(ScrubMap
&smap
)
3998 for (map
<hobject_t
, ScrubMap::object
>::reverse_iterator i
= smap
.objects
.rbegin();
3999 i
!= smap
.objects
.rend();
4001 const hobject_t
&hoid
= i
->first
;
4002 ScrubMap::object
&o
= i
->second
;
4004 if (hoid
.is_head() || hoid
.is_snapdir()) {
4005 // parse the SnapSet
4007 if (o
.attrs
.find(SS_ATTR
) == o
.attrs
.end()) {
4010 bl
.push_back(o
.attrs
[SS_ATTR
]);
4011 auto p
= bl
.begin();
4013 ::decode(snapset
, p
);
4017 head
= hoid
.get_head();
4020 if (hoid
.snap
< CEPH_MAXSNAP
) {
4021 // check and if necessary fix snap_mapper
4022 if (hoid
.get_head() != head
) {
4023 derr
<< __func__
<< " no head for " << hoid
<< " (have " << head
<< ")"
4027 set
<snapid_t
> obj_snaps
;
4028 if (!snapset
.is_legacy()) {
4029 auto p
= snapset
.clone_snaps
.find(hoid
.snap
);
4030 if (p
== snapset
.clone_snaps
.end()) {
4031 derr
<< __func__
<< " no clone_snaps for " << hoid
<< " in " << snapset
4035 obj_snaps
.insert(p
->second
.begin(), p
->second
.end());
4038 if (o
.attrs
.find(OI_ATTR
) == o
.attrs
.end()) {
4041 bl
.push_back(o
.attrs
[OI_ATTR
]);
4048 obj_snaps
.insert(oi
.legacy_snaps
.begin(), oi
.legacy_snaps
.end());
4050 set
<snapid_t
> cur_snaps
;
4051 int r
= snap_mapper
.get_snaps(hoid
, &cur_snaps
);
4052 if (r
!= 0 && r
!= -ENOENT
) {
4053 derr
<< __func__
<< ": get_snaps returned " << cpp_strerror(r
) << dendl
;
4056 if (r
== -ENOENT
|| cur_snaps
!= obj_snaps
) {
4057 ObjectStore::Transaction t
;
4058 OSDriver::OSTransaction
_t(osdriver
.get_transaction(&t
));
4060 r
= snap_mapper
.remove_oid(hoid
, &_t
);
4062 derr
<< __func__
<< ": remove_oid returned " << cpp_strerror(r
)
4066 osd
->clog
->error() << "osd." << osd
->whoami
4067 << " found snap mapper error on pg "
4069 << " oid " << hoid
<< " snaps in mapper: "
4070 << cur_snaps
<< ", oi: "
4074 osd
->clog
->error() << "osd." << osd
->whoami
4075 << " found snap mapper error on pg "
4077 << " oid " << hoid
<< " snaps missing in mapper"
4082 snap_mapper
.add_oid(hoid
, obj_snaps
, &_t
);
4083 r
= osd
->store
->apply_transaction(osr
.get(), std::move(t
));
4085 derr
<< __func__
<< ": apply_transaction got " << cpp_strerror(r
)
4093 void PG::_repair_oinfo_oid(ScrubMap
&smap
)
4095 for (map
<hobject_t
, ScrubMap::object
>::reverse_iterator i
= smap
.objects
.rbegin();
4096 i
!= smap
.objects
.rend();
4098 const hobject_t
&hoid
= i
->first
;
4099 ScrubMap::object
&o
= i
->second
;
4102 if (o
.attrs
.find(OI_ATTR
) == o
.attrs
.end()) {
4105 bl
.push_back(o
.attrs
[OI_ATTR
]);
4112 if (oi
.soid
!= hoid
) {
4113 ObjectStore::Transaction t
;
4114 OSDriver::OSTransaction
_t(osdriver
.get_transaction(&t
));
4115 osd
->clog
->error() << "osd." << osd
->whoami
4116 << " found object info error on pg "
4118 << " oid " << hoid
<< " oid in object info: "
4124 ::encode(oi
, bl
, get_osdmap()->get_features(CEPH_ENTITY_TYPE_OSD
, nullptr));
4126 bufferptr
bp(bl
.c_str(), bl
.length());
4127 o
.attrs
[OI_ATTR
] = bp
;
4129 t
.setattr(coll
, ghobject_t(hoid
), OI_ATTR
, bl
);
4130 int r
= osd
->store
->apply_transaction(osr
.get(), std::move(t
));
4132 derr
<< __func__
<< ": apply_transaction got " << cpp_strerror(r
)
4140 * build a scrub map over a chunk without releasing the lock
4141 * only used by chunky scrub
4143 int PG::build_scrub_map_chunk(
4145 hobject_t start
, hobject_t end
, bool deep
, uint32_t seed
,
4146 ThreadPool::TPHandle
&handle
)
4148 dout(10) << __func__
<< " [" << start
<< "," << end
<< ") "
4149 << " seed " << seed
<< dendl
;
4151 map
.valid_through
= info
.last_update
;
4154 vector
<hobject_t
> ls
;
4155 vector
<ghobject_t
> rollback_obs
;
4156 int ret
= get_pgbackend()->objects_list_range(
4163 dout(5) << "objects_list_range error: " << ret
<< dendl
;
4168 get_pgbackend()->be_scan_list(map
, ls
, deep
, seed
, handle
);
4169 _scan_rollback_obs(rollback_obs
, handle
);
4171 _repair_oinfo_oid(map
);
4173 dout(20) << __func__
<< " done" << dendl
;
4177 void PG::Scrubber::cleanup_store(ObjectStore::Transaction
*t
) {
4180 struct OnComplete
: Context
{
4181 std::unique_ptr
<Scrub::Store
> store
;
4183 std::unique_ptr
<Scrub::Store
> &&store
)
4184 : store(std::move(store
)) {}
4185 void finish(int) override
{}
4188 t
->register_on_complete(new OnComplete(std::move(store
)));
4192 void PG::repair_object(
4193 const hobject_t
& soid
, list
<pair
<ScrubMap::object
, pg_shard_t
> > *ok_peers
,
4194 pg_shard_t bad_peer
)
4196 list
<pg_shard_t
> op_shards
;
4197 for (auto i
: *ok_peers
) {
4198 op_shards
.push_back(i
.second
);
4200 dout(10) << "repair_object " << soid
<< " bad_peer osd."
4201 << bad_peer
<< " ok_peers osd.{" << op_shards
<< "}" << dendl
;
4202 ScrubMap::object
&po
= ok_peers
->back().first
;
4205 bv
.push_back(po
.attrs
[OI_ATTR
]);
4208 bufferlist::iterator bliter
= bv
.begin();
4209 ::decode(oi
, bliter
);
4211 dout(0) << __func__
<< ": Need version of replica, bad object_info_t: " << soid
<< dendl
;
4214 if (bad_peer
!= primary
) {
4215 peer_missing
[bad_peer
].add(soid
, oi
.version
, eversion_t(), false);
4217 // We should only be scrubbing if the PG is clean.
4218 assert(waiting_for_unreadable_object
.empty());
4220 pg_log
.missing_add(soid
, oi
.version
, eversion_t());
4222 pg_log
.set_last_requested(0);
4223 dout(10) << __func__
<< ": primary = " << primary
<< dendl
;
4226 if (is_ec_pg() || bad_peer
== primary
) {
4227 // we'd better collect all shard for EC pg, and prepare good peers as the
4228 // source of pull in the case of replicated pg.
4229 missing_loc
.add_missing(soid
, oi
.version
, eversion_t());
4230 list
<pair
<ScrubMap::object
, pg_shard_t
> >::iterator i
;
4231 for (i
= ok_peers
->begin();
4232 i
!= ok_peers
->end();
4234 missing_loc
.add_location(soid
, i
->second
);
4240 * Wait for last_update_applied to match msg->scrub_to as above. Wait
4241 * for pushes to complete in case of recent recovery. Build a single
4242 * scrubmap of objects that are in the range [msg->start, msg->end).
4244 void PG::replica_scrub(
4246 ThreadPool::TPHandle
&handle
)
4248 const MOSDRepScrub
*msg
= static_cast<const MOSDRepScrub
*>(op
->get_req());
4249 assert(!scrubber
.active_rep_scrub
);
4250 dout(7) << "replica_scrub" << dendl
;
4252 if (msg
->map_epoch
< info
.history
.same_interval_since
) {
4253 dout(10) << "replica_scrub discarding old replica_scrub from "
4254 << msg
->map_epoch
<< " < " << info
.history
.same_interval_since
4261 assert(msg
->chunky
);
4262 if (last_update_applied
< msg
->scrub_to
) {
4263 dout(10) << "waiting for last_update_applied to catch up" << dendl
;
4264 scrubber
.active_rep_scrub
= op
;
4268 if (active_pushes
> 0) {
4269 dout(10) << "waiting for active pushes to finish" << dendl
;
4270 scrubber
.active_rep_scrub
= op
;
4274 // compensate for hobject_t's with wrong pool from sloppy hammer OSDs
4275 hobject_t start
= msg
->start
;
4276 hobject_t end
= msg
->end
;
4277 if (!start
.is_max())
4278 start
.pool
= info
.pgid
.pool();
4280 end
.pool
= info
.pgid
.pool();
4282 build_scrub_map_chunk(
4283 map
, start
, end
, msg
->deep
, msg
->seed
,
4286 if (HAVE_FEATURE(acting_features
, SERVER_LUMINOUS
)) {
4287 MOSDRepScrubMap
*reply
= new MOSDRepScrubMap(
4288 spg_t(info
.pgid
.pgid
, get_primary().shard
),
4291 ::encode(map
, reply
->get_data());
4292 osd
->send_message_osd_cluster(reply
, msg
->get_connection());
4294 // for jewel compatibility
4295 vector
<OSDOp
> scrub(1);
4296 scrub
[0].op
.op
= CEPH_OSD_OP_SCRUB_MAP
;
4300 MOSDSubOp
*subop
= new MOSDSubOp(
4303 spg_t(info
.pgid
.pgid
, get_primary().shard
),
4309 ::encode(map
, subop
->get_data());
4311 osd
->send_message_osd_cluster(subop
, msg
->get_connection());
4316 * PG_STATE_SCRUBBING is set when the scrub is queued
4318 * scrub will be chunky if all OSDs in PG support chunky scrub
4319 * scrub will fail if OSDs are too old.
4321 void PG::scrub(epoch_t queued
, ThreadPool::TPHandle
&handle
)
4323 if (cct
->_conf
->osd_scrub_sleep
> 0 &&
4324 (scrubber
.state
== PG::Scrubber::NEW_CHUNK
||
4325 scrubber
.state
== PG::Scrubber::INACTIVE
) &&
4326 scrubber
.needs_sleep
) {
4327 ceph_assert(!scrubber
.sleeping
);
4328 dout(20) << __func__
<< " state is INACTIVE|NEW_CHUNK, sleeping" << dendl
;
4330 // Do an async sleep so we don't block the op queue
4331 OSDService
*osds
= osd
;
4332 spg_t pgid
= get_pgid();
4333 int state
= scrubber
.state
;
4334 auto scrub_requeue_callback
=
4335 new FunctionContext([osds
, pgid
, state
](int r
) {
4336 PG
*pg
= osds
->osd
->lookup_lock_pg(pgid
);
4337 if (pg
== nullptr) {
4338 lgeneric_dout(osds
->osd
->cct
, 20)
4339 << "scrub_requeue_callback: Could not find "
4340 << "PG " << pgid
<< " can't complete scrub requeue after sleep"
4344 pg
->scrubber
.sleeping
= false;
4345 pg
->scrubber
.needs_sleep
= false;
4346 lgeneric_dout(pg
->cct
, 20)
4347 << "scrub_requeue_callback: slept for "
4348 << ceph_clock_now() - pg
->scrubber
.sleep_start
4349 << ", re-queuing scrub with state " << state
<< dendl
;
4350 pg
->scrub_queued
= false;
4351 pg
->requeue_scrub();
4352 pg
->scrubber
.sleep_start
= utime_t();
4355 Mutex::Locker
l(osd
->scrub_sleep_lock
);
4356 osd
->scrub_sleep_timer
.add_event_after(cct
->_conf
->osd_scrub_sleep
,
4357 scrub_requeue_callback
);
4358 scrubber
.sleeping
= true;
4359 scrubber
.sleep_start
= ceph_clock_now();
4362 if (pg_has_reset_since(queued
)) {
4365 assert(scrub_queued
);
4366 scrub_queued
= false;
4367 scrubber
.needs_sleep
= true;
4369 if (!is_primary() || !is_active() || !is_clean() || !is_scrubbing()) {
4370 dout(10) << "scrub -- not primary or active or not clean" << dendl
;
4371 state_clear(PG_STATE_SCRUBBING
);
4372 state_clear(PG_STATE_REPAIR
);
4373 state_clear(PG_STATE_DEEP_SCRUB
);
4374 publish_stats_to_osd();
4378 if (!scrubber
.active
) {
4379 assert(backfill_targets
.empty());
4381 scrubber
.deep
= state_test(PG_STATE_DEEP_SCRUB
);
4383 dout(10) << "starting a new chunky scrub" << dendl
;
4386 chunky_scrub(handle
);
4390 * Chunky scrub scrubs objects one chunk at a time with writes blocked for that
4393 * The object store is partitioned into chunks which end on hash boundaries. For
4394 * each chunk, the following logic is performed:
4396 * (1) Block writes on the chunk
4397 * (2) Request maps from replicas
4398 * (3) Wait for pushes to be applied (after recovery)
4399 * (4) Wait for writes to flush on the chunk
4400 * (5) Wait for maps from replicas
4401 * (6) Compare / repair all scrub maps
4402 * (7) Wait for digest updates to apply
4404 * This logic is encoded in the mostly linear state machine:
4406 * +------------------+
4407 * _________v__________ |
4410 * |____________________| |
4413 * _________v___v______ | |
4416 * |____________________| | |
4418 * _________v__________ | |
4420 * | WAIT_PUSHES | | |
4421 * |____________________| | |
4423 * _________v__________ | |
4425 * | WAIT_LAST_UPDATE | | |
4426 * |____________________| | |
4428 * _________v__________ | |
4431 * |____________________| | |
4433 * _________v__________ | |
4435 * | WAIT_REPLICAS | | |
4436 * |____________________| | |
4438 * _________v__________ | |
4440 * | COMPARE_MAPS | | |
4441 * |____________________| | |
4444 * _________v__________ | |
4446 * |WAIT_DIGEST_UPDATES | | |
4447 * |____________________| | |
4450 * _________v__________ |
4453 * |____________________| |
4455 * +------------------+
4457 * The primary determines the last update from the subset by walking the log. If
4458 * it sees a log entry pertaining to a file in the chunk, it tells the replicas
4459 * to wait until that update is applied before building a scrub map. Both the
4460 * primary and replicas will wait for any active pushes to be applied.
4462 * In contrast to classic_scrub, chunky_scrub is entirely handled by scrub_wq.
4464 * scrubber.state encodes the current state of the scrub (refer to state diagram
4467 void PG::chunky_scrub(ThreadPool::TPHandle
&handle
)
4469 // check for map changes
4470 if (scrubber
.is_chunky_scrub_active()) {
4471 if (scrubber
.epoch_start
!= info
.history
.same_interval_since
) {
4472 dout(10) << "scrub pg changed, aborting" << dendl
;
4473 scrub_clear_state();
4474 scrub_unreserve_replicas();
4483 dout(20) << "scrub state " << Scrubber::state_string(scrubber
.state
)
4484 << " [" << scrubber
.start
<< "," << scrubber
.end
<< ")" << dendl
;
4486 switch (scrubber
.state
) {
4487 case PG::Scrubber::INACTIVE
:
4488 dout(10) << "scrub start" << dendl
;
4490 publish_stats_to_osd();
4491 scrubber
.epoch_start
= info
.history
.same_interval_since
;
4492 scrubber
.active
= true;
4494 osd
->inc_scrubs_active(scrubber
.reserved
);
4495 if (scrubber
.reserved
) {
4496 scrubber
.reserved
= false;
4497 scrubber
.reserved_peers
.clear();
4501 ObjectStore::Transaction t
;
4502 scrubber
.cleanup_store(&t
);
4503 scrubber
.store
.reset(Scrub::Store::create(osd
->store
, &t
,
4505 osd
->store
->queue_transaction(osr
.get(), std::move(t
), nullptr);
4508 // Don't include temporary objects when scrubbing
4509 scrubber
.start
= info
.pgid
.pgid
.get_hobj_start();
4510 scrubber
.state
= PG::Scrubber::NEW_CHUNK
;
4513 bool repair
= state_test(PG_STATE_REPAIR
);
4514 bool deep_scrub
= state_test(PG_STATE_DEEP_SCRUB
);
4515 const char *mode
= (repair
? "repair": (deep_scrub
? "deep-scrub" : "scrub"));
4517 oss
<< info
.pgid
.pgid
<< " " << mode
<< " starts" << std::endl
;
4518 osd
->clog
->debug(oss
);
4525 case PG::Scrubber::NEW_CHUNK
:
4526 scrubber
.primary_scrubmap
= ScrubMap();
4527 scrubber
.received_maps
.clear();
4530 /* get the start and end of our scrub chunk
4532 * Our scrub chunk has an important restriction we're going to need to
4533 * respect. We can't let head or snapdir be start or end.
4534 * Using a half-open interval means that if end == head|snapdir,
4535 * we'd scrub/lock head and the clone right next to head in different
4536 * chunks which would allow us to miss clones created between
4537 * scrubbing that chunk and scrubbing the chunk including head.
4538 * This isn't true for any of the other clones since clones can
4539 * only be created "just to the left of" head. There is one exception
4540 * to this: promotion of clones which always happens to the left of the
4541 * left-most clone, but promote_object checks the scrubber in that
4542 * case, so it should be ok. Also, it's ok to "miss" clones at the
4543 * left end of the range if we are a tier because they may legitimately
4544 * not exist (see _scrub).
4546 int min
= MAX(3, cct
->_conf
->osd_scrub_chunk_min
);
4547 hobject_t start
= scrubber
.start
;
4548 hobject_t candidate_end
;
4549 vector
<hobject_t
> objects
;
4550 ret
= get_pgbackend()->objects_list_partial(
4553 MAX(min
, cct
->_conf
->osd_scrub_chunk_max
),
4558 if (!objects
.empty()) {
4559 hobject_t back
= objects
.back();
4560 while (candidate_end
.has_snapset() &&
4561 candidate_end
.get_head() == back
.get_head()) {
4562 candidate_end
= back
;
4564 if (objects
.empty()) {
4566 "Somehow we got more than 2 objects which"
4567 "have the same head but are not clones");
4569 back
= objects
.back();
4571 if (candidate_end
.has_snapset()) {
4572 assert(candidate_end
.get_head() != back
.get_head());
4573 candidate_end
= candidate_end
.get_object_boundary();
4576 assert(candidate_end
.is_max());
4579 if (!_range_available_for_scrub(scrubber
.start
, candidate_end
)) {
4580 // we'll be requeued by whatever made us unavailable for scrub
4581 dout(10) << __func__
<< ": scrub blocked somewhere in range "
4582 << "[" << scrubber
.start
<< ", " << candidate_end
<< ")"
4587 scrubber
.end
= candidate_end
;
4590 // walk the log to find the latest update that affects our chunk
4591 scrubber
.subset_last_update
= eversion_t();
4592 for (auto p
= projected_log
.log
.rbegin();
4593 p
!= projected_log
.log
.rend();
4595 if (p
->soid
>= scrubber
.start
&&
4596 p
->soid
< scrubber
.end
) {
4597 scrubber
.subset_last_update
= p
->version
;
4601 if (scrubber
.subset_last_update
== eversion_t()) {
4602 for (list
<pg_log_entry_t
>::const_reverse_iterator p
=
4603 pg_log
.get_log().log
.rbegin();
4604 p
!= pg_log
.get_log().log
.rend();
4606 if (p
->soid
>= scrubber
.start
&&
4607 p
->soid
< scrubber
.end
) {
4608 scrubber
.subset_last_update
= p
->version
;
4614 // ask replicas to wait until
4615 // last_update_applied >= scrubber.subset_last_update and then scan
4616 scrubber
.waiting_on_whom
.insert(pg_whoami
);
4617 ++scrubber
.waiting_on
;
4619 // request maps from replicas
4620 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
4621 i
!= actingbackfill
.end();
4623 if (*i
== pg_whoami
) continue;
4624 _request_scrub_map(*i
, scrubber
.subset_last_update
,
4625 scrubber
.start
, scrubber
.end
, scrubber
.deep
,
4627 scrubber
.waiting_on_whom
.insert(*i
);
4628 ++scrubber
.waiting_on
;
4631 scrubber
.state
= PG::Scrubber::WAIT_PUSHES
;
4635 case PG::Scrubber::WAIT_PUSHES
:
4636 if (active_pushes
== 0) {
4637 scrubber
.state
= PG::Scrubber::WAIT_LAST_UPDATE
;
4639 dout(15) << "wait for pushes to apply" << dendl
;
4644 case PG::Scrubber::WAIT_LAST_UPDATE
:
4645 if (last_update_applied
>= scrubber
.subset_last_update
) {
4646 scrubber
.state
= PG::Scrubber::BUILD_MAP
;
4648 // will be requeued by op_applied
4649 dout(15) << "wait for writes to flush" << dendl
;
4654 case PG::Scrubber::BUILD_MAP
:
4655 assert(last_update_applied
>= scrubber
.subset_last_update
);
4657 // build my own scrub map
4658 ret
= build_scrub_map_chunk(scrubber
.primary_scrubmap
,
4659 scrubber
.start
, scrubber
.end
,
4660 scrubber
.deep
, scrubber
.seed
,
4663 dout(5) << "error building scrub map: " << ret
<< ", aborting" << dendl
;
4664 scrub_clear_state();
4665 scrub_unreserve_replicas();
4669 --scrubber
.waiting_on
;
4670 scrubber
.waiting_on_whom
.erase(pg_whoami
);
4672 scrubber
.state
= PG::Scrubber::WAIT_REPLICAS
;
4675 case PG::Scrubber::WAIT_REPLICAS
:
4676 if (scrubber
.waiting_on
> 0) {
4677 // will be requeued by sub_op_scrub_map
4678 dout(10) << "wait for replicas to build scrub map" << dendl
;
4681 scrubber
.state
= PG::Scrubber::COMPARE_MAPS
;
4685 case PG::Scrubber::COMPARE_MAPS
:
4686 assert(last_update_applied
>= scrubber
.subset_last_update
);
4687 assert(scrubber
.waiting_on
== 0);
4689 scrub_compare_maps();
4690 scrubber
.start
= scrubber
.end
;
4691 scrubber
.run_callbacks();
4693 // requeue the writes from the chunk that just finished
4694 requeue_ops(waiting_for_scrub
);
4696 scrubber
.state
= PG::Scrubber::WAIT_DIGEST_UPDATES
;
4700 case PG::Scrubber::WAIT_DIGEST_UPDATES
:
4701 if (scrubber
.num_digest_updates_pending
) {
4702 dout(10) << __func__
<< " waiting on "
4703 << scrubber
.num_digest_updates_pending
4704 << " digest updates" << dendl
;
4709 if (!(scrubber
.end
.is_max())) {
4710 scrubber
.state
= PG::Scrubber::NEW_CHUNK
;
4714 scrubber
.state
= PG::Scrubber::FINISH
;
4719 case PG::Scrubber::FINISH
:
4721 scrubber
.state
= PG::Scrubber::INACTIVE
;
4724 if (!snap_trimq
.empty()) {
4725 dout(10) << "scrub finished, requeuing snap_trimmer" << dendl
;
4726 snap_trimmer_scrub_complete();
4735 dout(20) << "scrub final state " << Scrubber::state_string(scrubber
.state
)
4736 << " [" << scrubber
.start
<< "," << scrubber
.end
<< ")" << dendl
;
4739 void PG::scrub_clear_state()
4741 assert(is_locked());
4742 state_clear(PG_STATE_SCRUBBING
);
4743 state_clear(PG_STATE_REPAIR
);
4744 state_clear(PG_STATE_DEEP_SCRUB
);
4745 publish_stats_to_osd();
4747 // active -> nothing.
4748 if (scrubber
.active
)
4749 osd
->dec_scrubs_active();
4751 requeue_ops(waiting_for_scrub
);
4755 // type-specific state clear
4756 _scrub_clear_state();
4759 void PG::scrub_compare_maps()
4761 dout(10) << __func__
<< " has maps, analyzing" << dendl
;
4763 // construct authoritative scrub map for type specific scrubbing
4764 scrubber
.cleaned_meta_map
.insert(scrubber
.primary_scrubmap
);
4765 map
<hobject_t
, pair
<uint32_t, uint32_t>> missing_digest
;
4767 if (acting
.size() > 1) {
4768 dout(10) << __func__
<< " comparing replica scrub maps" << dendl
;
4772 // Map from object with errors to good peer
4773 map
<hobject_t
, list
<pg_shard_t
>> authoritative
;
4774 map
<pg_shard_t
, ScrubMap
*> maps
;
4776 dout(2) << __func__
<< " osd." << acting
[0] << " has "
4777 << scrubber
.primary_scrubmap
.objects
.size() << " items" << dendl
;
4778 maps
[pg_whoami
] = &scrubber
.primary_scrubmap
;
4780 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
4781 i
!= actingbackfill
.end();
4783 if (*i
== pg_whoami
) continue;
4784 dout(2) << __func__
<< " replica " << *i
<< " has "
4785 << scrubber
.received_maps
[*i
].objects
.size()
4786 << " items" << dendl
;
4787 maps
[*i
] = &scrubber
.received_maps
[*i
];
4790 get_pgbackend()->be_compare_scrubmaps(
4792 state_test(PG_STATE_REPAIR
),
4794 scrubber
.inconsistent
,
4797 scrubber
.shallow_errors
,
4798 scrubber
.deep_errors
,
4799 scrubber
.store
.get(),
4802 dout(2) << ss
.str() << dendl
;
4804 if (!ss
.str().empty()) {
4805 osd
->clog
->error(ss
);
4808 for (map
<hobject_t
, list
<pg_shard_t
>>::iterator i
= authoritative
.begin();
4809 i
!= authoritative
.end();
4811 list
<pair
<ScrubMap::object
, pg_shard_t
> > good_peers
;
4812 for (list
<pg_shard_t
>::const_iterator j
= i
->second
.begin();
4813 j
!= i
->second
.end();
4815 good_peers
.push_back(make_pair(maps
[*j
]->objects
[i
->first
], *j
));
4817 scrubber
.authoritative
.insert(
4823 for (map
<hobject_t
, list
<pg_shard_t
>>::iterator i
= authoritative
.begin();
4824 i
!= authoritative
.end();
4826 scrubber
.cleaned_meta_map
.objects
.erase(i
->first
);
4827 scrubber
.cleaned_meta_map
.objects
.insert(
4828 *(maps
[i
->second
.back()]->objects
.find(i
->first
))
4833 ScrubMap for_meta_scrub
;
4834 if (scrubber
.end
.is_max() ||
4835 scrubber
.cleaned_meta_map
.objects
.empty()) {
4836 scrubber
.cleaned_meta_map
.swap(for_meta_scrub
);
4838 auto iter
= scrubber
.cleaned_meta_map
.objects
.end();
4839 --iter
; // not empty, see if clause
4840 auto begin
= scrubber
.cleaned_meta_map
.objects
.begin();
4841 while (iter
!= begin
) {
4843 if (next
->first
.get_head() != iter
->first
.get_head()) {
4848 for_meta_scrub
.objects
.insert(begin
, iter
);
4849 scrubber
.cleaned_meta_map
.objects
.erase(begin
, iter
);
4852 // ok, do the pg-type specific scrubbing
4853 scrub_snapshot_metadata(for_meta_scrub
, missing_digest
);
4854 if (!scrubber
.store
->empty()) {
4855 if (state_test(PG_STATE_REPAIR
)) {
4856 dout(10) << __func__
<< ": discarding scrub results" << dendl
;
4857 scrubber
.store
->flush(nullptr);
4859 dout(10) << __func__
<< ": updating scrub object" << dendl
;
4860 ObjectStore::Transaction t
;
4861 scrubber
.store
->flush(&t
);
4862 osd
->store
->queue_transaction(osr
.get(), std::move(t
), nullptr);
4867 bool PG::scrub_process_inconsistent()
4869 dout(10) << __func__
<< ": checking authoritative" << dendl
;
4870 bool repair
= state_test(PG_STATE_REPAIR
);
4871 bool deep_scrub
= state_test(PG_STATE_DEEP_SCRUB
);
4872 const char *mode
= (repair
? "repair": (deep_scrub
? "deep-scrub" : "scrub"));
4874 // authoriative only store objects which missing or inconsistent.
4875 if (!scrubber
.authoritative
.empty()) {
4877 ss
<< info
.pgid
<< " " << mode
<< " "
4878 << scrubber
.missing
.size() << " missing, "
4879 << scrubber
.inconsistent
.size() << " inconsistent objects";
4880 dout(2) << ss
.str() << dendl
;
4881 osd
->clog
->error(ss
);
4883 state_clear(PG_STATE_CLEAN
);
4884 for (map
<hobject_t
, list
<pair
<ScrubMap::object
, pg_shard_t
> >>::iterator i
=
4885 scrubber
.authoritative
.begin();
4886 i
!= scrubber
.authoritative
.end();
4888 set
<pg_shard_t
>::iterator j
;
4890 auto missing_entry
= scrubber
.missing
.find(i
->first
);
4891 if (missing_entry
!= scrubber
.missing
.end()) {
4892 for (j
= missing_entry
->second
.begin();
4893 j
!= missing_entry
->second
.end();
4902 if (scrubber
.inconsistent
.count(i
->first
)) {
4903 for (j
= scrubber
.inconsistent
[i
->first
].begin();
4904 j
!= scrubber
.inconsistent
[i
->first
].end();
4906 repair_object(i
->first
,
4915 return (!scrubber
.authoritative
.empty() && repair
);
4918 bool PG::ops_blocked_by_scrub() const {
4919 return (waiting_for_scrub
.size() != 0);
4922 // the part that actually finalizes a scrub
4923 void PG::scrub_finish()
4925 bool repair
= state_test(PG_STATE_REPAIR
);
4926 // if the repair request comes from auto-repair and large number of errors,
4927 // we would like to cancel auto-repair
4928 if (repair
&& scrubber
.auto_repair
4929 && scrubber
.authoritative
.size() > cct
->_conf
->osd_scrub_auto_repair_num_errors
) {
4930 state_clear(PG_STATE_REPAIR
);
4933 bool deep_scrub
= state_test(PG_STATE_DEEP_SCRUB
);
4934 const char *mode
= (repair
? "repair": (deep_scrub
? "deep-scrub" : "scrub"));
4936 // type-specific finish (can tally more errors)
4939 bool has_error
= scrub_process_inconsistent();
4943 oss
<< info
.pgid
.pgid
<< " " << mode
<< " ";
4944 int total_errors
= scrubber
.shallow_errors
+ scrubber
.deep_errors
;
4946 oss
<< total_errors
<< " errors";
4949 if (!deep_scrub
&& info
.stats
.stats
.sum
.num_deep_scrub_errors
)
4950 oss
<< " ( " << info
.stats
.stats
.sum
.num_deep_scrub_errors
4951 << " remaining deep scrub error details lost)";
4953 oss
<< ", " << scrubber
.fixed
<< " fixed";
4955 osd
->clog
->error(oss
);
4957 osd
->clog
->debug(oss
);
4962 utime_t now
= ceph_clock_now();
4963 info
.history
.last_scrub
= info
.last_update
;
4964 info
.history
.last_scrub_stamp
= now
;
4965 if (scrubber
.deep
) {
4966 info
.history
.last_deep_scrub
= info
.last_update
;
4967 info
.history
.last_deep_scrub_stamp
= now
;
4969 // Since we don't know which errors were fixed, we can only clear them
4970 // when every one has been fixed.
4972 if (scrubber
.fixed
== scrubber
.shallow_errors
+ scrubber
.deep_errors
) {
4974 scrubber
.shallow_errors
= scrubber
.deep_errors
= 0;
4976 // Deep scrub in order to get corrected error counts
4977 scrub_after_recovery
= true;
4981 if ((scrubber
.shallow_errors
== 0) && (scrubber
.deep_errors
== 0))
4982 info
.history
.last_clean_scrub_stamp
= now
;
4983 info
.stats
.stats
.sum
.num_shallow_scrub_errors
= scrubber
.shallow_errors
;
4984 info
.stats
.stats
.sum
.num_deep_scrub_errors
= scrubber
.deep_errors
;
4986 info
.stats
.stats
.sum
.num_shallow_scrub_errors
= scrubber
.shallow_errors
;
4987 // XXX: last_clean_scrub_stamp doesn't mean the pg is not inconsistent
4988 // because of deep-scrub errors
4989 if (scrubber
.shallow_errors
== 0)
4990 info
.history
.last_clean_scrub_stamp
= now
;
4992 info
.stats
.stats
.sum
.num_scrub_errors
=
4993 info
.stats
.stats
.sum
.num_shallow_scrub_errors
+
4994 info
.stats
.stats
.sum
.num_deep_scrub_errors
;
4998 ObjectStore::Transaction t
;
5001 int tr
= osd
->store
->queue_transaction(osr
.get(), std::move(t
), NULL
);
5007 queue_peering_event(
5009 std::make_shared
<CephPeeringEvt
>(
5010 get_osdmap()->get_epoch(),
5011 get_osdmap()->get_epoch(),
5015 scrub_clear_state();
5016 scrub_unreserve_replicas();
5018 if (is_active() && is_primary()) {
5023 void PG::share_pg_info()
5025 dout(10) << "share_pg_info" << dendl
;
5027 // share new pg_info_t with replicas
5028 assert(!actingbackfill
.empty());
5029 for (set
<pg_shard_t
>::iterator i
= actingbackfill
.begin();
5030 i
!= actingbackfill
.end();
5032 if (*i
== pg_whoami
) continue;
5033 pg_shard_t peer
= *i
;
5034 if (peer_info
.count(peer
)) {
5035 peer_info
[peer
].last_epoch_started
= info
.last_epoch_started
;
5036 peer_info
[peer
].last_interval_started
= info
.last_interval_started
;
5037 peer_info
[peer
].history
.merge(info
.history
);
5039 MOSDPGInfo
*m
= new MOSDPGInfo(get_osdmap()->get_epoch());
5040 m
->pg_list
.push_back(
5043 peer
.shard
, pg_whoami
.shard
,
5044 get_osdmap()->get_epoch(),
5045 get_osdmap()->get_epoch(),
5048 osd
->send_message_osd_cluster(peer
.osd
, m
, get_osdmap()->get_epoch());
5052 bool PG::append_log_entries_update_missing(
5053 const mempool::osd_pglog::list
<pg_log_entry_t
> &entries
,
5054 ObjectStore::Transaction
&t
)
5056 assert(!entries
.empty());
5057 assert(entries
.begin()->version
> info
.last_update
);
5059 PGLogEntryHandler rollbacker
{this, &t
};
5060 bool invalidate_stats
=
5061 pg_log
.append_new_log_entries(info
.last_backfill
,
5062 info
.last_backfill_bitwise
,
5065 info
.last_update
= pg_log
.get_head();
5067 if (pg_log
.get_missing().num_missing() == 0) {
5068 // advance last_complete since nothing else is missing!
5069 info
.last_complete
= info
.last_update
;
5072 info
.stats
.stats_invalid
= info
.stats
.stats_invalid
|| invalidate_stats
;
5075 return invalidate_stats
;
5079 void PG::merge_new_log_entries(
5080 const mempool::osd_pglog::list
<pg_log_entry_t
> &entries
,
5081 ObjectStore::Transaction
&t
)
5083 dout(10) << __func__
<< " " << entries
<< dendl
;
5084 assert(is_primary());
5086 bool rebuild_missing
= append_log_entries_update_missing(entries
, t
);
5087 for (set
<pg_shard_t
>::const_iterator i
= actingbackfill
.begin();
5088 i
!= actingbackfill
.end();
5090 pg_shard_t
peer(*i
);
5091 if (peer
== pg_whoami
) continue;
5092 assert(peer_missing
.count(peer
));
5093 assert(peer_info
.count(peer
));
5094 pg_missing_t
& pmissing(peer_missing
[peer
]);
5095 dout(20) << __func__
<< " peer_missing for " << peer
<< " = " << pmissing
<< dendl
;
5096 pg_info_t
& pinfo(peer_info
[peer
]);
5097 bool invalidate_stats
= PGLog::append_log_entries_update_missing(
5098 pinfo
.last_backfill
,
5099 info
.last_backfill_bitwise
,
5106 pinfo
.last_update
= info
.last_update
;
5107 pinfo
.stats
.stats_invalid
= pinfo
.stats
.stats_invalid
|| invalidate_stats
;
5108 rebuild_missing
= rebuild_missing
|| invalidate_stats
;
5111 if (!rebuild_missing
) {
5115 for (auto &&i
: entries
) {
5116 missing_loc
.rebuild(
5121 pg_log
.get_missing(),
5127 void PG::update_history(const pg_history_t
& new_history
)
5130 if (info
.history
.merge(new_history
)) {
5131 dout(20) << __func__
<< " advanced history from " << new_history
<< dendl
;
5133 if (info
.history
.last_epoch_clean
>= info
.history
.same_interval_since
) {
5134 dout(20) << __func__
<< " clearing past_intervals" << dendl
;
5135 past_intervals
.clear();
5136 dirty_big_info
= true;
5142 void PG::fulfill_info(
5143 pg_shard_t from
, const pg_query_t
&query
,
5144 pair
<pg_shard_t
, pg_info_t
> ¬ify_info
)
5146 assert(from
== primary
);
5147 assert(query
.type
== pg_query_t::INFO
);
5150 dout(10) << "sending info" << dendl
;
5151 notify_info
= make_pair(from
, info
);
5154 void PG::fulfill_log(
5155 pg_shard_t from
, const pg_query_t
&query
, epoch_t query_epoch
)
5157 dout(10) << "log request from " << from
<< dendl
;
5158 assert(from
== primary
);
5159 assert(query
.type
!= pg_query_t::INFO
);
5160 ConnectionRef con
= osd
->get_con_osd_cluster(
5161 from
.osd
, get_osdmap()->get_epoch());
5164 MOSDPGLog
*mlog
= new MOSDPGLog(
5165 from
.shard
, pg_whoami
.shard
,
5166 get_osdmap()->get_epoch(),
5168 mlog
->missing
= pg_log
.get_missing();
5170 // primary -> other, when building master log
5171 if (query
.type
== pg_query_t::LOG
) {
5172 dout(10) << " sending info+missing+log since " << query
.since
5174 if (query
.since
!= eversion_t() && query
.since
< pg_log
.get_tail()) {
5175 osd
->clog
->error() << info
.pgid
<< " got broken pg_query_t::LOG since " << query
.since
5176 << " when my log.tail is " << pg_log
.get_tail()
5177 << ", sending full log instead";
5178 mlog
->log
= pg_log
.get_log(); // primary should not have requested this!!
5180 mlog
->log
.copy_after(pg_log
.get_log(), query
.since
);
5182 else if (query
.type
== pg_query_t::FULLLOG
) {
5183 dout(10) << " sending info+missing+full log" << dendl
;
5184 mlog
->log
= pg_log
.get_log();
5187 dout(10) << " sending " << mlog
->log
<< " " << mlog
->missing
<< dendl
;
5189 osd
->share_map_peer(from
.osd
, con
.get(), get_osdmap());
5190 osd
->send_message_osd_cluster(mlog
, con
.get());
5193 void PG::check_full_transition(OSDMapRef lastmap
, OSDMapRef osdmap
)
5195 bool changed
= false;
5196 if (osdmap
->test_flag(CEPH_OSDMAP_FULL
) &&
5197 !lastmap
->test_flag(CEPH_OSDMAP_FULL
)) {
5198 dout(10) << " cluster was marked full in " << osdmap
->get_epoch() << dendl
;
5201 const pg_pool_t
*pi
= osdmap
->get_pg_pool(info
.pgid
.pool());
5203 if (pi
->has_flag(pg_pool_t::FLAG_FULL
)) {
5204 const pg_pool_t
*opi
= lastmap
->get_pg_pool(info
.pgid
.pool());
5205 if (!opi
|| !opi
->has_flag(pg_pool_t::FLAG_FULL
)) {
5206 dout(10) << " pool was marked full in " << osdmap
->get_epoch() << dendl
;
5211 info
.history
.last_epoch_marked_full
= osdmap
->get_epoch();
5216 bool PG::should_restart_peering(
5218 int newactingprimary
,
5219 const vector
<int>& newup
,
5220 const vector
<int>& newacting
,
5224 if (PastIntervals::is_new_interval(
5236 dout(20) << "new interval newup " << newup
5237 << " newacting " << newacting
<< dendl
;
5244 bool PG::old_peering_msg(epoch_t reply_epoch
, epoch_t query_epoch
)
5246 if (last_peering_reset
> reply_epoch
||
5247 last_peering_reset
> query_epoch
) {
5248 dout(10) << "old_peering_msg reply_epoch " << reply_epoch
<< " query_epoch " << query_epoch
5249 << " last_peering_reset " << last_peering_reset
5256 void PG::set_last_peering_reset()
5258 dout(20) << "set_last_peering_reset " << get_osdmap()->get_epoch() << dendl
;
5259 if (last_peering_reset
!= get_osdmap()->get_epoch()) {
5260 last_peering_reset
= get_osdmap()->get_epoch();
5261 reset_interval_flush();
5268 FlushState(PG
*pg
, epoch_t epoch
) : pg(pg
), epoch(epoch
) {}
5271 if (!pg
->pg_has_reset_since(epoch
))
5272 pg
->queue_flushed(epoch
);
5276 typedef ceph::shared_ptr
<FlushState
> FlushStateRef
;
5278 void PG::start_flush(ObjectStore::Transaction
*t
,
5279 list
<Context
*> *on_applied
,
5280 list
<Context
*> *on_safe
)
5282 // flush in progress ops
5283 FlushStateRef
flush_trigger (std::make_shared
<FlushState
>(
5284 this, get_osdmap()->get_epoch()));
5286 flushes_in_progress
++;
5287 on_applied
->push_back(new ContainerContext
<FlushStateRef
>(flush_trigger
));
5288 on_safe
->push_back(new ContainerContext
<FlushStateRef
>(flush_trigger
));
5291 void PG::reset_interval_flush()
5293 dout(10) << "Clearing blocked outgoing recovery messages" << dendl
;
5294 recovery_state
.clear_blocked_outgoing();
5296 Context
*c
= new QueuePeeringEvt
<IntervalFlush
>(
5297 this, get_osdmap()->get_epoch(), IntervalFlush());
5298 if (!osr
->flush_commit(c
)) {
5299 dout(10) << "Beginning to block outgoing recovery messages" << dendl
;
5300 recovery_state
.begin_block_outgoing();
5302 dout(10) << "Not blocking outgoing recovery messages" << dendl
;
5307 /* Called before initializing peering during advance_map */
5308 void PG::start_peering_interval(
5309 const OSDMapRef lastmap
,
5310 const vector
<int>& newup
, int new_up_primary
,
5311 const vector
<int>& newacting
, int new_acting_primary
,
5312 ObjectStore::Transaction
*t
)
5314 const OSDMapRef osdmap
= get_osdmap();
5316 set_last_peering_reset();
5318 vector
<int> oldacting
, oldup
;
5319 int oldrole
= get_role();
5323 pg_shard_t old_acting_primary
= get_primary();
5324 pg_shard_t old_up_primary
= up_primary
;
5325 bool was_old_primary
= is_primary();
5327 acting
.swap(oldacting
);
5329 init_primary_up_acting(
5333 new_acting_primary
);
5335 if (info
.stats
.up
!= up
||
5336 info
.stats
.acting
!= acting
||
5337 info
.stats
.up_primary
!= new_up_primary
||
5338 info
.stats
.acting_primary
!= new_acting_primary
) {
5340 info
.stats
.up_primary
= new_up_primary
;
5341 info
.stats
.acting
= acting
;
5342 info
.stats
.acting_primary
= new_acting_primary
;
5343 info
.stats
.mapping_epoch
= osdmap
->get_epoch();
5346 pg_stats_publish_lock
.Lock();
5347 pg_stats_publish_valid
= false;
5348 pg_stats_publish_lock
.Unlock();
5350 // This will now be remapped during a backfill in cases
5351 // that it would not have been before.
5353 state_set(PG_STATE_REMAPPED
);
5355 state_clear(PG_STATE_REMAPPED
);
5357 int role
= osdmap
->calc_pg_role(osd
->whoami
, acting
, acting
.size());
5358 if (pool
.info
.is_replicated() || role
== pg_whoami
.shard
)
5363 // did acting, up, primary|acker change?
5365 dout(10) << " no lastmap" << dendl
;
5367 dirty_big_info
= true;
5368 info
.history
.same_interval_since
= osdmap
->get_epoch();
5370 std::stringstream debug
;
5371 assert(info
.history
.same_interval_since
!= 0);
5372 boost::scoped_ptr
<IsPGRecoverablePredicate
> recoverable(
5373 get_is_recoverable_predicate());
5374 bool new_interval
= PastIntervals::check_new_interval(
5375 old_acting_primary
.osd
,
5377 oldacting
, newacting
,
5381 info
.history
.same_interval_since
,
5382 info
.history
.last_epoch_clean
,
5389 dout(10) << __func__
<< ": check_new_interval output: "
5390 << debug
.str() << dendl
;
5392 if (osdmap
->get_epoch() == osd
->get_superblock().oldest_map
&&
5393 info
.history
.last_epoch_clean
< osdmap
->get_epoch()) {
5394 dout(10) << " map gap, clearing past_intervals and faking" << dendl
;
5395 // our information is incomplete and useless; someone else was clean
5396 // after everything we know if osdmaps were trimmed.
5397 past_intervals
.clear();
5399 dout(10) << " noting past " << past_intervals
<< dendl
;
5402 dirty_big_info
= true;
5403 info
.history
.same_interval_since
= osdmap
->get_epoch();
5404 if (info
.pgid
.pgid
.is_split(lastmap
->get_pg_num(info
.pgid
.pgid
.pool()),
5405 osdmap
->get_pg_num(info
.pgid
.pgid
.pool()),
5407 info
.history
.last_epoch_split
= osdmap
->get_epoch();
5412 if (old_up_primary
!= up_primary
||
5414 info
.history
.same_up_since
= osdmap
->get_epoch();
5416 // this comparison includes primary rank via pg_shard_t
5417 if (old_acting_primary
!= get_primary()) {
5418 info
.history
.same_primary_since
= osdmap
->get_epoch();
5423 dout(1) << __func__
<< " up " << oldup
<< " -> " << up
5424 << ", acting " << oldacting
<< " -> " << acting
5425 << ", acting_primary " << old_acting_primary
<< " -> " << new_acting_primary
5426 << ", up_primary " << old_up_primary
<< " -> " << new_up_primary
5427 << ", role " << oldrole
<< " -> " << role
5428 << ", features acting " << acting_features
5429 << " upacting " << upacting_features
5433 state_clear(PG_STATE_ACTIVE
);
5434 state_clear(PG_STATE_PEERED
);
5435 state_clear(PG_STATE_DOWN
);
5436 state_clear(PG_STATE_RECOVERY_WAIT
);
5437 state_clear(PG_STATE_RECOVERY_TOOFULL
);
5438 state_clear(PG_STATE_RECOVERING
);
5440 peer_purged
.clear();
5441 actingbackfill
.clear();
5442 scrub_queued
= false;
5444 // reset primary state?
5445 if (was_old_primary
|| is_primary()) {
5446 osd
->remove_want_pg_temp(info
.pgid
.pgid
);
5448 clear_primary_state();
5454 projected_last_update
= eversion_t();
5458 // should we tell the primary we are here?
5459 send_notify
= !is_primary();
5461 if (role
!= oldrole
||
5462 was_old_primary
!= is_primary()) {
5463 // did primary change?
5464 if (was_old_primary
!= is_primary()) {
5465 state_clear(PG_STATE_CLEAN
);
5466 clear_publish_stats();
5471 // take active waiters
5472 requeue_ops(waiting_for_peered
);
5476 // did primary change?
5477 if (get_primary() != old_acting_primary
) {
5478 dout(10) << *this << " " << oldacting
<< " -> " << acting
5479 << ", acting primary "
5480 << old_acting_primary
<< " -> " << get_primary()
5483 // primary is the same.
5485 // i am (still) primary. but my replica set changed.
5486 state_clear(PG_STATE_CLEAN
);
5488 dout(10) << oldacting
<< " -> " << acting
5489 << ", replicas changed" << dendl
;
5495 if (acting
.empty() && !up
.empty() && up_primary
== pg_whoami
) {
5496 dout(10) << " acting empty, but i am up[0], clearing pg_temp" << dendl
;
5497 osd
->queue_want_pg_temp(info
.pgid
.pgid
, acting
);
5501 void PG::on_new_interval()
5503 const OSDMapRef osdmap
= get_osdmap();
5507 // initialize features
5508 acting_features
= CEPH_FEATURES_SUPPORTED_DEFAULT
;
5509 upacting_features
= CEPH_FEATURES_SUPPORTED_DEFAULT
;
5510 for (vector
<int>::iterator p
= acting
.begin(); p
!= acting
.end(); ++p
) {
5511 if (*p
== CRUSH_ITEM_NONE
)
5513 uint64_t f
= osdmap
->get_xinfo(*p
).features
;
5514 acting_features
&= f
;
5515 upacting_features
&= f
;
5517 for (vector
<int>::iterator p
= up
.begin(); p
!= up
.end(); ++p
) {
5518 if (*p
== CRUSH_ITEM_NONE
)
5520 upacting_features
&= osdmap
->get_xinfo(*p
).features
;
5523 assert(osdmap
->test_flag(CEPH_OSDMAP_SORTBITWISE
));
5528 void PG::proc_primary_info(ObjectStore::Transaction
&t
, const pg_info_t
&oinfo
)
5530 assert(!is_primary());
5532 update_history(oinfo
.history
);
5534 if (last_complete_ondisk
.epoch
>= info
.history
.last_epoch_started
) {
5535 // DEBUG: verify that the snaps are empty in snap_mapper
5536 if (cct
->_conf
->osd_debug_verify_snaps_on_info
) {
5537 interval_set
<snapid_t
> p
;
5538 p
.union_of(oinfo
.purged_snaps
, info
.purged_snaps
);
5539 p
.subtract(info
.purged_snaps
);
5541 for (interval_set
<snapid_t
>::iterator i
= p
.begin();
5544 for (snapid_t snap
= i
.get_start();
5545 snap
!= i
.get_len() + i
.get_start();
5547 vector
<hobject_t
> hoids
;
5548 int r
= snap_mapper
.get_next_objects_to_trim(snap
, 1, &hoids
);
5549 if (r
!= 0 && r
!= -ENOENT
) {
5550 derr
<< __func__
<< ": snap_mapper get_next_object_to_trim returned "
5551 << cpp_strerror(r
) << dendl
;
5553 } else if (r
!= -ENOENT
) {
5554 assert(!hoids
.empty());
5555 derr
<< __func__
<< ": snap_mapper get_next_object_to_trim returned "
5556 << cpp_strerror(r
) << " for object "
5557 << hoids
[0] << " on snap " << snap
5558 << " which should have been fully trimmed " << dendl
;
5565 info
.purged_snaps
= oinfo
.purged_snaps
;
5567 dirty_big_info
= true;
5571 ostream
& operator<<(ostream
& out
, const PG
& pg
)
5573 out
<< "pg[" << pg
.info
5575 if (pg
.acting
!= pg
.up
)
5576 out
<< "/" << pg
.acting
;
5577 out
<< " r=" << pg
.get_role();
5578 out
<< " lpr=" << pg
.get_last_peering_reset();
5580 if (!pg
.past_intervals
.empty()) {
5581 out
<< " pi=[" << pg
.past_intervals
.get_bounds()
5582 << ")/" << pg
.past_intervals
.size();
5585 if (pg
.is_peered()) {
5586 if (pg
.last_update_ondisk
!= pg
.info
.last_update
)
5587 out
<< " luod=" << pg
.last_update_ondisk
;
5588 if (pg
.last_update_applied
!= pg
.info
.last_update
)
5589 out
<< " lua=" << pg
.last_update_applied
;
5592 if (pg
.recovery_ops_active
)
5593 out
<< " rops=" << pg
.recovery_ops_active
;
5595 if (pg
.pg_log
.get_tail() != pg
.info
.log_tail
||
5596 pg
.pg_log
.get_head() != pg
.info
.last_update
)
5597 out
<< " (info mismatch, " << pg
.pg_log
.get_log() << ")";
5599 if (!pg
.pg_log
.get_log().empty()) {
5600 if ((pg
.pg_log
.get_log().log
.begin()->version
<= pg
.pg_log
.get_tail())) {
5601 out
<< " (log bound mismatch, actual=["
5602 << pg
.pg_log
.get_log().log
.begin()->version
<< ","
5603 << pg
.pg_log
.get_log().log
.rbegin()->version
<< "]";
5608 if (!pg
.backfill_targets
.empty())
5609 out
<< " bft=" << pg
.backfill_targets
;
5610 out
<< " crt=" << pg
.pg_log
.get_can_rollback_to();
5612 if (pg
.last_complete_ondisk
!= pg
.info
.last_complete
)
5613 out
<< " lcod " << pg
.last_complete_ondisk
;
5615 if (pg
.is_primary()) {
5616 out
<< " mlcod " << pg
.min_last_complete_ondisk
;
5619 out
<< " " << pg_state_string(pg
.get_state());
5620 if (pg
.should_send_notify())
5623 if (pg
.scrubber
.must_repair
)
5624 out
<< " MUST_REPAIR";
5625 if (pg
.scrubber
.auto_repair
)
5626 out
<< " AUTO_REPAIR";
5627 if (pg
.scrubber
.must_deep_scrub
)
5628 out
<< " MUST_DEEP_SCRUB";
5629 if (pg
.scrubber
.must_scrub
)
5630 out
<< " MUST_SCRUB";
5632 //out << " (" << pg.pg_log.get_tail() << "," << pg.pg_log.get_head() << "]";
5633 if (pg
.pg_log
.get_missing().num_missing()) {
5634 out
<< " m=" << pg
.pg_log
.get_missing().num_missing();
5635 if (pg
.is_primary()) {
5636 uint64_t unfound
= pg
.get_num_unfound();
5638 out
<< " u=" << unfound
;
5641 if (pg
.snap_trimq
.size())
5642 out
<< " snaptrimq=" << pg
.snap_trimq
;
5650 bool PG::can_discard_op(OpRequestRef
& op
)
5652 const MOSDOp
*m
= static_cast<const MOSDOp
*>(op
->get_req());
5653 if (cct
->_conf
->osd_discard_disconnected_ops
&& OSD::op_is_discardable(m
)) {
5654 dout(20) << " discard " << *m
<< dendl
;
5658 if (m
->get_map_epoch() < info
.history
.same_primary_since
) {
5659 dout(7) << " changed after " << m
->get_map_epoch()
5660 << ", dropping " << *m
<< dendl
;
5664 if (m
->get_connection()->has_feature(CEPH_FEATURE_RESEND_ON_SPLIT
)) {
5665 if (m
->get_map_epoch() < pool
.info
.get_last_force_op_resend()) {
5666 dout(7) << __func__
<< " sent before last_force_op_resend "
5667 << pool
.info
.last_force_op_resend
<< ", dropping" << *m
<< dendl
;
5670 if (m
->get_map_epoch() < info
.history
.last_epoch_split
) {
5671 dout(7) << __func__
<< " pg split in "
5672 << info
.history
.last_epoch_split
<< ", dropping" << dendl
;
5675 } else if (m
->get_connection()->has_feature(CEPH_FEATURE_OSD_POOLRESEND
)) {
5676 if (m
->get_map_epoch() < pool
.info
.get_last_force_op_resend_preluminous()) {
5677 dout(7) << __func__
<< " sent before last_force_op_resend_preluminous "
5678 << pool
.info
.last_force_op_resend_preluminous
5679 << ", dropping" << *m
<< dendl
;
5687 template<typename T
, int MSGTYPE
>
5688 bool PG::can_discard_replica_op(OpRequestRef
& op
)
5690 const T
*m
= static_cast<const T
*>(op
->get_req());
5691 assert(m
->get_type() == MSGTYPE
);
5693 /* Mostly, this overlaps with the old_peering_msg
5694 * condition. An important exception is pushes
5695 * sent by replicas not in the acting set, since
5696 * if such a replica goes down it does not cause
5697 * a new interval. */
5698 int from
= m
->get_source().num();
5699 if (get_osdmap()->get_down_at(from
) >= m
->map_epoch
)
5703 // if pg changes _at all_, we reset and repeer!
5704 if (old_peering_msg(m
->map_epoch
, m
->map_epoch
)) {
5705 dout(10) << "can_discard_replica_op pg changed " << info
.history
5706 << " after " << m
->map_epoch
5707 << ", dropping" << dendl
;
5713 bool PG::can_discard_scan(OpRequestRef op
)
5715 const MOSDPGScan
*m
= static_cast<const MOSDPGScan
*>(op
->get_req());
5716 assert(m
->get_type() == MSG_OSD_PG_SCAN
);
5718 if (old_peering_msg(m
->map_epoch
, m
->query_epoch
)) {
5719 dout(10) << " got old scan, ignoring" << dendl
;
5725 bool PG::can_discard_backfill(OpRequestRef op
)
5727 const MOSDPGBackfill
*m
= static_cast<const MOSDPGBackfill
*>(op
->get_req());
5728 assert(m
->get_type() == MSG_OSD_PG_BACKFILL
);
5730 if (old_peering_msg(m
->map_epoch
, m
->query_epoch
)) {
5731 dout(10) << " got old backfill, ignoring" << dendl
;
5739 bool PG::can_discard_request(OpRequestRef
& op
)
5741 switch (op
->get_req()->get_type()) {
5742 case CEPH_MSG_OSD_OP
:
5743 return can_discard_op(op
);
5744 case CEPH_MSG_OSD_BACKOFF
:
5745 return false; // never discard
5747 return can_discard_replica_op
<MOSDSubOp
, MSG_OSD_SUBOP
>(op
);
5749 return can_discard_replica_op
<MOSDRepOp
, MSG_OSD_REPOP
>(op
);
5750 case MSG_OSD_PG_PUSH
:
5751 return can_discard_replica_op
<MOSDPGPush
, MSG_OSD_PG_PUSH
>(op
);
5752 case MSG_OSD_PG_PULL
:
5753 return can_discard_replica_op
<MOSDPGPull
, MSG_OSD_PG_PULL
>(op
);
5754 case MSG_OSD_PG_PUSH_REPLY
:
5755 return can_discard_replica_op
<MOSDPGPushReply
, MSG_OSD_PG_PUSH_REPLY
>(op
);
5756 case MSG_OSD_SUBOPREPLY
:
5757 return can_discard_replica_op
<MOSDSubOpReply
, MSG_OSD_SUBOPREPLY
>(op
);
5758 case MSG_OSD_REPOPREPLY
:
5759 return can_discard_replica_op
<MOSDRepOpReply
, MSG_OSD_REPOPREPLY
>(op
);
5760 case MSG_OSD_PG_RECOVERY_DELETE
:
5761 return can_discard_replica_op
<MOSDPGRecoveryDelete
, MSG_OSD_PG_RECOVERY_DELETE
>(op
);
5763 case MSG_OSD_PG_RECOVERY_DELETE_REPLY
:
5764 return can_discard_replica_op
<MOSDPGRecoveryDeleteReply
, MSG_OSD_PG_RECOVERY_DELETE_REPLY
>(op
);
5766 case MSG_OSD_EC_WRITE
:
5767 return can_discard_replica_op
<MOSDECSubOpWrite
, MSG_OSD_EC_WRITE
>(op
);
5768 case MSG_OSD_EC_WRITE_REPLY
:
5769 return can_discard_replica_op
<MOSDECSubOpWriteReply
, MSG_OSD_EC_WRITE_REPLY
>(op
);
5770 case MSG_OSD_EC_READ
:
5771 return can_discard_replica_op
<MOSDECSubOpRead
, MSG_OSD_EC_READ
>(op
);
5772 case MSG_OSD_EC_READ_REPLY
:
5773 return can_discard_replica_op
<MOSDECSubOpReadReply
, MSG_OSD_EC_READ_REPLY
>(op
);
5774 case MSG_OSD_REP_SCRUB
:
5775 return can_discard_replica_op
<MOSDRepScrub
, MSG_OSD_REP_SCRUB
>(op
);
5776 case MSG_OSD_SCRUB_RESERVE
:
5777 return can_discard_replica_op
<MOSDScrubReserve
, MSG_OSD_SCRUB_RESERVE
>(op
);
5778 case MSG_OSD_REP_SCRUBMAP
:
5779 return can_discard_replica_op
<MOSDRepScrubMap
, MSG_OSD_REP_SCRUBMAP
>(op
);
5780 case MSG_OSD_PG_UPDATE_LOG_MISSING
:
5781 return can_discard_replica_op
<
5782 MOSDPGUpdateLogMissing
, MSG_OSD_PG_UPDATE_LOG_MISSING
>(op
);
5783 case MSG_OSD_PG_UPDATE_LOG_MISSING_REPLY
:
5784 return can_discard_replica_op
<
5785 MOSDPGUpdateLogMissingReply
, MSG_OSD_PG_UPDATE_LOG_MISSING_REPLY
>(op
);
5787 case MSG_OSD_PG_SCAN
:
5788 return can_discard_scan(op
);
5789 case MSG_OSD_PG_BACKFILL
:
5790 return can_discard_backfill(op
);
5791 case MSG_OSD_PG_BACKFILL_REMOVE
:
5792 return can_discard_replica_op
<MOSDPGBackfillRemove
,
5793 MSG_OSD_PG_BACKFILL_REMOVE
>(op
);
5798 void PG::take_waiters()
5800 dout(10) << "take_waiters" << dendl
;
5801 requeue_map_waiters();
5802 for (list
<CephPeeringEvtRef
>::iterator i
= peering_waiters
.begin();
5803 i
!= peering_waiters
.end();
5804 ++i
) osd
->queue_for_peering(this);
5805 peering_queue
.splice(peering_queue
.begin(), peering_waiters
,
5806 peering_waiters
.begin(), peering_waiters
.end());
5809 void PG::handle_peering_event(CephPeeringEvtRef evt
, RecoveryCtx
*rctx
)
5811 dout(10) << "handle_peering_event: " << evt
->get_desc() << dendl
;
5812 if (!have_same_or_newer_map(evt
->get_epoch_sent())) {
5813 dout(10) << "deferring event " << evt
->get_desc() << dendl
;
5814 peering_waiters
.push_back(evt
);
5817 if (old_peering_evt(evt
))
5819 recovery_state
.handle_event(evt
, rctx
);
5822 void PG::queue_peering_event(CephPeeringEvtRef evt
)
5824 if (old_peering_evt(evt
))
5826 peering_queue
.push_back(evt
);
5827 osd
->queue_for_peering(this);
5830 void PG::queue_null(epoch_t msg_epoch
,
5831 epoch_t query_epoch
)
5833 dout(10) << "null" << dendl
;
5834 queue_peering_event(
5835 CephPeeringEvtRef(std::make_shared
<CephPeeringEvt
>(msg_epoch
, query_epoch
,
5839 void PG::queue_flushed(epoch_t e
)
5841 dout(10) << "flushed" << dendl
;
5842 queue_peering_event(
5843 CephPeeringEvtRef(std::make_shared
<CephPeeringEvt
>(e
, e
,
5847 void PG::queue_query(epoch_t msg_epoch
,
5848 epoch_t query_epoch
,
5849 pg_shard_t from
, const pg_query_t
& q
)
5851 dout(10) << "handle_query " << q
<< " from replica " << from
<< dendl
;
5852 queue_peering_event(
5853 CephPeeringEvtRef(std::make_shared
<CephPeeringEvt
>(msg_epoch
, query_epoch
,
5854 MQuery(from
, q
, query_epoch
))));
5857 void PG::handle_advance_map(
5858 OSDMapRef osdmap
, OSDMapRef lastmap
,
5859 vector
<int>& newup
, int up_primary
,
5860 vector
<int>& newacting
, int acting_primary
,
5863 assert(lastmap
->get_epoch() == osdmap_ref
->get_epoch());
5864 assert(lastmap
== osdmap_ref
);
5865 dout(10) << "handle_advance_map "
5866 << newup
<< "/" << newacting
5867 << " -- " << up_primary
<< "/" << acting_primary
5869 update_osdmap_ref(osdmap
);
5870 pool
.update(osdmap
);
5871 past_intervals
.update_type_from_map(pool
.info
.ec_pool(), *osdmap
);
5872 if (cct
->_conf
->osd_debug_verify_cached_snaps
) {
5873 interval_set
<snapid_t
> actual_removed_snaps
;
5874 const pg_pool_t
*pi
= osdmap
->get_pg_pool(info
.pgid
.pool());
5876 pi
->build_removed_snaps(actual_removed_snaps
);
5877 if (!(actual_removed_snaps
== pool
.cached_removed_snaps
)) {
5878 derr
<< __func__
<< ": mismatch between the actual removed snaps "
5879 << actual_removed_snaps
<< " and pool.cached_removed_snaps "
5880 << " pool.cached_removed_snaps " << pool
.cached_removed_snaps
5883 assert(actual_removed_snaps
== pool
.cached_removed_snaps
);
5886 osdmap
, lastmap
, newup
, up_primary
,
5887 newacting
, acting_primary
);
5888 recovery_state
.handle_event(evt
, rctx
);
5889 if (pool
.info
.last_change
== osdmap_ref
->get_epoch()) {
5891 update_store_with_options();
5895 void PG::handle_activate_map(RecoveryCtx
*rctx
)
5897 dout(10) << "handle_activate_map " << dendl
;
5899 recovery_state
.handle_event(evt
, rctx
);
5900 if (osdmap_ref
->get_epoch() - last_persisted_osdmap_ref
->get_epoch() >
5901 cct
->_conf
->osd_pg_epoch_persisted_max_stale
) {
5902 dout(20) << __func__
<< ": Dirtying info: last_persisted is "
5903 << last_persisted_osdmap_ref
->get_epoch()
5904 << " while current is " << osdmap_ref
->get_epoch() << dendl
;
5907 dout(20) << __func__
<< ": Not dirtying info: last_persisted is "
5908 << last_persisted_osdmap_ref
->get_epoch()
5909 << " while current is " << osdmap_ref
->get_epoch() << dendl
;
5911 if (osdmap_ref
->check_new_blacklist_entries()) check_blacklisted_watchers();
5914 void PG::handle_loaded(RecoveryCtx
*rctx
)
5916 dout(10) << "handle_loaded" << dendl
;
5918 recovery_state
.handle_event(evt
, rctx
);
5921 void PG::handle_create(RecoveryCtx
*rctx
)
5923 dout(10) << "handle_create" << dendl
;
5924 rctx
->created_pgs
.insert(this);
5926 recovery_state
.handle_event(evt
, rctx
);
5928 recovery_state
.handle_event(evt2
, rctx
);
5931 void PG::handle_query_state(Formatter
*f
)
5933 dout(10) << "handle_query_state" << dendl
;
5935 recovery_state
.handle_event(q
, 0);
5938 void PG::update_store_with_options()
5940 auto r
= osd
->store
->set_collection_opts(coll
, pool
.info
.opts
);
5941 if(r
< 0 && r
!= -EOPNOTSUPP
) {
5942 derr
<< __func__
<< "set_collection_opts returns error:" << r
<< dendl
;
5946 void PG::update_store_on_load()
5948 if (osd
->store
->get_type() == "filestore") {
5949 // legacy filestore didn't store collection bit width; fix.
5950 int bits
= osd
->store
->collection_bits(coll
);
5955 bits
= info
.pgid
.get_split_bits(pool
.info
.get_pg_num());
5956 lderr(cct
) << __func__
<< " setting bit width to " << bits
<< dendl
;
5957 ObjectStore::Transaction t
;
5958 t
.collection_set_bits(coll
, bits
);
5959 osd
->store
->apply_transaction(osr
.get(), std::move(t
));
5964 /*------------ Recovery State Machine----------------*/
5966 #define dout_prefix (*_dout << context< RecoveryMachine >().pg->gen_prefix() \
5967 << "state<" << get_state_name() << ">: ")
5969 /*------Crashed-------*/
5970 PG::RecoveryState::Crashed::Crashed(my_context ctx
)
5972 NamedState(context
< RecoveryMachine
>().pg
, "Crashed")
5974 context
< RecoveryMachine
>().log_enter(state_name
);
5975 assert(0 == "we got a bad state machine event");
5979 /*------Initial-------*/
5980 PG::RecoveryState::Initial::Initial(my_context ctx
)
5982 NamedState(context
< RecoveryMachine
>().pg
, "Initial")
5984 context
< RecoveryMachine
>().log_enter(state_name
);
5987 boost::statechart::result
PG::RecoveryState::Initial::react(const Load
& l
)
5989 PG
*pg
= context
< RecoveryMachine
>().pg
;
5991 // do we tell someone we're here?
5992 pg
->send_notify
= (!pg
->is_primary());
5993 pg
->update_store_with_options();
5995 pg
->update_store_on_load();
5997 return transit
< Reset
>();
6000 boost::statechart::result
PG::RecoveryState::Initial::react(const MNotifyRec
& notify
)
6002 PG
*pg
= context
< RecoveryMachine
>().pg
;
6003 pg
->proc_replica_info(
6004 notify
.from
, notify
.notify
.info
, notify
.notify
.epoch_sent
);
6005 pg
->set_last_peering_reset();
6006 return transit
< Primary
>();
6009 boost::statechart::result
PG::RecoveryState::Initial::react(const MInfoRec
& i
)
6011 PG
*pg
= context
< RecoveryMachine
>().pg
;
6012 assert(!pg
->is_primary());
6014 return transit
< Stray
>();
6017 boost::statechart::result
PG::RecoveryState::Initial::react(const MLogRec
& i
)
6019 PG
*pg
= context
< RecoveryMachine
>().pg
;
6020 assert(!pg
->is_primary());
6022 return transit
< Stray
>();
6025 void PG::RecoveryState::Initial::exit()
6027 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6028 PG
*pg
= context
< RecoveryMachine
>().pg
;
6029 utime_t dur
= ceph_clock_now() - enter_time
;
6030 pg
->osd
->recoverystate_perf
->tinc(rs_initial_latency
, dur
);
6033 /*------Started-------*/
6034 PG::RecoveryState::Started::Started(my_context ctx
)
6036 NamedState(context
< RecoveryMachine
>().pg
, "Started")
6038 context
< RecoveryMachine
>().log_enter(state_name
);
6041 boost::statechart::result
6042 PG::RecoveryState::Started::react(const IntervalFlush
&)
6044 PG
*pg
= context
< RecoveryMachine
>().pg
;
6045 ldout(pg
->cct
, 10) << "Ending blocked outgoing recovery messages" << dendl
;
6046 context
< RecoveryMachine
>().pg
->recovery_state
.end_block_outgoing();
6047 return discard_event();
6051 boost::statechart::result
6052 PG::RecoveryState::Started::react(const FlushedEvt
&)
6054 PG
*pg
= context
< RecoveryMachine
>().pg
;
6056 return discard_event();
6060 boost::statechart::result
PG::RecoveryState::Started::react(const AdvMap
& advmap
)
6062 PG
*pg
= context
< RecoveryMachine
>().pg
;
6063 ldout(pg
->cct
, 10) << "Started advmap" << dendl
;
6064 pg
->check_full_transition(advmap
.lastmap
, advmap
.osdmap
);
6065 if (pg
->should_restart_peering(
6067 advmap
.acting_primary
,
6072 ldout(pg
->cct
, 10) << "should_restart_peering, transitioning to Reset"
6075 return transit
< Reset
>();
6077 pg
->remove_down_peer_info(advmap
.osdmap
);
6078 return discard_event();
6081 boost::statechart::result
PG::RecoveryState::Started::react(const QueryState
& q
)
6083 q
.f
->open_object_section("state");
6084 q
.f
->dump_string("name", state_name
);
6085 q
.f
->dump_stream("enter_time") << enter_time
;
6086 q
.f
->close_section();
6087 return discard_event();
6090 void PG::RecoveryState::Started::exit()
6092 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6093 PG
*pg
= context
< RecoveryMachine
>().pg
;
6094 utime_t dur
= ceph_clock_now() - enter_time
;
6095 pg
->osd
->recoverystate_perf
->tinc(rs_started_latency
, dur
);
6098 /*--------Reset---------*/
6099 PG::RecoveryState::Reset::Reset(my_context ctx
)
6101 NamedState(context
< RecoveryMachine
>().pg
, "Reset")
6103 context
< RecoveryMachine
>().log_enter(state_name
);
6104 PG
*pg
= context
< RecoveryMachine
>().pg
;
6106 pg
->flushes_in_progress
= 0;
6107 pg
->set_last_peering_reset();
6110 boost::statechart::result
6111 PG::RecoveryState::Reset::react(const FlushedEvt
&)
6113 PG
*pg
= context
< RecoveryMachine
>().pg
;
6115 return discard_event();
6118 boost::statechart::result
6119 PG::RecoveryState::Reset::react(const IntervalFlush
&)
6121 PG
*pg
= context
< RecoveryMachine
>().pg
;
6122 ldout(pg
->cct
, 10) << "Ending blocked outgoing recovery messages" << dendl
;
6123 context
< RecoveryMachine
>().pg
->recovery_state
.end_block_outgoing();
6124 return discard_event();
6127 boost::statechart::result
PG::RecoveryState::Reset::react(const AdvMap
& advmap
)
6129 PG
*pg
= context
< RecoveryMachine
>().pg
;
6130 ldout(pg
->cct
, 10) << "Reset advmap" << dendl
;
6132 pg
->check_full_transition(advmap
.lastmap
, advmap
.osdmap
);
6134 if (pg
->should_restart_peering(
6136 advmap
.acting_primary
,
6141 ldout(pg
->cct
, 10) << "should restart peering, calling start_peering_interval again"
6143 pg
->start_peering_interval(
6145 advmap
.newup
, advmap
.up_primary
,
6146 advmap
.newacting
, advmap
.acting_primary
,
6147 context
< RecoveryMachine
>().get_cur_transaction());
6149 pg
->remove_down_peer_info(advmap
.osdmap
);
6150 pg
->check_past_interval_bounds();
6151 return discard_event();
6154 boost::statechart::result
PG::RecoveryState::Reset::react(const ActMap
&)
6156 PG
*pg
= context
< RecoveryMachine
>().pg
;
6157 if (pg
->should_send_notify() && pg
->get_primary().osd
>= 0) {
6158 context
< RecoveryMachine
>().send_notify(
6161 pg
->get_primary().shard
, pg
->pg_whoami
.shard
,
6162 pg
->get_osdmap()->get_epoch(),
6163 pg
->get_osdmap()->get_epoch(),
6165 pg
->past_intervals
);
6168 pg
->update_heartbeat_peers();
6171 return transit
< Started
>();
6174 boost::statechart::result
PG::RecoveryState::Reset::react(const QueryState
& q
)
6176 q
.f
->open_object_section("state");
6177 q
.f
->dump_string("name", state_name
);
6178 q
.f
->dump_stream("enter_time") << enter_time
;
6179 q
.f
->close_section();
6180 return discard_event();
6183 void PG::RecoveryState::Reset::exit()
6185 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6186 PG
*pg
= context
< RecoveryMachine
>().pg
;
6187 utime_t dur
= ceph_clock_now() - enter_time
;
6188 pg
->osd
->recoverystate_perf
->tinc(rs_reset_latency
, dur
);
6191 /*-------Start---------*/
6192 PG::RecoveryState::Start::Start(my_context ctx
)
6194 NamedState(context
< RecoveryMachine
>().pg
, "Start")
6196 context
< RecoveryMachine
>().log_enter(state_name
);
6198 PG
*pg
= context
< RecoveryMachine
>().pg
;
6199 if (pg
->is_primary()) {
6200 ldout(pg
->cct
, 1) << "transitioning to Primary" << dendl
;
6201 post_event(MakePrimary());
6203 ldout(pg
->cct
, 1) << "transitioning to Stray" << dendl
;
6204 post_event(MakeStray());
6208 void PG::RecoveryState::Start::exit()
6210 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6211 PG
*pg
= context
< RecoveryMachine
>().pg
;
6212 utime_t dur
= ceph_clock_now() - enter_time
;
6213 pg
->osd
->recoverystate_perf
->tinc(rs_start_latency
, dur
);
6216 /*---------Primary--------*/
6217 PG::RecoveryState::Primary::Primary(my_context ctx
)
6219 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary")
6221 context
< RecoveryMachine
>().log_enter(state_name
);
6222 PG
*pg
= context
< RecoveryMachine
>().pg
;
6223 assert(pg
->want_acting
.empty());
6225 // set CREATING bit until we have peered for the first time.
6226 if (pg
->info
.history
.last_epoch_started
== 0) {
6227 pg
->state_set(PG_STATE_CREATING
);
6228 // use the history timestamp, which ultimately comes from the
6229 // monitor in the create case.
6230 utime_t t
= pg
->info
.history
.last_scrub_stamp
;
6231 pg
->info
.stats
.last_fresh
= t
;
6232 pg
->info
.stats
.last_active
= t
;
6233 pg
->info
.stats
.last_change
= t
;
6234 pg
->info
.stats
.last_peered
= t
;
6235 pg
->info
.stats
.last_clean
= t
;
6236 pg
->info
.stats
.last_unstale
= t
;
6237 pg
->info
.stats
.last_undegraded
= t
;
6238 pg
->info
.stats
.last_fullsized
= t
;
6239 pg
->info
.stats
.last_scrub_stamp
= t
;
6240 pg
->info
.stats
.last_deep_scrub_stamp
= t
;
6241 pg
->info
.stats
.last_clean_scrub_stamp
= t
;
6245 boost::statechart::result
PG::RecoveryState::Primary::react(const MNotifyRec
& notevt
)
6247 PG
*pg
= context
< RecoveryMachine
>().pg
;
6248 ldout(pg
->cct
, 7) << "handle_pg_notify from osd." << notevt
.from
<< dendl
;
6249 pg
->proc_replica_info(
6250 notevt
.from
, notevt
.notify
.info
, notevt
.notify
.epoch_sent
);
6251 return discard_event();
6254 boost::statechart::result
PG::RecoveryState::Primary::react(const ActMap
&)
6256 PG
*pg
= context
< RecoveryMachine
>().pg
;
6257 ldout(pg
->cct
, 7) << "handle ActMap primary" << dendl
;
6258 pg
->publish_stats_to_osd();
6260 return discard_event();
6263 void PG::RecoveryState::Primary::exit()
6265 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6266 PG
*pg
= context
< RecoveryMachine
>().pg
;
6267 pg
->want_acting
.clear();
6268 utime_t dur
= ceph_clock_now() - enter_time
;
6269 pg
->osd
->recoverystate_perf
->tinc(rs_primary_latency
, dur
);
6270 pg
->clear_primary_state();
6271 pg
->state_clear(PG_STATE_CREATING
);
6274 /*---------Peering--------*/
6275 PG::RecoveryState::Peering::Peering(my_context ctx
)
6277 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering"),
6278 history_les_bound(false)
6280 context
< RecoveryMachine
>().log_enter(state_name
);
6282 PG
*pg
= context
< RecoveryMachine
>().pg
;
6283 assert(!pg
->is_peered());
6284 assert(!pg
->is_peering());
6285 assert(pg
->is_primary());
6286 pg
->state_set(PG_STATE_PEERING
);
6289 boost::statechart::result
PG::RecoveryState::Peering::react(const AdvMap
& advmap
)
6291 PG
*pg
= context
< RecoveryMachine
>().pg
;
6292 ldout(pg
->cct
, 10) << "Peering advmap" << dendl
;
6293 if (prior_set
.affected_by_map(*(advmap
.osdmap
), pg
)) {
6294 ldout(pg
->cct
, 1) << "Peering, affected_by_map, going to Reset" << dendl
;
6296 return transit
< Reset
>();
6299 pg
->adjust_need_up_thru(advmap
.osdmap
);
6301 return forward_event();
6304 boost::statechart::result
PG::RecoveryState::Peering::react(const QueryState
& q
)
6306 PG
*pg
= context
< RecoveryMachine
>().pg
;
6308 q
.f
->open_object_section("state");
6309 q
.f
->dump_string("name", state_name
);
6310 q
.f
->dump_stream("enter_time") << enter_time
;
6312 q
.f
->open_array_section("past_intervals");
6313 pg
->past_intervals
.dump(q
.f
);
6314 q
.f
->close_section();
6316 q
.f
->open_array_section("probing_osds");
6317 for (set
<pg_shard_t
>::iterator p
= prior_set
.probe
.begin();
6318 p
!= prior_set
.probe
.end();
6320 q
.f
->dump_stream("osd") << *p
;
6321 q
.f
->close_section();
6323 if (prior_set
.pg_down
)
6324 q
.f
->dump_string("blocked", "peering is blocked due to down osds");
6326 q
.f
->open_array_section("down_osds_we_would_probe");
6327 for (set
<int>::iterator p
= prior_set
.down
.begin();
6328 p
!= prior_set
.down
.end();
6330 q
.f
->dump_int("osd", *p
);
6331 q
.f
->close_section();
6333 q
.f
->open_array_section("peering_blocked_by");
6334 for (map
<int,epoch_t
>::iterator p
= prior_set
.blocked_by
.begin();
6335 p
!= prior_set
.blocked_by
.end();
6337 q
.f
->open_object_section("osd");
6338 q
.f
->dump_int("osd", p
->first
);
6339 q
.f
->dump_int("current_lost_at", p
->second
);
6340 q
.f
->dump_string("comment", "starting or marking this osd lost may let us proceed");
6341 q
.f
->close_section();
6343 q
.f
->close_section();
6345 if (history_les_bound
) {
6346 q
.f
->open_array_section("peering_blocked_by_detail");
6347 q
.f
->open_object_section("item");
6348 q
.f
->dump_string("detail","peering_blocked_by_history_les_bound");
6349 q
.f
->close_section();
6350 q
.f
->close_section();
6353 q
.f
->close_section();
6354 return forward_event();
6357 void PG::RecoveryState::Peering::exit()
6359 PG
*pg
= context
< RecoveryMachine
>().pg
;
6360 ldout(pg
->cct
, 10) << "Leaving Peering" << dendl
;
6361 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6362 pg
->state_clear(PG_STATE_PEERING
);
6363 pg
->clear_probe_targets();
6365 utime_t dur
= ceph_clock_now() - enter_time
;
6366 pg
->osd
->recoverystate_perf
->tinc(rs_peering_latency
, dur
);
6370 /*------Backfilling-------*/
6371 PG::RecoveryState::Backfilling::Backfilling(my_context ctx
)
6373 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/Backfilling")
6375 context
< RecoveryMachine
>().log_enter(state_name
);
6376 PG
*pg
= context
< RecoveryMachine
>().pg
;
6377 pg
->backfill_reserved
= true;
6378 pg
->queue_recovery();
6379 pg
->state_clear(PG_STATE_BACKFILL_TOOFULL
);
6380 pg
->state_clear(PG_STATE_BACKFILL_WAIT
);
6381 pg
->state_set(PG_STATE_BACKFILL
);
6382 pg
->publish_stats_to_osd();
6385 boost::statechart::result
6386 PG::RecoveryState::Backfilling::react(const CancelBackfill
&)
6388 PG
*pg
= context
< RecoveryMachine
>().pg
;
6389 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
6390 // XXX: Add a new pg state so user can see why backfill isn't proceeding
6391 // Can't use PG_STATE_BACKFILL_WAIT since it means waiting for reservations
6392 //pg->state_set(PG_STATE_BACKFILL_STALLED????);
6394 for (set
<pg_shard_t
>::iterator it
= pg
->backfill_targets
.begin();
6395 it
!= pg
->backfill_targets
.end();
6397 assert(*it
!= pg
->pg_whoami
);
6398 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6399 it
->osd
, pg
->get_osdmap()->get_epoch());
6401 pg
->osd
->send_message_osd_cluster(
6402 new MBackfillReserve(
6403 MBackfillReserve::REJECT
,
6404 spg_t(pg
->info
.pgid
.pgid
, it
->shard
),
6405 pg
->get_osdmap()->get_epoch()),
6410 pg
->waiting_on_backfill
.clear();
6412 pg
->schedule_backfill_full_retry();
6413 return transit
<NotBackfilling
>();
6416 boost::statechart::result
6417 PG::RecoveryState::Backfilling::react(const RemoteReservationRejected
&)
6419 PG
*pg
= context
< RecoveryMachine
>().pg
;
6420 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
6421 pg
->state_set(PG_STATE_BACKFILL_TOOFULL
);
6423 for (set
<pg_shard_t
>::iterator it
= pg
->backfill_targets
.begin();
6424 it
!= pg
->backfill_targets
.end();
6426 assert(*it
!= pg
->pg_whoami
);
6427 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6428 it
->osd
, pg
->get_osdmap()->get_epoch());
6430 pg
->osd
->send_message_osd_cluster(
6431 new MBackfillReserve(
6432 MBackfillReserve::REJECT
,
6433 spg_t(pg
->info
.pgid
.pgid
, it
->shard
),
6434 pg
->get_osdmap()->get_epoch()),
6439 pg
->waiting_on_backfill
.clear();
6440 pg
->finish_recovery_op(hobject_t::get_max());
6442 pg
->schedule_backfill_full_retry();
6443 return transit
<NotBackfilling
>();
6446 void PG::RecoveryState::Backfilling::exit()
6448 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6449 PG
*pg
= context
< RecoveryMachine
>().pg
;
6450 pg
->backfill_reserved
= false;
6451 pg
->backfill_reserving
= false;
6452 pg
->state_clear(PG_STATE_BACKFILL
);
6453 pg
->state_clear(PG_STATE_FORCED_BACKFILL
| PG_STATE_FORCED_RECOVERY
);
6454 utime_t dur
= ceph_clock_now() - enter_time
;
6455 pg
->osd
->recoverystate_perf
->tinc(rs_backfilling_latency
, dur
);
6458 /*--WaitRemoteBackfillReserved--*/
6460 PG::RecoveryState::WaitRemoteBackfillReserved::WaitRemoteBackfillReserved(my_context ctx
)
6462 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/WaitRemoteBackfillReserved"),
6463 backfill_osd_it(context
< Active
>().remote_shards_to_reserve_backfill
.begin())
6465 context
< RecoveryMachine
>().log_enter(state_name
);
6466 PG
*pg
= context
< RecoveryMachine
>().pg
;
6467 pg
->state_set(PG_STATE_BACKFILL_WAIT
);
6468 pg
->publish_stats_to_osd();
6469 post_event(RemoteBackfillReserved());
6472 boost::statechart::result
6473 PG::RecoveryState::WaitRemoteBackfillReserved::react(const RemoteBackfillReserved
&evt
)
6475 PG
*pg
= context
< RecoveryMachine
>().pg
;
6477 if (backfill_osd_it
!= context
< Active
>().remote_shards_to_reserve_backfill
.end()) {
6478 //The primary never backfills itself
6479 assert(*backfill_osd_it
!= pg
->pg_whoami
);
6480 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6481 backfill_osd_it
->osd
, pg
->get_osdmap()->get_epoch());
6483 pg
->osd
->send_message_osd_cluster(
6484 new MBackfillReserve(
6485 MBackfillReserve::REQUEST
,
6486 spg_t(pg
->info
.pgid
.pgid
, backfill_osd_it
->shard
),
6487 pg
->get_osdmap()->get_epoch(),
6488 pg
->get_backfill_priority()),
6493 post_event(AllBackfillsReserved());
6495 return discard_event();
6498 void PG::RecoveryState::WaitRemoteBackfillReserved::exit()
6500 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6501 PG
*pg
= context
< RecoveryMachine
>().pg
;
6502 utime_t dur
= ceph_clock_now() - enter_time
;
6503 pg
->osd
->recoverystate_perf
->tinc(rs_waitremotebackfillreserved_latency
, dur
);
6506 boost::statechart::result
6507 PG::RecoveryState::WaitRemoteBackfillReserved::react(const RemoteReservationRejected
&evt
)
6509 PG
*pg
= context
< RecoveryMachine
>().pg
;
6510 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
6512 // Send REJECT to all previously acquired reservations
6513 set
<pg_shard_t
>::const_iterator it
, begin
, end
, next
;
6514 begin
= context
< Active
>().remote_shards_to_reserve_backfill
.begin();
6515 end
= context
< Active
>().remote_shards_to_reserve_backfill
.end();
6516 assert(begin
!= end
);
6517 for (next
= it
= begin
, ++next
; next
!= backfill_osd_it
; ++it
, ++next
) {
6518 //The primary never backfills itself
6519 assert(*it
!= pg
->pg_whoami
);
6520 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6521 it
->osd
, pg
->get_osdmap()->get_epoch());
6523 pg
->osd
->send_message_osd_cluster(
6524 new MBackfillReserve(
6525 MBackfillReserve::REJECT
,
6526 spg_t(pg
->info
.pgid
.pgid
, it
->shard
),
6527 pg
->get_osdmap()->get_epoch()),
6532 pg
->state_clear(PG_STATE_BACKFILL_WAIT
);
6533 pg
->state_set(PG_STATE_BACKFILL_TOOFULL
);
6534 pg
->publish_stats_to_osd();
6536 pg
->schedule_backfill_full_retry();
6538 return transit
<NotBackfilling
>();
6541 /*--WaitLocalBackfillReserved--*/
6542 PG::RecoveryState::WaitLocalBackfillReserved::WaitLocalBackfillReserved(my_context ctx
)
6544 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/WaitLocalBackfillReserved")
6546 context
< RecoveryMachine
>().log_enter(state_name
);
6547 PG
*pg
= context
< RecoveryMachine
>().pg
;
6548 pg
->state_set(PG_STATE_BACKFILL_WAIT
);
6549 pg
->osd
->local_reserver
.request_reservation(
6551 new QueuePeeringEvt
<LocalBackfillReserved
>(
6552 pg
, pg
->get_osdmap()->get_epoch(),
6553 LocalBackfillReserved()),
6554 pg
->get_backfill_priority());
6555 pg
->publish_stats_to_osd();
6558 void PG::RecoveryState::WaitLocalBackfillReserved::exit()
6560 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6561 PG
*pg
= context
< RecoveryMachine
>().pg
;
6562 utime_t dur
= ceph_clock_now() - enter_time
;
6563 pg
->osd
->recoverystate_perf
->tinc(rs_waitlocalbackfillreserved_latency
, dur
);
6566 /*----NotBackfilling------*/
6567 PG::RecoveryState::NotBackfilling::NotBackfilling(my_context ctx
)
6569 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/NotBackfilling")
6571 context
< RecoveryMachine
>().log_enter(state_name
);
6572 PG
*pg
= context
< RecoveryMachine
>().pg
;
6573 pg
->publish_stats_to_osd();
6576 boost::statechart::result
6577 PG::RecoveryState::NotBackfilling::react(const RemoteBackfillReserved
&evt
)
6579 return discard_event();
6582 boost::statechart::result
6583 PG::RecoveryState::NotBackfilling::react(const RemoteReservationRejected
&evt
)
6585 return discard_event();
6588 void PG::RecoveryState::NotBackfilling::exit()
6590 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6591 PG
*pg
= context
< RecoveryMachine
>().pg
;
6592 utime_t dur
= ceph_clock_now() - enter_time
;
6593 pg
->osd
->recoverystate_perf
->tinc(rs_notbackfilling_latency
, dur
);
6596 /*----NotRecovering------*/
6597 PG::RecoveryState::NotRecovering::NotRecovering(my_context ctx
)
6599 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/NotRecovering")
6601 context
< RecoveryMachine
>().log_enter(state_name
);
6602 PG
*pg
= context
< RecoveryMachine
>().pg
;
6603 pg
->publish_stats_to_osd();
6606 void PG::RecoveryState::NotRecovering::exit()
6608 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6609 PG
*pg
= context
< RecoveryMachine
>().pg
;
6610 utime_t dur
= ceph_clock_now() - enter_time
;
6611 pg
->osd
->recoverystate_perf
->tinc(rs_notrecovering_latency
, dur
);
6614 /*---RepNotRecovering----*/
6615 PG::RecoveryState::RepNotRecovering::RepNotRecovering(my_context ctx
)
6617 NamedState(context
< RecoveryMachine
>().pg
, "Started/ReplicaActive/RepNotRecovering")
6619 context
< RecoveryMachine
>().log_enter(state_name
);
6622 void PG::RecoveryState::RepNotRecovering::exit()
6624 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6625 PG
*pg
= context
< RecoveryMachine
>().pg
;
6626 utime_t dur
= ceph_clock_now() - enter_time
;
6627 pg
->osd
->recoverystate_perf
->tinc(rs_repnotrecovering_latency
, dur
);
6630 /*---RepWaitRecoveryReserved--*/
6631 PG::RecoveryState::RepWaitRecoveryReserved::RepWaitRecoveryReserved(my_context ctx
)
6633 NamedState(context
< RecoveryMachine
>().pg
, "Started/ReplicaActive/RepWaitRecoveryReserved")
6635 context
< RecoveryMachine
>().log_enter(state_name
);
6636 PG
*pg
= context
< RecoveryMachine
>().pg
;
6638 pg
->osd
->remote_reserver
.request_reservation(
6640 new QueuePeeringEvt
<RemoteRecoveryReserved
>(
6641 pg
, pg
->get_osdmap()->get_epoch(),
6642 RemoteRecoveryReserved()),
6643 pg
->get_recovery_priority());
6646 boost::statechart::result
6647 PG::RecoveryState::RepWaitRecoveryReserved::react(const RemoteRecoveryReserved
&evt
)
6649 PG
*pg
= context
< RecoveryMachine
>().pg
;
6650 pg
->osd
->send_message_osd_cluster(
6652 new MRecoveryReserve(
6653 MRecoveryReserve::GRANT
,
6654 spg_t(pg
->info
.pgid
.pgid
, pg
->primary
.shard
),
6655 pg
->get_osdmap()->get_epoch()),
6656 pg
->get_osdmap()->get_epoch());
6657 return transit
<RepRecovering
>();
6660 void PG::RecoveryState::RepWaitRecoveryReserved::exit()
6662 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6663 PG
*pg
= context
< RecoveryMachine
>().pg
;
6664 utime_t dur
= ceph_clock_now() - enter_time
;
6665 pg
->osd
->recoverystate_perf
->tinc(rs_repwaitrecoveryreserved_latency
, dur
);
6668 /*-RepWaitBackfillReserved*/
6669 PG::RecoveryState::RepWaitBackfillReserved::RepWaitBackfillReserved(my_context ctx
)
6671 NamedState(context
< RecoveryMachine
>().pg
, "Started/ReplicaActive/RepWaitBackfillReserved")
6673 context
< RecoveryMachine
>().log_enter(state_name
);
6676 boost::statechart::result
6677 PG::RecoveryState::RepNotRecovering::react(const RequestBackfillPrio
&evt
)
6679 PG
*pg
= context
< RecoveryMachine
>().pg
;
6682 if (pg
->cct
->_conf
->osd_debug_reject_backfill_probability
> 0 &&
6683 (rand()%1000 < (pg
->cct
->_conf
->osd_debug_reject_backfill_probability
*1000.0))) {
6684 ldout(pg
->cct
, 10) << "backfill reservation rejected: failure injection"
6686 post_event(RemoteReservationRejected());
6687 } else if (!pg
->cct
->_conf
->osd_debug_skip_full_check_in_backfill_reservation
&&
6688 pg
->osd
->check_backfill_full(ss
)) {
6689 ldout(pg
->cct
, 10) << "backfill reservation rejected: "
6690 << ss
.str() << dendl
;
6691 post_event(RemoteReservationRejected());
6693 pg
->osd
->remote_reserver
.request_reservation(
6695 new QueuePeeringEvt
<RemoteBackfillReserved
>(
6696 pg
, pg
->get_osdmap()->get_epoch(),
6697 RemoteBackfillReserved()), evt
.priority
);
6699 return transit
<RepWaitBackfillReserved
>();
6702 void PG::RecoveryState::RepWaitBackfillReserved::exit()
6704 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6705 PG
*pg
= context
< RecoveryMachine
>().pg
;
6706 utime_t dur
= ceph_clock_now() - enter_time
;
6707 pg
->osd
->recoverystate_perf
->tinc(rs_repwaitbackfillreserved_latency
, dur
);
6710 boost::statechart::result
6711 PG::RecoveryState::RepWaitBackfillReserved::react(const RemoteBackfillReserved
&evt
)
6713 PG
*pg
= context
< RecoveryMachine
>().pg
;
6716 if (pg
->cct
->_conf
->osd_debug_reject_backfill_probability
> 0 &&
6717 (rand()%1000 < (pg
->cct
->_conf
->osd_debug_reject_backfill_probability
*1000.0))) {
6718 ldout(pg
->cct
, 10) << "backfill reservation rejected after reservation: "
6719 << "failure injection" << dendl
;
6720 pg
->osd
->remote_reserver
.cancel_reservation(pg
->info
.pgid
);
6721 post_event(RemoteReservationRejected());
6722 return discard_event();
6723 } else if (!pg
->cct
->_conf
->osd_debug_skip_full_check_in_backfill_reservation
&&
6724 pg
->osd
->check_backfill_full(ss
)) {
6725 ldout(pg
->cct
, 10) << "backfill reservation rejected after reservation: "
6726 << ss
.str() << dendl
;
6727 pg
->osd
->remote_reserver
.cancel_reservation(pg
->info
.pgid
);
6728 post_event(RemoteReservationRejected());
6729 return discard_event();
6731 pg
->osd
->send_message_osd_cluster(
6733 new MBackfillReserve(
6734 MBackfillReserve::GRANT
,
6735 spg_t(pg
->info
.pgid
.pgid
, pg
->primary
.shard
),
6736 pg
->get_osdmap()->get_epoch()),
6737 pg
->get_osdmap()->get_epoch());
6738 return transit
<RepRecovering
>();
6742 boost::statechart::result
6743 PG::RecoveryState::RepWaitBackfillReserved::react(const RemoteReservationRejected
&evt
)
6745 PG
*pg
= context
< RecoveryMachine
>().pg
;
6746 pg
->reject_reservation();
6747 return transit
<RepNotRecovering
>();
6750 /*---RepRecovering-------*/
6751 PG::RecoveryState::RepRecovering::RepRecovering(my_context ctx
)
6753 NamedState(context
< RecoveryMachine
>().pg
, "Started/ReplicaActive/RepRecovering")
6755 context
< RecoveryMachine
>().log_enter(state_name
);
6758 boost::statechart::result
6759 PG::RecoveryState::RepRecovering::react(const BackfillTooFull
&)
6761 PG
*pg
= context
< RecoveryMachine
>().pg
;
6762 pg
->reject_reservation();
6763 return discard_event();
6766 void PG::RecoveryState::RepRecovering::exit()
6768 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6769 PG
*pg
= context
< RecoveryMachine
>().pg
;
6770 pg
->osd
->remote_reserver
.cancel_reservation(pg
->info
.pgid
);
6771 utime_t dur
= ceph_clock_now() - enter_time
;
6772 pg
->osd
->recoverystate_perf
->tinc(rs_reprecovering_latency
, dur
);
6775 /*------Activating--------*/
6776 PG::RecoveryState::Activating::Activating(my_context ctx
)
6778 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/Activating")
6780 context
< RecoveryMachine
>().log_enter(state_name
);
6783 void PG::RecoveryState::Activating::exit()
6785 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6786 PG
*pg
= context
< RecoveryMachine
>().pg
;
6787 utime_t dur
= ceph_clock_now() - enter_time
;
6788 pg
->osd
->recoverystate_perf
->tinc(rs_activating_latency
, dur
);
6791 PG::RecoveryState::WaitLocalRecoveryReserved::WaitLocalRecoveryReserved(my_context ctx
)
6793 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/WaitLocalRecoveryReserved")
6795 context
< RecoveryMachine
>().log_enter(state_name
);
6796 PG
*pg
= context
< RecoveryMachine
>().pg
;
6798 // Make sure all nodes that part of the recovery aren't full
6799 if (!pg
->cct
->_conf
->osd_debug_skip_full_check_in_recovery
&&
6800 pg
->osd
->check_osdmap_full(pg
->actingbackfill
)) {
6801 post_event(RecoveryTooFull());
6805 pg
->state_clear(PG_STATE_RECOVERY_TOOFULL
);
6806 pg
->state_set(PG_STATE_RECOVERY_WAIT
);
6807 pg
->osd
->local_reserver
.request_reservation(
6809 new QueuePeeringEvt
<LocalRecoveryReserved
>(
6810 pg
, pg
->get_osdmap()->get_epoch(),
6811 LocalRecoveryReserved()),
6812 pg
->get_recovery_priority());
6813 pg
->publish_stats_to_osd();
6816 boost::statechart::result
6817 PG::RecoveryState::WaitLocalRecoveryReserved::react(const RecoveryTooFull
&evt
)
6819 PG
*pg
= context
< RecoveryMachine
>().pg
;
6820 pg
->state_set(PG_STATE_RECOVERY_TOOFULL
);
6821 pg
->schedule_recovery_full_retry();
6822 return transit
<NotRecovering
>();
6825 void PG::RecoveryState::WaitLocalRecoveryReserved::exit()
6827 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6828 PG
*pg
= context
< RecoveryMachine
>().pg
;
6829 utime_t dur
= ceph_clock_now() - enter_time
;
6830 pg
->osd
->recoverystate_perf
->tinc(rs_waitlocalrecoveryreserved_latency
, dur
);
6833 PG::RecoveryState::WaitRemoteRecoveryReserved::WaitRemoteRecoveryReserved(my_context ctx
)
6835 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/WaitRemoteRecoveryReserved"),
6836 remote_recovery_reservation_it(context
< Active
>().remote_shards_to_reserve_recovery
.begin())
6838 context
< RecoveryMachine
>().log_enter(state_name
);
6839 post_event(RemoteRecoveryReserved());
6842 boost::statechart::result
6843 PG::RecoveryState::WaitRemoteRecoveryReserved::react(const RemoteRecoveryReserved
&evt
) {
6844 PG
*pg
= context
< RecoveryMachine
>().pg
;
6846 if (remote_recovery_reservation_it
!= context
< Active
>().remote_shards_to_reserve_recovery
.end()) {
6847 assert(*remote_recovery_reservation_it
!= pg
->pg_whoami
);
6848 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6849 remote_recovery_reservation_it
->osd
, pg
->get_osdmap()->get_epoch());
6851 pg
->osd
->send_message_osd_cluster(
6852 new MRecoveryReserve(
6853 MRecoveryReserve::REQUEST
,
6854 spg_t(pg
->info
.pgid
.pgid
, remote_recovery_reservation_it
->shard
),
6855 pg
->get_osdmap()->get_epoch()),
6858 ++remote_recovery_reservation_it
;
6860 post_event(AllRemotesReserved());
6862 return discard_event();
6865 void PG::RecoveryState::WaitRemoteRecoveryReserved::exit()
6867 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6868 PG
*pg
= context
< RecoveryMachine
>().pg
;
6869 utime_t dur
= ceph_clock_now() - enter_time
;
6870 pg
->osd
->recoverystate_perf
->tinc(rs_waitremoterecoveryreserved_latency
, dur
);
6873 PG::RecoveryState::Recovering::Recovering(my_context ctx
)
6875 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/Recovering")
6877 context
< RecoveryMachine
>().log_enter(state_name
);
6879 PG
*pg
= context
< RecoveryMachine
>().pg
;
6880 pg
->state_clear(PG_STATE_RECOVERY_WAIT
);
6881 pg
->state_clear(PG_STATE_RECOVERY_TOOFULL
);
6882 pg
->state_set(PG_STATE_RECOVERING
);
6883 pg
->publish_stats_to_osd();
6884 pg
->queue_recovery();
6887 void PG::RecoveryState::Recovering::release_reservations(bool cancel
)
6889 PG
*pg
= context
< RecoveryMachine
>().pg
;
6890 assert(cancel
|| !pg
->pg_log
.get_missing().have_missing());
6892 // release remote reservations
6893 for (set
<pg_shard_t
>::const_iterator i
=
6894 context
< Active
>().remote_shards_to_reserve_recovery
.begin();
6895 i
!= context
< Active
>().remote_shards_to_reserve_recovery
.end();
6897 if (*i
== pg
->pg_whoami
) // skip myself
6899 ConnectionRef con
= pg
->osd
->get_con_osd_cluster(
6900 i
->osd
, pg
->get_osdmap()->get_epoch());
6902 pg
->osd
->send_message_osd_cluster(
6903 new MRecoveryReserve(
6904 MRecoveryReserve::RELEASE
,
6905 spg_t(pg
->info
.pgid
.pgid
, i
->shard
),
6906 pg
->get_osdmap()->get_epoch()),
6912 boost::statechart::result
6913 PG::RecoveryState::Recovering::react(const AllReplicasRecovered
&evt
)
6915 PG
*pg
= context
< RecoveryMachine
>().pg
;
6916 pg
->state_clear(PG_STATE_RECOVERING
);
6917 pg
->state_clear(PG_STATE_FORCED_RECOVERY
);
6918 release_reservations();
6919 return transit
<Recovered
>();
6922 boost::statechart::result
6923 PG::RecoveryState::Recovering::react(const RequestBackfill
&evt
)
6925 PG
*pg
= context
< RecoveryMachine
>().pg
;
6926 pg
->state_clear(PG_STATE_RECOVERING
);
6927 pg
->state_clear(PG_STATE_FORCED_RECOVERY
);
6928 release_reservations();
6929 return transit
<WaitRemoteBackfillReserved
>();
6932 boost::statechart::result
6933 PG::RecoveryState::Recovering::react(const CancelRecovery
&evt
)
6935 PG
*pg
= context
< RecoveryMachine
>().pg
;
6936 pg
->state_clear(PG_STATE_RECOVERING
);
6937 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
6938 release_reservations(true);
6939 pg
->schedule_recovery_full_retry();
6940 return transit
<NotRecovering
>();
6943 void PG::RecoveryState::Recovering::exit()
6945 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6946 PG
*pg
= context
< RecoveryMachine
>().pg
;
6947 utime_t dur
= ceph_clock_now() - enter_time
;
6948 pg
->osd
->recoverystate_perf
->tinc(rs_recovering_latency
, dur
);
6951 PG::RecoveryState::Recovered::Recovered(my_context ctx
)
6953 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/Recovered")
6955 pg_shard_t auth_log_shard
;
6957 context
< RecoveryMachine
>().log_enter(state_name
);
6959 PG
*pg
= context
< RecoveryMachine
>().pg
;
6960 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
6962 assert(!pg
->needs_recovery());
6964 // if we finished backfill, all acting are active; recheck if
6965 // DEGRADED | UNDERSIZED is appropriate.
6966 assert(!pg
->actingbackfill
.empty());
6967 if (pg
->get_osdmap()->get_pg_size(pg
->info
.pgid
.pgid
) <=
6968 pg
->actingbackfill
.size()) {
6969 pg
->state_clear(PG_STATE_DEGRADED
);
6970 pg
->state_clear(PG_STATE_FORCED_BACKFILL
| PG_STATE_FORCED_RECOVERY
);
6971 pg
->publish_stats_to_osd();
6974 // trim pglog on recovered
6977 // adjust acting set? (e.g. because backfill completed...)
6978 bool history_les_bound
= false;
6979 if (pg
->acting
!= pg
->up
&& !pg
->choose_acting(auth_log_shard
,
6980 true, &history_les_bound
))
6981 assert(pg
->want_acting
.size());
6983 if (context
< Active
>().all_replicas_activated
)
6984 post_event(GoClean());
6987 void PG::RecoveryState::Recovered::exit()
6989 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
6990 PG
*pg
= context
< RecoveryMachine
>().pg
;
6991 utime_t dur
= ceph_clock_now() - enter_time
;
6992 pg
->osd
->recoverystate_perf
->tinc(rs_recovered_latency
, dur
);
6995 PG::RecoveryState::Clean::Clean(my_context ctx
)
6997 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active/Clean")
6999 context
< RecoveryMachine
>().log_enter(state_name
);
7001 PG
*pg
= context
< RecoveryMachine
>().pg
;
7003 if (pg
->info
.last_complete
!= pg
->info
.last_update
) {
7006 pg
->finish_recovery(*context
< RecoveryMachine
>().get_on_safe_context_list());
7008 if (pg
->is_active()) {
7012 pg
->share_pg_info();
7013 pg
->publish_stats_to_osd();
7014 pg
->requeue_ops(pg
->waiting_for_clean_to_primary_repair
);
7017 void PG::RecoveryState::Clean::exit()
7019 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7020 PG
*pg
= context
< RecoveryMachine
>().pg
;
7021 pg
->state_clear(PG_STATE_CLEAN
);
7022 utime_t dur
= ceph_clock_now() - enter_time
;
7023 pg
->osd
->recoverystate_perf
->tinc(rs_clean_latency
, dur
);
7026 template <typename T
>
7027 set
<pg_shard_t
> unique_osd_shard_set(const pg_shard_t
& skip
, const T
&in
)
7029 set
<int> osds_found
;
7030 set
<pg_shard_t
> out
;
7031 for (typename
T::const_iterator i
= in
.begin();
7034 if (*i
!= skip
&& !osds_found
.count(i
->osd
)) {
7035 osds_found
.insert(i
->osd
);
7042 /*---------Active---------*/
7043 PG::RecoveryState::Active::Active(my_context ctx
)
7045 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Active"),
7046 remote_shards_to_reserve_recovery(
7047 unique_osd_shard_set(
7048 context
< RecoveryMachine
>().pg
->pg_whoami
,
7049 context
< RecoveryMachine
>().pg
->actingbackfill
)),
7050 remote_shards_to_reserve_backfill(
7051 unique_osd_shard_set(
7052 context
< RecoveryMachine
>().pg
->pg_whoami
,
7053 context
< RecoveryMachine
>().pg
->backfill_targets
)),
7054 all_replicas_activated(false)
7056 context
< RecoveryMachine
>().log_enter(state_name
);
7058 PG
*pg
= context
< RecoveryMachine
>().pg
;
7060 assert(!pg
->backfill_reserving
);
7061 assert(!pg
->backfill_reserved
);
7062 assert(pg
->is_primary());
7063 ldout(pg
->cct
, 10) << "In Active, about to call activate" << dendl
;
7065 context
< RecoveryMachine
>().get_cur_transaction(),
7066 context
< RecoveryMachine
>().get_on_applied_context_list(),
7067 context
< RecoveryMachine
>().get_on_safe_context_list());
7068 pg
->activate(*context
< RecoveryMachine
>().get_cur_transaction(),
7069 pg
->get_osdmap()->get_epoch(),
7070 *context
< RecoveryMachine
>().get_on_safe_context_list(),
7071 *context
< RecoveryMachine
>().get_query_map(),
7072 context
< RecoveryMachine
>().get_info_map(),
7073 context
< RecoveryMachine
>().get_recovery_ctx());
7075 // everyone has to commit/ack before we are truly active
7076 pg
->blocked_by
.clear();
7077 for (set
<pg_shard_t
>::iterator p
= pg
->actingbackfill
.begin();
7078 p
!= pg
->actingbackfill
.end();
7080 if (p
->shard
!= pg
->pg_whoami
.shard
) {
7081 pg
->blocked_by
.insert(p
->shard
);
7084 pg
->publish_stats_to_osd();
7085 ldout(pg
->cct
, 10) << "Activate Finished" << dendl
;
7088 boost::statechart::result
PG::RecoveryState::Active::react(const AdvMap
& advmap
)
7090 PG
*pg
= context
< RecoveryMachine
>().pg
;
7091 ldout(pg
->cct
, 10) << "Active advmap" << dendl
;
7092 if (!pg
->pool
.newly_removed_snaps
.empty()) {
7093 pg
->snap_trimq
.union_of(pg
->pool
.newly_removed_snaps
);
7094 ldout(pg
->cct
, 10) << *pg
<< " snap_trimq now " << pg
->snap_trimq
<< dendl
;
7095 pg
->dirty_info
= true;
7096 pg
->dirty_big_info
= true;
7099 for (size_t i
= 0; i
< pg
->want_acting
.size(); i
++) {
7100 int osd
= pg
->want_acting
[i
];
7101 if (!advmap
.osdmap
->is_up(osd
)) {
7102 pg_shard_t
osd_with_shard(osd
, shard_id_t(i
));
7103 assert(pg
->is_acting(osd_with_shard
) || pg
->is_up(osd_with_shard
));
7107 bool need_publish
= false;
7108 /* Check for changes in pool size (if the acting set changed as a result,
7109 * this does not matter) */
7110 if (advmap
.lastmap
->get_pg_size(pg
->info
.pgid
.pgid
) !=
7111 pg
->get_osdmap()->get_pg_size(pg
->info
.pgid
.pgid
)) {
7112 if (pg
->get_osdmap()->get_pg_size(pg
->info
.pgid
.pgid
) <= pg
->actingset
.size()) {
7113 pg
->state_clear(PG_STATE_UNDERSIZED
);
7114 if (pg
->needs_recovery()) {
7115 pg
->state_set(PG_STATE_DEGRADED
);
7117 pg
->state_clear(PG_STATE_DEGRADED
);
7120 pg
->state_set(PG_STATE_UNDERSIZED
);
7121 pg
->state_set(PG_STATE_DEGRADED
);
7123 need_publish
= true; // degraded may have changed
7126 // if we haven't reported our PG stats in a long time, do so now.
7127 if (pg
->info
.stats
.reported_epoch
+ pg
->cct
->_conf
->osd_pg_stat_report_interval_max
< advmap
.osdmap
->get_epoch()) {
7128 ldout(pg
->cct
, 20) << "reporting stats to osd after " << (advmap
.osdmap
->get_epoch() - pg
->info
.stats
.reported_epoch
)
7129 << " epochs" << dendl
;
7130 need_publish
= true;
7134 pg
->publish_stats_to_osd();
7136 return forward_event();
7139 boost::statechart::result
PG::RecoveryState::Active::react(const ActMap
&)
7141 PG
*pg
= context
< RecoveryMachine
>().pg
;
7142 ldout(pg
->cct
, 10) << "Active: handling ActMap" << dendl
;
7143 assert(pg
->is_primary());
7145 if (pg
->have_unfound()) {
7146 // object may have become unfound
7147 pg
->discover_all_missing(*context
< RecoveryMachine
>().get_query_map());
7150 if (pg
->cct
->_conf
->osd_check_for_log_corruption
)
7151 pg
->check_log_for_corruption(pg
->osd
->store
);
7153 uint64_t unfound
= pg
->missing_loc
.num_unfound();
7155 pg
->all_unfound_are_queried_or_lost(pg
->get_osdmap())) {
7156 if (pg
->cct
->_conf
->osd_auto_mark_unfound_lost
) {
7157 pg
->osd
->clog
->error() << pg
->info
.pgid
.pgid
<< " has " << unfound
7158 << " objects unfound and apparently lost, would automatically "
7159 << "mark these objects lost but this feature is not yet implemented "
7160 << "(osd_auto_mark_unfound_lost)";
7162 pg
->osd
->clog
->error() << pg
->info
.pgid
.pgid
<< " has "
7163 << unfound
<< " objects unfound and apparently lost";
7166 if (pg
->is_active()) {
7167 ldout(pg
->cct
, 10) << "Active: kicking snap trim" << dendl
;
7168 pg
->kick_snap_trim();
7171 if (pg
->is_peered() &&
7173 !pg
->get_osdmap()->test_flag(CEPH_OSDMAP_NOBACKFILL
) &&
7174 (!pg
->get_osdmap()->test_flag(CEPH_OSDMAP_NOREBALANCE
) || pg
->is_degraded())) {
7175 pg
->queue_recovery();
7177 return forward_event();
7180 boost::statechart::result
PG::RecoveryState::Active::react(const MNotifyRec
& notevt
)
7182 PG
*pg
= context
< RecoveryMachine
>().pg
;
7183 assert(pg
->is_primary());
7184 if (pg
->peer_info
.count(notevt
.from
)) {
7185 ldout(pg
->cct
, 10) << "Active: got notify from " << notevt
.from
7186 << ", already have info from that osd, ignoring"
7188 } else if (pg
->peer_purged
.count(notevt
.from
)) {
7189 ldout(pg
->cct
, 10) << "Active: got notify from " << notevt
.from
7190 << ", already purged that peer, ignoring"
7193 ldout(pg
->cct
, 10) << "Active: got notify from " << notevt
.from
7194 << ", calling proc_replica_info and discover_all_missing"
7196 pg
->proc_replica_info(
7197 notevt
.from
, notevt
.notify
.info
, notevt
.notify
.epoch_sent
);
7198 if (pg
->have_unfound()) {
7199 pg
->discover_all_missing(*context
< RecoveryMachine
>().get_query_map());
7202 return discard_event();
7205 boost::statechart::result
PG::RecoveryState::Active::react(const MInfoRec
& infoevt
)
7207 PG
*pg
= context
< RecoveryMachine
>().pg
;
7208 assert(pg
->is_primary());
7210 assert(!pg
->actingbackfill
.empty());
7211 // don't update history (yet) if we are active and primary; the replica
7212 // may be telling us they have activated (and committed) but we can't
7213 // share that until _everyone_ does the same.
7214 if (pg
->is_actingbackfill(infoevt
.from
)) {
7215 ldout(pg
->cct
, 10) << " peer osd." << infoevt
.from
7216 << " activated and committed" << dendl
;
7217 pg
->peer_activated
.insert(infoevt
.from
);
7218 pg
->blocked_by
.erase(infoevt
.from
.shard
);
7219 pg
->publish_stats_to_osd();
7220 if (pg
->peer_activated
.size() == pg
->actingbackfill
.size()) {
7221 pg
->all_activated_and_committed();
7224 return discard_event();
7227 boost::statechart::result
PG::RecoveryState::Active::react(const MLogRec
& logevt
)
7229 PG
*pg
= context
< RecoveryMachine
>().pg
;
7230 ldout(pg
->cct
, 10) << "searching osd." << logevt
.from
7231 << " log for unfound items" << dendl
;
7232 pg
->proc_replica_log(
7233 logevt
.msg
->info
, logevt
.msg
->log
, logevt
.msg
->missing
, logevt
.from
);
7234 bool got_missing
= pg
->search_for_missing(
7235 pg
->peer_info
[logevt
.from
],
7236 pg
->peer_missing
[logevt
.from
],
7238 context
< RecoveryMachine
>().get_recovery_ctx());
7239 if (pg
->is_peered() &&
7241 pg
->queue_recovery();
7242 return discard_event();
7245 boost::statechart::result
PG::RecoveryState::Active::react(const QueryState
& q
)
7247 PG
*pg
= context
< RecoveryMachine
>().pg
;
7249 q
.f
->open_object_section("state");
7250 q
.f
->dump_string("name", state_name
);
7251 q
.f
->dump_stream("enter_time") << enter_time
;
7254 q
.f
->open_array_section("might_have_unfound");
7255 for (set
<pg_shard_t
>::iterator p
= pg
->might_have_unfound
.begin();
7256 p
!= pg
->might_have_unfound
.end();
7258 q
.f
->open_object_section("osd");
7259 q
.f
->dump_stream("osd") << *p
;
7260 if (pg
->peer_missing
.count(*p
)) {
7261 q
.f
->dump_string("status", "already probed");
7262 } else if (pg
->peer_missing_requested
.count(*p
)) {
7263 q
.f
->dump_string("status", "querying");
7264 } else if (!pg
->get_osdmap()->is_up(p
->osd
)) {
7265 q
.f
->dump_string("status", "osd is down");
7267 q
.f
->dump_string("status", "not queried");
7269 q
.f
->close_section();
7271 q
.f
->close_section();
7274 q
.f
->open_object_section("recovery_progress");
7275 pg
->dump_recovery_info(q
.f
);
7276 q
.f
->close_section();
7280 q
.f
->open_object_section("scrub");
7281 q
.f
->dump_stream("scrubber.epoch_start") << pg
->scrubber
.epoch_start
;
7282 q
.f
->dump_bool("scrubber.active", pg
->scrubber
.active
);
7283 q
.f
->dump_string("scrubber.state", Scrubber::state_string(pg
->scrubber
.state
));
7284 q
.f
->dump_stream("scrubber.start") << pg
->scrubber
.start
;
7285 q
.f
->dump_stream("scrubber.end") << pg
->scrubber
.end
;
7286 q
.f
->dump_stream("scrubber.subset_last_update") << pg
->scrubber
.subset_last_update
;
7287 q
.f
->dump_bool("scrubber.deep", pg
->scrubber
.deep
);
7288 q
.f
->dump_unsigned("scrubber.seed", pg
->scrubber
.seed
);
7289 q
.f
->dump_int("scrubber.waiting_on", pg
->scrubber
.waiting_on
);
7291 q
.f
->open_array_section("scrubber.waiting_on_whom");
7292 for (set
<pg_shard_t
>::iterator p
= pg
->scrubber
.waiting_on_whom
.begin();
7293 p
!= pg
->scrubber
.waiting_on_whom
.end();
7295 q
.f
->dump_stream("shard") << *p
;
7297 q
.f
->close_section();
7299 q
.f
->close_section();
7302 q
.f
->close_section();
7303 return forward_event();
7306 boost::statechart::result
PG::RecoveryState::Active::react(const AllReplicasActivated
&evt
)
7308 PG
*pg
= context
< RecoveryMachine
>().pg
;
7309 all_replicas_activated
= true;
7311 pg
->state_clear(PG_STATE_ACTIVATING
);
7312 pg
->state_clear(PG_STATE_CREATING
);
7313 if (pg
->acting
.size() >= pg
->pool
.info
.min_size
) {
7314 pg
->state_set(PG_STATE_ACTIVE
);
7316 pg
->state_set(PG_STATE_PEERED
);
7319 // info.last_epoch_started is set during activate()
7320 pg
->info
.history
.last_epoch_started
= pg
->info
.last_epoch_started
;
7321 pg
->info
.history
.last_interval_started
= pg
->info
.last_interval_started
;
7322 pg
->dirty_info
= true;
7324 pg
->share_pg_info();
7325 pg
->publish_stats_to_osd();
7330 if (pg
->flushes_in_progress
== 0) {
7331 pg
->requeue_ops(pg
->waiting_for_peered
);
7336 return discard_event();
7339 void PG::RecoveryState::Active::exit()
7341 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7342 PG
*pg
= context
< RecoveryMachine
>().pg
;
7343 pg
->osd
->local_reserver
.cancel_reservation(pg
->info
.pgid
);
7345 pg
->blocked_by
.clear();
7346 pg
->backfill_reserved
= false;
7347 pg
->backfill_reserving
= false;
7348 pg
->state_clear(PG_STATE_ACTIVATING
);
7349 pg
->state_clear(PG_STATE_DEGRADED
);
7350 pg
->state_clear(PG_STATE_UNDERSIZED
);
7351 pg
->state_clear(PG_STATE_BACKFILL_TOOFULL
);
7352 pg
->state_clear(PG_STATE_BACKFILL_WAIT
);
7353 pg
->state_clear(PG_STATE_RECOVERY_WAIT
);
7354 pg
->state_clear(PG_STATE_RECOVERY_TOOFULL
);
7355 utime_t dur
= ceph_clock_now() - enter_time
;
7356 pg
->osd
->recoverystate_perf
->tinc(rs_active_latency
, dur
);
7360 /*------ReplicaActive-----*/
7361 PG::RecoveryState::ReplicaActive::ReplicaActive(my_context ctx
)
7363 NamedState(context
< RecoveryMachine
>().pg
, "Started/ReplicaActive")
7365 context
< RecoveryMachine
>().log_enter(state_name
);
7367 PG
*pg
= context
< RecoveryMachine
>().pg
;
7369 context
< RecoveryMachine
>().get_cur_transaction(),
7370 context
< RecoveryMachine
>().get_on_applied_context_list(),
7371 context
< RecoveryMachine
>().get_on_safe_context_list());
7375 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(
7376 const Activate
& actevt
) {
7377 PG
*pg
= context
< RecoveryMachine
>().pg
;
7378 ldout(pg
->cct
, 10) << "In ReplicaActive, about to call activate" << dendl
;
7379 map
<int, map
<spg_t
, pg_query_t
> > query_map
;
7380 pg
->activate(*context
< RecoveryMachine
>().get_cur_transaction(),
7381 actevt
.activation_epoch
,
7382 *context
< RecoveryMachine
>().get_on_safe_context_list(),
7383 query_map
, NULL
, NULL
);
7384 ldout(pg
->cct
, 10) << "Activate Finished" << dendl
;
7385 return discard_event();
7388 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(const MInfoRec
& infoevt
)
7390 PG
*pg
= context
< RecoveryMachine
>().pg
;
7391 pg
->proc_primary_info(*context
<RecoveryMachine
>().get_cur_transaction(),
7393 return discard_event();
7396 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(const MLogRec
& logevt
)
7398 PG
*pg
= context
< RecoveryMachine
>().pg
;
7399 ldout(pg
->cct
, 10) << "received log from " << logevt
.from
<< dendl
;
7400 ObjectStore::Transaction
* t
= context
<RecoveryMachine
>().get_cur_transaction();
7401 pg
->merge_log(*t
, logevt
.msg
->info
, logevt
.msg
->log
, logevt
.from
);
7402 assert(pg
->pg_log
.get_head() == pg
->info
.last_update
);
7404 return discard_event();
7407 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(const ActMap
&)
7409 PG
*pg
= context
< RecoveryMachine
>().pg
;
7410 if (pg
->should_send_notify() && pg
->get_primary().osd
>= 0) {
7411 context
< RecoveryMachine
>().send_notify(
7414 pg
->get_primary().shard
, pg
->pg_whoami
.shard
,
7415 pg
->get_osdmap()->get_epoch(),
7416 pg
->get_osdmap()->get_epoch(),
7418 pg
->past_intervals
);
7421 return discard_event();
7424 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(const MQuery
& query
)
7426 PG
*pg
= context
< RecoveryMachine
>().pg
;
7427 if (query
.query
.type
== pg_query_t::MISSING
) {
7428 pg
->update_history(query
.query
.history
);
7429 pg
->fulfill_log(query
.from
, query
.query
, query
.query_epoch
);
7430 } // else: from prior to activation, safe to ignore
7431 return discard_event();
7434 boost::statechart::result
PG::RecoveryState::ReplicaActive::react(const QueryState
& q
)
7436 q
.f
->open_object_section("state");
7437 q
.f
->dump_string("name", state_name
);
7438 q
.f
->dump_stream("enter_time") << enter_time
;
7439 q
.f
->close_section();
7440 return forward_event();
7443 void PG::RecoveryState::ReplicaActive::exit()
7445 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7446 PG
*pg
= context
< RecoveryMachine
>().pg
;
7447 pg
->osd
->remote_reserver
.cancel_reservation(pg
->info
.pgid
);
7448 utime_t dur
= ceph_clock_now() - enter_time
;
7449 pg
->osd
->recoverystate_perf
->tinc(rs_replicaactive_latency
, dur
);
7453 PG::RecoveryState::Stray::Stray(my_context ctx
)
7455 NamedState(context
< RecoveryMachine
>().pg
, "Started/Stray")
7457 context
< RecoveryMachine
>().log_enter(state_name
);
7459 PG
*pg
= context
< RecoveryMachine
>().pg
;
7460 assert(!pg
->is_peered());
7461 assert(!pg
->is_peering());
7462 assert(!pg
->is_primary());
7464 context
< RecoveryMachine
>().get_cur_transaction(),
7465 context
< RecoveryMachine
>().get_on_applied_context_list(),
7466 context
< RecoveryMachine
>().get_on_safe_context_list());
7469 boost::statechart::result
PG::RecoveryState::Stray::react(const MLogRec
& logevt
)
7471 PG
*pg
= context
< RecoveryMachine
>().pg
;
7472 MOSDPGLog
*msg
= logevt
.msg
.get();
7473 ldout(pg
->cct
, 10) << "got info+log from osd." << logevt
.from
<< " " << msg
->info
<< " " << msg
->log
<< dendl
;
7475 ObjectStore::Transaction
* t
= context
<RecoveryMachine
>().get_cur_transaction();
7476 if (msg
->info
.last_backfill
== hobject_t()) {
7478 pg
->unreg_next_scrub();
7479 pg
->info
= msg
->info
;
7480 pg
->reg_next_scrub();
7481 pg
->dirty_info
= true;
7482 pg
->dirty_big_info
= true; // maybe.
7484 PGLogEntryHandler rollbacker
{pg
, t
};
7485 pg
->pg_log
.reset_backfill_claim_log(msg
->log
, &rollbacker
);
7487 pg
->pg_log
.reset_backfill();
7489 pg
->merge_log(*t
, msg
->info
, msg
->log
, logevt
.from
);
7492 assert(pg
->pg_log
.get_head() == pg
->info
.last_update
);
7494 post_event(Activate(logevt
.msg
->info
.last_epoch_started
));
7495 return transit
<ReplicaActive
>();
7498 boost::statechart::result
PG::RecoveryState::Stray::react(const MInfoRec
& infoevt
)
7500 PG
*pg
= context
< RecoveryMachine
>().pg
;
7501 ldout(pg
->cct
, 10) << "got info from osd." << infoevt
.from
<< " " << infoevt
.info
<< dendl
;
7503 if (pg
->info
.last_update
> infoevt
.info
.last_update
) {
7504 // rewind divergent log entries
7505 ObjectStore::Transaction
* t
= context
<RecoveryMachine
>().get_cur_transaction();
7506 pg
->rewind_divergent_log(*t
, infoevt
.info
.last_update
);
7507 pg
->info
.stats
= infoevt
.info
.stats
;
7508 pg
->info
.hit_set
= infoevt
.info
.hit_set
;
7511 assert(infoevt
.info
.last_update
== pg
->info
.last_update
);
7512 assert(pg
->pg_log
.get_head() == pg
->info
.last_update
);
7514 post_event(Activate(infoevt
.info
.last_epoch_started
));
7515 return transit
<ReplicaActive
>();
7518 boost::statechart::result
PG::RecoveryState::Stray::react(const MQuery
& query
)
7520 PG
*pg
= context
< RecoveryMachine
>().pg
;
7521 if (query
.query
.type
== pg_query_t::INFO
) {
7522 pair
<pg_shard_t
, pg_info_t
> notify_info
;
7523 pg
->update_history(query
.query
.history
);
7524 pg
->fulfill_info(query
.from
, query
.query
, notify_info
);
7525 context
< RecoveryMachine
>().send_notify(
7528 notify_info
.first
.shard
, pg
->pg_whoami
.shard
,
7530 pg
->get_osdmap()->get_epoch(),
7531 notify_info
.second
),
7532 pg
->past_intervals
);
7534 pg
->fulfill_log(query
.from
, query
.query
, query
.query_epoch
);
7536 return discard_event();
7539 boost::statechart::result
PG::RecoveryState::Stray::react(const ActMap
&)
7541 PG
*pg
= context
< RecoveryMachine
>().pg
;
7542 if (pg
->should_send_notify() && pg
->get_primary().osd
>= 0) {
7543 context
< RecoveryMachine
>().send_notify(
7546 pg
->get_primary().shard
, pg
->pg_whoami
.shard
,
7547 pg
->get_osdmap()->get_epoch(),
7548 pg
->get_osdmap()->get_epoch(),
7550 pg
->past_intervals
);
7553 return discard_event();
7556 void PG::RecoveryState::Stray::exit()
7558 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7559 PG
*pg
= context
< RecoveryMachine
>().pg
;
7560 utime_t dur
= ceph_clock_now() - enter_time
;
7561 pg
->osd
->recoverystate_perf
->tinc(rs_stray_latency
, dur
);
7564 /*--------GetInfo---------*/
7565 PG::RecoveryState::GetInfo::GetInfo(my_context ctx
)
7567 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/GetInfo")
7569 context
< RecoveryMachine
>().log_enter(state_name
);
7571 PG
*pg
= context
< RecoveryMachine
>().pg
;
7572 pg
->check_past_interval_bounds();
7573 PastIntervals::PriorSet
&prior_set
= context
< Peering
>().prior_set
;
7575 assert(pg
->blocked_by
.empty());
7577 prior_set
= pg
->build_prior();
7579 pg
->reset_min_peer_features();
7581 if (prior_set
.pg_down
) {
7582 post_event(IsDown());
7583 } else if (peer_info_requested
.empty()) {
7584 post_event(GotInfo());
7588 void PG::RecoveryState::GetInfo::get_infos()
7590 PG
*pg
= context
< RecoveryMachine
>().pg
;
7591 PastIntervals::PriorSet
&prior_set
= context
< Peering
>().prior_set
;
7593 pg
->blocked_by
.clear();
7594 for (set
<pg_shard_t
>::const_iterator it
= prior_set
.probe
.begin();
7595 it
!= prior_set
.probe
.end();
7597 pg_shard_t peer
= *it
;
7598 if (peer
== pg
->pg_whoami
) {
7601 if (pg
->peer_info
.count(peer
)) {
7602 ldout(pg
->cct
, 10) << " have osd." << peer
<< " info " << pg
->peer_info
[peer
] << dendl
;
7605 if (peer_info_requested
.count(peer
)) {
7606 ldout(pg
->cct
, 10) << " already requested info from osd." << peer
<< dendl
;
7607 pg
->blocked_by
.insert(peer
.osd
);
7608 } else if (!pg
->get_osdmap()->is_up(peer
.osd
)) {
7609 ldout(pg
->cct
, 10) << " not querying info from down osd." << peer
<< dendl
;
7611 ldout(pg
->cct
, 10) << " querying info from osd." << peer
<< dendl
;
7612 context
< RecoveryMachine
>().send_query(
7613 peer
, pg_query_t(pg_query_t::INFO
,
7614 it
->shard
, pg
->pg_whoami
.shard
,
7616 pg
->get_osdmap()->get_epoch()));
7617 peer_info_requested
.insert(peer
);
7618 pg
->blocked_by
.insert(peer
.osd
);
7622 pg
->publish_stats_to_osd();
7625 boost::statechart::result
PG::RecoveryState::GetInfo::react(const MNotifyRec
& infoevt
)
7627 PG
*pg
= context
< RecoveryMachine
>().pg
;
7629 set
<pg_shard_t
>::iterator p
= peer_info_requested
.find(infoevt
.from
);
7630 if (p
!= peer_info_requested
.end()) {
7631 peer_info_requested
.erase(p
);
7632 pg
->blocked_by
.erase(infoevt
.from
.osd
);
7635 epoch_t old_start
= pg
->info
.history
.last_epoch_started
;
7636 if (pg
->proc_replica_info(
7637 infoevt
.from
, infoevt
.notify
.info
, infoevt
.notify
.epoch_sent
)) {
7638 // we got something new ...
7639 PastIntervals::PriorSet
&prior_set
= context
< Peering
>().prior_set
;
7640 if (old_start
< pg
->info
.history
.last_epoch_started
) {
7641 ldout(pg
->cct
, 10) << " last_epoch_started moved forward, rebuilding prior" << dendl
;
7642 prior_set
= pg
->build_prior();
7644 // filter out any osds that got dropped from the probe set from
7645 // peer_info_requested. this is less expensive than restarting
7646 // peering (which would re-probe everyone).
7647 set
<pg_shard_t
>::iterator p
= peer_info_requested
.begin();
7648 while (p
!= peer_info_requested
.end()) {
7649 if (prior_set
.probe
.count(*p
) == 0) {
7650 ldout(pg
->cct
, 20) << " dropping osd." << *p
<< " from info_requested, no longer in probe set" << dendl
;
7651 peer_info_requested
.erase(p
++);
7658 ldout(pg
->cct
, 20) << "Adding osd: " << infoevt
.from
.osd
<< " peer features: "
7659 << hex
<< infoevt
.features
<< dec
<< dendl
;
7660 pg
->apply_peer_features(infoevt
.features
);
7662 // are we done getting everything?
7663 if (peer_info_requested
.empty() && !prior_set
.pg_down
) {
7664 ldout(pg
->cct
, 20) << "Common peer features: " << hex
<< pg
->get_min_peer_features() << dec
<< dendl
;
7665 ldout(pg
->cct
, 20) << "Common acting features: " << hex
<< pg
->get_min_acting_features() << dec
<< dendl
;
7666 ldout(pg
->cct
, 20) << "Common upacting features: " << hex
<< pg
->get_min_upacting_features() << dec
<< dendl
;
7667 post_event(GotInfo());
7670 return discard_event();
7673 boost::statechart::result
PG::RecoveryState::GetInfo::react(const QueryState
& q
)
7675 PG
*pg
= context
< RecoveryMachine
>().pg
;
7676 q
.f
->open_object_section("state");
7677 q
.f
->dump_string("name", state_name
);
7678 q
.f
->dump_stream("enter_time") << enter_time
;
7680 q
.f
->open_array_section("requested_info_from");
7681 for (set
<pg_shard_t
>::iterator p
= peer_info_requested
.begin();
7682 p
!= peer_info_requested
.end();
7684 q
.f
->open_object_section("osd");
7685 q
.f
->dump_stream("osd") << *p
;
7686 if (pg
->peer_info
.count(*p
)) {
7687 q
.f
->open_object_section("got_info");
7688 pg
->peer_info
[*p
].dump(q
.f
);
7689 q
.f
->close_section();
7691 q
.f
->close_section();
7693 q
.f
->close_section();
7695 q
.f
->close_section();
7696 return forward_event();
7699 void PG::RecoveryState::GetInfo::exit()
7701 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7702 PG
*pg
= context
< RecoveryMachine
>().pg
;
7703 utime_t dur
= ceph_clock_now() - enter_time
;
7704 pg
->osd
->recoverystate_perf
->tinc(rs_getinfo_latency
, dur
);
7705 pg
->blocked_by
.clear();
7706 pg
->publish_stats_to_osd();
7709 /*------GetLog------------*/
7710 PG::RecoveryState::GetLog::GetLog(my_context ctx
)
7713 context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/GetLog"),
7716 context
< RecoveryMachine
>().log_enter(state_name
);
7718 PG
*pg
= context
< RecoveryMachine
>().pg
;
7721 if (!pg
->choose_acting(auth_log_shard
, false,
7722 &context
< Peering
>().history_les_bound
)) {
7723 if (!pg
->want_acting
.empty()) {
7724 post_event(NeedActingChange());
7726 post_event(IsIncomplete());
7732 if (auth_log_shard
== pg
->pg_whoami
) {
7733 post_event(GotLog());
7737 const pg_info_t
& best
= pg
->peer_info
[auth_log_shard
];
7740 if (pg
->info
.last_update
< best
.log_tail
) {
7741 ldout(pg
->cct
, 10) << " not contiguous with osd." << auth_log_shard
<< ", down" << dendl
;
7742 post_event(IsIncomplete());
7746 // how much log to request?
7747 eversion_t request_log_from
= pg
->info
.last_update
;
7748 assert(!pg
->actingbackfill
.empty());
7749 for (set
<pg_shard_t
>::iterator p
= pg
->actingbackfill
.begin();
7750 p
!= pg
->actingbackfill
.end();
7752 if (*p
== pg
->pg_whoami
) continue;
7753 pg_info_t
& ri
= pg
->peer_info
[*p
];
7754 if (ri
.last_update
< pg
->info
.log_tail
&& ri
.last_update
>= best
.log_tail
&&
7755 ri
.last_update
< request_log_from
)
7756 request_log_from
= ri
.last_update
;
7760 ldout(pg
->cct
, 10) << " requesting log from osd." << auth_log_shard
<< dendl
;
7761 context
<RecoveryMachine
>().send_query(
7765 auth_log_shard
.shard
, pg
->pg_whoami
.shard
,
7766 request_log_from
, pg
->info
.history
,
7767 pg
->get_osdmap()->get_epoch()));
7769 assert(pg
->blocked_by
.empty());
7770 pg
->blocked_by
.insert(auth_log_shard
.osd
);
7771 pg
->publish_stats_to_osd();
7774 boost::statechart::result
PG::RecoveryState::GetLog::react(const AdvMap
& advmap
)
7776 PG
*pg
= context
< RecoveryMachine
>().pg
;
7777 // make sure our log source didn't go down. we need to check
7778 // explicitly because it may not be part of the prior set, which
7779 // means the Peering state check won't catch it going down.
7780 if (!advmap
.osdmap
->is_up(auth_log_shard
.osd
)) {
7781 ldout(pg
->cct
, 10) << "GetLog: auth_log_shard osd."
7782 << auth_log_shard
.osd
<< " went down" << dendl
;
7784 return transit
< Reset
>();
7787 // let the Peering state do its checks.
7788 return forward_event();
7791 boost::statechart::result
PG::RecoveryState::GetLog::react(const MLogRec
& logevt
)
7793 PG
*pg
= context
< RecoveryMachine
>().pg
;
7795 if (logevt
.from
!= auth_log_shard
) {
7796 ldout(pg
->cct
, 10) << "GetLog: discarding log from "
7797 << "non-auth_log_shard osd." << logevt
.from
<< dendl
;
7798 return discard_event();
7800 ldout(pg
->cct
, 10) << "GetLog: received master log from osd"
7801 << logevt
.from
<< dendl
;
7803 post_event(GotLog());
7804 return discard_event();
7807 boost::statechart::result
PG::RecoveryState::GetLog::react(const GotLog
&)
7809 PG
*pg
= context
< RecoveryMachine
>().pg
;
7810 ldout(pg
->cct
, 10) << "leaving GetLog" << dendl
;
7812 ldout(pg
->cct
, 10) << "processing master log" << dendl
;
7813 pg
->proc_master_log(*context
<RecoveryMachine
>().get_cur_transaction(),
7814 msg
->info
, msg
->log
, msg
->missing
,
7818 context
< RecoveryMachine
>().get_cur_transaction(),
7819 context
< RecoveryMachine
>().get_on_applied_context_list(),
7820 context
< RecoveryMachine
>().get_on_safe_context_list());
7821 return transit
< GetMissing
>();
7824 boost::statechart::result
PG::RecoveryState::GetLog::react(const QueryState
& q
)
7826 q
.f
->open_object_section("state");
7827 q
.f
->dump_string("name", state_name
);
7828 q
.f
->dump_stream("enter_time") << enter_time
;
7829 q
.f
->dump_stream("auth_log_shard") << auth_log_shard
;
7830 q
.f
->close_section();
7831 return forward_event();
7834 void PG::RecoveryState::GetLog::exit()
7836 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7837 PG
*pg
= context
< RecoveryMachine
>().pg
;
7838 utime_t dur
= ceph_clock_now() - enter_time
;
7839 pg
->osd
->recoverystate_perf
->tinc(rs_getlog_latency
, dur
);
7840 pg
->blocked_by
.clear();
7841 pg
->publish_stats_to_osd();
7844 /*------WaitActingChange--------*/
7845 PG::RecoveryState::WaitActingChange::WaitActingChange(my_context ctx
)
7847 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/WaitActingChange")
7849 context
< RecoveryMachine
>().log_enter(state_name
);
7852 boost::statechart::result
PG::RecoveryState::WaitActingChange::react(const AdvMap
& advmap
)
7854 PG
*pg
= context
< RecoveryMachine
>().pg
;
7855 OSDMapRef osdmap
= advmap
.osdmap
;
7857 ldout(pg
->cct
, 10) << "verifying no want_acting " << pg
->want_acting
<< " targets didn't go down" << dendl
;
7858 for (vector
<int>::iterator p
= pg
->want_acting
.begin(); p
!= pg
->want_acting
.end(); ++p
) {
7859 if (!osdmap
->is_up(*p
)) {
7860 ldout(pg
->cct
, 10) << " want_acting target osd." << *p
<< " went down, resetting" << dendl
;
7862 return transit
< Reset
>();
7865 return forward_event();
7868 boost::statechart::result
PG::RecoveryState::WaitActingChange::react(const MLogRec
& logevt
)
7870 PG
*pg
= context
< RecoveryMachine
>().pg
;
7871 ldout(pg
->cct
, 10) << "In WaitActingChange, ignoring MLocRec" << dendl
;
7872 return discard_event();
7875 boost::statechart::result
PG::RecoveryState::WaitActingChange::react(const MInfoRec
& evt
)
7877 PG
*pg
= context
< RecoveryMachine
>().pg
;
7878 ldout(pg
->cct
, 10) << "In WaitActingChange, ignoring MInfoRec" << dendl
;
7879 return discard_event();
7882 boost::statechart::result
PG::RecoveryState::WaitActingChange::react(const MNotifyRec
& evt
)
7884 PG
*pg
= context
< RecoveryMachine
>().pg
;
7885 ldout(pg
->cct
, 10) << "In WaitActingChange, ignoring MNotifyRec" << dendl
;
7886 return discard_event();
7889 boost::statechart::result
PG::RecoveryState::WaitActingChange::react(const QueryState
& q
)
7891 q
.f
->open_object_section("state");
7892 q
.f
->dump_string("name", state_name
);
7893 q
.f
->dump_stream("enter_time") << enter_time
;
7894 q
.f
->dump_string("comment", "waiting for pg acting set to change");
7895 q
.f
->close_section();
7896 return forward_event();
7899 void PG::RecoveryState::WaitActingChange::exit()
7901 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7902 PG
*pg
= context
< RecoveryMachine
>().pg
;
7903 utime_t dur
= ceph_clock_now() - enter_time
;
7904 pg
->osd
->recoverystate_perf
->tinc(rs_waitactingchange_latency
, dur
);
7907 /*------Down--------*/
7908 PG::RecoveryState::Down::Down(my_context ctx
)
7910 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/Down")
7912 context
< RecoveryMachine
>().log_enter(state_name
);
7913 PG
*pg
= context
< RecoveryMachine
>().pg
;
7915 pg
->state_clear(PG_STATE_PEERING
);
7916 pg
->state_set(PG_STATE_DOWN
);
7918 auto &prior_set
= context
< Peering
>().prior_set
;
7919 assert(pg
->blocked_by
.empty());
7920 pg
->blocked_by
.insert(prior_set
.down
.begin(), prior_set
.down
.end());
7921 pg
->publish_stats_to_osd();
7924 void PG::RecoveryState::Down::exit()
7926 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
7927 PG
*pg
= context
< RecoveryMachine
>().pg
;
7929 pg
->state_clear(PG_STATE_DOWN
);
7930 utime_t dur
= ceph_clock_now() - enter_time
;
7931 pg
->osd
->recoverystate_perf
->tinc(rs_down_latency
, dur
);
7933 pg
->blocked_by
.clear();
7934 pg
->publish_stats_to_osd();
7937 boost::statechart::result
PG::RecoveryState::Down::react(const QueryState
& q
)
7939 q
.f
->open_object_section("state");
7940 q
.f
->dump_string("name", state_name
);
7941 q
.f
->dump_stream("enter_time") << enter_time
;
7942 q
.f
->dump_string("comment",
7943 "not enough up instances of this PG to go active");
7944 q
.f
->close_section();
7945 return forward_event();
7948 /*------Incomplete--------*/
7949 PG::RecoveryState::Incomplete::Incomplete(my_context ctx
)
7951 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/Incomplete")
7953 context
< RecoveryMachine
>().log_enter(state_name
);
7954 PG
*pg
= context
< RecoveryMachine
>().pg
;
7956 pg
->state_clear(PG_STATE_PEERING
);
7957 pg
->state_set(PG_STATE_INCOMPLETE
);
7959 PastIntervals::PriorSet
&prior_set
= context
< Peering
>().prior_set
;
7960 assert(pg
->blocked_by
.empty());
7961 pg
->blocked_by
.insert(prior_set
.down
.begin(), prior_set
.down
.end());
7962 pg
->publish_stats_to_osd();
7965 boost::statechart::result
PG::RecoveryState::Incomplete::react(const AdvMap
&advmap
) {
7966 PG
*pg
= context
< RecoveryMachine
>().pg
;
7967 int64_t poolnum
= pg
->info
.pgid
.pool();
7969 // Reset if min_size turn smaller than previous value, pg might now be able to go active
7970 if (advmap
.lastmap
->get_pools().find(poolnum
)->second
.min_size
>
7971 advmap
.osdmap
->get_pools().find(poolnum
)->second
.min_size
) {
7973 return transit
< Reset
>();
7976 return forward_event();
7979 boost::statechart::result
PG::RecoveryState::Incomplete::react(const MNotifyRec
& notevt
) {
7980 PG
*pg
= context
< RecoveryMachine
>().pg
;
7981 ldout(pg
->cct
, 7) << "handle_pg_notify from osd." << notevt
.from
<< dendl
;
7982 if (pg
->proc_replica_info(
7983 notevt
.from
, notevt
.notify
.info
, notevt
.notify
.epoch_sent
)) {
7984 // We got something new, try again!
7985 return transit
< GetLog
>();
7987 return discard_event();
7991 boost::statechart::result
PG::RecoveryState::Incomplete::react(
7992 const QueryState
& q
)
7994 q
.f
->open_object_section("state");
7995 q
.f
->dump_string("name", state_name
);
7996 q
.f
->dump_stream("enter_time") << enter_time
;
7997 q
.f
->dump_string("comment", "not enough complete instances of this PG");
7998 q
.f
->close_section();
7999 return forward_event();
8002 void PG::RecoveryState::Incomplete::exit()
8004 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
8005 PG
*pg
= context
< RecoveryMachine
>().pg
;
8007 pg
->state_clear(PG_STATE_INCOMPLETE
);
8008 utime_t dur
= ceph_clock_now() - enter_time
;
8009 pg
->osd
->recoverystate_perf
->tinc(rs_incomplete_latency
, dur
);
8011 pg
->blocked_by
.clear();
8012 pg
->publish_stats_to_osd();
8015 /*------GetMissing--------*/
8016 PG::RecoveryState::GetMissing::GetMissing(my_context ctx
)
8018 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/GetMissing")
8020 context
< RecoveryMachine
>().log_enter(state_name
);
8022 PG
*pg
= context
< RecoveryMachine
>().pg
;
8023 assert(!pg
->actingbackfill
.empty());
8025 for (set
<pg_shard_t
>::iterator i
= pg
->actingbackfill
.begin();
8026 i
!= pg
->actingbackfill
.end();
8028 if (*i
== pg
->get_primary()) continue;
8029 const pg_info_t
& pi
= pg
->peer_info
[*i
];
8030 // reset this so to make sure the pg_missing_t is initialized and
8031 // has the correct semantics even if we don't need to get a
8032 // missing set from a shard. This way later additions due to
8033 // lost+unfound delete work properly.
8034 pg
->peer_missing
[*i
].may_include_deletes
= !pg
->perform_deletes_during_peering();
8037 continue; // no pg data, nothing divergent
8039 if (pi
.last_update
< pg
->pg_log
.get_tail()) {
8040 ldout(pg
->cct
, 10) << " osd." << *i
<< " is not contiguous, will restart backfill" << dendl
;
8041 pg
->peer_missing
[*i
].clear();
8044 if (pi
.last_backfill
== hobject_t()) {
8045 ldout(pg
->cct
, 10) << " osd." << *i
<< " will fully backfill; can infer empty missing set" << dendl
;
8046 pg
->peer_missing
[*i
].clear();
8050 if (pi
.last_update
== pi
.last_complete
&& // peer has no missing
8051 pi
.last_update
== pg
->info
.last_update
) { // peer is up to date
8052 // replica has no missing and identical log as us. no need to
8054 // FIXME: we can do better here. if last_update==last_complete we
8055 // can infer the rest!
8056 ldout(pg
->cct
, 10) << " osd." << *i
<< " has no missing, identical log" << dendl
;
8057 pg
->peer_missing
[*i
].clear();
8061 // We pull the log from the peer's last_epoch_started to ensure we
8062 // get enough log to detect divergent updates.
8063 since
.epoch
= pi
.last_epoch_started
;
8064 assert(pi
.last_update
>= pg
->info
.log_tail
); // or else choose_acting() did a bad thing
8065 if (pi
.log_tail
<= since
) {
8066 ldout(pg
->cct
, 10) << " requesting log+missing since " << since
<< " from osd." << *i
<< dendl
;
8067 context
< RecoveryMachine
>().send_query(
8071 i
->shard
, pg
->pg_whoami
.shard
,
8072 since
, pg
->info
.history
,
8073 pg
->get_osdmap()->get_epoch()));
8075 ldout(pg
->cct
, 10) << " requesting fulllog+missing from osd." << *i
8076 << " (want since " << since
<< " < log.tail "
8077 << pi
.log_tail
<< ")" << dendl
;
8078 context
< RecoveryMachine
>().send_query(
8080 pg_query_t::FULLLOG
,
8081 i
->shard
, pg
->pg_whoami
.shard
,
8082 pg
->info
.history
, pg
->get_osdmap()->get_epoch()));
8084 peer_missing_requested
.insert(*i
);
8085 pg
->blocked_by
.insert(i
->osd
);
8088 if (peer_missing_requested
.empty()) {
8089 if (pg
->need_up_thru
) {
8090 ldout(pg
->cct
, 10) << " still need up_thru update before going active"
8092 post_event(NeedUpThru());
8097 post_event(Activate(pg
->get_osdmap()->get_epoch()));
8099 pg
->publish_stats_to_osd();
8103 boost::statechart::result
PG::RecoveryState::GetMissing::react(const MLogRec
& logevt
)
8105 PG
*pg
= context
< RecoveryMachine
>().pg
;
8107 peer_missing_requested
.erase(logevt
.from
);
8108 pg
->proc_replica_log(logevt
.msg
->info
, logevt
.msg
->log
, logevt
.msg
->missing
, logevt
.from
);
8110 if (peer_missing_requested
.empty()) {
8111 if (pg
->need_up_thru
) {
8112 ldout(pg
->cct
, 10) << " still need up_thru update before going active"
8114 post_event(NeedUpThru());
8116 ldout(pg
->cct
, 10) << "Got last missing, don't need missing "
8117 << "posting Activate" << dendl
;
8118 post_event(Activate(pg
->get_osdmap()->get_epoch()));
8121 return discard_event();
8124 boost::statechart::result
PG::RecoveryState::GetMissing::react(const QueryState
& q
)
8126 PG
*pg
= context
< RecoveryMachine
>().pg
;
8127 q
.f
->open_object_section("state");
8128 q
.f
->dump_string("name", state_name
);
8129 q
.f
->dump_stream("enter_time") << enter_time
;
8131 q
.f
->open_array_section("peer_missing_requested");
8132 for (set
<pg_shard_t
>::iterator p
= peer_missing_requested
.begin();
8133 p
!= peer_missing_requested
.end();
8135 q
.f
->open_object_section("osd");
8136 q
.f
->dump_stream("osd") << *p
;
8137 if (pg
->peer_missing
.count(*p
)) {
8138 q
.f
->open_object_section("got_missing");
8139 pg
->peer_missing
[*p
].dump(q
.f
);
8140 q
.f
->close_section();
8142 q
.f
->close_section();
8144 q
.f
->close_section();
8146 q
.f
->close_section();
8147 return forward_event();
8150 void PG::RecoveryState::GetMissing::exit()
8152 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
8153 PG
*pg
= context
< RecoveryMachine
>().pg
;
8154 utime_t dur
= ceph_clock_now() - enter_time
;
8155 pg
->osd
->recoverystate_perf
->tinc(rs_getmissing_latency
, dur
);
8156 pg
->blocked_by
.clear();
8157 pg
->publish_stats_to_osd();
8160 /*------WaitUpThru--------*/
8161 PG::RecoveryState::WaitUpThru::WaitUpThru(my_context ctx
)
8163 NamedState(context
< RecoveryMachine
>().pg
, "Started/Primary/Peering/WaitUpThru")
8165 context
< RecoveryMachine
>().log_enter(state_name
);
8168 boost::statechart::result
PG::RecoveryState::WaitUpThru::react(const ActMap
& am
)
8170 PG
*pg
= context
< RecoveryMachine
>().pg
;
8171 if (!pg
->need_up_thru
) {
8172 post_event(Activate(pg
->get_osdmap()->get_epoch()));
8174 return forward_event();
8177 boost::statechart::result
PG::RecoveryState::WaitUpThru::react(const MLogRec
& logevt
)
8179 PG
*pg
= context
< RecoveryMachine
>().pg
;
8180 ldout(pg
->cct
, 10) << "Noting missing from osd." << logevt
.from
<< dendl
;
8181 pg
->peer_missing
[logevt
.from
].claim(logevt
.msg
->missing
);
8182 pg
->peer_info
[logevt
.from
] = logevt
.msg
->info
;
8183 return discard_event();
8186 boost::statechart::result
PG::RecoveryState::WaitUpThru::react(const QueryState
& q
)
8188 q
.f
->open_object_section("state");
8189 q
.f
->dump_string("name", state_name
);
8190 q
.f
->dump_stream("enter_time") << enter_time
;
8191 q
.f
->dump_string("comment", "waiting for osdmap to reflect a new up_thru for this osd");
8192 q
.f
->close_section();
8193 return forward_event();
8196 void PG::RecoveryState::WaitUpThru::exit()
8198 context
< RecoveryMachine
>().log_exit(state_name
, enter_time
);
8199 PG
*pg
= context
< RecoveryMachine
>().pg
;
8200 utime_t dur
= ceph_clock_now() - enter_time
;
8201 pg
->osd
->recoverystate_perf
->tinc(rs_waitupthru_latency
, dur
);
8204 /*----RecoveryState::RecoveryMachine Methods-----*/
8206 #define dout_prefix *_dout << pg->gen_prefix()
8208 void PG::RecoveryState::RecoveryMachine::log_enter(const char *state_name
)
8210 PG
*pg
= context
< RecoveryMachine
>().pg
;
8211 ldout(pg
->cct
, 5) << "enter " << state_name
<< dendl
;
8212 pg
->osd
->pg_recovery_stats
.log_enter(state_name
);
8215 void PG::RecoveryState::RecoveryMachine::log_exit(const char *state_name
, utime_t enter_time
)
8217 utime_t dur
= ceph_clock_now() - enter_time
;
8218 PG
*pg
= context
< RecoveryMachine
>().pg
;
8219 ldout(pg
->cct
, 5) << "exit " << state_name
<< " " << dur
<< " " << event_count
<< " " << event_time
<< dendl
;
8220 pg
->osd
->pg_recovery_stats
.log_exit(state_name
, ceph_clock_now() - enter_time
,
8221 event_count
, event_time
);
8223 event_time
= utime_t();
8227 /*---------------------------------------------------*/
8229 #define dout_prefix (*_dout << (debug_pg ? debug_pg->gen_prefix() : string()) << " PriorSet: ")
8231 void PG::RecoveryState::start_handle(RecoveryCtx
*new_ctx
) {
8236 if (messages_pending_flush
) {
8237 rctx
= RecoveryCtx(*messages_pending_flush
, *new_ctx
);
8241 rctx
->start_time
= ceph_clock_now();
8245 void PG::RecoveryState::begin_block_outgoing() {
8246 assert(!messages_pending_flush
);
8249 messages_pending_flush
= BufferedRecoveryMessages();
8250 rctx
= RecoveryCtx(*messages_pending_flush
, *orig_ctx
);
8253 void PG::RecoveryState::clear_blocked_outgoing() {
8256 messages_pending_flush
= boost::optional
<BufferedRecoveryMessages
>();
8259 void PG::RecoveryState::end_block_outgoing() {
8260 assert(messages_pending_flush
);
8264 rctx
= RecoveryCtx(*orig_ctx
);
8265 rctx
->accept_buffered_messages(*messages_pending_flush
);
8266 messages_pending_flush
= boost::optional
<BufferedRecoveryMessages
>();
8269 void PG::RecoveryState::end_handle() {
8271 utime_t dur
= ceph_clock_now() - rctx
->start_time
;
8272 machine
.event_time
+= dur
;
8275 machine
.event_count
++;
8276 rctx
= boost::optional
<RecoveryCtx
>();
8280 ostream
& operator<<(ostream
& out
, const PG::BackfillInterval
& bi
)
8282 out
<< "BackfillInfo(" << bi
.begin
<< "-" << bi
.end
8283 << " " << bi
.objects
.size() << " objects";
8284 if (!bi
.objects
.empty())
8285 out
<< " " << bi
.objects
;
8290 void intrusive_ptr_add_ref(PG
*pg
) { pg
->get("intptr"); }
8291 void intrusive_ptr_release(PG
*pg
) { pg
->put("intptr"); }
8293 #ifdef PG_DEBUG_REFS
8294 uint64_t get_with_id(PG
*pg
) { return pg
->get_with_id(); }
8295 void put_with_id(PG
*pg
, uint64_t id
) { return pg
->put_with_id(id
); }