From cdb9e22e292275237cbd93b9c4326382daff70f1 Mon Sep 17 00:00:00 2001 From: Josef Bacik Date: Fri, 10 Oct 2014 16:57:08 -0400 Subject: Btrfs-progs: break out rbtree util functions These were added to deal with duplicated functionality within btrfs-progs, but we specifically copied rbtree.c from the kernel, so move these functions out into their own file. This will make it easier to keep rbtree.c in sync. Thanks, Signed-off-by: Josef Bacik Signed-off-by: David Sterba --- rbtree.h | 22 ---------------------- 1 file changed, 22 deletions(-) (limited to 'rbtree.h') diff --git a/rbtree.h b/rbtree.h index 48e5157..3add424 100644 --- a/rbtree.h +++ b/rbtree.h @@ -157,26 +157,4 @@ static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, *rb_link = node; } - -/* The common insert/search/free functions */ -typedef int (*rb_compare_nodes)(struct rb_node *node1, struct rb_node *node2); -typedef int (*rb_compare_keys)(struct rb_node *node, void *key); -typedef void (*rb_free_node)(struct rb_node *node); - -int rb_insert(struct rb_root *root, struct rb_node *node, - rb_compare_nodes comp); -/* - * In some cases, we need return the next node if we don't find the node we - * specify. At this time, we can use next_ret. - */ -struct rb_node *rb_search(struct rb_root *root, void *key, rb_compare_keys comp, - struct rb_node **next_ret); -void rb_free_nodes(struct rb_root *root, rb_free_node free_node); - -#define FREE_RB_BASED_TREE(name, free_func) \ -static void free_##name##_tree(struct rb_root *root) \ -{ \ - rb_free_nodes(root, free_func); \ -} - #endif /* _LINUX_RBTREE_H */ -- cgit v1.2.1