181 	struct rb_node *node;  in ext4_es_print_tree()
188 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_es_print_tree()
213 	struct rb_node *node = root->rb_node;  in __es_tree_search()
217 		es = rb_entry(node, struct extent_status, rb_node);  in __es_tree_search()
230 		node = rb_next(&es->rb_node);  in __es_tree_search()
231 		return node ? rb_entry(node, struct extent_status, rb_node) :  in __es_tree_search()
263 	struct rb_node *node;  in __es_find_extent_range()
286 		while ((node = rb_next(&es1->rb_node)) != NULL) {  in __es_find_extent_range()
287 			es1 = rb_entry(node, struct extent_status, rb_node);  in __es_find_extent_range()
542 	struct rb_node *node;  in ext4_es_try_to_merge_left()
544 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
548 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
553 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
566 	struct rb_node *node;  in ext4_es_try_to_merge_right()
568 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
572 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
760 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
761 	struct rb_node *parent = NULL;  in __es_insert_extent()
766 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
801 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
802 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
923 	struct rb_node *node;  in ext4_es_lookup_extent()
947 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
949 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
971 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
974 					       rb_node);  in ext4_es_lookup_extent()
1014 	struct rb_node *node;  in init_rsvd()
1029 			node = rb_prev(&es->rb_node);  in init_rsvd()
1032 						      rb_node) : NULL;  in init_rsvd()
1137 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1141 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1152 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1154 				       rb_node) : NULL;  in __pr_tree_search()
1182 	struct rb_node *node;  in get_rsvd()
1213 			node = rb_prev(&es->rb_node);  in get_rsvd()
1216 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1222 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1224 						     rb_node) : NULL;  in get_rsvd()
1233 				node = rb_next(&es->rb_node);  in get_rsvd()
1237 					      rb_node);  in get_rsvd()
1276 				node = rb_next(&pr->rb_node);  in get_rsvd()
1277 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1282 					      rb_node);  in get_rsvd()
1307 	struct rb_node *node;  in __es_remove_extent()
1382 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1384 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1392 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1393 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1399 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1698 	struct rb_node *node;  in es_do_reclaim_extents()
1711 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1723 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1729 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1771 	struct rb_node *node;  in ext4_clear_inode_es()
1778 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1781 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1793 	struct rb_node *node;  in ext4_print_pending_tree()
1800 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1843 	struct rb_node *node;  in __get_pending()
1847 	node = (&tree->root)->rb_node;  in __get_pending()
1850 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1875 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1876 	struct rb_node *parent = NULL;  in __insert_pending()
1885 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1904 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1905 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1929 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2050 	struct rb_node *node;  in __es_delayed_clu()
2078 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2081 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()