Lines Matching refs:elm
82 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
83 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
129 name##_SPLAY_FIND(struct name *head, struct type *elm) \
133 name##_SPLAY(head, elm); \
134 if ((cmp)(elm, (head)->sph_root) == 0) \
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); \
149 elm = NULL; \
150 return (elm); \
165 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
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; \
178 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field); \
179 SPLAY_LEFT(elm, field) = (head)->sph_root; \
184 (head)->sph_root = (elm); \
189 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
194 name##_SPLAY(head, elm); \
195 if ((cmp)(elm, (head)->sph_root) == 0) { \
201 name##_SPLAY(head, elm); \
204 return (elm); \
210 name##_SPLAY(struct name *head, struct type *elm) \
218 while ((__comp = (cmp)(elm, (head)->sph_root)) != 0) { \
223 if ((cmp)(elm, __tmp) < 0){ \
233 if ((cmp)(elm, __tmp) > 0){ \
320 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
321 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
322 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
323 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
327 #define RB_SET(elm, parent, field) do { \ argument
328 RB_PARENT(elm, field) = parent; \
329 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
330 RB_COLOR(elm, field) = RB_RED; \
342 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
343 (tmp) = RB_RIGHT(elm, field); \
344 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) { \
345 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
347 RB_AUGMENT(elm); \
348 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
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); \
355 RB_LEFT(tmp, field) = (elm); \
356 RB_PARENT(elm, field) = (tmp); \
362 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
363 (tmp) = RB_LEFT(elm, field); \
364 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) { \
365 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
367 RB_AUGMENT(elm); \
368 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \
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); \
375 RB_RIGHT(tmp, field) = (elm); \
376 RB_PARENT(elm, field) = (tmp); \
408 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
411 while ((parent = RB_PARENT(elm, field)) != NULL && \
419 elm = gparent; \
422 if (RB_RIGHT(parent, field) == elm) { \
425 parent = elm; \
426 elm = tmp; \
435 elm = gparent; \
438 if (RB_LEFT(parent, field) == elm) { \
441 parent = elm; \
442 elm = tmp; \
453 struct type *elm) \
456 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
457 elm != RB_ROOT(head)) { \
458 if (RB_LEFT(parent, field) == elm) { \
470 elm = parent; \
471 parent = RB_PARENT(elm, field); \
488 elm = RB_ROOT(head); \
503 elm = parent; \
504 parent = RB_PARENT(elm, field); \
521 elm = RB_ROOT(head); \
526 if (elm) \
527 RB_COLOR(elm, field) = RB_BLACK; \
531 name##_RB_REMOVE(struct name *head, struct type *elm) \
533 struct type *child, *parent, *old = elm; \
535 if (RB_LEFT(elm, field) == NULL) \
536 child = RB_RIGHT(elm, field); \
537 else if (RB_RIGHT(elm, field) == NULL) \
538 child = RB_LEFT(elm, field); \
541 elm = RB_RIGHT(elm, field); \
542 while ((left = RB_LEFT(elm, field)) != NULL) \
543 elm = left; \
544 child = RB_RIGHT(elm, field); \
545 parent = RB_PARENT(elm, field); \
546 color = RB_COLOR(elm, field); \
550 if (RB_LEFT(parent, field) == elm) \
557 if (RB_PARENT(elm, field) == old) \
558 parent = elm; \
559 (elm)->field = (old)->field; \
562 RB_LEFT(RB_PARENT(old, field), field) = elm; \
564 RB_RIGHT(RB_PARENT(old, field), field) = elm; \
567 RB_ROOT(head) = elm; \
568 RB_PARENT(RB_LEFT(old, field), field) = elm; \
570 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
579 parent = RB_PARENT(elm, field); \
580 color = RB_COLOR(elm, field); \
584 if (RB_LEFT(parent, field) == elm) \
599 name##_RB_INSERT(struct name *head, struct type *elm) \
607 comp = (cmp)(elm, parent); \
615 RB_SET(elm, parent, field); \
618 RB_LEFT(parent, field) = elm; \
620 RB_RIGHT(parent, field) = elm; \
623 RB_ROOT(head) = elm; \
624 name##_RB_INSERT_COLOR(head, elm); \
630 name##_RB_FIND(struct name *head, struct type *elm) \
635 comp = cmp(elm, tmp); \
648 name##_RB_NFIND(struct name *head, struct type *elm) \
654 comp = cmp(elm, tmp); \
669 name##_RB_NEXT(struct type *elm) \
671 if (RB_RIGHT(elm, field)) { \
672 elm = RB_RIGHT(elm, field); \
673 while (RB_LEFT(elm, field)) \
674 elm = RB_LEFT(elm, field); \
676 if (RB_PARENT(elm, field) && \
677 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
678 elm = RB_PARENT(elm, field); \
680 while (RB_PARENT(elm, field) && \
681 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
682 elm = RB_PARENT(elm, field); \
683 elm = RB_PARENT(elm, field); \
686 return (elm); \
691 name##_RB_PREV(struct type *elm) \
693 if (RB_LEFT(elm, field)) { \
694 elm = RB_LEFT(elm, field); \
695 while (RB_RIGHT(elm, field)) \
696 elm = RB_RIGHT(elm, field); \
698 if (RB_PARENT(elm, field) && \
699 (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
700 elm = RB_PARENT(elm, field); \
702 while (RB_PARENT(elm, field) && \
703 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
704 elm = RB_PARENT(elm, field); \
705 elm = RB_PARENT(elm, field); \
708 return (elm); \