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()
573 	struct rb_node *node;  in ext4_es_try_to_merge_left()
575 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
579 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
584 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
597 	struct rb_node *node;  in ext4_es_try_to_merge_right()
599 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
603 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
791 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
792 	struct rb_node *parent = NULL;  in __es_insert_extent()
797 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
837 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
838 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
1005 	struct rb_node *node;  in ext4_es_lookup_extent()
1027 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
1029 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
1051 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
1054 					       rb_node);  in ext4_es_lookup_extent()
1094 	struct rb_node *node;  in init_rsvd()
1109 			node = rb_prev(&es->rb_node);  in init_rsvd()
1112 						      rb_node) : NULL;  in init_rsvd()
1216 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1220 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1231 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1233 				       rb_node) : NULL;  in __pr_tree_search()
1260 	struct rb_node *node;  in get_rsvd()
1291 			node = rb_prev(&es->rb_node);  in get_rsvd()
1294 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1300 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1302 						     rb_node) : NULL;  in get_rsvd()
1311 				node = rb_next(&es->rb_node);  in get_rsvd()
1315 					      rb_node);  in get_rsvd()
1354 				node = rb_next(&pr->rb_node);  in get_rsvd()
1355 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1360 					      rb_node);  in get_rsvd()
1387 	struct rb_node *node;  in __es_remove_extent()
1459 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1461 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1469 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1470 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1476 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1791 	struct rb_node *node;  in es_do_reclaim_extents()
1804 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1813 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1819 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1861 	struct rb_node *node;  in ext4_clear_inode_es()
1868 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1871 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1883 	struct rb_node *node;  in ext4_print_pending_tree()
1890 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1931 	struct rb_node *node;  in __get_pending()
1935 	node = (&tree->root)->rb_node;  in __get_pending()
1938 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1965 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1966 	struct rb_node *parent = NULL;  in __insert_pending()
1975 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1999 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
2000 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
2025 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()