]>
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 |
ce9adaa5 | 27 | #include <linux/workqueue.h> |
eb60ceac CM |
28 | #include "ctree.h" |
29 | #include "disk-io.h" | |
e089f05c | 30 | #include "transaction.h" |
0f7d52f4 | 31 | #include "btrfs_inode.h" |
0b86a832 | 32 | #include "volumes.h" |
db94535d | 33 | #include "print-tree.h" |
eb60ceac | 34 | |
5f39d397 CM |
35 | #if 0 |
36 | static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf) | |
7eccb903 | 37 | { |
5f39d397 CM |
38 | if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) { |
39 | printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n", | |
40 | (unsigned long long)extent_buffer_blocknr(buf), | |
41 | (unsigned long long)btrfs_header_blocknr(buf)); | |
39279cc3 | 42 | return 1; |
d98237b3 | 43 | } |
9a8dd150 | 44 | return 0; |
eb60ceac | 45 | } |
5f39d397 | 46 | #endif |
eb60ceac | 47 | |
d1310b2e | 48 | static struct extent_io_ops btree_extent_io_ops; |
ce9adaa5 CM |
49 | static struct workqueue_struct *end_io_workqueue; |
50 | ||
51 | struct end_io_wq { | |
52 | struct bio *bio; | |
53 | bio_end_io_t *end_io; | |
54 | void *private; | |
55 | struct btrfs_fs_info *info; | |
56 | int error; | |
22c59948 | 57 | int metadata; |
ce9adaa5 CM |
58 | struct list_head list; |
59 | }; | |
0da5468f | 60 | |
5f39d397 | 61 | struct extent_map *btree_get_extent(struct inode *inode, struct page *page, |
d1310b2e | 62 | size_t page_offset, u64 start, u64 len, |
5f39d397 | 63 | int create) |
7eccb903 | 64 | { |
5f39d397 CM |
65 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
66 | struct extent_map *em; | |
67 | int ret; | |
68 | ||
69 | again: | |
d1310b2e CM |
70 | spin_lock(&em_tree->lock); |
71 | em = lookup_extent_mapping(em_tree, start, len); | |
72 | spin_unlock(&em_tree->lock); | |
5f39d397 CM |
73 | if (em) { |
74 | goto out; | |
7eccb903 | 75 | } |
5f39d397 CM |
76 | em = alloc_extent_map(GFP_NOFS); |
77 | if (!em) { | |
78 | em = ERR_PTR(-ENOMEM); | |
79 | goto out; | |
80 | } | |
81 | em->start = 0; | |
d1310b2e | 82 | em->len = i_size_read(inode); |
5f39d397 | 83 | em->block_start = 0; |
5f39d397 | 84 | em->bdev = inode->i_sb->s_bdev; |
d1310b2e CM |
85 | |
86 | spin_lock(&em_tree->lock); | |
5f39d397 | 87 | ret = add_extent_mapping(em_tree, em); |
d1310b2e CM |
88 | spin_unlock(&em_tree->lock); |
89 | ||
5f39d397 CM |
90 | if (ret == -EEXIST) { |
91 | free_extent_map(em); | |
92 | em = NULL; | |
93 | goto again; | |
94 | } else if (ret) { | |
95 | em = ERR_PTR(ret); | |
96 | } | |
97 | out: | |
98 | return em; | |
7eccb903 CM |
99 | } |
100 | ||
19c00ddc CM |
101 | u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len) |
102 | { | |
103 | return crc32c(seed, data, len); | |
104 | } | |
105 | ||
106 | void btrfs_csum_final(u32 crc, char *result) | |
107 | { | |
108 | *(__le32 *)result = ~cpu_to_le32(crc); | |
109 | } | |
110 | ||
111 | static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf, | |
112 | int verify) | |
113 | { | |
114 | char result[BTRFS_CRC32_SIZE]; | |
115 | unsigned long len; | |
116 | unsigned long cur_len; | |
117 | unsigned long offset = BTRFS_CSUM_SIZE; | |
118 | char *map_token = NULL; | |
119 | char *kaddr; | |
120 | unsigned long map_start; | |
121 | unsigned long map_len; | |
122 | int err; | |
123 | u32 crc = ~(u32)0; | |
124 | ||
125 | len = buf->len - offset; | |
126 | while(len > 0) { | |
127 | err = map_private_extent_buffer(buf, offset, 32, | |
128 | &map_token, &kaddr, | |
129 | &map_start, &map_len, KM_USER0); | |
130 | if (err) { | |
131 | printk("failed to map extent buffer! %lu\n", | |
132 | offset); | |
133 | return 1; | |
134 | } | |
135 | cur_len = min(len, map_len - (offset - map_start)); | |
136 | crc = btrfs_csum_data(root, kaddr + offset - map_start, | |
137 | crc, cur_len); | |
138 | len -= cur_len; | |
139 | offset += cur_len; | |
140 | unmap_extent_buffer(buf, map_token, KM_USER0); | |
141 | } | |
142 | btrfs_csum_final(crc, result); | |
143 | ||
144 | if (verify) { | |
e4204ded CM |
145 | int from_this_trans = 0; |
146 | ||
147 | if (root->fs_info->running_transaction && | |
148 | btrfs_header_generation(buf) == | |
149 | root->fs_info->running_transaction->transid) | |
150 | from_this_trans = 1; | |
151 | ||
152 | /* FIXME, this is not good */ | |
63b10fc4 | 153 | if (memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) { |
e4204ded CM |
154 | u32 val; |
155 | u32 found = 0; | |
156 | memcpy(&found, result, BTRFS_CRC32_SIZE); | |
157 | ||
158 | read_extent_buffer(buf, &val, 0, BTRFS_CRC32_SIZE); | |
63b10fc4 | 159 | WARN_ON(1); |
e4204ded | 160 | printk("btrfs: %s checksum verify failed on %llu " |
63b10fc4 CM |
161 | "wanted %X found %X from_this_trans %d " |
162 | "level %d\n", | |
19c00ddc | 163 | root->fs_info->sb->s_id, |
63b10fc4 CM |
164 | buf->start, val, found, from_this_trans, |
165 | btrfs_header_level(buf)); | |
19c00ddc CM |
166 | return 1; |
167 | } | |
168 | } else { | |
169 | write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE); | |
170 | } | |
171 | return 0; | |
172 | } | |
173 | ||
174 | ||
175 | int csum_dirty_buffer(struct btrfs_root *root, struct page *page) | |
176 | { | |
d1310b2e | 177 | struct extent_io_tree *tree; |
35ebb934 | 178 | u64 start = (u64)page->index << PAGE_CACHE_SHIFT; |
19c00ddc CM |
179 | u64 found_start; |
180 | int found_level; | |
181 | unsigned long len; | |
182 | struct extent_buffer *eb; | |
d1310b2e | 183 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
19c00ddc CM |
184 | |
185 | if (page->private == EXTENT_PAGE_PRIVATE) | |
186 | goto out; | |
187 | if (!page->private) | |
188 | goto out; | |
189 | len = page->private >> 2; | |
190 | if (len == 0) { | |
191 | WARN_ON(1); | |
192 | } | |
193 | eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS); | |
a86c12c7 CM |
194 | read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1, |
195 | btree_get_extent); | |
e18e4809 | 196 | btrfs_clear_buffer_defrag(eb); |
19c00ddc CM |
197 | found_start = btrfs_header_bytenr(eb); |
198 | if (found_start != start) { | |
199 | printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n", | |
200 | start, found_start, len); | |
55c69072 CM |
201 | WARN_ON(1); |
202 | goto err; | |
203 | } | |
204 | if (eb->first_page != page) { | |
205 | printk("bad first page %lu %lu\n", eb->first_page->index, | |
206 | page->index); | |
207 | WARN_ON(1); | |
208 | goto err; | |
209 | } | |
210 | if (!PageUptodate(page)) { | |
211 | printk("csum not up to date page %lu\n", page->index); | |
212 | WARN_ON(1); | |
213 | goto err; | |
19c00ddc CM |
214 | } |
215 | found_level = btrfs_header_level(eb); | |
63b10fc4 CM |
216 | spin_lock(&root->fs_info->hash_lock); |
217 | btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN); | |
218 | spin_unlock(&root->fs_info->hash_lock); | |
19c00ddc | 219 | csum_tree_block(root, eb, 0); |
55c69072 | 220 | err: |
19c00ddc CM |
221 | free_extent_buffer(eb); |
222 | out: | |
223 | return 0; | |
224 | } | |
225 | ||
0da5468f | 226 | static int btree_writepage_io_hook(struct page *page, u64 start, u64 end) |
d98237b3 | 227 | { |
19c00ddc | 228 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
19c00ddc CM |
229 | |
230 | csum_dirty_buffer(root, page); | |
0da5468f CM |
231 | return 0; |
232 | } | |
233 | ||
ce9adaa5 CM |
234 | int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end, |
235 | struct extent_state *state) | |
236 | { | |
237 | struct extent_io_tree *tree; | |
238 | u64 found_start; | |
239 | int found_level; | |
240 | unsigned long len; | |
241 | struct extent_buffer *eb; | |
242 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
243 | int ret; | |
244 | ||
245 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
246 | if (page->private == EXTENT_PAGE_PRIVATE) | |
247 | goto out; | |
248 | if (!page->private) | |
249 | goto out; | |
250 | len = page->private >> 2; | |
251 | if (len == 0) { | |
252 | WARN_ON(1); | |
253 | } | |
254 | eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS); | |
255 | read_extent_buffer_pages(tree, eb, start + PAGE_CACHE_SIZE, 1, | |
256 | btree_get_extent); | |
257 | btrfs_clear_buffer_defrag(eb); | |
258 | found_start = btrfs_header_bytenr(eb); | |
259 | if (found_start != start) { | |
260 | printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n", | |
261 | start, found_start, len); | |
262 | WARN_ON(1); | |
263 | goto err; | |
264 | } | |
265 | if (eb->first_page != page) { | |
266 | printk("bad first page %lu %lu\n", eb->first_page->index, | |
267 | page->index); | |
268 | WARN_ON(1); | |
269 | goto err; | |
270 | } | |
271 | found_level = btrfs_header_level(eb); | |
272 | ||
273 | ret = csum_tree_block(root, eb, 1); | |
274 | ||
275 | end = min_t(u64, eb->len, PAGE_CACHE_SIZE); | |
276 | end = eb->start + end - 1; | |
277 | release_extent_buffer_tail_pages(eb); | |
278 | err: | |
279 | free_extent_buffer(eb); | |
280 | out: | |
281 | return 0; | |
282 | } | |
283 | ||
284 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23) | |
285 | static void end_workqueue_bio(struct bio *bio, int err) | |
286 | #else | |
287 | static int end_workqueue_bio(struct bio *bio, | |
288 | unsigned int bytes_done, int err) | |
289 | #endif | |
290 | { | |
291 | struct end_io_wq *end_io_wq = bio->bi_private; | |
292 | struct btrfs_fs_info *fs_info; | |
293 | unsigned long flags; | |
294 | ||
295 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23) | |
296 | if (bio->bi_size) | |
297 | return 1; | |
298 | #endif | |
299 | ||
300 | fs_info = end_io_wq->info; | |
301 | spin_lock_irqsave(&fs_info->end_io_work_lock, flags); | |
302 | end_io_wq->error = err; | |
303 | list_add_tail(&end_io_wq->list, &fs_info->end_io_work_list); | |
304 | spin_unlock_irqrestore(&fs_info->end_io_work_lock, flags); | |
305 | queue_work(end_io_workqueue, &fs_info->end_io_work); | |
306 | ||
307 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23) | |
308 | return 0; | |
309 | #endif | |
310 | } | |
311 | ||
22c59948 CM |
312 | int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio, |
313 | int metadata) | |
0b86a832 | 314 | { |
ce9adaa5 | 315 | struct end_io_wq *end_io_wq; |
ce9adaa5 CM |
316 | end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS); |
317 | if (!end_io_wq) | |
318 | return -ENOMEM; | |
319 | ||
320 | end_io_wq->private = bio->bi_private; | |
321 | end_io_wq->end_io = bio->bi_end_io; | |
22c59948 | 322 | end_io_wq->info = info; |
ce9adaa5 CM |
323 | end_io_wq->error = 0; |
324 | end_io_wq->bio = bio; | |
22c59948 | 325 | end_io_wq->metadata = metadata; |
ce9adaa5 CM |
326 | |
327 | bio->bi_private = end_io_wq; | |
328 | bio->bi_end_io = end_workqueue_bio; | |
22c59948 CM |
329 | return 0; |
330 | } | |
331 | ||
332 | static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio) | |
333 | { | |
334 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
335 | u64 offset; | |
336 | int ret; | |
337 | ||
338 | offset = bio->bi_sector << 9; | |
339 | ||
340 | if (rw & (1 << BIO_RW)) { | |
341 | return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio); | |
342 | } | |
343 | ||
344 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 1); | |
345 | BUG_ON(ret); | |
ce9adaa5 | 346 | |
0b86a832 CM |
347 | if (offset == BTRFS_SUPER_INFO_OFFSET) { |
348 | bio->bi_bdev = root->fs_info->sb->s_bdev; | |
349 | submit_bio(rw, bio); | |
350 | return 0; | |
351 | } | |
352 | return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio); | |
353 | } | |
354 | ||
0da5468f CM |
355 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
356 | { | |
d1310b2e CM |
357 | struct extent_io_tree *tree; |
358 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
359 | return extent_write_full_page(tree, page, btree_get_extent, wbc); |
360 | } | |
0da5468f CM |
361 | |
362 | static int btree_writepages(struct address_space *mapping, | |
363 | struct writeback_control *wbc) | |
364 | { | |
d1310b2e CM |
365 | struct extent_io_tree *tree; |
366 | tree = &BTRFS_I(mapping->host)->io_tree; | |
d8d5f3e1 | 367 | if (wbc->sync_mode == WB_SYNC_NONE) { |
793955bc CM |
368 | u64 num_dirty; |
369 | u64 start = 0; | |
370 | unsigned long thresh = 96 * 1024 * 1024; | |
448d640b CM |
371 | |
372 | if (wbc->for_kupdate) | |
373 | return 0; | |
374 | ||
ca664626 CM |
375 | if (current_is_pdflush()) { |
376 | thresh = 96 * 1024 * 1024; | |
377 | } else { | |
378 | thresh = 8 * 1024 * 1024; | |
379 | } | |
1832a6d5 CM |
380 | num_dirty = count_range_bits(tree, &start, (u64)-1, |
381 | thresh, EXTENT_DIRTY); | |
793955bc CM |
382 | if (num_dirty < thresh) { |
383 | return 0; | |
384 | } | |
385 | } | |
0da5468f CM |
386 | return extent_writepages(tree, mapping, btree_get_extent, wbc); |
387 | } | |
388 | ||
5f39d397 CM |
389 | int btree_readpage(struct file *file, struct page *page) |
390 | { | |
d1310b2e CM |
391 | struct extent_io_tree *tree; |
392 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
393 | return extent_read_full_page(tree, page, btree_get_extent); |
394 | } | |
22b0ebda | 395 | |
70dec807 | 396 | static int btree_releasepage(struct page *page, gfp_t gfp_flags) |
5f39d397 | 397 | { |
d1310b2e CM |
398 | struct extent_io_tree *tree; |
399 | struct extent_map_tree *map; | |
5f39d397 | 400 | int ret; |
d98237b3 | 401 | |
d1310b2e CM |
402 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
403 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
70dec807 | 404 | ret = try_release_extent_mapping(map, tree, page, gfp_flags); |
5f39d397 | 405 | if (ret == 1) { |
728131d8 | 406 | invalidate_extent_lru(tree, page_offset(page), PAGE_CACHE_SIZE); |
5f39d397 CM |
407 | ClearPagePrivate(page); |
408 | set_page_private(page, 0); | |
409 | page_cache_release(page); | |
410 | } | |
d98237b3 CM |
411 | return ret; |
412 | } | |
413 | ||
5f39d397 | 414 | static void btree_invalidatepage(struct page *page, unsigned long offset) |
d98237b3 | 415 | { |
d1310b2e CM |
416 | struct extent_io_tree *tree; |
417 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
418 | extent_invalidatepage(tree, page, offset); |
419 | btree_releasepage(page, GFP_NOFS); | |
d98237b3 CM |
420 | } |
421 | ||
5f39d397 | 422 | #if 0 |
d98237b3 | 423 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
ed2ff2cb | 424 | { |
87cbda5c | 425 | struct buffer_head *bh; |
0f7d52f4 | 426 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
87cbda5c | 427 | struct buffer_head *head; |
87cbda5c CM |
428 | if (!page_has_buffers(page)) { |
429 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, | |
430 | (1 << BH_Dirty)|(1 << BH_Uptodate)); | |
431 | } | |
432 | head = page_buffers(page); | |
433 | bh = head; | |
434 | do { | |
435 | if (buffer_dirty(bh)) | |
436 | csum_tree_block(root, bh, 0); | |
437 | bh = bh->b_this_page; | |
438 | } while (bh != head); | |
d98237b3 | 439 | return block_write_full_page(page, btree_get_block, wbc); |
ed2ff2cb | 440 | } |
5f39d397 | 441 | #endif |
eb60ceac | 442 | |
d98237b3 CM |
443 | static struct address_space_operations btree_aops = { |
444 | .readpage = btree_readpage, | |
445 | .writepage = btree_writepage, | |
0da5468f | 446 | .writepages = btree_writepages, |
5f39d397 CM |
447 | .releasepage = btree_releasepage, |
448 | .invalidatepage = btree_invalidatepage, | |
d98237b3 CM |
449 | .sync_page = block_sync_page, |
450 | }; | |
451 | ||
db94535d | 452 | int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize) |
090d1875 | 453 | { |
5f39d397 CM |
454 | struct extent_buffer *buf = NULL; |
455 | struct inode *btree_inode = root->fs_info->btree_inode; | |
de428b63 | 456 | int ret = 0; |
090d1875 | 457 | |
db94535d | 458 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 | 459 | if (!buf) |
090d1875 | 460 | return 0; |
d1310b2e | 461 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, |
a86c12c7 | 462 | buf, 0, 0, btree_get_extent); |
5f39d397 | 463 | free_extent_buffer(buf); |
de428b63 | 464 | return ret; |
090d1875 CM |
465 | } |
466 | ||
0b86a832 CM |
467 | static int close_all_devices(struct btrfs_fs_info *fs_info) |
468 | { | |
469 | struct list_head *list; | |
470 | struct list_head *next; | |
471 | struct btrfs_device *device; | |
472 | ||
8a4b83cc CM |
473 | list = &fs_info->fs_devices->devices; |
474 | list_for_each(next, list) { | |
0b86a832 | 475 | device = list_entry(next, struct btrfs_device, dev_list); |
8a4b83cc CM |
476 | if (device->bdev && device->bdev != fs_info->sb->s_bdev) |
477 | close_bdev_excl(device->bdev); | |
478 | device->bdev = NULL; | |
0b86a832 CM |
479 | } |
480 | return 0; | |
481 | } | |
482 | ||
0999df54 CM |
483 | int btrfs_verify_block_csum(struct btrfs_root *root, |
484 | struct extent_buffer *buf) | |
eb60ceac | 485 | { |
ce9adaa5 | 486 | return btrfs_buffer_uptodate(buf); |
0999df54 CM |
487 | } |
488 | ||
489 | struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root, | |
490 | u64 bytenr, u32 blocksize) | |
491 | { | |
492 | struct inode *btree_inode = root->fs_info->btree_inode; | |
493 | struct extent_buffer *eb; | |
494 | eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree, | |
495 | bytenr, blocksize, GFP_NOFS); | |
496 | return eb; | |
497 | } | |
498 | ||
499 | struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root, | |
500 | u64 bytenr, u32 blocksize) | |
501 | { | |
502 | struct inode *btree_inode = root->fs_info->btree_inode; | |
503 | struct extent_buffer *eb; | |
504 | ||
505 | eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree, | |
506 | bytenr, blocksize, NULL, GFP_NOFS); | |
507 | return eb; | |
508 | } | |
509 | ||
510 | ||
511 | struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, | |
512 | u32 blocksize) | |
513 | { | |
514 | struct extent_buffer *buf = NULL; | |
515 | struct inode *btree_inode = root->fs_info->btree_inode; | |
516 | struct extent_io_tree *io_tree; | |
517 | int ret; | |
518 | ||
519 | io_tree = &BTRFS_I(btree_inode)->io_tree; | |
520 | ||
521 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); | |
522 | if (!buf) | |
523 | return NULL; | |
0999df54 | 524 | |
ce9adaa5 CM |
525 | ret = read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, buf, 0, |
526 | 1, btree_get_extent); | |
527 | ||
528 | if (ret == 0) { | |
529 | buf->flags |= EXTENT_UPTODATE; | |
530 | } | |
5f39d397 | 531 | return buf; |
ce9adaa5 | 532 | |
eb60ceac CM |
533 | } |
534 | ||
e089f05c | 535 | int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5f39d397 | 536 | struct extent_buffer *buf) |
ed2ff2cb | 537 | { |
5f39d397 | 538 | struct inode *btree_inode = root->fs_info->btree_inode; |
55c69072 CM |
539 | if (btrfs_header_generation(buf) == |
540 | root->fs_info->running_transaction->transid) | |
d1310b2e | 541 | clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, |
55c69072 | 542 | buf); |
5f39d397 CM |
543 | return 0; |
544 | } | |
545 | ||
546 | int wait_on_tree_block_writeback(struct btrfs_root *root, | |
547 | struct extent_buffer *buf) | |
548 | { | |
549 | struct inode *btree_inode = root->fs_info->btree_inode; | |
d1310b2e | 550 | wait_on_extent_buffer_writeback(&BTRFS_I(btree_inode)->io_tree, |
5f39d397 CM |
551 | buf); |
552 | return 0; | |
553 | } | |
554 | ||
db94535d | 555 | static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, |
87ee04eb | 556 | u32 stripesize, struct btrfs_root *root, |
9f5fae2f | 557 | struct btrfs_fs_info *fs_info, |
e20d96d6 | 558 | u64 objectid) |
d97e63b6 | 559 | { |
cfaa7295 | 560 | root->node = NULL; |
0f7d52f4 | 561 | root->inode = NULL; |
a28ec197 | 562 | root->commit_root = NULL; |
db94535d CM |
563 | root->sectorsize = sectorsize; |
564 | root->nodesize = nodesize; | |
565 | root->leafsize = leafsize; | |
87ee04eb | 566 | root->stripesize = stripesize; |
123abc88 | 567 | root->ref_cows = 0; |
0b86a832 CM |
568 | root->track_dirty = 0; |
569 | ||
9f5fae2f | 570 | root->fs_info = fs_info; |
0f7d52f4 CM |
571 | root->objectid = objectid; |
572 | root->last_trans = 0; | |
1b05da2e CM |
573 | root->highest_inode = 0; |
574 | root->last_inode_alloc = 0; | |
58176a96 | 575 | root->name = NULL; |
4313b399 | 576 | root->in_sysfs = 0; |
0b86a832 CM |
577 | |
578 | INIT_LIST_HEAD(&root->dirty_list); | |
3768f368 CM |
579 | memset(&root->root_key, 0, sizeof(root->root_key)); |
580 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
6702ed49 | 581 | memset(&root->defrag_progress, 0, sizeof(root->defrag_progress)); |
58176a96 JB |
582 | memset(&root->root_kobj, 0, sizeof(root->root_kobj)); |
583 | init_completion(&root->kobj_unregister); | |
6702ed49 CM |
584 | root->defrag_running = 0; |
585 | root->defrag_level = 0; | |
4d775673 | 586 | root->root_key.objectid = objectid; |
3768f368 CM |
587 | return 0; |
588 | } | |
589 | ||
db94535d | 590 | static int find_and_setup_root(struct btrfs_root *tree_root, |
9f5fae2f CM |
591 | struct btrfs_fs_info *fs_info, |
592 | u64 objectid, | |
e20d96d6 | 593 | struct btrfs_root *root) |
3768f368 CM |
594 | { |
595 | int ret; | |
db94535d | 596 | u32 blocksize; |
3768f368 | 597 | |
db94535d | 598 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
599 | tree_root->sectorsize, tree_root->stripesize, |
600 | root, fs_info, objectid); | |
3768f368 CM |
601 | ret = btrfs_find_last_root(tree_root, objectid, |
602 | &root->root_item, &root->root_key); | |
603 | BUG_ON(ret); | |
604 | ||
db94535d CM |
605 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
606 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
607 | blocksize); | |
3768f368 | 608 | BUG_ON(!root->node); |
d97e63b6 CM |
609 | return 0; |
610 | } | |
611 | ||
5eda7b5e CM |
612 | struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_fs_info *fs_info, |
613 | struct btrfs_key *location) | |
0f7d52f4 CM |
614 | { |
615 | struct btrfs_root *root; | |
616 | struct btrfs_root *tree_root = fs_info->tree_root; | |
617 | struct btrfs_path *path; | |
5f39d397 | 618 | struct extent_buffer *l; |
1b05da2e | 619 | u64 highest_inode; |
db94535d | 620 | u32 blocksize; |
0f7d52f4 CM |
621 | int ret = 0; |
622 | ||
5eda7b5e | 623 | root = kzalloc(sizeof(*root), GFP_NOFS); |
0cf6c620 | 624 | if (!root) |
0f7d52f4 | 625 | return ERR_PTR(-ENOMEM); |
0f7d52f4 | 626 | if (location->offset == (u64)-1) { |
db94535d | 627 | ret = find_and_setup_root(tree_root, fs_info, |
0f7d52f4 CM |
628 | location->objectid, root); |
629 | if (ret) { | |
0f7d52f4 CM |
630 | kfree(root); |
631 | return ERR_PTR(ret); | |
632 | } | |
633 | goto insert; | |
634 | } | |
635 | ||
db94535d | 636 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
637 | tree_root->sectorsize, tree_root->stripesize, |
638 | root, fs_info, location->objectid); | |
0f7d52f4 CM |
639 | |
640 | path = btrfs_alloc_path(); | |
641 | BUG_ON(!path); | |
642 | ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0); | |
643 | if (ret != 0) { | |
0f7d52f4 CM |
644 | if (ret > 0) |
645 | ret = -ENOENT; | |
646 | goto out; | |
647 | } | |
5f39d397 CM |
648 | l = path->nodes[0]; |
649 | read_extent_buffer(l, &root->root_item, | |
650 | btrfs_item_ptr_offset(l, path->slots[0]), | |
0f7d52f4 | 651 | sizeof(root->root_item)); |
44b36eb2 | 652 | memcpy(&root->root_key, location, sizeof(*location)); |
0f7d52f4 CM |
653 | ret = 0; |
654 | out: | |
655 | btrfs_release_path(root, path); | |
656 | btrfs_free_path(path); | |
657 | if (ret) { | |
658 | kfree(root); | |
659 | return ERR_PTR(ret); | |
660 | } | |
db94535d CM |
661 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
662 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
663 | blocksize); | |
0f7d52f4 CM |
664 | BUG_ON(!root->node); |
665 | insert: | |
0f7d52f4 | 666 | root->ref_cows = 1; |
5eda7b5e CM |
667 | ret = btrfs_find_highest_inode(root, &highest_inode); |
668 | if (ret == 0) { | |
669 | root->highest_inode = highest_inode; | |
670 | root->last_inode_alloc = highest_inode; | |
671 | } | |
672 | return root; | |
673 | } | |
674 | ||
dc17ff8f CM |
675 | struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info, |
676 | u64 root_objectid) | |
677 | { | |
678 | struct btrfs_root *root; | |
679 | ||
680 | if (root_objectid == BTRFS_ROOT_TREE_OBJECTID) | |
681 | return fs_info->tree_root; | |
682 | if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
683 | return fs_info->extent_root; | |
684 | ||
685 | root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
686 | (unsigned long)root_objectid); | |
687 | return root; | |
688 | } | |
689 | ||
edbd8d4e CM |
690 | struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info, |
691 | struct btrfs_key *location) | |
5eda7b5e CM |
692 | { |
693 | struct btrfs_root *root; | |
694 | int ret; | |
695 | ||
edbd8d4e CM |
696 | if (location->objectid == BTRFS_ROOT_TREE_OBJECTID) |
697 | return fs_info->tree_root; | |
698 | if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
699 | return fs_info->extent_root; | |
700 | ||
5eda7b5e CM |
701 | root = radix_tree_lookup(&fs_info->fs_roots_radix, |
702 | (unsigned long)location->objectid); | |
703 | if (root) | |
704 | return root; | |
705 | ||
706 | root = btrfs_read_fs_root_no_radix(fs_info, location); | |
707 | if (IS_ERR(root)) | |
708 | return root; | |
2619ba1f CM |
709 | ret = radix_tree_insert(&fs_info->fs_roots_radix, |
710 | (unsigned long)root->root_key.objectid, | |
0f7d52f4 CM |
711 | root); |
712 | if (ret) { | |
5f39d397 | 713 | free_extent_buffer(root->node); |
0f7d52f4 CM |
714 | kfree(root); |
715 | return ERR_PTR(ret); | |
716 | } | |
edbd8d4e CM |
717 | ret = btrfs_find_dead_roots(fs_info->tree_root, |
718 | root->root_key.objectid, root); | |
719 | BUG_ON(ret); | |
720 | ||
721 | return root; | |
722 | } | |
723 | ||
724 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info, | |
725 | struct btrfs_key *location, | |
726 | const char *name, int namelen) | |
727 | { | |
728 | struct btrfs_root *root; | |
729 | int ret; | |
730 | ||
731 | root = btrfs_read_fs_root_no_name(fs_info, location); | |
732 | if (!root) | |
733 | return NULL; | |
58176a96 | 734 | |
4313b399 CM |
735 | if (root->in_sysfs) |
736 | return root; | |
737 | ||
58176a96 JB |
738 | ret = btrfs_set_root_name(root, name, namelen); |
739 | if (ret) { | |
5f39d397 | 740 | free_extent_buffer(root->node); |
58176a96 JB |
741 | kfree(root); |
742 | return ERR_PTR(ret); | |
743 | } | |
744 | ||
745 | ret = btrfs_sysfs_add_root(root); | |
746 | if (ret) { | |
5f39d397 | 747 | free_extent_buffer(root->node); |
58176a96 JB |
748 | kfree(root->name); |
749 | kfree(root); | |
750 | return ERR_PTR(ret); | |
751 | } | |
4313b399 | 752 | root->in_sysfs = 1; |
0f7d52f4 CM |
753 | return root; |
754 | } | |
19c00ddc CM |
755 | #if 0 |
756 | static int add_hasher(struct btrfs_fs_info *info, char *type) { | |
757 | struct btrfs_hasher *hasher; | |
758 | ||
759 | hasher = kmalloc(sizeof(*hasher), GFP_NOFS); | |
760 | if (!hasher) | |
761 | return -ENOMEM; | |
762 | hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC); | |
763 | if (!hasher->hash_tfm) { | |
764 | kfree(hasher); | |
765 | return -EINVAL; | |
766 | } | |
767 | spin_lock(&info->hash_lock); | |
768 | list_add(&hasher->list, &info->hashers); | |
769 | spin_unlock(&info->hash_lock); | |
770 | return 0; | |
771 | } | |
772 | #endif | |
04160088 CM |
773 | |
774 | static int btrfs_congested_fn(void *congested_data, int bdi_bits) | |
775 | { | |
776 | struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data; | |
777 | int ret = 0; | |
778 | struct list_head *cur; | |
779 | struct btrfs_device *device; | |
780 | struct backing_dev_info *bdi; | |
781 | ||
782 | list_for_each(cur, &info->fs_devices->devices) { | |
783 | device = list_entry(cur, struct btrfs_device, dev_list); | |
784 | bdi = blk_get_backing_dev_info(device->bdev); | |
785 | if (bdi && bdi_congested(bdi, bdi_bits)) { | |
786 | ret = 1; | |
787 | break; | |
788 | } | |
789 | } | |
790 | return ret; | |
791 | } | |
792 | ||
793 | void btrfs_unplug_io_fn(struct backing_dev_info *bdi, struct page *page) | |
794 | { | |
795 | struct list_head *cur; | |
796 | struct btrfs_device *device; | |
797 | struct btrfs_fs_info *info; | |
798 | ||
799 | info = (struct btrfs_fs_info *)bdi->unplug_io_data; | |
800 | list_for_each(cur, &info->fs_devices->devices) { | |
801 | device = list_entry(cur, struct btrfs_device, dev_list); | |
802 | bdi = blk_get_backing_dev_info(device->bdev); | |
803 | if (bdi->unplug_io_fn) { | |
804 | bdi->unplug_io_fn(bdi, page); | |
805 | } | |
806 | } | |
807 | } | |
808 | ||
809 | static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi) | |
810 | { | |
811 | bdi_init(bdi); | |
83041add | 812 | bdi->ra_pages = default_backing_dev_info.ra_pages * 4; |
04160088 CM |
813 | bdi->state = 0; |
814 | bdi->capabilities = default_backing_dev_info.capabilities; | |
815 | bdi->unplug_io_fn = btrfs_unplug_io_fn; | |
816 | bdi->unplug_io_data = info; | |
817 | bdi->congested_fn = btrfs_congested_fn; | |
818 | bdi->congested_data = info; | |
819 | return 0; | |
820 | } | |
821 | ||
ce9adaa5 CM |
822 | static int bio_ready_for_csum(struct bio *bio) |
823 | { | |
824 | u64 length = 0; | |
825 | u64 buf_len = 0; | |
826 | u64 start = 0; | |
827 | struct page *page; | |
828 | struct extent_io_tree *io_tree = NULL; | |
829 | struct btrfs_fs_info *info = NULL; | |
830 | struct bio_vec *bvec; | |
831 | int i; | |
832 | int ret; | |
833 | ||
834 | bio_for_each_segment(bvec, bio, i) { | |
835 | page = bvec->bv_page; | |
836 | if (page->private == EXTENT_PAGE_PRIVATE) { | |
837 | length += bvec->bv_len; | |
838 | continue; | |
839 | } | |
840 | if (!page->private) { | |
841 | length += bvec->bv_len; | |
842 | continue; | |
843 | } | |
844 | length = bvec->bv_len; | |
845 | buf_len = page->private >> 2; | |
846 | start = page_offset(page) + bvec->bv_offset; | |
847 | io_tree = &BTRFS_I(page->mapping->host)->io_tree; | |
848 | info = BTRFS_I(page->mapping->host)->root->fs_info; | |
849 | } | |
850 | /* are we fully contained in this bio? */ | |
851 | if (buf_len <= length) | |
852 | return 1; | |
853 | ||
854 | ret = extent_range_uptodate(io_tree, start + length, | |
855 | start + buf_len - 1); | |
856 | if (ret == 1) | |
857 | return ret; | |
858 | return ret; | |
859 | } | |
860 | ||
861 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) | |
862 | void btrfs_end_io_csum(void *p) | |
863 | #else | |
864 | void btrfs_end_io_csum(struct work_struct *work) | |
865 | #endif | |
866 | { | |
867 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) | |
868 | struct btrfs_fs_info *fs_info = p; | |
869 | #else | |
870 | struct btrfs_fs_info *fs_info = container_of(work, | |
871 | struct btrfs_fs_info, | |
872 | end_io_work); | |
873 | #endif | |
874 | unsigned long flags; | |
875 | struct end_io_wq *end_io_wq; | |
876 | struct bio *bio; | |
877 | struct list_head *next; | |
878 | int error; | |
879 | int was_empty; | |
880 | ||
881 | while(1) { | |
882 | spin_lock_irqsave(&fs_info->end_io_work_lock, flags); | |
883 | if (list_empty(&fs_info->end_io_work_list)) { | |
884 | spin_unlock_irqrestore(&fs_info->end_io_work_lock, | |
885 | flags); | |
886 | return; | |
887 | } | |
888 | next = fs_info->end_io_work_list.next; | |
889 | list_del(next); | |
890 | spin_unlock_irqrestore(&fs_info->end_io_work_lock, flags); | |
891 | ||
892 | end_io_wq = list_entry(next, struct end_io_wq, list); | |
893 | ||
894 | bio = end_io_wq->bio; | |
22c59948 | 895 | if (end_io_wq->metadata && !bio_ready_for_csum(bio)) { |
ce9adaa5 CM |
896 | spin_lock_irqsave(&fs_info->end_io_work_lock, flags); |
897 | was_empty = list_empty(&fs_info->end_io_work_list); | |
898 | list_add_tail(&end_io_wq->list, | |
899 | &fs_info->end_io_work_list); | |
900 | spin_unlock_irqrestore(&fs_info->end_io_work_lock, | |
901 | flags); | |
902 | if (was_empty) | |
903 | return; | |
904 | continue; | |
905 | } | |
906 | error = end_io_wq->error; | |
907 | bio->bi_private = end_io_wq->private; | |
908 | bio->bi_end_io = end_io_wq->end_io; | |
909 | kfree(end_io_wq); | |
910 | bio_endio(bio, error); | |
911 | } | |
912 | } | |
913 | ||
914 | ||
8a4b83cc CM |
915 | struct btrfs_root *open_ctree(struct super_block *sb, |
916 | struct btrfs_fs_devices *fs_devices) | |
2e635a27 | 917 | { |
db94535d CM |
918 | u32 sectorsize; |
919 | u32 nodesize; | |
920 | u32 leafsize; | |
921 | u32 blocksize; | |
87ee04eb | 922 | u32 stripesize; |
e20d96d6 CM |
923 | struct btrfs_root *extent_root = kmalloc(sizeof(struct btrfs_root), |
924 | GFP_NOFS); | |
925 | struct btrfs_root *tree_root = kmalloc(sizeof(struct btrfs_root), | |
926 | GFP_NOFS); | |
8790d502 | 927 | struct btrfs_fs_info *fs_info = kzalloc(sizeof(*fs_info), |
e20d96d6 | 928 | GFP_NOFS); |
0b86a832 CM |
929 | struct btrfs_root *chunk_root = kmalloc(sizeof(struct btrfs_root), |
930 | GFP_NOFS); | |
931 | struct btrfs_root *dev_root = kmalloc(sizeof(struct btrfs_root), | |
932 | GFP_NOFS); | |
eb60ceac | 933 | int ret; |
e58ca020 | 934 | int err = -EINVAL; |
2c90e5d6 | 935 | struct btrfs_super_block *disk_super; |
8790d502 | 936 | |
39279cc3 CM |
937 | if (!extent_root || !tree_root || !fs_info) { |
938 | err = -ENOMEM; | |
939 | goto fail; | |
940 | } | |
ce9adaa5 CM |
941 | end_io_workqueue = create_workqueue("btrfs-end-io"); |
942 | BUG_ON(!end_io_workqueue); | |
943 | ||
0f7d52f4 | 944 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS); |
8fd17795 | 945 | INIT_LIST_HEAD(&fs_info->trans_list); |
facda1e7 | 946 | INIT_LIST_HEAD(&fs_info->dead_roots); |
19c00ddc | 947 | INIT_LIST_HEAD(&fs_info->hashers); |
ce9adaa5 | 948 | INIT_LIST_HEAD(&fs_info->end_io_work_list); |
19c00ddc | 949 | spin_lock_init(&fs_info->hash_lock); |
ce9adaa5 | 950 | spin_lock_init(&fs_info->end_io_work_lock); |
1832a6d5 | 951 | spin_lock_init(&fs_info->delalloc_lock); |
cee36a03 | 952 | spin_lock_init(&fs_info->new_trans_lock); |
19c00ddc | 953 | |
58176a96 | 954 | init_completion(&fs_info->kobj_unregister); |
2c90e5d6 | 955 | sb_set_blocksize(sb, 4096); |
9f5fae2f CM |
956 | fs_info->tree_root = tree_root; |
957 | fs_info->extent_root = extent_root; | |
0b86a832 CM |
958 | fs_info->chunk_root = chunk_root; |
959 | fs_info->dev_root = dev_root; | |
8a4b83cc | 960 | fs_info->fs_devices = fs_devices; |
0b86a832 | 961 | INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots); |
6324fbf3 | 962 | INIT_LIST_HEAD(&fs_info->space_info); |
0b86a832 | 963 | btrfs_mapping_init(&fs_info->mapping_tree); |
e20d96d6 | 964 | fs_info->sb = sb; |
c59f8951 | 965 | fs_info->max_extent = (u64)-1; |
6f568d35 | 966 | fs_info->max_inline = 8192 * 1024; |
04160088 | 967 | setup_bdi(fs_info, &fs_info->bdi); |
d98237b3 CM |
968 | fs_info->btree_inode = new_inode(sb); |
969 | fs_info->btree_inode->i_ino = 1; | |
2c90e5d6 | 970 | fs_info->btree_inode->i_nlink = 1; |
d98237b3 CM |
971 | fs_info->btree_inode->i_size = sb->s_bdev->bd_inode->i_size; |
972 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; | |
04160088 CM |
973 | fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi; |
974 | ||
d1310b2e | 975 | extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree, |
5f39d397 CM |
976 | fs_info->btree_inode->i_mapping, |
977 | GFP_NOFS); | |
d1310b2e CM |
978 | extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree, |
979 | GFP_NOFS); | |
980 | ||
981 | BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops; | |
0da5468f | 982 | |
d1310b2e | 983 | extent_io_tree_init(&fs_info->free_space_cache, |
f510cfec | 984 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 985 | extent_io_tree_init(&fs_info->block_group_cache, |
96b5179d | 986 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 987 | extent_io_tree_init(&fs_info->pinned_extents, |
1a5bc167 | 988 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 989 | extent_io_tree_init(&fs_info->pending_del, |
1a5bc167 | 990 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 991 | extent_io_tree_init(&fs_info->extent_ins, |
1a5bc167 | 992 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
e66f709b | 993 | fs_info->do_barriers = 1; |
e18e4809 | 994 | |
ce9adaa5 | 995 | INIT_WORK(&fs_info->end_io_work, btrfs_end_io_csum); |
6da6abae CM |
996 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,18) |
997 | INIT_WORK(&fs_info->trans_work, btrfs_transaction_cleaner, fs_info); | |
998 | #else | |
08607c1b | 999 | INIT_DELAYED_WORK(&fs_info->trans_work, btrfs_transaction_cleaner); |
6da6abae | 1000 | #endif |
0f7d52f4 CM |
1001 | BTRFS_I(fs_info->btree_inode)->root = tree_root; |
1002 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, | |
1003 | sizeof(struct btrfs_key)); | |
22b0ebda | 1004 | insert_inode_hash(fs_info->btree_inode); |
d98237b3 | 1005 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
39279cc3 | 1006 | |
79154b1b | 1007 | mutex_init(&fs_info->trans_mutex); |
d561c025 | 1008 | mutex_init(&fs_info->fs_mutex); |
3768f368 | 1009 | |
19c00ddc CM |
1010 | #if 0 |
1011 | ret = add_hasher(fs_info, "crc32c"); | |
1012 | if (ret) { | |
1013 | printk("btrfs: failed hash setup, modprobe cryptomgr?\n"); | |
1014 | err = -ENOMEM; | |
1015 | goto fail_iput; | |
1016 | } | |
1017 | #endif | |
0b86a832 | 1018 | __setup_root(4096, 4096, 4096, 4096, tree_root, |
2c90e5d6 | 1019 | fs_info, BTRFS_ROOT_TREE_OBJECTID); |
7eccb903 | 1020 | |
2c90e5d6 | 1021 | fs_info->sb_buffer = read_tree_block(tree_root, |
db94535d | 1022 | BTRFS_SUPER_INFO_OFFSET, |
0b86a832 | 1023 | 4096); |
d98237b3 | 1024 | |
0f7d52f4 | 1025 | if (!fs_info->sb_buffer) |
39279cc3 | 1026 | goto fail_iput; |
39279cc3 | 1027 | |
5f39d397 CM |
1028 | read_extent_buffer(fs_info->sb_buffer, &fs_info->super_copy, 0, |
1029 | sizeof(fs_info->super_copy)); | |
1030 | ||
1031 | read_extent_buffer(fs_info->sb_buffer, fs_info->fsid, | |
1032 | (unsigned long)btrfs_super_fsid(fs_info->sb_buffer), | |
1033 | BTRFS_FSID_SIZE); | |
0b86a832 | 1034 | |
5f39d397 | 1035 | disk_super = &fs_info->super_copy; |
0f7d52f4 | 1036 | if (!btrfs_super_root(disk_super)) |
39279cc3 | 1037 | goto fail_sb_buffer; |
0f7d52f4 | 1038 | |
8a4b83cc CM |
1039 | if (btrfs_super_num_devices(disk_super) != fs_devices->num_devices) { |
1040 | printk("Btrfs: wanted %llu devices, but found %llu\n", | |
1041 | (unsigned long long)btrfs_super_num_devices(disk_super), | |
1042 | (unsigned long long)fs_devices->num_devices); | |
1043 | goto fail_sb_buffer; | |
1044 | } | |
db94535d CM |
1045 | nodesize = btrfs_super_nodesize(disk_super); |
1046 | leafsize = btrfs_super_leafsize(disk_super); | |
1047 | sectorsize = btrfs_super_sectorsize(disk_super); | |
87ee04eb | 1048 | stripesize = btrfs_super_stripesize(disk_super); |
db94535d CM |
1049 | tree_root->nodesize = nodesize; |
1050 | tree_root->leafsize = leafsize; | |
1051 | tree_root->sectorsize = sectorsize; | |
87ee04eb | 1052 | tree_root->stripesize = stripesize; |
ff79f819 | 1053 | sb_set_blocksize(sb, sectorsize); |
db94535d | 1054 | |
8352d8a4 | 1055 | i_size_write(fs_info->btree_inode, |
db94535d | 1056 | btrfs_super_total_bytes(disk_super)); |
8352d8a4 | 1057 | |
39279cc3 CM |
1058 | if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC, |
1059 | sizeof(disk_super->magic))) { | |
1060 | printk("btrfs: valid FS not found on %s\n", sb->s_id); | |
1061 | goto fail_sb_buffer; | |
1062 | } | |
19c00ddc | 1063 | |
0b86a832 | 1064 | mutex_lock(&fs_info->fs_mutex); |
0d81ba5d | 1065 | |
0b86a832 CM |
1066 | ret = btrfs_read_sys_array(tree_root); |
1067 | BUG_ON(ret); | |
1068 | ||
1069 | blocksize = btrfs_level_size(tree_root, | |
1070 | btrfs_super_chunk_root_level(disk_super)); | |
1071 | ||
1072 | __setup_root(nodesize, leafsize, sectorsize, stripesize, | |
1073 | chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID); | |
1074 | ||
1075 | chunk_root->node = read_tree_block(chunk_root, | |
1076 | btrfs_super_chunk_root(disk_super), | |
1077 | blocksize); | |
1078 | BUG_ON(!chunk_root->node); | |
1079 | ||
1080 | ret = btrfs_read_chunk_tree(chunk_root); | |
1081 | BUG_ON(ret); | |
1082 | ||
db94535d CM |
1083 | blocksize = btrfs_level_size(tree_root, |
1084 | btrfs_super_root_level(disk_super)); | |
19c00ddc | 1085 | |
0b86a832 | 1086 | |
e20d96d6 | 1087 | tree_root->node = read_tree_block(tree_root, |
db94535d CM |
1088 | btrfs_super_root(disk_super), |
1089 | blocksize); | |
39279cc3 CM |
1090 | if (!tree_root->node) |
1091 | goto fail_sb_buffer; | |
3768f368 | 1092 | |
db94535d CM |
1093 | |
1094 | ret = find_and_setup_root(tree_root, fs_info, | |
e20d96d6 | 1095 | BTRFS_EXTENT_TREE_OBJECTID, extent_root); |
0b86a832 | 1096 | if (ret) |
39279cc3 | 1097 | goto fail_tree_root; |
0b86a832 CM |
1098 | extent_root->track_dirty = 1; |
1099 | ||
1100 | ret = find_and_setup_root(tree_root, fs_info, | |
1101 | BTRFS_DEV_TREE_OBJECTID, dev_root); | |
1102 | dev_root->track_dirty = 1; | |
1103 | ||
1104 | if (ret) | |
1105 | goto fail_extent_root; | |
3768f368 | 1106 | |
9078a3e1 CM |
1107 | btrfs_read_block_groups(extent_root); |
1108 | ||
0f7d52f4 | 1109 | fs_info->generation = btrfs_super_generation(disk_super) + 1; |
d18a2c44 CM |
1110 | fs_info->data_alloc_profile = (u64)-1; |
1111 | fs_info->metadata_alloc_profile = (u64)-1; | |
1112 | fs_info->system_alloc_profile = fs_info->metadata_alloc_profile; | |
1113 | ||
5be6f7f1 | 1114 | mutex_unlock(&fs_info->fs_mutex); |
0f7d52f4 | 1115 | return tree_root; |
39279cc3 | 1116 | |
0b86a832 CM |
1117 | fail_extent_root: |
1118 | free_extent_buffer(extent_root->node); | |
39279cc3 | 1119 | fail_tree_root: |
0b86a832 | 1120 | mutex_unlock(&fs_info->fs_mutex); |
5f39d397 | 1121 | free_extent_buffer(tree_root->node); |
39279cc3 | 1122 | fail_sb_buffer: |
5f39d397 | 1123 | free_extent_buffer(fs_info->sb_buffer); |
2d2ae547 | 1124 | extent_io_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->io_tree); |
39279cc3 CM |
1125 | fail_iput: |
1126 | iput(fs_info->btree_inode); | |
1127 | fail: | |
8a4b83cc | 1128 | close_all_devices(fs_info); |
39279cc3 CM |
1129 | kfree(extent_root); |
1130 | kfree(tree_root); | |
2d2ae547 | 1131 | bdi_destroy(&fs_info->bdi); |
39279cc3 CM |
1132 | kfree(fs_info); |
1133 | return ERR_PTR(err); | |
eb60ceac CM |
1134 | } |
1135 | ||
e089f05c | 1136 | int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root |
79154b1b | 1137 | *root) |
eb60ceac | 1138 | { |
e66f709b | 1139 | int ret; |
5f39d397 CM |
1140 | struct extent_buffer *super = root->fs_info->sb_buffer; |
1141 | struct inode *btree_inode = root->fs_info->btree_inode; | |
21ad10cf | 1142 | struct super_block *sb = root->fs_info->sb; |
5f39d397 | 1143 | |
21ad10cf CM |
1144 | if (!btrfs_test_opt(root, NOBARRIER)) |
1145 | blkdev_issue_flush(sb->s_bdev, NULL); | |
d1310b2e | 1146 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, super); |
5f39d397 CM |
1147 | ret = sync_page_range_nolock(btree_inode, btree_inode->i_mapping, |
1148 | super->start, super->len); | |
21ad10cf CM |
1149 | if (!btrfs_test_opt(root, NOBARRIER)) |
1150 | blkdev_issue_flush(sb->s_bdev, NULL); | |
5f39d397 | 1151 | return ret; |
cfaa7295 CM |
1152 | } |
1153 | ||
5eda7b5e | 1154 | int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
2619ba1f CM |
1155 | { |
1156 | radix_tree_delete(&fs_info->fs_roots_radix, | |
1157 | (unsigned long)root->root_key.objectid); | |
b99aa6cb CM |
1158 | if (root->in_sysfs) |
1159 | btrfs_sysfs_del_root(root); | |
2619ba1f CM |
1160 | if (root->inode) |
1161 | iput(root->inode); | |
1162 | if (root->node) | |
5f39d397 | 1163 | free_extent_buffer(root->node); |
2619ba1f | 1164 | if (root->commit_root) |
5f39d397 | 1165 | free_extent_buffer(root->commit_root); |
58176a96 JB |
1166 | if (root->name) |
1167 | kfree(root->name); | |
2619ba1f CM |
1168 | kfree(root); |
1169 | return 0; | |
1170 | } | |
1171 | ||
35b7e476 | 1172 | static int del_fs_roots(struct btrfs_fs_info *fs_info) |
0f7d52f4 CM |
1173 | { |
1174 | int ret; | |
1175 | struct btrfs_root *gang[8]; | |
1176 | int i; | |
1177 | ||
1178 | while(1) { | |
1179 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
1180 | (void **)gang, 0, | |
1181 | ARRAY_SIZE(gang)); | |
1182 | if (!ret) | |
1183 | break; | |
2619ba1f | 1184 | for (i = 0; i < ret; i++) |
5eda7b5e | 1185 | btrfs_free_fs_root(fs_info, gang[i]); |
0f7d52f4 CM |
1186 | } |
1187 | return 0; | |
1188 | } | |
b4100d64 | 1189 | |
e20d96d6 | 1190 | int close_ctree(struct btrfs_root *root) |
cfaa7295 | 1191 | { |
3768f368 | 1192 | int ret; |
e089f05c | 1193 | struct btrfs_trans_handle *trans; |
0f7d52f4 | 1194 | struct btrfs_fs_info *fs_info = root->fs_info; |
e089f05c | 1195 | |
facda1e7 | 1196 | fs_info->closing = 1; |
08607c1b | 1197 | btrfs_transaction_flush_work(root); |
0f7d52f4 | 1198 | mutex_lock(&fs_info->fs_mutex); |
6702ed49 | 1199 | btrfs_defrag_dirty_roots(root->fs_info); |
79154b1b | 1200 | trans = btrfs_start_transaction(root, 1); |
54aa1f4d | 1201 | ret = btrfs_commit_transaction(trans, root); |
79154b1b CM |
1202 | /* run commit again to drop the original snapshot */ |
1203 | trans = btrfs_start_transaction(root, 1); | |
1204 | btrfs_commit_transaction(trans, root); | |
1205 | ret = btrfs_write_and_wait_transaction(NULL, root); | |
3768f368 | 1206 | BUG_ON(ret); |
79154b1b | 1207 | write_ctree_super(NULL, root); |
0f7d52f4 CM |
1208 | mutex_unlock(&fs_info->fs_mutex); |
1209 | ||
b0c68f8b CM |
1210 | if (fs_info->delalloc_bytes) { |
1211 | printk("btrfs: at unmount delalloc count %Lu\n", | |
1212 | fs_info->delalloc_bytes); | |
1213 | } | |
0f7d52f4 | 1214 | if (fs_info->extent_root->node) |
5f39d397 | 1215 | free_extent_buffer(fs_info->extent_root->node); |
f510cfec | 1216 | |
0f7d52f4 | 1217 | if (fs_info->tree_root->node) |
5f39d397 | 1218 | free_extent_buffer(fs_info->tree_root->node); |
f510cfec | 1219 | |
0b86a832 CM |
1220 | if (root->fs_info->chunk_root->node); |
1221 | free_extent_buffer(root->fs_info->chunk_root->node); | |
1222 | ||
1223 | if (root->fs_info->dev_root->node); | |
1224 | free_extent_buffer(root->fs_info->dev_root->node); | |
1225 | ||
5f39d397 | 1226 | free_extent_buffer(fs_info->sb_buffer); |
7eccb903 | 1227 | |
9078a3e1 | 1228 | btrfs_free_block_groups(root->fs_info); |
0f7d52f4 | 1229 | del_fs_roots(fs_info); |
d10c5f31 CM |
1230 | |
1231 | filemap_write_and_wait(fs_info->btree_inode->i_mapping); | |
1232 | ||
d1310b2e CM |
1233 | extent_io_tree_empty_lru(&fs_info->free_space_cache); |
1234 | extent_io_tree_empty_lru(&fs_info->block_group_cache); | |
1235 | extent_io_tree_empty_lru(&fs_info->pinned_extents); | |
1236 | extent_io_tree_empty_lru(&fs_info->pending_del); | |
1237 | extent_io_tree_empty_lru(&fs_info->extent_ins); | |
1238 | extent_io_tree_empty_lru(&BTRFS_I(fs_info->btree_inode)->io_tree); | |
d10c5f31 | 1239 | |
db94535d | 1240 | truncate_inode_pages(fs_info->btree_inode->i_mapping, 0); |
ce9adaa5 CM |
1241 | flush_workqueue(end_io_workqueue); |
1242 | destroy_workqueue(end_io_workqueue); | |
d10c5f31 | 1243 | |
db94535d | 1244 | iput(fs_info->btree_inode); |
19c00ddc CM |
1245 | #if 0 |
1246 | while(!list_empty(&fs_info->hashers)) { | |
1247 | struct btrfs_hasher *hasher; | |
1248 | hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher, | |
1249 | hashers); | |
1250 | list_del(&hasher->hashers); | |
1251 | crypto_free_hash(&fs_info->hash_tfm); | |
1252 | kfree(hasher); | |
1253 | } | |
1254 | #endif | |
0b86a832 CM |
1255 | close_all_devices(fs_info); |
1256 | btrfs_mapping_tree_free(&fs_info->mapping_tree); | |
04160088 | 1257 | bdi_destroy(&fs_info->bdi); |
0b86a832 | 1258 | |
0f7d52f4 | 1259 | kfree(fs_info->extent_root); |
0f7d52f4 | 1260 | kfree(fs_info->tree_root); |
0b86a832 CM |
1261 | kfree(fs_info->chunk_root); |
1262 | kfree(fs_info->dev_root); | |
eb60ceac CM |
1263 | return 0; |
1264 | } | |
1265 | ||
5f39d397 CM |
1266 | int btrfs_buffer_uptodate(struct extent_buffer *buf) |
1267 | { | |
810191ff | 1268 | struct inode *btree_inode = buf->first_page->mapping->host; |
d1310b2e | 1269 | return extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf); |
5f39d397 CM |
1270 | } |
1271 | ||
1272 | int btrfs_set_buffer_uptodate(struct extent_buffer *buf) | |
ccd467d6 | 1273 | { |
810191ff | 1274 | struct inode *btree_inode = buf->first_page->mapping->host; |
d1310b2e | 1275 | return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, |
5f39d397 CM |
1276 | buf); |
1277 | } | |
6702ed49 | 1278 | |
5f39d397 CM |
1279 | void btrfs_mark_buffer_dirty(struct extent_buffer *buf) |
1280 | { | |
810191ff | 1281 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
5f39d397 CM |
1282 | u64 transid = btrfs_header_generation(buf); |
1283 | struct inode *btree_inode = root->fs_info->btree_inode; | |
6702ed49 | 1284 | |
ccd467d6 CM |
1285 | if (transid != root->fs_info->generation) { |
1286 | printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n", | |
db94535d | 1287 | (unsigned long long)buf->start, |
ccd467d6 CM |
1288 | transid, root->fs_info->generation); |
1289 | WARN_ON(1); | |
1290 | } | |
d1310b2e | 1291 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, buf); |
eb60ceac CM |
1292 | } |
1293 | ||
e2008b61 CM |
1294 | void btrfs_throttle(struct btrfs_root *root) |
1295 | { | |
55c69072 CM |
1296 | struct backing_dev_info *bdi; |
1297 | ||
1298 | bdi = root->fs_info->sb->s_bdev->bd_inode->i_mapping->backing_dev_info; | |
04005cc7 CM |
1299 | if (root->fs_info->throttles && bdi_write_congested(bdi)) { |
1300 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,18) | |
55c69072 | 1301 | congestion_wait(WRITE, HZ/20); |
04005cc7 CM |
1302 | #else |
1303 | blk_congestion_wait(WRITE, HZ/20); | |
1304 | #endif | |
1305 | } | |
e2008b61 CM |
1306 | } |
1307 | ||
d3c2fdcf | 1308 | void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr) |
35b7e476 | 1309 | { |
d3c2fdcf | 1310 | balance_dirty_pages_ratelimited_nr( |
d7fc640e | 1311 | root->fs_info->btree_inode->i_mapping, 1); |
35b7e476 | 1312 | } |
6b80053d CM |
1313 | |
1314 | void btrfs_set_buffer_defrag(struct extent_buffer *buf) | |
1315 | { | |
810191ff | 1316 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1317 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1318 | set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start, |
6b80053d CM |
1319 | buf->start + buf->len - 1, EXTENT_DEFRAG, GFP_NOFS); |
1320 | } | |
1321 | ||
1322 | void btrfs_set_buffer_defrag_done(struct extent_buffer *buf) | |
1323 | { | |
810191ff | 1324 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1325 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1326 | set_extent_bits(&BTRFS_I(btree_inode)->io_tree, buf->start, |
6b80053d CM |
1327 | buf->start + buf->len - 1, EXTENT_DEFRAG_DONE, |
1328 | GFP_NOFS); | |
1329 | } | |
1330 | ||
1331 | int btrfs_buffer_defrag(struct extent_buffer *buf) | |
1332 | { | |
810191ff | 1333 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1334 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1335 | return test_range_bit(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
1336 | buf->start, buf->start + buf->len - 1, EXTENT_DEFRAG, 0); |
1337 | } | |
1338 | ||
1339 | int btrfs_buffer_defrag_done(struct extent_buffer *buf) | |
1340 | { | |
810191ff | 1341 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1342 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1343 | return test_range_bit(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
1344 | buf->start, buf->start + buf->len - 1, |
1345 | EXTENT_DEFRAG_DONE, 0); | |
1346 | } | |
1347 | ||
1348 | int btrfs_clear_buffer_defrag_done(struct extent_buffer *buf) | |
1349 | { | |
810191ff | 1350 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1351 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1352 | return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
1353 | buf->start, buf->start + buf->len - 1, |
1354 | EXTENT_DEFRAG_DONE, GFP_NOFS); | |
1355 | } | |
1356 | ||
1357 | int btrfs_clear_buffer_defrag(struct extent_buffer *buf) | |
1358 | { | |
810191ff | 1359 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1360 | struct inode *btree_inode = root->fs_info->btree_inode; |
d1310b2e | 1361 | return clear_extent_bits(&BTRFS_I(btree_inode)->io_tree, |
6b80053d CM |
1362 | buf->start, buf->start + buf->len - 1, |
1363 | EXTENT_DEFRAG, GFP_NOFS); | |
1364 | } | |
1365 | ||
1366 | int btrfs_read_buffer(struct extent_buffer *buf) | |
1367 | { | |
810191ff | 1368 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
6b80053d | 1369 | struct inode *btree_inode = root->fs_info->btree_inode; |
ce9adaa5 CM |
1370 | int ret; |
1371 | ret = read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, | |
a86c12c7 | 1372 | buf, 0, 1, btree_get_extent); |
ce9adaa5 CM |
1373 | if (ret == 0) { |
1374 | buf->flags |= EXTENT_UPTODATE; | |
1375 | } | |
1376 | return ret; | |
6b80053d | 1377 | } |
0da5468f | 1378 | |
d1310b2e | 1379 | static struct extent_io_ops btree_extent_io_ops = { |
0da5468f | 1380 | .writepage_io_hook = btree_writepage_io_hook, |
ce9adaa5 | 1381 | .readpage_end_io_hook = btree_readpage_end_io_hook, |
0b86a832 | 1382 | .submit_bio_hook = btree_submit_bio_hook, |
239b14b3 CM |
1383 | /* note we're sharing with inode.c for the merge bio hook */ |
1384 | .merge_bio_hook = btrfs_merge_bio_hook, | |
0da5468f | 1385 | }; |