Lines Matching refs:new_node
545 struct btrfs_backref_node *new_node; in clone_backref_node() local
575 new_node = btrfs_backref_alloc_node(cache, dest->node->start, in clone_backref_node()
577 if (!new_node) in clone_backref_node()
580 new_node->lowest = node->lowest; in clone_backref_node()
581 new_node->checked = 1; in clone_backref_node()
582 new_node->root = btrfs_grab_root(dest); in clone_backref_node()
583 ASSERT(new_node->root); in clone_backref_node()
592 new_node, LINK_UPPER); in clone_backref_node()
595 list_add_tail(&new_node->lower, &cache->leaves); in clone_backref_node()
598 rb_node = rb_simple_insert(&cache->rb_root, new_node->bytenr, in clone_backref_node()
599 &new_node->rb_node); in clone_backref_node()
601 btrfs_backref_panic(trans->fs_info, new_node->bytenr, -EEXIST); in clone_backref_node()
603 if (!new_node->lowest) { in clone_backref_node()
604 list_for_each_entry(new_edge, &new_node->lower, list[UPPER]) { in clone_backref_node()
611 while (!list_empty(&new_node->lower)) { in clone_backref_node()
612 new_edge = list_entry(new_node->lower.next, in clone_backref_node()
617 btrfs_backref_free_node(cache, new_node); in clone_backref_node()