1 // SPDX-License-Identifier: GPL-2.0
3 * Copyright (C) 2007 Oracle. All rights reserved.
6 #include <linux/sched.h>
8 #include <linux/slab.h>
9 #include <linux/buffer_head.h>
10 #include <linux/blkdev.h>
11 #include <linux/iocontext.h>
12 #include <linux/capability.h>
13 #include <linux/ratelimit.h>
14 #include <linux/kthread.h>
15 #include <linux/raid/pq.h>
16 #include <linux/semaphore.h>
17 #include <linux/uuid.h>
18 #include <linux/list_sort.h>
19 #include <asm/div64.h>
21 #include "extent_map.h"
23 #include "transaction.h"
24 #include "print-tree.h"
27 #include "async-thread.h"
28 #include "check-integrity.h"
29 #include "rcu-string.h"
31 #include "dev-replace.h"
34 const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = {
35 [BTRFS_RAID_RAID10] = {
38 .devs_max = 0, /* 0 == as many as possible */
40 .tolerated_failures = 1,
44 [BTRFS_RAID_RAID1] = {
49 .tolerated_failures = 1,
58 .tolerated_failures = 0,
62 [BTRFS_RAID_RAID0] = {
67 .tolerated_failures = 0,
71 [BTRFS_RAID_SINGLE] = {
76 .tolerated_failures = 0,
80 [BTRFS_RAID_RAID5] = {
85 .tolerated_failures = 1,
89 [BTRFS_RAID_RAID6] = {
94 .tolerated_failures = 2,
100 const u64 btrfs_raid_group[BTRFS_NR_RAID_TYPES] = {
101 [BTRFS_RAID_RAID10] = BTRFS_BLOCK_GROUP_RAID10,
102 [BTRFS_RAID_RAID1] = BTRFS_BLOCK_GROUP_RAID1,
103 [BTRFS_RAID_DUP] = BTRFS_BLOCK_GROUP_DUP,
104 [BTRFS_RAID_RAID0] = BTRFS_BLOCK_GROUP_RAID0,
105 [BTRFS_RAID_SINGLE] = 0,
106 [BTRFS_RAID_RAID5] = BTRFS_BLOCK_GROUP_RAID5,
107 [BTRFS_RAID_RAID6] = BTRFS_BLOCK_GROUP_RAID6,
111 * Table to convert BTRFS_RAID_* to the error code if minimum number of devices
112 * condition is not met. Zero means there's no corresponding
113 * BTRFS_ERROR_DEV_*_NOT_MET value.
115 const int btrfs_raid_mindev_error[BTRFS_NR_RAID_TYPES] = {
116 [BTRFS_RAID_RAID10] = BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET,
117 [BTRFS_RAID_RAID1] = BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET,
118 [BTRFS_RAID_DUP] = 0,
119 [BTRFS_RAID_RAID0] = 0,
120 [BTRFS_RAID_SINGLE] = 0,
121 [BTRFS_RAID_RAID5] = BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET,
122 [BTRFS_RAID_RAID6] = BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET,
125 static int init_first_rw_device(struct btrfs_trans_handle *trans,
126 struct btrfs_fs_info *fs_info);
127 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info);
128 static void __btrfs_reset_dev_stats(struct btrfs_device *dev);
129 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev);
130 static void btrfs_dev_stat_print_on_load(struct btrfs_device *device);
131 static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
132 enum btrfs_map_op op,
133 u64 logical, u64 *length,
134 struct btrfs_bio **bbio_ret,
135 int mirror_num, int need_raid_map);
141 * There are several mutexes that protect manipulation of devices and low-level
142 * structures like chunks but not block groups, extents or files
144 * uuid_mutex (global lock)
145 * ------------------------
146 * protects the fs_uuids list that tracks all per-fs fs_devices, resulting from
147 * the SCAN_DEV ioctl registration or from mount either implicitly (the first
148 * device) or requested by the device= mount option
150 * the mutex can be very coarse and can cover long-running operations
152 * protects: updates to fs_devices counters like missing devices, rw devices,
153 * seeding, structure cloning, openning/closing devices at mount/umount time
155 * global::fs_devs - add, remove, updates to the global list
157 * does not protect: manipulation of the fs_devices::devices list!
159 * btrfs_device::name - renames (write side), read is RCU
161 * fs_devices::device_list_mutex (per-fs, with RCU)
162 * ------------------------------------------------
163 * protects updates to fs_devices::devices, ie. adding and deleting
165 * simple list traversal with read-only actions can be done with RCU protection
167 * may be used to exclude some operations from running concurrently without any
168 * modifications to the list (see write_all_supers)
172 * coarse lock owned by a mounted filesystem; used to exclude some operations
173 * that cannot run in parallel and affect the higher-level properties of the
174 * filesystem like: device add/deleting/resize/replace, or balance
178 * protects balance structures (status, state) and context accessed from
179 * several places (internally, ioctl)
183 * protects chunks, adding or removing during allocation, trim or when a new
184 * device is added/removed
188 * a big lock that is held by the cleaner thread and prevents running subvolume
189 * cleaning together with relocation or delayed iputs
202 DEFINE_MUTEX(uuid_mutex);
203 static LIST_HEAD(fs_uuids);
204 struct list_head *btrfs_get_fs_uuids(void)
210 * alloc_fs_devices - allocate struct btrfs_fs_devices
211 * @fsid: if not NULL, copy the uuid to fs_devices::fsid
213 * Return a pointer to a new struct btrfs_fs_devices on success, or ERR_PTR().
214 * The returned struct is not linked onto any lists and can be destroyed with
215 * kfree() right away.
217 static struct btrfs_fs_devices *alloc_fs_devices(const u8 *fsid)
219 struct btrfs_fs_devices *fs_devs;
221 fs_devs = kzalloc(sizeof(*fs_devs), GFP_KERNEL);
223 return ERR_PTR(-ENOMEM);
225 mutex_init(&fs_devs->device_list_mutex);
227 INIT_LIST_HEAD(&fs_devs->devices);
228 INIT_LIST_HEAD(&fs_devs->resized_devices);
229 INIT_LIST_HEAD(&fs_devs->alloc_list);
230 INIT_LIST_HEAD(&fs_devs->list);
232 memcpy(fs_devs->fsid, fsid, BTRFS_FSID_SIZE);
237 static void free_device(struct btrfs_device *device)
239 rcu_string_free(device->name);
240 bio_put(device->flush_bio);
244 static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
246 struct btrfs_device *device;
247 WARN_ON(fs_devices->opened);
248 while (!list_empty(&fs_devices->devices)) {
249 device = list_entry(fs_devices->devices.next,
250 struct btrfs_device, dev_list);
251 list_del(&device->dev_list);
257 static void btrfs_kobject_uevent(struct block_device *bdev,
258 enum kobject_action action)
262 ret = kobject_uevent(&disk_to_dev(bdev->bd_disk)->kobj, action);
264 pr_warn("BTRFS: Sending event '%d' to kobject: '%s' (%p): failed\n",
266 kobject_name(&disk_to_dev(bdev->bd_disk)->kobj),
267 &disk_to_dev(bdev->bd_disk)->kobj);
270 void __exit btrfs_cleanup_fs_uuids(void)
272 struct btrfs_fs_devices *fs_devices;
274 while (!list_empty(&fs_uuids)) {
275 fs_devices = list_entry(fs_uuids.next,
276 struct btrfs_fs_devices, list);
277 list_del(&fs_devices->list);
278 free_fs_devices(fs_devices);
283 * Returns a pointer to a new btrfs_device on success; ERR_PTR() on error.
284 * Returned struct is not linked onto any lists and must be destroyed using
287 static struct btrfs_device *__alloc_device(void)
289 struct btrfs_device *dev;
291 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
293 return ERR_PTR(-ENOMEM);
296 * Preallocate a bio that's always going to be used for flushing device
297 * barriers and matches the device lifespan
299 dev->flush_bio = bio_alloc_bioset(GFP_KERNEL, 0, NULL);
300 if (!dev->flush_bio) {
302 return ERR_PTR(-ENOMEM);
305 INIT_LIST_HEAD(&dev->dev_list);
306 INIT_LIST_HEAD(&dev->dev_alloc_list);
307 INIT_LIST_HEAD(&dev->resized_list);
309 spin_lock_init(&dev->io_lock);
311 atomic_set(&dev->reada_in_flight, 0);
312 atomic_set(&dev->dev_stats_ccnt, 0);
313 btrfs_device_data_ordered_init(dev);
314 INIT_RADIX_TREE(&dev->reada_zones, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
315 INIT_RADIX_TREE(&dev->reada_extents, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
321 * Find a device specified by @devid or @uuid in the list of @fs_devices, or
324 * If devid and uuid are both specified, the match must be exact, otherwise
325 * only devid is used.
327 static struct btrfs_device *find_device(struct btrfs_fs_devices *fs_devices,
328 u64 devid, const u8 *uuid)
330 struct list_head *head = &fs_devices->devices;
331 struct btrfs_device *dev;
333 list_for_each_entry(dev, head, dev_list) {
334 if (dev->devid == devid &&
335 (!uuid || !memcmp(dev->uuid, uuid, BTRFS_UUID_SIZE))) {
342 static noinline struct btrfs_fs_devices *find_fsid(u8 *fsid)
344 struct btrfs_fs_devices *fs_devices;
346 list_for_each_entry(fs_devices, &fs_uuids, list) {
347 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0)
354 btrfs_get_bdev_and_sb(const char *device_path, fmode_t flags, void *holder,
355 int flush, struct block_device **bdev,
356 struct buffer_head **bh)
360 *bdev = blkdev_get_by_path(device_path, flags, holder);
363 ret = PTR_ERR(*bdev);
368 filemap_write_and_wait((*bdev)->bd_inode->i_mapping);
369 ret = set_blocksize(*bdev, BTRFS_BDEV_BLOCKSIZE);
371 blkdev_put(*bdev, flags);
374 invalidate_bdev(*bdev);
375 *bh = btrfs_read_dev_super(*bdev);
378 blkdev_put(*bdev, flags);
390 static void requeue_list(struct btrfs_pending_bios *pending_bios,
391 struct bio *head, struct bio *tail)
394 struct bio *old_head;
396 old_head = pending_bios->head;
397 pending_bios->head = head;
398 if (pending_bios->tail)
399 tail->bi_next = old_head;
401 pending_bios->tail = tail;
405 * we try to collect pending bios for a device so we don't get a large
406 * number of procs sending bios down to the same device. This greatly
407 * improves the schedulers ability to collect and merge the bios.
409 * But, it also turns into a long list of bios to process and that is sure
410 * to eventually make the worker thread block. The solution here is to
411 * make some progress and then put this work struct back at the end of
412 * the list if the block device is congested. This way, multiple devices
413 * can make progress from a single worker thread.
415 static noinline void run_scheduled_bios(struct btrfs_device *device)
417 struct btrfs_fs_info *fs_info = device->fs_info;
419 struct backing_dev_info *bdi;
420 struct btrfs_pending_bios *pending_bios;
424 unsigned long num_run;
425 unsigned long batch_run = 0;
426 unsigned long last_waited = 0;
428 int sync_pending = 0;
429 struct blk_plug plug;
432 * this function runs all the bios we've collected for
433 * a particular device. We don't want to wander off to
434 * another device without first sending all of these down.
435 * So, setup a plug here and finish it off before we return
437 blk_start_plug(&plug);
439 bdi = device->bdev->bd_bdi;
442 spin_lock(&device->io_lock);
447 /* take all the bios off the list at once and process them
448 * later on (without the lock held). But, remember the
449 * tail and other pointers so the bios can be properly reinserted
450 * into the list if we hit congestion
452 if (!force_reg && device->pending_sync_bios.head) {
453 pending_bios = &device->pending_sync_bios;
456 pending_bios = &device->pending_bios;
460 pending = pending_bios->head;
461 tail = pending_bios->tail;
462 WARN_ON(pending && !tail);
465 * if pending was null this time around, no bios need processing
466 * at all and we can stop. Otherwise it'll loop back up again
467 * and do an additional check so no bios are missed.
469 * device->running_pending is used to synchronize with the
472 if (device->pending_sync_bios.head == NULL &&
473 device->pending_bios.head == NULL) {
475 device->running_pending = 0;
478 device->running_pending = 1;
481 pending_bios->head = NULL;
482 pending_bios->tail = NULL;
484 spin_unlock(&device->io_lock);
489 /* we want to work on both lists, but do more bios on the
490 * sync list than the regular list
493 pending_bios != &device->pending_sync_bios &&
494 device->pending_sync_bios.head) ||
495 (num_run > 64 && pending_bios == &device->pending_sync_bios &&
496 device->pending_bios.head)) {
497 spin_lock(&device->io_lock);
498 requeue_list(pending_bios, pending, tail);
503 pending = pending->bi_next;
506 BUG_ON(atomic_read(&cur->__bi_cnt) == 0);
509 * if we're doing the sync list, record that our
510 * plug has some sync requests on it
512 * If we're doing the regular list and there are
513 * sync requests sitting around, unplug before
516 if (pending_bios == &device->pending_sync_bios) {
518 } else if (sync_pending) {
519 blk_finish_plug(&plug);
520 blk_start_plug(&plug);
524 btrfsic_submit_bio(cur);
531 * we made progress, there is more work to do and the bdi
532 * is now congested. Back off and let other work structs
535 if (pending && bdi_write_congested(bdi) && batch_run > 8 &&
536 fs_info->fs_devices->open_devices > 1) {
537 struct io_context *ioc;
539 ioc = current->io_context;
542 * the main goal here is that we don't want to
543 * block if we're going to be able to submit
544 * more requests without blocking.
546 * This code does two great things, it pokes into
547 * the elevator code from a filesystem _and_
548 * it makes assumptions about how batching works.
550 if (ioc && ioc->nr_batch_requests > 0 &&
551 time_before(jiffies, ioc->last_waited + HZ/50UL) &&
553 ioc->last_waited == last_waited)) {
555 * we want to go through our batch of
556 * requests and stop. So, we copy out
557 * the ioc->last_waited time and test
558 * against it before looping
560 last_waited = ioc->last_waited;
564 spin_lock(&device->io_lock);
565 requeue_list(pending_bios, pending, tail);
566 device->running_pending = 1;
568 spin_unlock(&device->io_lock);
569 btrfs_queue_work(fs_info->submit_workers,
579 spin_lock(&device->io_lock);
580 if (device->pending_bios.head || device->pending_sync_bios.head)
582 spin_unlock(&device->io_lock);
585 blk_finish_plug(&plug);
588 static void pending_bios_fn(struct btrfs_work *work)
590 struct btrfs_device *device;
592 device = container_of(work, struct btrfs_device, work);
593 run_scheduled_bios(device);
597 * Search and remove all stale (devices which are not mounted) devices.
598 * When both inputs are NULL, it will search and release all stale devices.
599 * path: Optional. When provided will it release all unmounted devices
600 * matching this path only.
601 * skip_dev: Optional. Will skip this device when searching for the stale
604 static void btrfs_free_stale_devices(const char *path,
605 struct btrfs_device *skip_dev)
607 struct btrfs_fs_devices *fs_devs, *tmp_fs_devs;
608 struct btrfs_device *dev, *tmp_dev;
610 list_for_each_entry_safe(fs_devs, tmp_fs_devs, &fs_uuids, list) {
615 list_for_each_entry_safe(dev, tmp_dev,
616 &fs_devs->devices, dev_list) {
619 if (skip_dev && skip_dev == dev)
621 if (path && !dev->name)
626 not_found = strcmp(rcu_str_deref(dev->name),
632 /* delete the stale device */
633 if (fs_devs->num_devices == 1) {
634 btrfs_sysfs_remove_fsid(fs_devs);
635 list_del(&fs_devs->list);
636 free_fs_devices(fs_devs);
639 fs_devs->num_devices--;
640 list_del(&dev->dev_list);
647 static int btrfs_open_one_device(struct btrfs_fs_devices *fs_devices,
648 struct btrfs_device *device, fmode_t flags,
651 struct request_queue *q;
652 struct block_device *bdev;
653 struct buffer_head *bh;
654 struct btrfs_super_block *disk_super;
663 ret = btrfs_get_bdev_and_sb(device->name->str, flags, holder, 1,
668 disk_super = (struct btrfs_super_block *)bh->b_data;
669 devid = btrfs_stack_device_id(&disk_super->dev_item);
670 if (devid != device->devid)
673 if (memcmp(device->uuid, disk_super->dev_item.uuid, BTRFS_UUID_SIZE))
676 device->generation = btrfs_super_generation(disk_super);
678 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) {
679 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
680 fs_devices->seeding = 1;
682 if (bdev_read_only(bdev))
683 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
685 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
688 q = bdev_get_queue(bdev);
689 if (!blk_queue_nonrot(q))
690 fs_devices->rotating = 1;
693 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
694 device->mode = flags;
696 fs_devices->open_devices++;
697 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
698 device->devid != BTRFS_DEV_REPLACE_DEVID) {
699 fs_devices->rw_devices++;
700 list_add_tail(&device->dev_alloc_list, &fs_devices->alloc_list);
708 blkdev_put(bdev, flags);
714 * Add new device to list of registered devices
717 * device pointer which was just added or updated when successful
718 * error pointer when failed
720 static noinline struct btrfs_device *device_list_add(const char *path,
721 struct btrfs_super_block *disk_super)
723 struct btrfs_device *device;
724 struct btrfs_fs_devices *fs_devices;
725 struct rcu_string *name;
726 u64 found_transid = btrfs_super_generation(disk_super);
727 u64 devid = btrfs_stack_device_id(&disk_super->dev_item);
729 fs_devices = find_fsid(disk_super->fsid);
731 fs_devices = alloc_fs_devices(disk_super->fsid);
732 if (IS_ERR(fs_devices))
733 return ERR_CAST(fs_devices);
735 list_add(&fs_devices->list, &fs_uuids);
739 device = find_device(fs_devices, devid,
740 disk_super->dev_item.uuid);
744 if (fs_devices->opened)
745 return ERR_PTR(-EBUSY);
747 device = btrfs_alloc_device(NULL, &devid,
748 disk_super->dev_item.uuid);
749 if (IS_ERR(device)) {
750 /* we can safely leave the fs_devices entry around */
754 name = rcu_string_strdup(path, GFP_NOFS);
757 return ERR_PTR(-ENOMEM);
759 rcu_assign_pointer(device->name, name);
761 mutex_lock(&fs_devices->device_list_mutex);
762 list_add_rcu(&device->dev_list, &fs_devices->devices);
763 fs_devices->num_devices++;
764 mutex_unlock(&fs_devices->device_list_mutex);
766 device->fs_devices = fs_devices;
767 btrfs_free_stale_devices(path, device);
769 if (disk_super->label[0])
770 pr_info("BTRFS: device label %s devid %llu transid %llu %s\n",
771 disk_super->label, devid, found_transid, path);
773 pr_info("BTRFS: device fsid %pU devid %llu transid %llu %s\n",
774 disk_super->fsid, devid, found_transid, path);
776 } else if (!device->name || strcmp(device->name->str, path)) {
778 * When FS is already mounted.
779 * 1. If you are here and if the device->name is NULL that
780 * means this device was missing at time of FS mount.
781 * 2. If you are here and if the device->name is different
782 * from 'path' that means either
783 * a. The same device disappeared and reappeared with
785 * b. The missing-disk-which-was-replaced, has
788 * We must allow 1 and 2a above. But 2b would be a spurious
791 * Further in case of 1 and 2a above, the disk at 'path'
792 * would have missed some transaction when it was away and
793 * in case of 2a the stale bdev has to be updated as well.
794 * 2b must not be allowed at all time.
798 * For now, we do allow update to btrfs_fs_device through the
799 * btrfs dev scan cli after FS has been mounted. We're still
800 * tracking a problem where systems fail mount by subvolume id
801 * when we reject replacement on a mounted FS.
803 if (!fs_devices->opened && found_transid < device->generation) {
805 * That is if the FS is _not_ mounted and if you
806 * are here, that means there is more than one
807 * disk with same uuid and devid.We keep the one
808 * with larger generation number or the last-in if
809 * generation are equal.
811 return ERR_PTR(-EEXIST);
814 name = rcu_string_strdup(path, GFP_NOFS);
816 return ERR_PTR(-ENOMEM);
817 rcu_string_free(device->name);
818 rcu_assign_pointer(device->name, name);
819 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
820 fs_devices->missing_devices--;
821 clear_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
826 * Unmount does not free the btrfs_device struct but would zero
827 * generation along with most of the other members. So just update
828 * it back. We need it to pick the disk with largest generation
831 if (!fs_devices->opened)
832 device->generation = found_transid;
834 fs_devices->total_devices = btrfs_super_num_devices(disk_super);
839 static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig)
841 struct btrfs_fs_devices *fs_devices;
842 struct btrfs_device *device;
843 struct btrfs_device *orig_dev;
845 fs_devices = alloc_fs_devices(orig->fsid);
846 if (IS_ERR(fs_devices))
849 mutex_lock(&orig->device_list_mutex);
850 fs_devices->total_devices = orig->total_devices;
852 /* We have held the volume lock, it is safe to get the devices. */
853 list_for_each_entry(orig_dev, &orig->devices, dev_list) {
854 struct rcu_string *name;
856 device = btrfs_alloc_device(NULL, &orig_dev->devid,
862 * This is ok to do without rcu read locked because we hold the
863 * uuid mutex so nothing we touch in here is going to disappear.
865 if (orig_dev->name) {
866 name = rcu_string_strdup(orig_dev->name->str,
872 rcu_assign_pointer(device->name, name);
875 list_add(&device->dev_list, &fs_devices->devices);
876 device->fs_devices = fs_devices;
877 fs_devices->num_devices++;
879 mutex_unlock(&orig->device_list_mutex);
882 mutex_unlock(&orig->device_list_mutex);
883 free_fs_devices(fs_devices);
884 return ERR_PTR(-ENOMEM);
888 * After we have read the system tree and know devids belonging to
889 * this filesystem, remove the device which does not belong there.
891 void btrfs_free_extra_devids(struct btrfs_fs_devices *fs_devices, int step)
893 struct btrfs_device *device, *next;
894 struct btrfs_device *latest_dev = NULL;
896 mutex_lock(&uuid_mutex);
898 /* This is the initialized path, it is safe to release the devices. */
899 list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) {
900 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
901 &device->dev_state)) {
902 if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT,
903 &device->dev_state) &&
905 device->generation > latest_dev->generation)) {
911 if (device->devid == BTRFS_DEV_REPLACE_DEVID) {
913 * In the first step, keep the device which has
914 * the correct fsid and the devid that is used
915 * for the dev_replace procedure.
916 * In the second step, the dev_replace state is
917 * read from the device tree and it is known
918 * whether the procedure is really active or
919 * not, which means whether this device is
920 * used or whether it should be removed.
922 if (step == 0 || test_bit(BTRFS_DEV_STATE_REPLACE_TGT,
923 &device->dev_state)) {
928 blkdev_put(device->bdev, device->mode);
930 fs_devices->open_devices--;
932 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
933 list_del_init(&device->dev_alloc_list);
934 clear_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
935 if (!test_bit(BTRFS_DEV_STATE_REPLACE_TGT,
937 fs_devices->rw_devices--;
939 list_del_init(&device->dev_list);
940 fs_devices->num_devices--;
944 if (fs_devices->seed) {
945 fs_devices = fs_devices->seed;
949 fs_devices->latest_bdev = latest_dev->bdev;
951 mutex_unlock(&uuid_mutex);
954 static void free_device_rcu(struct rcu_head *head)
956 struct btrfs_device *device;
958 device = container_of(head, struct btrfs_device, rcu);
962 static void btrfs_close_bdev(struct btrfs_device *device)
967 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
968 sync_blockdev(device->bdev);
969 invalidate_bdev(device->bdev);
972 blkdev_put(device->bdev, device->mode);
975 static void btrfs_prepare_close_one_device(struct btrfs_device *device)
977 struct btrfs_fs_devices *fs_devices = device->fs_devices;
978 struct btrfs_device *new_device;
979 struct rcu_string *name;
982 fs_devices->open_devices--;
984 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
985 device->devid != BTRFS_DEV_REPLACE_DEVID) {
986 list_del_init(&device->dev_alloc_list);
987 fs_devices->rw_devices--;
990 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state))
991 fs_devices->missing_devices--;
993 new_device = btrfs_alloc_device(NULL, &device->devid,
995 BUG_ON(IS_ERR(new_device)); /* -ENOMEM */
997 /* Safe because we are under uuid_mutex */
999 name = rcu_string_strdup(device->name->str, GFP_NOFS);
1000 BUG_ON(!name); /* -ENOMEM */
1001 rcu_assign_pointer(new_device->name, name);
1004 list_replace_rcu(&device->dev_list, &new_device->dev_list);
1005 new_device->fs_devices = device->fs_devices;
1008 static int __btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
1010 struct btrfs_device *device, *tmp;
1011 struct list_head pending_put;
1013 INIT_LIST_HEAD(&pending_put);
1015 if (--fs_devices->opened > 0)
1018 mutex_lock(&fs_devices->device_list_mutex);
1019 list_for_each_entry_safe(device, tmp, &fs_devices->devices, dev_list) {
1020 btrfs_prepare_close_one_device(device);
1021 list_add(&device->dev_list, &pending_put);
1023 mutex_unlock(&fs_devices->device_list_mutex);
1026 * btrfs_show_devname() is using the device_list_mutex,
1027 * sometimes call to blkdev_put() leads vfs calling
1028 * into this func. So do put outside of device_list_mutex,
1031 while (!list_empty(&pending_put)) {
1032 device = list_first_entry(&pending_put,
1033 struct btrfs_device, dev_list);
1034 list_del(&device->dev_list);
1035 btrfs_close_bdev(device);
1036 call_rcu(&device->rcu, free_device_rcu);
1039 WARN_ON(fs_devices->open_devices);
1040 WARN_ON(fs_devices->rw_devices);
1041 fs_devices->opened = 0;
1042 fs_devices->seeding = 0;
1047 int btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
1049 struct btrfs_fs_devices *seed_devices = NULL;
1052 mutex_lock(&uuid_mutex);
1053 ret = __btrfs_close_devices(fs_devices);
1054 if (!fs_devices->opened) {
1055 seed_devices = fs_devices->seed;
1056 fs_devices->seed = NULL;
1058 mutex_unlock(&uuid_mutex);
1060 while (seed_devices) {
1061 fs_devices = seed_devices;
1062 seed_devices = fs_devices->seed;
1063 __btrfs_close_devices(fs_devices);
1064 free_fs_devices(fs_devices);
1069 static int __btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
1070 fmode_t flags, void *holder)
1072 struct list_head *head = &fs_devices->devices;
1073 struct btrfs_device *device;
1074 struct btrfs_device *latest_dev = NULL;
1077 flags |= FMODE_EXCL;
1079 list_for_each_entry(device, head, dev_list) {
1080 /* Just open everything we can; ignore failures here */
1081 if (btrfs_open_one_device(fs_devices, device, flags, holder))
1085 device->generation > latest_dev->generation)
1086 latest_dev = device;
1088 if (fs_devices->open_devices == 0) {
1092 fs_devices->opened = 1;
1093 fs_devices->latest_bdev = latest_dev->bdev;
1094 fs_devices->total_rw_bytes = 0;
1099 static int devid_cmp(void *priv, struct list_head *a, struct list_head *b)
1101 struct btrfs_device *dev1, *dev2;
1103 dev1 = list_entry(a, struct btrfs_device, dev_list);
1104 dev2 = list_entry(b, struct btrfs_device, dev_list);
1106 if (dev1->devid < dev2->devid)
1108 else if (dev1->devid > dev2->devid)
1113 int btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
1114 fmode_t flags, void *holder)
1118 mutex_lock(&uuid_mutex);
1119 if (fs_devices->opened) {
1120 fs_devices->opened++;
1123 list_sort(NULL, &fs_devices->devices, devid_cmp);
1124 ret = __btrfs_open_devices(fs_devices, flags, holder);
1126 mutex_unlock(&uuid_mutex);
1130 static void btrfs_release_disk_super(struct page *page)
1136 static int btrfs_read_disk_super(struct block_device *bdev, u64 bytenr,
1138 struct btrfs_super_block **disk_super)
1143 /* make sure our super fits in the device */
1144 if (bytenr + PAGE_SIZE >= i_size_read(bdev->bd_inode))
1147 /* make sure our super fits in the page */
1148 if (sizeof(**disk_super) > PAGE_SIZE)
1151 /* make sure our super doesn't straddle pages on disk */
1152 index = bytenr >> PAGE_SHIFT;
1153 if ((bytenr + sizeof(**disk_super) - 1) >> PAGE_SHIFT != index)
1156 /* pull in the page with our super */
1157 *page = read_cache_page_gfp(bdev->bd_inode->i_mapping,
1160 if (IS_ERR_OR_NULL(*page))
1165 /* align our pointer to the offset of the super block */
1166 *disk_super = p + (bytenr & ~PAGE_MASK);
1168 if (btrfs_super_bytenr(*disk_super) != bytenr ||
1169 btrfs_super_magic(*disk_super) != BTRFS_MAGIC) {
1170 btrfs_release_disk_super(*page);
1174 if ((*disk_super)->label[0] &&
1175 (*disk_super)->label[BTRFS_LABEL_SIZE - 1])
1176 (*disk_super)->label[BTRFS_LABEL_SIZE - 1] = '\0';
1182 * Look for a btrfs signature on a device. This may be called out of the mount path
1183 * and we are not allowed to call set_blocksize during the scan. The superblock
1184 * is read via pagecache
1186 int btrfs_scan_one_device(const char *path, fmode_t flags, void *holder,
1187 struct btrfs_fs_devices **fs_devices_ret)
1189 struct btrfs_super_block *disk_super;
1190 struct btrfs_device *device;
1191 struct block_device *bdev;
1197 * we would like to check all the supers, but that would make
1198 * a btrfs mount succeed after a mkfs from a different FS.
1199 * So, we need to add a special mount option to scan for
1200 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
1202 bytenr = btrfs_sb_offset(0);
1203 flags |= FMODE_EXCL;
1204 mutex_lock(&uuid_mutex);
1206 bdev = blkdev_get_by_path(path, flags, holder);
1208 ret = PTR_ERR(bdev);
1212 if (btrfs_read_disk_super(bdev, bytenr, &page, &disk_super)) {
1214 goto error_bdev_put;
1217 device = device_list_add(path, disk_super);
1219 ret = PTR_ERR(device);
1221 *fs_devices_ret = device->fs_devices;
1223 btrfs_release_disk_super(page);
1226 blkdev_put(bdev, flags);
1228 mutex_unlock(&uuid_mutex);
1232 /* helper to account the used device space in the range */
1233 int btrfs_account_dev_extents_size(struct btrfs_device *device, u64 start,
1234 u64 end, u64 *length)
1236 struct btrfs_key key;
1237 struct btrfs_root *root = device->fs_info->dev_root;
1238 struct btrfs_dev_extent *dev_extent;
1239 struct btrfs_path *path;
1243 struct extent_buffer *l;
1247 if (start >= device->total_bytes ||
1248 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
1251 path = btrfs_alloc_path();
1254 path->reada = READA_FORWARD;
1256 key.objectid = device->devid;
1258 key.type = BTRFS_DEV_EXTENT_KEY;
1260 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1264 ret = btrfs_previous_item(root, path, key.objectid, key.type);
1271 slot = path->slots[0];
1272 if (slot >= btrfs_header_nritems(l)) {
1273 ret = btrfs_next_leaf(root, path);
1281 btrfs_item_key_to_cpu(l, &key, slot);
1283 if (key.objectid < device->devid)
1286 if (key.objectid > device->devid)
1289 if (key.type != BTRFS_DEV_EXTENT_KEY)
1292 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1293 extent_end = key.offset + btrfs_dev_extent_length(l,
1295 if (key.offset <= start && extent_end > end) {
1296 *length = end - start + 1;
1298 } else if (key.offset <= start && extent_end > start)
1299 *length += extent_end - start;
1300 else if (key.offset > start && extent_end <= end)
1301 *length += extent_end - key.offset;
1302 else if (key.offset > start && key.offset <= end) {
1303 *length += end - key.offset + 1;
1305 } else if (key.offset > end)
1313 btrfs_free_path(path);
1317 static int contains_pending_extent(struct btrfs_transaction *transaction,
1318 struct btrfs_device *device,
1319 u64 *start, u64 len)
1321 struct btrfs_fs_info *fs_info = device->fs_info;
1322 struct extent_map *em;
1323 struct list_head *search_list = &fs_info->pinned_chunks;
1325 u64 physical_start = *start;
1328 search_list = &transaction->pending_chunks;
1330 list_for_each_entry(em, search_list, list) {
1331 struct map_lookup *map;
1334 map = em->map_lookup;
1335 for (i = 0; i < map->num_stripes; i++) {
1338 if (map->stripes[i].dev != device)
1340 if (map->stripes[i].physical >= physical_start + len ||
1341 map->stripes[i].physical + em->orig_block_len <=
1345 * Make sure that while processing the pinned list we do
1346 * not override our *start with a lower value, because
1347 * we can have pinned chunks that fall within this
1348 * device hole and that have lower physical addresses
1349 * than the pending chunks we processed before. If we
1350 * do not take this special care we can end up getting
1351 * 2 pending chunks that start at the same physical
1352 * device offsets because the end offset of a pinned
1353 * chunk can be equal to the start offset of some
1356 end = map->stripes[i].physical + em->orig_block_len;
1363 if (search_list != &fs_info->pinned_chunks) {
1364 search_list = &fs_info->pinned_chunks;
1373 * find_free_dev_extent_start - find free space in the specified device
1374 * @device: the device which we search the free space in
1375 * @num_bytes: the size of the free space that we need
1376 * @search_start: the position from which to begin the search
1377 * @start: store the start of the free space.
1378 * @len: the size of the free space. that we find, or the size
1379 * of the max free space if we don't find suitable free space
1381 * this uses a pretty simple search, the expectation is that it is
1382 * called very infrequently and that a given device has a small number
1385 * @start is used to store the start of the free space if we find. But if we
1386 * don't find suitable free space, it will be used to store the start position
1387 * of the max free space.
1389 * @len is used to store the size of the free space that we find.
1390 * But if we don't find suitable free space, it is used to store the size of
1391 * the max free space.
1393 int find_free_dev_extent_start(struct btrfs_transaction *transaction,
1394 struct btrfs_device *device, u64 num_bytes,
1395 u64 search_start, u64 *start, u64 *len)
1397 struct btrfs_fs_info *fs_info = device->fs_info;
1398 struct btrfs_root *root = fs_info->dev_root;
1399 struct btrfs_key key;
1400 struct btrfs_dev_extent *dev_extent;
1401 struct btrfs_path *path;
1406 u64 search_end = device->total_bytes;
1409 struct extent_buffer *l;
1412 * We don't want to overwrite the superblock on the drive nor any area
1413 * used by the boot loader (grub for example), so we make sure to start
1414 * at an offset of at least 1MB.
1416 search_start = max_t(u64, search_start, SZ_1M);
1418 path = btrfs_alloc_path();
1422 max_hole_start = search_start;
1426 if (search_start >= search_end ||
1427 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
1432 path->reada = READA_FORWARD;
1433 path->search_commit_root = 1;
1434 path->skip_locking = 1;
1436 key.objectid = device->devid;
1437 key.offset = search_start;
1438 key.type = BTRFS_DEV_EXTENT_KEY;
1440 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1444 ret = btrfs_previous_item(root, path, key.objectid, key.type);
1451 slot = path->slots[0];
1452 if (slot >= btrfs_header_nritems(l)) {
1453 ret = btrfs_next_leaf(root, path);
1461 btrfs_item_key_to_cpu(l, &key, slot);
1463 if (key.objectid < device->devid)
1466 if (key.objectid > device->devid)
1469 if (key.type != BTRFS_DEV_EXTENT_KEY)
1472 if (key.offset > search_start) {
1473 hole_size = key.offset - search_start;
1476 * Have to check before we set max_hole_start, otherwise
1477 * we could end up sending back this offset anyway.
1479 if (contains_pending_extent(transaction, device,
1482 if (key.offset >= search_start) {
1483 hole_size = key.offset - search_start;
1490 if (hole_size > max_hole_size) {
1491 max_hole_start = search_start;
1492 max_hole_size = hole_size;
1496 * If this free space is greater than which we need,
1497 * it must be the max free space that we have found
1498 * until now, so max_hole_start must point to the start
1499 * of this free space and the length of this free space
1500 * is stored in max_hole_size. Thus, we return
1501 * max_hole_start and max_hole_size and go back to the
1504 if (hole_size >= num_bytes) {
1510 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1511 extent_end = key.offset + btrfs_dev_extent_length(l,
1513 if (extent_end > search_start)
1514 search_start = extent_end;
1521 * At this point, search_start should be the end of
1522 * allocated dev extents, and when shrinking the device,
1523 * search_end may be smaller than search_start.
1525 if (search_end > search_start) {
1526 hole_size = search_end - search_start;
1528 if (contains_pending_extent(transaction, device, &search_start,
1530 btrfs_release_path(path);
1534 if (hole_size > max_hole_size) {
1535 max_hole_start = search_start;
1536 max_hole_size = hole_size;
1541 if (max_hole_size < num_bytes)
1547 btrfs_free_path(path);
1548 *start = max_hole_start;
1550 *len = max_hole_size;
1554 int find_free_dev_extent(struct btrfs_trans_handle *trans,
1555 struct btrfs_device *device, u64 num_bytes,
1556 u64 *start, u64 *len)
1558 /* FIXME use last free of some kind */
1559 return find_free_dev_extent_start(trans->transaction, device,
1560 num_bytes, 0, start, len);
1563 static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans,
1564 struct btrfs_device *device,
1565 u64 start, u64 *dev_extent_len)
1567 struct btrfs_fs_info *fs_info = device->fs_info;
1568 struct btrfs_root *root = fs_info->dev_root;
1570 struct btrfs_path *path;
1571 struct btrfs_key key;
1572 struct btrfs_key found_key;
1573 struct extent_buffer *leaf = NULL;
1574 struct btrfs_dev_extent *extent = NULL;
1576 path = btrfs_alloc_path();
1580 key.objectid = device->devid;
1582 key.type = BTRFS_DEV_EXTENT_KEY;
1584 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1586 ret = btrfs_previous_item(root, path, key.objectid,
1587 BTRFS_DEV_EXTENT_KEY);
1590 leaf = path->nodes[0];
1591 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1592 extent = btrfs_item_ptr(leaf, path->slots[0],
1593 struct btrfs_dev_extent);
1594 BUG_ON(found_key.offset > start || found_key.offset +
1595 btrfs_dev_extent_length(leaf, extent) < start);
1597 btrfs_release_path(path);
1599 } else if (ret == 0) {
1600 leaf = path->nodes[0];
1601 extent = btrfs_item_ptr(leaf, path->slots[0],
1602 struct btrfs_dev_extent);
1604 btrfs_handle_fs_error(fs_info, ret, "Slot search failed");
1608 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1610 ret = btrfs_del_item(trans, root, path);
1612 btrfs_handle_fs_error(fs_info, ret,
1613 "Failed to remove dev extent item");
1615 set_bit(BTRFS_TRANS_HAVE_FREE_BGS, &trans->transaction->flags);
1618 btrfs_free_path(path);
1622 static int btrfs_alloc_dev_extent(struct btrfs_trans_handle *trans,
1623 struct btrfs_device *device,
1624 u64 chunk_offset, u64 start, u64 num_bytes)
1627 struct btrfs_path *path;
1628 struct btrfs_fs_info *fs_info = device->fs_info;
1629 struct btrfs_root *root = fs_info->dev_root;
1630 struct btrfs_dev_extent *extent;
1631 struct extent_buffer *leaf;
1632 struct btrfs_key key;
1634 WARN_ON(!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state));
1635 WARN_ON(test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state));
1636 path = btrfs_alloc_path();
1640 key.objectid = device->devid;
1642 key.type = BTRFS_DEV_EXTENT_KEY;
1643 ret = btrfs_insert_empty_item(trans, root, path, &key,
1648 leaf = path->nodes[0];
1649 extent = btrfs_item_ptr(leaf, path->slots[0],
1650 struct btrfs_dev_extent);
1651 btrfs_set_dev_extent_chunk_tree(leaf, extent,
1652 BTRFS_CHUNK_TREE_OBJECTID);
1653 btrfs_set_dev_extent_chunk_objectid(leaf, extent,
1654 BTRFS_FIRST_CHUNK_TREE_OBJECTID);
1655 btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset);
1657 btrfs_set_dev_extent_length(leaf, extent, num_bytes);
1658 btrfs_mark_buffer_dirty(leaf);
1660 btrfs_free_path(path);
1664 static u64 find_next_chunk(struct btrfs_fs_info *fs_info)
1666 struct extent_map_tree *em_tree;
1667 struct extent_map *em;
1671 em_tree = &fs_info->mapping_tree.map_tree;
1672 read_lock(&em_tree->lock);
1673 n = rb_last(&em_tree->map);
1675 em = rb_entry(n, struct extent_map, rb_node);
1676 ret = em->start + em->len;
1678 read_unlock(&em_tree->lock);
1683 static noinline int find_next_devid(struct btrfs_fs_info *fs_info,
1687 struct btrfs_key key;
1688 struct btrfs_key found_key;
1689 struct btrfs_path *path;
1691 path = btrfs_alloc_path();
1695 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1696 key.type = BTRFS_DEV_ITEM_KEY;
1697 key.offset = (u64)-1;
1699 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
1703 BUG_ON(ret == 0); /* Corruption */
1705 ret = btrfs_previous_item(fs_info->chunk_root, path,
1706 BTRFS_DEV_ITEMS_OBJECTID,
1707 BTRFS_DEV_ITEM_KEY);
1711 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1713 *devid_ret = found_key.offset + 1;
1717 btrfs_free_path(path);
1722 * the device information is stored in the chunk root
1723 * the btrfs_device struct should be fully filled in
1725 static int btrfs_add_dev_item(struct btrfs_trans_handle *trans,
1726 struct btrfs_fs_info *fs_info,
1727 struct btrfs_device *device)
1729 struct btrfs_root *root = fs_info->chunk_root;
1731 struct btrfs_path *path;
1732 struct btrfs_dev_item *dev_item;
1733 struct extent_buffer *leaf;
1734 struct btrfs_key key;
1737 path = btrfs_alloc_path();
1741 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1742 key.type = BTRFS_DEV_ITEM_KEY;
1743 key.offset = device->devid;
1745 ret = btrfs_insert_empty_item(trans, root, path, &key,
1750 leaf = path->nodes[0];
1751 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1753 btrfs_set_device_id(leaf, dev_item, device->devid);
1754 btrfs_set_device_generation(leaf, dev_item, 0);
1755 btrfs_set_device_type(leaf, dev_item, device->type);
1756 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1757 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1758 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1759 btrfs_set_device_total_bytes(leaf, dev_item,
1760 btrfs_device_get_disk_total_bytes(device));
1761 btrfs_set_device_bytes_used(leaf, dev_item,
1762 btrfs_device_get_bytes_used(device));
1763 btrfs_set_device_group(leaf, dev_item, 0);
1764 btrfs_set_device_seek_speed(leaf, dev_item, 0);
1765 btrfs_set_device_bandwidth(leaf, dev_item, 0);
1766 btrfs_set_device_start_offset(leaf, dev_item, 0);
1768 ptr = btrfs_device_uuid(dev_item);
1769 write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
1770 ptr = btrfs_device_fsid(dev_item);
1771 write_extent_buffer(leaf, fs_info->fsid, ptr, BTRFS_FSID_SIZE);
1772 btrfs_mark_buffer_dirty(leaf);
1776 btrfs_free_path(path);
1781 * Function to update ctime/mtime for a given device path.
1782 * Mainly used for ctime/mtime based probe like libblkid.
1784 static void update_dev_time(const char *path_name)
1788 filp = filp_open(path_name, O_RDWR, 0);
1791 file_update_time(filp);
1792 filp_close(filp, NULL);
1795 static int btrfs_rm_dev_item(struct btrfs_fs_info *fs_info,
1796 struct btrfs_device *device)
1798 struct btrfs_root *root = fs_info->chunk_root;
1800 struct btrfs_path *path;
1801 struct btrfs_key key;
1802 struct btrfs_trans_handle *trans;
1804 path = btrfs_alloc_path();
1808 trans = btrfs_start_transaction(root, 0);
1809 if (IS_ERR(trans)) {
1810 btrfs_free_path(path);
1811 return PTR_ERR(trans);
1813 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1814 key.type = BTRFS_DEV_ITEM_KEY;
1815 key.offset = device->devid;
1817 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1821 btrfs_abort_transaction(trans, ret);
1822 btrfs_end_transaction(trans);
1826 ret = btrfs_del_item(trans, root, path);
1828 btrfs_abort_transaction(trans, ret);
1829 btrfs_end_transaction(trans);
1833 btrfs_free_path(path);
1835 ret = btrfs_commit_transaction(trans);
1840 * Verify that @num_devices satisfies the RAID profile constraints in the whole
1841 * filesystem. It's up to the caller to adjust that number regarding eg. device
1844 static int btrfs_check_raid_min_devices(struct btrfs_fs_info *fs_info,
1852 seq = read_seqbegin(&fs_info->profiles_lock);
1854 all_avail = fs_info->avail_data_alloc_bits |
1855 fs_info->avail_system_alloc_bits |
1856 fs_info->avail_metadata_alloc_bits;
1857 } while (read_seqretry(&fs_info->profiles_lock, seq));
1859 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
1860 if (!(all_avail & btrfs_raid_group[i]))
1863 if (num_devices < btrfs_raid_array[i].devs_min) {
1864 int ret = btrfs_raid_mindev_error[i];
1874 static struct btrfs_device * btrfs_find_next_active_device(
1875 struct btrfs_fs_devices *fs_devs, struct btrfs_device *device)
1877 struct btrfs_device *next_device;
1879 list_for_each_entry(next_device, &fs_devs->devices, dev_list) {
1880 if (next_device != device &&
1881 !test_bit(BTRFS_DEV_STATE_MISSING, &next_device->dev_state)
1882 && next_device->bdev)
1890 * Helper function to check if the given device is part of s_bdev / latest_bdev
1891 * and replace it with the provided or the next active device, in the context
1892 * where this function called, there should be always be another device (or
1893 * this_dev) which is active.
1895 void btrfs_assign_next_active_device(struct btrfs_fs_info *fs_info,
1896 struct btrfs_device *device, struct btrfs_device *this_dev)
1898 struct btrfs_device *next_device;
1901 next_device = this_dev;
1903 next_device = btrfs_find_next_active_device(fs_info->fs_devices,
1905 ASSERT(next_device);
1907 if (fs_info->sb->s_bdev &&
1908 (fs_info->sb->s_bdev == device->bdev))
1909 fs_info->sb->s_bdev = next_device->bdev;
1911 if (fs_info->fs_devices->latest_bdev == device->bdev)
1912 fs_info->fs_devices->latest_bdev = next_device->bdev;
1915 int btrfs_rm_device(struct btrfs_fs_info *fs_info, const char *device_path,
1918 struct btrfs_device *device;
1919 struct btrfs_fs_devices *cur_devices;
1923 mutex_lock(&fs_info->volume_mutex);
1924 mutex_lock(&uuid_mutex);
1926 num_devices = fs_info->fs_devices->num_devices;
1927 btrfs_dev_replace_read_lock(&fs_info->dev_replace);
1928 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) {
1929 WARN_ON(num_devices < 1);
1932 btrfs_dev_replace_read_unlock(&fs_info->dev_replace);
1934 ret = btrfs_check_raid_min_devices(fs_info, num_devices - 1);
1938 ret = btrfs_find_device_by_devspec(fs_info, devid, device_path,
1943 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
1944 ret = BTRFS_ERROR_DEV_TGT_REPLACE;
1948 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
1949 fs_info->fs_devices->rw_devices == 1) {
1950 ret = BTRFS_ERROR_DEV_ONLY_WRITABLE;
1954 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
1955 mutex_lock(&fs_info->chunk_mutex);
1956 list_del_init(&device->dev_alloc_list);
1957 device->fs_devices->rw_devices--;
1958 mutex_unlock(&fs_info->chunk_mutex);
1961 mutex_unlock(&uuid_mutex);
1962 ret = btrfs_shrink_device(device, 0);
1963 mutex_lock(&uuid_mutex);
1968 * TODO: the superblock still includes this device in its num_devices
1969 * counter although write_all_supers() is not locked out. This
1970 * could give a filesystem state which requires a degraded mount.
1972 ret = btrfs_rm_dev_item(fs_info, device);
1976 clear_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
1977 btrfs_scrub_cancel_dev(fs_info, device);
1980 * the device list mutex makes sure that we don't change
1981 * the device list while someone else is writing out all
1982 * the device supers. Whoever is writing all supers, should
1983 * lock the device list mutex before getting the number of
1984 * devices in the super block (super_copy). Conversely,
1985 * whoever updates the number of devices in the super block
1986 * (super_copy) should hold the device list mutex.
1989 cur_devices = device->fs_devices;
1990 mutex_lock(&fs_info->fs_devices->device_list_mutex);
1991 list_del_rcu(&device->dev_list);
1993 device->fs_devices->num_devices--;
1994 device->fs_devices->total_devices--;
1996 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state))
1997 device->fs_devices->missing_devices--;
1999 btrfs_assign_next_active_device(fs_info, device, NULL);
2002 device->fs_devices->open_devices--;
2003 /* remove sysfs entry */
2004 btrfs_sysfs_rm_device_link(fs_info->fs_devices, device);
2007 num_devices = btrfs_super_num_devices(fs_info->super_copy) - 1;
2008 btrfs_set_super_num_devices(fs_info->super_copy, num_devices);
2009 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2012 * at this point, the device is zero sized and detached from
2013 * the devices list. All that's left is to zero out the old
2014 * supers and free the device.
2016 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
2017 btrfs_scratch_superblocks(device->bdev, device->name->str);
2019 btrfs_close_bdev(device);
2020 call_rcu(&device->rcu, free_device_rcu);
2022 if (cur_devices->open_devices == 0) {
2023 struct btrfs_fs_devices *fs_devices;
2024 fs_devices = fs_info->fs_devices;
2025 while (fs_devices) {
2026 if (fs_devices->seed == cur_devices) {
2027 fs_devices->seed = cur_devices->seed;
2030 fs_devices = fs_devices->seed;
2032 cur_devices->seed = NULL;
2033 __btrfs_close_devices(cur_devices);
2034 free_fs_devices(cur_devices);
2038 mutex_unlock(&uuid_mutex);
2039 mutex_unlock(&fs_info->volume_mutex);
2043 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
2044 mutex_lock(&fs_info->chunk_mutex);
2045 list_add(&device->dev_alloc_list,
2046 &fs_info->fs_devices->alloc_list);
2047 device->fs_devices->rw_devices++;
2048 mutex_unlock(&fs_info->chunk_mutex);
2053 void btrfs_rm_dev_replace_remove_srcdev(struct btrfs_fs_info *fs_info,
2054 struct btrfs_device *srcdev)
2056 struct btrfs_fs_devices *fs_devices;
2058 lockdep_assert_held(&fs_info->fs_devices->device_list_mutex);
2061 * in case of fs with no seed, srcdev->fs_devices will point
2062 * to fs_devices of fs_info. However when the dev being replaced is
2063 * a seed dev it will point to the seed's local fs_devices. In short
2064 * srcdev will have its correct fs_devices in both the cases.
2066 fs_devices = srcdev->fs_devices;
2068 list_del_rcu(&srcdev->dev_list);
2069 list_del(&srcdev->dev_alloc_list);
2070 fs_devices->num_devices--;
2071 if (test_bit(BTRFS_DEV_STATE_MISSING, &srcdev->dev_state))
2072 fs_devices->missing_devices--;
2074 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state))
2075 fs_devices->rw_devices--;
2078 fs_devices->open_devices--;
2081 void btrfs_rm_dev_replace_free_srcdev(struct btrfs_fs_info *fs_info,
2082 struct btrfs_device *srcdev)
2084 struct btrfs_fs_devices *fs_devices = srcdev->fs_devices;
2086 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &srcdev->dev_state)) {
2087 /* zero out the old super if it is writable */
2088 btrfs_scratch_superblocks(srcdev->bdev, srcdev->name->str);
2091 btrfs_close_bdev(srcdev);
2092 call_rcu(&srcdev->rcu, free_device_rcu);
2094 /* if this is no devs we rather delete the fs_devices */
2095 if (!fs_devices->num_devices) {
2096 struct btrfs_fs_devices *tmp_fs_devices;
2099 * On a mounted FS, num_devices can't be zero unless it's a
2100 * seed. In case of a seed device being replaced, the replace
2101 * target added to the sprout FS, so there will be no more
2102 * device left under the seed FS.
2104 ASSERT(fs_devices->seeding);
2106 tmp_fs_devices = fs_info->fs_devices;
2107 while (tmp_fs_devices) {
2108 if (tmp_fs_devices->seed == fs_devices) {
2109 tmp_fs_devices->seed = fs_devices->seed;
2112 tmp_fs_devices = tmp_fs_devices->seed;
2114 fs_devices->seed = NULL;
2115 __btrfs_close_devices(fs_devices);
2116 free_fs_devices(fs_devices);
2120 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_fs_info *fs_info,
2121 struct btrfs_device *tgtdev)
2123 mutex_lock(&uuid_mutex);
2125 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2127 btrfs_sysfs_rm_device_link(fs_info->fs_devices, tgtdev);
2130 fs_info->fs_devices->open_devices--;
2132 fs_info->fs_devices->num_devices--;
2134 btrfs_assign_next_active_device(fs_info, tgtdev, NULL);
2136 list_del_rcu(&tgtdev->dev_list);
2138 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2139 mutex_unlock(&uuid_mutex);
2142 * The update_dev_time() with in btrfs_scratch_superblocks()
2143 * may lead to a call to btrfs_show_devname() which will try
2144 * to hold device_list_mutex. And here this device
2145 * is already out of device list, so we don't have to hold
2146 * the device_list_mutex lock.
2148 btrfs_scratch_superblocks(tgtdev->bdev, tgtdev->name->str);
2150 btrfs_close_bdev(tgtdev);
2151 call_rcu(&tgtdev->rcu, free_device_rcu);
2154 static int btrfs_find_device_by_path(struct btrfs_fs_info *fs_info,
2155 const char *device_path,
2156 struct btrfs_device **device)
2159 struct btrfs_super_block *disk_super;
2162 struct block_device *bdev;
2163 struct buffer_head *bh;
2166 ret = btrfs_get_bdev_and_sb(device_path, FMODE_READ,
2167 fs_info->bdev_holder, 0, &bdev, &bh);
2170 disk_super = (struct btrfs_super_block *)bh->b_data;
2171 devid = btrfs_stack_device_id(&disk_super->dev_item);
2172 dev_uuid = disk_super->dev_item.uuid;
2173 *device = btrfs_find_device(fs_info, devid, dev_uuid, disk_super->fsid);
2177 blkdev_put(bdev, FMODE_READ);
2181 int btrfs_find_device_missing_or_by_path(struct btrfs_fs_info *fs_info,
2182 const char *device_path,
2183 struct btrfs_device **device)
2186 if (strcmp(device_path, "missing") == 0) {
2187 struct list_head *devices;
2188 struct btrfs_device *tmp;
2190 devices = &fs_info->fs_devices->devices;
2192 * It is safe to read the devices since the volume_mutex
2193 * is held by the caller.
2195 list_for_each_entry(tmp, devices, dev_list) {
2196 if (test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
2197 &tmp->dev_state) && !tmp->bdev) {
2204 return BTRFS_ERROR_DEV_MISSING_NOT_FOUND;
2208 return btrfs_find_device_by_path(fs_info, device_path, device);
2213 * Lookup a device given by device id, or the path if the id is 0.
2215 int btrfs_find_device_by_devspec(struct btrfs_fs_info *fs_info, u64 devid,
2216 const char *devpath,
2217 struct btrfs_device **device)
2223 *device = btrfs_find_device(fs_info, devid, NULL, NULL);
2227 if (!devpath || !devpath[0])
2230 ret = btrfs_find_device_missing_or_by_path(fs_info, devpath,
2237 * does all the dirty work required for changing file system's UUID.
2239 static int btrfs_prepare_sprout(struct btrfs_fs_info *fs_info)
2241 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2242 struct btrfs_fs_devices *old_devices;
2243 struct btrfs_fs_devices *seed_devices;
2244 struct btrfs_super_block *disk_super = fs_info->super_copy;
2245 struct btrfs_device *device;
2248 lockdep_assert_held(&uuid_mutex);
2249 if (!fs_devices->seeding)
2252 seed_devices = alloc_fs_devices(NULL);
2253 if (IS_ERR(seed_devices))
2254 return PTR_ERR(seed_devices);
2256 old_devices = clone_fs_devices(fs_devices);
2257 if (IS_ERR(old_devices)) {
2258 kfree(seed_devices);
2259 return PTR_ERR(old_devices);
2262 list_add(&old_devices->list, &fs_uuids);
2264 memcpy(seed_devices, fs_devices, sizeof(*seed_devices));
2265 seed_devices->opened = 1;
2266 INIT_LIST_HEAD(&seed_devices->devices);
2267 INIT_LIST_HEAD(&seed_devices->alloc_list);
2268 mutex_init(&seed_devices->device_list_mutex);
2270 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2271 list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices,
2273 list_for_each_entry(device, &seed_devices->devices, dev_list)
2274 device->fs_devices = seed_devices;
2276 mutex_lock(&fs_info->chunk_mutex);
2277 list_splice_init(&fs_devices->alloc_list, &seed_devices->alloc_list);
2278 mutex_unlock(&fs_info->chunk_mutex);
2280 fs_devices->seeding = 0;
2281 fs_devices->num_devices = 0;
2282 fs_devices->open_devices = 0;
2283 fs_devices->missing_devices = 0;
2284 fs_devices->rotating = 0;
2285 fs_devices->seed = seed_devices;
2287 generate_random_uuid(fs_devices->fsid);
2288 memcpy(fs_info->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2289 memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2290 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2292 super_flags = btrfs_super_flags(disk_super) &
2293 ~BTRFS_SUPER_FLAG_SEEDING;
2294 btrfs_set_super_flags(disk_super, super_flags);
2300 * Store the expected generation for seed devices in device items.
2302 static int btrfs_finish_sprout(struct btrfs_trans_handle *trans,
2303 struct btrfs_fs_info *fs_info)
2305 struct btrfs_root *root = fs_info->chunk_root;
2306 struct btrfs_path *path;
2307 struct extent_buffer *leaf;
2308 struct btrfs_dev_item *dev_item;
2309 struct btrfs_device *device;
2310 struct btrfs_key key;
2311 u8 fs_uuid[BTRFS_FSID_SIZE];
2312 u8 dev_uuid[BTRFS_UUID_SIZE];
2316 path = btrfs_alloc_path();
2320 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2322 key.type = BTRFS_DEV_ITEM_KEY;
2325 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2329 leaf = path->nodes[0];
2331 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
2332 ret = btrfs_next_leaf(root, path);
2337 leaf = path->nodes[0];
2338 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2339 btrfs_release_path(path);
2343 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2344 if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID ||
2345 key.type != BTRFS_DEV_ITEM_KEY)
2348 dev_item = btrfs_item_ptr(leaf, path->slots[0],
2349 struct btrfs_dev_item);
2350 devid = btrfs_device_id(leaf, dev_item);
2351 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
2353 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
2355 device = btrfs_find_device(fs_info, devid, dev_uuid, fs_uuid);
2356 BUG_ON(!device); /* Logic error */
2358 if (device->fs_devices->seeding) {
2359 btrfs_set_device_generation(leaf, dev_item,
2360 device->generation);
2361 btrfs_mark_buffer_dirty(leaf);
2369 btrfs_free_path(path);
2373 int btrfs_init_new_device(struct btrfs_fs_info *fs_info, const char *device_path)
2375 struct btrfs_root *root = fs_info->dev_root;
2376 struct request_queue *q;
2377 struct btrfs_trans_handle *trans;
2378 struct btrfs_device *device;
2379 struct block_device *bdev;
2380 struct list_head *devices;
2381 struct super_block *sb = fs_info->sb;
2382 struct rcu_string *name;
2384 int seeding_dev = 0;
2386 bool unlocked = false;
2388 if (sb_rdonly(sb) && !fs_info->fs_devices->seeding)
2391 bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
2392 fs_info->bdev_holder);
2394 return PTR_ERR(bdev);
2396 if (fs_info->fs_devices->seeding) {
2398 down_write(&sb->s_umount);
2399 mutex_lock(&uuid_mutex);
2402 filemap_write_and_wait(bdev->bd_inode->i_mapping);
2404 devices = &fs_info->fs_devices->devices;
2406 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2407 list_for_each_entry(device, devices, dev_list) {
2408 if (device->bdev == bdev) {
2411 &fs_info->fs_devices->device_list_mutex);
2415 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2417 device = btrfs_alloc_device(fs_info, NULL, NULL);
2418 if (IS_ERR(device)) {
2419 /* we can safely leave the fs_devices entry around */
2420 ret = PTR_ERR(device);
2424 name = rcu_string_strdup(device_path, GFP_KERNEL);
2427 goto error_free_device;
2429 rcu_assign_pointer(device->name, name);
2431 trans = btrfs_start_transaction(root, 0);
2432 if (IS_ERR(trans)) {
2433 ret = PTR_ERR(trans);
2434 goto error_free_device;
2437 q = bdev_get_queue(bdev);
2438 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
2439 device->generation = trans->transid;
2440 device->io_width = fs_info->sectorsize;
2441 device->io_align = fs_info->sectorsize;
2442 device->sector_size = fs_info->sectorsize;
2443 device->total_bytes = round_down(i_size_read(bdev->bd_inode),
2444 fs_info->sectorsize);
2445 device->disk_total_bytes = device->total_bytes;
2446 device->commit_total_bytes = device->total_bytes;
2447 device->fs_info = fs_info;
2448 device->bdev = bdev;
2449 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2450 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
2451 device->mode = FMODE_EXCL;
2452 device->dev_stats_valid = 1;
2453 set_blocksize(device->bdev, BTRFS_BDEV_BLOCKSIZE);
2456 sb->s_flags &= ~SB_RDONLY;
2457 ret = btrfs_prepare_sprout(fs_info);
2459 btrfs_abort_transaction(trans, ret);
2464 device->fs_devices = fs_info->fs_devices;
2466 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2467 mutex_lock(&fs_info->chunk_mutex);
2468 list_add_rcu(&device->dev_list, &fs_info->fs_devices->devices);
2469 list_add(&device->dev_alloc_list,
2470 &fs_info->fs_devices->alloc_list);
2471 fs_info->fs_devices->num_devices++;
2472 fs_info->fs_devices->open_devices++;
2473 fs_info->fs_devices->rw_devices++;
2474 fs_info->fs_devices->total_devices++;
2475 fs_info->fs_devices->total_rw_bytes += device->total_bytes;
2477 atomic64_add(device->total_bytes, &fs_info->free_chunk_space);
2479 if (!blk_queue_nonrot(q))
2480 fs_info->fs_devices->rotating = 1;
2482 tmp = btrfs_super_total_bytes(fs_info->super_copy);
2483 btrfs_set_super_total_bytes(fs_info->super_copy,
2484 round_down(tmp + device->total_bytes, fs_info->sectorsize));
2486 tmp = btrfs_super_num_devices(fs_info->super_copy);
2487 btrfs_set_super_num_devices(fs_info->super_copy, tmp + 1);
2489 /* add sysfs device entry */
2490 btrfs_sysfs_add_device_link(fs_info->fs_devices, device);
2493 * we've got more storage, clear any full flags on the space
2496 btrfs_clear_space_info_full(fs_info);
2498 mutex_unlock(&fs_info->chunk_mutex);
2499 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2502 mutex_lock(&fs_info->chunk_mutex);
2503 ret = init_first_rw_device(trans, fs_info);
2504 mutex_unlock(&fs_info->chunk_mutex);
2506 btrfs_abort_transaction(trans, ret);
2511 ret = btrfs_add_dev_item(trans, fs_info, device);
2513 btrfs_abort_transaction(trans, ret);
2518 char fsid_buf[BTRFS_UUID_UNPARSED_SIZE];
2520 ret = btrfs_finish_sprout(trans, fs_info);
2522 btrfs_abort_transaction(trans, ret);
2526 /* Sprouting would change fsid of the mounted root,
2527 * so rename the fsid on the sysfs
2529 snprintf(fsid_buf, BTRFS_UUID_UNPARSED_SIZE, "%pU",
2531 if (kobject_rename(&fs_info->fs_devices->fsid_kobj, fsid_buf))
2533 "sysfs: failed to create fsid for sprout");
2536 ret = btrfs_commit_transaction(trans);
2539 mutex_unlock(&uuid_mutex);
2540 up_write(&sb->s_umount);
2543 if (ret) /* transaction commit */
2546 ret = btrfs_relocate_sys_chunks(fs_info);
2548 btrfs_handle_fs_error(fs_info, ret,
2549 "Failed to relocate sys chunks after device initialization. This can be fixed using the \"btrfs balance\" command.");
2550 trans = btrfs_attach_transaction(root);
2551 if (IS_ERR(trans)) {
2552 if (PTR_ERR(trans) == -ENOENT)
2554 ret = PTR_ERR(trans);
2558 ret = btrfs_commit_transaction(trans);
2561 /* Update ctime/mtime for libblkid */
2562 update_dev_time(device_path);
2566 btrfs_sysfs_rm_device_link(fs_info->fs_devices, device);
2569 sb->s_flags |= SB_RDONLY;
2571 btrfs_end_transaction(trans);
2573 free_device(device);
2575 blkdev_put(bdev, FMODE_EXCL);
2576 if (seeding_dev && !unlocked) {
2577 mutex_unlock(&uuid_mutex);
2578 up_write(&sb->s_umount);
2583 int btrfs_init_dev_replace_tgtdev(struct btrfs_fs_info *fs_info,
2584 const char *device_path,
2585 struct btrfs_device *srcdev,
2586 struct btrfs_device **device_out)
2588 struct btrfs_device *device;
2589 struct block_device *bdev;
2590 struct list_head *devices;
2591 struct rcu_string *name;
2592 u64 devid = BTRFS_DEV_REPLACE_DEVID;
2596 if (fs_info->fs_devices->seeding) {
2597 btrfs_err(fs_info, "the filesystem is a seed filesystem!");
2601 bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
2602 fs_info->bdev_holder);
2604 btrfs_err(fs_info, "target device %s is invalid!", device_path);
2605 return PTR_ERR(bdev);
2608 filemap_write_and_wait(bdev->bd_inode->i_mapping);
2610 devices = &fs_info->fs_devices->devices;
2611 list_for_each_entry(device, devices, dev_list) {
2612 if (device->bdev == bdev) {
2614 "target device is in the filesystem!");
2621 if (i_size_read(bdev->bd_inode) <
2622 btrfs_device_get_total_bytes(srcdev)) {
2624 "target device is smaller than source device!");
2630 device = btrfs_alloc_device(NULL, &devid, NULL);
2631 if (IS_ERR(device)) {
2632 ret = PTR_ERR(device);
2636 name = rcu_string_strdup(device_path, GFP_KERNEL);
2638 free_device(device);
2642 rcu_assign_pointer(device->name, name);
2644 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2645 set_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state);
2646 device->generation = 0;
2647 device->io_width = fs_info->sectorsize;
2648 device->io_align = fs_info->sectorsize;
2649 device->sector_size = fs_info->sectorsize;
2650 device->total_bytes = btrfs_device_get_total_bytes(srcdev);
2651 device->disk_total_bytes = btrfs_device_get_disk_total_bytes(srcdev);
2652 device->bytes_used = btrfs_device_get_bytes_used(srcdev);
2653 device->commit_total_bytes = srcdev->commit_total_bytes;
2654 device->commit_bytes_used = device->bytes_used;
2655 device->fs_info = fs_info;
2656 device->bdev = bdev;
2657 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
2658 set_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
2659 device->mode = FMODE_EXCL;
2660 device->dev_stats_valid = 1;
2661 set_blocksize(device->bdev, BTRFS_BDEV_BLOCKSIZE);
2662 device->fs_devices = fs_info->fs_devices;
2663 list_add(&device->dev_list, &fs_info->fs_devices->devices);
2664 fs_info->fs_devices->num_devices++;
2665 fs_info->fs_devices->open_devices++;
2666 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2668 *device_out = device;
2672 blkdev_put(bdev, FMODE_EXCL);
2676 static noinline int btrfs_update_device(struct btrfs_trans_handle *trans,
2677 struct btrfs_device *device)
2680 struct btrfs_path *path;
2681 struct btrfs_root *root = device->fs_info->chunk_root;
2682 struct btrfs_dev_item *dev_item;
2683 struct extent_buffer *leaf;
2684 struct btrfs_key key;
2686 path = btrfs_alloc_path();
2690 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2691 key.type = BTRFS_DEV_ITEM_KEY;
2692 key.offset = device->devid;
2694 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2703 leaf = path->nodes[0];
2704 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
2706 btrfs_set_device_id(leaf, dev_item, device->devid);
2707 btrfs_set_device_type(leaf, dev_item, device->type);
2708 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
2709 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
2710 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
2711 btrfs_set_device_total_bytes(leaf, dev_item,
2712 btrfs_device_get_disk_total_bytes(device));
2713 btrfs_set_device_bytes_used(leaf, dev_item,
2714 btrfs_device_get_bytes_used(device));
2715 btrfs_mark_buffer_dirty(leaf);
2718 btrfs_free_path(path);
2722 int btrfs_grow_device(struct btrfs_trans_handle *trans,
2723 struct btrfs_device *device, u64 new_size)
2725 struct btrfs_fs_info *fs_info = device->fs_info;
2726 struct btrfs_super_block *super_copy = fs_info->super_copy;
2727 struct btrfs_fs_devices *fs_devices;
2731 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
2734 new_size = round_down(new_size, fs_info->sectorsize);
2736 mutex_lock(&fs_info->chunk_mutex);
2737 old_total = btrfs_super_total_bytes(super_copy);
2738 diff = round_down(new_size - device->total_bytes, fs_info->sectorsize);
2740 if (new_size <= device->total_bytes ||
2741 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
2742 mutex_unlock(&fs_info->chunk_mutex);
2746 fs_devices = fs_info->fs_devices;
2748 btrfs_set_super_total_bytes(super_copy,
2749 round_down(old_total + diff, fs_info->sectorsize));
2750 device->fs_devices->total_rw_bytes += diff;
2752 btrfs_device_set_total_bytes(device, new_size);
2753 btrfs_device_set_disk_total_bytes(device, new_size);
2754 btrfs_clear_space_info_full(device->fs_info);
2755 if (list_empty(&device->resized_list))
2756 list_add_tail(&device->resized_list,
2757 &fs_devices->resized_devices);
2758 mutex_unlock(&fs_info->chunk_mutex);
2760 return btrfs_update_device(trans, device);
2763 static int btrfs_free_chunk(struct btrfs_trans_handle *trans,
2764 struct btrfs_fs_info *fs_info, u64 chunk_offset)
2766 struct btrfs_root *root = fs_info->chunk_root;
2768 struct btrfs_path *path;
2769 struct btrfs_key key;
2771 path = btrfs_alloc_path();
2775 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2776 key.offset = chunk_offset;
2777 key.type = BTRFS_CHUNK_ITEM_KEY;
2779 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2782 else if (ret > 0) { /* Logic error or corruption */
2783 btrfs_handle_fs_error(fs_info, -ENOENT,
2784 "Failed lookup while freeing chunk.");
2789 ret = btrfs_del_item(trans, root, path);
2791 btrfs_handle_fs_error(fs_info, ret,
2792 "Failed to delete chunk item.");
2794 btrfs_free_path(path);
2798 static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
2800 struct btrfs_super_block *super_copy = fs_info->super_copy;
2801 struct btrfs_disk_key *disk_key;
2802 struct btrfs_chunk *chunk;
2809 struct btrfs_key key;
2811 mutex_lock(&fs_info->chunk_mutex);
2812 array_size = btrfs_super_sys_array_size(super_copy);
2814 ptr = super_copy->sys_chunk_array;
2817 while (cur < array_size) {
2818 disk_key = (struct btrfs_disk_key *)ptr;
2819 btrfs_disk_key_to_cpu(&key, disk_key);
2821 len = sizeof(*disk_key);
2823 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
2824 chunk = (struct btrfs_chunk *)(ptr + len);
2825 num_stripes = btrfs_stack_chunk_num_stripes(chunk);
2826 len += btrfs_chunk_item_size(num_stripes);
2831 if (key.objectid == BTRFS_FIRST_CHUNK_TREE_OBJECTID &&
2832 key.offset == chunk_offset) {
2833 memmove(ptr, ptr + len, array_size - (cur + len));
2835 btrfs_set_super_sys_array_size(super_copy, array_size);
2841 mutex_unlock(&fs_info->chunk_mutex);
2845 static struct extent_map *get_chunk_map(struct btrfs_fs_info *fs_info,
2846 u64 logical, u64 length)
2848 struct extent_map_tree *em_tree;
2849 struct extent_map *em;
2851 em_tree = &fs_info->mapping_tree.map_tree;
2852 read_lock(&em_tree->lock);
2853 em = lookup_extent_mapping(em_tree, logical, length);
2854 read_unlock(&em_tree->lock);
2857 btrfs_crit(fs_info, "unable to find logical %llu length %llu",
2859 return ERR_PTR(-EINVAL);
2862 if (em->start > logical || em->start + em->len < logical) {
2864 "found a bad mapping, wanted %llu-%llu, found %llu-%llu",
2865 logical, length, em->start, em->start + em->len);
2866 free_extent_map(em);
2867 return ERR_PTR(-EINVAL);
2870 /* callers are responsible for dropping em's ref. */
2874 int btrfs_remove_chunk(struct btrfs_trans_handle *trans,
2875 struct btrfs_fs_info *fs_info, u64 chunk_offset)
2877 struct extent_map *em;
2878 struct map_lookup *map;
2879 u64 dev_extent_len = 0;
2881 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
2883 em = get_chunk_map(fs_info, chunk_offset, 1);
2886 * This is a logic error, but we don't want to just rely on the
2887 * user having built with ASSERT enabled, so if ASSERT doesn't
2888 * do anything we still error out.
2893 map = em->map_lookup;
2894 mutex_lock(&fs_info->chunk_mutex);
2895 check_system_chunk(trans, fs_info, map->type);
2896 mutex_unlock(&fs_info->chunk_mutex);
2899 * Take the device list mutex to prevent races with the final phase of
2900 * a device replace operation that replaces the device object associated
2901 * with map stripes (dev-replace.c:btrfs_dev_replace_finishing()).
2903 mutex_lock(&fs_devices->device_list_mutex);
2904 for (i = 0; i < map->num_stripes; i++) {
2905 struct btrfs_device *device = map->stripes[i].dev;
2906 ret = btrfs_free_dev_extent(trans, device,
2907 map->stripes[i].physical,
2910 mutex_unlock(&fs_devices->device_list_mutex);
2911 btrfs_abort_transaction(trans, ret);
2915 if (device->bytes_used > 0) {
2916 mutex_lock(&fs_info->chunk_mutex);
2917 btrfs_device_set_bytes_used(device,
2918 device->bytes_used - dev_extent_len);
2919 atomic64_add(dev_extent_len, &fs_info->free_chunk_space);
2920 btrfs_clear_space_info_full(fs_info);
2921 mutex_unlock(&fs_info->chunk_mutex);
2924 if (map->stripes[i].dev) {
2925 ret = btrfs_update_device(trans, map->stripes[i].dev);
2927 mutex_unlock(&fs_devices->device_list_mutex);
2928 btrfs_abort_transaction(trans, ret);
2933 mutex_unlock(&fs_devices->device_list_mutex);
2935 ret = btrfs_free_chunk(trans, fs_info, chunk_offset);
2937 btrfs_abort_transaction(trans, ret);
2941 trace_btrfs_chunk_free(fs_info, map, chunk_offset, em->len);
2943 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
2944 ret = btrfs_del_sys_chunk(fs_info, chunk_offset);
2946 btrfs_abort_transaction(trans, ret);
2951 ret = btrfs_remove_block_group(trans, fs_info, chunk_offset, em);
2953 btrfs_abort_transaction(trans, ret);
2959 free_extent_map(em);
2963 static int btrfs_relocate_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
2965 struct btrfs_root *root = fs_info->chunk_root;
2966 struct btrfs_trans_handle *trans;
2970 * Prevent races with automatic removal of unused block groups.
2971 * After we relocate and before we remove the chunk with offset
2972 * chunk_offset, automatic removal of the block group can kick in,
2973 * resulting in a failure when calling btrfs_remove_chunk() below.
2975 * Make sure to acquire this mutex before doing a tree search (dev
2976 * or chunk trees) to find chunks. Otherwise the cleaner kthread might
2977 * call btrfs_remove_chunk() (through btrfs_delete_unused_bgs()) after
2978 * we release the path used to search the chunk/dev tree and before
2979 * the current task acquires this mutex and calls us.
2981 lockdep_assert_held(&fs_info->delete_unused_bgs_mutex);
2983 ret = btrfs_can_relocate(fs_info, chunk_offset);
2987 /* step one, relocate all the extents inside this chunk */
2988 btrfs_scrub_pause(fs_info);
2989 ret = btrfs_relocate_block_group(fs_info, chunk_offset);
2990 btrfs_scrub_continue(fs_info);
2995 * We add the kobjects here (and after forcing data chunk creation)
2996 * since relocation is the only place we'll create chunks of a new
2997 * type at runtime. The only place where we'll remove the last
2998 * chunk of a type is the call immediately below this one. Even
2999 * so, we're protected against races with the cleaner thread since
3000 * we're covered by the delete_unused_bgs_mutex.
3002 btrfs_add_raid_kobjects(fs_info);
3004 trans = btrfs_start_trans_remove_block_group(root->fs_info,
3006 if (IS_ERR(trans)) {
3007 ret = PTR_ERR(trans);
3008 btrfs_handle_fs_error(root->fs_info, ret, NULL);
3013 * step two, delete the device extents and the
3014 * chunk tree entries
3016 ret = btrfs_remove_chunk(trans, fs_info, chunk_offset);
3017 btrfs_end_transaction(trans);
3021 static int btrfs_relocate_sys_chunks(struct btrfs_fs_info *fs_info)
3023 struct btrfs_root *chunk_root = fs_info->chunk_root;
3024 struct btrfs_path *path;
3025 struct extent_buffer *leaf;
3026 struct btrfs_chunk *chunk;
3027 struct btrfs_key key;
3028 struct btrfs_key found_key;
3030 bool retried = false;
3034 path = btrfs_alloc_path();
3039 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3040 key.offset = (u64)-1;
3041 key.type = BTRFS_CHUNK_ITEM_KEY;
3044 mutex_lock(&fs_info->delete_unused_bgs_mutex);
3045 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3047 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3050 BUG_ON(ret == 0); /* Corruption */
3052 ret = btrfs_previous_item(chunk_root, path, key.objectid,
3055 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3061 leaf = path->nodes[0];
3062 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3064 chunk = btrfs_item_ptr(leaf, path->slots[0],
3065 struct btrfs_chunk);
3066 chunk_type = btrfs_chunk_type(leaf, chunk);
3067 btrfs_release_path(path);
3069 if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) {
3070 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3076 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3078 if (found_key.offset == 0)
3080 key.offset = found_key.offset - 1;
3083 if (failed && !retried) {
3087 } else if (WARN_ON(failed && retried)) {
3091 btrfs_free_path(path);
3096 * return 1 : allocate a data chunk successfully,
3097 * return <0: errors during allocating a data chunk,
3098 * return 0 : no need to allocate a data chunk.
3100 static int btrfs_may_alloc_data_chunk(struct btrfs_fs_info *fs_info,
3103 struct btrfs_block_group_cache *cache;
3107 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3109 chunk_type = cache->flags;
3110 btrfs_put_block_group(cache);
3112 if (chunk_type & BTRFS_BLOCK_GROUP_DATA) {
3113 spin_lock(&fs_info->data_sinfo->lock);
3114 bytes_used = fs_info->data_sinfo->bytes_used;
3115 spin_unlock(&fs_info->data_sinfo->lock);
3118 struct btrfs_trans_handle *trans;
3121 trans = btrfs_join_transaction(fs_info->tree_root);
3123 return PTR_ERR(trans);
3125 ret = btrfs_force_chunk_alloc(trans, fs_info,
3126 BTRFS_BLOCK_GROUP_DATA);
3127 btrfs_end_transaction(trans);
3131 btrfs_add_raid_kobjects(fs_info);
3139 static int insert_balance_item(struct btrfs_fs_info *fs_info,
3140 struct btrfs_balance_control *bctl)
3142 struct btrfs_root *root = fs_info->tree_root;
3143 struct btrfs_trans_handle *trans;
3144 struct btrfs_balance_item *item;
3145 struct btrfs_disk_balance_args disk_bargs;
3146 struct btrfs_path *path;
3147 struct extent_buffer *leaf;
3148 struct btrfs_key key;
3151 path = btrfs_alloc_path();
3155 trans = btrfs_start_transaction(root, 0);
3156 if (IS_ERR(trans)) {
3157 btrfs_free_path(path);
3158 return PTR_ERR(trans);
3161 key.objectid = BTRFS_BALANCE_OBJECTID;
3162 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3165 ret = btrfs_insert_empty_item(trans, root, path, &key,
3170 leaf = path->nodes[0];
3171 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
3173 memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item));
3175 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->data);
3176 btrfs_set_balance_data(leaf, item, &disk_bargs);
3177 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->meta);
3178 btrfs_set_balance_meta(leaf, item, &disk_bargs);
3179 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->sys);
3180 btrfs_set_balance_sys(leaf, item, &disk_bargs);
3182 btrfs_set_balance_flags(leaf, item, bctl->flags);
3184 btrfs_mark_buffer_dirty(leaf);
3186 btrfs_free_path(path);
3187 err = btrfs_commit_transaction(trans);
3193 static int del_balance_item(struct btrfs_fs_info *fs_info)
3195 struct btrfs_root *root = fs_info->tree_root;
3196 struct btrfs_trans_handle *trans;
3197 struct btrfs_path *path;
3198 struct btrfs_key key;
3201 path = btrfs_alloc_path();
3205 trans = btrfs_start_transaction(root, 0);
3206 if (IS_ERR(trans)) {
3207 btrfs_free_path(path);
3208 return PTR_ERR(trans);
3211 key.objectid = BTRFS_BALANCE_OBJECTID;
3212 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3215 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3223 ret = btrfs_del_item(trans, root, path);
3225 btrfs_free_path(path);
3226 err = btrfs_commit_transaction(trans);
3233 * This is a heuristic used to reduce the number of chunks balanced on
3234 * resume after balance was interrupted.
3236 static void update_balance_args(struct btrfs_balance_control *bctl)
3239 * Turn on soft mode for chunk types that were being converted.
3241 if (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)
3242 bctl->data.flags |= BTRFS_BALANCE_ARGS_SOFT;
3243 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)
3244 bctl->sys.flags |= BTRFS_BALANCE_ARGS_SOFT;
3245 if (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)
3246 bctl->meta.flags |= BTRFS_BALANCE_ARGS_SOFT;
3249 * Turn on usage filter if is not already used. The idea is
3250 * that chunks that we have already balanced should be
3251 * reasonably full. Don't do it for chunks that are being
3252 * converted - that will keep us from relocating unconverted
3253 * (albeit full) chunks.
3255 if (!(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3256 !(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3257 !(bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3258 bctl->data.flags |= BTRFS_BALANCE_ARGS_USAGE;
3259 bctl->data.usage = 90;
3261 if (!(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3262 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3263 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3264 bctl->sys.flags |= BTRFS_BALANCE_ARGS_USAGE;
3265 bctl->sys.usage = 90;
3267 if (!(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3268 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3269 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3270 bctl->meta.flags |= BTRFS_BALANCE_ARGS_USAGE;
3271 bctl->meta.usage = 90;
3276 * Should be called with both balance and volume mutexes held to
3277 * serialize other volume operations (add_dev/rm_dev/resize) with
3278 * restriper. Same goes for unset_balance_control.
3280 static void set_balance_control(struct btrfs_balance_control *bctl)
3282 struct btrfs_fs_info *fs_info = bctl->fs_info;
3284 BUG_ON(fs_info->balance_ctl);
3286 spin_lock(&fs_info->balance_lock);
3287 fs_info->balance_ctl = bctl;
3288 spin_unlock(&fs_info->balance_lock);
3291 static void unset_balance_control(struct btrfs_fs_info *fs_info)
3293 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3295 BUG_ON(!fs_info->balance_ctl);
3297 spin_lock(&fs_info->balance_lock);
3298 fs_info->balance_ctl = NULL;
3299 spin_unlock(&fs_info->balance_lock);
3305 * Balance filters. Return 1 if chunk should be filtered out
3306 * (should not be balanced).
3308 static int chunk_profiles_filter(u64 chunk_type,
3309 struct btrfs_balance_args *bargs)
3311 chunk_type = chunk_to_extended(chunk_type) &
3312 BTRFS_EXTENDED_PROFILE_MASK;
3314 if (bargs->profiles & chunk_type)
3320 static int chunk_usage_range_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset,
3321 struct btrfs_balance_args *bargs)
3323 struct btrfs_block_group_cache *cache;
3325 u64 user_thresh_min;
3326 u64 user_thresh_max;
3329 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3330 chunk_used = btrfs_block_group_used(&cache->item);
3332 if (bargs->usage_min == 0)
3333 user_thresh_min = 0;
3335 user_thresh_min = div_factor_fine(cache->key.offset,
3338 if (bargs->usage_max == 0)
3339 user_thresh_max = 1;
3340 else if (bargs->usage_max > 100)
3341 user_thresh_max = cache->key.offset;
3343 user_thresh_max = div_factor_fine(cache->key.offset,
3346 if (user_thresh_min <= chunk_used && chunk_used < user_thresh_max)
3349 btrfs_put_block_group(cache);
3353 static int chunk_usage_filter(struct btrfs_fs_info *fs_info,
3354 u64 chunk_offset, struct btrfs_balance_args *bargs)
3356 struct btrfs_block_group_cache *cache;
3357 u64 chunk_used, user_thresh;
3360 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3361 chunk_used = btrfs_block_group_used(&cache->item);
3363 if (bargs->usage_min == 0)
3365 else if (bargs->usage > 100)
3366 user_thresh = cache->key.offset;
3368 user_thresh = div_factor_fine(cache->key.offset,
3371 if (chunk_used < user_thresh)
3374 btrfs_put_block_group(cache);
3378 static int chunk_devid_filter(struct extent_buffer *leaf,
3379 struct btrfs_chunk *chunk,
3380 struct btrfs_balance_args *bargs)
3382 struct btrfs_stripe *stripe;
3383 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3386 for (i = 0; i < num_stripes; i++) {
3387 stripe = btrfs_stripe_nr(chunk, i);
3388 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
3395 /* [pstart, pend) */
3396 static int chunk_drange_filter(struct extent_buffer *leaf,
3397 struct btrfs_chunk *chunk,
3398 struct btrfs_balance_args *bargs)
3400 struct btrfs_stripe *stripe;
3401 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3407 if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID))
3410 if (btrfs_chunk_type(leaf, chunk) & (BTRFS_BLOCK_GROUP_DUP |
3411 BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10)) {
3412 factor = num_stripes / 2;
3413 } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID5) {
3414 factor = num_stripes - 1;
3415 } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID6) {
3416 factor = num_stripes - 2;
3418 factor = num_stripes;
3421 for (i = 0; i < num_stripes; i++) {
3422 stripe = btrfs_stripe_nr(chunk, i);
3423 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
3426 stripe_offset = btrfs_stripe_offset(leaf, stripe);
3427 stripe_length = btrfs_chunk_length(leaf, chunk);
3428 stripe_length = div_u64(stripe_length, factor);
3430 if (stripe_offset < bargs->pend &&
3431 stripe_offset + stripe_length > bargs->pstart)
3438 /* [vstart, vend) */
3439 static int chunk_vrange_filter(struct extent_buffer *leaf,
3440 struct btrfs_chunk *chunk,
3442 struct btrfs_balance_args *bargs)
3444 if (chunk_offset < bargs->vend &&
3445 chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart)
3446 /* at least part of the chunk is inside this vrange */
3452 static int chunk_stripes_range_filter(struct extent_buffer *leaf,
3453 struct btrfs_chunk *chunk,
3454 struct btrfs_balance_args *bargs)
3456 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3458 if (bargs->stripes_min <= num_stripes
3459 && num_stripes <= bargs->stripes_max)
3465 static int chunk_soft_convert_filter(u64 chunk_type,
3466 struct btrfs_balance_args *bargs)
3468 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
3471 chunk_type = chunk_to_extended(chunk_type) &
3472 BTRFS_EXTENDED_PROFILE_MASK;
3474 if (bargs->target == chunk_type)
3480 static int should_balance_chunk(struct btrfs_fs_info *fs_info,
3481 struct extent_buffer *leaf,
3482 struct btrfs_chunk *chunk, u64 chunk_offset)
3484 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3485 struct btrfs_balance_args *bargs = NULL;
3486 u64 chunk_type = btrfs_chunk_type(leaf, chunk);
3489 if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) &
3490 (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) {
3494 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3495 bargs = &bctl->data;
3496 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3498 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3499 bargs = &bctl->meta;
3501 /* profiles filter */
3502 if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) &&
3503 chunk_profiles_filter(chunk_type, bargs)) {
3508 if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) &&
3509 chunk_usage_filter(fs_info, chunk_offset, bargs)) {
3511 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3512 chunk_usage_range_filter(fs_info, chunk_offset, bargs)) {
3517 if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) &&
3518 chunk_devid_filter(leaf, chunk, bargs)) {
3522 /* drange filter, makes sense only with devid filter */
3523 if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) &&
3524 chunk_drange_filter(leaf, chunk, bargs)) {
3529 if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) &&
3530 chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) {
3534 /* stripes filter */
3535 if ((bargs->flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE) &&
3536 chunk_stripes_range_filter(leaf, chunk, bargs)) {
3540 /* soft profile changing mode */
3541 if ((bargs->flags & BTRFS_BALANCE_ARGS_SOFT) &&
3542 chunk_soft_convert_filter(chunk_type, bargs)) {
3547 * limited by count, must be the last filter
3549 if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT)) {
3550 if (bargs->limit == 0)
3554 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)) {
3556 * Same logic as the 'limit' filter; the minimum cannot be
3557 * determined here because we do not have the global information
3558 * about the count of all chunks that satisfy the filters.
3560 if (bargs->limit_max == 0)
3569 static int __btrfs_balance(struct btrfs_fs_info *fs_info)
3571 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3572 struct btrfs_root *chunk_root = fs_info->chunk_root;
3573 struct btrfs_root *dev_root = fs_info->dev_root;
3574 struct list_head *devices;
3575 struct btrfs_device *device;
3579 struct btrfs_chunk *chunk;
3580 struct btrfs_path *path = NULL;
3581 struct btrfs_key key;
3582 struct btrfs_key found_key;
3583 struct btrfs_trans_handle *trans;
3584 struct extent_buffer *leaf;
3587 int enospc_errors = 0;
3588 bool counting = true;
3589 /* The single value limit and min/max limits use the same bytes in the */
3590 u64 limit_data = bctl->data.limit;
3591 u64 limit_meta = bctl->meta.limit;
3592 u64 limit_sys = bctl->sys.limit;
3596 int chunk_reserved = 0;
3598 /* step one make some room on all the devices */
3599 devices = &fs_info->fs_devices->devices;
3600 list_for_each_entry(device, devices, dev_list) {
3601 old_size = btrfs_device_get_total_bytes(device);
3602 size_to_free = div_factor(old_size, 1);
3603 size_to_free = min_t(u64, size_to_free, SZ_1M);
3604 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) ||
3605 btrfs_device_get_total_bytes(device) -
3606 btrfs_device_get_bytes_used(device) > size_to_free ||
3607 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
3610 ret = btrfs_shrink_device(device, old_size - size_to_free);
3614 /* btrfs_shrink_device never returns ret > 0 */
3619 trans = btrfs_start_transaction(dev_root, 0);
3620 if (IS_ERR(trans)) {
3621 ret = PTR_ERR(trans);
3622 btrfs_info_in_rcu(fs_info,
3623 "resize: unable to start transaction after shrinking device %s (error %d), old size %llu, new size %llu",
3624 rcu_str_deref(device->name), ret,
3625 old_size, old_size - size_to_free);
3629 ret = btrfs_grow_device(trans, device, old_size);
3631 btrfs_end_transaction(trans);
3632 /* btrfs_grow_device never returns ret > 0 */
3634 btrfs_info_in_rcu(fs_info,
3635 "resize: unable to grow device after shrinking device %s (error %d), old size %llu, new size %llu",
3636 rcu_str_deref(device->name), ret,
3637 old_size, old_size - size_to_free);
3641 btrfs_end_transaction(trans);
3644 /* step two, relocate all the chunks */
3645 path = btrfs_alloc_path();
3651 /* zero out stat counters */
3652 spin_lock(&fs_info->balance_lock);
3653 memset(&bctl->stat, 0, sizeof(bctl->stat));
3654 spin_unlock(&fs_info->balance_lock);
3658 * The single value limit and min/max limits use the same bytes
3661 bctl->data.limit = limit_data;
3662 bctl->meta.limit = limit_meta;
3663 bctl->sys.limit = limit_sys;
3665 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3666 key.offset = (u64)-1;
3667 key.type = BTRFS_CHUNK_ITEM_KEY;
3670 if ((!counting && atomic_read(&fs_info->balance_pause_req)) ||
3671 atomic_read(&fs_info->balance_cancel_req)) {
3676 mutex_lock(&fs_info->delete_unused_bgs_mutex);
3677 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3679 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3684 * this shouldn't happen, it means the last relocate
3688 BUG(); /* FIXME break ? */
3690 ret = btrfs_previous_item(chunk_root, path, 0,
3691 BTRFS_CHUNK_ITEM_KEY);
3693 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3698 leaf = path->nodes[0];
3699 slot = path->slots[0];
3700 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3702 if (found_key.objectid != key.objectid) {
3703 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3707 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
3708 chunk_type = btrfs_chunk_type(leaf, chunk);
3711 spin_lock(&fs_info->balance_lock);
3712 bctl->stat.considered++;
3713 spin_unlock(&fs_info->balance_lock);
3716 ret = should_balance_chunk(fs_info, leaf, chunk,
3719 btrfs_release_path(path);
3721 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3726 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3727 spin_lock(&fs_info->balance_lock);
3728 bctl->stat.expected++;
3729 spin_unlock(&fs_info->balance_lock);
3731 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3733 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3735 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3742 * Apply limit_min filter, no need to check if the LIMITS
3743 * filter is used, limit_min is 0 by default
3745 if (((chunk_type & BTRFS_BLOCK_GROUP_DATA) &&
3746 count_data < bctl->data.limit_min)
3747 || ((chunk_type & BTRFS_BLOCK_GROUP_METADATA) &&
3748 count_meta < bctl->meta.limit_min)
3749 || ((chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) &&
3750 count_sys < bctl->sys.limit_min)) {
3751 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3755 if (!chunk_reserved) {
3757 * We may be relocating the only data chunk we have,
3758 * which could potentially end up with losing data's
3759 * raid profile, so lets allocate an empty one in
3762 ret = btrfs_may_alloc_data_chunk(fs_info,
3765 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3767 } else if (ret == 1) {
3772 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3773 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3774 if (ret && ret != -ENOSPC)
3776 if (ret == -ENOSPC) {
3779 spin_lock(&fs_info->balance_lock);
3780 bctl->stat.completed++;
3781 spin_unlock(&fs_info->balance_lock);
3784 if (found_key.offset == 0)
3786 key.offset = found_key.offset - 1;
3790 btrfs_release_path(path);
3795 btrfs_free_path(path);
3796 if (enospc_errors) {
3797 btrfs_info(fs_info, "%d enospc errors during balance",
3807 * alloc_profile_is_valid - see if a given profile is valid and reduced
3808 * @flags: profile to validate
3809 * @extended: if true @flags is treated as an extended profile
3811 static int alloc_profile_is_valid(u64 flags, int extended)
3813 u64 mask = (extended ? BTRFS_EXTENDED_PROFILE_MASK :
3814 BTRFS_BLOCK_GROUP_PROFILE_MASK);
3816 flags &= ~BTRFS_BLOCK_GROUP_TYPE_MASK;
3818 /* 1) check that all other bits are zeroed */
3822 /* 2) see if profile is reduced */
3824 return !extended; /* "0" is valid for usual profiles */
3826 /* true if exactly one bit set */
3827 return (flags & (flags - 1)) == 0;
3830 static inline int balance_need_close(struct btrfs_fs_info *fs_info)
3832 /* cancel requested || normal exit path */
3833 return atomic_read(&fs_info->balance_cancel_req) ||
3834 (atomic_read(&fs_info->balance_pause_req) == 0 &&
3835 atomic_read(&fs_info->balance_cancel_req) == 0);
3838 static void __cancel_balance(struct btrfs_fs_info *fs_info)
3842 unset_balance_control(fs_info);
3843 ret = del_balance_item(fs_info);
3845 btrfs_handle_fs_error(fs_info, ret, NULL);
3847 clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
3850 /* Non-zero return value signifies invalidity */
3851 static inline int validate_convert_profile(struct btrfs_balance_args *bctl_arg,
3854 return ((bctl_arg->flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3855 (!alloc_profile_is_valid(bctl_arg->target, 1) ||
3856 (bctl_arg->target & ~allowed)));
3860 * Should be called with both balance and volume mutexes held
3862 int btrfs_balance(struct btrfs_balance_control *bctl,
3863 struct btrfs_ioctl_balance_args *bargs)
3865 struct btrfs_fs_info *fs_info = bctl->fs_info;
3866 u64 meta_target, data_target;
3873 if (btrfs_fs_closing(fs_info) ||
3874 atomic_read(&fs_info->balance_pause_req) ||
3875 atomic_read(&fs_info->balance_cancel_req)) {
3880 allowed = btrfs_super_incompat_flags(fs_info->super_copy);
3881 if (allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
3885 * In case of mixed groups both data and meta should be picked,
3886 * and identical options should be given for both of them.
3888 allowed = BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA;
3889 if (mixed && (bctl->flags & allowed)) {
3890 if (!(bctl->flags & BTRFS_BALANCE_DATA) ||
3891 !(bctl->flags & BTRFS_BALANCE_METADATA) ||
3892 memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) {
3894 "with mixed groups data and metadata balance options must be the same");
3900 num_devices = fs_info->fs_devices->num_devices;
3901 btrfs_dev_replace_read_lock(&fs_info->dev_replace);
3902 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) {
3903 BUG_ON(num_devices < 1);
3906 btrfs_dev_replace_read_unlock(&fs_info->dev_replace);
3907 allowed = BTRFS_AVAIL_ALLOC_BIT_SINGLE | BTRFS_BLOCK_GROUP_DUP;
3908 if (num_devices > 1)
3909 allowed |= (BTRFS_BLOCK_GROUP_RAID0 | BTRFS_BLOCK_GROUP_RAID1);
3910 if (num_devices > 2)
3911 allowed |= BTRFS_BLOCK_GROUP_RAID5;
3912 if (num_devices > 3)
3913 allowed |= (BTRFS_BLOCK_GROUP_RAID10 |
3914 BTRFS_BLOCK_GROUP_RAID6);
3915 if (validate_convert_profile(&bctl->data, allowed)) {
3917 "unable to start balance with target data profile %llu",
3922 if (validate_convert_profile(&bctl->meta, allowed)) {
3924 "unable to start balance with target metadata profile %llu",
3929 if (validate_convert_profile(&bctl->sys, allowed)) {
3931 "unable to start balance with target system profile %llu",
3937 /* allow to reduce meta or sys integrity only if force set */
3938 allowed = BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
3939 BTRFS_BLOCK_GROUP_RAID10 |
3940 BTRFS_BLOCK_GROUP_RAID5 |
3941 BTRFS_BLOCK_GROUP_RAID6;
3943 seq = read_seqbegin(&fs_info->profiles_lock);
3945 if (((bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3946 (fs_info->avail_system_alloc_bits & allowed) &&
3947 !(bctl->sys.target & allowed)) ||
3948 ((bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3949 (fs_info->avail_metadata_alloc_bits & allowed) &&
3950 !(bctl->meta.target & allowed))) {
3951 if (bctl->flags & BTRFS_BALANCE_FORCE) {
3953 "force reducing metadata integrity");
3956 "balance will reduce metadata integrity, use force if you want this");
3961 } while (read_seqretry(&fs_info->profiles_lock, seq));
3963 /* if we're not converting, the target field is uninitialized */
3964 meta_target = (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
3965 bctl->meta.target : fs_info->avail_metadata_alloc_bits;
3966 data_target = (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT) ?
3967 bctl->data.target : fs_info->avail_data_alloc_bits;
3968 if (btrfs_get_num_tolerated_disk_barrier_failures(meta_target) <
3969 btrfs_get_num_tolerated_disk_barrier_failures(data_target)) {
3971 "metadata profile 0x%llx has lower redundancy than data profile 0x%llx",
3972 meta_target, data_target);
3975 ret = insert_balance_item(fs_info, bctl);
3976 if (ret && ret != -EEXIST)
3979 if (!(bctl->flags & BTRFS_BALANCE_RESUME)) {
3980 BUG_ON(ret == -EEXIST);
3981 set_balance_control(bctl);
3983 BUG_ON(ret != -EEXIST);
3984 spin_lock(&fs_info->balance_lock);
3985 update_balance_args(bctl);
3986 spin_unlock(&fs_info->balance_lock);
3989 atomic_inc(&fs_info->balance_running);
3990 mutex_unlock(&fs_info->balance_mutex);
3992 ret = __btrfs_balance(fs_info);
3994 mutex_lock(&fs_info->balance_mutex);
3995 atomic_dec(&fs_info->balance_running);
3998 memset(bargs, 0, sizeof(*bargs));
3999 update_ioctl_balance_args(fs_info, 0, bargs);
4002 if ((ret && ret != -ECANCELED && ret != -ENOSPC) ||
4003 balance_need_close(fs_info)) {
4004 __cancel_balance(fs_info);
4007 wake_up(&fs_info->balance_wait_q);
4011 if (bctl->flags & BTRFS_BALANCE_RESUME)
4012 __cancel_balance(fs_info);
4015 clear_bit(BTRFS_FS_EXCL_OP, &fs_info->flags);
4020 static int balance_kthread(void *data)
4022 struct btrfs_fs_info *fs_info = data;
4025 mutex_lock(&fs_info->volume_mutex);
4026 mutex_lock(&fs_info->balance_mutex);
4028 if (fs_info->balance_ctl) {
4029 btrfs_info(fs_info, "continuing balance");
4030 ret = btrfs_balance(fs_info->balance_ctl, NULL);
4033 mutex_unlock(&fs_info->balance_mutex);
4034 mutex_unlock(&fs_info->volume_mutex);
4039 int btrfs_resume_balance_async(struct btrfs_fs_info *fs_info)
4041 struct task_struct *tsk;
4043 spin_lock(&fs_info->balance_lock);
4044 if (!fs_info->balance_ctl) {
4045 spin_unlock(&fs_info->balance_lock);
4048 spin_unlock(&fs_info->balance_lock);
4050 if (btrfs_test_opt(fs_info, SKIP_BALANCE)) {
4051 btrfs_info(fs_info, "force skipping balance");
4055 tsk = kthread_run(balance_kthread, fs_info, "btrfs-balance");
4056 return PTR_ERR_OR_ZERO(tsk);
4059 int btrfs_recover_balance(struct btrfs_fs_info *fs_info)
4061 struct btrfs_balance_control *bctl;
4062 struct btrfs_balance_item *item;
4063 struct btrfs_disk_balance_args disk_bargs;
4064 struct btrfs_path *path;
4065 struct extent_buffer *leaf;
4066 struct btrfs_key key;
4069 path = btrfs_alloc_path();
4073 key.objectid = BTRFS_BALANCE_OBJECTID;
4074 key.type = BTRFS_TEMPORARY_ITEM_KEY;
4077 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
4080 if (ret > 0) { /* ret = -ENOENT; */
4085 bctl = kzalloc(sizeof(*bctl), GFP_NOFS);
4091 leaf = path->nodes[0];
4092 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
4094 bctl->fs_info = fs_info;
4095 bctl->flags = btrfs_balance_flags(leaf, item);
4096 bctl->flags |= BTRFS_BALANCE_RESUME;
4098 btrfs_balance_data(leaf, item, &disk_bargs);
4099 btrfs_disk_balance_args_to_cpu(&bctl->data, &disk_bargs);
4100 btrfs_balance_meta(leaf, item, &disk_bargs);
4101 btrfs_disk_balance_args_to_cpu(&bctl->meta, &disk_bargs);
4102 btrfs_balance_sys(leaf, item, &disk_bargs);
4103 btrfs_disk_balance_args_to_cpu(&bctl->sys, &disk_bargs);
4105 WARN_ON(test_and_set_bit(BTRFS_FS_EXCL_OP, &fs_info->flags));
4107 mutex_lock(&fs_info->volume_mutex);
4108 mutex_lock(&fs_info->balance_mutex);
4110 set_balance_control(bctl);
4112 mutex_unlock(&fs_info->balance_mutex);
4113 mutex_unlock(&fs_info->volume_mutex);
4115 btrfs_free_path(path);
4119 int btrfs_pause_balance(struct btrfs_fs_info *fs_info)
4123 mutex_lock(&fs_info->balance_mutex);
4124 if (!fs_info->balance_ctl) {
4125 mutex_unlock(&fs_info->balance_mutex);
4129 if (atomic_read(&fs_info->balance_running)) {
4130 atomic_inc(&fs_info->balance_pause_req);
4131 mutex_unlock(&fs_info->balance_mutex);
4133 wait_event(fs_info->balance_wait_q,
4134 atomic_read(&fs_info->balance_running) == 0);
4136 mutex_lock(&fs_info->balance_mutex);
4137 /* we are good with balance_ctl ripped off from under us */
4138 BUG_ON(atomic_read(&fs_info->balance_running));
4139 atomic_dec(&fs_info->balance_pause_req);
4144 mutex_unlock(&fs_info->balance_mutex);
4148 int btrfs_cancel_balance(struct btrfs_fs_info *fs_info)
4150 if (sb_rdonly(fs_info->sb))
4153 mutex_lock(&fs_info->balance_mutex);
4154 if (!fs_info->balance_ctl) {
4155 mutex_unlock(&fs_info->balance_mutex);
4159 atomic_inc(&fs_info->balance_cancel_req);
4161 * if we are running just wait and return, balance item is
4162 * deleted in btrfs_balance in this case
4164 if (atomic_read(&fs_info->balance_running)) {
4165 mutex_unlock(&fs_info->balance_mutex);
4166 wait_event(fs_info->balance_wait_q,
4167 atomic_read(&fs_info->balance_running) == 0);
4168 mutex_lock(&fs_info->balance_mutex);
4170 /* __cancel_balance needs volume_mutex */
4171 mutex_unlock(&fs_info->balance_mutex);
4172 mutex_lock(&fs_info->volume_mutex);
4173 mutex_lock(&fs_info->balance_mutex);
4175 if (fs_info->balance_ctl)
4176 __cancel_balance(fs_info);
4178 mutex_unlock(&fs_info->volume_mutex);
4181 BUG_ON(fs_info->balance_ctl || atomic_read(&fs_info->balance_running));
4182 atomic_dec(&fs_info->balance_cancel_req);
4183 mutex_unlock(&fs_info->balance_mutex);
4187 static int btrfs_uuid_scan_kthread(void *data)
4189 struct btrfs_fs_info *fs_info = data;
4190 struct btrfs_root *root = fs_info->tree_root;
4191 struct btrfs_key key;
4192 struct btrfs_path *path = NULL;
4194 struct extent_buffer *eb;
4196 struct btrfs_root_item root_item;
4198 struct btrfs_trans_handle *trans = NULL;
4200 path = btrfs_alloc_path();
4207 key.type = BTRFS_ROOT_ITEM_KEY;
4211 ret = btrfs_search_forward(root, &key, path,
4212 BTRFS_OLDEST_GENERATION);
4219 if (key.type != BTRFS_ROOT_ITEM_KEY ||
4220 (key.objectid < BTRFS_FIRST_FREE_OBJECTID &&
4221 key.objectid != BTRFS_FS_TREE_OBJECTID) ||
4222 key.objectid > BTRFS_LAST_FREE_OBJECTID)
4225 eb = path->nodes[0];
4226 slot = path->slots[0];
4227 item_size = btrfs_item_size_nr(eb, slot);
4228 if (item_size < sizeof(root_item))
4231 read_extent_buffer(eb, &root_item,
4232 btrfs_item_ptr_offset(eb, slot),
4233 (int)sizeof(root_item));
4234 if (btrfs_root_refs(&root_item) == 0)
4237 if (!btrfs_is_empty_uuid(root_item.uuid) ||
4238 !btrfs_is_empty_uuid(root_item.received_uuid)) {
4242 btrfs_release_path(path);
4244 * 1 - subvol uuid item
4245 * 1 - received_subvol uuid item
4247 trans = btrfs_start_transaction(fs_info->uuid_root, 2);
4248 if (IS_ERR(trans)) {
4249 ret = PTR_ERR(trans);
4257 if (!btrfs_is_empty_uuid(root_item.uuid)) {
4258 ret = btrfs_uuid_tree_add(trans, fs_info,
4260 BTRFS_UUID_KEY_SUBVOL,
4263 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4269 if (!btrfs_is_empty_uuid(root_item.received_uuid)) {
4270 ret = btrfs_uuid_tree_add(trans, fs_info,
4271 root_item.received_uuid,
4272 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4275 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4283 ret = btrfs_end_transaction(trans);
4289 btrfs_release_path(path);
4290 if (key.offset < (u64)-1) {
4292 } else if (key.type < BTRFS_ROOT_ITEM_KEY) {
4294 key.type = BTRFS_ROOT_ITEM_KEY;
4295 } else if (key.objectid < (u64)-1) {
4297 key.type = BTRFS_ROOT_ITEM_KEY;
4306 btrfs_free_path(path);
4307 if (trans && !IS_ERR(trans))
4308 btrfs_end_transaction(trans);
4310 btrfs_warn(fs_info, "btrfs_uuid_scan_kthread failed %d", ret);
4312 set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags);
4313 up(&fs_info->uuid_tree_rescan_sem);
4318 * Callback for btrfs_uuid_tree_iterate().
4320 * 0 check succeeded, the entry is not outdated.
4321 * < 0 if an error occurred.
4322 * > 0 if the check failed, which means the caller shall remove the entry.
4324 static int btrfs_check_uuid_tree_entry(struct btrfs_fs_info *fs_info,
4325 u8 *uuid, u8 type, u64 subid)
4327 struct btrfs_key key;
4329 struct btrfs_root *subvol_root;
4331 if (type != BTRFS_UUID_KEY_SUBVOL &&
4332 type != BTRFS_UUID_KEY_RECEIVED_SUBVOL)
4335 key.objectid = subid;
4336 key.type = BTRFS_ROOT_ITEM_KEY;
4337 key.offset = (u64)-1;
4338 subvol_root = btrfs_read_fs_root_no_name(fs_info, &key);
4339 if (IS_ERR(subvol_root)) {
4340 ret = PTR_ERR(subvol_root);
4347 case BTRFS_UUID_KEY_SUBVOL:
4348 if (memcmp(uuid, subvol_root->root_item.uuid, BTRFS_UUID_SIZE))
4351 case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
4352 if (memcmp(uuid, subvol_root->root_item.received_uuid,
4362 static int btrfs_uuid_rescan_kthread(void *data)
4364 struct btrfs_fs_info *fs_info = (struct btrfs_fs_info *)data;
4368 * 1st step is to iterate through the existing UUID tree and
4369 * to delete all entries that contain outdated data.
4370 * 2nd step is to add all missing entries to the UUID tree.
4372 ret = btrfs_uuid_tree_iterate(fs_info, btrfs_check_uuid_tree_entry);
4374 btrfs_warn(fs_info, "iterating uuid_tree failed %d", ret);
4375 up(&fs_info->uuid_tree_rescan_sem);
4378 return btrfs_uuid_scan_kthread(data);
4381 int btrfs_create_uuid_tree(struct btrfs_fs_info *fs_info)
4383 struct btrfs_trans_handle *trans;
4384 struct btrfs_root *tree_root = fs_info->tree_root;
4385 struct btrfs_root *uuid_root;
4386 struct task_struct *task;
4393 trans = btrfs_start_transaction(tree_root, 2);
4395 return PTR_ERR(trans);
4397 uuid_root = btrfs_create_tree(trans, fs_info,
4398 BTRFS_UUID_TREE_OBJECTID);
4399 if (IS_ERR(uuid_root)) {
4400 ret = PTR_ERR(uuid_root);
4401 btrfs_abort_transaction(trans, ret);
4402 btrfs_end_transaction(trans);
4406 fs_info->uuid_root = uuid_root;
4408 ret = btrfs_commit_transaction(trans);
4412 down(&fs_info->uuid_tree_rescan_sem);
4413 task = kthread_run(btrfs_uuid_scan_kthread, fs_info, "btrfs-uuid");
4415 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4416 btrfs_warn(fs_info, "failed to start uuid_scan task");
4417 up(&fs_info->uuid_tree_rescan_sem);
4418 return PTR_ERR(task);
4424 int btrfs_check_uuid_tree(struct btrfs_fs_info *fs_info)
4426 struct task_struct *task;
4428 down(&fs_info->uuid_tree_rescan_sem);
4429 task = kthread_run(btrfs_uuid_rescan_kthread, fs_info, "btrfs-uuid");
4431 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4432 btrfs_warn(fs_info, "failed to start uuid_rescan task");
4433 up(&fs_info->uuid_tree_rescan_sem);
4434 return PTR_ERR(task);
4441 * shrinking a device means finding all of the device extents past
4442 * the new size, and then following the back refs to the chunks.
4443 * The chunk relocation code actually frees the device extent
4445 int btrfs_shrink_device(struct btrfs_device *device, u64 new_size)
4447 struct btrfs_fs_info *fs_info = device->fs_info;
4448 struct btrfs_root *root = fs_info->dev_root;
4449 struct btrfs_trans_handle *trans;
4450 struct btrfs_dev_extent *dev_extent = NULL;
4451 struct btrfs_path *path;
4457 bool retried = false;
4458 bool checked_pending_chunks = false;
4459 struct extent_buffer *l;
4460 struct btrfs_key key;
4461 struct btrfs_super_block *super_copy = fs_info->super_copy;
4462 u64 old_total = btrfs_super_total_bytes(super_copy);
4463 u64 old_size = btrfs_device_get_total_bytes(device);
4466 new_size = round_down(new_size, fs_info->sectorsize);
4467 diff = round_down(old_size - new_size, fs_info->sectorsize);
4469 if (test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
4472 path = btrfs_alloc_path();
4476 path->reada = READA_FORWARD;
4478 mutex_lock(&fs_info->chunk_mutex);
4480 btrfs_device_set_total_bytes(device, new_size);
4481 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
4482 device->fs_devices->total_rw_bytes -= diff;
4483 atomic64_sub(diff, &fs_info->free_chunk_space);
4485 mutex_unlock(&fs_info->chunk_mutex);
4488 key.objectid = device->devid;
4489 key.offset = (u64)-1;
4490 key.type = BTRFS_DEV_EXTENT_KEY;
4493 mutex_lock(&fs_info->delete_unused_bgs_mutex);
4494 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4496 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4500 ret = btrfs_previous_item(root, path, 0, key.type);
4502 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4507 btrfs_release_path(path);
4512 slot = path->slots[0];
4513 btrfs_item_key_to_cpu(l, &key, path->slots[0]);
4515 if (key.objectid != device->devid) {
4516 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4517 btrfs_release_path(path);
4521 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
4522 length = btrfs_dev_extent_length(l, dev_extent);
4524 if (key.offset + length <= new_size) {
4525 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4526 btrfs_release_path(path);
4530 chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
4531 btrfs_release_path(path);
4534 * We may be relocating the only data chunk we have,
4535 * which could potentially end up with losing data's
4536 * raid profile, so lets allocate an empty one in
4539 ret = btrfs_may_alloc_data_chunk(fs_info, chunk_offset);
4541 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4545 ret = btrfs_relocate_chunk(fs_info, chunk_offset);
4546 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
4547 if (ret && ret != -ENOSPC)
4551 } while (key.offset-- > 0);
4553 if (failed && !retried) {
4557 } else if (failed && retried) {
4562 /* Shrinking succeeded, else we would be at "done". */
4563 trans = btrfs_start_transaction(root, 0);
4564 if (IS_ERR(trans)) {
4565 ret = PTR_ERR(trans);
4569 mutex_lock(&fs_info->chunk_mutex);
4572 * We checked in the above loop all device extents that were already in
4573 * the device tree. However before we have updated the device's
4574 * total_bytes to the new size, we might have had chunk allocations that
4575 * have not complete yet (new block groups attached to transaction
4576 * handles), and therefore their device extents were not yet in the
4577 * device tree and we missed them in the loop above. So if we have any
4578 * pending chunk using a device extent that overlaps the device range
4579 * that we can not use anymore, commit the current transaction and
4580 * repeat the search on the device tree - this way we guarantee we will
4581 * not have chunks using device extents that end beyond 'new_size'.
4583 if (!checked_pending_chunks) {
4584 u64 start = new_size;
4585 u64 len = old_size - new_size;
4587 if (contains_pending_extent(trans->transaction, device,
4589 mutex_unlock(&fs_info->chunk_mutex);
4590 checked_pending_chunks = true;
4593 ret = btrfs_commit_transaction(trans);
4600 btrfs_device_set_disk_total_bytes(device, new_size);
4601 if (list_empty(&device->resized_list))
4602 list_add_tail(&device->resized_list,
4603 &fs_info->fs_devices->resized_devices);
4605 WARN_ON(diff > old_total);
4606 btrfs_set_super_total_bytes(super_copy,
4607 round_down(old_total - diff, fs_info->sectorsize));
4608 mutex_unlock(&fs_info->chunk_mutex);
4610 /* Now btrfs_update_device() will change the on-disk size. */
4611 ret = btrfs_update_device(trans, device);
4612 btrfs_end_transaction(trans);
4614 btrfs_free_path(path);
4616 mutex_lock(&fs_info->chunk_mutex);
4617 btrfs_device_set_total_bytes(device, old_size);
4618 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state))
4619 device->fs_devices->total_rw_bytes += diff;
4620 atomic64_add(diff, &fs_info->free_chunk_space);
4621 mutex_unlock(&fs_info->chunk_mutex);
4626 static int btrfs_add_system_chunk(struct btrfs_fs_info *fs_info,
4627 struct btrfs_key *key,
4628 struct btrfs_chunk *chunk, int item_size)
4630 struct btrfs_super_block *super_copy = fs_info->super_copy;
4631 struct btrfs_disk_key disk_key;
4635 mutex_lock(&fs_info->chunk_mutex);
4636 array_size = btrfs_super_sys_array_size(super_copy);
4637 if (array_size + item_size + sizeof(disk_key)
4638 > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) {
4639 mutex_unlock(&fs_info->chunk_mutex);
4643 ptr = super_copy->sys_chunk_array + array_size;
4644 btrfs_cpu_key_to_disk(&disk_key, key);
4645 memcpy(ptr, &disk_key, sizeof(disk_key));
4646 ptr += sizeof(disk_key);
4647 memcpy(ptr, chunk, item_size);
4648 item_size += sizeof(disk_key);
4649 btrfs_set_super_sys_array_size(super_copy, array_size + item_size);
4650 mutex_unlock(&fs_info->chunk_mutex);
4656 * sort the devices in descending order by max_avail, total_avail
4658 static int btrfs_cmp_device_info(const void *a, const void *b)
4660 const struct btrfs_device_info *di_a = a;
4661 const struct btrfs_device_info *di_b = b;
4663 if (di_a->max_avail > di_b->max_avail)
4665 if (di_a->max_avail < di_b->max_avail)
4667 if (di_a->total_avail > di_b->total_avail)
4669 if (di_a->total_avail < di_b->total_avail)
4674 static void check_raid56_incompat_flag(struct btrfs_fs_info *info, u64 type)
4676 if (!(type & BTRFS_BLOCK_GROUP_RAID56_MASK))
4679 btrfs_set_fs_incompat(info, RAID56);
4682 #define BTRFS_MAX_DEVS(info) ((BTRFS_MAX_ITEM_SIZE(info) \
4683 - sizeof(struct btrfs_chunk)) \
4684 / sizeof(struct btrfs_stripe) + 1)
4686 #define BTRFS_MAX_DEVS_SYS_CHUNK ((BTRFS_SYSTEM_CHUNK_ARRAY_SIZE \
4687 - 2 * sizeof(struct btrfs_disk_key) \
4688 - 2 * sizeof(struct btrfs_chunk)) \
4689 / sizeof(struct btrfs_stripe) + 1)
4691 static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
4692 u64 start, u64 type)
4694 struct btrfs_fs_info *info = trans->fs_info;
4695 struct btrfs_fs_devices *fs_devices = info->fs_devices;
4696 struct btrfs_device *device;
4697 struct map_lookup *map = NULL;
4698 struct extent_map_tree *em_tree;
4699 struct extent_map *em;
4700 struct btrfs_device_info *devices_info = NULL;
4702 int num_stripes; /* total number of stripes to allocate */
4703 int data_stripes; /* number of stripes that count for
4705 int sub_stripes; /* sub_stripes info for map */
4706 int dev_stripes; /* stripes per dev */
4707 int devs_max; /* max devs to use */
4708 int devs_min; /* min devs needed */
4709 int devs_increment; /* ndevs has to be a multiple of this */
4710 int ncopies; /* how many copies to data has */
4712 u64 max_stripe_size;
4721 BUG_ON(!alloc_profile_is_valid(type, 0));
4723 if (list_empty(&fs_devices->alloc_list)) {
4724 if (btrfs_test_opt(info, ENOSPC_DEBUG))
4725 btrfs_debug(info, "%s: no writable device", __func__);
4729 index = btrfs_bg_flags_to_raid_index(type);
4731 sub_stripes = btrfs_raid_array[index].sub_stripes;
4732 dev_stripes = btrfs_raid_array[index].dev_stripes;
4733 devs_max = btrfs_raid_array[index].devs_max;
4734 devs_min = btrfs_raid_array[index].devs_min;
4735 devs_increment = btrfs_raid_array[index].devs_increment;
4736 ncopies = btrfs_raid_array[index].ncopies;
4738 if (type & BTRFS_BLOCK_GROUP_DATA) {
4739 max_stripe_size = SZ_1G;
4740 max_chunk_size = 10 * max_stripe_size;
4742 devs_max = BTRFS_MAX_DEVS(info);
4743 } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
4744 /* for larger filesystems, use larger metadata chunks */
4745 if (fs_devices->total_rw_bytes > 50ULL * SZ_1G)
4746 max_stripe_size = SZ_1G;
4748 max_stripe_size = SZ_256M;
4749 max_chunk_size = max_stripe_size;
4751 devs_max = BTRFS_MAX_DEVS(info);
4752 } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
4753 max_stripe_size = SZ_32M;
4754 max_chunk_size = 2 * max_stripe_size;
4756 devs_max = BTRFS_MAX_DEVS_SYS_CHUNK;
4758 btrfs_err(info, "invalid chunk type 0x%llx requested",
4763 /* we don't want a chunk larger than 10% of writeable space */
4764 max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1),
4767 devices_info = kcalloc(fs_devices->rw_devices, sizeof(*devices_info),
4773 * in the first pass through the devices list, we gather information
4774 * about the available holes on each device.
4777 list_for_each_entry(device, &fs_devices->alloc_list, dev_alloc_list) {
4781 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state)) {
4783 "BTRFS: read-only device in alloc_list\n");
4787 if (!test_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
4788 &device->dev_state) ||
4789 test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state))
4792 if (device->total_bytes > device->bytes_used)
4793 total_avail = device->total_bytes - device->bytes_used;
4797 /* If there is no space on this device, skip it. */
4798 if (total_avail == 0)
4801 ret = find_free_dev_extent(trans, device,
4802 max_stripe_size * dev_stripes,
4803 &dev_offset, &max_avail);
4804 if (ret && ret != -ENOSPC)
4808 max_avail = max_stripe_size * dev_stripes;
4810 if (max_avail < BTRFS_STRIPE_LEN * dev_stripes) {
4811 if (btrfs_test_opt(info, ENOSPC_DEBUG))
4813 "%s: devid %llu has no free space, have=%llu want=%u",
4814 __func__, device->devid, max_avail,
4815 BTRFS_STRIPE_LEN * dev_stripes);
4819 if (ndevs == fs_devices->rw_devices) {
4820 WARN(1, "%s: found more than %llu devices\n",
4821 __func__, fs_devices->rw_devices);
4824 devices_info[ndevs].dev_offset = dev_offset;
4825 devices_info[ndevs].max_avail = max_avail;
4826 devices_info[ndevs].total_avail = total_avail;
4827 devices_info[ndevs].dev = device;
4832 * now sort the devices by hole size / available space
4834 sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
4835 btrfs_cmp_device_info, NULL);
4837 /* round down to number of usable stripes */
4838 ndevs = round_down(ndevs, devs_increment);
4840 if (ndevs < devs_min) {
4842 if (btrfs_test_opt(info, ENOSPC_DEBUG)) {
4844 "%s: not enough devices with free space: have=%d minimum required=%d",
4845 __func__, ndevs, devs_min);
4850 ndevs = min(ndevs, devs_max);
4853 * The primary goal is to maximize the number of stripes, so use as
4854 * many devices as possible, even if the stripes are not maximum sized.
4856 * The DUP profile stores more than one stripe per device, the
4857 * max_avail is the total size so we have to adjust.
4859 stripe_size = div_u64(devices_info[ndevs - 1].max_avail, dev_stripes);
4860 num_stripes = ndevs * dev_stripes;
4863 * this will have to be fixed for RAID1 and RAID10 over
4866 data_stripes = num_stripes / ncopies;
4868 if (type & BTRFS_BLOCK_GROUP_RAID5)
4869 data_stripes = num_stripes - 1;
4871 if (type & BTRFS_BLOCK_GROUP_RAID6)
4872 data_stripes = num_stripes - 2;
4875 * Use the number of data stripes to figure out how big this chunk
4876 * is really going to be in terms of logical address space,
4877 * and compare that answer with the max chunk size
4879 if (stripe_size * data_stripes > max_chunk_size) {
4880 stripe_size = div_u64(max_chunk_size, data_stripes);
4882 /* bump the answer up to a 16MB boundary */
4883 stripe_size = round_up(stripe_size, SZ_16M);
4886 * But don't go higher than the limits we found while searching
4889 stripe_size = min(devices_info[ndevs - 1].max_avail,
4893 /* align to BTRFS_STRIPE_LEN */
4894 stripe_size = round_down(stripe_size, BTRFS_STRIPE_LEN);
4896 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
4901 map->num_stripes = num_stripes;
4903 for (i = 0; i < ndevs; ++i) {
4904 for (j = 0; j < dev_stripes; ++j) {
4905 int s = i * dev_stripes + j;
4906 map->stripes[s].dev = devices_info[i].dev;
4907 map->stripes[s].physical = devices_info[i].dev_offset +
4911 map->stripe_len = BTRFS_STRIPE_LEN;
4912 map->io_align = BTRFS_STRIPE_LEN;
4913 map->io_width = BTRFS_STRIPE_LEN;
4915 map->sub_stripes = sub_stripes;
4917 num_bytes = stripe_size * data_stripes;
4919 trace_btrfs_chunk_alloc(info, map, start, num_bytes);
4921 em = alloc_extent_map();
4927 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
4928 em->map_lookup = map;
4930 em->len = num_bytes;
4931 em->block_start = 0;
4932 em->block_len = em->len;
4933 em->orig_block_len = stripe_size;
4935 em_tree = &info->mapping_tree.map_tree;
4936 write_lock(&em_tree->lock);
4937 ret = add_extent_mapping(em_tree, em, 0);
4939 write_unlock(&em_tree->lock);
4940 free_extent_map(em);
4944 list_add_tail(&em->list, &trans->transaction->pending_chunks);
4945 refcount_inc(&em->refs);
4946 write_unlock(&em_tree->lock);
4948 ret = btrfs_make_block_group(trans, info, 0, type, start, num_bytes);
4950 goto error_del_extent;
4952 for (i = 0; i < map->num_stripes; i++) {
4953 num_bytes = map->stripes[i].dev->bytes_used + stripe_size;
4954 btrfs_device_set_bytes_used(map->stripes[i].dev, num_bytes);
4957 atomic64_sub(stripe_size * map->num_stripes, &info->free_chunk_space);
4959 free_extent_map(em);
4960 check_raid56_incompat_flag(info, type);
4962 kfree(devices_info);
4966 write_lock(&em_tree->lock);
4967 remove_extent_mapping(em_tree, em);
4968 write_unlock(&em_tree->lock);
4970 /* One for our allocation */
4971 free_extent_map(em);
4972 /* One for the tree reference */
4973 free_extent_map(em);
4974 /* One for the pending_chunks list reference */
4975 free_extent_map(em);
4977 kfree(devices_info);
4981 int btrfs_finish_chunk_alloc(struct btrfs_trans_handle *trans,
4982 struct btrfs_fs_info *fs_info,
4983 u64 chunk_offset, u64 chunk_size)
4985 struct btrfs_root *extent_root = fs_info->extent_root;
4986 struct btrfs_root *chunk_root = fs_info->chunk_root;
4987 struct btrfs_key key;
4988 struct btrfs_device *device;
4989 struct btrfs_chunk *chunk;
4990 struct btrfs_stripe *stripe;
4991 struct extent_map *em;
4992 struct map_lookup *map;
4999 em = get_chunk_map(fs_info, chunk_offset, chunk_size);
5003 map = em->map_lookup;
5004 item_size = btrfs_chunk_item_size(map->num_stripes);
5005 stripe_size = em->orig_block_len;
5007 chunk = kzalloc(item_size, GFP_NOFS);
5014 * Take the device list mutex to prevent races with the final phase of
5015 * a device replace operation that replaces the device object associated
5016 * with the map's stripes, because the device object's id can change
5017 * at any time during that final phase of the device replace operation
5018 * (dev-replace.c:btrfs_dev_replace_finishing()).
5020 mutex_lock(&fs_info->fs_devices->device_list_mutex);
5021 for (i = 0; i < map->num_stripes; i++) {
5022 device = map->stripes[i].dev;
5023 dev_offset = map->stripes[i].physical;
5025 ret = btrfs_update_device(trans, device);
5028 ret = btrfs_alloc_dev_extent(trans, device, chunk_offset,
5029 dev_offset, stripe_size);
5034 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
5038 stripe = &chunk->stripe;
5039 for (i = 0; i < map->num_stripes; i++) {
5040 device = map->stripes[i].dev;
5041 dev_offset = map->stripes[i].physical;
5043 btrfs_set_stack_stripe_devid(stripe, device->devid);
5044 btrfs_set_stack_stripe_offset(stripe, dev_offset);
5045 memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE);
5048 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
5050 btrfs_set_stack_chunk_length(chunk, chunk_size);
5051 btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid);
5052 btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len);
5053 btrfs_set_stack_chunk_type(chunk, map->type);
5054 btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes);
5055 btrfs_set_stack_chunk_io_align(chunk, map->stripe_len);
5056 btrfs_set_stack_chunk_io_width(chunk, map->stripe_len);
5057 btrfs_set_stack_chunk_sector_size(chunk, fs_info->sectorsize);
5058 btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes);
5060 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
5061 key.type = BTRFS_CHUNK_ITEM_KEY;
5062 key.offset = chunk_offset;
5064 ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size);
5065 if (ret == 0 && map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
5067 * TODO: Cleanup of inserted chunk root in case of
5070 ret = btrfs_add_system_chunk(fs_info, &key, chunk, item_size);
5075 free_extent_map(em);
5080 * Chunk allocation falls into two parts. The first part does works
5081 * that make the new allocated chunk useable, but not do any operation
5082 * that modifies the chunk tree. The second part does the works that
5083 * require modifying the chunk tree. This division is important for the
5084 * bootstrap process of adding storage to a seed btrfs.
5086 int btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
5087 struct btrfs_fs_info *fs_info, u64 type)
5091 lockdep_assert_held(&fs_info->chunk_mutex);
5092 chunk_offset = find_next_chunk(fs_info);
5093 return __btrfs_alloc_chunk(trans, chunk_offset, type);
5096 static noinline int init_first_rw_device(struct btrfs_trans_handle *trans,
5097 struct btrfs_fs_info *fs_info)
5100 u64 sys_chunk_offset;
5104 chunk_offset = find_next_chunk(fs_info);
5105 alloc_profile = btrfs_metadata_alloc_profile(fs_info);
5106 ret = __btrfs_alloc_chunk(trans, chunk_offset, alloc_profile);
5110 sys_chunk_offset = find_next_chunk(fs_info);
5111 alloc_profile = btrfs_system_alloc_profile(fs_info);
5112 ret = __btrfs_alloc_chunk(trans, sys_chunk_offset, alloc_profile);
5116 static inline int btrfs_chunk_max_errors(struct map_lookup *map)
5120 if (map->type & (BTRFS_BLOCK_GROUP_RAID1 |
5121 BTRFS_BLOCK_GROUP_RAID10 |
5122 BTRFS_BLOCK_GROUP_RAID5 |
5123 BTRFS_BLOCK_GROUP_DUP)) {
5125 } else if (map->type & BTRFS_BLOCK_GROUP_RAID6) {
5134 int btrfs_chunk_readonly(struct btrfs_fs_info *fs_info, u64 chunk_offset)
5136 struct extent_map *em;
5137 struct map_lookup *map;
5142 em = get_chunk_map(fs_info, chunk_offset, 1);
5146 map = em->map_lookup;
5147 for (i = 0; i < map->num_stripes; i++) {
5148 if (test_bit(BTRFS_DEV_STATE_MISSING,
5149 &map->stripes[i].dev->dev_state)) {
5153 if (!test_bit(BTRFS_DEV_STATE_WRITEABLE,
5154 &map->stripes[i].dev->dev_state)) {
5161 * If the number of missing devices is larger than max errors,
5162 * we can not write the data into that chunk successfully, so
5165 if (miss_ndevs > btrfs_chunk_max_errors(map))
5168 free_extent_map(em);
5172 void btrfs_mapping_init(struct btrfs_mapping_tree *tree)
5174 extent_map_tree_init(&tree->map_tree);
5177 void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree)
5179 struct extent_map *em;
5182 write_lock(&tree->map_tree.lock);
5183 em = lookup_extent_mapping(&tree->map_tree, 0, (u64)-1);
5185 remove_extent_mapping(&tree->map_tree, em);
5186 write_unlock(&tree->map_tree.lock);
5190 free_extent_map(em);
5191 /* once for the tree */
5192 free_extent_map(em);
5196 int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5198 struct extent_map *em;
5199 struct map_lookup *map;
5202 em = get_chunk_map(fs_info, logical, len);
5205 * We could return errors for these cases, but that could get
5206 * ugly and we'd probably do the same thing which is just not do
5207 * anything else and exit, so return 1 so the callers don't try
5208 * to use other copies.
5212 map = em->map_lookup;
5213 if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1))
5214 ret = map->num_stripes;
5215 else if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5216 ret = map->sub_stripes;
5217 else if (map->type & BTRFS_BLOCK_GROUP_RAID5)
5219 else if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5221 * There could be two corrupted data stripes, we need
5222 * to loop retry in order to rebuild the correct data.
5224 * Fail a stripe at a time on every retry except the
5225 * stripe under reconstruction.
5227 ret = map->num_stripes;
5230 free_extent_map(em);
5232 btrfs_dev_replace_read_lock(&fs_info->dev_replace);
5233 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace) &&
5234 fs_info->dev_replace.tgtdev)
5236 btrfs_dev_replace_read_unlock(&fs_info->dev_replace);
5241 unsigned long btrfs_full_stripe_len(struct btrfs_fs_info *fs_info,
5244 struct extent_map *em;
5245 struct map_lookup *map;
5246 unsigned long len = fs_info->sectorsize;
5248 em = get_chunk_map(fs_info, logical, len);
5250 if (!WARN_ON(IS_ERR(em))) {
5251 map = em->map_lookup;
5252 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5253 len = map->stripe_len * nr_data_stripes(map);
5254 free_extent_map(em);
5259 int btrfs_is_parity_mirror(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5261 struct extent_map *em;
5262 struct map_lookup *map;
5265 em = get_chunk_map(fs_info, logical, len);
5267 if(!WARN_ON(IS_ERR(em))) {
5268 map = em->map_lookup;
5269 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5271 free_extent_map(em);
5276 static int find_live_mirror(struct btrfs_fs_info *fs_info,
5277 struct map_lookup *map, int first,
5278 int dev_replace_is_ongoing)
5282 int preferred_mirror;
5284 struct btrfs_device *srcdev;
5287 (BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10)));
5289 if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5290 num_stripes = map->sub_stripes;
5292 num_stripes = map->num_stripes;
5294 preferred_mirror = first + current->pid % num_stripes;
5296 if (dev_replace_is_ongoing &&
5297 fs_info->dev_replace.cont_reading_from_srcdev_mode ==
5298 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID)
5299 srcdev = fs_info->dev_replace.srcdev;
5304 * try to avoid the drive that is the source drive for a
5305 * dev-replace procedure, only choose it if no other non-missing
5306 * mirror is available
5308 for (tolerance = 0; tolerance < 2; tolerance++) {
5309 if (map->stripes[preferred_mirror].dev->bdev &&
5310 (tolerance || map->stripes[preferred_mirror].dev != srcdev))
5311 return preferred_mirror;
5312 for (i = first; i < first + num_stripes; i++) {
5313 if (map->stripes[i].dev->bdev &&
5314 (tolerance || map->stripes[i].dev != srcdev))
5319 /* we couldn't find one that doesn't fail. Just return something
5320 * and the io error handling code will clean up eventually
5322 return preferred_mirror;
5325 static inline int parity_smaller(u64 a, u64 b)
5330 /* Bubble-sort the stripe set to put the parity/syndrome stripes last */
5331 static void sort_parity_stripes(struct btrfs_bio *bbio, int num_stripes)
5333 struct btrfs_bio_stripe s;
5340 for (i = 0; i < num_stripes - 1; i++) {
5341 if (parity_smaller(bbio->raid_map[i],
5342 bbio->raid_map[i+1])) {
5343 s = bbio->stripes[i];
5344 l = bbio->raid_map[i];
5345 bbio->stripes[i] = bbio->stripes[i+1];
5346 bbio->raid_map[i] = bbio->raid_map[i+1];
5347 bbio->stripes[i+1] = s;
5348 bbio->raid_map[i+1] = l;
5356 static struct btrfs_bio *alloc_btrfs_bio(int total_stripes, int real_stripes)
5358 struct btrfs_bio *bbio = kzalloc(
5359 /* the size of the btrfs_bio */
5360 sizeof(struct btrfs_bio) +
5361 /* plus the variable array for the stripes */
5362 sizeof(struct btrfs_bio_stripe) * (total_stripes) +
5363 /* plus the variable array for the tgt dev */
5364 sizeof(int) * (real_stripes) +
5366 * plus the raid_map, which includes both the tgt dev
5369 sizeof(u64) * (total_stripes),
5370 GFP_NOFS|__GFP_NOFAIL);
5372 atomic_set(&bbio->error, 0);
5373 refcount_set(&bbio->refs, 1);
5378 void btrfs_get_bbio(struct btrfs_bio *bbio)
5380 WARN_ON(!refcount_read(&bbio->refs));
5381 refcount_inc(&bbio->refs);
5384 void btrfs_put_bbio(struct btrfs_bio *bbio)
5388 if (refcount_dec_and_test(&bbio->refs))
5392 /* can REQ_OP_DISCARD be sent with other REQ like REQ_OP_WRITE? */
5394 * Please note that, discard won't be sent to target device of device
5397 static int __btrfs_map_block_for_discard(struct btrfs_fs_info *fs_info,
5398 u64 logical, u64 length,
5399 struct btrfs_bio **bbio_ret)
5401 struct extent_map *em;
5402 struct map_lookup *map;
5403 struct btrfs_bio *bbio;
5407 u64 stripe_end_offset;
5414 u32 sub_stripes = 0;
5415 u64 stripes_per_dev = 0;
5416 u32 remaining_stripes = 0;
5417 u32 last_stripe = 0;
5421 /* discard always return a bbio */
5424 em = get_chunk_map(fs_info, logical, length);
5428 map = em->map_lookup;
5429 /* we don't discard raid56 yet */
5430 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5435 offset = logical - em->start;
5436 length = min_t(u64, em->len - offset, length);
5438 stripe_len = map->stripe_len;
5440 * stripe_nr counts the total number of stripes we have to stride
5441 * to get to this block
5443 stripe_nr = div64_u64(offset, stripe_len);
5445 /* stripe_offset is the offset of this block in its stripe */
5446 stripe_offset = offset - stripe_nr * stripe_len;
5448 stripe_nr_end = round_up(offset + length, map->stripe_len);
5449 stripe_nr_end = div64_u64(stripe_nr_end, map->stripe_len);
5450 stripe_cnt = stripe_nr_end - stripe_nr;
5451 stripe_end_offset = stripe_nr_end * map->stripe_len -
5454 * after this, stripe_nr is the number of stripes on this
5455 * device we have to walk to find the data, and stripe_index is
5456 * the number of our device in the stripe array
5460 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5461 BTRFS_BLOCK_GROUP_RAID10)) {
5462 if (map->type & BTRFS_BLOCK_GROUP_RAID0)
5465 sub_stripes = map->sub_stripes;
5467 factor = map->num_stripes / sub_stripes;
5468 num_stripes = min_t(u64, map->num_stripes,
5469 sub_stripes * stripe_cnt);
5470 stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index);
5471 stripe_index *= sub_stripes;
5472 stripes_per_dev = div_u64_rem(stripe_cnt, factor,
5473 &remaining_stripes);
5474 div_u64_rem(stripe_nr_end - 1, factor, &last_stripe);
5475 last_stripe *= sub_stripes;
5476 } else if (map->type & (BTRFS_BLOCK_GROUP_RAID1 |
5477 BTRFS_BLOCK_GROUP_DUP)) {
5478 num_stripes = map->num_stripes;
5480 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5484 bbio = alloc_btrfs_bio(num_stripes, 0);
5490 for (i = 0; i < num_stripes; i++) {
5491 bbio->stripes[i].physical =
5492 map->stripes[stripe_index].physical +
5493 stripe_offset + stripe_nr * map->stripe_len;
5494 bbio->stripes[i].dev = map->stripes[stripe_index].dev;
5496 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5497 BTRFS_BLOCK_GROUP_RAID10)) {
5498 bbio->stripes[i].length = stripes_per_dev *
5501 if (i / sub_stripes < remaining_stripes)
5502 bbio->stripes[i].length +=
5506 * Special for the first stripe and
5509 * |-------|...|-------|
5513 if (i < sub_stripes)
5514 bbio->stripes[i].length -=
5517 if (stripe_index >= last_stripe &&
5518 stripe_index <= (last_stripe +
5520 bbio->stripes[i].length -=
5523 if (i == sub_stripes - 1)
5526 bbio->stripes[i].length = length;
5530 if (stripe_index == map->num_stripes) {
5537 bbio->map_type = map->type;
5538 bbio->num_stripes = num_stripes;
5540 free_extent_map(em);
5545 * In dev-replace case, for repair case (that's the only case where the mirror
5546 * is selected explicitly when calling btrfs_map_block), blocks left of the
5547 * left cursor can also be read from the target drive.
5549 * For REQ_GET_READ_MIRRORS, the target drive is added as the last one to the
5551 * For READ, it also needs to be supported using the same mirror number.
5553 * If the requested block is not left of the left cursor, EIO is returned. This
5554 * can happen because btrfs_num_copies() returns one more in the dev-replace
5557 static int get_extra_mirror_from_replace(struct btrfs_fs_info *fs_info,
5558 u64 logical, u64 length,
5559 u64 srcdev_devid, int *mirror_num,
5562 struct btrfs_bio *bbio = NULL;
5564 int index_srcdev = 0;
5566 u64 physical_of_found = 0;
5570 ret = __btrfs_map_block(fs_info, BTRFS_MAP_GET_READ_MIRRORS,
5571 logical, &length, &bbio, 0, 0);
5573 ASSERT(bbio == NULL);
5577 num_stripes = bbio->num_stripes;
5578 if (*mirror_num > num_stripes) {
5580 * BTRFS_MAP_GET_READ_MIRRORS does not contain this mirror,
5581 * that means that the requested area is not left of the left
5584 btrfs_put_bbio(bbio);
5589 * process the rest of the function using the mirror_num of the source
5590 * drive. Therefore look it up first. At the end, patch the device
5591 * pointer to the one of the target drive.
5593 for (i = 0; i < num_stripes; i++) {
5594 if (bbio->stripes[i].dev->devid != srcdev_devid)
5598 * In case of DUP, in order to keep it simple, only add the
5599 * mirror with the lowest physical address
5602 physical_of_found <= bbio->stripes[i].physical)
5607 physical_of_found = bbio->stripes[i].physical;
5610 btrfs_put_bbio(bbio);
5616 *mirror_num = index_srcdev + 1;
5617 *physical = physical_of_found;
5621 static void handle_ops_on_dev_replace(enum btrfs_map_op op,
5622 struct btrfs_bio **bbio_ret,
5623 struct btrfs_dev_replace *dev_replace,
5624 int *num_stripes_ret, int *max_errors_ret)
5626 struct btrfs_bio *bbio = *bbio_ret;
5627 u64 srcdev_devid = dev_replace->srcdev->devid;
5628 int tgtdev_indexes = 0;
5629 int num_stripes = *num_stripes_ret;
5630 int max_errors = *max_errors_ret;
5633 if (op == BTRFS_MAP_WRITE) {
5634 int index_where_to_add;
5637 * duplicate the write operations while the dev replace
5638 * procedure is running. Since the copying of the old disk to
5639 * the new disk takes place at run time while the filesystem is
5640 * mounted writable, the regular write operations to the old
5641 * disk have to be duplicated to go to the new disk as well.
5643 * Note that device->missing is handled by the caller, and that
5644 * the write to the old disk is already set up in the stripes
5647 index_where_to_add = num_stripes;
5648 for (i = 0; i < num_stripes; i++) {
5649 if (bbio->stripes[i].dev->devid == srcdev_devid) {
5650 /* write to new disk, too */
5651 struct btrfs_bio_stripe *new =
5652 bbio->stripes + index_where_to_add;
5653 struct btrfs_bio_stripe *old =
5656 new->physical = old->physical;
5657 new->length = old->length;
5658 new->dev = dev_replace->tgtdev;
5659 bbio->tgtdev_map[i] = index_where_to_add;
5660 index_where_to_add++;
5665 num_stripes = index_where_to_add;
5666 } else if (op == BTRFS_MAP_GET_READ_MIRRORS) {
5667 int index_srcdev = 0;
5669 u64 physical_of_found = 0;
5672 * During the dev-replace procedure, the target drive can also
5673 * be used to read data in case it is needed to repair a corrupt
5674 * block elsewhere. This is possible if the requested area is
5675 * left of the left cursor. In this area, the target drive is a
5676 * full copy of the source drive.
5678 for (i = 0; i < num_stripes; i++) {
5679 if (bbio->stripes[i].dev->devid == srcdev_devid) {
5681 * In case of DUP, in order to keep it simple,
5682 * only add the mirror with the lowest physical
5686 physical_of_found <=
5687 bbio->stripes[i].physical)
5691 physical_of_found = bbio->stripes[i].physical;
5695 struct btrfs_bio_stripe *tgtdev_stripe =
5696 bbio->stripes + num_stripes;
5698 tgtdev_stripe->physical = physical_of_found;
5699 tgtdev_stripe->length =
5700 bbio->stripes[index_srcdev].length;
5701 tgtdev_stripe->dev = dev_replace->tgtdev;
5702 bbio->tgtdev_map[index_srcdev] = num_stripes;
5709 *num_stripes_ret = num_stripes;
5710 *max_errors_ret = max_errors;
5711 bbio->num_tgtdevs = tgtdev_indexes;
5715 static bool need_full_stripe(enum btrfs_map_op op)
5717 return (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS);
5720 static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
5721 enum btrfs_map_op op,
5722 u64 logical, u64 *length,
5723 struct btrfs_bio **bbio_ret,
5724 int mirror_num, int need_raid_map)
5726 struct extent_map *em;
5727 struct map_lookup *map;
5737 int tgtdev_indexes = 0;
5738 struct btrfs_bio *bbio = NULL;
5739 struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
5740 int dev_replace_is_ongoing = 0;
5741 int num_alloc_stripes;
5742 int patch_the_first_stripe_for_dev_replace = 0;
5743 u64 physical_to_patch_in_first_stripe = 0;
5744 u64 raid56_full_stripe_start = (u64)-1;
5746 if (op == BTRFS_MAP_DISCARD)
5747 return __btrfs_map_block_for_discard(fs_info, logical,
5750 em = get_chunk_map(fs_info, logical, *length);
5754 map = em->map_lookup;
5755 offset = logical - em->start;
5757 stripe_len = map->stripe_len;
5760 * stripe_nr counts the total number of stripes we have to stride
5761 * to get to this block
5763 stripe_nr = div64_u64(stripe_nr, stripe_len);
5765 stripe_offset = stripe_nr * stripe_len;
5766 if (offset < stripe_offset) {
5768 "stripe math has gone wrong, stripe_offset=%llu, offset=%llu, start=%llu, logical=%llu, stripe_len=%llu",
5769 stripe_offset, offset, em->start, logical,
5771 free_extent_map(em);
5775 /* stripe_offset is the offset of this block in its stripe*/
5776 stripe_offset = offset - stripe_offset;
5778 /* if we're here for raid56, we need to know the stripe aligned start */
5779 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5780 unsigned long full_stripe_len = stripe_len * nr_data_stripes(map);
5781 raid56_full_stripe_start = offset;
5783 /* allow a write of a full stripe, but make sure we don't
5784 * allow straddling of stripes
5786 raid56_full_stripe_start = div64_u64(raid56_full_stripe_start,
5788 raid56_full_stripe_start *= full_stripe_len;
5791 if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
5793 /* For writes to RAID[56], allow a full stripeset across all disks.
5794 For other RAID types and for RAID[56] reads, just allow a single
5795 stripe (on a single disk). */
5796 if ((map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) &&
5797 (op == BTRFS_MAP_WRITE)) {
5798 max_len = stripe_len * nr_data_stripes(map) -
5799 (offset - raid56_full_stripe_start);
5801 /* we limit the length of each bio to what fits in a stripe */
5802 max_len = stripe_len - stripe_offset;
5804 *length = min_t(u64, em->len - offset, max_len);
5806 *length = em->len - offset;
5809 /* This is for when we're called from btrfs_merge_bio_hook() and all
5810 it cares about is the length */
5814 btrfs_dev_replace_read_lock(dev_replace);
5815 dev_replace_is_ongoing = btrfs_dev_replace_is_ongoing(dev_replace);
5816 if (!dev_replace_is_ongoing)
5817 btrfs_dev_replace_read_unlock(dev_replace);
5819 btrfs_dev_replace_set_lock_blocking(dev_replace);
5821 if (dev_replace_is_ongoing && mirror_num == map->num_stripes + 1 &&
5822 !need_full_stripe(op) && dev_replace->tgtdev != NULL) {
5823 ret = get_extra_mirror_from_replace(fs_info, logical, *length,
5824 dev_replace->srcdev->devid,
5826 &physical_to_patch_in_first_stripe);
5830 patch_the_first_stripe_for_dev_replace = 1;
5831 } else if (mirror_num > map->num_stripes) {
5837 if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
5838 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5840 if (!need_full_stripe(op))
5842 } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) {
5843 if (need_full_stripe(op))
5844 num_stripes = map->num_stripes;
5845 else if (mirror_num)
5846 stripe_index = mirror_num - 1;
5848 stripe_index = find_live_mirror(fs_info, map, 0,
5849 dev_replace_is_ongoing);
5850 mirror_num = stripe_index + 1;
5853 } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
5854 if (need_full_stripe(op)) {
5855 num_stripes = map->num_stripes;
5856 } else if (mirror_num) {
5857 stripe_index = mirror_num - 1;
5862 } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
5863 u32 factor = map->num_stripes / map->sub_stripes;
5865 stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index);
5866 stripe_index *= map->sub_stripes;
5868 if (need_full_stripe(op))
5869 num_stripes = map->sub_stripes;
5870 else if (mirror_num)
5871 stripe_index += mirror_num - 1;
5873 int old_stripe_index = stripe_index;
5874 stripe_index = find_live_mirror(fs_info, map,
5876 dev_replace_is_ongoing);
5877 mirror_num = stripe_index - old_stripe_index + 1;
5880 } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5881 if (need_raid_map && (need_full_stripe(op) || mirror_num > 1)) {
5882 /* push stripe_nr back to the start of the full stripe */
5883 stripe_nr = div64_u64(raid56_full_stripe_start,
5884 stripe_len * nr_data_stripes(map));
5886 /* RAID[56] write or recovery. Return all stripes */
5887 num_stripes = map->num_stripes;
5888 max_errors = nr_parity_stripes(map);
5890 *length = map->stripe_len;
5895 * Mirror #0 or #1 means the original data block.
5896 * Mirror #2 is RAID5 parity block.
5897 * Mirror #3 is RAID6 Q block.
5899 stripe_nr = div_u64_rem(stripe_nr,
5900 nr_data_stripes(map), &stripe_index);
5902 stripe_index = nr_data_stripes(map) +
5905 /* We distribute the parity blocks across stripes */
5906 div_u64_rem(stripe_nr + stripe_index, map->num_stripes,
5908 if (!need_full_stripe(op) && mirror_num <= 1)
5913 * after this, stripe_nr is the number of stripes on this
5914 * device we have to walk to find the data, and stripe_index is
5915 * the number of our device in the stripe array
5917 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5919 mirror_num = stripe_index + 1;
5921 if (stripe_index >= map->num_stripes) {
5923 "stripe index math went horribly wrong, got stripe_index=%u, num_stripes=%u",
5924 stripe_index, map->num_stripes);
5929 num_alloc_stripes = num_stripes;
5930 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL) {
5931 if (op == BTRFS_MAP_WRITE)
5932 num_alloc_stripes <<= 1;
5933 if (op == BTRFS_MAP_GET_READ_MIRRORS)
5934 num_alloc_stripes++;
5935 tgtdev_indexes = num_stripes;
5938 bbio = alloc_btrfs_bio(num_alloc_stripes, tgtdev_indexes);
5943 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL)
5944 bbio->tgtdev_map = (int *)(bbio->stripes + num_alloc_stripes);
5946 /* build raid_map */
5947 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK && need_raid_map &&
5948 (need_full_stripe(op) || mirror_num > 1)) {
5952 bbio->raid_map = (u64 *)((void *)bbio->stripes +
5953 sizeof(struct btrfs_bio_stripe) *
5955 sizeof(int) * tgtdev_indexes);
5957 /* Work out the disk rotation on this stripe-set */
5958 div_u64_rem(stripe_nr, num_stripes, &rot);
5960 /* Fill in the logical address of each stripe */
5961 tmp = stripe_nr * nr_data_stripes(map);
5962 for (i = 0; i < nr_data_stripes(map); i++)
5963 bbio->raid_map[(i+rot) % num_stripes] =
5964 em->start + (tmp + i) * map->stripe_len;
5966 bbio->raid_map[(i+rot) % map->num_stripes] = RAID5_P_STRIPE;
5967 if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5968 bbio->raid_map[(i+rot+1) % num_stripes] =
5973 for (i = 0; i < num_stripes; i++) {
5974 bbio->stripes[i].physical =
5975 map->stripes[stripe_index].physical +
5977 stripe_nr * map->stripe_len;
5978 bbio->stripes[i].dev =
5979 map->stripes[stripe_index].dev;
5983 if (need_full_stripe(op))
5984 max_errors = btrfs_chunk_max_errors(map);
5987 sort_parity_stripes(bbio, num_stripes);
5989 if (dev_replace_is_ongoing && dev_replace->tgtdev != NULL &&
5990 need_full_stripe(op)) {
5991 handle_ops_on_dev_replace(op, &bbio, dev_replace, &num_stripes,
5996 bbio->map_type = map->type;
5997 bbio->num_stripes = num_stripes;
5998 bbio->max_errors = max_errors;
5999 bbio->mirror_num = mirror_num;
6002 * this is the case that REQ_READ && dev_replace_is_ongoing &&
6003 * mirror_num == num_stripes + 1 && dev_replace target drive is
6004 * available as a mirror
6006 if (patch_the_first_stripe_for_dev_replace && num_stripes > 0) {
6007 WARN_ON(num_stripes > 1);
6008 bbio->stripes[0].dev = dev_replace->tgtdev;
6009 bbio->stripes[0].physical = physical_to_patch_in_first_stripe;
6010 bbio->mirror_num = map->num_stripes + 1;
6013 if (dev_replace_is_ongoing) {
6014 btrfs_dev_replace_clear_lock_blocking(dev_replace);
6015 btrfs_dev_replace_read_unlock(dev_replace);
6017 free_extent_map(em);
6021 int btrfs_map_block(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6022 u64 logical, u64 *length,
6023 struct btrfs_bio **bbio_ret, int mirror_num)
6025 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret,
6029 /* For Scrub/replace */
6030 int btrfs_map_sblock(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
6031 u64 logical, u64 *length,
6032 struct btrfs_bio **bbio_ret)
6034 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret, 0, 1);
6037 int btrfs_rmap_block(struct btrfs_fs_info *fs_info,
6038 u64 chunk_start, u64 physical, u64 devid,
6039 u64 **logical, int *naddrs, int *stripe_len)
6041 struct extent_map *em;
6042 struct map_lookup *map;
6050 em = get_chunk_map(fs_info, chunk_start, 1);
6054 map = em->map_lookup;
6056 rmap_len = map->stripe_len;
6058 if (map->type & BTRFS_BLOCK_GROUP_RAID10)
6059 length = div_u64(length, map->num_stripes / map->sub_stripes);
6060 else if (map->type & BTRFS_BLOCK_GROUP_RAID0)
6061 length = div_u64(length, map->num_stripes);
6062 else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
6063 length = div_u64(length, nr_data_stripes(map));
6064 rmap_len = map->stripe_len * nr_data_stripes(map);
6067 buf = kcalloc(map->num_stripes, sizeof(u64), GFP_NOFS);
6068 BUG_ON(!buf); /* -ENOMEM */
6070 for (i = 0; i < map->num_stripes; i++) {
6071 if (devid && map->stripes[i].dev->devid != devid)
6073 if (map->stripes[i].physical > physical ||
6074 map->stripes[i].physical + length <= physical)
6077 stripe_nr = physical - map->stripes[i].physical;
6078 stripe_nr = div64_u64(stripe_nr, map->stripe_len);
6080 if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
6081 stripe_nr = stripe_nr * map->num_stripes + i;
6082 stripe_nr = div_u64(stripe_nr, map->sub_stripes);
6083 } else if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
6084 stripe_nr = stripe_nr * map->num_stripes + i;
6085 } /* else if RAID[56], multiply by nr_data_stripes().
6086 * Alternatively, just use rmap_len below instead of
6087 * map->stripe_len */
6089 bytenr = chunk_start + stripe_nr * rmap_len;
6090 WARN_ON(nr >= map->num_stripes);
6091 for (j = 0; j < nr; j++) {
6092 if (buf[j] == bytenr)
6096 WARN_ON(nr >= map->num_stripes);
6103 *stripe_len = rmap_len;
6105 free_extent_map(em);
6109 static inline void btrfs_end_bbio(struct btrfs_bio *bbio, struct bio *bio)
6111 bio->bi_private = bbio->private;
6112 bio->bi_end_io = bbio->end_io;
6115 btrfs_put_bbio(bbio);
6118 static void btrfs_end_bio(struct bio *bio)
6120 struct btrfs_bio *bbio = bio->bi_private;
6121 int is_orig_bio = 0;
6123 if (bio->bi_status) {
6124 atomic_inc(&bbio->error);
6125 if (bio->bi_status == BLK_STS_IOERR ||
6126 bio->bi_status == BLK_STS_TARGET) {
6127 unsigned int stripe_index =
6128 btrfs_io_bio(bio)->stripe_index;
6129 struct btrfs_device *dev;
6131 BUG_ON(stripe_index >= bbio->num_stripes);
6132 dev = bbio->stripes[stripe_index].dev;
6134 if (bio_op(bio) == REQ_OP_WRITE)
6135 btrfs_dev_stat_inc_and_print(dev,
6136 BTRFS_DEV_STAT_WRITE_ERRS);
6138 btrfs_dev_stat_inc_and_print(dev,
6139 BTRFS_DEV_STAT_READ_ERRS);
6140 if (bio->bi_opf & REQ_PREFLUSH)
6141 btrfs_dev_stat_inc_and_print(dev,
6142 BTRFS_DEV_STAT_FLUSH_ERRS);
6147 if (bio == bbio->orig_bio)
6150 btrfs_bio_counter_dec(bbio->fs_info);
6152 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6155 bio = bbio->orig_bio;
6158 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6159 /* only send an error to the higher layers if it is
6160 * beyond the tolerance of the btrfs bio
6162 if (atomic_read(&bbio->error) > bbio->max_errors) {
6163 bio->bi_status = BLK_STS_IOERR;
6166 * this bio is actually up to date, we didn't
6167 * go over the max number of errors
6169 bio->bi_status = BLK_STS_OK;
6172 btrfs_end_bbio(bbio, bio);
6173 } else if (!is_orig_bio) {
6179 * see run_scheduled_bios for a description of why bios are collected for
6182 * This will add one bio to the pending list for a device and make sure
6183 * the work struct is scheduled.
6185 static noinline void btrfs_schedule_bio(struct btrfs_device *device,
6188 struct btrfs_fs_info *fs_info = device->fs_info;
6189 int should_queue = 1;
6190 struct btrfs_pending_bios *pending_bios;
6192 if (test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state) ||
6198 /* don't bother with additional async steps for reads, right now */
6199 if (bio_op(bio) == REQ_OP_READ) {
6200 btrfsic_submit_bio(bio);
6204 WARN_ON(bio->bi_next);
6205 bio->bi_next = NULL;
6207 spin_lock(&device->io_lock);
6208 if (op_is_sync(bio->bi_opf))
6209 pending_bios = &device->pending_sync_bios;
6211 pending_bios = &device->pending_bios;
6213 if (pending_bios->tail)
6214 pending_bios->tail->bi_next = bio;
6216 pending_bios->tail = bio;
6217 if (!pending_bios->head)
6218 pending_bios->head = bio;
6219 if (device->running_pending)
6222 spin_unlock(&device->io_lock);
6225 btrfs_queue_work(fs_info->submit_workers, &device->work);
6228 static void submit_stripe_bio(struct btrfs_bio *bbio, struct bio *bio,
6229 u64 physical, int dev_nr, int async)
6231 struct btrfs_device *dev = bbio->stripes[dev_nr].dev;
6232 struct btrfs_fs_info *fs_info = bbio->fs_info;
6234 bio->bi_private = bbio;
6235 btrfs_io_bio(bio)->stripe_index = dev_nr;
6236 bio->bi_end_io = btrfs_end_bio;
6237 bio->bi_iter.bi_sector = physical >> 9;
6240 struct rcu_string *name;
6243 name = rcu_dereference(dev->name);
6244 btrfs_debug(fs_info,
6245 "btrfs_map_bio: rw %d 0x%x, sector=%llu, dev=%lu (%s id %llu), size=%u",
6246 bio_op(bio), bio->bi_opf,
6247 (u64)bio->bi_iter.bi_sector,
6248 (u_long)dev->bdev->bd_dev, name->str, dev->devid,
6249 bio->bi_iter.bi_size);
6253 bio_set_dev(bio, dev->bdev);
6255 btrfs_bio_counter_inc_noblocked(fs_info);
6258 btrfs_schedule_bio(dev, bio);
6260 btrfsic_submit_bio(bio);
6263 static void bbio_error(struct btrfs_bio *bbio, struct bio *bio, u64 logical)
6265 atomic_inc(&bbio->error);
6266 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6267 /* Should be the original bio. */
6268 WARN_ON(bio != bbio->orig_bio);
6270 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6271 bio->bi_iter.bi_sector = logical >> 9;
6272 if (atomic_read(&bbio->error) > bbio->max_errors)
6273 bio->bi_status = BLK_STS_IOERR;
6275 bio->bi_status = BLK_STS_OK;
6276 btrfs_end_bbio(bbio, bio);
6280 blk_status_t btrfs_map_bio(struct btrfs_fs_info *fs_info, struct bio *bio,
6281 int mirror_num, int async_submit)
6283 struct btrfs_device *dev;
6284 struct bio *first_bio = bio;
6285 u64 logical = (u64)bio->bi_iter.bi_sector << 9;
6291 struct btrfs_bio *bbio = NULL;
6293 length = bio->bi_iter.bi_size;
6294 map_length = length;
6296 btrfs_bio_counter_inc_blocked(fs_info);
6297 ret = __btrfs_map_block(fs_info, btrfs_op(bio), logical,
6298 &map_length, &bbio, mirror_num, 1);
6300 btrfs_bio_counter_dec(fs_info);
6301 return errno_to_blk_status(ret);
6304 total_devs = bbio->num_stripes;
6305 bbio->orig_bio = first_bio;
6306 bbio->private = first_bio->bi_private;
6307 bbio->end_io = first_bio->bi_end_io;
6308 bbio->fs_info = fs_info;
6309 atomic_set(&bbio->stripes_pending, bbio->num_stripes);
6311 if ((bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) &&
6312 ((bio_op(bio) == REQ_OP_WRITE) || (mirror_num > 1))) {
6313 /* In this case, map_length has been set to the length of
6314 a single stripe; not the whole write */
6315 if (bio_op(bio) == REQ_OP_WRITE) {
6316 ret = raid56_parity_write(fs_info, bio, bbio,
6319 ret = raid56_parity_recover(fs_info, bio, bbio,
6320 map_length, mirror_num, 1);
6323 btrfs_bio_counter_dec(fs_info);
6324 return errno_to_blk_status(ret);
6327 if (map_length < length) {
6329 "mapping failed logical %llu bio len %llu len %llu",
6330 logical, length, map_length);
6334 for (dev_nr = 0; dev_nr < total_devs; dev_nr++) {
6335 dev = bbio->stripes[dev_nr].dev;
6336 if (!dev || !dev->bdev ||
6337 (bio_op(first_bio) == REQ_OP_WRITE &&
6338 !test_bit(BTRFS_DEV_STATE_WRITEABLE, &dev->dev_state))) {
6339 bbio_error(bbio, first_bio, logical);
6343 if (dev_nr < total_devs - 1)
6344 bio = btrfs_bio_clone(first_bio);
6348 submit_stripe_bio(bbio, bio, bbio->stripes[dev_nr].physical,
6349 dev_nr, async_submit);
6351 btrfs_bio_counter_dec(fs_info);
6355 struct btrfs_device *btrfs_find_device(struct btrfs_fs_info *fs_info, u64 devid,
6358 struct btrfs_device *device;
6359 struct btrfs_fs_devices *cur_devices;
6361 cur_devices = fs_info->fs_devices;
6362 while (cur_devices) {
6364 !memcmp(cur_devices->fsid, fsid, BTRFS_FSID_SIZE)) {
6365 device = find_device(cur_devices, devid, uuid);
6369 cur_devices = cur_devices->seed;
6374 static struct btrfs_device *add_missing_dev(struct btrfs_fs_devices *fs_devices,
6375 u64 devid, u8 *dev_uuid)
6377 struct btrfs_device *device;
6379 device = btrfs_alloc_device(NULL, &devid, dev_uuid);
6383 list_add(&device->dev_list, &fs_devices->devices);
6384 device->fs_devices = fs_devices;
6385 fs_devices->num_devices++;
6387 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
6388 fs_devices->missing_devices++;
6394 * btrfs_alloc_device - allocate struct btrfs_device
6395 * @fs_info: used only for generating a new devid, can be NULL if
6396 * devid is provided (i.e. @devid != NULL).
6397 * @devid: a pointer to devid for this device. If NULL a new devid
6399 * @uuid: a pointer to UUID for this device. If NULL a new UUID
6402 * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR()
6403 * on error. Returned struct is not linked onto any lists and must be
6404 * destroyed with free_device.
6406 struct btrfs_device *btrfs_alloc_device(struct btrfs_fs_info *fs_info,
6410 struct btrfs_device *dev;
6413 if (WARN_ON(!devid && !fs_info))
6414 return ERR_PTR(-EINVAL);
6416 dev = __alloc_device();
6425 ret = find_next_devid(fs_info, &tmp);
6428 return ERR_PTR(ret);
6434 memcpy(dev->uuid, uuid, BTRFS_UUID_SIZE);
6436 generate_random_uuid(dev->uuid);
6438 btrfs_init_work(&dev->work, btrfs_submit_helper,
6439 pending_bios_fn, NULL, NULL);
6444 /* Return -EIO if any error, otherwise return 0. */
6445 static int btrfs_check_chunk_valid(struct btrfs_fs_info *fs_info,
6446 struct extent_buffer *leaf,
6447 struct btrfs_chunk *chunk, u64 logical)
6455 length = btrfs_chunk_length(leaf, chunk);
6456 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
6457 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6458 sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
6459 type = btrfs_chunk_type(leaf, chunk);
6462 btrfs_err(fs_info, "invalid chunk num_stripes: %u",
6466 if (!IS_ALIGNED(logical, fs_info->sectorsize)) {
6467 btrfs_err(fs_info, "invalid chunk logical %llu", logical);
6470 if (btrfs_chunk_sector_size(leaf, chunk) != fs_info->sectorsize) {
6471 btrfs_err(fs_info, "invalid chunk sectorsize %u",
6472 btrfs_chunk_sector_size(leaf, chunk));
6475 if (!length || !IS_ALIGNED(length, fs_info->sectorsize)) {
6476 btrfs_err(fs_info, "invalid chunk length %llu", length);
6479 if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) {
6480 btrfs_err(fs_info, "invalid chunk stripe length: %llu",
6484 if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) &
6486 btrfs_err(fs_info, "unrecognized chunk type: %llu",
6487 ~(BTRFS_BLOCK_GROUP_TYPE_MASK |
6488 BTRFS_BLOCK_GROUP_PROFILE_MASK) &
6489 btrfs_chunk_type(leaf, chunk));
6492 if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) ||
6493 (type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes < 1) ||
6494 (type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) ||
6495 (type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) ||
6496 (type & BTRFS_BLOCK_GROUP_DUP && num_stripes > 2) ||
6497 ((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 &&
6498 num_stripes != 1)) {
6500 "invalid num_stripes:sub_stripes %u:%u for profile %llu",
6501 num_stripes, sub_stripes,
6502 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
6509 static void btrfs_report_missing_device(struct btrfs_fs_info *fs_info,
6510 u64 devid, u8 *uuid, bool error)
6513 btrfs_err_rl(fs_info, "devid %llu uuid %pU is missing",
6516 btrfs_warn_rl(fs_info, "devid %llu uuid %pU is missing",
6520 static int read_one_chunk(struct btrfs_fs_info *fs_info, struct btrfs_key *key,
6521 struct extent_buffer *leaf,
6522 struct btrfs_chunk *chunk)
6524 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
6525 struct map_lookup *map;
6526 struct extent_map *em;
6530 u8 uuid[BTRFS_UUID_SIZE];
6535 logical = key->offset;
6536 length = btrfs_chunk_length(leaf, chunk);
6537 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6539 ret = btrfs_check_chunk_valid(fs_info, leaf, chunk, logical);
6543 read_lock(&map_tree->map_tree.lock);
6544 em = lookup_extent_mapping(&map_tree->map_tree, logical, 1);
6545 read_unlock(&map_tree->map_tree.lock);
6547 /* already mapped? */
6548 if (em && em->start <= logical && em->start + em->len > logical) {
6549 free_extent_map(em);
6552 free_extent_map(em);
6555 em = alloc_extent_map();
6558 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
6560 free_extent_map(em);
6564 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
6565 em->map_lookup = map;
6566 em->start = logical;
6569 em->block_start = 0;
6570 em->block_len = em->len;
6572 map->num_stripes = num_stripes;
6573 map->io_width = btrfs_chunk_io_width(leaf, chunk);
6574 map->io_align = btrfs_chunk_io_align(leaf, chunk);
6575 map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
6576 map->type = btrfs_chunk_type(leaf, chunk);
6577 map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
6578 for (i = 0; i < num_stripes; i++) {
6579 map->stripes[i].physical =
6580 btrfs_stripe_offset_nr(leaf, chunk, i);
6581 devid = btrfs_stripe_devid_nr(leaf, chunk, i);
6582 read_extent_buffer(leaf, uuid, (unsigned long)
6583 btrfs_stripe_dev_uuid_nr(chunk, i),
6585 map->stripes[i].dev = btrfs_find_device(fs_info, devid,
6587 if (!map->stripes[i].dev &&
6588 !btrfs_test_opt(fs_info, DEGRADED)) {
6589 free_extent_map(em);
6590 btrfs_report_missing_device(fs_info, devid, uuid, true);
6593 if (!map->stripes[i].dev) {
6594 map->stripes[i].dev =
6595 add_missing_dev(fs_info->fs_devices, devid,
6597 if (IS_ERR(map->stripes[i].dev)) {
6598 free_extent_map(em);
6600 "failed to init missing dev %llu: %ld",
6601 devid, PTR_ERR(map->stripes[i].dev));
6602 return PTR_ERR(map->stripes[i].dev);
6604 btrfs_report_missing_device(fs_info, devid, uuid, false);
6606 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA,
6607 &(map->stripes[i].dev->dev_state));
6611 write_lock(&map_tree->map_tree.lock);
6612 ret = add_extent_mapping(&map_tree->map_tree, em, 0);
6613 write_unlock(&map_tree->map_tree.lock);
6614 BUG_ON(ret); /* Tree corruption */
6615 free_extent_map(em);
6620 static void fill_device_from_item(struct extent_buffer *leaf,
6621 struct btrfs_dev_item *dev_item,
6622 struct btrfs_device *device)
6626 device->devid = btrfs_device_id(leaf, dev_item);
6627 device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item);
6628 device->total_bytes = device->disk_total_bytes;
6629 device->commit_total_bytes = device->disk_total_bytes;
6630 device->bytes_used = btrfs_device_bytes_used(leaf, dev_item);
6631 device->commit_bytes_used = device->bytes_used;
6632 device->type = btrfs_device_type(leaf, dev_item);
6633 device->io_align = btrfs_device_io_align(leaf, dev_item);
6634 device->io_width = btrfs_device_io_width(leaf, dev_item);
6635 device->sector_size = btrfs_device_sector_size(leaf, dev_item);
6636 WARN_ON(device->devid == BTRFS_DEV_REPLACE_DEVID);
6637 clear_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state);
6639 ptr = btrfs_device_uuid(dev_item);
6640 read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
6643 static struct btrfs_fs_devices *open_seed_devices(struct btrfs_fs_info *fs_info,
6646 struct btrfs_fs_devices *fs_devices;
6649 lockdep_assert_held(&uuid_mutex);
6652 fs_devices = fs_info->fs_devices->seed;
6653 while (fs_devices) {
6654 if (!memcmp(fs_devices->fsid, fsid, BTRFS_FSID_SIZE))
6657 fs_devices = fs_devices->seed;
6660 fs_devices = find_fsid(fsid);
6662 if (!btrfs_test_opt(fs_info, DEGRADED))
6663 return ERR_PTR(-ENOENT);
6665 fs_devices = alloc_fs_devices(fsid);
6666 if (IS_ERR(fs_devices))
6669 fs_devices->seeding = 1;
6670 fs_devices->opened = 1;
6674 fs_devices = clone_fs_devices(fs_devices);
6675 if (IS_ERR(fs_devices))
6678 ret = __btrfs_open_devices(fs_devices, FMODE_READ,
6679 fs_info->bdev_holder);
6681 free_fs_devices(fs_devices);
6682 fs_devices = ERR_PTR(ret);
6686 if (!fs_devices->seeding) {
6687 __btrfs_close_devices(fs_devices);
6688 free_fs_devices(fs_devices);
6689 fs_devices = ERR_PTR(-EINVAL);
6693 fs_devices->seed = fs_info->fs_devices->seed;
6694 fs_info->fs_devices->seed = fs_devices;
6699 static int read_one_dev(struct btrfs_fs_info *fs_info,
6700 struct extent_buffer *leaf,
6701 struct btrfs_dev_item *dev_item)
6703 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
6704 struct btrfs_device *device;
6707 u8 fs_uuid[BTRFS_FSID_SIZE];
6708 u8 dev_uuid[BTRFS_UUID_SIZE];
6710 devid = btrfs_device_id(leaf, dev_item);
6711 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
6713 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
6716 if (memcmp(fs_uuid, fs_info->fsid, BTRFS_FSID_SIZE)) {
6717 fs_devices = open_seed_devices(fs_info, fs_uuid);
6718 if (IS_ERR(fs_devices))
6719 return PTR_ERR(fs_devices);
6722 device = btrfs_find_device(fs_info, devid, dev_uuid, fs_uuid);
6724 if (!btrfs_test_opt(fs_info, DEGRADED)) {
6725 btrfs_report_missing_device(fs_info, devid,
6730 device = add_missing_dev(fs_devices, devid, dev_uuid);
6731 if (IS_ERR(device)) {
6733 "failed to add missing dev %llu: %ld",
6734 devid, PTR_ERR(device));
6735 return PTR_ERR(device);
6737 btrfs_report_missing_device(fs_info, devid, dev_uuid, false);
6739 if (!device->bdev) {
6740 if (!btrfs_test_opt(fs_info, DEGRADED)) {
6741 btrfs_report_missing_device(fs_info,
6742 devid, dev_uuid, true);
6745 btrfs_report_missing_device(fs_info, devid,
6749 if (!device->bdev &&
6750 !test_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state)) {
6752 * this happens when a device that was properly setup
6753 * in the device info lists suddenly goes bad.
6754 * device->bdev is NULL, and so we have to set
6755 * device->missing to one here
6757 device->fs_devices->missing_devices++;
6758 set_bit(BTRFS_DEV_STATE_MISSING, &device->dev_state);
6761 /* Move the device to its own fs_devices */
6762 if (device->fs_devices != fs_devices) {
6763 ASSERT(test_bit(BTRFS_DEV_STATE_MISSING,
6764 &device->dev_state));
6766 list_move(&device->dev_list, &fs_devices->devices);
6767 device->fs_devices->num_devices--;
6768 fs_devices->num_devices++;
6770 device->fs_devices->missing_devices--;
6771 fs_devices->missing_devices++;
6773 device->fs_devices = fs_devices;
6777 if (device->fs_devices != fs_info->fs_devices) {
6778 BUG_ON(test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state));
6779 if (device->generation !=
6780 btrfs_device_generation(leaf, dev_item))
6784 fill_device_from_item(leaf, dev_item, device);
6785 set_bit(BTRFS_DEV_STATE_IN_FS_METADATA, &device->dev_state);
6786 if (test_bit(BTRFS_DEV_STATE_WRITEABLE, &device->dev_state) &&
6787 !test_bit(BTRFS_DEV_STATE_REPLACE_TGT, &device->dev_state)) {
6788 device->fs_devices->total_rw_bytes += device->total_bytes;
6789 atomic64_add(device->total_bytes - device->bytes_used,
6790 &fs_info->free_chunk_space);
6796 int btrfs_read_sys_array(struct btrfs_fs_info *fs_info)
6798 struct btrfs_root *root = fs_info->tree_root;
6799 struct btrfs_super_block *super_copy = fs_info->super_copy;
6800 struct extent_buffer *sb;
6801 struct btrfs_disk_key *disk_key;
6802 struct btrfs_chunk *chunk;
6804 unsigned long sb_array_offset;
6811 struct btrfs_key key;
6813 ASSERT(BTRFS_SUPER_INFO_SIZE <= fs_info->nodesize);
6815 * This will create extent buffer of nodesize, superblock size is
6816 * fixed to BTRFS_SUPER_INFO_SIZE. If nodesize > sb size, this will
6817 * overallocate but we can keep it as-is, only the first page is used.
6819 sb = btrfs_find_create_tree_block(fs_info, BTRFS_SUPER_INFO_OFFSET);
6822 set_extent_buffer_uptodate(sb);
6823 btrfs_set_buffer_lockdep_class(root->root_key.objectid, sb, 0);
6825 * The sb extent buffer is artificial and just used to read the system array.
6826 * set_extent_buffer_uptodate() call does not properly mark all it's
6827 * pages up-to-date when the page is larger: extent does not cover the
6828 * whole page and consequently check_page_uptodate does not find all
6829 * the page's extents up-to-date (the hole beyond sb),
6830 * write_extent_buffer then triggers a WARN_ON.
6832 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
6833 * but sb spans only this function. Add an explicit SetPageUptodate call
6834 * to silence the warning eg. on PowerPC 64.
6836 if (PAGE_SIZE > BTRFS_SUPER_INFO_SIZE)
6837 SetPageUptodate(sb->pages[0]);
6839 write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE);
6840 array_size = btrfs_super_sys_array_size(super_copy);
6842 array_ptr = super_copy->sys_chunk_array;
6843 sb_array_offset = offsetof(struct btrfs_super_block, sys_chunk_array);
6846 while (cur_offset < array_size) {
6847 disk_key = (struct btrfs_disk_key *)array_ptr;
6848 len = sizeof(*disk_key);
6849 if (cur_offset + len > array_size)
6850 goto out_short_read;
6852 btrfs_disk_key_to_cpu(&key, disk_key);
6855 sb_array_offset += len;
6858 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
6859 chunk = (struct btrfs_chunk *)sb_array_offset;
6861 * At least one btrfs_chunk with one stripe must be
6862 * present, exact stripe count check comes afterwards
6864 len = btrfs_chunk_item_size(1);
6865 if (cur_offset + len > array_size)
6866 goto out_short_read;
6868 num_stripes = btrfs_chunk_num_stripes(sb, chunk);
6871 "invalid number of stripes %u in sys_array at offset %u",
6872 num_stripes, cur_offset);
6877 type = btrfs_chunk_type(sb, chunk);
6878 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) == 0) {
6880 "invalid chunk type %llu in sys_array at offset %u",
6886 len = btrfs_chunk_item_size(num_stripes);
6887 if (cur_offset + len > array_size)
6888 goto out_short_read;
6890 ret = read_one_chunk(fs_info, &key, sb, chunk);
6895 "unexpected item type %u in sys_array at offset %u",
6896 (u32)key.type, cur_offset);
6901 sb_array_offset += len;
6904 clear_extent_buffer_uptodate(sb);
6905 free_extent_buffer_stale(sb);
6909 btrfs_err(fs_info, "sys_array too short to read %u bytes at offset %u",
6911 clear_extent_buffer_uptodate(sb);
6912 free_extent_buffer_stale(sb);
6917 * Check if all chunks in the fs are OK for read-write degraded mount
6919 * If the @failing_dev is specified, it's accounted as missing.
6921 * Return true if all chunks meet the minimal RW mount requirements.
6922 * Return false if any chunk doesn't meet the minimal RW mount requirements.
6924 bool btrfs_check_rw_degradable(struct btrfs_fs_info *fs_info,
6925 struct btrfs_device *failing_dev)
6927 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
6928 struct extent_map *em;
6932 read_lock(&map_tree->map_tree.lock);
6933 em = lookup_extent_mapping(&map_tree->map_tree, 0, (u64)-1);
6934 read_unlock(&map_tree->map_tree.lock);
6935 /* No chunk at all? Return false anyway */
6941 struct map_lookup *map;
6946 map = em->map_lookup;
6948 btrfs_get_num_tolerated_disk_barrier_failures(
6950 for (i = 0; i < map->num_stripes; i++) {
6951 struct btrfs_device *dev = map->stripes[i].dev;
6953 if (!dev || !dev->bdev ||
6954 test_bit(BTRFS_DEV_STATE_MISSING, &dev->dev_state) ||
6955 dev->last_flush_error)
6957 else if (failing_dev && failing_dev == dev)
6960 if (missing > max_tolerated) {
6963 "chunk %llu missing %d devices, max tolerance is %d for writeable mount",
6964 em->start, missing, max_tolerated);
6965 free_extent_map(em);
6969 next_start = extent_map_end(em);
6970 free_extent_map(em);
6972 read_lock(&map_tree->map_tree.lock);
6973 em = lookup_extent_mapping(&map_tree->map_tree, next_start,
6974 (u64)(-1) - next_start);
6975 read_unlock(&map_tree->map_tree.lock);
6981 int btrfs_read_chunk_tree(struct btrfs_fs_info *fs_info)
6983 struct btrfs_root *root = fs_info->chunk_root;
6984 struct btrfs_path *path;
6985 struct extent_buffer *leaf;
6986 struct btrfs_key key;
6987 struct btrfs_key found_key;
6992 path = btrfs_alloc_path();
6996 mutex_lock(&uuid_mutex);
6997 mutex_lock(&fs_info->chunk_mutex);
7000 * Read all device items, and then all the chunk items. All
7001 * device items are found before any chunk item (their object id
7002 * is smaller than the lowest possible object id for a chunk
7003 * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID).
7005 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
7008 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
7012 leaf = path->nodes[0];
7013 slot = path->slots[0];
7014 if (slot >= btrfs_header_nritems(leaf)) {
7015 ret = btrfs_next_leaf(root, path);
7022 btrfs_item_key_to_cpu(leaf, &found_key, slot);
7023 if (found_key.type == BTRFS_DEV_ITEM_KEY) {
7024 struct btrfs_dev_item *dev_item;
7025 dev_item = btrfs_item_ptr(leaf, slot,
7026 struct btrfs_dev_item);
7027 ret = read_one_dev(fs_info, leaf, dev_item);
7031 } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) {
7032 struct btrfs_chunk *chunk;
7033 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
7034 ret = read_one_chunk(fs_info, &found_key, leaf, chunk);
7042 * After loading chunk tree, we've got all device information,
7043 * do another round of validation checks.
7045 if (total_dev != fs_info->fs_devices->total_devices) {
7047 "super_num_devices %llu mismatch with num_devices %llu found here",
7048 btrfs_super_num_devices(fs_info->super_copy),
7053 if (btrfs_super_total_bytes(fs_info->super_copy) <
7054 fs_info->fs_devices->total_rw_bytes) {
7056 "super_total_bytes %llu mismatch with fs_devices total_rw_bytes %llu",
7057 btrfs_super_total_bytes(fs_info->super_copy),
7058 fs_info->fs_devices->total_rw_bytes);
7064 mutex_unlock(&fs_info->chunk_mutex);
7065 mutex_unlock(&uuid_mutex);
7067 btrfs_free_path(path);
7071 void btrfs_init_devices_late(struct btrfs_fs_info *fs_info)
7073 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7074 struct btrfs_device *device;
7076 while (fs_devices) {
7077 mutex_lock(&fs_devices->device_list_mutex);
7078 list_for_each_entry(device, &fs_devices->devices, dev_list)
7079 device->fs_info = fs_info;
7080 mutex_unlock(&fs_devices->device_list_mutex);
7082 fs_devices = fs_devices->seed;
7086 static void __btrfs_reset_dev_stats(struct btrfs_device *dev)
7090 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7091 btrfs_dev_stat_reset(dev, i);
7094 int btrfs_init_dev_stats(struct btrfs_fs_info *fs_info)
7096 struct btrfs_key key;
7097 struct btrfs_key found_key;
7098 struct btrfs_root *dev_root = fs_info->dev_root;
7099 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7100 struct extent_buffer *eb;
7103 struct btrfs_device *device;
7104 struct btrfs_path *path = NULL;
7107 path = btrfs_alloc_path();
7113 mutex_lock(&fs_devices->device_list_mutex);
7114 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7116 struct btrfs_dev_stats_item *ptr;
7118 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7119 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7120 key.offset = device->devid;
7121 ret = btrfs_search_slot(NULL, dev_root, &key, path, 0, 0);
7123 __btrfs_reset_dev_stats(device);
7124 device->dev_stats_valid = 1;
7125 btrfs_release_path(path);
7128 slot = path->slots[0];
7129 eb = path->nodes[0];
7130 btrfs_item_key_to_cpu(eb, &found_key, slot);
7131 item_size = btrfs_item_size_nr(eb, slot);
7133 ptr = btrfs_item_ptr(eb, slot,
7134 struct btrfs_dev_stats_item);
7136 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7137 if (item_size >= (1 + i) * sizeof(__le64))
7138 btrfs_dev_stat_set(device, i,
7139 btrfs_dev_stats_value(eb, ptr, i));
7141 btrfs_dev_stat_reset(device, i);
7144 device->dev_stats_valid = 1;
7145 btrfs_dev_stat_print_on_load(device);
7146 btrfs_release_path(path);
7148 mutex_unlock(&fs_devices->device_list_mutex);
7151 btrfs_free_path(path);
7152 return ret < 0 ? ret : 0;
7155 static int update_dev_stat_item(struct btrfs_trans_handle *trans,
7156 struct btrfs_fs_info *fs_info,
7157 struct btrfs_device *device)
7159 struct btrfs_root *dev_root = fs_info->dev_root;
7160 struct btrfs_path *path;
7161 struct btrfs_key key;
7162 struct extent_buffer *eb;
7163 struct btrfs_dev_stats_item *ptr;
7167 key.objectid = BTRFS_DEV_STATS_OBJECTID;
7168 key.type = BTRFS_PERSISTENT_ITEM_KEY;
7169 key.offset = device->devid;
7171 path = btrfs_alloc_path();
7174 ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1);
7176 btrfs_warn_in_rcu(fs_info,
7177 "error %d while searching for dev_stats item for device %s",
7178 ret, rcu_str_deref(device->name));
7183 btrfs_item_size_nr(path->nodes[0], path->slots[0]) < sizeof(*ptr)) {
7184 /* need to delete old one and insert a new one */
7185 ret = btrfs_del_item(trans, dev_root, path);
7187 btrfs_warn_in_rcu(fs_info,
7188 "delete too small dev_stats item for device %s failed %d",
7189 rcu_str_deref(device->name), ret);
7196 /* need to insert a new item */
7197 btrfs_release_path(path);
7198 ret = btrfs_insert_empty_item(trans, dev_root, path,
7199 &key, sizeof(*ptr));
7201 btrfs_warn_in_rcu(fs_info,
7202 "insert dev_stats item for device %s failed %d",
7203 rcu_str_deref(device->name), ret);
7208 eb = path->nodes[0];
7209 ptr = btrfs_item_ptr(eb, path->slots[0], struct btrfs_dev_stats_item);
7210 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7211 btrfs_set_dev_stats_value(eb, ptr, i,
7212 btrfs_dev_stat_read(device, i));
7213 btrfs_mark_buffer_dirty(eb);
7216 btrfs_free_path(path);
7221 * called from commit_transaction. Writes all changed device stats to disk.
7223 int btrfs_run_dev_stats(struct btrfs_trans_handle *trans,
7224 struct btrfs_fs_info *fs_info)
7226 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7227 struct btrfs_device *device;
7231 mutex_lock(&fs_devices->device_list_mutex);
7232 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7233 stats_cnt = atomic_read(&device->dev_stats_ccnt);
7234 if (!device->dev_stats_valid || stats_cnt == 0)
7239 * There is a LOAD-LOAD control dependency between the value of
7240 * dev_stats_ccnt and updating the on-disk values which requires
7241 * reading the in-memory counters. Such control dependencies
7242 * require explicit read memory barriers.
7244 * This memory barriers pairs with smp_mb__before_atomic in
7245 * btrfs_dev_stat_inc/btrfs_dev_stat_set and with the full
7246 * barrier implied by atomic_xchg in
7247 * btrfs_dev_stats_read_and_reset
7251 ret = update_dev_stat_item(trans, fs_info, device);
7253 atomic_sub(stats_cnt, &device->dev_stats_ccnt);
7255 mutex_unlock(&fs_devices->device_list_mutex);
7260 void btrfs_dev_stat_inc_and_print(struct btrfs_device *dev, int index)
7262 btrfs_dev_stat_inc(dev, index);
7263 btrfs_dev_stat_print_on_error(dev);
7266 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev)
7268 if (!dev->dev_stats_valid)
7270 btrfs_err_rl_in_rcu(dev->fs_info,
7271 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7272 rcu_str_deref(dev->name),
7273 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7274 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7275 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7276 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7277 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7280 static void btrfs_dev_stat_print_on_load(struct btrfs_device *dev)
7284 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7285 if (btrfs_dev_stat_read(dev, i) != 0)
7287 if (i == BTRFS_DEV_STAT_VALUES_MAX)
7288 return; /* all values == 0, suppress message */
7290 btrfs_info_in_rcu(dev->fs_info,
7291 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7292 rcu_str_deref(dev->name),
7293 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7294 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7295 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7296 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7297 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7300 int btrfs_get_dev_stats(struct btrfs_fs_info *fs_info,
7301 struct btrfs_ioctl_get_dev_stats *stats)
7303 struct btrfs_device *dev;
7304 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7307 mutex_lock(&fs_devices->device_list_mutex);
7308 dev = btrfs_find_device(fs_info, stats->devid, NULL, NULL);
7309 mutex_unlock(&fs_devices->device_list_mutex);
7312 btrfs_warn(fs_info, "get dev_stats failed, device not found");
7314 } else if (!dev->dev_stats_valid) {
7315 btrfs_warn(fs_info, "get dev_stats failed, not yet valid");
7317 } else if (stats->flags & BTRFS_DEV_STATS_RESET) {
7318 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7319 if (stats->nr_items > i)
7321 btrfs_dev_stat_read_and_reset(dev, i);
7323 btrfs_dev_stat_reset(dev, i);
7326 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7327 if (stats->nr_items > i)
7328 stats->values[i] = btrfs_dev_stat_read(dev, i);
7330 if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX)
7331 stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX;
7335 void btrfs_scratch_superblocks(struct block_device *bdev, const char *device_path)
7337 struct buffer_head *bh;
7338 struct btrfs_super_block *disk_super;
7344 for (copy_num = 0; copy_num < BTRFS_SUPER_MIRROR_MAX;
7347 if (btrfs_read_dev_one_super(bdev, copy_num, &bh))
7350 disk_super = (struct btrfs_super_block *)bh->b_data;
7352 memset(&disk_super->magic, 0, sizeof(disk_super->magic));
7353 set_buffer_dirty(bh);
7354 sync_dirty_buffer(bh);
7358 /* Notify udev that device has changed */
7359 btrfs_kobject_uevent(bdev, KOBJ_CHANGE);
7361 /* Update ctime/mtime for device path for libblkid */
7362 update_dev_time(device_path);
7366 * Update the size of all devices, which is used for writing out the
7369 void btrfs_update_commit_device_size(struct btrfs_fs_info *fs_info)
7371 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7372 struct btrfs_device *curr, *next;
7374 if (list_empty(&fs_devices->resized_devices))
7377 mutex_lock(&fs_devices->device_list_mutex);
7378 mutex_lock(&fs_info->chunk_mutex);
7379 list_for_each_entry_safe(curr, next, &fs_devices->resized_devices,
7381 list_del_init(&curr->resized_list);
7382 curr->commit_total_bytes = curr->disk_total_bytes;
7384 mutex_unlock(&fs_info->chunk_mutex);
7385 mutex_unlock(&fs_devices->device_list_mutex);
7388 /* Must be invoked during the transaction commit */
7389 void btrfs_update_commit_device_bytes_used(struct btrfs_transaction *trans)
7391 struct btrfs_fs_info *fs_info = trans->fs_info;
7392 struct extent_map *em;
7393 struct map_lookup *map;
7394 struct btrfs_device *dev;
7397 if (list_empty(&trans->pending_chunks))
7400 /* In order to kick the device replace finish process */
7401 mutex_lock(&fs_info->chunk_mutex);
7402 list_for_each_entry(em, &trans->pending_chunks, list) {
7403 map = em->map_lookup;
7405 for (i = 0; i < map->num_stripes; i++) {
7406 dev = map->stripes[i].dev;
7407 dev->commit_bytes_used = dev->bytes_used;
7410 mutex_unlock(&fs_info->chunk_mutex);
7413 void btrfs_set_fs_info_ptr(struct btrfs_fs_info *fs_info)
7415 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7416 while (fs_devices) {
7417 fs_devices->fs_info = fs_info;
7418 fs_devices = fs_devices->seed;
7422 void btrfs_reset_fs_info_ptr(struct btrfs_fs_info *fs_info)
7424 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7425 while (fs_devices) {
7426 fs_devices->fs_info = NULL;
7427 fs_devices = fs_devices->seed;