RB_RIGHT
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
(tmp) = RB_RIGHT(elm, field); \
if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \
RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \
RB_RIGHT(tmp, field) = (elm); \
tmp = RB_RIGHT(gparent, field); \
if (RB_RIGHT(parent, field) == elm) { \
tmp = RB_RIGHT(parent, field); \
tmp = RB_RIGHT(parent, field); \
(RB_RIGHT(tmp, field) == NULL || \
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
if (RB_RIGHT(tmp, field) == NULL || \
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK) {\
tmp = RB_RIGHT(parent, field); \
if (RB_RIGHT(tmp, field)) \
RB_COLOR(RB_RIGHT(tmp, field), field) = RB_BLACK;\
(RB_RIGHT(tmp, field) == NULL || \
RB_COLOR(RB_RIGHT(tmp, field), field) == RB_BLACK)) {\
if ((oright = RB_RIGHT(tmp, field)))\
child = RB_RIGHT(elm, field); \
else if (RB_RIGHT(elm, field) == NULL) \
elm = RB_RIGHT(elm, field); \
child = RB_RIGHT(elm, field); \
RB_RIGHT(parent, field) = child; \
RB_RIGHT(RB_PARENT(old, field), field) = elm;\
if (RB_RIGHT(old, field)) \
RB_PARENT(RB_RIGHT(old, field), field) = elm; \
RB_RIGHT(parent, field) = child; \
tmp = RB_RIGHT(tmp, field); \
RB_RIGHT(parent, field) = elm; \
tmp = RB_RIGHT(tmp, field); \
tmp = RB_RIGHT(tmp, field); \
if (RB_RIGHT(elm, field)) { \
elm = RB_RIGHT(elm, field); \
(elm == RB_RIGHT(RB_PARENT(elm, field), field)))\
while (RB_RIGHT(elm, field)) \
elm = RB_RIGHT(elm, field); \
(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
tmp = RB_RIGHT(tmp, field); \
(RB_RIGHT(parent, __entry)))
return (__rb_deepest_left(RB_RIGHT(parent, __entry)));
if (RB_RIGHT(victim, __entry))
RB_SET_PARENT(RB_RIGHT(victim, __entry), new, __entry);
link = &RB_RIGHT(parent, __entry);
node = RB_RIGHT(node, __entry);
bo = RB_RIGHT(bo, vm_rb);
if ((child = RB_RIGHT(entry, rb_entry)) != NULL) {
r = RB_RIGHT(entry, rb_entry);
if (RB_RIGHT(entry, rb_entry) != NULL)
if ((next = RB_RIGHT(curr, rb_entry)) != NULL &&
curr == RB_RIGHT(next, rb_entry))
if ((first = RB_RIGHT(curr, rb_entry)) != NULL &&
if ((first = RB_RIGHT(curr, rb_entry)) != NULL &&
curr = RB_RIGHT(curr, rb_entry);
if ((first = RB_RIGHT(curr, rb_entry)) != NULL &&
ARB_SELFIDX(ctd64tree, RB_RIGHT(rbctd64, rblnk))
RB_RIGHT(rbctd64, rblnk)),
tmp = RB_RIGHT(tmp, field); \
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
RB_RIGHT(par, field) = (in); \
right = RB_RIGHT(elm, field); \
elmdir = RB_RIGHT(parent, field) == elm ? _RB_R : _RB_L; \
if (RB_RIGHT(parent, field) == elm && \
elmdir = RB_RIGHT(parent, field) == elm ? _RB_R : _RB_L; \
in = RB_RIGHT(out, field); \
child = RB_RIGHT(in, field); \
RB_RIGHT(in, field) = parent; \
tmpp = &RB_RIGHT(parent, field); \
tmp = RB_RIGHT(tmp, field); \
tmp = RB_RIGHT(tmp, field); \
if (RB_RIGHT(elm, field)) { \
elm = RB_RIGHT(elm, field); \
(elm == RB_RIGHT(RB_PARENT(elm, field), field))) \
struct type **tmpp = &RB_RIGHT(elm, field); \
while (RB_RIGHT(elm, field)) \
elm = RB_RIGHT(elm, field); \
tmpp = &RB_RIGHT(elm, field); \
r = RB_RIGHT(entry, rb_entry);