172 	struct bkey		end;
192 	struct bkey	*(*sort_fixup)(struct btree_iter *iter,
193 				       struct bkey *tmp);
195 					struct bkey *insert,
197 					struct bkey *replace_key);
199 				       const struct bkey *k);
201 				   const struct bkey *k);
203 				     struct bkey *l, struct bkey *r);
206 				       const struct bkey *k);
208 				    const struct bkey *k);
244 static inline bool bkey_written(struct btree_keys *b, struct bkey *k)  in bkey_written()
300 void bch_bset_fix_invalidated_key(struct btree_keys *b, struct bkey *k);
301 bool bch_bkey_try_merge(struct btree_keys *b, struct bkey *l, struct bkey *r);
302 void bch_bset_insert(struct btree_keys *b, struct bkey *where,
303 		     struct bkey *insert);
304 unsigned int bch_btree_insert_key(struct btree_keys *b, struct bkey *k,
305 			      struct bkey *replace_key);
323 		struct bkey *k, *end;
327 typedef bool (*ptr_filter_fn)(struct btree_keys *b, const struct bkey *k);
329 struct bkey *bch_btree_iter_next(struct btree_iter *iter);
330 struct bkey *bch_btree_iter_next_filter(struct btree_iter *iter,
334 void bch_btree_iter_push(struct btree_iter *iter, struct bkey *k,
335 			 struct bkey *end);
336 struct bkey *bch_btree_iter_init(struct btree_keys *b,
338 				 struct bkey *search);
340 struct bkey *__bch_bset_search(struct btree_keys *b, struct bset_tree *t,
341 			       const struct bkey *search);
346 static inline struct bkey *bch_bset_search(struct btree_keys *b,  in bch_bset_search()
348 					   const struct bkey *search)  in bch_bset_search()
400 #define bset_bkey_last(i)	bkey_idx((struct bkey *) (i)->d, \
403 static inline struct bkey *bset_bkey_idx(struct bset *i, unsigned int idx)  in bset_bkey_idx()
408 static inline void bkey_init(struct bkey *k)  in bkey_init()
413 static __always_inline int64_t bkey_cmp(const struct bkey *l,  in bkey_cmp()
414 					const struct bkey *r)  in bkey_cmp()
421 void bch_bkey_copy_single_ptr(struct bkey *dest, const struct bkey *src,
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()
432 static inline bool bch_cut_back(const struct bkey *where, struct bkey *k)  in bch_cut_back()
447 static inline void preceding_key(struct bkey *k, struct bkey **preceding_key_p)  in preceding_key()
459 static inline bool bch_ptr_invalid(struct btree_keys *b, const struct bkey *k)  in bch_ptr_invalid()
464 static inline bool bch_ptr_bad(struct btree_keys *b, const struct bkey *k)  in bch_ptr_bad()
470 				    size_t size, const struct bkey *k)  in bch_bkey_to_text()
475 static inline bool bch_bkey_equal_header(const struct bkey *l,  in bch_bkey_equal_header()
476 					 const struct bkey *r)  in bch_bkey_equal_header()
487 		struct bkey		*keys;
491 		struct bkey		*top;
505 static inline void bch_keylist_init_single(struct keylist *l, struct bkey *k)  in bch_keylist_init_single()
516 static inline void bch_keylist_add(struct keylist *l, struct bkey *k)  in bch_keylist_add()
548 struct bkey *bch_keylist_pop(struct keylist *l);