7 struct prio_tree_node {  struct
8 	struct prio_tree_node	*left;  argument
9 	struct prio_tree_node	*right;  argument
10 	struct prio_tree_node	*parent;  argument
16 	struct prio_tree_node	*prio_tree_node;  argument
21 	struct prio_tree_node	*cur;
42 	(ptr)->prio_tree_node = NULL;	\
64 	return root->prio_tree_node == NULL;  in prio_tree_empty()
67 static inline int prio_tree_root(const struct prio_tree_node *node)  in prio_tree_root()
72 static inline int prio_tree_left_empty(const struct prio_tree_node *node)  in prio_tree_left_empty()
77 static inline int prio_tree_right_empty(const struct prio_tree_node *node)  in prio_tree_right_empty()
83 struct prio_tree_node *prio_tree_replace(struct prio_tree_root *root,
84                 struct prio_tree_node *old, struct prio_tree_node *node);
85 struct prio_tree_node *prio_tree_insert(struct prio_tree_root *root,
86                 struct prio_tree_node *node);
87 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node);
88 struct prio_tree_node *prio_tree_next(struct prio_tree_iter *iter);