[deliverable/linux.git] / fs / btrfs / file-item.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 <linux/bio.h>
#include <linux/pagemap.h>
#include <linux/highmem.h>
#include "ctree.h"
#include "disk-io.h"
#include "transaction.h"
#include "print-tree.h"

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

	path = btrfs_alloc_path();
	BUG_ON(!path);
	file_key.objectid = objectid;
	file_key.offset = pos;
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);

	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
				      sizeof(*item));
	if (ret < 0)
		goto out;
	BUG_ON(ret);
	leaf = path->nodes[0];
	item = btrfs_item_ptr(leaf, path->slots[0],
			      struct btrfs_file_extent_item);
	btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
	btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
	btrfs_set_file_extent_offset(leaf, item, offset);
	btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
	btrfs_set_file_extent_generation(leaf, item, trans->transid);
	btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
	btrfs_mark_buffer_dirty(leaf);
out:
	btrfs_free_path(path);
	return ret;
}

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 extent_buffer *leaf;
	u64 csum_offset = 0;
	int csums_in_item;

	file_key.objectid = objectid;
	file_key.offset = offset;
	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 = path->nodes[0];
	if (ret > 0) {
		ret = 1;
		if (path->slots[0] == 0)
			goto fail;
		path->slots[0]--;
		btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
		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;
		csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
		csums_in_item /= BTRFS_CRC32_SIZE;

		if (csum_offset >= csums_in_item) {
			ret = -EFBIG;
			goto fail;
		}
	}
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
	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;
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
	return ret;
}

#if 0 /* broken */
int btrfs_lookup_bio_sums(struct btrfs_root *root, struct inode *inode,
			  struct bio *bio)
{
	u32 sum;
	struct bio_vec *bvec = bio->bi_io_vec;
	int bio_index = 0;
	u64 offset;
	u64 item_start_offset = 0;
	u64 item_last_offset = 0;
	u32 diff;
	int ret;
	struct btrfs_path *path;
	struct btrfs_csum_item *item = NULL;
	struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;

	path = btrfs_alloc_path();

	WARN_ON(bio->bi_vcnt <= 0);

	while(bio_index < bio->bi_vcnt) {
		offset = page_offset(bvec->bv_page) + bvec->bv_offset;
		ret = btrfs_find_ordered_sum(inode, offset, &sum);
		if (ret == 0)
			goto found;

		if (!item || offset < item_start_offset ||
		    offset >= item_last_offset) {
			struct btrfs_key found_key;
			u32 item_size;

			if (item)
				btrfs_release_path(root, path);
			item = btrfs_lookup_csum(NULL, root, path,
						 inode->i_ino, offset, 0);
			if (IS_ERR(item)) {
				ret = PTR_ERR(item);
				if (ret == -ENOENT || ret == -EFBIG)
					ret = 0;
				sum = 0;
				printk("no csum found for inode %lu start "
				       "%llu\n", inode->i_ino,
				       (unsigned long long)offset);
				item = NULL;
				goto found;
			}
			btrfs_item_key_to_cpu(path->nodes[0], &found_key,
					      path->slots[0]);

			item_start_offset = found_key.offset;
			item_size = btrfs_item_size_nr(path->nodes[0],
						       path->slots[0]);
			item_last_offset = item_start_offset +
				(item_size / BTRFS_CRC32_SIZE) *
				root->sectorsize;
			item = btrfs_item_ptr(path->nodes[0], path->slots[0],
					      struct btrfs_csum_item);
		}
		/*
		 * this byte range must be able to fit inside
		 * a single leaf so it will also fit inside a u32
		 */
		diff = offset - item_start_offset;
		diff = diff / root->sectorsize;
		diff = diff * BTRFS_CRC32_SIZE;

		read_extent_buffer(path->nodes[0], &sum,
				   ((unsigned long)item) + diff,
				   BTRFS_CRC32_SIZE);
found:
		set_state_private(io_tree, offset, sum);
		bio_index++;
		bvec++;
	}
	btrfs_free_path(path);
	return 0;
}
#endif

int btrfs_csum_one_bio(struct btrfs_root *root, struct inode *inode,
		       struct bio *bio)
{
	struct btrfs_ordered_sum *sums;
	struct btrfs_sector_sum *sector_sum;
	struct btrfs_ordered_extent *ordered;
	char *data;
	struct bio_vec *bvec = bio->bi_io_vec;
	int bio_index = 0;
	unsigned long total_bytes = 0;
	unsigned long this_sum_bytes = 0;
	u64 offset;

