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

/*
 * include/linux/idr.h
 * 
 * 2002-10-18  written by Jim Houston jim.houston@ccur.com
 *	Copyright (C) 2002 by Concurrent Computer Corporation
 *	Distributed under the GNU GPL license version 2.
 *
 * Small id to pointer translation service avoiding fixed sized
 * tables.
 */

#ifndef __IDR_H__
#define __IDR_H__

#include <linux/types.h>
#include <linux/bitops.h>
#include <linux/init.h>

#if BITS_PER_LONG == 32
# define IDR_BITS 5
# define IDR_FULL 0xfffffffful
/* We can only use two of the bits in the top level because there is
   only one possible bit in the top level (5 bits * 7 levels = 35
   bits, but you only use 31 bits in the id). */
# define TOP_LEVEL_FULL (IDR_FULL >> 30)
#elif BITS_PER_LONG == 64
# define IDR_BITS 6
# define IDR_FULL 0xfffffffffffffffful
/* We can only use two of the bits in the top level because there is
   only one possible bit in the top level (6 bits * 6 levels = 36
   bits, but you only use 31 bits in the id). */
# define TOP_LEVEL_FULL (IDR_FULL >> 62)
#else
# error "BITS_PER_LONG is not 32 or 64"
#endif

#define IDR_SIZE (1 << IDR_BITS)
#define IDR_MASK ((1 << IDR_BITS)-1)

#define MAX_ID_SHIFT (sizeof(int)*8 - 1)
#define MAX_ID_BIT (1U << MAX_ID_SHIFT)
#define MAX_ID_MASK (MAX_ID_BIT - 1)

/* Leave the possibility of an incomplete final layer */
#define MAX_LEVEL (MAX_ID_SHIFT + IDR_BITS - 1) / IDR_BITS

/* Number of id_layer structs to leave in free list */
#define IDR_FREE_MAX MAX_LEVEL + MAX_LEVEL

struct idr_layer {
	unsigned long		 bitmap; /* A zero bit means "space here" */
	struct idr_layer	*ary[1<<IDR_BITS];
	int			 count;	 /* When zero, we can release it */
};

struct idr {
	struct idr_layer *top;
	struct idr_layer *id_free;
	int		  layers;
	int		  id_free_cnt;
	spinlock_t	  lock;
};

#define IDR_INIT(name)						\
{								\
	.top		= NULL,					\
	.id_free	= NULL,					\
	.layers 	= 0,					\
	.id_free_cnt	= 0,					\
	.lock		= __SPIN_LOCK_UNLOCKED(name.lock),	\
}
#define DEFINE_IDR(name)	struct idr name = IDR_INIT(name)

/*
 * This is what we export.
 */

void *idr_find(struct idr *idp, int id);
int idr_pre_get(struct idr *idp, gfp_t gfp_mask);
int idr_get_new(struct idr *idp, void *ptr, int *id);
int idr_get_new_above(struct idr *idp, void *ptr, int starting_id, int *id);
int idr_for_each(struct idr *idp,
		 int (*fn)(int id, void *p, void *data), void *data);
void *idr_replace(struct idr *idp, void *ptr, int id);
void idr_remove(struct idr *idp, int id);
void idr_remove_all(struct idr *idp);
void idr_destroy(struct idr *idp);
void idr_init(struct idr *idp);


/*
 * IDA - IDR based id allocator, use when translation from id to
 * pointer isn't necessary.
 */
#define IDA_CHUNK_SIZE		128	/* 128 bytes per chunk */
#define IDA_BITMAP_LONGS	(128 / sizeof(long) - 1)
#define IDA_BITMAP_BITS		(IDA_BITMAP_LONGS * sizeof(long) * 8)

struct ida_bitmap {
	long			nr_busy;
	unsigned long		bitmap[IDA_BITMAP_LONGS];
};

struct ida {
	struct idr		idr;
	struct ida_bitmap	*free_bitmap;
};

#define IDA_INIT(name)		{ .idr = IDR_INIT(name), .free_bitmap = NULL, }
#define DEFINE_IDA(name)	struct ida name = IDA_INIT(name)

int ida_pre_get(struct ida *ida, gfp_t gfp_mask);
int ida_get_new_above(struct ida *ida, int starting_id, int *p_id);
int ida_get_new(struct ida *ida, int *p_id);
void ida_remove(struct ida *ida, int id);
void ida_destroy(struct ida *ida);
void ida_init(struct ida *ida);

void __init idr_init_cache(void);

#endif /* __IDR_H__ */
Commit	Line	Data
1da177e4 LT	1	/*
	2	* include/linux/idr.h
	3	*
	4	* 2002-10-18 written by Jim Houston jim.houston@ccur.com
	5	* Copyright (C) 2002 by Concurrent Computer Corporation
	6	* Distributed under the GNU GPL license version 2.
	7	*
	8	* Small id to pointer translation service avoiding fixed sized
	9	* tables.
	10	*/
f668ab1a LT	11
	12	#ifndef __IDR_H__
	13	#define __IDR_H__
	14
