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