	WARN_ON(bio->bi_vcnt <= 0);
	sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_size), GFP_NOFS);
	if (!sums)
		return -ENOMEM;

	sector_sum = sums->sums;
	sums->file_offset = page_offset(bvec->bv_page) + bvec->bv_offset;
	sums->len = bio->bi_size;
	INIT_LIST_HEAD(&sums->list);
	ordered = btrfs_lookup_ordered_extent(inode, sums->file_offset);
	BUG_ON(!ordered);

	while(bio_index < bio->bi_vcnt) {
		offset = page_offset(bvec->bv_page) + bvec->bv_offset;
		if (offset >= ordered->file_offset + ordered->len ||
		    offset < ordered->file_offset) {
			unsigned long bytes_left;
			sums->len = this_sum_bytes;
			this_sum_bytes = 0;
			btrfs_add_ordered_sum(inode, ordered, sums);
			btrfs_put_ordered_extent(ordered);

			bytes_left = bio->bi_size - total_bytes;

			sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left),
				       GFP_NOFS);
			BUG_ON(!sums);
			sector_sum = sums->sums;
			sums->len = bytes_left;
			sums->file_offset = offset;
			ordered = btrfs_lookup_ordered_extent(inode,
						      sums->file_offset);
			BUG_ON(!ordered);
		}

		data = kmap_atomic(bvec->bv_page, KM_USER0);
		sector_sum->sum = ~(u32)0;
		sector_sum->sum = btrfs_csum_data(root,
						  data + bvec->bv_offset,
						  sector_sum->sum,
						  bvec->bv_len);
		kunmap_atomic(data, KM_USER0);
		btrfs_csum_final(sector_sum->sum,
				 (char *)&sector_sum->sum);
		sector_sum->offset = page_offset(bvec->bv_page) +
			bvec->bv_offset;

		sector_sum++;
		bio_index++;
		total_bytes += bvec->bv_len;
		this_sum_bytes += bvec->bv_len;
		bvec++;
	}
	this_sum_bytes = 0;
	btrfs_add_ordered_sum(inode, ordered, sums);
	btrfs_put_ordered_extent(ordered);
	return 0;
}

int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
			   struct btrfs_root *root, struct inode *inode,
			   struct btrfs_ordered_sum *sums)
{
	u64 objectid = inode->i_ino;
	u64 offset;
	int ret;
	struct btrfs_key file_key;
	struct btrfs_key found_key;
	u64 next_offset;
	u64 total_bytes = 0;
	int found_next;
	struct btrfs_path *path;
	struct btrfs_csum_item *item;
	struct btrfs_csum_item *item_end;
	struct extent_buffer *leaf = NULL;
	u64 csum_offset;
	struct btrfs_sector_sum *sector_sum;
	u32 nritems;
	u32 ins_size;
	char *eb_map;
	char *eb_token;
	unsigned long map_len;
	unsigned long map_start;

	path = btrfs_alloc_path();
	BUG_ON(!path);
	sector_sum = sums->sums;
again:
	next_offset = (u64)-1;
	found_next = 0;
	offset = sector_sum->offset;
	file_key.objectid = objectid;
	file_key.offset = offset;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);

	mutex_lock(&BTRFS_I(inode)->csum_mutex);
	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 1);
	if (!IS_ERR(item)) {
		leaf = path->nodes[0];
		goto found;
	}
	ret = PTR_ERR(item);
	if (ret == -EFBIG) {
		u32 item_size;
		/* we found one, but it isn't big enough yet */
		leaf = path->nodes[0];
		item_size = btrfs_item_size_nr(leaf, path->slots[0]);
		if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
			/* already at max size, make a new one */
			goto insert;
		}
	} else {
		int slot = path->slots[0] + 1;
		/* we didn't find a csum item, insert one */
		nritems = btrfs_header_nritems(path->nodes[0]);
		if (path->slots[0] >= nritems - 1) {
			ret = btrfs_next_leaf(root, path);
			if (ret == 1)
				found_next = 1;
			if (ret != 0)
				goto insert;
			slot = 0;
		}
		btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
		if (found_key.objectid != objectid ||
		    found_key.type != BTRFS_CSUM_ITEM_KEY) {
			found_next = 1;
			goto insert;
		}
		next_offset = found_key.offset;
		found_next = 1;
		goto insert;
	}

	/*
	 * at this point, we know the tree has an item, but it isn't big
	 * enough yet to put our csum in.  Grow it
	 */
	btrfs_release_path(root, path);
	ret = btrfs_search_slot(trans, root, &file_key, path,
				BTRFS_CRC32_SIZE, 1);
	if (ret < 0)
		goto fail_unlock;
	if (ret == 0) {
		BUG();
	}
	if (path->slots[0] == 0) {
		goto insert;
	}
	path->slots[0]--;
	leaf = path->nodes[0];
	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
	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)) {
		goto insert;
	}
	if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
	    BTRFS_CRC32_SIZE) {
		u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
		diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
		if (diff != BTRFS_CRC32_SIZE)
			goto insert;
		ret = btrfs_extend_item(trans, root, path, diff);
		BUG_ON(ret);
		goto csum;
	}

