[GitHub/mt8127/android_kernel_alcatel_ttab.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 offset, u64 disk_num_bytes,
			       u64 num_bytes)
{
	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, offset);
	btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
	btrfs_set_file_extent_offset(leaf, item, 0);
	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;
}

int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
			   struct btrfs_root *root, struct inode *inode,
			   struct bio *bio)
{
	u64 objectid = inode->i_ino;
	u64 offset;
	int ret;
	struct btrfs_key file_key;
	struct btrfs_key found_key;
	u64 next_offset;
	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;
	u32 csum_result;
	u32 nritems;
	u32 ins_size;
	int bio_index = 0;
	struct bio_vec *bvec = bio->bi_io_vec;
	char *data;

	path = btrfs_alloc_path();
	BUG_ON(!path);
again:
	next_offset = (u64)-1;
	found_next = 0;
	offset = page_offset(bvec->bv_page) + bvec->bv_offset;
	file_key.objectid = objectid;
	file_key.offset = offset;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);

	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;
	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;
	if (ret != 0) {
		WARN_ON(1);
		goto fail;
	}
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]));
next_bvec:
	data = kmap_atomic(bvec->bv_page, KM_IRQ0);
	csum_result = ~(u32)0;
	csum_result = btrfs_csum_data(root, data + bvec->bv_offset,
				      csum_result, bvec->bv_len);
	kunmap_atomic(data, KM_IRQ0);
	btrfs_csum_final(csum_result, (char *)&csum_result);
	if (csum_result == 0) {
		printk("csum result is 0 for inode %lu offset %Lu\n", inode->i_ino, offset);
	}

	write_extent_buffer(leaf, &csum_result, (unsigned long)item,
			    BTRFS_CRC32_SIZE);
	bio_index++;
	bvec++;
	if (bio_index < bio->bi_vcnt) {
		item = (struct btrfs_csum_item *)((char *)item + BTRFS_CRC32_SIZE);
		if (item < item_end)
			goto next_bvec;
	}
	btrfs_mark_buffer_dirty(path->nodes[0]);
	if (bio_index < bio->bi_vcnt) {
		btrfs_release_path(root, path);
		goto again;
	}
fail:
	btrfs_free_path(path);
	return ret;
}

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,
dee26a9f	31	struct btrfs_root *root,
b18c6685	32	u64 objectid, u64 pos,
db94535d CM	33	u64 offset, u64 disk_num_bytes,
db94535d CM	34	u64 num_bytes)
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);
db94535d CM	56	btrfs_set_file_extent_disk_bytenr(leaf, item, offset);
db94535d CM	57	btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
5f39d397	58	btrfs_set_file_extent_offset(leaf, item, 0);
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
065631f6 CM	137	int btrfs_csum_file_blocks(struct btrfs_trans_handle *trans,
	138	struct btrfs_root root, struct inode inode,
	139	struct bio *bio)
