149 struct btree_keys;
192 	bool		(*insert_fixup)(struct btree_keys *, struct bkey *,
194 	bool		(*key_invalid)(struct btree_keys *,
196 	bool		(*key_bad)(struct btree_keys *, const struct bkey *);
197 	bool		(*key_merge)(struct btree_keys *,
200 	void		(*key_dump)(struct btree_keys *, const struct bkey *);
209 struct btree_keys {  struct
226 static inline struct bset_tree *bset_tree_last(struct btree_keys *b)  in bset_tree_last()  argument
231 static inline bool bset_written(struct btree_keys *b, struct bset_tree *t)  in bset_written()
236 static inline bool bkey_written(struct btree_keys *b, struct bkey *k)  in bkey_written()
241 static inline unsigned bset_byte_offset(struct btree_keys *b, struct bset *i)  in bset_byte_offset()
246 static inline unsigned bset_sector_offset(struct btree_keys *b, struct bset *i)  in bset_sector_offset()
259 static inline size_t bch_btree_keys_u64s_remaining(struct btree_keys *b)  in bch_btree_keys_u64s_remaining()
274 static inline struct bset *bset_next_set(struct btree_keys *b,  in bset_next_set()
282 void bch_btree_keys_free(struct btree_keys *);
283 int bch_btree_keys_alloc(struct btree_keys *, unsigned, gfp_t);
284 void bch_btree_keys_init(struct btree_keys *, const struct btree_keys_ops *,
287 void bch_bset_init_next(struct btree_keys *, struct bset *, uint64_t);
288 void bch_bset_build_written_tree(struct btree_keys *);
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 *,
308 	struct btree_keys *b;
315 typedef bool (*ptr_filter_fn)(struct btree_keys *, const struct bkey *);
319 					struct btree_keys *, ptr_filter_fn);
322 struct bkey *bch_btree_iter_init(struct btree_keys *, struct btree_iter *,
325 struct bkey *__bch_bset_search(struct btree_keys *, struct bset_tree *,
331 static inline struct bkey *bch_bset_search(struct btree_keys *b,  in bch_bset_search()
359 void bch_btree_sort_lazy(struct btree_keys *, struct bset_sort_state *);
360 void bch_btree_sort_into(struct btree_keys *, struct btree_keys *,
362 void bch_btree_sort_and_fix_extents(struct btree_keys *, struct btree_iter *,
364 void bch_btree_sort_partial(struct btree_keys *, unsigned,
367 static inline void bch_btree_sort(struct btree_keys *b,  in bch_btree_sort()
379 void bch_btree_keys_stats(struct btree_keys *, struct bset_stats *);
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()
445 static inline void bch_bkey_to_text(struct btree_keys *b, char *buf,  in bch_bkey_to_text()
532 int __bch_count_data(struct btree_keys *);
533 void __bch_check_keys(struct btree_keys *, const char *, ...);
534 void bch_dump_bset(struct btree_keys *, struct bset *, unsigned);
535 void bch_dump_bucket(struct btree_keys *);
539 static inline int __bch_count_data(struct btree_keys *b) { return -1; }  in __bch_count_data()
540 static inline void __bch_check_keys(struct btree_keys *b, const char *fmt, ...) {}  in __bch_check_keys()
541 static inline void bch_dump_bucket(struct btree_keys *b) {}  in bch_dump_bucket()
542 void bch_dump_bset(struct btree_keys *, struct bset *, unsigned);
546 static inline bool btree_keys_expensive_checks(struct btree_keys *b)  in btree_keys_expensive_checks()
555 static inline int bch_count_data(struct btree_keys *b)  in bch_count_data()