Searched refs:btree_iter_set (Results 1 – 4 of 4) sorted by relevance
31 struct btree_iter_set *i) in sort_key_next()41 struct btree_iter_set *_l = (struct btree_iter_set *)l; in new_bch_key_sort_cmp()42 struct btree_iter_set *_r = (struct btree_iter_set *)r; in new_bch_key_sort_cmp()262 struct btree_iter_set *_l = (struct btree_iter_set *)l; in new_bch_extent_sort_cmp()263 struct btree_iter_set *_r = (struct btree_iter_set *)r; in new_bch_extent_sort_cmp()277 struct btree_iter_set *top = iter->heap.data, *i = top + 1; in bch_extent_sort_fixup()
152 struct btree_iter_set;316 struct btree_iter_set { struct326 MIN_HEAP_PREALLOCATED(struct btree_iter_set, btree_iter_heap, MAX_BSETS) heap; argument
1090 const struct btree_iter_set *_l = l; in new_btree_iter_cmp()1091 const struct btree_iter_set *_r = r; in new_btree_iter_cmp()1111 &((struct btree_iter_set) { k, end }), in bch_btree_iter_push()1148 struct btree_iter_set b __maybe_unused; in __bch_btree_iter_next()
1911 sizeof(struct btree_iter_set); in bch_cache_set_alloc()