]>
Commit | Line | Data |
---|---|---|
e20d96d6 CM |
1 | #include <linux/module.h> |
2 | #include <linux/fs.h> | |
d98237b3 | 3 | #include <linux/blkdev.h> |
87cbda5c CM |
4 | #include <linux/crypto.h> |
5 | #include <linux/scatterlist.h> | |
22b0ebda | 6 | #include <linux/swap.h> |
0f7d52f4 | 7 | #include <linux/radix-tree.h> |
eb60ceac CM |
8 | #include "ctree.h" |
9 | #include "disk-io.h" | |
e089f05c | 10 | #include "transaction.h" |
0f7d52f4 | 11 | #include "btrfs_inode.h" |
eb60ceac | 12 | |
7eccb903 CM |
13 | struct dev_lookup { |
14 | u64 block_start; | |
15 | u64 num_blocks; | |
b4100d64 | 16 | u64 device_id; |
7eccb903 CM |
17 | struct block_device *bdev; |
18 | }; | |
19 | ||
8352d8a4 CM |
20 | int btrfs_insert_dev_radix(struct btrfs_root *root, |
21 | struct block_device *bdev, | |
b4100d64 | 22 | u64 device_id, |
8352d8a4 CM |
23 | u64 block_start, |
24 | u64 num_blocks) | |
25 | { | |
26 | struct dev_lookup *lookup; | |
8352d8a4 CM |
27 | int ret; |
28 | ||
29 | lookup = kmalloc(sizeof(*lookup), GFP_NOFS); | |
30 | if (!lookup) | |
31 | return -ENOMEM; | |
32 | lookup->block_start = block_start; | |
33 | lookup->num_blocks = num_blocks; | |
34 | lookup->bdev = bdev; | |
b4100d64 | 35 | lookup->device_id = device_id; |
8352d8a4 CM |
36 | |
37 | ret = radix_tree_insert(&root->fs_info->dev_radix, block_start + | |
38 | num_blocks - 1, lookup); | |
39 | return ret; | |
40 | } | |
41 | ||
7eccb903 CM |
42 | u64 bh_blocknr(struct buffer_head *bh) |
43 | { | |
44 | int blkbits = bh->b_page->mapping->host->i_blkbits; | |
45 | u64 blocknr = bh->b_page->index << (PAGE_CACHE_SHIFT - blkbits); | |
46 | unsigned long offset; | |
47 | ||
48 | if (PageHighMem(bh->b_page)) | |
49 | offset = (unsigned long)bh->b_data; | |
50 | else | |
51 | offset = bh->b_data - (char *)page_address(bh->b_page); | |
52 | blocknr += offset >> (PAGE_CACHE_SHIFT - blkbits); | |
53 | return blocknr; | |
54 | } | |
55 | ||
e20d96d6 | 56 | static int check_tree_block(struct btrfs_root *root, struct buffer_head *buf) |
eb60ceac | 57 | { |
e20d96d6 | 58 | struct btrfs_node *node = btrfs_buffer_node(buf); |
7eccb903 | 59 | if (bh_blocknr(buf) != btrfs_header_blocknr(&node->header)) { |
8352d8a4 CM |
60 | printk(KERN_CRIT "bh_blocknr(buf) is %Lu, header is %Lu\n", |
61 | bh_blocknr(buf), btrfs_header_blocknr(&node->header)); | |
9a8dd150 | 62 | BUG(); |
d98237b3 | 63 | } |
9a8dd150 | 64 | return 0; |
eb60ceac CM |
65 | } |
66 | ||
d98237b3 CM |
67 | struct buffer_head *btrfs_find_tree_block(struct btrfs_root *root, u64 blocknr) |
68 | { | |
69 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; | |
70 | int blockbits = root->fs_info->sb->s_blocksize_bits; | |
71 | unsigned long index = blocknr >> (PAGE_CACHE_SHIFT - blockbits); | |
72 | struct page *page; | |
73 | struct buffer_head *bh; | |
74 | struct buffer_head *head; | |
75 | struct buffer_head *ret = NULL; | |
76 | ||
2c90e5d6 | 77 | |
d98237b3 CM |
78 | page = find_lock_page(mapping, index); |
79 | if (!page) | |
80 | return NULL; | |
81 | ||
82 | if (!page_has_buffers(page)) | |
83 | goto out_unlock; | |
84 | ||
85 | head = page_buffers(page); | |
86 | bh = head; | |
87 | do { | |
7eccb903 | 88 | if (buffer_mapped(bh) && bh_blocknr(bh) == blocknr) { |
d98237b3 CM |
89 | ret = bh; |
90 | get_bh(bh); | |
91 | goto out_unlock; | |
92 | } | |
93 | bh = bh->b_this_page; | |
94 | } while (bh != head); | |
95 | out_unlock: | |
96 | unlock_page(page); | |
d6025579 | 97 | if (ret) { |
22b0ebda | 98 | touch_buffer(ret); |
d6025579 | 99 | } |
d98237b3 CM |
100 | page_cache_release(page); |
101 | return ret; | |
102 | } | |
103 | ||
8352d8a4 | 104 | int btrfs_map_bh_to_logical(struct btrfs_root *root, struct buffer_head *bh, |
7eccb903 CM |
105 | u64 logical) |
106 | { | |
107 | struct dev_lookup *lookup[2]; | |
7eccb903 CM |
108 | |
109 | int ret; | |
110 | ||
236454df CM |
111 | if (logical == 0) { |
112 | bh->b_bdev = NULL; | |
113 | bh->b_blocknr = 0; | |
114 | set_buffer_mapped(bh); | |
115 | return 0; | |
116 | } | |
7eccb903 CM |
117 | root = root->fs_info->dev_root; |
118 | ret = radix_tree_gang_lookup(&root->fs_info->dev_radix, | |
119 | (void **)lookup, | |
120 | (unsigned long)logical, | |
121 | ARRAY_SIZE(lookup)); | |
122 | if (ret == 0 || lookup[0]->block_start > logical || | |
123 | lookup[0]->block_start + lookup[0]->num_blocks <= logical) { | |
124 | ret = -ENOENT; | |
125 | goto out; | |
126 | } | |
127 | bh->b_bdev = lookup[0]->bdev; | |
128 | bh->b_blocknr = logical - lookup[0]->block_start; | |
7eccb903 CM |
129 | set_buffer_mapped(bh); |
130 | ret = 0; | |
131 | out: | |
132 | return ret; | |
133 | } | |
134 | ||
d98237b3 CM |
135 | struct buffer_head *btrfs_find_create_tree_block(struct btrfs_root *root, |
136 | u64 blocknr) | |
137 | { | |
138 | struct address_space *mapping = root->fs_info->btree_inode->i_mapping; | |
139 | int blockbits = root->fs_info->sb->s_blocksize_bits; | |
140 | unsigned long index = blocknr >> (PAGE_CACHE_SHIFT - blockbits); | |
141 | struct page *page; | |
142 | struct buffer_head *bh; | |
143 | struct buffer_head *head; | |
144 | struct buffer_head *ret = NULL; | |
7eccb903 | 145 | int err; |
d98237b3 | 146 | u64 first_block = index << (PAGE_CACHE_SHIFT - blockbits); |
22b0ebda | 147 | |
d98237b3 CM |
148 | page = grab_cache_page(mapping, index); |
149 | if (!page) | |
150 | return NULL; | |
151 | ||
d98237b3 CM |
152 | if (!page_has_buffers(page)) |
153 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, 0); | |
154 | head = page_buffers(page); | |
155 | bh = head; | |
156 | do { | |
157 | if (!buffer_mapped(bh)) { | |
8352d8a4 | 158 | err = btrfs_map_bh_to_logical(root, bh, first_block); |
7eccb903 | 159 | BUG_ON(err); |
d98237b3 | 160 | } |
7eccb903 | 161 | if (bh_blocknr(bh) == blocknr) { |
d98237b3 CM |
162 | ret = bh; |
163 | get_bh(bh); | |
164 | goto out_unlock; | |
165 | } | |
166 | bh = bh->b_this_page; | |
167 | first_block++; | |
168 | } while (bh != head); | |
169 | out_unlock: | |
170 | unlock_page(page); | |
22b0ebda CM |
171 | if (ret) |
172 | touch_buffer(ret); | |
d98237b3 CM |
173 | page_cache_release(page); |
174 | return ret; | |
175 | } | |
176 | ||
d98237b3 CM |
177 | static int btree_get_block(struct inode *inode, sector_t iblock, |
178 | struct buffer_head *bh, int create) | |
179 | { | |
7eccb903 CM |
180 | int err; |
181 | struct btrfs_root *root = BTRFS_I(bh->b_page->mapping->host)->root; | |
8352d8a4 | 182 | err = btrfs_map_bh_to_logical(root, bh, iblock); |
7eccb903 | 183 | return err; |
d98237b3 CM |
184 | } |
185 | ||
f254e52c CM |
186 | int btrfs_csum_data(struct btrfs_root * root, char *data, size_t len, |
187 | char *result) | |
87cbda5c | 188 | { |
87cbda5c CM |
189 | struct scatterlist sg; |
190 | struct crypto_hash *tfm = root->fs_info->hash_tfm; | |
191 | struct hash_desc desc; | |
192 | int ret; | |
87cbda5c CM |
193 | |
194 | desc.tfm = tfm; | |
195 | desc.flags = 0; | |
f254e52c | 196 | sg_init_one(&sg, data, len); |
87cbda5c | 197 | spin_lock(&root->fs_info->hash_lock); |
22b0ebda | 198 | ret = crypto_hash_digest(&desc, &sg, 1, result); |
87cbda5c CM |
199 | spin_unlock(&root->fs_info->hash_lock); |
200 | if (ret) { | |
201 | printk("sha256 digest failed\n"); | |
202 | } | |
f254e52c CM |
203 | return ret; |
204 | } | |
205 | static int csum_tree_block(struct btrfs_root *root, struct buffer_head *bh, | |
206 | int verify) | |
207 | { | |
208 | char result[BTRFS_CSUM_SIZE]; | |
209 | int ret; | |
210 | struct btrfs_node *node; | |
211 | ||
212 | ret = btrfs_csum_data(root, bh->b_data + BTRFS_CSUM_SIZE, | |
213 | bh->b_size - BTRFS_CSUM_SIZE, result); | |
214 | if (ret) | |
215 | return ret; | |
87cbda5c | 216 | if (verify) { |
f254e52c | 217 | if (memcmp(bh->b_data, result, BTRFS_CSUM_SIZE)) { |
7eccb903 CM |
218 | printk("checksum verify failed on %Lu\n", |
219 | bh_blocknr(bh)); | |
f254e52c CM |
220 | return 1; |
221 | } | |
222 | } else { | |
223 | node = btrfs_buffer_node(bh); | |
22b0ebda | 224 | memcpy(node->header.csum, result, BTRFS_CSUM_SIZE); |
f254e52c | 225 | } |
87cbda5c CM |
226 | return 0; |
227 | } | |
228 | ||
d98237b3 | 229 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
ed2ff2cb | 230 | { |
87cbda5c | 231 | struct buffer_head *bh; |
0f7d52f4 | 232 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
87cbda5c | 233 | struct buffer_head *head; |
87cbda5c CM |
234 | if (!page_has_buffers(page)) { |
235 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, | |
236 | (1 << BH_Dirty)|(1 << BH_Uptodate)); | |
237 | } | |
238 | head = page_buffers(page); | |
239 | bh = head; | |
240 | do { | |
241 | if (buffer_dirty(bh)) | |
242 | csum_tree_block(root, bh, 0); | |
243 | bh = bh->b_this_page; | |
244 | } while (bh != head); | |
d98237b3 | 245 | return block_write_full_page(page, btree_get_block, wbc); |
ed2ff2cb CM |
246 | } |
247 | ||
d98237b3 | 248 | static int btree_readpage(struct file * file, struct page * page) |
eb60ceac | 249 | { |
d98237b3 | 250 | return block_read_full_page(page, btree_get_block); |
eb60ceac CM |
251 | } |
252 | ||
d98237b3 CM |
253 | static struct address_space_operations btree_aops = { |
254 | .readpage = btree_readpage, | |
255 | .writepage = btree_writepage, | |
256 | .sync_page = block_sync_page, | |
257 | }; | |
258 | ||
e20d96d6 | 259 | struct buffer_head *read_tree_block(struct btrfs_root *root, u64 blocknr) |
eb60ceac | 260 | { |
d98237b3 | 261 | struct buffer_head *bh = NULL; |
eb60ceac | 262 | |
d98237b3 CM |
263 | bh = btrfs_find_create_tree_block(root, blocknr); |
264 | if (!bh) | |
265 | return bh; | |
9d64272c CM |
266 | if (buffer_uptodate(bh)) |
267 | goto uptodate; | |
d98237b3 CM |
268 | lock_buffer(bh); |
269 | if (!buffer_uptodate(bh)) { | |
270 | get_bh(bh); | |
271 | bh->b_end_io = end_buffer_read_sync; | |
272 | submit_bh(READ, bh); | |
273 | wait_on_buffer(bh); | |
274 | if (!buffer_uptodate(bh)) | |
275 | goto fail; | |
87cbda5c | 276 | csum_tree_block(root, bh, 1); |
d98237b3 CM |
277 | } else { |
278 | unlock_buffer(bh); | |
279 | } | |
9d64272c | 280 | uptodate: |
d98237b3 | 281 | if (check_tree_block(root, bh)) |
cfaa7295 | 282 | BUG(); |
d98237b3 CM |
283 | return bh; |
284 | fail: | |
285 | brelse(bh); | |
286 | return NULL; | |
eb60ceac CM |
287 | } |
288 | ||
e089f05c | 289 | int dirty_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
e20d96d6 | 290 | struct buffer_head *buf) |
ed2ff2cb | 291 | { |
d6025579 | 292 | WARN_ON(atomic_read(&buf->b_count) == 0); |
e20d96d6 | 293 | mark_buffer_dirty(buf); |
ed2ff2cb CM |
294 | return 0; |
295 | } | |
296 | ||
e089f05c | 297 | int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
e20d96d6 | 298 | struct buffer_head *buf) |
ed2ff2cb | 299 | { |
d6025579 | 300 | WARN_ON(atomic_read(&buf->b_count) == 0); |
e20d96d6 | 301 | clear_buffer_dirty(buf); |
ed2ff2cb CM |
302 | return 0; |
303 | } | |
304 | ||
2c90e5d6 | 305 | static int __setup_root(int blocksize, |
9f5fae2f CM |
306 | struct btrfs_root *root, |
307 | struct btrfs_fs_info *fs_info, | |
e20d96d6 | 308 | u64 objectid) |
d97e63b6 | 309 | { |
cfaa7295 | 310 | root->node = NULL; |
0f7d52f4 | 311 | root->inode = NULL; |
a28ec197 | 312 | root->commit_root = NULL; |
2c90e5d6 | 313 | root->blocksize = blocksize; |
123abc88 | 314 | root->ref_cows = 0; |
9f5fae2f | 315 | root->fs_info = fs_info; |
0f7d52f4 CM |
316 | root->objectid = objectid; |
317 | root->last_trans = 0; | |
1b05da2e CM |
318 | root->highest_inode = 0; |
319 | root->last_inode_alloc = 0; | |
3768f368 CM |
320 | memset(&root->root_key, 0, sizeof(root->root_key)); |
321 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
4d775673 | 322 | root->root_key.objectid = objectid; |
3768f368 CM |
323 | return 0; |
324 | } | |
325 | ||
2c90e5d6 | 326 | static int find_and_setup_root(int blocksize, |
9f5fae2f CM |
327 | struct btrfs_root *tree_root, |
328 | struct btrfs_fs_info *fs_info, | |
329 | u64 objectid, | |
e20d96d6 | 330 | struct btrfs_root *root) |
3768f368 CM |
331 | { |
332 | int ret; | |
333 | ||
2c90e5d6 | 334 | __setup_root(blocksize, root, fs_info, objectid); |
3768f368 CM |
335 | ret = btrfs_find_last_root(tree_root, objectid, |
336 | &root->root_item, &root->root_key); | |
337 | BUG_ON(ret); | |
338 | ||
339 | root->node = read_tree_block(root, | |
340 | btrfs_root_blocknr(&root->root_item)); | |
3768f368 | 341 | BUG_ON(!root->node); |
d97e63b6 CM |
342 | return 0; |
343 | } | |
344 | ||
0f7d52f4 CM |
345 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info, |
346 | struct btrfs_key *location) | |
347 | { | |
348 | struct btrfs_root *root; | |
349 | struct btrfs_root *tree_root = fs_info->tree_root; | |
350 | struct btrfs_path *path; | |
351 | struct btrfs_leaf *l; | |
1b05da2e | 352 | u64 highest_inode; |
0f7d52f4 CM |
353 | int ret = 0; |
354 | ||
355 | printk("read_fs_root looking for %Lu %Lu %u\n", location->objectid, location->offset, location->flags); | |
2619ba1f CM |
356 | root = radix_tree_lookup(&fs_info->fs_roots_radix, |
357 | (unsigned long)location->objectid); | |
358 | if (root) { | |
359 | printk("found %p in cache\n", root); | |
360 | return root; | |
361 | } | |
0f7d52f4 CM |
362 | root = kmalloc(sizeof(*root), GFP_NOFS); |
363 | if (!root) { | |
364 | printk("failed1\n"); | |
365 | return ERR_PTR(-ENOMEM); | |
366 | } | |
367 | if (location->offset == (u64)-1) { | |
368 | ret = find_and_setup_root(fs_info->sb->s_blocksize, | |
369 | fs_info->tree_root, fs_info, | |
370 | location->objectid, root); | |
371 | if (ret) { | |
372 | printk("failed2\n"); | |
373 | kfree(root); | |
374 | return ERR_PTR(ret); | |
375 | } | |
376 | goto insert; | |
377 | } | |
378 | ||
379 | __setup_root(fs_info->sb->s_blocksize, root, fs_info, | |
380 | location->objectid); | |
381 | ||
382 | path = btrfs_alloc_path(); | |
383 | BUG_ON(!path); | |
384 | ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0); | |
385 | if (ret != 0) { | |
386 | printk("internal search_slot gives us %d\n", ret); | |
387 | if (ret > 0) | |
388 | ret = -ENOENT; | |
389 | goto out; | |
390 | } | |
391 | l = btrfs_buffer_leaf(path->nodes[0]); | |
392 | memcpy(&root->root_item, | |
393 | btrfs_item_ptr(l, path->slots[0], struct btrfs_root_item), | |
394 | sizeof(root->root_item)); | |
395 | memcpy(&root->root_key, location, sizeof(*location)); | |
396 | ret = 0; | |
397 | out: | |
398 | btrfs_release_path(root, path); | |
399 | btrfs_free_path(path); | |
400 | if (ret) { | |
401 | kfree(root); | |
402 | return ERR_PTR(ret); | |
403 | } | |
404 | root->node = read_tree_block(root, | |
405 | btrfs_root_blocknr(&root->root_item)); | |
406 | BUG_ON(!root->node); | |
407 | insert: | |
408 | printk("inserting %p\n", root); | |
409 | root->ref_cows = 1; | |
2619ba1f CM |
410 | ret = radix_tree_insert(&fs_info->fs_roots_radix, |
411 | (unsigned long)root->root_key.objectid, | |
0f7d52f4 CM |
412 | root); |
413 | if (ret) { | |
414 | printk("radix_tree_insert gives us %d\n", ret); | |
415 | brelse(root->node); | |
416 | kfree(root); | |
417 | return ERR_PTR(ret); | |
418 | } | |
1b05da2e CM |
419 | ret = btrfs_find_highest_inode(root, &highest_inode); |
420 | if (ret == 0) { | |
421 | root->highest_inode = highest_inode; | |
422 | root->last_inode_alloc = highest_inode; | |
423 | printk("highest inode is %Lu\n", highest_inode); | |
424 | } | |
0f7d52f4 CM |
425 | printk("all worked\n"); |
426 | return root; | |
427 | } | |
428 | ||
b4100d64 CM |
429 | static int btrfs_open_disk(struct btrfs_root *root, u64 device_id, |
430 | u64 block_start, u64 num_blocks, | |
431 | char *filename, int name_len) | |
8352d8a4 CM |
432 | { |
433 | char *null_filename; | |
434 | struct block_device *bdev; | |
435 | int ret; | |
436 | ||
8352d8a4 CM |
437 | null_filename = kmalloc(name_len + 1, GFP_NOFS); |
438 | if (!null_filename) | |
439 | return -ENOMEM; | |
440 | memcpy(null_filename, filename, name_len); | |
441 | null_filename[name_len] = '\0'; | |
442 | ||
443 | bdev = open_bdev_excl(null_filename, O_RDWR, root->fs_info->sb); | |
444 | if (IS_ERR(bdev)) { | |
445 | ret = PTR_ERR(bdev); | |
446 | goto out; | |
447 | } | |
448 | set_blocksize(bdev, root->fs_info->sb->s_blocksize); | |
b4100d64 CM |
449 | ret = btrfs_insert_dev_radix(root, bdev, device_id, |
450 | block_start, num_blocks); | |
8352d8a4 CM |
451 | BUG_ON(ret); |
452 | ret = 0; | |
453 | out: | |
454 | kfree(null_filename); | |
455 | return ret; | |
456 | } | |
457 | ||
458 | static int read_device_info(struct btrfs_root *root) | |
459 | { | |
460 | struct btrfs_path *path; | |
461 | int ret; | |
462 | struct btrfs_key key; | |
463 | struct btrfs_leaf *leaf; | |
464 | struct btrfs_device_item *dev_item; | |
465 | int nritems; | |
466 | int slot; | |
467 | ||
468 | root = root->fs_info->dev_root; | |
469 | ||
470 | path = btrfs_alloc_path(); | |
471 | if (!path) | |
472 | return -ENOMEM; | |
473 | key.objectid = 0; | |
474 | key.offset = 0; | |
475 | key.flags = 0; | |
476 | btrfs_set_key_type(&key, BTRFS_DEV_ITEM_KEY); | |
477 | ||
478 | mutex_lock(&root->fs_info->fs_mutex); | |
479 | ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); | |
480 | leaf = btrfs_buffer_leaf(path->nodes[0]); | |
481 | nritems = btrfs_header_nritems(&leaf->header); | |
482 | while(1) { | |
483 | slot = path->slots[0]; | |
484 | if (slot >= nritems) { | |
485 | ret = btrfs_next_leaf(root, path); | |
486 | if (ret) | |
487 | break; | |
488 | leaf = btrfs_buffer_leaf(path->nodes[0]); | |
489 | nritems = btrfs_header_nritems(&leaf->header); | |
490 | slot = path->slots[0]; | |
491 | } | |
492 | btrfs_disk_key_to_cpu(&key, &leaf->items[slot].key); | |
493 | if (btrfs_key_type(&key) != BTRFS_DEV_ITEM_KEY) { | |
494 | path->slots[0]++; | |
495 | continue; | |
496 | } | |
497 | dev_item = btrfs_item_ptr(leaf, slot, struct btrfs_device_item); | |
498 | printk("found key %Lu %Lu\n", key.objectid, key.offset); | |
b4100d64 CM |
499 | if (btrfs_device_id(dev_item) != |
500 | btrfs_super_device_id(root->fs_info->disk_super)) { | |
501 | ret = btrfs_open_disk(root, btrfs_device_id(dev_item), | |
502 | key.objectid, key.offset, | |
503 | (char *)(dev_item + 1), | |
504 | btrfs_device_pathlen(dev_item)); | |
505 | BUG_ON(ret); | |
506 | } | |
8352d8a4 CM |
507 | path->slots[0]++; |
508 | } | |
509 | btrfs_free_path(path); | |
510 | mutex_unlock(&root->fs_info->fs_mutex); | |
511 | return 0; | |
512 | } | |
513 | ||
2c90e5d6 | 514 | struct btrfs_root *open_ctree(struct super_block *sb) |
2e635a27 | 515 | { |
e20d96d6 CM |
516 | struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root), |
517 | GFP_NOFS); | |
0bd93ba0 CM |
518 | struct btrfs_root *dev_root = kmalloc(sizeof(struct btrfs_root), |
519 | GFP_NOFS); | |
e20d96d6 CM |
520 | struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root), |
521 | GFP_NOFS); | |
e20d96d6 CM |
522 | struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info), |
523 | GFP_NOFS); | |
eb60ceac | 524 | int ret; |
2c90e5d6 | 525 | struct btrfs_super_block *disk_super; |
7eccb903 | 526 | struct dev_lookup *dev_lookup; |
eb60ceac | 527 | |
8ef97622 CM |
528 | init_bit_radix(&fs_info->pinned_radix); |
529 | init_bit_radix(&fs_info->pending_del_radix); | |
0f7d52f4 | 530 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS); |
7eccb903 | 531 | INIT_RADIX_TREE(&fs_info->dev_radix, GFP_NOFS); |
8fd17795 | 532 | INIT_LIST_HEAD(&fs_info->trans_list); |
2c90e5d6 | 533 | sb_set_blocksize(sb, 4096); |
9f5fae2f | 534 | fs_info->running_transaction = NULL; |
9f5fae2f CM |
535 | fs_info->tree_root = tree_root; |
536 | fs_info->extent_root = extent_root; | |
0bd93ba0 | 537 | fs_info->dev_root = dev_root; |
e20d96d6 | 538 | fs_info->sb = sb; |
d98237b3 CM |
539 | fs_info->btree_inode = new_inode(sb); |
540 | fs_info->btree_inode->i_ino = 1; | |
2c90e5d6 | 541 | fs_info->btree_inode->i_nlink = 1; |
d98237b3 CM |
542 | fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size; |
543 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; | |
e66f709b | 544 | fs_info->do_barriers = 1; |
f2458e1d CM |
545 | fs_info->extent_tree_insert_nr = 0; |
546 | fs_info->extent_tree_prealloc_nr = 0; | |
0f7d52f4 CM |
547 | BTRFS_I(fs_info->btree_inode)->root = tree_root; |
548 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, | |
549 | sizeof(struct btrfs_key)); | |
22b0ebda | 550 | insert_inode_hash(fs_info->btree_inode); |
d98237b3 | 551 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
87cbda5c | 552 | fs_info->hash_tfm = crypto_alloc_hash("sha256", 0, CRYPTO_ALG_ASYNC); |
30ae8467 | 553 | spin_lock_init(&fs_info->hash_lock); |
30ae8467 | 554 | if (!fs_info->hash_tfm || IS_ERR(fs_info->hash_tfm)) { |
87cbda5c CM |
555 | printk("failed to allocate sha256 hash\n"); |
556 | return NULL; | |
557 | } | |
79154b1b | 558 | mutex_init(&fs_info->trans_mutex); |
d561c025 | 559 | mutex_init(&fs_info->fs_mutex); |
9f5fae2f | 560 | memset(&fs_info->last_insert, 0, sizeof(fs_info->last_insert)); |
3768f368 | 561 | |
0bd93ba0 CM |
562 | __setup_root(sb->s_blocksize, dev_root, |
563 | fs_info, BTRFS_DEV_TREE_OBJECTID); | |
564 | ||
2c90e5d6 CM |
565 | __setup_root(sb->s_blocksize, tree_root, |
566 | fs_info, BTRFS_ROOT_TREE_OBJECTID); | |
7eccb903 CM |
567 | |
568 | dev_lookup = kmalloc(sizeof(*dev_lookup), GFP_NOFS); | |
569 | dev_lookup->block_start = 0; | |
570 | dev_lookup->num_blocks = (u32)-2; | |
571 | dev_lookup->bdev = sb->s_bdev; | |
b4100d64 | 572 | dev_lookup->device_id = 0; |
7eccb903 CM |
573 | ret = radix_tree_insert(&fs_info->dev_radix, (u32)-2, dev_lookup); |
574 | BUG_ON(ret); | |
2c90e5d6 CM |
575 | fs_info->sb_buffer = read_tree_block(tree_root, |
576 | BTRFS_SUPER_INFO_OFFSET / | |
577 | sb->s_blocksize); | |
d98237b3 | 578 | |
0f7d52f4 | 579 | if (!fs_info->sb_buffer) |
d98237b3 | 580 | return NULL; |
d98237b3 | 581 | disk_super = (struct btrfs_super_block *)fs_info->sb_buffer->b_data; |
0f7d52f4 | 582 | if (!btrfs_super_root(disk_super)) |
2c90e5d6 | 583 | return NULL; |
0f7d52f4 | 584 | |
8352d8a4 CM |
585 | i_size_write(fs_info->btree_inode, |
586 | btrfs_super_total_blocks(disk_super) << | |
587 | fs_info->btree_inode->i_blkbits); | |
588 | ||
7eccb903 CM |
589 | radix_tree_delete(&fs_info->dev_radix, (u32)-2); |
590 | dev_lookup->block_start = btrfs_super_device_block_start(disk_super); | |
591 | dev_lookup->num_blocks = btrfs_super_device_num_blocks(disk_super); | |
b4100d64 CM |
592 | dev_lookup->device_id = btrfs_super_device_id(disk_super); |
593 | ||
7eccb903 CM |
594 | ret = radix_tree_insert(&fs_info->dev_radix, |
595 | dev_lookup->block_start + | |
8352d8a4 | 596 | dev_lookup->num_blocks - 1, dev_lookup); |
7eccb903 CM |
597 | BUG_ON(ret); |
598 | ||
d98237b3 | 599 | fs_info->disk_super = disk_super; |
8352d8a4 | 600 | |
0bd93ba0 CM |
601 | dev_root->node = read_tree_block(tree_root, |
602 | btrfs_super_device_root(disk_super)); | |
8352d8a4 CM |
603 | |
604 | ret = read_device_info(dev_root); | |
605 | BUG_ON(ret); | |
606 | ||
e20d96d6 CM |
607 | tree_root->node = read_tree_block(tree_root, |
608 | btrfs_super_root(disk_super)); | |
3768f368 CM |
609 | BUG_ON(!tree_root->node); |
610 | ||
2c90e5d6 CM |
611 | mutex_lock(&fs_info->fs_mutex); |
612 | ret = find_and_setup_root(sb->s_blocksize, tree_root, fs_info, | |
e20d96d6 | 613 | BTRFS_EXTENT_TREE_OBJECTID, extent_root); |
3768f368 CM |
614 | BUG_ON(ret); |
615 | ||
0f7d52f4 | 616 | fs_info->generation = btrfs_super_generation(disk_super) + 1; |
d6e4a428 CM |
617 | memset(&fs_info->kobj, 0, sizeof(fs_info->kobj)); |
618 | kobj_set_kset_s(fs_info, btrfs_subsys); | |
619 | kobject_set_name(&fs_info->kobj, "%s", sb->s_id); | |
620 | kobject_register(&fs_info->kobj); | |
5be6f7f1 | 621 | mutex_unlock(&fs_info->fs_mutex); |
0f7d52f4 | 622 | return tree_root; |
eb60ceac CM |
623 | } |
624 | ||
e089f05c | 625 | int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root |
79154b1b | 626 | *root) |
eb60ceac | 627 | { |
e66f709b | 628 | int ret; |
d5719762 | 629 | struct buffer_head *bh = root->fs_info->sb_buffer; |
2c90e5d6 | 630 | |
d5719762 | 631 | btrfs_set_super_root(root->fs_info->disk_super, |
7eccb903 | 632 | bh_blocknr(root->fs_info->tree_root->node)); |
d5719762 | 633 | lock_buffer(bh); |
2c90e5d6 | 634 | WARN_ON(atomic_read(&bh->b_count) < 1); |
d5719762 | 635 | clear_buffer_dirty(bh); |
87cbda5c | 636 | csum_tree_block(root, bh, 0); |
d5719762 CM |
637 | bh->b_end_io = end_buffer_write_sync; |
638 | get_bh(bh); | |
e66f709b CM |
639 | if (root->fs_info->do_barriers) |
640 | ret = submit_bh(WRITE_BARRIER, bh); | |
641 | else | |
642 | ret = submit_bh(WRITE, bh); | |
643 | if (ret == -EOPNOTSUPP) { | |
644 | set_buffer_uptodate(bh); | |
645 | root->fs_info->do_barriers = 0; | |
646 | ret = submit_bh(WRITE, bh); | |
647 | } | |
d5719762 CM |
648 | wait_on_buffer(bh); |
649 | if (!buffer_uptodate(bh)) { | |
650 | WARN_ON(1); | |
651 | return -EIO; | |
cfaa7295 CM |
652 | } |
653 | return 0; | |
654 | } | |
655 | ||
2619ba1f CM |
656 | static int free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
657 | { | |
658 | radix_tree_delete(&fs_info->fs_roots_radix, | |
659 | (unsigned long)root->root_key.objectid); | |
660 | if (root->inode) | |
661 | iput(root->inode); | |
662 | if (root->node) | |
663 | brelse(root->node); | |
664 | if (root->commit_root) | |
665 | brelse(root->commit_root); | |
666 | kfree(root); | |
667 | return 0; | |
668 | } | |
669 | ||
0f7d52f4 CM |
670 | int del_fs_roots(struct btrfs_fs_info *fs_info) |
671 | { | |
672 | int ret; | |
673 | struct btrfs_root *gang[8]; | |
674 | int i; | |
675 | ||
676 | while(1) { | |
677 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
678 | (void **)gang, 0, | |
679 | ARRAY_SIZE(gang)); | |
680 | if (!ret) | |
681 | break; | |
2619ba1f CM |
682 | for (i = 0; i < ret; i++) |
683 | free_fs_root(fs_info, gang[i]); | |
0f7d52f4 CM |
684 | } |
685 | return 0; | |
686 | } | |
b4100d64 | 687 | |
7eccb903 CM |
688 | static int free_dev_radix(struct btrfs_fs_info *fs_info) |
689 | { | |
690 | struct dev_lookup *lookup[8]; | |
691 | struct block_device *super_bdev = fs_info->sb->s_bdev; | |
692 | int ret; | |
693 | int i; | |
694 | while(1) { | |
695 | ret = radix_tree_gang_lookup(&fs_info->dev_radix, | |
696 | (void **)lookup, 0, | |
697 | ARRAY_SIZE(lookup)); | |
698 | if (!ret) | |
699 | break; | |
700 | for (i = 0; i < ret; i++) { | |
701 | if (lookup[i]->bdev != super_bdev) | |
702 | close_bdev_excl(lookup[i]->bdev); | |
703 | radix_tree_delete(&fs_info->dev_radix, | |
704 | lookup[i]->block_start + | |
8352d8a4 | 705 | lookup[i]->num_blocks - 1); |
7eccb903 CM |
706 | kfree(lookup[i]); |
707 | } | |
708 | } | |
709 | return 0; | |
710 | } | |
0f7d52f4 | 711 | |
e20d96d6 | 712 | int close_ctree(struct btrfs_root *root) |
cfaa7295 | 713 | { |
3768f368 | 714 | int ret; |
e089f05c | 715 | struct btrfs_trans_handle *trans; |
0f7d52f4 | 716 | struct btrfs_fs_info *fs_info = root->fs_info; |
e089f05c | 717 | |
0f7d52f4 | 718 | mutex_lock(&fs_info->fs_mutex); |
79154b1b CM |
719 | trans = btrfs_start_transaction(root, 1); |
720 | btrfs_commit_transaction(trans, root); | |
721 | /* run commit again to drop the original snapshot */ | |
722 | trans = btrfs_start_transaction(root, 1); | |
723 | btrfs_commit_transaction(trans, root); | |
724 | ret = btrfs_write_and_wait_transaction(NULL, root); | |
3768f368 | 725 | BUG_ON(ret); |
79154b1b | 726 | write_ctree_super(NULL, root); |
0f7d52f4 CM |
727 | mutex_unlock(&fs_info->fs_mutex); |
728 | ||
729 | if (fs_info->extent_root->node) | |
730 | btrfs_block_release(fs_info->extent_root, | |
731 | fs_info->extent_root->node); | |
0bd93ba0 CM |
732 | if (fs_info->dev_root->node) |
733 | btrfs_block_release(fs_info->dev_root, | |
734 | fs_info->dev_root->node); | |
0f7d52f4 CM |
735 | if (fs_info->tree_root->node) |
736 | btrfs_block_release(fs_info->tree_root, | |
737 | fs_info->tree_root->node); | |
738 | btrfs_block_release(root, fs_info->sb_buffer); | |
739 | crypto_free_hash(fs_info->hash_tfm); | |
740 | truncate_inode_pages(fs_info->btree_inode->i_mapping, 0); | |
741 | iput(fs_info->btree_inode); | |
7eccb903 CM |
742 | |
743 | free_dev_radix(fs_info); | |
0f7d52f4 CM |
744 | del_fs_roots(fs_info); |
745 | kfree(fs_info->extent_root); | |
0f7d52f4 CM |
746 | kfree(fs_info->tree_root); |
747 | kobject_unregister(&fs_info->kobj); | |
eb60ceac CM |
748 | return 0; |
749 | } | |
750 | ||
e20d96d6 | 751 | void btrfs_block_release(struct btrfs_root *root, struct buffer_head *buf) |
eb60ceac | 752 | { |
7cfcc17e | 753 | brelse(buf); |
eb60ceac CM |
754 | } |
755 |