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()
284 		while ((node = rb_next(&es1->rb_node)) != NULL) {  in __es_find_extent_range()
285 			es1 = rb_entry(node, struct extent_status, rb_node);  in __es_find_extent_range()
557 	struct rb_node *node;  in ext4_es_try_to_merge_left()
559 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
563 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
568 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
581 	struct rb_node *node;  in ext4_es_try_to_merge_right()
583 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
587 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
775 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
776 	struct rb_node *parent = NULL;  in __es_insert_extent()
781 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
821 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
822 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
961 	struct rb_node *node;  in ext4_es_lookup_extent()
983 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
985 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
1007 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
1010 					       rb_node);  in ext4_es_lookup_extent()
1050 	struct rb_node *node;  in init_rsvd()
1065 			node = rb_prev(&es->rb_node);  in init_rsvd()
1068 						      rb_node) : NULL;  in init_rsvd()
1173 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1177 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1188 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1190 				       rb_node) : NULL;  in __pr_tree_search()
1218 	struct rb_node *node;  in get_rsvd()
1249 			node = rb_prev(&es->rb_node);  in get_rsvd()
1252 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1258 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1260 						     rb_node) : NULL;  in get_rsvd()
1269 				node = rb_next(&es->rb_node);  in get_rsvd()
1273 					      rb_node);  in get_rsvd()
1312 				node = rb_next(&pr->rb_node);  in get_rsvd()
1313 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1318 					      rb_node);  in get_rsvd()
1345 	struct rb_node *node;  in __es_remove_extent()
1417 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1419 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1427 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1428 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1434 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1746 	struct rb_node *node;  in es_do_reclaim_extents()
1759 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1768 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1774 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1816 	struct rb_node *node;  in ext4_clear_inode_es()
1823 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1826 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1838 	struct rb_node *node;  in ext4_print_pending_tree()
1845 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1886 	struct rb_node *node;  in __get_pending()
1890 	node = (&tree->root)->rb_node;  in __get_pending()
1893 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1918 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1919 	struct rb_node *parent = NULL;  in __insert_pending()
1928 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1947 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1948 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1972 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2108 	struct rb_node *node;  in __es_delayed_clu()
2136 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2139 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()