HomeSort by: relevance | last modified time | path
    Searched refs:brother (Results 1 - 5 of 5) sorted by relevancy

  /src/common/lib/libc/gen/
rbtree.c 626 * brother.
636 * Have our son/standin adopt his brother as his new son.
832 struct rb_node *brother = parent->rb_nodes[other]; local
836 KASSERT(!RB_SENTINEL_P(brother));
838 * For cases 1, 2a, and 2b, our brother's children must
842 && RB_BLACK_P(brother->rb_left)
843 && RB_BLACK_P(brother->rb_right)) {
844 if (RB_RED_P(brother)) {
846 * Case 1: Our brother is red, swap its
858 brother = parent->rb_nodes[other]
1141 const struct rb_node *brother; local
    [all...]
  /src/usr.sbin/acpitools/aml/
aml_name.c 83 for (result = parent->child; result; result = result->brother)
112 for (result = parent->child; result; result = result->brother) {
142 for (child = parent->child; child; child = child->brother) {
155 for (ptr = parent->child; ptr; ptr = ptr->brother) {
287 newname->brother = parent->child;
289 newname->brother = NULL;
315 if (target->brother) {
318 target->parent->child = target->brother;
321 while (ptr && ptr->brother != target)
322 ptr = ptr->brother;
    [all...]
aml_name.h 45 struct aml_name *brother; member in struct:aml_name
aml_common.c 285 for (ptr = aname->child; ptr; ptr = ptr->brother)
  /src/sys/uvm/
uvm_map.c 412 struct vm_map_entry *brother; local
425 brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
426 if (brother != NULL) {
427 KDASSERT(brother->gap == uvm_rb_gap(brother));
428 brother->maxgap = uvm_rb_maxgap(brother);
429 if (maxgap < brother->maxgap)
430 maxgap = brother->maxgap;

Completed in 20 milliseconds