// -*- mode:C++; tab-width:8; c-basic-offset:2; indent-tabs-mode:t -*- // vim: ts=8 sw=2 smarttab /* * Ceph - scalable distributed file system * * Copyright (C) 2013,2014 Inktank Storage, Inc. * Copyright (C) 2013,2014 Cloudwatt * * Author: Loic Dachary * * This is free software; you can redistribute it and/or * modify it under the terms of the GNU Lesser General Public * License version 2.1, as published by the Free Software * Foundation. See file COPYING. * */ #include "common/errno.h" #include "common/scrub_types.h" #include "ReplicatedBackend.h" #include "osd/scrubber/ScrubStore.h" #include "ECBackend.h" #include "PGBackend.h" #include "OSD.h" #include "erasure-code/ErasureCodePlugin.h" #include "OSDMap.h" #include "PGLog.h" #include "common/LogClient.h" #include "messages/MOSDPGRecoveryDelete.h" #include "messages/MOSDPGRecoveryDeleteReply.h" using std::less; using std::list; using std::make_pair; using std::map; using std::ostream; using std::ostringstream; using std::pair; using std::set; using std::string; using std::stringstream; using std::vector; using ceph::bufferlist; using ceph::bufferptr; using ceph::ErasureCodeProfile; using ceph::ErasureCodeInterfaceRef; #define dout_context cct #define dout_subsys ceph_subsys_osd #define DOUT_PREFIX_ARGS this #undef dout_prefix #define dout_prefix _prefix(_dout, this) static ostream& _prefix(std::ostream *_dout, PGBackend *pgb) { return pgb->get_parent()->gen_dbg_prefix(*_dout); } void PGBackend::recover_delete_object(const hobject_t &oid, eversion_t v, RecoveryHandle *h) { ceph_assert(get_parent()->get_acting_recovery_backfill_shards().size() > 0); for (const auto& shard : get_parent()->get_acting_recovery_backfill_shards()) { if (shard == get_parent()->whoami_shard()) continue; if (get_parent()->get_shard_missing(shard).is_missing(oid)) { dout(20) << __func__ << " will remove " << oid << " " << v << " from " << shard << dendl; h->deletes[shard].push_back(make_pair(oid, v)); get_parent()->begin_peer_recover(shard, oid); } } } void PGBackend::send_recovery_deletes(int prio, const map > > &deletes) { epoch_t min_epoch = get_parent()->get_last_peering_reset_epoch(); for (const auto& p : deletes) { const auto& shard = p.first; const auto& objects = p.second; ConnectionRef con = get_parent()->get_con_osd_cluster( shard.osd, get_osdmap_epoch()); if (!con) continue; auto it = objects.begin(); while (it != objects.end()) { uint64_t cost = 0; uint64_t deletes = 0; spg_t target_pg = spg_t(get_parent()->get_info().pgid.pgid, shard.shard); MOSDPGRecoveryDelete *msg = new MOSDPGRecoveryDelete(get_parent()->whoami_shard(), target_pg, get_osdmap_epoch(), min_epoch); msg->set_priority(prio); while (it != objects.end() && cost < cct->_conf->osd_max_push_cost && deletes < cct->_conf->osd_max_push_objects) { dout(20) << __func__ << ": sending recovery delete << " << it->first << " " << it->second << " to osd." << shard << dendl; msg->objects.push_back(*it); cost += cct->_conf->osd_push_per_object_cost; ++deletes; ++it; } msg->set_cost(cost); get_parent()->send_message_osd_cluster(msg, con); } } } bool PGBackend::handle_message(OpRequestRef op) { switch (op->get_req()->get_type()) { case MSG_OSD_PG_RECOVERY_DELETE: handle_recovery_delete(op); return true; case MSG_OSD_PG_RECOVERY_DELETE_REPLY: handle_recovery_delete_reply(op); return true; default: break; } return _handle_message(op); } void PGBackend::handle_recovery_delete(OpRequestRef op) { auto m = op->get_req(); ceph_assert(m->get_type() == MSG_OSD_PG_RECOVERY_DELETE); dout(20) << __func__ << " " << *op->get_req() << dendl; op->mark_started(); C_GatherBuilder gather(cct); for (const auto &p : m->objects) { get_parent()->remove_missing_object(p.first, p.second, gather.new_sub()); } auto reply = make_message(); reply->from = get_parent()->whoami_shard(); reply->set_priority(m->get_priority()); reply->pgid = spg_t(get_parent()->get_info().pgid.pgid, m->from.shard); reply->map_epoch = m->map_epoch; reply->min_epoch = m->min_epoch; reply->objects = m->objects; ConnectionRef conn = m->get_connection(); gather.set_finisher(new LambdaContext( [=, this](int r) { if (r != -EAGAIN) { get_parent()->send_message_osd_cluster(reply, conn.get()); } })); gather.activate(); } void PGBackend::handle_recovery_delete_reply(OpRequestRef op) { auto m = op->get_req(); ceph_assert(m->get_type() == MSG_OSD_PG_RECOVERY_DELETE_REPLY); dout(20) << __func__ << " " << *op->get_req() << dendl; for (const auto &p : m->objects) { ObjectRecoveryInfo recovery_info; hobject_t oid = p.first; recovery_info.version = p.second; get_parent()->on_peer_recover(m->from, oid, recovery_info); bool peers_recovered = true; for (const auto& shard : get_parent()->get_acting_recovery_backfill_shards()) { if (shard == get_parent()->whoami_shard()) continue; if (get_parent()->get_shard_missing(shard).is_missing(oid)) { dout(20) << __func__ << " " << oid << " still missing on at least " << shard << dendl; peers_recovered = false; break; } } if (peers_recovered && !get_parent()->get_local_missing().is_missing(oid)) { dout(20) << __func__ << " completed recovery, local_missing = " << get_parent()->get_local_missing() << dendl; object_stat_sum_t stat_diff; stat_diff.num_objects_recovered = 1; get_parent()->on_global_recover(p.first, stat_diff, true); } } } void PGBackend::rollback( const pg_log_entry_t &entry, ObjectStore::Transaction *t) { struct RollbackVisitor : public ObjectModDesc::Visitor { const hobject_t &hoid; PGBackend *pg; ObjectStore::Transaction t; RollbackVisitor( const hobject_t &hoid, PGBackend *pg) : hoid(hoid), pg(pg) {} void append(uint64_t old_size) override { ObjectStore::Transaction temp; pg->rollback_append(hoid, old_size, &temp); temp.append(t); temp.swap(t); } void setattrs(map > &attrs) override { ObjectStore::Transaction temp; pg->rollback_setattrs(hoid, attrs, &temp); temp.append(t); temp.swap(t); } void rmobject(version_t old_version) override { ObjectStore::Transaction temp; pg->rollback_stash(hoid, old_version, &temp); temp.append(t); temp.swap(t); } void try_rmobject(version_t old_version) override { ObjectStore::Transaction temp; pg->rollback_try_stash(hoid, old_version, &temp); temp.append(t); temp.swap(t); } void create() override { ObjectStore::Transaction temp; pg->rollback_create(hoid, &temp); temp.append(t); temp.swap(t); } void update_snaps(const set &snaps) override { ObjectStore::Transaction temp; pg->get_parent()->pgb_set_object_snap_mapping(hoid, snaps, &temp); temp.append(t); temp.swap(t); } void rollback_extents( version_t gen, const vector > &extents) override { ObjectStore::Transaction temp; pg->rollback_extents(gen, extents, hoid, &temp); temp.append(t); temp.swap(t); } }; ceph_assert(entry.mod_desc.can_rollback()); RollbackVisitor vis(entry.soid, this); entry.mod_desc.visit(&vis); t->append(vis.t); } struct Trimmer : public ObjectModDesc::Visitor { const hobject_t &soid; PGBackend *pg; ObjectStore::Transaction *t; Trimmer( const hobject_t &soid, PGBackend *pg, ObjectStore::Transaction *t) : soid(soid), pg(pg), t(t) {} void rmobject(version_t old_version) override { pg->trim_rollback_object( soid, old_version, t); } // try_rmobject defaults to rmobject void rollback_extents( version_t gen, const vector > &extents) override { pg->trim_rollback_object( soid, gen, t); } }; void PGBackend::rollforward( const pg_log_entry_t &entry, ObjectStore::Transaction *t) { auto dpp = get_parent()->get_dpp(); ldpp_dout(dpp, 20) << __func__ << ": entry=" << entry << dendl; if (!entry.can_rollback()) return; Trimmer trimmer(entry.soid, this, t); entry.mod_desc.visit(&trimmer); } void PGBackend::trim( const pg_log_entry_t &entry, ObjectStore::Transaction *t) { if (!entry.can_rollback()) return; Trimmer trimmer(entry.soid, this, t); entry.mod_desc.visit(&trimmer); } void PGBackend::try_stash( const hobject_t &hoid, version_t v, ObjectStore::Transaction *t) { t->try_rename( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), ghobject_t(hoid, v, get_parent()->whoami_shard().shard)); } void PGBackend::remove( const hobject_t &hoid, ObjectStore::Transaction *t) { ceph_assert(!hoid.is_temp()); t->remove( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); get_parent()->pgb_clear_object_snap_mapping(hoid, t); } void PGBackend::on_change_cleanup(ObjectStore::Transaction *t) { dout(10) << __func__ << dendl; // clear temp for (set::iterator i = temp_contents.begin(); i != temp_contents.end(); ++i) { dout(10) << __func__ << ": Removing oid " << *i << " from the temp collection" << dendl; t->remove( coll, ghobject_t(*i, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); } temp_contents.clear(); } int PGBackend::objects_list_partial( const hobject_t &begin, int min, int max, vector *ls, hobject_t *next) { ceph_assert(ls); // Starts with the smallest generation to make sure the result list // has the marker object (it might have multiple generations // though, which would be filtered). ghobject_t _next; if (!begin.is_min()) _next = ghobject_t(begin, 0, get_parent()->whoami_shard().shard); ls->reserve(max); int r = 0; if (min > max) min = max; while (!_next.is_max() && ls->size() < (unsigned)min) { vector objects; if (HAVE_FEATURE(parent->min_upacting_features(), OSD_FIXED_COLLECTION_LIST)) { r = store->collection_list( ch, _next, ghobject_t::get_max(), max - ls->size(), &objects, &_next); } else { r = store->collection_list_legacy( ch, _next, ghobject_t::get_max(), max - ls->size(), &objects, &_next); } if (r != 0) { derr << __func__ << " list collection " << ch << " got: " << cpp_strerror(r) << dendl; break; } for (vector::iterator i = objects.begin(); i != objects.end(); ++i) { if (i->is_pgmeta() || i->hobj.is_temp()) { continue; } if (i->is_no_gen()) { ls->push_back(i->hobj); } } } if (r == 0) *next = _next.hobj; return r; } int PGBackend::objects_list_range( const hobject_t &start, const hobject_t &end, vector *ls, vector *gen_obs) { ceph_assert(ls); vector objects; int r; if (HAVE_FEATURE(parent->min_upacting_features(), OSD_FIXED_COLLECTION_LIST)) { r = store->collection_list( ch, ghobject_t(start, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), ghobject_t(end, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), INT_MAX, &objects, NULL); } else { r = store->collection_list_legacy( ch, ghobject_t(start, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), ghobject_t(end, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), INT_MAX, &objects, NULL); } ls->reserve(objects.size()); for (vector::iterator i = objects.begin(); i != objects.end(); ++i) { if (i->is_pgmeta() || i->hobj.is_temp()) { continue; } if (i->is_no_gen()) { ls->push_back(i->hobj); } else if (gen_obs) { gen_obs->push_back(*i); } } return r; } int PGBackend::objects_get_attr( const hobject_t &hoid, const string &attr, bufferlist *out) { bufferptr bp; int r = store->getattr( ch, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), attr.c_str(), bp); if (r >= 0 && out) { out->clear(); out->push_back(std::move(bp)); } return r; } int PGBackend::objects_get_attrs( const hobject_t &hoid, map> *out) { return store->getattrs( ch, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), *out); } void PGBackend::rollback_setattrs( const hobject_t &hoid, map > &old_attrs, ObjectStore::Transaction *t) { map> to_set; ceph_assert(!hoid.is_temp()); for (map >::iterator i = old_attrs.begin(); i != old_attrs.end(); ++i) { if (i->second) { to_set[i->first] = *(i->second); } else { t->rmattr( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), i->first); } } t->setattrs( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), to_set); } void PGBackend::rollback_append( const hobject_t &hoid, uint64_t old_size, ObjectStore::Transaction *t) { ceph_assert(!hoid.is_temp()); t->truncate( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), old_size); } void PGBackend::rollback_stash( const hobject_t &hoid, version_t old_version, ObjectStore::Transaction *t) { ceph_assert(!hoid.is_temp()); t->remove( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); t->collection_move_rename( coll, ghobject_t(hoid, old_version, get_parent()->whoami_shard().shard), coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); } void PGBackend::rollback_try_stash( const hobject_t &hoid, version_t old_version, ObjectStore::Transaction *t) { ceph_assert(!hoid.is_temp()); t->remove( coll, ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); t->try_rename( coll, ghobject_t(hoid, old_version, get_parent()->whoami_shard().shard), ghobject_t(hoid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard)); } void PGBackend::rollback_extents( version_t gen, const vector > &extents, const hobject_t &hoid, ObjectStore::Transaction *t) { auto shard = get_parent()->whoami_shard().shard; for (auto &&extent: extents) { t->clone_range( coll, ghobject_t(hoid, gen, shard), ghobject_t(hoid, ghobject_t::NO_GEN, shard), extent.first, extent.second, extent.first); } t->remove( coll, ghobject_t(hoid, gen, shard)); } void PGBackend::trim_rollback_object( const hobject_t &hoid, version_t old_version, ObjectStore::Transaction *t) { ceph_assert(!hoid.is_temp()); t->remove( coll, ghobject_t(hoid, old_version, get_parent()->whoami_shard().shard)); } PGBackend *PGBackend::build_pg_backend( const pg_pool_t &pool, const map& profile, Listener *l, coll_t coll, ObjectStore::CollectionHandle &ch, ObjectStore *store, CephContext *cct) { ErasureCodeProfile ec_profile = profile; switch (pool.type) { case pg_pool_t::TYPE_REPLICATED: { return new ReplicatedBackend(l, coll, ch, store, cct); } case pg_pool_t::TYPE_ERASURE: { ErasureCodeInterfaceRef ec_impl; stringstream ss; ceph::ErasureCodePluginRegistry::instance().factory( profile.find("plugin")->second, cct->_conf.get_val("erasure_code_dir"), ec_profile, &ec_impl, &ss); ceph_assert(ec_impl); return new ECBackend( l, coll, ch, store, cct, ec_impl, pool.stripe_width); } default: ceph_abort(); return NULL; } } int PGBackend::be_scan_list( ScrubMap &map, ScrubMapBuilder &pos) { dout(10) << __func__ << " " << pos << dendl; ceph_assert(!pos.done()); ceph_assert(pos.pos < pos.ls.size()); hobject_t& poid = pos.ls[pos.pos]; struct stat st; int r = store->stat( ch, ghobject_t( poid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), &st, true); if (r == 0) { ScrubMap::object &o = map.objects[poid]; o.size = st.st_size; ceph_assert(!o.negative); store->getattrs( ch, ghobject_t( poid, ghobject_t::NO_GEN, get_parent()->whoami_shard().shard), o.attrs); if (pos.deep) { r = be_deep_scrub(poid, map, pos, o); } dout(25) << __func__ << " " << poid << dendl; } else if (r == -ENOENT) { dout(25) << __func__ << " " << poid << " got " << r << ", skipping" << dendl; } else if (r == -EIO) { dout(25) << __func__ << " " << poid << " got " << r << ", stat_error" << dendl; ScrubMap::object &o = map.objects[poid]; o.stat_error = true; } else { derr << __func__ << " got: " << cpp_strerror(r) << dendl; ceph_abort(); } if (r == -EINPROGRESS) { return -EINPROGRESS; } pos.next_object(); return 0; }