bcachefs: Optimize __bch2_btree_node_iter_advance()

This replaces an expensive memmove() call with an open-coded version.

Signed-off-by: Kent Overstreet <kent.overstreet@linux.dev>
This commit is contained in:
Kent Overstreet
2022-10-21 17:37:42 -04:00
parent c81f5836a4
commit 005def8ff1

View File

@@ -1429,7 +1429,10 @@ static inline void __bch2_btree_node_iter_advance(struct btree_node_iter *iter,
EBUG_ON(iter->data->k > iter->data->end);
if (unlikely(__btree_node_iter_set_end(iter, 0))) {
bch2_btree_node_iter_set_drop(iter, iter->data);
/* avoid an expensive memmove call: */
iter->data[0] = iter->data[1];
iter->data[1] = iter->data[2];
iter->data[2] = (struct btree_node_iter_set) { 0, 0 };
return;
}