1da177e4 LT	15	#include <linux/types.h>
1da177e4 LT	16	#include <linux/bitops.h>
199f0ca5	17	#include <linux/init.h>
1da177e4 LT	18
	19	#if BITS_PER_LONG == 32
	20	# define IDR_BITS 5
	21	# define IDR_FULL 0xfffffffful
	22	/* We can only use two of the bits in the top level because there is
	23	only one possible bit in the top level (5 bits * 7 levels = 35
	24	bits, but you only use 31 bits in the id). */
	25	# define TOP_LEVEL_FULL (IDR_FULL >> 30)
	26	#elif BITS_PER_LONG == 64
	27	# define IDR_BITS 6
	28	# define IDR_FULL 0xfffffffffffffffful
	29	/* We can only use two of the bits in the top level because there is
	30	only one possible bit in the top level (6 bits * 6 levels = 36
	31	bits, but you only use 31 bits in the id). */
	32	# define TOP_LEVEL_FULL (IDR_FULL >> 62)
	33	#else
	34	# error "BITS_PER_LONG is not 32 or 64"
	35	#endif
	36
	37	#define IDR_SIZE (1 << IDR_BITS)
	38	#define IDR_MASK ((1 << IDR_BITS)-1)
	39
	40	#define MAX_ID_SHIFT (sizeof(int)*8 - 1)
	41	#define MAX_ID_BIT (1U << MAX_ID_SHIFT)
	42	#define MAX_ID_MASK (MAX_ID_BIT - 1)
	43
	44	/* Leave the possibility of an incomplete final layer */
	45	#define MAX_LEVEL (MAX_ID_SHIFT + IDR_BITS - 1) / IDR_BITS
	46
	47	/* Number of id_layer structs to leave in free list */
	48	#define IDR_FREE_MAX MAX_LEVEL + MAX_LEVEL
	49
	50	struct idr_layer {
	51	unsigned long bitmap; /* A zero bit means "space here" */
	52	struct idr_layer *ary[1<<IDR_BITS];
	53	int count; /* When zero, we can release it */
	54	};
	55
	56	struct idr {
	57	struct idr_layer *top;
	58	struct idr_layer *id_free;
	59	int layers;
	60	int id_free_cnt;
	61	spinlock_t lock;
	62	};
	63
	64	#define IDR_INIT(name) \
	65	{ \
	66	.top = NULL, \
	67	.id_free = NULL, \
	68	.layers = 0, \
	69	.id_free_cnt = 0, \
e4d91918	70	.lock = __SPIN_LOCK_UNLOCKED(name.lock), \
1da177e4 LT	71	}
	72	#define DEFINE_IDR(name) struct idr name = IDR_INIT(name)
	73
	74	/*
	75	* This is what we export.
	76	*/
	77
	78	void idr_find(struct idr idp, int id);
fd4f2df2	79	int idr_pre_get(struct idr *idp, gfp_t gfp_mask);
1da177e4 LT	80	int idr_get_new(struct idr idp, void ptr, int *id);
1da177e4 LT	81	int idr_get_new_above(struct idr idp, void ptr, int starting_id, int *id);
96d7fa42 KH	82	int idr_for_each(struct idr *idp,
96d7fa42 KH	83	int (fn)(int id, void p, void data), void data);
5806f07c	84	void idr_replace(struct idr idp, void *ptr, int id);
1da177e4	85	void idr_remove(struct idr *idp, int id);
23936cc0	86	void idr_remove_all(struct idr *idp);
8d3b3591	87	void idr_destroy(struct idr *idp);
1da177e4	88	void idr_init(struct idr *idp);
f668ab1a	89
72dba584 TH	90
	91	/*
	92	* IDA - IDR based id allocator, use when translation from id to
	93	* pointer isn't necessary.
	94	*/
	95	#define IDA_CHUNK_SIZE 128 /* 128 bytes per chunk */
	96	#define IDA_BITMAP_LONGS (128 / sizeof(long) - 1)
	97	#define IDA_BITMAP_BITS (IDA_BITMAP_LONGS * sizeof(long) * 8)
	98
	99	struct ida_bitmap {
	100	long nr_busy;
	101	unsigned long bitmap[IDA_BITMAP_LONGS];
	102	};
	103
	104	struct ida {
	105	struct idr idr;
	106	struct ida_bitmap *free_bitmap;
	107	};
	108
	109	#define IDA_INIT(name) { .idr = IDR_INIT(name), .free_bitmap = NULL, }
	110	#define DEFINE_IDA(name) struct ida name = IDA_INIT(name)
	111
	112	int ida_pre_get(struct ida *ida, gfp_t gfp_mask);
	113	int ida_get_new_above(struct ida ida, int starting_id, int p_id);
	114	int ida_get_new(struct ida ida, int p_id);
	115	void ida_remove(struct ida *ida, int id);
	116	void ida_destroy(struct ida *ida);
	117	void ida_init(struct ida *ida);
	118
199f0ca5 AM	119	void __init idr_init_cache(void);
199f0ca5 AM	120
f668ab1a	121	#endif /* __IDR_H__ */