Lines Matching refs:elm
80 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
81 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
127 name##_SPLAY_FIND(struct name *head, struct type *elm) \
131 name##_SPLAY(head, elm); \
132 if ((cmp)(elm, (head)->sph_root) == 0) \
138 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
140 name##_SPLAY(head, elm); \
141 if (SPLAY_RIGHT(elm, field) != NULL) { \
142 elm = SPLAY_RIGHT(elm, field); \
143 while (SPLAY_LEFT(elm, field) != NULL) { \
144 elm = SPLAY_LEFT(elm, field); \
147 elm = NULL; \
148 return (elm); \
163 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
166 SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
169 name##_SPLAY(head, elm); \
170 __comp = (cmp)(elm, (head)->sph_root); \
172 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
173 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
176 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
177 SPLAY_LEFT(elm, field) = (head)->sph_root; \
182 (head)->sph_root = (elm); \
187 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
192 name##_SPLAY(head, elm); \
193 if ((cmp)(elm, (head)->sph_root) == 0) { \
199 name##_SPLAY(head, elm); \
202 return (elm); \
208 name##_SPLAY(struct name *head, struct type *elm) \
216 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
221 if ((cmp)(elm, __tmp) < 0){ \
231 if ((cmp)(elm, __tmp) > 0){ \
318 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
319 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
320 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
321 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
325 #define RB_SET(elm, parent, field) do { \ argument
326 RB_PARENT(elm, field) = parent; \
327 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
328 RB_COLOR(elm, field) = RB_RED; \
340 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
341 (tmp) = RB_RIGHT(elm, field); \
342 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) { \
343 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
345 RB_AUGMENT(elm); \
346 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
347 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
348 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
350 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
353 RB_LEFT(tmp, field) = (elm); \
354 RB_PARENT(elm, field) = (tmp); \
360 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
361 (tmp) = RB_LEFT(elm, field); \
362 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) { \
363 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
365 RB_AUGMENT(elm); \
366 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
367 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
368 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
370 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
373 RB_RIGHT(tmp, field) = (elm); \
374 RB_PARENT(elm, field) = (tmp); \
434 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
437 while ((parent = RB_PARENT(elm, field)) != NULL && \
445 elm = gparent; \
448 if (RB_RIGHT(parent, field) == elm) { \
451 parent = elm; \
452 elm = tmp; \
461 elm = gparent; \
464 if (RB_LEFT(parent, field) == elm) { \
467 parent = elm; \
468 elm = tmp; \
479 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
482 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
483 elm != RB_ROOT(head)) { \
484 if (RB_LEFT(parent, field) == elm) { \
496 elm = parent; \
497 parent = RB_PARENT(elm, field); \
514 elm = RB_ROOT(head); \
529 elm = parent; \
530 parent = RB_PARENT(elm, field); \
547 elm = RB_ROOT(head); \
552 if (elm) \
553 RB_COLOR(elm, field) = RB_BLACK; \
558 name##_RB_REMOVE(struct name *head, struct type *elm) \
560 struct type *child, *parent, *old = elm; \
562 if (RB_LEFT(elm, field) == NULL) \
563 child = RB_RIGHT(elm, field); \
564 else if (RB_RIGHT(elm, field) == NULL) \
565 child = RB_LEFT(elm, field); \
568 elm = RB_RIGHT(elm, field); \
569 while ((left = RB_LEFT(elm, field)) != NULL) \
570 elm = left; \
571 child = RB_RIGHT(elm, field); \
572 parent = RB_PARENT(elm, field); \
573 color = RB_COLOR(elm, field); \
577 if (RB_LEFT(parent, field) == elm) \
584 if (RB_PARENT(elm, field) == old) \
585 parent = elm; \
586 (elm)->field = (old)->field; \
589 RB_LEFT(RB_PARENT(old, field), field) = elm;\
591 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
594 RB_ROOT(head) = elm; \
595 RB_PARENT(RB_LEFT(old, field), field) = elm; \
597 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
606 parent = RB_PARENT(elm, field); \
607 color = RB_COLOR(elm, field); \
611 if (RB_LEFT(parent, field) == elm) \
627 name##_RB_INSERT(struct name *head, struct type *elm) \
635 comp = (cmp)(elm, parent); \
643 RB_SET(elm, parent, field); \
646 RB_LEFT(parent, field) = elm; \
648 RB_RIGHT(parent, field) = elm; \
651 RB_ROOT(head) = elm; \
652 name##_RB_INSERT_COLOR(head, elm); \
659 name##_RB_FIND(struct name *head, struct type *elm) \
664 comp = cmp(elm, tmp); \
678 name##_RB_NFIND(struct name *head, struct type *elm) \
684 comp = cmp(elm, tmp); \
700 name##_RB_NEXT(struct type *elm) \
702 if (RB_RIGHT(elm, field)) { \
703 elm = RB_RIGHT(elm, field); \
704 while (RB_LEFT(elm, field)) \
705 elm = RB_LEFT(elm, field); \
707 if (RB_PARENT(elm, field) && \
708 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
709 elm = RB_PARENT(elm, field); \
711 while (RB_PARENT(elm, field) && \
712 (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
713 elm = RB_PARENT(elm, field); \
714 elm = RB_PARENT(elm, field); \
717 return (elm); \
723 name##_RB_PREV(struct type *elm) \
725 if (RB_LEFT(elm, field)) { \
726 elm = RB_LEFT(elm, field); \
727 while (RB_RIGHT(elm, field)) \
728 elm = RB_RIGHT(elm, field); \
730 if (RB_PARENT(elm, field) && \
731 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
732 elm = RB_PARENT(elm, field); \
734 while (RB_PARENT(elm, field) && \
735 (elm == RB_LEFT(RB_PARENT(elm, field), field)))\
736 elm = RB_PARENT(elm, field); \
737 elm = RB_PARENT(elm, field); \
740 return (elm); \