[deliverable/linux.git] / fs / btrfs / file-item.c

#include <linux/module.h>
#include "ctree.h"
#include "disk-io.h"
#include "transaction.h"

#define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
				 sizeof(struct btrfs_item)) / \
				sizeof(struct btrfs_csum_item)) - 1))
int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
			       struct btrfs_root *root,
			       u64 objectid, u64 pos,
			       u64 offset, u64 num_blocks)
{
	int ret = 0;
	struct btrfs_file_extent_item *item;
	struct btrfs_key file_key;
	struct btrfs_path *path;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);
	/*
	ret = btrfs_alloc_extent(trans, root, num_blocks, hint_block,
				 (u64)-1, &ins);
				 */
	BUG_ON(ret);
	file_key.objectid = objectid;
	file_key.offset = pos;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);

	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
				      sizeof(*item));
	BUG_ON(ret);
	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
			      struct btrfs_file_extent_item);
	btrfs_set_file_extent_disk_blocknr(item, offset);
	btrfs_set_file_extent_disk_num_blocks(item, num_blocks);
	btrfs_set_file_extent_offset(item, 0);
	btrfs_set_file_extent_num_blocks(item, num_blocks);
	btrfs_set_file_extent_generation(item, trans->transid);
	btrfs_mark_buffer_dirty(path->nodes[0]);
	btrfs_release_path(root, path);
	btrfs_free_path(path);
	return 0;
}

struct btrfs_csum_item *btrfs_lookup_csum(struct btrfs_trans_handle *trans,
					  struct btrfs_root *root,
					  struct btrfs_path *path,
					  u64 objectid, u64 offset,
					  int cow)
{
	int ret;
	struct btrfs_key file_key;
	struct btrfs_key found_key;
	struct btrfs_csum_item *item;
	struct btrfs_leaf *leaf;
	u64 csum_offset = 0;

	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
	ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
	if (ret < 0)
		goto fail;
	leaf = btrfs_buffer_leaf(path->nodes[0]);
	if (ret > 0) {
		ret = 1;
		if (path->slots[0] == 0)
			goto fail;
		path->slots[0]--;
		btrfs_disk_key_to_cpu(&found_key,
				      &leaf->items[path->slots[0]].key);
		if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
		    found_key.objectid != objectid) {
			goto fail;
		}
		csum_offset = (offset - found_key.offset) >>
				root->fs_info->sb->s_blocksize_bits;
		if (csum_offset >=
		    btrfs_item_size(leaf->items + path->slots[0]) /
		    sizeof(struct btrfs_csum_item)) {
			goto fail;
		}
	}
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	item += csum_offset;
	return item;
fail:
	if (ret > 0)
		ret = -ENOENT;
	return ERR_PTR(ret);
}


int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
			     struct btrfs_root *root,
			     struct btrfs_path *path, u64 objectid,
			     u64 offset, int mod)
{
	int ret;
	struct btrfs_key file_key;
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;

	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
	return ret;
}

int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
			  struct btrfs_root *root,
			  u64 objectid, u64 offset,
			  char *data, size_t len)
{
	int ret;
	struct btrfs_key file_key;
	struct btrfs_key found_key;
	struct btrfs_path *path;
	struct btrfs_csum_item *item;
	struct btrfs_leaf *leaf;
	u64 csum_offset;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);

	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 0);
	if (!IS_ERR(item))
		goto found;
	btrfs_release_path(root, path);
	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
	ret = btrfs_search_slot(trans, root, &file_key, path,
				sizeof(struct btrfs_csum_item), 1);
	if (ret < 0)
		goto fail;
	if (ret == 0) {
		BUG();
	}
	if (path->slots[0] == 0) {
		btrfs_release_path(root, path);
		goto insert;
	}
	path->slots[0]--;
	leaf = btrfs_buffer_leaf(path->nodes[0]);
	btrfs_disk_key_to_cpu(&found_key, &leaf->items[path->slots[0]].key);
	csum_offset = (offset - found_key.offset) >>
			root->fs_info->sb->s_blocksize_bits;
	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY ||
	    found_key.objectid != objectid ||
	    csum_offset >= MAX_CSUM_ITEMS(root)) {
		btrfs_release_path(root, path);
		goto insert;
	}
	if (csum_offset >= btrfs_item_size(leaf->items + path->slots[0]) /
	    sizeof(struct btrfs_csum_item)) {
		ret = btrfs_extend_item(trans, root, path,
					sizeof(struct btrfs_csum_item));
		BUG_ON(ret);
		goto csum;
	}

