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