Lines Matching defs:iter
30 static void sort_key_next(struct btree_iter *iter,
36 *i = iter->data[--iter->used];
229 struct btree_iter *iter,
266 static struct bkey *bch_extent_sort_fixup(struct btree_iter *iter,
269 while (iter->used > 1) {
270 struct btree_iter_set *top = iter->data, *i = top + 1;
272 if (iter->used > 2 &&
280 sort_key_next(iter, i);
281 heap_sift(iter, i - top, bch_extent_sort_cmp);
287 sort_key_next(iter, i);
291 heap_sift(iter, i - top, bch_extent_sort_cmp);
301 heap_sift(iter, 0, bch_extent_sort_cmp);
325 struct btree_iter *iter,
337 struct bkey *k = bch_btree_iter_next(iter);