178 	struct rb_node *node;  in ext4_es_print_tree()
185 		es = rb_entry(node, struct extent_status, rb_node);  in ext4_es_print_tree()
210 	struct rb_node *node = root->rb_node;  in __es_tree_search()
214 		es = rb_entry(node, struct extent_status, rb_node);  in __es_tree_search()
227 		node = rb_next(&es->rb_node);  in __es_tree_search()
228 		return node ? rb_entry(node, struct extent_status, rb_node) :  in __es_tree_search()
250 	struct rb_node *node;  in ext4_es_find_delayed_extent_range()
275 		while ((node = rb_next(&es1->rb_node)) != NULL) {  in ext4_es_find_delayed_extent_range()
276 			es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_find_delayed_extent_range()
417 	struct rb_node *node;  in ext4_es_try_to_merge_left()
419 	node = rb_prev(&es->rb_node);  in ext4_es_try_to_merge_left()
423 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_left()
428 		rb_erase(&es->rb_node, &tree->root);  in ext4_es_try_to_merge_left()
441 	struct rb_node *node;  in ext4_es_try_to_merge_right()
443 	node = rb_next(&es->rb_node);  in ext4_es_try_to_merge_right()
447 	es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_try_to_merge_right()
635 	struct rb_node **p = &tree->root.rb_node;  in __es_insert_extent()
636 	struct rb_node *parent = NULL;  in __es_insert_extent()
641 		es = rb_entry(parent, struct extent_status, rb_node);  in __es_insert_extent()
676 	rb_link_node(&es->rb_node, parent, p);  in __es_insert_extent()
677 	rb_insert_color(&es->rb_node, &tree->root);  in __es_insert_extent()
785 	struct rb_node *node;  in ext4_es_lookup_extent()
806 	node = tree->root.rb_node;  in ext4_es_lookup_extent()
808 		es1 = rb_entry(node, struct extent_status, rb_node);  in ext4_es_lookup_extent()
843 	struct rb_node *node;  in __es_remove_extent()
905 		node = rb_next(&es->rb_node);  in __es_remove_extent()
907 			es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
913 		node = rb_next(&es->rb_node);  in __es_remove_extent()
914 		rb_erase(&es->rb_node, &tree->root);  in __es_remove_extent()
920 		es = rb_entry(node, struct extent_status, rb_node);  in __es_remove_extent()
1193 	struct rb_node *node;  in es_do_reclaim_extents()
1198 	node = &es->rb_node;  in es_do_reclaim_extents()
1206 		node = rb_next(&es->rb_node);  in es_do_reclaim_extents()
1218 		rb_erase(&es->rb_node, &tree->root);  in es_do_reclaim_extents()
1224 		es = rb_entry(node, struct extent_status, rb_node);  in es_do_reclaim_extents()