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 | ||
a74a4b97 | 19 | #include <linux/version.h> |
e20d96d6 | 20 | #include <linux/fs.h> |
d98237b3 | 21 | #include <linux/blkdev.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> |
a74a4b97 CM |
28 | #include <linux/kthread.h> |
29 | #if LINUX_VERSION_CODE >= KERNEL_VERSION(2,6,20) | |
30 | # include <linux/freezer.h> | |
31 | #else | |
32 | # include <linux/sched.h> | |
33 | #endif | |
a5eb62e3 | 34 | #include "crc32c.h" |
eb60ceac CM |
35 | #include "ctree.h" |
36 | #include "disk-io.h" | |
e089f05c | 37 | #include "transaction.h" |
0f7d52f4 | 38 | #include "btrfs_inode.h" |
0b86a832 | 39 | #include "volumes.h" |
db94535d | 40 | #include "print-tree.h" |
8b712842 | 41 | #include "async-thread.h" |
925baedd | 42 | #include "locking.h" |
017e5369 | 43 | #include "ref-cache.h" |
e02119d5 | 44 | #include "tree-log.h" |
eb60ceac | 45 | |
5f39d397 CM |
46 | #if 0 |
47 | static int check_tree_block(struct btrfs_root *root, struct extent_buffer *buf) | |
7eccb903 | 48 | { |
5f39d397 CM |
49 | if (extent_buffer_blocknr(buf) != btrfs_header_blocknr(buf)) { |
50 | printk(KERN_CRIT "buf blocknr(buf) is %llu, header is %llu\n", | |
51 | (unsigned long long)extent_buffer_blocknr(buf), | |
52 | (unsigned long long)btrfs_header_blocknr(buf)); | |
39279cc3 | 53 | return 1; |
d98237b3 | 54 | } |
9a8dd150 | 55 | return 0; |
eb60ceac | 56 | } |
5f39d397 | 57 | #endif |
eb60ceac | 58 | |
d1310b2e | 59 | static struct extent_io_ops btree_extent_io_ops; |
8b712842 | 60 | static void end_workqueue_fn(struct btrfs_work *work); |
ce9adaa5 CM |
61 | |
62 | struct end_io_wq { | |
63 | struct bio *bio; | |
64 | bio_end_io_t *end_io; | |
65 | void *private; | |
66 | struct btrfs_fs_info *info; | |
67 | int error; | |
22c59948 | 68 | int metadata; |
ce9adaa5 | 69 | struct list_head list; |
8b712842 | 70 | struct btrfs_work work; |
ce9adaa5 | 71 | }; |
0da5468f | 72 | |
44b8bd7e CM |
73 | struct async_submit_bio { |
74 | struct inode *inode; | |
75 | struct bio *bio; | |
76 | struct list_head list; | |
77 | extent_submit_bio_hook_t *submit_bio_hook; | |
78 | int rw; | |
79 | int mirror_num; | |
8b712842 | 80 | struct btrfs_work work; |
44b8bd7e CM |
81 | }; |
82 | ||
5f39d397 | 83 | struct extent_map *btree_get_extent(struct inode *inode, struct page *page, |
d1310b2e | 84 | size_t page_offset, u64 start, u64 len, |
5f39d397 | 85 | int create) |
7eccb903 | 86 | { |
5f39d397 CM |
87 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
88 | struct extent_map *em; | |
89 | int ret; | |
90 | ||
d1310b2e CM |
91 | spin_lock(&em_tree->lock); |
92 | em = lookup_extent_mapping(em_tree, start, len); | |
a061fc8d CM |
93 | if (em) { |
94 | em->bdev = | |
95 | BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; | |
96 | spin_unlock(&em_tree->lock); | |
5f39d397 | 97 | goto out; |
a061fc8d CM |
98 | } |
99 | spin_unlock(&em_tree->lock); | |
7b13b7b1 | 100 | |
5f39d397 CM |
101 | em = alloc_extent_map(GFP_NOFS); |
102 | if (!em) { | |
103 | em = ERR_PTR(-ENOMEM); | |
104 | goto out; | |
105 | } | |
106 | em->start = 0; | |
0afbaf8c | 107 | em->len = (u64)-1; |
5f39d397 | 108 | em->block_start = 0; |
a061fc8d | 109 | em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; |
d1310b2e CM |
110 | |
111 | spin_lock(&em_tree->lock); | |
5f39d397 CM |
112 | ret = add_extent_mapping(em_tree, em); |
113 | if (ret == -EEXIST) { | |
0afbaf8c CM |
114 | u64 failed_start = em->start; |
115 | u64 failed_len = em->len; | |
116 | ||
117 | printk("failed to insert %Lu %Lu -> %Lu into tree\n", | |
118 | em->start, em->len, em->block_start); | |
5f39d397 | 119 | free_extent_map(em); |
7b13b7b1 | 120 | em = lookup_extent_mapping(em_tree, start, len); |
0afbaf8c CM |
121 | if (em) { |
122 | printk("after failing, found %Lu %Lu %Lu\n", | |
123 | em->start, em->len, em->block_start); | |
7b13b7b1 | 124 | ret = 0; |
0afbaf8c CM |
125 | } else { |
126 | em = lookup_extent_mapping(em_tree, failed_start, | |
127 | failed_len); | |
128 | if (em) { | |
129 | printk("double failure lookup gives us " | |
130 | "%Lu %Lu -> %Lu\n", em->start, | |
131 | em->len, em->block_start); | |
132 | free_extent_map(em); | |
133 | } | |
7b13b7b1 | 134 | ret = -EIO; |
0afbaf8c | 135 | } |
5f39d397 | 136 | } else if (ret) { |
7b13b7b1 CM |
137 | free_extent_map(em); |
138 | em = NULL; | |
5f39d397 | 139 | } |
7b13b7b1 CM |
140 | spin_unlock(&em_tree->lock); |
141 | ||
142 | if (ret) | |
143 | em = ERR_PTR(ret); | |
5f39d397 CM |
144 | out: |
145 | return em; | |
7eccb903 CM |
146 | } |
147 | ||
19c00ddc CM |
148 | u32 btrfs_csum_data(struct btrfs_root *root, char *data, u32 seed, size_t len) |
149 | { | |
a5eb62e3 | 150 | return btrfs_crc32c(seed, data, len); |
19c00ddc CM |
151 | } |
152 | ||
153 | void btrfs_csum_final(u32 crc, char *result) | |
154 | { | |
155 | *(__le32 *)result = ~cpu_to_le32(crc); | |
156 | } | |
157 | ||
158 | static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf, | |
159 | int verify) | |
160 | { | |
161 | char result[BTRFS_CRC32_SIZE]; | |
162 | unsigned long len; | |
163 | unsigned long cur_len; | |
164 | unsigned long offset = BTRFS_CSUM_SIZE; | |
165 | char *map_token = NULL; | |
166 | char *kaddr; | |
167 | unsigned long map_start; | |
168 | unsigned long map_len; | |
169 | int err; | |
170 | u32 crc = ~(u32)0; | |
171 | ||
172 | len = buf->len - offset; | |
173 | while(len > 0) { | |
174 | err = map_private_extent_buffer(buf, offset, 32, | |
175 | &map_token, &kaddr, | |
176 | &map_start, &map_len, KM_USER0); | |
177 | if (err) { | |
178 | printk("failed to map extent buffer! %lu\n", | |
179 | offset); | |
180 | return 1; | |
181 | } | |
182 | cur_len = min(len, map_len - (offset - map_start)); | |
183 | crc = btrfs_csum_data(root, kaddr + offset - map_start, | |
184 | crc, cur_len); | |
185 | len -= cur_len; | |
186 | offset += cur_len; | |
187 | unmap_extent_buffer(buf, map_token, KM_USER0); | |
188 | } | |
189 | btrfs_csum_final(crc, result); | |
190 | ||
191 | if (verify) { | |
e4204ded | 192 | /* FIXME, this is not good */ |
63b10fc4 | 193 | if (memcmp_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE)) { |
e4204ded CM |
194 | u32 val; |
195 | u32 found = 0; | |
196 | memcpy(&found, result, BTRFS_CRC32_SIZE); | |
197 | ||
198 | read_extent_buffer(buf, &val, 0, BTRFS_CRC32_SIZE); | |
199 | printk("btrfs: %s checksum verify failed on %llu " | |
2dd3e67b | 200 | "wanted %X found %X level %d\n", |
19c00ddc | 201 | root->fs_info->sb->s_id, |
2dd3e67b | 202 | buf->start, val, found, btrfs_header_level(buf)); |
19c00ddc CM |
203 | return 1; |
204 | } | |
205 | } else { | |
206 | write_extent_buffer(buf, result, 0, BTRFS_CRC32_SIZE); | |
207 | } | |
208 | return 0; | |
209 | } | |
210 | ||
1259ab75 CM |
211 | static int verify_parent_transid(struct extent_io_tree *io_tree, |
212 | struct extent_buffer *eb, u64 parent_transid) | |
213 | { | |
214 | int ret; | |
215 | ||
216 | if (!parent_transid || btrfs_header_generation(eb) == parent_transid) | |
217 | return 0; | |
218 | ||
219 | lock_extent(io_tree, eb->start, eb->start + eb->len - 1, GFP_NOFS); | |
220 | if (extent_buffer_uptodate(io_tree, eb) && | |
221 | btrfs_header_generation(eb) == parent_transid) { | |
222 | ret = 0; | |
223 | goto out; | |
224 | } | |
225 | printk("parent transid verify failed on %llu wanted %llu found %llu\n", | |
226 | (unsigned long long)eb->start, | |
227 | (unsigned long long)parent_transid, | |
228 | (unsigned long long)btrfs_header_generation(eb)); | |
229 | ret = 1; | |
1259ab75 | 230 | clear_extent_buffer_uptodate(io_tree, eb); |
33958dc6 | 231 | out: |
1259ab75 CM |
232 | unlock_extent(io_tree, eb->start, eb->start + eb->len - 1, |
233 | GFP_NOFS); | |
234 | return ret; | |
235 | ||
236 | } | |
237 | ||
f188591e CM |
238 | static int btree_read_extent_buffer_pages(struct btrfs_root *root, |
239 | struct extent_buffer *eb, | |
ca7a79ad | 240 | u64 start, u64 parent_transid) |
f188591e CM |
241 | { |
242 | struct extent_io_tree *io_tree; | |
243 | int ret; | |
244 | int num_copies = 0; | |
245 | int mirror_num = 0; | |
246 | ||
247 | io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree; | |
248 | while (1) { | |
249 | ret = read_extent_buffer_pages(io_tree, eb, start, 1, | |
250 | btree_get_extent, mirror_num); | |
1259ab75 CM |
251 | if (!ret && |
252 | !verify_parent_transid(io_tree, eb, parent_transid)) | |
f188591e | 253 | return ret; |
a1b32a59 | 254 | printk("read extent buffer pages failed with ret %d mirror no %d\n", ret, mirror_num); |
f188591e CM |
255 | num_copies = btrfs_num_copies(&root->fs_info->mapping_tree, |
256 | eb->start, eb->len); | |
4235298e | 257 | if (num_copies == 1) |
f188591e | 258 | return ret; |
4235298e | 259 | |
f188591e | 260 | mirror_num++; |
4235298e | 261 | if (mirror_num > num_copies) |
f188591e | 262 | return ret; |
f188591e | 263 | } |
f188591e CM |
264 | return -EIO; |
265 | } | |
19c00ddc CM |
266 | |
267 | int csum_dirty_buffer(struct btrfs_root *root, struct page *page) | |
268 | { | |
d1310b2e | 269 | struct extent_io_tree *tree; |
35ebb934 | 270 | u64 start = (u64)page->index << PAGE_CACHE_SHIFT; |
19c00ddc CM |
271 | u64 found_start; |
272 | int found_level; | |
273 | unsigned long len; | |
274 | struct extent_buffer *eb; | |
f188591e CM |
275 | int ret; |
276 | ||
d1310b2e | 277 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
19c00ddc CM |
278 | |
279 | if (page->private == EXTENT_PAGE_PRIVATE) | |
280 | goto out; | |
281 | if (!page->private) | |
282 | goto out; | |
283 | len = page->private >> 2; | |
284 | if (len == 0) { | |
285 | WARN_ON(1); | |
286 | } | |
287 | eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS); | |
ca7a79ad CM |
288 | ret = btree_read_extent_buffer_pages(root, eb, start + PAGE_CACHE_SIZE, |
289 | btrfs_header_generation(eb)); | |
f188591e | 290 | BUG_ON(ret); |
19c00ddc CM |
291 | found_start = btrfs_header_bytenr(eb); |
292 | if (found_start != start) { | |
293 | printk("warning: eb start incorrect %Lu buffer %Lu len %lu\n", | |
294 | start, found_start, len); | |
55c69072 CM |
295 | WARN_ON(1); |
296 | goto err; | |
297 | } | |
298 | if (eb->first_page != page) { | |
299 | printk("bad first page %lu %lu\n", eb->first_page->index, | |
300 | page->index); | |
301 | WARN_ON(1); | |
302 | goto err; | |
303 | } | |
304 | if (!PageUptodate(page)) { | |
305 | printk("csum not up to date page %lu\n", page->index); | |
306 | WARN_ON(1); | |
307 | goto err; | |
19c00ddc CM |
308 | } |
309 | found_level = btrfs_header_level(eb); | |
63b10fc4 CM |
310 | spin_lock(&root->fs_info->hash_lock); |
311 | btrfs_set_header_flag(eb, BTRFS_HEADER_FLAG_WRITTEN); | |
312 | spin_unlock(&root->fs_info->hash_lock); | |
19c00ddc | 313 | csum_tree_block(root, eb, 0); |
55c69072 | 314 | err: |
19c00ddc CM |
315 | free_extent_buffer(eb); |
316 | out: | |
317 | return 0; | |
318 | } | |
319 | ||
0da5468f | 320 | static int btree_writepage_io_hook(struct page *page, u64 start, u64 end) |
d98237b3 | 321 | { |
19c00ddc | 322 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
19c00ddc CM |
323 | |
324 | csum_dirty_buffer(root, page); | |
0da5468f CM |
325 | return 0; |
326 | } | |
327 | ||
ce9adaa5 CM |
328 | int btree_readpage_end_io_hook(struct page *page, u64 start, u64 end, |
329 | struct extent_state *state) | |
330 | { | |
331 | struct extent_io_tree *tree; | |
332 | u64 found_start; | |
333 | int found_level; | |
334 | unsigned long len; | |
335 | struct extent_buffer *eb; | |
336 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
f188591e | 337 | int ret = 0; |
ce9adaa5 CM |
338 | |
339 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
340 | if (page->private == EXTENT_PAGE_PRIVATE) | |
341 | goto out; | |
342 | if (!page->private) | |
343 | goto out; | |
344 | len = page->private >> 2; | |
345 | if (len == 0) { | |
346 | WARN_ON(1); | |
347 | } | |
348 | eb = alloc_extent_buffer(tree, start, len, page, GFP_NOFS); | |
f188591e | 349 | |
ce9adaa5 CM |
350 | found_start = btrfs_header_bytenr(eb); |
351 | if (found_start != start) { | |
a1b32a59 CM |
352 | printk("bad tree block start %llu %llu\n", |
353 | (unsigned long long)found_start, | |
354 | (unsigned long long)eb->start); | |
f188591e | 355 | ret = -EIO; |
ce9adaa5 CM |
356 | goto err; |
357 | } | |
358 | if (eb->first_page != page) { | |
359 | printk("bad first page %lu %lu\n", eb->first_page->index, | |
360 | page->index); | |
361 | WARN_ON(1); | |
f188591e | 362 | ret = -EIO; |
ce9adaa5 CM |
363 | goto err; |
364 | } | |
1259ab75 CM |
365 | if (memcmp_extent_buffer(eb, root->fs_info->fsid, |
366 | (unsigned long)btrfs_header_fsid(eb), | |
367 | BTRFS_FSID_SIZE)) { | |
368 | printk("bad fsid on block %Lu\n", eb->start); | |
369 | ret = -EIO; | |
370 | goto err; | |
371 | } | |
ce9adaa5 CM |
372 | found_level = btrfs_header_level(eb); |
373 | ||
374 | ret = csum_tree_block(root, eb, 1); | |
f188591e CM |
375 | if (ret) |
376 | ret = -EIO; | |
ce9adaa5 CM |
377 | |
378 | end = min_t(u64, eb->len, PAGE_CACHE_SIZE); | |
379 | end = eb->start + end - 1; | |
ce9adaa5 CM |
380 | err: |
381 | free_extent_buffer(eb); | |
382 | out: | |
f188591e | 383 | return ret; |
ce9adaa5 CM |
384 | } |
385 | ||
386 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23) | |
387 | static void end_workqueue_bio(struct bio *bio, int err) | |
388 | #else | |
389 | static int end_workqueue_bio(struct bio *bio, | |
390 | unsigned int bytes_done, int err) | |
391 | #endif | |
392 | { | |
393 | struct end_io_wq *end_io_wq = bio->bi_private; | |
394 | struct btrfs_fs_info *fs_info; | |
ce9adaa5 CM |
395 | |
396 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23) | |
397 | if (bio->bi_size) | |
398 | return 1; | |
399 | #endif | |
400 | ||
401 | fs_info = end_io_wq->info; | |
ce9adaa5 | 402 | end_io_wq->error = err; |
8b712842 CM |
403 | end_io_wq->work.func = end_workqueue_fn; |
404 | end_io_wq->work.flags = 0; | |
e6dcd2dc CM |
405 | if (bio->bi_rw & (1 << BIO_RW)) |
406 | btrfs_queue_worker(&fs_info->endio_write_workers, | |
407 | &end_io_wq->work); | |
408 | else | |
409 | btrfs_queue_worker(&fs_info->endio_workers, &end_io_wq->work); | |
ce9adaa5 CM |
410 | |
411 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23) | |
412 | return 0; | |
413 | #endif | |
414 | } | |
415 | ||
22c59948 CM |
416 | int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio, |
417 | int metadata) | |
0b86a832 | 418 | { |
ce9adaa5 | 419 | struct end_io_wq *end_io_wq; |
ce9adaa5 CM |
420 | end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS); |
421 | if (!end_io_wq) | |
422 | return -ENOMEM; | |
423 | ||
424 | end_io_wq->private = bio->bi_private; | |
425 | end_io_wq->end_io = bio->bi_end_io; | |
22c59948 | 426 | end_io_wq->info = info; |
ce9adaa5 CM |
427 | end_io_wq->error = 0; |
428 | end_io_wq->bio = bio; | |
22c59948 | 429 | end_io_wq->metadata = metadata; |
ce9adaa5 CM |
430 | |
431 | bio->bi_private = end_io_wq; | |
432 | bio->bi_end_io = end_workqueue_bio; | |
22c59948 CM |
433 | return 0; |
434 | } | |
435 | ||
b64a2851 | 436 | unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info) |
0986fe9e | 437 | { |
4854ddd0 CM |
438 | unsigned long limit = min_t(unsigned long, |
439 | info->workers.max_workers, | |
440 | info->fs_devices->open_devices); | |
441 | return 256 * limit; | |
442 | } | |
0986fe9e | 443 | |
4854ddd0 CM |
444 | int btrfs_congested_async(struct btrfs_fs_info *info, int iodone) |
445 | { | |
b64a2851 CM |
446 | return atomic_read(&info->nr_async_bios) > |
447 | btrfs_async_submit_limit(info); | |
0986fe9e CM |
448 | } |
449 | ||
8b712842 CM |
450 | static void run_one_async_submit(struct btrfs_work *work) |
451 | { | |
452 | struct btrfs_fs_info *fs_info; | |
453 | struct async_submit_bio *async; | |
4854ddd0 | 454 | int limit; |
8b712842 CM |
455 | |
456 | async = container_of(work, struct async_submit_bio, work); | |
457 | fs_info = BTRFS_I(async->inode)->root->fs_info; | |
4854ddd0 | 458 | |
b64a2851 | 459 | limit = btrfs_async_submit_limit(fs_info); |
4854ddd0 CM |
460 | limit = limit * 2 / 3; |
461 | ||
8b712842 | 462 | atomic_dec(&fs_info->nr_async_submits); |
0986fe9e | 463 | |
b64a2851 CM |
464 | if (atomic_read(&fs_info->nr_async_submits) < limit && |
465 | waitqueue_active(&fs_info->async_submit_wait)) | |
4854ddd0 CM |
466 | wake_up(&fs_info->async_submit_wait); |
467 | ||
8b712842 CM |
468 | async->submit_bio_hook(async->inode, async->rw, async->bio, |
469 | async->mirror_num); | |
470 | kfree(async); | |
471 | } | |
472 | ||
44b8bd7e CM |
473 | int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode, |
474 | int rw, struct bio *bio, int mirror_num, | |
475 | extent_submit_bio_hook_t *submit_bio_hook) | |
476 | { | |
477 | struct async_submit_bio *async; | |
b64a2851 | 478 | int limit = btrfs_async_submit_limit(fs_info); |
44b8bd7e CM |
479 | |
480 | async = kmalloc(sizeof(*async), GFP_NOFS); | |
481 | if (!async) | |
482 | return -ENOMEM; | |
483 | ||
484 | async->inode = inode; | |
485 | async->rw = rw; | |
486 | async->bio = bio; | |
487 | async->mirror_num = mirror_num; | |
488 | async->submit_bio_hook = submit_bio_hook; | |
8b712842 CM |
489 | async->work.func = run_one_async_submit; |
490 | async->work.flags = 0; | |
cb03c743 | 491 | atomic_inc(&fs_info->nr_async_submits); |
8b712842 | 492 | btrfs_queue_worker(&fs_info->workers, &async->work); |
4854ddd0 | 493 | |
9473f16c CM |
494 | if (atomic_read(&fs_info->nr_async_submits) > limit) { |
495 | wait_event_timeout(fs_info->async_submit_wait, | |
4854ddd0 CM |
496 | (atomic_read(&fs_info->nr_async_submits) < limit), |
497 | HZ/10); | |
9473f16c CM |
498 | |
499 | wait_event_timeout(fs_info->async_submit_wait, | |
500 | (atomic_read(&fs_info->nr_async_bios) < limit), | |
501 | HZ/10); | |
502 | } | |
44b8bd7e CM |
503 | return 0; |
504 | } | |
505 | ||
506 | static int __btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio, | |
f188591e | 507 | int mirror_num) |
22c59948 CM |
508 | { |
509 | struct btrfs_root *root = BTRFS_I(inode)->root; | |
510 | u64 offset; | |
511 | int ret; | |
512 | ||
513 | offset = bio->bi_sector << 9; | |
514 | ||
8b712842 CM |
515 | /* |
516 | * when we're called for a write, we're already in the async | |
5443be45 | 517 | * submission context. Just jump into btrfs_map_bio |
8b712842 | 518 | */ |
22c59948 | 519 | if (rw & (1 << BIO_RW)) { |
8b712842 | 520 | return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, |
5443be45 | 521 | mirror_num, 1); |
22c59948 CM |
522 | } |
523 | ||
8b712842 CM |
524 | /* |
525 | * called for a read, do the setup so that checksum validation | |
526 | * can happen in the async kernel threads | |
527 | */ | |
22c59948 CM |
528 | ret = btrfs_bio_wq_end_io(root->fs_info, bio, 1); |
529 | BUG_ON(ret); | |
ce9adaa5 | 530 | |
8b712842 | 531 | return btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num, 1); |
0b86a832 CM |
532 | } |
533 | ||
44b8bd7e CM |
534 | static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio, |
535 | int mirror_num) | |
536 | { | |
8b712842 CM |
537 | /* |
538 | * kthread helpers are used to submit writes so that checksumming | |
539 | * can happen in parallel across all CPUs | |
540 | */ | |
44b8bd7e CM |
541 | if (!(rw & (1 << BIO_RW))) { |
542 | return __btree_submit_bio_hook(inode, rw, bio, mirror_num); | |
543 | } | |
544 | return btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info, | |
545 | inode, rw, bio, mirror_num, | |
546 | __btree_submit_bio_hook); | |
547 | } | |
548 | ||
0da5468f CM |
549 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
550 | { | |
d1310b2e CM |
551 | struct extent_io_tree *tree; |
552 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5443be45 CM |
553 | |
554 | if (current->flags & PF_MEMALLOC) { | |
555 | redirty_page_for_writepage(wbc, page); | |
556 | unlock_page(page); | |
557 | return 0; | |
558 | } | |
5f39d397 CM |
559 | return extent_write_full_page(tree, page, btree_get_extent, wbc); |
560 | } | |
0da5468f CM |
561 | |
562 | static int btree_writepages(struct address_space *mapping, | |
563 | struct writeback_control *wbc) | |
564 | { | |
d1310b2e CM |
565 | struct extent_io_tree *tree; |
566 | tree = &BTRFS_I(mapping->host)->io_tree; | |
d8d5f3e1 | 567 | if (wbc->sync_mode == WB_SYNC_NONE) { |
793955bc CM |
568 | u64 num_dirty; |
569 | u64 start = 0; | |
4854ddd0 | 570 | unsigned long thresh = 8 * 1024 * 1024; |
448d640b CM |
571 | |
572 | if (wbc->for_kupdate) | |
573 | return 0; | |
574 | ||
1832a6d5 CM |
575 | num_dirty = count_range_bits(tree, &start, (u64)-1, |
576 | thresh, EXTENT_DIRTY); | |
793955bc CM |
577 | if (num_dirty < thresh) { |
578 | return 0; | |
579 | } | |
580 | } | |
0da5468f CM |
581 | return extent_writepages(tree, mapping, btree_get_extent, wbc); |
582 | } | |
583 | ||
5f39d397 CM |
584 | int btree_readpage(struct file *file, struct page *page) |
585 | { | |
d1310b2e CM |
586 | struct extent_io_tree *tree; |
587 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
588 | return extent_read_full_page(tree, page, btree_get_extent); |
589 | } | |
22b0ebda | 590 | |
70dec807 | 591 | static int btree_releasepage(struct page *page, gfp_t gfp_flags) |
5f39d397 | 592 | { |
d1310b2e CM |
593 | struct extent_io_tree *tree; |
594 | struct extent_map_tree *map; | |
5f39d397 | 595 | int ret; |
d98237b3 | 596 | |
d1310b2e CM |
597 | tree = &BTRFS_I(page->mapping->host)->io_tree; |
598 | map = &BTRFS_I(page->mapping->host)->extent_tree; | |
6af118ce | 599 | |
7b13b7b1 | 600 | ret = try_release_extent_state(map, tree, page, gfp_flags); |
6af118ce CM |
601 | if (!ret) { |
602 | return 0; | |
603 | } | |
604 | ||
605 | ret = try_release_extent_buffer(tree, page); | |
5f39d397 CM |
606 | if (ret == 1) { |
607 | ClearPagePrivate(page); | |
608 | set_page_private(page, 0); | |
609 | page_cache_release(page); | |
610 | } | |
6af118ce | 611 | |
d98237b3 CM |
612 | return ret; |
613 | } | |
614 | ||
5f39d397 | 615 | static void btree_invalidatepage(struct page *page, unsigned long offset) |
d98237b3 | 616 | { |
d1310b2e CM |
617 | struct extent_io_tree *tree; |
618 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
619 | extent_invalidatepage(tree, page, offset); |
620 | btree_releasepage(page, GFP_NOFS); | |
9ad6b7bc | 621 | if (PagePrivate(page)) { |
6af118ce CM |
622 | printk("warning page private not zero on page %Lu\n", |
623 | page_offset(page)); | |
9ad6b7bc CM |
624 | ClearPagePrivate(page); |
625 | set_page_private(page, 0); | |
626 | page_cache_release(page); | |
627 | } | |
d98237b3 CM |
628 | } |
629 | ||
5f39d397 | 630 | #if 0 |
d98237b3 | 631 | static int btree_writepage(struct page *page, struct writeback_control *wbc) |
ed2ff2cb | 632 | { |
87cbda5c | 633 | struct buffer_head *bh; |
0f7d52f4 | 634 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; |
87cbda5c | 635 | struct buffer_head *head; |
87cbda5c CM |
636 | if (!page_has_buffers(page)) { |
637 | create_empty_buffers(page, root->fs_info->sb->s_blocksize, | |
638 | (1 << BH_Dirty)|(1 << BH_Uptodate)); | |
639 | } | |
640 | head = page_buffers(page); | |
641 | bh = head; | |
642 | do { | |
643 | if (buffer_dirty(bh)) | |
644 | csum_tree_block(root, bh, 0); | |
645 | bh = bh->b_this_page; | |
646 | } while (bh != head); | |
d98237b3 | 647 | return block_write_full_page(page, btree_get_block, wbc); |
ed2ff2cb | 648 | } |
5f39d397 | 649 | #endif |
eb60ceac | 650 | |
d98237b3 CM |
651 | static struct address_space_operations btree_aops = { |
652 | .readpage = btree_readpage, | |
653 | .writepage = btree_writepage, | |
0da5468f | 654 | .writepages = btree_writepages, |
5f39d397 CM |
655 | .releasepage = btree_releasepage, |
656 | .invalidatepage = btree_invalidatepage, | |
d98237b3 CM |
657 | .sync_page = block_sync_page, |
658 | }; | |
659 | ||
ca7a79ad CM |
660 | int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize, |
661 | u64 parent_transid) | |
090d1875 | 662 | { |
5f39d397 CM |
663 | struct extent_buffer *buf = NULL; |
664 | struct inode *btree_inode = root->fs_info->btree_inode; | |
de428b63 | 665 | int ret = 0; |
090d1875 | 666 | |
db94535d | 667 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); |
5f39d397 | 668 | if (!buf) |
090d1875 | 669 | return 0; |
d1310b2e | 670 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, |
f188591e | 671 | buf, 0, 0, btree_get_extent, 0); |
5f39d397 | 672 | free_extent_buffer(buf); |
de428b63 | 673 | return ret; |
090d1875 CM |
674 | } |
675 | ||
0999df54 CM |
676 | struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root, |
677 | u64 bytenr, u32 blocksize) | |
678 | { | |
679 | struct inode *btree_inode = root->fs_info->btree_inode; | |
680 | struct extent_buffer *eb; | |
681 | eb = find_extent_buffer(&BTRFS_I(btree_inode)->io_tree, | |
682 | bytenr, blocksize, GFP_NOFS); | |
683 | return eb; | |
684 | } | |
685 | ||
686 | struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root, | |
687 | u64 bytenr, u32 blocksize) | |
688 | { | |
689 | struct inode *btree_inode = root->fs_info->btree_inode; | |
690 | struct extent_buffer *eb; | |
691 | ||
692 | eb = alloc_extent_buffer(&BTRFS_I(btree_inode)->io_tree, | |
693 | bytenr, blocksize, NULL, GFP_NOFS); | |
694 | return eb; | |
695 | } | |
696 | ||
697 | ||
e02119d5 CM |
698 | int btrfs_write_tree_block(struct extent_buffer *buf) |
699 | { | |
700 | return btrfs_fdatawrite_range(buf->first_page->mapping, buf->start, | |
701 | buf->start + buf->len - 1, WB_SYNC_NONE); | |
702 | } | |
703 | ||
704 | int btrfs_wait_tree_block_writeback(struct extent_buffer *buf) | |
705 | { | |
706 | return btrfs_wait_on_page_writeback_range(buf->first_page->mapping, | |
707 | buf->start, buf->start + buf->len -1); | |
708 | } | |
709 | ||
0999df54 | 710 | struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, |
ca7a79ad | 711 | u32 blocksize, u64 parent_transid) |
0999df54 CM |
712 | { |
713 | struct extent_buffer *buf = NULL; | |
714 | struct inode *btree_inode = root->fs_info->btree_inode; | |
715 | struct extent_io_tree *io_tree; | |
716 | int ret; | |
717 | ||
718 | io_tree = &BTRFS_I(btree_inode)->io_tree; | |
719 | ||
720 | buf = btrfs_find_create_tree_block(root, bytenr, blocksize); | |
721 | if (!buf) | |
722 | return NULL; | |
0999df54 | 723 | |
ca7a79ad | 724 | ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid); |
ce9adaa5 CM |
725 | |
726 | if (ret == 0) { | |
727 | buf->flags |= EXTENT_UPTODATE; | |
a1b32a59 CM |
728 | } else { |
729 | WARN_ON(1); | |
ce9adaa5 | 730 | } |
5f39d397 | 731 | return buf; |
ce9adaa5 | 732 | |
eb60ceac CM |
733 | } |
734 | ||
e089f05c | 735 | int clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, |
5f39d397 | 736 | struct extent_buffer *buf) |
ed2ff2cb | 737 | { |
5f39d397 | 738 | struct inode *btree_inode = root->fs_info->btree_inode; |
55c69072 | 739 | if (btrfs_header_generation(buf) == |
925baedd CM |
740 | root->fs_info->running_transaction->transid) { |
741 | WARN_ON(!btrfs_tree_locked(buf)); | |
d1310b2e | 742 | clear_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, |
55c69072 | 743 | buf); |
925baedd | 744 | } |
5f39d397 CM |
745 | return 0; |
746 | } | |
747 | ||
db94535d | 748 | static int __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize, |
87ee04eb | 749 | u32 stripesize, struct btrfs_root *root, |
9f5fae2f | 750 | struct btrfs_fs_info *fs_info, |
e20d96d6 | 751 | u64 objectid) |
d97e63b6 | 752 | { |
cfaa7295 | 753 | root->node = NULL; |
0f7d52f4 | 754 | root->inode = NULL; |
a28ec197 | 755 | root->commit_root = NULL; |
31153d81 | 756 | root->ref_tree = NULL; |
db94535d CM |
757 | root->sectorsize = sectorsize; |
758 | root->nodesize = nodesize; | |
759 | root->leafsize = leafsize; | |
87ee04eb | 760 | root->stripesize = stripesize; |
123abc88 | 761 | root->ref_cows = 0; |
0b86a832 CM |
762 | root->track_dirty = 0; |
763 | ||
9f5fae2f | 764 | root->fs_info = fs_info; |
0f7d52f4 CM |
765 | root->objectid = objectid; |
766 | root->last_trans = 0; | |
1b05da2e CM |
767 | root->highest_inode = 0; |
768 | root->last_inode_alloc = 0; | |
58176a96 | 769 | root->name = NULL; |
4313b399 | 770 | root->in_sysfs = 0; |
0b86a832 CM |
771 | |
772 | INIT_LIST_HEAD(&root->dirty_list); | |
7b128766 | 773 | INIT_LIST_HEAD(&root->orphan_list); |
bcc63abb | 774 | INIT_LIST_HEAD(&root->dead_list); |
925baedd | 775 | spin_lock_init(&root->node_lock); |
bcc63abb | 776 | spin_lock_init(&root->list_lock); |
a2135011 | 777 | mutex_init(&root->objectid_mutex); |
e02119d5 | 778 | mutex_init(&root->log_mutex); |
017e5369 CM |
779 | |
780 | btrfs_leaf_ref_tree_init(&root->ref_tree_struct); | |
781 | root->ref_tree = &root->ref_tree_struct; | |
782 | ||
3768f368 CM |
783 | memset(&root->root_key, 0, sizeof(root->root_key)); |
784 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
6702ed49 | 785 | memset(&root->defrag_progress, 0, sizeof(root->defrag_progress)); |
58176a96 | 786 | memset(&root->root_kobj, 0, sizeof(root->root_kobj)); |
3f157a2f | 787 | root->defrag_trans_start = fs_info->generation; |
58176a96 | 788 | init_completion(&root->kobj_unregister); |
6702ed49 CM |
789 | root->defrag_running = 0; |
790 | root->defrag_level = 0; | |
4d775673 | 791 | root->root_key.objectid = objectid; |
3768f368 CM |
792 | return 0; |
793 | } | |
794 | ||
db94535d | 795 | static int find_and_setup_root(struct btrfs_root *tree_root, |
9f5fae2f CM |
796 | struct btrfs_fs_info *fs_info, |
797 | u64 objectid, | |
e20d96d6 | 798 | struct btrfs_root *root) |
3768f368 CM |
799 | { |
800 | int ret; | |
db94535d | 801 | u32 blocksize; |
3768f368 | 802 | |
db94535d | 803 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
804 | tree_root->sectorsize, tree_root->stripesize, |
805 | root, fs_info, objectid); | |
3768f368 CM |
806 | ret = btrfs_find_last_root(tree_root, objectid, |
807 | &root->root_item, &root->root_key); | |
808 | BUG_ON(ret); | |
809 | ||
db94535d CM |
810 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
811 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
ca7a79ad | 812 | blocksize, 0); |
3768f368 | 813 | BUG_ON(!root->node); |
d97e63b6 CM |
814 | return 0; |
815 | } | |
816 | ||
e02119d5 CM |
817 | int btrfs_free_log_root_tree(struct btrfs_trans_handle *trans, |
818 | struct btrfs_fs_info *fs_info) | |
819 | { | |
820 | struct extent_buffer *eb; | |
821 | int ret; | |
822 | ||
823 | if (!fs_info->log_root_tree) | |
824 | return 0; | |
825 | ||
826 | eb = fs_info->log_root_tree->node; | |
827 | ||
828 | WARN_ON(btrfs_header_level(eb) != 0); | |
829 | WARN_ON(btrfs_header_nritems(eb) != 0); | |
830 | ||
831 | ret = btrfs_free_extent(trans, fs_info->tree_root, | |
832 | eb->start, eb->len, | |
833 | BTRFS_TREE_LOG_OBJECTID, 0, 0, 0, 1); | |
834 | BUG_ON(ret); | |
835 | ||
836 | free_extent_buffer(eb); | |
837 | kfree(fs_info->log_root_tree); | |
838 | fs_info->log_root_tree = NULL; | |
839 | return 0; | |
840 | } | |
841 | ||
842 | int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans, | |
843 | struct btrfs_fs_info *fs_info) | |
0f7d52f4 CM |
844 | { |
845 | struct btrfs_root *root; | |
846 | struct btrfs_root *tree_root = fs_info->tree_root; | |
e02119d5 CM |
847 | |
848 | root = kzalloc(sizeof(*root), GFP_NOFS); | |
849 | if (!root) | |
850 | return -ENOMEM; | |
851 | ||
852 | __setup_root(tree_root->nodesize, tree_root->leafsize, | |
853 | tree_root->sectorsize, tree_root->stripesize, | |
854 | root, fs_info, BTRFS_TREE_LOG_OBJECTID); | |
855 | ||
856 | root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID; | |
857 | root->root_key.type = BTRFS_ROOT_ITEM_KEY; | |
858 | root->root_key.offset = BTRFS_TREE_LOG_OBJECTID; | |
859 | root->ref_cows = 0; | |
860 | ||
861 | root->node = btrfs_alloc_free_block(trans, root, root->leafsize, | |
862 | BTRFS_TREE_LOG_OBJECTID, | |
863 | 0, 0, 0, 0, 0); | |
864 | ||
865 | btrfs_set_header_nritems(root->node, 0); | |
866 | btrfs_set_header_level(root->node, 0); | |
867 | btrfs_set_header_bytenr(root->node, root->node->start); | |
868 | btrfs_set_header_generation(root->node, trans->transid); | |
869 | btrfs_set_header_owner(root->node, BTRFS_TREE_LOG_OBJECTID); | |
870 | ||
871 | write_extent_buffer(root->node, root->fs_info->fsid, | |
872 | (unsigned long)btrfs_header_fsid(root->node), | |
873 | BTRFS_FSID_SIZE); | |
874 | btrfs_mark_buffer_dirty(root->node); | |
875 | btrfs_tree_unlock(root->node); | |
876 | fs_info->log_root_tree = root; | |
877 | return 0; | |
878 | } | |
879 | ||
880 | struct btrfs_root *btrfs_read_fs_root_no_radix(struct btrfs_root *tree_root, | |
881 | struct btrfs_key *location) | |
882 | { | |
883 | struct btrfs_root *root; | |
884 | struct btrfs_fs_info *fs_info = tree_root->fs_info; | |
0f7d52f4 | 885 | struct btrfs_path *path; |
5f39d397 | 886 | struct extent_buffer *l; |
1b05da2e | 887 | u64 highest_inode; |
db94535d | 888 | u32 blocksize; |
0f7d52f4 CM |
889 | int ret = 0; |
890 | ||
5eda7b5e | 891 | root = kzalloc(sizeof(*root), GFP_NOFS); |
0cf6c620 | 892 | if (!root) |
0f7d52f4 | 893 | return ERR_PTR(-ENOMEM); |
0f7d52f4 | 894 | if (location->offset == (u64)-1) { |
db94535d | 895 | ret = find_and_setup_root(tree_root, fs_info, |
0f7d52f4 CM |
896 | location->objectid, root); |
897 | if (ret) { | |
0f7d52f4 CM |
898 | kfree(root); |
899 | return ERR_PTR(ret); | |
900 | } | |
901 | goto insert; | |
902 | } | |
903 | ||
db94535d | 904 | __setup_root(tree_root->nodesize, tree_root->leafsize, |
87ee04eb CM |
905 | tree_root->sectorsize, tree_root->stripesize, |
906 | root, fs_info, location->objectid); | |
0f7d52f4 CM |
907 | |
908 | path = btrfs_alloc_path(); | |
909 | BUG_ON(!path); | |
910 | ret = btrfs_search_slot(NULL, tree_root, location, path, 0, 0); | |
911 | if (ret != 0) { | |
0f7d52f4 CM |
912 | if (ret > 0) |
913 | ret = -ENOENT; | |
914 | goto out; | |
915 | } | |
5f39d397 CM |
916 | l = path->nodes[0]; |
917 | read_extent_buffer(l, &root->root_item, | |
918 | btrfs_item_ptr_offset(l, path->slots[0]), | |
0f7d52f4 | 919 | sizeof(root->root_item)); |
44b36eb2 | 920 | memcpy(&root->root_key, location, sizeof(*location)); |
0f7d52f4 CM |
921 | ret = 0; |
922 | out: | |
923 | btrfs_release_path(root, path); | |
924 | btrfs_free_path(path); | |
925 | if (ret) { | |
926 | kfree(root); | |
927 | return ERR_PTR(ret); | |
928 | } | |
db94535d CM |
929 | blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item)); |
930 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), | |
ca7a79ad | 931 | blocksize, 0); |
0f7d52f4 CM |
932 | BUG_ON(!root->node); |
933 | insert: | |
e02119d5 CM |
934 | if (location->objectid != BTRFS_TREE_LOG_OBJECTID) { |
935 | root->ref_cows = 1; | |
936 | ret = btrfs_find_highest_inode(root, &highest_inode); | |
937 | if (ret == 0) { | |
938 | root->highest_inode = highest_inode; | |
939 | root->last_inode_alloc = highest_inode; | |
940 | } | |
5eda7b5e CM |
941 | } |
942 | return root; | |
943 | } | |
944 | ||
dc17ff8f CM |
945 | struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info, |
946 | u64 root_objectid) | |
947 | { | |
948 | struct btrfs_root *root; | |
949 | ||
950 | if (root_objectid == BTRFS_ROOT_TREE_OBJECTID) | |
951 | return fs_info->tree_root; | |
952 | if (root_objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
953 | return fs_info->extent_root; | |
954 | ||
955 | root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
956 | (unsigned long)root_objectid); | |
957 | return root; | |
958 | } | |
959 | ||
edbd8d4e CM |
960 | struct btrfs_root *btrfs_read_fs_root_no_name(struct btrfs_fs_info *fs_info, |
961 | struct btrfs_key *location) | |
5eda7b5e CM |
962 | { |
963 | struct btrfs_root *root; | |
964 | int ret; | |
965 | ||
edbd8d4e CM |
966 | if (location->objectid == BTRFS_ROOT_TREE_OBJECTID) |
967 | return fs_info->tree_root; | |
968 | if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
969 | return fs_info->extent_root; | |
8f18cf13 CM |
970 | if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID) |
971 | return fs_info->chunk_root; | |
972 | if (location->objectid == BTRFS_DEV_TREE_OBJECTID) | |
973 | return fs_info->dev_root; | |
edbd8d4e | 974 | |
5eda7b5e CM |
975 | root = radix_tree_lookup(&fs_info->fs_roots_radix, |
976 | (unsigned long)location->objectid); | |
977 | if (root) | |
978 | return root; | |
979 | ||
e02119d5 | 980 | root = btrfs_read_fs_root_no_radix(fs_info->tree_root, location); |
5eda7b5e CM |
981 | if (IS_ERR(root)) |
982 | return root; | |
2619ba1f CM |
983 | ret = radix_tree_insert(&fs_info->fs_roots_radix, |
984 | (unsigned long)root->root_key.objectid, | |
0f7d52f4 CM |
985 | root); |
986 | if (ret) { | |
5f39d397 | 987 | free_extent_buffer(root->node); |
0f7d52f4 CM |
988 | kfree(root); |
989 | return ERR_PTR(ret); | |
990 | } | |
edbd8d4e CM |
991 | ret = btrfs_find_dead_roots(fs_info->tree_root, |
992 | root->root_key.objectid, root); | |
993 | BUG_ON(ret); | |
994 | ||
995 | return root; | |
996 | } | |
997 | ||
998 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_fs_info *fs_info, | |
999 | struct btrfs_key *location, | |
1000 | const char *name, int namelen) | |
1001 | { | |
1002 | struct btrfs_root *root; | |
1003 | int ret; | |
1004 | ||
1005 | root = btrfs_read_fs_root_no_name(fs_info, location); | |
1006 | if (!root) | |
1007 | return NULL; | |
58176a96 | 1008 | |
4313b399 CM |
1009 | if (root->in_sysfs) |
1010 | return root; | |
1011 | ||
58176a96 JB |
1012 | ret = btrfs_set_root_name(root, name, namelen); |
1013 | if (ret) { | |
5f39d397 | 1014 | free_extent_buffer(root->node); |
58176a96 JB |
1015 | kfree(root); |
1016 | return ERR_PTR(ret); | |
1017 | } | |
1018 | ||
1019 | ret = btrfs_sysfs_add_root(root); | |
1020 | if (ret) { | |
5f39d397 | 1021 | free_extent_buffer(root->node); |
58176a96 JB |
1022 | kfree(root->name); |
1023 | kfree(root); | |
1024 | return ERR_PTR(ret); | |
1025 | } | |
4313b399 | 1026 | root->in_sysfs = 1; |
0f7d52f4 CM |
1027 | return root; |
1028 | } | |
19c00ddc CM |
1029 | #if 0 |
1030 | static int add_hasher(struct btrfs_fs_info *info, char *type) { | |
1031 | struct btrfs_hasher *hasher; | |
1032 | ||
1033 | hasher = kmalloc(sizeof(*hasher), GFP_NOFS); | |
1034 | if (!hasher) | |
1035 | return -ENOMEM; | |
1036 | hasher->hash_tfm = crypto_alloc_hash(type, 0, CRYPTO_ALG_ASYNC); | |
1037 | if (!hasher->hash_tfm) { | |
1038 | kfree(hasher); | |
1039 | return -EINVAL; | |
1040 | } | |
1041 | spin_lock(&info->hash_lock); | |
1042 | list_add(&hasher->list, &info->hashers); | |
1043 | spin_unlock(&info->hash_lock); | |
1044 | return 0; | |
1045 | } | |
1046 | #endif | |
04160088 CM |
1047 | |
1048 | static int btrfs_congested_fn(void *congested_data, int bdi_bits) | |
1049 | { | |
1050 | struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data; | |
1051 | int ret = 0; | |
1052 | struct list_head *cur; | |
1053 | struct btrfs_device *device; | |
1054 | struct backing_dev_info *bdi; | |
1055 | ||
cb03c743 | 1056 | if ((bdi_bits & (1 << BDI_write_congested)) && |
777e6bd7 | 1057 | btrfs_congested_async(info, 0)) |
cb03c743 | 1058 | return 1; |
cb03c743 | 1059 | |
04160088 CM |
1060 | list_for_each(cur, &info->fs_devices->devices) { |
1061 | device = list_entry(cur, struct btrfs_device, dev_list); | |
dfe25020 CM |
1062 | if (!device->bdev) |
1063 | continue; | |
04160088 CM |
1064 | bdi = blk_get_backing_dev_info(device->bdev); |
1065 | if (bdi && bdi_congested(bdi, bdi_bits)) { | |
1066 | ret = 1; | |
1067 | break; | |
1068 | } | |
1069 | } | |
1070 | return ret; | |
1071 | } | |
1072 | ||
38b66988 CM |
1073 | /* |
1074 | * this unplugs every device on the box, and it is only used when page | |
1075 | * is null | |
1076 | */ | |
1077 | static void __unplug_io_fn(struct backing_dev_info *bdi, struct page *page) | |
1078 | { | |
1079 | struct list_head *cur; | |
1080 | struct btrfs_device *device; | |
1081 | struct btrfs_fs_info *info; | |
1082 | ||
1083 | info = (struct btrfs_fs_info *)bdi->unplug_io_data; | |
1084 | list_for_each(cur, &info->fs_devices->devices) { | |
1085 | device = list_entry(cur, struct btrfs_device, dev_list); | |
1086 | bdi = blk_get_backing_dev_info(device->bdev); | |
1087 | if (bdi->unplug_io_fn) { | |
1088 | bdi->unplug_io_fn(bdi, page); | |
1089 | } | |
1090 | } | |
1091 | } | |
1092 | ||
04160088 CM |
1093 | void btrfs_unplug_io_fn(struct backing_dev_info *bdi, struct page *page) |
1094 | { | |
38b66988 | 1095 | struct inode *inode; |
f2d8d74d CM |
1096 | struct extent_map_tree *em_tree; |
1097 | struct extent_map *em; | |
bcbfce8a | 1098 | struct address_space *mapping; |
38b66988 CM |
1099 | u64 offset; |
1100 | ||
bcbfce8a | 1101 | /* the generic O_DIRECT read code does this */ |
38b66988 CM |
1102 | if (!page) { |
1103 | __unplug_io_fn(bdi, page); | |
1104 | return; | |
1105 | } | |
1106 | ||
bcbfce8a CM |
1107 | /* |
1108 | * page->mapping may change at any time. Get a consistent copy | |
1109 | * and use that for everything below | |
1110 | */ | |
1111 | smp_mb(); | |
1112 | mapping = page->mapping; | |
1113 | if (!mapping) | |
1114 | return; | |
1115 | ||
1116 | inode = mapping->host; | |
38b66988 | 1117 | offset = page_offset(page); |
04160088 | 1118 | |
f2d8d74d CM |
1119 | em_tree = &BTRFS_I(inode)->extent_tree; |
1120 | spin_lock(&em_tree->lock); | |
1121 | em = lookup_extent_mapping(em_tree, offset, PAGE_CACHE_SIZE); | |
1122 | spin_unlock(&em_tree->lock); | |
89642229 CM |
1123 | if (!em) { |
1124 | __unplug_io_fn(bdi, page); | |
f2d8d74d | 1125 | return; |
89642229 | 1126 | } |
f2d8d74d | 1127 | |
89642229 CM |
1128 | if (em->block_start >= EXTENT_MAP_LAST_BYTE) { |
1129 | free_extent_map(em); | |
1130 | __unplug_io_fn(bdi, page); | |
1131 | return; | |
1132 | } | |
f2d8d74d CM |
1133 | offset = offset - em->start; |
1134 | btrfs_unplug_page(&BTRFS_I(inode)->root->fs_info->mapping_tree, | |
1135 | em->block_start + offset, page); | |
1136 | free_extent_map(em); | |
04160088 CM |
1137 | } |
1138 | ||
1139 | static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi) | |
1140 | { | |
51ebc0d3 | 1141 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23) |
04160088 | 1142 | bdi_init(bdi); |
b248a415 | 1143 | #endif |
4575c9cc | 1144 | bdi->ra_pages = default_backing_dev_info.ra_pages; |
04160088 CM |
1145 | bdi->state = 0; |
1146 | bdi->capabilities = default_backing_dev_info.capabilities; | |
1147 | bdi->unplug_io_fn = btrfs_unplug_io_fn; | |
1148 | bdi->unplug_io_data = info; | |
1149 | bdi->congested_fn = btrfs_congested_fn; | |
1150 | bdi->congested_data = info; | |
1151 | return 0; | |
1152 | } | |
1153 | ||
ce9adaa5 CM |
1154 | static int bio_ready_for_csum(struct bio *bio) |
1155 | { | |
1156 | u64 length = 0; | |
1157 | u64 buf_len = 0; | |
1158 | u64 start = 0; | |
1159 | struct page *page; | |
1160 | struct extent_io_tree *io_tree = NULL; | |
1161 | struct btrfs_fs_info *info = NULL; | |
1162 | struct bio_vec *bvec; | |
1163 | int i; | |
1164 | int ret; | |
1165 | ||
1166 | bio_for_each_segment(bvec, bio, i) { | |
1167 | page = bvec->bv_page; | |
1168 | if (page->private == EXTENT_PAGE_PRIVATE) { | |
1169 | length += bvec->bv_len; | |
1170 | continue; | |
1171 | } | |
1172 | if (!page->private) { | |
1173 | length += bvec->bv_len; | |
1174 | continue; | |
1175 | } | |
1176 | length = bvec->bv_len; | |
1177 | buf_len = page->private >> 2; | |
1178 | start = page_offset(page) + bvec->bv_offset; | |
1179 | io_tree = &BTRFS_I(page->mapping->host)->io_tree; | |
1180 | info = BTRFS_I(page->mapping->host)->root->fs_info; | |
1181 | } | |
1182 | /* are we fully contained in this bio? */ | |
1183 | if (buf_len <= length) | |
1184 | return 1; | |
1185 | ||
1186 | ret = extent_range_uptodate(io_tree, start + length, | |
1187 | start + buf_len - 1); | |
1188 | if (ret == 1) | |
1189 | return ret; | |
1190 | return ret; | |
1191 | } | |
1192 | ||
8b712842 CM |
1193 | /* |
1194 | * called by the kthread helper functions to finally call the bio end_io | |
1195 | * functions. This is where read checksum verification actually happens | |
1196 | */ | |
1197 | static void end_workqueue_fn(struct btrfs_work *work) | |
ce9adaa5 | 1198 | { |
ce9adaa5 | 1199 | struct bio *bio; |
8b712842 CM |
1200 | struct end_io_wq *end_io_wq; |
1201 | struct btrfs_fs_info *fs_info; | |
ce9adaa5 | 1202 | int error; |
ce9adaa5 | 1203 | |
8b712842 CM |
1204 | end_io_wq = container_of(work, struct end_io_wq, work); |
1205 | bio = end_io_wq->bio; | |
1206 | fs_info = end_io_wq->info; | |
ce9adaa5 | 1207 | |
8b712842 CM |
1208 | /* metadata bios are special because the whole tree block must |
1209 | * be checksummed at once. This makes sure the entire block is in | |
1210 | * ram and up to date before trying to verify things. For | |
1211 | * blocksize <= pagesize, it is basically a noop | |
1212 | */ | |
1213 | if (end_io_wq->metadata && !bio_ready_for_csum(bio)) { | |
1214 | btrfs_queue_worker(&fs_info->endio_workers, | |
1215 | &end_io_wq->work); | |
1216 | return; | |
1217 | } | |
1218 | error = end_io_wq->error; | |
1219 | bio->bi_private = end_io_wq->private; | |
1220 | bio->bi_end_io = end_io_wq->end_io; | |
1221 | kfree(end_io_wq); | |
1222 | #if LINUX_VERSION_CODE <= KERNEL_VERSION(2,6,23) | |
1223 | bio_endio(bio, bio->bi_size, error); | |
44b8bd7e | 1224 | #else |
8b712842 | 1225 | bio_endio(bio, error); |
44b8bd7e | 1226 | #endif |
44b8bd7e CM |
1227 | } |
1228 | ||
a74a4b97 CM |
1229 | static int cleaner_kthread(void *arg) |
1230 | { | |
1231 | struct btrfs_root *root = arg; | |
1232 | ||
1233 | do { | |
1234 | smp_mb(); | |
1235 | if (root->fs_info->closing) | |
1236 | break; | |
1237 | ||
1238 | vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE); | |
1239 | mutex_lock(&root->fs_info->cleaner_mutex); | |
a74a4b97 | 1240 | btrfs_clean_old_snapshots(root); |
a74a4b97 CM |
1241 | mutex_unlock(&root->fs_info->cleaner_mutex); |
1242 | ||
1243 | if (freezing(current)) { | |
1244 | refrigerator(); | |
1245 | } else { | |
1246 | smp_mb(); | |
1247 | if (root->fs_info->closing) | |
1248 | break; | |
1249 | set_current_state(TASK_INTERRUPTIBLE); | |
1250 | schedule(); | |
1251 | __set_current_state(TASK_RUNNING); | |
1252 | } | |
1253 | } while (!kthread_should_stop()); | |
1254 | return 0; | |
1255 | } | |
1256 | ||
1257 | static int transaction_kthread(void *arg) | |
1258 | { | |
1259 | struct btrfs_root *root = arg; | |
1260 | struct btrfs_trans_handle *trans; | |
1261 | struct btrfs_transaction *cur; | |
1262 | unsigned long now; | |
1263 | unsigned long delay; | |
1264 | int ret; | |
1265 | ||
1266 | do { | |
1267 | smp_mb(); | |
1268 | if (root->fs_info->closing) | |
1269 | break; | |
1270 | ||
1271 | delay = HZ * 30; | |
1272 | vfs_check_frozen(root->fs_info->sb, SB_FREEZE_WRITE); | |
1273 | mutex_lock(&root->fs_info->transaction_kthread_mutex); | |
1274 | ||
ab78c84d CM |
1275 | if (root->fs_info->total_ref_cache_size > 20 * 1024 * 1024) { |
1276 | printk("btrfs: total reference cache size %Lu\n", | |
1277 | root->fs_info->total_ref_cache_size); | |
1278 | } | |
31153d81 | 1279 | |
a74a4b97 CM |
1280 | mutex_lock(&root->fs_info->trans_mutex); |
1281 | cur = root->fs_info->running_transaction; | |
1282 | if (!cur) { | |
1283 | mutex_unlock(&root->fs_info->trans_mutex); | |
1284 | goto sleep; | |
1285 | } | |
31153d81 | 1286 | |
a74a4b97 CM |
1287 | now = get_seconds(); |
1288 | if (now < cur->start_time || now - cur->start_time < 30) { | |
1289 | mutex_unlock(&root->fs_info->trans_mutex); | |
1290 | delay = HZ * 5; | |
1291 | goto sleep; | |
1292 | } | |
1293 | mutex_unlock(&root->fs_info->trans_mutex); | |
a74a4b97 CM |
1294 | trans = btrfs_start_transaction(root, 1); |
1295 | ret = btrfs_commit_transaction(trans, root); | |
1296 | sleep: | |
1297 | wake_up_process(root->fs_info->cleaner_kthread); | |
1298 | mutex_unlock(&root->fs_info->transaction_kthread_mutex); | |
1299 | ||
1300 | if (freezing(current)) { | |
1301 | refrigerator(); | |
1302 | } else { | |
1303 | if (root->fs_info->closing) | |
1304 | break; | |
1305 | set_current_state(TASK_INTERRUPTIBLE); | |
1306 | schedule_timeout(delay); | |
1307 | __set_current_state(TASK_RUNNING); | |
1308 | } | |
1309 | } while (!kthread_should_stop()); | |
1310 | return 0; | |
1311 | } | |
1312 | ||
8a4b83cc | 1313 | struct btrfs_root *open_ctree(struct super_block *sb, |
dfe25020 CM |
1314 | struct btrfs_fs_devices *fs_devices, |
1315 | char *options) | |
2e635a27 | 1316 | { |
db94535d CM |
1317 | u32 sectorsize; |
1318 | u32 nodesize; | |
1319 | u32 leafsize; | |
1320 | u32 blocksize; | |
87ee04eb | 1321 | u32 stripesize; |
a061fc8d | 1322 | struct buffer_head *bh; |
e02119d5 | 1323 | struct btrfs_root *extent_root = kzalloc(sizeof(struct btrfs_root), |
e20d96d6 | 1324 | GFP_NOFS); |
e02119d5 | 1325 | struct btrfs_root *tree_root = kzalloc(sizeof(struct btrfs_root), |
e20d96d6 | 1326 | GFP_NOFS); |
8790d502 | 1327 | struct btrfs_fs_info *fs_info = kzalloc(sizeof(*fs_info), |
e20d96d6 | 1328 | GFP_NOFS); |
e02119d5 | 1329 | struct btrfs_root *chunk_root = kzalloc(sizeof(struct btrfs_root), |
0b86a832 | 1330 | GFP_NOFS); |
e02119d5 | 1331 | struct btrfs_root *dev_root = kzalloc(sizeof(struct btrfs_root), |
0b86a832 | 1332 | GFP_NOFS); |
e02119d5 CM |
1333 | struct btrfs_root *log_tree_root; |
1334 | ||
eb60ceac | 1335 | int ret; |
e58ca020 | 1336 | int err = -EINVAL; |
4543df7e | 1337 | |
2c90e5d6 | 1338 | struct btrfs_super_block *disk_super; |
8790d502 | 1339 | |
39279cc3 CM |
1340 | if (!extent_root || !tree_root || !fs_info) { |
1341 | err = -ENOMEM; | |
1342 | goto fail; | |
1343 | } | |
0f7d52f4 | 1344 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_NOFS); |
8fd17795 | 1345 | INIT_LIST_HEAD(&fs_info->trans_list); |
facda1e7 | 1346 | INIT_LIST_HEAD(&fs_info->dead_roots); |
19c00ddc | 1347 | INIT_LIST_HEAD(&fs_info->hashers); |
ea8c2819 | 1348 | INIT_LIST_HEAD(&fs_info->delalloc_inodes); |
19c00ddc | 1349 | spin_lock_init(&fs_info->hash_lock); |
1832a6d5 | 1350 | spin_lock_init(&fs_info->delalloc_lock); |
cee36a03 | 1351 | spin_lock_init(&fs_info->new_trans_lock); |
31153d81 | 1352 | spin_lock_init(&fs_info->ref_cache_lock); |
19c00ddc | 1353 | |
58176a96 | 1354 | init_completion(&fs_info->kobj_unregister); |
9f5fae2f CM |
1355 | fs_info->tree_root = tree_root; |
1356 | fs_info->extent_root = extent_root; | |
0b86a832 CM |
1357 | fs_info->chunk_root = chunk_root; |
1358 | fs_info->dev_root = dev_root; | |
8a4b83cc | 1359 | fs_info->fs_devices = fs_devices; |
0b86a832 | 1360 | INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots); |
6324fbf3 | 1361 | INIT_LIST_HEAD(&fs_info->space_info); |
0b86a832 | 1362 | btrfs_mapping_init(&fs_info->mapping_tree); |
cb03c743 | 1363 | atomic_set(&fs_info->nr_async_submits, 0); |
0986fe9e | 1364 | atomic_set(&fs_info->nr_async_bios, 0); |
a2135011 | 1365 | atomic_set(&fs_info->throttles, 0); |
ab78c84d | 1366 | atomic_set(&fs_info->throttle_gen, 0); |
e20d96d6 | 1367 | fs_info->sb = sb; |
c59f8951 | 1368 | fs_info->max_extent = (u64)-1; |
6f568d35 | 1369 | fs_info->max_inline = 8192 * 1024; |
04160088 | 1370 | setup_bdi(fs_info, &fs_info->bdi); |
d98237b3 CM |
1371 | fs_info->btree_inode = new_inode(sb); |
1372 | fs_info->btree_inode->i_ino = 1; | |
2c90e5d6 | 1373 | fs_info->btree_inode->i_nlink = 1; |
4543df7e | 1374 | fs_info->thread_pool_size = min(num_online_cpus() + 2, 8); |
0afbaf8c | 1375 | |
3eaa2885 CM |
1376 | INIT_LIST_HEAD(&fs_info->ordered_extents); |
1377 | spin_lock_init(&fs_info->ordered_extent_lock); | |
1378 | ||
a061fc8d CM |
1379 | sb->s_blocksize = 4096; |
1380 | sb->s_blocksize_bits = blksize_bits(4096); | |
1381 | ||
0afbaf8c CM |
1382 | /* |
1383 | * we set the i_size on the btree inode to the max possible int. | |
1384 | * the real end of the address space is determined by all of | |
1385 | * the devices in the system | |
1386 | */ | |
1387 | fs_info->btree_inode->i_size = OFFSET_MAX; | |
d98237b3 | 1388 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; |
04160088 CM |
1389 | fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi; |
1390 | ||
d1310b2e | 1391 | extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree, |
5f39d397 CM |
1392 | fs_info->btree_inode->i_mapping, |
1393 | GFP_NOFS); | |
d1310b2e CM |
1394 | extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree, |
1395 | GFP_NOFS); | |
1396 | ||
1397 | BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops; | |
0da5468f | 1398 | |
d1310b2e | 1399 | extent_io_tree_init(&fs_info->free_space_cache, |
f510cfec | 1400 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 1401 | extent_io_tree_init(&fs_info->block_group_cache, |
96b5179d | 1402 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 1403 | extent_io_tree_init(&fs_info->pinned_extents, |
1a5bc167 | 1404 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 1405 | extent_io_tree_init(&fs_info->pending_del, |
1a5bc167 | 1406 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
d1310b2e | 1407 | extent_io_tree_init(&fs_info->extent_ins, |
1a5bc167 | 1408 | fs_info->btree_inode->i_mapping, GFP_NOFS); |
e66f709b | 1409 | fs_info->do_barriers = 1; |
e18e4809 | 1410 | |
0f7d52f4 CM |
1411 | BTRFS_I(fs_info->btree_inode)->root = tree_root; |
1412 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, | |
1413 | sizeof(struct btrfs_key)); | |
22b0ebda | 1414 | insert_inode_hash(fs_info->btree_inode); |
d98237b3 | 1415 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
39279cc3 | 1416 | |
79154b1b | 1417 | mutex_init(&fs_info->trans_mutex); |
e02119d5 | 1418 | mutex_init(&fs_info->tree_log_mutex); |
a2135011 | 1419 | mutex_init(&fs_info->drop_mutex); |
925baedd CM |
1420 | mutex_init(&fs_info->alloc_mutex); |
1421 | mutex_init(&fs_info->chunk_mutex); | |
a74a4b97 CM |
1422 | mutex_init(&fs_info->transaction_kthread_mutex); |
1423 | mutex_init(&fs_info->cleaner_mutex); | |
7d9eb12c | 1424 | mutex_init(&fs_info->volume_mutex); |
e6dcd2dc | 1425 | init_waitqueue_head(&fs_info->transaction_throttle); |
f9295749 | 1426 | init_waitqueue_head(&fs_info->transaction_wait); |
4854ddd0 | 1427 | init_waitqueue_head(&fs_info->async_submit_wait); |
e02119d5 CM |
1428 | init_waitqueue_head(&fs_info->tree_log_wait); |
1429 | atomic_set(&fs_info->tree_log_commit, 0); | |
1430 | atomic_set(&fs_info->tree_log_writers, 0); | |
1431 | fs_info->tree_log_transid = 0; | |
3768f368 | 1432 | |
19c00ddc CM |
1433 | #if 0 |
1434 | ret = add_hasher(fs_info, "crc32c"); | |
1435 | if (ret) { | |
1436 | printk("btrfs: failed hash setup, modprobe cryptomgr?\n"); | |
1437 | err = -ENOMEM; | |
1438 | goto fail_iput; | |
1439 | } | |
1440 | #endif | |
0b86a832 | 1441 | __setup_root(4096, 4096, 4096, 4096, tree_root, |
2c90e5d6 | 1442 | fs_info, BTRFS_ROOT_TREE_OBJECTID); |
7eccb903 | 1443 | |
d98237b3 | 1444 | |
a061fc8d CM |
1445 | bh = __bread(fs_devices->latest_bdev, |
1446 | BTRFS_SUPER_INFO_OFFSET / 4096, 4096); | |
1447 | if (!bh) | |
39279cc3 | 1448 | goto fail_iput; |
39279cc3 | 1449 | |
a061fc8d CM |
1450 | memcpy(&fs_info->super_copy, bh->b_data, sizeof(fs_info->super_copy)); |
1451 | brelse(bh); | |
5f39d397 | 1452 | |
a061fc8d | 1453 | memcpy(fs_info->fsid, fs_info->super_copy.fsid, BTRFS_FSID_SIZE); |
0b86a832 | 1454 | |
5f39d397 | 1455 | disk_super = &fs_info->super_copy; |
0f7d52f4 | 1456 | if (!btrfs_super_root(disk_super)) |
39279cc3 | 1457 | goto fail_sb_buffer; |
0f7d52f4 | 1458 | |
edf24abe CH |
1459 | err = btrfs_parse_options(tree_root, options); |
1460 | if (err) | |
1461 | goto fail_sb_buffer; | |
dfe25020 | 1462 | |
4543df7e CM |
1463 | /* |
1464 | * we need to start all the end_io workers up front because the | |
1465 | * queue work function gets called at interrupt time, and so it | |
1466 | * cannot dynamically grow. | |
1467 | */ | |
5443be45 CM |
1468 | btrfs_init_workers(&fs_info->workers, "worker", |
1469 | fs_info->thread_pool_size); | |
1470 | btrfs_init_workers(&fs_info->submit_workers, "submit", | |
b720d209 CM |
1471 | min_t(u64, fs_devices->num_devices, |
1472 | fs_info->thread_pool_size)); | |
61b49440 CM |
1473 | |
1474 | /* a higher idle thresh on the submit workers makes it much more | |
1475 | * likely that bios will be send down in a sane order to the | |
1476 | * devices | |
1477 | */ | |
1478 | fs_info->submit_workers.idle_thresh = 64; | |
53863232 CM |
1479 | |
1480 | /* fs_info->workers is responsible for checksumming file data | |
1481 | * blocks and metadata. Using a larger idle thresh allows each | |
1482 | * worker thread to operate on things in roughly the order they | |
1483 | * were sent by the writeback daemons, improving overall locality | |
1484 | * of the IO going down the pipe. | |
1485 | */ | |
1486 | fs_info->workers.idle_thresh = 128; | |
61b49440 | 1487 | |
5443be45 CM |
1488 | btrfs_init_workers(&fs_info->fixup_workers, "fixup", 1); |
1489 | btrfs_init_workers(&fs_info->endio_workers, "endio", | |
1490 | fs_info->thread_pool_size); | |
1491 | btrfs_init_workers(&fs_info->endio_write_workers, "endio-write", | |
e6dcd2dc | 1492 | fs_info->thread_pool_size); |
61b49440 CM |
1493 | |
1494 | /* | |
1495 | * endios are largely parallel and should have a very | |
1496 | * low idle thresh | |
1497 | */ | |
1498 | fs_info->endio_workers.idle_thresh = 4; | |
1499 | fs_info->endio_write_workers.idle_thresh = 4; | |
1500 | ||
4543df7e | 1501 | btrfs_start_workers(&fs_info->workers, 1); |
1cc127b5 | 1502 | btrfs_start_workers(&fs_info->submit_workers, 1); |
247e743c | 1503 | btrfs_start_workers(&fs_info->fixup_workers, 1); |
4543df7e | 1504 | btrfs_start_workers(&fs_info->endio_workers, fs_info->thread_pool_size); |
e6dcd2dc CM |
1505 | btrfs_start_workers(&fs_info->endio_write_workers, |
1506 | fs_info->thread_pool_size); | |
4543df7e | 1507 | |
edf24abe | 1508 | err = -EINVAL; |
a0af469b | 1509 | if (btrfs_super_num_devices(disk_super) > fs_devices->open_devices) { |
8a4b83cc CM |
1510 | printk("Btrfs: wanted %llu devices, but found %llu\n", |
1511 | (unsigned long long)btrfs_super_num_devices(disk_super), | |
a0af469b | 1512 | (unsigned long long)fs_devices->open_devices); |
dfe25020 CM |
1513 | if (btrfs_test_opt(tree_root, DEGRADED)) |
1514 | printk("continuing in degraded mode\n"); | |
1515 | else { | |
1516 | goto fail_sb_buffer; | |
1517 | } | |
8a4b83cc | 1518 | } |
dfe25020 | 1519 | |
4575c9cc CM |
1520 | fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super); |
1521 | ||
db94535d CM |
1522 | nodesize = btrfs_super_nodesize(disk_super); |
1523 | leafsize = btrfs_super_leafsize(disk_super); | |
1524 | sectorsize = btrfs_super_sectorsize(disk_super); | |
87ee04eb | 1525 | stripesize = btrfs_super_stripesize(disk_super); |
db94535d CM |
1526 | tree_root->nodesize = nodesize; |
1527 | tree_root->leafsize = leafsize; | |
1528 | tree_root->sectorsize = sectorsize; | |
87ee04eb | 1529 | tree_root->stripesize = stripesize; |
a061fc8d CM |
1530 | |
1531 | sb->s_blocksize = sectorsize; | |
1532 | sb->s_blocksize_bits = blksize_bits(sectorsize); | |
db94535d | 1533 | |
39279cc3 CM |
1534 | if (strncmp((char *)(&disk_super->magic), BTRFS_MAGIC, |
1535 | sizeof(disk_super->magic))) { | |
1536 | printk("btrfs: valid FS not found on %s\n", sb->s_id); | |
1537 | goto fail_sb_buffer; | |
1538 | } | |
19c00ddc | 1539 | |
925baedd | 1540 | mutex_lock(&fs_info->chunk_mutex); |
0b86a832 | 1541 | ret = btrfs_read_sys_array(tree_root); |
925baedd | 1542 | mutex_unlock(&fs_info->chunk_mutex); |
84eed90f CM |
1543 | if (ret) { |
1544 | printk("btrfs: failed to read the system array on %s\n", | |
1545 | sb->s_id); | |
1546 | goto fail_sys_array; | |
1547 | } | |
0b86a832 CM |
1548 | |
1549 | blocksize = btrfs_level_size(tree_root, | |
1550 | btrfs_super_chunk_root_level(disk_super)); | |
1551 | ||
1552 | __setup_root(nodesize, leafsize, sectorsize, stripesize, | |
1553 | chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID); | |
1554 | ||
1555 | chunk_root->node = read_tree_block(chunk_root, | |
1556 | btrfs_super_chunk_root(disk_super), | |
ca7a79ad | 1557 | blocksize, 0); |
0b86a832 CM |
1558 | BUG_ON(!chunk_root->node); |
1559 | ||
e17cade2 CM |
1560 | read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid, |
1561 | (unsigned long)btrfs_header_chunk_tree_uuid(chunk_root->node), | |
1562 | BTRFS_UUID_SIZE); | |
1563 | ||
925baedd | 1564 | mutex_lock(&fs_info->chunk_mutex); |
0b86a832 | 1565 | ret = btrfs_read_chunk_tree(chunk_root); |
925baedd | 1566 | mutex_unlock(&fs_info->chunk_mutex); |
0b86a832 CM |
1567 | BUG_ON(ret); |
1568 | ||
dfe25020 CM |
1569 | btrfs_close_extra_devices(fs_devices); |
1570 | ||
db94535d CM |
1571 | blocksize = btrfs_level_size(tree_root, |
1572 | btrfs_super_root_level(disk_super)); | |
19c00ddc | 1573 | |
0b86a832 | 1574 | |
e20d96d6 | 1575 | tree_root->node = read_tree_block(tree_root, |
db94535d | 1576 | btrfs_super_root(disk_super), |
ca7a79ad | 1577 | blocksize, 0); |
39279cc3 CM |
1578 | if (!tree_root->node) |
1579 | goto fail_sb_buffer; | |
3768f368 | 1580 | |
db94535d CM |
1581 | |
1582 | ret = find_and_setup_root(tree_root, fs_info, | |
e20d96d6 | 1583 | BTRFS_EXTENT_TREE_OBJECTID, extent_root); |
0b86a832 | 1584 | if (ret) |
39279cc3 | 1585 | goto fail_tree_root; |
0b86a832 CM |
1586 | extent_root->track_dirty = 1; |
1587 | ||
1588 | ret = find_and_setup_root(tree_root, fs_info, | |
1589 | BTRFS_DEV_TREE_OBJECTID, dev_root); | |
1590 | dev_root->track_dirty = 1; | |
1591 | ||
1592 | if (ret) | |
1593 | goto fail_extent_root; | |
3768f368 | 1594 | |
9078a3e1 CM |
1595 | btrfs_read_block_groups(extent_root); |
1596 | ||
0f7d52f4 | 1597 | fs_info->generation = btrfs_super_generation(disk_super) + 1; |
d18a2c44 CM |
1598 | fs_info->data_alloc_profile = (u64)-1; |
1599 | fs_info->metadata_alloc_profile = (u64)-1; | |
1600 | fs_info->system_alloc_profile = fs_info->metadata_alloc_profile; | |
a74a4b97 CM |
1601 | fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root, |
1602 | "btrfs-cleaner"); | |
1603 | if (!fs_info->cleaner_kthread) | |
1604 | goto fail_extent_root; | |
1605 | ||
1606 | fs_info->transaction_kthread = kthread_run(transaction_kthread, | |
1607 | tree_root, | |
1608 | "btrfs-transaction"); | |
1609 | if (!fs_info->transaction_kthread) | |
3f157a2f | 1610 | goto fail_cleaner; |
a74a4b97 | 1611 | |
e02119d5 CM |
1612 | if (btrfs_super_log_root(disk_super) != 0) { |
1613 | u32 blocksize; | |
1614 | u64 bytenr = btrfs_super_log_root(disk_super); | |
1615 | ||
1616 | blocksize = | |
1617 | btrfs_level_size(tree_root, | |
1618 | btrfs_super_log_root_level(disk_super)); | |
d18a2c44 | 1619 | |
e02119d5 CM |
1620 | log_tree_root = kzalloc(sizeof(struct btrfs_root), |
1621 | GFP_NOFS); | |
1622 | ||
1623 | __setup_root(nodesize, leafsize, sectorsize, stripesize, | |
1624 | log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID); | |
1625 | ||
1626 | log_tree_root->node = read_tree_block(tree_root, bytenr, | |
1627 | blocksize, 0); | |
1628 | ret = btrfs_recover_log_trees(log_tree_root); | |
1629 | BUG_ON(ret); | |
1630 | } | |
1631 | fs_info->last_trans_committed = btrfs_super_generation(disk_super); | |
0f7d52f4 | 1632 | return tree_root; |
39279cc3 | 1633 | |
3f157a2f | 1634 | fail_cleaner: |
a74a4b97 | 1635 | kthread_stop(fs_info->cleaner_kthread); |
0b86a832 CM |
1636 | fail_extent_root: |
1637 | free_extent_buffer(extent_root->node); | |
39279cc3 | 1638 | fail_tree_root: |
5f39d397 | 1639 | free_extent_buffer(tree_root->node); |
84eed90f | 1640 | fail_sys_array: |
39279cc3 | 1641 | fail_sb_buffer: |
247e743c | 1642 | btrfs_stop_workers(&fs_info->fixup_workers); |
8b712842 CM |
1643 | btrfs_stop_workers(&fs_info->workers); |
1644 | btrfs_stop_workers(&fs_info->endio_workers); | |
e6dcd2dc | 1645 | btrfs_stop_workers(&fs_info->endio_write_workers); |
1cc127b5 | 1646 | btrfs_stop_workers(&fs_info->submit_workers); |
4543df7e CM |
1647 | fail_iput: |
1648 | iput(fs_info->btree_inode); | |
39279cc3 | 1649 | fail: |
dfe25020 | 1650 | btrfs_close_devices(fs_info->fs_devices); |
84eed90f CM |
1651 | btrfs_mapping_tree_free(&fs_info->mapping_tree); |
1652 | ||
39279cc3 CM |
1653 | kfree(extent_root); |
1654 | kfree(tree_root); | |
51ebc0d3 | 1655 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23) |
2d2ae547 | 1656 | bdi_destroy(&fs_info->bdi); |
b248a415 | 1657 | #endif |
39279cc3 CM |
1658 | kfree(fs_info); |
1659 | return ERR_PTR(err); | |
eb60ceac CM |
1660 | } |
1661 | ||
f2984462 CM |
1662 | static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate) |
1663 | { | |
1664 | char b[BDEVNAME_SIZE]; | |
1665 | ||
1666 | if (uptodate) { | |
1667 | set_buffer_uptodate(bh); | |
1668 | } else { | |
1669 | if (!buffer_eopnotsupp(bh) && printk_ratelimit()) { | |
1670 | printk(KERN_WARNING "lost page write due to " | |
1671 | "I/O error on %s\n", | |
1672 | bdevname(bh->b_bdev, b)); | |
1673 | } | |
1259ab75 CM |
1674 | /* note, we dont' set_buffer_write_io_error because we have |
1675 | * our own ways of dealing with the IO errors | |
1676 | */ | |
f2984462 CM |
1677 | clear_buffer_uptodate(bh); |
1678 | } | |
1679 | unlock_buffer(bh); | |
1680 | put_bh(bh); | |
1681 | } | |
1682 | ||
1683 | int write_all_supers(struct btrfs_root *root) | |
1684 | { | |
1685 | struct list_head *cur; | |
1686 | struct list_head *head = &root->fs_info->fs_devices->devices; | |
1687 | struct btrfs_device *dev; | |
a061fc8d | 1688 | struct btrfs_super_block *sb; |
f2984462 CM |
1689 | struct btrfs_dev_item *dev_item; |
1690 | struct buffer_head *bh; | |
1691 | int ret; | |
1692 | int do_barriers; | |
a236aed1 CM |
1693 | int max_errors; |
1694 | int total_errors = 0; | |
a061fc8d CM |
1695 | u32 crc; |
1696 | u64 flags; | |
f2984462 | 1697 | |
a236aed1 | 1698 | max_errors = btrfs_super_num_devices(&root->fs_info->super_copy) - 1; |
f2984462 CM |
1699 | do_barriers = !btrfs_test_opt(root, NOBARRIER); |
1700 | ||
a061fc8d CM |
1701 | sb = &root->fs_info->super_for_commit; |
1702 | dev_item = &sb->dev_item; | |
f2984462 CM |
1703 | list_for_each(cur, head) { |
1704 | dev = list_entry(cur, struct btrfs_device, dev_list); | |
dfe25020 CM |
1705 | if (!dev->bdev) { |
1706 | total_errors++; | |
1707 | continue; | |
1708 | } | |
1709 | if (!dev->in_fs_metadata) | |
1710 | continue; | |
1711 | ||
a061fc8d CM |
1712 | btrfs_set_stack_device_type(dev_item, dev->type); |
1713 | btrfs_set_stack_device_id(dev_item, dev->devid); | |
1714 | btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes); | |
1715 | btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used); | |
1716 | btrfs_set_stack_device_io_align(dev_item, dev->io_align); | |
1717 | btrfs_set_stack_device_io_width(dev_item, dev->io_width); | |
1718 | btrfs_set_stack_device_sector_size(dev_item, dev->sector_size); | |
1719 | memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE); | |
1720 | flags = btrfs_super_flags(sb); | |
1721 | btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN); | |
1722 | ||
1723 | ||
1724 | crc = ~(u32)0; | |
1725 | crc = btrfs_csum_data(root, (char *)sb + BTRFS_CSUM_SIZE, crc, | |
1726 | BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE); | |
1727 | btrfs_csum_final(crc, sb->csum); | |
1728 | ||
1729 | bh = __getblk(dev->bdev, BTRFS_SUPER_INFO_OFFSET / 4096, | |
f2984462 CM |
1730 | BTRFS_SUPER_INFO_SIZE); |
1731 | ||
a061fc8d | 1732 | memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE); |
f2984462 CM |
1733 | dev->pending_io = bh; |
1734 | ||
1735 | get_bh(bh); | |
1736 | set_buffer_uptodate(bh); | |
1737 | lock_buffer(bh); | |
1738 | bh->b_end_io = btrfs_end_buffer_write_sync; | |
1739 | ||
1740 | if (do_barriers && dev->barriers) { | |
1741 | ret = submit_bh(WRITE_BARRIER, bh); | |
1742 | if (ret == -EOPNOTSUPP) { | |
1743 | printk("btrfs: disabling barriers on dev %s\n", | |
1744 | dev->name); | |
1745 | set_buffer_uptodate(bh); | |
1746 | dev->barriers = 0; | |
1747 | get_bh(bh); | |
1748 | lock_buffer(bh); | |
1749 | ret = submit_bh(WRITE, bh); | |
1750 | } | |
1751 | } else { | |
1752 | ret = submit_bh(WRITE, bh); | |
1753 | } | |
a236aed1 CM |
1754 | if (ret) |
1755 | total_errors++; | |
f2984462 | 1756 | } |
a236aed1 CM |
1757 | if (total_errors > max_errors) { |
1758 | printk("btrfs: %d errors while writing supers\n", total_errors); | |
1759 | BUG(); | |
1760 | } | |
1761 | total_errors = 0; | |
f2984462 CM |
1762 | |
1763 | list_for_each(cur, head) { | |
1764 | dev = list_entry(cur, struct btrfs_device, dev_list); | |
dfe25020 CM |
1765 | if (!dev->bdev) |
1766 | continue; | |
1767 | if (!dev->in_fs_metadata) | |
1768 | continue; | |
1769 | ||
f2984462 CM |
1770 | BUG_ON(!dev->pending_io); |
1771 | bh = dev->pending_io; | |
1772 | wait_on_buffer(bh); | |
1773 | if (!buffer_uptodate(dev->pending_io)) { | |
1774 | if (do_barriers && dev->barriers) { | |
1775 | printk("btrfs: disabling barriers on dev %s\n", | |
1776 | dev->name); | |
1777 | set_buffer_uptodate(bh); | |
1778 | get_bh(bh); | |
1779 | lock_buffer(bh); | |
1780 | dev->barriers = 0; | |
1781 | ret = submit_bh(WRITE, bh); | |
1782 | BUG_ON(ret); | |
1783 | wait_on_buffer(bh); | |
1259ab75 CM |
1784 | if (!buffer_uptodate(bh)) |
1785 | total_errors++; | |
f2984462 | 1786 | } else { |
a236aed1 | 1787 | total_errors++; |
f2984462 CM |
1788 | } |
1789 | ||
1790 | } | |
1791 | dev->pending_io = NULL; | |
1792 | brelse(bh); | |
1793 | } | |
a236aed1 CM |
1794 | if (total_errors > max_errors) { |
1795 | printk("btrfs: %d errors while writing supers\n", total_errors); | |
1796 | BUG(); | |
1797 | } | |
f2984462 CM |
1798 | return 0; |
1799 | } | |
1800 | ||
e089f05c | 1801 | int write_ctree_super(struct btrfs_trans_handle *trans, struct btrfs_root |
79154b1b | 1802 | *root) |
eb60ceac | 1803 | { |
e66f709b | 1804 | int ret; |
5f39d397 | 1805 | |
f2984462 | 1806 | ret = write_all_supers(root); |
5f39d397 | 1807 | return ret; |
cfaa7295 CM |
1808 | } |
1809 | ||
5eda7b5e | 1810 | int btrfs_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) |
2619ba1f CM |
1811 | { |
1812 | radix_tree_delete(&fs_info->fs_roots_radix, | |
1813 | (unsigned long)root->root_key.objectid); | |
b99aa6cb CM |
1814 | if (root->in_sysfs) |
1815 | btrfs_sysfs_del_root(root); | |
2619ba1f CM |
1816 | if (root->inode) |
1817 | iput(root->inode); | |
1818 | if (root->node) | |
5f39d397 | 1819 | free_extent_buffer(root->node); |
2619ba1f | 1820 | if (root->commit_root) |
5f39d397 | 1821 | free_extent_buffer(root->commit_root); |
58176a96 JB |
1822 | if (root->name) |
1823 | kfree(root->name); | |
2619ba1f CM |
1824 | kfree(root); |
1825 | return 0; | |
1826 | } | |
1827 | ||
35b7e476 | 1828 | static int del_fs_roots(struct btrfs_fs_info *fs_info) |
0f7d52f4 CM |
1829 | { |
1830 | int ret; | |
1831 | struct btrfs_root *gang[8]; | |
1832 | int i; | |
1833 | ||
1834 | while(1) { | |
1835 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
1836 | (void **)gang, 0, | |
1837 | ARRAY_SIZE(gang)); | |
1838 | if (!ret) | |
1839 | break; | |
2619ba1f | 1840 | for (i = 0; i < ret; i++) |
5eda7b5e | 1841 | btrfs_free_fs_root(fs_info, gang[i]); |
0f7d52f4 CM |
1842 | } |
1843 | return 0; | |
1844 | } | |
b4100d64 | 1845 | |
e20d96d6 | 1846 | int close_ctree(struct btrfs_root *root) |
cfaa7295 | 1847 | { |
3768f368 | 1848 | int ret; |
e089f05c | 1849 | struct btrfs_trans_handle *trans; |
0f7d52f4 | 1850 | struct btrfs_fs_info *fs_info = root->fs_info; |
e089f05c | 1851 | |
facda1e7 | 1852 | fs_info->closing = 1; |
a2135011 CM |
1853 | smp_mb(); |
1854 | ||
a74a4b97 CM |
1855 | kthread_stop(root->fs_info->transaction_kthread); |
1856 | kthread_stop(root->fs_info->cleaner_kthread); | |
1857 | ||
a74a4b97 | 1858 | btrfs_clean_old_snapshots(root); |
79154b1b | 1859 | trans = btrfs_start_transaction(root, 1); |
54aa1f4d | 1860 | ret = btrfs_commit_transaction(trans, root); |
79154b1b CM |
1861 | /* run commit again to drop the original snapshot */ |
1862 | trans = btrfs_start_transaction(root, 1); | |
1863 | btrfs_commit_transaction(trans, root); | |
1864 | ret = btrfs_write_and_wait_transaction(NULL, root); | |
3768f368 | 1865 | BUG_ON(ret); |
d6bfde87 | 1866 | |
79154b1b | 1867 | write_ctree_super(NULL, root); |
0f7d52f4 | 1868 | |
b0c68f8b CM |
1869 | if (fs_info->delalloc_bytes) { |
1870 | printk("btrfs: at unmount delalloc count %Lu\n", | |
1871 | fs_info->delalloc_bytes); | |
1872 | } | |
31153d81 YZ |
1873 | if (fs_info->total_ref_cache_size) { |
1874 | printk("btrfs: at umount reference cache size %Lu\n", | |
1875 | fs_info->total_ref_cache_size); | |
1876 | } | |
bcc63abb | 1877 | |
0f7d52f4 | 1878 | if (fs_info->extent_root->node) |
5f39d397 | 1879 | free_extent_buffer(fs_info->extent_root->node); |
f510cfec | 1880 | |
0f7d52f4 | 1881 | if (fs_info->tree_root->node) |
5f39d397 | 1882 | free_extent_buffer(fs_info->tree_root->node); |
f510cfec | 1883 | |
0b86a832 CM |
1884 | if (root->fs_info->chunk_root->node); |
1885 | free_extent_buffer(root->fs_info->chunk_root->node); | |
1886 | ||
1887 | if (root->fs_info->dev_root->node); | |
1888 | free_extent_buffer(root->fs_info->dev_root->node); | |
1889 | ||
9078a3e1 | 1890 | btrfs_free_block_groups(root->fs_info); |
4ca8b41e | 1891 | fs_info->closing = 2; |
0f7d52f4 | 1892 | del_fs_roots(fs_info); |
d10c5f31 CM |
1893 | |
1894 | filemap_write_and_wait(fs_info->btree_inode->i_mapping); | |
1895 | ||
db94535d | 1896 | truncate_inode_pages(fs_info->btree_inode->i_mapping, 0); |
9ad6b7bc | 1897 | |
247e743c | 1898 | btrfs_stop_workers(&fs_info->fixup_workers); |
8b712842 CM |
1899 | btrfs_stop_workers(&fs_info->workers); |
1900 | btrfs_stop_workers(&fs_info->endio_workers); | |
e6dcd2dc | 1901 | btrfs_stop_workers(&fs_info->endio_write_workers); |
1cc127b5 | 1902 | btrfs_stop_workers(&fs_info->submit_workers); |
d6bfde87 | 1903 | |
db94535d | 1904 | iput(fs_info->btree_inode); |
19c00ddc CM |
1905 | #if 0 |
1906 | while(!list_empty(&fs_info->hashers)) { | |
1907 | struct btrfs_hasher *hasher; | |
1908 | hasher = list_entry(fs_info->hashers.next, struct btrfs_hasher, | |
1909 | hashers); | |
1910 | list_del(&hasher->hashers); | |
1911 | crypto_free_hash(&fs_info->hash_tfm); | |
1912 | kfree(hasher); | |
1913 | } | |
1914 | #endif | |
dfe25020 | 1915 | btrfs_close_devices(fs_info->fs_devices); |
0b86a832 | 1916 | btrfs_mapping_tree_free(&fs_info->mapping_tree); |
b248a415 | 1917 | |
51ebc0d3 | 1918 | #if LINUX_VERSION_CODE > KERNEL_VERSION(2,6,23) |
04160088 | 1919 | bdi_destroy(&fs_info->bdi); |
b248a415 | 1920 | #endif |
0b86a832 | 1921 | |
0f7d52f4 | 1922 | kfree(fs_info->extent_root); |
0f7d52f4 | 1923 | kfree(fs_info->tree_root); |
0b86a832 CM |
1924 | kfree(fs_info->chunk_root); |
1925 | kfree(fs_info->dev_root); | |
eb60ceac CM |
1926 | return 0; |
1927 | } | |
1928 | ||
1259ab75 | 1929 | int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid) |
5f39d397 | 1930 | { |
1259ab75 | 1931 | int ret; |
810191ff | 1932 | struct inode *btree_inode = buf->first_page->mapping->host; |
1259ab75 CM |
1933 | |
1934 | ret = extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, buf); | |
1935 | if (!ret) | |
1936 | return ret; | |
1937 | ||
1938 | ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf, | |
1939 | parent_transid); | |
1940 | return !ret; | |
5f39d397 CM |
1941 | } |
1942 | ||
1943 | int btrfs_set_buffer_uptodate(struct extent_buffer *buf) | |
ccd467d6 | 1944 | { |
810191ff | 1945 | struct inode *btree_inode = buf->first_page->mapping->host; |
d1310b2e | 1946 | return set_extent_buffer_uptodate(&BTRFS_I(btree_inode)->io_tree, |
5f39d397 CM |
1947 | buf); |
1948 | } | |
6702ed49 | 1949 | |
5f39d397 CM |
1950 | void btrfs_mark_buffer_dirty(struct extent_buffer *buf) |
1951 | { | |
810191ff | 1952 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
5f39d397 CM |
1953 | u64 transid = btrfs_header_generation(buf); |
1954 | struct inode *btree_inode = root->fs_info->btree_inode; | |
6702ed49 | 1955 | |
925baedd | 1956 | WARN_ON(!btrfs_tree_locked(buf)); |
ccd467d6 CM |
1957 | if (transid != root->fs_info->generation) { |
1958 | printk(KERN_CRIT "transid mismatch buffer %llu, found %Lu running %Lu\n", | |
db94535d | 1959 | (unsigned long long)buf->start, |
ccd467d6 CM |
1960 | transid, root->fs_info->generation); |
1961 | WARN_ON(1); | |
1962 | } | |
d1310b2e | 1963 | set_extent_buffer_dirty(&BTRFS_I(btree_inode)->io_tree, buf); |
eb60ceac CM |
1964 | } |
1965 | ||
d3c2fdcf | 1966 | void btrfs_btree_balance_dirty(struct btrfs_root *root, unsigned long nr) |
35b7e476 | 1967 | { |
188de649 CM |
1968 | /* |
1969 | * looks as though older kernels can get into trouble with | |
1970 | * this code, they end up stuck in balance_dirty_pages forever | |
1971 | */ | |
d6bfde87 CM |
1972 | struct extent_io_tree *tree; |
1973 | u64 num_dirty; | |
1974 | u64 start = 0; | |
b64a2851 | 1975 | unsigned long thresh = 96 * 1024 * 1024; |
d6bfde87 CM |
1976 | tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree; |
1977 | ||
b64a2851 | 1978 | if (current_is_pdflush() || current->flags & PF_MEMALLOC) |
d6bfde87 CM |
1979 | return; |
1980 | ||
1981 | num_dirty = count_range_bits(tree, &start, (u64)-1, | |
1982 | thresh, EXTENT_DIRTY); | |
1983 | if (num_dirty > thresh) { | |
1984 | balance_dirty_pages_ratelimited_nr( | |
d7fc640e | 1985 | root->fs_info->btree_inode->i_mapping, 1); |
d6bfde87 | 1986 | } |
188de649 | 1987 | return; |
35b7e476 | 1988 | } |
6b80053d | 1989 | |
ca7a79ad | 1990 | int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid) |
6b80053d | 1991 | { |
810191ff | 1992 | struct btrfs_root *root = BTRFS_I(buf->first_page->mapping->host)->root; |
ce9adaa5 | 1993 | int ret; |
ca7a79ad | 1994 | ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid); |
ce9adaa5 CM |
1995 | if (ret == 0) { |
1996 | buf->flags |= EXTENT_UPTODATE; | |
1997 | } | |
1998 | return ret; | |
6b80053d | 1999 | } |
0da5468f | 2000 | |
d1310b2e | 2001 | static struct extent_io_ops btree_extent_io_ops = { |
0da5468f | 2002 | .writepage_io_hook = btree_writepage_io_hook, |
ce9adaa5 | 2003 | .readpage_end_io_hook = btree_readpage_end_io_hook, |
0b86a832 | 2004 | .submit_bio_hook = btree_submit_bio_hook, |
239b14b3 CM |
2005 | /* note we're sharing with inode.c for the merge bio hook */ |
2006 | .merge_bio_hook = btrfs_merge_bio_hook, | |
0da5468f | 2007 | }; |