1164 	struct backref_node *new_node;  in clone_backref_node()  local
1194 	new_node = alloc_backref_node(cache);  in clone_backref_node()
1195 	if (!new_node)  in clone_backref_node()
1198 	new_node->bytenr = dest->node->start;  in clone_backref_node()
1199 	new_node->level = node->level;  in clone_backref_node()
1200 	new_node->lowest = node->lowest;  in clone_backref_node()
1201 	new_node->checked = 1;  in clone_backref_node()
1202 	new_node->root = dest;  in clone_backref_node()
1210 			new_edge->node[UPPER] = new_node;  in clone_backref_node()
1213 				      &new_node->lower);  in clone_backref_node()
1216 		list_add_tail(&new_node->lower, &cache->leaves);  in clone_backref_node()
1219 	rb_node = tree_insert(&cache->rb_root, new_node->bytenr,  in clone_backref_node()
1220 			      &new_node->rb_node);  in clone_backref_node()
1222 		backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);  in clone_backref_node()
1224 	if (!new_node->lowest) {  in clone_backref_node()
1225 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {  in clone_backref_node()
1232 	while (!list_empty(&new_node->lower)) {  in clone_backref_node()
1233 		new_edge = list_entry(new_node->lower.next,  in clone_backref_node()
1238 	free_backref_node(cache, new_node);  in clone_backref_node()