Lines Matching refs:elm
79 #define SPLAY_LEFT(elm, field) (elm)->field.spe_left argument
80 #define SPLAY_RIGHT(elm, field) (elm)->field.spe_right argument
126 name##_SPLAY_FIND(struct name *head, struct type *elm) \
130 name##_SPLAY(head, elm); \
131 if ((cmp)(elm, (head)->sph_root) == 0) \
137 name##_SPLAY_NEXT(struct name *head, struct type *elm) \
139 name##_SPLAY(head, elm); \
140 if (SPLAY_RIGHT(elm, field) != NULL) { \
141 elm = SPLAY_RIGHT(elm, field); \
142 while (SPLAY_LEFT(elm, field) != NULL) { \
143 elm = SPLAY_LEFT(elm, field); \
146 elm = NULL; \
147 return (elm); \
162 name##_SPLAY_INSERT(struct name *head, struct type *elm) \
165 SPLAY_LEFT(elm, field) = SPLAY_RIGHT(elm, field) = NULL; \
168 name##_SPLAY(head, elm); \
169 __comp = (cmp)(elm, (head)->sph_root); \
171 SPLAY_LEFT(elm, field) = SPLAY_LEFT((head)->sph_root, field);\
172 SPLAY_RIGHT(elm, field) = (head)->sph_root; \
175 SPLAY_RIGHT(elm, field) = SPLAY_RIGHT((head)->sph_root, field);\
176 SPLAY_LEFT(elm, field) = (head)->sph_root; \
181 (head)->sph_root = (elm); \
186 name##_SPLAY_REMOVE(struct name *head, struct type *elm) \
191 name##_SPLAY(head, elm); \
192 if ((cmp)(elm, (head)->sph_root) == 0) { \
198 name##_SPLAY(head, elm); \
201 return (elm); \
207 name##_SPLAY(struct name *head, struct type *elm) \
215 while ((__comp = (cmp)(elm, (head)->sph_root))) { \
220 if ((cmp)(elm, __tmp) < 0){ \
230 if ((cmp)(elm, __tmp) > 0){ \
317 #define RB_LEFT(elm, field) (elm)->field.rbe_left argument
318 #define RB_RIGHT(elm, field) (elm)->field.rbe_right argument
319 #define RB_PARENT(elm, field) (elm)->field.rbe_parent argument
320 #define RB_COLOR(elm, field) (elm)->field.rbe_color argument
324 #define RB_SET(elm, parent, field) do { \ argument
325 RB_PARENT(elm, field) = parent; \
326 RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
327 RB_COLOR(elm, field) = RB_RED; \
339 #define RB_ROTATE_LEFT(head, elm, tmp, field) do { \ argument
340 (tmp) = RB_RIGHT(elm, field); \
341 if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
342 RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
344 RB_AUGMENT(elm); \
345 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
346 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
347 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
349 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
350 RB_AUGMENT(RB_PARENT(elm, field)); \
353 RB_LEFT(tmp, field) = (elm); \
354 RB_PARENT(elm, field) = (tmp); \
358 #define RB_ROTATE_RIGHT(head, elm, tmp, field) do { \ argument
359 (tmp) = RB_LEFT(elm, field); \
360 if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
361 RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
363 RB_AUGMENT(elm); \
364 if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field))) { \
365 if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
366 RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
368 RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
369 RB_AUGMENT(RB_PARENT(elm, field)); \
372 RB_RIGHT(tmp, field) = (elm); \
373 RB_PARENT(elm, field) = (tmp); \
392 name##_RB_INSERT_COLOR(struct name *head, struct type *elm) \
395 while ((parent = RB_PARENT(elm, field)) && \
403 elm = gparent; \
406 if (RB_RIGHT(parent, field) == elm) { \
409 parent = elm; \
410 elm = tmp; \
419 elm = gparent; \
422 if (RB_LEFT(parent, field) == elm) { \
425 parent = elm; \
426 elm = tmp; \
436 name##_RB_REMOVE_COLOR(struct name *head, struct type *parent, struct type *elm) \
439 while ((elm == NULL || RB_COLOR(elm, field) == RB_BLACK) && \
440 elm != RB_ROOT(head)) { \
441 if (RB_LEFT(parent, field) == elm) { \
453 elm = parent; \
454 parent = RB_PARENT(elm, field); \
470 elm = RB_ROOT(head); \
485 elm = parent; \
486 parent = RB_PARENT(elm, field); \
502 elm = RB_ROOT(head); \
507 if (elm) \
508 RB_COLOR(elm, field) = RB_BLACK; \
512 name##_RB_REMOVE(struct name *head, struct type *elm) \
514 struct type *child, *parent, *old = elm; \
516 if (RB_LEFT(elm, field) == NULL) \
517 child = RB_RIGHT(elm, field); \
518 else if (RB_RIGHT(elm, field) == NULL) \
519 child = RB_LEFT(elm, field); \
522 elm = RB_RIGHT(elm, field); \
523 while ((left = RB_LEFT(elm, field))) \
524 elm = left; \
525 child = RB_RIGHT(elm, field); \
526 parent = RB_PARENT(elm, field); \
527 color = RB_COLOR(elm, field); \
531 if (RB_LEFT(parent, field) == elm) \
538 if (RB_PARENT(elm, field) == old) \
539 parent = elm; \
540 (elm)->field = (old)->field; \
543 RB_LEFT(RB_PARENT(old, field), field) = elm;\
545 RB_RIGHT(RB_PARENT(old, field), field) = elm;\
548 RB_ROOT(head) = elm; \
549 RB_PARENT(RB_LEFT(old, field), field) = elm; \
551 RB_PARENT(RB_RIGHT(old, field), field) = elm; \
560 parent = RB_PARENT(elm, field); \
561 color = RB_COLOR(elm, field); \
565 if (RB_LEFT(parent, field) == elm) \
580 name##_RB_INSERT(struct name *head, struct type *elm) \
588 comp = (cmp)(elm, parent); \
596 RB_SET(elm, parent, field); \
599 RB_LEFT(parent, field) = elm; \
601 RB_RIGHT(parent, field) = elm; \
604 RB_ROOT(head) = elm; \
605 name##_RB_INSERT_COLOR(head, elm); \
611 name##_RB_FIND(struct name *head, struct type *elm) \
616 comp = cmp(elm, tmp); \
628 name##_RB_NEXT(struct name *head, struct type *elm) \
630 if (RB_RIGHT(elm, field)) { \
631 elm = RB_RIGHT(elm, field); \
632 while (RB_LEFT(elm, field)) \
633 elm = RB_LEFT(elm, field); \
635 if (RB_PARENT(elm, field) && \
636 (elm == RB_LEFT(RB_PARENT(elm, field), field))) \
637 elm = RB_PARENT(elm, field); \
639 while (RB_PARENT(elm, field) && \
640 (elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
641 elm = RB_PARENT(elm, field); \
642 elm = RB_PARENT(elm, field); \
645 return (elm); \