insert:
	csum_offset = 0;
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
				      sizeof(struct btrfs_csum_item));
	if (ret != 0 && ret != -EEXIST)
		goto fail;
csum:
	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
			      struct btrfs_csum_item);
	ret = 0;
	item += csum_offset;
found:
	ret = btrfs_csum_data(root, data, len, item->csum);
	btrfs_mark_buffer_dirty(path->nodes[0]);
fail:
	btrfs_release_path(root, path);
	btrfs_free_path(path);
	return ret;
}

int btrfs_csum_verify_file_block(struct btrfs_root *root,
				 u64 objectid, u64 offset,
				 char *data, size_t len)
{
	int ret;
	struct btrfs_key file_key;
	struct btrfs_path *path;
	struct btrfs_csum_item *item;
	char result[BTRFS_CSUM_SIZE];

	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);
	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
	mutex_lock(&root->fs_info->fs_mutex);

	item = btrfs_lookup_csum(NULL, root, path, objectid, offset, 0);
	if (IS_ERR(item)) {
		ret = PTR_ERR(item);
		goto fail;
	}

	ret = btrfs_csum_data(root, data, len, result);
	WARN_ON(ret);
	if (memcmp(result, item->csum, BTRFS_CSUM_SIZE))
		ret = 1;
fail:
	btrfs_release_path(root, path);
	btrfs_free_path(path);
	mutex_unlock(&root->fs_info->fs_mutex);
	return ret;
}
Commit	Line	Data
2e635a27	1	#include <linux/module.h>
1e1d2701	2	#include "ctree.h"
dee26a9f	3	#include "disk-io.h"
9f5fae2f	4	#include "transaction.h"
1e1d2701	5
6567e837 CM	6	#define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
	7	sizeof(struct btrfs_item)) / \
	8	sizeof(struct btrfs_csum_item)) - 1))
b18c6685	9	int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
dee26a9f	10	struct btrfs_root *root,
b18c6685 CM	11	u64 objectid, u64 pos,
b18c6685 CM	12	u64 offset, u64 num_blocks)
9f5fae2f	13	{
dee26a9f CM	14	int ret = 0;
	15	struct btrfs_file_extent_item *item;
	16	struct btrfs_key file_key;
5caf2a00	17	struct btrfs_path *path;
dee26a9f	18
5caf2a00 CM	19	path = btrfs_alloc_path();
	20	BUG_ON(!path);
	21	btrfs_init_path(path);
b18c6685	22	/*
dee26a9f	23	ret = btrfs_alloc_extent(trans, root, num_blocks, hint_block,
d0dbc624	24	(u64)-1, &ins);
b18c6685	25	*/
dee26a9f CM	26	BUG_ON(ret);
dee26a9f CM	27	file_key.objectid = objectid;
b18c6685	28	file_key.offset = pos;
dee26a9f CM	29	file_key.flags = 0;
	30	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	31
5caf2a00	32	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
dee26a9f	33	sizeof(*item));
9773a788	34	BUG_ON(ret);
5caf2a00	35	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
dee26a9f	36	struct btrfs_file_extent_item);
b18c6685 CM	37	btrfs_set_file_extent_disk_blocknr(item, offset);
b18c6685 CM	38	btrfs_set_file_extent_disk_num_blocks(item, num_blocks);
dee26a9f	39	btrfs_set_file_extent_offset(item, 0);
b18c6685	40	btrfs_set_file_extent_num_blocks(item, num_blocks);
71951f35	41	btrfs_set_file_extent_generation(item, trans->transid);
5caf2a00	42	btrfs_mark_buffer_dirty(path->nodes[0]);
5caf2a00 CM	43	btrfs_release_path(root, path);
5caf2a00 CM	44	btrfs_free_path(path);
9f5fae2f CM	45	return 0;
9f5fae2f CM	46	}
dee26a9f	47
b18c6685 CM	48	struct btrfs_csum_item btrfs_lookup_csum(struct btrfs_trans_handle trans,
	49	struct btrfs_root *root,
	50	struct btrfs_path *path,
	51	u64 objectid, u64 offset,
	52	int cow)