insert:
	btrfs_release_path(root, path);
	csum_offset = 0;
	if (found_next) {
		u64 tmp = min((u64)i_size_read(inode), next_offset);
		tmp -= offset & ~((u64)root->sectorsize -1);
		tmp >>= root->fs_info->sb->s_blocksize_bits;
		tmp = max((u64)1, tmp);
		tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root));
		ins_size = BTRFS_CRC32_SIZE * tmp;
	} else {
		ins_size = BTRFS_CRC32_SIZE;
	}
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
				      ins_size);
	if (ret < 0)
		goto fail_unlock;
	if (ret != 0) {
		WARN_ON(1);
		goto fail_unlock;
	}
csum:
	leaf = path->nodes[0];
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	ret = 0;
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
found:
	item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	item_end = (struct btrfs_csum_item *)((unsigned char *)item_end +
				      btrfs_item_size_nr(leaf, path->slots[0]));
	eb_token = NULL;
	mutex_unlock(&BTRFS_I(inode)->csum_mutex);
	cond_resched();
next_sector:

	if (!eb_token ||
	   (unsigned long)item  + BTRFS_CRC32_SIZE >= map_start + map_len) {
		int err;

		if (eb_token)
			unmap_extent_buffer(leaf, eb_token, KM_USER1);
		eb_token = NULL;
		err = map_private_extent_buffer(leaf, (unsigned long)item,
						BTRFS_CRC32_SIZE,
						&eb_token, &eb_map,
						&map_start, &map_len, KM_USER1);
		if (err)
			eb_token = NULL;
	}
	if (eb_token) {
		memcpy(eb_token + ((unsigned long)item & (PAGE_CACHE_SIZE - 1)),
		       &sector_sum->sum, BTRFS_CRC32_SIZE);
	} else {
		write_extent_buffer(leaf, &sector_sum->sum,
				    (unsigned long)item, BTRFS_CRC32_SIZE);
	}

	total_bytes += root->sectorsize;
	sector_sum++;
	if (total_bytes < sums->len) {
		item = (struct btrfs_csum_item *)((char *)item +
						  BTRFS_CRC32_SIZE);
		if (item < item_end && offset + PAGE_CACHE_SIZE ==
		    sector_sum->offset) {
			    offset = sector_sum->offset;
			goto next_sector;
		}
	}
	if (eb_token) {
		unmap_extent_buffer(leaf, eb_token, KM_USER1);
		eb_token = NULL;
	}
	btrfs_mark_buffer_dirty(path->nodes[0]);
	cond_resched();
	if (total_bytes < sums->len) {
		btrfs_release_path(root, path);
		goto again;
	}
out:
	btrfs_free_path(path);
	return ret;

fail_unlock:
	mutex_unlock(&BTRFS_I(inode)->csum_mutex);
	goto out;
}

int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
			struct btrfs_root *root, struct btrfs_path *path,
			u64 isize)
{
	struct btrfs_key key;
	struct extent_buffer *leaf = path->nodes[0];
	int slot = path->slots[0];
	int ret;
	u32 new_item_size;
	u64 new_item_span;
	u64 blocks;

	btrfs_item_key_to_cpu(leaf, &key, slot);
	if (isize <= key.offset)
		return 0;
	new_item_span = isize - key.offset;
	blocks = (new_item_span + root->sectorsize - 1) >>
		root->fs_info->sb->s_blocksize_bits;
	new_item_size = blocks * BTRFS_CRC32_SIZE;
	if (new_item_size >= btrfs_item_size_nr(leaf, slot))
		return 0;
	ret = btrfs_truncate_item(trans, root, path, new_item_size, 1);
	BUG_ON(ret);
	return ret;
}
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
065631f6 CM	19	#include <linux/bio.h>
	20	#include <linux/pagemap.h>
	21	#include <linux/highmem.h>
