936 						     const struct bkey *search)  in bset_search_write_set()  argument
943 		if (bkey_cmp(table_to_bkey(t, m), search) > 0)  in bset_search_write_set()
956 						const struct bkey *search)  in bset_search_tree()  argument
997 				       bfloat_mantissa(search, f))) >> 31);  in bset_search_tree()
999 			n = (bkey_cmp(tree_to_bkey(t, j), search) > 0)  in bset_search_tree()
1032 			       const struct bkey *search)  in __bch_bset_search()  argument
1062 		if (unlikely(bkey_cmp(search, &t->end) >= 0))  in __bch_bset_search()
1065 		if (unlikely(bkey_cmp(search, t->data->start) < 0))  in __bch_bset_search()
1068 		i = bset_search_tree(t, search);  in __bch_bset_search()
1073 		i = bset_search_write_set(t, search);  in __bch_bset_search()
1081 				search) > 0);  in __bch_bset_search()
1084 		       bkey_cmp(i.r, search) <= 0);  in __bch_bset_search()
1088 	       bkey_cmp(i.l, search) <= 0)  in __bch_bset_search()
1122 					  struct bkey *search,  in __bch_btree_iter_init()  argument
1135 		ret = bch_bset_search(b, start, search);  in __bch_btree_iter_init()
1144 				 struct bkey *search)  in bch_btree_iter_init()  argument
1146 	return __bch_btree_iter_init(b, iter, search, b->set);  in bch_btree_iter_init()