193 		eb = rcu_dereference(root->node);  in btrfs_root_node()
321 	if (buf == root->node)  in btrfs_block_can_be_shared()
541 	if (buf == root->node) {  in btrfs_force_cow_block()
547 		ret = btrfs_tree_mod_log_insert_root(root->node, cow, true);  in btrfs_force_cow_block()
553 		rcu_assign_pointer(root->node, cow);  in btrfs_force_cow_block()
904 		ret = btrfs_tree_mod_log_insert_root(root->node, child, true);  in balance_level()
911 		rcu_assign_pointer(root->node, child);  in balance_level()
1274 	struct extent_buffer *node;  in reada_for_search()  local
1291 	node = path->nodes[level];  in reada_for_search()
1300 			nread_max = node->fs_info->nodesize;  in reada_for_search()
1307 	search = btrfs_node_blockptr(node, slot);  in reada_for_search()
1321 	nritems = btrfs_header_nritems(node);  in reada_for_search()
1336 			btrfs_node_key(node, &disk_key, nr);  in reada_for_search()
1340 		search = btrfs_node_blockptr(node, nr);  in reada_for_search()
1344 			btrfs_readahead_node_child(node, nr);  in reada_for_search()
2844 	BUG_ON(path->nodes[level-1] != root->node);  in insert_new_root()
2853 				   &lower_key, level, root->node->start, 0,  in insert_new_root()
2870 	old = root->node;  in insert_new_root()
2871 	ret = btrfs_tree_mod_log_insert_root(root->node, c, false);  in insert_new_root()
2882 	rcu_assign_pointer(root->node, c);  in insert_new_root()
2972 	if (c == root->node) {  in split_node()
4401 	if (nritems == 0 && parent == root->node) {  in btrfs_del_ptr()
4402 		BUG_ON(btrfs_header_level(root->node) != 1);  in btrfs_del_ptr()
4404 		btrfs_set_header_level(root->node, 0);  in btrfs_del_ptr()
4497 		if (leaf == root->node) {  in btrfs_del_items()