2 * Copyright (C) 2014 Facebook. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
19 #ifndef __RBTREE_UTILS__
20 #define __RBTREE_UTILS__
24 /* The common insert/search/free functions */
25 typedef int (*rb_compare_nodes
)(struct rb_node
*node1
, struct rb_node
*node2
);
26 typedef int (*rb_compare_keys
)(struct rb_node
*node
, void *key
);
27 typedef void (*rb_free_node
)(struct rb_node
*node
);
29 int rb_insert(struct rb_root
*root
, struct rb_node
*node
,
30 rb_compare_nodes comp
);
32 * In some cases, we need return the next node if we don't find the node we
33 * specify. At this time, we can use next_ret.
35 struct rb_node
*rb_search(struct rb_root
*root
, void *key
, rb_compare_keys comp
,
36 struct rb_node
**next_ret
);
37 void rb_free_nodes(struct rb_root
*root
, rb_free_node free_node
);
39 #define FREE_RB_BASED_TREE(name, free_func) \
40 static void free_##name##_tree(struct rb_root *root) \
42 rb_free_nodes(root, free_func); \