1 /* $OpenBSD: tree.h,v 1.13 2011/07/09 00:19:45 pirofti Exp $ */
3 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27 /* OPENBSD ORIGINAL: sys/sys/tree.h */
30 #ifdef NO_ATTRIBUTE_ON_RETURN_TYPE
31 # define __attribute__(x)
38 * This file defines data structures for different types of trees:
39 * splay trees and red-black trees.
41 * A splay tree is a self-organizing data structure. Every operation
42 * on the tree causes a splay to happen. The splay moves the requested
43 * node to the root of the tree and partly rebalances it.
45 * This has the benefit that request locality causes faster lookups as
46 * the requested nodes move to the top of the tree. On the other hand,
47 * every lookup causes memory writes.
49 * The Balance Theorem bounds the total access time for m operations
50 * and n inserts on an initially empty tree as O((m + n)lg n). The
51 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
53 * A red-black tree is a binary search tree with the node color as an
54 * extra attribute. It fulfills a set of conditions:
55 * - every search path from the root to a leaf consists of the
56 * same number of black nodes,
57 * - each red node (except for the root) has a black parent,
58 * - each leaf node is black.
60 * Every operation on a red-black tree is bounded as O(lg n).
61 * The maximum height of a red-black tree is 2lg (n+1).
64 #define SPLAY_HEAD(name, type) \
66 struct type *sph_root; /* root of the tree */ \
69 #define SPLAY_INITIALIZER(root) \
72 #define SPLAY_INIT(root) do { \
73 (root)->sph_root = NULL; \
76 #define SPLAY_ENTRY(type) \
78 struct type *spe_left; /* left element */ \
79 struct type *spe_right; /* right element */ \
82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
84 #define SPLAY_ROOT(head) (head)->sph_root
85 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
87 /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
88 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
89 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
90 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
91 (head)->sph_root = tmp; \
94 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
95 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 (head)->sph_root = tmp; \
100 #define SPLAY_LINKLEFT(head, tmp, field) do { \
101 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
102 tmp = (head)->sph_root; \
103 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
106 #define SPLAY_LINKRIGHT(head, tmp, field) do { \
107 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
108 tmp = (head)->sph_root; \
109 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
112 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
113 SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
114 SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
115 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
116 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
119 /* Generates prototypes and inline functions */
121 #define SPLAY_PROTOTYPE(name, type, field, cmp) \
122 void name##_SPLAY(struct name *, struct type *); \
123 void name##_SPLAY_MINMAX(struct name *, int); \
124 struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
125 struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
127 /* Finds the node with the same key as elm */ \
128 static __inline struct type * \
129 name##_SPLAY_FIND(struct name *head, struct type *elm) \
131 if (SPLAY_EMPTY(head)) \
133 name##_SPLAY(head, elm); \
134 if ((cmp)(elm, (head)->sph_root) == 0) \
135 return (head->sph_root); \
139 static __inline struct type * \
140 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
142 name##_SPLAY(head, elm); \
143 if (SPLAY_RIGHT(elm, field) != NULL) { \
144 elm = SPLAY_RIGHT(elm, field); \
145 while (SPLAY_LEFT(elm, field) != NULL) { \
146 elm = SPLAY_LEFT(elm, field); \
153 static __inline struct type * \
154 name##_SPLAY_MIN_MAX(struct name *head, int val) \
156 name##_SPLAY_MINMAX(head, val); \
157 return (SPLAY_ROOT(head)); \
160 /* Main splay operation.
161 * Moves node close to the key of elm to top
163 #define SPLAY_GENERATE(name, type, field, cmp) \
165 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
167 if (SPLAY_EMPTY(head)) { \
168 SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
171 name##_SPLAY(head, elm); \
172 __comp = (cmp)(elm, (head)->sph_root); \
174 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
175 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
176 SPLAY_LEFT((head)->sph_root, field) = NULL; \
177 } else if (__comp > 0) { \
178 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
179 SPLAY_LEFT(elm, field) = (head)->sph_root; \
180 SPLAY_RIGHT((head)->sph_root, field) = NULL; \
182 return ((head)->sph_root); \
184 (head)->sph_root = (elm); \
189 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
191 struct type *__tmp; \
192 if (SPLAY_EMPTY(head)) \
194 name##_SPLAY(head, elm); \
195 if ((cmp)(elm, (head)->sph_root) == 0) { \
196 if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
197 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
199 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
200 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
201 name##_SPLAY(head, elm); \
202 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
210 name##_SPLAY(struct name *head, struct type *elm) \
212 struct type __node, *__left, *__right, *__tmp; \
215 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
216 __left = __right = &__node; \
218 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
220 __tmp = SPLAY_LEFT((head)->sph_root, field); \
223 if ((cmp)(elm, __tmp) < 0){ \
224 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
225 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
228 SPLAY_LINKLEFT(head, __right, field); \
229 } else if (__comp > 0) { \
230 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
233 if ((cmp)(elm, __tmp) > 0){ \
234 SPLAY_ROTATE_LEFT(head, __tmp, field); \
235 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
238 SPLAY_LINKRIGHT(head, __left, field); \
241 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
244 /* Splay with either the minimum or the maximum element \
245 * Used to find minimum or maximum element in tree. \
247 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
249 struct type __node, *__left, *__right, *__tmp; \
251 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
252 __left = __right = &__node; \
256 __tmp = SPLAY_LEFT((head)->sph_root, field); \
260 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
261 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
264 SPLAY_LINKLEFT(head, __right, field); \
265 } else if (__comp > 0) { \
266 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
270 SPLAY_ROTATE_LEFT(head, __tmp, field); \
271 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
274 SPLAY_LINKRIGHT(head, __left, field); \
277 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
280 #define SPLAY_NEGINF -1
283 #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y)
284 #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
285 #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
286 #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
287 #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
288 : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
289 #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
290 : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
292 #define SPLAY_FOREACH(x, name, head) \
293 for ((x) = SPLAY_MIN(name, head); \
295 (x) = SPLAY_NEXT(name, head, x))
297 /* Macros that define a red-black tree */
298 #define RB_HEAD(name, type) \
300 struct type *rbh_root; /* root of the tree */ \
303 #define RB_INITIALIZER(root) \
306 #define RB_INIT(root) do { \
307 (root)->rbh_root = NULL; \
312 #define RB_ENTRY(type) \
314 struct type *rbe_left; /* left element */ \
315 struct type *rbe_right; /* right element */ \
316 struct type *rbe_parent; /* parent element */ \
317 int rbe_color; /* node color */ \
320 #define RB_LEFT(elm, field) (elm)->field.rbe_left
321 #define RB_RIGHT(elm, field) (elm)->field.rbe_right
322 #define RB_PARENT(elm, field) (elm)->field.rbe_parent
323 #define RB_COLOR(elm, field) (elm)->field.rbe_color
324 #define RB_ROOT(head) (head)->rbh_root
325 #define RB_EMPTY(head) (RB_ROOT(head) == NULL)
327 #define RB_SET(elm, parent, field) do { \
328 RB_PARENT(elm, field) = parent; \
329 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
330 RB_COLOR(elm, field) = RB_RED; \
333 #define RB_SET_BLACKRED(black, red, field) do { \
334 RB_COLOR(black, field) = RB_BLACK; \
335 RB_COLOR(red, field) = RB_RED; \
339 #define RB_AUGMENT(x) do {} while (0)
342 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
343 (tmp) = RB_RIGHT(elm, field); \
344 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
345 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
348 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
349 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
350 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
352 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
354 (head)->rbh_root = (tmp); \
355 RB_LEFT(tmp, field) = (elm); \
356 RB_PARENT(elm, field) = (tmp); \
358 if ((RB_PARENT(tmp, field))) \
359 RB_AUGMENT(RB_PARENT(tmp, field)); \
362 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
363 (tmp) = RB_LEFT(elm, field); \
364 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
365 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
368 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
369 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
370 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
372 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
374 (head)->rbh_root = (tmp); \
375 RB_RIGHT(tmp, field) = (elm); \
376 RB_PARENT(elm, field) = (tmp); \
378 if ((RB_PARENT(tmp, field))) \
379 RB_AUGMENT(RB_PARENT(tmp, field)); \
382 /* Generates prototypes and inline functions */
383 #define RB_PROTOTYPE(name, type, field, cmp) \
384 RB_PROTOTYPE_INTERNAL(name, type, field, cmp,)
385 #define RB_PROTOTYPE_STATIC(name, type, field, cmp) \
386 RB_PROTOTYPE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static)
387 #define RB_PROTOTYPE_INTERNAL(name, type, field, cmp, attr) \
388 attr void name##_RB_INSERT_COLOR(struct name *, struct type *); \
389 attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *);\
390 attr struct type *name##_RB_REMOVE(struct name *, struct type *); \
391 attr struct type *name##_RB_INSERT(struct name *, struct type *); \
392 attr struct type *name##_RB_FIND(struct name *, struct type *); \
393 attr struct type *name##_RB_NFIND(struct name *, struct type *); \
394 attr struct type *name##_RB_NEXT(struct type *); \
395 attr struct type *name##_RB_PREV(struct type *); \
396 attr struct type *name##_RB_MINMAX(struct name *, int); \
399 /* Main rb operation.
400 * Moves node close to the key of elm to top
402 #define RB_GENERATE(name, type, field, cmp) \
403 RB_GENERATE_INTERNAL(name, type, field, cmp,)
404 #define RB_GENERATE_STATIC(name, type, field, cmp) \
405 RB_GENERATE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static)
406 #define RB_GENERATE_INTERNAL(name, type, field, cmp, attr) \
408 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
410 struct type *parent, *gparent, *tmp; \
411 while ((parent = RB_PARENT(elm, field)) && \
412 RB_COLOR(parent, field) == RB_RED) { \
413 gparent = RB_PARENT(parent, field); \
414 if (parent == RB_LEFT(gparent, field)) { \
415 tmp = RB_RIGHT(gparent, field); \
416 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
417 RB_COLOR(tmp, field) = RB_BLACK; \
418 RB_SET_BLACKRED(parent, gparent, field);\
422 if (RB_RIGHT(parent, field) == elm) { \
423 RB_ROTATE_LEFT(head, parent, tmp, field);\
428 RB_SET_BLACKRED(parent, gparent, field); \
429 RB_ROTATE_RIGHT(head, gparent, tmp, field); \
431 tmp = RB_LEFT(gparent, field); \
432 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
433 RB_COLOR(tmp, field) = RB_BLACK; \
434 RB_SET_BLACKRED(parent, gparent, field);\
438 if (RB_LEFT(parent, field) == elm) { \
439 RB_ROTATE_RIGHT(head, parent, tmp, field);\
444 RB_SET_BLACKRED(parent, gparent, field); \
445 RB_ROTATE_LEFT(head, gparent, tmp, field); \
448 RB_COLOR(head->rbh_root, field) = RB_BLACK; \
452 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
455 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
456 elm != RB_ROOT(head)) { \
457 if (RB_LEFT(parent, field) == elm) { \
458 tmp = RB_RIGHT(parent, field); \
459 if (RB_COLOR(tmp, field) == RB_RED) { \
460 RB_SET_BLACKRED(tmp, parent, field); \
461 RB_ROTATE_LEFT(head, parent, tmp, field);\
462 tmp = RB_RIGHT(parent, field); \
464 if ((RB_LEFT(tmp, field) == NULL || \
465 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
466 (RB_RIGHT(tmp, field) == NULL || \
467 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
468 RB_COLOR(tmp, field) = RB_RED; \
470 parent = RB_PARENT(elm, field); \
472 if (RB_RIGHT(tmp, field) == NULL || \
473 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
474 struct type *oleft; \
475 if ((oleft = RB_LEFT(tmp, field)))\
476 RB_COLOR(oleft, field) = RB_BLACK;\
477 RB_COLOR(tmp, field) = RB_RED; \
478 RB_ROTATE_RIGHT(head, tmp, oleft, field);\
479 tmp = RB_RIGHT(parent, field); \
481 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
482 RB_COLOR(parent, field) = RB_BLACK; \
483 if (RB_RIGHT(tmp, field)) \
484 RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
485 RB_ROTATE_LEFT(head, parent, tmp, field);\
486 elm = RB_ROOT(head); \
490 tmp = RB_LEFT(parent, field); \
491 if (RB_COLOR(tmp, field) == RB_RED) { \
492 RB_SET_BLACKRED(tmp, parent, field); \
493 RB_ROTATE_RIGHT(head, parent, tmp, field);\
494 tmp = RB_LEFT(parent, field); \
496 if ((RB_LEFT(tmp, field) == NULL || \
497 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
498 (RB_RIGHT(tmp, field) == NULL || \
499 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
500 RB_COLOR(tmp, field) = RB_RED; \
502 parent = RB_PARENT(elm, field); \
504 if (RB_LEFT(tmp, field) == NULL || \
505 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
506 struct type *oright; \
507 if ((oright = RB_RIGHT(tmp, field)))\
508 RB_COLOR(oright, field) = RB_BLACK;\
509 RB_COLOR(tmp, field) = RB_RED; \
510 RB_ROTATE_LEFT(head, tmp, oright, field);\
511 tmp = RB_LEFT(parent, field); \
513 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
514 RB_COLOR(parent, field) = RB_BLACK; \
515 if (RB_LEFT(tmp, field)) \
516 RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
517 RB_ROTATE_RIGHT(head, parent, tmp, field);\
518 elm = RB_ROOT(head); \
524 RB_COLOR(elm, field) = RB_BLACK; \
528 name##_RB_REMOVE(struct name *head, struct type *elm) \
530 struct type *child, *parent, *old = elm; \
532 if (RB_LEFT(elm, field) == NULL) \
533 child = RB_RIGHT(elm, field); \
534 else if (RB_RIGHT(elm, field) == NULL) \
535 child = RB_LEFT(elm, field); \
538 elm = RB_RIGHT(elm, field); \
539 while ((left = RB_LEFT(elm, field))) \
541 child = RB_RIGHT(elm, field); \
542 parent = RB_PARENT(elm, field); \
543 color = RB_COLOR(elm, field); \
545 RB_PARENT(child, field) = parent; \
547 if (RB_LEFT(parent, field) == elm) \
548 RB_LEFT(parent, field) = child; \
550 RB_RIGHT(parent, field) = child; \
551 RB_AUGMENT(parent); \
553 RB_ROOT(head) = child; \
554 if (RB_PARENT(elm, field) == old) \
556 (elm)->field = (old)->field; \
557 if (RB_PARENT(old, field)) { \
558 if (RB_LEFT(RB_PARENT(old, field), field) == old)\
559 RB_LEFT(RB_PARENT(old, field), field) = elm;\
561 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
562 RB_AUGMENT(RB_PARENT(old, field)); \
564 RB_ROOT(head) = elm; \
565 RB_PARENT(RB_LEFT(old, field), field) = elm; \
566 if (RB_RIGHT(old, field)) \
567 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
572 } while ((left = RB_PARENT(left, field))); \
576 parent = RB_PARENT(elm, field); \
577 color = RB_COLOR(elm, field); \
579 RB_PARENT(child, field) = parent; \
581 if (RB_LEFT(parent, field) == elm) \
582 RB_LEFT(parent, field) = child; \
584 RB_RIGHT(parent, field) = child; \
585 RB_AUGMENT(parent); \
587 RB_ROOT(head) = child; \
589 if (color == RB_BLACK) \
590 name##_RB_REMOVE_COLOR(head, parent, child); \
594 /* Inserts a node into the RB tree */ \
596 name##_RB_INSERT(struct name *head, struct type *elm) \
599 struct type *parent = NULL; \
601 tmp = RB_ROOT(head); \
604 comp = (cmp)(elm, parent); \
606 tmp = RB_LEFT(tmp, field); \
608 tmp = RB_RIGHT(tmp, field); \
612 RB_SET(elm, parent, field); \
613 if (parent != NULL) { \
615 RB_LEFT(parent, field) = elm; \
617 RB_RIGHT(parent, field) = elm; \
618 RB_AUGMENT(parent); \
620 RB_ROOT(head) = elm; \
621 name##_RB_INSERT_COLOR(head, elm); \
625 /* Finds the node with the same key as elm */ \
627 name##_RB_FIND(struct name *head, struct type *elm) \
629 struct type *tmp = RB_ROOT(head); \
632 comp = cmp(elm, tmp); \
634 tmp = RB_LEFT(tmp, field); \
636 tmp = RB_RIGHT(tmp, field); \
643 /* Finds the first node greater than or equal to the search key */ \
645 name##_RB_NFIND(struct name *head, struct type *elm) \
647 struct type *tmp = RB_ROOT(head); \
648 struct type *res = NULL; \
651 comp = cmp(elm, tmp); \
654 tmp = RB_LEFT(tmp, field); \
657 tmp = RB_RIGHT(tmp, field); \
666 name##_RB_NEXT(struct type *elm) \
668 if (RB_RIGHT(elm, field)) { \
669 elm = RB_RIGHT(elm, field); \
670 while (RB_LEFT(elm, field)) \
671 elm = RB_LEFT(elm, field); \
673 if (RB_PARENT(elm, field) && \
674 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
675 elm = RB_PARENT(elm, field); \
677 while (RB_PARENT(elm, field) && \
678 (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
679 elm = RB_PARENT(elm, field); \
680 elm = RB_PARENT(elm, field); \
688 name##_RB_PREV(struct type *elm) \
690 if (RB_LEFT(elm, field)) { \
691 elm = RB_LEFT(elm, field); \
692 while (RB_RIGHT(elm, field)) \
693 elm = RB_RIGHT(elm, field); \
695 if (RB_PARENT(elm, field) && \
696 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
697 elm = RB_PARENT(elm, field); \
699 while (RB_PARENT(elm, field) && \
700 (elm == RB_LEFT(RB_PARENT(elm, field), field)))\
701 elm = RB_PARENT(elm, field); \
702 elm = RB_PARENT(elm, field); \
709 name##_RB_MINMAX(struct name *head, int val) \
711 struct type *tmp = RB_ROOT(head); \
712 struct type *parent = NULL; \
716 tmp = RB_LEFT(tmp, field); \
718 tmp = RB_RIGHT(tmp, field); \
726 #define RB_INSERT(name, x, y) name##_RB_INSERT(x, y)
727 #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y)
728 #define RB_FIND(name, x, y) name##_RB_FIND(x, y)
729 #define RB_NFIND(name, x, y) name##_RB_NFIND(x, y)
730 #define RB_NEXT(name, x, y) name##_RB_NEXT(y)
731 #define RB_PREV(name, x, y) name##_RB_PREV(y)
732 #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF)
733 #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF)
735 #define RB_FOREACH(x, name, head) \
736 for ((x) = RB_MIN(name, head); \
738 (x) = name##_RB_NEXT(x))
740 #define RB_FOREACH_SAFE(x, name, head, y) \
741 for ((x) = RB_MIN(name, head); \
742 ((x) != NULL) && ((y) = name##_RB_NEXT(x), 1); \
745 #define RB_FOREACH_REVERSE(x, name, head) \
746 for ((x) = RB_MAX(name, head); \
748 (x) = name##_RB_PREV(x))
750 #define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \
751 for ((x) = RB_MAX(name, head); \
752 ((x) != NULL) && ((y) = name##_RB_PREV(x), 1); \
755 #endif /* _SYS_TREE_H_ */