89 static inline int prio_tree_root(const struct prio_tree_node *node)  in prio_tree_root()  argument
91 	return node->parent == node;  in prio_tree_root()
94 static inline int prio_tree_left_empty(const struct prio_tree_node *node)  in prio_tree_left_empty()  argument
96 	return node->left == node;  in prio_tree_left_empty()
99 static inline int prio_tree_right_empty(const struct prio_tree_node *node)  in prio_tree_right_empty()  argument
101 	return node->right == node;  in prio_tree_right_empty()
106                 struct prio_tree_node *old, struct prio_tree_node *node);
108                 struct prio_tree_node *node);
109 void prio_tree_remove(struct prio_tree_root *root, struct prio_tree_node *node);
112 #define raw_prio_tree_replace(root, old, node) \  argument
114 	    (struct prio_tree_node *) (node))
115 #define raw_prio_tree_insert(root, node) \  argument
116 	prio_tree_insert(root, (struct prio_tree_node *) (node))
117 #define raw_prio_tree_remove(root, node) \  argument
118 	prio_tree_remove(root, (struct prio_tree_node *) (node))