[net-next-2.6.git] / fs / btrfs / root-tree.c

/*
 * Copyright (C) 2007 Oracle.  All rights reserved.
 *
 * This program is free software; you can redistribute it and/or
 * modify it under the terms of the GNU General Public
 * License v2 as published by the Free Software Foundation.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * General Public License for more details.
 *
 * You should have received a copy of the GNU General Public
 * License along with this program; if not, write to the
 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
 * Boston, MA 021110-1307, USA.
 */

#include "ctree.h"
#include "transaction.h"
#include "disk-io.h"
#include "print-tree.h"

/*
 *  search forward for a root, starting with objectid 'search_start'
 *  if a root key is found, the objectid we find is filled into 'found_objectid'
 *  and 0 is returned.  < 0 is returned on error, 1 if there is nothing
 *  left in the tree.
 */
int btrfs_search_root(struct btrfs_root *root, u64 search_start,
		      u64 *found_objectid)
{
	struct btrfs_path *path;
	struct btrfs_key search_key;
	int ret;

	root = root->fs_info->tree_root;
	search_key.objectid = search_start;
	search_key.type = (u8)-1;
	search_key.offset = (u64)-1;

	path = btrfs_alloc_path();
	BUG_ON(!path);
again:
	ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
	if (ret < 0)
		goto out;
	if (ret == 0) {
		ret = 1;
		goto out;
	}
	if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
		ret = btrfs_next_leaf(root, path);
		if (ret)
			goto out;
	}
	btrfs_item_key_to_cpu(path->nodes[0], &search_key, path->slots[0]);
	if (search_key.type != BTRFS_ROOT_ITEM_KEY) {
		search_key.offset++;
		btrfs_release_path(root, path);
		goto again;
	}
	ret = 0;
	*found_objectid = search_key.objectid;

out:
	btrfs_free_path(path);
	return ret;
}

/*
 * lookup the root with the highest offset for a given objectid.  The key we do
 * find is copied into 'key'.  If we find something return 0, otherwise 1, < 0
 * on error.
 */
int btrfs_find_last_root(struct btrfs_root *root, u64 objectid,
			struct btrfs_root_item *item, struct btrfs_key *key)
{
	struct btrfs_path *path;
	struct btrfs_key search_key;
	struct btrfs_key found_key;
	struct extent_buffer *l;
	int ret;
	int slot;

	search_key.objectid = objectid;
	search_key.type = BTRFS_ROOT_ITEM_KEY;
	search_key.offset = (u64)-1;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
	if (ret < 0)
		goto out;

	BUG_ON(ret == 0);
	if (path->slots[0] == 0) {
		ret = 1;
		goto out;
	}
	l = path->nodes[0];
	slot = path->slots[0] - 1;
	btrfs_item_key_to_cpu(l, &found_key, slot);
	if (found_key.objectid != objectid ||
	    found_key.type != BTRFS_ROOT_ITEM_KEY) {
		ret = 1;
		goto out;
	}
	if (item)
		read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot),
				   sizeof(*item));
	if (key)
		memcpy(key, &found_key, sizeof(found_key));
	ret = 0;
out:
	btrfs_free_path(path);
	return ret;
}

int btrfs_set_root_node(struct btrfs_root_item *item,
			struct extent_buffer *node)
{
	btrfs_set_root_bytenr(item, node->start);
	btrfs_set_root_level(item, btrfs_header_level(node));
	btrfs_set_root_generation(item, btrfs_header_generation(node));
	return 0;
}

/*
 * copy the data in 'item' into the btree
 */
int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
		      *root, struct btrfs_key *key, struct btrfs_root_item
		      *item)
{
	struct btrfs_path *path;
	struct extent_buffer *l;
	int ret;
	int slot;
	unsigned long ptr;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	ret = btrfs_search_slot(trans, root, key, path, 0, 1);
	if (ret < 0)
		goto out;

	if (ret != 0) {
		btrfs_print_leaf(root, path->nodes[0]);
		printk(KERN_CRIT "unable to update root key %llu %u %llu\n",
		       (unsigned long long)key->objectid, key->type,
		       (unsigned long long)key->offset);
		BUG_ON(1);
	}

	l = path->nodes[0];
	slot = path->slots[0];
	ptr = btrfs_item_ptr_offset(l, slot);
	write_extent_buffer(l, item, ptr, sizeof(*item));
	btrfs_mark_buffer_dirty(path->nodes[0]);
out:
	btrfs_free_path(path);
	return ret;
}

