Lines Matching refs:rbt_right
35 tmp = gparent->rbt_right; in rbtree_insert()
46 tmp = parent->rbt_right; in rbtree_insert()
48 parent->rbt_right = tmp = node->rbt_left; in rbtree_insert()
57 tmp = node->rbt_right; in rbtree_insert()
61 parent->rbt_right = gparent; in rbtree_insert()
81 parent->rbt_left = tmp = node->rbt_right; in rbtree_insert()
82 node->rbt_right = parent; in rbtree_insert()
93 gparent->rbt_right = tmp; in rbtree_insert()
111 sibling = parent->rbt_right; in rbtree_erase_color()
114 parent->rbt_right = tmp1 = sibling->rbt_left; in rbtree_erase_color()
122 tmp1 = sibling->rbt_right; in rbtree_erase_color()
140 sibling->rbt_left = tmp1 = tmp2->rbt_right; in rbtree_erase_color()
141 tmp2->rbt_right = sibling; in rbtree_erase_color()
142 parent->rbt_right = tmp2; in rbtree_erase_color()
151 parent->rbt_right = tmp2 = sibling->rbt_left; in rbtree_erase_color()
164 parent->rbt_left = tmp1 = sibling->rbt_right; in rbtree_erase_color()
165 sibling->rbt_right = parent; in rbtree_erase_color()
174 tmp2 = sibling->rbt_right; in rbtree_erase_color()
190 sibling->rbt_right = tmp1 = tmp2->rbt_left; in rbtree_erase_color()
201 parent->rbt_left = tmp2 = sibling->rbt_right; in rbtree_erase_color()
202 sibling->rbt_right = parent; in rbtree_erase_color()
265 while (n->rbt_right){ in k_rbtree_last()
266 n = n->rbt_right; in k_rbtree_last()
279 if (node->rbt_right) { in k_rbtree_next()
280 node = node->rbt_right; in k_rbtree_next()
287 while ((parent = K_RBTREE_PARENT(node)) && node == parent->rbt_right){ in k_rbtree_next()
304 while (node->rbt_right){ in k_rbtree_prev()
305 node=node->rbt_right; in k_rbtree_prev()
326 if (victim->rbt_right){ in k_rbtree_replace_node()
327 rbtree_set_parent(victim->rbt_right, new); in k_rbtree_replace_node()
339 else if (node->rbt_right){ in k_rbtree_left_deepest_node()
340 node = node->rbt_right; in k_rbtree_left_deepest_node()
357 if (parent && node == parent->rbt_left && parent->rbt_right) { in k_rbtree_next_postorder()
358 return k_rbtree_left_deepest_node(parent->rbt_right); in k_rbtree_next_postorder()