Lines Matching refs:tree_root
1133 struct btrfs_root *tree_root = fs_info->tree_root;
1185 ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item);
1284 static struct btrfs_root *read_tree_root_path(struct btrfs_root *tree_root,
1289 struct btrfs_fs_info *fs_info = tree_root->fs_info;
1298 ret = btrfs_find_root(tree_root, key, path,
1326 struct btrfs_root *btrfs_read_tree_root(struct btrfs_root *tree_root,
1335 root = read_tree_root_path(tree_root, path, key);
1430 return btrfs_grab_root(fs_info->tree_root);
1506 btrfs_put_root(fs_info->tree_root);
1577 root = btrfs_read_tree_root(fs_info->tree_root, &key);
1599 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
1662 * creation time, which means we may have to read the tree_root in order to look
1695 root = read_tree_root_path(fs_info->tree_root, path, &key);
1895 btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start);
1897 btrfs_header_generation(info->tree_root->node));
1900 btrfs_header_level(info->tree_root->node));
2039 free_root_extent_buffers(info->tree_root);
2144 BTRFS_I(inode)->root = btrfs_grab_root(fs_info->tree_root);
2334 struct btrfs_root *tree_root = fs_info->tree_root;
2339 BUG_ON(!fs_info->tree_root);
2345 root = btrfs_read_tree_root(tree_root, &location);
2354 root = btrfs_read_tree_root(tree_root, &location);
2364 root = btrfs_read_tree_root(tree_root, &location);
2376 root = btrfs_get_fs_root(tree_root->fs_info,
2386 root = btrfs_read_tree_root(tree_root, &location);
2394 root = btrfs_read_tree_root(tree_root, &location);
2406 root = btrfs_read_tree_root(tree_root, &location);
2449 btrfs_err(fs_info, "tree_root level too big: %d >= %d",
2493 btrfs_warn(fs_info, "tree_root block unaligned: %llu",
2647 struct btrfs_root *tree_root = fs_info->tree_root;
2657 if (!IS_ERR(tree_root->node))
2658 free_extent_buffer(tree_root->node);
2659 tree_root->node = NULL;
2682 tree_root->node = read_tree_block(fs_info, btrfs_super_root(sb),
2684 if (IS_ERR(tree_root->node)) {
2686 ret = PTR_ERR(tree_root->node);
2687 tree_root->node = NULL;
2691 } else if (!extent_buffer_uptodate(tree_root->node)) {
2698 btrfs_set_root_node(&tree_root->root_item, tree_root->node);
2699 tree_root->commit_root = btrfs_root_node(tree_root);
2700 btrfs_set_root_refs(&tree_root->root_item, 1);
2706 ret = btrfs_find_highest_objectid(tree_root,
2707 &tree_root->highest_objectid);
2713 ASSERT(tree_root->highest_objectid <= BTRFS_LAST_FREE_OBJECTID);
2940 struct btrfs_root *tree_root;
2954 tree_root = btrfs_alloc_root(fs_info, BTRFS_ROOT_TREE_OBJECTID,
2956 fs_info->tree_root = tree_root;
2960 if (!tree_root || !chunk_root) {
3282 fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
3288 tree_root,
3345 ret = btrfs_recover_relocation(tree_root);
3400 (ret = btrfs_orphan_cleanup(fs_info->tree_root))) {
4081 struct btrfs_root *root = fs_info->tree_root;
4788 trace_btrfs_transaction_commit(fs_info->tree_root);