file-item.c 8.1 KB
Newer Older
C
Chris Mason 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18
/*
 * 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.
 */

C
Chris Mason 已提交
19
#include "ctree.h"
C
Chris Mason 已提交
20
#include "disk-io.h"
21
#include "transaction.h"
C
Chris Mason 已提交
22
#include "print-tree.h"
C
Chris Mason 已提交
23

24
#define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
25 26
			       sizeof(struct btrfs_item) * 2) / \
			       BTRFS_CRC32_SIZE) - 1))
C
Chris Mason 已提交
27
int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
C
Chris Mason 已提交
28
			       struct btrfs_root *root,
C
Chris Mason 已提交
29
			       u64 objectid, u64 pos,
30 31
			       u64 offset, u64 disk_num_bytes,
			       u64 num_bytes)
32
{
C
Chris Mason 已提交
33 34 35
	int ret = 0;
	struct btrfs_file_extent_item *item;
	struct btrfs_key file_key;
36
	struct btrfs_path *path;
37
	struct extent_buffer *leaf;
C
Chris Mason 已提交
38

39 40
	path = btrfs_alloc_path();
	BUG_ON(!path);
C
Chris Mason 已提交
41
	file_key.objectid = objectid;
C
Chris Mason 已提交
42
	file_key.offset = pos;
C
Chris Mason 已提交
43 44
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);

45
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
C
Chris Mason 已提交
46
				      sizeof(*item));
47 48
	if (ret < 0)
		goto out;
C
Chris Mason 已提交
49
	BUG_ON(ret);
50 51
	leaf = path->nodes[0];
	item = btrfs_item_ptr(leaf, path->slots[0],
C
Chris Mason 已提交
52
			      struct btrfs_file_extent_item);
53 54
	btrfs_set_file_extent_disk_bytenr(leaf, item, offset);
	btrfs_set_file_extent_disk_num_bytes(leaf, item, disk_num_bytes);
55
	btrfs_set_file_extent_offset(leaf, item, 0);
56
	btrfs_set_file_extent_num_bytes(leaf, item, num_bytes);
57 58 59
	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);
60
out:
61
	btrfs_free_path(path);
62
	return ret;
63
}
C
Chris Mason 已提交
64

C
Chris Mason 已提交
65 66 67 68 69
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)
70 71 72 73 74
{
	int ret;
	struct btrfs_key file_key;
	struct btrfs_key found_key;
	struct btrfs_csum_item *item;
75
	struct extent_buffer *leaf;
76
	u64 csum_offset = 0;
77
	int csums_in_item;
78 79 80 81

	file_key.objectid = objectid;
	file_key.offset = offset;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
C
Chris Mason 已提交
82
	ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
83 84
	if (ret < 0)
		goto fail;
85
	leaf = path->nodes[0];
86 87
	if (ret > 0) {
		ret = 1;
88
		if (path->slots[0] == 0)
89 90
			goto fail;
		path->slots[0]--;
91
		btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
92 93 94 95 96 97
		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;
98
		csums_in_item = btrfs_item_size_nr(leaf, path->slots[0]);
99
		csums_in_item /= BTRFS_CRC32_SIZE;
100 101 102

		if (csum_offset >= csums_in_item) {
			ret = -EFBIG;
103 104 105 106
			goto fail;
		}
	}
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
107 108
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
109 110 111
	return item;
fail:
	if (ret > 0)
C
Chris Mason 已提交
112
		ret = -ENOENT;
113 114 115 116
	return ERR_PTR(ret);
}


C
Chris Mason 已提交
117 118 119
int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
			     struct btrfs_root *root,
			     struct btrfs_path *path, u64 objectid,
C
Chris Mason 已提交
120
			     u64 offset, int mod)
C
Chris Mason 已提交
121 122 123 124 125 126 127
{
	int ret;
	struct btrfs_key file_key;
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;

	file_key.objectid = objectid;
128
	file_key.offset = offset;
C
Chris Mason 已提交
129 130 131 132
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);
	ret = btrfs_search_slot(trans, root, &file_key, path, ins_len, cow);
	return ret;
}
C
Chris Mason 已提交
133 134 135

int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
			  struct btrfs_root *root,
136
			  struct inode *inode,
C
Chris Mason 已提交
137 138 139 140 141
			  u64 objectid, u64 offset,
			  char *data, size_t len)
{
	int ret;
	struct btrfs_key file_key;
142
	struct btrfs_key found_key;
143 144
	u64 next_offset = (u64)-1;
	int found_next = 0;
145
	struct btrfs_path *path;
C
Chris Mason 已提交
146
	struct btrfs_csum_item *item;
147
	struct extent_buffer *leaf = NULL;
148
	u64 csum_offset;
149
	u32 csum_result = ~(u32)0;
150 151
	u32 nritems;
	u32 ins_size;
C
Chris Mason 已提交
152

153 154
	path = btrfs_alloc_path();
	BUG_ON(!path);
C
Chris Mason 已提交
155

C
Chris Mason 已提交
156 157 158
	file_key.objectid = objectid;
	file_key.offset = offset;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
159 160

	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 1);
