summaryrefslogtreecommitdiff
path: root/libbanshee/libcompat/radix-tree.h
blob: a6b6dc185a30e8e54846148a1b509ff5bb1cd1f2 (plain)
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
/*
 * Copyright (C) 2001 Momchil Velikov
 * Portions Copyright (C) 2001 Christoph Hellwig
 *
 * 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 2, 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, write to the Free Software
 * Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
 */
#ifndef _LINUX_RADIX_TREE_H
#define _LINUX_RADIX_TREE_H


struct radix_tree_node;

struct radix_tree_root {
  unsigned int		height;
  struct radix_tree_node	*rnode;
};

#define RADIX_TREE_INIT()	{0, NULL}

#define RADIX_TREE(name) \
  struct radix_tree_root name = RADIX_TREE_INIT()

#define INIT_RADIX_TREE(root)		\
do {					\
	(root)->height = 0;		\
	(root)->rnode = NULL;		\
} while (0)

extern int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
extern void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
extern void *radix_tree_delete(struct radix_tree_root *, unsigned long);
extern unsigned int radix_tree_gang_lookup(struct radix_tree_root *root, 
					   void **results, 
					   unsigned long first_index,
					   unsigned int max_items);
extern void radix_tree_init(void);


#endif /* _LINUX_RADIX_TREE_H */