if (node->is_pending()) {
auto &n = node->get_stable_for_key(i->get_key());
assert(cnode->peek_parent_node().get() == &n);
- auto pos = n.lower_bound(i->get_key()).get_offset();
+ [[maybe_unused]] auto pos = n.lower_bound(i->get_key()).get_offset();
assert(pos < n.get_size());
assert(n.children[pos] == cnode.get());
} else {
}
} else if (child_node->is_pending()) {
if (child_node->is_mutation_pending()) {
- auto &prior = (child_node_t &)*child_node->get_prior_instance();
+ [[maybe_unused]] auto &prior =
+ (child_node_t &)*child_node->get_prior_instance();
assert(prior.is_valid());
assert(prior.is_parent_valid());
if (node->is_pending()) {
auto &n = node->get_stable_for_key(i->get_key());
assert(prior.peek_parent_node().get() == &n);
- auto pos = n.lower_bound(i->get_key()).get_offset();
+ [[maybe_unused]] auto pos = n.lower_bound(i->get_key()).get_offset();
assert(pos < n.get_size());
assert(n.children[pos] == &prior);
} else {
} else {
auto cnode = child_node->template cast<child_node_t>();
auto pos = node->find(i->get_key()).get_offset();
- auto child = node->children[pos];
+ [[maybe_unused]] auto child = node->children[pos];
assert(child);
assert(child == cnode.get());
assert(cnode->is_parent_valid());
}
}
} else {
- auto c = static_cast<child_node_t*>(child);
+ [[maybe_unused]] auto c = static_cast<child_node_t*>(child);
assert(c->has_parent_tracker());
assert(c->peek_parent_node().get() == node.get()
|| (node->is_pending() && c->is_stable()
*parent_entry.node,
parent_entry.pos,
*child);
- auto &cnode = (typename internal_node_t::base_t &)*child;
+ [[maybe_unused]] auto &cnode = (typename internal_node_t::base_t &)*child;
assert(cnode.get_node_meta().begin == node_iter.get_key());
assert(cnode.get_node_meta().end > node_iter.get_key());
return on_found(child->template cast<internal_node_t>());
*parent_pos.node,
donor_iter.get_offset(),
*child);
- auto &node = (typename internal_node_t::base_t&)*child;
+ [[maybe_unused]] auto &node = (typename internal_node_t::base_t&)*child;
assert(donor_is_left ?
node.get_node_meta().end == pos.node->get_node_meta().begin :
node.get_node_meta().begin == pos.node->get_node_meta().end);
).si_then([&indirect_cursor](auto cursors) {
ceph_assert(cursors.size() == 1);
auto& direct_cursor = cursors.front();
- auto intermediate_key = indirect_cursor.get_intermediate_key();
+ [[maybe_unused]] auto intermediate_key = indirect_cursor.get_intermediate_key();
assert(!direct_cursor->is_indirect());
assert(direct_cursor->get_laddr() <= intermediate_key);
assert(direct_cursor->get_laddr() + direct_cursor->get_length()
void do_on_replace_prior() final {
this->parent_node_t::on_replace_prior();
if (!this->is_btree_root()) {
- auto &prior = *get_prior_instance()->template cast<OMapInnerNode>();
+ [[maybe_unused]] auto &prior =
+ *get_prior_instance()->template cast<OMapInnerNode>();
assert(prior.base_child_t::has_parent_tracker());
this->child_node_t::on_replace_prior();
}
void do_on_replace_prior() final {
ceph_assert(!this->is_rewrite());
if (!this->is_btree_root()) {
- auto &prior = *get_prior_instance()->template cast<OMapLeafNode>();
+ [[maybe_unused]] auto &prior =
+ *get_prior_instance()->template cast<OMapLeafNode>();
assert(prior.base_child_t::has_parent_tracker());
this->child_node_t::on_replace_prior();
}