66 void btree_init_mempool(struct btree_head *head, mempool_t *mempool);
78 int __must_check btree_init(struct btree_head *head);
88 void btree_destroy(struct btree_head *head);
99 void *btree_lookup(struct btree_head *head, struct btree_geo *geo,
114 int __must_check btree_insert(struct btree_head *head, struct btree_geo *geo,
127 int btree_update(struct btree_head *head, struct btree_geo *geo,
139 void *btree_remove(struct btree_head *head, struct btree_geo *geo,
171 void *btree_last(struct btree_head *head, struct btree_geo *geo,
185 void *btree_get_prev(struct btree_head *head, struct btree_geo *geo,
190 size_t btree_visitor(struct btree_head *head, struct btree_geo *geo,
198 size_t btree_grim_visitor(struct btree_head *head, struct btree_geo *geo,
215 #define btree_for_each_safel(head, key, val)	\  argument
216 	for (val = btree_lastl(head, &key);	\
218 	     val = btree_get_prevl(head, &key))
226 #define btree_for_each_safe32(head, key, val)	\  argument
227 	for (val = btree_last32(head, &key);	\
229 	     val = btree_get_prev32(head, &key))
238 #define btree_for_each_safe64(head, key, val)	\  argument
239 	for (val = btree_last64(head, &key);	\
241 	     val = btree_get_prev64(head, &key))