65  * searches and that code topped out at under 50k lookups/second.
106  * differ higher than bit 50, we don't need to check anything higher than bit
107  * 50.
199 				       const struct bkey *k);
201 				   const struct bkey *k);
206 				       const struct bkey *k);
208 				    const struct bkey *k);
211 	 * Only used for deciding whether to use START_KEY(k) or just the key
244 static inline bool bkey_written(struct btree_keys *b, struct bkey *k)  in bkey_written()  argument
246 	return !b->last_set_unwritten || k < b->set[b->nsets].data->start;  in bkey_written()
261 #define __set_bytes(i, k)	(sizeof(*(i)) + (k) * sizeof(uint64_t))  argument
264 #define __set_blocks(i, k, block_bytes)				\  argument
265 	DIV_ROUND_UP(__set_bytes(i, k), block_bytes)
300 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k);
304 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k,
323 		struct bkey *k, *end;  member
327 typedef bool (*ptr_filter_fn)(struct btree_keys *b, const struct bkey *k);
334 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,
353 #define for_each_key_filter(b, k, iter, filter)				\  argument
355 	     ((k) = bch_btree_iter_next_filter((iter), (b), filter));)
357 #define for_each_key(b, k, iter)					\  argument
359 	     ((k) = bch_btree_iter_next(iter));)
408 static inline void bkey_init(struct bkey *k)  in bkey_init()  argument
410 	*k = ZERO_KEY;  in bkey_init()
423 bool __bch_cut_front(const struct bkey *where, struct bkey *k);
424 bool __bch_cut_back(const struct bkey *where, struct bkey *k);
426 static inline bool bch_cut_front(const struct bkey *where, struct bkey *k)  in bch_cut_front()  argument
428 	BUG_ON(bkey_cmp(where, k) > 0);  in bch_cut_front()
429 	return __bch_cut_front(where, k);  in bch_cut_front()
432 static inline bool bch_cut_back(const struct bkey *where, struct bkey *k)  in bch_cut_back()  argument
434 	BUG_ON(bkey_cmp(where, &START_KEY(k)) < 0);  in bch_cut_back()
435 	return __bch_cut_back(where, k);  in bch_cut_back()
440  * key of k. If the preceding key does not exist, set '*preceding_key_p' to
447 static inline void preceding_key(struct bkey *k, struct bkey **preceding_key_p)  in preceding_key()  argument
449 	if (KEY_INODE(k) || KEY_OFFSET(k)) {  in preceding_key()
450 		(**preceding_key_p) = KEY(KEY_INODE(k), KEY_OFFSET(k), 0);  in preceding_key()
459 static inline bool bch_ptr_invalid(struct btree_keys *b, const struct bkey *k)  in bch_ptr_invalid()  argument
461 	return b->ops->key_invalid(b, k);  in bch_ptr_invalid()
464 static inline bool bch_ptr_bad(struct btree_keys *b, const struct bkey *k)  in bch_ptr_bad()  argument
466 	return b->ops->key_bad(b, k);  in bch_ptr_bad()
470 				    size_t size, const struct bkey *k)  in bch_bkey_to_text()  argument
472 	return b->ops->key_to_text(buf, size, k);  in bch_bkey_to_text()
505 static inline void bch_keylist_init_single(struct keylist *l, struct bkey *k)  in bch_keylist_init_single()  argument
507 	l->keys = k;  in bch_keylist_init_single()
508 	l->top = bkey_next(k);  in bch_keylist_init_single()
516 static inline void bch_keylist_add(struct keylist *l, struct bkey *k)  in bch_keylist_add()  argument
518 	bkey_copy(l->top, k);  in bch_keylist_add()