Lines Matching refs:bkey_cmp
35 bkey_cmp(k, b->ops->is_extents ? in bch_dump_bset()
74 if (p && bkey_cmp(&START_KEY(p), &START_KEY(k)) > 0) in __bch_check_keys()
81 if (p && bkey_cmp(p, &START_KEY(k)) > 0) in __bch_check_keys()
88 if (p && !bkey_cmp(p, k)) in __bch_check_keys()
95 if (p && bkey_cmp(p, &b->key) > 0) in __bch_check_keys()
114 bkey_cmp(k, iter->b->ops->is_extents ? in bch_btree_iter_next_check()
197 if (bkey_cmp(where, &START_KEY(k)) <= 0) in __bch_cut_front()
200 if (bkey_cmp(where, k) < 0) in __bch_cut_front()
217 if (bkey_cmp(where, k) >= 0) in __bch_cut_back()
222 if (bkey_cmp(where, &START_KEY(k)) > 0) in __bch_cut_back()
792 bkey_cmp(l, &START_KEY(r))) in bch_bkey_try_merge()
839 bkey_cmp(k, b->ops->is_extents ? &START_KEY(m) : m) > 0) in bch_btree_insert_key()
879 if (bkey_cmp(table_to_bkey(t, m), search) > 0) in bset_search_write_set()
920 n = (bkey_cmp(tree_to_bkey(t, j), search) > 0) in bset_search_tree()
983 if (unlikely(bkey_cmp(search, &t->end) >= 0)) in __bch_bset_search()
986 if (unlikely(bkey_cmp(search, t->data->start) < 0)) in __bch_bset_search()
1000 bkey_cmp(tree_to_prev_bkey(t, in __bch_bset_search()
1005 bkey_cmp(i.r, search) <= 0); in __bch_bset_search()
1009 bkey_cmp(i.l, search) <= 0) in __bch_bset_search()
1024 return bkey_cmp(l.k, r.k) > 0; in btree_iter_cmp()