1e1d2701	22	#include "ctree.h"
dee26a9f	23	#include "disk-io.h"
9f5fae2f	24	#include "transaction.h"
1de037a4	25	#include "print-tree.h"
1e1d2701	26
6567e837	27	#define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
509659cd CM	28	sizeof(struct btrfs_item) * 2) / \
509659cd CM	29	BTRFS_CRC32_SIZE) - 1))
b18c6685	30	int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
f2eb0a24 SW	31	struct btrfs_root *root,
	32	u64 objectid, u64 pos,
	33	u64 disk_offset, u64 disk_num_bytes,
	34	u64 num_bytes, u64 offset)
9f5fae2f	35	{
dee26a9f CM	36	int ret = 0;
	37	struct btrfs_file_extent_item *item;
	38	struct btrfs_key file_key;
5caf2a00	39	struct btrfs_path *path;
5f39d397	40	struct extent_buffer *leaf;
dee26a9f	41
5caf2a00 CM	42	path = btrfs_alloc_path();
5caf2a00 CM	43	BUG_ON(!path);
dee26a9f	44	file_key.objectid = objectid;
b18c6685	45	file_key.offset = pos;
dee26a9f CM	46	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
dee26a9f CM	47
5caf2a00	48	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
dee26a9f	49	sizeof(*item));
54aa1f4d CM	50	if (ret < 0)
54aa1f4d CM	51	goto out;
9773a788	52	BUG_ON(ret);
5f39d397 CM	53	leaf = path->nodes[0];
5f39d397 CM	54	item = btrfs_item_ptr(leaf, path->slots[0],
dee26a9f	55	struct btrfs_file_extent_item);
f2eb0a24	56	btrfs_set_file_extent_disk_bytenr(leaf, item, disk_offset);
db94535d	57	btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
f2eb0a24	58	btrfs_set_file_extent_offset(leaf, item, offset);
db94535d	59	btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
5f39d397 CM	60	btrfs_set_file_extent_generation(leaf, item, trans->transid);
	61	btrfs_set_file_extent_type(leaf, item, BTRFS_FILE_EXTENT_REG);
	62	btrfs_mark_buffer_dirty(leaf);
54aa1f4d	63	out:
5caf2a00	64	btrfs_free_path(path);
54aa1f4d	65	return ret;
9f5fae2f	66	}
dee26a9f	67
b18c6685 CM	68	struct btrfs_csum_item btrfs_lookup_csum(struct btrfs_trans_handle trans,
	69	struct btrfs_root *root,
	70	struct btrfs_path *path,
	71	u64 objectid, u64 offset,
	72	int cow)
6567e837 CM	73	{
	74	int ret;
	75	struct btrfs_key file_key;
	76	struct btrfs_key found_key;
	77	struct btrfs_csum_item *item;
5f39d397	78	struct extent_buffer *leaf;
6567e837	79	u64 csum_offset = 0;
a429e513	80	int csums_in_item;
6567e837 CM	81
	82	file_key.objectid = objectid;
	83	file_key.offset = offset;
6567e837	84	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
b18c6685	85	ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
6567e837 CM	86	if (ret < 0)
6567e837 CM	87	goto fail;
5f39d397	88	leaf = path->nodes[0];
6567e837 CM	89	if (ret > 0) {
6567e837 CM	90	ret = 1;
70b2befd	91	if (path->slots[0] == 0)
6567e837 CM	92	goto fail;
6567e837 CM	93	path->slots[0]--;
5f39d397	94	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6567e837 CM	95	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY \|\|
	96	found_key.objectid != objectid) {
	97	goto fail;
	98	}
	99	csum_offset = (offset - found_key.offset) >>
	100	root->fs_info->sb->s_blocksize_bits;
5f39d397	101	csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
509659cd	102	csums_in_item /= BTRFS_CRC32_SIZE;
a429e513 CM	103
	104	if (csum_offset >= csums_in_item) {
	105	ret = -EFBIG;
6567e837 CM	106	goto fail;
	107	}
	108	}
	109	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
509659cd CM	110	item = (struct btrfs_csum_item )((unsigned char )item +
509659cd CM	111	csum_offset * BTRFS_CRC32_SIZE);
6567e837 CM	112	return item;
	113	fail:
	114	if (ret > 0)
b18c6685	115	ret = -ENOENT;
6567e837 CM	116	return ERR_PTR(ret);
	117	}
	118
	119
dee26a9f CM	120	int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
	121	struct btrfs_root *root,
	122	struct btrfs_path *path, u64 objectid,
