Lines Matching defs:iter
57 struct btree_iter iter;
61 for_each_key(b, k, &iter)
70 struct btree_iter iter;
73 for_each_key(b, k, &iter) {
111 static void bch_btree_iter_next_check(struct btree_iter *iter)
113 struct bkey *k = iter->data->k, *next = bkey_next(k);
115 if (next < iter->data->end &&
116 bkey_cmp(k, iter->b->ops->is_extents ?
118 bch_dump_bucket(iter->b);
125 static inline void bch_btree_iter_next_check(struct btree_iter *iter) {}
880 struct btree_iter iter;
896 m = bch_btree_iter_init(b, &iter, preceding_key_p);
898 if (b->ops->insert_fixup(b, k, &iter, replace_key))
1085 static inline bool btree_iter_end(struct btree_iter *iter)
1087 return !iter->used;
1090 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,
1094 BUG_ON(!heap_add(iter,
1100 struct btree_iter *iter,
1106 iter->size = ARRAY_SIZE(iter->data);
1107 iter->used = 0;
1110 iter->b = b;
1115 bch_btree_iter_push(iter, ret, bset_bkey_last(start->data));
1122 struct btree_iter *iter,
1125 return __bch_btree_iter_init(b, iter, search, b->set);
1128 static inline struct bkey *__bch_btree_iter_next(struct btree_iter *iter,
1134 if (!btree_iter_end(iter)) {
1135 bch_btree_iter_next_check(iter);
1137 ret = iter->data->k;
1138 iter->data->k = bkey_next(iter->data->k);
1140 if (iter->data->k > iter->data->end) {
1142 iter->data->k = iter->data->end;
1145 if (iter->data->k == iter->data->end)
1146 heap_pop(iter, b, cmp);
1148 heap_sift(iter, 0, cmp);
1154 struct bkey *bch_btree_iter_next(struct btree_iter *iter)
1156 return __bch_btree_iter_next(iter, btree_iter_cmp);
1160 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,
1166 ret = bch_btree_iter_next(iter);
1191 struct btree_iter *iter,
1202 for (i = iter->used / 2 - 1; i >= 0; --i)
1203 heap_sift(iter, i, b->ops->sort_cmp);
1205 while (!btree_iter_end(iter)) {
1207 k = b->ops->sort_fixup(iter, &tmp.k);
1212 k = __bch_btree_iter_next(iter, b->ops->sort_cmp);
1231 static void __btree_sort(struct btree_keys *b, struct btree_iter *iter,
1252 btree_mergesort(b, out, iter, fixup, false);
1292 struct btree_iter iter;
1295 __bch_btree_iter_init(b, &iter, NULL, &b->set[start]);
1306 __btree_sort(b, &iter, start, order, false, state);
1312 struct btree_iter *iter,
1315 __btree_sort(b, iter, 0, b->page_order, true, state);
1322 struct btree_iter iter;
1324 bch_btree_iter_init(b, &iter, NULL);
1326 btree_mergesort(b, new->set->data, &iter, false, true);