file-item.c 7.6 KB
Newer Older
1
#include <linux/module.h>
C
Chris Mason 已提交
2
#include "ctree.h"
C
Chris Mason 已提交
3
#include "disk-io.h"
4
#include "transaction.h"
C
Chris Mason 已提交
5
#include "print-tree.h"
C
Chris Mason 已提交
6

7
#define MAX_CSUM_ITEMS(r) ((((BTRFS_LEAF_DATA_SIZE(r) - \
8 9
			       sizeof(struct btrfs_item) * 2) / \
			       BTRFS_CRC32_SIZE) - 1))
C
Chris Mason 已提交
10
int btrfs_insert_file_extent(struct btrfs_trans_handle *trans,
C
Chris Mason 已提交
11
			       struct btrfs_root *root,
C
Chris Mason 已提交
12
			       u64 objectid, u64 pos,
C
Chris Mason 已提交
13 14
			       u64 offset, u64 disk_num_blocks,
			       u64 num_blocks)
15
{
C
Chris Mason 已提交
16 17 18
	int ret = 0;
	struct btrfs_file_extent_item *item;
	struct btrfs_key file_key;
19
	struct btrfs_path *path;
C
Chris Mason 已提交
20

21 22 23
	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);
C
Chris Mason 已提交
24
	file_key.objectid = objectid;
C
Chris Mason 已提交
25
	file_key.offset = pos;
C
Chris Mason 已提交
26 27 28
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_EXTENT_DATA_KEY);

29
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
C
Chris Mason 已提交
30
				      sizeof(*item));
C
Chris Mason 已提交
31
	BUG_ON(ret);
32
	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
C
Chris Mason 已提交
33
			      struct btrfs_file_extent_item);
C
Chris Mason 已提交
34
	btrfs_set_file_extent_disk_blocknr(item, offset);
C
Chris Mason 已提交
35
	btrfs_set_file_extent_disk_num_blocks(item, disk_num_blocks);
C
Chris Mason 已提交
36
	btrfs_set_file_extent_offset(item, 0);
C
Chris Mason 已提交
37
	btrfs_set_file_extent_num_blocks(item, num_blocks);
38
	btrfs_set_file_extent_generation(item, trans->transid);
39
	btrfs_set_file_extent_type(item, BTRFS_FILE_EXTENT_REG);
40
	btrfs_mark_buffer_dirty(path->nodes[0]);
41

42 43
	btrfs_release_path(root, path);
	btrfs_free_path(path);
44 45
	return 0;
}
C
Chris Mason 已提交
46

C
Chris Mason 已提交
47 48 49 50 51
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)
52 53 54 55 56 57 58
{
	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;
59
	int csums_in_item;
60 61 62 63 64

	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
C
Chris Mason 已提交
65
	ret = btrfs_search_slot(trans, root, &file_key, path, 0, cow);
66 67 68 69 70
	if (ret < 0)
		goto fail;
	leaf = btrfs_buffer_leaf(path->nodes[0]);
	if (ret > 0) {
		ret = 1;
71
		if (path->slots[0] == 0)
72 73 74 75 76 77 78 79 80 81
			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;
82
		csums_in_item = btrfs_item_size(leaf->items + path->slots[0]);
83
		csums_in_item /= BTRFS_CRC32_SIZE;
84 85 86

		if (csum_offset >= csums_in_item) {
			ret = -EFBIG;
87 88 89 90
			goto fail;
		}
	}
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
91 92
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
93 94 95
	return item;
fail:
	if (ret > 0)
C
Chris Mason 已提交
96
		ret = -ENOENT;
97 98 99 100
	return ERR_PTR(ret);
}


C
Chris Mason 已提交
101 102 103
int btrfs_lookup_file_extent(struct btrfs_trans_handle *trans,
			     struct btrfs_root *root,
			     struct btrfs_path *path, u64 objectid,
C
Chris Mason 已提交
104
			     u64 offset, int mod)
C
Chris Mason 已提交
105 106 107 108 109 110 111
{
	int ret;
	struct btrfs_key file_key;
	int ins_len = mod < 0 ? -1 : 0;
	int cow = mod != 0;

	file_key.objectid = objectid;
112
	file_key.offset = offset;
C
Chris Mason 已提交
113 114 115 116 117
	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;
}
C
Chris Mason 已提交
118 119 120 121 122 123 124 125

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;
126
	struct btrfs_key found_key;
127
	struct btrfs_path *path;
C
Chris Mason 已提交
128
	struct btrfs_csum_item *item;
129 130
	struct btrfs_leaf *leaf;
	u64 csum_offset;
C
Chris Mason 已提交
131

132 133
	path = btrfs_alloc_path();
	BUG_ON(!path);
C
Chris Mason 已提交
134

C
Chris Mason 已提交
135 136 137 138
	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
