![[BACK]](/icons/back.gif){kind=icon}
Return to tree.h CVS log ![[TXT]](/icons/text.gif){kind=icon}
![[DIR]](/icons/dir.gif){kind=icon}
Up to [cvs.NetBSD.org] / src / sys / sys|
Return to tree.h CVS log | Up to [cvs.NetBSD.org] / src / sys / sys |
1.3.2.2 ! jdolecek 1: /* $NetBSD: tree.h,v 1.3.2.1 2002/09/06 08:50:08 jdolecek Exp $ */
! 2: /* $OpenBSD: tree.h,v 1.6 2002/06/11 22:09:52 provos Exp $ */
! 3: /*
! 4: * Copyright 2002 Niels Provos <provos@citi.umich.edu>
! 5: * All rights reserved.
! 6: *
! 7: * Redistribution and use in source and binary forms, with or without
! 8: * modification, are permitted provided that the following conditions
! 9: * are met:
! 10: * 1. Redistributions of source code must retain the above copyright
! 11: * notice, this list of conditions and the following disclaimer.
! 12: * 2. Redistributions in binary form must reproduce the above copyright
! 13: * notice, this list of conditions and the following disclaimer in the
! 14: * documentation and/or other materials provided with the distribution.
! 15: *
! 16: * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
! 17: * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
! 18: * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
! 19: * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
! 20: * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
! 21: * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
! 22: * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
! 23: * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
! 24: * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
! 25: * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
! 26: */
! 27:
! 28: #ifndef _SYS_TREE_H_
! 29: #define _SYS_TREE_H_
! 30:
! 31: /*
! 32: * This file defines data structures for different types of trees:
! 33: * splay trees and red-black trees.
! 34: *
! 35: * A splay tree is a self-organizing data structure. Every operation
! 36: * on the tree causes a splay to happen. The splay moves the requested
! 37: * node to the root of the tree and partly rebalances it.
! 38: *
! 39: * This has the benefit that request locality causes faster lookups as
! 40: * the requested nodes move to the top of the tree. On the other hand,
! 41: * every lookup causes memory writes.
! 42: *
! 43: * The Balance Theorem bounds the total access time for m operations
! 44: * and n inserts on an initially empty tree as O((m + n)lg n). The
! 45: * amortized cost for a sequence of m accesses to a splay tree is O(lg n);
! 46: *
! 47: * A red-black tree is a binary search tree with the node color as an
! 48: * extra attribute. It fulfills a set of conditions:
! 49: * - every search path from the root to a leaf consists of the
! 50: * same number of black nodes,
! 51: * - each red node (except for the root) has a black parent,
! 52: * - each leaf node is black.
! 53: *
! 54: * Every operation on a red-black tree is bounded as O(lg n).
! 55: * The maximum height of a red-black tree is 2lg (n+1).
! 56: */
! 57:
! 58: #define SPLAY_HEAD(name, type) \
! 59: struct name { \
! 60: struct type *sph_root; /* root of the tree */ \
! 61: }
! 62:
! 63: #define SPLAY_INITIALIZER(root) \
! 64: { NULL }
! 65:
! 66: #define SPLAY_INIT(root) do { \
! 67: (root)->sph_root = NULL; \
! 68: } while (0)
! 69:
! 70: #define SPLAY_ENTRY(type) \
! 71: struct { \
! 72: struct type *spe_left; /* left element */ \
! 73: struct type *spe_right; /* right element */ \
! 74: }
! 75:
! 76: #define SPLAY_LEFT(elm, field) (elm)->field.spe_left
! 77: #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right
! 78: #define SPLAY_ROOT(head) (head)->sph_root
! 79: #define SPLAY_EMPTY(head) (SPLAY_ROOT(head) == NULL)
! 80:
! 81: /* SPLAY_ROTATE_{LEFT,RIGHT} expect that tmp hold SPLAY_{RIGHT,LEFT} */
! 82: #define SPLAY_ROTATE_RIGHT(head, tmp, field) do { \
! 83: SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(tmp, field); \
! 84: SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
! 85: (head)->sph_root = tmp; \
! 86: } while (0)
! 87:
! 88: #define SPLAY_ROTATE_LEFT(head, tmp, field) do { \
! 89: SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(tmp, field); \
! 90: SPLAY_LEFT(tmp, field) = (head)->sph_root; \
! 91: (head)->sph_root = tmp; \
! 92: } while (0)
! 93:
! 94: #define SPLAY_LINKLEFT(head, tmp, field) do { \
! 95: SPLAY_LEFT(tmp, field) = (head)->sph_root; \
! 96: tmp = (head)->sph_root; \
! 97: (head)->sph_root = SPLAY_LEFT((head)->sph_root, field); \
! 98: } while (0)
! 99:
! 100: #define SPLAY_LINKRIGHT(head, tmp, field) do { \
! 101: SPLAY_RIGHT(tmp, field) = (head)->sph_root; \
! 102: tmp = (head)->sph_root; \
! 103: (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field); \
! 104: } while (0)
! 105:
! 106: #define SPLAY_ASSEMBLE(head, node, left, right, field) do { \
! 107: SPLAY_RIGHT(left, field) = SPLAY_LEFT((head)->sph_root, field); \
! 108: SPLAY_LEFT(right, field) = SPLAY_RIGHT((head)->sph_root, field);\
! 109: SPLAY_LEFT((head)->sph_root, field) = SPLAY_RIGHT(node, field); \
! 110: SPLAY_RIGHT((head)->sph_root, field) = SPLAY_LEFT(node, field); \
! 111: } while (0)
! 112:
! 113: /* Generates prototypes and inline functions */
! 114:
! 115: #define SPLAY_PROTOTYPE(name, type, field, cmp) \
! 116: void name##_SPLAY(struct name *, struct type *); \
! 117: void name##_SPLAY_MINMAX(struct name *, int); \
! 118: struct type *name##_SPLAY_INSERT(struct name *, struct type *); \
! 119: struct type *name##_SPLAY_REMOVE(struct name *, struct type *); \
! 120: \
! 121: /* Finds the node with the same key as elm */ \
! 122: static __inline struct type * \
! 123: name##_SPLAY_FIND(struct name *head, struct type *elm) \
! 124: { \
! 125: if (SPLAY_EMPTY(head)) \
! 126: return(NULL); \
! 127: name##_SPLAY(head, elm); \
! 128: if ((cmp)(elm, (head)->sph_root) == 0) \
! 129: return (head->sph_root); \
! 130: return (NULL); \
! 131: } \
! 132: \
! 133: static __inline struct type * \
! 134: name##_SPLAY_NEXT(struct name *head, struct type *elm) \
! 135: { \
! 136: name##_SPLAY(head, elm); \
! 137: if (SPLAY_RIGHT(elm, field) != NULL) { \
! 138: elm = SPLAY_RIGHT(elm, field); \
! 139: while (SPLAY_LEFT(elm, field) != NULL) { \
! 140: elm = SPLAY_LEFT(elm, field); \
! 141: } \
! 142: } else \
! 143: elm = NULL; \
! 144: return (elm); \
! 145: } \
! 146: \
! 147: static __inline struct type * \
! 148: name##_SPLAY_MIN_MAX(struct name *head, int val) \
! 149: { \
! 150: name##_SPLAY_MINMAX(head, val); \
! 151: return (SPLAY_ROOT(head)); \
! 152: }
! 153:
! 154: /* Main splay operation.
! 155: * Moves node close to the key of elm to top
! 156: */
! 157: #define SPLAY_GENERATE(name, type, field, cmp) \
! 158: struct type * \
! 159: name##_SPLAY_INSERT(struct name *head, struct type *elm) \
! 160: { \
! 161: if (SPLAY_EMPTY(head)) { \
! 162: SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
! 163: } else { \
! 164: int __comp; \
! 165: name##_SPLAY(head, elm); \
! 166: __comp = (cmp)(elm, (head)->sph_root); \
! 167: if(__comp < 0) { \
! 168: SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
! 169: SPLAY_RIGHT(elm, field) = (head)->sph_root; \
! 170: SPLAY_LEFT((head)->sph_root, field) = NULL; \
! 171: } else if (__comp > 0) { \
! 172: SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
! 173: SPLAY_LEFT(elm, field) = (head)->sph_root; \
! 174: SPLAY_RIGHT((head)->sph_root, field) = NULL; \
! 175: } else \
! 176: return ((head)->sph_root); \
! 177: } \
! 178: (head)->sph_root = (elm); \
! 179: return (NULL); \
! 180: } \
! 181: \
! 182: struct type * \
! 183: name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
! 184: { \
! 185: struct type *__tmp; \
! 186: if (SPLAY_EMPTY(head)) \
! 187: return (NULL); \
! 188: name##_SPLAY(head, elm); \
! 189: if ((cmp)(elm, (head)->sph_root) == 0) { \
! 190: if (SPLAY_LEFT((head)->sph_root, field) == NULL) { \
! 191: (head)->sph_root = SPLAY_RIGHT((head)->sph_root, field);\
! 192: } else { \
! 193: __tmp = SPLAY_RIGHT((head)->sph_root, field); \
! 194: (head)->sph_root = SPLAY_LEFT((head)->sph_root, field);\
! 195: name##_SPLAY(head, elm); \
! 196: SPLAY_RIGHT((head)->sph_root, field) = __tmp; \
! 197: } \
! 198: return (elm); \
! 199: } \
! 200: return (NULL); \
! 201: } \
! 202: \
! 203: void \
! 204: name##_SPLAY(struct name *head, struct type *elm) \
! 205: { \
! 206: struct type __node, *__left, *__right, *__tmp; \
! 207: int __comp; \
! 208: \
! 209: SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
! 210: __left = __right = &__node; \
! 211: \
! 212: while ((__comp = (cmp)(elm, (head)->sph_root))) { \
! 213: if (__comp < 0) { \
! 214: __tmp = SPLAY_LEFT((head)->sph_root, field); \
! 215: if (__tmp == NULL) \
! 216: break; \
! 217: if ((cmp)(elm, __tmp) < 0){ \
! 218: SPLAY_ROTATE_RIGHT(head, __tmp, field); \
! 219: if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
! 220: break; \
! 221: } \
! 222: SPLAY_LINKLEFT(head, __right, field); \
! 223: } else if (__comp > 0) { \
! 224: __tmp = SPLAY_RIGHT((head)->sph_root, field); \
! 225: if (__tmp == NULL) \
! 226: break; \
! 227: if ((cmp)(elm, __tmp) > 0){ \
! 228: SPLAY_ROTATE_LEFT(head, __tmp, field); \
! 229: if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
! 230: break; \
! 231: } \
! 232: SPLAY_LINKRIGHT(head, __left, field); \
! 233: } \
! 234: } \
! 235: SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
! 236: } \
! 237: \
! 238: /* Splay with either the minimum or the maximum element \
! 239: * Used to find minimum or maximum element in tree. \
! 240: */ \
! 241: void name##_SPLAY_MINMAX(struct name *head, int __comp) \
! 242: { \
! 243: struct type __node, *__left, *__right, *__tmp; \
! 244: \
! 245: SPLAY_LEFT(&__node, field) = SPLAY_RIGHT(&__node, field) = NULL;\
! 246: __left = __right = &__node; \
! 247: \
! 248: while (1) { \
! 249: if (__comp < 0) { \
! 250: __tmp = SPLAY_LEFT((head)->sph_root, field); \
! 251: if (__tmp == NULL) \
! 252: break; \
! 253: if (__comp < 0){ \
! 254: SPLAY_ROTATE_RIGHT(head, __tmp, field); \
! 255: if (SPLAY_LEFT((head)->sph_root, field) == NULL)\
! 256: break; \
! 257: } \
! 258: SPLAY_LINKLEFT(head, __right, field); \
! 259: } else if (__comp > 0) { \
! 260: __tmp = SPLAY_RIGHT((head)->sph_root, field); \
! 261: if (__tmp == NULL) \
! 262: break; \
! 263: if (__comp > 0) { \
! 264: SPLAY_ROTATE_LEFT(head, __tmp, field); \
! 265: if (SPLAY_RIGHT((head)->sph_root, field) == NULL)\
! 266: break; \
! 267: } \
! 268: SPLAY_LINKRIGHT(head, __left, field); \
! 269: } \
! 270: } \
! 271: SPLAY_ASSEMBLE(head, &__node, __left, __right, field); \
! 272: }
! 273:
! 274: #define SPLAY_NEGINF -1
! 275: #define SPLAY_INF 1
! 276:
! 277: #define SPLAY_INSERT(name, x, y) name##_SPLAY_INSERT(x, y)
! 278: #define SPLAY_REMOVE(name, x, y) name##_SPLAY_REMOVE(x, y)
! 279: #define SPLAY_FIND(name, x, y) name##_SPLAY_FIND(x, y)
! 280: #define SPLAY_NEXT(name, x, y) name##_SPLAY_NEXT(x, y)
! 281: #define SPLAY_MIN(name, x) (SPLAY_EMPTY(x) ? NULL \
! 282: : name##_SPLAY_MIN_MAX(x, SPLAY_NEGINF))
! 283: #define SPLAY_MAX(name, x) (SPLAY_EMPTY(x) ? NULL \
! 284: : name##_SPLAY_MIN_MAX(x, SPLAY_INF))
! 285:
! 286: #define SPLAY_FOREACH(x, name, head) \
! 287: for ((x) = SPLAY_MIN(name, head); \
! 288: (x) != NULL; \
! 289: (x) = SPLAY_NEXT(name, head, x))
! 290:
! 291: /* Macros that define a red-back tree */
! 292: #define RB_HEAD(name, type) \
! 293: struct name { \
! 294: struct type *rbh_root; /* root of the tree */ \
! 295: }
! 296:
! 297: #define RB_INITIALIZER(root) \
! 298: { NULL }
! 299:
! 300: #define RB_INIT(root) do { \
! 301: (root)->rbh_root = NULL; \
! 302: } while (0)
! 303:
! 304: #define RB_BLACK 0
! 305: #define RB_RED 1
! 306: #define RB_ENTRY(type) \
! 307: struct { \
! 308: struct type *rbe_left; /* left element */ \
! 309: struct type *rbe_right; /* right element */ \
! 310: struct type *rbe_parent; /* parent element */ \
! 311: int rbe_color; /* node color */ \
! 312: }
! 313:
! 314: #define RB_LEFT(elm, field) (elm)->field.rbe_left
! 315: #define RB_RIGHT(elm, field) (elm)->field.rbe_right
! 316: #define RB_PARENT(elm, field) (elm)->field.rbe_parent
! 317: #define RB_COLOR(elm, field) (elm)->field.rbe_color
! 318: #define RB_ROOT(head) (head)->rbh_root
! 319: #define RB_EMPTY(head) (RB_ROOT(head) == NULL)
! 320:
! 321: #define RB_SET(elm, parent, field) do { \
! 322: RB_PARENT(elm, field) = parent; \
! 323: RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
! 324: RB_COLOR(elm, field) = RB_RED; \
! 325: } while (0)
! 326:
! 327: #define RB_SET_BLACKRED(black, red, field) do { \
! 328: RB_COLOR(black, field) = RB_BLACK; \
! 329: RB_COLOR(red, field) = RB_RED; \
! 330: } while (0)
! 331:
! 332: #ifndef RB_AUGMENT
! 333: #define RB_AUGMENT(x)
! 334: #endif
! 335:
! 336: #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \
! 337: (tmp) = RB_RIGHT(elm, field); \
! 338: if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
! 339: RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
! 340: } \
! 341: RB_AUGMENT(elm); \
! 342: if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
! 343: if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
! 344: RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
! 345: else \
! 346: RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
! 347: RB_AUGMENT(RB_PARENT(elm, field)); \
! 348: } else \
! 349: (head)->rbh_root = (tmp); \
! 350: RB_LEFT(tmp, field) = (elm); \
! 351: RB_PARENT(elm, field) = (tmp); \
! 352: RB_AUGMENT(tmp); \
! 353: } while (0)
! 354:
! 355: #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \
! 356: (tmp) = RB_LEFT(elm, field); \
! 357: if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
! 358: RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
! 359: } \
! 360: RB_AUGMENT(elm); \
! 361: if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
! 362: if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
! 363: RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
! 364: else \
! 365: RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
! 366: RB_AUGMENT(RB_PARENT(elm, field)); \
! 367: } else \
! 368: (head)->rbh_root = (tmp); \
! 369: RB_RIGHT(tmp, field) = (elm); \
! 370: RB_PARENT(elm, field) = (tmp); \
! 371: RB_AUGMENT(tmp); \
! 372: } while (0)
! 373:
! 374: /* Generates prototypes and inline functions */
! 375: #define RB_PROTOTYPE(name, type, field, cmp) \
! 376: void name##_RB_INSERT_COLOR(struct name *, struct type *); \
! 377: void name##_RB_REMOVE_COLOR(struct name *, struct type *, struct type *);\
! 378: struct type *name##_RB_REMOVE(struct name *, struct type *); \
! 379: struct type *name##_RB_INSERT(struct name *, struct type *); \
! 380: struct type *name##_RB_FIND(struct name *, struct type *); \
! 381: struct type *name##_RB_NEXT(struct name *, struct type *); \
! 382: struct type *name##_RB_MINMAX(struct name *, int); \
! 383: \
! 384:
! 385: /* Main rb operation.
! 386: * Moves node close to the key of elm to top
! 387: */
! 388: #define RB_GENERATE(name, type, field, cmp) \
! 389: void \
! 390: name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
! 391: { \
! 392: struct type *parent, *gparent, *tmp; \
! 393: while ((parent = RB_PARENT(elm, field)) && \
! 394: RB_COLOR(parent, field) == RB_RED) { \
! 395: gparent = RB_PARENT(parent, field); \
! 396: if (parent == RB_LEFT(gparent, field)) { \
! 397: tmp = RB_RIGHT(gparent, field); \
! 398: if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
! 399: RB_COLOR(tmp, field) = RB_BLACK; \
! 400: RB_SET_BLACKRED(parent, gparent, field);\
! 401: elm = gparent; \
! 402: continue; \
! 403: } \
! 404: if (RB_RIGHT(parent, field) == elm) { \
! 405: RB_ROTATE_LEFT(head, parent, tmp, field);\
! 406: tmp = parent; \
! 407: parent = elm; \
! 408: elm = tmp; \
! 409: } \
! 410: RB_SET_BLACKRED(parent, gparent, field); \
! 411: RB_ROTATE_RIGHT(head, gparent, tmp, field); \
! 412: } else { \
! 413: tmp = RB_LEFT(gparent, field); \
! 414: if (tmp && RB_COLOR(tmp, field) == RB_RED) { \
! 415: RB_COLOR(tmp, field) = RB_BLACK; \
! 416: RB_SET_BLACKRED(parent, gparent, field);\
! 417: elm = gparent; \
! 418: continue; \
! 419: } \
! 420: if (RB_LEFT(parent, field) == elm) { \
! 421: RB_ROTATE_RIGHT(head, parent, tmp, field);\
! 422: tmp = parent; \
! 423: parent = elm; \
! 424: elm = tmp; \
! 425: } \
! 426: RB_SET_BLACKRED(parent, gparent, field); \
! 427: RB_ROTATE_LEFT(head, gparent, tmp, field); \
! 428: } \
! 429: } \
! 430: RB_COLOR(head->rbh_root, field) = RB_BLACK; \
! 431: } \
! 432: \
! 433: void \
! 434: name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
! 435: { \
! 436: struct type *tmp; \
! 437: while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
! 438: elm != RB_ROOT(head)) { \
! 439: if (RB_LEFT(parent, field) == elm) { \
! 440: tmp = RB_RIGHT(parent, field); \
! 441: if (RB_COLOR(tmp, field) == RB_RED) { \
! 442: RB_SET_BLACKRED(tmp, parent, field); \
! 443: RB_ROTATE_LEFT(head, parent, tmp, field);\
! 444: tmp = RB_RIGHT(parent, field); \
! 445: } \
! 446: if ((RB_LEFT(tmp, field) == NULL || \
! 447: RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
! 448: (RB_RIGHT(tmp, field) == NULL || \
! 449: RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
! 450: RB_COLOR(tmp, field) = RB_RED; \
! 451: elm = parent; \
! 452: parent = RB_PARENT(elm, field); \
! 453: } else { \
! 454: if (RB_RIGHT(tmp, field) == NULL || \
! 455: RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
! 456: struct type *oleft; \
! 457: if ((oleft = RB_LEFT(tmp, field)))\
! 458: RB_COLOR(oleft, field) = RB_BLACK;\
! 459: RB_COLOR(tmp, field) = RB_RED; \
! 460: RB_ROTATE_RIGHT(head, tmp, oleft, field);\
! 461: tmp = RB_RIGHT(parent, field); \
! 462: } \
! 463: RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
! 464: RB_COLOR(parent, field) = RB_BLACK; \
! 465: if (RB_RIGHT(tmp, field)) \
! 466: RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
! 467: RB_ROTATE_LEFT(head, parent, tmp, field);\
! 468: elm = RB_ROOT(head); \
! 469: break; \
! 470: } \
! 471: } else { \
! 472: tmp = RB_LEFT(parent, field); \
! 473: if (RB_COLOR(tmp, field) == RB_RED) { \
! 474: RB_SET_BLACKRED(tmp, parent, field); \
! 475: RB_ROTATE_RIGHT(head, parent, tmp, field);\
! 476: tmp = RB_LEFT(parent, field); \
! 477: } \
! 478: if ((RB_LEFT(tmp, field) == NULL || \
! 479: RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
! 480: (RB_RIGHT(tmp, field) == NULL || \
! 481: RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
! 482: RB_COLOR(tmp, field) = RB_RED; \
! 483: elm = parent; \
! 484: parent = RB_PARENT(elm, field); \
! 485: } else { \
! 486: if (RB_LEFT(tmp, field) == NULL || \
! 487: RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
! 488: struct type *oright; \
! 489: if ((oright = RB_RIGHT(tmp, field)))\
! 490: RB_COLOR(oright, field) = RB_BLACK;\
! 491: RB_COLOR(tmp, field) = RB_RED; \
! 492: RB_ROTATE_LEFT(head, tmp, oright, field);\
! 493: tmp = RB_LEFT(parent, field); \
! 494: } \
! 495: RB_COLOR(tmp, field) = RB_COLOR(parent, field);\
! 496: RB_COLOR(parent, field) = RB_BLACK; \
! 497: if (RB_LEFT(tmp, field)) \
! 498: RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
! 499: RB_ROTATE_RIGHT(head, parent, tmp, field);\
! 500: elm = RB_ROOT(head); \
! 501: break; \
! 502: } \
! 503: } \
! 504: } \
! 505: if (elm) \
! 506: RB_COLOR(elm, field) = RB_BLACK; \
! 507: } \
! 508: \
! 509: struct type * \
! 510: name##_RB_REMOVE(struct name *head, struct type *elm) \
! 511: { \
! 512: struct type *child, *parent, *old = elm; \
! 513: int color; \
! 514: if (RB_LEFT(elm, field) == NULL) \
! 515: child = RB_RIGHT(elm, field); \
! 516: else if (RB_RIGHT(elm, field) == NULL) \
! 517: child = RB_LEFT(elm, field); \
! 518: else { \
! 519: struct type *left; \
! 520: elm = RB_RIGHT(elm, field); \
! 521: while ((left = RB_LEFT(elm, field))) \
! 522: elm = left; \
! 523: child = RB_RIGHT(elm, field); \
! 524: parent = RB_PARENT(elm, field); \
! 525: color = RB_COLOR(elm, field); \
! 526: if (child) \
! 527: RB_PARENT(child, field) = parent; \
! 528: if (parent) { \
! 529: if (RB_LEFT(parent, field) == elm) \
! 530: RB_LEFT(parent, field) = child; \
! 531: else \
! 532: RB_RIGHT(parent, field) = child; \
! 533: RB_AUGMENT(parent); \
! 534: } else \
! 535: RB_ROOT(head) = child; \
! 536: if (RB_PARENT(elm, field) == old) \
! 537: parent = elm; \
! 538: (elm)->field = (old)->field; \
! 539: if (RB_PARENT(old, field)) { \
! 540: if (RB_LEFT(RB_PARENT(old, field), field) == old)\
! 541: RB_LEFT(RB_PARENT(old, field), field) = elm;\
! 542: else \
! 543: RB_RIGHT(RB_PARENT(old, field), field) = elm;\
! 544: RB_AUGMENT(RB_PARENT(old, field)); \
! 545: } else \
! 546: RB_ROOT(head) = elm; \
! 547: RB_PARENT(RB_LEFT(old, field), field) = elm; \
! 548: if (RB_RIGHT(old, field)) \
! 549: RB_PARENT(RB_RIGHT(old, field), field) = elm; \
! 550: if (parent) { \
! 551: left = parent; \
! 552: do { \
! 553: RB_AUGMENT(left); \
! 554: } while ((left = RB_PARENT(left, field))); \
! 555: } \
! 556: goto color; \
! 557: } \
! 558: parent = RB_PARENT(elm, field); \
! 559: color = RB_COLOR(elm, field); \
! 560: if (child) \
! 561: RB_PARENT(child, field) = parent; \
! 562: if (parent) { \
! 563: if (RB_LEFT(parent, field) == elm) \
! 564: RB_LEFT(parent, field) = child; \
! 565: else \
! 566: RB_RIGHT(parent, field) = child; \
! 567: RB_AUGMENT(parent); \
! 568: } else \
! 569: RB_ROOT(head) = child; \
! 570: color: \
! 571: if (color == RB_BLACK) \
! 572: name##_RB_REMOVE_COLOR(head, parent, child); \
! 573: return (old); \
! 574: } \
! 575: \
! 576: /* Inserts a node into the RB tree */ \
! 577: struct type * \
! 578: name##_RB_INSERT(struct name *head, struct type *elm) \
! 579: { \
! 580: struct type *tmp; \
! 581: struct type *parent = NULL; \
! 582: int comp = 0; \
! 583: tmp = RB_ROOT(head); \
! 584: while (tmp) { \
! 585: parent = tmp; \
! 586: comp = (cmp)(elm, parent); \
! 587: if (comp < 0) \
! 588: tmp = RB_LEFT(tmp, field); \
! 589: else if (comp > 0) \
! 590: tmp = RB_RIGHT(tmp, field); \
! 591: else \
! 592: return (tmp); \
! 593: } \
! 594: RB_SET(elm, parent, field); \
! 595: if (parent != NULL) { \
! 596: if (comp < 0) \
! 597: RB_LEFT(parent, field) = elm; \
! 598: else \
! 599: RB_RIGHT(parent, field) = elm; \
! 600: RB_AUGMENT(parent); \
! 601: } else \
! 602: RB_ROOT(head) = elm; \
! 603: name##_RB_INSERT_COLOR(head, elm); \
! 604: return (NULL); \
! 605: } \
! 606: \
! 607: /* Finds the node with the same key as elm */ \
! 608: struct type * \
! 609: name##_RB_FIND(struct name *head, struct type *elm) \
! 610: { \
! 611: struct type *tmp = RB_ROOT(head); \
! 612: int comp; \
! 613: while (tmp) { \
! 614: comp = cmp(elm, tmp); \
! 615: if (comp < 0) \
! 616: tmp = RB_LEFT(tmp, field); \
! 617: else if (comp > 0) \
! 618: tmp = RB_RIGHT(tmp, field); \
! 619: else \
! 620: return (tmp); \
! 621: } \
! 622: return (NULL); \
! 623: } \
! 624: \
! 625: struct type * \
! 626: name##_RB_NEXT(struct name *head, struct type *elm) \
! 627: { \
! 628: if (RB_RIGHT(elm, field)) { \
! 629: elm = RB_RIGHT(elm, field); \
! 630: while (RB_LEFT(elm, field)) \
! 631: elm = RB_LEFT(elm, field); \
! 632: } else { \
! 633: if (RB_PARENT(elm, field) && \
! 634: (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
! 635: elm = RB_PARENT(elm, field); \
! 636: else { \
! 637: while (RB_PARENT(elm, field) && \
! 638: (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
! 639: elm = RB_PARENT(elm, field); \
! 640: elm = RB_PARENT(elm, field); \
! 641: } \
! 642: } \
! 643: return (elm); \
! 644: } \
! 645: \
! 646: struct type * \
! 647: name##_RB_MINMAX(struct name *head, int val) \
! 648: { \
! 649: struct type *tmp = RB_ROOT(head); \
! 650: struct type *parent = NULL; \
! 651: while (tmp) { \
! 652: parent = tmp; \
! 653: if (val < 0) \
! 654: tmp = RB_LEFT(tmp, field); \
! 655: else \
! 656: tmp = RB_RIGHT(tmp, field); \
! 657: } \
! 658: return (parent); \
! 659: }
! 660:
! 661: #define RB_NEGINF -1
! 662: #define RB_INF 1
! 663:
! 664: #define RB_INSERT(name, x, y) name##_RB_INSERT(x, y)
! 665: #define RB_REMOVE(name, x, y) name##_RB_REMOVE(x, y)
! 666: #define RB_FIND(name, x, y) name##_RB_FIND(x, y)
! 667: #define RB_NEXT(name, x, y) name##_RB_NEXT(x, y)
! 668: #define RB_MIN(name, x) name##_RB_MINMAX(x, RB_NEGINF)
! 669: #define RB_MAX(name, x) name##_RB_MINMAX(x, RB_INF)
! 670:
! 671: #define RB_FOREACH(x, name, head) \
! 672: for ((x) = RB_MIN(name, head); \
! 673: (x) != NULL; \
! 674: (x) = name##_RB_NEXT(head, x))
! 675:
! 676: #endif /* _SYS_TREE_H_ */