2434 static void free_block_list(struct rb_root *blocks)  argument
2438 	while ((rb_node = rb_first(blocks))) {
2440 		rb_erase(rb_node, blocks);
2956 			 struct reloc_control *rc, struct rb_root *blocks)  argument
2971 	rb_node = rb_first(blocks);
2979 	rb_node = rb_first(blocks);
2990 	rb_node = rb_first(blocks);
3004 			if (ret != -EAGAIN || rb_node == rb_first(blocks))
3016 	free_block_list(blocks);
3284 			  struct rb_root *blocks)  argument
3342 	rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3354 			    struct rb_root *blocks)  argument
3365 	if (tree_search(blocks, bytenr))
3407 	ret = add_tree_block(rc, &key, path, blocks);
3491 				struct rb_root *blocks)  argument
3563 	rb_node = tree_search(blocks, leaf->start);
3589 			rb_node = tree_search(blocks, leaf->start);
3633 			rb_node = tree_insert(blocks, block->bytenr,
3659 			struct rb_root *blocks)  argument
3687 					       blocks);
3691 						   eb, dref, blocks);
3729 					       blocks);
3734 						   eb, dref, blocks);
3747 		free_block_list(blocks);
3906 	struct rb_root blocks = RB_ROOT;  local
4003 			ret = add_tree_block(rc, &key, path, &blocks);
4006 			ret = add_data_references(rc, &key, path, &blocks);
4016 		if (!RB_EMPTY_ROOT(&blocks)) {
4017 			ret = relocate_tree_blocks(trans, rc, &blocks);