Lines Matching defs:tree
283 * Release the entire tree. We don't care about internal consistency so
284 * just free everything and then reset the tree root.
310 * information | tree | tree | data | data
314 * tree block logical | - | - | - | -
323 * information | tree | tree | data | data
327 * tree block logical | y | y | y | y
385 struct preftree *tree = &preftrees->indirect;
388 tree = &preftrees->indirect_missing_keys;
389 return add_prelim_ref(fs_info, tree, root_id, key, level, 0,
556 * other tree nodes. This happens when qgroups does backref walks when
671 * have a key. Each tree does merge on insertion.
673 * Once all of the references are located, we iterate over the tree of
675 * the ref is moved onto the tree for indirect refs. After all missing
676 * keys are thus located, we iterate over the indirect ref tree, resolve
678 * direct tree (merging there too).
703 * the tree, allocating new refs for each insertion, and then
704 * freeing the entire indirect tree when we're done. In some test
705 * cases, the tree can grow quite large (~200k objects).
712 "BUG: direct ref found in indirect tree")) {
773 * Now it's a direct ref, put it in the direct tree. We must
791 * read tree blocks and add keys where required.
798 struct preftree *tree = &preftrees->indirect_missing_keys;
801 while ((node = rb_first_cached(&tree->root))) {
803 rb_erase_cached(node, &tree->root);
916 * process references from the extent tree (through
920 * may cancel that reference in the extent tree.
1337 * This walks the tree of merged and resolved refs. Tree blocks are
1341 * We release the entire tree in one go before returning.
1364 /* no parent == root of tree */
1676 * in the tree and we can exit.
1784 * tree blocks and <0 on error.
1912 * reads the tree block backref for an extent. tree level and root are returned
2160 "following ref at offset %u for inode %llu in tree %llu",
2438 * Only support iteration on tree backref yet.
2441 * EXTENT_ITEM is also used for tree blocks, that we can only use
2442 * extent flags to determine if it's a tree block.
2506 /* First tree block info */
2664 * Handle direct tree backref
2666 * Direct tree backref means, the backref item shows its parent bytenr
2736 * Handle indirect tree backref
2738 * Indirect tree backref means, we only know which tree the node belongs to.
2739 * We still need to do a tree search to find out the parents. This is for
2743 * @tree_key: The first key of this tree block.
2794 /* Search the tree to find parent blocks referring to the block */
2810 "couldn't find block (%llu) (level %d) in tree (%llu) with key (%llu %u %llu)",
2869 * tree as we will catch anything else later on.
2909 * @path: Released path for indirect tree backref lookup
2910 * @iter: Released backref iter for extent tree search
2911 * @node_key: The first key of the tree block
2929 * stored in it, but fetch it from the tree block
2935 /* No extra backref? This means the tree block is corrupted */
3020 * means the root objectid. We need to search the tree to get
3090 * been linked to the cache rb tree.
3117 /* Only cache non-COW-only (subvolume trees) tree blocks */