2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
18 #include <linux/sched.h>
19 #include <linux/bio.h>
20 #include <linux/slab.h>
21 #include <linux/buffer_head.h>
22 #include <linux/blkdev.h>
23 #include <linux/iocontext.h>
24 #include <linux/capability.h>
25 #include <linux/ratelimit.h>
26 #include <linux/kthread.h>
27 #include <linux/raid/pq.h>
28 #include <linux/semaphore.h>
29 #include <linux/uuid.h>
30 #include <asm/div64.h>
32 #include "extent_map.h"
34 #include "transaction.h"
35 #include "print-tree.h"
38 #include "async-thread.h"
39 #include "check-integrity.h"
40 #include "rcu-string.h"
42 #include "dev-replace.h"
45 const struct btrfs_raid_attr btrfs_raid_array[BTRFS_NR_RAID_TYPES] = {
46 [BTRFS_RAID_RAID10] = {
49 .devs_max = 0, /* 0 == as many as possible */
51 .tolerated_failures = 1,
55 [BTRFS_RAID_RAID1] = {
60 .tolerated_failures = 1,
69 .tolerated_failures = 0,
73 [BTRFS_RAID_RAID0] = {
78 .tolerated_failures = 0,
82 [BTRFS_RAID_SINGLE] = {
87 .tolerated_failures = 0,
91 [BTRFS_RAID_RAID5] = {
96 .tolerated_failures = 1,
100 [BTRFS_RAID_RAID6] = {
105 .tolerated_failures = 2,
111 const u64 btrfs_raid_group[BTRFS_NR_RAID_TYPES] = {
112 [BTRFS_RAID_RAID10] = BTRFS_BLOCK_GROUP_RAID10,
113 [BTRFS_RAID_RAID1] = BTRFS_BLOCK_GROUP_RAID1,
114 [BTRFS_RAID_DUP] = BTRFS_BLOCK_GROUP_DUP,
115 [BTRFS_RAID_RAID0] = BTRFS_BLOCK_GROUP_RAID0,
116 [BTRFS_RAID_SINGLE] = 0,
117 [BTRFS_RAID_RAID5] = BTRFS_BLOCK_GROUP_RAID5,
118 [BTRFS_RAID_RAID6] = BTRFS_BLOCK_GROUP_RAID6,
122 * Table to convert BTRFS_RAID_* to the error code if minimum number of devices
123 * condition is not met. Zero means there's no corresponding
124 * BTRFS_ERROR_DEV_*_NOT_MET value.
126 const int btrfs_raid_mindev_error[BTRFS_NR_RAID_TYPES] = {
127 [BTRFS_RAID_RAID10] = BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET,
128 [BTRFS_RAID_RAID1] = BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET,
129 [BTRFS_RAID_DUP] = 0,
130 [BTRFS_RAID_RAID0] = 0,
131 [BTRFS_RAID_SINGLE] = 0,
132 [BTRFS_RAID_RAID5] = BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET,
133 [BTRFS_RAID_RAID6] = BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET,
136 static int init_first_rw_device(struct btrfs_trans_handle *trans,
137 struct btrfs_root *root,
138 struct btrfs_device *device);
139 static int btrfs_relocate_sys_chunks(struct btrfs_root *root);
140 static void __btrfs_reset_dev_stats(struct btrfs_device *dev);
141 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev);
142 static void btrfs_dev_stat_print_on_load(struct btrfs_device *device);
144 DEFINE_MUTEX(uuid_mutex);
145 static LIST_HEAD(fs_uuids);
146 struct list_head *btrfs_get_fs_uuids(void)
151 static struct btrfs_fs_devices *__alloc_fs_devices(void)
153 struct btrfs_fs_devices *fs_devs;
155 fs_devs = kzalloc(sizeof(*fs_devs), GFP_KERNEL);
157 return ERR_PTR(-ENOMEM);
159 mutex_init(&fs_devs->device_list_mutex);
161 INIT_LIST_HEAD(&fs_devs->devices);
162 INIT_LIST_HEAD(&fs_devs->resized_devices);
163 INIT_LIST_HEAD(&fs_devs->alloc_list);
164 INIT_LIST_HEAD(&fs_devs->list);
170 * alloc_fs_devices - allocate struct btrfs_fs_devices
171 * @fsid: a pointer to UUID for this FS. If NULL a new UUID is
174 * Return: a pointer to a new &struct btrfs_fs_devices on success;
175 * ERR_PTR() on error. Returned struct is not linked onto any lists and
176 * can be destroyed with kfree() right away.
178 static struct btrfs_fs_devices *alloc_fs_devices(const u8 *fsid)
180 struct btrfs_fs_devices *fs_devs;
182 fs_devs = __alloc_fs_devices();
187 memcpy(fs_devs->fsid, fsid, BTRFS_FSID_SIZE);
189 generate_random_uuid(fs_devs->fsid);
194 static void free_fs_devices(struct btrfs_fs_devices *fs_devices)
196 struct btrfs_device *device;
197 WARN_ON(fs_devices->opened);
198 while (!list_empty(&fs_devices->devices)) {
199 device = list_entry(fs_devices->devices.next,
200 struct btrfs_device, dev_list);
201 list_del(&device->dev_list);
202 rcu_string_free(device->name);
208 static void btrfs_kobject_uevent(struct block_device *bdev,
209 enum kobject_action action)
213 ret = kobject_uevent(&disk_to_dev(bdev->bd_disk)->kobj, action);
215 pr_warn("BTRFS: Sending event '%d' to kobject: '%s' (%p): failed\n",
217 kobject_name(&disk_to_dev(bdev->bd_disk)->kobj),
218 &disk_to_dev(bdev->bd_disk)->kobj);
221 void btrfs_cleanup_fs_uuids(void)
223 struct btrfs_fs_devices *fs_devices;
225 while (!list_empty(&fs_uuids)) {
226 fs_devices = list_entry(fs_uuids.next,
227 struct btrfs_fs_devices, list);
228 list_del(&fs_devices->list);
229 free_fs_devices(fs_devices);
233 static struct btrfs_device *__alloc_device(void)
235 struct btrfs_device *dev;
237 dev = kzalloc(sizeof(*dev), GFP_KERNEL);
239 return ERR_PTR(-ENOMEM);
241 INIT_LIST_HEAD(&dev->dev_list);
242 INIT_LIST_HEAD(&dev->dev_alloc_list);
243 INIT_LIST_HEAD(&dev->resized_list);
245 spin_lock_init(&dev->io_lock);
247 spin_lock_init(&dev->reada_lock);
248 atomic_set(&dev->reada_in_flight, 0);
249 atomic_set(&dev->dev_stats_ccnt, 0);
250 btrfs_device_data_ordered_init(dev);
251 INIT_RADIX_TREE(&dev->reada_zones, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
252 INIT_RADIX_TREE(&dev->reada_extents, GFP_NOFS & ~__GFP_DIRECT_RECLAIM);
257 static noinline struct btrfs_device *__find_device(struct list_head *head,
260 struct btrfs_device *dev;
262 list_for_each_entry(dev, head, dev_list) {
263 if (dev->devid == devid &&
264 (!uuid || !memcmp(dev->uuid, uuid, BTRFS_UUID_SIZE))) {
271 static noinline struct btrfs_fs_devices *find_fsid(u8 *fsid)
273 struct btrfs_fs_devices *fs_devices;
275 list_for_each_entry(fs_devices, &fs_uuids, list) {
276 if (memcmp(fsid, fs_devices->fsid, BTRFS_FSID_SIZE) == 0)
283 btrfs_get_bdev_and_sb(const char *device_path, fmode_t flags, void *holder,
284 int flush, struct block_device **bdev,
285 struct buffer_head **bh)
289 *bdev = blkdev_get_by_path(device_path, flags, holder);
292 ret = PTR_ERR(*bdev);
297 filemap_write_and_wait((*bdev)->bd_inode->i_mapping);
298 ret = set_blocksize(*bdev, 4096);
300 blkdev_put(*bdev, flags);
303 invalidate_bdev(*bdev);
304 *bh = btrfs_read_dev_super(*bdev);
307 blkdev_put(*bdev, flags);
319 static void requeue_list(struct btrfs_pending_bios *pending_bios,
320 struct bio *head, struct bio *tail)
323 struct bio *old_head;
325 old_head = pending_bios->head;
326 pending_bios->head = head;
327 if (pending_bios->tail)
328 tail->bi_next = old_head;
330 pending_bios->tail = tail;
334 * we try to collect pending bios for a device so we don't get a large
335 * number of procs sending bios down to the same device. This greatly
336 * improves the schedulers ability to collect and merge the bios.
338 * But, it also turns into a long list of bios to process and that is sure
339 * to eventually make the worker thread block. The solution here is to
340 * make some progress and then put this work struct back at the end of
341 * the list if the block device is congested. This way, multiple devices
342 * can make progress from a single worker thread.
344 static noinline void run_scheduled_bios(struct btrfs_device *device)
347 struct backing_dev_info *bdi;
348 struct btrfs_fs_info *fs_info;
349 struct btrfs_pending_bios *pending_bios;
353 unsigned long num_run;
354 unsigned long batch_run = 0;
356 unsigned long last_waited = 0;
358 int sync_pending = 0;
359 struct blk_plug plug;
362 * this function runs all the bios we've collected for
363 * a particular device. We don't want to wander off to
364 * another device without first sending all of these down.
365 * So, setup a plug here and finish it off before we return
367 blk_start_plug(&plug);
369 bdi = blk_get_backing_dev_info(device->bdev);
370 fs_info = device->fs_info;
371 limit = btrfs_async_submit_limit(fs_info);
372 limit = limit * 2 / 3;
375 spin_lock(&device->io_lock);
380 /* take all the bios off the list at once and process them
381 * later on (without the lock held). But, remember the
382 * tail and other pointers so the bios can be properly reinserted
383 * into the list if we hit congestion
385 if (!force_reg && device->pending_sync_bios.head) {
386 pending_bios = &device->pending_sync_bios;
389 pending_bios = &device->pending_bios;
393 pending = pending_bios->head;
394 tail = pending_bios->tail;
395 WARN_ON(pending && !tail);
398 * if pending was null this time around, no bios need processing
399 * at all and we can stop. Otherwise it'll loop back up again
400 * and do an additional check so no bios are missed.
402 * device->running_pending is used to synchronize with the
405 if (device->pending_sync_bios.head == NULL &&
406 device->pending_bios.head == NULL) {
408 device->running_pending = 0;
411 device->running_pending = 1;
414 pending_bios->head = NULL;
415 pending_bios->tail = NULL;
417 spin_unlock(&device->io_lock);
422 /* we want to work on both lists, but do more bios on the
423 * sync list than the regular list
426 pending_bios != &device->pending_sync_bios &&
427 device->pending_sync_bios.head) ||
428 (num_run > 64 && pending_bios == &device->pending_sync_bios &&
429 device->pending_bios.head)) {
430 spin_lock(&device->io_lock);
431 requeue_list(pending_bios, pending, tail);
436 pending = pending->bi_next;
440 * atomic_dec_return implies a barrier for waitqueue_active
442 if (atomic_dec_return(&fs_info->nr_async_bios) < limit &&
443 waitqueue_active(&fs_info->async_submit_wait))
444 wake_up(&fs_info->async_submit_wait);
446 BUG_ON(atomic_read(&cur->__bi_cnt) == 0);
449 * if we're doing the sync list, record that our
450 * plug has some sync requests on it
452 * If we're doing the regular list and there are
453 * sync requests sitting around, unplug before
456 if (pending_bios == &device->pending_sync_bios) {
458 } else if (sync_pending) {
459 blk_finish_plug(&plug);
460 blk_start_plug(&plug);
464 btrfsic_submit_bio(cur);
471 * we made progress, there is more work to do and the bdi
472 * is now congested. Back off and let other work structs
475 if (pending && bdi_write_congested(bdi) && batch_run > 8 &&
476 fs_info->fs_devices->open_devices > 1) {
477 struct io_context *ioc;
479 ioc = current->io_context;
482 * the main goal here is that we don't want to
483 * block if we're going to be able to submit
484 * more requests without blocking.
486 * This code does two great things, it pokes into
487 * the elevator code from a filesystem _and_
488 * it makes assumptions about how batching works.
490 if (ioc && ioc->nr_batch_requests > 0 &&
491 time_before(jiffies, ioc->last_waited + HZ/50UL) &&
493 ioc->last_waited == last_waited)) {
495 * we want to go through our batch of
496 * requests and stop. So, we copy out
497 * the ioc->last_waited time and test
498 * against it before looping
500 last_waited = ioc->last_waited;
504 spin_lock(&device->io_lock);
505 requeue_list(pending_bios, pending, tail);
506 device->running_pending = 1;
508 spin_unlock(&device->io_lock);
509 btrfs_queue_work(fs_info->submit_workers,
513 /* unplug every 64 requests just for good measure */
514 if (batch_run % 64 == 0) {
515 blk_finish_plug(&plug);
516 blk_start_plug(&plug);
525 spin_lock(&device->io_lock);
526 if (device->pending_bios.head || device->pending_sync_bios.head)
528 spin_unlock(&device->io_lock);
531 blk_finish_plug(&plug);
534 static void pending_bios_fn(struct btrfs_work *work)
536 struct btrfs_device *device;
538 device = container_of(work, struct btrfs_device, work);
539 run_scheduled_bios(device);
543 void btrfs_free_stale_device(struct btrfs_device *cur_dev)
545 struct btrfs_fs_devices *fs_devs;
546 struct btrfs_device *dev;
551 list_for_each_entry(fs_devs, &fs_uuids, list) {
556 if (fs_devs->seeding)
559 list_for_each_entry(dev, &fs_devs->devices, dev_list) {
567 * Todo: This won't be enough. What if the same device
568 * comes back (with new uuid and) with its mapper path?
569 * But for now, this does help as mostly an admin will
570 * either use mapper or non mapper path throughout.
573 del = strcmp(rcu_str_deref(dev->name),
574 rcu_str_deref(cur_dev->name));
581 /* delete the stale device */
582 if (fs_devs->num_devices == 1) {
583 btrfs_sysfs_remove_fsid(fs_devs);
584 list_del(&fs_devs->list);
585 free_fs_devices(fs_devs);
587 fs_devs->num_devices--;
588 list_del(&dev->dev_list);
589 rcu_string_free(dev->name);
598 * Add new device to list of registered devices
601 * 1 - first time device is seen
602 * 0 - device already known
605 static noinline int device_list_add(const char *path,
606 struct btrfs_super_block *disk_super,
607 u64 devid, struct btrfs_fs_devices **fs_devices_ret)
609 struct btrfs_device *device;
610 struct btrfs_fs_devices *fs_devices;
611 struct rcu_string *name;
613 u64 found_transid = btrfs_super_generation(disk_super);
615 fs_devices = find_fsid(disk_super->fsid);
617 fs_devices = alloc_fs_devices(disk_super->fsid);
618 if (IS_ERR(fs_devices))
619 return PTR_ERR(fs_devices);
621 list_add(&fs_devices->list, &fs_uuids);
625 device = __find_device(&fs_devices->devices, devid,
626 disk_super->dev_item.uuid);
630 if (fs_devices->opened)
633 device = btrfs_alloc_device(NULL, &devid,
634 disk_super->dev_item.uuid);
635 if (IS_ERR(device)) {
636 /* we can safely leave the fs_devices entry around */
637 return PTR_ERR(device);
640 name = rcu_string_strdup(path, GFP_NOFS);
645 rcu_assign_pointer(device->name, name);
647 mutex_lock(&fs_devices->device_list_mutex);
648 list_add_rcu(&device->dev_list, &fs_devices->devices);
649 fs_devices->num_devices++;
650 mutex_unlock(&fs_devices->device_list_mutex);
653 device->fs_devices = fs_devices;
654 } else if (!device->name || strcmp(device->name->str, path)) {
656 * When FS is already mounted.
657 * 1. If you are here and if the device->name is NULL that
658 * means this device was missing at time of FS mount.
659 * 2. If you are here and if the device->name is different
660 * from 'path' that means either
661 * a. The same device disappeared and reappeared with
663 * b. The missing-disk-which-was-replaced, has
666 * We must allow 1 and 2a above. But 2b would be a spurious
669 * Further in case of 1 and 2a above, the disk at 'path'
670 * would have missed some transaction when it was away and
671 * in case of 2a the stale bdev has to be updated as well.
672 * 2b must not be allowed at all time.
676 * For now, we do allow update to btrfs_fs_device through the
677 * btrfs dev scan cli after FS has been mounted. We're still
678 * tracking a problem where systems fail mount by subvolume id
679 * when we reject replacement on a mounted FS.
681 if (!fs_devices->opened && found_transid < device->generation) {
683 * That is if the FS is _not_ mounted and if you
684 * are here, that means there is more than one
685 * disk with same uuid and devid.We keep the one
686 * with larger generation number or the last-in if
687 * generation are equal.
692 name = rcu_string_strdup(path, GFP_NOFS);
695 rcu_string_free(device->name);
696 rcu_assign_pointer(device->name, name);
697 if (device->missing) {
698 fs_devices->missing_devices--;
704 * Unmount does not free the btrfs_device struct but would zero
705 * generation along with most of the other members. So just update
706 * it back. We need it to pick the disk with largest generation
709 if (!fs_devices->opened)
710 device->generation = found_transid;
713 * if there is new btrfs on an already registered device,
714 * then remove the stale device entry.
717 btrfs_free_stale_device(device);
719 *fs_devices_ret = fs_devices;
724 static struct btrfs_fs_devices *clone_fs_devices(struct btrfs_fs_devices *orig)
726 struct btrfs_fs_devices *fs_devices;
727 struct btrfs_device *device;
728 struct btrfs_device *orig_dev;
730 fs_devices = alloc_fs_devices(orig->fsid);
731 if (IS_ERR(fs_devices))
734 mutex_lock(&orig->device_list_mutex);
735 fs_devices->total_devices = orig->total_devices;
737 /* We have held the volume lock, it is safe to get the devices. */
738 list_for_each_entry(orig_dev, &orig->devices, dev_list) {
739 struct rcu_string *name;
741 device = btrfs_alloc_device(NULL, &orig_dev->devid,
747 * This is ok to do without rcu read locked because we hold the
748 * uuid mutex so nothing we touch in here is going to disappear.
750 if (orig_dev->name) {
751 name = rcu_string_strdup(orig_dev->name->str,
757 rcu_assign_pointer(device->name, name);
760 list_add(&device->dev_list, &fs_devices->devices);
761 device->fs_devices = fs_devices;
762 fs_devices->num_devices++;
764 mutex_unlock(&orig->device_list_mutex);
767 mutex_unlock(&orig->device_list_mutex);
768 free_fs_devices(fs_devices);
769 return ERR_PTR(-ENOMEM);
772 void btrfs_close_extra_devices(struct btrfs_fs_devices *fs_devices, int step)
774 struct btrfs_device *device, *next;
775 struct btrfs_device *latest_dev = NULL;
777 mutex_lock(&uuid_mutex);
779 /* This is the initialized path, it is safe to release the devices. */
780 list_for_each_entry_safe(device, next, &fs_devices->devices, dev_list) {
781 if (device->in_fs_metadata) {
782 if (!device->is_tgtdev_for_dev_replace &&
784 device->generation > latest_dev->generation)) {
790 if (device->devid == BTRFS_DEV_REPLACE_DEVID) {
792 * In the first step, keep the device which has
793 * the correct fsid and the devid that is used
794 * for the dev_replace procedure.
795 * In the second step, the dev_replace state is
796 * read from the device tree and it is known
797 * whether the procedure is really active or
798 * not, which means whether this device is
799 * used or whether it should be removed.
801 if (step == 0 || device->is_tgtdev_for_dev_replace) {
806 blkdev_put(device->bdev, device->mode);
808 fs_devices->open_devices--;
810 if (device->writeable) {
811 list_del_init(&device->dev_alloc_list);
812 device->writeable = 0;
813 if (!device->is_tgtdev_for_dev_replace)
814 fs_devices->rw_devices--;
816 list_del_init(&device->dev_list);
817 fs_devices->num_devices--;
818 rcu_string_free(device->name);
822 if (fs_devices->seed) {
823 fs_devices = fs_devices->seed;
827 fs_devices->latest_bdev = latest_dev->bdev;
829 mutex_unlock(&uuid_mutex);
832 static void __free_device(struct work_struct *work)
834 struct btrfs_device *device;
836 device = container_of(work, struct btrfs_device, rcu_work);
837 rcu_string_free(device->name);
841 static void free_device(struct rcu_head *head)
843 struct btrfs_device *device;
845 device = container_of(head, struct btrfs_device, rcu);
847 INIT_WORK(&device->rcu_work, __free_device);
848 schedule_work(&device->rcu_work);
851 static void btrfs_close_bdev(struct btrfs_device *device)
853 if (device->bdev && device->writeable) {
854 sync_blockdev(device->bdev);
855 invalidate_bdev(device->bdev);
859 blkdev_put(device->bdev, device->mode);
862 static void btrfs_prepare_close_one_device(struct btrfs_device *device)
864 struct btrfs_fs_devices *fs_devices = device->fs_devices;
865 struct btrfs_device *new_device;
866 struct rcu_string *name;
869 fs_devices->open_devices--;
871 if (device->writeable &&
872 device->devid != BTRFS_DEV_REPLACE_DEVID) {
873 list_del_init(&device->dev_alloc_list);
874 fs_devices->rw_devices--;
878 fs_devices->missing_devices--;
880 new_device = btrfs_alloc_device(NULL, &device->devid,
882 BUG_ON(IS_ERR(new_device)); /* -ENOMEM */
884 /* Safe because we are under uuid_mutex */
886 name = rcu_string_strdup(device->name->str, GFP_NOFS);
887 BUG_ON(!name); /* -ENOMEM */
888 rcu_assign_pointer(new_device->name, name);
891 list_replace_rcu(&device->dev_list, &new_device->dev_list);
892 new_device->fs_devices = device->fs_devices;
895 static int __btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
897 struct btrfs_device *device, *tmp;
898 struct list_head pending_put;
900 INIT_LIST_HEAD(&pending_put);
902 if (--fs_devices->opened > 0)
905 mutex_lock(&fs_devices->device_list_mutex);
906 list_for_each_entry_safe(device, tmp, &fs_devices->devices, dev_list) {
907 btrfs_prepare_close_one_device(device);
908 list_add(&device->dev_list, &pending_put);
910 mutex_unlock(&fs_devices->device_list_mutex);
913 * btrfs_show_devname() is using the device_list_mutex,
914 * sometimes call to blkdev_put() leads vfs calling
915 * into this func. So do put outside of device_list_mutex,
918 while (!list_empty(&pending_put)) {
919 device = list_first_entry(&pending_put,
920 struct btrfs_device, dev_list);
921 list_del(&device->dev_list);
922 btrfs_close_bdev(device);
923 call_rcu(&device->rcu, free_device);
926 WARN_ON(fs_devices->open_devices);
927 WARN_ON(fs_devices->rw_devices);
928 fs_devices->opened = 0;
929 fs_devices->seeding = 0;
934 int btrfs_close_devices(struct btrfs_fs_devices *fs_devices)
936 struct btrfs_fs_devices *seed_devices = NULL;
939 mutex_lock(&uuid_mutex);
940 ret = __btrfs_close_devices(fs_devices);
941 if (!fs_devices->opened) {
942 seed_devices = fs_devices->seed;
943 fs_devices->seed = NULL;
945 mutex_unlock(&uuid_mutex);
947 while (seed_devices) {
948 fs_devices = seed_devices;
949 seed_devices = fs_devices->seed;
950 __btrfs_close_devices(fs_devices);
951 free_fs_devices(fs_devices);
954 * Wait for rcu kworkers under __btrfs_close_devices
955 * to finish all blkdev_puts so device is really
956 * free when umount is done.
962 static int __btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
963 fmode_t flags, void *holder)
965 struct request_queue *q;
966 struct block_device *bdev;
967 struct list_head *head = &fs_devices->devices;
968 struct btrfs_device *device;
969 struct btrfs_device *latest_dev = NULL;
970 struct buffer_head *bh;
971 struct btrfs_super_block *disk_super;
978 list_for_each_entry(device, head, dev_list) {
984 /* Just open everything we can; ignore failures here */
985 if (btrfs_get_bdev_and_sb(device->name->str, flags, holder, 1,
989 disk_super = (struct btrfs_super_block *)bh->b_data;
990 devid = btrfs_stack_device_id(&disk_super->dev_item);
991 if (devid != device->devid)
994 if (memcmp(device->uuid, disk_super->dev_item.uuid,
998 device->generation = btrfs_super_generation(disk_super);
1000 device->generation > latest_dev->generation)
1001 latest_dev = device;
1003 if (btrfs_super_flags(disk_super) & BTRFS_SUPER_FLAG_SEEDING) {
1004 device->writeable = 0;
1006 device->writeable = !bdev_read_only(bdev);
1010 q = bdev_get_queue(bdev);
1011 if (blk_queue_discard(q))
1012 device->can_discard = 1;
1014 device->bdev = bdev;
1015 device->in_fs_metadata = 0;
1016 device->mode = flags;
1018 if (!blk_queue_nonrot(bdev_get_queue(bdev)))
1019 fs_devices->rotating = 1;
1021 fs_devices->open_devices++;
1022 if (device->writeable &&
1023 device->devid != BTRFS_DEV_REPLACE_DEVID) {
1024 fs_devices->rw_devices++;
1025 list_add(&device->dev_alloc_list,
1026 &fs_devices->alloc_list);
1033 blkdev_put(bdev, flags);
1036 if (fs_devices->open_devices == 0) {
1040 fs_devices->seeding = seeding;
1041 fs_devices->opened = 1;
1042 fs_devices->latest_bdev = latest_dev->bdev;
1043 fs_devices->total_rw_bytes = 0;
1048 int btrfs_open_devices(struct btrfs_fs_devices *fs_devices,
1049 fmode_t flags, void *holder)
1053 mutex_lock(&uuid_mutex);
1054 if (fs_devices->opened) {
1055 fs_devices->opened++;
1058 ret = __btrfs_open_devices(fs_devices, flags, holder);
1060 mutex_unlock(&uuid_mutex);
1064 void btrfs_release_disk_super(struct page *page)
1070 int btrfs_read_disk_super(struct block_device *bdev, u64 bytenr,
1071 struct page **page, struct btrfs_super_block **disk_super)
1076 /* make sure our super fits in the device */
1077 if (bytenr + PAGE_SIZE >= i_size_read(bdev->bd_inode))
1080 /* make sure our super fits in the page */
1081 if (sizeof(**disk_super) > PAGE_SIZE)
1084 /* make sure our super doesn't straddle pages on disk */
1085 index = bytenr >> PAGE_SHIFT;
1086 if ((bytenr + sizeof(**disk_super) - 1) >> PAGE_SHIFT != index)
1089 /* pull in the page with our super */
1090 *page = read_cache_page_gfp(bdev->bd_inode->i_mapping,
1093 if (IS_ERR_OR_NULL(*page))
1098 /* align our pointer to the offset of the super block */
1099 *disk_super = p + (bytenr & ~PAGE_MASK);
1101 if (btrfs_super_bytenr(*disk_super) != bytenr ||
1102 btrfs_super_magic(*disk_super) != BTRFS_MAGIC) {
1103 btrfs_release_disk_super(*page);
1107 if ((*disk_super)->label[0] &&
1108 (*disk_super)->label[BTRFS_LABEL_SIZE - 1])
1109 (*disk_super)->label[BTRFS_LABEL_SIZE - 1] = '\0';
1115 * Look for a btrfs signature on a device. This may be called out of the mount path
1116 * and we are not allowed to call set_blocksize during the scan. The superblock
1117 * is read via pagecache
1119 int btrfs_scan_one_device(const char *path, fmode_t flags, void *holder,
1120 struct btrfs_fs_devices **fs_devices_ret)
1122 struct btrfs_super_block *disk_super;
1123 struct block_device *bdev;
1132 * we would like to check all the supers, but that would make
1133 * a btrfs mount succeed after a mkfs from a different FS.
1134 * So, we need to add a special mount option to scan for
1135 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
1137 bytenr = btrfs_sb_offset(0);
1138 flags |= FMODE_EXCL;
1139 mutex_lock(&uuid_mutex);
1141 bdev = blkdev_get_by_path(path, flags, holder);
1143 ret = PTR_ERR(bdev);
1147 if (btrfs_read_disk_super(bdev, bytenr, &page, &disk_super))
1148 goto error_bdev_put;
1150 devid = btrfs_stack_device_id(&disk_super->dev_item);
1151 transid = btrfs_super_generation(disk_super);
1152 total_devices = btrfs_super_num_devices(disk_super);
1154 ret = device_list_add(path, disk_super, devid, fs_devices_ret);
1156 if (disk_super->label[0]) {
1157 pr_info("BTRFS: device label %s ", disk_super->label);
1159 pr_info("BTRFS: device fsid %pU ", disk_super->fsid);
1162 pr_cont("devid %llu transid %llu %s\n", devid, transid, path);
1165 if (!ret && fs_devices_ret)
1166 (*fs_devices_ret)->total_devices = total_devices;
1168 btrfs_release_disk_super(page);
1171 blkdev_put(bdev, flags);
1173 mutex_unlock(&uuid_mutex);
1177 /* helper to account the used device space in the range */
1178 int btrfs_account_dev_extents_size(struct btrfs_device *device, u64 start,
1179 u64 end, u64 *length)
1181 struct btrfs_key key;
1182 struct btrfs_root *root = device->fs_info->dev_root;
1183 struct btrfs_dev_extent *dev_extent;
1184 struct btrfs_path *path;
1188 struct extent_buffer *l;
1192 if (start >= device->total_bytes || device->is_tgtdev_for_dev_replace)
1195 path = btrfs_alloc_path();
1198 path->reada = READA_FORWARD;
1200 key.objectid = device->devid;
1202 key.type = BTRFS_DEV_EXTENT_KEY;
1204 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1208 ret = btrfs_previous_item(root, path, key.objectid, key.type);
1215 slot = path->slots[0];
1216 if (slot >= btrfs_header_nritems(l)) {
1217 ret = btrfs_next_leaf(root, path);
1225 btrfs_item_key_to_cpu(l, &key, slot);
1227 if (key.objectid < device->devid)
1230 if (key.objectid > device->devid)
1233 if (key.type != BTRFS_DEV_EXTENT_KEY)
1236 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1237 extent_end = key.offset + btrfs_dev_extent_length(l,
1239 if (key.offset <= start && extent_end > end) {
1240 *length = end - start + 1;
1242 } else if (key.offset <= start && extent_end > start)
1243 *length += extent_end - start;
1244 else if (key.offset > start && extent_end <= end)
1245 *length += extent_end - key.offset;
1246 else if (key.offset > start && key.offset <= end) {
1247 *length += end - key.offset + 1;
1249 } else if (key.offset > end)
1257 btrfs_free_path(path);
1261 static int contains_pending_extent(struct btrfs_transaction *transaction,
1262 struct btrfs_device *device,
1263 u64 *start, u64 len)
1265 struct btrfs_fs_info *fs_info = device->fs_info;
1266 struct extent_map *em;
1267 struct list_head *search_list = &fs_info->pinned_chunks;
1269 u64 physical_start = *start;
1272 search_list = &transaction->pending_chunks;
1274 list_for_each_entry(em, search_list, list) {
1275 struct map_lookup *map;
1278 map = em->map_lookup;
1279 for (i = 0; i < map->num_stripes; i++) {
1282 if (map->stripes[i].dev != device)
1284 if (map->stripes[i].physical >= physical_start + len ||
1285 map->stripes[i].physical + em->orig_block_len <=
1289 * Make sure that while processing the pinned list we do
1290 * not override our *start with a lower value, because
1291 * we can have pinned chunks that fall within this
1292 * device hole and that have lower physical addresses
1293 * than the pending chunks we processed before. If we
1294 * do not take this special care we can end up getting
1295 * 2 pending chunks that start at the same physical
1296 * device offsets because the end offset of a pinned
1297 * chunk can be equal to the start offset of some
1300 end = map->stripes[i].physical + em->orig_block_len;
1307 if (search_list != &fs_info->pinned_chunks) {
1308 search_list = &fs_info->pinned_chunks;
1317 * find_free_dev_extent_start - find free space in the specified device
1318 * @device: the device which we search the free space in
1319 * @num_bytes: the size of the free space that we need
1320 * @search_start: the position from which to begin the search
1321 * @start: store the start of the free space.
1322 * @len: the size of the free space. that we find, or the size
1323 * of the max free space if we don't find suitable free space
1325 * this uses a pretty simple search, the expectation is that it is
1326 * called very infrequently and that a given device has a small number
1329 * @start is used to store the start of the free space if we find. But if we
1330 * don't find suitable free space, it will be used to store the start position
1331 * of the max free space.
1333 * @len is used to store the size of the free space that we find.
1334 * But if we don't find suitable free space, it is used to store the size of
1335 * the max free space.
1337 int find_free_dev_extent_start(struct btrfs_transaction *transaction,
1338 struct btrfs_device *device, u64 num_bytes,
1339 u64 search_start, u64 *start, u64 *len)
1341 struct btrfs_root *root = device->fs_info->dev_root;
1342 struct btrfs_key key;
1343 struct btrfs_dev_extent *dev_extent;
1344 struct btrfs_path *path;
1349 u64 search_end = device->total_bytes;
1352 struct extent_buffer *l;
1353 u64 min_search_start;
1356 * We don't want to overwrite the superblock on the drive nor any area
1357 * used by the boot loader (grub for example), so we make sure to start
1358 * at an offset of at least 1MB.
1360 min_search_start = max(root->fs_info->alloc_start, 1024ull * 1024);
1361 search_start = max(search_start, min_search_start);
1363 path = btrfs_alloc_path();
1367 max_hole_start = search_start;
1371 if (search_start >= search_end || device->is_tgtdev_for_dev_replace) {
1376 path->reada = READA_FORWARD;
1377 path->search_commit_root = 1;
1378 path->skip_locking = 1;
1380 key.objectid = device->devid;
1381 key.offset = search_start;
1382 key.type = BTRFS_DEV_EXTENT_KEY;
1384 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
1388 ret = btrfs_previous_item(root, path, key.objectid, key.type);
1395 slot = path->slots[0];
1396 if (slot >= btrfs_header_nritems(l)) {
1397 ret = btrfs_next_leaf(root, path);
1405 btrfs_item_key_to_cpu(l, &key, slot);
1407 if (key.objectid < device->devid)
1410 if (key.objectid > device->devid)
1413 if (key.type != BTRFS_DEV_EXTENT_KEY)
1416 if (key.offset > search_start) {
1417 hole_size = key.offset - search_start;
1420 * Have to check before we set max_hole_start, otherwise
1421 * we could end up sending back this offset anyway.
1423 if (contains_pending_extent(transaction, device,
1426 if (key.offset >= search_start) {
1427 hole_size = key.offset - search_start;
1434 if (hole_size > max_hole_size) {
1435 max_hole_start = search_start;
1436 max_hole_size = hole_size;
1440 * If this free space is greater than which we need,
1441 * it must be the max free space that we have found
1442 * until now, so max_hole_start must point to the start
1443 * of this free space and the length of this free space
1444 * is stored in max_hole_size. Thus, we return
1445 * max_hole_start and max_hole_size and go back to the
1448 if (hole_size >= num_bytes) {
1454 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
1455 extent_end = key.offset + btrfs_dev_extent_length(l,
1457 if (extent_end > search_start)
1458 search_start = extent_end;
1465 * At this point, search_start should be the end of
1466 * allocated dev extents, and when shrinking the device,
1467 * search_end may be smaller than search_start.
1469 if (search_end > search_start) {
1470 hole_size = search_end - search_start;
1472 if (contains_pending_extent(transaction, device, &search_start,
1474 btrfs_release_path(path);
1478 if (hole_size > max_hole_size) {
1479 max_hole_start = search_start;
1480 max_hole_size = hole_size;
1485 if (max_hole_size < num_bytes)
1491 btrfs_free_path(path);
1492 *start = max_hole_start;
1494 *len = max_hole_size;
1498 int find_free_dev_extent(struct btrfs_trans_handle *trans,
1499 struct btrfs_device *device, u64 num_bytes,
1500 u64 *start, u64 *len)
1502 /* FIXME use last free of some kind */
1503 return find_free_dev_extent_start(trans->transaction, device,
1504 num_bytes, 0, start, len);
1507 static int btrfs_free_dev_extent(struct btrfs_trans_handle *trans,
1508 struct btrfs_device *device,
1509 u64 start, u64 *dev_extent_len)
1511 struct btrfs_root *root = device->fs_info->dev_root;
1513 struct btrfs_path *path;
1514 struct btrfs_key key;
1515 struct btrfs_key found_key;
1516 struct extent_buffer *leaf = NULL;
1517 struct btrfs_dev_extent *extent = NULL;
1519 path = btrfs_alloc_path();
1523 key.objectid = device->devid;
1525 key.type = BTRFS_DEV_EXTENT_KEY;
1527 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1529 ret = btrfs_previous_item(root, path, key.objectid,
1530 BTRFS_DEV_EXTENT_KEY);
1533 leaf = path->nodes[0];
1534 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
1535 extent = btrfs_item_ptr(leaf, path->slots[0],
1536 struct btrfs_dev_extent);
1537 BUG_ON(found_key.offset > start || found_key.offset +
1538 btrfs_dev_extent_length(leaf, extent) < start);
1540 btrfs_release_path(path);
1542 } else if (ret == 0) {
1543 leaf = path->nodes[0];
1544 extent = btrfs_item_ptr(leaf, path->slots[0],
1545 struct btrfs_dev_extent);
1547 btrfs_handle_fs_error(root->fs_info, ret, "Slot search failed");
1551 *dev_extent_len = btrfs_dev_extent_length(leaf, extent);
1553 ret = btrfs_del_item(trans, root, path);
1555 btrfs_handle_fs_error(root->fs_info, ret,
1556 "Failed to remove dev extent item");
1558 set_bit(BTRFS_TRANS_HAVE_FREE_BGS, &trans->transaction->flags);
1561 btrfs_free_path(path);
1565 static int btrfs_alloc_dev_extent(struct btrfs_trans_handle *trans,
1566 struct btrfs_device *device,
1567 u64 chunk_tree, u64 chunk_objectid,
1568 u64 chunk_offset, u64 start, u64 num_bytes)
1571 struct btrfs_path *path;
1572 struct btrfs_root *root = device->fs_info->dev_root;
1573 struct btrfs_dev_extent *extent;
1574 struct extent_buffer *leaf;
1575 struct btrfs_key key;
1577 WARN_ON(!device->in_fs_metadata);
1578 WARN_ON(device->is_tgtdev_for_dev_replace);
1579 path = btrfs_alloc_path();
1583 key.objectid = device->devid;
1585 key.type = BTRFS_DEV_EXTENT_KEY;
1586 ret = btrfs_insert_empty_item(trans, root, path, &key,
1591 leaf = path->nodes[0];
1592 extent = btrfs_item_ptr(leaf, path->slots[0],
1593 struct btrfs_dev_extent);
1594 btrfs_set_dev_extent_chunk_tree(leaf, extent, chunk_tree);
1595 btrfs_set_dev_extent_chunk_objectid(leaf, extent, chunk_objectid);
1596 btrfs_set_dev_extent_chunk_offset(leaf, extent, chunk_offset);
1598 write_extent_buffer_chunk_tree_uuid(leaf,
1599 root->fs_info->chunk_tree_uuid);
1601 btrfs_set_dev_extent_length(leaf, extent, num_bytes);
1602 btrfs_mark_buffer_dirty(leaf);
1604 btrfs_free_path(path);
1608 static u64 find_next_chunk(struct btrfs_fs_info *fs_info)
1610 struct extent_map_tree *em_tree;
1611 struct extent_map *em;
1615 em_tree = &fs_info->mapping_tree.map_tree;
1616 read_lock(&em_tree->lock);
1617 n = rb_last(&em_tree->map);
1619 em = rb_entry(n, struct extent_map, rb_node);
1620 ret = em->start + em->len;
1622 read_unlock(&em_tree->lock);
1627 static noinline int find_next_devid(struct btrfs_fs_info *fs_info,
1631 struct btrfs_key key;
1632 struct btrfs_key found_key;
1633 struct btrfs_path *path;
1635 path = btrfs_alloc_path();
1639 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1640 key.type = BTRFS_DEV_ITEM_KEY;
1641 key.offset = (u64)-1;
1643 ret = btrfs_search_slot(NULL, fs_info->chunk_root, &key, path, 0, 0);
1647 BUG_ON(ret == 0); /* Corruption */
1649 ret = btrfs_previous_item(fs_info->chunk_root, path,
1650 BTRFS_DEV_ITEMS_OBJECTID,
1651 BTRFS_DEV_ITEM_KEY);
1655 btrfs_item_key_to_cpu(path->nodes[0], &found_key,
1657 *devid_ret = found_key.offset + 1;
1661 btrfs_free_path(path);
1666 * the device information is stored in the chunk root
1667 * the btrfs_device struct should be fully filled in
1669 static int btrfs_add_device(struct btrfs_trans_handle *trans,
1670 struct btrfs_fs_info *fs_info,
1671 struct btrfs_device *device)
1673 struct btrfs_root *root = fs_info->chunk_root;
1675 struct btrfs_path *path;
1676 struct btrfs_dev_item *dev_item;
1677 struct extent_buffer *leaf;
1678 struct btrfs_key key;
1681 path = btrfs_alloc_path();
1685 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1686 key.type = BTRFS_DEV_ITEM_KEY;
1687 key.offset = device->devid;
1689 ret = btrfs_insert_empty_item(trans, root, path, &key,
1694 leaf = path->nodes[0];
1695 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
1697 btrfs_set_device_id(leaf, dev_item, device->devid);
1698 btrfs_set_device_generation(leaf, dev_item, 0);
1699 btrfs_set_device_type(leaf, dev_item, device->type);
1700 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
1701 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
1702 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
1703 btrfs_set_device_total_bytes(leaf, dev_item,
1704 btrfs_device_get_disk_total_bytes(device));
1705 btrfs_set_device_bytes_used(leaf, dev_item,
1706 btrfs_device_get_bytes_used(device));
1707 btrfs_set_device_group(leaf, dev_item, 0);
1708 btrfs_set_device_seek_speed(leaf, dev_item, 0);
1709 btrfs_set_device_bandwidth(leaf, dev_item, 0);
1710 btrfs_set_device_start_offset(leaf, dev_item, 0);
1712 ptr = btrfs_device_uuid(dev_item);
1713 write_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
1714 ptr = btrfs_device_fsid(dev_item);
1715 write_extent_buffer(leaf, root->fs_info->fsid, ptr, BTRFS_UUID_SIZE);
1716 btrfs_mark_buffer_dirty(leaf);
1720 btrfs_free_path(path);
1725 * Function to update ctime/mtime for a given device path.
1726 * Mainly used for ctime/mtime based probe like libblkid.
1728 static void update_dev_time(char *path_name)
1732 filp = filp_open(path_name, O_RDWR, 0);
1735 file_update_time(filp);
1736 filp_close(filp, NULL);
1739 static int btrfs_rm_dev_item(struct btrfs_fs_info *fs_info,
1740 struct btrfs_device *device)
1742 struct btrfs_root *root = fs_info->chunk_root;
1744 struct btrfs_path *path;
1745 struct btrfs_key key;
1746 struct btrfs_trans_handle *trans;
1748 path = btrfs_alloc_path();
1752 trans = btrfs_start_transaction(root, 0);
1753 if (IS_ERR(trans)) {
1754 btrfs_free_path(path);
1755 return PTR_ERR(trans);
1757 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
1758 key.type = BTRFS_DEV_ITEM_KEY;
1759 key.offset = device->devid;
1761 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
1770 ret = btrfs_del_item(trans, root, path);
1774 btrfs_free_path(path);
1775 btrfs_commit_transaction(trans, root);
1780 * Verify that @num_devices satisfies the RAID profile constraints in the whole
1781 * filesystem. It's up to the caller to adjust that number regarding eg. device
1784 static int btrfs_check_raid_min_devices(struct btrfs_fs_info *fs_info,
1792 seq = read_seqbegin(&fs_info->profiles_lock);
1794 all_avail = fs_info->avail_data_alloc_bits |
1795 fs_info->avail_system_alloc_bits |
1796 fs_info->avail_metadata_alloc_bits;
1797 } while (read_seqretry(&fs_info->profiles_lock, seq));
1799 for (i = 0; i < BTRFS_NR_RAID_TYPES; i++) {
1800 if (!(all_avail & btrfs_raid_group[i]))
1803 if (num_devices < btrfs_raid_array[i].devs_min) {
1804 int ret = btrfs_raid_mindev_error[i];
1814 struct btrfs_device *btrfs_find_next_active_device(struct btrfs_fs_devices *fs_devs,
1815 struct btrfs_device *device)
1817 struct btrfs_device *next_device;
1819 list_for_each_entry(next_device, &fs_devs->devices, dev_list) {
1820 if (next_device != device &&
1821 !next_device->missing && next_device->bdev)
1829 * Helper function to check if the given device is part of s_bdev / latest_bdev
1830 * and replace it with the provided or the next active device, in the context
1831 * where this function called, there should be always be another device (or
1832 * this_dev) which is active.
1834 void btrfs_assign_next_active_device(struct btrfs_fs_info *fs_info,
1835 struct btrfs_device *device, struct btrfs_device *this_dev)
1837 struct btrfs_device *next_device;
1840 next_device = this_dev;
1842 next_device = btrfs_find_next_active_device(fs_info->fs_devices,
1844 ASSERT(next_device);
1846 if (fs_info->sb->s_bdev &&
1847 (fs_info->sb->s_bdev == device->bdev))
1848 fs_info->sb->s_bdev = next_device->bdev;
1850 if (fs_info->fs_devices->latest_bdev == device->bdev)
1851 fs_info->fs_devices->latest_bdev = next_device->bdev;
1854 int btrfs_rm_device(struct btrfs_root *root, char *device_path, u64 devid)
1856 struct btrfs_device *device;
1857 struct btrfs_fs_devices *cur_devices;
1860 bool clear_super = false;
1862 mutex_lock(&uuid_mutex);
1864 num_devices = root->fs_info->fs_devices->num_devices;
1865 btrfs_dev_replace_lock(&root->fs_info->dev_replace, 0);
1866 if (btrfs_dev_replace_is_ongoing(&root->fs_info->dev_replace)) {
1867 WARN_ON(num_devices < 1);
1870 btrfs_dev_replace_unlock(&root->fs_info->dev_replace, 0);
1872 ret = btrfs_check_raid_min_devices(root->fs_info, num_devices - 1);
1876 ret = btrfs_find_device_by_devspec(root, devid, device_path,
1881 if (device->is_tgtdev_for_dev_replace) {
1882 ret = BTRFS_ERROR_DEV_TGT_REPLACE;
1886 if (device->writeable && root->fs_info->fs_devices->rw_devices == 1) {
1887 ret = BTRFS_ERROR_DEV_ONLY_WRITABLE;
1891 if (device->writeable) {
1893 list_del_init(&device->dev_alloc_list);
1894 device->fs_devices->rw_devices--;
1895 unlock_chunks(root);
1899 mutex_unlock(&uuid_mutex);
1900 ret = btrfs_shrink_device(device, 0);
1901 mutex_lock(&uuid_mutex);
1906 * TODO: the superblock still includes this device in its num_devices
1907 * counter although write_all_supers() is not locked out. This
1908 * could give a filesystem state which requires a degraded mount.
1910 ret = btrfs_rm_dev_item(root->fs_info, device);
1914 device->in_fs_metadata = 0;
1915 btrfs_scrub_cancel_dev(root->fs_info, device);
1918 * the device list mutex makes sure that we don't change
1919 * the device list while someone else is writing out all
1920 * the device supers. Whoever is writing all supers, should
1921 * lock the device list mutex before getting the number of
1922 * devices in the super block (super_copy). Conversely,
1923 * whoever updates the number of devices in the super block
1924 * (super_copy) should hold the device list mutex.
1927 cur_devices = device->fs_devices;
1928 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
1929 list_del_rcu(&device->dev_list);
1931 device->fs_devices->num_devices--;
1932 device->fs_devices->total_devices--;
1934 if (device->missing)
1935 device->fs_devices->missing_devices--;
1937 btrfs_assign_next_active_device(root->fs_info, device, NULL);
1940 device->fs_devices->open_devices--;
1941 /* remove sysfs entry */
1942 btrfs_sysfs_rm_device_link(root->fs_info->fs_devices, device);
1945 num_devices = btrfs_super_num_devices(root->fs_info->super_copy) - 1;
1946 btrfs_set_super_num_devices(root->fs_info->super_copy, num_devices);
1947 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
1950 * at this point, the device is zero sized and detached from
1951 * the devices list. All that's left is to zero out the old
1952 * supers and free the device.
1954 if (device->writeable)
1955 btrfs_scratch_superblocks(device->bdev, device->name->str);
1957 btrfs_close_bdev(device);
1958 call_rcu(&device->rcu, free_device);
1960 if (cur_devices->open_devices == 0) {
1961 struct btrfs_fs_devices *fs_devices;
1962 fs_devices = root->fs_info->fs_devices;
1963 while (fs_devices) {
1964 if (fs_devices->seed == cur_devices) {
1965 fs_devices->seed = cur_devices->seed;
1968 fs_devices = fs_devices->seed;
1970 cur_devices->seed = NULL;
1971 __btrfs_close_devices(cur_devices);
1972 free_fs_devices(cur_devices);
1975 root->fs_info->num_tolerated_disk_barrier_failures =
1976 btrfs_calc_num_tolerated_disk_barrier_failures(root->fs_info);
1979 mutex_unlock(&uuid_mutex);
1983 if (device->writeable) {
1985 list_add(&device->dev_alloc_list,
1986 &root->fs_info->fs_devices->alloc_list);
1987 device->fs_devices->rw_devices++;
1988 unlock_chunks(root);
1993 void btrfs_rm_dev_replace_remove_srcdev(struct btrfs_fs_info *fs_info,
1994 struct btrfs_device *srcdev)
1996 struct btrfs_fs_devices *fs_devices;
1998 WARN_ON(!mutex_is_locked(&fs_info->fs_devices->device_list_mutex));
2001 * in case of fs with no seed, srcdev->fs_devices will point
2002 * to fs_devices of fs_info. However when the dev being replaced is
2003 * a seed dev it will point to the seed's local fs_devices. In short
2004 * srcdev will have its correct fs_devices in both the cases.
2006 fs_devices = srcdev->fs_devices;
2008 list_del_rcu(&srcdev->dev_list);
2009 list_del_rcu(&srcdev->dev_alloc_list);
2010 fs_devices->num_devices--;
2011 if (srcdev->missing)
2012 fs_devices->missing_devices--;
2014 if (srcdev->writeable)
2015 fs_devices->rw_devices--;
2018 fs_devices->open_devices--;
2021 void btrfs_rm_dev_replace_free_srcdev(struct btrfs_fs_info *fs_info,
2022 struct btrfs_device *srcdev)
2024 struct btrfs_fs_devices *fs_devices = srcdev->fs_devices;
2026 if (srcdev->writeable) {
2027 /* zero out the old super if it is writable */
2028 btrfs_scratch_superblocks(srcdev->bdev, srcdev->name->str);
2031 btrfs_close_bdev(srcdev);
2033 call_rcu(&srcdev->rcu, free_device);
2036 * unless fs_devices is seed fs, num_devices shouldn't go
2039 BUG_ON(!fs_devices->num_devices && !fs_devices->seeding);
2041 /* if this is no devs we rather delete the fs_devices */
2042 if (!fs_devices->num_devices) {
2043 struct btrfs_fs_devices *tmp_fs_devices;
2045 tmp_fs_devices = fs_info->fs_devices;
2046 while (tmp_fs_devices) {
2047 if (tmp_fs_devices->seed == fs_devices) {
2048 tmp_fs_devices->seed = fs_devices->seed;
2051 tmp_fs_devices = tmp_fs_devices->seed;
2053 fs_devices->seed = NULL;
2054 __btrfs_close_devices(fs_devices);
2055 free_fs_devices(fs_devices);
2059 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_fs_info *fs_info,
2060 struct btrfs_device *tgtdev)
2062 mutex_lock(&uuid_mutex);
2064 mutex_lock(&fs_info->fs_devices->device_list_mutex);
2066 btrfs_sysfs_rm_device_link(fs_info->fs_devices, tgtdev);
2069 fs_info->fs_devices->open_devices--;
2071 fs_info->fs_devices->num_devices--;
2073 btrfs_assign_next_active_device(fs_info, tgtdev, NULL);
2075 list_del_rcu(&tgtdev->dev_list);
2077 mutex_unlock(&fs_info->fs_devices->device_list_mutex);
2078 mutex_unlock(&uuid_mutex);
2081 * The update_dev_time() with in btrfs_scratch_superblocks()
2082 * may lead to a call to btrfs_show_devname() which will try
2083 * to hold device_list_mutex. And here this device
2084 * is already out of device list, so we don't have to hold
2085 * the device_list_mutex lock.
2087 btrfs_scratch_superblocks(tgtdev->bdev, tgtdev->name->str);
2089 btrfs_close_bdev(tgtdev);
2090 call_rcu(&tgtdev->rcu, free_device);
2093 static int btrfs_find_device_by_path(struct btrfs_root *root, char *device_path,
2094 struct btrfs_device **device)
2097 struct btrfs_super_block *disk_super;
2100 struct block_device *bdev;
2101 struct buffer_head *bh;
2104 ret = btrfs_get_bdev_and_sb(device_path, FMODE_READ,
2105 root->fs_info->bdev_holder, 0, &bdev, &bh);
2108 disk_super = (struct btrfs_super_block *)bh->b_data;
2109 devid = btrfs_stack_device_id(&disk_super->dev_item);
2110 dev_uuid = disk_super->dev_item.uuid;
2111 *device = btrfs_find_device(root->fs_info, devid, dev_uuid,
2116 blkdev_put(bdev, FMODE_READ);
2120 int btrfs_find_device_missing_or_by_path(struct btrfs_root *root,
2122 struct btrfs_device **device)
2125 if (strcmp(device_path, "missing") == 0) {
2126 struct list_head *devices;
2127 struct btrfs_device *tmp;
2129 devices = &root->fs_info->fs_devices->devices;
2131 * It is safe to read the devices since the volume_mutex
2132 * is held by the caller.
2134 list_for_each_entry(tmp, devices, dev_list) {
2135 if (tmp->in_fs_metadata && !tmp->bdev) {
2142 return BTRFS_ERROR_DEV_MISSING_NOT_FOUND;
2146 return btrfs_find_device_by_path(root, device_path, device);
2151 * Lookup a device given by device id, or the path if the id is 0.
2153 int btrfs_find_device_by_devspec(struct btrfs_root *root, u64 devid,
2155 struct btrfs_device **device)
2161 *device = btrfs_find_device(root->fs_info, devid, NULL,
2166 if (!devpath || !devpath[0])
2169 ret = btrfs_find_device_missing_or_by_path(root, devpath,
2176 * does all the dirty work required for changing file system's UUID.
2178 static int btrfs_prepare_sprout(struct btrfs_root *root)
2180 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
2181 struct btrfs_fs_devices *old_devices;
2182 struct btrfs_fs_devices *seed_devices;
2183 struct btrfs_super_block *disk_super = root->fs_info->super_copy;
2184 struct btrfs_device *device;
2187 BUG_ON(!mutex_is_locked(&uuid_mutex));
2188 if (!fs_devices->seeding)
2191 seed_devices = __alloc_fs_devices();
2192 if (IS_ERR(seed_devices))
2193 return PTR_ERR(seed_devices);
2195 old_devices = clone_fs_devices(fs_devices);
2196 if (IS_ERR(old_devices)) {
2197 kfree(seed_devices);
2198 return PTR_ERR(old_devices);
2201 list_add(&old_devices->list, &fs_uuids);
2203 memcpy(seed_devices, fs_devices, sizeof(*seed_devices));
2204 seed_devices->opened = 1;
2205 INIT_LIST_HEAD(&seed_devices->devices);
2206 INIT_LIST_HEAD(&seed_devices->alloc_list);
2207 mutex_init(&seed_devices->device_list_mutex);
2209 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
2210 list_splice_init_rcu(&fs_devices->devices, &seed_devices->devices,
2212 list_for_each_entry(device, &seed_devices->devices, dev_list)
2213 device->fs_devices = seed_devices;
2216 list_splice_init(&fs_devices->alloc_list, &seed_devices->alloc_list);
2217 unlock_chunks(root);
2219 fs_devices->seeding = 0;
2220 fs_devices->num_devices = 0;
2221 fs_devices->open_devices = 0;
2222 fs_devices->missing_devices = 0;
2223 fs_devices->rotating = 0;
2224 fs_devices->seed = seed_devices;
2226 generate_random_uuid(fs_devices->fsid);
2227 memcpy(root->fs_info->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2228 memcpy(disk_super->fsid, fs_devices->fsid, BTRFS_FSID_SIZE);
2229 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
2231 super_flags = btrfs_super_flags(disk_super) &
2232 ~BTRFS_SUPER_FLAG_SEEDING;
2233 btrfs_set_super_flags(disk_super, super_flags);
2239 * Store the expected generation for seed devices in device items.
2241 static int btrfs_finish_sprout(struct btrfs_trans_handle *trans,
2242 struct btrfs_fs_info *fs_info)
2244 struct btrfs_root *root = fs_info->chunk_root;
2245 struct btrfs_path *path;
2246 struct extent_buffer *leaf;
2247 struct btrfs_dev_item *dev_item;
2248 struct btrfs_device *device;
2249 struct btrfs_key key;
2250 u8 fs_uuid[BTRFS_UUID_SIZE];
2251 u8 dev_uuid[BTRFS_UUID_SIZE];
2255 path = btrfs_alloc_path();
2259 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2261 key.type = BTRFS_DEV_ITEM_KEY;
2264 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2268 leaf = path->nodes[0];
2270 if (path->slots[0] >= btrfs_header_nritems(leaf)) {
2271 ret = btrfs_next_leaf(root, path);
2276 leaf = path->nodes[0];
2277 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2278 btrfs_release_path(path);
2282 btrfs_item_key_to_cpu(leaf, &key, path->slots[0]);
2283 if (key.objectid != BTRFS_DEV_ITEMS_OBJECTID ||
2284 key.type != BTRFS_DEV_ITEM_KEY)
2287 dev_item = btrfs_item_ptr(leaf, path->slots[0],
2288 struct btrfs_dev_item);
2289 devid = btrfs_device_id(leaf, dev_item);
2290 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
2292 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
2294 device = btrfs_find_device(root->fs_info, devid, dev_uuid,
2296 BUG_ON(!device); /* Logic error */
2298 if (device->fs_devices->seeding) {
2299 btrfs_set_device_generation(leaf, dev_item,
2300 device->generation);
2301 btrfs_mark_buffer_dirty(leaf);
2309 btrfs_free_path(path);
2313 int btrfs_init_new_device(struct btrfs_fs_info *fs_info, char *device_path)
2315 struct btrfs_root *root = fs_info->dev_root;
2316 struct request_queue *q;
2317 struct btrfs_trans_handle *trans;
2318 struct btrfs_device *device;
2319 struct block_device *bdev;
2320 struct list_head *devices;
2321 struct super_block *sb = root->fs_info->sb;
2322 struct rcu_string *name;
2324 int seeding_dev = 0;
2327 if ((sb->s_flags & MS_RDONLY) && !root->fs_info->fs_devices->seeding)
2330 bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
2331 root->fs_info->bdev_holder);
2333 return PTR_ERR(bdev);
2335 if (root->fs_info->fs_devices->seeding) {
2337 down_write(&sb->s_umount);
2338 mutex_lock(&uuid_mutex);
2341 filemap_write_and_wait(bdev->bd_inode->i_mapping);
2343 devices = &root->fs_info->fs_devices->devices;
2345 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
2346 list_for_each_entry(device, devices, dev_list) {
2347 if (device->bdev == bdev) {
2350 &root->fs_info->fs_devices->device_list_mutex);
2354 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
2356 device = btrfs_alloc_device(root->fs_info, NULL, NULL);
2357 if (IS_ERR(device)) {
2358 /* we can safely leave the fs_devices entry around */
2359 ret = PTR_ERR(device);
2363 name = rcu_string_strdup(device_path, GFP_KERNEL);
2369 rcu_assign_pointer(device->name, name);
2371 trans = btrfs_start_transaction(root, 0);
2372 if (IS_ERR(trans)) {
2373 rcu_string_free(device->name);
2375 ret = PTR_ERR(trans);
2379 q = bdev_get_queue(bdev);
2380 if (blk_queue_discard(q))
2381 device->can_discard = 1;
2382 device->writeable = 1;
2383 device->generation = trans->transid;
2384 device->io_width = root->fs_info->sectorsize;
2385 device->io_align = root->fs_info->sectorsize;
2386 device->sector_size = root->fs_info->sectorsize;
2387 device->total_bytes = i_size_read(bdev->bd_inode);
2388 device->disk_total_bytes = device->total_bytes;
2389 device->commit_total_bytes = device->total_bytes;
2390 device->fs_info = fs_info;
2391 device->bdev = bdev;
2392 device->in_fs_metadata = 1;
2393 device->is_tgtdev_for_dev_replace = 0;
2394 device->mode = FMODE_EXCL;
2395 device->dev_stats_valid = 1;
2396 set_blocksize(device->bdev, 4096);
2399 sb->s_flags &= ~MS_RDONLY;
2400 ret = btrfs_prepare_sprout(root);
2401 BUG_ON(ret); /* -ENOMEM */
2404 device->fs_devices = root->fs_info->fs_devices;
2406 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
2408 list_add_rcu(&device->dev_list, &root->fs_info->fs_devices->devices);
2409 list_add(&device->dev_alloc_list,
2410 &root->fs_info->fs_devices->alloc_list);
2411 root->fs_info->fs_devices->num_devices++;
2412 root->fs_info->fs_devices->open_devices++;
2413 root->fs_info->fs_devices->rw_devices++;
2414 root->fs_info->fs_devices->total_devices++;
2415 root->fs_info->fs_devices->total_rw_bytes += device->total_bytes;
2417 spin_lock(&root->fs_info->free_chunk_lock);
2418 root->fs_info->free_chunk_space += device->total_bytes;
2419 spin_unlock(&root->fs_info->free_chunk_lock);
2421 if (!blk_queue_nonrot(bdev_get_queue(bdev)))
2422 root->fs_info->fs_devices->rotating = 1;
2424 tmp = btrfs_super_total_bytes(root->fs_info->super_copy);
2425 btrfs_set_super_total_bytes(root->fs_info->super_copy,
2426 tmp + device->total_bytes);
2428 tmp = btrfs_super_num_devices(root->fs_info->super_copy);
2429 btrfs_set_super_num_devices(root->fs_info->super_copy,
2432 /* add sysfs device entry */
2433 btrfs_sysfs_add_device_link(root->fs_info->fs_devices, device);
2436 * we've got more storage, clear any full flags on the space
2439 btrfs_clear_space_info_full(root->fs_info);
2441 unlock_chunks(root);
2442 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
2446 ret = init_first_rw_device(trans, root, device);
2447 unlock_chunks(root);
2449 btrfs_abort_transaction(trans, ret);
2454 ret = btrfs_add_device(trans, root->fs_info, device);
2456 btrfs_abort_transaction(trans, ret);
2461 char fsid_buf[BTRFS_UUID_UNPARSED_SIZE];
2463 ret = btrfs_finish_sprout(trans, root->fs_info);
2465 btrfs_abort_transaction(trans, ret);
2469 /* Sprouting would change fsid of the mounted root,
2470 * so rename the fsid on the sysfs
2472 snprintf(fsid_buf, BTRFS_UUID_UNPARSED_SIZE, "%pU",
2473 root->fs_info->fsid);
2474 if (kobject_rename(&root->fs_info->fs_devices->fsid_kobj,
2476 btrfs_warn(root->fs_info,
2477 "sysfs: failed to create fsid for sprout");
2480 root->fs_info->num_tolerated_disk_barrier_failures =
2481 btrfs_calc_num_tolerated_disk_barrier_failures(root->fs_info);
2482 ret = btrfs_commit_transaction(trans, root);
2485 mutex_unlock(&uuid_mutex);
2486 up_write(&sb->s_umount);
2488 if (ret) /* transaction commit */
2491 ret = btrfs_relocate_sys_chunks(root);
2493 btrfs_handle_fs_error(root->fs_info, ret,
2494 "Failed to relocate sys chunks after device initialization. This can be fixed using the \"btrfs balance\" command.");
2495 trans = btrfs_attach_transaction(root);
2496 if (IS_ERR(trans)) {
2497 if (PTR_ERR(trans) == -ENOENT)
2499 return PTR_ERR(trans);
2501 ret = btrfs_commit_transaction(trans, root);
2504 /* Update ctime/mtime for libblkid */
2505 update_dev_time(device_path);
2509 btrfs_end_transaction(trans, root);
2510 rcu_string_free(device->name);
2511 btrfs_sysfs_rm_device_link(root->fs_info->fs_devices, device);
2514 blkdev_put(bdev, FMODE_EXCL);
2516 mutex_unlock(&uuid_mutex);
2517 up_write(&sb->s_umount);
2522 int btrfs_init_dev_replace_tgtdev(struct btrfs_root *root, char *device_path,
2523 struct btrfs_device *srcdev,
2524 struct btrfs_device **device_out)
2526 struct request_queue *q;
2527 struct btrfs_device *device;
2528 struct block_device *bdev;
2529 struct btrfs_fs_info *fs_info = root->fs_info;
2530 struct list_head *devices;
2531 struct rcu_string *name;
2532 u64 devid = BTRFS_DEV_REPLACE_DEVID;
2536 if (fs_info->fs_devices->seeding) {
2537 btrfs_err(fs_info, "the filesystem is a seed filesystem!");
2541 bdev = blkdev_get_by_path(device_path, FMODE_WRITE | FMODE_EXCL,
2542 fs_info->bdev_holder);
2544 btrfs_err(fs_info, "target device %s is invalid!", device_path);
2545 return PTR_ERR(bdev);
2548 filemap_write_and_wait(bdev->bd_inode->i_mapping);
2550 devices = &fs_info->fs_devices->devices;
2551 list_for_each_entry(device, devices, dev_list) {
2552 if (device->bdev == bdev) {
2554 "target device is in the filesystem!");
2561 if (i_size_read(bdev->bd_inode) <
2562 btrfs_device_get_total_bytes(srcdev)) {
2564 "target device is smaller than source device!");
2570 device = btrfs_alloc_device(NULL, &devid, NULL);
2571 if (IS_ERR(device)) {
2572 ret = PTR_ERR(device);
2576 name = rcu_string_strdup(device_path, GFP_NOFS);
2582 rcu_assign_pointer(device->name, name);
2584 q = bdev_get_queue(bdev);
2585 if (blk_queue_discard(q))
2586 device->can_discard = 1;
2587 mutex_lock(&root->fs_info->fs_devices->device_list_mutex);
2588 device->writeable = 1;
2589 device->generation = 0;
2590 device->io_width = root->fs_info->sectorsize;
2591 device->io_align = root->fs_info->sectorsize;
2592 device->sector_size = root->fs_info->sectorsize;
2593 device->total_bytes = btrfs_device_get_total_bytes(srcdev);
2594 device->disk_total_bytes = btrfs_device_get_disk_total_bytes(srcdev);
2595 device->bytes_used = btrfs_device_get_bytes_used(srcdev);
2596 ASSERT(list_empty(&srcdev->resized_list));
2597 device->commit_total_bytes = srcdev->commit_total_bytes;
2598 device->commit_bytes_used = device->bytes_used;
2599 device->fs_info = fs_info;
2600 device->bdev = bdev;
2601 device->in_fs_metadata = 1;
2602 device->is_tgtdev_for_dev_replace = 1;
2603 device->mode = FMODE_EXCL;
2604 device->dev_stats_valid = 1;
2605 set_blocksize(device->bdev, 4096);
2606 device->fs_devices = fs_info->fs_devices;
2607 list_add(&device->dev_list, &fs_info->fs_devices->devices);
2608 fs_info->fs_devices->num_devices++;
2609 fs_info->fs_devices->open_devices++;
2610 mutex_unlock(&root->fs_info->fs_devices->device_list_mutex);
2612 *device_out = device;
2616 blkdev_put(bdev, FMODE_EXCL);
2620 void btrfs_init_dev_replace_tgtdev_for_resume(struct btrfs_fs_info *fs_info,
2621 struct btrfs_device *tgtdev)
2623 u32 sectorsize = fs_info->sectorsize;
2625 WARN_ON(fs_info->fs_devices->rw_devices == 0);
2626 tgtdev->io_width = sectorsize;
2627 tgtdev->io_align = sectorsize;
2628 tgtdev->sector_size = sectorsize;
2629 tgtdev->fs_info = fs_info;
2630 tgtdev->in_fs_metadata = 1;
2633 static noinline int btrfs_update_device(struct btrfs_trans_handle *trans,
2634 struct btrfs_device *device)
2637 struct btrfs_path *path;
2638 struct btrfs_root *root;
2639 struct btrfs_dev_item *dev_item;
2640 struct extent_buffer *leaf;
2641 struct btrfs_key key;
2643 root = device->fs_info->chunk_root;
2645 path = btrfs_alloc_path();
2649 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
2650 key.type = BTRFS_DEV_ITEM_KEY;
2651 key.offset = device->devid;
2653 ret = btrfs_search_slot(trans, root, &key, path, 0, 1);
2662 leaf = path->nodes[0];
2663 dev_item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_dev_item);
2665 btrfs_set_device_id(leaf, dev_item, device->devid);
2666 btrfs_set_device_type(leaf, dev_item, device->type);
2667 btrfs_set_device_io_align(leaf, dev_item, device->io_align);
2668 btrfs_set_device_io_width(leaf, dev_item, device->io_width);
2669 btrfs_set_device_sector_size(leaf, dev_item, device->sector_size);
2670 btrfs_set_device_total_bytes(leaf, dev_item,
2671 btrfs_device_get_disk_total_bytes(device));
2672 btrfs_set_device_bytes_used(leaf, dev_item,
2673 btrfs_device_get_bytes_used(device));
2674 btrfs_mark_buffer_dirty(leaf);
2677 btrfs_free_path(path);
2681 int btrfs_grow_device(struct btrfs_trans_handle *trans,
2682 struct btrfs_device *device, u64 new_size)
2684 struct btrfs_super_block *super_copy = device->fs_info->super_copy;
2685 struct btrfs_fs_devices *fs_devices;
2689 if (!device->writeable)
2692 lock_chunks(device->fs_info->dev_root);
2693 old_total = btrfs_super_total_bytes(super_copy);
2694 diff = new_size - device->total_bytes;
2696 if (new_size <= device->total_bytes ||
2697 device->is_tgtdev_for_dev_replace) {
2698 unlock_chunks(device->fs_info->dev_root);
2702 fs_devices = device->fs_info->fs_devices;
2704 btrfs_set_super_total_bytes(super_copy, old_total + diff);
2705 device->fs_devices->total_rw_bytes += diff;
2707 btrfs_device_set_total_bytes(device, new_size);
2708 btrfs_device_set_disk_total_bytes(device, new_size);
2709 btrfs_clear_space_info_full(device->fs_info);
2710 if (list_empty(&device->resized_list))
2711 list_add_tail(&device->resized_list,
2712 &fs_devices->resized_devices);
2713 unlock_chunks(device->fs_info->dev_root);
2715 return btrfs_update_device(trans, device);
2718 static int btrfs_free_chunk(struct btrfs_trans_handle *trans,
2719 struct btrfs_fs_info *fs_info, u64 chunk_objectid,
2722 struct btrfs_root *root = fs_info->chunk_root;
2724 struct btrfs_path *path;
2725 struct btrfs_key key;
2727 path = btrfs_alloc_path();
2731 key.objectid = chunk_objectid;
2732 key.offset = chunk_offset;
2733 key.type = BTRFS_CHUNK_ITEM_KEY;
2735 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
2738 else if (ret > 0) { /* Logic error or corruption */
2739 btrfs_handle_fs_error(root->fs_info, -ENOENT,
2740 "Failed lookup while freeing chunk.");
2745 ret = btrfs_del_item(trans, root, path);
2747 btrfs_handle_fs_error(root->fs_info, ret,
2748 "Failed to delete chunk item.");
2750 btrfs_free_path(path);
2754 static int btrfs_del_sys_chunk(struct btrfs_fs_info *fs_info,
2755 u64 chunk_objectid, u64 chunk_offset)
2757 struct btrfs_root *root = fs_info->chunk_root;
2758 struct btrfs_super_block *super_copy = root->fs_info->super_copy;
2759 struct btrfs_disk_key *disk_key;
2760 struct btrfs_chunk *chunk;
2767 struct btrfs_key key;
2770 array_size = btrfs_super_sys_array_size(super_copy);
2772 ptr = super_copy->sys_chunk_array;
2775 while (cur < array_size) {
2776 disk_key = (struct btrfs_disk_key *)ptr;
2777 btrfs_disk_key_to_cpu(&key, disk_key);
2779 len = sizeof(*disk_key);
2781 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
2782 chunk = (struct btrfs_chunk *)(ptr + len);
2783 num_stripes = btrfs_stack_chunk_num_stripes(chunk);
2784 len += btrfs_chunk_item_size(num_stripes);
2789 if (key.objectid == chunk_objectid &&
2790 key.offset == chunk_offset) {
2791 memmove(ptr, ptr + len, array_size - (cur + len));
2793 btrfs_set_super_sys_array_size(super_copy, array_size);
2799 unlock_chunks(root);
2803 int btrfs_remove_chunk(struct btrfs_trans_handle *trans,
2804 struct btrfs_fs_info *fs_info, u64 chunk_offset)
2806 struct btrfs_root *root = fs_info->chunk_root;
2807 struct extent_map_tree *em_tree;
2808 struct extent_map *em;
2809 struct btrfs_root *extent_root = root->fs_info->extent_root;
2810 struct map_lookup *map;
2811 u64 dev_extent_len = 0;
2812 u64 chunk_objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2814 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
2816 em_tree = &fs_info->mapping_tree.map_tree;
2818 read_lock(&em_tree->lock);
2819 em = lookup_extent_mapping(em_tree, chunk_offset, 1);
2820 read_unlock(&em_tree->lock);
2822 if (!em || em->start > chunk_offset ||
2823 em->start + em->len < chunk_offset) {
2825 * This is a logic error, but we don't want to just rely on the
2826 * user having built with ASSERT enabled, so if ASSERT doesn't
2827 * do anything we still error out.
2831 free_extent_map(em);
2834 map = em->map_lookup;
2835 lock_chunks(root->fs_info->chunk_root);
2836 check_system_chunk(trans, extent_root, map->type);
2837 unlock_chunks(root->fs_info->chunk_root);
2840 * Take the device list mutex to prevent races with the final phase of
2841 * a device replace operation that replaces the device object associated
2842 * with map stripes (dev-replace.c:btrfs_dev_replace_finishing()).
2844 mutex_lock(&fs_devices->device_list_mutex);
2845 for (i = 0; i < map->num_stripes; i++) {
2846 struct btrfs_device *device = map->stripes[i].dev;
2847 ret = btrfs_free_dev_extent(trans, device,
2848 map->stripes[i].physical,
2851 mutex_unlock(&fs_devices->device_list_mutex);
2852 btrfs_abort_transaction(trans, ret);
2856 if (device->bytes_used > 0) {
2858 btrfs_device_set_bytes_used(device,
2859 device->bytes_used - dev_extent_len);
2860 spin_lock(&root->fs_info->free_chunk_lock);
2861 root->fs_info->free_chunk_space += dev_extent_len;
2862 spin_unlock(&root->fs_info->free_chunk_lock);
2863 btrfs_clear_space_info_full(root->fs_info);
2864 unlock_chunks(root);
2867 if (map->stripes[i].dev) {
2868 ret = btrfs_update_device(trans, map->stripes[i].dev);
2870 mutex_unlock(&fs_devices->device_list_mutex);
2871 btrfs_abort_transaction(trans, ret);
2876 mutex_unlock(&fs_devices->device_list_mutex);
2878 ret = btrfs_free_chunk(trans, root->fs_info, chunk_objectid,
2881 btrfs_abort_transaction(trans, ret);
2885 trace_btrfs_chunk_free(fs_info, map, chunk_offset, em->len);
2887 if (map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
2888 ret = btrfs_del_sys_chunk(fs_info, chunk_objectid,
2891 btrfs_abort_transaction(trans, ret);
2896 ret = btrfs_remove_block_group(trans, fs_info, chunk_offset, em);
2898 btrfs_abort_transaction(trans, ret);
2904 free_extent_map(em);
2908 static int btrfs_relocate_chunk(struct btrfs_fs_info *fs_info, u64 chunk_offset)
2910 struct btrfs_root *root = fs_info->chunk_root;
2911 struct btrfs_root *extent_root = fs_info->extent_root;
2912 struct btrfs_trans_handle *trans;
2916 * Prevent races with automatic removal of unused block groups.
2917 * After we relocate and before we remove the chunk with offset
2918 * chunk_offset, automatic removal of the block group can kick in,
2919 * resulting in a failure when calling btrfs_remove_chunk() below.
2921 * Make sure to acquire this mutex before doing a tree search (dev
2922 * or chunk trees) to find chunks. Otherwise the cleaner kthread might
2923 * call btrfs_remove_chunk() (through btrfs_delete_unused_bgs()) after
2924 * we release the path used to search the chunk/dev tree and before
2925 * the current task acquires this mutex and calls us.
2927 ASSERT(mutex_is_locked(&root->fs_info->delete_unused_bgs_mutex));
2929 ret = btrfs_can_relocate(root->fs_info, chunk_offset);
2933 /* step one, relocate all the extents inside this chunk */
2934 btrfs_scrub_pause(root);
2935 ret = btrfs_relocate_block_group(root->fs_info, chunk_offset);
2936 btrfs_scrub_continue(root);
2940 trans = btrfs_start_trans_remove_block_group(root->fs_info,
2942 if (IS_ERR(trans)) {
2943 ret = PTR_ERR(trans);
2944 btrfs_handle_fs_error(root->fs_info, ret, NULL);
2949 * step two, delete the device extents and the
2950 * chunk tree entries
2952 ret = btrfs_remove_chunk(trans, fs_info, chunk_offset);
2953 btrfs_end_transaction(trans, extent_root);
2957 static int btrfs_relocate_sys_chunks(struct btrfs_root *root)
2959 struct btrfs_root *chunk_root = root->fs_info->chunk_root;
2960 struct btrfs_path *path;
2961 struct extent_buffer *leaf;
2962 struct btrfs_chunk *chunk;
2963 struct btrfs_key key;
2964 struct btrfs_key found_key;
2966 bool retried = false;
2970 path = btrfs_alloc_path();
2975 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
2976 key.offset = (u64)-1;
2977 key.type = BTRFS_CHUNK_ITEM_KEY;
2980 mutex_lock(&root->fs_info->delete_unused_bgs_mutex);
2981 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
2983 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
2986 BUG_ON(ret == 0); /* Corruption */
2988 ret = btrfs_previous_item(chunk_root, path, key.objectid,
2991 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
2997 leaf = path->nodes[0];
2998 btrfs_item_key_to_cpu(leaf, &found_key, path->slots[0]);
3000 chunk = btrfs_item_ptr(leaf, path->slots[0],
3001 struct btrfs_chunk);
3002 chunk_type = btrfs_chunk_type(leaf, chunk);
3003 btrfs_release_path(path);
3005 if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) {
3006 ret = btrfs_relocate_chunk(root->fs_info,
3013 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
3015 if (found_key.offset == 0)
3017 key.offset = found_key.offset - 1;
3020 if (failed && !retried) {
3024 } else if (WARN_ON(failed && retried)) {
3028 btrfs_free_path(path);
3032 static int insert_balance_item(struct btrfs_fs_info *fs_info,
3033 struct btrfs_balance_control *bctl)
3035 struct btrfs_root *root = fs_info->tree_root;
3036 struct btrfs_trans_handle *trans;
3037 struct btrfs_balance_item *item;
3038 struct btrfs_disk_balance_args disk_bargs;
3039 struct btrfs_path *path;
3040 struct extent_buffer *leaf;
3041 struct btrfs_key key;
3044 path = btrfs_alloc_path();
3048 trans = btrfs_start_transaction(root, 0);
3049 if (IS_ERR(trans)) {
3050 btrfs_free_path(path);
3051 return PTR_ERR(trans);
3054 key.objectid = BTRFS_BALANCE_OBJECTID;
3055 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3058 ret = btrfs_insert_empty_item(trans, root, path, &key,
3063 leaf = path->nodes[0];
3064 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
3066 memzero_extent_buffer(leaf, (unsigned long)item, sizeof(*item));
3068 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->data);
3069 btrfs_set_balance_data(leaf, item, &disk_bargs);
3070 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->meta);
3071 btrfs_set_balance_meta(leaf, item, &disk_bargs);
3072 btrfs_cpu_balance_args_to_disk(&disk_bargs, &bctl->sys);
3073 btrfs_set_balance_sys(leaf, item, &disk_bargs);
3075 btrfs_set_balance_flags(leaf, item, bctl->flags);
3077 btrfs_mark_buffer_dirty(leaf);
3079 btrfs_free_path(path);
3080 err = btrfs_commit_transaction(trans, root);
3086 static int del_balance_item(struct btrfs_fs_info *fs_info)
3088 struct btrfs_root *root = fs_info->tree_root;
3089 struct btrfs_trans_handle *trans;
3090 struct btrfs_path *path;
3091 struct btrfs_key key;
3094 path = btrfs_alloc_path();
3098 trans = btrfs_start_transaction(root, 0);
3099 if (IS_ERR(trans)) {
3100 btrfs_free_path(path);
3101 return PTR_ERR(trans);
3104 key.objectid = BTRFS_BALANCE_OBJECTID;
3105 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3108 ret = btrfs_search_slot(trans, root, &key, path, -1, 1);
3116 ret = btrfs_del_item(trans, root, path);
3118 btrfs_free_path(path);
3119 err = btrfs_commit_transaction(trans, root);
3126 * This is a heuristic used to reduce the number of chunks balanced on
3127 * resume after balance was interrupted.
3129 static void update_balance_args(struct btrfs_balance_control *bctl)
3132 * Turn on soft mode for chunk types that were being converted.
3134 if (bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)
3135 bctl->data.flags |= BTRFS_BALANCE_ARGS_SOFT;
3136 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)
3137 bctl->sys.flags |= BTRFS_BALANCE_ARGS_SOFT;
3138 if (bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)
3139 bctl->meta.flags |= BTRFS_BALANCE_ARGS_SOFT;
3142 * Turn on usage filter if is not already used. The idea is
3143 * that chunks that we have already balanced should be
3144 * reasonably full. Don't do it for chunks that are being
3145 * converted - that will keep us from relocating unconverted
3146 * (albeit full) chunks.
3148 if (!(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3149 !(bctl->data.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3150 !(bctl->data.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3151 bctl->data.flags |= BTRFS_BALANCE_ARGS_USAGE;
3152 bctl->data.usage = 90;
3154 if (!(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3155 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3156 !(bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3157 bctl->sys.flags |= BTRFS_BALANCE_ARGS_USAGE;
3158 bctl->sys.usage = 90;
3160 if (!(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE) &&
3161 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3162 !(bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT)) {
3163 bctl->meta.flags |= BTRFS_BALANCE_ARGS_USAGE;
3164 bctl->meta.usage = 90;
3169 * Should be called with both balance and volume mutexes held to
3170 * serialize other volume operations (add_dev/rm_dev/resize) with
3171 * restriper. Same goes for unset_balance_control.
3173 static void set_balance_control(struct btrfs_balance_control *bctl)
3175 struct btrfs_fs_info *fs_info = bctl->fs_info;
3177 BUG_ON(fs_info->balance_ctl);
3179 spin_lock(&fs_info->balance_lock);
3180 fs_info->balance_ctl = bctl;
3181 spin_unlock(&fs_info->balance_lock);
3184 static void unset_balance_control(struct btrfs_fs_info *fs_info)
3186 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3188 BUG_ON(!fs_info->balance_ctl);
3190 spin_lock(&fs_info->balance_lock);
3191 fs_info->balance_ctl = NULL;
3192 spin_unlock(&fs_info->balance_lock);
3198 * Balance filters. Return 1 if chunk should be filtered out
3199 * (should not be balanced).
3201 static int chunk_profiles_filter(u64 chunk_type,
3202 struct btrfs_balance_args *bargs)
3204 chunk_type = chunk_to_extended(chunk_type) &
3205 BTRFS_EXTENDED_PROFILE_MASK;
3207 if (bargs->profiles & chunk_type)
3213 static int chunk_usage_range_filter(struct btrfs_fs_info *fs_info, u64 chunk_offset,
3214 struct btrfs_balance_args *bargs)
3216 struct btrfs_block_group_cache *cache;
3218 u64 user_thresh_min;
3219 u64 user_thresh_max;
3222 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3223 chunk_used = btrfs_block_group_used(&cache->item);
3225 if (bargs->usage_min == 0)
3226 user_thresh_min = 0;
3228 user_thresh_min = div_factor_fine(cache->key.offset,
3231 if (bargs->usage_max == 0)
3232 user_thresh_max = 1;
3233 else if (bargs->usage_max > 100)
3234 user_thresh_max = cache->key.offset;
3236 user_thresh_max = div_factor_fine(cache->key.offset,
3239 if (user_thresh_min <= chunk_used && chunk_used < user_thresh_max)
3242 btrfs_put_block_group(cache);
3246 static int chunk_usage_filter(struct btrfs_fs_info *fs_info,
3247 u64 chunk_offset, struct btrfs_balance_args *bargs)
3249 struct btrfs_block_group_cache *cache;
3250 u64 chunk_used, user_thresh;
3253 cache = btrfs_lookup_block_group(fs_info, chunk_offset);
3254 chunk_used = btrfs_block_group_used(&cache->item);
3256 if (bargs->usage_min == 0)
3258 else if (bargs->usage > 100)
3259 user_thresh = cache->key.offset;
3261 user_thresh = div_factor_fine(cache->key.offset,
3264 if (chunk_used < user_thresh)
3267 btrfs_put_block_group(cache);
3271 static int chunk_devid_filter(struct extent_buffer *leaf,
3272 struct btrfs_chunk *chunk,
3273 struct btrfs_balance_args *bargs)
3275 struct btrfs_stripe *stripe;
3276 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3279 for (i = 0; i < num_stripes; i++) {
3280 stripe = btrfs_stripe_nr(chunk, i);
3281 if (btrfs_stripe_devid(leaf, stripe) == bargs->devid)
3288 /* [pstart, pend) */
3289 static int chunk_drange_filter(struct extent_buffer *leaf,
3290 struct btrfs_chunk *chunk,
3292 struct btrfs_balance_args *bargs)
3294 struct btrfs_stripe *stripe;
3295 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3301 if (!(bargs->flags & BTRFS_BALANCE_ARGS_DEVID))
3304 if (btrfs_chunk_type(leaf, chunk) & (BTRFS_BLOCK_GROUP_DUP |
3305 BTRFS_BLOCK_GROUP_RAID1 | BTRFS_BLOCK_GROUP_RAID10)) {
3306 factor = num_stripes / 2;
3307 } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID5) {
3308 factor = num_stripes - 1;
3309 } else if (btrfs_chunk_type(leaf, chunk) & BTRFS_BLOCK_GROUP_RAID6) {
3310 factor = num_stripes - 2;
3312 factor = num_stripes;
3315 for (i = 0; i < num_stripes; i++) {
3316 stripe = btrfs_stripe_nr(chunk, i);
3317 if (btrfs_stripe_devid(leaf, stripe) != bargs->devid)
3320 stripe_offset = btrfs_stripe_offset(leaf, stripe);
3321 stripe_length = btrfs_chunk_length(leaf, chunk);
3322 stripe_length = div_u64(stripe_length, factor);
3324 if (stripe_offset < bargs->pend &&
3325 stripe_offset + stripe_length > bargs->pstart)
3332 /* [vstart, vend) */
3333 static int chunk_vrange_filter(struct extent_buffer *leaf,
3334 struct btrfs_chunk *chunk,
3336 struct btrfs_balance_args *bargs)
3338 if (chunk_offset < bargs->vend &&
3339 chunk_offset + btrfs_chunk_length(leaf, chunk) > bargs->vstart)
3340 /* at least part of the chunk is inside this vrange */
3346 static int chunk_stripes_range_filter(struct extent_buffer *leaf,
3347 struct btrfs_chunk *chunk,
3348 struct btrfs_balance_args *bargs)
3350 int num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
3352 if (bargs->stripes_min <= num_stripes
3353 && num_stripes <= bargs->stripes_max)
3359 static int chunk_soft_convert_filter(u64 chunk_type,
3360 struct btrfs_balance_args *bargs)
3362 if (!(bargs->flags & BTRFS_BALANCE_ARGS_CONVERT))
3365 chunk_type = chunk_to_extended(chunk_type) &
3366 BTRFS_EXTENDED_PROFILE_MASK;
3368 if (bargs->target == chunk_type)
3374 static int should_balance_chunk(struct btrfs_root *root,
3375 struct extent_buffer *leaf,
3376 struct btrfs_chunk *chunk, u64 chunk_offset)
3378 struct btrfs_balance_control *bctl = root->fs_info->balance_ctl;
3379 struct btrfs_balance_args *bargs = NULL;
3380 u64 chunk_type = btrfs_chunk_type(leaf, chunk);
3383 if (!((chunk_type & BTRFS_BLOCK_GROUP_TYPE_MASK) &
3384 (bctl->flags & BTRFS_BALANCE_TYPE_MASK))) {
3388 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3389 bargs = &bctl->data;
3390 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3392 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3393 bargs = &bctl->meta;
3395 /* profiles filter */
3396 if ((bargs->flags & BTRFS_BALANCE_ARGS_PROFILES) &&
3397 chunk_profiles_filter(chunk_type, bargs)) {
3402 if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE) &&
3403 chunk_usage_filter(bctl->fs_info, chunk_offset, bargs)) {
3405 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_USAGE_RANGE) &&
3406 chunk_usage_range_filter(bctl->fs_info, chunk_offset, bargs)) {
3411 if ((bargs->flags & BTRFS_BALANCE_ARGS_DEVID) &&
3412 chunk_devid_filter(leaf, chunk, bargs)) {
3416 /* drange filter, makes sense only with devid filter */
3417 if ((bargs->flags & BTRFS_BALANCE_ARGS_DRANGE) &&
3418 chunk_drange_filter(leaf, chunk, chunk_offset, bargs)) {
3423 if ((bargs->flags & BTRFS_BALANCE_ARGS_VRANGE) &&
3424 chunk_vrange_filter(leaf, chunk, chunk_offset, bargs)) {
3428 /* stripes filter */
3429 if ((bargs->flags & BTRFS_BALANCE_ARGS_STRIPES_RANGE) &&
3430 chunk_stripes_range_filter(leaf, chunk, bargs)) {
3434 /* soft profile changing mode */
3435 if ((bargs->flags & BTRFS_BALANCE_ARGS_SOFT) &&
3436 chunk_soft_convert_filter(chunk_type, bargs)) {
3441 * limited by count, must be the last filter
3443 if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT)) {
3444 if (bargs->limit == 0)
3448 } else if ((bargs->flags & BTRFS_BALANCE_ARGS_LIMIT_RANGE)) {
3450 * Same logic as the 'limit' filter; the minimum cannot be
3451 * determined here because we do not have the global information
3452 * about the count of all chunks that satisfy the filters.
3454 if (bargs->limit_max == 0)
3463 static int __btrfs_balance(struct btrfs_fs_info *fs_info)
3465 struct btrfs_balance_control *bctl = fs_info->balance_ctl;
3466 struct btrfs_root *chunk_root = fs_info->chunk_root;
3467 struct btrfs_root *dev_root = fs_info->dev_root;
3468 struct list_head *devices;
3469 struct btrfs_device *device;
3473 struct btrfs_chunk *chunk;
3474 struct btrfs_path *path = NULL;
3475 struct btrfs_key key;
3476 struct btrfs_key found_key;
3477 struct btrfs_trans_handle *trans;
3478 struct extent_buffer *leaf;
3481 int enospc_errors = 0;
3482 bool counting = true;
3483 /* The single value limit and min/max limits use the same bytes in the */
3484 u64 limit_data = bctl->data.limit;
3485 u64 limit_meta = bctl->meta.limit;
3486 u64 limit_sys = bctl->sys.limit;
3490 int chunk_reserved = 0;
3493 /* step one make some room on all the devices */
3494 devices = &fs_info->fs_devices->devices;
3495 list_for_each_entry(device, devices, dev_list) {
3496 old_size = btrfs_device_get_total_bytes(device);
3497 size_to_free = div_factor(old_size, 1);
3498 size_to_free = min_t(u64, size_to_free, SZ_1M);
3499 if (!device->writeable ||
3500 btrfs_device_get_total_bytes(device) -
3501 btrfs_device_get_bytes_used(device) > size_to_free ||
3502 device->is_tgtdev_for_dev_replace)
3505 ret = btrfs_shrink_device(device, old_size - size_to_free);
3509 /* btrfs_shrink_device never returns ret > 0 */
3514 trans = btrfs_start_transaction(dev_root, 0);
3515 if (IS_ERR(trans)) {
3516 ret = PTR_ERR(trans);
3517 btrfs_info_in_rcu(fs_info,
3518 "resize: unable to start transaction after shrinking device %s (error %d), old size %llu, new size %llu",
3519 rcu_str_deref(device->name), ret,
3520 old_size, old_size - size_to_free);
3524 ret = btrfs_grow_device(trans, device, old_size);
3526 btrfs_end_transaction(trans, dev_root);
3527 /* btrfs_grow_device never returns ret > 0 */
3529 btrfs_info_in_rcu(fs_info,
3530 "resize: unable to grow device after shrinking device %s (error %d), old size %llu, new size %llu",
3531 rcu_str_deref(device->name), ret,
3532 old_size, old_size - size_to_free);
3536 btrfs_end_transaction(trans, dev_root);
3539 /* step two, relocate all the chunks */
3540 path = btrfs_alloc_path();
3546 /* zero out stat counters */
3547 spin_lock(&fs_info->balance_lock);
3548 memset(&bctl->stat, 0, sizeof(bctl->stat));
3549 spin_unlock(&fs_info->balance_lock);
3553 * The single value limit and min/max limits use the same bytes
3556 bctl->data.limit = limit_data;
3557 bctl->meta.limit = limit_meta;
3558 bctl->sys.limit = limit_sys;
3560 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
3561 key.offset = (u64)-1;
3562 key.type = BTRFS_CHUNK_ITEM_KEY;
3565 if ((!counting && atomic_read(&fs_info->balance_pause_req)) ||
3566 atomic_read(&fs_info->balance_cancel_req)) {
3571 mutex_lock(&fs_info->delete_unused_bgs_mutex);
3572 ret = btrfs_search_slot(NULL, chunk_root, &key, path, 0, 0);
3574 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3579 * this shouldn't happen, it means the last relocate
3583 BUG(); /* FIXME break ? */
3585 ret = btrfs_previous_item(chunk_root, path, 0,
3586 BTRFS_CHUNK_ITEM_KEY);
3588 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3593 leaf = path->nodes[0];
3594 slot = path->slots[0];
3595 btrfs_item_key_to_cpu(leaf, &found_key, slot);
3597 if (found_key.objectid != key.objectid) {
3598 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3602 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
3603 chunk_type = btrfs_chunk_type(leaf, chunk);
3606 spin_lock(&fs_info->balance_lock);
3607 bctl->stat.considered++;
3608 spin_unlock(&fs_info->balance_lock);
3611 ret = should_balance_chunk(chunk_root, leaf, chunk,
3614 btrfs_release_path(path);
3616 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3621 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3622 spin_lock(&fs_info->balance_lock);
3623 bctl->stat.expected++;
3624 spin_unlock(&fs_info->balance_lock);
3626 if (chunk_type & BTRFS_BLOCK_GROUP_DATA)
3628 else if (chunk_type & BTRFS_BLOCK_GROUP_SYSTEM)
3630 else if (chunk_type & BTRFS_BLOCK_GROUP_METADATA)
3637 * Apply limit_min filter, no need to check if the LIMITS
3638 * filter is used, limit_min is 0 by default
3640 if (((chunk_type & BTRFS_BLOCK_GROUP_DATA) &&
3641 count_data < bctl->data.limit_min)
3642 || ((chunk_type & BTRFS_BLOCK_GROUP_METADATA) &&
3643 count_meta < bctl->meta.limit_min)
3644 || ((chunk_type & BTRFS_BLOCK_GROUP_SYSTEM) &&
3645 count_sys < bctl->sys.limit_min)) {
3646 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3650 ASSERT(fs_info->data_sinfo);
3651 spin_lock(&fs_info->data_sinfo->lock);
3652 bytes_used = fs_info->data_sinfo->bytes_used;
3653 spin_unlock(&fs_info->data_sinfo->lock);
3655 if ((chunk_type & BTRFS_BLOCK_GROUP_DATA) &&
3656 !chunk_reserved && !bytes_used) {
3657 trans = btrfs_start_transaction(chunk_root, 0);
3658 if (IS_ERR(trans)) {
3659 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3660 ret = PTR_ERR(trans);
3664 ret = btrfs_force_chunk_alloc(trans, chunk_root,
3665 BTRFS_BLOCK_GROUP_DATA);
3666 btrfs_end_transaction(trans, chunk_root);
3668 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3674 ret = btrfs_relocate_chunk(fs_info, found_key.offset);
3675 mutex_unlock(&fs_info->delete_unused_bgs_mutex);
3676 if (ret && ret != -ENOSPC)
3678 if (ret == -ENOSPC) {
3681 spin_lock(&fs_info->balance_lock);
3682 bctl->stat.completed++;
3683 spin_unlock(&fs_info->balance_lock);
3686 if (found_key.offset == 0)
3688 key.offset = found_key.offset - 1;
3692 btrfs_release_path(path);
3697 btrfs_free_path(path);
3698 if (enospc_errors) {
3699 btrfs_info(fs_info, "%d enospc errors during balance",
3709 * alloc_profile_is_valid - see if a given profile is valid and reduced
3710 * @flags: profile to validate
3711 * @extended: if true @flags is treated as an extended profile
3713 static int alloc_profile_is_valid(u64 flags, int extended)
3715 u64 mask = (extended ? BTRFS_EXTENDED_PROFILE_MASK :
3716 BTRFS_BLOCK_GROUP_PROFILE_MASK);
3718 flags &= ~BTRFS_BLOCK_GROUP_TYPE_MASK;
3720 /* 1) check that all other bits are zeroed */
3724 /* 2) see if profile is reduced */
3726 return !extended; /* "0" is valid for usual profiles */
3728 /* true if exactly one bit set */
3729 return (flags & (flags - 1)) == 0;
3732 static inline int balance_need_close(struct btrfs_fs_info *fs_info)
3734 /* cancel requested || normal exit path */
3735 return atomic_read(&fs_info->balance_cancel_req) ||
3736 (atomic_read(&fs_info->balance_pause_req) == 0 &&
3737 atomic_read(&fs_info->balance_cancel_req) == 0);
3740 static void __cancel_balance(struct btrfs_fs_info *fs_info)
3744 unset_balance_control(fs_info);
3745 ret = del_balance_item(fs_info);
3747 btrfs_handle_fs_error(fs_info, ret, NULL);
3749 atomic_set(&fs_info->mutually_exclusive_operation_running, 0);
3752 /* Non-zero return value signifies invalidity */
3753 static inline int validate_convert_profile(struct btrfs_balance_args *bctl_arg,
3756 return ((bctl_arg->flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3757 (!alloc_profile_is_valid(bctl_arg->target, 1) ||
3758 (bctl_arg->target & ~allowed)));
3762 * Should be called with both balance and volume mutexes held
3764 int btrfs_balance(struct btrfs_balance_control *bctl,
3765 struct btrfs_ioctl_balance_args *bargs)
3767 struct btrfs_fs_info *fs_info = bctl->fs_info;
3774 if (btrfs_fs_closing(fs_info) ||
3775 atomic_read(&fs_info->balance_pause_req) ||
3776 atomic_read(&fs_info->balance_cancel_req)) {
3781 allowed = btrfs_super_incompat_flags(fs_info->super_copy);
3782 if (allowed & BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS)
3786 * In case of mixed groups both data and meta should be picked,
3787 * and identical options should be given for both of them.
3789 allowed = BTRFS_BALANCE_DATA | BTRFS_BALANCE_METADATA;
3790 if (mixed && (bctl->flags & allowed)) {
3791 if (!(bctl->flags & BTRFS_BALANCE_DATA) ||
3792 !(bctl->flags & BTRFS_BALANCE_METADATA) ||
3793 memcmp(&bctl->data, &bctl->meta, sizeof(bctl->data))) {
3795 "with mixed groups data and metadata balance options must be the same");
3801 num_devices = fs_info->fs_devices->num_devices;
3802 btrfs_dev_replace_lock(&fs_info->dev_replace, 0);
3803 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace)) {
3804 BUG_ON(num_devices < 1);
3807 btrfs_dev_replace_unlock(&fs_info->dev_replace, 0);
3808 allowed = BTRFS_AVAIL_ALLOC_BIT_SINGLE | BTRFS_BLOCK_GROUP_DUP;
3809 if (num_devices > 1)
3810 allowed |= (BTRFS_BLOCK_GROUP_RAID0 | BTRFS_BLOCK_GROUP_RAID1);
3811 if (num_devices > 2)
3812 allowed |= BTRFS_BLOCK_GROUP_RAID5;
3813 if (num_devices > 3)
3814 allowed |= (BTRFS_BLOCK_GROUP_RAID10 |
3815 BTRFS_BLOCK_GROUP_RAID6);
3816 if (validate_convert_profile(&bctl->data, allowed)) {
3818 "unable to start balance with target data profile %llu",
3823 if (validate_convert_profile(&bctl->meta, allowed)) {
3825 "unable to start balance with target metadata profile %llu",
3830 if (validate_convert_profile(&bctl->sys, allowed)) {
3832 "unable to start balance with target system profile %llu",
3838 /* allow to reduce meta or sys integrity only if force set */
3839 allowed = BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1 |
3840 BTRFS_BLOCK_GROUP_RAID10 |
3841 BTRFS_BLOCK_GROUP_RAID5 |
3842 BTRFS_BLOCK_GROUP_RAID6;
3844 seq = read_seqbegin(&fs_info->profiles_lock);
3846 if (((bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3847 (fs_info->avail_system_alloc_bits & allowed) &&
3848 !(bctl->sys.target & allowed)) ||
3849 ((bctl->meta.flags & BTRFS_BALANCE_ARGS_CONVERT) &&
3850 (fs_info->avail_metadata_alloc_bits & allowed) &&
3851 !(bctl->meta.target & allowed))) {
3852 if (bctl->flags & BTRFS_BALANCE_FORCE) {
3854 "force reducing metadata integrity");
3857 "balance will reduce metadata integrity, use force if you want this");
3862 } while (read_seqretry(&fs_info->profiles_lock, seq));
3864 if (btrfs_get_num_tolerated_disk_barrier_failures(bctl->meta.target) <
3865 btrfs_get_num_tolerated_disk_barrier_failures(bctl->data.target)) {
3867 "metadata profile 0x%llx has lower redundancy than data profile 0x%llx",
3868 bctl->meta.target, bctl->data.target);
3871 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) {
3872 fs_info->num_tolerated_disk_barrier_failures = min(
3873 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info),
3874 btrfs_get_num_tolerated_disk_barrier_failures(
3878 ret = insert_balance_item(fs_info, bctl);
3879 if (ret && ret != -EEXIST)
3882 if (!(bctl->flags & BTRFS_BALANCE_RESUME)) {
3883 BUG_ON(ret == -EEXIST);
3884 set_balance_control(bctl);
3886 BUG_ON(ret != -EEXIST);
3887 spin_lock(&fs_info->balance_lock);
3888 update_balance_args(bctl);
3889 spin_unlock(&fs_info->balance_lock);
3892 atomic_inc(&fs_info->balance_running);
3893 mutex_unlock(&fs_info->balance_mutex);
3895 ret = __btrfs_balance(fs_info);
3897 mutex_lock(&fs_info->balance_mutex);
3898 atomic_dec(&fs_info->balance_running);
3900 if (bctl->sys.flags & BTRFS_BALANCE_ARGS_CONVERT) {
3901 fs_info->num_tolerated_disk_barrier_failures =
3902 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info);
3906 memset(bargs, 0, sizeof(*bargs));
3907 update_ioctl_balance_args(fs_info, 0, bargs);
3910 if ((ret && ret != -ECANCELED && ret != -ENOSPC) ||
3911 balance_need_close(fs_info)) {
3912 __cancel_balance(fs_info);
3915 wake_up(&fs_info->balance_wait_q);
3919 if (bctl->flags & BTRFS_BALANCE_RESUME)
3920 __cancel_balance(fs_info);
3923 atomic_set(&fs_info->mutually_exclusive_operation_running, 0);
3928 static int balance_kthread(void *data)
3930 struct btrfs_fs_info *fs_info = data;
3933 mutex_lock(&fs_info->volume_mutex);
3934 mutex_lock(&fs_info->balance_mutex);
3936 if (fs_info->balance_ctl) {
3937 btrfs_info(fs_info, "continuing balance");
3938 ret = btrfs_balance(fs_info->balance_ctl, NULL);
3941 mutex_unlock(&fs_info->balance_mutex);
3942 mutex_unlock(&fs_info->volume_mutex);
3947 int btrfs_resume_balance_async(struct btrfs_fs_info *fs_info)
3949 struct task_struct *tsk;
3951 spin_lock(&fs_info->balance_lock);
3952 if (!fs_info->balance_ctl) {
3953 spin_unlock(&fs_info->balance_lock);
3956 spin_unlock(&fs_info->balance_lock);
3958 if (btrfs_test_opt(fs_info, SKIP_BALANCE)) {
3959 btrfs_info(fs_info, "force skipping balance");
3963 tsk = kthread_run(balance_kthread, fs_info, "btrfs-balance");
3964 return PTR_ERR_OR_ZERO(tsk);
3967 int btrfs_recover_balance(struct btrfs_fs_info *fs_info)
3969 struct btrfs_balance_control *bctl;
3970 struct btrfs_balance_item *item;
3971 struct btrfs_disk_balance_args disk_bargs;
3972 struct btrfs_path *path;
3973 struct extent_buffer *leaf;
3974 struct btrfs_key key;
3977 path = btrfs_alloc_path();
3981 key.objectid = BTRFS_BALANCE_OBJECTID;
3982 key.type = BTRFS_TEMPORARY_ITEM_KEY;
3985 ret = btrfs_search_slot(NULL, fs_info->tree_root, &key, path, 0, 0);
3988 if (ret > 0) { /* ret = -ENOENT; */
3993 bctl = kzalloc(sizeof(*bctl), GFP_NOFS);
3999 leaf = path->nodes[0];
4000 item = btrfs_item_ptr(leaf, path->slots[0], struct btrfs_balance_item);
4002 bctl->fs_info = fs_info;
4003 bctl->flags = btrfs_balance_flags(leaf, item);
4004 bctl->flags |= BTRFS_BALANCE_RESUME;
4006 btrfs_balance_data(leaf, item, &disk_bargs);
4007 btrfs_disk_balance_args_to_cpu(&bctl->data, &disk_bargs);
4008 btrfs_balance_meta(leaf, item, &disk_bargs);
4009 btrfs_disk_balance_args_to_cpu(&bctl->meta, &disk_bargs);
4010 btrfs_balance_sys(leaf, item, &disk_bargs);
4011 btrfs_disk_balance_args_to_cpu(&bctl->sys, &disk_bargs);
4013 WARN_ON(atomic_xchg(&fs_info->mutually_exclusive_operation_running, 1));
4015 mutex_lock(&fs_info->volume_mutex);
4016 mutex_lock(&fs_info->balance_mutex);
4018 set_balance_control(bctl);
4020 mutex_unlock(&fs_info->balance_mutex);
4021 mutex_unlock(&fs_info->volume_mutex);
4023 btrfs_free_path(path);
4027 int btrfs_pause_balance(struct btrfs_fs_info *fs_info)
4031 mutex_lock(&fs_info->balance_mutex);
4032 if (!fs_info->balance_ctl) {
4033 mutex_unlock(&fs_info->balance_mutex);
4037 if (atomic_read(&fs_info->balance_running)) {
4038 atomic_inc(&fs_info->balance_pause_req);
4039 mutex_unlock(&fs_info->balance_mutex);
4041 wait_event(fs_info->balance_wait_q,
4042 atomic_read(&fs_info->balance_running) == 0);
4044 mutex_lock(&fs_info->balance_mutex);
4045 /* we are good with balance_ctl ripped off from under us */
4046 BUG_ON(atomic_read(&fs_info->balance_running));
4047 atomic_dec(&fs_info->balance_pause_req);
4052 mutex_unlock(&fs_info->balance_mutex);
4056 int btrfs_cancel_balance(struct btrfs_fs_info *fs_info)
4058 if (fs_info->sb->s_flags & MS_RDONLY)
4061 mutex_lock(&fs_info->balance_mutex);
4062 if (!fs_info->balance_ctl) {
4063 mutex_unlock(&fs_info->balance_mutex);
4067 atomic_inc(&fs_info->balance_cancel_req);
4069 * if we are running just wait and return, balance item is
4070 * deleted in btrfs_balance in this case
4072 if (atomic_read(&fs_info->balance_running)) {
4073 mutex_unlock(&fs_info->balance_mutex);
4074 wait_event(fs_info->balance_wait_q,
4075 atomic_read(&fs_info->balance_running) == 0);
4076 mutex_lock(&fs_info->balance_mutex);
4078 /* __cancel_balance needs volume_mutex */
4079 mutex_unlock(&fs_info->balance_mutex);
4080 mutex_lock(&fs_info->volume_mutex);
4081 mutex_lock(&fs_info->balance_mutex);
4083 if (fs_info->balance_ctl)
4084 __cancel_balance(fs_info);
4086 mutex_unlock(&fs_info->volume_mutex);
4089 BUG_ON(fs_info->balance_ctl || atomic_read(&fs_info->balance_running));
4090 atomic_dec(&fs_info->balance_cancel_req);
4091 mutex_unlock(&fs_info->balance_mutex);
4095 static int btrfs_uuid_scan_kthread(void *data)
4097 struct btrfs_fs_info *fs_info = data;
4098 struct btrfs_root *root = fs_info->tree_root;
4099 struct btrfs_key key;
4100 struct btrfs_key max_key;
4101 struct btrfs_path *path = NULL;
4103 struct extent_buffer *eb;
4105 struct btrfs_root_item root_item;
4107 struct btrfs_trans_handle *trans = NULL;
4109 path = btrfs_alloc_path();
4116 key.type = BTRFS_ROOT_ITEM_KEY;
4119 max_key.objectid = (u64)-1;
4120 max_key.type = BTRFS_ROOT_ITEM_KEY;
4121 max_key.offset = (u64)-1;
4124 ret = btrfs_search_forward(root, &key, path, 0);
4131 if (key.type != BTRFS_ROOT_ITEM_KEY ||
4132 (key.objectid < BTRFS_FIRST_FREE_OBJECTID &&
4133 key.objectid != BTRFS_FS_TREE_OBJECTID) ||
4134 key.objectid > BTRFS_LAST_FREE_OBJECTID)
4137 eb = path->nodes[0];
4138 slot = path->slots[0];
4139 item_size = btrfs_item_size_nr(eb, slot);
4140 if (item_size < sizeof(root_item))
4143 read_extent_buffer(eb, &root_item,
4144 btrfs_item_ptr_offset(eb, slot),
4145 (int)sizeof(root_item));
4146 if (btrfs_root_refs(&root_item) == 0)
4149 if (!btrfs_is_empty_uuid(root_item.uuid) ||
4150 !btrfs_is_empty_uuid(root_item.received_uuid)) {
4154 btrfs_release_path(path);
4156 * 1 - subvol uuid item
4157 * 1 - received_subvol uuid item
4159 trans = btrfs_start_transaction(fs_info->uuid_root, 2);
4160 if (IS_ERR(trans)) {
4161 ret = PTR_ERR(trans);
4169 if (!btrfs_is_empty_uuid(root_item.uuid)) {
4170 ret = btrfs_uuid_tree_add(trans, fs_info,
4172 BTRFS_UUID_KEY_SUBVOL,
4175 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4181 if (!btrfs_is_empty_uuid(root_item.received_uuid)) {
4182 ret = btrfs_uuid_tree_add(trans, fs_info,
4183 root_item.received_uuid,
4184 BTRFS_UUID_KEY_RECEIVED_SUBVOL,
4187 btrfs_warn(fs_info, "uuid_tree_add failed %d",
4195 ret = btrfs_end_transaction(trans, fs_info->uuid_root);
4201 btrfs_release_path(path);
4202 if (key.offset < (u64)-1) {
4204 } else if (key.type < BTRFS_ROOT_ITEM_KEY) {
4206 key.type = BTRFS_ROOT_ITEM_KEY;
4207 } else if (key.objectid < (u64)-1) {
4209 key.type = BTRFS_ROOT_ITEM_KEY;
4218 btrfs_free_path(path);
4219 if (trans && !IS_ERR(trans))
4220 btrfs_end_transaction(trans, fs_info->uuid_root);
4222 btrfs_warn(fs_info, "btrfs_uuid_scan_kthread failed %d", ret);
4224 set_bit(BTRFS_FS_UPDATE_UUID_TREE_GEN, &fs_info->flags);
4225 up(&fs_info->uuid_tree_rescan_sem);
4230 * Callback for btrfs_uuid_tree_iterate().
4232 * 0 check succeeded, the entry is not outdated.
4233 * < 0 if an error occurred.
4234 * > 0 if the check failed, which means the caller shall remove the entry.
4236 static int btrfs_check_uuid_tree_entry(struct btrfs_fs_info *fs_info,
4237 u8 *uuid, u8 type, u64 subid)
4239 struct btrfs_key key;
4241 struct btrfs_root *subvol_root;
4243 if (type != BTRFS_UUID_KEY_SUBVOL &&
4244 type != BTRFS_UUID_KEY_RECEIVED_SUBVOL)
4247 key.objectid = subid;
4248 key.type = BTRFS_ROOT_ITEM_KEY;
4249 key.offset = (u64)-1;
4250 subvol_root = btrfs_read_fs_root_no_name(fs_info, &key);
4251 if (IS_ERR(subvol_root)) {
4252 ret = PTR_ERR(subvol_root);
4259 case BTRFS_UUID_KEY_SUBVOL:
4260 if (memcmp(uuid, subvol_root->root_item.uuid, BTRFS_UUID_SIZE))
4263 case BTRFS_UUID_KEY_RECEIVED_SUBVOL:
4264 if (memcmp(uuid, subvol_root->root_item.received_uuid,
4274 static int btrfs_uuid_rescan_kthread(void *data)
4276 struct btrfs_fs_info *fs_info = (struct btrfs_fs_info *)data;
4280 * 1st step is to iterate through the existing UUID tree and
4281 * to delete all entries that contain outdated data.
4282 * 2nd step is to add all missing entries to the UUID tree.
4284 ret = btrfs_uuid_tree_iterate(fs_info, btrfs_check_uuid_tree_entry);
4286 btrfs_warn(fs_info, "iterating uuid_tree failed %d", ret);
4287 up(&fs_info->uuid_tree_rescan_sem);
4290 return btrfs_uuid_scan_kthread(data);
4293 int btrfs_create_uuid_tree(struct btrfs_fs_info *fs_info)
4295 struct btrfs_trans_handle *trans;
4296 struct btrfs_root *tree_root = fs_info->tree_root;
4297 struct btrfs_root *uuid_root;
4298 struct task_struct *task;
4305 trans = btrfs_start_transaction(tree_root, 2);
4307 return PTR_ERR(trans);
4309 uuid_root = btrfs_create_tree(trans, fs_info,
4310 BTRFS_UUID_TREE_OBJECTID);
4311 if (IS_ERR(uuid_root)) {
4312 ret = PTR_ERR(uuid_root);
4313 btrfs_abort_transaction(trans, ret);
4314 btrfs_end_transaction(trans, tree_root);
4318 fs_info->uuid_root = uuid_root;
4320 ret = btrfs_commit_transaction(trans, tree_root);
4324 down(&fs_info->uuid_tree_rescan_sem);
4325 task = kthread_run(btrfs_uuid_scan_kthread, fs_info, "btrfs-uuid");
4327 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4328 btrfs_warn(fs_info, "failed to start uuid_scan task");
4329 up(&fs_info->uuid_tree_rescan_sem);
4330 return PTR_ERR(task);
4336 int btrfs_check_uuid_tree(struct btrfs_fs_info *fs_info)
4338 struct task_struct *task;
4340 down(&fs_info->uuid_tree_rescan_sem);
4341 task = kthread_run(btrfs_uuid_rescan_kthread, fs_info, "btrfs-uuid");
4343 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
4344 btrfs_warn(fs_info, "failed to start uuid_rescan task");
4345 up(&fs_info->uuid_tree_rescan_sem);
4346 return PTR_ERR(task);
4353 * shrinking a device means finding all of the device extents past
4354 * the new size, and then following the back refs to the chunks.
4355 * The chunk relocation code actually frees the device extent
4357 int btrfs_shrink_device(struct btrfs_device *device, u64 new_size)
4359 struct btrfs_trans_handle *trans;
4360 struct btrfs_root *root = device->fs_info->dev_root;
4361 struct btrfs_dev_extent *dev_extent = NULL;
4362 struct btrfs_path *path;
4368 bool retried = false;
4369 bool checked_pending_chunks = false;
4370 struct extent_buffer *l;
4371 struct btrfs_key key;
4372 struct btrfs_super_block *super_copy = root->fs_info->super_copy;
4373 u64 old_total = btrfs_super_total_bytes(super_copy);
4374 u64 old_size = btrfs_device_get_total_bytes(device);
4375 u64 diff = old_size - new_size;
4377 if (device->is_tgtdev_for_dev_replace)
4380 path = btrfs_alloc_path();
4384 path->reada = READA_FORWARD;
4388 btrfs_device_set_total_bytes(device, new_size);
4389 if (device->writeable) {
4390 device->fs_devices->total_rw_bytes -= diff;
4391 spin_lock(&root->fs_info->free_chunk_lock);
4392 root->fs_info->free_chunk_space -= diff;
4393 spin_unlock(&root->fs_info->free_chunk_lock);
4395 unlock_chunks(root);
4398 key.objectid = device->devid;
4399 key.offset = (u64)-1;
4400 key.type = BTRFS_DEV_EXTENT_KEY;
4403 mutex_lock(&root->fs_info->delete_unused_bgs_mutex);
4404 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
4406 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
4410 ret = btrfs_previous_item(root, path, 0, key.type);
4412 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
4417 btrfs_release_path(path);
4422 slot = path->slots[0];
4423 btrfs_item_key_to_cpu(l, &key, path->slots[0]);
4425 if (key.objectid != device->devid) {
4426 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
4427 btrfs_release_path(path);
4431 dev_extent = btrfs_item_ptr(l, slot, struct btrfs_dev_extent);
4432 length = btrfs_dev_extent_length(l, dev_extent);
4434 if (key.offset + length <= new_size) {
4435 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
4436 btrfs_release_path(path);
4440 chunk_offset = btrfs_dev_extent_chunk_offset(l, dev_extent);
4441 btrfs_release_path(path);
4443 ret = btrfs_relocate_chunk(root->fs_info, chunk_offset);
4444 mutex_unlock(&root->fs_info->delete_unused_bgs_mutex);
4445 if (ret && ret != -ENOSPC)
4449 } while (key.offset-- > 0);
4451 if (failed && !retried) {
4455 } else if (failed && retried) {
4460 /* Shrinking succeeded, else we would be at "done". */
4461 trans = btrfs_start_transaction(root, 0);
4462 if (IS_ERR(trans)) {
4463 ret = PTR_ERR(trans);
4470 * We checked in the above loop all device extents that were already in
4471 * the device tree. However before we have updated the device's
4472 * total_bytes to the new size, we might have had chunk allocations that
4473 * have not complete yet (new block groups attached to transaction
4474 * handles), and therefore their device extents were not yet in the
4475 * device tree and we missed them in the loop above. So if we have any
4476 * pending chunk using a device extent that overlaps the device range
4477 * that we can not use anymore, commit the current transaction and
4478 * repeat the search on the device tree - this way we guarantee we will
4479 * not have chunks using device extents that end beyond 'new_size'.
4481 if (!checked_pending_chunks) {
4482 u64 start = new_size;
4483 u64 len = old_size - new_size;
4485 if (contains_pending_extent(trans->transaction, device,
4487 unlock_chunks(root);
4488 checked_pending_chunks = true;
4491 ret = btrfs_commit_transaction(trans, root);
4498 btrfs_device_set_disk_total_bytes(device, new_size);
4499 if (list_empty(&device->resized_list))
4500 list_add_tail(&device->resized_list,
4501 &root->fs_info->fs_devices->resized_devices);
4503 WARN_ON(diff > old_total);
4504 btrfs_set_super_total_bytes(super_copy, old_total - diff);
4505 unlock_chunks(root);
4507 /* Now btrfs_update_device() will change the on-disk size. */
4508 ret = btrfs_update_device(trans, device);
4509 btrfs_end_transaction(trans, root);
4511 btrfs_free_path(path);
4514 btrfs_device_set_total_bytes(device, old_size);
4515 if (device->writeable)
4516 device->fs_devices->total_rw_bytes += diff;
4517 spin_lock(&root->fs_info->free_chunk_lock);
4518 root->fs_info->free_chunk_space += diff;
4519 spin_unlock(&root->fs_info->free_chunk_lock);
4520 unlock_chunks(root);
4525 static int btrfs_add_system_chunk(struct btrfs_root *root,
4526 struct btrfs_key *key,
4527 struct btrfs_chunk *chunk, int item_size)
4529 struct btrfs_super_block *super_copy = root->fs_info->super_copy;
4530 struct btrfs_disk_key disk_key;
4535 array_size = btrfs_super_sys_array_size(super_copy);
4536 if (array_size + item_size + sizeof(disk_key)
4537 > BTRFS_SYSTEM_CHUNK_ARRAY_SIZE) {
4538 unlock_chunks(root);
4542 ptr = super_copy->sys_chunk_array + array_size;
4543 btrfs_cpu_key_to_disk(&disk_key, key);
4544 memcpy(ptr, &disk_key, sizeof(disk_key));
4545 ptr += sizeof(disk_key);
4546 memcpy(ptr, chunk, item_size);
4547 item_size += sizeof(disk_key);
4548 btrfs_set_super_sys_array_size(super_copy, array_size + item_size);
4549 unlock_chunks(root);
4555 * sort the devices in descending order by max_avail, total_avail
4557 static int btrfs_cmp_device_info(const void *a, const void *b)
4559 const struct btrfs_device_info *di_a = a;
4560 const struct btrfs_device_info *di_b = b;
4562 if (di_a->max_avail > di_b->max_avail)
4564 if (di_a->max_avail < di_b->max_avail)
4566 if (di_a->total_avail > di_b->total_avail)
4568 if (di_a->total_avail < di_b->total_avail)
4573 static u32 find_raid56_stripe_len(u32 data_devices, u32 dev_stripe_target)
4575 /* TODO allow them to set a preferred stripe size */
4579 static void check_raid56_incompat_flag(struct btrfs_fs_info *info, u64 type)
4581 if (!(type & BTRFS_BLOCK_GROUP_RAID56_MASK))
4584 btrfs_set_fs_incompat(info, RAID56);
4587 #define BTRFS_MAX_DEVS(r) ((BTRFS_MAX_ITEM_SIZE(r->fs_info) \
4588 - sizeof(struct btrfs_chunk)) \
4589 / sizeof(struct btrfs_stripe) + 1)
4591 #define BTRFS_MAX_DEVS_SYS_CHUNK ((BTRFS_SYSTEM_CHUNK_ARRAY_SIZE \
4592 - 2 * sizeof(struct btrfs_disk_key) \
4593 - 2 * sizeof(struct btrfs_chunk)) \
4594 / sizeof(struct btrfs_stripe) + 1)
4596 static int __btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
4597 struct btrfs_root *extent_root, u64 start,
4600 struct btrfs_fs_info *info = extent_root->fs_info;
4601 struct btrfs_fs_devices *fs_devices = info->fs_devices;
4602 struct list_head *cur;
4603 struct map_lookup *map = NULL;
4604 struct extent_map_tree *em_tree;
4605 struct extent_map *em;
4606 struct btrfs_device_info *devices_info = NULL;
4608 int num_stripes; /* total number of stripes to allocate */
4609 int data_stripes; /* number of stripes that count for
4611 int sub_stripes; /* sub_stripes info for map */
4612 int dev_stripes; /* stripes per dev */
4613 int devs_max; /* max devs to use */
4614 int devs_min; /* min devs needed */
4615 int devs_increment; /* ndevs has to be a multiple of this */
4616 int ncopies; /* how many copies to data has */
4618 u64 max_stripe_size;
4622 u64 raid_stripe_len = BTRFS_STRIPE_LEN;
4628 BUG_ON(!alloc_profile_is_valid(type, 0));
4630 if (list_empty(&fs_devices->alloc_list))
4633 index = __get_raid_index(type);
4635 sub_stripes = btrfs_raid_array[index].sub_stripes;
4636 dev_stripes = btrfs_raid_array[index].dev_stripes;
4637 devs_max = btrfs_raid_array[index].devs_max;
4638 devs_min = btrfs_raid_array[index].devs_min;
4639 devs_increment = btrfs_raid_array[index].devs_increment;
4640 ncopies = btrfs_raid_array[index].ncopies;
4642 if (type & BTRFS_BLOCK_GROUP_DATA) {
4643 max_stripe_size = SZ_1G;
4644 max_chunk_size = 10 * max_stripe_size;
4646 devs_max = BTRFS_MAX_DEVS(info->chunk_root);
4647 } else if (type & BTRFS_BLOCK_GROUP_METADATA) {
4648 /* for larger filesystems, use larger metadata chunks */
4649 if (fs_devices->total_rw_bytes > 50ULL * SZ_1G)
4650 max_stripe_size = SZ_1G;
4652 max_stripe_size = SZ_256M;
4653 max_chunk_size = max_stripe_size;
4655 devs_max = BTRFS_MAX_DEVS(info->chunk_root);
4656 } else if (type & BTRFS_BLOCK_GROUP_SYSTEM) {
4657 max_stripe_size = SZ_32M;
4658 max_chunk_size = 2 * max_stripe_size;
4660 devs_max = BTRFS_MAX_DEVS_SYS_CHUNK;
4662 btrfs_err(info, "invalid chunk type 0x%llx requested",
4667 /* we don't want a chunk larger than 10% of writeable space */
4668 max_chunk_size = min(div_factor(fs_devices->total_rw_bytes, 1),
4671 devices_info = kcalloc(fs_devices->rw_devices, sizeof(*devices_info),
4676 cur = fs_devices->alloc_list.next;
4679 * in the first pass through the devices list, we gather information
4680 * about the available holes on each device.
4683 while (cur != &fs_devices->alloc_list) {
4684 struct btrfs_device *device;
4688 device = list_entry(cur, struct btrfs_device, dev_alloc_list);
4692 if (!device->writeable) {
4694 "BTRFS: read-only device in alloc_list\n");
4698 if (!device->in_fs_metadata ||
4699 device->is_tgtdev_for_dev_replace)
4702 if (device->total_bytes > device->bytes_used)
4703 total_avail = device->total_bytes - device->bytes_used;
4707 /* If there is no space on this device, skip it. */
4708 if (total_avail == 0)
4711 ret = find_free_dev_extent(trans, device,
4712 max_stripe_size * dev_stripes,
4713 &dev_offset, &max_avail);
4714 if (ret && ret != -ENOSPC)
4718 max_avail = max_stripe_size * dev_stripes;
4720 if (max_avail < BTRFS_STRIPE_LEN * dev_stripes)
4723 if (ndevs == fs_devices->rw_devices) {
4724 WARN(1, "%s: found more than %llu devices\n",
4725 __func__, fs_devices->rw_devices);
4728 devices_info[ndevs].dev_offset = dev_offset;
4729 devices_info[ndevs].max_avail = max_avail;
4730 devices_info[ndevs].total_avail = total_avail;
4731 devices_info[ndevs].dev = device;
4736 * now sort the devices by hole size / available space
4738 sort(devices_info, ndevs, sizeof(struct btrfs_device_info),
4739 btrfs_cmp_device_info, NULL);
4741 /* round down to number of usable stripes */
4742 ndevs -= ndevs % devs_increment;
4744 if (ndevs < devs_increment * sub_stripes || ndevs < devs_min) {
4749 if (devs_max && ndevs > devs_max)
4752 * the primary goal is to maximize the number of stripes, so use as many
4753 * devices as possible, even if the stripes are not maximum sized.
4755 stripe_size = devices_info[ndevs-1].max_avail;
4756 num_stripes = ndevs * dev_stripes;
4759 * this will have to be fixed for RAID1 and RAID10 over
4762 data_stripes = num_stripes / ncopies;
4764 if (type & BTRFS_BLOCK_GROUP_RAID5) {
4765 raid_stripe_len = find_raid56_stripe_len(ndevs - 1,
4767 data_stripes = num_stripes - 1;
4769 if (type & BTRFS_BLOCK_GROUP_RAID6) {
4770 raid_stripe_len = find_raid56_stripe_len(ndevs - 2,
4772 data_stripes = num_stripes - 2;
4776 * Use the number of data stripes to figure out how big this chunk
4777 * is really going to be in terms of logical address space,
4778 * and compare that answer with the max chunk size
4780 if (stripe_size * data_stripes > max_chunk_size) {
4781 u64 mask = (1ULL << 24) - 1;
4783 stripe_size = div_u64(max_chunk_size, data_stripes);
4785 /* bump the answer up to a 16MB boundary */
4786 stripe_size = (stripe_size + mask) & ~mask;
4788 /* but don't go higher than the limits we found
4789 * while searching for free extents
4791 if (stripe_size > devices_info[ndevs-1].max_avail)
4792 stripe_size = devices_info[ndevs-1].max_avail;
4795 stripe_size = div_u64(stripe_size, dev_stripes);
4797 /* align to BTRFS_STRIPE_LEN */
4798 stripe_size = div_u64(stripe_size, raid_stripe_len);
4799 stripe_size *= raid_stripe_len;
4801 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
4806 map->num_stripes = num_stripes;
4808 for (i = 0; i < ndevs; ++i) {
4809 for (j = 0; j < dev_stripes; ++j) {
4810 int s = i * dev_stripes + j;
4811 map->stripes[s].dev = devices_info[i].dev;
4812 map->stripes[s].physical = devices_info[i].dev_offset +
4816 map->sector_size = info->sectorsize;
4817 map->stripe_len = raid_stripe_len;
4818 map->io_align = raid_stripe_len;
4819 map->io_width = raid_stripe_len;
4821 map->sub_stripes = sub_stripes;
4823 num_bytes = stripe_size * data_stripes;
4825 trace_btrfs_chunk_alloc(info, map, start, num_bytes);
4827 em = alloc_extent_map();
4833 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
4834 em->map_lookup = map;
4836 em->len = num_bytes;
4837 em->block_start = 0;
4838 em->block_len = em->len;
4839 em->orig_block_len = stripe_size;
4841 em_tree = &extent_root->fs_info->mapping_tree.map_tree;
4842 write_lock(&em_tree->lock);
4843 ret = add_extent_mapping(em_tree, em, 0);
4845 list_add_tail(&em->list, &trans->transaction->pending_chunks);
4846 atomic_inc(&em->refs);
4848 write_unlock(&em_tree->lock);
4850 free_extent_map(em);
4854 ret = btrfs_make_block_group(trans, extent_root, 0, type,
4855 BTRFS_FIRST_CHUNK_TREE_OBJECTID,
4858 goto error_del_extent;
4860 for (i = 0; i < map->num_stripes; i++) {
4861 num_bytes = map->stripes[i].dev->bytes_used + stripe_size;
4862 btrfs_device_set_bytes_used(map->stripes[i].dev, num_bytes);
4865 spin_lock(&extent_root->fs_info->free_chunk_lock);
4866 extent_root->fs_info->free_chunk_space -= (stripe_size *
4868 spin_unlock(&extent_root->fs_info->free_chunk_lock);
4870 free_extent_map(em);
4871 check_raid56_incompat_flag(extent_root->fs_info, type);
4873 kfree(devices_info);
4877 write_lock(&em_tree->lock);
4878 remove_extent_mapping(em_tree, em);
4879 write_unlock(&em_tree->lock);
4881 /* One for our allocation */
4882 free_extent_map(em);
4883 /* One for the tree reference */
4884 free_extent_map(em);
4885 /* One for the pending_chunks list reference */
4886 free_extent_map(em);
4888 kfree(devices_info);
4892 int btrfs_finish_chunk_alloc(struct btrfs_trans_handle *trans,
4893 struct btrfs_fs_info *fs_info,
4894 u64 chunk_offset, u64 chunk_size)
4896 struct btrfs_root *extent_root = fs_info->extent_root;
4897 struct btrfs_root *chunk_root = fs_info->chunk_root;
4898 struct btrfs_key key;
4899 struct btrfs_device *device;
4900 struct btrfs_chunk *chunk;
4901 struct btrfs_stripe *stripe;
4902 struct extent_map_tree *em_tree;
4903 struct extent_map *em;
4904 struct map_lookup *map;
4911 em_tree = &extent_root->fs_info->mapping_tree.map_tree;
4912 read_lock(&em_tree->lock);
4913 em = lookup_extent_mapping(em_tree, chunk_offset, chunk_size);
4914 read_unlock(&em_tree->lock);
4917 btrfs_crit(extent_root->fs_info,
4918 "unable to find logical %Lu len %Lu",
4919 chunk_offset, chunk_size);
4923 if (em->start != chunk_offset || em->len != chunk_size) {
4924 btrfs_crit(extent_root->fs_info,
4925 "found a bad mapping, wanted %Lu-%Lu, found %Lu-%Lu",
4926 chunk_offset, chunk_size, em->start, em->len);
4927 free_extent_map(em);
4931 map = em->map_lookup;
4932 item_size = btrfs_chunk_item_size(map->num_stripes);
4933 stripe_size = em->orig_block_len;
4935 chunk = kzalloc(item_size, GFP_NOFS);
4942 * Take the device list mutex to prevent races with the final phase of
4943 * a device replace operation that replaces the device object associated
4944 * with the map's stripes, because the device object's id can change
4945 * at any time during that final phase of the device replace operation
4946 * (dev-replace.c:btrfs_dev_replace_finishing()).
4948 mutex_lock(&chunk_root->fs_info->fs_devices->device_list_mutex);
4949 for (i = 0; i < map->num_stripes; i++) {
4950 device = map->stripes[i].dev;
4951 dev_offset = map->stripes[i].physical;
4953 ret = btrfs_update_device(trans, device);
4956 ret = btrfs_alloc_dev_extent(trans, device,
4957 chunk_root->root_key.objectid,
4958 BTRFS_FIRST_CHUNK_TREE_OBJECTID,
4959 chunk_offset, dev_offset,
4965 mutex_unlock(&chunk_root->fs_info->fs_devices->device_list_mutex);
4969 stripe = &chunk->stripe;
4970 for (i = 0; i < map->num_stripes; i++) {
4971 device = map->stripes[i].dev;
4972 dev_offset = map->stripes[i].physical;
4974 btrfs_set_stack_stripe_devid(stripe, device->devid);
4975 btrfs_set_stack_stripe_offset(stripe, dev_offset);
4976 memcpy(stripe->dev_uuid, device->uuid, BTRFS_UUID_SIZE);
4979 mutex_unlock(&chunk_root->fs_info->fs_devices->device_list_mutex);
4981 btrfs_set_stack_chunk_length(chunk, chunk_size);
4982 btrfs_set_stack_chunk_owner(chunk, extent_root->root_key.objectid);
4983 btrfs_set_stack_chunk_stripe_len(chunk, map->stripe_len);
4984 btrfs_set_stack_chunk_type(chunk, map->type);
4985 btrfs_set_stack_chunk_num_stripes(chunk, map->num_stripes);
4986 btrfs_set_stack_chunk_io_align(chunk, map->stripe_len);
4987 btrfs_set_stack_chunk_io_width(chunk, map->stripe_len);
4988 btrfs_set_stack_chunk_sector_size(chunk,
4989 extent_root->fs_info->sectorsize);
4990 btrfs_set_stack_chunk_sub_stripes(chunk, map->sub_stripes);
4992 key.objectid = BTRFS_FIRST_CHUNK_TREE_OBJECTID;
4993 key.type = BTRFS_CHUNK_ITEM_KEY;
4994 key.offset = chunk_offset;
4996 ret = btrfs_insert_item(trans, chunk_root, &key, chunk, item_size);
4997 if (ret == 0 && map->type & BTRFS_BLOCK_GROUP_SYSTEM) {
4999 * TODO: Cleanup of inserted chunk root in case of
5002 ret = btrfs_add_system_chunk(chunk_root, &key, chunk,
5008 free_extent_map(em);
5013 * Chunk allocation falls into two parts. The first part does works
5014 * that make the new allocated chunk useable, but not do any operation
5015 * that modifies the chunk tree. The second part does the works that
5016 * require modifying the chunk tree. This division is important for the
5017 * bootstrap process of adding storage to a seed btrfs.
5019 int btrfs_alloc_chunk(struct btrfs_trans_handle *trans,
5020 struct btrfs_root *extent_root, u64 type)
5024 ASSERT(mutex_is_locked(&extent_root->fs_info->chunk_mutex));
5025 chunk_offset = find_next_chunk(extent_root->fs_info);
5026 return __btrfs_alloc_chunk(trans, extent_root, chunk_offset, type);
5029 static noinline int init_first_rw_device(struct btrfs_trans_handle *trans,
5030 struct btrfs_root *root,
5031 struct btrfs_device *device)
5034 u64 sys_chunk_offset;
5036 struct btrfs_fs_info *fs_info = root->fs_info;
5037 struct btrfs_root *extent_root = fs_info->extent_root;
5040 chunk_offset = find_next_chunk(fs_info);
5041 alloc_profile = btrfs_get_alloc_profile(extent_root, 0);
5042 ret = __btrfs_alloc_chunk(trans, extent_root, chunk_offset,
5047 sys_chunk_offset = find_next_chunk(root->fs_info);
5048 alloc_profile = btrfs_get_alloc_profile(fs_info->chunk_root, 0);
5049 ret = __btrfs_alloc_chunk(trans, extent_root, sys_chunk_offset,
5054 static inline int btrfs_chunk_max_errors(struct map_lookup *map)
5058 if (map->type & (BTRFS_BLOCK_GROUP_RAID1 |
5059 BTRFS_BLOCK_GROUP_RAID10 |
5060 BTRFS_BLOCK_GROUP_RAID5 |
5061 BTRFS_BLOCK_GROUP_DUP)) {
5063 } else if (map->type & BTRFS_BLOCK_GROUP_RAID6) {
5072 int btrfs_chunk_readonly(struct btrfs_root *root, u64 chunk_offset)
5074 struct extent_map *em;
5075 struct map_lookup *map;
5076 struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
5081 read_lock(&map_tree->map_tree.lock);
5082 em = lookup_extent_mapping(&map_tree->map_tree, chunk_offset, 1);
5083 read_unlock(&map_tree->map_tree.lock);
5087 map = em->map_lookup;
5088 for (i = 0; i < map->num_stripes; i++) {
5089 if (map->stripes[i].dev->missing) {
5094 if (!map->stripes[i].dev->writeable) {
5101 * If the number of missing devices is larger than max errors,
5102 * we can not write the data into that chunk successfully, so
5105 if (miss_ndevs > btrfs_chunk_max_errors(map))
5108 free_extent_map(em);
5112 void btrfs_mapping_init(struct btrfs_mapping_tree *tree)
5114 extent_map_tree_init(&tree->map_tree);
5117 void btrfs_mapping_tree_free(struct btrfs_mapping_tree *tree)
5119 struct extent_map *em;
5122 write_lock(&tree->map_tree.lock);
5123 em = lookup_extent_mapping(&tree->map_tree, 0, (u64)-1);
5125 remove_extent_mapping(&tree->map_tree, em);
5126 write_unlock(&tree->map_tree.lock);
5130 free_extent_map(em);
5131 /* once for the tree */
5132 free_extent_map(em);
5136 int btrfs_num_copies(struct btrfs_fs_info *fs_info, u64 logical, u64 len)
5138 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
5139 struct extent_map *em;
5140 struct map_lookup *map;
5141 struct extent_map_tree *em_tree = &map_tree->map_tree;
5144 read_lock(&em_tree->lock);
5145 em = lookup_extent_mapping(em_tree, logical, len);
5146 read_unlock(&em_tree->lock);
5149 * We could return errors for these cases, but that could get ugly and
5150 * we'd probably do the same thing which is just not do anything else
5151 * and exit, so return 1 so the callers don't try to use other copies.
5154 btrfs_crit(fs_info, "No mapping for %Lu-%Lu", logical,
5159 if (em->start > logical || em->start + em->len < logical) {
5160 btrfs_crit(fs_info, "Invalid mapping for %Lu-%Lu, got %Lu-%Lu",
5161 logical, logical+len, em->start,
5162 em->start + em->len);
5163 free_extent_map(em);
5167 map = em->map_lookup;
5168 if (map->type & (BTRFS_BLOCK_GROUP_DUP | BTRFS_BLOCK_GROUP_RAID1))
5169 ret = map->num_stripes;
5170 else if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5171 ret = map->sub_stripes;
5172 else if (map->type & BTRFS_BLOCK_GROUP_RAID5)
5174 else if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5178 free_extent_map(em);
5180 btrfs_dev_replace_lock(&fs_info->dev_replace, 0);
5181 if (btrfs_dev_replace_is_ongoing(&fs_info->dev_replace))
5183 btrfs_dev_replace_unlock(&fs_info->dev_replace, 0);
5188 unsigned long btrfs_full_stripe_len(struct btrfs_root *root,
5189 struct btrfs_mapping_tree *map_tree,
5192 struct extent_map *em;
5193 struct map_lookup *map;
5194 struct extent_map_tree *em_tree = &map_tree->map_tree;
5195 unsigned long len = root->fs_info->sectorsize;
5197 read_lock(&em_tree->lock);
5198 em = lookup_extent_mapping(em_tree, logical, len);
5199 read_unlock(&em_tree->lock);
5202 BUG_ON(em->start > logical || em->start + em->len < logical);
5203 map = em->map_lookup;
5204 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5205 len = map->stripe_len * nr_data_stripes(map);
5206 free_extent_map(em);
5210 int btrfs_is_parity_mirror(struct btrfs_mapping_tree *map_tree,
5211 u64 logical, u64 len, int mirror_num)
5213 struct extent_map *em;
5214 struct map_lookup *map;
5215 struct extent_map_tree *em_tree = &map_tree->map_tree;
5218 read_lock(&em_tree->lock);
5219 em = lookup_extent_mapping(em_tree, logical, len);
5220 read_unlock(&em_tree->lock);
5223 BUG_ON(em->start > logical || em->start + em->len < logical);
5224 map = em->map_lookup;
5225 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK)
5227 free_extent_map(em);
5231 static int find_live_mirror(struct btrfs_fs_info *fs_info,
5232 struct map_lookup *map, int first, int num,
5233 int optimal, int dev_replace_is_ongoing)
5237 struct btrfs_device *srcdev;
5239 if (dev_replace_is_ongoing &&
5240 fs_info->dev_replace.cont_reading_from_srcdev_mode ==
5241 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID)
5242 srcdev = fs_info->dev_replace.srcdev;
5247 * try to avoid the drive that is the source drive for a
5248 * dev-replace procedure, only choose it if no other non-missing
5249 * mirror is available
5251 for (tolerance = 0; tolerance < 2; tolerance++) {
5252 if (map->stripes[optimal].dev->bdev &&
5253 (tolerance || map->stripes[optimal].dev != srcdev))
5255 for (i = first; i < first + num; i++) {
5256 if (map->stripes[i].dev->bdev &&
5257 (tolerance || map->stripes[i].dev != srcdev))
5262 /* we couldn't find one that doesn't fail. Just return something
5263 * and the io error handling code will clean up eventually
5268 static inline int parity_smaller(u64 a, u64 b)
5273 /* Bubble-sort the stripe set to put the parity/syndrome stripes last */
5274 static void sort_parity_stripes(struct btrfs_bio *bbio, int num_stripes)
5276 struct btrfs_bio_stripe s;
5283 for (i = 0; i < num_stripes - 1; i++) {
5284 if (parity_smaller(bbio->raid_map[i],
5285 bbio->raid_map[i+1])) {
5286 s = bbio->stripes[i];
5287 l = bbio->raid_map[i];
5288 bbio->stripes[i] = bbio->stripes[i+1];
5289 bbio->raid_map[i] = bbio->raid_map[i+1];
5290 bbio->stripes[i+1] = s;
5291 bbio->raid_map[i+1] = l;
5299 static struct btrfs_bio *alloc_btrfs_bio(int total_stripes, int real_stripes)
5301 struct btrfs_bio *bbio = kzalloc(
5302 /* the size of the btrfs_bio */
5303 sizeof(struct btrfs_bio) +
5304 /* plus the variable array for the stripes */
5305 sizeof(struct btrfs_bio_stripe) * (total_stripes) +
5306 /* plus the variable array for the tgt dev */
5307 sizeof(int) * (real_stripes) +
5309 * plus the raid_map, which includes both the tgt dev
5312 sizeof(u64) * (total_stripes),
5313 GFP_NOFS|__GFP_NOFAIL);
5315 atomic_set(&bbio->error, 0);
5316 atomic_set(&bbio->refs, 1);
5321 void btrfs_get_bbio(struct btrfs_bio *bbio)
5323 WARN_ON(!atomic_read(&bbio->refs));
5324 atomic_inc(&bbio->refs);
5327 void btrfs_put_bbio(struct btrfs_bio *bbio)
5331 if (atomic_dec_and_test(&bbio->refs))
5335 static int __btrfs_map_block(struct btrfs_fs_info *fs_info,
5336 enum btrfs_map_op op,
5337 u64 logical, u64 *length,
5338 struct btrfs_bio **bbio_ret,
5339 int mirror_num, int need_raid_map)
5341 struct extent_map *em;
5342 struct map_lookup *map;
5343 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
5344 struct extent_map_tree *em_tree = &map_tree->map_tree;
5347 u64 stripe_end_offset;
5357 int tgtdev_indexes = 0;
5358 struct btrfs_bio *bbio = NULL;
5359 struct btrfs_dev_replace *dev_replace = &fs_info->dev_replace;
5360 int dev_replace_is_ongoing = 0;
5361 int num_alloc_stripes;
5362 int patch_the_first_stripe_for_dev_replace = 0;
5363 u64 physical_to_patch_in_first_stripe = 0;
5364 u64 raid56_full_stripe_start = (u64)-1;
5366 read_lock(&em_tree->lock);
5367 em = lookup_extent_mapping(em_tree, logical, *length);
5368 read_unlock(&em_tree->lock);
5371 btrfs_crit(fs_info, "unable to find logical %llu len %llu",
5376 if (em->start > logical || em->start + em->len < logical) {
5378 "found a bad mapping, wanted %Lu, found %Lu-%Lu",
5379 logical, em->start, em->start + em->len);
5380 free_extent_map(em);
5384 map = em->map_lookup;
5385 offset = logical - em->start;
5387 stripe_len = map->stripe_len;
5390 * stripe_nr counts the total number of stripes we have to stride
5391 * to get to this block
5393 stripe_nr = div64_u64(stripe_nr, stripe_len);
5395 stripe_offset = stripe_nr * stripe_len;
5396 if (offset < stripe_offset) {
5398 "stripe math has gone wrong, stripe_offset=%llu, offset=%llu, start=%llu, logical=%llu, stripe_len=%llu",
5399 stripe_offset, offset, em->start, logical,
5401 free_extent_map(em);
5405 /* stripe_offset is the offset of this block in its stripe*/
5406 stripe_offset = offset - stripe_offset;
5408 /* if we're here for raid56, we need to know the stripe aligned start */
5409 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5410 unsigned long full_stripe_len = stripe_len * nr_data_stripes(map);
5411 raid56_full_stripe_start = offset;
5413 /* allow a write of a full stripe, but make sure we don't
5414 * allow straddling of stripes
5416 raid56_full_stripe_start = div64_u64(raid56_full_stripe_start,
5418 raid56_full_stripe_start *= full_stripe_len;
5421 if (op == BTRFS_MAP_DISCARD) {
5422 /* we don't discard raid56 yet */
5423 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5427 *length = min_t(u64, em->len - offset, *length);
5428 } else if (map->type & BTRFS_BLOCK_GROUP_PROFILE_MASK) {
5430 /* For writes to RAID[56], allow a full stripeset across all disks.
5431 For other RAID types and for RAID[56] reads, just allow a single
5432 stripe (on a single disk). */
5433 if ((map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) &&
5434 (op == BTRFS_MAP_WRITE)) {
5435 max_len = stripe_len * nr_data_stripes(map) -
5436 (offset - raid56_full_stripe_start);
5438 /* we limit the length of each bio to what fits in a stripe */
5439 max_len = stripe_len - stripe_offset;
5441 *length = min_t(u64, em->len - offset, max_len);
5443 *length = em->len - offset;
5446 /* This is for when we're called from btrfs_merge_bio_hook() and all
5447 it cares about is the length */
5451 btrfs_dev_replace_lock(dev_replace, 0);
5452 dev_replace_is_ongoing = btrfs_dev_replace_is_ongoing(dev_replace);
5453 if (!dev_replace_is_ongoing)
5454 btrfs_dev_replace_unlock(dev_replace, 0);
5456 btrfs_dev_replace_set_lock_blocking(dev_replace);
5458 if (dev_replace_is_ongoing && mirror_num == map->num_stripes + 1 &&
5459 op != BTRFS_MAP_WRITE && op != BTRFS_MAP_DISCARD &&
5460 op != BTRFS_MAP_GET_READ_MIRRORS && dev_replace->tgtdev != NULL) {
5462 * in dev-replace case, for repair case (that's the only
5463 * case where the mirror is selected explicitly when
5464 * calling btrfs_map_block), blocks left of the left cursor
5465 * can also be read from the target drive.
5466 * For REQ_GET_READ_MIRRORS, the target drive is added as
5467 * the last one to the array of stripes. For READ, it also
5468 * needs to be supported using the same mirror number.
5469 * If the requested block is not left of the left cursor,
5470 * EIO is returned. This can happen because btrfs_num_copies()
5471 * returns one more in the dev-replace case.
5473 u64 tmp_length = *length;
5474 struct btrfs_bio *tmp_bbio = NULL;
5475 int tmp_num_stripes;
5476 u64 srcdev_devid = dev_replace->srcdev->devid;
5477 int index_srcdev = 0;
5479 u64 physical_of_found = 0;
5481 ret = __btrfs_map_block(fs_info, BTRFS_MAP_GET_READ_MIRRORS,
5482 logical, &tmp_length, &tmp_bbio, 0, 0);
5484 WARN_ON(tmp_bbio != NULL);
5488 tmp_num_stripes = tmp_bbio->num_stripes;
5489 if (mirror_num > tmp_num_stripes) {
5491 * BTRFS_MAP_GET_READ_MIRRORS does not contain this
5492 * mirror, that means that the requested area
5493 * is not left of the left cursor
5496 btrfs_put_bbio(tmp_bbio);
5501 * process the rest of the function using the mirror_num
5502 * of the source drive. Therefore look it up first.
5503 * At the end, patch the device pointer to the one of the
5506 for (i = 0; i < tmp_num_stripes; i++) {
5507 if (tmp_bbio->stripes[i].dev->devid != srcdev_devid)
5511 * In case of DUP, in order to keep it simple, only add
5512 * the mirror with the lowest physical address
5515 physical_of_found <= tmp_bbio->stripes[i].physical)
5520 physical_of_found = tmp_bbio->stripes[i].physical;
5523 btrfs_put_bbio(tmp_bbio);
5531 mirror_num = index_srcdev + 1;
5532 patch_the_first_stripe_for_dev_replace = 1;
5533 physical_to_patch_in_first_stripe = physical_of_found;
5534 } else if (mirror_num > map->num_stripes) {
5540 stripe_nr_orig = stripe_nr;
5541 stripe_nr_end = ALIGN(offset + *length, map->stripe_len);
5542 stripe_nr_end = div_u64(stripe_nr_end, map->stripe_len);
5543 stripe_end_offset = stripe_nr_end * map->stripe_len -
5546 if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
5547 if (op == BTRFS_MAP_DISCARD)
5548 num_stripes = min_t(u64, map->num_stripes,
5549 stripe_nr_end - stripe_nr_orig);
5550 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5552 if (op != BTRFS_MAP_WRITE && op != BTRFS_MAP_DISCARD &&
5553 op != BTRFS_MAP_GET_READ_MIRRORS)
5555 } else if (map->type & BTRFS_BLOCK_GROUP_RAID1) {
5556 if (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_DISCARD ||
5557 op == BTRFS_MAP_GET_READ_MIRRORS)
5558 num_stripes = map->num_stripes;
5559 else if (mirror_num)
5560 stripe_index = mirror_num - 1;
5562 stripe_index = find_live_mirror(fs_info, map, 0,
5564 current->pid % map->num_stripes,
5565 dev_replace_is_ongoing);
5566 mirror_num = stripe_index + 1;
5569 } else if (map->type & BTRFS_BLOCK_GROUP_DUP) {
5570 if (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_DISCARD ||
5571 op == BTRFS_MAP_GET_READ_MIRRORS) {
5572 num_stripes = map->num_stripes;
5573 } else if (mirror_num) {
5574 stripe_index = mirror_num - 1;
5579 } else if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
5580 u32 factor = map->num_stripes / map->sub_stripes;
5582 stripe_nr = div_u64_rem(stripe_nr, factor, &stripe_index);
5583 stripe_index *= map->sub_stripes;
5585 if (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS)
5586 num_stripes = map->sub_stripes;
5587 else if (op == BTRFS_MAP_DISCARD)
5588 num_stripes = min_t(u64, map->sub_stripes *
5589 (stripe_nr_end - stripe_nr_orig),
5591 else if (mirror_num)
5592 stripe_index += mirror_num - 1;
5594 int old_stripe_index = stripe_index;
5595 stripe_index = find_live_mirror(fs_info, map,
5597 map->sub_stripes, stripe_index +
5598 current->pid % map->sub_stripes,
5599 dev_replace_is_ongoing);
5600 mirror_num = stripe_index - old_stripe_index + 1;
5603 } else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5604 if (need_raid_map &&
5605 (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS ||
5607 /* push stripe_nr back to the start of the full stripe */
5608 stripe_nr = div_u64(raid56_full_stripe_start,
5609 stripe_len * nr_data_stripes(map));
5611 /* RAID[56] write or recovery. Return all stripes */
5612 num_stripes = map->num_stripes;
5613 max_errors = nr_parity_stripes(map);
5615 *length = map->stripe_len;
5620 * Mirror #0 or #1 means the original data block.
5621 * Mirror #2 is RAID5 parity block.
5622 * Mirror #3 is RAID6 Q block.
5624 stripe_nr = div_u64_rem(stripe_nr,
5625 nr_data_stripes(map), &stripe_index);
5627 stripe_index = nr_data_stripes(map) +
5630 /* We distribute the parity blocks across stripes */
5631 div_u64_rem(stripe_nr + stripe_index, map->num_stripes,
5633 if ((op != BTRFS_MAP_WRITE && op != BTRFS_MAP_DISCARD &&
5634 op != BTRFS_MAP_GET_READ_MIRRORS) && mirror_num <= 1)
5639 * after this, stripe_nr is the number of stripes on this
5640 * device we have to walk to find the data, and stripe_index is
5641 * the number of our device in the stripe array
5643 stripe_nr = div_u64_rem(stripe_nr, map->num_stripes,
5645 mirror_num = stripe_index + 1;
5647 if (stripe_index >= map->num_stripes) {
5649 "stripe index math went horribly wrong, got stripe_index=%u, num_stripes=%u",
5650 stripe_index, map->num_stripes);
5655 num_alloc_stripes = num_stripes;
5656 if (dev_replace_is_ongoing) {
5657 if (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_DISCARD)
5658 num_alloc_stripes <<= 1;
5659 if (op == BTRFS_MAP_GET_READ_MIRRORS)
5660 num_alloc_stripes++;
5661 tgtdev_indexes = num_stripes;
5664 bbio = alloc_btrfs_bio(num_alloc_stripes, tgtdev_indexes);
5669 if (dev_replace_is_ongoing)
5670 bbio->tgtdev_map = (int *)(bbio->stripes + num_alloc_stripes);
5672 /* build raid_map */
5673 if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK &&
5675 ((op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS) ||
5680 bbio->raid_map = (u64 *)((void *)bbio->stripes +
5681 sizeof(struct btrfs_bio_stripe) *
5683 sizeof(int) * tgtdev_indexes);
5685 /* Work out the disk rotation on this stripe-set */
5686 div_u64_rem(stripe_nr, num_stripes, &rot);
5688 /* Fill in the logical address of each stripe */
5689 tmp = stripe_nr * nr_data_stripes(map);
5690 for (i = 0; i < nr_data_stripes(map); i++)
5691 bbio->raid_map[(i+rot) % num_stripes] =
5692 em->start + (tmp + i) * map->stripe_len;
5694 bbio->raid_map[(i+rot) % map->num_stripes] = RAID5_P_STRIPE;
5695 if (map->type & BTRFS_BLOCK_GROUP_RAID6)
5696 bbio->raid_map[(i+rot+1) % num_stripes] =
5700 if (op == BTRFS_MAP_DISCARD) {
5702 u32 sub_stripes = 0;
5703 u64 stripes_per_dev = 0;
5704 u32 remaining_stripes = 0;
5705 u32 last_stripe = 0;
5708 (BTRFS_BLOCK_GROUP_RAID0 | BTRFS_BLOCK_GROUP_RAID10)) {
5709 if (map->type & BTRFS_BLOCK_GROUP_RAID0)
5712 sub_stripes = map->sub_stripes;
5714 factor = map->num_stripes / sub_stripes;
5715 stripes_per_dev = div_u64_rem(stripe_nr_end -
5718 &remaining_stripes);
5719 div_u64_rem(stripe_nr_end - 1, factor, &last_stripe);
5720 last_stripe *= sub_stripes;
5723 for (i = 0; i < num_stripes; i++) {
5724 bbio->stripes[i].physical =
5725 map->stripes[stripe_index].physical +
5726 stripe_offset + stripe_nr * map->stripe_len;
5727 bbio->stripes[i].dev = map->stripes[stripe_index].dev;
5729 if (map->type & (BTRFS_BLOCK_GROUP_RAID0 |
5730 BTRFS_BLOCK_GROUP_RAID10)) {
5731 bbio->stripes[i].length = stripes_per_dev *
5734 if (i / sub_stripes < remaining_stripes)
5735 bbio->stripes[i].length +=
5739 * Special for the first stripe and
5742 * |-------|...|-------|
5746 if (i < sub_stripes)
5747 bbio->stripes[i].length -=
5750 if (stripe_index >= last_stripe &&
5751 stripe_index <= (last_stripe +
5753 bbio->stripes[i].length -=
5756 if (i == sub_stripes - 1)
5759 bbio->stripes[i].length = *length;
5762 if (stripe_index == map->num_stripes) {
5763 /* This could only happen for RAID0/10 */
5769 for (i = 0; i < num_stripes; i++) {
5770 bbio->stripes[i].physical =
5771 map->stripes[stripe_index].physical +
5773 stripe_nr * map->stripe_len;
5774 bbio->stripes[i].dev =
5775 map->stripes[stripe_index].dev;
5780 if (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_GET_READ_MIRRORS)
5781 max_errors = btrfs_chunk_max_errors(map);
5784 sort_parity_stripes(bbio, num_stripes);
5787 if (dev_replace_is_ongoing &&
5788 (op == BTRFS_MAP_WRITE || op == BTRFS_MAP_DISCARD) &&
5789 dev_replace->tgtdev != NULL) {
5790 int index_where_to_add;
5791 u64 srcdev_devid = dev_replace->srcdev->devid;
5794 * duplicate the write operations while the dev replace
5795 * procedure is running. Since the copying of the old disk
5796 * to the new disk takes place at run time while the
5797 * filesystem is mounted writable, the regular write
5798 * operations to the old disk have to be duplicated to go
5799 * to the new disk as well.
5800 * Note that device->missing is handled by the caller, and
5801 * that the write to the old disk is already set up in the
5804 index_where_to_add = num_stripes;
5805 for (i = 0; i < num_stripes; i++) {
5806 if (bbio->stripes[i].dev->devid == srcdev_devid) {
5807 /* write to new disk, too */
5808 struct btrfs_bio_stripe *new =
5809 bbio->stripes + index_where_to_add;
5810 struct btrfs_bio_stripe *old =
5813 new->physical = old->physical;
5814 new->length = old->length;
5815 new->dev = dev_replace->tgtdev;
5816 bbio->tgtdev_map[i] = index_where_to_add;
5817 index_where_to_add++;
5822 num_stripes = index_where_to_add;
5823 } else if (dev_replace_is_ongoing &&
5824 op == BTRFS_MAP_GET_READ_MIRRORS &&
5825 dev_replace->tgtdev != NULL) {
5826 u64 srcdev_devid = dev_replace->srcdev->devid;
5827 int index_srcdev = 0;
5829 u64 physical_of_found = 0;
5832 * During the dev-replace procedure, the target drive can
5833 * also be used to read data in case it is needed to repair
5834 * a corrupt block elsewhere. This is possible if the
5835 * requested area is left of the left cursor. In this area,
5836 * the target drive is a full copy of the source drive.
5838 for (i = 0; i < num_stripes; i++) {
5839 if (bbio->stripes[i].dev->devid == srcdev_devid) {
5841 * In case of DUP, in order to keep it
5842 * simple, only add the mirror with the
5843 * lowest physical address
5846 physical_of_found <=
5847 bbio->stripes[i].physical)
5851 physical_of_found = bbio->stripes[i].physical;
5855 struct btrfs_bio_stripe *tgtdev_stripe =
5856 bbio->stripes + num_stripes;
5858 tgtdev_stripe->physical = physical_of_found;
5859 tgtdev_stripe->length =
5860 bbio->stripes[index_srcdev].length;
5861 tgtdev_stripe->dev = dev_replace->tgtdev;
5862 bbio->tgtdev_map[index_srcdev] = num_stripes;
5870 bbio->map_type = map->type;
5871 bbio->num_stripes = num_stripes;
5872 bbio->max_errors = max_errors;
5873 bbio->mirror_num = mirror_num;
5874 bbio->num_tgtdevs = tgtdev_indexes;
5877 * this is the case that REQ_READ && dev_replace_is_ongoing &&
5878 * mirror_num == num_stripes + 1 && dev_replace target drive is
5879 * available as a mirror
5881 if (patch_the_first_stripe_for_dev_replace && num_stripes > 0) {
5882 WARN_ON(num_stripes > 1);
5883 bbio->stripes[0].dev = dev_replace->tgtdev;
5884 bbio->stripes[0].physical = physical_to_patch_in_first_stripe;
5885 bbio->mirror_num = map->num_stripes + 1;
5888 if (dev_replace_is_ongoing) {
5889 btrfs_dev_replace_clear_lock_blocking(dev_replace);
5890 btrfs_dev_replace_unlock(dev_replace, 0);
5892 free_extent_map(em);
5896 int btrfs_map_block(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
5897 u64 logical, u64 *length,
5898 struct btrfs_bio **bbio_ret, int mirror_num)
5900 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret,
5904 /* For Scrub/replace */
5905 int btrfs_map_sblock(struct btrfs_fs_info *fs_info, enum btrfs_map_op op,
5906 u64 logical, u64 *length,
5907 struct btrfs_bio **bbio_ret, int mirror_num,
5910 return __btrfs_map_block(fs_info, op, logical, length, bbio_ret,
5911 mirror_num, need_raid_map);
5914 int btrfs_rmap_block(struct btrfs_fs_info *fs_info,
5915 u64 chunk_start, u64 physical, u64 devid,
5916 u64 **logical, int *naddrs, int *stripe_len)
5918 struct btrfs_mapping_tree *map_tree = &fs_info->mapping_tree;
5919 struct extent_map_tree *em_tree = &map_tree->map_tree;
5920 struct extent_map *em;
5921 struct map_lookup *map;
5929 read_lock(&em_tree->lock);
5930 em = lookup_extent_mapping(em_tree, chunk_start, 1);
5931 read_unlock(&em_tree->lock);
5934 btrfs_err(fs_info, "couldn't find em for chunk %Lu",
5939 if (em->start != chunk_start) {
5940 btrfs_err(fs_info, "bad chunk start, em=%Lu, wanted=%Lu",
5941 em->start, chunk_start);
5942 free_extent_map(em);
5945 map = em->map_lookup;
5948 rmap_len = map->stripe_len;
5950 if (map->type & BTRFS_BLOCK_GROUP_RAID10)
5951 length = div_u64(length, map->num_stripes / map->sub_stripes);
5952 else if (map->type & BTRFS_BLOCK_GROUP_RAID0)
5953 length = div_u64(length, map->num_stripes);
5954 else if (map->type & BTRFS_BLOCK_GROUP_RAID56_MASK) {
5955 length = div_u64(length, nr_data_stripes(map));
5956 rmap_len = map->stripe_len * nr_data_stripes(map);
5959 buf = kcalloc(map->num_stripes, sizeof(u64), GFP_NOFS);
5960 BUG_ON(!buf); /* -ENOMEM */
5962 for (i = 0; i < map->num_stripes; i++) {
5963 if (devid && map->stripes[i].dev->devid != devid)
5965 if (map->stripes[i].physical > physical ||
5966 map->stripes[i].physical + length <= physical)
5969 stripe_nr = physical - map->stripes[i].physical;
5970 stripe_nr = div_u64(stripe_nr, map->stripe_len);
5972 if (map->type & BTRFS_BLOCK_GROUP_RAID10) {
5973 stripe_nr = stripe_nr * map->num_stripes + i;
5974 stripe_nr = div_u64(stripe_nr, map->sub_stripes);
5975 } else if (map->type & BTRFS_BLOCK_GROUP_RAID0) {
5976 stripe_nr = stripe_nr * map->num_stripes + i;
5977 } /* else if RAID[56], multiply by nr_data_stripes().
5978 * Alternatively, just use rmap_len below instead of
5979 * map->stripe_len */
5981 bytenr = chunk_start + stripe_nr * rmap_len;
5982 WARN_ON(nr >= map->num_stripes);
5983 for (j = 0; j < nr; j++) {
5984 if (buf[j] == bytenr)
5988 WARN_ON(nr >= map->num_stripes);
5995 *stripe_len = rmap_len;
5997 free_extent_map(em);
6001 static inline void btrfs_end_bbio(struct btrfs_bio *bbio, struct bio *bio)
6003 bio->bi_private = bbio->private;
6004 bio->bi_end_io = bbio->end_io;
6007 btrfs_put_bbio(bbio);
6010 static void btrfs_end_bio(struct bio *bio)
6012 struct btrfs_bio *bbio = bio->bi_private;
6013 int is_orig_bio = 0;
6015 if (bio->bi_error) {
6016 atomic_inc(&bbio->error);
6017 if (bio->bi_error == -EIO || bio->bi_error == -EREMOTEIO) {
6018 unsigned int stripe_index =
6019 btrfs_io_bio(bio)->stripe_index;
6020 struct btrfs_device *dev;
6022 BUG_ON(stripe_index >= bbio->num_stripes);
6023 dev = bbio->stripes[stripe_index].dev;
6025 if (bio_op(bio) == REQ_OP_WRITE)
6026 btrfs_dev_stat_inc(dev,
6027 BTRFS_DEV_STAT_WRITE_ERRS);
6029 btrfs_dev_stat_inc(dev,
6030 BTRFS_DEV_STAT_READ_ERRS);
6031 if ((bio->bi_opf & WRITE_FLUSH) == WRITE_FLUSH)
6032 btrfs_dev_stat_inc(dev,
6033 BTRFS_DEV_STAT_FLUSH_ERRS);
6034 btrfs_dev_stat_print_on_error(dev);
6039 if (bio == bbio->orig_bio)
6042 btrfs_bio_counter_dec(bbio->fs_info);
6044 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6047 bio = bbio->orig_bio;
6050 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6051 /* only send an error to the higher layers if it is
6052 * beyond the tolerance of the btrfs bio
6054 if (atomic_read(&bbio->error) > bbio->max_errors) {
6055 bio->bi_error = -EIO;
6058 * this bio is actually up to date, we didn't
6059 * go over the max number of errors
6064 btrfs_end_bbio(bbio, bio);
6065 } else if (!is_orig_bio) {
6071 * see run_scheduled_bios for a description of why bios are collected for
6074 * This will add one bio to the pending list for a device and make sure
6075 * the work struct is scheduled.
6077 static noinline void btrfs_schedule_bio(struct btrfs_root *root,
6078 struct btrfs_device *device,
6081 int should_queue = 1;
6082 struct btrfs_pending_bios *pending_bios;
6084 if (device->missing || !device->bdev) {
6089 /* don't bother with additional async steps for reads, right now */
6090 if (bio_op(bio) == REQ_OP_READ) {
6092 btrfsic_submit_bio(bio);
6098 * nr_async_bios allows us to reliably return congestion to the
6099 * higher layers. Otherwise, the async bio makes it appear we have
6100 * made progress against dirty pages when we've really just put it
6101 * on a queue for later
6103 atomic_inc(&root->fs_info->nr_async_bios);
6104 WARN_ON(bio->bi_next);
6105 bio->bi_next = NULL;
6107 spin_lock(&device->io_lock);
6108 if (bio->bi_opf & REQ_SYNC)
6109 pending_bios = &device->pending_sync_bios;
6111 pending_bios = &device->pending_bios;
6113 if (pending_bios->tail)
6114 pending_bios->tail->bi_next = bio;
6116 pending_bios->tail = bio;
6117 if (!pending_bios->head)
6118 pending_bios->head = bio;
6119 if (device->running_pending)
6122 spin_unlock(&device->io_lock);
6125 btrfs_queue_work(root->fs_info->submit_workers,
6129 static void submit_stripe_bio(struct btrfs_root *root, struct btrfs_bio *bbio,
6130 struct bio *bio, u64 physical, int dev_nr,
6133 struct btrfs_device *dev = bbio->stripes[dev_nr].dev;
6135 bio->bi_private = bbio;
6136 btrfs_io_bio(bio)->stripe_index = dev_nr;
6137 bio->bi_end_io = btrfs_end_bio;
6138 bio->bi_iter.bi_sector = physical >> 9;
6141 struct rcu_string *name;
6144 name = rcu_dereference(dev->name);
6145 btrfs_debug(fs_info,
6146 "btrfs_map_bio: rw %d 0x%x, sector=%llu, dev=%lu (%s id %llu), size=%u",
6147 bio_op(bio), bio->bi_opf,
6148 (u64)bio->bi_iter.bi_sector,
6149 (u_long)dev->bdev->bd_dev, name->str, dev->devid,
6150 bio->bi_iter.bi_size);
6154 bio->bi_bdev = dev->bdev;
6156 btrfs_bio_counter_inc_noblocked(root->fs_info);
6159 btrfs_schedule_bio(root, dev, bio);
6161 btrfsic_submit_bio(bio);
6164 static void bbio_error(struct btrfs_bio *bbio, struct bio *bio, u64 logical)
6166 atomic_inc(&bbio->error);
6167 if (atomic_dec_and_test(&bbio->stripes_pending)) {
6168 /* Should be the original bio. */
6169 WARN_ON(bio != bbio->orig_bio);
6171 btrfs_io_bio(bio)->mirror_num = bbio->mirror_num;
6172 bio->bi_iter.bi_sector = logical >> 9;
6173 bio->bi_error = -EIO;
6174 btrfs_end_bbio(bbio, bio);
6178 int btrfs_map_bio(struct btrfs_root *root, struct bio *bio,
6179 int mirror_num, int async_submit)
6181 struct btrfs_device *dev;
6182 struct bio *first_bio = bio;
6183 u64 logical = (u64)bio->bi_iter.bi_sector << 9;
6189 struct btrfs_bio *bbio = NULL;
6191 length = bio->bi_iter.bi_size;
6192 map_length = length;
6194 btrfs_bio_counter_inc_blocked(root->fs_info);
6195 ret = __btrfs_map_block(root->fs_info, bio_op(bio), logical,
6196 &map_length, &bbio, mirror_num, 1);
6198 btrfs_bio_counter_dec(root->fs_info);
6202 total_devs = bbio->num_stripes;
6203 bbio->orig_bio = first_bio;
6204 bbio->private = first_bio->bi_private;
6205 bbio->end_io = first_bio->bi_end_io;
6206 bbio->fs_info = root->fs_info;
6207 atomic_set(&bbio->stripes_pending, bbio->num_stripes);
6209 if ((bbio->map_type & BTRFS_BLOCK_GROUP_RAID56_MASK) &&
6210 ((bio_op(bio) == REQ_OP_WRITE) || (mirror_num > 1))) {
6211 /* In this case, map_length has been set to the length of
6212 a single stripe; not the whole write */
6213 if (bio_op(bio) == REQ_OP_WRITE) {
6214 ret = raid56_parity_write(root, bio, bbio, map_length);
6216 ret = raid56_parity_recover(root, bio, bbio, map_length,
6220 btrfs_bio_counter_dec(root->fs_info);
6224 if (map_length < length) {
6225 btrfs_crit(root->fs_info,
6226 "mapping failed logical %llu bio len %llu len %llu",
6227 logical, length, map_length);
6231 for (dev_nr = 0; dev_nr < total_devs; dev_nr++) {
6232 dev = bbio->stripes[dev_nr].dev;
6233 if (!dev || !dev->bdev ||
6234 (bio_op(bio) == REQ_OP_WRITE && !dev->writeable)) {
6235 bbio_error(bbio, first_bio, logical);
6239 if (dev_nr < total_devs - 1) {
6240 bio = btrfs_bio_clone(first_bio, GFP_NOFS);
6241 BUG_ON(!bio); /* -ENOMEM */
6245 submit_stripe_bio(root, bbio, bio,
6246 bbio->stripes[dev_nr].physical, dev_nr,
6249 btrfs_bio_counter_dec(root->fs_info);
6253 struct btrfs_device *btrfs_find_device(struct btrfs_fs_info *fs_info, u64 devid,
6256 struct btrfs_device *device;
6257 struct btrfs_fs_devices *cur_devices;
6259 cur_devices = fs_info->fs_devices;
6260 while (cur_devices) {
6262 !memcmp(cur_devices->fsid, fsid, BTRFS_UUID_SIZE)) {
6263 device = __find_device(&cur_devices->devices,
6268 cur_devices = cur_devices->seed;
6273 static struct btrfs_device *add_missing_dev(struct btrfs_root *root,
6274 struct btrfs_fs_devices *fs_devices,
6275 u64 devid, u8 *dev_uuid)
6277 struct btrfs_device *device;
6279 device = btrfs_alloc_device(NULL, &devid, dev_uuid);
6283 list_add(&device->dev_list, &fs_devices->devices);
6284 device->fs_devices = fs_devices;
6285 fs_devices->num_devices++;
6287 device->missing = 1;
6288 fs_devices->missing_devices++;
6294 * btrfs_alloc_device - allocate struct btrfs_device
6295 * @fs_info: used only for generating a new devid, can be NULL if
6296 * devid is provided (i.e. @devid != NULL).
6297 * @devid: a pointer to devid for this device. If NULL a new devid
6299 * @uuid: a pointer to UUID for this device. If NULL a new UUID
6302 * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR()
6303 * on error. Returned struct is not linked onto any lists and can be
6304 * destroyed with kfree() right away.
6306 struct btrfs_device *btrfs_alloc_device(struct btrfs_fs_info *fs_info,
6310 struct btrfs_device *dev;
6313 if (WARN_ON(!devid && !fs_info))
6314 return ERR_PTR(-EINVAL);
6316 dev = __alloc_device();
6325 ret = find_next_devid(fs_info, &tmp);
6328 return ERR_PTR(ret);
6334 memcpy(dev->uuid, uuid, BTRFS_UUID_SIZE);
6336 generate_random_uuid(dev->uuid);
6338 btrfs_init_work(&dev->work, btrfs_submit_helper,
6339 pending_bios_fn, NULL, NULL);
6344 /* Return -EIO if any error, otherwise return 0. */
6345 static int btrfs_check_chunk_valid(struct btrfs_root *root,
6346 struct extent_buffer *leaf,
6347 struct btrfs_chunk *chunk, u64 logical)
6355 length = btrfs_chunk_length(leaf, chunk);
6356 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
6357 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6358 sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
6359 type = btrfs_chunk_type(leaf, chunk);
6362 btrfs_err(root->fs_info, "invalid chunk num_stripes: %u",
6366 if (!IS_ALIGNED(logical, root->fs_info->sectorsize)) {
6367 btrfs_err(root->fs_info,
6368 "invalid chunk logical %llu", logical);
6371 if (btrfs_chunk_sector_size(leaf, chunk) != root->fs_info->sectorsize) {
6372 btrfs_err(root->fs_info, "invalid chunk sectorsize %u",
6373 btrfs_chunk_sector_size(leaf, chunk));
6376 if (!length || !IS_ALIGNED(length, root->fs_info->sectorsize)) {
6377 btrfs_err(root->fs_info,
6378 "invalid chunk length %llu", length);
6381 if (!is_power_of_2(stripe_len) || stripe_len != BTRFS_STRIPE_LEN) {
6382 btrfs_err(root->fs_info, "invalid chunk stripe length: %llu",
6386 if (~(BTRFS_BLOCK_GROUP_TYPE_MASK | BTRFS_BLOCK_GROUP_PROFILE_MASK) &
6388 btrfs_err(root->fs_info, "unrecognized chunk type: %llu",
6389 ~(BTRFS_BLOCK_GROUP_TYPE_MASK |
6390 BTRFS_BLOCK_GROUP_PROFILE_MASK) &
6391 btrfs_chunk_type(leaf, chunk));
6394 if ((type & BTRFS_BLOCK_GROUP_RAID10 && sub_stripes != 2) ||
6395 (type & BTRFS_BLOCK_GROUP_RAID1 && num_stripes < 1) ||
6396 (type & BTRFS_BLOCK_GROUP_RAID5 && num_stripes < 2) ||
6397 (type & BTRFS_BLOCK_GROUP_RAID6 && num_stripes < 3) ||
6398 (type & BTRFS_BLOCK_GROUP_DUP && num_stripes > 2) ||
6399 ((type & BTRFS_BLOCK_GROUP_PROFILE_MASK) == 0 &&
6400 num_stripes != 1)) {
6401 btrfs_err(root->fs_info,
6402 "invalid num_stripes:sub_stripes %u:%u for profile %llu",
6403 num_stripes, sub_stripes,
6404 type & BTRFS_BLOCK_GROUP_PROFILE_MASK);
6411 static int read_one_chunk(struct btrfs_root *root, struct btrfs_key *key,
6412 struct extent_buffer *leaf,
6413 struct btrfs_chunk *chunk)
6415 struct btrfs_mapping_tree *map_tree = &root->fs_info->mapping_tree;
6416 struct map_lookup *map;
6417 struct extent_map *em;
6422 u8 uuid[BTRFS_UUID_SIZE];
6427 logical = key->offset;
6428 length = btrfs_chunk_length(leaf, chunk);
6429 stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
6430 num_stripes = btrfs_chunk_num_stripes(leaf, chunk);
6432 ret = btrfs_check_chunk_valid(root, leaf, chunk, logical);
6436 read_lock(&map_tree->map_tree.lock);
6437 em = lookup_extent_mapping(&map_tree->map_tree, logical, 1);
6438 read_unlock(&map_tree->map_tree.lock);
6440 /* already mapped? */
6441 if (em && em->start <= logical && em->start + em->len > logical) {
6442 free_extent_map(em);
6445 free_extent_map(em);
6448 em = alloc_extent_map();
6451 map = kmalloc(map_lookup_size(num_stripes), GFP_NOFS);
6453 free_extent_map(em);
6457 set_bit(EXTENT_FLAG_FS_MAPPING, &em->flags);
6458 em->map_lookup = map;
6459 em->start = logical;
6462 em->block_start = 0;
6463 em->block_len = em->len;
6465 map->num_stripes = num_stripes;
6466 map->io_width = btrfs_chunk_io_width(leaf, chunk);
6467 map->io_align = btrfs_chunk_io_align(leaf, chunk);
6468 map->sector_size = btrfs_chunk_sector_size(leaf, chunk);
6469 map->stripe_len = btrfs_chunk_stripe_len(leaf, chunk);
6470 map->type = btrfs_chunk_type(leaf, chunk);
6471 map->sub_stripes = btrfs_chunk_sub_stripes(leaf, chunk);
6472 for (i = 0; i < num_stripes; i++) {
6473 map->stripes[i].physical =
6474 btrfs_stripe_offset_nr(leaf, chunk, i);
6475 devid = btrfs_stripe_devid_nr(leaf, chunk, i);
6476 read_extent_buffer(leaf, uuid, (unsigned long)
6477 btrfs_stripe_dev_uuid_nr(chunk, i),
6479 map->stripes[i].dev = btrfs_find_device(root->fs_info, devid,
6481 if (!map->stripes[i].dev &&
6482 !btrfs_test_opt(root->fs_info, DEGRADED)) {
6483 free_extent_map(em);
6486 if (!map->stripes[i].dev) {
6487 map->stripes[i].dev =
6488 add_missing_dev(root, root->fs_info->fs_devices,
6490 if (!map->stripes[i].dev) {
6491 free_extent_map(em);
6494 btrfs_warn(root->fs_info,
6495 "devid %llu uuid %pU is missing",
6498 map->stripes[i].dev->in_fs_metadata = 1;
6501 write_lock(&map_tree->map_tree.lock);
6502 ret = add_extent_mapping(&map_tree->map_tree, em, 0);
6503 write_unlock(&map_tree->map_tree.lock);
6504 BUG_ON(ret); /* Tree corruption */
6505 free_extent_map(em);
6510 static void fill_device_from_item(struct extent_buffer *leaf,
6511 struct btrfs_dev_item *dev_item,
6512 struct btrfs_device *device)
6516 device->devid = btrfs_device_id(leaf, dev_item);
6517 device->disk_total_bytes = btrfs_device_total_bytes(leaf, dev_item);
6518 device->total_bytes = device->disk_total_bytes;
6519 device->commit_total_bytes = device->disk_total_bytes;
6520 device->bytes_used = btrfs_device_bytes_used(leaf, dev_item);
6521 device->commit_bytes_used = device->bytes_used;
6522 device->type = btrfs_device_type(leaf, dev_item);
6523 device->io_align = btrfs_device_io_align(leaf, dev_item);
6524 device->io_width = btrfs_device_io_width(leaf, dev_item);
6525 device->sector_size = btrfs_device_sector_size(leaf, dev_item);
6526 WARN_ON(device->devid == BTRFS_DEV_REPLACE_DEVID);
6527 device->is_tgtdev_for_dev_replace = 0;
6529 ptr = btrfs_device_uuid(dev_item);
6530 read_extent_buffer(leaf, device->uuid, ptr, BTRFS_UUID_SIZE);
6533 static struct btrfs_fs_devices *open_seed_devices(struct btrfs_root *root,
6536 struct btrfs_fs_devices *fs_devices;
6539 BUG_ON(!mutex_is_locked(&uuid_mutex));
6541 fs_devices = root->fs_info->fs_devices->seed;
6542 while (fs_devices) {
6543 if (!memcmp(fs_devices->fsid, fsid, BTRFS_UUID_SIZE))
6546 fs_devices = fs_devices->seed;
6549 fs_devices = find_fsid(fsid);
6551 if (!btrfs_test_opt(root->fs_info, DEGRADED))
6552 return ERR_PTR(-ENOENT);
6554 fs_devices = alloc_fs_devices(fsid);
6555 if (IS_ERR(fs_devices))
6558 fs_devices->seeding = 1;
6559 fs_devices->opened = 1;
6563 fs_devices = clone_fs_devices(fs_devices);
6564 if (IS_ERR(fs_devices))
6567 ret = __btrfs_open_devices(fs_devices, FMODE_READ,
6568 root->fs_info->bdev_holder);
6570 free_fs_devices(fs_devices);
6571 fs_devices = ERR_PTR(ret);
6575 if (!fs_devices->seeding) {
6576 __btrfs_close_devices(fs_devices);
6577 free_fs_devices(fs_devices);
6578 fs_devices = ERR_PTR(-EINVAL);
6582 fs_devices->seed = root->fs_info->fs_devices->seed;
6583 root->fs_info->fs_devices->seed = fs_devices;
6588 static int read_one_dev(struct btrfs_root *root,
6589 struct extent_buffer *leaf,
6590 struct btrfs_dev_item *dev_item)
6592 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
6593 struct btrfs_device *device;
6596 u8 fs_uuid[BTRFS_UUID_SIZE];
6597 u8 dev_uuid[BTRFS_UUID_SIZE];
6599 devid = btrfs_device_id(leaf, dev_item);
6600 read_extent_buffer(leaf, dev_uuid, btrfs_device_uuid(dev_item),
6602 read_extent_buffer(leaf, fs_uuid, btrfs_device_fsid(dev_item),
6605 if (memcmp(fs_uuid, root->fs_info->fsid, BTRFS_UUID_SIZE)) {
6606 fs_devices = open_seed_devices(root, fs_uuid);
6607 if (IS_ERR(fs_devices))
6608 return PTR_ERR(fs_devices);
6611 device = btrfs_find_device(root->fs_info, devid, dev_uuid, fs_uuid);
6613 if (!btrfs_test_opt(root->fs_info, DEGRADED))
6616 device = add_missing_dev(root, fs_devices, devid, dev_uuid);
6619 btrfs_warn(root->fs_info, "devid %llu uuid %pU missing",
6622 if (!device->bdev && !btrfs_test_opt(root->fs_info, DEGRADED))
6625 if(!device->bdev && !device->missing) {
6627 * this happens when a device that was properly setup
6628 * in the device info lists suddenly goes bad.
6629 * device->bdev is NULL, and so we have to set
6630 * device->missing to one here
6632 device->fs_devices->missing_devices++;
6633 device->missing = 1;
6636 /* Move the device to its own fs_devices */
6637 if (device->fs_devices != fs_devices) {
6638 ASSERT(device->missing);
6640 list_move(&device->dev_list, &fs_devices->devices);
6641 device->fs_devices->num_devices--;
6642 fs_devices->num_devices++;
6644 device->fs_devices->missing_devices--;
6645 fs_devices->missing_devices++;
6647 device->fs_devices = fs_devices;
6651 if (device->fs_devices != root->fs_info->fs_devices) {
6652 BUG_ON(device->writeable);
6653 if (device->generation !=
6654 btrfs_device_generation(leaf, dev_item))
6658 fill_device_from_item(leaf, dev_item, device);
6659 device->in_fs_metadata = 1;
6660 if (device->writeable && !device->is_tgtdev_for_dev_replace) {
6661 device->fs_devices->total_rw_bytes += device->total_bytes;
6662 spin_lock(&root->fs_info->free_chunk_lock);
6663 root->fs_info->free_chunk_space += device->total_bytes -
6665 spin_unlock(&root->fs_info->free_chunk_lock);
6671 int btrfs_read_sys_array(struct btrfs_fs_info *fs_info)
6673 struct btrfs_root *root = fs_info->tree_root;
6674 struct btrfs_super_block *super_copy = fs_info->super_copy;
6675 struct extent_buffer *sb;
6676 struct btrfs_disk_key *disk_key;
6677 struct btrfs_chunk *chunk;
6679 unsigned long sb_array_offset;
6686 struct btrfs_key key;
6688 ASSERT(BTRFS_SUPER_INFO_SIZE <= root->fs_info->nodesize);
6690 * This will create extent buffer of nodesize, superblock size is
6691 * fixed to BTRFS_SUPER_INFO_SIZE. If nodesize > sb size, this will
6692 * overallocate but we can keep it as-is, only the first page is used.
6694 sb = btrfs_find_create_tree_block(root, BTRFS_SUPER_INFO_OFFSET);
6697 set_extent_buffer_uptodate(sb);
6698 btrfs_set_buffer_lockdep_class(root->root_key.objectid, sb, 0);
6700 * The sb extent buffer is artificial and just used to read the system array.
6701 * set_extent_buffer_uptodate() call does not properly mark all it's
6702 * pages up-to-date when the page is larger: extent does not cover the
6703 * whole page and consequently check_page_uptodate does not find all
6704 * the page's extents up-to-date (the hole beyond sb),
6705 * write_extent_buffer then triggers a WARN_ON.
6707 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
6708 * but sb spans only this function. Add an explicit SetPageUptodate call
6709 * to silence the warning eg. on PowerPC 64.
6711 if (PAGE_SIZE > BTRFS_SUPER_INFO_SIZE)
6712 SetPageUptodate(sb->pages[0]);
6714 write_extent_buffer(sb, super_copy, 0, BTRFS_SUPER_INFO_SIZE);
6715 array_size = btrfs_super_sys_array_size(super_copy);
6717 array_ptr = super_copy->sys_chunk_array;
6718 sb_array_offset = offsetof(struct btrfs_super_block, sys_chunk_array);
6721 while (cur_offset < array_size) {
6722 disk_key = (struct btrfs_disk_key *)array_ptr;
6723 len = sizeof(*disk_key);
6724 if (cur_offset + len > array_size)
6725 goto out_short_read;
6727 btrfs_disk_key_to_cpu(&key, disk_key);
6730 sb_array_offset += len;
6733 if (key.type == BTRFS_CHUNK_ITEM_KEY) {
6734 chunk = (struct btrfs_chunk *)sb_array_offset;
6736 * At least one btrfs_chunk with one stripe must be
6737 * present, exact stripe count check comes afterwards
6739 len = btrfs_chunk_item_size(1);
6740 if (cur_offset + len > array_size)
6741 goto out_short_read;
6743 num_stripes = btrfs_chunk_num_stripes(sb, chunk);
6746 "invalid number of stripes %u in sys_array at offset %u",
6747 num_stripes, cur_offset);
6752 type = btrfs_chunk_type(sb, chunk);
6753 if ((type & BTRFS_BLOCK_GROUP_SYSTEM) == 0) {
6755 "invalid chunk type %llu in sys_array at offset %u",
6761 len = btrfs_chunk_item_size(num_stripes);
6762 if (cur_offset + len > array_size)
6763 goto out_short_read;
6765 ret = read_one_chunk(root, &key, sb, chunk);
6770 "unexpected item type %u in sys_array at offset %u",
6771 (u32)key.type, cur_offset);
6776 sb_array_offset += len;
6779 clear_extent_buffer_uptodate(sb);
6780 free_extent_buffer_stale(sb);
6784 btrfs_err(fs_info, "sys_array too short to read %u bytes at offset %u",
6786 clear_extent_buffer_uptodate(sb);
6787 free_extent_buffer_stale(sb);
6791 int btrfs_read_chunk_tree(struct btrfs_fs_info *fs_info)
6793 struct btrfs_root *root = fs_info->chunk_root;
6794 struct btrfs_path *path;
6795 struct extent_buffer *leaf;
6796 struct btrfs_key key;
6797 struct btrfs_key found_key;
6802 path = btrfs_alloc_path();
6806 mutex_lock(&uuid_mutex);
6810 * Read all device items, and then all the chunk items. All
6811 * device items are found before any chunk item (their object id
6812 * is smaller than the lowest possible object id for a chunk
6813 * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID).
6815 key.objectid = BTRFS_DEV_ITEMS_OBJECTID;
6818 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0);
6822 leaf = path->nodes[0];
6823 slot = path->slots[0];
6824 if (slot >= btrfs_header_nritems(leaf)) {
6825 ret = btrfs_next_leaf(root, path);
6832 btrfs_item_key_to_cpu(leaf, &found_key, slot);
6833 if (found_key.type == BTRFS_DEV_ITEM_KEY) {
6834 struct btrfs_dev_item *dev_item;
6835 dev_item = btrfs_item_ptr(leaf, slot,
6836 struct btrfs_dev_item);
6837 ret = read_one_dev(root, leaf, dev_item);
6841 } else if (found_key.type == BTRFS_CHUNK_ITEM_KEY) {
6842 struct btrfs_chunk *chunk;
6843 chunk = btrfs_item_ptr(leaf, slot, struct btrfs_chunk);
6844 ret = read_one_chunk(root, &found_key, leaf, chunk);
6852 * After loading chunk tree, we've got all device information,
6853 * do another round of validation checks.
6855 if (total_dev != root->fs_info->fs_devices->total_devices) {
6856 btrfs_err(root->fs_info,
6857 "super_num_devices %llu mismatch with num_devices %llu found here",
6858 btrfs_super_num_devices(root->fs_info->super_copy),
6863 if (btrfs_super_total_bytes(root->fs_info->super_copy) <
6864 root->fs_info->fs_devices->total_rw_bytes) {
6865 btrfs_err(root->fs_info,
6866 "super_total_bytes %llu mismatch with fs_devices total_rw_bytes %llu",
6867 btrfs_super_total_bytes(root->fs_info->super_copy),
6868 root->fs_info->fs_devices->total_rw_bytes);
6874 unlock_chunks(root);
6875 mutex_unlock(&uuid_mutex);
6877 btrfs_free_path(path);
6881 void btrfs_init_devices_late(struct btrfs_fs_info *fs_info)
6883 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
6884 struct btrfs_device *device;
6886 while (fs_devices) {
6887 mutex_lock(&fs_devices->device_list_mutex);
6888 list_for_each_entry(device, &fs_devices->devices, dev_list)
6889 device->fs_info = fs_info;
6890 mutex_unlock(&fs_devices->device_list_mutex);
6892 fs_devices = fs_devices->seed;
6896 static void __btrfs_reset_dev_stats(struct btrfs_device *dev)
6900 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
6901 btrfs_dev_stat_reset(dev, i);
6904 int btrfs_init_dev_stats(struct btrfs_fs_info *fs_info)
6906 struct btrfs_key key;
6907 struct btrfs_key found_key;
6908 struct btrfs_root *dev_root = fs_info->dev_root;
6909 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
6910 struct extent_buffer *eb;
6913 struct btrfs_device *device;
6914 struct btrfs_path *path = NULL;
6917 path = btrfs_alloc_path();
6923 mutex_lock(&fs_devices->device_list_mutex);
6924 list_for_each_entry(device, &fs_devices->devices, dev_list) {
6926 struct btrfs_dev_stats_item *ptr;
6928 key.objectid = BTRFS_DEV_STATS_OBJECTID;
6929 key.type = BTRFS_PERSISTENT_ITEM_KEY;
6930 key.offset = device->devid;
6931 ret = btrfs_search_slot(NULL, dev_root, &key, path, 0, 0);
6933 __btrfs_reset_dev_stats(device);
6934 device->dev_stats_valid = 1;
6935 btrfs_release_path(path);
6938 slot = path->slots[0];
6939 eb = path->nodes[0];
6940 btrfs_item_key_to_cpu(eb, &found_key, slot);
6941 item_size = btrfs_item_size_nr(eb, slot);
6943 ptr = btrfs_item_ptr(eb, slot,
6944 struct btrfs_dev_stats_item);
6946 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
6947 if (item_size >= (1 + i) * sizeof(__le64))
6948 btrfs_dev_stat_set(device, i,
6949 btrfs_dev_stats_value(eb, ptr, i));
6951 btrfs_dev_stat_reset(device, i);
6954 device->dev_stats_valid = 1;
6955 btrfs_dev_stat_print_on_load(device);
6956 btrfs_release_path(path);
6958 mutex_unlock(&fs_devices->device_list_mutex);
6961 btrfs_free_path(path);
6962 return ret < 0 ? ret : 0;
6965 static int update_dev_stat_item(struct btrfs_trans_handle *trans,
6966 struct btrfs_fs_info *fs_info,
6967 struct btrfs_device *device)
6969 struct btrfs_root *dev_root = fs_info->dev_root;
6970 struct btrfs_path *path;
6971 struct btrfs_key key;
6972 struct extent_buffer *eb;
6973 struct btrfs_dev_stats_item *ptr;
6977 key.objectid = BTRFS_DEV_STATS_OBJECTID;
6978 key.type = BTRFS_PERSISTENT_ITEM_KEY;
6979 key.offset = device->devid;
6981 path = btrfs_alloc_path();
6983 ret = btrfs_search_slot(trans, dev_root, &key, path, -1, 1);
6985 btrfs_warn_in_rcu(dev_root->fs_info,
6986 "error %d while searching for dev_stats item for device %s",
6987 ret, rcu_str_deref(device->name));
6992 btrfs_item_size_nr(path->nodes[0], path->slots[0]) < sizeof(*ptr)) {
6993 /* need to delete old one and insert a new one */
6994 ret = btrfs_del_item(trans, dev_root, path);
6996 btrfs_warn_in_rcu(dev_root->fs_info,
6997 "delete too small dev_stats item for device %s failed %d",
6998 rcu_str_deref(device->name), ret);
7005 /* need to insert a new item */
7006 btrfs_release_path(path);
7007 ret = btrfs_insert_empty_item(trans, dev_root, path,
7008 &key, sizeof(*ptr));
7010 btrfs_warn_in_rcu(dev_root->fs_info,
7011 "insert dev_stats item for device %s failed %d",
7012 rcu_str_deref(device->name), ret);
7017 eb = path->nodes[0];
7018 ptr = btrfs_item_ptr(eb, path->slots[0], struct btrfs_dev_stats_item);
7019 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7020 btrfs_set_dev_stats_value(eb, ptr, i,
7021 btrfs_dev_stat_read(device, i));
7022 btrfs_mark_buffer_dirty(eb);
7025 btrfs_free_path(path);
7030 * called from commit_transaction. Writes all changed device stats to disk.
7032 int btrfs_run_dev_stats(struct btrfs_trans_handle *trans,
7033 struct btrfs_fs_info *fs_info)
7035 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7036 struct btrfs_device *device;
7040 mutex_lock(&fs_devices->device_list_mutex);
7041 list_for_each_entry(device, &fs_devices->devices, dev_list) {
7042 if (!device->dev_stats_valid || !btrfs_dev_stats_dirty(device))
7045 stats_cnt = atomic_read(&device->dev_stats_ccnt);
7046 ret = update_dev_stat_item(trans, fs_info, device);
7048 atomic_sub(stats_cnt, &device->dev_stats_ccnt);
7050 mutex_unlock(&fs_devices->device_list_mutex);
7055 void btrfs_dev_stat_inc_and_print(struct btrfs_device *dev, int index)
7057 btrfs_dev_stat_inc(dev, index);
7058 btrfs_dev_stat_print_on_error(dev);
7061 static void btrfs_dev_stat_print_on_error(struct btrfs_device *dev)
7063 if (!dev->dev_stats_valid)
7065 btrfs_err_rl_in_rcu(dev->fs_info,
7066 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7067 rcu_str_deref(dev->name),
7068 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7069 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7070 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7071 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7072 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7075 static void btrfs_dev_stat_print_on_load(struct btrfs_device *dev)
7079 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7080 if (btrfs_dev_stat_read(dev, i) != 0)
7082 if (i == BTRFS_DEV_STAT_VALUES_MAX)
7083 return; /* all values == 0, suppress message */
7085 btrfs_info_in_rcu(dev->fs_info,
7086 "bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u",
7087 rcu_str_deref(dev->name),
7088 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_WRITE_ERRS),
7089 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_READ_ERRS),
7090 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_FLUSH_ERRS),
7091 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_CORRUPTION_ERRS),
7092 btrfs_dev_stat_read(dev, BTRFS_DEV_STAT_GENERATION_ERRS));
7095 int btrfs_get_dev_stats(struct btrfs_root *root,
7096 struct btrfs_ioctl_get_dev_stats *stats)
7098 struct btrfs_device *dev;
7099 struct btrfs_fs_devices *fs_devices = root->fs_info->fs_devices;
7102 mutex_lock(&fs_devices->device_list_mutex);
7103 dev = btrfs_find_device(root->fs_info, stats->devid, NULL, NULL);
7104 mutex_unlock(&fs_devices->device_list_mutex);
7107 btrfs_warn(root->fs_info,
7108 "get dev_stats failed, device not found");
7110 } else if (!dev->dev_stats_valid) {
7111 btrfs_warn(root->fs_info,
7112 "get dev_stats failed, not yet valid");
7114 } else if (stats->flags & BTRFS_DEV_STATS_RESET) {
7115 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++) {
7116 if (stats->nr_items > i)
7118 btrfs_dev_stat_read_and_reset(dev, i);
7120 btrfs_dev_stat_reset(dev, i);
7123 for (i = 0; i < BTRFS_DEV_STAT_VALUES_MAX; i++)
7124 if (stats->nr_items > i)
7125 stats->values[i] = btrfs_dev_stat_read(dev, i);
7127 if (stats->nr_items > BTRFS_DEV_STAT_VALUES_MAX)
7128 stats->nr_items = BTRFS_DEV_STAT_VALUES_MAX;
7132 void btrfs_scratch_superblocks(struct block_device *bdev, char *device_path)
7134 struct buffer_head *bh;
7135 struct btrfs_super_block *disk_super;
7141 for (copy_num = 0; copy_num < BTRFS_SUPER_MIRROR_MAX;
7144 if (btrfs_read_dev_one_super(bdev, copy_num, &bh))
7147 disk_super = (struct btrfs_super_block *)bh->b_data;
7149 memset(&disk_super->magic, 0, sizeof(disk_super->magic));
7150 set_buffer_dirty(bh);
7151 sync_dirty_buffer(bh);
7155 /* Notify udev that device has changed */
7156 btrfs_kobject_uevent(bdev, KOBJ_CHANGE);
7158 /* Update ctime/mtime for device path for libblkid */
7159 update_dev_time(device_path);
7163 * Update the size of all devices, which is used for writing out the
7166 void btrfs_update_commit_device_size(struct btrfs_fs_info *fs_info)
7168 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7169 struct btrfs_device *curr, *next;
7171 if (list_empty(&fs_devices->resized_devices))
7174 mutex_lock(&fs_devices->device_list_mutex);
7175 lock_chunks(fs_info->dev_root);
7176 list_for_each_entry_safe(curr, next, &fs_devices->resized_devices,
7178 list_del_init(&curr->resized_list);
7179 curr->commit_total_bytes = curr->disk_total_bytes;
7181 unlock_chunks(fs_info->dev_root);
7182 mutex_unlock(&fs_devices->device_list_mutex);
7185 /* Must be invoked during the transaction commit */
7186 void btrfs_update_commit_device_bytes_used(struct btrfs_root *root,
7187 struct btrfs_transaction *transaction)
7189 struct extent_map *em;
7190 struct map_lookup *map;
7191 struct btrfs_device *dev;
7194 if (list_empty(&transaction->pending_chunks))
7197 /* In order to kick the device replace finish process */
7199 list_for_each_entry(em, &transaction->pending_chunks, list) {
7200 map = em->map_lookup;
7202 for (i = 0; i < map->num_stripes; i++) {
7203 dev = map->stripes[i].dev;
7204 dev->commit_bytes_used = dev->bytes_used;
7207 unlock_chunks(root);
7210 void btrfs_set_fs_info_ptr(struct btrfs_fs_info *fs_info)
7212 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7213 while (fs_devices) {
7214 fs_devices->fs_info = fs_info;
7215 fs_devices = fs_devices->seed;
7219 void btrfs_reset_fs_info_ptr(struct btrfs_fs_info *fs_info)
7221 struct btrfs_fs_devices *fs_devices = fs_info->fs_devices;
7222 while (fs_devices) {
7223 fs_devices->fs_info = NULL;
7224 fs_devices = fs_devices->seed;