67 void btree_init_mempool(struct btree_head *head, mempool_t *mempool);
79 int __must_check btree_init(struct btree_head *head);
89 void btree_destroy(struct btree_head *head);
100 void *btree_lookup(struct btree_head *head, struct btree_geo *geo,
115 int __must_check btree_insert(struct btree_head *head, struct btree_geo *geo,
128 int btree_update(struct btree_head *head, struct btree_geo *geo,
140 void *btree_remove(struct btree_head *head, struct btree_geo *geo,
172 void *btree_last(struct btree_head *head, struct btree_geo *geo,
186 void *btree_get_prev(struct btree_head *head, struct btree_geo *geo,
191 size_t btree_visitor(struct btree_head *head, struct btree_geo *geo,
199 size_t btree_grim_visitor(struct btree_head *head, struct btree_geo *geo,
216 #define btree_for_each_safel(head, key, val)	\  argument
217 	for (val = btree_lastl(head, &key);	\
219 	     val = btree_get_prevl(head, &key))
227 #define btree_for_each_safe32(head, key, val)	\  argument
228 	for (val = btree_last32(head, &key);	\
230 	     val = btree_get_prev32(head, &key))
239 #define btree_for_each_safe64(head, key, val)	\  argument
240 	for (val = btree_last64(head, &key);	\
242 	     val = btree_get_prev64(head, &key))