// -*- 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) 2004-2006 Sage Weil * * 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. * */ #ifndef CEPH_MDS_EMETABLOB_H #define CEPH_MDS_EMETABLOB_H #include #include "../CInode.h" #include "../CDir.h" #include "../CDentry.h" #include "../LogSegment.h" #include "include/interval_set.h" #include "common/strescape.h" class MDSRank; class MDLog; class LogSegment; struct MDPeerUpdate; /* * a bunch of metadata in the journal */ /* notes: * * - make sure you adjust the inode.version for any modified inode you * journal. CDir and CDentry maintain a projected_version, but CInode * doesn't, since the journaled inode usually has to be modified * manually anyway (to delay the change in the MDS's cache until after * it is journaled). * */ class EMetaBlob { public: /* fullbit - a regular dentry + inode * * We encode this one a bit weirdly, just because (also, it's marginally faster * on multiple encodes, which I think can happen): * Encode a bufferlist on struct creation with all data members, without a struct_v. * When encode is called, encode struct_v and then append the bufferlist. * Decode straight into the appropriate variables. * * So, if you add members, encode them in the constructor and then change * the struct_v in the encode function! */ struct fullbit { static const int STATE_DIRTY = (1<<0); static const int STATE_DIRTYPARENT = (1<<1); static const int STATE_DIRTYPOOL = (1<<2); static const int STATE_NEED_SNAPFLUSH = (1<<3); static const int STATE_EPHEMERAL_RANDOM = (1<<4); std::string dn; // dentry std::string alternate_name; snapid_t dnfirst, dnlast; version_t dnv{0}; CInode::inode_const_ptr inode; // if it's not XXX should not be part of mempool; wait for std::pmr to simplify CInode::xattr_map_const_ptr xattrs; fragtree_t dirfragtree; std::string symlink; snapid_t oldest_snap; bufferlist snapbl; __u8 state{0}; CInode::old_inode_map_const_ptr old_inodes; // XXX should not be part of mempool; wait for std::pmr to simplify fullbit(std::string_view d, std::string_view an, snapid_t df, snapid_t dl, version_t v, const CInode::inode_const_ptr& i, const fragtree_t &dft, const CInode::xattr_map_const_ptr& xa, std::string_view sym, snapid_t os, const bufferlist &sbl, __u8 st, const CInode::old_inode_map_const_ptr& oi) : dn(d), alternate_name(an), dnfirst(df), dnlast(dl), dnv(v), inode(i), xattrs(xa), oldest_snap(os), state(st), old_inodes(oi) { if (i->is_symlink()) symlink = sym; if (i->is_dir()) dirfragtree = dft; snapbl = sbl; } explicit fullbit(bufferlist::const_iterator &p) { decode(p); } fullbit() = default; fullbit(const fullbit&) = delete; ~fullbit() {} fullbit& operator=(const fullbit&) = delete; void encode(bufferlist& bl, uint64_t features) const; void decode(bufferlist::const_iterator &bl); void dump(Formatter *f) const; static void generate_test_instances(std::list& ls); void update_inode(MDSRank *mds, CInode *in); bool is_dirty() const { return (state & STATE_DIRTY); } bool is_dirty_parent() const { return (state & STATE_DIRTYPARENT); } bool is_dirty_pool() const { return (state & STATE_DIRTYPOOL); } bool need_snapflush() const { return (state & STATE_NEED_SNAPFLUSH); } bool is_export_ephemeral_random() const { return (state & STATE_EPHEMERAL_RANDOM); } void print(std::ostream& out) const { out << " fullbit dn " << dn << " [" << dnfirst << "," << dnlast << "] dnv " << dnv << " inode " << inode->ino << " state=" << state; if (!alternate_name.empty()) { out << " altn " << binstrprint(alternate_name, 8); } out << std::endl; } std::string state_string() const { std::string state_string; bool marked_already = false; if (is_dirty()) { state_string.append("dirty"); marked_already = true; } if (is_dirty_parent()) { state_string.append(marked_already ? "+dirty_parent" : "dirty_parent"); if (is_dirty_pool()) state_string.append("+dirty_pool"); } return state_string; } }; WRITE_CLASS_ENCODER_FEATURES(fullbit) /* remotebit - a dentry + remote inode link (i.e. just an ino) */ struct remotebit { std::string dn; std::string alternate_name; snapid_t dnfirst = 0, dnlast = 0; version_t dnv = 0; inodeno_t ino = 0; unsigned char d_type = '\0'; bool dirty = false; remotebit(std::string_view d, std::string_view an, snapid_t df, snapid_t dl, version_t v, inodeno_t i, unsigned char dt, bool dr) : dn(d), alternate_name(an), dnfirst(df), dnlast(dl), dnv(v), ino(i), d_type(dt), dirty(dr) { } explicit remotebit(bufferlist::const_iterator &p) { decode(p); } remotebit() = default; void encode(bufferlist& bl) const; void decode(bufferlist::const_iterator &bl); void print(std::ostream& out) const { out << " remotebit dn " << dn << " [" << dnfirst << "," << dnlast << "] dnv " << dnv << " ino " << ino << " dirty=" << dirty; if (!alternate_name.empty()) { out << " altn " << binstrprint(alternate_name, 8); } out << std::endl; } void dump(Formatter *f) const; static void generate_test_instances(std::list& ls); }; WRITE_CLASS_ENCODER(remotebit) /* * nullbit - a null dentry */ struct nullbit { std::string dn; snapid_t dnfirst, dnlast; version_t dnv; bool dirty; nullbit(std::string_view d, snapid_t df, snapid_t dl, version_t v, bool dr) : dn(d), dnfirst(df), dnlast(dl), dnv(v), dirty(dr) { } explicit nullbit(bufferlist::const_iterator &p) { decode(p); } nullbit(): dnfirst(0), dnlast(0), dnv(0), dirty(false) {} void encode(bufferlist& bl) const; void decode(bufferlist::const_iterator &bl); void dump(Formatter *f) const; static void generate_test_instances(std::list& ls); void print(std::ostream& out) const { out << " nullbit dn " << dn << " [" << dnfirst << "," << dnlast << "] dnv " << dnv << " dirty=" << dirty << std::endl; } }; WRITE_CLASS_ENCODER(nullbit) /* dirlump - contains metadata for any dir we have contents for. */ public: struct dirlump { static const int STATE_COMPLETE = (1<<1); static const int STATE_DIRTY = (1<<2); // dirty due to THIS journal item, that is! static const int STATE_NEW = (1<<3); // new directory static const int STATE_IMPORTING = (1<<4); // importing directory static const int STATE_DIRTYDFT = (1<<5); // dirty dirfragtree //version_t dirv; CDir::fnode_const_ptr fnode; __u32 state; __u32 nfull, nremote, nnull; private: mutable bufferlist dnbl; mutable bool dn_decoded; mutable std::list dfull; mutable std::vector dremote; mutable std::vector dnull; public: dirlump() : state(0), nfull(0), nremote(0), nnull(0), dn_decoded(true) { } dirlump(const dirlump&) = delete; dirlump& operator=(const dirlump&) = delete; bool is_complete() const { return state & STATE_COMPLETE; } void mark_complete() { state |= STATE_COMPLETE; } bool is_dirty() const { return state & STATE_DIRTY; } void mark_dirty() { state |= STATE_DIRTY; } bool is_new() const { return state & STATE_NEW; } void mark_new() { state |= STATE_NEW; } bool is_importing() { return state & STATE_IMPORTING; } void mark_importing() { state |= STATE_IMPORTING; } bool is_dirty_dft() { return state & STATE_DIRTYDFT; } void mark_dirty_dft() { state |= STATE_DIRTYDFT; } const std::list &get_dfull() const { return dfull; } std::list &_get_dfull() { return dfull; } const std::vector &get_dremote() const { return dremote; } const std::vector &get_dnull() const { return dnull; } template< class... Args> void add_dfull(Args&&... args) { dfull.emplace_back(std::forward(args)...); } template< class... Args> void add_dremote(Args&&... args) { dremote.emplace_back(std::forward(args)...); } template< class... Args> void add_dnull(Args&&... args) { dnull.emplace_back(std::forward(args)...); } void print(dirfrag_t dirfrag, std::ostream& out) const { out << "dirlump " << dirfrag << " v " << fnode->version << " state " << state << " num " << nfull << "/" << nremote << "/" << nnull << std::endl; _decode_bits(); for (const auto& p : dfull) p.print(out); for (const auto& p : dremote) p.print(out); for (const auto& p : dnull) p.print(out); } std::string state_string() const { std::string state_string; bool marked_already = false; if (is_complete()) { state_string.append("complete"); marked_already = true; } if (is_dirty()) { state_string.append(marked_already ? "+dirty" : "dirty"); marked_already = true; } if (is_new()) { state_string.append(marked_already ? "+new" : "new"); } return state_string; } // if this changes, update the versioning in encode for it! void _encode_bits(uint64_t features) const { using ceph::encode; if (!dn_decoded) return; encode(dfull, dnbl, features); encode(dremote, dnbl); encode(dnull, dnbl); } void _decode_bits() const { using ceph::decode; if (dn_decoded) return; auto p = dnbl.cbegin(); decode(dfull, p); decode(dremote, p); decode(dnull, p); dn_decoded = true; } void encode(bufferlist& bl, uint64_t features) const; void decode(bufferlist::const_iterator &bl); void dump(Formatter *f) const; static void generate_test_instances(std::list& ls); }; WRITE_CLASS_ENCODER_FEATURES(dirlump) // my lumps. preserve the order we added them in a list. std::vector lump_order; std::map lump_map; std::list roots; public: std::vector > table_tids; // tableclient transactions inodeno_t opened_ino; public: inodeno_t renamed_dirino; std::vector renamed_dir_frags; private: // ino (pre)allocation. may involve both inotable AND session state. version_t inotablev, sessionmapv; inodeno_t allocated_ino; // inotable interval_set preallocated_inos; // inotable + session inodeno_t used_preallocated_ino; // session entity_name_t client_name; // session // inodes i've truncated std::vector truncate_start; // start truncate std::map truncate_finish; // finished truncate (started in segment blah) public: std::vector destroyed_inodes; private: // idempotent op(s) std::vector > client_reqs; std::vector > client_flushes; public: void encode(bufferlist& bl, uint64_t features) const; void decode(bufferlist::const_iterator& bl); void get_inodes(std::set &inodes) const; void get_paths(std::vector &paths) const; void get_dentries(std::map > &dentries) const; entity_name_t get_client_name() const {return client_name;} void dump(Formatter *f) const; static void generate_test_instances(std::list& ls); // soft stateadd uint64_t last_subtree_map; uint64_t event_seq; // for replay, in certain cases //LogSegment *_segment; EMetaBlob() : opened_ino(0), renamed_dirino(0), inotablev(0), sessionmapv(0), allocated_ino(0), last_subtree_map(0), event_seq(0) {} EMetaBlob(const EMetaBlob&) = delete; ~EMetaBlob() { } EMetaBlob& operator=(const EMetaBlob&) = delete; void print(std::ostream& out) { for (const auto &p : lump_order) lump_map[p].print(p, out); } void add_client_req(metareqid_t r, uint64_t tid=0) { client_reqs.push_back(std::pair(r, tid)); } void add_client_flush(metareqid_t r, uint64_t tid=0) { client_flushes.push_back(std::pair(r, tid)); } void add_table_transaction(int table, version_t tid) { table_tids.emplace_back(table, tid); } void add_opened_ino(inodeno_t ino) { ceph_assert(!opened_ino); opened_ino = ino; } void set_ino_alloc(inodeno_t alloc, inodeno_t used_prealloc, interval_set& prealloc, entity_name_t client, version_t sv, version_t iv) { allocated_ino = alloc; used_preallocated_ino = used_prealloc; preallocated_inos = prealloc; client_name = client; sessionmapv = sv; inotablev = iv; } void add_truncate_start(inodeno_t ino) { truncate_start.push_back(ino); } void add_truncate_finish(inodeno_t ino, uint64_t segoff) { truncate_finish[ino] = segoff; } bool rewrite_truncate_finish(MDSRank const *mds, std::map const &old_to_new); void add_destroyed_inode(inodeno_t ino) { destroyed_inodes.push_back(ino); } void add_null_dentry(CDentry *dn, bool dirty) { add_null_dentry(add_dir(dn->get_dir(), false), dn, dirty); } void add_null_dentry(dirlump& lump, CDentry *dn, bool dirty) { // add the dir dn->check_corruption(false); lump.nnull++; lump.add_dnull(dn->get_name(), dn->first, dn->last, dn->get_projected_version(), dirty); } void add_remote_dentry(CDentry *dn, bool dirty) { add_remote_dentry(add_dir(dn->get_dir(), false), dn, dirty, 0, 0); } void add_remote_dentry(CDentry *dn, bool dirty, inodeno_t rino, int rdt) { add_remote_dentry(add_dir(dn->get_dir(), false), dn, dirty, rino, rdt); } void add_remote_dentry(dirlump& lump, CDentry *dn, bool dirty, inodeno_t rino=0, unsigned char rdt=0) { dn->check_corruption(false); if (!rino) { rino = dn->get_projected_linkage()->get_remote_ino(); rdt = dn->get_projected_linkage()->get_remote_d_type(); } lump.nremote++; lump.add_dremote(dn->get_name(), dn->get_alternate_name(), dn->first, dn->last, dn->get_projected_version(), rino, rdt, dirty); } // return remote pointer to to-be-journaled inode void add_primary_dentry(CDentry *dn, CInode *in, bool dirty, bool dirty_parent=false, bool dirty_pool=false, bool need_snapflush=false) { __u8 state = 0; if (dirty) state |= fullbit::STATE_DIRTY; if (dirty_parent) state |= fullbit::STATE_DIRTYPARENT; if (dirty_pool) state |= fullbit::STATE_DIRTYPOOL; if (need_snapflush) state |= fullbit::STATE_NEED_SNAPFLUSH; add_primary_dentry(add_dir(dn->get_dir(), false), dn, in, state); } void add_primary_dentry(dirlump& lump, CDentry *dn, CInode *in, __u8 state) { dn->check_corruption(false); if (!in) in = dn->get_projected_linkage()->get_inode(); if (in->is_ephemeral_rand()) { state |= fullbit::STATE_EPHEMERAL_RANDOM; } const auto& pi = in->get_projected_inode(); ceph_assert(pi->version > 0); if ((state & fullbit::STATE_DIRTY) && pi->is_backtrace_updated()) state |= fullbit::STATE_DIRTYPARENT; bufferlist snapbl; const sr_t *sr = in->get_projected_srnode(); if (sr) sr->encode(snapbl); lump.nfull++; lump.add_dfull(dn->get_name(), dn->get_alternate_name(), dn->first, dn->last, dn->get_projected_version(), pi, in->dirfragtree, in->get_projected_xattrs(), in->symlink, in->oldest_snap, snapbl, state, in->get_old_inodes()); // make note of where this inode was last journaled in->last_journaled = event_seq; //cout << "journaling " << in->inode.ino << " at " << my_offset << std::endl; } // convenience: primary or remote? figure it out. void add_dentry(CDentry *dn, bool dirty) { dirlump& lump = add_dir(dn->get_dir(), false); add_dentry(lump, dn, dirty, false, false); } void add_import_dentry(CDentry *dn) { bool dirty_parent = false; bool dirty_pool = false; if (dn->get_linkage()->is_primary()) { dirty_parent = dn->get_linkage()->get_inode()->is_dirty_parent(); dirty_pool = dn->get_linkage()->get_inode()->is_dirty_pool(); } dirlump& lump = add_dir(dn->get_dir(), false); add_dentry(lump, dn, dn->is_dirty(), dirty_parent, dirty_pool); } void add_dentry(dirlump& lump, CDentry *dn, bool dirty, bool dirty_parent, bool dirty_pool) { // primary or remote if (dn->get_projected_linkage()->is_remote()) { add_remote_dentry(dn, dirty); } else if (dn->get_projected_linkage()->is_null()) { add_null_dentry(dn, dirty); } else { ceph_assert(dn->get_projected_linkage()->is_primary()); add_primary_dentry(dn, 0, dirty, dirty_parent, dirty_pool); } } void add_root(bool dirty, CInode *in) { in->last_journaled = event_seq; //cout << "journaling " << in->inode.ino << " at " << my_offset << std::endl; const auto& pi = in->get_projected_inode(); const auto& px = in->get_projected_xattrs(); const auto& pdft = in->dirfragtree; bufferlist snapbl; const sr_t *sr = in->get_projected_srnode(); if (sr) sr->encode(snapbl); for (auto p = roots.begin(); p != roots.end(); ++p) { if (p->inode->ino == in->ino()) { roots.erase(p); break; } } std::string empty; roots.emplace_back(empty, "", in->first, in->last, 0, pi, pdft, px, in->symlink, in->oldest_snap, snapbl, (dirty ? fullbit::STATE_DIRTY : 0), in->get_old_inodes()); } dirlump& add_dir(CDir *dir, bool dirty, bool complete=false) { return add_dir(dir->dirfrag(), dir->get_projected_fnode(), dirty, complete); } dirlump& add_new_dir(CDir *dir) { return add_dir(dir->dirfrag(), dir->get_projected_fnode(), true, true, true); // dirty AND complete AND new } dirlump& add_import_dir(CDir *dir) { // dirty=false would be okay in some cases return add_dir(dir->dirfrag(), dir->get_projected_fnode(), dir->is_dirty(), dir->is_complete(), false, true, dir->is_dirty_dft()); } dirlump& add_fragmented_dir(CDir *dir, bool dirty, bool dirtydft) { return add_dir(dir->dirfrag(), dir->get_projected_fnode(), dirty, false, false, false, dirtydft); } dirlump& add_dir(dirfrag_t df, const CDir::fnode_const_ptr& pf, bool dirty, bool complete=false, bool isnew=false, bool importing=false, bool dirty_dft=false) { if (lump_map.count(df) == 0) lump_order.push_back(df); dirlump& l = lump_map[df]; l.fnode = pf; if (complete) l.mark_complete(); if (dirty) l.mark_dirty(); if (isnew) l.mark_new(); if (importing) l.mark_importing(); if (dirty_dft) l.mark_dirty_dft(); return l; } static const int TO_AUTH_SUBTREE_ROOT = 0; // default. static const int TO_ROOT = 1; void add_dir_context(CDir *dir, int mode = TO_AUTH_SUBTREE_ROOT); bool empty() { return roots.empty() && lump_order.empty() && table_tids.empty() && truncate_start.empty() && truncate_finish.empty() && destroyed_inodes.empty() && client_reqs.empty() && opened_ino == 0 && inotablev == 0 && sessionmapv == 0; } void print(std::ostream& out) const { out << "[metablob"; if (!lump_order.empty()) out << " " << lump_order.front() << ", " << lump_map.size() << " dirs"; if (!table_tids.empty()) out << " table_tids=" << table_tids; if (allocated_ino || preallocated_inos.size()) { if (allocated_ino) out << " alloc_ino=" << allocated_ino; if (preallocated_inos.size()) out << " prealloc_ino=" << preallocated_inos; if (used_preallocated_ino) out << " used_prealloc_ino=" << used_preallocated_ino; out << " v" << inotablev; } out << "]"; } void update_segment(LogSegment *ls); void replay(MDSRank *mds, LogSegment *ls, int type, MDPeerUpdate *su=NULL); }; WRITE_CLASS_ENCODER_FEATURES(EMetaBlob) WRITE_CLASS_ENCODER_FEATURES(EMetaBlob::fullbit) WRITE_CLASS_ENCODER(EMetaBlob::remotebit) WRITE_CLASS_ENCODER(EMetaBlob::nullbit) WRITE_CLASS_ENCODER_FEATURES(EMetaBlob::dirlump) inline std::ostream& operator<<(std::ostream& out, const EMetaBlob& t) { t.print(out); return out; } #endif