RB_LEFT           329 include/tree.h   RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL;                          \
RB_LEFT           344 include/tree.h   if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field)) != NULL) {                 \
RB_LEFT           345 include/tree.h     RB_PARENT(RB_LEFT(tmp, field), field) = (elm);                            \
RB_LEFT           349 include/tree.h     if ((elm) == RB_LEFT(RB_PARENT(elm, field), field))                       \
RB_LEFT           350 include/tree.h       RB_LEFT(RB_PARENT(elm, field), field) = (tmp);                          \
RB_LEFT           355 include/tree.h   RB_LEFT(tmp, field) = (elm);                                                \
RB_LEFT           363 include/tree.h   (tmp) = RB_LEFT(elm, field);                                                \
RB_LEFT           364 include/tree.h   if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field)) != NULL) {                 \
RB_LEFT           369 include/tree.h     if ((elm) == RB_LEFT(RB_PARENT(elm, field), field))                       \
RB_LEFT           370 include/tree.h       RB_LEFT(RB_PARENT(elm, field), field) = (tmp);                          \
RB_LEFT           414 include/tree.h     if (parent == RB_LEFT(gparent, field)) {                                  \
RB_LEFT           431 include/tree.h       tmp = RB_LEFT(gparent, field);                                          \
RB_LEFT           438 include/tree.h       if (RB_LEFT(parent, field) == elm) {                                    \
RB_LEFT           458 include/tree.h     if (RB_LEFT(parent, field) == elm) {                                      \
RB_LEFT           465 include/tree.h       if ((RB_LEFT(tmp, field) == NULL ||                                     \
RB_LEFT           466 include/tree.h           RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&                \
RB_LEFT           476 include/tree.h           if ((oleft = RB_LEFT(tmp, field))                                   \
RB_LEFT           492 include/tree.h       tmp = RB_LEFT(parent, field);                                           \
RB_LEFT           496 include/tree.h         tmp = RB_LEFT(parent, field);                                         \
RB_LEFT           498 include/tree.h       if ((RB_LEFT(tmp, field) == NULL ||                                     \
RB_LEFT           499 include/tree.h           RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&                \
RB_LEFT           506 include/tree.h         if (RB_LEFT(tmp, field) == NULL ||                                    \
RB_LEFT           507 include/tree.h             RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {               \
RB_LEFT           514 include/tree.h           tmp = RB_LEFT(parent, field);                                       \
RB_LEFT           518 include/tree.h         if (RB_LEFT(tmp, field))                                              \
RB_LEFT           519 include/tree.h           RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;                    \
RB_LEFT           535 include/tree.h   if (RB_LEFT(elm, field) == NULL)                                            \
RB_LEFT           538 include/tree.h     child = RB_LEFT(elm, field);                                              \
RB_LEFT           542 include/tree.h     while ((left = RB_LEFT(elm, field)) != NULL)                              \
RB_LEFT           550 include/tree.h       if (RB_LEFT(parent, field) == elm)                                      \
RB_LEFT           551 include/tree.h         RB_LEFT(parent, field) = child;                                       \
RB_LEFT           561 include/tree.h       if (RB_LEFT(RB_PARENT(old, field), field) == old)                       \
RB_LEFT           562 include/tree.h         RB_LEFT(RB_PARENT(old, field), field) = elm;                          \
RB_LEFT           568 include/tree.h     RB_PARENT(RB_LEFT(old, field), field) = elm;                              \
RB_LEFT           584 include/tree.h     if (RB_LEFT(parent, field) == elm)                                        \
RB_LEFT           585 include/tree.h       RB_LEFT(parent, field) = child;                                         \
RB_LEFT           609 include/tree.h       tmp = RB_LEFT(tmp, field);                                              \
RB_LEFT           618 include/tree.h       RB_LEFT(parent, field) = elm;                                           \
RB_LEFT           637 include/tree.h       tmp = RB_LEFT(tmp, field);                                              \
RB_LEFT           657 include/tree.h       tmp = RB_LEFT(tmp, field);                                              \
RB_LEFT           673 include/tree.h     while (RB_LEFT(elm, field))                                               \
RB_LEFT           674 include/tree.h       elm = RB_LEFT(elm, field);                                              \
RB_LEFT           677 include/tree.h         (elm == RB_LEFT(RB_PARENT(elm, field), field)))                       \
RB_LEFT           693 include/tree.h   if (RB_LEFT(elm, field)) {                                                  \
RB_LEFT           694 include/tree.h     elm = RB_LEFT(elm, field);                                                \
RB_LEFT           703 include/tree.h           (elm == RB_LEFT(RB_PARENT(elm, field), field)))                     \
RB_LEFT           719 include/tree.h       tmp = RB_LEFT(tmp, field);                                              \