f254e52c	140	{
065631f6 CM	141	u64 objectid = inode->i_ino;
065631f6 CM	142	u64 offset;
f254e52c CM	143	int ret;
f254e52c CM	144	struct btrfs_key file_key;
6567e837	145	struct btrfs_key found_key;
065631f6 CM	146	u64 next_offset;
065631f6 CM	147	int found_next;
5caf2a00	148	struct btrfs_path *path;
f254e52c	149	struct btrfs_csum_item *item;
065631f6	150	struct btrfs_csum_item *item_end;
ff79f819	151	struct extent_buffer *leaf = NULL;
6567e837	152	u64 csum_offset;
065631f6	153	u32 csum_result;
f578d4bd CM	154	u32 nritems;
f578d4bd CM	155	u32 ins_size;
065631f6 CM	156	int bio_index = 0;
	157	struct bio_vec *bvec = bio->bi_io_vec;
	158	char *data;
f254e52c	159
5caf2a00 CM	160	path = btrfs_alloc_path();
5caf2a00 CM	161	BUG_ON(!path);
065631f6 CM	162	again:
	163	next_offset = (u64)-1;
	164	found_next = 0;
	165	offset = page_offset(bvec->bv_page) + bvec->bv_offset;
f254e52c CM	166	file_key.objectid = objectid;
f254e52c CM	167	file_key.offset = offset;
f254e52c	168	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
a429e513 CM	169
a429e513 CM	170	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 1);
ff79f819 CM	171	if (!IS_ERR(item)) {
ff79f819 CM	172	leaf = path->nodes[0];
a429e513	173	goto found;
ff79f819	174	}
a429e513 CM	175	ret = PTR_ERR(item);
	176	if (ret == -EFBIG) {
	177	u32 item_size;
	178	/* we found one, but it isn't big enough yet */
5f39d397 CM	179	leaf = path->nodes[0];
5f39d397 CM	180	item_size = btrfs_item_size_nr(leaf, path->slots[0]);
509659cd	181	if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
a429e513 CM	182	/* already at max size, make a new one */
	183	goto insert;
	184	}
	185	} else {
f578d4bd	186	int slot = path->slots[0] + 1;
a429e513	187	/* we didn't find a csum item, insert one */
f578d4bd CM	188	nritems = btrfs_header_nritems(path->nodes[0]);
	189	if (path->slots[0] >= nritems - 1) {
	190	ret = btrfs_next_leaf(root, path);
b56baf5b	191	if (ret == 1)
f578d4bd	192	found_next = 1;
b56baf5b	193	if (ret != 0)
f578d4bd	194	goto insert;
b56baf5b	195	slot = 0;
f578d4bd CM	196	}
	197	btrfs_item_key_to_cpu(path->nodes[0], &found_key, slot);
	198	if (found_key.objectid != objectid \|\|
	199	found_key.type != BTRFS_CSUM_ITEM_KEY) {
	200	found_next = 1;
	201	goto insert;
	202	}
	203	next_offset = found_key.offset;
	204	found_next = 1;
a429e513 CM	205	goto insert;
	206	}
	207
	208	/*
	209	* at this point, we know the tree has an item, but it isn't big
	210	* enough yet to put our csum in. Grow it
	211	*/
	212	btrfs_release_path(root, path);
6567e837	213	ret = btrfs_search_slot(trans, root, &file_key, path,
509659cd	214	BTRFS_CRC32_SIZE, 1);
6567e837 CM	215	if (ret < 0)
	216	goto fail;
	217	if (ret == 0) {
b18c6685	218	BUG();
6567e837 CM	219	}
6567e837 CM	220	if (path->slots[0] == 0) {
6567e837 CM	221	goto insert;
	222	}
	223	path->slots[0]--;
5f39d397 CM	224	leaf = path->nodes[0];
5f39d397 CM	225	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
6567e837 CM	226	csum_offset = (offset - found_key.offset) >>
	227	root->fs_info->sb->s_blocksize_bits;
	228	if (btrfs_key_type(&found_key) != BTRFS_CSUM_ITEM_KEY \|\|
	229	found_key.objectid != objectid \|\|
	230	csum_offset >= MAX_CSUM_ITEMS(root)) {
6567e837 CM	231	goto insert;
6567e837 CM	232	}
5f39d397	233	if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
509659cd CM	234	BTRFS_CRC32_SIZE) {
509659cd CM	235	u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
5f39d397	236	diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
3a686375 CM	237	if (diff != BTRFS_CRC32_SIZE)
3a686375 CM	238	goto insert;
a429e513	239	ret = btrfs_extend_item(trans, root, path, diff);
6567e837 CM	240	BUG_ON(ret);
	241	goto csum;
	242	}
	243
	244	insert:
