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/random.h>
24 #include <linux/iocontext.h>
25 #include <linux/capability.h>
26 #include <linux/ratelimit.h>
27 #include <linux/kthread.h>
28 #include <linux/raid/pq.h>
29 #include <linux/semaphore.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"
44 static int init_first_rw_device(struct btrfs_trans_handle
*trans
,
45 struct btrfs_root
*root
,
46 struct btrfs_device
*device
);
47 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
);
48 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
);
49 static void btrfs_dev_stat_print_on_error(struct btrfs_device
*dev
);
50 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*device
);
52 static DEFINE_MUTEX(uuid_mutex
);
53 static LIST_HEAD(fs_uuids
);
55 static void lock_chunks(struct btrfs_root
*root
)
57 mutex_lock(&root
->fs_info
->chunk_mutex
);
60 static void unlock_chunks(struct btrfs_root
*root
)
62 mutex_unlock(&root
->fs_info
->chunk_mutex
);
65 static struct btrfs_fs_devices
*__alloc_fs_devices(void)
67 struct btrfs_fs_devices
*fs_devs
;
69 fs_devs
= kzalloc(sizeof(*fs_devs
), GFP_NOFS
);
71 return ERR_PTR(-ENOMEM
);
73 mutex_init(&fs_devs
->device_list_mutex
);
75 INIT_LIST_HEAD(&fs_devs
->devices
);
76 INIT_LIST_HEAD(&fs_devs
->alloc_list
);
77 INIT_LIST_HEAD(&fs_devs
->list
);
83 * alloc_fs_devices - allocate struct btrfs_fs_devices
84 * @fsid: a pointer to UUID for this FS. If NULL a new UUID is
87 * Return: a pointer to a new &struct btrfs_fs_devices on success;
88 * ERR_PTR() on error. Returned struct is not linked onto any lists and
89 * can be destroyed with kfree() right away.
91 static struct btrfs_fs_devices
*alloc_fs_devices(const u8
*fsid
)
93 struct btrfs_fs_devices
*fs_devs
;
95 fs_devs
= __alloc_fs_devices();
100 memcpy(fs_devs
->fsid
, fsid
, BTRFS_FSID_SIZE
);
102 generate_random_uuid(fs_devs
->fsid
);
107 static void free_fs_devices(struct btrfs_fs_devices
*fs_devices
)
109 struct btrfs_device
*device
;
110 WARN_ON(fs_devices
->opened
);
111 while (!list_empty(&fs_devices
->devices
)) {
112 device
= list_entry(fs_devices
->devices
.next
,
113 struct btrfs_device
, dev_list
);
114 list_del(&device
->dev_list
);
115 rcu_string_free(device
->name
);
121 static void btrfs_kobject_uevent(struct block_device
*bdev
,
122 enum kobject_action action
)
126 ret
= kobject_uevent(&disk_to_dev(bdev
->bd_disk
)->kobj
, action
);
128 pr_warn("Sending event '%d' to kobject: '%s' (%p): failed\n",
130 kobject_name(&disk_to_dev(bdev
->bd_disk
)->kobj
),
131 &disk_to_dev(bdev
->bd_disk
)->kobj
);
134 void btrfs_cleanup_fs_uuids(void)
136 struct btrfs_fs_devices
*fs_devices
;
138 while (!list_empty(&fs_uuids
)) {
139 fs_devices
= list_entry(fs_uuids
.next
,
140 struct btrfs_fs_devices
, list
);
141 list_del(&fs_devices
->list
);
142 free_fs_devices(fs_devices
);
146 static struct btrfs_device
*__alloc_device(void)
148 struct btrfs_device
*dev
;
150 dev
= kzalloc(sizeof(*dev
), GFP_NOFS
);
152 return ERR_PTR(-ENOMEM
);
154 INIT_LIST_HEAD(&dev
->dev_list
);
155 INIT_LIST_HEAD(&dev
->dev_alloc_list
);
157 spin_lock_init(&dev
->io_lock
);
159 spin_lock_init(&dev
->reada_lock
);
160 atomic_set(&dev
->reada_in_flight
, 0);
161 INIT_RADIX_TREE(&dev
->reada_zones
, GFP_NOFS
& ~__GFP_WAIT
);
162 INIT_RADIX_TREE(&dev
->reada_extents
, GFP_NOFS
& ~__GFP_WAIT
);
167 static noinline
struct btrfs_device
*__find_device(struct list_head
*head
,
170 struct btrfs_device
*dev
;
172 list_for_each_entry(dev
, head
, dev_list
) {
173 if (dev
->devid
== devid
&&
174 (!uuid
|| !memcmp(dev
->uuid
, uuid
, BTRFS_UUID_SIZE
))) {
181 static noinline
struct btrfs_fs_devices
*find_fsid(u8
*fsid
)
183 struct btrfs_fs_devices
*fs_devices
;
185 list_for_each_entry(fs_devices
, &fs_uuids
, list
) {
186 if (memcmp(fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
) == 0)
193 btrfs_get_bdev_and_sb(const char *device_path
, fmode_t flags
, void *holder
,
194 int flush
, struct block_device
**bdev
,
195 struct buffer_head
**bh
)
199 *bdev
= blkdev_get_by_path(device_path
, flags
, holder
);
202 ret
= PTR_ERR(*bdev
);
203 printk(KERN_INFO
"btrfs: open %s failed\n", device_path
);
208 filemap_write_and_wait((*bdev
)->bd_inode
->i_mapping
);
209 ret
= set_blocksize(*bdev
, 4096);
211 blkdev_put(*bdev
, flags
);
214 invalidate_bdev(*bdev
);
215 *bh
= btrfs_read_dev_super(*bdev
);
218 blkdev_put(*bdev
, flags
);
230 static void requeue_list(struct btrfs_pending_bios
*pending_bios
,
231 struct bio
*head
, struct bio
*tail
)
234 struct bio
*old_head
;
236 old_head
= pending_bios
->head
;
237 pending_bios
->head
= head
;
238 if (pending_bios
->tail
)
239 tail
->bi_next
= old_head
;
241 pending_bios
->tail
= tail
;
245 * we try to collect pending bios for a device so we don't get a large
246 * number of procs sending bios down to the same device. This greatly
247 * improves the schedulers ability to collect and merge the bios.
249 * But, it also turns into a long list of bios to process and that is sure
250 * to eventually make the worker thread block. The solution here is to
251 * make some progress and then put this work struct back at the end of
252 * the list if the block device is congested. This way, multiple devices
253 * can make progress from a single worker thread.
255 static noinline
void run_scheduled_bios(struct btrfs_device
*device
)
258 struct backing_dev_info
*bdi
;
259 struct btrfs_fs_info
*fs_info
;
260 struct btrfs_pending_bios
*pending_bios
;
264 unsigned long num_run
;
265 unsigned long batch_run
= 0;
267 unsigned long last_waited
= 0;
269 int sync_pending
= 0;
270 struct blk_plug plug
;
273 * this function runs all the bios we've collected for
274 * a particular device. We don't want to wander off to
275 * another device without first sending all of these down.
276 * So, setup a plug here and finish it off before we return
278 blk_start_plug(&plug
);
280 bdi
= blk_get_backing_dev_info(device
->bdev
);
281 fs_info
= device
->dev_root
->fs_info
;
282 limit
= btrfs_async_submit_limit(fs_info
);
283 limit
= limit
* 2 / 3;
286 spin_lock(&device
->io_lock
);
291 /* take all the bios off the list at once and process them
292 * later on (without the lock held). But, remember the
293 * tail and other pointers so the bios can be properly reinserted
294 * into the list if we hit congestion
296 if (!force_reg
&& device
->pending_sync_bios
.head
) {
297 pending_bios
= &device
->pending_sync_bios
;
300 pending_bios
= &device
->pending_bios
;
304 pending
= pending_bios
->head
;
305 tail
= pending_bios
->tail
;
306 WARN_ON(pending
&& !tail
);
309 * if pending was null this time around, no bios need processing
310 * at all and we can stop. Otherwise it'll loop back up again
311 * and do an additional check so no bios are missed.
313 * device->running_pending is used to synchronize with the
316 if (device
->pending_sync_bios
.head
== NULL
&&
317 device
->pending_bios
.head
== NULL
) {
319 device
->running_pending
= 0;
322 device
->running_pending
= 1;
325 pending_bios
->head
= NULL
;
326 pending_bios
->tail
= NULL
;
328 spin_unlock(&device
->io_lock
);
333 /* we want to work on both lists, but do more bios on the
334 * sync list than the regular list
337 pending_bios
!= &device
->pending_sync_bios
&&
338 device
->pending_sync_bios
.head
) ||
339 (num_run
> 64 && pending_bios
== &device
->pending_sync_bios
&&
340 device
->pending_bios
.head
)) {
341 spin_lock(&device
->io_lock
);
342 requeue_list(pending_bios
, pending
, tail
);
347 pending
= pending
->bi_next
;
350 if (atomic_dec_return(&fs_info
->nr_async_bios
) < limit
&&
351 waitqueue_active(&fs_info
->async_submit_wait
))
352 wake_up(&fs_info
->async_submit_wait
);
354 BUG_ON(atomic_read(&cur
->bi_cnt
) == 0);
357 * if we're doing the sync list, record that our
358 * plug has some sync requests on it
360 * If we're doing the regular list and there are
361 * sync requests sitting around, unplug before
364 if (pending_bios
== &device
->pending_sync_bios
) {
366 } else if (sync_pending
) {
367 blk_finish_plug(&plug
);
368 blk_start_plug(&plug
);
372 btrfsic_submit_bio(cur
->bi_rw
, cur
);
379 * we made progress, there is more work to do and the bdi
380 * is now congested. Back off and let other work structs
383 if (pending
&& bdi_write_congested(bdi
) && batch_run
> 8 &&
384 fs_info
->fs_devices
->open_devices
> 1) {
385 struct io_context
*ioc
;
387 ioc
= current
->io_context
;
390 * the main goal here is that we don't want to
391 * block if we're going to be able to submit
392 * more requests without blocking.
394 * This code does two great things, it pokes into
395 * the elevator code from a filesystem _and_
396 * it makes assumptions about how batching works.
398 if (ioc
&& ioc
->nr_batch_requests
> 0 &&
399 time_before(jiffies
, ioc
->last_waited
+ HZ
/50UL) &&
401 ioc
->last_waited
== last_waited
)) {
403 * we want to go through our batch of
404 * requests and stop. So, we copy out
405 * the ioc->last_waited time and test
406 * against it before looping
408 last_waited
= ioc
->last_waited
;
413 spin_lock(&device
->io_lock
);
414 requeue_list(pending_bios
, pending
, tail
);
415 device
->running_pending
= 1;
417 spin_unlock(&device
->io_lock
);
418 btrfs_requeue_work(&device
->work
);
421 /* unplug every 64 requests just for good measure */
422 if (batch_run
% 64 == 0) {
423 blk_finish_plug(&plug
);
424 blk_start_plug(&plug
);
433 spin_lock(&device
->io_lock
);
434 if (device
->pending_bios
.head
|| device
->pending_sync_bios
.head
)
436 spin_unlock(&device
->io_lock
);
439 blk_finish_plug(&plug
);
442 static void pending_bios_fn(struct btrfs_work
*work
)
444 struct btrfs_device
*device
;
446 device
= container_of(work
, struct btrfs_device
, work
);
447 run_scheduled_bios(device
);
450 static noinline
int device_list_add(const char *path
,
451 struct btrfs_super_block
*disk_super
,
452 u64 devid
, struct btrfs_fs_devices
**fs_devices_ret
)
454 struct btrfs_device
*device
;
455 struct btrfs_fs_devices
*fs_devices
;
456 struct rcu_string
*name
;
457 u64 found_transid
= btrfs_super_generation(disk_super
);
459 fs_devices
= find_fsid(disk_super
->fsid
);
461 fs_devices
= alloc_fs_devices(disk_super
->fsid
);
462 if (IS_ERR(fs_devices
))
463 return PTR_ERR(fs_devices
);
465 list_add(&fs_devices
->list
, &fs_uuids
);
466 fs_devices
->latest_devid
= devid
;
467 fs_devices
->latest_trans
= found_transid
;
471 device
= __find_device(&fs_devices
->devices
, devid
,
472 disk_super
->dev_item
.uuid
);
475 if (fs_devices
->opened
)
478 device
= btrfs_alloc_device(NULL
, &devid
,
479 disk_super
->dev_item
.uuid
);
480 if (IS_ERR(device
)) {
481 /* we can safely leave the fs_devices entry around */
482 return PTR_ERR(device
);
485 name
= rcu_string_strdup(path
, GFP_NOFS
);
490 rcu_assign_pointer(device
->name
, name
);
492 mutex_lock(&fs_devices
->device_list_mutex
);
493 list_add_rcu(&device
->dev_list
, &fs_devices
->devices
);
494 fs_devices
->num_devices
++;
495 mutex_unlock(&fs_devices
->device_list_mutex
);
497 device
->fs_devices
= fs_devices
;
498 } else if (!device
->name
|| strcmp(device
->name
->str
, path
)) {
499 name
= rcu_string_strdup(path
, GFP_NOFS
);
502 rcu_string_free(device
->name
);
503 rcu_assign_pointer(device
->name
, name
);
504 if (device
->missing
) {
505 fs_devices
->missing_devices
--;
510 if (found_transid
> fs_devices
->latest_trans
) {
511 fs_devices
->latest_devid
= devid
;
512 fs_devices
->latest_trans
= found_transid
;
514 *fs_devices_ret
= fs_devices
;
518 static struct btrfs_fs_devices
*clone_fs_devices(struct btrfs_fs_devices
*orig
)
520 struct btrfs_fs_devices
*fs_devices
;
521 struct btrfs_device
*device
;
522 struct btrfs_device
*orig_dev
;
524 fs_devices
= alloc_fs_devices(orig
->fsid
);
525 if (IS_ERR(fs_devices
))
528 fs_devices
->latest_devid
= orig
->latest_devid
;
529 fs_devices
->latest_trans
= orig
->latest_trans
;
530 fs_devices
->total_devices
= orig
->total_devices
;
532 /* We have held the volume lock, it is safe to get the devices. */
533 list_for_each_entry(orig_dev
, &orig
->devices
, dev_list
) {
534 struct rcu_string
*name
;
536 device
= btrfs_alloc_device(NULL
, &orig_dev
->devid
,
542 * This is ok to do without rcu read locked because we hold the
543 * uuid mutex so nothing we touch in here is going to disappear.
545 name
= rcu_string_strdup(orig_dev
->name
->str
, GFP_NOFS
);
550 rcu_assign_pointer(device
->name
, name
);
552 list_add(&device
->dev_list
, &fs_devices
->devices
);
553 device
->fs_devices
= fs_devices
;
554 fs_devices
->num_devices
++;
558 free_fs_devices(fs_devices
);
559 return ERR_PTR(-ENOMEM
);
562 void btrfs_close_extra_devices(struct btrfs_fs_info
*fs_info
,
563 struct btrfs_fs_devices
*fs_devices
, int step
)
565 struct btrfs_device
*device
, *next
;
567 struct block_device
*latest_bdev
= NULL
;
568 u64 latest_devid
= 0;
569 u64 latest_transid
= 0;
571 mutex_lock(&uuid_mutex
);
573 /* This is the initialized path, it is safe to release the devices. */
574 list_for_each_entry_safe(device
, next
, &fs_devices
->devices
, dev_list
) {
575 if (device
->in_fs_metadata
) {
576 if (!device
->is_tgtdev_for_dev_replace
&&
578 device
->generation
> latest_transid
)) {
579 latest_devid
= device
->devid
;
580 latest_transid
= device
->generation
;
581 latest_bdev
= device
->bdev
;
586 if (device
->devid
== BTRFS_DEV_REPLACE_DEVID
) {
588 * In the first step, keep the device which has
589 * the correct fsid and the devid that is used
590 * for the dev_replace procedure.
591 * In the second step, the dev_replace state is
592 * read from the device tree and it is known
593 * whether the procedure is really active or
594 * not, which means whether this device is
595 * used or whether it should be removed.
597 if (step
== 0 || device
->is_tgtdev_for_dev_replace
) {
602 blkdev_put(device
->bdev
, device
->mode
);
604 fs_devices
->open_devices
--;
606 if (device
->writeable
) {
607 list_del_init(&device
->dev_alloc_list
);
608 device
->writeable
= 0;
609 if (!device
->is_tgtdev_for_dev_replace
)
610 fs_devices
->rw_devices
--;
612 list_del_init(&device
->dev_list
);
613 fs_devices
->num_devices
--;
614 rcu_string_free(device
->name
);
618 if (fs_devices
->seed
) {
619 fs_devices
= fs_devices
->seed
;
623 fs_devices
->latest_bdev
= latest_bdev
;
624 fs_devices
->latest_devid
= latest_devid
;
625 fs_devices
->latest_trans
= latest_transid
;
627 mutex_unlock(&uuid_mutex
);
630 static void __free_device(struct work_struct
*work
)
632 struct btrfs_device
*device
;
634 device
= container_of(work
, struct btrfs_device
, rcu_work
);
637 blkdev_put(device
->bdev
, device
->mode
);
639 rcu_string_free(device
->name
);
643 static void free_device(struct rcu_head
*head
)
645 struct btrfs_device
*device
;
647 device
= container_of(head
, struct btrfs_device
, rcu
);
649 INIT_WORK(&device
->rcu_work
, __free_device
);
650 schedule_work(&device
->rcu_work
);
653 static int __btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
655 struct btrfs_device
*device
;
657 if (--fs_devices
->opened
> 0)
660 mutex_lock(&fs_devices
->device_list_mutex
);
661 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
662 struct btrfs_device
*new_device
;
663 struct rcu_string
*name
;
666 fs_devices
->open_devices
--;
668 if (device
->writeable
&&
669 device
->devid
!= BTRFS_DEV_REPLACE_DEVID
) {
670 list_del_init(&device
->dev_alloc_list
);
671 fs_devices
->rw_devices
--;
674 if (device
->can_discard
)
675 fs_devices
->num_can_discard
--;
677 fs_devices
->missing_devices
--;
679 new_device
= btrfs_alloc_device(NULL
, &device
->devid
,
681 BUG_ON(IS_ERR(new_device
)); /* -ENOMEM */
683 /* Safe because we are under uuid_mutex */
685 name
= rcu_string_strdup(device
->name
->str
, GFP_NOFS
);
686 BUG_ON(!name
); /* -ENOMEM */
687 rcu_assign_pointer(new_device
->name
, name
);
690 list_replace_rcu(&device
->dev_list
, &new_device
->dev_list
);
691 new_device
->fs_devices
= device
->fs_devices
;
693 call_rcu(&device
->rcu
, free_device
);
695 mutex_unlock(&fs_devices
->device_list_mutex
);
697 WARN_ON(fs_devices
->open_devices
);
698 WARN_ON(fs_devices
->rw_devices
);
699 fs_devices
->opened
= 0;
700 fs_devices
->seeding
= 0;
705 int btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
707 struct btrfs_fs_devices
*seed_devices
= NULL
;
710 mutex_lock(&uuid_mutex
);
711 ret
= __btrfs_close_devices(fs_devices
);
712 if (!fs_devices
->opened
) {
713 seed_devices
= fs_devices
->seed
;
714 fs_devices
->seed
= NULL
;
716 mutex_unlock(&uuid_mutex
);
718 while (seed_devices
) {
719 fs_devices
= seed_devices
;
720 seed_devices
= fs_devices
->seed
;
721 __btrfs_close_devices(fs_devices
);
722 free_fs_devices(fs_devices
);
725 * Wait for rcu kworkers under __btrfs_close_devices
726 * to finish all blkdev_puts so device is really
727 * free when umount is done.
733 static int __btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
734 fmode_t flags
, void *holder
)
736 struct request_queue
*q
;
737 struct block_device
*bdev
;
738 struct list_head
*head
= &fs_devices
->devices
;
739 struct btrfs_device
*device
;
740 struct block_device
*latest_bdev
= NULL
;
741 struct buffer_head
*bh
;
742 struct btrfs_super_block
*disk_super
;
743 u64 latest_devid
= 0;
744 u64 latest_transid
= 0;
751 list_for_each_entry(device
, head
, dev_list
) {
757 /* Just open everything we can; ignore failures here */
758 if (btrfs_get_bdev_and_sb(device
->name
->str
, flags
, holder
, 1,
762 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
763 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
764 if (devid
!= device
->devid
)
767 if (memcmp(device
->uuid
, disk_super
->dev_item
.uuid
,
771 device
->generation
= btrfs_super_generation(disk_super
);
772 if (!latest_transid
|| device
->generation
> latest_transid
) {
773 latest_devid
= devid
;
774 latest_transid
= device
->generation
;
778 if (btrfs_super_flags(disk_super
) & BTRFS_SUPER_FLAG_SEEDING
) {
779 device
->writeable
= 0;
781 device
->writeable
= !bdev_read_only(bdev
);
785 q
= bdev_get_queue(bdev
);
786 if (blk_queue_discard(q
)) {
787 device
->can_discard
= 1;
788 fs_devices
->num_can_discard
++;
792 device
->in_fs_metadata
= 0;
793 device
->mode
= flags
;
795 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
796 fs_devices
->rotating
= 1;
798 fs_devices
->open_devices
++;
799 if (device
->writeable
&&
800 device
->devid
!= BTRFS_DEV_REPLACE_DEVID
) {
801 fs_devices
->rw_devices
++;
802 list_add(&device
->dev_alloc_list
,
803 &fs_devices
->alloc_list
);
810 blkdev_put(bdev
, flags
);
813 if (fs_devices
->open_devices
== 0) {
817 fs_devices
->seeding
= seeding
;
818 fs_devices
->opened
= 1;
819 fs_devices
->latest_bdev
= latest_bdev
;
820 fs_devices
->latest_devid
= latest_devid
;
821 fs_devices
->latest_trans
= latest_transid
;
822 fs_devices
->total_rw_bytes
= 0;
827 int btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
828 fmode_t flags
, void *holder
)
832 mutex_lock(&uuid_mutex
);
833 if (fs_devices
->opened
) {
834 fs_devices
->opened
++;
837 ret
= __btrfs_open_devices(fs_devices
, flags
, holder
);
839 mutex_unlock(&uuid_mutex
);
844 * Look for a btrfs signature on a device. This may be called out of the mount path
845 * and we are not allowed to call set_blocksize during the scan. The superblock
846 * is read via pagecache
848 int btrfs_scan_one_device(const char *path
, fmode_t flags
, void *holder
,
849 struct btrfs_fs_devices
**fs_devices_ret
)
851 struct btrfs_super_block
*disk_super
;
852 struct block_device
*bdev
;
863 * we would like to check all the supers, but that would make
864 * a btrfs mount succeed after a mkfs from a different FS.
865 * So, we need to add a special mount option to scan for
866 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
868 bytenr
= btrfs_sb_offset(0);
870 mutex_lock(&uuid_mutex
);
872 bdev
= blkdev_get_by_path(path
, flags
, holder
);
879 /* make sure our super fits in the device */
880 if (bytenr
+ PAGE_CACHE_SIZE
>= i_size_read(bdev
->bd_inode
))
883 /* make sure our super fits in the page */
884 if (sizeof(*disk_super
) > PAGE_CACHE_SIZE
)
887 /* make sure our super doesn't straddle pages on disk */
888 index
= bytenr
>> PAGE_CACHE_SHIFT
;
889 if ((bytenr
+ sizeof(*disk_super
) - 1) >> PAGE_CACHE_SHIFT
!= index
)
892 /* pull in the page with our super */
893 page
= read_cache_page_gfp(bdev
->bd_inode
->i_mapping
,
896 if (IS_ERR_OR_NULL(page
))
901 /* align our pointer to the offset of the super block */
902 disk_super
= p
+ (bytenr
& ~PAGE_CACHE_MASK
);
904 if (btrfs_super_bytenr(disk_super
) != bytenr
||
905 btrfs_super_magic(disk_super
) != BTRFS_MAGIC
)
908 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
909 transid
= btrfs_super_generation(disk_super
);
910 total_devices
= btrfs_super_num_devices(disk_super
);
912 if (disk_super
->label
[0]) {
913 if (disk_super
->label
[BTRFS_LABEL_SIZE
- 1])
914 disk_super
->label
[BTRFS_LABEL_SIZE
- 1] = '\0';
915 printk(KERN_INFO
"btrfs: device label %s ", disk_super
->label
);
917 printk(KERN_INFO
"btrfs: device fsid %pU ", disk_super
->fsid
);
920 printk(KERN_CONT
"devid %llu transid %llu %s\n", devid
, transid
, path
);
922 ret
= device_list_add(path
, disk_super
, devid
, fs_devices_ret
);
923 if (!ret
&& fs_devices_ret
)
924 (*fs_devices_ret
)->total_devices
= total_devices
;
928 page_cache_release(page
);
931 blkdev_put(bdev
, flags
);
933 mutex_unlock(&uuid_mutex
);
937 /* helper to account the used device space in the range */
938 int btrfs_account_dev_extents_size(struct btrfs_device
*device
, u64 start
,
939 u64 end
, u64
*length
)
941 struct btrfs_key key
;
942 struct btrfs_root
*root
= device
->dev_root
;
943 struct btrfs_dev_extent
*dev_extent
;
944 struct btrfs_path
*path
;
948 struct extent_buffer
*l
;
952 if (start
>= device
->total_bytes
|| device
->is_tgtdev_for_dev_replace
)
955 path
= btrfs_alloc_path();
960 key
.objectid
= device
->devid
;
962 key
.type
= BTRFS_DEV_EXTENT_KEY
;
964 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
968 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
975 slot
= path
->slots
[0];
976 if (slot
>= btrfs_header_nritems(l
)) {
977 ret
= btrfs_next_leaf(root
, path
);
985 btrfs_item_key_to_cpu(l
, &key
, slot
);
987 if (key
.objectid
< device
->devid
)
990 if (key
.objectid
> device
->devid
)
993 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
996 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
997 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
999 if (key
.offset
<= start
&& extent_end
> end
) {
1000 *length
= end
- start
+ 1;
1002 } else if (key
.offset
<= start
&& extent_end
> start
)
1003 *length
+= extent_end
- start
;
1004 else if (key
.offset
> start
&& extent_end
<= end
)
1005 *length
+= extent_end
- key
.offset
;
1006 else if (key
.offset
> start
&& key
.offset
<= end
) {
1007 *length
+= end
- key
.offset
+ 1;
1009 } else if (key
.offset
> end
)
1017 btrfs_free_path(path
);
1021 static int contains_pending_extent(struct btrfs_trans_handle
*trans
,
1022 struct btrfs_device
*device
,
1023 u64
*start
, u64 len
)
1025 struct extent_map
*em
;
1028 list_for_each_entry(em
, &trans
->transaction
->pending_chunks
, list
) {
1029 struct map_lookup
*map
;
1032 map
= (struct map_lookup
*)em
->bdev
;
1033 for (i
= 0; i
< map
->num_stripes
; i
++) {
1034 if (map
->stripes
[i
].dev
!= device
)
1036 if (map
->stripes
[i
].physical
>= *start
+ len
||
1037 map
->stripes
[i
].physical
+ em
->orig_block_len
<=
1040 *start
= map
->stripes
[i
].physical
+
1051 * find_free_dev_extent - find free space in the specified device
1052 * @device: the device which we search the free space in
1053 * @num_bytes: the size of the free space that we need
1054 * @start: store the start of the free space.
1055 * @len: the size of the free space. that we find, or the size of the max
1056 * free space if we don't find suitable free space
1058 * this uses a pretty simple search, the expectation is that it is
1059 * called very infrequently and that a given device has a small number
1062 * @start is used to store the start of the free space if we find. But if we
1063 * don't find suitable free space, it will be used to store the start position
1064 * of the max free space.
1066 * @len is used to store the size of the free space that we find.
1067 * But if we don't find suitable free space, it is used to store the size of
1068 * the max free space.
1070 int find_free_dev_extent(struct btrfs_trans_handle
*trans
,
1071 struct btrfs_device
*device
, u64 num_bytes
,
1072 u64
*start
, u64
*len
)
1074 struct btrfs_key key
;
1075 struct btrfs_root
*root
= device
->dev_root
;
1076 struct btrfs_dev_extent
*dev_extent
;
1077 struct btrfs_path
*path
;
1083 u64 search_end
= device
->total_bytes
;
1086 struct extent_buffer
*l
;
1088 /* FIXME use last free of some kind */
1090 /* we don't want to overwrite the superblock on the drive,
1091 * so we make sure to start at an offset of at least 1MB
1093 search_start
= max(root
->fs_info
->alloc_start
, 1024ull * 1024);
1095 path
= btrfs_alloc_path();
1099 max_hole_start
= search_start
;
1103 if (search_start
>= search_end
|| device
->is_tgtdev_for_dev_replace
) {
1109 path
->search_commit_root
= 1;
1110 path
->skip_locking
= 1;
1112 key
.objectid
= device
->devid
;
1113 key
.offset
= search_start
;
1114 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1116 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1120 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
1127 slot
= path
->slots
[0];
1128 if (slot
>= btrfs_header_nritems(l
)) {
1129 ret
= btrfs_next_leaf(root
, path
);
1137 btrfs_item_key_to_cpu(l
, &key
, slot
);
1139 if (key
.objectid
< device
->devid
)
1142 if (key
.objectid
> device
->devid
)
1145 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
1148 if (key
.offset
> search_start
) {
1149 hole_size
= key
.offset
- search_start
;
1152 * Have to check before we set max_hole_start, otherwise
1153 * we could end up sending back this offset anyway.
1155 if (contains_pending_extent(trans
, device
,
1160 if (hole_size
> max_hole_size
) {
1161 max_hole_start
= search_start
;
1162 max_hole_size
= hole_size
;
1166 * If this free space is greater than which we need,
1167 * it must be the max free space that we have found
1168 * until now, so max_hole_start must point to the start
1169 * of this free space and the length of this free space
1170 * is stored in max_hole_size. Thus, we return
1171 * max_hole_start and max_hole_size and go back to the
1174 if (hole_size
>= num_bytes
) {
1180 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
1181 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
1183 if (extent_end
> search_start
)
1184 search_start
= extent_end
;
1191 * At this point, search_start should be the end of
1192 * allocated dev extents, and when shrinking the device,
1193 * search_end may be smaller than search_start.
1195 if (search_end
> search_start
)
1196 hole_size
= search_end
- search_start
;
1198 if (hole_size
> max_hole_size
) {
1199 max_hole_start
= search_start
;
1200 max_hole_size
= hole_size
;
1203 if (contains_pending_extent(trans
, device
, &search_start
, hole_size
)) {
1204 btrfs_release_path(path
);
1209 if (hole_size
< num_bytes
)
1215 btrfs_free_path(path
);
1216 *start
= max_hole_start
;
1218 *len
= max_hole_size
;
1222 static int btrfs_free_dev_extent(struct btrfs_trans_handle
*trans
,
1223 struct btrfs_device
*device
,
1227 struct btrfs_path
*path
;
1228 struct btrfs_root
*root
= device
->dev_root
;
1229 struct btrfs_key key
;
1230 struct btrfs_key found_key
;
1231 struct extent_buffer
*leaf
= NULL
;
1232 struct btrfs_dev_extent
*extent
= NULL
;
1234 path
= btrfs_alloc_path();
1238 key
.objectid
= device
->devid
;
1240 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1242 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1244 ret
= btrfs_previous_item(root
, path
, key
.objectid
,
1245 BTRFS_DEV_EXTENT_KEY
);
1248 leaf
= path
->nodes
[0];
1249 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1250 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1251 struct btrfs_dev_extent
);
1252 BUG_ON(found_key
.offset
> start
|| found_key
.offset
+
1253 btrfs_dev_extent_length(leaf
, extent
) < start
);
1255 btrfs_release_path(path
);
1257 } else if (ret
== 0) {
1258 leaf
= path
->nodes
[0];
1259 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1260 struct btrfs_dev_extent
);
1262 btrfs_error(root
->fs_info
, ret
, "Slot search failed");
1266 if (device
->bytes_used
> 0) {
1267 u64 len
= btrfs_dev_extent_length(leaf
, extent
);
1268 device
->bytes_used
-= len
;
1269 spin_lock(&root
->fs_info
->free_chunk_lock
);
1270 root
->fs_info
->free_chunk_space
+= len
;
1271 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1273 ret
= btrfs_del_item(trans
, root
, path
);
1275 btrfs_error(root
->fs_info
, ret
,
1276 "Failed to remove dev extent item");
1279 btrfs_free_path(path
);
1283 static int btrfs_alloc_dev_extent(struct btrfs_trans_handle
*trans
,
1284 struct btrfs_device
*device
,
1285 u64 chunk_tree
, u64 chunk_objectid
,
1286 u64 chunk_offset
, u64 start
, u64 num_bytes
)
1289 struct btrfs_path
*path
;
1290 struct btrfs_root
*root
= device
->dev_root
;
1291 struct btrfs_dev_extent
*extent
;
1292 struct extent_buffer
*leaf
;
1293 struct btrfs_key key
;
1295 WARN_ON(!device
->in_fs_metadata
);
1296 WARN_ON(device
->is_tgtdev_for_dev_replace
);
1297 path
= btrfs_alloc_path();
1301 key
.objectid
= device
->devid
;
1303 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1304 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1309 leaf
= path
->nodes
[0];
1310 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1311 struct btrfs_dev_extent
);
1312 btrfs_set_dev_extent_chunk_tree(leaf
, extent
, chunk_tree
);
1313 btrfs_set_dev_extent_chunk_objectid(leaf
, extent
, chunk_objectid
);
1314 btrfs_set_dev_extent_chunk_offset(leaf
, extent
, chunk_offset
);
1316 write_extent_buffer(leaf
, root
->fs_info
->chunk_tree_uuid
,
1317 btrfs_dev_extent_chunk_tree_uuid(extent
), BTRFS_UUID_SIZE
);
1319 btrfs_set_dev_extent_length(leaf
, extent
, num_bytes
);
1320 btrfs_mark_buffer_dirty(leaf
);
1322 btrfs_free_path(path
);
1326 static u64
find_next_chunk(struct btrfs_fs_info
*fs_info
)
1328 struct extent_map_tree
*em_tree
;
1329 struct extent_map
*em
;
1333 em_tree
= &fs_info
->mapping_tree
.map_tree
;
1334 read_lock(&em_tree
->lock
);
1335 n
= rb_last(&em_tree
->map
);
1337 em
= rb_entry(n
, struct extent_map
, rb_node
);
1338 ret
= em
->start
+ em
->len
;
1340 read_unlock(&em_tree
->lock
);
1345 static noinline
int find_next_devid(struct btrfs_fs_info
*fs_info
,
1349 struct btrfs_key key
;
1350 struct btrfs_key found_key
;
1351 struct btrfs_path
*path
;
1353 path
= btrfs_alloc_path();
1357 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1358 key
.type
= BTRFS_DEV_ITEM_KEY
;
1359 key
.offset
= (u64
)-1;
1361 ret
= btrfs_search_slot(NULL
, fs_info
->chunk_root
, &key
, path
, 0, 0);
1365 BUG_ON(ret
== 0); /* Corruption */
1367 ret
= btrfs_previous_item(fs_info
->chunk_root
, path
,
1368 BTRFS_DEV_ITEMS_OBJECTID
,
1369 BTRFS_DEV_ITEM_KEY
);
1373 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1375 *devid_ret
= found_key
.offset
+ 1;
1379 btrfs_free_path(path
);
1384 * the device information is stored in the chunk root
1385 * the btrfs_device struct should be fully filled in
1387 static int btrfs_add_device(struct btrfs_trans_handle
*trans
,
1388 struct btrfs_root
*root
,
1389 struct btrfs_device
*device
)
1392 struct btrfs_path
*path
;
1393 struct btrfs_dev_item
*dev_item
;
1394 struct extent_buffer
*leaf
;
1395 struct btrfs_key key
;
1398 root
= root
->fs_info
->chunk_root
;
1400 path
= btrfs_alloc_path();
1404 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1405 key
.type
= BTRFS_DEV_ITEM_KEY
;
1406 key
.offset
= device
->devid
;
1408 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1413 leaf
= path
->nodes
[0];
1414 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
1416 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
1417 btrfs_set_device_generation(leaf
, dev_item
, 0);
1418 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
1419 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
1420 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
1421 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
1422 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->total_bytes
);
1423 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
1424 btrfs_set_device_group(leaf
, dev_item
, 0);
1425 btrfs_set_device_seek_speed(leaf
, dev_item
, 0);
1426 btrfs_set_device_bandwidth(leaf
, dev_item
, 0);
1427 btrfs_set_device_start_offset(leaf
, dev_item
, 0);
1429 ptr
= btrfs_device_uuid(dev_item
);
1430 write_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
1431 ptr
= btrfs_device_fsid(dev_item
);
1432 write_extent_buffer(leaf
, root
->fs_info
->fsid
, ptr
, BTRFS_UUID_SIZE
);
1433 btrfs_mark_buffer_dirty(leaf
);
1437 btrfs_free_path(path
);
1441 static int btrfs_rm_dev_item(struct btrfs_root
*root
,
1442 struct btrfs_device
*device
)
1445 struct btrfs_path
*path
;
1446 struct btrfs_key key
;
1447 struct btrfs_trans_handle
*trans
;
1449 root
= root
->fs_info
->chunk_root
;
1451 path
= btrfs_alloc_path();
1455 trans
= btrfs_start_transaction(root
, 0);
1456 if (IS_ERR(trans
)) {
1457 btrfs_free_path(path
);
1458 return PTR_ERR(trans
);
1460 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1461 key
.type
= BTRFS_DEV_ITEM_KEY
;
1462 key
.offset
= device
->devid
;
1465 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1474 ret
= btrfs_del_item(trans
, root
, path
);
1478 btrfs_free_path(path
);
1479 unlock_chunks(root
);
1480 btrfs_commit_transaction(trans
, root
);
1484 int btrfs_rm_device(struct btrfs_root
*root
, char *device_path
)
1486 struct btrfs_device
*device
;
1487 struct btrfs_device
*next_device
;
1488 struct block_device
*bdev
;
1489 struct buffer_head
*bh
= NULL
;
1490 struct btrfs_super_block
*disk_super
;
1491 struct btrfs_fs_devices
*cur_devices
;
1498 bool clear_super
= false;
1500 mutex_lock(&uuid_mutex
);
1503 seq
= read_seqbegin(&root
->fs_info
->profiles_lock
);
1505 all_avail
= root
->fs_info
->avail_data_alloc_bits
|
1506 root
->fs_info
->avail_system_alloc_bits
|
1507 root
->fs_info
->avail_metadata_alloc_bits
;
1508 } while (read_seqretry(&root
->fs_info
->profiles_lock
, seq
));
1510 num_devices
= root
->fs_info
->fs_devices
->num_devices
;
1511 btrfs_dev_replace_lock(&root
->fs_info
->dev_replace
);
1512 if (btrfs_dev_replace_is_ongoing(&root
->fs_info
->dev_replace
)) {
1513 WARN_ON(num_devices
< 1);
1516 btrfs_dev_replace_unlock(&root
->fs_info
->dev_replace
);
1518 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID10
) && num_devices
<= 4) {
1519 ret
= BTRFS_ERROR_DEV_RAID10_MIN_NOT_MET
;
1523 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID1
) && num_devices
<= 2) {
1524 ret
= BTRFS_ERROR_DEV_RAID1_MIN_NOT_MET
;
1528 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID5
) &&
1529 root
->fs_info
->fs_devices
->rw_devices
<= 2) {
1530 ret
= BTRFS_ERROR_DEV_RAID5_MIN_NOT_MET
;
1533 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID6
) &&
1534 root
->fs_info
->fs_devices
->rw_devices
<= 3) {
1535 ret
= BTRFS_ERROR_DEV_RAID6_MIN_NOT_MET
;
1539 if (strcmp(device_path
, "missing") == 0) {
1540 struct list_head
*devices
;
1541 struct btrfs_device
*tmp
;
1544 devices
= &root
->fs_info
->fs_devices
->devices
;
1546 * It is safe to read the devices since the volume_mutex
1549 list_for_each_entry(tmp
, devices
, dev_list
) {
1550 if (tmp
->in_fs_metadata
&&
1551 !tmp
->is_tgtdev_for_dev_replace
&&
1561 ret
= BTRFS_ERROR_DEV_MISSING_NOT_FOUND
;
1565 ret
= btrfs_get_bdev_and_sb(device_path
,
1566 FMODE_WRITE
| FMODE_EXCL
,
1567 root
->fs_info
->bdev_holder
, 0,
1571 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
1572 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
1573 dev_uuid
= disk_super
->dev_item
.uuid
;
1574 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1582 if (device
->is_tgtdev_for_dev_replace
) {
1583 ret
= BTRFS_ERROR_DEV_TGT_REPLACE
;
1587 if (device
->writeable
&& root
->fs_info
->fs_devices
->rw_devices
== 1) {
1588 ret
= BTRFS_ERROR_DEV_ONLY_WRITABLE
;
1592 if (device
->writeable
) {
1594 list_del_init(&device
->dev_alloc_list
);
1595 unlock_chunks(root
);
1596 root
->fs_info
->fs_devices
->rw_devices
--;
1600 mutex_unlock(&uuid_mutex
);
1601 ret
= btrfs_shrink_device(device
, 0);
1602 mutex_lock(&uuid_mutex
);
1607 * TODO: the superblock still includes this device in its num_devices
1608 * counter although write_all_supers() is not locked out. This
1609 * could give a filesystem state which requires a degraded mount.
1611 ret
= btrfs_rm_dev_item(root
->fs_info
->chunk_root
, device
);
1615 spin_lock(&root
->fs_info
->free_chunk_lock
);
1616 root
->fs_info
->free_chunk_space
= device
->total_bytes
-
1618 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1620 device
->in_fs_metadata
= 0;
1621 btrfs_scrub_cancel_dev(root
->fs_info
, device
);
1624 * the device list mutex makes sure that we don't change
1625 * the device list while someone else is writing out all
1626 * the device supers. Whoever is writing all supers, should
1627 * lock the device list mutex before getting the number of
1628 * devices in the super block (super_copy). Conversely,
1629 * whoever updates the number of devices in the super block
1630 * (super_copy) should hold the device list mutex.
1633 cur_devices
= device
->fs_devices
;
1634 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1635 list_del_rcu(&device
->dev_list
);
1637 device
->fs_devices
->num_devices
--;
1638 device
->fs_devices
->total_devices
--;
1640 if (device
->missing
)
1641 root
->fs_info
->fs_devices
->missing_devices
--;
1643 next_device
= list_entry(root
->fs_info
->fs_devices
->devices
.next
,
1644 struct btrfs_device
, dev_list
);
1645 if (device
->bdev
== root
->fs_info
->sb
->s_bdev
)
1646 root
->fs_info
->sb
->s_bdev
= next_device
->bdev
;
1647 if (device
->bdev
== root
->fs_info
->fs_devices
->latest_bdev
)
1648 root
->fs_info
->fs_devices
->latest_bdev
= next_device
->bdev
;
1651 device
->fs_devices
->open_devices
--;
1653 call_rcu(&device
->rcu
, free_device
);
1655 num_devices
= btrfs_super_num_devices(root
->fs_info
->super_copy
) - 1;
1656 btrfs_set_super_num_devices(root
->fs_info
->super_copy
, num_devices
);
1657 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1659 if (cur_devices
->open_devices
== 0) {
1660 struct btrfs_fs_devices
*fs_devices
;
1661 fs_devices
= root
->fs_info
->fs_devices
;
1662 while (fs_devices
) {
1663 if (fs_devices
->seed
== cur_devices
)
1665 fs_devices
= fs_devices
->seed
;
1667 fs_devices
->seed
= cur_devices
->seed
;
1668 cur_devices
->seed
= NULL
;
1670 __btrfs_close_devices(cur_devices
);
1671 unlock_chunks(root
);
1672 free_fs_devices(cur_devices
);
1675 root
->fs_info
->num_tolerated_disk_barrier_failures
=
1676 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
1679 * at this point, the device is zero sized. We want to
1680 * remove it from the devices list and zero out the old super
1682 if (clear_super
&& disk_super
) {
1683 /* make sure this device isn't detected as part of
1686 memset(&disk_super
->magic
, 0, sizeof(disk_super
->magic
));
1687 set_buffer_dirty(bh
);
1688 sync_dirty_buffer(bh
);
1693 /* Notify udev that device has changed */
1695 btrfs_kobject_uevent(bdev
, KOBJ_CHANGE
);
1700 blkdev_put(bdev
, FMODE_READ
| FMODE_EXCL
);
1702 mutex_unlock(&uuid_mutex
);
1705 if (device
->writeable
) {
1707 list_add(&device
->dev_alloc_list
,
1708 &root
->fs_info
->fs_devices
->alloc_list
);
1709 unlock_chunks(root
);
1710 root
->fs_info
->fs_devices
->rw_devices
++;
1715 void btrfs_rm_dev_replace_srcdev(struct btrfs_fs_info
*fs_info
,
1716 struct btrfs_device
*srcdev
)
1718 WARN_ON(!mutex_is_locked(&fs_info
->fs_devices
->device_list_mutex
));
1720 list_del_rcu(&srcdev
->dev_list
);
1721 list_del_rcu(&srcdev
->dev_alloc_list
);
1722 fs_info
->fs_devices
->num_devices
--;
1723 if (srcdev
->missing
) {
1724 fs_info
->fs_devices
->missing_devices
--;
1725 fs_info
->fs_devices
->rw_devices
++;
1727 if (srcdev
->can_discard
)
1728 fs_info
->fs_devices
->num_can_discard
--;
1730 fs_info
->fs_devices
->open_devices
--;
1732 /* zero out the old super */
1733 btrfs_scratch_superblock(srcdev
);
1736 call_rcu(&srcdev
->rcu
, free_device
);
1739 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_fs_info
*fs_info
,
1740 struct btrfs_device
*tgtdev
)
1742 struct btrfs_device
*next_device
;
1745 mutex_lock(&fs_info
->fs_devices
->device_list_mutex
);
1747 btrfs_scratch_superblock(tgtdev
);
1748 fs_info
->fs_devices
->open_devices
--;
1750 fs_info
->fs_devices
->num_devices
--;
1751 if (tgtdev
->can_discard
)
1752 fs_info
->fs_devices
->num_can_discard
++;
1754 next_device
= list_entry(fs_info
->fs_devices
->devices
.next
,
1755 struct btrfs_device
, dev_list
);
1756 if (tgtdev
->bdev
== fs_info
->sb
->s_bdev
)
1757 fs_info
->sb
->s_bdev
= next_device
->bdev
;
1758 if (tgtdev
->bdev
== fs_info
->fs_devices
->latest_bdev
)
1759 fs_info
->fs_devices
->latest_bdev
= next_device
->bdev
;
1760 list_del_rcu(&tgtdev
->dev_list
);
1762 call_rcu(&tgtdev
->rcu
, free_device
);
1764 mutex_unlock(&fs_info
->fs_devices
->device_list_mutex
);
1767 static int btrfs_find_device_by_path(struct btrfs_root
*root
, char *device_path
,
1768 struct btrfs_device
**device
)
1771 struct btrfs_super_block
*disk_super
;
1774 struct block_device
*bdev
;
1775 struct buffer_head
*bh
;
1778 ret
= btrfs_get_bdev_and_sb(device_path
, FMODE_READ
,
1779 root
->fs_info
->bdev_holder
, 0, &bdev
, &bh
);
1782 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
1783 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
1784 dev_uuid
= disk_super
->dev_item
.uuid
;
1785 *device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1790 blkdev_put(bdev
, FMODE_READ
);
1794 int btrfs_find_device_missing_or_by_path(struct btrfs_root
*root
,
1796 struct btrfs_device
**device
)
1799 if (strcmp(device_path
, "missing") == 0) {
1800 struct list_head
*devices
;
1801 struct btrfs_device
*tmp
;
1803 devices
= &root
->fs_info
->fs_devices
->devices
;
1805 * It is safe to read the devices since the volume_mutex
1806 * is held by the caller.
1808 list_for_each_entry(tmp
, devices
, dev_list
) {
1809 if (tmp
->in_fs_metadata
&& !tmp
->bdev
) {
1816 pr_err("btrfs: no missing device found\n");
1822 return btrfs_find_device_by_path(root
, device_path
, device
);
1827 * does all the dirty work required for changing file system's UUID.
1829 static int btrfs_prepare_sprout(struct btrfs_root
*root
)
1831 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
1832 struct btrfs_fs_devices
*old_devices
;
1833 struct btrfs_fs_devices
*seed_devices
;
1834 struct btrfs_super_block
*disk_super
= root
->fs_info
->super_copy
;
1835 struct btrfs_device
*device
;
1838 BUG_ON(!mutex_is_locked(&uuid_mutex
));
1839 if (!fs_devices
->seeding
)
1842 seed_devices
= __alloc_fs_devices();
1843 if (IS_ERR(seed_devices
))
1844 return PTR_ERR(seed_devices
);
1846 old_devices
= clone_fs_devices(fs_devices
);
1847 if (IS_ERR(old_devices
)) {
1848 kfree(seed_devices
);
1849 return PTR_ERR(old_devices
);
1852 list_add(&old_devices
->list
, &fs_uuids
);
1854 memcpy(seed_devices
, fs_devices
, sizeof(*seed_devices
));
1855 seed_devices
->opened
= 1;
1856 INIT_LIST_HEAD(&seed_devices
->devices
);
1857 INIT_LIST_HEAD(&seed_devices
->alloc_list
);
1858 mutex_init(&seed_devices
->device_list_mutex
);
1860 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1861 list_splice_init_rcu(&fs_devices
->devices
, &seed_devices
->devices
,
1864 list_splice_init(&fs_devices
->alloc_list
, &seed_devices
->alloc_list
);
1865 list_for_each_entry(device
, &seed_devices
->devices
, dev_list
) {
1866 device
->fs_devices
= seed_devices
;
1869 fs_devices
->seeding
= 0;
1870 fs_devices
->num_devices
= 0;
1871 fs_devices
->open_devices
= 0;
1872 fs_devices
->total_devices
= 0;
1873 fs_devices
->seed
= seed_devices
;
1875 generate_random_uuid(fs_devices
->fsid
);
1876 memcpy(root
->fs_info
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1877 memcpy(disk_super
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1878 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1880 super_flags
= btrfs_super_flags(disk_super
) &
1881 ~BTRFS_SUPER_FLAG_SEEDING
;
1882 btrfs_set_super_flags(disk_super
, super_flags
);
1888 * strore the expected generation for seed devices in device items.
1890 static int btrfs_finish_sprout(struct btrfs_trans_handle
*trans
,
1891 struct btrfs_root
*root
)
1893 struct btrfs_path
*path
;
1894 struct extent_buffer
*leaf
;
1895 struct btrfs_dev_item
*dev_item
;
1896 struct btrfs_device
*device
;
1897 struct btrfs_key key
;
1898 u8 fs_uuid
[BTRFS_UUID_SIZE
];
1899 u8 dev_uuid
[BTRFS_UUID_SIZE
];
1903 path
= btrfs_alloc_path();
1907 root
= root
->fs_info
->chunk_root
;
1908 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1910 key
.type
= BTRFS_DEV_ITEM_KEY
;
1913 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
1917 leaf
= path
->nodes
[0];
1919 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1920 ret
= btrfs_next_leaf(root
, path
);
1925 leaf
= path
->nodes
[0];
1926 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1927 btrfs_release_path(path
);
1931 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1932 if (key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
||
1933 key
.type
!= BTRFS_DEV_ITEM_KEY
)
1936 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
1937 struct btrfs_dev_item
);
1938 devid
= btrfs_device_id(leaf
, dev_item
);
1939 read_extent_buffer(leaf
, dev_uuid
, btrfs_device_uuid(dev_item
),
1941 read_extent_buffer(leaf
, fs_uuid
, btrfs_device_fsid(dev_item
),
1943 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1945 BUG_ON(!device
); /* Logic error */
1947 if (device
->fs_devices
->seeding
) {
1948 btrfs_set_device_generation(leaf
, dev_item
,
1949 device
->generation
);
1950 btrfs_mark_buffer_dirty(leaf
);
1958 btrfs_free_path(path
);
1962 int btrfs_init_new_device(struct btrfs_root
*root
, char *device_path
)
1964 struct request_queue
*q
;
1965 struct btrfs_trans_handle
*trans
;
1966 struct btrfs_device
*device
;
1967 struct block_device
*bdev
;
1968 struct list_head
*devices
;
1969 struct super_block
*sb
= root
->fs_info
->sb
;
1970 struct rcu_string
*name
;
1972 int seeding_dev
= 0;
1975 if ((sb
->s_flags
& MS_RDONLY
) && !root
->fs_info
->fs_devices
->seeding
)
1978 bdev
= blkdev_get_by_path(device_path
, FMODE_WRITE
| FMODE_EXCL
,
1979 root
->fs_info
->bdev_holder
);
1981 return PTR_ERR(bdev
);
1983 if (root
->fs_info
->fs_devices
->seeding
) {
1985 down_write(&sb
->s_umount
);
1986 mutex_lock(&uuid_mutex
);
1989 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
1991 devices
= &root
->fs_info
->fs_devices
->devices
;
1993 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1994 list_for_each_entry(device
, devices
, dev_list
) {
1995 if (device
->bdev
== bdev
) {
1998 &root
->fs_info
->fs_devices
->device_list_mutex
);
2002 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2004 device
= btrfs_alloc_device(root
->fs_info
, NULL
, NULL
);
2005 if (IS_ERR(device
)) {
2006 /* we can safely leave the fs_devices entry around */
2007 ret
= PTR_ERR(device
);
2011 name
= rcu_string_strdup(device_path
, GFP_NOFS
);
2017 rcu_assign_pointer(device
->name
, name
);
2019 trans
= btrfs_start_transaction(root
, 0);
2020 if (IS_ERR(trans
)) {
2021 rcu_string_free(device
->name
);
2023 ret
= PTR_ERR(trans
);
2029 q
= bdev_get_queue(bdev
);
2030 if (blk_queue_discard(q
))
2031 device
->can_discard
= 1;
2032 device
->writeable
= 1;
2033 device
->generation
= trans
->transid
;
2034 device
->io_width
= root
->sectorsize
;
2035 device
->io_align
= root
->sectorsize
;
2036 device
->sector_size
= root
->sectorsize
;
2037 device
->total_bytes
= i_size_read(bdev
->bd_inode
);
2038 device
->disk_total_bytes
= device
->total_bytes
;
2039 device
->dev_root
= root
->fs_info
->dev_root
;
2040 device
->bdev
= bdev
;
2041 device
->in_fs_metadata
= 1;
2042 device
->is_tgtdev_for_dev_replace
= 0;
2043 device
->mode
= FMODE_EXCL
;
2044 device
->dev_stats_valid
= 1;
2045 set_blocksize(device
->bdev
, 4096);
2048 sb
->s_flags
&= ~MS_RDONLY
;
2049 ret
= btrfs_prepare_sprout(root
);
2050 BUG_ON(ret
); /* -ENOMEM */
2053 device
->fs_devices
= root
->fs_info
->fs_devices
;
2055 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2056 list_add_rcu(&device
->dev_list
, &root
->fs_info
->fs_devices
->devices
);
2057 list_add(&device
->dev_alloc_list
,
2058 &root
->fs_info
->fs_devices
->alloc_list
);
2059 root
->fs_info
->fs_devices
->num_devices
++;
2060 root
->fs_info
->fs_devices
->open_devices
++;
2061 root
->fs_info
->fs_devices
->rw_devices
++;
2062 root
->fs_info
->fs_devices
->total_devices
++;
2063 if (device
->can_discard
)
2064 root
->fs_info
->fs_devices
->num_can_discard
++;
2065 root
->fs_info
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
2067 spin_lock(&root
->fs_info
->free_chunk_lock
);
2068 root
->fs_info
->free_chunk_space
+= device
->total_bytes
;
2069 spin_unlock(&root
->fs_info
->free_chunk_lock
);
2071 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
2072 root
->fs_info
->fs_devices
->rotating
= 1;
2074 total_bytes
= btrfs_super_total_bytes(root
->fs_info
->super_copy
);
2075 btrfs_set_super_total_bytes(root
->fs_info
->super_copy
,
2076 total_bytes
+ device
->total_bytes
);
2078 total_bytes
= btrfs_super_num_devices(root
->fs_info
->super_copy
);
2079 btrfs_set_super_num_devices(root
->fs_info
->super_copy
,
2081 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2084 ret
= init_first_rw_device(trans
, root
, device
);
2086 btrfs_abort_transaction(trans
, root
, ret
);
2089 ret
= btrfs_finish_sprout(trans
, root
);
2091 btrfs_abort_transaction(trans
, root
, ret
);
2095 ret
= btrfs_add_device(trans
, root
, device
);
2097 btrfs_abort_transaction(trans
, root
, ret
);
2103 * we've got more storage, clear any full flags on the space
2106 btrfs_clear_space_info_full(root
->fs_info
);
2108 unlock_chunks(root
);
2109 root
->fs_info
->num_tolerated_disk_barrier_failures
=
2110 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
2111 ret
= btrfs_commit_transaction(trans
, root
);
2114 mutex_unlock(&uuid_mutex
);
2115 up_write(&sb
->s_umount
);
2117 if (ret
) /* transaction commit */
2120 ret
= btrfs_relocate_sys_chunks(root
);
2122 btrfs_error(root
->fs_info
, ret
,
2123 "Failed to relocate sys chunks after "
2124 "device initialization. This can be fixed "
2125 "using the \"btrfs balance\" command.");
2126 trans
= btrfs_attach_transaction(root
);
2127 if (IS_ERR(trans
)) {
2128 if (PTR_ERR(trans
) == -ENOENT
)
2130 return PTR_ERR(trans
);
2132 ret
= btrfs_commit_transaction(trans
, root
);
2138 unlock_chunks(root
);
2139 btrfs_end_transaction(trans
, root
);
2140 rcu_string_free(device
->name
);
2143 blkdev_put(bdev
, FMODE_EXCL
);
2145 mutex_unlock(&uuid_mutex
);
2146 up_write(&sb
->s_umount
);
2151 int btrfs_init_dev_replace_tgtdev(struct btrfs_root
*root
, char *device_path
,
2152 struct btrfs_device
**device_out
)
2154 struct request_queue
*q
;
2155 struct btrfs_device
*device
;
2156 struct block_device
*bdev
;
2157 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2158 struct list_head
*devices
;
2159 struct rcu_string
*name
;
2160 u64 devid
= BTRFS_DEV_REPLACE_DEVID
;
2164 if (fs_info
->fs_devices
->seeding
)
2167 bdev
= blkdev_get_by_path(device_path
, FMODE_WRITE
| FMODE_EXCL
,
2168 fs_info
->bdev_holder
);
2170 return PTR_ERR(bdev
);
2172 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
2174 devices
= &fs_info
->fs_devices
->devices
;
2175 list_for_each_entry(device
, devices
, dev_list
) {
2176 if (device
->bdev
== bdev
) {
2182 device
= btrfs_alloc_device(NULL
, &devid
, NULL
);
2183 if (IS_ERR(device
)) {
2184 ret
= PTR_ERR(device
);
2188 name
= rcu_string_strdup(device_path
, GFP_NOFS
);
2194 rcu_assign_pointer(device
->name
, name
);
2196 q
= bdev_get_queue(bdev
);
2197 if (blk_queue_discard(q
))
2198 device
->can_discard
= 1;
2199 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2200 device
->writeable
= 1;
2201 device
->generation
= 0;
2202 device
->io_width
= root
->sectorsize
;
2203 device
->io_align
= root
->sectorsize
;
2204 device
->sector_size
= root
->sectorsize
;
2205 device
->total_bytes
= i_size_read(bdev
->bd_inode
);
2206 device
->disk_total_bytes
= device
->total_bytes
;
2207 device
->dev_root
= fs_info
->dev_root
;
2208 device
->bdev
= bdev
;
2209 device
->in_fs_metadata
= 1;
2210 device
->is_tgtdev_for_dev_replace
= 1;
2211 device
->mode
= FMODE_EXCL
;
2212 device
->dev_stats_valid
= 1;
2213 set_blocksize(device
->bdev
, 4096);
2214 device
->fs_devices
= fs_info
->fs_devices
;
2215 list_add(&device
->dev_list
, &fs_info
->fs_devices
->devices
);
2216 fs_info
->fs_devices
->num_devices
++;
2217 fs_info
->fs_devices
->open_devices
++;
2218 if (device
->can_discard
)
2219 fs_info
->fs_devices
->num_can_discard
++;
2220 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2222 *device_out
= device
;
2226 blkdev_put(bdev
, FMODE_EXCL
);
2230 void btrfs_init_dev_replace_tgtdev_for_resume(struct btrfs_fs_info
*fs_info
,
2231 struct btrfs_device
*tgtdev
)
2233 WARN_ON(fs_info
->fs_devices
->rw_devices
== 0);
2234 tgtdev
->io_width
= fs_info
->dev_root
->sectorsize
;
2235 tgtdev
->io_align
= fs_info
->dev_root
->sectorsize
;
2236 tgtdev
->sector_size
= fs_info
->dev_root
->sectorsize
;
2237 tgtdev
->dev_root
= fs_info
->dev_root
;
2238 tgtdev
->in_fs_metadata
= 1;
2241 static noinline
int btrfs_update_device(struct btrfs_trans_handle
*trans
,
2242 struct btrfs_device
*device
)
2245 struct btrfs_path
*path
;
2246 struct btrfs_root
*root
;
2247 struct btrfs_dev_item
*dev_item
;
2248 struct extent_buffer
*leaf
;
2249 struct btrfs_key key
;
2251 root
= device
->dev_root
->fs_info
->chunk_root
;
2253 path
= btrfs_alloc_path();
2257 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
2258 key
.type
= BTRFS_DEV_ITEM_KEY
;
2259 key
.offset
= device
->devid
;
2261 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
2270 leaf
= path
->nodes
[0];
2271 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
2273 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
2274 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
2275 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
2276 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
2277 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
2278 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->disk_total_bytes
);
2279 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
2280 btrfs_mark_buffer_dirty(leaf
);
2283 btrfs_free_path(path
);
2287 static int __btrfs_grow_device(struct btrfs_trans_handle
*trans
,
2288 struct btrfs_device
*device
, u64 new_size
)
2290 struct btrfs_super_block
*super_copy
=
2291 device
->dev_root
->fs_info
->super_copy
;
2292 u64 old_total
= btrfs_super_total_bytes(super_copy
);
2293 u64 diff
= new_size
- device
->total_bytes
;
2295 if (!device
->writeable
)
2297 if (new_size
<= device
->total_bytes
||
2298 device
->is_tgtdev_for_dev_replace
)
2301 btrfs_set_super_total_bytes(super_copy
, old_total
+ diff
);
2302 device
->fs_devices
->total_rw_bytes
+= diff
;
2304 device
->total_bytes
= new_size
;
2305 device
->disk_total_bytes
= new_size
;
2306 btrfs_clear_space_info_full(device
->dev_root
->fs_info
);
2308 return btrfs_update_device(trans
, device
);
2311 int btrfs_grow_device(struct btrfs_trans_handle
*trans
,
2312 struct btrfs_device
*device
, u64 new_size
)
2315 lock_chunks(device
->dev_root
);
2316 ret
= __btrfs_grow_device(trans
, device
, new_size
);
2317 unlock_chunks(device
->dev_root
);
2321 static int btrfs_free_chunk(struct btrfs_trans_handle
*trans
,
2322 struct btrfs_root
*root
,
2323 u64 chunk_tree
, u64 chunk_objectid
,
2327 struct btrfs_path
*path
;
2328 struct btrfs_key key
;
2330 root
= root
->fs_info
->chunk_root
;
2331 path
= btrfs_alloc_path();
2335 key
.objectid
= chunk_objectid
;
2336 key
.offset
= chunk_offset
;
2337 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2339 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2342 else if (ret
> 0) { /* Logic error or corruption */
2343 btrfs_error(root
->fs_info
, -ENOENT
,
2344 "Failed lookup while freeing chunk.");
2349 ret
= btrfs_del_item(trans
, root
, path
);
2351 btrfs_error(root
->fs_info
, ret
,
2352 "Failed to delete chunk item.");
2354 btrfs_free_path(path
);
2358 static int btrfs_del_sys_chunk(struct btrfs_root
*root
, u64 chunk_objectid
, u64
2361 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
2362 struct btrfs_disk_key
*disk_key
;
2363 struct btrfs_chunk
*chunk
;
2370 struct btrfs_key key
;
2372 array_size
= btrfs_super_sys_array_size(super_copy
);
2374 ptr
= super_copy
->sys_chunk_array
;
2377 while (cur
< array_size
) {
2378 disk_key
= (struct btrfs_disk_key
*)ptr
;
2379 btrfs_disk_key_to_cpu(&key
, disk_key
);
2381 len
= sizeof(*disk_key
);
2383 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
2384 chunk
= (struct btrfs_chunk
*)(ptr
+ len
);
2385 num_stripes
= btrfs_stack_chunk_num_stripes(chunk
);
2386 len
+= btrfs_chunk_item_size(num_stripes
);
2391 if (key
.objectid
== chunk_objectid
&&
2392 key
.offset
== chunk_offset
) {
2393 memmove(ptr
, ptr
+ len
, array_size
- (cur
+ len
));
2395 btrfs_set_super_sys_array_size(super_copy
, array_size
);
2404 static int btrfs_relocate_chunk(struct btrfs_root
*root
,
2405 u64 chunk_tree
, u64 chunk_objectid
,
2408 struct extent_map_tree
*em_tree
;
2409 struct btrfs_root
*extent_root
;
2410 struct btrfs_trans_handle
*trans
;
2411 struct extent_map
*em
;
2412 struct map_lookup
*map
;
2416 root
= root
->fs_info
->chunk_root
;
2417 extent_root
= root
->fs_info
->extent_root
;
2418 em_tree
= &root
->fs_info
->mapping_tree
.map_tree
;
2420 ret
= btrfs_can_relocate(extent_root
, chunk_offset
);
2424 /* step one, relocate all the extents inside this chunk */
2425 ret
= btrfs_relocate_block_group(extent_root
, chunk_offset
);
2429 trans
= btrfs_start_transaction(root
, 0);
2430 if (IS_ERR(trans
)) {
2431 ret
= PTR_ERR(trans
);
2432 btrfs_std_error(root
->fs_info
, ret
);
2439 * step two, delete the device extents and the
2440 * chunk tree entries
2442 read_lock(&em_tree
->lock
);
2443 em
= lookup_extent_mapping(em_tree
, chunk_offset
, 1);
2444 read_unlock(&em_tree
->lock
);
2446 BUG_ON(!em
|| em
->start
> chunk_offset
||
2447 em
->start
+ em
->len
< chunk_offset
);
2448 map
= (struct map_lookup
*)em
->bdev
;
2450 for (i
= 0; i
< map
->num_stripes
; i
++) {
2451 ret
= btrfs_free_dev_extent(trans
, map
->stripes
[i
].dev
,
2452 map
->stripes
[i
].physical
);
2455 if (map
->stripes
[i
].dev
) {
2456 ret
= btrfs_update_device(trans
, map
->stripes
[i
].dev
);
2460 ret
= btrfs_free_chunk(trans
, root
, chunk_tree
, chunk_objectid
,
2465 trace_btrfs_chunk_free(root
, map
, chunk_offset
, em
->len
);
2467 if (map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2468 ret
= btrfs_del_sys_chunk(root
, chunk_objectid
, chunk_offset
);
2472 ret
= btrfs_remove_block_group(trans
, extent_root
, chunk_offset
);
2475 write_lock(&em_tree
->lock
);
2476 remove_extent_mapping(em_tree
, em
);
2477 write_unlock(&em_tree
->lock
);
2482 /* once for the tree */
2483 free_extent_map(em
);
2485 free_extent_map(em
);
2487 unlock_chunks(root
);
2488 btrfs_end_transaction(trans
, root
);
2492 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
)
2494 struct btrfs_root
*chunk_root
= root
->fs_info
->chunk_root
;
2495 struct btrfs_path
*path
;
2496 struct extent_buffer
*leaf
;
2497 struct btrfs_chunk
*chunk
;
2498 struct btrfs_key key
;
2499 struct btrfs_key found_key
;
2500 u64 chunk_tree
= chunk_root
->root_key
.objectid
;
2502 bool retried
= false;
2506 path
= btrfs_alloc_path();
2511 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2512 key
.offset
= (u64
)-1;
2513 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2516 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2519 BUG_ON(ret
== 0); /* Corruption */
2521 ret
= btrfs_previous_item(chunk_root
, path
, key
.objectid
,
2528 leaf
= path
->nodes
[0];
2529 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2531 chunk
= btrfs_item_ptr(leaf
, path
->slots
[0],
2532 struct btrfs_chunk
);
2533 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2534 btrfs_release_path(path
);
2536 if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2537 ret
= btrfs_relocate_chunk(chunk_root
, chunk_tree
,
2546 if (found_key
.offset
== 0)
2548 key
.offset
= found_key
.offset
- 1;
2551 if (failed
&& !retried
) {
2555 } else if (WARN_ON(failed
&& retried
)) {
2559 btrfs_free_path(path
);
2563 static int insert_balance_item(struct btrfs_root
*root
,
2564 struct btrfs_balance_control
*bctl
)
2566 struct btrfs_trans_handle
*trans
;
2567 struct btrfs_balance_item
*item
;
2568 struct btrfs_disk_balance_args disk_bargs
;
2569 struct btrfs_path
*path
;
2570 struct extent_buffer
*leaf
;
2571 struct btrfs_key key
;
2574 path
= btrfs_alloc_path();
2578 trans
= btrfs_start_transaction(root
, 0);
2579 if (IS_ERR(trans
)) {
2580 btrfs_free_path(path
);
2581 return PTR_ERR(trans
);
2584 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2585 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2588 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
2593 leaf
= path
->nodes
[0];
2594 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
2596 memset_extent_buffer(leaf
, 0, (unsigned long)item
, sizeof(*item
));
2598 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->data
);
2599 btrfs_set_balance_data(leaf
, item
, &disk_bargs
);
2600 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->meta
);
2601 btrfs_set_balance_meta(leaf
, item
, &disk_bargs
);
2602 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->sys
);
2603 btrfs_set_balance_sys(leaf
, item
, &disk_bargs
);
2605 btrfs_set_balance_flags(leaf
, item
, bctl
->flags
);
2607 btrfs_mark_buffer_dirty(leaf
);
2609 btrfs_free_path(path
);
2610 err
= btrfs_commit_transaction(trans
, root
);
2616 static int del_balance_item(struct btrfs_root
*root
)
2618 struct btrfs_trans_handle
*trans
;
2619 struct btrfs_path
*path
;
2620 struct btrfs_key key
;
2623 path
= btrfs_alloc_path();
2627 trans
= btrfs_start_transaction(root
, 0);
2628 if (IS_ERR(trans
)) {
2629 btrfs_free_path(path
);
2630 return PTR_ERR(trans
);
2633 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2634 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2637 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2645 ret
= btrfs_del_item(trans
, root
, path
);
2647 btrfs_free_path(path
);
2648 err
= btrfs_commit_transaction(trans
, root
);
2655 * This is a heuristic used to reduce the number of chunks balanced on
2656 * resume after balance was interrupted.
2658 static void update_balance_args(struct btrfs_balance_control
*bctl
)
2661 * Turn on soft mode for chunk types that were being converted.
2663 if (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2664 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2665 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2666 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2667 if (bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2668 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2671 * Turn on usage filter if is not already used. The idea is
2672 * that chunks that we have already balanced should be
2673 * reasonably full. Don't do it for chunks that are being
2674 * converted - that will keep us from relocating unconverted
2675 * (albeit full) chunks.
2677 if (!(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2678 !(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2679 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2680 bctl
->data
.usage
= 90;
2682 if (!(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2683 !(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2684 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2685 bctl
->sys
.usage
= 90;
2687 if (!(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2688 !(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2689 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2690 bctl
->meta
.usage
= 90;
2695 * Should be called with both balance and volume mutexes held to
2696 * serialize other volume operations (add_dev/rm_dev/resize) with
2697 * restriper. Same goes for unset_balance_control.
2699 static void set_balance_control(struct btrfs_balance_control
*bctl
)
2701 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
2703 BUG_ON(fs_info
->balance_ctl
);
2705 spin_lock(&fs_info
->balance_lock
);
2706 fs_info
->balance_ctl
= bctl
;
2707 spin_unlock(&fs_info
->balance_lock
);
2710 static void unset_balance_control(struct btrfs_fs_info
*fs_info
)
2712 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2714 BUG_ON(!fs_info
->balance_ctl
);
2716 spin_lock(&fs_info
->balance_lock
);
2717 fs_info
->balance_ctl
= NULL
;
2718 spin_unlock(&fs_info
->balance_lock
);
2724 * Balance filters. Return 1 if chunk should be filtered out
2725 * (should not be balanced).
2727 static int chunk_profiles_filter(u64 chunk_type
,
2728 struct btrfs_balance_args
*bargs
)
2730 chunk_type
= chunk_to_extended(chunk_type
) &
2731 BTRFS_EXTENDED_PROFILE_MASK
;
2733 if (bargs
->profiles
& chunk_type
)
2739 static int chunk_usage_filter(struct btrfs_fs_info
*fs_info
, u64 chunk_offset
,
2740 struct btrfs_balance_args
*bargs
)
2742 struct btrfs_block_group_cache
*cache
;
2743 u64 chunk_used
, user_thresh
;
2746 cache
= btrfs_lookup_block_group(fs_info
, chunk_offset
);
2747 chunk_used
= btrfs_block_group_used(&cache
->item
);
2749 if (bargs
->usage
== 0)
2751 else if (bargs
->usage
> 100)
2752 user_thresh
= cache
->key
.offset
;
2754 user_thresh
= div_factor_fine(cache
->key
.offset
,
2757 if (chunk_used
< user_thresh
)
2760 btrfs_put_block_group(cache
);
2764 static int chunk_devid_filter(struct extent_buffer
*leaf
,
2765 struct btrfs_chunk
*chunk
,
2766 struct btrfs_balance_args
*bargs
)
2768 struct btrfs_stripe
*stripe
;
2769 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2772 for (i
= 0; i
< num_stripes
; i
++) {
2773 stripe
= btrfs_stripe_nr(chunk
, i
);
2774 if (btrfs_stripe_devid(leaf
, stripe
) == bargs
->devid
)
2781 /* [pstart, pend) */
2782 static int chunk_drange_filter(struct extent_buffer
*leaf
,
2783 struct btrfs_chunk
*chunk
,
2785 struct btrfs_balance_args
*bargs
)
2787 struct btrfs_stripe
*stripe
;
2788 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2794 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
))
2797 if (btrfs_chunk_type(leaf
, chunk
) & (BTRFS_BLOCK_GROUP_DUP
|
2798 BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
)) {
2799 factor
= num_stripes
/ 2;
2800 } else if (btrfs_chunk_type(leaf
, chunk
) & BTRFS_BLOCK_GROUP_RAID5
) {
2801 factor
= num_stripes
- 1;
2802 } else if (btrfs_chunk_type(leaf
, chunk
) & BTRFS_BLOCK_GROUP_RAID6
) {
2803 factor
= num_stripes
- 2;
2805 factor
= num_stripes
;
2808 for (i
= 0; i
< num_stripes
; i
++) {
2809 stripe
= btrfs_stripe_nr(chunk
, i
);
2810 if (btrfs_stripe_devid(leaf
, stripe
) != bargs
->devid
)
2813 stripe_offset
= btrfs_stripe_offset(leaf
, stripe
);
2814 stripe_length
= btrfs_chunk_length(leaf
, chunk
);
2815 do_div(stripe_length
, factor
);
2817 if (stripe_offset
< bargs
->pend
&&
2818 stripe_offset
+ stripe_length
> bargs
->pstart
)
2825 /* [vstart, vend) */
2826 static int chunk_vrange_filter(struct extent_buffer
*leaf
,
2827 struct btrfs_chunk
*chunk
,
2829 struct btrfs_balance_args
*bargs
)
2831 if (chunk_offset
< bargs
->vend
&&
2832 chunk_offset
+ btrfs_chunk_length(leaf
, chunk
) > bargs
->vstart
)
2833 /* at least part of the chunk is inside this vrange */
2839 static int chunk_soft_convert_filter(u64 chunk_type
,
2840 struct btrfs_balance_args
*bargs
)
2842 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_CONVERT
))
2845 chunk_type
= chunk_to_extended(chunk_type
) &
2846 BTRFS_EXTENDED_PROFILE_MASK
;
2848 if (bargs
->target
== chunk_type
)
2854 static int should_balance_chunk(struct btrfs_root
*root
,
2855 struct extent_buffer
*leaf
,
2856 struct btrfs_chunk
*chunk
, u64 chunk_offset
)
2858 struct btrfs_balance_control
*bctl
= root
->fs_info
->balance_ctl
;
2859 struct btrfs_balance_args
*bargs
= NULL
;
2860 u64 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2863 if (!((chunk_type
& BTRFS_BLOCK_GROUP_TYPE_MASK
) &
2864 (bctl
->flags
& BTRFS_BALANCE_TYPE_MASK
))) {
2868 if (chunk_type
& BTRFS_BLOCK_GROUP_DATA
)
2869 bargs
= &bctl
->data
;
2870 else if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
)
2872 else if (chunk_type
& BTRFS_BLOCK_GROUP_METADATA
)
2873 bargs
= &bctl
->meta
;
2875 /* profiles filter */
2876 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_PROFILES
) &&
2877 chunk_profiles_filter(chunk_type
, bargs
)) {
2882 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2883 chunk_usage_filter(bctl
->fs_info
, chunk_offset
, bargs
)) {
2888 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
) &&
2889 chunk_devid_filter(leaf
, chunk
, bargs
)) {
2893 /* drange filter, makes sense only with devid filter */
2894 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DRANGE
) &&
2895 chunk_drange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2900 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_VRANGE
) &&
2901 chunk_vrange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2905 /* soft profile changing mode */
2906 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_SOFT
) &&
2907 chunk_soft_convert_filter(chunk_type
, bargs
)) {
2914 static int __btrfs_balance(struct btrfs_fs_info
*fs_info
)
2916 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2917 struct btrfs_root
*chunk_root
= fs_info
->chunk_root
;
2918 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
2919 struct list_head
*devices
;
2920 struct btrfs_device
*device
;
2923 struct btrfs_chunk
*chunk
;
2924 struct btrfs_path
*path
;
2925 struct btrfs_key key
;
2926 struct btrfs_key found_key
;
2927 struct btrfs_trans_handle
*trans
;
2928 struct extent_buffer
*leaf
;
2931 int enospc_errors
= 0;
2932 bool counting
= true;
2934 /* step one make some room on all the devices */
2935 devices
= &fs_info
->fs_devices
->devices
;
2936 list_for_each_entry(device
, devices
, dev_list
) {
2937 old_size
= device
->total_bytes
;
2938 size_to_free
= div_factor(old_size
, 1);
2939 size_to_free
= min(size_to_free
, (u64
)1 * 1024 * 1024);
2940 if (!device
->writeable
||
2941 device
->total_bytes
- device
->bytes_used
> size_to_free
||
2942 device
->is_tgtdev_for_dev_replace
)
2945 ret
= btrfs_shrink_device(device
, old_size
- size_to_free
);
2950 trans
= btrfs_start_transaction(dev_root
, 0);
2951 BUG_ON(IS_ERR(trans
));
2953 ret
= btrfs_grow_device(trans
, device
, old_size
);
2956 btrfs_end_transaction(trans
, dev_root
);
2959 /* step two, relocate all the chunks */
2960 path
= btrfs_alloc_path();
2966 /* zero out stat counters */
2967 spin_lock(&fs_info
->balance_lock
);
2968 memset(&bctl
->stat
, 0, sizeof(bctl
->stat
));
2969 spin_unlock(&fs_info
->balance_lock
);
2971 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2972 key
.offset
= (u64
)-1;
2973 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2976 if ((!counting
&& atomic_read(&fs_info
->balance_pause_req
)) ||
2977 atomic_read(&fs_info
->balance_cancel_req
)) {
2982 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2987 * this shouldn't happen, it means the last relocate
2991 BUG(); /* FIXME break ? */
2993 ret
= btrfs_previous_item(chunk_root
, path
, 0,
2994 BTRFS_CHUNK_ITEM_KEY
);
3000 leaf
= path
->nodes
[0];
3001 slot
= path
->slots
[0];
3002 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
3004 if (found_key
.objectid
!= key
.objectid
)
3007 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
3010 spin_lock(&fs_info
->balance_lock
);
3011 bctl
->stat
.considered
++;
3012 spin_unlock(&fs_info
->balance_lock
);
3015 ret
= should_balance_chunk(chunk_root
, leaf
, chunk
,
3017 btrfs_release_path(path
);
3022 spin_lock(&fs_info
->balance_lock
);
3023 bctl
->stat
.expected
++;
3024 spin_unlock(&fs_info
->balance_lock
);
3028 ret
= btrfs_relocate_chunk(chunk_root
,
3029 chunk_root
->root_key
.objectid
,
3032 if (ret
&& ret
!= -ENOSPC
)
3034 if (ret
== -ENOSPC
) {
3037 spin_lock(&fs_info
->balance_lock
);
3038 bctl
->stat
.completed
++;
3039 spin_unlock(&fs_info
->balance_lock
);
3042 if (found_key
.offset
== 0)
3044 key
.offset
= found_key
.offset
- 1;
3048 btrfs_release_path(path
);
3053 btrfs_free_path(path
);
3054 if (enospc_errors
) {
3055 printk(KERN_INFO
"btrfs: %d enospc errors during balance\n",
3065 * alloc_profile_is_valid - see if a given profile is valid and reduced
3066 * @flags: profile to validate
3067 * @extended: if true @flags is treated as an extended profile
3069 static int alloc_profile_is_valid(u64 flags
, int extended
)
3071 u64 mask
= (extended
? BTRFS_EXTENDED_PROFILE_MASK
:
3072 BTRFS_BLOCK_GROUP_PROFILE_MASK
);
3074 flags
&= ~BTRFS_BLOCK_GROUP_TYPE_MASK
;
3076 /* 1) check that all other bits are zeroed */
3080 /* 2) see if profile is reduced */
3082 return !extended
; /* "0" is valid for usual profiles */
3084 /* true if exactly one bit set */
3085 return (flags
& (flags
- 1)) == 0;
3088 static inline int balance_need_close(struct btrfs_fs_info
*fs_info
)
3090 /* cancel requested || normal exit path */
3091 return atomic_read(&fs_info
->balance_cancel_req
) ||
3092 (atomic_read(&fs_info
->balance_pause_req
) == 0 &&
3093 atomic_read(&fs_info
->balance_cancel_req
) == 0);
3096 static void __cancel_balance(struct btrfs_fs_info
*fs_info
)
3100 unset_balance_control(fs_info
);
3101 ret
= del_balance_item(fs_info
->tree_root
);
3103 btrfs_std_error(fs_info
, ret
);
3105 atomic_set(&fs_info
->mutually_exclusive_operation_running
, 0);
3109 * Should be called with both balance and volume mutexes held
3111 int btrfs_balance(struct btrfs_balance_control
*bctl
,
3112 struct btrfs_ioctl_balance_args
*bargs
)
3114 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
3121 if (btrfs_fs_closing(fs_info
) ||
3122 atomic_read(&fs_info
->balance_pause_req
) ||
3123 atomic_read(&fs_info
->balance_cancel_req
)) {
3128 allowed
= btrfs_super_incompat_flags(fs_info
->super_copy
);
3129 if (allowed
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
)
3133 * In case of mixed groups both data and meta should be picked,
3134 * and identical options should be given for both of them.
3136 allowed
= BTRFS_BALANCE_DATA
| BTRFS_BALANCE_METADATA
;
3137 if (mixed
&& (bctl
->flags
& allowed
)) {
3138 if (!(bctl
->flags
& BTRFS_BALANCE_DATA
) ||
3139 !(bctl
->flags
& BTRFS_BALANCE_METADATA
) ||
3140 memcmp(&bctl
->data
, &bctl
->meta
, sizeof(bctl
->data
))) {
3141 printk(KERN_ERR
"btrfs: with mixed groups data and "
3142 "metadata balance options must be the same\n");
3148 num_devices
= fs_info
->fs_devices
->num_devices
;
3149 btrfs_dev_replace_lock(&fs_info
->dev_replace
);
3150 if (btrfs_dev_replace_is_ongoing(&fs_info
->dev_replace
)) {
3151 BUG_ON(num_devices
< 1);
3154 btrfs_dev_replace_unlock(&fs_info
->dev_replace
);
3155 allowed
= BTRFS_AVAIL_ALLOC_BIT_SINGLE
;
3156 if (num_devices
== 1)
3157 allowed
|= BTRFS_BLOCK_GROUP_DUP
;
3158 else if (num_devices
> 1)
3159 allowed
|= (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID1
);
3160 if (num_devices
> 2)
3161 allowed
|= BTRFS_BLOCK_GROUP_RAID5
;
3162 if (num_devices
> 3)
3163 allowed
|= (BTRFS_BLOCK_GROUP_RAID10
|
3164 BTRFS_BLOCK_GROUP_RAID6
);
3165 if ((bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3166 (!alloc_profile_is_valid(bctl
->data
.target
, 1) ||
3167 (bctl
->data
.target
& ~allowed
))) {
3168 printk(KERN_ERR
"btrfs: unable to start balance with target "
3169 "data profile %llu\n",
3174 if ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3175 (!alloc_profile_is_valid(bctl
->meta
.target
, 1) ||
3176 (bctl
->meta
.target
& ~allowed
))) {
3177 printk(KERN_ERR
"btrfs: unable to start balance with target "
3178 "metadata profile %llu\n",
3183 if ((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3184 (!alloc_profile_is_valid(bctl
->sys
.target
, 1) ||
3185 (bctl
->sys
.target
& ~allowed
))) {
3186 printk(KERN_ERR
"btrfs: unable to start balance with target "
3187 "system profile %llu\n",
3193 /* allow dup'ed data chunks only in mixed mode */
3194 if (!mixed
&& (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3195 (bctl
->data
.target
& BTRFS_BLOCK_GROUP_DUP
)) {
3196 printk(KERN_ERR
"btrfs: dup for data is not allowed\n");
3201 /* allow to reduce meta or sys integrity only if force set */
3202 allowed
= BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
|
3203 BTRFS_BLOCK_GROUP_RAID10
|
3204 BTRFS_BLOCK_GROUP_RAID5
|
3205 BTRFS_BLOCK_GROUP_RAID6
;
3207 seq
= read_seqbegin(&fs_info
->profiles_lock
);
3209 if (((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3210 (fs_info
->avail_system_alloc_bits
& allowed
) &&
3211 !(bctl
->sys
.target
& allowed
)) ||
3212 ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3213 (fs_info
->avail_metadata_alloc_bits
& allowed
) &&
3214 !(bctl
->meta
.target
& allowed
))) {
3215 if (bctl
->flags
& BTRFS_BALANCE_FORCE
) {
3216 printk(KERN_INFO
"btrfs: force reducing metadata "
3219 printk(KERN_ERR
"btrfs: balance will reduce metadata "
3220 "integrity, use force if you want this\n");
3225 } while (read_seqretry(&fs_info
->profiles_lock
, seq
));
3227 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
3228 int num_tolerated_disk_barrier_failures
;
3229 u64 target
= bctl
->sys
.target
;
3231 num_tolerated_disk_barrier_failures
=
3232 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
3233 if (num_tolerated_disk_barrier_failures
> 0 &&
3235 (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID0
|
3236 BTRFS_AVAIL_ALLOC_BIT_SINGLE
)))
3237 num_tolerated_disk_barrier_failures
= 0;
3238 else if (num_tolerated_disk_barrier_failures
> 1 &&
3240 (BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
)))
3241 num_tolerated_disk_barrier_failures
= 1;
3243 fs_info
->num_tolerated_disk_barrier_failures
=
3244 num_tolerated_disk_barrier_failures
;
3247 ret
= insert_balance_item(fs_info
->tree_root
, bctl
);
3248 if (ret
&& ret
!= -EEXIST
)
3251 if (!(bctl
->flags
& BTRFS_BALANCE_RESUME
)) {
3252 BUG_ON(ret
== -EEXIST
);
3253 set_balance_control(bctl
);
3255 BUG_ON(ret
!= -EEXIST
);
3256 spin_lock(&fs_info
->balance_lock
);
3257 update_balance_args(bctl
);
3258 spin_unlock(&fs_info
->balance_lock
);
3261 atomic_inc(&fs_info
->balance_running
);
3262 mutex_unlock(&fs_info
->balance_mutex
);
3264 ret
= __btrfs_balance(fs_info
);
3266 mutex_lock(&fs_info
->balance_mutex
);
3267 atomic_dec(&fs_info
->balance_running
);
3269 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
3270 fs_info
->num_tolerated_disk_barrier_failures
=
3271 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
3275 memset(bargs
, 0, sizeof(*bargs
));
3276 update_ioctl_balance_args(fs_info
, 0, bargs
);
3279 if ((ret
&& ret
!= -ECANCELED
&& ret
!= -ENOSPC
) ||
3280 balance_need_close(fs_info
)) {
3281 __cancel_balance(fs_info
);
3284 wake_up(&fs_info
->balance_wait_q
);
3288 if (bctl
->flags
& BTRFS_BALANCE_RESUME
)
3289 __cancel_balance(fs_info
);
3292 atomic_set(&fs_info
->mutually_exclusive_operation_running
, 0);
3297 static int balance_kthread(void *data
)
3299 struct btrfs_fs_info
*fs_info
= data
;
3302 mutex_lock(&fs_info
->volume_mutex
);
3303 mutex_lock(&fs_info
->balance_mutex
);
3305 if (fs_info
->balance_ctl
) {
3306 printk(KERN_INFO
"btrfs: continuing balance\n");
3307 ret
= btrfs_balance(fs_info
->balance_ctl
, NULL
);
3310 mutex_unlock(&fs_info
->balance_mutex
);
3311 mutex_unlock(&fs_info
->volume_mutex
);
3316 int btrfs_resume_balance_async(struct btrfs_fs_info
*fs_info
)
3318 struct task_struct
*tsk
;
3320 spin_lock(&fs_info
->balance_lock
);
3321 if (!fs_info
->balance_ctl
) {
3322 spin_unlock(&fs_info
->balance_lock
);
3325 spin_unlock(&fs_info
->balance_lock
);
3327 if (btrfs_test_opt(fs_info
->tree_root
, SKIP_BALANCE
)) {
3328 printk(KERN_INFO
"btrfs: force skipping balance\n");
3332 tsk
= kthread_run(balance_kthread
, fs_info
, "btrfs-balance");
3333 return PTR_ERR_OR_ZERO(tsk
);
3336 int btrfs_recover_balance(struct btrfs_fs_info
*fs_info
)
3338 struct btrfs_balance_control
*bctl
;
3339 struct btrfs_balance_item
*item
;
3340 struct btrfs_disk_balance_args disk_bargs
;
3341 struct btrfs_path
*path
;
3342 struct extent_buffer
*leaf
;
3343 struct btrfs_key key
;
3346 path
= btrfs_alloc_path();
3350 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
3351 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
3354 ret
= btrfs_search_slot(NULL
, fs_info
->tree_root
, &key
, path
, 0, 0);
3357 if (ret
> 0) { /* ret = -ENOENT; */
3362 bctl
= kzalloc(sizeof(*bctl
), GFP_NOFS
);
3368 leaf
= path
->nodes
[0];
3369 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
3371 bctl
->fs_info
= fs_info
;
3372 bctl
->flags
= btrfs_balance_flags(leaf
, item
);
3373 bctl
->flags
|= BTRFS_BALANCE_RESUME
;
3375 btrfs_balance_data(leaf
, item
, &disk_bargs
);
3376 btrfs_disk_balance_args_to_cpu(&bctl
->data
, &disk_bargs
);
3377 btrfs_balance_meta(leaf
, item
, &disk_bargs
);
3378 btrfs_disk_balance_args_to_cpu(&bctl
->meta
, &disk_bargs
);
3379 btrfs_balance_sys(leaf
, item
, &disk_bargs
);
3380 btrfs_disk_balance_args_to_cpu(&bctl
->sys
, &disk_bargs
);
3382 WARN_ON(atomic_xchg(&fs_info
->mutually_exclusive_operation_running
, 1));
3384 mutex_lock(&fs_info
->volume_mutex
);
3385 mutex_lock(&fs_info
->balance_mutex
);
3387 set_balance_control(bctl
);
3389 mutex_unlock(&fs_info
->balance_mutex
);
3390 mutex_unlock(&fs_info
->volume_mutex
);
3392 btrfs_free_path(path
);
3396 int btrfs_pause_balance(struct btrfs_fs_info
*fs_info
)
3400 mutex_lock(&fs_info
->balance_mutex
);
3401 if (!fs_info
->balance_ctl
) {
3402 mutex_unlock(&fs_info
->balance_mutex
);
3406 if (atomic_read(&fs_info
->balance_running
)) {
3407 atomic_inc(&fs_info
->balance_pause_req
);
3408 mutex_unlock(&fs_info
->balance_mutex
);
3410 wait_event(fs_info
->balance_wait_q
,
3411 atomic_read(&fs_info
->balance_running
) == 0);
3413 mutex_lock(&fs_info
->balance_mutex
);
3414 /* we are good with balance_ctl ripped off from under us */
3415 BUG_ON(atomic_read(&fs_info
->balance_running
));
3416 atomic_dec(&fs_info
->balance_pause_req
);
3421 mutex_unlock(&fs_info
->balance_mutex
);
3425 int btrfs_cancel_balance(struct btrfs_fs_info
*fs_info
)
3427 if (fs_info
->sb
->s_flags
& MS_RDONLY
)
3430 mutex_lock(&fs_info
->balance_mutex
);
3431 if (!fs_info
->balance_ctl
) {
3432 mutex_unlock(&fs_info
->balance_mutex
);
3436 atomic_inc(&fs_info
->balance_cancel_req
);
3438 * if we are running just wait and return, balance item is
3439 * deleted in btrfs_balance in this case
3441 if (atomic_read(&fs_info
->balance_running
)) {
3442 mutex_unlock(&fs_info
->balance_mutex
);
3443 wait_event(fs_info
->balance_wait_q
,
3444 atomic_read(&fs_info
->balance_running
) == 0);
3445 mutex_lock(&fs_info
->balance_mutex
);
3447 /* __cancel_balance needs volume_mutex */
3448 mutex_unlock(&fs_info
->balance_mutex
);
3449 mutex_lock(&fs_info
->volume_mutex
);
3450 mutex_lock(&fs_info
->balance_mutex
);
3452 if (fs_info
->balance_ctl
)
3453 __cancel_balance(fs_info
);
3455 mutex_unlock(&fs_info
->volume_mutex
);
3458 BUG_ON(fs_info
->balance_ctl
|| atomic_read(&fs_info
->balance_running
));
3459 atomic_dec(&fs_info
->balance_cancel_req
);
3460 mutex_unlock(&fs_info
->balance_mutex
);
3464 static int btrfs_uuid_scan_kthread(void *data
)
3466 struct btrfs_fs_info
*fs_info
= data
;
3467 struct btrfs_root
*root
= fs_info
->tree_root
;
3468 struct btrfs_key key
;
3469 struct btrfs_key max_key
;
3470 struct btrfs_path
*path
= NULL
;
3472 struct extent_buffer
*eb
;
3474 struct btrfs_root_item root_item
;
3476 struct btrfs_trans_handle
*trans
= NULL
;
3478 path
= btrfs_alloc_path();
3485 key
.type
= BTRFS_ROOT_ITEM_KEY
;
3488 max_key
.objectid
= (u64
)-1;
3489 max_key
.type
= BTRFS_ROOT_ITEM_KEY
;
3490 max_key
.offset
= (u64
)-1;
3492 path
->keep_locks
= 1;
3495 ret
= btrfs_search_forward(root
, &key
, path
, 0);
3502 if (key
.type
!= BTRFS_ROOT_ITEM_KEY
||
3503 (key
.objectid
< BTRFS_FIRST_FREE_OBJECTID
&&
3504 key
.objectid
!= BTRFS_FS_TREE_OBJECTID
) ||
3505 key
.objectid
> BTRFS_LAST_FREE_OBJECTID
)
3508 eb
= path
->nodes
[0];
3509 slot
= path
->slots
[0];
3510 item_size
= btrfs_item_size_nr(eb
, slot
);
3511 if (item_size
< sizeof(root_item
))
3514 read_extent_buffer(eb
, &root_item
,
3515 btrfs_item_ptr_offset(eb
, slot
),
3516 (int)sizeof(root_item
));
3517 if (btrfs_root_refs(&root_item
) == 0)
3520 if (!btrfs_is_empty_uuid(root_item
.uuid
) ||
3521 !btrfs_is_empty_uuid(root_item
.received_uuid
)) {
3525 btrfs_release_path(path
);
3527 * 1 - subvol uuid item
3528 * 1 - received_subvol uuid item
3530 trans
= btrfs_start_transaction(fs_info
->uuid_root
, 2);
3531 if (IS_ERR(trans
)) {
3532 ret
= PTR_ERR(trans
);
3540 if (!btrfs_is_empty_uuid(root_item
.uuid
)) {
3541 ret
= btrfs_uuid_tree_add(trans
, fs_info
->uuid_root
,
3543 BTRFS_UUID_KEY_SUBVOL
,
3546 pr_warn("btrfs: uuid_tree_add failed %d\n",
3552 if (!btrfs_is_empty_uuid(root_item
.received_uuid
)) {
3553 ret
= btrfs_uuid_tree_add(trans
, fs_info
->uuid_root
,
3554 root_item
.received_uuid
,
3555 BTRFS_UUID_KEY_RECEIVED_SUBVOL
,
3558 pr_warn("btrfs: uuid_tree_add failed %d\n",
3566 ret
= btrfs_end_transaction(trans
, fs_info
->uuid_root
);
3572 btrfs_release_path(path
);
3573 if (key
.offset
< (u64
)-1) {
3575 } else if (key
.type
< BTRFS_ROOT_ITEM_KEY
) {
3577 key
.type
= BTRFS_ROOT_ITEM_KEY
;
3578 } else if (key
.objectid
< (u64
)-1) {
3580 key
.type
= BTRFS_ROOT_ITEM_KEY
;
3589 btrfs_free_path(path
);
3590 if (trans
&& !IS_ERR(trans
))
3591 btrfs_end_transaction(trans
, fs_info
->uuid_root
);
3593 pr_warn("btrfs: btrfs_uuid_scan_kthread failed %d\n", ret
);
3595 fs_info
->update_uuid_tree_gen
= 1;
3596 up(&fs_info
->uuid_tree_rescan_sem
);
3601 * Callback for btrfs_uuid_tree_iterate().
3603 * 0 check succeeded, the entry is not outdated.
3604 * < 0 if an error occured.
3605 * > 0 if the check failed, which means the caller shall remove the entry.
3607 static int btrfs_check_uuid_tree_entry(struct btrfs_fs_info
*fs_info
,
3608 u8
*uuid
, u8 type
, u64 subid
)
3610 struct btrfs_key key
;
3612 struct btrfs_root
*subvol_root
;
3614 if (type
!= BTRFS_UUID_KEY_SUBVOL
&&
3615 type
!= BTRFS_UUID_KEY_RECEIVED_SUBVOL
)
3618 key
.objectid
= subid
;
3619 key
.type
= BTRFS_ROOT_ITEM_KEY
;
3620 key
.offset
= (u64
)-1;
3621 subvol_root
= btrfs_read_fs_root_no_name(fs_info
, &key
);
3622 if (IS_ERR(subvol_root
)) {
3623 ret
= PTR_ERR(subvol_root
);
3630 case BTRFS_UUID_KEY_SUBVOL
:
3631 if (memcmp(uuid
, subvol_root
->root_item
.uuid
, BTRFS_UUID_SIZE
))
3634 case BTRFS_UUID_KEY_RECEIVED_SUBVOL
:
3635 if (memcmp(uuid
, subvol_root
->root_item
.received_uuid
,
3645 static int btrfs_uuid_rescan_kthread(void *data
)
3647 struct btrfs_fs_info
*fs_info
= (struct btrfs_fs_info
*)data
;
3651 * 1st step is to iterate through the existing UUID tree and
3652 * to delete all entries that contain outdated data.
3653 * 2nd step is to add all missing entries to the UUID tree.
3655 ret
= btrfs_uuid_tree_iterate(fs_info
, btrfs_check_uuid_tree_entry
);
3657 pr_warn("btrfs: iterating uuid_tree failed %d\n", ret
);
3658 up(&fs_info
->uuid_tree_rescan_sem
);
3661 return btrfs_uuid_scan_kthread(data
);
3664 int btrfs_create_uuid_tree(struct btrfs_fs_info
*fs_info
)
3666 struct btrfs_trans_handle
*trans
;
3667 struct btrfs_root
*tree_root
= fs_info
->tree_root
;
3668 struct btrfs_root
*uuid_root
;
3669 struct task_struct
*task
;
3676 trans
= btrfs_start_transaction(tree_root
, 2);
3678 return PTR_ERR(trans
);
3680 uuid_root
= btrfs_create_tree(trans
, fs_info
,
3681 BTRFS_UUID_TREE_OBJECTID
);
3682 if (IS_ERR(uuid_root
)) {
3683 btrfs_abort_transaction(trans
, tree_root
,
3684 PTR_ERR(uuid_root
));
3685 return PTR_ERR(uuid_root
);
3688 fs_info
->uuid_root
= uuid_root
;
3690 ret
= btrfs_commit_transaction(trans
, tree_root
);
3694 down(&fs_info
->uuid_tree_rescan_sem
);
3695 task
= kthread_run(btrfs_uuid_scan_kthread
, fs_info
, "btrfs-uuid");
3697 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
3698 pr_warn("btrfs: failed to start uuid_scan task\n");
3699 up(&fs_info
->uuid_tree_rescan_sem
);
3700 return PTR_ERR(task
);
3706 int btrfs_check_uuid_tree(struct btrfs_fs_info
*fs_info
)
3708 struct task_struct
*task
;
3710 down(&fs_info
->uuid_tree_rescan_sem
);
3711 task
= kthread_run(btrfs_uuid_rescan_kthread
, fs_info
, "btrfs-uuid");
3713 /* fs_info->update_uuid_tree_gen remains 0 in all error case */
3714 pr_warn("btrfs: failed to start uuid_rescan task\n");
3715 up(&fs_info
->uuid_tree_rescan_sem
);
3716 return PTR_ERR(task
);
3723 * shrinking a device means finding all of the device extents past
3724 * the new size, and then following the back refs to the chunks.
3725 * The chunk relocation code actually frees the device extent
3727 int btrfs_shrink_device(struct btrfs_device
*device
, u64 new_size
)
3729 struct btrfs_trans_handle
*trans
;
3730 struct btrfs_root
*root
= device
->dev_root
;
3731 struct btrfs_dev_extent
*dev_extent
= NULL
;
3732 struct btrfs_path
*path
;
3740 bool retried
= false;
3741 struct extent_buffer
*l
;
3742 struct btrfs_key key
;
3743 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3744 u64 old_total
= btrfs_super_total_bytes(super_copy
);
3745 u64 old_size
= device
->total_bytes
;
3746 u64 diff
= device
->total_bytes
- new_size
;
3748 if (device
->is_tgtdev_for_dev_replace
)
3751 path
= btrfs_alloc_path();
3759 device
->total_bytes
= new_size
;
3760 if (device
->writeable
) {
3761 device
->fs_devices
->total_rw_bytes
-= diff
;
3762 spin_lock(&root
->fs_info
->free_chunk_lock
);
3763 root
->fs_info
->free_chunk_space
-= diff
;
3764 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3766 unlock_chunks(root
);
3769 key
.objectid
= device
->devid
;
3770 key
.offset
= (u64
)-1;
3771 key
.type
= BTRFS_DEV_EXTENT_KEY
;
3774 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3778 ret
= btrfs_previous_item(root
, path
, 0, key
.type
);
3783 btrfs_release_path(path
);
3788 slot
= path
->slots
[0];
3789 btrfs_item_key_to_cpu(l
, &key
, path
->slots
[0]);
3791 if (key
.objectid
!= device
->devid
) {
3792 btrfs_release_path(path
);
3796 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
3797 length
= btrfs_dev_extent_length(l
, dev_extent
);
3799 if (key
.offset
+ length
<= new_size
) {
3800 btrfs_release_path(path
);
3804 chunk_tree
= btrfs_dev_extent_chunk_tree(l
, dev_extent
);
3805 chunk_objectid
= btrfs_dev_extent_chunk_objectid(l
, dev_extent
);
3806 chunk_offset
= btrfs_dev_extent_chunk_offset(l
, dev_extent
);
3807 btrfs_release_path(path
);
3809 ret
= btrfs_relocate_chunk(root
, chunk_tree
, chunk_objectid
,
3811 if (ret
&& ret
!= -ENOSPC
)
3815 } while (key
.offset
-- > 0);
3817 if (failed
&& !retried
) {
3821 } else if (failed
&& retried
) {
3825 device
->total_bytes
= old_size
;
3826 if (device
->writeable
)
3827 device
->fs_devices
->total_rw_bytes
+= diff
;
3828 spin_lock(&root
->fs_info
->free_chunk_lock
);
3829 root
->fs_info
->free_chunk_space
+= diff
;
3830 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3831 unlock_chunks(root
);
3835 /* Shrinking succeeded, else we would be at "done". */
3836 trans
= btrfs_start_transaction(root
, 0);
3837 if (IS_ERR(trans
)) {
3838 ret
= PTR_ERR(trans
);
3844 device
->disk_total_bytes
= new_size
;
3845 /* Now btrfs_update_device() will change the on-disk size. */
3846 ret
= btrfs_update_device(trans
, device
);
3848 unlock_chunks(root
);
3849 btrfs_end_transaction(trans
, root
);
3852 WARN_ON(diff
> old_total
);
3853 btrfs_set_super_total_bytes(super_copy
, old_total
- diff
);
3854 unlock_chunks(root
);
3855 btrfs_end_transaction(trans
, root
);
3857 btrfs_free_path(path
);
3861 static int btrfs_add_system_chunk(struct btrfs_root
*root
,
3862 struct btrfs_key
*key
,
3863 struct btrfs_chunk
*chunk
, int item_size
)
3865 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3866 struct btrfs_disk_key disk_key
;
3870 array_size
= btrfs_super_sys_array_size(super_copy
);
3871 if (array_size
+ item_size
> BTRFS_SYSTEM_CHUNK_ARRAY_SIZE
)
3874 ptr
= super_copy
->sys_chunk_array
+ array_size
;
3875 btrfs_cpu_key_to_disk(&disk_key
, key
);
3876 memcpy(ptr
, &disk_key
, sizeof(disk_key
));
3877 ptr
+= sizeof(disk_key
);
3878 memcpy(ptr
, chunk
, item_size
);
3879 item_size
+= sizeof(disk_key
);
3880 btrfs_set_super_sys_array_size(super_copy
, array_size
+ item_size
);
3885 * sort the devices in descending order by max_avail, total_avail
3887 static int btrfs_cmp_device_info(const void *a
, const void *b
)
3889 const struct btrfs_device_info
*di_a
= a
;
3890 const struct btrfs_device_info
*di_b
= b
;
3892 if (di_a
->max_avail
> di_b
->max_avail
)
3894 if (di_a
->max_avail
< di_b
->max_avail
)
3896 if (di_a
->total_avail
> di_b
->total_avail
)
3898 if (di_a
->total_avail
< di_b
->total_avail
)
3903 static struct btrfs_raid_attr btrfs_raid_array
[BTRFS_NR_RAID_TYPES
] = {
3904 [BTRFS_RAID_RAID10
] = {
3907 .devs_max
= 0, /* 0 == as many as possible */
3909 .devs_increment
= 2,
3912 [BTRFS_RAID_RAID1
] = {
3917 .devs_increment
= 2,
3920 [BTRFS_RAID_DUP
] = {
3925 .devs_increment
= 1,
3928 [BTRFS_RAID_RAID0
] = {
3933 .devs_increment
= 1,
3936 [BTRFS_RAID_SINGLE
] = {
3941 .devs_increment
= 1,
3944 [BTRFS_RAID_RAID5
] = {
3949 .devs_increment
= 1,
3952 [BTRFS_RAID_RAID6
] = {
3957 .devs_increment
= 1,
3962 static u32
find_raid56_stripe_len(u32 data_devices
, u32 dev_stripe_target
)
3964 /* TODO allow them to set a preferred stripe size */
3968 static void check_raid56_incompat_flag(struct btrfs_fs_info
*info
, u64 type
)
3970 if (!(type
& (BTRFS_BLOCK_GROUP_RAID5
| BTRFS_BLOCK_GROUP_RAID6
)))
3973 btrfs_set_fs_incompat(info
, RAID56
);
3976 static int __btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
3977 struct btrfs_root
*extent_root
, u64 start
,
3980 struct btrfs_fs_info
*info
= extent_root
->fs_info
;
3981 struct btrfs_fs_devices
*fs_devices
= info
->fs_devices
;
3982 struct list_head
*cur
;
3983 struct map_lookup
*map
= NULL
;
3984 struct extent_map_tree
*em_tree
;
3985 struct extent_map
*em
;
3986 struct btrfs_device_info
*devices_info
= NULL
;
3988 int num_stripes
; /* total number of stripes to allocate */
3989 int data_stripes
; /* number of stripes that count for
3991 int sub_stripes
; /* sub_stripes info for map */
3992 int dev_stripes
; /* stripes per dev */
3993 int devs_max
; /* max devs to use */
3994 int devs_min
; /* min devs needed */
3995 int devs_increment
; /* ndevs has to be a multiple of this */
3996 int ncopies
; /* how many copies to data has */
3998 u64 max_stripe_size
;
4002 u64 raid_stripe_len
= BTRFS_STRIPE_LEN
;
4008 BUG_ON(!alloc_profile_is_valid(type
, 0));
4010 if (list_empty(&fs_devices
->alloc_list
))
4013 index
= __get_raid_index(type
);
4015 sub_stripes
= btrfs_raid_array
[index
].sub_stripes
;
4016 dev_stripes
= btrfs_raid_array
[index
].dev_stripes
;
4017 devs_max
= btrfs_raid_array
[index
].devs_max
;
4018 devs_min
= btrfs_raid_array
[index
].devs_min
;
4019 devs_increment
= btrfs_raid_array
[index
].devs_increment
;
4020 ncopies
= btrfs_raid_array
[index
].ncopies
;
4022 if (type
& BTRFS_BLOCK_GROUP_DATA
) {
4023 max_stripe_size
= 1024 * 1024 * 1024;
4024 max_chunk_size
= 10 * max_stripe_size
;
4025 } else if (type
& BTRFS_BLOCK_GROUP_METADATA
) {
4026 /* for larger filesystems, use larger metadata chunks */
4027 if (fs_devices
->total_rw_bytes
> 50ULL * 1024 * 1024 * 1024)
4028 max_stripe_size
= 1024 * 1024 * 1024;
4030 max_stripe_size
= 256 * 1024 * 1024;
4031 max_chunk_size
= max_stripe_size
;
4032 } else if (type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
4033 max_stripe_size
= 32 * 1024 * 1024;
4034 max_chunk_size
= 2 * max_stripe_size
;
4036 printk(KERN_ERR
"btrfs: invalid chunk type 0x%llx requested\n",
4041 /* we don't want a chunk larger than 10% of writeable space */
4042 max_chunk_size
= min(div_factor(fs_devices
->total_rw_bytes
, 1),
4045 devices_info
= kzalloc(sizeof(*devices_info
) * fs_devices
->rw_devices
,
4050 cur
= fs_devices
->alloc_list
.next
;
4053 * in the first pass through the devices list, we gather information
4054 * about the available holes on each device.
4057 while (cur
!= &fs_devices
->alloc_list
) {
4058 struct btrfs_device
*device
;
4062 device
= list_entry(cur
, struct btrfs_device
, dev_alloc_list
);
4066 if (!device
->writeable
) {
4068 "btrfs: read-only device in alloc_list\n");
4072 if (!device
->in_fs_metadata
||
4073 device
->is_tgtdev_for_dev_replace
)
4076 if (device
->total_bytes
> device
->bytes_used
)
4077 total_avail
= device
->total_bytes
- device
->bytes_used
;
4081 /* If there is no space on this device, skip it. */
4082 if (total_avail
== 0)
4085 ret
= find_free_dev_extent(trans
, device
,
4086 max_stripe_size
* dev_stripes
,
4087 &dev_offset
, &max_avail
);
4088 if (ret
&& ret
!= -ENOSPC
)
4092 max_avail
= max_stripe_size
* dev_stripes
;
4094 if (max_avail
< BTRFS_STRIPE_LEN
* dev_stripes
)
4097 if (ndevs
== fs_devices
->rw_devices
) {
4098 WARN(1, "%s: found more than %llu devices\n",
4099 __func__
, fs_devices
->rw_devices
);
4102 devices_info
[ndevs
].dev_offset
= dev_offset
;
4103 devices_info
[ndevs
].max_avail
= max_avail
;
4104 devices_info
[ndevs
].total_avail
= total_avail
;
4105 devices_info
[ndevs
].dev
= device
;
4110 * now sort the devices by hole size / available space
4112 sort(devices_info
, ndevs
, sizeof(struct btrfs_device_info
),
4113 btrfs_cmp_device_info
, NULL
);
4115 /* round down to number of usable stripes */
4116 ndevs
-= ndevs
% devs_increment
;
4118 if (ndevs
< devs_increment
* sub_stripes
|| ndevs
< devs_min
) {
4123 if (devs_max
&& ndevs
> devs_max
)
4126 * the primary goal is to maximize the number of stripes, so use as many
4127 * devices as possible, even if the stripes are not maximum sized.
4129 stripe_size
= devices_info
[ndevs
-1].max_avail
;
4130 num_stripes
= ndevs
* dev_stripes
;
4133 * this will have to be fixed for RAID1 and RAID10 over
4136 data_stripes
= num_stripes
/ ncopies
;
4138 if (type
& BTRFS_BLOCK_GROUP_RAID5
) {
4139 raid_stripe_len
= find_raid56_stripe_len(ndevs
- 1,
4140 btrfs_super_stripesize(info
->super_copy
));
4141 data_stripes
= num_stripes
- 1;
4143 if (type
& BTRFS_BLOCK_GROUP_RAID6
) {
4144 raid_stripe_len
= find_raid56_stripe_len(ndevs
- 2,
4145 btrfs_super_stripesize(info
->super_copy
));
4146 data_stripes
= num_stripes
- 2;
4150 * Use the number of data stripes to figure out how big this chunk
4151 * is really going to be in terms of logical address space,
4152 * and compare that answer with the max chunk size
4154 if (stripe_size
* data_stripes
> max_chunk_size
) {
4155 u64 mask
= (1ULL << 24) - 1;
4156 stripe_size
= max_chunk_size
;
4157 do_div(stripe_size
, data_stripes
);
4159 /* bump the answer up to a 16MB boundary */
4160 stripe_size
= (stripe_size
+ mask
) & ~mask
;
4162 /* but don't go higher than the limits we found
4163 * while searching for free extents
4165 if (stripe_size
> devices_info
[ndevs
-1].max_avail
)
4166 stripe_size
= devices_info
[ndevs
-1].max_avail
;
4169 do_div(stripe_size
, dev_stripes
);
4171 /* align to BTRFS_STRIPE_LEN */
4172 do_div(stripe_size
, raid_stripe_len
);
4173 stripe_size
*= raid_stripe_len
;
4175 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
4180 map
->num_stripes
= num_stripes
;
4182 for (i
= 0; i
< ndevs
; ++i
) {
4183 for (j
= 0; j
< dev_stripes
; ++j
) {
4184 int s
= i
* dev_stripes
+ j
;
4185 map
->stripes
[s
].dev
= devices_info
[i
].dev
;
4186 map
->stripes
[s
].physical
= devices_info
[i
].dev_offset
+
4190 map
->sector_size
= extent_root
->sectorsize
;
4191 map
->stripe_len
= raid_stripe_len
;
4192 map
->io_align
= raid_stripe_len
;
4193 map
->io_width
= raid_stripe_len
;
4195 map
->sub_stripes
= sub_stripes
;
4197 num_bytes
= stripe_size
* data_stripes
;
4199 trace_btrfs_chunk_alloc(info
->chunk_root
, map
, start
, num_bytes
);
4201 em
= alloc_extent_map();
4206 em
->bdev
= (struct block_device
*)map
;
4208 em
->len
= num_bytes
;
4209 em
->block_start
= 0;
4210 em
->block_len
= em
->len
;
4211 em
->orig_block_len
= stripe_size
;
4213 em_tree
= &extent_root
->fs_info
->mapping_tree
.map_tree
;
4214 write_lock(&em_tree
->lock
);
4215 ret
= add_extent_mapping(em_tree
, em
, 0);
4217 list_add_tail(&em
->list
, &trans
->transaction
->pending_chunks
);
4218 atomic_inc(&em
->refs
);
4220 write_unlock(&em_tree
->lock
);
4222 free_extent_map(em
);
4226 ret
= btrfs_make_block_group(trans
, extent_root
, 0, type
,
4227 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
4230 goto error_del_extent
;
4232 free_extent_map(em
);
4233 check_raid56_incompat_flag(extent_root
->fs_info
, type
);
4235 kfree(devices_info
);
4239 write_lock(&em_tree
->lock
);
4240 remove_extent_mapping(em_tree
, em
);
4241 write_unlock(&em_tree
->lock
);
4243 /* One for our allocation */
4244 free_extent_map(em
);
4245 /* One for the tree reference */
4246 free_extent_map(em
);
4249 kfree(devices_info
);
4253 int btrfs_finish_chunk_alloc(struct btrfs_trans_handle
*trans
,
4254 struct btrfs_root
*extent_root
,
4255 u64 chunk_offset
, u64 chunk_size
)
4257 struct btrfs_key key
;
4258 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
4259 struct btrfs_device
*device
;
4260 struct btrfs_chunk
*chunk
;
4261 struct btrfs_stripe
*stripe
;
4262 struct extent_map_tree
*em_tree
;
4263 struct extent_map
*em
;
4264 struct map_lookup
*map
;
4271 em_tree
= &extent_root
->fs_info
->mapping_tree
.map_tree
;
4272 read_lock(&em_tree
->lock
);
4273 em
= lookup_extent_mapping(em_tree
, chunk_offset
, chunk_size
);
4274 read_unlock(&em_tree
->lock
);
4277 btrfs_crit(extent_root
->fs_info
, "unable to find logical "
4278 "%Lu len %Lu", chunk_offset
, chunk_size
);
4282 if (em
->start
!= chunk_offset
|| em
->len
!= chunk_size
) {
4283 btrfs_crit(extent_root
->fs_info
, "found a bad mapping, wanted"
4284 " %Lu-%Lu, found %Lu-%Lu\n", chunk_offset
,
4285 chunk_size
, em
->start
, em
->len
);
4286 free_extent_map(em
);
4290 map
= (struct map_lookup
*)em
->bdev
;
4291 item_size
= btrfs_chunk_item_size(map
->num_stripes
);
4292 stripe_size
= em
->orig_block_len
;
4294 chunk
= kzalloc(item_size
, GFP_NOFS
);
4300 for (i
= 0; i
< map
->num_stripes
; i
++) {
4301 device
= map
->stripes
[i
].dev
;
4302 dev_offset
= map
->stripes
[i
].physical
;
4304 device
->bytes_used
+= stripe_size
;
4305 ret
= btrfs_update_device(trans
, device
);
4308 ret
= btrfs_alloc_dev_extent(trans
, device
,
4309 chunk_root
->root_key
.objectid
,
4310 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
4311 chunk_offset
, dev_offset
,
4317 spin_lock(&extent_root
->fs_info
->free_chunk_lock
);
4318 extent_root
->fs_info
->free_chunk_space
-= (stripe_size
*
4320 spin_unlock(&extent_root
->fs_info
->free_chunk_lock
);
4322 stripe
= &chunk
->stripe
;
4323 for (i
= 0; i
< map
->num_stripes
; i
++) {
4324 device
= map
->stripes
[i
].dev
;
4325 dev_offset
= map
->stripes
[i
].physical
;
4327 btrfs_set_stack_stripe_devid(stripe
, device
->devid
);
4328 btrfs_set_stack_stripe_offset(stripe
, dev_offset
);
4329 memcpy(stripe
->dev_uuid
, device
->uuid
, BTRFS_UUID_SIZE
);
4333 btrfs_set_stack_chunk_length(chunk
, chunk_size
);
4334 btrfs_set_stack_chunk_owner(chunk
, extent_root
->root_key
.objectid
);
4335 btrfs_set_stack_chunk_stripe_len(chunk
, map
->stripe_len
);
4336 btrfs_set_stack_chunk_type(chunk
, map
->type
);
4337 btrfs_set_stack_chunk_num_stripes(chunk
, map
->num_stripes
);
4338 btrfs_set_stack_chunk_io_align(chunk
, map
->stripe_len
);
4339 btrfs_set_stack_chunk_io_width(chunk
, map
->stripe_len
);
4340 btrfs_set_stack_chunk_sector_size(chunk
, extent_root
->sectorsize
);
4341 btrfs_set_stack_chunk_sub_stripes(chunk
, map
->sub_stripes
);
4343 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
4344 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
4345 key
.offset
= chunk_offset
;
4347 ret
= btrfs_insert_item(trans
, chunk_root
, &key
, chunk
, item_size
);
4348 if (ret
== 0 && map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
4350 * TODO: Cleanup of inserted chunk root in case of
4353 ret
= btrfs_add_system_chunk(chunk_root
, &key
, chunk
,
4359 free_extent_map(em
);
4364 * Chunk allocation falls into two parts. The first part does works
4365 * that make the new allocated chunk useable, but not do any operation
4366 * that modifies the chunk tree. The second part does the works that
4367 * require modifying the chunk tree. This division is important for the
4368 * bootstrap process of adding storage to a seed btrfs.
4370 int btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
4371 struct btrfs_root
*extent_root
, u64 type
)
4375 chunk_offset
= find_next_chunk(extent_root
->fs_info
);
4376 return __btrfs_alloc_chunk(trans
, extent_root
, chunk_offset
, type
);
4379 static noinline
int init_first_rw_device(struct btrfs_trans_handle
*trans
,
4380 struct btrfs_root
*root
,
4381 struct btrfs_device
*device
)
4384 u64 sys_chunk_offset
;
4386 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4387 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
4390 chunk_offset
= find_next_chunk(fs_info
);
4391 alloc_profile
= btrfs_get_alloc_profile(extent_root
, 0);
4392 ret
= __btrfs_alloc_chunk(trans
, extent_root
, chunk_offset
,
4397 sys_chunk_offset
= find_next_chunk(root
->fs_info
);
4398 alloc_profile
= btrfs_get_alloc_profile(fs_info
->chunk_root
, 0);
4399 ret
= __btrfs_alloc_chunk(trans
, extent_root
, sys_chunk_offset
,
4402 btrfs_abort_transaction(trans
, root
, ret
);
4406 ret
= btrfs_add_device(trans
, fs_info
->chunk_root
, device
);
4408 btrfs_abort_transaction(trans
, root
, ret
);
4413 int btrfs_chunk_readonly(struct btrfs_root
*root
, u64 chunk_offset
)
4415 struct extent_map
*em
;
4416 struct map_lookup
*map
;
4417 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
4421 read_lock(&map_tree
->map_tree
.lock
);
4422 em
= lookup_extent_mapping(&map_tree
->map_tree
, chunk_offset
, 1);
4423 read_unlock(&map_tree
->map_tree
.lock
);
4427 if (btrfs_test_opt(root
, DEGRADED
)) {
4428 free_extent_map(em
);
4432 map
= (struct map_lookup
*)em
->bdev
;
4433 for (i
= 0; i
< map
->num_stripes
; i
++) {
4434 if (!map
->stripes
[i
].dev
->writeable
) {
4439 free_extent_map(em
);
4443 void btrfs_mapping_init(struct btrfs_mapping_tree
*tree
)
4445 extent_map_tree_init(&tree
->map_tree
);
4448 void btrfs_mapping_tree_free(struct btrfs_mapping_tree
*tree
)
4450 struct extent_map
*em
;
4453 write_lock(&tree
->map_tree
.lock
);
4454 em
= lookup_extent_mapping(&tree
->map_tree
, 0, (u64
)-1);
4456 remove_extent_mapping(&tree
->map_tree
, em
);
4457 write_unlock(&tree
->map_tree
.lock
);
4462 free_extent_map(em
);
4463 /* once for the tree */
4464 free_extent_map(em
);
4468 int btrfs_num_copies(struct btrfs_fs_info
*fs_info
, u64 logical
, u64 len
)
4470 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
4471 struct extent_map
*em
;
4472 struct map_lookup
*map
;
4473 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4476 read_lock(&em_tree
->lock
);
4477 em
= lookup_extent_mapping(em_tree
, logical
, len
);
4478 read_unlock(&em_tree
->lock
);
4481 * We could return errors for these cases, but that could get ugly and
4482 * we'd probably do the same thing which is just not do anything else
4483 * and exit, so return 1 so the callers don't try to use other copies.
4486 btrfs_crit(fs_info
, "No mapping for %Lu-%Lu\n", logical
,
4491 if (em
->start
> logical
|| em
->start
+ em
->len
< logical
) {
4492 btrfs_crit(fs_info
, "Invalid mapping for %Lu-%Lu, got "
4493 "%Lu-%Lu\n", logical
, logical
+len
, em
->start
,
4494 em
->start
+ em
->len
);
4495 free_extent_map(em
);
4499 map
= (struct map_lookup
*)em
->bdev
;
4500 if (map
->type
& (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
))
4501 ret
= map
->num_stripes
;
4502 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
4503 ret
= map
->sub_stripes
;
4504 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID5
)
4506 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID6
)
4510 free_extent_map(em
);
4512 btrfs_dev_replace_lock(&fs_info
->dev_replace
);
4513 if (btrfs_dev_replace_is_ongoing(&fs_info
->dev_replace
))
4515 btrfs_dev_replace_unlock(&fs_info
->dev_replace
);
4520 unsigned long btrfs_full_stripe_len(struct btrfs_root
*root
,
4521 struct btrfs_mapping_tree
*map_tree
,
4524 struct extent_map
*em
;
4525 struct map_lookup
*map
;
4526 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4527 unsigned long len
= root
->sectorsize
;
4529 read_lock(&em_tree
->lock
);
4530 em
= lookup_extent_mapping(em_tree
, logical
, len
);
4531 read_unlock(&em_tree
->lock
);
4534 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
4535 map
= (struct map_lookup
*)em
->bdev
;
4536 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
|
4537 BTRFS_BLOCK_GROUP_RAID6
)) {
4538 len
= map
->stripe_len
* nr_data_stripes(map
);
4540 free_extent_map(em
);
4544 int btrfs_is_parity_mirror(struct btrfs_mapping_tree
*map_tree
,
4545 u64 logical
, u64 len
, int mirror_num
)
4547 struct extent_map
*em
;
4548 struct map_lookup
*map
;
4549 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4552 read_lock(&em_tree
->lock
);
4553 em
= lookup_extent_mapping(em_tree
, logical
, len
);
4554 read_unlock(&em_tree
->lock
);
4557 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
4558 map
= (struct map_lookup
*)em
->bdev
;
4559 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
|
4560 BTRFS_BLOCK_GROUP_RAID6
))
4562 free_extent_map(em
);
4566 static int find_live_mirror(struct btrfs_fs_info
*fs_info
,
4567 struct map_lookup
*map
, int first
, int num
,
4568 int optimal
, int dev_replace_is_ongoing
)
4572 struct btrfs_device
*srcdev
;
4574 if (dev_replace_is_ongoing
&&
4575 fs_info
->dev_replace
.cont_reading_from_srcdev_mode
==
4576 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID
)
4577 srcdev
= fs_info
->dev_replace
.srcdev
;
4582 * try to avoid the drive that is the source drive for a
4583 * dev-replace procedure, only choose it if no other non-missing
4584 * mirror is available
4586 for (tolerance
= 0; tolerance
< 2; tolerance
++) {
4587 if (map
->stripes
[optimal
].dev
->bdev
&&
4588 (tolerance
|| map
->stripes
[optimal
].dev
!= srcdev
))
4590 for (i
= first
; i
< first
+ num
; i
++) {
4591 if (map
->stripes
[i
].dev
->bdev
&&
4592 (tolerance
|| map
->stripes
[i
].dev
!= srcdev
))
4597 /* we couldn't find one that doesn't fail. Just return something
4598 * and the io error handling code will clean up eventually
4603 static inline int parity_smaller(u64 a
, u64 b
)
4608 /* Bubble-sort the stripe set to put the parity/syndrome stripes last */
4609 static void sort_parity_stripes(struct btrfs_bio
*bbio
, u64
*raid_map
)
4611 struct btrfs_bio_stripe s
;
4618 for (i
= 0; i
< bbio
->num_stripes
- 1; i
++) {
4619 if (parity_smaller(raid_map
[i
], raid_map
[i
+1])) {
4620 s
= bbio
->stripes
[i
];
4622 bbio
->stripes
[i
] = bbio
->stripes
[i
+1];
4623 raid_map
[i
] = raid_map
[i
+1];
4624 bbio
->stripes
[i
+1] = s
;
4632 static int __btrfs_map_block(struct btrfs_fs_info
*fs_info
, int rw
,
4633 u64 logical
, u64
*length
,
4634 struct btrfs_bio
**bbio_ret
,
4635 int mirror_num
, u64
**raid_map_ret
)
4637 struct extent_map
*em
;
4638 struct map_lookup
*map
;
4639 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
4640 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4643 u64 stripe_end_offset
;
4648 u64
*raid_map
= NULL
;
4654 struct btrfs_bio
*bbio
= NULL
;
4655 struct btrfs_dev_replace
*dev_replace
= &fs_info
->dev_replace
;
4656 int dev_replace_is_ongoing
= 0;
4657 int num_alloc_stripes
;
4658 int patch_the_first_stripe_for_dev_replace
= 0;
4659 u64 physical_to_patch_in_first_stripe
= 0;
4660 u64 raid56_full_stripe_start
= (u64
)-1;
4662 read_lock(&em_tree
->lock
);
4663 em
= lookup_extent_mapping(em_tree
, logical
, *length
);
4664 read_unlock(&em_tree
->lock
);
4667 btrfs_crit(fs_info
, "unable to find logical %llu len %llu",
4672 if (em
->start
> logical
|| em
->start
+ em
->len
< logical
) {
4673 btrfs_crit(fs_info
, "found a bad mapping, wanted %Lu, "
4674 "found %Lu-%Lu\n", logical
, em
->start
,
4675 em
->start
+ em
->len
);
4676 free_extent_map(em
);
4680 map
= (struct map_lookup
*)em
->bdev
;
4681 offset
= logical
- em
->start
;
4683 stripe_len
= map
->stripe_len
;
4686 * stripe_nr counts the total number of stripes we have to stride
4687 * to get to this block
4689 do_div(stripe_nr
, stripe_len
);
4691 stripe_offset
= stripe_nr
* stripe_len
;
4692 BUG_ON(offset
< stripe_offset
);
4694 /* stripe_offset is the offset of this block in its stripe*/
4695 stripe_offset
= offset
- stripe_offset
;
4697 /* if we're here for raid56, we need to know the stripe aligned start */
4698 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
| BTRFS_BLOCK_GROUP_RAID6
)) {
4699 unsigned long full_stripe_len
= stripe_len
* nr_data_stripes(map
);
4700 raid56_full_stripe_start
= offset
;
4702 /* allow a write of a full stripe, but make sure we don't
4703 * allow straddling of stripes
4705 do_div(raid56_full_stripe_start
, full_stripe_len
);
4706 raid56_full_stripe_start
*= full_stripe_len
;
4709 if (rw
& REQ_DISCARD
) {
4710 /* we don't discard raid56 yet */
4712 (BTRFS_BLOCK_GROUP_RAID5
| BTRFS_BLOCK_GROUP_RAID6
)) {
4716 *length
= min_t(u64
, em
->len
- offset
, *length
);
4717 } else if (map
->type
& BTRFS_BLOCK_GROUP_PROFILE_MASK
) {
4719 /* For writes to RAID[56], allow a full stripeset across all disks.
4720 For other RAID types and for RAID[56] reads, just allow a single
4721 stripe (on a single disk). */
4722 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
| BTRFS_BLOCK_GROUP_RAID6
) &&
4724 max_len
= stripe_len
* nr_data_stripes(map
) -
4725 (offset
- raid56_full_stripe_start
);
4727 /* we limit the length of each bio to what fits in a stripe */
4728 max_len
= stripe_len
- stripe_offset
;
4730 *length
= min_t(u64
, em
->len
- offset
, max_len
);
4732 *length
= em
->len
- offset
;
4735 /* This is for when we're called from btrfs_merge_bio_hook() and all
4736 it cares about is the length */
4740 btrfs_dev_replace_lock(dev_replace
);
4741 dev_replace_is_ongoing
= btrfs_dev_replace_is_ongoing(dev_replace
);
4742 if (!dev_replace_is_ongoing
)
4743 btrfs_dev_replace_unlock(dev_replace
);
4745 if (dev_replace_is_ongoing
&& mirror_num
== map
->num_stripes
+ 1 &&
4746 !(rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
)) &&
4747 dev_replace
->tgtdev
!= NULL
) {
4749 * in dev-replace case, for repair case (that's the only
4750 * case where the mirror is selected explicitly when
4751 * calling btrfs_map_block), blocks left of the left cursor
4752 * can also be read from the target drive.
4753 * For REQ_GET_READ_MIRRORS, the target drive is added as
4754 * the last one to the array of stripes. For READ, it also
4755 * needs to be supported using the same mirror number.
4756 * If the requested block is not left of the left cursor,
4757 * EIO is returned. This can happen because btrfs_num_copies()
4758 * returns one more in the dev-replace case.
4760 u64 tmp_length
= *length
;
4761 struct btrfs_bio
*tmp_bbio
= NULL
;
4762 int tmp_num_stripes
;
4763 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
4764 int index_srcdev
= 0;
4766 u64 physical_of_found
= 0;
4768 ret
= __btrfs_map_block(fs_info
, REQ_GET_READ_MIRRORS
,
4769 logical
, &tmp_length
, &tmp_bbio
, 0, NULL
);
4771 WARN_ON(tmp_bbio
!= NULL
);
4775 tmp_num_stripes
= tmp_bbio
->num_stripes
;
4776 if (mirror_num
> tmp_num_stripes
) {
4778 * REQ_GET_READ_MIRRORS does not contain this
4779 * mirror, that means that the requested area
4780 * is not left of the left cursor
4788 * process the rest of the function using the mirror_num
4789 * of the source drive. Therefore look it up first.
4790 * At the end, patch the device pointer to the one of the
4793 for (i
= 0; i
< tmp_num_stripes
; i
++) {
4794 if (tmp_bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
4796 * In case of DUP, in order to keep it
4797 * simple, only add the mirror with the
4798 * lowest physical address
4801 physical_of_found
<=
4802 tmp_bbio
->stripes
[i
].physical
)
4807 tmp_bbio
->stripes
[i
].physical
;
4812 mirror_num
= index_srcdev
+ 1;
4813 patch_the_first_stripe_for_dev_replace
= 1;
4814 physical_to_patch_in_first_stripe
= physical_of_found
;
4823 } else if (mirror_num
> map
->num_stripes
) {
4829 stripe_nr_orig
= stripe_nr
;
4830 stripe_nr_end
= ALIGN(offset
+ *length
, map
->stripe_len
);
4831 do_div(stripe_nr_end
, map
->stripe_len
);
4832 stripe_end_offset
= stripe_nr_end
* map
->stripe_len
-
4835 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
4836 if (rw
& REQ_DISCARD
)
4837 num_stripes
= min_t(u64
, map
->num_stripes
,
4838 stripe_nr_end
- stripe_nr_orig
);
4839 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
4840 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID1
) {
4841 if (rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
))
4842 num_stripes
= map
->num_stripes
;
4843 else if (mirror_num
)
4844 stripe_index
= mirror_num
- 1;
4846 stripe_index
= find_live_mirror(fs_info
, map
, 0,
4848 current
->pid
% map
->num_stripes
,
4849 dev_replace_is_ongoing
);
4850 mirror_num
= stripe_index
+ 1;
4853 } else if (map
->type
& BTRFS_BLOCK_GROUP_DUP
) {
4854 if (rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
)) {
4855 num_stripes
= map
->num_stripes
;
4856 } else if (mirror_num
) {
4857 stripe_index
= mirror_num
- 1;
4862 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
4863 int factor
= map
->num_stripes
/ map
->sub_stripes
;
4865 stripe_index
= do_div(stripe_nr
, factor
);
4866 stripe_index
*= map
->sub_stripes
;
4868 if (rw
& (REQ_WRITE
| REQ_GET_READ_MIRRORS
))
4869 num_stripes
= map
->sub_stripes
;
4870 else if (rw
& REQ_DISCARD
)
4871 num_stripes
= min_t(u64
, map
->sub_stripes
*
4872 (stripe_nr_end
- stripe_nr_orig
),
4874 else if (mirror_num
)
4875 stripe_index
+= mirror_num
- 1;
4877 int old_stripe_index
= stripe_index
;
4878 stripe_index
= find_live_mirror(fs_info
, map
,
4880 map
->sub_stripes
, stripe_index
+
4881 current
->pid
% map
->sub_stripes
,
4882 dev_replace_is_ongoing
);
4883 mirror_num
= stripe_index
- old_stripe_index
+ 1;
4886 } else if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
|
4887 BTRFS_BLOCK_GROUP_RAID6
)) {
4890 if (bbio_ret
&& ((rw
& REQ_WRITE
) || mirror_num
> 1)
4894 /* push stripe_nr back to the start of the full stripe */
4895 stripe_nr
= raid56_full_stripe_start
;
4896 do_div(stripe_nr
, stripe_len
);
4898 stripe_index
= do_div(stripe_nr
, nr_data_stripes(map
));
4900 /* RAID[56] write or recovery. Return all stripes */
4901 num_stripes
= map
->num_stripes
;
4902 max_errors
= nr_parity_stripes(map
);
4904 raid_map
= kmalloc_array(num_stripes
, sizeof(u64
),
4911 /* Work out the disk rotation on this stripe-set */
4913 rot
= do_div(tmp
, num_stripes
);
4915 /* Fill in the logical address of each stripe */
4916 tmp
= stripe_nr
* nr_data_stripes(map
);
4917 for (i
= 0; i
< nr_data_stripes(map
); i
++)
4918 raid_map
[(i
+rot
) % num_stripes
] =
4919 em
->start
+ (tmp
+ i
) * map
->stripe_len
;
4921 raid_map
[(i
+rot
) % map
->num_stripes
] = RAID5_P_STRIPE
;
4922 if (map
->type
& BTRFS_BLOCK_GROUP_RAID6
)
4923 raid_map
[(i
+rot
+1) % num_stripes
] =
4926 *length
= map
->stripe_len
;
4931 * Mirror #0 or #1 means the original data block.
4932 * Mirror #2 is RAID5 parity block.
4933 * Mirror #3 is RAID6 Q block.
4935 stripe_index
= do_div(stripe_nr
, nr_data_stripes(map
));
4937 stripe_index
= nr_data_stripes(map
) +
4940 /* We distribute the parity blocks across stripes */
4941 tmp
= stripe_nr
+ stripe_index
;
4942 stripe_index
= do_div(tmp
, map
->num_stripes
);
4946 * after this do_div call, stripe_nr is the number of stripes
4947 * on this device we have to walk to find the data, and
4948 * stripe_index is the number of our device in the stripe array
4950 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
4951 mirror_num
= stripe_index
+ 1;
4953 BUG_ON(stripe_index
>= map
->num_stripes
);
4955 num_alloc_stripes
= num_stripes
;
4956 if (dev_replace_is_ongoing
) {
4957 if (rw
& (REQ_WRITE
| REQ_DISCARD
))
4958 num_alloc_stripes
<<= 1;
4959 if (rw
& REQ_GET_READ_MIRRORS
)
4960 num_alloc_stripes
++;
4962 bbio
= kzalloc(btrfs_bio_size(num_alloc_stripes
), GFP_NOFS
);
4968 atomic_set(&bbio
->error
, 0);
4970 if (rw
& REQ_DISCARD
) {
4972 int sub_stripes
= 0;
4973 u64 stripes_per_dev
= 0;
4974 u32 remaining_stripes
= 0;
4975 u32 last_stripe
= 0;
4978 (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID10
)) {
4979 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
4982 sub_stripes
= map
->sub_stripes
;
4984 factor
= map
->num_stripes
/ sub_stripes
;
4985 stripes_per_dev
= div_u64_rem(stripe_nr_end
-
4988 &remaining_stripes
);
4989 div_u64_rem(stripe_nr_end
- 1, factor
, &last_stripe
);
4990 last_stripe
*= sub_stripes
;
4993 for (i
= 0; i
< num_stripes
; i
++) {
4994 bbio
->stripes
[i
].physical
=
4995 map
->stripes
[stripe_index
].physical
+
4996 stripe_offset
+ stripe_nr
* map
->stripe_len
;
4997 bbio
->stripes
[i
].dev
= map
->stripes
[stripe_index
].dev
;
4999 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID0
|
5000 BTRFS_BLOCK_GROUP_RAID10
)) {
5001 bbio
->stripes
[i
].length
= stripes_per_dev
*
5004 if (i
/ sub_stripes
< remaining_stripes
)
5005 bbio
->stripes
[i
].length
+=
5009 * Special for the first stripe and
5012 * |-------|...|-------|
5016 if (i
< sub_stripes
)
5017 bbio
->stripes
[i
].length
-=
5020 if (stripe_index
>= last_stripe
&&
5021 stripe_index
<= (last_stripe
+
5023 bbio
->stripes
[i
].length
-=
5026 if (i
== sub_stripes
- 1)
5029 bbio
->stripes
[i
].length
= *length
;
5032 if (stripe_index
== map
->num_stripes
) {
5033 /* This could only happen for RAID0/10 */
5039 for (i
= 0; i
< num_stripes
; i
++) {
5040 bbio
->stripes
[i
].physical
=
5041 map
->stripes
[stripe_index
].physical
+
5043 stripe_nr
* map
->stripe_len
;
5044 bbio
->stripes
[i
].dev
=
5045 map
->stripes
[stripe_index
].dev
;
5050 if (rw
& (REQ_WRITE
| REQ_GET_READ_MIRRORS
)) {
5051 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID1
|
5052 BTRFS_BLOCK_GROUP_RAID10
|
5053 BTRFS_BLOCK_GROUP_RAID5
|
5054 BTRFS_BLOCK_GROUP_DUP
)) {
5056 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID6
) {
5061 if (dev_replace_is_ongoing
&& (rw
& (REQ_WRITE
| REQ_DISCARD
)) &&
5062 dev_replace
->tgtdev
!= NULL
) {
5063 int index_where_to_add
;
5064 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
5067 * duplicate the write operations while the dev replace
5068 * procedure is running. Since the copying of the old disk
5069 * to the new disk takes place at run time while the
5070 * filesystem is mounted writable, the regular write
5071 * operations to the old disk have to be duplicated to go
5072 * to the new disk as well.
5073 * Note that device->missing is handled by the caller, and
5074 * that the write to the old disk is already set up in the
5077 index_where_to_add
= num_stripes
;
5078 for (i
= 0; i
< num_stripes
; i
++) {
5079 if (bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
5080 /* write to new disk, too */
5081 struct btrfs_bio_stripe
*new =
5082 bbio
->stripes
+ index_where_to_add
;
5083 struct btrfs_bio_stripe
*old
=
5086 new->physical
= old
->physical
;
5087 new->length
= old
->length
;
5088 new->dev
= dev_replace
->tgtdev
;
5089 index_where_to_add
++;
5093 num_stripes
= index_where_to_add
;
5094 } else if (dev_replace_is_ongoing
&& (rw
& REQ_GET_READ_MIRRORS
) &&
5095 dev_replace
->tgtdev
!= NULL
) {
5096 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
5097 int index_srcdev
= 0;
5099 u64 physical_of_found
= 0;
5102 * During the dev-replace procedure, the target drive can
5103 * also be used to read data in case it is needed to repair
5104 * a corrupt block elsewhere. This is possible if the
5105 * requested area is left of the left cursor. In this area,
5106 * the target drive is a full copy of the source drive.
5108 for (i
= 0; i
< num_stripes
; i
++) {
5109 if (bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
5111 * In case of DUP, in order to keep it
5112 * simple, only add the mirror with the
5113 * lowest physical address
5116 physical_of_found
<=
5117 bbio
->stripes
[i
].physical
)
5121 physical_of_found
= bbio
->stripes
[i
].physical
;
5125 u64 length
= map
->stripe_len
;
5127 if (physical_of_found
+ length
<=
5128 dev_replace
->cursor_left
) {
5129 struct btrfs_bio_stripe
*tgtdev_stripe
=
5130 bbio
->stripes
+ num_stripes
;
5132 tgtdev_stripe
->physical
= physical_of_found
;
5133 tgtdev_stripe
->length
=
5134 bbio
->stripes
[index_srcdev
].length
;
5135 tgtdev_stripe
->dev
= dev_replace
->tgtdev
;
5143 bbio
->num_stripes
= num_stripes
;
5144 bbio
->max_errors
= max_errors
;
5145 bbio
->mirror_num
= mirror_num
;
5148 * this is the case that REQ_READ && dev_replace_is_ongoing &&
5149 * mirror_num == num_stripes + 1 && dev_replace target drive is
5150 * available as a mirror
5152 if (patch_the_first_stripe_for_dev_replace
&& num_stripes
> 0) {
5153 WARN_ON(num_stripes
> 1);
5154 bbio
->stripes
[0].dev
= dev_replace
->tgtdev
;
5155 bbio
->stripes
[0].physical
= physical_to_patch_in_first_stripe
;
5156 bbio
->mirror_num
= map
->num_stripes
+ 1;
5159 sort_parity_stripes(bbio
, raid_map
);
5160 *raid_map_ret
= raid_map
;
5163 if (dev_replace_is_ongoing
)
5164 btrfs_dev_replace_unlock(dev_replace
);
5165 free_extent_map(em
);
5169 int btrfs_map_block(struct btrfs_fs_info
*fs_info
, int rw
,
5170 u64 logical
, u64
*length
,
5171 struct btrfs_bio
**bbio_ret
, int mirror_num
)
5173 return __btrfs_map_block(fs_info
, rw
, logical
, length
, bbio_ret
,
5177 int btrfs_rmap_block(struct btrfs_mapping_tree
*map_tree
,
5178 u64 chunk_start
, u64 physical
, u64 devid
,
5179 u64
**logical
, int *naddrs
, int *stripe_len
)
5181 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
5182 struct extent_map
*em
;
5183 struct map_lookup
*map
;
5191 read_lock(&em_tree
->lock
);
5192 em
= lookup_extent_mapping(em_tree
, chunk_start
, 1);
5193 read_unlock(&em_tree
->lock
);
5196 printk(KERN_ERR
"btrfs: couldn't find em for chunk %Lu\n",
5201 if (em
->start
!= chunk_start
) {
5202 printk(KERN_ERR
"btrfs: bad chunk start, em=%Lu, wanted=%Lu\n",
5203 em
->start
, chunk_start
);
5204 free_extent_map(em
);
5207 map
= (struct map_lookup
*)em
->bdev
;
5210 rmap_len
= map
->stripe_len
;
5212 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
5213 do_div(length
, map
->num_stripes
/ map
->sub_stripes
);
5214 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
5215 do_div(length
, map
->num_stripes
);
5216 else if (map
->type
& (BTRFS_BLOCK_GROUP_RAID5
|
5217 BTRFS_BLOCK_GROUP_RAID6
)) {
5218 do_div(length
, nr_data_stripes(map
));
5219 rmap_len
= map
->stripe_len
* nr_data_stripes(map
);
5222 buf
= kzalloc(sizeof(u64
) * map
->num_stripes
, GFP_NOFS
);
5223 BUG_ON(!buf
); /* -ENOMEM */
5225 for (i
= 0; i
< map
->num_stripes
; i
++) {
5226 if (devid
&& map
->stripes
[i
].dev
->devid
!= devid
)
5228 if (map
->stripes
[i
].physical
> physical
||
5229 map
->stripes
[i
].physical
+ length
<= physical
)
5232 stripe_nr
= physical
- map
->stripes
[i
].physical
;
5233 do_div(stripe_nr
, map
->stripe_len
);
5235 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
5236 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
5237 do_div(stripe_nr
, map
->sub_stripes
);
5238 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
5239 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
5240 } /* else if RAID[56], multiply by nr_data_stripes().
5241 * Alternatively, just use rmap_len below instead of
5242 * map->stripe_len */
5244 bytenr
= chunk_start
+ stripe_nr
* rmap_len
;
5245 WARN_ON(nr
>= map
->num_stripes
);
5246 for (j
= 0; j
< nr
; j
++) {
5247 if (buf
[j
] == bytenr
)
5251 WARN_ON(nr
>= map
->num_stripes
);
5258 *stripe_len
= rmap_len
;
5260 free_extent_map(em
);
5264 static void btrfs_end_bio(struct bio
*bio
, int err
)
5266 struct btrfs_bio
*bbio
= bio
->bi_private
;
5267 int is_orig_bio
= 0;
5270 atomic_inc(&bbio
->error
);
5271 if (err
== -EIO
|| err
== -EREMOTEIO
) {
5272 unsigned int stripe_index
=
5273 btrfs_io_bio(bio
)->stripe_index
;
5274 struct btrfs_device
*dev
;
5276 BUG_ON(stripe_index
>= bbio
->num_stripes
);
5277 dev
= bbio
->stripes
[stripe_index
].dev
;
5279 if (bio
->bi_rw
& WRITE
)
5280 btrfs_dev_stat_inc(dev
,
5281 BTRFS_DEV_STAT_WRITE_ERRS
);
5283 btrfs_dev_stat_inc(dev
,
5284 BTRFS_DEV_STAT_READ_ERRS
);
5285 if ((bio
->bi_rw
& WRITE_FLUSH
) == WRITE_FLUSH
)
5286 btrfs_dev_stat_inc(dev
,
5287 BTRFS_DEV_STAT_FLUSH_ERRS
);
5288 btrfs_dev_stat_print_on_error(dev
);
5293 if (bio
== bbio
->orig_bio
)
5296 if (atomic_dec_and_test(&bbio
->stripes_pending
)) {
5299 bio
= bbio
->orig_bio
;
5301 bio
->bi_private
= bbio
->private;
5302 bio
->bi_end_io
= bbio
->end_io
;
5303 btrfs_io_bio(bio
)->mirror_num
= bbio
->mirror_num
;
5304 /* only send an error to the higher layers if it is
5305 * beyond the tolerance of the btrfs bio
5307 if (atomic_read(&bbio
->error
) > bbio
->max_errors
) {
5311 * this bio is actually up to date, we didn't
5312 * go over the max number of errors
5314 set_bit(BIO_UPTODATE
, &bio
->bi_flags
);
5319 bio_endio(bio
, err
);
5320 } else if (!is_orig_bio
) {
5325 struct async_sched
{
5328 struct btrfs_fs_info
*info
;
5329 struct btrfs_work work
;
5333 * see run_scheduled_bios for a description of why bios are collected for
5336 * This will add one bio to the pending list for a device and make sure
5337 * the work struct is scheduled.
5339 static noinline
void btrfs_schedule_bio(struct btrfs_root
*root
,
5340 struct btrfs_device
*device
,
5341 int rw
, struct bio
*bio
)
5343 int should_queue
= 1;
5344 struct btrfs_pending_bios
*pending_bios
;
5346 if (device
->missing
|| !device
->bdev
) {
5347 bio_endio(bio
, -EIO
);
5351 /* don't bother with additional async steps for reads, right now */
5352 if (!(rw
& REQ_WRITE
)) {
5354 btrfsic_submit_bio(rw
, bio
);
5360 * nr_async_bios allows us to reliably return congestion to the
5361 * higher layers. Otherwise, the async bio makes it appear we have
5362 * made progress against dirty pages when we've really just put it
5363 * on a queue for later
5365 atomic_inc(&root
->fs_info
->nr_async_bios
);
5366 WARN_ON(bio
->bi_next
);
5367 bio
->bi_next
= NULL
;
5370 spin_lock(&device
->io_lock
);
5371 if (bio
->bi_rw
& REQ_SYNC
)
5372 pending_bios
= &device
->pending_sync_bios
;
5374 pending_bios
= &device
->pending_bios
;
5376 if (pending_bios
->tail
)
5377 pending_bios
->tail
->bi_next
= bio
;
5379 pending_bios
->tail
= bio
;
5380 if (!pending_bios
->head
)
5381 pending_bios
->head
= bio
;
5382 if (device
->running_pending
)
5385 spin_unlock(&device
->io_lock
);
5388 btrfs_queue_worker(&root
->fs_info
->submit_workers
,
5392 static int bio_size_ok(struct block_device
*bdev
, struct bio
*bio
,
5395 struct bio_vec
*prev
;
5396 struct request_queue
*q
= bdev_get_queue(bdev
);
5397 unsigned int max_sectors
= queue_max_sectors(q
);
5398 struct bvec_merge_data bvm
= {
5400 .bi_sector
= sector
,
5401 .bi_rw
= bio
->bi_rw
,
5404 if (WARN_ON(bio
->bi_vcnt
== 0))
5407 prev
= &bio
->bi_io_vec
[bio
->bi_vcnt
- 1];
5408 if (bio_sectors(bio
) > max_sectors
)
5411 if (!q
->merge_bvec_fn
)
5414 bvm
.bi_size
= bio
->bi_iter
.bi_size
- prev
->bv_len
;
5415 if (q
->merge_bvec_fn(q
, &bvm
, prev
) < prev
->bv_len
)
5420 static void submit_stripe_bio(struct btrfs_root
*root
, struct btrfs_bio
*bbio
,
5421 struct bio
*bio
, u64 physical
, int dev_nr
,
5424 struct btrfs_device
*dev
= bbio
->stripes
[dev_nr
].dev
;
5426 bio
->bi_private
= bbio
;
5427 btrfs_io_bio(bio
)->stripe_index
= dev_nr
;
5428 bio
->bi_end_io
= btrfs_end_bio
;
5429 bio
->bi_iter
.bi_sector
= physical
>> 9;
5432 struct rcu_string
*name
;
5435 name
= rcu_dereference(dev
->name
);
5436 pr_debug("btrfs_map_bio: rw %d, sector=%llu, dev=%lu "
5437 "(%s id %llu), size=%u\n", rw
,
5438 (u64
)bio
->bi_sector
, (u_long
)dev
->bdev
->bd_dev
,
5439 name
->str
, dev
->devid
, bio
->bi_size
);
5443 bio
->bi_bdev
= dev
->bdev
;
5445 btrfs_schedule_bio(root
, dev
, rw
, bio
);
5447 btrfsic_submit_bio(rw
, bio
);
5450 static int breakup_stripe_bio(struct btrfs_root
*root
, struct btrfs_bio
*bbio
,
5451 struct bio
*first_bio
, struct btrfs_device
*dev
,
5452 int dev_nr
, int rw
, int async
)
5454 struct bio_vec
*bvec
= first_bio
->bi_io_vec
;
5456 int nr_vecs
= bio_get_nr_vecs(dev
->bdev
);
5457 u64 physical
= bbio
->stripes
[dev_nr
].physical
;
5460 bio
= btrfs_bio_alloc(dev
->bdev
, physical
>> 9, nr_vecs
, GFP_NOFS
);
5464 while (bvec
<= (first_bio
->bi_io_vec
+ first_bio
->bi_vcnt
- 1)) {
5465 if (bio_add_page(bio
, bvec
->bv_page
, bvec
->bv_len
,
5466 bvec
->bv_offset
) < bvec
->bv_len
) {
5467 u64 len
= bio
->bi_iter
.bi_size
;
5469 atomic_inc(&bbio
->stripes_pending
);
5470 submit_stripe_bio(root
, bbio
, bio
, physical
, dev_nr
,
5478 submit_stripe_bio(root
, bbio
, bio
, physical
, dev_nr
, rw
, async
);
5482 static void bbio_error(struct btrfs_bio
*bbio
, struct bio
*bio
, u64 logical
)
5484 atomic_inc(&bbio
->error
);
5485 if (atomic_dec_and_test(&bbio
->stripes_pending
)) {
5486 bio
->bi_private
= bbio
->private;
5487 bio
->bi_end_io
= bbio
->end_io
;
5488 btrfs_io_bio(bio
)->mirror_num
= bbio
->mirror_num
;
5489 bio
->bi_iter
.bi_sector
= logical
>> 9;
5491 bio_endio(bio
, -EIO
);
5495 int btrfs_map_bio(struct btrfs_root
*root
, int rw
, struct bio
*bio
,
5496 int mirror_num
, int async_submit
)
5498 struct btrfs_device
*dev
;
5499 struct bio
*first_bio
= bio
;
5500 u64 logical
= (u64
)bio
->bi_iter
.bi_sector
<< 9;
5503 u64
*raid_map
= NULL
;
5507 struct btrfs_bio
*bbio
= NULL
;
5509 length
= bio
->bi_iter
.bi_size
;
5510 map_length
= length
;
5512 ret
= __btrfs_map_block(root
->fs_info
, rw
, logical
, &map_length
, &bbio
,
5513 mirror_num
, &raid_map
);
5514 if (ret
) /* -ENOMEM */
5517 total_devs
= bbio
->num_stripes
;
5518 bbio
->orig_bio
= first_bio
;
5519 bbio
->private = first_bio
->bi_private
;
5520 bbio
->end_io
= first_bio
->bi_end_io
;
5521 atomic_set(&bbio
->stripes_pending
, bbio
->num_stripes
);
5524 /* In this case, map_length has been set to the length of
5525 a single stripe; not the whole write */
5527 return raid56_parity_write(root
, bio
, bbio
,
5528 raid_map
, map_length
);
5530 return raid56_parity_recover(root
, bio
, bbio
,
5531 raid_map
, map_length
,
5536 if (map_length
< length
) {
5537 btrfs_crit(root
->fs_info
, "mapping failed logical %llu bio len %llu len %llu",
5538 logical
, length
, map_length
);
5542 while (dev_nr
< total_devs
) {
5543 dev
= bbio
->stripes
[dev_nr
].dev
;
5544 if (!dev
|| !dev
->bdev
|| (rw
& WRITE
&& !dev
->writeable
)) {
5545 bbio_error(bbio
, first_bio
, logical
);
5551 * Check and see if we're ok with this bio based on it's size
5552 * and offset with the given device.
5554 if (!bio_size_ok(dev
->bdev
, first_bio
,
5555 bbio
->stripes
[dev_nr
].physical
>> 9)) {
5556 ret
= breakup_stripe_bio(root
, bbio
, first_bio
, dev
,
5557 dev_nr
, rw
, async_submit
);
5563 if (dev_nr
< total_devs
- 1) {
5564 bio
= btrfs_bio_clone(first_bio
, GFP_NOFS
);
5565 BUG_ON(!bio
); /* -ENOMEM */
5570 submit_stripe_bio(root
, bbio
, bio
,
5571 bbio
->stripes
[dev_nr
].physical
, dev_nr
, rw
,
5578 struct btrfs_device
*btrfs_find_device(struct btrfs_fs_info
*fs_info
, u64 devid
,
5581 struct btrfs_device
*device
;
5582 struct btrfs_fs_devices
*cur_devices
;
5584 cur_devices
= fs_info
->fs_devices
;
5585 while (cur_devices
) {
5587 !memcmp(cur_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
5588 device
= __find_device(&cur_devices
->devices
,
5593 cur_devices
= cur_devices
->seed
;
5598 static struct btrfs_device
*add_missing_dev(struct btrfs_root
*root
,
5599 u64 devid
, u8
*dev_uuid
)
5601 struct btrfs_device
*device
;
5602 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
5604 device
= btrfs_alloc_device(NULL
, &devid
, dev_uuid
);
5608 list_add(&device
->dev_list
, &fs_devices
->devices
);
5609 device
->fs_devices
= fs_devices
;
5610 fs_devices
->num_devices
++;
5612 device
->missing
= 1;
5613 fs_devices
->missing_devices
++;
5619 * btrfs_alloc_device - allocate struct btrfs_device
5620 * @fs_info: used only for generating a new devid, can be NULL if
5621 * devid is provided (i.e. @devid != NULL).
5622 * @devid: a pointer to devid for this device. If NULL a new devid
5624 * @uuid: a pointer to UUID for this device. If NULL a new UUID
5627 * Return: a pointer to a new &struct btrfs_device on success; ERR_PTR()
5628 * on error. Returned struct is not linked onto any lists and can be
5629 * destroyed with kfree() right away.
5631 struct btrfs_device
*btrfs_alloc_device(struct btrfs_fs_info
*fs_info
,
5635 struct btrfs_device
*dev
;
5638 if (WARN_ON(!devid
&& !fs_info
))
5639 return ERR_PTR(-EINVAL
);
5641 dev
= __alloc_device();
5650 ret
= find_next_devid(fs_info
, &tmp
);
5653 return ERR_PTR(ret
);
5659 memcpy(dev
->uuid
, uuid
, BTRFS_UUID_SIZE
);
5661 generate_random_uuid(dev
->uuid
);
5663 dev
->work
.func
= pending_bios_fn
;
5668 static int read_one_chunk(struct btrfs_root
*root
, struct btrfs_key
*key
,
5669 struct extent_buffer
*leaf
,
5670 struct btrfs_chunk
*chunk
)
5672 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
5673 struct map_lookup
*map
;
5674 struct extent_map
*em
;
5678 u8 uuid
[BTRFS_UUID_SIZE
];
5683 logical
= key
->offset
;
5684 length
= btrfs_chunk_length(leaf
, chunk
);
5686 read_lock(&map_tree
->map_tree
.lock
);
5687 em
= lookup_extent_mapping(&map_tree
->map_tree
, logical
, 1);
5688 read_unlock(&map_tree
->map_tree
.lock
);
5690 /* already mapped? */
5691 if (em
&& em
->start
<= logical
&& em
->start
+ em
->len
> logical
) {
5692 free_extent_map(em
);
5695 free_extent_map(em
);
5698 em
= alloc_extent_map();
5701 num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
5702 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
5704 free_extent_map(em
);
5708 em
->bdev
= (struct block_device
*)map
;
5709 em
->start
= logical
;
5712 em
->block_start
= 0;
5713 em
->block_len
= em
->len
;
5715 map
->num_stripes
= num_stripes
;
5716 map
->io_width
= btrfs_chunk_io_width(leaf
, chunk
);
5717 map
->io_align
= btrfs_chunk_io_align(leaf
, chunk
);
5718 map
->sector_size
= btrfs_chunk_sector_size(leaf
, chunk
);
5719 map
->stripe_len
= btrfs_chunk_stripe_len(leaf
, chunk
);
5720 map
->type
= btrfs_chunk_type(leaf
, chunk
);
5721 map
->sub_stripes
= btrfs_chunk_sub_stripes(leaf
, chunk
);
5722 for (i
= 0; i
< num_stripes
; i
++) {
5723 map
->stripes
[i
].physical
=
5724 btrfs_stripe_offset_nr(leaf
, chunk
, i
);
5725 devid
= btrfs_stripe_devid_nr(leaf
, chunk
, i
);
5726 read_extent_buffer(leaf
, uuid
, (unsigned long)
5727 btrfs_stripe_dev_uuid_nr(chunk
, i
),
5729 map
->stripes
[i
].dev
= btrfs_find_device(root
->fs_info
, devid
,
5731 if (!map
->stripes
[i
].dev
&& !btrfs_test_opt(root
, DEGRADED
)) {
5733 free_extent_map(em
);
5736 if (!map
->stripes
[i
].dev
) {
5737 map
->stripes
[i
].dev
=
5738 add_missing_dev(root
, devid
, uuid
);
5739 if (!map
->stripes
[i
].dev
) {
5741 free_extent_map(em
);
5745 map
->stripes
[i
].dev
->in_fs_metadata
= 1;
5748 write_lock(&map_tree
->map_tree
.lock
);
5749 ret
= add_extent_mapping(&map_tree
->map_tree
, em
, 0);
5750 write_unlock(&map_tree
->map_tree
.lock
);
5751 BUG_ON(ret
); /* Tree corruption */
5752 free_extent_map(em
);
5757 static void fill_device_from_item(struct extent_buffer
*leaf
,
5758 struct btrfs_dev_item
*dev_item
,
5759 struct btrfs_device
*device
)
5763 device
->devid
= btrfs_device_id(leaf
, dev_item
);
5764 device
->disk_total_bytes
= btrfs_device_total_bytes(leaf
, dev_item
);
5765 device
->total_bytes
= device
->disk_total_bytes
;
5766 device
->bytes_used
= btrfs_device_bytes_used(leaf
, dev_item
);
5767 device
->type
= btrfs_device_type(leaf
, dev_item
);
5768 device
->io_align
= btrfs_device_io_align(leaf
, dev_item
);
5769 device
->io_width
= btrfs_device_io_width(leaf
, dev_item
);
5770 device
->sector_size
= btrfs_device_sector_size(leaf
, dev_item
);
5771 WARN_ON(device
->devid
== BTRFS_DEV_REPLACE_DEVID
);
5772 device
->is_tgtdev_for_dev_replace
= 0;
5774 ptr
= btrfs_device_uuid(dev_item
);
5775 read_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
5778 static int open_seed_devices(struct btrfs_root
*root
, u8
*fsid
)
5780 struct btrfs_fs_devices
*fs_devices
;
5783 BUG_ON(!mutex_is_locked(&uuid_mutex
));
5785 fs_devices
= root
->fs_info
->fs_devices
->seed
;
5786 while (fs_devices
) {
5787 if (!memcmp(fs_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
5791 fs_devices
= fs_devices
->seed
;
5794 fs_devices
= find_fsid(fsid
);
5800 fs_devices
= clone_fs_devices(fs_devices
);
5801 if (IS_ERR(fs_devices
)) {
5802 ret
= PTR_ERR(fs_devices
);
5806 ret
= __btrfs_open_devices(fs_devices
, FMODE_READ
,
5807 root
->fs_info
->bdev_holder
);
5809 free_fs_devices(fs_devices
);
5813 if (!fs_devices
->seeding
) {
5814 __btrfs_close_devices(fs_devices
);
5815 free_fs_devices(fs_devices
);
5820 fs_devices
->seed
= root
->fs_info
->fs_devices
->seed
;
5821 root
->fs_info
->fs_devices
->seed
= fs_devices
;
5826 static int read_one_dev(struct btrfs_root
*root
,
5827 struct extent_buffer
*leaf
,
5828 struct btrfs_dev_item
*dev_item
)
5830 struct btrfs_device
*device
;
5833 u8 fs_uuid
[BTRFS_UUID_SIZE
];
5834 u8 dev_uuid
[BTRFS_UUID_SIZE
];
5836 devid
= btrfs_device_id(leaf
, dev_item
);
5837 read_extent_buffer(leaf
, dev_uuid
, btrfs_device_uuid(dev_item
),
5839 read_extent_buffer(leaf
, fs_uuid
, btrfs_device_fsid(dev_item
),
5842 if (memcmp(fs_uuid
, root
->fs_info
->fsid
, BTRFS_UUID_SIZE
)) {
5843 ret
= open_seed_devices(root
, fs_uuid
);
5844 if (ret
&& !btrfs_test_opt(root
, DEGRADED
))
5848 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
, fs_uuid
);
5849 if (!device
|| !device
->bdev
) {
5850 if (!btrfs_test_opt(root
, DEGRADED
))
5854 btrfs_warn(root
->fs_info
, "devid %llu missing", devid
);
5855 device
= add_missing_dev(root
, devid
, dev_uuid
);
5858 } else if (!device
->missing
) {
5860 * this happens when a device that was properly setup
5861 * in the device info lists suddenly goes bad.
5862 * device->bdev is NULL, and so we have to set
5863 * device->missing to one here
5865 root
->fs_info
->fs_devices
->missing_devices
++;
5866 device
->missing
= 1;
5870 if (device
->fs_devices
!= root
->fs_info
->fs_devices
) {
5871 BUG_ON(device
->writeable
);
5872 if (device
->generation
!=
5873 btrfs_device_generation(leaf
, dev_item
))
5877 fill_device_from_item(leaf
, dev_item
, device
);
5878 device
->in_fs_metadata
= 1;
5879 if (device
->writeable
&& !device
->is_tgtdev_for_dev_replace
) {
5880 device
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
5881 spin_lock(&root
->fs_info
->free_chunk_lock
);
5882 root
->fs_info
->free_chunk_space
+= device
->total_bytes
-
5884 spin_unlock(&root
->fs_info
->free_chunk_lock
);
5890 int btrfs_read_sys_array(struct btrfs_root
*root
)
5892 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
5893 struct extent_buffer
*sb
;
5894 struct btrfs_disk_key
*disk_key
;
5895 struct btrfs_chunk
*chunk
;
5897 unsigned long sb_ptr
;
5903 struct btrfs_key key
;
5905 sb
= btrfs_find_create_tree_block(root
, BTRFS_SUPER_INFO_OFFSET
,
5906 BTRFS_SUPER_INFO_SIZE
);
5909 btrfs_set_buffer_uptodate(sb
);
5910 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, sb
, 0);
5912 * The sb extent buffer is artifical and just used to read the system array.
5913 * btrfs_set_buffer_uptodate() call does not properly mark all it's
5914 * pages up-to-date when the page is larger: extent does not cover the
5915 * whole page and consequently check_page_uptodate does not find all
5916 * the page's extents up-to-date (the hole beyond sb),
5917 * write_extent_buffer then triggers a WARN_ON.
5919 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
5920 * but sb spans only this function. Add an explicit SetPageUptodate call
5921 * to silence the warning eg. on PowerPC 64.
5923 if (PAGE_CACHE_SIZE
> BTRFS_SUPER_INFO_SIZE
)
5924 SetPageUptodate(sb
->pages
[0]);
5926 write_extent_buffer(sb
, super_copy
, 0, BTRFS_SUPER_INFO_SIZE
);
5927 array_size
= btrfs_super_sys_array_size(super_copy
);
5929 ptr
= super_copy
->sys_chunk_array
;
5930 sb_ptr
= offsetof(struct btrfs_super_block
, sys_chunk_array
);
5933 while (cur
< array_size
) {
5934 disk_key
= (struct btrfs_disk_key
*)ptr
;
5935 btrfs_disk_key_to_cpu(&key
, disk_key
);
5937 len
= sizeof(*disk_key
); ptr
+= len
;
5941 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
5942 chunk
= (struct btrfs_chunk
*)sb_ptr
;
5943 ret
= read_one_chunk(root
, &key
, sb
, chunk
);
5946 num_stripes
= btrfs_chunk_num_stripes(sb
, chunk
);
5947 len
= btrfs_chunk_item_size(num_stripes
);
5956 free_extent_buffer(sb
);
5960 int btrfs_read_chunk_tree(struct btrfs_root
*root
)
5962 struct btrfs_path
*path
;
5963 struct extent_buffer
*leaf
;
5964 struct btrfs_key key
;
5965 struct btrfs_key found_key
;
5969 root
= root
->fs_info
->chunk_root
;
5971 path
= btrfs_alloc_path();
5975 mutex_lock(&uuid_mutex
);
5979 * Read all device items, and then all the chunk items. All
5980 * device items are found before any chunk item (their object id
5981 * is smaller than the lowest possible object id for a chunk
5982 * item - BTRFS_FIRST_CHUNK_TREE_OBJECTID).
5984 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
5987 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
5991 leaf
= path
->nodes
[0];
5992 slot
= path
->slots
[0];
5993 if (slot
>= btrfs_header_nritems(leaf
)) {
5994 ret
= btrfs_next_leaf(root
, path
);
6001 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
6002 if (found_key
.type
== BTRFS_DEV_ITEM_KEY
) {
6003 struct btrfs_dev_item
*dev_item
;
6004 dev_item
= btrfs_item_ptr(leaf
, slot
,
6005 struct btrfs_dev_item
);
6006 ret
= read_one_dev(root
, leaf
, dev_item
);
6009 } else if (found_key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
6010 struct btrfs_chunk
*chunk
;
6011 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
6012 ret
= read_one_chunk(root
, &found_key
, leaf
, chunk
);
6020 unlock_chunks(root
);
6021 mutex_unlock(&uuid_mutex
);
6023 btrfs_free_path(path
);
6027 void btrfs_init_devices_late(struct btrfs_fs_info
*fs_info
)
6029 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
6030 struct btrfs_device
*device
;
6032 mutex_lock(&fs_devices
->device_list_mutex
);
6033 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
)
6034 device
->dev_root
= fs_info
->dev_root
;
6035 mutex_unlock(&fs_devices
->device_list_mutex
);
6038 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
)
6042 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
6043 btrfs_dev_stat_reset(dev
, i
);
6046 int btrfs_init_dev_stats(struct btrfs_fs_info
*fs_info
)
6048 struct btrfs_key key
;
6049 struct btrfs_key found_key
;
6050 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
6051 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
6052 struct extent_buffer
*eb
;
6055 struct btrfs_device
*device
;
6056 struct btrfs_path
*path
= NULL
;
6059 path
= btrfs_alloc_path();
6065 mutex_lock(&fs_devices
->device_list_mutex
);
6066 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
6068 struct btrfs_dev_stats_item
*ptr
;
6071 key
.type
= BTRFS_DEV_STATS_KEY
;
6072 key
.offset
= device
->devid
;
6073 ret
= btrfs_search_slot(NULL
, dev_root
, &key
, path
, 0, 0);
6075 __btrfs_reset_dev_stats(device
);
6076 device
->dev_stats_valid
= 1;
6077 btrfs_release_path(path
);
6080 slot
= path
->slots
[0];
6081 eb
= path
->nodes
[0];
6082 btrfs_item_key_to_cpu(eb
, &found_key
, slot
);
6083 item_size
= btrfs_item_size_nr(eb
, slot
);
6085 ptr
= btrfs_item_ptr(eb
, slot
,
6086 struct btrfs_dev_stats_item
);
6088 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
6089 if (item_size
>= (1 + i
) * sizeof(__le64
))
6090 btrfs_dev_stat_set(device
, i
,
6091 btrfs_dev_stats_value(eb
, ptr
, i
));
6093 btrfs_dev_stat_reset(device
, i
);
6096 device
->dev_stats_valid
= 1;
6097 btrfs_dev_stat_print_on_load(device
);
6098 btrfs_release_path(path
);
6100 mutex_unlock(&fs_devices
->device_list_mutex
);
6103 btrfs_free_path(path
);
6104 return ret
< 0 ? ret
: 0;
6107 static int update_dev_stat_item(struct btrfs_trans_handle
*trans
,
6108 struct btrfs_root
*dev_root
,
6109 struct btrfs_device
*device
)
6111 struct btrfs_path
*path
;
6112 struct btrfs_key key
;
6113 struct extent_buffer
*eb
;
6114 struct btrfs_dev_stats_item
*ptr
;
6119 key
.type
= BTRFS_DEV_STATS_KEY
;
6120 key
.offset
= device
->devid
;
6122 path
= btrfs_alloc_path();
6124 ret
= btrfs_search_slot(trans
, dev_root
, &key
, path
, -1, 1);
6126 printk_in_rcu(KERN_WARNING
"btrfs: error %d while searching for dev_stats item for device %s!\n",
6127 ret
, rcu_str_deref(device
->name
));
6132 btrfs_item_size_nr(path
->nodes
[0], path
->slots
[0]) < sizeof(*ptr
)) {
6133 /* need to delete old one and insert a new one */
6134 ret
= btrfs_del_item(trans
, dev_root
, path
);
6136 printk_in_rcu(KERN_WARNING
"btrfs: delete too small dev_stats item for device %s failed %d!\n",
6137 rcu_str_deref(device
->name
), ret
);
6144 /* need to insert a new item */
6145 btrfs_release_path(path
);
6146 ret
= btrfs_insert_empty_item(trans
, dev_root
, path
,
6147 &key
, sizeof(*ptr
));
6149 printk_in_rcu(KERN_WARNING
"btrfs: insert dev_stats item for device %s failed %d!\n",
6150 rcu_str_deref(device
->name
), ret
);
6155 eb
= path
->nodes
[0];
6156 ptr
= btrfs_item_ptr(eb
, path
->slots
[0], struct btrfs_dev_stats_item
);
6157 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
6158 btrfs_set_dev_stats_value(eb
, ptr
, i
,
6159 btrfs_dev_stat_read(device
, i
));
6160 btrfs_mark_buffer_dirty(eb
);
6163 btrfs_free_path(path
);
6168 * called from commit_transaction. Writes all changed device stats to disk.
6170 int btrfs_run_dev_stats(struct btrfs_trans_handle
*trans
,
6171 struct btrfs_fs_info
*fs_info
)
6173 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
6174 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
6175 struct btrfs_device
*device
;
6178 mutex_lock(&fs_devices
->device_list_mutex
);
6179 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
6180 if (!device
->dev_stats_valid
|| !device
->dev_stats_dirty
)
6183 ret
= update_dev_stat_item(trans
, dev_root
, device
);
6185 device
->dev_stats_dirty
= 0;
6187 mutex_unlock(&fs_devices
->device_list_mutex
);
6192 void btrfs_dev_stat_inc_and_print(struct btrfs_device
*dev
, int index
)
6194 btrfs_dev_stat_inc(dev
, index
);
6195 btrfs_dev_stat_print_on_error(dev
);
6198 static void btrfs_dev_stat_print_on_error(struct btrfs_device
*dev
)
6200 if (!dev
->dev_stats_valid
)
6202 printk_ratelimited_in_rcu(KERN_ERR
6203 "btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
6204 rcu_str_deref(dev
->name
),
6205 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
6206 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
6207 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
6208 btrfs_dev_stat_read(dev
,
6209 BTRFS_DEV_STAT_CORRUPTION_ERRS
),
6210 btrfs_dev_stat_read(dev
,
6211 BTRFS_DEV_STAT_GENERATION_ERRS
));
6214 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*dev
)
6218 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
6219 if (btrfs_dev_stat_read(dev
, i
) != 0)
6221 if (i
== BTRFS_DEV_STAT_VALUES_MAX
)
6222 return; /* all values == 0, suppress message */
6224 printk_in_rcu(KERN_INFO
"btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
6225 rcu_str_deref(dev
->name
),
6226 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
6227 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
6228 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
6229 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_CORRUPTION_ERRS
),
6230 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_GENERATION_ERRS
));
6233 int btrfs_get_dev_stats(struct btrfs_root
*root
,
6234 struct btrfs_ioctl_get_dev_stats
*stats
)
6236 struct btrfs_device
*dev
;
6237 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
6240 mutex_lock(&fs_devices
->device_list_mutex
);
6241 dev
= btrfs_find_device(root
->fs_info
, stats
->devid
, NULL
, NULL
);
6242 mutex_unlock(&fs_devices
->device_list_mutex
);
6246 "btrfs: get dev_stats failed, device not found\n");
6248 } else if (!dev
->dev_stats_valid
) {
6250 "btrfs: get dev_stats failed, not yet valid\n");
6252 } else if (stats
->flags
& BTRFS_DEV_STATS_RESET
) {
6253 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
6254 if (stats
->nr_items
> i
)
6256 btrfs_dev_stat_read_and_reset(dev
, i
);
6258 btrfs_dev_stat_reset(dev
, i
);
6261 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
6262 if (stats
->nr_items
> i
)
6263 stats
->values
[i
] = btrfs_dev_stat_read(dev
, i
);
6265 if (stats
->nr_items
> BTRFS_DEV_STAT_VALUES_MAX
)
6266 stats
->nr_items
= BTRFS_DEV_STAT_VALUES_MAX
;
6270 int btrfs_scratch_superblock(struct btrfs_device
*device
)
6272 struct buffer_head
*bh
;
6273 struct btrfs_super_block
*disk_super
;
6275 bh
= btrfs_read_dev_super(device
->bdev
);
6278 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
6280 memset(&disk_super
->magic
, 0, sizeof(disk_super
->magic
));
6281 set_buffer_dirty(bh
);
6282 sync_dirty_buffer(bh
);