9773a788	123	u64 offset, int mod)
dee26a9f CM	124	{
	125	int ret;
	126	struct btrfs_key file_key;
	127	int ins_len = mod < 0 ? -1 : 0;
	128	int cow = mod != 0;
	129
	130	file_key.objectid = objectid;
70b2befd	131	file_key.offset = offset;
dee26a9f CM	132	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	133	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
	134	return ret;
	135	}
f254e52c	136
3de9d6b6	137	#if 0 /* broken */
61b49440 CM	138	int btrfs_lookup_bio_sums(struct btrfs_root root, struct inode inode,
	139	struct bio *bio)
	140	{
	141	u32 sum;
	142	struct bio_vec *bvec = bio->bi_io_vec;
	143	int bio_index = 0;
	144	u64 offset;
	145	u64 item_start_offset = 0;
	146	u64 item_last_offset = 0;
	147	u32 diff;
	148	int ret;
	149	struct btrfs_path *path;
	150	struct btrfs_csum_item *item = NULL;
	151	struct extent_io_tree *io_tree = &BTRFS_I(inode)->io_tree;
	152
	153	path = btrfs_alloc_path();
61b49440 CM	154
	155	WARN_ON(bio->bi_vcnt <= 0);
	156
	157	while(bio_index < bio->bi_vcnt) {
	158	offset = page_offset(bvec->bv_page) + bvec->bv_offset;
	159	ret = btrfs_find_ordered_sum(inode, offset, &sum);
	160	if (ret == 0)
	161	goto found;
	162
	163	if (!item \|\| offset < item_start_offset \|\|
	164	offset >= item_last_offset) {
	165	struct btrfs_key found_key;
	166	u32 item_size;
	167
	168	if (item)
	169	btrfs_release_path(root, path);
	170	item = btrfs_lookup_csum(NULL, root, path,
	171	inode->i_ino, offset, 0);
	172	if (IS_ERR(item)) {
	173	ret = PTR_ERR(item);
	174	if (ret == -ENOENT \|\| ret == -EFBIG)
	175	ret = 0;
	176	sum = 0;
	177	printk("no csum found for inode %lu start "
	178	"%llu\n", inode->i_ino,
	179	(unsigned long long)offset);
6dab8157	180	item = NULL;
61b49440 CM	181	goto found;
	182	}
	183	btrfs_item_key_to_cpu(path->nodes[0], &found_key,
	184	path->slots[0]);
	185
	186	item_start_offset = found_key.offset;
	187	item_size = btrfs_item_size_nr(path->nodes[0],
	188	path->slots[0]);
	189	item_last_offset = item_start_offset +
	190	(item_size / BTRFS_CRC32_SIZE) *
	191	root->sectorsize;
	192	item = btrfs_item_ptr(path->nodes[0], path->slots[0],
	193	struct btrfs_csum_item);
	194	}
	195	/*
	196	* this byte range must be able to fit inside
	197	* a single leaf so it will also fit inside a u32
	198	*/
	199	diff = offset - item_start_offset;
	200	diff = diff / root->sectorsize;
	201	diff = diff * BTRFS_CRC32_SIZE;
	202
	203	read_extent_buffer(path->nodes[0], &sum,
3de9d6b6	204	((unsigned long)item) + diff,
61b49440 CM	205	BTRFS_CRC32_SIZE);
	206	found:
	207	set_state_private(io_tree, offset, sum);
	208	bio_index++;
	209	bvec++;
	210	}
	211	btrfs_free_path(path);
	212	return 0;
	213	}
