HomeSort by: relevance | last modified time | path
    Searched defs:rebalance (Results 1 - 2 of 2) sorted by relevancy

  /src/common/lib/libc/gen/
rb.c 190 bool rebalance; local in function:rb_tree_insert_node
261 rebalance = false;
274 * All new nodes are colored red. We only need to rebalance
278 rebalance = RB_RED_P(parent);
306 KASSERT(rb_tree_check_node(rbt, self, NULL, !rebalance));
309 * Rebalance tree after insertion
311 if (rebalance) {
498 rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)
506 KASSERT(rebalance || (RB_ROOT_P(rbt, self) || RB_RED_P(self)));
507 KASSERT(!rebalance || RB_BLACK_P(self))
557 bool rebalance = RB_BLACK_P(standin); local in function:rb_tree_swap_prune_and_rebalance
775 const bool rebalance = RB_BLACK_P(self) && !RB_ROOT_P(rbt, self); local in function:rb_tree_remove_node
    [all...]
rb.c 190 bool rebalance; local in function:rb_tree_insert_node
261 rebalance = false;
274 * All new nodes are colored red. We only need to rebalance
278 rebalance = RB_RED_P(parent);
306 KASSERT(rb_tree_check_node(rbt, self, NULL, !rebalance));
309 * Rebalance tree after insertion
311 if (rebalance) {
498 rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)
506 KASSERT(rebalance || (RB_ROOT_P(rbt, self) || RB_RED_P(self)));
507 KASSERT(!rebalance || RB_BLACK_P(self))
557 bool rebalance = RB_BLACK_P(standin); local in function:rb_tree_swap_prune_and_rebalance
775 const bool rebalance = RB_BLACK_P(self) && !RB_ROOT_P(rbt, self); local in function:rb_tree_remove_node
    [all...]

Completed in 103 milliseconds