2 * Copyright (c) 2010 Isilon Systems, Inc.
3 * Copyright (c) 2010 iX Systems, Inc.
4 * Copyright (c) 2010 Panasas, Inc.
5 * Copyright (c) 2013, 2014 Mellanox Technologies, Ltd.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice unmodified, this list of conditions, and the following
14 * 2. Redistributions in binary form must reproduce the above copyright
15 * notice, this list of conditions and the following disclaimer in the
16 * documentation and/or other materials provided with the distribution.
18 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
19 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
20 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
21 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
22 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
23 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
24 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
25 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
26 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
27 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
31 #ifndef _LINUX_RBTREE_H_
32 #define _LINUX_RBTREE_H_
34 #include <sys/stddef.h>
38 RB_ENTRY(rb_node) __entry;
40 #define rb_left __entry.rbe_left
41 #define rb_right __entry.rbe_right
44 * We provide a false structure that has the same bit pattern as tree.h
45 * presents so it matches the member names expected by linux.
48 struct rb_node *rb_node;
52 * In linux all of the comparisons are done by the caller.
54 int panic_cmp(struct rb_node *one, struct rb_node *two);
56 RB_HEAD(linux_root, rb_node);
57 RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);
59 #define rb_parent(r) RB_PARENT(r, __entry)
60 #define rb_color(r) RB_COLOR(r, __entry)
61 #define rb_is_red(r) (rb_color(r) == RB_RED)
62 #define rb_is_black(r) (rb_color(r) == RB_BLACK)
63 #define rb_set_parent(r, p) rb_parent((r)) = (p)
64 #define rb_set_color(r, c) rb_color((r)) = (c)
65 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
67 #define RB_EMPTY_ROOT(root) RB_EMPTY((struct linux_root *)root)
68 #define RB_EMPTY_NODE(node) (rb_parent(node) == node)
69 #define RB_CLEAR_NODE(node) (rb_set_parent(node, node))
71 #define rb_insert_color(node, root) \
72 linux_root_RB_INSERT_COLOR((struct linux_root *)(root), (node))
73 #define rb_erase(node, root) \
74 linux_root_RB_REMOVE((struct linux_root *)(root), (node))
75 #define rb_next(node) RB_NEXT(linux_root, NULL, (node))
76 #define rb_prev(node) RB_PREV(linux_root, NULL, (node))
77 #define rb_first(root) RB_MIN(linux_root, (struct linux_root *)(root))
78 #define rb_last(root) RB_MAX(linux_root, (struct linux_root *)(root))
81 rb_link_node(struct rb_node *node, struct rb_node *parent,
82 struct rb_node **rb_link)
84 rb_set_parent(node, parent);
85 rb_set_color(node, RB_RED);
86 node->__entry.rbe_left = node->__entry.rbe_right = NULL;
91 rb_replace_node(struct rb_node *victim, struct rb_node *new,
96 p = rb_parent(victim);
98 if (p->rb_left == victim)
105 rb_set_parent(victim->rb_left, new);
106 if (victim->rb_right)
107 rb_set_parent(victim->rb_right, new);
112 #define RB_ROOT (struct rb_root) { NULL }
114 #endif /* _LINUX_RBTREE_H_ */