a429e513	245	btrfs_release_path(root, path);
6567e837	246	csum_offset = 0;
f578d4bd CM	247	if (found_next) {
f578d4bd CM	248	u64 tmp = min((u64)i_size_read(inode), next_offset);
b56baf5b	249	tmp -= offset & ~((u64)root->sectorsize -1);
f578d4bd CM	250	tmp >>= root->fs_info->sb->s_blocksize_bits;
	251	tmp = max((u64)1, tmp);
	252	tmp = min(tmp, (u64)MAX_CSUM_ITEMS(root));
	253	ins_size = BTRFS_CRC32_SIZE * tmp;
	254	} else {
	255	ins_size = BTRFS_CRC32_SIZE;
	256	}
5caf2a00	257	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
f578d4bd	258	ins_size);
54aa1f4d CM	259	if (ret < 0)
54aa1f4d CM	260	goto fail;
a429e513	261	if (ret != 0) {
a429e513	262	WARN_ON(1);
f254e52c	263	goto fail;
a429e513	264	}
6567e837	265	csum:
5f39d397 CM	266	leaf = path->nodes[0];
5f39d397 CM	267	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
f254e52c	268	ret = 0;
509659cd CM	269	item = (struct btrfs_csum_item )((unsigned char )item +
509659cd CM	270	csum_offset * BTRFS_CRC32_SIZE);
b18c6685	271	found:
065631f6 CM	272	item_end = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
	273	item_end = (struct btrfs_csum_item )((unsigned char )item_end +
	274	btrfs_item_size_nr(leaf, path->slots[0]));
	275	next_bvec:
	276	data = kmap_atomic(bvec->bv_page, KM_IRQ0);
	277	csum_result = ~(u32)0;
	278	csum_result = btrfs_csum_data(root, data + bvec->bv_offset,
	279	csum_result, bvec->bv_len);
	280	kunmap_atomic(data, KM_IRQ0);
ff79f819	281	btrfs_csum_final(csum_result, (char *)&csum_result);
aadfeb6e CM	282	if (csum_result == 0) {
	283	printk("csum result is 0 for inode %lu offset %Lu\n", inode->i_ino, offset);
	284	}
	285
ff79f819 CM	286	write_extent_buffer(leaf, &csum_result, (unsigned long)item,
ff79f819 CM	287	BTRFS_CRC32_SIZE);
065631f6 CM	288	bio_index++;
	289	bvec++;
	290	if (bio_index < bio->bi_vcnt) {
	291	item = (struct btrfs_csum_item )((char )item + BTRFS_CRC32_SIZE);
	292	if (item < item_end)
	293	goto next_bvec;
	294	}
5caf2a00	295	btrfs_mark_buffer_dirty(path->nodes[0]);
065631f6 CM	296	if (bio_index < bio->bi_vcnt) {
	297	btrfs_release_path(root, path);
	298	goto again;
	299	}
f254e52c	300	fail:
5caf2a00	301	btrfs_free_path(path);
f254e52c CM	302	return ret;
	303	}
	304
1de037a4 CM	305	int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
	306	struct btrfs_root root, struct btrfs_path path,
	307	u64 isize)
	308	{
	309	struct btrfs_key key;
5f39d397	310	struct extent_buffer *leaf = path->nodes[0];
1de037a4 CM	311	int slot = path->slots[0];
	312	int ret;
	313	u32 new_item_size;
	314	u64 new_item_span;
	315	u64 blocks;
	316
5f39d397	317	btrfs_item_key_to_cpu(leaf, &key, slot);
1de037a4 CM	318	if (isize <= key.offset)
	319	return 0;
	320	new_item_span = isize - key.offset;
5f39d397	321	blocks = (new_item_span + root->sectorsize - 1) >>
84f54cfa	322	root->fs_info->sb->s_blocksize_bits;
1de037a4	323	new_item_size = blocks * BTRFS_CRC32_SIZE;
5f39d397	324	if (new_item_size >= btrfs_item_size_nr(leaf, slot))
1de037a4	325	return 0;
179e29e4	326	ret = btrfs_truncate_item(trans, root, path, new_item_size, 1);
1de037a4 CM	327	BUG_ON(ret);
	328	return ret;
	329	}
	330