2432 static void free_block_list(struct rb_root *blocks)  argument
2436 	while ((rb_node = rb_first(blocks))) {
2438 		rb_erase(rb_node, blocks);
2950 			 struct reloc_control *rc, struct rb_root *blocks)  argument
2965 	rb_node = rb_first(blocks);
2973 	rb_node = rb_first(blocks);
2984 	rb_node = rb_first(blocks);
2998 			if (ret != -EAGAIN || rb_node == rb_first(blocks))
3010 	free_block_list(blocks);
3278 			  struct rb_root *blocks)  argument
3336 	rb_node = tree_insert(blocks, block->bytenr, &block->rb_node);
3348 			    struct rb_root *blocks)  argument
3359 	if (tree_search(blocks, bytenr))
3401 	ret = add_tree_block(rc, &key, path, blocks);
3485 				struct rb_root *blocks)  argument
3557 	rb_node = tree_search(blocks, leaf->start);
3583 			rb_node = tree_search(blocks, leaf->start);
3627 			rb_node = tree_insert(blocks, block->bytenr,
3653 			struct rb_root *blocks)  argument
3681 					       blocks);
3685 						   eb, dref, blocks);
3723 					       blocks);
3728 						   eb, dref, blocks);
3741 		free_block_list(blocks);
3901 	struct rb_root blocks = RB_ROOT;  local
3994 			ret = add_tree_block(rc, &key, path, &blocks);
3997 			ret = add_data_references(rc, &key, path, &blocks);
4007 		if (!RB_EMPTY_ROOT(&blocks)) {
4008 			ret = relocate_tree_blocks(trans, rc, &blocks);