3de9d6b6	214	#endif
61b49440	215
3edf7d33 CM	216	int btrfs_csum_one_bio(struct btrfs_root root, struct inode inode,
3edf7d33 CM	217	struct bio *bio)
e015640f	218	{
e6dcd2dc CM	219	struct btrfs_ordered_sum *sums;
e6dcd2dc CM	220	struct btrfs_sector_sum *sector_sum;
3edf7d33	221	struct btrfs_ordered_extent *ordered;
e015640f CM	222	char *data;
	223	struct bio_vec *bvec = bio->bi_io_vec;
	224	int bio_index = 0;
3edf7d33 CM	225	unsigned long total_bytes = 0;
	226	unsigned long this_sum_bytes = 0;
	227	u64 offset;
e015640f	228
e6dcd2dc CM	229	WARN_ON(bio->bi_vcnt <= 0);
e6dcd2dc CM	230	sums = kzalloc(btrfs_ordered_sum_size(root, bio->bi_size), GFP_NOFS);
e015640f CM	231	if (!sums)
e015640f CM	232	return -ENOMEM;
3edf7d33	233
ed98b56a	234	sector_sum = sums->sums;
3edf7d33	235	sums->file_offset = page_offset(bvec->bv_page) + bvec->bv_offset;
e6dcd2dc CM	236	sums->len = bio->bi_size;
e6dcd2dc CM	237	INIT_LIST_HEAD(&sums->list);
3edf7d33 CM	238	ordered = btrfs_lookup_ordered_extent(inode, sums->file_offset);
3edf7d33 CM	239	BUG_ON(!ordered);
e015640f CM	240
e015640f CM	241	while(bio_index < bio->bi_vcnt) {
3edf7d33	242	offset = page_offset(bvec->bv_page) + bvec->bv_offset;
e5a2217e CM	243	if (offset >= ordered->file_offset + ordered->len \|\|
e5a2217e CM	244	offset < ordered->file_offset) {
3edf7d33 CM	245	unsigned long bytes_left;
	246	sums->len = this_sum_bytes;
	247	this_sum_bytes = 0;
	248	btrfs_add_ordered_sum(inode, ordered, sums);
	249	btrfs_put_ordered_extent(ordered);
	250
	251	bytes_left = bio->bi_size - total_bytes;
	252
	253	sums = kzalloc(btrfs_ordered_sum_size(root, bytes_left),
	254	GFP_NOFS);
	255	BUG_ON(!sums);
ed98b56a	256	sector_sum = sums->sums;
3edf7d33 CM	257	sums->len = bytes_left;
	258	sums->file_offset = offset;
	259	ordered = btrfs_lookup_ordered_extent(inode,
	260	sums->file_offset);
	261	BUG_ON(!ordered);
	262	}
	263
e015640f	264	data = kmap_atomic(bvec->bv_page, KM_USER0);
e6dcd2dc CM	265	sector_sum->sum = ~(u32)0;
	266	sector_sum->sum = btrfs_csum_data(root,
	267	data + bvec->bv_offset,
	268	sector_sum->sum,
	269	bvec->bv_len);
e015640f	270	kunmap_atomic(data, KM_USER0);
e6dcd2dc CM	271	btrfs_csum_final(sector_sum->sum,
	272	(char *)&sector_sum->sum);
	273	sector_sum->offset = page_offset(bvec->bv_page) +
	274	bvec->bv_offset;
ed98b56a	275
e6dcd2dc	276	sector_sum++;
e015640f	277	bio_index++;
3edf7d33 CM	278	total_bytes += bvec->bv_len;
3edf7d33 CM	279	this_sum_bytes += bvec->bv_len;
e015640f CM	280	bvec++;
e015640f CM	281	}
ed98b56a	282	this_sum_bytes = 0;
3edf7d33 CM	283	btrfs_add_ordered_sum(inode, ordered, sums);
3edf7d33 CM	284	btrfs_put_ordered_extent(ordered);
e015640f CM	285	return 0;
	286	}
	287
