28 	void (*propagate)(struct rb_node *node, struct rb_node *stop);
33 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
47 rb_insert_augmented(struct rb_node *node, struct rb_root *root,  in rb_insert_augmented()  argument
50 	__rb_insert_augmented(node, root, augment->rotate);  in rb_insert_augmented()
54 rb_insert_augmented_cached(struct rb_node *node,  in rb_insert_augmented_cached()  argument
59 		root->rb_leftmost = node;  in rb_insert_augmented_cached()
60 	rb_insert_augmented(node, &root->rb_root, augment);  in rb_insert_augmented_cached()
64 rb_add_augmented_cached(struct rb_node *node, struct rb_root_cached *tree,  in rb_add_augmented_cached()  argument
74 		if (less(node, parent)) {  in rb_add_augmented_cached()
82 	rb_link_node(node, parent, link);  in rb_add_augmented_cached()
84 	rb_insert_augmented_cached(node, tree, leftmost, augment);  in rb_add_augmented_cached()
86 	return leftmost ? node : NULL;  in rb_add_augmented_cached()
106 		RBSTRUCT *node = rb_entry(rb, RBSTRUCT, RBFIELD);	\
107 		if (RBCOMPUTE(node, true))				\
109 		rb = rb_parent(&node->RBFIELD);				\
148 static inline bool RBNAME ## _compute_max(RBSTRUCT *node, bool exit)	      \
151 	RBTYPE max = RBCOMPUTE(node);					      \
152 	if (node->RBFIELD.rb_left) {					      \
153 		child = rb_entry(node->RBFIELD.rb_left, RBSTRUCT, RBFIELD);   \
157 	if (node->RBFIELD.rb_right) {					      \
158 		child = rb_entry(node->RBFIELD.rb_right, RBSTRUCT, RBFIELD);  \
162 	if (exit && node->RBAUGMENTED == max)				      \
164 	node->RBAUGMENTED = max;					      \
224 __rb_erase_augmented(struct rb_node *node, struct rb_root *root,  in __rb_erase_augmented()  argument
227 	struct rb_node *child = node->rb_right;  in __rb_erase_augmented()
228 	struct rb_node *tmp = node->rb_left;  in __rb_erase_augmented()
240 		pc = node->__rb_parent_color;  in __rb_erase_augmented()
242 		__rb_change_child(node, child, parent, root);  in __rb_erase_augmented()
251 		tmp->__rb_parent_color = pc = node->__rb_parent_color;  in __rb_erase_augmented()
253 		__rb_change_child(node, tmp, parent, root);  in __rb_erase_augmented()
273 			augment->copy(node, successor);  in __rb_erase_augmented()
299 			augment->copy(node, successor);  in __rb_erase_augmented()
303 		tmp = node->rb_left;  in __rb_erase_augmented()
307 		pc = node->__rb_parent_color;  in __rb_erase_augmented()
309 		__rb_change_child(node, successor, tmp, root);  in __rb_erase_augmented()
326 rb_erase_augmented(struct rb_node *node, struct rb_root *root,  in rb_erase_augmented()  argument
329 	struct rb_node *rebalance = __rb_erase_augmented(node, root, augment);  in rb_erase_augmented()
335 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root,  in rb_erase_augmented_cached()  argument
338 	if (root->rb_leftmost == node)  in rb_erase_augmented_cached()
339 		root->rb_leftmost = rb_next(node);  in rb_erase_augmented_cached()
340 	rb_erase_augmented(node, &root->rb_root, augment);  in rb_erase_augmented_cached()