int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root
		      *root, struct btrfs_key *key, struct btrfs_root_item
		      *item)
{
	int ret;
	ret = btrfs_insert_item(trans, root, key, item, sizeof(*item));
	return ret;
}

/*
 * at mount time we want to find all the old transaction snapshots that were in
 * the process of being deleted if we crashed.  This is any root item with an
 * offset lower than the latest root.  They need to be queued for deletion to
 * finish what was happening when we crashed.
 */
int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid)
{
	struct btrfs_root *dead_root;
	struct btrfs_root_item *ri;
	struct btrfs_key key;
	struct btrfs_key found_key;
	struct btrfs_path *path;
	int ret;
	u32 nritems;
	struct extent_buffer *leaf;
	int slot;

	key.objectid = objectid;
	btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
	key.offset = 0;
	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

again:
	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
	if (ret < 0)
		goto err;
	while (1) {
		leaf = path->nodes[0];
		nritems = btrfs_header_nritems(leaf);
		slot = path->slots[0];
		if (slot >= nritems) {
			ret = btrfs_next_leaf(root, path);
			if (ret)
				break;
			leaf = path->nodes[0];
			nritems = btrfs_header_nritems(leaf);
			slot = path->slots[0];
		}
		btrfs_item_key_to_cpu(leaf, &key, slot);
		if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY)
			goto next;

		if (key.objectid < objectid)
			goto next;

		if (key.objectid > objectid)
			break;

		ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
		if (btrfs_disk_root_refs(leaf, ri) != 0)
			goto next;

		memcpy(&found_key, &key, sizeof(key));
		key.offset++;
		btrfs_release_path(root, path);
		dead_root =
			btrfs_read_fs_root_no_radix(root->fs_info->tree_root,
						    &found_key);
		if (IS_ERR(dead_root)) {
			ret = PTR_ERR(dead_root);
			goto err;
		}

		ret = btrfs_add_dead_root(dead_root);
		if (ret)
			goto err;
		goto again;
next:
		slot++;
		path->slots[0]++;
	}
	ret = 0;
err:
	btrfs_free_path(path);
	return ret;
}

int btrfs_find_orphan_roots(struct btrfs_root *tree_root)
{
	struct extent_buffer *leaf;
	struct btrfs_path *path;
	struct btrfs_key key;
	struct btrfs_key root_key;
	struct btrfs_root *root;
	int err = 0;
	int ret;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	key.objectid = BTRFS_ORPHAN_OBJECTID;
	key.type = BTRFS_ORPHAN_ITEM_KEY;
	key.offset = 0;

	root_key.type = BTRFS_ROOT_ITEM_KEY;
	root_key.offset = (u64)-1;

	while (1) {
		ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
		if (ret < 0) {
			err = ret;
			break;
		}

		leaf = path->nodes[0];
		if (path->slots[0] >= btrfs_header_nritems(leaf)) {
			ret = btrfs_next_leaf(tree_root, path);
			if (ret < 0)
				err = ret;
			if (ret != 0)
				break;
			leaf = path->nodes[0];
		}

		btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
		btrfs_release_path(tree_root, path);

		if (key.objectid != BTRFS_ORPHAN_OBJECTID ||
		    key.type != BTRFS_ORPHAN_ITEM_KEY)
			break;

		root_key.objectid = key.offset;
		key.offset++;

		root = btrfs_read_fs_root_no_name(tree_root->fs_info,
						  &root_key);
		if (!IS_ERR(root))
			continue;

		ret = PTR_ERR(root);
		if (ret != -ENOENT) {
			err = ret;
			break;
		}

		ret = btrfs_find_dead_roots(tree_root, root_key.objectid);
		if (ret) {
			err = ret;
			break;
		}
	}

	btrfs_free_path(path);
	return err;
}

