184 	struct rb_node *node;  in ext4_es_print_tree()
191 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_es_print_tree()
216 	struct rb_node *node = root->rb_node;  in __es_tree_search()
220 		es = rb_entry(node, struct extent_status, rb_node);  in __es_tree_search()
233 		node = rb_next(&es->rb_node);  in __es_tree_search()
234 		return node ? rb_entry(node, struct extent_status, rb_node) :  in __es_tree_search()
266 	struct rb_node *node;  in __es_find_extent_range()
287 		while ((node = rb_next(&es1->rb_node)) != NULL) {  in __es_find_extent_range()
288 			es1 = rb_entry(node, struct extent_status, rb_node);  in __es_find_extent_range()
564 	struct rb_node *node;  in ext4_es_try_to_merge_left()
566 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
570 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
575 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
588 	struct rb_node *node;  in ext4_es_try_to_merge_right()
590 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
594 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
783 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
784 	struct rb_node *parent = NULL;  in __es_insert_extent()
789 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
829 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
830 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
977 	struct rb_node *node;  in ext4_es_lookup_extent()
996 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
998 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
1020 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
1023 					       rb_node);  in ext4_es_lookup_extent()
1063 	struct rb_node *node;  in init_rsvd()
1078 			node = rb_prev(&es->rb_node);  in init_rsvd()
1081 						      rb_node) : NULL;  in init_rsvd()
1186 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1190 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1201 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1203 				       rb_node) : NULL;  in __pr_tree_search()
1231 	struct rb_node *node;  in get_rsvd()
1262 			node = rb_prev(&es->rb_node);  in get_rsvd()
1265 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1271 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1273 						     rb_node) : NULL;  in get_rsvd()
1282 				node = rb_next(&es->rb_node);  in get_rsvd()
1286 					      rb_node);  in get_rsvd()
1325 				node = rb_next(&pr->rb_node);  in get_rsvd()
1326 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1331 					      rb_node);  in get_rsvd()
1358 	struct rb_node *node;  in __es_remove_extent()
1430 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1432 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1440 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1441 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1447 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1755 	struct rb_node *node;  in es_do_reclaim_extents()
1768 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1777 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1783 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1825 	struct rb_node *node;  in ext4_clear_inode_es()
1832 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1835 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1847 	struct rb_node *node;  in ext4_print_pending_tree()
1854 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1897 	struct rb_node *node;  in __get_pending()
1901 	node = (&tree->root)->rb_node;  in __get_pending()
1904 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1931 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1932 	struct rb_node *parent = NULL;  in __insert_pending()
1941 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1965 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1966 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1990 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2134 	struct rb_node *node;  in __es_delayed_clu()
2162 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2165 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()