065631f6 CM	288	int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
065631f6 CM	289	struct btrfs_root root, struct inode inode,
e6dcd2dc	290	struct btrfs_ordered_sum *sums)
f254e52c	291	{
065631f6 CM	292	u64 objectid = inode->i_ino;
065631f6 CM	293	u64 offset;
f254e52c CM	294	int ret;
f254e52c CM	295	struct btrfs_key file_key;
6567e837	296	struct btrfs_key found_key;
065631f6	297	u64 next_offset;
e6dcd2dc	298	u64 total_bytes = 0;
065631f6	299	int found_next;
5caf2a00	300	struct btrfs_path *path;
f254e52c	301	struct btrfs_csum_item *item;
065631f6	302	struct btrfs_csum_item *item_end;
ff79f819	303	struct extent_buffer *leaf = NULL;
6567e837	304	u64 csum_offset;
e6dcd2dc	305	struct btrfs_sector_sum *sector_sum;
f578d4bd CM	306	u32 nritems;
f578d4bd CM	307	u32 ins_size;
6e92f5e6 CM	308	char *eb_map;
	309	char *eb_token;
	310	unsigned long map_len;
	311	unsigned long map_start;
	312
5caf2a00 CM	313	path = btrfs_alloc_path();
5caf2a00 CM	314	BUG_ON(!path);
ed98b56a	315	sector_sum = sums->sums;
065631f6 CM	316	again:
	317	next_offset = (u64)-1;
	318	found_next = 0;
e6dcd2dc	319	offset = sector_sum->offset;
f254e52c CM	320	file_key.objectid = objectid;
f254e52c CM	321	file_key.offset = offset;
f254e52c	322	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
a429e513	323
53863232	324	mutex_lock(&BTRFS_I(inode)->csum_mutex);
a429e513	325	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 1);
ff79f819 CM	326	if (!IS_ERR(item)) {
ff79f819 CM	327	leaf = path->nodes[0];
a429e513	328	goto found;
ff79f819	329	}
a429e513 CM	330	ret = PTR_ERR(item);
	331	if (ret == -EFBIG) {
	332	u32 item_size;
	333	/* we found one, but it isn't big enough yet */
5f39d397 CM	334	leaf = path->nodes[0];
5f39d397 CM	335	item_size = btrfs_item_size_nr(leaf, path->slots[0]);
509659cd	336	if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
a429e513 CM	337	/* already at max size, make a new one */
	338	goto insert;
	339	}
	340	} else {
f578d4bd	341	int slot = path->slots[0] + 1;
a429e513	342	/* we didn't find a csum item, insert one */
f578d4bd CM	343	nritems = btrfs_header_nritems(path->nodes[0]);
	344	if (path->slots[0] >= nritems - 1) {
	345	ret = btrfs_next_leaf(root, path);
b56baf5b	346	if (ret == 1)
f578d4bd	347	found_next = 1;
b56baf5b	348	if (ret != 0)
f578d4bd	349	goto insert;
b56baf5b	350	slot = 0;
f578d4bd CM	351	}
	352	btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
	353	if (found_key.objectid != objectid \|\|
	354	found_key.type != BTRFS_CSUM_ITEM_KEY) {
	355	found_next = 1;
	356	goto insert;
	357	}
	358	next_offset = found_key.offset;
	359	found_next = 1;
a429e513 CM	360	goto insert;
	361	}
	362
	363	/*
	364	* at this point, we know the tree has an item, but it isn't big
	365	* enough yet to put our csum in. Grow it
	366	*/
	367	btrfs_release_path(root, path);
6567e837	368	ret = btrfs_search_slot(trans, root, &file_key, path,
509659cd	369	BTRFS_CRC32_SIZE, 1);
6567e837	370	if (ret < 0)
53863232	371	goto fail_unlock;
6567e837	372	if (ret == 0) {
b18c6685	373	BUG();
6567e837 CM	374	}
6567e837 CM	375	if (path->slots[0] == 0) {
6567e837 CM	376	goto insert;
	377	}
	378	path->slots[0]--;
5f39d397 CM	379	leaf = path->nodes[0];
5f39d397 CM	380	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6567e837 CM	381	csum_offset = (offset - found_key.offset) >>
	382	root->fs_info->sb->s_blocksize_bits;
	383	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY \|\|
	384	found_key.objectid != objectid \|\|
	385	csum_offset >= MAX_CSUM_ITEMS(root)) {
6567e837 CM	386	goto insert;
6567e837 CM	387	}
5f39d397	388	if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
509659cd CM	389	BTRFS_CRC32_SIZE) {
509659cd CM	390	u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
5f39d397	391	diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
3a686375 CM	392	if (diff != BTRFS_CRC32_SIZE)
3a686375 CM	393	goto insert;
a429e513	394	ret = btrfs_extend_item(trans, root, path, diff);
6567e837 CM	395	BUG_ON(ret);
	396	goto csum;
	397	}
	398
	399	insert:
a429e513	400	btrfs_release_path(root, path);
6567e837	401	csum_offset = 0;
f578d4bd CM	402	if (found_next) {
f578d4bd CM	403	u64 tmp = min((u64)i_size_read(inode), next_offset);
b56baf5b	404	tmp -= offset & ~((u64)root->sectorsize -1);
f578d4bd CM	405	tmp >>= root->fs_info->sb->s_blocksize_bits;
	406	tmp = max((u64)1, tmp);
	407	tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root));
	408	ins_size = BTRFS_CRC32_SIZE * tmp;
	409	} else {
	410	ins_size = BTRFS_CRC32_SIZE;
	411	}