/* drop the root item for 'key' from 'root' */
int btrfs_del_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
		   struct btrfs_key *key)
{
	struct btrfs_path *path;
	int ret;
	struct btrfs_root_item *ri;
	struct extent_buffer *leaf;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	ret = btrfs_search_slot(trans, root, key, path, -1, 1);
	if (ret < 0)
		goto out;

	BUG_ON(ret != 0);
	leaf = path->nodes[0];
	ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item);

	ret = btrfs_del_item(trans, root, path);
out:
	btrfs_free_path(path);
	return ret;
}

int btrfs_del_root_ref(struct btrfs_trans_handle *trans,
		       struct btrfs_root *tree_root,
		       u64 root_id, u64 ref_id, u64 dirid, u64 *sequence,
		       const char *name, int name_len)

{
	struct btrfs_path *path;
	struct btrfs_root_ref *ref;
	struct extent_buffer *leaf;
	struct btrfs_key key;
	unsigned long ptr;
	int err = 0;
	int ret;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	key.objectid = root_id;
	key.type = BTRFS_ROOT_BACKREF_KEY;
	key.offset = ref_id;
again:
	ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
	BUG_ON(ret < 0);
	if (ret == 0) {
		leaf = path->nodes[0];
		ref = btrfs_item_ptr(leaf, path->slots[0],
				     struct btrfs_root_ref);

		WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
		WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len);
		ptr = (unsigned long)(ref + 1);
		WARN_ON(memcmp_extent_buffer(leaf, name, ptr, name_len));
		*sequence = btrfs_root_ref_sequence(leaf, ref);

		ret = btrfs_del_item(trans, tree_root, path);
		BUG_ON(ret);
	} else
		err = -ENOENT;

	if (key.type == BTRFS_ROOT_BACKREF_KEY) {
		btrfs_release_path(tree_root, path);
		key.objectid = ref_id;
		key.type = BTRFS_ROOT_REF_KEY;
		key.offset = root_id;
		goto again;
	}

	btrfs_free_path(path);
	return err;
}

int btrfs_find_root_ref(struct btrfs_root *tree_root,
		   struct btrfs_path *path,
		   u64 root_id, u64 ref_id)
{
	struct btrfs_key key;
	int ret;

	key.objectid = root_id;
	key.type = BTRFS_ROOT_REF_KEY;
	key.offset = ref_id;

	ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
	return ret;
}

/*
 * add a btrfs_root_ref item.  type is either BTRFS_ROOT_REF_KEY
 * or BTRFS_ROOT_BACKREF_KEY.
 *
 * The dirid, sequence, name and name_len refer to the directory entry
 * that is referencing the root.
 *
 * For a forward ref, the root_id is the id of the tree referencing
 * the root and ref_id is the id of the subvol  or snapshot.
 *
 * For a back ref the root_id is the id of the subvol or snapshot and
 * ref_id is the id of the tree referencing it.
 */
