Lines Matching refs:left
118 prev->left = last; in prio_tree_expand()
126 node->left = first; in prio_tree_expand()
132 last->left = root->prio_tree_node; in prio_tree_expand()
133 last->left->parent = last; in prio_tree_expand()
158 if (old->parent->left == old) in prio_tree_replace()
159 old->parent->left = node; in prio_tree_replace()
165 node->left = old->left; in prio_tree_replace()
166 old->left->parent = node; in prio_tree_replace()
240 cur->left = node; in prio_tree_insert()
244 cur = cur->left; in prio_tree_insert()
273 get_index(root, cur->left, &r_index, &h_index_left); in prio_tree_remove()
282 cur = cur->left; in prio_tree_remove()
288 cur = cur->left; in prio_tree_remove()
302 cur->parent->left = cur->parent; in prio_tree_remove()
322 get_index(iter->root, iter->cur->left, r_index, h_index); in prio_tree_left()
325 iter->cur = iter->cur->left; in prio_tree_left()