Lines Matching defs:root
328 struct btrfs_root *root, *tmp;
334 * checksum tree and the root tree. If the fs is empty we want to set
337 * We also are going to need to modify the minimum of the tree root and
341 rbtree_postorder_for_each_entry_safe(root, tmp, &fs_info->global_root_tree,
343 if (root->root_key.objectid == BTRFS_EXTENT_TREE_OBJECTID ||
344 root->root_key.objectid == BTRFS_CSUM_TREE_OBJECTID ||
345 root->root_key.objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) {
346 num_bytes += btrfs_root_used(&root->root_item);
399 void btrfs_init_root_block_rsv(struct btrfs_root *root)
401 struct btrfs_fs_info *fs_info = root->fs_info;
403 switch (root->root_key.objectid) {
408 root->block_rsv = &fs_info->delayed_refs_rsv;
413 root->block_rsv = &fs_info->global_block_rsv;
416 root->block_rsv = &fs_info->chunk_block_rsv;
419 root->block_rsv = NULL;
457 const struct btrfs_root *root)
459 struct btrfs_fs_info *fs_info = root->fs_info;
462 if (test_bit(BTRFS_ROOT_SHAREABLE, &root->state) ||
463 (root == fs_info->uuid_root) ||
465 root->root_key.objectid == BTRFS_CSUM_TREE_OBJECTID))
469 block_rsv = root->block_rsv;
478 struct btrfs_root *root,
481 struct btrfs_fs_info *fs_info = root->fs_info;
487 block_rsv = get_block_rsv(trans, root);