Lines Matching refs:roots
1204 struct ulist *roots, const u64 *extent_item_pos, in find_parent_nodes() argument
1350 if (roots && ref->count && ref->root_id && ref->parent == 0) { in find_parent_nodes()
1358 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS); in find_parent_nodes()
1488 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots_safe() argument
1499 *roots = ulist_alloc(GFP_NOFS); in btrfs_find_all_roots_safe()
1500 if (!*roots) { in btrfs_find_all_roots_safe()
1508 tmp, *roots, NULL, NULL, ignore_offset); in btrfs_find_all_roots_safe()
1511 ulist_free(*roots); in btrfs_find_all_roots_safe()
1512 *roots = NULL; in btrfs_find_all_roots_safe()
1528 u64 time_seq, struct ulist **roots, in btrfs_find_all_roots() argument
1536 time_seq, roots, false); in btrfs_find_all_roots()
1685 struct ulist *roots, struct ulist *tmp, in btrfs_is_data_extent_shared() argument
1702 ulist_init(roots); in btrfs_is_data_extent_shared()
1726 roots, NULL, &shared, false); in btrfs_is_data_extent_shared()
1794 ulist_release(roots); in btrfs_is_data_extent_shared()
2168 struct ulist *roots = NULL; in iterate_extent_inodes() local
2202 seq_elem.seq, &roots, in iterate_extent_inodes()
2207 while (!ret && (root_node = ulist_next(roots, &root_uiter))) { in iterate_extent_inodes()
2219 ulist_free(roots); in iterate_extent_inodes()