6567e837 CM	53	{
	54	int ret;
	55	struct btrfs_key file_key;
	56	struct btrfs_key found_key;
	57	struct btrfs_csum_item *item;
	58	struct btrfs_leaf *leaf;
	59	u64 csum_offset = 0;
	60
	61	file_key.objectid = objectid;
	62	file_key.offset = offset;
	63	file_key.flags = 0;
	64	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
b18c6685	65	ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
6567e837 CM	66	if (ret < 0)
	67	goto fail;
	68	leaf = btrfs_buffer_leaf(path->nodes[0]);
	69	if (ret > 0) {
	70	ret = 1;
70b2befd	71	if (path->slots[0] == 0)
6567e837 CM	72	goto fail;
	73	path->slots[0]--;
	74	btrfs_disk_key_to_cpu(&found_key,
	75	&leaf->items[path->slots[0]].key);
	76	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY \|\|
	77	found_key.objectid != objectid) {
	78	goto fail;
	79	}
	80	csum_offset = (offset - found_key.offset) >>
	81	root->fs_info->sb->s_blocksize_bits;
	82	if (csum_offset >=
	83	btrfs_item_size(leaf->items + path->slots[0]) /
	84	sizeof(struct btrfs_csum_item)) {
	85	goto fail;
	86	}
	87	}
	88	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	89	item += csum_offset;
	90	return item;
	91	fail:
	92	if (ret > 0)
b18c6685	93	ret = -ENOENT;
6567e837 CM	94	return ERR_PTR(ret);
	95	}
	96
	97
dee26a9f CM	98	int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
	99	struct btrfs_root *root,
	100	struct btrfs_path *path, u64 objectid,
9773a788	101	u64 offset, int mod)
dee26a9f CM	102	{
	103	int ret;
	104	struct btrfs_key file_key;
	105	int ins_len = mod < 0 ? -1 : 0;
	106	int cow = mod != 0;
	107
	108	file_key.objectid = objectid;
70b2befd	109	file_key.offset = offset;
dee26a9f CM	110	file_key.flags = 0;
	111	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	112	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
	113	return ret;
	114	}
f254e52c CM	115
	116	int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
	117	struct btrfs_root *root,
	118	u64 objectid, u64 offset,
	119	char *data, size_t len)
	120	{
	121	int ret;
	122	struct btrfs_key file_key;
6567e837	123	struct btrfs_key found_key;
5caf2a00	124	struct btrfs_path *path;
f254e52c	125	struct btrfs_csum_item *item;
6567e837 CM	126	struct btrfs_leaf *leaf;
6567e837 CM	127	u64 csum_offset;
f254e52c	128
5caf2a00 CM	129	path = btrfs_alloc_path();
	130	BUG_ON(!path);
	131	btrfs_init_path(path);
b18c6685 CM	132
	133	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 0);
	134	if (!IS_ERR(item))
	135	goto found;
	136	btrfs_release_path(root, path);
