Lines Matching refs:roots
1184 * When roots are found, they're added to the roots list
1189 * The special case is for qgroup to search roots in commit_transaction().
1205 struct ulist *roots, const u64 *extent_item_pos,
1339 * the list of found roots is updated.
1357 if (roots && ref->count && ref->root_id && ref->parent == 0) {
1365 ret = ulist_add(roots, ref->root_id, 0, GFP_NOFS);
1482 * walk all backrefs for a given extent to find all roots that reference this
1490 * list. Found roots are added to the roots list.
1496 u64 time_seq, struct ulist **roots,
1507 *roots = ulist_alloc(GFP_NOFS);
1508 if (!*roots) {
1516 tmp, *roots, NULL, NULL, ignore_offset);
1519 ulist_free(*roots);
1520 *roots = NULL;
1536 u64 time_seq, struct ulist **roots,
1544 time_seq, roots, ignore_offset);
1565 struct ulist *roots, struct ulist *tmp)
1580 ulist_init(roots);
1598 roots, NULL, &shared, false);
1623 ulist_release(roots);
2001 struct ulist *roots = NULL;
2035 tree_mod_seq_elem.seq, &roots,
2040 while (!ret && (root_node = ulist_next(roots, &root_uiter))) {
2052 ulist_free(roots);