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