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 */
29 #ifdef NO_ATTRIBUTE_ON_RETURN_TYPE
30 # define __attribute__(x)
37 * This file defines data structures for different types of trees:
38 * splay trees and red-black trees.
40 * A splay tree is a self-organizing data structure. Every operation
41 * on the tree causes a splay to happen. The splay moves the requested
42 * node to the root of the tree and partly rebalances it.
44 * This has the benefit that request locality causes faster lookups as
45 * the requested nodes move to the top of the tree. On the other hand,
46 * every lookup causes memory writes.
48 * The Balance Theorem bounds the total access time for m operations
49 * and n inserts on an initially empty tree as O((m + n)lg n). The
50 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
52 * A red-black tree is a binary search tree with the node color as an
53 * extra attribute. It fulfills a set of conditions:
54 * - every search path from the root to a leaf consists of the
55 * same number of black nodes,
56 * - each red node (except for the root) has a black parent,
57 * - each leaf node is black.
59 * Every operation on a red-black tree is bounded as O(lg n).
60 * The maximum height of a red-black tree is 2lg (n+1).
63 #define SPLAY_HEAD(name, type) \
65 struct type *sph_root; /* root of the tree */ \
68 #define SPLAY_INITIALIZER(root) \
71 #define SPLAY_INIT(root) do { \
72 (root)->sph_root = NULL; \
75 #define SPLAY_ENTRY(type) \
77 struct type *spe_left; /* left element */ \
78 struct type *spe_right; /* right element */ \
81 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
82 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
83 #define SPLAY_ROOT(head) (head)->sph_root
84 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
86 /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
87 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
88 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
89 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
90 (head)->sph_root = tmp; \
93 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
94 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
95 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
96 (head)->sph_root = tmp; \
99 #define SPLAY_LINKLEFT(head, tmp, field) do { \
100 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
101 tmp = (head)->sph_root; \
102 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
105 #define SPLAY_LINKRIGHT(head, tmp, field) do { \
106 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
107 tmp = (head)->sph_root; \
108 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
111 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
112 SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
113 SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
114 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
115 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
118 /* Generates prototypes and inline functions */
120 #define SPLAY_PROTOTYPE(name, type, field, cmp) \
121 void name##_SPLAY(struct name *, struct type *); \
122 void name##_SPLAY_MINMAX(struct name *, int); \
123 struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
124 struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
126 /* Finds the node with the same key as elm */ \
127 static __inline struct type * \
128 name##_SPLAY_FIND(struct name *head, struct type *elm) \
130 if (SPLAY_EMPTY(head)) \
132 name##_SPLAY(head, elm); \
133 if ((cmp)(elm, (head)->sph_root) == 0) \
134 return (head->sph_root); \
138 static __inline struct type * \
139 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
141 name##_SPLAY(head, elm); \
142 if (SPLAY_RIGHT(elm, field) != NULL) { \
143 elm = SPLAY_RIGHT(elm, field); \
144 while (SPLAY_LEFT(elm, field) != NULL) { \
145 elm = SPLAY_LEFT(elm, field); \
152 static __inline struct type * \
153 name##_SPLAY_MIN_MAX(struct name *head, int val) \
155 name##_SPLAY_MINMAX(head, val); \
156 return (SPLAY_ROOT(head)); \
159 /* Main splay operation.
160 * Moves node close to the key of elm to top
162 #define SPLAY_GENERATE(name, type, field, cmp) \
164 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
166 if (SPLAY_EMPTY(head)) { \
167 SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
170 name##_SPLAY(head, elm); \
171 __comp = (cmp)(elm, (head)->sph_root); \
173 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
174 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
175 SPLAY_LEFT((head)->sph_root, field) = NULL; \
176 } else if (__comp > 0) { \
177 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
178 SPLAY_LEFT(elm, field) = (head)->sph_root; \
179 SPLAY_RIGHT((head)->sph_root, field) = NULL; \
181 return ((head)->sph_root); \
183 (head)->sph_root = (elm); \
188 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
190 struct type *__tmp; \
191 if (SPLAY_EMPTY(head)) \
193 name##_SPLAY(head, elm); \
194 if ((cmp)(elm, (head)->sph_root) == 0) { \
195 if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
196 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
198 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
199 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
200 name##_SPLAY(head, elm); \
201 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
209 name##_SPLAY(struct name *head, struct type *elm) \
211 struct type __node, *__left, *__right, *__tmp; \
214 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
215 __left = __right = &__node; \
217 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
219 __tmp = SPLAY_LEFT((head)->sph_root, field); \
222 if ((cmp)(elm, __tmp) < 0){ \
223 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
224 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
227 SPLAY_LINKLEFT(head, __right, field); \
228 } else if (__comp > 0) { \
229 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
232 if ((cmp)(elm, __tmp) > 0){ \
233 SPLAY_ROTATE_LEFT(head, __tmp, field); \
234 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
237 SPLAY_LINKRIGHT(head, __left, field); \
240 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
243 /* Splay with either the minimum or the maximum element \
244 * Used to find minimum or maximum element in tree. \
246 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
248 struct type __node, *__left, *__right, *__tmp; \
250 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
251 __left = __right = &__node; \
255 __tmp = SPLAY_LEFT((head)->sph_root, field); \
259 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
260 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
263 SPLAY_LINKLEFT(head, __right, field); \
264 } else if (__comp > 0) { \
265 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
269 SPLAY_ROTATE_LEFT(head, __tmp, field); \
270 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
273 SPLAY_LINKRIGHT(head, __left, field); \
276 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
279 #define SPLAY_NEGINF -1
282 #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y)
283 #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
284 #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
285 #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
286 #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
287 : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
288 #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
289 : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
291 #define SPLAY_FOREACH(x, name, head) \
292 for ((x) = SPLAY_MIN(name, head); \
294 (x) = SPLAY_NEXT(name, head, x))
296 /* Macros that define a red-black tree */
297 #define RB_HEAD(name, type) \
299 struct type *rbh_root; /* root of the tree */ \
302 #define RB_INITIALIZER(root) \
305 #define RB_INIT(root) do { \
306 (root)->rbh_root = NULL; \
311 #define RB_ENTRY(type) \
313 struct type *rbe_left; /* left element */ \
314 struct type *rbe_right; /* right element */ \
315 struct type *rbe_parent; /* parent element */ \
316 int rbe_color; /* node color */ \
319 #define RB_LEFT(elm, field) (elm)->field.rbe_left
320 #define RB_RIGHT(elm, field) (elm)->field.rbe_right
321 #define RB_PARENT(elm, field) (elm)->field.rbe_parent
322 #define RB_COLOR(elm, field) (elm)->field.rbe_color
323 #define RB_ROOT(head) (head)->rbh_root
324 #define RB_EMPTY(head) (RB_ROOT(head) == NULL)
326 #define RB_SET(elm, parent, field) do { \
327 RB_PARENT(elm, field) = parent; \
328 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
329 RB_COLOR(elm, field) = RB_RED; \
332 #define RB_SET_BLACKRED(black, red, field) do { \
333 RB_COLOR(black, field) = RB_BLACK; \
334 RB_COLOR(red, field) = RB_RED; \
338 #define RB_AUGMENT(x) do {} while (0)
341 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
342 (tmp) = RB_RIGHT(elm, field); \
343 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
344 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
347 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
348 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
349 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
351 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
353 (head)->rbh_root = (tmp); \
354 RB_LEFT(tmp, field) = (elm); \
355 RB_PARENT(elm, field) = (tmp); \
357 if ((RB_PARENT(tmp, field))) \
358 RB_AUGMENT(RB_PARENT(tmp, field)); \
361 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
362 (tmp) = RB_LEFT(elm, field); \
363 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
364 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
367 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
368 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
369 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
371 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
373 (head)->rbh_root = (tmp); \
374 RB_RIGHT(tmp, field) = (elm); \
375 RB_PARENT(elm, field) = (tmp); \
377 if ((RB_PARENT(tmp, field))) \
378 RB_AUGMENT(RB_PARENT(tmp, field)); \
381 /* Generates prototypes and inline functions */
382 #define RB_PROTOTYPE(name, type, field, cmp) \
383 RB_PROTOTYPE_INTERNAL(name, type, field, cmp,)
384 #define RB_PROTOTYPE_STATIC(name, type, field, cmp) \
385 RB_PROTOTYPE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static)
386 #define RB_PROTOTYPE_INTERNAL(name, type, field, cmp, attr) \
387 attr void name##_RB_INSERT_COLOR(struct name *, struct type *); \
388 attr void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *);\
389 attr struct type *name##_RB_REMOVE(struct name *, struct type *); \
390 attr struct type *name##_RB_INSERT(struct name *, struct type *); \
391 attr struct type *name##_RB_FIND(struct name *, struct type *); \
392 attr struct type *name##_RB_NFIND(struct name *, struct type *); \
393 attr struct type *name##_RB_NEXT(struct type *); \
394 attr struct type *name##_RB_PREV(struct type *); \
395 attr struct type *name##_RB_MINMAX(struct name *, int); \
398 /* Main rb operation.
399 * Moves node close to the key of elm to top
401 #define RB_GENERATE(name, type, field, cmp) \
402 RB_GENERATE_INTERNAL(name, type, field, cmp,)
403 #define RB_GENERATE_STATIC(name, type, field, cmp) \
404 RB_GENERATE_INTERNAL(name, type, field, cmp, __attribute__((__unused__)) static)
405 #define RB_GENERATE_INTERNAL(name, type, field, cmp, attr) \
407 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
409 struct type *parent, *gparent, *tmp; \
410 while ((parent = RB_PARENT(elm, field)) && \
411 RB_COLOR(parent, field) == RB_RED) { \
412 gparent = RB_PARENT(parent, field); \
413 if (parent == RB_LEFT(gparent, field)) { \
414 tmp = RB_RIGHT(gparent, field); \
415 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
416 RB_COLOR(tmp, field) = RB_BLACK; \
417 RB_SET_BLACKRED(parent, gparent, field);\
421 if (RB_RIGHT(parent, field) == elm) { \
422 RB_ROTATE_LEFT(head, parent, tmp, field);\
427 RB_SET_BLACKRED(parent, gparent, field); \
428 RB_ROTATE_RIGHT(head, gparent, tmp, field); \
430 tmp = RB_LEFT(gparent, field); \
431 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
432 RB_COLOR(tmp, field) = RB_BLACK; \
433 RB_SET_BLACKRED(parent, gparent, field);\
437 if (RB_LEFT(parent, field) == elm) { \
438 RB_ROTATE_RIGHT(head, parent, tmp, field);\
443 RB_SET_BLACKRED(parent, gparent, field); \
444 RB_ROTATE_LEFT(head, gparent, tmp, field); \
447 RB_COLOR(head->rbh_root, field) = RB_BLACK; \
451 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
454 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
455 elm != RB_ROOT(head)) { \
456 if (RB_LEFT(parent, field) == elm) { \
457 tmp = RB_RIGHT(parent, field); \
458 if (RB_COLOR(tmp, field) == RB_RED) { \
459 RB_SET_BLACKRED(tmp, parent, field); \
460 RB_ROTATE_LEFT(head, parent, tmp, field);\
461 tmp = RB_RIGHT(parent, field); \
463 if ((RB_LEFT(tmp, field) == NULL || \
464 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
465 (RB_RIGHT(tmp, field) == NULL || \
466 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
467 RB_COLOR(tmp, field) = RB_RED; \
469 parent = RB_PARENT(elm, field); \
471 if (RB_RIGHT(tmp, field) == NULL || \
472 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
473 struct type *oleft; \
474 if ((oleft = RB_LEFT(tmp, field)))\
475 RB_COLOR(oleft, field) = RB_BLACK;\
476 RB_COLOR(tmp, field) = RB_RED; \
477 RB_ROTATE_RIGHT(head, tmp, oleft, field);\
478 tmp = RB_RIGHT(parent, field); \
480 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
481 RB_COLOR(parent, field) = RB_BLACK; \
482 if (RB_RIGHT(tmp, field)) \
483 RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
484 RB_ROTATE_LEFT(head, parent, tmp, field);\
485 elm = RB_ROOT(head); \
489 tmp = RB_LEFT(parent, field); \
490 if (RB_COLOR(tmp, field) == RB_RED) { \
491 RB_SET_BLACKRED(tmp, parent, field); \
492 RB_ROTATE_RIGHT(head, parent, tmp, field);\
493 tmp = RB_LEFT(parent, field); \
495 if ((RB_LEFT(tmp, field) == NULL || \
496 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
497 (RB_RIGHT(tmp, field) == NULL || \
498 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
499 RB_COLOR(tmp, field) = RB_RED; \
501 parent = RB_PARENT(elm, field); \
503 if (RB_LEFT(tmp, field) == NULL || \
504 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
505 struct type *oright; \
506 if ((oright = RB_RIGHT(tmp, field)))\
507 RB_COLOR(oright, field) = RB_BLACK;\
508 RB_COLOR(tmp, field) = RB_RED; \
509 RB_ROTATE_LEFT(head, tmp, oright, field);\
510 tmp = RB_LEFT(parent, field); \
512 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
513 RB_COLOR(parent, field) = RB_BLACK; \
514 if (RB_LEFT(tmp, field)) \
515 RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
516 RB_ROTATE_RIGHT(head, parent, tmp, field);\
517 elm = RB_ROOT(head); \
523 RB_COLOR(elm, field) = RB_BLACK; \
527 name##_RB_REMOVE(struct name *head, struct type *elm) \
529 struct type *child, *parent, *old = elm; \
531 if (RB_LEFT(elm, field) == NULL) \
532 child = RB_RIGHT(elm, field); \
533 else if (RB_RIGHT(elm, field) == NULL) \
534 child = RB_LEFT(elm, field); \
537 elm = RB_RIGHT(elm, field); \
538 while ((left = RB_LEFT(elm, field))) \
540 child = RB_RIGHT(elm, field); \
541 parent = RB_PARENT(elm, field); \
542 color = RB_COLOR(elm, field); \
544 RB_PARENT(child, field) = parent; \
546 if (RB_LEFT(parent, field) == elm) \
547 RB_LEFT(parent, field) = child; \
549 RB_RIGHT(parent, field) = child; \
550 RB_AUGMENT(parent); \
552 RB_ROOT(head) = child; \
553 if (RB_PARENT(elm, field) == old) \
555 (elm)->field = (old)->field; \
556 if (RB_PARENT(old, field)) { \
557 if (RB_LEFT(RB_PARENT(old, field), field) == old)\
558 RB_LEFT(RB_PARENT(old, field), field) = elm;\
560 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
561 RB_AUGMENT(RB_PARENT(old, field)); \
563 RB_ROOT(head) = elm; \
564 RB_PARENT(RB_LEFT(old, field), field) = elm; \
565 if (RB_RIGHT(old, field)) \
566 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
571 } while ((left = RB_PARENT(left, field))); \
575 parent = RB_PARENT(elm, field); \
576 color = RB_COLOR(elm, field); \
578 RB_PARENT(child, field) = parent; \
580 if (RB_LEFT(parent, field) == elm) \
581 RB_LEFT(parent, field) = child; \
583 RB_RIGHT(parent, field) = child; \
584 RB_AUGMENT(parent); \
586 RB_ROOT(head) = child; \
588 if (color == RB_BLACK) \
589 name##_RB_REMOVE_COLOR(head, parent, child); \
593 /* Inserts a node into the RB tree */ \
595 name##_RB_INSERT(struct name *head, struct type *elm) \
598 struct type *parent = NULL; \
600 tmp = RB_ROOT(head); \
603 comp = (cmp)(elm, parent); \
605 tmp = RB_LEFT(tmp, field); \
607 tmp = RB_RIGHT(tmp, field); \
611 RB_SET(elm, parent, field); \
612 if (parent != NULL) { \
614 RB_LEFT(parent, field) = elm; \
616 RB_RIGHT(parent, field) = elm; \
617 RB_AUGMENT(parent); \
619 RB_ROOT(head) = elm; \
620 name##_RB_INSERT_COLOR(head, elm); \
624 /* Finds the node with the same key as elm */ \
626 name##_RB_FIND(struct name *head, struct type *elm) \
628 struct type *tmp = RB_ROOT(head); \
631 comp = cmp(elm, tmp); \
633 tmp = RB_LEFT(tmp, field); \
635 tmp = RB_RIGHT(tmp, field); \
642 /* Finds the first node greater than or equal to the search key */ \
644 name##_RB_NFIND(struct name *head, struct type *elm) \
646 struct type *tmp = RB_ROOT(head); \
647 struct type *res = NULL; \
650 comp = cmp(elm, tmp); \
653 tmp = RB_LEFT(tmp, field); \
656 tmp = RB_RIGHT(tmp, field); \
665 name##_RB_NEXT(struct type *elm) \
667 if (RB_RIGHT(elm, field)) { \
668 elm = RB_RIGHT(elm, field); \
669 while (RB_LEFT(elm, field)) \
670 elm = RB_LEFT(elm, field); \
672 if (RB_PARENT(elm, field) && \
673 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
674 elm = RB_PARENT(elm, field); \
676 while (RB_PARENT(elm, field) && \
677 (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
678 elm = RB_PARENT(elm, field); \
679 elm = RB_PARENT(elm, field); \
687 name##_RB_PREV(struct type *elm) \
689 if (RB_LEFT(elm, field)) { \
690 elm = RB_LEFT(elm, field); \
691 while (RB_RIGHT(elm, field)) \
692 elm = RB_RIGHT(elm, field); \
694 if (RB_PARENT(elm, field) && \
695 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
696 elm = RB_PARENT(elm, field); \
698 while (RB_PARENT(elm, field) && \
699 (elm == RB_LEFT(RB_PARENT(elm, field), field)))\
700 elm = RB_PARENT(elm, field); \
701 elm = RB_PARENT(elm, field); \
708 name##_RB_MINMAX(struct name *head, int val) \
710 struct type *tmp = RB_ROOT(head); \
711 struct type *parent = NULL; \
715 tmp = RB_LEFT(tmp, field); \
717 tmp = RB_RIGHT(tmp, field); \
725 #define RB_INSERT(name, x, y) name##_RB_INSERT(x, y)
726 #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y)
727 #define RB_FIND(name, x, y) name##_RB_FIND(x, y)
728 #define RB_NFIND(name, x, y) name##_RB_NFIND(x, y)
729 #define RB_NEXT(name, x, y) name##_RB_NEXT(y)
730 #define RB_PREV(name, x, y) name##_RB_PREV(y)
731 #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF)
732 #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF)
734 #define RB_FOREACH(x, name, head) \
735 for ((x) = RB_MIN(name, head); \
737 (x) = name##_RB_NEXT(x))
739 #define RB_FOREACH_SAFE(x, name, head, y) \
740 for ((x) = RB_MIN(name, head); \
741 ((x) != NULL) && ((y) = name##_RB_NEXT(x), 1); \
744 #define RB_FOREACH_REVERSE(x, name, head) \
745 for ((x) = RB_MAX(name, head); \
747 (x) = name##_RB_PREV(x))
749 #define RB_FOREACH_REVERSE_SAFE(x, name, head, y) \
750 for ((x) = RB_MAX(name, head); \
751 ((x) != NULL) && ((y) = name##_RB_PREV(x), 1); \
754 #endif /* _SYS_TREE_H_ */