Lines Matching refs:root
247 + __le64 owner; /* objectid of the root referincing this chunk */
317 + __le64 root; /* tree root */
321 + /* this will help find the new super based on the log root */
455 + __le64 root;
549 + * this is used for both forward and backward root refs
631 + * and for the extent tree extent_root root.
712 + * root items point to tree roots. There are typically in the root
718 + * root backrefs tie subvols and snapshots to the directory entries that
724 + * root refs make a fast index for listing all of the snapshots and
725 + * subvolumes referenced by a given root. They point directly to the
726 + * directory item in the root that references the subvol
1003 +BTRFS_SETGET_FUNCS(ref_root, struct btrfs_extent_ref, root, 64);
1008 +BTRFS_SETGET_STACK_FUNCS(stack_ref_root, struct btrfs_extent_ref, root, 64);
1234 +BTRFS_SETGET_STACK_FUNCS(super_root, struct btrfs_super_block, root, 64);
1345 +static inline u32 btrfs_level_size(struct btrfs_root *root, int level) {
1347 + return root->leafsize;
1348 + return root->nodesize;
1402 +static int aux_tree_lookup(struct btrfs_root *root,
1433 +static inline int coord_is_root(struct btrfs_root *root,
1437 + btrfs_header_bytenr(&root->node);
1462 +int read_tree_block(struct btrfs_root *root,
1679 +static inline void init_btrfs_root (struct btrfs_root *root)
1681 + root->node.data = root->data;
1703 +static void setup_root(struct btrfs_root *root,
1710 + root->nodesize = nodesize;
1711 + root->leafsize = leafsize;
1712 + root->sectorsize = sectorsize;
1713 + root->stripesize = stripesize;
1714 + root->objectid = objectid;
1718 + * Pick up the latest root of a
1777 + * of the root we want to set up
2036 +static int btrfs_next_item(struct btrfs_root *root,
2042 + * Preconditions: chunk root is installed
2052 + struct btrfs_root *root;
2054 + root = BTRFS_CHUNK_ROOT;
2060 + ret = aux_tree_lookup(root, &key, path);
2082 + ret = btrfs_next_item(root, path);
2216 + /* setup chunk root */
2230 + /* setup tree root */
2568 +static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf)
2573 +static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
2584 +int read_tree_block(struct btrfs_root *root,
2616 + check_tree_block(root, eb) == 0 &&
2617 + csum_tree_block(root, eb, 1) == 0 &&
2636 +static int parent2child(struct btrfs_root *root,
2649 + return read_tree_block(root,
2652 + btrfs_level_size(root, level - 1),
2742 + * tree. All components of the @path from leaf to root
2747 +int aux_tree_lookup(struct btrfs_root *root,
2761 + copy_extent_buffer(&node, &root->node);
2779 + ret = parent2child(root, &node, slot, path->lpid);
2801 + * root have valid meta-data fields. path[0] has a
2806 +static int btrfs_next_leaf(struct btrfs_root *root,
2841 + res = parent2child(root, &tmp, slot, path->lpid);
2862 +static int btrfs_next_item(struct btrfs_root *root,
2871 + if (coord_is_root(root, path))
2874 + return btrfs_next_leaf(root, path);
3017 +static int btrfs_follow_link(struct btrfs_root *root,
3047 + ret = btrfs_next_item(root, path);
3113 +static int btrfs_de_index_by_name(struct btrfs_root *root,
3144 + ret = btrfs_next_item(root, path);
3272 + struct btrfs_root *root;
3278 + root = BTRFS_FS_ROOT;
3284 + ret = aux_tree_lookup(root, &sd_key, path);
3295 + ret = btrfs_follow_link(root,
3325 + ret = btrfs_de_index_by_name(root,
3339 + ret = update_fs_root(root, &sd_key);