5caf2a00	412	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
f578d4bd	413	ins_size);
54aa1f4d	414	if (ret < 0)
53863232	415	goto fail_unlock;
a429e513	416	if (ret != 0) {
a429e513	417	WARN_ON(1);
53863232	418	goto fail_unlock;
a429e513	419	}
6567e837	420	csum:
5f39d397 CM	421	leaf = path->nodes[0];
5f39d397 CM	422	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
f254e52c	423	ret = 0;
509659cd CM	424	item = (struct btrfs_csum_item )((unsigned char )item +
509659cd CM	425	csum_offset * BTRFS_CRC32_SIZE);
b18c6685	426	found:
065631f6 CM	427	item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	428	item_end = (struct btrfs_csum_item )((unsigned char )item_end +
	429	btrfs_item_size_nr(leaf, path->slots[0]));
6e92f5e6	430	eb_token = NULL;
53863232 CM	431	mutex_unlock(&BTRFS_I(inode)->csum_mutex);
53863232 CM	432	cond_resched();
e6dcd2dc	433	next_sector:
aadfeb6e	434
6e92f5e6 CM	435	if (!eb_token \|\|
	436	(unsigned long)item + BTRFS_CRC32_SIZE >= map_start + map_len) {
	437	int err;
	438
	439	if (eb_token)
eb20978f	440	unmap_extent_buffer(leaf, eb_token, KM_USER1);
6e92f5e6 CM	441	eb_token = NULL;
	442	err = map_private_extent_buffer(leaf, (unsigned long)item,
	443	BTRFS_CRC32_SIZE,
	444	&eb_token, &eb_map,
eb20978f	445	&map_start, &map_len, KM_USER1);
6e92f5e6 CM	446	if (err)
	447	eb_token = NULL;
	448	}
	449	if (eb_token) {
	450	memcpy(eb_token + ((unsigned long)item & (PAGE_CACHE_SIZE - 1)),
e6dcd2dc	451	&sector_sum->sum, BTRFS_CRC32_SIZE);
6e92f5e6	452	} else {
e6dcd2dc CM	453	write_extent_buffer(leaf, &sector_sum->sum,
e6dcd2dc CM	454	(unsigned long)item, BTRFS_CRC32_SIZE);
6e92f5e6	455	}
7f3c74fb	456
e6dcd2dc CM	457	total_bytes += root->sectorsize;
	458	sector_sum++;
	459	if (total_bytes < sums->len) {
6e92f5e6 CM	460	item = (struct btrfs_csum_item )((char )item +
6e92f5e6 CM	461	BTRFS_CRC32_SIZE);
2e1a992e	462	if (item < item_end && offset + PAGE_CACHE_SIZE ==
e6dcd2dc CM	463	sector_sum->offset) {
	464	offset = sector_sum->offset;
	465	goto next_sector;
2e1a992e	466	}
065631f6	467	}
6e92f5e6	468	if (eb_token) {
eb20978f	469	unmap_extent_buffer(leaf, eb_token, KM_USER1);
6e92f5e6 CM	470	eb_token = NULL;
6e92f5e6 CM	471	}
5caf2a00	472	btrfs_mark_buffer_dirty(path->nodes[0]);
53863232	473	cond_resched();
e6dcd2dc	474	if (total_bytes < sums->len) {
065631f6 CM	475	btrfs_release_path(root, path);
	476	goto again;
	477	}
53863232	478	out:
5caf2a00	479	btrfs_free_path(path);
f254e52c	480	return ret;
53863232 CM	481
	482	fail_unlock:
	483	mutex_unlock(&BTRFS_I(inode)->csum_mutex);
	484	goto out;
f254e52c CM	485	}
f254e52c CM	486
1de037a4 CM	487	int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
	488	struct btrfs_root root, struct btrfs_path path,
	489	u64 isize)
	490	{
	491	struct btrfs_key key;
5f39d397	492	struct extent_buffer *leaf = path->nodes[0];
1de037a4 CM	493	int slot = path->slots[0];
	494	int ret;
	495	u32 new_item_size;
	496	u64 new_item_span;
	497	u64 blocks;
	498
5f39d397	499	btrfs_item_key_to_cpu(leaf, &key, slot);
1de037a4 CM	500	if (isize <= key.offset)
	501	return 0;
	502	new_item_span = isize - key.offset;
5f39d397	503	blocks = (new_item_span + root->sectorsize - 1) >>
84f54cfa	504	root->fs_info->sb->s_blocksize_bits;
1de037a4	505	new_item_size = blocks * BTRFS_CRC32_SIZE;
5f39d397	506	if (new_item_size >= btrfs_item_size_nr(leaf, slot))
1de037a4	507	return 0;
179e29e4	508	ret = btrfs_truncate_item(trans, root, path, new_item_size, 1);
1de037a4 CM	509	BUG_ON(ret);
	510	return ret;
	511	}