int btrfs_add_root_ref(struct btrfs_trans_handle *trans,
		       struct btrfs_root *tree_root,
		       u64 root_id, u64 ref_id, u64 dirid, u64 sequence,
		       const char *name, int name_len)
{
	struct btrfs_key key;
	int ret;
	struct btrfs_path *path;
	struct btrfs_root_ref *ref;
	struct extent_buffer *leaf;
	unsigned long ptr;

	path = btrfs_alloc_path();
	if (!path)
		return -ENOMEM;

	key.objectid = root_id;
	key.type = BTRFS_ROOT_BACKREF_KEY;
	key.offset = ref_id;
again:
	ret = btrfs_insert_empty_item(trans, tree_root, path, &key,
				      sizeof(*ref) + name_len);
	BUG_ON(ret);

	leaf = path->nodes[0];
	ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
	btrfs_set_root_ref_dirid(leaf, ref, dirid);
	btrfs_set_root_ref_sequence(leaf, ref, sequence);
	btrfs_set_root_ref_name_len(leaf, ref, name_len);
	ptr = (unsigned long)(ref + 1);
	write_extent_buffer(leaf, name, ptr, name_len);
	btrfs_mark_buffer_dirty(leaf);

	if (key.type == BTRFS_ROOT_BACKREF_KEY) {
		btrfs_release_path(tree_root, path);
		key.objectid = ref_id;
		key.type = BTRFS_ROOT_REF_KEY;
		key.offset = root_id;
		goto again;
	}

	btrfs_free_path(path);
	return 0;
}
Commit	Line	Data
6cbd5570 CM	1	/*
	2	* Copyright (C) 2007 Oracle. All rights reserved.
	3	*
	4	* This program is free software; you can redistribute it and/or
	5	* modify it under the terms of the GNU General Public
	6	* License v2 as published by the Free Software Foundation.
	7	*
	8	* This program is distributed in the hope that it will be useful,
	9	* but WITHOUT ANY WARRANTY; without even the implied warranty of
	10	* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
	11	* General Public License for more details.
	12	*
	13	* You should have received a copy of the GNU General Public
	14	* License along with this program; if not, write to the
	15	* Free Software Foundation, Inc., 59 Temple Place - Suite 330,
	16	* Boston, MA 021110-1307, USA.
	17	*/
	18
3768f368	19	#include "ctree.h"
5eda7b5e	20	#include "transaction.h"
3768f368 CM	21	#include "disk-io.h"
	22	#include "print-tree.h"
	23
bf4ef679	24	/*
d352ac68 CM	25	* search forward for a root, starting with objectid 'search_start'
	26	* if a root key is found, the objectid we find is filled into 'found_objectid'
	27	* and 0 is returned. < 0 is returned on error, 1 if there is nothing
	28	* left in the tree.
bf4ef679 CM	29	*/
	30	int btrfs_search_root(struct btrfs_root *root, u64 search_start,
	31	u64 *found_objectid)
	32	{
	33	struct btrfs_path *path;
	34	struct btrfs_key search_key;
	35	int ret;
	36
	37	root = root->fs_info->tree_root;
	38	search_key.objectid = search_start;
	39	search_key.type = (u8)-1;
	40	search_key.offset = (u64)-1;
	41
	42	path = btrfs_alloc_path();
	43	BUG_ON(!path);
	44	again:
	45	ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
	46	if (ret < 0)
	47	goto out;
	48	if (ret == 0) {
	49	ret = 1;
	50	goto out;
	51	}
	52	if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
	53	ret = btrfs_next_leaf(root, path);
	54	if (ret)
	55	goto out;
	56	}
	57	btrfs_item_key_to_cpu(path->nodes[0], &search_key, path->slots[0]);
	58	if (search_key.type != BTRFS_ROOT_ITEM_KEY) {
	59	search_key.offset++;
	60	btrfs_release_path(root, path);
	61	goto again;
	62	}
	63	ret = 0;
	64	*found_objectid = search_key.objectid;
	65
	66	out:
	67	btrfs_free_path(path);
	68	return ret;
	69	}
	70
d352ac68 CM	71	/*
	72	* lookup the root with the highest offset for a given objectid. The key we do
	73	* find is copied into 'key'. If we find something return 0, otherwise 1, < 0
	74	* on error.
	75	*/
