940 						     const struct bkey *search)  in bset_search_write_set()  argument
947 		if (bkey_cmp(table_to_bkey(t, m), search) > 0)  in bset_search_write_set()
960 						const struct bkey *search)  in bset_search_tree()  argument
976 			if (f->mantissa >= bfloat_mantissa(search, f))  in bset_search_tree()
981 			if (bkey_cmp(tree_to_bkey(t, j), search) > 0)  in bset_search_tree()
1016 			       const struct bkey *search)  in __bch_bset_search()  argument
1046 		if (unlikely(bkey_cmp(search, &t->end) >= 0))  in __bch_bset_search()
1049 		if (unlikely(bkey_cmp(search, t->data->start) < 0))  in __bch_bset_search()
1052 		i = bset_search_tree(t, search);  in __bch_bset_search()
1057 		i = bset_search_write_set(t, search);  in __bch_bset_search()
1065 				search) > 0);  in __bch_bset_search()
1068 		       bkey_cmp(i.r, search) <= 0);  in __bch_bset_search()
1072 	       bkey_cmp(i.l, search) <= 0)  in __bch_bset_search()
1105 						struct bkey *search,  in __bch_btree_iter_stack_init()  argument
1118 		ret = bch_bset_search(b, start, search);  in __bch_btree_iter_stack_init()
1127 				 struct bkey *search)  in bch_btree_iter_stack_init()  argument
1129 	return __bch_btree_iter_stack_init(b, iter, search, b->set);  in bch_btree_iter_stack_init()