Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 1 | /* |
| 2 | Red Black Trees |
| 3 | (C) 1999 Andrea Arcangeli <andrea@suse.de> |
| 4 | |
| 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. |
| 9 | |
| 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. |
| 14 | |
| 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 |
| 18 | |
| 19 | linux/include/linux/rbtree.h |
| 20 | |
| 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... |
| 25 | |
Michel Lespinasse | 1457d28 | 2012-10-08 16:30:28 -0700 | [diff] [blame] | 26 | See Documentation/rbtree.txt for documentation and samples. |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 27 | */ |
| 28 | |
| 29 | #ifndef _LINUX_RBTREE_H |
| 30 | #define _LINUX_RBTREE_H |
| 31 | |
| 32 | #include <linux/kernel.h> |
| 33 | #include <linux/stddef.h> |
| 34 | |
| 35 | struct rb_node |
| 36 | { |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 37 | unsigned long rb_parent_color; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 38 | #define RB_RED 0 |
| 39 | #define RB_BLACK 1 |
| 40 | struct rb_node *rb_right; |
| 41 | struct rb_node *rb_left; |
David Woodhouse | e977145 | 2006-04-21 23:15:39 +0100 | [diff] [blame] | 42 | } __attribute__((aligned(sizeof(long)))); |
| 43 | /* The alignment might seem pointless, but allegedly CRIS needs it */ |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 44 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 45 | struct rb_root |
| 46 | { |
| 47 | struct rb_node *rb_node; |
| 48 | }; |
| 49 | |
David Woodhouse | 55a9810 | 2006-04-21 13:35:51 +0100 | [diff] [blame] | 50 | |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 51 | #define rb_parent(r) ((struct rb_node *)((r)->rb_parent_color & ~3)) |
| 52 | #define rb_color(r) ((r)->rb_parent_color & 1) |
| 53 | #define rb_is_red(r) (!rb_color(r)) |
| 54 | #define rb_is_black(r) rb_color(r) |
| 55 | #define rb_set_red(r) do { (r)->rb_parent_color &= ~1; } while (0) |
| 56 | #define rb_set_black(r) do { (r)->rb_parent_color |= 1; } while (0) |
David Woodhouse | 55a9810 | 2006-04-21 13:35:51 +0100 | [diff] [blame] | 57 | |
| 58 | static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) |
| 59 | { |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 60 | rb->rb_parent_color = (rb->rb_parent_color & 3) | (unsigned long)p; |
David Woodhouse | 55a9810 | 2006-04-21 13:35:51 +0100 | [diff] [blame] | 61 | } |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 62 | static inline void rb_set_color(struct rb_node *rb, int color) |
David Woodhouse | 55a9810 | 2006-04-21 13:35:51 +0100 | [diff] [blame] | 63 | { |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 64 | rb->rb_parent_color = (rb->rb_parent_color & ~1) | color; |
David Woodhouse | 55a9810 | 2006-04-21 13:35:51 +0100 | [diff] [blame] | 65 | } |
| 66 | |
Peter Zijlstra | b945d6b | 2010-05-29 15:31:43 +0200 | [diff] [blame] | 67 | #define RB_ROOT (struct rb_root) { NULL, } |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 68 | #define rb_entry(ptr, type, member) container_of(ptr, type, member) |
| 69 | |
Michel Lespinasse | 4c199a9 | 2012-10-08 16:30:32 -0700 | [diff] [blame^] | 70 | #define RB_EMPTY_ROOT(root) ((root)->rb_node == NULL) |
Jens Axboe | dd67d05 | 2006-06-21 09:36:18 +0200 | [diff] [blame] | 71 | |
Michel Lespinasse | 4c199a9 | 2012-10-08 16:30:32 -0700 | [diff] [blame^] | 72 | /* 'empty' nodes are nodes that are known not to be inserted in an rbree */ |
| 73 | #define RB_EMPTY_NODE(node) ((node)->rb_parent_color == (unsigned long)(node)) |
| 74 | #define RB_CLEAR_NODE(node) ((node)->rb_parent_color = (unsigned long)(node)) |
| 75 | |
John Stultz | 88d19cf | 2011-01-03 18:59:43 -0800 | [diff] [blame] | 76 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 77 | extern void rb_insert_color(struct rb_node *, struct rb_root *); |
| 78 | extern void rb_erase(struct rb_node *, struct rb_root *); |
| 79 | |
Peter Zijlstra | b945d6b | 2010-05-29 15:31:43 +0200 | [diff] [blame] | 80 | typedef void (*rb_augment_f)(struct rb_node *node, void *data); |
| 81 | |
| 82 | extern void rb_augment_insert(struct rb_node *node, |
| 83 | rb_augment_f func, void *data); |
| 84 | extern struct rb_node *rb_augment_erase_begin(struct rb_node *node); |
| 85 | extern void rb_augment_erase_end(struct rb_node *node, |
| 86 | rb_augment_f func, void *data); |
| 87 | |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 88 | /* Find logical next and previous nodes in a tree */ |
Artem Bityutskiy | f4b477c | 2009-01-10 11:12:09 +0000 | [diff] [blame] | 89 | extern struct rb_node *rb_next(const struct rb_node *); |
| 90 | extern struct rb_node *rb_prev(const struct rb_node *); |
| 91 | extern struct rb_node *rb_first(const struct rb_root *); |
| 92 | extern struct rb_node *rb_last(const struct rb_root *); |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 93 | |
| 94 | /* Fast replacement of a single node without remove/rebalance/add/rebalance */ |
| 95 | extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, |
| 96 | struct rb_root *root); |
| 97 | |
| 98 | static inline void rb_link_node(struct rb_node * node, struct rb_node * parent, |
| 99 | struct rb_node ** rb_link) |
| 100 | { |
David Woodhouse | 2f3243a | 2006-06-05 20:19:05 +0100 | [diff] [blame] | 101 | node->rb_parent_color = (unsigned long )parent; |
Linus Torvalds | 1da177e | 2005-04-16 15:20:36 -0700 | [diff] [blame] | 102 | node->rb_left = node->rb_right = NULL; |
| 103 | |
| 104 | *rb_link = node; |
| 105 | } |
| 106 | |
| 107 | #endif /* _LINUX_RBTREE_H */ |