Lines Matching refs:new_node
485 struct btrfs_backref_node *new_node; in clone_backref_node() local
512 new_node = btrfs_backref_alloc_node(cache, dest->node->start, in clone_backref_node()
514 if (!new_node) in clone_backref_node()
517 new_node->lowest = node->lowest; in clone_backref_node()
518 new_node->checked = 1; in clone_backref_node()
519 new_node->root = btrfs_grab_root(dest); in clone_backref_node()
520 ASSERT(new_node->root); in clone_backref_node()
529 new_node, LINK_UPPER); in clone_backref_node()
532 list_add_tail(&new_node->lower, &cache->leaves); in clone_backref_node()
535 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, in clone_backref_node()
536 &new_node->rb_node); in clone_backref_node()
538 btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); in clone_backref_node()
540 if (!new_node->lowest) { in clone_backref_node()
541 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
548 while (!list_empty(&new_node->lower)) { in clone_backref_node()
549 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
554 btrfs_backref_free_node(cache, new_node); in clone_backref_node()