Symbol: RB_RIGHT
regress/sys/sys/tree/rb/rb-test.c
882
if (RB_RIGHT(n, node_link))
regress/sys/sys/tree/rb/rb-test.c
883
print_helper(RB_RIGHT(n, node_link), indent + 4);
regress/sys/sys/tree/rb/rb-test.c
908
if ((RB_RIGHT(elm, node_link))) {
regress/sys/sys/tree/rb/rb-test.c
909
newsize += (RB_RIGHT(elm, node_link))->size;
regress/sys/sys/tree/rb/rb-test.c
910
newheight = MAX((RB_RIGHT(elm, node_link))->height, newheight);
sys/dev/pci/drm/include/linux/rbtree.h
100
node = RB_RIGHT(node, __entry);
sys/dev/pci/drm/include/linux/rbtree.h
112
(RB_RIGHT(parent, __entry)))
sys/dev/pci/drm/include/linux/rbtree.h
113
return __rb_deepest_left(RB_RIGHT(parent, __entry));
sys/sys/tree.h
324
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
sys/sys/tree.h
338
(tmp) = RB_RIGHT(elm, field); \
sys/sys/tree.h
339
if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
sys/sys/tree.h
347
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
sys/sys/tree.h
359
if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
sys/sys/tree.h
360
RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
sys/sys/tree.h
367
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
sys/sys/tree.h
370
RB_RIGHT(tmp, field) = (elm); \
sys/sys/tree.h
410
tmp = RB_RIGHT(gparent, field); \
sys/sys/tree.h
417
if (RB_RIGHT(parent, field) == elm) { \
sys/sys/tree.h
453
tmp = RB_RIGHT(parent, field); \
sys/sys/tree.h
457
tmp = RB_RIGHT(parent, field); \
sys/sys/tree.h
461
(RB_RIGHT(tmp, field) == NULL || \
sys/sys/tree.h
462
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
sys/sys/tree.h
467
if (RB_RIGHT(tmp, field) == NULL || \
sys/sys/tree.h
468
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
sys/sys/tree.h
474
tmp = RB_RIGHT(parent, field); \
sys/sys/tree.h
478
if (RB_RIGHT(tmp, field)) \
sys/sys/tree.h
479
RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
sys/sys/tree.h
493
(RB_RIGHT(tmp, field) == NULL || \
sys/sys/tree.h
494
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
sys/sys/tree.h
502
if ((oright = RB_RIGHT(tmp, field)))\
sys/sys/tree.h
528
child = RB_RIGHT(elm, field); \
sys/sys/tree.h
529
else if (RB_RIGHT(elm, field) == NULL) \
sys/sys/tree.h
533
elm = RB_RIGHT(elm, field); \
sys/sys/tree.h
536
child = RB_RIGHT(elm, field); \
sys/sys/tree.h
545
RB_RIGHT(parent, field) = child; \
sys/sys/tree.h
556
RB_RIGHT(RB_PARENT(old, field), field) = elm;\
sys/sys/tree.h
561
if (RB_RIGHT(old, field)) \
sys/sys/tree.h
562
RB_PARENT(RB_RIGHT(old, field), field) = elm; \
sys/sys/tree.h
579
RB_RIGHT(parent, field) = child; \
sys/sys/tree.h
603
tmp = RB_RIGHT(tmp, field); \
sys/sys/tree.h
612
RB_RIGHT(parent, field) = elm; \
sys/sys/tree.h
631
tmp = RB_RIGHT(tmp, field); \
sys/sys/tree.h
652
tmp = RB_RIGHT(tmp, field); \
sys/sys/tree.h
662
if (RB_RIGHT(elm, field)) { \
sys/sys/tree.h
663
elm = RB_RIGHT(elm, field); \
sys/sys/tree.h
672
(elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
sys/sys/tree.h
685
while (RB_RIGHT(elm, field)) \
sys/sys/tree.h
686
elm = RB_RIGHT(elm, field); \
sys/sys/tree.h
689
(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
sys/sys/tree.h
711
tmp = RB_RIGHT(tmp, field); \