rb_node
static const struct rb_node *
rb_tree_iterate_const(const struct rb_tree *rbt, const struct rb_node *self,
rb_tree_count_black(const struct rb_node *self)
rb_tree_check_node(const struct rb_tree *rbt, const struct rb_node *self,
const struct rb_node *prev, bool red_check)
KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);
const struct rb_node *prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);
const struct rb_node *next0 = rb_tree_iterate_const(rbt, self, RB_DIR_RIGHT);
const struct rb_node *brother;
const struct rb_node *relative0, *relative;
const struct rb_node *prev0;
const struct rb_node *next0;
const struct rb_node *self;
const struct rb_node *prev;
rb_tree_mark_depth(const struct rb_tree *rbt, const struct rb_node *self,
struct rb_node *parent = rbt->rbt_root;
struct rb_node *parent = rbt->rbt_root, *last = NULL;
struct rb_node *parent = rbt->rbt_root, *last = NULL;
struct rb_node *parent, *tmp, *self = RB_ITEMTONODE(rbto, object);
parent = (struct rb_node *)(void *)&rbt->rbt_root;
struct rb_node *prev = NULL, *next = NULL;
if (__predict_false(parent == (struct rb_node *)(void *)&rbt->rbt_root)) {
struct rb_node *old_father, const unsigned int which)
struct rb_node * const grandpa = RB_FATHER(old_father);
struct rb_node * const old_child = old_father->rb_nodes[which];
struct rb_node * const new_father = old_child;
struct rb_node * const new_child = old_father;
struct rb_node tmp;
rb_tree_insert_rebalance(struct rb_tree *rbt, struct rb_node *self)
struct rb_node * father = RB_FATHER(self);
struct rb_node * grandpa = RB_FATHER(father);
struct rb_node * uncle;
rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)
struct rb_node *father = RB_FATHER(self);
rb_tree_swap_prune_and_rebalance(struct rb_tree *rbt, struct rb_node *self,
struct rb_node *standin)
struct rb_node *standin_son;
struct rb_node *standin_father = RB_FATHER(standin);
rb_tree_prune_blackred_branch(struct rb_tree *rbt, struct rb_node *self,
struct rb_node *father = RB_FATHER(self);
struct rb_node *son = self->rb_nodes[which];
struct rb_node *standin, *self = RB_ITEMTONODE(rbto, object);
rb_tree_removal_rebalance(struct rb_tree *rbt, struct rb_node *parent,
struct rb_node *brother = parent->rb_nodes[other];
static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);
static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,
static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,
const struct rb_node *, const unsigned int);
static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,
const struct rb_node *, bool);
struct rb_node *self;
struct rb_node pdk_link;
struct rb_node pn_link;
struct rb_node ps_link;
rb_node_t rb_node;
.rbto_node_offset = offsetof(env_node_t, rb_node),
struct rb_node pt_node;
struct rb_node sc_node;
struct rb_node fh_rbnode;
struct rb_node rbnode;
struct rb_node ld_rb_node;
struct rb_node fx_node;
struct rb_node *node = dvi->vi_nc_tree.rbt_root;
struct rb_node nfsd_node; /* Tree of all nfsd's */
struct rb_node nc_tree; /* d red-black tree, must be first */
TAILQ_ENTRY(rb_node) rb_link;
TAILQ_HEAD(rb_node_qh, rb_node);
struct rb_node *rbt_root;
struct rb_node *rbt_minmax[2];
struct rb_node *rb_nodes[2];
((struct rb_node *)((rb)->rb_info & ~RB_FLAG_MASK))
struct rb_node rb_node; /* rb tree entry */
struct rb_node rb_node; /* rb tree entry */
.rbto_node_offset = offsetof(struct chfs_tmp_dnode_info, rb_node),
.rbto_node_offset = offsetof(struct chfs_node_frag, rb_node),
struct rb_node *node, *prev_node;
struct rb_node *next = rb_tree_iterate(&rii->tdi_root, this, RB_DIR_RIGHT);
__CTASSERT(offsetof(struct vm_map_entry, rb_node) == 0);
((struct vm_map_entry *)(entry)->rb_node.rb_left)
((struct vm_map_entry *)(entry)->rb_node.rb_right)
? NULL : (struct vm_map_entry *)RB_FATHER(&(entry)->rb_node))
.rbto_node_offset = offsetof(struct vm_map_entry, rb_node),
which = RB_POSITION(&entry->rb_node) ^ RB_DIR_OTHER;
brother = (struct vm_map_entry *)parent->rb_node.rb_nodes[which];
struct rb_node rb_node; /* tree information */
.rbto_node_offset = offsetof(struct uvm_physseg, rb_node),
struct rb_node rb_node; /* tree information */
struct rb_node node;
left = (struct vm_map_entry *)D(vm_map_entry, vm_map_entry)->rb_node.rb_left;
right = (struct vm_map_entry *)D(vm_map_entry, vm_map_entry)->rb_node.rb_right;
struct rb_node node;
struct rb_node node;