Lines Matching defs:indirect
152 struct preftree indirect; /* BTRFS_[TREE_BLOCK|EXTENT_DATA]_REF_KEY */
159 * The share_count tracks prelim_refs (direct and indirect) having a
362 * backref type | shared | indirect | shared | indirect
375 * backref type | shared | indirect | shared | indirect
431 /* indirect refs use parent == 0 */
438 struct preftree *tree = &preftrees->indirect;
591 * resolve an indirect backref in the form (root_id, key, level)
721 * indirect refs which have a key, and one for indirect refs which do not
725 * indirect refs with missing keys. An appropriate key is located and
726 * the ref is moved onto the tree for indirect refs. After all missing
727 * keys are thus located, we iterate over the indirect ref tree, resolve
754 * freeing the entire indirect tree when we're done. In some test
757 while ((rnode = rb_first_cached(&preftrees->indirect.root))) {
762 "BUG: direct ref found in indirect tree")) {
767 rb_erase_cached(&ref->rbnode, &preftrees->indirect.root);
768 preftrees->indirect.count--;
881 prelim_ref_insert(fs_info, &preftrees->indirect, ref, NULL);
1376 * indirect refs to their parent bytenr.
1402 .indirect = PREFTREE_INIT,
1528 * resolving indirect references, there's no point in
1543 * indirect references for a data extent, since the fs tree path
1580 WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root));
1686 prelim_release(&preftrees.indirect);
1965 * and indirect references on a b+tree node/leaf, so we have
1969 * (direct ref) and a non-shared tree block ref (indirect
2001 * got multiple parents due to a mix of direct and indirect backrefs or
3193 * Handle indirect tree backref
3369 * @path: Released path for indirect tree backref lookup