Searched refs:RB_POSITION (Results 1 – 4 of 4) sorted by relevance
62 #define RB_POSITION(rb) \ macro64 #define RB_RIGHT_P(rb) (RB_POSITION(rb) == RB_DIR_RIGHT)65 #define RB_LEFT_P(rb) (RB_POSITION(rb) == RB_DIR_LEFT)245 grandpa->rb_nodes[RB_POSITION(old_father)] = new_father; in __archive_rb_tree_reparent_nodes()351 const unsigned int which = RB_POSITION(self); in __archive_rb_tree_prune_node()374 const unsigned int standin_which = RB_POSITION(standin); in __archive_rb_tree_swap_prune_and_rebalance()460 RB_FATHER(standin)->rb_nodes[RB_POSITION(standin)] = standin; in __archive_rb_tree_swap_prune_and_rebalance()485 father->rb_nodes[RB_POSITION(son)] = son; in __archive_rb_tree_prune_blackred_branch()538 which = RB_POSITION(self) ^ RB_DIR_OTHER; in __archive_rb_tree_remove_node()595 which = RB_POSITION(parent); in __archive_rb_tree_removal_rebalance()[all …]
350 grandpa->rb_nodes[RB_POSITION(old_father)] = new_father; in rb_tree_reparent_nodes()486 KASSERT(RB_FATHER(self)->rb_nodes[RB_POSITION(self) ^ RB_DIR_OTHER] == grandpa); in rb_tree_insert_rebalance()500 const unsigned int which = RB_POSITION(self); in rb_tree_prune_node()524 if (__predict_false(rbt->rbt_minmax[RB_POSITION(self)] == self)) { in rb_tree_prune_node()525 rbt->rbt_minmax[RB_POSITION(self)] = father; in rb_tree_prune_node()553 const unsigned int standin_which = RB_POSITION(standin); in rb_tree_swap_prune_and_rebalance()600 KASSERT(RB_POSITION(standin_son) == standin_which); in rb_tree_swap_prune_and_rebalance()602 KASSERT(RB_POSITION(standin_son) == standin_other); in rb_tree_swap_prune_and_rebalance()644 KASSERT(RB_POSITION(self->rb_nodes[standin_other]) == standin_other); in rb_tree_swap_prune_and_rebalance()666 RB_FATHER(standin)->rb_nodes[RB_POSITION(standin)] = standin; in rb_tree_swap_prune_and_rebalance()[all …]
76 #define RB_POSITION(rb) \ macro78 #define RB_RIGHT_P(rb) (RB_POSITION(rb) == RB_DIR_RIGHT)79 #define RB_LEFT_P(rb) (RB_POSITION(rb) == RB_DIR_LEFT)
424 which = RB_POSITION(&entry->rb_node) ^ RB_DIR_OTHER; in uvm_rb_fixup()