]>
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> |
5a0e3ad6 | 28 | #include <linux/slab.h> |
784b4e29 | 29 | #include <linux/migrate.h> |
7a36ddec | 30 | #include <linux/ratelimit.h> |
6463fe58 | 31 | #include <linux/uuid.h> |
803b2f54 | 32 | #include <linux/semaphore.h> |
7e75bf3f | 33 | #include <asm/unaligned.h> |
eb60ceac CM |
34 | #include "ctree.h" |
35 | #include "disk-io.h" | |
0b947aff | 36 | #include "hash.h" |
e089f05c | 37 | #include "transaction.h" |
0f7d52f4 | 38 | #include "btrfs_inode.h" |
0b86a832 | 39 | #include "volumes.h" |
db94535d | 40 | #include "print-tree.h" |
925baedd | 41 | #include "locking.h" |
e02119d5 | 42 | #include "tree-log.h" |
fa9c0d79 | 43 | #include "free-space-cache.h" |
70f6d82e | 44 | #include "free-space-tree.h" |
581bb050 | 45 | #include "inode-map.h" |
21adbd5c | 46 | #include "check-integrity.h" |
606686ee | 47 | #include "rcu-string.h" |
8dabb742 | 48 | #include "dev-replace.h" |
53b381b3 | 49 | #include "raid56.h" |
5ac1d209 | 50 | #include "sysfs.h" |
fcebe456 | 51 | #include "qgroup.h" |
ebb8765b | 52 | #include "compression.h" |
eb60ceac | 53 | |
de0022b9 JB |
54 | #ifdef CONFIG_X86 |
55 | #include <asm/cpufeature.h> | |
56 | #endif | |
57 | ||
319e4d06 QW |
58 | #define BTRFS_SUPER_FLAG_SUPP (BTRFS_HEADER_FLAG_WRITTEN |\ |
59 | BTRFS_HEADER_FLAG_RELOC |\ | |
60 | BTRFS_SUPER_FLAG_ERROR |\ | |
61 | BTRFS_SUPER_FLAG_SEEDING |\ | |
62 | BTRFS_SUPER_FLAG_METADUMP) | |
63 | ||
e8c9f186 | 64 | static const struct extent_io_ops btree_extent_io_ops; |
8b712842 | 65 | static void end_workqueue_fn(struct btrfs_work *work); |
4df27c4d | 66 | static void free_fs_root(struct btrfs_root *root); |
fcd1f065 | 67 | static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info, |
acce952b | 68 | int read_only); |
143bede5 | 69 | static void btrfs_destroy_ordered_extents(struct btrfs_root *root); |
acce952b | 70 | static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans, |
71 | struct btrfs_root *root); | |
143bede5 | 72 | static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root); |
acce952b | 73 | static int btrfs_destroy_marked_extents(struct btrfs_root *root, |
74 | struct extent_io_tree *dirty_pages, | |
75 | int mark); | |
76 | static int btrfs_destroy_pinned_extent(struct btrfs_root *root, | |
77 | struct extent_io_tree *pinned_extents); | |
48a3b636 ES |
78 | static int btrfs_cleanup_transaction(struct btrfs_root *root); |
79 | static void btrfs_error_commit_super(struct btrfs_root *root); | |
ce9adaa5 | 80 | |
d352ac68 | 81 | /* |
97eb6b69 DS |
82 | * btrfs_end_io_wq structs are used to do processing in task context when an IO |
83 | * is complete. This is used during reads to verify checksums, and it is used | |
d352ac68 CM |
84 | * by writes to insert metadata for new file extents after IO is complete. |
85 | */ | |
97eb6b69 | 86 | struct btrfs_end_io_wq { |
ce9adaa5 CM |
87 | struct bio *bio; |
88 | bio_end_io_t *end_io; | |
89 | void *private; | |
90 | struct btrfs_fs_info *info; | |
91 | int error; | |
bfebd8b5 | 92 | enum btrfs_wq_endio_type metadata; |
ce9adaa5 | 93 | struct list_head list; |
8b712842 | 94 | struct btrfs_work work; |
ce9adaa5 | 95 | }; |
0da5468f | 96 | |
97eb6b69 DS |
97 | static struct kmem_cache *btrfs_end_io_wq_cache; |
98 | ||
99 | int __init btrfs_end_io_wq_init(void) | |
100 | { | |
101 | btrfs_end_io_wq_cache = kmem_cache_create("btrfs_end_io_wq", | |
102 | sizeof(struct btrfs_end_io_wq), | |
103 | 0, | |
fba4b697 | 104 | SLAB_MEM_SPREAD, |
97eb6b69 DS |
105 | NULL); |
106 | if (!btrfs_end_io_wq_cache) | |
107 | return -ENOMEM; | |
108 | return 0; | |
109 | } | |
110 | ||
111 | void btrfs_end_io_wq_exit(void) | |
112 | { | |
5598e900 | 113 | kmem_cache_destroy(btrfs_end_io_wq_cache); |
97eb6b69 DS |
114 | } |
115 | ||
d352ac68 CM |
116 | /* |
117 | * async submit bios are used to offload expensive checksumming | |
118 | * onto the worker threads. They checksum file and metadata bios | |
119 | * just before they are sent down the IO stack. | |
120 | */ | |
44b8bd7e CM |
121 | struct async_submit_bio { |
122 | struct inode *inode; | |
123 | struct bio *bio; | |
124 | struct list_head list; | |
4a69a410 CM |
125 | extent_submit_bio_hook_t *submit_bio_start; |
126 | extent_submit_bio_hook_t *submit_bio_done; | |
44b8bd7e | 127 | int mirror_num; |
c8b97818 | 128 | unsigned long bio_flags; |
eaf25d93 CM |
129 | /* |
130 | * bio_offset is optional, can be used if the pages in the bio | |
131 | * can't tell us where in the file the bio should go | |
132 | */ | |
133 | u64 bio_offset; | |
8b712842 | 134 | struct btrfs_work work; |
79787eaa | 135 | int error; |
44b8bd7e CM |
136 | }; |
137 | ||
85d4e461 CM |
138 | /* |
139 | * Lockdep class keys for extent_buffer->lock's in this root. For a given | |
140 | * eb, the lockdep key is determined by the btrfs_root it belongs to and | |
141 | * the level the eb occupies in the tree. | |
142 | * | |
143 | * Different roots are used for different purposes and may nest inside each | |
144 | * other and they require separate keysets. As lockdep keys should be | |
145 | * static, assign keysets according to the purpose of the root as indicated | |
146 | * by btrfs_root->objectid. This ensures that all special purpose roots | |
147 | * have separate keysets. | |
4008c04a | 148 | * |
85d4e461 CM |
149 | * Lock-nesting across peer nodes is always done with the immediate parent |
150 | * node locked thus preventing deadlock. As lockdep doesn't know this, use | |
151 | * subclass to avoid triggering lockdep warning in such cases. | |
4008c04a | 152 | * |
85d4e461 CM |
153 | * The key is set by the readpage_end_io_hook after the buffer has passed |
154 | * csum validation but before the pages are unlocked. It is also set by | |
155 | * btrfs_init_new_buffer on freshly allocated blocks. | |
4008c04a | 156 | * |
85d4e461 CM |
157 | * We also add a check to make sure the highest level of the tree is the |
158 | * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code | |
159 | * needs update as well. | |
4008c04a CM |
160 | */ |
161 | #ifdef CONFIG_DEBUG_LOCK_ALLOC | |
162 | # if BTRFS_MAX_LEVEL != 8 | |
163 | # error | |
164 | # endif | |
85d4e461 CM |
165 | |
166 | static struct btrfs_lockdep_keyset { | |
167 | u64 id; /* root objectid */ | |
168 | const char *name_stem; /* lock name stem */ | |
169 | char names[BTRFS_MAX_LEVEL + 1][20]; | |
170 | struct lock_class_key keys[BTRFS_MAX_LEVEL + 1]; | |
171 | } btrfs_lockdep_keysets[] = { | |
172 | { .id = BTRFS_ROOT_TREE_OBJECTID, .name_stem = "root" }, | |
173 | { .id = BTRFS_EXTENT_TREE_OBJECTID, .name_stem = "extent" }, | |
174 | { .id = BTRFS_CHUNK_TREE_OBJECTID, .name_stem = "chunk" }, | |
175 | { .id = BTRFS_DEV_TREE_OBJECTID, .name_stem = "dev" }, | |
176 | { .id = BTRFS_FS_TREE_OBJECTID, .name_stem = "fs" }, | |
177 | { .id = BTRFS_CSUM_TREE_OBJECTID, .name_stem = "csum" }, | |
60b62978 | 178 | { .id = BTRFS_QUOTA_TREE_OBJECTID, .name_stem = "quota" }, |
85d4e461 CM |
179 | { .id = BTRFS_TREE_LOG_OBJECTID, .name_stem = "log" }, |
180 | { .id = BTRFS_TREE_RELOC_OBJECTID, .name_stem = "treloc" }, | |
181 | { .id = BTRFS_DATA_RELOC_TREE_OBJECTID, .name_stem = "dreloc" }, | |
13fd8da9 | 182 | { .id = BTRFS_UUID_TREE_OBJECTID, .name_stem = "uuid" }, |
6b20e0ad | 183 | { .id = BTRFS_FREE_SPACE_TREE_OBJECTID, .name_stem = "free-space" }, |
85d4e461 | 184 | { .id = 0, .name_stem = "tree" }, |
4008c04a | 185 | }; |
85d4e461 CM |
186 | |
187 | void __init btrfs_init_lockdep(void) | |
188 | { | |
189 | int i, j; | |
190 | ||
191 | /* initialize lockdep class names */ | |
192 | for (i = 0; i < ARRAY_SIZE(btrfs_lockdep_keysets); i++) { | |
193 | struct btrfs_lockdep_keyset *ks = &btrfs_lockdep_keysets[i]; | |
194 | ||
195 | for (j = 0; j < ARRAY_SIZE(ks->names); j++) | |
196 | snprintf(ks->names[j], sizeof(ks->names[j]), | |
197 | "btrfs-%s-%02d", ks->name_stem, j); | |
198 | } | |
199 | } | |
200 | ||
201 | void btrfs_set_buffer_lockdep_class(u64 objectid, struct extent_buffer *eb, | |
202 | int level) | |
203 | { | |
204 | struct btrfs_lockdep_keyset *ks; | |
205 | ||
206 | BUG_ON(level >= ARRAY_SIZE(ks->keys)); | |
207 | ||
208 | /* find the matching keyset, id 0 is the default entry */ | |
209 | for (ks = btrfs_lockdep_keysets; ks->id; ks++) | |
210 | if (ks->id == objectid) | |
211 | break; | |
212 | ||
213 | lockdep_set_class_and_name(&eb->lock, | |
214 | &ks->keys[level], ks->names[level]); | |
215 | } | |
216 | ||
4008c04a CM |
217 | #endif |
218 | ||
d352ac68 CM |
219 | /* |
220 | * extents on the btree inode are pretty simple, there's one extent | |
221 | * that covers the entire device | |
222 | */ | |
b2950863 | 223 | static struct extent_map *btree_get_extent(struct inode *inode, |
306e16ce | 224 | struct page *page, size_t pg_offset, u64 start, u64 len, |
b2950863 | 225 | int create) |
7eccb903 | 226 | { |
5f39d397 CM |
227 | struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree; |
228 | struct extent_map *em; | |
229 | int ret; | |
230 | ||
890871be | 231 | read_lock(&em_tree->lock); |
d1310b2e | 232 | em = lookup_extent_mapping(em_tree, start, len); |
a061fc8d CM |
233 | if (em) { |
234 | em->bdev = | |
235 | BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; | |
890871be | 236 | read_unlock(&em_tree->lock); |
5f39d397 | 237 | goto out; |
a061fc8d | 238 | } |
890871be | 239 | read_unlock(&em_tree->lock); |
7b13b7b1 | 240 | |
172ddd60 | 241 | em = alloc_extent_map(); |
5f39d397 CM |
242 | if (!em) { |
243 | em = ERR_PTR(-ENOMEM); | |
244 | goto out; | |
245 | } | |
246 | em->start = 0; | |
0afbaf8c | 247 | em->len = (u64)-1; |
c8b97818 | 248 | em->block_len = (u64)-1; |
5f39d397 | 249 | em->block_start = 0; |
a061fc8d | 250 | em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev; |
d1310b2e | 251 | |
890871be | 252 | write_lock(&em_tree->lock); |
09a2a8f9 | 253 | ret = add_extent_mapping(em_tree, em, 0); |
5f39d397 CM |
254 | if (ret == -EEXIST) { |
255 | free_extent_map(em); | |
7b13b7b1 | 256 | em = lookup_extent_mapping(em_tree, start, len); |
b4f359ab | 257 | if (!em) |
0433f20d | 258 | em = ERR_PTR(-EIO); |
5f39d397 | 259 | } else if (ret) { |
7b13b7b1 | 260 | free_extent_map(em); |
0433f20d | 261 | em = ERR_PTR(ret); |
5f39d397 | 262 | } |
890871be | 263 | write_unlock(&em_tree->lock); |
7b13b7b1 | 264 | |
5f39d397 CM |
265 | out: |
266 | return em; | |
7eccb903 CM |
267 | } |
268 | ||
b0496686 | 269 | u32 btrfs_csum_data(char *data, u32 seed, size_t len) |
19c00ddc | 270 | { |
0b947aff | 271 | return btrfs_crc32c(seed, data, len); |
19c00ddc CM |
272 | } |
273 | ||
0b5e3daf | 274 | void btrfs_csum_final(u32 crc, u8 *result) |
19c00ddc | 275 | { |
7e75bf3f | 276 | put_unaligned_le32(~crc, result); |
19c00ddc CM |
277 | } |
278 | ||
d352ac68 CM |
279 | /* |
280 | * compute the csum for a btree block, and either verify it or write it | |
281 | * into the csum field of the block. | |
282 | */ | |
01d58472 DD |
283 | static int csum_tree_block(struct btrfs_fs_info *fs_info, |
284 | struct extent_buffer *buf, | |
19c00ddc CM |
285 | int verify) |
286 | { | |
01d58472 | 287 | u16 csum_size = btrfs_super_csum_size(fs_info->super_copy); |
607d432d | 288 | char *result = NULL; |
19c00ddc CM |
289 | unsigned long len; |
290 | unsigned long cur_len; | |
291 | unsigned long offset = BTRFS_CSUM_SIZE; | |
19c00ddc CM |
292 | char *kaddr; |
293 | unsigned long map_start; | |
294 | unsigned long map_len; | |
295 | int err; | |
296 | u32 crc = ~(u32)0; | |
607d432d | 297 | unsigned long inline_result; |
19c00ddc CM |
298 | |
299 | len = buf->len - offset; | |
d397712b | 300 | while (len > 0) { |
19c00ddc | 301 | err = map_private_extent_buffer(buf, offset, 32, |
a6591715 | 302 | &kaddr, &map_start, &map_len); |
d397712b | 303 | if (err) |
8bd98f0e | 304 | return err; |
19c00ddc | 305 | cur_len = min(len, map_len - (offset - map_start)); |
b0496686 | 306 | crc = btrfs_csum_data(kaddr + offset - map_start, |
19c00ddc CM |
307 | crc, cur_len); |
308 | len -= cur_len; | |
309 | offset += cur_len; | |
19c00ddc | 310 | } |
607d432d | 311 | if (csum_size > sizeof(inline_result)) { |
31e818fe | 312 | result = kzalloc(csum_size, GFP_NOFS); |
607d432d | 313 | if (!result) |
8bd98f0e | 314 | return -ENOMEM; |
607d432d JB |
315 | } else { |
316 | result = (char *)&inline_result; | |
317 | } | |
318 | ||
19c00ddc CM |
319 | btrfs_csum_final(crc, result); |
320 | ||
321 | if (verify) { | |
607d432d | 322 | if (memcmp_extent_buffer(buf, result, 0, csum_size)) { |
e4204ded CM |
323 | u32 val; |
324 | u32 found = 0; | |
607d432d | 325 | memcpy(&found, result, csum_size); |
e4204ded | 326 | |
607d432d | 327 | read_extent_buffer(buf, &val, 0, csum_size); |
94647322 | 328 | btrfs_warn_rl(fs_info, |
5d163e0e | 329 | "%s checksum verify failed on %llu wanted %X found %X level %d", |
01d58472 | 330 | fs_info->sb->s_id, buf->start, |
efe120a0 | 331 | val, found, btrfs_header_level(buf)); |
607d432d JB |
332 | if (result != (char *)&inline_result) |
333 | kfree(result); | |
8bd98f0e | 334 | return -EUCLEAN; |
19c00ddc CM |
335 | } |
336 | } else { | |
607d432d | 337 | write_extent_buffer(buf, result, 0, csum_size); |
19c00ddc | 338 | } |
607d432d JB |
339 | if (result != (char *)&inline_result) |
340 | kfree(result); | |
19c00ddc CM |
341 | return 0; |
342 | } | |
343 | ||
d352ac68 CM |
344 | /* |
345 | * we can't consider a given block up to date unless the transid of the | |
346 | * block matches the transid in the parent node's pointer. This is how we | |
347 | * detect blocks that either didn't get written at all or got written | |
348 | * in the wrong place. | |
349 | */ | |
1259ab75 | 350 | static int verify_parent_transid(struct extent_io_tree *io_tree, |
b9fab919 CM |
351 | struct extent_buffer *eb, u64 parent_transid, |
352 | int atomic) | |
1259ab75 | 353 | { |
2ac55d41 | 354 | struct extent_state *cached_state = NULL; |
1259ab75 | 355 | int ret; |
2755a0de | 356 | bool need_lock = (current->journal_info == BTRFS_SEND_TRANS_STUB); |
1259ab75 CM |
357 | |
358 | if (!parent_transid || btrfs_header_generation(eb) == parent_transid) | |
359 | return 0; | |
360 | ||
b9fab919 CM |
361 | if (atomic) |
362 | return -EAGAIN; | |
363 | ||
a26e8c9f JB |
364 | if (need_lock) { |
365 | btrfs_tree_read_lock(eb); | |
366 | btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK); | |
367 | } | |
368 | ||
2ac55d41 | 369 | lock_extent_bits(io_tree, eb->start, eb->start + eb->len - 1, |
ff13db41 | 370 | &cached_state); |
0b32f4bb | 371 | if (extent_buffer_uptodate(eb) && |
1259ab75 CM |
372 | btrfs_header_generation(eb) == parent_transid) { |
373 | ret = 0; | |
374 | goto out; | |
375 | } | |
94647322 DS |
376 | btrfs_err_rl(eb->fs_info, |
377 | "parent transid verify failed on %llu wanted %llu found %llu", | |
378 | eb->start, | |
29549aec | 379 | parent_transid, btrfs_header_generation(eb)); |
1259ab75 | 380 | ret = 1; |
a26e8c9f JB |
381 | |
382 | /* | |
383 | * Things reading via commit roots that don't have normal protection, | |
384 | * like send, can have a really old block in cache that may point at a | |
01327610 | 385 | * block that has been freed and re-allocated. So don't clear uptodate |
a26e8c9f JB |
386 | * if we find an eb that is under IO (dirty/writeback) because we could |
387 | * end up reading in the stale data and then writing it back out and | |
388 | * making everybody very sad. | |
389 | */ | |
390 | if (!extent_buffer_under_io(eb)) | |
391 | clear_extent_buffer_uptodate(eb); | |
33958dc6 | 392 | out: |
2ac55d41 JB |
393 | unlock_extent_cached(io_tree, eb->start, eb->start + eb->len - 1, |
394 | &cached_state, GFP_NOFS); | |
472b909f JB |
395 | if (need_lock) |
396 | btrfs_tree_read_unlock_blocking(eb); | |
1259ab75 | 397 | return ret; |
1259ab75 CM |
398 | } |
399 | ||
1104a885 DS |
400 | /* |
401 | * Return 0 if the superblock checksum type matches the checksum value of that | |
402 | * algorithm. Pass the raw disk superblock data. | |
403 | */ | |
ab8d0fc4 JM |
404 | static int btrfs_check_super_csum(struct btrfs_fs_info *fs_info, |
405 | char *raw_disk_sb) | |
1104a885 DS |
406 | { |
407 | struct btrfs_super_block *disk_sb = | |
408 | (struct btrfs_super_block *)raw_disk_sb; | |
409 | u16 csum_type = btrfs_super_csum_type(disk_sb); | |
410 | int ret = 0; | |
411 | ||
412 | if (csum_type == BTRFS_CSUM_TYPE_CRC32) { | |
413 | u32 crc = ~(u32)0; | |
414 | const int csum_size = sizeof(crc); | |
415 | char result[csum_size]; | |
416 | ||
417 | /* | |
418 | * The super_block structure does not span the whole | |
419 | * BTRFS_SUPER_INFO_SIZE range, we expect that the unused space | |
01327610 | 420 | * is filled with zeros and is included in the checksum. |
1104a885 DS |
421 | */ |
422 | crc = btrfs_csum_data(raw_disk_sb + BTRFS_CSUM_SIZE, | |
423 | crc, BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE); | |
424 | btrfs_csum_final(crc, result); | |
425 | ||
426 | if (memcmp(raw_disk_sb, result, csum_size)) | |
427 | ret = 1; | |
428 | } | |
429 | ||
430 | if (csum_type >= ARRAY_SIZE(btrfs_csum_sizes)) { | |
ab8d0fc4 | 431 | btrfs_err(fs_info, "unsupported checksum algorithm %u", |
1104a885 DS |
432 | csum_type); |
433 | ret = 1; | |
434 | } | |
435 | ||
436 | return ret; | |
437 | } | |
438 | ||
d352ac68 CM |
439 | /* |
440 | * helper to read a given tree block, doing retries as required when | |
441 | * the checksums don't match and we have alternate mirrors to try. | |
442 | */ | |
f188591e CM |
443 | static int btree_read_extent_buffer_pages(struct btrfs_root *root, |
444 | struct extent_buffer *eb, | |
8436ea91 | 445 | u64 parent_transid) |
f188591e CM |
446 | { |
447 | struct extent_io_tree *io_tree; | |
ea466794 | 448 | int failed = 0; |
f188591e CM |
449 | int ret; |
450 | int num_copies = 0; | |
451 | int mirror_num = 0; | |
ea466794 | 452 | int failed_mirror = 0; |
f188591e | 453 | |
a826d6dc | 454 | clear_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags); |
f188591e CM |
455 | io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree; |
456 | while (1) { | |
8436ea91 | 457 | ret = read_extent_buffer_pages(io_tree, eb, WAIT_COMPLETE, |
f188591e | 458 | btree_get_extent, mirror_num); |
256dd1bb SB |
459 | if (!ret) { |
460 | if (!verify_parent_transid(io_tree, eb, | |
b9fab919 | 461 | parent_transid, 0)) |
256dd1bb SB |
462 | break; |
463 | else | |
464 | ret = -EIO; | |
465 | } | |
d397712b | 466 | |
a826d6dc JB |
467 | /* |
468 | * This buffer's crc is fine, but its contents are corrupted, so | |
469 | * there is no reason to read the other copies, they won't be | |
470 | * any less wrong. | |
471 | */ | |
472 | if (test_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags)) | |
ea466794 JB |
473 | break; |
474 | ||
5d964051 | 475 | num_copies = btrfs_num_copies(root->fs_info, |
f188591e | 476 | eb->start, eb->len); |
4235298e | 477 | if (num_copies == 1) |
ea466794 | 478 | break; |
4235298e | 479 | |
5cf1ab56 JB |
480 | if (!failed_mirror) { |
481 | failed = 1; | |
482 | failed_mirror = eb->read_mirror; | |
483 | } | |
484 | ||
f188591e | 485 | mirror_num++; |
ea466794 JB |
486 | if (mirror_num == failed_mirror) |
487 | mirror_num++; | |
488 | ||
4235298e | 489 | if (mirror_num > num_copies) |
ea466794 | 490 | break; |
f188591e | 491 | } |
ea466794 | 492 | |
c0901581 | 493 | if (failed && !ret && failed_mirror) |
ea466794 JB |
494 | repair_eb_io_failure(root, eb, failed_mirror); |
495 | ||
496 | return ret; | |
f188591e | 497 | } |
19c00ddc | 498 | |
d352ac68 | 499 | /* |
d397712b CM |
500 | * checksum a dirty tree block before IO. This has extra checks to make sure |
501 | * we only fill in the checksum field in the first page of a multi-page block | |
d352ac68 | 502 | */ |
d397712b | 503 | |
01d58472 | 504 | static int csum_dirty_buffer(struct btrfs_fs_info *fs_info, struct page *page) |
19c00ddc | 505 | { |
4eee4fa4 | 506 | u64 start = page_offset(page); |
19c00ddc | 507 | u64 found_start; |
19c00ddc | 508 | struct extent_buffer *eb; |
f188591e | 509 | |
4f2de97a JB |
510 | eb = (struct extent_buffer *)page->private; |
511 | if (page != eb->pages[0]) | |
512 | return 0; | |
0f805531 | 513 | |
19c00ddc | 514 | found_start = btrfs_header_bytenr(eb); |
0f805531 AL |
515 | /* |
516 | * Please do not consolidate these warnings into a single if. | |
517 | * It is useful to know what went wrong. | |
518 | */ | |
519 | if (WARN_ON(found_start != start)) | |
520 | return -EUCLEAN; | |
521 | if (WARN_ON(!PageUptodate(page))) | |
522 | return -EUCLEAN; | |
523 | ||
524 | ASSERT(memcmp_extent_buffer(eb, fs_info->fsid, | |
525 | btrfs_header_fsid(), BTRFS_FSID_SIZE) == 0); | |
526 | ||
8bd98f0e | 527 | return csum_tree_block(fs_info, eb, 0); |
19c00ddc CM |
528 | } |
529 | ||
01d58472 | 530 | static int check_tree_block_fsid(struct btrfs_fs_info *fs_info, |
2b82032c YZ |
531 | struct extent_buffer *eb) |
532 | { | |
01d58472 | 533 | struct btrfs_fs_devices *fs_devices = fs_info->fs_devices; |
2b82032c YZ |
534 | u8 fsid[BTRFS_UUID_SIZE]; |
535 | int ret = 1; | |
536 | ||
0a4e5586 | 537 | read_extent_buffer(eb, fsid, btrfs_header_fsid(), BTRFS_FSID_SIZE); |
2b82032c YZ |
538 | while (fs_devices) { |
539 | if (!memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE)) { | |
540 | ret = 0; | |
541 | break; | |
542 | } | |
543 | fs_devices = fs_devices->seed; | |
544 | } | |
545 | return ret; | |
546 | } | |
547 | ||
a826d6dc | 548 | #define CORRUPT(reason, eb, root, slot) \ |
6b722c17 LB |
549 | btrfs_crit(root->fs_info, "corrupt %s, %s: block=%llu," \ |
550 | " root=%llu, slot=%d", \ | |
551 | btrfs_header_level(eb) == 0 ? "leaf" : "node",\ | |
552 | reason, btrfs_header_bytenr(eb), root->objectid, slot) | |
a826d6dc JB |
553 | |
554 | static noinline int check_leaf(struct btrfs_root *root, | |
555 | struct extent_buffer *leaf) | |
556 | { | |
557 | struct btrfs_key key; | |
558 | struct btrfs_key leaf_key; | |
559 | u32 nritems = btrfs_header_nritems(leaf); | |
560 | int slot; | |
561 | ||
1ba98d08 LB |
562 | if (nritems == 0) { |
563 | struct btrfs_root *check_root; | |
564 | ||
565 | key.objectid = btrfs_header_owner(leaf); | |
566 | key.type = BTRFS_ROOT_ITEM_KEY; | |
567 | key.offset = (u64)-1; | |
568 | ||
569 | check_root = btrfs_get_fs_root(root->fs_info, &key, false); | |
570 | /* | |
571 | * The only reason we also check NULL here is that during | |
572 | * open_ctree() some roots has not yet been set up. | |
573 | */ | |
574 | if (!IS_ERR_OR_NULL(check_root)) { | |
575 | /* if leaf is the root, then it's fine */ | |
576 | if (leaf->start != | |
577 | btrfs_root_bytenr(&check_root->root_item)) { | |
578 | CORRUPT("non-root leaf's nritems is 0", | |
579 | leaf, root, 0); | |
580 | return -EIO; | |
581 | } | |
582 | } | |
a826d6dc | 583 | return 0; |
1ba98d08 | 584 | } |
a826d6dc JB |
585 | |
586 | /* Check the 0 item */ | |
587 | if (btrfs_item_offset_nr(leaf, 0) + btrfs_item_size_nr(leaf, 0) != | |
da17066c | 588 | BTRFS_LEAF_DATA_SIZE(root->fs_info)) { |
a826d6dc JB |
589 | CORRUPT("invalid item offset size pair", leaf, root, 0); |
590 | return -EIO; | |
591 | } | |
592 | ||
593 | /* | |
594 | * Check to make sure each items keys are in the correct order and their | |
595 | * offsets make sense. We only have to loop through nritems-1 because | |
596 | * we check the current slot against the next slot, which verifies the | |
597 | * next slot's offset+size makes sense and that the current's slot | |
598 | * offset is correct. | |
599 | */ | |
600 | for (slot = 0; slot < nritems - 1; slot++) { | |
601 | btrfs_item_key_to_cpu(leaf, &leaf_key, slot); | |
602 | btrfs_item_key_to_cpu(leaf, &key, slot + 1); | |
603 | ||
604 | /* Make sure the keys are in the right order */ | |
605 | if (btrfs_comp_cpu_keys(&leaf_key, &key) >= 0) { | |
606 | CORRUPT("bad key order", leaf, root, slot); | |
607 | return -EIO; | |
608 | } | |
609 | ||
610 | /* | |
611 | * Make sure the offset and ends are right, remember that the | |
612 | * item data starts at the end of the leaf and grows towards the | |
613 | * front. | |
614 | */ | |
615 | if (btrfs_item_offset_nr(leaf, slot) != | |
616 | btrfs_item_end_nr(leaf, slot + 1)) { | |
617 | CORRUPT("slot offset bad", leaf, root, slot); | |
618 | return -EIO; | |
619 | } | |
620 | ||
621 | /* | |
622 | * Check to make sure that we don't point outside of the leaf, | |
01327610 | 623 | * just in case all the items are consistent to each other, but |
a826d6dc JB |
624 | * all point outside of the leaf. |
625 | */ | |
626 | if (btrfs_item_end_nr(leaf, slot) > | |
da17066c | 627 | BTRFS_LEAF_DATA_SIZE(root->fs_info)) { |
a826d6dc JB |
628 | CORRUPT("slot end outside of leaf", leaf, root, slot); |
629 | return -EIO; | |
630 | } | |
631 | } | |
632 | ||
633 | return 0; | |
634 | } | |
635 | ||
053ab70f LB |
636 | static int check_node(struct btrfs_root *root, struct extent_buffer *node) |
637 | { | |
638 | unsigned long nr = btrfs_header_nritems(node); | |
6b722c17 LB |
639 | struct btrfs_key key, next_key; |
640 | int slot; | |
641 | u64 bytenr; | |
642 | int ret = 0; | |
053ab70f | 643 | |
da17066c | 644 | if (nr == 0 || nr > BTRFS_NODEPTRS_PER_BLOCK(root->fs_info)) { |
053ab70f LB |
645 | btrfs_crit(root->fs_info, |
646 | "corrupt node: block %llu root %llu nritems %lu", | |
647 | node->start, root->objectid, nr); | |
648 | return -EIO; | |
649 | } | |
6b722c17 LB |
650 | |
651 | for (slot = 0; slot < nr - 1; slot++) { | |
652 | bytenr = btrfs_node_blockptr(node, slot); | |
653 | btrfs_node_key_to_cpu(node, &key, slot); | |
654 | btrfs_node_key_to_cpu(node, &next_key, slot + 1); | |
655 | ||
656 | if (!bytenr) { | |
657 | CORRUPT("invalid item slot", node, root, slot); | |
658 | ret = -EIO; | |
659 | goto out; | |
660 | } | |
661 | ||
662 | if (btrfs_comp_cpu_keys(&key, &next_key) >= 0) { | |
663 | CORRUPT("bad key order", node, root, slot); | |
664 | ret = -EIO; | |
665 | goto out; | |
666 | } | |
667 | } | |
668 | out: | |
669 | return ret; | |
053ab70f LB |
670 | } |
671 | ||
facc8a22 MX |
672 | static int btree_readpage_end_io_hook(struct btrfs_io_bio *io_bio, |
673 | u64 phy_offset, struct page *page, | |
674 | u64 start, u64 end, int mirror) | |
ce9adaa5 | 675 | { |
ce9adaa5 CM |
676 | u64 found_start; |
677 | int found_level; | |
ce9adaa5 CM |
678 | struct extent_buffer *eb; |
679 | struct btrfs_root *root = BTRFS_I(page->mapping->host)->root; | |
02873e43 | 680 | struct btrfs_fs_info *fs_info = root->fs_info; |
f188591e | 681 | int ret = 0; |
727011e0 | 682 | int reads_done; |
ce9adaa5 | 683 | |
ce9adaa5 CM |
684 | if (!page->private) |
685 | goto out; | |
d397712b | 686 | |
4f2de97a | 687 | eb = (struct extent_buffer *)page->private; |
d397712b | 688 | |
0b32f4bb JB |
689 | /* the pending IO might have been the only thing that kept this buffer |
690 | * in memory. Make sure we have a ref for all this other checks | |
691 | */ | |
692 | extent_buffer_get(eb); | |
693 | ||
694 | reads_done = atomic_dec_and_test(&eb->io_pages); | |
727011e0 CM |
695 | if (!reads_done) |
696 | goto err; | |
f188591e | 697 | |
5cf1ab56 | 698 | eb->read_mirror = mirror; |
656f30db | 699 | if (test_bit(EXTENT_BUFFER_READ_ERR, &eb->bflags)) { |
ea466794 JB |
700 | ret = -EIO; |
701 | goto err; | |
702 | } | |
703 | ||
ce9adaa5 | 704 | found_start = btrfs_header_bytenr(eb); |
727011e0 | 705 | if (found_start != eb->start) { |
02873e43 ZL |
706 | btrfs_err_rl(fs_info, "bad tree block start %llu %llu", |
707 | found_start, eb->start); | |
f188591e | 708 | ret = -EIO; |
ce9adaa5 CM |
709 | goto err; |
710 | } | |
02873e43 ZL |
711 | if (check_tree_block_fsid(fs_info, eb)) { |
712 | btrfs_err_rl(fs_info, "bad fsid on block %llu", | |
713 | eb->start); | |
1259ab75 CM |
714 | ret = -EIO; |
715 | goto err; | |
716 | } | |
ce9adaa5 | 717 | found_level = btrfs_header_level(eb); |
1c24c3ce | 718 | if (found_level >= BTRFS_MAX_LEVEL) { |
02873e43 ZL |
719 | btrfs_err(fs_info, "bad tree block level %d", |
720 | (int)btrfs_header_level(eb)); | |
1c24c3ce JB |
721 | ret = -EIO; |
722 | goto err; | |
723 | } | |
ce9adaa5 | 724 | |
85d4e461 CM |
725 | btrfs_set_buffer_lockdep_class(btrfs_header_owner(eb), |
726 | eb, found_level); | |
4008c04a | 727 | |
02873e43 | 728 | ret = csum_tree_block(fs_info, eb, 1); |
8bd98f0e | 729 | if (ret) |
a826d6dc | 730 | goto err; |
a826d6dc JB |
731 | |
732 | /* | |
733 | * If this is a leaf block and it is corrupt, set the corrupt bit so | |
734 | * that we don't try and read the other copies of this block, just | |
735 | * return -EIO. | |
736 | */ | |
737 | if (found_level == 0 && check_leaf(root, eb)) { | |
738 | set_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags); | |
739 | ret = -EIO; | |
740 | } | |
ce9adaa5 | 741 | |
053ab70f LB |
742 | if (found_level > 0 && check_node(root, eb)) |
743 | ret = -EIO; | |
744 | ||
0b32f4bb JB |
745 | if (!ret) |
746 | set_extent_buffer_uptodate(eb); | |
ce9adaa5 | 747 | err: |
79fb65a1 JB |
748 | if (reads_done && |
749 | test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags)) | |
fc2e901f | 750 | btree_readahead_hook(fs_info, eb, ret); |
4bb31e92 | 751 | |
53b381b3 DW |
752 | if (ret) { |
753 | /* | |
754 | * our io error hook is going to dec the io pages | |
755 | * again, we have to make sure it has something | |
756 | * to decrement | |
757 | */ | |
758 | atomic_inc(&eb->io_pages); | |
0b32f4bb | 759 | clear_extent_buffer_uptodate(eb); |
53b381b3 | 760 | } |
0b32f4bb | 761 | free_extent_buffer(eb); |
ce9adaa5 | 762 | out: |
f188591e | 763 | return ret; |
ce9adaa5 CM |
764 | } |
765 | ||
ea466794 | 766 | static int btree_io_failed_hook(struct page *page, int failed_mirror) |
4bb31e92 | 767 | { |
4bb31e92 | 768 | struct extent_buffer *eb; |
4bb31e92 | 769 | |
4f2de97a | 770 | eb = (struct extent_buffer *)page->private; |
656f30db | 771 | set_bit(EXTENT_BUFFER_READ_ERR, &eb->bflags); |
5cf1ab56 | 772 | eb->read_mirror = failed_mirror; |
53b381b3 | 773 | atomic_dec(&eb->io_pages); |
ea466794 | 774 | if (test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags)) |
fc2e901f | 775 | btree_readahead_hook(eb->fs_info, eb, -EIO); |
4bb31e92 AJ |
776 | return -EIO; /* we fixed nothing */ |
777 | } | |
778 | ||
4246a0b6 | 779 | static void end_workqueue_bio(struct bio *bio) |
ce9adaa5 | 780 | { |
97eb6b69 | 781 | struct btrfs_end_io_wq *end_io_wq = bio->bi_private; |
ce9adaa5 | 782 | struct btrfs_fs_info *fs_info; |
9e0af237 LB |
783 | struct btrfs_workqueue *wq; |
784 | btrfs_work_func_t func; | |
ce9adaa5 | 785 | |
ce9adaa5 | 786 | fs_info = end_io_wq->info; |
4246a0b6 | 787 | end_io_wq->error = bio->bi_error; |
d20f7043 | 788 | |
37226b21 | 789 | if (bio_op(bio) == REQ_OP_WRITE) { |
9e0af237 LB |
790 | if (end_io_wq->metadata == BTRFS_WQ_ENDIO_METADATA) { |
791 | wq = fs_info->endio_meta_write_workers; | |
792 | func = btrfs_endio_meta_write_helper; | |
793 | } else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_FREE_SPACE) { | |
794 | wq = fs_info->endio_freespace_worker; | |
795 | func = btrfs_freespace_write_helper; | |
796 | } else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56) { | |
797 | wq = fs_info->endio_raid56_workers; | |
798 | func = btrfs_endio_raid56_helper; | |
799 | } else { | |
800 | wq = fs_info->endio_write_workers; | |
801 | func = btrfs_endio_write_helper; | |
802 | } | |
d20f7043 | 803 | } else { |
8b110e39 MX |
804 | if (unlikely(end_io_wq->metadata == |
805 | BTRFS_WQ_ENDIO_DIO_REPAIR)) { | |
806 | wq = fs_info->endio_repair_workers; | |
807 | func = btrfs_endio_repair_helper; | |
808 | } else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56) { | |
9e0af237 LB |
809 | wq = fs_info->endio_raid56_workers; |
810 | func = btrfs_endio_raid56_helper; | |
811 | } else if (end_io_wq->metadata) { | |
812 | wq = fs_info->endio_meta_workers; | |
813 | func = btrfs_endio_meta_helper; | |
814 | } else { | |
815 | wq = fs_info->endio_workers; | |
816 | func = btrfs_endio_helper; | |
817 | } | |
d20f7043 | 818 | } |
9e0af237 LB |
819 | |
820 | btrfs_init_work(&end_io_wq->work, func, end_workqueue_fn, NULL, NULL); | |
821 | btrfs_queue_work(wq, &end_io_wq->work); | |
ce9adaa5 CM |
822 | } |
823 | ||
22c59948 | 824 | int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio, |
bfebd8b5 | 825 | enum btrfs_wq_endio_type metadata) |
0b86a832 | 826 | { |
97eb6b69 | 827 | struct btrfs_end_io_wq *end_io_wq; |
8b110e39 | 828 | |
97eb6b69 | 829 | end_io_wq = kmem_cache_alloc(btrfs_end_io_wq_cache, GFP_NOFS); |
ce9adaa5 CM |
830 | if (!end_io_wq) |
831 | return -ENOMEM; | |
832 | ||
833 | end_io_wq->private = bio->bi_private; | |
834 | end_io_wq->end_io = bio->bi_end_io; | |
22c59948 | 835 | end_io_wq->info = info; |
ce9adaa5 CM |
836 | end_io_wq->error = 0; |
837 | end_io_wq->bio = bio; | |
22c59948 | 838 | end_io_wq->metadata = metadata; |
ce9adaa5 CM |
839 | |
840 | bio->bi_private = end_io_wq; | |
841 | bio->bi_end_io = end_workqueue_bio; | |
22c59948 CM |
842 | return 0; |
843 | } | |
844 | ||
b64a2851 | 845 | unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info) |
0986fe9e | 846 | { |
4854ddd0 | 847 | unsigned long limit = min_t(unsigned long, |
5cdc7ad3 | 848 | info->thread_pool_size, |
4854ddd0 CM |
849 | info->fs_devices->open_devices); |
850 | return 256 * limit; | |
851 | } | |
0986fe9e | 852 | |
4a69a410 CM |
853 | static void run_one_async_start(struct btrfs_work *work) |
854 | { | |
4a69a410 | 855 | struct async_submit_bio *async; |
79787eaa | 856 | int ret; |
4a69a410 CM |
857 | |
858 | async = container_of(work, struct async_submit_bio, work); | |
81a75f67 | 859 | ret = async->submit_bio_start(async->inode, async->bio, |
79787eaa JM |
860 | async->mirror_num, async->bio_flags, |
861 | async->bio_offset); | |
862 | if (ret) | |
863 | async->error = ret; | |
4a69a410 CM |
864 | } |
865 | ||
866 | static void run_one_async_done(struct btrfs_work *work) | |
8b712842 CM |
867 | { |
868 | struct btrfs_fs_info *fs_info; | |
869 | struct async_submit_bio *async; | |
4854ddd0 | 870 | int limit; |
8b712842 CM |
871 | |
872 | async = container_of(work, struct async_submit_bio, work); | |
873 | fs_info = BTRFS_I(async->inode)->root->fs_info; | |
4854ddd0 | 874 | |
b64a2851 | 875 | limit = btrfs_async_submit_limit(fs_info); |
4854ddd0 CM |
876 | limit = limit * 2 / 3; |
877 | ||
ee863954 DS |
878 | /* |
879 | * atomic_dec_return implies a barrier for waitqueue_active | |
880 | */ | |
66657b31 | 881 | if (atomic_dec_return(&fs_info->nr_async_submits) < limit && |
b64a2851 | 882 | waitqueue_active(&fs_info->async_submit_wait)) |
4854ddd0 CM |
883 | wake_up(&fs_info->async_submit_wait); |
884 | ||
bb7ab3b9 | 885 | /* If an error occurred we just want to clean up the bio and move on */ |
79787eaa | 886 | if (async->error) { |
4246a0b6 CH |
887 | async->bio->bi_error = async->error; |
888 | bio_endio(async->bio); | |
79787eaa JM |
889 | return; |
890 | } | |
891 | ||
81a75f67 MC |
892 | async->submit_bio_done(async->inode, async->bio, async->mirror_num, |
893 | async->bio_flags, async->bio_offset); | |
4a69a410 CM |
894 | } |
895 | ||
896 | static void run_one_async_free(struct btrfs_work *work) | |
897 | { | |
898 | struct async_submit_bio *async; | |
899 | ||
900 | async = container_of(work, struct async_submit_bio, work); | |
8b712842 CM |
901 | kfree(async); |
902 | } | |
903 | ||
44b8bd7e | 904 | int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode, |
81a75f67 | 905 | struct bio *bio, int mirror_num, |
c8b97818 | 906 | unsigned long bio_flags, |
eaf25d93 | 907 | u64 bio_offset, |
4a69a410 CM |
908 | extent_submit_bio_hook_t *submit_bio_start, |
909 | extent_submit_bio_hook_t *submit_bio_done) | |
44b8bd7e CM |
910 | { |
911 | struct async_submit_bio *async; | |
912 | ||
913 | async = kmalloc(sizeof(*async), GFP_NOFS); | |
914 | if (!async) | |
915 | return -ENOMEM; | |
916 | ||
917 | async->inode = inode; | |
44b8bd7e CM |
918 | async->bio = bio; |
919 | async->mirror_num = mirror_num; | |
4a69a410 CM |
920 | async->submit_bio_start = submit_bio_start; |
921 | async->submit_bio_done = submit_bio_done; | |
922 | ||
9e0af237 | 923 | btrfs_init_work(&async->work, btrfs_worker_helper, run_one_async_start, |
5cdc7ad3 | 924 | run_one_async_done, run_one_async_free); |
4a69a410 | 925 | |
c8b97818 | 926 | async->bio_flags = bio_flags; |
eaf25d93 | 927 | async->bio_offset = bio_offset; |
8c8bee1d | 928 | |
79787eaa JM |
929 | async->error = 0; |
930 | ||
cb03c743 | 931 | atomic_inc(&fs_info->nr_async_submits); |
d313d7a3 | 932 | |
1eff9d32 | 933 | if (bio->bi_opf & REQ_SYNC) |
5cdc7ad3 | 934 | btrfs_set_work_high_priority(&async->work); |
d313d7a3 | 935 | |
5cdc7ad3 | 936 | btrfs_queue_work(fs_info->workers, &async->work); |
9473f16c | 937 | |
d397712b | 938 | while (atomic_read(&fs_info->async_submit_draining) && |
771ed689 CM |
939 | atomic_read(&fs_info->nr_async_submits)) { |
940 | wait_event(fs_info->async_submit_wait, | |
941 | (atomic_read(&fs_info->nr_async_submits) == 0)); | |
942 | } | |
943 | ||
44b8bd7e CM |
944 | return 0; |
945 | } | |
946 | ||
ce3ed71a CM |
947 | static int btree_csum_one_bio(struct bio *bio) |
948 | { | |
2c30c71b | 949 | struct bio_vec *bvec; |
ce3ed71a | 950 | struct btrfs_root *root; |
2c30c71b | 951 | int i, ret = 0; |
ce3ed71a | 952 | |
2c30c71b | 953 | bio_for_each_segment_all(bvec, bio, i) { |
ce3ed71a | 954 | root = BTRFS_I(bvec->bv_page->mapping->host)->root; |
01d58472 | 955 | ret = csum_dirty_buffer(root->fs_info, bvec->bv_page); |
79787eaa JM |
956 | if (ret) |
957 | break; | |
ce3ed71a | 958 | } |
2c30c71b | 959 | |
79787eaa | 960 | return ret; |
ce3ed71a CM |
961 | } |
962 | ||
81a75f67 MC |
963 | static int __btree_submit_bio_start(struct inode *inode, struct bio *bio, |
964 | int mirror_num, unsigned long bio_flags, | |
eaf25d93 | 965 | u64 bio_offset) |
22c59948 | 966 | { |
8b712842 CM |
967 | /* |
968 | * when we're called for a write, we're already in the async | |
5443be45 | 969 | * submission context. Just jump into btrfs_map_bio |
8b712842 | 970 | */ |
79787eaa | 971 | return btree_csum_one_bio(bio); |
4a69a410 | 972 | } |
22c59948 | 973 | |
81a75f67 | 974 | static int __btree_submit_bio_done(struct inode *inode, struct bio *bio, |
eaf25d93 CM |
975 | int mirror_num, unsigned long bio_flags, |
976 | u64 bio_offset) | |
4a69a410 | 977 | { |
61891923 SB |
978 | int ret; |
979 | ||
8b712842 | 980 | /* |
4a69a410 CM |
981 | * when we're called for a write, we're already in the async |
982 | * submission context. Just jump into btrfs_map_bio | |
8b712842 | 983 | */ |
81a75f67 | 984 | ret = btrfs_map_bio(BTRFS_I(inode)->root, bio, mirror_num, 1); |
4246a0b6 CH |
985 | if (ret) { |
986 | bio->bi_error = ret; | |
987 | bio_endio(bio); | |
988 | } | |
61891923 | 989 | return ret; |
0b86a832 CM |
990 | } |
991 | ||
de0022b9 JB |
992 | static int check_async_write(struct inode *inode, unsigned long bio_flags) |
993 | { | |
994 | if (bio_flags & EXTENT_BIO_TREE_LOG) | |
995 | return 0; | |
996 | #ifdef CONFIG_X86 | |
bc696ca0 | 997 | if (static_cpu_has(X86_FEATURE_XMM4_2)) |
de0022b9 JB |
998 | return 0; |
999 | #endif | |
1000 | return 1; | |
1001 | } | |
1002 | ||
81a75f67 | 1003 | static int btree_submit_bio_hook(struct inode *inode, struct bio *bio, |
eaf25d93 CM |
1004 | int mirror_num, unsigned long bio_flags, |
1005 | u64 bio_offset) | |
44b8bd7e | 1006 | { |
de0022b9 | 1007 | int async = check_async_write(inode, bio_flags); |
cad321ad CM |
1008 | int ret; |
1009 | ||
37226b21 | 1010 | if (bio_op(bio) != REQ_OP_WRITE) { |
4a69a410 CM |
1011 | /* |
1012 | * called for a read, do the setup so that checksum validation | |
1013 | * can happen in the async kernel threads | |
1014 | */ | |
f3f266ab | 1015 | ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info, |
bfebd8b5 | 1016 | bio, BTRFS_WQ_ENDIO_METADATA); |
1d4284bd | 1017 | if (ret) |
61891923 | 1018 | goto out_w_error; |
81a75f67 | 1019 | ret = btrfs_map_bio(BTRFS_I(inode)->root, bio, mirror_num, 0); |
de0022b9 JB |
1020 | } else if (!async) { |
1021 | ret = btree_csum_one_bio(bio); | |
1022 | if (ret) | |
61891923 | 1023 | goto out_w_error; |
81a75f67 | 1024 | ret = btrfs_map_bio(BTRFS_I(inode)->root, bio, mirror_num, 0); |
61891923 SB |
1025 | } else { |
1026 | /* | |
1027 | * kthread helpers are used to submit writes so that | |
1028 | * checksumming can happen in parallel across all CPUs | |
1029 | */ | |
1030 | ret = btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info, | |
81a75f67 | 1031 | inode, bio, mirror_num, 0, |
61891923 SB |
1032 | bio_offset, |
1033 | __btree_submit_bio_start, | |
1034 | __btree_submit_bio_done); | |
44b8bd7e | 1035 | } |
d313d7a3 | 1036 | |
4246a0b6 CH |
1037 | if (ret) |
1038 | goto out_w_error; | |
1039 | return 0; | |
1040 | ||
61891923 | 1041 | out_w_error: |
4246a0b6 CH |
1042 | bio->bi_error = ret; |
1043 | bio_endio(bio); | |
61891923 | 1044 | return ret; |
44b8bd7e CM |
1045 | } |
1046 | ||
3dd1462e | 1047 | #ifdef CONFIG_MIGRATION |
784b4e29 | 1048 | static int btree_migratepage(struct address_space *mapping, |
a6bc32b8 MG |
1049 | struct page *newpage, struct page *page, |
1050 | enum migrate_mode mode) | |
784b4e29 CM |
1051 | { |
1052 | /* | |
1053 | * we can't safely write a btree page from here, | |
1054 | * we haven't done the locking hook | |
1055 | */ | |
1056 | if (PageDirty(page)) | |
1057 | return -EAGAIN; | |
1058 | /* | |
1059 | * Buffers may be managed in a filesystem specific way. | |
1060 | * We must have no buffers or drop them. | |
1061 | */ | |
1062 | if (page_has_private(page) && | |
1063 | !try_to_release_page(page, GFP_KERNEL)) | |
1064 | return -EAGAIN; | |
a6bc32b8 | 1065 | return migrate_page(mapping, newpage, page, mode); |
784b4e29 | 1066 | } |
3dd1462e | 1067 | #endif |
784b4e29 | 1068 | |
0da5468f CM |
1069 | |
1070 | static int btree_writepages(struct address_space *mapping, | |
1071 | struct writeback_control *wbc) | |
1072 | { | |
e2d84521 MX |
1073 | struct btrfs_fs_info *fs_info; |
1074 | int ret; | |
1075 | ||
d8d5f3e1 | 1076 | if (wbc->sync_mode == WB_SYNC_NONE) { |
448d640b CM |
1077 | |
1078 | if (wbc->for_kupdate) | |
1079 | return 0; | |
1080 | ||
e2d84521 | 1081 | fs_info = BTRFS_I(mapping->host)->root->fs_info; |
b9473439 | 1082 | /* this is a bit racy, but that's ok */ |
e2d84521 MX |
1083 | ret = percpu_counter_compare(&fs_info->dirty_metadata_bytes, |
1084 | BTRFS_DIRTY_METADATA_THRESH); | |
1085 | if (ret < 0) | |
793955bc | 1086 | return 0; |
793955bc | 1087 | } |
0b32f4bb | 1088 | return btree_write_cache_pages(mapping, wbc); |
0da5468f CM |
1089 | } |
1090 | ||
b2950863 | 1091 | static int btree_readpage(struct file *file, struct page *page) |
5f39d397 | 1092 | { |
d1310b2e CM |
1093 | struct extent_io_tree *tree; |
1094 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
8ddc7d9c | 1095 | return extent_read_full_page(tree, page, btree_get_extent, 0); |
5f39d397 | 1096 | } |
22b0ebda | 1097 | |
70dec807 | 1098 | static int btree_releasepage(struct page *page, gfp_t gfp_flags) |
5f39d397 | 1099 | { |
98509cfc | 1100 | if (PageWriteback(page) || PageDirty(page)) |
d397712b | 1101 | return 0; |
0c4e538b | 1102 | |
f7a52a40 | 1103 | return try_release_extent_buffer(page); |
d98237b3 CM |
1104 | } |
1105 | ||
d47992f8 LC |
1106 | static void btree_invalidatepage(struct page *page, unsigned int offset, |
1107 | unsigned int length) | |
d98237b3 | 1108 | { |
d1310b2e CM |
1109 | struct extent_io_tree *tree; |
1110 | tree = &BTRFS_I(page->mapping->host)->io_tree; | |
5f39d397 CM |
1111 | extent_invalidatepage(tree, page, offset); |
1112 | btree_releasepage(page, GFP_NOFS); | |
9ad6b7bc | 1113 | if (PagePrivate(page)) { |
efe120a0 FH |
1114 | btrfs_warn(BTRFS_I(page->mapping->host)->root->fs_info, |
1115 | "page private not zero on page %llu", | |
1116 | (unsigned long long)page_offset(page)); | |
9ad6b7bc CM |
1117 | ClearPagePrivate(page); |
1118 | set_page_private(page, 0); | |
09cbfeaf | 1119 | put_page(page); |
9ad6b7bc | 1120 | } |
d98237b3 CM |
1121 | } |
1122 | ||
0b32f4bb JB |
1123 | static int btree_set_page_dirty(struct page *page) |
1124 | { | |
bb146eb2 | 1125 | #ifdef DEBUG |
0b32f4bb JB |
1126 | struct extent_buffer *eb; |
1127 | ||
1128 | BUG_ON(!PagePrivate(page)); | |
1129 | eb = (struct extent_buffer *)page->private; | |
1130 | BUG_ON(!eb); | |
1131 | BUG_ON(!test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags)); | |
1132 | BUG_ON(!atomic_read(&eb->refs)); | |
1133 | btrfs_assert_tree_locked(eb); | |
bb146eb2 | 1134 | #endif |
0b32f4bb JB |
1135 | return __set_page_dirty_nobuffers(page); |
1136 | } | |
1137 | ||
7f09410b | 1138 | static const struct address_space_operations btree_aops = { |
d98237b3 | 1139 | .readpage = btree_readpage, |
0da5468f | 1140 | .writepages = btree_writepages, |
5f39d397 CM |
1141 | .releasepage = btree_releasepage, |
1142 | .invalidatepage = btree_invalidatepage, | |
5a92bc88 | 1143 | #ifdef CONFIG_MIGRATION |
784b4e29 | 1144 | .migratepage = btree_migratepage, |
5a92bc88 | 1145 | #endif |
0b32f4bb | 1146 | .set_page_dirty = btree_set_page_dirty, |
d98237b3 CM |
1147 | }; |
1148 | ||
d3e46fea | 1149 | void readahead_tree_block(struct btrfs_root *root, u64 bytenr) |
090d1875 | 1150 | { |
5f39d397 CM |
1151 | struct extent_buffer *buf = NULL; |
1152 | struct inode *btree_inode = root->fs_info->btree_inode; | |
090d1875 | 1153 | |
a83fffb7 | 1154 | buf = btrfs_find_create_tree_block(root, bytenr); |
c871b0f2 | 1155 | if (IS_ERR(buf)) |
6197d86e | 1156 | return; |
d1310b2e | 1157 | read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree, |
8436ea91 | 1158 | buf, WAIT_NONE, btree_get_extent, 0); |
5f39d397 | 1159 | free_extent_buffer(buf); |
090d1875 CM |
1160 | } |
1161 | ||
c0dcaa4d | 1162 | int reada_tree_block_flagged(struct btrfs_root *root, u64 bytenr, |
ab0fff03 AJ |
1163 | int mirror_num, struct extent_buffer **eb) |
1164 | { | |
1165 | struct extent_buffer *buf = NULL; | |
1166 | struct inode *btree_inode = root->fs_info->btree_inode; | |
1167 | struct extent_io_tree *io_tree = &BTRFS_I(btree_inode)->io_tree; | |
1168 | int ret; | |
1169 | ||
a83fffb7 | 1170 | buf = btrfs_find_create_tree_block(root, bytenr); |
c871b0f2 | 1171 | if (IS_ERR(buf)) |
ab0fff03 AJ |
1172 | return 0; |
1173 | ||
1174 | set_bit(EXTENT_BUFFER_READAHEAD, &buf->bflags); | |
1175 | ||
8436ea91 | 1176 | ret = read_extent_buffer_pages(io_tree, buf, WAIT_PAGE_LOCK, |
ab0fff03 AJ |
1177 | btree_get_extent, mirror_num); |
1178 | if (ret) { | |
1179 | free_extent_buffer(buf); | |
1180 | return ret; | |
1181 | } | |
1182 | ||
1183 | if (test_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags)) { | |
1184 | free_extent_buffer(buf); | |
1185 | return -EIO; | |
0b32f4bb | 1186 | } else if (extent_buffer_uptodate(buf)) { |
ab0fff03 AJ |
1187 | *eb = buf; |
1188 | } else { | |
1189 | free_extent_buffer(buf); | |
1190 | } | |
1191 | return 0; | |
1192 | } | |
1193 | ||
0999df54 | 1194 | struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root, |
a83fffb7 | 1195 | u64 bytenr) |
0999df54 | 1196 | { |
f5ee5c9a | 1197 | if (btrfs_is_testing(root->fs_info)) |
da17066c | 1198 | return alloc_test_extent_buffer(root->fs_info, bytenr); |
ce3e6984 | 1199 | return alloc_extent_buffer(root->fs_info, bytenr); |
0999df54 CM |
1200 | } |
1201 | ||
1202 | ||
e02119d5 CM |
1203 | int btrfs_write_tree_block(struct extent_buffer *buf) |
1204 | { | |
727011e0 | 1205 | return filemap_fdatawrite_range(buf->pages[0]->mapping, buf->start, |
8aa38c31 | 1206 | buf->start + buf->len - 1); |
e02119d5 CM |
1207 | } |
1208 | ||
1209 | int btrfs_wait_tree_block_writeback(struct extent_buffer *buf) | |
1210 | { | |
727011e0 | 1211 | return filemap_fdatawait_range(buf->pages[0]->mapping, |
8aa38c31 | 1212 | buf->start, buf->start + buf->len - 1); |
e02119d5 CM |
1213 | } |
1214 | ||
0999df54 | 1215 | struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr, |
ce86cd59 | 1216 | u64 parent_transid) |
0999df54 CM |
1217 | { |
1218 | struct extent_buffer *buf = NULL; | |
0999df54 CM |
1219 | int ret; |
1220 | ||
a83fffb7 | 1221 | buf = btrfs_find_create_tree_block(root, bytenr); |
c871b0f2 LB |
1222 | if (IS_ERR(buf)) |
1223 | return buf; | |
0999df54 | 1224 | |
8436ea91 | 1225 | ret = btree_read_extent_buffer_pages(root, buf, parent_transid); |
0f0fe8f7 FDBM |
1226 | if (ret) { |
1227 | free_extent_buffer(buf); | |
64c043de | 1228 | return ERR_PTR(ret); |
0f0fe8f7 | 1229 | } |
5f39d397 | 1230 | return buf; |
ce9adaa5 | 1231 | |
eb60ceac CM |
1232 | } |
1233 | ||
01d58472 DD |
1234 | void clean_tree_block(struct btrfs_trans_handle *trans, |
1235 | struct btrfs_fs_info *fs_info, | |
d5c13f92 | 1236 | struct extent_buffer *buf) |
ed2ff2cb | 1237 | { |
55c69072 | 1238 | if (btrfs_header_generation(buf) == |
e2d84521 | 1239 | fs_info->running_transaction->transid) { |
b9447ef8 | 1240 | btrfs_assert_tree_locked(buf); |
b4ce94de | 1241 | |
b9473439 | 1242 | if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) { |
e2d84521 MX |
1243 | __percpu_counter_add(&fs_info->dirty_metadata_bytes, |
1244 | -buf->len, | |
1245 | fs_info->dirty_metadata_batch); | |
ed7b63eb JB |
1246 | /* ugh, clear_extent_buffer_dirty needs to lock the page */ |
1247 | btrfs_set_lock_blocking(buf); | |
1248 | clear_extent_buffer_dirty(buf); | |
1249 | } | |
925baedd | 1250 | } |
5f39d397 CM |
1251 | } |
1252 | ||
8257b2dc MX |
1253 | static struct btrfs_subvolume_writers *btrfs_alloc_subvolume_writers(void) |
1254 | { | |
1255 | struct btrfs_subvolume_writers *writers; | |
1256 | int ret; | |
1257 | ||
1258 | writers = kmalloc(sizeof(*writers), GFP_NOFS); | |
1259 | if (!writers) | |
1260 | return ERR_PTR(-ENOMEM); | |
1261 | ||
908c7f19 | 1262 | ret = percpu_counter_init(&writers->counter, 0, GFP_KERNEL); |
8257b2dc MX |
1263 | if (ret < 0) { |
1264 | kfree(writers); | |
1265 | return ERR_PTR(ret); | |
1266 | } | |
1267 | ||
1268 | init_waitqueue_head(&writers->wait); | |
1269 | return writers; | |
1270 | } | |
1271 | ||
1272 | static void | |
1273 | btrfs_free_subvolume_writers(struct btrfs_subvolume_writers *writers) | |
1274 | { | |
1275 | percpu_counter_destroy(&writers->counter); | |
1276 | kfree(writers); | |
1277 | } | |
1278 | ||
da17066c | 1279 | static void __setup_root(struct btrfs_root *root, struct btrfs_fs_info *fs_info, |
143bede5 | 1280 | u64 objectid) |
d97e63b6 | 1281 | { |
7c0260ee | 1282 | bool dummy = test_bit(BTRFS_FS_STATE_DUMMY_FS_INFO, &fs_info->fs_state); |
cfaa7295 | 1283 | root->node = NULL; |
a28ec197 | 1284 | root->commit_root = NULL; |
27cdeb70 | 1285 | root->state = 0; |
d68fc57b | 1286 | root->orphan_cleanup_state = 0; |
0b86a832 | 1287 | |
0f7d52f4 CM |
1288 | root->objectid = objectid; |
1289 | root->last_trans = 0; | |
13a8a7c8 | 1290 | root->highest_objectid = 0; |
eb73c1b7 | 1291 | root->nr_delalloc_inodes = 0; |
199c2a9c | 1292 | root->nr_ordered_extents = 0; |
58176a96 | 1293 | root->name = NULL; |
6bef4d31 | 1294 | root->inode_tree = RB_ROOT; |
16cdcec7 | 1295 | INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC); |
f0486c68 | 1296 | root->block_rsv = NULL; |
d68fc57b | 1297 | root->orphan_block_rsv = NULL; |
0b86a832 CM |
1298 | |
1299 | INIT_LIST_HEAD(&root->dirty_list); | |
5d4f98a2 | 1300 | INIT_LIST_HEAD(&root->root_list); |
eb73c1b7 MX |
1301 | INIT_LIST_HEAD(&root->delalloc_inodes); |
1302 | INIT_LIST_HEAD(&root->delalloc_root); | |
199c2a9c MX |
1303 | INIT_LIST_HEAD(&root->ordered_extents); |
1304 | INIT_LIST_HEAD(&root->ordered_root); | |
2ab28f32 JB |
1305 | INIT_LIST_HEAD(&root->logged_list[0]); |
1306 | INIT_LIST_HEAD(&root->logged_list[1]); | |
d68fc57b | 1307 | spin_lock_init(&root->orphan_lock); |
5d4f98a2 | 1308 | spin_lock_init(&root->inode_lock); |
eb73c1b7 | 1309 | spin_lock_init(&root->delalloc_lock); |
199c2a9c | 1310 | spin_lock_init(&root->ordered_extent_lock); |
f0486c68 | 1311 | spin_lock_init(&root->accounting_lock); |
2ab28f32 JB |
1312 | spin_lock_init(&root->log_extents_lock[0]); |
1313 | spin_lock_init(&root->log_extents_lock[1]); | |
a2135011 | 1314 | mutex_init(&root->objectid_mutex); |
e02119d5 | 1315 | mutex_init(&root->log_mutex); |
31f3d255 | 1316 | mutex_init(&root->ordered_extent_mutex); |
573bfb72 | 1317 | mutex_init(&root->delalloc_mutex); |
7237f183 YZ |
1318 | init_waitqueue_head(&root->log_writer_wait); |
1319 | init_waitqueue_head(&root->log_commit_wait[0]); | |
1320 | init_waitqueue_head(&root->log_commit_wait[1]); | |
8b050d35 MX |
1321 | INIT_LIST_HEAD(&root->log_ctxs[0]); |
1322 | INIT_LIST_HEAD(&root->log_ctxs[1]); | |
7237f183 YZ |
1323 | atomic_set(&root->log_commit[0], 0); |
1324 | atomic_set(&root->log_commit[1], 0); | |
1325 | atomic_set(&root->log_writers, 0); | |
2ecb7923 | 1326 | atomic_set(&root->log_batch, 0); |
8a35d95f | 1327 | atomic_set(&root->orphan_inodes, 0); |
b0feb9d9 | 1328 | atomic_set(&root->refs, 1); |
8257b2dc | 1329 | atomic_set(&root->will_be_snapshoted, 0); |
55eeaf05 | 1330 | atomic_set(&root->qgroup_meta_rsv, 0); |
7237f183 | 1331 | root->log_transid = 0; |
d1433deb | 1332 | root->log_transid_committed = -1; |
257c62e1 | 1333 | root->last_log_commit = 0; |
7c0260ee | 1334 | if (!dummy) |
06ea65a3 JB |
1335 | extent_io_tree_init(&root->dirty_log_pages, |
1336 | fs_info->btree_inode->i_mapping); | |
017e5369 | 1337 | |
3768f368 CM |
1338 | memset(&root->root_key, 0, sizeof(root->root_key)); |
1339 | memset(&root->root_item, 0, sizeof(root->root_item)); | |
6702ed49 | 1340 | memset(&root->defrag_progress, 0, sizeof(root->defrag_progress)); |
7c0260ee | 1341 | if (!dummy) |
06ea65a3 JB |
1342 | root->defrag_trans_start = fs_info->generation; |
1343 | else | |
1344 | root->defrag_trans_start = 0; | |
4d775673 | 1345 | root->root_key.objectid = objectid; |
0ee5dc67 | 1346 | root->anon_dev = 0; |
8ea05e3a | 1347 | |
5f3ab90a | 1348 | spin_lock_init(&root->root_item_lock); |
3768f368 CM |
1349 | } |
1350 | ||
74e4d827 DS |
1351 | static struct btrfs_root *btrfs_alloc_root(struct btrfs_fs_info *fs_info, |
1352 | gfp_t flags) | |
6f07e42e | 1353 | { |
74e4d827 | 1354 | struct btrfs_root *root = kzalloc(sizeof(*root), flags); |
6f07e42e AV |
1355 | if (root) |
1356 | root->fs_info = fs_info; | |
1357 | return root; | |
1358 | } | |
1359 | ||
06ea65a3 JB |
1360 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
1361 | /* Should only be used by the testing infrastructure */ | |
da17066c | 1362 | struct btrfs_root *btrfs_alloc_dummy_root(struct btrfs_fs_info *fs_info) |
06ea65a3 JB |
1363 | { |
1364 | struct btrfs_root *root; | |
1365 | ||
7c0260ee JM |
1366 | if (!fs_info) |
1367 | return ERR_PTR(-EINVAL); | |
1368 | ||
1369 | root = btrfs_alloc_root(fs_info, GFP_KERNEL); | |
06ea65a3 JB |
1370 | if (!root) |
1371 | return ERR_PTR(-ENOMEM); | |
da17066c | 1372 | |
b9ef22de | 1373 | /* We don't use the stripesize in selftest, set it as sectorsize */ |
da17066c | 1374 | __setup_root(root, fs_info, BTRFS_ROOT_TREE_OBJECTID); |
faa2dbf0 | 1375 | root->alloc_bytenr = 0; |
06ea65a3 JB |
1376 | |
1377 | return root; | |
1378 | } | |
1379 | #endif | |
1380 | ||
20897f5c AJ |
1381 | struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans, |
1382 | struct btrfs_fs_info *fs_info, | |
1383 | u64 objectid) | |
1384 | { | |
1385 | struct extent_buffer *leaf; | |
1386 | struct btrfs_root *tree_root = fs_info->tree_root; | |
1387 | struct btrfs_root *root; | |
1388 | struct btrfs_key key; | |
1389 | int ret = 0; | |
6463fe58 | 1390 | uuid_le uuid; |
20897f5c | 1391 | |
74e4d827 | 1392 | root = btrfs_alloc_root(fs_info, GFP_KERNEL); |
20897f5c AJ |
1393 | if (!root) |
1394 | return ERR_PTR(-ENOMEM); | |
1395 | ||
da17066c | 1396 | __setup_root(root, fs_info, objectid); |
20897f5c AJ |
1397 | root->root_key.objectid = objectid; |
1398 | root->root_key.type = BTRFS_ROOT_ITEM_KEY; | |
1399 | root->root_key.offset = 0; | |
1400 | ||
4d75f8a9 | 1401 | leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0); |
20897f5c AJ |
1402 | if (IS_ERR(leaf)) { |
1403 | ret = PTR_ERR(leaf); | |
1dd05682 | 1404 | leaf = NULL; |
20897f5c AJ |
1405 | goto fail; |
1406 | } | |
1407 | ||
b159fa28 | 1408 | memzero_extent_buffer(leaf, 0, sizeof(struct btrfs_header)); |
20897f5c AJ |
1409 | btrfs_set_header_bytenr(leaf, leaf->start); |
1410 | btrfs_set_header_generation(leaf, trans->transid); | |
1411 | btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV); | |
1412 | btrfs_set_header_owner(leaf, objectid); | |
1413 | root->node = leaf; | |
1414 | ||
d24ee97b DS |
1415 | write_extent_buffer_fsid(leaf, fs_info->fsid); |
1416 | write_extent_buffer_chunk_tree_uuid(leaf, fs_info->chunk_tree_uuid); | |
20897f5c AJ |
1417 | btrfs_mark_buffer_dirty(leaf); |
1418 | ||
1419 | root->commit_root = btrfs_root_node(root); | |
27cdeb70 | 1420 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); |
20897f5c AJ |
1421 | |
1422 | root->root_item.flags = 0; | |
1423 | root->root_item.byte_limit = 0; | |
1424 | btrfs_set_root_bytenr(&root->root_item, leaf->start); | |
1425 | btrfs_set_root_generation(&root->root_item, trans->transid); | |
1426 | btrfs_set_root_level(&root->root_item, 0); | |
1427 | btrfs_set_root_refs(&root->root_item, 1); | |
1428 | btrfs_set_root_used(&root->root_item, leaf->len); | |
1429 | btrfs_set_root_last_snapshot(&root->root_item, 0); | |
1430 | btrfs_set_root_dirid(&root->root_item, 0); | |
6463fe58 SB |
1431 | uuid_le_gen(&uuid); |
1432 | memcpy(root->root_item.uuid, uuid.b, BTRFS_UUID_SIZE); | |
20897f5c AJ |
1433 | root->root_item.drop_level = 0; |
1434 | ||
1435 | key.objectid = objectid; | |
1436 | key.type = BTRFS_ROOT_ITEM_KEY; | |
1437 | key.offset = 0; | |
1438 | ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item); | |
1439 | if (ret) | |
1440 | goto fail; | |
1441 | ||
1442 | btrfs_tree_unlock(leaf); | |
1443 | ||
1dd05682 TI |
1444 | return root; |
1445 | ||
20897f5c | 1446 | fail: |
1dd05682 TI |
1447 | if (leaf) { |
1448 | btrfs_tree_unlock(leaf); | |
59885b39 | 1449 | free_extent_buffer(root->commit_root); |
1dd05682 TI |
1450 | free_extent_buffer(leaf); |
1451 | } | |
1452 | kfree(root); | |
20897f5c | 1453 | |
1dd05682 | 1454 | return ERR_PTR(ret); |
20897f5c AJ |
1455 | } |
1456 | ||
7237f183 YZ |
1457 | static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans, |
1458 | struct btrfs_fs_info *fs_info) | |
0f7d52f4 CM |
1459 | { |
1460 | struct btrfs_root *root; | |
7237f183 | 1461 | struct extent_buffer *leaf; |
e02119d5 | 1462 | |
74e4d827 | 1463 | root = btrfs_alloc_root(fs_info, GFP_NOFS); |
e02119d5 | 1464 | if (!root) |
7237f183 | 1465 | return ERR_PTR(-ENOMEM); |
e02119d5 | 1466 | |
da17066c | 1467 | __setup_root(root, fs_info, BTRFS_TREE_LOG_OBJECTID); |
e02119d5 CM |
1468 | |
1469 | root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID; | |
1470 | root->root_key.type = BTRFS_ROOT_ITEM_KEY; | |
1471 | root->root_key.offset = BTRFS_TREE_LOG_OBJECTID; | |
27cdeb70 | 1472 | |
7237f183 | 1473 | /* |
27cdeb70 MX |
1474 | * DON'T set REF_COWS for log trees |
1475 | * | |
7237f183 YZ |
1476 | * log trees do not get reference counted because they go away |
1477 | * before a real commit is actually done. They do store pointers | |
1478 | * to file data extents, and those reference counts still get | |
1479 | * updated (along with back refs to the log tree). | |
1480 | */ | |
e02119d5 | 1481 | |
4d75f8a9 DS |
1482 | leaf = btrfs_alloc_tree_block(trans, root, 0, BTRFS_TREE_LOG_OBJECTID, |
1483 | NULL, 0, 0, 0); | |
7237f183 YZ |
1484 | if (IS_ERR(leaf)) { |
1485 | kfree(root); | |
1486 | return ERR_CAST(leaf); | |
1487 | } | |
e02119d5 | 1488 | |
b159fa28 | 1489 | memzero_extent_buffer(leaf, 0, sizeof(struct btrfs_header)); |
5d4f98a2 YZ |
1490 | btrfs_set_header_bytenr(leaf, leaf->start); |
1491 | btrfs_set_header_generation(leaf, trans->transid); | |
1492 | btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV); | |
1493 | btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID); | |
7237f183 | 1494 | root->node = leaf; |
e02119d5 | 1495 | |
d24ee97b | 1496 | write_extent_buffer_fsid(root->node, root->fs_info->fsid); |
e02119d5 CM |
1497 | btrfs_mark_buffer_dirty(root->node); |
1498 | btrfs_tree_unlock(root->node); | |
7237f183 YZ |
1499 | return root; |
1500 | } | |
1501 | ||
1502 | int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans, | |
1503 | struct btrfs_fs_info *fs_info) | |
1504 | { | |
1505 | struct btrfs_root *log_root; | |
1506 | ||
1507 | log_root = alloc_log_tree(trans, fs_info); | |
1508 | if (IS_ERR(log_root)) | |
1509 | return PTR_ERR(log_root); | |
1510 | WARN_ON(fs_info->log_root_tree); | |
1511 | fs_info->log_root_tree = log_root; | |
1512 | return 0; | |
1513 | } | |
1514 | ||
1515 | int btrfs_add_log_tree(struct btrfs_trans_handle *trans, | |
1516 | struct btrfs_root *root) | |
1517 | { | |
1518 | struct btrfs_root *log_root; | |
1519 | struct btrfs_inode_item *inode_item; | |
1520 | ||
1521 | log_root = alloc_log_tree(trans, root->fs_info); | |
1522 | if (IS_ERR(log_root)) | |
1523 | return PTR_ERR(log_root); | |
1524 | ||
1525 | log_root->last_trans = trans->transid; | |
1526 | log_root->root_key.offset = root->root_key.objectid; | |
1527 | ||
1528 | inode_item = &log_root->root_item.inode; | |
3cae210f QW |
1529 | btrfs_set_stack_inode_generation(inode_item, 1); |
1530 | btrfs_set_stack_inode_size(inode_item, 3); | |
1531 | btrfs_set_stack_inode_nlink(inode_item, 1); | |
da17066c JM |
1532 | btrfs_set_stack_inode_nbytes(inode_item, |
1533 | root->fs_info->nodesize); | |
3cae210f | 1534 | btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755); |
7237f183 | 1535 | |
5d4f98a2 | 1536 | btrfs_set_root_node(&log_root->root_item, log_root->node); |
7237f183 YZ |
1537 | |
1538 | WARN_ON(root->log_root); | |
1539 | root->log_root = log_root; | |
1540 | root->log_transid = 0; | |
d1433deb | 1541 | root->log_transid_committed = -1; |
257c62e1 | 1542 | root->last_log_commit = 0; |
e02119d5 CM |
1543 | return 0; |
1544 | } | |
1545 | ||
35a3621b SB |
1546 | static struct btrfs_root *btrfs_read_tree_root(struct btrfs_root *tree_root, |
1547 | struct btrfs_key *key) | |
e02119d5 CM |
1548 | { |
1549 | struct btrfs_root *root; | |
1550 | struct btrfs_fs_info *fs_info = tree_root->fs_info; | |
0f7d52f4 | 1551 | struct btrfs_path *path; |
84234f3a | 1552 | u64 generation; |
cb517eab | 1553 | int ret; |
0f7d52f4 | 1554 | |
cb517eab MX |
1555 | path = btrfs_alloc_path(); |
1556 | if (!path) | |
0f7d52f4 | 1557 | return ERR_PTR(-ENOMEM); |
cb517eab | 1558 | |
74e4d827 | 1559 | root = btrfs_alloc_root(fs_info, GFP_NOFS); |
cb517eab MX |
1560 | if (!root) { |
1561 | ret = -ENOMEM; | |
1562 | goto alloc_fail; | |
0f7d52f4 CM |
1563 | } |
1564 | ||
da17066c | 1565 | __setup_root(root, fs_info, key->objectid); |
0f7d52f4 | 1566 | |
cb517eab MX |
1567 | ret = btrfs_find_root(tree_root, key, path, |
1568 | &root->root_item, &root->root_key); | |
0f7d52f4 | 1569 | if (ret) { |
13a8a7c8 YZ |
1570 | if (ret > 0) |
1571 | ret = -ENOENT; | |
cb517eab | 1572 | goto find_fail; |
0f7d52f4 | 1573 | } |
13a8a7c8 | 1574 | |
84234f3a | 1575 | generation = btrfs_root_generation(&root->root_item); |
db94535d | 1576 | root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item), |
ce86cd59 | 1577 | generation); |
64c043de LB |
1578 | if (IS_ERR(root->node)) { |
1579 | ret = PTR_ERR(root->node); | |
cb517eab MX |
1580 | goto find_fail; |
1581 | } else if (!btrfs_buffer_uptodate(root->node, generation, 0)) { | |
1582 | ret = -EIO; | |
64c043de LB |
1583 | free_extent_buffer(root->node); |
1584 | goto find_fail; | |
416bc658 | 1585 | } |
5d4f98a2 | 1586 | root->commit_root = btrfs_root_node(root); |
13a8a7c8 | 1587 | out: |
cb517eab MX |
1588 | btrfs_free_path(path); |
1589 | return root; | |
1590 | ||
cb517eab MX |
1591 | find_fail: |
1592 | kfree(root); | |
1593 | alloc_fail: | |
1594 | root = ERR_PTR(ret); | |
1595 | goto out; | |
1596 | } | |
1597 | ||
1598 | struct btrfs_root *btrfs_read_fs_root(struct btrfs_root *tree_root, | |
1599 | struct btrfs_key *location) | |
1600 | { | |
1601 | struct btrfs_root *root; | |
1602 | ||
1603 | root = btrfs_read_tree_root(tree_root, location); | |
1604 | if (IS_ERR(root)) | |
1605 | return root; | |
1606 | ||
1607 | if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) { | |
27cdeb70 | 1608 | set_bit(BTRFS_ROOT_REF_COWS, &root->state); |
08fe4db1 LZ |
1609 | btrfs_check_and_init_root_item(&root->root_item); |
1610 | } | |
13a8a7c8 | 1611 | |
5eda7b5e CM |
1612 | return root; |
1613 | } | |
1614 | ||
cb517eab MX |
1615 | int btrfs_init_fs_root(struct btrfs_root *root) |
1616 | { | |
1617 | int ret; | |
8257b2dc | 1618 | struct btrfs_subvolume_writers *writers; |
cb517eab MX |
1619 | |
1620 | root->free_ino_ctl = kzalloc(sizeof(*root->free_ino_ctl), GFP_NOFS); | |
1621 | root->free_ino_pinned = kzalloc(sizeof(*root->free_ino_pinned), | |
1622 | GFP_NOFS); | |
1623 | if (!root->free_ino_pinned || !root->free_ino_ctl) { | |
1624 | ret = -ENOMEM; | |
1625 | goto fail; | |
1626 | } | |
1627 | ||
8257b2dc MX |
1628 | writers = btrfs_alloc_subvolume_writers(); |
1629 | if (IS_ERR(writers)) { | |
1630 | ret = PTR_ERR(writers); | |
1631 | goto fail; | |
1632 | } | |
1633 | root->subv_writers = writers; | |
1634 | ||
cb517eab | 1635 | btrfs_init_free_ino_ctl(root); |
57cdc8db DS |
1636 | spin_lock_init(&root->ino_cache_lock); |
1637 | init_waitqueue_head(&root->ino_cache_wait); | |
cb517eab MX |
1638 | |
1639 | ret = get_anon_bdev(&root->anon_dev); | |
1640 | if (ret) | |
876d2cf1 | 1641 | goto fail; |
f32e48e9 CR |
1642 | |
1643 | mutex_lock(&root->objectid_mutex); | |
1644 | ret = btrfs_find_highest_objectid(root, | |
1645 | &root->highest_objectid); | |
1646 | if (ret) { | |
1647 | mutex_unlock(&root->objectid_mutex); | |
876d2cf1 | 1648 | goto fail; |
f32e48e9 CR |
1649 | } |
1650 | ||
1651 | ASSERT(root->highest_objectid <= BTRFS_LAST_FREE_OBJECTID); | |
1652 | ||
1653 | mutex_unlock(&root->objectid_mutex); | |
1654 | ||
cb517eab MX |
1655 | return 0; |
1656 | fail: | |
876d2cf1 | 1657 | /* the caller is responsible to call free_fs_root */ |
cb517eab MX |
1658 | return ret; |
1659 | } | |
1660 | ||
35bbb97f JM |
1661 | struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info, |
1662 | u64 root_id) | |
cb517eab MX |
1663 | { |
1664 | struct btrfs_root *root; | |
1665 | ||
1666 | spin_lock(&fs_info->fs_roots_radix_lock); | |
1667 | root = radix_tree_lookup(&fs_info->fs_roots_radix, | |
1668 | (unsigned long)root_id); | |
1669 | spin_unlock(&fs_info->fs_roots_radix_lock); | |
1670 | return root; | |
1671 | } | |
1672 | ||
1673 | int btrfs_insert_fs_root(struct btrfs_fs_info *fs_info, | |
1674 | struct btrfs_root *root) | |
1675 | { | |
1676 | int ret; | |
1677 | ||
e1860a77 | 1678 | ret = radix_tree_preload(GFP_NOFS); |
cb517eab MX |
1679 | if (ret) |
1680 | return ret; | |
1681 | ||
1682 | spin_lock(&fs_info->fs_roots_radix_lock); | |
1683 | ret = radix_tree_insert(&fs_info->fs_roots_radix, | |
1684 | (unsigned long)root->root_key.objectid, | |
1685 | root); | |
1686 | if (ret == 0) | |
27cdeb70 | 1687 | set_bit(BTRFS_ROOT_IN_RADIX, &root->state); |
cb517eab MX |
1688 | spin_unlock(&fs_info->fs_roots_radix_lock); |
1689 | radix_tree_preload_end(); | |
1690 | ||
1691 | return ret; | |
1692 | } | |
1693 | ||
c00869f1 MX |
1694 | struct btrfs_root *btrfs_get_fs_root(struct btrfs_fs_info *fs_info, |
1695 | struct btrfs_key *location, | |
1696 | bool check_ref) | |
5eda7b5e CM |
1697 | { |
1698 | struct btrfs_root *root; | |
381cf658 | 1699 | struct btrfs_path *path; |
1d4c08e0 | 1700 | struct btrfs_key key; |
5eda7b5e CM |
1701 | int ret; |
1702 | ||
edbd8d4e CM |
1703 | if (location->objectid == BTRFS_ROOT_TREE_OBJECTID) |
1704 | return fs_info->tree_root; | |
1705 | if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID) | |
1706 | return fs_info->extent_root; | |
8f18cf13 CM |
1707 | if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID) |
1708 | return fs_info->chunk_root; | |
1709 | if (location->objectid == BTRFS_DEV_TREE_OBJECTID) | |
1710 | return fs_info->dev_root; | |
0403e47e YZ |
1711 | if (location->objectid == BTRFS_CSUM_TREE_OBJECTID) |
1712 | return fs_info->csum_root; | |
bcef60f2 AJ |
1713 | if (location->objectid == BTRFS_QUOTA_TREE_OBJECTID) |
1714 | return fs_info->quota_root ? fs_info->quota_root : | |
1715 | ERR_PTR(-ENOENT); | |
f7a81ea4 SB |
1716 | if (location->objectid == BTRFS_UUID_TREE_OBJECTID) |
1717 | return fs_info->uuid_root ? fs_info->uuid_root : | |
1718 | ERR_PTR(-ENOENT); | |
70f6d82e OS |
1719 | if (location->objectid == BTRFS_FREE_SPACE_TREE_OBJECTID) |
1720 | return fs_info->free_space_root ? fs_info->free_space_root : | |
1721 | ERR_PTR(-ENOENT); | |
4df27c4d | 1722 | again: |
cb517eab | 1723 | root = btrfs_lookup_fs_root(fs_info, location->objectid); |
48475471 | 1724 | if (root) { |
c00869f1 | 1725 | if (check_ref && btrfs_root_refs(&root->root_item) == 0) |
48475471 | 1726 | return ERR_PTR(-ENOENT); |
5eda7b5e | 1727 | return root; |
48475471 | 1728 | } |
5eda7b5e | 1729 | |
cb517eab | 1730 | root = btrfs_read_fs_root(fs_info->tree_root, location); |
5eda7b5e CM |
1731 | if (IS_ERR(root)) |
1732 | return root; | |
3394e160 | 1733 | |
c00869f1 | 1734 | if (check_ref && btrfs_root_refs(&root->root_item) == 0) { |
cb517eab | 1735 | ret = -ENOENT; |
581bb050 | 1736 | goto fail; |
35a30d7c | 1737 | } |
581bb050 | 1738 | |
cb517eab | 1739 | ret = btrfs_init_fs_root(root); |
ac08aedf CM |
1740 | if (ret) |
1741 | goto fail; | |
3394e160 | 1742 | |
381cf658 DS |
1743 | path = btrfs_alloc_path(); |
1744 | if (!path) { | |
1745 | ret = -ENOMEM; | |
1746 | goto fail; | |
1747 | } | |
1d4c08e0 DS |
1748 | key.objectid = BTRFS_ORPHAN_OBJECTID; |
1749 | key.type = BTRFS_ORPHAN_ITEM_KEY; | |
1750 | key.offset = location->objectid; | |
1751 | ||
1752 | ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0); | |
381cf658 | 1753 | btrfs_free_path(path); |
d68fc57b YZ |
1754 | if (ret < 0) |
1755 | goto fail; | |
1756 | if (ret == 0) | |
27cdeb70 | 1757 | set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state); |
d68fc57b | 1758 | |
cb517eab | 1759 | ret = btrfs_insert_fs_root(fs_info, root); |
0f7d52f4 | 1760 | if (ret) { |
4df27c4d YZ |
1761 | if (ret == -EEXIST) { |
1762 | free_fs_root(root); | |
1763 | goto again; | |
1764 | } | |
1765 | goto fail; | |
0f7d52f4 | 1766 | } |
edbd8d4e | 1767 | return root; |
4df27c4d YZ |
1768 | fail: |
1769 | free_fs_root(root); | |
1770 | return ERR_PTR(ret); | |
edbd8d4e CM |
1771 | } |
1772 | ||
04160088 CM |
1773 | static int btrfs_congested_fn(void *congested_data, int bdi_bits) |
1774 | { | |
1775 | struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data; | |
1776 | int ret = 0; | |
04160088 CM |
1777 | struct btrfs_device *device; |
1778 | struct backing_dev_info *bdi; | |
b7967db7 | 1779 | |
1f78160c XG |
1780 | rcu_read_lock(); |
1781 | list_for_each_entry_rcu(device, &info->fs_devices->devices, dev_list) { | |
dfe25020 CM |
1782 | if (!device->bdev) |
1783 | continue; | |
04160088 | 1784 | bdi = blk_get_backing_dev_info(device->bdev); |
ff9ea323 | 1785 | if (bdi_congested(bdi, bdi_bits)) { |
04160088 CM |
1786 | ret = 1; |
1787 | break; | |
1788 | } | |
1789 | } | |
1f78160c | 1790 | rcu_read_unlock(); |
04160088 CM |
1791 | return ret; |
1792 | } | |
1793 | ||
04160088 CM |
1794 | static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi) |
1795 | { | |
ad081f14 JA |
1796 | int err; |
1797 | ||
b4caecd4 | 1798 | err = bdi_setup_and_register(bdi, "btrfs"); |
ad081f14 JA |
1799 | if (err) |
1800 | return err; | |
1801 | ||
09cbfeaf | 1802 | bdi->ra_pages = VM_MAX_READAHEAD * 1024 / PAGE_SIZE; |
04160088 CM |
1803 | bdi->congested_fn = btrfs_congested_fn; |
1804 | bdi->congested_data = info; | |
da2f0f74 | 1805 | bdi->capabilities |= BDI_CAP_CGROUP_WRITEBACK; |
04160088 CM |
1806 | return 0; |
1807 | } | |
1808 | ||
8b712842 CM |
1809 | /* |
1810 | * called by the kthread helper functions to finally call the bio end_io | |
1811 | * functions. This is where read checksum verification actually happens | |
1812 | */ | |
1813 | static void end_workqueue_fn(struct btrfs_work *work) | |
ce9adaa5 | 1814 | { |
ce9adaa5 | 1815 | struct bio *bio; |
97eb6b69 | 1816 | struct btrfs_end_io_wq *end_io_wq; |
ce9adaa5 | 1817 | |
97eb6b69 | 1818 | end_io_wq = container_of(work, struct btrfs_end_io_wq, work); |
8b712842 | 1819 | bio = end_io_wq->bio; |
ce9adaa5 | 1820 | |
4246a0b6 | 1821 | bio->bi_error = end_io_wq->error; |
8b712842 CM |
1822 | bio->bi_private = end_io_wq->private; |
1823 | bio->bi_end_io = end_io_wq->end_io; | |
97eb6b69 | 1824 | kmem_cache_free(btrfs_end_io_wq_cache, end_io_wq); |
4246a0b6 | 1825 | bio_endio(bio); |
44b8bd7e CM |
1826 | } |
1827 | ||
a74a4b97 CM |
1828 | static int cleaner_kthread(void *arg) |
1829 | { | |
1830 | struct btrfs_root *root = arg; | |
d0278245 | 1831 | int again; |
da288d28 | 1832 | struct btrfs_trans_handle *trans; |
a74a4b97 CM |
1833 | |
1834 | do { | |
d0278245 | 1835 | again = 0; |
a74a4b97 | 1836 | |
d0278245 | 1837 | /* Make the cleaner go to sleep early. */ |
babbf170 | 1838 | if (btrfs_need_cleaner_sleep(root)) |
d0278245 MX |
1839 | goto sleep; |
1840 | ||
90c711ab ZB |
1841 | /* |
1842 | * Do not do anything if we might cause open_ctree() to block | |
1843 | * before we have finished mounting the filesystem. | |
1844 | */ | |
afcdd129 | 1845 | if (!test_bit(BTRFS_FS_OPEN, &root->fs_info->flags)) |
90c711ab ZB |
1846 | goto sleep; |
1847 | ||
d0278245 MX |
1848 | if (!mutex_trylock(&root->fs_info->cleaner_mutex)) |
1849 | goto sleep; | |
1850 | ||
dc7f370c MX |
1851 | /* |
1852 | * Avoid the problem that we change the status of the fs | |
1853 | * during the above check and trylock. | |
1854 | */ | |
babbf170 | 1855 | if (btrfs_need_cleaner_sleep(root)) { |
dc7f370c MX |
1856 | mutex_unlock(&root->fs_info->cleaner_mutex); |
1857 | goto sleep; | |
76dda93c | 1858 | } |
a74a4b97 | 1859 | |
c2d6cb16 | 1860 | mutex_lock(&root->fs_info->cleaner_delayed_iput_mutex); |
d0278245 | 1861 | btrfs_run_delayed_iputs(root); |
c2d6cb16 FM |
1862 | mutex_unlock(&root->fs_info->cleaner_delayed_iput_mutex); |
1863 | ||
d0278245 MX |
1864 | again = btrfs_clean_one_deleted_snapshot(root); |
1865 | mutex_unlock(&root->fs_info->cleaner_mutex); | |
1866 | ||
1867 | /* | |
05323cd1 MX |
1868 | * The defragger has dealt with the R/O remount and umount, |
1869 | * needn't do anything special here. | |
d0278245 MX |
1870 | */ |
1871 | btrfs_run_defrag_inodes(root->fs_info); | |
67c5e7d4 FM |
1872 | |
1873 | /* | |
1874 | * Acquires fs_info->delete_unused_bgs_mutex to avoid racing | |
1875 | * with relocation (btrfs_relocate_chunk) and relocation | |
1876 | * acquires fs_info->cleaner_mutex (btrfs_relocate_block_group) | |
1877 | * after acquiring fs_info->delete_unused_bgs_mutex. So we | |
1878 | * can't hold, nor need to, fs_info->cleaner_mutex when deleting | |
1879 | * unused block groups. | |
1880 | */ | |
1881 | btrfs_delete_unused_bgs(root->fs_info); | |
d0278245 | 1882 | sleep: |
838fe188 | 1883 | if (!again) { |
a74a4b97 | 1884 | set_current_state(TASK_INTERRUPTIBLE); |
8929ecfa YZ |
1885 | if (!kthread_should_stop()) |
1886 | schedule(); | |
a74a4b97 CM |
1887 | __set_current_state(TASK_RUNNING); |
1888 | } | |
1889 | } while (!kthread_should_stop()); | |
da288d28 FM |
1890 | |
1891 | /* | |
1892 | * Transaction kthread is stopped before us and wakes us up. | |
1893 | * However we might have started a new transaction and COWed some | |
1894 | * tree blocks when deleting unused block groups for example. So | |
1895 | * make sure we commit the transaction we started to have a clean | |
1896 | * shutdown when evicting the btree inode - if it has dirty pages | |
1897 | * when we do the final iput() on it, eviction will trigger a | |
1898 | * writeback for it which will fail with null pointer dereferences | |
1899 | * since work queues and other resources were already released and | |
1900 | * destroyed by the time the iput/eviction/writeback is made. | |
1901 | */ | |
1902 | trans = btrfs_attach_transaction(root); | |
1903 | if (IS_ERR(trans)) { | |
1904 | if (PTR_ERR(trans) != -ENOENT) | |
1905 | btrfs_err(root->fs_info, | |
1906 | "cleaner transaction attach returned %ld", | |
1907 | PTR_ERR(trans)); | |
1908 | } else { | |
1909 | int ret; | |
1910 | ||
1911 | ret = btrfs_commit_transaction(trans, root); | |
1912 | if (ret) | |
1913 | btrfs_err(root->fs_info, | |
1914 | "cleaner open transaction commit returned %d", | |
1915 | ret); | |
1916 | } | |
1917 | ||
a74a4b97 CM |
1918 | return 0; |
1919 | } | |
1920 | ||
1921 | static int transaction_kthread(void *arg) | |
1922 | { | |
1923 | struct btrfs_root *root = arg; | |
1924 | struct btrfs_trans_handle *trans; | |
1925 | struct btrfs_transaction *cur; | |
8929ecfa | 1926 | u64 transid; |
a74a4b97 CM |
1927 | unsigned long now; |
1928 | unsigned long delay; | |
914b2007 | 1929 | bool cannot_commit; |
a74a4b97 CM |
1930 | |
1931 | do { | |
914b2007 | 1932 | cannot_commit = false; |
8b87dc17 | 1933 | delay = HZ * root->fs_info->commit_interval; |
a74a4b97 CM |
1934 | mutex_lock(&root->fs_info->transaction_kthread_mutex); |
1935 | ||
a4abeea4 | 1936 | spin_lock(&root->fs_info->trans_lock); |
a74a4b97 CM |
1937 | cur = root->fs_info->running_transaction; |
1938 | if (!cur) { | |
a4abeea4 | 1939 | spin_unlock(&root->fs_info->trans_lock); |
a74a4b97 CM |
1940 | goto sleep; |
1941 | } | |
31153d81 | 1942 | |
a74a4b97 | 1943 | now = get_seconds(); |
4a9d8bde | 1944 | if (cur->state < TRANS_STATE_BLOCKED && |
8b87dc17 DS |
1945 | (now < cur->start_time || |
1946 | now - cur->start_time < root->fs_info->commit_interval)) { | |
a4abeea4 | 1947 | spin_unlock(&root->fs_info->trans_lock); |
a74a4b97 CM |
1948 | delay = HZ * 5; |
1949 | goto sleep; | |
1950 | } | |
8929ecfa | 1951 | transid = cur->transid; |
a4abeea4 | 1952 | spin_unlock(&root->fs_info->trans_lock); |
56bec294 | 1953 | |
79787eaa | 1954 | /* If the file system is aborted, this will always fail. */ |
354aa0fb | 1955 | trans = btrfs_attach_transaction(root); |
914b2007 | 1956 | if (IS_ERR(trans)) { |
354aa0fb MX |
1957 | if (PTR_ERR(trans) != -ENOENT) |
1958 | cannot_commit = true; | |
79787eaa | 1959 | goto sleep; |
914b2007 | 1960 | } |
8929ecfa | 1961 | if (transid == trans->transid) { |
79787eaa | 1962 | btrfs_commit_transaction(trans, root); |
8929ecfa YZ |
1963 | } else { |
1964 | btrfs_end_transaction(trans, root); | |
1965 | } | |
a74a4b97 CM |
1966 | sleep: |
1967 | wake_up_process(root->fs_info->cleaner_kthread); | |
1968 | mutex_unlock(&root->fs_info->transaction_kthread_mutex); | |
1969 | ||
4e121c06 JB |
1970 | if (unlikely(test_bit(BTRFS_FS_STATE_ERROR, |
1971 | &root->fs_info->fs_state))) | |
1972 | btrfs_cleanup_transaction(root); | |
ce63f891 JK |
1973 | set_current_state(TASK_INTERRUPTIBLE); |
1974 | if (!kthread_should_stop() && | |
1975 | (!btrfs_transaction_blocked(root->fs_info) || | |
1976 | cannot_commit)) | |
1977 | schedule_timeout(delay); | |
1978 | __set_current_state(TASK_RUNNING); | |
a74a4b97 CM |
1979 | } while (!kthread_should_stop()); |
1980 | return 0; | |
1981 | } | |
1982 | ||
af31f5e5 CM |
1983 | /* |
1984 | * this will find the highest generation in the array of | |
1985 | * root backups. The index of the highest array is returned, | |
1986 | * or -1 if we can't find anything. | |
1987 | * | |
1988 | * We check to make sure the array is valid by comparing the | |
1989 | * generation of the latest root in the array with the generation | |
1990 | * in the super block. If they don't match we pitch it. | |
1991 | */ | |
1992 | static int find_newest_super_backup(struct btrfs_fs_info *info, u64 newest_gen) | |
1993 | { | |
1994 | u64 cur; | |
1995 | int newest_index = -1; | |
1996 | struct btrfs_root_backup *root_backup; | |
1997 | int i; | |
1998 | ||
1999 | for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) { | |
2000 | root_backup = info->super_copy->super_roots + i; | |
2001 | cur = btrfs_backup_tree_root_gen(root_backup); | |
2002 | if (cur == newest_gen) | |
2003 | newest_index = i; | |
2004 | } | |
2005 | ||
2006 | /* check to see if we actually wrapped around */ | |
2007 | if (newest_index == BTRFS_NUM_BACKUP_ROOTS - 1) { | |
2008 | root_backup = info->super_copy->super_roots; | |
2009 | cur = btrfs_backup_tree_root_gen(root_backup); | |
2010 | if (cur == newest_gen) | |
2011 | newest_index = 0; | |
2012 | } | |
2013 | return newest_index; | |
2014 | } | |
2015 | ||
2016 | ||
2017 | /* | |
2018 | * find the oldest backup so we know where to store new entries | |
2019 | * in the backup array. This will set the backup_root_index | |
2020 | * field in the fs_info struct | |
2021 | */ | |
2022 | static void find_oldest_super_backup(struct btrfs_fs_info *info, | |
2023 | u64 newest_gen) | |
2024 | { | |
2025 | int newest_index = -1; | |
2026 | ||
2027 | newest_index = find_newest_super_backup(info, newest_gen); | |
2028 | /* if there was garbage in there, just move along */ | |
2029 | if (newest_index == -1) { | |
2030 | info->backup_root_index = 0; | |
2031 | } else { | |
2032 | info->backup_root_index = (newest_index + 1) % BTRFS_NUM_BACKUP_ROOTS; | |
2033 | } | |
2034 | } | |
2035 | ||
2036 | /* | |
2037 | * copy all the root pointers into the super backup array. | |
2038 | * this will bump the backup pointer by one when it is | |
2039 | * done | |
2040 | */ | |
2041 | static void backup_super_roots(struct btrfs_fs_info *info) | |
2042 | { | |
2043 | int next_backup; | |
2044 | struct btrfs_root_backup *root_backup; | |
2045 | int last_backup; | |
2046 | ||
2047 | next_backup = info->backup_root_index; | |
2048 | last_backup = (next_backup + BTRFS_NUM_BACKUP_ROOTS - 1) % | |
2049 | BTRFS_NUM_BACKUP_ROOTS; | |
2050 | ||
2051 | /* | |
2052 | * just overwrite the last backup if we're at the same generation | |
2053 | * this happens only at umount | |
2054 | */ | |
2055 | root_backup = info->super_for_commit->super_roots + last_backup; | |
2056 | if (btrfs_backup_tree_root_gen(root_backup) == | |
2057 | btrfs_header_generation(info->tree_root->node)) | |
2058 | next_backup = last_backup; | |
2059 | ||
2060 | root_backup = info->super_for_commit->super_roots + next_backup; | |
2061 | ||
2062 | /* | |
2063 | * make sure all of our padding and empty slots get zero filled | |
2064 | * regardless of which ones we use today | |
2065 | */ | |
2066 | memset(root_backup, 0, sizeof(*root_backup)); | |
2067 | ||
2068 | info->backup_root_index = (next_backup + 1) % BTRFS_NUM_BACKUP_ROOTS; | |
2069 | ||
2070 | btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start); | |
2071 | btrfs_set_backup_tree_root_gen(root_backup, | |
2072 | btrfs_header_generation(info->tree_root->node)); | |
2073 | ||
2074 | btrfs_set_backup_tree_root_level(root_backup, | |
2075 | btrfs_header_level(info->tree_root->node)); | |
2076 | ||
2077 | btrfs_set_backup_chunk_root(root_backup, info->chunk_root->node->start); | |
2078 | btrfs_set_backup_chunk_root_gen(root_backup, | |
2079 | btrfs_header_generation(info->chunk_root->node)); | |
2080 | btrfs_set_backup_chunk_root_level(root_backup, | |
2081 | btrfs_header_level(info->chunk_root->node)); | |
2082 | ||
2083 | btrfs_set_backup_extent_root(root_backup, info->extent_root->node->start); | |
2084 | btrfs_set_backup_extent_root_gen(root_backup, | |
2085 | btrfs_header_generation(info->extent_root->node)); | |
2086 | btrfs_set_backup_extent_root_level(root_backup, | |
2087 | btrfs_header_level(info->extent_root->node)); | |
2088 | ||
7c7e82a7 CM |
2089 | /* |
2090 | * we might commit during log recovery, which happens before we set | |
2091 | * the fs_root. Make sure it is valid before we fill it in. | |
2092 | */ | |
2093 | if (info->fs_root && info->fs_root->node) { | |
2094 | btrfs_set_backup_fs_root(root_backup, | |
2095 | info->fs_root->node->start); | |
2096 | btrfs_set_backup_fs_root_gen(root_backup, | |
af31f5e5 | 2097 | btrfs_header_generation(info->fs_root->node)); |
7c7e82a7 | 2098 | btrfs_set_backup_fs_root_level(root_backup, |
af31f5e5 | 2099 | btrfs_header_level(info->fs_root->node)); |
7c7e82a7 | 2100 | } |
af31f5e5 CM |
2101 | |
2102 | btrfs_set_backup_dev_root(root_backup, info->dev_root->node->start); | |
2103 | btrfs_set_backup_dev_root_gen(root_backup, | |
2104 | btrfs_header_generation(info->dev_root->node)); | |
2105 | btrfs_set_backup_dev_root_level(root_backup, | |
2106 | btrfs_header_level(info->dev_root->node)); | |
2107 | ||
2108 | btrfs_set_backup_csum_root(root_backup, info->csum_root->node->start); | |
2109 | btrfs_set_backup_csum_root_gen(root_backup, | |
2110 | btrfs_header_generation(info->csum_root->node)); | |
2111 | btrfs_set_backup_csum_root_level(root_backup, | |
2112 | btrfs_header_level(info->csum_root->node)); | |
2113 | ||
2114 | btrfs_set_backup_total_bytes(root_backup, | |
2115 | btrfs_super_total_bytes(info->super_copy)); | |
2116 | btrfs_set_backup_bytes_used(root_backup, | |
2117 | btrfs_super_bytes_used(info->super_copy)); | |
2118 | btrfs_set_backup_num_devices(root_backup, | |
2119 | btrfs_super_num_devices(info->super_copy)); | |
2120 | ||
2121 | /* | |
2122 | * if we don't copy this out to the super_copy, it won't get remembered | |
2123 | * for the next commit | |
2124 | */ | |
2125 | memcpy(&info->super_copy->super_roots, | |
2126 | &info->super_for_commit->super_roots, | |
2127 | sizeof(*root_backup) * BTRFS_NUM_BACKUP_ROOTS); | |
2128 | } | |
2129 | ||
2130 | /* | |
2131 | * this copies info out of the root backup array and back into | |
2132 | * the in-memory super block. It is meant to help iterate through | |
2133 | * the array, so you send it the number of backups you've already | |
2134 | * tried and the last backup index you used. | |
2135 | * | |
2136 | * this returns -1 when it has tried all the backups | |
2137 | */ | |
2138 | static noinline int next_root_backup(struct btrfs_fs_info *info, | |
2139 | struct btrfs_super_block *super, | |
2140 | int *num_backups_tried, int *backup_index) | |
2141 | { | |
2142 | struct btrfs_root_backup *root_backup; | |
2143 | int newest = *backup_index; | |
2144 | ||
2145 | if (*num_backups_tried == 0) { | |
2146 | u64 gen = btrfs_super_generation(super); | |
2147 | ||
2148 | newest = find_newest_super_backup(info, gen); | |
2149 | if (newest == -1) | |
2150 | return -1; | |
2151 | ||
2152 | *backup_index = newest; | |
2153 | *num_backups_tried = 1; | |
2154 | } else if (*num_backups_tried == BTRFS_NUM_BACKUP_ROOTS) { | |
2155 | /* we've tried all the backups, all done */ | |
2156 | return -1; | |
2157 | } else { | |
2158 | /* jump to the next oldest backup */ | |
2159 | newest = (*backup_index + BTRFS_NUM_BACKUP_ROOTS - 1) % | |
2160 | BTRFS_NUM_BACKUP_ROOTS; | |
2161 | *backup_index = newest; | |
2162 | *num_backups_tried += 1; | |
2163 | } | |
2164 | root_backup = super->super_roots + newest; | |
2165 | ||
2166 | btrfs_set_super_generation(super, | |
2167 | btrfs_backup_tree_root_gen(root_backup)); | |
2168 | btrfs_set_super_root(super, btrfs_backup_tree_root(root_backup)); | |
2169 | btrfs_set_super_root_level(super, | |
2170 | btrfs_backup_tree_root_level(root_backup)); | |
2171 | btrfs_set_super_bytes_used(super, btrfs_backup_bytes_used(root_backup)); | |
2172 | ||
2173 | /* | |
2174 | * fixme: the total bytes and num_devices need to match or we should | |
2175 | * need a fsck | |
2176 | */ | |
2177 | btrfs_set_super_total_bytes(super, btrfs_backup_total_bytes(root_backup)); | |
2178 | btrfs_set_super_num_devices(super, btrfs_backup_num_devices(root_backup)); | |
2179 | return 0; | |
2180 | } | |
2181 | ||
7abadb64 LB |
2182 | /* helper to cleanup workers */ |
2183 | static void btrfs_stop_all_workers(struct btrfs_fs_info *fs_info) | |
2184 | { | |
dc6e3209 | 2185 | btrfs_destroy_workqueue(fs_info->fixup_workers); |
afe3d242 | 2186 | btrfs_destroy_workqueue(fs_info->delalloc_workers); |
5cdc7ad3 | 2187 | btrfs_destroy_workqueue(fs_info->workers); |
fccb5d86 QW |
2188 | btrfs_destroy_workqueue(fs_info->endio_workers); |
2189 | btrfs_destroy_workqueue(fs_info->endio_meta_workers); | |
2190 | btrfs_destroy_workqueue(fs_info->endio_raid56_workers); | |
8b110e39 | 2191 | btrfs_destroy_workqueue(fs_info->endio_repair_workers); |
d05a33ac | 2192 | btrfs_destroy_workqueue(fs_info->rmw_workers); |
fccb5d86 QW |
2193 | btrfs_destroy_workqueue(fs_info->endio_meta_write_workers); |
2194 | btrfs_destroy_workqueue(fs_info->endio_write_workers); | |
2195 | btrfs_destroy_workqueue(fs_info->endio_freespace_worker); | |
a8c93d4e | 2196 | btrfs_destroy_workqueue(fs_info->submit_workers); |
5b3bc44e | 2197 | btrfs_destroy_workqueue(fs_info->delayed_workers); |
e66f0bb1 | 2198 | btrfs_destroy_workqueue(fs_info->caching_workers); |
736cfa15 | 2199 | btrfs_destroy_workqueue(fs_info->readahead_workers); |
a44903ab | 2200 | btrfs_destroy_workqueue(fs_info->flush_workers); |
fc97fab0 | 2201 | btrfs_destroy_workqueue(fs_info->qgroup_rescan_workers); |
a79b7d4b | 2202 | btrfs_destroy_workqueue(fs_info->extent_workers); |
7abadb64 LB |
2203 | } |
2204 | ||
2e9f5954 R |
2205 | static void free_root_extent_buffers(struct btrfs_root *root) |
2206 | { | |
2207 | if (root) { | |
2208 | free_extent_buffer(root->node); | |
2209 | free_extent_buffer(root->commit_root); | |
2210 | root->node = NULL; | |
2211 | root->commit_root = NULL; | |
2212 | } | |
2213 | } | |
2214 | ||
af31f5e5 CM |
2215 | /* helper to cleanup tree roots */ |
2216 | static void free_root_pointers(struct btrfs_fs_info *info, int chunk_root) | |
2217 | { | |
2e9f5954 | 2218 | free_root_extent_buffers(info->tree_root); |
655b09fe | 2219 | |
2e9f5954 R |
2220 | free_root_extent_buffers(info->dev_root); |
2221 | free_root_extent_buffers(info->extent_root); | |
2222 | free_root_extent_buffers(info->csum_root); | |
2223 | free_root_extent_buffers(info->quota_root); | |
2224 | free_root_extent_buffers(info->uuid_root); | |
2225 | if (chunk_root) | |
2226 | free_root_extent_buffers(info->chunk_root); | |
70f6d82e | 2227 | free_root_extent_buffers(info->free_space_root); |
af31f5e5 CM |
2228 | } |
2229 | ||
faa2dbf0 | 2230 | void btrfs_free_fs_roots(struct btrfs_fs_info *fs_info) |
171f6537 JB |
2231 | { |
2232 | int ret; | |
2233 | struct btrfs_root *gang[8]; | |
2234 | int i; | |
2235 | ||
2236 | while (!list_empty(&fs_info->dead_roots)) { | |
2237 | gang[0] = list_entry(fs_info->dead_roots.next, | |
2238 | struct btrfs_root, root_list); | |
2239 | list_del(&gang[0]->root_list); | |
2240 | ||
27cdeb70 | 2241 | if (test_bit(BTRFS_ROOT_IN_RADIX, &gang[0]->state)) { |
cb517eab | 2242 | btrfs_drop_and_free_fs_root(fs_info, gang[0]); |
171f6537 JB |
2243 | } else { |
2244 | free_extent_buffer(gang[0]->node); | |
2245 | free_extent_buffer(gang[0]->commit_root); | |
b0feb9d9 | 2246 | btrfs_put_fs_root(gang[0]); |
171f6537 JB |
2247 | } |
2248 | } | |
2249 | ||
2250 | while (1) { | |
2251 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, | |
2252 | (void **)gang, 0, | |
2253 | ARRAY_SIZE(gang)); | |
2254 | if (!ret) | |
2255 | break; | |
2256 | for (i = 0; i < ret; i++) | |
cb517eab | 2257 | btrfs_drop_and_free_fs_root(fs_info, gang[i]); |
171f6537 | 2258 | } |
1a4319cc LB |
2259 | |
2260 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { | |
2261 | btrfs_free_log_root_tree(NULL, fs_info); | |
2262 | btrfs_destroy_pinned_extent(fs_info->tree_root, | |
2263 | fs_info->pinned_extents); | |
2264 | } | |
171f6537 | 2265 | } |
af31f5e5 | 2266 | |
638aa7ed ES |
2267 | static void btrfs_init_scrub(struct btrfs_fs_info *fs_info) |
2268 | { | |
2269 | mutex_init(&fs_info->scrub_lock); | |
2270 | atomic_set(&fs_info->scrubs_running, 0); | |
2271 | atomic_set(&fs_info->scrub_pause_req, 0); | |
2272 | atomic_set(&fs_info->scrubs_paused, 0); | |
2273 | atomic_set(&fs_info->scrub_cancel_req, 0); | |
2274 | init_waitqueue_head(&fs_info->scrub_pause_wait); | |
2275 | fs_info->scrub_workers_refcnt = 0; | |
2276 | } | |
2277 | ||
779a65a4 ES |
2278 | static void btrfs_init_balance(struct btrfs_fs_info *fs_info) |
2279 | { | |
2280 | spin_lock_init(&fs_info->balance_lock); | |
2281 | mutex_init(&fs_info->balance_mutex); | |
2282 | atomic_set(&fs_info->balance_running, 0); | |
2283 | atomic_set(&fs_info->balance_pause_req, 0); | |
2284 | atomic_set(&fs_info->balance_cancel_req, 0); | |
2285 | fs_info->balance_ctl = NULL; | |
2286 | init_waitqueue_head(&fs_info->balance_wait_q); | |
2287 | } | |
2288 | ||
6bccf3ab | 2289 | static void btrfs_init_btree_inode(struct btrfs_fs_info *fs_info) |
f37938e0 ES |
2290 | { |
2291 | fs_info->btree_inode->i_ino = BTRFS_BTREE_INODE_OBJECTID; | |
2292 | set_nlink(fs_info->btree_inode, 1); | |
2293 | /* | |
2294 | * we set the i_size on the btree inode to the max possible int. | |
2295 | * the real end of the address space is determined by all of | |
2296 | * the devices in the system | |
2297 | */ | |
2298 | fs_info->btree_inode->i_size = OFFSET_MAX; | |
2299 | fs_info->btree_inode->i_mapping->a_ops = &btree_aops; | |
f37938e0 ES |
2300 | |
2301 | RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node); | |
2302 | extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree, | |
2303 | fs_info->btree_inode->i_mapping); | |
2304 | BTRFS_I(fs_info->btree_inode)->io_tree.track_uptodate = 0; | |
2305 | extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree); | |
2306 | ||
2307 | BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops; | |
2308 | ||
6bccf3ab | 2309 | BTRFS_I(fs_info->btree_inode)->root = fs_info->tree_root; |
f37938e0 ES |
2310 | memset(&BTRFS_I(fs_info->btree_inode)->location, 0, |
2311 | sizeof(struct btrfs_key)); | |
2312 | set_bit(BTRFS_INODE_DUMMY, | |
2313 | &BTRFS_I(fs_info->btree_inode)->runtime_flags); | |
2314 | btrfs_insert_inode_hash(fs_info->btree_inode); | |
2315 | } | |
2316 | ||
ad618368 ES |
2317 | static void btrfs_init_dev_replace_locks(struct btrfs_fs_info *fs_info) |
2318 | { | |
2319 | fs_info->dev_replace.lock_owner = 0; | |
2320 | atomic_set(&fs_info->dev_replace.nesting_level, 0); | |
2321 | mutex_init(&fs_info->dev_replace.lock_finishing_cancel_unmount); | |
73beece9 LB |
2322 | rwlock_init(&fs_info->dev_replace.lock); |
2323 | atomic_set(&fs_info->dev_replace.read_locks, 0); | |
2324 | atomic_set(&fs_info->dev_replace.blocking_readers, 0); | |
ad618368 | 2325 | init_waitqueue_head(&fs_info->replace_wait); |
73beece9 | 2326 | init_waitqueue_head(&fs_info->dev_replace.read_lock_wq); |
ad618368 ES |
2327 | } |
2328 | ||
f9e92e40 ES |
2329 | static void btrfs_init_qgroup(struct btrfs_fs_info *fs_info) |
2330 | { | |
2331 | spin_lock_init(&fs_info->qgroup_lock); | |
2332 | mutex_init(&fs_info->qgroup_ioctl_lock); | |
2333 | fs_info->qgroup_tree = RB_ROOT; | |
2334 | fs_info->qgroup_op_tree = RB_ROOT; | |
2335 | INIT_LIST_HEAD(&fs_info->dirty_qgroups); | |
2336 | fs_info->qgroup_seq = 1; | |
f9e92e40 | 2337 | fs_info->qgroup_ulist = NULL; |
d2c609b8 | 2338 | fs_info->qgroup_rescan_running = false; |
f9e92e40 ES |
2339 | mutex_init(&fs_info->qgroup_rescan_lock); |
2340 | } | |
2341 | ||
2a458198 ES |
2342 | static int btrfs_init_workqueues(struct btrfs_fs_info *fs_info, |
2343 | struct btrfs_fs_devices *fs_devices) | |
2344 | { | |
2345 | int max_active = fs_info->thread_pool_size; | |
6f011058 | 2346 | unsigned int flags = WQ_MEM_RECLAIM | WQ_FREEZABLE | WQ_UNBOUND; |
2a458198 ES |
2347 | |
2348 | fs_info->workers = | |
cb001095 JM |
2349 | btrfs_alloc_workqueue(fs_info, "worker", |
2350 | flags | WQ_HIGHPRI, max_active, 16); | |
2a458198 ES |
2351 | |
2352 | fs_info->delalloc_workers = | |
cb001095 JM |
2353 | btrfs_alloc_workqueue(fs_info, "delalloc", |
2354 | flags, max_active, 2); | |
2a458198 ES |
2355 | |
2356 | fs_info->flush_workers = | |
cb001095 JM |
2357 | btrfs_alloc_workqueue(fs_info, "flush_delalloc", |
2358 | flags, max_active, 0); | |
2a458198 ES |
2359 | |
2360 | fs_info->caching_workers = | |
cb001095 | 2361 | btrfs_alloc_workqueue(fs_info, "cache", flags, max_active, 0); |
2a458198 ES |
2362 | |
2363 | /* | |
2364 | * a higher idle thresh on the submit workers makes it much more | |
2365 | * likely that bios will be send down in a sane order to the | |
2366 | * devices | |
2367 | */ | |
2368 | fs_info->submit_workers = | |
cb001095 | 2369 | btrfs_alloc_workqueue(fs_info, "submit", flags, |
2a458198 ES |
2370 | min_t(u64, fs_devices->num_devices, |
2371 | max_active), 64); | |
2372 | ||
2373 | fs_info->fixup_workers = | |
cb001095 | 2374 | btrfs_alloc_workqueue(fs_info, "fixup", flags, 1, 0); |
2a458198 ES |
2375 | |
2376 | /* | |
2377 | * endios are largely parallel and should have a very | |
2378 | * low idle thresh | |
2379 | */ | |
2380 | fs_info->endio_workers = | |
cb001095 | 2381 | btrfs_alloc_workqueue(fs_info, "endio", flags, max_active, 4); |
2a458198 | 2382 | fs_info->endio_meta_workers = |
cb001095 JM |
2383 | btrfs_alloc_workqueue(fs_info, "endio-meta", flags, |
2384 | max_active, 4); | |
2a458198 | 2385 | fs_info->endio_meta_write_workers = |
cb001095 JM |
2386 | btrfs_alloc_workqueue(fs_info, "endio-meta-write", flags, |
2387 | max_active, 2); | |
2a458198 | 2388 | fs_info->endio_raid56_workers = |
cb001095 JM |
2389 | btrfs_alloc_workqueue(fs_info, "endio-raid56", flags, |
2390 | max_active, 4); | |
2a458198 | 2391 | fs_info->endio_repair_workers = |
cb001095 | 2392 | btrfs_alloc_workqueue(fs_info, "endio-repair", flags, 1, 0); |
2a458198 | 2393 | fs_info->rmw_workers = |
cb001095 | 2394 | btrfs_alloc_workqueue(fs_info, "rmw", flags, max_active, 2); |
2a458198 | 2395 | fs_info->endio_write_workers = |
cb001095 JM |
2396 | btrfs_alloc_workqueue(fs_info, "endio-write", flags, |
2397 | max_active, 2); | |
2a458198 | 2398 | fs_info->endio_freespace_worker = |
cb001095 JM |
2399 | btrfs_alloc_workqueue(fs_info, "freespace-write", flags, |
2400 | max_active, 0); | |
2a458198 | 2401 | fs_info->delayed_workers = |
cb001095 JM |
2402 | btrfs_alloc_workqueue(fs_info, "delayed-meta", flags, |
2403 | max_active, 0); | |
2a458198 | 2404 | fs_info->readahead_workers = |
cb001095 JM |
2405 | btrfs_alloc_workqueue(fs_info, "readahead", flags, |
2406 | max_active, 2); | |
2a458198 | 2407 | fs_info->qgroup_rescan_workers = |
cb001095 | 2408 | btrfs_alloc_workqueue(fs_info, "qgroup-rescan", flags, 1, 0); |
2a458198 | 2409 | fs_info->extent_workers = |
cb001095 | 2410 | btrfs_alloc_workqueue(fs_info, "extent-refs", flags, |
2a458198 ES |
2411 | min_t(u64, fs_devices->num_devices, |
2412 | max_active), 8); | |
2413 | ||
2414 | if (!(fs_info->workers && fs_info->delalloc_workers && | |
2415 | fs_info->submit_workers && fs_info->flush_workers && | |
2416 | fs_info->endio_workers && fs_info->endio_meta_workers && | |
2417 | fs_info->endio_meta_write_workers && | |
2418 | fs_info->endio_repair_workers && | |
2419 | fs_info->endio_write_workers && fs_info->endio_raid56_workers && | |
2420 | fs_info->endio_freespace_worker && fs_info->rmw_workers && | |
2421 | fs_info->caching_workers && fs_info->readahead_workers && | |
2422 | fs_info->fixup_workers && fs_info->delayed_workers && | |
2423 | fs_info->extent_workers && | |
2424 | fs_info->qgroup_rescan_workers)) { | |
2425 | return -ENOMEM; | |
2426 | } | |
2427 | ||
2428 | return 0; | |
2429 | } | |
2430 | ||
63443bf5 ES |
2431 | static int btrfs_replay_log(struct btrfs_fs_info *fs_info, |
2432 | struct btrfs_fs_devices *fs_devices) | |
2433 | { | |
2434 | int ret; | |
2435 | struct btrfs_root *tree_root = fs_info->tree_root; | |
2436 | struct btrfs_root *log_tree_root; | |
2437 | struct btrfs_super_block *disk_super = fs_info->super_copy; | |
2438 | u64 bytenr = btrfs_super_log_root(disk_super); | |
2439 | ||
2440 | if (fs_devices->rw_devices == 0) { | |
f14d104d | 2441 | btrfs_warn(fs_info, "log replay required on RO media"); |
63443bf5 ES |
2442 | return -EIO; |
2443 | } | |
2444 | ||
74e4d827 | 2445 | log_tree_root = btrfs_alloc_root(fs_info, GFP_KERNEL); |
63443bf5 ES |
2446 | if (!log_tree_root) |
2447 | return -ENOMEM; | |
2448 | ||
da17066c | 2449 | __setup_root(log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID); |
63443bf5 ES |
2450 | |
2451 | log_tree_root->node = read_tree_block(tree_root, bytenr, | |
2452 | fs_info->generation + 1); | |
64c043de | 2453 | if (IS_ERR(log_tree_root->node)) { |
f14d104d | 2454 | btrfs_warn(fs_info, "failed to read log tree"); |
0eeff236 | 2455 | ret = PTR_ERR(log_tree_root->node); |
64c043de | 2456 | kfree(log_tree_root); |
0eeff236 | 2457 | return ret; |
64c043de | 2458 | } else if (!extent_buffer_uptodate(log_tree_root->node)) { |
f14d104d | 2459 | btrfs_err(fs_info, "failed to read log tree"); |
63443bf5 ES |
2460 | free_extent_buffer(log_tree_root->node); |
2461 | kfree(log_tree_root); | |
2462 | return -EIO; | |
2463 | } | |
2464 | /* returns with log_tree_root freed on success */ | |
2465 | ret = btrfs_recover_log_trees(log_tree_root); | |
2466 | if (ret) { | |
34d97007 | 2467 | btrfs_handle_fs_error(tree_root->fs_info, ret, |
63443bf5 ES |
2468 | "Failed to recover log tree"); |
2469 | free_extent_buffer(log_tree_root->node); | |
2470 | kfree(log_tree_root); | |
2471 | return ret; | |
2472 | } | |
2473 | ||
2474 | if (fs_info->sb->s_flags & MS_RDONLY) { | |
6bccf3ab | 2475 | ret = btrfs_commit_super(fs_info); |
63443bf5 ES |
2476 | if (ret) |
2477 | return ret; | |
2478 | } | |
2479 | ||
2480 | return 0; | |
2481 | } | |
2482 | ||
6bccf3ab | 2483 | static int btrfs_read_roots(struct btrfs_fs_info *fs_info) |
4bbcaa64 | 2484 | { |
6bccf3ab | 2485 | struct btrfs_root *tree_root = fs_info->tree_root; |
a4f3d2c4 | 2486 | struct btrfs_root *root; |
4bbcaa64 ES |
2487 | struct btrfs_key location; |
2488 | int ret; | |
2489 | ||
6bccf3ab JM |
2490 | BUG_ON(!fs_info->tree_root); |
2491 | ||
4bbcaa64 ES |
2492 | location.objectid = BTRFS_EXTENT_TREE_OBJECTID; |
2493 | location.type = BTRFS_ROOT_ITEM_KEY; | |
2494 | location.offset = 0; | |
2495 | ||
a4f3d2c4 DS |
2496 | root = btrfs_read_tree_root(tree_root, &location); |
2497 | if (IS_ERR(root)) | |
2498 | return PTR_ERR(root); | |
2499 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); | |
2500 | fs_info->extent_root = root; | |
4bbcaa64 ES |
2501 | |
2502 | location.objectid = BTRFS_DEV_TREE_OBJECTID; | |
a4f3d2c4 DS |
2503 | root = btrfs_read_tree_root(tree_root, &location); |
2504 | if (IS_ERR(root)) | |
2505 | return PTR_ERR(root); | |
2506 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); | |
2507 | fs_info->dev_root = root; | |
4bbcaa64 ES |
2508 | btrfs_init_devices_late(fs_info); |
2509 | ||
2510 | location.objectid = BTRFS_CSUM_TREE_OBJECTID; | |
a4f3d2c4 DS |
2511 | root = btrfs_read_tree_root(tree_root, &location); |
2512 | if (IS_ERR(root)) | |
2513 | return PTR_ERR(root); | |
2514 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); | |
2515 | fs_info->csum_root = root; | |
4bbcaa64 ES |
2516 | |
2517 | location.objectid = BTRFS_QUOTA_TREE_OBJECTID; | |
a4f3d2c4 DS |
2518 | root = btrfs_read_tree_root(tree_root, &location); |
2519 | if (!IS_ERR(root)) { | |
2520 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); | |
afcdd129 | 2521 | set_bit(BTRFS_FS_QUOTA_ENABLED, &fs_info->flags); |
a4f3d2c4 | 2522 | fs_info->quota_root = root; |
4bbcaa64 ES |
2523 | } |
2524 | ||
2525 | location.objectid = BTRFS_UUID_TREE_OBJECTID; | |
a4f3d2c4 DS |
2526 | root = btrfs_read_tree_root(tree_root, &location); |
2527 | if (IS_ERR(root)) { | |
2528 | ret = PTR_ERR(root); | |
4bbcaa64 ES |
2529 | if (ret != -ENOENT) |
2530 | return ret; | |
2531 | } else { | |
a4f3d2c4 DS |
2532 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); |
2533 | fs_info->uuid_root = root; | |
4bbcaa64 ES |
2534 | } |
2535 | ||
70f6d82e OS |
2536 | if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) { |
2537 | location.objectid = BTRFS_FREE_SPACE_TREE_OBJECTID; | |
2538 | root = btrfs_read_tree_root(tree_root, &location); | |
2539 | if (IS_ERR(root)) | |
2540 | return PTR_ERR(root); | |
2541 | set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state); | |
2542 | fs_info->free_space_root = root; | |
2543 | } | |
2544 | ||
4bbcaa64 ES |
2545 | return 0; |
2546 | } | |
2547 | ||
ad2b2c80 AV |
2548 | int open_ctree(struct super_block *sb, |
2549 | struct btrfs_fs_devices *fs_devices, | |
2550 | char *options) | |
2e635a27 | 2551 | { |
db94535d CM |
2552 | u32 sectorsize; |
2553 | u32 nodesize; | |
87ee04eb | 2554 | u32 stripesize; |
84234f3a | 2555 | u64 generation; |
f2b636e8 | 2556 | u64 features; |
3de4586c | 2557 | struct btrfs_key location; |
a061fc8d | 2558 | struct buffer_head *bh; |
4d34b278 | 2559 | struct btrfs_super_block *disk_super; |
815745cf | 2560 | struct btrfs_fs_info *fs_info = btrfs_sb(sb); |
f84a8bd6 | 2561 | struct btrfs_root *tree_root; |
4d34b278 | 2562 | struct btrfs_root *chunk_root; |
eb60ceac | 2563 | int ret; |
e58ca020 | 2564 | int err = -EINVAL; |
af31f5e5 CM |
2565 | int num_backups_tried = 0; |
2566 | int backup_index = 0; | |
5cdc7ad3 | 2567 | int max_active; |
6675df31 | 2568 | int clear_free_space_tree = 0; |
4543df7e | 2569 | |
74e4d827 DS |
2570 | tree_root = fs_info->tree_root = btrfs_alloc_root(fs_info, GFP_KERNEL); |
2571 | chunk_root = fs_info->chunk_root = btrfs_alloc_root(fs_info, GFP_KERNEL); | |
cb517eab | 2572 | if (!tree_root || !chunk_root) { |
39279cc3 CM |
2573 | err = -ENOMEM; |
2574 | goto fail; | |
2575 | } | |
76dda93c YZ |
2576 | |
2577 | ret = init_srcu_struct(&fs_info->subvol_srcu); | |
2578 | if (ret) { | |
2579 | err = ret; | |
2580 | goto fail; | |
2581 | } | |
2582 | ||
2583 | ret = setup_bdi(fs_info, &fs_info->bdi); | |
2584 | if (ret) { | |
2585 | err = ret; | |
2586 | goto fail_srcu; | |
2587 | } | |
2588 | ||
908c7f19 | 2589 | ret = percpu_counter_init(&fs_info->dirty_metadata_bytes, 0, GFP_KERNEL); |
e2d84521 MX |
2590 | if (ret) { |
2591 | err = ret; | |
2592 | goto fail_bdi; | |
2593 | } | |
09cbfeaf | 2594 | fs_info->dirty_metadata_batch = PAGE_SIZE * |
e2d84521 MX |
2595 | (1 + ilog2(nr_cpu_ids)); |
2596 | ||
908c7f19 | 2597 | ret = percpu_counter_init(&fs_info->delalloc_bytes, 0, GFP_KERNEL); |
963d678b MX |
2598 | if (ret) { |
2599 | err = ret; | |
2600 | goto fail_dirty_metadata_bytes; | |
2601 | } | |
2602 | ||
908c7f19 | 2603 | ret = percpu_counter_init(&fs_info->bio_counter, 0, GFP_KERNEL); |
c404e0dc MX |
2604 | if (ret) { |
2605 | err = ret; | |
2606 | goto fail_delalloc_bytes; | |
2607 | } | |
2608 | ||
76dda93c YZ |
2609 | fs_info->btree_inode = new_inode(sb); |
2610 | if (!fs_info->btree_inode) { | |
2611 | err = -ENOMEM; | |
c404e0dc | 2612 | goto fail_bio_counter; |
76dda93c YZ |
2613 | } |
2614 | ||
a6591715 | 2615 | mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS); |
1561deda | 2616 | |
76dda93c | 2617 | INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC); |
f28491e0 | 2618 | INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC); |
8fd17795 | 2619 | INIT_LIST_HEAD(&fs_info->trans_list); |
facda1e7 | 2620 | INIT_LIST_HEAD(&fs_info->dead_roots); |
24bbcf04 | 2621 | INIT_LIST_HEAD(&fs_info->delayed_iputs); |
eb73c1b7 | 2622 | INIT_LIST_HEAD(&fs_info->delalloc_roots); |
11833d66 | 2623 | INIT_LIST_HEAD(&fs_info->caching_block_groups); |
eb73c1b7 | 2624 | spin_lock_init(&fs_info->delalloc_root_lock); |
a4abeea4 | 2625 | spin_lock_init(&fs_info->trans_lock); |
76dda93c | 2626 | spin_lock_init(&fs_info->fs_roots_radix_lock); |
24bbcf04 | 2627 | spin_lock_init(&fs_info->delayed_iput_lock); |
4cb5300b | 2628 | spin_lock_init(&fs_info->defrag_inodes_lock); |
2bf64758 | 2629 | spin_lock_init(&fs_info->free_chunk_lock); |
f29021b2 | 2630 | spin_lock_init(&fs_info->tree_mod_seq_lock); |
ceda0864 | 2631 | spin_lock_init(&fs_info->super_lock); |
fcebe456 | 2632 | spin_lock_init(&fs_info->qgroup_op_lock); |
f28491e0 | 2633 | spin_lock_init(&fs_info->buffer_lock); |
47ab2a6c | 2634 | spin_lock_init(&fs_info->unused_bgs_lock); |
f29021b2 | 2635 | rwlock_init(&fs_info->tree_mod_log_lock); |
d7c15171 | 2636 | mutex_init(&fs_info->unused_bg_unpin_mutex); |
67c5e7d4 | 2637 | mutex_init(&fs_info->delete_unused_bgs_mutex); |
7585717f | 2638 | mutex_init(&fs_info->reloc_mutex); |
573bfb72 | 2639 | mutex_init(&fs_info->delalloc_root_mutex); |
c2d6cb16 | 2640 | mutex_init(&fs_info->cleaner_delayed_iput_mutex); |
de98ced9 | 2641 | seqlock_init(&fs_info->profiles_lock); |
19c00ddc | 2642 | |
0b86a832 | 2643 | INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots); |
6324fbf3 | 2644 | INIT_LIST_HEAD(&fs_info->space_info); |
f29021b2 | 2645 | INIT_LIST_HEAD(&fs_info->tree_mod_seq_list); |
47ab2a6c | 2646 | INIT_LIST_HEAD(&fs_info->unused_bgs); |
0b86a832 | 2647 | btrfs_mapping_init(&fs_info->mapping_tree); |
66d8f3dd MX |
2648 | btrfs_init_block_rsv(&fs_info->global_block_rsv, |
2649 | BTRFS_BLOCK_RSV_GLOBAL); | |
2650 | btrfs_init_block_rsv(&fs_info->delalloc_block_rsv, | |
2651 | BTRFS_BLOCK_RSV_DELALLOC); | |
2652 | btrfs_init_block_rsv(&fs_info->trans_block_rsv, BTRFS_BLOCK_RSV_TRANS); | |
2653 | btrfs_init_block_rsv(&fs_info->chunk_block_rsv, BTRFS_BLOCK_RSV_CHUNK); | |
2654 | btrfs_init_block_rsv(&fs_info->empty_block_rsv, BTRFS_BLOCK_RSV_EMPTY); | |
2655 | btrfs_init_block_rsv(&fs_info->delayed_block_rsv, | |
2656 | BTRFS_BLOCK_RSV_DELOPS); | |
cb03c743 | 2657 | atomic_set(&fs_info->nr_async_submits, 0); |
771ed689 | 2658 | atomic_set(&fs_info->async_delalloc_pages, 0); |
8c8bee1d | 2659 | atomic_set(&fs_info->async_submit_draining, 0); |
0986fe9e | 2660 | atomic_set(&fs_info->nr_async_bios, 0); |
4cb5300b | 2661 | atomic_set(&fs_info->defrag_running, 0); |
fcebe456 | 2662 | atomic_set(&fs_info->qgroup_op_seq, 0); |
2fefd558 | 2663 | atomic_set(&fs_info->reada_works_cnt, 0); |
fc36ed7e | 2664 | atomic64_set(&fs_info->tree_mod_seq, 0); |
9e7cc91a | 2665 | fs_info->fs_frozen = 0; |
e20d96d6 | 2666 | fs_info->sb = sb; |
95ac567a | 2667 | fs_info->max_inline = BTRFS_DEFAULT_MAX_INLINE; |
9ed74f2d | 2668 | fs_info->metadata_ratio = 0; |
4cb5300b | 2669 | fs_info->defrag_inodes = RB_ROOT; |
2bf64758 | 2670 | fs_info->free_chunk_space = 0; |
f29021b2 | 2671 | fs_info->tree_mod_log = RB_ROOT; |
8b87dc17 | 2672 | fs_info->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL; |
f8c269d7 | 2673 | fs_info->avg_delayed_ref_runtime = NSEC_PER_SEC >> 6; /* div by 64 */ |
90519d66 | 2674 | /* readahead state */ |
d0164adc | 2675 | INIT_RADIX_TREE(&fs_info->reada_tree, GFP_NOFS & ~__GFP_DIRECT_RECLAIM); |
90519d66 | 2676 | spin_lock_init(&fs_info->reada_lock); |
c8b97818 | 2677 | |
b34b086c CM |
2678 | fs_info->thread_pool_size = min_t(unsigned long, |
2679 | num_online_cpus() + 2, 8); | |
0afbaf8c | 2680 | |
199c2a9c MX |
2681 | INIT_LIST_HEAD(&fs_info->ordered_roots); |
2682 | spin_lock_init(&fs_info->ordered_root_lock); | |
16cdcec7 | 2683 | fs_info->delayed_root = kmalloc(sizeof(struct btrfs_delayed_root), |
74e4d827 | 2684 | GFP_KERNEL); |
16cdcec7 MX |
2685 | if (!fs_info->delayed_root) { |
2686 | err = -ENOMEM; | |
2687 | goto fail_iput; | |
2688 | } | |
2689 | btrfs_init_delayed_root(fs_info->delayed_root); | |
3eaa2885 | 2690 | |
638aa7ed | 2691 | btrfs_init_scrub(fs_info); |
21adbd5c SB |
2692 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY |
2693 | fs_info->check_integrity_print_mask = 0; | |
2694 | #endif | |
779a65a4 | 2695 | btrfs_init_balance(fs_info); |
21c7e756 | 2696 | btrfs_init_async_reclaim_work(&fs_info->async_reclaim_work); |
a2de733c | 2697 | |
a061fc8d CM |
2698 | sb->s_blocksize = 4096; |
2699 | sb->s_blocksize_bits = blksize_bits(4096); | |
32a88aa1 | 2700 | sb->s_bdi = &fs_info->bdi; |
a061fc8d | 2701 | |
6bccf3ab | 2702 | btrfs_init_btree_inode(fs_info); |
76dda93c | 2703 | |
0f9dd46c | 2704 | spin_lock_init(&fs_info->block_group_cache_lock); |
6bef4d31 | 2705 | fs_info->block_group_cache_tree = RB_ROOT; |
a1897fdd | 2706 | fs_info->first_logical_byte = (u64)-1; |
0f9dd46c | 2707 | |
11833d66 | 2708 | extent_io_tree_init(&fs_info->freed_extents[0], |
f993c883 | 2709 | fs_info->btree_inode->i_mapping); |
11833d66 | 2710 | extent_io_tree_init(&fs_info->freed_extents[1], |
f993c883 | 2711 | fs_info->btree_inode->i_mapping); |
11833d66 | 2712 | fs_info->pinned_extents = &fs_info->freed_extents[0]; |
afcdd129 | 2713 | set_bit(BTRFS_FS_BARRIER, &fs_info->flags); |
39279cc3 | 2714 | |
5a3f23d5 | 2715 | mutex_init(&fs_info->ordered_operations_mutex); |
e02119d5 | 2716 | mutex_init(&fs_info->tree_log_mutex); |
925baedd | 2717 | mutex_init(&fs_info->chunk_mutex); |
a74a4b97 CM |
2718 | mutex_init(&fs_info->transaction_kthread_mutex); |
2719 | mutex_init(&fs_info->cleaner_mutex); | |
7d9eb12c | 2720 | mutex_init(&fs_info->volume_mutex); |
1bbc621e | 2721 | mutex_init(&fs_info->ro_block_group_mutex); |
9e351cc8 | 2722 | init_rwsem(&fs_info->commit_root_sem); |
c71bf099 | 2723 | init_rwsem(&fs_info->cleanup_work_sem); |
76dda93c | 2724 | init_rwsem(&fs_info->subvol_sem); |
803b2f54 | 2725 | sema_init(&fs_info->uuid_tree_rescan_sem, 1); |
fa9c0d79 | 2726 | |
ad618368 | 2727 | btrfs_init_dev_replace_locks(fs_info); |
f9e92e40 | 2728 | btrfs_init_qgroup(fs_info); |
416ac51d | 2729 | |
fa9c0d79 CM |
2730 | btrfs_init_free_cluster(&fs_info->meta_alloc_cluster); |
2731 | btrfs_init_free_cluster(&fs_info->data_alloc_cluster); | |
2732 | ||
e6dcd2dc | 2733 | init_waitqueue_head(&fs_info->transaction_throttle); |
f9295749 | 2734 | init_waitqueue_head(&fs_info->transaction_wait); |
bb9c12c9 | 2735 | init_waitqueue_head(&fs_info->transaction_blocked_wait); |
4854ddd0 | 2736 | init_waitqueue_head(&fs_info->async_submit_wait); |
3768f368 | 2737 | |
04216820 FM |
2738 | INIT_LIST_HEAD(&fs_info->pinned_chunks); |
2739 | ||
da17066c JM |
2740 | /* Usable values until the real ones are cached from the superblock */ |
2741 | fs_info->nodesize = 4096; | |
2742 | fs_info->sectorsize = 4096; | |
2743 | fs_info->stripesize = 4096; | |
2744 | ||
53b381b3 DW |
2745 | ret = btrfs_alloc_stripe_hash_table(fs_info); |
2746 | if (ret) { | |
83c8266a | 2747 | err = ret; |
53b381b3 DW |
2748 | goto fail_alloc; |
2749 | } | |
2750 | ||
da17066c | 2751 | __setup_root(tree_root, fs_info, BTRFS_ROOT_TREE_OBJECTID); |
7eccb903 | 2752 | |
3c4bb26b | 2753 | invalidate_bdev(fs_devices->latest_bdev); |
1104a885 DS |
2754 | |
2755 | /* | |
2756 | * Read super block and check the signature bytes only | |
2757 | */ | |
a512bbf8 | 2758 | bh = btrfs_read_dev_super(fs_devices->latest_bdev); |
92fc03fb AJ |
2759 | if (IS_ERR(bh)) { |
2760 | err = PTR_ERR(bh); | |
16cdcec7 | 2761 | goto fail_alloc; |
20b45077 | 2762 | } |
39279cc3 | 2763 | |
1104a885 DS |
2764 | /* |
2765 | * We want to check superblock checksum, the type is stored inside. | |
2766 | * Pass the whole disk block of size BTRFS_SUPER_INFO_SIZE (4k). | |
2767 | */ | |
ab8d0fc4 | 2768 | if (btrfs_check_super_csum(fs_info, bh->b_data)) { |
05135f59 | 2769 | btrfs_err(fs_info, "superblock checksum mismatch"); |
1104a885 | 2770 | err = -EINVAL; |
b2acdddf | 2771 | brelse(bh); |
1104a885 DS |
2772 | goto fail_alloc; |
2773 | } | |
2774 | ||
2775 | /* | |
2776 | * super_copy is zeroed at allocation time and we never touch the | |
2777 | * following bytes up to INFO_SIZE, the checksum is calculated from | |
2778 | * the whole block of INFO_SIZE | |
2779 | */ | |
6c41761f DS |
2780 | memcpy(fs_info->super_copy, bh->b_data, sizeof(*fs_info->super_copy)); |
2781 | memcpy(fs_info->super_for_commit, fs_info->super_copy, | |
2782 | sizeof(*fs_info->super_for_commit)); | |
a061fc8d | 2783 | brelse(bh); |
5f39d397 | 2784 | |
6c41761f | 2785 | memcpy(fs_info->fsid, fs_info->super_copy->fsid, BTRFS_FSID_SIZE); |
0b86a832 | 2786 | |
1104a885 DS |
2787 | ret = btrfs_check_super_valid(fs_info, sb->s_flags & MS_RDONLY); |
2788 | if (ret) { | |
05135f59 | 2789 | btrfs_err(fs_info, "superblock contains fatal errors"); |
1104a885 DS |
2790 | err = -EINVAL; |
2791 | goto fail_alloc; | |
2792 | } | |
2793 | ||
6c41761f | 2794 | disk_super = fs_info->super_copy; |
0f7d52f4 | 2795 | if (!btrfs_super_root(disk_super)) |
16cdcec7 | 2796 | goto fail_alloc; |
0f7d52f4 | 2797 | |
acce952b | 2798 | /* check FS state, whether FS is broken. */ |
87533c47 MX |
2799 | if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_ERROR) |
2800 | set_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state); | |
acce952b | 2801 | |
af31f5e5 CM |
2802 | /* |
2803 | * run through our array of backup supers and setup | |
2804 | * our ring pointer to the oldest one | |
2805 | */ | |
2806 | generation = btrfs_super_generation(disk_super); | |
2807 | find_oldest_super_backup(fs_info, generation); | |
2808 | ||
75e7cb7f LB |
2809 | /* |
2810 | * In the long term, we'll store the compression type in the super | |
2811 | * block, and it'll be used for per file compression control. | |
2812 | */ | |
2813 | fs_info->compress_type = BTRFS_COMPRESS_ZLIB; | |
2814 | ||
96da0919 | 2815 | ret = btrfs_parse_options(tree_root, options, sb->s_flags); |
2b82032c YZ |
2816 | if (ret) { |
2817 | err = ret; | |
16cdcec7 | 2818 | goto fail_alloc; |
2b82032c | 2819 | } |
dfe25020 | 2820 | |
f2b636e8 JB |
2821 | features = btrfs_super_incompat_flags(disk_super) & |
2822 | ~BTRFS_FEATURE_INCOMPAT_SUPP; | |
2823 | if (features) { | |
05135f59 DS |
2824 | btrfs_err(fs_info, |
2825 | "cannot mount because of unsupported optional features (%llx)", | |
2826 | features); | |
f2b636e8 | 2827 | err = -EINVAL; |
16cdcec7 | 2828 | goto fail_alloc; |
f2b636e8 JB |
2829 | } |
2830 | ||
5d4f98a2 | 2831 | features = btrfs_super_incompat_flags(disk_super); |
a6fa6fae | 2832 | features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF; |
69e380d1 | 2833 | if (tree_root->fs_info->compress_type == BTRFS_COMPRESS_LZO) |
a6fa6fae | 2834 | features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO; |
727011e0 | 2835 | |
3173a18f | 2836 | if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA) |
05135f59 | 2837 | btrfs_info(fs_info, "has skinny extents"); |
3173a18f | 2838 | |
727011e0 CM |
2839 | /* |
2840 | * flag our filesystem as having big metadata blocks if | |
2841 | * they are bigger than the page size | |
2842 | */ | |
09cbfeaf | 2843 | if (btrfs_super_nodesize(disk_super) > PAGE_SIZE) { |
727011e0 | 2844 | if (!(features & BTRFS_FEATURE_INCOMPAT_BIG_METADATA)) |
05135f59 DS |
2845 | btrfs_info(fs_info, |
2846 | "flagging fs with big metadata feature"); | |
727011e0 CM |
2847 | features |= BTRFS_FEATURE_INCOMPAT_BIG_METADATA; |
2848 | } | |
2849 | ||
bc3f116f | 2850 | nodesize = btrfs_super_nodesize(disk_super); |
bc3f116f | 2851 | sectorsize = btrfs_super_sectorsize(disk_super); |
b7f67055 | 2852 | stripesize = sectorsize; |
707e8a07 | 2853 | fs_info->dirty_metadata_batch = nodesize * (1 + ilog2(nr_cpu_ids)); |
963d678b | 2854 | fs_info->delalloc_batch = sectorsize * 512 * (1 + ilog2(nr_cpu_ids)); |
bc3f116f | 2855 | |
da17066c JM |
2856 | /* Cache block sizes */ |
2857 | fs_info->nodesize = nodesize; | |
2858 | fs_info->sectorsize = sectorsize; | |
2859 | fs_info->stripesize = stripesize; | |
2860 | ||
bc3f116f CM |
2861 | /* |
2862 | * mixed block groups end up with duplicate but slightly offset | |
2863 | * extent buffers for the same range. It leads to corruptions | |
2864 | */ | |
2865 | if ((features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) && | |
707e8a07 | 2866 | (sectorsize != nodesize)) { |
05135f59 DS |
2867 | btrfs_err(fs_info, |
2868 | "unequal nodesize/sectorsize (%u != %u) are not allowed for mixed block groups", | |
2869 | nodesize, sectorsize); | |
bc3f116f CM |
2870 | goto fail_alloc; |
2871 | } | |
2872 | ||
ceda0864 MX |
2873 | /* |
2874 | * Needn't use the lock because there is no other task which will | |
2875 | * update the flag. | |
2876 | */ | |
a6fa6fae | 2877 | btrfs_set_super_incompat_flags(disk_super, features); |
5d4f98a2 | 2878 | |
f2b636e8 JB |
2879 | features = btrfs_super_compat_ro_flags(disk_super) & |
2880 | ~BTRFS_FEATURE_COMPAT_RO_SUPP; | |
2881 | if (!(sb->s_flags & MS_RDONLY) && features) { | |
05135f59 DS |
2882 | btrfs_err(fs_info, |
2883 | "cannot mount read-write because of unsupported optional features (%llx)", | |
c1c9ff7c | 2884 | features); |
f2b636e8 | 2885 | err = -EINVAL; |
16cdcec7 | 2886 | goto fail_alloc; |
f2b636e8 | 2887 | } |
61d92c32 | 2888 | |
5cdc7ad3 | 2889 | max_active = fs_info->thread_pool_size; |
61d92c32 | 2890 | |
2a458198 ES |
2891 | ret = btrfs_init_workqueues(fs_info, fs_devices); |
2892 | if (ret) { | |
2893 | err = ret; | |
0dc3b84a JB |
2894 | goto fail_sb_buffer; |
2895 | } | |
4543df7e | 2896 | |
4575c9cc | 2897 | fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super); |
c8b97818 | 2898 | fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages, |
09cbfeaf | 2899 | SZ_4M / PAGE_SIZE); |
4575c9cc | 2900 | |
a061fc8d CM |
2901 | sb->s_blocksize = sectorsize; |
2902 | sb->s_blocksize_bits = blksize_bits(sectorsize); | |
db94535d | 2903 | |
925baedd | 2904 | mutex_lock(&fs_info->chunk_mutex); |
6bccf3ab | 2905 | ret = btrfs_read_sys_array(fs_info); |
925baedd | 2906 | mutex_unlock(&fs_info->chunk_mutex); |
84eed90f | 2907 | if (ret) { |
05135f59 | 2908 | btrfs_err(fs_info, "failed to read the system array: %d", ret); |
5d4f98a2 | 2909 | goto fail_sb_buffer; |
84eed90f | 2910 | } |
0b86a832 | 2911 | |
84234f3a | 2912 | generation = btrfs_super_chunk_root_generation(disk_super); |
0b86a832 | 2913 | |
da17066c | 2914 | __setup_root(chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID); |
0b86a832 CM |
2915 | |
2916 | chunk_root->node = read_tree_block(chunk_root, | |
2917 | btrfs_super_chunk_root(disk_super), | |
ce86cd59 | 2918 | generation); |
64c043de LB |
2919 | if (IS_ERR(chunk_root->node) || |
2920 | !extent_buffer_uptodate(chunk_root->node)) { | |
05135f59 | 2921 | btrfs_err(fs_info, "failed to read chunk root"); |
e5fffbac | 2922 | if (!IS_ERR(chunk_root->node)) |
2923 | free_extent_buffer(chunk_root->node); | |
95ab1f64 | 2924 | chunk_root->node = NULL; |
af31f5e5 | 2925 | goto fail_tree_roots; |
83121942 | 2926 | } |
5d4f98a2 YZ |
2927 | btrfs_set_root_node(&chunk_root->root_item, chunk_root->node); |
2928 | chunk_root->commit_root = btrfs_root_node(chunk_root); | |
0b86a832 | 2929 | |
e17cade2 | 2930 | read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid, |
b308bc2f | 2931 | btrfs_header_chunk_tree_uuid(chunk_root->node), BTRFS_UUID_SIZE); |
e17cade2 | 2932 | |
5b4aacef | 2933 | ret = btrfs_read_chunk_tree(fs_info); |
2b82032c | 2934 | if (ret) { |
05135f59 | 2935 | btrfs_err(fs_info, "failed to read chunk tree: %d", ret); |
af31f5e5 | 2936 | goto fail_tree_roots; |
2b82032c | 2937 | } |
0b86a832 | 2938 | |
8dabb742 SB |
2939 | /* |
2940 | * keep the device that is marked to be the target device for the | |
2941 | * dev_replace procedure | |
2942 | */ | |
9eaed21e | 2943 | btrfs_close_extra_devices(fs_devices, 0); |
dfe25020 | 2944 | |
a6b0d5c8 | 2945 | if (!fs_devices->latest_bdev) { |
05135f59 | 2946 | btrfs_err(fs_info, "failed to read devices"); |
a6b0d5c8 CM |
2947 | goto fail_tree_roots; |
2948 | } | |
2949 | ||
af31f5e5 | 2950 | retry_root_backup: |
84234f3a | 2951 | generation = btrfs_super_generation(disk_super); |
0b86a832 | 2952 | |
e20d96d6 | 2953 | tree_root->node = read_tree_block(tree_root, |
db94535d | 2954 | btrfs_super_root(disk_super), |
ce86cd59 | 2955 | generation); |
64c043de LB |
2956 | if (IS_ERR(tree_root->node) || |
2957 | !extent_buffer_uptodate(tree_root->node)) { | |
05135f59 | 2958 | btrfs_warn(fs_info, "failed to read tree root"); |
e5fffbac | 2959 | if (!IS_ERR(tree_root->node)) |
2960 | free_extent_buffer(tree_root->node); | |
95ab1f64 | 2961 | tree_root->node = NULL; |
af31f5e5 | 2962 | goto recovery_tree_root; |
83121942 | 2963 | } |
af31f5e5 | 2964 | |
5d4f98a2 YZ |
2965 | btrfs_set_root_node(&tree_root->root_item, tree_root->node); |
2966 | tree_root->commit_root = btrfs_root_node(tree_root); | |
69e9c6c6 | 2967 | btrfs_set_root_refs(&tree_root->root_item, 1); |
db94535d | 2968 | |
f32e48e9 CR |
2969 | mutex_lock(&tree_root->objectid_mutex); |
2970 | ret = btrfs_find_highest_objectid(tree_root, | |
2971 | &tree_root->highest_objectid); | |
2972 | if (ret) { | |
2973 | mutex_unlock(&tree_root->objectid_mutex); | |
2974 | goto recovery_tree_root; | |
2975 | } | |
2976 | ||
2977 | ASSERT(tree_root->highest_objectid <= BTRFS_LAST_FREE_OBJECTID); | |
2978 | ||
2979 | mutex_unlock(&tree_root->objectid_mutex); | |
2980 | ||
6bccf3ab | 2981 | ret = btrfs_read_roots(fs_info); |
4bbcaa64 | 2982 | if (ret) |
af31f5e5 | 2983 | goto recovery_tree_root; |
f7a81ea4 | 2984 | |
8929ecfa YZ |
2985 | fs_info->generation = generation; |
2986 | fs_info->last_trans_committed = generation; | |
8929ecfa | 2987 | |
68310a5e ID |
2988 | ret = btrfs_recover_balance(fs_info); |
2989 | if (ret) { | |
05135f59 | 2990 | btrfs_err(fs_info, "failed to recover balance: %d", ret); |
68310a5e ID |
2991 | goto fail_block_groups; |
2992 | } | |
2993 | ||
733f4fbb SB |
2994 | ret = btrfs_init_dev_stats(fs_info); |
2995 | if (ret) { | |
05135f59 | 2996 | btrfs_err(fs_info, "failed to init dev_stats: %d", ret); |
733f4fbb SB |
2997 | goto fail_block_groups; |
2998 | } | |
2999 | ||
8dabb742 SB |
3000 | ret = btrfs_init_dev_replace(fs_info); |
3001 | if (ret) { | |
05135f59 | 3002 | btrfs_err(fs_info, "failed to init dev_replace: %d", ret); |
8dabb742 SB |
3003 | goto fail_block_groups; |
3004 | } | |
3005 | ||
9eaed21e | 3006 | btrfs_close_extra_devices(fs_devices, 1); |
8dabb742 | 3007 | |
b7c35e81 AJ |
3008 | ret = btrfs_sysfs_add_fsid(fs_devices, NULL); |
3009 | if (ret) { | |
05135f59 DS |
3010 | btrfs_err(fs_info, "failed to init sysfs fsid interface: %d", |
3011 | ret); | |
b7c35e81 AJ |
3012 | goto fail_block_groups; |
3013 | } | |
3014 | ||
3015 | ret = btrfs_sysfs_add_device(fs_devices); | |
3016 | if (ret) { | |
05135f59 DS |
3017 | btrfs_err(fs_info, "failed to init sysfs device interface: %d", |
3018 | ret); | |
b7c35e81 AJ |
3019 | goto fail_fsdev_sysfs; |
3020 | } | |
3021 | ||
96f3136e | 3022 | ret = btrfs_sysfs_add_mounted(fs_info); |
c59021f8 | 3023 | if (ret) { |
05135f59 | 3024 | btrfs_err(fs_info, "failed to init sysfs interface: %d", ret); |
b7c35e81 | 3025 | goto fail_fsdev_sysfs; |
c59021f8 | 3026 | } |
3027 | ||
c59021f8 | 3028 | ret = btrfs_init_space_info(fs_info); |
3029 | if (ret) { | |
05135f59 | 3030 | btrfs_err(fs_info, "failed to initialize space info: %d", ret); |
2365dd3c | 3031 | goto fail_sysfs; |
c59021f8 | 3032 | } |
3033 | ||
5b4aacef | 3034 | ret = btrfs_read_block_groups(fs_info); |
1b1d1f66 | 3035 | if (ret) { |
05135f59 | 3036 | btrfs_err(fs_info, "failed to read block groups: %d", ret); |
2365dd3c | 3037 | goto fail_sysfs; |
1b1d1f66 | 3038 | } |
5af3e8cc SB |
3039 | fs_info->num_tolerated_disk_barrier_failures = |
3040 | btrfs_calc_num_tolerated_disk_barrier_failures(fs_info); | |
292fd7fc SB |
3041 | if (fs_info->fs_devices->missing_devices > |
3042 | fs_info->num_tolerated_disk_barrier_failures && | |
3043 | !(sb->s_flags & MS_RDONLY)) { | |
05135f59 DS |
3044 | btrfs_warn(fs_info, |
3045 | "missing devices (%llu) exceeds the limit (%d), writeable mount is not allowed", | |
78fa1770 ZL |
3046 | fs_info->fs_devices->missing_devices, |
3047 | fs_info->num_tolerated_disk_barrier_failures); | |
2365dd3c | 3048 | goto fail_sysfs; |
292fd7fc | 3049 | } |
9078a3e1 | 3050 | |
a74a4b97 CM |
3051 | fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root, |
3052 | "btrfs-cleaner"); | |
57506d50 | 3053 | if (IS_ERR(fs_info->cleaner_kthread)) |
2365dd3c | 3054 | goto fail_sysfs; |
a74a4b97 CM |
3055 | |
3056 | fs_info->transaction_kthread = kthread_run(transaction_kthread, | |
3057 | tree_root, | |
3058 | "btrfs-transaction"); | |
57506d50 | 3059 | if (IS_ERR(fs_info->transaction_kthread)) |
3f157a2f | 3060 | goto fail_cleaner; |
a74a4b97 | 3061 | |
3cdde224 JM |
3062 | if (!btrfs_test_opt(tree_root->fs_info, SSD) && |
3063 | !btrfs_test_opt(tree_root->fs_info, NOSSD) && | |
c289811c | 3064 | !fs_info->fs_devices->rotating) { |
05135f59 | 3065 | btrfs_info(fs_info, "detected SSD devices, enabling SSD mode"); |
c289811c CM |
3066 | btrfs_set_opt(fs_info->mount_opt, SSD); |
3067 | } | |
3068 | ||
572d9ab7 | 3069 | /* |
01327610 | 3070 | * Mount does not set all options immediately, we can do it now and do |
572d9ab7 DS |
3071 | * not have to wait for transaction commit |
3072 | */ | |
3073 | btrfs_apply_pending_changes(fs_info); | |
3818aea2 | 3074 | |
21adbd5c | 3075 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY |
3cdde224 | 3076 | if (btrfs_test_opt(tree_root->fs_info, CHECK_INTEGRITY)) { |
21adbd5c | 3077 | ret = btrfsic_mount(tree_root, fs_devices, |
3cdde224 | 3078 | btrfs_test_opt(tree_root->fs_info, |
21adbd5c SB |
3079 | CHECK_INTEGRITY_INCLUDING_EXTENT_DATA) ? |
3080 | 1 : 0, | |
3081 | fs_info->check_integrity_print_mask); | |
3082 | if (ret) | |
05135f59 DS |
3083 | btrfs_warn(fs_info, |
3084 | "failed to initialize integrity check module: %d", | |
3085 | ret); | |
21adbd5c SB |
3086 | } |
3087 | #endif | |
bcef60f2 AJ |
3088 | ret = btrfs_read_qgroup_config(fs_info); |
3089 | if (ret) | |
3090 | goto fail_trans_kthread; | |
21adbd5c | 3091 | |
96da0919 QW |
3092 | /* do not make disk changes in broken FS or nologreplay is given */ |
3093 | if (btrfs_super_log_root(disk_super) != 0 && | |
3cdde224 | 3094 | !btrfs_test_opt(tree_root->fs_info, NOLOGREPLAY)) { |
63443bf5 | 3095 | ret = btrfs_replay_log(fs_info, fs_devices); |
79787eaa | 3096 | if (ret) { |
63443bf5 | 3097 | err = ret; |
28c16cbb | 3098 | goto fail_qgroup; |
79787eaa | 3099 | } |
e02119d5 | 3100 | } |
1a40e23b | 3101 | |
6bccf3ab | 3102 | ret = btrfs_find_orphan_roots(fs_info); |
79787eaa | 3103 | if (ret) |
28c16cbb | 3104 | goto fail_qgroup; |
76dda93c | 3105 | |
7c2ca468 | 3106 | if (!(sb->s_flags & MS_RDONLY)) { |
d68fc57b | 3107 | ret = btrfs_cleanup_fs_roots(fs_info); |
44c44af2 | 3108 | if (ret) |
28c16cbb | 3109 | goto fail_qgroup; |
90c711ab ZB |
3110 | |
3111 | mutex_lock(&fs_info->cleaner_mutex); | |
5d4f98a2 | 3112 | ret = btrfs_recover_relocation(tree_root); |
90c711ab | 3113 | mutex_unlock(&fs_info->cleaner_mutex); |
d7ce5843 | 3114 | if (ret < 0) { |
05135f59 DS |
3115 | btrfs_warn(fs_info, "failed to recover relocation: %d", |
3116 | ret); | |
d7ce5843 | 3117 | err = -EINVAL; |
bcef60f2 | 3118 | goto fail_qgroup; |
d7ce5843 | 3119 | } |
7c2ca468 | 3120 | } |
1a40e23b | 3121 | |
3de4586c CM |
3122 | location.objectid = BTRFS_FS_TREE_OBJECTID; |
3123 | location.type = BTRFS_ROOT_ITEM_KEY; | |
cb517eab | 3124 | location.offset = 0; |
3de4586c | 3125 | |
3de4586c | 3126 | fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location); |
3140c9a3 DC |
3127 | if (IS_ERR(fs_info->fs_root)) { |
3128 | err = PTR_ERR(fs_info->fs_root); | |
bcef60f2 | 3129 | goto fail_qgroup; |
3140c9a3 | 3130 | } |
c289811c | 3131 | |
2b6ba629 ID |
3132 | if (sb->s_flags & MS_RDONLY) |
3133 | return 0; | |
59641015 | 3134 | |
f8d468a1 OS |
3135 | if (btrfs_test_opt(fs_info, CLEAR_CACHE) && |
3136 | btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) { | |
6675df31 OS |
3137 | clear_free_space_tree = 1; |
3138 | } else if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE) && | |
3139 | !btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID)) { | |
3140 | btrfs_warn(fs_info, "free space tree is invalid"); | |
3141 | clear_free_space_tree = 1; | |
3142 | } | |
3143 | ||
3144 | if (clear_free_space_tree) { | |
f8d468a1 OS |
3145 | btrfs_info(fs_info, "clearing free space tree"); |
3146 | ret = btrfs_clear_free_space_tree(fs_info); | |
3147 | if (ret) { | |
3148 | btrfs_warn(fs_info, | |
3149 | "failed to clear free space tree: %d", ret); | |
6bccf3ab | 3150 | close_ctree(fs_info); |
f8d468a1 OS |
3151 | return ret; |
3152 | } | |
3153 | } | |
3154 | ||
3cdde224 | 3155 | if (btrfs_test_opt(tree_root->fs_info, FREE_SPACE_TREE) && |
511711af | 3156 | !btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) { |
05135f59 | 3157 | btrfs_info(fs_info, "creating free space tree"); |
511711af CM |
3158 | ret = btrfs_create_free_space_tree(fs_info); |
3159 | if (ret) { | |
05135f59 DS |
3160 | btrfs_warn(fs_info, |
3161 | "failed to create free space tree: %d", ret); | |
6bccf3ab | 3162 | close_ctree(fs_info); |
511711af CM |
3163 | return ret; |
3164 | } | |
3165 | } | |
3166 | ||
2b6ba629 ID |
3167 | down_read(&fs_info->cleanup_work_sem); |
3168 | if ((ret = btrfs_orphan_cleanup(fs_info->fs_root)) || | |
3169 | (ret = btrfs_orphan_cleanup(fs_info->tree_root))) { | |
e3acc2a6 | 3170 | up_read(&fs_info->cleanup_work_sem); |
6bccf3ab | 3171 | close_ctree(fs_info); |
2b6ba629 ID |
3172 | return ret; |
3173 | } | |
3174 | up_read(&fs_info->cleanup_work_sem); | |
59641015 | 3175 | |
2b6ba629 ID |
3176 | ret = btrfs_resume_balance_async(fs_info); |
3177 | if (ret) { | |
05135f59 | 3178 | btrfs_warn(fs_info, "failed to resume balance: %d", ret); |
6bccf3ab | 3179 | close_ctree(fs_info); |
2b6ba629 | 3180 | return ret; |
e3acc2a6 JB |
3181 | } |
3182 | ||
8dabb742 SB |
3183 | ret = btrfs_resume_dev_replace_async(fs_info); |
3184 | if (ret) { | |
05135f59 | 3185 | btrfs_warn(fs_info, "failed to resume device replace: %d", ret); |
6bccf3ab | 3186 | close_ctree(fs_info); |
8dabb742 SB |
3187 | return ret; |
3188 | } | |
3189 | ||
b382a324 JS |
3190 | btrfs_qgroup_rescan_resume(fs_info); |
3191 | ||
4bbcaa64 | 3192 | if (!fs_info->uuid_root) { |
05135f59 | 3193 | btrfs_info(fs_info, "creating UUID tree"); |
f7a81ea4 SB |
3194 | ret = btrfs_create_uuid_tree(fs_info); |
3195 | if (ret) { | |
05135f59 DS |
3196 | btrfs_warn(fs_info, |
3197 | "failed to create the UUID tree: %d", ret); | |
6bccf3ab | 3198 | close_ctree(fs_info); |
f7a81ea4 SB |
3199 | return ret; |
3200 | } | |
3cdde224 | 3201 | } else if (btrfs_test_opt(tree_root->fs_info, RESCAN_UUID_TREE) || |
4bbcaa64 ES |
3202 | fs_info->generation != |
3203 | btrfs_super_uuid_tree_generation(disk_super)) { | |
05135f59 | 3204 | btrfs_info(fs_info, "checking UUID tree"); |
70f80175 SB |
3205 | ret = btrfs_check_uuid_tree(fs_info); |
3206 | if (ret) { | |
05135f59 DS |
3207 | btrfs_warn(fs_info, |
3208 | "failed to check the UUID tree: %d", ret); | |
6bccf3ab | 3209 | close_ctree(fs_info); |
70f80175 SB |
3210 | return ret; |
3211 | } | |
3212 | } else { | |
afcdd129 | 3213 | set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags); |
f7a81ea4 | 3214 | } |
afcdd129 | 3215 | set_bit(BTRFS_FS_OPEN, &fs_info->flags); |
47ab2a6c | 3216 | |
8dcddfa0 QW |
3217 | /* |
3218 | * backuproot only affect mount behavior, and if open_ctree succeeded, | |
3219 | * no need to keep the flag | |
3220 | */ | |
3221 | btrfs_clear_opt(fs_info->mount_opt, USEBACKUPROOT); | |
3222 | ||
ad2b2c80 | 3223 | return 0; |
39279cc3 | 3224 | |
bcef60f2 AJ |
3225 | fail_qgroup: |
3226 | btrfs_free_qgroup_config(fs_info); | |
7c2ca468 CM |
3227 | fail_trans_kthread: |
3228 | kthread_stop(fs_info->transaction_kthread); | |
54067ae9 | 3229 | btrfs_cleanup_transaction(fs_info->tree_root); |
faa2dbf0 | 3230 | btrfs_free_fs_roots(fs_info); |
3f157a2f | 3231 | fail_cleaner: |
a74a4b97 | 3232 | kthread_stop(fs_info->cleaner_kthread); |
7c2ca468 CM |
3233 | |
3234 | /* | |
3235 | * make sure we're done with the btree inode before we stop our | |
3236 | * kthreads | |
3237 | */ | |
3238 | filemap_write_and_wait(fs_info->btree_inode->i_mapping); | |
7c2ca468 | 3239 | |
2365dd3c | 3240 | fail_sysfs: |
6618a59b | 3241 | btrfs_sysfs_remove_mounted(fs_info); |
2365dd3c | 3242 | |
b7c35e81 AJ |
3243 | fail_fsdev_sysfs: |
3244 | btrfs_sysfs_remove_fsid(fs_info->fs_devices); | |
3245 | ||
1b1d1f66 | 3246 | fail_block_groups: |
54067ae9 | 3247 | btrfs_put_block_group_cache(fs_info); |
1b1d1f66 | 3248 | btrfs_free_block_groups(fs_info); |
af31f5e5 CM |
3249 | |
3250 | fail_tree_roots: | |
3251 | free_root_pointers(fs_info, 1); | |
2b8195bb | 3252 | invalidate_inode_pages2(fs_info->btree_inode->i_mapping); |
af31f5e5 | 3253 | |
39279cc3 | 3254 | fail_sb_buffer: |
7abadb64 | 3255 | btrfs_stop_all_workers(fs_info); |
16cdcec7 | 3256 | fail_alloc: |
4543df7e | 3257 | fail_iput: |
586e46e2 ID |
3258 | btrfs_mapping_tree_free(&fs_info->mapping_tree); |
3259 | ||
4543df7e | 3260 | iput(fs_info->btree_inode); |
c404e0dc MX |
3261 | fail_bio_counter: |
3262 | percpu_counter_destroy(&fs_info->bio_counter); | |
963d678b MX |
3263 | fail_delalloc_bytes: |
3264 | percpu_counter_destroy(&fs_info->delalloc_bytes); | |
e2d84521 MX |
3265 | fail_dirty_metadata_bytes: |
3266 | percpu_counter_destroy(&fs_info->dirty_metadata_bytes); | |
ad081f14 | 3267 | fail_bdi: |
7e662854 | 3268 | bdi_destroy(&fs_info->bdi); |
76dda93c YZ |
3269 | fail_srcu: |
3270 | cleanup_srcu_struct(&fs_info->subvol_srcu); | |
7e662854 | 3271 | fail: |
53b381b3 | 3272 | btrfs_free_stripe_hash_table(fs_info); |
586e46e2 | 3273 | btrfs_close_devices(fs_info->fs_devices); |
ad2b2c80 | 3274 | return err; |
af31f5e5 CM |
3275 | |
3276 | recovery_tree_root: | |
3cdde224 | 3277 | if (!btrfs_test_opt(tree_root->fs_info, USEBACKUPROOT)) |
af31f5e5 CM |
3278 | goto fail_tree_roots; |
3279 | ||
3280 | free_root_pointers(fs_info, 0); | |
3281 | ||
3282 | /* don't use the log in recovery mode, it won't be valid */ | |
3283 | btrfs_set_super_log_root(disk_super, 0); | |
3284 | ||
3285 | /* we can't trust the free space cache either */ | |
3286 | btrfs_set_opt(fs_info->mount_opt, CLEAR_CACHE); | |
3287 | ||
3288 | ret = next_root_backup(fs_info, fs_info->super_copy, | |
3289 | &num_backups_tried, &backup_index); | |
3290 | if (ret == -1) | |
3291 | goto fail_block_groups; | |
3292 | goto retry_root_backup; | |
eb60ceac CM |
3293 | } |
3294 | ||
f2984462 CM |
3295 | static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate) |
3296 | { | |
f2984462 CM |
3297 | if (uptodate) { |
3298 | set_buffer_uptodate(bh); | |
3299 | } else { | |
442a4f63 SB |
3300 | struct btrfs_device *device = (struct btrfs_device *) |
3301 | bh->b_private; | |
3302 | ||
fb456252 | 3303 | btrfs_warn_rl_in_rcu(device->fs_info, |
b14af3b4 | 3304 | "lost page write due to IO error on %s", |
606686ee | 3305 | rcu_str_deref(device->name)); |
01327610 | 3306 | /* note, we don't set_buffer_write_io_error because we have |
1259ab75 CM |
3307 | * our own ways of dealing with the IO errors |
3308 | */ | |
f2984462 | 3309 | clear_buffer_uptodate(bh); |
442a4f63 | 3310 | btrfs_dev_stat_inc_and_print(device, BTRFS_DEV_STAT_WRITE_ERRS); |
f2984462 CM |
3311 | } |
3312 | unlock_buffer(bh); | |
3313 | put_bh(bh); | |
3314 | } | |
3315 | ||
29c36d72 AJ |
3316 | int btrfs_read_dev_one_super(struct block_device *bdev, int copy_num, |
3317 | struct buffer_head **bh_ret) | |
3318 | { | |
3319 | struct buffer_head *bh; | |
3320 | struct btrfs_super_block *super; | |
3321 | u64 bytenr; | |
3322 | ||
3323 | bytenr = btrfs_sb_offset(copy_num); | |
3324 | if (bytenr + BTRFS_SUPER_INFO_SIZE >= i_size_read(bdev->bd_inode)) | |
3325 | return -EINVAL; | |
3326 | ||
3327 | bh = __bread(bdev, bytenr / 4096, BTRFS_SUPER_INFO_SIZE); | |
3328 | /* | |
3329 | * If we fail to read from the underlying devices, as of now | |
3330 | * the best option we have is to mark it EIO. | |
3331 | */ | |
3332 | if (!bh) | |
3333 | return -EIO; | |
3334 | ||
3335 | super = (struct btrfs_super_block *)bh->b_data; | |
3336 | if (btrfs_super_bytenr(super) != bytenr || | |
3337 | btrfs_super_magic(super) != BTRFS_MAGIC) { | |
3338 | brelse(bh); | |
3339 | return -EINVAL; | |
3340 | } | |
3341 | ||
3342 | *bh_ret = bh; | |
3343 | return 0; | |
3344 | } | |
3345 | ||
3346 | ||
a512bbf8 YZ |
3347 | struct buffer_head *btrfs_read_dev_super(struct block_device *bdev) |
3348 | { | |
3349 | struct buffer_head *bh; | |
3350 | struct buffer_head *latest = NULL; | |
3351 | struct btrfs_super_block *super; | |
3352 | int i; | |
3353 | u64 transid = 0; | |
92fc03fb | 3354 | int ret = -EINVAL; |
a512bbf8 YZ |
3355 | |
3356 | /* we would like to check all the supers, but that would make | |
3357 | * a btrfs mount succeed after a mkfs from a different FS. | |
3358 | * So, we need to add a special mount option to scan for | |
3359 | * later supers, using BTRFS_SUPER_MIRROR_MAX instead | |
3360 | */ | |
3361 | for (i = 0; i < 1; i++) { | |
29c36d72 AJ |
3362 | ret = btrfs_read_dev_one_super(bdev, i, &bh); |
3363 | if (ret) | |
a512bbf8 YZ |
3364 | continue; |
3365 | ||
3366 | super = (struct btrfs_super_block *)bh->b_data; | |
a512bbf8 YZ |
3367 | |
3368 | if (!latest || btrfs_super_generation(super) > transid) { | |
3369 | brelse(latest); | |
3370 | latest = bh; | |
3371 | transid = btrfs_super_generation(super); | |
3372 | } else { | |
3373 | brelse(bh); | |
3374 | } | |
3375 | } | |
92fc03fb AJ |
3376 | |
3377 | if (!latest) | |
3378 | return ERR_PTR(ret); | |
3379 | ||
a512bbf8 YZ |
3380 | return latest; |
3381 | } | |
3382 | ||
4eedeb75 HH |
3383 | /* |
3384 | * this should be called twice, once with wait == 0 and | |
3385 | * once with wait == 1. When wait == 0 is done, all the buffer heads | |
3386 | * we write are pinned. | |
3387 | * | |
3388 | * They are released when wait == 1 is done. | |
3389 | * max_mirrors must be the same for both runs, and it indicates how | |
3390 | * many supers on this one device should be written. | |
3391 | * | |
3392 | * max_mirrors == 0 means to write them all. | |
3393 | */ | |
a512bbf8 YZ |
3394 | static int write_dev_supers(struct btrfs_device *device, |
3395 | struct btrfs_super_block *sb, | |
3396 | int do_barriers, int wait, int max_mirrors) | |
3397 | { | |
3398 | struct buffer_head *bh; | |
3399 | int i; | |
3400 | int ret; | |
3401 | int errors = 0; | |
3402 | u32 crc; | |
3403 | u64 bytenr; | |
a512bbf8 YZ |
3404 | |
3405 | if (max_mirrors == 0) | |
3406 | max_mirrors = BTRFS_SUPER_MIRROR_MAX; | |
3407 | ||
a512bbf8 YZ |
3408 | for (i = 0; i < max_mirrors; i++) { |
3409 | bytenr = btrfs_sb_offset(i); | |
935e5cc9 MX |
3410 | if (bytenr + BTRFS_SUPER_INFO_SIZE >= |
3411 | device->commit_total_bytes) | |
a512bbf8 YZ |
3412 | break; |
3413 | ||
3414 | if (wait) { | |
3415 | bh = __find_get_block(device->bdev, bytenr / 4096, | |
3416 | BTRFS_SUPER_INFO_SIZE); | |
634554dc JB |
3417 | if (!bh) { |
3418 | errors++; | |
3419 | continue; | |
3420 | } | |
a512bbf8 | 3421 | wait_on_buffer(bh); |
4eedeb75 HH |
3422 | if (!buffer_uptodate(bh)) |
3423 | errors++; | |
3424 | ||
3425 | /* drop our reference */ | |
3426 | brelse(bh); | |
3427 | ||
3428 | /* drop the reference from the wait == 0 run */ | |
3429 | brelse(bh); | |
3430 | continue; | |
a512bbf8 YZ |
3431 | } else { |
3432 | btrfs_set_super_bytenr(sb, bytenr); | |
3433 | ||
3434 | crc = ~(u32)0; | |
b0496686 | 3435 | crc = btrfs_csum_data((char *)sb + |
a512bbf8 YZ |
3436 | BTRFS_CSUM_SIZE, crc, |
3437 | BTRFS_SUPER_INFO_SIZE - | |
3438 | BTRFS_CSUM_SIZE); | |
3439 | btrfs_csum_final(crc, sb->csum); | |
3440 | ||
4eedeb75 HH |
3441 | /* |
3442 | * one reference for us, and we leave it for the | |
3443 | * caller | |
3444 | */ | |
a512bbf8 YZ |
3445 | bh = __getblk(device->bdev, bytenr / 4096, |
3446 | BTRFS_SUPER_INFO_SIZE); | |
634554dc | 3447 | if (!bh) { |
fb456252 | 3448 | btrfs_err(device->fs_info, |
f14d104d DS |
3449 | "couldn't get super buffer head for bytenr %llu", |
3450 | bytenr); | |
634554dc JB |
3451 | errors++; |
3452 | continue; | |
3453 | } | |
3454 | ||
a512bbf8 YZ |
3455 | memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE); |
3456 | ||
4eedeb75 | 3457 | /* one reference for submit_bh */ |
a512bbf8 | 3458 | get_bh(bh); |
4eedeb75 HH |
3459 | |
3460 | set_buffer_uptodate(bh); | |
a512bbf8 YZ |
3461 | lock_buffer(bh); |
3462 | bh->b_end_io = btrfs_end_buffer_write_sync; | |
442a4f63 | 3463 | bh->b_private = device; |
a512bbf8 YZ |
3464 | } |
3465 | ||
387125fc CM |
3466 | /* |
3467 | * we fua the first super. The others we allow | |
3468 | * to go down lazy. | |
3469 | */ | |
e8117c26 | 3470 | if (i == 0) |
2a222ca9 | 3471 | ret = btrfsic_submit_bh(REQ_OP_WRITE, WRITE_FUA, bh); |
e8117c26 | 3472 | else |
2a222ca9 | 3473 | ret = btrfsic_submit_bh(REQ_OP_WRITE, WRITE_SYNC, bh); |
4eedeb75 | 3474 | if (ret) |
a512bbf8 | 3475 | errors++; |
a512bbf8 YZ |
3476 | } |
3477 | return errors < i ? 0 : -1; | |
3478 | } | |
3479 | ||
387125fc CM |
3480 | /* |
3481 | * endio for the write_dev_flush, this will wake anyone waiting | |
3482 | * for the barrier when it is done | |
3483 | */ | |
4246a0b6 | 3484 | static void btrfs_end_empty_barrier(struct bio *bio) |
387125fc | 3485 | { |
387125fc CM |
3486 | if (bio->bi_private) |
3487 | complete(bio->bi_private); | |
3488 | bio_put(bio); | |
3489 | } | |
3490 | ||
3491 | /* | |
3492 | * trigger flushes for one the devices. If you pass wait == 0, the flushes are | |
3493 | * sent down. With wait == 1, it waits for the previous flush. | |
3494 | * | |
3495 | * any device where the flush fails with eopnotsupp are flagged as not-barrier | |
3496 | * capable | |
3497 | */ | |
3498 | static int write_dev_flush(struct btrfs_device *device, int wait) | |
3499 | { | |
3500 | struct bio *bio; | |
3501 | int ret = 0; | |
3502 | ||
3503 | if (device->nobarriers) | |
3504 | return 0; | |
3505 | ||
3506 | if (wait) { | |
3507 | bio = device->flush_bio; | |
3508 | if (!bio) | |
3509 | return 0; | |
3510 | ||
3511 | wait_for_completion(&device->flush_wait); | |
3512 | ||
4246a0b6 CH |
3513 | if (bio->bi_error) { |
3514 | ret = bio->bi_error; | |
5af3e8cc SB |
3515 | btrfs_dev_stat_inc_and_print(device, |
3516 | BTRFS_DEV_STAT_FLUSH_ERRS); | |
387125fc CM |
3517 | } |
3518 | ||
3519 | /* drop the reference from the wait == 0 run */ | |
3520 | bio_put(bio); | |
3521 | device->flush_bio = NULL; | |
3522 | ||
3523 | return ret; | |
3524 | } | |
3525 | ||
3526 | /* | |
3527 | * one reference for us, and we leave it for the | |
3528 | * caller | |
3529 | */ | |
9c017abc | 3530 | device->flush_bio = NULL; |
9be3395b | 3531 | bio = btrfs_io_bio_alloc(GFP_NOFS, 0); |
387125fc CM |
3532 | if (!bio) |
3533 | return -ENOMEM; | |
3534 | ||
3535 | bio->bi_end_io = btrfs_end_empty_barrier; | |
3536 | bio->bi_bdev = device->bdev; | |
37226b21 | 3537 | bio_set_op_attrs(bio, REQ_OP_WRITE, WRITE_FLUSH); |
387125fc CM |
3538 | init_completion(&device->flush_wait); |
3539 | bio->bi_private = &device->flush_wait; | |
3540 | device->flush_bio = bio; | |
3541 | ||
3542 | bio_get(bio); | |
4e49ea4a | 3543 | btrfsic_submit_bio(bio); |
387125fc CM |
3544 | |
3545 | return 0; | |
3546 | } | |
3547 | ||
3548 | /* | |
3549 | * send an empty flush down to each device in parallel, | |
3550 | * then wait for them | |
3551 | */ | |
3552 | static int barrier_all_devices(struct btrfs_fs_info *info) | |
3553 | { | |
3554 | struct list_head *head; | |
3555 | struct btrfs_device *dev; | |
5af3e8cc SB |
3556 | int errors_send = 0; |
3557 | int errors_wait = 0; | |
387125fc CM |
3558 | int ret; |
3559 | ||
3560 | /* send down all the barriers */ | |
3561 | head = &info->fs_devices->devices; | |
3562 | list_for_each_entry_rcu(dev, head, dev_list) { | |
f88ba6a2 HS |
3563 | if (dev->missing) |
3564 | continue; | |
387125fc | 3565 | if (!dev->bdev) { |
5af3e8cc | 3566 | errors_send++; |
387125fc CM |
3567 | continue; |
3568 | } | |
3569 | if (!dev->in_fs_metadata || !dev->writeable) | |
3570 | continue; | |
3571 | ||
3572 | ret = write_dev_flush(dev, 0); | |
3573 | if (ret) | |
5af3e8cc | 3574 | errors_send++; |
387125fc CM |
3575 | } |
3576 | ||
3577 | /* wait for all the barriers */ | |
3578 | list_for_each_entry_rcu(dev, head, dev_list) { | |
f88ba6a2 HS |
3579 | if (dev->missing) |
3580 | continue; | |
387125fc | 3581 | if (!dev->bdev) { |
5af3e8cc | 3582 | errors_wait++; |
387125fc CM |
3583 | continue; |
3584 | } | |
3585 | if (!dev->in_fs_metadata || !dev->writeable) | |
3586 | continue; | |
3587 | ||
3588 | ret = write_dev_flush(dev, 1); | |
3589 | if (ret) | |
5af3e8cc | 3590 | errors_wait++; |
387125fc | 3591 | } |
5af3e8cc SB |
3592 | if (errors_send > info->num_tolerated_disk_barrier_failures || |
3593 | errors_wait > info->num_tolerated_disk_barrier_failures) | |
387125fc CM |
3594 | return -EIO; |
3595 | return 0; | |
3596 | } | |
3597 | ||
943c6e99 ZL |
3598 | int btrfs_get_num_tolerated_disk_barrier_failures(u64 flags) |
3599 | { | |
8789f4fe ZL |
3600 | int raid_type; |
3601 | int min_tolerated = INT_MAX; | |
943c6e99 | 3602 | |
8789f4fe ZL |
3603 | if ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 || |
3604 | (flags & BTRFS_AVAIL_ALLOC_BIT_SINGLE)) | |
3605 | min_tolerated = min(min_tolerated, | |
3606 | btrfs_raid_array[BTRFS_RAID_SINGLE]. | |
3607 | tolerated_failures); | |
943c6e99 | 3608 | |
8789f4fe ZL |
3609 | for (raid_type = 0; raid_type < BTRFS_NR_RAID_TYPES; raid_type++) { |
3610 | if (raid_type == BTRFS_RAID_SINGLE) | |
3611 | continue; | |
3612 | if (!(flags & btrfs_raid_group[raid_type])) | |
3613 | continue; | |
3614 | min_tolerated = min(min_tolerated, | |
3615 | btrfs_raid_array[raid_type]. | |
3616 | tolerated_failures); | |
3617 | } | |
943c6e99 | 3618 | |
8789f4fe | 3619 | if (min_tolerated == INT_MAX) { |
ab8d0fc4 | 3620 | pr_warn("BTRFS: unknown raid flag: %llu", flags); |
8789f4fe ZL |
3621 | min_tolerated = 0; |
3622 | } | |
3623 | ||
3624 | return min_tolerated; | |
943c6e99 ZL |
3625 | } |
3626 | ||
5af3e8cc SB |
3627 | int btrfs_calc_num_tolerated_disk_barrier_failures( |
3628 | struct btrfs_fs_info *fs_info) | |
3629 | { | |
3630 | struct btrfs_ioctl_space_info space; | |
3631 | struct btrfs_space_info *sinfo; | |
3632 | u64 types[] = {BTRFS_BLOCK_GROUP_DATA, | |
3633 | BTRFS_BLOCK_GROUP_SYSTEM, | |
3634 | BTRFS_BLOCK_GROUP_METADATA, | |
3635 | BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA}; | |
5af3e8cc SB |
3636 | int i; |
3637 | int c; | |
3638 | int num_tolerated_disk_barrier_failures = | |
3639 | (int)fs_info->fs_devices->num_devices; | |
3640 | ||
2c458045 | 3641 | for (i = 0; i < ARRAY_SIZE(types); i++) { |
5af3e8cc SB |
3642 | struct btrfs_space_info *tmp; |
3643 | ||
3644 | sinfo = NULL; | |
3645 | rcu_read_lock(); | |
3646 | list_for_each_entry_rcu(tmp, &fs_info->space_info, list) { | |
3647 | if (tmp->flags == types[i]) { | |
3648 | sinfo = tmp; | |
3649 | break; | |
3650 | } | |
3651 | } | |
3652 | rcu_read_unlock(); | |
3653 | ||
3654 | if (!sinfo) | |
3655 | continue; | |
3656 | ||
3657 | down_read(&sinfo->groups_sem); | |
3658 | for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) { | |
2c458045 ZL |
3659 | u64 flags; |
3660 | ||
3661 | if (list_empty(&sinfo->block_groups[c])) | |
3662 | continue; | |
3663 | ||
3664 | btrfs_get_block_group_info(&sinfo->block_groups[c], | |
3665 | &space); | |
3666 | if (space.total_bytes == 0 || space.used_bytes == 0) | |
3667 | continue; | |
3668 | flags = space.flags; | |
943c6e99 ZL |
3669 | |
3670 | num_tolerated_disk_barrier_failures = min( | |
3671 | num_tolerated_disk_barrier_failures, | |
3672 | btrfs_get_num_tolerated_disk_barrier_failures( | |
3673 | flags)); | |
5af3e8cc SB |
3674 | } |
3675 | up_read(&sinfo->groups_sem); | |
3676 | } | |
3677 | ||
3678 | return num_tolerated_disk_barrier_failures; | |
3679 | } | |
3680 | ||
48a3b636 | 3681 | static int write_all_supers(struct btrfs_root *root, int max_mirrors) |
f2984462 | 3682 | { |
e5e9a520 | 3683 | struct list_head *head; |
f2984462 | 3684 | struct btrfs_device *dev; |
a061fc8d | 3685 | struct btrfs_super_block *sb; |
f2984462 | 3686 | struct btrfs_dev_item *dev_item; |
f2984462 CM |
3687 | int ret; |
3688 | int do_barriers; | |
a236aed1 CM |
3689 | int max_errors; |
3690 | int total_errors = 0; | |
a061fc8d | 3691 | u64 flags; |
f2984462 | 3692 | |
3cdde224 | 3693 | do_barriers = !btrfs_test_opt(root->fs_info, NOBARRIER); |
af31f5e5 | 3694 | backup_super_roots(root->fs_info); |
f2984462 | 3695 | |
6c41761f | 3696 | sb = root->fs_info->super_for_commit; |
a061fc8d | 3697 | dev_item = &sb->dev_item; |
e5e9a520 | 3698 | |
174ba509 | 3699 | mutex_lock(&root->fs_info->fs_devices->device_list_mutex); |
e5e9a520 | 3700 | head = &root->fs_info->fs_devices->devices; |
d7306801 | 3701 | max_errors = btrfs_super_num_devices(root->fs_info->super_copy) - 1; |
387125fc | 3702 | |
5af3e8cc SB |
3703 | if (do_barriers) { |
3704 | ret = barrier_all_devices(root->fs_info); | |
3705 | if (ret) { | |
3706 | mutex_unlock( | |
3707 | &root->fs_info->fs_devices->device_list_mutex); | |
34d97007 | 3708 | btrfs_handle_fs_error(root->fs_info, ret, |
5af3e8cc SB |
3709 | "errors while submitting device barriers."); |
3710 | return ret; | |
3711 | } | |
3712 | } | |
387125fc | 3713 | |
1f78160c | 3714 | list_for_each_entry_rcu(dev, head, dev_list) { |
dfe25020 CM |
3715 | if (!dev->bdev) { |
3716 | total_errors++; | |
3717 | continue; | |
3718 | } | |
2b82032c | 3719 | if (!dev->in_fs_metadata || !dev->writeable) |
dfe25020 CM |
3720 | continue; |
3721 | ||
2b82032c | 3722 | btrfs_set_stack_device_generation(dev_item, 0); |
a061fc8d CM |
3723 | btrfs_set_stack_device_type(dev_item, dev->type); |
3724 | btrfs_set_stack_device_id(dev_item, dev->devid); | |
7df69d3e | 3725 | btrfs_set_stack_device_total_bytes(dev_item, |
935e5cc9 | 3726 | dev->commit_total_bytes); |
ce7213c7 MX |
3727 | btrfs_set_stack_device_bytes_used(dev_item, |
3728 | dev->commit_bytes_used); | |
a061fc8d CM |
3729 | btrfs_set_stack_device_io_align(dev_item, dev->io_align); |
3730 | btrfs_set_stack_device_io_width(dev_item, dev->io_width); | |
3731 | btrfs_set_stack_device_sector_size(dev_item, dev->sector_size); | |
3732 | memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE); | |
2b82032c | 3733 | memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE); |
a512bbf8 | 3734 | |
a061fc8d CM |
3735 | flags = btrfs_super_flags(sb); |
3736 | btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN); | |
3737 | ||
a512bbf8 | 3738 | ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors); |
a236aed1 CM |
3739 | if (ret) |
3740 | total_errors++; | |
f2984462 | 3741 | } |
a236aed1 | 3742 | if (total_errors > max_errors) { |
efe120a0 | 3743 | btrfs_err(root->fs_info, "%d errors while writing supers", |
d397712b | 3744 | total_errors); |
a724b436 | 3745 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); |
79787eaa | 3746 | |
9d565ba4 | 3747 | /* FUA is masked off if unsupported and can't be the reason */ |
34d97007 | 3748 | btrfs_handle_fs_error(root->fs_info, -EIO, |
9d565ba4 SB |
3749 | "%d errors while writing supers", total_errors); |
3750 | return -EIO; | |
a236aed1 | 3751 | } |
f2984462 | 3752 | |
a512bbf8 | 3753 | total_errors = 0; |
1f78160c | 3754 | list_for_each_entry_rcu(dev, head, dev_list) { |
dfe25020 CM |
3755 | if (!dev->bdev) |
3756 | continue; | |
2b82032c | 3757 | if (!dev->in_fs_metadata || !dev->writeable) |
dfe25020 CM |
3758 | continue; |
3759 | ||
a512bbf8 YZ |
3760 | ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors); |
3761 | if (ret) | |
3762 | total_errors++; | |
f2984462 | 3763 | } |
174ba509 | 3764 | mutex_unlock(&root->fs_info->fs_devices->device_list_mutex); |
a236aed1 | 3765 | if (total_errors > max_errors) { |
34d97007 | 3766 | btrfs_handle_fs_error(root->fs_info, -EIO, |
79787eaa JM |
3767 | "%d errors while writing supers", total_errors); |
3768 | return -EIO; | |
a236aed1 | 3769 | } |
f2984462 CM |
3770 | return 0; |
3771 | } | |
3772 | ||
a512bbf8 YZ |
3773 | int write_ctree_super(struct btrfs_trans_handle *trans, |
3774 | struct btrfs_root *root, int max_mirrors) | |
eb60ceac | 3775 | { |
f570e757 | 3776 | return write_all_supers(root, max_mirrors); |
cfaa7295 CM |
3777 | } |
3778 | ||
cb517eab MX |
3779 | /* Drop a fs root from the radix tree and free it. */ |
3780 | void btrfs_drop_and_free_fs_root(struct btrfs_fs_info *fs_info, | |
3781 | struct btrfs_root *root) | |
2619ba1f | 3782 | { |
4df27c4d | 3783 | spin_lock(&fs_info->fs_roots_radix_lock); |
2619ba1f CM |
3784 | radix_tree_delete(&fs_info->fs_roots_radix, |
3785 | (unsigned long)root->root_key.objectid); | |
4df27c4d | 3786 | spin_unlock(&fs_info->fs_roots_radix_lock); |
76dda93c YZ |
3787 | |
3788 | if (btrfs_root_refs(&root->root_item) == 0) | |
3789 | synchronize_srcu(&fs_info->subvol_srcu); | |
3790 | ||
1c1ea4f7 | 3791 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) { |
3321719e | 3792 | btrfs_free_log(NULL, root); |
1c1ea4f7 LB |
3793 | if (root->reloc_root) { |
3794 | free_extent_buffer(root->reloc_root->node); | |
3795 | free_extent_buffer(root->reloc_root->commit_root); | |
3796 | btrfs_put_fs_root(root->reloc_root); | |
3797 | root->reloc_root = NULL; | |
3798 | } | |
3799 | } | |
3321719e | 3800 | |
faa2dbf0 JB |
3801 | if (root->free_ino_pinned) |
3802 | __btrfs_remove_free_space_cache(root->free_ino_pinned); | |
3803 | if (root->free_ino_ctl) | |
3804 | __btrfs_remove_free_space_cache(root->free_ino_ctl); | |
4df27c4d | 3805 | free_fs_root(root); |
4df27c4d YZ |
3806 | } |
3807 | ||
3808 | static void free_fs_root(struct btrfs_root *root) | |
3809 | { | |
57cdc8db | 3810 | iput(root->ino_cache_inode); |
4df27c4d | 3811 | WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree)); |
1cb048f5 FDBM |
3812 | btrfs_free_block_rsv(root, root->orphan_block_rsv); |
3813 | root->orphan_block_rsv = NULL; | |
0ee5dc67 AV |
3814 | if (root->anon_dev) |
3815 | free_anon_bdev(root->anon_dev); | |
8257b2dc MX |
3816 | if (root->subv_writers) |
3817 | btrfs_free_subvolume_writers(root->subv_writers); | |
4df27c4d YZ |
3818 | free_extent_buffer(root->node); |
3819 | free_extent_buffer(root->commit_root); | |
581bb050 LZ |
3820 | kfree(root->free_ino_ctl); |
3821 | kfree(root->free_ino_pinned); | |
d397712b | 3822 | kfree(root->name); |
b0feb9d9 | 3823 | btrfs_put_fs_root(root); |
2619ba1f CM |
3824 | } |
3825 | ||
cb517eab MX |
3826 | void btrfs_free_fs_root(struct btrfs_root *root) |
3827 | { | |
3828 | free_fs_root(root); | |
2619ba1f CM |
3829 | } |
3830 | ||
c146afad | 3831 | int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info) |
cfaa7295 | 3832 | { |
c146afad YZ |
3833 | u64 root_objectid = 0; |
3834 | struct btrfs_root *gang[8]; | |
65d33fd7 QW |
3835 | int i = 0; |
3836 | int err = 0; | |
3837 | unsigned int ret = 0; | |
3838 | int index; | |
e089f05c | 3839 | |
c146afad | 3840 | while (1) { |
65d33fd7 | 3841 | index = srcu_read_lock(&fs_info->subvol_srcu); |
c146afad YZ |
3842 | ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix, |
3843 | (void **)gang, root_objectid, | |
3844 | ARRAY_SIZE(gang)); | |
65d33fd7 QW |
3845 | if (!ret) { |
3846 | srcu_read_unlock(&fs_info->subvol_srcu, index); | |
c146afad | 3847 | break; |
65d33fd7 | 3848 | } |
5d4f98a2 | 3849 | root_objectid = gang[ret - 1]->root_key.objectid + 1; |
65d33fd7 | 3850 | |
c146afad | 3851 | for (i = 0; i < ret; i++) { |
65d33fd7 QW |
3852 | /* Avoid to grab roots in dead_roots */ |
3853 | if (btrfs_root_refs(&gang[i]->root_item) == 0) { | |
3854 | gang[i] = NULL; | |
3855 | continue; | |
3856 | } | |
3857 | /* grab all the search result for later use */ | |
3858 | gang[i] = btrfs_grab_fs_root(gang[i]); | |
3859 | } | |
3860 | srcu_read_unlock(&fs_info->subvol_srcu, index); | |
66b4ffd1 | 3861 | |
65d33fd7 QW |
3862 | for (i = 0; i < ret; i++) { |
3863 | if (!gang[i]) | |
3864 | continue; | |
c146afad | 3865 | root_objectid = gang[i]->root_key.objectid; |
66b4ffd1 JB |
3866 | err = btrfs_orphan_cleanup(gang[i]); |
3867 | if (err) | |
65d33fd7 QW |
3868 | break; |
3869 | btrfs_put_fs_root(gang[i]); | |
c146afad YZ |
3870 | } |
3871 | root_objectid++; | |
3872 | } | |
65d33fd7 QW |
3873 | |
3874 | /* release the uncleaned roots due to error */ | |
3875 | for (; i < ret; i++) { | |
3876 | if (gang[i]) | |
3877 | btrfs_put_fs_root(gang[i]); | |
3878 | } | |
3879 | return err; | |
c146afad | 3880 | } |
a2135011 | 3881 | |
6bccf3ab | 3882 | int btrfs_commit_super(struct btrfs_fs_info *fs_info) |
c146afad | 3883 | { |
6bccf3ab | 3884 | struct btrfs_root *root = fs_info->tree_root; |
c146afad | 3885 | struct btrfs_trans_handle *trans; |
a74a4b97 | 3886 | |
c146afad | 3887 | mutex_lock(&root->fs_info->cleaner_mutex); |
24bbcf04 | 3888 | btrfs_run_delayed_iputs(root); |
c146afad | 3889 | mutex_unlock(&root->fs_info->cleaner_mutex); |
9d1a2a3a | 3890 | wake_up_process(root->fs_info->cleaner_kthread); |
c71bf099 YZ |
3891 | |
3892 | /* wait until ongoing cleanup work done */ | |
3893 | down_write(&root->fs_info->cleanup_work_sem); | |
3894 | up_write(&root->fs_info->cleanup_work_sem); | |
3895 | ||
7a7eaa40 | 3896 | trans = btrfs_join_transaction(root); |
3612b495 TI |
3897 | if (IS_ERR(trans)) |
3898 | return PTR_ERR(trans); | |
d52c1bcc | 3899 | return btrfs_commit_transaction(trans, root); |
c146afad YZ |
3900 | } |
3901 | ||
6bccf3ab | 3902 | void close_ctree(struct btrfs_fs_info *fs_info) |
c146afad | 3903 | { |
6bccf3ab | 3904 | struct btrfs_root *root = fs_info->tree_root; |
c146afad YZ |
3905 | int ret; |
3906 | ||
afcdd129 | 3907 | set_bit(BTRFS_FS_CLOSING_START, &fs_info->flags); |
c146afad | 3908 | |
7343dd61 | 3909 | /* wait for the qgroup rescan worker to stop */ |
d06f23d6 | 3910 | btrfs_qgroup_wait_for_completion(fs_info, false); |
7343dd61 | 3911 | |
803b2f54 SB |
3912 | /* wait for the uuid_scan task to finish */ |
3913 | down(&fs_info->uuid_tree_rescan_sem); | |
3914 | /* avoid complains from lockdep et al., set sem back to initial state */ | |
3915 | up(&fs_info->uuid_tree_rescan_sem); | |
3916 | ||
837d5b6e | 3917 | /* pause restriper - we want to resume on mount */ |
aa1b8cd4 | 3918 | btrfs_pause_balance(fs_info); |
837d5b6e | 3919 | |
8dabb742 SB |
3920 | btrfs_dev_replace_suspend_for_unmount(fs_info); |
3921 | ||
aa1b8cd4 | 3922 | btrfs_scrub_cancel(fs_info); |
4cb5300b CM |
3923 | |
3924 | /* wait for any defraggers to finish */ | |
3925 | wait_event(fs_info->transaction_wait, | |
3926 | (atomic_read(&fs_info->defrag_running) == 0)); | |
3927 | ||
3928 | /* clear out the rbtree of defraggable inodes */ | |
26176e7c | 3929 | btrfs_cleanup_defrag_inodes(fs_info); |
4cb5300b | 3930 | |
21c7e756 MX |
3931 | cancel_work_sync(&fs_info->async_reclaim_work); |
3932 | ||
c146afad | 3933 | if (!(fs_info->sb->s_flags & MS_RDONLY)) { |
e44163e1 JM |
3934 | /* |
3935 | * If the cleaner thread is stopped and there are | |
3936 | * block groups queued for removal, the deletion will be | |
3937 | * skipped when we quit the cleaner thread. | |
3938 | */ | |
e44163e1 | 3939 | btrfs_delete_unused_bgs(root->fs_info); |
e44163e1 | 3940 | |
6bccf3ab | 3941 | ret = btrfs_commit_super(fs_info); |
acce952b | 3942 | if (ret) |
04892340 | 3943 | btrfs_err(fs_info, "commit super ret %d", ret); |
acce952b | 3944 | } |
3945 | ||
87533c47 | 3946 | if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) |
68ce9682 | 3947 | btrfs_error_commit_super(root); |
0f7d52f4 | 3948 | |
e3029d9f AV |
3949 | kthread_stop(fs_info->transaction_kthread); |
3950 | kthread_stop(fs_info->cleaner_kthread); | |
8929ecfa | 3951 | |
afcdd129 | 3952 | set_bit(BTRFS_FS_CLOSING_DONE, &fs_info->flags); |
f25784b3 | 3953 | |
04892340 | 3954 | btrfs_free_qgroup_config(fs_info); |
bcef60f2 | 3955 | |
963d678b | 3956 | if (percpu_counter_sum(&fs_info->delalloc_bytes)) { |
04892340 | 3957 | btrfs_info(fs_info, "at unmount delalloc count %lld", |
963d678b | 3958 | percpu_counter_sum(&fs_info->delalloc_bytes)); |
b0c68f8b | 3959 | } |
bcc63abb | 3960 | |
6618a59b | 3961 | btrfs_sysfs_remove_mounted(fs_info); |
b7c35e81 | 3962 | btrfs_sysfs_remove_fsid(fs_info->fs_devices); |
5ac1d209 | 3963 | |
faa2dbf0 | 3964 | btrfs_free_fs_roots(fs_info); |
d10c5f31 | 3965 | |
1a4319cc LB |
3966 | btrfs_put_block_group_cache(fs_info); |
3967 | ||
2b1360da JB |
3968 | btrfs_free_block_groups(fs_info); |
3969 | ||
de348ee0 WS |
3970 | /* |
3971 | * we must make sure there is not any read request to | |
3972 | * submit after we stopping all workers. | |
3973 | */ | |
3974 | invalidate_inode_pages2(fs_info->btree_inode->i_mapping); | |
96192499 JB |
3975 | btrfs_stop_all_workers(fs_info); |
3976 | ||
afcdd129 | 3977 | clear_bit(BTRFS_FS_OPEN, &fs_info->flags); |
13e6c37b | 3978 | free_root_pointers(fs_info, 1); |
9ad6b7bc | 3979 | |
13e6c37b | 3980 | iput(fs_info->btree_inode); |
d6bfde87 | 3981 | |
21adbd5c | 3982 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY |
3cdde224 | 3983 | if (btrfs_test_opt(root->fs_info, CHECK_INTEGRITY)) |
21adbd5c SB |
3984 | btrfsic_unmount(root, fs_info->fs_devices); |
3985 | #endif | |
3986 | ||
dfe25020 | 3987 | btrfs_close_devices(fs_info->fs_devices); |
0b86a832 | 3988 | btrfs_mapping_tree_free(&fs_info->mapping_tree); |
b248a415 | 3989 | |
e2d84521 | 3990 | percpu_counter_destroy(&fs_info->dirty_metadata_bytes); |
963d678b | 3991 | percpu_counter_destroy(&fs_info->delalloc_bytes); |
c404e0dc | 3992 | percpu_counter_destroy(&fs_info->bio_counter); |
04160088 | 3993 | bdi_destroy(&fs_info->bdi); |
76dda93c | 3994 | cleanup_srcu_struct(&fs_info->subvol_srcu); |
0b86a832 | 3995 | |
53b381b3 DW |
3996 | btrfs_free_stripe_hash_table(fs_info); |
3997 | ||
cdfb080e | 3998 | __btrfs_free_block_rsv(root->orphan_block_rsv); |
1cb048f5 | 3999 | root->orphan_block_rsv = NULL; |
04216820 | 4000 | |
3796d335 | 4001 | lock_chunks(root->fs_info); |
04216820 FM |
4002 | while (!list_empty(&fs_info->pinned_chunks)) { |
4003 | struct extent_map *em; | |
4004 | ||
4005 | em = list_first_entry(&fs_info->pinned_chunks, | |
4006 | struct extent_map, list); | |
4007 | list_del_init(&em->list); | |
4008 | free_extent_map(em); | |
4009 | } | |
3796d335 | 4010 | unlock_chunks(root->fs_info); |
eb60ceac CM |
4011 | } |
4012 | ||
b9fab919 CM |
4013 | int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid, |
4014 | int atomic) | |
5f39d397 | 4015 | { |
1259ab75 | 4016 | int ret; |
727011e0 | 4017 | struct inode *btree_inode = buf->pages[0]->mapping->host; |
1259ab75 | 4018 | |
0b32f4bb | 4019 | ret = extent_buffer_uptodate(buf); |
1259ab75 CM |
4020 | if (!ret) |
4021 | return ret; | |
4022 | ||
4023 | ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf, | |
b9fab919 CM |
4024 | parent_transid, atomic); |
4025 | if (ret == -EAGAIN) | |
4026 | return ret; | |
1259ab75 | 4027 | return !ret; |
5f39d397 CM |
4028 | } |
4029 | ||
5f39d397 CM |
4030 | void btrfs_mark_buffer_dirty(struct extent_buffer *buf) |
4031 | { | |
06ea65a3 | 4032 | struct btrfs_root *root; |
5f39d397 | 4033 | u64 transid = btrfs_header_generation(buf); |
b9473439 | 4034 | int was_dirty; |
b4ce94de | 4035 | |
06ea65a3 JB |
4036 | #ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS |
4037 | /* | |
4038 | * This is a fast path so only do this check if we have sanity tests | |
4039 | * enabled. Normal people shouldn't be marking dummy buffers as dirty | |
4040 | * outside of the sanity tests. | |
4041 | */ | |
4042 | if (unlikely(test_bit(EXTENT_BUFFER_DUMMY, &buf->bflags))) | |
4043 | return; | |
4044 | #endif | |
4045 | root = BTRFS_I(buf->pages[0]->mapping->host)->root; | |
b9447ef8 | 4046 | btrfs_assert_tree_locked(buf); |
31b1a2bd | 4047 | if (transid != root->fs_info->generation) |
5d163e0e | 4048 | WARN(1, KERN_CRIT "btrfs transid mismatch buffer %llu, found %llu running %llu\n", |
c1c9ff7c | 4049 | buf->start, transid, root->fs_info->generation); |
0b32f4bb | 4050 | was_dirty = set_extent_buffer_dirty(buf); |
e2d84521 MX |
4051 | if (!was_dirty) |
4052 | __percpu_counter_add(&root->fs_info->dirty_metadata_bytes, | |
4053 | buf->len, | |
4054 | root->fs_info->dirty_metadata_batch); | |
1f21ef0a FM |
4055 | #ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY |
4056 | if (btrfs_header_level(buf) == 0 && check_leaf(root, buf)) { | |
4057 | btrfs_print_leaf(root, buf); | |
4058 | ASSERT(0); | |
4059 | } | |
4060 | #endif | |
eb60ceac CM |
4061 | } |
4062 | ||
b53d3f5d LB |
4063 | static void __btrfs_btree_balance_dirty(struct btrfs_root *root, |
4064 | int flush_delayed) | |
16cdcec7 MX |
4065 | { |
4066 | /* | |
4067 | * looks as though older kernels can get into trouble with | |
4068 | * this code, they end up stuck in balance_dirty_pages forever | |
4069 | */ | |
e2d84521 | 4070 | int ret; |
16cdcec7 MX |
4071 | |
4072 | if (current->flags & PF_MEMALLOC) | |
4073 | return; | |
4074 | ||
b53d3f5d LB |
4075 | if (flush_delayed) |
4076 | btrfs_balance_delayed_items(root); | |
16cdcec7 | 4077 | |
e2d84521 MX |
4078 | ret = percpu_counter_compare(&root->fs_info->dirty_metadata_bytes, |
4079 | BTRFS_DIRTY_METADATA_THRESH); | |
4080 | if (ret > 0) { | |
d0e1d66b NJ |
4081 | balance_dirty_pages_ratelimited( |
4082 | root->fs_info->btree_inode->i_mapping); | |
16cdcec7 | 4083 | } |
16cdcec7 MX |
4084 | } |
4085 | ||
b53d3f5d | 4086 | void btrfs_btree_balance_dirty(struct btrfs_root *root) |
35b7e476 | 4087 | { |
b53d3f5d LB |
4088 | __btrfs_btree_balance_dirty(root, 1); |
4089 | } | |
585ad2c3 | 4090 | |
b53d3f5d LB |
4091 | void btrfs_btree_balance_dirty_nodelay(struct btrfs_root *root) |
4092 | { | |
4093 | __btrfs_btree_balance_dirty(root, 0); | |
35b7e476 | 4094 | } |
6b80053d | 4095 | |
ca7a79ad | 4096 | int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid) |
6b80053d | 4097 | { |
727011e0 | 4098 | struct btrfs_root *root = BTRFS_I(buf->pages[0]->mapping->host)->root; |
8436ea91 | 4099 | return btree_read_extent_buffer_pages(root, buf, parent_transid); |
6b80053d | 4100 | } |
0da5468f | 4101 | |
fcd1f065 | 4102 | static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info, |
acce952b | 4103 | int read_only) |
4104 | { | |
c926093e | 4105 | struct btrfs_super_block *sb = fs_info->super_copy; |
319e4d06 QW |
4106 | u64 nodesize = btrfs_super_nodesize(sb); |
4107 | u64 sectorsize = btrfs_super_sectorsize(sb); | |
c926093e DS |
4108 | int ret = 0; |
4109 | ||
319e4d06 | 4110 | if (btrfs_super_magic(sb) != BTRFS_MAGIC) { |
ab8d0fc4 | 4111 | btrfs_err(fs_info, "no valid FS found"); |
319e4d06 QW |
4112 | ret = -EINVAL; |
4113 | } | |
4114 | if (btrfs_super_flags(sb) & ~BTRFS_SUPER_FLAG_SUPP) | |
ab8d0fc4 | 4115 | btrfs_warn(fs_info, "unrecognized super flag: %llu", |
319e4d06 | 4116 | btrfs_super_flags(sb) & ~BTRFS_SUPER_FLAG_SUPP); |
21e7626b | 4117 | if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) { |
ab8d0fc4 | 4118 | btrfs_err(fs_info, "tree_root level too big: %d >= %d", |
21e7626b | 4119 | btrfs_super_root_level(sb), BTRFS_MAX_LEVEL); |
c926093e DS |
4120 | ret = -EINVAL; |
4121 | } | |
21e7626b | 4122 | if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) { |
ab8d0fc4 | 4123 | btrfs_err(fs_info, "chunk_root level too big: %d >= %d", |
21e7626b | 4124 | btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL); |
c926093e DS |
4125 | ret = -EINVAL; |
4126 | } | |
21e7626b | 4127 | if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) { |
ab8d0fc4 | 4128 | btrfs_err(fs_info, "log_root level too big: %d >= %d", |
21e7626b | 4129 | btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL); |
c926093e DS |
4130 | ret = -EINVAL; |
4131 | } | |
4132 | ||
1104a885 | 4133 | /* |
319e4d06 QW |
4134 | * Check sectorsize and nodesize first, other check will need it. |
4135 | * Check all possible sectorsize(4K, 8K, 16K, 32K, 64K) here. | |
1104a885 | 4136 | */ |
319e4d06 QW |
4137 | if (!is_power_of_2(sectorsize) || sectorsize < 4096 || |
4138 | sectorsize > BTRFS_MAX_METADATA_BLOCKSIZE) { | |
ab8d0fc4 | 4139 | btrfs_err(fs_info, "invalid sectorsize %llu", sectorsize); |
319e4d06 QW |
4140 | ret = -EINVAL; |
4141 | } | |
4142 | /* Only PAGE SIZE is supported yet */ | |
09cbfeaf | 4143 | if (sectorsize != PAGE_SIZE) { |
ab8d0fc4 JM |
4144 | btrfs_err(fs_info, |
4145 | "sectorsize %llu not supported yet, only support %lu", | |
4146 | sectorsize, PAGE_SIZE); | |
319e4d06 QW |
4147 | ret = -EINVAL; |
4148 | } | |
4149 | if (!is_power_of_2(nodesize) || nodesize < sectorsize || | |
4150 | nodesize > BTRFS_MAX_METADATA_BLOCKSIZE) { | |
ab8d0fc4 | 4151 | btrfs_err(fs_info, "invalid nodesize %llu", nodesize); |
319e4d06 QW |
4152 | ret = -EINVAL; |
4153 | } | |
4154 | if (nodesize != le32_to_cpu(sb->__unused_leafsize)) { | |
ab8d0fc4 JM |
4155 | btrfs_err(fs_info, "invalid leafsize %u, should be %llu", |
4156 | le32_to_cpu(sb->__unused_leafsize), nodesize); | |
319e4d06 QW |
4157 | ret = -EINVAL; |
4158 | } | |
4159 | ||
4160 | /* Root alignment check */ | |
4161 | if (!IS_ALIGNED(btrfs_super_root(sb), sectorsize)) { | |
ab8d0fc4 JM |
4162 | btrfs_warn(fs_info, "tree_root block unaligned: %llu", |
4163 | btrfs_super_root(sb)); | |
319e4d06 QW |
4164 | ret = -EINVAL; |
4165 | } | |
4166 | if (!IS_ALIGNED(btrfs_super_chunk_root(sb), sectorsize)) { | |
ab8d0fc4 JM |
4167 | btrfs_warn(fs_info, "chunk_root block unaligned: %llu", |
4168 | btrfs_super_chunk_root(sb)); | |
75d6ad38 DS |
4169 | ret = -EINVAL; |
4170 | } | |
319e4d06 | 4171 | if (!IS_ALIGNED(btrfs_super_log_root(sb), sectorsize)) { |
ab8d0fc4 JM |
4172 | btrfs_warn(fs_info, "log_root block unaligned: %llu", |
4173 | btrfs_super_log_root(sb)); | |
75d6ad38 DS |
4174 | ret = -EINVAL; |
4175 | } | |
4176 | ||
c926093e | 4177 | if (memcmp(fs_info->fsid, sb->dev_item.fsid, BTRFS_UUID_SIZE) != 0) { |
ab8d0fc4 JM |
4178 | btrfs_err(fs_info, |
4179 | "dev_item UUID does not match fsid: %pU != %pU", | |
4180 | fs_info->fsid, sb->dev_item.fsid); | |
c926093e DS |
4181 | ret = -EINVAL; |
4182 | } | |
4183 | ||
4184 | /* | |
4185 | * Hint to catch really bogus numbers, bitflips or so, more exact checks are | |
4186 | * done later | |
4187 | */ | |
99e3ecfc LB |
4188 | if (btrfs_super_bytes_used(sb) < 6 * btrfs_super_nodesize(sb)) { |
4189 | btrfs_err(fs_info, "bytes_used is too small %llu", | |
ab8d0fc4 | 4190 | btrfs_super_bytes_used(sb)); |
99e3ecfc LB |
4191 | ret = -EINVAL; |
4192 | } | |
b7f67055 | 4193 | if (!is_power_of_2(btrfs_super_stripesize(sb))) { |
99e3ecfc | 4194 | btrfs_err(fs_info, "invalid stripesize %u", |
ab8d0fc4 | 4195 | btrfs_super_stripesize(sb)); |
99e3ecfc LB |
4196 | ret = -EINVAL; |
4197 | } | |
21e7626b | 4198 | if (btrfs_super_num_devices(sb) > (1UL << 31)) |
ab8d0fc4 JM |
4199 | btrfs_warn(fs_info, "suspicious number of devices: %llu", |
4200 | btrfs_super_num_devices(sb)); | |
75d6ad38 | 4201 | if (btrfs_super_num_devices(sb) == 0) { |
ab8d0fc4 | 4202 | btrfs_err(fs_info, "number of devices is 0"); |
75d6ad38 DS |
4203 | ret = -EINVAL; |
4204 | } | |
c926093e | 4205 | |
21e7626b | 4206 | if (btrfs_super_bytenr(sb) != BTRFS_SUPER_INFO_OFFSET) { |
ab8d0fc4 JM |
4207 | btrfs_err(fs_info, "super offset mismatch %llu != %u", |
4208 | btrfs_super_bytenr(sb), BTRFS_SUPER_INFO_OFFSET); | |
c926093e DS |
4209 | ret = -EINVAL; |
4210 | } | |
4211 | ||
ce7fca5f DS |
4212 | /* |
4213 | * Obvious sys_chunk_array corruptions, it must hold at least one key | |
4214 | * and one chunk | |
4215 | */ | |
4216 | if (btrfs_super_sys_array_size(sb) > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) { | |
ab8d0fc4 JM |
4217 | btrfs_err(fs_info, "system chunk array too big %u > %u", |
4218 | btrfs_super_sys_array_size(sb), | |
4219 | BTRFS_SYSTEM_CHUNK_ARRAY_SIZE); | |
ce7fca5f DS |
4220 | ret = -EINVAL; |
4221 | } | |
4222 | if (btrfs_super_sys_array_size(sb) < sizeof(struct btrfs_disk_key) | |
4223 | + sizeof(struct btrfs_chunk)) { | |
ab8d0fc4 JM |
4224 | btrfs_err(fs_info, "system chunk array too small %u < %zu", |
4225 | btrfs_super_sys_array_size(sb), | |
4226 | sizeof(struct btrfs_disk_key) | |
4227 | + sizeof(struct btrfs_chunk)); | |
ce7fca5f DS |
4228 | ret = -EINVAL; |
4229 | } | |
4230 | ||
c926093e DS |
4231 | /* |
4232 | * The generation is a global counter, we'll trust it more than the others | |
4233 | * but it's still possible that it's the one that's wrong. | |
4234 | */ | |
21e7626b | 4235 | if (btrfs_super_generation(sb) < btrfs_super_chunk_root_generation(sb)) |
ab8d0fc4 JM |
4236 | btrfs_warn(fs_info, |
4237 | "suspicious: generation < chunk_root_generation: %llu < %llu", | |
4238 | btrfs_super_generation(sb), | |
4239 | btrfs_super_chunk_root_generation(sb)); | |
21e7626b DS |
4240 | if (btrfs_super_generation(sb) < btrfs_super_cache_generation(sb) |
4241 | && btrfs_super_cache_generation(sb) != (u64)-1) | |
ab8d0fc4 JM |
4242 | btrfs_warn(fs_info, |
4243 | "suspicious: generation < cache_generation: %llu < %llu", | |
4244 | btrfs_super_generation(sb), | |
4245 | btrfs_super_cache_generation(sb)); | |
c926093e DS |
4246 | |
4247 | return ret; | |
acce952b | 4248 | } |
4249 | ||
48a3b636 | 4250 | static void btrfs_error_commit_super(struct btrfs_root *root) |
acce952b | 4251 | { |
acce952b | 4252 | mutex_lock(&root->fs_info->cleaner_mutex); |
4253 | btrfs_run_delayed_iputs(root); | |
4254 | mutex_unlock(&root->fs_info->cleaner_mutex); | |
4255 | ||
4256 | down_write(&root->fs_info->cleanup_work_sem); | |
4257 | up_write(&root->fs_info->cleanup_work_sem); | |
4258 | ||
4259 | /* cleanup FS via transaction */ | |
4260 | btrfs_cleanup_transaction(root); | |
acce952b | 4261 | } |
4262 | ||
143bede5 | 4263 | static void btrfs_destroy_ordered_extents(struct btrfs_root *root) |
acce952b | 4264 | { |
acce952b | 4265 | struct btrfs_ordered_extent *ordered; |
acce952b | 4266 | |
199c2a9c | 4267 | spin_lock(&root->ordered_extent_lock); |
779880ef JB |
4268 | /* |
4269 | * This will just short circuit the ordered completion stuff which will | |
4270 | * make sure the ordered extent gets properly cleaned up. | |
4271 | */ | |
199c2a9c | 4272 | list_for_each_entry(ordered, &root->ordered_extents, |
779880ef JB |
4273 | root_extent_list) |
4274 | set_bit(BTRFS_ORDERED_IOERR, &ordered->flags); | |
199c2a9c MX |
4275 | spin_unlock(&root->ordered_extent_lock); |
4276 | } | |
4277 | ||
4278 | static void btrfs_destroy_all_ordered_extents(struct btrfs_fs_info *fs_info) | |
4279 | { | |
4280 | struct btrfs_root *root; | |
4281 | struct list_head splice; | |
4282 | ||
4283 | INIT_LIST_HEAD(&splice); | |
4284 | ||
4285 | spin_lock(&fs_info->ordered_root_lock); | |
4286 | list_splice_init(&fs_info->ordered_roots, &splice); | |
4287 | while (!list_empty(&splice)) { | |
4288 | root = list_first_entry(&splice, struct btrfs_root, | |
4289 | ordered_root); | |
1de2cfde JB |
4290 | list_move_tail(&root->ordered_root, |
4291 | &fs_info->ordered_roots); | |
199c2a9c | 4292 | |
2a85d9ca | 4293 | spin_unlock(&fs_info->ordered_root_lock); |
199c2a9c MX |
4294 | btrfs_destroy_ordered_extents(root); |
4295 | ||
2a85d9ca LB |
4296 | cond_resched(); |
4297 | spin_lock(&fs_info->ordered_root_lock); | |
199c2a9c MX |
4298 | } |
4299 | spin_unlock(&fs_info->ordered_root_lock); | |
acce952b | 4300 | } |
4301 | ||
35a3621b SB |
4302 | static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans, |
4303 | struct btrfs_root *root) | |
acce952b | 4304 | { |
4305 | struct rb_node *node; | |
4306 | struct btrfs_delayed_ref_root *delayed_refs; | |
4307 | struct btrfs_delayed_ref_node *ref; | |
4308 | int ret = 0; | |
4309 | ||
4310 | delayed_refs = &trans->delayed_refs; | |
4311 | ||
4312 | spin_lock(&delayed_refs->lock); | |
d7df2c79 | 4313 | if (atomic_read(&delayed_refs->num_entries) == 0) { |
cfece4db | 4314 | spin_unlock(&delayed_refs->lock); |
efe120a0 | 4315 | btrfs_info(root->fs_info, "delayed_refs has NO entry"); |
acce952b | 4316 | return ret; |
4317 | } | |
4318 | ||
d7df2c79 JB |
4319 | while ((node = rb_first(&delayed_refs->href_root)) != NULL) { |
4320 | struct btrfs_delayed_ref_head *head; | |
c6fc2454 | 4321 | struct btrfs_delayed_ref_node *tmp; |
e78417d1 | 4322 | bool pin_bytes = false; |
acce952b | 4323 | |
d7df2c79 JB |
4324 | head = rb_entry(node, struct btrfs_delayed_ref_head, |
4325 | href_node); | |
4326 | if (!mutex_trylock(&head->mutex)) { | |
4327 | atomic_inc(&head->node.refs); | |
4328 | spin_unlock(&delayed_refs->lock); | |
eb12db69 | 4329 | |
d7df2c79 | 4330 | mutex_lock(&head->mutex); |
e78417d1 | 4331 | mutex_unlock(&head->mutex); |
d7df2c79 JB |
4332 | btrfs_put_delayed_ref(&head->node); |
4333 | spin_lock(&delayed_refs->lock); | |
4334 | continue; | |
4335 | } | |
4336 | spin_lock(&head->lock); | |
c6fc2454 QW |
4337 | list_for_each_entry_safe_reverse(ref, tmp, &head->ref_list, |
4338 | list) { | |
d7df2c79 | 4339 | ref->in_tree = 0; |
c6fc2454 | 4340 | list_del(&ref->list); |
1d57ee94 WX |
4341 | if (!list_empty(&ref->add_list)) |
4342 | list_del(&ref->add_list); | |
d7df2c79 JB |
4343 | atomic_dec(&delayed_refs->num_entries); |
4344 | btrfs_put_delayed_ref(ref); | |
e78417d1 | 4345 | } |
d7df2c79 JB |
4346 | if (head->must_insert_reserved) |
4347 | pin_bytes = true; | |
4348 | btrfs_free_delayed_extent_op(head->extent_op); | |
4349 | delayed_refs->num_heads--; | |
4350 | if (head->processing == 0) | |
4351 | delayed_refs->num_heads_ready--; | |
4352 | atomic_dec(&delayed_refs->num_entries); | |
4353 | head->node.in_tree = 0; | |
4354 | rb_erase(&head->href_node, &delayed_refs->href_root); | |
4355 | spin_unlock(&head->lock); | |
4356 | spin_unlock(&delayed_refs->lock); | |
4357 | mutex_unlock(&head->mutex); | |
acce952b | 4358 | |
d7df2c79 JB |
4359 | if (pin_bytes) |
4360 | btrfs_pin_extent(root, head->node.bytenr, | |
4361 | head->node.num_bytes, 1); | |
4362 | btrfs_put_delayed_ref(&head->node); | |
acce952b | 4363 | cond_resched(); |
4364 | spin_lock(&delayed_refs->lock); | |
4365 | } | |
4366 | ||
4367 | spin_unlock(&delayed_refs->lock); | |
4368 | ||
4369 | return ret; | |
4370 | } | |
4371 | ||
143bede5 | 4372 | static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root) |
acce952b | 4373 | { |
4374 | struct btrfs_inode *btrfs_inode; | |
4375 | struct list_head splice; | |
4376 | ||
4377 | INIT_LIST_HEAD(&splice); | |
4378 | ||
eb73c1b7 MX |
4379 | spin_lock(&root->delalloc_lock); |
4380 | list_splice_init(&root->delalloc_inodes, &splice); | |
acce952b | 4381 | |
4382 | while (!list_empty(&splice)) { | |
eb73c1b7 MX |
4383 | btrfs_inode = list_first_entry(&splice, struct btrfs_inode, |
4384 | delalloc_inodes); | |
acce952b | 4385 | |
4386 | list_del_init(&btrfs_inode->delalloc_inodes); | |
df0af1a5 MX |
4387 | clear_bit(BTRFS_INODE_IN_DELALLOC_LIST, |
4388 | &btrfs_inode->runtime_flags); | |
eb73c1b7 | 4389 | spin_unlock(&root->delalloc_lock); |
acce952b | 4390 | |
4391 | btrfs_invalidate_inodes(btrfs_inode->root); | |
b216cbfb | 4392 | |
eb73c1b7 | 4393 | spin_lock(&root->delalloc_lock); |
acce952b | 4394 | } |
4395 | ||
eb73c1b7 MX |
4396 | spin_unlock(&root->delalloc_lock); |
4397 | } | |
4398 | ||
4399 | static void btrfs_destroy_all_delalloc_inodes(struct btrfs_fs_info *fs_info) | |
4400 | { | |
4401 | struct btrfs_root *root; | |
4402 | struct list_head splice; | |
4403 | ||
4404 | INIT_LIST_HEAD(&splice); | |
4405 | ||
4406 | spin_lock(&fs_info->delalloc_root_lock); | |
4407 | list_splice_init(&fs_info->delalloc_roots, &splice); | |
4408 | while (!list_empty(&splice)) { | |
4409 | root = list_first_entry(&splice, struct btrfs_root, | |
4410 | delalloc_root); | |
4411 | list_del_init(&root->delalloc_root); | |
4412 | root = btrfs_grab_fs_root(root); | |
4413 | BUG_ON(!root); | |
4414 | spin_unlock(&fs_info->delalloc_root_lock); | |
4415 | ||
4416 | btrfs_destroy_delalloc_inodes(root); | |
4417 | btrfs_put_fs_root(root); | |
4418 | ||
4419 | spin_lock(&fs_info->delalloc_root_lock); | |
4420 | } | |
4421 | spin_unlock(&fs_info->delalloc_root_lock); | |
acce952b | 4422 | } |
4423 | ||
4424 | static int btrfs_destroy_marked_extents(struct btrfs_root *root, | |
4425 | struct extent_io_tree *dirty_pages, | |
4426 | int mark) | |
4427 | { | |
4428 | int ret; | |
acce952b | 4429 | struct extent_buffer *eb; |
4430 | u64 start = 0; | |
4431 | u64 end; | |
acce952b | 4432 | |
4433 | while (1) { | |
4434 | ret = find_first_extent_bit(dirty_pages, start, &start, &end, | |
e6138876 | 4435 | mark, NULL); |
acce952b | 4436 | if (ret) |
4437 | break; | |
4438 | ||
91166212 | 4439 | clear_extent_bits(dirty_pages, start, end, mark); |
acce952b | 4440 | while (start <= end) { |
62d1f9fe | 4441 | eb = find_extent_buffer(root->fs_info, start); |
da17066c | 4442 | start += root->fs_info->nodesize; |
fd8b2b61 | 4443 | if (!eb) |
acce952b | 4444 | continue; |
fd8b2b61 | 4445 | wait_on_extent_buffer_writeback(eb); |
acce952b | 4446 | |
fd8b2b61 JB |
4447 | if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, |
4448 | &eb->bflags)) | |
4449 | clear_extent_buffer_dirty(eb); | |
4450 | free_extent_buffer_stale(eb); | |
acce952b | 4451 | } |
4452 | } | |
4453 | ||
4454 | return ret; | |
4455 | } | |
4456 | ||
4457 | static int btrfs_destroy_pinned_extent(struct btrfs_root *root, | |
4458 | struct extent_io_tree *pinned_extents) | |
4459 | { | |
4460 | struct extent_io_tree *unpin; | |
4461 | u64 start; | |
4462 | u64 end; | |
4463 | int ret; | |
ed0eaa14 | 4464 | bool loop = true; |
acce952b | 4465 | |
4466 | unpin = pinned_extents; | |
ed0eaa14 | 4467 | again: |
acce952b | 4468 | while (1) { |
4469 | ret = find_first_extent_bit(unpin, 0, &start, &end, | |
e6138876 | 4470 | EXTENT_DIRTY, NULL); |
acce952b | 4471 | if (ret) |
4472 | break; | |
4473 | ||
af6f8f60 | 4474 | clear_extent_dirty(unpin, start, end); |
acce952b | 4475 | btrfs_error_unpin_extent_range(root, start, end); |
4476 | cond_resched(); | |
4477 | } | |
4478 | ||
ed0eaa14 LB |
4479 | if (loop) { |
4480 | if (unpin == &root->fs_info->freed_extents[0]) | |
4481 | unpin = &root->fs_info->freed_extents[1]; | |
4482 | else | |
4483 | unpin = &root->fs_info->freed_extents[0]; | |
4484 | loop = false; | |
4485 | goto again; | |
4486 | } | |
4487 | ||
acce952b | 4488 | return 0; |
4489 | } | |
4490 | ||
c79a1751 LB |
4491 | static void btrfs_cleanup_bg_io(struct btrfs_block_group_cache *cache) |
4492 | { | |
4493 | struct inode *inode; | |
4494 | ||
4495 | inode = cache->io_ctl.inode; | |
4496 | if (inode) { | |
4497 | invalidate_inode_pages2(inode->i_mapping); | |
4498 | BTRFS_I(inode)->generation = 0; | |
4499 | cache->io_ctl.inode = NULL; | |
4500 | iput(inode); | |
4501 | } | |
4502 | btrfs_put_block_group(cache); | |
4503 | } | |
4504 | ||
4505 | void btrfs_cleanup_dirty_bgs(struct btrfs_transaction *cur_trans, | |
4506 | struct btrfs_root *root) | |
4507 | { | |
4508 | struct btrfs_block_group_cache *cache; | |
4509 | ||
4510 | spin_lock(&cur_trans->dirty_bgs_lock); | |
4511 | while (!list_empty(&cur_trans->dirty_bgs)) { | |
4512 | cache = list_first_entry(&cur_trans->dirty_bgs, | |
4513 | struct btrfs_block_group_cache, | |
4514 | dirty_list); | |
4515 | if (!cache) { | |
4516 | btrfs_err(root->fs_info, | |
4517 | "orphan block group dirty_bgs list"); | |
4518 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
4519 | return; | |
4520 | } | |
4521 | ||
4522 | if (!list_empty(&cache->io_list)) { | |
4523 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
4524 | list_del_init(&cache->io_list); | |
4525 | btrfs_cleanup_bg_io(cache); | |
4526 | spin_lock(&cur_trans->dirty_bgs_lock); | |
4527 | } | |
4528 | ||
4529 | list_del_init(&cache->dirty_list); | |
4530 | spin_lock(&cache->lock); | |
4531 | cache->disk_cache_state = BTRFS_DC_ERROR; | |
4532 | spin_unlock(&cache->lock); | |
4533 | ||
4534 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
4535 | btrfs_put_block_group(cache); | |
4536 | spin_lock(&cur_trans->dirty_bgs_lock); | |
4537 | } | |
4538 | spin_unlock(&cur_trans->dirty_bgs_lock); | |
4539 | ||
4540 | while (!list_empty(&cur_trans->io_bgs)) { | |
4541 | cache = list_first_entry(&cur_trans->io_bgs, | |
4542 | struct btrfs_block_group_cache, | |
4543 | io_list); | |
4544 | if (!cache) { | |
4545 | btrfs_err(root->fs_info, | |
4546 | "orphan block group on io_bgs list"); | |
4547 | return; | |
4548 | } | |
4549 | ||
4550 | list_del_init(&cache->io_list); | |
4551 | spin_lock(&cache->lock); | |
4552 | cache->disk_cache_state = BTRFS_DC_ERROR; | |
4553 | spin_unlock(&cache->lock); | |
4554 | btrfs_cleanup_bg_io(cache); | |
4555 | } | |
4556 | } | |
4557 | ||
49b25e05 JM |
4558 | void btrfs_cleanup_one_transaction(struct btrfs_transaction *cur_trans, |
4559 | struct btrfs_root *root) | |
4560 | { | |
c79a1751 LB |
4561 | btrfs_cleanup_dirty_bgs(cur_trans, root); |
4562 | ASSERT(list_empty(&cur_trans->dirty_bgs)); | |
4563 | ASSERT(list_empty(&cur_trans->io_bgs)); | |
4564 | ||
49b25e05 | 4565 | btrfs_destroy_delayed_refs(cur_trans, root); |
49b25e05 | 4566 | |
4a9d8bde | 4567 | cur_trans->state = TRANS_STATE_COMMIT_START; |
d7096fc3 | 4568 | wake_up(&root->fs_info->transaction_blocked_wait); |
49b25e05 | 4569 | |
4a9d8bde | 4570 | cur_trans->state = TRANS_STATE_UNBLOCKED; |
d7096fc3 | 4571 | wake_up(&root->fs_info->transaction_wait); |
49b25e05 | 4572 | |
67cde344 MX |
4573 | btrfs_destroy_delayed_inodes(root); |
4574 | btrfs_assert_delayed_root_empty(root); | |
49b25e05 | 4575 | |
49b25e05 JM |
4576 | btrfs_destroy_marked_extents(root, &cur_trans->dirty_pages, |
4577 | EXTENT_DIRTY); | |
6e841e32 LB |
4578 | btrfs_destroy_pinned_extent(root, |
4579 | root->fs_info->pinned_extents); | |
49b25e05 | 4580 | |
4a9d8bde MX |
4581 | cur_trans->state =TRANS_STATE_COMPLETED; |
4582 | wake_up(&cur_trans->commit_wait); | |
4583 | ||
49b25e05 JM |
4584 | /* |
4585 | memset(cur_trans, 0, sizeof(*cur_trans)); | |
4586 | kmem_cache_free(btrfs_transaction_cachep, cur_trans); | |
4587 | */ | |
4588 | } | |
4589 | ||
48a3b636 | 4590 | static int btrfs_cleanup_transaction(struct btrfs_root *root) |
acce952b | 4591 | { |
4592 | struct btrfs_transaction *t; | |
acce952b | 4593 | |
acce952b | 4594 | mutex_lock(&root->fs_info->transaction_kthread_mutex); |
4595 | ||
a4abeea4 | 4596 | spin_lock(&root->fs_info->trans_lock); |
724e2315 JB |
4597 | while (!list_empty(&root->fs_info->trans_list)) { |
4598 | t = list_first_entry(&root->fs_info->trans_list, | |
4599 | struct btrfs_transaction, list); | |
4600 | if (t->state >= TRANS_STATE_COMMIT_START) { | |
4601 | atomic_inc(&t->use_count); | |
4602 | spin_unlock(&root->fs_info->trans_lock); | |
4603 | btrfs_wait_for_commit(root, t->transid); | |
4604 | btrfs_put_transaction(t); | |
4605 | spin_lock(&root->fs_info->trans_lock); | |
4606 | continue; | |
4607 | } | |
4608 | if (t == root->fs_info->running_transaction) { | |
4609 | t->state = TRANS_STATE_COMMIT_DOING; | |
4610 | spin_unlock(&root->fs_info->trans_lock); | |
4611 | /* | |
4612 | * We wait for 0 num_writers since we don't hold a trans | |
4613 | * handle open currently for this transaction. | |
4614 | */ | |
4615 | wait_event(t->writer_wait, | |
4616 | atomic_read(&t->num_writers) == 0); | |
4617 | } else { | |
4618 | spin_unlock(&root->fs_info->trans_lock); | |
4619 | } | |
4620 | btrfs_cleanup_one_transaction(t, root); | |
4a9d8bde | 4621 | |
724e2315 JB |
4622 | spin_lock(&root->fs_info->trans_lock); |
4623 | if (t == root->fs_info->running_transaction) | |
4624 | root->fs_info->running_transaction = NULL; | |
acce952b | 4625 | list_del_init(&t->list); |
724e2315 | 4626 | spin_unlock(&root->fs_info->trans_lock); |
acce952b | 4627 | |
724e2315 JB |
4628 | btrfs_put_transaction(t); |
4629 | trace_btrfs_transaction_commit(root); | |
4630 | spin_lock(&root->fs_info->trans_lock); | |
4631 | } | |
4632 | spin_unlock(&root->fs_info->trans_lock); | |
4633 | btrfs_destroy_all_ordered_extents(root->fs_info); | |
4634 | btrfs_destroy_delayed_inodes(root); | |
4635 | btrfs_assert_delayed_root_empty(root); | |
4636 | btrfs_destroy_pinned_extent(root, root->fs_info->pinned_extents); | |
4637 | btrfs_destroy_all_delalloc_inodes(root->fs_info); | |
acce952b | 4638 | mutex_unlock(&root->fs_info->transaction_kthread_mutex); |
acce952b | 4639 | |
4640 | return 0; | |
4641 | } | |
4642 | ||
e8c9f186 | 4643 | static const struct extent_io_ops btree_extent_io_ops = { |
ce9adaa5 | 4644 | .readpage_end_io_hook = btree_readpage_end_io_hook, |
4bb31e92 | 4645 | .readpage_io_failed_hook = btree_io_failed_hook, |
0b86a832 | 4646 | .submit_bio_hook = btree_submit_bio_hook, |
239b14b3 CM |
4647 | /* note we're sharing with inode.c for the merge bio hook */ |
4648 | .merge_bio_hook = btrfs_merge_bio_hook, | |
0da5468f | 4649 | }; |