Lines Matching refs:roots
1213 * root while we are deleting the root. This is like dropping fs roots
2418 * Walk all of the roots that points to the bytenr and adjust their refcnts.
2421 struct ulist *roots, struct ulist *tmp,
2431 if (!roots)
2434 while ((unode = ulist_next(roots, &uiter))) {
2599 * Check if the @roots potentially is a list of fs tree roots
2601 * Return 0 for definitely not a fs/subvol tree roots ulist
2602 * Return 1 for possible fs/subvol tree roots in the list (considering an empty
2605 static int maybe_fs_roots(struct ulist *roots)
2610 /* Empty one, still possible for fs roots */
2611 if (!roots || roots->nnodes == 0)
2615 unode = ulist_next(roots, &uiter);
2620 * If it contains fs tree roots, then it must belong to fs/subvol
2657 /* Quick exit, either not fs tree roots, or won't affect any qgroup */
2741 * Old roots should be searched when inserting qgroup
2964 * difference between the two roots should be the root node.
3242 struct ulist *roots = NULL;
3300 &roots, false);
3305 num_bytes, NULL, roots);
4193 * Add subtree roots record into @subvol_root.