[net-next-2.6.git] / include / linux / radix-tree.h

/*
 * 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

#include <linux/preempt.h>
#include <linux/types.h>

#define RADIX_TREE_MAX_TAGS 2

/* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
struct radix_tree_root {
	unsigned int		height;
	gfp_t			gfp_mask;
	struct radix_tree_node	*rnode;
};

#define RADIX_TREE_INIT(mask)	{					\
	.height = 0,							\
	.gfp_mask = (mask),						\
	.rnode = NULL,							\
}

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

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

int radix_tree_insert(struct radix_tree_root *, unsigned long, void *);
void *radix_tree_lookup(struct radix_tree_root *, unsigned long);
void **radix_tree_lookup_slot(struct radix_tree_root *, unsigned long);
void *radix_tree_delete(struct radix_tree_root *, unsigned long);
unsigned int
radix_tree_gang_lookup(struct radix_tree_root *root, void **results,
			unsigned long first_index, unsigned int max_items);
int radix_tree_preload(gfp_t gfp_mask);
void radix_tree_init(void);
void *radix_tree_tag_set(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
void *radix_tree_tag_clear(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
int radix_tree_tag_get(struct radix_tree_root *root,
			unsigned long index, unsigned int tag);
unsigned int
radix_tree_gang_lookup_tag(struct radix_tree_root *root, void **results,
		unsigned long first_index, unsigned int max_items,
		unsigned int tag);
int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);

static inline void radix_tree_preload_end(void)
{
	preempt_enable();
}

#endif /* _LINUX_RADIX_TREE_H */
Commit	Line	Data
1da177e4 LT	1	/*
	2	* Copyright (C) 2001 Momchil Velikov
	3	* Portions Copyright (C) 2001 Christoph Hellwig
	4	*
	5	* This program is free software; you can redistribute it and/or
	6	* modify it under the terms of the GNU General Public License as
	7	* published by the Free Software Foundation; either version 2, or (at
	8	* your option) any later version.
	9	*
	10	* This program is distributed in the hope that it will be useful, but
	11	* WITHOUT ANY WARRANTY; without even the implied warranty of
	12	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	13	* General Public License for more details.
	14	*
	15	* You should have received a copy of the GNU General Public License
	16	* along with this program; if not, write to the Free Software
	17	* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
	18	*/
	19	#ifndef _LINUX_RADIX_TREE_H
	20	#define _LINUX_RADIX_TREE_H
	21
	22	#include <linux/preempt.h>
	23	#include <linux/types.h>
	24
612d6c19 NP	25	#define RADIX_TREE_MAX_TAGS 2
	26
	27	/* root tags are stored in gfp_mask, shifted by __GFP_BITS_SHIFT */
1da177e4 LT	28	struct radix_tree_root {
1da177e4 LT	29	unsigned int height;
fd4f2df2	30	gfp_t gfp_mask;
1da177e4 LT	31	struct radix_tree_node *rnode;
	32	};
	33
	34	#define RADIX_TREE_INIT(mask) { \
	35	.height = 0, \
	36	.gfp_mask = (mask), \
	37	.rnode = NULL, \
	38	}
	39
	40	#define RADIX_TREE(name, mask) \
	41	struct radix_tree_root name = RADIX_TREE_INIT(mask)
	42
	43	#define INIT_RADIX_TREE(root, mask) \
	44	do { \
	45	(root)->height = 0; \
	46	(root)->gfp_mask = (mask); \
	47	(root)->rnode = NULL; \
	48	} while (0)
	49
	50	int radix_tree_insert(struct radix_tree_root , unsigned long, void );
	51	void radix_tree_lookup(struct radix_tree_root , unsigned long);
a4331366	52	void *radix_tree_lookup_slot(struct radix_tree_root , unsigned long);
1da177e4 LT	53	void radix_tree_delete(struct radix_tree_root , unsigned long);
	54	unsigned int
	55	radix_tree_gang_lookup(struct radix_tree_root root, void *results,
	56	unsigned long first_index, unsigned int max_items);
dd0fc66f	57	int radix_tree_preload(gfp_t gfp_mask);
1da177e4 LT	58	void radix_tree_init(void);
1da177e4 LT	59	void radix_tree_tag_set(struct radix_tree_root root,
daff89f3	60	unsigned long index, unsigned int tag);
1da177e4	61	void radix_tree_tag_clear(struct radix_tree_root root,
daff89f3	62	unsigned long index, unsigned int tag);
1da177e4	63	int radix_tree_tag_get(struct radix_tree_root *root,
daff89f3	64	unsigned long index, unsigned int tag);
1da177e4 LT	65	unsigned int
1da177e4 LT	66	radix_tree_gang_lookup_tag(struct radix_tree_root root, void *results,
daff89f3 JC	67	unsigned long first_index, unsigned int max_items,
	68	unsigned int tag);
	69	int radix_tree_tagged(struct radix_tree_root *root, unsigned int tag);
1da177e4 LT	70
	71	static inline void radix_tree_preload_end(void)
	72	{
	73	preempt_enable();
	74	}
	75
	76	#endif /* _LINUX_RADIX_TREE_H */