include/linux/btree.h

1 /* SPDX-License-Identifier: GPL-2.0 */
11  * A B+Tree is a data structure for looking up arbitrary (currently allowing
13  * is described at https://en.wikipedia.org/wiki/B-tree, we currently do not
18  * and pointers to sub-nodes, or, for leaf nodes, the keys and values for the
24  * Each key here is an array of unsigned longs, geo->no_longs in total. The
25  * number of keys and values (N) is geo->no_pairs.
29  * struct btree_head - btree head
45  * btree_alloc - allocate function for the mempool
52  * btree_free - free function for the mempool
59  * btree_init_mempool - initialise a btree with given mempool
70  * btree_init - initialise a btree
76  * (-%ENOMEM) when memory allocation fails.
82  * btree_destroy - destroy mempool
92  * btree_lookup - look up a key in the btree
94  * @head: the btree to look in
96  * @key: the key to look up
104  * btree_insert - insert an entry into the btree
118  * btree_update - update an entry in the btree
126  * -%ENOENT if the key could not be found.
131  * btree_remove - remove an entry from the btree
144  * btree_merge - merge two btrees
162  * btree_last - get last entry in btree
176  * btree_get_prev - get previous entry
207 #include <linux/btree-128.h>
214 #include <linux/btree-type.h>
225 #include <linux/btree-type.h>
237 #include <linux/btree-type.h>