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>
8 #include <linux/slab.h>
9 #include <linux/ratelimit.h>
10 #include <linux/kthread.h>
11 #include <linux/semaphore.h>
12 #include <linux/uuid.h>
13 #include <linux/list_sort.h>
14 #include <linux/namei.h>
17 #include "extent_map.h"
19 #include "transaction.h"
20 #include "print-tree.h"
23 #include "rcu-string.h"
24 #include "dev-replace.h"
26 #include "tree-checker.h"
27 #include "space-info.h"
28 #include "block-group.h"
32 #include "accessors.h"
33 #include "uuid-tree.h"
35 #include "relocation.h"
38 #include "raid-stripe-tree.h"
40 #define BTRFS_BLOCK_GROUP_STRIPE_MASK (BTRFS_BLOCK_GROUP_RAID0 | \
41 BTRFS_BLOCK_GROUP_RAID10 | \
42 BTRFS_BLOCK_GROUP_RAID56_MASK)
44 const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = {
45 [BTRFS_RAID_RAID10] = {
48 .devs_max = 0, /* 0 == as many as possible */
50 .tolerated_failures = 1,
54 .raid_name = "raid10",
55 .bg_flag = BTRFS_BLOCK_GROUP_RAID10,
56 .mindev_error = BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET,
58 [BTRFS_RAID_RAID1] = {
63 .tolerated_failures = 1,
68 .bg_flag = BTRFS_BLOCK_GROUP_RAID1,
69 .mindev_error = BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET,
71 [BTRFS_RAID_RAID1C3] = {
76 .tolerated_failures = 2,
80 .raid_name = "raid1c3",
81 .bg_flag = BTRFS_BLOCK_GROUP_RAID1C3,
82 .mindev_error = BTRFS_ERROR_DEV_RAID1C3_MIN_NOT_MET,
84 [BTRFS_RAID_RAID1C4] = {
89 .tolerated_failures = 3,
93 .raid_name = "raid1c4",
94 .bg_flag = BTRFS_BLOCK_GROUP_RAID1C4,
95 .mindev_error = BTRFS_ERROR_DEV_RAID1C4_MIN_NOT_MET,
102 .tolerated_failures = 0,
107 .bg_flag = BTRFS_BLOCK_GROUP_DUP,
110 [BTRFS_RAID_RAID0] = {
115 .tolerated_failures = 0,
119 .raid_name = "raid0",
120 .bg_flag = BTRFS_BLOCK_GROUP_RAID0,
123 [BTRFS_RAID_SINGLE] = {
128 .tolerated_failures = 0,
132 .raid_name = "single",
136 [BTRFS_RAID_RAID5] = {
141 .tolerated_failures = 1,
145 .raid_name = "raid5",
146 .bg_flag = BTRFS_BLOCK_GROUP_RAID5,
147 .mindev_error = BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET,
149 [BTRFS_RAID_RAID6] = {
154 .tolerated_failures = 2,
158 .raid_name = "raid6",
159 .bg_flag = BTRFS_BLOCK_GROUP_RAID6,
160 .mindev_error = BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET,
165 * Convert block group flags (BTRFS_BLOCK_GROUP_*) to btrfs_raid_types, which
166 * can be used as index to access btrfs_raid_array[].
168 enum btrfs_raid_types __attribute_const__ btrfs_bg_flags_to_raid_index(u64 flags)
170 const u64 profile = (flags & BTRFS_BLOCK_GROUP_PROFILE_MASK);
173 return BTRFS_RAID_SINGLE;
175 return BTRFS_BG_FLAG_TO_INDEX(profile);
178 const char *btrfs_bg_type_to_raid_name(u64 flags)
180 const int index = btrfs_bg_flags_to_raid_index(flags);
182 if (index >= BTRFS_NR_RAID_TYPES)
185 return btrfs_raid_array[index].raid_name;
188 int btrfs_nr_parity_stripes(u64 type)
190 enum btrfs_raid_types index = btrfs_bg_flags_to_raid_index(type);
192 return btrfs_raid_array[index].nparity;
196 * Fill @buf with textual description of @bg_flags, no more than @size_buf
197 * bytes including terminating null byte.
199 void btrfs_describe_block_groups(u64 bg_flags, char *buf, u32 size_buf)
204 u64 flags = bg_flags;
205 u32 size_bp = size_buf;
212 #define DESCRIBE_FLAG(flag, desc) \
214 if (flags & (flag)) { \
215 ret = snprintf(bp, size_bp, "%s|", (desc)); \
216 if (ret < 0 || ret >= size_bp) \
224 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_DATA, "data");
225 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_SYSTEM, "system");
226 DESCRIBE_FLAG(BTRFS_BLOCK_GROUP_METADATA, "metadata");
228 DESCRIBE_FLAG(BTRFS_AVAIL_ALLOC_BIT_SINGLE, "single");
229 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++)
230 DESCRIBE_FLAG(btrfs_raid_array[i].bg_flag,
231 btrfs_raid_array[i].raid_name);
235 ret = snprintf(bp, size_bp, "0x%llx|", flags);
239 if (size_bp < size_buf)
240 buf[size_buf - size_bp - 1] = '\0'; /* remove last | */
243 * The text is trimmed, it's up to the caller to provide sufficiently
249 static int init_first_rw_device(struct btrfs_trans_handle *trans);
250 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info);
251 static void btrfs_dev_stat_print_on_load(struct btrfs_device *device);
257 * There are several mutexes that protect manipulation of devices and low-level
258 * structures like chunks but not block groups, extents or files
260 * uuid_mutex (global lock)
261 * ------------------------
262 * protects the fs_uuids list that tracks all per-fs fs_devices, resulting from
263 * the SCAN_DEV ioctl registration or from mount either implicitly (the first
264 * device) or requested by the device= mount option
266 * the mutex can be very coarse and can cover long-running operations
268 * protects: updates to fs_devices counters like missing devices, rw devices,
269 * seeding, structure cloning, opening/closing devices at mount/umount time
271 * global::fs_devs - add, remove, updates to the global list
273 * does not protect: manipulation of the fs_devices::devices list in general
274 * but in mount context it could be used to exclude list modifications by eg.
277 * btrfs_device::name - renames (write side), read is RCU
279 * fs_devices::device_list_mutex (per-fs, with RCU)
280 * ------------------------------------------------
281 * protects updates to fs_devices::devices, ie. adding and deleting
283 * simple list traversal with read-only actions can be done with RCU protection
285 * may be used to exclude some operations from running concurrently without any
286 * modifications to the list (see write_all_supers)
288 * Is not required at mount and close times, because our device list is
289 * protected by the uuid_mutex at that point.
293 * protects balance structures (status, state) and context accessed from
294 * several places (internally, ioctl)
298 * protects chunks, adding or removing during allocation, trim or when a new
299 * device is added/removed. Additionally it also protects post_commit_list of
300 * individual devices, since they can be added to the transaction's
301 * post_commit_list only with chunk_mutex held.
305 * a big lock that is held by the cleaner thread and prevents running subvolume
306 * cleaning together with relocation or delayed iputs
318 * Exclusive operations
319 * ====================
321 * Maintains the exclusivity of the following operations that apply to the
322 * whole filesystem and cannot run in parallel.
327 * - Device replace (*)
330 * The device operations (as above) can be in one of the following states:
336 * Only device operations marked with (*) can go into the Paused state for the
339 * - ioctl (only Balance can be Paused through ioctl)
340 * - filesystem remounted as read-only
341 * - filesystem unmounted and mounted as read-only
342 * - system power-cycle and filesystem mounted as read-only
343 * - filesystem or device errors leading to forced read-only
345 * The status of exclusive operation is set and cleared atomically.
346 * During the course of Paused state, fs_info::exclusive_operation remains set.
347 * A device operation in Paused or Running state can be canceled or resumed
348 * either by ioctl (Balance only) or when remounted as read-write.
349 * The exclusive status is cleared when the device operation is canceled or
353 DEFINE_MUTEX(uuid_mutex);
354 static LIST_HEAD(fs_uuids);
355 struct list_head * __attribute_const__ btrfs_get_fs_uuids(void)
361 * Allocate new btrfs_fs_devices structure identified by a fsid.
363 * @fsid: if not NULL, copy the UUID to fs_devices::fsid and to
364 * fs_devices::metadata_fsid
366 * Return a pointer to a new struct btrfs_fs_devices on success, or ERR_PTR().
367 * The returned struct is not linked onto any lists and can be destroyed with
368 * kfree() right away.
370 static struct btrfs_fs_devices *alloc_fs_devices(const u8 *fsid)
372 struct btrfs_fs_devices *fs_devs;
374 fs_devs = kzalloc(sizeof(*fs_devs), GFP_KERNEL);
376 return ERR_PTR(-ENOMEM);
378 mutex_init(&fs_devs->device_list_mutex);
380 INIT_LIST_HEAD(&fs_devs->devices);
381 INIT_LIST_HEAD(&fs_devs->alloc_list);
382 INIT_LIST_HEAD(&fs_devs->fs_list);
383 INIT_LIST_HEAD(&fs_devs->seed_list);
386 memcpy(fs_devs->fsid, fsid, BTRFS_FSID_SIZE);
387 memcpy(fs_devs->metadata_uuid, fsid, BTRFS_FSID_SIZE);
393 static void btrfs_free_device(struct btrfs_device *device)
395 WARN_ON(!list_empty(&device->post_commit_list));
396 rcu_string_free(device->name);
397 extent_io_tree_release(&device->alloc_state);
398 btrfs_destroy_dev_zone_info(device);
402 static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
404 struct btrfs_device *device;
406 WARN_ON(fs_devices->opened);
407 while (!list_empty(&fs_devices->devices)) {
408 device = list_entry(fs_devices->devices.next,
409 struct btrfs_device, dev_list);
410 list_del(&device->dev_list);
411 btrfs_free_device(device);
416 void __exit btrfs_cleanup_fs_uuids(void)
418 struct btrfs_fs_devices *fs_devices;
420 while (!list_empty(&fs_uuids)) {
421 fs_devices = list_entry(fs_uuids.next,
422 struct btrfs_fs_devices, fs_list);
423 list_del(&fs_devices->fs_list);
424 free_fs_devices(fs_devices);
428 static bool match_fsid_fs_devices(const struct btrfs_fs_devices *fs_devices,
429 const u8 *fsid, const u8 *metadata_fsid)
431 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) != 0)
437 if (memcmp(metadata_fsid, fs_devices->metadata_uuid, BTRFS_FSID_SIZE) != 0)
443 static noinline struct btrfs_fs_devices *find_fsid(
444 const u8 *fsid, const u8 *metadata_fsid)
446 struct btrfs_fs_devices *fs_devices;
450 /* Handle non-split brain cases */
451 list_for_each_entry(fs_devices, &fs_uuids, fs_list) {
452 if (match_fsid_fs_devices(fs_devices, fsid, metadata_fsid))
459 btrfs_get_bdev_and_sb(const char *device_path, blk_mode_t flags, void *holder,
460 int flush, struct bdev_handle **bdev_handle,
461 struct btrfs_super_block **disk_super)
463 struct block_device *bdev;
466 *bdev_handle = bdev_open_by_path(device_path, flags, holder, NULL);
468 if (IS_ERR(*bdev_handle)) {
469 ret = PTR_ERR(*bdev_handle);
472 bdev = (*bdev_handle)->bdev;
476 ret = set_blocksize(bdev, BTRFS_BDEV_BLOCKSIZE);
478 bdev_release(*bdev_handle);
481 invalidate_bdev(bdev);
482 *disk_super = btrfs_read_dev_super(bdev);
483 if (IS_ERR(*disk_super)) {
484 ret = PTR_ERR(*disk_super);
485 bdev_release(*bdev_handle);
497 * Search and remove all stale devices (which are not mounted). When both
498 * inputs are NULL, it will search and release all stale devices.
500 * @devt: Optional. When provided will it release all unmounted devices
501 * matching this devt only.
502 * @skip_device: Optional. Will skip this device when searching for the stale
505 * Return: 0 for success or if @devt is 0.
506 * -EBUSY if @devt is a mounted device.
507 * -ENOENT if @devt does not match any device in the list.
509 static int btrfs_free_stale_devices(dev_t devt, struct btrfs_device *skip_device)
511 struct btrfs_fs_devices *fs_devices, *tmp_fs_devices;
512 struct btrfs_device *device, *tmp_device;
516 lockdep_assert_held(&uuid_mutex);
518 /* Return good status if there is no instance of devt. */
520 list_for_each_entry_safe(fs_devices, tmp_fs_devices, &fs_uuids, fs_list) {
522 mutex_lock(&fs_devices->device_list_mutex);
523 list_for_each_entry_safe(device, tmp_device,
524 &fs_devices->devices, dev_list) {
525 if (skip_device && skip_device == device)
527 if (devt && devt != device->devt)
529 if (fs_devices->opened) {
535 /* delete the stale device */
536 fs_devices->num_devices--;
537 list_del(&device->dev_list);
538 btrfs_free_device(device);
542 mutex_unlock(&fs_devices->device_list_mutex);
544 if (fs_devices->num_devices == 0) {
545 btrfs_sysfs_remove_fsid(fs_devices);
546 list_del(&fs_devices->fs_list);
547 free_fs_devices(fs_devices);
551 /* If there is at least one freed device return 0. */
558 static struct btrfs_fs_devices *find_fsid_by_device(
559 struct btrfs_super_block *disk_super,
560 dev_t devt, bool *same_fsid_diff_dev)
562 struct btrfs_fs_devices *fsid_fs_devices;
563 struct btrfs_fs_devices *devt_fs_devices;
564 const bool has_metadata_uuid = (btrfs_super_incompat_flags(disk_super) &
565 BTRFS_FEATURE_INCOMPAT_METADATA_UUID);
566 bool found_by_devt = false;
568 /* Find the fs_device by the usual method, if found use it. */
569 fsid_fs_devices = find_fsid(disk_super->fsid,
570 has_metadata_uuid ? disk_super->metadata_uuid : NULL);
572 /* The temp_fsid feature is supported only with single device filesystem. */
573 if (btrfs_super_num_devices(disk_super) != 1)
574 return fsid_fs_devices;
577 * A seed device is an integral component of the sprout device, which
578 * functions as a multi-device filesystem. So, temp-fsid feature is
581 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING)
582 return fsid_fs_devices;
584 /* Try to find a fs_devices by matching devt. */
585 list_for_each_entry(devt_fs_devices, &fs_uuids, fs_list) {
586 struct btrfs_device *device;
588 list_for_each_entry(device, &devt_fs_devices->devices, dev_list) {
589 if (device->devt == devt) {
590 found_by_devt = true;
599 /* Existing device. */
600 if (fsid_fs_devices == NULL) {
601 if (devt_fs_devices->opened == 0) {
605 /* temp_fsid is mounting a subvol. */
606 return devt_fs_devices;
609 /* Regular or temp_fsid device mounting a subvol. */
610 return devt_fs_devices;
614 if (fsid_fs_devices == NULL) {
617 /* sb::fsid is already used create a new temp_fsid. */
618 *same_fsid_diff_dev = true;
627 * This is only used on mount, and we are protected from competing things
628 * messing with our fs_devices by the uuid_mutex, thus we do not need the
629 * fs_devices->device_list_mutex here.
631 static int btrfs_open_one_device(struct btrfs_fs_devices *fs_devices,
632 struct btrfs_device *device, blk_mode_t flags,
635 struct bdev_handle *bdev_handle;
636 struct btrfs_super_block *disk_super;
645 ret = btrfs_get_bdev_and_sb(device->name->str, flags, holder, 1,
646 &bdev_handle, &disk_super);
650 devid = btrfs_stack_device_id(&disk_super->dev_item);
651 if (devid != device->devid)
652 goto error_free_page;
654 if (memcmp(device->uuid, disk_super->dev_item.uuid, BTRFS_UUID_SIZE))
655 goto error_free_page;
657 device->generation = btrfs_super_generation(disk_super);
659 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) {
660 if (btrfs_super_incompat_flags(disk_super) &
661 BTRFS_FEATURE_INCOMPAT_METADATA_UUID) {
663 "BTRFS: Invalid seeding and uuid-changed device detected\n");
664 goto error_free_page;
667 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
668 fs_devices->seeding = true;
670 if (bdev_read_only(bdev_handle->bdev))
671 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
673 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
676 if (!bdev_nonrot(bdev_handle->bdev))
677 fs_devices->rotating = true;
679 if (bdev_max_discard_sectors(bdev_handle->bdev))
680 fs_devices->discardable = true;
682 device->bdev_handle = bdev_handle;
683 device->bdev = bdev_handle->bdev;
684 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
686 fs_devices->open_devices++;
687 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
688 device->devid != BTRFS_DEV_REPLACE_DEVID) {
689 fs_devices->rw_devices++;
690 list_add_tail(&device->dev_alloc_list, &fs_devices->alloc_list);
692 btrfs_release_disk_super(disk_super);
697 btrfs_release_disk_super(disk_super);
698 bdev_release(bdev_handle);
703 u8 *btrfs_sb_fsid_ptr(struct btrfs_super_block *sb)
705 bool has_metadata_uuid = (btrfs_super_incompat_flags(sb) &
706 BTRFS_FEATURE_INCOMPAT_METADATA_UUID);
708 return has_metadata_uuid ? sb->metadata_uuid : sb->fsid;
712 * Add new device to list of registered devices
715 * device pointer which was just added or updated when successful
716 * error pointer when failed
718 static noinline struct btrfs_device *device_list_add(const char *path,
719 struct btrfs_super_block *disk_super,
720 bool *new_device_added)
722 struct btrfs_device *device;
723 struct btrfs_fs_devices *fs_devices = NULL;
724 struct rcu_string *name;
725 u64 found_transid = btrfs_super_generation(disk_super);
726 u64 devid = btrfs_stack_device_id(&disk_super->dev_item);
729 bool same_fsid_diff_dev = false;
730 bool has_metadata_uuid = (btrfs_super_incompat_flags(disk_super) &
731 BTRFS_FEATURE_INCOMPAT_METADATA_UUID);
733 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_CHANGING_FSID_V2) {
735 "device %s has incomplete metadata_uuid change, please use btrfstune to complete",
737 return ERR_PTR(-EAGAIN);
740 error = lookup_bdev(path, &path_devt);
742 btrfs_err(NULL, "failed to lookup block device for path %s: %d",
744 return ERR_PTR(error);
747 fs_devices = find_fsid_by_device(disk_super, path_devt, &same_fsid_diff_dev);
750 fs_devices = alloc_fs_devices(disk_super->fsid);
751 if (has_metadata_uuid)
752 memcpy(fs_devices->metadata_uuid,
753 disk_super->metadata_uuid, BTRFS_FSID_SIZE);
755 if (IS_ERR(fs_devices))
756 return ERR_CAST(fs_devices);
758 if (same_fsid_diff_dev) {
759 generate_random_uuid(fs_devices->fsid);
760 fs_devices->temp_fsid = true;
761 pr_info("BTRFS: device %s using temp-fsid %pU\n",
762 path, fs_devices->fsid);
765 mutex_lock(&fs_devices->device_list_mutex);
766 list_add(&fs_devices->fs_list, &fs_uuids);
770 struct btrfs_dev_lookup_args args = {
772 .uuid = disk_super->dev_item.uuid,
775 mutex_lock(&fs_devices->device_list_mutex);
776 device = btrfs_find_device(fs_devices, &args);
778 if (found_transid > fs_devices->latest_generation) {
779 memcpy(fs_devices->fsid, disk_super->fsid,
781 memcpy(fs_devices->metadata_uuid,
782 btrfs_sb_fsid_ptr(disk_super), BTRFS_FSID_SIZE);
787 unsigned int nofs_flag;
789 if (fs_devices->opened) {
791 "device %s belongs to fsid %pU, and the fs is already mounted, scanned by %s (%d)",
792 path, fs_devices->fsid, current->comm,
793 task_pid_nr(current));
794 mutex_unlock(&fs_devices->device_list_mutex);
795 return ERR_PTR(-EBUSY);
798 nofs_flag = memalloc_nofs_save();
799 device = btrfs_alloc_device(NULL, &devid,
800 disk_super->dev_item.uuid, path);
801 memalloc_nofs_restore(nofs_flag);
802 if (IS_ERR(device)) {
803 mutex_unlock(&fs_devices->device_list_mutex);
804 /* we can safely leave the fs_devices entry around */
808 device->devt = path_devt;
810 list_add_rcu(&device->dev_list, &fs_devices->devices);
811 fs_devices->num_devices++;
813 device->fs_devices = fs_devices;
814 *new_device_added = true;
816 if (disk_super->label[0])
818 "BTRFS: device label %s devid %llu transid %llu %s scanned by %s (%d)\n",
819 disk_super->label, devid, found_transid, path,
820 current->comm, task_pid_nr(current));
823 "BTRFS: device fsid %pU devid %llu transid %llu %s scanned by %s (%d)\n",
824 disk_super->fsid, devid, found_transid, path,
825 current->comm, task_pid_nr(current));
827 } else if (!device->name || strcmp(device->name->str, path)) {
829 * When FS is already mounted.
830 * 1. If you are here and if the device->name is NULL that
831 * means this device was missing at time of FS mount.
832 * 2. If you are here and if the device->name is different
833 * from 'path' that means either
834 * a. The same device disappeared and reappeared with
836 * b. The missing-disk-which-was-replaced, has
839 * We must allow 1 and 2a above. But 2b would be a spurious
842 * Further in case of 1 and 2a above, the disk at 'path'
843 * would have missed some transaction when it was away and
844 * in case of 2a the stale bdev has to be updated as well.
845 * 2b must not be allowed at all time.
849 * For now, we do allow update to btrfs_fs_device through the
850 * btrfs dev scan cli after FS has been mounted. We're still
851 * tracking a problem where systems fail mount by subvolume id
852 * when we reject replacement on a mounted FS.
854 if (!fs_devices->opened && found_transid < device->generation) {
856 * That is if the FS is _not_ mounted and if you
857 * are here, that means there is more than one
858 * disk with same uuid and devid.We keep the one
859 * with larger generation number or the last-in if
860 * generation are equal.
862 mutex_unlock(&fs_devices->device_list_mutex);
864 "device %s already registered with a higher generation, found %llu expect %llu",
865 path, found_transid, device->generation);
866 return ERR_PTR(-EEXIST);
870 * We are going to replace the device path for a given devid,
871 * make sure it's the same device if the device is mounted
873 * NOTE: the device->fs_info may not be reliable here so pass
874 * in a NULL to message helpers instead. This avoids a possible
875 * use-after-free when the fs_info and fs_info->sb are already
879 if (device->devt != path_devt) {
880 mutex_unlock(&fs_devices->device_list_mutex);
881 btrfs_warn_in_rcu(NULL,
882 "duplicate device %s devid %llu generation %llu scanned by %s (%d)",
883 path, devid, found_transid,
885 task_pid_nr(current));
886 return ERR_PTR(-EEXIST);
888 btrfs_info_in_rcu(NULL,
889 "devid %llu device path %s changed to %s scanned by %s (%d)",
890 devid, btrfs_dev_name(device),
892 task_pid_nr(current));
895 name = rcu_string_strdup(path, GFP_NOFS);
897 mutex_unlock(&fs_devices->device_list_mutex);
898 return ERR_PTR(-ENOMEM);
900 rcu_string_free(device->name);
901 rcu_assign_pointer(device->name, name);
902 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
903 fs_devices->missing_devices--;
904 clear_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
906 device->devt = path_devt;
910 * Unmount does not free the btrfs_device struct but would zero
911 * generation along with most of the other members. So just update
912 * it back. We need it to pick the disk with largest generation
915 if (!fs_devices->opened) {
916 device->generation = found_transid;
917 fs_devices->latest_generation = max_t(u64, found_transid,
918 fs_devices->latest_generation);
921 fs_devices->total_devices = btrfs_super_num_devices(disk_super);
923 mutex_unlock(&fs_devices->device_list_mutex);
927 static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig)
929 struct btrfs_fs_devices *fs_devices;
930 struct btrfs_device *device;
931 struct btrfs_device *orig_dev;
934 lockdep_assert_held(&uuid_mutex);
936 fs_devices = alloc_fs_devices(orig->fsid);
937 if (IS_ERR(fs_devices))
940 fs_devices->total_devices = orig->total_devices;
942 list_for_each_entry(orig_dev, &orig->devices, dev_list) {
943 const char *dev_path = NULL;
946 * This is ok to do without RCU read locked because we hold the
947 * uuid mutex so nothing we touch in here is going to disappear.
950 dev_path = orig_dev->name->str;
952 device = btrfs_alloc_device(NULL, &orig_dev->devid,
953 orig_dev->uuid, dev_path);
954 if (IS_ERR(device)) {
955 ret = PTR_ERR(device);
959 if (orig_dev->zone_info) {
960 struct btrfs_zoned_device_info *zone_info;
962 zone_info = btrfs_clone_dev_zone_info(orig_dev);
964 btrfs_free_device(device);
968 device->zone_info = zone_info;
971 list_add(&device->dev_list, &fs_devices->devices);
972 device->fs_devices = fs_devices;
973 fs_devices->num_devices++;
977 free_fs_devices(fs_devices);
981 static void __btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices,
982 struct btrfs_device **latest_dev)
984 struct btrfs_device *device, *next;
986 /* This is the initialized path, it is safe to release the devices. */
987 list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) {
988 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state)) {
989 if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT,
990 &device->dev_state) &&
991 !test_bit(BTRFS_DEV_STATE_MISSING,
992 &device->dev_state) &&
994 device->generation > (*latest_dev)->generation)) {
995 *latest_dev = device;
1001 * We have already validated the presence of BTRFS_DEV_REPLACE_DEVID,
1002 * in btrfs_init_dev_replace() so just continue.
1004 if (device->devid == BTRFS_DEV_REPLACE_DEVID)
1007 if (device->bdev_handle) {
1008 bdev_release(device->bdev_handle);
1009 device->bdev = NULL;
1010 device->bdev_handle = NULL;
1011 fs_devices->open_devices--;
1013 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1014 list_del_init(&device->dev_alloc_list);
1015 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
1016 fs_devices->rw_devices--;
1018 list_del_init(&device->dev_list);
1019 fs_devices->num_devices--;
1020 btrfs_free_device(device);
1026 * After we have read the system tree and know devids belonging to this
1027 * filesystem, remove the device which does not belong there.
1029 void btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices)
1031 struct btrfs_device *latest_dev = NULL;
1032 struct btrfs_fs_devices *seed_dev;
1034 mutex_lock(&uuid_mutex);
1035 __btrfs_free_extra_devids(fs_devices, &latest_dev);
1037 list_for_each_entry(seed_dev, &fs_devices->seed_list, seed_list)
1038 __btrfs_free_extra_devids(seed_dev, &latest_dev);
1040 fs_devices->latest_dev = latest_dev;
1042 mutex_unlock(&uuid_mutex);
1045 static void btrfs_close_bdev(struct btrfs_device *device)
1050 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1051 sync_blockdev(device->bdev);
1052 invalidate_bdev(device->bdev);
1055 bdev_release(device->bdev_handle);
1058 static void btrfs_close_one_device(struct btrfs_device *device)
1060 struct btrfs_fs_devices *fs_devices = device->fs_devices;
1062 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
1063 device->devid != BTRFS_DEV_REPLACE_DEVID) {
1064 list_del_init(&device->dev_alloc_list);
1065 fs_devices->rw_devices--;
1068 if (device->devid == BTRFS_DEV_REPLACE_DEVID)
1069 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
1071 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
1072 clear_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
1073 fs_devices->missing_devices--;
1076 btrfs_close_bdev(device);
1078 fs_devices->open_devices--;
1079 device->bdev = NULL;
1081 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
1082 btrfs_destroy_dev_zone_info(device);
1084 device->fs_info = NULL;
1085 atomic_set(&device->dev_stats_ccnt, 0);
1086 extent_io_tree_release(&device->alloc_state);
1089 * Reset the flush error record. We might have a transient flush error
1090 * in this mount, and if so we aborted the current transaction and set
1091 * the fs to an error state, guaranteeing no super blocks can be further
1092 * committed. However that error might be transient and if we unmount the
1093 * filesystem and mount it again, we should allow the mount to succeed
1094 * (btrfs_check_rw_degradable() should not fail) - if after mounting the
1095 * filesystem again we still get flush errors, then we will again abort
1096 * any transaction and set the error state, guaranteeing no commits of
1097 * unsafe super blocks.
1099 device->last_flush_error = 0;
1101 /* Verify the device is back in a pristine state */
1102 WARN_ON(test_bit(BTRFS_DEV_STATE_FLUSH_SENT, &device->dev_state));
1103 WARN_ON(test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state));
1104 WARN_ON(!list_empty(&device->dev_alloc_list));
1105 WARN_ON(!list_empty(&device->post_commit_list));
1108 static void close_fs_devices(struct btrfs_fs_devices *fs_devices)
1110 struct btrfs_device *device, *tmp;
1112 lockdep_assert_held(&uuid_mutex);
1114 if (--fs_devices->opened > 0)
1117 list_for_each_entry_safe(device, tmp, &fs_devices->devices, dev_list)
1118 btrfs_close_one_device(device);
1120 WARN_ON(fs_devices->open_devices);
1121 WARN_ON(fs_devices->rw_devices);
1122 fs_devices->opened = 0;
1123 fs_devices->seeding = false;
1124 fs_devices->fs_info = NULL;
1127 void btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
1130 struct btrfs_fs_devices *tmp;
1132 mutex_lock(&uuid_mutex);
1133 close_fs_devices(fs_devices);
1134 if (!fs_devices->opened) {
1135 list_splice_init(&fs_devices->seed_list, &list);
1138 * If the struct btrfs_fs_devices is not assembled with any
1139 * other device, it can be re-initialized during the next mount
1140 * without the needing device-scan step. Therefore, it can be
1143 if (fs_devices->num_devices == 1) {
1144 list_del(&fs_devices->fs_list);
1145 free_fs_devices(fs_devices);
1150 list_for_each_entry_safe(fs_devices, tmp, &list, seed_list) {
1151 close_fs_devices(fs_devices);
1152 list_del(&fs_devices->seed_list);
1153 free_fs_devices(fs_devices);
1155 mutex_unlock(&uuid_mutex);
1158 static int open_fs_devices(struct btrfs_fs_devices *fs_devices,
1159 blk_mode_t flags, void *holder)
1161 struct btrfs_device *device;
1162 struct btrfs_device *latest_dev = NULL;
1163 struct btrfs_device *tmp_device;
1165 list_for_each_entry_safe(device, tmp_device, &fs_devices->devices,
1169 ret = btrfs_open_one_device(fs_devices, device, flags, holder);
1171 (!latest_dev || device->generation > latest_dev->generation)) {
1172 latest_dev = device;
1173 } else if (ret == -ENODATA) {
1174 fs_devices->num_devices--;
1175 list_del(&device->dev_list);
1176 btrfs_free_device(device);
1179 if (fs_devices->open_devices == 0)
1182 fs_devices->opened = 1;
1183 fs_devices->latest_dev = latest_dev;
1184 fs_devices->total_rw_bytes = 0;
1185 fs_devices->chunk_alloc_policy = BTRFS_CHUNK_ALLOC_REGULAR;
1186 fs_devices->read_policy = BTRFS_READ_POLICY_PID;
1191 static int devid_cmp(void *priv, const struct list_head *a,
1192 const struct list_head *b)
1194 const struct btrfs_device *dev1, *dev2;
1196 dev1 = list_entry(a, struct btrfs_device, dev_list);
1197 dev2 = list_entry(b, struct btrfs_device, dev_list);
1199 if (dev1->devid < dev2->devid)
1201 else if (dev1->devid > dev2->devid)
1206 int btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
1207 blk_mode_t flags, void *holder)
1211 lockdep_assert_held(&uuid_mutex);
1213 * The device_list_mutex cannot be taken here in case opening the
1214 * underlying device takes further locks like open_mutex.
1216 * We also don't need the lock here as this is called during mount and
1217 * exclusion is provided by uuid_mutex
1220 if (fs_devices->opened) {
1221 fs_devices->opened++;
1224 list_sort(NULL, &fs_devices->devices, devid_cmp);
1225 ret = open_fs_devices(fs_devices, flags, holder);
1231 void btrfs_release_disk_super(struct btrfs_super_block *super)
1233 struct page *page = virt_to_page(super);
1238 static struct btrfs_super_block *btrfs_read_disk_super(struct block_device *bdev,
1239 u64 bytenr, u64 bytenr_orig)
1241 struct btrfs_super_block *disk_super;
1246 /* make sure our super fits in the device */
1247 if (bytenr + PAGE_SIZE >= bdev_nr_bytes(bdev))
1248 return ERR_PTR(-EINVAL);
1250 /* make sure our super fits in the page */
1251 if (sizeof(*disk_super) > PAGE_SIZE)
1252 return ERR_PTR(-EINVAL);
1254 /* make sure our super doesn't straddle pages on disk */
1255 index = bytenr >> PAGE_SHIFT;
1256 if ((bytenr + sizeof(*disk_super) - 1) >> PAGE_SHIFT != index)
1257 return ERR_PTR(-EINVAL);
1259 /* pull in the page with our super */
1260 page = read_cache_page_gfp(bdev->bd_inode->i_mapping, index, GFP_KERNEL);
1263 return ERR_CAST(page);
1265 p = page_address(page);
1267 /* align our pointer to the offset of the super block */
1268 disk_super = p + offset_in_page(bytenr);
1270 if (btrfs_super_bytenr(disk_super) != bytenr_orig ||
1271 btrfs_super_magic(disk_super) != BTRFS_MAGIC) {
1272 btrfs_release_disk_super(p);
1273 return ERR_PTR(-EINVAL);
1276 if (disk_super->label[0] && disk_super->label[BTRFS_LABEL_SIZE - 1])
1277 disk_super->label[BTRFS_LABEL_SIZE - 1] = 0;
1282 int btrfs_forget_devices(dev_t devt)
1286 mutex_lock(&uuid_mutex);
1287 ret = btrfs_free_stale_devices(devt, NULL);
1288 mutex_unlock(&uuid_mutex);
1294 * Look for a btrfs signature on a device. This may be called out of the mount path
1295 * and we are not allowed to call set_blocksize during the scan. The superblock
1296 * is read via pagecache.
1298 * With @mount_arg_dev it's a scan during mount time that will always register
1299 * the device or return an error. Multi-device and seeding devices are registered
1302 struct btrfs_device *btrfs_scan_one_device(const char *path, blk_mode_t flags,
1305 struct btrfs_super_block *disk_super;
1306 bool new_device_added = false;
1307 struct btrfs_device *device = NULL;
1308 struct bdev_handle *bdev_handle;
1309 u64 bytenr, bytenr_orig;
1312 lockdep_assert_held(&uuid_mutex);
1315 * we would like to check all the supers, but that would make
1316 * a btrfs mount succeed after a mkfs from a different FS.
1317 * So, we need to add a special mount option to scan for
1318 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
1322 * Avoid an exclusive open here, as the systemd-udev may initiate the
1323 * device scan which may race with the user's mount or mkfs command,
1324 * resulting in failure.
1325 * Since the device scan is solely for reading purposes, there is no
1326 * need for an exclusive open. Additionally, the devices are read again
1327 * during the mount process. It is ok to get some inconsistent
1328 * values temporarily, as the device paths of the fsid are the only
1329 * required information for assembling the volume.
1331 bdev_handle = bdev_open_by_path(path, flags, NULL, NULL);
1332 if (IS_ERR(bdev_handle))
1333 return ERR_CAST(bdev_handle);
1335 bytenr_orig = btrfs_sb_offset(0);
1336 ret = btrfs_sb_log_location_bdev(bdev_handle->bdev, 0, READ, &bytenr);
1338 device = ERR_PTR(ret);
1339 goto error_bdev_put;
1342 disk_super = btrfs_read_disk_super(bdev_handle->bdev, bytenr,
1344 if (IS_ERR(disk_super)) {
1345 device = ERR_CAST(disk_super);
1346 goto error_bdev_put;
1349 if (!mount_arg_dev && btrfs_super_num_devices(disk_super) == 1 &&
1350 !(btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING)) {
1353 ret = lookup_bdev(path, &devt);
1355 btrfs_warn(NULL, "lookup bdev failed for path %s: %d",
1358 btrfs_free_stale_devices(devt, NULL);
1360 pr_debug("BTRFS: skip registering single non-seed device %s\n", path);
1362 goto free_disk_super;
1365 device = device_list_add(path, disk_super, &new_device_added);
1366 if (!IS_ERR(device) && new_device_added)
1367 btrfs_free_stale_devices(device->devt, device);
1370 btrfs_release_disk_super(disk_super);
1373 bdev_release(bdev_handle);
1379 * Try to find a chunk that intersects [start, start + len] range and when one
1380 * such is found, record the end of it in *start
1382 static bool contains_pending_extent(struct btrfs_device *device, u64 *start,
1385 u64 physical_start, physical_end;
1387 lockdep_assert_held(&device->fs_info->chunk_mutex);
1389 if (find_first_extent_bit(&device->alloc_state, *start,
1390 &physical_start, &physical_end,
1391 CHUNK_ALLOCATED, NULL)) {
1393 if (in_range(physical_start, *start, len) ||
1394 in_range(*start, physical_start,
1395 physical_end - physical_start)) {
1396 *start = physical_end + 1;
1403 static u64 dev_extent_search_start(struct btrfs_device *device)
1405 switch (device->fs_devices->chunk_alloc_policy) {
1406 case BTRFS_CHUNK_ALLOC_REGULAR:
1407 return BTRFS_DEVICE_RANGE_RESERVED;
1408 case BTRFS_CHUNK_ALLOC_ZONED:
1410 * We don't care about the starting region like regular
1411 * allocator, because we anyway use/reserve the first two zones
1412 * for superblock logging.
1420 static bool dev_extent_hole_check_zoned(struct btrfs_device *device,
1421 u64 *hole_start, u64 *hole_size,
1424 u64 zone_size = device->zone_info->zone_size;
1427 bool changed = false;
1429 ASSERT(IS_ALIGNED(*hole_start, zone_size));
1431 while (*hole_size > 0) {
1432 pos = btrfs_find_allocatable_zones(device, *hole_start,
1433 *hole_start + *hole_size,
1435 if (pos != *hole_start) {
1436 *hole_size = *hole_start + *hole_size - pos;
1439 if (*hole_size < num_bytes)
1443 ret = btrfs_ensure_empty_zones(device, pos, num_bytes);
1445 /* Range is ensured to be empty */
1449 /* Given hole range was invalid (outside of device) */
1450 if (ret == -ERANGE) {
1451 *hole_start += *hole_size;
1456 *hole_start += zone_size;
1457 *hole_size -= zone_size;
1465 * Check if specified hole is suitable for allocation.
1467 * @device: the device which we have the hole
1468 * @hole_start: starting position of the hole
1469 * @hole_size: the size of the hole
1470 * @num_bytes: the size of the free space that we need
1472 * This function may modify @hole_start and @hole_size to reflect the suitable
1473 * position for allocation. Returns 1 if hole position is updated, 0 otherwise.
1475 static bool dev_extent_hole_check(struct btrfs_device *device, u64 *hole_start,
1476 u64 *hole_size, u64 num_bytes)
1478 bool changed = false;
1479 u64 hole_end = *hole_start + *hole_size;
1483 * Check before we set max_hole_start, otherwise we could end up
1484 * sending back this offset anyway.
1486 if (contains_pending_extent(device, hole_start, *hole_size)) {
1487 if (hole_end >= *hole_start)
1488 *hole_size = hole_end - *hole_start;
1494 switch (device->fs_devices->chunk_alloc_policy) {
1495 case BTRFS_CHUNK_ALLOC_REGULAR:
1496 /* No extra check */
1498 case BTRFS_CHUNK_ALLOC_ZONED:
1499 if (dev_extent_hole_check_zoned(device, hole_start,
1500 hole_size, num_bytes)) {
1503 * The changed hole can contain pending extent.
1504 * Loop again to check that.
1520 * Find free space in the specified device.
1522 * @device: the device which we search the free space in
1523 * @num_bytes: the size of the free space that we need
1524 * @search_start: the position from which to begin the search
1525 * @start: store the start of the free space.
1526 * @len: the size of the free space. that we find, or the size
1527 * of the max free space if we don't find suitable free space
1529 * This does a pretty simple search, the expectation is that it is called very
1530 * infrequently and that a given device has a small number of extents.
1532 * @start is used to store the start of the free space if we find. But if we
1533 * don't find suitable free space, it will be used to store the start position
1534 * of the max free space.
1536 * @len is used to store the size of the free space that we find.
1537 * But if we don't find suitable free space, it is used to store the size of
1538 * the max free space.
1540 * NOTE: This function will search *commit* root of device tree, and does extra
1541 * check to ensure dev extents are not double allocated.
1542 * This makes the function safe to allocate dev extents but may not report
1543 * correct usable device space, as device extent freed in current transaction
1544 * is not reported as available.
1546 static int find_free_dev_extent(struct btrfs_device *device, u64 num_bytes,
1547 u64 *start, u64 *len)
1549 struct btrfs_fs_info *fs_info = device->fs_info;
1550 struct btrfs_root *root = fs_info->dev_root;
1551 struct btrfs_key key;
1552 struct btrfs_dev_extent *dev_extent;
1553 struct btrfs_path *path;
1557 u64 max_hole_size = 0;
1559 u64 search_end = device->total_bytes;
1562 struct extent_buffer *l;
1564 search_start = dev_extent_search_start(device);
1565 max_hole_start = search_start;
1567 WARN_ON(device->zone_info &&
1568 !IS_ALIGNED(num_bytes, device->zone_info->zone_size));
1570 path = btrfs_alloc_path();
1576 if (search_start >= search_end ||
1577 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
1582 path->reada = READA_FORWARD;
1583 path->search_commit_root = 1;
1584 path->skip_locking = 1;
1586 key.objectid = device->devid;
1587 key.offset = search_start;
1588 key.type = BTRFS_DEV_EXTENT_KEY;
1590 ret = btrfs_search_backwards(root, &key, path);
1594 while (search_start < search_end) {
1596 slot = path->slots[0];
1597 if (slot >= btrfs_header_nritems(l)) {
1598 ret = btrfs_next_leaf(root, path);
1606 btrfs_item_key_to_cpu(l, &key, slot);
1608 if (key.objectid < device->devid)
1611 if (key.objectid > device->devid)
1614 if (key.type != BTRFS_DEV_EXTENT_KEY)
1617 if (key.offset > search_end)
1620 if (key.offset > search_start) {
1621 hole_size = key.offset - search_start;
1622 dev_extent_hole_check(device, &search_start, &hole_size,
1625 if (hole_size > max_hole_size) {
1626 max_hole_start = search_start;
1627 max_hole_size = hole_size;
1631 * If this free space is greater than which we need,
1632 * it must be the max free space that we have found
1633 * until now, so max_hole_start must point to the start
1634 * of this free space and the length of this free space
1635 * is stored in max_hole_size. Thus, we return
1636 * max_hole_start and max_hole_size and go back to the
1639 if (hole_size >= num_bytes) {
1645 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1646 extent_end = key.offset + btrfs_dev_extent_length(l,
1648 if (extent_end > search_start)
1649 search_start = extent_end;
1656 * At this point, search_start should be the end of
1657 * allocated dev extents, and when shrinking the device,
1658 * search_end may be smaller than search_start.
1660 if (search_end > search_start) {
1661 hole_size = search_end - search_start;
1662 if (dev_extent_hole_check(device, &search_start, &hole_size,
1664 btrfs_release_path(path);
1668 if (hole_size > max_hole_size) {
1669 max_hole_start = search_start;
1670 max_hole_size = hole_size;
1675 if (max_hole_size < num_bytes)
1680 ASSERT(max_hole_start + max_hole_size <= search_end);
1682 btrfs_free_path(path);
1683 *start = max_hole_start;
1685 *len = max_hole_size;
1689 static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans,
1690 struct btrfs_device *device,
1691 u64 start, u64 *dev_extent_len)
1693 struct btrfs_fs_info *fs_info = device->fs_info;
1694 struct btrfs_root *root = fs_info->dev_root;
1696 struct btrfs_path *path;
1697 struct btrfs_key key;
1698 struct btrfs_key found_key;
1699 struct extent_buffer *leaf = NULL;
1700 struct btrfs_dev_extent *extent = NULL;
1702 path = btrfs_alloc_path();
1706 key.objectid = device->devid;
1708 key.type = BTRFS_DEV_EXTENT_KEY;
1710 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1712 ret = btrfs_previous_item(root, path, key.objectid,
1713 BTRFS_DEV_EXTENT_KEY);
1716 leaf = path->nodes[0];
1717 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1718 extent = btrfs_item_ptr(leaf, path->slots[0],
1719 struct btrfs_dev_extent);
1720 BUG_ON(found_key.offset > start || found_key.offset +
1721 btrfs_dev_extent_length(leaf, extent) < start);
1723 btrfs_release_path(path);
1725 } else if (ret == 0) {
1726 leaf = path->nodes[0];
1727 extent = btrfs_item_ptr(leaf, path->slots[0],
1728 struct btrfs_dev_extent);
1733 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1735 ret = btrfs_del_item(trans, root, path);
1737 set_bit(BTRFS_TRANS_HAVE_FREE_BGS, &trans->transaction->flags);
1739 btrfs_free_path(path);
1743 static u64 find_next_chunk(struct btrfs_fs_info *fs_info)
1745 struct extent_map_tree *em_tree;
1746 struct extent_map *em;
1750 em_tree = &fs_info->mapping_tree;
1751 read_lock(&em_tree->lock);
1752 n = rb_last(&em_tree->map.rb_root);
1754 em = rb_entry(n, struct extent_map, rb_node);
1755 ret = em->start + em->len;
1757 read_unlock(&em_tree->lock);
1762 static noinline int find_next_devid(struct btrfs_fs_info *fs_info,
1766 struct btrfs_key key;
1767 struct btrfs_key found_key;
1768 struct btrfs_path *path;
1770 path = btrfs_alloc_path();
1774 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1775 key.type = BTRFS_DEV_ITEM_KEY;
1776 key.offset = (u64)-1;
1778 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
1784 btrfs_err(fs_info, "corrupted chunk tree devid -1 matched");
1789 ret = btrfs_previous_item(fs_info->chunk_root, path,
1790 BTRFS_DEV_ITEMS_OBJECTID,
1791 BTRFS_DEV_ITEM_KEY);
1795 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1797 *devid_ret = found_key.offset + 1;
1801 btrfs_free_path(path);
1806 * the device information is stored in the chunk root
1807 * the btrfs_device struct should be fully filled in
1809 static int btrfs_add_dev_item(struct btrfs_trans_handle *trans,
1810 struct btrfs_device *device)
1813 struct btrfs_path *path;
1814 struct btrfs_dev_item *dev_item;
1815 struct extent_buffer *leaf;
1816 struct btrfs_key key;
1819 path = btrfs_alloc_path();
1823 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1824 key.type = BTRFS_DEV_ITEM_KEY;
1825 key.offset = device->devid;
1827 btrfs_reserve_chunk_metadata(trans, true);
1828 ret = btrfs_insert_empty_item(trans, trans->fs_info->chunk_root, path,
1829 &key, sizeof(*dev_item));
1830 btrfs_trans_release_chunk_metadata(trans);
1834 leaf = path->nodes[0];
1835 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1837 btrfs_set_device_id(leaf, dev_item, device->devid);
1838 btrfs_set_device_generation(leaf, dev_item, 0);
1839 btrfs_set_device_type(leaf, dev_item, device->type);
1840 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1841 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1842 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1843 btrfs_set_device_total_bytes(leaf, dev_item,
1844 btrfs_device_get_disk_total_bytes(device));
1845 btrfs_set_device_bytes_used(leaf, dev_item,
1846 btrfs_device_get_bytes_used(device));
1847 btrfs_set_device_group(leaf, dev_item, 0);
1848 btrfs_set_device_seek_speed(leaf, dev_item, 0);
1849 btrfs_set_device_bandwidth(leaf, dev_item, 0);
1850 btrfs_set_device_start_offset(leaf, dev_item, 0);
1852 ptr = btrfs_device_uuid(dev_item);
1853 write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
1854 ptr = btrfs_device_fsid(dev_item);
1855 write_extent_buffer(leaf, trans->fs_info->fs_devices->metadata_uuid,
1856 ptr, BTRFS_FSID_SIZE);
1857 btrfs_mark_buffer_dirty(trans, leaf);
1861 btrfs_free_path(path);
1866 * Function to update ctime/mtime for a given device path.
1867 * Mainly used for ctime/mtime based probe like libblkid.
1869 * We don't care about errors here, this is just to be kind to userspace.
1871 static void update_dev_time(const char *device_path)
1876 ret = kern_path(device_path, LOOKUP_FOLLOW, &path);
1880 inode_update_time(d_inode(path.dentry), S_MTIME | S_CTIME | S_VERSION);
1884 static int btrfs_rm_dev_item(struct btrfs_trans_handle *trans,
1885 struct btrfs_device *device)
1887 struct btrfs_root *root = device->fs_info->chunk_root;
1889 struct btrfs_path *path;
1890 struct btrfs_key key;
1892 path = btrfs_alloc_path();
1896 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1897 key.type = BTRFS_DEV_ITEM_KEY;
1898 key.offset = device->devid;
1900 btrfs_reserve_chunk_metadata(trans, false);
1901 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1902 btrfs_trans_release_chunk_metadata(trans);
1909 ret = btrfs_del_item(trans, root, path);
1911 btrfs_free_path(path);
1916 * Verify that @num_devices satisfies the RAID profile constraints in the whole
1917 * filesystem. It's up to the caller to adjust that number regarding eg. device
1920 static int btrfs_check_raid_min_devices(struct btrfs_fs_info *fs_info,
1928 seq = read_seqbegin(&fs_info->profiles_lock);
1930 all_avail = fs_info->avail_data_alloc_bits |
1931 fs_info->avail_system_alloc_bits |
1932 fs_info->avail_metadata_alloc_bits;
1933 } while (read_seqretry(&fs_info->profiles_lock, seq));
1935 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
1936 if (!(all_avail & btrfs_raid_array[i].bg_flag))
1939 if (num_devices < btrfs_raid_array[i].devs_min)
1940 return btrfs_raid_array[i].mindev_error;
1946 static struct btrfs_device * btrfs_find_next_active_device(
1947 struct btrfs_fs_devices *fs_devs, struct btrfs_device *device)
1949 struct btrfs_device *next_device;
1951 list_for_each_entry(next_device, &fs_devs->devices, dev_list) {
1952 if (next_device != device &&
1953 !test_bit(BTRFS_DEV_STATE_MISSING, &next_device->dev_state)
1954 && next_device->bdev)
1962 * Helper function to check if the given device is part of s_bdev / latest_dev
1963 * and replace it with the provided or the next active device, in the context
1964 * where this function called, there should be always be another device (or
1965 * this_dev) which is active.
1967 void __cold btrfs_assign_next_active_device(struct btrfs_device *device,
1968 struct btrfs_device *next_device)
1970 struct btrfs_fs_info *fs_info = device->fs_info;
1973 next_device = btrfs_find_next_active_device(fs_info->fs_devices,
1975 ASSERT(next_device);
1977 if (fs_info->sb->s_bdev &&
1978 (fs_info->sb->s_bdev == device->bdev))
1979 fs_info->sb->s_bdev = next_device->bdev;
1981 if (fs_info->fs_devices->latest_dev->bdev == device->bdev)
1982 fs_info->fs_devices->latest_dev = next_device;
1986 * Return btrfs_fs_devices::num_devices excluding the device that's being
1987 * currently replaced.
1989 static u64 btrfs_num_devices(struct btrfs_fs_info *fs_info)
1991 u64 num_devices = fs_info->fs_devices->num_devices;
1993 down_read(&fs_info->dev_replace.rwsem);
1994 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) {
1995 ASSERT(num_devices > 1);
1998 up_read(&fs_info->dev_replace.rwsem);
2003 static void btrfs_scratch_superblock(struct btrfs_fs_info *fs_info,
2004 struct block_device *bdev, int copy_num)
2006 struct btrfs_super_block *disk_super;
2007 const size_t len = sizeof(disk_super->magic);
2008 const u64 bytenr = btrfs_sb_offset(copy_num);
2011 disk_super = btrfs_read_disk_super(bdev, bytenr, bytenr);
2012 if (IS_ERR(disk_super))
2015 memset(&disk_super->magic, 0, len);
2016 folio_mark_dirty(virt_to_folio(disk_super));
2017 btrfs_release_disk_super(disk_super);
2019 ret = sync_blockdev_range(bdev, bytenr, bytenr + len - 1);
2021 btrfs_warn(fs_info, "error clearing superblock number %d (%d)",
2025 void btrfs_scratch_superblocks(struct btrfs_fs_info *fs_info,
2026 struct block_device *bdev,
2027 const char *device_path)
2034 for (copy_num = 0; copy_num < BTRFS_SUPER_MIRROR_MAX; copy_num++) {
2035 if (bdev_is_zoned(bdev))
2036 btrfs_reset_sb_log_zones(bdev, copy_num);
2038 btrfs_scratch_superblock(fs_info, bdev, copy_num);
2041 /* Notify udev that device has changed */
2042 btrfs_kobject_uevent(bdev, KOBJ_CHANGE);
2044 /* Update ctime/mtime for device path for libblkid */
2045 update_dev_time(device_path);
2048 int btrfs_rm_device(struct btrfs_fs_info *fs_info,
2049 struct btrfs_dev_lookup_args *args,
2050 struct bdev_handle **bdev_handle)
2052 struct btrfs_trans_handle *trans;
2053 struct btrfs_device *device;
2054 struct btrfs_fs_devices *cur_devices;
2055 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2059 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) {
2060 btrfs_err(fs_info, "device remove not supported on extent tree v2 yet");
2065 * The device list in fs_devices is accessed without locks (neither
2066 * uuid_mutex nor device_list_mutex) as it won't change on a mounted
2067 * filesystem and another device rm cannot run.
2069 num_devices = btrfs_num_devices(fs_info);
2071 ret = btrfs_check_raid_min_devices(fs_info, num_devices - 1);
2075 device = btrfs_find_device(fs_info->fs_devices, args);
2078 ret = BTRFS_ERROR_DEV_MISSING_NOT_FOUND;
2084 if (btrfs_pinned_by_swapfile(fs_info, device)) {
2085 btrfs_warn_in_rcu(fs_info,
2086 "cannot remove device %s (devid %llu) due to active swapfile",
2087 btrfs_dev_name(device), device->devid);
2091 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
2092 return BTRFS_ERROR_DEV_TGT_REPLACE;
2094 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
2095 fs_info->fs_devices->rw_devices == 1)
2096 return BTRFS_ERROR_DEV_ONLY_WRITABLE;
2098 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2099 mutex_lock(&fs_info->chunk_mutex);
2100 list_del_init(&device->dev_alloc_list);
2101 device->fs_devices->rw_devices--;
2102 mutex_unlock(&fs_info->chunk_mutex);
2105 ret = btrfs_shrink_device(device, 0);
2109 trans = btrfs_start_transaction(fs_info->chunk_root, 0);
2110 if (IS_ERR(trans)) {
2111 ret = PTR_ERR(trans);
2115 ret = btrfs_rm_dev_item(trans, device);
2117 /* Any error in dev item removal is critical */
2119 "failed to remove device item for devid %llu: %d",
2120 device->devid, ret);
2121 btrfs_abort_transaction(trans, ret);
2122 btrfs_end_transaction(trans);
2126 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2127 btrfs_scrub_cancel_dev(device);
2130 * the device list mutex makes sure that we don't change
2131 * the device list while someone else is writing out all
2132 * the device supers. Whoever is writing all supers, should
2133 * lock the device list mutex before getting the number of
2134 * devices in the super block (super_copy). Conversely,
2135 * whoever updates the number of devices in the super block
2136 * (super_copy) should hold the device list mutex.
2140 * In normal cases the cur_devices == fs_devices. But in case
2141 * of deleting a seed device, the cur_devices should point to
2142 * its own fs_devices listed under the fs_devices->seed_list.
2144 cur_devices = device->fs_devices;
2145 mutex_lock(&fs_devices->device_list_mutex);
2146 list_del_rcu(&device->dev_list);
2148 cur_devices->num_devices--;
2149 cur_devices->total_devices--;
2150 /* Update total_devices of the parent fs_devices if it's seed */
2151 if (cur_devices != fs_devices)
2152 fs_devices->total_devices--;
2154 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state))
2155 cur_devices->missing_devices--;
2157 btrfs_assign_next_active_device(device, NULL);
2159 if (device->bdev_handle) {
2160 cur_devices->open_devices--;
2161 /* remove sysfs entry */
2162 btrfs_sysfs_remove_device(device);
2165 num_devices = btrfs_super_num_devices(fs_info->super_copy) - 1;
2166 btrfs_set_super_num_devices(fs_info->super_copy, num_devices);
2167 mutex_unlock(&fs_devices->device_list_mutex);
2170 * At this point, the device is zero sized and detached from the
2171 * devices list. All that's left is to zero out the old supers and
2174 * We cannot call btrfs_close_bdev() here because we're holding the sb
2175 * write lock, and bdev_release() will pull in the ->open_mutex on
2176 * the block device and it's dependencies. Instead just flush the
2177 * device and let the caller do the final bdev_release.
2179 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2180 btrfs_scratch_superblocks(fs_info, device->bdev,
2183 sync_blockdev(device->bdev);
2184 invalidate_bdev(device->bdev);
2188 *bdev_handle = device->bdev_handle;
2190 btrfs_free_device(device);
2193 * This can happen if cur_devices is the private seed devices list. We
2194 * cannot call close_fs_devices() here because it expects the uuid_mutex
2195 * to be held, but in fact we don't need that for the private
2196 * seed_devices, we can simply decrement cur_devices->opened and then
2197 * remove it from our list and free the fs_devices.
2199 if (cur_devices->num_devices == 0) {
2200 list_del_init(&cur_devices->seed_list);
2201 ASSERT(cur_devices->opened == 1);
2202 cur_devices->opened--;
2203 free_fs_devices(cur_devices);
2206 ret = btrfs_commit_transaction(trans);
2211 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2212 mutex_lock(&fs_info->chunk_mutex);
2213 list_add(&device->dev_alloc_list,
2214 &fs_devices->alloc_list);
2215 device->fs_devices->rw_devices++;
2216 mutex_unlock(&fs_info->chunk_mutex);
2221 void btrfs_rm_dev_replace_remove_srcdev(struct btrfs_device *srcdev)
2223 struct btrfs_fs_devices *fs_devices;
2225 lockdep_assert_held(&srcdev->fs_info->fs_devices->device_list_mutex);
2228 * in case of fs with no seed, srcdev->fs_devices will point
2229 * to fs_devices of fs_info. However when the dev being replaced is
2230 * a seed dev it will point to the seed's local fs_devices. In short
2231 * srcdev will have its correct fs_devices in both the cases.
2233 fs_devices = srcdev->fs_devices;
2235 list_del_rcu(&srcdev->dev_list);
2236 list_del(&srcdev->dev_alloc_list);
2237 fs_devices->num_devices--;
2238 if (test_bit(BTRFS_DEV_STATE_MISSING, &srcdev->dev_state))
2239 fs_devices->missing_devices--;
2241 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state))
2242 fs_devices->rw_devices--;
2245 fs_devices->open_devices--;
2248 void btrfs_rm_dev_replace_free_srcdev(struct btrfs_device *srcdev)
2250 struct btrfs_fs_devices *fs_devices = srcdev->fs_devices;
2252 mutex_lock(&uuid_mutex);
2254 btrfs_close_bdev(srcdev);
2256 btrfs_free_device(srcdev);
2258 /* if this is no devs we rather delete the fs_devices */
2259 if (!fs_devices->num_devices) {
2261 * On a mounted FS, num_devices can't be zero unless it's a
2262 * seed. In case of a seed device being replaced, the replace
2263 * target added to the sprout FS, so there will be no more
2264 * device left under the seed FS.
2266 ASSERT(fs_devices->seeding);
2268 list_del_init(&fs_devices->seed_list);
2269 close_fs_devices(fs_devices);
2270 free_fs_devices(fs_devices);
2272 mutex_unlock(&uuid_mutex);
2275 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_device *tgtdev)
2277 struct btrfs_fs_devices *fs_devices = tgtdev->fs_info->fs_devices;
2279 mutex_lock(&fs_devices->device_list_mutex);
2281 btrfs_sysfs_remove_device(tgtdev);
2284 fs_devices->open_devices--;
2286 fs_devices->num_devices--;
2288 btrfs_assign_next_active_device(tgtdev, NULL);
2290 list_del_rcu(&tgtdev->dev_list);
2292 mutex_unlock(&fs_devices->device_list_mutex);
2294 btrfs_scratch_superblocks(tgtdev->fs_info, tgtdev->bdev,
2297 btrfs_close_bdev(tgtdev);
2299 btrfs_free_device(tgtdev);
2303 * Populate args from device at path.
2305 * @fs_info: the filesystem
2306 * @args: the args to populate
2307 * @path: the path to the device
2309 * This will read the super block of the device at @path and populate @args with
2310 * the devid, fsid, and uuid. This is meant to be used for ioctls that need to
2311 * lookup a device to operate on, but need to do it before we take any locks.
2312 * This properly handles the special case of "missing" that a user may pass in,
2313 * and does some basic sanity checks. The caller must make sure that @path is
2314 * properly NUL terminated before calling in, and must call
2315 * btrfs_put_dev_args_from_path() in order to free up the temporary fsid and
2318 * Return: 0 for success, -errno for failure
2320 int btrfs_get_dev_args_from_path(struct btrfs_fs_info *fs_info,
2321 struct btrfs_dev_lookup_args *args,
2324 struct btrfs_super_block *disk_super;
2325 struct bdev_handle *bdev_handle;
2328 if (!path || !path[0])
2330 if (!strcmp(path, "missing")) {
2331 args->missing = true;
2335 args->uuid = kzalloc(BTRFS_UUID_SIZE, GFP_KERNEL);
2336 args->fsid = kzalloc(BTRFS_FSID_SIZE, GFP_KERNEL);
2337 if (!args->uuid || !args->fsid) {
2338 btrfs_put_dev_args_from_path(args);
2342 ret = btrfs_get_bdev_and_sb(path, BLK_OPEN_READ, NULL, 0,
2343 &bdev_handle, &disk_super);
2345 btrfs_put_dev_args_from_path(args);
2349 args->devid = btrfs_stack_device_id(&disk_super->dev_item);
2350 memcpy(args->uuid, disk_super->dev_item.uuid, BTRFS_UUID_SIZE);
2351 if (btrfs_fs_incompat(fs_info, METADATA_UUID))
2352 memcpy(args->fsid, disk_super->metadata_uuid, BTRFS_FSID_SIZE);
2354 memcpy(args->fsid, disk_super->fsid, BTRFS_FSID_SIZE);
2355 btrfs_release_disk_super(disk_super);
2356 bdev_release(bdev_handle);
2361 * Only use this jointly with btrfs_get_dev_args_from_path() because we will
2362 * allocate our ->uuid and ->fsid pointers, everybody else uses local variables
2363 * that don't need to be freed.
2365 void btrfs_put_dev_args_from_path(struct btrfs_dev_lookup_args *args)
2373 struct btrfs_device *btrfs_find_device_by_devspec(
2374 struct btrfs_fs_info *fs_info, u64 devid,
2375 const char *device_path)
2377 BTRFS_DEV_LOOKUP_ARGS(args);
2378 struct btrfs_device *device;
2383 device = btrfs_find_device(fs_info->fs_devices, &args);
2385 return ERR_PTR(-ENOENT);
2389 ret = btrfs_get_dev_args_from_path(fs_info, &args, device_path);
2391 return ERR_PTR(ret);
2392 device = btrfs_find_device(fs_info->fs_devices, &args);
2393 btrfs_put_dev_args_from_path(&args);
2395 return ERR_PTR(-ENOENT);
2399 static struct btrfs_fs_devices *btrfs_init_sprout(struct btrfs_fs_info *fs_info)
2401 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2402 struct btrfs_fs_devices *old_devices;
2403 struct btrfs_fs_devices *seed_devices;
2405 lockdep_assert_held(&uuid_mutex);
2406 if (!fs_devices->seeding)
2407 return ERR_PTR(-EINVAL);
2410 * Private copy of the seed devices, anchored at
2411 * fs_info->fs_devices->seed_list
2413 seed_devices = alloc_fs_devices(NULL);
2414 if (IS_ERR(seed_devices))
2415 return seed_devices;
2418 * It's necessary to retain a copy of the original seed fs_devices in
2419 * fs_uuids so that filesystems which have been seeded can successfully
2420 * reference the seed device from open_seed_devices. This also supports
2423 old_devices = clone_fs_devices(fs_devices);
2424 if (IS_ERR(old_devices)) {
2425 kfree(seed_devices);
2429 list_add(&old_devices->fs_list, &fs_uuids);
2431 memcpy(seed_devices, fs_devices, sizeof(*seed_devices));
2432 seed_devices->opened = 1;
2433 INIT_LIST_HEAD(&seed_devices->devices);
2434 INIT_LIST_HEAD(&seed_devices->alloc_list);
2435 mutex_init(&seed_devices->device_list_mutex);
2437 return seed_devices;
2441 * Splice seed devices into the sprout fs_devices.
2442 * Generate a new fsid for the sprouted read-write filesystem.
2444 static void btrfs_setup_sprout(struct btrfs_fs_info *fs_info,
2445 struct btrfs_fs_devices *seed_devices)
2447 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2448 struct btrfs_super_block *disk_super = fs_info->super_copy;
2449 struct btrfs_device *device;
2453 * We are updating the fsid, the thread leading to device_list_add()
2454 * could race, so uuid_mutex is needed.
2456 lockdep_assert_held(&uuid_mutex);
2459 * The threads listed below may traverse dev_list but can do that without
2460 * device_list_mutex:
2461 * - All device ops and balance - as we are in btrfs_exclop_start.
2462 * - Various dev_list readers - are using RCU.
2463 * - btrfs_ioctl_fitrim() - is using RCU.
2465 * For-read threads as below are using device_list_mutex:
2466 * - Readonly scrub btrfs_scrub_dev()
2467 * - Readonly scrub btrfs_scrub_progress()
2468 * - btrfs_get_dev_stats()
2470 lockdep_assert_held(&fs_devices->device_list_mutex);
2472 list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices,
2474 list_for_each_entry(device, &seed_devices->devices, dev_list)
2475 device->fs_devices = seed_devices;
2477 fs_devices->seeding = false;
2478 fs_devices->num_devices = 0;
2479 fs_devices->open_devices = 0;
2480 fs_devices->missing_devices = 0;
2481 fs_devices->rotating = false;
2482 list_add(&seed_devices->seed_list, &fs_devices->seed_list);
2484 generate_random_uuid(fs_devices->fsid);
2485 memcpy(fs_devices->metadata_uuid, fs_devices->fsid, BTRFS_FSID_SIZE);
2486 memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2488 super_flags = btrfs_super_flags(disk_super) &
2489 ~BTRFS_SUPER_FLAG_SEEDING;
2490 btrfs_set_super_flags(disk_super, super_flags);
2494 * Store the expected generation for seed devices in device items.
2496 static int btrfs_finish_sprout(struct btrfs_trans_handle *trans)
2498 BTRFS_DEV_LOOKUP_ARGS(args);
2499 struct btrfs_fs_info *fs_info = trans->fs_info;
2500 struct btrfs_root *root = fs_info->chunk_root;
2501 struct btrfs_path *path;
2502 struct extent_buffer *leaf;
2503 struct btrfs_dev_item *dev_item;
2504 struct btrfs_device *device;
2505 struct btrfs_key key;
2506 u8 fs_uuid[BTRFS_FSID_SIZE];
2507 u8 dev_uuid[BTRFS_UUID_SIZE];
2510 path = btrfs_alloc_path();
2514 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2516 key.type = BTRFS_DEV_ITEM_KEY;
2519 btrfs_reserve_chunk_metadata(trans, false);
2520 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2521 btrfs_trans_release_chunk_metadata(trans);
2525 leaf = path->nodes[0];
2527 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
2528 ret = btrfs_next_leaf(root, path);
2533 leaf = path->nodes[0];
2534 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2535 btrfs_release_path(path);
2539 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2540 if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID ||
2541 key.type != BTRFS_DEV_ITEM_KEY)
2544 dev_item = btrfs_item_ptr(leaf, path->slots[0],
2545 struct btrfs_dev_item);
2546 args.devid = btrfs_device_id(leaf, dev_item);
2547 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
2549 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
2551 args.uuid = dev_uuid;
2552 args.fsid = fs_uuid;
2553 device = btrfs_find_device(fs_info->fs_devices, &args);
2554 BUG_ON(!device); /* Logic error */
2556 if (device->fs_devices->seeding) {
2557 btrfs_set_device_generation(leaf, dev_item,
2558 device->generation);
2559 btrfs_mark_buffer_dirty(trans, leaf);
2567 btrfs_free_path(path);
2571 int btrfs_init_new_device(struct btrfs_fs_info *fs_info, const char *device_path)
2573 struct btrfs_root *root = fs_info->dev_root;
2574 struct btrfs_trans_handle *trans;
2575 struct btrfs_device *device;
2576 struct bdev_handle *bdev_handle;
2577 struct super_block *sb = fs_info->sb;
2578 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2579 struct btrfs_fs_devices *seed_devices = NULL;
2580 u64 orig_super_total_bytes;
2581 u64 orig_super_num_devices;
2583 bool seeding_dev = false;
2584 bool locked = false;
2586 if (sb_rdonly(sb) && !fs_devices->seeding)
2589 bdev_handle = bdev_open_by_path(device_path, BLK_OPEN_WRITE,
2590 fs_info->bdev_holder, NULL);
2591 if (IS_ERR(bdev_handle))
2592 return PTR_ERR(bdev_handle);
2594 if (!btrfs_check_device_zone_type(fs_info, bdev_handle->bdev)) {
2599 if (fs_devices->seeding) {
2601 down_write(&sb->s_umount);
2602 mutex_lock(&uuid_mutex);
2606 sync_blockdev(bdev_handle->bdev);
2609 list_for_each_entry_rcu(device, &fs_devices->devices, dev_list) {
2610 if (device->bdev == bdev_handle->bdev) {
2618 device = btrfs_alloc_device(fs_info, NULL, NULL, device_path);
2619 if (IS_ERR(device)) {
2620 /* we can safely leave the fs_devices entry around */
2621 ret = PTR_ERR(device);
2625 device->fs_info = fs_info;
2626 device->bdev_handle = bdev_handle;
2627 device->bdev = bdev_handle->bdev;
2628 ret = lookup_bdev(device_path, &device->devt);
2630 goto error_free_device;
2632 ret = btrfs_get_dev_zone_info(device, false);
2634 goto error_free_device;
2636 trans = btrfs_start_transaction(root, 0);
2637 if (IS_ERR(trans)) {
2638 ret = PTR_ERR(trans);
2639 goto error_free_zone;
2642 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
2643 device->generation = trans->transid;
2644 device->io_width = fs_info->sectorsize;
2645 device->io_align = fs_info->sectorsize;
2646 device->sector_size = fs_info->sectorsize;
2647 device->total_bytes =
2648 round_down(bdev_nr_bytes(device->bdev), fs_info->sectorsize);
2649 device->disk_total_bytes = device->total_bytes;
2650 device->commit_total_bytes = device->total_bytes;
2651 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2652 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
2653 device->dev_stats_valid = 1;
2654 set_blocksize(device->bdev, BTRFS_BDEV_BLOCKSIZE);
2657 btrfs_clear_sb_rdonly(sb);
2659 /* GFP_KERNEL allocation must not be under device_list_mutex */
2660 seed_devices = btrfs_init_sprout(fs_info);
2661 if (IS_ERR(seed_devices)) {
2662 ret = PTR_ERR(seed_devices);
2663 btrfs_abort_transaction(trans, ret);
2668 mutex_lock(&fs_devices->device_list_mutex);
2670 btrfs_setup_sprout(fs_info, seed_devices);
2671 btrfs_assign_next_active_device(fs_info->fs_devices->latest_dev,
2675 device->fs_devices = fs_devices;
2677 mutex_lock(&fs_info->chunk_mutex);
2678 list_add_rcu(&device->dev_list, &fs_devices->devices);
2679 list_add(&device->dev_alloc_list, &fs_devices->alloc_list);
2680 fs_devices->num_devices++;
2681 fs_devices->open_devices++;
2682 fs_devices->rw_devices++;
2683 fs_devices->total_devices++;
2684 fs_devices->total_rw_bytes += device->total_bytes;
2686 atomic64_add(device->total_bytes, &fs_info->free_chunk_space);
2688 if (!bdev_nonrot(device->bdev))
2689 fs_devices->rotating = true;
2691 orig_super_total_bytes = btrfs_super_total_bytes(fs_info->super_copy);
2692 btrfs_set_super_total_bytes(fs_info->super_copy,
2693 round_down(orig_super_total_bytes + device->total_bytes,
2694 fs_info->sectorsize));
2696 orig_super_num_devices = btrfs_super_num_devices(fs_info->super_copy);
2697 btrfs_set_super_num_devices(fs_info->super_copy,
2698 orig_super_num_devices + 1);
2701 * we've got more storage, clear any full flags on the space
2704 btrfs_clear_space_info_full(fs_info);
2706 mutex_unlock(&fs_info->chunk_mutex);
2708 /* Add sysfs device entry */
2709 btrfs_sysfs_add_device(device);
2711 mutex_unlock(&fs_devices->device_list_mutex);
2714 mutex_lock(&fs_info->chunk_mutex);
2715 ret = init_first_rw_device(trans);
2716 mutex_unlock(&fs_info->chunk_mutex);
2718 btrfs_abort_transaction(trans, ret);
2723 ret = btrfs_add_dev_item(trans, device);
2725 btrfs_abort_transaction(trans, ret);
2730 ret = btrfs_finish_sprout(trans);
2732 btrfs_abort_transaction(trans, ret);
2737 * fs_devices now represents the newly sprouted filesystem and
2738 * its fsid has been changed by btrfs_sprout_splice().
2740 btrfs_sysfs_update_sprout_fsid(fs_devices);
2743 ret = btrfs_commit_transaction(trans);
2746 mutex_unlock(&uuid_mutex);
2747 up_write(&sb->s_umount);
2750 if (ret) /* transaction commit */
2753 ret = btrfs_relocate_sys_chunks(fs_info);
2755 btrfs_handle_fs_error(fs_info, ret,
2756 "Failed to relocate sys chunks after device initialization. This can be fixed using the \"btrfs balance\" command.");
2757 trans = btrfs_attach_transaction(root);
2758 if (IS_ERR(trans)) {
2759 if (PTR_ERR(trans) == -ENOENT)
2761 ret = PTR_ERR(trans);
2765 ret = btrfs_commit_transaction(trans);
2769 * Now that we have written a new super block to this device, check all
2770 * other fs_devices list if device_path alienates any other scanned
2772 * We can ignore the return value as it typically returns -EINVAL and
2773 * only succeeds if the device was an alien.
2775 btrfs_forget_devices(device->devt);
2777 /* Update ctime/mtime for blkid or udev */
2778 update_dev_time(device_path);
2783 btrfs_sysfs_remove_device(device);
2784 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2785 mutex_lock(&fs_info->chunk_mutex);
2786 list_del_rcu(&device->dev_list);
2787 list_del(&device->dev_alloc_list);
2788 fs_info->fs_devices->num_devices--;
2789 fs_info->fs_devices->open_devices--;
2790 fs_info->fs_devices->rw_devices--;
2791 fs_info->fs_devices->total_devices--;
2792 fs_info->fs_devices->total_rw_bytes -= device->total_bytes;
2793 atomic64_sub(device->total_bytes, &fs_info->free_chunk_space);
2794 btrfs_set_super_total_bytes(fs_info->super_copy,
2795 orig_super_total_bytes);
2796 btrfs_set_super_num_devices(fs_info->super_copy,
2797 orig_super_num_devices);
2798 mutex_unlock(&fs_info->chunk_mutex);
2799 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2802 btrfs_set_sb_rdonly(sb);
2804 btrfs_end_transaction(trans);
2806 btrfs_destroy_dev_zone_info(device);
2808 btrfs_free_device(device);
2810 bdev_release(bdev_handle);
2812 mutex_unlock(&uuid_mutex);
2813 up_write(&sb->s_umount);
2818 static noinline int btrfs_update_device(struct btrfs_trans_handle *trans,
2819 struct btrfs_device *device)
2822 struct btrfs_path *path;
2823 struct btrfs_root *root = device->fs_info->chunk_root;
2824 struct btrfs_dev_item *dev_item;
2825 struct extent_buffer *leaf;
2826 struct btrfs_key key;
2828 path = btrfs_alloc_path();
2832 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2833 key.type = BTRFS_DEV_ITEM_KEY;
2834 key.offset = device->devid;
2836 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2845 leaf = path->nodes[0];
2846 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
2848 btrfs_set_device_id(leaf, dev_item, device->devid);
2849 btrfs_set_device_type(leaf, dev_item, device->type);
2850 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
2851 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
2852 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
2853 btrfs_set_device_total_bytes(leaf, dev_item,
2854 btrfs_device_get_disk_total_bytes(device));
2855 btrfs_set_device_bytes_used(leaf, dev_item,
2856 btrfs_device_get_bytes_used(device));
2857 btrfs_mark_buffer_dirty(trans, leaf);
2860 btrfs_free_path(path);
2864 int btrfs_grow_device(struct btrfs_trans_handle *trans,
2865 struct btrfs_device *device, u64 new_size)
2867 struct btrfs_fs_info *fs_info = device->fs_info;
2868 struct btrfs_super_block *super_copy = fs_info->super_copy;
2873 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
2876 new_size = round_down(new_size, fs_info->sectorsize);
2878 mutex_lock(&fs_info->chunk_mutex);
2879 old_total = btrfs_super_total_bytes(super_copy);
2880 diff = round_down(new_size - device->total_bytes, fs_info->sectorsize);
2882 if (new_size <= device->total_bytes ||
2883 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
2884 mutex_unlock(&fs_info->chunk_mutex);
2888 btrfs_set_super_total_bytes(super_copy,
2889 round_down(old_total + diff, fs_info->sectorsize));
2890 device->fs_devices->total_rw_bytes += diff;
2891 atomic64_add(diff, &fs_info->free_chunk_space);
2893 btrfs_device_set_total_bytes(device, new_size);
2894 btrfs_device_set_disk_total_bytes(device, new_size);
2895 btrfs_clear_space_info_full(device->fs_info);
2896 if (list_empty(&device->post_commit_list))
2897 list_add_tail(&device->post_commit_list,
2898 &trans->transaction->dev_update_list);
2899 mutex_unlock(&fs_info->chunk_mutex);
2901 btrfs_reserve_chunk_metadata(trans, false);
2902 ret = btrfs_update_device(trans, device);
2903 btrfs_trans_release_chunk_metadata(trans);
2908 static int btrfs_free_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset)
2910 struct btrfs_fs_info *fs_info = trans->fs_info;
2911 struct btrfs_root *root = fs_info->chunk_root;
2913 struct btrfs_path *path;
2914 struct btrfs_key key;
2916 path = btrfs_alloc_path();
2920 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2921 key.offset = chunk_offset;
2922 key.type = BTRFS_CHUNK_ITEM_KEY;
2924 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2927 else if (ret > 0) { /* Logic error or corruption */
2928 btrfs_handle_fs_error(fs_info, -ENOENT,
2929 "Failed lookup while freeing chunk.");
2934 ret = btrfs_del_item(trans, root, path);
2936 btrfs_handle_fs_error(fs_info, ret,
2937 "Failed to delete chunk item.");
2939 btrfs_free_path(path);
2943 static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
2945 struct btrfs_super_block *super_copy = fs_info->super_copy;
2946 struct btrfs_disk_key *disk_key;
2947 struct btrfs_chunk *chunk;
2954 struct btrfs_key key;
2956 lockdep_assert_held(&fs_info->chunk_mutex);
2957 array_size = btrfs_super_sys_array_size(super_copy);
2959 ptr = super_copy->sys_chunk_array;
2962 while (cur < array_size) {
2963 disk_key = (struct btrfs_disk_key *)ptr;
2964 btrfs_disk_key_to_cpu(&key, disk_key);
2966 len = sizeof(*disk_key);
2968 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
2969 chunk = (struct btrfs_chunk *)(ptr + len);
2970 num_stripes = btrfs_stack_chunk_num_stripes(chunk);
2971 len += btrfs_chunk_item_size(num_stripes);
2976 if (key.objectid == BTRFS_FIRST_CHUNK_TREE_OBJECTID &&
2977 key.offset == chunk_offset) {
2978 memmove(ptr, ptr + len, array_size - (cur + len));
2980 btrfs_set_super_sys_array_size(super_copy, array_size);
2990 * Find the mapping containing the given logical extent.
2992 * @logical: Logical block offset in bytes.
2993 * @length: Length of extent in bytes.
2995 * Return: Chunk mapping or ERR_PTR.
2997 struct extent_map *btrfs_get_chunk_map(struct btrfs_fs_info *fs_info,
2998 u64 logical, u64 length)
3000 struct extent_map_tree *em_tree;
3001 struct extent_map *em;
3003 em_tree = &fs_info->mapping_tree;
3004 read_lock(&em_tree->lock);
3005 em = lookup_extent_mapping(em_tree, logical, length);
3006 read_unlock(&em_tree->lock);
3009 btrfs_crit(fs_info, "unable to find logical %llu length %llu",
3011 return ERR_PTR(-EINVAL);
3014 if (em->start > logical || em->start + em->len < logical) {
3016 "found a bad mapping, wanted %llu-%llu, found %llu-%llu",
3017 logical, length, em->start, em->start + em->len);
3018 free_extent_map(em);
3019 return ERR_PTR(-EINVAL);
3022 /* callers are responsible for dropping em's ref. */
3026 static int remove_chunk_item(struct btrfs_trans_handle *trans,
3027 struct map_lookup *map, u64 chunk_offset)
3032 * Removing chunk items and updating the device items in the chunks btree
3033 * requires holding the chunk_mutex.
3034 * See the comment at btrfs_chunk_alloc() for the details.
3036 lockdep_assert_held(&trans->fs_info->chunk_mutex);
3038 for (i = 0; i < map->num_stripes; i++) {
3041 ret = btrfs_update_device(trans, map->stripes[i].dev);
3046 return btrfs_free_chunk(trans, chunk_offset);
3049 int btrfs_remove_chunk(struct btrfs_trans_handle *trans, u64 chunk_offset)
3051 struct btrfs_fs_info *fs_info = trans->fs_info;
3052 struct extent_map *em;
3053 struct map_lookup *map;
3054 u64 dev_extent_len = 0;
3056 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
3058 em = btrfs_get_chunk_map(fs_info, chunk_offset, 1);
3061 * This is a logic error, but we don't want to just rely on the
3062 * user having built with ASSERT enabled, so if ASSERT doesn't
3063 * do anything we still error out.
3068 map = em->map_lookup;
3071 * First delete the device extent items from the devices btree.
3072 * We take the device_list_mutex to avoid racing with the finishing phase
3073 * of a device replace operation. See the comment below before acquiring
3074 * fs_info->chunk_mutex. Note that here we do not acquire the chunk_mutex
3075 * because that can result in a deadlock when deleting the device extent
3076 * items from the devices btree - COWing an extent buffer from the btree
3077 * may result in allocating a new metadata chunk, which would attempt to
3078 * lock again fs_info->chunk_mutex.
3080 mutex_lock(&fs_devices->device_list_mutex);
3081 for (i = 0; i < map->num_stripes; i++) {
3082 struct btrfs_device *device = map->stripes[i].dev;
3083 ret = btrfs_free_dev_extent(trans, device,
3084 map->stripes[i].physical,
3087 mutex_unlock(&fs_devices->device_list_mutex);
3088 btrfs_abort_transaction(trans, ret);
3092 if (device->bytes_used > 0) {
3093 mutex_lock(&fs_info->chunk_mutex);
3094 btrfs_device_set_bytes_used(device,
3095 device->bytes_used - dev_extent_len);
3096 atomic64_add(dev_extent_len, &fs_info->free_chunk_space);
3097 btrfs_clear_space_info_full(fs_info);
3098 mutex_unlock(&fs_info->chunk_mutex);
3101 mutex_unlock(&fs_devices->device_list_mutex);
3104 * We acquire fs_info->chunk_mutex for 2 reasons:
3106 * 1) Just like with the first phase of the chunk allocation, we must
3107 * reserve system space, do all chunk btree updates and deletions, and
3108 * update the system chunk array in the superblock while holding this
3109 * mutex. This is for similar reasons as explained on the comment at
3110 * the top of btrfs_chunk_alloc();
3112 * 2) Prevent races with the final phase of a device replace operation
3113 * that replaces the device object associated with the map's stripes,
3114 * because the device object's id can change at any time during that
3115 * final phase of the device replace operation
3116 * (dev-replace.c:btrfs_dev_replace_finishing()), so we could grab the
3117 * replaced device and then see it with an ID of
3118 * BTRFS_DEV_REPLACE_DEVID, which would cause a failure when updating
3119 * the device item, which does not exists on the chunk btree.
3120 * The finishing phase of device replace acquires both the
3121 * device_list_mutex and the chunk_mutex, in that order, so we are
3122 * safe by just acquiring the chunk_mutex.
3124 trans->removing_chunk = true;
3125 mutex_lock(&fs_info->chunk_mutex);
3127 check_system_chunk(trans, map->type);
3129 ret = remove_chunk_item(trans, map, chunk_offset);
3131 * Normally we should not get -ENOSPC since we reserved space before
3132 * through the call to check_system_chunk().
3134 * Despite our system space_info having enough free space, we may not
3135 * be able to allocate extents from its block groups, because all have
3136 * an incompatible profile, which will force us to allocate a new system
3137 * block group with the right profile, or right after we called
3138 * check_system_space() above, a scrub turned the only system block group
3139 * with enough free space into RO mode.
3140 * This is explained with more detail at do_chunk_alloc().
3142 * So if we get -ENOSPC, allocate a new system chunk and retry once.
3144 if (ret == -ENOSPC) {
3145 const u64 sys_flags = btrfs_system_alloc_profile(fs_info);
3146 struct btrfs_block_group *sys_bg;
3148 sys_bg = btrfs_create_chunk(trans, sys_flags);
3149 if (IS_ERR(sys_bg)) {
3150 ret = PTR_ERR(sys_bg);
3151 btrfs_abort_transaction(trans, ret);
3155 ret = btrfs_chunk_alloc_add_chunk_item(trans, sys_bg);
3157 btrfs_abort_transaction(trans, ret);
3161 ret = remove_chunk_item(trans, map, chunk_offset);
3163 btrfs_abort_transaction(trans, ret);
3167 btrfs_abort_transaction(trans, ret);
3171 trace_btrfs_chunk_free(fs_info, map, chunk_offset, em->len);
3173 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
3174 ret = btrfs_del_sys_chunk(fs_info, chunk_offset);
3176 btrfs_abort_transaction(trans, ret);
3181 mutex_unlock(&fs_info->chunk_mutex);
3182 trans->removing_chunk = false;
3185 * We are done with chunk btree updates and deletions, so release the
3186 * system space we previously reserved (with check_system_chunk()).
3188 btrfs_trans_release_chunk_metadata(trans);
3190 ret = btrfs_remove_block_group(trans, chunk_offset, em);
3192 btrfs_abort_transaction(trans, ret);
3197 if (trans->removing_chunk) {
3198 mutex_unlock(&fs_info->chunk_mutex);
3199 trans->removing_chunk = false;
3202 free_extent_map(em);
3206 int btrfs_relocate_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
3208 struct btrfs_root *root = fs_info->chunk_root;
3209 struct btrfs_trans_handle *trans;
3210 struct btrfs_block_group *block_group;
3214 if (btrfs_fs_incompat(fs_info, EXTENT_TREE_V2)) {
3216 "relocate: not supported on extent tree v2 yet");
3221 * Prevent races with automatic removal of unused block groups.
3222 * After we relocate and before we remove the chunk with offset
3223 * chunk_offset, automatic removal of the block group can kick in,
3224 * resulting in a failure when calling btrfs_remove_chunk() below.
3226 * Make sure to acquire this mutex before doing a tree search (dev
3227 * or chunk trees) to find chunks. Otherwise the cleaner kthread might
3228 * call btrfs_remove_chunk() (through btrfs_delete_unused_bgs()) after
3229 * we release the path used to search the chunk/dev tree and before
3230 * the current task acquires this mutex and calls us.
3232 lockdep_assert_held(&fs_info->reclaim_bgs_lock);
3234 /* step one, relocate all the extents inside this chunk */
3235 btrfs_scrub_pause(fs_info);
3236 ret = btrfs_relocate_block_group(fs_info, chunk_offset);
3237 btrfs_scrub_continue(fs_info);
3240 * If we had a transaction abort, stop all running scrubs.
3241 * See transaction.c:cleanup_transaction() why we do it here.
3243 if (BTRFS_FS_ERROR(fs_info))
3244 btrfs_scrub_cancel(fs_info);
3248 block_group = btrfs_lookup_block_group(fs_info, chunk_offset);
3251 btrfs_discard_cancel_work(&fs_info->discard_ctl, block_group);
3252 length = block_group->length;
3253 btrfs_put_block_group(block_group);
3256 * On a zoned file system, discard the whole block group, this will
3257 * trigger a REQ_OP_ZONE_RESET operation on the device zone. If
3258 * resetting the zone fails, don't treat it as a fatal problem from the
3259 * filesystem's point of view.
3261 if (btrfs_is_zoned(fs_info)) {
3262 ret = btrfs_discard_extent(fs_info, chunk_offset, length, NULL);
3265 "failed to reset zone %llu after relocation",
3269 trans = btrfs_start_trans_remove_block_group(root->fs_info,
3271 if (IS_ERR(trans)) {
3272 ret = PTR_ERR(trans);
3273 btrfs_handle_fs_error(root->fs_info, ret, NULL);
3278 * step two, delete the device extents and the
3279 * chunk tree entries
3281 ret = btrfs_remove_chunk(trans, chunk_offset);
3282 btrfs_end_transaction(trans);
3286 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info)
3288 struct btrfs_root *chunk_root = fs_info->chunk_root;
3289 struct btrfs_path *path;
3290 struct extent_buffer *leaf;
3291 struct btrfs_chunk *chunk;
3292 struct btrfs_key key;
3293 struct btrfs_key found_key;
3295 bool retried = false;
3299 path = btrfs_alloc_path();
3304 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3305 key.offset = (u64)-1;
3306 key.type = BTRFS_CHUNK_ITEM_KEY;
3309 mutex_lock(&fs_info->reclaim_bgs_lock);
3310 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3312 mutex_unlock(&fs_info->reclaim_bgs_lock);
3315 BUG_ON(ret == 0); /* Corruption */
3317 ret = btrfs_previous_item(chunk_root, path, key.objectid,
3320 mutex_unlock(&fs_info->reclaim_bgs_lock);
3326 leaf = path->nodes[0];
3327 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3329 chunk = btrfs_item_ptr(leaf, path->slots[0],
3330 struct btrfs_chunk);
3331 chunk_type = btrfs_chunk_type(leaf, chunk);
3332 btrfs_release_path(path);
3334 if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) {
3335 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3341 mutex_unlock(&fs_info->reclaim_bgs_lock);
3343 if (found_key.offset == 0)
3345 key.offset = found_key.offset - 1;
3348 if (failed && !retried) {
3352 } else if (WARN_ON(failed && retried)) {
3356 btrfs_free_path(path);
3361 * return 1 : allocate a data chunk successfully,
3362 * return <0: errors during allocating a data chunk,
3363 * return 0 : no need to allocate a data chunk.
3365 static int btrfs_may_alloc_data_chunk(struct btrfs_fs_info *fs_info,
3368 struct btrfs_block_group *cache;
3372 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3374 chunk_type = cache->flags;
3375 btrfs_put_block_group(cache);
3377 if (!(chunk_type & BTRFS_BLOCK_GROUP_DATA))
3380 spin_lock(&fs_info->data_sinfo->lock);
3381 bytes_used = fs_info->data_sinfo->bytes_used;
3382 spin_unlock(&fs_info->data_sinfo->lock);
3385 struct btrfs_trans_handle *trans;
3388 trans = btrfs_join_transaction(fs_info->tree_root);
3390 return PTR_ERR(trans);
3392 ret = btrfs_force_chunk_alloc(trans, BTRFS_BLOCK_GROUP_DATA);
3393 btrfs_end_transaction(trans);
3402 static int insert_balance_item(struct btrfs_fs_info *fs_info,
3403 struct btrfs_balance_control *bctl)
3405 struct btrfs_root *root = fs_info->tree_root;
3406 struct btrfs_trans_handle *trans;
3407 struct btrfs_balance_item *item;
3408 struct btrfs_disk_balance_args disk_bargs;
3409 struct btrfs_path *path;
3410 struct extent_buffer *leaf;
3411 struct btrfs_key key;
3414 path = btrfs_alloc_path();
3418 trans = btrfs_start_transaction(root, 0);
3419 if (IS_ERR(trans)) {
3420 btrfs_free_path(path);
3421 return PTR_ERR(trans);
3424 key.objectid = BTRFS_BALANCE_OBJECTID;
3425 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3428 ret = btrfs_insert_empty_item(trans, root, path, &key,
3433 leaf = path->nodes[0];
3434 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
3436 memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item));
3438 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->data);
3439 btrfs_set_balance_data(leaf, item, &disk_bargs);
3440 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->meta);
3441 btrfs_set_balance_meta(leaf, item, &disk_bargs);
3442 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->sys);
3443 btrfs_set_balance_sys(leaf, item, &disk_bargs);
3445 btrfs_set_balance_flags(leaf, item, bctl->flags);
3447 btrfs_mark_buffer_dirty(trans, leaf);
3449 btrfs_free_path(path);
3450 err = btrfs_commit_transaction(trans);
3456 static int del_balance_item(struct btrfs_fs_info *fs_info)
3458 struct btrfs_root *root = fs_info->tree_root;
3459 struct btrfs_trans_handle *trans;
3460 struct btrfs_path *path;
3461 struct btrfs_key key;
3464 path = btrfs_alloc_path();
3468 trans = btrfs_start_transaction_fallback_global_rsv(root, 0);
3469 if (IS_ERR(trans)) {
3470 btrfs_free_path(path);
3471 return PTR_ERR(trans);
3474 key.objectid = BTRFS_BALANCE_OBJECTID;
3475 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3478 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3486 ret = btrfs_del_item(trans, root, path);
3488 btrfs_free_path(path);
3489 err = btrfs_commit_transaction(trans);
3496 * This is a heuristic used to reduce the number of chunks balanced on
3497 * resume after balance was interrupted.
3499 static void update_balance_args(struct btrfs_balance_control *bctl)
3502 * Turn on soft mode for chunk types that were being converted.
3504 if (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)
3505 bctl->data.flags |= BTRFS_BALANCE_ARGS_SOFT;
3506 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)
3507 bctl->sys.flags |= BTRFS_BALANCE_ARGS_SOFT;
3508 if (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)
3509 bctl->meta.flags |= BTRFS_BALANCE_ARGS_SOFT;
3512 * Turn on usage filter if is not already used. The idea is
3513 * that chunks that we have already balanced should be
3514 * reasonably full. Don't do it for chunks that are being
3515 * converted - that will keep us from relocating unconverted
3516 * (albeit full) chunks.
3518 if (!(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3519 !(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3520 !(bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3521 bctl->data.flags |= BTRFS_BALANCE_ARGS_USAGE;
3522 bctl->data.usage = 90;
3524 if (!(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3525 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3526 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3527 bctl->sys.flags |= BTRFS_BALANCE_ARGS_USAGE;
3528 bctl->sys.usage = 90;
3530 if (!(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3531 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3532 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3533 bctl->meta.flags |= BTRFS_BALANCE_ARGS_USAGE;
3534 bctl->meta.usage = 90;
3539 * Clear the balance status in fs_info and delete the balance item from disk.
3541 static void reset_balance_state(struct btrfs_fs_info *fs_info)
3543 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3546 BUG_ON(!fs_info->balance_ctl);
3548 spin_lock(&fs_info->balance_lock);
3549 fs_info->balance_ctl = NULL;
3550 spin_unlock(&fs_info->balance_lock);
3553 ret = del_balance_item(fs_info);
3555 btrfs_handle_fs_error(fs_info, ret, NULL);
3559 * Balance filters. Return 1 if chunk should be filtered out
3560 * (should not be balanced).
3562 static int chunk_profiles_filter(u64 chunk_type,
3563 struct btrfs_balance_args *bargs)
3565 chunk_type = chunk_to_extended(chunk_type) &
3566 BTRFS_EXTENDED_PROFILE_MASK;
3568 if (bargs->profiles & chunk_type)
3574 static int chunk_usage_range_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset,
3575 struct btrfs_balance_args *bargs)
3577 struct btrfs_block_group *cache;
3579 u64 user_thresh_min;
3580 u64 user_thresh_max;
3583 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3584 chunk_used = cache->used;
3586 if (bargs->usage_min == 0)
3587 user_thresh_min = 0;
3589 user_thresh_min = mult_perc(cache->length, bargs->usage_min);
3591 if (bargs->usage_max == 0)
3592 user_thresh_max = 1;
3593 else if (bargs->usage_max > 100)
3594 user_thresh_max = cache->length;
3596 user_thresh_max = mult_perc(cache->length, bargs->usage_max);
3598 if (user_thresh_min <= chunk_used && chunk_used < user_thresh_max)
3601 btrfs_put_block_group(cache);
3605 static int chunk_usage_filter(struct btrfs_fs_info *fs_info,
3606 u64 chunk_offset, struct btrfs_balance_args *bargs)
3608 struct btrfs_block_group *cache;
3609 u64 chunk_used, user_thresh;
3612 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3613 chunk_used = cache->used;
3615 if (bargs->usage_min == 0)
3617 else if (bargs->usage > 100)
3618 user_thresh = cache->length;
3620 user_thresh = mult_perc(cache->length, bargs->usage);
3622 if (chunk_used < user_thresh)
3625 btrfs_put_block_group(cache);
3629 static int chunk_devid_filter(struct extent_buffer *leaf,
3630 struct btrfs_chunk *chunk,
3631 struct btrfs_balance_args *bargs)
3633 struct btrfs_stripe *stripe;
3634 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3637 for (i = 0; i < num_stripes; i++) {
3638 stripe = btrfs_stripe_nr(chunk, i);
3639 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
3646 static u64 calc_data_stripes(u64 type, int num_stripes)
3648 const int index = btrfs_bg_flags_to_raid_index(type);
3649 const int ncopies = btrfs_raid_array[index].ncopies;
3650 const int nparity = btrfs_raid_array[index].nparity;
3652 return (num_stripes - nparity) / ncopies;
3655 /* [pstart, pend) */
3656 static int chunk_drange_filter(struct extent_buffer *leaf,
3657 struct btrfs_chunk *chunk,
3658 struct btrfs_balance_args *bargs)
3660 struct btrfs_stripe *stripe;
3661 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3668 if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID))
3671 type = btrfs_chunk_type(leaf, chunk);
3672 factor = calc_data_stripes(type, num_stripes);
3674 for (i = 0; i < num_stripes; i++) {
3675 stripe = btrfs_stripe_nr(chunk, i);
3676 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
3679 stripe_offset = btrfs_stripe_offset(leaf, stripe);
3680 stripe_length = btrfs_chunk_length(leaf, chunk);
3681 stripe_length = div_u64(stripe_length, factor);
3683 if (stripe_offset < bargs->pend &&
3684 stripe_offset + stripe_length > bargs->pstart)
3691 /* [vstart, vend) */
3692 static int chunk_vrange_filter(struct extent_buffer *leaf,
3693 struct btrfs_chunk *chunk,
3695 struct btrfs_balance_args *bargs)
3697 if (chunk_offset < bargs->vend &&
3698 chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart)
3699 /* at least part of the chunk is inside this vrange */
3705 static int chunk_stripes_range_filter(struct extent_buffer *leaf,
3706 struct btrfs_chunk *chunk,
3707 struct btrfs_balance_args *bargs)
3709 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3711 if (bargs->stripes_min <= num_stripes
3712 && num_stripes <= bargs->stripes_max)
3718 static int chunk_soft_convert_filter(u64 chunk_type,
3719 struct btrfs_balance_args *bargs)
3721 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
3724 chunk_type = chunk_to_extended(chunk_type) &
3725 BTRFS_EXTENDED_PROFILE_MASK;
3727 if (bargs->target == chunk_type)
3733 static int should_balance_chunk(struct extent_buffer *leaf,
3734 struct btrfs_chunk *chunk, u64 chunk_offset)
3736 struct btrfs_fs_info *fs_info = leaf->fs_info;
3737 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3738 struct btrfs_balance_args *bargs = NULL;
3739 u64 chunk_type = btrfs_chunk_type(leaf, chunk);
3742 if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) &
3743 (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) {
3747 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3748 bargs = &bctl->data;
3749 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3751 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3752 bargs = &bctl->meta;
3754 /* profiles filter */
3755 if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) &&
3756 chunk_profiles_filter(chunk_type, bargs)) {
3761 if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) &&
3762 chunk_usage_filter(fs_info, chunk_offset, bargs)) {
3764 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3765 chunk_usage_range_filter(fs_info, chunk_offset, bargs)) {
3770 if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) &&
3771 chunk_devid_filter(leaf, chunk, bargs)) {
3775 /* drange filter, makes sense only with devid filter */
3776 if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) &&
3777 chunk_drange_filter(leaf, chunk, bargs)) {
3782 if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) &&
3783 chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) {
3787 /* stripes filter */
3788 if ((bargs->flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE) &&
3789 chunk_stripes_range_filter(leaf, chunk, bargs)) {
3793 /* soft profile changing mode */
3794 if ((bargs->flags & BTRFS_BALANCE_ARGS_SOFT) &&
3795 chunk_soft_convert_filter(chunk_type, bargs)) {
3800 * limited by count, must be the last filter
3802 if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT)) {
3803 if (bargs->limit == 0)
3807 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)) {
3809 * Same logic as the 'limit' filter; the minimum cannot be
3810 * determined here because we do not have the global information
3811 * about the count of all chunks that satisfy the filters.
3813 if (bargs->limit_max == 0)
3822 static int __btrfs_balance(struct btrfs_fs_info *fs_info)
3824 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3825 struct btrfs_root *chunk_root = fs_info->chunk_root;
3827 struct btrfs_chunk *chunk;
3828 struct btrfs_path *path = NULL;
3829 struct btrfs_key key;
3830 struct btrfs_key found_key;
3831 struct extent_buffer *leaf;
3834 int enospc_errors = 0;
3835 bool counting = true;
3836 /* The single value limit and min/max limits use the same bytes in the */
3837 u64 limit_data = bctl->data.limit;
3838 u64 limit_meta = bctl->meta.limit;
3839 u64 limit_sys = bctl->sys.limit;
3843 int chunk_reserved = 0;
3845 path = btrfs_alloc_path();
3851 /* zero out stat counters */
3852 spin_lock(&fs_info->balance_lock);
3853 memset(&bctl->stat, 0, sizeof(bctl->stat));
3854 spin_unlock(&fs_info->balance_lock);
3858 * The single value limit and min/max limits use the same bytes
3861 bctl->data.limit = limit_data;
3862 bctl->meta.limit = limit_meta;
3863 bctl->sys.limit = limit_sys;
3865 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3866 key.offset = (u64)-1;
3867 key.type = BTRFS_CHUNK_ITEM_KEY;
3870 if ((!counting && atomic_read(&fs_info->balance_pause_req)) ||
3871 atomic_read(&fs_info->balance_cancel_req)) {
3876 mutex_lock(&fs_info->reclaim_bgs_lock);
3877 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3879 mutex_unlock(&fs_info->reclaim_bgs_lock);
3884 * this shouldn't happen, it means the last relocate
3888 BUG(); /* FIXME break ? */
3890 ret = btrfs_previous_item(chunk_root, path, 0,
3891 BTRFS_CHUNK_ITEM_KEY);
3893 mutex_unlock(&fs_info->reclaim_bgs_lock);
3898 leaf = path->nodes[0];
3899 slot = path->slots[0];
3900 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3902 if (found_key.objectid != key.objectid) {
3903 mutex_unlock(&fs_info->reclaim_bgs_lock);
3907 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
3908 chunk_type = btrfs_chunk_type(leaf, chunk);
3911 spin_lock(&fs_info->balance_lock);
3912 bctl->stat.considered++;
3913 spin_unlock(&fs_info->balance_lock);
3916 ret = should_balance_chunk(leaf, chunk, found_key.offset);
3918 btrfs_release_path(path);
3920 mutex_unlock(&fs_info->reclaim_bgs_lock);
3925 mutex_unlock(&fs_info->reclaim_bgs_lock);
3926 spin_lock(&fs_info->balance_lock);
3927 bctl->stat.expected++;
3928 spin_unlock(&fs_info->balance_lock);
3930 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3932 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3934 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3941 * Apply limit_min filter, no need to check if the LIMITS
3942 * filter is used, limit_min is 0 by default
3944 if (((chunk_type & BTRFS_BLOCK_GROUP_DATA) &&
3945 count_data < bctl->data.limit_min)
3946 || ((chunk_type & BTRFS_BLOCK_GROUP_METADATA) &&
3947 count_meta < bctl->meta.limit_min)
3948 || ((chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) &&
3949 count_sys < bctl->sys.limit_min)) {
3950 mutex_unlock(&fs_info->reclaim_bgs_lock);
3954 if (!chunk_reserved) {
3956 * We may be relocating the only data chunk we have,
3957 * which could potentially end up with losing data's
3958 * raid profile, so lets allocate an empty one in
3961 ret = btrfs_may_alloc_data_chunk(fs_info,
3964 mutex_unlock(&fs_info->reclaim_bgs_lock);
3966 } else if (ret == 1) {
3971 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3972 mutex_unlock(&fs_info->reclaim_bgs_lock);
3973 if (ret == -ENOSPC) {
3975 } else if (ret == -ETXTBSY) {
3977 "skipping relocation of block group %llu due to active swapfile",
3983 spin_lock(&fs_info->balance_lock);
3984 bctl->stat.completed++;
3985 spin_unlock(&fs_info->balance_lock);
3988 if (found_key.offset == 0)
3990 key.offset = found_key.offset - 1;
3994 btrfs_release_path(path);
3999 btrfs_free_path(path);
4000 if (enospc_errors) {
4001 btrfs_info(fs_info, "%d enospc errors during balance",
4011 * See if a given profile is valid and reduced.
4013 * @flags: profile to validate
4014 * @extended: if true @flags is treated as an extended profile
4016 static int alloc_profile_is_valid(u64 flags, int extended)
4018 u64 mask = (extended ? BTRFS_EXTENDED_PROFILE_MASK :
4019 BTRFS_BLOCK_GROUP_PROFILE_MASK);
4021 flags &= ~BTRFS_BLOCK_GROUP_TYPE_MASK;
4023 /* 1) check that all other bits are zeroed */
4027 /* 2) see if profile is reduced */
4029 return !extended; /* "0" is valid for usual profiles */
4031 return has_single_bit_set(flags);
4035 * Validate target profile against allowed profiles and return true if it's OK.
4036 * Otherwise print the error message and return false.
4038 static inline int validate_convert_profile(struct btrfs_fs_info *fs_info,
4039 const struct btrfs_balance_args *bargs,
4040 u64 allowed, const char *type)
4042 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
4045 /* Profile is valid and does not have bits outside of the allowed set */
4046 if (alloc_profile_is_valid(bargs->target, 1) &&
4047 (bargs->target & ~allowed) == 0)
4050 btrfs_err(fs_info, "balance: invalid convert %s profile %s",
4051 type, btrfs_bg_type_to_raid_name(bargs->target));
4056 * Fill @buf with textual description of balance filter flags @bargs, up to
4057 * @size_buf including the terminating null. The output may be trimmed if it
4058 * does not fit into the provided buffer.
4060 static void describe_balance_args(struct btrfs_balance_args *bargs, char *buf,
4064 u32 size_bp = size_buf;
4066 u64 flags = bargs->flags;
4067 char tmp_buf[128] = {'\0'};
4072 #define CHECK_APPEND_NOARG(a) \
4074 ret = snprintf(bp, size_bp, (a)); \
4075 if (ret < 0 || ret >= size_bp) \
4076 goto out_overflow; \
4081 #define CHECK_APPEND_1ARG(a, v1) \
4083 ret = snprintf(bp, size_bp, (a), (v1)); \
4084 if (ret < 0 || ret >= size_bp) \
4085 goto out_overflow; \
4090 #define CHECK_APPEND_2ARG(a, v1, v2) \
4092 ret = snprintf(bp, size_bp, (a), (v1), (v2)); \
4093 if (ret < 0 || ret >= size_bp) \
4094 goto out_overflow; \
4099 if (flags & BTRFS_BALANCE_ARGS_CONVERT)
4100 CHECK_APPEND_1ARG("convert=%s,",
4101 btrfs_bg_type_to_raid_name(bargs->target));
4103 if (flags & BTRFS_BALANCE_ARGS_SOFT)
4104 CHECK_APPEND_NOARG("soft,");
4106 if (flags & BTRFS_BALANCE_ARGS_PROFILES) {
4107 btrfs_describe_block_groups(bargs->profiles, tmp_buf,
4109 CHECK_APPEND_1ARG("profiles=%s,", tmp_buf);
4112 if (flags & BTRFS_BALANCE_ARGS_USAGE)
4113 CHECK_APPEND_1ARG("usage=%llu,", bargs->usage);
4115 if (flags & BTRFS_BALANCE_ARGS_USAGE_RANGE)
4116 CHECK_APPEND_2ARG("usage=%u..%u,",
4117 bargs->usage_min, bargs->usage_max);
4119 if (flags & BTRFS_BALANCE_ARGS_DEVID)
4120 CHECK_APPEND_1ARG("devid=%llu,", bargs->devid);
4122 if (flags & BTRFS_BALANCE_ARGS_DRANGE)
4123 CHECK_APPEND_2ARG("drange=%llu..%llu,",
4124 bargs->pstart, bargs->pend);
4126 if (flags & BTRFS_BALANCE_ARGS_VRANGE)
4127 CHECK_APPEND_2ARG("vrange=%llu..%llu,",
4128 bargs->vstart, bargs->vend);
4130 if (flags & BTRFS_BALANCE_ARGS_LIMIT)
4131 CHECK_APPEND_1ARG("limit=%llu,", bargs->limit);
4133 if (flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)
4134 CHECK_APPEND_2ARG("limit=%u..%u,",
4135 bargs->limit_min, bargs->limit_max);
4137 if (flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE)
4138 CHECK_APPEND_2ARG("stripes=%u..%u,",
4139 bargs->stripes_min, bargs->stripes_max);
4141 #undef CHECK_APPEND_2ARG
4142 #undef CHECK_APPEND_1ARG
4143 #undef CHECK_APPEND_NOARG
4147 if (size_bp < size_buf)
4148 buf[size_buf - size_bp - 1] = '\0'; /* remove last , */
4153 static void describe_balance_start_or_resume(struct btrfs_fs_info *fs_info)
4155 u32 size_buf = 1024;
4156 char tmp_buf[192] = {'\0'};
4159 u32 size_bp = size_buf;
4161 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
4163 buf = kzalloc(size_buf, GFP_KERNEL);
4169 #define CHECK_APPEND_1ARG(a, v1) \
4171 ret = snprintf(bp, size_bp, (a), (v1)); \
4172 if (ret < 0 || ret >= size_bp) \
4173 goto out_overflow; \
4178 if (bctl->flags & BTRFS_BALANCE_FORCE)
4179 CHECK_APPEND_1ARG("%s", "-f ");
4181 if (bctl->flags & BTRFS_BALANCE_DATA) {
4182 describe_balance_args(&bctl->data, tmp_buf, sizeof(tmp_buf));
4183 CHECK_APPEND_1ARG("-d%s ", tmp_buf);
4186 if (bctl->flags & BTRFS_BALANCE_METADATA) {
4187 describe_balance_args(&bctl->meta, tmp_buf, sizeof(tmp_buf));
4188 CHECK_APPEND_1ARG("-m%s ", tmp_buf);
4191 if (bctl->flags & BTRFS_BALANCE_SYSTEM) {
4192 describe_balance_args(&bctl->sys, tmp_buf, sizeof(tmp_buf));
4193 CHECK_APPEND_1ARG("-s%s ", tmp_buf);
4196 #undef CHECK_APPEND_1ARG
4200 if (size_bp < size_buf)
4201 buf[size_buf - size_bp - 1] = '\0'; /* remove last " " */
4202 btrfs_info(fs_info, "balance: %s %s",
4203 (bctl->flags & BTRFS_BALANCE_RESUME) ?
4204 "resume" : "start", buf);
4210 * Should be called with balance mutexe held
4212 int btrfs_balance(struct btrfs_fs_info *fs_info,
4213 struct btrfs_balance_control *bctl,
4214 struct btrfs_ioctl_balance_args *bargs)
4216 u64 meta_target, data_target;
4222 bool reducing_redundancy;
4223 bool paused = false;
4226 if (btrfs_fs_closing(fs_info) ||
4227 atomic_read(&fs_info->balance_pause_req) ||
4228 btrfs_should_cancel_balance(fs_info)) {
4233 allowed = btrfs_super_incompat_flags(fs_info->super_copy);
4234 if (allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
4238 * In case of mixed groups both data and meta should be picked,
4239 * and identical options should be given for both of them.
4241 allowed = BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA;
4242 if (mixed && (bctl->flags & allowed)) {
4243 if (!(bctl->flags & BTRFS_BALANCE_DATA) ||
4244 !(bctl->flags & BTRFS_BALANCE_METADATA) ||
4245 memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) {
4247 "balance: mixed groups data and metadata options must be the same");
4254 * rw_devices will not change at the moment, device add/delete/replace
4257 num_devices = fs_info->fs_devices->rw_devices;
4260 * SINGLE profile on-disk has no profile bit, but in-memory we have a
4261 * special bit for it, to make it easier to distinguish. Thus we need
4262 * to set it manually, or balance would refuse the profile.
4264 allowed = BTRFS_AVAIL_ALLOC_BIT_SINGLE;
4265 for (i = 0; i < ARRAY_SIZE(btrfs_raid_array); i++)
4266 if (num_devices >= btrfs_raid_array[i].devs_min)
4267 allowed |= btrfs_raid_array[i].bg_flag;
4269 if (!validate_convert_profile(fs_info, &bctl->data, allowed, "data") ||
4270 !validate_convert_profile(fs_info, &bctl->meta, allowed, "metadata") ||
4271 !validate_convert_profile(fs_info, &bctl->sys, allowed, "system")) {
4277 * Allow to reduce metadata or system integrity only if force set for
4278 * profiles with redundancy (copies, parity)
4281 for (i = 0; i < ARRAY_SIZE(btrfs_raid_array); i++) {
4282 if (btrfs_raid_array[i].ncopies >= 2 ||
4283 btrfs_raid_array[i].tolerated_failures >= 1)
4284 allowed |= btrfs_raid_array[i].bg_flag;
4287 seq = read_seqbegin(&fs_info->profiles_lock);
4289 if (((bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
4290 (fs_info->avail_system_alloc_bits & allowed) &&
4291 !(bctl->sys.target & allowed)) ||
4292 ((bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
4293 (fs_info->avail_metadata_alloc_bits & allowed) &&
4294 !(bctl->meta.target & allowed)))
4295 reducing_redundancy = true;
4297 reducing_redundancy = false;
4299 /* if we're not converting, the target field is uninitialized */
4300 meta_target = (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
4301 bctl->meta.target : fs_info->avail_metadata_alloc_bits;
4302 data_target = (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
4303 bctl->data.target : fs_info->avail_data_alloc_bits;
4304 } while (read_seqretry(&fs_info->profiles_lock, seq));
4306 if (reducing_redundancy) {
4307 if (bctl->flags & BTRFS_BALANCE_FORCE) {
4309 "balance: force reducing metadata redundancy");
4312 "balance: reduces metadata redundancy, use --force if you want this");
4318 if (btrfs_get_num_tolerated_disk_barrier_failures(meta_target) <
4319 btrfs_get_num_tolerated_disk_barrier_failures(data_target)) {
4321 "balance: metadata profile %s has lower redundancy than data profile %s",
4322 btrfs_bg_type_to_raid_name(meta_target),
4323 btrfs_bg_type_to_raid_name(data_target));
4326 ret = insert_balance_item(fs_info, bctl);
4327 if (ret && ret != -EEXIST)
4330 if (!(bctl->flags & BTRFS_BALANCE_RESUME)) {
4331 BUG_ON(ret == -EEXIST);
4332 BUG_ON(fs_info->balance_ctl);
4333 spin_lock(&fs_info->balance_lock);
4334 fs_info->balance_ctl = bctl;
4335 spin_unlock(&fs_info->balance_lock);
4337 BUG_ON(ret != -EEXIST);
4338 spin_lock(&fs_info->balance_lock);
4339 update_balance_args(bctl);
4340 spin_unlock(&fs_info->balance_lock);
4343 ASSERT(!test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4344 set_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags);
4345 describe_balance_start_or_resume(fs_info);
4346 mutex_unlock(&fs_info->balance_mutex);
4348 ret = __btrfs_balance(fs_info);
4350 mutex_lock(&fs_info->balance_mutex);
4351 if (ret == -ECANCELED && atomic_read(&fs_info->balance_pause_req)) {
4352 btrfs_info(fs_info, "balance: paused");
4353 btrfs_exclop_balance(fs_info, BTRFS_EXCLOP_BALANCE_PAUSED);
4357 * Balance can be canceled by:
4359 * - Regular cancel request
4360 * Then ret == -ECANCELED and balance_cancel_req > 0
4362 * - Fatal signal to "btrfs" process
4363 * Either the signal caught by wait_reserve_ticket() and callers
4364 * got -EINTR, or caught by btrfs_should_cancel_balance() and
4366 * Either way, in this case balance_cancel_req = 0, and
4367 * ret == -EINTR or ret == -ECANCELED.
4369 * So here we only check the return value to catch canceled balance.
4371 else if (ret == -ECANCELED || ret == -EINTR)
4372 btrfs_info(fs_info, "balance: canceled");
4374 btrfs_info(fs_info, "balance: ended with status: %d", ret);
4376 clear_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags);
4379 memset(bargs, 0, sizeof(*bargs));
4380 btrfs_update_ioctl_balance_args(fs_info, bargs);
4383 /* We didn't pause, we can clean everything up. */
4385 reset_balance_state(fs_info);
4386 btrfs_exclop_finish(fs_info);
4389 wake_up(&fs_info->balance_wait_q);
4393 if (bctl->flags & BTRFS_BALANCE_RESUME)
4394 reset_balance_state(fs_info);
4397 btrfs_exclop_finish(fs_info);
4402 static int balance_kthread(void *data)
4404 struct btrfs_fs_info *fs_info = data;
4407 sb_start_write(fs_info->sb);
4408 mutex_lock(&fs_info->balance_mutex);
4409 if (fs_info->balance_ctl)
4410 ret = btrfs_balance(fs_info, fs_info->balance_ctl, NULL);
4411 mutex_unlock(&fs_info->balance_mutex);
4412 sb_end_write(fs_info->sb);
4417 int btrfs_resume_balance_async(struct btrfs_fs_info *fs_info)
4419 struct task_struct *tsk;
4421 mutex_lock(&fs_info->balance_mutex);
4422 if (!fs_info->balance_ctl) {
4423 mutex_unlock(&fs_info->balance_mutex);
4426 mutex_unlock(&fs_info->balance_mutex);
4428 if (btrfs_test_opt(fs_info, SKIP_BALANCE)) {
4429 btrfs_info(fs_info, "balance: resume skipped");
4433 spin_lock(&fs_info->super_lock);
4434 ASSERT(fs_info->exclusive_operation == BTRFS_EXCLOP_BALANCE_PAUSED);
4435 fs_info->exclusive_operation = BTRFS_EXCLOP_BALANCE;
4436 spin_unlock(&fs_info->super_lock);
4438 * A ro->rw remount sequence should continue with the paused balance
4439 * regardless of who pauses it, system or the user as of now, so set
4442 spin_lock(&fs_info->balance_lock);
4443 fs_info->balance_ctl->flags |= BTRFS_BALANCE_RESUME;
4444 spin_unlock(&fs_info->balance_lock);
4446 tsk = kthread_run(balance_kthread, fs_info, "btrfs-balance");
4447 return PTR_ERR_OR_ZERO(tsk);
4450 int btrfs_recover_balance(struct btrfs_fs_info *fs_info)
4452 struct btrfs_balance_control *bctl;
4453 struct btrfs_balance_item *item;
4454 struct btrfs_disk_balance_args disk_bargs;
4455 struct btrfs_path *path;
4456 struct extent_buffer *leaf;
4457 struct btrfs_key key;
4460 path = btrfs_alloc_path();
4464 key.objectid = BTRFS_BALANCE_OBJECTID;
4465 key.type = BTRFS_TEMPORARY_ITEM_KEY;
4468 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4471 if (ret > 0) { /* ret = -ENOENT; */
4476 bctl = kzalloc(sizeof(*bctl), GFP_NOFS);
4482 leaf = path->nodes[0];
4483 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
4485 bctl->flags = btrfs_balance_flags(leaf, item);
4486 bctl->flags |= BTRFS_BALANCE_RESUME;
4488 btrfs_balance_data(leaf, item, &disk_bargs);
4489 btrfs_disk_balance_args_to_cpu(&bctl->data, &disk_bargs);
4490 btrfs_balance_meta(leaf, item, &disk_bargs);
4491 btrfs_disk_balance_args_to_cpu(&bctl->meta, &disk_bargs);
4492 btrfs_balance_sys(leaf, item, &disk_bargs);
4493 btrfs_disk_balance_args_to_cpu(&bctl->sys, &disk_bargs);
4496 * This should never happen, as the paused balance state is recovered
4497 * during mount without any chance of other exclusive ops to collide.
4499 * This gives the exclusive op status to balance and keeps in paused
4500 * state until user intervention (cancel or umount). If the ownership
4501 * cannot be assigned, show a message but do not fail. The balance
4502 * is in a paused state and must have fs_info::balance_ctl properly
4505 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_BALANCE_PAUSED))
4507 "balance: cannot set exclusive op status, resume manually");
4509 btrfs_release_path(path);
4511 mutex_lock(&fs_info->balance_mutex);
4512 BUG_ON(fs_info->balance_ctl);
4513 spin_lock(&fs_info->balance_lock);
4514 fs_info->balance_ctl = bctl;
4515 spin_unlock(&fs_info->balance_lock);
4516 mutex_unlock(&fs_info->balance_mutex);
4518 btrfs_free_path(path);
4522 int btrfs_pause_balance(struct btrfs_fs_info *fs_info)
4526 mutex_lock(&fs_info->balance_mutex);
4527 if (!fs_info->balance_ctl) {
4528 mutex_unlock(&fs_info->balance_mutex);
4532 if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) {
4533 atomic_inc(&fs_info->balance_pause_req);
4534 mutex_unlock(&fs_info->balance_mutex);
4536 wait_event(fs_info->balance_wait_q,
4537 !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4539 mutex_lock(&fs_info->balance_mutex);
4540 /* we are good with balance_ctl ripped off from under us */
4541 BUG_ON(test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4542 atomic_dec(&fs_info->balance_pause_req);
4547 mutex_unlock(&fs_info->balance_mutex);
4551 int btrfs_cancel_balance(struct btrfs_fs_info *fs_info)
4553 mutex_lock(&fs_info->balance_mutex);
4554 if (!fs_info->balance_ctl) {
4555 mutex_unlock(&fs_info->balance_mutex);
4560 * A paused balance with the item stored on disk can be resumed at
4561 * mount time if the mount is read-write. Otherwise it's still paused
4562 * and we must not allow cancelling as it deletes the item.
4564 if (sb_rdonly(fs_info->sb)) {
4565 mutex_unlock(&fs_info->balance_mutex);
4569 atomic_inc(&fs_info->balance_cancel_req);
4571 * if we are running just wait and return, balance item is
4572 * deleted in btrfs_balance in this case
4574 if (test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags)) {
4575 mutex_unlock(&fs_info->balance_mutex);
4576 wait_event(fs_info->balance_wait_q,
4577 !test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4578 mutex_lock(&fs_info->balance_mutex);
4580 mutex_unlock(&fs_info->balance_mutex);
4582 * Lock released to allow other waiters to continue, we'll
4583 * reexamine the status again.
4585 mutex_lock(&fs_info->balance_mutex);
4587 if (fs_info->balance_ctl) {
4588 reset_balance_state(fs_info);
4589 btrfs_exclop_finish(fs_info);
4590 btrfs_info(fs_info, "balance: canceled");
4594 ASSERT(!test_bit(BTRFS_FS_BALANCE_RUNNING, &fs_info->flags));
4595 atomic_dec(&fs_info->balance_cancel_req);
4596 mutex_unlock(&fs_info->balance_mutex);
4600 int btrfs_uuid_scan_kthread(void *data)
4602 struct btrfs_fs_info *fs_info = data;
4603 struct btrfs_root *root = fs_info->tree_root;
4604 struct btrfs_key key;
4605 struct btrfs_path *path = NULL;
4607 struct extent_buffer *eb;
4609 struct btrfs_root_item root_item;
4611 struct btrfs_trans_handle *trans = NULL;
4612 bool closing = false;
4614 path = btrfs_alloc_path();
4621 key.type = BTRFS_ROOT_ITEM_KEY;
4625 if (btrfs_fs_closing(fs_info)) {
4629 ret = btrfs_search_forward(root, &key, path,
4630 BTRFS_OLDEST_GENERATION);
4637 if (key.type != BTRFS_ROOT_ITEM_KEY ||
4638 (key.objectid < BTRFS_FIRST_FREE_OBJECTID &&
4639 key.objectid != BTRFS_FS_TREE_OBJECTID) ||
4640 key.objectid > BTRFS_LAST_FREE_OBJECTID)
4643 eb = path->nodes[0];
4644 slot = path->slots[0];
4645 item_size = btrfs_item_size(eb, slot);
4646 if (item_size < sizeof(root_item))
4649 read_extent_buffer(eb, &root_item,
4650 btrfs_item_ptr_offset(eb, slot),
4651 (int)sizeof(root_item));
4652 if (btrfs_root_refs(&root_item) == 0)
4655 if (!btrfs_is_empty_uuid(root_item.uuid) ||
4656 !btrfs_is_empty_uuid(root_item.received_uuid)) {
4660 btrfs_release_path(path);
4662 * 1 - subvol uuid item
4663 * 1 - received_subvol uuid item
4665 trans = btrfs_start_transaction(fs_info->uuid_root, 2);
4666 if (IS_ERR(trans)) {
4667 ret = PTR_ERR(trans);
4675 btrfs_release_path(path);
4676 if (!btrfs_is_empty_uuid(root_item.uuid)) {
4677 ret = btrfs_uuid_tree_add(trans, root_item.uuid,
4678 BTRFS_UUID_KEY_SUBVOL,
4681 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4687 if (!btrfs_is_empty_uuid(root_item.received_uuid)) {
4688 ret = btrfs_uuid_tree_add(trans,
4689 root_item.received_uuid,
4690 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4693 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4700 btrfs_release_path(path);
4702 ret = btrfs_end_transaction(trans);
4708 if (key.offset < (u64)-1) {
4710 } else if (key.type < BTRFS_ROOT_ITEM_KEY) {
4712 key.type = BTRFS_ROOT_ITEM_KEY;
4713 } else if (key.objectid < (u64)-1) {
4715 key.type = BTRFS_ROOT_ITEM_KEY;
4724 btrfs_free_path(path);
4725 if (trans && !IS_ERR(trans))
4726 btrfs_end_transaction(trans);
4728 btrfs_warn(fs_info, "btrfs_uuid_scan_kthread failed %d", ret);
4730 set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags);
4731 up(&fs_info->uuid_tree_rescan_sem);
4735 int btrfs_create_uuid_tree(struct btrfs_fs_info *fs_info)
4737 struct btrfs_trans_handle *trans;
4738 struct btrfs_root *tree_root = fs_info->tree_root;
4739 struct btrfs_root *uuid_root;
4740 struct task_struct *task;
4747 trans = btrfs_start_transaction(tree_root, 2);
4749 return PTR_ERR(trans);
4751 uuid_root = btrfs_create_tree(trans, BTRFS_UUID_TREE_OBJECTID);
4752 if (IS_ERR(uuid_root)) {
4753 ret = PTR_ERR(uuid_root);
4754 btrfs_abort_transaction(trans, ret);
4755 btrfs_end_transaction(trans);
4759 fs_info->uuid_root = uuid_root;
4761 ret = btrfs_commit_transaction(trans);
4765 down(&fs_info->uuid_tree_rescan_sem);
4766 task = kthread_run(btrfs_uuid_scan_kthread, fs_info, "btrfs-uuid");
4768 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4769 btrfs_warn(fs_info, "failed to start uuid_scan task");
4770 up(&fs_info->uuid_tree_rescan_sem);
4771 return PTR_ERR(task);
4778 * shrinking a device means finding all of the device extents past
4779 * the new size, and then following the back refs to the chunks.
4780 * The chunk relocation code actually frees the device extent
4782 int btrfs_shrink_device(struct btrfs_device *device, u64 new_size)
4784 struct btrfs_fs_info *fs_info = device->fs_info;
4785 struct btrfs_root *root = fs_info->dev_root;
4786 struct btrfs_trans_handle *trans;
4787 struct btrfs_dev_extent *dev_extent = NULL;
4788 struct btrfs_path *path;
4794 bool retried = false;
4795 struct extent_buffer *l;
4796 struct btrfs_key key;
4797 struct btrfs_super_block *super_copy = fs_info->super_copy;
4798 u64 old_total = btrfs_super_total_bytes(super_copy);
4799 u64 old_size = btrfs_device_get_total_bytes(device);
4804 new_size = round_down(new_size, fs_info->sectorsize);
4806 diff = round_down(old_size - new_size, fs_info->sectorsize);
4808 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
4811 path = btrfs_alloc_path();
4815 path->reada = READA_BACK;
4817 trans = btrfs_start_transaction(root, 0);
4818 if (IS_ERR(trans)) {
4819 btrfs_free_path(path);
4820 return PTR_ERR(trans);
4823 mutex_lock(&fs_info->chunk_mutex);
4825 btrfs_device_set_total_bytes(device, new_size);
4826 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
4827 device->fs_devices->total_rw_bytes -= diff;
4830 * The new free_chunk_space is new_size - used, so we have to
4831 * subtract the delta of the old free_chunk_space which included
4832 * old_size - used. If used > new_size then just subtract this
4833 * entire device's free space.
4835 if (device->bytes_used < new_size)
4836 free_diff = (old_size - device->bytes_used) -
4837 (new_size - device->bytes_used);
4839 free_diff = old_size - device->bytes_used;
4840 atomic64_sub(free_diff, &fs_info->free_chunk_space);
4844 * Once the device's size has been set to the new size, ensure all
4845 * in-memory chunks are synced to disk so that the loop below sees them
4846 * and relocates them accordingly.
4848 if (contains_pending_extent(device, &start, diff)) {
4849 mutex_unlock(&fs_info->chunk_mutex);
4850 ret = btrfs_commit_transaction(trans);
4854 mutex_unlock(&fs_info->chunk_mutex);
4855 btrfs_end_transaction(trans);
4859 key.objectid = device->devid;
4860 key.offset = (u64)-1;
4861 key.type = BTRFS_DEV_EXTENT_KEY;
4864 mutex_lock(&fs_info->reclaim_bgs_lock);
4865 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4867 mutex_unlock(&fs_info->reclaim_bgs_lock);
4871 ret = btrfs_previous_item(root, path, 0, key.type);
4873 mutex_unlock(&fs_info->reclaim_bgs_lock);
4877 btrfs_release_path(path);
4882 slot = path->slots[0];
4883 btrfs_item_key_to_cpu(l, &key, path->slots[0]);
4885 if (key.objectid != device->devid) {
4886 mutex_unlock(&fs_info->reclaim_bgs_lock);
4887 btrfs_release_path(path);
4891 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
4892 length = btrfs_dev_extent_length(l, dev_extent);
4894 if (key.offset + length <= new_size) {
4895 mutex_unlock(&fs_info->reclaim_bgs_lock);
4896 btrfs_release_path(path);
4900 chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
4901 btrfs_release_path(path);
4904 * We may be relocating the only data chunk we have,
4905 * which could potentially end up with losing data's
4906 * raid profile, so lets allocate an empty one in
4909 ret = btrfs_may_alloc_data_chunk(fs_info, chunk_offset);
4911 mutex_unlock(&fs_info->reclaim_bgs_lock);
4915 ret = btrfs_relocate_chunk(fs_info, chunk_offset);
4916 mutex_unlock(&fs_info->reclaim_bgs_lock);
4917 if (ret == -ENOSPC) {
4920 if (ret == -ETXTBSY) {
4922 "could not shrink block group %llu due to active swapfile",
4927 } while (key.offset-- > 0);
4929 if (failed && !retried) {
4933 } else if (failed && retried) {
4938 /* Shrinking succeeded, else we would be at "done". */
4939 trans = btrfs_start_transaction(root, 0);
4940 if (IS_ERR(trans)) {
4941 ret = PTR_ERR(trans);
4945 mutex_lock(&fs_info->chunk_mutex);
4946 /* Clear all state bits beyond the shrunk device size */
4947 clear_extent_bits(&device->alloc_state, new_size, (u64)-1,
4950 btrfs_device_set_disk_total_bytes(device, new_size);
4951 if (list_empty(&device->post_commit_list))
4952 list_add_tail(&device->post_commit_list,
4953 &trans->transaction->dev_update_list);
4955 WARN_ON(diff > old_total);
4956 btrfs_set_super_total_bytes(super_copy,
4957 round_down(old_total - diff, fs_info->sectorsize));
4958 mutex_unlock(&fs_info->chunk_mutex);
4960 btrfs_reserve_chunk_metadata(trans, false);
4961 /* Now btrfs_update_device() will change the on-disk size. */
4962 ret = btrfs_update_device(trans, device);
4963 btrfs_trans_release_chunk_metadata(trans);
4965 btrfs_abort_transaction(trans, ret);
4966 btrfs_end_transaction(trans);
4968 ret = btrfs_commit_transaction(trans);
4971 btrfs_free_path(path);
4973 mutex_lock(&fs_info->chunk_mutex);
4974 btrfs_device_set_total_bytes(device, old_size);
4975 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
4976 device->fs_devices->total_rw_bytes += diff;
4977 atomic64_add(free_diff, &fs_info->free_chunk_space);
4979 mutex_unlock(&fs_info->chunk_mutex);
4984 static int btrfs_add_system_chunk(struct btrfs_fs_info *fs_info,
4985 struct btrfs_key *key,
4986 struct btrfs_chunk *chunk, int item_size)
4988 struct btrfs_super_block *super_copy = fs_info->super_copy;
4989 struct btrfs_disk_key disk_key;
4993 lockdep_assert_held(&fs_info->chunk_mutex);
4995 array_size = btrfs_super_sys_array_size(super_copy);
4996 if (array_size + item_size + sizeof(disk_key)
4997 > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE)
5000 ptr = super_copy->sys_chunk_array + array_size;
5001 btrfs_cpu_key_to_disk(&disk_key, key);
5002 memcpy(ptr, &disk_key, sizeof(disk_key));
5003 ptr += sizeof(disk_key);
5004 memcpy(ptr, chunk, item_size);
5005 item_size += sizeof(disk_key);
5006 btrfs_set_super_sys_array_size(super_copy, array_size + item_size);
5012 * sort the devices in descending order by max_avail, total_avail
5014 static int btrfs_cmp_device_info(const void *a, const void *b)
5016 const struct btrfs_device_info *di_a = a;
5017 const struct btrfs_device_info *di_b = b;
5019 if (di_a->max_avail > di_b->max_avail)
5021 if (di_a->max_avail < di_b->max_avail)
5023 if (di_a->total_avail > di_b->total_avail)
5025 if (di_a->total_avail < di_b->total_avail)
5030 static void check_raid56_incompat_flag(struct btrfs_fs_info *info, u64 type)
5032 if (!(type & BTRFS_BLOCK_GROUP_RAID56_MASK))
5035 btrfs_set_fs_incompat(info, RAID56);
5038 static void check_raid1c34_incompat_flag(struct btrfs_fs_info *info, u64 type)
5040 if (!(type & (BTRFS_BLOCK_GROUP_RAID1C3 | BTRFS_BLOCK_GROUP_RAID1C4)))
5043 btrfs_set_fs_incompat(info, RAID1C34);
5047 * Structure used internally for btrfs_create_chunk() function.
5048 * Wraps needed parameters.
5050 struct alloc_chunk_ctl {
5053 /* Total number of stripes to allocate */
5055 /* sub_stripes info for map */
5057 /* Stripes per device */
5059 /* Maximum number of devices to use */
5061 /* Minimum number of devices to use */
5063 /* ndevs has to be a multiple of this */
5065 /* Number of copies */
5067 /* Number of stripes worth of bytes to store parity information */
5069 u64 max_stripe_size;
5077 static void init_alloc_chunk_ctl_policy_regular(
5078 struct btrfs_fs_devices *fs_devices,
5079 struct alloc_chunk_ctl *ctl)
5081 struct btrfs_space_info *space_info;
5083 space_info = btrfs_find_space_info(fs_devices->fs_info, ctl->type);
5086 ctl->max_chunk_size = READ_ONCE(space_info->chunk_size);
5087 ctl->max_stripe_size = min_t(u64, ctl->max_chunk_size, SZ_1G);
5089 if (ctl->type & BTRFS_BLOCK_GROUP_SYSTEM)
5090 ctl->devs_max = min_t(int, ctl->devs_max, BTRFS_MAX_DEVS_SYS_CHUNK);
5092 /* We don't want a chunk larger than 10% of writable space */
5093 ctl->max_chunk_size = min(mult_perc(fs_devices->total_rw_bytes, 10),
5094 ctl->max_chunk_size);
5095 ctl->dev_extent_min = btrfs_stripe_nr_to_offset(ctl->dev_stripes);
5098 static void init_alloc_chunk_ctl_policy_zoned(
5099 struct btrfs_fs_devices *fs_devices,
5100 struct alloc_chunk_ctl *ctl)
5102 u64 zone_size = fs_devices->fs_info->zone_size;
5104 int min_num_stripes = ctl->devs_min * ctl->dev_stripes;
5105 int min_data_stripes = (min_num_stripes - ctl->nparity) / ctl->ncopies;
5106 u64 min_chunk_size = min_data_stripes * zone_size;
5107 u64 type = ctl->type;
5109 ctl->max_stripe_size = zone_size;
5110 if (type & BTRFS_BLOCK_GROUP_DATA) {
5111 ctl->max_chunk_size = round_down(BTRFS_MAX_DATA_CHUNK_SIZE,
5113 } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
5114 ctl->max_chunk_size = ctl->max_stripe_size;
5115 } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
5116 ctl->max_chunk_size = 2 * ctl->max_stripe_size;
5117 ctl->devs_max = min_t(int, ctl->devs_max,
5118 BTRFS_MAX_DEVS_SYS_CHUNK);
5123 /* We don't want a chunk larger than 10% of writable space */
5124 limit = max(round_down(mult_perc(fs_devices->total_rw_bytes, 10),
5127 ctl->max_chunk_size = min(limit, ctl->max_chunk_size);
5128 ctl->dev_extent_min = zone_size * ctl->dev_stripes;
5131 static void init_alloc_chunk_ctl(struct btrfs_fs_devices *fs_devices,
5132 struct alloc_chunk_ctl *ctl)
5134 int index = btrfs_bg_flags_to_raid_index(ctl->type);
5136 ctl->sub_stripes = btrfs_raid_array[index].sub_stripes;
5137 ctl->dev_stripes = btrfs_raid_array[index].dev_stripes;
5138 ctl->devs_max = btrfs_raid_array[index].devs_max;
5140 ctl->devs_max = BTRFS_MAX_DEVS(fs_devices->fs_info);
5141 ctl->devs_min = btrfs_raid_array[index].devs_min;
5142 ctl->devs_increment = btrfs_raid_array[index].devs_increment;
5143 ctl->ncopies = btrfs_raid_array[index].ncopies;
5144 ctl->nparity = btrfs_raid_array[index].nparity;
5147 switch (fs_devices->chunk_alloc_policy) {
5148 case BTRFS_CHUNK_ALLOC_REGULAR:
5149 init_alloc_chunk_ctl_policy_regular(fs_devices, ctl);
5151 case BTRFS_CHUNK_ALLOC_ZONED:
5152 init_alloc_chunk_ctl_policy_zoned(fs_devices, ctl);
5159 static int gather_device_info(struct btrfs_fs_devices *fs_devices,
5160 struct alloc_chunk_ctl *ctl,
5161 struct btrfs_device_info *devices_info)
5163 struct btrfs_fs_info *info = fs_devices->fs_info;
5164 struct btrfs_device *device;
5166 u64 dev_extent_want = ctl->max_stripe_size * ctl->dev_stripes;
5173 * in the first pass through the devices list, we gather information
5174 * about the available holes on each device.
5176 list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
5177 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
5179 "BTRFS: read-only device in alloc_list\n");
5183 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
5184 &device->dev_state) ||
5185 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
5188 if (device->total_bytes > device->bytes_used)
5189 total_avail = device->total_bytes - device->bytes_used;
5193 /* If there is no space on this device, skip it. */
5194 if (total_avail < ctl->dev_extent_min)
5197 ret = find_free_dev_extent(device, dev_extent_want, &dev_offset,
5199 if (ret && ret != -ENOSPC)
5203 max_avail = dev_extent_want;
5205 if (max_avail < ctl->dev_extent_min) {
5206 if (btrfs_test_opt(info, ENOSPC_DEBUG))
5208 "%s: devid %llu has no free space, have=%llu want=%llu",
5209 __func__, device->devid, max_avail,
5210 ctl->dev_extent_min);
5214 if (ndevs == fs_devices->rw_devices) {
5215 WARN(1, "%s: found more than %llu devices\n",
5216 __func__, fs_devices->rw_devices);
5219 devices_info[ndevs].dev_offset = dev_offset;
5220 devices_info[ndevs].max_avail = max_avail;
5221 devices_info[ndevs].total_avail = total_avail;
5222 devices_info[ndevs].dev = device;
5228 * now sort the devices by hole size / available space
5230 sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
5231 btrfs_cmp_device_info, NULL);
5236 static int decide_stripe_size_regular(struct alloc_chunk_ctl *ctl,
5237 struct btrfs_device_info *devices_info)
5239 /* Number of stripes that count for block group size */
5243 * The primary goal is to maximize the number of stripes, so use as
5244 * many devices as possible, even if the stripes are not maximum sized.
5246 * The DUP profile stores more than one stripe per device, the
5247 * max_avail is the total size so we have to adjust.
5249 ctl->stripe_size = div_u64(devices_info[ctl->ndevs - 1].max_avail,
5251 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5253 /* This will have to be fixed for RAID1 and RAID10 over more drives */
5254 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5257 * Use the number of data stripes to figure out how big this chunk is
5258 * really going to be in terms of logical address space, and compare
5259 * that answer with the max chunk size. If it's higher, we try to
5260 * reduce stripe_size.
5262 if (ctl->stripe_size * data_stripes > ctl->max_chunk_size) {
5264 * Reduce stripe_size, round it up to a 16MB boundary again and
5265 * then use it, unless it ends up being even bigger than the
5266 * previous value we had already.
5268 ctl->stripe_size = min(round_up(div_u64(ctl->max_chunk_size,
5269 data_stripes), SZ_16M),
5273 /* Stripe size should not go beyond 1G. */
5274 ctl->stripe_size = min_t(u64, ctl->stripe_size, SZ_1G);
5276 /* Align to BTRFS_STRIPE_LEN */
5277 ctl->stripe_size = round_down(ctl->stripe_size, BTRFS_STRIPE_LEN);
5278 ctl->chunk_size = ctl->stripe_size * data_stripes;
5283 static int decide_stripe_size_zoned(struct alloc_chunk_ctl *ctl,
5284 struct btrfs_device_info *devices_info)
5286 u64 zone_size = devices_info[0].dev->zone_info->zone_size;
5287 /* Number of stripes that count for block group size */
5291 * It should hold because:
5292 * dev_extent_min == dev_extent_want == zone_size * dev_stripes
5294 ASSERT(devices_info[ctl->ndevs - 1].max_avail == ctl->dev_extent_min);
5296 ctl->stripe_size = zone_size;
5297 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5298 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5300 /* stripe_size is fixed in zoned filesysmte. Reduce ndevs instead. */
5301 if (ctl->stripe_size * data_stripes > ctl->max_chunk_size) {
5302 ctl->ndevs = div_u64(div_u64(ctl->max_chunk_size * ctl->ncopies,
5303 ctl->stripe_size) + ctl->nparity,
5305 ctl->num_stripes = ctl->ndevs * ctl->dev_stripes;
5306 data_stripes = (ctl->num_stripes - ctl->nparity) / ctl->ncopies;
5307 ASSERT(ctl->stripe_size * data_stripes <= ctl->max_chunk_size);
5310 ctl->chunk_size = ctl->stripe_size * data_stripes;
5315 static int decide_stripe_size(struct btrfs_fs_devices *fs_devices,
5316 struct alloc_chunk_ctl *ctl,
5317 struct btrfs_device_info *devices_info)
5319 struct btrfs_fs_info *info = fs_devices->fs_info;
5322 * Round down to number of usable stripes, devs_increment can be any
5323 * number so we can't use round_down() that requires power of 2, while
5324 * rounddown is safe.
5326 ctl->ndevs = rounddown(ctl->ndevs, ctl->devs_increment);
5328 if (ctl->ndevs < ctl->devs_min) {
5329 if (btrfs_test_opt(info, ENOSPC_DEBUG)) {
5331 "%s: not enough devices with free space: have=%d minimum required=%d",
5332 __func__, ctl->ndevs, ctl->devs_min);
5337 ctl->ndevs = min(ctl->ndevs, ctl->devs_max);
5339 switch (fs_devices->chunk_alloc_policy) {
5340 case BTRFS_CHUNK_ALLOC_REGULAR:
5341 return decide_stripe_size_regular(ctl, devices_info);
5342 case BTRFS_CHUNK_ALLOC_ZONED:
5343 return decide_stripe_size_zoned(ctl, devices_info);
5349 static struct btrfs_block_group *create_chunk(struct btrfs_trans_handle *trans,
5350 struct alloc_chunk_ctl *ctl,
5351 struct btrfs_device_info *devices_info)
5353 struct btrfs_fs_info *info = trans->fs_info;
5354 struct map_lookup *map = NULL;
5355 struct extent_map_tree *em_tree;
5356 struct btrfs_block_group *block_group;
5357 struct extent_map *em;
5358 u64 start = ctl->start;
5359 u64 type = ctl->type;
5364 map = kmalloc(map_lookup_size(ctl->num_stripes), GFP_NOFS);
5366 return ERR_PTR(-ENOMEM);
5367 map->num_stripes = ctl->num_stripes;
5369 for (i = 0; i < ctl->ndevs; ++i) {
5370 for (j = 0; j < ctl->dev_stripes; ++j) {
5371 int s = i * ctl->dev_stripes + j;
5372 map->stripes[s].dev = devices_info[i].dev;
5373 map->stripes[s].physical = devices_info[i].dev_offset +
5374 j * ctl->stripe_size;
5377 map->io_align = BTRFS_STRIPE_LEN;
5378 map->io_width = BTRFS_STRIPE_LEN;
5380 map->sub_stripes = ctl->sub_stripes;
5382 trace_btrfs_chunk_alloc(info, map, start, ctl->chunk_size);
5384 em = alloc_extent_map();
5387 return ERR_PTR(-ENOMEM);
5389 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
5390 em->map_lookup = map;
5392 em->len = ctl->chunk_size;
5393 em->block_start = 0;
5394 em->block_len = em->len;
5395 em->orig_block_len = ctl->stripe_size;
5397 em_tree = &info->mapping_tree;
5398 write_lock(&em_tree->lock);
5399 ret = add_extent_mapping(em_tree, em, 0);
5401 write_unlock(&em_tree->lock);
5402 free_extent_map(em);
5403 return ERR_PTR(ret);
5405 write_unlock(&em_tree->lock);
5407 block_group = btrfs_make_block_group(trans, type, start, ctl->chunk_size);
5408 if (IS_ERR(block_group))
5409 goto error_del_extent;
5411 for (i = 0; i < map->num_stripes; i++) {
5412 struct btrfs_device *dev = map->stripes[i].dev;
5414 btrfs_device_set_bytes_used(dev,
5415 dev->bytes_used + ctl->stripe_size);
5416 if (list_empty(&dev->post_commit_list))
5417 list_add_tail(&dev->post_commit_list,
5418 &trans->transaction->dev_update_list);
5421 atomic64_sub(ctl->stripe_size * map->num_stripes,
5422 &info->free_chunk_space);
5424 free_extent_map(em);
5425 check_raid56_incompat_flag(info, type);
5426 check_raid1c34_incompat_flag(info, type);
5431 write_lock(&em_tree->lock);
5432 remove_extent_mapping(em_tree, em);
5433 write_unlock(&em_tree->lock);
5435 /* One for our allocation */
5436 free_extent_map(em);
5437 /* One for the tree reference */
5438 free_extent_map(em);
5443 struct btrfs_block_group *btrfs_create_chunk(struct btrfs_trans_handle *trans,
5446 struct btrfs_fs_info *info = trans->fs_info;
5447 struct btrfs_fs_devices *fs_devices = info->fs_devices;
5448 struct btrfs_device_info *devices_info = NULL;
5449 struct alloc_chunk_ctl ctl;
5450 struct btrfs_block_group *block_group;
5453 lockdep_assert_held(&info->chunk_mutex);
5455 if (!alloc_profile_is_valid(type, 0)) {
5457 return ERR_PTR(-EINVAL);
5460 if (list_empty(&fs_devices->alloc_list)) {
5461 if (btrfs_test_opt(info, ENOSPC_DEBUG))
5462 btrfs_debug(info, "%s: no writable device", __func__);
5463 return ERR_PTR(-ENOSPC);
5466 if (!(type & BTRFS_BLOCK_GROUP_TYPE_MASK)) {
5467 btrfs_err(info, "invalid chunk type 0x%llx requested", type);
5469 return ERR_PTR(-EINVAL);
5472 ctl.start = find_next_chunk(info);
5474 init_alloc_chunk_ctl(fs_devices, &ctl);
5476 devices_info = kcalloc(fs_devices->rw_devices, sizeof(*devices_info),
5479 return ERR_PTR(-ENOMEM);
5481 ret = gather_device_info(fs_devices, &ctl, devices_info);
5483 block_group = ERR_PTR(ret);
5487 ret = decide_stripe_size(fs_devices, &ctl, devices_info);
5489 block_group = ERR_PTR(ret);
5493 block_group = create_chunk(trans, &ctl, devices_info);
5496 kfree(devices_info);
5501 * This function, btrfs_chunk_alloc_add_chunk_item(), typically belongs to the
5502 * phase 1 of chunk allocation. It belongs to phase 2 only when allocating system
5505 * See the comment at btrfs_chunk_alloc() for details about the chunk allocation
5508 int btrfs_chunk_alloc_add_chunk_item(struct btrfs_trans_handle *trans,
5509 struct btrfs_block_group *bg)
5511 struct btrfs_fs_info *fs_info = trans->fs_info;
5512 struct btrfs_root *chunk_root = fs_info->chunk_root;
5513 struct btrfs_key key;
5514 struct btrfs_chunk *chunk;
5515 struct btrfs_stripe *stripe;
5516 struct extent_map *em;
5517 struct map_lookup *map;
5523 * We take the chunk_mutex for 2 reasons:
5525 * 1) Updates and insertions in the chunk btree must be done while holding
5526 * the chunk_mutex, as well as updating the system chunk array in the
5527 * superblock. See the comment on top of btrfs_chunk_alloc() for the
5530 * 2) To prevent races with the final phase of a device replace operation
5531 * that replaces the device object associated with the map's stripes,
5532 * because the device object's id can change at any time during that
5533 * final phase of the device replace operation
5534 * (dev-replace.c:btrfs_dev_replace_finishing()), so we could grab the
5535 * replaced device and then see it with an ID of BTRFS_DEV_REPLACE_DEVID,
5536 * which would cause a failure when updating the device item, which does
5537 * not exists, or persisting a stripe of the chunk item with such ID.
5538 * Here we can't use the device_list_mutex because our caller already
5539 * has locked the chunk_mutex, and the final phase of device replace
5540 * acquires both mutexes - first the device_list_mutex and then the
5541 * chunk_mutex. Using any of those two mutexes protects us from a
5542 * concurrent device replace.
5544 lockdep_assert_held(&fs_info->chunk_mutex);
5546 em = btrfs_get_chunk_map(fs_info, bg->start, bg->length);
5549 btrfs_abort_transaction(trans, ret);
5553 map = em->map_lookup;
5554 item_size = btrfs_chunk_item_size(map->num_stripes);
5556 chunk = kzalloc(item_size, GFP_NOFS);
5559 btrfs_abort_transaction(trans, ret);
5563 for (i = 0; i < map->num_stripes; i++) {
5564 struct btrfs_device *device = map->stripes[i].dev;
5566 ret = btrfs_update_device(trans, device);
5571 stripe = &chunk->stripe;
5572 for (i = 0; i < map->num_stripes; i++) {
5573 struct btrfs_device *device = map->stripes[i].dev;
5574 const u64 dev_offset = map->stripes[i].physical;
5576 btrfs_set_stack_stripe_devid(stripe, device->devid);
5577 btrfs_set_stack_stripe_offset(stripe, dev_offset);
5578 memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE);
5582 btrfs_set_stack_chunk_length(chunk, bg->length);
5583 btrfs_set_stack_chunk_owner(chunk, BTRFS_EXTENT_TREE_OBJECTID);
5584 btrfs_set_stack_chunk_stripe_len(chunk, BTRFS_STRIPE_LEN);
5585 btrfs_set_stack_chunk_type(chunk, map->type);
5586 btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes);
5587 btrfs_set_stack_chunk_io_align(chunk, BTRFS_STRIPE_LEN);
5588 btrfs_set_stack_chunk_io_width(chunk, BTRFS_STRIPE_LEN);
5589 btrfs_set_stack_chunk_sector_size(chunk, fs_info->sectorsize);
5590 btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes);
5592 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
5593 key.type = BTRFS_CHUNK_ITEM_KEY;
5594 key.offset = bg->start;
5596 ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size);
5600 set_bit(BLOCK_GROUP_FLAG_CHUNK_ITEM_INSERTED, &bg->runtime_flags);
5602 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
5603 ret = btrfs_add_system_chunk(fs_info, &key, chunk, item_size);
5610 free_extent_map(em);
5614 static noinline int init_first_rw_device(struct btrfs_trans_handle *trans)
5616 struct btrfs_fs_info *fs_info = trans->fs_info;
5618 struct btrfs_block_group *meta_bg;
5619 struct btrfs_block_group *sys_bg;
5622 * When adding a new device for sprouting, the seed device is read-only
5623 * so we must first allocate a metadata and a system chunk. But before
5624 * adding the block group items to the extent, device and chunk btrees,
5627 * 1) Create both chunks without doing any changes to the btrees, as
5628 * otherwise we would get -ENOSPC since the block groups from the
5629 * seed device are read-only;
5631 * 2) Add the device item for the new sprout device - finishing the setup
5632 * of a new block group requires updating the device item in the chunk
5633 * btree, so it must exist when we attempt to do it. The previous step
5634 * ensures this does not fail with -ENOSPC.
5636 * After that we can add the block group items to their btrees:
5637 * update existing device item in the chunk btree, add a new block group
5638 * item to the extent btree, add a new chunk item to the chunk btree and
5639 * finally add the new device extent items to the devices btree.
5642 alloc_profile = btrfs_metadata_alloc_profile(fs_info);
5643 meta_bg = btrfs_create_chunk(trans, alloc_profile);
5644 if (IS_ERR(meta_bg))
5645 return PTR_ERR(meta_bg);
5647 alloc_profile = btrfs_system_alloc_profile(fs_info);
5648 sys_bg = btrfs_create_chunk(trans, alloc_profile);
5650 return PTR_ERR(sys_bg);
5655 static inline int btrfs_chunk_max_errors(struct map_lookup *map)
5657 const int index = btrfs_bg_flags_to_raid_index(map->type);
5659 return btrfs_raid_array[index].tolerated_failures;
5662 bool btrfs_chunk_writeable(struct btrfs_fs_info *fs_info, u64 chunk_offset)
5664 struct extent_map *em;
5665 struct map_lookup *map;
5670 em = btrfs_get_chunk_map(fs_info, chunk_offset, 1);
5674 map = em->map_lookup;
5675 for (i = 0; i < map->num_stripes; i++) {
5676 if (test_bit(BTRFS_DEV_STATE_MISSING,
5677 &map->stripes[i].dev->dev_state)) {
5681 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE,
5682 &map->stripes[i].dev->dev_state)) {
5689 * If the number of missing devices is larger than max errors, we can
5690 * not write the data into that chunk successfully.
5692 if (miss_ndevs > btrfs_chunk_max_errors(map))
5695 free_extent_map(em);
5699 void btrfs_mapping_tree_free(struct extent_map_tree *tree)
5701 struct extent_map *em;
5704 write_lock(&tree->lock);
5705 em = lookup_extent_mapping(tree, 0, (u64)-1);
5707 remove_extent_mapping(tree, em);
5708 write_unlock(&tree->lock);
5712 free_extent_map(em);
5713 /* once for the tree */
5714 free_extent_map(em);
5718 int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5720 struct extent_map *em;
5721 struct map_lookup *map;
5722 enum btrfs_raid_types index;
5725 em = btrfs_get_chunk_map(fs_info, logical, len);
5728 * We could return errors for these cases, but that could get
5729 * ugly and we'd probably do the same thing which is just not do
5730 * anything else and exit, so return 1 so the callers don't try
5731 * to use other copies.
5735 map = em->map_lookup;
5736 index = btrfs_bg_flags_to_raid_index(map->type);
5738 /* Non-RAID56, use their ncopies from btrfs_raid_array. */
5739 if (!(map->type & BTRFS_BLOCK_GROUP_RAID56_MASK))
5740 ret = btrfs_raid_array[index].ncopies;
5741 else if (map->type & BTRFS_BLOCK_GROUP_RAID5)
5743 else if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5745 * There could be two corrupted data stripes, we need
5746 * to loop retry in order to rebuild the correct data.
5748 * Fail a stripe at a time on every retry except the
5749 * stripe under reconstruction.
5751 ret = map->num_stripes;
5752 free_extent_map(em);
5756 unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
5759 struct extent_map *em;
5760 struct map_lookup *map;
5761 unsigned long len = fs_info->sectorsize;
5763 if (!btrfs_fs_incompat(fs_info, RAID56))
5766 em = btrfs_get_chunk_map(fs_info, logical, len);
5768 if (!WARN_ON(IS_ERR(em))) {
5769 map = em->map_lookup;
5770 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5771 len = btrfs_stripe_nr_to_offset(nr_data_stripes(map));
5772 free_extent_map(em);
5777 int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5779 struct extent_map *em;
5780 struct map_lookup *map;
5783 if (!btrfs_fs_incompat(fs_info, RAID56))
5786 em = btrfs_get_chunk_map(fs_info, logical, len);
5788 if(!WARN_ON(IS_ERR(em))) {
5789 map = em->map_lookup;
5790 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5792 free_extent_map(em);
5797 static int find_live_mirror(struct btrfs_fs_info *fs_info,
5798 struct map_lookup *map, int first,
5799 int dev_replace_is_ongoing)
5803 int preferred_mirror;
5805 struct btrfs_device *srcdev;
5808 (BTRFS_BLOCK_GROUP_RAID1_MASK | BTRFS_BLOCK_GROUP_RAID10)));
5810 if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5811 num_stripes = map->sub_stripes;
5813 num_stripes = map->num_stripes;
5815 switch (fs_info->fs_devices->read_policy) {
5817 /* Shouldn't happen, just warn and use pid instead of failing */
5818 btrfs_warn_rl(fs_info,
5819 "unknown read_policy type %u, reset to pid",
5820 fs_info->fs_devices->read_policy);
5821 fs_info->fs_devices->read_policy = BTRFS_READ_POLICY_PID;
5823 case BTRFS_READ_POLICY_PID:
5824 preferred_mirror = first + (current->pid % num_stripes);
5828 if (dev_replace_is_ongoing &&
5829 fs_info->dev_replace.cont_reading_from_srcdev_mode ==
5830 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID)
5831 srcdev = fs_info->dev_replace.srcdev;
5836 * try to avoid the drive that is the source drive for a
5837 * dev-replace procedure, only choose it if no other non-missing
5838 * mirror is available
5840 for (tolerance = 0; tolerance < 2; tolerance++) {
5841 if (map->stripes[preferred_mirror].dev->bdev &&
5842 (tolerance || map->stripes[preferred_mirror].dev != srcdev))
5843 return preferred_mirror;
5844 for (i = first; i < first + num_stripes; i++) {
5845 if (map->stripes[i].dev->bdev &&
5846 (tolerance || map->stripes[i].dev != srcdev))
5851 /* we couldn't find one that doesn't fail. Just return something
5852 * and the io error handling code will clean up eventually
5854 return preferred_mirror;
5857 static struct btrfs_io_context *alloc_btrfs_io_context(struct btrfs_fs_info *fs_info,
5861 struct btrfs_io_context *bioc;
5864 /* The size of btrfs_io_context */
5865 sizeof(struct btrfs_io_context) +
5866 /* Plus the variable array for the stripes */
5867 sizeof(struct btrfs_io_stripe) * (total_stripes),
5873 refcount_set(&bioc->refs, 1);
5875 bioc->fs_info = fs_info;
5876 bioc->replace_stripe_src = -1;
5877 bioc->full_stripe_logical = (u64)-1;
5878 bioc->logical = logical;
5883 void btrfs_get_bioc(struct btrfs_io_context *bioc)
5885 WARN_ON(!refcount_read(&bioc->refs));
5886 refcount_inc(&bioc->refs);
5889 void btrfs_put_bioc(struct btrfs_io_context *bioc)
5893 if (refcount_dec_and_test(&bioc->refs))
5898 * Please note that, discard won't be sent to target device of device
5901 struct btrfs_discard_stripe *btrfs_map_discard(struct btrfs_fs_info *fs_info,
5902 u64 logical, u64 *length_ret,
5905 struct extent_map *em;
5906 struct map_lookup *map;
5907 struct btrfs_discard_stripe *stripes;
5908 u64 length = *length_ret;
5913 u64 stripe_end_offset;
5917 u32 sub_stripes = 0;
5918 u32 stripes_per_dev = 0;
5919 u32 remaining_stripes = 0;
5920 u32 last_stripe = 0;
5924 em = btrfs_get_chunk_map(fs_info, logical, length);
5926 return ERR_CAST(em);
5928 map = em->map_lookup;
5930 /* we don't discard raid56 yet */
5931 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5936 offset = logical - em->start;
5937 length = min_t(u64, em->start + em->len - logical, length);
5938 *length_ret = length;
5941 * stripe_nr counts the total number of stripes we have to stride
5942 * to get to this block
5944 stripe_nr = offset >> BTRFS_STRIPE_LEN_SHIFT;
5946 /* stripe_offset is the offset of this block in its stripe */
5947 stripe_offset = offset - btrfs_stripe_nr_to_offset(stripe_nr);
5949 stripe_nr_end = round_up(offset + length, BTRFS_STRIPE_LEN) >>
5950 BTRFS_STRIPE_LEN_SHIFT;
5951 stripe_cnt = stripe_nr_end - stripe_nr;
5952 stripe_end_offset = btrfs_stripe_nr_to_offset(stripe_nr_end) -
5955 * after this, stripe_nr is the number of stripes on this
5956 * device we have to walk to find the data, and stripe_index is
5957 * the number of our device in the stripe array
5961 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5962 BTRFS_BLOCK_GROUP_RAID10)) {
5963 if (map->type & BTRFS_BLOCK_GROUP_RAID0)
5966 sub_stripes = map->sub_stripes;
5968 factor = map->num_stripes / sub_stripes;
5969 *num_stripes = min_t(u64, map->num_stripes,
5970 sub_stripes * stripe_cnt);
5971 stripe_index = stripe_nr % factor;
5972 stripe_nr /= factor;
5973 stripe_index *= sub_stripes;
5975 remaining_stripes = stripe_cnt % factor;
5976 stripes_per_dev = stripe_cnt / factor;
5977 last_stripe = ((stripe_nr_end - 1) % factor) * sub_stripes;
5978 } else if (map->type & (BTRFS_BLOCK_GROUP_RAID1_MASK |
5979 BTRFS_BLOCK_GROUP_DUP)) {
5980 *num_stripes = map->num_stripes;
5982 stripe_index = stripe_nr % map->num_stripes;
5983 stripe_nr /= map->num_stripes;
5986 stripes = kcalloc(*num_stripes, sizeof(*stripes), GFP_NOFS);
5992 for (i = 0; i < *num_stripes; i++) {
5993 stripes[i].physical =
5994 map->stripes[stripe_index].physical +
5995 stripe_offset + btrfs_stripe_nr_to_offset(stripe_nr);
5996 stripes[i].dev = map->stripes[stripe_index].dev;
5998 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5999 BTRFS_BLOCK_GROUP_RAID10)) {
6000 stripes[i].length = btrfs_stripe_nr_to_offset(stripes_per_dev);
6002 if (i / sub_stripes < remaining_stripes)
6003 stripes[i].length += BTRFS_STRIPE_LEN;
6006 * Special for the first stripe and
6009 * |-------|...|-------|
6013 if (i < sub_stripes)
6014 stripes[i].length -= stripe_offset;
6016 if (stripe_index >= last_stripe &&
6017 stripe_index <= (last_stripe +
6019 stripes[i].length -= stripe_end_offset;
6021 if (i == sub_stripes - 1)
6024 stripes[i].length = length;
6028 if (stripe_index == map->num_stripes) {
6034 free_extent_map(em);
6037 free_extent_map(em);
6038 return ERR_PTR(ret);
6041 static bool is_block_group_to_copy(struct btrfs_fs_info *fs_info, u64 logical)
6043 struct btrfs_block_group *cache;
6046 /* Non zoned filesystem does not use "to_copy" flag */
6047 if (!btrfs_is_zoned(fs_info))
6050 cache = btrfs_lookup_block_group(fs_info, logical);
6052 ret = test_bit(BLOCK_GROUP_FLAG_TO_COPY, &cache->runtime_flags);
6054 btrfs_put_block_group(cache);
6058 static void handle_ops_on_dev_replace(enum btrfs_map_op op,
6059 struct btrfs_io_context *bioc,
6060 struct btrfs_dev_replace *dev_replace,
6062 int *num_stripes_ret, int *max_errors_ret)
6064 u64 srcdev_devid = dev_replace->srcdev->devid;
6066 * At this stage, num_stripes is still the real number of stripes,
6067 * excluding the duplicated stripes.
6069 int num_stripes = *num_stripes_ret;
6070 int nr_extra_stripes = 0;
6071 int max_errors = *max_errors_ret;
6075 * A block group which has "to_copy" set will eventually be copied by
6076 * the dev-replace process. We can avoid cloning IO here.
6078 if (is_block_group_to_copy(dev_replace->srcdev->fs_info, logical))
6082 * Duplicate the write operations while the dev-replace procedure is
6083 * running. Since the copying of the old disk to the new disk takes
6084 * place at run time while the filesystem is mounted writable, the
6085 * regular write operations to the old disk have to be duplicated to go
6086 * to the new disk as well.
6088 * Note that device->missing is handled by the caller, and that the
6089 * write to the old disk is already set up in the stripes array.
6091 for (i = 0; i < num_stripes; i++) {
6092 struct btrfs_io_stripe *old = &bioc->stripes[i];
6093 struct btrfs_io_stripe *new = &bioc->stripes[num_stripes + nr_extra_stripes];
6095 if (old->dev->devid != srcdev_devid)
6098 new->physical = old->physical;
6099 new->dev = dev_replace->tgtdev;
6100 if (bioc->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK)
6101 bioc->replace_stripe_src = i;
6105 /* We can only have at most 2 extra nr_stripes (for DUP). */
6106 ASSERT(nr_extra_stripes <= 2);
6108 * For GET_READ_MIRRORS, we can only return at most 1 extra stripe for
6110 * If we have 2 extra stripes, only choose the one with smaller physical.
6112 if (op == BTRFS_MAP_GET_READ_MIRRORS && nr_extra_stripes == 2) {
6113 struct btrfs_io_stripe *first = &bioc->stripes[num_stripes];
6114 struct btrfs_io_stripe *second = &bioc->stripes[num_stripes + 1];
6116 /* Only DUP can have two extra stripes. */
6117 ASSERT(bioc->map_type & BTRFS_BLOCK_GROUP_DUP);
6120 * Swap the last stripe stripes and reduce @nr_extra_stripes.
6121 * The extra stripe would still be there, but won't be accessed.
6123 if (first->physical > second->physical) {
6124 swap(second->physical, first->physical);
6125 swap(second->dev, first->dev);
6130 *num_stripes_ret = num_stripes + nr_extra_stripes;
6131 *max_errors_ret = max_errors + nr_extra_stripes;
6132 bioc->replace_nr_stripes = nr_extra_stripes;
6135 static u64 btrfs_max_io_len(struct map_lookup *map, enum btrfs_map_op op,
6136 u64 offset, u32 *stripe_nr, u64 *stripe_offset,
6137 u64 *full_stripe_start)
6140 * Stripe_nr is the stripe where this block falls. stripe_offset is
6141 * the offset of this block in its stripe.
6143 *stripe_offset = offset & BTRFS_STRIPE_LEN_MASK;
6144 *stripe_nr = offset >> BTRFS_STRIPE_LEN_SHIFT;
6145 ASSERT(*stripe_offset < U32_MAX);
6147 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
6148 unsigned long full_stripe_len =
6149 btrfs_stripe_nr_to_offset(nr_data_stripes(map));
6152 * For full stripe start, we use previously calculated
6153 * @stripe_nr. Align it to nr_data_stripes, then multiply with
6156 * By this we can avoid u64 division completely. And we have
6157 * to go rounddown(), not round_down(), as nr_data_stripes is
6158 * not ensured to be power of 2.
6160 *full_stripe_start =
6161 btrfs_stripe_nr_to_offset(
6162 rounddown(*stripe_nr, nr_data_stripes(map)));
6164 ASSERT(*full_stripe_start + full_stripe_len > offset);
6165 ASSERT(*full_stripe_start <= offset);
6167 * For writes to RAID56, allow to write a full stripe set, but
6168 * no straddling of stripe sets.
6170 if (op == BTRFS_MAP_WRITE)
6171 return full_stripe_len - (offset - *full_stripe_start);
6175 * For other RAID types and for RAID56 reads, allow a single stripe (on
6178 if (map->type & BTRFS_BLOCK_GROUP_STRIPE_MASK)
6179 return BTRFS_STRIPE_LEN - *stripe_offset;
6183 static int set_io_stripe(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6184 u64 logical, u64 *length, struct btrfs_io_stripe *dst,
6185 struct map_lookup *map, u32 stripe_index,
6186 u64 stripe_offset, u64 stripe_nr)
6188 dst->dev = map->stripes[stripe_index].dev;
6190 if (op == BTRFS_MAP_READ && btrfs_need_stripe_tree_update(fs_info, map->type))
6191 return btrfs_get_raid_extent_offset(fs_info, logical, length,
6192 map->type, stripe_index, dst);
6194 dst->physical = map->stripes[stripe_index].physical +
6195 stripe_offset + btrfs_stripe_nr_to_offset(stripe_nr);
6200 * Map one logical range to one or more physical ranges.
6202 * @length: (Mandatory) mapped length of this run.
6203 * One logical range can be split into different segments
6204 * due to factors like zones and RAID0/5/6/10 stripe
6207 * @bioc_ret: (Mandatory) returned btrfs_io_context structure.
6208 * which has one or more physical ranges (btrfs_io_stripe)
6210 * Caller should call btrfs_put_bioc() to free it after use.
6212 * @smap: (Optional) single physical range optimization.
6213 * If the map request can be fulfilled by one single
6214 * physical range, and this is parameter is not NULL,
6215 * then @bioc_ret would be NULL, and @smap would be
6218 * @mirror_num_ret: (Mandatory) returned mirror number if the original
6221 * Mirror number 0 means to choose any live mirrors.
6223 * For non-RAID56 profiles, non-zero mirror_num means
6224 * the Nth mirror. (e.g. mirror_num 1 means the first
6227 * For RAID56 profile, mirror 1 means rebuild from P and
6228 * the remaining data stripes.
6230 * For RAID6 profile, mirror > 2 means mark another
6231 * data/P stripe error and rebuild from the remaining
6234 int btrfs_map_block(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6235 u64 logical, u64 *length,
6236 struct btrfs_io_context **bioc_ret,
6237 struct btrfs_io_stripe *smap, int *mirror_num_ret)
6239 struct extent_map *em;
6240 struct map_lookup *map;
6248 int mirror_num = (mirror_num_ret ? *mirror_num_ret : 0);
6252 struct btrfs_io_context *bioc = NULL;
6253 struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
6254 int dev_replace_is_ongoing = 0;
6255 u16 num_alloc_stripes;
6256 u64 raid56_full_stripe_start = (u64)-1;
6261 num_copies = btrfs_num_copies(fs_info, logical, fs_info->sectorsize);
6262 if (mirror_num > num_copies)
6265 em = btrfs_get_chunk_map(fs_info, logical, *length);
6269 map = em->map_lookup;
6270 data_stripes = nr_data_stripes(map);
6272 map_offset = logical - em->start;
6273 max_len = btrfs_max_io_len(map, op, map_offset, &stripe_nr,
6274 &stripe_offset, &raid56_full_stripe_start);
6275 *length = min_t(u64, em->len - map_offset, max_len);
6277 down_read(&dev_replace->rwsem);
6278 dev_replace_is_ongoing = btrfs_dev_replace_is_ongoing(dev_replace);
6280 * Hold the semaphore for read during the whole operation, write is
6281 * requested at commit time but must wait.
6283 if (!dev_replace_is_ongoing)
6284 up_read(&dev_replace->rwsem);
6288 if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
6289 stripe_index = stripe_nr % map->num_stripes;
6290 stripe_nr /= map->num_stripes;
6291 if (op == BTRFS_MAP_READ)
6293 } else if (map->type & BTRFS_BLOCK_GROUP_RAID1_MASK) {
6294 if (op != BTRFS_MAP_READ) {
6295 num_stripes = map->num_stripes;
6296 } else if (mirror_num) {
6297 stripe_index = mirror_num - 1;
6299 stripe_index = find_live_mirror(fs_info, map, 0,
6300 dev_replace_is_ongoing);
6301 mirror_num = stripe_index + 1;
6304 } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
6305 if (op != BTRFS_MAP_READ) {
6306 num_stripes = map->num_stripes;
6307 } else if (mirror_num) {
6308 stripe_index = mirror_num - 1;
6313 } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
6314 u32 factor = map->num_stripes / map->sub_stripes;
6316 stripe_index = (stripe_nr % factor) * map->sub_stripes;
6317 stripe_nr /= factor;
6319 if (op != BTRFS_MAP_READ)
6320 num_stripes = map->sub_stripes;
6321 else if (mirror_num)
6322 stripe_index += mirror_num - 1;
6324 int old_stripe_index = stripe_index;
6325 stripe_index = find_live_mirror(fs_info, map,
6327 dev_replace_is_ongoing);
6328 mirror_num = stripe_index - old_stripe_index + 1;
6331 } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
6332 if (op != BTRFS_MAP_READ || mirror_num > 1) {
6334 * Needs full stripe mapping.
6336 * Push stripe_nr back to the start of the full stripe
6337 * For those cases needing a full stripe, @stripe_nr
6338 * is the full stripe number.
6340 * Originally we go raid56_full_stripe_start / full_stripe_len,
6341 * but that can be expensive. Here we just divide
6342 * @stripe_nr with @data_stripes.
6344 stripe_nr /= data_stripes;
6346 /* RAID[56] write or recovery. Return all stripes */
6347 num_stripes = map->num_stripes;
6348 max_errors = btrfs_chunk_max_errors(map);
6350 /* Return the length to the full stripe end */
6351 *length = min(logical + *length,
6352 raid56_full_stripe_start + em->start +
6353 btrfs_stripe_nr_to_offset(data_stripes)) -
6358 ASSERT(mirror_num <= 1);
6359 /* Just grab the data stripe directly. */
6360 stripe_index = stripe_nr % data_stripes;
6361 stripe_nr /= data_stripes;
6363 /* We distribute the parity blocks across stripes */
6364 stripe_index = (stripe_nr + stripe_index) % map->num_stripes;
6365 if (op == BTRFS_MAP_READ && mirror_num < 1)
6370 * After this, stripe_nr is the number of stripes on this
6371 * device we have to walk to find the data, and stripe_index is
6372 * the number of our device in the stripe array
6374 stripe_index = stripe_nr % map->num_stripes;
6375 stripe_nr /= map->num_stripes;
6376 mirror_num = stripe_index + 1;
6378 if (stripe_index >= map->num_stripes) {
6380 "stripe index math went horribly wrong, got stripe_index=%u, num_stripes=%u",
6381 stripe_index, map->num_stripes);
6386 num_alloc_stripes = num_stripes;
6387 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL &&
6388 op != BTRFS_MAP_READ)
6390 * For replace case, we need to add extra stripes for extra
6391 * duplicated stripes.
6393 * For both WRITE and GET_READ_MIRRORS, we may have at most
6394 * 2 more stripes (DUP types, otherwise 1).
6396 num_alloc_stripes += 2;
6399 * If this I/O maps to a single device, try to return the device and
6400 * physical block information on the stack instead of allocating an
6401 * I/O context structure.
6403 if (smap && num_alloc_stripes == 1 &&
6404 !(btrfs_need_stripe_tree_update(fs_info, map->type) &&
6405 op != BTRFS_MAP_READ) &&
6406 !((map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) && mirror_num > 1)) {
6407 ret = set_io_stripe(fs_info, op, logical, length, smap, map,
6408 stripe_index, stripe_offset, stripe_nr);
6410 *mirror_num_ret = mirror_num;
6415 bioc = alloc_btrfs_io_context(fs_info, logical, num_alloc_stripes);
6420 bioc->map_type = map->type;
6423 * For RAID56 full map, we need to make sure the stripes[] follows the
6424 * rule that data stripes are all ordered, then followed with P and Q
6427 * It's still mostly the same as other profiles, just with extra rotation.
6429 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK &&
6430 (op != BTRFS_MAP_READ || mirror_num > 1)) {
6432 * For RAID56 @stripe_nr is already the number of full stripes
6433 * before us, which is also the rotation value (needs to modulo
6434 * with num_stripes).
6436 * In this case, we just add @stripe_nr with @i, then do the
6437 * modulo, to reduce one modulo call.
6439 bioc->full_stripe_logical = em->start +
6440 btrfs_stripe_nr_to_offset(stripe_nr * data_stripes);
6441 for (int i = 0; i < num_stripes; i++) {
6442 ret = set_io_stripe(fs_info, op, logical, length,
6443 &bioc->stripes[i], map,
6444 (i + stripe_nr) % num_stripes,
6445 stripe_offset, stripe_nr);
6451 * For all other non-RAID56 profiles, just copy the target
6452 * stripe into the bioc.
6454 for (i = 0; i < num_stripes; i++) {
6455 ret = set_io_stripe(fs_info, op, logical, length,
6456 &bioc->stripes[i], map, stripe_index,
6457 stripe_offset, stripe_nr);
6466 btrfs_put_bioc(bioc);
6470 if (op != BTRFS_MAP_READ)
6471 max_errors = btrfs_chunk_max_errors(map);
6473 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL &&
6474 op != BTRFS_MAP_READ) {
6475 handle_ops_on_dev_replace(op, bioc, dev_replace, logical,
6476 &num_stripes, &max_errors);
6480 bioc->num_stripes = num_stripes;
6481 bioc->max_errors = max_errors;
6482 bioc->mirror_num = mirror_num;
6485 if (dev_replace_is_ongoing) {
6486 lockdep_assert_held(&dev_replace->rwsem);
6487 /* Unlock and let waiting writers proceed */
6488 up_read(&dev_replace->rwsem);
6490 free_extent_map(em);
6494 static bool dev_args_match_fs_devices(const struct btrfs_dev_lookup_args *args,
6495 const struct btrfs_fs_devices *fs_devices)
6497 if (args->fsid == NULL)
6499 if (memcmp(fs_devices->metadata_uuid, args->fsid, BTRFS_FSID_SIZE) == 0)
6504 static bool dev_args_match_device(const struct btrfs_dev_lookup_args *args,
6505 const struct btrfs_device *device)
6507 if (args->missing) {
6508 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state) &&
6514 if (device->devid != args->devid)
6516 if (args->uuid && memcmp(device->uuid, args->uuid, BTRFS_UUID_SIZE) != 0)
6522 * Find a device specified by @devid or @uuid in the list of @fs_devices, or
6525 * If devid and uuid are both specified, the match must be exact, otherwise
6526 * only devid is used.
6528 struct btrfs_device *btrfs_find_device(const struct btrfs_fs_devices *fs_devices,
6529 const struct btrfs_dev_lookup_args *args)
6531 struct btrfs_device *device;
6532 struct btrfs_fs_devices *seed_devs;
6534 if (dev_args_match_fs_devices(args, fs_devices)) {
6535 list_for_each_entry(device, &fs_devices->devices, dev_list) {
6536 if (dev_args_match_device(args, device))
6541 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
6542 if (!dev_args_match_fs_devices(args, seed_devs))
6544 list_for_each_entry(device, &seed_devs->devices, dev_list) {
6545 if (dev_args_match_device(args, device))
6553 static struct btrfs_device *add_missing_dev(struct btrfs_fs_devices *fs_devices,
6554 u64 devid, u8 *dev_uuid)
6556 struct btrfs_device *device;
6557 unsigned int nofs_flag;
6560 * We call this under the chunk_mutex, so we want to use NOFS for this
6561 * allocation, however we don't want to change btrfs_alloc_device() to
6562 * always do NOFS because we use it in a lot of other GFP_KERNEL safe
6566 nofs_flag = memalloc_nofs_save();
6567 device = btrfs_alloc_device(NULL, &devid, dev_uuid, NULL);
6568 memalloc_nofs_restore(nofs_flag);
6572 list_add(&device->dev_list, &fs_devices->devices);
6573 device->fs_devices = fs_devices;
6574 fs_devices->num_devices++;
6576 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
6577 fs_devices->missing_devices++;
6583 * Allocate new device struct, set up devid and UUID.
6585 * @fs_info: used only for generating a new devid, can be NULL if
6586 * devid is provided (i.e. @devid != NULL).
6587 * @devid: a pointer to devid for this device. If NULL a new devid
6589 * @uuid: a pointer to UUID for this device. If NULL a new UUID
6591 * @path: a pointer to device path if available, NULL otherwise.
6593 * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR()
6594 * on error. Returned struct is not linked onto any lists and must be
6595 * destroyed with btrfs_free_device.
6597 struct btrfs_device *btrfs_alloc_device(struct btrfs_fs_info *fs_info,
6598 const u64 *devid, const u8 *uuid,
6601 struct btrfs_device *dev;
6604 if (WARN_ON(!devid && !fs_info))
6605 return ERR_PTR(-EINVAL);
6607 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
6609 return ERR_PTR(-ENOMEM);
6611 INIT_LIST_HEAD(&dev->dev_list);
6612 INIT_LIST_HEAD(&dev->dev_alloc_list);
6613 INIT_LIST_HEAD(&dev->post_commit_list);
6615 atomic_set(&dev->dev_stats_ccnt, 0);
6616 btrfs_device_data_ordered_init(dev);
6617 extent_io_tree_init(fs_info, &dev->alloc_state, IO_TREE_DEVICE_ALLOC_STATE);
6624 ret = find_next_devid(fs_info, &tmp);
6626 btrfs_free_device(dev);
6627 return ERR_PTR(ret);
6633 memcpy(dev->uuid, uuid, BTRFS_UUID_SIZE);
6635 generate_random_uuid(dev->uuid);
6638 struct rcu_string *name;
6640 name = rcu_string_strdup(path, GFP_KERNEL);
6642 btrfs_free_device(dev);
6643 return ERR_PTR(-ENOMEM);
6645 rcu_assign_pointer(dev->name, name);
6651 static void btrfs_report_missing_device(struct btrfs_fs_info *fs_info,
6652 u64 devid, u8 *uuid, bool error)
6655 btrfs_err_rl(fs_info, "devid %llu uuid %pU is missing",
6658 btrfs_warn_rl(fs_info, "devid %llu uuid %pU is missing",
6662 u64 btrfs_calc_stripe_length(const struct extent_map *em)
6664 const struct map_lookup *map = em->map_lookup;
6665 const int data_stripes = calc_data_stripes(map->type, map->num_stripes);
6667 return div_u64(em->len, data_stripes);
6670 #if BITS_PER_LONG == 32
6672 * Due to page cache limit, metadata beyond BTRFS_32BIT_MAX_FILE_SIZE
6673 * can't be accessed on 32bit systems.
6675 * This function do mount time check to reject the fs if it already has
6676 * metadata chunk beyond that limit.
6678 static int check_32bit_meta_chunk(struct btrfs_fs_info *fs_info,
6679 u64 logical, u64 length, u64 type)
6681 if (!(type & BTRFS_BLOCK_GROUP_METADATA))
6684 if (logical + length < MAX_LFS_FILESIZE)
6687 btrfs_err_32bit_limit(fs_info);
6692 * This is to give early warning for any metadata chunk reaching
6693 * BTRFS_32BIT_EARLY_WARN_THRESHOLD.
6694 * Although we can still access the metadata, it's not going to be possible
6695 * once the limit is reached.
6697 static void warn_32bit_meta_chunk(struct btrfs_fs_info *fs_info,
6698 u64 logical, u64 length, u64 type)
6700 if (!(type & BTRFS_BLOCK_GROUP_METADATA))
6703 if (logical + length < BTRFS_32BIT_EARLY_WARN_THRESHOLD)
6706 btrfs_warn_32bit_limit(fs_info);
6710 static struct btrfs_device *handle_missing_device(struct btrfs_fs_info *fs_info,
6711 u64 devid, u8 *uuid)
6713 struct btrfs_device *dev;
6715 if (!btrfs_test_opt(fs_info, DEGRADED)) {
6716 btrfs_report_missing_device(fs_info, devid, uuid, true);
6717 return ERR_PTR(-ENOENT);
6720 dev = add_missing_dev(fs_info->fs_devices, devid, uuid);
6722 btrfs_err(fs_info, "failed to init missing device %llu: %ld",
6723 devid, PTR_ERR(dev));
6726 btrfs_report_missing_device(fs_info, devid, uuid, false);
6731 static int read_one_chunk(struct btrfs_key *key, struct extent_buffer *leaf,
6732 struct btrfs_chunk *chunk)
6734 BTRFS_DEV_LOOKUP_ARGS(args);
6735 struct btrfs_fs_info *fs_info = leaf->fs_info;
6736 struct extent_map_tree *map_tree = &fs_info->mapping_tree;
6737 struct map_lookup *map;
6738 struct extent_map *em;
6743 u8 uuid[BTRFS_UUID_SIZE];
6749 logical = key->offset;
6750 length = btrfs_chunk_length(leaf, chunk);
6751 type = btrfs_chunk_type(leaf, chunk);
6752 index = btrfs_bg_flags_to_raid_index(type);
6753 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6755 #if BITS_PER_LONG == 32
6756 ret = check_32bit_meta_chunk(fs_info, logical, length, type);
6759 warn_32bit_meta_chunk(fs_info, logical, length, type);
6763 * Only need to verify chunk item if we're reading from sys chunk array,
6764 * as chunk item in tree block is already verified by tree-checker.
6766 if (leaf->start == BTRFS_SUPER_INFO_OFFSET) {
6767 ret = btrfs_check_chunk_valid(leaf, chunk, logical);
6772 read_lock(&map_tree->lock);
6773 em = lookup_extent_mapping(map_tree, logical, 1);
6774 read_unlock(&map_tree->lock);
6776 /* already mapped? */
6777 if (em && em->start <= logical && em->start + em->len > logical) {
6778 free_extent_map(em);
6781 free_extent_map(em);
6784 em = alloc_extent_map();
6787 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
6789 free_extent_map(em);
6793 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
6794 em->map_lookup = map;
6795 em->start = logical;
6798 em->block_start = 0;
6799 em->block_len = em->len;
6801 map->num_stripes = num_stripes;
6802 map->io_width = btrfs_chunk_io_width(leaf, chunk);
6803 map->io_align = btrfs_chunk_io_align(leaf, chunk);
6806 * We can't use the sub_stripes value, as for profiles other than
6807 * RAID10, they may have 0 as sub_stripes for filesystems created by
6808 * older mkfs (<v5.4).
6809 * In that case, it can cause divide-by-zero errors later.
6810 * Since currently sub_stripes is fixed for each profile, let's
6811 * use the trusted value instead.
6813 map->sub_stripes = btrfs_raid_array[index].sub_stripes;
6814 map->verified_stripes = 0;
6815 em->orig_block_len = btrfs_calc_stripe_length(em);
6816 for (i = 0; i < num_stripes; i++) {
6817 map->stripes[i].physical =
6818 btrfs_stripe_offset_nr(leaf, chunk, i);
6819 devid = btrfs_stripe_devid_nr(leaf, chunk, i);
6821 read_extent_buffer(leaf, uuid, (unsigned long)
6822 btrfs_stripe_dev_uuid_nr(chunk, i),
6825 map->stripes[i].dev = btrfs_find_device(fs_info->fs_devices, &args);
6826 if (!map->stripes[i].dev) {
6827 map->stripes[i].dev = handle_missing_device(fs_info,
6829 if (IS_ERR(map->stripes[i].dev)) {
6830 ret = PTR_ERR(map->stripes[i].dev);
6831 free_extent_map(em);
6836 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
6837 &(map->stripes[i].dev->dev_state));
6840 write_lock(&map_tree->lock);
6841 ret = add_extent_mapping(map_tree, em, 0);
6842 write_unlock(&map_tree->lock);
6845 "failed to add chunk map, start=%llu len=%llu: %d",
6846 em->start, em->len, ret);
6848 free_extent_map(em);
6853 static void fill_device_from_item(struct extent_buffer *leaf,
6854 struct btrfs_dev_item *dev_item,
6855 struct btrfs_device *device)
6859 device->devid = btrfs_device_id(leaf, dev_item);
6860 device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item);
6861 device->total_bytes = device->disk_total_bytes;
6862 device->commit_total_bytes = device->disk_total_bytes;
6863 device->bytes_used = btrfs_device_bytes_used(leaf, dev_item);
6864 device->commit_bytes_used = device->bytes_used;
6865 device->type = btrfs_device_type(leaf, dev_item);
6866 device->io_align = btrfs_device_io_align(leaf, dev_item);
6867 device->io_width = btrfs_device_io_width(leaf, dev_item);
6868 device->sector_size = btrfs_device_sector_size(leaf, dev_item);
6869 WARN_ON(device->devid == BTRFS_DEV_REPLACE_DEVID);
6870 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
6872 ptr = btrfs_device_uuid(dev_item);
6873 read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
6876 static struct btrfs_fs_devices *open_seed_devices(struct btrfs_fs_info *fs_info,
6879 struct btrfs_fs_devices *fs_devices;
6882 lockdep_assert_held(&uuid_mutex);
6885 /* This will match only for multi-device seed fs */
6886 list_for_each_entry(fs_devices, &fs_info->fs_devices->seed_list, seed_list)
6887 if (!memcmp(fs_devices->fsid, fsid, BTRFS_FSID_SIZE))
6891 fs_devices = find_fsid(fsid, NULL);
6893 if (!btrfs_test_opt(fs_info, DEGRADED))
6894 return ERR_PTR(-ENOENT);
6896 fs_devices = alloc_fs_devices(fsid);
6897 if (IS_ERR(fs_devices))
6900 fs_devices->seeding = true;
6901 fs_devices->opened = 1;
6906 * Upon first call for a seed fs fsid, just create a private copy of the
6907 * respective fs_devices and anchor it at fs_info->fs_devices->seed_list
6909 fs_devices = clone_fs_devices(fs_devices);
6910 if (IS_ERR(fs_devices))
6913 ret = open_fs_devices(fs_devices, BLK_OPEN_READ, fs_info->bdev_holder);
6915 free_fs_devices(fs_devices);
6916 return ERR_PTR(ret);
6919 if (!fs_devices->seeding) {
6920 close_fs_devices(fs_devices);
6921 free_fs_devices(fs_devices);
6922 return ERR_PTR(-EINVAL);
6925 list_add(&fs_devices->seed_list, &fs_info->fs_devices->seed_list);
6930 static int read_one_dev(struct extent_buffer *leaf,
6931 struct btrfs_dev_item *dev_item)
6933 BTRFS_DEV_LOOKUP_ARGS(args);
6934 struct btrfs_fs_info *fs_info = leaf->fs_info;
6935 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
6936 struct btrfs_device *device;
6939 u8 fs_uuid[BTRFS_FSID_SIZE];
6940 u8 dev_uuid[BTRFS_UUID_SIZE];
6942 devid = btrfs_device_id(leaf, dev_item);
6944 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
6946 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
6948 args.uuid = dev_uuid;
6949 args.fsid = fs_uuid;
6951 if (memcmp(fs_uuid, fs_devices->metadata_uuid, BTRFS_FSID_SIZE)) {
6952 fs_devices = open_seed_devices(fs_info, fs_uuid);
6953 if (IS_ERR(fs_devices))
6954 return PTR_ERR(fs_devices);
6957 device = btrfs_find_device(fs_info->fs_devices, &args);
6959 if (!btrfs_test_opt(fs_info, DEGRADED)) {
6960 btrfs_report_missing_device(fs_info, devid,
6965 device = add_missing_dev(fs_devices, devid, dev_uuid);
6966 if (IS_ERR(device)) {
6968 "failed to add missing dev %llu: %ld",
6969 devid, PTR_ERR(device));
6970 return PTR_ERR(device);
6972 btrfs_report_missing_device(fs_info, devid, dev_uuid, false);
6974 if (!device->bdev) {
6975 if (!btrfs_test_opt(fs_info, DEGRADED)) {
6976 btrfs_report_missing_device(fs_info,
6977 devid, dev_uuid, true);
6980 btrfs_report_missing_device(fs_info, devid,
6984 if (!device->bdev &&
6985 !test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
6987 * this happens when a device that was properly setup
6988 * in the device info lists suddenly goes bad.
6989 * device->bdev is NULL, and so we have to set
6990 * device->missing to one here
6992 device->fs_devices->missing_devices++;
6993 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
6996 /* Move the device to its own fs_devices */
6997 if (device->fs_devices != fs_devices) {
6998 ASSERT(test_bit(BTRFS_DEV_STATE_MISSING,
6999 &device->dev_state));
7001 list_move(&device->dev_list, &fs_devices->devices);
7002 device->fs_devices->num_devices--;
7003 fs_devices->num_devices++;
7005 device->fs_devices->missing_devices--;
7006 fs_devices->missing_devices++;
7008 device->fs_devices = fs_devices;
7012 if (device->fs_devices != fs_info->fs_devices) {
7013 BUG_ON(test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state));
7014 if (device->generation !=
7015 btrfs_device_generation(leaf, dev_item))
7019 fill_device_from_item(leaf, dev_item, device);
7021 u64 max_total_bytes = bdev_nr_bytes(device->bdev);
7023 if (device->total_bytes > max_total_bytes) {
7025 "device total_bytes should be at most %llu but found %llu",
7026 max_total_bytes, device->total_bytes);
7030 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
7031 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
7032 !test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
7033 device->fs_devices->total_rw_bytes += device->total_bytes;
7034 atomic64_add(device->total_bytes - device->bytes_used,
7035 &fs_info->free_chunk_space);
7041 int btrfs_read_sys_array(struct btrfs_fs_info *fs_info)
7043 struct btrfs_super_block *super_copy = fs_info->super_copy;
7044 struct extent_buffer *sb;
7045 struct btrfs_disk_key *disk_key;
7046 struct btrfs_chunk *chunk;
7048 unsigned long sb_array_offset;
7055 struct btrfs_key key;
7057 ASSERT(BTRFS_SUPER_INFO_SIZE <= fs_info->nodesize);
7060 * We allocated a dummy extent, just to use extent buffer accessors.
7061 * There will be unused space after BTRFS_SUPER_INFO_SIZE, but
7062 * that's fine, we will not go beyond system chunk array anyway.
7064 sb = alloc_dummy_extent_buffer(fs_info, BTRFS_SUPER_INFO_OFFSET);
7067 set_extent_buffer_uptodate(sb);
7069 write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE);
7070 array_size = btrfs_super_sys_array_size(super_copy);
7072 array_ptr = super_copy->sys_chunk_array;
7073 sb_array_offset = offsetof(struct btrfs_super_block, sys_chunk_array);
7076 while (cur_offset < array_size) {
7077 disk_key = (struct btrfs_disk_key *)array_ptr;
7078 len = sizeof(*disk_key);
7079 if (cur_offset + len > array_size)
7080 goto out_short_read;
7082 btrfs_disk_key_to_cpu(&key, disk_key);
7085 sb_array_offset += len;
7088 if (key.type != BTRFS_CHUNK_ITEM_KEY) {
7090 "unexpected item type %u in sys_array at offset %u",
7091 (u32)key.type, cur_offset);
7096 chunk = (struct btrfs_chunk *)sb_array_offset;
7098 * At least one btrfs_chunk with one stripe must be present,
7099 * exact stripe count check comes afterwards
7101 len = btrfs_chunk_item_size(1);
7102 if (cur_offset + len > array_size)
7103 goto out_short_read;
7105 num_stripes = btrfs_chunk_num_stripes(sb, chunk);
7108 "invalid number of stripes %u in sys_array at offset %u",
7109 num_stripes, cur_offset);
7114 type = btrfs_chunk_type(sb, chunk);
7115 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) == 0) {
7117 "invalid chunk type %llu in sys_array at offset %u",
7123 len = btrfs_chunk_item_size(num_stripes);
7124 if (cur_offset + len > array_size)
7125 goto out_short_read;
7127 ret = read_one_chunk(&key, sb, chunk);
7132 sb_array_offset += len;
7135 clear_extent_buffer_uptodate(sb);
7136 free_extent_buffer_stale(sb);
7140 btrfs_err(fs_info, "sys_array too short to read %u bytes at offset %u",
7142 clear_extent_buffer_uptodate(sb);
7143 free_extent_buffer_stale(sb);
7148 * Check if all chunks in the fs are OK for read-write degraded mount
7150 * If the @failing_dev is specified, it's accounted as missing.
7152 * Return true if all chunks meet the minimal RW mount requirements.
7153 * Return false if any chunk doesn't meet the minimal RW mount requirements.
7155 bool btrfs_check_rw_degradable(struct btrfs_fs_info *fs_info,
7156 struct btrfs_device *failing_dev)
7158 struct extent_map_tree *map_tree = &fs_info->mapping_tree;
7159 struct extent_map *em;
7163 read_lock(&map_tree->lock);
7164 em = lookup_extent_mapping(map_tree, 0, (u64)-1);
7165 read_unlock(&map_tree->lock);
7166 /* No chunk at all? Return false anyway */
7172 struct map_lookup *map;
7177 map = em->map_lookup;
7179 btrfs_get_num_tolerated_disk_barrier_failures(
7181 for (i = 0; i < map->num_stripes; i++) {
7182 struct btrfs_device *dev = map->stripes[i].dev;
7184 if (!dev || !dev->bdev ||
7185 test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state) ||
7186 dev->last_flush_error)
7188 else if (failing_dev && failing_dev == dev)
7191 if (missing > max_tolerated) {
7194 "chunk %llu missing %d devices, max tolerance is %d for writable mount",
7195 em->start, missing, max_tolerated);
7196 free_extent_map(em);
7200 next_start = extent_map_end(em);
7201 free_extent_map(em);
7203 read_lock(&map_tree->lock);
7204 em = lookup_extent_mapping(map_tree, next_start,
7205 (u64)(-1) - next_start);
7206 read_unlock(&map_tree->lock);
7212 static void readahead_tree_node_children(struct extent_buffer *node)
7215 const int nr_items = btrfs_header_nritems(node);
7217 for (i = 0; i < nr_items; i++)
7218 btrfs_readahead_node_child(node, i);
7221 int btrfs_read_chunk_tree(struct btrfs_fs_info *fs_info)
7223 struct btrfs_root *root = fs_info->chunk_root;
7224 struct btrfs_path *path;
7225 struct extent_buffer *leaf;
7226 struct btrfs_key key;
7227 struct btrfs_key found_key;
7232 u64 last_ra_node = 0;
7234 path = btrfs_alloc_path();
7239 * uuid_mutex is needed only if we are mounting a sprout FS
7240 * otherwise we don't need it.
7242 mutex_lock(&uuid_mutex);
7245 * It is possible for mount and umount to race in such a way that
7246 * we execute this code path, but open_fs_devices failed to clear
7247 * total_rw_bytes. We certainly want it cleared before reading the
7248 * device items, so clear it here.
7250 fs_info->fs_devices->total_rw_bytes = 0;
7253 * Lockdep complains about possible circular locking dependency between
7254 * a disk's open_mutex (struct gendisk.open_mutex), the rw semaphores
7255 * used for freeze procection of a fs (struct super_block.s_writers),
7256 * which we take when starting a transaction, and extent buffers of the
7257 * chunk tree if we call read_one_dev() while holding a lock on an
7258 * extent buffer of the chunk tree. Since we are mounting the filesystem
7259 * and at this point there can't be any concurrent task modifying the
7260 * chunk tree, to keep it simple, just skip locking on the chunk tree.
7262 ASSERT(!test_bit(BTRFS_FS_OPEN, &fs_info->flags));
7263 path->skip_locking = 1;
7266 * Read all device items, and then all the chunk items. All
7267 * device items are found before any chunk item (their object id
7268 * is smaller than the lowest possible object id for a chunk
7269 * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID).
7271 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
7274 btrfs_for_each_slot(root, &key, &found_key, path, iter_ret) {
7275 struct extent_buffer *node = path->nodes[1];
7277 leaf = path->nodes[0];
7278 slot = path->slots[0];
7281 if (last_ra_node != node->start) {
7282 readahead_tree_node_children(node);
7283 last_ra_node = node->start;
7286 if (found_key.type == BTRFS_DEV_ITEM_KEY) {
7287 struct btrfs_dev_item *dev_item;
7288 dev_item = btrfs_item_ptr(leaf, slot,
7289 struct btrfs_dev_item);
7290 ret = read_one_dev(leaf, dev_item);
7294 } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) {
7295 struct btrfs_chunk *chunk;
7298 * We are only called at mount time, so no need to take
7299 * fs_info->chunk_mutex. Plus, to avoid lockdep warnings,
7300 * we always lock first fs_info->chunk_mutex before
7301 * acquiring any locks on the chunk tree. This is a
7302 * requirement for chunk allocation, see the comment on
7303 * top of btrfs_chunk_alloc() for details.
7305 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
7306 ret = read_one_chunk(&found_key, leaf, chunk);
7311 /* Catch error found during iteration */
7318 * After loading chunk tree, we've got all device information,
7319 * do another round of validation checks.
7321 if (total_dev != fs_info->fs_devices->total_devices) {
7323 "super block num_devices %llu mismatch with DEV_ITEM count %llu, will be repaired on next transaction commit",
7324 btrfs_super_num_devices(fs_info->super_copy),
7326 fs_info->fs_devices->total_devices = total_dev;
7327 btrfs_set_super_num_devices(fs_info->super_copy, total_dev);
7329 if (btrfs_super_total_bytes(fs_info->super_copy) <
7330 fs_info->fs_devices->total_rw_bytes) {
7332 "super_total_bytes %llu mismatch with fs_devices total_rw_bytes %llu",
7333 btrfs_super_total_bytes(fs_info->super_copy),
7334 fs_info->fs_devices->total_rw_bytes);
7340 mutex_unlock(&uuid_mutex);
7342 btrfs_free_path(path);
7346 int btrfs_init_devices_late(struct btrfs_fs_info *fs_info)
7348 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices, *seed_devs;
7349 struct btrfs_device *device;
7352 fs_devices->fs_info = fs_info;
7354 mutex_lock(&fs_devices->device_list_mutex);
7355 list_for_each_entry(device, &fs_devices->devices, dev_list)
7356 device->fs_info = fs_info;
7358 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
7359 list_for_each_entry(device, &seed_devs->devices, dev_list) {
7360 device->fs_info = fs_info;
7361 ret = btrfs_get_dev_zone_info(device, false);
7366 seed_devs->fs_info = fs_info;
7368 mutex_unlock(&fs_devices->device_list_mutex);
7373 static u64 btrfs_dev_stats_value(const struct extent_buffer *eb,
7374 const struct btrfs_dev_stats_item *ptr,
7379 read_extent_buffer(eb, &val,
7380 offsetof(struct btrfs_dev_stats_item, values) +
7381 ((unsigned long)ptr) + (index * sizeof(u64)),
7386 static void btrfs_set_dev_stats_value(struct extent_buffer *eb,
7387 struct btrfs_dev_stats_item *ptr,
7390 write_extent_buffer(eb, &val,
7391 offsetof(struct btrfs_dev_stats_item, values) +
7392 ((unsigned long)ptr) + (index * sizeof(u64)),
7396 static int btrfs_device_init_dev_stats(struct btrfs_device *device,
7397 struct btrfs_path *path)
7399 struct btrfs_dev_stats_item *ptr;
7400 struct extent_buffer *eb;
7401 struct btrfs_key key;
7405 if (!device->fs_info->dev_root)
7408 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7409 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7410 key.offset = device->devid;
7411 ret = btrfs_search_slot(NULL, device->fs_info->dev_root, &key, path, 0, 0);
7413 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7414 btrfs_dev_stat_set(device, i, 0);
7415 device->dev_stats_valid = 1;
7416 btrfs_release_path(path);
7417 return ret < 0 ? ret : 0;
7419 slot = path->slots[0];
7420 eb = path->nodes[0];
7421 item_size = btrfs_item_size(eb, slot);
7423 ptr = btrfs_item_ptr(eb, slot, struct btrfs_dev_stats_item);
7425 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7426 if (item_size >= (1 + i) * sizeof(__le64))
7427 btrfs_dev_stat_set(device, i,
7428 btrfs_dev_stats_value(eb, ptr, i));
7430 btrfs_dev_stat_set(device, i, 0);
7433 device->dev_stats_valid = 1;
7434 btrfs_dev_stat_print_on_load(device);
7435 btrfs_release_path(path);
7440 int btrfs_init_dev_stats(struct btrfs_fs_info *fs_info)
7442 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices, *seed_devs;
7443 struct btrfs_device *device;
7444 struct btrfs_path *path = NULL;
7447 path = btrfs_alloc_path();
7451 mutex_lock(&fs_devices->device_list_mutex);
7452 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7453 ret = btrfs_device_init_dev_stats(device, path);
7457 list_for_each_entry(seed_devs, &fs_devices->seed_list, seed_list) {
7458 list_for_each_entry(device, &seed_devs->devices, dev_list) {
7459 ret = btrfs_device_init_dev_stats(device, path);
7465 mutex_unlock(&fs_devices->device_list_mutex);
7467 btrfs_free_path(path);
7471 static int update_dev_stat_item(struct btrfs_trans_handle *trans,
7472 struct btrfs_device *device)
7474 struct btrfs_fs_info *fs_info = trans->fs_info;
7475 struct btrfs_root *dev_root = fs_info->dev_root;
7476 struct btrfs_path *path;
7477 struct btrfs_key key;
7478 struct extent_buffer *eb;
7479 struct btrfs_dev_stats_item *ptr;
7483 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7484 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7485 key.offset = device->devid;
7487 path = btrfs_alloc_path();
7490 ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1);
7492 btrfs_warn_in_rcu(fs_info,
7493 "error %d while searching for dev_stats item for device %s",
7494 ret, btrfs_dev_name(device));
7499 btrfs_item_size(path->nodes[0], path->slots[0]) < sizeof(*ptr)) {
7500 /* need to delete old one and insert a new one */
7501 ret = btrfs_del_item(trans, dev_root, path);
7503 btrfs_warn_in_rcu(fs_info,
7504 "delete too small dev_stats item for device %s failed %d",
7505 btrfs_dev_name(device), ret);
7512 /* need to insert a new item */
7513 btrfs_release_path(path);
7514 ret = btrfs_insert_empty_item(trans, dev_root, path,
7515 &key, sizeof(*ptr));
7517 btrfs_warn_in_rcu(fs_info,
7518 "insert dev_stats item for device %s failed %d",
7519 btrfs_dev_name(device), ret);
7524 eb = path->nodes[0];
7525 ptr = btrfs_item_ptr(eb, path->slots[0], struct btrfs_dev_stats_item);
7526 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7527 btrfs_set_dev_stats_value(eb, ptr, i,
7528 btrfs_dev_stat_read(device, i));
7529 btrfs_mark_buffer_dirty(trans, eb);
7532 btrfs_free_path(path);
7537 * called from commit_transaction. Writes all changed device stats to disk.
7539 int btrfs_run_dev_stats(struct btrfs_trans_handle *trans)
7541 struct btrfs_fs_info *fs_info = trans->fs_info;
7542 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7543 struct btrfs_device *device;
7547 mutex_lock(&fs_devices->device_list_mutex);
7548 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7549 stats_cnt = atomic_read(&device->dev_stats_ccnt);
7550 if (!device->dev_stats_valid || stats_cnt == 0)
7555 * There is a LOAD-LOAD control dependency between the value of
7556 * dev_stats_ccnt and updating the on-disk values which requires
7557 * reading the in-memory counters. Such control dependencies
7558 * require explicit read memory barriers.
7560 * This memory barriers pairs with smp_mb__before_atomic in
7561 * btrfs_dev_stat_inc/btrfs_dev_stat_set and with the full
7562 * barrier implied by atomic_xchg in
7563 * btrfs_dev_stats_read_and_reset
7567 ret = update_dev_stat_item(trans, device);
7569 atomic_sub(stats_cnt, &device->dev_stats_ccnt);
7571 mutex_unlock(&fs_devices->device_list_mutex);
7576 void btrfs_dev_stat_inc_and_print(struct btrfs_device *dev, int index)
7578 btrfs_dev_stat_inc(dev, index);
7580 if (!dev->dev_stats_valid)
7582 btrfs_err_rl_in_rcu(dev->fs_info,
7583 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7584 btrfs_dev_name(dev),
7585 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7586 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7587 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7588 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7589 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7592 static void btrfs_dev_stat_print_on_load(struct btrfs_device *dev)
7596 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7597 if (btrfs_dev_stat_read(dev, i) != 0)
7599 if (i == BTRFS_DEV_STAT_VALUES_MAX)
7600 return; /* all values == 0, suppress message */
7602 btrfs_info_in_rcu(dev->fs_info,
7603 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7604 btrfs_dev_name(dev),
7605 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7606 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7607 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7608 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7609 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7612 int btrfs_get_dev_stats(struct btrfs_fs_info *fs_info,
7613 struct btrfs_ioctl_get_dev_stats *stats)
7615 BTRFS_DEV_LOOKUP_ARGS(args);
7616 struct btrfs_device *dev;
7617 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7620 mutex_lock(&fs_devices->device_list_mutex);
7621 args.devid = stats->devid;
7622 dev = btrfs_find_device(fs_info->fs_devices, &args);
7623 mutex_unlock(&fs_devices->device_list_mutex);
7626 btrfs_warn(fs_info, "get dev_stats failed, device not found");
7628 } else if (!dev->dev_stats_valid) {
7629 btrfs_warn(fs_info, "get dev_stats failed, not yet valid");
7631 } else if (stats->flags & BTRFS_DEV_STATS_RESET) {
7632 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7633 if (stats->nr_items > i)
7635 btrfs_dev_stat_read_and_reset(dev, i);
7637 btrfs_dev_stat_set(dev, i, 0);
7639 btrfs_info(fs_info, "device stats zeroed by %s (%d)",
7640 current->comm, task_pid_nr(current));
7642 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7643 if (stats->nr_items > i)
7644 stats->values[i] = btrfs_dev_stat_read(dev, i);
7646 if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX)
7647 stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX;
7652 * Update the size and bytes used for each device where it changed. This is
7653 * delayed since we would otherwise get errors while writing out the
7656 * Must be invoked during transaction commit.
7658 void btrfs_commit_device_sizes(struct btrfs_transaction *trans)
7660 struct btrfs_device *curr, *next;
7662 ASSERT(trans->state == TRANS_STATE_COMMIT_DOING);
7664 if (list_empty(&trans->dev_update_list))
7668 * We don't need the device_list_mutex here. This list is owned by the
7669 * transaction and the transaction must complete before the device is
7672 mutex_lock(&trans->fs_info->chunk_mutex);
7673 list_for_each_entry_safe(curr, next, &trans->dev_update_list,
7675 list_del_init(&curr->post_commit_list);
7676 curr->commit_total_bytes = curr->disk_total_bytes;
7677 curr->commit_bytes_used = curr->bytes_used;
7679 mutex_unlock(&trans->fs_info->chunk_mutex);
7683 * Multiplicity factor for simple profiles: DUP, RAID1-like and RAID10.
7685 int btrfs_bg_type_to_factor(u64 flags)
7687 const int index = btrfs_bg_flags_to_raid_index(flags);
7689 return btrfs_raid_array[index].ncopies;
7694 static int verify_one_dev_extent(struct btrfs_fs_info *fs_info,
7695 u64 chunk_offset, u64 devid,
7696 u64 physical_offset, u64 physical_len)
7698 struct btrfs_dev_lookup_args args = { .devid = devid };
7699 struct extent_map_tree *em_tree = &fs_info->mapping_tree;
7700 struct extent_map *em;
7701 struct map_lookup *map;
7702 struct btrfs_device *dev;
7708 read_lock(&em_tree->lock);
7709 em = lookup_extent_mapping(em_tree, chunk_offset, 1);
7710 read_unlock(&em_tree->lock);
7714 "dev extent physical offset %llu on devid %llu doesn't have corresponding chunk",
7715 physical_offset, devid);
7720 map = em->map_lookup;
7721 stripe_len = btrfs_calc_stripe_length(em);
7722 if (physical_len != stripe_len) {
7724 "dev extent physical offset %llu on devid %llu length doesn't match chunk %llu, have %llu expect %llu",
7725 physical_offset, devid, em->start, physical_len,
7732 * Very old mkfs.btrfs (before v4.1) will not respect the reserved
7733 * space. Although kernel can handle it without problem, better to warn
7736 if (physical_offset < BTRFS_DEVICE_RANGE_RESERVED)
7738 "devid %llu physical %llu len %llu inside the reserved space",
7739 devid, physical_offset, physical_len);
7741 for (i = 0; i < map->num_stripes; i++) {
7742 if (map->stripes[i].dev->devid == devid &&
7743 map->stripes[i].physical == physical_offset) {
7745 if (map->verified_stripes >= map->num_stripes) {
7747 "too many dev extents for chunk %llu found",
7752 map->verified_stripes++;
7758 "dev extent physical offset %llu devid %llu has no corresponding chunk",
7759 physical_offset, devid);
7763 /* Make sure no dev extent is beyond device boundary */
7764 dev = btrfs_find_device(fs_info->fs_devices, &args);
7766 btrfs_err(fs_info, "failed to find devid %llu", devid);
7771 if (physical_offset + physical_len > dev->disk_total_bytes) {
7773 "dev extent devid %llu physical offset %llu len %llu is beyond device boundary %llu",
7774 devid, physical_offset, physical_len,
7775 dev->disk_total_bytes);
7780 if (dev->zone_info) {
7781 u64 zone_size = dev->zone_info->zone_size;
7783 if (!IS_ALIGNED(physical_offset, zone_size) ||
7784 !IS_ALIGNED(physical_len, zone_size)) {
7786 "zoned: dev extent devid %llu physical offset %llu len %llu is not aligned to device zone",
7787 devid, physical_offset, physical_len);
7794 free_extent_map(em);
7798 static int verify_chunk_dev_extent_mapping(struct btrfs_fs_info *fs_info)
7800 struct extent_map_tree *em_tree = &fs_info->mapping_tree;
7801 struct extent_map *em;
7802 struct rb_node *node;
7805 read_lock(&em_tree->lock);
7806 for (node = rb_first_cached(&em_tree->map); node; node = rb_next(node)) {
7807 em = rb_entry(node, struct extent_map, rb_node);
7808 if (em->map_lookup->num_stripes !=
7809 em->map_lookup->verified_stripes) {
7811 "chunk %llu has missing dev extent, have %d expect %d",
7812 em->start, em->map_lookup->verified_stripes,
7813 em->map_lookup->num_stripes);
7819 read_unlock(&em_tree->lock);
7824 * Ensure that all dev extents are mapped to correct chunk, otherwise
7825 * later chunk allocation/free would cause unexpected behavior.
7827 * NOTE: This will iterate through the whole device tree, which should be of
7828 * the same size level as the chunk tree. This slightly increases mount time.
7830 int btrfs_verify_dev_extents(struct btrfs_fs_info *fs_info)
7832 struct btrfs_path *path;
7833 struct btrfs_root *root = fs_info->dev_root;
7834 struct btrfs_key key;
7836 u64 prev_dev_ext_end = 0;
7840 * We don't have a dev_root because we mounted with ignorebadroots and
7841 * failed to load the root, so we want to skip the verification in this
7844 * However if the dev root is fine, but the tree itself is corrupted
7845 * we'd still fail to mount. This verification is only to make sure
7846 * writes can happen safely, so instead just bypass this check
7847 * completely in the case of IGNOREBADROOTS.
7849 if (btrfs_test_opt(fs_info, IGNOREBADROOTS))
7853 key.type = BTRFS_DEV_EXTENT_KEY;
7856 path = btrfs_alloc_path();
7860 path->reada = READA_FORWARD;
7861 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
7865 if (path->slots[0] >= btrfs_header_nritems(path->nodes[0])) {
7866 ret = btrfs_next_leaf(root, path);
7869 /* No dev extents at all? Not good */
7876 struct extent_buffer *leaf = path->nodes[0];
7877 struct btrfs_dev_extent *dext;
7878 int slot = path->slots[0];
7880 u64 physical_offset;
7884 btrfs_item_key_to_cpu(leaf, &key, slot);
7885 if (key.type != BTRFS_DEV_EXTENT_KEY)
7887 devid = key.objectid;
7888 physical_offset = key.offset;
7890 dext = btrfs_item_ptr(leaf, slot, struct btrfs_dev_extent);
7891 chunk_offset = btrfs_dev_extent_chunk_offset(leaf, dext);
7892 physical_len = btrfs_dev_extent_length(leaf, dext);
7894 /* Check if this dev extent overlaps with the previous one */
7895 if (devid == prev_devid && physical_offset < prev_dev_ext_end) {
7897 "dev extent devid %llu physical offset %llu overlap with previous dev extent end %llu",
7898 devid, physical_offset, prev_dev_ext_end);
7903 ret = verify_one_dev_extent(fs_info, chunk_offset, devid,
7904 physical_offset, physical_len);
7908 prev_dev_ext_end = physical_offset + physical_len;
7910 ret = btrfs_next_item(root, path);
7919 /* Ensure all chunks have corresponding dev extents */
7920 ret = verify_chunk_dev_extent_mapping(fs_info);
7922 btrfs_free_path(path);
7927 * Check whether the given block group or device is pinned by any inode being
7928 * used as a swapfile.
7930 bool btrfs_pinned_by_swapfile(struct btrfs_fs_info *fs_info, void *ptr)
7932 struct btrfs_swapfile_pin *sp;
7933 struct rb_node *node;
7935 spin_lock(&fs_info->swapfile_pins_lock);
7936 node = fs_info->swapfile_pins.rb_node;
7938 sp = rb_entry(node, struct btrfs_swapfile_pin, node);
7940 node = node->rb_left;
7941 else if (ptr > sp->ptr)
7942 node = node->rb_right;
7946 spin_unlock(&fs_info->swapfile_pins_lock);
7947 return node != NULL;
7950 static int relocating_repair_kthread(void *data)
7952 struct btrfs_block_group *cache = data;
7953 struct btrfs_fs_info *fs_info = cache->fs_info;
7957 target = cache->start;
7958 btrfs_put_block_group(cache);
7960 sb_start_write(fs_info->sb);
7961 if (!btrfs_exclop_start(fs_info, BTRFS_EXCLOP_BALANCE)) {
7963 "zoned: skip relocating block group %llu to repair: EBUSY",
7965 sb_end_write(fs_info->sb);
7969 mutex_lock(&fs_info->reclaim_bgs_lock);
7971 /* Ensure block group still exists */
7972 cache = btrfs_lookup_block_group(fs_info, target);
7976 if (!test_bit(BLOCK_GROUP_FLAG_RELOCATING_REPAIR, &cache->runtime_flags))
7979 ret = btrfs_may_alloc_data_chunk(fs_info, target);
7984 "zoned: relocating block group %llu to repair IO failure",
7986 ret = btrfs_relocate_chunk(fs_info, target);
7990 btrfs_put_block_group(cache);
7991 mutex_unlock(&fs_info->reclaim_bgs_lock);
7992 btrfs_exclop_finish(fs_info);
7993 sb_end_write(fs_info->sb);
7998 bool btrfs_repair_one_zone(struct btrfs_fs_info *fs_info, u64 logical)
8000 struct btrfs_block_group *cache;
8002 if (!btrfs_is_zoned(fs_info))
8005 /* Do not attempt to repair in degraded state */
8006 if (btrfs_test_opt(fs_info, DEGRADED))
8009 cache = btrfs_lookup_block_group(fs_info, logical);
8013 if (test_and_set_bit(BLOCK_GROUP_FLAG_RELOCATING_REPAIR, &cache->runtime_flags)) {
8014 btrfs_put_block_group(cache);
8018 kthread_run(relocating_repair_kthread, cache,
8019 "btrfs-relocating-repair");
8024 static void map_raid56_repair_block(struct btrfs_io_context *bioc,
8025 struct btrfs_io_stripe *smap,
8028 int data_stripes = nr_bioc_data_stripes(bioc);
8031 for (i = 0; i < data_stripes; i++) {
8032 u64 stripe_start = bioc->full_stripe_logical +
8033 btrfs_stripe_nr_to_offset(i);
8035 if (logical >= stripe_start &&
8036 logical < stripe_start + BTRFS_STRIPE_LEN)
8039 ASSERT(i < data_stripes);
8040 smap->dev = bioc->stripes[i].dev;
8041 smap->physical = bioc->stripes[i].physical +
8042 ((logical - bioc->full_stripe_logical) &
8043 BTRFS_STRIPE_LEN_MASK);
8047 * Map a repair write into a single device.
8049 * A repair write is triggered by read time repair or scrub, which would only
8050 * update the contents of a single device.
8051 * Not update any other mirrors nor go through RMW path.
8053 * Callers should ensure:
8055 * - Call btrfs_bio_counter_inc_blocked() first
8056 * - The range does not cross stripe boundary
8057 * - Has a valid @mirror_num passed in.
8059 int btrfs_map_repair_block(struct btrfs_fs_info *fs_info,
8060 struct btrfs_io_stripe *smap, u64 logical,
8061 u32 length, int mirror_num)
8063 struct btrfs_io_context *bioc = NULL;
8064 u64 map_length = length;
8065 int mirror_ret = mirror_num;
8068 ASSERT(mirror_num > 0);
8070 ret = btrfs_map_block(fs_info, BTRFS_MAP_WRITE, logical, &map_length,
8071 &bioc, smap, &mirror_ret);
8075 /* The map range should not cross stripe boundary. */
8076 ASSERT(map_length >= length);
8078 /* Already mapped to single stripe. */
8082 /* Map the RAID56 multi-stripe writes to a single one. */
8083 if (bioc->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
8084 map_raid56_repair_block(bioc, smap, logical);
8088 ASSERT(mirror_num <= bioc->num_stripes);
8089 smap->dev = bioc->stripes[mirror_num - 1].dev;
8090 smap->physical = bioc->stripes[mirror_num - 1].physical;
8092 btrfs_put_bioc(bioc);