139 140 141 142 143 144 145 146 147 148

	item = btrfs_lookup_csum(trans, root, path, objectid, offset, 1);
	if (!IS_ERR(item))
		goto found;
	ret = PTR_ERR(item);
	if (ret == -EFBIG) {
		u32 item_size;
		/* we found one, but it isn't big enough yet */
		leaf = btrfs_buffer_leaf(path->nodes[0]);
		item_size = btrfs_item_size(leaf->items + path->slots[0]);
149
		if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
150 151 152 153 154 155 156 157 158 159 160 161 162
			/* already at max size, make a new one */
			goto insert;
		}
	} else {
		/* we didn't find a csum item, insert one */
		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);
163
	ret = btrfs_search_slot(trans, root, &file_key, path,
164
				BTRFS_CRC32_SIZE, 1);
165 166 167
	if (ret < 0)
		goto fail;
	if (ret == 0) {
C
Chris Mason 已提交
168
		BUG();
169 170 171 172 173 174 175 176 177 178 179 180 181 182 183
	}
	if (path->slots[0] == 0) {
		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)) {
		goto insert;
	}
	if (csum_offset >= btrfs_item_size(leaf->items + path->slots[0]) /
184 185
	    BTRFS_CRC32_SIZE) {
		u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
186
		diff = diff - btrfs_item_size(leaf->items + path->slots[0]);
C
Chris Mason 已提交
187 188
		if (diff != BTRFS_CRC32_SIZE)
			goto insert;
189
		ret = btrfs_extend_item(trans, root, path, diff);
190 191 192 193 194
		BUG_ON(ret);
		goto csum;
	}

insert:
195
	btrfs_release_path(root, path);
196
	csum_offset = 0;
197
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
198
				      BTRFS_CRC32_SIZE);
199 200
	if (ret != 0) {
		WARN_ON(1);
C
Chris Mason 已提交
201
		goto fail;
202
	}
203
csum:
204
	item = btrfs_item_ptr(btrfs_buffer_leaf(path->nodes[0]), path->slots[0],
C
Chris Mason 已提交
205 206
			      struct btrfs_csum_item);
	ret = 0;
207 208
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
C
Chris Mason 已提交
209
found:
210 211 212 213
	btrfs_check_bounds(&item->csum, BTRFS_CRC32_SIZE,
			   path->nodes[0]->b_data,
			   root->fs_info->sb->s_blocksize);
	ret = btrfs_csum_data(root, data, len, &item->csum);
214
	btrfs_mark_buffer_dirty(path->nodes[0]);
C
Chris Mason 已提交
215
fail:
216 217
	btrfs_release_path(root, path);
	btrfs_free_path(path);
C
Chris Mason 已提交
218 219 220
	return ret;
}

C
Chris Mason 已提交
221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236
int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
			struct btrfs_root *root, struct btrfs_path *path,
			u64 isize)
{
	struct btrfs_key key;
	struct btrfs_leaf *leaf = btrfs_buffer_leaf(path->nodes[0]);
	int slot = path->slots[0];
	int ret;
	u32 new_item_size;
	u64 new_item_span;
	u64 blocks;

	btrfs_disk_key_to_cpu(&key, &leaf->items[slot].key);
	if (isize <= key.offset)
		return 0;
	new_item_span = isize - key.offset;
C
Chris Mason 已提交
237 238
	blocks = (new_item_span + root->blocksize - 1) >>
		root->fs_info->sb->s_blocksize_bits;
C
Chris Mason 已提交
239 240 241 242 243 244 245 246
	new_item_size = blocks * BTRFS_CRC32_SIZE;
	if (new_item_size >= btrfs_item_size(leaf->items + slot))
		return 0;
	ret = btrfs_truncate_item(trans, root, path, new_item_size);
	BUG_ON(ret);
	return ret;
}

C
Chris Mason 已提交
247 248 249 250 251 252
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;
253
	struct btrfs_path *path;
C
Chris Mason 已提交
254
	struct btrfs_csum_item *item;
255
	char result[BTRFS_CRC32_SIZE];
C
Chris Mason 已提交
256

257 258 259
	path = btrfs_alloc_path();
	BUG_ON(!path);
	btrfs_init_path(path);
C
Chris Mason 已提交
260 261 262 263
	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
264
	mutex_lock(&root->fs_info->fs_mutex);
265

C
Chris Mason 已提交
266
	item = btrfs_lookup_csum(NULL, root, path, objectid, offset, 0);
267 268
	if (IS_ERR(item)) {
		ret = PTR_ERR(item);
269 270
		/* a csum that isn't present is a preallocated region. */
		if (ret == -ENOENT || ret == -EFBIG)
C
Chris Mason 已提交
271
			ret = -ENOENT;
C
Chris Mason 已提交
272
		goto fail;
273 274
	}

C
Chris Mason 已提交
275 276
	ret = btrfs_csum_data(root, data, len, result);
	WARN_ON(ret);
277
	if (memcmp(result, &item->csum, BTRFS_CRC32_SIZE))
C
Chris Mason 已提交
278 279
		ret = 1;
fail:
280 281
	btrfs_release_path(root, path);
	btrfs_free_path(path);
282
	mutex_unlock(&root->fs_info->fs_mutex);
C
Chris Mason 已提交
283 284 285
	return ret;
}