f254e52c CM	137	file_key.objectid = objectid;
	138	file_key.offset = offset;
	139	file_key.flags = 0;
	140	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
6567e837 CM	141	ret = btrfs_search_slot(trans, root, &file_key, path,
	142	sizeof(struct btrfs_csum_item), 1);
	143	if (ret < 0)
	144	goto fail;
	145	if (ret == 0) {
b18c6685	146	BUG();
6567e837 CM	147	}
	148	if (path->slots[0] == 0) {
	149	btrfs_release_path(root, path);
	150	goto insert;
	151	}
	152	path->slots[0]--;
	153	leaf = btrfs_buffer_leaf(path->nodes[0]);
	154	btrfs_disk_key_to_cpu(&found_key, &leaf->items[path->slots[0]].key);
	155	csum_offset = (offset - found_key.offset) >>
	156	root->fs_info->sb->s_blocksize_bits;
	157	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY \|\|
	158	found_key.objectid != objectid \|\|
	159	csum_offset >= MAX_CSUM_ITEMS(root)) {
	160	btrfs_release_path(root, path);
	161	goto insert;
	162	}
	163	if (csum_offset >= btrfs_item_size(leaf->items + path->slots[0]) /
	164	sizeof(struct btrfs_csum_item)) {
	165	ret = btrfs_extend_item(trans, root, path,
	166	sizeof(struct btrfs_csum_item));
	167	BUG_ON(ret);
	168	goto csum;
	169	}
	170
	171	insert:
	172	csum_offset = 0;
5caf2a00	173	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
6567e837	174	sizeof(struct btrfs_csum_item));
f254e52c CM	175	if (ret != 0 && ret != -EEXIST)
f254e52c CM	176	goto fail;
6567e837	177	csum:
5caf2a00	178	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
f254e52c CM	179	struct btrfs_csum_item);
f254e52c CM	180	ret = 0;
6567e837	181	item += csum_offset;
b18c6685	182	found:
f254e52c	183	ret = btrfs_csum_data(root, data, len, item->csum);
5caf2a00	184	btrfs_mark_buffer_dirty(path->nodes[0]);
f254e52c	185	fail:
5caf2a00 CM	186	btrfs_release_path(root, path);
5caf2a00 CM	187	btrfs_free_path(path);
f254e52c CM	188	return ret;
	189	}
	190
	191	int btrfs_csum_verify_file_block(struct btrfs_root *root,
	192	u64 objectid, u64 offset,
	193	char *data, size_t len)
	194	{
	195	int ret;
	196	struct btrfs_key file_key;
5caf2a00	197	struct btrfs_path *path;
f254e52c CM	198	struct btrfs_csum_item *item;
	199	char result[BTRFS_CSUM_SIZE];
	200
5caf2a00 CM	201	path = btrfs_alloc_path();
	202	BUG_ON(!path);
	203	btrfs_init_path(path);
f254e52c CM	204	file_key.objectid = objectid;
	205	file_key.offset = offset;
	206	file_key.flags = 0;
	207	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
2da566ed	208	mutex_lock(&root->fs_info->fs_mutex);
6567e837	209
b18c6685	210	item = btrfs_lookup_csum(NULL, root, path, objectid, offset, 0);
6567e837 CM	211	if (IS_ERR(item)) {
6567e837 CM	212	ret = PTR_ERR(item);
f254e52c	213	goto fail;
6567e837 CM	214	}
6567e837 CM	215
f254e52c CM	216	ret = btrfs_csum_data(root, data, len, result);
	217	WARN_ON(ret);
	218	if (memcmp(result, item->csum, BTRFS_CSUM_SIZE))
	219	ret = 1;
	220	fail:
5caf2a00 CM	221	btrfs_release_path(root, path);
5caf2a00 CM	222	btrfs_free_path(path);
2da566ed	223	mutex_unlock(&root->fs_info->fs_mutex);
f254e52c CM	224	return ret;
	225	}
	226