diff options
| author | Josef Bacik <jbacik@fb.com> | 2014-10-10 16:57:08 -0400 |
|---|---|---|
| committer | David Sterba <dsterba@suse.cz> | 2014-10-14 10:39:39 +0200 |
| commit | cdb9e22e292275237cbd93b9c4326382daff70f1 (patch) | |
| tree | a82ca9ba4b2bb0d014969e1b2dd476adcc1edefb /rbtree-utils.h | |
| parent | d90d8d2323cdee2bdb3b130236c801ceeb8ea875 (diff) | |
| download | btrfs-progs-cdb9e22e292275237cbd93b9c4326382daff70f1.tar.gz | |
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 <jbacik@fb.com>
Signed-off-by: David Sterba <dsterba@suse.cz>
Diffstat (limited to 'rbtree-utils.h')
| -rw-r--r-- | rbtree-utils.h | 45 |
1 files changed, 45 insertions, 0 deletions
diff --git a/rbtree-utils.h b/rbtree-utils.h new file mode 100644 index 0000000..7298c72 --- /dev/null +++ b/rbtree-utils.h @@ -0,0 +1,45 @@ +/* + * Copyright (C) 2014 Facebook. All rights reserved. + * + * This program is free software; you can redistribute it and/or + * modify it under the terms of the GNU General Public + * License v2 as published by the Free Software Foundation. + * + * 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., 59 Temple Place - Suite 330, + * Boston, MA 021110-1307, USA. + */ + +#ifndef __RBTREE_UTILS__ +#define __RBTREE_UTILS__ + +#include "rbtree.h" + +/* 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 |