RB_LEFT
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \
RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \
if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
RB_LEFT(tmp, field) = (elm); \
(tmp) = RB_LEFT(elm, field); \
if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \
if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \
RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \
if (parent == RB_LEFT(gparent, field)) { \
tmp = RB_LEFT(gparent, field); \
if (RB_LEFT(parent, field) == elm) { \
if (RB_LEFT(parent, field) == elm) { \
if ((RB_LEFT(tmp, field) == NULL || \
RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
if ((oleft = RB_LEFT(tmp, field)))\
tmp = RB_LEFT(parent, field); \
tmp = RB_LEFT(parent, field); \
if ((RB_LEFT(tmp, field) == NULL || \
RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\
if (RB_LEFT(tmp, field) == NULL || \
RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\
tmp = RB_LEFT(parent, field); \
if (RB_LEFT(tmp, field)) \
RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\
if (RB_LEFT(elm, field) == NULL) \
child = RB_LEFT(elm, field); \
while ((left = RB_LEFT(elm, field))) \
if (RB_LEFT(parent, field) == elm) \
RB_LEFT(parent, field) = child; \
if (RB_LEFT(RB_PARENT(old, field), field) == old)\
RB_LEFT(RB_PARENT(old, field), field) = elm;\
RB_PARENT(RB_LEFT(old, field), field) = elm; \
if (RB_LEFT(parent, field) == elm) \
RB_LEFT(parent, field) = child; \
tmp = RB_LEFT(tmp, field); \
RB_LEFT(parent, field) = elm; \
tmp = RB_LEFT(tmp, field); \
tmp = RB_LEFT(tmp, field); \
while (RB_LEFT(elm, field)) \
elm = RB_LEFT(elm, field); \
(elm == RB_LEFT(RB_PARENT(elm, field), field))) \
if (RB_LEFT(elm, field)) { \
elm = RB_LEFT(elm, field); \
(elm == RB_LEFT(RB_PARENT(elm, field), field)))\
tmp = RB_LEFT(tmp, field); \
(node == RB_LEFT(parent, __entry)) &&
if (RB_LEFT(victim, __entry))
RB_SET_PARENT(RB_LEFT(victim, __entry), new, __entry);
link = &RB_LEFT(parent, __entry);
if (RB_LEFT(node, __entry))
node = RB_LEFT(node, __entry);
bo = RB_LEFT(bo, vm_rb);
if ((child = RB_LEFT(entry, rb_entry)) != NULL) {
l = RB_LEFT(entry, rb_entry);
else if (RB_LEFT(entry, rb_entry) != NULL)
nbr = RB_LEFT(entry, rb_entry);
while ((next = RB_LEFT(curr, rb_entry)) != NULL &&
if ((first = RB_LEFT(curr, rb_entry)) != NULL &&
if ((first = RB_LEFT(curr, rb_entry)) != NULL &&
curr = RB_LEFT(curr, rb_entry);
if ((first = RB_LEFT(curr, rb_entry)) != NULL &&
ARB_SELFIDX(ctd64tree, RB_LEFT(rbctd64, rblnk))
RB_LEFT(parent, rblnk) == rbctd64 ?
RB_LEFT(rbctd64, rblnk)),
tmp = RB_LEFT(tmp, field); \
RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \
else if ((out) == RB_LEFT(par, field)) \
RB_LEFT(par, field) = (in); \
left = RB_LEFT(elm, field); \
RB_LEFT(parent, field) == elm) { \
child = RB_LEFT(out, field); \
while (RB_LEFT(in, field)) \
in = RB_LEFT(in, field); \
RB_LEFT(in, field) = child; \
RB_LEFT(parent, field) = child; \
if (parent == in && RB_LEFT(parent, field) == NULL) { \
tmpp = &RB_LEFT(parent, field); \
tmp = RB_LEFT(tmp, field); \
tmp = RB_LEFT(tmp, field); \
while (RB_LEFT(elm, field)) \
elm = RB_LEFT(elm, field); \
tmpp = &RB_LEFT(elm, field); \
if (RB_LEFT(elm, field)) { \
elm = RB_LEFT(elm, field); \
(elm == RB_LEFT(RB_PARENT(elm, field), field))) \
struct type **tmpp = &RB_LEFT(elm, field); \
l = RB_LEFT(entry, rb_entry);