3 (C) 1999 Andrea Arcangeli <andrea@suse.de>
4 (C) 2002 David Woodhouse <dwmw2@infradead.org>
6 This program is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2 of the License, or
9 (at your option) any later version.
11 This program is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with this program; if not, write to the Free Software
18 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
23 #include <linux/rbtree.h>
24 #include <linux/export.h>
27 * red-black trees properties: http://en.wikipedia.org/wiki/Rbtree
29 * 1) A node is either red or black
30 * 2) The root is black
31 * 3) All leaves (NULL) are black
32 * 4) Both children of every red node are black
33 * 5) Every simple path from root to leaves contains the same number
36 * 4 and 5 give the O(log n) guarantee, since 4 implies you cannot have two
37 * consecutive red nodes in a path and every red node is therefore followed by
38 * a black. So if B is the number of black nodes on every simple path (as per
39 * 5), then the longest possible path due to 4 is 2B.
41 * We shall indicate color with case, where black nodes are uppercase and red
42 * nodes will be lowercase.
48 #define rb_color(r) ((r)->__rb_parent_color & 1)
49 #define rb_is_red(r) (!rb_color(r))
50 #define rb_is_black(r) rb_color(r)
51 #define rb_set_red(r) do { (r)->__rb_parent_color &= ~1; } while (0)
52 #define rb_set_black(r) do { (r)->__rb_parent_color |= 1; } while (0)
54 static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)
56 rb->__rb_parent_color = rb_color(rb) | (unsigned long)p;
58 static inline void rb_set_color(struct rb_node *rb, int color)
60 rb->__rb_parent_color = (rb->__rb_parent_color & ~1) | color;
63 static inline void rb_set_parent_color(struct rb_node *rb,
64 struct rb_node *p, int color)
66 rb->__rb_parent_color = (unsigned long)p | color;
69 static inline struct rb_node *rb_red_parent(struct rb_node *red)
71 return (struct rb_node *)red->__rb_parent_color;
74 static void __rb_rotate_left(struct rb_node *node, struct rb_root *root)
76 struct rb_node *right = node->rb_right;
77 struct rb_node *parent = rb_parent(node);
79 if ((node->rb_right = right->rb_left))
80 rb_set_parent(right->rb_left, node);
81 right->rb_left = node;
83 rb_set_parent(right, parent);
87 if (node == parent->rb_left)
88 parent->rb_left = right;
90 parent->rb_right = right;
93 root->rb_node = right;
94 rb_set_parent(node, right);
97 static void __rb_rotate_right(struct rb_node *node, struct rb_root *root)
99 struct rb_node *left = node->rb_left;
100 struct rb_node *parent = rb_parent(node);
102 if ((node->rb_left = left->rb_right))
103 rb_set_parent(left->rb_right, node);
104 left->rb_right = node;
106 rb_set_parent(left, parent);
110 if (node == parent->rb_right)
111 parent->rb_right = left;
113 parent->rb_left = left;
116 root->rb_node = left;
117 rb_set_parent(node, left);
121 * Helper function for rotations:
122 * - old's parent and color get assigned to new
123 * - old gets assigned new as a parent and 'color' as a color.
126 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,
127 struct rb_root *root, int color)
129 struct rb_node *parent = rb_parent(old);
130 new->__rb_parent_color = old->__rb_parent_color;
131 rb_set_parent_color(old, new, color);
133 if (parent->rb_left == old)
134 parent->rb_left = new;
136 parent->rb_right = new;
141 void rb_insert_color(struct rb_node *node, struct rb_root *root)
143 struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;
147 * Loop invariant: node is red
149 * If there is a black parent, we are done.
150 * Otherwise, take some corrective action as we don't
151 * want a red root or two consecutive red nodes.
154 rb_set_parent_color(node, NULL, RB_BLACK);
156 } else if (rb_is_black(parent))
159 gparent = rb_red_parent(parent);
161 if (parent == gparent->rb_left) {
162 tmp = gparent->rb_right;
163 if (tmp && rb_is_red(tmp)) {
165 * Case 1 - color flips
173 * However, since g's parent might be red, and
174 * 4) does not allow this, we need to recurse
177 rb_set_parent_color(tmp, gparent, RB_BLACK);
178 rb_set_parent_color(parent, gparent, RB_BLACK);
180 parent = rb_parent(node);
181 rb_set_parent_color(node, parent, RB_RED);
185 if (parent->rb_right == node) {
187 * Case 2 - left rotate at parent
195 * This still leaves us in violation of 4), the
196 * continuation into Case 3 will fix that.
198 parent->rb_right = tmp = node->rb_left;
199 node->rb_left = parent;
201 rb_set_parent_color(tmp, parent,
203 rb_set_parent_color(parent, node, RB_RED);
208 * Case 3 - right rotate at gparent
216 gparent->rb_left = tmp = parent->rb_right;
217 parent->rb_right = gparent;
219 rb_set_parent_color(tmp, gparent, RB_BLACK);
220 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
223 tmp = gparent->rb_left;
224 if (tmp && rb_is_red(tmp)) {
225 /* Case 1 - color flips */
226 rb_set_parent_color(tmp, gparent, RB_BLACK);
227 rb_set_parent_color(parent, gparent, RB_BLACK);
229 parent = rb_parent(node);
230 rb_set_parent_color(node, parent, RB_RED);
234 if (parent->rb_left == node) {
235 /* Case 2 - right rotate at parent */
236 parent->rb_left = tmp = node->rb_right;
237 node->rb_right = parent;
239 rb_set_parent_color(tmp, parent,
241 rb_set_parent_color(parent, node, RB_RED);
245 /* Case 3 - left rotate at gparent */
246 gparent->rb_right = tmp = parent->rb_left;
247 parent->rb_left = gparent;
249 rb_set_parent_color(tmp, gparent, RB_BLACK);
250 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
255 EXPORT_SYMBOL(rb_insert_color);
257 static void __rb_erase_color(struct rb_node *node, struct rb_node *parent,
258 struct rb_root *root)
260 struct rb_node *other;
264 * Loop invariant: all leaf paths going through node have a
265 * black node count that is 1 lower than other leaf paths.
267 * If node is red, we can flip it to black to adjust.
268 * If node is the root, all leaf paths go through it.
269 * Otherwise, we need to adjust the tree through color flips
270 * and tree rotations as per one of the 4 cases below.
272 if (node && rb_is_red(node)) {
275 } else if (!parent) {
277 } else if (parent->rb_left == node) {
278 other = parent->rb_right;
279 if (rb_is_red(other))
283 __rb_rotate_left(parent, root);
284 other = parent->rb_right;
286 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
287 (!other->rb_right || rb_is_black(other->rb_right)))
291 parent = rb_parent(node);
295 if (!other->rb_right || rb_is_black(other->rb_right))
297 rb_set_black(other->rb_left);
299 __rb_rotate_right(other, root);
300 other = parent->rb_right;
302 rb_set_color(other, rb_color(parent));
303 rb_set_black(parent);
304 rb_set_black(other->rb_right);
305 __rb_rotate_left(parent, root);
309 other = parent->rb_left;
310 if (rb_is_red(other))
314 __rb_rotate_right(parent, root);
315 other = parent->rb_left;
317 if ((!other->rb_left || rb_is_black(other->rb_left)) &&
318 (!other->rb_right || rb_is_black(other->rb_right)))
322 parent = rb_parent(node);
326 if (!other->rb_left || rb_is_black(other->rb_left))
328 rb_set_black(other->rb_right);
330 __rb_rotate_left(other, root);
331 other = parent->rb_left;
333 rb_set_color(other, rb_color(parent));
334 rb_set_black(parent);
335 rb_set_black(other->rb_left);
336 __rb_rotate_right(parent, root);
343 void rb_erase(struct rb_node *node, struct rb_root *root)
345 struct rb_node *child, *parent;
349 child = node->rb_right;
350 else if (!node->rb_right)
351 child = node->rb_left;
354 struct rb_node *old = node, *left;
356 node = node->rb_right;
357 while ((left = node->rb_left) != NULL)
360 if (rb_parent(old)) {
361 if (rb_parent(old)->rb_left == old)
362 rb_parent(old)->rb_left = node;
364 rb_parent(old)->rb_right = node;
366 root->rb_node = node;
368 child = node->rb_right;
369 parent = rb_parent(node);
370 color = rb_color(node);
376 rb_set_parent(child, parent);
377 parent->rb_left = child;
379 node->rb_right = old->rb_right;
380 rb_set_parent(old->rb_right, node);
383 node->__rb_parent_color = old->__rb_parent_color;
384 node->rb_left = old->rb_left;
385 rb_set_parent(old->rb_left, node);
390 parent = rb_parent(node);
391 color = rb_color(node);
394 rb_set_parent(child, parent);
397 if (parent->rb_left == node)
398 parent->rb_left = child;
400 parent->rb_right = child;
403 root->rb_node = child;
406 if (color == RB_BLACK)
407 __rb_erase_color(child, parent, root);
409 EXPORT_SYMBOL(rb_erase);
411 static void rb_augment_path(struct rb_node *node, rb_augment_f func, void *data)
413 struct rb_node *parent;
417 parent = rb_parent(node);
421 if (node == parent->rb_left && parent->rb_right)
422 func(parent->rb_right, data);
423 else if (parent->rb_left)
424 func(parent->rb_left, data);
431 * after inserting @node into the tree, update the tree to account for
432 * both the new entry and any damage done by rebalance
434 void rb_augment_insert(struct rb_node *node, rb_augment_f func, void *data)
437 node = node->rb_left;
438 else if (node->rb_right)
439 node = node->rb_right;
441 rb_augment_path(node, func, data);
443 EXPORT_SYMBOL(rb_augment_insert);
446 * before removing the node, find the deepest node on the rebalance path
447 * that will still be there after @node gets removed
449 struct rb_node *rb_augment_erase_begin(struct rb_node *node)
451 struct rb_node *deepest;
453 if (!node->rb_right && !node->rb_left)
454 deepest = rb_parent(node);
455 else if (!node->rb_right)
456 deepest = node->rb_left;
457 else if (!node->rb_left)
458 deepest = node->rb_right;
460 deepest = rb_next(node);
461 if (deepest->rb_right)
462 deepest = deepest->rb_right;
463 else if (rb_parent(deepest) != node)
464 deepest = rb_parent(deepest);
469 EXPORT_SYMBOL(rb_augment_erase_begin);
472 * after removal, update the tree to account for the removed entry
473 * and any rebalance damage.
475 void rb_augment_erase_end(struct rb_node *node, rb_augment_f func, void *data)
478 rb_augment_path(node, func, data);
480 EXPORT_SYMBOL(rb_augment_erase_end);
483 * This function returns the first node (in sort order) of the tree.
485 struct rb_node *rb_first(const struct rb_root *root)
496 EXPORT_SYMBOL(rb_first);
498 struct rb_node *rb_last(const struct rb_root *root)
509 EXPORT_SYMBOL(rb_last);
511 struct rb_node *rb_next(const struct rb_node *node)
513 struct rb_node *parent;
515 if (RB_EMPTY_NODE(node))
518 /* If we have a right-hand child, go down and then left as far
520 if (node->rb_right) {
521 node = node->rb_right;
522 while (node->rb_left)
524 return (struct rb_node *)node;
527 /* No right-hand children. Everything down and left is
528 smaller than us, so any 'next' node must be in the general
529 direction of our parent. Go up the tree; any time the
530 ancestor is a right-hand child of its parent, keep going
531 up. First time it's a left-hand child of its parent, said
532 parent is our 'next' node. */
533 while ((parent = rb_parent(node)) && node == parent->rb_right)
538 EXPORT_SYMBOL(rb_next);
540 struct rb_node *rb_prev(const struct rb_node *node)
542 struct rb_node *parent;
544 if (RB_EMPTY_NODE(node))
547 /* If we have a left-hand child, go down and then right as far
550 node = node->rb_left;
551 while (node->rb_right)
553 return (struct rb_node *)node;
556 /* No left-hand children. Go up till we find an ancestor which
557 is a right-hand child of its parent */
558 while ((parent = rb_parent(node)) && node == parent->rb_left)
563 EXPORT_SYMBOL(rb_prev);
565 void rb_replace_node(struct rb_node *victim, struct rb_node *new,
566 struct rb_root *root)
568 struct rb_node *parent = rb_parent(victim);
570 /* Set the surrounding nodes to point to the replacement */
572 if (victim == parent->rb_left)
573 parent->rb_left = new;
575 parent->rb_right = new;
580 rb_set_parent(victim->rb_left, new);
581 if (victim->rb_right)
582 rb_set_parent(victim->rb_right, new);
584 /* Copy the pointers/colour from the victim to the replacement */
587 EXPORT_SYMBOL(rb_replace_node);