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()
759 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
760 	struct rb_node *parent = NULL;  in __es_insert_extent()
765 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
800 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
801 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
922 	struct rb_node *node;  in ext4_es_lookup_extent()
946 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
948 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
970 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
973 					       rb_node);  in ext4_es_lookup_extent()
1013 	struct rb_node *node;  in init_rsvd()
1028 			node = rb_prev(&es->rb_node);  in init_rsvd()
1031 						      rb_node) : NULL;  in init_rsvd()
1136 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1140 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1151 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1153 				       rb_node) : NULL;  in __pr_tree_search()
1181 	struct rb_node *node;  in get_rsvd()
1212 			node = rb_prev(&es->rb_node);  in get_rsvd()
1215 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1221 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1223 						     rb_node) : NULL;  in get_rsvd()
1232 				node = rb_next(&es->rb_node);  in get_rsvd()
1236 					      rb_node);  in get_rsvd()
1275 				node = rb_next(&pr->rb_node);  in get_rsvd()
1276 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1281 					      rb_node);  in get_rsvd()
1306 	struct rb_node *node;  in __es_remove_extent()
1381 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1383 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1391 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1392 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1398 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1696 	struct rb_node *node;  in es_do_reclaim_extents()
1709 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1721 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1727 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1769 	struct rb_node *node;  in ext4_clear_inode_es()
1776 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1779 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1791 	struct rb_node *node;  in ext4_print_pending_tree()
1798 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1841 	struct rb_node *node;  in __get_pending()
1845 	node = (&tree->root)->rb_node;  in __get_pending()
1848 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1873 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1874 	struct rb_node *parent = NULL;  in __insert_pending()
1883 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1902 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1903 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1927 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2048 	struct rb_node *node;  in __es_delayed_clu()
2076 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2079 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()