3768f368 CM	76	int btrfs_find_last_root(struct btrfs_root *root, u64 objectid,
	77	struct btrfs_root_item item, struct btrfs_key key)
	78	{
5caf2a00	79	struct btrfs_path *path;
3768f368	80	struct btrfs_key search_key;
5f39d397 CM	81	struct btrfs_key found_key;
5f39d397 CM	82	struct extent_buffer *l;
3768f368 CM	83	int ret;
	84	int slot;
	85
	86	search_key.objectid = objectid;
0660b5af	87	search_key.type = BTRFS_ROOT_ITEM_KEY;
5eda7b5e	88	search_key.offset = (u64)-1;
3768f368	89
5caf2a00 CM	90	path = btrfs_alloc_path();
5caf2a00 CM	91	BUG_ON(!path);
5caf2a00	92	ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
3768f368 CM	93	if (ret < 0)
3768f368 CM	94	goto out;
5f39d397	95
3768f368	96	BUG_ON(ret == 0);
76dda93c YZ	97	if (path->slots[0] == 0) {
	98	ret = 1;
	99	goto out;
	100	}
5f39d397	101	l = path->nodes[0];
5caf2a00	102	slot = path->slots[0] - 1;
5f39d397	103	btrfs_item_key_to_cpu(l, &found_key, slot);
76dda93c YZ	104	if (found_key.objectid != objectid \|\|
76dda93c YZ	105	found_key.type != BTRFS_ROOT_ITEM_KEY) {
3768f368 CM	106	ret = 1;
	107	goto out;
	108	}
76dda93c YZ	109	if (item)
	110	read_extent_buffer(l, item, btrfs_item_ptr_offset(l, slot),
	111	sizeof(*item));
	112	if (key)
	113	memcpy(key, &found_key, sizeof(found_key));
3768f368 CM	114	ret = 0;
3768f368 CM	115	out:
5caf2a00	116	btrfs_free_path(path);
3768f368 CM	117	return ret;
	118	}
	119
5d4f98a2 YZ	120	int btrfs_set_root_node(struct btrfs_root_item *item,
	121	struct extent_buffer *node)
	122	{
	123	btrfs_set_root_bytenr(item, node->start);
	124	btrfs_set_root_level(item, btrfs_header_level(node));
	125	btrfs_set_root_generation(item, btrfs_header_generation(node));
	126	return 0;
	127	}
	128
d352ac68 CM	129	/*
	130	* copy the data in 'item' into the btree
	131	*/
e089f05c CM	132	int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root
	133	root, struct btrfs_key key, struct btrfs_root_item
	134	*item)
3768f368	135	{
5caf2a00	136	struct btrfs_path *path;
5f39d397	137	struct extent_buffer *l;
3768f368 CM	138	int ret;
3768f368 CM	139	int slot;
5f39d397	140	unsigned long ptr;
3768f368	141
5caf2a00 CM	142	path = btrfs_alloc_path();
5caf2a00 CM	143	BUG_ON(!path);
5caf2a00	144	ret = btrfs_search_slot(trans, root, key, path, 0, 1);
3768f368 CM	145	if (ret < 0)
3768f368 CM	146	goto out;
d6667462 CM	147
	148	if (ret != 0) {
	149	btrfs_print_leaf(root, path->nodes[0]);
d397712b CM	150	printk(KERN_CRIT "unable to update root key %llu %u %llu\n",
	151	(unsigned long long)key->objectid, key->type,
	152	(unsigned long long)key->offset);
d6667462 CM	153	BUG_ON(1);
	154	}
	155
5f39d397	156	l = path->nodes[0];
5caf2a00	157	slot = path->slots[0];
5f39d397 CM	158	ptr = btrfs_item_ptr_offset(l, slot);
5f39d397 CM	159	write_extent_buffer(l, item, ptr, sizeof(*item));
5caf2a00	160	btrfs_mark_buffer_dirty(path->nodes[0]);
3768f368	161	out:
5caf2a00	162	btrfs_free_path(path);
3768f368 CM	163	return ret;
	164	}
	165
e089f05c CM	166	int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root
	167	root, struct btrfs_key key, struct btrfs_root_item
	168	*item)
3768f368 CM	169	{
3768f368 CM	170	int ret;
e089f05c	171	ret = btrfs_insert_item(trans, root, key, item, sizeof(*item));
3768f368 CM	172	return ret;
	173	}
	174
