RB_LEFT 322 sys/tree.h RB_LEFT(elm, field) = RB_RIGHT(elm, field) = NULL; \ RB_LEFT 337 sys/tree.h if ((RB_RIGHT(elm, field) = RB_LEFT(tmp, field))) { \ RB_LEFT 338 sys/tree.h RB_PARENT(RB_LEFT(tmp, field), field) = (elm); \ RB_LEFT 342 sys/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_LEFT 343 sys/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ RB_LEFT 348 sys/tree.h RB_LEFT(tmp, field) = (elm); \ RB_LEFT 356 sys/tree.h (tmp) = RB_LEFT(elm, field); \ RB_LEFT 357 sys/tree.h if ((RB_LEFT(elm, field) = RB_RIGHT(tmp, field))) { \ RB_LEFT 362 sys/tree.h if ((elm) == RB_LEFT(RB_PARENT(elm, field), field)) \ RB_LEFT 363 sys/tree.h RB_LEFT(RB_PARENT(elm, field), field) = (tmp); \ RB_LEFT 397 sys/tree.h if (parent == RB_LEFT(gparent, field)) { \ RB_LEFT 414 sys/tree.h tmp = RB_LEFT(gparent, field); \ RB_LEFT 421 sys/tree.h if (RB_LEFT(parent, field) == elm) { \ RB_LEFT 440 sys/tree.h if (RB_LEFT(parent, field) == elm) { \ RB_LEFT 447 sys/tree.h if ((RB_LEFT(tmp, field) == NULL || \ RB_LEFT 448 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\ RB_LEFT 458 sys/tree.h if ((oleft = RB_LEFT(tmp, field)))\ RB_LEFT 473 sys/tree.h tmp = RB_LEFT(parent, field); \ RB_LEFT 477 sys/tree.h tmp = RB_LEFT(parent, field); \ RB_LEFT 479 sys/tree.h if ((RB_LEFT(tmp, field) == NULL || \ RB_LEFT 480 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) &&\ RB_LEFT 487 sys/tree.h if (RB_LEFT(tmp, field) == NULL || \ RB_LEFT 488 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) == RB_BLACK) {\ RB_LEFT 494 sys/tree.h tmp = RB_LEFT(parent, field); \ RB_LEFT 498 sys/tree.h if (RB_LEFT(tmp, field)) \ RB_LEFT 499 sys/tree.h RB_COLOR(RB_LEFT(tmp, field), field) = RB_BLACK;\ RB_LEFT 515 sys/tree.h if (RB_LEFT(elm, field) == NULL) \ RB_LEFT 518 sys/tree.h child = RB_LEFT(elm, field); \ RB_LEFT 522 sys/tree.h while ((left = RB_LEFT(elm, field))) \ RB_LEFT 530 sys/tree.h if (RB_LEFT(parent, field) == elm) \ RB_LEFT 531 sys/tree.h RB_LEFT(parent, field) = child; \ RB_LEFT 541 sys/tree.h if (RB_LEFT(RB_PARENT(old, field), field) == old)\ RB_LEFT 542 sys/tree.h RB_LEFT(RB_PARENT(old, field), field) = elm;\ RB_LEFT 548 sys/tree.h RB_PARENT(RB_LEFT(old, field), field) = elm; \ RB_LEFT 564 sys/tree.h if (RB_LEFT(parent, field) == elm) \ RB_LEFT 565 sys/tree.h RB_LEFT(parent, field) = child; \ RB_LEFT 589 sys/tree.h tmp = RB_LEFT(tmp, field); \ RB_LEFT 598 sys/tree.h RB_LEFT(parent, field) = elm; \ RB_LEFT 617 sys/tree.h tmp = RB_LEFT(tmp, field); \ RB_LEFT 631 sys/tree.h while (RB_LEFT(elm, field)) \ RB_LEFT 632 sys/tree.h elm = RB_LEFT(elm, field); \ RB_LEFT 635 sys/tree.h (elm == RB_LEFT(RB_PARENT(elm, field), field))) \ RB_LEFT 655 sys/tree.h tmp = RB_LEFT(tmp, field); \ RB_LEFT 262 uvm/uvm_map.c if (RB_LEFT(entry, rb_entry)) { RB_LEFT 263 uvm/uvm_map.c tmp = RB_LEFT(entry, rb_entry)->space; RB_LEFT 1029 uvm/uvm_map.c cur = RB_LEFT(cur, rb_entry); RB_LEFT 1241 uvm/uvm_map.c child = RB_LEFT(tmp, rb_entry); RB_LEFT 1280 uvm/uvm_map.c child = RB_LEFT(tmp, rb_entry);