182 	struct rb_node *node;  in ext4_es_print_tree()
189 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_es_print_tree()
214 	struct rb_node *node = root->rb_node;  in __es_tree_search()
218 		es = rb_entry(node, struct extent_status, rb_node);  in __es_tree_search()
231 		node = rb_next(&es->rb_node);  in __es_tree_search()
232 		return node ? rb_entry(node, struct extent_status, rb_node) :  in __es_tree_search()
264 	struct rb_node *node;  in __es_find_extent_range()
285 		while ((node = rb_next(&es1->rb_node)) != NULL) {  in __es_find_extent_range()
286 			es1 = rb_entry(node, struct extent_status, rb_node);  in __es_find_extent_range()
571 	struct rb_node *node;  in ext4_es_try_to_merge_left()
573 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
577 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
582 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
595 	struct rb_node *node;  in ext4_es_try_to_merge_right()
597 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
601 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
789 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
790 	struct rb_node *parent = NULL;  in __es_insert_extent()
795 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
835 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
836 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
987 	struct rb_node *node;  in ext4_es_lookup_extent()
1009 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
1011 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
1033 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
1036 					       rb_node);  in ext4_es_lookup_extent()
1076 	struct rb_node *node;  in init_rsvd()
1091 			node = rb_prev(&es->rb_node);  in init_rsvd()
1094 						      rb_node) : NULL;  in init_rsvd()
1199 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1203 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1214 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1216 				       rb_node) : NULL;  in __pr_tree_search()
1244 	struct rb_node *node;  in get_rsvd()
1275 			node = rb_prev(&es->rb_node);  in get_rsvd()
1278 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1284 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1286 						     rb_node) : NULL;  in get_rsvd()
1295 				node = rb_next(&es->rb_node);  in get_rsvd()
1299 					      rb_node);  in get_rsvd()
1338 				node = rb_next(&pr->rb_node);  in get_rsvd()
1339 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1344 					      rb_node);  in get_rsvd()
1371 	struct rb_node *node;  in __es_remove_extent()
1443 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1445 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1453 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1454 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1460 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1772 	struct rb_node *node;  in es_do_reclaim_extents()
1785 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1794 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1800 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1842 	struct rb_node *node;  in ext4_clear_inode_es()
1849 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1852 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1864 	struct rb_node *node;  in ext4_print_pending_tree()
1871 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1912 	struct rb_node *node;  in __get_pending()
1916 	node = (&tree->root)->rb_node;  in __get_pending()
1919 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1946 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1947 	struct rb_node *parent = NULL;  in __insert_pending()
1956 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1980 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1981 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
2005 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2150 	struct rb_node *node;  in __es_delayed_clu()
2178 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2181 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()