171 	struct bkey		end;
191 	struct bkey	*(*sort_fixup)(struct btree_iter *, struct bkey *);
192 	bool		(*insert_fixup)(struct btree_keys *, struct bkey *,
193 					struct btree_iter *, struct bkey *);
195 				       const struct bkey *);
196 	bool		(*key_bad)(struct btree_keys *, const struct bkey *);
198 				     struct bkey *, struct bkey *);
199 	void		(*key_to_text)(char *, size_t, const struct bkey *);
200 	void		(*key_dump)(struct btree_keys *, const struct bkey *);
236 static inline bool bkey_written(struct btree_keys *b, struct bkey *k)  in bkey_written()
289 void bch_bset_fix_invalidated_key(struct btree_keys *, struct bkey *);
290 bool bch_bkey_try_merge(struct btree_keys *, struct bkey *, struct bkey *);
291 void bch_bset_insert(struct btree_keys *, struct bkey *, struct bkey *);
292 unsigned bch_btree_insert_key(struct btree_keys *, struct bkey *,
293 			      struct bkey *);
311 		struct bkey *k, *end;
315 typedef bool (*ptr_filter_fn)(struct btree_keys *, const struct bkey *);
317 struct bkey *bch_btree_iter_next(struct btree_iter *);
318 struct bkey *bch_btree_iter_next_filter(struct btree_iter *,
321 void bch_btree_iter_push(struct btree_iter *, struct bkey *, struct bkey *);
322 struct bkey *bch_btree_iter_init(struct btree_keys *, struct btree_iter *,
323 				 struct bkey *);
325 struct bkey *__bch_bset_search(struct btree_keys *, struct bset_tree *,
326 			       const struct bkey *);
331 static inline struct bkey *bch_bset_search(struct btree_keys *b,  in bch_bset_search()
333 					   const struct bkey *search)  in bch_bset_search()
383 #define bset_bkey_last(i)	bkey_idx((struct bkey *) (i)->d, (i)->keys)
385 static inline struct bkey *bset_bkey_idx(struct bset *i, unsigned idx)  in bset_bkey_idx()
390 static inline void bkey_init(struct bkey *k)  in bkey_init()
395 static __always_inline int64_t bkey_cmp(const struct bkey *l,  in bkey_cmp()
396 					const struct bkey *r)  in bkey_cmp()
403 void bch_bkey_copy_single_ptr(struct bkey *, const struct bkey *,
405 bool __bch_cut_front(const struct bkey *, struct bkey *);
406 bool __bch_cut_back(const struct bkey *, struct bkey *);
408 static inline bool bch_cut_front(const struct bkey *where, struct bkey *k)  in bch_cut_front()
414 static inline bool bch_cut_back(const struct bkey *where, struct bkey *k)  in bch_cut_back()
422 	struct bkey *_ret = NULL;				\
435 static inline bool bch_ptr_invalid(struct btree_keys *b, const struct bkey *k)  in bch_ptr_invalid()
440 static inline bool bch_ptr_bad(struct btree_keys *b, const struct bkey *k)  in bch_ptr_bad()
446 				    size_t size, const struct bkey *k)  in bch_bkey_to_text()
451 static inline bool bch_bkey_equal_header(const struct bkey *l,  in bch_bkey_equal_header()
452 					 const struct bkey *r)  in bch_bkey_equal_header()
463 		struct bkey		*keys;
467 		struct bkey		*top;
481 static inline void bch_keylist_init_single(struct keylist *l, struct bkey *k)  in bch_keylist_init_single()
492 static inline void bch_keylist_add(struct keylist *l, struct bkey *k)  in bch_keylist_add()
524 struct bkey *bch_keylist_pop(struct keylist *);