file-item.c 7.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,
C
Chris Mason 已提交
30 31
			       u64 offset, u64 disk_num_blocks,
			       u64 num_blocks)
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 55 56 57 58 59
	btrfs_set_file_extent_disk_blocknr(leaf, item, offset);
	btrfs_set_file_extent_disk_num_blocks(leaf, item, disk_num_blocks);
	btrfs_set_file_extent_offset(leaf, item, 0);
	btrfs_set_file_extent_num_blocks(leaf, item, num_blocks);
	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 136 137 138

int btrfs_csum_file_block(struct btrfs_trans_handle *trans,
			  struct btrfs_root *root,
			  u64 objectid, u64 offset,
			  char *data, size_t len)
{
139 140
	return 0;
#if 0
C
Chris Mason 已提交
141 142
	int ret;
	struct btrfs_key file_key;
143
	struct btrfs_key found_key;
144
	struct btrfs_path *path;
C
Chris Mason 已提交
145
	struct btrfs_csum_item *item;
146
	struct extent_buffer *leaf;
147
	u64 csum_offset;
C
Chris Mason 已提交
148

149 150
	path = btrfs_alloc_path();
	BUG_ON(!path);
C
Chris Mason 已提交
151

C
Chris Mason 已提交
152 153 154 155
	file_key.objectid = objectid;
	file_key.offset = offset;
	file_key.flags = 0;
	btrfs_set_key_type(&file_key, BTRFS_CSUM_ITEM_KEY);
156 157 158 159 160 161 162 163

	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 */
164 165
		leaf = path->nodes[0];
		item_size = btrfs_item_size_nr(leaf, path->slots[0]);
166
		if ((item_size / BTRFS_CRC32_SIZE) >= MAX_CSUM_ITEMS(root)) {
167 168 169 170 171 172 173 174 175 176 177 178 179
			/* 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);
180
	ret = btrfs_search_slot(trans, root, &file_key, path,
181
				BTRFS_CRC32_SIZE, 1);
182 183 184
	if (ret < 0)
		goto fail;
	if (ret == 0) {
C
Chris Mason 已提交
185
		BUG();
186 187 188 189 190
	}
	if (path->slots[0] == 0) {
		goto insert;
	}
	path->slots[0]--;
191 192
	leaf = path->nodes[0];
	btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
193 194 195 196 197 198 199
	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;
	}
200
	if (csum_offset >= btrfs_item_size_nr(leaf, path->slots[0]) /
201 202
	    BTRFS_CRC32_SIZE) {
		u32 diff = (csum_offset + 1) * BTRFS_CRC32_SIZE;
203
		diff = diff - btrfs_item_size_nr(leaf, path->slots[0]);
C
Chris Mason 已提交
204 205
		if (diff != BTRFS_CRC32_SIZE)
			goto insert;
206
		ret = btrfs_extend_item(trans, root, path, diff);
207 208 209 210 211
		BUG_ON(ret);
		goto csum;
	}

insert:
212
	btrfs_release_path(root, path);
213
	csum_offset = 0;
214
	ret = btrfs_insert_empty_item(trans, root, path, &file_key,
215
				      BTRFS_CRC32_SIZE);
216 217
	if (ret < 0)
		goto fail;
218 219
	if (ret != 0) {
		WARN_ON(1);
C
Chris Mason 已提交
220
		goto fail;
221
	}
222
csum:
223 224
	leaf = path->nodes[0];
	item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_csum_item);
C
Chris Mason 已提交
225
	ret = 0;
226 227
	item = (struct btrfs_csum_item *)((unsigned char *)item +
					  csum_offset * BTRFS_CRC32_SIZE);
C
Chris Mason 已提交
228
found:
229
	/* FIXME!!!!!!!!!!!! */
230
	ret = btrfs_csum_data(root, data, len, &item->csum);
231
	btrfs_mark_buffer_dirty(path->nodes[0]);
C
Chris Mason 已提交
232
fail:
233 234
	btrfs_release_path(root, path);
	btrfs_free_path(path);
C
Chris Mason 已提交
235
	return ret;
236
#endif
C
Chris Mason 已提交
237 238
}

C
Chris Mason 已提交
239 240 241 242 243
int btrfs_csum_truncate(struct btrfs_trans_handle *trans,
			struct btrfs_root *root, struct btrfs_path *path,
			u64 isize)
{
	struct btrfs_key key;
244
	struct extent_buffer *leaf = path->nodes[0];
C
Chris Mason 已提交
245 246 247 248 249 250
	int slot = path->slots[0];
	int ret;
	u32 new_item_size;
	u64 new_item_span;
	u64 blocks;

251
	btrfs_item_key_to_cpu(leaf, &key, slot);
C
Chris Mason 已提交
252 253 254
	if (isize <= key.offset)
		return 0;
	new_item_span = isize - key.offset;
255
	blocks = (new_item_span + root->sectorsize - 1) >>
C
Chris Mason 已提交
256
		root->fs_info->sb->s_blocksize_bits;
C
Chris Mason 已提交
257
	new_item_size = blocks * BTRFS_CRC32_SIZE;
258
	if (new_item_size >= btrfs_item_size_nr(leaf, slot))
C
Chris Mason 已提交
259 260 261 262 263 264
		return 0;
	ret = btrfs_truncate_item(trans, root, path, new_item_size);
	BUG_ON(ret);
	return ret;
}