1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
|
/*
* Copyright (c) 2013 Richard Braun.
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef _KERN_RDXTREE_I_H
#define _KERN_RDXTREE_I_H
/*
* Radix tree.
*/
struct rdxtree {
unsigned int height;
void *root;
};
/*
* Radix tree iterator.
*/
struct rdxtree_iter {
void *node;
void **slot;
};
/*
* Initialize an iterator.
*/
static inline void
rdxtree_iter_init(struct rdxtree_iter *iter)
{
iter->node = NULL;
iter->slot = NULL;
}
int rdxtree_insert_common(struct rdxtree *tree, unsigned long long key,
void *ptr, void ***slotp);
int rdxtree_insert_alloc_common(struct rdxtree *tree, void *ptr,
unsigned long long *keyp, void ***slotp);
void * rdxtree_lookup_common(const struct rdxtree *tree, unsigned long long key,
int get_slot);
/*
* Walk over pointers in a tree.
*
* Move the iterator to the next pointer in the given tree.
*
* The next pointer is returned if there is one, null otherwise.
*/
void * rdxtree_iter_next(struct rdxtree *tree, struct rdxtree_iter *iter);
#endif /* _KERN_RDXTREE_I_H */
|
