Lines Matching refs:top
268 struct btree_iter_set *top = iter->data, *i = top + 1; in bch_extent_sort_fixup() local
274 if (bkey_cmp(top->k, &START_KEY(i->k)) <= 0) in bch_extent_sort_fixup()
279 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
283 if (top->k > i->k) { in bch_extent_sort_fixup()
284 if (bkey_cmp(top->k, i->k) >= 0) in bch_extent_sort_fixup()
287 bch_cut_front(top->k, i->k); in bch_extent_sort_fixup()
289 heap_sift(iter, i - top, bch_extent_sort_cmp); in bch_extent_sort_fixup()
292 BUG_ON(!bkey_cmp(&START_KEY(top->k), &START_KEY(i->k))); in bch_extent_sort_fixup()
294 if (bkey_cmp(i->k, top->k) < 0) { in bch_extent_sort_fixup()
295 bkey_copy(tmp, top->k); in bch_extent_sort_fixup()
298 bch_cut_front(i->k, top->k); in bch_extent_sort_fixup()
303 bch_cut_back(&START_KEY(i->k), top->k); in bch_extent_sort_fixup()
402 struct bkey *top; in bch_extent_insert_fixup() local
420 top = bch_bset_search(b, bset_tree_last(b), in bch_extent_insert_fixup()
422 bch_bset_insert(b, top, k); in bch_extent_insert_fixup()
427 top = bkey_next(k); in bch_extent_insert_fixup()
430 bch_cut_front(insert, top); in bch_extent_insert_fixup()