Lines Matching refs:top
268 struct btree_iter_set *top = iter->data, *i = top + 1;
274 if (bkey_cmp(top->k, &START_KEY(i->k)) <= 0)
279 heap_sift(iter, i - top, bch_extent_sort_cmp);
283 if (top->k > i->k) {
284 if (bkey_cmp(top->k, i->k) >= 0)
287 bch_cut_front(top->k, i->k);
289 heap_sift(iter, i - top, bch_extent_sort_cmp);
292 BUG_ON(!bkey_cmp(&START_KEY(top->k), &START_KEY(i->k)));
294 if (bkey_cmp(i->k, top->k) < 0) {
295 bkey_copy(tmp, top->k);
298 bch_cut_front(i->k, top->k);
303 bch_cut_back(&START_KEY(i->k), top->k);
402 struct bkey *top;
409 * We insert a new key to cover the top of the
414 * is the top or the bottom, but it has to match
417 * depends on us inserting a new key for the top
420 top = bch_bset_search(b, bset_tree_last(b),
422 bch_bset_insert(b, top, k);
427 top = bkey_next(k);
430 bch_cut_front(insert, top);