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()
540 	struct rb_node *node;  in ext4_es_try_to_merge_left()
542 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
546 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
551 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
564 	struct rb_node *node;  in ext4_es_try_to_merge_right()
566 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
570 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
758 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
759 	struct rb_node *parent = NULL;  in __es_insert_extent()
764 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
799 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
800 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
921 	struct rb_node *node;  in ext4_es_lookup_extent()
943 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
945 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
967 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
970 					       rb_node);  in ext4_es_lookup_extent()
1010 	struct rb_node *node;  in init_rsvd()
1025 			node = rb_prev(&es->rb_node);  in init_rsvd()
1028 						      rb_node) : NULL;  in init_rsvd()
1133 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1137 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1148 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1150 				       rb_node) : NULL;  in __pr_tree_search()
1178 	struct rb_node *node;  in get_rsvd()
1209 			node = rb_prev(&es->rb_node);  in get_rsvd()
1212 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1218 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1220 						     rb_node) : NULL;  in get_rsvd()
1229 				node = rb_next(&es->rb_node);  in get_rsvd()
1233 					      rb_node);  in get_rsvd()
1272 				node = rb_next(&pr->rb_node);  in get_rsvd()
1273 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1278 					      rb_node);  in get_rsvd()
1303 	struct rb_node *node;  in __es_remove_extent()
1378 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1380 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1388 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1389 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1395 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1693 	struct rb_node *node;  in es_do_reclaim_extents()
1706 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1718 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1724 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1766 	struct rb_node *node;  in ext4_clear_inode_es()
1773 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1776 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1788 	struct rb_node *node;  in ext4_print_pending_tree()
1795 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1838 	struct rb_node *node;  in __get_pending()
1842 	node = (&tree->root)->rb_node;  in __get_pending()
1845 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1870 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1871 	struct rb_node *parent = NULL;  in __insert_pending()
1880 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1899 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1900 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1924 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2045 	struct rb_node *node;  in __es_delayed_clu()
2073 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2076 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()