1 files changed, 0 insertions, 77 deletions
diff --git a/include/linux/sradix-tree.h b/include/linux/sradix-tree.h
deleted file mode 100644
index 6780fdb0a..000000000
--- a/include/linux/sradix-tree.h
+++ /dev/null
@@ -1,77 +0,0 @@
-#ifndef _LINUX_SRADIX_TREE_H
-#define _LINUX_SRADIX_TREE_H
-
-
-#define INIT_SRADIX_TREE(root, mask)					\
-do {									\
-	(root)->height = 0;						\
-	(root)->gfp_mask = (mask);					\
-	(root)->rnode = NULL;						\
-} while (0)
-
-#define ULONG_BITS	(sizeof(unsigned long) * 8)
-#define SRADIX_TREE_INDEX_BITS  (8 /* CHAR_BIT */ * sizeof(unsigned long))
-//#define SRADIX_TREE_MAP_SHIFT	6
-//#define SRADIX_TREE_MAP_SIZE	(1UL << SRADIX_TREE_MAP_SHIFT)
-//#define SRADIX_TREE_MAP_MASK	(SRADIX_TREE_MAP_SIZE-1)
-
-struct sradix_tree_node {
-	unsigned int	height;		/* Height from the bottom */
-	unsigned int	count;		
-	unsigned int	fulls;		/* Number of full sublevel trees */ 
-	struct sradix_tree_node *parent;
-	void *stores[0];
-};
-
-/* A simple radix tree implementation */
-struct sradix_tree_root {
-        unsigned int            height;
-        struct sradix_tree_node *rnode;
-
-	/* Where found to have available empty stores in its sublevels */
-        struct sradix_tree_node *enter_node;
-	unsigned int shift;
-	unsigned int stores_size;
-	unsigned int mask;
-	unsigned long min;	/* The first hole index */
-	unsigned long num;
-	//unsigned long *height_to_maxindex;
-
-	/* How the node is allocated and freed. */
-	struct sradix_tree_node *(*alloc)(void); 
-	void (*free)(struct sradix_tree_node *node);
-
-	/* When a new node is added and removed */
-	void (*extend)(struct sradix_tree_node *parent, struct sradix_tree_node *child);
-	void (*assign)(struct sradix_tree_node *node, unsigned index, void *item);
-	void (*rm)(struct sradix_tree_node *node, unsigned offset);
-};
-
-struct sradix_tree_path {
-	struct sradix_tree_node *node;
-	int offset;
-};
-
-static inline 
-void init_sradix_tree_root(struct sradix_tree_root *root, unsigned long shift)
-{
-	root->height = 0;
-	root->rnode = NULL;
-	root->shift = shift;
-	root->stores_size = 1UL << shift;
-	root->mask = root->stores_size - 1;
-}
-
-
-extern void *sradix_tree_next(struct sradix_tree_root *root,
-		       struct sradix_tree_node *node, unsigned long index,
-		       int (*iter)(void *, unsigned long));
-
-extern int sradix_tree_enter(struct sradix_tree_root *root, void **item, int num);
-
-extern void sradix_tree_delete_from_leaf(struct sradix_tree_root *root, 
-			struct sradix_tree_node *node, unsigned long index);
-
-extern void *sradix_tree_lookup(struct sradix_tree_root *root, unsigned long index);
-
-#endif /* _LINUX_SRADIX_TREE_H */