544 	struct btrfs_backref_node *new_node;  in clone_backref_node()  local
574 	new_node = btrfs_backref_alloc_node(cache, dest->node->start,  in clone_backref_node()
576 	if (!new_node)  in clone_backref_node()
579 	new_node->lowest = node->lowest;  in clone_backref_node()
580 	new_node->checked = 1;  in clone_backref_node()
581 	new_node->root = btrfs_grab_root(dest);  in clone_backref_node()
582 	ASSERT(new_node->root);  in clone_backref_node()
591 						new_node, LINK_UPPER);  in clone_backref_node()
594 		list_add_tail(&new_node->lower, &cache->leaves);  in clone_backref_node()
597 	rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr,  in clone_backref_node()
598 				   &new_node->rb_node);  in clone_backref_node()
600 		btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST);  in clone_backref_node()
602 	if (!new_node->lowest) {  in clone_backref_node()
603 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {  in clone_backref_node()
610 	while (!list_empty(&new_node->lower)) {  in clone_backref_node()
611 		new_edge = list_entry(new_node->lower.next,  in clone_backref_node()
616 	btrfs_backref_free_node(cache, new_node);  in clone_backref_node()