144 		struct prio_tree_node *old, struct prio_tree_node *node)  in prio_tree_replace()  argument
148 	if (prio_tree_root(old)) {  in prio_tree_replace()
149 		BUG_ON(root->prio_tree_node != old);  in prio_tree_replace()
157 		node->parent = old->parent;  in prio_tree_replace()
158 		if (old->parent->left == old)  in prio_tree_replace()
159 			old->parent->left = node;  in prio_tree_replace()
161 			old->parent->right = node;  in prio_tree_replace()
164 	if (!prio_tree_left_empty(old)) {  in prio_tree_replace()
165 		node->left = old->left;  in prio_tree_replace()
166 		old->left->parent = node;  in prio_tree_replace()
169 	if (!prio_tree_right_empty(old)) {  in prio_tree_replace()
170 		node->right = old->right;  in prio_tree_replace()
171 		old->right->parent = node;  in prio_tree_replace()
174 	return old;  in prio_tree_replace()