Lines Matching refs:iter
29 static void sort_key_next(struct btree_iter *iter, in sort_key_next() argument
35 *i = iter->data[--iter->used]; in sort_key_next()
227 struct btree_iter *iter, in bch_btree_ptr_insert_fixup() argument
264 static struct bkey *bch_extent_sort_fixup(struct btree_iter *iter, in bch_extent_sort_fixup() argument
267 while (iter->used > 1) { in bch_extent_sort_fixup()
268 struct btree_iter_set *top = iter->data, *i = top + 1; in bch_extent_sort_fixup()
270 if (iter->used > 2 && in bch_extent_sort_fixup()
278 sort_key_next(iter, i); in bch_extent_sort_fixup()
279 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
285 sort_key_next(iter, i); in bch_extent_sort_fixup()
289 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
299 heap_sift(iter, 0, bch_extent_sort_cmp); in bch_extent_sort_fixup()
323 struct btree_iter *iter, in bch_extent_insert_fixup() argument
335 struct bkey *k = bch_btree_iter_next(iter); in bch_extent_insert_fixup()