161 162
	if (!IS_ERR(item)) {
		leaf = path->nodes[0];
163
		goto found;
164
	}
165 166 167 168
	ret = PTR_ERR(item);
	if (ret == -EFBIG) {
		u32 item_size;
		/* we found one, but it isn't big enough yet */
169 170
		leaf = path->nodes[0];
		item_size = btrfs_item_size_nr(leaf, path->slots[0]);
171
		if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
172 173 174 175
			/* already at max size, make a new one */
			goto insert;
		}
	} else {
176
		int slot = path->slots[0] + 1;
177
		/* we didn't find a csum item, insert one */
178 179 180
		nritems = btrfs_header_nritems(path->nodes[0]);
		if (path->slots[0] >= nritems - 1) {
			ret = btrfs_next_leaf(root, path);
Y
Yan 已提交
181
			if (ret == 1)
182
				found_next = 1;
Y
Yan 已提交
183
			if (ret != 0)
184
				goto insert;
Y
Yan 已提交
185
			slot = 0;
186 187 188 189 190 191 192 193 194
		}
		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;
195 196 197 198 199 200 201 202
		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);
203
	ret = btrfs_search_slot(trans, root, &file_key, path,
204
				BTRFS_CRC32_SIZE, 1);
205 206 207
	if (ret < 0)
		goto fail;
	if (ret == 0) {
C
Chris Mason 已提交
208
		BUG();
209 210 211 212 213
	}
	if (path->slots[0] == 0) {
		goto insert;
	}
	path->slots[0]--;
214 215
	leaf = path->nodes[0];
	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
216 217 218 219 220 221 222
	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;
	}
223
	if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
224 225
	    BTRFS_CRC32_SIZE) {
		u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
226
		diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
C
Chris Mason 已提交
227 228
		if (diff != BTRFS_CRC32_SIZE)
			goto insert;
229
		ret = btrfs_extend_item(trans, root, path, diff);
230 231 232 233 234
		BUG_ON(ret);
		goto csum;
	}

insert:
235
	btrfs_release_path(root, path);
236
	csum_offset = 0;
237 238
	if (found_next) {
		u64 tmp = min((u64)i_size_read(inode), next_offset);
Y
Yan 已提交
239
		tmp -= offset & ~((u64)root->sectorsize -1);
240 241 242 243 244 245 246
		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;
	}
247
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
248
				      ins_size);
249 250
	if (ret < 0)
		goto fail;
251 252
	if (ret != 0) {
		WARN_ON(1);
C
Chris Mason 已提交
253
		goto fail;
254
	}
255
csum:
256 257
	leaf = path->nodes[0];
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
C
Chris Mason 已提交
258
	ret = 0;
259 260
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
C
Chris Mason 已提交
261
found:
262 263 264 265
	csum_result = btrfs_csum_data(root, data, csum_result, len);
	btrfs_csum_final(csum_result, (char *)&csum_result);
	write_extent_buffer(leaf, &csum_result, (unsigned long)item,
			    BTRFS_CRC32_SIZE);
266
	btrfs_mark_buffer_dirty(path->nodes[0]);
C
Chris Mason 已提交
267
fail:
268 269
	btrfs_release_path(root, path);
	btrfs_free_path(path);
C
Chris Mason 已提交
270 271 272
	return ret;
}

C
Chris Mason 已提交
273 274 275 276 277
int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
			struct btrfs_root *root, struct btrfs_path *path,
			u64 isize)
{
	struct btrfs_key key;
278
	struct extent_buffer *leaf = path->nodes[0];
C
Chris Mason 已提交
279 280 281 282 283 284
	int slot = path->slots[0];
	int ret;
	u32 new_item_size;
	u64 new_item_span;
	u64 blocks;

285
	btrfs_item_key_to_cpu(leaf, &key, slot);
C
Chris Mason 已提交
286 287 288
	if (isize <= key.offset)
		return 0;
	new_item_span = isize - key.offset;
289
	blocks = (new_item_span + root->sectorsize - 1) >>
C
Chris Mason 已提交
290
		root->fs_info->sb->s_blocksize_bits;
C
Chris Mason 已提交
291
	new_item_size = blocks * BTRFS_CRC32_SIZE;
292
	if (new_item_size >= btrfs_item_size_nr(leaf, slot))
C
Chris Mason 已提交
293
		return 0;
294
	ret = btrfs_truncate_item(trans, root, path, new_item_size, 1);
C
Chris Mason 已提交
295 296 297 298
	BUG_ON(ret);
	return ret;
}