1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2007 Oracle. All rights reserved.
6 #include <linux/sched.h>
7 #include <linux/sched/mm.h>
9 #include <linux/slab.h>
10 #include <linux/blkdev.h>
11 #include <linux/ratelimit.h>
12 #include <linux/kthread.h>
13 #include <linux/raid/pq.h>
14 #include <linux/semaphore.h>
15 #include <linux/uuid.h>
16 #include <linux/list_sort.h>
19 #include "extent_map.h"
21 #include "transaction.h"
22 #include "print-tree.h"
25 #include "async-thread.h"
26 #include "check-integrity.h"
27 #include "rcu-string.h"
28 #include "dev-replace.h"
30 #include "tree-checker.h"
31 #include "space-info.h"
32 #include "block-group.h"
36 const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = {
37 [BTRFS_RAID_RAID10] = {
40 .devs_max = 0, /* 0 == as many as possible */
42 .tolerated_failures = 1,
46 .raid_name = "raid10",
47 .bg_flag = BTRFS_BLOCK_GROUP_RAID10,
48 .mindev_error = BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET,
50 [BTRFS_RAID_RAID1] = {
55 .tolerated_failures = 1,
60 .bg_flag = BTRFS_BLOCK_GROUP_RAID1,
61 .mindev_error = BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET,
63 [BTRFS_RAID_RAID1C3] = {
68 .tolerated_failures = 2,
72 .raid_name = "raid1c3",
73 .bg_flag = BTRFS_BLOCK_GROUP_RAID1C3,
74 .mindev_error = BTRFS_ERROR_DEV_RAID1C3_MIN_NOT_MET,
76 [BTRFS_RAID_RAID1C4] = {
81 .tolerated_failures = 3,
85 .raid_name = "raid1c4",
86 .bg_flag = BTRFS_BLOCK_GROUP_RAID1C4,
87 .mindev_error = BTRFS_ERROR_DEV_RAID1C4_MIN_NOT_MET,
94 .tolerated_failures = 0,
99 .bg_flag = BTRFS_BLOCK_GROUP_DUP,
102 [BTRFS_RAID_RAID0] = {
107 .tolerated_failures = 0,
111 .raid_name = "raid0",
112 .bg_flag = BTRFS_BLOCK_GROUP_RAID0,
115 [BTRFS_RAID_SINGLE] = {
120 .tolerated_failures = 0,
124 .raid_name = "single",
128 [BTRFS_RAID_RAID5] = {
133 .tolerated_failures = 1,
137 .raid_name = "raid5",
138 .bg_flag = BTRFS_BLOCK_GROUP_RAID5,
139 .mindev_error = BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET,
141 [BTRFS_RAID_RAID6] = {
146 .tolerated_failures = 2,
150 .raid_name = "raid6",
151 .bg_flag = BTRFS_BLOCK_GROUP_RAID6,
152 .mindev_error = BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET,
157 * Convert block group flags (BTRFS_BLOCK_GROUP_*) to btrfs_raid_types, which
158 * can be used as index to access btrfs_raid_array[].
160 enum btrfs_raid_types __attribute_const__ btrfs_bg_flags_to_raid_index(u64 flags)
162 if (flags & BTRFS_BLOCK_GROUP_RAID10)
163 return BTRFS_RAID_RAID10;
164 else if (flags & BTRFS_BLOCK_GROUP_RAID1)
165 return BTRFS_RAID_RAID1;
166 else if (flags & BTRFS_BLOCK_GROUP_RAID1C3)
167 return BTRFS_RAID_RAID1C3;
168 else if (flags & BTRFS_BLOCK_GROUP_RAID1C4)
169 return BTRFS_RAID_RAID1C4;
170 else if (flags & BTRFS_BLOCK_GROUP_DUP)
171 return BTRFS_RAID_DUP;
172 else if (flags & BTRFS_BLOCK_GROUP_RAID0)
173 return BTRFS_RAID_RAID0;
174 else if (flags & BTRFS_BLOCK_GROUP_RAID5)
175 return BTRFS_RAID_RAID5;
176 else if (flags & BTRFS_BLOCK_GROUP_RAID6)
177 return BTRFS_RAID_RAID6;
179 return BTRFS_RAID_SINGLE; /* BTRFS_BLOCK_GROUP_SINGLE */
182 const char *btrfs_bg_type_to_raid_name(u64 flags)
184 const int index = btrfs_bg_flags_to_raid_index(flags);
186 if (index >= BTRFS_NR_RAID_TYPES)
189 return btrfs_raid_array[index].raid_name;
193 * Fill @buf with textual description of @bg_flags, no more than @size_buf
194 * bytes including terminating null byte.
196 void btrfs_describe_block_groups(u64 bg_flags, char *buf, u32 size_buf)
201 u64 flags = bg_flags;
202 u32 size_bp = size_buf;
209 #define DESCRIBE_FLAG(flag, desc) \
211 if (flags & (flag)) { \
212 ret = snprintf(bp, size_bp, "%s|", (desc)); \
213 if (ret < 0 || ret >= size_bp) \
221 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_DATA, "data");
222 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_SYSTEM, "system");
223 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_METADATA, "metadata");
225 DESCRIBE_FLAG(BTRFS_AVAIL_ALLOC_BIT_SINGLE, "single");
226 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
227 DESCRIBE_FLAG(btrfs_raid_array[i].bg_flag,
228 btrfs_raid_array[i].raid_name);
232 ret = snprintf(bp, size_bp, "0x%llx|", flags);
236 if (size_bp < size_buf)
237 buf[size_buf - size_bp - 1] = '\0'; /* remove last | */
240 * The text is trimmed, it's up to the caller to provide sufficiently
246 static int init_first_rw_device(struct btrfs_trans_handle *trans);
247 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info);
248 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev);
249 static void btrfs_dev_stat_print_on_load(struct btrfs_device *device);
250 static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
251 enum btrfs_map_op op,
252 u64 logical, u64 *length,
253 struct btrfs_bio **bbio_ret,
254 int mirror_num, int need_raid_map);
260 * There are several mutexes that protect manipulation of devices and low-level
261 * structures like chunks but not block groups, extents or files
263 * uuid_mutex (global lock)
264 * ------------------------
265 * protects the fs_uuids list that tracks all per-fs fs_devices, resulting from
266 * the SCAN_DEV ioctl registration or from mount either implicitly (the first
267 * device) or requested by the device= mount option
269 * the mutex can be very coarse and can cover long-running operations
271 * protects: updates to fs_devices counters like missing devices, rw devices,
272 * seeding, structure cloning, opening/closing devices at mount/umount time
274 * global::fs_devs - add, remove, updates to the global list
276 * does not protect: manipulation of the fs_devices::devices list in general
277 * but in mount context it could be used to exclude list modifications by eg.
280 * btrfs_device::name - renames (write side), read is RCU
282 * fs_devices::device_list_mutex (per-fs, with RCU)
283 * ------------------------------------------------
284 * protects updates to fs_devices::devices, ie. adding and deleting
286 * simple list traversal with read-only actions can be done with RCU protection
288 * may be used to exclude some operations from running concurrently without any
289 * modifications to the list (see write_all_supers)
291 * Is not required at mount and close times, because our device list is
292 * protected by the uuid_mutex at that point.
296 * protects balance structures (status, state) and context accessed from
297 * several places (internally, ioctl)
301 * protects chunks, adding or removing during allocation, trim or when a new
302 * device is added/removed. Additionally it also protects post_commit_list of
303 * individual devices, since they can be added to the transaction's
304 * post_commit_list only with chunk_mutex held.
308 * a big lock that is held by the cleaner thread and prevents running subvolume
309 * cleaning together with relocation or delayed iputs
321 * Exclusive operations
322 * ====================
324 * Maintains the exclusivity of the following operations that apply to the
325 * whole filesystem and cannot run in parallel.
330 * - Device replace (*)
333 * The device operations (as above) can be in one of the following states:
339 * Only device operations marked with (*) can go into the Paused state for the
342 * - ioctl (only Balance can be Paused through ioctl)
343 * - filesystem remounted as read-only
344 * - filesystem unmounted and mounted as read-only
345 * - system power-cycle and filesystem mounted as read-only
346 * - filesystem or device errors leading to forced read-only
348 * The status of exclusive operation is set and cleared atomically.
349 * During the course of Paused state, fs_info::exclusive_operation remains set.
350 * A device operation in Paused or Running state can be canceled or resumed
351 * either by ioctl (Balance only) or when remounted as read-write.
352 * The exclusive status is cleared when the device operation is canceled or
356 DEFINE_MUTEX(uuid_mutex);
357 static LIST_HEAD(fs_uuids);
358 struct list_head * __attribute_const__ btrfs_get_fs_uuids(void)
364 * alloc_fs_devices - allocate struct btrfs_fs_devices
365 * @fsid: if not NULL, copy the UUID to fs_devices::fsid
366 * @metadata_fsid: if not NULL, copy the UUID to fs_devices::metadata_fsid
368 * Return a pointer to a new struct btrfs_fs_devices on success, or ERR_PTR().
369 * The returned struct is not linked onto any lists and can be destroyed with
370 * kfree() right away.
372 static struct btrfs_fs_devices *alloc_fs_devices(const u8 *fsid,
373 const u8 *metadata_fsid)
375 struct btrfs_fs_devices *fs_devs;
377 fs_devs = kzalloc(sizeof(*fs_devs), GFP_KERNEL);
379 return ERR_PTR(-ENOMEM);
381 mutex_init(&fs_devs->device_list_mutex);
383 INIT_LIST_HEAD(&fs_devs->devices);
384 INIT_LIST_HEAD(&fs_devs->alloc_list);
385 INIT_LIST_HEAD(&fs_devs->fs_list);
386 INIT_LIST_HEAD(&fs_devs->seed_list);
388 memcpy(fs_devs->fsid, fsid, BTRFS_FSID_SIZE);
391 memcpy(fs_devs->metadata_uuid, metadata_fsid, BTRFS_FSID_SIZE);
393 memcpy(fs_devs->metadata_uuid, fsid, BTRFS_FSID_SIZE);
398 void btrfs_free_device(struct btrfs_device *device)
400 WARN_ON(!list_empty(&device->post_commit_list));
401 rcu_string_free(device->name);
402 extent_io_tree_release(&device->alloc_state);
403 bio_put(device->flush_bio);
404 btrfs_destroy_dev_zone_info(device);
408 static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
410 struct btrfs_device *device;
411 WARN_ON(fs_devices->opened);
412 while (!list_empty(&fs_devices->devices)) {
413 device = list_entry(fs_devices->devices.next,
414 struct btrfs_device, dev_list);
415 list_del(&device->dev_list);
416 btrfs_free_device(device);
421 void __exit btrfs_cleanup_fs_uuids(void)
423 struct btrfs_fs_devices *fs_devices;
425 while (!list_empty(&fs_uuids)) {
426 fs_devices = list_entry(fs_uuids.next,
427 struct btrfs_fs_devices, fs_list);
428 list_del(&fs_devices->fs_list);
429 free_fs_devices(fs_devices);
433 static noinline struct btrfs_fs_devices *find_fsid(
434 const u8 *fsid, const u8 *metadata_fsid)
436 struct btrfs_fs_devices *fs_devices;
440 /* Handle non-split brain cases */
441 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
443 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0
444 && memcmp(metadata_fsid, fs_devices->metadata_uuid,
445 BTRFS_FSID_SIZE) == 0)
448 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0)
455 static struct btrfs_fs_devices *find_fsid_with_metadata_uuid(
456 struct btrfs_super_block *disk_super)
459 struct btrfs_fs_devices *fs_devices;
462 * Handle scanned device having completed its fsid change but
463 * belonging to a fs_devices that was created by first scanning
464 * a device which didn't have its fsid/metadata_uuid changed
465 * at all and the CHANGING_FSID_V2 flag set.
467 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
468 if (fs_devices->fsid_change &&
469 memcmp(disk_super->metadata_uuid, fs_devices->fsid,
470 BTRFS_FSID_SIZE) == 0 &&
471 memcmp(fs_devices->fsid, fs_devices->metadata_uuid,
472 BTRFS_FSID_SIZE) == 0) {
477 * Handle scanned device having completed its fsid change but
478 * belonging to a fs_devices that was created by a device that
479 * has an outdated pair of fsid/metadata_uuid and
480 * CHANGING_FSID_V2 flag set.
482 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
483 if (fs_devices->fsid_change &&
484 memcmp(fs_devices->metadata_uuid,
485 fs_devices->fsid, BTRFS_FSID_SIZE) != 0 &&
486 memcmp(disk_super->metadata_uuid, fs_devices->metadata_uuid,
487 BTRFS_FSID_SIZE) == 0) {
492 return find_fsid(disk_super->fsid, disk_super->metadata_uuid);
497 btrfs_get_bdev_and_sb(const char *device_path, fmode_t flags, void *holder,
498 int flush, struct block_device **bdev,
499 struct btrfs_super_block **disk_super)
503 *bdev = blkdev_get_by_path(device_path, flags, holder);
506 ret = PTR_ERR(*bdev);
511 filemap_write_and_wait((*bdev)->bd_inode->i_mapping);
512 ret = set_blocksize(*bdev, BTRFS_BDEV_BLOCKSIZE);
514 blkdev_put(*bdev, flags);
517 invalidate_bdev(*bdev);
518 *disk_super = btrfs_read_dev_super(*bdev);
519 if (IS_ERR(*disk_super)) {
520 ret = PTR_ERR(*disk_super);
521 blkdev_put(*bdev, flags);
532 static bool device_path_matched(const char *path, struct btrfs_device *device)
537 found = strcmp(rcu_str_deref(device->name), path);
544 * Search and remove all stale (devices which are not mounted) devices.
545 * When both inputs are NULL, it will search and release all stale devices.
546 * path: Optional. When provided will it release all unmounted devices
547 * matching this path only.
548 * skip_dev: Optional. Will skip this device when searching for the stale
550 * Return: 0 for success or if @path is NULL.
551 * -EBUSY if @path is a mounted device.
552 * -ENOENT if @path does not match any device in the list.
554 static int btrfs_free_stale_devices(const char *path,
555 struct btrfs_device *skip_device)
557 struct btrfs_fs_devices *fs_devices, *tmp_fs_devices;
558 struct btrfs_device *device, *tmp_device;
561 lockdep_assert_held(&uuid_mutex);
566 list_for_each_entry_safe(fs_devices, tmp_fs_devices, &fs_uuids, fs_list) {
568 mutex_lock(&fs_devices->device_list_mutex);
569 list_for_each_entry_safe(device, tmp_device,
570 &fs_devices->devices, dev_list) {
571 if (skip_device && skip_device == device)
573 if (path && !device->name)
575 if (path && !device_path_matched(path, device))
577 if (fs_devices->opened) {
578 /* for an already deleted device return 0 */
579 if (path && ret != 0)
584 /* delete the stale device */
585 fs_devices->num_devices--;
586 list_del(&device->dev_list);
587 btrfs_free_device(device);
591 mutex_unlock(&fs_devices->device_list_mutex);
593 if (fs_devices->num_devices == 0) {
594 btrfs_sysfs_remove_fsid(fs_devices);
595 list_del(&fs_devices->fs_list);
596 free_fs_devices(fs_devices);
604 * This is only used on mount, and we are protected from competing things
605 * messing with our fs_devices by the uuid_mutex, thus we do not need the
606 * fs_devices->device_list_mutex here.
608 static int btrfs_open_one_device(struct btrfs_fs_devices *fs_devices,
609 struct btrfs_device *device, fmode_t flags,
612 struct request_queue *q;
613 struct block_device *bdev;
614 struct btrfs_super_block *disk_super;
623 ret = btrfs_get_bdev_and_sb(device->name->str, flags, holder, 1,
628 devid = btrfs_stack_device_id(&disk_super->dev_item);
629 if (devid != device->devid)
630 goto error_free_page;
632 if (memcmp(device->uuid, disk_super->dev_item.uuid, BTRFS_UUID_SIZE))
633 goto error_free_page;
635 device->generation = btrfs_super_generation(disk_super);
637 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) {
638 if (btrfs_super_incompat_flags(disk_super) &
639 BTRFS_FEATURE_INCOMPAT_METADATA_UUID) {
641 "BTRFS: Invalid seeding and uuid-changed device detected\n");
642 goto error_free_page;
645 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
646 fs_devices->seeding = true;
648 if (bdev_read_only(bdev))
649 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
651 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
654 q = bdev_get_queue(bdev);
655 if (!blk_queue_nonrot(q))
656 fs_devices->rotating = true;
659 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
660 device->mode = flags;
662 fs_devices->open_devices++;
663 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
664 device->devid != BTRFS_DEV_REPLACE_DEVID) {
665 fs_devices->rw_devices++;
666 list_add_tail(&device->dev_alloc_list, &fs_devices->alloc_list);
668 btrfs_release_disk_super(disk_super);
673 btrfs_release_disk_super(disk_super);
674 blkdev_put(bdev, flags);
680 * Handle scanned device having its CHANGING_FSID_V2 flag set and the fs_devices
681 * being created with a disk that has already completed its fsid change. Such
682 * disk can belong to an fs which has its FSID changed or to one which doesn't.
683 * Handle both cases here.
685 static struct btrfs_fs_devices *find_fsid_inprogress(
686 struct btrfs_super_block *disk_super)
688 struct btrfs_fs_devices *fs_devices;
690 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
691 if (memcmp(fs_devices->metadata_uuid, fs_devices->fsid,
692 BTRFS_FSID_SIZE) != 0 &&
693 memcmp(fs_devices->metadata_uuid, disk_super->fsid,
694 BTRFS_FSID_SIZE) == 0 && !fs_devices->fsid_change) {
699 return find_fsid(disk_super->fsid, NULL);
703 static struct btrfs_fs_devices *find_fsid_changed(
704 struct btrfs_super_block *disk_super)
706 struct btrfs_fs_devices *fs_devices;
709 * Handles the case where scanned device is part of an fs that had
710 * multiple successful changes of FSID but currently device didn't
711 * observe it. Meaning our fsid will be different than theirs. We need
712 * to handle two subcases :
713 * 1 - The fs still continues to have different METADATA/FSID uuids.
714 * 2 - The fs is switched back to its original FSID (METADATA/FSID
717 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
719 if (memcmp(fs_devices->metadata_uuid, fs_devices->fsid,
720 BTRFS_FSID_SIZE) != 0 &&
721 memcmp(fs_devices->metadata_uuid, disk_super->metadata_uuid,
722 BTRFS_FSID_SIZE) == 0 &&
723 memcmp(fs_devices->fsid, disk_super->fsid,
724 BTRFS_FSID_SIZE) != 0)
727 /* Unchanged UUIDs */
728 if (memcmp(fs_devices->metadata_uuid, fs_devices->fsid,
729 BTRFS_FSID_SIZE) == 0 &&
730 memcmp(fs_devices->fsid, disk_super->metadata_uuid,
731 BTRFS_FSID_SIZE) == 0)
738 static struct btrfs_fs_devices *find_fsid_reverted_metadata(
739 struct btrfs_super_block *disk_super)
741 struct btrfs_fs_devices *fs_devices;
744 * Handle the case where the scanned device is part of an fs whose last
745 * metadata UUID change reverted it to the original FSID. At the same
746 * time * fs_devices was first created by another constitutent device
747 * which didn't fully observe the operation. This results in an
748 * btrfs_fs_devices created with metadata/fsid different AND
749 * btrfs_fs_devices::fsid_change set AND the metadata_uuid of the
750 * fs_devices equal to the FSID of the disk.
752 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
753 if (memcmp(fs_devices->fsid, fs_devices->metadata_uuid,
754 BTRFS_FSID_SIZE) != 0 &&
755 memcmp(fs_devices->metadata_uuid, disk_super->fsid,
756 BTRFS_FSID_SIZE) == 0 &&
757 fs_devices->fsid_change)
764 * Add new device to list of registered devices
767 * device pointer which was just added or updated when successful
768 * error pointer when failed
770 static noinline struct btrfs_device *device_list_add(const char *path,
771 struct btrfs_super_block *disk_super,
772 bool *new_device_added)
774 struct btrfs_device *device;
775 struct btrfs_fs_devices *fs_devices = NULL;
776 struct rcu_string *name;
777 u64 found_transid = btrfs_super_generation(disk_super);
778 u64 devid = btrfs_stack_device_id(&disk_super->dev_item);
779 bool has_metadata_uuid = (btrfs_super_incompat_flags(disk_super) &
780 BTRFS_FEATURE_INCOMPAT_METADATA_UUID);
781 bool fsid_change_in_progress = (btrfs_super_flags(disk_super) &
782 BTRFS_SUPER_FLAG_CHANGING_FSID_V2);
784 if (fsid_change_in_progress) {
785 if (!has_metadata_uuid)
786 fs_devices = find_fsid_inprogress(disk_super);
788 fs_devices = find_fsid_changed(disk_super);
789 } else if (has_metadata_uuid) {
790 fs_devices = find_fsid_with_metadata_uuid(disk_super);
792 fs_devices = find_fsid_reverted_metadata(disk_super);
794 fs_devices = find_fsid(disk_super->fsid, NULL);
799 if (has_metadata_uuid)
800 fs_devices = alloc_fs_devices(disk_super->fsid,
801 disk_super->metadata_uuid);
803 fs_devices = alloc_fs_devices(disk_super->fsid, NULL);
805 if (IS_ERR(fs_devices))
806 return ERR_CAST(fs_devices);
808 fs_devices->fsid_change = fsid_change_in_progress;
810 mutex_lock(&fs_devices->device_list_mutex);
811 list_add(&fs_devices->fs_list, &fs_uuids);
815 mutex_lock(&fs_devices->device_list_mutex);
816 device = btrfs_find_device(fs_devices, devid,
817 disk_super->dev_item.uuid, NULL);
820 * If this disk has been pulled into an fs devices created by
821 * a device which had the CHANGING_FSID_V2 flag then replace the
822 * metadata_uuid/fsid values of the fs_devices.
824 if (fs_devices->fsid_change &&
825 found_transid > fs_devices->latest_generation) {
826 memcpy(fs_devices->fsid, disk_super->fsid,
829 if (has_metadata_uuid)
830 memcpy(fs_devices->metadata_uuid,
831 disk_super->metadata_uuid,
834 memcpy(fs_devices->metadata_uuid,
835 disk_super->fsid, BTRFS_FSID_SIZE);
837 fs_devices->fsid_change = false;
842 if (fs_devices->opened) {
843 mutex_unlock(&fs_devices->device_list_mutex);
844 return ERR_PTR(-EBUSY);
847 device = btrfs_alloc_device(NULL, &devid,
848 disk_super->dev_item.uuid);
849 if (IS_ERR(device)) {
850 mutex_unlock(&fs_devices->device_list_mutex);
851 /* we can safely leave the fs_devices entry around */
855 name = rcu_string_strdup(path, GFP_NOFS);
857 btrfs_free_device(device);
858 mutex_unlock(&fs_devices->device_list_mutex);
859 return ERR_PTR(-ENOMEM);
861 rcu_assign_pointer(device->name, name);
863 list_add_rcu(&device->dev_list, &fs_devices->devices);
864 fs_devices->num_devices++;
866 device->fs_devices = fs_devices;
867 *new_device_added = true;
869 if (disk_super->label[0])
871 "BTRFS: device label %s devid %llu transid %llu %s scanned by %s (%d)\n",
872 disk_super->label, devid, found_transid, path,
873 current->comm, task_pid_nr(current));
876 "BTRFS: device fsid %pU devid %llu transid %llu %s scanned by %s (%d)\n",
877 disk_super->fsid, devid, found_transid, path,
878 current->comm, task_pid_nr(current));
880 } else if (!device->name || strcmp(device->name->str, path)) {
882 * When FS is already mounted.
883 * 1. If you are here and if the device->name is NULL that
884 * means this device was missing at time of FS mount.
885 * 2. If you are here and if the device->name is different
886 * from 'path' that means either
887 * a. The same device disappeared and reappeared with
889 * b. The missing-disk-which-was-replaced, has
892 * We must allow 1 and 2a above. But 2b would be a spurious
895 * Further in case of 1 and 2a above, the disk at 'path'
896 * would have missed some transaction when it was away and
897 * in case of 2a the stale bdev has to be updated as well.
898 * 2b must not be allowed at all time.
902 * For now, we do allow update to btrfs_fs_device through the
903 * btrfs dev scan cli after FS has been mounted. We're still
904 * tracking a problem where systems fail mount by subvolume id
905 * when we reject replacement on a mounted FS.
907 if (!fs_devices->opened && found_transid < device->generation) {
909 * That is if the FS is _not_ mounted and if you
910 * are here, that means there is more than one
911 * disk with same uuid and devid.We keep the one
912 * with larger generation number or the last-in if
913 * generation are equal.
915 mutex_unlock(&fs_devices->device_list_mutex);
916 return ERR_PTR(-EEXIST);
920 * We are going to replace the device path for a given devid,
921 * make sure it's the same device if the device is mounted
927 error = lookup_bdev(path, &path_dev);
929 mutex_unlock(&fs_devices->device_list_mutex);
930 return ERR_PTR(error);
933 if (device->bdev->bd_dev != path_dev) {
934 mutex_unlock(&fs_devices->device_list_mutex);
936 * device->fs_info may not be reliable here, so
937 * pass in a NULL instead. This avoids a
938 * possible use-after-free when the fs_info and
939 * fs_info->sb are already torn down.
941 btrfs_warn_in_rcu(NULL,
942 "duplicate device %s devid %llu generation %llu scanned by %s (%d)",
943 path, devid, found_transid,
945 task_pid_nr(current));
946 return ERR_PTR(-EEXIST);
948 btrfs_info_in_rcu(device->fs_info,
949 "devid %llu device path %s changed to %s scanned by %s (%d)",
950 devid, rcu_str_deref(device->name),
952 task_pid_nr(current));
955 name = rcu_string_strdup(path, GFP_NOFS);
957 mutex_unlock(&fs_devices->device_list_mutex);
958 return ERR_PTR(-ENOMEM);
960 rcu_string_free(device->name);
961 rcu_assign_pointer(device->name, name);
962 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
963 fs_devices->missing_devices--;
964 clear_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
969 * Unmount does not free the btrfs_device struct but would zero
970 * generation along with most of the other members. So just update
971 * it back. We need it to pick the disk with largest generation
974 if (!fs_devices->opened) {
975 device->generation = found_transid;
976 fs_devices->latest_generation = max_t(u64, found_transid,
977 fs_devices->latest_generation);
980 fs_devices->total_devices = btrfs_super_num_devices(disk_super);
982 mutex_unlock(&fs_devices->device_list_mutex);
986 static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig)
988 struct btrfs_fs_devices *fs_devices;
989 struct btrfs_device *device;
990 struct btrfs_device *orig_dev;
993 lockdep_assert_held(&uuid_mutex);
995 fs_devices = alloc_fs_devices(orig->fsid, NULL);
996 if (IS_ERR(fs_devices))
999 fs_devices->total_devices = orig->total_devices;
1001 list_for_each_entry(orig_dev, &orig->devices, dev_list) {
1002 struct rcu_string *name;
1004 device = btrfs_alloc_device(NULL, &orig_dev->devid,
1006 if (IS_ERR(device)) {
1007 ret = PTR_ERR(device);
1012 * This is ok to do without rcu read locked because we hold the
1013 * uuid mutex so nothing we touch in here is going to disappear.
1015 if (orig_dev->name) {
1016 name = rcu_string_strdup(orig_dev->name->str,
1019 btrfs_free_device(device);
1023 rcu_assign_pointer(device->name, name);
1026 list_add(&device->dev_list, &fs_devices->devices);
1027 device->fs_devices = fs_devices;
1028 fs_devices->num_devices++;
1032 free_fs_devices(fs_devices);
1033 return ERR_PTR(ret);
1036 static void __btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices,
1037 struct btrfs_device **latest_dev)
1039 struct btrfs_device *device, *next;
1041 /* This is the initialized path, it is safe to release the devices. */
1042 list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) {
1043 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state)) {
1044 if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT,
1045 &device->dev_state) &&
1046 !test_bit(BTRFS_DEV_STATE_MISSING,
1047 &device->dev_state) &&
1049 device->generation > (*latest_dev)->generation)) {
1050 *latest_dev = device;
1056 * We have already validated the presence of BTRFS_DEV_REPLACE_DEVID,
1057 * in btrfs_init_dev_replace() so just continue.
1059 if (device->devid == BTRFS_DEV_REPLACE_DEVID)
1063 blkdev_put(device->bdev, device->mode);
1064 device->bdev = NULL;
1065 fs_devices->open_devices--;
1067 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1068 list_del_init(&device->dev_alloc_list);
1069 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
1070 fs_devices->rw_devices--;
1072 list_del_init(&device->dev_list);
1073 fs_devices->num_devices--;
1074 btrfs_free_device(device);
1080 * After we have read the system tree and know devids belonging to this
1081 * filesystem, remove the device which does not belong there.
1083 void btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices)
1085 struct btrfs_device *latest_dev = NULL;
1086 struct btrfs_fs_devices *seed_dev;
1088 mutex_lock(&uuid_mutex);
1089 __btrfs_free_extra_devids(fs_devices, &latest_dev);
1091 list_for_each_entry(seed_dev, &fs_devices->seed_list, seed_list)
1092 __btrfs_free_extra_devids(seed_dev, &latest_dev);
1094 fs_devices->latest_bdev = latest_dev->bdev;
1096 mutex_unlock(&uuid_mutex);
1099 static void btrfs_close_bdev(struct btrfs_device *device)
1104 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1105 sync_blockdev(device->bdev);
1106 invalidate_bdev(device->bdev);
1109 blkdev_put(device->bdev, device->mode);
1112 static void btrfs_close_one_device(struct btrfs_device *device)
1114 struct btrfs_fs_devices *fs_devices = device->fs_devices;
1116 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
1117 device->devid != BTRFS_DEV_REPLACE_DEVID) {
1118 list_del_init(&device->dev_alloc_list);
1119 fs_devices->rw_devices--;
1122 if (device->devid == BTRFS_DEV_REPLACE_DEVID)
1123 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
1125 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state))
1126 fs_devices->missing_devices--;
1128 btrfs_close_bdev(device);
1130 fs_devices->open_devices--;
1131 device->bdev = NULL;
1133 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
1134 btrfs_destroy_dev_zone_info(device);
1136 device->fs_info = NULL;
1137 atomic_set(&device->dev_stats_ccnt, 0);
1138 extent_io_tree_release(&device->alloc_state);
1141 * Reset the flush error record. We might have a transient flush error
1142 * in this mount, and if so we aborted the current transaction and set
1143 * the fs to an error state, guaranteeing no super blocks can be further
1144 * committed. However that error might be transient and if we unmount the
1145 * filesystem and mount it again, we should allow the mount to succeed
1146 * (btrfs_check_rw_degradable() should not fail) - if after mounting the
1147 * filesystem again we still get flush errors, then we will again abort
1148 * any transaction and set the error state, guaranteeing no commits of
1149 * unsafe super blocks.
1151 device->last_flush_error = 0;
1153 /* Verify the device is back in a pristine state */
1154 ASSERT(!test_bit(BTRFS_DEV_STATE_FLUSH_SENT, &device->dev_state));
1155 ASSERT(!test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state));
1156 ASSERT(list_empty(&device->dev_alloc_list));
1157 ASSERT(list_empty(&device->post_commit_list));
1158 ASSERT(atomic_read(&device->reada_in_flight) == 0);
1161 static void close_fs_devices(struct btrfs_fs_devices *fs_devices)
1163 struct btrfs_device *device, *tmp;
1165 lockdep_assert_held(&uuid_mutex);
1167 if (--fs_devices->opened > 0)
1170 list_for_each_entry_safe(device, tmp, &fs_devices->devices, dev_list)
1171 btrfs_close_one_device(device);
1173 WARN_ON(fs_devices->open_devices);
1174 WARN_ON(fs_devices->rw_devices);
1175 fs_devices->opened = 0;
1176 fs_devices->seeding = false;
1177 fs_devices->fs_info = NULL;
1180 void btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
1183 struct btrfs_fs_devices *tmp;
1185 mutex_lock(&uuid_mutex);
1186 close_fs_devices(fs_devices);
1187 if (!fs_devices->opened)
1188 list_splice_init(&fs_devices->seed_list, &list);
1190 list_for_each_entry_safe(fs_devices, tmp, &list, seed_list) {
1191 close_fs_devices(fs_devices);
1192 list_del(&fs_devices->seed_list);
1193 free_fs_devices(fs_devices);
1195 mutex_unlock(&uuid_mutex);
1198 static int open_fs_devices(struct btrfs_fs_devices *fs_devices,
1199 fmode_t flags, void *holder)
1201 struct btrfs_device *device;
1202 struct btrfs_device *latest_dev = NULL;
1203 struct btrfs_device *tmp_device;
1205 flags |= FMODE_EXCL;
1207 list_for_each_entry_safe(device, tmp_device, &fs_devices->devices,
1211 ret = btrfs_open_one_device(fs_devices, device, flags, holder);
1213 (!latest_dev || device->generation > latest_dev->generation)) {
1214 latest_dev = device;
1215 } else if (ret == -ENODATA) {
1216 fs_devices->num_devices--;
1217 list_del(&device->dev_list);
1218 btrfs_free_device(device);
1221 if (fs_devices->open_devices == 0)
1224 fs_devices->opened = 1;
1225 fs_devices->latest_bdev = latest_dev->bdev;
1226 fs_devices->total_rw_bytes = 0;
1227 fs_devices->chunk_alloc_policy = BTRFS_CHUNK_ALLOC_REGULAR;
1228 fs_devices->read_policy = BTRFS_READ_POLICY_PID;
1233 static int devid_cmp(void *priv, const struct list_head *a,
1234 const struct list_head *b)
1236 const struct btrfs_device *dev1, *dev2;
1238 dev1 = list_entry(a, struct btrfs_device, dev_list);
1239 dev2 = list_entry(b, struct btrfs_device, dev_list);
1241 if (dev1->devid < dev2->devid)
1243 else if (dev1->devid > dev2->devid)
1248 int btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
1249 fmode_t flags, void *holder)
1253 lockdep_assert_held(&uuid_mutex);
1255 * The device_list_mutex cannot be taken here in case opening the
1256 * underlying device takes further locks like open_mutex.
1258 * We also don't need the lock here as this is called during mount and
1259 * exclusion is provided by uuid_mutex
1262 if (fs_devices->opened) {
1263 fs_devices->opened++;
1266 list_sort(NULL, &fs_devices->devices, devid_cmp);
1267 ret = open_fs_devices(fs_devices, flags, holder);
1273 void btrfs_release_disk_super(struct btrfs_super_block *super)
1275 struct page *page = virt_to_page(super);
1280 static struct btrfs_super_block *btrfs_read_disk_super(struct block_device *bdev,
1281 u64 bytenr, u64 bytenr_orig)
1283 struct btrfs_super_block *disk_super;
1288 /* make sure our super fits in the device */
1289 if (bytenr + PAGE_SIZE >= i_size_read(bdev->bd_inode))
1290 return ERR_PTR(-EINVAL);
1292 /* make sure our super fits in the page */
1293 if (sizeof(*disk_super) > PAGE_SIZE)
1294 return ERR_PTR(-EINVAL);
1296 /* make sure our super doesn't straddle pages on disk */
1297 index = bytenr >> PAGE_SHIFT;
1298 if ((bytenr + sizeof(*disk_super) - 1) >> PAGE_SHIFT != index)
1299 return ERR_PTR(-EINVAL);
1301 /* pull in the page with our super */
1302 page = read_cache_page_gfp(bdev->bd_inode->i_mapping, index, GFP_KERNEL);
1305 return ERR_CAST(page);
1307 p = page_address(page);
1309 /* align our pointer to the offset of the super block */
1310 disk_super = p + offset_in_page(bytenr);
1312 if (btrfs_super_bytenr(disk_super) != bytenr_orig ||
1313 btrfs_super_magic(disk_super) != BTRFS_MAGIC) {
1314 btrfs_release_disk_super(p);
1315 return ERR_PTR(-EINVAL);
1318 if (disk_super->label[0] && disk_super->label[BTRFS_LABEL_SIZE - 1])
1319 disk_super->label[BTRFS_LABEL_SIZE - 1] = 0;
1324 int btrfs_forget_devices(const char *path)
1328 mutex_lock(&uuid_mutex);
1329 ret = btrfs_free_stale_devices(strlen(path) ? path : NULL, NULL);
1330 mutex_unlock(&uuid_mutex);
1336 * Look for a btrfs signature on a device. This may be called out of the mount path
1337 * and we are not allowed to call set_blocksize during the scan. The superblock
1338 * is read via pagecache
1340 struct btrfs_device *btrfs_scan_one_device(const char *path, fmode_t flags,
1343 struct btrfs_super_block *disk_super;
1344 bool new_device_added = false;
1345 struct btrfs_device *device = NULL;
1346 struct block_device *bdev;
1347 u64 bytenr, bytenr_orig;
1350 lockdep_assert_held(&uuid_mutex);
1353 * we would like to check all the supers, but that would make
1354 * a btrfs mount succeed after a mkfs from a different FS.
1355 * So, we need to add a special mount option to scan for
1356 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
1358 flags |= FMODE_EXCL;
1360 bdev = blkdev_get_by_path(path, flags, holder);
1362 return ERR_CAST(bdev);
1364 bytenr_orig = btrfs_sb_offset(0);
1365 ret = btrfs_sb_log_location_bdev(bdev, 0, READ, &bytenr);
1367 return ERR_PTR(ret);
1369 disk_super = btrfs_read_disk_super(bdev, bytenr, bytenr_orig);
1370 if (IS_ERR(disk_super)) {
1371 device = ERR_CAST(disk_super);
1372 goto error_bdev_put;
1375 device = device_list_add(path, disk_super, &new_device_added);
1376 if (!IS_ERR(device)) {
1377 if (new_device_added)
1378 btrfs_free_stale_devices(path, device);
1381 btrfs_release_disk_super(disk_super);
1384 blkdev_put(bdev, flags);
1390 * Try to find a chunk that intersects [start, start + len] range and when one
1391 * such is found, record the end of it in *start
1393 static bool contains_pending_extent(struct btrfs_device *device, u64 *start,
1396 u64 physical_start, physical_end;
1398 lockdep_assert_held(&device->fs_info->chunk_mutex);
1400 if (!find_first_extent_bit(&device->alloc_state, *start,
1401 &physical_start, &physical_end,
1402 CHUNK_ALLOCATED, NULL)) {
1404 if (in_range(physical_start, *start, len) ||
1405 in_range(*start, physical_start,
1406 physical_end - physical_start)) {
1407 *start = physical_end + 1;
1414 static u64 dev_extent_search_start(struct btrfs_device *device, u64 start)
1416 switch (device->fs_devices->chunk_alloc_policy) {
1417 case BTRFS_CHUNK_ALLOC_REGULAR:
1419 * We don't want to overwrite the superblock on the drive nor
1420 * any area used by the boot loader (grub for example), so we
1421 * make sure to start at an offset of at least 1MB.
1423 return max_t(u64, start, SZ_1M);
1424 case BTRFS_CHUNK_ALLOC_ZONED:
1426 * We don't care about the starting region like regular
1427 * allocator, because we anyway use/reserve the first two zones
1428 * for superblock logging.
1430 return ALIGN(start, device->zone_info->zone_size);
1436 static bool dev_extent_hole_check_zoned(struct btrfs_device *device,
1437 u64 *hole_start, u64 *hole_size,
1440 u64 zone_size = device->zone_info->zone_size;
1443 bool changed = false;
1445 ASSERT(IS_ALIGNED(*hole_start, zone_size));
1447 while (*hole_size > 0) {
1448 pos = btrfs_find_allocatable_zones(device, *hole_start,
1449 *hole_start + *hole_size,
1451 if (pos != *hole_start) {
1452 *hole_size = *hole_start + *hole_size - pos;
1455 if (*hole_size < num_bytes)
1459 ret = btrfs_ensure_empty_zones(device, pos, num_bytes);
1461 /* Range is ensured to be empty */
1465 /* Given hole range was invalid (outside of device) */
1466 if (ret == -ERANGE) {
1467 *hole_start += *hole_size;
1472 *hole_start += zone_size;
1473 *hole_size -= zone_size;
1481 * dev_extent_hole_check - check if specified hole is suitable for allocation
1482 * @device: the device which we have the hole
1483 * @hole_start: starting position of the hole
1484 * @hole_size: the size of the hole
1485 * @num_bytes: the size of the free space that we need
1487 * This function may modify @hole_start and @hole_size to reflect the suitable
1488 * position for allocation. Returns 1 if hole position is updated, 0 otherwise.
1490 static bool dev_extent_hole_check(struct btrfs_device *device, u64 *hole_start,
1491 u64 *hole_size, u64 num_bytes)
1493 bool changed = false;
1494 u64 hole_end = *hole_start + *hole_size;
1498 * Check before we set max_hole_start, otherwise we could end up
1499 * sending back this offset anyway.
1501 if (contains_pending_extent(device, hole_start, *hole_size)) {
1502 if (hole_end >= *hole_start)
1503 *hole_size = hole_end - *hole_start;
1509 switch (device->fs_devices->chunk_alloc_policy) {
1510 case BTRFS_CHUNK_ALLOC_REGULAR:
1511 /* No extra check */
1513 case BTRFS_CHUNK_ALLOC_ZONED:
1514 if (dev_extent_hole_check_zoned(device, hole_start,
1515 hole_size, num_bytes)) {
1518 * The changed hole can contain pending extent.
1519 * Loop again to check that.
1535 * find_free_dev_extent_start - find free space in the specified device
1536 * @device: the device which we search the free space in
1537 * @num_bytes: the size of the free space that we need
1538 * @search_start: the position from which to begin the search
1539 * @start: store the start of the free space.
1540 * @len: the size of the free space. that we find, or the size
1541 * of the max free space if we don't find suitable free space
1543 * this uses a pretty simple search, the expectation is that it is
1544 * called very infrequently and that a given device has a small number
1547 * @start is used to store the start of the free space if we find. But if we
1548 * don't find suitable free space, it will be used to store the start position
1549 * of the max free space.
1551 * @len is used to store the size of the free space that we find.
1552 * But if we don't find suitable free space, it is used to store the size of
1553 * the max free space.
1555 * NOTE: This function will search *commit* root of device tree, and does extra
1556 * check to ensure dev extents are not double allocated.
1557 * This makes the function safe to allocate dev extents but may not report
1558 * correct usable device space, as device extent freed in current transaction
1559 * is not reported as available.
1561 static int find_free_dev_extent_start(struct btrfs_device *device,
1562 u64 num_bytes, u64 search_start, u64 *start,
1565 struct btrfs_fs_info *fs_info = device->fs_info;
1566 struct btrfs_root *root = fs_info->dev_root;
1567 struct btrfs_key key;
1568 struct btrfs_dev_extent *dev_extent;
1569 struct btrfs_path *path;
1574 u64 search_end = device->total_bytes;
1577 struct extent_buffer *l;
1579 search_start = dev_extent_search_start(device, search_start);
1581 WARN_ON(device->zone_info &&
1582 !IS_ALIGNED(num_bytes, device->zone_info->zone_size));
1584 path = btrfs_alloc_path();
1588 max_hole_start = search_start;
1592 if (search_start >= search_end ||
1593 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
1598 path->reada = READA_FORWARD;
1599 path->search_commit_root = 1;
1600 path->skip_locking = 1;
1602 key.objectid = device->devid;
1603 key.offset = search_start;
1604 key.type = BTRFS_DEV_EXTENT_KEY;
1606 ret = btrfs_search_backwards(root, &key, path);
1612 slot = path->slots[0];
1613 if (slot >= btrfs_header_nritems(l)) {
1614 ret = btrfs_next_leaf(root, path);
1622 btrfs_item_key_to_cpu(l, &key, slot);
1624 if (key.objectid < device->devid)
1627 if (key.objectid > device->devid)
1630 if (key.type != BTRFS_DEV_EXTENT_KEY)
1633 if (key.offset > search_start) {
1634 hole_size = key.offset - search_start;
1635 dev_extent_hole_check(device, &search_start, &hole_size,
1638 if (hole_size > max_hole_size) {
1639 max_hole_start = search_start;
1640 max_hole_size = hole_size;
1644 * If this free space is greater than which we need,
1645 * it must be the max free space that we have found
1646 * until now, so max_hole_start must point to the start
1647 * of this free space and the length of this free space
1648 * is stored in max_hole_size. Thus, we return
1649 * max_hole_start and max_hole_size and go back to the
1652 if (hole_size >= num_bytes) {
1658 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1659 extent_end = key.offset + btrfs_dev_extent_length(l,
1661 if (extent_end > search_start)
1662 search_start = extent_end;
1669 * At this point, search_start should be the end of
1670 * allocated dev extents, and when shrinking the device,
1671 * search_end may be smaller than search_start.
1673 if (search_end > search_start) {
1674 hole_size = search_end - search_start;
1675 if (dev_extent_hole_check(device, &search_start, &hole_size,
1677 btrfs_release_path(path);
1681 if (hole_size > max_hole_size) {
1682 max_hole_start = search_start;
1683 max_hole_size = hole_size;
1688 if (max_hole_size < num_bytes)
1694 btrfs_free_path(path);
1695 *start = max_hole_start;
1697 *len = max_hole_size;
1701 int find_free_dev_extent(struct btrfs_device *device, u64 num_bytes,
1702 u64 *start, u64 *len)
1704 /* FIXME use last free of some kind */
1705 return find_free_dev_extent_start(device, num_bytes, 0, start, len);
1708 static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans,
1709 struct btrfs_device *device,
1710 u64 start, u64 *dev_extent_len)
1712 struct btrfs_fs_info *fs_info = device->fs_info;
1713 struct btrfs_root *root = fs_info->dev_root;
1715 struct btrfs_path *path;
1716 struct btrfs_key key;
1717 struct btrfs_key found_key;
1718 struct extent_buffer *leaf = NULL;
1719 struct btrfs_dev_extent *extent = NULL;
1721 path = btrfs_alloc_path();
1725 key.objectid = device->devid;
1727 key.type = BTRFS_DEV_EXTENT_KEY;
1729 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1731 ret = btrfs_previous_item(root, path, key.objectid,
1732 BTRFS_DEV_EXTENT_KEY);
1735 leaf = path->nodes[0];
1736 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1737 extent = btrfs_item_ptr(leaf, path->slots[0],
1738 struct btrfs_dev_extent);
1739 BUG_ON(found_key.offset > start || found_key.offset +
1740 btrfs_dev_extent_length(leaf, extent) < start);
1742 btrfs_release_path(path);
1744 } else if (ret == 0) {
1745 leaf = path->nodes[0];
1746 extent = btrfs_item_ptr(leaf, path->slots[0],
1747 struct btrfs_dev_extent);
1752 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1754 ret = btrfs_del_item(trans, root, path);
1756 set_bit(BTRFS_TRANS_HAVE_FREE_BGS, &trans->transaction->flags);
1758 btrfs_free_path(path);
1762 static u64 find_next_chunk(struct btrfs_fs_info *fs_info)
1764 struct extent_map_tree *em_tree;
1765 struct extent_map *em;
1769 em_tree = &fs_info->mapping_tree;
1770 read_lock(&em_tree->lock);
1771 n = rb_last(&em_tree->map.rb_root);
1773 em = rb_entry(n, struct extent_map, rb_node);
1774 ret = em->start + em->len;
1776 read_unlock(&em_tree->lock);
1781 static noinline int find_next_devid(struct btrfs_fs_info *fs_info,
1785 struct btrfs_key key;
1786 struct btrfs_key found_key;
1787 struct btrfs_path *path;
1789 path = btrfs_alloc_path();
1793 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1794 key.type = BTRFS_DEV_ITEM_KEY;
1795 key.offset = (u64)-1;
1797 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
1803 btrfs_err(fs_info, "corrupted chunk tree devid -1 matched");
1808 ret = btrfs_previous_item(fs_info->chunk_root, path,
1809 BTRFS_DEV_ITEMS_OBJECTID,
1810 BTRFS_DEV_ITEM_KEY);
1814 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1816 *devid_ret = found_key.offset + 1;
1820 btrfs_free_path(path);
1825 * the device information is stored in the chunk root
1826 * the btrfs_device struct should be fully filled in
1828 static int btrfs_add_dev_item(struct btrfs_trans_handle *trans,
1829 struct btrfs_device *device)
1832 struct btrfs_path *path;
1833 struct btrfs_dev_item *dev_item;
1834 struct extent_buffer *leaf;
1835 struct btrfs_key key;
1838 path = btrfs_alloc_path();
1842 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1843 key.type = BTRFS_DEV_ITEM_KEY;
1844 key.offset = device->devid;
1846 ret = btrfs_insert_empty_item(trans, trans->fs_info->chunk_root, path,
1847 &key, sizeof(*dev_item));
1851 leaf = path->nodes[0];
1852 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1854 btrfs_set_device_id(leaf, dev_item, device->devid);
1855 btrfs_set_device_generation(leaf, dev_item, 0);
1856 btrfs_set_device_type(leaf, dev_item, device->type);
1857 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1858 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1859 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1860 btrfs_set_device_total_bytes(leaf, dev_item,
1861 btrfs_device_get_disk_total_bytes(device));
1862 btrfs_set_device_bytes_used(leaf, dev_item,
1863 btrfs_device_get_bytes_used(device));
1864 btrfs_set_device_group(leaf, dev_item, 0);
1865 btrfs_set_device_seek_speed(leaf, dev_item, 0);
1866 btrfs_set_device_bandwidth(leaf, dev_item, 0);
1867 btrfs_set_device_start_offset(leaf, dev_item, 0);
1869 ptr = btrfs_device_uuid(dev_item);
1870 write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
1871 ptr = btrfs_device_fsid(dev_item);
1872 write_extent_buffer(leaf, trans->fs_info->fs_devices->metadata_uuid,
1873 ptr, BTRFS_FSID_SIZE);
1874 btrfs_mark_buffer_dirty(leaf);
1878 btrfs_free_path(path);
1883 * Function to update ctime/mtime for a given device path.
1884 * Mainly used for ctime/mtime based probe like libblkid.
1886 static void update_dev_time(struct block_device *bdev)
1888 struct inode *inode = bdev->bd_inode;
1889 struct timespec64 now;
1891 /* Shouldn't happen but just in case. */
1895 now = current_time(inode);
1896 generic_update_time(inode, &now, S_MTIME | S_CTIME);
1899 static int btrfs_rm_dev_item(struct btrfs_device *device)
1901 struct btrfs_root *root = device->fs_info->chunk_root;
1903 struct btrfs_path *path;
1904 struct btrfs_key key;
1905 struct btrfs_trans_handle *trans;
1907 path = btrfs_alloc_path();
1911 trans = btrfs_start_transaction(root, 0);
1912 if (IS_ERR(trans)) {
1913 btrfs_free_path(path);
1914 return PTR_ERR(trans);
1916 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1917 key.type = BTRFS_DEV_ITEM_KEY;
1918 key.offset = device->devid;
1920 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1924 btrfs_abort_transaction(trans, ret);
1925 btrfs_end_transaction(trans);
1929 ret = btrfs_del_item(trans, root, path);
1931 btrfs_abort_transaction(trans, ret);
1932 btrfs_end_transaction(trans);
1936 btrfs_free_path(path);
1938 ret = btrfs_commit_transaction(trans);
1943 * Verify that @num_devices satisfies the RAID profile constraints in the whole
1944 * filesystem. It's up to the caller to adjust that number regarding eg. device
1947 static int btrfs_check_raid_min_devices(struct btrfs_fs_info *fs_info,
1955 seq = read_seqbegin(&fs_info->profiles_lock);
1957 all_avail = fs_info->avail_data_alloc_bits |
1958 fs_info->avail_system_alloc_bits |
1959 fs_info->avail_metadata_alloc_bits;
1960 } while (read_seqretry(&fs_info->profiles_lock, seq));
1962 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
1963 if (!(all_avail & btrfs_raid_array[i].bg_flag))
1966 if (num_devices < btrfs_raid_array[i].devs_min)
1967 return btrfs_raid_array[i].mindev_error;
1973 static struct btrfs_device * btrfs_find_next_active_device(
1974 struct btrfs_fs_devices *fs_devs, struct btrfs_device *device)
1976 struct btrfs_device *next_device;
1978 list_for_each_entry(next_device, &fs_devs->devices, dev_list) {
1979 if (next_device != device &&
1980 !test_bit(BTRFS_DEV_STATE_MISSING, &next_device->dev_state)
1981 && next_device->bdev)
1989 * Helper function to check if the given device is part of s_bdev / latest_bdev
1990 * and replace it with the provided or the next active device, in the context
1991 * where this function called, there should be always be another device (or
1992 * this_dev) which is active.
1994 void __cold btrfs_assign_next_active_device(struct btrfs_device *device,
1995 struct btrfs_device *next_device)
1997 struct btrfs_fs_info *fs_info = device->fs_info;
2000 next_device = btrfs_find_next_active_device(fs_info->fs_devices,
2002 ASSERT(next_device);
2004 if (fs_info->sb->s_bdev &&
2005 (fs_info->sb->s_bdev == device->bdev))
2006 fs_info->sb->s_bdev = next_device->bdev;
2008 if (fs_info->fs_devices->latest_bdev == device->bdev)
2009 fs_info->fs_devices->latest_bdev = next_device->bdev;
2013 * Return btrfs_fs_devices::num_devices excluding the device that's being
2014 * currently replaced.
2016 static u64 btrfs_num_devices(struct btrfs_fs_info *fs_info)
2018 u64 num_devices = fs_info->fs_devices->num_devices;
2020 down_read(&fs_info->dev_replace.rwsem);
2021 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) {
2022 ASSERT(num_devices > 1);
2025 up_read(&fs_info->dev_replace.rwsem);
2030 void btrfs_scratch_superblocks(struct btrfs_fs_info *fs_info,
2031 struct block_device *bdev,
2032 const char *device_path)
2034 struct btrfs_super_block *disk_super;
2040 for (copy_num = 0; copy_num < BTRFS_SUPER_MIRROR_MAX; copy_num++) {
2044 disk_super = btrfs_read_dev_one_super(bdev, copy_num);
2045 if (IS_ERR(disk_super))
2048 if (bdev_is_zoned(bdev)) {
2049 btrfs_reset_sb_log_zones(bdev, copy_num);
2053 memset(&disk_super->magic, 0, sizeof(disk_super->magic));
2055 page = virt_to_page(disk_super);
2056 set_page_dirty(page);
2058 /* write_on_page() unlocks the page */
2059 ret = write_one_page(page);
2062 "error clearing superblock number %d (%d)",
2064 btrfs_release_disk_super(disk_super);
2068 /* Notify udev that device has changed */
2069 btrfs_kobject_uevent(bdev, KOBJ_CHANGE);
2071 /* Update ctime/mtime for device path for libblkid */
2072 update_dev_time(bdev);
2075 int btrfs_rm_device(struct btrfs_fs_info *fs_info, const char *device_path,
2076 u64 devid, struct block_device **bdev, fmode_t *mode)
2078 struct btrfs_device *device;
2079 struct btrfs_fs_devices *cur_devices;
2080 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2084 mutex_lock(&uuid_mutex);
2086 num_devices = btrfs_num_devices(fs_info);
2088 ret = btrfs_check_raid_min_devices(fs_info, num_devices - 1);
2092 device = btrfs_find_device_by_devspec(fs_info, devid, device_path);
2094 if (IS_ERR(device)) {
2095 if (PTR_ERR(device) == -ENOENT &&
2096 device_path && strcmp(device_path, "missing") == 0)
2097 ret = BTRFS_ERROR_DEV_MISSING_NOT_FOUND;
2099 ret = PTR_ERR(device);
2103 if (btrfs_pinned_by_swapfile(fs_info, device)) {
2104 btrfs_warn_in_rcu(fs_info,
2105 "cannot remove device %s (devid %llu) due to active swapfile",
2106 rcu_str_deref(device->name), device->devid);
2111 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
2112 ret = BTRFS_ERROR_DEV_TGT_REPLACE;
2116 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
2117 fs_info->fs_devices->rw_devices == 1) {
2118 ret = BTRFS_ERROR_DEV_ONLY_WRITABLE;
2122 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2123 mutex_lock(&fs_info->chunk_mutex);
2124 list_del_init(&device->dev_alloc_list);
2125 device->fs_devices->rw_devices--;
2126 mutex_unlock(&fs_info->chunk_mutex);
2129 mutex_unlock(&uuid_mutex);
2130 ret = btrfs_shrink_device(device, 0);
2132 btrfs_reada_remove_dev(device);
2133 mutex_lock(&uuid_mutex);
2138 * TODO: the superblock still includes this device in its num_devices
2139 * counter although write_all_supers() is not locked out. This
2140 * could give a filesystem state which requires a degraded mount.
2142 ret = btrfs_rm_dev_item(device);
2146 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2147 btrfs_scrub_cancel_dev(device);
2150 * the device list mutex makes sure that we don't change
2151 * the device list while someone else is writing out all
2152 * the device supers. Whoever is writing all supers, should
2153 * lock the device list mutex before getting the number of
2154 * devices in the super block (super_copy). Conversely,
2155 * whoever updates the number of devices in the super block
2156 * (super_copy) should hold the device list mutex.
2160 * In normal cases the cur_devices == fs_devices. But in case
2161 * of deleting a seed device, the cur_devices should point to
2162 * its own fs_devices listed under the fs_devices->seed.
2164 cur_devices = device->fs_devices;
2165 mutex_lock(&fs_devices->device_list_mutex);
2166 list_del_rcu(&device->dev_list);
2168 cur_devices->num_devices--;
2169 cur_devices->total_devices--;
2170 /* Update total_devices of the parent fs_devices if it's seed */
2171 if (cur_devices != fs_devices)
2172 fs_devices->total_devices--;
2174 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state))
2175 cur_devices->missing_devices--;
2177 btrfs_assign_next_active_device(device, NULL);
2180 cur_devices->open_devices--;
2181 /* remove sysfs entry */
2182 btrfs_sysfs_remove_device(device);
2185 num_devices = btrfs_super_num_devices(fs_info->super_copy) - 1;
2186 btrfs_set_super_num_devices(fs_info->super_copy, num_devices);
2187 mutex_unlock(&fs_devices->device_list_mutex);
2190 * At this point, the device is zero sized and detached from the
2191 * devices list. All that's left is to zero out the old supers and
2194 * We cannot call btrfs_close_bdev() here because we're holding the sb
2195 * write lock, and blkdev_put() will pull in the ->open_mutex on the
2196 * block device and it's dependencies. Instead just flush the device
2197 * and let the caller do the final blkdev_put.
2199 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2200 btrfs_scratch_superblocks(fs_info, device->bdev,
2203 sync_blockdev(device->bdev);
2204 invalidate_bdev(device->bdev);
2208 *bdev = device->bdev;
2209 *mode = device->mode;
2211 btrfs_free_device(device);
2213 if (cur_devices->open_devices == 0) {
2214 list_del_init(&cur_devices->seed_list);
2215 close_fs_devices(cur_devices);
2216 free_fs_devices(cur_devices);
2220 mutex_unlock(&uuid_mutex);
2224 btrfs_reada_undo_remove_dev(device);
2225 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2226 mutex_lock(&fs_info->chunk_mutex);
2227 list_add(&device->dev_alloc_list,
2228 &fs_devices->alloc_list);
2229 device->fs_devices->rw_devices++;
2230 mutex_unlock(&fs_info->chunk_mutex);
2235 void btrfs_rm_dev_replace_remove_srcdev(struct btrfs_device *srcdev)
2237 struct btrfs_fs_devices *fs_devices;
2239 lockdep_assert_held(&srcdev->fs_info->fs_devices->device_list_mutex);
2242 * in case of fs with no seed, srcdev->fs_devices will point
2243 * to fs_devices of fs_info. However when the dev being replaced is
2244 * a seed dev it will point to the seed's local fs_devices. In short
2245 * srcdev will have its correct fs_devices in both the cases.
2247 fs_devices = srcdev->fs_devices;
2249 list_del_rcu(&srcdev->dev_list);
2250 list_del(&srcdev->dev_alloc_list);
2251 fs_devices->num_devices--;
2252 if (test_bit(BTRFS_DEV_STATE_MISSING, &srcdev->dev_state))
2253 fs_devices->missing_devices--;
2255 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state))
2256 fs_devices->rw_devices--;
2259 fs_devices->open_devices--;
2262 void btrfs_rm_dev_replace_free_srcdev(struct btrfs_device *srcdev)
2264 struct btrfs_fs_devices *fs_devices = srcdev->fs_devices;
2266 mutex_lock(&uuid_mutex);
2268 btrfs_close_bdev(srcdev);
2270 btrfs_free_device(srcdev);
2272 /* if this is no devs we rather delete the fs_devices */
2273 if (!fs_devices->num_devices) {
2275 * On a mounted FS, num_devices can't be zero unless it's a
2276 * seed. In case of a seed device being replaced, the replace
2277 * target added to the sprout FS, so there will be no more
2278 * device left under the seed FS.
2280 ASSERT(fs_devices->seeding);
2282 list_del_init(&fs_devices->seed_list);
2283 close_fs_devices(fs_devices);
2284 free_fs_devices(fs_devices);
2286 mutex_unlock(&uuid_mutex);
2289 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_device *tgtdev)
2291 struct btrfs_fs_devices *fs_devices = tgtdev->fs_info->fs_devices;
2293 mutex_lock(&fs_devices->device_list_mutex);
2295 btrfs_sysfs_remove_device(tgtdev);
2298 fs_devices->open_devices--;
2300 fs_devices->num_devices--;
2302 btrfs_assign_next_active_device(tgtdev, NULL);
2304 list_del_rcu(&tgtdev->dev_list);
2306 mutex_unlock(&fs_devices->device_list_mutex);
2309 * The update_dev_time() with in btrfs_scratch_superblocks()
2310 * may lead to a call to btrfs_show_devname() which will try
2311 * to hold device_list_mutex. And here this device
2312 * is already out of device list, so we don't have to hold
2313 * the device_list_mutex lock.
2315 btrfs_scratch_superblocks(tgtdev->fs_info, tgtdev->bdev,
2318 btrfs_close_bdev(tgtdev);
2320 btrfs_free_device(tgtdev);
2323 static struct btrfs_device *btrfs_find_device_by_path(
2324 struct btrfs_fs_info *fs_info, const char *device_path)
2327 struct btrfs_super_block *disk_super;
2330 struct block_device *bdev;
2331 struct btrfs_device *device;
2333 ret = btrfs_get_bdev_and_sb(device_path, FMODE_READ,
2334 fs_info->bdev_holder, 0, &bdev, &disk_super);
2336 return ERR_PTR(ret);
2338 devid = btrfs_stack_device_id(&disk_super->dev_item);
2339 dev_uuid = disk_super->dev_item.uuid;
2340 if (btrfs_fs_incompat(fs_info, METADATA_UUID))
2341 device = btrfs_find_device(fs_info->fs_devices, devid, dev_uuid,
2342 disk_super->metadata_uuid);
2344 device = btrfs_find_device(fs_info->fs_devices, devid, dev_uuid,
2347 btrfs_release_disk_super(disk_super);
2349 device = ERR_PTR(-ENOENT);
2350 blkdev_put(bdev, FMODE_READ);
2355 * Lookup a device given by device id, or the path if the id is 0.
2357 struct btrfs_device *btrfs_find_device_by_devspec(
2358 struct btrfs_fs_info *fs_info, u64 devid,
2359 const char *device_path)
2361 struct btrfs_device *device;
2364 device = btrfs_find_device(fs_info->fs_devices, devid, NULL,
2367 return ERR_PTR(-ENOENT);
2371 if (!device_path || !device_path[0])
2372 return ERR_PTR(-EINVAL);
2374 if (strcmp(device_path, "missing") == 0) {
2375 /* Find first missing device */
2376 list_for_each_entry(device, &fs_info->fs_devices->devices,
2378 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
2379 &device->dev_state) && !device->bdev)
2382 return ERR_PTR(-ENOENT);
2385 return btrfs_find_device_by_path(fs_info, device_path);
2389 * does all the dirty work required for changing file system's UUID.
2391 static int btrfs_prepare_sprout(struct btrfs_fs_info *fs_info)
2393 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2394 struct btrfs_fs_devices *old_devices;
2395 struct btrfs_fs_devices *seed_devices;
2396 struct btrfs_super_block *disk_super = fs_info->super_copy;
2397 struct btrfs_device *device;
2400 lockdep_assert_held(&uuid_mutex);
2401 if (!fs_devices->seeding)
2405 * Private copy of the seed devices, anchored at
2406 * fs_info->fs_devices->seed_list
2408 seed_devices = alloc_fs_devices(NULL, NULL);
2409 if (IS_ERR(seed_devices))
2410 return PTR_ERR(seed_devices);
2413 * It's necessary to retain a copy of the original seed fs_devices in
2414 * fs_uuids so that filesystems which have been seeded can successfully
2415 * reference the seed device from open_seed_devices. This also supports
2418 old_devices = clone_fs_devices(fs_devices);
2419 if (IS_ERR(old_devices)) {
2420 kfree(seed_devices);
2421 return PTR_ERR(old_devices);
2424 list_add(&old_devices->fs_list, &fs_uuids);
2426 memcpy(seed_devices, fs_devices, sizeof(*seed_devices));
2427 seed_devices->opened = 1;
2428 INIT_LIST_HEAD(&seed_devices->devices);
2429 INIT_LIST_HEAD(&seed_devices->alloc_list);
2430 mutex_init(&seed_devices->device_list_mutex);
2432 mutex_lock(&fs_devices->device_list_mutex);
2433 list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices,
2435 list_for_each_entry(device, &seed_devices->devices, dev_list)
2436 device->fs_devices = seed_devices;
2438 fs_devices->seeding = false;
2439 fs_devices->num_devices = 0;
2440 fs_devices->open_devices = 0;
2441 fs_devices->missing_devices = 0;
2442 fs_devices->rotating = false;
2443 list_add(&seed_devices->seed_list, &fs_devices->seed_list);
2445 generate_random_uuid(fs_devices->fsid);
2446 memcpy(fs_devices->metadata_uuid, fs_devices->fsid, BTRFS_FSID_SIZE);
2447 memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2448 mutex_unlock(&fs_devices->device_list_mutex);
2450 super_flags = btrfs_super_flags(disk_super) &
2451 ~BTRFS_SUPER_FLAG_SEEDING;
2452 btrfs_set_super_flags(disk_super, super_flags);
2458 * Store the expected generation for seed devices in device items.
2460 static int btrfs_finish_sprout(struct btrfs_trans_handle *trans)
2462 struct btrfs_fs_info *fs_info = trans->fs_info;
2463 struct btrfs_root *root = fs_info->chunk_root;
2464 struct btrfs_path *path;
2465 struct extent_buffer *leaf;
2466 struct btrfs_dev_item *dev_item;
2467 struct btrfs_device *device;
2468 struct btrfs_key key;
2469 u8 fs_uuid[BTRFS_FSID_SIZE];
2470 u8 dev_uuid[BTRFS_UUID_SIZE];
2474 path = btrfs_alloc_path();
2478 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2480 key.type = BTRFS_DEV_ITEM_KEY;
2483 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2487 leaf = path->nodes[0];
2489 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
2490 ret = btrfs_next_leaf(root, path);
2495 leaf = path->nodes[0];
2496 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2497 btrfs_release_path(path);
2501 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2502 if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID ||
2503 key.type != BTRFS_DEV_ITEM_KEY)
2506 dev_item = btrfs_item_ptr(leaf, path->slots[0],
2507 struct btrfs_dev_item);
2508 devid = btrfs_device_id(leaf, dev_item);
2509 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
2511 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
2513 device = btrfs_find_device(fs_info->fs_devices, devid, dev_uuid,
2515 BUG_ON(!device); /* Logic error */
2517 if (device->fs_devices->seeding) {
2518 btrfs_set_device_generation(leaf, dev_item,
2519 device->generation);
2520 btrfs_mark_buffer_dirty(leaf);
2528 btrfs_free_path(path);
2532 int btrfs_init_new_device(struct btrfs_fs_info *fs_info, const char *device_path)
2534 struct btrfs_root *root = fs_info->dev_root;
2535 struct request_queue *q;
2536 struct btrfs_trans_handle *trans;
2537 struct btrfs_device *device;
2538 struct block_device *bdev;
2539 struct super_block *sb = fs_info->sb;
2540 struct rcu_string *name;
2541 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2542 u64 orig_super_total_bytes;
2543 u64 orig_super_num_devices;
2544 int seeding_dev = 0;
2546 bool locked = false;
2548 if (sb_rdonly(sb) && !fs_devices->seeding)
2551 bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
2552 fs_info->bdev_holder);
2554 return PTR_ERR(bdev);
2556 if (!btrfs_check_device_zone_type(fs_info, bdev)) {
2561 if (fs_devices->seeding) {
2563 down_write(&sb->s_umount);
2564 mutex_lock(&uuid_mutex);
2568 sync_blockdev(bdev);
2571 list_for_each_entry_rcu(device, &fs_devices->devices, dev_list) {
2572 if (device->bdev == bdev) {
2580 device = btrfs_alloc_device(fs_info, NULL, NULL);
2581 if (IS_ERR(device)) {
2582 /* we can safely leave the fs_devices entry around */
2583 ret = PTR_ERR(device);
2587 name = rcu_string_strdup(device_path, GFP_KERNEL);
2590 goto error_free_device;
2592 rcu_assign_pointer(device->name, name);
2594 device->fs_info = fs_info;
2595 device->bdev = bdev;
2597 ret = btrfs_get_dev_zone_info(device);
2599 goto error_free_device;
2601 trans = btrfs_start_transaction(root, 0);
2602 if (IS_ERR(trans)) {
2603 ret = PTR_ERR(trans);
2604 goto error_free_zone;
2607 q = bdev_get_queue(bdev);
2608 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
2609 device->generation = trans->transid;
2610 device->io_width = fs_info->sectorsize;
2611 device->io_align = fs_info->sectorsize;
2612 device->sector_size = fs_info->sectorsize;
2613 device->total_bytes = round_down(i_size_read(bdev->bd_inode),
2614 fs_info->sectorsize);
2615 device->disk_total_bytes = device->total_bytes;
2616 device->commit_total_bytes = device->total_bytes;
2617 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2618 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
2619 device->mode = FMODE_EXCL;
2620 device->dev_stats_valid = 1;
2621 set_blocksize(device->bdev, BTRFS_BDEV_BLOCKSIZE);
2624 btrfs_clear_sb_rdonly(sb);
2625 ret = btrfs_prepare_sprout(fs_info);
2627 btrfs_abort_transaction(trans, ret);
2632 device->fs_devices = fs_devices;
2634 mutex_lock(&fs_devices->device_list_mutex);
2635 mutex_lock(&fs_info->chunk_mutex);
2636 list_add_rcu(&device->dev_list, &fs_devices->devices);
2637 list_add(&device->dev_alloc_list, &fs_devices->alloc_list);
2638 fs_devices->num_devices++;
2639 fs_devices->open_devices++;
2640 fs_devices->rw_devices++;
2641 fs_devices->total_devices++;
2642 fs_devices->total_rw_bytes += device->total_bytes;
2644 atomic64_add(device->total_bytes, &fs_info->free_chunk_space);
2646 if (!blk_queue_nonrot(q))
2647 fs_devices->rotating = true;
2649 orig_super_total_bytes = btrfs_super_total_bytes(fs_info->super_copy);
2650 btrfs_set_super_total_bytes(fs_info->super_copy,
2651 round_down(orig_super_total_bytes + device->total_bytes,
2652 fs_info->sectorsize));
2654 orig_super_num_devices = btrfs_super_num_devices(fs_info->super_copy);
2655 btrfs_set_super_num_devices(fs_info->super_copy,
2656 orig_super_num_devices + 1);
2659 * we've got more storage, clear any full flags on the space
2662 btrfs_clear_space_info_full(fs_info);
2664 mutex_unlock(&fs_info->chunk_mutex);
2666 /* Add sysfs device entry */
2667 btrfs_sysfs_add_device(device);
2669 mutex_unlock(&fs_devices->device_list_mutex);
2672 mutex_lock(&fs_info->chunk_mutex);
2673 ret = init_first_rw_device(trans);
2674 mutex_unlock(&fs_info->chunk_mutex);
2676 btrfs_abort_transaction(trans, ret);
2681 ret = btrfs_add_dev_item(trans, device);
2683 btrfs_abort_transaction(trans, ret);
2688 ret = btrfs_finish_sprout(trans);
2690 btrfs_abort_transaction(trans, ret);
2695 * fs_devices now represents the newly sprouted filesystem and
2696 * its fsid has been changed by btrfs_prepare_sprout
2698 btrfs_sysfs_update_sprout_fsid(fs_devices);
2701 ret = btrfs_commit_transaction(trans);
2704 mutex_unlock(&uuid_mutex);
2705 up_write(&sb->s_umount);
2708 if (ret) /* transaction commit */
2711 ret = btrfs_relocate_sys_chunks(fs_info);
2713 btrfs_handle_fs_error(fs_info, ret,
2714 "Failed to relocate sys chunks after device initialization. This can be fixed using the \"btrfs balance\" command.");
2715 trans = btrfs_attach_transaction(root);
2716 if (IS_ERR(trans)) {
2717 if (PTR_ERR(trans) == -ENOENT)
2719 ret = PTR_ERR(trans);
2723 ret = btrfs_commit_transaction(trans);
2727 * Now that we have written a new super block to this device, check all
2728 * other fs_devices list if device_path alienates any other scanned
2730 * We can ignore the return value as it typically returns -EINVAL and
2731 * only succeeds if the device was an alien.
2733 btrfs_forget_devices(device_path);
2735 /* Update ctime/mtime for blkid or udev */
2736 update_dev_time(bdev);
2741 btrfs_sysfs_remove_device(device);
2742 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2743 mutex_lock(&fs_info->chunk_mutex);
2744 list_del_rcu(&device->dev_list);
2745 list_del(&device->dev_alloc_list);
2746 fs_info->fs_devices->num_devices--;
2747 fs_info->fs_devices->open_devices--;
2748 fs_info->fs_devices->rw_devices--;
2749 fs_info->fs_devices->total_devices--;
2750 fs_info->fs_devices->total_rw_bytes -= device->total_bytes;
2751 atomic64_sub(device->total_bytes, &fs_info->free_chunk_space);
2752 btrfs_set_super_total_bytes(fs_info->super_copy,
2753 orig_super_total_bytes);
2754 btrfs_set_super_num_devices(fs_info->super_copy,
2755 orig_super_num_devices);
2756 mutex_unlock(&fs_info->chunk_mutex);
2757 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2760 btrfs_set_sb_rdonly(sb);
2762 btrfs_end_transaction(trans);
2764 btrfs_destroy_dev_zone_info(device);
2766 btrfs_free_device(device);
2768 blkdev_put(bdev, FMODE_EXCL);
2770 mutex_unlock(&uuid_mutex);
2771 up_write(&sb->s_umount);
2776 static noinline int btrfs_update_device(struct btrfs_trans_handle *trans,
2777 struct btrfs_device *device)
2780 struct btrfs_path *path;
2781 struct btrfs_root *root = device->fs_info->chunk_root;
2782 struct btrfs_dev_item *dev_item;
2783 struct extent_buffer *leaf;
2784 struct btrfs_key key;
2786 path = btrfs_alloc_path();
2790 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2791 key.type = BTRFS_DEV_ITEM_KEY;
2792 key.offset = device->devid;
2794 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2803 leaf = path->nodes[0];
2804 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
2806 btrfs_set_device_id(leaf, dev_item, device->devid);
2807 btrfs_set_device_type(leaf, dev_item, device->type);
2808 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
2809 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
2810 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
2811 btrfs_set_device_total_bytes(leaf, dev_item,
2812 btrfs_device_get_disk_total_bytes(device));
2813 btrfs_set_device_bytes_used(leaf, dev_item,
2814 btrfs_device_get_bytes_used(device));
2815 btrfs_mark_buffer_dirty(leaf);
2818 btrfs_free_path(path);
2822 int btrfs_grow_device(struct btrfs_trans_handle *trans,
2823 struct btrfs_device *device, u64 new_size)
2825 struct btrfs_fs_info *fs_info = device->fs_info;
2826 struct btrfs_super_block *super_copy = fs_info->super_copy;
2830 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
2833 new_size = round_down(new_size, fs_info->sectorsize);
2835 mutex_lock(&fs_info->chunk_mutex);
2836 old_total = btrfs_super_total_bytes(super_copy);
2837 diff = round_down(new_size - device->total_bytes, fs_info->sectorsize);
2839 if (new_size <= device->total_bytes ||
2840 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
2841 mutex_unlock(&fs_info->chunk_mutex);
2845 btrfs_set_super_total_bytes(super_copy,
2846 round_down(old_total + diff, fs_info->sectorsize));
2847 device->fs_devices->total_rw_bytes += diff;
2849 btrfs_device_set_total_bytes(device, new_size);
2850 btrfs_device_set_disk_total_bytes(device, new_size);
2851 btrfs_clear_space_info_full(device->fs_info);
2852 if (list_empty(&device->post_commit_list))
2853 list_add_tail(&device->post_commit_list,
2854 &trans->transaction->dev_update_list);
2855 mutex_unlock(&fs_info->chunk_mutex);
2857 return btrfs_update_device(trans, device);
2860 static int btrfs_free_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset)
2862 struct btrfs_fs_info *fs_info = trans->fs_info;
2863 struct btrfs_root *root = fs_info->chunk_root;
2865 struct btrfs_path *path;
2866 struct btrfs_key key;
2868 path = btrfs_alloc_path();
2872 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2873 key.offset = chunk_offset;
2874 key.type = BTRFS_CHUNK_ITEM_KEY;
2876 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2879 else if (ret > 0) { /* Logic error or corruption */
2880 btrfs_handle_fs_error(fs_info, -ENOENT,
2881 "Failed lookup while freeing chunk.");
2886 ret = btrfs_del_item(trans, root, path);
2888 btrfs_handle_fs_error(fs_info, ret,
2889 "Failed to delete chunk item.");
2891 btrfs_free_path(path);
2895 static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
2897 struct btrfs_super_block *super_copy = fs_info->super_copy;
2898 struct btrfs_disk_key *disk_key;
2899 struct btrfs_chunk *chunk;
2906 struct btrfs_key key;
2908 lockdep_assert_held(&fs_info->chunk_mutex);
2909 array_size = btrfs_super_sys_array_size(super_copy);
2911 ptr = super_copy->sys_chunk_array;
2914 while (cur < array_size) {
2915 disk_key = (struct btrfs_disk_key *)ptr;
2916 btrfs_disk_key_to_cpu(&key, disk_key);
2918 len = sizeof(*disk_key);
2920 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
2921 chunk = (struct btrfs_chunk *)(ptr + len);
2922 num_stripes = btrfs_stack_chunk_num_stripes(chunk);
2923 len += btrfs_chunk_item_size(num_stripes);
2928 if (key.objectid == BTRFS_FIRST_CHUNK_TREE_OBJECTID &&
2929 key.offset == chunk_offset) {
2930 memmove(ptr, ptr + len, array_size - (cur + len));
2932 btrfs_set_super_sys_array_size(super_copy, array_size);
2942 * btrfs_get_chunk_map() - Find the mapping containing the given logical extent.
2943 * @logical: Logical block offset in bytes.
2944 * @length: Length of extent in bytes.
2946 * Return: Chunk mapping or ERR_PTR.
2948 struct extent_map *btrfs_get_chunk_map(struct btrfs_fs_info *fs_info,
2949 u64 logical, u64 length)
2951 struct extent_map_tree *em_tree;
2952 struct extent_map *em;
2954 em_tree = &fs_info->mapping_tree;
2955 read_lock(&em_tree->lock);
2956 em = lookup_extent_mapping(em_tree, logical, length);
2957 read_unlock(&em_tree->lock);
2960 btrfs_crit(fs_info, "unable to find logical %llu length %llu",
2962 return ERR_PTR(-EINVAL);
2965 if (em->start > logical || em->start + em->len < logical) {
2967 "found a bad mapping, wanted %llu-%llu, found %llu-%llu",
2968 logical, length, em->start, em->start + em->len);
2969 free_extent_map(em);
2970 return ERR_PTR(-EINVAL);
2973 /* callers are responsible for dropping em's ref. */
2977 static int remove_chunk_item(struct btrfs_trans_handle *trans,
2978 struct map_lookup *map, u64 chunk_offset)
2983 * Removing chunk items and updating the device items in the chunks btree
2984 * requires holding the chunk_mutex.
2985 * See the comment at btrfs_chunk_alloc() for the details.
2987 lockdep_assert_held(&trans->fs_info->chunk_mutex);
2989 for (i = 0; i < map->num_stripes; i++) {
2992 ret = btrfs_update_device(trans, map->stripes[i].dev);
2997 return btrfs_free_chunk(trans, chunk_offset);
3000 int btrfs_remove_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset)
3002 struct btrfs_fs_info *fs_info = trans->fs_info;
3003 struct extent_map *em;
3004 struct map_lookup *map;
3005 u64 dev_extent_len = 0;
3007 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
3009 em = btrfs_get_chunk_map(fs_info, chunk_offset, 1);
3012 * This is a logic error, but we don't want to just rely on the
3013 * user having built with ASSERT enabled, so if ASSERT doesn't
3014 * do anything we still error out.
3019 map = em->map_lookup;
3022 * First delete the device extent items from the devices btree.
3023 * We take the device_list_mutex to avoid racing with the finishing phase
3024 * of a device replace operation. See the comment below before acquiring
3025 * fs_info->chunk_mutex. Note that here we do not acquire the chunk_mutex
3026 * because that can result in a deadlock when deleting the device extent
3027 * items from the devices btree - COWing an extent buffer from the btree
3028 * may result in allocating a new metadata chunk, which would attempt to
3029 * lock again fs_info->chunk_mutex.
3031 mutex_lock(&fs_devices->device_list_mutex);
3032 for (i = 0; i < map->num_stripes; i++) {
3033 struct btrfs_device *device = map->stripes[i].dev;
3034 ret = btrfs_free_dev_extent(trans, device,
3035 map->stripes[i].physical,
3038 mutex_unlock(&fs_devices->device_list_mutex);
3039 btrfs_abort_transaction(trans, ret);
3043 if (device->bytes_used > 0) {
3044 mutex_lock(&fs_info->chunk_mutex);
3045 btrfs_device_set_bytes_used(device,
3046 device->bytes_used - dev_extent_len);
3047 atomic64_add(dev_extent_len, &fs_info->free_chunk_space);
3048 btrfs_clear_space_info_full(fs_info);
3049 mutex_unlock(&fs_info->chunk_mutex);
3052 mutex_unlock(&fs_devices->device_list_mutex);
3055 * We acquire fs_info->chunk_mutex for 2 reasons:
3057 * 1) Just like with the first phase of the chunk allocation, we must
3058 * reserve system space, do all chunk btree updates and deletions, and
3059 * update the system chunk array in the superblock while holding this
3060 * mutex. This is for similar reasons as explained on the comment at
3061 * the top of btrfs_chunk_alloc();
3063 * 2) Prevent races with the final phase of a device replace operation
3064 * that replaces the device object associated with the map's stripes,
3065 * because the device object's id can change at any time during that
3066 * final phase of the device replace operation
3067 * (dev-replace.c:btrfs_dev_replace_finishing()), so we could grab the
3068 * replaced device and then see it with an ID of
3069 * BTRFS_DEV_REPLACE_DEVID, which would cause a failure when updating
3070 * the device item, which does not exists on the chunk btree.
3071 * The finishing phase of device replace acquires both the
3072 * device_list_mutex and the chunk_mutex, in that order, so we are
3073 * safe by just acquiring the chunk_mutex.
3075 trans->removing_chunk = true;
3076 mutex_lock(&fs_info->chunk_mutex);
3078 check_system_chunk(trans, map->type);
3080 ret = remove_chunk_item(trans, map, chunk_offset);
3082 * Normally we should not get -ENOSPC since we reserved space before
3083 * through the call to check_system_chunk().
3085 * Despite our system space_info having enough free space, we may not
3086 * be able to allocate extents from its block groups, because all have
3087 * an incompatible profile, which will force us to allocate a new system
3088 * block group with the right profile, or right after we called
3089 * check_system_space() above, a scrub turned the only system block group
3090 * with enough free space into RO mode.
3091 * This is explained with more detail at do_chunk_alloc().
3093 * So if we get -ENOSPC, allocate a new system chunk and retry once.
3095 if (ret == -ENOSPC) {
3096 const u64 sys_flags = btrfs_system_alloc_profile(fs_info);
3097 struct btrfs_block_group *sys_bg;
3099 sys_bg = btrfs_alloc_chunk(trans, sys_flags);
3100 if (IS_ERR(sys_bg)) {
3101 ret = PTR_ERR(sys_bg);
3102 btrfs_abort_transaction(trans, ret);
3106 ret = btrfs_chunk_alloc_add_chunk_item(trans, sys_bg);
3108 btrfs_abort_transaction(trans, ret);
3112 ret = remove_chunk_item(trans, map, chunk_offset);
3114 btrfs_abort_transaction(trans, ret);
3118 btrfs_abort_transaction(trans, ret);
3122 trace_btrfs_chunk_free(fs_info, map, chunk_offset, em->len);
3124 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
3125 ret = btrfs_del_sys_chunk(fs_info, chunk_offset);
3127 btrfs_abort_transaction(trans, ret);
3132 mutex_unlock(&fs_info->chunk_mutex);
3133 trans->removing_chunk = false;
3136 * We are done with chunk btree updates and deletions, so release the
3137 * system space we previously reserved (with check_system_chunk()).
3139 btrfs_trans_release_chunk_metadata(trans);
3141 ret = btrfs_remove_block_group(trans, chunk_offset, em);
3143 btrfs_abort_transaction(trans, ret);
3148 if (trans->removing_chunk) {
3149 mutex_unlock(&fs_info->chunk_mutex);
3150 trans->removing_chunk = false;
3153 free_extent_map(em);
3157 int btrfs_relocate_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
3159 struct btrfs_root *root = fs_info->chunk_root;
3160 struct btrfs_trans_handle *trans;
3161 struct btrfs_block_group *block_group;
3166 * Prevent races with automatic removal of unused block groups.
3167 * After we relocate and before we remove the chunk with offset
3168 * chunk_offset, automatic removal of the block group can kick in,
3169 * resulting in a failure when calling btrfs_remove_chunk() below.
3171 * Make sure to acquire this mutex before doing a tree search (dev
3172 * or chunk trees) to find chunks. Otherwise the cleaner kthread might
3173 * call btrfs_remove_chunk() (through btrfs_delete_unused_bgs()) after
3174 * we release the path used to search the chunk/dev tree and before
3175 * the current task acquires this mutex and calls us.
3177 lockdep_assert_held(&fs_info->reclaim_bgs_lock);
3179 /* step one, relocate all the extents inside this chunk */
3180 btrfs_scrub_pause(fs_info);
3181 ret = btrfs_relocate_block_group(fs_info, chunk_offset);
3182 btrfs_scrub_continue(fs_info);
3186 block_group = btrfs_lookup_block_group(fs_info, chunk_offset);
3189 btrfs_discard_cancel_work(&fs_info->discard_ctl, block_group);
3190 length = block_group->length;
3191 btrfs_put_block_group(block_group);
3194 * On a zoned file system, discard the whole block group, this will
3195 * trigger a REQ_OP_ZONE_RESET operation on the device zone. If
3196 * resetting the zone fails, don't treat it as a fatal problem from the
3197 * filesystem's point of view.
3199 if (btrfs_is_zoned(fs_info)) {
3200 ret = btrfs_discard_extent(fs_info, chunk_offset, length, NULL);
3203 "failed to reset zone %llu after relocation",
3207 trans = btrfs_start_trans_remove_block_group(root->fs_info,
3209 if (IS_ERR(trans)) {
3210 ret = PTR_ERR(trans);
3211 btrfs_handle_fs_error(root->fs_info, ret, NULL);
3216 * step two, delete the device extents and the
3217 * chunk tree entries
3219 ret = btrfs_remove_chunk(trans, chunk_offset);
3220 btrfs_end_transaction(trans);
3224 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info)
3226 struct btrfs_root *chunk_root = fs_info->chunk_root;
3227 struct btrfs_path *path;
3228 struct extent_buffer *leaf;
3229 struct btrfs_chunk *chunk;
3230 struct btrfs_key key;
3231 struct btrfs_key found_key;
3233 bool retried = false;
3237 path = btrfs_alloc_path();
3242 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3243 key.offset = (u64)-1;
3244 key.type = BTRFS_CHUNK_ITEM_KEY;
3247 mutex_lock(&fs_info->reclaim_bgs_lock);
3248 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3250 mutex_unlock(&fs_info->reclaim_bgs_lock);
3253 BUG_ON(ret == 0); /* Corruption */
3255 ret = btrfs_previous_item(chunk_root, path, key.objectid,
3258 mutex_unlock(&fs_info->reclaim_bgs_lock);
3264 leaf = path->nodes[0];
3265 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3267 chunk = btrfs_item_ptr(leaf, path->slots[0],
3268 struct btrfs_chunk);
3269 chunk_type = btrfs_chunk_type(leaf, chunk);
3270 btrfs_release_path(path);
3272 if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) {
3273 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3279 mutex_unlock(&fs_info->reclaim_bgs_lock);
3281 if (found_key.offset == 0)
3283 key.offset = found_key.offset - 1;
3286 if (failed && !retried) {
3290 } else if (WARN_ON(failed && retried)) {
3294 btrfs_free_path(path);
3299 * return 1 : allocate a data chunk successfully,
3300 * return <0: errors during allocating a data chunk,
3301 * return 0 : no need to allocate a data chunk.
3303 static int btrfs_may_alloc_data_chunk(struct btrfs_fs_info *fs_info,
3306 struct btrfs_block_group *cache;
3310 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3312 chunk_type = cache->flags;
3313 btrfs_put_block_group(cache);
3315 if (!(chunk_type & BTRFS_BLOCK_GROUP_DATA))
3318 spin_lock(&fs_info->data_sinfo->lock);
3319 bytes_used = fs_info->data_sinfo->bytes_used;
3320 spin_unlock(&fs_info->data_sinfo->lock);
3323 struct btrfs_trans_handle *trans;
3326 trans = btrfs_join_transaction(fs_info->tree_root);
3328 return PTR_ERR(trans);
3330 ret = btrfs_force_chunk_alloc(trans, BTRFS_BLOCK_GROUP_DATA);
3331 btrfs_end_transaction(trans);
3340 static int insert_balance_item(struct btrfs_fs_info *fs_info,
3341 struct btrfs_balance_control *bctl)
3343 struct btrfs_root *root = fs_info->tree_root;
3344 struct btrfs_trans_handle *trans;
3345 struct btrfs_balance_item *item;
3346 struct btrfs_disk_balance_args disk_bargs;
3347 struct btrfs_path *path;
3348 struct extent_buffer *leaf;
3349 struct btrfs_key key;
3352 path = btrfs_alloc_path();
3356 trans = btrfs_start_transaction(root, 0);
3357 if (IS_ERR(trans)) {
3358 btrfs_free_path(path);
3359 return PTR_ERR(trans);
3362 key.objectid = BTRFS_BALANCE_OBJECTID;
3363 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3366 ret = btrfs_insert_empty_item(trans, root, path, &key,
3371 leaf = path->nodes[0];
3372 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
3374 memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item));
3376 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->data);
3377 btrfs_set_balance_data(leaf, item, &disk_bargs);
3378 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->meta);
3379 btrfs_set_balance_meta(leaf, item, &disk_bargs);
3380 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->sys);
3381 btrfs_set_balance_sys(leaf, item, &disk_bargs);
3383 btrfs_set_balance_flags(leaf, item, bctl->flags);
3385 btrfs_mark_buffer_dirty(leaf);
3387 btrfs_free_path(path);
3388 err = btrfs_commit_transaction(trans);
3394 static int del_balance_item(struct btrfs_fs_info *fs_info)
3396 struct btrfs_root *root = fs_info->tree_root;
3397 struct btrfs_trans_handle *trans;
3398 struct btrfs_path *path;
3399 struct btrfs_key key;
3402 path = btrfs_alloc_path();
3406 trans = btrfs_start_transaction_fallback_global_rsv(root, 0);
3407 if (IS_ERR(trans)) {
3408 btrfs_free_path(path);
3409 return PTR_ERR(trans);
3412 key.objectid = BTRFS_BALANCE_OBJECTID;
3413 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3416 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3424 ret = btrfs_del_item(trans, root, path);
3426 btrfs_free_path(path);
3427 err = btrfs_commit_transaction(trans);
3434 * This is a heuristic used to reduce the number of chunks balanced on
3435 * resume after balance was interrupted.
3437 static void update_balance_args(struct btrfs_balance_control *bctl)
3440 * Turn on soft mode for chunk types that were being converted.
3442 if (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)
3443 bctl->data.flags |= BTRFS_BALANCE_ARGS_SOFT;
3444 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)
3445 bctl->sys.flags |= BTRFS_BALANCE_ARGS_SOFT;
3446 if (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)
3447 bctl->meta.flags |= BTRFS_BALANCE_ARGS_SOFT;
3450 * Turn on usage filter if is not already used. The idea is
3451 * that chunks that we have already balanced should be
3452 * reasonably full. Don't do it for chunks that are being
3453 * converted - that will keep us from relocating unconverted
3454 * (albeit full) chunks.
3456 if (!(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3457 !(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3458 !(bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3459 bctl->data.flags |= BTRFS_BALANCE_ARGS_USAGE;
3460 bctl->data.usage = 90;
3462 if (!(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3463 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3464 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3465 bctl->sys.flags |= BTRFS_BALANCE_ARGS_USAGE;
3466 bctl->sys.usage = 90;
3468 if (!(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3469 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3470 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3471 bctl->meta.flags |= BTRFS_BALANCE_ARGS_USAGE;
3472 bctl->meta.usage = 90;
3477 * Clear the balance status in fs_info and delete the balance item from disk.
3479 static void reset_balance_state(struct btrfs_fs_info *fs_info)
3481 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3484 BUG_ON(!fs_info->balance_ctl);
3486 spin_lock(&fs_info->balance_lock);
3487 fs_info->balance_ctl = NULL;
3488 spin_unlock(&fs_info->balance_lock);
3491 ret = del_balance_item(fs_info);
3493 btrfs_handle_fs_error(fs_info, ret, NULL);
3497 * Balance filters. Return 1 if chunk should be filtered out
3498 * (should not be balanced).
3500 static int chunk_profiles_filter(u64 chunk_type,
3501 struct btrfs_balance_args *bargs)
3503 chunk_type = chunk_to_extended(chunk_type) &
3504 BTRFS_EXTENDED_PROFILE_MASK;
3506 if (bargs->profiles & chunk_type)
3512 static int chunk_usage_range_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset,
3513 struct btrfs_balance_args *bargs)
3515 struct btrfs_block_group *cache;
3517 u64 user_thresh_min;
3518 u64 user_thresh_max;
3521 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3522 chunk_used = cache->used;
3524 if (bargs->usage_min == 0)
3525 user_thresh_min = 0;
3527 user_thresh_min = div_factor_fine(cache->length,
3530 if (bargs->usage_max == 0)
3531 user_thresh_max = 1;
3532 else if (bargs->usage_max > 100)
3533 user_thresh_max = cache->length;
3535 user_thresh_max = div_factor_fine(cache->length,
3538 if (user_thresh_min <= chunk_used && chunk_used < user_thresh_max)
3541 btrfs_put_block_group(cache);
3545 static int chunk_usage_filter(struct btrfs_fs_info *fs_info,
3546 u64 chunk_offset, struct btrfs_balance_args *bargs)
3548 struct btrfs_block_group *cache;
3549 u64 chunk_used, user_thresh;
3552 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3553 chunk_used = cache->used;
3555 if (bargs->usage_min == 0)
3557 else if (bargs->usage > 100)
3558 user_thresh = cache->length;
3560 user_thresh = div_factor_fine(cache->length, bargs->usage);
3562 if (chunk_used < user_thresh)
3565 btrfs_put_block_group(cache);
3569 static int chunk_devid_filter(struct extent_buffer *leaf,
3570 struct btrfs_chunk *chunk,
3571 struct btrfs_balance_args *bargs)
3573 struct btrfs_stripe *stripe;
3574 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3577 for (i = 0; i < num_stripes; i++) {
3578 stripe = btrfs_stripe_nr(chunk, i);
3579 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
3586 static u64 calc_data_stripes(u64 type, int num_stripes)
3588 const int index = btrfs_bg_flags_to_raid_index(type);
3589 const int ncopies = btrfs_raid_array[index].ncopies;
3590 const int nparity = btrfs_raid_array[index].nparity;
3592 return (num_stripes - nparity) / ncopies;
3595 /* [pstart, pend) */
3596 static int chunk_drange_filter(struct extent_buffer *leaf,
3597 struct btrfs_chunk *chunk,
3598 struct btrfs_balance_args *bargs)
3600 struct btrfs_stripe *stripe;
3601 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3608 if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID))
3611 type = btrfs_chunk_type(leaf, chunk);
3612 factor = calc_data_stripes(type, num_stripes);
3614 for (i = 0; i < num_stripes; i++) {
3615 stripe = btrfs_stripe_nr(chunk, i);
3616 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
3619 stripe_offset = btrfs_stripe_offset(leaf, stripe);
3620 stripe_length = btrfs_chunk_length(leaf, chunk);
3621 stripe_length = div_u64(stripe_length, factor);
3623 if (stripe_offset < bargs->pend &&
3624 stripe_offset + stripe_length > bargs->pstart)
3631 /* [vstart, vend) */
3632 static int chunk_vrange_filter(struct extent_buffer *leaf,
3633 struct btrfs_chunk *chunk,
3635 struct btrfs_balance_args *bargs)
3637 if (chunk_offset < bargs->vend &&
3638 chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart)
3639 /* at least part of the chunk is inside this vrange */
3645 static int chunk_stripes_range_filter(struct extent_buffer *leaf,
3646 struct btrfs_chunk *chunk,
3647 struct btrfs_balance_args *bargs)
3649 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3651 if (bargs->stripes_min <= num_stripes
3652 && num_stripes <= bargs->stripes_max)
3658 static int chunk_soft_convert_filter(u64 chunk_type,
3659 struct btrfs_balance_args *bargs)
3661 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
3664 chunk_type = chunk_to_extended(chunk_type) &
3665 BTRFS_EXTENDED_PROFILE_MASK;
3667 if (bargs->target == chunk_type)
3673 static int should_balance_chunk(struct extent_buffer *leaf,
3674 struct btrfs_chunk *chunk, u64 chunk_offset)
3676 struct btrfs_fs_info *fs_info = leaf->fs_info;
3677 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3678 struct btrfs_balance_args *bargs = NULL;
3679 u64 chunk_type = btrfs_chunk_type(leaf, chunk);
3682 if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) &
3683 (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) {
3687 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3688 bargs = &bctl->data;
3689 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3691 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3692 bargs = &bctl->meta;
3694 /* profiles filter */
3695 if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) &&
3696 chunk_profiles_filter(chunk_type, bargs)) {
3701 if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) &&
3702 chunk_usage_filter(fs_info, chunk_offset, bargs)) {
3704 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3705 chunk_usage_range_filter(fs_info, chunk_offset, bargs)) {
3710 if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) &&
3711 chunk_devid_filter(leaf, chunk, bargs)) {
3715 /* drange filter, makes sense only with devid filter */
3716 if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) &&
3717 chunk_drange_filter(leaf, chunk, bargs)) {
3722 if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) &&
3723 chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) {
3727 /* stripes filter */
3728 if ((bargs->flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE) &&
3729 chunk_stripes_range_filter(leaf, chunk, bargs)) {
3733 /* soft profile changing mode */
3734 if ((bargs->flags & BTRFS_BALANCE_ARGS_SOFT) &&
3735 chunk_soft_convert_filter(chunk_type, bargs)) {
3740 * limited by count, must be the last filter
3742 if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT)) {
3743 if (bargs->limit == 0)
3747 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)) {
3749 * Same logic as the 'limit' filter; the minimum cannot be
3750 * determined here because we do not have the global information
3751 * about the count of all chunks that satisfy the filters.
3753 if (bargs->limit_max == 0)
3762 static int __btrfs_balance(struct btrfs_fs_info *fs_info)
3764 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3765 struct btrfs_root *chunk_root = fs_info->chunk_root;
3767 struct btrfs_chunk *chunk;
3768 struct btrfs_path *path = NULL;
3769 struct btrfs_key key;
3770 struct btrfs_key found_key;
3771 struct extent_buffer *leaf;
3774 int enospc_errors = 0;
3775 bool counting = true;
3776 /* The single value limit and min/max limits use the same bytes in the */
3777 u64 limit_data = bctl->data.limit;
3778 u64 limit_meta = bctl->meta.limit;
3779 u64 limit_sys = bctl->sys.limit;
3783 int chunk_reserved = 0;
3785 path = btrfs_alloc_path();
3791 /* zero out stat counters */
3792 spin_lock(&fs_info->balance_lock);
3793 memset(&bctl->stat, 0, sizeof(bctl->stat));
3794 spin_unlock(&fs_info->balance_lock);
3798 * The single value limit and min/max limits use the same bytes
3801 bctl->data.limit = limit_data;
3802 bctl->meta.limit = limit_meta;
3803 bctl->sys.limit = limit_sys;
3805 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3806 key.offset = (u64)-1;
3807 key.type = BTRFS_CHUNK_ITEM_KEY;
3810 if ((!counting && atomic_read(&fs_info->balance_pause_req)) ||
3811 atomic_read(&fs_info->balance_cancel_req)) {
3816 mutex_lock(&fs_info->reclaim_bgs_lock);
3817 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3819 mutex_unlock(&fs_info->reclaim_bgs_lock);
3824 * this shouldn't happen, it means the last relocate
3828 BUG(); /* FIXME break ? */
3830 ret = btrfs_previous_item(chunk_root, path, 0,
3831 BTRFS_CHUNK_ITEM_KEY);
3833 mutex_unlock(&fs_info->reclaim_bgs_lock);
3838 leaf = path->nodes[0];
3839 slot = path->slots[0];
3840 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3842 if (found_key.objectid != key.objectid) {
3843 mutex_unlock(&fs_info->reclaim_bgs_lock);
3847 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
3848 chunk_type = btrfs_chunk_type(leaf, chunk);
3851 spin_lock(&fs_info->balance_lock);
3852 bctl->stat.considered++;
3853 spin_unlock(&fs_info->balance_lock);
3856 ret = should_balance_chunk(leaf, chunk, found_key.offset);
3858 btrfs_release_path(path);
3860 mutex_unlock(&fs_info->reclaim_bgs_lock);
3865 mutex_unlock(&fs_info->reclaim_bgs_lock);
3866 spin_lock(&fs_info->balance_lock);
3867 bctl->stat.expected++;
3868 spin_unlock(&fs_info->balance_lock);
3870 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3872 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3874 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3881 * Apply limit_min filter, no need to check if the LIMITS
3882 * filter is used, limit_min is 0 by default
3884 if (((chunk_type & BTRFS_BLOCK_GROUP_DATA) &&
3885 count_data < bctl->data.limit_min)
3886 || ((chunk_type & BTRFS_BLOCK_GROUP_METADATA) &&
3887 count_meta < bctl->meta.limit_min)
3888 || ((chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) &&
3889 count_sys < bctl->sys.limit_min)) {
3890 mutex_unlock(&fs_info->reclaim_bgs_lock);
3894 if (!chunk_reserved) {
3896 * We may be relocating the only data chunk we have,
3897 * which could potentially end up with losing data's
3898 * raid profile, so lets allocate an empty one in
3901 ret = btrfs_may_alloc_data_chunk(fs_info,
3904 mutex_unlock(&fs_info->reclaim_bgs_lock);
3906 } else if (ret == 1) {
3911 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3912 mutex_unlock(&fs_info->reclaim_bgs_lock);
3913 if (ret == -ENOSPC) {
3915 } else if (ret == -ETXTBSY) {
3917 "skipping relocation of block group %llu due to active swapfile",
3923 spin_lock(&fs_info->balance_lock);
3924 bctl->stat.completed++;
3925 spin_unlock(&fs_info->balance_lock);
3928 if (found_key.offset == 0)
3930 key.offset = found_key.offset - 1;
3934 btrfs_release_path(path);
3939 btrfs_free_path(path);
3940 if (enospc_errors) {
3941 btrfs_info(fs_info, "%d enospc errors during balance",
3951 * alloc_profile_is_valid - see if a given profile is valid and reduced
3952 * @flags: profile to validate
3953 * @extended: if true @flags is treated as an extended profile
3955 static int alloc_profile_is_valid(u64 flags, int extended)
3957 u64 mask = (extended ? BTRFS_EXTENDED_PROFILE_MASK :
3958 BTRFS_BLOCK_GROUP_PROFILE_MASK);
3960 flags &= ~BTRFS_BLOCK_GROUP_TYPE_MASK;
3962 /* 1) check that all other bits are zeroed */
3966 /* 2) see if profile is reduced */
3968 return !extended; /* "0" is valid for usual profiles */
3970 return has_single_bit_set(flags);
3973 static inline int balance_need_close(struct btrfs_fs_info *fs_info)
3975 /* cancel requested || normal exit path */
3976 return atomic_read(&fs_info->balance_cancel_req) ||
3977 (atomic_read(&fs_info->balance_pause_req) == 0 &&
3978 atomic_read(&fs_info->balance_cancel_req) == 0);
3982 * Validate target profile against allowed profiles and return true if it's OK.
3983 * Otherwise print the error message and return false.
3985 static inline int validate_convert_profile(struct btrfs_fs_info *fs_info,
3986 const struct btrfs_balance_args *bargs,
3987 u64 allowed, const char *type)
3989 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
3992 if (fs_info->sectorsize < PAGE_SIZE &&
3993 bargs->target & BTRFS_BLOCK_GROUP_RAID56_MASK) {
3995 "RAID56 is not yet supported for sectorsize %u with page size %lu",
3996 fs_info->sectorsize, PAGE_SIZE);
3999 /* Profile is valid and does not have bits outside of the allowed set */
4000 if (alloc_profile_is_valid(bargs->target, 1) &&
4001 (bargs->target & ~allowed) == 0)
4004 btrfs_err(fs_info, "balance: invalid convert %s profile %s",
4005 type, btrfs_bg_type_to_raid_name(bargs->target));
4010 * Fill @buf with textual description of balance filter flags @bargs, up to
4011 * @size_buf including the terminating null. The output may be trimmed if it
4012 * does not fit into the provided buffer.
4014 static void describe_balance_args(struct btrfs_balance_args *bargs, char *buf,
4018 u32 size_bp = size_buf;
4020 u64 flags = bargs->flags;
4021 char tmp_buf[128] = {'\0'};
4026 #define CHECK_APPEND_NOARG(a) \
4028 ret = snprintf(bp, size_bp, (a)); \
4029 if (ret < 0 || ret >= size_bp) \
4030 goto out_overflow; \
4035 #define CHECK_APPEND_1ARG(a, v1) \
4037 ret = snprintf(bp, size_bp, (a), (v1)); \
4038 if (ret < 0 || ret >= size_bp) \
4039 goto out_overflow; \
4044 #define CHECK_APPEND_2ARG(a, v1, v2) \
4046 ret = snprintf(bp, size_bp, (a), (v1), (v2)); \
4047 if (ret < 0 || ret >= size_bp) \
4048 goto out_overflow; \
4053 if (flags & BTRFS_BALANCE_ARGS_CONVERT)
4054 CHECK_APPEND_1ARG("convert=%s,",
4055 btrfs_bg_type_to_raid_name(bargs->target));
4057 if (flags & BTRFS_BALANCE_ARGS_SOFT)
4058 CHECK_APPEND_NOARG("soft,");
4060 if (flags & BTRFS_BALANCE_ARGS_PROFILES) {
4061 btrfs_describe_block_groups(bargs->profiles, tmp_buf,
4063 CHECK_APPEND_1ARG("profiles=%s,", tmp_buf);
4066 if (flags & BTRFS_BALANCE_ARGS_USAGE)
4067 CHECK_APPEND_1ARG("usage=%llu,", bargs->usage);
4069 if (flags & BTRFS_BALANCE_ARGS_USAGE_RANGE)
4070 CHECK_APPEND_2ARG("usage=%u..%u,",
4071 bargs->usage_min, bargs->usage_max);
4073 if (flags & BTRFS_BALANCE_ARGS_DEVID)
4074 CHECK_APPEND_1ARG("devid=%llu,", bargs->devid);
4076 if (flags & BTRFS_BALANCE_ARGS_DRANGE)
4077 CHECK_APPEND_2ARG("drange=%llu..%llu,",
4078 bargs->pstart, bargs->pend);
4080 if (flags & BTRFS_BALANCE_ARGS_VRANGE)
4081 CHECK_APPEND_2ARG("vrange=%llu..%llu,",
4082 bargs->vstart, bargs->vend);
4084 if (flags & BTRFS_BALANCE_ARGS_LIMIT)
4085 CHECK_APPEND_1ARG("limit=%llu,", bargs->limit);
4087 if (flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)
4088 CHECK_APPEND_2ARG("limit=%u..%u,",
4089 bargs->limit_min, bargs->limit_max);
4091 if (flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE)
4092 CHECK_APPEND_2ARG("stripes=%u..%u,",
4093 bargs->stripes_min, bargs->stripes_max);
4095 #undef CHECK_APPEND_2ARG
4096 #undef CHECK_APPEND_1ARG
4097 #undef CHECK_APPEND_NOARG
4101 if (size_bp < size_buf)
4102 buf[size_buf - size_bp - 1] = '\0'; /* remove last , */
4107 static void describe_balance_start_or_resume(struct btrfs_fs_info *fs_info)
4109 u32 size_buf = 1024;
4110 char tmp_buf[192] = {'\0'};
4113 u32 size_bp = size_buf;
4115 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
4117 buf = kzalloc(size_buf, GFP_KERNEL);
4123 #define CHECK_APPEND_1ARG(a, v1) \
4125 ret = snprintf(bp, size_bp, (a), (v1)); \
4126 if (ret < 0 || ret >= size_bp) \
4127 goto out_overflow; \
4132 if (bctl->flags & BTRFS_BALANCE_FORCE)
4133 CHECK_APPEND_1ARG("%s", "-f ");
4135 if (bctl->flags & BTRFS_BALANCE_DATA) {
4136 describe_balance_args(&bctl->data, tmp_buf, sizeof(tmp_buf));
4137 CHECK_APPEND_1ARG("-d%s ", tmp_buf);
4140 if (bctl->flags & BTRFS_BALANCE_METADATA) {
4141 describe_balance_args(&bctl->meta, tmp_buf, sizeof(tmp_buf));
4142 CHECK_APPEND_1ARG("-m%s ", tmp_buf);
4145 if (bctl->flags & BTRFS_BALANCE_SYSTEM) {
4146 describe_balance_args(&bctl->sys, tmp_buf, sizeof(tmp_buf));
4147 CHECK_APPEND_1ARG("-s%s ", tmp_buf);
4150 #undef CHECK_APPEND_1ARG
4154 if (size_bp < size_buf)
4155 buf[size_buf - size_bp - 1] = '\0'; /* remove last " " */
4156 btrfs_info(fs_info, "balance: %s %s",
4157 (bctl->flags & BTRFS_BALANCE_RESUME) ?
4158 "resume" : "start", buf);
4164 * Should be called with balance mutexe held
4166 int btrfs_balance(struct btrfs_fs_info *fs_info,
4167 struct btrfs_balance_control *bctl,
4168 struct btrfs_ioctl_balance_args *bargs)
4170 u64 meta_target, data_target;
4176 bool reducing_redundancy;
4179 if (btrfs_fs_closing(fs_info) ||
4180 atomic_read(&fs_info->balance_pause_req) ||
4181 btrfs_should_cancel_balance(fs_info)) {
4186 allowed = btrfs_super_incompat_flags(fs_info->super_copy);
4187 if (allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
4191 * In case of mixed groups both data and meta should be picked,
4192 * and identical options should be given for both of them.
4194 allowed = BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA;
4195 if (mixed && (bctl->flags & allowed)) {
4196 if (!(bctl->flags & BTRFS_BALANCE_DATA) ||
4197 !(bctl->flags & BTRFS_BALANCE_METADATA) ||
4198 memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) {
4200 "balance: mixed groups data and metadata options must be the same");
4207 * rw_devices will not change at the moment, device add/delete/replace
4210 num_devices = fs_info->fs_devices->rw_devices;
4213 * SINGLE profile on-disk has no profile bit, but in-memory we have a
4214 * special bit for it, to make it easier to distinguish. Thus we need
4215 * to set it manually, or balance would refuse the profile.
4217 allowed = BTRFS_AVAIL_ALLOC_BIT_SINGLE;
4218 for (i = 0; i < ARRAY_SIZE(btrfs_raid_array); i++)
4219 if (num_devices >= btrfs_raid_array[i].devs_min)
4220 allowed |= btrfs_raid_array[i].bg_flag;
4222 if (!validate_convert_profile(fs_info, &bctl->data, allowed, "data") ||
4223 !validate_convert_profile(fs_info, &bctl->meta, allowed, "metadata") ||
4224 !validate_convert_profile(fs_info, &bctl->sys, allowed, "system")) {
4230 * Allow to reduce metadata or system integrity only if force set for
4231 * profiles with redundancy (copies, parity)
4234 for (i = 0; i < ARRAY_SIZE(btrfs_raid_array); i++) {
4235 if (btrfs_raid_array[i].ncopies >= 2 ||
4236 btrfs_raid_array[i].tolerated_failures >= 1)
4237 allowed |= btrfs_raid_array[i].bg_flag;
4240 seq = read_seqbegin(&fs_info->profiles_lock);
4242 if (((bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
4243 (fs_info->avail_system_alloc_bits & allowed) &&
4244 !(bctl->sys.target & allowed)) ||
4245 ((bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
4246 (fs_info->avail_metadata_alloc_bits & allowed) &&
4247 !(bctl->meta.target & allowed)))
4248 reducing_redundancy = true;
4250 reducing_redundancy = false;
4252 /* if we're not converting, the target field is uninitialized */
4253 meta_target = (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
4254 bctl->meta.target : fs_info->avail_metadata_alloc_bits;
4255 data_target = (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
4256 bctl->data.target : fs_info->avail_data_alloc_bits;
4257 } while (read_seqretry(&fs_info->profiles_lock, seq));
4259 if (reducing_redundancy) {
4260 if (bctl->flags & BTRFS_BALANCE_FORCE) {
4262 "balance: force reducing metadata redundancy");
4265 "balance: reduces metadata redundancy, use --force if you want this");
4271 if (btrfs_get_num_tolerated_disk_barrier_failures(meta_target) <
4272 btrfs_get_num_tolerated_disk_barrier_failures(data_target)) {
4274 "balance: metadata profile %s has lower redundancy than data profile %s",
4275 btrfs_bg_type_to_raid_name(meta_target),
4276 btrfs_bg_type_to_raid_name(data_target));
4279 ret = insert_balance_item(fs_info, bctl);
4280 if (ret && ret != -EEXIST)
4283 if (!(bctl->flags & BTRFS_BALANCE_RESUME)) {
4284 BUG_ON(ret == -EEXIST);
4285 BUG_ON(fs_info->balance_ctl);
4286 spin_lock(&fs_info->balance_lock);
4287 fs_info->balance_ctl = bctl;
4288 spin_unlock(&fs_info->balance_lock);
4290 BUG_ON(ret != -EEXIST);
4291 spin_lock(&fs_info->balance_lock);
4292 update_balance_args(bctl);
4293 spin_unlock(&fs_info->balance_lock);
4296 ASSERT(!test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4297 set_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags);
4298 describe_balance_start_or_resume(fs_info);
4299 mutex_unlock(&fs_info->balance_mutex);
4301 ret = __btrfs_balance(fs_info);
4303 mutex_lock(&fs_info->balance_mutex);
4304 if (ret == -ECANCELED && atomic_read(&fs_info->balance_pause_req))
4305 btrfs_info(fs_info, "balance: paused");
4307 * Balance can be canceled by:
4309 * - Regular cancel request
4310 * Then ret == -ECANCELED and balance_cancel_req > 0
4312 * - Fatal signal to "btrfs" process
4313 * Either the signal caught by wait_reserve_ticket() and callers
4314 * got -EINTR, or caught by btrfs_should_cancel_balance() and
4316 * Either way, in this case balance_cancel_req = 0, and
4317 * ret == -EINTR or ret == -ECANCELED.
4319 * So here we only check the return value to catch canceled balance.
4321 else if (ret == -ECANCELED || ret == -EINTR)
4322 btrfs_info(fs_info, "balance: canceled");
4324 btrfs_info(fs_info, "balance: ended with status: %d", ret);
4326 clear_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags);
4329 memset(bargs, 0, sizeof(*bargs));
4330 btrfs_update_ioctl_balance_args(fs_info, bargs);
4333 if ((ret && ret != -ECANCELED && ret != -ENOSPC) ||
4334 balance_need_close(fs_info)) {
4335 reset_balance_state(fs_info);
4336 btrfs_exclop_finish(fs_info);
4339 wake_up(&fs_info->balance_wait_q);
4343 if (bctl->flags & BTRFS_BALANCE_RESUME)
4344 reset_balance_state(fs_info);
4347 btrfs_exclop_finish(fs_info);
4352 static int balance_kthread(void *data)
4354 struct btrfs_fs_info *fs_info = data;
4357 mutex_lock(&fs_info->balance_mutex);
4358 if (fs_info->balance_ctl)
4359 ret = btrfs_balance(fs_info, fs_info->balance_ctl, NULL);
4360 mutex_unlock(&fs_info->balance_mutex);
4365 int btrfs_resume_balance_async(struct btrfs_fs_info *fs_info)
4367 struct task_struct *tsk;
4369 mutex_lock(&fs_info->balance_mutex);
4370 if (!fs_info->balance_ctl) {
4371 mutex_unlock(&fs_info->balance_mutex);
4374 mutex_unlock(&fs_info->balance_mutex);
4376 if (btrfs_test_opt(fs_info, SKIP_BALANCE)) {
4377 btrfs_info(fs_info, "balance: resume skipped");
4382 * A ro->rw remount sequence should continue with the paused balance
4383 * regardless of who pauses it, system or the user as of now, so set
4386 spin_lock(&fs_info->balance_lock);
4387 fs_info->balance_ctl->flags |= BTRFS_BALANCE_RESUME;
4388 spin_unlock(&fs_info->balance_lock);
4390 tsk = kthread_run(balance_kthread, fs_info, "btrfs-balance");
4391 return PTR_ERR_OR_ZERO(tsk);
4394 int btrfs_recover_balance(struct btrfs_fs_info *fs_info)
4396 struct btrfs_balance_control *bctl;
4397 struct btrfs_balance_item *item;
4398 struct btrfs_disk_balance_args disk_bargs;
4399 struct btrfs_path *path;
4400 struct extent_buffer *leaf;
4401 struct btrfs_key key;
4404 path = btrfs_alloc_path();
4408 key.objectid = BTRFS_BALANCE_OBJECTID;
4409 key.type = BTRFS_TEMPORARY_ITEM_KEY;
4412 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4415 if (ret > 0) { /* ret = -ENOENT; */
4420 bctl = kzalloc(sizeof(*bctl), GFP_NOFS);
4426 leaf = path->nodes[0];
4427 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
4429 bctl->flags = btrfs_balance_flags(leaf, item);
4430 bctl->flags |= BTRFS_BALANCE_RESUME;
4432 btrfs_balance_data(leaf, item, &disk_bargs);
4433 btrfs_disk_balance_args_to_cpu(&bctl->data, &disk_bargs);
4434 btrfs_balance_meta(leaf, item, &disk_bargs);
4435 btrfs_disk_balance_args_to_cpu(&bctl->meta, &disk_bargs);
4436 btrfs_balance_sys(leaf, item, &disk_bargs);
4437 btrfs_disk_balance_args_to_cpu(&bctl->sys, &disk_bargs);
4440 * This should never happen, as the paused balance state is recovered
4441 * during mount without any chance of other exclusive ops to collide.
4443 * This gives the exclusive op status to balance and keeps in paused
4444 * state until user intervention (cancel or umount). If the ownership
4445 * cannot be assigned, show a message but do not fail. The balance
4446 * is in a paused state and must have fs_info::balance_ctl properly
4449 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_BALANCE))
4451 "balance: cannot set exclusive op status, resume manually");
4453 btrfs_release_path(path);
4455 mutex_lock(&fs_info->balance_mutex);
4456 BUG_ON(fs_info->balance_ctl);
4457 spin_lock(&fs_info->balance_lock);
4458 fs_info->balance_ctl = bctl;
4459 spin_unlock(&fs_info->balance_lock);
4460 mutex_unlock(&fs_info->balance_mutex);
4462 btrfs_free_path(path);
4466 int btrfs_pause_balance(struct btrfs_fs_info *fs_info)
4470 mutex_lock(&fs_info->balance_mutex);
4471 if (!fs_info->balance_ctl) {
4472 mutex_unlock(&fs_info->balance_mutex);
4476 if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) {
4477 atomic_inc(&fs_info->balance_pause_req);
4478 mutex_unlock(&fs_info->balance_mutex);
4480 wait_event(fs_info->balance_wait_q,
4481 !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4483 mutex_lock(&fs_info->balance_mutex);
4484 /* we are good with balance_ctl ripped off from under us */
4485 BUG_ON(test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4486 atomic_dec(&fs_info->balance_pause_req);
4491 mutex_unlock(&fs_info->balance_mutex);
4495 int btrfs_cancel_balance(struct btrfs_fs_info *fs_info)
4497 mutex_lock(&fs_info->balance_mutex);
4498 if (!fs_info->balance_ctl) {
4499 mutex_unlock(&fs_info->balance_mutex);
4504 * A paused balance with the item stored on disk can be resumed at
4505 * mount time if the mount is read-write. Otherwise it's still paused
4506 * and we must not allow cancelling as it deletes the item.
4508 if (sb_rdonly(fs_info->sb)) {
4509 mutex_unlock(&fs_info->balance_mutex);
4513 atomic_inc(&fs_info->balance_cancel_req);
4515 * if we are running just wait and return, balance item is
4516 * deleted in btrfs_balance in this case
4518 if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) {
4519 mutex_unlock(&fs_info->balance_mutex);
4520 wait_event(fs_info->balance_wait_q,
4521 !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4522 mutex_lock(&fs_info->balance_mutex);
4524 mutex_unlock(&fs_info->balance_mutex);
4526 * Lock released to allow other waiters to continue, we'll
4527 * reexamine the status again.
4529 mutex_lock(&fs_info->balance_mutex);
4531 if (fs_info->balance_ctl) {
4532 reset_balance_state(fs_info);
4533 btrfs_exclop_finish(fs_info);
4534 btrfs_info(fs_info, "balance: canceled");
4538 BUG_ON(fs_info->balance_ctl ||
4539 test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4540 atomic_dec(&fs_info->balance_cancel_req);
4541 mutex_unlock(&fs_info->balance_mutex);
4545 int btrfs_uuid_scan_kthread(void *data)
4547 struct btrfs_fs_info *fs_info = data;
4548 struct btrfs_root *root = fs_info->tree_root;
4549 struct btrfs_key key;
4550 struct btrfs_path *path = NULL;
4552 struct extent_buffer *eb;
4554 struct btrfs_root_item root_item;
4556 struct btrfs_trans_handle *trans = NULL;
4557 bool closing = false;
4559 path = btrfs_alloc_path();
4566 key.type = BTRFS_ROOT_ITEM_KEY;
4570 if (btrfs_fs_closing(fs_info)) {
4574 ret = btrfs_search_forward(root, &key, path,
4575 BTRFS_OLDEST_GENERATION);
4582 if (key.type != BTRFS_ROOT_ITEM_KEY ||
4583 (key.objectid < BTRFS_FIRST_FREE_OBJECTID &&
4584 key.objectid != BTRFS_FS_TREE_OBJECTID) ||
4585 key.objectid > BTRFS_LAST_FREE_OBJECTID)
4588 eb = path->nodes[0];
4589 slot = path->slots[0];
4590 item_size = btrfs_item_size_nr(eb, slot);
4591 if (item_size < sizeof(root_item))
4594 read_extent_buffer(eb, &root_item,
4595 btrfs_item_ptr_offset(eb, slot),
4596 (int)sizeof(root_item));
4597 if (btrfs_root_refs(&root_item) == 0)
4600 if (!btrfs_is_empty_uuid(root_item.uuid) ||
4601 !btrfs_is_empty_uuid(root_item.received_uuid)) {
4605 btrfs_release_path(path);
4607 * 1 - subvol uuid item
4608 * 1 - received_subvol uuid item
4610 trans = btrfs_start_transaction(fs_info->uuid_root, 2);
4611 if (IS_ERR(trans)) {
4612 ret = PTR_ERR(trans);
4620 btrfs_release_path(path);
4621 if (!btrfs_is_empty_uuid(root_item.uuid)) {
4622 ret = btrfs_uuid_tree_add(trans, root_item.uuid,
4623 BTRFS_UUID_KEY_SUBVOL,
4626 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4632 if (!btrfs_is_empty_uuid(root_item.received_uuid)) {
4633 ret = btrfs_uuid_tree_add(trans,
4634 root_item.received_uuid,
4635 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4638 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4645 btrfs_release_path(path);
4647 ret = btrfs_end_transaction(trans);
4653 if (key.offset < (u64)-1) {
4655 } else if (key.type < BTRFS_ROOT_ITEM_KEY) {
4657 key.type = BTRFS_ROOT_ITEM_KEY;
4658 } else if (key.objectid < (u64)-1) {
4660 key.type = BTRFS_ROOT_ITEM_KEY;
4669 btrfs_free_path(path);
4670 if (trans && !IS_ERR(trans))
4671 btrfs_end_transaction(trans);
4673 btrfs_warn(fs_info, "btrfs_uuid_scan_kthread failed %d", ret);
4675 set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags);
4676 up(&fs_info->uuid_tree_rescan_sem);
4680 int btrfs_create_uuid_tree(struct btrfs_fs_info *fs_info)
4682 struct btrfs_trans_handle *trans;
4683 struct btrfs_root *tree_root = fs_info->tree_root;
4684 struct btrfs_root *uuid_root;
4685 struct task_struct *task;
4692 trans = btrfs_start_transaction(tree_root, 2);
4694 return PTR_ERR(trans);
4696 uuid_root = btrfs_create_tree(trans, BTRFS_UUID_TREE_OBJECTID);
4697 if (IS_ERR(uuid_root)) {
4698 ret = PTR_ERR(uuid_root);
4699 btrfs_abort_transaction(trans, ret);
4700 btrfs_end_transaction(trans);
4704 fs_info->uuid_root = uuid_root;
4706 ret = btrfs_commit_transaction(trans);
4710 down(&fs_info->uuid_tree_rescan_sem);
4711 task = kthread_run(btrfs_uuid_scan_kthread, fs_info, "btrfs-uuid");
4713 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4714 btrfs_warn(fs_info, "failed to start uuid_scan task");
4715 up(&fs_info->uuid_tree_rescan_sem);
4716 return PTR_ERR(task);
4723 * shrinking a device means finding all of the device extents past
4724 * the new size, and then following the back refs to the chunks.
4725 * The chunk relocation code actually frees the device extent
4727 int btrfs_shrink_device(struct btrfs_device *device, u64 new_size)
4729 struct btrfs_fs_info *fs_info = device->fs_info;
4730 struct btrfs_root *root = fs_info->dev_root;
4731 struct btrfs_trans_handle *trans;
4732 struct btrfs_dev_extent *dev_extent = NULL;
4733 struct btrfs_path *path;
4739 bool retried = false;
4740 struct extent_buffer *l;
4741 struct btrfs_key key;
4742 struct btrfs_super_block *super_copy = fs_info->super_copy;
4743 u64 old_total = btrfs_super_total_bytes(super_copy);
4744 u64 old_size = btrfs_device_get_total_bytes(device);
4748 new_size = round_down(new_size, fs_info->sectorsize);
4750 diff = round_down(old_size - new_size, fs_info->sectorsize);
4752 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
4755 path = btrfs_alloc_path();
4759 path->reada = READA_BACK;
4761 trans = btrfs_start_transaction(root, 0);
4762 if (IS_ERR(trans)) {
4763 btrfs_free_path(path);
4764 return PTR_ERR(trans);
4767 mutex_lock(&fs_info->chunk_mutex);
4769 btrfs_device_set_total_bytes(device, new_size);
4770 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
4771 device->fs_devices->total_rw_bytes -= diff;
4772 atomic64_sub(diff, &fs_info->free_chunk_space);
4776 * Once the device's size has been set to the new size, ensure all
4777 * in-memory chunks are synced to disk so that the loop below sees them
4778 * and relocates them accordingly.
4780 if (contains_pending_extent(device, &start, diff)) {
4781 mutex_unlock(&fs_info->chunk_mutex);
4782 ret = btrfs_commit_transaction(trans);
4786 mutex_unlock(&fs_info->chunk_mutex);
4787 btrfs_end_transaction(trans);
4791 key.objectid = device->devid;
4792 key.offset = (u64)-1;
4793 key.type = BTRFS_DEV_EXTENT_KEY;
4796 mutex_lock(&fs_info->reclaim_bgs_lock);
4797 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4799 mutex_unlock(&fs_info->reclaim_bgs_lock);
4803 ret = btrfs_previous_item(root, path, 0, key.type);
4805 mutex_unlock(&fs_info->reclaim_bgs_lock);
4809 btrfs_release_path(path);
4814 slot = path->slots[0];
4815 btrfs_item_key_to_cpu(l, &key, path->slots[0]);
4817 if (key.objectid != device->devid) {
4818 mutex_unlock(&fs_info->reclaim_bgs_lock);
4819 btrfs_release_path(path);
4823 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
4824 length = btrfs_dev_extent_length(l, dev_extent);
4826 if (key.offset + length <= new_size) {
4827 mutex_unlock(&fs_info->reclaim_bgs_lock);
4828 btrfs_release_path(path);
4832 chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
4833 btrfs_release_path(path);
4836 * We may be relocating the only data chunk we have,
4837 * which could potentially end up with losing data's
4838 * raid profile, so lets allocate an empty one in
4841 ret = btrfs_may_alloc_data_chunk(fs_info, chunk_offset);
4843 mutex_unlock(&fs_info->reclaim_bgs_lock);
4847 ret = btrfs_relocate_chunk(fs_info, chunk_offset);
4848 mutex_unlock(&fs_info->reclaim_bgs_lock);
4849 if (ret == -ENOSPC) {
4852 if (ret == -ETXTBSY) {
4854 "could not shrink block group %llu due to active swapfile",
4859 } while (key.offset-- > 0);
4861 if (failed && !retried) {
4865 } else if (failed && retried) {
4870 /* Shrinking succeeded, else we would be at "done". */
4871 trans = btrfs_start_transaction(root, 0);
4872 if (IS_ERR(trans)) {
4873 ret = PTR_ERR(trans);
4877 mutex_lock(&fs_info->chunk_mutex);
4878 /* Clear all state bits beyond the shrunk device size */
4879 clear_extent_bits(&device->alloc_state, new_size, (u64)-1,
4882 btrfs_device_set_disk_total_bytes(device, new_size);
4883 if (list_empty(&device->post_commit_list))
4884 list_add_tail(&device->post_commit_list,
4885 &trans->transaction->dev_update_list);
4887 WARN_ON(diff > old_total);
4888 btrfs_set_super_total_bytes(super_copy,
4889 round_down(old_total - diff, fs_info->sectorsize));
4890 mutex_unlock(&fs_info->chunk_mutex);
4892 /* Now btrfs_update_device() will change the on-disk size. */
4893 ret = btrfs_update_device(trans, device);
4895 btrfs_abort_transaction(trans, ret);
4896 btrfs_end_transaction(trans);
4898 ret = btrfs_commit_transaction(trans);
4901 btrfs_free_path(path);
4903 mutex_lock(&fs_info->chunk_mutex);
4904 btrfs_device_set_total_bytes(device, old_size);
4905 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
4906 device->fs_devices->total_rw_bytes += diff;
4907 atomic64_add(diff, &fs_info->free_chunk_space);
4908 mutex_unlock(&fs_info->chunk_mutex);
4913 static int btrfs_add_system_chunk(struct btrfs_fs_info *fs_info,
4914 struct btrfs_key *key,
4915 struct btrfs_chunk *chunk, int item_size)
4917 struct btrfs_super_block *super_copy = fs_info->super_copy;
4918 struct btrfs_disk_key disk_key;
4922 lockdep_assert_held(&fs_info->chunk_mutex);
4924 array_size = btrfs_super_sys_array_size(super_copy);
4925 if (array_size + item_size + sizeof(disk_key)
4926 > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE)
4929 ptr = super_copy->sys_chunk_array + array_size;
4930 btrfs_cpu_key_to_disk(&disk_key, key);
4931 memcpy(ptr, &disk_key, sizeof(disk_key));
4932 ptr += sizeof(disk_key);
4933 memcpy(ptr, chunk, item_size);
4934 item_size += sizeof(disk_key);
4935 btrfs_set_super_sys_array_size(super_copy, array_size + item_size);
4941 * sort the devices in descending order by max_avail, total_avail
4943 static int btrfs_cmp_device_info(const void *a, const void *b)
4945 const struct btrfs_device_info *di_a = a;
4946 const struct btrfs_device_info *di_b = b;
4948 if (di_a->max_avail > di_b->max_avail)
4950 if (di_a->max_avail < di_b->max_avail)
4952 if (di_a->total_avail > di_b->total_avail)
4954 if (di_a->total_avail < di_b->total_avail)
4959 static void check_raid56_incompat_flag(struct btrfs_fs_info *info, u64 type)
4961 if (!(type & BTRFS_BLOCK_GROUP_RAID56_MASK))
4964 btrfs_set_fs_incompat(info, RAID56);
4967 static void check_raid1c34_incompat_flag(struct btrfs_fs_info *info, u64 type)
4969 if (!(type & (BTRFS_BLOCK_GROUP_RAID1C3 | BTRFS_BLOCK_GROUP_RAID1C4)))
4972 btrfs_set_fs_incompat(info, RAID1C34);
4976 * Structure used internally for __btrfs_alloc_chunk() function.
4977 * Wraps needed parameters.
4979 struct alloc_chunk_ctl {
4982 /* Total number of stripes to allocate */
4984 /* sub_stripes info for map */
4986 /* Stripes per device */
4988 /* Maximum number of devices to use */
4990 /* Minimum number of devices to use */
4992 /* ndevs has to be a multiple of this */
4994 /* Number of copies */
4996 /* Number of stripes worth of bytes to store parity information */
4998 u64 max_stripe_size;
5006 static void init_alloc_chunk_ctl_policy_regular(
5007 struct btrfs_fs_devices *fs_devices,
5008 struct alloc_chunk_ctl *ctl)
5010 u64 type = ctl->type;
5012 if (type & BTRFS_BLOCK_GROUP_DATA) {
5013 ctl->max_stripe_size = SZ_1G;
5014 ctl->max_chunk_size = BTRFS_MAX_DATA_CHUNK_SIZE;
5015 } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
5016 /* For larger filesystems, use larger metadata chunks */
5017 if (fs_devices->total_rw_bytes > 50ULL * SZ_1G)
5018 ctl->max_stripe_size = SZ_1G;
5020 ctl->max_stripe_size = SZ_256M;
5021 ctl->max_chunk_size = ctl->max_stripe_size;
5022 } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
5023 ctl->max_stripe_size = SZ_32M;
5024 ctl->max_chunk_size = 2 * ctl->max_stripe_size;
5025 ctl->devs_max = min_t(int, ctl->devs_max,
5026 BTRFS_MAX_DEVS_SYS_CHUNK);
5031 /* We don't want a chunk larger than 10% of writable space */
5032 ctl->max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1),
5033 ctl->max_chunk_size);
5034 ctl->dev_extent_min = BTRFS_STRIPE_LEN * ctl->dev_stripes;
5037 static void init_alloc_chunk_ctl_policy_zoned(
5038 struct btrfs_fs_devices *fs_devices,
5039 struct alloc_chunk_ctl *ctl)
5041 u64 zone_size = fs_devices->fs_info->zone_size;
5043 int min_num_stripes = ctl->devs_min * ctl->dev_stripes;
5044 int min_data_stripes = (min_num_stripes - ctl->nparity) / ctl->ncopies;
5045 u64 min_chunk_size = min_data_stripes * zone_size;
5046 u64 type = ctl->type;
5048 ctl->max_stripe_size = zone_size;
5049 if (type & BTRFS_BLOCK_GROUP_DATA) {
5050 ctl->max_chunk_size = round_down(BTRFS_MAX_DATA_CHUNK_SIZE,
5052 } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
5053 ctl->max_chunk_size = ctl->max_stripe_size;
5054 } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
5055 ctl->max_chunk_size = 2 * ctl->max_stripe_size;
5056 ctl->devs_max = min_t(int, ctl->devs_max,
5057 BTRFS_MAX_DEVS_SYS_CHUNK);
5062 /* We don't want a chunk larger than 10% of writable space */
5063 limit = max(round_down(div_factor(fs_devices->total_rw_bytes, 1),
5066 ctl->max_chunk_size = min(limit, ctl->max_chunk_size);
5067 ctl->dev_extent_min = zone_size * ctl->dev_stripes;
5070 static void init_alloc_chunk_ctl(struct btrfs_fs_devices *fs_devices,
5071 struct alloc_chunk_ctl *ctl)
5073 int index = btrfs_bg_flags_to_raid_index(ctl->type);
5075 ctl->sub_stripes = btrfs_raid_array[index].sub_stripes;
5076 ctl->dev_stripes = btrfs_raid_array[index].dev_stripes;
5077 ctl->devs_max = btrfs_raid_array[index].devs_max;
5079 ctl->devs_max = BTRFS_MAX_DEVS(fs_devices->fs_info);
5080 ctl->devs_min = btrfs_raid_array[index].devs_min;
5081 ctl->devs_increment = btrfs_raid_array[index].devs_increment;
5082 ctl->ncopies = btrfs_raid_array[index].ncopies;
5083 ctl->nparity = btrfs_raid_array[index].nparity;
5086 switch (fs_devices->chunk_alloc_policy) {
5087 case BTRFS_CHUNK_ALLOC_REGULAR:
5088 init_alloc_chunk_ctl_policy_regular(fs_devices, ctl);
5090 case BTRFS_CHUNK_ALLOC_ZONED:
5091 init_alloc_chunk_ctl_policy_zoned(fs_devices, ctl);
5098 static int gather_device_info(struct btrfs_fs_devices *fs_devices,
5099 struct alloc_chunk_ctl *ctl,
5100 struct btrfs_device_info *devices_info)
5102 struct btrfs_fs_info *info = fs_devices->fs_info;
5103 struct btrfs_device *device;
5105 u64 dev_extent_want = ctl->max_stripe_size * ctl->dev_stripes;
5112 * in the first pass through the devices list, we gather information
5113 * about the available holes on each device.
5115 list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
5116 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
5118 "BTRFS: read-only device in alloc_list\n");
5122 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
5123 &device->dev_state) ||
5124 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
5127 if (device->total_bytes > device->bytes_used)
5128 total_avail = device->total_bytes - device->bytes_used;
5132 /* If there is no space on this device, skip it. */
5133 if (total_avail < ctl->dev_extent_min)
5136 ret = find_free_dev_extent(device, dev_extent_want, &dev_offset,
5138 if (ret && ret != -ENOSPC)
5142 max_avail = dev_extent_want;
5144 if (max_avail < ctl->dev_extent_min) {
5145 if (btrfs_test_opt(info, ENOSPC_DEBUG))
5147 "%s: devid %llu has no free space, have=%llu want=%llu",
5148 __func__, device->devid, max_avail,
5149 ctl->dev_extent_min);
5153 if (ndevs == fs_devices->rw_devices) {
5154 WARN(1, "%s: found more than %llu devices\n",
5155 __func__, fs_devices->rw_devices);
5158 devices_info[ndevs].dev_offset = dev_offset;
5159 devices_info[ndevs].max_avail = max_avail;
5160 devices_info[ndevs].total_avail = total_avail;
5161 devices_info[ndevs].dev = device;
5167 * now sort the devices by hole size / available space
5169 sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
5170 btrfs_cmp_device_info, NULL);
5175 static int decide_stripe_size_regular(struct alloc_chunk_ctl *ctl,
5176 struct btrfs_device_info *devices_info)
5178 /* Number of stripes that count for block group size */
5182 * The primary goal is to maximize the number of stripes, so use as
5183 * many devices as possible, even if the stripes are not maximum sized.
5185 * The DUP profile stores more than one stripe per device, the
5186 * max_avail is the total size so we have to adjust.
5188 ctl->stripe_size = div_u64(devices_info[ctl->ndevs - 1].max_avail,
5190 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5192 /* This will have to be fixed for RAID1 and RAID10 over more drives */
5193 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5196 * Use the number of data stripes to figure out how big this chunk is
5197 * really going to be in terms of logical address space, and compare
5198 * that answer with the max chunk size. If it's higher, we try to
5199 * reduce stripe_size.
5201 if (ctl->stripe_size * data_stripes > ctl->max_chunk_size) {
5203 * Reduce stripe_size, round it up to a 16MB boundary again and
5204 * then use it, unless it ends up being even bigger than the
5205 * previous value we had already.
5207 ctl->stripe_size = min(round_up(div_u64(ctl->max_chunk_size,
5208 data_stripes), SZ_16M),
5212 /* Align to BTRFS_STRIPE_LEN */
5213 ctl->stripe_size = round_down(ctl->stripe_size, BTRFS_STRIPE_LEN);
5214 ctl->chunk_size = ctl->stripe_size * data_stripes;
5219 static int decide_stripe_size_zoned(struct alloc_chunk_ctl *ctl,
5220 struct btrfs_device_info *devices_info)
5222 u64 zone_size = devices_info[0].dev->zone_info->zone_size;
5223 /* Number of stripes that count for block group size */
5227 * It should hold because:
5228 * dev_extent_min == dev_extent_want == zone_size * dev_stripes
5230 ASSERT(devices_info[ctl->ndevs - 1].max_avail == ctl->dev_extent_min);
5232 ctl->stripe_size = zone_size;
5233 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5234 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5236 /* stripe_size is fixed in zoned filesysmte. Reduce ndevs instead. */
5237 if (ctl->stripe_size * data_stripes > ctl->max_chunk_size) {
5238 ctl->ndevs = div_u64(div_u64(ctl->max_chunk_size * ctl->ncopies,
5239 ctl->stripe_size) + ctl->nparity,
5241 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5242 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5243 ASSERT(ctl->stripe_size * data_stripes <= ctl->max_chunk_size);
5246 ctl->chunk_size = ctl->stripe_size * data_stripes;
5251 static int decide_stripe_size(struct btrfs_fs_devices *fs_devices,
5252 struct alloc_chunk_ctl *ctl,
5253 struct btrfs_device_info *devices_info)
5255 struct btrfs_fs_info *info = fs_devices->fs_info;
5258 * Round down to number of usable stripes, devs_increment can be any
5259 * number so we can't use round_down() that requires power of 2, while
5260 * rounddown is safe.
5262 ctl->ndevs = rounddown(ctl->ndevs, ctl->devs_increment);
5264 if (ctl->ndevs < ctl->devs_min) {
5265 if (btrfs_test_opt(info, ENOSPC_DEBUG)) {
5267 "%s: not enough devices with free space: have=%d minimum required=%d",
5268 __func__, ctl->ndevs, ctl->devs_min);
5273 ctl->ndevs = min(ctl->ndevs, ctl->devs_max);
5275 switch (fs_devices->chunk_alloc_policy) {
5276 case BTRFS_CHUNK_ALLOC_REGULAR:
5277 return decide_stripe_size_regular(ctl, devices_info);
5278 case BTRFS_CHUNK_ALLOC_ZONED:
5279 return decide_stripe_size_zoned(ctl, devices_info);
5285 static struct btrfs_block_group *create_chunk(struct btrfs_trans_handle *trans,
5286 struct alloc_chunk_ctl *ctl,
5287 struct btrfs_device_info *devices_info)
5289 struct btrfs_fs_info *info = trans->fs_info;
5290 struct map_lookup *map = NULL;
5291 struct extent_map_tree *em_tree;
5292 struct btrfs_block_group *block_group;
5293 struct extent_map *em;
5294 u64 start = ctl->start;
5295 u64 type = ctl->type;
5300 map = kmalloc(map_lookup_size(ctl->num_stripes), GFP_NOFS);
5302 return ERR_PTR(-ENOMEM);
5303 map->num_stripes = ctl->num_stripes;
5305 for (i = 0; i < ctl->ndevs; ++i) {
5306 for (j = 0; j < ctl->dev_stripes; ++j) {
5307 int s = i * ctl->dev_stripes + j;
5308 map->stripes[s].dev = devices_info[i].dev;
5309 map->stripes[s].physical = devices_info[i].dev_offset +
5310 j * ctl->stripe_size;
5313 map->stripe_len = BTRFS_STRIPE_LEN;
5314 map->io_align = BTRFS_STRIPE_LEN;
5315 map->io_width = BTRFS_STRIPE_LEN;
5317 map->sub_stripes = ctl->sub_stripes;
5319 trace_btrfs_chunk_alloc(info, map, start, ctl->chunk_size);
5321 em = alloc_extent_map();
5324 return ERR_PTR(-ENOMEM);
5326 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
5327 em->map_lookup = map;
5329 em->len = ctl->chunk_size;
5330 em->block_start = 0;
5331 em->block_len = em->len;
5332 em->orig_block_len = ctl->stripe_size;
5334 em_tree = &info->mapping_tree;
5335 write_lock(&em_tree->lock);
5336 ret = add_extent_mapping(em_tree, em, 0);
5338 write_unlock(&em_tree->lock);
5339 free_extent_map(em);
5340 return ERR_PTR(ret);
5342 write_unlock(&em_tree->lock);
5344 block_group = btrfs_make_block_group(trans, 0, type, start, ctl->chunk_size);
5345 if (IS_ERR(block_group))
5346 goto error_del_extent;
5348 for (i = 0; i < map->num_stripes; i++) {
5349 struct btrfs_device *dev = map->stripes[i].dev;
5351 btrfs_device_set_bytes_used(dev,
5352 dev->bytes_used + ctl->stripe_size);
5353 if (list_empty(&dev->post_commit_list))
5354 list_add_tail(&dev->post_commit_list,
5355 &trans->transaction->dev_update_list);
5358 atomic64_sub(ctl->stripe_size * map->num_stripes,
5359 &info->free_chunk_space);
5361 free_extent_map(em);
5362 check_raid56_incompat_flag(info, type);
5363 check_raid1c34_incompat_flag(info, type);
5368 write_lock(&em_tree->lock);
5369 remove_extent_mapping(em_tree, em);
5370 write_unlock(&em_tree->lock);
5372 /* One for our allocation */
5373 free_extent_map(em);
5374 /* One for the tree reference */
5375 free_extent_map(em);
5380 struct btrfs_block_group *btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
5383 struct btrfs_fs_info *info = trans->fs_info;
5384 struct btrfs_fs_devices *fs_devices = info->fs_devices;
5385 struct btrfs_device_info *devices_info = NULL;
5386 struct alloc_chunk_ctl ctl;
5387 struct btrfs_block_group *block_group;
5390 lockdep_assert_held(&info->chunk_mutex);
5392 if (!alloc_profile_is_valid(type, 0)) {
5394 return ERR_PTR(-EINVAL);
5397 if (list_empty(&fs_devices->alloc_list)) {
5398 if (btrfs_test_opt(info, ENOSPC_DEBUG))
5399 btrfs_debug(info, "%s: no writable device", __func__);
5400 return ERR_PTR(-ENOSPC);
5403 if (!(type & BTRFS_BLOCK_GROUP_TYPE_MASK)) {
5404 btrfs_err(info, "invalid chunk type 0x%llx requested", type);
5406 return ERR_PTR(-EINVAL);
5409 ctl.start = find_next_chunk(info);
5411 init_alloc_chunk_ctl(fs_devices, &ctl);
5413 devices_info = kcalloc(fs_devices->rw_devices, sizeof(*devices_info),
5416 return ERR_PTR(-ENOMEM);
5418 ret = gather_device_info(fs_devices, &ctl, devices_info);
5420 block_group = ERR_PTR(ret);
5424 ret = decide_stripe_size(fs_devices, &ctl, devices_info);
5426 block_group = ERR_PTR(ret);
5430 block_group = create_chunk(trans, &ctl, devices_info);
5433 kfree(devices_info);
5438 * This function, btrfs_chunk_alloc_add_chunk_item(), typically belongs to the
5439 * phase 1 of chunk allocation. It belongs to phase 2 only when allocating system
5442 * See the comment at btrfs_chunk_alloc() for details about the chunk allocation
5445 int btrfs_chunk_alloc_add_chunk_item(struct btrfs_trans_handle *trans,
5446 struct btrfs_block_group *bg)
5448 struct btrfs_fs_info *fs_info = trans->fs_info;
5449 struct btrfs_root *extent_root = fs_info->extent_root;
5450 struct btrfs_root *chunk_root = fs_info->chunk_root;
5451 struct btrfs_key key;
5452 struct btrfs_chunk *chunk;
5453 struct btrfs_stripe *stripe;
5454 struct extent_map *em;
5455 struct map_lookup *map;
5461 * We take the chunk_mutex for 2 reasons:
5463 * 1) Updates and insertions in the chunk btree must be done while holding
5464 * the chunk_mutex, as well as updating the system chunk array in the
5465 * superblock. See the comment on top of btrfs_chunk_alloc() for the
5468 * 2) To prevent races with the final phase of a device replace operation
5469 * that replaces the device object associated with the map's stripes,
5470 * because the device object's id can change at any time during that
5471 * final phase of the device replace operation
5472 * (dev-replace.c:btrfs_dev_replace_finishing()), so we could grab the
5473 * replaced device and then see it with an ID of BTRFS_DEV_REPLACE_DEVID,
5474 * which would cause a failure when updating the device item, which does
5475 * not exists, or persisting a stripe of the chunk item with such ID.
5476 * Here we can't use the device_list_mutex because our caller already
5477 * has locked the chunk_mutex, and the final phase of device replace
5478 * acquires both mutexes - first the device_list_mutex and then the
5479 * chunk_mutex. Using any of those two mutexes protects us from a
5480 * concurrent device replace.
5482 lockdep_assert_held(&fs_info->chunk_mutex);
5484 em = btrfs_get_chunk_map(fs_info, bg->start, bg->length);
5487 btrfs_abort_transaction(trans, ret);
5491 map = em->map_lookup;
5492 item_size = btrfs_chunk_item_size(map->num_stripes);
5494 chunk = kzalloc(item_size, GFP_NOFS);
5497 btrfs_abort_transaction(trans, ret);
5501 for (i = 0; i < map->num_stripes; i++) {
5502 struct btrfs_device *device = map->stripes[i].dev;
5504 ret = btrfs_update_device(trans, device);
5509 stripe = &chunk->stripe;
5510 for (i = 0; i < map->num_stripes; i++) {
5511 struct btrfs_device *device = map->stripes[i].dev;
5512 const u64 dev_offset = map->stripes[i].physical;
5514 btrfs_set_stack_stripe_devid(stripe, device->devid);
5515 btrfs_set_stack_stripe_offset(stripe, dev_offset);
5516 memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE);
5520 btrfs_set_stack_chunk_length(chunk, bg->length);
5521 btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid);
5522 btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len);
5523 btrfs_set_stack_chunk_type(chunk, map->type);
5524 btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes);
5525 btrfs_set_stack_chunk_io_align(chunk, map->stripe_len);
5526 btrfs_set_stack_chunk_io_width(chunk, map->stripe_len);
5527 btrfs_set_stack_chunk_sector_size(chunk, fs_info->sectorsize);
5528 btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes);
5530 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
5531 key.type = BTRFS_CHUNK_ITEM_KEY;
5532 key.offset = bg->start;
5534 ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size);
5538 bg->chunk_item_inserted = 1;
5540 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
5541 ret = btrfs_add_system_chunk(fs_info, &key, chunk, item_size);
5548 free_extent_map(em);
5552 static noinline int init_first_rw_device(struct btrfs_trans_handle *trans)
5554 struct btrfs_fs_info *fs_info = trans->fs_info;
5556 struct btrfs_block_group *meta_bg;
5557 struct btrfs_block_group *sys_bg;
5560 * When adding a new device for sprouting, the seed device is read-only
5561 * so we must first allocate a metadata and a system chunk. But before
5562 * adding the block group items to the extent, device and chunk btrees,
5565 * 1) Create both chunks without doing any changes to the btrees, as
5566 * otherwise we would get -ENOSPC since the block groups from the
5567 * seed device are read-only;
5569 * 2) Add the device item for the new sprout device - finishing the setup
5570 * of a new block group requires updating the device item in the chunk
5571 * btree, so it must exist when we attempt to do it. The previous step
5572 * ensures this does not fail with -ENOSPC.
5574 * After that we can add the block group items to their btrees:
5575 * update existing device item in the chunk btree, add a new block group
5576 * item to the extent btree, add a new chunk item to the chunk btree and
5577 * finally add the new device extent items to the devices btree.
5580 alloc_profile = btrfs_metadata_alloc_profile(fs_info);
5581 meta_bg = btrfs_alloc_chunk(trans, alloc_profile);
5582 if (IS_ERR(meta_bg))
5583 return PTR_ERR(meta_bg);
5585 alloc_profile = btrfs_system_alloc_profile(fs_info);
5586 sys_bg = btrfs_alloc_chunk(trans, alloc_profile);
5588 return PTR_ERR(sys_bg);
5593 static inline int btrfs_chunk_max_errors(struct map_lookup *map)
5595 const int index = btrfs_bg_flags_to_raid_index(map->type);
5597 return btrfs_raid_array[index].tolerated_failures;
5600 int btrfs_chunk_readonly(struct btrfs_fs_info *fs_info, u64 chunk_offset)
5602 struct extent_map *em;
5603 struct map_lookup *map;
5608 em = btrfs_get_chunk_map(fs_info, chunk_offset, 1);
5612 map = em->map_lookup;
5613 for (i = 0; i < map->num_stripes; i++) {
5614 if (test_bit(BTRFS_DEV_STATE_MISSING,
5615 &map->stripes[i].dev->dev_state)) {
5619 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE,
5620 &map->stripes[i].dev->dev_state)) {
5627 * If the number of missing devices is larger than max errors,
5628 * we can not write the data into that chunk successfully, so
5631 if (miss_ndevs > btrfs_chunk_max_errors(map))
5634 free_extent_map(em);
5638 void btrfs_mapping_tree_free(struct extent_map_tree *tree)
5640 struct extent_map *em;
5643 write_lock(&tree->lock);
5644 em = lookup_extent_mapping(tree, 0, (u64)-1);
5646 remove_extent_mapping(tree, em);
5647 write_unlock(&tree->lock);
5651 free_extent_map(em);
5652 /* once for the tree */
5653 free_extent_map(em);
5657 int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5659 struct extent_map *em;
5660 struct map_lookup *map;
5663 em = btrfs_get_chunk_map(fs_info, logical, len);
5666 * We could return errors for these cases, but that could get
5667 * ugly and we'd probably do the same thing which is just not do
5668 * anything else and exit, so return 1 so the callers don't try
5669 * to use other copies.
5673 map = em->map_lookup;
5674 if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1_MASK))
5675 ret = map->num_stripes;
5676 else if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5677 ret = map->sub_stripes;
5678 else if (map->type & BTRFS_BLOCK_GROUP_RAID5)
5680 else if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5682 * There could be two corrupted data stripes, we need
5683 * to loop retry in order to rebuild the correct data.
5685 * Fail a stripe at a time on every retry except the
5686 * stripe under reconstruction.
5688 ret = map->num_stripes;
5691 free_extent_map(em);
5693 down_read(&fs_info->dev_replace.rwsem);
5694 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace) &&
5695 fs_info->dev_replace.tgtdev)
5697 up_read(&fs_info->dev_replace.rwsem);
5702 unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
5705 struct extent_map *em;
5706 struct map_lookup *map;
5707 unsigned long len = fs_info->sectorsize;
5709 em = btrfs_get_chunk_map(fs_info, logical, len);
5711 if (!WARN_ON(IS_ERR(em))) {
5712 map = em->map_lookup;
5713 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5714 len = map->stripe_len * nr_data_stripes(map);
5715 free_extent_map(em);
5720 int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5722 struct extent_map *em;
5723 struct map_lookup *map;
5726 em = btrfs_get_chunk_map(fs_info, logical, len);
5728 if(!WARN_ON(IS_ERR(em))) {
5729 map = em->map_lookup;
5730 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5732 free_extent_map(em);
5737 static int find_live_mirror(struct btrfs_fs_info *fs_info,
5738 struct map_lookup *map, int first,
5739 int dev_replace_is_ongoing)
5743 int preferred_mirror;
5745 struct btrfs_device *srcdev;
5748 (BTRFS_BLOCK_GROUP_RAID1_MASK | BTRFS_BLOCK_GROUP_RAID10)));
5750 if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5751 num_stripes = map->sub_stripes;
5753 num_stripes = map->num_stripes;
5755 switch (fs_info->fs_devices->read_policy) {
5757 /* Shouldn't happen, just warn and use pid instead of failing */
5758 btrfs_warn_rl(fs_info,
5759 "unknown read_policy type %u, reset to pid",
5760 fs_info->fs_devices->read_policy);
5761 fs_info->fs_devices->read_policy = BTRFS_READ_POLICY_PID;
5763 case BTRFS_READ_POLICY_PID:
5764 preferred_mirror = first + (current->pid % num_stripes);
5768 if (dev_replace_is_ongoing &&
5769 fs_info->dev_replace.cont_reading_from_srcdev_mode ==
5770 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID)
5771 srcdev = fs_info->dev_replace.srcdev;
5776 * try to avoid the drive that is the source drive for a
5777 * dev-replace procedure, only choose it if no other non-missing
5778 * mirror is available
5780 for (tolerance = 0; tolerance < 2; tolerance++) {
5781 if (map->stripes[preferred_mirror].dev->bdev &&
5782 (tolerance || map->stripes[preferred_mirror].dev != srcdev))
5783 return preferred_mirror;
5784 for (i = first; i < first + num_stripes; i++) {
5785 if (map->stripes[i].dev->bdev &&
5786 (tolerance || map->stripes[i].dev != srcdev))
5791 /* we couldn't find one that doesn't fail. Just return something
5792 * and the io error handling code will clean up eventually
5794 return preferred_mirror;
5797 /* Bubble-sort the stripe set to put the parity/syndrome stripes last */
5798 static void sort_parity_stripes(struct btrfs_bio *bbio, int num_stripes)
5805 for (i = 0; i < num_stripes - 1; i++) {
5806 /* Swap if parity is on a smaller index */
5807 if (bbio->raid_map[i] > bbio->raid_map[i + 1]) {
5808 swap(bbio->stripes[i], bbio->stripes[i + 1]);
5809 swap(bbio->raid_map[i], bbio->raid_map[i + 1]);
5816 static struct btrfs_bio *alloc_btrfs_bio(int total_stripes, int real_stripes)
5818 struct btrfs_bio *bbio = kzalloc(
5819 /* the size of the btrfs_bio */
5820 sizeof(struct btrfs_bio) +
5821 /* plus the variable array for the stripes */
5822 sizeof(struct btrfs_bio_stripe) * (total_stripes) +
5823 /* plus the variable array for the tgt dev */
5824 sizeof(int) * (real_stripes) +
5826 * plus the raid_map, which includes both the tgt dev
5829 sizeof(u64) * (total_stripes),
5830 GFP_NOFS|__GFP_NOFAIL);
5832 atomic_set(&bbio->error, 0);
5833 refcount_set(&bbio->refs, 1);
5835 bbio->tgtdev_map = (int *)(bbio->stripes + total_stripes);
5836 bbio->raid_map = (u64 *)(bbio->tgtdev_map + real_stripes);
5841 void btrfs_get_bbio(struct btrfs_bio *bbio)
5843 WARN_ON(!refcount_read(&bbio->refs));
5844 refcount_inc(&bbio->refs);
5847 void btrfs_put_bbio(struct btrfs_bio *bbio)
5851 if (refcount_dec_and_test(&bbio->refs))
5855 /* can REQ_OP_DISCARD be sent with other REQ like REQ_OP_WRITE? */
5857 * Please note that, discard won't be sent to target device of device
5860 static int __btrfs_map_block_for_discard(struct btrfs_fs_info *fs_info,
5861 u64 logical, u64 *length_ret,
5862 struct btrfs_bio **bbio_ret)
5864 struct extent_map *em;
5865 struct map_lookup *map;
5866 struct btrfs_bio *bbio;
5867 u64 length = *length_ret;
5871 u64 stripe_end_offset;
5878 u32 sub_stripes = 0;
5879 u64 stripes_per_dev = 0;
5880 u32 remaining_stripes = 0;
5881 u32 last_stripe = 0;
5885 /* discard always return a bbio */
5888 em = btrfs_get_chunk_map(fs_info, logical, length);
5892 map = em->map_lookup;
5893 /* we don't discard raid56 yet */
5894 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5899 offset = logical - em->start;
5900 length = min_t(u64, em->start + em->len - logical, length);
5901 *length_ret = length;
5903 stripe_len = map->stripe_len;
5905 * stripe_nr counts the total number of stripes we have to stride
5906 * to get to this block
5908 stripe_nr = div64_u64(offset, stripe_len);
5910 /* stripe_offset is the offset of this block in its stripe */
5911 stripe_offset = offset - stripe_nr * stripe_len;
5913 stripe_nr_end = round_up(offset + length, map->stripe_len);
5914 stripe_nr_end = div64_u64(stripe_nr_end, map->stripe_len);
5915 stripe_cnt = stripe_nr_end - stripe_nr;
5916 stripe_end_offset = stripe_nr_end * map->stripe_len -
5919 * after this, stripe_nr is the number of stripes on this
5920 * device we have to walk to find the data, and stripe_index is
5921 * the number of our device in the stripe array
5925 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5926 BTRFS_BLOCK_GROUP_RAID10)) {
5927 if (map->type & BTRFS_BLOCK_GROUP_RAID0)
5930 sub_stripes = map->sub_stripes;
5932 factor = map->num_stripes / sub_stripes;
5933 num_stripes = min_t(u64, map->num_stripes,
5934 sub_stripes * stripe_cnt);
5935 stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index);
5936 stripe_index *= sub_stripes;
5937 stripes_per_dev = div_u64_rem(stripe_cnt, factor,
5938 &remaining_stripes);
5939 div_u64_rem(stripe_nr_end - 1, factor, &last_stripe);
5940 last_stripe *= sub_stripes;
5941 } else if (map->type & (BTRFS_BLOCK_GROUP_RAID1_MASK |
5942 BTRFS_BLOCK_GROUP_DUP)) {
5943 num_stripes = map->num_stripes;
5945 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5949 bbio = alloc_btrfs_bio(num_stripes, 0);
5955 for (i = 0; i < num_stripes; i++) {
5956 bbio->stripes[i].physical =
5957 map->stripes[stripe_index].physical +
5958 stripe_offset + stripe_nr * map->stripe_len;
5959 bbio->stripes[i].dev = map->stripes[stripe_index].dev;
5961 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5962 BTRFS_BLOCK_GROUP_RAID10)) {
5963 bbio->stripes[i].length = stripes_per_dev *
5966 if (i / sub_stripes < remaining_stripes)
5967 bbio->stripes[i].length +=
5971 * Special for the first stripe and
5974 * |-------|...|-------|
5978 if (i < sub_stripes)
5979 bbio->stripes[i].length -=
5982 if (stripe_index >= last_stripe &&
5983 stripe_index <= (last_stripe +
5985 bbio->stripes[i].length -=
5988 if (i == sub_stripes - 1)
5991 bbio->stripes[i].length = length;
5995 if (stripe_index == map->num_stripes) {
6002 bbio->map_type = map->type;
6003 bbio->num_stripes = num_stripes;
6005 free_extent_map(em);
6010 * In dev-replace case, for repair case (that's the only case where the mirror
6011 * is selected explicitly when calling btrfs_map_block), blocks left of the
6012 * left cursor can also be read from the target drive.
6014 * For REQ_GET_READ_MIRRORS, the target drive is added as the last one to the
6016 * For READ, it also needs to be supported using the same mirror number.
6018 * If the requested block is not left of the left cursor, EIO is returned. This
6019 * can happen because btrfs_num_copies() returns one more in the dev-replace
6022 static int get_extra_mirror_from_replace(struct btrfs_fs_info *fs_info,
6023 u64 logical, u64 length,
6024 u64 srcdev_devid, int *mirror_num,
6027 struct btrfs_bio *bbio = NULL;
6029 int index_srcdev = 0;
6031 u64 physical_of_found = 0;
6035 ret = __btrfs_map_block(fs_info, BTRFS_MAP_GET_READ_MIRRORS,
6036 logical, &length, &bbio, 0, 0);
6038 ASSERT(bbio == NULL);
6042 num_stripes = bbio->num_stripes;
6043 if (*mirror_num > num_stripes) {
6045 * BTRFS_MAP_GET_READ_MIRRORS does not contain this mirror,
6046 * that means that the requested area is not left of the left
6049 btrfs_put_bbio(bbio);
6054 * process the rest of the function using the mirror_num of the source
6055 * drive. Therefore look it up first. At the end, patch the device
6056 * pointer to the one of the target drive.
6058 for (i = 0; i < num_stripes; i++) {
6059 if (bbio->stripes[i].dev->devid != srcdev_devid)
6063 * In case of DUP, in order to keep it simple, only add the
6064 * mirror with the lowest physical address
6067 physical_of_found <= bbio->stripes[i].physical)
6072 physical_of_found = bbio->stripes[i].physical;
6075 btrfs_put_bbio(bbio);
6081 *mirror_num = index_srcdev + 1;
6082 *physical = physical_of_found;
6086 static bool is_block_group_to_copy(struct btrfs_fs_info *fs_info, u64 logical)
6088 struct btrfs_block_group *cache;
6091 /* Non zoned filesystem does not use "to_copy" flag */
6092 if (!btrfs_is_zoned(fs_info))
6095 cache = btrfs_lookup_block_group(fs_info, logical);
6097 spin_lock(&cache->lock);
6098 ret = cache->to_copy;
6099 spin_unlock(&cache->lock);
6101 btrfs_put_block_group(cache);
6105 static void handle_ops_on_dev_replace(enum btrfs_map_op op,
6106 struct btrfs_bio **bbio_ret,
6107 struct btrfs_dev_replace *dev_replace,
6109 int *num_stripes_ret, int *max_errors_ret)
6111 struct btrfs_bio *bbio = *bbio_ret;
6112 u64 srcdev_devid = dev_replace->srcdev->devid;
6113 int tgtdev_indexes = 0;
6114 int num_stripes = *num_stripes_ret;
6115 int max_errors = *max_errors_ret;
6118 if (op == BTRFS_MAP_WRITE) {
6119 int index_where_to_add;
6122 * A block group which have "to_copy" set will eventually
6123 * copied by dev-replace process. We can avoid cloning IO here.
6125 if (is_block_group_to_copy(dev_replace->srcdev->fs_info, logical))
6129 * duplicate the write operations while the dev replace
6130 * procedure is running. Since the copying of the old disk to
6131 * the new disk takes place at run time while the filesystem is
6132 * mounted writable, the regular write operations to the old
6133 * disk have to be duplicated to go to the new disk as well.
6135 * Note that device->missing is handled by the caller, and that
6136 * the write to the old disk is already set up in the stripes
6139 index_where_to_add = num_stripes;
6140 for (i = 0; i < num_stripes; i++) {
6141 if (bbio->stripes[i].dev->devid == srcdev_devid) {
6142 /* write to new disk, too */
6143 struct btrfs_bio_stripe *new =
6144 bbio->stripes + index_where_to_add;
6145 struct btrfs_bio_stripe *old =
6148 new->physical = old->physical;
6149 new->length = old->length;
6150 new->dev = dev_replace->tgtdev;
6151 bbio->tgtdev_map[i] = index_where_to_add;
6152 index_where_to_add++;
6157 num_stripes = index_where_to_add;
6158 } else if (op == BTRFS_MAP_GET_READ_MIRRORS) {
6159 int index_srcdev = 0;
6161 u64 physical_of_found = 0;
6164 * During the dev-replace procedure, the target drive can also
6165 * be used to read data in case it is needed to repair a corrupt
6166 * block elsewhere. This is possible if the requested area is
6167 * left of the left cursor. In this area, the target drive is a
6168 * full copy of the source drive.
6170 for (i = 0; i < num_stripes; i++) {
6171 if (bbio->stripes[i].dev->devid == srcdev_devid) {
6173 * In case of DUP, in order to keep it simple,
6174 * only add the mirror with the lowest physical
6178 physical_of_found <=
6179 bbio->stripes[i].physical)
6183 physical_of_found = bbio->stripes[i].physical;
6187 struct btrfs_bio_stripe *tgtdev_stripe =
6188 bbio->stripes + num_stripes;
6190 tgtdev_stripe->physical = physical_of_found;
6191 tgtdev_stripe->length =
6192 bbio->stripes[index_srcdev].length;
6193 tgtdev_stripe->dev = dev_replace->tgtdev;
6194 bbio->tgtdev_map[index_srcdev] = num_stripes;
6201 *num_stripes_ret = num_stripes;
6202 *max_errors_ret = max_errors;
6203 bbio->num_tgtdevs = tgtdev_indexes;
6207 static bool need_full_stripe(enum btrfs_map_op op)
6209 return (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS);
6213 * Calculate the geometry of a particular (address, len) tuple. This
6214 * information is used to calculate how big a particular bio can get before it
6215 * straddles a stripe.
6217 * @fs_info: the filesystem
6218 * @em: mapping containing the logical extent
6219 * @op: type of operation - write or read
6220 * @logical: address that we want to figure out the geometry of
6221 * @io_geom: pointer used to return values
6223 * Returns < 0 in case a chunk for the given logical address cannot be found,
6224 * usually shouldn't happen unless @logical is corrupted, 0 otherwise.
6226 int btrfs_get_io_geometry(struct btrfs_fs_info *fs_info, struct extent_map *em,
6227 enum btrfs_map_op op, u64 logical,
6228 struct btrfs_io_geometry *io_geom)
6230 struct map_lookup *map;
6236 u64 raid56_full_stripe_start = (u64)-1;
6239 ASSERT(op != BTRFS_MAP_DISCARD);
6241 map = em->map_lookup;
6242 /* Offset of this logical address in the chunk */
6243 offset = logical - em->start;
6244 /* Len of a stripe in a chunk */
6245 stripe_len = map->stripe_len;
6246 /* Stripe where this block falls in */
6247 stripe_nr = div64_u64(offset, stripe_len);
6248 /* Offset of stripe in the chunk */
6249 stripe_offset = stripe_nr * stripe_len;
6250 if (offset < stripe_offset) {
6252 "stripe math has gone wrong, stripe_offset=%llu offset=%llu start=%llu logical=%llu stripe_len=%llu",
6253 stripe_offset, offset, em->start, logical, stripe_len);
6257 /* stripe_offset is the offset of this block in its stripe */
6258 stripe_offset = offset - stripe_offset;
6259 data_stripes = nr_data_stripes(map);
6261 if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
6262 u64 max_len = stripe_len - stripe_offset;
6265 * In case of raid56, we need to know the stripe aligned start
6267 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
6268 unsigned long full_stripe_len = stripe_len * data_stripes;
6269 raid56_full_stripe_start = offset;
6272 * Allow a write of a full stripe, but make sure we
6273 * don't allow straddling of stripes
6275 raid56_full_stripe_start = div64_u64(raid56_full_stripe_start,
6277 raid56_full_stripe_start *= full_stripe_len;
6280 * For writes to RAID[56], allow a full stripeset across
6281 * all disks. For other RAID types and for RAID[56]
6282 * reads, just allow a single stripe (on a single disk).
6284 if (op == BTRFS_MAP_WRITE) {
6285 max_len = stripe_len * data_stripes -
6286 (offset - raid56_full_stripe_start);
6289 len = min_t(u64, em->len - offset, max_len);
6291 len = em->len - offset;
6295 io_geom->offset = offset;
6296 io_geom->stripe_len = stripe_len;
6297 io_geom->stripe_nr = stripe_nr;
6298 io_geom->stripe_offset = stripe_offset;
6299 io_geom->raid56_stripe_offset = raid56_full_stripe_start;
6304 static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
6305 enum btrfs_map_op op,
6306 u64 logical, u64 *length,
6307 struct btrfs_bio **bbio_ret,
6308 int mirror_num, int need_raid_map)
6310 struct extent_map *em;
6311 struct map_lookup *map;
6321 int tgtdev_indexes = 0;
6322 struct btrfs_bio *bbio = NULL;
6323 struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
6324 int dev_replace_is_ongoing = 0;
6325 int num_alloc_stripes;
6326 int patch_the_first_stripe_for_dev_replace = 0;
6327 u64 physical_to_patch_in_first_stripe = 0;
6328 u64 raid56_full_stripe_start = (u64)-1;
6329 struct btrfs_io_geometry geom;
6332 ASSERT(op != BTRFS_MAP_DISCARD);
6334 em = btrfs_get_chunk_map(fs_info, logical, *length);
6335 ASSERT(!IS_ERR(em));
6337 ret = btrfs_get_io_geometry(fs_info, em, op, logical, &geom);
6341 map = em->map_lookup;
6344 stripe_len = geom.stripe_len;
6345 stripe_nr = geom.stripe_nr;
6346 stripe_offset = geom.stripe_offset;
6347 raid56_full_stripe_start = geom.raid56_stripe_offset;
6348 data_stripes = nr_data_stripes(map);
6350 down_read(&dev_replace->rwsem);
6351 dev_replace_is_ongoing = btrfs_dev_replace_is_ongoing(dev_replace);
6353 * Hold the semaphore for read during the whole operation, write is
6354 * requested at commit time but must wait.
6356 if (!dev_replace_is_ongoing)
6357 up_read(&dev_replace->rwsem);
6359 if (dev_replace_is_ongoing && mirror_num == map->num_stripes + 1 &&
6360 !need_full_stripe(op) && dev_replace->tgtdev != NULL) {
6361 ret = get_extra_mirror_from_replace(fs_info, logical, *length,
6362 dev_replace->srcdev->devid,
6364 &physical_to_patch_in_first_stripe);
6368 patch_the_first_stripe_for_dev_replace = 1;
6369 } else if (mirror_num > map->num_stripes) {
6375 if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
6376 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
6378 if (!need_full_stripe(op))
6380 } else if (map->type & BTRFS_BLOCK_GROUP_RAID1_MASK) {
6381 if (need_full_stripe(op))
6382 num_stripes = map->num_stripes;
6383 else if (mirror_num)
6384 stripe_index = mirror_num - 1;
6386 stripe_index = find_live_mirror(fs_info, map, 0,
6387 dev_replace_is_ongoing);
6388 mirror_num = stripe_index + 1;
6391 } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
6392 if (need_full_stripe(op)) {
6393 num_stripes = map->num_stripes;
6394 } else if (mirror_num) {
6395 stripe_index = mirror_num - 1;
6400 } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
6401 u32 factor = map->num_stripes / map->sub_stripes;
6403 stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index);
6404 stripe_index *= map->sub_stripes;
6406 if (need_full_stripe(op))
6407 num_stripes = map->sub_stripes;
6408 else if (mirror_num)
6409 stripe_index += mirror_num - 1;
6411 int old_stripe_index = stripe_index;
6412 stripe_index = find_live_mirror(fs_info, map,
6414 dev_replace_is_ongoing);
6415 mirror_num = stripe_index - old_stripe_index + 1;
6418 } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
6419 if (need_raid_map && (need_full_stripe(op) || mirror_num > 1)) {
6420 /* push stripe_nr back to the start of the full stripe */
6421 stripe_nr = div64_u64(raid56_full_stripe_start,
6422 stripe_len * data_stripes);
6424 /* RAID[56] write or recovery. Return all stripes */
6425 num_stripes = map->num_stripes;
6426 max_errors = nr_parity_stripes(map);
6428 *length = map->stripe_len;
6433 * Mirror #0 or #1 means the original data block.
6434 * Mirror #2 is RAID5 parity block.
6435 * Mirror #3 is RAID6 Q block.
6437 stripe_nr = div_u64_rem(stripe_nr,
6438 data_stripes, &stripe_index);
6440 stripe_index = data_stripes + mirror_num - 2;
6442 /* We distribute the parity blocks across stripes */
6443 div_u64_rem(stripe_nr + stripe_index, map->num_stripes,
6445 if (!need_full_stripe(op) && mirror_num <= 1)
6450 * after this, stripe_nr is the number of stripes on this
6451 * device we have to walk to find the data, and stripe_index is
6452 * the number of our device in the stripe array
6454 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
6456 mirror_num = stripe_index + 1;
6458 if (stripe_index >= map->num_stripes) {
6460 "stripe index math went horribly wrong, got stripe_index=%u, num_stripes=%u",
6461 stripe_index, map->num_stripes);
6466 num_alloc_stripes = num_stripes;
6467 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL) {
6468 if (op == BTRFS_MAP_WRITE)
6469 num_alloc_stripes <<= 1;
6470 if (op == BTRFS_MAP_GET_READ_MIRRORS)
6471 num_alloc_stripes++;
6472 tgtdev_indexes = num_stripes;
6475 bbio = alloc_btrfs_bio(num_alloc_stripes, tgtdev_indexes);
6481 for (i = 0; i < num_stripes; i++) {
6482 bbio->stripes[i].physical = map->stripes[stripe_index].physical +
6483 stripe_offset + stripe_nr * map->stripe_len;
6484 bbio->stripes[i].dev = map->stripes[stripe_index].dev;
6488 /* build raid_map */
6489 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK && need_raid_map &&
6490 (need_full_stripe(op) || mirror_num > 1)) {
6494 /* Work out the disk rotation on this stripe-set */
6495 div_u64_rem(stripe_nr, num_stripes, &rot);
6497 /* Fill in the logical address of each stripe */
6498 tmp = stripe_nr * data_stripes;
6499 for (i = 0; i < data_stripes; i++)
6500 bbio->raid_map[(i+rot) % num_stripes] =
6501 em->start + (tmp + i) * map->stripe_len;
6503 bbio->raid_map[(i+rot) % map->num_stripes] = RAID5_P_STRIPE;
6504 if (map->type & BTRFS_BLOCK_GROUP_RAID6)
6505 bbio->raid_map[(i+rot+1) % num_stripes] =
6508 sort_parity_stripes(bbio, num_stripes);
6511 if (need_full_stripe(op))
6512 max_errors = btrfs_chunk_max_errors(map);
6514 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL &&
6515 need_full_stripe(op)) {
6516 handle_ops_on_dev_replace(op, &bbio, dev_replace, logical,
6517 &num_stripes, &max_errors);
6521 bbio->map_type = map->type;
6522 bbio->num_stripes = num_stripes;
6523 bbio->max_errors = max_errors;
6524 bbio->mirror_num = mirror_num;
6527 * this is the case that REQ_READ && dev_replace_is_ongoing &&
6528 * mirror_num == num_stripes + 1 && dev_replace target drive is
6529 * available as a mirror
6531 if (patch_the_first_stripe_for_dev_replace && num_stripes > 0) {
6532 WARN_ON(num_stripes > 1);
6533 bbio->stripes[0].dev = dev_replace->tgtdev;
6534 bbio->stripes[0].physical = physical_to_patch_in_first_stripe;
6535 bbio->mirror_num = map->num_stripes + 1;
6538 if (dev_replace_is_ongoing) {
6539 lockdep_assert_held(&dev_replace->rwsem);
6540 /* Unlock and let waiting writers proceed */
6541 up_read(&dev_replace->rwsem);
6543 free_extent_map(em);
6547 int btrfs_map_block(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6548 u64 logical, u64 *length,
6549 struct btrfs_bio **bbio_ret, int mirror_num)
6551 if (op == BTRFS_MAP_DISCARD)
6552 return __btrfs_map_block_for_discard(fs_info, logical,
6555 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret,
6559 /* For Scrub/replace */
6560 int btrfs_map_sblock(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6561 u64 logical, u64 *length,
6562 struct btrfs_bio **bbio_ret)
6564 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret, 0, 1);
6567 static inline void btrfs_end_bbio(struct btrfs_bio *bbio, struct bio *bio)
6569 bio->bi_private = bbio->private;
6570 bio->bi_end_io = bbio->end_io;
6573 btrfs_put_bbio(bbio);
6576 static void btrfs_end_bio(struct bio *bio)
6578 struct btrfs_bio *bbio = bio->bi_private;
6579 int is_orig_bio = 0;
6581 if (bio->bi_status) {
6582 atomic_inc(&bbio->error);
6583 if (bio->bi_status == BLK_STS_IOERR ||
6584 bio->bi_status == BLK_STS_TARGET) {
6585 struct btrfs_device *dev = btrfs_io_bio(bio)->device;
6588 if (btrfs_op(bio) == BTRFS_MAP_WRITE)
6589 btrfs_dev_stat_inc_and_print(dev,
6590 BTRFS_DEV_STAT_WRITE_ERRS);
6591 else if (!(bio->bi_opf & REQ_RAHEAD))
6592 btrfs_dev_stat_inc_and_print(dev,
6593 BTRFS_DEV_STAT_READ_ERRS);
6594 if (bio->bi_opf & REQ_PREFLUSH)
6595 btrfs_dev_stat_inc_and_print(dev,
6596 BTRFS_DEV_STAT_FLUSH_ERRS);
6600 if (bio == bbio->orig_bio)
6603 btrfs_bio_counter_dec(bbio->fs_info);
6605 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6608 bio = bbio->orig_bio;
6611 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6612 /* only send an error to the higher layers if it is
6613 * beyond the tolerance of the btrfs bio
6615 if (atomic_read(&bbio->error) > bbio->max_errors) {
6616 bio->bi_status = BLK_STS_IOERR;
6619 * this bio is actually up to date, we didn't
6620 * go over the max number of errors
6622 bio->bi_status = BLK_STS_OK;
6625 btrfs_end_bbio(bbio, bio);
6626 } else if (!is_orig_bio) {
6631 static void submit_stripe_bio(struct btrfs_bio *bbio, struct bio *bio,
6632 u64 physical, struct btrfs_device *dev)
6634 struct btrfs_fs_info *fs_info = bbio->fs_info;
6636 bio->bi_private = bbio;
6637 btrfs_io_bio(bio)->device = dev;
6638 bio->bi_end_io = btrfs_end_bio;
6639 bio->bi_iter.bi_sector = physical >> 9;
6641 * For zone append writing, bi_sector must point the beginning of the
6644 if (bio_op(bio) == REQ_OP_ZONE_APPEND) {
6645 if (btrfs_dev_is_sequential(dev, physical)) {
6646 u64 zone_start = round_down(physical, fs_info->zone_size);
6648 bio->bi_iter.bi_sector = zone_start >> SECTOR_SHIFT;
6650 bio->bi_opf &= ~REQ_OP_ZONE_APPEND;
6651 bio->bi_opf |= REQ_OP_WRITE;
6654 btrfs_debug_in_rcu(fs_info,
6655 "btrfs_map_bio: rw %d 0x%x, sector=%llu, dev=%lu (%s id %llu), size=%u",
6656 bio_op(bio), bio->bi_opf, bio->bi_iter.bi_sector,
6657 (unsigned long)dev->bdev->bd_dev, rcu_str_deref(dev->name),
6658 dev->devid, bio->bi_iter.bi_size);
6659 bio_set_dev(bio, dev->bdev);
6661 btrfs_bio_counter_inc_noblocked(fs_info);
6663 btrfsic_submit_bio(bio);
6666 static void bbio_error(struct btrfs_bio *bbio, struct bio *bio, u64 logical)
6668 atomic_inc(&bbio->error);
6669 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6670 /* Should be the original bio. */
6671 WARN_ON(bio != bbio->orig_bio);
6673 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6674 bio->bi_iter.bi_sector = logical >> 9;
6675 if (atomic_read(&bbio->error) > bbio->max_errors)
6676 bio->bi_status = BLK_STS_IOERR;
6678 bio->bi_status = BLK_STS_OK;
6679 btrfs_end_bbio(bbio, bio);
6683 blk_status_t btrfs_map_bio(struct btrfs_fs_info *fs_info, struct bio *bio,
6686 struct btrfs_device *dev;
6687 struct bio *first_bio = bio;
6688 u64 logical = bio->bi_iter.bi_sector << 9;
6694 struct btrfs_bio *bbio = NULL;
6696 length = bio->bi_iter.bi_size;
6697 map_length = length;
6699 btrfs_bio_counter_inc_blocked(fs_info);
6700 ret = __btrfs_map_block(fs_info, btrfs_op(bio), logical,
6701 &map_length, &bbio, mirror_num, 1);
6703 btrfs_bio_counter_dec(fs_info);
6704 return errno_to_blk_status(ret);
6707 total_devs = bbio->num_stripes;
6708 bbio->orig_bio = first_bio;
6709 bbio->private = first_bio->bi_private;
6710 bbio->end_io = first_bio->bi_end_io;
6711 bbio->fs_info = fs_info;
6712 atomic_set(&bbio->stripes_pending, bbio->num_stripes);
6714 if ((bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) &&
6715 ((btrfs_op(bio) == BTRFS_MAP_WRITE) || (mirror_num > 1))) {
6716 /* In this case, map_length has been set to the length of
6717 a single stripe; not the whole write */
6718 if (btrfs_op(bio) == BTRFS_MAP_WRITE) {
6719 ret = raid56_parity_write(fs_info, bio, bbio,
6722 ret = raid56_parity_recover(fs_info, bio, bbio,
6723 map_length, mirror_num, 1);
6726 btrfs_bio_counter_dec(fs_info);
6727 return errno_to_blk_status(ret);
6730 if (map_length < length) {
6732 "mapping failed logical %llu bio len %llu len %llu",
6733 logical, length, map_length);
6737 for (dev_nr = 0; dev_nr < total_devs; dev_nr++) {
6738 dev = bbio->stripes[dev_nr].dev;
6739 if (!dev || !dev->bdev || test_bit(BTRFS_DEV_STATE_MISSING,
6741 (btrfs_op(first_bio) == BTRFS_MAP_WRITE &&
6742 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))) {
6743 bbio_error(bbio, first_bio, logical);
6747 if (dev_nr < total_devs - 1)
6748 bio = btrfs_bio_clone(first_bio);
6752 submit_stripe_bio(bbio, bio, bbio->stripes[dev_nr].physical, dev);
6754 btrfs_bio_counter_dec(fs_info);
6759 * Find a device specified by @devid or @uuid in the list of @fs_devices, or
6762 * If devid and uuid are both specified, the match must be exact, otherwise
6763 * only devid is used.
6765 struct btrfs_device *btrfs_find_device(struct btrfs_fs_devices *fs_devices,
6766 u64 devid, u8 *uuid, u8 *fsid)
6768 struct btrfs_device *device;
6769 struct btrfs_fs_devices *seed_devs;
6771 if (!fsid || !memcmp(fs_devices->metadata_uuid, fsid, BTRFS_FSID_SIZE)) {
6772 list_for_each_entry(device, &fs_devices->devices, dev_list) {
6773 if (device->devid == devid &&
6774 (!uuid || memcmp(device->uuid, uuid,
6775 BTRFS_UUID_SIZE) == 0))
6780 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
6782 !memcmp(seed_devs->metadata_uuid, fsid, BTRFS_FSID_SIZE)) {
6783 list_for_each_entry(device, &seed_devs->devices,
6785 if (device->devid == devid &&
6786 (!uuid || memcmp(device->uuid, uuid,
6787 BTRFS_UUID_SIZE) == 0))
6796 static struct btrfs_device *add_missing_dev(struct btrfs_fs_devices *fs_devices,
6797 u64 devid, u8 *dev_uuid)
6799 struct btrfs_device *device;
6800 unsigned int nofs_flag;
6803 * We call this under the chunk_mutex, so we want to use NOFS for this
6804 * allocation, however we don't want to change btrfs_alloc_device() to
6805 * always do NOFS because we use it in a lot of other GFP_KERNEL safe
6808 nofs_flag = memalloc_nofs_save();
6809 device = btrfs_alloc_device(NULL, &devid, dev_uuid);
6810 memalloc_nofs_restore(nofs_flag);
6814 list_add(&device->dev_list, &fs_devices->devices);
6815 device->fs_devices = fs_devices;
6816 fs_devices->num_devices++;
6818 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
6819 fs_devices->missing_devices++;
6825 * btrfs_alloc_device - allocate struct btrfs_device
6826 * @fs_info: used only for generating a new devid, can be NULL if
6827 * devid is provided (i.e. @devid != NULL).
6828 * @devid: a pointer to devid for this device. If NULL a new devid
6830 * @uuid: a pointer to UUID for this device. If NULL a new UUID
6833 * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR()
6834 * on error. Returned struct is not linked onto any lists and must be
6835 * destroyed with btrfs_free_device.
6837 struct btrfs_device *btrfs_alloc_device(struct btrfs_fs_info *fs_info,
6841 struct btrfs_device *dev;
6844 if (WARN_ON(!devid && !fs_info))
6845 return ERR_PTR(-EINVAL);
6847 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
6849 return ERR_PTR(-ENOMEM);
6852 * Preallocate a bio that's always going to be used for flushing device
6853 * barriers and matches the device lifespan
6855 dev->flush_bio = bio_kmalloc(GFP_KERNEL, 0);
6856 if (!dev->flush_bio) {
6858 return ERR_PTR(-ENOMEM);
6861 INIT_LIST_HEAD(&dev->dev_list);
6862 INIT_LIST_HEAD(&dev->dev_alloc_list);
6863 INIT_LIST_HEAD(&dev->post_commit_list);
6865 atomic_set(&dev->reada_in_flight, 0);
6866 atomic_set(&dev->dev_stats_ccnt, 0);
6867 btrfs_device_data_ordered_init(dev);
6868 INIT_RADIX_TREE(&dev->reada_zones, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
6869 INIT_RADIX_TREE(&dev->reada_extents, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
6870 extent_io_tree_init(fs_info, &dev->alloc_state,
6871 IO_TREE_DEVICE_ALLOC_STATE, NULL);
6878 ret = find_next_devid(fs_info, &tmp);
6880 btrfs_free_device(dev);
6881 return ERR_PTR(ret);
6887 memcpy(dev->uuid, uuid, BTRFS_UUID_SIZE);
6889 generate_random_uuid(dev->uuid);
6894 static void btrfs_report_missing_device(struct btrfs_fs_info *fs_info,
6895 u64 devid, u8 *uuid, bool error)
6898 btrfs_err_rl(fs_info, "devid %llu uuid %pU is missing",
6901 btrfs_warn_rl(fs_info, "devid %llu uuid %pU is missing",
6905 static u64 calc_stripe_length(u64 type, u64 chunk_len, int num_stripes)
6907 const int data_stripes = calc_data_stripes(type, num_stripes);
6909 return div_u64(chunk_len, data_stripes);
6912 #if BITS_PER_LONG == 32
6914 * Due to page cache limit, metadata beyond BTRFS_32BIT_MAX_FILE_SIZE
6915 * can't be accessed on 32bit systems.
6917 * This function do mount time check to reject the fs if it already has
6918 * metadata chunk beyond that limit.
6920 static int check_32bit_meta_chunk(struct btrfs_fs_info *fs_info,
6921 u64 logical, u64 length, u64 type)
6923 if (!(type & BTRFS_BLOCK_GROUP_METADATA))
6926 if (logical + length < MAX_LFS_FILESIZE)
6929 btrfs_err_32bit_limit(fs_info);
6934 * This is to give early warning for any metadata chunk reaching
6935 * BTRFS_32BIT_EARLY_WARN_THRESHOLD.
6936 * Although we can still access the metadata, it's not going to be possible
6937 * once the limit is reached.
6939 static void warn_32bit_meta_chunk(struct btrfs_fs_info *fs_info,
6940 u64 logical, u64 length, u64 type)
6942 if (!(type & BTRFS_BLOCK_GROUP_METADATA))
6945 if (logical + length < BTRFS_32BIT_EARLY_WARN_THRESHOLD)
6948 btrfs_warn_32bit_limit(fs_info);
6952 static int read_one_chunk(struct btrfs_key *key, struct extent_buffer *leaf,
6953 struct btrfs_chunk *chunk)
6955 struct btrfs_fs_info *fs_info = leaf->fs_info;
6956 struct extent_map_tree *map_tree = &fs_info->mapping_tree;
6957 struct map_lookup *map;
6958 struct extent_map *em;
6963 u8 uuid[BTRFS_UUID_SIZE];
6968 logical = key->offset;
6969 length = btrfs_chunk_length(leaf, chunk);
6970 type = btrfs_chunk_type(leaf, chunk);
6971 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6973 #if BITS_PER_LONG == 32
6974 ret = check_32bit_meta_chunk(fs_info, logical, length, type);
6977 warn_32bit_meta_chunk(fs_info, logical, length, type);
6981 * Only need to verify chunk item if we're reading from sys chunk array,
6982 * as chunk item in tree block is already verified by tree-checker.
6984 if (leaf->start == BTRFS_SUPER_INFO_OFFSET) {
6985 ret = btrfs_check_chunk_valid(leaf, chunk, logical);
6990 read_lock(&map_tree->lock);
6991 em = lookup_extent_mapping(map_tree, logical, 1);
6992 read_unlock(&map_tree->lock);
6994 /* already mapped? */
6995 if (em && em->start <= logical && em->start + em->len > logical) {
6996 free_extent_map(em);
6999 free_extent_map(em);
7002 em = alloc_extent_map();
7005 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
7007 free_extent_map(em);
7011 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
7012 em->map_lookup = map;
7013 em->start = logical;
7016 em->block_start = 0;
7017 em->block_len = em->len;
7019 map->num_stripes = num_stripes;
7020 map->io_width = btrfs_chunk_io_width(leaf, chunk);
7021 map->io_align = btrfs_chunk_io_align(leaf, chunk);
7022 map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
7024 map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
7025 map->verified_stripes = 0;
7026 em->orig_block_len = calc_stripe_length(type, em->len,
7028 for (i = 0; i < num_stripes; i++) {
7029 map->stripes[i].physical =
7030 btrfs_stripe_offset_nr(leaf, chunk, i);
7031 devid = btrfs_stripe_devid_nr(leaf, chunk, i);
7032 read_extent_buffer(leaf, uuid, (unsigned long)
7033 btrfs_stripe_dev_uuid_nr(chunk, i),
7035 map->stripes[i].dev = btrfs_find_device(fs_info->fs_devices,
7037 if (!map->stripes[i].dev &&
7038 !btrfs_test_opt(fs_info, DEGRADED)) {
7039 free_extent_map(em);
7040 btrfs_report_missing_device(fs_info, devid, uuid, true);
7043 if (!map->stripes[i].dev) {
7044 map->stripes[i].dev =
7045 add_missing_dev(fs_info->fs_devices, devid,
7047 if (IS_ERR(map->stripes[i].dev)) {
7048 free_extent_map(em);
7050 "failed to init missing dev %llu: %ld",
7051 devid, PTR_ERR(map->stripes[i].dev));
7052 return PTR_ERR(map->stripes[i].dev);
7054 btrfs_report_missing_device(fs_info, devid, uuid, false);
7056 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
7057 &(map->stripes[i].dev->dev_state));
7061 write_lock(&map_tree->lock);
7062 ret = add_extent_mapping(map_tree, em, 0);
7063 write_unlock(&map_tree->lock);
7066 "failed to add chunk map, start=%llu len=%llu: %d",
7067 em->start, em->len, ret);
7069 free_extent_map(em);
7074 static void fill_device_from_item(struct extent_buffer *leaf,
7075 struct btrfs_dev_item *dev_item,
7076 struct btrfs_device *device)
7080 device->devid = btrfs_device_id(leaf, dev_item);
7081 device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item);
7082 device->total_bytes = device->disk_total_bytes;
7083 device->commit_total_bytes = device->disk_total_bytes;
7084 device->bytes_used = btrfs_device_bytes_used(leaf, dev_item);
7085 device->commit_bytes_used = device->bytes_used;
7086 device->type = btrfs_device_type(leaf, dev_item);
7087 device->io_align = btrfs_device_io_align(leaf, dev_item);
7088 device->io_width = btrfs_device_io_width(leaf, dev_item);
7089 device->sector_size = btrfs_device_sector_size(leaf, dev_item);
7090 WARN_ON(device->devid == BTRFS_DEV_REPLACE_DEVID);
7091 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
7093 ptr = btrfs_device_uuid(dev_item);
7094 read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
7097 static struct btrfs_fs_devices *open_seed_devices(struct btrfs_fs_info *fs_info,
7100 struct btrfs_fs_devices *fs_devices;
7103 lockdep_assert_held(&uuid_mutex);
7106 /* This will match only for multi-device seed fs */
7107 list_for_each_entry(fs_devices, &fs_info->fs_devices->seed_list, seed_list)
7108 if (!memcmp(fs_devices->fsid, fsid, BTRFS_FSID_SIZE))
7112 fs_devices = find_fsid(fsid, NULL);
7114 if (!btrfs_test_opt(fs_info, DEGRADED))
7115 return ERR_PTR(-ENOENT);
7117 fs_devices = alloc_fs_devices(fsid, NULL);
7118 if (IS_ERR(fs_devices))
7121 fs_devices->seeding = true;
7122 fs_devices->opened = 1;
7127 * Upon first call for a seed fs fsid, just create a private copy of the
7128 * respective fs_devices and anchor it at fs_info->fs_devices->seed_list
7130 fs_devices = clone_fs_devices(fs_devices);
7131 if (IS_ERR(fs_devices))
7134 ret = open_fs_devices(fs_devices, FMODE_READ, fs_info->bdev_holder);
7136 free_fs_devices(fs_devices);
7137 return ERR_PTR(ret);
7140 if (!fs_devices->seeding) {
7141 close_fs_devices(fs_devices);
7142 free_fs_devices(fs_devices);
7143 return ERR_PTR(-EINVAL);
7146 list_add(&fs_devices->seed_list, &fs_info->fs_devices->seed_list);
7151 static int read_one_dev(struct extent_buffer *leaf,
7152 struct btrfs_dev_item *dev_item)
7154 struct btrfs_fs_info *fs_info = leaf->fs_info;
7155 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7156 struct btrfs_device *device;
7159 u8 fs_uuid[BTRFS_FSID_SIZE];
7160 u8 dev_uuid[BTRFS_UUID_SIZE];
7162 devid = btrfs_device_id(leaf, dev_item);
7163 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
7165 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
7168 if (memcmp(fs_uuid, fs_devices->metadata_uuid, BTRFS_FSID_SIZE)) {
7169 fs_devices = open_seed_devices(fs_info, fs_uuid);
7170 if (IS_ERR(fs_devices))
7171 return PTR_ERR(fs_devices);
7174 device = btrfs_find_device(fs_info->fs_devices, devid, dev_uuid,
7177 if (!btrfs_test_opt(fs_info, DEGRADED)) {
7178 btrfs_report_missing_device(fs_info, devid,
7183 device = add_missing_dev(fs_devices, devid, dev_uuid);
7184 if (IS_ERR(device)) {
7186 "failed to add missing dev %llu: %ld",
7187 devid, PTR_ERR(device));
7188 return PTR_ERR(device);
7190 btrfs_report_missing_device(fs_info, devid, dev_uuid, false);
7192 if (!device->bdev) {
7193 if (!btrfs_test_opt(fs_info, DEGRADED)) {
7194 btrfs_report_missing_device(fs_info,
7195 devid, dev_uuid, true);
7198 btrfs_report_missing_device(fs_info, devid,
7202 if (!device->bdev &&
7203 !test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
7205 * this happens when a device that was properly setup
7206 * in the device info lists suddenly goes bad.
7207 * device->bdev is NULL, and so we have to set
7208 * device->missing to one here
7210 device->fs_devices->missing_devices++;
7211 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
7214 /* Move the device to its own fs_devices */
7215 if (device->fs_devices != fs_devices) {
7216 ASSERT(test_bit(BTRFS_DEV_STATE_MISSING,
7217 &device->dev_state));
7219 list_move(&device->dev_list, &fs_devices->devices);
7220 device->fs_devices->num_devices--;
7221 fs_devices->num_devices++;
7223 device->fs_devices->missing_devices--;
7224 fs_devices->missing_devices++;
7226 device->fs_devices = fs_devices;
7230 if (device->fs_devices != fs_info->fs_devices) {
7231 BUG_ON(test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state));
7232 if (device->generation !=
7233 btrfs_device_generation(leaf, dev_item))
7237 fill_device_from_item(leaf, dev_item, device);
7239 u64 max_total_bytes = i_size_read(device->bdev->bd_inode);
7241 if (device->total_bytes > max_total_bytes) {
7243 "device total_bytes should be at most %llu but found %llu",
7244 max_total_bytes, device->total_bytes);
7248 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
7249 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
7250 !test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
7251 device->fs_devices->total_rw_bytes += device->total_bytes;
7252 atomic64_add(device->total_bytes - device->bytes_used,
7253 &fs_info->free_chunk_space);
7259 int btrfs_read_sys_array(struct btrfs_fs_info *fs_info)
7261 struct btrfs_root *root = fs_info->tree_root;
7262 struct btrfs_super_block *super_copy = fs_info->super_copy;
7263 struct extent_buffer *sb;
7264 struct btrfs_disk_key *disk_key;
7265 struct btrfs_chunk *chunk;
7267 unsigned long sb_array_offset;
7274 struct btrfs_key key;
7276 ASSERT(BTRFS_SUPER_INFO_SIZE <= fs_info->nodesize);
7278 * This will create extent buffer of nodesize, superblock size is
7279 * fixed to BTRFS_SUPER_INFO_SIZE. If nodesize > sb size, this will
7280 * overallocate but we can keep it as-is, only the first page is used.
7282 sb = btrfs_find_create_tree_block(fs_info, BTRFS_SUPER_INFO_OFFSET,
7283 root->root_key.objectid, 0);
7286 set_extent_buffer_uptodate(sb);
7288 * The sb extent buffer is artificial and just used to read the system array.
7289 * set_extent_buffer_uptodate() call does not properly mark all it's
7290 * pages up-to-date when the page is larger: extent does not cover the
7291 * whole page and consequently check_page_uptodate does not find all
7292 * the page's extents up-to-date (the hole beyond sb),
7293 * write_extent_buffer then triggers a WARN_ON.
7295 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
7296 * but sb spans only this function. Add an explicit SetPageUptodate call
7297 * to silence the warning eg. on PowerPC 64.
7299 if (PAGE_SIZE > BTRFS_SUPER_INFO_SIZE)
7300 SetPageUptodate(sb->pages[0]);
7302 write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE);
7303 array_size = btrfs_super_sys_array_size(super_copy);
7305 array_ptr = super_copy->sys_chunk_array;
7306 sb_array_offset = offsetof(struct btrfs_super_block, sys_chunk_array);
7309 while (cur_offset < array_size) {
7310 disk_key = (struct btrfs_disk_key *)array_ptr;
7311 len = sizeof(*disk_key);
7312 if (cur_offset + len > array_size)
7313 goto out_short_read;
7315 btrfs_disk_key_to_cpu(&key, disk_key);
7318 sb_array_offset += len;
7321 if (key.type != BTRFS_CHUNK_ITEM_KEY) {
7323 "unexpected item type %u in sys_array at offset %u",
7324 (u32)key.type, cur_offset);
7329 chunk = (struct btrfs_chunk *)sb_array_offset;
7331 * At least one btrfs_chunk with one stripe must be present,
7332 * exact stripe count check comes afterwards
7334 len = btrfs_chunk_item_size(1);
7335 if (cur_offset + len > array_size)
7336 goto out_short_read;
7338 num_stripes = btrfs_chunk_num_stripes(sb, chunk);
7341 "invalid number of stripes %u in sys_array at offset %u",
7342 num_stripes, cur_offset);
7347 type = btrfs_chunk_type(sb, chunk);
7348 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) == 0) {
7350 "invalid chunk type %llu in sys_array at offset %u",
7356 len = btrfs_chunk_item_size(num_stripes);
7357 if (cur_offset + len > array_size)
7358 goto out_short_read;
7360 ret = read_one_chunk(&key, sb, chunk);
7365 sb_array_offset += len;
7368 clear_extent_buffer_uptodate(sb);
7369 free_extent_buffer_stale(sb);
7373 btrfs_err(fs_info, "sys_array too short to read %u bytes at offset %u",
7375 clear_extent_buffer_uptodate(sb);
7376 free_extent_buffer_stale(sb);
7381 * Check if all chunks in the fs are OK for read-write degraded mount
7383 * If the @failing_dev is specified, it's accounted as missing.
7385 * Return true if all chunks meet the minimal RW mount requirements.
7386 * Return false if any chunk doesn't meet the minimal RW mount requirements.
7388 bool btrfs_check_rw_degradable(struct btrfs_fs_info *fs_info,
7389 struct btrfs_device *failing_dev)
7391 struct extent_map_tree *map_tree = &fs_info->mapping_tree;
7392 struct extent_map *em;
7396 read_lock(&map_tree->lock);
7397 em = lookup_extent_mapping(map_tree, 0, (u64)-1);
7398 read_unlock(&map_tree->lock);
7399 /* No chunk at all? Return false anyway */
7405 struct map_lookup *map;
7410 map = em->map_lookup;
7412 btrfs_get_num_tolerated_disk_barrier_failures(
7414 for (i = 0; i < map->num_stripes; i++) {
7415 struct btrfs_device *dev = map->stripes[i].dev;
7417 if (!dev || !dev->bdev ||
7418 test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state) ||
7419 dev->last_flush_error)
7421 else if (failing_dev && failing_dev == dev)
7424 if (missing > max_tolerated) {
7427 "chunk %llu missing %d devices, max tolerance is %d for writable mount",
7428 em->start, missing, max_tolerated);
7429 free_extent_map(em);
7433 next_start = extent_map_end(em);
7434 free_extent_map(em);
7436 read_lock(&map_tree->lock);
7437 em = lookup_extent_mapping(map_tree, next_start,
7438 (u64)(-1) - next_start);
7439 read_unlock(&map_tree->lock);
7445 static void readahead_tree_node_children(struct extent_buffer *node)
7448 const int nr_items = btrfs_header_nritems(node);
7450 for (i = 0; i < nr_items; i++)
7451 btrfs_readahead_node_child(node, i);
7454 int btrfs_read_chunk_tree(struct btrfs_fs_info *fs_info)
7456 struct btrfs_root *root = fs_info->chunk_root;
7457 struct btrfs_path *path;
7458 struct extent_buffer *leaf;
7459 struct btrfs_key key;
7460 struct btrfs_key found_key;
7464 u64 last_ra_node = 0;
7466 path = btrfs_alloc_path();
7471 * uuid_mutex is needed only if we are mounting a sprout FS
7472 * otherwise we don't need it.
7474 mutex_lock(&uuid_mutex);
7477 * It is possible for mount and umount to race in such a way that
7478 * we execute this code path, but open_fs_devices failed to clear
7479 * total_rw_bytes. We certainly want it cleared before reading the
7480 * device items, so clear it here.
7482 fs_info->fs_devices->total_rw_bytes = 0;
7485 * Read all device items, and then all the chunk items. All
7486 * device items are found before any chunk item (their object id
7487 * is smaller than the lowest possible object id for a chunk
7488 * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID).
7490 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
7493 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
7497 struct extent_buffer *node;
7499 leaf = path->nodes[0];
7500 slot = path->slots[0];
7501 if (slot >= btrfs_header_nritems(leaf)) {
7502 ret = btrfs_next_leaf(root, path);
7510 * The nodes on level 1 are not locked but we don't need to do
7511 * that during mount time as nothing else can access the tree
7513 node = path->nodes[1];
7515 if (last_ra_node != node->start) {
7516 readahead_tree_node_children(node);
7517 last_ra_node = node->start;
7520 btrfs_item_key_to_cpu(leaf, &found_key, slot);
7521 if (found_key.type == BTRFS_DEV_ITEM_KEY) {
7522 struct btrfs_dev_item *dev_item;
7523 dev_item = btrfs_item_ptr(leaf, slot,
7524 struct btrfs_dev_item);
7525 ret = read_one_dev(leaf, dev_item);
7529 } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) {
7530 struct btrfs_chunk *chunk;
7533 * We are only called at mount time, so no need to take
7534 * fs_info->chunk_mutex. Plus, to avoid lockdep warnings,
7535 * we always lock first fs_info->chunk_mutex before
7536 * acquiring any locks on the chunk tree. This is a
7537 * requirement for chunk allocation, see the comment on
7538 * top of btrfs_chunk_alloc() for details.
7540 ASSERT(!test_bit(BTRFS_FS_OPEN, &fs_info->flags));
7541 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
7542 ret = read_one_chunk(&found_key, leaf, chunk);
7550 * After loading chunk tree, we've got all device information,
7551 * do another round of validation checks.
7553 if (total_dev != fs_info->fs_devices->total_devices) {
7555 "super_num_devices %llu mismatch with num_devices %llu found here",
7556 btrfs_super_num_devices(fs_info->super_copy),
7561 if (btrfs_super_total_bytes(fs_info->super_copy) <
7562 fs_info->fs_devices->total_rw_bytes) {
7564 "super_total_bytes %llu mismatch with fs_devices total_rw_bytes %llu",
7565 btrfs_super_total_bytes(fs_info->super_copy),
7566 fs_info->fs_devices->total_rw_bytes);
7572 mutex_unlock(&uuid_mutex);
7574 btrfs_free_path(path);
7578 void btrfs_init_devices_late(struct btrfs_fs_info *fs_info)
7580 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices, *seed_devs;
7581 struct btrfs_device *device;
7583 fs_devices->fs_info = fs_info;
7585 mutex_lock(&fs_devices->device_list_mutex);
7586 list_for_each_entry(device, &fs_devices->devices, dev_list)
7587 device->fs_info = fs_info;
7589 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
7590 list_for_each_entry(device, &seed_devs->devices, dev_list)
7591 device->fs_info = fs_info;
7593 seed_devs->fs_info = fs_info;
7595 mutex_unlock(&fs_devices->device_list_mutex);
7598 static u64 btrfs_dev_stats_value(const struct extent_buffer *eb,
7599 const struct btrfs_dev_stats_item *ptr,
7604 read_extent_buffer(eb, &val,
7605 offsetof(struct btrfs_dev_stats_item, values) +
7606 ((unsigned long)ptr) + (index * sizeof(u64)),
7611 static void btrfs_set_dev_stats_value(struct extent_buffer *eb,
7612 struct btrfs_dev_stats_item *ptr,
7615 write_extent_buffer(eb, &val,
7616 offsetof(struct btrfs_dev_stats_item, values) +
7617 ((unsigned long)ptr) + (index * sizeof(u64)),
7621 static int btrfs_device_init_dev_stats(struct btrfs_device *device,
7622 struct btrfs_path *path)
7624 struct btrfs_dev_stats_item *ptr;
7625 struct extent_buffer *eb;
7626 struct btrfs_key key;
7630 if (!device->fs_info->dev_root)
7633 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7634 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7635 key.offset = device->devid;
7636 ret = btrfs_search_slot(NULL, device->fs_info->dev_root, &key, path, 0, 0);
7638 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7639 btrfs_dev_stat_set(device, i, 0);
7640 device->dev_stats_valid = 1;
7641 btrfs_release_path(path);
7642 return ret < 0 ? ret : 0;
7644 slot = path->slots[0];
7645 eb = path->nodes[0];
7646 item_size = btrfs_item_size_nr(eb, slot);
7648 ptr = btrfs_item_ptr(eb, slot, struct btrfs_dev_stats_item);
7650 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7651 if (item_size >= (1 + i) * sizeof(__le64))
7652 btrfs_dev_stat_set(device, i,
7653 btrfs_dev_stats_value(eb, ptr, i));
7655 btrfs_dev_stat_set(device, i, 0);
7658 device->dev_stats_valid = 1;
7659 btrfs_dev_stat_print_on_load(device);
7660 btrfs_release_path(path);
7665 int btrfs_init_dev_stats(struct btrfs_fs_info *fs_info)
7667 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices, *seed_devs;
7668 struct btrfs_device *device;
7669 struct btrfs_path *path = NULL;
7672 path = btrfs_alloc_path();
7676 mutex_lock(&fs_devices->device_list_mutex);
7677 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7678 ret = btrfs_device_init_dev_stats(device, path);
7682 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
7683 list_for_each_entry(device, &seed_devs->devices, dev_list) {
7684 ret = btrfs_device_init_dev_stats(device, path);
7690 mutex_unlock(&fs_devices->device_list_mutex);
7692 btrfs_free_path(path);
7696 static int update_dev_stat_item(struct btrfs_trans_handle *trans,
7697 struct btrfs_device *device)
7699 struct btrfs_fs_info *fs_info = trans->fs_info;
7700 struct btrfs_root *dev_root = fs_info->dev_root;
7701 struct btrfs_path *path;
7702 struct btrfs_key key;
7703 struct extent_buffer *eb;
7704 struct btrfs_dev_stats_item *ptr;
7708 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7709 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7710 key.offset = device->devid;
7712 path = btrfs_alloc_path();
7715 ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1);
7717 btrfs_warn_in_rcu(fs_info,
7718 "error %d while searching for dev_stats item for device %s",
7719 ret, rcu_str_deref(device->name));
7724 btrfs_item_size_nr(path->nodes[0], path->slots[0]) < sizeof(*ptr)) {
7725 /* need to delete old one and insert a new one */
7726 ret = btrfs_del_item(trans, dev_root, path);
7728 btrfs_warn_in_rcu(fs_info,
7729 "delete too small dev_stats item for device %s failed %d",
7730 rcu_str_deref(device->name), ret);
7737 /* need to insert a new item */
7738 btrfs_release_path(path);
7739 ret = btrfs_insert_empty_item(trans, dev_root, path,
7740 &key, sizeof(*ptr));
7742 btrfs_warn_in_rcu(fs_info,
7743 "insert dev_stats item for device %s failed %d",
7744 rcu_str_deref(device->name), ret);
7749 eb = path->nodes[0];
7750 ptr = btrfs_item_ptr(eb, path->slots[0], struct btrfs_dev_stats_item);
7751 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7752 btrfs_set_dev_stats_value(eb, ptr, i,
7753 btrfs_dev_stat_read(device, i));
7754 btrfs_mark_buffer_dirty(eb);
7757 btrfs_free_path(path);
7762 * called from commit_transaction. Writes all changed device stats to disk.
7764 int btrfs_run_dev_stats(struct btrfs_trans_handle *trans)
7766 struct btrfs_fs_info *fs_info = trans->fs_info;
7767 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7768 struct btrfs_device *device;
7772 mutex_lock(&fs_devices->device_list_mutex);
7773 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7774 stats_cnt = atomic_read(&device->dev_stats_ccnt);
7775 if (!device->dev_stats_valid || stats_cnt == 0)
7780 * There is a LOAD-LOAD control dependency between the value of
7781 * dev_stats_ccnt and updating the on-disk values which requires
7782 * reading the in-memory counters. Such control dependencies
7783 * require explicit read memory barriers.
7785 * This memory barriers pairs with smp_mb__before_atomic in
7786 * btrfs_dev_stat_inc/btrfs_dev_stat_set and with the full
7787 * barrier implied by atomic_xchg in
7788 * btrfs_dev_stats_read_and_reset
7792 ret = update_dev_stat_item(trans, device);
7794 atomic_sub(stats_cnt, &device->dev_stats_ccnt);
7796 mutex_unlock(&fs_devices->device_list_mutex);
7801 void btrfs_dev_stat_inc_and_print(struct btrfs_device *dev, int index)
7803 btrfs_dev_stat_inc(dev, index);
7804 btrfs_dev_stat_print_on_error(dev);
7807 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev)
7809 if (!dev->dev_stats_valid)
7811 btrfs_err_rl_in_rcu(dev->fs_info,
7812 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7813 rcu_str_deref(dev->name),
7814 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7815 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7816 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7817 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7818 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7821 static void btrfs_dev_stat_print_on_load(struct btrfs_device *dev)
7825 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7826 if (btrfs_dev_stat_read(dev, i) != 0)
7828 if (i == BTRFS_DEV_STAT_VALUES_MAX)
7829 return; /* all values == 0, suppress message */
7831 btrfs_info_in_rcu(dev->fs_info,
7832 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7833 rcu_str_deref(dev->name),
7834 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7835 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7836 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7837 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7838 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7841 int btrfs_get_dev_stats(struct btrfs_fs_info *fs_info,
7842 struct btrfs_ioctl_get_dev_stats *stats)
7844 struct btrfs_device *dev;
7845 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7848 mutex_lock(&fs_devices->device_list_mutex);
7849 dev = btrfs_find_device(fs_info->fs_devices, stats->devid, NULL, NULL);
7850 mutex_unlock(&fs_devices->device_list_mutex);
7853 btrfs_warn(fs_info, "get dev_stats failed, device not found");
7855 } else if (!dev->dev_stats_valid) {
7856 btrfs_warn(fs_info, "get dev_stats failed, not yet valid");
7858 } else if (stats->flags & BTRFS_DEV_STATS_RESET) {
7859 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7860 if (stats->nr_items > i)
7862 btrfs_dev_stat_read_and_reset(dev, i);
7864 btrfs_dev_stat_set(dev, i, 0);
7866 btrfs_info(fs_info, "device stats zeroed by %s (%d)",
7867 current->comm, task_pid_nr(current));
7869 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7870 if (stats->nr_items > i)
7871 stats->values[i] = btrfs_dev_stat_read(dev, i);
7873 if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX)
7874 stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX;
7879 * Update the size and bytes used for each device where it changed. This is
7880 * delayed since we would otherwise get errors while writing out the
7883 * Must be invoked during transaction commit.
7885 void btrfs_commit_device_sizes(struct btrfs_transaction *trans)
7887 struct btrfs_device *curr, *next;
7889 ASSERT(trans->state == TRANS_STATE_COMMIT_DOING);
7891 if (list_empty(&trans->dev_update_list))
7895 * We don't need the device_list_mutex here. This list is owned by the
7896 * transaction and the transaction must complete before the device is
7899 mutex_lock(&trans->fs_info->chunk_mutex);
7900 list_for_each_entry_safe(curr, next, &trans->dev_update_list,
7902 list_del_init(&curr->post_commit_list);
7903 curr->commit_total_bytes = curr->disk_total_bytes;
7904 curr->commit_bytes_used = curr->bytes_used;
7906 mutex_unlock(&trans->fs_info->chunk_mutex);
7910 * Multiplicity factor for simple profiles: DUP, RAID1-like and RAID10.
7912 int btrfs_bg_type_to_factor(u64 flags)
7914 const int index = btrfs_bg_flags_to_raid_index(flags);
7916 return btrfs_raid_array[index].ncopies;
7921 static int verify_one_dev_extent(struct btrfs_fs_info *fs_info,
7922 u64 chunk_offset, u64 devid,
7923 u64 physical_offset, u64 physical_len)
7925 struct extent_map_tree *em_tree = &fs_info->mapping_tree;
7926 struct extent_map *em;
7927 struct map_lookup *map;
7928 struct btrfs_device *dev;
7934 read_lock(&em_tree->lock);
7935 em = lookup_extent_mapping(em_tree, chunk_offset, 1);
7936 read_unlock(&em_tree->lock);
7940 "dev extent physical offset %llu on devid %llu doesn't have corresponding chunk",
7941 physical_offset, devid);
7946 map = em->map_lookup;
7947 stripe_len = calc_stripe_length(map->type, em->len, map->num_stripes);
7948 if (physical_len != stripe_len) {
7950 "dev extent physical offset %llu on devid %llu length doesn't match chunk %llu, have %llu expect %llu",
7951 physical_offset, devid, em->start, physical_len,
7957 for (i = 0; i < map->num_stripes; i++) {
7958 if (map->stripes[i].dev->devid == devid &&
7959 map->stripes[i].physical == physical_offset) {
7961 if (map->verified_stripes >= map->num_stripes) {
7963 "too many dev extents for chunk %llu found",
7968 map->verified_stripes++;
7974 "dev extent physical offset %llu devid %llu has no corresponding chunk",
7975 physical_offset, devid);
7979 /* Make sure no dev extent is beyond device boundary */
7980 dev = btrfs_find_device(fs_info->fs_devices, devid, NULL, NULL);
7982 btrfs_err(fs_info, "failed to find devid %llu", devid);
7987 if (physical_offset + physical_len > dev->disk_total_bytes) {
7989 "dev extent devid %llu physical offset %llu len %llu is beyond device boundary %llu",
7990 devid, physical_offset, physical_len,
7991 dev->disk_total_bytes);
7996 if (dev->zone_info) {
7997 u64 zone_size = dev->zone_info->zone_size;
7999 if (!IS_ALIGNED(physical_offset, zone_size) ||
8000 !IS_ALIGNED(physical_len, zone_size)) {
8002 "zoned: dev extent devid %llu physical offset %llu len %llu is not aligned to device zone",
8003 devid, physical_offset, physical_len);
8010 free_extent_map(em);
8014 static int verify_chunk_dev_extent_mapping(struct btrfs_fs_info *fs_info)
8016 struct extent_map_tree *em_tree = &fs_info->mapping_tree;
8017 struct extent_map *em;
8018 struct rb_node *node;
8021 read_lock(&em_tree->lock);
8022 for (node = rb_first_cached(&em_tree->map); node; node = rb_next(node)) {
8023 em = rb_entry(node, struct extent_map, rb_node);
8024 if (em->map_lookup->num_stripes !=
8025 em->map_lookup->verified_stripes) {
8027 "chunk %llu has missing dev extent, have %d expect %d",
8028 em->start, em->map_lookup->verified_stripes,
8029 em->map_lookup->num_stripes);
8035 read_unlock(&em_tree->lock);
8040 * Ensure that all dev extents are mapped to correct chunk, otherwise
8041 * later chunk allocation/free would cause unexpected behavior.
8043 * NOTE: This will iterate through the whole device tree, which should be of
8044 * the same size level as the chunk tree. This slightly increases mount time.
8046 int btrfs_verify_dev_extents(struct btrfs_fs_info *fs_info)
8048 struct btrfs_path *path;
8049 struct btrfs_root *root = fs_info->dev_root;
8050 struct btrfs_key key;
8052 u64 prev_dev_ext_end = 0;
8056 * We don't have a dev_root because we mounted with ignorebadroots and
8057 * failed to load the root, so we want to skip the verification in this
8060 * However if the dev root is fine, but the tree itself is corrupted
8061 * we'd still fail to mount. This verification is only to make sure
8062 * writes can happen safely, so instead just bypass this check
8063 * completely in the case of IGNOREBADROOTS.
8065 if (btrfs_test_opt(fs_info, IGNOREBADROOTS))
8069 key.type = BTRFS_DEV_EXTENT_KEY;
8072 path = btrfs_alloc_path();
8076 path->reada = READA_FORWARD;
8077 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
8081 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
8082 ret = btrfs_next_leaf(root, path);
8085 /* No dev extents at all? Not good */
8092 struct extent_buffer *leaf = path->nodes[0];
8093 struct btrfs_dev_extent *dext;
8094 int slot = path->slots[0];
8096 u64 physical_offset;
8100 btrfs_item_key_to_cpu(leaf, &key, slot);
8101 if (key.type != BTRFS_DEV_EXTENT_KEY)
8103 devid = key.objectid;
8104 physical_offset = key.offset;
8106 dext = btrfs_item_ptr(leaf, slot, struct btrfs_dev_extent);
8107 chunk_offset = btrfs_dev_extent_chunk_offset(leaf, dext);
8108 physical_len = btrfs_dev_extent_length(leaf, dext);
8110 /* Check if this dev extent overlaps with the previous one */
8111 if (devid == prev_devid && physical_offset < prev_dev_ext_end) {
8113 "dev extent devid %llu physical offset %llu overlap with previous dev extent end %llu",
8114 devid, physical_offset, prev_dev_ext_end);
8119 ret = verify_one_dev_extent(fs_info, chunk_offset, devid,
8120 physical_offset, physical_len);
8124 prev_dev_ext_end = physical_offset + physical_len;
8126 ret = btrfs_next_item(root, path);
8135 /* Ensure all chunks have corresponding dev extents */
8136 ret = verify_chunk_dev_extent_mapping(fs_info);
8138 btrfs_free_path(path);
8143 * Check whether the given block group or device is pinned by any inode being
8144 * used as a swapfile.
8146 bool btrfs_pinned_by_swapfile(struct btrfs_fs_info *fs_info, void *ptr)
8148 struct btrfs_swapfile_pin *sp;
8149 struct rb_node *node;
8151 spin_lock(&fs_info->swapfile_pins_lock);
8152 node = fs_info->swapfile_pins.rb_node;
8154 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
8156 node = node->rb_left;
8157 else if (ptr > sp->ptr)
8158 node = node->rb_right;
8162 spin_unlock(&fs_info->swapfile_pins_lock);
8163 return node != NULL;
8166 static int relocating_repair_kthread(void *data)
8168 struct btrfs_block_group *cache = (struct btrfs_block_group *)data;
8169 struct btrfs_fs_info *fs_info = cache->fs_info;
8173 target = cache->start;
8174 btrfs_put_block_group(cache);
8176 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_BALANCE)) {
8178 "zoned: skip relocating block group %llu to repair: EBUSY",
8183 mutex_lock(&fs_info->reclaim_bgs_lock);
8185 /* Ensure block group still exists */
8186 cache = btrfs_lookup_block_group(fs_info, target);
8190 if (!cache->relocating_repair)
8193 ret = btrfs_may_alloc_data_chunk(fs_info, target);
8198 "zoned: relocating block group %llu to repair IO failure",
8200 ret = btrfs_relocate_chunk(fs_info, target);
8204 btrfs_put_block_group(cache);
8205 mutex_unlock(&fs_info->reclaim_bgs_lock);
8206 btrfs_exclop_finish(fs_info);
8211 int btrfs_repair_one_zone(struct btrfs_fs_info *fs_info, u64 logical)
8213 struct btrfs_block_group *cache;
8215 /* Do not attempt to repair in degraded state */
8216 if (btrfs_test_opt(fs_info, DEGRADED))
8219 cache = btrfs_lookup_block_group(fs_info, logical);
8223 spin_lock(&cache->lock);
8224 if (cache->relocating_repair) {
8225 spin_unlock(&cache->lock);
8226 btrfs_put_block_group(cache);
8229 cache->relocating_repair = 1;
8230 spin_unlock(&cache->lock);
8232 kthread_run(relocating_repair_kthread, cache,
8233 "btrfs-relocating-repair");