34 struct bset_tree *bch2_bkey_to_bset(struct btree *b, struct bkey_packed *k)  in bch2_bkey_to_bset()
58 	struct bkey_packed *_k, *_n;  in bch2_dump_bset()
122 		struct bkey_packed *k = __btree_node_offset_to_key(b, set->k);  in bch2_dump_btree_node_iter()
137 	struct bkey_packed *k;  in bch2_btree_node_count_keys()
160 	const struct bkey_packed *k, *n;  in bch2_btree_node_iter_next_check()
184 			struct bkey_packed *k2 = __btree_node_offset_to_key(b, set->k);  in bch2_btree_node_iter_next_check()
197 	struct bkey_packed *k, *p;  in bch2_btree_node_iter_verify()
240 void bch2_verify_insert_pos(struct btree *b, struct bkey_packed *where,  in bch2_verify_insert_pos()
241 			    struct bkey_packed *insert, unsigned clobber_u64s)  in bch2_verify_insert_pos()
244 	struct bkey_packed *prev = bch2_bkey_prev_all(b, t, where);  in bch2_verify_insert_pos()
245 	struct bkey_packed *next = (void *) ((u64 *) where->_data + clobber_u64s);  in bch2_verify_insert_pos()
425 static struct bkey_packed *cacheline_to_bkey(const struct btree *b,  in cacheline_to_bkey()
435 				  const struct bkey_packed *k)  in bkey_to_cacheline()
443 					  const struct bkey_packed *k)  in __bkey_to_cacheline_offset()
451 					 const struct bkey_packed *k)  in bkey_to_cacheline_offset()
459 static inline struct bkey_packed *tree_to_bkey(const struct btree *b,  in tree_to_bkey()
480 static struct bkey_packed *rw_aux_to_bkey(const struct btree *b,  in rw_aux_to_bkey()
488 			    unsigned j, struct bkey_packed *k)  in rw_aux_tree_set()
501 	struct bkey_packed *k = btree_bkey_first(b, t);  in bch2_bset_verify_rw_aux_tree()
564 static inline unsigned bkey_mantissa(const struct bkey_packed *k,  in bkey_mantissa()
569 	EBUG_ON(!bkey_packed(k));  in bkey_mantissa()
589 					struct bkey_packed *min_key,  in make_bfloat()
590 					struct bkey_packed *max_key)  in make_bfloat()
593 	struct bkey_packed *m = tree_to_bkey(b, t, j);  in make_bfloat()
594 	struct bkey_packed *l = is_power_of_2(j)  in make_bfloat()
597 	struct bkey_packed *r = is_power_of_2(j + 1)  in make_bfloat()
608 	if (!bkey_packed(l) || !bkey_packed(r) || !bkey_packed(m) ||  in make_bfloat()
679 	struct bkey_packed *k;  in __build_rw_aux_tree()
698 	struct bkey_packed *k = btree_bkey_first(b, t);  in __build_ro_aux_tree()
819 static struct bkey_packed *__bkey_prev(struct btree *b, struct bset_tree *t,  in __bkey_prev()
820 				       struct bkey_packed *k)  in __bkey_prev()
822 	struct bkey_packed *p;  in __bkey_prev()
857 struct bkey_packed *bch2_bkey_prev_filter(struct btree *b,  in bch2_bkey_prev_filter()
859 					  struct bkey_packed *k,  in bch2_bkey_prev_filter()
862 	struct bkey_packed *p, *i, *ret = NULL, *orig_k = k;  in bch2_bkey_prev_filter()
893 	struct bkey_packed *start = rw_aux_to_bkey(b, t, idx - 1);  in rw_aux_tree_insert_entry()
894 	struct bkey_packed *end = idx < t->size  in rw_aux_tree_insert_entry()
900 		struct bkey_packed *k = start;  in rw_aux_tree_insert_entry()
922 				       struct bkey_packed *_where,  in bch2_bset_fix_lookup_table()
980 		      struct bkey_packed *where,  in bch2_bset_insert()
986 	struct bkey_packed packed, *src = bkey_to_packed(insert);  in bch2_bset_insert()
1021 		      struct bkey_packed *where,  in bch2_bset_delete()
1042 static struct bkey_packed *bset_search_write_set(const struct btree *b,  in bset_search_write_set()
1092 static struct bkey_packed *bset_search_tree(const struct btree *b,  in bset_search_tree()
1095 				const struct bkey_packed *packed_search)  in bset_search_tree()
1099 	struct bkey_packed *k;  in bset_search_tree()
1146 struct bkey_packed *__bch2_bset_search(struct btree *b,  in __bch2_bset_search()
1149 				const struct bkey_packed *lossy_packed_search)  in __bch2_bset_search()
1180 struct bkey_packed *bch2_bset_search_linear(struct btree *b,  in bch2_bset_search_linear()
1183 				struct bkey_packed *packed_search,  in bch2_bset_search_linear()
1184 				const struct bkey_packed *lossy_packed_search,  in bch2_bset_search_linear()
1185 				struct bkey_packed *m)  in bch2_bset_search_linear()
1199 		struct bkey_packed *prev = bch2_bkey_prev_all(b, t, m);  in bch2_bset_search_linear()
1213 			      const struct bkey_packed *k,  in __bch2_btree_node_iter_push()
1214 			      const struct bkey_packed *end)  in __bch2_btree_node_iter_push()
1232 			       const struct bkey_packed *k,  in bch2_btree_node_iter_push()
1233 			       const struct bkey_packed *end)  in bch2_btree_node_iter_push()
1243 	struct bkey_packed *k;  in btree_node_iter_init_pack_failed()
1302 	struct bkey_packed p, *packed_search = NULL;  in bch2_btree_node_iter_init()
1304 	struct bkey_packed *k[MAX_BSETS];  in bch2_btree_node_iter_init()
1332 		struct bkey_packed *end = btree_bkey_last(b, t);  in bch2_btree_node_iter_init()
1358 struct bkey_packed *bch2_btree_node_iter_bset_pos(struct btree_node_iter *iter,  in bch2_btree_node_iter_bset_pos()
1449 struct bkey_packed *bch2_btree_node_iter_prev_all(struct btree_node_iter *iter,  in bch2_btree_node_iter_prev_all()
1452 	struct bkey_packed *k, *prev = NULL;  in bch2_btree_node_iter_prev_all()
1497 struct bkey_packed *bch2_btree_node_iter_prev(struct btree_node_iter *iter,  in bch2_btree_node_iter_prev()
1500 	struct bkey_packed *prev;  in bch2_btree_node_iter_prev()
1513 	struct bkey_packed *k = bch2_btree_node_iter_peek(iter, b);  in bch2_btree_node_iter_peek_unpack()
1542 			 struct bkey_packed *k)  in bch2_bfloat_to_text()