Lines Matching refs:search
1052 struct bpos *search) in bset_search_write_set() argument
1059 if (bpos_lt(rw_aux_tree(b, t)[m].k, *search)) in bset_search_write_set()
1102 const struct bpos *search, in bset_search_tree() argument
1129 cmp = bkey_cmp_p_or_unp(b, k, packed_search, search); in bset_search_tree()
1156 struct bpos *search, in __bch2_bset_search() argument
1179 return bset_search_write_set(b, t, search); in __bch2_bset_search()
1181 return bset_search_tree(b, t, search, lossy_packed_search); in __bch2_bset_search()
1190 struct bpos *search, in bch2_bset_search_linear() argument
1198 lossy_packed_search, search) < 0) in bch2_bset_search_linear()
1203 bkey_iter_pos_cmp(b, m, search) < 0) in bch2_bset_search_linear()
1211 packed_search, search) >= 0); in bch2_bset_search_linear()
1249 struct btree *b, struct bpos *search) in btree_node_iter_init_pack_failed() argument
1253 trace_bkey_pack_pos_fail(search); in btree_node_iter_init_pack_failed()
1258 bkey_iter_pos_cmp(b, k, search) < 0) in btree_node_iter_init_pack_failed()
1308 struct btree *b, struct bpos *search) in bch2_btree_node_iter_init() argument
1315 EBUG_ON(bpos_lt(*search, b->data->min_key)); in bch2_btree_node_iter_init()
1316 EBUG_ON(bpos_gt(*search, b->data->max_key)); in bch2_btree_node_iter_init()
1321 switch (bch2_bkey_pack_pos_lossy(&p, *search, b)) { in bch2_btree_node_iter_init()
1329 btree_node_iter_init_pack_failed(iter, b, search); in bch2_btree_node_iter_init()
1334 k[i] = __bch2_bset_search(b, b->set + i, search, &p); in bch2_btree_node_iter_init()
1342 k[i] = bch2_bset_search_linear(b, t, search, in bch2_btree_node_iter_init()