1 /* $NetBSD: tree.h,v 1.8 2004/03/28 19:38:30 provos Exp $ */
2 /* $OpenBSD: tree.h,v 1.7 2002/10/17 21:51:54 art Exp $ */
3 /* $DragonFly: src/sys/sys/tree.h,v 1.2 2005/04/15 19:08:13 dillon Exp $ */
5 * Copyright 2002 Niels Provos <provos@citi.umich.edu>
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
17 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 * This file defines data structures for different types of trees:
34 * splay trees and red-black trees.
36 * A splay tree is a self-organizing data structure. Every operation
37 * on the tree causes a splay to happen. The splay moves the requested
38 * node to the root of the tree and partly rebalances it.
40 * This has the benefit that request locality causes faster lookups as
41 * the requested nodes move to the top of the tree. On the other hand,
42 * every lookup causes memory writes.
44 * The Balance Theorem bounds the total access time for m operations
45 * and n inserts on an initially empty tree as O((m + n)lg n). The
46 * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
48 * A red-black tree is a binary search tree with the node color as an
49 * extra attribute. It fulfills a set of conditions:
50 * - every search path from the root to a leaf consists of the
51 * same number of black nodes,
52 * - each red node (except for the root) has a black parent,
53 * - each leaf node is black.
55 * Every operation on a red-black tree is bounded as O(lg n).
56 * The maximum height of a red-black tree is 2lg (n+1).
59 #define SPLAY_HEAD(name, type) \
61 struct type *sph_root; /* root of the tree */ \
64 #define SPLAY_INITIALIZER(root) \
67 #define SPLAY_INIT(root) do { \
68 (root)->sph_root = NULL; \
69 } while (/*CONSTCOND*/ 0)
71 #define SPLAY_ENTRY(type) \
73 struct type *spe_left; /* left element */ \
74 struct type *spe_right; /* right element */ \
77 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
78 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
79 #define SPLAY_ROOT(head) (head)->sph_root
80 #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
82 /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
83 #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
84 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
85 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
86 (head)->sph_root = tmp; \
87 } while (/*CONSTCOND*/ 0)
89 #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
90 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
91 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
92 (head)->sph_root = tmp; \
93 } while (/*CONSTCOND*/ 0)
95 #define SPLAY_LINKLEFT(head, tmp, field) do { \
96 SPLAY_LEFT(tmp, field) = (head)->sph_root; \
97 tmp = (head)->sph_root; \
98 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
99 } while (/*CONSTCOND*/ 0)
101 #define SPLAY_LINKRIGHT(head, tmp, field) do { \
102 SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
103 tmp = (head)->sph_root; \
104 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
105 } while (/*CONSTCOND*/ 0)
107 #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
108 SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
109 SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
110 SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
111 SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
112 } while (/*CONSTCOND*/ 0)
114 /* Generates prototypes and inline functions */
116 #define SPLAY_PROTOTYPE(name, type, field, cmp) \
117 void name##_SPLAY(struct name *, struct type *); \
118 void name##_SPLAY_MINMAX(struct name *, int); \
119 struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
120 struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
122 /* Finds the node with the same key as elm */ \
123 static __inline struct type * \
124 name##_SPLAY_FIND(struct name *head, struct type *elm) \
126 if (SPLAY_EMPTY(head)) \
128 name##_SPLAY(head, elm); \
129 if ((cmp)(elm, (head)->sph_root) == 0) \
130 return (head->sph_root); \
134 static __inline struct type * \
135 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
137 name##_SPLAY(head, elm); \
138 if (SPLAY_RIGHT(elm, field) != NULL) { \
139 elm = SPLAY_RIGHT(elm, field); \
140 while (SPLAY_LEFT(elm, field) != NULL) { \
141 elm = SPLAY_LEFT(elm, field); \
148 static __inline struct type * \
149 name##_SPLAY_MIN_MAX(struct name *head, int val) \
151 name##_SPLAY_MINMAX(head, val); \
152 return (SPLAY_ROOT(head)); \
155 /* Main splay operation.
156 * Moves node close to the key of elm to top
158 #define SPLAY_GENERATE(name, type, field, cmp) \
160 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
162 if (SPLAY_EMPTY(head)) { \
163 SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
166 name##_SPLAY(head, elm); \
167 __comp = (cmp)(elm, (head)->sph_root); \
169 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
170 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
171 SPLAY_LEFT((head)->sph_root, field) = NULL; \
172 } else if (__comp > 0) { \
173 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
174 SPLAY_LEFT(elm, field) = (head)->sph_root; \
175 SPLAY_RIGHT((head)->sph_root, field) = NULL; \
177 return ((head)->sph_root); \
179 (head)->sph_root = (elm); \
184 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
186 struct type *__tmp; \
187 if (SPLAY_EMPTY(head)) \
189 name##_SPLAY(head, elm); \
190 if ((cmp)(elm, (head)->sph_root) == 0) { \
191 if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
192 (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
194 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
195 (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
196 name##_SPLAY(head, elm); \
197 SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
205 name##_SPLAY(struct name *head, struct type *elm) \
207 struct type __node, *__left, *__right, *__tmp; \
210 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
211 __left = __right = &__node; \
213 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
215 __tmp = SPLAY_LEFT((head)->sph_root, field); \
218 if ((cmp)(elm, __tmp) < 0){ \
219 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
220 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
223 SPLAY_LINKLEFT(head, __right, field); \
224 } else if (__comp > 0) { \
225 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
228 if ((cmp)(elm, __tmp) > 0){ \
229 SPLAY_ROTATE_LEFT(head, __tmp, field); \
230 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
233 SPLAY_LINKRIGHT(head, __left, field); \
236 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
239 /* Splay with either the minimum or the maximum element \
240 * Used to find minimum or maximum element in tree. \
242 void name##_SPLAY_MINMAX(struct name *head, int __comp) \
244 struct type __node, *__left, *__right, *__tmp; \
246 SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
247 __left = __right = &__node; \
251 __tmp = SPLAY_LEFT((head)->sph_root, field); \
255 SPLAY_ROTATE_RIGHT(head, __tmp, field); \
256 if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
259 SPLAY_LINKLEFT(head, __right, field); \
260 } else if (__comp > 0) { \
261 __tmp = SPLAY_RIGHT((head)->sph_root, field); \
265 SPLAY_ROTATE_LEFT(head, __tmp, field); \
266 if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
269 SPLAY_LINKRIGHT(head, __left, field); \
272 SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
275 #define SPLAY_NEGINF -1
278 #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y)
279 #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
280 #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
281 #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
282 #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
283 : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
284 #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
285 : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
287 #define SPLAY_FOREACH(x, name, head) \
288 for ((x) = SPLAY_MIN(name, head); \
290 (x) = SPLAY_NEXT(name, head, x))
292 /* Macros that define a red-black tree */
294 #define RB_SCAN_INFO(name, type) \
295 struct name##_scan_info { \
296 struct name##_scan_info *link; \
300 #define RB_HEAD(name, type) \
302 struct type *rbh_root; /* root of the tree */ \
303 struct name##_scan_info *rbh_inprog; /* scans in progress */ \
306 #define RB_INITIALIZER(root) \
309 #define RB_INIT(root) do { \
310 (root)->rbh_root = NULL; \
311 (root)->rbh_inprog = NULL; \
312 } while (/*CONSTCOND*/ 0)
316 #define RB_ENTRY(type) \
318 struct type *rbe_left; /* left element */ \
319 struct type *rbe_right; /* right element */ \
320 struct type *rbe_parent; /* parent element */ \
321 int rbe_color; /* node color */ \
324 #define RB_LEFT(elm, field) (elm)->field.rbe_left
325 #define RB_RIGHT(elm, field) (elm)->field.rbe_right
326 #define RB_PARENT(elm, field) (elm)->field.rbe_parent
327 #define RB_COLOR(elm, field) (elm)->field.rbe_color
328 #define RB_ROOT(head) (head)->rbh_root
329 #define RB_INPROG(head) (head)->rbh_inprog
330 #define RB_EMPTY(head) (RB_ROOT(head) == NULL)
332 #define RB_SET(elm, parent, field) do { \
333 RB_PARENT(elm, field) = parent; \
334 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
335 RB_COLOR(elm, field) = RB_RED; \
336 } while (/*CONSTCOND*/ 0)
338 #define RB_SET_BLACKRED(black, red, field) do { \
339 RB_COLOR(black, field) = RB_BLACK; \
340 RB_COLOR(red, field) = RB_RED; \
341 } while (/*CONSTCOND*/ 0)
344 #define RB_AUGMENT(x)
347 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
348 (tmp) = RB_RIGHT(elm, field); \
349 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) { \
350 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
353 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
354 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
355 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
357 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
359 (head)->rbh_root = (tmp); \
360 RB_LEFT(tmp, field) = (elm); \
361 RB_PARENT(elm, field) = (tmp); \
363 if ((RB_PARENT(tmp, field))) \
364 RB_AUGMENT(RB_PARENT(tmp, field)); \
365 } while (/*CONSTCOND*/ 0)
367 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
368 (tmp) = RB_LEFT(elm, field); \
369 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) { \
370 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
373 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
374 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
375 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
377 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
379 (head)->rbh_root = (tmp); \
380 RB_RIGHT(tmp, field) = (elm); \
381 RB_PARENT(elm, field) = (tmp); \
383 if ((RB_PARENT(tmp, field))) \
384 RB_AUGMENT(RB_PARENT(tmp, field)); \
385 } while (/*CONSTCOND*/ 0)
387 /* Generates prototypes and inline functions */
388 #define RB_PROTOTYPE(name, type, field, cmp) \
389 struct type *name##_RB_REMOVE(struct name *, struct type *); \
390 struct type *name##_RB_INSERT(struct name *, struct type *); \
391 struct type *name##_RB_FIND(struct name *, struct type *); \
392 int name##_RB_SCAN(struct name *, int (*)(struct type *, void *), \
393 int (*)(struct type *, void *), void *); \
394 struct type *name##_RB_NEXT(struct type *); \
395 struct type *name##_RB_MINMAX(struct name *, int); \
396 RB_SCAN_INFO(name, type) \
398 /* Main rb operation.
399 * Moves node close to the key of elm to top
401 #define RB_GENERATE(name, type, field, cmp) \
403 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
405 struct type *parent, *gparent, *tmp; \
406 while ((parent = RB_PARENT(elm, field)) != NULL && \
407 RB_COLOR(parent, field) == RB_RED) { \
408 gparent = RB_PARENT(parent, field); \
409 if (parent == RB_LEFT(gparent, field)) { \
410 tmp = RB_RIGHT(gparent, field); \
411 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
412 RB_COLOR(tmp, field) = RB_BLACK; \
413 RB_SET_BLACKRED(parent, gparent, field);\
417 if (RB_RIGHT(parent, field) == elm) { \
418 RB_ROTATE_LEFT(head, parent, tmp, field);\
423 RB_SET_BLACKRED(parent, gparent, field); \
424 RB_ROTATE_RIGHT(head, gparent, tmp, field); \
426 tmp = RB_LEFT(gparent, field); \
427 if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
428 RB_COLOR(tmp, field) = RB_BLACK; \
429 RB_SET_BLACKRED(parent, gparent, field);\
433 if (RB_LEFT(parent, field) == elm) { \
434 RB_ROTATE_RIGHT(head, parent, tmp, field);\
439 RB_SET_BLACKRED(parent, gparent, field); \
440 RB_ROTATE_LEFT(head, gparent, tmp, field); \
443 RB_COLOR(head->rbh_root, field) = RB_BLACK; \
447 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, \
451 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
452 elm != RB_ROOT(head)) { \
453 if (RB_LEFT(parent, field) == elm) { \
454 tmp = RB_RIGHT(parent, field); \
455 if (RB_COLOR(tmp, field) == RB_RED) { \
456 RB_SET_BLACKRED(tmp, parent, field); \
457 RB_ROTATE_LEFT(head, parent, tmp, field);\
458 tmp = RB_RIGHT(parent, field); \
460 if ((RB_LEFT(tmp, field) == NULL || \
461 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
462 (RB_RIGHT(tmp, field) == NULL || \
463 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
464 RB_COLOR(tmp, field) = RB_RED; \
466 parent = RB_PARENT(elm, field); \
468 if (RB_RIGHT(tmp, field) == NULL || \
469 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
470 struct type *oleft; \
471 if ((oleft = RB_LEFT(tmp, field)) \
473 RB_COLOR(oleft, field) = RB_BLACK;\
474 RB_COLOR(tmp, field) = RB_RED; \
475 RB_ROTATE_RIGHT(head, tmp, oleft, field);\
476 tmp = RB_RIGHT(parent, field); \
478 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
479 RB_COLOR(parent, field) = RB_BLACK; \
480 if (RB_RIGHT(tmp, field)) \
481 RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
482 RB_ROTATE_LEFT(head, parent, tmp, field);\
483 elm = RB_ROOT(head); \
487 tmp = RB_LEFT(parent, field); \
488 if (RB_COLOR(tmp, field) == RB_RED) { \
489 RB_SET_BLACKRED(tmp, parent, field); \
490 RB_ROTATE_RIGHT(head, parent, tmp, field);\
491 tmp = RB_LEFT(parent, field); \
493 if ((RB_LEFT(tmp, field) == NULL || \
494 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
495 (RB_RIGHT(tmp, field) == NULL || \
496 RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
497 RB_COLOR(tmp, field) = RB_RED; \
499 parent = RB_PARENT(elm, field); \
501 if (RB_LEFT(tmp, field) == NULL || \
502 RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
503 struct type *oright; \
504 if ((oright = RB_RIGHT(tmp, field)) \
506 RB_COLOR(oright, field) = RB_BLACK;\
507 RB_COLOR(tmp, field) = RB_RED; \
508 RB_ROTATE_LEFT(head, tmp, oright, field);\
509 tmp = RB_LEFT(parent, field); \
511 RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
512 RB_COLOR(parent, field) = RB_BLACK; \
513 if (RB_LEFT(tmp, field)) \
514 RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
515 RB_ROTATE_RIGHT(head, parent, tmp, field);\
516 elm = RB_ROOT(head); \
522 RB_COLOR(elm, field) = RB_BLACK; \
526 name##_RB_REMOVE(struct name *head, struct type *elm) \
528 struct type *child, *parent, *old; \
529 struct name##_scan_info *inprog; \
532 for (inprog = RB_INPROG(head); inprog; inprog = inprog->link) { \
533 if (inprog->node == elm) \
534 inprog->node = RB_NEXT(name, head, elm); \
538 if (RB_LEFT(elm, field) == NULL) \
539 child = RB_RIGHT(elm, field); \
540 else if (RB_RIGHT(elm, field) == NULL) \
541 child = RB_LEFT(elm, field); \
544 elm = RB_RIGHT(elm, field); \
545 while ((left = RB_LEFT(elm, field)) != NULL) \
547 child = RB_RIGHT(elm, field); \
548 parent = RB_PARENT(elm, field); \
549 color = RB_COLOR(elm, field); \
551 RB_PARENT(child, field) = parent; \
553 if (RB_LEFT(parent, field) == elm) \
554 RB_LEFT(parent, field) = child; \
556 RB_RIGHT(parent, field) = child; \
557 RB_AUGMENT(parent); \
559 RB_ROOT(head) = child; \
560 if (RB_PARENT(elm, field) == old) \
562 (elm)->field = (old)->field; \
563 if (RB_PARENT(old, field)) { \
564 if (RB_LEFT(RB_PARENT(old, field), field) == old)\
565 RB_LEFT(RB_PARENT(old, field), field) = elm;\
567 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
568 RB_AUGMENT(RB_PARENT(old, field)); \
570 RB_ROOT(head) = elm; \
571 RB_PARENT(RB_LEFT(old, field), field) = elm; \
572 if (RB_RIGHT(old, field)) \
573 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
578 } while ((left = RB_PARENT(left, field)) != NULL); \
582 parent = RB_PARENT(elm, field); \
583 color = RB_COLOR(elm, field); \
585 RB_PARENT(child, field) = parent; \
587 if (RB_LEFT(parent, field) == elm) \
588 RB_LEFT(parent, field) = child; \
590 RB_RIGHT(parent, field) = child; \
591 RB_AUGMENT(parent); \
593 RB_ROOT(head) = child; \
595 if (color == RB_BLACK) \
596 name##_RB_REMOVE_COLOR(head, parent, child); \
600 /* Inserts a node into the RB tree */ \
602 name##_RB_INSERT(struct name *head, struct type *elm) \
605 struct type *parent = NULL; \
607 tmp = RB_ROOT(head); \
610 comp = (cmp)(elm, parent); \
612 tmp = RB_LEFT(tmp, field); \
614 tmp = RB_RIGHT(tmp, field); \
618 RB_SET(elm, parent, field); \
619 if (parent != NULL) { \
621 RB_LEFT(parent, field) = elm; \
623 RB_RIGHT(parent, field) = elm; \
624 RB_AUGMENT(parent); \
626 RB_ROOT(head) = elm; \
627 name##_RB_INSERT_COLOR(head, elm); \
631 /* Finds the node with the same key as elm */ \
633 name##_RB_FIND(struct name *head, struct type *elm) \
635 struct type *tmp = RB_ROOT(head); \
638 comp = cmp(elm, tmp); \
640 tmp = RB_LEFT(tmp, field); \
642 tmp = RB_RIGHT(tmp, field); \
650 * Issue a callback for all matching items. The scan function must \
651 * return < 0 for items below the desired range, 0 for items within \
652 * the range, and > 0 for items beyond the range. Any item may be \
653 * deleted while the scan is in progress. \
656 name##_SCANCMP_ALL(struct type *type, void *data) \
662 name##_RB_SCAN(struct name *head, \
663 int (*scancmp)(struct type *, void *), \
664 int (*callback)(struct type *, void *), \
667 struct name##_scan_info info; \
668 struct name##_scan_info **infopp; \
674 if (scancmp == NULL) \
675 scancmp = name##_SCANCMP_ALL; \
678 * Locate the first element. \
680 tmp = RB_ROOT(head); \
683 comp = scancmp(tmp, data); \
685 tmp = RB_RIGHT(tmp, field); \
686 } else if (comp > 0) { \
687 tmp = RB_LEFT(tmp, field); \
690 if (RB_LEFT(tmp, field) == NULL) \
692 tmp = RB_LEFT(tmp, field); \
697 info.node = RB_NEXT(name, head, best); \
698 info.link = RB_INPROG(head); \
699 RB_INPROG(head) = &info; \
700 while ((comp = callback(best, data)) >= 0) { \
703 if (best == NULL || scancmp(best, data) != 0) \
705 info.node = RB_NEXT(name, head, best); \
707 if (comp < 0) /* error or termination */ \
709 infopp = &RB_INPROG(head); \
710 while (*infopp != &info) \
711 infopp = &(*infopp)->link; \
712 *infopp = info.link; \
719 name##_RB_NEXT(struct type *elm) \
721 if (RB_RIGHT(elm, field)) { \
722 elm = RB_RIGHT(elm, field); \
723 while (RB_LEFT(elm, field)) \
724 elm = RB_LEFT(elm, field); \
726 if (RB_PARENT(elm, field) && \
727 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
728 elm = RB_PARENT(elm, field); \
730 while (RB_PARENT(elm, field) && \
731 (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
732 elm = RB_PARENT(elm, field); \
733 elm = RB_PARENT(elm, field); \
740 name##_RB_MINMAX(struct name *head, int val) \
742 struct type *tmp = RB_ROOT(head); \
743 struct type *parent = NULL; \
747 tmp = RB_LEFT(tmp, field); \
749 tmp = RB_RIGHT(tmp, field); \
757 #define RB_INSERT(name, x, y) name##_RB_INSERT(x, y)
758 #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y)
759 #define RB_FIND(name, x, y) name##_RB_FIND(x, y)
760 #define RB_SCAN(name, root, cmp, callback, data) \
761 name##_RB_SCAN(root, cmp, callback, data)
762 #define RB_NEXT(name, x, y) name##_RB_NEXT(y)
763 #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF)
764 #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF)
766 #define RB_FOREACH(x, name, head) \
767 for ((x) = RB_MIN(name, head); \
769 (x) = name##_RB_NEXT(x))
771 #endif /* _SYS_TREE_H_ */