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