Blame view
include/linux/rbtree.h
4.38 KB
1da177e4c Linux-2.6.12-rc2 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
/* Red Black Trees (C) 1999 Andrea Arcangeli <andrea@suse.de> This program is free software; you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation; either version 2 of the License, or (at your option) any later version. 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 02111-1307 USA linux/include/linux/rbtree.h To use rbtrees you'll have to implement your own insert and search cores. This will avoid us to use callbacks and to drop drammatically performances. I know it's not the cleaner way, but in C (not in C++) to get performances and genericity... |
1457d2877 rbtree: reference... |
25 |
See Documentation/rbtree.txt for documentation and samples. |
1da177e4c Linux-2.6.12-rc2 |
26 27 28 29 30 31 32 |
*/ #ifndef _LINUX_RBTREE_H #define _LINUX_RBTREE_H #include <linux/kernel.h> #include <linux/stddef.h> |
d72da4a4d rbtree: Make lock... |
33 |
#include <linux/rcupdate.h> |
1da177e4c Linux-2.6.12-rc2 |
34 |
|
bf7ad8eea rbtree: move some... |
35 36 |
struct rb_node { unsigned long __rb_parent_color; |
1da177e4c Linux-2.6.12-rc2 |
37 38 |
struct rb_node *rb_right; struct rb_node *rb_left; |
e977145ae [RBTREE] Add expl... |
39 40 |
} __attribute__((aligned(sizeof(long)))); /* The alignment might seem pointless, but allegedly CRIS needs it */ |
1da177e4c Linux-2.6.12-rc2 |
41 |
|
bf7ad8eea rbtree: move some... |
42 |
struct rb_root { |
1da177e4c Linux-2.6.12-rc2 |
43 44 |
struct rb_node *rb_node; }; |
55a981027 [RBTREE] Merge co... |
45 |
|
bf7ad8eea rbtree: move some... |
46 |
#define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) |
55a981027 [RBTREE] Merge co... |
47 |
|
b945d6b25 rbtree: Undo augm... |
48 |
#define RB_ROOT (struct rb_root) { NULL, } |
1da177e4c Linux-2.6.12-rc2 |
49 |
#define rb_entry(ptr, type, member) container_of(ptr, type, member) |
4c199a93a rbtree: empty nod... |
50 |
#define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL) |
7647f14fe lib/rbtree.c: fix... |
51 |
/* 'empty' nodes are nodes that are known not to be inserted in an rbtree */ |
bf7ad8eea rbtree: move some... |
52 53 54 55 |
#define RB_EMPTY_NODE(node) \ ((node)->__rb_parent_color == (unsigned long)(node)) #define RB_CLEAR_NODE(node) \ ((node)->__rb_parent_color = (unsigned long)(node)) |
dd67d0515 [PATCH] rbtree: s... |
56 |
|
88d19cf37 timers: Add rb_in... |
57 |
|
1da177e4c Linux-2.6.12-rc2 |
58 59 |
extern void rb_insert_color(struct rb_node *, struct rb_root *); extern void rb_erase(struct rb_node *, struct rb_root *); |
14b94af0b rbtree: faster au... |
60 |
|
1da177e4c Linux-2.6.12-rc2 |
61 |
/* Find logical next and previous nodes in a tree */ |
f4b477c47 rbtree: add const... |
62 63 64 65 |
extern struct rb_node *rb_next(const struct rb_node *); extern struct rb_node *rb_prev(const struct rb_node *); extern struct rb_node *rb_first(const struct rb_root *); extern struct rb_node *rb_last(const struct rb_root *); |
1da177e4c Linux-2.6.12-rc2 |
66 |
|
9dee5c515 rbtree: add posto... |
67 68 69 |
/* Postorder iteration - always visit the parent after its children */ extern struct rb_node *rb_first_postorder(const struct rb_root *); extern struct rb_node *rb_next_postorder(const struct rb_node *); |
1da177e4c Linux-2.6.12-rc2 |
70 |
/* Fast replacement of a single node without remove/rebalance/add/rebalance */ |
d72da4a4d rbtree: Make lock... |
71 |
extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, |
1da177e4c Linux-2.6.12-rc2 |
72 |
struct rb_root *root); |
d72da4a4d rbtree: Make lock... |
73 74 |
static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, struct rb_node **rb_link) |
1da177e4c Linux-2.6.12-rc2 |
75 |
{ |
bf7ad8eea rbtree: move some... |
76 |
node->__rb_parent_color = (unsigned long)parent; |
1da177e4c Linux-2.6.12-rc2 |
77 78 79 80 |
node->rb_left = node->rb_right = NULL; *rb_link = node; } |
d72da4a4d rbtree: Make lock... |
81 82 83 84 85 86 87 88 |
static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, struct rb_node **rb_link) { node->__rb_parent_color = (unsigned long)parent; node->rb_left = node->rb_right = NULL; rcu_assign_pointer(*rb_link, node); } |
1310a5a99 rbtree: fix rbtre... |
89 90 91 92 |
#define rb_entry_safe(ptr, type, member) \ ({ typeof(ptr) ____ptr = (ptr); \ ____ptr ? rb_entry(____ptr, type, member) : NULL; \ }) |
2b5290892 rbtree: add rbtre... |
93 |
/** |
8de1ee7eb rbtree: clarify d... |
94 95 |
* rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of * given type allowing the backing memory of @pos to be invalidated |
2b5290892 rbtree: add rbtre... |
96 97 98 99 100 |
* * @pos: the 'type *' to use as a loop cursor. * @n: another 'type *' to use as temporary storage * @root: 'rb_root *' of the rbtree. * @field: the name of the rb_node field within 'type'. |
8de1ee7eb rbtree: clarify d... |
101 102 103 104 105 106 107 108 |
* * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as * list_for_each_entry_safe() and allows the iteration to continue independent * of changes to @pos by the body of the loop. * * Note, however, that it cannot handle other modifications that re-order the * rbtree it is iterating over. This includes calling rb_erase() on @pos, as * rb_erase() may rebalance the tree, causing us to miss some nodes. |
2b5290892 rbtree: add rbtre... |
109 110 |
*/ #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ |
1310a5a99 rbtree: fix rbtre... |
111 112 113 114 |
for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \ pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \ typeof(*pos), field); 1; }); \ pos = n) |
2b5290892 rbtree: add rbtre... |
115 |
|
1da177e4c Linux-2.6.12-rc2 |
116 |
#endif /* _LINUX_RBTREE_H */ |