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