d352ac68 CM	175	/*
d352ac68 CM	176	* at mount time we want to find all the old transaction snapshots that were in
d397712b CM	177	* the process of being deleted if we crashed. This is any root item with an
	178	* offset lower than the latest root. They need to be queued for deletion to
	179	* finish what was happening when we crashed.
d352ac68	180	*/
5d4f98a2	181	int btrfs_find_dead_roots(struct btrfs_root *root, u64 objectid)
5eda7b5e CM	182	{
5eda7b5e CM	183	struct btrfs_root *dead_root;
5eda7b5e CM	184	struct btrfs_root_item *ri;
5eda7b5e CM	185	struct btrfs_key key;
a7a16fd7	186	struct btrfs_key found_key;
5eda7b5e CM	187	struct btrfs_path *path;
	188	int ret;
	189	u32 nritems;
5f39d397	190	struct extent_buffer *leaf;
5eda7b5e CM	191	int slot;
5eda7b5e CM	192
5ce14bbc	193	key.objectid = objectid;
5eda7b5e CM	194	btrfs_set_key_type(&key, BTRFS_ROOT_ITEM_KEY);
	195	key.offset = 0;
	196	path = btrfs_alloc_path();
	197	if (!path)
	198	return -ENOMEM;
a7a16fd7 CM	199
a7a16fd7 CM	200	again:
5eda7b5e CM	201	ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
	202	if (ret < 0)
	203	goto err;
d397712b	204	while (1) {
5f39d397 CM	205	leaf = path->nodes[0];
5f39d397 CM	206	nritems = btrfs_header_nritems(leaf);
5eda7b5e CM	207	slot = path->slots[0];
	208	if (slot >= nritems) {
	209	ret = btrfs_next_leaf(root, path);
	210	if (ret)
	211	break;
5f39d397 CM	212	leaf = path->nodes[0];
5f39d397 CM	213	nritems = btrfs_header_nritems(leaf);
5eda7b5e CM	214	slot = path->slots[0];
5eda7b5e CM	215	}
5f39d397	216	btrfs_item_key_to_cpu(leaf, &key, slot);
5eda7b5e CM	217	if (btrfs_key_type(&key) != BTRFS_ROOT_ITEM_KEY)
5eda7b5e CM	218	goto next;
5ce14bbc CM	219
	220	if (key.objectid < objectid)
	221	goto next;
	222
	223	if (key.objectid > objectid)
	224	break;
	225
5eda7b5e	226	ri = btrfs_item_ptr(leaf, slot, struct btrfs_root_item);
5f39d397	227	if (btrfs_disk_root_refs(leaf, ri) != 0)
5eda7b5e	228	goto next;
5ce14bbc	229
a7a16fd7 CM	230	memcpy(&found_key, &key, sizeof(key));
	231	key.offset++;
	232	btrfs_release_path(root, path);
e02119d5 CM	233	dead_root =
	234	btrfs_read_fs_root_no_radix(root->fs_info->tree_root,
	235	&found_key);
a1f39630 A	236	if (IS_ERR(dead_root)) {
a1f39630 A	237	ret = PTR_ERR(dead_root);
5eda7b5e CM	238	goto err;
5eda7b5e CM	239	}
5ce14bbc	240
5d4f98a2	241	ret = btrfs_add_dead_root(dead_root);
5eda7b5e CM	242	if (ret)
5eda7b5e CM	243	goto err;
a7a16fd7	244	goto again;
5eda7b5e CM	245	next:
	246	slot++;
	247	path->slots[0]++;
	248	}
	249	ret = 0;
	250	err:
	251	btrfs_free_path(path);
	252	return ret;
	253	}
	254
