Searched refs:rbt_left (Results 1 – 5 of 5) sorted by relevance
60 gparent->rbt_left = tmp; in rbtree_insert()69 tmp = gparent->rbt_left; in rbtree_insert()79 tmp = parent->rbt_left; in rbtree_insert()251 while (n->rbt_left){ in k_rbtree_first()252 n = n->rbt_left; in k_rbtree_first()281 while (node->rbt_left){ in k_rbtree_next()282 node=node->rbt_left; in k_rbtree_next()302 if (node->rbt_left) { in k_rbtree_prev()303 node = node->rbt_left; in k_rbtree_prev()323 if (victim->rbt_left){ in k_rbtree_replace_node()[all …]
22 tmp = &((*tmp)->rbt_left); in node_insert()
17 struct k_rbtree_node_t *rbt_left; member82 if (parent->rbt_left == old) in rbtree_change_child()83 parent->rbt_left = new_node; in rbtree_change_child()93 struct k_rbtree_node_t *child = node->rbt_right, *tmp = node->rbt_left; in rbtree_erase_augmented()115 tmp = child->rbt_left; in rbtree_erase_augmented()124 tmp = tmp->rbt_left; in rbtree_erase_augmented()126 parent->rbt_left = child2 = successor->rbt_right; in rbtree_erase_augmented()133 successor->rbt_left = tmp = node->rbt_left; in rbtree_erase_augmented()174 node->rbt_left = node->rbt_right = NULL; in k_rbtree_link_node()
17 rbtnode = rbtnode->rbt_left; in rbr_find()40 tmp = &((*tmp)->rbt_left); in rbt_insert()
65 node = node->rbt_left; in find_device()87 link = (r < 0) ? &(*link)->rbt_left : &(*link)->rbt_right; in insert_device()
Completed in 7 milliseconds