RB_PARENT 328 include/tree.h RB_PARENT(elm, field) = parent; \ RB_PARENT 345 include/tree.h RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \ RB_PARENT 348 include/tree.h if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \ RB_PARENT 349 include/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_PARENT 350 include/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ RB_PARENT 352 include/tree.h RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \ RB_PARENT 356 include/tree.h RB_PARENT(elm, field) = (tmp); \ RB_PARENT 358 include/tree.h if ((RB_PARENT(tmp, field))) \ RB_PARENT 359 include/tree.h RB_AUGMENT(RB_PARENT(tmp, field)); \ RB_PARENT 365 include/tree.h RB_PARENT(RB_RIGHT(tmp, field), field) = (elm); \ RB_PARENT 368 include/tree.h if ((RB_PARENT(tmp, field) = RB_PARENT(elm, field)) != NULL) { \ RB_PARENT 369 include/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_PARENT 370 include/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ RB_PARENT 372 include/tree.h RB_RIGHT(RB_PARENT(elm, field), field) = (tmp); \ RB_PARENT 376 include/tree.h RB_PARENT(elm, field) = (tmp); \ RB_PARENT 378 include/tree.h if ((RB_PARENT(tmp, field))) \ RB_PARENT 379 include/tree.h RB_AUGMENT(RB_PARENT(tmp, field)); \ RB_PARENT 411 include/tree.h while ((parent = RB_PARENT(elm, field)) != NULL && \ RB_PARENT 413 include/tree.h gparent = RB_PARENT(parent, field); \ RB_PARENT 471 include/tree.h parent = RB_PARENT(elm, field); \ RB_PARENT 504 include/tree.h parent = RB_PARENT(elm, field); \ RB_PARENT 545 include/tree.h parent = RB_PARENT(elm, field); \ RB_PARENT 548 include/tree.h RB_PARENT(child, field) = parent; \ RB_PARENT 557 include/tree.h if (RB_PARENT(elm, field) == old) \ RB_PARENT 560 include/tree.h if (RB_PARENT(old, field)) { \ RB_PARENT 561 include/tree.h if (RB_LEFT(RB_PARENT(old, field), field) == old) \ RB_PARENT 562 include/tree.h RB_LEFT(RB_PARENT(old, field), field) = elm; \ RB_PARENT 564 include/tree.h RB_RIGHT(RB_PARENT(old, field), field) = elm; \ RB_PARENT 565 include/tree.h RB_AUGMENT(RB_PARENT(old, field)); \ RB_PARENT 568 include/tree.h RB_PARENT(RB_LEFT(old, field), field) = elm; \ RB_PARENT 570 include/tree.h RB_PARENT(RB_RIGHT(old, field), field) = elm; \ RB_PARENT 575 include/tree.h } while ((left = RB_PARENT(left, field)) != NULL); \ RB_PARENT 579 include/tree.h parent = RB_PARENT(elm, field); \ RB_PARENT 582 include/tree.h RB_PARENT(child, field) = parent; \ RB_PARENT 676 include/tree.h if (RB_PARENT(elm, field) && \ RB_PARENT 677 include/tree.h (elm == RB_LEFT(RB_PARENT(elm, field), field))) \ RB_PARENT 678 include/tree.h elm = RB_PARENT(elm, field); \ RB_PARENT 680 include/tree.h while (RB_PARENT(elm, field) && \ RB_PARENT 681 include/tree.h (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \ RB_PARENT 682 include/tree.h elm = RB_PARENT(elm, field); \ RB_PARENT 683 include/tree.h elm = RB_PARENT(elm, field); \ RB_PARENT 698 include/tree.h if (RB_PARENT(elm, field) && \ RB_PARENT 699 include/tree.h (elm == RB_RIGHT(RB_PARENT(elm, field), field))) \ RB_PARENT 700 include/tree.h elm = RB_PARENT(elm, field); \ RB_PARENT 702 include/tree.h while (RB_PARENT(elm, field) && \ RB_PARENT 703 include/tree.h (elm == RB_LEFT(RB_PARENT(elm, field), field))) \ RB_PARENT 704 include/tree.h elm = RB_PARENT(elm, field); \ RB_PARENT 705 include/tree.h elm = RB_PARENT(elm, field); \