1209 	struct backref_node *new_node;  in clone_backref_node()  local
1239 	new_node = alloc_backref_node(cache);  in clone_backref_node()
1240 	if (!new_node)  in clone_backref_node()
1243 	new_node->bytenr = dest->node->start;  in clone_backref_node()
1244 	new_node->level = node->level;  in clone_backref_node()
1245 	new_node->lowest = node->lowest;  in clone_backref_node()
1246 	new_node->checked = 1;  in clone_backref_node()
1247 	new_node->root = dest;  in clone_backref_node()
1255 			new_edge->node[UPPER] = new_node;  in clone_backref_node()
1258 				      &new_node->lower);  in clone_backref_node()
1261 		list_add_tail(&new_node->lower, &cache->leaves);  in clone_backref_node()
1264 	rb_node = tree_insert(&cache->rb_root, new_node->bytenr,  in clone_backref_node()
1265 			      &new_node->rb_node);  in clone_backref_node()
1267 		backref_tree_panic(rb_node, -EEXIST, new_node->bytenr);  in clone_backref_node()
1269 	if (!new_node->lowest) {  in clone_backref_node()
1270 		list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) {  in clone_backref_node()
1277 	while (!list_empty(&new_node->lower)) {  in clone_backref_node()
1278 		new_edge = list_entry(new_node->lower.next,  in clone_backref_node()
1283 	free_backref_node(cache, new_node);  in clone_backref_node()