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()
533 	struct rb_node *node;  in ext4_es_try_to_merge_left()
535 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
539 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
544 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
557 	struct rb_node *node;  in ext4_es_try_to_merge_right()
559 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
563 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
751 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
752 	struct rb_node *parent = NULL;  in __es_insert_extent()
757 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
792 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
793 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
908 	struct rb_node *node;  in ext4_es_lookup_extent()
929 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
931 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
953 			node = rb_next(&es1->rb_node);  in ext4_es_lookup_extent()
956 					       rb_node);  in ext4_es_lookup_extent()
996 	struct rb_node *node;  in init_rsvd()
1011 			node = rb_prev(&es->rb_node);  in init_rsvd()
1014 						      rb_node) : NULL;  in init_rsvd()
1119 	struct rb_node *node = root->rb_node;  in __pr_tree_search()
1123 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __pr_tree_search()
1134 		node = rb_next(&pr->rb_node);  in __pr_tree_search()
1136 				       rb_node) : NULL;  in __pr_tree_search()
1164 	struct rb_node *node;  in get_rsvd()
1195 			node = rb_prev(&es->rb_node);  in get_rsvd()
1198 			es = rb_entry(node, struct extent_status, rb_node);  in get_rsvd()
1204 				node = rb_next(&right_es->rb_node);  in get_rsvd()
1206 						     rb_node) : NULL;  in get_rsvd()
1215 				node = rb_next(&es->rb_node);  in get_rsvd()
1219 					      rb_node);  in get_rsvd()
1258 				node = rb_next(&pr->rb_node);  in get_rsvd()
1259 				rb_erase(&pr->rb_node, &tree->root);  in get_rsvd()
1264 					      rb_node);  in get_rsvd()
1289 	struct rb_node *node;  in __es_remove_extent()
1364 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1366 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1374 		node = rb_next(&es->rb_node);  in __es_remove_extent()
1375 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
1381 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1677 	struct rb_node *node;  in es_do_reclaim_extents()
1690 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1702 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1708 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()
1750 	struct rb_node *node;  in ext4_clear_inode_es()
1757 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_clear_inode_es()
1760 			rb_erase(&es->rb_node, &tree->root);  in ext4_clear_inode_es()
1772 	struct rb_node *node;  in ext4_print_pending_tree()
1779 		pr = rb_entry(node, struct pending_reservation, rb_node);  in ext4_print_pending_tree()
1822 	struct rb_node *node;  in __get_pending()
1826 	node = (&tree->root)->rb_node;  in __get_pending()
1829 		pr = rb_entry(node, struct pending_reservation, rb_node);  in __get_pending()
1854 	struct rb_node **p = &tree->root.rb_node;  in __insert_pending()
1855 	struct rb_node *parent = NULL;  in __insert_pending()
1864 		pr = rb_entry(parent, struct pending_reservation, rb_node);  in __insert_pending()
1883 	rb_link_node(&pr->rb_node, parent, p);  in __insert_pending()
1884 	rb_insert_color(&pr->rb_node, &tree->root);  in __insert_pending()
1908 		rb_erase(&pr->rb_node, &tree->root);  in __remove_pending()
2026 	struct rb_node *node;  in __es_delayed_clu()
2054 		node = rb_next(&es->rb_node);  in __es_delayed_clu()
2057 		es = rb_entry(node, struct extent_status, rb_node);  in __es_delayed_clu()