Loading...
1/*
2 * Copyright (C) 2007 Oracle. All rights reserved.
3 *
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
7 *
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
12 *
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
17 */
18
19#include <linux/fs.h>
20#include <linux/blkdev.h>
21#include <linux/scatterlist.h>
22#include <linux/swap.h>
23#include <linux/radix-tree.h>
24#include <linux/writeback.h>
25#include <linux/buffer_head.h>
26#include <linux/workqueue.h>
27#include <linux/kthread.h>
28#include <linux/freezer.h>
29#include <linux/slab.h>
30#include <linux/migrate.h>
31#include <linux/ratelimit.h>
32#include <linux/uuid.h>
33#include <linux/semaphore.h>
34#include <asm/unaligned.h>
35#include "ctree.h"
36#include "disk-io.h"
37#include "hash.h"
38#include "transaction.h"
39#include "btrfs_inode.h"
40#include "volumes.h"
41#include "print-tree.h"
42#include "async-thread.h"
43#include "locking.h"
44#include "tree-log.h"
45#include "free-space-cache.h"
46#include "inode-map.h"
47#include "check-integrity.h"
48#include "rcu-string.h"
49#include "dev-replace.h"
50#include "raid56.h"
51#include "sysfs.h"
52
53#ifdef CONFIG_X86
54#include <asm/cpufeature.h>
55#endif
56
57static struct extent_io_ops btree_extent_io_ops;
58static void end_workqueue_fn(struct btrfs_work *work);
59static void free_fs_root(struct btrfs_root *root);
60static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
61 int read_only);
62static void btrfs_destroy_ordered_operations(struct btrfs_transaction *t,
63 struct btrfs_root *root);
64static void btrfs_destroy_ordered_extents(struct btrfs_root *root);
65static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
66 struct btrfs_root *root);
67static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root);
68static int btrfs_destroy_marked_extents(struct btrfs_root *root,
69 struct extent_io_tree *dirty_pages,
70 int mark);
71static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
72 struct extent_io_tree *pinned_extents);
73static int btrfs_cleanup_transaction(struct btrfs_root *root);
74static void btrfs_error_commit_super(struct btrfs_root *root);
75
76/*
77 * end_io_wq structs are used to do processing in task context when an IO is
78 * complete. This is used during reads to verify checksums, and it is used
79 * by writes to insert metadata for new file extents after IO is complete.
80 */
81struct end_io_wq {
82 struct bio *bio;
83 bio_end_io_t *end_io;
84 void *private;
85 struct btrfs_fs_info *info;
86 int error;
87 int metadata;
88 struct list_head list;
89 struct btrfs_work work;
90};
91
92/*
93 * async submit bios are used to offload expensive checksumming
94 * onto the worker threads. They checksum file and metadata bios
95 * just before they are sent down the IO stack.
96 */
97struct async_submit_bio {
98 struct inode *inode;
99 struct bio *bio;
100 struct list_head list;
101 extent_submit_bio_hook_t *submit_bio_start;
102 extent_submit_bio_hook_t *submit_bio_done;
103 int rw;
104 int mirror_num;
105 unsigned long bio_flags;
106 /*
107 * bio_offset is optional, can be used if the pages in the bio
108 * can't tell us where in the file the bio should go
109 */
110 u64 bio_offset;
111 struct btrfs_work work;
112 int error;
113};
114
115/*
116 * Lockdep class keys for extent_buffer->lock's in this root. For a given
117 * eb, the lockdep key is determined by the btrfs_root it belongs to and
118 * the level the eb occupies in the tree.
119 *
120 * Different roots are used for different purposes and may nest inside each
121 * other and they require separate keysets. As lockdep keys should be
122 * static, assign keysets according to the purpose of the root as indicated
123 * by btrfs_root->objectid. This ensures that all special purpose roots
124 * have separate keysets.
125 *
126 * Lock-nesting across peer nodes is always done with the immediate parent
127 * node locked thus preventing deadlock. As lockdep doesn't know this, use
128 * subclass to avoid triggering lockdep warning in such cases.
129 *
130 * The key is set by the readpage_end_io_hook after the buffer has passed
131 * csum validation but before the pages are unlocked. It is also set by
132 * btrfs_init_new_buffer on freshly allocated blocks.
133 *
134 * We also add a check to make sure the highest level of the tree is the
135 * same as our lockdep setup here. If BTRFS_MAX_LEVEL changes, this code
136 * needs update as well.
137 */
138#ifdef CONFIG_DEBUG_LOCK_ALLOC
139# if BTRFS_MAX_LEVEL != 8
140# error
141# endif
142
143static struct btrfs_lockdep_keyset {
144 u64 id; /* root objectid */
145 const char *name_stem; /* lock name stem */
146 char names[BTRFS_MAX_LEVEL + 1][20];
147 struct lock_class_key keys[BTRFS_MAX_LEVEL + 1];
148} btrfs_lockdep_keysets[] = {
149 { .id = BTRFS_ROOT_TREE_OBJECTID, .name_stem = "root" },
150 { .id = BTRFS_EXTENT_TREE_OBJECTID, .name_stem = "extent" },
151 { .id = BTRFS_CHUNK_TREE_OBJECTID, .name_stem = "chunk" },
152 { .id = BTRFS_DEV_TREE_OBJECTID, .name_stem = "dev" },
153 { .id = BTRFS_FS_TREE_OBJECTID, .name_stem = "fs" },
154 { .id = BTRFS_CSUM_TREE_OBJECTID, .name_stem = "csum" },
155 { .id = BTRFS_QUOTA_TREE_OBJECTID, .name_stem = "quota" },
156 { .id = BTRFS_TREE_LOG_OBJECTID, .name_stem = "log" },
157 { .id = BTRFS_TREE_RELOC_OBJECTID, .name_stem = "treloc" },
158 { .id = BTRFS_DATA_RELOC_TREE_OBJECTID, .name_stem = "dreloc" },
159 { .id = BTRFS_UUID_TREE_OBJECTID, .name_stem = "uuid" },
160 { .id = 0, .name_stem = "tree" },
161};
162
163void __init btrfs_init_lockdep(void)
164{
165 int i, j;
166
167 /* initialize lockdep class names */
168 for (i = 0; i < ARRAY_SIZE(btrfs_lockdep_keysets); i++) {
169 struct btrfs_lockdep_keyset *ks = &btrfs_lockdep_keysets[i];
170
171 for (j = 0; j < ARRAY_SIZE(ks->names); j++)
172 snprintf(ks->names[j], sizeof(ks->names[j]),
173 "btrfs-%s-%02d", ks->name_stem, j);
174 }
175}
176
177void btrfs_set_buffer_lockdep_class(u64 objectid, struct extent_buffer *eb,
178 int level)
179{
180 struct btrfs_lockdep_keyset *ks;
181
182 BUG_ON(level >= ARRAY_SIZE(ks->keys));
183
184 /* find the matching keyset, id 0 is the default entry */
185 for (ks = btrfs_lockdep_keysets; ks->id; ks++)
186 if (ks->id == objectid)
187 break;
188
189 lockdep_set_class_and_name(&eb->lock,
190 &ks->keys[level], ks->names[level]);
191}
192
193#endif
194
195/*
196 * extents on the btree inode are pretty simple, there's one extent
197 * that covers the entire device
198 */
199static struct extent_map *btree_get_extent(struct inode *inode,
200 struct page *page, size_t pg_offset, u64 start, u64 len,
201 int create)
202{
203 struct extent_map_tree *em_tree = &BTRFS_I(inode)->extent_tree;
204 struct extent_map *em;
205 int ret;
206
207 read_lock(&em_tree->lock);
208 em = lookup_extent_mapping(em_tree, start, len);
209 if (em) {
210 em->bdev =
211 BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
212 read_unlock(&em_tree->lock);
213 goto out;
214 }
215 read_unlock(&em_tree->lock);
216
217 em = alloc_extent_map();
218 if (!em) {
219 em = ERR_PTR(-ENOMEM);
220 goto out;
221 }
222 em->start = 0;
223 em->len = (u64)-1;
224 em->block_len = (u64)-1;
225 em->block_start = 0;
226 em->bdev = BTRFS_I(inode)->root->fs_info->fs_devices->latest_bdev;
227
228 write_lock(&em_tree->lock);
229 ret = add_extent_mapping(em_tree, em, 0);
230 if (ret == -EEXIST) {
231 free_extent_map(em);
232 em = lookup_extent_mapping(em_tree, start, len);
233 if (!em)
234 em = ERR_PTR(-EIO);
235 } else if (ret) {
236 free_extent_map(em);
237 em = ERR_PTR(ret);
238 }
239 write_unlock(&em_tree->lock);
240
241out:
242 return em;
243}
244
245u32 btrfs_csum_data(char *data, u32 seed, size_t len)
246{
247 return btrfs_crc32c(seed, data, len);
248}
249
250void btrfs_csum_final(u32 crc, char *result)
251{
252 put_unaligned_le32(~crc, result);
253}
254
255/*
256 * compute the csum for a btree block, and either verify it or write it
257 * into the csum field of the block.
258 */
259static int csum_tree_block(struct btrfs_root *root, struct extent_buffer *buf,
260 int verify)
261{
262 u16 csum_size = btrfs_super_csum_size(root->fs_info->super_copy);
263 char *result = NULL;
264 unsigned long len;
265 unsigned long cur_len;
266 unsigned long offset = BTRFS_CSUM_SIZE;
267 char *kaddr;
268 unsigned long map_start;
269 unsigned long map_len;
270 int err;
271 u32 crc = ~(u32)0;
272 unsigned long inline_result;
273
274 len = buf->len - offset;
275 while (len > 0) {
276 err = map_private_extent_buffer(buf, offset, 32,
277 &kaddr, &map_start, &map_len);
278 if (err)
279 return 1;
280 cur_len = min(len, map_len - (offset - map_start));
281 crc = btrfs_csum_data(kaddr + offset - map_start,
282 crc, cur_len);
283 len -= cur_len;
284 offset += cur_len;
285 }
286 if (csum_size > sizeof(inline_result)) {
287 result = kzalloc(csum_size * sizeof(char), GFP_NOFS);
288 if (!result)
289 return 1;
290 } else {
291 result = (char *)&inline_result;
292 }
293
294 btrfs_csum_final(crc, result);
295
296 if (verify) {
297 if (memcmp_extent_buffer(buf, result, 0, csum_size)) {
298 u32 val;
299 u32 found = 0;
300 memcpy(&found, result, csum_size);
301
302 read_extent_buffer(buf, &val, 0, csum_size);
303 printk_ratelimited(KERN_INFO
304 "BTRFS: %s checksum verify failed on %llu wanted %X found %X "
305 "level %d\n",
306 root->fs_info->sb->s_id, buf->start,
307 val, found, btrfs_header_level(buf));
308 if (result != (char *)&inline_result)
309 kfree(result);
310 return 1;
311 }
312 } else {
313 write_extent_buffer(buf, result, 0, csum_size);
314 }
315 if (result != (char *)&inline_result)
316 kfree(result);
317 return 0;
318}
319
320/*
321 * we can't consider a given block up to date unless the transid of the
322 * block matches the transid in the parent node's pointer. This is how we
323 * detect blocks that either didn't get written at all or got written
324 * in the wrong place.
325 */
326static int verify_parent_transid(struct extent_io_tree *io_tree,
327 struct extent_buffer *eb, u64 parent_transid,
328 int atomic)
329{
330 struct extent_state *cached_state = NULL;
331 int ret;
332 bool need_lock = (current->journal_info ==
333 (void *)BTRFS_SEND_TRANS_STUB);
334
335 if (!parent_transid || btrfs_header_generation(eb) == parent_transid)
336 return 0;
337
338 if (atomic)
339 return -EAGAIN;
340
341 if (need_lock) {
342 btrfs_tree_read_lock(eb);
343 btrfs_set_lock_blocking_rw(eb, BTRFS_READ_LOCK);
344 }
345
346 lock_extent_bits(io_tree, eb->start, eb->start + eb->len - 1,
347 0, &cached_state);
348 if (extent_buffer_uptodate(eb) &&
349 btrfs_header_generation(eb) == parent_transid) {
350 ret = 0;
351 goto out;
352 }
353 printk_ratelimited("parent transid verify failed on %llu wanted %llu "
354 "found %llu\n",
355 eb->start, parent_transid, btrfs_header_generation(eb));
356 ret = 1;
357
358 /*
359 * Things reading via commit roots that don't have normal protection,
360 * like send, can have a really old block in cache that may point at a
361 * block that has been free'd and re-allocated. So don't clear uptodate
362 * if we find an eb that is under IO (dirty/writeback) because we could
363 * end up reading in the stale data and then writing it back out and
364 * making everybody very sad.
365 */
366 if (!extent_buffer_under_io(eb))
367 clear_extent_buffer_uptodate(eb);
368out:
369 unlock_extent_cached(io_tree, eb->start, eb->start + eb->len - 1,
370 &cached_state, GFP_NOFS);
371 btrfs_tree_read_unlock_blocking(eb);
372 return ret;
373}
374
375/*
376 * Return 0 if the superblock checksum type matches the checksum value of that
377 * algorithm. Pass the raw disk superblock data.
378 */
379static int btrfs_check_super_csum(char *raw_disk_sb)
380{
381 struct btrfs_super_block *disk_sb =
382 (struct btrfs_super_block *)raw_disk_sb;
383 u16 csum_type = btrfs_super_csum_type(disk_sb);
384 int ret = 0;
385
386 if (csum_type == BTRFS_CSUM_TYPE_CRC32) {
387 u32 crc = ~(u32)0;
388 const int csum_size = sizeof(crc);
389 char result[csum_size];
390
391 /*
392 * The super_block structure does not span the whole
393 * BTRFS_SUPER_INFO_SIZE range, we expect that the unused space
394 * is filled with zeros and is included in the checkum.
395 */
396 crc = btrfs_csum_data(raw_disk_sb + BTRFS_CSUM_SIZE,
397 crc, BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE);
398 btrfs_csum_final(crc, result);
399
400 if (memcmp(raw_disk_sb, result, csum_size))
401 ret = 1;
402
403 if (ret && btrfs_super_generation(disk_sb) < 10) {
404 printk(KERN_WARNING
405 "BTRFS: super block crcs don't match, older mkfs detected\n");
406 ret = 0;
407 }
408 }
409
410 if (csum_type >= ARRAY_SIZE(btrfs_csum_sizes)) {
411 printk(KERN_ERR "BTRFS: unsupported checksum algorithm %u\n",
412 csum_type);
413 ret = 1;
414 }
415
416 return ret;
417}
418
419/*
420 * helper to read a given tree block, doing retries as required when
421 * the checksums don't match and we have alternate mirrors to try.
422 */
423static int btree_read_extent_buffer_pages(struct btrfs_root *root,
424 struct extent_buffer *eb,
425 u64 start, u64 parent_transid)
426{
427 struct extent_io_tree *io_tree;
428 int failed = 0;
429 int ret;
430 int num_copies = 0;
431 int mirror_num = 0;
432 int failed_mirror = 0;
433
434 clear_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
435 io_tree = &BTRFS_I(root->fs_info->btree_inode)->io_tree;
436 while (1) {
437 ret = read_extent_buffer_pages(io_tree, eb, start,
438 WAIT_COMPLETE,
439 btree_get_extent, mirror_num);
440 if (!ret) {
441 if (!verify_parent_transid(io_tree, eb,
442 parent_transid, 0))
443 break;
444 else
445 ret = -EIO;
446 }
447
448 /*
449 * This buffer's crc is fine, but its contents are corrupted, so
450 * there is no reason to read the other copies, they won't be
451 * any less wrong.
452 */
453 if (test_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags))
454 break;
455
456 num_copies = btrfs_num_copies(root->fs_info,
457 eb->start, eb->len);
458 if (num_copies == 1)
459 break;
460
461 if (!failed_mirror) {
462 failed = 1;
463 failed_mirror = eb->read_mirror;
464 }
465
466 mirror_num++;
467 if (mirror_num == failed_mirror)
468 mirror_num++;
469
470 if (mirror_num > num_copies)
471 break;
472 }
473
474 if (failed && !ret && failed_mirror)
475 repair_eb_io_failure(root, eb, failed_mirror);
476
477 return ret;
478}
479
480/*
481 * checksum a dirty tree block before IO. This has extra checks to make sure
482 * we only fill in the checksum field in the first page of a multi-page block
483 */
484
485static int csum_dirty_buffer(struct btrfs_root *root, struct page *page)
486{
487 u64 start = page_offset(page);
488 u64 found_start;
489 struct extent_buffer *eb;
490
491 eb = (struct extent_buffer *)page->private;
492 if (page != eb->pages[0])
493 return 0;
494 found_start = btrfs_header_bytenr(eb);
495 if (WARN_ON(found_start != start || !PageUptodate(page)))
496 return 0;
497 csum_tree_block(root, eb, 0);
498 return 0;
499}
500
501static int check_tree_block_fsid(struct btrfs_root *root,
502 struct extent_buffer *eb)
503{
504 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
505 u8 fsid[BTRFS_UUID_SIZE];
506 int ret = 1;
507
508 read_extent_buffer(eb, fsid, btrfs_header_fsid(), BTRFS_FSID_SIZE);
509 while (fs_devices) {
510 if (!memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE)) {
511 ret = 0;
512 break;
513 }
514 fs_devices = fs_devices->seed;
515 }
516 return ret;
517}
518
519#define CORRUPT(reason, eb, root, slot) \
520 btrfs_crit(root->fs_info, "corrupt leaf, %s: block=%llu," \
521 "root=%llu, slot=%d", reason, \
522 btrfs_header_bytenr(eb), root->objectid, slot)
523
524static noinline int check_leaf(struct btrfs_root *root,
525 struct extent_buffer *leaf)
526{
527 struct btrfs_key key;
528 struct btrfs_key leaf_key;
529 u32 nritems = btrfs_header_nritems(leaf);
530 int slot;
531
532 if (nritems == 0)
533 return 0;
534
535 /* Check the 0 item */
536 if (btrfs_item_offset_nr(leaf, 0) + btrfs_item_size_nr(leaf, 0) !=
537 BTRFS_LEAF_DATA_SIZE(root)) {
538 CORRUPT("invalid item offset size pair", leaf, root, 0);
539 return -EIO;
540 }
541
542 /*
543 * Check to make sure each items keys are in the correct order and their
544 * offsets make sense. We only have to loop through nritems-1 because
545 * we check the current slot against the next slot, which verifies the
546 * next slot's offset+size makes sense and that the current's slot
547 * offset is correct.
548 */
549 for (slot = 0; slot < nritems - 1; slot++) {
550 btrfs_item_key_to_cpu(leaf, &leaf_key, slot);
551 btrfs_item_key_to_cpu(leaf, &key, slot + 1);
552
553 /* Make sure the keys are in the right order */
554 if (btrfs_comp_cpu_keys(&leaf_key, &key) >= 0) {
555 CORRUPT("bad key order", leaf, root, slot);
556 return -EIO;
557 }
558
559 /*
560 * Make sure the offset and ends are right, remember that the
561 * item data starts at the end of the leaf and grows towards the
562 * front.
563 */
564 if (btrfs_item_offset_nr(leaf, slot) !=
565 btrfs_item_end_nr(leaf, slot + 1)) {
566 CORRUPT("slot offset bad", leaf, root, slot);
567 return -EIO;
568 }
569
570 /*
571 * Check to make sure that we don't point outside of the leaf,
572 * just incase all the items are consistent to eachother, but
573 * all point outside of the leaf.
574 */
575 if (btrfs_item_end_nr(leaf, slot) >
576 BTRFS_LEAF_DATA_SIZE(root)) {
577 CORRUPT("slot end outside of leaf", leaf, root, slot);
578 return -EIO;
579 }
580 }
581
582 return 0;
583}
584
585static int btree_readpage_end_io_hook(struct btrfs_io_bio *io_bio,
586 u64 phy_offset, struct page *page,
587 u64 start, u64 end, int mirror)
588{
589 u64 found_start;
590 int found_level;
591 struct extent_buffer *eb;
592 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
593 int ret = 0;
594 int reads_done;
595
596 if (!page->private)
597 goto out;
598
599 eb = (struct extent_buffer *)page->private;
600
601 /* the pending IO might have been the only thing that kept this buffer
602 * in memory. Make sure we have a ref for all this other checks
603 */
604 extent_buffer_get(eb);
605
606 reads_done = atomic_dec_and_test(&eb->io_pages);
607 if (!reads_done)
608 goto err;
609
610 eb->read_mirror = mirror;
611 if (test_bit(EXTENT_BUFFER_IOERR, &eb->bflags)) {
612 ret = -EIO;
613 goto err;
614 }
615
616 found_start = btrfs_header_bytenr(eb);
617 if (found_start != eb->start) {
618 printk_ratelimited(KERN_INFO "BTRFS: bad tree block start "
619 "%llu %llu\n",
620 found_start, eb->start);
621 ret = -EIO;
622 goto err;
623 }
624 if (check_tree_block_fsid(root, eb)) {
625 printk_ratelimited(KERN_INFO "BTRFS: bad fsid on block %llu\n",
626 eb->start);
627 ret = -EIO;
628 goto err;
629 }
630 found_level = btrfs_header_level(eb);
631 if (found_level >= BTRFS_MAX_LEVEL) {
632 btrfs_info(root->fs_info, "bad tree block level %d",
633 (int)btrfs_header_level(eb));
634 ret = -EIO;
635 goto err;
636 }
637
638 btrfs_set_buffer_lockdep_class(btrfs_header_owner(eb),
639 eb, found_level);
640
641 ret = csum_tree_block(root, eb, 1);
642 if (ret) {
643 ret = -EIO;
644 goto err;
645 }
646
647 /*
648 * If this is a leaf block and it is corrupt, set the corrupt bit so
649 * that we don't try and read the other copies of this block, just
650 * return -EIO.
651 */
652 if (found_level == 0 && check_leaf(root, eb)) {
653 set_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
654 ret = -EIO;
655 }
656
657 if (!ret)
658 set_extent_buffer_uptodate(eb);
659err:
660 if (reads_done &&
661 test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags))
662 btree_readahead_hook(root, eb, eb->start, ret);
663
664 if (ret) {
665 /*
666 * our io error hook is going to dec the io pages
667 * again, we have to make sure it has something
668 * to decrement
669 */
670 atomic_inc(&eb->io_pages);
671 clear_extent_buffer_uptodate(eb);
672 }
673 free_extent_buffer(eb);
674out:
675 return ret;
676}
677
678static int btree_io_failed_hook(struct page *page, int failed_mirror)
679{
680 struct extent_buffer *eb;
681 struct btrfs_root *root = BTRFS_I(page->mapping->host)->root;
682
683 eb = (struct extent_buffer *)page->private;
684 set_bit(EXTENT_BUFFER_IOERR, &eb->bflags);
685 eb->read_mirror = failed_mirror;
686 atomic_dec(&eb->io_pages);
687 if (test_and_clear_bit(EXTENT_BUFFER_READAHEAD, &eb->bflags))
688 btree_readahead_hook(root, eb, eb->start, -EIO);
689 return -EIO; /* we fixed nothing */
690}
691
692static void end_workqueue_bio(struct bio *bio, int err)
693{
694 struct end_io_wq *end_io_wq = bio->bi_private;
695 struct btrfs_fs_info *fs_info;
696
697 fs_info = end_io_wq->info;
698 end_io_wq->error = err;
699 btrfs_init_work(&end_io_wq->work, end_workqueue_fn, NULL, NULL);
700
701 if (bio->bi_rw & REQ_WRITE) {
702 if (end_io_wq->metadata == BTRFS_WQ_ENDIO_METADATA)
703 btrfs_queue_work(fs_info->endio_meta_write_workers,
704 &end_io_wq->work);
705 else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_FREE_SPACE)
706 btrfs_queue_work(fs_info->endio_freespace_worker,
707 &end_io_wq->work);
708 else if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56)
709 btrfs_queue_work(fs_info->endio_raid56_workers,
710 &end_io_wq->work);
711 else
712 btrfs_queue_work(fs_info->endio_write_workers,
713 &end_io_wq->work);
714 } else {
715 if (end_io_wq->metadata == BTRFS_WQ_ENDIO_RAID56)
716 btrfs_queue_work(fs_info->endio_raid56_workers,
717 &end_io_wq->work);
718 else if (end_io_wq->metadata)
719 btrfs_queue_work(fs_info->endio_meta_workers,
720 &end_io_wq->work);
721 else
722 btrfs_queue_work(fs_info->endio_workers,
723 &end_io_wq->work);
724 }
725}
726
727/*
728 * For the metadata arg you want
729 *
730 * 0 - if data
731 * 1 - if normal metadta
732 * 2 - if writing to the free space cache area
733 * 3 - raid parity work
734 */
735int btrfs_bio_wq_end_io(struct btrfs_fs_info *info, struct bio *bio,
736 int metadata)
737{
738 struct end_io_wq *end_io_wq;
739 end_io_wq = kmalloc(sizeof(*end_io_wq), GFP_NOFS);
740 if (!end_io_wq)
741 return -ENOMEM;
742
743 end_io_wq->private = bio->bi_private;
744 end_io_wq->end_io = bio->bi_end_io;
745 end_io_wq->info = info;
746 end_io_wq->error = 0;
747 end_io_wq->bio = bio;
748 end_io_wq->metadata = metadata;
749
750 bio->bi_private = end_io_wq;
751 bio->bi_end_io = end_workqueue_bio;
752 return 0;
753}
754
755unsigned long btrfs_async_submit_limit(struct btrfs_fs_info *info)
756{
757 unsigned long limit = min_t(unsigned long,
758 info->thread_pool_size,
759 info->fs_devices->open_devices);
760 return 256 * limit;
761}
762
763static void run_one_async_start(struct btrfs_work *work)
764{
765 struct async_submit_bio *async;
766 int ret;
767
768 async = container_of(work, struct async_submit_bio, work);
769 ret = async->submit_bio_start(async->inode, async->rw, async->bio,
770 async->mirror_num, async->bio_flags,
771 async->bio_offset);
772 if (ret)
773 async->error = ret;
774}
775
776static void run_one_async_done(struct btrfs_work *work)
777{
778 struct btrfs_fs_info *fs_info;
779 struct async_submit_bio *async;
780 int limit;
781
782 async = container_of(work, struct async_submit_bio, work);
783 fs_info = BTRFS_I(async->inode)->root->fs_info;
784
785 limit = btrfs_async_submit_limit(fs_info);
786 limit = limit * 2 / 3;
787
788 if (atomic_dec_return(&fs_info->nr_async_submits) < limit &&
789 waitqueue_active(&fs_info->async_submit_wait))
790 wake_up(&fs_info->async_submit_wait);
791
792 /* If an error occured we just want to clean up the bio and move on */
793 if (async->error) {
794 bio_endio(async->bio, async->error);
795 return;
796 }
797
798 async->submit_bio_done(async->inode, async->rw, async->bio,
799 async->mirror_num, async->bio_flags,
800 async->bio_offset);
801}
802
803static void run_one_async_free(struct btrfs_work *work)
804{
805 struct async_submit_bio *async;
806
807 async = container_of(work, struct async_submit_bio, work);
808 kfree(async);
809}
810
811int btrfs_wq_submit_bio(struct btrfs_fs_info *fs_info, struct inode *inode,
812 int rw, struct bio *bio, int mirror_num,
813 unsigned long bio_flags,
814 u64 bio_offset,
815 extent_submit_bio_hook_t *submit_bio_start,
816 extent_submit_bio_hook_t *submit_bio_done)
817{
818 struct async_submit_bio *async;
819
820 async = kmalloc(sizeof(*async), GFP_NOFS);
821 if (!async)
822 return -ENOMEM;
823
824 async->inode = inode;
825 async->rw = rw;
826 async->bio = bio;
827 async->mirror_num = mirror_num;
828 async->submit_bio_start = submit_bio_start;
829 async->submit_bio_done = submit_bio_done;
830
831 btrfs_init_work(&async->work, run_one_async_start,
832 run_one_async_done, run_one_async_free);
833
834 async->bio_flags = bio_flags;
835 async->bio_offset = bio_offset;
836
837 async->error = 0;
838
839 atomic_inc(&fs_info->nr_async_submits);
840
841 if (rw & REQ_SYNC)
842 btrfs_set_work_high_priority(&async->work);
843
844 btrfs_queue_work(fs_info->workers, &async->work);
845
846 while (atomic_read(&fs_info->async_submit_draining) &&
847 atomic_read(&fs_info->nr_async_submits)) {
848 wait_event(fs_info->async_submit_wait,
849 (atomic_read(&fs_info->nr_async_submits) == 0));
850 }
851
852 return 0;
853}
854
855static int btree_csum_one_bio(struct bio *bio)
856{
857 struct bio_vec *bvec;
858 struct btrfs_root *root;
859 int i, ret = 0;
860
861 bio_for_each_segment_all(bvec, bio, i) {
862 root = BTRFS_I(bvec->bv_page->mapping->host)->root;
863 ret = csum_dirty_buffer(root, bvec->bv_page);
864 if (ret)
865 break;
866 }
867
868 return ret;
869}
870
871static int __btree_submit_bio_start(struct inode *inode, int rw,
872 struct bio *bio, int mirror_num,
873 unsigned long bio_flags,
874 u64 bio_offset)
875{
876 /*
877 * when we're called for a write, we're already in the async
878 * submission context. Just jump into btrfs_map_bio
879 */
880 return btree_csum_one_bio(bio);
881}
882
883static int __btree_submit_bio_done(struct inode *inode, int rw, struct bio *bio,
884 int mirror_num, unsigned long bio_flags,
885 u64 bio_offset)
886{
887 int ret;
888
889 /*
890 * when we're called for a write, we're already in the async
891 * submission context. Just jump into btrfs_map_bio
892 */
893 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio, mirror_num, 1);
894 if (ret)
895 bio_endio(bio, ret);
896 return ret;
897}
898
899static int check_async_write(struct inode *inode, unsigned long bio_flags)
900{
901 if (bio_flags & EXTENT_BIO_TREE_LOG)
902 return 0;
903#ifdef CONFIG_X86
904 if (cpu_has_xmm4_2)
905 return 0;
906#endif
907 return 1;
908}
909
910static int btree_submit_bio_hook(struct inode *inode, int rw, struct bio *bio,
911 int mirror_num, unsigned long bio_flags,
912 u64 bio_offset)
913{
914 int async = check_async_write(inode, bio_flags);
915 int ret;
916
917 if (!(rw & REQ_WRITE)) {
918 /*
919 * called for a read, do the setup so that checksum validation
920 * can happen in the async kernel threads
921 */
922 ret = btrfs_bio_wq_end_io(BTRFS_I(inode)->root->fs_info,
923 bio, 1);
924 if (ret)
925 goto out_w_error;
926 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
927 mirror_num, 0);
928 } else if (!async) {
929 ret = btree_csum_one_bio(bio);
930 if (ret)
931 goto out_w_error;
932 ret = btrfs_map_bio(BTRFS_I(inode)->root, rw, bio,
933 mirror_num, 0);
934 } else {
935 /*
936 * kthread helpers are used to submit writes so that
937 * checksumming can happen in parallel across all CPUs
938 */
939 ret = btrfs_wq_submit_bio(BTRFS_I(inode)->root->fs_info,
940 inode, rw, bio, mirror_num, 0,
941 bio_offset,
942 __btree_submit_bio_start,
943 __btree_submit_bio_done);
944 }
945
946 if (ret) {
947out_w_error:
948 bio_endio(bio, ret);
949 }
950 return ret;
951}
952
953#ifdef CONFIG_MIGRATION
954static int btree_migratepage(struct address_space *mapping,
955 struct page *newpage, struct page *page,
956 enum migrate_mode mode)
957{
958 /*
959 * we can't safely write a btree page from here,
960 * we haven't done the locking hook
961 */
962 if (PageDirty(page))
963 return -EAGAIN;
964 /*
965 * Buffers may be managed in a filesystem specific way.
966 * We must have no buffers or drop them.
967 */
968 if (page_has_private(page) &&
969 !try_to_release_page(page, GFP_KERNEL))
970 return -EAGAIN;
971 return migrate_page(mapping, newpage, page, mode);
972}
973#endif
974
975
976static int btree_writepages(struct address_space *mapping,
977 struct writeback_control *wbc)
978{
979 struct btrfs_fs_info *fs_info;
980 int ret;
981
982 if (wbc->sync_mode == WB_SYNC_NONE) {
983
984 if (wbc->for_kupdate)
985 return 0;
986
987 fs_info = BTRFS_I(mapping->host)->root->fs_info;
988 /* this is a bit racy, but that's ok */
989 ret = percpu_counter_compare(&fs_info->dirty_metadata_bytes,
990 BTRFS_DIRTY_METADATA_THRESH);
991 if (ret < 0)
992 return 0;
993 }
994 return btree_write_cache_pages(mapping, wbc);
995}
996
997static int btree_readpage(struct file *file, struct page *page)
998{
999 struct extent_io_tree *tree;
1000 tree = &BTRFS_I(page->mapping->host)->io_tree;
1001 return extent_read_full_page(tree, page, btree_get_extent, 0);
1002}
1003
1004static int btree_releasepage(struct page *page, gfp_t gfp_flags)
1005{
1006 if (PageWriteback(page) || PageDirty(page))
1007 return 0;
1008
1009 return try_release_extent_buffer(page);
1010}
1011
1012static void btree_invalidatepage(struct page *page, unsigned int offset,
1013 unsigned int length)
1014{
1015 struct extent_io_tree *tree;
1016 tree = &BTRFS_I(page->mapping->host)->io_tree;
1017 extent_invalidatepage(tree, page, offset);
1018 btree_releasepage(page, GFP_NOFS);
1019 if (PagePrivate(page)) {
1020 btrfs_warn(BTRFS_I(page->mapping->host)->root->fs_info,
1021 "page private not zero on page %llu",
1022 (unsigned long long)page_offset(page));
1023 ClearPagePrivate(page);
1024 set_page_private(page, 0);
1025 page_cache_release(page);
1026 }
1027}
1028
1029static int btree_set_page_dirty(struct page *page)
1030{
1031#ifdef DEBUG
1032 struct extent_buffer *eb;
1033
1034 BUG_ON(!PagePrivate(page));
1035 eb = (struct extent_buffer *)page->private;
1036 BUG_ON(!eb);
1037 BUG_ON(!test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
1038 BUG_ON(!atomic_read(&eb->refs));
1039 btrfs_assert_tree_locked(eb);
1040#endif
1041 return __set_page_dirty_nobuffers(page);
1042}
1043
1044static const struct address_space_operations btree_aops = {
1045 .readpage = btree_readpage,
1046 .writepages = btree_writepages,
1047 .releasepage = btree_releasepage,
1048 .invalidatepage = btree_invalidatepage,
1049#ifdef CONFIG_MIGRATION
1050 .migratepage = btree_migratepage,
1051#endif
1052 .set_page_dirty = btree_set_page_dirty,
1053};
1054
1055int readahead_tree_block(struct btrfs_root *root, u64 bytenr, u32 blocksize,
1056 u64 parent_transid)
1057{
1058 struct extent_buffer *buf = NULL;
1059 struct inode *btree_inode = root->fs_info->btree_inode;
1060 int ret = 0;
1061
1062 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1063 if (!buf)
1064 return 0;
1065 read_extent_buffer_pages(&BTRFS_I(btree_inode)->io_tree,
1066 buf, 0, WAIT_NONE, btree_get_extent, 0);
1067 free_extent_buffer(buf);
1068 return ret;
1069}
1070
1071int reada_tree_block_flagged(struct btrfs_root *root, u64 bytenr, u32 blocksize,
1072 int mirror_num, struct extent_buffer **eb)
1073{
1074 struct extent_buffer *buf = NULL;
1075 struct inode *btree_inode = root->fs_info->btree_inode;
1076 struct extent_io_tree *io_tree = &BTRFS_I(btree_inode)->io_tree;
1077 int ret;
1078
1079 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1080 if (!buf)
1081 return 0;
1082
1083 set_bit(EXTENT_BUFFER_READAHEAD, &buf->bflags);
1084
1085 ret = read_extent_buffer_pages(io_tree, buf, 0, WAIT_PAGE_LOCK,
1086 btree_get_extent, mirror_num);
1087 if (ret) {
1088 free_extent_buffer(buf);
1089 return ret;
1090 }
1091
1092 if (test_bit(EXTENT_BUFFER_CORRUPT, &buf->bflags)) {
1093 free_extent_buffer(buf);
1094 return -EIO;
1095 } else if (extent_buffer_uptodate(buf)) {
1096 *eb = buf;
1097 } else {
1098 free_extent_buffer(buf);
1099 }
1100 return 0;
1101}
1102
1103struct extent_buffer *btrfs_find_tree_block(struct btrfs_root *root,
1104 u64 bytenr, u32 blocksize)
1105{
1106 return find_extent_buffer(root->fs_info, bytenr);
1107}
1108
1109struct extent_buffer *btrfs_find_create_tree_block(struct btrfs_root *root,
1110 u64 bytenr, u32 blocksize)
1111{
1112 return alloc_extent_buffer(root->fs_info, bytenr, blocksize);
1113}
1114
1115
1116int btrfs_write_tree_block(struct extent_buffer *buf)
1117{
1118 return filemap_fdatawrite_range(buf->pages[0]->mapping, buf->start,
1119 buf->start + buf->len - 1);
1120}
1121
1122int btrfs_wait_tree_block_writeback(struct extent_buffer *buf)
1123{
1124 return filemap_fdatawait_range(buf->pages[0]->mapping,
1125 buf->start, buf->start + buf->len - 1);
1126}
1127
1128struct extent_buffer *read_tree_block(struct btrfs_root *root, u64 bytenr,
1129 u32 blocksize, u64 parent_transid)
1130{
1131 struct extent_buffer *buf = NULL;
1132 int ret;
1133
1134 buf = btrfs_find_create_tree_block(root, bytenr, blocksize);
1135 if (!buf)
1136 return NULL;
1137
1138 ret = btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
1139 if (ret) {
1140 free_extent_buffer(buf);
1141 return NULL;
1142 }
1143 return buf;
1144
1145}
1146
1147void clean_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root,
1148 struct extent_buffer *buf)
1149{
1150 struct btrfs_fs_info *fs_info = root->fs_info;
1151
1152 if (btrfs_header_generation(buf) ==
1153 fs_info->running_transaction->transid) {
1154 btrfs_assert_tree_locked(buf);
1155
1156 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY, &buf->bflags)) {
1157 __percpu_counter_add(&fs_info->dirty_metadata_bytes,
1158 -buf->len,
1159 fs_info->dirty_metadata_batch);
1160 /* ugh, clear_extent_buffer_dirty needs to lock the page */
1161 btrfs_set_lock_blocking(buf);
1162 clear_extent_buffer_dirty(buf);
1163 }
1164 }
1165}
1166
1167static struct btrfs_subvolume_writers *btrfs_alloc_subvolume_writers(void)
1168{
1169 struct btrfs_subvolume_writers *writers;
1170 int ret;
1171
1172 writers = kmalloc(sizeof(*writers), GFP_NOFS);
1173 if (!writers)
1174 return ERR_PTR(-ENOMEM);
1175
1176 ret = percpu_counter_init(&writers->counter, 0);
1177 if (ret < 0) {
1178 kfree(writers);
1179 return ERR_PTR(ret);
1180 }
1181
1182 init_waitqueue_head(&writers->wait);
1183 return writers;
1184}
1185
1186static void
1187btrfs_free_subvolume_writers(struct btrfs_subvolume_writers *writers)
1188{
1189 percpu_counter_destroy(&writers->counter);
1190 kfree(writers);
1191}
1192
1193static void __setup_root(u32 nodesize, u32 leafsize, u32 sectorsize,
1194 u32 stripesize, struct btrfs_root *root,
1195 struct btrfs_fs_info *fs_info,
1196 u64 objectid)
1197{
1198 root->node = NULL;
1199 root->commit_root = NULL;
1200 root->sectorsize = sectorsize;
1201 root->nodesize = nodesize;
1202 root->leafsize = leafsize;
1203 root->stripesize = stripesize;
1204 root->ref_cows = 0;
1205 root->track_dirty = 0;
1206 root->in_radix = 0;
1207 root->orphan_item_inserted = 0;
1208 root->orphan_cleanup_state = 0;
1209
1210 root->objectid = objectid;
1211 root->last_trans = 0;
1212 root->highest_objectid = 0;
1213 root->nr_delalloc_inodes = 0;
1214 root->nr_ordered_extents = 0;
1215 root->name = NULL;
1216 root->inode_tree = RB_ROOT;
1217 INIT_RADIX_TREE(&root->delayed_nodes_tree, GFP_ATOMIC);
1218 root->block_rsv = NULL;
1219 root->orphan_block_rsv = NULL;
1220
1221 INIT_LIST_HEAD(&root->dirty_list);
1222 INIT_LIST_HEAD(&root->root_list);
1223 INIT_LIST_HEAD(&root->delalloc_inodes);
1224 INIT_LIST_HEAD(&root->delalloc_root);
1225 INIT_LIST_HEAD(&root->ordered_extents);
1226 INIT_LIST_HEAD(&root->ordered_root);
1227 INIT_LIST_HEAD(&root->logged_list[0]);
1228 INIT_LIST_HEAD(&root->logged_list[1]);
1229 spin_lock_init(&root->orphan_lock);
1230 spin_lock_init(&root->inode_lock);
1231 spin_lock_init(&root->delalloc_lock);
1232 spin_lock_init(&root->ordered_extent_lock);
1233 spin_lock_init(&root->accounting_lock);
1234 spin_lock_init(&root->log_extents_lock[0]);
1235 spin_lock_init(&root->log_extents_lock[1]);
1236 mutex_init(&root->objectid_mutex);
1237 mutex_init(&root->log_mutex);
1238 mutex_init(&root->ordered_extent_mutex);
1239 mutex_init(&root->delalloc_mutex);
1240 init_waitqueue_head(&root->log_writer_wait);
1241 init_waitqueue_head(&root->log_commit_wait[0]);
1242 init_waitqueue_head(&root->log_commit_wait[1]);
1243 INIT_LIST_HEAD(&root->log_ctxs[0]);
1244 INIT_LIST_HEAD(&root->log_ctxs[1]);
1245 atomic_set(&root->log_commit[0], 0);
1246 atomic_set(&root->log_commit[1], 0);
1247 atomic_set(&root->log_writers, 0);
1248 atomic_set(&root->log_batch, 0);
1249 atomic_set(&root->orphan_inodes, 0);
1250 atomic_set(&root->refs, 1);
1251 atomic_set(&root->will_be_snapshoted, 0);
1252 root->log_transid = 0;
1253 root->log_transid_committed = -1;
1254 root->last_log_commit = 0;
1255 if (fs_info)
1256 extent_io_tree_init(&root->dirty_log_pages,
1257 fs_info->btree_inode->i_mapping);
1258
1259 memset(&root->root_key, 0, sizeof(root->root_key));
1260 memset(&root->root_item, 0, sizeof(root->root_item));
1261 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
1262 memset(&root->root_kobj, 0, sizeof(root->root_kobj));
1263 if (fs_info)
1264 root->defrag_trans_start = fs_info->generation;
1265 else
1266 root->defrag_trans_start = 0;
1267 init_completion(&root->kobj_unregister);
1268 root->defrag_running = 0;
1269 root->root_key.objectid = objectid;
1270 root->anon_dev = 0;
1271
1272 spin_lock_init(&root->root_item_lock);
1273}
1274
1275static struct btrfs_root *btrfs_alloc_root(struct btrfs_fs_info *fs_info)
1276{
1277 struct btrfs_root *root = kzalloc(sizeof(*root), GFP_NOFS);
1278 if (root)
1279 root->fs_info = fs_info;
1280 return root;
1281}
1282
1283#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
1284/* Should only be used by the testing infrastructure */
1285struct btrfs_root *btrfs_alloc_dummy_root(void)
1286{
1287 struct btrfs_root *root;
1288
1289 root = btrfs_alloc_root(NULL);
1290 if (!root)
1291 return ERR_PTR(-ENOMEM);
1292 __setup_root(4096, 4096, 4096, 4096, root, NULL, 1);
1293 root->dummy_root = 1;
1294
1295 return root;
1296}
1297#endif
1298
1299struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,
1300 struct btrfs_fs_info *fs_info,
1301 u64 objectid)
1302{
1303 struct extent_buffer *leaf;
1304 struct btrfs_root *tree_root = fs_info->tree_root;
1305 struct btrfs_root *root;
1306 struct btrfs_key key;
1307 int ret = 0;
1308 uuid_le uuid;
1309
1310 root = btrfs_alloc_root(fs_info);
1311 if (!root)
1312 return ERR_PTR(-ENOMEM);
1313
1314 __setup_root(tree_root->nodesize, tree_root->leafsize,
1315 tree_root->sectorsize, tree_root->stripesize,
1316 root, fs_info, objectid);
1317 root->root_key.objectid = objectid;
1318 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1319 root->root_key.offset = 0;
1320
1321 leaf = btrfs_alloc_free_block(trans, root, root->leafsize,
1322 0, objectid, NULL, 0, 0, 0);
1323 if (IS_ERR(leaf)) {
1324 ret = PTR_ERR(leaf);
1325 leaf = NULL;
1326 goto fail;
1327 }
1328
1329 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1330 btrfs_set_header_bytenr(leaf, leaf->start);
1331 btrfs_set_header_generation(leaf, trans->transid);
1332 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1333 btrfs_set_header_owner(leaf, objectid);
1334 root->node = leaf;
1335
1336 write_extent_buffer(leaf, fs_info->fsid, btrfs_header_fsid(),
1337 BTRFS_FSID_SIZE);
1338 write_extent_buffer(leaf, fs_info->chunk_tree_uuid,
1339 btrfs_header_chunk_tree_uuid(leaf),
1340 BTRFS_UUID_SIZE);
1341 btrfs_mark_buffer_dirty(leaf);
1342
1343 root->commit_root = btrfs_root_node(root);
1344 root->track_dirty = 1;
1345
1346
1347 root->root_item.flags = 0;
1348 root->root_item.byte_limit = 0;
1349 btrfs_set_root_bytenr(&root->root_item, leaf->start);
1350 btrfs_set_root_generation(&root->root_item, trans->transid);
1351 btrfs_set_root_level(&root->root_item, 0);
1352 btrfs_set_root_refs(&root->root_item, 1);
1353 btrfs_set_root_used(&root->root_item, leaf->len);
1354 btrfs_set_root_last_snapshot(&root->root_item, 0);
1355 btrfs_set_root_dirid(&root->root_item, 0);
1356 uuid_le_gen(&uuid);
1357 memcpy(root->root_item.uuid, uuid.b, BTRFS_UUID_SIZE);
1358 root->root_item.drop_level = 0;
1359
1360 key.objectid = objectid;
1361 key.type = BTRFS_ROOT_ITEM_KEY;
1362 key.offset = 0;
1363 ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item);
1364 if (ret)
1365 goto fail;
1366
1367 btrfs_tree_unlock(leaf);
1368
1369 return root;
1370
1371fail:
1372 if (leaf) {
1373 btrfs_tree_unlock(leaf);
1374 free_extent_buffer(leaf);
1375 }
1376 kfree(root);
1377
1378 return ERR_PTR(ret);
1379}
1380
1381static struct btrfs_root *alloc_log_tree(struct btrfs_trans_handle *trans,
1382 struct btrfs_fs_info *fs_info)
1383{
1384 struct btrfs_root *root;
1385 struct btrfs_root *tree_root = fs_info->tree_root;
1386 struct extent_buffer *leaf;
1387
1388 root = btrfs_alloc_root(fs_info);
1389 if (!root)
1390 return ERR_PTR(-ENOMEM);
1391
1392 __setup_root(tree_root->nodesize, tree_root->leafsize,
1393 tree_root->sectorsize, tree_root->stripesize,
1394 root, fs_info, BTRFS_TREE_LOG_OBJECTID);
1395
1396 root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
1397 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
1398 root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
1399 /*
1400 * log trees do not get reference counted because they go away
1401 * before a real commit is actually done. They do store pointers
1402 * to file data extents, and those reference counts still get
1403 * updated (along with back refs to the log tree).
1404 */
1405 root->ref_cows = 0;
1406
1407 leaf = btrfs_alloc_free_block(trans, root, root->leafsize, 0,
1408 BTRFS_TREE_LOG_OBJECTID, NULL,
1409 0, 0, 0);
1410 if (IS_ERR(leaf)) {
1411 kfree(root);
1412 return ERR_CAST(leaf);
1413 }
1414
1415 memset_extent_buffer(leaf, 0, 0, sizeof(struct btrfs_header));
1416 btrfs_set_header_bytenr(leaf, leaf->start);
1417 btrfs_set_header_generation(leaf, trans->transid);
1418 btrfs_set_header_backref_rev(leaf, BTRFS_MIXED_BACKREF_REV);
1419 btrfs_set_header_owner(leaf, BTRFS_TREE_LOG_OBJECTID);
1420 root->node = leaf;
1421
1422 write_extent_buffer(root->node, root->fs_info->fsid,
1423 btrfs_header_fsid(), BTRFS_FSID_SIZE);
1424 btrfs_mark_buffer_dirty(root->node);
1425 btrfs_tree_unlock(root->node);
1426 return root;
1427}
1428
1429int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
1430 struct btrfs_fs_info *fs_info)
1431{
1432 struct btrfs_root *log_root;
1433
1434 log_root = alloc_log_tree(trans, fs_info);
1435 if (IS_ERR(log_root))
1436 return PTR_ERR(log_root);
1437 WARN_ON(fs_info->log_root_tree);
1438 fs_info->log_root_tree = log_root;
1439 return 0;
1440}
1441
1442int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
1443 struct btrfs_root *root)
1444{
1445 struct btrfs_root *log_root;
1446 struct btrfs_inode_item *inode_item;
1447
1448 log_root = alloc_log_tree(trans, root->fs_info);
1449 if (IS_ERR(log_root))
1450 return PTR_ERR(log_root);
1451
1452 log_root->last_trans = trans->transid;
1453 log_root->root_key.offset = root->root_key.objectid;
1454
1455 inode_item = &log_root->root_item.inode;
1456 btrfs_set_stack_inode_generation(inode_item, 1);
1457 btrfs_set_stack_inode_size(inode_item, 3);
1458 btrfs_set_stack_inode_nlink(inode_item, 1);
1459 btrfs_set_stack_inode_nbytes(inode_item, root->leafsize);
1460 btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755);
1461
1462 btrfs_set_root_node(&log_root->root_item, log_root->node);
1463
1464 WARN_ON(root->log_root);
1465 root->log_root = log_root;
1466 root->log_transid = 0;
1467 root->log_transid_committed = -1;
1468 root->last_log_commit = 0;
1469 return 0;
1470}
1471
1472static struct btrfs_root *btrfs_read_tree_root(struct btrfs_root *tree_root,
1473 struct btrfs_key *key)
1474{
1475 struct btrfs_root *root;
1476 struct btrfs_fs_info *fs_info = tree_root->fs_info;
1477 struct btrfs_path *path;
1478 u64 generation;
1479 u32 blocksize;
1480 int ret;
1481
1482 path = btrfs_alloc_path();
1483 if (!path)
1484 return ERR_PTR(-ENOMEM);
1485
1486 root = btrfs_alloc_root(fs_info);
1487 if (!root) {
1488 ret = -ENOMEM;
1489 goto alloc_fail;
1490 }
1491
1492 __setup_root(tree_root->nodesize, tree_root->leafsize,
1493 tree_root->sectorsize, tree_root->stripesize,
1494 root, fs_info, key->objectid);
1495
1496 ret = btrfs_find_root(tree_root, key, path,
1497 &root->root_item, &root->root_key);
1498 if (ret) {
1499 if (ret > 0)
1500 ret = -ENOENT;
1501 goto find_fail;
1502 }
1503
1504 generation = btrfs_root_generation(&root->root_item);
1505 blocksize = btrfs_level_size(root, btrfs_root_level(&root->root_item));
1506 root->node = read_tree_block(root, btrfs_root_bytenr(&root->root_item),
1507 blocksize, generation);
1508 if (!root->node) {
1509 ret = -ENOMEM;
1510 goto find_fail;
1511 } else if (!btrfs_buffer_uptodate(root->node, generation, 0)) {
1512 ret = -EIO;
1513 goto read_fail;
1514 }
1515 root->commit_root = btrfs_root_node(root);
1516out:
1517 btrfs_free_path(path);
1518 return root;
1519
1520read_fail:
1521 free_extent_buffer(root->node);
1522find_fail:
1523 kfree(root);
1524alloc_fail:
1525 root = ERR_PTR(ret);
1526 goto out;
1527}
1528
1529struct btrfs_root *btrfs_read_fs_root(struct btrfs_root *tree_root,
1530 struct btrfs_key *location)
1531{
1532 struct btrfs_root *root;
1533
1534 root = btrfs_read_tree_root(tree_root, location);
1535 if (IS_ERR(root))
1536 return root;
1537
1538 if (root->root_key.objectid != BTRFS_TREE_LOG_OBJECTID) {
1539 root->ref_cows = 1;
1540 btrfs_check_and_init_root_item(&root->root_item);
1541 }
1542
1543 return root;
1544}
1545
1546int btrfs_init_fs_root(struct btrfs_root *root)
1547{
1548 int ret;
1549 struct btrfs_subvolume_writers *writers;
1550
1551 root->free_ino_ctl = kzalloc(sizeof(*root->free_ino_ctl), GFP_NOFS);
1552 root->free_ino_pinned = kzalloc(sizeof(*root->free_ino_pinned),
1553 GFP_NOFS);
1554 if (!root->free_ino_pinned || !root->free_ino_ctl) {
1555 ret = -ENOMEM;
1556 goto fail;
1557 }
1558
1559 writers = btrfs_alloc_subvolume_writers();
1560 if (IS_ERR(writers)) {
1561 ret = PTR_ERR(writers);
1562 goto fail;
1563 }
1564 root->subv_writers = writers;
1565
1566 btrfs_init_free_ino_ctl(root);
1567 spin_lock_init(&root->cache_lock);
1568 init_waitqueue_head(&root->cache_wait);
1569
1570 ret = get_anon_bdev(&root->anon_dev);
1571 if (ret)
1572 goto free_writers;
1573 return 0;
1574
1575free_writers:
1576 btrfs_free_subvolume_writers(root->subv_writers);
1577fail:
1578 kfree(root->free_ino_ctl);
1579 kfree(root->free_ino_pinned);
1580 return ret;
1581}
1582
1583static struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
1584 u64 root_id)
1585{
1586 struct btrfs_root *root;
1587
1588 spin_lock(&fs_info->fs_roots_radix_lock);
1589 root = radix_tree_lookup(&fs_info->fs_roots_radix,
1590 (unsigned long)root_id);
1591 spin_unlock(&fs_info->fs_roots_radix_lock);
1592 return root;
1593}
1594
1595int btrfs_insert_fs_root(struct btrfs_fs_info *fs_info,
1596 struct btrfs_root *root)
1597{
1598 int ret;
1599
1600 ret = radix_tree_preload(GFP_NOFS & ~__GFP_HIGHMEM);
1601 if (ret)
1602 return ret;
1603
1604 spin_lock(&fs_info->fs_roots_radix_lock);
1605 ret = radix_tree_insert(&fs_info->fs_roots_radix,
1606 (unsigned long)root->root_key.objectid,
1607 root);
1608 if (ret == 0)
1609 root->in_radix = 1;
1610 spin_unlock(&fs_info->fs_roots_radix_lock);
1611 radix_tree_preload_end();
1612
1613 return ret;
1614}
1615
1616struct btrfs_root *btrfs_get_fs_root(struct btrfs_fs_info *fs_info,
1617 struct btrfs_key *location,
1618 bool check_ref)
1619{
1620 struct btrfs_root *root;
1621 int ret;
1622
1623 if (location->objectid == BTRFS_ROOT_TREE_OBJECTID)
1624 return fs_info->tree_root;
1625 if (location->objectid == BTRFS_EXTENT_TREE_OBJECTID)
1626 return fs_info->extent_root;
1627 if (location->objectid == BTRFS_CHUNK_TREE_OBJECTID)
1628 return fs_info->chunk_root;
1629 if (location->objectid == BTRFS_DEV_TREE_OBJECTID)
1630 return fs_info->dev_root;
1631 if (location->objectid == BTRFS_CSUM_TREE_OBJECTID)
1632 return fs_info->csum_root;
1633 if (location->objectid == BTRFS_QUOTA_TREE_OBJECTID)
1634 return fs_info->quota_root ? fs_info->quota_root :
1635 ERR_PTR(-ENOENT);
1636 if (location->objectid == BTRFS_UUID_TREE_OBJECTID)
1637 return fs_info->uuid_root ? fs_info->uuid_root :
1638 ERR_PTR(-ENOENT);
1639again:
1640 root = btrfs_lookup_fs_root(fs_info, location->objectid);
1641 if (root) {
1642 if (check_ref && btrfs_root_refs(&root->root_item) == 0)
1643 return ERR_PTR(-ENOENT);
1644 return root;
1645 }
1646
1647 root = btrfs_read_fs_root(fs_info->tree_root, location);
1648 if (IS_ERR(root))
1649 return root;
1650
1651 if (check_ref && btrfs_root_refs(&root->root_item) == 0) {
1652 ret = -ENOENT;
1653 goto fail;
1654 }
1655
1656 ret = btrfs_init_fs_root(root);
1657 if (ret)
1658 goto fail;
1659
1660 ret = btrfs_find_item(fs_info->tree_root, NULL, BTRFS_ORPHAN_OBJECTID,
1661 location->objectid, BTRFS_ORPHAN_ITEM_KEY, NULL);
1662 if (ret < 0)
1663 goto fail;
1664 if (ret == 0)
1665 root->orphan_item_inserted = 1;
1666
1667 ret = btrfs_insert_fs_root(fs_info, root);
1668 if (ret) {
1669 if (ret == -EEXIST) {
1670 free_fs_root(root);
1671 goto again;
1672 }
1673 goto fail;
1674 }
1675 return root;
1676fail:
1677 free_fs_root(root);
1678 return ERR_PTR(ret);
1679}
1680
1681static int btrfs_congested_fn(void *congested_data, int bdi_bits)
1682{
1683 struct btrfs_fs_info *info = (struct btrfs_fs_info *)congested_data;
1684 int ret = 0;
1685 struct btrfs_device *device;
1686 struct backing_dev_info *bdi;
1687
1688 rcu_read_lock();
1689 list_for_each_entry_rcu(device, &info->fs_devices->devices, dev_list) {
1690 if (!device->bdev)
1691 continue;
1692 bdi = blk_get_backing_dev_info(device->bdev);
1693 if (bdi && bdi_congested(bdi, bdi_bits)) {
1694 ret = 1;
1695 break;
1696 }
1697 }
1698 rcu_read_unlock();
1699 return ret;
1700}
1701
1702/*
1703 * If this fails, caller must call bdi_destroy() to get rid of the
1704 * bdi again.
1705 */
1706static int setup_bdi(struct btrfs_fs_info *info, struct backing_dev_info *bdi)
1707{
1708 int err;
1709
1710 bdi->capabilities = BDI_CAP_MAP_COPY;
1711 err = bdi_setup_and_register(bdi, "btrfs", BDI_CAP_MAP_COPY);
1712 if (err)
1713 return err;
1714
1715 bdi->ra_pages = default_backing_dev_info.ra_pages;
1716 bdi->congested_fn = btrfs_congested_fn;
1717 bdi->congested_data = info;
1718 return 0;
1719}
1720
1721/*
1722 * called by the kthread helper functions to finally call the bio end_io
1723 * functions. This is where read checksum verification actually happens
1724 */
1725static void end_workqueue_fn(struct btrfs_work *work)
1726{
1727 struct bio *bio;
1728 struct end_io_wq *end_io_wq;
1729 int error;
1730
1731 end_io_wq = container_of(work, struct end_io_wq, work);
1732 bio = end_io_wq->bio;
1733
1734 error = end_io_wq->error;
1735 bio->bi_private = end_io_wq->private;
1736 bio->bi_end_io = end_io_wq->end_io;
1737 kfree(end_io_wq);
1738 bio_endio_nodec(bio, error);
1739}
1740
1741static int cleaner_kthread(void *arg)
1742{
1743 struct btrfs_root *root = arg;
1744 int again;
1745
1746 do {
1747 again = 0;
1748
1749 /* Make the cleaner go to sleep early. */
1750 if (btrfs_need_cleaner_sleep(root))
1751 goto sleep;
1752
1753 if (!mutex_trylock(&root->fs_info->cleaner_mutex))
1754 goto sleep;
1755
1756 /*
1757 * Avoid the problem that we change the status of the fs
1758 * during the above check and trylock.
1759 */
1760 if (btrfs_need_cleaner_sleep(root)) {
1761 mutex_unlock(&root->fs_info->cleaner_mutex);
1762 goto sleep;
1763 }
1764
1765 btrfs_run_delayed_iputs(root);
1766 again = btrfs_clean_one_deleted_snapshot(root);
1767 mutex_unlock(&root->fs_info->cleaner_mutex);
1768
1769 /*
1770 * The defragger has dealt with the R/O remount and umount,
1771 * needn't do anything special here.
1772 */
1773 btrfs_run_defrag_inodes(root->fs_info);
1774sleep:
1775 if (!try_to_freeze() && !again) {
1776 set_current_state(TASK_INTERRUPTIBLE);
1777 if (!kthread_should_stop())
1778 schedule();
1779 __set_current_state(TASK_RUNNING);
1780 }
1781 } while (!kthread_should_stop());
1782 return 0;
1783}
1784
1785static int transaction_kthread(void *arg)
1786{
1787 struct btrfs_root *root = arg;
1788 struct btrfs_trans_handle *trans;
1789 struct btrfs_transaction *cur;
1790 u64 transid;
1791 unsigned long now;
1792 unsigned long delay;
1793 bool cannot_commit;
1794
1795 do {
1796 cannot_commit = false;
1797 delay = HZ * root->fs_info->commit_interval;
1798 mutex_lock(&root->fs_info->transaction_kthread_mutex);
1799
1800 spin_lock(&root->fs_info->trans_lock);
1801 cur = root->fs_info->running_transaction;
1802 if (!cur) {
1803 spin_unlock(&root->fs_info->trans_lock);
1804 goto sleep;
1805 }
1806
1807 now = get_seconds();
1808 if (cur->state < TRANS_STATE_BLOCKED &&
1809 (now < cur->start_time ||
1810 now - cur->start_time < root->fs_info->commit_interval)) {
1811 spin_unlock(&root->fs_info->trans_lock);
1812 delay = HZ * 5;
1813 goto sleep;
1814 }
1815 transid = cur->transid;
1816 spin_unlock(&root->fs_info->trans_lock);
1817
1818 /* If the file system is aborted, this will always fail. */
1819 trans = btrfs_attach_transaction(root);
1820 if (IS_ERR(trans)) {
1821 if (PTR_ERR(trans) != -ENOENT)
1822 cannot_commit = true;
1823 goto sleep;
1824 }
1825 if (transid == trans->transid) {
1826 btrfs_commit_transaction(trans, root);
1827 } else {
1828 btrfs_end_transaction(trans, root);
1829 }
1830sleep:
1831 wake_up_process(root->fs_info->cleaner_kthread);
1832 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
1833
1834 if (unlikely(test_bit(BTRFS_FS_STATE_ERROR,
1835 &root->fs_info->fs_state)))
1836 btrfs_cleanup_transaction(root);
1837 if (!try_to_freeze()) {
1838 set_current_state(TASK_INTERRUPTIBLE);
1839 if (!kthread_should_stop() &&
1840 (!btrfs_transaction_blocked(root->fs_info) ||
1841 cannot_commit))
1842 schedule_timeout(delay);
1843 __set_current_state(TASK_RUNNING);
1844 }
1845 } while (!kthread_should_stop());
1846 return 0;
1847}
1848
1849/*
1850 * this will find the highest generation in the array of
1851 * root backups. The index of the highest array is returned,
1852 * or -1 if we can't find anything.
1853 *
1854 * We check to make sure the array is valid by comparing the
1855 * generation of the latest root in the array with the generation
1856 * in the super block. If they don't match we pitch it.
1857 */
1858static int find_newest_super_backup(struct btrfs_fs_info *info, u64 newest_gen)
1859{
1860 u64 cur;
1861 int newest_index = -1;
1862 struct btrfs_root_backup *root_backup;
1863 int i;
1864
1865 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
1866 root_backup = info->super_copy->super_roots + i;
1867 cur = btrfs_backup_tree_root_gen(root_backup);
1868 if (cur == newest_gen)
1869 newest_index = i;
1870 }
1871
1872 /* check to see if we actually wrapped around */
1873 if (newest_index == BTRFS_NUM_BACKUP_ROOTS - 1) {
1874 root_backup = info->super_copy->super_roots;
1875 cur = btrfs_backup_tree_root_gen(root_backup);
1876 if (cur == newest_gen)
1877 newest_index = 0;
1878 }
1879 return newest_index;
1880}
1881
1882
1883/*
1884 * find the oldest backup so we know where to store new entries
1885 * in the backup array. This will set the backup_root_index
1886 * field in the fs_info struct
1887 */
1888static void find_oldest_super_backup(struct btrfs_fs_info *info,
1889 u64 newest_gen)
1890{
1891 int newest_index = -1;
1892
1893 newest_index = find_newest_super_backup(info, newest_gen);
1894 /* if there was garbage in there, just move along */
1895 if (newest_index == -1) {
1896 info->backup_root_index = 0;
1897 } else {
1898 info->backup_root_index = (newest_index + 1) % BTRFS_NUM_BACKUP_ROOTS;
1899 }
1900}
1901
1902/*
1903 * copy all the root pointers into the super backup array.
1904 * this will bump the backup pointer by one when it is
1905 * done
1906 */
1907static void backup_super_roots(struct btrfs_fs_info *info)
1908{
1909 int next_backup;
1910 struct btrfs_root_backup *root_backup;
1911 int last_backup;
1912
1913 next_backup = info->backup_root_index;
1914 last_backup = (next_backup + BTRFS_NUM_BACKUP_ROOTS - 1) %
1915 BTRFS_NUM_BACKUP_ROOTS;
1916
1917 /*
1918 * just overwrite the last backup if we're at the same generation
1919 * this happens only at umount
1920 */
1921 root_backup = info->super_for_commit->super_roots + last_backup;
1922 if (btrfs_backup_tree_root_gen(root_backup) ==
1923 btrfs_header_generation(info->tree_root->node))
1924 next_backup = last_backup;
1925
1926 root_backup = info->super_for_commit->super_roots + next_backup;
1927
1928 /*
1929 * make sure all of our padding and empty slots get zero filled
1930 * regardless of which ones we use today
1931 */
1932 memset(root_backup, 0, sizeof(*root_backup));
1933
1934 info->backup_root_index = (next_backup + 1) % BTRFS_NUM_BACKUP_ROOTS;
1935
1936 btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start);
1937 btrfs_set_backup_tree_root_gen(root_backup,
1938 btrfs_header_generation(info->tree_root->node));
1939
1940 btrfs_set_backup_tree_root_level(root_backup,
1941 btrfs_header_level(info->tree_root->node));
1942
1943 btrfs_set_backup_chunk_root(root_backup, info->chunk_root->node->start);
1944 btrfs_set_backup_chunk_root_gen(root_backup,
1945 btrfs_header_generation(info->chunk_root->node));
1946 btrfs_set_backup_chunk_root_level(root_backup,
1947 btrfs_header_level(info->chunk_root->node));
1948
1949 btrfs_set_backup_extent_root(root_backup, info->extent_root->node->start);
1950 btrfs_set_backup_extent_root_gen(root_backup,
1951 btrfs_header_generation(info->extent_root->node));
1952 btrfs_set_backup_extent_root_level(root_backup,
1953 btrfs_header_level(info->extent_root->node));
1954
1955 /*
1956 * we might commit during log recovery, which happens before we set
1957 * the fs_root. Make sure it is valid before we fill it in.
1958 */
1959 if (info->fs_root && info->fs_root->node) {
1960 btrfs_set_backup_fs_root(root_backup,
1961 info->fs_root->node->start);
1962 btrfs_set_backup_fs_root_gen(root_backup,
1963 btrfs_header_generation(info->fs_root->node));
1964 btrfs_set_backup_fs_root_level(root_backup,
1965 btrfs_header_level(info->fs_root->node));
1966 }
1967
1968 btrfs_set_backup_dev_root(root_backup, info->dev_root->node->start);
1969 btrfs_set_backup_dev_root_gen(root_backup,
1970 btrfs_header_generation(info->dev_root->node));
1971 btrfs_set_backup_dev_root_level(root_backup,
1972 btrfs_header_level(info->dev_root->node));
1973
1974 btrfs_set_backup_csum_root(root_backup, info->csum_root->node->start);
1975 btrfs_set_backup_csum_root_gen(root_backup,
1976 btrfs_header_generation(info->csum_root->node));
1977 btrfs_set_backup_csum_root_level(root_backup,
1978 btrfs_header_level(info->csum_root->node));
1979
1980 btrfs_set_backup_total_bytes(root_backup,
1981 btrfs_super_total_bytes(info->super_copy));
1982 btrfs_set_backup_bytes_used(root_backup,
1983 btrfs_super_bytes_used(info->super_copy));
1984 btrfs_set_backup_num_devices(root_backup,
1985 btrfs_super_num_devices(info->super_copy));
1986
1987 /*
1988 * if we don't copy this out to the super_copy, it won't get remembered
1989 * for the next commit
1990 */
1991 memcpy(&info->super_copy->super_roots,
1992 &info->super_for_commit->super_roots,
1993 sizeof(*root_backup) * BTRFS_NUM_BACKUP_ROOTS);
1994}
1995
1996/*
1997 * this copies info out of the root backup array and back into
1998 * the in-memory super block. It is meant to help iterate through
1999 * the array, so you send it the number of backups you've already
2000 * tried and the last backup index you used.
2001 *
2002 * this returns -1 when it has tried all the backups
2003 */
2004static noinline int next_root_backup(struct btrfs_fs_info *info,
2005 struct btrfs_super_block *super,
2006 int *num_backups_tried, int *backup_index)
2007{
2008 struct btrfs_root_backup *root_backup;
2009 int newest = *backup_index;
2010
2011 if (*num_backups_tried == 0) {
2012 u64 gen = btrfs_super_generation(super);
2013
2014 newest = find_newest_super_backup(info, gen);
2015 if (newest == -1)
2016 return -1;
2017
2018 *backup_index = newest;
2019 *num_backups_tried = 1;
2020 } else if (*num_backups_tried == BTRFS_NUM_BACKUP_ROOTS) {
2021 /* we've tried all the backups, all done */
2022 return -1;
2023 } else {
2024 /* jump to the next oldest backup */
2025 newest = (*backup_index + BTRFS_NUM_BACKUP_ROOTS - 1) %
2026 BTRFS_NUM_BACKUP_ROOTS;
2027 *backup_index = newest;
2028 *num_backups_tried += 1;
2029 }
2030 root_backup = super->super_roots + newest;
2031
2032 btrfs_set_super_generation(super,
2033 btrfs_backup_tree_root_gen(root_backup));
2034 btrfs_set_super_root(super, btrfs_backup_tree_root(root_backup));
2035 btrfs_set_super_root_level(super,
2036 btrfs_backup_tree_root_level(root_backup));
2037 btrfs_set_super_bytes_used(super, btrfs_backup_bytes_used(root_backup));
2038
2039 /*
2040 * fixme: the total bytes and num_devices need to match or we should
2041 * need a fsck
2042 */
2043 btrfs_set_super_total_bytes(super, btrfs_backup_total_bytes(root_backup));
2044 btrfs_set_super_num_devices(super, btrfs_backup_num_devices(root_backup));
2045 return 0;
2046}
2047
2048/* helper to cleanup workers */
2049static void btrfs_stop_all_workers(struct btrfs_fs_info *fs_info)
2050{
2051 btrfs_destroy_workqueue(fs_info->fixup_workers);
2052 btrfs_destroy_workqueue(fs_info->delalloc_workers);
2053 btrfs_destroy_workqueue(fs_info->workers);
2054 btrfs_destroy_workqueue(fs_info->endio_workers);
2055 btrfs_destroy_workqueue(fs_info->endio_meta_workers);
2056 btrfs_destroy_workqueue(fs_info->endio_raid56_workers);
2057 btrfs_destroy_workqueue(fs_info->rmw_workers);
2058 btrfs_destroy_workqueue(fs_info->endio_meta_write_workers);
2059 btrfs_destroy_workqueue(fs_info->endio_write_workers);
2060 btrfs_destroy_workqueue(fs_info->endio_freespace_worker);
2061 btrfs_destroy_workqueue(fs_info->submit_workers);
2062 btrfs_destroy_workqueue(fs_info->delayed_workers);
2063 btrfs_destroy_workqueue(fs_info->caching_workers);
2064 btrfs_destroy_workqueue(fs_info->readahead_workers);
2065 btrfs_destroy_workqueue(fs_info->flush_workers);
2066 btrfs_destroy_workqueue(fs_info->qgroup_rescan_workers);
2067}
2068
2069static void free_root_extent_buffers(struct btrfs_root *root)
2070{
2071 if (root) {
2072 free_extent_buffer(root->node);
2073 free_extent_buffer(root->commit_root);
2074 root->node = NULL;
2075 root->commit_root = NULL;
2076 }
2077}
2078
2079/* helper to cleanup tree roots */
2080static void free_root_pointers(struct btrfs_fs_info *info, int chunk_root)
2081{
2082 free_root_extent_buffers(info->tree_root);
2083
2084 free_root_extent_buffers(info->dev_root);
2085 free_root_extent_buffers(info->extent_root);
2086 free_root_extent_buffers(info->csum_root);
2087 free_root_extent_buffers(info->quota_root);
2088 free_root_extent_buffers(info->uuid_root);
2089 if (chunk_root)
2090 free_root_extent_buffers(info->chunk_root);
2091}
2092
2093static void del_fs_roots(struct btrfs_fs_info *fs_info)
2094{
2095 int ret;
2096 struct btrfs_root *gang[8];
2097 int i;
2098
2099 while (!list_empty(&fs_info->dead_roots)) {
2100 gang[0] = list_entry(fs_info->dead_roots.next,
2101 struct btrfs_root, root_list);
2102 list_del(&gang[0]->root_list);
2103
2104 if (gang[0]->in_radix) {
2105 btrfs_drop_and_free_fs_root(fs_info, gang[0]);
2106 } else {
2107 free_extent_buffer(gang[0]->node);
2108 free_extent_buffer(gang[0]->commit_root);
2109 btrfs_put_fs_root(gang[0]);
2110 }
2111 }
2112
2113 while (1) {
2114 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2115 (void **)gang, 0,
2116 ARRAY_SIZE(gang));
2117 if (!ret)
2118 break;
2119 for (i = 0; i < ret; i++)
2120 btrfs_drop_and_free_fs_root(fs_info, gang[i]);
2121 }
2122
2123 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state)) {
2124 btrfs_free_log_root_tree(NULL, fs_info);
2125 btrfs_destroy_pinned_extent(fs_info->tree_root,
2126 fs_info->pinned_extents);
2127 }
2128}
2129
2130int open_ctree(struct super_block *sb,
2131 struct btrfs_fs_devices *fs_devices,
2132 char *options)
2133{
2134 u32 sectorsize;
2135 u32 nodesize;
2136 u32 leafsize;
2137 u32 blocksize;
2138 u32 stripesize;
2139 u64 generation;
2140 u64 features;
2141 struct btrfs_key location;
2142 struct buffer_head *bh;
2143 struct btrfs_super_block *disk_super;
2144 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
2145 struct btrfs_root *tree_root;
2146 struct btrfs_root *extent_root;
2147 struct btrfs_root *csum_root;
2148 struct btrfs_root *chunk_root;
2149 struct btrfs_root *dev_root;
2150 struct btrfs_root *quota_root;
2151 struct btrfs_root *uuid_root;
2152 struct btrfs_root *log_tree_root;
2153 int ret;
2154 int err = -EINVAL;
2155 int num_backups_tried = 0;
2156 int backup_index = 0;
2157 int max_active;
2158 int flags = WQ_MEM_RECLAIM | WQ_FREEZABLE | WQ_UNBOUND;
2159 bool create_uuid_tree;
2160 bool check_uuid_tree;
2161
2162 tree_root = fs_info->tree_root = btrfs_alloc_root(fs_info);
2163 chunk_root = fs_info->chunk_root = btrfs_alloc_root(fs_info);
2164 if (!tree_root || !chunk_root) {
2165 err = -ENOMEM;
2166 goto fail;
2167 }
2168
2169 ret = init_srcu_struct(&fs_info->subvol_srcu);
2170 if (ret) {
2171 err = ret;
2172 goto fail;
2173 }
2174
2175 ret = setup_bdi(fs_info, &fs_info->bdi);
2176 if (ret) {
2177 err = ret;
2178 goto fail_srcu;
2179 }
2180
2181 ret = percpu_counter_init(&fs_info->dirty_metadata_bytes, 0);
2182 if (ret) {
2183 err = ret;
2184 goto fail_bdi;
2185 }
2186 fs_info->dirty_metadata_batch = PAGE_CACHE_SIZE *
2187 (1 + ilog2(nr_cpu_ids));
2188
2189 ret = percpu_counter_init(&fs_info->delalloc_bytes, 0);
2190 if (ret) {
2191 err = ret;
2192 goto fail_dirty_metadata_bytes;
2193 }
2194
2195 ret = percpu_counter_init(&fs_info->bio_counter, 0);
2196 if (ret) {
2197 err = ret;
2198 goto fail_delalloc_bytes;
2199 }
2200
2201 fs_info->btree_inode = new_inode(sb);
2202 if (!fs_info->btree_inode) {
2203 err = -ENOMEM;
2204 goto fail_bio_counter;
2205 }
2206
2207 mapping_set_gfp_mask(fs_info->btree_inode->i_mapping, GFP_NOFS);
2208
2209 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
2210 INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC);
2211 INIT_LIST_HEAD(&fs_info->trans_list);
2212 INIT_LIST_HEAD(&fs_info->dead_roots);
2213 INIT_LIST_HEAD(&fs_info->delayed_iputs);
2214 INIT_LIST_HEAD(&fs_info->delalloc_roots);
2215 INIT_LIST_HEAD(&fs_info->caching_block_groups);
2216 spin_lock_init(&fs_info->delalloc_root_lock);
2217 spin_lock_init(&fs_info->trans_lock);
2218 spin_lock_init(&fs_info->fs_roots_radix_lock);
2219 spin_lock_init(&fs_info->delayed_iput_lock);
2220 spin_lock_init(&fs_info->defrag_inodes_lock);
2221 spin_lock_init(&fs_info->free_chunk_lock);
2222 spin_lock_init(&fs_info->tree_mod_seq_lock);
2223 spin_lock_init(&fs_info->super_lock);
2224 spin_lock_init(&fs_info->buffer_lock);
2225 rwlock_init(&fs_info->tree_mod_log_lock);
2226 mutex_init(&fs_info->reloc_mutex);
2227 mutex_init(&fs_info->delalloc_root_mutex);
2228 seqlock_init(&fs_info->profiles_lock);
2229
2230 init_completion(&fs_info->kobj_unregister);
2231 INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
2232 INIT_LIST_HEAD(&fs_info->space_info);
2233 INIT_LIST_HEAD(&fs_info->tree_mod_seq_list);
2234 btrfs_mapping_init(&fs_info->mapping_tree);
2235 btrfs_init_block_rsv(&fs_info->global_block_rsv,
2236 BTRFS_BLOCK_RSV_GLOBAL);
2237 btrfs_init_block_rsv(&fs_info->delalloc_block_rsv,
2238 BTRFS_BLOCK_RSV_DELALLOC);
2239 btrfs_init_block_rsv(&fs_info->trans_block_rsv, BTRFS_BLOCK_RSV_TRANS);
2240 btrfs_init_block_rsv(&fs_info->chunk_block_rsv, BTRFS_BLOCK_RSV_CHUNK);
2241 btrfs_init_block_rsv(&fs_info->empty_block_rsv, BTRFS_BLOCK_RSV_EMPTY);
2242 btrfs_init_block_rsv(&fs_info->delayed_block_rsv,
2243 BTRFS_BLOCK_RSV_DELOPS);
2244 atomic_set(&fs_info->nr_async_submits, 0);
2245 atomic_set(&fs_info->async_delalloc_pages, 0);
2246 atomic_set(&fs_info->async_submit_draining, 0);
2247 atomic_set(&fs_info->nr_async_bios, 0);
2248 atomic_set(&fs_info->defrag_running, 0);
2249 atomic64_set(&fs_info->tree_mod_seq, 0);
2250 fs_info->sb = sb;
2251 fs_info->max_inline = 8192 * 1024;
2252 fs_info->metadata_ratio = 0;
2253 fs_info->defrag_inodes = RB_ROOT;
2254 fs_info->free_chunk_space = 0;
2255 fs_info->tree_mod_log = RB_ROOT;
2256 fs_info->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL;
2257 fs_info->avg_delayed_ref_runtime = div64_u64(NSEC_PER_SEC, 64);
2258 /* readahead state */
2259 INIT_RADIX_TREE(&fs_info->reada_tree, GFP_NOFS & ~__GFP_WAIT);
2260 spin_lock_init(&fs_info->reada_lock);
2261
2262 fs_info->thread_pool_size = min_t(unsigned long,
2263 num_online_cpus() + 2, 8);
2264
2265 INIT_LIST_HEAD(&fs_info->ordered_roots);
2266 spin_lock_init(&fs_info->ordered_root_lock);
2267 fs_info->delayed_root = kmalloc(sizeof(struct btrfs_delayed_root),
2268 GFP_NOFS);
2269 if (!fs_info->delayed_root) {
2270 err = -ENOMEM;
2271 goto fail_iput;
2272 }
2273 btrfs_init_delayed_root(fs_info->delayed_root);
2274
2275 mutex_init(&fs_info->scrub_lock);
2276 atomic_set(&fs_info->scrubs_running, 0);
2277 atomic_set(&fs_info->scrub_pause_req, 0);
2278 atomic_set(&fs_info->scrubs_paused, 0);
2279 atomic_set(&fs_info->scrub_cancel_req, 0);
2280 init_waitqueue_head(&fs_info->replace_wait);
2281 init_waitqueue_head(&fs_info->scrub_pause_wait);
2282 fs_info->scrub_workers_refcnt = 0;
2283#ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2284 fs_info->check_integrity_print_mask = 0;
2285#endif
2286
2287 spin_lock_init(&fs_info->balance_lock);
2288 mutex_init(&fs_info->balance_mutex);
2289 atomic_set(&fs_info->balance_running, 0);
2290 atomic_set(&fs_info->balance_pause_req, 0);
2291 atomic_set(&fs_info->balance_cancel_req, 0);
2292 fs_info->balance_ctl = NULL;
2293 init_waitqueue_head(&fs_info->balance_wait_q);
2294
2295 sb->s_blocksize = 4096;
2296 sb->s_blocksize_bits = blksize_bits(4096);
2297 sb->s_bdi = &fs_info->bdi;
2298
2299 fs_info->btree_inode->i_ino = BTRFS_BTREE_INODE_OBJECTID;
2300 set_nlink(fs_info->btree_inode, 1);
2301 /*
2302 * we set the i_size on the btree inode to the max possible int.
2303 * the real end of the address space is determined by all of
2304 * the devices in the system
2305 */
2306 fs_info->btree_inode->i_size = OFFSET_MAX;
2307 fs_info->btree_inode->i_mapping->a_ops = &btree_aops;
2308 fs_info->btree_inode->i_mapping->backing_dev_info = &fs_info->bdi;
2309
2310 RB_CLEAR_NODE(&BTRFS_I(fs_info->btree_inode)->rb_node);
2311 extent_io_tree_init(&BTRFS_I(fs_info->btree_inode)->io_tree,
2312 fs_info->btree_inode->i_mapping);
2313 BTRFS_I(fs_info->btree_inode)->io_tree.track_uptodate = 0;
2314 extent_map_tree_init(&BTRFS_I(fs_info->btree_inode)->extent_tree);
2315
2316 BTRFS_I(fs_info->btree_inode)->io_tree.ops = &btree_extent_io_ops;
2317
2318 BTRFS_I(fs_info->btree_inode)->root = tree_root;
2319 memset(&BTRFS_I(fs_info->btree_inode)->location, 0,
2320 sizeof(struct btrfs_key));
2321 set_bit(BTRFS_INODE_DUMMY,
2322 &BTRFS_I(fs_info->btree_inode)->runtime_flags);
2323 btrfs_insert_inode_hash(fs_info->btree_inode);
2324
2325 spin_lock_init(&fs_info->block_group_cache_lock);
2326 fs_info->block_group_cache_tree = RB_ROOT;
2327 fs_info->first_logical_byte = (u64)-1;
2328
2329 extent_io_tree_init(&fs_info->freed_extents[0],
2330 fs_info->btree_inode->i_mapping);
2331 extent_io_tree_init(&fs_info->freed_extents[1],
2332 fs_info->btree_inode->i_mapping);
2333 fs_info->pinned_extents = &fs_info->freed_extents[0];
2334 fs_info->do_barriers = 1;
2335
2336
2337 mutex_init(&fs_info->ordered_operations_mutex);
2338 mutex_init(&fs_info->ordered_extent_flush_mutex);
2339 mutex_init(&fs_info->tree_log_mutex);
2340 mutex_init(&fs_info->chunk_mutex);
2341 mutex_init(&fs_info->transaction_kthread_mutex);
2342 mutex_init(&fs_info->cleaner_mutex);
2343 mutex_init(&fs_info->volume_mutex);
2344 init_rwsem(&fs_info->commit_root_sem);
2345 init_rwsem(&fs_info->cleanup_work_sem);
2346 init_rwsem(&fs_info->subvol_sem);
2347 sema_init(&fs_info->uuid_tree_rescan_sem, 1);
2348 fs_info->dev_replace.lock_owner = 0;
2349 atomic_set(&fs_info->dev_replace.nesting_level, 0);
2350 mutex_init(&fs_info->dev_replace.lock_finishing_cancel_unmount);
2351 mutex_init(&fs_info->dev_replace.lock_management_lock);
2352 mutex_init(&fs_info->dev_replace.lock);
2353
2354 spin_lock_init(&fs_info->qgroup_lock);
2355 mutex_init(&fs_info->qgroup_ioctl_lock);
2356 fs_info->qgroup_tree = RB_ROOT;
2357 INIT_LIST_HEAD(&fs_info->dirty_qgroups);
2358 fs_info->qgroup_seq = 1;
2359 fs_info->quota_enabled = 0;
2360 fs_info->pending_quota_state = 0;
2361 fs_info->qgroup_ulist = NULL;
2362 mutex_init(&fs_info->qgroup_rescan_lock);
2363
2364 btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
2365 btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
2366
2367 init_waitqueue_head(&fs_info->transaction_throttle);
2368 init_waitqueue_head(&fs_info->transaction_wait);
2369 init_waitqueue_head(&fs_info->transaction_blocked_wait);
2370 init_waitqueue_head(&fs_info->async_submit_wait);
2371
2372 ret = btrfs_alloc_stripe_hash_table(fs_info);
2373 if (ret) {
2374 err = ret;
2375 goto fail_alloc;
2376 }
2377
2378 __setup_root(4096, 4096, 4096, 4096, tree_root,
2379 fs_info, BTRFS_ROOT_TREE_OBJECTID);
2380
2381 invalidate_bdev(fs_devices->latest_bdev);
2382
2383 /*
2384 * Read super block and check the signature bytes only
2385 */
2386 bh = btrfs_read_dev_super(fs_devices->latest_bdev);
2387 if (!bh) {
2388 err = -EINVAL;
2389 goto fail_alloc;
2390 }
2391
2392 /*
2393 * We want to check superblock checksum, the type is stored inside.
2394 * Pass the whole disk block of size BTRFS_SUPER_INFO_SIZE (4k).
2395 */
2396 if (btrfs_check_super_csum(bh->b_data)) {
2397 printk(KERN_ERR "BTRFS: superblock checksum mismatch\n");
2398 err = -EINVAL;
2399 goto fail_alloc;
2400 }
2401
2402 /*
2403 * super_copy is zeroed at allocation time and we never touch the
2404 * following bytes up to INFO_SIZE, the checksum is calculated from
2405 * the whole block of INFO_SIZE
2406 */
2407 memcpy(fs_info->super_copy, bh->b_data, sizeof(*fs_info->super_copy));
2408 memcpy(fs_info->super_for_commit, fs_info->super_copy,
2409 sizeof(*fs_info->super_for_commit));
2410 brelse(bh);
2411
2412 memcpy(fs_info->fsid, fs_info->super_copy->fsid, BTRFS_FSID_SIZE);
2413
2414 ret = btrfs_check_super_valid(fs_info, sb->s_flags & MS_RDONLY);
2415 if (ret) {
2416 printk(KERN_ERR "BTRFS: superblock contains fatal errors\n");
2417 err = -EINVAL;
2418 goto fail_alloc;
2419 }
2420
2421 disk_super = fs_info->super_copy;
2422 if (!btrfs_super_root(disk_super))
2423 goto fail_alloc;
2424
2425 /* check FS state, whether FS is broken. */
2426 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_ERROR)
2427 set_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state);
2428
2429 /*
2430 * run through our array of backup supers and setup
2431 * our ring pointer to the oldest one
2432 */
2433 generation = btrfs_super_generation(disk_super);
2434 find_oldest_super_backup(fs_info, generation);
2435
2436 /*
2437 * In the long term, we'll store the compression type in the super
2438 * block, and it'll be used for per file compression control.
2439 */
2440 fs_info->compress_type = BTRFS_COMPRESS_ZLIB;
2441
2442 ret = btrfs_parse_options(tree_root, options);
2443 if (ret) {
2444 err = ret;
2445 goto fail_alloc;
2446 }
2447
2448 features = btrfs_super_incompat_flags(disk_super) &
2449 ~BTRFS_FEATURE_INCOMPAT_SUPP;
2450 if (features) {
2451 printk(KERN_ERR "BTRFS: couldn't mount because of "
2452 "unsupported optional features (%Lx).\n",
2453 features);
2454 err = -EINVAL;
2455 goto fail_alloc;
2456 }
2457
2458 if (btrfs_super_leafsize(disk_super) !=
2459 btrfs_super_nodesize(disk_super)) {
2460 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2461 "blocksizes don't match. node %d leaf %d\n",
2462 btrfs_super_nodesize(disk_super),
2463 btrfs_super_leafsize(disk_super));
2464 err = -EINVAL;
2465 goto fail_alloc;
2466 }
2467 if (btrfs_super_leafsize(disk_super) > BTRFS_MAX_METADATA_BLOCKSIZE) {
2468 printk(KERN_ERR "BTRFS: couldn't mount because metadata "
2469 "blocksize (%d) was too large\n",
2470 btrfs_super_leafsize(disk_super));
2471 err = -EINVAL;
2472 goto fail_alloc;
2473 }
2474
2475 features = btrfs_super_incompat_flags(disk_super);
2476 features |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
2477 if (tree_root->fs_info->compress_type == BTRFS_COMPRESS_LZO)
2478 features |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
2479
2480 if (features & BTRFS_FEATURE_INCOMPAT_SKINNY_METADATA)
2481 printk(KERN_ERR "BTRFS: has skinny extents\n");
2482
2483 /*
2484 * flag our filesystem as having big metadata blocks if
2485 * they are bigger than the page size
2486 */
2487 if (btrfs_super_leafsize(disk_super) > PAGE_CACHE_SIZE) {
2488 if (!(features & BTRFS_FEATURE_INCOMPAT_BIG_METADATA))
2489 printk(KERN_INFO "BTRFS: flagging fs with big metadata feature\n");
2490 features |= BTRFS_FEATURE_INCOMPAT_BIG_METADATA;
2491 }
2492
2493 nodesize = btrfs_super_nodesize(disk_super);
2494 leafsize = btrfs_super_leafsize(disk_super);
2495 sectorsize = btrfs_super_sectorsize(disk_super);
2496 stripesize = btrfs_super_stripesize(disk_super);
2497 fs_info->dirty_metadata_batch = leafsize * (1 + ilog2(nr_cpu_ids));
2498 fs_info->delalloc_batch = sectorsize * 512 * (1 + ilog2(nr_cpu_ids));
2499
2500 /*
2501 * mixed block groups end up with duplicate but slightly offset
2502 * extent buffers for the same range. It leads to corruptions
2503 */
2504 if ((features & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) &&
2505 (sectorsize != leafsize)) {
2506 printk(KERN_WARNING "BTRFS: unequal leaf/node/sector sizes "
2507 "are not allowed for mixed block groups on %s\n",
2508 sb->s_id);
2509 goto fail_alloc;
2510 }
2511
2512 /*
2513 * Needn't use the lock because there is no other task which will
2514 * update the flag.
2515 */
2516 btrfs_set_super_incompat_flags(disk_super, features);
2517
2518 features = btrfs_super_compat_ro_flags(disk_super) &
2519 ~BTRFS_FEATURE_COMPAT_RO_SUPP;
2520 if (!(sb->s_flags & MS_RDONLY) && features) {
2521 printk(KERN_ERR "BTRFS: couldn't mount RDWR because of "
2522 "unsupported option features (%Lx).\n",
2523 features);
2524 err = -EINVAL;
2525 goto fail_alloc;
2526 }
2527
2528 max_active = fs_info->thread_pool_size;
2529
2530 fs_info->workers =
2531 btrfs_alloc_workqueue("worker", flags | WQ_HIGHPRI,
2532 max_active, 16);
2533
2534 fs_info->delalloc_workers =
2535 btrfs_alloc_workqueue("delalloc", flags, max_active, 2);
2536
2537 fs_info->flush_workers =
2538 btrfs_alloc_workqueue("flush_delalloc", flags, max_active, 0);
2539
2540 fs_info->caching_workers =
2541 btrfs_alloc_workqueue("cache", flags, max_active, 0);
2542
2543 /*
2544 * a higher idle thresh on the submit workers makes it much more
2545 * likely that bios will be send down in a sane order to the
2546 * devices
2547 */
2548 fs_info->submit_workers =
2549 btrfs_alloc_workqueue("submit", flags,
2550 min_t(u64, fs_devices->num_devices,
2551 max_active), 64);
2552
2553 fs_info->fixup_workers =
2554 btrfs_alloc_workqueue("fixup", flags, 1, 0);
2555
2556 /*
2557 * endios are largely parallel and should have a very
2558 * low idle thresh
2559 */
2560 fs_info->endio_workers =
2561 btrfs_alloc_workqueue("endio", flags, max_active, 4);
2562 fs_info->endio_meta_workers =
2563 btrfs_alloc_workqueue("endio-meta", flags, max_active, 4);
2564 fs_info->endio_meta_write_workers =
2565 btrfs_alloc_workqueue("endio-meta-write", flags, max_active, 2);
2566 fs_info->endio_raid56_workers =
2567 btrfs_alloc_workqueue("endio-raid56", flags, max_active, 4);
2568 fs_info->rmw_workers =
2569 btrfs_alloc_workqueue("rmw", flags, max_active, 2);
2570 fs_info->endio_write_workers =
2571 btrfs_alloc_workqueue("endio-write", flags, max_active, 2);
2572 fs_info->endio_freespace_worker =
2573 btrfs_alloc_workqueue("freespace-write", flags, max_active, 0);
2574 fs_info->delayed_workers =
2575 btrfs_alloc_workqueue("delayed-meta", flags, max_active, 0);
2576 fs_info->readahead_workers =
2577 btrfs_alloc_workqueue("readahead", flags, max_active, 2);
2578 fs_info->qgroup_rescan_workers =
2579 btrfs_alloc_workqueue("qgroup-rescan", flags, 1, 0);
2580
2581 if (!(fs_info->workers && fs_info->delalloc_workers &&
2582 fs_info->submit_workers && fs_info->flush_workers &&
2583 fs_info->endio_workers && fs_info->endio_meta_workers &&
2584 fs_info->endio_meta_write_workers &&
2585 fs_info->endio_write_workers && fs_info->endio_raid56_workers &&
2586 fs_info->endio_freespace_worker && fs_info->rmw_workers &&
2587 fs_info->caching_workers && fs_info->readahead_workers &&
2588 fs_info->fixup_workers && fs_info->delayed_workers &&
2589 fs_info->qgroup_rescan_workers)) {
2590 err = -ENOMEM;
2591 goto fail_sb_buffer;
2592 }
2593
2594 fs_info->bdi.ra_pages *= btrfs_super_num_devices(disk_super);
2595 fs_info->bdi.ra_pages = max(fs_info->bdi.ra_pages,
2596 4 * 1024 * 1024 / PAGE_CACHE_SIZE);
2597
2598 tree_root->nodesize = nodesize;
2599 tree_root->leafsize = leafsize;
2600 tree_root->sectorsize = sectorsize;
2601 tree_root->stripesize = stripesize;
2602
2603 sb->s_blocksize = sectorsize;
2604 sb->s_blocksize_bits = blksize_bits(sectorsize);
2605
2606 if (btrfs_super_magic(disk_super) != BTRFS_MAGIC) {
2607 printk(KERN_INFO "BTRFS: valid FS not found on %s\n", sb->s_id);
2608 goto fail_sb_buffer;
2609 }
2610
2611 if (sectorsize != PAGE_SIZE) {
2612 printk(KERN_WARNING "BTRFS: Incompatible sector size(%lu) "
2613 "found on %s\n", (unsigned long)sectorsize, sb->s_id);
2614 goto fail_sb_buffer;
2615 }
2616
2617 mutex_lock(&fs_info->chunk_mutex);
2618 ret = btrfs_read_sys_array(tree_root);
2619 mutex_unlock(&fs_info->chunk_mutex);
2620 if (ret) {
2621 printk(KERN_WARNING "BTRFS: failed to read the system "
2622 "array on %s\n", sb->s_id);
2623 goto fail_sb_buffer;
2624 }
2625
2626 blocksize = btrfs_level_size(tree_root,
2627 btrfs_super_chunk_root_level(disk_super));
2628 generation = btrfs_super_chunk_root_generation(disk_super);
2629
2630 __setup_root(nodesize, leafsize, sectorsize, stripesize,
2631 chunk_root, fs_info, BTRFS_CHUNK_TREE_OBJECTID);
2632
2633 chunk_root->node = read_tree_block(chunk_root,
2634 btrfs_super_chunk_root(disk_super),
2635 blocksize, generation);
2636 if (!chunk_root->node ||
2637 !test_bit(EXTENT_BUFFER_UPTODATE, &chunk_root->node->bflags)) {
2638 printk(KERN_WARNING "BTRFS: failed to read chunk root on %s\n",
2639 sb->s_id);
2640 goto fail_tree_roots;
2641 }
2642 btrfs_set_root_node(&chunk_root->root_item, chunk_root->node);
2643 chunk_root->commit_root = btrfs_root_node(chunk_root);
2644
2645 read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
2646 btrfs_header_chunk_tree_uuid(chunk_root->node), BTRFS_UUID_SIZE);
2647
2648 ret = btrfs_read_chunk_tree(chunk_root);
2649 if (ret) {
2650 printk(KERN_WARNING "BTRFS: failed to read chunk tree on %s\n",
2651 sb->s_id);
2652 goto fail_tree_roots;
2653 }
2654
2655 /*
2656 * keep the device that is marked to be the target device for the
2657 * dev_replace procedure
2658 */
2659 btrfs_close_extra_devices(fs_info, fs_devices, 0);
2660
2661 if (!fs_devices->latest_bdev) {
2662 printk(KERN_CRIT "BTRFS: failed to read devices on %s\n",
2663 sb->s_id);
2664 goto fail_tree_roots;
2665 }
2666
2667retry_root_backup:
2668 blocksize = btrfs_level_size(tree_root,
2669 btrfs_super_root_level(disk_super));
2670 generation = btrfs_super_generation(disk_super);
2671
2672 tree_root->node = read_tree_block(tree_root,
2673 btrfs_super_root(disk_super),
2674 blocksize, generation);
2675 if (!tree_root->node ||
2676 !test_bit(EXTENT_BUFFER_UPTODATE, &tree_root->node->bflags)) {
2677 printk(KERN_WARNING "BTRFS: failed to read tree root on %s\n",
2678 sb->s_id);
2679
2680 goto recovery_tree_root;
2681 }
2682
2683 btrfs_set_root_node(&tree_root->root_item, tree_root->node);
2684 tree_root->commit_root = btrfs_root_node(tree_root);
2685 btrfs_set_root_refs(&tree_root->root_item, 1);
2686
2687 location.objectid = BTRFS_EXTENT_TREE_OBJECTID;
2688 location.type = BTRFS_ROOT_ITEM_KEY;
2689 location.offset = 0;
2690
2691 extent_root = btrfs_read_tree_root(tree_root, &location);
2692 if (IS_ERR(extent_root)) {
2693 ret = PTR_ERR(extent_root);
2694 goto recovery_tree_root;
2695 }
2696 extent_root->track_dirty = 1;
2697 fs_info->extent_root = extent_root;
2698
2699 location.objectid = BTRFS_DEV_TREE_OBJECTID;
2700 dev_root = btrfs_read_tree_root(tree_root, &location);
2701 if (IS_ERR(dev_root)) {
2702 ret = PTR_ERR(dev_root);
2703 goto recovery_tree_root;
2704 }
2705 dev_root->track_dirty = 1;
2706 fs_info->dev_root = dev_root;
2707 btrfs_init_devices_late(fs_info);
2708
2709 location.objectid = BTRFS_CSUM_TREE_OBJECTID;
2710 csum_root = btrfs_read_tree_root(tree_root, &location);
2711 if (IS_ERR(csum_root)) {
2712 ret = PTR_ERR(csum_root);
2713 goto recovery_tree_root;
2714 }
2715 csum_root->track_dirty = 1;
2716 fs_info->csum_root = csum_root;
2717
2718 location.objectid = BTRFS_QUOTA_TREE_OBJECTID;
2719 quota_root = btrfs_read_tree_root(tree_root, &location);
2720 if (!IS_ERR(quota_root)) {
2721 quota_root->track_dirty = 1;
2722 fs_info->quota_enabled = 1;
2723 fs_info->pending_quota_state = 1;
2724 fs_info->quota_root = quota_root;
2725 }
2726
2727 location.objectid = BTRFS_UUID_TREE_OBJECTID;
2728 uuid_root = btrfs_read_tree_root(tree_root, &location);
2729 if (IS_ERR(uuid_root)) {
2730 ret = PTR_ERR(uuid_root);
2731 if (ret != -ENOENT)
2732 goto recovery_tree_root;
2733 create_uuid_tree = true;
2734 check_uuid_tree = false;
2735 } else {
2736 uuid_root->track_dirty = 1;
2737 fs_info->uuid_root = uuid_root;
2738 create_uuid_tree = false;
2739 check_uuid_tree =
2740 generation != btrfs_super_uuid_tree_generation(disk_super);
2741 }
2742
2743 fs_info->generation = generation;
2744 fs_info->last_trans_committed = generation;
2745
2746 ret = btrfs_recover_balance(fs_info);
2747 if (ret) {
2748 printk(KERN_WARNING "BTRFS: failed to recover balance\n");
2749 goto fail_block_groups;
2750 }
2751
2752 ret = btrfs_init_dev_stats(fs_info);
2753 if (ret) {
2754 printk(KERN_ERR "BTRFS: failed to init dev_stats: %d\n",
2755 ret);
2756 goto fail_block_groups;
2757 }
2758
2759 ret = btrfs_init_dev_replace(fs_info);
2760 if (ret) {
2761 pr_err("BTRFS: failed to init dev_replace: %d\n", ret);
2762 goto fail_block_groups;
2763 }
2764
2765 btrfs_close_extra_devices(fs_info, fs_devices, 1);
2766
2767 ret = btrfs_sysfs_add_one(fs_info);
2768 if (ret) {
2769 pr_err("BTRFS: failed to init sysfs interface: %d\n", ret);
2770 goto fail_block_groups;
2771 }
2772
2773 ret = btrfs_init_space_info(fs_info);
2774 if (ret) {
2775 printk(KERN_ERR "BTRFS: Failed to initial space info: %d\n", ret);
2776 goto fail_sysfs;
2777 }
2778
2779 ret = btrfs_read_block_groups(extent_root);
2780 if (ret) {
2781 printk(KERN_ERR "BTRFS: Failed to read block groups: %d\n", ret);
2782 goto fail_sysfs;
2783 }
2784 fs_info->num_tolerated_disk_barrier_failures =
2785 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info);
2786 if (fs_info->fs_devices->missing_devices >
2787 fs_info->num_tolerated_disk_barrier_failures &&
2788 !(sb->s_flags & MS_RDONLY)) {
2789 printk(KERN_WARNING "BTRFS: "
2790 "too many missing devices, writeable mount is not allowed\n");
2791 goto fail_sysfs;
2792 }
2793
2794 fs_info->cleaner_kthread = kthread_run(cleaner_kthread, tree_root,
2795 "btrfs-cleaner");
2796 if (IS_ERR(fs_info->cleaner_kthread))
2797 goto fail_sysfs;
2798
2799 fs_info->transaction_kthread = kthread_run(transaction_kthread,
2800 tree_root,
2801 "btrfs-transaction");
2802 if (IS_ERR(fs_info->transaction_kthread))
2803 goto fail_cleaner;
2804
2805 if (!btrfs_test_opt(tree_root, SSD) &&
2806 !btrfs_test_opt(tree_root, NOSSD) &&
2807 !fs_info->fs_devices->rotating) {
2808 printk(KERN_INFO "BTRFS: detected SSD devices, enabling SSD "
2809 "mode\n");
2810 btrfs_set_opt(fs_info->mount_opt, SSD);
2811 }
2812
2813 /* Set the real inode map cache flag */
2814 if (btrfs_test_opt(tree_root, CHANGE_INODE_CACHE))
2815 btrfs_set_opt(tree_root->fs_info->mount_opt, INODE_MAP_CACHE);
2816
2817#ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
2818 if (btrfs_test_opt(tree_root, CHECK_INTEGRITY)) {
2819 ret = btrfsic_mount(tree_root, fs_devices,
2820 btrfs_test_opt(tree_root,
2821 CHECK_INTEGRITY_INCLUDING_EXTENT_DATA) ?
2822 1 : 0,
2823 fs_info->check_integrity_print_mask);
2824 if (ret)
2825 printk(KERN_WARNING "BTRFS: failed to initialize"
2826 " integrity check module %s\n", sb->s_id);
2827 }
2828#endif
2829 ret = btrfs_read_qgroup_config(fs_info);
2830 if (ret)
2831 goto fail_trans_kthread;
2832
2833 /* do not make disk changes in broken FS */
2834 if (btrfs_super_log_root(disk_super) != 0) {
2835 u64 bytenr = btrfs_super_log_root(disk_super);
2836
2837 if (fs_devices->rw_devices == 0) {
2838 printk(KERN_WARNING "BTRFS: log replay required "
2839 "on RO media\n");
2840 err = -EIO;
2841 goto fail_qgroup;
2842 }
2843 blocksize =
2844 btrfs_level_size(tree_root,
2845 btrfs_super_log_root_level(disk_super));
2846
2847 log_tree_root = btrfs_alloc_root(fs_info);
2848 if (!log_tree_root) {
2849 err = -ENOMEM;
2850 goto fail_qgroup;
2851 }
2852
2853 __setup_root(nodesize, leafsize, sectorsize, stripesize,
2854 log_tree_root, fs_info, BTRFS_TREE_LOG_OBJECTID);
2855
2856 log_tree_root->node = read_tree_block(tree_root, bytenr,
2857 blocksize,
2858 generation + 1);
2859 if (!log_tree_root->node ||
2860 !extent_buffer_uptodate(log_tree_root->node)) {
2861 printk(KERN_ERR "BTRFS: failed to read log tree\n");
2862 free_extent_buffer(log_tree_root->node);
2863 kfree(log_tree_root);
2864 goto fail_qgroup;
2865 }
2866 /* returns with log_tree_root freed on success */
2867 ret = btrfs_recover_log_trees(log_tree_root);
2868 if (ret) {
2869 btrfs_error(tree_root->fs_info, ret,
2870 "Failed to recover log tree");
2871 free_extent_buffer(log_tree_root->node);
2872 kfree(log_tree_root);
2873 goto fail_qgroup;
2874 }
2875
2876 if (sb->s_flags & MS_RDONLY) {
2877 ret = btrfs_commit_super(tree_root);
2878 if (ret)
2879 goto fail_qgroup;
2880 }
2881 }
2882
2883 ret = btrfs_find_orphan_roots(tree_root);
2884 if (ret)
2885 goto fail_qgroup;
2886
2887 if (!(sb->s_flags & MS_RDONLY)) {
2888 ret = btrfs_cleanup_fs_roots(fs_info);
2889 if (ret)
2890 goto fail_qgroup;
2891
2892 ret = btrfs_recover_relocation(tree_root);
2893 if (ret < 0) {
2894 printk(KERN_WARNING
2895 "BTRFS: failed to recover relocation\n");
2896 err = -EINVAL;
2897 goto fail_qgroup;
2898 }
2899 }
2900
2901 location.objectid = BTRFS_FS_TREE_OBJECTID;
2902 location.type = BTRFS_ROOT_ITEM_KEY;
2903 location.offset = 0;
2904
2905 fs_info->fs_root = btrfs_read_fs_root_no_name(fs_info, &location);
2906 if (IS_ERR(fs_info->fs_root)) {
2907 err = PTR_ERR(fs_info->fs_root);
2908 goto fail_qgroup;
2909 }
2910
2911 if (sb->s_flags & MS_RDONLY)
2912 return 0;
2913
2914 down_read(&fs_info->cleanup_work_sem);
2915 if ((ret = btrfs_orphan_cleanup(fs_info->fs_root)) ||
2916 (ret = btrfs_orphan_cleanup(fs_info->tree_root))) {
2917 up_read(&fs_info->cleanup_work_sem);
2918 close_ctree(tree_root);
2919 return ret;
2920 }
2921 up_read(&fs_info->cleanup_work_sem);
2922
2923 ret = btrfs_resume_balance_async(fs_info);
2924 if (ret) {
2925 printk(KERN_WARNING "BTRFS: failed to resume balance\n");
2926 close_ctree(tree_root);
2927 return ret;
2928 }
2929
2930 ret = btrfs_resume_dev_replace_async(fs_info);
2931 if (ret) {
2932 pr_warn("BTRFS: failed to resume dev_replace\n");
2933 close_ctree(tree_root);
2934 return ret;
2935 }
2936
2937 btrfs_qgroup_rescan_resume(fs_info);
2938
2939 if (create_uuid_tree) {
2940 pr_info("BTRFS: creating UUID tree\n");
2941 ret = btrfs_create_uuid_tree(fs_info);
2942 if (ret) {
2943 pr_warn("BTRFS: failed to create the UUID tree %d\n",
2944 ret);
2945 close_ctree(tree_root);
2946 return ret;
2947 }
2948 } else if (check_uuid_tree ||
2949 btrfs_test_opt(tree_root, RESCAN_UUID_TREE)) {
2950 pr_info("BTRFS: checking UUID tree\n");
2951 ret = btrfs_check_uuid_tree(fs_info);
2952 if (ret) {
2953 pr_warn("BTRFS: failed to check the UUID tree %d\n",
2954 ret);
2955 close_ctree(tree_root);
2956 return ret;
2957 }
2958 } else {
2959 fs_info->update_uuid_tree_gen = 1;
2960 }
2961
2962 return 0;
2963
2964fail_qgroup:
2965 btrfs_free_qgroup_config(fs_info);
2966fail_trans_kthread:
2967 kthread_stop(fs_info->transaction_kthread);
2968 btrfs_cleanup_transaction(fs_info->tree_root);
2969 del_fs_roots(fs_info);
2970fail_cleaner:
2971 kthread_stop(fs_info->cleaner_kthread);
2972
2973 /*
2974 * make sure we're done with the btree inode before we stop our
2975 * kthreads
2976 */
2977 filemap_write_and_wait(fs_info->btree_inode->i_mapping);
2978
2979fail_sysfs:
2980 btrfs_sysfs_remove_one(fs_info);
2981
2982fail_block_groups:
2983 btrfs_put_block_group_cache(fs_info);
2984 btrfs_free_block_groups(fs_info);
2985
2986fail_tree_roots:
2987 free_root_pointers(fs_info, 1);
2988 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
2989
2990fail_sb_buffer:
2991 btrfs_stop_all_workers(fs_info);
2992fail_alloc:
2993fail_iput:
2994 btrfs_mapping_tree_free(&fs_info->mapping_tree);
2995
2996 iput(fs_info->btree_inode);
2997fail_bio_counter:
2998 percpu_counter_destroy(&fs_info->bio_counter);
2999fail_delalloc_bytes:
3000 percpu_counter_destroy(&fs_info->delalloc_bytes);
3001fail_dirty_metadata_bytes:
3002 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
3003fail_bdi:
3004 bdi_destroy(&fs_info->bdi);
3005fail_srcu:
3006 cleanup_srcu_struct(&fs_info->subvol_srcu);
3007fail:
3008 btrfs_free_stripe_hash_table(fs_info);
3009 btrfs_close_devices(fs_info->fs_devices);
3010 return err;
3011
3012recovery_tree_root:
3013 if (!btrfs_test_opt(tree_root, RECOVERY))
3014 goto fail_tree_roots;
3015
3016 free_root_pointers(fs_info, 0);
3017
3018 /* don't use the log in recovery mode, it won't be valid */
3019 btrfs_set_super_log_root(disk_super, 0);
3020
3021 /* we can't trust the free space cache either */
3022 btrfs_set_opt(fs_info->mount_opt, CLEAR_CACHE);
3023
3024 ret = next_root_backup(fs_info, fs_info->super_copy,
3025 &num_backups_tried, &backup_index);
3026 if (ret == -1)
3027 goto fail_block_groups;
3028 goto retry_root_backup;
3029}
3030
3031static void btrfs_end_buffer_write_sync(struct buffer_head *bh, int uptodate)
3032{
3033 if (uptodate) {
3034 set_buffer_uptodate(bh);
3035 } else {
3036 struct btrfs_device *device = (struct btrfs_device *)
3037 bh->b_private;
3038
3039 printk_ratelimited_in_rcu(KERN_WARNING "BTRFS: lost page write due to "
3040 "I/O error on %s\n",
3041 rcu_str_deref(device->name));
3042 /* note, we dont' set_buffer_write_io_error because we have
3043 * our own ways of dealing with the IO errors
3044 */
3045 clear_buffer_uptodate(bh);
3046 btrfs_dev_stat_inc_and_print(device, BTRFS_DEV_STAT_WRITE_ERRS);
3047 }
3048 unlock_buffer(bh);
3049 put_bh(bh);
3050}
3051
3052struct buffer_head *btrfs_read_dev_super(struct block_device *bdev)
3053{
3054 struct buffer_head *bh;
3055 struct buffer_head *latest = NULL;
3056 struct btrfs_super_block *super;
3057 int i;
3058 u64 transid = 0;
3059 u64 bytenr;
3060
3061 /* we would like to check all the supers, but that would make
3062 * a btrfs mount succeed after a mkfs from a different FS.
3063 * So, we need to add a special mount option to scan for
3064 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
3065 */
3066 for (i = 0; i < 1; i++) {
3067 bytenr = btrfs_sb_offset(i);
3068 if (bytenr + BTRFS_SUPER_INFO_SIZE >=
3069 i_size_read(bdev->bd_inode))
3070 break;
3071 bh = __bread(bdev, bytenr / 4096,
3072 BTRFS_SUPER_INFO_SIZE);
3073 if (!bh)
3074 continue;
3075
3076 super = (struct btrfs_super_block *)bh->b_data;
3077 if (btrfs_super_bytenr(super) != bytenr ||
3078 btrfs_super_magic(super) != BTRFS_MAGIC) {
3079 brelse(bh);
3080 continue;
3081 }
3082
3083 if (!latest || btrfs_super_generation(super) > transid) {
3084 brelse(latest);
3085 latest = bh;
3086 transid = btrfs_super_generation(super);
3087 } else {
3088 brelse(bh);
3089 }
3090 }
3091 return latest;
3092}
3093
3094/*
3095 * this should be called twice, once with wait == 0 and
3096 * once with wait == 1. When wait == 0 is done, all the buffer heads
3097 * we write are pinned.
3098 *
3099 * They are released when wait == 1 is done.
3100 * max_mirrors must be the same for both runs, and it indicates how
3101 * many supers on this one device should be written.
3102 *
3103 * max_mirrors == 0 means to write them all.
3104 */
3105static int write_dev_supers(struct btrfs_device *device,
3106 struct btrfs_super_block *sb,
3107 int do_barriers, int wait, int max_mirrors)
3108{
3109 struct buffer_head *bh;
3110 int i;
3111 int ret;
3112 int errors = 0;
3113 u32 crc;
3114 u64 bytenr;
3115
3116 if (max_mirrors == 0)
3117 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
3118
3119 for (i = 0; i < max_mirrors; i++) {
3120 bytenr = btrfs_sb_offset(i);
3121 if (bytenr + BTRFS_SUPER_INFO_SIZE >= device->total_bytes)
3122 break;
3123
3124 if (wait) {
3125 bh = __find_get_block(device->bdev, bytenr / 4096,
3126 BTRFS_SUPER_INFO_SIZE);
3127 if (!bh) {
3128 errors++;
3129 continue;
3130 }
3131 wait_on_buffer(bh);
3132 if (!buffer_uptodate(bh))
3133 errors++;
3134
3135 /* drop our reference */
3136 brelse(bh);
3137
3138 /* drop the reference from the wait == 0 run */
3139 brelse(bh);
3140 continue;
3141 } else {
3142 btrfs_set_super_bytenr(sb, bytenr);
3143
3144 crc = ~(u32)0;
3145 crc = btrfs_csum_data((char *)sb +
3146 BTRFS_CSUM_SIZE, crc,
3147 BTRFS_SUPER_INFO_SIZE -
3148 BTRFS_CSUM_SIZE);
3149 btrfs_csum_final(crc, sb->csum);
3150
3151 /*
3152 * one reference for us, and we leave it for the
3153 * caller
3154 */
3155 bh = __getblk(device->bdev, bytenr / 4096,
3156 BTRFS_SUPER_INFO_SIZE);
3157 if (!bh) {
3158 printk(KERN_ERR "BTRFS: couldn't get super "
3159 "buffer head for bytenr %Lu\n", bytenr);
3160 errors++;
3161 continue;
3162 }
3163
3164 memcpy(bh->b_data, sb, BTRFS_SUPER_INFO_SIZE);
3165
3166 /* one reference for submit_bh */
3167 get_bh(bh);
3168
3169 set_buffer_uptodate(bh);
3170 lock_buffer(bh);
3171 bh->b_end_io = btrfs_end_buffer_write_sync;
3172 bh->b_private = device;
3173 }
3174
3175 /*
3176 * we fua the first super. The others we allow
3177 * to go down lazy.
3178 */
3179 if (i == 0)
3180 ret = btrfsic_submit_bh(WRITE_FUA, bh);
3181 else
3182 ret = btrfsic_submit_bh(WRITE_SYNC, bh);
3183 if (ret)
3184 errors++;
3185 }
3186 return errors < i ? 0 : -1;
3187}
3188
3189/*
3190 * endio for the write_dev_flush, this will wake anyone waiting
3191 * for the barrier when it is done
3192 */
3193static void btrfs_end_empty_barrier(struct bio *bio, int err)
3194{
3195 if (err) {
3196 if (err == -EOPNOTSUPP)
3197 set_bit(BIO_EOPNOTSUPP, &bio->bi_flags);
3198 clear_bit(BIO_UPTODATE, &bio->bi_flags);
3199 }
3200 if (bio->bi_private)
3201 complete(bio->bi_private);
3202 bio_put(bio);
3203}
3204
3205/*
3206 * trigger flushes for one the devices. If you pass wait == 0, the flushes are
3207 * sent down. With wait == 1, it waits for the previous flush.
3208 *
3209 * any device where the flush fails with eopnotsupp are flagged as not-barrier
3210 * capable
3211 */
3212static int write_dev_flush(struct btrfs_device *device, int wait)
3213{
3214 struct bio *bio;
3215 int ret = 0;
3216
3217 if (device->nobarriers)
3218 return 0;
3219
3220 if (wait) {
3221 bio = device->flush_bio;
3222 if (!bio)
3223 return 0;
3224
3225 wait_for_completion(&device->flush_wait);
3226
3227 if (bio_flagged(bio, BIO_EOPNOTSUPP)) {
3228 printk_in_rcu("BTRFS: disabling barriers on dev %s\n",
3229 rcu_str_deref(device->name));
3230 device->nobarriers = 1;
3231 } else if (!bio_flagged(bio, BIO_UPTODATE)) {
3232 ret = -EIO;
3233 btrfs_dev_stat_inc_and_print(device,
3234 BTRFS_DEV_STAT_FLUSH_ERRS);
3235 }
3236
3237 /* drop the reference from the wait == 0 run */
3238 bio_put(bio);
3239 device->flush_bio = NULL;
3240
3241 return ret;
3242 }
3243
3244 /*
3245 * one reference for us, and we leave it for the
3246 * caller
3247 */
3248 device->flush_bio = NULL;
3249 bio = btrfs_io_bio_alloc(GFP_NOFS, 0);
3250 if (!bio)
3251 return -ENOMEM;
3252
3253 bio->bi_end_io = btrfs_end_empty_barrier;
3254 bio->bi_bdev = device->bdev;
3255 init_completion(&device->flush_wait);
3256 bio->bi_private = &device->flush_wait;
3257 device->flush_bio = bio;
3258
3259 bio_get(bio);
3260 btrfsic_submit_bio(WRITE_FLUSH, bio);
3261
3262 return 0;
3263}
3264
3265/*
3266 * send an empty flush down to each device in parallel,
3267 * then wait for them
3268 */
3269static int barrier_all_devices(struct btrfs_fs_info *info)
3270{
3271 struct list_head *head;
3272 struct btrfs_device *dev;
3273 int errors_send = 0;
3274 int errors_wait = 0;
3275 int ret;
3276
3277 /* send down all the barriers */
3278 head = &info->fs_devices->devices;
3279 list_for_each_entry_rcu(dev, head, dev_list) {
3280 if (dev->missing)
3281 continue;
3282 if (!dev->bdev) {
3283 errors_send++;
3284 continue;
3285 }
3286 if (!dev->in_fs_metadata || !dev->writeable)
3287 continue;
3288
3289 ret = write_dev_flush(dev, 0);
3290 if (ret)
3291 errors_send++;
3292 }
3293
3294 /* wait for all the barriers */
3295 list_for_each_entry_rcu(dev, head, dev_list) {
3296 if (dev->missing)
3297 continue;
3298 if (!dev->bdev) {
3299 errors_wait++;
3300 continue;
3301 }
3302 if (!dev->in_fs_metadata || !dev->writeable)
3303 continue;
3304
3305 ret = write_dev_flush(dev, 1);
3306 if (ret)
3307 errors_wait++;
3308 }
3309 if (errors_send > info->num_tolerated_disk_barrier_failures ||
3310 errors_wait > info->num_tolerated_disk_barrier_failures)
3311 return -EIO;
3312 return 0;
3313}
3314
3315int btrfs_calc_num_tolerated_disk_barrier_failures(
3316 struct btrfs_fs_info *fs_info)
3317{
3318 struct btrfs_ioctl_space_info space;
3319 struct btrfs_space_info *sinfo;
3320 u64 types[] = {BTRFS_BLOCK_GROUP_DATA,
3321 BTRFS_BLOCK_GROUP_SYSTEM,
3322 BTRFS_BLOCK_GROUP_METADATA,
3323 BTRFS_BLOCK_GROUP_DATA | BTRFS_BLOCK_GROUP_METADATA};
3324 int num_types = 4;
3325 int i;
3326 int c;
3327 int num_tolerated_disk_barrier_failures =
3328 (int)fs_info->fs_devices->num_devices;
3329
3330 for (i = 0; i < num_types; i++) {
3331 struct btrfs_space_info *tmp;
3332
3333 sinfo = NULL;
3334 rcu_read_lock();
3335 list_for_each_entry_rcu(tmp, &fs_info->space_info, list) {
3336 if (tmp->flags == types[i]) {
3337 sinfo = tmp;
3338 break;
3339 }
3340 }
3341 rcu_read_unlock();
3342
3343 if (!sinfo)
3344 continue;
3345
3346 down_read(&sinfo->groups_sem);
3347 for (c = 0; c < BTRFS_NR_RAID_TYPES; c++) {
3348 if (!list_empty(&sinfo->block_groups[c])) {
3349 u64 flags;
3350
3351 btrfs_get_block_group_info(
3352 &sinfo->block_groups[c], &space);
3353 if (space.total_bytes == 0 ||
3354 space.used_bytes == 0)
3355 continue;
3356 flags = space.flags;
3357 /*
3358 * return
3359 * 0: if dup, single or RAID0 is configured for
3360 * any of metadata, system or data, else
3361 * 1: if RAID5 is configured, or if RAID1 or
3362 * RAID10 is configured and only two mirrors
3363 * are used, else
3364 * 2: if RAID6 is configured, else
3365 * num_mirrors - 1: if RAID1 or RAID10 is
3366 * configured and more than
3367 * 2 mirrors are used.
3368 */
3369 if (num_tolerated_disk_barrier_failures > 0 &&
3370 ((flags & (BTRFS_BLOCK_GROUP_DUP |
3371 BTRFS_BLOCK_GROUP_RAID0)) ||
3372 ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK)
3373 == 0)))
3374 num_tolerated_disk_barrier_failures = 0;
3375 else if (num_tolerated_disk_barrier_failures > 1) {
3376 if (flags & (BTRFS_BLOCK_GROUP_RAID1 |
3377 BTRFS_BLOCK_GROUP_RAID5 |
3378 BTRFS_BLOCK_GROUP_RAID10)) {
3379 num_tolerated_disk_barrier_failures = 1;
3380 } else if (flags &
3381 BTRFS_BLOCK_GROUP_RAID6) {
3382 num_tolerated_disk_barrier_failures = 2;
3383 }
3384 }
3385 }
3386 }
3387 up_read(&sinfo->groups_sem);
3388 }
3389
3390 return num_tolerated_disk_barrier_failures;
3391}
3392
3393static int write_all_supers(struct btrfs_root *root, int max_mirrors)
3394{
3395 struct list_head *head;
3396 struct btrfs_device *dev;
3397 struct btrfs_super_block *sb;
3398 struct btrfs_dev_item *dev_item;
3399 int ret;
3400 int do_barriers;
3401 int max_errors;
3402 int total_errors = 0;
3403 u64 flags;
3404
3405 do_barriers = !btrfs_test_opt(root, NOBARRIER);
3406 backup_super_roots(root->fs_info);
3407
3408 sb = root->fs_info->super_for_commit;
3409 dev_item = &sb->dev_item;
3410
3411 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
3412 head = &root->fs_info->fs_devices->devices;
3413 max_errors = btrfs_super_num_devices(root->fs_info->super_copy) - 1;
3414
3415 if (do_barriers) {
3416 ret = barrier_all_devices(root->fs_info);
3417 if (ret) {
3418 mutex_unlock(
3419 &root->fs_info->fs_devices->device_list_mutex);
3420 btrfs_error(root->fs_info, ret,
3421 "errors while submitting device barriers.");
3422 return ret;
3423 }
3424 }
3425
3426 list_for_each_entry_rcu(dev, head, dev_list) {
3427 if (!dev->bdev) {
3428 total_errors++;
3429 continue;
3430 }
3431 if (!dev->in_fs_metadata || !dev->writeable)
3432 continue;
3433
3434 btrfs_set_stack_device_generation(dev_item, 0);
3435 btrfs_set_stack_device_type(dev_item, dev->type);
3436 btrfs_set_stack_device_id(dev_item, dev->devid);
3437 btrfs_set_stack_device_total_bytes(dev_item, dev->total_bytes);
3438 btrfs_set_stack_device_bytes_used(dev_item, dev->bytes_used);
3439 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
3440 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
3441 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
3442 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
3443 memcpy(dev_item->fsid, dev->fs_devices->fsid, BTRFS_UUID_SIZE);
3444
3445 flags = btrfs_super_flags(sb);
3446 btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
3447
3448 ret = write_dev_supers(dev, sb, do_barriers, 0, max_mirrors);
3449 if (ret)
3450 total_errors++;
3451 }
3452 if (total_errors > max_errors) {
3453 btrfs_err(root->fs_info, "%d errors while writing supers",
3454 total_errors);
3455 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
3456
3457 /* FUA is masked off if unsupported and can't be the reason */
3458 btrfs_error(root->fs_info, -EIO,
3459 "%d errors while writing supers", total_errors);
3460 return -EIO;
3461 }
3462
3463 total_errors = 0;
3464 list_for_each_entry_rcu(dev, head, dev_list) {
3465 if (!dev->bdev)
3466 continue;
3467 if (!dev->in_fs_metadata || !dev->writeable)
3468 continue;
3469
3470 ret = write_dev_supers(dev, sb, do_barriers, 1, max_mirrors);
3471 if (ret)
3472 total_errors++;
3473 }
3474 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
3475 if (total_errors > max_errors) {
3476 btrfs_error(root->fs_info, -EIO,
3477 "%d errors while writing supers", total_errors);
3478 return -EIO;
3479 }
3480 return 0;
3481}
3482
3483int write_ctree_super(struct btrfs_trans_handle *trans,
3484 struct btrfs_root *root, int max_mirrors)
3485{
3486 return write_all_supers(root, max_mirrors);
3487}
3488
3489/* Drop a fs root from the radix tree and free it. */
3490void btrfs_drop_and_free_fs_root(struct btrfs_fs_info *fs_info,
3491 struct btrfs_root *root)
3492{
3493 spin_lock(&fs_info->fs_roots_radix_lock);
3494 radix_tree_delete(&fs_info->fs_roots_radix,
3495 (unsigned long)root->root_key.objectid);
3496 spin_unlock(&fs_info->fs_roots_radix_lock);
3497
3498 if (btrfs_root_refs(&root->root_item) == 0)
3499 synchronize_srcu(&fs_info->subvol_srcu);
3500
3501 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
3502 btrfs_free_log(NULL, root);
3503
3504 __btrfs_remove_free_space_cache(root->free_ino_pinned);
3505 __btrfs_remove_free_space_cache(root->free_ino_ctl);
3506 free_fs_root(root);
3507}
3508
3509static void free_fs_root(struct btrfs_root *root)
3510{
3511 iput(root->cache_inode);
3512 WARN_ON(!RB_EMPTY_ROOT(&root->inode_tree));
3513 btrfs_free_block_rsv(root, root->orphan_block_rsv);
3514 root->orphan_block_rsv = NULL;
3515 if (root->anon_dev)
3516 free_anon_bdev(root->anon_dev);
3517 if (root->subv_writers)
3518 btrfs_free_subvolume_writers(root->subv_writers);
3519 free_extent_buffer(root->node);
3520 free_extent_buffer(root->commit_root);
3521 kfree(root->free_ino_ctl);
3522 kfree(root->free_ino_pinned);
3523 kfree(root->name);
3524 btrfs_put_fs_root(root);
3525}
3526
3527void btrfs_free_fs_root(struct btrfs_root *root)
3528{
3529 free_fs_root(root);
3530}
3531
3532int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
3533{
3534 u64 root_objectid = 0;
3535 struct btrfs_root *gang[8];
3536 int i;
3537 int ret;
3538
3539 while (1) {
3540 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
3541 (void **)gang, root_objectid,
3542 ARRAY_SIZE(gang));
3543 if (!ret)
3544 break;
3545
3546 root_objectid = gang[ret - 1]->root_key.objectid + 1;
3547 for (i = 0; i < ret; i++) {
3548 int err;
3549
3550 root_objectid = gang[i]->root_key.objectid;
3551 err = btrfs_orphan_cleanup(gang[i]);
3552 if (err)
3553 return err;
3554 }
3555 root_objectid++;
3556 }
3557 return 0;
3558}
3559
3560int btrfs_commit_super(struct btrfs_root *root)
3561{
3562 struct btrfs_trans_handle *trans;
3563
3564 mutex_lock(&root->fs_info->cleaner_mutex);
3565 btrfs_run_delayed_iputs(root);
3566 mutex_unlock(&root->fs_info->cleaner_mutex);
3567 wake_up_process(root->fs_info->cleaner_kthread);
3568
3569 /* wait until ongoing cleanup work done */
3570 down_write(&root->fs_info->cleanup_work_sem);
3571 up_write(&root->fs_info->cleanup_work_sem);
3572
3573 trans = btrfs_join_transaction(root);
3574 if (IS_ERR(trans))
3575 return PTR_ERR(trans);
3576 return btrfs_commit_transaction(trans, root);
3577}
3578
3579int close_ctree(struct btrfs_root *root)
3580{
3581 struct btrfs_fs_info *fs_info = root->fs_info;
3582 int ret;
3583
3584 fs_info->closing = 1;
3585 smp_mb();
3586
3587 /* wait for the uuid_scan task to finish */
3588 down(&fs_info->uuid_tree_rescan_sem);
3589 /* avoid complains from lockdep et al., set sem back to initial state */
3590 up(&fs_info->uuid_tree_rescan_sem);
3591
3592 /* pause restriper - we want to resume on mount */
3593 btrfs_pause_balance(fs_info);
3594
3595 btrfs_dev_replace_suspend_for_unmount(fs_info);
3596
3597 btrfs_scrub_cancel(fs_info);
3598
3599 /* wait for any defraggers to finish */
3600 wait_event(fs_info->transaction_wait,
3601 (atomic_read(&fs_info->defrag_running) == 0));
3602
3603 /* clear out the rbtree of defraggable inodes */
3604 btrfs_cleanup_defrag_inodes(fs_info);
3605
3606 if (!(fs_info->sb->s_flags & MS_RDONLY)) {
3607 ret = btrfs_commit_super(root);
3608 if (ret)
3609 btrfs_err(root->fs_info, "commit super ret %d", ret);
3610 }
3611
3612 if (test_bit(BTRFS_FS_STATE_ERROR, &fs_info->fs_state))
3613 btrfs_error_commit_super(root);
3614
3615 kthread_stop(fs_info->transaction_kthread);
3616 kthread_stop(fs_info->cleaner_kthread);
3617
3618 fs_info->closing = 2;
3619 smp_mb();
3620
3621 btrfs_free_qgroup_config(root->fs_info);
3622
3623 if (percpu_counter_sum(&fs_info->delalloc_bytes)) {
3624 btrfs_info(root->fs_info, "at unmount delalloc count %lld",
3625 percpu_counter_sum(&fs_info->delalloc_bytes));
3626 }
3627
3628 btrfs_sysfs_remove_one(fs_info);
3629
3630 del_fs_roots(fs_info);
3631
3632 btrfs_put_block_group_cache(fs_info);
3633
3634 btrfs_free_block_groups(fs_info);
3635
3636 btrfs_stop_all_workers(fs_info);
3637
3638 free_root_pointers(fs_info, 1);
3639
3640 iput(fs_info->btree_inode);
3641
3642#ifdef CONFIG_BTRFS_FS_CHECK_INTEGRITY
3643 if (btrfs_test_opt(root, CHECK_INTEGRITY))
3644 btrfsic_unmount(root, fs_info->fs_devices);
3645#endif
3646
3647 btrfs_close_devices(fs_info->fs_devices);
3648 btrfs_mapping_tree_free(&fs_info->mapping_tree);
3649
3650 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
3651 percpu_counter_destroy(&fs_info->delalloc_bytes);
3652 percpu_counter_destroy(&fs_info->bio_counter);
3653 bdi_destroy(&fs_info->bdi);
3654 cleanup_srcu_struct(&fs_info->subvol_srcu);
3655
3656 btrfs_free_stripe_hash_table(fs_info);
3657
3658 btrfs_free_block_rsv(root, root->orphan_block_rsv);
3659 root->orphan_block_rsv = NULL;
3660
3661 return 0;
3662}
3663
3664int btrfs_buffer_uptodate(struct extent_buffer *buf, u64 parent_transid,
3665 int atomic)
3666{
3667 int ret;
3668 struct inode *btree_inode = buf->pages[0]->mapping->host;
3669
3670 ret = extent_buffer_uptodate(buf);
3671 if (!ret)
3672 return ret;
3673
3674 ret = verify_parent_transid(&BTRFS_I(btree_inode)->io_tree, buf,
3675 parent_transid, atomic);
3676 if (ret == -EAGAIN)
3677 return ret;
3678 return !ret;
3679}
3680
3681int btrfs_set_buffer_uptodate(struct extent_buffer *buf)
3682{
3683 return set_extent_buffer_uptodate(buf);
3684}
3685
3686void btrfs_mark_buffer_dirty(struct extent_buffer *buf)
3687{
3688 struct btrfs_root *root;
3689 u64 transid = btrfs_header_generation(buf);
3690 int was_dirty;
3691
3692#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
3693 /*
3694 * This is a fast path so only do this check if we have sanity tests
3695 * enabled. Normal people shouldn't be marking dummy buffers as dirty
3696 * outside of the sanity tests.
3697 */
3698 if (unlikely(test_bit(EXTENT_BUFFER_DUMMY, &buf->bflags)))
3699 return;
3700#endif
3701 root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3702 btrfs_assert_tree_locked(buf);
3703 if (transid != root->fs_info->generation)
3704 WARN(1, KERN_CRIT "btrfs transid mismatch buffer %llu, "
3705 "found %llu running %llu\n",
3706 buf->start, transid, root->fs_info->generation);
3707 was_dirty = set_extent_buffer_dirty(buf);
3708 if (!was_dirty)
3709 __percpu_counter_add(&root->fs_info->dirty_metadata_bytes,
3710 buf->len,
3711 root->fs_info->dirty_metadata_batch);
3712}
3713
3714static void __btrfs_btree_balance_dirty(struct btrfs_root *root,
3715 int flush_delayed)
3716{
3717 /*
3718 * looks as though older kernels can get into trouble with
3719 * this code, they end up stuck in balance_dirty_pages forever
3720 */
3721 int ret;
3722
3723 if (current->flags & PF_MEMALLOC)
3724 return;
3725
3726 if (flush_delayed)
3727 btrfs_balance_delayed_items(root);
3728
3729 ret = percpu_counter_compare(&root->fs_info->dirty_metadata_bytes,
3730 BTRFS_DIRTY_METADATA_THRESH);
3731 if (ret > 0) {
3732 balance_dirty_pages_ratelimited(
3733 root->fs_info->btree_inode->i_mapping);
3734 }
3735 return;
3736}
3737
3738void btrfs_btree_balance_dirty(struct btrfs_root *root)
3739{
3740 __btrfs_btree_balance_dirty(root, 1);
3741}
3742
3743void btrfs_btree_balance_dirty_nodelay(struct btrfs_root *root)
3744{
3745 __btrfs_btree_balance_dirty(root, 0);
3746}
3747
3748int btrfs_read_buffer(struct extent_buffer *buf, u64 parent_transid)
3749{
3750 struct btrfs_root *root = BTRFS_I(buf->pages[0]->mapping->host)->root;
3751 return btree_read_extent_buffer_pages(root, buf, 0, parent_transid);
3752}
3753
3754static int btrfs_check_super_valid(struct btrfs_fs_info *fs_info,
3755 int read_only)
3756{
3757 /*
3758 * Placeholder for checks
3759 */
3760 return 0;
3761}
3762
3763static void btrfs_error_commit_super(struct btrfs_root *root)
3764{
3765 mutex_lock(&root->fs_info->cleaner_mutex);
3766 btrfs_run_delayed_iputs(root);
3767 mutex_unlock(&root->fs_info->cleaner_mutex);
3768
3769 down_write(&root->fs_info->cleanup_work_sem);
3770 up_write(&root->fs_info->cleanup_work_sem);
3771
3772 /* cleanup FS via transaction */
3773 btrfs_cleanup_transaction(root);
3774}
3775
3776static void btrfs_destroy_ordered_operations(struct btrfs_transaction *t,
3777 struct btrfs_root *root)
3778{
3779 struct btrfs_inode *btrfs_inode;
3780 struct list_head splice;
3781
3782 INIT_LIST_HEAD(&splice);
3783
3784 mutex_lock(&root->fs_info->ordered_operations_mutex);
3785 spin_lock(&root->fs_info->ordered_root_lock);
3786
3787 list_splice_init(&t->ordered_operations, &splice);
3788 while (!list_empty(&splice)) {
3789 btrfs_inode = list_entry(splice.next, struct btrfs_inode,
3790 ordered_operations);
3791
3792 list_del_init(&btrfs_inode->ordered_operations);
3793 spin_unlock(&root->fs_info->ordered_root_lock);
3794
3795 btrfs_invalidate_inodes(btrfs_inode->root);
3796
3797 spin_lock(&root->fs_info->ordered_root_lock);
3798 }
3799
3800 spin_unlock(&root->fs_info->ordered_root_lock);
3801 mutex_unlock(&root->fs_info->ordered_operations_mutex);
3802}
3803
3804static void btrfs_destroy_ordered_extents(struct btrfs_root *root)
3805{
3806 struct btrfs_ordered_extent *ordered;
3807
3808 spin_lock(&root->ordered_extent_lock);
3809 /*
3810 * This will just short circuit the ordered completion stuff which will
3811 * make sure the ordered extent gets properly cleaned up.
3812 */
3813 list_for_each_entry(ordered, &root->ordered_extents,
3814 root_extent_list)
3815 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags);
3816 spin_unlock(&root->ordered_extent_lock);
3817}
3818
3819static void btrfs_destroy_all_ordered_extents(struct btrfs_fs_info *fs_info)
3820{
3821 struct btrfs_root *root;
3822 struct list_head splice;
3823
3824 INIT_LIST_HEAD(&splice);
3825
3826 spin_lock(&fs_info->ordered_root_lock);
3827 list_splice_init(&fs_info->ordered_roots, &splice);
3828 while (!list_empty(&splice)) {
3829 root = list_first_entry(&splice, struct btrfs_root,
3830 ordered_root);
3831 list_move_tail(&root->ordered_root,
3832 &fs_info->ordered_roots);
3833
3834 spin_unlock(&fs_info->ordered_root_lock);
3835 btrfs_destroy_ordered_extents(root);
3836
3837 cond_resched();
3838 spin_lock(&fs_info->ordered_root_lock);
3839 }
3840 spin_unlock(&fs_info->ordered_root_lock);
3841}
3842
3843static int btrfs_destroy_delayed_refs(struct btrfs_transaction *trans,
3844 struct btrfs_root *root)
3845{
3846 struct rb_node *node;
3847 struct btrfs_delayed_ref_root *delayed_refs;
3848 struct btrfs_delayed_ref_node *ref;
3849 int ret = 0;
3850
3851 delayed_refs = &trans->delayed_refs;
3852
3853 spin_lock(&delayed_refs->lock);
3854 if (atomic_read(&delayed_refs->num_entries) == 0) {
3855 spin_unlock(&delayed_refs->lock);
3856 btrfs_info(root->fs_info, "delayed_refs has NO entry");
3857 return ret;
3858 }
3859
3860 while ((node = rb_first(&delayed_refs->href_root)) != NULL) {
3861 struct btrfs_delayed_ref_head *head;
3862 bool pin_bytes = false;
3863
3864 head = rb_entry(node, struct btrfs_delayed_ref_head,
3865 href_node);
3866 if (!mutex_trylock(&head->mutex)) {
3867 atomic_inc(&head->node.refs);
3868 spin_unlock(&delayed_refs->lock);
3869
3870 mutex_lock(&head->mutex);
3871 mutex_unlock(&head->mutex);
3872 btrfs_put_delayed_ref(&head->node);
3873 spin_lock(&delayed_refs->lock);
3874 continue;
3875 }
3876 spin_lock(&head->lock);
3877 while ((node = rb_first(&head->ref_root)) != NULL) {
3878 ref = rb_entry(node, struct btrfs_delayed_ref_node,
3879 rb_node);
3880 ref->in_tree = 0;
3881 rb_erase(&ref->rb_node, &head->ref_root);
3882 atomic_dec(&delayed_refs->num_entries);
3883 btrfs_put_delayed_ref(ref);
3884 }
3885 if (head->must_insert_reserved)
3886 pin_bytes = true;
3887 btrfs_free_delayed_extent_op(head->extent_op);
3888 delayed_refs->num_heads--;
3889 if (head->processing == 0)
3890 delayed_refs->num_heads_ready--;
3891 atomic_dec(&delayed_refs->num_entries);
3892 head->node.in_tree = 0;
3893 rb_erase(&head->href_node, &delayed_refs->href_root);
3894 spin_unlock(&head->lock);
3895 spin_unlock(&delayed_refs->lock);
3896 mutex_unlock(&head->mutex);
3897
3898 if (pin_bytes)
3899 btrfs_pin_extent(root, head->node.bytenr,
3900 head->node.num_bytes, 1);
3901 btrfs_put_delayed_ref(&head->node);
3902 cond_resched();
3903 spin_lock(&delayed_refs->lock);
3904 }
3905
3906 spin_unlock(&delayed_refs->lock);
3907
3908 return ret;
3909}
3910
3911static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root)
3912{
3913 struct btrfs_inode *btrfs_inode;
3914 struct list_head splice;
3915
3916 INIT_LIST_HEAD(&splice);
3917
3918 spin_lock(&root->delalloc_lock);
3919 list_splice_init(&root->delalloc_inodes, &splice);
3920
3921 while (!list_empty(&splice)) {
3922 btrfs_inode = list_first_entry(&splice, struct btrfs_inode,
3923 delalloc_inodes);
3924
3925 list_del_init(&btrfs_inode->delalloc_inodes);
3926 clear_bit(BTRFS_INODE_IN_DELALLOC_LIST,
3927 &btrfs_inode->runtime_flags);
3928 spin_unlock(&root->delalloc_lock);
3929
3930 btrfs_invalidate_inodes(btrfs_inode->root);
3931
3932 spin_lock(&root->delalloc_lock);
3933 }
3934
3935 spin_unlock(&root->delalloc_lock);
3936}
3937
3938static void btrfs_destroy_all_delalloc_inodes(struct btrfs_fs_info *fs_info)
3939{
3940 struct btrfs_root *root;
3941 struct list_head splice;
3942
3943 INIT_LIST_HEAD(&splice);
3944
3945 spin_lock(&fs_info->delalloc_root_lock);
3946 list_splice_init(&fs_info->delalloc_roots, &splice);
3947 while (!list_empty(&splice)) {
3948 root = list_first_entry(&splice, struct btrfs_root,
3949 delalloc_root);
3950 list_del_init(&root->delalloc_root);
3951 root = btrfs_grab_fs_root(root);
3952 BUG_ON(!root);
3953 spin_unlock(&fs_info->delalloc_root_lock);
3954
3955 btrfs_destroy_delalloc_inodes(root);
3956 btrfs_put_fs_root(root);
3957
3958 spin_lock(&fs_info->delalloc_root_lock);
3959 }
3960 spin_unlock(&fs_info->delalloc_root_lock);
3961}
3962
3963static int btrfs_destroy_marked_extents(struct btrfs_root *root,
3964 struct extent_io_tree *dirty_pages,
3965 int mark)
3966{
3967 int ret;
3968 struct extent_buffer *eb;
3969 u64 start = 0;
3970 u64 end;
3971
3972 while (1) {
3973 ret = find_first_extent_bit(dirty_pages, start, &start, &end,
3974 mark, NULL);
3975 if (ret)
3976 break;
3977
3978 clear_extent_bits(dirty_pages, start, end, mark, GFP_NOFS);
3979 while (start <= end) {
3980 eb = btrfs_find_tree_block(root, start,
3981 root->leafsize);
3982 start += root->leafsize;
3983 if (!eb)
3984 continue;
3985 wait_on_extent_buffer_writeback(eb);
3986
3987 if (test_and_clear_bit(EXTENT_BUFFER_DIRTY,
3988 &eb->bflags))
3989 clear_extent_buffer_dirty(eb);
3990 free_extent_buffer_stale(eb);
3991 }
3992 }
3993
3994 return ret;
3995}
3996
3997static int btrfs_destroy_pinned_extent(struct btrfs_root *root,
3998 struct extent_io_tree *pinned_extents)
3999{
4000 struct extent_io_tree *unpin;
4001 u64 start;
4002 u64 end;
4003 int ret;
4004 bool loop = true;
4005
4006 unpin = pinned_extents;
4007again:
4008 while (1) {
4009 ret = find_first_extent_bit(unpin, 0, &start, &end,
4010 EXTENT_DIRTY, NULL);
4011 if (ret)
4012 break;
4013
4014 /* opt_discard */
4015 if (btrfs_test_opt(root, DISCARD))
4016 ret = btrfs_error_discard_extent(root, start,
4017 end + 1 - start,
4018 NULL);
4019
4020 clear_extent_dirty(unpin, start, end, GFP_NOFS);
4021 btrfs_error_unpin_extent_range(root, start, end);
4022 cond_resched();
4023 }
4024
4025 if (loop) {
4026 if (unpin == &root->fs_info->freed_extents[0])
4027 unpin = &root->fs_info->freed_extents[1];
4028 else
4029 unpin = &root->fs_info->freed_extents[0];
4030 loop = false;
4031 goto again;
4032 }
4033
4034 return 0;
4035}
4036
4037void btrfs_cleanup_one_transaction(struct btrfs_transaction *cur_trans,
4038 struct btrfs_root *root)
4039{
4040 btrfs_destroy_ordered_operations(cur_trans, root);
4041
4042 btrfs_destroy_delayed_refs(cur_trans, root);
4043
4044 cur_trans->state = TRANS_STATE_COMMIT_START;
4045 wake_up(&root->fs_info->transaction_blocked_wait);
4046
4047 cur_trans->state = TRANS_STATE_UNBLOCKED;
4048 wake_up(&root->fs_info->transaction_wait);
4049
4050 btrfs_destroy_delayed_inodes(root);
4051 btrfs_assert_delayed_root_empty(root);
4052
4053 btrfs_destroy_marked_extents(root, &cur_trans->dirty_pages,
4054 EXTENT_DIRTY);
4055 btrfs_destroy_pinned_extent(root,
4056 root->fs_info->pinned_extents);
4057
4058 cur_trans->state =TRANS_STATE_COMPLETED;
4059 wake_up(&cur_trans->commit_wait);
4060
4061 /*
4062 memset(cur_trans, 0, sizeof(*cur_trans));
4063 kmem_cache_free(btrfs_transaction_cachep, cur_trans);
4064 */
4065}
4066
4067static int btrfs_cleanup_transaction(struct btrfs_root *root)
4068{
4069 struct btrfs_transaction *t;
4070
4071 mutex_lock(&root->fs_info->transaction_kthread_mutex);
4072
4073 spin_lock(&root->fs_info->trans_lock);
4074 while (!list_empty(&root->fs_info->trans_list)) {
4075 t = list_first_entry(&root->fs_info->trans_list,
4076 struct btrfs_transaction, list);
4077 if (t->state >= TRANS_STATE_COMMIT_START) {
4078 atomic_inc(&t->use_count);
4079 spin_unlock(&root->fs_info->trans_lock);
4080 btrfs_wait_for_commit(root, t->transid);
4081 btrfs_put_transaction(t);
4082 spin_lock(&root->fs_info->trans_lock);
4083 continue;
4084 }
4085 if (t == root->fs_info->running_transaction) {
4086 t->state = TRANS_STATE_COMMIT_DOING;
4087 spin_unlock(&root->fs_info->trans_lock);
4088 /*
4089 * We wait for 0 num_writers since we don't hold a trans
4090 * handle open currently for this transaction.
4091 */
4092 wait_event(t->writer_wait,
4093 atomic_read(&t->num_writers) == 0);
4094 } else {
4095 spin_unlock(&root->fs_info->trans_lock);
4096 }
4097 btrfs_cleanup_one_transaction(t, root);
4098
4099 spin_lock(&root->fs_info->trans_lock);
4100 if (t == root->fs_info->running_transaction)
4101 root->fs_info->running_transaction = NULL;
4102 list_del_init(&t->list);
4103 spin_unlock(&root->fs_info->trans_lock);
4104
4105 btrfs_put_transaction(t);
4106 trace_btrfs_transaction_commit(root);
4107 spin_lock(&root->fs_info->trans_lock);
4108 }
4109 spin_unlock(&root->fs_info->trans_lock);
4110 btrfs_destroy_all_ordered_extents(root->fs_info);
4111 btrfs_destroy_delayed_inodes(root);
4112 btrfs_assert_delayed_root_empty(root);
4113 btrfs_destroy_pinned_extent(root, root->fs_info->pinned_extents);
4114 btrfs_destroy_all_delalloc_inodes(root->fs_info);
4115 mutex_unlock(&root->fs_info->transaction_kthread_mutex);
4116
4117 return 0;
4118}
4119
4120static struct extent_io_ops btree_extent_io_ops = {
4121 .readpage_end_io_hook = btree_readpage_end_io_hook,
4122 .readpage_io_failed_hook = btree_io_failed_hook,
4123 .submit_bio_hook = btree_submit_bio_hook,
4124 /* note we're sharing with inode.c for the merge bio hook */
4125 .merge_bio_hook = btrfs_merge_bio_hook,
4126};
1// SPDX-License-Identifier: GPL-2.0
2/*
3 * Copyright (C) 2007 Oracle. All rights reserved.
4 */
5
6#include <linux/fs.h>
7#include <linux/blkdev.h>
8#include <linux/radix-tree.h>
9#include <linux/writeback.h>
10#include <linux/workqueue.h>
11#include <linux/kthread.h>
12#include <linux/slab.h>
13#include <linux/migrate.h>
14#include <linux/ratelimit.h>
15#include <linux/uuid.h>
16#include <linux/semaphore.h>
17#include <linux/error-injection.h>
18#include <linux/crc32c.h>
19#include <linux/sched/mm.h>
20#include <linux/unaligned.h>
21#include <crypto/hash.h>
22#include "ctree.h"
23#include "disk-io.h"
24#include "transaction.h"
25#include "btrfs_inode.h"
26#include "bio.h"
27#include "print-tree.h"
28#include "locking.h"
29#include "tree-log.h"
30#include "free-space-cache.h"
31#include "free-space-tree.h"
32#include "dev-replace.h"
33#include "raid56.h"
34#include "sysfs.h"
35#include "qgroup.h"
36#include "compression.h"
37#include "tree-checker.h"
38#include "ref-verify.h"
39#include "block-group.h"
40#include "discard.h"
41#include "space-info.h"
42#include "zoned.h"
43#include "subpage.h"
44#include "fs.h"
45#include "accessors.h"
46#include "extent-tree.h"
47#include "root-tree.h"
48#include "defrag.h"
49#include "uuid-tree.h"
50#include "relocation.h"
51#include "scrub.h"
52#include "super.h"
53
54#define BTRFS_SUPER_FLAG_SUPP (BTRFS_HEADER_FLAG_WRITTEN |\
55 BTRFS_HEADER_FLAG_RELOC |\
56 BTRFS_SUPER_FLAG_ERROR |\
57 BTRFS_SUPER_FLAG_SEEDING |\
58 BTRFS_SUPER_FLAG_METADUMP |\
59 BTRFS_SUPER_FLAG_METADUMP_V2)
60
61static int btrfs_cleanup_transaction(struct btrfs_fs_info *fs_info);
62static void btrfs_error_commit_super(struct btrfs_fs_info *fs_info);
63
64static void btrfs_free_csum_hash(struct btrfs_fs_info *fs_info)
65{
66 if (fs_info->csum_shash)
67 crypto_free_shash(fs_info->csum_shash);
68}
69
70/*
71 * Compute the csum of a btree block and store the result to provided buffer.
72 */
73static void csum_tree_block(struct extent_buffer *buf, u8 *result)
74{
75 struct btrfs_fs_info *fs_info = buf->fs_info;
76 int num_pages;
77 u32 first_page_part;
78 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
79 char *kaddr;
80 int i;
81
82 shash->tfm = fs_info->csum_shash;
83 crypto_shash_init(shash);
84
85 if (buf->addr) {
86 /* Pages are contiguous, handle them as a big one. */
87 kaddr = buf->addr;
88 first_page_part = fs_info->nodesize;
89 num_pages = 1;
90 } else {
91 kaddr = folio_address(buf->folios[0]);
92 first_page_part = min_t(u32, PAGE_SIZE, fs_info->nodesize);
93 num_pages = num_extent_pages(buf);
94 }
95
96 crypto_shash_update(shash, kaddr + BTRFS_CSUM_SIZE,
97 first_page_part - BTRFS_CSUM_SIZE);
98
99 /*
100 * Multiple single-page folios case would reach here.
101 *
102 * nodesize <= PAGE_SIZE and large folio all handled by above
103 * crypto_shash_update() already.
104 */
105 for (i = 1; i < num_pages && INLINE_EXTENT_BUFFER_PAGES > 1; i++) {
106 kaddr = folio_address(buf->folios[i]);
107 crypto_shash_update(shash, kaddr, PAGE_SIZE);
108 }
109 memset(result, 0, BTRFS_CSUM_SIZE);
110 crypto_shash_final(shash, result);
111}
112
113/*
114 * we can't consider a given block up to date unless the transid of the
115 * block matches the transid in the parent node's pointer. This is how we
116 * detect blocks that either didn't get written at all or got written
117 * in the wrong place.
118 */
119int btrfs_buffer_uptodate(struct extent_buffer *eb, u64 parent_transid, int atomic)
120{
121 if (!extent_buffer_uptodate(eb))
122 return 0;
123
124 if (!parent_transid || btrfs_header_generation(eb) == parent_transid)
125 return 1;
126
127 if (atomic)
128 return -EAGAIN;
129
130 if (!extent_buffer_uptodate(eb) ||
131 btrfs_header_generation(eb) != parent_transid) {
132 btrfs_err_rl(eb->fs_info,
133"parent transid verify failed on logical %llu mirror %u wanted %llu found %llu",
134 eb->start, eb->read_mirror,
135 parent_transid, btrfs_header_generation(eb));
136 clear_extent_buffer_uptodate(eb);
137 return 0;
138 }
139 return 1;
140}
141
142static bool btrfs_supported_super_csum(u16 csum_type)
143{
144 switch (csum_type) {
145 case BTRFS_CSUM_TYPE_CRC32:
146 case BTRFS_CSUM_TYPE_XXHASH:
147 case BTRFS_CSUM_TYPE_SHA256:
148 case BTRFS_CSUM_TYPE_BLAKE2:
149 return true;
150 default:
151 return false;
152 }
153}
154
155/*
156 * Return 0 if the superblock checksum type matches the checksum value of that
157 * algorithm. Pass the raw disk superblock data.
158 */
159int btrfs_check_super_csum(struct btrfs_fs_info *fs_info,
160 const struct btrfs_super_block *disk_sb)
161{
162 char result[BTRFS_CSUM_SIZE];
163 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
164
165 shash->tfm = fs_info->csum_shash;
166
167 /*
168 * The super_block structure does not span the whole
169 * BTRFS_SUPER_INFO_SIZE range, we expect that the unused space is
170 * filled with zeros and is included in the checksum.
171 */
172 crypto_shash_digest(shash, (const u8 *)disk_sb + BTRFS_CSUM_SIZE,
173 BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE, result);
174
175 if (memcmp(disk_sb->csum, result, fs_info->csum_size))
176 return 1;
177
178 return 0;
179}
180
181static int btrfs_repair_eb_io_failure(const struct extent_buffer *eb,
182 int mirror_num)
183{
184 struct btrfs_fs_info *fs_info = eb->fs_info;
185 int num_folios = num_extent_folios(eb);
186 int ret = 0;
187
188 if (sb_rdonly(fs_info->sb))
189 return -EROFS;
190
191 for (int i = 0; i < num_folios; i++) {
192 struct folio *folio = eb->folios[i];
193 u64 start = max_t(u64, eb->start, folio_pos(folio));
194 u64 end = min_t(u64, eb->start + eb->len,
195 folio_pos(folio) + eb->folio_size);
196 u32 len = end - start;
197
198 ret = btrfs_repair_io_failure(fs_info, 0, start, len,
199 start, folio, offset_in_folio(folio, start),
200 mirror_num);
201 if (ret)
202 break;
203 }
204
205 return ret;
206}
207
208/*
209 * helper to read a given tree block, doing retries as required when
210 * the checksums don't match and we have alternate mirrors to try.
211 *
212 * @check: expected tree parentness check, see the comments of the
213 * structure for details.
214 */
215int btrfs_read_extent_buffer(struct extent_buffer *eb,
216 const struct btrfs_tree_parent_check *check)
217{
218 struct btrfs_fs_info *fs_info = eb->fs_info;
219 int failed = 0;
220 int ret;
221 int num_copies = 0;
222 int mirror_num = 0;
223 int failed_mirror = 0;
224
225 ASSERT(check);
226
227 while (1) {
228 clear_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
229 ret = read_extent_buffer_pages(eb, WAIT_COMPLETE, mirror_num, check);
230 if (!ret)
231 break;
232
233 num_copies = btrfs_num_copies(fs_info,
234 eb->start, eb->len);
235 if (num_copies == 1)
236 break;
237
238 if (!failed_mirror) {
239 failed = 1;
240 failed_mirror = eb->read_mirror;
241 }
242
243 mirror_num++;
244 if (mirror_num == failed_mirror)
245 mirror_num++;
246
247 if (mirror_num > num_copies)
248 break;
249 }
250
251 if (failed && !ret && failed_mirror)
252 btrfs_repair_eb_io_failure(eb, failed_mirror);
253
254 return ret;
255}
256
257/*
258 * Checksum a dirty tree block before IO.
259 */
260blk_status_t btree_csum_one_bio(struct btrfs_bio *bbio)
261{
262 struct extent_buffer *eb = bbio->private;
263 struct btrfs_fs_info *fs_info = eb->fs_info;
264 u64 found_start = btrfs_header_bytenr(eb);
265 u64 last_trans;
266 u8 result[BTRFS_CSUM_SIZE];
267 int ret;
268
269 /* Btree blocks are always contiguous on disk. */
270 if (WARN_ON_ONCE(bbio->file_offset != eb->start))
271 return BLK_STS_IOERR;
272 if (WARN_ON_ONCE(bbio->bio.bi_iter.bi_size != eb->len))
273 return BLK_STS_IOERR;
274
275 /*
276 * If an extent_buffer is marked as EXTENT_BUFFER_ZONED_ZEROOUT, don't
277 * checksum it but zero-out its content. This is done to preserve
278 * ordering of I/O without unnecessarily writing out data.
279 */
280 if (test_bit(EXTENT_BUFFER_ZONED_ZEROOUT, &eb->bflags)) {
281 memzero_extent_buffer(eb, 0, eb->len);
282 return BLK_STS_OK;
283 }
284
285 if (WARN_ON_ONCE(found_start != eb->start))
286 return BLK_STS_IOERR;
287 if (WARN_ON(!btrfs_folio_test_uptodate(fs_info, eb->folios[0],
288 eb->start, eb->len)))
289 return BLK_STS_IOERR;
290
291 ASSERT(memcmp_extent_buffer(eb, fs_info->fs_devices->metadata_uuid,
292 offsetof(struct btrfs_header, fsid),
293 BTRFS_FSID_SIZE) == 0);
294 csum_tree_block(eb, result);
295
296 if (btrfs_header_level(eb))
297 ret = btrfs_check_node(eb);
298 else
299 ret = btrfs_check_leaf(eb);
300
301 if (ret < 0)
302 goto error;
303
304 /*
305 * Also check the generation, the eb reached here must be newer than
306 * last committed. Or something seriously wrong happened.
307 */
308 last_trans = btrfs_get_last_trans_committed(fs_info);
309 if (unlikely(btrfs_header_generation(eb) <= last_trans)) {
310 ret = -EUCLEAN;
311 btrfs_err(fs_info,
312 "block=%llu bad generation, have %llu expect > %llu",
313 eb->start, btrfs_header_generation(eb), last_trans);
314 goto error;
315 }
316 write_extent_buffer(eb, result, 0, fs_info->csum_size);
317 return BLK_STS_OK;
318
319error:
320 btrfs_print_tree(eb, 0);
321 btrfs_err(fs_info, "block=%llu write time tree block corruption detected",
322 eb->start);
323 /*
324 * Be noisy if this is an extent buffer from a log tree. We don't abort
325 * a transaction in case there's a bad log tree extent buffer, we just
326 * fallback to a transaction commit. Still we want to know when there is
327 * a bad log tree extent buffer, as that may signal a bug somewhere.
328 */
329 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG) ||
330 btrfs_header_owner(eb) == BTRFS_TREE_LOG_OBJECTID);
331 return errno_to_blk_status(ret);
332}
333
334static bool check_tree_block_fsid(struct extent_buffer *eb)
335{
336 struct btrfs_fs_info *fs_info = eb->fs_info;
337 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices, *seed_devs;
338 u8 fsid[BTRFS_FSID_SIZE];
339
340 read_extent_buffer(eb, fsid, offsetof(struct btrfs_header, fsid),
341 BTRFS_FSID_SIZE);
342
343 /*
344 * alloc_fsid_devices() copies the fsid into fs_devices::metadata_uuid.
345 * This is then overwritten by metadata_uuid if it is present in the
346 * device_list_add(). The same true for a seed device as well. So use of
347 * fs_devices::metadata_uuid is appropriate here.
348 */
349 if (memcmp(fsid, fs_info->fs_devices->metadata_uuid, BTRFS_FSID_SIZE) == 0)
350 return false;
351
352 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list)
353 if (!memcmp(fsid, seed_devs->fsid, BTRFS_FSID_SIZE))
354 return false;
355
356 return true;
357}
358
359/* Do basic extent buffer checks at read time */
360int btrfs_validate_extent_buffer(struct extent_buffer *eb,
361 const struct btrfs_tree_parent_check *check)
362{
363 struct btrfs_fs_info *fs_info = eb->fs_info;
364 u64 found_start;
365 const u32 csum_size = fs_info->csum_size;
366 u8 found_level;
367 u8 result[BTRFS_CSUM_SIZE];
368 const u8 *header_csum;
369 int ret = 0;
370 const bool ignore_csum = btrfs_test_opt(fs_info, IGNOREMETACSUMS);
371
372 ASSERT(check);
373
374 found_start = btrfs_header_bytenr(eb);
375 if (found_start != eb->start) {
376 btrfs_err_rl(fs_info,
377 "bad tree block start, mirror %u want %llu have %llu",
378 eb->read_mirror, eb->start, found_start);
379 ret = -EIO;
380 goto out;
381 }
382 if (check_tree_block_fsid(eb)) {
383 btrfs_err_rl(fs_info, "bad fsid on logical %llu mirror %u",
384 eb->start, eb->read_mirror);
385 ret = -EIO;
386 goto out;
387 }
388 found_level = btrfs_header_level(eb);
389 if (found_level >= BTRFS_MAX_LEVEL) {
390 btrfs_err(fs_info,
391 "bad tree block level, mirror %u level %d on logical %llu",
392 eb->read_mirror, btrfs_header_level(eb), eb->start);
393 ret = -EIO;
394 goto out;
395 }
396
397 csum_tree_block(eb, result);
398 header_csum = folio_address(eb->folios[0]) +
399 get_eb_offset_in_folio(eb, offsetof(struct btrfs_header, csum));
400
401 if (memcmp(result, header_csum, csum_size) != 0) {
402 btrfs_warn_rl(fs_info,
403"checksum verify failed on logical %llu mirror %u wanted " CSUM_FMT " found " CSUM_FMT " level %d%s",
404 eb->start, eb->read_mirror,
405 CSUM_FMT_VALUE(csum_size, header_csum),
406 CSUM_FMT_VALUE(csum_size, result),
407 btrfs_header_level(eb),
408 ignore_csum ? ", ignored" : "");
409 if (!ignore_csum) {
410 ret = -EUCLEAN;
411 goto out;
412 }
413 }
414
415 if (found_level != check->level) {
416 btrfs_err(fs_info,
417 "level verify failed on logical %llu mirror %u wanted %u found %u",
418 eb->start, eb->read_mirror, check->level, found_level);
419 ret = -EIO;
420 goto out;
421 }
422 if (unlikely(check->transid &&
423 btrfs_header_generation(eb) != check->transid)) {
424 btrfs_err_rl(eb->fs_info,
425"parent transid verify failed on logical %llu mirror %u wanted %llu found %llu",
426 eb->start, eb->read_mirror, check->transid,
427 btrfs_header_generation(eb));
428 ret = -EIO;
429 goto out;
430 }
431 if (check->has_first_key) {
432 const struct btrfs_key *expect_key = &check->first_key;
433 struct btrfs_key found_key;
434
435 if (found_level)
436 btrfs_node_key_to_cpu(eb, &found_key, 0);
437 else
438 btrfs_item_key_to_cpu(eb, &found_key, 0);
439 if (unlikely(btrfs_comp_cpu_keys(expect_key, &found_key))) {
440 btrfs_err(fs_info,
441"tree first key mismatch detected, bytenr=%llu parent_transid=%llu key expected=(%llu,%u,%llu) has=(%llu,%u,%llu)",
442 eb->start, check->transid,
443 expect_key->objectid,
444 expect_key->type, expect_key->offset,
445 found_key.objectid, found_key.type,
446 found_key.offset);
447 ret = -EUCLEAN;
448 goto out;
449 }
450 }
451 if (check->owner_root) {
452 ret = btrfs_check_eb_owner(eb, check->owner_root);
453 if (ret < 0)
454 goto out;
455 }
456
457 /*
458 * If this is a leaf block and it is corrupt, set the corrupt bit so
459 * that we don't try and read the other copies of this block, just
460 * return -EIO.
461 */
462 if (found_level == 0 && btrfs_check_leaf(eb)) {
463 set_bit(EXTENT_BUFFER_CORRUPT, &eb->bflags);
464 ret = -EIO;
465 }
466
467 if (found_level > 0 && btrfs_check_node(eb))
468 ret = -EIO;
469
470 if (ret)
471 btrfs_err(fs_info,
472 "read time tree block corruption detected on logical %llu mirror %u",
473 eb->start, eb->read_mirror);
474out:
475 return ret;
476}
477
478#ifdef CONFIG_MIGRATION
479static int btree_migrate_folio(struct address_space *mapping,
480 struct folio *dst, struct folio *src, enum migrate_mode mode)
481{
482 /*
483 * we can't safely write a btree page from here,
484 * we haven't done the locking hook
485 */
486 if (folio_test_dirty(src))
487 return -EAGAIN;
488 /*
489 * Buffers may be managed in a filesystem specific way.
490 * We must have no buffers or drop them.
491 */
492 if (folio_get_private(src) &&
493 !filemap_release_folio(src, GFP_KERNEL))
494 return -EAGAIN;
495 return migrate_folio(mapping, dst, src, mode);
496}
497#else
498#define btree_migrate_folio NULL
499#endif
500
501static int btree_writepages(struct address_space *mapping,
502 struct writeback_control *wbc)
503{
504 int ret;
505
506 if (wbc->sync_mode == WB_SYNC_NONE) {
507 struct btrfs_fs_info *fs_info;
508
509 if (wbc->for_kupdate)
510 return 0;
511
512 fs_info = inode_to_fs_info(mapping->host);
513 /* this is a bit racy, but that's ok */
514 ret = __percpu_counter_compare(&fs_info->dirty_metadata_bytes,
515 BTRFS_DIRTY_METADATA_THRESH,
516 fs_info->dirty_metadata_batch);
517 if (ret < 0)
518 return 0;
519 }
520 return btree_write_cache_pages(mapping, wbc);
521}
522
523static bool btree_release_folio(struct folio *folio, gfp_t gfp_flags)
524{
525 if (folio_test_writeback(folio) || folio_test_dirty(folio))
526 return false;
527
528 return try_release_extent_buffer(folio);
529}
530
531static void btree_invalidate_folio(struct folio *folio, size_t offset,
532 size_t length)
533{
534 struct extent_io_tree *tree;
535
536 tree = &folio_to_inode(folio)->io_tree;
537 extent_invalidate_folio(tree, folio, offset);
538 btree_release_folio(folio, GFP_NOFS);
539 if (folio_get_private(folio)) {
540 btrfs_warn(folio_to_fs_info(folio),
541 "folio private not zero on folio %llu",
542 (unsigned long long)folio_pos(folio));
543 folio_detach_private(folio);
544 }
545}
546
547#ifdef DEBUG
548static bool btree_dirty_folio(struct address_space *mapping,
549 struct folio *folio)
550{
551 struct btrfs_fs_info *fs_info = inode_to_fs_info(mapping->host);
552 struct btrfs_subpage_info *spi = fs_info->subpage_info;
553 struct btrfs_subpage *subpage;
554 struct extent_buffer *eb;
555 int cur_bit = 0;
556 u64 page_start = folio_pos(folio);
557
558 if (fs_info->sectorsize == PAGE_SIZE) {
559 eb = folio_get_private(folio);
560 BUG_ON(!eb);
561 BUG_ON(!test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
562 BUG_ON(!atomic_read(&eb->refs));
563 btrfs_assert_tree_write_locked(eb);
564 return filemap_dirty_folio(mapping, folio);
565 }
566
567 ASSERT(spi);
568 subpage = folio_get_private(folio);
569
570 for (cur_bit = spi->dirty_offset;
571 cur_bit < spi->dirty_offset + spi->bitmap_nr_bits;
572 cur_bit++) {
573 unsigned long flags;
574 u64 cur;
575
576 spin_lock_irqsave(&subpage->lock, flags);
577 if (!test_bit(cur_bit, subpage->bitmaps)) {
578 spin_unlock_irqrestore(&subpage->lock, flags);
579 continue;
580 }
581 spin_unlock_irqrestore(&subpage->lock, flags);
582 cur = page_start + cur_bit * fs_info->sectorsize;
583
584 eb = find_extent_buffer(fs_info, cur);
585 ASSERT(eb);
586 ASSERT(test_bit(EXTENT_BUFFER_DIRTY, &eb->bflags));
587 ASSERT(atomic_read(&eb->refs));
588 btrfs_assert_tree_write_locked(eb);
589 free_extent_buffer(eb);
590
591 cur_bit += (fs_info->nodesize >> fs_info->sectorsize_bits) - 1;
592 }
593 return filemap_dirty_folio(mapping, folio);
594}
595#else
596#define btree_dirty_folio filemap_dirty_folio
597#endif
598
599static const struct address_space_operations btree_aops = {
600 .writepages = btree_writepages,
601 .release_folio = btree_release_folio,
602 .invalidate_folio = btree_invalidate_folio,
603 .migrate_folio = btree_migrate_folio,
604 .dirty_folio = btree_dirty_folio,
605};
606
607struct extent_buffer *btrfs_find_create_tree_block(
608 struct btrfs_fs_info *fs_info,
609 u64 bytenr, u64 owner_root,
610 int level)
611{
612 if (btrfs_is_testing(fs_info))
613 return alloc_test_extent_buffer(fs_info, bytenr);
614 return alloc_extent_buffer(fs_info, bytenr, owner_root, level);
615}
616
617/*
618 * Read tree block at logical address @bytenr and do variant basic but critical
619 * verification.
620 *
621 * @check: expected tree parentness check, see comments of the
622 * structure for details.
623 */
624struct extent_buffer *read_tree_block(struct btrfs_fs_info *fs_info, u64 bytenr,
625 struct btrfs_tree_parent_check *check)
626{
627 struct extent_buffer *buf = NULL;
628 int ret;
629
630 ASSERT(check);
631
632 buf = btrfs_find_create_tree_block(fs_info, bytenr, check->owner_root,
633 check->level);
634 if (IS_ERR(buf))
635 return buf;
636
637 ret = btrfs_read_extent_buffer(buf, check);
638 if (ret) {
639 free_extent_buffer_stale(buf);
640 return ERR_PTR(ret);
641 }
642 return buf;
643
644}
645
646static void __setup_root(struct btrfs_root *root, struct btrfs_fs_info *fs_info,
647 u64 objectid)
648{
649 bool dummy = btrfs_is_testing(fs_info);
650
651 memset(&root->root_key, 0, sizeof(root->root_key));
652 memset(&root->root_item, 0, sizeof(root->root_item));
653 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
654 root->fs_info = fs_info;
655 root->root_key.objectid = objectid;
656 root->node = NULL;
657 root->commit_root = NULL;
658 root->state = 0;
659 RB_CLEAR_NODE(&root->rb_node);
660
661 btrfs_set_root_last_trans(root, 0);
662 root->free_objectid = 0;
663 root->nr_delalloc_inodes = 0;
664 root->nr_ordered_extents = 0;
665 xa_init(&root->inodes);
666 xa_init(&root->delayed_nodes);
667
668 btrfs_init_root_block_rsv(root);
669
670 INIT_LIST_HEAD(&root->dirty_list);
671 INIT_LIST_HEAD(&root->root_list);
672 INIT_LIST_HEAD(&root->delalloc_inodes);
673 INIT_LIST_HEAD(&root->delalloc_root);
674 INIT_LIST_HEAD(&root->ordered_extents);
675 INIT_LIST_HEAD(&root->ordered_root);
676 INIT_LIST_HEAD(&root->reloc_dirty_list);
677 spin_lock_init(&root->delalloc_lock);
678 spin_lock_init(&root->ordered_extent_lock);
679 spin_lock_init(&root->accounting_lock);
680 spin_lock_init(&root->qgroup_meta_rsv_lock);
681 mutex_init(&root->objectid_mutex);
682 mutex_init(&root->log_mutex);
683 mutex_init(&root->ordered_extent_mutex);
684 mutex_init(&root->delalloc_mutex);
685 init_waitqueue_head(&root->qgroup_flush_wait);
686 init_waitqueue_head(&root->log_writer_wait);
687 init_waitqueue_head(&root->log_commit_wait[0]);
688 init_waitqueue_head(&root->log_commit_wait[1]);
689 INIT_LIST_HEAD(&root->log_ctxs[0]);
690 INIT_LIST_HEAD(&root->log_ctxs[1]);
691 atomic_set(&root->log_commit[0], 0);
692 atomic_set(&root->log_commit[1], 0);
693 atomic_set(&root->log_writers, 0);
694 atomic_set(&root->log_batch, 0);
695 refcount_set(&root->refs, 1);
696 atomic_set(&root->snapshot_force_cow, 0);
697 atomic_set(&root->nr_swapfiles, 0);
698 btrfs_set_root_log_transid(root, 0);
699 root->log_transid_committed = -1;
700 btrfs_set_root_last_log_commit(root, 0);
701 root->anon_dev = 0;
702 if (!dummy) {
703 extent_io_tree_init(fs_info, &root->dirty_log_pages,
704 IO_TREE_ROOT_DIRTY_LOG_PAGES);
705 extent_io_tree_init(fs_info, &root->log_csum_range,
706 IO_TREE_LOG_CSUM_RANGE);
707 }
708
709 spin_lock_init(&root->root_item_lock);
710 btrfs_qgroup_init_swapped_blocks(&root->swapped_blocks);
711#ifdef CONFIG_BTRFS_DEBUG
712 INIT_LIST_HEAD(&root->leak_list);
713 spin_lock(&fs_info->fs_roots_radix_lock);
714 list_add_tail(&root->leak_list, &fs_info->allocated_roots);
715 spin_unlock(&fs_info->fs_roots_radix_lock);
716#endif
717}
718
719static struct btrfs_root *btrfs_alloc_root(struct btrfs_fs_info *fs_info,
720 u64 objectid, gfp_t flags)
721{
722 struct btrfs_root *root = kzalloc(sizeof(*root), flags);
723 if (root)
724 __setup_root(root, fs_info, objectid);
725 return root;
726}
727
728#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
729/* Should only be used by the testing infrastructure */
730struct btrfs_root *btrfs_alloc_dummy_root(struct btrfs_fs_info *fs_info)
731{
732 struct btrfs_root *root;
733
734 if (!fs_info)
735 return ERR_PTR(-EINVAL);
736
737 root = btrfs_alloc_root(fs_info, BTRFS_ROOT_TREE_OBJECTID, GFP_KERNEL);
738 if (!root)
739 return ERR_PTR(-ENOMEM);
740
741 /* We don't use the stripesize in selftest, set it as sectorsize */
742 root->alloc_bytenr = 0;
743
744 return root;
745}
746#endif
747
748static int global_root_cmp(struct rb_node *a_node, const struct rb_node *b_node)
749{
750 const struct btrfs_root *a = rb_entry(a_node, struct btrfs_root, rb_node);
751 const struct btrfs_root *b = rb_entry(b_node, struct btrfs_root, rb_node);
752
753 return btrfs_comp_cpu_keys(&a->root_key, &b->root_key);
754}
755
756static int global_root_key_cmp(const void *k, const struct rb_node *node)
757{
758 const struct btrfs_key *key = k;
759 const struct btrfs_root *root = rb_entry(node, struct btrfs_root, rb_node);
760
761 return btrfs_comp_cpu_keys(key, &root->root_key);
762}
763
764int btrfs_global_root_insert(struct btrfs_root *root)
765{
766 struct btrfs_fs_info *fs_info = root->fs_info;
767 struct rb_node *tmp;
768 int ret = 0;
769
770 write_lock(&fs_info->global_root_lock);
771 tmp = rb_find_add(&root->rb_node, &fs_info->global_root_tree, global_root_cmp);
772 write_unlock(&fs_info->global_root_lock);
773
774 if (tmp) {
775 ret = -EEXIST;
776 btrfs_warn(fs_info, "global root %llu %llu already exists",
777 btrfs_root_id(root), root->root_key.offset);
778 }
779 return ret;
780}
781
782void btrfs_global_root_delete(struct btrfs_root *root)
783{
784 struct btrfs_fs_info *fs_info = root->fs_info;
785
786 write_lock(&fs_info->global_root_lock);
787 rb_erase(&root->rb_node, &fs_info->global_root_tree);
788 write_unlock(&fs_info->global_root_lock);
789}
790
791struct btrfs_root *btrfs_global_root(struct btrfs_fs_info *fs_info,
792 struct btrfs_key *key)
793{
794 struct rb_node *node;
795 struct btrfs_root *root = NULL;
796
797 read_lock(&fs_info->global_root_lock);
798 node = rb_find(key, &fs_info->global_root_tree, global_root_key_cmp);
799 if (node)
800 root = container_of(node, struct btrfs_root, rb_node);
801 read_unlock(&fs_info->global_root_lock);
802
803 return root;
804}
805
806static u64 btrfs_global_root_id(struct btrfs_fs_info *fs_info, u64 bytenr)
807{
808 struct btrfs_block_group *block_group;
809 u64 ret;
810
811 if (!btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))
812 return 0;
813
814 if (bytenr)
815 block_group = btrfs_lookup_block_group(fs_info, bytenr);
816 else
817 block_group = btrfs_lookup_first_block_group(fs_info, bytenr);
818 ASSERT(block_group);
819 if (!block_group)
820 return 0;
821 ret = block_group->global_root_id;
822 btrfs_put_block_group(block_group);
823
824 return ret;
825}
826
827struct btrfs_root *btrfs_csum_root(struct btrfs_fs_info *fs_info, u64 bytenr)
828{
829 struct btrfs_key key = {
830 .objectid = BTRFS_CSUM_TREE_OBJECTID,
831 .type = BTRFS_ROOT_ITEM_KEY,
832 .offset = btrfs_global_root_id(fs_info, bytenr),
833 };
834
835 return btrfs_global_root(fs_info, &key);
836}
837
838struct btrfs_root *btrfs_extent_root(struct btrfs_fs_info *fs_info, u64 bytenr)
839{
840 struct btrfs_key key = {
841 .objectid = BTRFS_EXTENT_TREE_OBJECTID,
842 .type = BTRFS_ROOT_ITEM_KEY,
843 .offset = btrfs_global_root_id(fs_info, bytenr),
844 };
845
846 return btrfs_global_root(fs_info, &key);
847}
848
849struct btrfs_root *btrfs_create_tree(struct btrfs_trans_handle *trans,
850 u64 objectid)
851{
852 struct btrfs_fs_info *fs_info = trans->fs_info;
853 struct extent_buffer *leaf;
854 struct btrfs_root *tree_root = fs_info->tree_root;
855 struct btrfs_root *root;
856 struct btrfs_key key;
857 unsigned int nofs_flag;
858 int ret = 0;
859
860 /*
861 * We're holding a transaction handle, so use a NOFS memory allocation
862 * context to avoid deadlock if reclaim happens.
863 */
864 nofs_flag = memalloc_nofs_save();
865 root = btrfs_alloc_root(fs_info, objectid, GFP_KERNEL);
866 memalloc_nofs_restore(nofs_flag);
867 if (!root)
868 return ERR_PTR(-ENOMEM);
869
870 root->root_key.objectid = objectid;
871 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
872 root->root_key.offset = 0;
873
874 leaf = btrfs_alloc_tree_block(trans, root, 0, objectid, NULL, 0, 0, 0,
875 0, BTRFS_NESTING_NORMAL);
876 if (IS_ERR(leaf)) {
877 ret = PTR_ERR(leaf);
878 leaf = NULL;
879 goto fail;
880 }
881
882 root->node = leaf;
883 btrfs_mark_buffer_dirty(trans, leaf);
884
885 root->commit_root = btrfs_root_node(root);
886 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
887
888 btrfs_set_root_flags(&root->root_item, 0);
889 btrfs_set_root_limit(&root->root_item, 0);
890 btrfs_set_root_bytenr(&root->root_item, leaf->start);
891 btrfs_set_root_generation(&root->root_item, trans->transid);
892 btrfs_set_root_level(&root->root_item, 0);
893 btrfs_set_root_refs(&root->root_item, 1);
894 btrfs_set_root_used(&root->root_item, leaf->len);
895 btrfs_set_root_last_snapshot(&root->root_item, 0);
896 btrfs_set_root_dirid(&root->root_item, 0);
897 if (is_fstree(objectid))
898 generate_random_guid(root->root_item.uuid);
899 else
900 export_guid(root->root_item.uuid, &guid_null);
901 btrfs_set_root_drop_level(&root->root_item, 0);
902
903 btrfs_tree_unlock(leaf);
904
905 key.objectid = objectid;
906 key.type = BTRFS_ROOT_ITEM_KEY;
907 key.offset = 0;
908 ret = btrfs_insert_root(trans, tree_root, &key, &root->root_item);
909 if (ret)
910 goto fail;
911
912 return root;
913
914fail:
915 btrfs_put_root(root);
916
917 return ERR_PTR(ret);
918}
919
920static struct btrfs_root *alloc_log_tree(struct btrfs_fs_info *fs_info)
921{
922 struct btrfs_root *root;
923
924 root = btrfs_alloc_root(fs_info, BTRFS_TREE_LOG_OBJECTID, GFP_NOFS);
925 if (!root)
926 return ERR_PTR(-ENOMEM);
927
928 root->root_key.objectid = BTRFS_TREE_LOG_OBJECTID;
929 root->root_key.type = BTRFS_ROOT_ITEM_KEY;
930 root->root_key.offset = BTRFS_TREE_LOG_OBJECTID;
931
932 return root;
933}
934
935int btrfs_alloc_log_tree_node(struct btrfs_trans_handle *trans,
936 struct btrfs_root *root)
937{
938 struct extent_buffer *leaf;
939
940 /*
941 * DON'T set SHAREABLE bit for log trees.
942 *
943 * Log trees are not exposed to user space thus can't be snapshotted,
944 * and they go away before a real commit is actually done.
945 *
946 * They do store pointers to file data extents, and those reference
947 * counts still get updated (along with back refs to the log tree).
948 */
949
950 leaf = btrfs_alloc_tree_block(trans, root, 0, BTRFS_TREE_LOG_OBJECTID,
951 NULL, 0, 0, 0, 0, BTRFS_NESTING_NORMAL);
952 if (IS_ERR(leaf))
953 return PTR_ERR(leaf);
954
955 root->node = leaf;
956
957 btrfs_mark_buffer_dirty(trans, root->node);
958 btrfs_tree_unlock(root->node);
959
960 return 0;
961}
962
963int btrfs_init_log_root_tree(struct btrfs_trans_handle *trans,
964 struct btrfs_fs_info *fs_info)
965{
966 struct btrfs_root *log_root;
967
968 log_root = alloc_log_tree(fs_info);
969 if (IS_ERR(log_root))
970 return PTR_ERR(log_root);
971
972 if (!btrfs_is_zoned(fs_info)) {
973 int ret = btrfs_alloc_log_tree_node(trans, log_root);
974
975 if (ret) {
976 btrfs_put_root(log_root);
977 return ret;
978 }
979 }
980
981 WARN_ON(fs_info->log_root_tree);
982 fs_info->log_root_tree = log_root;
983 return 0;
984}
985
986int btrfs_add_log_tree(struct btrfs_trans_handle *trans,
987 struct btrfs_root *root)
988{
989 struct btrfs_fs_info *fs_info = root->fs_info;
990 struct btrfs_root *log_root;
991 struct btrfs_inode_item *inode_item;
992 int ret;
993
994 log_root = alloc_log_tree(fs_info);
995 if (IS_ERR(log_root))
996 return PTR_ERR(log_root);
997
998 ret = btrfs_alloc_log_tree_node(trans, log_root);
999 if (ret) {
1000 btrfs_put_root(log_root);
1001 return ret;
1002 }
1003
1004 btrfs_set_root_last_trans(log_root, trans->transid);
1005 log_root->root_key.offset = btrfs_root_id(root);
1006
1007 inode_item = &log_root->root_item.inode;
1008 btrfs_set_stack_inode_generation(inode_item, 1);
1009 btrfs_set_stack_inode_size(inode_item, 3);
1010 btrfs_set_stack_inode_nlink(inode_item, 1);
1011 btrfs_set_stack_inode_nbytes(inode_item,
1012 fs_info->nodesize);
1013 btrfs_set_stack_inode_mode(inode_item, S_IFDIR | 0755);
1014
1015 btrfs_set_root_node(&log_root->root_item, log_root->node);
1016
1017 WARN_ON(root->log_root);
1018 root->log_root = log_root;
1019 btrfs_set_root_log_transid(root, 0);
1020 root->log_transid_committed = -1;
1021 btrfs_set_root_last_log_commit(root, 0);
1022 return 0;
1023}
1024
1025static struct btrfs_root *read_tree_root_path(struct btrfs_root *tree_root,
1026 struct btrfs_path *path,
1027 const struct btrfs_key *key)
1028{
1029 struct btrfs_root *root;
1030 struct btrfs_tree_parent_check check = { 0 };
1031 struct btrfs_fs_info *fs_info = tree_root->fs_info;
1032 u64 generation;
1033 int ret;
1034 int level;
1035
1036 root = btrfs_alloc_root(fs_info, key->objectid, GFP_NOFS);
1037 if (!root)
1038 return ERR_PTR(-ENOMEM);
1039
1040 ret = btrfs_find_root(tree_root, key, path,
1041 &root->root_item, &root->root_key);
1042 if (ret) {
1043 if (ret > 0)
1044 ret = -ENOENT;
1045 goto fail;
1046 }
1047
1048 generation = btrfs_root_generation(&root->root_item);
1049 level = btrfs_root_level(&root->root_item);
1050 check.level = level;
1051 check.transid = generation;
1052 check.owner_root = key->objectid;
1053 root->node = read_tree_block(fs_info, btrfs_root_bytenr(&root->root_item),
1054 &check);
1055 if (IS_ERR(root->node)) {
1056 ret = PTR_ERR(root->node);
1057 root->node = NULL;
1058 goto fail;
1059 }
1060 if (!btrfs_buffer_uptodate(root->node, generation, 0)) {
1061 ret = -EIO;
1062 goto fail;
1063 }
1064
1065 /*
1066 * For real fs, and not log/reloc trees, root owner must
1067 * match its root node owner
1068 */
1069 if (!btrfs_is_testing(fs_info) &&
1070 btrfs_root_id(root) != BTRFS_TREE_LOG_OBJECTID &&
1071 btrfs_root_id(root) != BTRFS_TREE_RELOC_OBJECTID &&
1072 btrfs_root_id(root) != btrfs_header_owner(root->node)) {
1073 btrfs_crit(fs_info,
1074"root=%llu block=%llu, tree root owner mismatch, have %llu expect %llu",
1075 btrfs_root_id(root), root->node->start,
1076 btrfs_header_owner(root->node),
1077 btrfs_root_id(root));
1078 ret = -EUCLEAN;
1079 goto fail;
1080 }
1081 root->commit_root = btrfs_root_node(root);
1082 return root;
1083fail:
1084 btrfs_put_root(root);
1085 return ERR_PTR(ret);
1086}
1087
1088struct btrfs_root *btrfs_read_tree_root(struct btrfs_root *tree_root,
1089 const struct btrfs_key *key)
1090{
1091 struct btrfs_root *root;
1092 struct btrfs_path *path;
1093
1094 path = btrfs_alloc_path();
1095 if (!path)
1096 return ERR_PTR(-ENOMEM);
1097 root = read_tree_root_path(tree_root, path, key);
1098 btrfs_free_path(path);
1099
1100 return root;
1101}
1102
1103/*
1104 * Initialize subvolume root in-memory structure
1105 *
1106 * @anon_dev: anonymous device to attach to the root, if zero, allocate new
1107 */
1108static int btrfs_init_fs_root(struct btrfs_root *root, dev_t anon_dev)
1109{
1110 int ret;
1111
1112 btrfs_drew_lock_init(&root->snapshot_lock);
1113
1114 if (btrfs_root_id(root) != BTRFS_TREE_LOG_OBJECTID &&
1115 !btrfs_is_data_reloc_root(root) &&
1116 is_fstree(btrfs_root_id(root))) {
1117 set_bit(BTRFS_ROOT_SHAREABLE, &root->state);
1118 btrfs_check_and_init_root_item(&root->root_item);
1119 }
1120
1121 /*
1122 * Don't assign anonymous block device to roots that are not exposed to
1123 * userspace, the id pool is limited to 1M
1124 */
1125 if (is_fstree(btrfs_root_id(root)) &&
1126 btrfs_root_refs(&root->root_item) > 0) {
1127 if (!anon_dev) {
1128 ret = get_anon_bdev(&root->anon_dev);
1129 if (ret)
1130 goto fail;
1131 } else {
1132 root->anon_dev = anon_dev;
1133 }
1134 }
1135
1136 mutex_lock(&root->objectid_mutex);
1137 ret = btrfs_init_root_free_objectid(root);
1138 if (ret) {
1139 mutex_unlock(&root->objectid_mutex);
1140 goto fail;
1141 }
1142
1143 ASSERT(root->free_objectid <= BTRFS_LAST_FREE_OBJECTID);
1144
1145 mutex_unlock(&root->objectid_mutex);
1146
1147 return 0;
1148fail:
1149 /* The caller is responsible to call btrfs_free_fs_root */
1150 return ret;
1151}
1152
1153static struct btrfs_root *btrfs_lookup_fs_root(struct btrfs_fs_info *fs_info,
1154 u64 root_id)
1155{
1156 struct btrfs_root *root;
1157
1158 spin_lock(&fs_info->fs_roots_radix_lock);
1159 root = radix_tree_lookup(&fs_info->fs_roots_radix,
1160 (unsigned long)root_id);
1161 root = btrfs_grab_root(root);
1162 spin_unlock(&fs_info->fs_roots_radix_lock);
1163 return root;
1164}
1165
1166static struct btrfs_root *btrfs_get_global_root(struct btrfs_fs_info *fs_info,
1167 u64 objectid)
1168{
1169 struct btrfs_key key = {
1170 .objectid = objectid,
1171 .type = BTRFS_ROOT_ITEM_KEY,
1172 .offset = 0,
1173 };
1174
1175 switch (objectid) {
1176 case BTRFS_ROOT_TREE_OBJECTID:
1177 return btrfs_grab_root(fs_info->tree_root);
1178 case BTRFS_EXTENT_TREE_OBJECTID:
1179 return btrfs_grab_root(btrfs_global_root(fs_info, &key));
1180 case BTRFS_CHUNK_TREE_OBJECTID:
1181 return btrfs_grab_root(fs_info->chunk_root);
1182 case BTRFS_DEV_TREE_OBJECTID:
1183 return btrfs_grab_root(fs_info->dev_root);
1184 case BTRFS_CSUM_TREE_OBJECTID:
1185 return btrfs_grab_root(btrfs_global_root(fs_info, &key));
1186 case BTRFS_QUOTA_TREE_OBJECTID:
1187 return btrfs_grab_root(fs_info->quota_root);
1188 case BTRFS_UUID_TREE_OBJECTID:
1189 return btrfs_grab_root(fs_info->uuid_root);
1190 case BTRFS_BLOCK_GROUP_TREE_OBJECTID:
1191 return btrfs_grab_root(fs_info->block_group_root);
1192 case BTRFS_FREE_SPACE_TREE_OBJECTID:
1193 return btrfs_grab_root(btrfs_global_root(fs_info, &key));
1194 case BTRFS_RAID_STRIPE_TREE_OBJECTID:
1195 return btrfs_grab_root(fs_info->stripe_root);
1196 default:
1197 return NULL;
1198 }
1199}
1200
1201int btrfs_insert_fs_root(struct btrfs_fs_info *fs_info,
1202 struct btrfs_root *root)
1203{
1204 int ret;
1205
1206 ret = radix_tree_preload(GFP_NOFS);
1207 if (ret)
1208 return ret;
1209
1210 spin_lock(&fs_info->fs_roots_radix_lock);
1211 ret = radix_tree_insert(&fs_info->fs_roots_radix,
1212 (unsigned long)btrfs_root_id(root),
1213 root);
1214 if (ret == 0) {
1215 btrfs_grab_root(root);
1216 set_bit(BTRFS_ROOT_IN_RADIX, &root->state);
1217 }
1218 spin_unlock(&fs_info->fs_roots_radix_lock);
1219 radix_tree_preload_end();
1220
1221 return ret;
1222}
1223
1224void btrfs_check_leaked_roots(const struct btrfs_fs_info *fs_info)
1225{
1226#ifdef CONFIG_BTRFS_DEBUG
1227 struct btrfs_root *root;
1228
1229 while (!list_empty(&fs_info->allocated_roots)) {
1230 char buf[BTRFS_ROOT_NAME_BUF_LEN];
1231
1232 root = list_first_entry(&fs_info->allocated_roots,
1233 struct btrfs_root, leak_list);
1234 btrfs_err(fs_info, "leaked root %s refcount %d",
1235 btrfs_root_name(&root->root_key, buf),
1236 refcount_read(&root->refs));
1237 WARN_ON_ONCE(1);
1238 while (refcount_read(&root->refs) > 1)
1239 btrfs_put_root(root);
1240 btrfs_put_root(root);
1241 }
1242#endif
1243}
1244
1245static void free_global_roots(struct btrfs_fs_info *fs_info)
1246{
1247 struct btrfs_root *root;
1248 struct rb_node *node;
1249
1250 while ((node = rb_first_postorder(&fs_info->global_root_tree)) != NULL) {
1251 root = rb_entry(node, struct btrfs_root, rb_node);
1252 rb_erase(&root->rb_node, &fs_info->global_root_tree);
1253 btrfs_put_root(root);
1254 }
1255}
1256
1257void btrfs_free_fs_info(struct btrfs_fs_info *fs_info)
1258{
1259 struct percpu_counter *em_counter = &fs_info->evictable_extent_maps;
1260
1261 percpu_counter_destroy(&fs_info->dirty_metadata_bytes);
1262 percpu_counter_destroy(&fs_info->delalloc_bytes);
1263 percpu_counter_destroy(&fs_info->ordered_bytes);
1264 if (percpu_counter_initialized(em_counter))
1265 ASSERT(percpu_counter_sum_positive(em_counter) == 0);
1266 percpu_counter_destroy(em_counter);
1267 percpu_counter_destroy(&fs_info->dev_replace.bio_counter);
1268 btrfs_free_csum_hash(fs_info);
1269 btrfs_free_stripe_hash_table(fs_info);
1270 btrfs_free_ref_cache(fs_info);
1271 kfree(fs_info->balance_ctl);
1272 kfree(fs_info->delayed_root);
1273 free_global_roots(fs_info);
1274 btrfs_put_root(fs_info->tree_root);
1275 btrfs_put_root(fs_info->chunk_root);
1276 btrfs_put_root(fs_info->dev_root);
1277 btrfs_put_root(fs_info->quota_root);
1278 btrfs_put_root(fs_info->uuid_root);
1279 btrfs_put_root(fs_info->fs_root);
1280 btrfs_put_root(fs_info->data_reloc_root);
1281 btrfs_put_root(fs_info->block_group_root);
1282 btrfs_put_root(fs_info->stripe_root);
1283 btrfs_check_leaked_roots(fs_info);
1284 btrfs_extent_buffer_leak_debug_check(fs_info);
1285 kfree(fs_info->super_copy);
1286 kfree(fs_info->super_for_commit);
1287 kvfree(fs_info);
1288}
1289
1290
1291/*
1292 * Get an in-memory reference of a root structure.
1293 *
1294 * For essential trees like root/extent tree, we grab it from fs_info directly.
1295 * For subvolume trees, we check the cached filesystem roots first. If not
1296 * found, then read it from disk and add it to cached fs roots.
1297 *
1298 * Caller should release the root by calling btrfs_put_root() after the usage.
1299 *
1300 * NOTE: Reloc and log trees can't be read by this function as they share the
1301 * same root objectid.
1302 *
1303 * @objectid: root id
1304 * @anon_dev: preallocated anonymous block device number for new roots,
1305 * pass NULL for a new allocation.
1306 * @check_ref: whether to check root item references, If true, return -ENOENT
1307 * for orphan roots
1308 */
1309static struct btrfs_root *btrfs_get_root_ref(struct btrfs_fs_info *fs_info,
1310 u64 objectid, dev_t *anon_dev,
1311 bool check_ref)
1312{
1313 struct btrfs_root *root;
1314 struct btrfs_path *path;
1315 struct btrfs_key key;
1316 int ret;
1317
1318 root = btrfs_get_global_root(fs_info, objectid);
1319 if (root)
1320 return root;
1321
1322 /*
1323 * If we're called for non-subvolume trees, and above function didn't
1324 * find one, do not try to read it from disk.
1325 *
1326 * This is namely for free-space-tree and quota tree, which can change
1327 * at runtime and should only be grabbed from fs_info.
1328 */
1329 if (!is_fstree(objectid) && objectid != BTRFS_DATA_RELOC_TREE_OBJECTID)
1330 return ERR_PTR(-ENOENT);
1331again:
1332 root = btrfs_lookup_fs_root(fs_info, objectid);
1333 if (root) {
1334 /*
1335 * Some other caller may have read out the newly inserted
1336 * subvolume already (for things like backref walk etc). Not
1337 * that common but still possible. In that case, we just need
1338 * to free the anon_dev.
1339 */
1340 if (unlikely(anon_dev && *anon_dev)) {
1341 free_anon_bdev(*anon_dev);
1342 *anon_dev = 0;
1343 }
1344
1345 if (check_ref && btrfs_root_refs(&root->root_item) == 0) {
1346 btrfs_put_root(root);
1347 return ERR_PTR(-ENOENT);
1348 }
1349 return root;
1350 }
1351
1352 key.objectid = objectid;
1353 key.type = BTRFS_ROOT_ITEM_KEY;
1354 key.offset = (u64)-1;
1355 root = btrfs_read_tree_root(fs_info->tree_root, &key);
1356 if (IS_ERR(root))
1357 return root;
1358
1359 if (check_ref && btrfs_root_refs(&root->root_item) == 0) {
1360 ret = -ENOENT;
1361 goto fail;
1362 }
1363
1364 ret = btrfs_init_fs_root(root, anon_dev ? *anon_dev : 0);
1365 if (ret)
1366 goto fail;
1367
1368 path = btrfs_alloc_path();
1369 if (!path) {
1370 ret = -ENOMEM;
1371 goto fail;
1372 }
1373 key.objectid = BTRFS_ORPHAN_OBJECTID;
1374 key.type = BTRFS_ORPHAN_ITEM_KEY;
1375 key.offset = objectid;
1376
1377 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
1378 btrfs_free_path(path);
1379 if (ret < 0)
1380 goto fail;
1381 if (ret == 0)
1382 set_bit(BTRFS_ROOT_ORPHAN_ITEM_INSERTED, &root->state);
1383
1384 ret = btrfs_insert_fs_root(fs_info, root);
1385 if (ret) {
1386 if (ret == -EEXIST) {
1387 btrfs_put_root(root);
1388 goto again;
1389 }
1390 goto fail;
1391 }
1392 return root;
1393fail:
1394 /*
1395 * If our caller provided us an anonymous device, then it's his
1396 * responsibility to free it in case we fail. So we have to set our
1397 * root's anon_dev to 0 to avoid a double free, once by btrfs_put_root()
1398 * and once again by our caller.
1399 */
1400 if (anon_dev && *anon_dev)
1401 root->anon_dev = 0;
1402 btrfs_put_root(root);
1403 return ERR_PTR(ret);
1404}
1405
1406/*
1407 * Get in-memory reference of a root structure
1408 *
1409 * @objectid: tree objectid
1410 * @check_ref: if set, verify that the tree exists and the item has at least
1411 * one reference
1412 */
1413struct btrfs_root *btrfs_get_fs_root(struct btrfs_fs_info *fs_info,
1414 u64 objectid, bool check_ref)
1415{
1416 return btrfs_get_root_ref(fs_info, objectid, NULL, check_ref);
1417}
1418
1419/*
1420 * Get in-memory reference of a root structure, created as new, optionally pass
1421 * the anonymous block device id
1422 *
1423 * @objectid: tree objectid
1424 * @anon_dev: if NULL, allocate a new anonymous block device or use the
1425 * parameter value if not NULL
1426 */
1427struct btrfs_root *btrfs_get_new_fs_root(struct btrfs_fs_info *fs_info,
1428 u64 objectid, dev_t *anon_dev)
1429{
1430 return btrfs_get_root_ref(fs_info, objectid, anon_dev, true);
1431}
1432
1433/*
1434 * Return a root for the given objectid.
1435 *
1436 * @fs_info: the fs_info
1437 * @objectid: the objectid we need to lookup
1438 *
1439 * This is exclusively used for backref walking, and exists specifically because
1440 * of how qgroups does lookups. Qgroups will do a backref lookup at delayed ref
1441 * creation time, which means we may have to read the tree_root in order to look
1442 * up a fs root that is not in memory. If the root is not in memory we will
1443 * read the tree root commit root and look up the fs root from there. This is a
1444 * temporary root, it will not be inserted into the radix tree as it doesn't
1445 * have the most uptodate information, it'll simply be discarded once the
1446 * backref code is finished using the root.
1447 */
1448struct btrfs_root *btrfs_get_fs_root_commit_root(struct btrfs_fs_info *fs_info,
1449 struct btrfs_path *path,
1450 u64 objectid)
1451{
1452 struct btrfs_root *root;
1453 struct btrfs_key key;
1454
1455 ASSERT(path->search_commit_root && path->skip_locking);
1456
1457 /*
1458 * This can return -ENOENT if we ask for a root that doesn't exist, but
1459 * since this is called via the backref walking code we won't be looking
1460 * up a root that doesn't exist, unless there's corruption. So if root
1461 * != NULL just return it.
1462 */
1463 root = btrfs_get_global_root(fs_info, objectid);
1464 if (root)
1465 return root;
1466
1467 root = btrfs_lookup_fs_root(fs_info, objectid);
1468 if (root)
1469 return root;
1470
1471 key.objectid = objectid;
1472 key.type = BTRFS_ROOT_ITEM_KEY;
1473 key.offset = (u64)-1;
1474 root = read_tree_root_path(fs_info->tree_root, path, &key);
1475 btrfs_release_path(path);
1476
1477 return root;
1478}
1479
1480static int cleaner_kthread(void *arg)
1481{
1482 struct btrfs_fs_info *fs_info = arg;
1483 int again;
1484
1485 while (1) {
1486 again = 0;
1487
1488 set_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags);
1489
1490 /* Make the cleaner go to sleep early. */
1491 if (btrfs_need_cleaner_sleep(fs_info))
1492 goto sleep;
1493
1494 /*
1495 * Do not do anything if we might cause open_ctree() to block
1496 * before we have finished mounting the filesystem.
1497 */
1498 if (!test_bit(BTRFS_FS_OPEN, &fs_info->flags))
1499 goto sleep;
1500
1501 if (!mutex_trylock(&fs_info->cleaner_mutex))
1502 goto sleep;
1503
1504 /*
1505 * Avoid the problem that we change the status of the fs
1506 * during the above check and trylock.
1507 */
1508 if (btrfs_need_cleaner_sleep(fs_info)) {
1509 mutex_unlock(&fs_info->cleaner_mutex);
1510 goto sleep;
1511 }
1512
1513 if (test_and_clear_bit(BTRFS_FS_FEATURE_CHANGED, &fs_info->flags))
1514 btrfs_sysfs_feature_update(fs_info);
1515
1516 btrfs_run_delayed_iputs(fs_info);
1517
1518 again = btrfs_clean_one_deleted_snapshot(fs_info);
1519 mutex_unlock(&fs_info->cleaner_mutex);
1520
1521 /*
1522 * The defragger has dealt with the R/O remount and umount,
1523 * needn't do anything special here.
1524 */
1525 btrfs_run_defrag_inodes(fs_info);
1526
1527 /*
1528 * Acquires fs_info->reclaim_bgs_lock to avoid racing
1529 * with relocation (btrfs_relocate_chunk) and relocation
1530 * acquires fs_info->cleaner_mutex (btrfs_relocate_block_group)
1531 * after acquiring fs_info->reclaim_bgs_lock. So we
1532 * can't hold, nor need to, fs_info->cleaner_mutex when deleting
1533 * unused block groups.
1534 */
1535 btrfs_delete_unused_bgs(fs_info);
1536
1537 /*
1538 * Reclaim block groups in the reclaim_bgs list after we deleted
1539 * all unused block_groups. This possibly gives us some more free
1540 * space.
1541 */
1542 btrfs_reclaim_bgs(fs_info);
1543sleep:
1544 clear_and_wake_up_bit(BTRFS_FS_CLEANER_RUNNING, &fs_info->flags);
1545 if (kthread_should_park())
1546 kthread_parkme();
1547 if (kthread_should_stop())
1548 return 0;
1549 if (!again) {
1550 set_current_state(TASK_INTERRUPTIBLE);
1551 schedule();
1552 __set_current_state(TASK_RUNNING);
1553 }
1554 }
1555}
1556
1557static int transaction_kthread(void *arg)
1558{
1559 struct btrfs_root *root = arg;
1560 struct btrfs_fs_info *fs_info = root->fs_info;
1561 struct btrfs_trans_handle *trans;
1562 struct btrfs_transaction *cur;
1563 u64 transid;
1564 time64_t delta;
1565 unsigned long delay;
1566 bool cannot_commit;
1567
1568 do {
1569 cannot_commit = false;
1570 delay = msecs_to_jiffies(fs_info->commit_interval * 1000);
1571 mutex_lock(&fs_info->transaction_kthread_mutex);
1572
1573 spin_lock(&fs_info->trans_lock);
1574 cur = fs_info->running_transaction;
1575 if (!cur) {
1576 spin_unlock(&fs_info->trans_lock);
1577 goto sleep;
1578 }
1579
1580 delta = ktime_get_seconds() - cur->start_time;
1581 if (!test_and_clear_bit(BTRFS_FS_COMMIT_TRANS, &fs_info->flags) &&
1582 cur->state < TRANS_STATE_COMMIT_PREP &&
1583 delta < fs_info->commit_interval) {
1584 spin_unlock(&fs_info->trans_lock);
1585 delay -= msecs_to_jiffies((delta - 1) * 1000);
1586 delay = min(delay,
1587 msecs_to_jiffies(fs_info->commit_interval * 1000));
1588 goto sleep;
1589 }
1590 transid = cur->transid;
1591 spin_unlock(&fs_info->trans_lock);
1592
1593 /* If the file system is aborted, this will always fail. */
1594 trans = btrfs_attach_transaction(root);
1595 if (IS_ERR(trans)) {
1596 if (PTR_ERR(trans) != -ENOENT)
1597 cannot_commit = true;
1598 goto sleep;
1599 }
1600 if (transid == trans->transid) {
1601 btrfs_commit_transaction(trans);
1602 } else {
1603 btrfs_end_transaction(trans);
1604 }
1605sleep:
1606 wake_up_process(fs_info->cleaner_kthread);
1607 mutex_unlock(&fs_info->transaction_kthread_mutex);
1608
1609 if (BTRFS_FS_ERROR(fs_info))
1610 btrfs_cleanup_transaction(fs_info);
1611 if (!kthread_should_stop() &&
1612 (!btrfs_transaction_blocked(fs_info) ||
1613 cannot_commit))
1614 schedule_timeout_interruptible(delay);
1615 } while (!kthread_should_stop());
1616 return 0;
1617}
1618
1619/*
1620 * This will find the highest generation in the array of root backups. The
1621 * index of the highest array is returned, or -EINVAL if we can't find
1622 * anything.
1623 *
1624 * We check to make sure the array is valid by comparing the
1625 * generation of the latest root in the array with the generation
1626 * in the super block. If they don't match we pitch it.
1627 */
1628static int find_newest_super_backup(struct btrfs_fs_info *info)
1629{
1630 const u64 newest_gen = btrfs_super_generation(info->super_copy);
1631 u64 cur;
1632 struct btrfs_root_backup *root_backup;
1633 int i;
1634
1635 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
1636 root_backup = info->super_copy->super_roots + i;
1637 cur = btrfs_backup_tree_root_gen(root_backup);
1638 if (cur == newest_gen)
1639 return i;
1640 }
1641
1642 return -EINVAL;
1643}
1644
1645/*
1646 * copy all the root pointers into the super backup array.
1647 * this will bump the backup pointer by one when it is
1648 * done
1649 */
1650static void backup_super_roots(struct btrfs_fs_info *info)
1651{
1652 const int next_backup = info->backup_root_index;
1653 struct btrfs_root_backup *root_backup;
1654
1655 root_backup = info->super_for_commit->super_roots + next_backup;
1656
1657 /*
1658 * make sure all of our padding and empty slots get zero filled
1659 * regardless of which ones we use today
1660 */
1661 memset(root_backup, 0, sizeof(*root_backup));
1662
1663 info->backup_root_index = (next_backup + 1) % BTRFS_NUM_BACKUP_ROOTS;
1664
1665 btrfs_set_backup_tree_root(root_backup, info->tree_root->node->start);
1666 btrfs_set_backup_tree_root_gen(root_backup,
1667 btrfs_header_generation(info->tree_root->node));
1668
1669 btrfs_set_backup_tree_root_level(root_backup,
1670 btrfs_header_level(info->tree_root->node));
1671
1672 btrfs_set_backup_chunk_root(root_backup, info->chunk_root->node->start);
1673 btrfs_set_backup_chunk_root_gen(root_backup,
1674 btrfs_header_generation(info->chunk_root->node));
1675 btrfs_set_backup_chunk_root_level(root_backup,
1676 btrfs_header_level(info->chunk_root->node));
1677
1678 if (!btrfs_fs_compat_ro(info, BLOCK_GROUP_TREE)) {
1679 struct btrfs_root *extent_root = btrfs_extent_root(info, 0);
1680 struct btrfs_root *csum_root = btrfs_csum_root(info, 0);
1681
1682 btrfs_set_backup_extent_root(root_backup,
1683 extent_root->node->start);
1684 btrfs_set_backup_extent_root_gen(root_backup,
1685 btrfs_header_generation(extent_root->node));
1686 btrfs_set_backup_extent_root_level(root_backup,
1687 btrfs_header_level(extent_root->node));
1688
1689 btrfs_set_backup_csum_root(root_backup, csum_root->node->start);
1690 btrfs_set_backup_csum_root_gen(root_backup,
1691 btrfs_header_generation(csum_root->node));
1692 btrfs_set_backup_csum_root_level(root_backup,
1693 btrfs_header_level(csum_root->node));
1694 }
1695
1696 /*
1697 * we might commit during log recovery, which happens before we set
1698 * the fs_root. Make sure it is valid before we fill it in.
1699 */
1700 if (info->fs_root && info->fs_root->node) {
1701 btrfs_set_backup_fs_root(root_backup,
1702 info->fs_root->node->start);
1703 btrfs_set_backup_fs_root_gen(root_backup,
1704 btrfs_header_generation(info->fs_root->node));
1705 btrfs_set_backup_fs_root_level(root_backup,
1706 btrfs_header_level(info->fs_root->node));
1707 }
1708
1709 btrfs_set_backup_dev_root(root_backup, info->dev_root->node->start);
1710 btrfs_set_backup_dev_root_gen(root_backup,
1711 btrfs_header_generation(info->dev_root->node));
1712 btrfs_set_backup_dev_root_level(root_backup,
1713 btrfs_header_level(info->dev_root->node));
1714
1715 btrfs_set_backup_total_bytes(root_backup,
1716 btrfs_super_total_bytes(info->super_copy));
1717 btrfs_set_backup_bytes_used(root_backup,
1718 btrfs_super_bytes_used(info->super_copy));
1719 btrfs_set_backup_num_devices(root_backup,
1720 btrfs_super_num_devices(info->super_copy));
1721
1722 /*
1723 * if we don't copy this out to the super_copy, it won't get remembered
1724 * for the next commit
1725 */
1726 memcpy(&info->super_copy->super_roots,
1727 &info->super_for_commit->super_roots,
1728 sizeof(*root_backup) * BTRFS_NUM_BACKUP_ROOTS);
1729}
1730
1731/*
1732 * Reads a backup root based on the passed priority. Prio 0 is the newest, prio
1733 * 1/2/3 are 2nd newest/3rd newest/4th (oldest) backup roots
1734 *
1735 * @fs_info: filesystem whose backup roots need to be read
1736 * @priority: priority of backup root required
1737 *
1738 * Returns backup root index on success and -EINVAL otherwise.
1739 */
1740static int read_backup_root(struct btrfs_fs_info *fs_info, u8 priority)
1741{
1742 int backup_index = find_newest_super_backup(fs_info);
1743 struct btrfs_super_block *super = fs_info->super_copy;
1744 struct btrfs_root_backup *root_backup;
1745
1746 if (priority < BTRFS_NUM_BACKUP_ROOTS && backup_index >= 0) {
1747 if (priority == 0)
1748 return backup_index;
1749
1750 backup_index = backup_index + BTRFS_NUM_BACKUP_ROOTS - priority;
1751 backup_index %= BTRFS_NUM_BACKUP_ROOTS;
1752 } else {
1753 return -EINVAL;
1754 }
1755
1756 root_backup = super->super_roots + backup_index;
1757
1758 btrfs_set_super_generation(super,
1759 btrfs_backup_tree_root_gen(root_backup));
1760 btrfs_set_super_root(super, btrfs_backup_tree_root(root_backup));
1761 btrfs_set_super_root_level(super,
1762 btrfs_backup_tree_root_level(root_backup));
1763 btrfs_set_super_bytes_used(super, btrfs_backup_bytes_used(root_backup));
1764
1765 /*
1766 * Fixme: the total bytes and num_devices need to match or we should
1767 * need a fsck
1768 */
1769 btrfs_set_super_total_bytes(super, btrfs_backup_total_bytes(root_backup));
1770 btrfs_set_super_num_devices(super, btrfs_backup_num_devices(root_backup));
1771
1772 return backup_index;
1773}
1774
1775/* helper to cleanup workers */
1776static void btrfs_stop_all_workers(struct btrfs_fs_info *fs_info)
1777{
1778 btrfs_destroy_workqueue(fs_info->fixup_workers);
1779 btrfs_destroy_workqueue(fs_info->delalloc_workers);
1780 btrfs_destroy_workqueue(fs_info->workers);
1781 if (fs_info->endio_workers)
1782 destroy_workqueue(fs_info->endio_workers);
1783 if (fs_info->rmw_workers)
1784 destroy_workqueue(fs_info->rmw_workers);
1785 if (fs_info->compressed_write_workers)
1786 destroy_workqueue(fs_info->compressed_write_workers);
1787 btrfs_destroy_workqueue(fs_info->endio_write_workers);
1788 btrfs_destroy_workqueue(fs_info->endio_freespace_worker);
1789 btrfs_destroy_workqueue(fs_info->delayed_workers);
1790 btrfs_destroy_workqueue(fs_info->caching_workers);
1791 btrfs_destroy_workqueue(fs_info->flush_workers);
1792 btrfs_destroy_workqueue(fs_info->qgroup_rescan_workers);
1793 if (fs_info->discard_ctl.discard_workers)
1794 destroy_workqueue(fs_info->discard_ctl.discard_workers);
1795 /*
1796 * Now that all other work queues are destroyed, we can safely destroy
1797 * the queues used for metadata I/O, since tasks from those other work
1798 * queues can do metadata I/O operations.
1799 */
1800 if (fs_info->endio_meta_workers)
1801 destroy_workqueue(fs_info->endio_meta_workers);
1802}
1803
1804static void free_root_extent_buffers(struct btrfs_root *root)
1805{
1806 if (root) {
1807 free_extent_buffer(root->node);
1808 free_extent_buffer(root->commit_root);
1809 root->node = NULL;
1810 root->commit_root = NULL;
1811 }
1812}
1813
1814static void free_global_root_pointers(struct btrfs_fs_info *fs_info)
1815{
1816 struct btrfs_root *root, *tmp;
1817
1818 rbtree_postorder_for_each_entry_safe(root, tmp,
1819 &fs_info->global_root_tree,
1820 rb_node)
1821 free_root_extent_buffers(root);
1822}
1823
1824/* helper to cleanup tree roots */
1825static void free_root_pointers(struct btrfs_fs_info *info, bool free_chunk_root)
1826{
1827 free_root_extent_buffers(info->tree_root);
1828
1829 free_global_root_pointers(info);
1830 free_root_extent_buffers(info->dev_root);
1831 free_root_extent_buffers(info->quota_root);
1832 free_root_extent_buffers(info->uuid_root);
1833 free_root_extent_buffers(info->fs_root);
1834 free_root_extent_buffers(info->data_reloc_root);
1835 free_root_extent_buffers(info->block_group_root);
1836 free_root_extent_buffers(info->stripe_root);
1837 if (free_chunk_root)
1838 free_root_extent_buffers(info->chunk_root);
1839}
1840
1841void btrfs_put_root(struct btrfs_root *root)
1842{
1843 if (!root)
1844 return;
1845
1846 if (refcount_dec_and_test(&root->refs)) {
1847 if (WARN_ON(!xa_empty(&root->inodes)))
1848 xa_destroy(&root->inodes);
1849 WARN_ON(test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state));
1850 if (root->anon_dev)
1851 free_anon_bdev(root->anon_dev);
1852 free_root_extent_buffers(root);
1853#ifdef CONFIG_BTRFS_DEBUG
1854 spin_lock(&root->fs_info->fs_roots_radix_lock);
1855 list_del_init(&root->leak_list);
1856 spin_unlock(&root->fs_info->fs_roots_radix_lock);
1857#endif
1858 kfree(root);
1859 }
1860}
1861
1862void btrfs_free_fs_roots(struct btrfs_fs_info *fs_info)
1863{
1864 int ret;
1865 struct btrfs_root *gang[8];
1866 int i;
1867
1868 while (!list_empty(&fs_info->dead_roots)) {
1869 gang[0] = list_entry(fs_info->dead_roots.next,
1870 struct btrfs_root, root_list);
1871 list_del(&gang[0]->root_list);
1872
1873 if (test_bit(BTRFS_ROOT_IN_RADIX, &gang[0]->state))
1874 btrfs_drop_and_free_fs_root(fs_info, gang[0]);
1875 btrfs_put_root(gang[0]);
1876 }
1877
1878 while (1) {
1879 ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
1880 (void **)gang, 0,
1881 ARRAY_SIZE(gang));
1882 if (!ret)
1883 break;
1884 for (i = 0; i < ret; i++)
1885 btrfs_drop_and_free_fs_root(fs_info, gang[i]);
1886 }
1887}
1888
1889static void btrfs_init_scrub(struct btrfs_fs_info *fs_info)
1890{
1891 mutex_init(&fs_info->scrub_lock);
1892 atomic_set(&fs_info->scrubs_running, 0);
1893 atomic_set(&fs_info->scrub_pause_req, 0);
1894 atomic_set(&fs_info->scrubs_paused, 0);
1895 atomic_set(&fs_info->scrub_cancel_req, 0);
1896 init_waitqueue_head(&fs_info->scrub_pause_wait);
1897 refcount_set(&fs_info->scrub_workers_refcnt, 0);
1898}
1899
1900static void btrfs_init_balance(struct btrfs_fs_info *fs_info)
1901{
1902 spin_lock_init(&fs_info->balance_lock);
1903 mutex_init(&fs_info->balance_mutex);
1904 atomic_set(&fs_info->balance_pause_req, 0);
1905 atomic_set(&fs_info->balance_cancel_req, 0);
1906 fs_info->balance_ctl = NULL;
1907 init_waitqueue_head(&fs_info->balance_wait_q);
1908 atomic_set(&fs_info->reloc_cancel_req, 0);
1909}
1910
1911static int btrfs_init_btree_inode(struct super_block *sb)
1912{
1913 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
1914 unsigned long hash = btrfs_inode_hash(BTRFS_BTREE_INODE_OBJECTID,
1915 fs_info->tree_root);
1916 struct inode *inode;
1917
1918 inode = new_inode(sb);
1919 if (!inode)
1920 return -ENOMEM;
1921
1922 btrfs_set_inode_number(BTRFS_I(inode), BTRFS_BTREE_INODE_OBJECTID);
1923 set_nlink(inode, 1);
1924 /*
1925 * we set the i_size on the btree inode to the max possible int.
1926 * the real end of the address space is determined by all of
1927 * the devices in the system
1928 */
1929 inode->i_size = OFFSET_MAX;
1930 inode->i_mapping->a_ops = &btree_aops;
1931 mapping_set_gfp_mask(inode->i_mapping, GFP_NOFS);
1932
1933 extent_io_tree_init(fs_info, &BTRFS_I(inode)->io_tree,
1934 IO_TREE_BTREE_INODE_IO);
1935 extent_map_tree_init(&BTRFS_I(inode)->extent_tree);
1936
1937 BTRFS_I(inode)->root = btrfs_grab_root(fs_info->tree_root);
1938 set_bit(BTRFS_INODE_DUMMY, &BTRFS_I(inode)->runtime_flags);
1939 __insert_inode_hash(inode, hash);
1940 fs_info->btree_inode = inode;
1941
1942 return 0;
1943}
1944
1945static void btrfs_init_dev_replace_locks(struct btrfs_fs_info *fs_info)
1946{
1947 mutex_init(&fs_info->dev_replace.lock_finishing_cancel_unmount);
1948 init_rwsem(&fs_info->dev_replace.rwsem);
1949 init_waitqueue_head(&fs_info->dev_replace.replace_wait);
1950}
1951
1952static void btrfs_init_qgroup(struct btrfs_fs_info *fs_info)
1953{
1954 spin_lock_init(&fs_info->qgroup_lock);
1955 mutex_init(&fs_info->qgroup_ioctl_lock);
1956 fs_info->qgroup_tree = RB_ROOT;
1957 INIT_LIST_HEAD(&fs_info->dirty_qgroups);
1958 fs_info->qgroup_seq = 1;
1959 fs_info->qgroup_ulist = NULL;
1960 fs_info->qgroup_rescan_running = false;
1961 fs_info->qgroup_drop_subtree_thres = BTRFS_QGROUP_DROP_SUBTREE_THRES_DEFAULT;
1962 mutex_init(&fs_info->qgroup_rescan_lock);
1963}
1964
1965static int btrfs_init_workqueues(struct btrfs_fs_info *fs_info)
1966{
1967 u32 max_active = fs_info->thread_pool_size;
1968 unsigned int flags = WQ_MEM_RECLAIM | WQ_FREEZABLE | WQ_UNBOUND;
1969 unsigned int ordered_flags = WQ_MEM_RECLAIM | WQ_FREEZABLE;
1970
1971 fs_info->workers =
1972 btrfs_alloc_workqueue(fs_info, "worker", flags, max_active, 16);
1973
1974 fs_info->delalloc_workers =
1975 btrfs_alloc_workqueue(fs_info, "delalloc",
1976 flags, max_active, 2);
1977
1978 fs_info->flush_workers =
1979 btrfs_alloc_workqueue(fs_info, "flush_delalloc",
1980 flags, max_active, 0);
1981
1982 fs_info->caching_workers =
1983 btrfs_alloc_workqueue(fs_info, "cache", flags, max_active, 0);
1984
1985 fs_info->fixup_workers =
1986 btrfs_alloc_ordered_workqueue(fs_info, "fixup", ordered_flags);
1987
1988 fs_info->endio_workers =
1989 alloc_workqueue("btrfs-endio", flags, max_active);
1990 fs_info->endio_meta_workers =
1991 alloc_workqueue("btrfs-endio-meta", flags, max_active);
1992 fs_info->rmw_workers = alloc_workqueue("btrfs-rmw", flags, max_active);
1993 fs_info->endio_write_workers =
1994 btrfs_alloc_workqueue(fs_info, "endio-write", flags,
1995 max_active, 2);
1996 fs_info->compressed_write_workers =
1997 alloc_workqueue("btrfs-compressed-write", flags, max_active);
1998 fs_info->endio_freespace_worker =
1999 btrfs_alloc_workqueue(fs_info, "freespace-write", flags,
2000 max_active, 0);
2001 fs_info->delayed_workers =
2002 btrfs_alloc_workqueue(fs_info, "delayed-meta", flags,
2003 max_active, 0);
2004 fs_info->qgroup_rescan_workers =
2005 btrfs_alloc_ordered_workqueue(fs_info, "qgroup-rescan",
2006 ordered_flags);
2007 fs_info->discard_ctl.discard_workers =
2008 alloc_ordered_workqueue("btrfs_discard", WQ_FREEZABLE);
2009
2010 if (!(fs_info->workers &&
2011 fs_info->delalloc_workers && fs_info->flush_workers &&
2012 fs_info->endio_workers && fs_info->endio_meta_workers &&
2013 fs_info->compressed_write_workers &&
2014 fs_info->endio_write_workers &&
2015 fs_info->endio_freespace_worker && fs_info->rmw_workers &&
2016 fs_info->caching_workers && fs_info->fixup_workers &&
2017 fs_info->delayed_workers && fs_info->qgroup_rescan_workers &&
2018 fs_info->discard_ctl.discard_workers)) {
2019 return -ENOMEM;
2020 }
2021
2022 return 0;
2023}
2024
2025static int btrfs_init_csum_hash(struct btrfs_fs_info *fs_info, u16 csum_type)
2026{
2027 struct crypto_shash *csum_shash;
2028 const char *csum_driver = btrfs_super_csum_driver(csum_type);
2029
2030 csum_shash = crypto_alloc_shash(csum_driver, 0, 0);
2031
2032 if (IS_ERR(csum_shash)) {
2033 btrfs_err(fs_info, "error allocating %s hash for checksum",
2034 csum_driver);
2035 return PTR_ERR(csum_shash);
2036 }
2037
2038 fs_info->csum_shash = csum_shash;
2039
2040 /*
2041 * Check if the checksum implementation is a fast accelerated one.
2042 * As-is this is a bit of a hack and should be replaced once the csum
2043 * implementations provide that information themselves.
2044 */
2045 switch (csum_type) {
2046 case BTRFS_CSUM_TYPE_CRC32:
2047 if (!strstr(crypto_shash_driver_name(csum_shash), "generic"))
2048 set_bit(BTRFS_FS_CSUM_IMPL_FAST, &fs_info->flags);
2049 break;
2050 case BTRFS_CSUM_TYPE_XXHASH:
2051 set_bit(BTRFS_FS_CSUM_IMPL_FAST, &fs_info->flags);
2052 break;
2053 default:
2054 break;
2055 }
2056
2057 btrfs_info(fs_info, "using %s (%s) checksum algorithm",
2058 btrfs_super_csum_name(csum_type),
2059 crypto_shash_driver_name(csum_shash));
2060 return 0;
2061}
2062
2063static int btrfs_replay_log(struct btrfs_fs_info *fs_info,
2064 struct btrfs_fs_devices *fs_devices)
2065{
2066 int ret;
2067 struct btrfs_tree_parent_check check = { 0 };
2068 struct btrfs_root *log_tree_root;
2069 struct btrfs_super_block *disk_super = fs_info->super_copy;
2070 u64 bytenr = btrfs_super_log_root(disk_super);
2071 int level = btrfs_super_log_root_level(disk_super);
2072
2073 if (fs_devices->rw_devices == 0) {
2074 btrfs_warn(fs_info, "log replay required on RO media");
2075 return -EIO;
2076 }
2077
2078 log_tree_root = btrfs_alloc_root(fs_info, BTRFS_TREE_LOG_OBJECTID,
2079 GFP_KERNEL);
2080 if (!log_tree_root)
2081 return -ENOMEM;
2082
2083 check.level = level;
2084 check.transid = fs_info->generation + 1;
2085 check.owner_root = BTRFS_TREE_LOG_OBJECTID;
2086 log_tree_root->node = read_tree_block(fs_info, bytenr, &check);
2087 if (IS_ERR(log_tree_root->node)) {
2088 btrfs_warn(fs_info, "failed to read log tree");
2089 ret = PTR_ERR(log_tree_root->node);
2090 log_tree_root->node = NULL;
2091 btrfs_put_root(log_tree_root);
2092 return ret;
2093 }
2094 if (!extent_buffer_uptodate(log_tree_root->node)) {
2095 btrfs_err(fs_info, "failed to read log tree");
2096 btrfs_put_root(log_tree_root);
2097 return -EIO;
2098 }
2099
2100 /* returns with log_tree_root freed on success */
2101 ret = btrfs_recover_log_trees(log_tree_root);
2102 if (ret) {
2103 btrfs_handle_fs_error(fs_info, ret,
2104 "Failed to recover log tree");
2105 btrfs_put_root(log_tree_root);
2106 return ret;
2107 }
2108
2109 if (sb_rdonly(fs_info->sb)) {
2110 ret = btrfs_commit_super(fs_info);
2111 if (ret)
2112 return ret;
2113 }
2114
2115 return 0;
2116}
2117
2118static int load_global_roots_objectid(struct btrfs_root *tree_root,
2119 struct btrfs_path *path, u64 objectid,
2120 const char *name)
2121{
2122 struct btrfs_fs_info *fs_info = tree_root->fs_info;
2123 struct btrfs_root *root;
2124 u64 max_global_id = 0;
2125 int ret;
2126 struct btrfs_key key = {
2127 .objectid = objectid,
2128 .type = BTRFS_ROOT_ITEM_KEY,
2129 .offset = 0,
2130 };
2131 bool found = false;
2132
2133 /* If we have IGNOREDATACSUMS skip loading these roots. */
2134 if (objectid == BTRFS_CSUM_TREE_OBJECTID &&
2135 btrfs_test_opt(fs_info, IGNOREDATACSUMS)) {
2136 set_bit(BTRFS_FS_STATE_NO_DATA_CSUMS, &fs_info->fs_state);
2137 return 0;
2138 }
2139
2140 while (1) {
2141 ret = btrfs_search_slot(NULL, tree_root, &key, path, 0, 0);
2142 if (ret < 0)
2143 break;
2144
2145 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
2146 ret = btrfs_next_leaf(tree_root, path);
2147 if (ret) {
2148 if (ret > 0)
2149 ret = 0;
2150 break;
2151 }
2152 }
2153 ret = 0;
2154
2155 btrfs_item_key_to_cpu(path->nodes[0], &key, path->slots[0]);
2156 if (key.objectid != objectid)
2157 break;
2158 btrfs_release_path(path);
2159
2160 /*
2161 * Just worry about this for extent tree, it'll be the same for
2162 * everybody.
2163 */
2164 if (objectid == BTRFS_EXTENT_TREE_OBJECTID)
2165 max_global_id = max(max_global_id, key.offset);
2166
2167 found = true;
2168 root = read_tree_root_path(tree_root, path, &key);
2169 if (IS_ERR(root)) {
2170 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS))
2171 ret = PTR_ERR(root);
2172 break;
2173 }
2174 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2175 ret = btrfs_global_root_insert(root);
2176 if (ret) {
2177 btrfs_put_root(root);
2178 break;
2179 }
2180 key.offset++;
2181 }
2182 btrfs_release_path(path);
2183
2184 if (objectid == BTRFS_EXTENT_TREE_OBJECTID)
2185 fs_info->nr_global_roots = max_global_id + 1;
2186
2187 if (!found || ret) {
2188 if (objectid == BTRFS_CSUM_TREE_OBJECTID)
2189 set_bit(BTRFS_FS_STATE_NO_DATA_CSUMS, &fs_info->fs_state);
2190
2191 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS))
2192 ret = ret ? ret : -ENOENT;
2193 else
2194 ret = 0;
2195 btrfs_err(fs_info, "failed to load root %s", name);
2196 }
2197 return ret;
2198}
2199
2200static int load_global_roots(struct btrfs_root *tree_root)
2201{
2202 struct btrfs_path *path;
2203 int ret = 0;
2204
2205 path = btrfs_alloc_path();
2206 if (!path)
2207 return -ENOMEM;
2208
2209 ret = load_global_roots_objectid(tree_root, path,
2210 BTRFS_EXTENT_TREE_OBJECTID, "extent");
2211 if (ret)
2212 goto out;
2213 ret = load_global_roots_objectid(tree_root, path,
2214 BTRFS_CSUM_TREE_OBJECTID, "csum");
2215 if (ret)
2216 goto out;
2217 if (!btrfs_fs_compat_ro(tree_root->fs_info, FREE_SPACE_TREE))
2218 goto out;
2219 ret = load_global_roots_objectid(tree_root, path,
2220 BTRFS_FREE_SPACE_TREE_OBJECTID,
2221 "free space");
2222out:
2223 btrfs_free_path(path);
2224 return ret;
2225}
2226
2227static int btrfs_read_roots(struct btrfs_fs_info *fs_info)
2228{
2229 struct btrfs_root *tree_root = fs_info->tree_root;
2230 struct btrfs_root *root;
2231 struct btrfs_key location;
2232 int ret;
2233
2234 ASSERT(fs_info->tree_root);
2235
2236 ret = load_global_roots(tree_root);
2237 if (ret)
2238 return ret;
2239
2240 location.type = BTRFS_ROOT_ITEM_KEY;
2241 location.offset = 0;
2242
2243 if (btrfs_fs_compat_ro(fs_info, BLOCK_GROUP_TREE)) {
2244 location.objectid = BTRFS_BLOCK_GROUP_TREE_OBJECTID;
2245 root = btrfs_read_tree_root(tree_root, &location);
2246 if (IS_ERR(root)) {
2247 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS)) {
2248 ret = PTR_ERR(root);
2249 goto out;
2250 }
2251 } else {
2252 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2253 fs_info->block_group_root = root;
2254 }
2255 }
2256
2257 location.objectid = BTRFS_DEV_TREE_OBJECTID;
2258 root = btrfs_read_tree_root(tree_root, &location);
2259 if (IS_ERR(root)) {
2260 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS)) {
2261 ret = PTR_ERR(root);
2262 goto out;
2263 }
2264 } else {
2265 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2266 fs_info->dev_root = root;
2267 }
2268 /* Initialize fs_info for all devices in any case */
2269 ret = btrfs_init_devices_late(fs_info);
2270 if (ret)
2271 goto out;
2272
2273 /*
2274 * This tree can share blocks with some other fs tree during relocation
2275 * and we need a proper setup by btrfs_get_fs_root
2276 */
2277 root = btrfs_get_fs_root(tree_root->fs_info,
2278 BTRFS_DATA_RELOC_TREE_OBJECTID, true);
2279 if (IS_ERR(root)) {
2280 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS)) {
2281 ret = PTR_ERR(root);
2282 goto out;
2283 }
2284 } else {
2285 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2286 fs_info->data_reloc_root = root;
2287 }
2288
2289 location.objectid = BTRFS_QUOTA_TREE_OBJECTID;
2290 root = btrfs_read_tree_root(tree_root, &location);
2291 if (!IS_ERR(root)) {
2292 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2293 fs_info->quota_root = root;
2294 }
2295
2296 location.objectid = BTRFS_UUID_TREE_OBJECTID;
2297 root = btrfs_read_tree_root(tree_root, &location);
2298 if (IS_ERR(root)) {
2299 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS)) {
2300 ret = PTR_ERR(root);
2301 if (ret != -ENOENT)
2302 goto out;
2303 }
2304 } else {
2305 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2306 fs_info->uuid_root = root;
2307 }
2308
2309 if (btrfs_fs_incompat(fs_info, RAID_STRIPE_TREE)) {
2310 location.objectid = BTRFS_RAID_STRIPE_TREE_OBJECTID;
2311 root = btrfs_read_tree_root(tree_root, &location);
2312 if (IS_ERR(root)) {
2313 if (!btrfs_test_opt(fs_info, IGNOREBADROOTS)) {
2314 ret = PTR_ERR(root);
2315 goto out;
2316 }
2317 } else {
2318 set_bit(BTRFS_ROOT_TRACK_DIRTY, &root->state);
2319 fs_info->stripe_root = root;
2320 }
2321 }
2322
2323 return 0;
2324out:
2325 btrfs_warn(fs_info, "failed to read root (objectid=%llu): %d",
2326 location.objectid, ret);
2327 return ret;
2328}
2329
2330/*
2331 * Real super block validation
2332 * NOTE: super csum type and incompat features will not be checked here.
2333 *
2334 * @sb: super block to check
2335 * @mirror_num: the super block number to check its bytenr:
2336 * 0 the primary (1st) sb
2337 * 1, 2 2nd and 3rd backup copy
2338 * -1 skip bytenr check
2339 */
2340int btrfs_validate_super(const struct btrfs_fs_info *fs_info,
2341 const struct btrfs_super_block *sb, int mirror_num)
2342{
2343 u64 nodesize = btrfs_super_nodesize(sb);
2344 u64 sectorsize = btrfs_super_sectorsize(sb);
2345 int ret = 0;
2346 const bool ignore_flags = btrfs_test_opt(fs_info, IGNORESUPERFLAGS);
2347
2348 if (btrfs_super_magic(sb) != BTRFS_MAGIC) {
2349 btrfs_err(fs_info, "no valid FS found");
2350 ret = -EINVAL;
2351 }
2352 if ((btrfs_super_flags(sb) & ~BTRFS_SUPER_FLAG_SUPP)) {
2353 if (!ignore_flags) {
2354 btrfs_err(fs_info,
2355 "unrecognized or unsupported super flag 0x%llx",
2356 btrfs_super_flags(sb) & ~BTRFS_SUPER_FLAG_SUPP);
2357 ret = -EINVAL;
2358 } else {
2359 btrfs_info(fs_info,
2360 "unrecognized or unsupported super flags: 0x%llx, ignored",
2361 btrfs_super_flags(sb) & ~BTRFS_SUPER_FLAG_SUPP);
2362 }
2363 }
2364 if (btrfs_super_root_level(sb) >= BTRFS_MAX_LEVEL) {
2365 btrfs_err(fs_info, "tree_root level too big: %d >= %d",
2366 btrfs_super_root_level(sb), BTRFS_MAX_LEVEL);
2367 ret = -EINVAL;
2368 }
2369 if (btrfs_super_chunk_root_level(sb) >= BTRFS_MAX_LEVEL) {
2370 btrfs_err(fs_info, "chunk_root level too big: %d >= %d",
2371 btrfs_super_chunk_root_level(sb), BTRFS_MAX_LEVEL);
2372 ret = -EINVAL;
2373 }
2374 if (btrfs_super_log_root_level(sb) >= BTRFS_MAX_LEVEL) {
2375 btrfs_err(fs_info, "log_root level too big: %d >= %d",
2376 btrfs_super_log_root_level(sb), BTRFS_MAX_LEVEL);
2377 ret = -EINVAL;
2378 }
2379
2380 /*
2381 * Check sectorsize and nodesize first, other check will need it.
2382 * Check all possible sectorsize(4K, 8K, 16K, 32K, 64K) here.
2383 */
2384 if (!is_power_of_2(sectorsize) || sectorsize < 4096 ||
2385 sectorsize > BTRFS_MAX_METADATA_BLOCKSIZE) {
2386 btrfs_err(fs_info, "invalid sectorsize %llu", sectorsize);
2387 ret = -EINVAL;
2388 }
2389
2390 /*
2391 * We only support at most two sectorsizes: 4K and PAGE_SIZE.
2392 *
2393 * We can support 16K sectorsize with 64K page size without problem,
2394 * but such sectorsize/pagesize combination doesn't make much sense.
2395 * 4K will be our future standard, PAGE_SIZE is supported from the very
2396 * beginning.
2397 */
2398 if (sectorsize > PAGE_SIZE || (sectorsize != SZ_4K && sectorsize != PAGE_SIZE)) {
2399 btrfs_err(fs_info,
2400 "sectorsize %llu not yet supported for page size %lu",
2401 sectorsize, PAGE_SIZE);
2402 ret = -EINVAL;
2403 }
2404
2405 if (!is_power_of_2(nodesize) || nodesize < sectorsize ||
2406 nodesize > BTRFS_MAX_METADATA_BLOCKSIZE) {
2407 btrfs_err(fs_info, "invalid nodesize %llu", nodesize);
2408 ret = -EINVAL;
2409 }
2410 if (nodesize != le32_to_cpu(sb->__unused_leafsize)) {
2411 btrfs_err(fs_info, "invalid leafsize %u, should be %llu",
2412 le32_to_cpu(sb->__unused_leafsize), nodesize);
2413 ret = -EINVAL;
2414 }
2415
2416 /* Root alignment check */
2417 if (!IS_ALIGNED(btrfs_super_root(sb), sectorsize)) {
2418 btrfs_warn(fs_info, "tree_root block unaligned: %llu",
2419 btrfs_super_root(sb));
2420 ret = -EINVAL;
2421 }
2422 if (!IS_ALIGNED(btrfs_super_chunk_root(sb), sectorsize)) {
2423 btrfs_warn(fs_info, "chunk_root block unaligned: %llu",
2424 btrfs_super_chunk_root(sb));
2425 ret = -EINVAL;
2426 }
2427 if (!IS_ALIGNED(btrfs_super_log_root(sb), sectorsize)) {
2428 btrfs_warn(fs_info, "log_root block unaligned: %llu",
2429 btrfs_super_log_root(sb));
2430 ret = -EINVAL;
2431 }
2432
2433 if (!fs_info->fs_devices->temp_fsid &&
2434 memcmp(fs_info->fs_devices->fsid, sb->fsid, BTRFS_FSID_SIZE) != 0) {
2435 btrfs_err(fs_info,
2436 "superblock fsid doesn't match fsid of fs_devices: %pU != %pU",
2437 sb->fsid, fs_info->fs_devices->fsid);
2438 ret = -EINVAL;
2439 }
2440
2441 if (memcmp(fs_info->fs_devices->metadata_uuid, btrfs_sb_fsid_ptr(sb),
2442 BTRFS_FSID_SIZE) != 0) {
2443 btrfs_err(fs_info,
2444"superblock metadata_uuid doesn't match metadata uuid of fs_devices: %pU != %pU",
2445 btrfs_sb_fsid_ptr(sb), fs_info->fs_devices->metadata_uuid);
2446 ret = -EINVAL;
2447 }
2448
2449 if (memcmp(fs_info->fs_devices->metadata_uuid, sb->dev_item.fsid,
2450 BTRFS_FSID_SIZE) != 0) {
2451 btrfs_err(fs_info,
2452 "dev_item UUID does not match metadata fsid: %pU != %pU",
2453 fs_info->fs_devices->metadata_uuid, sb->dev_item.fsid);
2454 ret = -EINVAL;
2455 }
2456
2457 /*
2458 * Artificial requirement for block-group-tree to force newer features
2459 * (free-space-tree, no-holes) so the test matrix is smaller.
2460 */
2461 if (btrfs_fs_compat_ro(fs_info, BLOCK_GROUP_TREE) &&
2462 (!btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID) ||
2463 !btrfs_fs_incompat(fs_info, NO_HOLES))) {
2464 btrfs_err(fs_info,
2465 "block-group-tree feature requires free-space-tree and no-holes");
2466 ret = -EINVAL;
2467 }
2468
2469 /*
2470 * Hint to catch really bogus numbers, bitflips or so, more exact checks are
2471 * done later
2472 */
2473 if (btrfs_super_bytes_used(sb) < 6 * btrfs_super_nodesize(sb)) {
2474 btrfs_err(fs_info, "bytes_used is too small %llu",
2475 btrfs_super_bytes_used(sb));
2476 ret = -EINVAL;
2477 }
2478 if (!is_power_of_2(btrfs_super_stripesize(sb))) {
2479 btrfs_err(fs_info, "invalid stripesize %u",
2480 btrfs_super_stripesize(sb));
2481 ret = -EINVAL;
2482 }
2483 if (btrfs_super_num_devices(sb) > (1UL << 31))
2484 btrfs_warn(fs_info, "suspicious number of devices: %llu",
2485 btrfs_super_num_devices(sb));
2486 if (btrfs_super_num_devices(sb) == 0) {
2487 btrfs_err(fs_info, "number of devices is 0");
2488 ret = -EINVAL;
2489 }
2490
2491 if (mirror_num >= 0 &&
2492 btrfs_super_bytenr(sb) != btrfs_sb_offset(mirror_num)) {
2493 btrfs_err(fs_info, "super offset mismatch %llu != %u",
2494 btrfs_super_bytenr(sb), BTRFS_SUPER_INFO_OFFSET);
2495 ret = -EINVAL;
2496 }
2497
2498 /*
2499 * Obvious sys_chunk_array corruptions, it must hold at least one key
2500 * and one chunk
2501 */
2502 if (btrfs_super_sys_array_size(sb) > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) {
2503 btrfs_err(fs_info, "system chunk array too big %u > %u",
2504 btrfs_super_sys_array_size(sb),
2505 BTRFS_SYSTEM_CHUNK_ARRAY_SIZE);
2506 ret = -EINVAL;
2507 }
2508 if (btrfs_super_sys_array_size(sb) < sizeof(struct btrfs_disk_key)
2509 + sizeof(struct btrfs_chunk)) {
2510 btrfs_err(fs_info, "system chunk array too small %u < %zu",
2511 btrfs_super_sys_array_size(sb),
2512 sizeof(struct btrfs_disk_key)
2513 + sizeof(struct btrfs_chunk));
2514 ret = -EINVAL;
2515 }
2516
2517 /*
2518 * The generation is a global counter, we'll trust it more than the others
2519 * but it's still possible that it's the one that's wrong.
2520 */
2521 if (btrfs_super_generation(sb) < btrfs_super_chunk_root_generation(sb))
2522 btrfs_warn(fs_info,
2523 "suspicious: generation < chunk_root_generation: %llu < %llu",
2524 btrfs_super_generation(sb),
2525 btrfs_super_chunk_root_generation(sb));
2526 if (btrfs_super_generation(sb) < btrfs_super_cache_generation(sb)
2527 && btrfs_super_cache_generation(sb) != (u64)-1)
2528 btrfs_warn(fs_info,
2529 "suspicious: generation < cache_generation: %llu < %llu",
2530 btrfs_super_generation(sb),
2531 btrfs_super_cache_generation(sb));
2532
2533 return ret;
2534}
2535
2536/*
2537 * Validation of super block at mount time.
2538 * Some checks already done early at mount time, like csum type and incompat
2539 * flags will be skipped.
2540 */
2541static int btrfs_validate_mount_super(struct btrfs_fs_info *fs_info)
2542{
2543 return btrfs_validate_super(fs_info, fs_info->super_copy, 0);
2544}
2545
2546/*
2547 * Validation of super block at write time.
2548 * Some checks like bytenr check will be skipped as their values will be
2549 * overwritten soon.
2550 * Extra checks like csum type and incompat flags will be done here.
2551 */
2552static int btrfs_validate_write_super(struct btrfs_fs_info *fs_info,
2553 struct btrfs_super_block *sb)
2554{
2555 int ret;
2556
2557 ret = btrfs_validate_super(fs_info, sb, -1);
2558 if (ret < 0)
2559 goto out;
2560 if (!btrfs_supported_super_csum(btrfs_super_csum_type(sb))) {
2561 ret = -EUCLEAN;
2562 btrfs_err(fs_info, "invalid csum type, has %u want %u",
2563 btrfs_super_csum_type(sb), BTRFS_CSUM_TYPE_CRC32);
2564 goto out;
2565 }
2566 if (btrfs_super_incompat_flags(sb) & ~BTRFS_FEATURE_INCOMPAT_SUPP) {
2567 ret = -EUCLEAN;
2568 btrfs_err(fs_info,
2569 "invalid incompat flags, has 0x%llx valid mask 0x%llx",
2570 btrfs_super_incompat_flags(sb),
2571 (unsigned long long)BTRFS_FEATURE_INCOMPAT_SUPP);
2572 goto out;
2573 }
2574out:
2575 if (ret < 0)
2576 btrfs_err(fs_info,
2577 "super block corruption detected before writing it to disk");
2578 return ret;
2579}
2580
2581static int load_super_root(struct btrfs_root *root, u64 bytenr, u64 gen, int level)
2582{
2583 struct btrfs_tree_parent_check check = {
2584 .level = level,
2585 .transid = gen,
2586 .owner_root = btrfs_root_id(root)
2587 };
2588 int ret = 0;
2589
2590 root->node = read_tree_block(root->fs_info, bytenr, &check);
2591 if (IS_ERR(root->node)) {
2592 ret = PTR_ERR(root->node);
2593 root->node = NULL;
2594 return ret;
2595 }
2596 if (!extent_buffer_uptodate(root->node)) {
2597 free_extent_buffer(root->node);
2598 root->node = NULL;
2599 return -EIO;
2600 }
2601
2602 btrfs_set_root_node(&root->root_item, root->node);
2603 root->commit_root = btrfs_root_node(root);
2604 btrfs_set_root_refs(&root->root_item, 1);
2605 return ret;
2606}
2607
2608static int load_important_roots(struct btrfs_fs_info *fs_info)
2609{
2610 struct btrfs_super_block *sb = fs_info->super_copy;
2611 u64 gen, bytenr;
2612 int level, ret;
2613
2614 bytenr = btrfs_super_root(sb);
2615 gen = btrfs_super_generation(sb);
2616 level = btrfs_super_root_level(sb);
2617 ret = load_super_root(fs_info->tree_root, bytenr, gen, level);
2618 if (ret) {
2619 btrfs_warn(fs_info, "couldn't read tree root");
2620 return ret;
2621 }
2622 return 0;
2623}
2624
2625static int __cold init_tree_roots(struct btrfs_fs_info *fs_info)
2626{
2627 int backup_index = find_newest_super_backup(fs_info);
2628 struct btrfs_super_block *sb = fs_info->super_copy;
2629 struct btrfs_root *tree_root = fs_info->tree_root;
2630 bool handle_error = false;
2631 int ret = 0;
2632 int i;
2633
2634 for (i = 0; i < BTRFS_NUM_BACKUP_ROOTS; i++) {
2635 if (handle_error) {
2636 if (!IS_ERR(tree_root->node))
2637 free_extent_buffer(tree_root->node);
2638 tree_root->node = NULL;
2639
2640 if (!btrfs_test_opt(fs_info, USEBACKUPROOT))
2641 break;
2642
2643 free_root_pointers(fs_info, 0);
2644
2645 /*
2646 * Don't use the log in recovery mode, it won't be
2647 * valid
2648 */
2649 btrfs_set_super_log_root(sb, 0);
2650
2651 btrfs_warn(fs_info, "try to load backup roots slot %d", i);
2652 ret = read_backup_root(fs_info, i);
2653 backup_index = ret;
2654 if (ret < 0)
2655 return ret;
2656 }
2657
2658 ret = load_important_roots(fs_info);
2659 if (ret) {
2660 handle_error = true;
2661 continue;
2662 }
2663
2664 /*
2665 * No need to hold btrfs_root::objectid_mutex since the fs
2666 * hasn't been fully initialised and we are the only user
2667 */
2668 ret = btrfs_init_root_free_objectid(tree_root);
2669 if (ret < 0) {
2670 handle_error = true;
2671 continue;
2672 }
2673
2674 ASSERT(tree_root->free_objectid <= BTRFS_LAST_FREE_OBJECTID);
2675
2676 ret = btrfs_read_roots(fs_info);
2677 if (ret < 0) {
2678 handle_error = true;
2679 continue;
2680 }
2681
2682 /* All successful */
2683 fs_info->generation = btrfs_header_generation(tree_root->node);
2684 btrfs_set_last_trans_committed(fs_info, fs_info->generation);
2685 fs_info->last_reloc_trans = 0;
2686
2687 /* Always begin writing backup roots after the one being used */
2688 if (backup_index < 0) {
2689 fs_info->backup_root_index = 0;
2690 } else {
2691 fs_info->backup_root_index = backup_index + 1;
2692 fs_info->backup_root_index %= BTRFS_NUM_BACKUP_ROOTS;
2693 }
2694 break;
2695 }
2696
2697 return ret;
2698}
2699
2700void btrfs_init_fs_info(struct btrfs_fs_info *fs_info)
2701{
2702 INIT_RADIX_TREE(&fs_info->fs_roots_radix, GFP_ATOMIC);
2703 INIT_RADIX_TREE(&fs_info->buffer_radix, GFP_ATOMIC);
2704 INIT_LIST_HEAD(&fs_info->trans_list);
2705 INIT_LIST_HEAD(&fs_info->dead_roots);
2706 INIT_LIST_HEAD(&fs_info->delayed_iputs);
2707 INIT_LIST_HEAD(&fs_info->delalloc_roots);
2708 INIT_LIST_HEAD(&fs_info->caching_block_groups);
2709 spin_lock_init(&fs_info->delalloc_root_lock);
2710 spin_lock_init(&fs_info->trans_lock);
2711 spin_lock_init(&fs_info->fs_roots_radix_lock);
2712 spin_lock_init(&fs_info->delayed_iput_lock);
2713 spin_lock_init(&fs_info->defrag_inodes_lock);
2714 spin_lock_init(&fs_info->super_lock);
2715 spin_lock_init(&fs_info->buffer_lock);
2716 spin_lock_init(&fs_info->unused_bgs_lock);
2717 spin_lock_init(&fs_info->treelog_bg_lock);
2718 spin_lock_init(&fs_info->zone_active_bgs_lock);
2719 spin_lock_init(&fs_info->relocation_bg_lock);
2720 rwlock_init(&fs_info->tree_mod_log_lock);
2721 rwlock_init(&fs_info->global_root_lock);
2722 mutex_init(&fs_info->unused_bg_unpin_mutex);
2723 mutex_init(&fs_info->reclaim_bgs_lock);
2724 mutex_init(&fs_info->reloc_mutex);
2725 mutex_init(&fs_info->delalloc_root_mutex);
2726 mutex_init(&fs_info->zoned_meta_io_lock);
2727 mutex_init(&fs_info->zoned_data_reloc_io_lock);
2728 seqlock_init(&fs_info->profiles_lock);
2729
2730 btrfs_lockdep_init_map(fs_info, btrfs_trans_num_writers);
2731 btrfs_lockdep_init_map(fs_info, btrfs_trans_num_extwriters);
2732 btrfs_lockdep_init_map(fs_info, btrfs_trans_pending_ordered);
2733 btrfs_lockdep_init_map(fs_info, btrfs_ordered_extent);
2734 btrfs_state_lockdep_init_map(fs_info, btrfs_trans_commit_prep,
2735 BTRFS_LOCKDEP_TRANS_COMMIT_PREP);
2736 btrfs_state_lockdep_init_map(fs_info, btrfs_trans_unblocked,
2737 BTRFS_LOCKDEP_TRANS_UNBLOCKED);
2738 btrfs_state_lockdep_init_map(fs_info, btrfs_trans_super_committed,
2739 BTRFS_LOCKDEP_TRANS_SUPER_COMMITTED);
2740 btrfs_state_lockdep_init_map(fs_info, btrfs_trans_completed,
2741 BTRFS_LOCKDEP_TRANS_COMPLETED);
2742
2743 INIT_LIST_HEAD(&fs_info->dirty_cowonly_roots);
2744 INIT_LIST_HEAD(&fs_info->space_info);
2745 INIT_LIST_HEAD(&fs_info->tree_mod_seq_list);
2746 INIT_LIST_HEAD(&fs_info->unused_bgs);
2747 INIT_LIST_HEAD(&fs_info->reclaim_bgs);
2748 INIT_LIST_HEAD(&fs_info->zone_active_bgs);
2749#ifdef CONFIG_BTRFS_DEBUG
2750 INIT_LIST_HEAD(&fs_info->allocated_roots);
2751 INIT_LIST_HEAD(&fs_info->allocated_ebs);
2752 spin_lock_init(&fs_info->eb_leak_lock);
2753#endif
2754 fs_info->mapping_tree = RB_ROOT_CACHED;
2755 rwlock_init(&fs_info->mapping_tree_lock);
2756 btrfs_init_block_rsv(&fs_info->global_block_rsv,
2757 BTRFS_BLOCK_RSV_GLOBAL);
2758 btrfs_init_block_rsv(&fs_info->trans_block_rsv, BTRFS_BLOCK_RSV_TRANS);
2759 btrfs_init_block_rsv(&fs_info->chunk_block_rsv, BTRFS_BLOCK_RSV_CHUNK);
2760 btrfs_init_block_rsv(&fs_info->empty_block_rsv, BTRFS_BLOCK_RSV_EMPTY);
2761 btrfs_init_block_rsv(&fs_info->delayed_block_rsv,
2762 BTRFS_BLOCK_RSV_DELOPS);
2763 btrfs_init_block_rsv(&fs_info->delayed_refs_rsv,
2764 BTRFS_BLOCK_RSV_DELREFS);
2765
2766 atomic_set(&fs_info->async_delalloc_pages, 0);
2767 atomic_set(&fs_info->defrag_running, 0);
2768 atomic_set(&fs_info->nr_delayed_iputs, 0);
2769 atomic64_set(&fs_info->tree_mod_seq, 0);
2770 fs_info->global_root_tree = RB_ROOT;
2771 fs_info->max_inline = BTRFS_DEFAULT_MAX_INLINE;
2772 fs_info->metadata_ratio = 0;
2773 fs_info->defrag_inodes = RB_ROOT;
2774 atomic64_set(&fs_info->free_chunk_space, 0);
2775 fs_info->tree_mod_log = RB_ROOT;
2776 fs_info->commit_interval = BTRFS_DEFAULT_COMMIT_INTERVAL;
2777 btrfs_init_ref_verify(fs_info);
2778
2779 fs_info->thread_pool_size = min_t(unsigned long,
2780 num_online_cpus() + 2, 8);
2781
2782 INIT_LIST_HEAD(&fs_info->ordered_roots);
2783 spin_lock_init(&fs_info->ordered_root_lock);
2784
2785 btrfs_init_scrub(fs_info);
2786 btrfs_init_balance(fs_info);
2787 btrfs_init_async_reclaim_work(fs_info);
2788 btrfs_init_extent_map_shrinker_work(fs_info);
2789
2790 rwlock_init(&fs_info->block_group_cache_lock);
2791 fs_info->block_group_cache_tree = RB_ROOT_CACHED;
2792
2793 extent_io_tree_init(fs_info, &fs_info->excluded_extents,
2794 IO_TREE_FS_EXCLUDED_EXTENTS);
2795
2796 mutex_init(&fs_info->ordered_operations_mutex);
2797 mutex_init(&fs_info->tree_log_mutex);
2798 mutex_init(&fs_info->chunk_mutex);
2799 mutex_init(&fs_info->transaction_kthread_mutex);
2800 mutex_init(&fs_info->cleaner_mutex);
2801 mutex_init(&fs_info->ro_block_group_mutex);
2802 init_rwsem(&fs_info->commit_root_sem);
2803 init_rwsem(&fs_info->cleanup_work_sem);
2804 init_rwsem(&fs_info->subvol_sem);
2805 sema_init(&fs_info->uuid_tree_rescan_sem, 1);
2806
2807 btrfs_init_dev_replace_locks(fs_info);
2808 btrfs_init_qgroup(fs_info);
2809 btrfs_discard_init(fs_info);
2810
2811 btrfs_init_free_cluster(&fs_info->meta_alloc_cluster);
2812 btrfs_init_free_cluster(&fs_info->data_alloc_cluster);
2813
2814 init_waitqueue_head(&fs_info->transaction_throttle);
2815 init_waitqueue_head(&fs_info->transaction_wait);
2816 init_waitqueue_head(&fs_info->transaction_blocked_wait);
2817 init_waitqueue_head(&fs_info->async_submit_wait);
2818 init_waitqueue_head(&fs_info->delayed_iputs_wait);
2819
2820 /* Usable values until the real ones are cached from the superblock */
2821 fs_info->nodesize = 4096;
2822 fs_info->sectorsize = 4096;
2823 fs_info->sectorsize_bits = ilog2(4096);
2824 fs_info->stripesize = 4096;
2825
2826 /* Default compress algorithm when user does -o compress */
2827 fs_info->compress_type = BTRFS_COMPRESS_ZLIB;
2828
2829 fs_info->max_extent_size = BTRFS_MAX_EXTENT_SIZE;
2830
2831 spin_lock_init(&fs_info->swapfile_pins_lock);
2832 fs_info->swapfile_pins = RB_ROOT;
2833
2834 fs_info->bg_reclaim_threshold = BTRFS_DEFAULT_RECLAIM_THRESH;
2835 INIT_WORK(&fs_info->reclaim_bgs_work, btrfs_reclaim_bgs_work);
2836}
2837
2838static int init_mount_fs_info(struct btrfs_fs_info *fs_info, struct super_block *sb)
2839{
2840 int ret;
2841
2842 fs_info->sb = sb;
2843 /* Temporary fixed values for block size until we read the superblock. */
2844 sb->s_blocksize = BTRFS_BDEV_BLOCKSIZE;
2845 sb->s_blocksize_bits = blksize_bits(BTRFS_BDEV_BLOCKSIZE);
2846
2847 ret = percpu_counter_init(&fs_info->ordered_bytes, 0, GFP_KERNEL);
2848 if (ret)
2849 return ret;
2850
2851 ret = percpu_counter_init(&fs_info->evictable_extent_maps, 0, GFP_KERNEL);
2852 if (ret)
2853 return ret;
2854
2855 ret = percpu_counter_init(&fs_info->dirty_metadata_bytes, 0, GFP_KERNEL);
2856 if (ret)
2857 return ret;
2858
2859 fs_info->dirty_metadata_batch = PAGE_SIZE *
2860 (1 + ilog2(nr_cpu_ids));
2861
2862 ret = percpu_counter_init(&fs_info->delalloc_bytes, 0, GFP_KERNEL);
2863 if (ret)
2864 return ret;
2865
2866 ret = percpu_counter_init(&fs_info->dev_replace.bio_counter, 0,
2867 GFP_KERNEL);
2868 if (ret)
2869 return ret;
2870
2871 fs_info->delayed_root = kmalloc(sizeof(struct btrfs_delayed_root),
2872 GFP_KERNEL);
2873 if (!fs_info->delayed_root)
2874 return -ENOMEM;
2875 btrfs_init_delayed_root(fs_info->delayed_root);
2876
2877 if (sb_rdonly(sb))
2878 set_bit(BTRFS_FS_STATE_RO, &fs_info->fs_state);
2879 if (btrfs_test_opt(fs_info, IGNOREMETACSUMS))
2880 set_bit(BTRFS_FS_STATE_SKIP_META_CSUMS, &fs_info->fs_state);
2881
2882 return btrfs_alloc_stripe_hash_table(fs_info);
2883}
2884
2885static int btrfs_uuid_rescan_kthread(void *data)
2886{
2887 struct btrfs_fs_info *fs_info = data;
2888 int ret;
2889
2890 /*
2891 * 1st step is to iterate through the existing UUID tree and
2892 * to delete all entries that contain outdated data.
2893 * 2nd step is to add all missing entries to the UUID tree.
2894 */
2895 ret = btrfs_uuid_tree_iterate(fs_info);
2896 if (ret < 0) {
2897 if (ret != -EINTR)
2898 btrfs_warn(fs_info, "iterating uuid_tree failed %d",
2899 ret);
2900 up(&fs_info->uuid_tree_rescan_sem);
2901 return ret;
2902 }
2903 return btrfs_uuid_scan_kthread(data);
2904}
2905
2906static int btrfs_check_uuid_tree(struct btrfs_fs_info *fs_info)
2907{
2908 struct task_struct *task;
2909
2910 down(&fs_info->uuid_tree_rescan_sem);
2911 task = kthread_run(btrfs_uuid_rescan_kthread, fs_info, "btrfs-uuid");
2912 if (IS_ERR(task)) {
2913 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
2914 btrfs_warn(fs_info, "failed to start uuid_rescan task");
2915 up(&fs_info->uuid_tree_rescan_sem);
2916 return PTR_ERR(task);
2917 }
2918
2919 return 0;
2920}
2921
2922static int btrfs_cleanup_fs_roots(struct btrfs_fs_info *fs_info)
2923{
2924 u64 root_objectid = 0;
2925 struct btrfs_root *gang[8];
2926 int ret = 0;
2927
2928 while (1) {
2929 unsigned int found;
2930
2931 spin_lock(&fs_info->fs_roots_radix_lock);
2932 found = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
2933 (void **)gang, root_objectid,
2934 ARRAY_SIZE(gang));
2935 if (!found) {
2936 spin_unlock(&fs_info->fs_roots_radix_lock);
2937 break;
2938 }
2939 root_objectid = btrfs_root_id(gang[found - 1]) + 1;
2940
2941 for (int i = 0; i < found; i++) {
2942 /* Avoid to grab roots in dead_roots. */
2943 if (btrfs_root_refs(&gang[i]->root_item) == 0) {
2944 gang[i] = NULL;
2945 continue;
2946 }
2947 /* Grab all the search result for later use. */
2948 gang[i] = btrfs_grab_root(gang[i]);
2949 }
2950 spin_unlock(&fs_info->fs_roots_radix_lock);
2951
2952 for (int i = 0; i < found; i++) {
2953 if (!gang[i])
2954 continue;
2955 root_objectid = btrfs_root_id(gang[i]);
2956 /*
2957 * Continue to release the remaining roots after the first
2958 * error without cleanup and preserve the first error
2959 * for the return.
2960 */
2961 if (!ret)
2962 ret = btrfs_orphan_cleanup(gang[i]);
2963 btrfs_put_root(gang[i]);
2964 }
2965 if (ret)
2966 break;
2967
2968 root_objectid++;
2969 }
2970 return ret;
2971}
2972
2973/*
2974 * Mounting logic specific to read-write file systems. Shared by open_ctree
2975 * and btrfs_remount when remounting from read-only to read-write.
2976 */
2977int btrfs_start_pre_rw_mount(struct btrfs_fs_info *fs_info)
2978{
2979 int ret;
2980 const bool cache_opt = btrfs_test_opt(fs_info, SPACE_CACHE);
2981 bool rebuild_free_space_tree = false;
2982
2983 if (btrfs_test_opt(fs_info, CLEAR_CACHE) &&
2984 btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) {
2985 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2))
2986 btrfs_warn(fs_info,
2987 "'clear_cache' option is ignored with extent tree v2");
2988 else
2989 rebuild_free_space_tree = true;
2990 } else if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE) &&
2991 !btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE_VALID)) {
2992 btrfs_warn(fs_info, "free space tree is invalid");
2993 rebuild_free_space_tree = true;
2994 }
2995
2996 if (rebuild_free_space_tree) {
2997 btrfs_info(fs_info, "rebuilding free space tree");
2998 ret = btrfs_rebuild_free_space_tree(fs_info);
2999 if (ret) {
3000 btrfs_warn(fs_info,
3001 "failed to rebuild free space tree: %d", ret);
3002 goto out;
3003 }
3004 }
3005
3006 if (btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE) &&
3007 !btrfs_test_opt(fs_info, FREE_SPACE_TREE)) {
3008 btrfs_info(fs_info, "disabling free space tree");
3009 ret = btrfs_delete_free_space_tree(fs_info);
3010 if (ret) {
3011 btrfs_warn(fs_info,
3012 "failed to disable free space tree: %d", ret);
3013 goto out;
3014 }
3015 }
3016
3017 /*
3018 * btrfs_find_orphan_roots() is responsible for finding all the dead
3019 * roots (with 0 refs), flag them with BTRFS_ROOT_DEAD_TREE and load
3020 * them into the fs_info->fs_roots_radix tree. This must be done before
3021 * calling btrfs_orphan_cleanup() on the tree root. If we don't do it
3022 * first, then btrfs_orphan_cleanup() will delete a dead root's orphan
3023 * item before the root's tree is deleted - this means that if we unmount
3024 * or crash before the deletion completes, on the next mount we will not
3025 * delete what remains of the tree because the orphan item does not
3026 * exists anymore, which is what tells us we have a pending deletion.
3027 */
3028 ret = btrfs_find_orphan_roots(fs_info);
3029 if (ret)
3030 goto out;
3031
3032 ret = btrfs_cleanup_fs_roots(fs_info);
3033 if (ret)
3034 goto out;
3035
3036 down_read(&fs_info->cleanup_work_sem);
3037 if ((ret = btrfs_orphan_cleanup(fs_info->fs_root)) ||
3038 (ret = btrfs_orphan_cleanup(fs_info->tree_root))) {
3039 up_read(&fs_info->cleanup_work_sem);
3040 goto out;
3041 }
3042 up_read(&fs_info->cleanup_work_sem);
3043
3044 mutex_lock(&fs_info->cleaner_mutex);
3045 ret = btrfs_recover_relocation(fs_info);
3046 mutex_unlock(&fs_info->cleaner_mutex);
3047 if (ret < 0) {
3048 btrfs_warn(fs_info, "failed to recover relocation: %d", ret);
3049 goto out;
3050 }
3051
3052 if (btrfs_test_opt(fs_info, FREE_SPACE_TREE) &&
3053 !btrfs_fs_compat_ro(fs_info, FREE_SPACE_TREE)) {
3054 btrfs_info(fs_info, "creating free space tree");
3055 ret = btrfs_create_free_space_tree(fs_info);
3056 if (ret) {
3057 btrfs_warn(fs_info,
3058 "failed to create free space tree: %d", ret);
3059 goto out;
3060 }
3061 }
3062
3063 if (cache_opt != btrfs_free_space_cache_v1_active(fs_info)) {
3064 ret = btrfs_set_free_space_cache_v1_active(fs_info, cache_opt);
3065 if (ret)
3066 goto out;
3067 }
3068
3069 ret = btrfs_resume_balance_async(fs_info);
3070 if (ret)
3071 goto out;
3072
3073 ret = btrfs_resume_dev_replace_async(fs_info);
3074 if (ret) {
3075 btrfs_warn(fs_info, "failed to resume dev_replace");
3076 goto out;
3077 }
3078
3079 btrfs_qgroup_rescan_resume(fs_info);
3080
3081 if (!fs_info->uuid_root) {
3082 btrfs_info(fs_info, "creating UUID tree");
3083 ret = btrfs_create_uuid_tree(fs_info);
3084 if (ret) {
3085 btrfs_warn(fs_info,
3086 "failed to create the UUID tree %d", ret);
3087 goto out;
3088 }
3089 }
3090
3091out:
3092 return ret;
3093}
3094
3095/*
3096 * Do various sanity and dependency checks of different features.
3097 *
3098 * @is_rw_mount: If the mount is read-write.
3099 *
3100 * This is the place for less strict checks (like for subpage or artificial
3101 * feature dependencies).
3102 *
3103 * For strict checks or possible corruption detection, see
3104 * btrfs_validate_super().
3105 *
3106 * This should be called after btrfs_parse_options(), as some mount options
3107 * (space cache related) can modify on-disk format like free space tree and
3108 * screw up certain feature dependencies.
3109 */
3110int btrfs_check_features(struct btrfs_fs_info *fs_info, bool is_rw_mount)
3111{
3112 struct btrfs_super_block *disk_super = fs_info->super_copy;
3113 u64 incompat = btrfs_super_incompat_flags(disk_super);
3114 const u64 compat_ro = btrfs_super_compat_ro_flags(disk_super);
3115 const u64 compat_ro_unsupp = (compat_ro & ~BTRFS_FEATURE_COMPAT_RO_SUPP);
3116
3117 if (incompat & ~BTRFS_FEATURE_INCOMPAT_SUPP) {
3118 btrfs_err(fs_info,
3119 "cannot mount because of unknown incompat features (0x%llx)",
3120 incompat);
3121 return -EINVAL;
3122 }
3123
3124 /* Runtime limitation for mixed block groups. */
3125 if ((incompat & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS) &&
3126 (fs_info->sectorsize != fs_info->nodesize)) {
3127 btrfs_err(fs_info,
3128"unequal nodesize/sectorsize (%u != %u) are not allowed for mixed block groups",
3129 fs_info->nodesize, fs_info->sectorsize);
3130 return -EINVAL;
3131 }
3132
3133 /* Mixed backref is an always-enabled feature. */
3134 incompat |= BTRFS_FEATURE_INCOMPAT_MIXED_BACKREF;
3135
3136 /* Set compression related flags just in case. */
3137 if (fs_info->compress_type == BTRFS_COMPRESS_LZO)
3138 incompat |= BTRFS_FEATURE_INCOMPAT_COMPRESS_LZO;
3139 else if (fs_info->compress_type == BTRFS_COMPRESS_ZSTD)
3140 incompat |= BTRFS_FEATURE_INCOMPAT_COMPRESS_ZSTD;
3141
3142 /*
3143 * An ancient flag, which should really be marked deprecated.
3144 * Such runtime limitation doesn't really need a incompat flag.
3145 */
3146 if (btrfs_super_nodesize(disk_super) > PAGE_SIZE)
3147 incompat |= BTRFS_FEATURE_INCOMPAT_BIG_METADATA;
3148
3149 if (compat_ro_unsupp && is_rw_mount) {
3150 btrfs_err(fs_info,
3151 "cannot mount read-write because of unknown compat_ro features (0x%llx)",
3152 compat_ro);
3153 return -EINVAL;
3154 }
3155
3156 /*
3157 * We have unsupported RO compat features, although RO mounted, we
3158 * should not cause any metadata writes, including log replay.
3159 * Or we could screw up whatever the new feature requires.
3160 */
3161 if (compat_ro_unsupp && btrfs_super_log_root(disk_super) &&
3162 !btrfs_test_opt(fs_info, NOLOGREPLAY)) {
3163 btrfs_err(fs_info,
3164"cannot replay dirty log with unsupported compat_ro features (0x%llx), try rescue=nologreplay",
3165 compat_ro);
3166 return -EINVAL;
3167 }
3168
3169 /*
3170 * Artificial limitations for block group tree, to force
3171 * block-group-tree to rely on no-holes and free-space-tree.
3172 */
3173 if (btrfs_fs_compat_ro(fs_info, BLOCK_GROUP_TREE) &&
3174 (!btrfs_fs_incompat(fs_info, NO_HOLES) ||
3175 !btrfs_test_opt(fs_info, FREE_SPACE_TREE))) {
3176 btrfs_err(fs_info,
3177"block-group-tree feature requires no-holes and free-space-tree features");
3178 return -EINVAL;
3179 }
3180
3181 /*
3182 * Subpage runtime limitation on v1 cache.
3183 *
3184 * V1 space cache still has some hard codeed PAGE_SIZE usage, while
3185 * we're already defaulting to v2 cache, no need to bother v1 as it's
3186 * going to be deprecated anyway.
3187 */
3188 if (fs_info->sectorsize < PAGE_SIZE && btrfs_test_opt(fs_info, SPACE_CACHE)) {
3189 btrfs_warn(fs_info,
3190 "v1 space cache is not supported for page size %lu with sectorsize %u",
3191 PAGE_SIZE, fs_info->sectorsize);
3192 return -EINVAL;
3193 }
3194
3195 /* This can be called by remount, we need to protect the super block. */
3196 spin_lock(&fs_info->super_lock);
3197 btrfs_set_super_incompat_flags(disk_super, incompat);
3198 spin_unlock(&fs_info->super_lock);
3199
3200 return 0;
3201}
3202
3203int __cold open_ctree(struct super_block *sb, struct btrfs_fs_devices *fs_devices)
3204{
3205 u32 sectorsize;
3206 u32 nodesize;
3207 u32 stripesize;
3208 u64 generation;
3209 u16 csum_type;
3210 struct btrfs_super_block *disk_super;
3211 struct btrfs_fs_info *fs_info = btrfs_sb(sb);
3212 struct btrfs_root *tree_root;
3213 struct btrfs_root *chunk_root;
3214 int ret;
3215 int level;
3216
3217 ret = init_mount_fs_info(fs_info, sb);
3218 if (ret)
3219 goto fail;
3220
3221 /* These need to be init'ed before we start creating inodes and such. */
3222 tree_root = btrfs_alloc_root(fs_info, BTRFS_ROOT_TREE_OBJECTID,
3223 GFP_KERNEL);
3224 fs_info->tree_root = tree_root;
3225 chunk_root = btrfs_alloc_root(fs_info, BTRFS_CHUNK_TREE_OBJECTID,
3226 GFP_KERNEL);
3227 fs_info->chunk_root = chunk_root;
3228 if (!tree_root || !chunk_root) {
3229 ret = -ENOMEM;
3230 goto fail;
3231 }
3232
3233 ret = btrfs_init_btree_inode(sb);
3234 if (ret)
3235 goto fail;
3236
3237 invalidate_bdev(fs_devices->latest_dev->bdev);
3238
3239 /*
3240 * Read super block and check the signature bytes only
3241 */
3242 disk_super = btrfs_read_dev_super(fs_devices->latest_dev->bdev);
3243 if (IS_ERR(disk_super)) {
3244 ret = PTR_ERR(disk_super);
3245 goto fail_alloc;
3246 }
3247
3248 btrfs_info(fs_info, "first mount of filesystem %pU", disk_super->fsid);
3249 /*
3250 * Verify the type first, if that or the checksum value are
3251 * corrupted, we'll find out
3252 */
3253 csum_type = btrfs_super_csum_type(disk_super);
3254 if (!btrfs_supported_super_csum(csum_type)) {
3255 btrfs_err(fs_info, "unsupported checksum algorithm: %u",
3256 csum_type);
3257 ret = -EINVAL;
3258 btrfs_release_disk_super(disk_super);
3259 goto fail_alloc;
3260 }
3261
3262 fs_info->csum_size = btrfs_super_csum_size(disk_super);
3263
3264 ret = btrfs_init_csum_hash(fs_info, csum_type);
3265 if (ret) {
3266 btrfs_release_disk_super(disk_super);
3267 goto fail_alloc;
3268 }
3269
3270 /*
3271 * We want to check superblock checksum, the type is stored inside.
3272 * Pass the whole disk block of size BTRFS_SUPER_INFO_SIZE (4k).
3273 */
3274 if (btrfs_check_super_csum(fs_info, disk_super)) {
3275 btrfs_err(fs_info, "superblock checksum mismatch");
3276 ret = -EINVAL;
3277 btrfs_release_disk_super(disk_super);
3278 goto fail_alloc;
3279 }
3280
3281 /*
3282 * super_copy is zeroed at allocation time and we never touch the
3283 * following bytes up to INFO_SIZE, the checksum is calculated from
3284 * the whole block of INFO_SIZE
3285 */
3286 memcpy(fs_info->super_copy, disk_super, sizeof(*fs_info->super_copy));
3287 btrfs_release_disk_super(disk_super);
3288
3289 disk_super = fs_info->super_copy;
3290
3291 memcpy(fs_info->super_for_commit, fs_info->super_copy,
3292 sizeof(*fs_info->super_for_commit));
3293
3294 ret = btrfs_validate_mount_super(fs_info);
3295 if (ret) {
3296 btrfs_err(fs_info, "superblock contains fatal errors");
3297 ret = -EINVAL;
3298 goto fail_alloc;
3299 }
3300
3301 if (!btrfs_super_root(disk_super)) {
3302 btrfs_err(fs_info, "invalid superblock tree root bytenr");
3303 ret = -EINVAL;
3304 goto fail_alloc;
3305 }
3306
3307 /* check FS state, whether FS is broken. */
3308 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_ERROR)
3309 WRITE_ONCE(fs_info->fs_error, -EUCLEAN);
3310
3311 /* Set up fs_info before parsing mount options */
3312 nodesize = btrfs_super_nodesize(disk_super);
3313 sectorsize = btrfs_super_sectorsize(disk_super);
3314 stripesize = sectorsize;
3315 fs_info->dirty_metadata_batch = nodesize * (1 + ilog2(nr_cpu_ids));
3316 fs_info->delalloc_batch = sectorsize * 512 * (1 + ilog2(nr_cpu_ids));
3317
3318 fs_info->nodesize = nodesize;
3319 fs_info->sectorsize = sectorsize;
3320 fs_info->sectorsize_bits = ilog2(sectorsize);
3321 fs_info->sectors_per_page = (PAGE_SIZE >> fs_info->sectorsize_bits);
3322 fs_info->csums_per_leaf = BTRFS_MAX_ITEM_SIZE(fs_info) / fs_info->csum_size;
3323 fs_info->stripesize = stripesize;
3324
3325 /*
3326 * Handle the space caching options appropriately now that we have the
3327 * super block loaded and validated.
3328 */
3329 btrfs_set_free_space_cache_settings(fs_info);
3330
3331 if (!btrfs_check_options(fs_info, &fs_info->mount_opt, sb->s_flags)) {
3332 ret = -EINVAL;
3333 goto fail_alloc;
3334 }
3335
3336 ret = btrfs_check_features(fs_info, !sb_rdonly(sb));
3337 if (ret < 0)
3338 goto fail_alloc;
3339
3340 /*
3341 * At this point our mount options are validated, if we set ->max_inline
3342 * to something non-standard make sure we truncate it to sectorsize.
3343 */
3344 fs_info->max_inline = min_t(u64, fs_info->max_inline, fs_info->sectorsize);
3345
3346 if (sectorsize < PAGE_SIZE)
3347 btrfs_warn(fs_info,
3348 "read-write for sector size %u with page size %lu is experimental",
3349 sectorsize, PAGE_SIZE);
3350
3351 ret = btrfs_init_workqueues(fs_info);
3352 if (ret)
3353 goto fail_sb_buffer;
3354
3355 sb->s_bdi->ra_pages *= btrfs_super_num_devices(disk_super);
3356 sb->s_bdi->ra_pages = max(sb->s_bdi->ra_pages, SZ_4M / PAGE_SIZE);
3357
3358 /* Update the values for the current filesystem. */
3359 sb->s_blocksize = sectorsize;
3360 sb->s_blocksize_bits = blksize_bits(sectorsize);
3361 memcpy(&sb->s_uuid, fs_info->fs_devices->fsid, BTRFS_FSID_SIZE);
3362
3363 mutex_lock(&fs_info->chunk_mutex);
3364 ret = btrfs_read_sys_array(fs_info);
3365 mutex_unlock(&fs_info->chunk_mutex);
3366 if (ret) {
3367 btrfs_err(fs_info, "failed to read the system array: %d", ret);
3368 goto fail_sb_buffer;
3369 }
3370
3371 generation = btrfs_super_chunk_root_generation(disk_super);
3372 level = btrfs_super_chunk_root_level(disk_super);
3373 ret = load_super_root(chunk_root, btrfs_super_chunk_root(disk_super),
3374 generation, level);
3375 if (ret) {
3376 btrfs_err(fs_info, "failed to read chunk root");
3377 goto fail_tree_roots;
3378 }
3379
3380 read_extent_buffer(chunk_root->node, fs_info->chunk_tree_uuid,
3381 offsetof(struct btrfs_header, chunk_tree_uuid),
3382 BTRFS_UUID_SIZE);
3383
3384 ret = btrfs_read_chunk_tree(fs_info);
3385 if (ret) {
3386 btrfs_err(fs_info, "failed to read chunk tree: %d", ret);
3387 goto fail_tree_roots;
3388 }
3389
3390 /*
3391 * At this point we know all the devices that make this filesystem,
3392 * including the seed devices but we don't know yet if the replace
3393 * target is required. So free devices that are not part of this
3394 * filesystem but skip the replace target device which is checked
3395 * below in btrfs_init_dev_replace().
3396 */
3397 btrfs_free_extra_devids(fs_devices);
3398 if (!fs_devices->latest_dev->bdev) {
3399 btrfs_err(fs_info, "failed to read devices");
3400 ret = -EIO;
3401 goto fail_tree_roots;
3402 }
3403
3404 ret = init_tree_roots(fs_info);
3405 if (ret)
3406 goto fail_tree_roots;
3407
3408 /*
3409 * Get zone type information of zoned block devices. This will also
3410 * handle emulation of a zoned filesystem if a regular device has the
3411 * zoned incompat feature flag set.
3412 */
3413 ret = btrfs_get_dev_zone_info_all_devices(fs_info);
3414 if (ret) {
3415 btrfs_err(fs_info,
3416 "zoned: failed to read device zone info: %d", ret);
3417 goto fail_block_groups;
3418 }
3419
3420 /*
3421 * If we have a uuid root and we're not being told to rescan we need to
3422 * check the generation here so we can set the
3423 * BTRFS_FS_UPDATE_UUID_TREE_GEN bit. Otherwise we could commit the
3424 * transaction during a balance or the log replay without updating the
3425 * uuid generation, and then if we crash we would rescan the uuid tree,
3426 * even though it was perfectly fine.
3427 */
3428 if (fs_info->uuid_root && !btrfs_test_opt(fs_info, RESCAN_UUID_TREE) &&
3429 fs_info->generation == btrfs_super_uuid_tree_generation(disk_super))
3430 set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags);
3431
3432 ret = btrfs_verify_dev_extents(fs_info);
3433 if (ret) {
3434 btrfs_err(fs_info,
3435 "failed to verify dev extents against chunks: %d",
3436 ret);
3437 goto fail_block_groups;
3438 }
3439 ret = btrfs_recover_balance(fs_info);
3440 if (ret) {
3441 btrfs_err(fs_info, "failed to recover balance: %d", ret);
3442 goto fail_block_groups;
3443 }
3444
3445 ret = btrfs_init_dev_stats(fs_info);
3446 if (ret) {
3447 btrfs_err(fs_info, "failed to init dev_stats: %d", ret);
3448 goto fail_block_groups;
3449 }
3450
3451 ret = btrfs_init_dev_replace(fs_info);
3452 if (ret) {
3453 btrfs_err(fs_info, "failed to init dev_replace: %d", ret);
3454 goto fail_block_groups;
3455 }
3456
3457 ret = btrfs_check_zoned_mode(fs_info);
3458 if (ret) {
3459 btrfs_err(fs_info, "failed to initialize zoned mode: %d",
3460 ret);
3461 goto fail_block_groups;
3462 }
3463
3464 ret = btrfs_sysfs_add_fsid(fs_devices);
3465 if (ret) {
3466 btrfs_err(fs_info, "failed to init sysfs fsid interface: %d",
3467 ret);
3468 goto fail_block_groups;
3469 }
3470
3471 ret = btrfs_sysfs_add_mounted(fs_info);
3472 if (ret) {
3473 btrfs_err(fs_info, "failed to init sysfs interface: %d", ret);
3474 goto fail_fsdev_sysfs;
3475 }
3476
3477 ret = btrfs_init_space_info(fs_info);
3478 if (ret) {
3479 btrfs_err(fs_info, "failed to initialize space info: %d", ret);
3480 goto fail_sysfs;
3481 }
3482
3483 ret = btrfs_read_block_groups(fs_info);
3484 if (ret) {
3485 btrfs_err(fs_info, "failed to read block groups: %d", ret);
3486 goto fail_sysfs;
3487 }
3488
3489 btrfs_free_zone_cache(fs_info);
3490
3491 btrfs_check_active_zone_reservation(fs_info);
3492
3493 if (!sb_rdonly(sb) && fs_info->fs_devices->missing_devices &&
3494 !btrfs_check_rw_degradable(fs_info, NULL)) {
3495 btrfs_warn(fs_info,
3496 "writable mount is not allowed due to too many missing devices");
3497 ret = -EINVAL;
3498 goto fail_sysfs;
3499 }
3500
3501 fs_info->cleaner_kthread = kthread_run(cleaner_kthread, fs_info,
3502 "btrfs-cleaner");
3503 if (IS_ERR(fs_info->cleaner_kthread)) {
3504 ret = PTR_ERR(fs_info->cleaner_kthread);
3505 goto fail_sysfs;
3506 }
3507
3508 fs_info->transaction_kthread = kthread_run(transaction_kthread,
3509 tree_root,
3510 "btrfs-transaction");
3511 if (IS_ERR(fs_info->transaction_kthread)) {
3512 ret = PTR_ERR(fs_info->transaction_kthread);
3513 goto fail_cleaner;
3514 }
3515
3516 ret = btrfs_read_qgroup_config(fs_info);
3517 if (ret)
3518 goto fail_trans_kthread;
3519
3520 if (btrfs_build_ref_tree(fs_info))
3521 btrfs_err(fs_info, "couldn't build ref tree");
3522
3523 /* do not make disk changes in broken FS or nologreplay is given */
3524 if (btrfs_super_log_root(disk_super) != 0 &&
3525 !btrfs_test_opt(fs_info, NOLOGREPLAY)) {
3526 btrfs_info(fs_info, "start tree-log replay");
3527 ret = btrfs_replay_log(fs_info, fs_devices);
3528 if (ret)
3529 goto fail_qgroup;
3530 }
3531
3532 fs_info->fs_root = btrfs_get_fs_root(fs_info, BTRFS_FS_TREE_OBJECTID, true);
3533 if (IS_ERR(fs_info->fs_root)) {
3534 ret = PTR_ERR(fs_info->fs_root);
3535 btrfs_warn(fs_info, "failed to read fs tree: %d", ret);
3536 fs_info->fs_root = NULL;
3537 goto fail_qgroup;
3538 }
3539
3540 if (sb_rdonly(sb))
3541 return 0;
3542
3543 ret = btrfs_start_pre_rw_mount(fs_info);
3544 if (ret) {
3545 close_ctree(fs_info);
3546 return ret;
3547 }
3548 btrfs_discard_resume(fs_info);
3549
3550 if (fs_info->uuid_root &&
3551 (btrfs_test_opt(fs_info, RESCAN_UUID_TREE) ||
3552 fs_info->generation != btrfs_super_uuid_tree_generation(disk_super))) {
3553 btrfs_info(fs_info, "checking UUID tree");
3554 ret = btrfs_check_uuid_tree(fs_info);
3555 if (ret) {
3556 btrfs_warn(fs_info,
3557 "failed to check the UUID tree: %d", ret);
3558 close_ctree(fs_info);
3559 return ret;
3560 }
3561 }
3562
3563 set_bit(BTRFS_FS_OPEN, &fs_info->flags);
3564
3565 /* Kick the cleaner thread so it'll start deleting snapshots. */
3566 if (test_bit(BTRFS_FS_UNFINISHED_DROPS, &fs_info->flags))
3567 wake_up_process(fs_info->cleaner_kthread);
3568
3569 return 0;
3570
3571fail_qgroup:
3572 btrfs_free_qgroup_config(fs_info);
3573fail_trans_kthread:
3574 kthread_stop(fs_info->transaction_kthread);
3575 btrfs_cleanup_transaction(fs_info);
3576 btrfs_free_fs_roots(fs_info);
3577fail_cleaner:
3578 kthread_stop(fs_info->cleaner_kthread);
3579
3580 /*
3581 * make sure we're done with the btree inode before we stop our
3582 * kthreads
3583 */
3584 filemap_write_and_wait(fs_info->btree_inode->i_mapping);
3585
3586fail_sysfs:
3587 btrfs_sysfs_remove_mounted(fs_info);
3588
3589fail_fsdev_sysfs:
3590 btrfs_sysfs_remove_fsid(fs_info->fs_devices);
3591
3592fail_block_groups:
3593 btrfs_put_block_group_cache(fs_info);
3594
3595fail_tree_roots:
3596 if (fs_info->data_reloc_root)
3597 btrfs_drop_and_free_fs_root(fs_info, fs_info->data_reloc_root);
3598 free_root_pointers(fs_info, true);
3599 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
3600
3601fail_sb_buffer:
3602 btrfs_stop_all_workers(fs_info);
3603 btrfs_free_block_groups(fs_info);
3604fail_alloc:
3605 btrfs_mapping_tree_free(fs_info);
3606
3607 iput(fs_info->btree_inode);
3608fail:
3609 btrfs_close_devices(fs_info->fs_devices);
3610 ASSERT(ret < 0);
3611 return ret;
3612}
3613ALLOW_ERROR_INJECTION(open_ctree, ERRNO);
3614
3615static void btrfs_end_super_write(struct bio *bio)
3616{
3617 struct btrfs_device *device = bio->bi_private;
3618 struct folio_iter fi;
3619
3620 bio_for_each_folio_all(fi, bio) {
3621 if (bio->bi_status) {
3622 btrfs_warn_rl_in_rcu(device->fs_info,
3623 "lost super block write due to IO error on %s (%d)",
3624 btrfs_dev_name(device),
3625 blk_status_to_errno(bio->bi_status));
3626 btrfs_dev_stat_inc_and_print(device,
3627 BTRFS_DEV_STAT_WRITE_ERRS);
3628 /* Ensure failure if the primary sb fails. */
3629 if (bio->bi_opf & REQ_FUA)
3630 atomic_add(BTRFS_SUPER_PRIMARY_WRITE_ERROR,
3631 &device->sb_write_errors);
3632 else
3633 atomic_inc(&device->sb_write_errors);
3634 }
3635 folio_unlock(fi.folio);
3636 folio_put(fi.folio);
3637 }
3638
3639 bio_put(bio);
3640}
3641
3642struct btrfs_super_block *btrfs_read_dev_one_super(struct block_device *bdev,
3643 int copy_num, bool drop_cache)
3644{
3645 struct btrfs_super_block *super;
3646 struct page *page;
3647 u64 bytenr, bytenr_orig;
3648 struct address_space *mapping = bdev->bd_mapping;
3649 int ret;
3650
3651 bytenr_orig = btrfs_sb_offset(copy_num);
3652 ret = btrfs_sb_log_location_bdev(bdev, copy_num, READ, &bytenr);
3653 if (ret == -ENOENT)
3654 return ERR_PTR(-EINVAL);
3655 else if (ret)
3656 return ERR_PTR(ret);
3657
3658 if (bytenr + BTRFS_SUPER_INFO_SIZE >= bdev_nr_bytes(bdev))
3659 return ERR_PTR(-EINVAL);
3660
3661 if (drop_cache) {
3662 /* This should only be called with the primary sb. */
3663 ASSERT(copy_num == 0);
3664
3665 /*
3666 * Drop the page of the primary superblock, so later read will
3667 * always read from the device.
3668 */
3669 invalidate_inode_pages2_range(mapping,
3670 bytenr >> PAGE_SHIFT,
3671 (bytenr + BTRFS_SUPER_INFO_SIZE) >> PAGE_SHIFT);
3672 }
3673
3674 page = read_cache_page_gfp(mapping, bytenr >> PAGE_SHIFT, GFP_NOFS);
3675 if (IS_ERR(page))
3676 return ERR_CAST(page);
3677
3678 super = page_address(page);
3679 if (btrfs_super_magic(super) != BTRFS_MAGIC) {
3680 btrfs_release_disk_super(super);
3681 return ERR_PTR(-ENODATA);
3682 }
3683
3684 if (btrfs_super_bytenr(super) != bytenr_orig) {
3685 btrfs_release_disk_super(super);
3686 return ERR_PTR(-EINVAL);
3687 }
3688
3689 return super;
3690}
3691
3692
3693struct btrfs_super_block *btrfs_read_dev_super(struct block_device *bdev)
3694{
3695 struct btrfs_super_block *super, *latest = NULL;
3696 int i;
3697 u64 transid = 0;
3698
3699 /* we would like to check all the supers, but that would make
3700 * a btrfs mount succeed after a mkfs from a different FS.
3701 * So, we need to add a special mount option to scan for
3702 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
3703 */
3704 for (i = 0; i < 1; i++) {
3705 super = btrfs_read_dev_one_super(bdev, i, false);
3706 if (IS_ERR(super))
3707 continue;
3708
3709 if (!latest || btrfs_super_generation(super) > transid) {
3710 if (latest)
3711 btrfs_release_disk_super(super);
3712
3713 latest = super;
3714 transid = btrfs_super_generation(super);
3715 }
3716 }
3717
3718 return super;
3719}
3720
3721/*
3722 * Write superblock @sb to the @device. Do not wait for completion, all the
3723 * folios we use for writing are locked.
3724 *
3725 * Write @max_mirrors copies of the superblock, where 0 means default that fit
3726 * the expected device size at commit time. Note that max_mirrors must be
3727 * same for write and wait phases.
3728 *
3729 * Return number of errors when folio is not found or submission fails.
3730 */
3731static int write_dev_supers(struct btrfs_device *device,
3732 struct btrfs_super_block *sb, int max_mirrors)
3733{
3734 struct btrfs_fs_info *fs_info = device->fs_info;
3735 struct address_space *mapping = device->bdev->bd_mapping;
3736 SHASH_DESC_ON_STACK(shash, fs_info->csum_shash);
3737 int i;
3738 int ret;
3739 u64 bytenr, bytenr_orig;
3740
3741 atomic_set(&device->sb_write_errors, 0);
3742
3743 if (max_mirrors == 0)
3744 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
3745
3746 shash->tfm = fs_info->csum_shash;
3747
3748 for (i = 0; i < max_mirrors; i++) {
3749 struct folio *folio;
3750 struct bio *bio;
3751 struct btrfs_super_block *disk_super;
3752 size_t offset;
3753
3754 bytenr_orig = btrfs_sb_offset(i);
3755 ret = btrfs_sb_log_location(device, i, WRITE, &bytenr);
3756 if (ret == -ENOENT) {
3757 continue;
3758 } else if (ret < 0) {
3759 btrfs_err(device->fs_info,
3760 "couldn't get super block location for mirror %d",
3761 i);
3762 atomic_inc(&device->sb_write_errors);
3763 continue;
3764 }
3765 if (bytenr + BTRFS_SUPER_INFO_SIZE >=
3766 device->commit_total_bytes)
3767 break;
3768
3769 btrfs_set_super_bytenr(sb, bytenr_orig);
3770
3771 crypto_shash_digest(shash, (const char *)sb + BTRFS_CSUM_SIZE,
3772 BTRFS_SUPER_INFO_SIZE - BTRFS_CSUM_SIZE,
3773 sb->csum);
3774
3775 folio = __filemap_get_folio(mapping, bytenr >> PAGE_SHIFT,
3776 FGP_LOCK | FGP_ACCESSED | FGP_CREAT,
3777 GFP_NOFS);
3778 if (IS_ERR(folio)) {
3779 btrfs_err(device->fs_info,
3780 "couldn't get super block page for bytenr %llu",
3781 bytenr);
3782 atomic_inc(&device->sb_write_errors);
3783 continue;
3784 }
3785 ASSERT(folio_order(folio) == 0);
3786
3787 offset = offset_in_folio(folio, bytenr);
3788 disk_super = folio_address(folio) + offset;
3789 memcpy(disk_super, sb, BTRFS_SUPER_INFO_SIZE);
3790
3791 /*
3792 * Directly use bios here instead of relying on the page cache
3793 * to do I/O, so we don't lose the ability to do integrity
3794 * checking.
3795 */
3796 bio = bio_alloc(device->bdev, 1,
3797 REQ_OP_WRITE | REQ_SYNC | REQ_META | REQ_PRIO,
3798 GFP_NOFS);
3799 bio->bi_iter.bi_sector = bytenr >> SECTOR_SHIFT;
3800 bio->bi_private = device;
3801 bio->bi_end_io = btrfs_end_super_write;
3802 bio_add_folio_nofail(bio, folio, BTRFS_SUPER_INFO_SIZE, offset);
3803
3804 /*
3805 * We FUA only the first super block. The others we allow to
3806 * go down lazy and there's a short window where the on-disk
3807 * copies might still contain the older version.
3808 */
3809 if (i == 0 && !btrfs_test_opt(device->fs_info, NOBARRIER))
3810 bio->bi_opf |= REQ_FUA;
3811 submit_bio(bio);
3812
3813 if (btrfs_advance_sb_log(device, i))
3814 atomic_inc(&device->sb_write_errors);
3815 }
3816 return atomic_read(&device->sb_write_errors) < i ? 0 : -1;
3817}
3818
3819/*
3820 * Wait for write completion of superblocks done by write_dev_supers,
3821 * @max_mirrors same for write and wait phases.
3822 *
3823 * Return -1 if primary super block write failed or when there were no super block
3824 * copies written. Otherwise 0.
3825 */
3826static int wait_dev_supers(struct btrfs_device *device, int max_mirrors)
3827{
3828 int i;
3829 int errors = 0;
3830 bool primary_failed = false;
3831 int ret;
3832 u64 bytenr;
3833
3834 if (max_mirrors == 0)
3835 max_mirrors = BTRFS_SUPER_MIRROR_MAX;
3836
3837 for (i = 0; i < max_mirrors; i++) {
3838 struct folio *folio;
3839
3840 ret = btrfs_sb_log_location(device, i, READ, &bytenr);
3841 if (ret == -ENOENT) {
3842 break;
3843 } else if (ret < 0) {
3844 errors++;
3845 if (i == 0)
3846 primary_failed = true;
3847 continue;
3848 }
3849 if (bytenr + BTRFS_SUPER_INFO_SIZE >=
3850 device->commit_total_bytes)
3851 break;
3852
3853 folio = filemap_get_folio(device->bdev->bd_mapping,
3854 bytenr >> PAGE_SHIFT);
3855 /* If the folio has been removed, then we know it completed. */
3856 if (IS_ERR(folio))
3857 continue;
3858 ASSERT(folio_order(folio) == 0);
3859
3860 /* Folio will be unlocked once the write completes. */
3861 folio_wait_locked(folio);
3862 folio_put(folio);
3863 }
3864
3865 errors += atomic_read(&device->sb_write_errors);
3866 if (errors >= BTRFS_SUPER_PRIMARY_WRITE_ERROR)
3867 primary_failed = true;
3868 if (primary_failed) {
3869 btrfs_err(device->fs_info, "error writing primary super block to device %llu",
3870 device->devid);
3871 return -1;
3872 }
3873
3874 return errors < i ? 0 : -1;
3875}
3876
3877/*
3878 * endio for the write_dev_flush, this will wake anyone waiting
3879 * for the barrier when it is done
3880 */
3881static void btrfs_end_empty_barrier(struct bio *bio)
3882{
3883 bio_uninit(bio);
3884 complete(bio->bi_private);
3885}
3886
3887/*
3888 * Submit a flush request to the device if it supports it. Error handling is
3889 * done in the waiting counterpart.
3890 */
3891static void write_dev_flush(struct btrfs_device *device)
3892{
3893 struct bio *bio = &device->flush_bio;
3894
3895 device->last_flush_error = BLK_STS_OK;
3896
3897 bio_init(bio, device->bdev, NULL, 0,
3898 REQ_OP_WRITE | REQ_SYNC | REQ_PREFLUSH);
3899 bio->bi_end_io = btrfs_end_empty_barrier;
3900 init_completion(&device->flush_wait);
3901 bio->bi_private = &device->flush_wait;
3902 submit_bio(bio);
3903 set_bit(BTRFS_DEV_STATE_FLUSH_SENT, &device->dev_state);
3904}
3905
3906/*
3907 * If the flush bio has been submitted by write_dev_flush, wait for it.
3908 * Return true for any error, and false otherwise.
3909 */
3910static bool wait_dev_flush(struct btrfs_device *device)
3911{
3912 struct bio *bio = &device->flush_bio;
3913
3914 if (!test_and_clear_bit(BTRFS_DEV_STATE_FLUSH_SENT, &device->dev_state))
3915 return false;
3916
3917 wait_for_completion_io(&device->flush_wait);
3918
3919 if (bio->bi_status) {
3920 device->last_flush_error = bio->bi_status;
3921 btrfs_dev_stat_inc_and_print(device, BTRFS_DEV_STAT_FLUSH_ERRS);
3922 return true;
3923 }
3924
3925 return false;
3926}
3927
3928/*
3929 * send an empty flush down to each device in parallel,
3930 * then wait for them
3931 */
3932static int barrier_all_devices(struct btrfs_fs_info *info)
3933{
3934 struct list_head *head;
3935 struct btrfs_device *dev;
3936 int errors_wait = 0;
3937
3938 lockdep_assert_held(&info->fs_devices->device_list_mutex);
3939 /* send down all the barriers */
3940 head = &info->fs_devices->devices;
3941 list_for_each_entry(dev, head, dev_list) {
3942 if (test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state))
3943 continue;
3944 if (!dev->bdev)
3945 continue;
3946 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &dev->dev_state) ||
3947 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))
3948 continue;
3949
3950 write_dev_flush(dev);
3951 }
3952
3953 /* wait for all the barriers */
3954 list_for_each_entry(dev, head, dev_list) {
3955 if (test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state))
3956 continue;
3957 if (!dev->bdev) {
3958 errors_wait++;
3959 continue;
3960 }
3961 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &dev->dev_state) ||
3962 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))
3963 continue;
3964
3965 if (wait_dev_flush(dev))
3966 errors_wait++;
3967 }
3968
3969 /*
3970 * Checks last_flush_error of disks in order to determine the device
3971 * state.
3972 */
3973 if (errors_wait && !btrfs_check_rw_degradable(info, NULL))
3974 return -EIO;
3975
3976 return 0;
3977}
3978
3979int btrfs_get_num_tolerated_disk_barrier_failures(u64 flags)
3980{
3981 int raid_type;
3982 int min_tolerated = INT_MAX;
3983
3984 if ((flags & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 ||
3985 (flags & BTRFS_AVAIL_ALLOC_BIT_SINGLE))
3986 min_tolerated = min_t(int, min_tolerated,
3987 btrfs_raid_array[BTRFS_RAID_SINGLE].
3988 tolerated_failures);
3989
3990 for (raid_type = 0; raid_type < BTRFS_NR_RAID_TYPES; raid_type++) {
3991 if (raid_type == BTRFS_RAID_SINGLE)
3992 continue;
3993 if (!(flags & btrfs_raid_array[raid_type].bg_flag))
3994 continue;
3995 min_tolerated = min_t(int, min_tolerated,
3996 btrfs_raid_array[raid_type].
3997 tolerated_failures);
3998 }
3999
4000 if (min_tolerated == INT_MAX) {
4001 pr_warn("BTRFS: unknown raid flag: %llu", flags);
4002 min_tolerated = 0;
4003 }
4004
4005 return min_tolerated;
4006}
4007
4008int write_all_supers(struct btrfs_fs_info *fs_info, int max_mirrors)
4009{
4010 struct list_head *head;
4011 struct btrfs_device *dev;
4012 struct btrfs_super_block *sb;
4013 struct btrfs_dev_item *dev_item;
4014 int ret;
4015 int do_barriers;
4016 int max_errors;
4017 int total_errors = 0;
4018 u64 flags;
4019
4020 do_barriers = !btrfs_test_opt(fs_info, NOBARRIER);
4021
4022 /*
4023 * max_mirrors == 0 indicates we're from commit_transaction,
4024 * not from fsync where the tree roots in fs_info have not
4025 * been consistent on disk.
4026 */
4027 if (max_mirrors == 0)
4028 backup_super_roots(fs_info);
4029
4030 sb = fs_info->super_for_commit;
4031 dev_item = &sb->dev_item;
4032
4033 mutex_lock(&fs_info->fs_devices->device_list_mutex);
4034 head = &fs_info->fs_devices->devices;
4035 max_errors = btrfs_super_num_devices(fs_info->super_copy) - 1;
4036
4037 if (do_barriers) {
4038 ret = barrier_all_devices(fs_info);
4039 if (ret) {
4040 mutex_unlock(
4041 &fs_info->fs_devices->device_list_mutex);
4042 btrfs_handle_fs_error(fs_info, ret,
4043 "errors while submitting device barriers.");
4044 return ret;
4045 }
4046 }
4047
4048 list_for_each_entry(dev, head, dev_list) {
4049 if (!dev->bdev) {
4050 total_errors++;
4051 continue;
4052 }
4053 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &dev->dev_state) ||
4054 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))
4055 continue;
4056
4057 btrfs_set_stack_device_generation(dev_item, 0);
4058 btrfs_set_stack_device_type(dev_item, dev->type);
4059 btrfs_set_stack_device_id(dev_item, dev->devid);
4060 btrfs_set_stack_device_total_bytes(dev_item,
4061 dev->commit_total_bytes);
4062 btrfs_set_stack_device_bytes_used(dev_item,
4063 dev->commit_bytes_used);
4064 btrfs_set_stack_device_io_align(dev_item, dev->io_align);
4065 btrfs_set_stack_device_io_width(dev_item, dev->io_width);
4066 btrfs_set_stack_device_sector_size(dev_item, dev->sector_size);
4067 memcpy(dev_item->uuid, dev->uuid, BTRFS_UUID_SIZE);
4068 memcpy(dev_item->fsid, dev->fs_devices->metadata_uuid,
4069 BTRFS_FSID_SIZE);
4070
4071 flags = btrfs_super_flags(sb);
4072 btrfs_set_super_flags(sb, flags | BTRFS_HEADER_FLAG_WRITTEN);
4073
4074 ret = btrfs_validate_write_super(fs_info, sb);
4075 if (ret < 0) {
4076 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4077 btrfs_handle_fs_error(fs_info, -EUCLEAN,
4078 "unexpected superblock corruption detected");
4079 return -EUCLEAN;
4080 }
4081
4082 ret = write_dev_supers(dev, sb, max_mirrors);
4083 if (ret)
4084 total_errors++;
4085 }
4086 if (total_errors > max_errors) {
4087 btrfs_err(fs_info, "%d errors while writing supers",
4088 total_errors);
4089 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4090
4091 /* FUA is masked off if unsupported and can't be the reason */
4092 btrfs_handle_fs_error(fs_info, -EIO,
4093 "%d errors while writing supers",
4094 total_errors);
4095 return -EIO;
4096 }
4097
4098 total_errors = 0;
4099 list_for_each_entry(dev, head, dev_list) {
4100 if (!dev->bdev)
4101 continue;
4102 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &dev->dev_state) ||
4103 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))
4104 continue;
4105
4106 ret = wait_dev_supers(dev, max_mirrors);
4107 if (ret)
4108 total_errors++;
4109 }
4110 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
4111 if (total_errors > max_errors) {
4112 btrfs_handle_fs_error(fs_info, -EIO,
4113 "%d errors while writing supers",
4114 total_errors);
4115 return -EIO;
4116 }
4117 return 0;
4118}
4119
4120/* Drop a fs root from the radix tree and free it. */
4121void btrfs_drop_and_free_fs_root(struct btrfs_fs_info *fs_info,
4122 struct btrfs_root *root)
4123{
4124 bool drop_ref = false;
4125
4126 spin_lock(&fs_info->fs_roots_radix_lock);
4127 radix_tree_delete(&fs_info->fs_roots_radix,
4128 (unsigned long)btrfs_root_id(root));
4129 if (test_and_clear_bit(BTRFS_ROOT_IN_RADIX, &root->state))
4130 drop_ref = true;
4131 spin_unlock(&fs_info->fs_roots_radix_lock);
4132
4133 if (BTRFS_FS_ERROR(fs_info)) {
4134 ASSERT(root->log_root == NULL);
4135 if (root->reloc_root) {
4136 btrfs_put_root(root->reloc_root);
4137 root->reloc_root = NULL;
4138 }
4139 }
4140
4141 if (drop_ref)
4142 btrfs_put_root(root);
4143}
4144
4145int btrfs_commit_super(struct btrfs_fs_info *fs_info)
4146{
4147 mutex_lock(&fs_info->cleaner_mutex);
4148 btrfs_run_delayed_iputs(fs_info);
4149 mutex_unlock(&fs_info->cleaner_mutex);
4150 wake_up_process(fs_info->cleaner_kthread);
4151
4152 /* wait until ongoing cleanup work done */
4153 down_write(&fs_info->cleanup_work_sem);
4154 up_write(&fs_info->cleanup_work_sem);
4155
4156 return btrfs_commit_current_transaction(fs_info->tree_root);
4157}
4158
4159static void warn_about_uncommitted_trans(struct btrfs_fs_info *fs_info)
4160{
4161 struct btrfs_transaction *trans;
4162 struct btrfs_transaction *tmp;
4163 bool found = false;
4164
4165 /*
4166 * This function is only called at the very end of close_ctree(),
4167 * thus no other running transaction, no need to take trans_lock.
4168 */
4169 ASSERT(test_bit(BTRFS_FS_CLOSING_DONE, &fs_info->flags));
4170 list_for_each_entry_safe(trans, tmp, &fs_info->trans_list, list) {
4171 struct extent_state *cached = NULL;
4172 u64 dirty_bytes = 0;
4173 u64 cur = 0;
4174 u64 found_start;
4175 u64 found_end;
4176
4177 found = true;
4178 while (find_first_extent_bit(&trans->dirty_pages, cur,
4179 &found_start, &found_end, EXTENT_DIRTY, &cached)) {
4180 dirty_bytes += found_end + 1 - found_start;
4181 cur = found_end + 1;
4182 }
4183 btrfs_warn(fs_info,
4184 "transaction %llu (with %llu dirty metadata bytes) is not committed",
4185 trans->transid, dirty_bytes);
4186 btrfs_cleanup_one_transaction(trans);
4187
4188 if (trans == fs_info->running_transaction)
4189 fs_info->running_transaction = NULL;
4190 list_del_init(&trans->list);
4191
4192 btrfs_put_transaction(trans);
4193 trace_btrfs_transaction_commit(fs_info);
4194 }
4195 ASSERT(!found);
4196}
4197
4198void __cold close_ctree(struct btrfs_fs_info *fs_info)
4199{
4200 int ret;
4201
4202 set_bit(BTRFS_FS_CLOSING_START, &fs_info->flags);
4203
4204 /*
4205 * If we had UNFINISHED_DROPS we could still be processing them, so
4206 * clear that bit and wake up relocation so it can stop.
4207 * We must do this before stopping the block group reclaim task, because
4208 * at btrfs_relocate_block_group() we wait for this bit, and after the
4209 * wait we stop with -EINTR if btrfs_fs_closing() returns non-zero - we
4210 * have just set BTRFS_FS_CLOSING_START, so btrfs_fs_closing() will
4211 * return 1.
4212 */
4213 btrfs_wake_unfinished_drop(fs_info);
4214
4215 /*
4216 * We may have the reclaim task running and relocating a data block group,
4217 * in which case it may create delayed iputs. So stop it before we park
4218 * the cleaner kthread otherwise we can get new delayed iputs after
4219 * parking the cleaner, and that can make the async reclaim task to hang
4220 * if it's waiting for delayed iputs to complete, since the cleaner is
4221 * parked and can not run delayed iputs - this will make us hang when
4222 * trying to stop the async reclaim task.
4223 */
4224 cancel_work_sync(&fs_info->reclaim_bgs_work);
4225 /*
4226 * We don't want the cleaner to start new transactions, add more delayed
4227 * iputs, etc. while we're closing. We can't use kthread_stop() yet
4228 * because that frees the task_struct, and the transaction kthread might
4229 * still try to wake up the cleaner.
4230 */
4231 kthread_park(fs_info->cleaner_kthread);
4232
4233 /* wait for the qgroup rescan worker to stop */
4234 btrfs_qgroup_wait_for_completion(fs_info, false);
4235
4236 /* wait for the uuid_scan task to finish */
4237 down(&fs_info->uuid_tree_rescan_sem);
4238 /* avoid complains from lockdep et al., set sem back to initial state */
4239 up(&fs_info->uuid_tree_rescan_sem);
4240
4241 /* pause restriper - we want to resume on mount */
4242 btrfs_pause_balance(fs_info);
4243
4244 btrfs_dev_replace_suspend_for_unmount(fs_info);
4245
4246 btrfs_scrub_cancel(fs_info);
4247
4248 /* wait for any defraggers to finish */
4249 wait_event(fs_info->transaction_wait,
4250 (atomic_read(&fs_info->defrag_running) == 0));
4251
4252 /* clear out the rbtree of defraggable inodes */
4253 btrfs_cleanup_defrag_inodes(fs_info);
4254
4255 /*
4256 * Wait for any fixup workers to complete.
4257 * If we don't wait for them here and they are still running by the time
4258 * we call kthread_stop() against the cleaner kthread further below, we
4259 * get an use-after-free on the cleaner because the fixup worker adds an
4260 * inode to the list of delayed iputs and then attempts to wakeup the
4261 * cleaner kthread, which was already stopped and destroyed. We parked
4262 * already the cleaner, but below we run all pending delayed iputs.
4263 */
4264 btrfs_flush_workqueue(fs_info->fixup_workers);
4265 /*
4266 * Similar case here, we have to wait for delalloc workers before we
4267 * proceed below and stop the cleaner kthread, otherwise we trigger a
4268 * use-after-tree on the cleaner kthread task_struct when a delalloc
4269 * worker running submit_compressed_extents() adds a delayed iput, which
4270 * does a wake up on the cleaner kthread, which was already freed below
4271 * when we call kthread_stop().
4272 */
4273 btrfs_flush_workqueue(fs_info->delalloc_workers);
4274
4275 /*
4276 * After we parked the cleaner kthread, ordered extents may have
4277 * completed and created new delayed iputs. If one of the async reclaim
4278 * tasks is running and in the RUN_DELAYED_IPUTS flush state, then we
4279 * can hang forever trying to stop it, because if a delayed iput is
4280 * added after it ran btrfs_run_delayed_iputs() and before it called
4281 * btrfs_wait_on_delayed_iputs(), it will hang forever since there is
4282 * no one else to run iputs.
4283 *
4284 * So wait for all ongoing ordered extents to complete and then run
4285 * delayed iputs. This works because once we reach this point no one
4286 * can either create new ordered extents nor create delayed iputs
4287 * through some other means.
4288 *
4289 * Also note that btrfs_wait_ordered_roots() is not safe here, because
4290 * it waits for BTRFS_ORDERED_COMPLETE to be set on an ordered extent,
4291 * but the delayed iput for the respective inode is made only when doing
4292 * the final btrfs_put_ordered_extent() (which must happen at
4293 * btrfs_finish_ordered_io() when we are unmounting).
4294 */
4295 btrfs_flush_workqueue(fs_info->endio_write_workers);
4296 /* Ordered extents for free space inodes. */
4297 btrfs_flush_workqueue(fs_info->endio_freespace_worker);
4298 btrfs_run_delayed_iputs(fs_info);
4299
4300 cancel_work_sync(&fs_info->async_reclaim_work);
4301 cancel_work_sync(&fs_info->async_data_reclaim_work);
4302 cancel_work_sync(&fs_info->preempt_reclaim_work);
4303 cancel_work_sync(&fs_info->em_shrinker_work);
4304
4305 /* Cancel or finish ongoing discard work */
4306 btrfs_discard_cleanup(fs_info);
4307
4308 if (!sb_rdonly(fs_info->sb)) {
4309 /*
4310 * The cleaner kthread is stopped, so do one final pass over
4311 * unused block groups.
4312 */
4313 btrfs_delete_unused_bgs(fs_info);
4314
4315 /*
4316 * There might be existing delayed inode workers still running
4317 * and holding an empty delayed inode item. We must wait for
4318 * them to complete first because they can create a transaction.
4319 * This happens when someone calls btrfs_balance_delayed_items()
4320 * and then a transaction commit runs the same delayed nodes
4321 * before any delayed worker has done something with the nodes.
4322 * We must wait for any worker here and not at transaction
4323 * commit time since that could cause a deadlock.
4324 * This is a very rare case.
4325 */
4326 btrfs_flush_workqueue(fs_info->delayed_workers);
4327
4328 ret = btrfs_commit_super(fs_info);
4329 if (ret)
4330 btrfs_err(fs_info, "commit super ret %d", ret);
4331 }
4332
4333 if (BTRFS_FS_ERROR(fs_info))
4334 btrfs_error_commit_super(fs_info);
4335
4336 kthread_stop(fs_info->transaction_kthread);
4337 kthread_stop(fs_info->cleaner_kthread);
4338
4339 ASSERT(list_empty(&fs_info->delayed_iputs));
4340 set_bit(BTRFS_FS_CLOSING_DONE, &fs_info->flags);
4341
4342 if (btrfs_check_quota_leak(fs_info)) {
4343 WARN_ON(IS_ENABLED(CONFIG_BTRFS_DEBUG));
4344 btrfs_err(fs_info, "qgroup reserved space leaked");
4345 }
4346
4347 btrfs_free_qgroup_config(fs_info);
4348 ASSERT(list_empty(&fs_info->delalloc_roots));
4349
4350 if (percpu_counter_sum(&fs_info->delalloc_bytes)) {
4351 btrfs_info(fs_info, "at unmount delalloc count %lld",
4352 percpu_counter_sum(&fs_info->delalloc_bytes));
4353 }
4354
4355 if (percpu_counter_sum(&fs_info->ordered_bytes))
4356 btrfs_info(fs_info, "at unmount dio bytes count %lld",
4357 percpu_counter_sum(&fs_info->ordered_bytes));
4358
4359 btrfs_sysfs_remove_mounted(fs_info);
4360 btrfs_sysfs_remove_fsid(fs_info->fs_devices);
4361
4362 btrfs_put_block_group_cache(fs_info);
4363
4364 /*
4365 * we must make sure there is not any read request to
4366 * submit after we stopping all workers.
4367 */
4368 invalidate_inode_pages2(fs_info->btree_inode->i_mapping);
4369 btrfs_stop_all_workers(fs_info);
4370
4371 /* We shouldn't have any transaction open at this point */
4372 warn_about_uncommitted_trans(fs_info);
4373
4374 clear_bit(BTRFS_FS_OPEN, &fs_info->flags);
4375 free_root_pointers(fs_info, true);
4376 btrfs_free_fs_roots(fs_info);
4377
4378 /*
4379 * We must free the block groups after dropping the fs_roots as we could
4380 * have had an IO error and have left over tree log blocks that aren't
4381 * cleaned up until the fs roots are freed. This makes the block group
4382 * accounting appear to be wrong because there's pending reserved bytes,
4383 * so make sure we do the block group cleanup afterwards.
4384 */
4385 btrfs_free_block_groups(fs_info);
4386
4387 iput(fs_info->btree_inode);
4388
4389 btrfs_mapping_tree_free(fs_info);
4390 btrfs_close_devices(fs_info->fs_devices);
4391}
4392
4393void btrfs_mark_buffer_dirty(struct btrfs_trans_handle *trans,
4394 struct extent_buffer *buf)
4395{
4396 struct btrfs_fs_info *fs_info = buf->fs_info;
4397 u64 transid = btrfs_header_generation(buf);
4398
4399#ifdef CONFIG_BTRFS_FS_RUN_SANITY_TESTS
4400 /*
4401 * This is a fast path so only do this check if we have sanity tests
4402 * enabled. Normal people shouldn't be using unmapped buffers as dirty
4403 * outside of the sanity tests.
4404 */
4405 if (unlikely(test_bit(EXTENT_BUFFER_UNMAPPED, &buf->bflags)))
4406 return;
4407#endif
4408 /* This is an active transaction (its state < TRANS_STATE_UNBLOCKED). */
4409 ASSERT(trans->transid == fs_info->generation);
4410 btrfs_assert_tree_write_locked(buf);
4411 if (unlikely(transid != fs_info->generation)) {
4412 btrfs_abort_transaction(trans, -EUCLEAN);
4413 btrfs_crit(fs_info,
4414"dirty buffer transid mismatch, logical %llu found transid %llu running transid %llu",
4415 buf->start, transid, fs_info->generation);
4416 }
4417 set_extent_buffer_dirty(buf);
4418}
4419
4420static void __btrfs_btree_balance_dirty(struct btrfs_fs_info *fs_info,
4421 int flush_delayed)
4422{
4423 /*
4424 * looks as though older kernels can get into trouble with
4425 * this code, they end up stuck in balance_dirty_pages forever
4426 */
4427 int ret;
4428
4429 if (current->flags & PF_MEMALLOC)
4430 return;
4431
4432 if (flush_delayed)
4433 btrfs_balance_delayed_items(fs_info);
4434
4435 ret = __percpu_counter_compare(&fs_info->dirty_metadata_bytes,
4436 BTRFS_DIRTY_METADATA_THRESH,
4437 fs_info->dirty_metadata_batch);
4438 if (ret > 0) {
4439 balance_dirty_pages_ratelimited(fs_info->btree_inode->i_mapping);
4440 }
4441}
4442
4443void btrfs_btree_balance_dirty(struct btrfs_fs_info *fs_info)
4444{
4445 __btrfs_btree_balance_dirty(fs_info, 1);
4446}
4447
4448void btrfs_btree_balance_dirty_nodelay(struct btrfs_fs_info *fs_info)
4449{
4450 __btrfs_btree_balance_dirty(fs_info, 0);
4451}
4452
4453static void btrfs_error_commit_super(struct btrfs_fs_info *fs_info)
4454{
4455 /* cleanup FS via transaction */
4456 btrfs_cleanup_transaction(fs_info);
4457
4458 mutex_lock(&fs_info->cleaner_mutex);
4459 btrfs_run_delayed_iputs(fs_info);
4460 mutex_unlock(&fs_info->cleaner_mutex);
4461
4462 down_write(&fs_info->cleanup_work_sem);
4463 up_write(&fs_info->cleanup_work_sem);
4464}
4465
4466static void btrfs_drop_all_logs(struct btrfs_fs_info *fs_info)
4467{
4468 struct btrfs_root *gang[8];
4469 u64 root_objectid = 0;
4470 int ret;
4471
4472 spin_lock(&fs_info->fs_roots_radix_lock);
4473 while ((ret = radix_tree_gang_lookup(&fs_info->fs_roots_radix,
4474 (void **)gang, root_objectid,
4475 ARRAY_SIZE(gang))) != 0) {
4476 int i;
4477
4478 for (i = 0; i < ret; i++)
4479 gang[i] = btrfs_grab_root(gang[i]);
4480 spin_unlock(&fs_info->fs_roots_radix_lock);
4481
4482 for (i = 0; i < ret; i++) {
4483 if (!gang[i])
4484 continue;
4485 root_objectid = btrfs_root_id(gang[i]);
4486 btrfs_free_log(NULL, gang[i]);
4487 btrfs_put_root(gang[i]);
4488 }
4489 root_objectid++;
4490 spin_lock(&fs_info->fs_roots_radix_lock);
4491 }
4492 spin_unlock(&fs_info->fs_roots_radix_lock);
4493 btrfs_free_log_root_tree(NULL, fs_info);
4494}
4495
4496static void btrfs_destroy_ordered_extents(struct btrfs_root *root)
4497{
4498 struct btrfs_ordered_extent *ordered;
4499
4500 spin_lock(&root->ordered_extent_lock);
4501 /*
4502 * This will just short circuit the ordered completion stuff which will
4503 * make sure the ordered extent gets properly cleaned up.
4504 */
4505 list_for_each_entry(ordered, &root->ordered_extents,
4506 root_extent_list)
4507 set_bit(BTRFS_ORDERED_IOERR, &ordered->flags);
4508 spin_unlock(&root->ordered_extent_lock);
4509}
4510
4511static void btrfs_destroy_all_ordered_extents(struct btrfs_fs_info *fs_info)
4512{
4513 struct btrfs_root *root;
4514 LIST_HEAD(splice);
4515
4516 spin_lock(&fs_info->ordered_root_lock);
4517 list_splice_init(&fs_info->ordered_roots, &splice);
4518 while (!list_empty(&splice)) {
4519 root = list_first_entry(&splice, struct btrfs_root,
4520 ordered_root);
4521 list_move_tail(&root->ordered_root,
4522 &fs_info->ordered_roots);
4523
4524 spin_unlock(&fs_info->ordered_root_lock);
4525 btrfs_destroy_ordered_extents(root);
4526
4527 cond_resched();
4528 spin_lock(&fs_info->ordered_root_lock);
4529 }
4530 spin_unlock(&fs_info->ordered_root_lock);
4531
4532 /*
4533 * We need this here because if we've been flipped read-only we won't
4534 * get sync() from the umount, so we need to make sure any ordered
4535 * extents that haven't had their dirty pages IO start writeout yet
4536 * actually get run and error out properly.
4537 */
4538 btrfs_wait_ordered_roots(fs_info, U64_MAX, NULL);
4539}
4540
4541static void btrfs_destroy_delalloc_inodes(struct btrfs_root *root)
4542{
4543 struct btrfs_inode *btrfs_inode;
4544 LIST_HEAD(splice);
4545
4546 spin_lock(&root->delalloc_lock);
4547 list_splice_init(&root->delalloc_inodes, &splice);
4548
4549 while (!list_empty(&splice)) {
4550 struct inode *inode = NULL;
4551 btrfs_inode = list_first_entry(&splice, struct btrfs_inode,
4552 delalloc_inodes);
4553 btrfs_del_delalloc_inode(btrfs_inode);
4554 spin_unlock(&root->delalloc_lock);
4555
4556 /*
4557 * Make sure we get a live inode and that it'll not disappear
4558 * meanwhile.
4559 */
4560 inode = igrab(&btrfs_inode->vfs_inode);
4561 if (inode) {
4562 unsigned int nofs_flag;
4563
4564 nofs_flag = memalloc_nofs_save();
4565 invalidate_inode_pages2(inode->i_mapping);
4566 memalloc_nofs_restore(nofs_flag);
4567 iput(inode);
4568 }
4569 spin_lock(&root->delalloc_lock);
4570 }
4571 spin_unlock(&root->delalloc_lock);
4572}
4573
4574static void btrfs_destroy_all_delalloc_inodes(struct btrfs_fs_info *fs_info)
4575{
4576 struct btrfs_root *root;
4577 LIST_HEAD(splice);
4578
4579 spin_lock(&fs_info->delalloc_root_lock);
4580 list_splice_init(&fs_info->delalloc_roots, &splice);
4581 while (!list_empty(&splice)) {
4582 root = list_first_entry(&splice, struct btrfs_root,
4583 delalloc_root);
4584 root = btrfs_grab_root(root);
4585 BUG_ON(!root);
4586 spin_unlock(&fs_info->delalloc_root_lock);
4587
4588 btrfs_destroy_delalloc_inodes(root);
4589 btrfs_put_root(root);
4590
4591 spin_lock(&fs_info->delalloc_root_lock);
4592 }
4593 spin_unlock(&fs_info->delalloc_root_lock);
4594}
4595
4596static void btrfs_destroy_marked_extents(struct btrfs_fs_info *fs_info,
4597 struct extent_io_tree *dirty_pages,
4598 int mark)
4599{
4600 struct extent_buffer *eb;
4601 u64 start = 0;
4602 u64 end;
4603
4604 while (find_first_extent_bit(dirty_pages, start, &start, &end,
4605 mark, NULL)) {
4606 clear_extent_bits(dirty_pages, start, end, mark);
4607 while (start <= end) {
4608 eb = find_extent_buffer(fs_info, start);
4609 start += fs_info->nodesize;
4610 if (!eb)
4611 continue;
4612
4613 btrfs_tree_lock(eb);
4614 wait_on_extent_buffer_writeback(eb);
4615 btrfs_clear_buffer_dirty(NULL, eb);
4616 btrfs_tree_unlock(eb);
4617
4618 free_extent_buffer_stale(eb);
4619 }
4620 }
4621}
4622
4623static void btrfs_destroy_pinned_extent(struct btrfs_fs_info *fs_info,
4624 struct extent_io_tree *unpin)
4625{
4626 u64 start;
4627 u64 end;
4628
4629 while (1) {
4630 struct extent_state *cached_state = NULL;
4631
4632 /*
4633 * The btrfs_finish_extent_commit() may get the same range as
4634 * ours between find_first_extent_bit and clear_extent_dirty.
4635 * Hence, hold the unused_bg_unpin_mutex to avoid double unpin
4636 * the same extent range.
4637 */
4638 mutex_lock(&fs_info->unused_bg_unpin_mutex);
4639 if (!find_first_extent_bit(unpin, 0, &start, &end,
4640 EXTENT_DIRTY, &cached_state)) {
4641 mutex_unlock(&fs_info->unused_bg_unpin_mutex);
4642 break;
4643 }
4644
4645 clear_extent_dirty(unpin, start, end, &cached_state);
4646 free_extent_state(cached_state);
4647 btrfs_error_unpin_extent_range(fs_info, start, end);
4648 mutex_unlock(&fs_info->unused_bg_unpin_mutex);
4649 cond_resched();
4650 }
4651}
4652
4653static void btrfs_cleanup_bg_io(struct btrfs_block_group *cache)
4654{
4655 struct inode *inode;
4656
4657 inode = cache->io_ctl.inode;
4658 if (inode) {
4659 unsigned int nofs_flag;
4660
4661 nofs_flag = memalloc_nofs_save();
4662 invalidate_inode_pages2(inode->i_mapping);
4663 memalloc_nofs_restore(nofs_flag);
4664
4665 BTRFS_I(inode)->generation = 0;
4666 cache->io_ctl.inode = NULL;
4667 iput(inode);
4668 }
4669 ASSERT(cache->io_ctl.pages == NULL);
4670 btrfs_put_block_group(cache);
4671}
4672
4673void btrfs_cleanup_dirty_bgs(struct btrfs_transaction *cur_trans,
4674 struct btrfs_fs_info *fs_info)
4675{
4676 struct btrfs_block_group *cache;
4677
4678 spin_lock(&cur_trans->dirty_bgs_lock);
4679 while (!list_empty(&cur_trans->dirty_bgs)) {
4680 cache = list_first_entry(&cur_trans->dirty_bgs,
4681 struct btrfs_block_group,
4682 dirty_list);
4683
4684 if (!list_empty(&cache->io_list)) {
4685 spin_unlock(&cur_trans->dirty_bgs_lock);
4686 list_del_init(&cache->io_list);
4687 btrfs_cleanup_bg_io(cache);
4688 spin_lock(&cur_trans->dirty_bgs_lock);
4689 }
4690
4691 list_del_init(&cache->dirty_list);
4692 spin_lock(&cache->lock);
4693 cache->disk_cache_state = BTRFS_DC_ERROR;
4694 spin_unlock(&cache->lock);
4695
4696 spin_unlock(&cur_trans->dirty_bgs_lock);
4697 btrfs_put_block_group(cache);
4698 btrfs_dec_delayed_refs_rsv_bg_updates(fs_info);
4699 spin_lock(&cur_trans->dirty_bgs_lock);
4700 }
4701 spin_unlock(&cur_trans->dirty_bgs_lock);
4702
4703 /*
4704 * Refer to the definition of io_bgs member for details why it's safe
4705 * to use it without any locking
4706 */
4707 while (!list_empty(&cur_trans->io_bgs)) {
4708 cache = list_first_entry(&cur_trans->io_bgs,
4709 struct btrfs_block_group,
4710 io_list);
4711
4712 list_del_init(&cache->io_list);
4713 spin_lock(&cache->lock);
4714 cache->disk_cache_state = BTRFS_DC_ERROR;
4715 spin_unlock(&cache->lock);
4716 btrfs_cleanup_bg_io(cache);
4717 }
4718}
4719
4720static void btrfs_free_all_qgroup_pertrans(struct btrfs_fs_info *fs_info)
4721{
4722 struct btrfs_root *gang[8];
4723 int i;
4724 int ret;
4725
4726 spin_lock(&fs_info->fs_roots_radix_lock);
4727 while (1) {
4728 ret = radix_tree_gang_lookup_tag(&fs_info->fs_roots_radix,
4729 (void **)gang, 0,
4730 ARRAY_SIZE(gang),
4731 BTRFS_ROOT_TRANS_TAG);
4732 if (ret == 0)
4733 break;
4734 for (i = 0; i < ret; i++) {
4735 struct btrfs_root *root = gang[i];
4736
4737 btrfs_qgroup_free_meta_all_pertrans(root);
4738 radix_tree_tag_clear(&fs_info->fs_roots_radix,
4739 (unsigned long)btrfs_root_id(root),
4740 BTRFS_ROOT_TRANS_TAG);
4741 }
4742 }
4743 spin_unlock(&fs_info->fs_roots_radix_lock);
4744}
4745
4746void btrfs_cleanup_one_transaction(struct btrfs_transaction *cur_trans)
4747{
4748 struct btrfs_fs_info *fs_info = cur_trans->fs_info;
4749 struct btrfs_device *dev, *tmp;
4750
4751 btrfs_cleanup_dirty_bgs(cur_trans, fs_info);
4752 ASSERT(list_empty(&cur_trans->dirty_bgs));
4753 ASSERT(list_empty(&cur_trans->io_bgs));
4754
4755 list_for_each_entry_safe(dev, tmp, &cur_trans->dev_update_list,
4756 post_commit_list) {
4757 list_del_init(&dev->post_commit_list);
4758 }
4759
4760 btrfs_destroy_delayed_refs(cur_trans);
4761
4762 cur_trans->state = TRANS_STATE_COMMIT_START;
4763 wake_up(&fs_info->transaction_blocked_wait);
4764
4765 cur_trans->state = TRANS_STATE_UNBLOCKED;
4766 wake_up(&fs_info->transaction_wait);
4767
4768 btrfs_destroy_marked_extents(fs_info, &cur_trans->dirty_pages,
4769 EXTENT_DIRTY);
4770 btrfs_destroy_pinned_extent(fs_info, &cur_trans->pinned_extents);
4771
4772 cur_trans->state =TRANS_STATE_COMPLETED;
4773 wake_up(&cur_trans->commit_wait);
4774}
4775
4776static int btrfs_cleanup_transaction(struct btrfs_fs_info *fs_info)
4777{
4778 struct btrfs_transaction *t;
4779
4780 mutex_lock(&fs_info->transaction_kthread_mutex);
4781
4782 spin_lock(&fs_info->trans_lock);
4783 while (!list_empty(&fs_info->trans_list)) {
4784 t = list_first_entry(&fs_info->trans_list,
4785 struct btrfs_transaction, list);
4786 if (t->state >= TRANS_STATE_COMMIT_PREP) {
4787 refcount_inc(&t->use_count);
4788 spin_unlock(&fs_info->trans_lock);
4789 btrfs_wait_for_commit(fs_info, t->transid);
4790 btrfs_put_transaction(t);
4791 spin_lock(&fs_info->trans_lock);
4792 continue;
4793 }
4794 if (t == fs_info->running_transaction) {
4795 t->state = TRANS_STATE_COMMIT_DOING;
4796 spin_unlock(&fs_info->trans_lock);
4797 /*
4798 * We wait for 0 num_writers since we don't hold a trans
4799 * handle open currently for this transaction.
4800 */
4801 wait_event(t->writer_wait,
4802 atomic_read(&t->num_writers) == 0);
4803 } else {
4804 spin_unlock(&fs_info->trans_lock);
4805 }
4806 btrfs_cleanup_one_transaction(t);
4807
4808 spin_lock(&fs_info->trans_lock);
4809 if (t == fs_info->running_transaction)
4810 fs_info->running_transaction = NULL;
4811 list_del_init(&t->list);
4812 spin_unlock(&fs_info->trans_lock);
4813
4814 btrfs_put_transaction(t);
4815 trace_btrfs_transaction_commit(fs_info);
4816 spin_lock(&fs_info->trans_lock);
4817 }
4818 spin_unlock(&fs_info->trans_lock);
4819 btrfs_destroy_all_ordered_extents(fs_info);
4820 btrfs_destroy_delayed_inodes(fs_info);
4821 btrfs_assert_delayed_root_empty(fs_info);
4822 btrfs_destroy_all_delalloc_inodes(fs_info);
4823 btrfs_drop_all_logs(fs_info);
4824 btrfs_free_all_qgroup_pertrans(fs_info);
4825 mutex_unlock(&fs_info->transaction_kthread_mutex);
4826
4827 return 0;
4828}
4829
4830int btrfs_init_root_free_objectid(struct btrfs_root *root)
4831{
4832 struct btrfs_path *path;
4833 int ret;
4834 struct extent_buffer *l;
4835 struct btrfs_key search_key;
4836 struct btrfs_key found_key;
4837 int slot;
4838
4839 path = btrfs_alloc_path();
4840 if (!path)
4841 return -ENOMEM;
4842
4843 search_key.objectid = BTRFS_LAST_FREE_OBJECTID;
4844 search_key.type = -1;
4845 search_key.offset = (u64)-1;
4846 ret = btrfs_search_slot(NULL, root, &search_key, path, 0, 0);
4847 if (ret < 0)
4848 goto error;
4849 if (ret == 0) {
4850 /*
4851 * Key with offset -1 found, there would have to exist a root
4852 * with such id, but this is out of valid range.
4853 */
4854 ret = -EUCLEAN;
4855 goto error;
4856 }
4857 if (path->slots[0] > 0) {
4858 slot = path->slots[0] - 1;
4859 l = path->nodes[0];
4860 btrfs_item_key_to_cpu(l, &found_key, slot);
4861 root->free_objectid = max_t(u64, found_key.objectid + 1,
4862 BTRFS_FIRST_FREE_OBJECTID);
4863 } else {
4864 root->free_objectid = BTRFS_FIRST_FREE_OBJECTID;
4865 }
4866 ret = 0;
4867error:
4868 btrfs_free_path(path);
4869 return ret;
4870}
4871
4872int btrfs_get_free_objectid(struct btrfs_root *root, u64 *objectid)
4873{
4874 int ret;
4875 mutex_lock(&root->objectid_mutex);
4876
4877 if (unlikely(root->free_objectid >= BTRFS_LAST_FREE_OBJECTID)) {
4878 btrfs_warn(root->fs_info,
4879 "the objectid of root %llu reaches its highest value",
4880 btrfs_root_id(root));
4881 ret = -ENOSPC;
4882 goto out;
4883 }
4884
4885 *objectid = root->free_objectid++;
4886 ret = 0;
4887out:
4888 mutex_unlock(&root->objectid_mutex);
4889 return ret;
4890}