76dda93c YZ	255	int btrfs_find_orphan_roots(struct btrfs_root *tree_root)
	256	{
	257	struct extent_buffer *leaf;
	258	struct btrfs_path *path;
	259	struct btrfs_key key;
d68fc57b YZ	260	struct btrfs_key root_key;
d68fc57b YZ	261	struct btrfs_root *root;
76dda93c YZ	262	int err = 0;
	263	int ret;
	264
	265	path = btrfs_alloc_path();
	266	if (!path)
	267	return -ENOMEM;
	268
	269	key.objectid = BTRFS_ORPHAN_OBJECTID;
	270	key.type = BTRFS_ORPHAN_ITEM_KEY;
	271	key.offset = 0;
	272
d68fc57b YZ	273	root_key.type = BTRFS_ROOT_ITEM_KEY;
	274	root_key.offset = (u64)-1;
	275
76dda93c YZ	276	while (1) {
	277	ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
	278	if (ret < 0) {
	279	err = ret;
	280	break;
	281	}
	282
	283	leaf = path->nodes[0];
	284	if (path->slots[0] >= btrfs_header_nritems(leaf)) {
	285	ret = btrfs_next_leaf(tree_root, path);
	286	if (ret < 0)
	287	err = ret;
	288	if (ret != 0)
	289	break;
	290	leaf = path->nodes[0];
	291	}
	292
	293	btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
	294	btrfs_release_path(tree_root, path);
	295
	296	if (key.objectid != BTRFS_ORPHAN_OBJECTID \|\|
	297	key.type != BTRFS_ORPHAN_ITEM_KEY)
	298	break;
	299
d68fc57b YZ	300	root_key.objectid = key.offset;
	301	key.offset++;
	302
	303	root = btrfs_read_fs_root_no_name(tree_root->fs_info,
	304	&root_key);
	305	if (!IS_ERR(root))
	306	continue;
	307
	308	ret = PTR_ERR(root);
	309	if (ret != -ENOENT) {
76dda93c YZ	310	err = ret;
	311	break;
	312	}
	313
d68fc57b YZ	314	ret = btrfs_find_dead_roots(tree_root, root_key.objectid);
	315	if (ret) {
	316	err = ret;
	317	break;
	318	}
76dda93c YZ	319	}
	320
	321	btrfs_free_path(path);
	322	return err;
	323	}
	324
d352ac68	325	/* drop the root item for 'key' from 'root' */
e089f05c CM	326	int btrfs_del_root(struct btrfs_trans_handle trans, struct btrfs_root root,
e089f05c CM	327	struct btrfs_key *key)
3768f368	328	{
5caf2a00	329	struct btrfs_path *path;
3768f368	330	int ret;
c5739bba	331	struct btrfs_root_item *ri;
5f39d397	332	struct extent_buffer *leaf;
3768f368	333
5caf2a00 CM	334	path = btrfs_alloc_path();
5caf2a00 CM	335	BUG_ON(!path);
5caf2a00	336	ret = btrfs_search_slot(trans, root, key, path, -1, 1);
3768f368 CM	337	if (ret < 0)
3768f368 CM	338	goto out;
edbd8d4e	339
3768f368	340	BUG_ON(ret != 0);
5f39d397 CM	341	leaf = path->nodes[0];
5f39d397 CM	342	ri = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_item);
c5739bba	343
5eda7b5e	344	ret = btrfs_del_item(trans, root, path);
3768f368	345	out:
5caf2a00	346	btrfs_free_path(path);
3768f368 CM	347	return ret;
3768f368 CM	348	}
0660b5af CM	349
	350	int btrfs_del_root_ref(struct btrfs_trans_handle *trans,
	351	struct btrfs_root *tree_root,
4df27c4d YZ	352	u64 root_id, u64 ref_id, u64 dirid, u64 *sequence,
	353	const char *name, int name_len)
	354
