Lines Matching refs:top
269 struct btree_iter_set *top = iter->data, *i = top + 1; in bch_extent_sort_fixup() local
275 if (bkey_cmp(top->k, &START_KEY(i->k)) <= 0) in bch_extent_sort_fixup()
280 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
284 if (top->k > i->k) { in bch_extent_sort_fixup()
285 if (bkey_cmp(top->k, i->k) >= 0) in bch_extent_sort_fixup()
288 bch_cut_front(top->k, i->k); in bch_extent_sort_fixup()
290 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
293 BUG_ON(!bkey_cmp(&START_KEY(top->k), &START_KEY(i->k))); in bch_extent_sort_fixup()
295 if (bkey_cmp(i->k, top->k) < 0) { in bch_extent_sort_fixup()
296 bkey_copy(tmp, top->k); in bch_extent_sort_fixup()
299 bch_cut_front(i->k, top->k); in bch_extent_sort_fixup()
304 bch_cut_back(&START_KEY(i->k), top->k); in bch_extent_sort_fixup()
403 struct bkey *top; in bch_extent_insert_fixup() local
421 top = bch_bset_search(b, bset_tree_last(b), in bch_extent_insert_fixup()
423 bch_bset_insert(b, top, k); in bch_extent_insert_fixup()
428 top = bkey_next(k); in bch_extent_insert_fixup()
431 bch_cut_front(insert, top); in bch_extent_insert_fixup()