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

  /src/common/lib/libc/gen/
rbtree.c 144 parent = parent->rb_nodes[diff < 0];
165 parent = parent->rb_nodes[diff < 0];
186 parent = parent->rb_nodes[diff < 0];
206 * just like rb_node->rb_nodes[RB_DIR_LEFT], we can use this fact to
208 * updating RB_FATHER(rb_node)->rb_nodes[RB_POSITION(rb_node)] will
229 tmp = parent->rb_nodes[position];
289 KASSERT(RB_SENTINEL_P(parent->rb_nodes[position]));
290 self->rb_left = parent->rb_nodes[position];
291 self->rb_right = parent->rb_nodes[position];
292 parent->rb_nodes[position] = self
    [all...]
  /src/sys/sys/
rbtree.h 54 struct rb_node *rb_nodes[2]; member in struct:rb_node
58 #define rb_left rb_nodes[RB_DIR_LEFT]
59 #define rb_right rb_nodes[RB_DIR_RIGHT]
  /src/sys/kern/
vfs_cache.c 462 node = node->rb_nodes[diff < 0];
464 node = node->rb_nodes[ncp->nc_key < key];
  /src/lib/libc/stdlib/
jemalloc.c 1852 node = node->rb_nodes[1];
1856 node = node->rb_nodes[0];
  /src/sys/uvm/
uvm_map.c 425 brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
  /src/sys/arch/x86/x86/
pmap.c 2227 node = node->rb_nodes[pve->pve_pte.pte_va < va];

Completed in 40 milliseconds