43 static void get_index(const struct prio_tree_node *node,  in get_index()
75 static struct prio_tree_node *prio_tree_expand(struct prio_tree_root *root,  in prio_tree_expand()
76 		struct prio_tree_node *node, unsigned long max_heap_index)  in prio_tree_expand()
78 	struct prio_tree_node *first = NULL, *prev, *last = NULL;  in prio_tree_expand()
90 			first = root->prio_tree_node;  in prio_tree_expand()
91 			prio_tree_remove(root, root->prio_tree_node);  in prio_tree_expand()
96 			last = root->prio_tree_node;  in prio_tree_expand()
97 			prio_tree_remove(root, root->prio_tree_node);  in prio_tree_expand()
113 		last->left = root->prio_tree_node;  in prio_tree_expand()
117 	root->prio_tree_node = node;  in prio_tree_expand()
124 struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root,  in prio_tree_replace()
125 		struct prio_tree_node *old, struct prio_tree_node *node)  in prio_tree_replace()
130 		assert(root->prio_tree_node == old);  in prio_tree_replace()
136 		root->prio_tree_node = node;  in prio_tree_replace()
168 struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root,  in prio_tree_insert()
169 		struct prio_tree_node *node)  in prio_tree_insert()
171 	struct prio_tree_node *cur, *res = node;  in prio_tree_insert()
182 	cur = root->prio_tree_node;  in prio_tree_insert()
193 			struct prio_tree_node *tmp = node;  in prio_tree_insert()
245 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node)  in prio_tree_remove()
247 	struct prio_tree_node *cur;  in prio_tree_remove()
275 		assert(root->prio_tree_node == cur);  in prio_tree_remove()
297 static struct prio_tree_node *prio_tree_left(struct prio_tree_iter *iter,  in prio_tree_left()
328 static struct prio_tree_node *prio_tree_right(struct prio_tree_iter *iter,  in prio_tree_right()
370 static struct prio_tree_node *prio_tree_parent(struct prio_tree_iter *iter)  in prio_tree_parent()
399 static struct prio_tree_node *prio_tree_first(struct prio_tree_iter *iter)  in prio_tree_first()
410 	get_index(root->prio_tree_node, &r_index, &h_index);  in prio_tree_first()
416 	iter->cur = root->prio_tree_node;  in prio_tree_first()
438 struct prio_tree_node *prio_tree_next(struct prio_tree_iter *iter)  in prio_tree_next()