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>
30 #include "extent_map.h"
32 #include "transaction.h"
33 #include "print-tree.h"
35 #include "async-thread.h"
36 #include "check-integrity.h"
37 #include "rcu-string.h"
39 #include "dev-replace.h"
41 static int init_first_rw_device(struct btrfs_trans_handle
*trans
,
42 struct btrfs_root
*root
,
43 struct btrfs_device
*device
);
44 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
);
45 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
);
46 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*device
);
48 static DEFINE_MUTEX(uuid_mutex
);
49 static LIST_HEAD(fs_uuids
);
51 static void lock_chunks(struct btrfs_root
*root
)
53 mutex_lock(&root
->fs_info
->chunk_mutex
);
56 static void unlock_chunks(struct btrfs_root
*root
)
58 mutex_unlock(&root
->fs_info
->chunk_mutex
);
61 static void free_fs_devices(struct btrfs_fs_devices
*fs_devices
)
63 struct btrfs_device
*device
;
64 WARN_ON(fs_devices
->opened
);
65 while (!list_empty(&fs_devices
->devices
)) {
66 device
= list_entry(fs_devices
->devices
.next
,
67 struct btrfs_device
, dev_list
);
68 list_del(&device
->dev_list
);
69 rcu_string_free(device
->name
);
75 static void btrfs_kobject_uevent(struct block_device
*bdev
,
76 enum kobject_action action
)
80 ret
= kobject_uevent(&disk_to_dev(bdev
->bd_disk
)->kobj
, action
);
82 pr_warn("Sending event '%d' to kobject: '%s' (%p): failed\n",
84 kobject_name(&disk_to_dev(bdev
->bd_disk
)->kobj
),
85 &disk_to_dev(bdev
->bd_disk
)->kobj
);
88 void btrfs_cleanup_fs_uuids(void)
90 struct btrfs_fs_devices
*fs_devices
;
92 while (!list_empty(&fs_uuids
)) {
93 fs_devices
= list_entry(fs_uuids
.next
,
94 struct btrfs_fs_devices
, list
);
95 list_del(&fs_devices
->list
);
96 free_fs_devices(fs_devices
);
100 static noinline
struct btrfs_device
*__find_device(struct list_head
*head
,
103 struct btrfs_device
*dev
;
105 list_for_each_entry(dev
, head
, dev_list
) {
106 if (dev
->devid
== devid
&&
107 (!uuid
|| !memcmp(dev
->uuid
, uuid
, BTRFS_UUID_SIZE
))) {
114 static noinline
struct btrfs_fs_devices
*find_fsid(u8
*fsid
)
116 struct btrfs_fs_devices
*fs_devices
;
118 list_for_each_entry(fs_devices
, &fs_uuids
, list
) {
119 if (memcmp(fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
) == 0)
126 btrfs_get_bdev_and_sb(const char *device_path
, fmode_t flags
, void *holder
,
127 int flush
, struct block_device
**bdev
,
128 struct buffer_head
**bh
)
132 *bdev
= blkdev_get_by_path(device_path
, flags
, holder
);
135 ret
= PTR_ERR(*bdev
);
136 printk(KERN_INFO
"btrfs: open %s failed\n", device_path
);
141 filemap_write_and_wait((*bdev
)->bd_inode
->i_mapping
);
142 ret
= set_blocksize(*bdev
, 4096);
144 blkdev_put(*bdev
, flags
);
147 invalidate_bdev(*bdev
);
148 *bh
= btrfs_read_dev_super(*bdev
);
151 blkdev_put(*bdev
, flags
);
163 static void requeue_list(struct btrfs_pending_bios
*pending_bios
,
164 struct bio
*head
, struct bio
*tail
)
167 struct bio
*old_head
;
169 old_head
= pending_bios
->head
;
170 pending_bios
->head
= head
;
171 if (pending_bios
->tail
)
172 tail
->bi_next
= old_head
;
174 pending_bios
->tail
= tail
;
178 * we try to collect pending bios for a device so we don't get a large
179 * number of procs sending bios down to the same device. This greatly
180 * improves the schedulers ability to collect and merge the bios.
182 * But, it also turns into a long list of bios to process and that is sure
183 * to eventually make the worker thread block. The solution here is to
184 * make some progress and then put this work struct back at the end of
185 * the list if the block device is congested. This way, multiple devices
186 * can make progress from a single worker thread.
188 static noinline
void run_scheduled_bios(struct btrfs_device
*device
)
191 struct backing_dev_info
*bdi
;
192 struct btrfs_fs_info
*fs_info
;
193 struct btrfs_pending_bios
*pending_bios
;
197 unsigned long num_run
;
198 unsigned long batch_run
= 0;
200 unsigned long last_waited
= 0;
202 int sync_pending
= 0;
203 struct blk_plug plug
;
206 * this function runs all the bios we've collected for
207 * a particular device. We don't want to wander off to
208 * another device without first sending all of these down.
209 * So, setup a plug here and finish it off before we return
211 blk_start_plug(&plug
);
213 bdi
= blk_get_backing_dev_info(device
->bdev
);
214 fs_info
= device
->dev_root
->fs_info
;
215 limit
= btrfs_async_submit_limit(fs_info
);
216 limit
= limit
* 2 / 3;
219 spin_lock(&device
->io_lock
);
224 /* take all the bios off the list at once and process them
225 * later on (without the lock held). But, remember the
226 * tail and other pointers so the bios can be properly reinserted
227 * into the list if we hit congestion
229 if (!force_reg
&& device
->pending_sync_bios
.head
) {
230 pending_bios
= &device
->pending_sync_bios
;
233 pending_bios
= &device
->pending_bios
;
237 pending
= pending_bios
->head
;
238 tail
= pending_bios
->tail
;
239 WARN_ON(pending
&& !tail
);
242 * if pending was null this time around, no bios need processing
243 * at all and we can stop. Otherwise it'll loop back up again
244 * and do an additional check so no bios are missed.
246 * device->running_pending is used to synchronize with the
249 if (device
->pending_sync_bios
.head
== NULL
&&
250 device
->pending_bios
.head
== NULL
) {
252 device
->running_pending
= 0;
255 device
->running_pending
= 1;
258 pending_bios
->head
= NULL
;
259 pending_bios
->tail
= NULL
;
261 spin_unlock(&device
->io_lock
);
266 /* we want to work on both lists, but do more bios on the
267 * sync list than the regular list
270 pending_bios
!= &device
->pending_sync_bios
&&
271 device
->pending_sync_bios
.head
) ||
272 (num_run
> 64 && pending_bios
== &device
->pending_sync_bios
&&
273 device
->pending_bios
.head
)) {
274 spin_lock(&device
->io_lock
);
275 requeue_list(pending_bios
, pending
, tail
);
280 pending
= pending
->bi_next
;
283 if (atomic_dec_return(&fs_info
->nr_async_bios
) < limit
&&
284 waitqueue_active(&fs_info
->async_submit_wait
))
285 wake_up(&fs_info
->async_submit_wait
);
287 BUG_ON(atomic_read(&cur
->bi_cnt
) == 0);
290 * if we're doing the sync list, record that our
291 * plug has some sync requests on it
293 * If we're doing the regular list and there are
294 * sync requests sitting around, unplug before
297 if (pending_bios
== &device
->pending_sync_bios
) {
299 } else if (sync_pending
) {
300 blk_finish_plug(&plug
);
301 blk_start_plug(&plug
);
305 btrfsic_submit_bio(cur
->bi_rw
, cur
);
312 * we made progress, there is more work to do and the bdi
313 * is now congested. Back off and let other work structs
316 if (pending
&& bdi_write_congested(bdi
) && batch_run
> 8 &&
317 fs_info
->fs_devices
->open_devices
> 1) {
318 struct io_context
*ioc
;
320 ioc
= current
->io_context
;
323 * the main goal here is that we don't want to
324 * block if we're going to be able to submit
325 * more requests without blocking.
327 * This code does two great things, it pokes into
328 * the elevator code from a filesystem _and_
329 * it makes assumptions about how batching works.
331 if (ioc
&& ioc
->nr_batch_requests
> 0 &&
332 time_before(jiffies
, ioc
->last_waited
+ HZ
/50UL) &&
334 ioc
->last_waited
== last_waited
)) {
336 * we want to go through our batch of
337 * requests and stop. So, we copy out
338 * the ioc->last_waited time and test
339 * against it before looping
341 last_waited
= ioc
->last_waited
;
346 spin_lock(&device
->io_lock
);
347 requeue_list(pending_bios
, pending
, tail
);
348 device
->running_pending
= 1;
350 spin_unlock(&device
->io_lock
);
351 btrfs_requeue_work(&device
->work
);
354 /* unplug every 64 requests just for good measure */
355 if (batch_run
% 64 == 0) {
356 blk_finish_plug(&plug
);
357 blk_start_plug(&plug
);
366 spin_lock(&device
->io_lock
);
367 if (device
->pending_bios
.head
|| device
->pending_sync_bios
.head
)
369 spin_unlock(&device
->io_lock
);
372 blk_finish_plug(&plug
);
375 static void pending_bios_fn(struct btrfs_work
*work
)
377 struct btrfs_device
*device
;
379 device
= container_of(work
, struct btrfs_device
, work
);
380 run_scheduled_bios(device
);
383 static noinline
int device_list_add(const char *path
,
384 struct btrfs_super_block
*disk_super
,
385 u64 devid
, struct btrfs_fs_devices
**fs_devices_ret
)
387 struct btrfs_device
*device
;
388 struct btrfs_fs_devices
*fs_devices
;
389 struct rcu_string
*name
;
390 u64 found_transid
= btrfs_super_generation(disk_super
);
392 fs_devices
= find_fsid(disk_super
->fsid
);
394 fs_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
397 INIT_LIST_HEAD(&fs_devices
->devices
);
398 INIT_LIST_HEAD(&fs_devices
->alloc_list
);
399 list_add(&fs_devices
->list
, &fs_uuids
);
400 memcpy(fs_devices
->fsid
, disk_super
->fsid
, BTRFS_FSID_SIZE
);
401 fs_devices
->latest_devid
= devid
;
402 fs_devices
->latest_trans
= found_transid
;
403 mutex_init(&fs_devices
->device_list_mutex
);
406 device
= __find_device(&fs_devices
->devices
, devid
,
407 disk_super
->dev_item
.uuid
);
410 if (fs_devices
->opened
)
413 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
415 /* we can safely leave the fs_devices entry around */
418 device
->devid
= devid
;
419 device
->dev_stats_valid
= 0;
420 device
->work
.func
= pending_bios_fn
;
421 memcpy(device
->uuid
, disk_super
->dev_item
.uuid
,
423 spin_lock_init(&device
->io_lock
);
425 name
= rcu_string_strdup(path
, GFP_NOFS
);
430 rcu_assign_pointer(device
->name
, name
);
431 INIT_LIST_HEAD(&device
->dev_alloc_list
);
433 /* init readahead state */
434 spin_lock_init(&device
->reada_lock
);
435 device
->reada_curr_zone
= NULL
;
436 atomic_set(&device
->reada_in_flight
, 0);
437 device
->reada_next
= 0;
438 INIT_RADIX_TREE(&device
->reada_zones
, GFP_NOFS
& ~__GFP_WAIT
);
439 INIT_RADIX_TREE(&device
->reada_extents
, GFP_NOFS
& ~__GFP_WAIT
);
441 mutex_lock(&fs_devices
->device_list_mutex
);
442 list_add_rcu(&device
->dev_list
, &fs_devices
->devices
);
443 mutex_unlock(&fs_devices
->device_list_mutex
);
445 device
->fs_devices
= fs_devices
;
446 fs_devices
->num_devices
++;
447 } else if (!device
->name
|| strcmp(device
->name
->str
, path
)) {
448 name
= rcu_string_strdup(path
, GFP_NOFS
);
451 rcu_string_free(device
->name
);
452 rcu_assign_pointer(device
->name
, name
);
453 if (device
->missing
) {
454 fs_devices
->missing_devices
--;
459 if (found_transid
> fs_devices
->latest_trans
) {
460 fs_devices
->latest_devid
= devid
;
461 fs_devices
->latest_trans
= found_transid
;
463 *fs_devices_ret
= fs_devices
;
467 static struct btrfs_fs_devices
*clone_fs_devices(struct btrfs_fs_devices
*orig
)
469 struct btrfs_fs_devices
*fs_devices
;
470 struct btrfs_device
*device
;
471 struct btrfs_device
*orig_dev
;
473 fs_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
475 return ERR_PTR(-ENOMEM
);
477 INIT_LIST_HEAD(&fs_devices
->devices
);
478 INIT_LIST_HEAD(&fs_devices
->alloc_list
);
479 INIT_LIST_HEAD(&fs_devices
->list
);
480 mutex_init(&fs_devices
->device_list_mutex
);
481 fs_devices
->latest_devid
= orig
->latest_devid
;
482 fs_devices
->latest_trans
= orig
->latest_trans
;
483 fs_devices
->total_devices
= orig
->total_devices
;
484 memcpy(fs_devices
->fsid
, orig
->fsid
, sizeof(fs_devices
->fsid
));
486 /* We have held the volume lock, it is safe to get the devices. */
487 list_for_each_entry(orig_dev
, &orig
->devices
, dev_list
) {
488 struct rcu_string
*name
;
490 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
495 * This is ok to do without rcu read locked because we hold the
496 * uuid mutex so nothing we touch in here is going to disappear.
498 name
= rcu_string_strdup(orig_dev
->name
->str
, GFP_NOFS
);
503 rcu_assign_pointer(device
->name
, name
);
505 device
->devid
= orig_dev
->devid
;
506 device
->work
.func
= pending_bios_fn
;
507 memcpy(device
->uuid
, orig_dev
->uuid
, sizeof(device
->uuid
));
508 spin_lock_init(&device
->io_lock
);
509 INIT_LIST_HEAD(&device
->dev_list
);
510 INIT_LIST_HEAD(&device
->dev_alloc_list
);
512 list_add(&device
->dev_list
, &fs_devices
->devices
);
513 device
->fs_devices
= fs_devices
;
514 fs_devices
->num_devices
++;
518 free_fs_devices(fs_devices
);
519 return ERR_PTR(-ENOMEM
);
522 void btrfs_close_extra_devices(struct btrfs_fs_info
*fs_info
,
523 struct btrfs_fs_devices
*fs_devices
, int step
)
525 struct btrfs_device
*device
, *next
;
527 struct block_device
*latest_bdev
= NULL
;
528 u64 latest_devid
= 0;
529 u64 latest_transid
= 0;
531 mutex_lock(&uuid_mutex
);
533 /* This is the initialized path, it is safe to release the devices. */
534 list_for_each_entry_safe(device
, next
, &fs_devices
->devices
, dev_list
) {
535 if (device
->in_fs_metadata
) {
536 if (!device
->is_tgtdev_for_dev_replace
&&
538 device
->generation
> latest_transid
)) {
539 latest_devid
= device
->devid
;
540 latest_transid
= device
->generation
;
541 latest_bdev
= device
->bdev
;
546 if (device
->devid
== BTRFS_DEV_REPLACE_DEVID
) {
548 * In the first step, keep the device which has
549 * the correct fsid and the devid that is used
550 * for the dev_replace procedure.
551 * In the second step, the dev_replace state is
552 * read from the device tree and it is known
553 * whether the procedure is really active or
554 * not, which means whether this device is
555 * used or whether it should be removed.
557 if (step
== 0 || device
->is_tgtdev_for_dev_replace
) {
562 blkdev_put(device
->bdev
, device
->mode
);
564 fs_devices
->open_devices
--;
566 if (device
->writeable
) {
567 list_del_init(&device
->dev_alloc_list
);
568 device
->writeable
= 0;
569 if (!device
->is_tgtdev_for_dev_replace
)
570 fs_devices
->rw_devices
--;
572 list_del_init(&device
->dev_list
);
573 fs_devices
->num_devices
--;
574 rcu_string_free(device
->name
);
578 if (fs_devices
->seed
) {
579 fs_devices
= fs_devices
->seed
;
583 fs_devices
->latest_bdev
= latest_bdev
;
584 fs_devices
->latest_devid
= latest_devid
;
585 fs_devices
->latest_trans
= latest_transid
;
587 mutex_unlock(&uuid_mutex
);
590 static void __free_device(struct work_struct
*work
)
592 struct btrfs_device
*device
;
594 device
= container_of(work
, struct btrfs_device
, rcu_work
);
597 blkdev_put(device
->bdev
, device
->mode
);
599 rcu_string_free(device
->name
);
603 static void free_device(struct rcu_head
*head
)
605 struct btrfs_device
*device
;
607 device
= container_of(head
, struct btrfs_device
, rcu
);
609 INIT_WORK(&device
->rcu_work
, __free_device
);
610 schedule_work(&device
->rcu_work
);
613 static int __btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
615 struct btrfs_device
*device
;
617 if (--fs_devices
->opened
> 0)
620 mutex_lock(&fs_devices
->device_list_mutex
);
621 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
622 struct btrfs_device
*new_device
;
623 struct rcu_string
*name
;
626 fs_devices
->open_devices
--;
628 if (device
->writeable
&& !device
->is_tgtdev_for_dev_replace
) {
629 list_del_init(&device
->dev_alloc_list
);
630 fs_devices
->rw_devices
--;
633 if (device
->can_discard
)
634 fs_devices
->num_can_discard
--;
636 new_device
= kmalloc(sizeof(*new_device
), GFP_NOFS
);
637 BUG_ON(!new_device
); /* -ENOMEM */
638 memcpy(new_device
, device
, sizeof(*new_device
));
640 /* Safe because we are under uuid_mutex */
642 name
= rcu_string_strdup(device
->name
->str
, GFP_NOFS
);
643 BUG_ON(device
->name
&& !name
); /* -ENOMEM */
644 rcu_assign_pointer(new_device
->name
, name
);
646 new_device
->bdev
= NULL
;
647 new_device
->writeable
= 0;
648 new_device
->in_fs_metadata
= 0;
649 new_device
->can_discard
= 0;
650 list_replace_rcu(&device
->dev_list
, &new_device
->dev_list
);
652 call_rcu(&device
->rcu
, free_device
);
654 mutex_unlock(&fs_devices
->device_list_mutex
);
656 WARN_ON(fs_devices
->open_devices
);
657 WARN_ON(fs_devices
->rw_devices
);
658 fs_devices
->opened
= 0;
659 fs_devices
->seeding
= 0;
664 int btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
666 struct btrfs_fs_devices
*seed_devices
= NULL
;
669 mutex_lock(&uuid_mutex
);
670 ret
= __btrfs_close_devices(fs_devices
);
671 if (!fs_devices
->opened
) {
672 seed_devices
= fs_devices
->seed
;
673 fs_devices
->seed
= NULL
;
675 mutex_unlock(&uuid_mutex
);
677 while (seed_devices
) {
678 fs_devices
= seed_devices
;
679 seed_devices
= fs_devices
->seed
;
680 __btrfs_close_devices(fs_devices
);
681 free_fs_devices(fs_devices
);
686 static int __btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
687 fmode_t flags
, void *holder
)
689 struct request_queue
*q
;
690 struct block_device
*bdev
;
691 struct list_head
*head
= &fs_devices
->devices
;
692 struct btrfs_device
*device
;
693 struct block_device
*latest_bdev
= NULL
;
694 struct buffer_head
*bh
;
695 struct btrfs_super_block
*disk_super
;
696 u64 latest_devid
= 0;
697 u64 latest_transid
= 0;
704 list_for_each_entry(device
, head
, dev_list
) {
710 ret
= btrfs_get_bdev_and_sb(device
->name
->str
, flags
, holder
, 1,
715 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
716 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
717 if (devid
!= device
->devid
)
720 if (memcmp(device
->uuid
, disk_super
->dev_item
.uuid
,
724 device
->generation
= btrfs_super_generation(disk_super
);
725 if (!latest_transid
|| device
->generation
> latest_transid
) {
726 latest_devid
= devid
;
727 latest_transid
= device
->generation
;
731 if (btrfs_super_flags(disk_super
) & BTRFS_SUPER_FLAG_SEEDING
) {
732 device
->writeable
= 0;
734 device
->writeable
= !bdev_read_only(bdev
);
738 q
= bdev_get_queue(bdev
);
739 if (blk_queue_discard(q
)) {
740 device
->can_discard
= 1;
741 fs_devices
->num_can_discard
++;
745 device
->in_fs_metadata
= 0;
746 device
->mode
= flags
;
748 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
749 fs_devices
->rotating
= 1;
751 fs_devices
->open_devices
++;
752 if (device
->writeable
&& !device
->is_tgtdev_for_dev_replace
) {
753 fs_devices
->rw_devices
++;
754 list_add(&device
->dev_alloc_list
,
755 &fs_devices
->alloc_list
);
762 blkdev_put(bdev
, flags
);
765 if (fs_devices
->open_devices
== 0) {
769 fs_devices
->seeding
= seeding
;
770 fs_devices
->opened
= 1;
771 fs_devices
->latest_bdev
= latest_bdev
;
772 fs_devices
->latest_devid
= latest_devid
;
773 fs_devices
->latest_trans
= latest_transid
;
774 fs_devices
->total_rw_bytes
= 0;
779 int btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
780 fmode_t flags
, void *holder
)
784 mutex_lock(&uuid_mutex
);
785 if (fs_devices
->opened
) {
786 fs_devices
->opened
++;
789 ret
= __btrfs_open_devices(fs_devices
, flags
, holder
);
791 mutex_unlock(&uuid_mutex
);
796 * Look for a btrfs signature on a device. This may be called out of the mount path
797 * and we are not allowed to call set_blocksize during the scan. The superblock
798 * is read via pagecache
800 int btrfs_scan_one_device(const char *path
, fmode_t flags
, void *holder
,
801 struct btrfs_fs_devices
**fs_devices_ret
)
803 struct btrfs_super_block
*disk_super
;
804 struct block_device
*bdev
;
815 * we would like to check all the supers, but that would make
816 * a btrfs mount succeed after a mkfs from a different FS.
817 * So, we need to add a special mount option to scan for
818 * later supers, using BTRFS_SUPER_MIRROR_MAX instead
820 bytenr
= btrfs_sb_offset(0);
822 mutex_lock(&uuid_mutex
);
824 bdev
= blkdev_get_by_path(path
, flags
, holder
);
828 printk(KERN_INFO
"btrfs: open %s failed\n", path
);
832 /* make sure our super fits in the device */
833 if (bytenr
+ PAGE_CACHE_SIZE
>= i_size_read(bdev
->bd_inode
))
836 /* make sure our super fits in the page */
837 if (sizeof(*disk_super
) > PAGE_CACHE_SIZE
)
840 /* make sure our super doesn't straddle pages on disk */
841 index
= bytenr
>> PAGE_CACHE_SHIFT
;
842 if ((bytenr
+ sizeof(*disk_super
) - 1) >> PAGE_CACHE_SHIFT
!= index
)
845 /* pull in the page with our super */
846 page
= read_cache_page_gfp(bdev
->bd_inode
->i_mapping
,
849 if (IS_ERR_OR_NULL(page
))
854 /* align our pointer to the offset of the super block */
855 disk_super
= p
+ (bytenr
& ~PAGE_CACHE_MASK
);
857 if (btrfs_super_bytenr(disk_super
) != bytenr
||
858 strncmp((char *)(&disk_super
->magic
), BTRFS_MAGIC
,
859 sizeof(disk_super
->magic
)))
862 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
863 transid
= btrfs_super_generation(disk_super
);
864 total_devices
= btrfs_super_num_devices(disk_super
);
866 if (disk_super
->label
[0]) {
867 if (disk_super
->label
[BTRFS_LABEL_SIZE
- 1])
868 disk_super
->label
[BTRFS_LABEL_SIZE
- 1] = '\0';
869 printk(KERN_INFO
"device label %s ", disk_super
->label
);
871 printk(KERN_INFO
"device fsid %pU ", disk_super
->fsid
);
874 printk(KERN_CONT
"devid %llu transid %llu %s\n",
875 (unsigned long long)devid
, (unsigned long long)transid
, path
);
877 ret
= device_list_add(path
, disk_super
, devid
, fs_devices_ret
);
878 if (!ret
&& fs_devices_ret
)
879 (*fs_devices_ret
)->total_devices
= total_devices
;
883 page_cache_release(page
);
886 blkdev_put(bdev
, flags
);
888 mutex_unlock(&uuid_mutex
);
892 /* helper to account the used device space in the range */
893 int btrfs_account_dev_extents_size(struct btrfs_device
*device
, u64 start
,
894 u64 end
, u64
*length
)
896 struct btrfs_key key
;
897 struct btrfs_root
*root
= device
->dev_root
;
898 struct btrfs_dev_extent
*dev_extent
;
899 struct btrfs_path
*path
;
903 struct extent_buffer
*l
;
907 if (start
>= device
->total_bytes
|| device
->is_tgtdev_for_dev_replace
)
910 path
= btrfs_alloc_path();
915 key
.objectid
= device
->devid
;
917 key
.type
= BTRFS_DEV_EXTENT_KEY
;
919 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
923 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
930 slot
= path
->slots
[0];
931 if (slot
>= btrfs_header_nritems(l
)) {
932 ret
= btrfs_next_leaf(root
, path
);
940 btrfs_item_key_to_cpu(l
, &key
, slot
);
942 if (key
.objectid
< device
->devid
)
945 if (key
.objectid
> device
->devid
)
948 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
951 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
952 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
954 if (key
.offset
<= start
&& extent_end
> end
) {
955 *length
= end
- start
+ 1;
957 } else if (key
.offset
<= start
&& extent_end
> start
)
958 *length
+= extent_end
- start
;
959 else if (key
.offset
> start
&& extent_end
<= end
)
960 *length
+= extent_end
- key
.offset
;
961 else if (key
.offset
> start
&& key
.offset
<= end
) {
962 *length
+= end
- key
.offset
+ 1;
964 } else if (key
.offset
> end
)
972 btrfs_free_path(path
);
977 * find_free_dev_extent - find free space in the specified device
978 * @device: the device which we search the free space in
979 * @num_bytes: the size of the free space that we need
980 * @start: store the start of the free space.
981 * @len: the size of the free space. that we find, or the size of the max
982 * free space if we don't find suitable free space
984 * this uses a pretty simple search, the expectation is that it is
985 * called very infrequently and that a given device has a small number
988 * @start is used to store the start of the free space if we find. But if we
989 * don't find suitable free space, it will be used to store the start position
990 * of the max free space.
992 * @len is used to store the size of the free space that we find.
993 * But if we don't find suitable free space, it is used to store the size of
994 * the max free space.
996 int find_free_dev_extent(struct btrfs_device
*device
, u64 num_bytes
,
997 u64
*start
, u64
*len
)
999 struct btrfs_key key
;
1000 struct btrfs_root
*root
= device
->dev_root
;
1001 struct btrfs_dev_extent
*dev_extent
;
1002 struct btrfs_path
*path
;
1008 u64 search_end
= device
->total_bytes
;
1011 struct extent_buffer
*l
;
1013 /* FIXME use last free of some kind */
1015 /* we don't want to overwrite the superblock on the drive,
1016 * so we make sure to start at an offset of at least 1MB
1018 search_start
= max(root
->fs_info
->alloc_start
, 1024ull * 1024);
1020 max_hole_start
= search_start
;
1024 if (search_start
>= search_end
|| device
->is_tgtdev_for_dev_replace
) {
1029 path
= btrfs_alloc_path();
1036 key
.objectid
= device
->devid
;
1037 key
.offset
= search_start
;
1038 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1040 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1044 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
1051 slot
= path
->slots
[0];
1052 if (slot
>= btrfs_header_nritems(l
)) {
1053 ret
= btrfs_next_leaf(root
, path
);
1061 btrfs_item_key_to_cpu(l
, &key
, slot
);
1063 if (key
.objectid
< device
->devid
)
1066 if (key
.objectid
> device
->devid
)
1069 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
1072 if (key
.offset
> search_start
) {
1073 hole_size
= key
.offset
- search_start
;
1075 if (hole_size
> max_hole_size
) {
1076 max_hole_start
= search_start
;
1077 max_hole_size
= hole_size
;
1081 * If this free space is greater than which we need,
1082 * it must be the max free space that we have found
1083 * until now, so max_hole_start must point to the start
1084 * of this free space and the length of this free space
1085 * is stored in max_hole_size. Thus, we return
1086 * max_hole_start and max_hole_size and go back to the
1089 if (hole_size
>= num_bytes
) {
1095 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
1096 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
1098 if (extent_end
> search_start
)
1099 search_start
= extent_end
;
1106 * At this point, search_start should be the end of
1107 * allocated dev extents, and when shrinking the device,
1108 * search_end may be smaller than search_start.
1110 if (search_end
> search_start
)
1111 hole_size
= search_end
- search_start
;
1113 if (hole_size
> max_hole_size
) {
1114 max_hole_start
= search_start
;
1115 max_hole_size
= hole_size
;
1119 if (hole_size
< num_bytes
)
1125 btrfs_free_path(path
);
1127 *start
= max_hole_start
;
1129 *len
= max_hole_size
;
1133 static int btrfs_free_dev_extent(struct btrfs_trans_handle
*trans
,
1134 struct btrfs_device
*device
,
1138 struct btrfs_path
*path
;
1139 struct btrfs_root
*root
= device
->dev_root
;
1140 struct btrfs_key key
;
1141 struct btrfs_key found_key
;
1142 struct extent_buffer
*leaf
= NULL
;
1143 struct btrfs_dev_extent
*extent
= NULL
;
1145 path
= btrfs_alloc_path();
1149 key
.objectid
= device
->devid
;
1151 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1153 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1155 ret
= btrfs_previous_item(root
, path
, key
.objectid
,
1156 BTRFS_DEV_EXTENT_KEY
);
1159 leaf
= path
->nodes
[0];
1160 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1161 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1162 struct btrfs_dev_extent
);
1163 BUG_ON(found_key
.offset
> start
|| found_key
.offset
+
1164 btrfs_dev_extent_length(leaf
, extent
) < start
);
1166 btrfs_release_path(path
);
1168 } else if (ret
== 0) {
1169 leaf
= path
->nodes
[0];
1170 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1171 struct btrfs_dev_extent
);
1173 btrfs_error(root
->fs_info
, ret
, "Slot search failed");
1177 if (device
->bytes_used
> 0) {
1178 u64 len
= btrfs_dev_extent_length(leaf
, extent
);
1179 device
->bytes_used
-= len
;
1180 spin_lock(&root
->fs_info
->free_chunk_lock
);
1181 root
->fs_info
->free_chunk_space
+= len
;
1182 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1184 ret
= btrfs_del_item(trans
, root
, path
);
1186 btrfs_error(root
->fs_info
, ret
,
1187 "Failed to remove dev extent item");
1190 btrfs_free_path(path
);
1194 int btrfs_alloc_dev_extent(struct btrfs_trans_handle
*trans
,
1195 struct btrfs_device
*device
,
1196 u64 chunk_tree
, u64 chunk_objectid
,
1197 u64 chunk_offset
, u64 start
, u64 num_bytes
)
1200 struct btrfs_path
*path
;
1201 struct btrfs_root
*root
= device
->dev_root
;
1202 struct btrfs_dev_extent
*extent
;
1203 struct extent_buffer
*leaf
;
1204 struct btrfs_key key
;
1206 WARN_ON(!device
->in_fs_metadata
);
1207 WARN_ON(device
->is_tgtdev_for_dev_replace
);
1208 path
= btrfs_alloc_path();
1212 key
.objectid
= device
->devid
;
1214 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1215 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1220 leaf
= path
->nodes
[0];
1221 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1222 struct btrfs_dev_extent
);
1223 btrfs_set_dev_extent_chunk_tree(leaf
, extent
, chunk_tree
);
1224 btrfs_set_dev_extent_chunk_objectid(leaf
, extent
, chunk_objectid
);
1225 btrfs_set_dev_extent_chunk_offset(leaf
, extent
, chunk_offset
);
1227 write_extent_buffer(leaf
, root
->fs_info
->chunk_tree_uuid
,
1228 (unsigned long)btrfs_dev_extent_chunk_tree_uuid(extent
),
1231 btrfs_set_dev_extent_length(leaf
, extent
, num_bytes
);
1232 btrfs_mark_buffer_dirty(leaf
);
1234 btrfs_free_path(path
);
1238 static noinline
int find_next_chunk(struct btrfs_root
*root
,
1239 u64 objectid
, u64
*offset
)
1241 struct btrfs_path
*path
;
1243 struct btrfs_key key
;
1244 struct btrfs_chunk
*chunk
;
1245 struct btrfs_key found_key
;
1247 path
= btrfs_alloc_path();
1251 key
.objectid
= objectid
;
1252 key
.offset
= (u64
)-1;
1253 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
1255 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1259 BUG_ON(ret
== 0); /* Corruption */
1261 ret
= btrfs_previous_item(root
, path
, 0, BTRFS_CHUNK_ITEM_KEY
);
1265 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1267 if (found_key
.objectid
!= objectid
)
1270 chunk
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1271 struct btrfs_chunk
);
1272 *offset
= found_key
.offset
+
1273 btrfs_chunk_length(path
->nodes
[0], chunk
);
1278 btrfs_free_path(path
);
1282 static noinline
int find_next_devid(struct btrfs_root
*root
, u64
*objectid
)
1285 struct btrfs_key key
;
1286 struct btrfs_key found_key
;
1287 struct btrfs_path
*path
;
1289 root
= root
->fs_info
->chunk_root
;
1291 path
= btrfs_alloc_path();
1295 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1296 key
.type
= BTRFS_DEV_ITEM_KEY
;
1297 key
.offset
= (u64
)-1;
1299 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1303 BUG_ON(ret
== 0); /* Corruption */
1305 ret
= btrfs_previous_item(root
, path
, BTRFS_DEV_ITEMS_OBJECTID
,
1306 BTRFS_DEV_ITEM_KEY
);
1310 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1312 *objectid
= found_key
.offset
+ 1;
1316 btrfs_free_path(path
);
1321 * the device information is stored in the chunk root
1322 * the btrfs_device struct should be fully filled in
1324 int btrfs_add_device(struct btrfs_trans_handle
*trans
,
1325 struct btrfs_root
*root
,
1326 struct btrfs_device
*device
)
1329 struct btrfs_path
*path
;
1330 struct btrfs_dev_item
*dev_item
;
1331 struct extent_buffer
*leaf
;
1332 struct btrfs_key key
;
1335 root
= root
->fs_info
->chunk_root
;
1337 path
= btrfs_alloc_path();
1341 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1342 key
.type
= BTRFS_DEV_ITEM_KEY
;
1343 key
.offset
= device
->devid
;
1345 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1350 leaf
= path
->nodes
[0];
1351 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
1353 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
1354 btrfs_set_device_generation(leaf
, dev_item
, 0);
1355 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
1356 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
1357 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
1358 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
1359 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->total_bytes
);
1360 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
1361 btrfs_set_device_group(leaf
, dev_item
, 0);
1362 btrfs_set_device_seek_speed(leaf
, dev_item
, 0);
1363 btrfs_set_device_bandwidth(leaf
, dev_item
, 0);
1364 btrfs_set_device_start_offset(leaf
, dev_item
, 0);
1366 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
1367 write_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
1368 ptr
= (unsigned long)btrfs_device_fsid(dev_item
);
1369 write_extent_buffer(leaf
, root
->fs_info
->fsid
, ptr
, BTRFS_UUID_SIZE
);
1370 btrfs_mark_buffer_dirty(leaf
);
1374 btrfs_free_path(path
);
1378 static int btrfs_rm_dev_item(struct btrfs_root
*root
,
1379 struct btrfs_device
*device
)
1382 struct btrfs_path
*path
;
1383 struct btrfs_key key
;
1384 struct btrfs_trans_handle
*trans
;
1386 root
= root
->fs_info
->chunk_root
;
1388 path
= btrfs_alloc_path();
1392 trans
= btrfs_start_transaction(root
, 0);
1393 if (IS_ERR(trans
)) {
1394 btrfs_free_path(path
);
1395 return PTR_ERR(trans
);
1397 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1398 key
.type
= BTRFS_DEV_ITEM_KEY
;
1399 key
.offset
= device
->devid
;
1402 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1411 ret
= btrfs_del_item(trans
, root
, path
);
1415 btrfs_free_path(path
);
1416 unlock_chunks(root
);
1417 btrfs_commit_transaction(trans
, root
);
1421 int btrfs_rm_device(struct btrfs_root
*root
, char *device_path
)
1423 struct btrfs_device
*device
;
1424 struct btrfs_device
*next_device
;
1425 struct block_device
*bdev
;
1426 struct buffer_head
*bh
= NULL
;
1427 struct btrfs_super_block
*disk_super
;
1428 struct btrfs_fs_devices
*cur_devices
;
1435 bool clear_super
= false;
1437 mutex_lock(&uuid_mutex
);
1440 seq
= read_seqbegin(&root
->fs_info
->profiles_lock
);
1442 all_avail
= root
->fs_info
->avail_data_alloc_bits
|
1443 root
->fs_info
->avail_system_alloc_bits
|
1444 root
->fs_info
->avail_metadata_alloc_bits
;
1445 } while (read_seqretry(&root
->fs_info
->profiles_lock
, seq
));
1447 num_devices
= root
->fs_info
->fs_devices
->num_devices
;
1448 btrfs_dev_replace_lock(&root
->fs_info
->dev_replace
);
1449 if (btrfs_dev_replace_is_ongoing(&root
->fs_info
->dev_replace
)) {
1450 WARN_ON(num_devices
< 1);
1453 btrfs_dev_replace_unlock(&root
->fs_info
->dev_replace
);
1455 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID10
) && num_devices
<= 4) {
1456 printk(KERN_ERR
"btrfs: unable to go below four devices "
1462 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID1
) && num_devices
<= 2) {
1463 printk(KERN_ERR
"btrfs: unable to go below two "
1464 "devices on raid1\n");
1469 if (strcmp(device_path
, "missing") == 0) {
1470 struct list_head
*devices
;
1471 struct btrfs_device
*tmp
;
1474 devices
= &root
->fs_info
->fs_devices
->devices
;
1476 * It is safe to read the devices since the volume_mutex
1479 list_for_each_entry(tmp
, devices
, dev_list
) {
1480 if (tmp
->in_fs_metadata
&&
1481 !tmp
->is_tgtdev_for_dev_replace
&&
1491 printk(KERN_ERR
"btrfs: no missing devices found to "
1496 ret
= btrfs_get_bdev_and_sb(device_path
,
1497 FMODE_WRITE
| FMODE_EXCL
,
1498 root
->fs_info
->bdev_holder
, 0,
1502 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
1503 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
1504 dev_uuid
= disk_super
->dev_item
.uuid
;
1505 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1513 if (device
->is_tgtdev_for_dev_replace
) {
1514 pr_err("btrfs: unable to remove the dev_replace target dev\n");
1519 if (device
->writeable
&& root
->fs_info
->fs_devices
->rw_devices
== 1) {
1520 printk(KERN_ERR
"btrfs: unable to remove the only writeable "
1526 if (device
->writeable
) {
1528 list_del_init(&device
->dev_alloc_list
);
1529 unlock_chunks(root
);
1530 root
->fs_info
->fs_devices
->rw_devices
--;
1534 ret
= btrfs_shrink_device(device
, 0);
1539 * TODO: the superblock still includes this device in its num_devices
1540 * counter although write_all_supers() is not locked out. This
1541 * could give a filesystem state which requires a degraded mount.
1543 ret
= btrfs_rm_dev_item(root
->fs_info
->chunk_root
, device
);
1547 spin_lock(&root
->fs_info
->free_chunk_lock
);
1548 root
->fs_info
->free_chunk_space
= device
->total_bytes
-
1550 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1552 device
->in_fs_metadata
= 0;
1553 btrfs_scrub_cancel_dev(root
->fs_info
, device
);
1556 * the device list mutex makes sure that we don't change
1557 * the device list while someone else is writing out all
1558 * the device supers.
1561 cur_devices
= device
->fs_devices
;
1562 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1563 list_del_rcu(&device
->dev_list
);
1565 device
->fs_devices
->num_devices
--;
1566 device
->fs_devices
->total_devices
--;
1568 if (device
->missing
)
1569 root
->fs_info
->fs_devices
->missing_devices
--;
1571 next_device
= list_entry(root
->fs_info
->fs_devices
->devices
.next
,
1572 struct btrfs_device
, dev_list
);
1573 if (device
->bdev
== root
->fs_info
->sb
->s_bdev
)
1574 root
->fs_info
->sb
->s_bdev
= next_device
->bdev
;
1575 if (device
->bdev
== root
->fs_info
->fs_devices
->latest_bdev
)
1576 root
->fs_info
->fs_devices
->latest_bdev
= next_device
->bdev
;
1579 device
->fs_devices
->open_devices
--;
1581 call_rcu(&device
->rcu
, free_device
);
1582 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1584 num_devices
= btrfs_super_num_devices(root
->fs_info
->super_copy
) - 1;
1585 btrfs_set_super_num_devices(root
->fs_info
->super_copy
, num_devices
);
1587 if (cur_devices
->open_devices
== 0) {
1588 struct btrfs_fs_devices
*fs_devices
;
1589 fs_devices
= root
->fs_info
->fs_devices
;
1590 while (fs_devices
) {
1591 if (fs_devices
->seed
== cur_devices
)
1593 fs_devices
= fs_devices
->seed
;
1595 fs_devices
->seed
= cur_devices
->seed
;
1596 cur_devices
->seed
= NULL
;
1598 __btrfs_close_devices(cur_devices
);
1599 unlock_chunks(root
);
1600 free_fs_devices(cur_devices
);
1603 root
->fs_info
->num_tolerated_disk_barrier_failures
=
1604 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
1607 * at this point, the device is zero sized. We want to
1608 * remove it from the devices list and zero out the old super
1610 if (clear_super
&& disk_super
) {
1611 /* make sure this device isn't detected as part of
1614 memset(&disk_super
->magic
, 0, sizeof(disk_super
->magic
));
1615 set_buffer_dirty(bh
);
1616 sync_dirty_buffer(bh
);
1621 /* Notify udev that device has changed */
1623 btrfs_kobject_uevent(bdev
, KOBJ_CHANGE
);
1628 blkdev_put(bdev
, FMODE_READ
| FMODE_EXCL
);
1630 mutex_unlock(&uuid_mutex
);
1633 if (device
->writeable
) {
1635 list_add(&device
->dev_alloc_list
,
1636 &root
->fs_info
->fs_devices
->alloc_list
);
1637 unlock_chunks(root
);
1638 root
->fs_info
->fs_devices
->rw_devices
++;
1643 void btrfs_rm_dev_replace_srcdev(struct btrfs_fs_info
*fs_info
,
1644 struct btrfs_device
*srcdev
)
1646 WARN_ON(!mutex_is_locked(&fs_info
->fs_devices
->device_list_mutex
));
1647 list_del_rcu(&srcdev
->dev_list
);
1648 list_del_rcu(&srcdev
->dev_alloc_list
);
1649 fs_info
->fs_devices
->num_devices
--;
1650 if (srcdev
->missing
) {
1651 fs_info
->fs_devices
->missing_devices
--;
1652 fs_info
->fs_devices
->rw_devices
++;
1654 if (srcdev
->can_discard
)
1655 fs_info
->fs_devices
->num_can_discard
--;
1657 fs_info
->fs_devices
->open_devices
--;
1659 call_rcu(&srcdev
->rcu
, free_device
);
1662 void btrfs_destroy_dev_replace_tgtdev(struct btrfs_fs_info
*fs_info
,
1663 struct btrfs_device
*tgtdev
)
1665 struct btrfs_device
*next_device
;
1668 mutex_lock(&fs_info
->fs_devices
->device_list_mutex
);
1670 btrfs_scratch_superblock(tgtdev
);
1671 fs_info
->fs_devices
->open_devices
--;
1673 fs_info
->fs_devices
->num_devices
--;
1674 if (tgtdev
->can_discard
)
1675 fs_info
->fs_devices
->num_can_discard
++;
1677 next_device
= list_entry(fs_info
->fs_devices
->devices
.next
,
1678 struct btrfs_device
, dev_list
);
1679 if (tgtdev
->bdev
== fs_info
->sb
->s_bdev
)
1680 fs_info
->sb
->s_bdev
= next_device
->bdev
;
1681 if (tgtdev
->bdev
== fs_info
->fs_devices
->latest_bdev
)
1682 fs_info
->fs_devices
->latest_bdev
= next_device
->bdev
;
1683 list_del_rcu(&tgtdev
->dev_list
);
1685 call_rcu(&tgtdev
->rcu
, free_device
);
1687 mutex_unlock(&fs_info
->fs_devices
->device_list_mutex
);
1690 int btrfs_find_device_by_path(struct btrfs_root
*root
, char *device_path
,
1691 struct btrfs_device
**device
)
1694 struct btrfs_super_block
*disk_super
;
1697 struct block_device
*bdev
;
1698 struct buffer_head
*bh
;
1701 ret
= btrfs_get_bdev_and_sb(device_path
, FMODE_READ
,
1702 root
->fs_info
->bdev_holder
, 0, &bdev
, &bh
);
1705 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
1706 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
1707 dev_uuid
= disk_super
->dev_item
.uuid
;
1708 *device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1713 blkdev_put(bdev
, FMODE_READ
);
1717 int btrfs_find_device_missing_or_by_path(struct btrfs_root
*root
,
1719 struct btrfs_device
**device
)
1722 if (strcmp(device_path
, "missing") == 0) {
1723 struct list_head
*devices
;
1724 struct btrfs_device
*tmp
;
1726 devices
= &root
->fs_info
->fs_devices
->devices
;
1728 * It is safe to read the devices since the volume_mutex
1729 * is held by the caller.
1731 list_for_each_entry(tmp
, devices
, dev_list
) {
1732 if (tmp
->in_fs_metadata
&& !tmp
->bdev
) {
1739 pr_err("btrfs: no missing device found\n");
1745 return btrfs_find_device_by_path(root
, device_path
, device
);
1750 * does all the dirty work required for changing file system's UUID.
1752 static int btrfs_prepare_sprout(struct btrfs_root
*root
)
1754 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
1755 struct btrfs_fs_devices
*old_devices
;
1756 struct btrfs_fs_devices
*seed_devices
;
1757 struct btrfs_super_block
*disk_super
= root
->fs_info
->super_copy
;
1758 struct btrfs_device
*device
;
1761 BUG_ON(!mutex_is_locked(&uuid_mutex
));
1762 if (!fs_devices
->seeding
)
1765 seed_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
1769 old_devices
= clone_fs_devices(fs_devices
);
1770 if (IS_ERR(old_devices
)) {
1771 kfree(seed_devices
);
1772 return PTR_ERR(old_devices
);
1775 list_add(&old_devices
->list
, &fs_uuids
);
1777 memcpy(seed_devices
, fs_devices
, sizeof(*seed_devices
));
1778 seed_devices
->opened
= 1;
1779 INIT_LIST_HEAD(&seed_devices
->devices
);
1780 INIT_LIST_HEAD(&seed_devices
->alloc_list
);
1781 mutex_init(&seed_devices
->device_list_mutex
);
1783 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1784 list_splice_init_rcu(&fs_devices
->devices
, &seed_devices
->devices
,
1786 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1788 list_splice_init(&fs_devices
->alloc_list
, &seed_devices
->alloc_list
);
1789 list_for_each_entry(device
, &seed_devices
->devices
, dev_list
) {
1790 device
->fs_devices
= seed_devices
;
1793 fs_devices
->seeding
= 0;
1794 fs_devices
->num_devices
= 0;
1795 fs_devices
->open_devices
= 0;
1796 fs_devices
->total_devices
= 0;
1797 fs_devices
->seed
= seed_devices
;
1799 generate_random_uuid(fs_devices
->fsid
);
1800 memcpy(root
->fs_info
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1801 memcpy(disk_super
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1802 super_flags
= btrfs_super_flags(disk_super
) &
1803 ~BTRFS_SUPER_FLAG_SEEDING
;
1804 btrfs_set_super_flags(disk_super
, super_flags
);
1810 * strore the expected generation for seed devices in device items.
1812 static int btrfs_finish_sprout(struct btrfs_trans_handle
*trans
,
1813 struct btrfs_root
*root
)
1815 struct btrfs_path
*path
;
1816 struct extent_buffer
*leaf
;
1817 struct btrfs_dev_item
*dev_item
;
1818 struct btrfs_device
*device
;
1819 struct btrfs_key key
;
1820 u8 fs_uuid
[BTRFS_UUID_SIZE
];
1821 u8 dev_uuid
[BTRFS_UUID_SIZE
];
1825 path
= btrfs_alloc_path();
1829 root
= root
->fs_info
->chunk_root
;
1830 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1832 key
.type
= BTRFS_DEV_ITEM_KEY
;
1835 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
1839 leaf
= path
->nodes
[0];
1841 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1842 ret
= btrfs_next_leaf(root
, path
);
1847 leaf
= path
->nodes
[0];
1848 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1849 btrfs_release_path(path
);
1853 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1854 if (key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
||
1855 key
.type
!= BTRFS_DEV_ITEM_KEY
)
1858 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
1859 struct btrfs_dev_item
);
1860 devid
= btrfs_device_id(leaf
, dev_item
);
1861 read_extent_buffer(leaf
, dev_uuid
,
1862 (unsigned long)btrfs_device_uuid(dev_item
),
1864 read_extent_buffer(leaf
, fs_uuid
,
1865 (unsigned long)btrfs_device_fsid(dev_item
),
1867 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
,
1869 BUG_ON(!device
); /* Logic error */
1871 if (device
->fs_devices
->seeding
) {
1872 btrfs_set_device_generation(leaf
, dev_item
,
1873 device
->generation
);
1874 btrfs_mark_buffer_dirty(leaf
);
1882 btrfs_free_path(path
);
1886 int btrfs_init_new_device(struct btrfs_root
*root
, char *device_path
)
1888 struct request_queue
*q
;
1889 struct btrfs_trans_handle
*trans
;
1890 struct btrfs_device
*device
;
1891 struct block_device
*bdev
;
1892 struct list_head
*devices
;
1893 struct super_block
*sb
= root
->fs_info
->sb
;
1894 struct rcu_string
*name
;
1896 int seeding_dev
= 0;
1899 if ((sb
->s_flags
& MS_RDONLY
) && !root
->fs_info
->fs_devices
->seeding
)
1902 bdev
= blkdev_get_by_path(device_path
, FMODE_WRITE
| FMODE_EXCL
,
1903 root
->fs_info
->bdev_holder
);
1905 return PTR_ERR(bdev
);
1907 if (root
->fs_info
->fs_devices
->seeding
) {
1909 down_write(&sb
->s_umount
);
1910 mutex_lock(&uuid_mutex
);
1913 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
1915 devices
= &root
->fs_info
->fs_devices
->devices
;
1917 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1918 list_for_each_entry(device
, devices
, dev_list
) {
1919 if (device
->bdev
== bdev
) {
1922 &root
->fs_info
->fs_devices
->device_list_mutex
);
1926 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1928 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
1930 /* we can safely leave the fs_devices entry around */
1935 name
= rcu_string_strdup(device_path
, GFP_NOFS
);
1941 rcu_assign_pointer(device
->name
, name
);
1943 ret
= find_next_devid(root
, &device
->devid
);
1945 rcu_string_free(device
->name
);
1950 trans
= btrfs_start_transaction(root
, 0);
1951 if (IS_ERR(trans
)) {
1952 rcu_string_free(device
->name
);
1954 ret
= PTR_ERR(trans
);
1960 q
= bdev_get_queue(bdev
);
1961 if (blk_queue_discard(q
))
1962 device
->can_discard
= 1;
1963 device
->writeable
= 1;
1964 device
->work
.func
= pending_bios_fn
;
1965 generate_random_uuid(device
->uuid
);
1966 spin_lock_init(&device
->io_lock
);
1967 device
->generation
= trans
->transid
;
1968 device
->io_width
= root
->sectorsize
;
1969 device
->io_align
= root
->sectorsize
;
1970 device
->sector_size
= root
->sectorsize
;
1971 device
->total_bytes
= i_size_read(bdev
->bd_inode
);
1972 device
->disk_total_bytes
= device
->total_bytes
;
1973 device
->dev_root
= root
->fs_info
->dev_root
;
1974 device
->bdev
= bdev
;
1975 device
->in_fs_metadata
= 1;
1976 device
->is_tgtdev_for_dev_replace
= 0;
1977 device
->mode
= FMODE_EXCL
;
1978 set_blocksize(device
->bdev
, 4096);
1981 sb
->s_flags
&= ~MS_RDONLY
;
1982 ret
= btrfs_prepare_sprout(root
);
1983 BUG_ON(ret
); /* -ENOMEM */
1986 device
->fs_devices
= root
->fs_info
->fs_devices
;
1988 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1989 list_add_rcu(&device
->dev_list
, &root
->fs_info
->fs_devices
->devices
);
1990 list_add(&device
->dev_alloc_list
,
1991 &root
->fs_info
->fs_devices
->alloc_list
);
1992 root
->fs_info
->fs_devices
->num_devices
++;
1993 root
->fs_info
->fs_devices
->open_devices
++;
1994 root
->fs_info
->fs_devices
->rw_devices
++;
1995 root
->fs_info
->fs_devices
->total_devices
++;
1996 if (device
->can_discard
)
1997 root
->fs_info
->fs_devices
->num_can_discard
++;
1998 root
->fs_info
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
2000 spin_lock(&root
->fs_info
->free_chunk_lock
);
2001 root
->fs_info
->free_chunk_space
+= device
->total_bytes
;
2002 spin_unlock(&root
->fs_info
->free_chunk_lock
);
2004 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
2005 root
->fs_info
->fs_devices
->rotating
= 1;
2007 total_bytes
= btrfs_super_total_bytes(root
->fs_info
->super_copy
);
2008 btrfs_set_super_total_bytes(root
->fs_info
->super_copy
,
2009 total_bytes
+ device
->total_bytes
);
2011 total_bytes
= btrfs_super_num_devices(root
->fs_info
->super_copy
);
2012 btrfs_set_super_num_devices(root
->fs_info
->super_copy
,
2014 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2017 ret
= init_first_rw_device(trans
, root
, device
);
2019 btrfs_abort_transaction(trans
, root
, ret
);
2022 ret
= btrfs_finish_sprout(trans
, root
);
2024 btrfs_abort_transaction(trans
, root
, ret
);
2028 ret
= btrfs_add_device(trans
, root
, device
);
2030 btrfs_abort_transaction(trans
, root
, ret
);
2036 * we've got more storage, clear any full flags on the space
2039 btrfs_clear_space_info_full(root
->fs_info
);
2041 unlock_chunks(root
);
2042 root
->fs_info
->num_tolerated_disk_barrier_failures
=
2043 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
2044 ret
= btrfs_commit_transaction(trans
, root
);
2047 mutex_unlock(&uuid_mutex
);
2048 up_write(&sb
->s_umount
);
2050 if (ret
) /* transaction commit */
2053 ret
= btrfs_relocate_sys_chunks(root
);
2055 btrfs_error(root
->fs_info
, ret
,
2056 "Failed to relocate sys chunks after "
2057 "device initialization. This can be fixed "
2058 "using the \"btrfs balance\" command.");
2059 trans
= btrfs_attach_transaction(root
);
2060 if (IS_ERR(trans
)) {
2061 if (PTR_ERR(trans
) == -ENOENT
)
2063 return PTR_ERR(trans
);
2065 ret
= btrfs_commit_transaction(trans
, root
);
2071 unlock_chunks(root
);
2072 btrfs_end_transaction(trans
, root
);
2073 rcu_string_free(device
->name
);
2076 blkdev_put(bdev
, FMODE_EXCL
);
2078 mutex_unlock(&uuid_mutex
);
2079 up_write(&sb
->s_umount
);
2084 int btrfs_init_dev_replace_tgtdev(struct btrfs_root
*root
, char *device_path
,
2085 struct btrfs_device
**device_out
)
2087 struct request_queue
*q
;
2088 struct btrfs_device
*device
;
2089 struct block_device
*bdev
;
2090 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
2091 struct list_head
*devices
;
2092 struct rcu_string
*name
;
2096 if (fs_info
->fs_devices
->seeding
)
2099 bdev
= blkdev_get_by_path(device_path
, FMODE_WRITE
| FMODE_EXCL
,
2100 fs_info
->bdev_holder
);
2102 return PTR_ERR(bdev
);
2104 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
2106 devices
= &fs_info
->fs_devices
->devices
;
2107 list_for_each_entry(device
, devices
, dev_list
) {
2108 if (device
->bdev
== bdev
) {
2114 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
2120 name
= rcu_string_strdup(device_path
, GFP_NOFS
);
2126 rcu_assign_pointer(device
->name
, name
);
2128 q
= bdev_get_queue(bdev
);
2129 if (blk_queue_discard(q
))
2130 device
->can_discard
= 1;
2131 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2132 device
->writeable
= 1;
2133 device
->work
.func
= pending_bios_fn
;
2134 generate_random_uuid(device
->uuid
);
2135 device
->devid
= BTRFS_DEV_REPLACE_DEVID
;
2136 spin_lock_init(&device
->io_lock
);
2137 device
->generation
= 0;
2138 device
->io_width
= root
->sectorsize
;
2139 device
->io_align
= root
->sectorsize
;
2140 device
->sector_size
= root
->sectorsize
;
2141 device
->total_bytes
= i_size_read(bdev
->bd_inode
);
2142 device
->disk_total_bytes
= device
->total_bytes
;
2143 device
->dev_root
= fs_info
->dev_root
;
2144 device
->bdev
= bdev
;
2145 device
->in_fs_metadata
= 1;
2146 device
->is_tgtdev_for_dev_replace
= 1;
2147 device
->mode
= FMODE_EXCL
;
2148 set_blocksize(device
->bdev
, 4096);
2149 device
->fs_devices
= fs_info
->fs_devices
;
2150 list_add(&device
->dev_list
, &fs_info
->fs_devices
->devices
);
2151 fs_info
->fs_devices
->num_devices
++;
2152 fs_info
->fs_devices
->open_devices
++;
2153 if (device
->can_discard
)
2154 fs_info
->fs_devices
->num_can_discard
++;
2155 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
2157 *device_out
= device
;
2161 blkdev_put(bdev
, FMODE_EXCL
);
2165 void btrfs_init_dev_replace_tgtdev_for_resume(struct btrfs_fs_info
*fs_info
,
2166 struct btrfs_device
*tgtdev
)
2168 WARN_ON(fs_info
->fs_devices
->rw_devices
== 0);
2169 tgtdev
->io_width
= fs_info
->dev_root
->sectorsize
;
2170 tgtdev
->io_align
= fs_info
->dev_root
->sectorsize
;
2171 tgtdev
->sector_size
= fs_info
->dev_root
->sectorsize
;
2172 tgtdev
->dev_root
= fs_info
->dev_root
;
2173 tgtdev
->in_fs_metadata
= 1;
2176 static noinline
int btrfs_update_device(struct btrfs_trans_handle
*trans
,
2177 struct btrfs_device
*device
)
2180 struct btrfs_path
*path
;
2181 struct btrfs_root
*root
;
2182 struct btrfs_dev_item
*dev_item
;
2183 struct extent_buffer
*leaf
;
2184 struct btrfs_key key
;
2186 root
= device
->dev_root
->fs_info
->chunk_root
;
2188 path
= btrfs_alloc_path();
2192 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
2193 key
.type
= BTRFS_DEV_ITEM_KEY
;
2194 key
.offset
= device
->devid
;
2196 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
2205 leaf
= path
->nodes
[0];
2206 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
2208 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
2209 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
2210 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
2211 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
2212 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
2213 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->disk_total_bytes
);
2214 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
2215 btrfs_mark_buffer_dirty(leaf
);
2218 btrfs_free_path(path
);
2222 static int __btrfs_grow_device(struct btrfs_trans_handle
*trans
,
2223 struct btrfs_device
*device
, u64 new_size
)
2225 struct btrfs_super_block
*super_copy
=
2226 device
->dev_root
->fs_info
->super_copy
;
2227 u64 old_total
= btrfs_super_total_bytes(super_copy
);
2228 u64 diff
= new_size
- device
->total_bytes
;
2230 if (!device
->writeable
)
2232 if (new_size
<= device
->total_bytes
||
2233 device
->is_tgtdev_for_dev_replace
)
2236 btrfs_set_super_total_bytes(super_copy
, old_total
+ diff
);
2237 device
->fs_devices
->total_rw_bytes
+= diff
;
2239 device
->total_bytes
= new_size
;
2240 device
->disk_total_bytes
= new_size
;
2241 btrfs_clear_space_info_full(device
->dev_root
->fs_info
);
2243 return btrfs_update_device(trans
, device
);
2246 int btrfs_grow_device(struct btrfs_trans_handle
*trans
,
2247 struct btrfs_device
*device
, u64 new_size
)
2250 lock_chunks(device
->dev_root
);
2251 ret
= __btrfs_grow_device(trans
, device
, new_size
);
2252 unlock_chunks(device
->dev_root
);
2256 static int btrfs_free_chunk(struct btrfs_trans_handle
*trans
,
2257 struct btrfs_root
*root
,
2258 u64 chunk_tree
, u64 chunk_objectid
,
2262 struct btrfs_path
*path
;
2263 struct btrfs_key key
;
2265 root
= root
->fs_info
->chunk_root
;
2266 path
= btrfs_alloc_path();
2270 key
.objectid
= chunk_objectid
;
2271 key
.offset
= chunk_offset
;
2272 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2274 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2277 else if (ret
> 0) { /* Logic error or corruption */
2278 btrfs_error(root
->fs_info
, -ENOENT
,
2279 "Failed lookup while freeing chunk.");
2284 ret
= btrfs_del_item(trans
, root
, path
);
2286 btrfs_error(root
->fs_info
, ret
,
2287 "Failed to delete chunk item.");
2289 btrfs_free_path(path
);
2293 static int btrfs_del_sys_chunk(struct btrfs_root
*root
, u64 chunk_objectid
, u64
2296 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
2297 struct btrfs_disk_key
*disk_key
;
2298 struct btrfs_chunk
*chunk
;
2305 struct btrfs_key key
;
2307 array_size
= btrfs_super_sys_array_size(super_copy
);
2309 ptr
= super_copy
->sys_chunk_array
;
2312 while (cur
< array_size
) {
2313 disk_key
= (struct btrfs_disk_key
*)ptr
;
2314 btrfs_disk_key_to_cpu(&key
, disk_key
);
2316 len
= sizeof(*disk_key
);
2318 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
2319 chunk
= (struct btrfs_chunk
*)(ptr
+ len
);
2320 num_stripes
= btrfs_stack_chunk_num_stripes(chunk
);
2321 len
+= btrfs_chunk_item_size(num_stripes
);
2326 if (key
.objectid
== chunk_objectid
&&
2327 key
.offset
== chunk_offset
) {
2328 memmove(ptr
, ptr
+ len
, array_size
- (cur
+ len
));
2330 btrfs_set_super_sys_array_size(super_copy
, array_size
);
2339 static int btrfs_relocate_chunk(struct btrfs_root
*root
,
2340 u64 chunk_tree
, u64 chunk_objectid
,
2343 struct extent_map_tree
*em_tree
;
2344 struct btrfs_root
*extent_root
;
2345 struct btrfs_trans_handle
*trans
;
2346 struct extent_map
*em
;
2347 struct map_lookup
*map
;
2351 root
= root
->fs_info
->chunk_root
;
2352 extent_root
= root
->fs_info
->extent_root
;
2353 em_tree
= &root
->fs_info
->mapping_tree
.map_tree
;
2355 ret
= btrfs_can_relocate(extent_root
, chunk_offset
);
2359 /* step one, relocate all the extents inside this chunk */
2360 ret
= btrfs_relocate_block_group(extent_root
, chunk_offset
);
2364 trans
= btrfs_start_transaction(root
, 0);
2365 BUG_ON(IS_ERR(trans
));
2370 * step two, delete the device extents and the
2371 * chunk tree entries
2373 read_lock(&em_tree
->lock
);
2374 em
= lookup_extent_mapping(em_tree
, chunk_offset
, 1);
2375 read_unlock(&em_tree
->lock
);
2377 BUG_ON(!em
|| em
->start
> chunk_offset
||
2378 em
->start
+ em
->len
< chunk_offset
);
2379 map
= (struct map_lookup
*)em
->bdev
;
2381 for (i
= 0; i
< map
->num_stripes
; i
++) {
2382 ret
= btrfs_free_dev_extent(trans
, map
->stripes
[i
].dev
,
2383 map
->stripes
[i
].physical
);
2386 if (map
->stripes
[i
].dev
) {
2387 ret
= btrfs_update_device(trans
, map
->stripes
[i
].dev
);
2391 ret
= btrfs_free_chunk(trans
, root
, chunk_tree
, chunk_objectid
,
2396 trace_btrfs_chunk_free(root
, map
, chunk_offset
, em
->len
);
2398 if (map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2399 ret
= btrfs_del_sys_chunk(root
, chunk_objectid
, chunk_offset
);
2403 ret
= btrfs_remove_block_group(trans
, extent_root
, chunk_offset
);
2406 write_lock(&em_tree
->lock
);
2407 remove_extent_mapping(em_tree
, em
);
2408 write_unlock(&em_tree
->lock
);
2413 /* once for the tree */
2414 free_extent_map(em
);
2416 free_extent_map(em
);
2418 unlock_chunks(root
);
2419 btrfs_end_transaction(trans
, root
);
2423 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
)
2425 struct btrfs_root
*chunk_root
= root
->fs_info
->chunk_root
;
2426 struct btrfs_path
*path
;
2427 struct extent_buffer
*leaf
;
2428 struct btrfs_chunk
*chunk
;
2429 struct btrfs_key key
;
2430 struct btrfs_key found_key
;
2431 u64 chunk_tree
= chunk_root
->root_key
.objectid
;
2433 bool retried
= false;
2437 path
= btrfs_alloc_path();
2442 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2443 key
.offset
= (u64
)-1;
2444 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2447 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2450 BUG_ON(ret
== 0); /* Corruption */
2452 ret
= btrfs_previous_item(chunk_root
, path
, key
.objectid
,
2459 leaf
= path
->nodes
[0];
2460 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2462 chunk
= btrfs_item_ptr(leaf
, path
->slots
[0],
2463 struct btrfs_chunk
);
2464 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2465 btrfs_release_path(path
);
2467 if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2468 ret
= btrfs_relocate_chunk(chunk_root
, chunk_tree
,
2477 if (found_key
.offset
== 0)
2479 key
.offset
= found_key
.offset
- 1;
2482 if (failed
&& !retried
) {
2486 } else if (failed
&& retried
) {
2491 btrfs_free_path(path
);
2495 static int insert_balance_item(struct btrfs_root
*root
,
2496 struct btrfs_balance_control
*bctl
)
2498 struct btrfs_trans_handle
*trans
;
2499 struct btrfs_balance_item
*item
;
2500 struct btrfs_disk_balance_args disk_bargs
;
2501 struct btrfs_path
*path
;
2502 struct extent_buffer
*leaf
;
2503 struct btrfs_key key
;
2506 path
= btrfs_alloc_path();
2510 trans
= btrfs_start_transaction(root
, 0);
2511 if (IS_ERR(trans
)) {
2512 btrfs_free_path(path
);
2513 return PTR_ERR(trans
);
2516 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2517 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2520 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
2525 leaf
= path
->nodes
[0];
2526 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
2528 memset_extent_buffer(leaf
, 0, (unsigned long)item
, sizeof(*item
));
2530 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->data
);
2531 btrfs_set_balance_data(leaf
, item
, &disk_bargs
);
2532 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->meta
);
2533 btrfs_set_balance_meta(leaf
, item
, &disk_bargs
);
2534 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->sys
);
2535 btrfs_set_balance_sys(leaf
, item
, &disk_bargs
);
2537 btrfs_set_balance_flags(leaf
, item
, bctl
->flags
);
2539 btrfs_mark_buffer_dirty(leaf
);
2541 btrfs_free_path(path
);
2542 err
= btrfs_commit_transaction(trans
, root
);
2548 static int del_balance_item(struct btrfs_root
*root
)
2550 struct btrfs_trans_handle
*trans
;
2551 struct btrfs_path
*path
;
2552 struct btrfs_key key
;
2555 path
= btrfs_alloc_path();
2559 trans
= btrfs_start_transaction(root
, 0);
2560 if (IS_ERR(trans
)) {
2561 btrfs_free_path(path
);
2562 return PTR_ERR(trans
);
2565 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2566 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2569 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2577 ret
= btrfs_del_item(trans
, root
, path
);
2579 btrfs_free_path(path
);
2580 err
= btrfs_commit_transaction(trans
, root
);
2587 * This is a heuristic used to reduce the number of chunks balanced on
2588 * resume after balance was interrupted.
2590 static void update_balance_args(struct btrfs_balance_control
*bctl
)
2593 * Turn on soft mode for chunk types that were being converted.
2595 if (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2596 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2597 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2598 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2599 if (bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2600 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2603 * Turn on usage filter if is not already used. The idea is
2604 * that chunks that we have already balanced should be
2605 * reasonably full. Don't do it for chunks that are being
2606 * converted - that will keep us from relocating unconverted
2607 * (albeit full) chunks.
2609 if (!(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2610 !(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2611 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2612 bctl
->data
.usage
= 90;
2614 if (!(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2615 !(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2616 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2617 bctl
->sys
.usage
= 90;
2619 if (!(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2620 !(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2621 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2622 bctl
->meta
.usage
= 90;
2627 * Should be called with both balance and volume mutexes held to
2628 * serialize other volume operations (add_dev/rm_dev/resize) with
2629 * restriper. Same goes for unset_balance_control.
2631 static void set_balance_control(struct btrfs_balance_control
*bctl
)
2633 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
2635 BUG_ON(fs_info
->balance_ctl
);
2637 spin_lock(&fs_info
->balance_lock
);
2638 fs_info
->balance_ctl
= bctl
;
2639 spin_unlock(&fs_info
->balance_lock
);
2642 static void unset_balance_control(struct btrfs_fs_info
*fs_info
)
2644 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2646 BUG_ON(!fs_info
->balance_ctl
);
2648 spin_lock(&fs_info
->balance_lock
);
2649 fs_info
->balance_ctl
= NULL
;
2650 spin_unlock(&fs_info
->balance_lock
);
2656 * Balance filters. Return 1 if chunk should be filtered out
2657 * (should not be balanced).
2659 static int chunk_profiles_filter(u64 chunk_type
,
2660 struct btrfs_balance_args
*bargs
)
2662 chunk_type
= chunk_to_extended(chunk_type
) &
2663 BTRFS_EXTENDED_PROFILE_MASK
;
2665 if (bargs
->profiles
& chunk_type
)
2671 static int chunk_usage_filter(struct btrfs_fs_info
*fs_info
, u64 chunk_offset
,
2672 struct btrfs_balance_args
*bargs
)
2674 struct btrfs_block_group_cache
*cache
;
2675 u64 chunk_used
, user_thresh
;
2678 cache
= btrfs_lookup_block_group(fs_info
, chunk_offset
);
2679 chunk_used
= btrfs_block_group_used(&cache
->item
);
2681 if (bargs
->usage
== 0)
2683 else if (bargs
->usage
> 100)
2684 user_thresh
= cache
->key
.offset
;
2686 user_thresh
= div_factor_fine(cache
->key
.offset
,
2689 if (chunk_used
< user_thresh
)
2692 btrfs_put_block_group(cache
);
2696 static int chunk_devid_filter(struct extent_buffer
*leaf
,
2697 struct btrfs_chunk
*chunk
,
2698 struct btrfs_balance_args
*bargs
)
2700 struct btrfs_stripe
*stripe
;
2701 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2704 for (i
= 0; i
< num_stripes
; i
++) {
2705 stripe
= btrfs_stripe_nr(chunk
, i
);
2706 if (btrfs_stripe_devid(leaf
, stripe
) == bargs
->devid
)
2713 /* [pstart, pend) */
2714 static int chunk_drange_filter(struct extent_buffer
*leaf
,
2715 struct btrfs_chunk
*chunk
,
2717 struct btrfs_balance_args
*bargs
)
2719 struct btrfs_stripe
*stripe
;
2720 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2726 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
))
2729 if (btrfs_chunk_type(leaf
, chunk
) & (BTRFS_BLOCK_GROUP_DUP
|
2730 BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
))
2734 factor
= num_stripes
/ factor
;
2736 for (i
= 0; i
< num_stripes
; i
++) {
2737 stripe
= btrfs_stripe_nr(chunk
, i
);
2738 if (btrfs_stripe_devid(leaf
, stripe
) != bargs
->devid
)
2741 stripe_offset
= btrfs_stripe_offset(leaf
, stripe
);
2742 stripe_length
= btrfs_chunk_length(leaf
, chunk
);
2743 do_div(stripe_length
, factor
);
2745 if (stripe_offset
< bargs
->pend
&&
2746 stripe_offset
+ stripe_length
> bargs
->pstart
)
2753 /* [vstart, vend) */
2754 static int chunk_vrange_filter(struct extent_buffer
*leaf
,
2755 struct btrfs_chunk
*chunk
,
2757 struct btrfs_balance_args
*bargs
)
2759 if (chunk_offset
< bargs
->vend
&&
2760 chunk_offset
+ btrfs_chunk_length(leaf
, chunk
) > bargs
->vstart
)
2761 /* at least part of the chunk is inside this vrange */
2767 static int chunk_soft_convert_filter(u64 chunk_type
,
2768 struct btrfs_balance_args
*bargs
)
2770 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_CONVERT
))
2773 chunk_type
= chunk_to_extended(chunk_type
) &
2774 BTRFS_EXTENDED_PROFILE_MASK
;
2776 if (bargs
->target
== chunk_type
)
2782 static int should_balance_chunk(struct btrfs_root
*root
,
2783 struct extent_buffer
*leaf
,
2784 struct btrfs_chunk
*chunk
, u64 chunk_offset
)
2786 struct btrfs_balance_control
*bctl
= root
->fs_info
->balance_ctl
;
2787 struct btrfs_balance_args
*bargs
= NULL
;
2788 u64 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2791 if (!((chunk_type
& BTRFS_BLOCK_GROUP_TYPE_MASK
) &
2792 (bctl
->flags
& BTRFS_BALANCE_TYPE_MASK
))) {
2796 if (chunk_type
& BTRFS_BLOCK_GROUP_DATA
)
2797 bargs
= &bctl
->data
;
2798 else if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
)
2800 else if (chunk_type
& BTRFS_BLOCK_GROUP_METADATA
)
2801 bargs
= &bctl
->meta
;
2803 /* profiles filter */
2804 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_PROFILES
) &&
2805 chunk_profiles_filter(chunk_type
, bargs
)) {
2810 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2811 chunk_usage_filter(bctl
->fs_info
, chunk_offset
, bargs
)) {
2816 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
) &&
2817 chunk_devid_filter(leaf
, chunk
, bargs
)) {
2821 /* drange filter, makes sense only with devid filter */
2822 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DRANGE
) &&
2823 chunk_drange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2828 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_VRANGE
) &&
2829 chunk_vrange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2833 /* soft profile changing mode */
2834 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_SOFT
) &&
2835 chunk_soft_convert_filter(chunk_type
, bargs
)) {
2842 static int __btrfs_balance(struct btrfs_fs_info
*fs_info
)
2844 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2845 struct btrfs_root
*chunk_root
= fs_info
->chunk_root
;
2846 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
2847 struct list_head
*devices
;
2848 struct btrfs_device
*device
;
2851 struct btrfs_chunk
*chunk
;
2852 struct btrfs_path
*path
;
2853 struct btrfs_key key
;
2854 struct btrfs_key found_key
;
2855 struct btrfs_trans_handle
*trans
;
2856 struct extent_buffer
*leaf
;
2859 int enospc_errors
= 0;
2860 bool counting
= true;
2862 /* step one make some room on all the devices */
2863 devices
= &fs_info
->fs_devices
->devices
;
2864 list_for_each_entry(device
, devices
, dev_list
) {
2865 old_size
= device
->total_bytes
;
2866 size_to_free
= div_factor(old_size
, 1);
2867 size_to_free
= min(size_to_free
, (u64
)1 * 1024 * 1024);
2868 if (!device
->writeable
||
2869 device
->total_bytes
- device
->bytes_used
> size_to_free
||
2870 device
->is_tgtdev_for_dev_replace
)
2873 ret
= btrfs_shrink_device(device
, old_size
- size_to_free
);
2878 trans
= btrfs_start_transaction(dev_root
, 0);
2879 BUG_ON(IS_ERR(trans
));
2881 ret
= btrfs_grow_device(trans
, device
, old_size
);
2884 btrfs_end_transaction(trans
, dev_root
);
2887 /* step two, relocate all the chunks */
2888 path
= btrfs_alloc_path();
2894 /* zero out stat counters */
2895 spin_lock(&fs_info
->balance_lock
);
2896 memset(&bctl
->stat
, 0, sizeof(bctl
->stat
));
2897 spin_unlock(&fs_info
->balance_lock
);
2899 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2900 key
.offset
= (u64
)-1;
2901 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2904 if ((!counting
&& atomic_read(&fs_info
->balance_pause_req
)) ||
2905 atomic_read(&fs_info
->balance_cancel_req
)) {
2910 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2915 * this shouldn't happen, it means the last relocate
2919 BUG(); /* FIXME break ? */
2921 ret
= btrfs_previous_item(chunk_root
, path
, 0,
2922 BTRFS_CHUNK_ITEM_KEY
);
2928 leaf
= path
->nodes
[0];
2929 slot
= path
->slots
[0];
2930 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
2932 if (found_key
.objectid
!= key
.objectid
)
2935 /* chunk zero is special */
2936 if (found_key
.offset
== 0)
2939 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
2942 spin_lock(&fs_info
->balance_lock
);
2943 bctl
->stat
.considered
++;
2944 spin_unlock(&fs_info
->balance_lock
);
2947 ret
= should_balance_chunk(chunk_root
, leaf
, chunk
,
2949 btrfs_release_path(path
);
2954 spin_lock(&fs_info
->balance_lock
);
2955 bctl
->stat
.expected
++;
2956 spin_unlock(&fs_info
->balance_lock
);
2960 ret
= btrfs_relocate_chunk(chunk_root
,
2961 chunk_root
->root_key
.objectid
,
2964 if (ret
&& ret
!= -ENOSPC
)
2966 if (ret
== -ENOSPC
) {
2969 spin_lock(&fs_info
->balance_lock
);
2970 bctl
->stat
.completed
++;
2971 spin_unlock(&fs_info
->balance_lock
);
2974 key
.offset
= found_key
.offset
- 1;
2978 btrfs_release_path(path
);
2983 btrfs_free_path(path
);
2984 if (enospc_errors
) {
2985 printk(KERN_INFO
"btrfs: %d enospc errors during balance\n",
2995 * alloc_profile_is_valid - see if a given profile is valid and reduced
2996 * @flags: profile to validate
2997 * @extended: if true @flags is treated as an extended profile
2999 static int alloc_profile_is_valid(u64 flags
, int extended
)
3001 u64 mask
= (extended
? BTRFS_EXTENDED_PROFILE_MASK
:
3002 BTRFS_BLOCK_GROUP_PROFILE_MASK
);
3004 flags
&= ~BTRFS_BLOCK_GROUP_TYPE_MASK
;
3006 /* 1) check that all other bits are zeroed */
3010 /* 2) see if profile is reduced */
3012 return !extended
; /* "0" is valid for usual profiles */
3014 /* true if exactly one bit set */
3015 return (flags
& (flags
- 1)) == 0;
3018 static inline int balance_need_close(struct btrfs_fs_info
*fs_info
)
3020 /* cancel requested || normal exit path */
3021 return atomic_read(&fs_info
->balance_cancel_req
) ||
3022 (atomic_read(&fs_info
->balance_pause_req
) == 0 &&
3023 atomic_read(&fs_info
->balance_cancel_req
) == 0);
3026 static void __cancel_balance(struct btrfs_fs_info
*fs_info
)
3030 unset_balance_control(fs_info
);
3031 ret
= del_balance_item(fs_info
->tree_root
);
3034 atomic_set(&fs_info
->mutually_exclusive_operation_running
, 0);
3037 void update_ioctl_balance_args(struct btrfs_fs_info
*fs_info
, int lock
,
3038 struct btrfs_ioctl_balance_args
*bargs
);
3041 * Should be called with both balance and volume mutexes held
3043 int btrfs_balance(struct btrfs_balance_control
*bctl
,
3044 struct btrfs_ioctl_balance_args
*bargs
)
3046 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
3053 if (btrfs_fs_closing(fs_info
) ||
3054 atomic_read(&fs_info
->balance_pause_req
) ||
3055 atomic_read(&fs_info
->balance_cancel_req
)) {
3060 allowed
= btrfs_super_incompat_flags(fs_info
->super_copy
);
3061 if (allowed
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
)
3065 * In case of mixed groups both data and meta should be picked,
3066 * and identical options should be given for both of them.
3068 allowed
= BTRFS_BALANCE_DATA
| BTRFS_BALANCE_METADATA
;
3069 if (mixed
&& (bctl
->flags
& allowed
)) {
3070 if (!(bctl
->flags
& BTRFS_BALANCE_DATA
) ||
3071 !(bctl
->flags
& BTRFS_BALANCE_METADATA
) ||
3072 memcmp(&bctl
->data
, &bctl
->meta
, sizeof(bctl
->data
))) {
3073 printk(KERN_ERR
"btrfs: with mixed groups data and "
3074 "metadata balance options must be the same\n");
3080 num_devices
= fs_info
->fs_devices
->num_devices
;
3081 btrfs_dev_replace_lock(&fs_info
->dev_replace
);
3082 if (btrfs_dev_replace_is_ongoing(&fs_info
->dev_replace
)) {
3083 BUG_ON(num_devices
< 1);
3086 btrfs_dev_replace_unlock(&fs_info
->dev_replace
);
3087 allowed
= BTRFS_AVAIL_ALLOC_BIT_SINGLE
;
3088 if (num_devices
== 1)
3089 allowed
|= BTRFS_BLOCK_GROUP_DUP
;
3090 else if (num_devices
< 4)
3091 allowed
|= (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID1
);
3093 allowed
|= (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID1
|
3094 BTRFS_BLOCK_GROUP_RAID10
);
3096 if ((bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3097 (!alloc_profile_is_valid(bctl
->data
.target
, 1) ||
3098 (bctl
->data
.target
& ~allowed
))) {
3099 printk(KERN_ERR
"btrfs: unable to start balance with target "
3100 "data profile %llu\n",
3101 (unsigned long long)bctl
->data
.target
);
3105 if ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3106 (!alloc_profile_is_valid(bctl
->meta
.target
, 1) ||
3107 (bctl
->meta
.target
& ~allowed
))) {
3108 printk(KERN_ERR
"btrfs: unable to start balance with target "
3109 "metadata profile %llu\n",
3110 (unsigned long long)bctl
->meta
.target
);
3114 if ((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3115 (!alloc_profile_is_valid(bctl
->sys
.target
, 1) ||
3116 (bctl
->sys
.target
& ~allowed
))) {
3117 printk(KERN_ERR
"btrfs: unable to start balance with target "
3118 "system profile %llu\n",
3119 (unsigned long long)bctl
->sys
.target
);
3124 /* allow dup'ed data chunks only in mixed mode */
3125 if (!mixed
&& (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3126 (bctl
->data
.target
& BTRFS_BLOCK_GROUP_DUP
)) {
3127 printk(KERN_ERR
"btrfs: dup for data is not allowed\n");
3132 /* allow to reduce meta or sys integrity only if force set */
3133 allowed
= BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
|
3134 BTRFS_BLOCK_GROUP_RAID10
;
3136 seq
= read_seqbegin(&fs_info
->profiles_lock
);
3138 if (((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3139 (fs_info
->avail_system_alloc_bits
& allowed
) &&
3140 !(bctl
->sys
.target
& allowed
)) ||
3141 ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
3142 (fs_info
->avail_metadata_alloc_bits
& allowed
) &&
3143 !(bctl
->meta
.target
& allowed
))) {
3144 if (bctl
->flags
& BTRFS_BALANCE_FORCE
) {
3145 printk(KERN_INFO
"btrfs: force reducing metadata "
3148 printk(KERN_ERR
"btrfs: balance will reduce metadata "
3149 "integrity, use force if you want this\n");
3154 } while (read_seqretry(&fs_info
->profiles_lock
, seq
));
3156 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
3157 int num_tolerated_disk_barrier_failures
;
3158 u64 target
= bctl
->sys
.target
;
3160 num_tolerated_disk_barrier_failures
=
3161 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
3162 if (num_tolerated_disk_barrier_failures
> 0 &&
3164 (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID0
|
3165 BTRFS_AVAIL_ALLOC_BIT_SINGLE
)))
3166 num_tolerated_disk_barrier_failures
= 0;
3167 else if (num_tolerated_disk_barrier_failures
> 1 &&
3169 (BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
)))
3170 num_tolerated_disk_barrier_failures
= 1;
3172 fs_info
->num_tolerated_disk_barrier_failures
=
3173 num_tolerated_disk_barrier_failures
;
3176 ret
= insert_balance_item(fs_info
->tree_root
, bctl
);
3177 if (ret
&& ret
!= -EEXIST
)
3180 if (!(bctl
->flags
& BTRFS_BALANCE_RESUME
)) {
3181 BUG_ON(ret
== -EEXIST
);
3182 set_balance_control(bctl
);
3184 BUG_ON(ret
!= -EEXIST
);
3185 spin_lock(&fs_info
->balance_lock
);
3186 update_balance_args(bctl
);
3187 spin_unlock(&fs_info
->balance_lock
);
3190 atomic_inc(&fs_info
->balance_running
);
3191 mutex_unlock(&fs_info
->balance_mutex
);
3193 ret
= __btrfs_balance(fs_info
);
3195 mutex_lock(&fs_info
->balance_mutex
);
3196 atomic_dec(&fs_info
->balance_running
);
3198 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
3199 fs_info
->num_tolerated_disk_barrier_failures
=
3200 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
3204 memset(bargs
, 0, sizeof(*bargs
));
3205 update_ioctl_balance_args(fs_info
, 0, bargs
);
3208 if ((ret
&& ret
!= -ECANCELED
&& ret
!= -ENOSPC
) ||
3209 balance_need_close(fs_info
)) {
3210 __cancel_balance(fs_info
);
3213 wake_up(&fs_info
->balance_wait_q
);
3217 if (bctl
->flags
& BTRFS_BALANCE_RESUME
)
3218 __cancel_balance(fs_info
);
3221 atomic_set(&fs_info
->mutually_exclusive_operation_running
, 0);
3226 static int balance_kthread(void *data
)
3228 struct btrfs_fs_info
*fs_info
= data
;
3231 mutex_lock(&fs_info
->volume_mutex
);
3232 mutex_lock(&fs_info
->balance_mutex
);
3234 if (fs_info
->balance_ctl
) {
3235 printk(KERN_INFO
"btrfs: continuing balance\n");
3236 ret
= btrfs_balance(fs_info
->balance_ctl
, NULL
);
3239 mutex_unlock(&fs_info
->balance_mutex
);
3240 mutex_unlock(&fs_info
->volume_mutex
);
3245 int btrfs_resume_balance_async(struct btrfs_fs_info
*fs_info
)
3247 struct task_struct
*tsk
;
3249 spin_lock(&fs_info
->balance_lock
);
3250 if (!fs_info
->balance_ctl
) {
3251 spin_unlock(&fs_info
->balance_lock
);
3254 spin_unlock(&fs_info
->balance_lock
);
3256 if (btrfs_test_opt(fs_info
->tree_root
, SKIP_BALANCE
)) {
3257 printk(KERN_INFO
"btrfs: force skipping balance\n");
3261 tsk
= kthread_run(balance_kthread
, fs_info
, "btrfs-balance");
3263 return PTR_ERR(tsk
);
3268 int btrfs_recover_balance(struct btrfs_fs_info
*fs_info
)
3270 struct btrfs_balance_control
*bctl
;
3271 struct btrfs_balance_item
*item
;
3272 struct btrfs_disk_balance_args disk_bargs
;
3273 struct btrfs_path
*path
;
3274 struct extent_buffer
*leaf
;
3275 struct btrfs_key key
;
3278 path
= btrfs_alloc_path();
3282 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
3283 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
3286 ret
= btrfs_search_slot(NULL
, fs_info
->tree_root
, &key
, path
, 0, 0);
3289 if (ret
> 0) { /* ret = -ENOENT; */
3294 bctl
= kzalloc(sizeof(*bctl
), GFP_NOFS
);
3300 leaf
= path
->nodes
[0];
3301 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
3303 bctl
->fs_info
= fs_info
;
3304 bctl
->flags
= btrfs_balance_flags(leaf
, item
);
3305 bctl
->flags
|= BTRFS_BALANCE_RESUME
;
3307 btrfs_balance_data(leaf
, item
, &disk_bargs
);
3308 btrfs_disk_balance_args_to_cpu(&bctl
->data
, &disk_bargs
);
3309 btrfs_balance_meta(leaf
, item
, &disk_bargs
);
3310 btrfs_disk_balance_args_to_cpu(&bctl
->meta
, &disk_bargs
);
3311 btrfs_balance_sys(leaf
, item
, &disk_bargs
);
3312 btrfs_disk_balance_args_to_cpu(&bctl
->sys
, &disk_bargs
);
3314 WARN_ON(atomic_xchg(&fs_info
->mutually_exclusive_operation_running
, 1));
3316 mutex_lock(&fs_info
->volume_mutex
);
3317 mutex_lock(&fs_info
->balance_mutex
);
3319 set_balance_control(bctl
);
3321 mutex_unlock(&fs_info
->balance_mutex
);
3322 mutex_unlock(&fs_info
->volume_mutex
);
3324 btrfs_free_path(path
);
3328 int btrfs_pause_balance(struct btrfs_fs_info
*fs_info
)
3332 mutex_lock(&fs_info
->balance_mutex
);
3333 if (!fs_info
->balance_ctl
) {
3334 mutex_unlock(&fs_info
->balance_mutex
);
3338 if (atomic_read(&fs_info
->balance_running
)) {
3339 atomic_inc(&fs_info
->balance_pause_req
);
3340 mutex_unlock(&fs_info
->balance_mutex
);
3342 wait_event(fs_info
->balance_wait_q
,
3343 atomic_read(&fs_info
->balance_running
) == 0);
3345 mutex_lock(&fs_info
->balance_mutex
);
3346 /* we are good with balance_ctl ripped off from under us */
3347 BUG_ON(atomic_read(&fs_info
->balance_running
));
3348 atomic_dec(&fs_info
->balance_pause_req
);
3353 mutex_unlock(&fs_info
->balance_mutex
);
3357 int btrfs_cancel_balance(struct btrfs_fs_info
*fs_info
)
3359 mutex_lock(&fs_info
->balance_mutex
);
3360 if (!fs_info
->balance_ctl
) {
3361 mutex_unlock(&fs_info
->balance_mutex
);
3365 atomic_inc(&fs_info
->balance_cancel_req
);
3367 * if we are running just wait and return, balance item is
3368 * deleted in btrfs_balance in this case
3370 if (atomic_read(&fs_info
->balance_running
)) {
3371 mutex_unlock(&fs_info
->balance_mutex
);
3372 wait_event(fs_info
->balance_wait_q
,
3373 atomic_read(&fs_info
->balance_running
) == 0);
3374 mutex_lock(&fs_info
->balance_mutex
);
3376 /* __cancel_balance needs volume_mutex */
3377 mutex_unlock(&fs_info
->balance_mutex
);
3378 mutex_lock(&fs_info
->volume_mutex
);
3379 mutex_lock(&fs_info
->balance_mutex
);
3381 if (fs_info
->balance_ctl
)
3382 __cancel_balance(fs_info
);
3384 mutex_unlock(&fs_info
->volume_mutex
);
3387 BUG_ON(fs_info
->balance_ctl
|| atomic_read(&fs_info
->balance_running
));
3388 atomic_dec(&fs_info
->balance_cancel_req
);
3389 mutex_unlock(&fs_info
->balance_mutex
);
3394 * shrinking a device means finding all of the device extents past
3395 * the new size, and then following the back refs to the chunks.
3396 * The chunk relocation code actually frees the device extent
3398 int btrfs_shrink_device(struct btrfs_device
*device
, u64 new_size
)
3400 struct btrfs_trans_handle
*trans
;
3401 struct btrfs_root
*root
= device
->dev_root
;
3402 struct btrfs_dev_extent
*dev_extent
= NULL
;
3403 struct btrfs_path
*path
;
3411 bool retried
= false;
3412 struct extent_buffer
*l
;
3413 struct btrfs_key key
;
3414 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3415 u64 old_total
= btrfs_super_total_bytes(super_copy
);
3416 u64 old_size
= device
->total_bytes
;
3417 u64 diff
= device
->total_bytes
- new_size
;
3419 if (device
->is_tgtdev_for_dev_replace
)
3422 path
= btrfs_alloc_path();
3430 device
->total_bytes
= new_size
;
3431 if (device
->writeable
) {
3432 device
->fs_devices
->total_rw_bytes
-= diff
;
3433 spin_lock(&root
->fs_info
->free_chunk_lock
);
3434 root
->fs_info
->free_chunk_space
-= diff
;
3435 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3437 unlock_chunks(root
);
3440 key
.objectid
= device
->devid
;
3441 key
.offset
= (u64
)-1;
3442 key
.type
= BTRFS_DEV_EXTENT_KEY
;
3445 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3449 ret
= btrfs_previous_item(root
, path
, 0, key
.type
);
3454 btrfs_release_path(path
);
3459 slot
= path
->slots
[0];
3460 btrfs_item_key_to_cpu(l
, &key
, path
->slots
[0]);
3462 if (key
.objectid
!= device
->devid
) {
3463 btrfs_release_path(path
);
3467 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
3468 length
= btrfs_dev_extent_length(l
, dev_extent
);
3470 if (key
.offset
+ length
<= new_size
) {
3471 btrfs_release_path(path
);
3475 chunk_tree
= btrfs_dev_extent_chunk_tree(l
, dev_extent
);
3476 chunk_objectid
= btrfs_dev_extent_chunk_objectid(l
, dev_extent
);
3477 chunk_offset
= btrfs_dev_extent_chunk_offset(l
, dev_extent
);
3478 btrfs_release_path(path
);
3480 ret
= btrfs_relocate_chunk(root
, chunk_tree
, chunk_objectid
,
3482 if (ret
&& ret
!= -ENOSPC
)
3486 } while (key
.offset
-- > 0);
3488 if (failed
&& !retried
) {
3492 } else if (failed
&& retried
) {
3496 device
->total_bytes
= old_size
;
3497 if (device
->writeable
)
3498 device
->fs_devices
->total_rw_bytes
+= diff
;
3499 spin_lock(&root
->fs_info
->free_chunk_lock
);
3500 root
->fs_info
->free_chunk_space
+= diff
;
3501 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3502 unlock_chunks(root
);
3506 /* Shrinking succeeded, else we would be at "done". */
3507 trans
= btrfs_start_transaction(root
, 0);
3508 if (IS_ERR(trans
)) {
3509 ret
= PTR_ERR(trans
);
3515 device
->disk_total_bytes
= new_size
;
3516 /* Now btrfs_update_device() will change the on-disk size. */
3517 ret
= btrfs_update_device(trans
, device
);
3519 unlock_chunks(root
);
3520 btrfs_end_transaction(trans
, root
);
3523 WARN_ON(diff
> old_total
);
3524 btrfs_set_super_total_bytes(super_copy
, old_total
- diff
);
3525 unlock_chunks(root
);
3526 btrfs_end_transaction(trans
, root
);
3528 btrfs_free_path(path
);
3532 static int btrfs_add_system_chunk(struct btrfs_root
*root
,
3533 struct btrfs_key
*key
,
3534 struct btrfs_chunk
*chunk
, int item_size
)
3536 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3537 struct btrfs_disk_key disk_key
;
3541 array_size
= btrfs_super_sys_array_size(super_copy
);
3542 if (array_size
+ item_size
> BTRFS_SYSTEM_CHUNK_ARRAY_SIZE
)
3545 ptr
= super_copy
->sys_chunk_array
+ array_size
;
3546 btrfs_cpu_key_to_disk(&disk_key
, key
);
3547 memcpy(ptr
, &disk_key
, sizeof(disk_key
));
3548 ptr
+= sizeof(disk_key
);
3549 memcpy(ptr
, chunk
, item_size
);
3550 item_size
+= sizeof(disk_key
);
3551 btrfs_set_super_sys_array_size(super_copy
, array_size
+ item_size
);
3556 * sort the devices in descending order by max_avail, total_avail
3558 static int btrfs_cmp_device_info(const void *a
, const void *b
)
3560 const struct btrfs_device_info
*di_a
= a
;
3561 const struct btrfs_device_info
*di_b
= b
;
3563 if (di_a
->max_avail
> di_b
->max_avail
)
3565 if (di_a
->max_avail
< di_b
->max_avail
)
3567 if (di_a
->total_avail
> di_b
->total_avail
)
3569 if (di_a
->total_avail
< di_b
->total_avail
)
3574 struct btrfs_raid_attr btrfs_raid_array
[BTRFS_NR_RAID_TYPES
] = {
3575 [BTRFS_RAID_RAID10
] = {
3578 .devs_max
= 0, /* 0 == as many as possible */
3580 .devs_increment
= 2,
3583 [BTRFS_RAID_RAID1
] = {
3588 .devs_increment
= 2,
3591 [BTRFS_RAID_DUP
] = {
3596 .devs_increment
= 1,
3599 [BTRFS_RAID_RAID0
] = {
3604 .devs_increment
= 1,
3607 [BTRFS_RAID_SINGLE
] = {
3612 .devs_increment
= 1,
3617 static int __btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
3618 struct btrfs_root
*extent_root
,
3619 struct map_lookup
**map_ret
,
3620 u64
*num_bytes_out
, u64
*stripe_size_out
,
3621 u64 start
, u64 type
)
3623 struct btrfs_fs_info
*info
= extent_root
->fs_info
;
3624 struct btrfs_fs_devices
*fs_devices
= info
->fs_devices
;
3625 struct list_head
*cur
;
3626 struct map_lookup
*map
= NULL
;
3627 struct extent_map_tree
*em_tree
;
3628 struct extent_map
*em
;
3629 struct btrfs_device_info
*devices_info
= NULL
;
3631 int num_stripes
; /* total number of stripes to allocate */
3632 int sub_stripes
; /* sub_stripes info for map */
3633 int dev_stripes
; /* stripes per dev */
3634 int devs_max
; /* max devs to use */
3635 int devs_min
; /* min devs needed */
3636 int devs_increment
; /* ndevs has to be a multiple of this */
3637 int ncopies
; /* how many copies to data has */
3639 u64 max_stripe_size
;
3648 BUG_ON(!alloc_profile_is_valid(type
, 0));
3650 if (list_empty(&fs_devices
->alloc_list
))
3653 index
= __get_raid_index(type
);
3655 sub_stripes
= btrfs_raid_array
[index
].sub_stripes
;
3656 dev_stripes
= btrfs_raid_array
[index
].dev_stripes
;
3657 devs_max
= btrfs_raid_array
[index
].devs_max
;
3658 devs_min
= btrfs_raid_array
[index
].devs_min
;
3659 devs_increment
= btrfs_raid_array
[index
].devs_increment
;
3660 ncopies
= btrfs_raid_array
[index
].ncopies
;
3662 if (type
& BTRFS_BLOCK_GROUP_DATA
) {
3663 max_stripe_size
= 1024 * 1024 * 1024;
3664 max_chunk_size
= 10 * max_stripe_size
;
3665 } else if (type
& BTRFS_BLOCK_GROUP_METADATA
) {
3666 /* for larger filesystems, use larger metadata chunks */
3667 if (fs_devices
->total_rw_bytes
> 50ULL * 1024 * 1024 * 1024)
3668 max_stripe_size
= 1024 * 1024 * 1024;
3670 max_stripe_size
= 256 * 1024 * 1024;
3671 max_chunk_size
= max_stripe_size
;
3672 } else if (type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
3673 max_stripe_size
= 32 * 1024 * 1024;
3674 max_chunk_size
= 2 * max_stripe_size
;
3676 printk(KERN_ERR
"btrfs: invalid chunk type 0x%llx requested\n",
3681 /* we don't want a chunk larger than 10% of writeable space */
3682 max_chunk_size
= min(div_factor(fs_devices
->total_rw_bytes
, 1),
3685 devices_info
= kzalloc(sizeof(*devices_info
) * fs_devices
->rw_devices
,
3690 cur
= fs_devices
->alloc_list
.next
;
3693 * in the first pass through the devices list, we gather information
3694 * about the available holes on each device.
3697 while (cur
!= &fs_devices
->alloc_list
) {
3698 struct btrfs_device
*device
;
3702 device
= list_entry(cur
, struct btrfs_device
, dev_alloc_list
);
3706 if (!device
->writeable
) {
3708 "btrfs: read-only device in alloc_list\n");
3712 if (!device
->in_fs_metadata
||
3713 device
->is_tgtdev_for_dev_replace
)
3716 if (device
->total_bytes
> device
->bytes_used
)
3717 total_avail
= device
->total_bytes
- device
->bytes_used
;
3721 /* If there is no space on this device, skip it. */
3722 if (total_avail
== 0)
3725 ret
= find_free_dev_extent(device
,
3726 max_stripe_size
* dev_stripes
,
3727 &dev_offset
, &max_avail
);
3728 if (ret
&& ret
!= -ENOSPC
)
3732 max_avail
= max_stripe_size
* dev_stripes
;
3734 if (max_avail
< BTRFS_STRIPE_LEN
* dev_stripes
)
3737 if (ndevs
== fs_devices
->rw_devices
) {
3738 WARN(1, "%s: found more than %llu devices\n",
3739 __func__
, fs_devices
->rw_devices
);
3742 devices_info
[ndevs
].dev_offset
= dev_offset
;
3743 devices_info
[ndevs
].max_avail
= max_avail
;
3744 devices_info
[ndevs
].total_avail
= total_avail
;
3745 devices_info
[ndevs
].dev
= device
;
3750 * now sort the devices by hole size / available space
3752 sort(devices_info
, ndevs
, sizeof(struct btrfs_device_info
),
3753 btrfs_cmp_device_info
, NULL
);
3755 /* round down to number of usable stripes */
3756 ndevs
-= ndevs
% devs_increment
;
3758 if (ndevs
< devs_increment
* sub_stripes
|| ndevs
< devs_min
) {
3763 if (devs_max
&& ndevs
> devs_max
)
3766 * the primary goal is to maximize the number of stripes, so use as many
3767 * devices as possible, even if the stripes are not maximum sized.
3769 stripe_size
= devices_info
[ndevs
-1].max_avail
;
3770 num_stripes
= ndevs
* dev_stripes
;
3772 if (stripe_size
* ndevs
> max_chunk_size
* ncopies
) {
3773 stripe_size
= max_chunk_size
* ncopies
;
3774 do_div(stripe_size
, ndevs
);
3777 do_div(stripe_size
, dev_stripes
);
3779 /* align to BTRFS_STRIPE_LEN */
3780 do_div(stripe_size
, BTRFS_STRIPE_LEN
);
3781 stripe_size
*= BTRFS_STRIPE_LEN
;
3783 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
3788 map
->num_stripes
= num_stripes
;
3790 for (i
= 0; i
< ndevs
; ++i
) {
3791 for (j
= 0; j
< dev_stripes
; ++j
) {
3792 int s
= i
* dev_stripes
+ j
;
3793 map
->stripes
[s
].dev
= devices_info
[i
].dev
;
3794 map
->stripes
[s
].physical
= devices_info
[i
].dev_offset
+
3798 map
->sector_size
= extent_root
->sectorsize
;
3799 map
->stripe_len
= BTRFS_STRIPE_LEN
;
3800 map
->io_align
= BTRFS_STRIPE_LEN
;
3801 map
->io_width
= BTRFS_STRIPE_LEN
;
3803 map
->sub_stripes
= sub_stripes
;
3806 num_bytes
= stripe_size
* (num_stripes
/ ncopies
);
3808 *stripe_size_out
= stripe_size
;
3809 *num_bytes_out
= num_bytes
;
3811 trace_btrfs_chunk_alloc(info
->chunk_root
, map
, start
, num_bytes
);
3813 em
= alloc_extent_map();
3818 em
->bdev
= (struct block_device
*)map
;
3820 em
->len
= num_bytes
;
3821 em
->block_start
= 0;
3822 em
->block_len
= em
->len
;
3824 em_tree
= &extent_root
->fs_info
->mapping_tree
.map_tree
;
3825 write_lock(&em_tree
->lock
);
3826 ret
= add_extent_mapping(em_tree
, em
);
3827 write_unlock(&em_tree
->lock
);
3829 free_extent_map(em
);
3833 for (i
= 0; i
< map
->num_stripes
; ++i
) {
3834 struct btrfs_device
*device
;
3837 device
= map
->stripes
[i
].dev
;
3838 dev_offset
= map
->stripes
[i
].physical
;
3840 ret
= btrfs_alloc_dev_extent(trans
, device
,
3841 info
->chunk_root
->root_key
.objectid
,
3842 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3843 start
, dev_offset
, stripe_size
);
3845 goto error_dev_extent
;
3848 ret
= btrfs_make_block_group(trans
, extent_root
, 0, type
,
3849 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3852 i
= map
->num_stripes
- 1;
3853 goto error_dev_extent
;
3856 free_extent_map(em
);
3857 kfree(devices_info
);
3861 for (; i
>= 0; i
--) {
3862 struct btrfs_device
*device
;
3865 device
= map
->stripes
[i
].dev
;
3866 err
= btrfs_free_dev_extent(trans
, device
, start
);
3868 btrfs_abort_transaction(trans
, extent_root
, err
);
3872 write_lock(&em_tree
->lock
);
3873 remove_extent_mapping(em_tree
, em
);
3874 write_unlock(&em_tree
->lock
);
3876 /* One for our allocation */
3877 free_extent_map(em
);
3878 /* One for the tree reference */
3879 free_extent_map(em
);
3882 kfree(devices_info
);
3886 static int __finish_chunk_alloc(struct btrfs_trans_handle
*trans
,
3887 struct btrfs_root
*extent_root
,
3888 struct map_lookup
*map
, u64 chunk_offset
,
3889 u64 chunk_size
, u64 stripe_size
)
3892 struct btrfs_key key
;
3893 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
3894 struct btrfs_device
*device
;
3895 struct btrfs_chunk
*chunk
;
3896 struct btrfs_stripe
*stripe
;
3897 size_t item_size
= btrfs_chunk_item_size(map
->num_stripes
);
3901 chunk
= kzalloc(item_size
, GFP_NOFS
);
3906 while (index
< map
->num_stripes
) {
3907 device
= map
->stripes
[index
].dev
;
3908 device
->bytes_used
+= stripe_size
;
3909 ret
= btrfs_update_device(trans
, device
);
3915 spin_lock(&extent_root
->fs_info
->free_chunk_lock
);
3916 extent_root
->fs_info
->free_chunk_space
-= (stripe_size
*
3918 spin_unlock(&extent_root
->fs_info
->free_chunk_lock
);
3921 stripe
= &chunk
->stripe
;
3922 while (index
< map
->num_stripes
) {
3923 device
= map
->stripes
[index
].dev
;
3924 dev_offset
= map
->stripes
[index
].physical
;
3926 btrfs_set_stack_stripe_devid(stripe
, device
->devid
);
3927 btrfs_set_stack_stripe_offset(stripe
, dev_offset
);
3928 memcpy(stripe
->dev_uuid
, device
->uuid
, BTRFS_UUID_SIZE
);
3933 btrfs_set_stack_chunk_length(chunk
, chunk_size
);
3934 btrfs_set_stack_chunk_owner(chunk
, extent_root
->root_key
.objectid
);
3935 btrfs_set_stack_chunk_stripe_len(chunk
, map
->stripe_len
);
3936 btrfs_set_stack_chunk_type(chunk
, map
->type
);
3937 btrfs_set_stack_chunk_num_stripes(chunk
, map
->num_stripes
);
3938 btrfs_set_stack_chunk_io_align(chunk
, map
->stripe_len
);
3939 btrfs_set_stack_chunk_io_width(chunk
, map
->stripe_len
);
3940 btrfs_set_stack_chunk_sector_size(chunk
, extent_root
->sectorsize
);
3941 btrfs_set_stack_chunk_sub_stripes(chunk
, map
->sub_stripes
);
3943 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
3944 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
3945 key
.offset
= chunk_offset
;
3947 ret
= btrfs_insert_item(trans
, chunk_root
, &key
, chunk
, item_size
);
3949 if (ret
== 0 && map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
3951 * TODO: Cleanup of inserted chunk root in case of
3954 ret
= btrfs_add_system_chunk(chunk_root
, &key
, chunk
,
3964 * Chunk allocation falls into two parts. The first part does works
3965 * that make the new allocated chunk useable, but not do any operation
3966 * that modifies the chunk tree. The second part does the works that
3967 * require modifying the chunk tree. This division is important for the
3968 * bootstrap process of adding storage to a seed btrfs.
3970 int btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
3971 struct btrfs_root
*extent_root
, u64 type
)
3976 struct map_lookup
*map
;
3977 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
3980 ret
= find_next_chunk(chunk_root
, BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3985 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &map
, &chunk_size
,
3986 &stripe_size
, chunk_offset
, type
);
3990 ret
= __finish_chunk_alloc(trans
, extent_root
, map
, chunk_offset
,
3991 chunk_size
, stripe_size
);
3997 static noinline
int init_first_rw_device(struct btrfs_trans_handle
*trans
,
3998 struct btrfs_root
*root
,
3999 struct btrfs_device
*device
)
4002 u64 sys_chunk_offset
;
4006 u64 sys_stripe_size
;
4008 struct map_lookup
*map
;
4009 struct map_lookup
*sys_map
;
4010 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
4011 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
4014 ret
= find_next_chunk(fs_info
->chunk_root
,
4015 BTRFS_FIRST_CHUNK_TREE_OBJECTID
, &chunk_offset
);
4019 alloc_profile
= btrfs_get_alloc_profile(extent_root
, 0);
4020 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &map
, &chunk_size
,
4021 &stripe_size
, chunk_offset
, alloc_profile
);
4025 sys_chunk_offset
= chunk_offset
+ chunk_size
;
4027 alloc_profile
= btrfs_get_alloc_profile(fs_info
->chunk_root
, 0);
4028 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &sys_map
,
4029 &sys_chunk_size
, &sys_stripe_size
,
4030 sys_chunk_offset
, alloc_profile
);
4032 btrfs_abort_transaction(trans
, root
, ret
);
4036 ret
= btrfs_add_device(trans
, fs_info
->chunk_root
, device
);
4038 btrfs_abort_transaction(trans
, root
, ret
);
4043 * Modifying chunk tree needs allocating new blocks from both
4044 * system block group and metadata block group. So we only can
4045 * do operations require modifying the chunk tree after both
4046 * block groups were created.
4048 ret
= __finish_chunk_alloc(trans
, extent_root
, map
, chunk_offset
,
4049 chunk_size
, stripe_size
);
4051 btrfs_abort_transaction(trans
, root
, ret
);
4055 ret
= __finish_chunk_alloc(trans
, extent_root
, sys_map
,
4056 sys_chunk_offset
, sys_chunk_size
,
4059 btrfs_abort_transaction(trans
, root
, ret
);
4066 int btrfs_chunk_readonly(struct btrfs_root
*root
, u64 chunk_offset
)
4068 struct extent_map
*em
;
4069 struct map_lookup
*map
;
4070 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
4074 read_lock(&map_tree
->map_tree
.lock
);
4075 em
= lookup_extent_mapping(&map_tree
->map_tree
, chunk_offset
, 1);
4076 read_unlock(&map_tree
->map_tree
.lock
);
4080 if (btrfs_test_opt(root
, DEGRADED
)) {
4081 free_extent_map(em
);
4085 map
= (struct map_lookup
*)em
->bdev
;
4086 for (i
= 0; i
< map
->num_stripes
; i
++) {
4087 if (!map
->stripes
[i
].dev
->writeable
) {
4092 free_extent_map(em
);
4096 void btrfs_mapping_init(struct btrfs_mapping_tree
*tree
)
4098 extent_map_tree_init(&tree
->map_tree
);
4101 void btrfs_mapping_tree_free(struct btrfs_mapping_tree
*tree
)
4103 struct extent_map
*em
;
4106 write_lock(&tree
->map_tree
.lock
);
4107 em
= lookup_extent_mapping(&tree
->map_tree
, 0, (u64
)-1);
4109 remove_extent_mapping(&tree
->map_tree
, em
);
4110 write_unlock(&tree
->map_tree
.lock
);
4115 free_extent_map(em
);
4116 /* once for the tree */
4117 free_extent_map(em
);
4121 int btrfs_num_copies(struct btrfs_fs_info
*fs_info
, u64 logical
, u64 len
)
4123 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
4124 struct extent_map
*em
;
4125 struct map_lookup
*map
;
4126 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4129 read_lock(&em_tree
->lock
);
4130 em
= lookup_extent_mapping(em_tree
, logical
, len
);
4131 read_unlock(&em_tree
->lock
);
4134 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
4135 map
= (struct map_lookup
*)em
->bdev
;
4136 if (map
->type
& (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
))
4137 ret
= map
->num_stripes
;
4138 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
4139 ret
= map
->sub_stripes
;
4142 free_extent_map(em
);
4144 btrfs_dev_replace_lock(&fs_info
->dev_replace
);
4145 if (btrfs_dev_replace_is_ongoing(&fs_info
->dev_replace
))
4147 btrfs_dev_replace_unlock(&fs_info
->dev_replace
);
4152 static int find_live_mirror(struct btrfs_fs_info
*fs_info
,
4153 struct map_lookup
*map
, int first
, int num
,
4154 int optimal
, int dev_replace_is_ongoing
)
4158 struct btrfs_device
*srcdev
;
4160 if (dev_replace_is_ongoing
&&
4161 fs_info
->dev_replace
.cont_reading_from_srcdev_mode
==
4162 BTRFS_DEV_REPLACE_ITEM_CONT_READING_FROM_SRCDEV_MODE_AVOID
)
4163 srcdev
= fs_info
->dev_replace
.srcdev
;
4168 * try to avoid the drive that is the source drive for a
4169 * dev-replace procedure, only choose it if no other non-missing
4170 * mirror is available
4172 for (tolerance
= 0; tolerance
< 2; tolerance
++) {
4173 if (map
->stripes
[optimal
].dev
->bdev
&&
4174 (tolerance
|| map
->stripes
[optimal
].dev
!= srcdev
))
4176 for (i
= first
; i
< first
+ num
; i
++) {
4177 if (map
->stripes
[i
].dev
->bdev
&&
4178 (tolerance
|| map
->stripes
[i
].dev
!= srcdev
))
4183 /* we couldn't find one that doesn't fail. Just return something
4184 * and the io error handling code will clean up eventually
4189 static int __btrfs_map_block(struct btrfs_fs_info
*fs_info
, int rw
,
4190 u64 logical
, u64
*length
,
4191 struct btrfs_bio
**bbio_ret
,
4194 struct extent_map
*em
;
4195 struct map_lookup
*map
;
4196 struct btrfs_mapping_tree
*map_tree
= &fs_info
->mapping_tree
;
4197 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4200 u64 stripe_end_offset
;
4209 struct btrfs_bio
*bbio
= NULL
;
4210 struct btrfs_dev_replace
*dev_replace
= &fs_info
->dev_replace
;
4211 int dev_replace_is_ongoing
= 0;
4212 int num_alloc_stripes
;
4213 int patch_the_first_stripe_for_dev_replace
= 0;
4214 u64 physical_to_patch_in_first_stripe
= 0;
4216 read_lock(&em_tree
->lock
);
4217 em
= lookup_extent_mapping(em_tree
, logical
, *length
);
4218 read_unlock(&em_tree
->lock
);
4221 printk(KERN_CRIT
"btrfs: unable to find logical %llu len %llu\n",
4222 (unsigned long long)logical
,
4223 (unsigned long long)*length
);
4227 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
4228 map
= (struct map_lookup
*)em
->bdev
;
4229 offset
= logical
- em
->start
;
4233 * stripe_nr counts the total number of stripes we have to stride
4234 * to get to this block
4236 do_div(stripe_nr
, map
->stripe_len
);
4238 stripe_offset
= stripe_nr
* map
->stripe_len
;
4239 BUG_ON(offset
< stripe_offset
);
4241 /* stripe_offset is the offset of this block in its stripe*/
4242 stripe_offset
= offset
- stripe_offset
;
4244 if (rw
& REQ_DISCARD
)
4245 *length
= min_t(u64
, em
->len
- offset
, *length
);
4246 else if (map
->type
& BTRFS_BLOCK_GROUP_PROFILE_MASK
) {
4247 /* we limit the length of each bio to what fits in a stripe */
4248 *length
= min_t(u64
, em
->len
- offset
,
4249 map
->stripe_len
- stripe_offset
);
4251 *length
= em
->len
- offset
;
4257 btrfs_dev_replace_lock(dev_replace
);
4258 dev_replace_is_ongoing
= btrfs_dev_replace_is_ongoing(dev_replace
);
4259 if (!dev_replace_is_ongoing
)
4260 btrfs_dev_replace_unlock(dev_replace
);
4262 if (dev_replace_is_ongoing
&& mirror_num
== map
->num_stripes
+ 1 &&
4263 !(rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
)) &&
4264 dev_replace
->tgtdev
!= NULL
) {
4266 * in dev-replace case, for repair case (that's the only
4267 * case where the mirror is selected explicitly when
4268 * calling btrfs_map_block), blocks left of the left cursor
4269 * can also be read from the target drive.
4270 * For REQ_GET_READ_MIRRORS, the target drive is added as
4271 * the last one to the array of stripes. For READ, it also
4272 * needs to be supported using the same mirror number.
4273 * If the requested block is not left of the left cursor,
4274 * EIO is returned. This can happen because btrfs_num_copies()
4275 * returns one more in the dev-replace case.
4277 u64 tmp_length
= *length
;
4278 struct btrfs_bio
*tmp_bbio
= NULL
;
4279 int tmp_num_stripes
;
4280 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
4281 int index_srcdev
= 0;
4283 u64 physical_of_found
= 0;
4285 ret
= __btrfs_map_block(fs_info
, REQ_GET_READ_MIRRORS
,
4286 logical
, &tmp_length
, &tmp_bbio
, 0);
4288 WARN_ON(tmp_bbio
!= NULL
);
4292 tmp_num_stripes
= tmp_bbio
->num_stripes
;
4293 if (mirror_num
> tmp_num_stripes
) {
4295 * REQ_GET_READ_MIRRORS does not contain this
4296 * mirror, that means that the requested area
4297 * is not left of the left cursor
4305 * process the rest of the function using the mirror_num
4306 * of the source drive. Therefore look it up first.
4307 * At the end, patch the device pointer to the one of the
4310 for (i
= 0; i
< tmp_num_stripes
; i
++) {
4311 if (tmp_bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
4313 * In case of DUP, in order to keep it
4314 * simple, only add the mirror with the
4315 * lowest physical address
4318 physical_of_found
<=
4319 tmp_bbio
->stripes
[i
].physical
)
4324 tmp_bbio
->stripes
[i
].physical
;
4329 mirror_num
= index_srcdev
+ 1;
4330 patch_the_first_stripe_for_dev_replace
= 1;
4331 physical_to_patch_in_first_stripe
= physical_of_found
;
4340 } else if (mirror_num
> map
->num_stripes
) {
4346 stripe_nr_orig
= stripe_nr
;
4347 stripe_nr_end
= (offset
+ *length
+ map
->stripe_len
- 1) &
4348 (~(map
->stripe_len
- 1));
4349 do_div(stripe_nr_end
, map
->stripe_len
);
4350 stripe_end_offset
= stripe_nr_end
* map
->stripe_len
-
4352 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
4353 if (rw
& REQ_DISCARD
)
4354 num_stripes
= min_t(u64
, map
->num_stripes
,
4355 stripe_nr_end
- stripe_nr_orig
);
4356 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
4357 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID1
) {
4358 if (rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
))
4359 num_stripes
= map
->num_stripes
;
4360 else if (mirror_num
)
4361 stripe_index
= mirror_num
- 1;
4363 stripe_index
= find_live_mirror(fs_info
, map
, 0,
4365 current
->pid
% map
->num_stripes
,
4366 dev_replace_is_ongoing
);
4367 mirror_num
= stripe_index
+ 1;
4370 } else if (map
->type
& BTRFS_BLOCK_GROUP_DUP
) {
4371 if (rw
& (REQ_WRITE
| REQ_DISCARD
| REQ_GET_READ_MIRRORS
)) {
4372 num_stripes
= map
->num_stripes
;
4373 } else if (mirror_num
) {
4374 stripe_index
= mirror_num
- 1;
4379 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
4380 int factor
= map
->num_stripes
/ map
->sub_stripes
;
4382 stripe_index
= do_div(stripe_nr
, factor
);
4383 stripe_index
*= map
->sub_stripes
;
4385 if (rw
& (REQ_WRITE
| REQ_GET_READ_MIRRORS
))
4386 num_stripes
= map
->sub_stripes
;
4387 else if (rw
& REQ_DISCARD
)
4388 num_stripes
= min_t(u64
, map
->sub_stripes
*
4389 (stripe_nr_end
- stripe_nr_orig
),
4391 else if (mirror_num
)
4392 stripe_index
+= mirror_num
- 1;
4394 int old_stripe_index
= stripe_index
;
4395 stripe_index
= find_live_mirror(fs_info
, map
,
4397 map
->sub_stripes
, stripe_index
+
4398 current
->pid
% map
->sub_stripes
,
4399 dev_replace_is_ongoing
);
4400 mirror_num
= stripe_index
- old_stripe_index
+ 1;
4404 * after this do_div call, stripe_nr is the number of stripes
4405 * on this device we have to walk to find the data, and
4406 * stripe_index is the number of our device in the stripe array
4408 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
4409 mirror_num
= stripe_index
+ 1;
4411 BUG_ON(stripe_index
>= map
->num_stripes
);
4413 num_alloc_stripes
= num_stripes
;
4414 if (dev_replace_is_ongoing
) {
4415 if (rw
& (REQ_WRITE
| REQ_DISCARD
))
4416 num_alloc_stripes
<<= 1;
4417 if (rw
& REQ_GET_READ_MIRRORS
)
4418 num_alloc_stripes
++;
4420 bbio
= kzalloc(btrfs_bio_size(num_alloc_stripes
), GFP_NOFS
);
4425 atomic_set(&bbio
->error
, 0);
4427 if (rw
& REQ_DISCARD
) {
4429 int sub_stripes
= 0;
4430 u64 stripes_per_dev
= 0;
4431 u32 remaining_stripes
= 0;
4432 u32 last_stripe
= 0;
4435 (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID10
)) {
4436 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
4439 sub_stripes
= map
->sub_stripes
;
4441 factor
= map
->num_stripes
/ sub_stripes
;
4442 stripes_per_dev
= div_u64_rem(stripe_nr_end
-
4445 &remaining_stripes
);
4446 div_u64_rem(stripe_nr_end
- 1, factor
, &last_stripe
);
4447 last_stripe
*= sub_stripes
;
4450 for (i
= 0; i
< num_stripes
; i
++) {
4451 bbio
->stripes
[i
].physical
=
4452 map
->stripes
[stripe_index
].physical
+
4453 stripe_offset
+ stripe_nr
* map
->stripe_len
;
4454 bbio
->stripes
[i
].dev
= map
->stripes
[stripe_index
].dev
;
4456 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID0
|
4457 BTRFS_BLOCK_GROUP_RAID10
)) {
4458 bbio
->stripes
[i
].length
= stripes_per_dev
*
4461 if (i
/ sub_stripes
< remaining_stripes
)
4462 bbio
->stripes
[i
].length
+=
4466 * Special for the first stripe and
4469 * |-------|...|-------|
4473 if (i
< sub_stripes
)
4474 bbio
->stripes
[i
].length
-=
4477 if (stripe_index
>= last_stripe
&&
4478 stripe_index
<= (last_stripe
+
4480 bbio
->stripes
[i
].length
-=
4483 if (i
== sub_stripes
- 1)
4486 bbio
->stripes
[i
].length
= *length
;
4489 if (stripe_index
== map
->num_stripes
) {
4490 /* This could only happen for RAID0/10 */
4496 for (i
= 0; i
< num_stripes
; i
++) {
4497 bbio
->stripes
[i
].physical
=
4498 map
->stripes
[stripe_index
].physical
+
4500 stripe_nr
* map
->stripe_len
;
4501 bbio
->stripes
[i
].dev
=
4502 map
->stripes
[stripe_index
].dev
;
4507 if (rw
& (REQ_WRITE
| REQ_GET_READ_MIRRORS
)) {
4508 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID1
|
4509 BTRFS_BLOCK_GROUP_RAID10
|
4510 BTRFS_BLOCK_GROUP_DUP
)) {
4515 if (dev_replace_is_ongoing
&& (rw
& (REQ_WRITE
| REQ_DISCARD
)) &&
4516 dev_replace
->tgtdev
!= NULL
) {
4517 int index_where_to_add
;
4518 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
4521 * duplicate the write operations while the dev replace
4522 * procedure is running. Since the copying of the old disk
4523 * to the new disk takes place at run time while the
4524 * filesystem is mounted writable, the regular write
4525 * operations to the old disk have to be duplicated to go
4526 * to the new disk as well.
4527 * Note that device->missing is handled by the caller, and
4528 * that the write to the old disk is already set up in the
4531 index_where_to_add
= num_stripes
;
4532 for (i
= 0; i
< num_stripes
; i
++) {
4533 if (bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
4534 /* write to new disk, too */
4535 struct btrfs_bio_stripe
*new =
4536 bbio
->stripes
+ index_where_to_add
;
4537 struct btrfs_bio_stripe
*old
=
4540 new->physical
= old
->physical
;
4541 new->length
= old
->length
;
4542 new->dev
= dev_replace
->tgtdev
;
4543 index_where_to_add
++;
4547 num_stripes
= index_where_to_add
;
4548 } else if (dev_replace_is_ongoing
&& (rw
& REQ_GET_READ_MIRRORS
) &&
4549 dev_replace
->tgtdev
!= NULL
) {
4550 u64 srcdev_devid
= dev_replace
->srcdev
->devid
;
4551 int index_srcdev
= 0;
4553 u64 physical_of_found
= 0;
4556 * During the dev-replace procedure, the target drive can
4557 * also be used to read data in case it is needed to repair
4558 * a corrupt block elsewhere. This is possible if the
4559 * requested area is left of the left cursor. In this area,
4560 * the target drive is a full copy of the source drive.
4562 for (i
= 0; i
< num_stripes
; i
++) {
4563 if (bbio
->stripes
[i
].dev
->devid
== srcdev_devid
) {
4565 * In case of DUP, in order to keep it
4566 * simple, only add the mirror with the
4567 * lowest physical address
4570 physical_of_found
<=
4571 bbio
->stripes
[i
].physical
)
4575 physical_of_found
= bbio
->stripes
[i
].physical
;
4579 u64 length
= map
->stripe_len
;
4581 if (physical_of_found
+ length
<=
4582 dev_replace
->cursor_left
) {
4583 struct btrfs_bio_stripe
*tgtdev_stripe
=
4584 bbio
->stripes
+ num_stripes
;
4586 tgtdev_stripe
->physical
= physical_of_found
;
4587 tgtdev_stripe
->length
=
4588 bbio
->stripes
[index_srcdev
].length
;
4589 tgtdev_stripe
->dev
= dev_replace
->tgtdev
;
4597 bbio
->num_stripes
= num_stripes
;
4598 bbio
->max_errors
= max_errors
;
4599 bbio
->mirror_num
= mirror_num
;
4602 * this is the case that REQ_READ && dev_replace_is_ongoing &&
4603 * mirror_num == num_stripes + 1 && dev_replace target drive is
4604 * available as a mirror
4606 if (patch_the_first_stripe_for_dev_replace
&& num_stripes
> 0) {
4607 WARN_ON(num_stripes
> 1);
4608 bbio
->stripes
[0].dev
= dev_replace
->tgtdev
;
4609 bbio
->stripes
[0].physical
= physical_to_patch_in_first_stripe
;
4610 bbio
->mirror_num
= map
->num_stripes
+ 1;
4613 if (dev_replace_is_ongoing
)
4614 btrfs_dev_replace_unlock(dev_replace
);
4615 free_extent_map(em
);
4619 int btrfs_map_block(struct btrfs_fs_info
*fs_info
, int rw
,
4620 u64 logical
, u64
*length
,
4621 struct btrfs_bio
**bbio_ret
, int mirror_num
)
4623 return __btrfs_map_block(fs_info
, rw
, logical
, length
, bbio_ret
,
4627 int btrfs_rmap_block(struct btrfs_mapping_tree
*map_tree
,
4628 u64 chunk_start
, u64 physical
, u64 devid
,
4629 u64
**logical
, int *naddrs
, int *stripe_len
)
4631 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4632 struct extent_map
*em
;
4633 struct map_lookup
*map
;
4640 read_lock(&em_tree
->lock
);
4641 em
= lookup_extent_mapping(em_tree
, chunk_start
, 1);
4642 read_unlock(&em_tree
->lock
);
4644 BUG_ON(!em
|| em
->start
!= chunk_start
);
4645 map
= (struct map_lookup
*)em
->bdev
;
4648 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
4649 do_div(length
, map
->num_stripes
/ map
->sub_stripes
);
4650 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
4651 do_div(length
, map
->num_stripes
);
4653 buf
= kzalloc(sizeof(u64
) * map
->num_stripes
, GFP_NOFS
);
4654 BUG_ON(!buf
); /* -ENOMEM */
4656 for (i
= 0; i
< map
->num_stripes
; i
++) {
4657 if (devid
&& map
->stripes
[i
].dev
->devid
!= devid
)
4659 if (map
->stripes
[i
].physical
> physical
||
4660 map
->stripes
[i
].physical
+ length
<= physical
)
4663 stripe_nr
= physical
- map
->stripes
[i
].physical
;
4664 do_div(stripe_nr
, map
->stripe_len
);
4666 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
4667 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
4668 do_div(stripe_nr
, map
->sub_stripes
);
4669 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
4670 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
4672 bytenr
= chunk_start
+ stripe_nr
* map
->stripe_len
;
4673 WARN_ON(nr
>= map
->num_stripes
);
4674 for (j
= 0; j
< nr
; j
++) {
4675 if (buf
[j
] == bytenr
)
4679 WARN_ON(nr
>= map
->num_stripes
);
4686 *stripe_len
= map
->stripe_len
;
4688 free_extent_map(em
);
4692 static void *merge_stripe_index_into_bio_private(void *bi_private
,
4693 unsigned int stripe_index
)
4696 * with single, dup, RAID0, RAID1 and RAID10, stripe_index is
4698 * The alternative solution (instead of stealing bits from the
4699 * pointer) would be to allocate an intermediate structure
4700 * that contains the old private pointer plus the stripe_index.
4702 BUG_ON((((uintptr_t)bi_private
) & 3) != 0);
4703 BUG_ON(stripe_index
> 3);
4704 return (void *)(((uintptr_t)bi_private
) | stripe_index
);
4707 static struct btrfs_bio
*extract_bbio_from_bio_private(void *bi_private
)
4709 return (struct btrfs_bio
*)(((uintptr_t)bi_private
) & ~((uintptr_t)3));
4712 static unsigned int extract_stripe_index_from_bio_private(void *bi_private
)
4714 return (unsigned int)((uintptr_t)bi_private
) & 3;
4717 static void btrfs_end_bio(struct bio
*bio
, int err
)
4719 struct btrfs_bio
*bbio
= extract_bbio_from_bio_private(bio
->bi_private
);
4720 int is_orig_bio
= 0;
4723 atomic_inc(&bbio
->error
);
4724 if (err
== -EIO
|| err
== -EREMOTEIO
) {
4725 unsigned int stripe_index
=
4726 extract_stripe_index_from_bio_private(
4728 struct btrfs_device
*dev
;
4730 BUG_ON(stripe_index
>= bbio
->num_stripes
);
4731 dev
= bbio
->stripes
[stripe_index
].dev
;
4733 if (bio
->bi_rw
& WRITE
)
4734 btrfs_dev_stat_inc(dev
,
4735 BTRFS_DEV_STAT_WRITE_ERRS
);
4737 btrfs_dev_stat_inc(dev
,
4738 BTRFS_DEV_STAT_READ_ERRS
);
4739 if ((bio
->bi_rw
& WRITE_FLUSH
) == WRITE_FLUSH
)
4740 btrfs_dev_stat_inc(dev
,
4741 BTRFS_DEV_STAT_FLUSH_ERRS
);
4742 btrfs_dev_stat_print_on_error(dev
);
4747 if (bio
== bbio
->orig_bio
)
4750 if (atomic_dec_and_test(&bbio
->stripes_pending
)) {
4753 bio
= bbio
->orig_bio
;
4755 bio
->bi_private
= bbio
->private;
4756 bio
->bi_end_io
= bbio
->end_io
;
4757 bio
->bi_bdev
= (struct block_device
*)
4758 (unsigned long)bbio
->mirror_num
;
4759 /* only send an error to the higher layers if it is
4760 * beyond the tolerance of the multi-bio
4762 if (atomic_read(&bbio
->error
) > bbio
->max_errors
) {
4766 * this bio is actually up to date, we didn't
4767 * go over the max number of errors
4769 set_bit(BIO_UPTODATE
, &bio
->bi_flags
);
4774 bio_endio(bio
, err
);
4775 } else if (!is_orig_bio
) {
4780 struct async_sched
{
4783 struct btrfs_fs_info
*info
;
4784 struct btrfs_work work
;
4788 * see run_scheduled_bios for a description of why bios are collected for
4791 * This will add one bio to the pending list for a device and make sure
4792 * the work struct is scheduled.
4794 static noinline
void schedule_bio(struct btrfs_root
*root
,
4795 struct btrfs_device
*device
,
4796 int rw
, struct bio
*bio
)
4798 int should_queue
= 1;
4799 struct btrfs_pending_bios
*pending_bios
;
4801 /* don't bother with additional async steps for reads, right now */
4802 if (!(rw
& REQ_WRITE
)) {
4804 btrfsic_submit_bio(rw
, bio
);
4810 * nr_async_bios allows us to reliably return congestion to the
4811 * higher layers. Otherwise, the async bio makes it appear we have
4812 * made progress against dirty pages when we've really just put it
4813 * on a queue for later
4815 atomic_inc(&root
->fs_info
->nr_async_bios
);
4816 WARN_ON(bio
->bi_next
);
4817 bio
->bi_next
= NULL
;
4820 spin_lock(&device
->io_lock
);
4821 if (bio
->bi_rw
& REQ_SYNC
)
4822 pending_bios
= &device
->pending_sync_bios
;
4824 pending_bios
= &device
->pending_bios
;
4826 if (pending_bios
->tail
)
4827 pending_bios
->tail
->bi_next
= bio
;
4829 pending_bios
->tail
= bio
;
4830 if (!pending_bios
->head
)
4831 pending_bios
->head
= bio
;
4832 if (device
->running_pending
)
4835 spin_unlock(&device
->io_lock
);
4838 btrfs_queue_worker(&root
->fs_info
->submit_workers
,
4842 static int bio_size_ok(struct block_device
*bdev
, struct bio
*bio
,
4845 struct bio_vec
*prev
;
4846 struct request_queue
*q
= bdev_get_queue(bdev
);
4847 unsigned short max_sectors
= queue_max_sectors(q
);
4848 struct bvec_merge_data bvm
= {
4850 .bi_sector
= sector
,
4851 .bi_rw
= bio
->bi_rw
,
4854 if (bio
->bi_vcnt
== 0) {
4859 prev
= &bio
->bi_io_vec
[bio
->bi_vcnt
- 1];
4860 if ((bio
->bi_size
>> 9) > max_sectors
)
4863 if (!q
->merge_bvec_fn
)
4866 bvm
.bi_size
= bio
->bi_size
- prev
->bv_len
;
4867 if (q
->merge_bvec_fn(q
, &bvm
, prev
) < prev
->bv_len
)
4872 static void submit_stripe_bio(struct btrfs_root
*root
, struct btrfs_bio
*bbio
,
4873 struct bio
*bio
, u64 physical
, int dev_nr
,
4876 struct btrfs_device
*dev
= bbio
->stripes
[dev_nr
].dev
;
4878 bio
->bi_private
= bbio
;
4879 bio
->bi_private
= merge_stripe_index_into_bio_private(
4880 bio
->bi_private
, (unsigned int)dev_nr
);
4881 bio
->bi_end_io
= btrfs_end_bio
;
4882 bio
->bi_sector
= physical
>> 9;
4885 struct rcu_string
*name
;
4888 name
= rcu_dereference(dev
->name
);
4889 pr_debug("btrfs_map_bio: rw %d, sector=%llu, dev=%lu "
4890 "(%s id %llu), size=%u\n", rw
,
4891 (u64
)bio
->bi_sector
, (u_long
)dev
->bdev
->bd_dev
,
4892 name
->str
, dev
->devid
, bio
->bi_size
);
4896 bio
->bi_bdev
= dev
->bdev
;
4898 schedule_bio(root
, dev
, rw
, bio
);
4900 btrfsic_submit_bio(rw
, bio
);
4903 static int breakup_stripe_bio(struct btrfs_root
*root
, struct btrfs_bio
*bbio
,
4904 struct bio
*first_bio
, struct btrfs_device
*dev
,
4905 int dev_nr
, int rw
, int async
)
4907 struct bio_vec
*bvec
= first_bio
->bi_io_vec
;
4909 int nr_vecs
= bio_get_nr_vecs(dev
->bdev
);
4910 u64 physical
= bbio
->stripes
[dev_nr
].physical
;
4913 bio
= btrfs_bio_alloc(dev
->bdev
, physical
>> 9, nr_vecs
, GFP_NOFS
);
4917 while (bvec
<= (first_bio
->bi_io_vec
+ first_bio
->bi_vcnt
- 1)) {
4918 if (bio_add_page(bio
, bvec
->bv_page
, bvec
->bv_len
,
4919 bvec
->bv_offset
) < bvec
->bv_len
) {
4920 u64 len
= bio
->bi_size
;
4922 atomic_inc(&bbio
->stripes_pending
);
4923 submit_stripe_bio(root
, bbio
, bio
, physical
, dev_nr
,
4931 submit_stripe_bio(root
, bbio
, bio
, physical
, dev_nr
, rw
, async
);
4935 static void bbio_error(struct btrfs_bio
*bbio
, struct bio
*bio
, u64 logical
)
4937 atomic_inc(&bbio
->error
);
4938 if (atomic_dec_and_test(&bbio
->stripes_pending
)) {
4939 bio
->bi_private
= bbio
->private;
4940 bio
->bi_end_io
= bbio
->end_io
;
4941 bio
->bi_bdev
= (struct block_device
*)
4942 (unsigned long)bbio
->mirror_num
;
4943 bio
->bi_sector
= logical
>> 9;
4945 bio_endio(bio
, -EIO
);
4949 int btrfs_map_bio(struct btrfs_root
*root
, int rw
, struct bio
*bio
,
4950 int mirror_num
, int async_submit
)
4952 struct btrfs_device
*dev
;
4953 struct bio
*first_bio
= bio
;
4954 u64 logical
= (u64
)bio
->bi_sector
<< 9;
4960 struct btrfs_bio
*bbio
= NULL
;
4962 length
= bio
->bi_size
;
4963 map_length
= length
;
4965 ret
= btrfs_map_block(root
->fs_info
, rw
, logical
, &map_length
, &bbio
,
4970 total_devs
= bbio
->num_stripes
;
4971 if (map_length
< length
) {
4972 printk(KERN_CRIT
"btrfs: mapping failed logical %llu bio len %llu "
4973 "len %llu\n", (unsigned long long)logical
,
4974 (unsigned long long)length
,
4975 (unsigned long long)map_length
);
4979 bbio
->orig_bio
= first_bio
;
4980 bbio
->private = first_bio
->bi_private
;
4981 bbio
->end_io
= first_bio
->bi_end_io
;
4982 atomic_set(&bbio
->stripes_pending
, bbio
->num_stripes
);
4984 while (dev_nr
< total_devs
) {
4985 dev
= bbio
->stripes
[dev_nr
].dev
;
4986 if (!dev
|| !dev
->bdev
|| (rw
& WRITE
&& !dev
->writeable
)) {
4987 bbio_error(bbio
, first_bio
, logical
);
4993 * Check and see if we're ok with this bio based on it's size
4994 * and offset with the given device.
4996 if (!bio_size_ok(dev
->bdev
, first_bio
,
4997 bbio
->stripes
[dev_nr
].physical
>> 9)) {
4998 ret
= breakup_stripe_bio(root
, bbio
, first_bio
, dev
,
4999 dev_nr
, rw
, async_submit
);
5005 if (dev_nr
< total_devs
- 1) {
5006 bio
= bio_clone(first_bio
, GFP_NOFS
);
5007 BUG_ON(!bio
); /* -ENOMEM */
5012 submit_stripe_bio(root
, bbio
, bio
,
5013 bbio
->stripes
[dev_nr
].physical
, dev_nr
, rw
,
5020 struct btrfs_device
*btrfs_find_device(struct btrfs_fs_info
*fs_info
, u64 devid
,
5023 struct btrfs_device
*device
;
5024 struct btrfs_fs_devices
*cur_devices
;
5026 cur_devices
= fs_info
->fs_devices
;
5027 while (cur_devices
) {
5029 !memcmp(cur_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
5030 device
= __find_device(&cur_devices
->devices
,
5035 cur_devices
= cur_devices
->seed
;
5040 static struct btrfs_device
*add_missing_dev(struct btrfs_root
*root
,
5041 u64 devid
, u8
*dev_uuid
)
5043 struct btrfs_device
*device
;
5044 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
5046 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
5049 list_add(&device
->dev_list
,
5050 &fs_devices
->devices
);
5051 device
->dev_root
= root
->fs_info
->dev_root
;
5052 device
->devid
= devid
;
5053 device
->work
.func
= pending_bios_fn
;
5054 device
->fs_devices
= fs_devices
;
5055 device
->missing
= 1;
5056 fs_devices
->num_devices
++;
5057 fs_devices
->missing_devices
++;
5058 spin_lock_init(&device
->io_lock
);
5059 INIT_LIST_HEAD(&device
->dev_alloc_list
);
5060 memcpy(device
->uuid
, dev_uuid
, BTRFS_UUID_SIZE
);
5064 static int read_one_chunk(struct btrfs_root
*root
, struct btrfs_key
*key
,
5065 struct extent_buffer
*leaf
,
5066 struct btrfs_chunk
*chunk
)
5068 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
5069 struct map_lookup
*map
;
5070 struct extent_map
*em
;
5074 u8 uuid
[BTRFS_UUID_SIZE
];
5079 logical
= key
->offset
;
5080 length
= btrfs_chunk_length(leaf
, chunk
);
5082 read_lock(&map_tree
->map_tree
.lock
);
5083 em
= lookup_extent_mapping(&map_tree
->map_tree
, logical
, 1);
5084 read_unlock(&map_tree
->map_tree
.lock
);
5086 /* already mapped? */
5087 if (em
&& em
->start
<= logical
&& em
->start
+ em
->len
> logical
) {
5088 free_extent_map(em
);
5091 free_extent_map(em
);
5094 em
= alloc_extent_map();
5097 num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
5098 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
5100 free_extent_map(em
);
5104 em
->bdev
= (struct block_device
*)map
;
5105 em
->start
= logical
;
5108 em
->block_start
= 0;
5109 em
->block_len
= em
->len
;
5111 map
->num_stripes
= num_stripes
;
5112 map
->io_width
= btrfs_chunk_io_width(leaf
, chunk
);
5113 map
->io_align
= btrfs_chunk_io_align(leaf
, chunk
);
5114 map
->sector_size
= btrfs_chunk_sector_size(leaf
, chunk
);
5115 map
->stripe_len
= btrfs_chunk_stripe_len(leaf
, chunk
);
5116 map
->type
= btrfs_chunk_type(leaf
, chunk
);
5117 map
->sub_stripes
= btrfs_chunk_sub_stripes(leaf
, chunk
);
5118 for (i
= 0; i
< num_stripes
; i
++) {
5119 map
->stripes
[i
].physical
=
5120 btrfs_stripe_offset_nr(leaf
, chunk
, i
);
5121 devid
= btrfs_stripe_devid_nr(leaf
, chunk
, i
);
5122 read_extent_buffer(leaf
, uuid
, (unsigned long)
5123 btrfs_stripe_dev_uuid_nr(chunk
, i
),
5125 map
->stripes
[i
].dev
= btrfs_find_device(root
->fs_info
, devid
,
5127 if (!map
->stripes
[i
].dev
&& !btrfs_test_opt(root
, DEGRADED
)) {
5129 free_extent_map(em
);
5132 if (!map
->stripes
[i
].dev
) {
5133 map
->stripes
[i
].dev
=
5134 add_missing_dev(root
, devid
, uuid
);
5135 if (!map
->stripes
[i
].dev
) {
5137 free_extent_map(em
);
5141 map
->stripes
[i
].dev
->in_fs_metadata
= 1;
5144 write_lock(&map_tree
->map_tree
.lock
);
5145 ret
= add_extent_mapping(&map_tree
->map_tree
, em
);
5146 write_unlock(&map_tree
->map_tree
.lock
);
5147 BUG_ON(ret
); /* Tree corruption */
5148 free_extent_map(em
);
5153 static void fill_device_from_item(struct extent_buffer
*leaf
,
5154 struct btrfs_dev_item
*dev_item
,
5155 struct btrfs_device
*device
)
5159 device
->devid
= btrfs_device_id(leaf
, dev_item
);
5160 device
->disk_total_bytes
= btrfs_device_total_bytes(leaf
, dev_item
);
5161 device
->total_bytes
= device
->disk_total_bytes
;
5162 device
->bytes_used
= btrfs_device_bytes_used(leaf
, dev_item
);
5163 device
->type
= btrfs_device_type(leaf
, dev_item
);
5164 device
->io_align
= btrfs_device_io_align(leaf
, dev_item
);
5165 device
->io_width
= btrfs_device_io_width(leaf
, dev_item
);
5166 device
->sector_size
= btrfs_device_sector_size(leaf
, dev_item
);
5167 WARN_ON(device
->devid
== BTRFS_DEV_REPLACE_DEVID
);
5168 device
->is_tgtdev_for_dev_replace
= 0;
5170 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
5171 read_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
5174 static int open_seed_devices(struct btrfs_root
*root
, u8
*fsid
)
5176 struct btrfs_fs_devices
*fs_devices
;
5179 BUG_ON(!mutex_is_locked(&uuid_mutex
));
5181 fs_devices
= root
->fs_info
->fs_devices
->seed
;
5182 while (fs_devices
) {
5183 if (!memcmp(fs_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
5187 fs_devices
= fs_devices
->seed
;
5190 fs_devices
= find_fsid(fsid
);
5196 fs_devices
= clone_fs_devices(fs_devices
);
5197 if (IS_ERR(fs_devices
)) {
5198 ret
= PTR_ERR(fs_devices
);
5202 ret
= __btrfs_open_devices(fs_devices
, FMODE_READ
,
5203 root
->fs_info
->bdev_holder
);
5205 free_fs_devices(fs_devices
);
5209 if (!fs_devices
->seeding
) {
5210 __btrfs_close_devices(fs_devices
);
5211 free_fs_devices(fs_devices
);
5216 fs_devices
->seed
= root
->fs_info
->fs_devices
->seed
;
5217 root
->fs_info
->fs_devices
->seed
= fs_devices
;
5222 static int read_one_dev(struct btrfs_root
*root
,
5223 struct extent_buffer
*leaf
,
5224 struct btrfs_dev_item
*dev_item
)
5226 struct btrfs_device
*device
;
5229 u8 fs_uuid
[BTRFS_UUID_SIZE
];
5230 u8 dev_uuid
[BTRFS_UUID_SIZE
];
5232 devid
= btrfs_device_id(leaf
, dev_item
);
5233 read_extent_buffer(leaf
, dev_uuid
,
5234 (unsigned long)btrfs_device_uuid(dev_item
),
5236 read_extent_buffer(leaf
, fs_uuid
,
5237 (unsigned long)btrfs_device_fsid(dev_item
),
5240 if (memcmp(fs_uuid
, root
->fs_info
->fsid
, BTRFS_UUID_SIZE
)) {
5241 ret
= open_seed_devices(root
, fs_uuid
);
5242 if (ret
&& !btrfs_test_opt(root
, DEGRADED
))
5246 device
= btrfs_find_device(root
->fs_info
, devid
, dev_uuid
, fs_uuid
);
5247 if (!device
|| !device
->bdev
) {
5248 if (!btrfs_test_opt(root
, DEGRADED
))
5252 printk(KERN_WARNING
"warning devid %llu missing\n",
5253 (unsigned long long)devid
);
5254 device
= add_missing_dev(root
, devid
, dev_uuid
);
5257 } else if (!device
->missing
) {
5259 * this happens when a device that was properly setup
5260 * in the device info lists suddenly goes bad.
5261 * device->bdev is NULL, and so we have to set
5262 * device->missing to one here
5264 root
->fs_info
->fs_devices
->missing_devices
++;
5265 device
->missing
= 1;
5269 if (device
->fs_devices
!= root
->fs_info
->fs_devices
) {
5270 BUG_ON(device
->writeable
);
5271 if (device
->generation
!=
5272 btrfs_device_generation(leaf
, dev_item
))
5276 fill_device_from_item(leaf
, dev_item
, device
);
5277 device
->dev_root
= root
->fs_info
->dev_root
;
5278 device
->in_fs_metadata
= 1;
5279 if (device
->writeable
&& !device
->is_tgtdev_for_dev_replace
) {
5280 device
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
5281 spin_lock(&root
->fs_info
->free_chunk_lock
);
5282 root
->fs_info
->free_chunk_space
+= device
->total_bytes
-
5284 spin_unlock(&root
->fs_info
->free_chunk_lock
);
5290 int btrfs_read_sys_array(struct btrfs_root
*root
)
5292 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
5293 struct extent_buffer
*sb
;
5294 struct btrfs_disk_key
*disk_key
;
5295 struct btrfs_chunk
*chunk
;
5297 unsigned long sb_ptr
;
5303 struct btrfs_key key
;
5305 sb
= btrfs_find_create_tree_block(root
, BTRFS_SUPER_INFO_OFFSET
,
5306 BTRFS_SUPER_INFO_SIZE
);
5309 btrfs_set_buffer_uptodate(sb
);
5310 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, sb
, 0);
5312 * The sb extent buffer is artifical and just used to read the system array.
5313 * btrfs_set_buffer_uptodate() call does not properly mark all it's
5314 * pages up-to-date when the page is larger: extent does not cover the
5315 * whole page and consequently check_page_uptodate does not find all
5316 * the page's extents up-to-date (the hole beyond sb),
5317 * write_extent_buffer then triggers a WARN_ON.
5319 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
5320 * but sb spans only this function. Add an explicit SetPageUptodate call
5321 * to silence the warning eg. on PowerPC 64.
5323 if (PAGE_CACHE_SIZE
> BTRFS_SUPER_INFO_SIZE
)
5324 SetPageUptodate(sb
->pages
[0]);
5326 write_extent_buffer(sb
, super_copy
, 0, BTRFS_SUPER_INFO_SIZE
);
5327 array_size
= btrfs_super_sys_array_size(super_copy
);
5329 ptr
= super_copy
->sys_chunk_array
;
5330 sb_ptr
= offsetof(struct btrfs_super_block
, sys_chunk_array
);
5333 while (cur
< array_size
) {
5334 disk_key
= (struct btrfs_disk_key
*)ptr
;
5335 btrfs_disk_key_to_cpu(&key
, disk_key
);
5337 len
= sizeof(*disk_key
); ptr
+= len
;
5341 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
5342 chunk
= (struct btrfs_chunk
*)sb_ptr
;
5343 ret
= read_one_chunk(root
, &key
, sb
, chunk
);
5346 num_stripes
= btrfs_chunk_num_stripes(sb
, chunk
);
5347 len
= btrfs_chunk_item_size(num_stripes
);
5356 free_extent_buffer(sb
);
5360 int btrfs_read_chunk_tree(struct btrfs_root
*root
)
5362 struct btrfs_path
*path
;
5363 struct extent_buffer
*leaf
;
5364 struct btrfs_key key
;
5365 struct btrfs_key found_key
;
5369 root
= root
->fs_info
->chunk_root
;
5371 path
= btrfs_alloc_path();
5375 mutex_lock(&uuid_mutex
);
5378 /* first we search for all of the device items, and then we
5379 * read in all of the chunk items. This way we can create chunk
5380 * mappings that reference all of the devices that are afound
5382 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
5386 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
5390 leaf
= path
->nodes
[0];
5391 slot
= path
->slots
[0];
5392 if (slot
>= btrfs_header_nritems(leaf
)) {
5393 ret
= btrfs_next_leaf(root
, path
);
5400 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
5401 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
5402 if (found_key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
)
5404 if (found_key
.type
== BTRFS_DEV_ITEM_KEY
) {
5405 struct btrfs_dev_item
*dev_item
;
5406 dev_item
= btrfs_item_ptr(leaf
, slot
,
5407 struct btrfs_dev_item
);
5408 ret
= read_one_dev(root
, leaf
, dev_item
);
5412 } else if (found_key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
5413 struct btrfs_chunk
*chunk
;
5414 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
5415 ret
= read_one_chunk(root
, &found_key
, leaf
, chunk
);
5421 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
5423 btrfs_release_path(path
);
5428 unlock_chunks(root
);
5429 mutex_unlock(&uuid_mutex
);
5431 btrfs_free_path(path
);
5435 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
)
5439 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
5440 btrfs_dev_stat_reset(dev
, i
);
5443 int btrfs_init_dev_stats(struct btrfs_fs_info
*fs_info
)
5445 struct btrfs_key key
;
5446 struct btrfs_key found_key
;
5447 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
5448 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
5449 struct extent_buffer
*eb
;
5452 struct btrfs_device
*device
;
5453 struct btrfs_path
*path
= NULL
;
5456 path
= btrfs_alloc_path();
5462 mutex_lock(&fs_devices
->device_list_mutex
);
5463 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
5465 struct btrfs_dev_stats_item
*ptr
;
5468 key
.type
= BTRFS_DEV_STATS_KEY
;
5469 key
.offset
= device
->devid
;
5470 ret
= btrfs_search_slot(NULL
, dev_root
, &key
, path
, 0, 0);
5472 __btrfs_reset_dev_stats(device
);
5473 device
->dev_stats_valid
= 1;
5474 btrfs_release_path(path
);
5477 slot
= path
->slots
[0];
5478 eb
= path
->nodes
[0];
5479 btrfs_item_key_to_cpu(eb
, &found_key
, slot
);
5480 item_size
= btrfs_item_size_nr(eb
, slot
);
5482 ptr
= btrfs_item_ptr(eb
, slot
,
5483 struct btrfs_dev_stats_item
);
5485 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
5486 if (item_size
>= (1 + i
) * sizeof(__le64
))
5487 btrfs_dev_stat_set(device
, i
,
5488 btrfs_dev_stats_value(eb
, ptr
, i
));
5490 btrfs_dev_stat_reset(device
, i
);
5493 device
->dev_stats_valid
= 1;
5494 btrfs_dev_stat_print_on_load(device
);
5495 btrfs_release_path(path
);
5497 mutex_unlock(&fs_devices
->device_list_mutex
);
5500 btrfs_free_path(path
);
5501 return ret
< 0 ? ret
: 0;
5504 static int update_dev_stat_item(struct btrfs_trans_handle
*trans
,
5505 struct btrfs_root
*dev_root
,
5506 struct btrfs_device
*device
)
5508 struct btrfs_path
*path
;
5509 struct btrfs_key key
;
5510 struct extent_buffer
*eb
;
5511 struct btrfs_dev_stats_item
*ptr
;
5516 key
.type
= BTRFS_DEV_STATS_KEY
;
5517 key
.offset
= device
->devid
;
5519 path
= btrfs_alloc_path();
5521 ret
= btrfs_search_slot(trans
, dev_root
, &key
, path
, -1, 1);
5523 printk_in_rcu(KERN_WARNING
"btrfs: error %d while searching for dev_stats item for device %s!\n",
5524 ret
, rcu_str_deref(device
->name
));
5529 btrfs_item_size_nr(path
->nodes
[0], path
->slots
[0]) < sizeof(*ptr
)) {
5530 /* need to delete old one and insert a new one */
5531 ret
= btrfs_del_item(trans
, dev_root
, path
);
5533 printk_in_rcu(KERN_WARNING
"btrfs: delete too small dev_stats item for device %s failed %d!\n",
5534 rcu_str_deref(device
->name
), ret
);
5541 /* need to insert a new item */
5542 btrfs_release_path(path
);
5543 ret
= btrfs_insert_empty_item(trans
, dev_root
, path
,
5544 &key
, sizeof(*ptr
));
5546 printk_in_rcu(KERN_WARNING
"btrfs: insert dev_stats item for device %s failed %d!\n",
5547 rcu_str_deref(device
->name
), ret
);
5552 eb
= path
->nodes
[0];
5553 ptr
= btrfs_item_ptr(eb
, path
->slots
[0], struct btrfs_dev_stats_item
);
5554 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
5555 btrfs_set_dev_stats_value(eb
, ptr
, i
,
5556 btrfs_dev_stat_read(device
, i
));
5557 btrfs_mark_buffer_dirty(eb
);
5560 btrfs_free_path(path
);
5565 * called from commit_transaction. Writes all changed device stats to disk.
5567 int btrfs_run_dev_stats(struct btrfs_trans_handle
*trans
,
5568 struct btrfs_fs_info
*fs_info
)
5570 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
5571 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
5572 struct btrfs_device
*device
;
5575 mutex_lock(&fs_devices
->device_list_mutex
);
5576 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
5577 if (!device
->dev_stats_valid
|| !device
->dev_stats_dirty
)
5580 ret
= update_dev_stat_item(trans
, dev_root
, device
);
5582 device
->dev_stats_dirty
= 0;
5584 mutex_unlock(&fs_devices
->device_list_mutex
);
5589 void btrfs_dev_stat_inc_and_print(struct btrfs_device
*dev
, int index
)
5591 btrfs_dev_stat_inc(dev
, index
);
5592 btrfs_dev_stat_print_on_error(dev
);
5595 void btrfs_dev_stat_print_on_error(struct btrfs_device
*dev
)
5597 if (!dev
->dev_stats_valid
)
5599 printk_ratelimited_in_rcu(KERN_ERR
5600 "btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
5601 rcu_str_deref(dev
->name
),
5602 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
5603 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
5604 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
5605 btrfs_dev_stat_read(dev
,
5606 BTRFS_DEV_STAT_CORRUPTION_ERRS
),
5607 btrfs_dev_stat_read(dev
,
5608 BTRFS_DEV_STAT_GENERATION_ERRS
));
5611 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*dev
)
5615 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
5616 if (btrfs_dev_stat_read(dev
, i
) != 0)
5618 if (i
== BTRFS_DEV_STAT_VALUES_MAX
)
5619 return; /* all values == 0, suppress message */
5621 printk_in_rcu(KERN_INFO
"btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
5622 rcu_str_deref(dev
->name
),
5623 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
5624 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
5625 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
5626 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_CORRUPTION_ERRS
),
5627 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_GENERATION_ERRS
));
5630 int btrfs_get_dev_stats(struct btrfs_root
*root
,
5631 struct btrfs_ioctl_get_dev_stats
*stats
)
5633 struct btrfs_device
*dev
;
5634 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
5637 mutex_lock(&fs_devices
->device_list_mutex
);
5638 dev
= btrfs_find_device(root
->fs_info
, stats
->devid
, NULL
, NULL
);
5639 mutex_unlock(&fs_devices
->device_list_mutex
);
5643 "btrfs: get dev_stats failed, device not found\n");
5645 } else if (!dev
->dev_stats_valid
) {
5647 "btrfs: get dev_stats failed, not yet valid\n");
5649 } else if (stats
->flags
& BTRFS_DEV_STATS_RESET
) {
5650 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
5651 if (stats
->nr_items
> i
)
5653 btrfs_dev_stat_read_and_reset(dev
, i
);
5655 btrfs_dev_stat_reset(dev
, i
);
5658 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
5659 if (stats
->nr_items
> i
)
5660 stats
->values
[i
] = btrfs_dev_stat_read(dev
, i
);
5662 if (stats
->nr_items
> BTRFS_DEV_STAT_VALUES_MAX
)
5663 stats
->nr_items
= BTRFS_DEV_STAT_VALUES_MAX
;
5667 int btrfs_scratch_superblock(struct btrfs_device
*device
)
5669 struct buffer_head
*bh
;
5670 struct btrfs_super_block
*disk_super
;
5672 bh
= btrfs_read_dev_super(device
->bdev
);
5675 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
5677 memset(&disk_super
->magic
, 0, sizeof(disk_super
->magic
));
5678 set_buffer_dirty(bh
);
5679 sync_dirty_buffer(bh
);