};
using BackrefLeafNodeRef = BackrefLeafNode::Ref;
+struct BackrefCursor :
+ BtreeCursor<paddr_t, backref::backref_map_val_t, BackrefLeafNode>
+{
+ using Base = BtreeCursor<paddr_t,
+ backref::backref_map_val_t,
+ BackrefLeafNode>;
+ using Base::BtreeCursor;
+ paddr_t get_paddr() const {
+ assert(key.is_absolute());
+ return key;
+ }
+ laddr_t get_laddr() const {
+ assert(is_viewable());
+ assert(!is_end());
+ return iter.get_val().laddr;
+ }
+ extent_types_t get_type() const {
+ assert(!is_end());
+ return iter.get_val().type;
+ }
+};
+using BackrefCursorRef = boost::intrusive_ptr<BackrefCursor>;
+
} // namespace crimson::os::seastore::backref
#if FMT_VERSION >= 90000
template <> struct fmt::formatter<crimson::os::seastore::backref::BackrefInternalNode> : fmt::ostream_formatter {};
template <> struct fmt::formatter<crimson::os::seastore::backref::BackrefLeafNode> : fmt::ostream_formatter {};
template <> struct fmt::formatter<crimson::os::seastore::backref::backref_node_meta_t> : fmt::ostream_formatter {};
+template <> struct fmt::formatter<crimson::os::seastore::backref::BackrefCursor> : fmt::ostream_formatter {};
#endif
#pragma once
#include "crimson/os/seastore/btree/btree_types.h"
+#include "crimson/os/seastore/backref/backref_tree_node.h"
namespace crimson::os::seastore {
class BackrefMapping {
+ using BackrefCursorRef = backref::BackrefCursorRef;
BackrefCursorRef cursor;
BackrefMapping(BackrefCursorRef cursor)
namespace crimson::os::seastore {
-base_iertr::future<> LBACursor::refresh()
-{
- LOG_PREFIX(LBACursor::refresh);
- return with_btree<lba::LBABtree>(
- ctx.cache,
- ctx,
- [this, FNAME, c=ctx](auto &btree) {
- c.trans.cursor_stats.num_refresh_parent_total++;
-
- if (!parent->is_valid()) {
- c.trans.cursor_stats.num_refresh_invalid_parent++;
- SUBTRACET(
- seastore_lba,
- "cursor {} parent is invalid, re-search from scratch",
- c.trans, *this);
- return btree.lower_bound(c, this->get_laddr()
- ).si_then([this](lba::LBABtree::iterator iter) {
- auto leaf = iter.get_leaf_node();
- parent = leaf;
- modifications = leaf->modifications;
- pos = iter.get_leaf_pos();
- if (!is_end()) {
- ceph_assert(!iter.is_end());
- ceph_assert(iter.get_key() == get_laddr());
- val = iter.get_val();
- assert(is_viewable());
- }
- });
- }
- assert(parent->is_stable() ||
- parent->is_pending_in_trans(c.trans.get_trans_id()));
- auto leaf = parent->cast<lba::LBALeafNode>();
- if (leaf->is_pending_in_trans(c.trans.get_trans_id())) {
- if (leaf->modified_since(modifications)) {
- c.trans.cursor_stats.num_refresh_modified_viewable_parent++;
- } else {
- // no need to refresh
- return base_iertr::now();
- }
- } else {
- auto [viewable, l] = leaf->resolve_transaction(c.trans, key);
- SUBTRACET(
- seastore_lba,
- "cursor: {} viewable: {}",
- c.trans, *this, viewable);
- if (!viewable) {
- leaf = l;
- c.trans.cursor_stats.num_refresh_unviewable_parent++;
- parent = leaf;
- } else {
- assert(leaf.get() == l.get());
- assert(leaf->is_stable());
- return base_iertr::now();
- }
- }
-
- modifications = leaf->modifications;
- if (is_end()) {
- pos = leaf->get_size();
- assert(!val);
- } else {
- auto i = leaf->lower_bound(get_laddr());
- pos = i.get_offset();
- val = i.get_val();
-
- auto iter = lba::LBALeafNode::iterator(leaf.get(), pos);
- ceph_assert(iter.get_key() == key);
- ceph_assert(iter.get_val() == val);
- assert(is_viewable());
- }
-
- return base_iertr::now();
- });
-}
-
namespace lba {
std::ostream& operator<<(std::ostream& out, const lba_map_val_t& v)
}
}
-template <typename key_t, typename val_t>
-bool BtreeCursor<key_t, val_t>::is_viewable() const {
+template <typename key_t, typename val_t, typename ParentT>
+bool BtreeCursor<key_t, val_t, ParentT>::is_viewable() const {
LOG_PREFIX(BtreeCursor::is_viewable());
if (!parent->is_valid() ||
modified_since<key_t>(parent, modifications)) {
return viewable;
}
-template struct BtreeCursor<laddr_t, lba::lba_map_val_t>;
-template struct BtreeCursor<paddr_t, backref::backref_map_val_t>;
+template struct BtreeCursor<laddr_t, lba::lba_map_val_t, lba::LBALeafNode>;
+template struct BtreeCursor<paddr_t, backref::backref_map_val_t, backref::BackrefLeafNode>;
} // namespace crimson::os::seastore
* a key-value mapping's location and the snapshot of its data at construction
* time.
*/
-template <typename key_t, typename val_t>
+template <typename key_t, typename val_t, typename ParentT>
struct BtreeCursor
: public boost::intrusive_ref_counter<
- BtreeCursor<key_t, val_t>, boost::thread_unsafe_counter> {
+ BtreeCursor<key_t, val_t, ParentT>, boost::thread_unsafe_counter> {
BtreeCursor(
op_context_t &ctx,
- CachedExtentRef parent,
+ TCachedExtentRef<ParentT> parent,
uint64_t modifications,
- key_t key,
- std::optional<val_t> val,
- btreenode_pos_t pos)
+ ParentT::iterator &&iter)
: ctx(ctx),
parent(std::move(parent)),
modifications(modifications),
- key(key),
- val(std::move(val)),
- pos(pos)
+ iter(std::move(iter)),
+ key(iter == this->parent->end()
+ ? min_max_t<key_t>::max
+ : iter.get_key())
{
if constexpr (std::is_same_v<key_t, laddr_t>) {
static_assert(std::is_same_v<val_t, lba::lba_map_val_t>,
}
op_context_t ctx;
- CachedExtentRef parent;
+ TCachedExtentRef<ParentT> parent;
uint64_t modifications;
- key_t key;
- std::optional<val_t> val;
- btreenode_pos_t pos;
+ ParentT::iterator iter;
+ key_t key = min_max_t<key_t>::null;
// NOTE: The overhead of calling is_viewable() might be not negligible in the
// case of the parent extent is stable and shared by multiple transactions.
bool is_viewable() const;
bool is_end() const {
- auto max_key = min_max_t<key_t>::max;
- assert((key != max_key) == (bool)val);
- return key == max_key;
+ assert(is_viewable());
+ return iter == parent->end();
}
extent_len_t get_length() const {
+ assert(is_viewable());
assert(!is_end());
- return val->len;
+ return iter.get_val().len;
}
-};
-struct LBACursor : BtreeCursor<laddr_t, lba::lba_map_val_t> {
- using Base = BtreeCursor<laddr_t, lba::lba_map_val_t>;
- using Base::BtreeCursor;
- bool is_indirect() const {
- return !is_end() && val->pladdr.is_laddr();
- }
- laddr_t get_laddr() const {
- return key;
+ uint16_t get_pos() const {
+ return iter.get_offset();
}
- paddr_t get_paddr() const {
- assert(!is_indirect());
- assert(!is_end());
- return val->pladdr.get_paddr();
- }
- laddr_t get_intermediate_key() const {
- assert(is_indirect());
- assert(!is_end());
- return val->pladdr.get_laddr();
- }
- checksum_t get_checksum() const {
- assert(!is_end());
- assert(!is_indirect());
- return val->checksum;
- }
- bool contains(laddr_t laddr) const {
- return get_laddr() <= laddr && get_laddr() + get_length() > laddr;
- }
- extent_ref_count_t get_refcount() const {
- assert(!is_end());
- assert(!is_indirect());
- return val->refcount;
- }
-
- base_iertr::future<> refresh();
-};
-using LBACursorRef = boost::intrusive_ptr<LBACursor>;
-struct BackrefCursor : BtreeCursor<paddr_t, backref::backref_map_val_t> {
- using Base = BtreeCursor<paddr_t, backref::backref_map_val_t>;
- using Base::BtreeCursor;
- paddr_t get_paddr() const {
- assert(key.is_absolute());
+ key_t get_key() const {
return key;
}
- laddr_t get_laddr() const {
- assert(!is_end());
- return val->laddr;
- }
- extent_types_t get_type() const {
- assert(!is_end());
- return val->type;
- }
};
-using BackrefCursorRef = boost::intrusive_ptr<BackrefCursor>;
-template <typename key_t, typename val_t>
+template <typename key_t, typename val_t, typename ParentT>
std::ostream &operator<<(
- std::ostream &out, const BtreeCursor<key_t, val_t> &cursor)
+ std::ostream &out, const BtreeCursor<key_t, val_t, ParentT> &cursor)
{
if constexpr (std::is_same_v<key_t, laddr_t>) {
out << "LBACursor(";
out << "BackrefCursor(";
}
out << (void*)cursor.parent.get()
- << "@" << cursor.pos
- << "#" << cursor.modifications
- << ",";
- if (cursor.is_end()) {
- return out << "END)";
+ << "@" << cursor.iter.get_offset()
+ << "#" << cursor.modifications;
+ if (cursor.is_viewable()) {
+ out << ",";
+ if (cursor.is_end()) {
+ return out << "END)";
+ }
+ return out << "," << cursor.iter.get_key()
+ << "~" << cursor.iter.get_val()
+ << ")";
}
- return out << "," << cursor.key
- << "~" << *cursor.val
- << ")";
+ return out;
}
} // namespace crimson::os::seastore
-
-#if FMT_VERSION >= 90000
-template <> struct fmt::formatter<crimson::os::seastore::LBACursor> : fmt::ostream_formatter {};
-template <> struct fmt::formatter<crimson::os::seastore::BackrefCursor> : fmt::ostream_formatter {};
-#endif
ctx,
leaf.node,
leaf.node->modifications,
- is_end() ? min_max_t<node_key_t>::max : get_key(),
- is_end() ? std::nullopt : std::make_optional(get_val()),
- leaf.pos);
+ typename leaf_node_t::iterator(leaf.node.get(), leaf.pos));
}
typename leaf_node_t::Ref get_leaf_node() {
return make_partial_iter(
c,
cursor.parent->template cast<leaf_node_t>(),
- cursor.key,
- cursor.pos);
+ cursor.get_key(),
+ cursor.get_pos());
}
boost::intrusive_ptr<cursor_t> get_cursor(
assert(it != leaf->end());
return new cursor_t(
c, leaf, leaf->modifications,
- key, it.get_val(), it.get_offset());
+ typename leaf_node_t::iterator(leaf.get(), it.get_offset()));
}
boost::intrusive_ptr<cursor_t> get_cursor(
#endif
ret.leaf.node = leaf;
ret.leaf.pos = pos;
- if (ret.is_end()) {
- ceph_assert(key == min_max_t<node_key_t>::max);
- } else {
+ if (!ret.is_end()) {
ceph_assert(key == ret.get_key());
}
return ret;
c.trans, laddr, length, ret.back());
return get_mappings_iertr::now();
}
- assert(cursor->val->refcount == EXTENT_DEFAULT_REF_COUNT);
- assert(cursor->val->checksum == 0);
+ assert(cursor->get_refcount() == EXTENT_DEFAULT_REF_COUNT);
+ assert(cursor->get_checksum() == 0);
return this->resolve_indirect_cursor(c, btree, *cursor
).si_then([FNAME, c, &ret, &cursor, laddr, length](auto direct) {
ret.emplace_back(LBAMapping::create_indirect(
} else {
assert(laddr == cursor->get_laddr());
}
- assert(cursor->val->refcount == EXTENT_DEFAULT_REF_COUNT);
- assert(cursor->val->checksum == 0);
+ assert(cursor->get_refcount() == EXTENT_DEFAULT_REF_COUNT);
+ assert(cursor->get_checksum() == 0);
return resolve_indirect_cursor(c, btree, *cursor
).si_then([FNAME, c, laddr, indirect=std::move(cursor)]
(auto direct) mutable {
).si_then([&mapping](auto res) {
assert(!res.mapping.is_indirect());
mapping.direct_cursor = std::move(res.mapping.direct_cursor);
- return std::move(mapping);
+ return mapping.refresh();
});
});
} else {
return cursor.refresh(
).si_then([&state, c, &btree]() mutable {
auto &cursor = state.pos.get_effective_cursor();
- assert(state.laddr + state.len <= cursor.key);
+ assert(state.laddr + state.len <= cursor.get_laddr());
auto inter_key = state.mapping.is_indirect()
? state.mapping.get_intermediate_key()
: state.mapping.get_key();
},
nullptr // all the extents should have already been
// added to the fixed_kv_btree
- ).si_then([c, &cursor, prev_addr, len, addr,
+ ).si_then([c, prev_addr, len, addr,
checksum, FNAME](auto res) {
- DEBUGT("cursor={}, paddr {}~0x{:x} => {}, crc=0x{:x} done -- {}",
- c.trans, *cursor, prev_addr, len,
+ DEBUGT("paddr {}~0x{:x} => {}, crc=0x{:x} done -- {}",
+ c.trans, prev_addr, len,
addr, checksum, res.get_cursor());
return update_mapping_iertr::make_ready_future();
},
{
auto addr = addr_or_cursor.index() == 0
? std::get<0>(addr_or_cursor)
- : std::get<1>(addr_or_cursor)->key;
+ : std::get<1>(addr_or_cursor)->get_laddr();
LOG_PREFIX(BtreeLBAManager::update_refcount);
TRACET("laddr={}, delta={}", t, addr, delta);
auto fut = _update_mapping_iertr::make_ready_future<
DEBUGT("laddr={}, delta={} done -- {}",
t, addr, delta,
res.is_alive_mapping()
- ? res.get_cursor().val
+ ? res.get_cursor().iter.get_val()
: res.get_removed_mapping().map_value);
return update_mapping_iertr::make_ready_future<
mapping_update_result_t>(get_mapping_update_result(res));
auto iter = btree.make_partial_iter(c, cursor);
auto ret = f(iter.get_val());
if (ret.refcount == 0) {
+ auto laddr = cursor.get_laddr();
return btree.remove(
c,
iter
- ).si_then([ret, c, laddr=cursor.key](auto iter) {
+ ).si_then([ret, c, laddr](auto iter) {
return update_mapping_ret_bare_t{
laddr, std::move(ret), iter.get_cursor(c)};
});
(nextent->has_parent_tracker()
&& nextent->peek_parent_node().get() == iter.get_leaf_node().get()));
LBACursorRef cursor = iter.get_cursor(c);
- assert(cursor->val);
+ assert(!cursor->is_end());
return update_mapping_ret_bare_t{std::move(cursor)};
});
}
assert(mapping.is_indirect() ||
(val.pladdr.is_paddr() &&
val.pladdr.get_paddr().is_absolute()));
+ auto old_key = mapping.get_key();
+ auto old_length = mapping.get_length();
+ auto old_indirect = mapping.is_indirect();
return update_refcount(c.trans, &cursor, -1
- ).si_then([&mapping, &btree, &iter, c, &ret,
- &remaps, pladdr=val.pladdr](auto r) {
+ ).si_then([old_key, old_length, old_indirect,
+ &btree, &iter, c, &ret, &remaps,
+ pladdr=val.pladdr](auto r) {
assert(r.refcount == 0);
auto &cursor = r.mapping.get_effective_cursor();
iter = btree.make_partial_iter(c, cursor);
return trans_intr::do_for_each(
remaps,
- [&mapping, &btree, &iter, c, &ret, pladdr](auto &remap) {
- assert(remap.offset + remap.len <= mapping.get_length());
- assert((bool)remap.extent == !mapping.is_indirect());
+ [old_key, old_length, old_indirect, &btree,
+ &iter, c, &ret, pladdr](auto &remap) {
+ assert(remap.offset + remap.len <= old_length);
+ assert((bool)remap.extent == !old_indirect);
lba_map_val_t val;
- auto old_key = mapping.get_key();
auto new_key = (old_key + remap.offset).checked_to_laddr();
val.len = remap.len;
if (pladdr.is_laddr()) {
// Checksum will be updated when the committing the transaction
val.checksum = CRC_NULL;
return btree.insert(c, iter, new_key, std::move(val)
- ).si_then([c, &remap, &mapping, &ret, &iter](auto p) {
+ ).si_then([c, &remap, old_indirect, &ret, &iter](auto p) {
auto &[it, inserted] = p;
ceph_assert(inserted);
auto &leaf_node = *it.get_leaf_node();
- if (mapping.is_indirect()) {
+ if (old_indirect) {
leaf_node.insert_child_ptr(
it.get_leaf_pos(),
get_reserved_ptr<LBALeafNode, laddr_t>(),
} else {
assert(result.is_alive_mapping());
auto &c = result.get_cursor();
- assert(c.val);
+ assert(!c.is_end());
ceph_assert(!c.is_indirect());
- return {c.get_laddr(), c.val->refcount,
- c.val->pladdr, c.val->len,
+ return {c.get_laddr(), c.get_refcount(),
+ c.get_pladdr(), c.get_length(),
LBAMapping::create_direct(result.take_cursor())};
}
}
return iter;
}
+base_iertr::future<> LBACursor::refresh()
+{
+ LOG_PREFIX(LBACursor::refresh);
+ return with_btree<lba::LBABtree>(
+ ctx.cache,
+ ctx,
+ [this, FNAME, c=ctx](auto &btree) {
+ c.trans.cursor_stats.num_refresh_parent_total++;
+
+ if (!parent->is_valid()) {
+ c.trans.cursor_stats.num_refresh_invalid_parent++;
+ SUBTRACET(
+ seastore_lba,
+ "cursor {} parent is invalid, re-search from scratch",
+ c.trans, *this);
+ return btree.lower_bound(c, this->get_laddr()
+ ).si_then([this](lba::LBABtree::iterator it) {
+ assert(this->get_laddr() == it.get_key());
+ iter = LBALeafNode::iterator(
+ it.get_leaf_node().get(),
+ it.get_leaf_pos());
+ auto leaf = it.get_leaf_node();
+ parent = leaf;
+ modifications = leaf->modifications;
+ });
+ }
+ assert(parent->is_stable() ||
+ parent->is_pending_in_trans(c.trans.get_trans_id()));
+ auto leaf = parent->cast<lba::LBALeafNode>();
+ if (leaf->is_pending_in_trans(c.trans.get_trans_id())) {
+ if (leaf->modified_since(modifications)) {
+ c.trans.cursor_stats.num_refresh_modified_viewable_parent++;
+ } else {
+ // no need to refresh
+ return base_iertr::now();
+ }
+ } else {
+ auto [viewable, l] = leaf->resolve_transaction(c.trans, get_laddr());
+ SUBTRACET(seastore_lba, "cursor: {} viewable: {}",
+ c.trans, *this, viewable);
+ if (!viewable) {
+ leaf = l;
+ c.trans.cursor_stats.num_refresh_unviewable_parent++;
+ parent = leaf;
+ } else {
+ assert(leaf.get() == l.get());
+ assert(leaf->is_stable());
+ return base_iertr::now();
+ }
+ }
+
+ modifications = leaf->modifications;
+ iter = leaf->lower_bound(get_laddr());
+ assert(is_viewable());
+
+ return base_iertr::now();
+ });
+}
+
}
using LBANode = FixedKVNode<laddr_t>;
class BtreeLBAMapping;
+class BtreeLBAManager;
constexpr size_t LBA_BLOCK_SIZE = 4096;
};
using LBALeafNodeRef = TCachedExtentRef<LBALeafNode>;
+struct LBACursor : BtreeCursor<laddr_t, lba::lba_map_val_t, LBALeafNode> {
+ using Base = BtreeCursor<laddr_t, lba::lba_map_val_t, LBALeafNode>;
+ using Base::BtreeCursor;
+ bool is_indirect() const {
+ assert(is_viewable());
+ return !is_end() && iter.get_val().pladdr.is_laddr();
+ }
+ laddr_t get_laddr() const {
+ return key;
+ }
+ paddr_t get_paddr() const {
+ assert(is_viewable());
+ assert(!is_indirect());
+ assert(!is_end());
+ auto ret = iter.get_val().pladdr.get_paddr();
+ return ret.maybe_relative_to(parent->get_paddr());
+ }
+ laddr_t get_intermediate_key() const {
+ assert(is_viewable());
+ assert(is_indirect());
+ assert(!is_end());
+ return iter.get_val().pladdr.get_laddr();
+ }
+ checksum_t get_checksum() const {
+ assert(is_viewable());
+ assert(!is_end());
+ return iter.get_val().checksum;
+ }
+ bool contains(laddr_t laddr) const {
+ assert(is_viewable());
+ return get_laddr() <= laddr && get_laddr() + get_length() > laddr;
+ }
+ extent_ref_count_t get_refcount() const {
+ assert(is_viewable());
+ assert(!is_end());
+ return iter.get_val().refcount;
+ }
+
+ base_iertr::future<> refresh();
+private:
+
+ pladdr_t get_pladdr() const {
+ return std::move(iter.get_val().pladdr);
+ }
+ friend class BtreeLBAManager;
+};
+using LBACursorRef = boost::intrusive_ptr<LBACursor>;
+
}
#if FMT_VERSION >= 90000
template <> struct fmt::formatter<crimson::os::seastore::lba::lba_map_val_t> : fmt::ostream_formatter {};
template <> struct fmt::formatter<crimson::os::seastore::lba::LBAInternalNode> : fmt::ostream_formatter {};
template <> struct fmt::formatter<crimson::os::seastore::lba::LBALeafNode> : fmt::ostream_formatter {};
+template <> struct fmt::formatter<crimson::os::seastore::lba::LBACursor> : fmt::ostream_formatter {};
#endif
out << std::dec
<< "->" << rhs.get_val();
} else {
- out << std::dec << "->" << rhs.indirect_cursor->val;
+ out << std::dec << "->" << rhs.indirect_cursor->iter.get_val();
}
if (rhs.is_complete_indirect()) {
out << ",indirect(" << rhs.get_intermediate_base()
== t.get_trans_id());
assert(!direct_cursor->is_end());
auto &i = *direct_cursor;
- assert(i.pos != BTREENODE_POS_NULL);
+ assert(i.get_pos() != BTREENODE_POS_NULL);
ceph_assert(t.get_trans_id() == i.ctx.trans.get_trans_id());
auto p = direct_cursor->parent->cast<LBALeafNode>();
return p->template get_child<LogicalChildNode>(
- t, i.ctx.cache, i.pos, i.key);
+ t, i.ctx.cache, i.get_pos(), i.get_laddr());
}
bool LBAMapping::is_stable() const {
auto leaf = direct_cursor->parent->cast<LBALeafNode>();
return leaf->is_child_stable(
direct_cursor->ctx,
- direct_cursor->pos,
- direct_cursor->key);
+ direct_cursor->get_pos(),
+ direct_cursor->get_laddr());
}
bool LBAMapping::is_data_stable() const {
auto leaf = direct_cursor->parent->cast<LBALeafNode>();
return leaf->is_child_data_stable(
direct_cursor->ctx,
- direct_cursor->pos,
- direct_cursor->key);
+ direct_cursor->get_pos(),
+ direct_cursor->get_laddr());
}
base_iertr::future<LBAMapping> LBAMapping::next()
{
LOG_PREFIX(LBAMapping::next);
auto ctx = get_effective_cursor().ctx;
- SUBDEBUGT(seastore_lba, "{}", ctx.trans, *this);
- return refresh().si_then([ctx](auto mapping) {
- return with_btree_state<lba::LBABtree, LBAMapping>(
- ctx.cache,
- ctx,
- std::move(mapping),
- [ctx](auto &btree, auto &mapping) mutable {
- auto &cursor = mapping.get_effective_cursor();
- auto iter = btree.make_partial_iter(ctx, cursor);
- return iter.next(ctx).si_then([ctx, &mapping](auto iter) {
- if (!iter.is_end() && iter.get_val().pladdr.is_laddr()) {
- mapping = LBAMapping::create_indirect(nullptr, iter.get_cursor(ctx));
- } else {
- mapping = LBAMapping::create_direct(iter.get_cursor(ctx));
- }
- });
+ auto mapping = co_await refresh();
+ SUBDEBUGT(seastore_lba, "{}", ctx.trans, mapping);
+ mapping = co_await with_btree_state<lba::LBABtree, LBAMapping>(
+ ctx.cache,
+ ctx,
+ std::move(mapping),
+ [ctx](auto &btree, auto &mapping) mutable {
+ auto &cursor = mapping.get_effective_cursor();
+ auto iter = btree.make_partial_iter(ctx, cursor);
+ return iter.next(ctx).si_then([ctx, &mapping](auto iter) {
+ if (!iter.is_end() && iter.get_val().pladdr.is_laddr()) {
+ mapping = LBAMapping::create_indirect(nullptr, iter.get_cursor(ctx));
+ } else {
+ mapping = LBAMapping::create_direct(iter.get_cursor(ctx));
+ }
});
});
+ co_return mapping;
}
base_iertr::future<LBAMapping> LBAMapping::refresh()
auto leaf = direct_cursor->parent->cast<LBALeafNode>();
return leaf->is_child_initial_pending(
direct_cursor->ctx,
- direct_cursor->pos,
- direct_cursor->key);
+ direct_cursor->get_pos(),
+ direct_cursor->get_laddr());
}
} // namespace crimson::os::seastore
}
class LBAMapping {
+ using LBACursorRef = lba::LBACursorRef;
+ using LBACursor = lba::LBACursor;
LBAMapping(LBACursorRef direct, LBACursorRef indirect)
: direct_cursor(std::move(direct)),
indirect_cursor(std::move(indirect))
assert(!indirect_cursor || indirect_cursor->is_indirect());
// if the mapping is indirect, it mustn't be at the end
if (is_indirect() && is_linked_direct()) {
- assert((bool)direct_cursor->val
- && direct_cursor->key != L_ADDR_NULL);
+ assert(!direct_cursor->is_end()
+ && direct_cursor->get_laddr() != L_ADDR_NULL);
}
}
}
bool is_end() const {
- bool end = !is_indirect() && !direct_cursor->val;
// if the mapping is at the end, it can't be indirect and
// the physical cursor must be L_ADDR_NULL
- assert(end
- ? (!indirect_cursor && direct_cursor->key == L_ADDR_NULL)
- : true);
- return end;
+ return !is_indirect() && direct_cursor->is_end();
}
bool is_indirect() const {
laddr_t get_key() const {
assert(!is_null());
if (is_indirect()) {
- assert(!indirect_cursor->is_end());
return indirect_cursor->get_laddr();
}
- assert(!direct_cursor->is_end());
return direct_cursor->get_laddr();
}
ObjectDataHandler::clone_ret do_clonerange(
context_t ctx,
LBAMapping write_pos,
- const overwrite_range_t &overwrite_range,
+ overwrite_range_t &overwrite_range,
data_t &data)
{
LOG_PREFIX(ObjectDataHandler::do_clonerange);
+ co_await overwrite_range.clonerange_info->refresh();
DEBUGT("{} {} write_pos={}", ctx.t, overwrite_range, data, write_pos);
ceph_assert(overwrite_range.clonerange_info.has_value());
assert(write_pos.is_end() ||
);
}
// clone the src mappings
+ co_await overwrite_range.clonerange_info->refresh();
auto src = overwrite_range.clonerange_info->first_src_mapping;
auto offset = overwrite_range.clonerange_info->offset;
auto len = overwrite_range.clonerange_info->len;
laddr_t dest_base = L_ADDR_NULL;
extent_len_t offset = 0;
extent_len_t len = 0;
+ base_iertr::future<> refresh() {
+ first_src_mapping = co_await first_src_mapping.refresh();
+ }
};
std::ostream& operator<<(std::ostream &out, const clone_range_t &);
bool updateref)
{
LOG_PREFIX(TransactionManager::clone_range);
+ co_await pos.co_refresh();
+ mapping = co_await mapping.refresh();
SUBDEBUGT(seastore_tm,
"src_base={}, dst_base={}, {}~{}, mapping={}, pos={}, updateref={}",
t, src_base, dst_base, offset, len, mapping, pos, updateref);
- co_await pos.co_refresh();
- mapping = co_await mapping.refresh();
auto left = len;
bool shared_direct = false;
auto cloned_to = offset;
remove_mappings_param_t params)
{
LOG_PREFIX(TransactionManager::remove_mappings_in_range);
- SUBDEBUGT(seastore_tm, "{}~{}, first_mapping: {}",
- t, start, unaligned_len, first_mapping);
auto mapping = co_await first_mapping.refresh();
+ SUBDEBUGT(seastore_tm, "{}~{}, first_mapping: {}",
+ t, start, unaligned_len, mapping);
while (!mapping.is_end()) {
assert(mapping.get_key() >= start);
auto mapping_end = (mapping.get_key() + mapping.get_length()
}).unsafe_get();
}
- LBAMapping refresh_lba_mapping(test_transaction_t &t, LBAMapping mapping) {
- return with_trans_intr(*t.t, [mapping=std::move(mapping)](auto &t) mutable {
- return mapping.refresh();
- }).unsafe_get();
+ std::optional<LBAMapping> refresh_lba_mapping(
+ test_transaction_t &t, LBAMapping mapping)
+ {
+ std::optional<LBAMapping> pin = with_trans_intr(
+ *t.t,
+ [mapping=std::move(mapping)](auto &t) mutable {
+ return mapping.refresh().si_then([](auto m) {
+ return std::make_optional<LBAMapping>(std::move(m));
+ });
+ }
+ ).handle_error(crimson::ct_error::eagain::handle([] {
+ return base_iertr::make_ready_future<
+ std::optional<LBAMapping>>();
+ }), crimson::ct_error::pass_further_all{}).unsafe_get();
+ if (t.t->is_conflicted()) {
+ return std::nullopt;
+ }
+ return pin;
}
bool try_submit_transaction(test_transaction_t t) {
{
auto t = create_transaction();
auto lpin = get_pin(t, l_offset);
- auto rpin = get_pin(t, r_offset);
//split left
auto pin1 = remap_pin(t, std::move(lpin), 0, 16 << 10);
ASSERT_TRUE(pin1);
ASSERT_TRUE(mlext->is_exist_mutation_pending());
ASSERT_TRUE(mlext.get() == lext.get());
+ auto rpin = get_pin(t, r_offset);
//split right
auto pin4 = remap_pin(t, std::move(rpin), 16 << 10, 16 << 10);
ASSERT_TRUE(pin4);
auto l_clone_pin = clone_pin(
t, std::move(l_clone_pos), std::move(lpin), l_clone_offset);
//split left
- l_clone_pin = refresh_lba_mapping(t, std::move(l_clone_pin));
+ l_clone_pin = *refresh_lba_mapping(t, std::move(l_clone_pin));
auto pin1 = remap_pin(t, std::move(l_clone_pin), 0, 16 << 10);
ASSERT_TRUE(pin1);
auto pin2 = remap_pin(t, std::move(*pin1), 0, 8 << 10);
auto r_clone_pin = clone_pin(
t, std::move(r_clone_pos), std::move(rpin), r_clone_offset);
//split right
- r_clone_pin = refresh_lba_mapping(t, std::move(r_clone_pin));
+ r_clone_pin = *refresh_lba_mapping(t, std::move(r_clone_pin));
auto pin4 = remap_pin(t, std::move(r_clone_pin), 16 << 10, 16 << 10);
ASSERT_TRUE(pin4);
auto pin5 = remap_pin(t, std::move(*pin4), 8 << 10, 8 << 10);
mbl3.append(ceph::bufferptr(ceph::buffer::create(12 << 10, 0)));
auto [mlp1, mext1, mrp1] = overwrite_pin(
t, std::move(mpin), 8 << 10 , 8 << 10, mbl1);
+ auto mlp1_key = mlp1->get_key();
+ auto mlp1_length = mlp1->get_length();
auto [mlp2, mext2, mrp2] = overwrite_pin(
t, std::move(*mrp1), 4 << 10 , 16 << 10, mbl2);
+ auto mlp2_key = mlp2->get_key();
+ auto mlp2_length = mlp2->get_length();
auto [mlpin3, me3, mrpin3] = overwrite_pin(
t, std::move(*mrp2), 4 << 10 , 12 << 10, mbl3);
- auto mlext1 = get_extent(t, mlp1->get_key(), mlp1->get_length());
- auto mlext2 = get_extent(t, mlp2->get_key(), mlp2->get_length());
+ auto mlext1 = get_extent(t, mlp1_key, mlp1_length);
+ auto mlext2 = get_extent(t, mlp2_key, mlp2_length);
auto mlext3 = get_extent(t, mlpin3->get_key(), mlpin3->get_length());
auto mrext3 = get_extent(t, mrpin3->get_key(), mrpin3->get_length());
EXPECT_EQ('a', mlext1->get_bptr().c_str()[0]);
bufferlist lbl1, rbl1;
lbl1.append(ceph::bufferptr(ceph::buffer::create(32 << 10, 0)));
+ lpin = *refresh_lba_mapping(t, lpin);
auto [llp1, lext1, lrp1] = overwrite_pin(
t, std::move(lpin), 0 , 32 << 10, lbl1);
EXPECT_FALSE(llp1);
EXPECT_TRUE(lext1);
rbl1.append(ceph::bufferptr(ceph::buffer::create(32 << 10, 0)));
+ rpin = *refresh_lba_mapping(t, rpin);
auto [rlp1, rext1, rrp1] = overwrite_pin(
t, std::move(rpin), 32 << 10 , 32 << 10, rbl1);
EXPECT_TRUE(rlp1);
auto last_rpin = *pin0;
ASSERT_TRUE(!split_points.empty());
while(!split_points.empty()) {
+ pin0 = refresh_lba_mapping(t, *pin0);
+ if (!pin0) {
+ conflicted++;
+ return;
+ }
// new overwrite area: start_off ~ end_off
auto start_off = split_points.front() + 4 /*RootMetaBlock*/;
split_points.pop_front();
assert(pin.is_viewable());
std::ignore = alloc_extent(t, get_laddr_hint((LEAF_NODE_CAPACITY + 1) * 4096), 4096, 'a');
assert(!pin.is_viewable());
- pin = refresh_lba_mapping(t, pin);
+ pin = *refresh_lba_mapping(t, pin);
auto extent2 = with_trans_intr(*(t.t), [&pin](auto& trans) {
auto v = pin.get_logical_extent(trans);
assert(v.has_child());
projects / ceph-ci.git / commitdiff