3 (C) 1999 Andrea Arcangeli <andrea@suse.de>
5 This program is free software; you can redistribute it and/or modify
6 it under the terms of the GNU General Public License as published by
7 the Free Software Foundation; either version 2 of the License, or
8 (at your option) any later version.
10 This program is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 GNU General Public License for more details.
15 You should have received a copy of the GNU General Public License
16 along with this program; if not, write to the Free Software
17 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19 linux/include/linux/rbtree.h
21 To use rbtrees you'll have to implement your own insert and search cores.
22 This will avoid us to use callbacks and to drop drammatically performances.
23 I know it's not the cleaner way, but in C (not in C++) to get
24 performances and genericity...
26 See Documentation/rbtree.txt for documentation and samples.
29 #ifndef _LINUX_RBTREE_H
30 #define _LINUX_RBTREE_H
32 #include <linux/kernel.h>
33 #include <linux/stddef.h>
36 unsigned long __rb_parent_color;
37 struct rb_node *rb_right;
38 struct rb_node *rb_left;
39 } __attribute__((aligned(sizeof(long))));
40 /* The alignment might seem pointless, but allegedly CRIS needs it */
43 struct rb_node *rb_node;
47 #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))
49 #define RB_ROOT (struct rb_root) { NULL, }
50 #define rb_entry(ptr, type, member) container_of(ptr, type, member)
52 #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL)
54 /* 'empty' nodes are nodes that are known not to be inserted in an rbree */
55 #define RB_EMPTY_NODE(node) \
56 ((node)->__rb_parent_color == (unsigned long)(node))
57 #define RB_CLEAR_NODE(node) \
58 ((node)->__rb_parent_color = (unsigned long)(node))
61 extern void rb_insert_color(struct rb_node *, struct rb_root *);
62 extern void rb_erase(struct rb_node *, struct rb_root *);
64 typedef void (*rb_augment_f)(struct rb_node *node, void *data);
66 extern void rb_augment_insert(struct rb_node *node,
67 rb_augment_f func, void *data);
68 extern struct rb_node *rb_augment_erase_begin(struct rb_node *node);
69 extern void rb_augment_erase_end(struct rb_node *node,
70 rb_augment_f func, void *data);
72 /* Find logical next and previous nodes in a tree */
73 extern struct rb_node *rb_next(const struct rb_node *);
74 extern struct rb_node *rb_prev(const struct rb_node *);
75 extern struct rb_node *rb_first(const struct rb_root *);
76 extern struct rb_node *rb_last(const struct rb_root *);
78 /* Fast replacement of a single node without remove/rebalance/add/rebalance */
79 extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,
80 struct rb_root *root);
82 static inline void rb_link_node(struct rb_node * node, struct rb_node * parent,
83 struct rb_node ** rb_link)
85 node->__rb_parent_color = (unsigned long)parent;
86 node->rb_left = node->rb_right = NULL;
91 #endif /* _LINUX_RBTREE_H */