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
358  *        backref type | shared | indirect | shared | indirect
371  *        backref type | shared | indirect | shared | indirect
427 /* indirect refs use parent == 0 */
434 	struct preftree *tree = &preftrees->indirect;
587  * resolve an indirect backref in the form (root_id, key, level)
716  * indirect refs which have a key, and one for indirect refs which do not
720  * indirect refs with missing keys. An appropriate key is located and
721  * the ref is moved onto the tree for indirect refs. After all missing
722  * keys are thus located, we iterate over the indirect ref tree, resolve
748 	 * freeing the entire indirect tree when we're done.  In some test
751 	while ((rnode = rb_first_cached(&preftrees->indirect.root))) {
757 			 "BUG: direct ref found in indirect tree")) {
762 		rb_erase_cached(&ref->rbnode, &preftrees->indirect.root);
763 		preftrees->indirect.count--;
871 		prelim_ref_insert(fs_info, &preftrees->indirect, ref, NULL);
1361  * indirect refs to their parent bytenr.
1387 		.indirect = PREFTREE_INIT,
1523 		 * resolving indirect references, there's no point in
1538 		 * indirect references for a data extent, since the fs tree path
1575 	WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root));
1676 	prelim_release(&preftrees.indirect);
1955 		 *    and indirect references on a b+tree node/leaf, so we have
1959 		 *    (direct ref) and a non-shared tree block ref (indirect
1991 	 * got multiple parents due to a mix of direct and indirect backrefs or
3252  * Handle indirect tree backref
3442  * @path:	Released path for indirect tree backref lookup