0660b5af	355	{
4df27c4d YZ	356	struct btrfs_path *path;
	357	struct btrfs_root_ref *ref;
	358	struct extent_buffer *leaf;
0660b5af	359	struct btrfs_key key;
4df27c4d YZ	360	unsigned long ptr;
4df27c4d YZ	361	int err = 0;
0660b5af	362	int ret;
0660b5af CM	363
0660b5af CM	364	path = btrfs_alloc_path();
4df27c4d YZ	365	if (!path)
4df27c4d YZ	366	return -ENOMEM;
0660b5af CM	367
0660b5af CM	368	key.objectid = root_id;
4df27c4d	369	key.type = BTRFS_ROOT_BACKREF_KEY;
0660b5af	370	key.offset = ref_id;
4df27c4d	371	again:
0660b5af	372	ret = btrfs_search_slot(trans, tree_root, &key, path, -1, 1);
4df27c4d YZ	373	BUG_ON(ret < 0);
	374	if (ret == 0) {
	375	leaf = path->nodes[0];
	376	ref = btrfs_item_ptr(leaf, path->slots[0],
	377	struct btrfs_root_ref);
	378
	379	WARN_ON(btrfs_root_ref_dirid(leaf, ref) != dirid);
	380	WARN_ON(btrfs_root_ref_name_len(leaf, ref) != name_len);
	381	ptr = (unsigned long)(ref + 1);
	382	WARN_ON(memcmp_extent_buffer(leaf, name, ptr, name_len));
	383	*sequence = btrfs_root_ref_sequence(leaf, ref);
	384
	385	ret = btrfs_del_item(trans, tree_root, path);
	386	BUG_ON(ret);
	387	} else
	388	err = -ENOENT;
	389
	390	if (key.type == BTRFS_ROOT_BACKREF_KEY) {
	391	btrfs_release_path(tree_root, path);
	392	key.objectid = ref_id;
	393	key.type = BTRFS_ROOT_REF_KEY;
	394	key.offset = root_id;
	395	goto again;
	396	}
0660b5af CM	397
0660b5af CM	398	btrfs_free_path(path);
4df27c4d	399	return err;
0660b5af CM	400	}
0660b5af CM	401
ea9e8b11 CM	402	int btrfs_find_root_ref(struct btrfs_root *tree_root,
	403	struct btrfs_path *path,
	404	u64 root_id, u64 ref_id)
	405	{
	406	struct btrfs_key key;
	407	int ret;
	408
	409	key.objectid = root_id;
	410	key.type = BTRFS_ROOT_REF_KEY;
	411	key.offset = ref_id;
	412
	413	ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
	414	return ret;
	415	}
	416
0660b5af CM	417	/*
	418	* add a btrfs_root_ref item. type is either BTRFS_ROOT_REF_KEY
	419	* or BTRFS_ROOT_BACKREF_KEY.
	420	*
	421	* The dirid, sequence, name and name_len refer to the directory entry
	422	* that is referencing the root.
	423	*
	424	* For a forward ref, the root_id is the id of the tree referencing
	425	* the root and ref_id is the id of the subvol or snapshot.
	426	*
	427	* For a back ref the root_id is the id of the subvol or snapshot and
	428	* ref_id is the id of the tree referencing it.
	429	*/
	430	int btrfs_add_root_ref(struct btrfs_trans_handle *trans,
	431	struct btrfs_root *tree_root,
4df27c4d	432	u64 root_id, u64 ref_id, u64 dirid, u64 sequence,
0660b5af CM	433	const char *name, int name_len)
	434	{
	435	struct btrfs_key key;
	436	int ret;
	437	struct btrfs_path *path;
	438	struct btrfs_root_ref *ref;
	439	struct extent_buffer *leaf;
	440	unsigned long ptr;
	441
0660b5af	442	path = btrfs_alloc_path();
4df27c4d YZ	443	if (!path)
4df27c4d YZ	444	return -ENOMEM;
0660b5af CM	445
0660b5af CM	446	key.objectid = root_id;
4df27c4d	447	key.type = BTRFS_ROOT_BACKREF_KEY;
0660b5af	448	key.offset = ref_id;
4df27c4d	449	again:
0660b5af CM	450	ret = btrfs_insert_empty_item(trans, tree_root, path, &key,
	451	sizeof(*ref) + name_len);
	452	BUG_ON(ret);
	453
	454	leaf = path->nodes[0];
	455	ref = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_root_ref);
	456	btrfs_set_root_ref_dirid(leaf, ref, dirid);
	457	btrfs_set_root_ref_sequence(leaf, ref, sequence);
	458	btrfs_set_root_ref_name_len(leaf, ref, name_len);
	459	ptr = (unsigned long)(ref + 1);
	460	write_extent_buffer(leaf, name, ptr, name_len);
	461	btrfs_mark_buffer_dirty(leaf);
	462
4df27c4d YZ	463	if (key.type == BTRFS_ROOT_BACKREF_KEY) {
	464	btrfs_release_path(tree_root, path);
	465	key.objectid = ref_id;
	466	key.type = BTRFS_ROOT_REF_KEY;
	467	key.offset = root_id;
	468	goto again;
	469	}
	470
0660b5af	471	btrfs_free_path(path);
4df27c4d	472	return 0;
0660b5af	473	}