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 | ||
e20d96d6 | 19 | #include <linux/fs.h> |
d98237b3 | 20 | #include <linux/blkdev.h> |
11bd143f | 21 | #include <linux/crc32c.h> |
87cbda5c | 22 | #include <linux/scatterlist.h> |
22b0ebda | 23 | #include <linux/swap.h> |
0f7d52f4 | 24 | #include <linux/radix-tree.h> |
35b7e476 | 25 | #include <linux/writeback.h> |
5f39d397 | 26 | #include <linux/buffer_head.h> // for block_sync_page |
eb60ceac CM |
27 | #include "ctree.h" |
28 | #include "disk-io.h" | |
e089f05c | 29 | #include "transaction.h" |
0f7d52f4 | 30 | #include "btrfs_inode.h" |
db94535d | 31 | #include "print-tree.h" |
eb60ceac | 32 | |
5f39d397 CM |
33 | #if 0 |
34 | static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf) | |
7eccb903 | 35 | { |
5f39d397 CM |
36 | if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) { |
37 | printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n", | |
38 | (unsigned long long)extent_buffer_blocknr(buf), | |
39 | (unsigned long long)btrfs_header_blocknr(buf)); | |
39279cc3 | 40 | return 1; |
d98237b3 | 41 | } |
9a8dd150 | 42 | return 0; |
eb60ceac | 43 | } |
5f39d397 | 44 | #endif |
eb60ceac | 45 | |
5f39d397 | 46 | struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root, |
db94535d | 47 | u64 bytenr, u32 blocksize) |
d98237b3 | 48 | { |
5f39d397 | 49 | struct inode *btree_inode = root->fs_info->btree_inode; |
f510cfec CM |
50 | struct extent_buffer *eb; |
51 | eb = find_extent_buffer(&BTRFS_I(btree_inode)->extent_tree, | |
db94535d | 52 | bytenr, blocksize, GFP_NOFS); |
f510cfec | 53 | return eb; |
5f39d397 | 54 | } |
d98237b3 | 55 | |
5f39d397 | 56 | struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root, |
db94535d | 57 | u64 bytenr, u32 blocksize) |
5f39d397 CM |
58 | { |
59 | struct inode *btree_inode = root->fs_info->btree_inode; | |
f510cfec | 60 | struct extent_buffer *eb; |
db94535d | 61 | |
f510cfec | 62 | eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->extent_tree, |
db94535d | 63 | bytenr, blocksize, GFP_NOFS); |
f510cfec | 64 | return eb; |
d98237b3 CM |
65 | } |
66 | ||
5f39d397 CM |
67 | struct extent_map *btree_get_extent(struct inode *inode, struct page *page, |
68 | size_t page_offset, u64 start, u64 end, | |
69 | int create) | |
7eccb903 | 70 | { |
5f39d397 CM |
71 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
72 | struct extent_map *em; | |
73 | int ret; | |
74 | ||
75 | again: | |
76 | em = lookup_extent_mapping(em_tree, start, end); | |
77 | if (em) { | |
78 | goto out; | |
7eccb903 | 79 | } |
5f39d397 CM |
80 | em = alloc_extent_map(GFP_NOFS); |
81 | if (!em) { | |
82 | em = ERR_PTR(-ENOMEM); | |
83 | goto out; | |
84 | } | |
85 | em->start = 0; | |
86 | em->end = (i_size_read(inode) & ~((u64)PAGE_CACHE_SIZE -1)) - 1; | |
87 | em->block_start = 0; | |
88 | em->block_end = em->end; | |
89 | em->bdev = inode->i_sb->s_bdev; | |
90 | ret = add_extent_mapping(em_tree, em); | |
91 | if (ret == -EEXIST) { | |
92 | free_extent_map(em); | |
93 | em = NULL; | |
94 | goto again; | |
95 | } else if (ret) { | |
96 | em = ERR_PTR(ret); | |
97 | } | |
98 | out: | |
99 | return em; | |
7eccb903 CM |
100 | } |
101 | ||
5f39d397 | 102 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
d98237b3 | 103 | { |
5f39d397 CM |
104 | struct extent_map_tree *tree; |
105 | tree = &BTRFS_I(page->mapping->host)->extent_tree; | |
106 | return extent_write_full_page(tree, page, btree_get_extent, wbc); | |
107 | } | |
108 | int btree_readpage(struct file *file, struct page *page) | |
109 | { | |
110 | struct extent_map_tree *tree; | |
111 | tree = &BTRFS_I(page->mapping->host)->extent_tree; | |
112 | return extent_read_full_page(tree, page, btree_get_extent); | |
113 | } | |
22b0ebda | 114 | |
5f39d397 CM |
115 | static int btree_releasepage(struct page *page, gfp_t unused_gfp_flags) |
116 | { | |
117 | struct extent_map_tree *tree; | |
118 | int ret; | |
d98237b3 | 119 | |
5f39d397 CM |
120 | BUG_ON(page->private != 1); |
121 | tree = &BTRFS_I(page->mapping->host)->extent_tree; | |
122 | ret = try_release_extent_mapping(tree, page); | |
123 | if (ret == 1) { | |
124 | ClearPagePrivate(page); | |
125 | set_page_private(page, 0); | |
126 | page_cache_release(page); | |
127 | } | |
d98237b3 CM |
128 | return ret; |
129 | } | |
130 | ||
5f39d397 | 131 | static void btree_invalidatepage(struct page *page, unsigned long offset) |
d98237b3 | 132 | { |
5f39d397 CM |
133 | struct extent_map_tree *tree; |
134 | tree = &BTRFS_I(page->mapping->host)->extent_tree; | |
135 | extent_invalidatepage(tree, page, offset); | |
136 | btree_releasepage(page, GFP_NOFS); | |
d98237b3 CM |
137 | } |
138 | ||
f254e52c CM |
139 | int btrfs_csum_data(struct btrfs_root * root, char *data, size_t len, |
140 | char *result) | |
87cbda5c | 141 | { |
5f39d397 CM |
142 | return 0; |
143 | #if 0 | |
11bd143f CM |
144 | u32 crc; |
145 | crc = crc32c(0, data, len); | |
146 | memcpy(result, &crc, BTRFS_CRC32_SIZE); | |
147 | return 0; | |
5f39d397 | 148 | #endif |
f254e52c | 149 | } |
11bd143f | 150 | |
5f39d397 CM |
151 | #if 0 |
152 | static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf, | |
f254e52c CM |
153 | int verify) |
154 | { | |
5f39d397 | 155 | return 0; |
509659cd | 156 | char result[BTRFS_CRC32_SIZE]; |
f254e52c CM |
157 | int ret; |
158 | struct btrfs_node *node; | |
159 | ||
160 | ret = btrfs_csum_data(root, bh->b_data + BTRFS_CSUM_SIZE, | |
161 | bh->b_size - BTRFS_CSUM_SIZE, result); | |
162 | if (ret) | |
163 | return ret; | |
87cbda5c | 164 | if (verify) { |
509659cd | 165 | if (memcmp(bh->b_data, result, BTRFS_CRC32_SIZE)) { |
5af3981c CM |
166 | printk("btrfs: %s checksum verify failed on %llu\n", |
167 | root->fs_info->sb->s_id, | |
168 | (unsigned long long)bh_blocknr(bh)); | |
f254e52c CM |
169 | return 1; |
170 | } | |
171 | } else { | |
172 | node = btrfs_buffer_node(bh); | |
509659cd | 173 | memcpy(node->header.csum, result, BTRFS_CRC32_SIZE); |
f254e52c | 174 | } |
87cbda5c CM |
175 | return 0; |
176 | } | |
5f39d397 | 177 | #endif |
87cbda5c | 178 | |
5f39d397 | 179 | #if 0 |
d98237b3 | 180 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
ed2ff2cb | 181 | { |
87cbda5c | 182 | struct buffer_head *bh; |
0f7d52f4 | 183 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
87cbda5c | 184 | struct buffer_head *head; |
87cbda5c CM |
185 | if (!page_has_buffers(page)) { |
186 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, | |
187 | (1 << BH_Dirty)|(1 << BH_Uptodate)); | |
188 | } | |
189 | head = page_buffers(page); | |
190 | bh = head; | |
191 | do { | |
192 | if (buffer_dirty(bh)) | |
193 | csum_tree_block(root, bh, 0); | |
194 | bh = bh->b_this_page; | |
195 | } while (bh != head); | |
d98237b3 | 196 | return block_write_full_page(page, btree_get_block, wbc); |
ed2ff2cb | 197 | } |
5f39d397 | 198 | #endif |
eb60ceac | 199 | |
d98237b3 CM |
200 | static struct address_space_operations btree_aops = { |
201 | .readpage = btree_readpage, | |
202 | .writepage = btree_writepage, | |
5f39d397 CM |
203 | .releasepage = btree_releasepage, |
204 | .invalidatepage = btree_invalidatepage, | |
d98237b3 CM |
205 | .sync_page = block_sync_page, |
206 | }; | |
207 | ||
db94535d | 208 | int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize) |
090d1875 | 209 | { |
5f39d397 CM |
210 | struct extent_buffer *buf = NULL; |
211 | struct inode *btree_inode = root->fs_info->btree_inode; | |
de428b63 | 212 | int ret = 0; |
090d1875 | 213 | |
db94535d | 214 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 | 215 | if (!buf) |
090d1875 | 216 | return 0; |
5f39d397 CM |
217 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree, |
218 | buf, 0); | |
219 | free_extent_buffer(buf); | |
de428b63 | 220 | return ret; |
090d1875 CM |
221 | } |
222 | ||
db94535d CM |
223 | struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, |
224 | u32 blocksize) | |
eb60ceac | 225 | { |
5f39d397 CM |
226 | struct extent_buffer *buf = NULL; |
227 | struct inode *btree_inode = root->fs_info->btree_inode; | |
228 | ||
db94535d | 229 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 CM |
230 | if (!buf) |
231 | return NULL; | |
232 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree, | |
233 | buf, 1); | |
234 | return buf; | |
eb60ceac CM |
235 | } |
236 | ||
e089f05c | 237 | int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5f39d397 | 238 | struct extent_buffer *buf) |
ed2ff2cb | 239 | { |
5f39d397 CM |
240 | struct inode *btree_inode = root->fs_info->btree_inode; |
241 | clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf); | |
242 | return 0; | |
243 | } | |
244 | ||
245 | int wait_on_tree_block_writeback(struct btrfs_root *root, | |
246 | struct extent_buffer *buf) | |
247 | { | |
248 | struct inode *btree_inode = root->fs_info->btree_inode; | |
249 | wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->extent_tree, | |
250 | buf); | |
251 | return 0; | |
252 | } | |
253 | ||
254 | int set_tree_block_dirty(struct btrfs_root *root, struct extent_buffer *buf) | |
255 | { | |
256 | struct inode *btree_inode = root->fs_info->btree_inode; | |
257 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf); | |
ed2ff2cb CM |
258 | return 0; |
259 | } | |
260 | ||
db94535d | 261 | static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, |
9f5fae2f CM |
262 | struct btrfs_root *root, |
263 | struct btrfs_fs_info *fs_info, | |
e20d96d6 | 264 | u64 objectid) |
d97e63b6 | 265 | { |
cfaa7295 | 266 | root->node = NULL; |
0f7d52f4 | 267 | root->inode = NULL; |
a28ec197 | 268 | root->commit_root = NULL; |
db94535d CM |
269 | root->sectorsize = sectorsize; |
270 | root->nodesize = nodesize; | |
271 | root->leafsize = leafsize; | |
123abc88 | 272 | root->ref_cows = 0; |
9f5fae2f | 273 | root->fs_info = fs_info; |
0f7d52f4 CM |
274 | root->objectid = objectid; |
275 | root->last_trans = 0; | |
1b05da2e CM |
276 | root->highest_inode = 0; |
277 | root->last_inode_alloc = 0; | |
58176a96 | 278 | root->name = NULL; |
3768f368 CM |
279 | memset(&root->root_key, 0, sizeof(root->root_key)); |
280 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
6702ed49 | 281 | memset(&root->defrag_progress, 0, sizeof(root->defrag_progress)); |
58176a96 JB |
282 | memset(&root->root_kobj, 0, sizeof(root->root_kobj)); |
283 | init_completion(&root->kobj_unregister); | |
011410bd | 284 | init_rwsem(&root->snap_sem); |
6702ed49 CM |
285 | root->defrag_running = 0; |
286 | root->defrag_level = 0; | |
4d775673 | 287 | root->root_key.objectid = objectid; |
3768f368 CM |
288 | return 0; |
289 | } | |
290 | ||
db94535d | 291 | static int find_and_setup_root(struct btrfs_root *tree_root, |
9f5fae2f CM |
292 | struct btrfs_fs_info *fs_info, |
293 | u64 objectid, | |
e20d96d6 | 294 | struct btrfs_root *root) |
3768f368 CM |
295 | { |
296 | int ret; | |
db94535d | 297 | u32 blocksize; |
3768f368 | 298 | |
db94535d CM |
299 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
300 | tree_root->sectorsize, root, fs_info, objectid); | |
3768f368 CM |
301 | ret = btrfs_find_last_root(tree_root, objectid, |
302 | &root->root_item, &root->root_key); | |
303 | BUG_ON(ret); | |
304 | ||
db94535d CM |
305 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
306 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
307 | blocksize); | |
3768f368 | 308 | BUG_ON(!root->node); |
d97e63b6 CM |
309 | return 0; |
310 | } | |
311 | ||
5eda7b5e CM |
312 | struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info, |
313 | struct btrfs_key *location) | |
0f7d52f4 CM |
314 | { |
315 | struct btrfs_root *root; | |
316 | struct btrfs_root *tree_root = fs_info->tree_root; | |
317 | struct btrfs_path *path; | |
5f39d397 | 318 | struct extent_buffer *l; |
1b05da2e | 319 | u64 highest_inode; |
db94535d | 320 | u32 blocksize; |
0f7d52f4 CM |
321 | int ret = 0; |
322 | ||
5eda7b5e | 323 | root = kzalloc(sizeof(*root), GFP_NOFS); |
0cf6c620 | 324 | if (!root) |
0f7d52f4 | 325 | return ERR_PTR(-ENOMEM); |
0f7d52f4 | 326 | if (location->offset == (u64)-1) { |
db94535d | 327 | ret = find_and_setup_root(tree_root, fs_info, |
0f7d52f4 CM |
328 | location->objectid, root); |
329 | if (ret) { | |
0f7d52f4 CM |
330 | kfree(root); |
331 | return ERR_PTR(ret); | |
332 | } | |
333 | goto insert; | |
334 | } | |
335 | ||
db94535d CM |
336 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
337 | tree_root->sectorsize, root, fs_info, | |
0f7d52f4 CM |
338 | location->objectid); |
339 | ||
340 | path = btrfs_alloc_path(); | |
341 | BUG_ON(!path); | |
342 | ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0); | |
343 | if (ret != 0) { | |
0f7d52f4 CM |
344 | if (ret > 0) |
345 | ret = -ENOENT; | |
346 | goto out; | |
347 | } | |
5f39d397 CM |
348 | l = path->nodes[0]; |
349 | read_extent_buffer(l, &root->root_item, | |
350 | btrfs_item_ptr_offset(l, path->slots[0]), | |
0f7d52f4 | 351 | sizeof(root->root_item)); |
0f7d52f4 CM |
352 | ret = 0; |
353 | out: | |
354 | btrfs_release_path(root, path); | |
355 | btrfs_free_path(path); | |
356 | if (ret) { | |
357 | kfree(root); | |
358 | return ERR_PTR(ret); | |
359 | } | |
db94535d CM |
360 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
361 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
362 | blocksize); | |
0f7d52f4 CM |
363 | BUG_ON(!root->node); |
364 | insert: | |
0f7d52f4 | 365 | root->ref_cows = 1; |
5eda7b5e CM |
366 | ret = btrfs_find_highest_inode(root, &highest_inode); |
367 | if (ret == 0) { | |
368 | root->highest_inode = highest_inode; | |
369 | root->last_inode_alloc = highest_inode; | |
370 | } | |
371 | return root; | |
372 | } | |
373 | ||
374 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info, | |
58176a96 JB |
375 | struct btrfs_key *location, |
376 | const char *name, int namelen) | |
5eda7b5e CM |
377 | { |
378 | struct btrfs_root *root; | |
379 | int ret; | |
380 | ||
381 | root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
382 | (unsigned long)location->objectid); | |
383 | if (root) | |
384 | return root; | |
385 | ||
386 | root = btrfs_read_fs_root_no_radix(fs_info, location); | |
387 | if (IS_ERR(root)) | |
388 | return root; | |
2619ba1f CM |
389 | ret = radix_tree_insert(&fs_info->fs_roots_radix, |
390 | (unsigned long)root->root_key.objectid, | |
0f7d52f4 CM |
391 | root); |
392 | if (ret) { | |
5f39d397 | 393 | free_extent_buffer(root->node); |
0f7d52f4 CM |
394 | kfree(root); |
395 | return ERR_PTR(ret); | |
396 | } | |
58176a96 JB |
397 | |
398 | ret = btrfs_set_root_name(root, name, namelen); | |
399 | if (ret) { | |
5f39d397 | 400 | free_extent_buffer(root->node); |
58176a96 JB |
401 | kfree(root); |
402 | return ERR_PTR(ret); | |
403 | } | |
404 | ||
405 | ret = btrfs_sysfs_add_root(root); | |
406 | if (ret) { | |
5f39d397 | 407 | free_extent_buffer(root->node); |
58176a96 JB |
408 | kfree(root->name); |
409 | kfree(root); | |
410 | return ERR_PTR(ret); | |
411 | } | |
412 | ||
5ce14bbc CM |
413 | ret = btrfs_find_dead_roots(fs_info->tree_root, |
414 | root->root_key.objectid, root); | |
415 | BUG_ON(ret); | |
416 | ||
0f7d52f4 CM |
417 | return root; |
418 | } | |
419 | ||
2c90e5d6 | 420 | struct btrfs_root *open_ctree(struct super_block *sb) |
2e635a27 | 421 | { |
db94535d CM |
422 | u32 sectorsize; |
423 | u32 nodesize; | |
424 | u32 leafsize; | |
425 | u32 blocksize; | |
e20d96d6 CM |
426 | struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root), |
427 | GFP_NOFS); | |
428 | struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root), | |
429 | GFP_NOFS); | |
e20d96d6 CM |
430 | struct btrfs_fs_info *fs_info = kmalloc(sizeof(*fs_info), |
431 | GFP_NOFS); | |
eb60ceac | 432 | int ret; |
39279cc3 | 433 | int err = -EIO; |
2c90e5d6 | 434 | struct btrfs_super_block *disk_super; |
eb60ceac | 435 | |
39279cc3 CM |
436 | if (!extent_root || !tree_root || !fs_info) { |
437 | err = -ENOMEM; | |
438 | goto fail; | |
439 | } | |
0f7d52f4 | 440 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS); |
8fd17795 | 441 | INIT_LIST_HEAD(&fs_info->trans_list); |
facda1e7 | 442 | INIT_LIST_HEAD(&fs_info->dead_roots); |
58176a96 JB |
443 | memset(&fs_info->super_kobj, 0, sizeof(fs_info->super_kobj)); |
444 | init_completion(&fs_info->kobj_unregister); | |
2c90e5d6 | 445 | sb_set_blocksize(sb, 4096); |
9f5fae2f | 446 | fs_info->running_transaction = NULL; |
15ee9bc7 | 447 | fs_info->last_trans_committed = 0; |
9f5fae2f CM |
448 | fs_info->tree_root = tree_root; |
449 | fs_info->extent_root = extent_root; | |
e20d96d6 | 450 | fs_info->sb = sb; |
d98237b3 CM |
451 | fs_info->btree_inode = new_inode(sb); |
452 | fs_info->btree_inode->i_ino = 1; | |
2c90e5d6 | 453 | fs_info->btree_inode->i_nlink = 1; |
d98237b3 CM |
454 | fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size; |
455 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; | |
5f39d397 CM |
456 | extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree, |
457 | fs_info->btree_inode->i_mapping, | |
458 | GFP_NOFS); | |
f510cfec CM |
459 | extent_map_tree_init(&fs_info->free_space_cache, |
460 | fs_info->btree_inode->i_mapping, GFP_NOFS); | |
96b5179d CM |
461 | extent_map_tree_init(&fs_info->block_group_cache, |
462 | fs_info->btree_inode->i_mapping, GFP_NOFS); | |
1a5bc167 CM |
463 | extent_map_tree_init(&fs_info->pinned_extents, |
464 | fs_info->btree_inode->i_mapping, GFP_NOFS); | |
465 | extent_map_tree_init(&fs_info->pending_del, | |
466 | fs_info->btree_inode->i_mapping, GFP_NOFS); | |
467 | extent_map_tree_init(&fs_info->extent_ins, | |
468 | fs_info->btree_inode->i_mapping, GFP_NOFS); | |
e66f709b | 469 | fs_info->do_barriers = 1; |
facda1e7 CM |
470 | fs_info->closing = 0; |
471 | ||
08607c1b | 472 | INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner); |
0f7d52f4 CM |
473 | BTRFS_I(fs_info->btree_inode)->root = tree_root; |
474 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, | |
475 | sizeof(struct btrfs_key)); | |
22b0ebda | 476 | insert_inode_hash(fs_info->btree_inode); |
d98237b3 | 477 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
39279cc3 | 478 | |
79154b1b | 479 | mutex_init(&fs_info->trans_mutex); |
d561c025 | 480 | mutex_init(&fs_info->fs_mutex); |
3768f368 | 481 | |
db94535d | 482 | __setup_root(512, 512, 512, tree_root, |
2c90e5d6 | 483 | fs_info, BTRFS_ROOT_TREE_OBJECTID); |
7eccb903 | 484 | |
2c90e5d6 | 485 | fs_info->sb_buffer = read_tree_block(tree_root, |
db94535d CM |
486 | BTRFS_SUPER_INFO_OFFSET, |
487 | 512); | |
d98237b3 | 488 | |
0f7d52f4 | 489 | if (!fs_info->sb_buffer) |
39279cc3 | 490 | goto fail_iput; |
39279cc3 | 491 | |
5f39d397 CM |
492 | read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0, |
493 | sizeof(fs_info->super_copy)); | |
494 | ||
495 | read_extent_buffer(fs_info->sb_buffer, fs_info->fsid, | |
496 | (unsigned long)btrfs_super_fsid(fs_info->sb_buffer), | |
497 | BTRFS_FSID_SIZE); | |
498 | disk_super = &fs_info->super_copy; | |
0f7d52f4 | 499 | if (!btrfs_super_root(disk_super)) |
39279cc3 | 500 | goto fail_sb_buffer; |
0f7d52f4 | 501 | |
db94535d CM |
502 | nodesize = btrfs_super_nodesize(disk_super); |
503 | leafsize = btrfs_super_leafsize(disk_super); | |
504 | sectorsize = btrfs_super_sectorsize(disk_super); | |
505 | tree_root->nodesize = nodesize; | |
506 | tree_root->leafsize = leafsize; | |
507 | tree_root->sectorsize = sectorsize; | |
508 | ||
8352d8a4 | 509 | i_size_write(fs_info->btree_inode, |
db94535d | 510 | btrfs_super_total_bytes(disk_super)); |
8352d8a4 | 511 | |
39279cc3 CM |
512 | |
513 | if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC, | |
514 | sizeof(disk_super->magic))) { | |
515 | printk("btrfs: valid FS not found on %s\n", sb->s_id); | |
516 | goto fail_sb_buffer; | |
517 | } | |
db94535d CM |
518 | blocksize = btrfs_level_size(tree_root, |
519 | btrfs_super_root_level(disk_super)); | |
e20d96d6 | 520 | tree_root->node = read_tree_block(tree_root, |
db94535d CM |
521 | btrfs_super_root(disk_super), |
522 | blocksize); | |
39279cc3 CM |
523 | if (!tree_root->node) |
524 | goto fail_sb_buffer; | |
3768f368 | 525 | |
db94535d CM |
526 | #if 0 |
527 | btrfs_print_leaf(tree_root, tree_root->node); | |
528 | err = -EIO; | |
529 | goto fail_tree_root; | |
530 | #endif | |
2c90e5d6 | 531 | mutex_lock(&fs_info->fs_mutex); |
db94535d CM |
532 | |
533 | ret = find_and_setup_root(tree_root, fs_info, | |
e20d96d6 | 534 | BTRFS_EXTENT_TREE_OBJECTID, extent_root); |
39279cc3 CM |
535 | if (ret) { |
536 | mutex_unlock(&fs_info->fs_mutex); | |
537 | goto fail_tree_root; | |
538 | } | |
3768f368 | 539 | |
9078a3e1 CM |
540 | btrfs_read_block_groups(extent_root); |
541 | ||
0f7d52f4 | 542 | fs_info->generation = btrfs_super_generation(disk_super) + 1; |
5be6f7f1 | 543 | mutex_unlock(&fs_info->fs_mutex); |
0f7d52f4 | 544 | return tree_root; |
39279cc3 CM |
545 | |
546 | fail_tree_root: | |
5f39d397 | 547 | free_extent_buffer(tree_root->node); |
39279cc3 | 548 | fail_sb_buffer: |
5f39d397 | 549 | free_extent_buffer(fs_info->sb_buffer); |
39279cc3 CM |
550 | fail_iput: |
551 | iput(fs_info->btree_inode); | |
552 | fail: | |
553 | kfree(extent_root); | |
554 | kfree(tree_root); | |
555 | kfree(fs_info); | |
556 | return ERR_PTR(err); | |
eb60ceac CM |
557 | } |
558 | ||
e089f05c | 559 | int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root |
79154b1b | 560 | *root) |
eb60ceac | 561 | { |
e66f709b | 562 | int ret; |
5f39d397 CM |
563 | struct extent_buffer *super = root->fs_info->sb_buffer; |
564 | struct inode *btree_inode = root->fs_info->btree_inode; | |
565 | ||
566 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, super); | |
567 | ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping, | |
568 | super->start, super->len); | |
569 | return ret; | |
cfaa7295 CM |
570 | } |
571 | ||
5eda7b5e | 572 | int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
2619ba1f CM |
573 | { |
574 | radix_tree_delete(&fs_info->fs_roots_radix, | |
575 | (unsigned long)root->root_key.objectid); | |
58176a96 | 576 | btrfs_sysfs_del_root(root); |
2619ba1f CM |
577 | if (root->inode) |
578 | iput(root->inode); | |
579 | if (root->node) | |
5f39d397 | 580 | free_extent_buffer(root->node); |
2619ba1f | 581 | if (root->commit_root) |
5f39d397 | 582 | free_extent_buffer(root->commit_root); |
58176a96 JB |
583 | if (root->name) |
584 | kfree(root->name); | |
2619ba1f CM |
585 | kfree(root); |
586 | return 0; | |
587 | } | |
588 | ||
35b7e476 | 589 | static int del_fs_roots(struct btrfs_fs_info *fs_info) |
0f7d52f4 CM |
590 | { |
591 | int ret; | |
592 | struct btrfs_root *gang[8]; | |
593 | int i; | |
594 | ||
595 | while(1) { | |
596 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
597 | (void **)gang, 0, | |
598 | ARRAY_SIZE(gang)); | |
599 | if (!ret) | |
600 | break; | |
2619ba1f | 601 | for (i = 0; i < ret; i++) |
5eda7b5e | 602 | btrfs_free_fs_root(fs_info, gang[i]); |
0f7d52f4 CM |
603 | } |
604 | return 0; | |
605 | } | |
b4100d64 | 606 | |
e20d96d6 | 607 | int close_ctree(struct btrfs_root *root) |
cfaa7295 | 608 | { |
3768f368 | 609 | int ret; |
e089f05c | 610 | struct btrfs_trans_handle *trans; |
0f7d52f4 | 611 | struct btrfs_fs_info *fs_info = root->fs_info; |
e089f05c | 612 | |
facda1e7 | 613 | fs_info->closing = 1; |
08607c1b | 614 | btrfs_transaction_flush_work(root); |
0f7d52f4 | 615 | mutex_lock(&fs_info->fs_mutex); |
6702ed49 | 616 | btrfs_defrag_dirty_roots(root->fs_info); |
79154b1b | 617 | trans = btrfs_start_transaction(root, 1); |
54aa1f4d | 618 | ret = btrfs_commit_transaction(trans, root); |
79154b1b CM |
619 | /* run commit again to drop the original snapshot */ |
620 | trans = btrfs_start_transaction(root, 1); | |
621 | btrfs_commit_transaction(trans, root); | |
622 | ret = btrfs_write_and_wait_transaction(NULL, root); | |
3768f368 | 623 | BUG_ON(ret); |
79154b1b | 624 | write_ctree_super(NULL, root); |
0f7d52f4 CM |
625 | mutex_unlock(&fs_info->fs_mutex); |
626 | ||
627 | if (fs_info->extent_root->node) | |
5f39d397 | 628 | free_extent_buffer(fs_info->extent_root->node); |
f510cfec | 629 | |
0f7d52f4 | 630 | if (fs_info->tree_root->node) |
5f39d397 | 631 | free_extent_buffer(fs_info->tree_root->node); |
f510cfec | 632 | |
5f39d397 | 633 | free_extent_buffer(fs_info->sb_buffer); |
7eccb903 | 634 | |
9078a3e1 | 635 | btrfs_free_block_groups(root->fs_info); |
0f7d52f4 | 636 | del_fs_roots(fs_info); |
4dc11904 | 637 | extent_map_tree_cleanup(&BTRFS_I(fs_info->btree_inode)->extent_tree); |
db94535d CM |
638 | truncate_inode_pages(fs_info->btree_inode->i_mapping, 0); |
639 | iput(fs_info->btree_inode); | |
0f7d52f4 | 640 | kfree(fs_info->extent_root); |
0f7d52f4 | 641 | kfree(fs_info->tree_root); |
eb60ceac CM |
642 | return 0; |
643 | } | |
644 | ||
5f39d397 CM |
645 | int btrfs_buffer_uptodate(struct extent_buffer *buf) |
646 | { | |
810191ff | 647 | struct inode *btree_inode = buf->first_page->mapping->host; |
5f39d397 CM |
648 | return extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree, buf); |
649 | } | |
650 | ||
651 | int btrfs_set_buffer_uptodate(struct extent_buffer *buf) | |
ccd467d6 | 652 | { |
810191ff | 653 | struct inode *btree_inode = buf->first_page->mapping->host; |
5f39d397 CM |
654 | return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->extent_tree, |
655 | buf); | |
656 | } | |
6702ed49 | 657 | |
5f39d397 CM |
658 | void btrfs_mark_buffer_dirty(struct extent_buffer *buf) |
659 | { | |
810191ff | 660 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
5f39d397 CM |
661 | u64 transid = btrfs_header_generation(buf); |
662 | struct inode *btree_inode = root->fs_info->btree_inode; | |
6702ed49 | 663 | |
ccd467d6 CM |
664 | if (transid != root->fs_info->generation) { |
665 | printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n", | |
db94535d | 666 | (unsigned long long)buf->start, |
ccd467d6 CM |
667 | transid, root->fs_info->generation); |
668 | WARN_ON(1); | |
669 | } | |
5f39d397 | 670 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->extent_tree, buf); |
eb60ceac CM |
671 | } |
672 | ||
d3c2fdcf | 673 | void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr) |
35b7e476 | 674 | { |
d3c2fdcf CM |
675 | balance_dirty_pages_ratelimited_nr( |
676 | root->fs_info->btree_inode->i_mapping, nr); | |
35b7e476 | 677 | } |
6b80053d CM |
678 | |
679 | void btrfs_set_buffer_defrag(struct extent_buffer *buf) | |
680 | { | |
810191ff | 681 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
682 | struct inode *btree_inode = root->fs_info->btree_inode; |
683 | set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start, | |
684 | buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS); | |
685 | } | |
686 | ||
687 | void btrfs_set_buffer_defrag_done(struct extent_buffer *buf) | |
688 | { | |
810191ff | 689 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
690 | struct inode *btree_inode = root->fs_info->btree_inode; |
691 | set_extent_bits(&BTRFS_I(btree_inode)->extent_tree, buf->start, | |
692 | buf->start + buf->len - 1, EXTENT_DEFRAG_DONE, | |
693 | GFP_NOFS); | |
694 | } | |
695 | ||
696 | int btrfs_buffer_defrag(struct extent_buffer *buf) | |
697 | { | |
810191ff | 698 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
699 | struct inode *btree_inode = root->fs_info->btree_inode; |
700 | return test_range_bit(&BTRFS_I(btree_inode)->extent_tree, | |
701 | buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0); | |
702 | } | |
703 | ||
704 | int btrfs_buffer_defrag_done(struct extent_buffer *buf) | |
705 | { | |
810191ff | 706 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
707 | struct inode *btree_inode = root->fs_info->btree_inode; |
708 | return test_range_bit(&BTRFS_I(btree_inode)->extent_tree, | |
709 | buf->start, buf->start + buf->len - 1, | |
710 | EXTENT_DEFRAG_DONE, 0); | |
711 | } | |
712 | ||
713 | int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf) | |
714 | { | |
810191ff | 715 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
716 | struct inode *btree_inode = root->fs_info->btree_inode; |
717 | return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree, | |
718 | buf->start, buf->start + buf->len - 1, | |
719 | EXTENT_DEFRAG_DONE, GFP_NOFS); | |
720 | } | |
721 | ||
722 | int btrfs_clear_buffer_defrag(struct extent_buffer *buf) | |
723 | { | |
810191ff | 724 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
725 | struct inode *btree_inode = root->fs_info->btree_inode; |
726 | return clear_extent_bits(&BTRFS_I(btree_inode)->extent_tree, | |
727 | buf->start, buf->start + buf->len - 1, | |
728 | EXTENT_DEFRAG, GFP_NOFS); | |
729 | } | |
730 | ||
731 | int btrfs_read_buffer(struct extent_buffer *buf) | |
732 | { | |
810191ff | 733 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d CM |
734 | struct inode *btree_inode = root->fs_info->btree_inode; |
735 | return read_extent_buffer_pages(&BTRFS_I(btree_inode)->extent_tree, | |
736 | buf, 1); | |
737 | } |