2 * Copyright (C) 2007 Oracle. All rights reserved.
4 * This program is free software; you can redistribute it and/or
5 * modify it under the terms of the GNU General Public
6 * License v2 as published by the Free Software Foundation.
8 * This program is distributed in the hope that it will be useful,
9 * but WITHOUT ANY WARRANTY; without even the implied warranty of
10 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
11 * General Public License for more details.
13 * You should have received a copy of the GNU General Public
14 * License along with this program; if not, write to the
15 * Free Software Foundation, Inc., 59 Temple Place - Suite 330,
16 * Boston, MA 021110-1307, USA.
18 #include <linux/sched.h>
19 #include <linux/bio.h>
20 #include <linux/slab.h>
21 #include <linux/buffer_head.h>
22 #include <linux/blkdev.h>
23 #include <linux/random.h>
24 #include <linux/iocontext.h>
25 #include <linux/capability.h>
26 #include <linux/ratelimit.h>
27 #include <linux/kthread.h>
28 #include <asm/div64.h>
31 #include "extent_map.h"
33 #include "transaction.h"
34 #include "print-tree.h"
36 #include "async-thread.h"
37 #include "check-integrity.h"
38 #include "rcu-string.h"
40 static int init_first_rw_device(struct btrfs_trans_handle
*trans
,
41 struct btrfs_root
*root
,
42 struct btrfs_device
*device
);
43 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
);
44 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
);
45 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*device
);
47 static DEFINE_MUTEX(uuid_mutex
);
48 static LIST_HEAD(fs_uuids
);
50 static void lock_chunks(struct btrfs_root
*root
)
52 mutex_lock(&root
->fs_info
->chunk_mutex
);
55 static void unlock_chunks(struct btrfs_root
*root
)
57 mutex_unlock(&root
->fs_info
->chunk_mutex
);
60 static void free_fs_devices(struct btrfs_fs_devices
*fs_devices
)
62 struct btrfs_device
*device
;
63 WARN_ON(fs_devices
->opened
);
64 while (!list_empty(&fs_devices
->devices
)) {
65 device
= list_entry(fs_devices
->devices
.next
,
66 struct btrfs_device
, dev_list
);
67 list_del(&device
->dev_list
);
68 rcu_string_free(device
->name
);
74 void btrfs_cleanup_fs_uuids(void)
76 struct btrfs_fs_devices
*fs_devices
;
78 while (!list_empty(&fs_uuids
)) {
79 fs_devices
= list_entry(fs_uuids
.next
,
80 struct btrfs_fs_devices
, list
);
81 list_del(&fs_devices
->list
);
82 free_fs_devices(fs_devices
);
86 static noinline
struct btrfs_device
*__find_device(struct list_head
*head
,
89 struct btrfs_device
*dev
;
91 list_for_each_entry(dev
, head
, dev_list
) {
92 if (dev
->devid
== devid
&&
93 (!uuid
|| !memcmp(dev
->uuid
, uuid
, BTRFS_UUID_SIZE
))) {
100 static noinline
struct btrfs_fs_devices
*find_fsid(u8
*fsid
)
102 struct btrfs_fs_devices
*fs_devices
;
104 list_for_each_entry(fs_devices
, &fs_uuids
, list
) {
105 if (memcmp(fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
) == 0)
111 static void requeue_list(struct btrfs_pending_bios
*pending_bios
,
112 struct bio
*head
, struct bio
*tail
)
115 struct bio
*old_head
;
117 old_head
= pending_bios
->head
;
118 pending_bios
->head
= head
;
119 if (pending_bios
->tail
)
120 tail
->bi_next
= old_head
;
122 pending_bios
->tail
= tail
;
126 * we try to collect pending bios for a device so we don't get a large
127 * number of procs sending bios down to the same device. This greatly
128 * improves the schedulers ability to collect and merge the bios.
130 * But, it also turns into a long list of bios to process and that is sure
131 * to eventually make the worker thread block. The solution here is to
132 * make some progress and then put this work struct back at the end of
133 * the list if the block device is congested. This way, multiple devices
134 * can make progress from a single worker thread.
136 static noinline
void run_scheduled_bios(struct btrfs_device
*device
)
139 struct backing_dev_info
*bdi
;
140 struct btrfs_fs_info
*fs_info
;
141 struct btrfs_pending_bios
*pending_bios
;
145 unsigned long num_run
;
146 unsigned long batch_run
= 0;
148 unsigned long last_waited
= 0;
150 int sync_pending
= 0;
151 struct blk_plug plug
;
154 * this function runs all the bios we've collected for
155 * a particular device. We don't want to wander off to
156 * another device without first sending all of these down.
157 * So, setup a plug here and finish it off before we return
159 blk_start_plug(&plug
);
161 bdi
= blk_get_backing_dev_info(device
->bdev
);
162 fs_info
= device
->dev_root
->fs_info
;
163 limit
= btrfs_async_submit_limit(fs_info
);
164 limit
= limit
* 2 / 3;
167 spin_lock(&device
->io_lock
);
172 /* take all the bios off the list at once and process them
173 * later on (without the lock held). But, remember the
174 * tail and other pointers so the bios can be properly reinserted
175 * into the list if we hit congestion
177 if (!force_reg
&& device
->pending_sync_bios
.head
) {
178 pending_bios
= &device
->pending_sync_bios
;
181 pending_bios
= &device
->pending_bios
;
185 pending
= pending_bios
->head
;
186 tail
= pending_bios
->tail
;
187 WARN_ON(pending
&& !tail
);
190 * if pending was null this time around, no bios need processing
191 * at all and we can stop. Otherwise it'll loop back up again
192 * and do an additional check so no bios are missed.
194 * device->running_pending is used to synchronize with the
197 if (device
->pending_sync_bios
.head
== NULL
&&
198 device
->pending_bios
.head
== NULL
) {
200 device
->running_pending
= 0;
203 device
->running_pending
= 1;
206 pending_bios
->head
= NULL
;
207 pending_bios
->tail
= NULL
;
209 spin_unlock(&device
->io_lock
);
214 /* we want to work on both lists, but do more bios on the
215 * sync list than the regular list
218 pending_bios
!= &device
->pending_sync_bios
&&
219 device
->pending_sync_bios
.head
) ||
220 (num_run
> 64 && pending_bios
== &device
->pending_sync_bios
&&
221 device
->pending_bios
.head
)) {
222 spin_lock(&device
->io_lock
);
223 requeue_list(pending_bios
, pending
, tail
);
228 pending
= pending
->bi_next
;
231 if (atomic_dec_return(&fs_info
->nr_async_bios
) < limit
&&
232 waitqueue_active(&fs_info
->async_submit_wait
))
233 wake_up(&fs_info
->async_submit_wait
);
235 BUG_ON(atomic_read(&cur
->bi_cnt
) == 0);
238 * if we're doing the sync list, record that our
239 * plug has some sync requests on it
241 * If we're doing the regular list and there are
242 * sync requests sitting around, unplug before
245 if (pending_bios
== &device
->pending_sync_bios
) {
247 } else if (sync_pending
) {
248 blk_finish_plug(&plug
);
249 blk_start_plug(&plug
);
253 btrfsic_submit_bio(cur
->bi_rw
, cur
);
260 * we made progress, there is more work to do and the bdi
261 * is now congested. Back off and let other work structs
264 if (pending
&& bdi_write_congested(bdi
) && batch_run
> 8 &&
265 fs_info
->fs_devices
->open_devices
> 1) {
266 struct io_context
*ioc
;
268 ioc
= current
->io_context
;
271 * the main goal here is that we don't want to
272 * block if we're going to be able to submit
273 * more requests without blocking.
275 * This code does two great things, it pokes into
276 * the elevator code from a filesystem _and_
277 * it makes assumptions about how batching works.
279 if (ioc
&& ioc
->nr_batch_requests
> 0 &&
280 time_before(jiffies
, ioc
->last_waited
+ HZ
/50UL) &&
282 ioc
->last_waited
== last_waited
)) {
284 * we want to go through our batch of
285 * requests and stop. So, we copy out
286 * the ioc->last_waited time and test
287 * against it before looping
289 last_waited
= ioc
->last_waited
;
294 spin_lock(&device
->io_lock
);
295 requeue_list(pending_bios
, pending
, tail
);
296 device
->running_pending
= 1;
298 spin_unlock(&device
->io_lock
);
299 btrfs_requeue_work(&device
->work
);
302 /* unplug every 64 requests just for good measure */
303 if (batch_run
% 64 == 0) {
304 blk_finish_plug(&plug
);
305 blk_start_plug(&plug
);
314 spin_lock(&device
->io_lock
);
315 if (device
->pending_bios
.head
|| device
->pending_sync_bios
.head
)
317 spin_unlock(&device
->io_lock
);
320 blk_finish_plug(&plug
);
323 static void pending_bios_fn(struct btrfs_work
*work
)
325 struct btrfs_device
*device
;
327 device
= container_of(work
, struct btrfs_device
, work
);
328 run_scheduled_bios(device
);
331 static noinline
int device_list_add(const char *path
,
332 struct btrfs_super_block
*disk_super
,
333 u64 devid
, struct btrfs_fs_devices
**fs_devices_ret
)
335 struct btrfs_device
*device
;
336 struct btrfs_fs_devices
*fs_devices
;
337 struct rcu_string
*name
;
338 u64 found_transid
= btrfs_super_generation(disk_super
);
340 fs_devices
= find_fsid(disk_super
->fsid
);
342 fs_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
345 INIT_LIST_HEAD(&fs_devices
->devices
);
346 INIT_LIST_HEAD(&fs_devices
->alloc_list
);
347 list_add(&fs_devices
->list
, &fs_uuids
);
348 memcpy(fs_devices
->fsid
, disk_super
->fsid
, BTRFS_FSID_SIZE
);
349 fs_devices
->latest_devid
= devid
;
350 fs_devices
->latest_trans
= found_transid
;
351 mutex_init(&fs_devices
->device_list_mutex
);
354 device
= __find_device(&fs_devices
->devices
, devid
,
355 disk_super
->dev_item
.uuid
);
358 if (fs_devices
->opened
)
361 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
363 /* we can safely leave the fs_devices entry around */
366 device
->devid
= devid
;
367 device
->dev_stats_valid
= 0;
368 device
->work
.func
= pending_bios_fn
;
369 memcpy(device
->uuid
, disk_super
->dev_item
.uuid
,
371 spin_lock_init(&device
->io_lock
);
373 name
= rcu_string_strdup(path
, GFP_NOFS
);
378 rcu_assign_pointer(device
->name
, name
);
379 INIT_LIST_HEAD(&device
->dev_alloc_list
);
381 /* init readahead state */
382 spin_lock_init(&device
->reada_lock
);
383 device
->reada_curr_zone
= NULL
;
384 atomic_set(&device
->reada_in_flight
, 0);
385 device
->reada_next
= 0;
386 INIT_RADIX_TREE(&device
->reada_zones
, GFP_NOFS
& ~__GFP_WAIT
);
387 INIT_RADIX_TREE(&device
->reada_extents
, GFP_NOFS
& ~__GFP_WAIT
);
389 mutex_lock(&fs_devices
->device_list_mutex
);
390 list_add_rcu(&device
->dev_list
, &fs_devices
->devices
);
391 mutex_unlock(&fs_devices
->device_list_mutex
);
393 device
->fs_devices
= fs_devices
;
394 fs_devices
->num_devices
++;
395 } else if (!device
->name
|| strcmp(device
->name
->str
, path
)) {
396 name
= rcu_string_strdup(path
, GFP_NOFS
);
399 rcu_string_free(device
->name
);
400 rcu_assign_pointer(device
->name
, name
);
401 if (device
->missing
) {
402 fs_devices
->missing_devices
--;
407 if (found_transid
> fs_devices
->latest_trans
) {
408 fs_devices
->latest_devid
= devid
;
409 fs_devices
->latest_trans
= found_transid
;
411 *fs_devices_ret
= fs_devices
;
415 static struct btrfs_fs_devices
*clone_fs_devices(struct btrfs_fs_devices
*orig
)
417 struct btrfs_fs_devices
*fs_devices
;
418 struct btrfs_device
*device
;
419 struct btrfs_device
*orig_dev
;
421 fs_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
423 return ERR_PTR(-ENOMEM
);
425 INIT_LIST_HEAD(&fs_devices
->devices
);
426 INIT_LIST_HEAD(&fs_devices
->alloc_list
);
427 INIT_LIST_HEAD(&fs_devices
->list
);
428 mutex_init(&fs_devices
->device_list_mutex
);
429 fs_devices
->latest_devid
= orig
->latest_devid
;
430 fs_devices
->latest_trans
= orig
->latest_trans
;
431 fs_devices
->total_devices
= orig
->total_devices
;
432 memcpy(fs_devices
->fsid
, orig
->fsid
, sizeof(fs_devices
->fsid
));
434 /* We have held the volume lock, it is safe to get the devices. */
435 list_for_each_entry(orig_dev
, &orig
->devices
, dev_list
) {
436 struct rcu_string
*name
;
438 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
443 * This is ok to do without rcu read locked because we hold the
444 * uuid mutex so nothing we touch in here is going to disappear.
446 name
= rcu_string_strdup(orig_dev
->name
->str
, GFP_NOFS
);
451 rcu_assign_pointer(device
->name
, name
);
453 device
->devid
= orig_dev
->devid
;
454 device
->work
.func
= pending_bios_fn
;
455 memcpy(device
->uuid
, orig_dev
->uuid
, sizeof(device
->uuid
));
456 spin_lock_init(&device
->io_lock
);
457 INIT_LIST_HEAD(&device
->dev_list
);
458 INIT_LIST_HEAD(&device
->dev_alloc_list
);
460 list_add(&device
->dev_list
, &fs_devices
->devices
);
461 device
->fs_devices
= fs_devices
;
462 fs_devices
->num_devices
++;
466 free_fs_devices(fs_devices
);
467 return ERR_PTR(-ENOMEM
);
470 void btrfs_close_extra_devices(struct btrfs_fs_devices
*fs_devices
)
472 struct btrfs_device
*device
, *next
;
474 struct block_device
*latest_bdev
= NULL
;
475 u64 latest_devid
= 0;
476 u64 latest_transid
= 0;
478 mutex_lock(&uuid_mutex
);
480 /* This is the initialized path, it is safe to release the devices. */
481 list_for_each_entry_safe(device
, next
, &fs_devices
->devices
, dev_list
) {
482 if (device
->in_fs_metadata
) {
483 if (!latest_transid
||
484 device
->generation
> latest_transid
) {
485 latest_devid
= device
->devid
;
486 latest_transid
= device
->generation
;
487 latest_bdev
= device
->bdev
;
493 blkdev_put(device
->bdev
, device
->mode
);
495 fs_devices
->open_devices
--;
497 if (device
->writeable
) {
498 list_del_init(&device
->dev_alloc_list
);
499 device
->writeable
= 0;
500 fs_devices
->rw_devices
--;
502 list_del_init(&device
->dev_list
);
503 fs_devices
->num_devices
--;
504 rcu_string_free(device
->name
);
508 if (fs_devices
->seed
) {
509 fs_devices
= fs_devices
->seed
;
513 fs_devices
->latest_bdev
= latest_bdev
;
514 fs_devices
->latest_devid
= latest_devid
;
515 fs_devices
->latest_trans
= latest_transid
;
517 mutex_unlock(&uuid_mutex
);
520 static void __free_device(struct work_struct
*work
)
522 struct btrfs_device
*device
;
524 device
= container_of(work
, struct btrfs_device
, rcu_work
);
527 blkdev_put(device
->bdev
, device
->mode
);
529 rcu_string_free(device
->name
);
533 static void free_device(struct rcu_head
*head
)
535 struct btrfs_device
*device
;
537 device
= container_of(head
, struct btrfs_device
, rcu
);
539 INIT_WORK(&device
->rcu_work
, __free_device
);
540 schedule_work(&device
->rcu_work
);
543 static int __btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
545 struct btrfs_device
*device
;
547 if (--fs_devices
->opened
> 0)
550 mutex_lock(&fs_devices
->device_list_mutex
);
551 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
552 struct btrfs_device
*new_device
;
553 struct rcu_string
*name
;
556 fs_devices
->open_devices
--;
558 if (device
->writeable
) {
559 list_del_init(&device
->dev_alloc_list
);
560 fs_devices
->rw_devices
--;
563 if (device
->can_discard
)
564 fs_devices
->num_can_discard
--;
566 new_device
= kmalloc(sizeof(*new_device
), GFP_NOFS
);
567 BUG_ON(!new_device
); /* -ENOMEM */
568 memcpy(new_device
, device
, sizeof(*new_device
));
570 /* Safe because we are under uuid_mutex */
572 name
= rcu_string_strdup(device
->name
->str
, GFP_NOFS
);
573 BUG_ON(device
->name
&& !name
); /* -ENOMEM */
574 rcu_assign_pointer(new_device
->name
, name
);
576 new_device
->bdev
= NULL
;
577 new_device
->writeable
= 0;
578 new_device
->in_fs_metadata
= 0;
579 new_device
->can_discard
= 0;
580 list_replace_rcu(&device
->dev_list
, &new_device
->dev_list
);
582 call_rcu(&device
->rcu
, free_device
);
584 mutex_unlock(&fs_devices
->device_list_mutex
);
586 WARN_ON(fs_devices
->open_devices
);
587 WARN_ON(fs_devices
->rw_devices
);
588 fs_devices
->opened
= 0;
589 fs_devices
->seeding
= 0;
594 int btrfs_close_devices(struct btrfs_fs_devices
*fs_devices
)
596 struct btrfs_fs_devices
*seed_devices
= NULL
;
599 mutex_lock(&uuid_mutex
);
600 ret
= __btrfs_close_devices(fs_devices
);
601 if (!fs_devices
->opened
) {
602 seed_devices
= fs_devices
->seed
;
603 fs_devices
->seed
= NULL
;
605 mutex_unlock(&uuid_mutex
);
607 while (seed_devices
) {
608 fs_devices
= seed_devices
;
609 seed_devices
= fs_devices
->seed
;
610 __btrfs_close_devices(fs_devices
);
611 free_fs_devices(fs_devices
);
616 static int __btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
617 fmode_t flags
, void *holder
)
619 struct request_queue
*q
;
620 struct block_device
*bdev
;
621 struct list_head
*head
= &fs_devices
->devices
;
622 struct btrfs_device
*device
;
623 struct block_device
*latest_bdev
= NULL
;
624 struct buffer_head
*bh
;
625 struct btrfs_super_block
*disk_super
;
626 u64 latest_devid
= 0;
627 u64 latest_transid
= 0;
634 list_for_each_entry(device
, head
, dev_list
) {
640 bdev
= blkdev_get_by_path(device
->name
->str
, flags
, holder
);
642 printk(KERN_INFO
"btrfs: open %s failed\n", device
->name
->str
);
645 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
646 invalidate_bdev(bdev
);
647 set_blocksize(bdev
, 4096);
649 bh
= btrfs_read_dev_super(bdev
);
653 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
654 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
655 if (devid
!= device
->devid
)
658 if (memcmp(device
->uuid
, disk_super
->dev_item
.uuid
,
662 device
->generation
= btrfs_super_generation(disk_super
);
663 if (!latest_transid
|| device
->generation
> latest_transid
) {
664 latest_devid
= devid
;
665 latest_transid
= device
->generation
;
669 if (btrfs_super_flags(disk_super
) & BTRFS_SUPER_FLAG_SEEDING
) {
670 device
->writeable
= 0;
672 device
->writeable
= !bdev_read_only(bdev
);
676 q
= bdev_get_queue(bdev
);
677 if (blk_queue_discard(q
)) {
678 device
->can_discard
= 1;
679 fs_devices
->num_can_discard
++;
683 device
->in_fs_metadata
= 0;
684 device
->mode
= flags
;
686 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
687 fs_devices
->rotating
= 1;
689 fs_devices
->open_devices
++;
690 if (device
->writeable
) {
691 fs_devices
->rw_devices
++;
692 list_add(&device
->dev_alloc_list
,
693 &fs_devices
->alloc_list
);
701 blkdev_put(bdev
, flags
);
705 if (fs_devices
->open_devices
== 0) {
709 fs_devices
->seeding
= seeding
;
710 fs_devices
->opened
= 1;
711 fs_devices
->latest_bdev
= latest_bdev
;
712 fs_devices
->latest_devid
= latest_devid
;
713 fs_devices
->latest_trans
= latest_transid
;
714 fs_devices
->total_rw_bytes
= 0;
719 int btrfs_open_devices(struct btrfs_fs_devices
*fs_devices
,
720 fmode_t flags
, void *holder
)
724 mutex_lock(&uuid_mutex
);
725 if (fs_devices
->opened
) {
726 fs_devices
->opened
++;
729 ret
= __btrfs_open_devices(fs_devices
, flags
, holder
);
731 mutex_unlock(&uuid_mutex
);
735 int btrfs_scan_one_device(const char *path
, fmode_t flags
, void *holder
,
736 struct btrfs_fs_devices
**fs_devices_ret
)
738 struct btrfs_super_block
*disk_super
;
739 struct block_device
*bdev
;
740 struct buffer_head
*bh
;
747 bdev
= blkdev_get_by_path(path
, flags
, holder
);
754 mutex_lock(&uuid_mutex
);
755 ret
= set_blocksize(bdev
, 4096);
758 bh
= btrfs_read_dev_super(bdev
);
763 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
764 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
765 transid
= btrfs_super_generation(disk_super
);
766 total_devices
= btrfs_super_num_devices(disk_super
);
767 if (disk_super
->label
[0])
768 printk(KERN_INFO
"device label %s ", disk_super
->label
);
770 printk(KERN_INFO
"device fsid %pU ", disk_super
->fsid
);
771 printk(KERN_CONT
"devid %llu transid %llu %s\n",
772 (unsigned long long)devid
, (unsigned long long)transid
, path
);
773 ret
= device_list_add(path
, disk_super
, devid
, fs_devices_ret
);
774 if (!ret
&& fs_devices_ret
)
775 (*fs_devices_ret
)->total_devices
= total_devices
;
778 mutex_unlock(&uuid_mutex
);
779 blkdev_put(bdev
, flags
);
784 /* helper to account the used device space in the range */
785 int btrfs_account_dev_extents_size(struct btrfs_device
*device
, u64 start
,
786 u64 end
, u64
*length
)
788 struct btrfs_key key
;
789 struct btrfs_root
*root
= device
->dev_root
;
790 struct btrfs_dev_extent
*dev_extent
;
791 struct btrfs_path
*path
;
795 struct extent_buffer
*l
;
799 if (start
>= device
->total_bytes
)
802 path
= btrfs_alloc_path();
807 key
.objectid
= device
->devid
;
809 key
.type
= BTRFS_DEV_EXTENT_KEY
;
811 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
815 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
822 slot
= path
->slots
[0];
823 if (slot
>= btrfs_header_nritems(l
)) {
824 ret
= btrfs_next_leaf(root
, path
);
832 btrfs_item_key_to_cpu(l
, &key
, slot
);
834 if (key
.objectid
< device
->devid
)
837 if (key
.objectid
> device
->devid
)
840 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
843 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
844 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
846 if (key
.offset
<= start
&& extent_end
> end
) {
847 *length
= end
- start
+ 1;
849 } else if (key
.offset
<= start
&& extent_end
> start
)
850 *length
+= extent_end
- start
;
851 else if (key
.offset
> start
&& extent_end
<= end
)
852 *length
+= extent_end
- key
.offset
;
853 else if (key
.offset
> start
&& key
.offset
<= end
) {
854 *length
+= end
- key
.offset
+ 1;
856 } else if (key
.offset
> end
)
864 btrfs_free_path(path
);
869 * find_free_dev_extent - find free space in the specified device
870 * @device: the device which we search the free space in
871 * @num_bytes: the size of the free space that we need
872 * @start: store the start of the free space.
873 * @len: the size of the free space. that we find, or the size of the max
874 * free space if we don't find suitable free space
876 * this uses a pretty simple search, the expectation is that it is
877 * called very infrequently and that a given device has a small number
880 * @start is used to store the start of the free space if we find. But if we
881 * don't find suitable free space, it will be used to store the start position
882 * of the max free space.
884 * @len is used to store the size of the free space that we find.
885 * But if we don't find suitable free space, it is used to store the size of
886 * the max free space.
888 int find_free_dev_extent(struct btrfs_device
*device
, u64 num_bytes
,
889 u64
*start
, u64
*len
)
891 struct btrfs_key key
;
892 struct btrfs_root
*root
= device
->dev_root
;
893 struct btrfs_dev_extent
*dev_extent
;
894 struct btrfs_path
*path
;
900 u64 search_end
= device
->total_bytes
;
903 struct extent_buffer
*l
;
905 /* FIXME use last free of some kind */
907 /* we don't want to overwrite the superblock on the drive,
908 * so we make sure to start at an offset of at least 1MB
910 search_start
= max(root
->fs_info
->alloc_start
, 1024ull * 1024);
912 max_hole_start
= search_start
;
916 if (search_start
>= search_end
) {
921 path
= btrfs_alloc_path();
928 key
.objectid
= device
->devid
;
929 key
.offset
= search_start
;
930 key
.type
= BTRFS_DEV_EXTENT_KEY
;
932 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
936 ret
= btrfs_previous_item(root
, path
, key
.objectid
, key
.type
);
943 slot
= path
->slots
[0];
944 if (slot
>= btrfs_header_nritems(l
)) {
945 ret
= btrfs_next_leaf(root
, path
);
953 btrfs_item_key_to_cpu(l
, &key
, slot
);
955 if (key
.objectid
< device
->devid
)
958 if (key
.objectid
> device
->devid
)
961 if (btrfs_key_type(&key
) != BTRFS_DEV_EXTENT_KEY
)
964 if (key
.offset
> search_start
) {
965 hole_size
= key
.offset
- search_start
;
967 if (hole_size
> max_hole_size
) {
968 max_hole_start
= search_start
;
969 max_hole_size
= hole_size
;
973 * If this free space is greater than which we need,
974 * it must be the max free space that we have found
975 * until now, so max_hole_start must point to the start
976 * of this free space and the length of this free space
977 * is stored in max_hole_size. Thus, we return
978 * max_hole_start and max_hole_size and go back to the
981 if (hole_size
>= num_bytes
) {
987 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
988 extent_end
= key
.offset
+ btrfs_dev_extent_length(l
,
990 if (extent_end
> search_start
)
991 search_start
= extent_end
;
998 * At this point, search_start should be the end of
999 * allocated dev extents, and when shrinking the device,
1000 * search_end may be smaller than search_start.
1002 if (search_end
> search_start
)
1003 hole_size
= search_end
- search_start
;
1005 if (hole_size
> max_hole_size
) {
1006 max_hole_start
= search_start
;
1007 max_hole_size
= hole_size
;
1011 if (hole_size
< num_bytes
)
1017 btrfs_free_path(path
);
1019 *start
= max_hole_start
;
1021 *len
= max_hole_size
;
1025 static int btrfs_free_dev_extent(struct btrfs_trans_handle
*trans
,
1026 struct btrfs_device
*device
,
1030 struct btrfs_path
*path
;
1031 struct btrfs_root
*root
= device
->dev_root
;
1032 struct btrfs_key key
;
1033 struct btrfs_key found_key
;
1034 struct extent_buffer
*leaf
= NULL
;
1035 struct btrfs_dev_extent
*extent
= NULL
;
1037 path
= btrfs_alloc_path();
1041 key
.objectid
= device
->devid
;
1043 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1045 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1047 ret
= btrfs_previous_item(root
, path
, key
.objectid
,
1048 BTRFS_DEV_EXTENT_KEY
);
1051 leaf
= path
->nodes
[0];
1052 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
1053 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1054 struct btrfs_dev_extent
);
1055 BUG_ON(found_key
.offset
> start
|| found_key
.offset
+
1056 btrfs_dev_extent_length(leaf
, extent
) < start
);
1058 btrfs_release_path(path
);
1060 } else if (ret
== 0) {
1061 leaf
= path
->nodes
[0];
1062 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1063 struct btrfs_dev_extent
);
1065 btrfs_error(root
->fs_info
, ret
, "Slot search failed");
1069 if (device
->bytes_used
> 0) {
1070 u64 len
= btrfs_dev_extent_length(leaf
, extent
);
1071 device
->bytes_used
-= len
;
1072 spin_lock(&root
->fs_info
->free_chunk_lock
);
1073 root
->fs_info
->free_chunk_space
+= len
;
1074 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1076 ret
= btrfs_del_item(trans
, root
, path
);
1078 btrfs_error(root
->fs_info
, ret
,
1079 "Failed to remove dev extent item");
1082 btrfs_free_path(path
);
1086 int btrfs_alloc_dev_extent(struct btrfs_trans_handle
*trans
,
1087 struct btrfs_device
*device
,
1088 u64 chunk_tree
, u64 chunk_objectid
,
1089 u64 chunk_offset
, u64 start
, u64 num_bytes
)
1092 struct btrfs_path
*path
;
1093 struct btrfs_root
*root
= device
->dev_root
;
1094 struct btrfs_dev_extent
*extent
;
1095 struct extent_buffer
*leaf
;
1096 struct btrfs_key key
;
1098 WARN_ON(!device
->in_fs_metadata
);
1099 path
= btrfs_alloc_path();
1103 key
.objectid
= device
->devid
;
1105 key
.type
= BTRFS_DEV_EXTENT_KEY
;
1106 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1111 leaf
= path
->nodes
[0];
1112 extent
= btrfs_item_ptr(leaf
, path
->slots
[0],
1113 struct btrfs_dev_extent
);
1114 btrfs_set_dev_extent_chunk_tree(leaf
, extent
, chunk_tree
);
1115 btrfs_set_dev_extent_chunk_objectid(leaf
, extent
, chunk_objectid
);
1116 btrfs_set_dev_extent_chunk_offset(leaf
, extent
, chunk_offset
);
1118 write_extent_buffer(leaf
, root
->fs_info
->chunk_tree_uuid
,
1119 (unsigned long)btrfs_dev_extent_chunk_tree_uuid(extent
),
1122 btrfs_set_dev_extent_length(leaf
, extent
, num_bytes
);
1123 btrfs_mark_buffer_dirty(leaf
);
1125 btrfs_free_path(path
);
1129 static noinline
int find_next_chunk(struct btrfs_root
*root
,
1130 u64 objectid
, u64
*offset
)
1132 struct btrfs_path
*path
;
1134 struct btrfs_key key
;
1135 struct btrfs_chunk
*chunk
;
1136 struct btrfs_key found_key
;
1138 path
= btrfs_alloc_path();
1142 key
.objectid
= objectid
;
1143 key
.offset
= (u64
)-1;
1144 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
1146 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1150 BUG_ON(ret
== 0); /* Corruption */
1152 ret
= btrfs_previous_item(root
, path
, 0, BTRFS_CHUNK_ITEM_KEY
);
1156 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1158 if (found_key
.objectid
!= objectid
)
1161 chunk
= btrfs_item_ptr(path
->nodes
[0], path
->slots
[0],
1162 struct btrfs_chunk
);
1163 *offset
= found_key
.offset
+
1164 btrfs_chunk_length(path
->nodes
[0], chunk
);
1169 btrfs_free_path(path
);
1173 static noinline
int find_next_devid(struct btrfs_root
*root
, u64
*objectid
)
1176 struct btrfs_key key
;
1177 struct btrfs_key found_key
;
1178 struct btrfs_path
*path
;
1180 root
= root
->fs_info
->chunk_root
;
1182 path
= btrfs_alloc_path();
1186 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1187 key
.type
= BTRFS_DEV_ITEM_KEY
;
1188 key
.offset
= (u64
)-1;
1190 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
1194 BUG_ON(ret
== 0); /* Corruption */
1196 ret
= btrfs_previous_item(root
, path
, BTRFS_DEV_ITEMS_OBJECTID
,
1197 BTRFS_DEV_ITEM_KEY
);
1201 btrfs_item_key_to_cpu(path
->nodes
[0], &found_key
,
1203 *objectid
= found_key
.offset
+ 1;
1207 btrfs_free_path(path
);
1212 * the device information is stored in the chunk root
1213 * the btrfs_device struct should be fully filled in
1215 int btrfs_add_device(struct btrfs_trans_handle
*trans
,
1216 struct btrfs_root
*root
,
1217 struct btrfs_device
*device
)
1220 struct btrfs_path
*path
;
1221 struct btrfs_dev_item
*dev_item
;
1222 struct extent_buffer
*leaf
;
1223 struct btrfs_key key
;
1226 root
= root
->fs_info
->chunk_root
;
1228 path
= btrfs_alloc_path();
1232 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1233 key
.type
= BTRFS_DEV_ITEM_KEY
;
1234 key
.offset
= device
->devid
;
1236 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
1241 leaf
= path
->nodes
[0];
1242 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
1244 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
1245 btrfs_set_device_generation(leaf
, dev_item
, 0);
1246 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
1247 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
1248 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
1249 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
1250 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->total_bytes
);
1251 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
1252 btrfs_set_device_group(leaf
, dev_item
, 0);
1253 btrfs_set_device_seek_speed(leaf
, dev_item
, 0);
1254 btrfs_set_device_bandwidth(leaf
, dev_item
, 0);
1255 btrfs_set_device_start_offset(leaf
, dev_item
, 0);
1257 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
1258 write_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
1259 ptr
= (unsigned long)btrfs_device_fsid(dev_item
);
1260 write_extent_buffer(leaf
, root
->fs_info
->fsid
, ptr
, BTRFS_UUID_SIZE
);
1261 btrfs_mark_buffer_dirty(leaf
);
1265 btrfs_free_path(path
);
1269 static int btrfs_rm_dev_item(struct btrfs_root
*root
,
1270 struct btrfs_device
*device
)
1273 struct btrfs_path
*path
;
1274 struct btrfs_key key
;
1275 struct btrfs_trans_handle
*trans
;
1277 root
= root
->fs_info
->chunk_root
;
1279 path
= btrfs_alloc_path();
1283 trans
= btrfs_start_transaction(root
, 0);
1284 if (IS_ERR(trans
)) {
1285 btrfs_free_path(path
);
1286 return PTR_ERR(trans
);
1288 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1289 key
.type
= BTRFS_DEV_ITEM_KEY
;
1290 key
.offset
= device
->devid
;
1293 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1302 ret
= btrfs_del_item(trans
, root
, path
);
1306 btrfs_free_path(path
);
1307 unlock_chunks(root
);
1308 btrfs_commit_transaction(trans
, root
);
1312 int btrfs_rm_device(struct btrfs_root
*root
, char *device_path
)
1314 struct btrfs_device
*device
;
1315 struct btrfs_device
*next_device
;
1316 struct block_device
*bdev
;
1317 struct buffer_head
*bh
= NULL
;
1318 struct btrfs_super_block
*disk_super
;
1319 struct btrfs_fs_devices
*cur_devices
;
1325 bool clear_super
= false;
1327 mutex_lock(&uuid_mutex
);
1329 all_avail
= root
->fs_info
->avail_data_alloc_bits
|
1330 root
->fs_info
->avail_system_alloc_bits
|
1331 root
->fs_info
->avail_metadata_alloc_bits
;
1333 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID10
) &&
1334 root
->fs_info
->fs_devices
->num_devices
<= 4) {
1335 printk(KERN_ERR
"btrfs: unable to go below four devices "
1341 if ((all_avail
& BTRFS_BLOCK_GROUP_RAID1
) &&
1342 root
->fs_info
->fs_devices
->num_devices
<= 2) {
1343 printk(KERN_ERR
"btrfs: unable to go below two "
1344 "devices on raid1\n");
1349 if (strcmp(device_path
, "missing") == 0) {
1350 struct list_head
*devices
;
1351 struct btrfs_device
*tmp
;
1354 devices
= &root
->fs_info
->fs_devices
->devices
;
1356 * It is safe to read the devices since the volume_mutex
1359 list_for_each_entry(tmp
, devices
, dev_list
) {
1360 if (tmp
->in_fs_metadata
&& !tmp
->bdev
) {
1369 printk(KERN_ERR
"btrfs: no missing devices found to "
1374 bdev
= blkdev_get_by_path(device_path
, FMODE_READ
| FMODE_EXCL
,
1375 root
->fs_info
->bdev_holder
);
1377 ret
= PTR_ERR(bdev
);
1381 set_blocksize(bdev
, 4096);
1382 invalidate_bdev(bdev
);
1383 bh
= btrfs_read_dev_super(bdev
);
1388 disk_super
= (struct btrfs_super_block
*)bh
->b_data
;
1389 devid
= btrfs_stack_device_id(&disk_super
->dev_item
);
1390 dev_uuid
= disk_super
->dev_item
.uuid
;
1391 device
= btrfs_find_device(root
, devid
, dev_uuid
,
1399 if (device
->writeable
&& root
->fs_info
->fs_devices
->rw_devices
== 1) {
1400 printk(KERN_ERR
"btrfs: unable to remove the only writeable "
1406 if (device
->writeable
) {
1408 list_del_init(&device
->dev_alloc_list
);
1409 unlock_chunks(root
);
1410 root
->fs_info
->fs_devices
->rw_devices
--;
1414 ret
= btrfs_shrink_device(device
, 0);
1418 ret
= btrfs_rm_dev_item(root
->fs_info
->chunk_root
, device
);
1422 spin_lock(&root
->fs_info
->free_chunk_lock
);
1423 root
->fs_info
->free_chunk_space
= device
->total_bytes
-
1425 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1427 device
->in_fs_metadata
= 0;
1428 btrfs_scrub_cancel_dev(root
, device
);
1431 * the device list mutex makes sure that we don't change
1432 * the device list while someone else is writing out all
1433 * the device supers.
1436 cur_devices
= device
->fs_devices
;
1437 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1438 list_del_rcu(&device
->dev_list
);
1440 device
->fs_devices
->num_devices
--;
1441 device
->fs_devices
->total_devices
--;
1443 if (device
->missing
)
1444 root
->fs_info
->fs_devices
->missing_devices
--;
1446 next_device
= list_entry(root
->fs_info
->fs_devices
->devices
.next
,
1447 struct btrfs_device
, dev_list
);
1448 if (device
->bdev
== root
->fs_info
->sb
->s_bdev
)
1449 root
->fs_info
->sb
->s_bdev
= next_device
->bdev
;
1450 if (device
->bdev
== root
->fs_info
->fs_devices
->latest_bdev
)
1451 root
->fs_info
->fs_devices
->latest_bdev
= next_device
->bdev
;
1454 device
->fs_devices
->open_devices
--;
1456 call_rcu(&device
->rcu
, free_device
);
1457 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1459 num_devices
= btrfs_super_num_devices(root
->fs_info
->super_copy
) - 1;
1460 btrfs_set_super_num_devices(root
->fs_info
->super_copy
, num_devices
);
1462 if (cur_devices
->open_devices
== 0) {
1463 struct btrfs_fs_devices
*fs_devices
;
1464 fs_devices
= root
->fs_info
->fs_devices
;
1465 while (fs_devices
) {
1466 if (fs_devices
->seed
== cur_devices
)
1468 fs_devices
= fs_devices
->seed
;
1470 fs_devices
->seed
= cur_devices
->seed
;
1471 cur_devices
->seed
= NULL
;
1473 __btrfs_close_devices(cur_devices
);
1474 unlock_chunks(root
);
1475 free_fs_devices(cur_devices
);
1478 root
->fs_info
->num_tolerated_disk_barrier_failures
=
1479 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
1482 * at this point, the device is zero sized. We want to
1483 * remove it from the devices list and zero out the old super
1486 /* make sure this device isn't detected as part of
1489 memset(&disk_super
->magic
, 0, sizeof(disk_super
->magic
));
1490 set_buffer_dirty(bh
);
1491 sync_dirty_buffer(bh
);
1500 blkdev_put(bdev
, FMODE_READ
| FMODE_EXCL
);
1502 mutex_unlock(&uuid_mutex
);
1505 if (device
->writeable
) {
1507 list_add(&device
->dev_alloc_list
,
1508 &root
->fs_info
->fs_devices
->alloc_list
);
1509 unlock_chunks(root
);
1510 root
->fs_info
->fs_devices
->rw_devices
++;
1516 * does all the dirty work required for changing file system's UUID.
1518 static int btrfs_prepare_sprout(struct btrfs_root
*root
)
1520 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
1521 struct btrfs_fs_devices
*old_devices
;
1522 struct btrfs_fs_devices
*seed_devices
;
1523 struct btrfs_super_block
*disk_super
= root
->fs_info
->super_copy
;
1524 struct btrfs_device
*device
;
1527 BUG_ON(!mutex_is_locked(&uuid_mutex
));
1528 if (!fs_devices
->seeding
)
1531 seed_devices
= kzalloc(sizeof(*fs_devices
), GFP_NOFS
);
1535 old_devices
= clone_fs_devices(fs_devices
);
1536 if (IS_ERR(old_devices
)) {
1537 kfree(seed_devices
);
1538 return PTR_ERR(old_devices
);
1541 list_add(&old_devices
->list
, &fs_uuids
);
1543 memcpy(seed_devices
, fs_devices
, sizeof(*seed_devices
));
1544 seed_devices
->opened
= 1;
1545 INIT_LIST_HEAD(&seed_devices
->devices
);
1546 INIT_LIST_HEAD(&seed_devices
->alloc_list
);
1547 mutex_init(&seed_devices
->device_list_mutex
);
1549 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1550 list_splice_init_rcu(&fs_devices
->devices
, &seed_devices
->devices
,
1552 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1554 list_splice_init(&fs_devices
->alloc_list
, &seed_devices
->alloc_list
);
1555 list_for_each_entry(device
, &seed_devices
->devices
, dev_list
) {
1556 device
->fs_devices
= seed_devices
;
1559 fs_devices
->seeding
= 0;
1560 fs_devices
->num_devices
= 0;
1561 fs_devices
->open_devices
= 0;
1562 fs_devices
->total_devices
= 0;
1563 fs_devices
->seed
= seed_devices
;
1565 generate_random_uuid(fs_devices
->fsid
);
1566 memcpy(root
->fs_info
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1567 memcpy(disk_super
->fsid
, fs_devices
->fsid
, BTRFS_FSID_SIZE
);
1568 super_flags
= btrfs_super_flags(disk_super
) &
1569 ~BTRFS_SUPER_FLAG_SEEDING
;
1570 btrfs_set_super_flags(disk_super
, super_flags
);
1576 * strore the expected generation for seed devices in device items.
1578 static int btrfs_finish_sprout(struct btrfs_trans_handle
*trans
,
1579 struct btrfs_root
*root
)
1581 struct btrfs_path
*path
;
1582 struct extent_buffer
*leaf
;
1583 struct btrfs_dev_item
*dev_item
;
1584 struct btrfs_device
*device
;
1585 struct btrfs_key key
;
1586 u8 fs_uuid
[BTRFS_UUID_SIZE
];
1587 u8 dev_uuid
[BTRFS_UUID_SIZE
];
1591 path
= btrfs_alloc_path();
1595 root
= root
->fs_info
->chunk_root
;
1596 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1598 key
.type
= BTRFS_DEV_ITEM_KEY
;
1601 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
1605 leaf
= path
->nodes
[0];
1607 if (path
->slots
[0] >= btrfs_header_nritems(leaf
)) {
1608 ret
= btrfs_next_leaf(root
, path
);
1613 leaf
= path
->nodes
[0];
1614 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1615 btrfs_release_path(path
);
1619 btrfs_item_key_to_cpu(leaf
, &key
, path
->slots
[0]);
1620 if (key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
||
1621 key
.type
!= BTRFS_DEV_ITEM_KEY
)
1624 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0],
1625 struct btrfs_dev_item
);
1626 devid
= btrfs_device_id(leaf
, dev_item
);
1627 read_extent_buffer(leaf
, dev_uuid
,
1628 (unsigned long)btrfs_device_uuid(dev_item
),
1630 read_extent_buffer(leaf
, fs_uuid
,
1631 (unsigned long)btrfs_device_fsid(dev_item
),
1633 device
= btrfs_find_device(root
, devid
, dev_uuid
, fs_uuid
);
1634 BUG_ON(!device
); /* Logic error */
1636 if (device
->fs_devices
->seeding
) {
1637 btrfs_set_device_generation(leaf
, dev_item
,
1638 device
->generation
);
1639 btrfs_mark_buffer_dirty(leaf
);
1647 btrfs_free_path(path
);
1651 int btrfs_init_new_device(struct btrfs_root
*root
, char *device_path
)
1653 struct request_queue
*q
;
1654 struct btrfs_trans_handle
*trans
;
1655 struct btrfs_device
*device
;
1656 struct block_device
*bdev
;
1657 struct list_head
*devices
;
1658 struct super_block
*sb
= root
->fs_info
->sb
;
1659 struct rcu_string
*name
;
1661 int seeding_dev
= 0;
1664 if ((sb
->s_flags
& MS_RDONLY
) && !root
->fs_info
->fs_devices
->seeding
)
1667 bdev
= blkdev_get_by_path(device_path
, FMODE_WRITE
| FMODE_EXCL
,
1668 root
->fs_info
->bdev_holder
);
1670 return PTR_ERR(bdev
);
1672 if (root
->fs_info
->fs_devices
->seeding
) {
1674 down_write(&sb
->s_umount
);
1675 mutex_lock(&uuid_mutex
);
1678 filemap_write_and_wait(bdev
->bd_inode
->i_mapping
);
1680 devices
= &root
->fs_info
->fs_devices
->devices
;
1682 * we have the volume lock, so we don't need the extra
1683 * device list mutex while reading the list here.
1685 list_for_each_entry(device
, devices
, dev_list
) {
1686 if (device
->bdev
== bdev
) {
1692 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
1694 /* we can safely leave the fs_devices entry around */
1699 name
= rcu_string_strdup(device_path
, GFP_NOFS
);
1705 rcu_assign_pointer(device
->name
, name
);
1707 ret
= find_next_devid(root
, &device
->devid
);
1709 rcu_string_free(device
->name
);
1714 trans
= btrfs_start_transaction(root
, 0);
1715 if (IS_ERR(trans
)) {
1716 rcu_string_free(device
->name
);
1718 ret
= PTR_ERR(trans
);
1724 q
= bdev_get_queue(bdev
);
1725 if (blk_queue_discard(q
))
1726 device
->can_discard
= 1;
1727 device
->writeable
= 1;
1728 device
->work
.func
= pending_bios_fn
;
1729 generate_random_uuid(device
->uuid
);
1730 spin_lock_init(&device
->io_lock
);
1731 device
->generation
= trans
->transid
;
1732 device
->io_width
= root
->sectorsize
;
1733 device
->io_align
= root
->sectorsize
;
1734 device
->sector_size
= root
->sectorsize
;
1735 device
->total_bytes
= i_size_read(bdev
->bd_inode
);
1736 device
->disk_total_bytes
= device
->total_bytes
;
1737 device
->dev_root
= root
->fs_info
->dev_root
;
1738 device
->bdev
= bdev
;
1739 device
->in_fs_metadata
= 1;
1740 device
->mode
= FMODE_EXCL
;
1741 set_blocksize(device
->bdev
, 4096);
1744 sb
->s_flags
&= ~MS_RDONLY
;
1745 ret
= btrfs_prepare_sprout(root
);
1746 BUG_ON(ret
); /* -ENOMEM */
1749 device
->fs_devices
= root
->fs_info
->fs_devices
;
1751 mutex_lock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1752 list_add_rcu(&device
->dev_list
, &root
->fs_info
->fs_devices
->devices
);
1753 list_add(&device
->dev_alloc_list
,
1754 &root
->fs_info
->fs_devices
->alloc_list
);
1755 root
->fs_info
->fs_devices
->num_devices
++;
1756 root
->fs_info
->fs_devices
->open_devices
++;
1757 root
->fs_info
->fs_devices
->rw_devices
++;
1758 root
->fs_info
->fs_devices
->total_devices
++;
1759 if (device
->can_discard
)
1760 root
->fs_info
->fs_devices
->num_can_discard
++;
1761 root
->fs_info
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
1763 spin_lock(&root
->fs_info
->free_chunk_lock
);
1764 root
->fs_info
->free_chunk_space
+= device
->total_bytes
;
1765 spin_unlock(&root
->fs_info
->free_chunk_lock
);
1767 if (!blk_queue_nonrot(bdev_get_queue(bdev
)))
1768 root
->fs_info
->fs_devices
->rotating
= 1;
1770 total_bytes
= btrfs_super_total_bytes(root
->fs_info
->super_copy
);
1771 btrfs_set_super_total_bytes(root
->fs_info
->super_copy
,
1772 total_bytes
+ device
->total_bytes
);
1774 total_bytes
= btrfs_super_num_devices(root
->fs_info
->super_copy
);
1775 btrfs_set_super_num_devices(root
->fs_info
->super_copy
,
1777 mutex_unlock(&root
->fs_info
->fs_devices
->device_list_mutex
);
1780 ret
= init_first_rw_device(trans
, root
, device
);
1782 btrfs_abort_transaction(trans
, root
, ret
);
1785 ret
= btrfs_finish_sprout(trans
, root
);
1787 btrfs_abort_transaction(trans
, root
, ret
);
1791 ret
= btrfs_add_device(trans
, root
, device
);
1793 btrfs_abort_transaction(trans
, root
, ret
);
1799 * we've got more storage, clear any full flags on the space
1802 btrfs_clear_space_info_full(root
->fs_info
);
1804 unlock_chunks(root
);
1805 root
->fs_info
->num_tolerated_disk_barrier_failures
=
1806 btrfs_calc_num_tolerated_disk_barrier_failures(root
->fs_info
);
1807 ret
= btrfs_commit_transaction(trans
, root
);
1810 mutex_unlock(&uuid_mutex
);
1811 up_write(&sb
->s_umount
);
1813 if (ret
) /* transaction commit */
1816 ret
= btrfs_relocate_sys_chunks(root
);
1818 btrfs_error(root
->fs_info
, ret
,
1819 "Failed to relocate sys chunks after "
1820 "device initialization. This can be fixed "
1821 "using the \"btrfs balance\" command.");
1822 trans
= btrfs_attach_transaction(root
);
1823 if (IS_ERR(trans
)) {
1824 if (PTR_ERR(trans
) == -ENOENT
)
1826 return PTR_ERR(trans
);
1828 ret
= btrfs_commit_transaction(trans
, root
);
1834 unlock_chunks(root
);
1835 btrfs_end_transaction(trans
, root
);
1836 rcu_string_free(device
->name
);
1839 blkdev_put(bdev
, FMODE_EXCL
);
1841 mutex_unlock(&uuid_mutex
);
1842 up_write(&sb
->s_umount
);
1847 static noinline
int btrfs_update_device(struct btrfs_trans_handle
*trans
,
1848 struct btrfs_device
*device
)
1851 struct btrfs_path
*path
;
1852 struct btrfs_root
*root
;
1853 struct btrfs_dev_item
*dev_item
;
1854 struct extent_buffer
*leaf
;
1855 struct btrfs_key key
;
1857 root
= device
->dev_root
->fs_info
->chunk_root
;
1859 path
= btrfs_alloc_path();
1863 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
1864 key
.type
= BTRFS_DEV_ITEM_KEY
;
1865 key
.offset
= device
->devid
;
1867 ret
= btrfs_search_slot(trans
, root
, &key
, path
, 0, 1);
1876 leaf
= path
->nodes
[0];
1877 dev_item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_dev_item
);
1879 btrfs_set_device_id(leaf
, dev_item
, device
->devid
);
1880 btrfs_set_device_type(leaf
, dev_item
, device
->type
);
1881 btrfs_set_device_io_align(leaf
, dev_item
, device
->io_align
);
1882 btrfs_set_device_io_width(leaf
, dev_item
, device
->io_width
);
1883 btrfs_set_device_sector_size(leaf
, dev_item
, device
->sector_size
);
1884 btrfs_set_device_total_bytes(leaf
, dev_item
, device
->disk_total_bytes
);
1885 btrfs_set_device_bytes_used(leaf
, dev_item
, device
->bytes_used
);
1886 btrfs_mark_buffer_dirty(leaf
);
1889 btrfs_free_path(path
);
1893 static int __btrfs_grow_device(struct btrfs_trans_handle
*trans
,
1894 struct btrfs_device
*device
, u64 new_size
)
1896 struct btrfs_super_block
*super_copy
=
1897 device
->dev_root
->fs_info
->super_copy
;
1898 u64 old_total
= btrfs_super_total_bytes(super_copy
);
1899 u64 diff
= new_size
- device
->total_bytes
;
1901 if (!device
->writeable
)
1903 if (new_size
<= device
->total_bytes
)
1906 btrfs_set_super_total_bytes(super_copy
, old_total
+ diff
);
1907 device
->fs_devices
->total_rw_bytes
+= diff
;
1909 device
->total_bytes
= new_size
;
1910 device
->disk_total_bytes
= new_size
;
1911 btrfs_clear_space_info_full(device
->dev_root
->fs_info
);
1913 return btrfs_update_device(trans
, device
);
1916 int btrfs_grow_device(struct btrfs_trans_handle
*trans
,
1917 struct btrfs_device
*device
, u64 new_size
)
1920 lock_chunks(device
->dev_root
);
1921 ret
= __btrfs_grow_device(trans
, device
, new_size
);
1922 unlock_chunks(device
->dev_root
);
1926 static int btrfs_free_chunk(struct btrfs_trans_handle
*trans
,
1927 struct btrfs_root
*root
,
1928 u64 chunk_tree
, u64 chunk_objectid
,
1932 struct btrfs_path
*path
;
1933 struct btrfs_key key
;
1935 root
= root
->fs_info
->chunk_root
;
1936 path
= btrfs_alloc_path();
1940 key
.objectid
= chunk_objectid
;
1941 key
.offset
= chunk_offset
;
1942 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
1944 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
1947 else if (ret
> 0) { /* Logic error or corruption */
1948 btrfs_error(root
->fs_info
, -ENOENT
,
1949 "Failed lookup while freeing chunk.");
1954 ret
= btrfs_del_item(trans
, root
, path
);
1956 btrfs_error(root
->fs_info
, ret
,
1957 "Failed to delete chunk item.");
1959 btrfs_free_path(path
);
1963 static int btrfs_del_sys_chunk(struct btrfs_root
*root
, u64 chunk_objectid
, u64
1966 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
1967 struct btrfs_disk_key
*disk_key
;
1968 struct btrfs_chunk
*chunk
;
1975 struct btrfs_key key
;
1977 array_size
= btrfs_super_sys_array_size(super_copy
);
1979 ptr
= super_copy
->sys_chunk_array
;
1982 while (cur
< array_size
) {
1983 disk_key
= (struct btrfs_disk_key
*)ptr
;
1984 btrfs_disk_key_to_cpu(&key
, disk_key
);
1986 len
= sizeof(*disk_key
);
1988 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
1989 chunk
= (struct btrfs_chunk
*)(ptr
+ len
);
1990 num_stripes
= btrfs_stack_chunk_num_stripes(chunk
);
1991 len
+= btrfs_chunk_item_size(num_stripes
);
1996 if (key
.objectid
== chunk_objectid
&&
1997 key
.offset
== chunk_offset
) {
1998 memmove(ptr
, ptr
+ len
, array_size
- (cur
+ len
));
2000 btrfs_set_super_sys_array_size(super_copy
, array_size
);
2009 static int btrfs_relocate_chunk(struct btrfs_root
*root
,
2010 u64 chunk_tree
, u64 chunk_objectid
,
2013 struct extent_map_tree
*em_tree
;
2014 struct btrfs_root
*extent_root
;
2015 struct btrfs_trans_handle
*trans
;
2016 struct extent_map
*em
;
2017 struct map_lookup
*map
;
2021 root
= root
->fs_info
->chunk_root
;
2022 extent_root
= root
->fs_info
->extent_root
;
2023 em_tree
= &root
->fs_info
->mapping_tree
.map_tree
;
2025 ret
= btrfs_can_relocate(extent_root
, chunk_offset
);
2029 /* step one, relocate all the extents inside this chunk */
2030 ret
= btrfs_relocate_block_group(extent_root
, chunk_offset
);
2034 trans
= btrfs_start_transaction(root
, 0);
2035 BUG_ON(IS_ERR(trans
));
2040 * step two, delete the device extents and the
2041 * chunk tree entries
2043 read_lock(&em_tree
->lock
);
2044 em
= lookup_extent_mapping(em_tree
, chunk_offset
, 1);
2045 read_unlock(&em_tree
->lock
);
2047 BUG_ON(!em
|| em
->start
> chunk_offset
||
2048 em
->start
+ em
->len
< chunk_offset
);
2049 map
= (struct map_lookup
*)em
->bdev
;
2051 for (i
= 0; i
< map
->num_stripes
; i
++) {
2052 ret
= btrfs_free_dev_extent(trans
, map
->stripes
[i
].dev
,
2053 map
->stripes
[i
].physical
);
2056 if (map
->stripes
[i
].dev
) {
2057 ret
= btrfs_update_device(trans
, map
->stripes
[i
].dev
);
2061 ret
= btrfs_free_chunk(trans
, root
, chunk_tree
, chunk_objectid
,
2066 trace_btrfs_chunk_free(root
, map
, chunk_offset
, em
->len
);
2068 if (map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2069 ret
= btrfs_del_sys_chunk(root
, chunk_objectid
, chunk_offset
);
2073 ret
= btrfs_remove_block_group(trans
, extent_root
, chunk_offset
);
2076 write_lock(&em_tree
->lock
);
2077 remove_extent_mapping(em_tree
, em
);
2078 write_unlock(&em_tree
->lock
);
2083 /* once for the tree */
2084 free_extent_map(em
);
2086 free_extent_map(em
);
2088 unlock_chunks(root
);
2089 btrfs_end_transaction(trans
, root
);
2093 static int btrfs_relocate_sys_chunks(struct btrfs_root
*root
)
2095 struct btrfs_root
*chunk_root
= root
->fs_info
->chunk_root
;
2096 struct btrfs_path
*path
;
2097 struct extent_buffer
*leaf
;
2098 struct btrfs_chunk
*chunk
;
2099 struct btrfs_key key
;
2100 struct btrfs_key found_key
;
2101 u64 chunk_tree
= chunk_root
->root_key
.objectid
;
2103 bool retried
= false;
2107 path
= btrfs_alloc_path();
2112 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2113 key
.offset
= (u64
)-1;
2114 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2117 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2120 BUG_ON(ret
== 0); /* Corruption */
2122 ret
= btrfs_previous_item(chunk_root
, path
, key
.objectid
,
2129 leaf
= path
->nodes
[0];
2130 btrfs_item_key_to_cpu(leaf
, &found_key
, path
->slots
[0]);
2132 chunk
= btrfs_item_ptr(leaf
, path
->slots
[0],
2133 struct btrfs_chunk
);
2134 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2135 btrfs_release_path(path
);
2137 if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
2138 ret
= btrfs_relocate_chunk(chunk_root
, chunk_tree
,
2147 if (found_key
.offset
== 0)
2149 key
.offset
= found_key
.offset
- 1;
2152 if (failed
&& !retried
) {
2156 } else if (failed
&& retried
) {
2161 btrfs_free_path(path
);
2165 static int insert_balance_item(struct btrfs_root
*root
,
2166 struct btrfs_balance_control
*bctl
)
2168 struct btrfs_trans_handle
*trans
;
2169 struct btrfs_balance_item
*item
;
2170 struct btrfs_disk_balance_args disk_bargs
;
2171 struct btrfs_path
*path
;
2172 struct extent_buffer
*leaf
;
2173 struct btrfs_key key
;
2176 path
= btrfs_alloc_path();
2180 trans
= btrfs_start_transaction(root
, 0);
2181 if (IS_ERR(trans
)) {
2182 btrfs_free_path(path
);
2183 return PTR_ERR(trans
);
2186 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2187 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2190 ret
= btrfs_insert_empty_item(trans
, root
, path
, &key
,
2195 leaf
= path
->nodes
[0];
2196 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
2198 memset_extent_buffer(leaf
, 0, (unsigned long)item
, sizeof(*item
));
2200 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->data
);
2201 btrfs_set_balance_data(leaf
, item
, &disk_bargs
);
2202 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->meta
);
2203 btrfs_set_balance_meta(leaf
, item
, &disk_bargs
);
2204 btrfs_cpu_balance_args_to_disk(&disk_bargs
, &bctl
->sys
);
2205 btrfs_set_balance_sys(leaf
, item
, &disk_bargs
);
2207 btrfs_set_balance_flags(leaf
, item
, bctl
->flags
);
2209 btrfs_mark_buffer_dirty(leaf
);
2211 btrfs_free_path(path
);
2212 err
= btrfs_commit_transaction(trans
, root
);
2218 static int del_balance_item(struct btrfs_root
*root
)
2220 struct btrfs_trans_handle
*trans
;
2221 struct btrfs_path
*path
;
2222 struct btrfs_key key
;
2225 path
= btrfs_alloc_path();
2229 trans
= btrfs_start_transaction(root
, 0);
2230 if (IS_ERR(trans
)) {
2231 btrfs_free_path(path
);
2232 return PTR_ERR(trans
);
2235 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2236 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2239 ret
= btrfs_search_slot(trans
, root
, &key
, path
, -1, 1);
2247 ret
= btrfs_del_item(trans
, root
, path
);
2249 btrfs_free_path(path
);
2250 err
= btrfs_commit_transaction(trans
, root
);
2257 * This is a heuristic used to reduce the number of chunks balanced on
2258 * resume after balance was interrupted.
2260 static void update_balance_args(struct btrfs_balance_control
*bctl
)
2263 * Turn on soft mode for chunk types that were being converted.
2265 if (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2266 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2267 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2268 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2269 if (bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)
2270 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_SOFT
;
2273 * Turn on usage filter if is not already used. The idea is
2274 * that chunks that we have already balanced should be
2275 * reasonably full. Don't do it for chunks that are being
2276 * converted - that will keep us from relocating unconverted
2277 * (albeit full) chunks.
2279 if (!(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2280 !(bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2281 bctl
->data
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2282 bctl
->data
.usage
= 90;
2284 if (!(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2285 !(bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2286 bctl
->sys
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2287 bctl
->sys
.usage
= 90;
2289 if (!(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2290 !(bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
)) {
2291 bctl
->meta
.flags
|= BTRFS_BALANCE_ARGS_USAGE
;
2292 bctl
->meta
.usage
= 90;
2297 * Should be called with both balance and volume mutexes held to
2298 * serialize other volume operations (add_dev/rm_dev/resize) with
2299 * restriper. Same goes for unset_balance_control.
2301 static void set_balance_control(struct btrfs_balance_control
*bctl
)
2303 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
2305 BUG_ON(fs_info
->balance_ctl
);
2307 spin_lock(&fs_info
->balance_lock
);
2308 fs_info
->balance_ctl
= bctl
;
2309 spin_unlock(&fs_info
->balance_lock
);
2312 static void unset_balance_control(struct btrfs_fs_info
*fs_info
)
2314 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2316 BUG_ON(!fs_info
->balance_ctl
);
2318 spin_lock(&fs_info
->balance_lock
);
2319 fs_info
->balance_ctl
= NULL
;
2320 spin_unlock(&fs_info
->balance_lock
);
2326 * Balance filters. Return 1 if chunk should be filtered out
2327 * (should not be balanced).
2329 static int chunk_profiles_filter(u64 chunk_type
,
2330 struct btrfs_balance_args
*bargs
)
2332 chunk_type
= chunk_to_extended(chunk_type
) &
2333 BTRFS_EXTENDED_PROFILE_MASK
;
2335 if (bargs
->profiles
& chunk_type
)
2341 static u64
div_factor_fine(u64 num
, int factor
)
2353 static int chunk_usage_filter(struct btrfs_fs_info
*fs_info
, u64 chunk_offset
,
2354 struct btrfs_balance_args
*bargs
)
2356 struct btrfs_block_group_cache
*cache
;
2357 u64 chunk_used
, user_thresh
;
2360 cache
= btrfs_lookup_block_group(fs_info
, chunk_offset
);
2361 chunk_used
= btrfs_block_group_used(&cache
->item
);
2363 user_thresh
= div_factor_fine(cache
->key
.offset
, bargs
->usage
);
2364 if (chunk_used
< user_thresh
)
2367 btrfs_put_block_group(cache
);
2371 static int chunk_devid_filter(struct extent_buffer
*leaf
,
2372 struct btrfs_chunk
*chunk
,
2373 struct btrfs_balance_args
*bargs
)
2375 struct btrfs_stripe
*stripe
;
2376 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2379 for (i
= 0; i
< num_stripes
; i
++) {
2380 stripe
= btrfs_stripe_nr(chunk
, i
);
2381 if (btrfs_stripe_devid(leaf
, stripe
) == bargs
->devid
)
2388 /* [pstart, pend) */
2389 static int chunk_drange_filter(struct extent_buffer
*leaf
,
2390 struct btrfs_chunk
*chunk
,
2392 struct btrfs_balance_args
*bargs
)
2394 struct btrfs_stripe
*stripe
;
2395 int num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
2401 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
))
2404 if (btrfs_chunk_type(leaf
, chunk
) & (BTRFS_BLOCK_GROUP_DUP
|
2405 BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
))
2409 factor
= num_stripes
/ factor
;
2411 for (i
= 0; i
< num_stripes
; i
++) {
2412 stripe
= btrfs_stripe_nr(chunk
, i
);
2413 if (btrfs_stripe_devid(leaf
, stripe
) != bargs
->devid
)
2416 stripe_offset
= btrfs_stripe_offset(leaf
, stripe
);
2417 stripe_length
= btrfs_chunk_length(leaf
, chunk
);
2418 do_div(stripe_length
, factor
);
2420 if (stripe_offset
< bargs
->pend
&&
2421 stripe_offset
+ stripe_length
> bargs
->pstart
)
2428 /* [vstart, vend) */
2429 static int chunk_vrange_filter(struct extent_buffer
*leaf
,
2430 struct btrfs_chunk
*chunk
,
2432 struct btrfs_balance_args
*bargs
)
2434 if (chunk_offset
< bargs
->vend
&&
2435 chunk_offset
+ btrfs_chunk_length(leaf
, chunk
) > bargs
->vstart
)
2436 /* at least part of the chunk is inside this vrange */
2442 static int chunk_soft_convert_filter(u64 chunk_type
,
2443 struct btrfs_balance_args
*bargs
)
2445 if (!(bargs
->flags
& BTRFS_BALANCE_ARGS_CONVERT
))
2448 chunk_type
= chunk_to_extended(chunk_type
) &
2449 BTRFS_EXTENDED_PROFILE_MASK
;
2451 if (bargs
->target
== chunk_type
)
2457 static int should_balance_chunk(struct btrfs_root
*root
,
2458 struct extent_buffer
*leaf
,
2459 struct btrfs_chunk
*chunk
, u64 chunk_offset
)
2461 struct btrfs_balance_control
*bctl
= root
->fs_info
->balance_ctl
;
2462 struct btrfs_balance_args
*bargs
= NULL
;
2463 u64 chunk_type
= btrfs_chunk_type(leaf
, chunk
);
2466 if (!((chunk_type
& BTRFS_BLOCK_GROUP_TYPE_MASK
) &
2467 (bctl
->flags
& BTRFS_BALANCE_TYPE_MASK
))) {
2471 if (chunk_type
& BTRFS_BLOCK_GROUP_DATA
)
2472 bargs
= &bctl
->data
;
2473 else if (chunk_type
& BTRFS_BLOCK_GROUP_SYSTEM
)
2475 else if (chunk_type
& BTRFS_BLOCK_GROUP_METADATA
)
2476 bargs
= &bctl
->meta
;
2478 /* profiles filter */
2479 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_PROFILES
) &&
2480 chunk_profiles_filter(chunk_type
, bargs
)) {
2485 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_USAGE
) &&
2486 chunk_usage_filter(bctl
->fs_info
, chunk_offset
, bargs
)) {
2491 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DEVID
) &&
2492 chunk_devid_filter(leaf
, chunk
, bargs
)) {
2496 /* drange filter, makes sense only with devid filter */
2497 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_DRANGE
) &&
2498 chunk_drange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2503 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_VRANGE
) &&
2504 chunk_vrange_filter(leaf
, chunk
, chunk_offset
, bargs
)) {
2508 /* soft profile changing mode */
2509 if ((bargs
->flags
& BTRFS_BALANCE_ARGS_SOFT
) &&
2510 chunk_soft_convert_filter(chunk_type
, bargs
)) {
2517 static u64
div_factor(u64 num
, int factor
)
2526 static int __btrfs_balance(struct btrfs_fs_info
*fs_info
)
2528 struct btrfs_balance_control
*bctl
= fs_info
->balance_ctl
;
2529 struct btrfs_root
*chunk_root
= fs_info
->chunk_root
;
2530 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
2531 struct list_head
*devices
;
2532 struct btrfs_device
*device
;
2535 struct btrfs_chunk
*chunk
;
2536 struct btrfs_path
*path
;
2537 struct btrfs_key key
;
2538 struct btrfs_key found_key
;
2539 struct btrfs_trans_handle
*trans
;
2540 struct extent_buffer
*leaf
;
2543 int enospc_errors
= 0;
2544 bool counting
= true;
2546 /* step one make some room on all the devices */
2547 devices
= &fs_info
->fs_devices
->devices
;
2548 list_for_each_entry(device
, devices
, dev_list
) {
2549 old_size
= device
->total_bytes
;
2550 size_to_free
= div_factor(old_size
, 1);
2551 size_to_free
= min(size_to_free
, (u64
)1 * 1024 * 1024);
2552 if (!device
->writeable
||
2553 device
->total_bytes
- device
->bytes_used
> size_to_free
)
2556 ret
= btrfs_shrink_device(device
, old_size
- size_to_free
);
2561 trans
= btrfs_start_transaction(dev_root
, 0);
2562 BUG_ON(IS_ERR(trans
));
2564 ret
= btrfs_grow_device(trans
, device
, old_size
);
2567 btrfs_end_transaction(trans
, dev_root
);
2570 /* step two, relocate all the chunks */
2571 path
= btrfs_alloc_path();
2577 /* zero out stat counters */
2578 spin_lock(&fs_info
->balance_lock
);
2579 memset(&bctl
->stat
, 0, sizeof(bctl
->stat
));
2580 spin_unlock(&fs_info
->balance_lock
);
2582 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
2583 key
.offset
= (u64
)-1;
2584 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
2587 if ((!counting
&& atomic_read(&fs_info
->balance_pause_req
)) ||
2588 atomic_read(&fs_info
->balance_cancel_req
)) {
2593 ret
= btrfs_search_slot(NULL
, chunk_root
, &key
, path
, 0, 0);
2598 * this shouldn't happen, it means the last relocate
2602 BUG(); /* FIXME break ? */
2604 ret
= btrfs_previous_item(chunk_root
, path
, 0,
2605 BTRFS_CHUNK_ITEM_KEY
);
2611 leaf
= path
->nodes
[0];
2612 slot
= path
->slots
[0];
2613 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
2615 if (found_key
.objectid
!= key
.objectid
)
2618 /* chunk zero is special */
2619 if (found_key
.offset
== 0)
2622 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
2625 spin_lock(&fs_info
->balance_lock
);
2626 bctl
->stat
.considered
++;
2627 spin_unlock(&fs_info
->balance_lock
);
2630 ret
= should_balance_chunk(chunk_root
, leaf
, chunk
,
2632 btrfs_release_path(path
);
2637 spin_lock(&fs_info
->balance_lock
);
2638 bctl
->stat
.expected
++;
2639 spin_unlock(&fs_info
->balance_lock
);
2643 ret
= btrfs_relocate_chunk(chunk_root
,
2644 chunk_root
->root_key
.objectid
,
2647 if (ret
&& ret
!= -ENOSPC
)
2649 if (ret
== -ENOSPC
) {
2652 spin_lock(&fs_info
->balance_lock
);
2653 bctl
->stat
.completed
++;
2654 spin_unlock(&fs_info
->balance_lock
);
2657 key
.offset
= found_key
.offset
- 1;
2661 btrfs_release_path(path
);
2666 btrfs_free_path(path
);
2667 if (enospc_errors
) {
2668 printk(KERN_INFO
"btrfs: %d enospc errors during balance\n",
2678 * alloc_profile_is_valid - see if a given profile is valid and reduced
2679 * @flags: profile to validate
2680 * @extended: if true @flags is treated as an extended profile
2682 static int alloc_profile_is_valid(u64 flags
, int extended
)
2684 u64 mask
= (extended
? BTRFS_EXTENDED_PROFILE_MASK
:
2685 BTRFS_BLOCK_GROUP_PROFILE_MASK
);
2687 flags
&= ~BTRFS_BLOCK_GROUP_TYPE_MASK
;
2689 /* 1) check that all other bits are zeroed */
2693 /* 2) see if profile is reduced */
2695 return !extended
; /* "0" is valid for usual profiles */
2697 /* true if exactly one bit set */
2698 return (flags
& (flags
- 1)) == 0;
2701 static inline int balance_need_close(struct btrfs_fs_info
*fs_info
)
2703 /* cancel requested || normal exit path */
2704 return atomic_read(&fs_info
->balance_cancel_req
) ||
2705 (atomic_read(&fs_info
->balance_pause_req
) == 0 &&
2706 atomic_read(&fs_info
->balance_cancel_req
) == 0);
2709 static void __cancel_balance(struct btrfs_fs_info
*fs_info
)
2713 unset_balance_control(fs_info
);
2714 ret
= del_balance_item(fs_info
->tree_root
);
2718 void update_ioctl_balance_args(struct btrfs_fs_info
*fs_info
, int lock
,
2719 struct btrfs_ioctl_balance_args
*bargs
);
2722 * Should be called with both balance and volume mutexes held
2724 int btrfs_balance(struct btrfs_balance_control
*bctl
,
2725 struct btrfs_ioctl_balance_args
*bargs
)
2727 struct btrfs_fs_info
*fs_info
= bctl
->fs_info
;
2732 if (btrfs_fs_closing(fs_info
) ||
2733 atomic_read(&fs_info
->balance_pause_req
) ||
2734 atomic_read(&fs_info
->balance_cancel_req
)) {
2739 allowed
= btrfs_super_incompat_flags(fs_info
->super_copy
);
2740 if (allowed
& BTRFS_FEATURE_INCOMPAT_MIXED_GROUPS
)
2744 * In case of mixed groups both data and meta should be picked,
2745 * and identical options should be given for both of them.
2747 allowed
= BTRFS_BALANCE_DATA
| BTRFS_BALANCE_METADATA
;
2748 if (mixed
&& (bctl
->flags
& allowed
)) {
2749 if (!(bctl
->flags
& BTRFS_BALANCE_DATA
) ||
2750 !(bctl
->flags
& BTRFS_BALANCE_METADATA
) ||
2751 memcmp(&bctl
->data
, &bctl
->meta
, sizeof(bctl
->data
))) {
2752 printk(KERN_ERR
"btrfs: with mixed groups data and "
2753 "metadata balance options must be the same\n");
2759 allowed
= BTRFS_AVAIL_ALLOC_BIT_SINGLE
;
2760 if (fs_info
->fs_devices
->num_devices
== 1)
2761 allowed
|= BTRFS_BLOCK_GROUP_DUP
;
2762 else if (fs_info
->fs_devices
->num_devices
< 4)
2763 allowed
|= (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID1
);
2765 allowed
|= (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID1
|
2766 BTRFS_BLOCK_GROUP_RAID10
);
2768 if ((bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2769 (!alloc_profile_is_valid(bctl
->data
.target
, 1) ||
2770 (bctl
->data
.target
& ~allowed
))) {
2771 printk(KERN_ERR
"btrfs: unable to start balance with target "
2772 "data profile %llu\n",
2773 (unsigned long long)bctl
->data
.target
);
2777 if ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2778 (!alloc_profile_is_valid(bctl
->meta
.target
, 1) ||
2779 (bctl
->meta
.target
& ~allowed
))) {
2780 printk(KERN_ERR
"btrfs: unable to start balance with target "
2781 "metadata profile %llu\n",
2782 (unsigned long long)bctl
->meta
.target
);
2786 if ((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2787 (!alloc_profile_is_valid(bctl
->sys
.target
, 1) ||
2788 (bctl
->sys
.target
& ~allowed
))) {
2789 printk(KERN_ERR
"btrfs: unable to start balance with target "
2790 "system profile %llu\n",
2791 (unsigned long long)bctl
->sys
.target
);
2796 /* allow dup'ed data chunks only in mixed mode */
2797 if (!mixed
&& (bctl
->data
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2798 (bctl
->data
.target
& BTRFS_BLOCK_GROUP_DUP
)) {
2799 printk(KERN_ERR
"btrfs: dup for data is not allowed\n");
2804 /* allow to reduce meta or sys integrity only if force set */
2805 allowed
= BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
|
2806 BTRFS_BLOCK_GROUP_RAID10
;
2807 if (((bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2808 (fs_info
->avail_system_alloc_bits
& allowed
) &&
2809 !(bctl
->sys
.target
& allowed
)) ||
2810 ((bctl
->meta
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) &&
2811 (fs_info
->avail_metadata_alloc_bits
& allowed
) &&
2812 !(bctl
->meta
.target
& allowed
))) {
2813 if (bctl
->flags
& BTRFS_BALANCE_FORCE
) {
2814 printk(KERN_INFO
"btrfs: force reducing metadata "
2817 printk(KERN_ERR
"btrfs: balance will reduce metadata "
2818 "integrity, use force if you want this\n");
2824 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
2825 int num_tolerated_disk_barrier_failures
;
2826 u64 target
= bctl
->sys
.target
;
2828 num_tolerated_disk_barrier_failures
=
2829 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
2830 if (num_tolerated_disk_barrier_failures
> 0 &&
2832 (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID0
|
2833 BTRFS_AVAIL_ALLOC_BIT_SINGLE
)))
2834 num_tolerated_disk_barrier_failures
= 0;
2835 else if (num_tolerated_disk_barrier_failures
> 1 &&
2837 (BTRFS_BLOCK_GROUP_RAID1
| BTRFS_BLOCK_GROUP_RAID10
)))
2838 num_tolerated_disk_barrier_failures
= 1;
2840 fs_info
->num_tolerated_disk_barrier_failures
=
2841 num_tolerated_disk_barrier_failures
;
2844 ret
= insert_balance_item(fs_info
->tree_root
, bctl
);
2845 if (ret
&& ret
!= -EEXIST
)
2848 if (!(bctl
->flags
& BTRFS_BALANCE_RESUME
)) {
2849 BUG_ON(ret
== -EEXIST
);
2850 set_balance_control(bctl
);
2852 BUG_ON(ret
!= -EEXIST
);
2853 spin_lock(&fs_info
->balance_lock
);
2854 update_balance_args(bctl
);
2855 spin_unlock(&fs_info
->balance_lock
);
2858 atomic_inc(&fs_info
->balance_running
);
2859 mutex_unlock(&fs_info
->balance_mutex
);
2861 ret
= __btrfs_balance(fs_info
);
2863 mutex_lock(&fs_info
->balance_mutex
);
2864 atomic_dec(&fs_info
->balance_running
);
2867 memset(bargs
, 0, sizeof(*bargs
));
2868 update_ioctl_balance_args(fs_info
, 0, bargs
);
2871 if ((ret
&& ret
!= -ECANCELED
&& ret
!= -ENOSPC
) ||
2872 balance_need_close(fs_info
)) {
2873 __cancel_balance(fs_info
);
2876 if (bctl
->sys
.flags
& BTRFS_BALANCE_ARGS_CONVERT
) {
2877 fs_info
->num_tolerated_disk_barrier_failures
=
2878 btrfs_calc_num_tolerated_disk_barrier_failures(fs_info
);
2881 wake_up(&fs_info
->balance_wait_q
);
2885 if (bctl
->flags
& BTRFS_BALANCE_RESUME
)
2886 __cancel_balance(fs_info
);
2892 static int balance_kthread(void *data
)
2894 struct btrfs_fs_info
*fs_info
= data
;
2897 mutex_lock(&fs_info
->volume_mutex
);
2898 mutex_lock(&fs_info
->balance_mutex
);
2900 if (fs_info
->balance_ctl
) {
2901 printk(KERN_INFO
"btrfs: continuing balance\n");
2902 ret
= btrfs_balance(fs_info
->balance_ctl
, NULL
);
2905 mutex_unlock(&fs_info
->balance_mutex
);
2906 mutex_unlock(&fs_info
->volume_mutex
);
2911 int btrfs_resume_balance_async(struct btrfs_fs_info
*fs_info
)
2913 struct task_struct
*tsk
;
2915 spin_lock(&fs_info
->balance_lock
);
2916 if (!fs_info
->balance_ctl
) {
2917 spin_unlock(&fs_info
->balance_lock
);
2920 spin_unlock(&fs_info
->balance_lock
);
2922 if (btrfs_test_opt(fs_info
->tree_root
, SKIP_BALANCE
)) {
2923 printk(KERN_INFO
"btrfs: force skipping balance\n");
2927 tsk
= kthread_run(balance_kthread
, fs_info
, "btrfs-balance");
2929 return PTR_ERR(tsk
);
2934 int btrfs_recover_balance(struct btrfs_fs_info
*fs_info
)
2936 struct btrfs_balance_control
*bctl
;
2937 struct btrfs_balance_item
*item
;
2938 struct btrfs_disk_balance_args disk_bargs
;
2939 struct btrfs_path
*path
;
2940 struct extent_buffer
*leaf
;
2941 struct btrfs_key key
;
2944 path
= btrfs_alloc_path();
2948 key
.objectid
= BTRFS_BALANCE_OBJECTID
;
2949 key
.type
= BTRFS_BALANCE_ITEM_KEY
;
2952 ret
= btrfs_search_slot(NULL
, fs_info
->tree_root
, &key
, path
, 0, 0);
2955 if (ret
> 0) { /* ret = -ENOENT; */
2960 bctl
= kzalloc(sizeof(*bctl
), GFP_NOFS
);
2966 leaf
= path
->nodes
[0];
2967 item
= btrfs_item_ptr(leaf
, path
->slots
[0], struct btrfs_balance_item
);
2969 bctl
->fs_info
= fs_info
;
2970 bctl
->flags
= btrfs_balance_flags(leaf
, item
);
2971 bctl
->flags
|= BTRFS_BALANCE_RESUME
;
2973 btrfs_balance_data(leaf
, item
, &disk_bargs
);
2974 btrfs_disk_balance_args_to_cpu(&bctl
->data
, &disk_bargs
);
2975 btrfs_balance_meta(leaf
, item
, &disk_bargs
);
2976 btrfs_disk_balance_args_to_cpu(&bctl
->meta
, &disk_bargs
);
2977 btrfs_balance_sys(leaf
, item
, &disk_bargs
);
2978 btrfs_disk_balance_args_to_cpu(&bctl
->sys
, &disk_bargs
);
2980 mutex_lock(&fs_info
->volume_mutex
);
2981 mutex_lock(&fs_info
->balance_mutex
);
2983 set_balance_control(bctl
);
2985 mutex_unlock(&fs_info
->balance_mutex
);
2986 mutex_unlock(&fs_info
->volume_mutex
);
2988 btrfs_free_path(path
);
2992 int btrfs_pause_balance(struct btrfs_fs_info
*fs_info
)
2996 mutex_lock(&fs_info
->balance_mutex
);
2997 if (!fs_info
->balance_ctl
) {
2998 mutex_unlock(&fs_info
->balance_mutex
);
3002 if (atomic_read(&fs_info
->balance_running
)) {
3003 atomic_inc(&fs_info
->balance_pause_req
);
3004 mutex_unlock(&fs_info
->balance_mutex
);
3006 wait_event(fs_info
->balance_wait_q
,
3007 atomic_read(&fs_info
->balance_running
) == 0);
3009 mutex_lock(&fs_info
->balance_mutex
);
3010 /* we are good with balance_ctl ripped off from under us */
3011 BUG_ON(atomic_read(&fs_info
->balance_running
));
3012 atomic_dec(&fs_info
->balance_pause_req
);
3017 mutex_unlock(&fs_info
->balance_mutex
);
3021 int btrfs_cancel_balance(struct btrfs_fs_info
*fs_info
)
3023 mutex_lock(&fs_info
->balance_mutex
);
3024 if (!fs_info
->balance_ctl
) {
3025 mutex_unlock(&fs_info
->balance_mutex
);
3029 atomic_inc(&fs_info
->balance_cancel_req
);
3031 * if we are running just wait and return, balance item is
3032 * deleted in btrfs_balance in this case
3034 if (atomic_read(&fs_info
->balance_running
)) {
3035 mutex_unlock(&fs_info
->balance_mutex
);
3036 wait_event(fs_info
->balance_wait_q
,
3037 atomic_read(&fs_info
->balance_running
) == 0);
3038 mutex_lock(&fs_info
->balance_mutex
);
3040 /* __cancel_balance needs volume_mutex */
3041 mutex_unlock(&fs_info
->balance_mutex
);
3042 mutex_lock(&fs_info
->volume_mutex
);
3043 mutex_lock(&fs_info
->balance_mutex
);
3045 if (fs_info
->balance_ctl
)
3046 __cancel_balance(fs_info
);
3048 mutex_unlock(&fs_info
->volume_mutex
);
3051 BUG_ON(fs_info
->balance_ctl
|| atomic_read(&fs_info
->balance_running
));
3052 atomic_dec(&fs_info
->balance_cancel_req
);
3053 mutex_unlock(&fs_info
->balance_mutex
);
3058 * shrinking a device means finding all of the device extents past
3059 * the new size, and then following the back refs to the chunks.
3060 * The chunk relocation code actually frees the device extent
3062 int btrfs_shrink_device(struct btrfs_device
*device
, u64 new_size
)
3064 struct btrfs_trans_handle
*trans
;
3065 struct btrfs_root
*root
= device
->dev_root
;
3066 struct btrfs_dev_extent
*dev_extent
= NULL
;
3067 struct btrfs_path
*path
;
3075 bool retried
= false;
3076 struct extent_buffer
*l
;
3077 struct btrfs_key key
;
3078 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3079 u64 old_total
= btrfs_super_total_bytes(super_copy
);
3080 u64 old_size
= device
->total_bytes
;
3081 u64 diff
= device
->total_bytes
- new_size
;
3083 if (new_size
>= device
->total_bytes
)
3086 path
= btrfs_alloc_path();
3094 device
->total_bytes
= new_size
;
3095 if (device
->writeable
) {
3096 device
->fs_devices
->total_rw_bytes
-= diff
;
3097 spin_lock(&root
->fs_info
->free_chunk_lock
);
3098 root
->fs_info
->free_chunk_space
-= diff
;
3099 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3101 unlock_chunks(root
);
3104 key
.objectid
= device
->devid
;
3105 key
.offset
= (u64
)-1;
3106 key
.type
= BTRFS_DEV_EXTENT_KEY
;
3109 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
3113 ret
= btrfs_previous_item(root
, path
, 0, key
.type
);
3118 btrfs_release_path(path
);
3123 slot
= path
->slots
[0];
3124 btrfs_item_key_to_cpu(l
, &key
, path
->slots
[0]);
3126 if (key
.objectid
!= device
->devid
) {
3127 btrfs_release_path(path
);
3131 dev_extent
= btrfs_item_ptr(l
, slot
, struct btrfs_dev_extent
);
3132 length
= btrfs_dev_extent_length(l
, dev_extent
);
3134 if (key
.offset
+ length
<= new_size
) {
3135 btrfs_release_path(path
);
3139 chunk_tree
= btrfs_dev_extent_chunk_tree(l
, dev_extent
);
3140 chunk_objectid
= btrfs_dev_extent_chunk_objectid(l
, dev_extent
);
3141 chunk_offset
= btrfs_dev_extent_chunk_offset(l
, dev_extent
);
3142 btrfs_release_path(path
);
3144 ret
= btrfs_relocate_chunk(root
, chunk_tree
, chunk_objectid
,
3146 if (ret
&& ret
!= -ENOSPC
)
3150 } while (key
.offset
-- > 0);
3152 if (failed
&& !retried
) {
3156 } else if (failed
&& retried
) {
3160 device
->total_bytes
= old_size
;
3161 if (device
->writeable
)
3162 device
->fs_devices
->total_rw_bytes
+= diff
;
3163 spin_lock(&root
->fs_info
->free_chunk_lock
);
3164 root
->fs_info
->free_chunk_space
+= diff
;
3165 spin_unlock(&root
->fs_info
->free_chunk_lock
);
3166 unlock_chunks(root
);
3170 /* Shrinking succeeded, else we would be at "done". */
3171 trans
= btrfs_start_transaction(root
, 0);
3172 if (IS_ERR(trans
)) {
3173 ret
= PTR_ERR(trans
);
3179 device
->disk_total_bytes
= new_size
;
3180 /* Now btrfs_update_device() will change the on-disk size. */
3181 ret
= btrfs_update_device(trans
, device
);
3183 unlock_chunks(root
);
3184 btrfs_end_transaction(trans
, root
);
3187 WARN_ON(diff
> old_total
);
3188 btrfs_set_super_total_bytes(super_copy
, old_total
- diff
);
3189 unlock_chunks(root
);
3190 btrfs_end_transaction(trans
, root
);
3192 btrfs_free_path(path
);
3196 static int btrfs_add_system_chunk(struct btrfs_root
*root
,
3197 struct btrfs_key
*key
,
3198 struct btrfs_chunk
*chunk
, int item_size
)
3200 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
3201 struct btrfs_disk_key disk_key
;
3205 array_size
= btrfs_super_sys_array_size(super_copy
);
3206 if (array_size
+ item_size
> BTRFS_SYSTEM_CHUNK_ARRAY_SIZE
)
3209 ptr
= super_copy
->sys_chunk_array
+ array_size
;
3210 btrfs_cpu_key_to_disk(&disk_key
, key
);
3211 memcpy(ptr
, &disk_key
, sizeof(disk_key
));
3212 ptr
+= sizeof(disk_key
);
3213 memcpy(ptr
, chunk
, item_size
);
3214 item_size
+= sizeof(disk_key
);
3215 btrfs_set_super_sys_array_size(super_copy
, array_size
+ item_size
);
3220 * sort the devices in descending order by max_avail, total_avail
3222 static int btrfs_cmp_device_info(const void *a
, const void *b
)
3224 const struct btrfs_device_info
*di_a
= a
;
3225 const struct btrfs_device_info
*di_b
= b
;
3227 if (di_a
->max_avail
> di_b
->max_avail
)
3229 if (di_a
->max_avail
< di_b
->max_avail
)
3231 if (di_a
->total_avail
> di_b
->total_avail
)
3233 if (di_a
->total_avail
< di_b
->total_avail
)
3238 static int __btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
3239 struct btrfs_root
*extent_root
,
3240 struct map_lookup
**map_ret
,
3241 u64
*num_bytes_out
, u64
*stripe_size_out
,
3242 u64 start
, u64 type
)
3244 struct btrfs_fs_info
*info
= extent_root
->fs_info
;
3245 struct btrfs_fs_devices
*fs_devices
= info
->fs_devices
;
3246 struct list_head
*cur
;
3247 struct map_lookup
*map
= NULL
;
3248 struct extent_map_tree
*em_tree
;
3249 struct extent_map
*em
;
3250 struct btrfs_device_info
*devices_info
= NULL
;
3252 int num_stripes
; /* total number of stripes to allocate */
3253 int sub_stripes
; /* sub_stripes info for map */
3254 int dev_stripes
; /* stripes per dev */
3255 int devs_max
; /* max devs to use */
3256 int devs_min
; /* min devs needed */
3257 int devs_increment
; /* ndevs has to be a multiple of this */
3258 int ncopies
; /* how many copies to data has */
3260 u64 max_stripe_size
;
3268 BUG_ON(!alloc_profile_is_valid(type
, 0));
3270 if (list_empty(&fs_devices
->alloc_list
))
3277 devs_max
= 0; /* 0 == as many as possible */
3281 * define the properties of each RAID type.
3282 * FIXME: move this to a global table and use it in all RAID
3285 if (type
& (BTRFS_BLOCK_GROUP_DUP
)) {
3289 } else if (type
& (BTRFS_BLOCK_GROUP_RAID0
)) {
3291 } else if (type
& (BTRFS_BLOCK_GROUP_RAID1
)) {
3296 } else if (type
& (BTRFS_BLOCK_GROUP_RAID10
)) {
3305 if (type
& BTRFS_BLOCK_GROUP_DATA
) {
3306 max_stripe_size
= 1024 * 1024 * 1024;
3307 max_chunk_size
= 10 * max_stripe_size
;
3308 } else if (type
& BTRFS_BLOCK_GROUP_METADATA
) {
3309 /* for larger filesystems, use larger metadata chunks */
3310 if (fs_devices
->total_rw_bytes
> 50ULL * 1024 * 1024 * 1024)
3311 max_stripe_size
= 1024 * 1024 * 1024;
3313 max_stripe_size
= 256 * 1024 * 1024;
3314 max_chunk_size
= max_stripe_size
;
3315 } else if (type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
3316 max_stripe_size
= 32 * 1024 * 1024;
3317 max_chunk_size
= 2 * max_stripe_size
;
3319 printk(KERN_ERR
"btrfs: invalid chunk type 0x%llx requested\n",
3324 /* we don't want a chunk larger than 10% of writeable space */
3325 max_chunk_size
= min(div_factor(fs_devices
->total_rw_bytes
, 1),
3328 devices_info
= kzalloc(sizeof(*devices_info
) * fs_devices
->rw_devices
,
3333 cur
= fs_devices
->alloc_list
.next
;
3336 * in the first pass through the devices list, we gather information
3337 * about the available holes on each device.
3340 while (cur
!= &fs_devices
->alloc_list
) {
3341 struct btrfs_device
*device
;
3345 device
= list_entry(cur
, struct btrfs_device
, dev_alloc_list
);
3349 if (!device
->writeable
) {
3351 "btrfs: read-only device in alloc_list\n");
3356 if (!device
->in_fs_metadata
)
3359 if (device
->total_bytes
> device
->bytes_used
)
3360 total_avail
= device
->total_bytes
- device
->bytes_used
;
3364 /* If there is no space on this device, skip it. */
3365 if (total_avail
== 0)
3368 ret
= find_free_dev_extent(device
,
3369 max_stripe_size
* dev_stripes
,
3370 &dev_offset
, &max_avail
);
3371 if (ret
&& ret
!= -ENOSPC
)
3375 max_avail
= max_stripe_size
* dev_stripes
;
3377 if (max_avail
< BTRFS_STRIPE_LEN
* dev_stripes
)
3380 devices_info
[ndevs
].dev_offset
= dev_offset
;
3381 devices_info
[ndevs
].max_avail
= max_avail
;
3382 devices_info
[ndevs
].total_avail
= total_avail
;
3383 devices_info
[ndevs
].dev
= device
;
3388 * now sort the devices by hole size / available space
3390 sort(devices_info
, ndevs
, sizeof(struct btrfs_device_info
),
3391 btrfs_cmp_device_info
, NULL
);
3393 /* round down to number of usable stripes */
3394 ndevs
-= ndevs
% devs_increment
;
3396 if (ndevs
< devs_increment
* sub_stripes
|| ndevs
< devs_min
) {
3401 if (devs_max
&& ndevs
> devs_max
)
3404 * the primary goal is to maximize the number of stripes, so use as many
3405 * devices as possible, even if the stripes are not maximum sized.
3407 stripe_size
= devices_info
[ndevs
-1].max_avail
;
3408 num_stripes
= ndevs
* dev_stripes
;
3410 if (stripe_size
* ndevs
> max_chunk_size
* ncopies
) {
3411 stripe_size
= max_chunk_size
* ncopies
;
3412 do_div(stripe_size
, ndevs
);
3415 do_div(stripe_size
, dev_stripes
);
3417 /* align to BTRFS_STRIPE_LEN */
3418 do_div(stripe_size
, BTRFS_STRIPE_LEN
);
3419 stripe_size
*= BTRFS_STRIPE_LEN
;
3421 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
3426 map
->num_stripes
= num_stripes
;
3428 for (i
= 0; i
< ndevs
; ++i
) {
3429 for (j
= 0; j
< dev_stripes
; ++j
) {
3430 int s
= i
* dev_stripes
+ j
;
3431 map
->stripes
[s
].dev
= devices_info
[i
].dev
;
3432 map
->stripes
[s
].physical
= devices_info
[i
].dev_offset
+
3436 map
->sector_size
= extent_root
->sectorsize
;
3437 map
->stripe_len
= BTRFS_STRIPE_LEN
;
3438 map
->io_align
= BTRFS_STRIPE_LEN
;
3439 map
->io_width
= BTRFS_STRIPE_LEN
;
3441 map
->sub_stripes
= sub_stripes
;
3444 num_bytes
= stripe_size
* (num_stripes
/ ncopies
);
3446 *stripe_size_out
= stripe_size
;
3447 *num_bytes_out
= num_bytes
;
3449 trace_btrfs_chunk_alloc(info
->chunk_root
, map
, start
, num_bytes
);
3451 em
= alloc_extent_map();
3456 em
->bdev
= (struct block_device
*)map
;
3458 em
->len
= num_bytes
;
3459 em
->block_start
= 0;
3460 em
->block_len
= em
->len
;
3462 em_tree
= &extent_root
->fs_info
->mapping_tree
.map_tree
;
3463 write_lock(&em_tree
->lock
);
3464 ret
= add_extent_mapping(em_tree
, em
);
3465 write_unlock(&em_tree
->lock
);
3466 free_extent_map(em
);
3470 ret
= btrfs_make_block_group(trans
, extent_root
, 0, type
,
3471 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3476 for (i
= 0; i
< map
->num_stripes
; ++i
) {
3477 struct btrfs_device
*device
;
3480 device
= map
->stripes
[i
].dev
;
3481 dev_offset
= map
->stripes
[i
].physical
;
3483 ret
= btrfs_alloc_dev_extent(trans
, device
,
3484 info
->chunk_root
->root_key
.objectid
,
3485 BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3486 start
, dev_offset
, stripe_size
);
3488 btrfs_abort_transaction(trans
, extent_root
, ret
);
3493 kfree(devices_info
);
3498 kfree(devices_info
);
3502 static int __finish_chunk_alloc(struct btrfs_trans_handle
*trans
,
3503 struct btrfs_root
*extent_root
,
3504 struct map_lookup
*map
, u64 chunk_offset
,
3505 u64 chunk_size
, u64 stripe_size
)
3508 struct btrfs_key key
;
3509 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
3510 struct btrfs_device
*device
;
3511 struct btrfs_chunk
*chunk
;
3512 struct btrfs_stripe
*stripe
;
3513 size_t item_size
= btrfs_chunk_item_size(map
->num_stripes
);
3517 chunk
= kzalloc(item_size
, GFP_NOFS
);
3522 while (index
< map
->num_stripes
) {
3523 device
= map
->stripes
[index
].dev
;
3524 device
->bytes_used
+= stripe_size
;
3525 ret
= btrfs_update_device(trans
, device
);
3531 spin_lock(&extent_root
->fs_info
->free_chunk_lock
);
3532 extent_root
->fs_info
->free_chunk_space
-= (stripe_size
*
3534 spin_unlock(&extent_root
->fs_info
->free_chunk_lock
);
3537 stripe
= &chunk
->stripe
;
3538 while (index
< map
->num_stripes
) {
3539 device
= map
->stripes
[index
].dev
;
3540 dev_offset
= map
->stripes
[index
].physical
;
3542 btrfs_set_stack_stripe_devid(stripe
, device
->devid
);
3543 btrfs_set_stack_stripe_offset(stripe
, dev_offset
);
3544 memcpy(stripe
->dev_uuid
, device
->uuid
, BTRFS_UUID_SIZE
);
3549 btrfs_set_stack_chunk_length(chunk
, chunk_size
);
3550 btrfs_set_stack_chunk_owner(chunk
, extent_root
->root_key
.objectid
);
3551 btrfs_set_stack_chunk_stripe_len(chunk
, map
->stripe_len
);
3552 btrfs_set_stack_chunk_type(chunk
, map
->type
);
3553 btrfs_set_stack_chunk_num_stripes(chunk
, map
->num_stripes
);
3554 btrfs_set_stack_chunk_io_align(chunk
, map
->stripe_len
);
3555 btrfs_set_stack_chunk_io_width(chunk
, map
->stripe_len
);
3556 btrfs_set_stack_chunk_sector_size(chunk
, extent_root
->sectorsize
);
3557 btrfs_set_stack_chunk_sub_stripes(chunk
, map
->sub_stripes
);
3559 key
.objectid
= BTRFS_FIRST_CHUNK_TREE_OBJECTID
;
3560 key
.type
= BTRFS_CHUNK_ITEM_KEY
;
3561 key
.offset
= chunk_offset
;
3563 ret
= btrfs_insert_item(trans
, chunk_root
, &key
, chunk
, item_size
);
3565 if (ret
== 0 && map
->type
& BTRFS_BLOCK_GROUP_SYSTEM
) {
3567 * TODO: Cleanup of inserted chunk root in case of
3570 ret
= btrfs_add_system_chunk(chunk_root
, &key
, chunk
,
3580 * Chunk allocation falls into two parts. The first part does works
3581 * that make the new allocated chunk useable, but not do any operation
3582 * that modifies the chunk tree. The second part does the works that
3583 * require modifying the chunk tree. This division is important for the
3584 * bootstrap process of adding storage to a seed btrfs.
3586 int btrfs_alloc_chunk(struct btrfs_trans_handle
*trans
,
3587 struct btrfs_root
*extent_root
, u64 type
)
3592 struct map_lookup
*map
;
3593 struct btrfs_root
*chunk_root
= extent_root
->fs_info
->chunk_root
;
3596 ret
= find_next_chunk(chunk_root
, BTRFS_FIRST_CHUNK_TREE_OBJECTID
,
3601 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &map
, &chunk_size
,
3602 &stripe_size
, chunk_offset
, type
);
3606 ret
= __finish_chunk_alloc(trans
, extent_root
, map
, chunk_offset
,
3607 chunk_size
, stripe_size
);
3613 static noinline
int init_first_rw_device(struct btrfs_trans_handle
*trans
,
3614 struct btrfs_root
*root
,
3615 struct btrfs_device
*device
)
3618 u64 sys_chunk_offset
;
3622 u64 sys_stripe_size
;
3624 struct map_lookup
*map
;
3625 struct map_lookup
*sys_map
;
3626 struct btrfs_fs_info
*fs_info
= root
->fs_info
;
3627 struct btrfs_root
*extent_root
= fs_info
->extent_root
;
3630 ret
= find_next_chunk(fs_info
->chunk_root
,
3631 BTRFS_FIRST_CHUNK_TREE_OBJECTID
, &chunk_offset
);
3635 alloc_profile
= BTRFS_BLOCK_GROUP_METADATA
|
3636 fs_info
->avail_metadata_alloc_bits
;
3637 alloc_profile
= btrfs_reduce_alloc_profile(root
, alloc_profile
);
3639 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &map
, &chunk_size
,
3640 &stripe_size
, chunk_offset
, alloc_profile
);
3644 sys_chunk_offset
= chunk_offset
+ chunk_size
;
3646 alloc_profile
= BTRFS_BLOCK_GROUP_SYSTEM
|
3647 fs_info
->avail_system_alloc_bits
;
3648 alloc_profile
= btrfs_reduce_alloc_profile(root
, alloc_profile
);
3650 ret
= __btrfs_alloc_chunk(trans
, extent_root
, &sys_map
,
3651 &sys_chunk_size
, &sys_stripe_size
,
3652 sys_chunk_offset
, alloc_profile
);
3654 btrfs_abort_transaction(trans
, root
, ret
);
3658 ret
= btrfs_add_device(trans
, fs_info
->chunk_root
, device
);
3660 btrfs_abort_transaction(trans
, root
, ret
);
3665 * Modifying chunk tree needs allocating new blocks from both
3666 * system block group and metadata block group. So we only can
3667 * do operations require modifying the chunk tree after both
3668 * block groups were created.
3670 ret
= __finish_chunk_alloc(trans
, extent_root
, map
, chunk_offset
,
3671 chunk_size
, stripe_size
);
3673 btrfs_abort_transaction(trans
, root
, ret
);
3677 ret
= __finish_chunk_alloc(trans
, extent_root
, sys_map
,
3678 sys_chunk_offset
, sys_chunk_size
,
3681 btrfs_abort_transaction(trans
, root
, ret
);
3688 int btrfs_chunk_readonly(struct btrfs_root
*root
, u64 chunk_offset
)
3690 struct extent_map
*em
;
3691 struct map_lookup
*map
;
3692 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
3696 read_lock(&map_tree
->map_tree
.lock
);
3697 em
= lookup_extent_mapping(&map_tree
->map_tree
, chunk_offset
, 1);
3698 read_unlock(&map_tree
->map_tree
.lock
);
3702 if (btrfs_test_opt(root
, DEGRADED
)) {
3703 free_extent_map(em
);
3707 map
= (struct map_lookup
*)em
->bdev
;
3708 for (i
= 0; i
< map
->num_stripes
; i
++) {
3709 if (!map
->stripes
[i
].dev
->writeable
) {
3714 free_extent_map(em
);
3718 void btrfs_mapping_init(struct btrfs_mapping_tree
*tree
)
3720 extent_map_tree_init(&tree
->map_tree
);
3723 void btrfs_mapping_tree_free(struct btrfs_mapping_tree
*tree
)
3725 struct extent_map
*em
;
3728 write_lock(&tree
->map_tree
.lock
);
3729 em
= lookup_extent_mapping(&tree
->map_tree
, 0, (u64
)-1);
3731 remove_extent_mapping(&tree
->map_tree
, em
);
3732 write_unlock(&tree
->map_tree
.lock
);
3737 free_extent_map(em
);
3738 /* once for the tree */
3739 free_extent_map(em
);
3743 int btrfs_num_copies(struct btrfs_mapping_tree
*map_tree
, u64 logical
, u64 len
)
3745 struct extent_map
*em
;
3746 struct map_lookup
*map
;
3747 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
3750 read_lock(&em_tree
->lock
);
3751 em
= lookup_extent_mapping(em_tree
, logical
, len
);
3752 read_unlock(&em_tree
->lock
);
3755 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
3756 map
= (struct map_lookup
*)em
->bdev
;
3757 if (map
->type
& (BTRFS_BLOCK_GROUP_DUP
| BTRFS_BLOCK_GROUP_RAID1
))
3758 ret
= map
->num_stripes
;
3759 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
3760 ret
= map
->sub_stripes
;
3763 free_extent_map(em
);
3767 static int find_live_mirror(struct map_lookup
*map
, int first
, int num
,
3771 if (map
->stripes
[optimal
].dev
->bdev
)
3773 for (i
= first
; i
< first
+ num
; i
++) {
3774 if (map
->stripes
[i
].dev
->bdev
)
3777 /* we couldn't find one that doesn't fail. Just return something
3778 * and the io error handling code will clean up eventually
3783 static int __btrfs_map_block(struct btrfs_mapping_tree
*map_tree
, int rw
,
3784 u64 logical
, u64
*length
,
3785 struct btrfs_bio
**bbio_ret
,
3788 struct extent_map
*em
;
3789 struct map_lookup
*map
;
3790 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
3793 u64 stripe_end_offset
;
3802 struct btrfs_bio
*bbio
= NULL
;
3804 read_lock(&em_tree
->lock
);
3805 em
= lookup_extent_mapping(em_tree
, logical
, *length
);
3806 read_unlock(&em_tree
->lock
);
3809 printk(KERN_CRIT
"btrfs: unable to find logical %llu len %llu\n",
3810 (unsigned long long)logical
,
3811 (unsigned long long)*length
);
3815 BUG_ON(em
->start
> logical
|| em
->start
+ em
->len
< logical
);
3816 map
= (struct map_lookup
*)em
->bdev
;
3817 offset
= logical
- em
->start
;
3819 if (mirror_num
> map
->num_stripes
)
3824 * stripe_nr counts the total number of stripes we have to stride
3825 * to get to this block
3827 do_div(stripe_nr
, map
->stripe_len
);
3829 stripe_offset
= stripe_nr
* map
->stripe_len
;
3830 BUG_ON(offset
< stripe_offset
);
3832 /* stripe_offset is the offset of this block in its stripe*/
3833 stripe_offset
= offset
- stripe_offset
;
3835 if (rw
& REQ_DISCARD
)
3836 *length
= min_t(u64
, em
->len
- offset
, *length
);
3837 else if (map
->type
& BTRFS_BLOCK_GROUP_PROFILE_MASK
) {
3838 /* we limit the length of each bio to what fits in a stripe */
3839 *length
= min_t(u64
, em
->len
- offset
,
3840 map
->stripe_len
- stripe_offset
);
3842 *length
= em
->len
- offset
;
3850 stripe_nr_orig
= stripe_nr
;
3851 stripe_nr_end
= (offset
+ *length
+ map
->stripe_len
- 1) &
3852 (~(map
->stripe_len
- 1));
3853 do_div(stripe_nr_end
, map
->stripe_len
);
3854 stripe_end_offset
= stripe_nr_end
* map
->stripe_len
-
3856 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
3857 if (rw
& REQ_DISCARD
)
3858 num_stripes
= min_t(u64
, map
->num_stripes
,
3859 stripe_nr_end
- stripe_nr_orig
);
3860 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
3861 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID1
) {
3862 if (rw
& (REQ_WRITE
| REQ_DISCARD
))
3863 num_stripes
= map
->num_stripes
;
3864 else if (mirror_num
)
3865 stripe_index
= mirror_num
- 1;
3867 stripe_index
= find_live_mirror(map
, 0,
3869 current
->pid
% map
->num_stripes
);
3870 mirror_num
= stripe_index
+ 1;
3873 } else if (map
->type
& BTRFS_BLOCK_GROUP_DUP
) {
3874 if (rw
& (REQ_WRITE
| REQ_DISCARD
)) {
3875 num_stripes
= map
->num_stripes
;
3876 } else if (mirror_num
) {
3877 stripe_index
= mirror_num
- 1;
3882 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
3883 int factor
= map
->num_stripes
/ map
->sub_stripes
;
3885 stripe_index
= do_div(stripe_nr
, factor
);
3886 stripe_index
*= map
->sub_stripes
;
3889 num_stripes
= map
->sub_stripes
;
3890 else if (rw
& REQ_DISCARD
)
3891 num_stripes
= min_t(u64
, map
->sub_stripes
*
3892 (stripe_nr_end
- stripe_nr_orig
),
3894 else if (mirror_num
)
3895 stripe_index
+= mirror_num
- 1;
3897 int old_stripe_index
= stripe_index
;
3898 stripe_index
= find_live_mirror(map
, stripe_index
,
3899 map
->sub_stripes
, stripe_index
+
3900 current
->pid
% map
->sub_stripes
);
3901 mirror_num
= stripe_index
- old_stripe_index
+ 1;
3905 * after this do_div call, stripe_nr is the number of stripes
3906 * on this device we have to walk to find the data, and
3907 * stripe_index is the number of our device in the stripe array
3909 stripe_index
= do_div(stripe_nr
, map
->num_stripes
);
3910 mirror_num
= stripe_index
+ 1;
3912 BUG_ON(stripe_index
>= map
->num_stripes
);
3914 bbio
= kzalloc(btrfs_bio_size(num_stripes
), GFP_NOFS
);
3919 atomic_set(&bbio
->error
, 0);
3921 if (rw
& REQ_DISCARD
) {
3923 int sub_stripes
= 0;
3924 u64 stripes_per_dev
= 0;
3925 u32 remaining_stripes
= 0;
3926 u32 last_stripe
= 0;
3929 (BTRFS_BLOCK_GROUP_RAID0
| BTRFS_BLOCK_GROUP_RAID10
)) {
3930 if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
3933 sub_stripes
= map
->sub_stripes
;
3935 factor
= map
->num_stripes
/ sub_stripes
;
3936 stripes_per_dev
= div_u64_rem(stripe_nr_end
-
3939 &remaining_stripes
);
3940 div_u64_rem(stripe_nr_end
- 1, factor
, &last_stripe
);
3941 last_stripe
*= sub_stripes
;
3944 for (i
= 0; i
< num_stripes
; i
++) {
3945 bbio
->stripes
[i
].physical
=
3946 map
->stripes
[stripe_index
].physical
+
3947 stripe_offset
+ stripe_nr
* map
->stripe_len
;
3948 bbio
->stripes
[i
].dev
= map
->stripes
[stripe_index
].dev
;
3950 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID0
|
3951 BTRFS_BLOCK_GROUP_RAID10
)) {
3952 bbio
->stripes
[i
].length
= stripes_per_dev
*
3955 if (i
/ sub_stripes
< remaining_stripes
)
3956 bbio
->stripes
[i
].length
+=
3960 * Special for the first stripe and
3963 * |-------|...|-------|
3967 if (i
< sub_stripes
)
3968 bbio
->stripes
[i
].length
-=
3971 if (stripe_index
>= last_stripe
&&
3972 stripe_index
<= (last_stripe
+
3974 bbio
->stripes
[i
].length
-=
3977 if (i
== sub_stripes
- 1)
3980 bbio
->stripes
[i
].length
= *length
;
3983 if (stripe_index
== map
->num_stripes
) {
3984 /* This could only happen for RAID0/10 */
3990 for (i
= 0; i
< num_stripes
; i
++) {
3991 bbio
->stripes
[i
].physical
=
3992 map
->stripes
[stripe_index
].physical
+
3994 stripe_nr
* map
->stripe_len
;
3995 bbio
->stripes
[i
].dev
=
3996 map
->stripes
[stripe_index
].dev
;
4001 if (rw
& REQ_WRITE
) {
4002 if (map
->type
& (BTRFS_BLOCK_GROUP_RAID1
|
4003 BTRFS_BLOCK_GROUP_RAID10
|
4004 BTRFS_BLOCK_GROUP_DUP
)) {
4010 bbio
->num_stripes
= num_stripes
;
4011 bbio
->max_errors
= max_errors
;
4012 bbio
->mirror_num
= mirror_num
;
4014 free_extent_map(em
);
4018 int btrfs_map_block(struct btrfs_mapping_tree
*map_tree
, int rw
,
4019 u64 logical
, u64
*length
,
4020 struct btrfs_bio
**bbio_ret
, int mirror_num
)
4022 return __btrfs_map_block(map_tree
, rw
, logical
, length
, bbio_ret
,
4026 int btrfs_rmap_block(struct btrfs_mapping_tree
*map_tree
,
4027 u64 chunk_start
, u64 physical
, u64 devid
,
4028 u64
**logical
, int *naddrs
, int *stripe_len
)
4030 struct extent_map_tree
*em_tree
= &map_tree
->map_tree
;
4031 struct extent_map
*em
;
4032 struct map_lookup
*map
;
4039 read_lock(&em_tree
->lock
);
4040 em
= lookup_extent_mapping(em_tree
, chunk_start
, 1);
4041 read_unlock(&em_tree
->lock
);
4043 BUG_ON(!em
|| em
->start
!= chunk_start
);
4044 map
= (struct map_lookup
*)em
->bdev
;
4047 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
)
4048 do_div(length
, map
->num_stripes
/ map
->sub_stripes
);
4049 else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
)
4050 do_div(length
, map
->num_stripes
);
4052 buf
= kzalloc(sizeof(u64
) * map
->num_stripes
, GFP_NOFS
);
4053 BUG_ON(!buf
); /* -ENOMEM */
4055 for (i
= 0; i
< map
->num_stripes
; i
++) {
4056 if (devid
&& map
->stripes
[i
].dev
->devid
!= devid
)
4058 if (map
->stripes
[i
].physical
> physical
||
4059 map
->stripes
[i
].physical
+ length
<= physical
)
4062 stripe_nr
= physical
- map
->stripes
[i
].physical
;
4063 do_div(stripe_nr
, map
->stripe_len
);
4065 if (map
->type
& BTRFS_BLOCK_GROUP_RAID10
) {
4066 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
4067 do_div(stripe_nr
, map
->sub_stripes
);
4068 } else if (map
->type
& BTRFS_BLOCK_GROUP_RAID0
) {
4069 stripe_nr
= stripe_nr
* map
->num_stripes
+ i
;
4071 bytenr
= chunk_start
+ stripe_nr
* map
->stripe_len
;
4072 WARN_ON(nr
>= map
->num_stripes
);
4073 for (j
= 0; j
< nr
; j
++) {
4074 if (buf
[j
] == bytenr
)
4078 WARN_ON(nr
>= map
->num_stripes
);
4085 *stripe_len
= map
->stripe_len
;
4087 free_extent_map(em
);
4091 static void *merge_stripe_index_into_bio_private(void *bi_private
,
4092 unsigned int stripe_index
)
4095 * with single, dup, RAID0, RAID1 and RAID10, stripe_index is
4097 * The alternative solution (instead of stealing bits from the
4098 * pointer) would be to allocate an intermediate structure
4099 * that contains the old private pointer plus the stripe_index.
4101 BUG_ON((((uintptr_t)bi_private
) & 3) != 0);
4102 BUG_ON(stripe_index
> 3);
4103 return (void *)(((uintptr_t)bi_private
) | stripe_index
);
4106 static struct btrfs_bio
*extract_bbio_from_bio_private(void *bi_private
)
4108 return (struct btrfs_bio
*)(((uintptr_t)bi_private
) & ~((uintptr_t)3));
4111 static unsigned int extract_stripe_index_from_bio_private(void *bi_private
)
4113 return (unsigned int)((uintptr_t)bi_private
) & 3;
4116 static void btrfs_end_bio(struct bio
*bio
, int err
)
4118 struct btrfs_bio
*bbio
= extract_bbio_from_bio_private(bio
->bi_private
);
4119 int is_orig_bio
= 0;
4122 atomic_inc(&bbio
->error
);
4123 if (err
== -EIO
|| err
== -EREMOTEIO
) {
4124 unsigned int stripe_index
=
4125 extract_stripe_index_from_bio_private(
4127 struct btrfs_device
*dev
;
4129 BUG_ON(stripe_index
>= bbio
->num_stripes
);
4130 dev
= bbio
->stripes
[stripe_index
].dev
;
4132 if (bio
->bi_rw
& WRITE
)
4133 btrfs_dev_stat_inc(dev
,
4134 BTRFS_DEV_STAT_WRITE_ERRS
);
4136 btrfs_dev_stat_inc(dev
,
4137 BTRFS_DEV_STAT_READ_ERRS
);
4138 if ((bio
->bi_rw
& WRITE_FLUSH
) == WRITE_FLUSH
)
4139 btrfs_dev_stat_inc(dev
,
4140 BTRFS_DEV_STAT_FLUSH_ERRS
);
4141 btrfs_dev_stat_print_on_error(dev
);
4146 if (bio
== bbio
->orig_bio
)
4149 if (atomic_dec_and_test(&bbio
->stripes_pending
)) {
4152 bio
= bbio
->orig_bio
;
4154 bio
->bi_private
= bbio
->private;
4155 bio
->bi_end_io
= bbio
->end_io
;
4156 bio
->bi_bdev
= (struct block_device
*)
4157 (unsigned long)bbio
->mirror_num
;
4158 /* only send an error to the higher layers if it is
4159 * beyond the tolerance of the multi-bio
4161 if (atomic_read(&bbio
->error
) > bbio
->max_errors
) {
4165 * this bio is actually up to date, we didn't
4166 * go over the max number of errors
4168 set_bit(BIO_UPTODATE
, &bio
->bi_flags
);
4173 bio_endio(bio
, err
);
4174 } else if (!is_orig_bio
) {
4179 struct async_sched
{
4182 struct btrfs_fs_info
*info
;
4183 struct btrfs_work work
;
4187 * see run_scheduled_bios for a description of why bios are collected for
4190 * This will add one bio to the pending list for a device and make sure
4191 * the work struct is scheduled.
4193 static noinline
void schedule_bio(struct btrfs_root
*root
,
4194 struct btrfs_device
*device
,
4195 int rw
, struct bio
*bio
)
4197 int should_queue
= 1;
4198 struct btrfs_pending_bios
*pending_bios
;
4200 /* don't bother with additional async steps for reads, right now */
4201 if (!(rw
& REQ_WRITE
)) {
4203 btrfsic_submit_bio(rw
, bio
);
4209 * nr_async_bios allows us to reliably return congestion to the
4210 * higher layers. Otherwise, the async bio makes it appear we have
4211 * made progress against dirty pages when we've really just put it
4212 * on a queue for later
4214 atomic_inc(&root
->fs_info
->nr_async_bios
);
4215 WARN_ON(bio
->bi_next
);
4216 bio
->bi_next
= NULL
;
4219 spin_lock(&device
->io_lock
);
4220 if (bio
->bi_rw
& REQ_SYNC
)
4221 pending_bios
= &device
->pending_sync_bios
;
4223 pending_bios
= &device
->pending_bios
;
4225 if (pending_bios
->tail
)
4226 pending_bios
->tail
->bi_next
= bio
;
4228 pending_bios
->tail
= bio
;
4229 if (!pending_bios
->head
)
4230 pending_bios
->head
= bio
;
4231 if (device
->running_pending
)
4234 spin_unlock(&device
->io_lock
);
4237 btrfs_queue_worker(&root
->fs_info
->submit_workers
,
4241 int btrfs_map_bio(struct btrfs_root
*root
, int rw
, struct bio
*bio
,
4242 int mirror_num
, int async_submit
)
4244 struct btrfs_mapping_tree
*map_tree
;
4245 struct btrfs_device
*dev
;
4246 struct bio
*first_bio
= bio
;
4247 u64 logical
= (u64
)bio
->bi_sector
<< 9;
4253 struct btrfs_bio
*bbio
= NULL
;
4255 length
= bio
->bi_size
;
4256 map_tree
= &root
->fs_info
->mapping_tree
;
4257 map_length
= length
;
4259 ret
= btrfs_map_block(map_tree
, rw
, logical
, &map_length
, &bbio
,
4261 if (ret
) /* -ENOMEM */
4264 total_devs
= bbio
->num_stripes
;
4265 if (map_length
< length
) {
4266 printk(KERN_CRIT
"btrfs: mapping failed logical %llu bio len %llu "
4267 "len %llu\n", (unsigned long long)logical
,
4268 (unsigned long long)length
,
4269 (unsigned long long)map_length
);
4273 bbio
->orig_bio
= first_bio
;
4274 bbio
->private = first_bio
->bi_private
;
4275 bbio
->end_io
= first_bio
->bi_end_io
;
4276 atomic_set(&bbio
->stripes_pending
, bbio
->num_stripes
);
4278 while (dev_nr
< total_devs
) {
4279 if (dev_nr
< total_devs
- 1) {
4280 bio
= bio_clone(first_bio
, GFP_NOFS
);
4281 BUG_ON(!bio
); /* -ENOMEM */
4285 bio
->bi_private
= bbio
;
4286 bio
->bi_private
= merge_stripe_index_into_bio_private(
4287 bio
->bi_private
, (unsigned int)dev_nr
);
4288 bio
->bi_end_io
= btrfs_end_bio
;
4289 bio
->bi_sector
= bbio
->stripes
[dev_nr
].physical
>> 9;
4290 dev
= bbio
->stripes
[dev_nr
].dev
;
4291 if (dev
&& dev
->bdev
&& (rw
!= WRITE
|| dev
->writeable
)) {
4293 struct rcu_string
*name
;
4296 name
= rcu_dereference(dev
->name
);
4297 pr_debug("btrfs_map_bio: rw %d, secor=%llu, dev=%lu "
4298 "(%s id %llu), size=%u\n", rw
,
4299 (u64
)bio
->bi_sector
, (u_long
)dev
->bdev
->bd_dev
,
4300 name
->str
, dev
->devid
, bio
->bi_size
);
4303 bio
->bi_bdev
= dev
->bdev
;
4305 schedule_bio(root
, dev
, rw
, bio
);
4307 btrfsic_submit_bio(rw
, bio
);
4309 bio
->bi_bdev
= root
->fs_info
->fs_devices
->latest_bdev
;
4310 bio
->bi_sector
= logical
>> 9;
4311 bio_endio(bio
, -EIO
);
4318 struct btrfs_device
*btrfs_find_device(struct btrfs_root
*root
, u64 devid
,
4321 struct btrfs_device
*device
;
4322 struct btrfs_fs_devices
*cur_devices
;
4324 cur_devices
= root
->fs_info
->fs_devices
;
4325 while (cur_devices
) {
4327 !memcmp(cur_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
4328 device
= __find_device(&cur_devices
->devices
,
4333 cur_devices
= cur_devices
->seed
;
4338 static struct btrfs_device
*add_missing_dev(struct btrfs_root
*root
,
4339 u64 devid
, u8
*dev_uuid
)
4341 struct btrfs_device
*device
;
4342 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
4344 device
= kzalloc(sizeof(*device
), GFP_NOFS
);
4347 list_add(&device
->dev_list
,
4348 &fs_devices
->devices
);
4349 device
->dev_root
= root
->fs_info
->dev_root
;
4350 device
->devid
= devid
;
4351 device
->work
.func
= pending_bios_fn
;
4352 device
->fs_devices
= fs_devices
;
4353 device
->missing
= 1;
4354 fs_devices
->num_devices
++;
4355 fs_devices
->missing_devices
++;
4356 spin_lock_init(&device
->io_lock
);
4357 INIT_LIST_HEAD(&device
->dev_alloc_list
);
4358 memcpy(device
->uuid
, dev_uuid
, BTRFS_UUID_SIZE
);
4362 static int read_one_chunk(struct btrfs_root
*root
, struct btrfs_key
*key
,
4363 struct extent_buffer
*leaf
,
4364 struct btrfs_chunk
*chunk
)
4366 struct btrfs_mapping_tree
*map_tree
= &root
->fs_info
->mapping_tree
;
4367 struct map_lookup
*map
;
4368 struct extent_map
*em
;
4372 u8 uuid
[BTRFS_UUID_SIZE
];
4377 logical
= key
->offset
;
4378 length
= btrfs_chunk_length(leaf
, chunk
);
4380 read_lock(&map_tree
->map_tree
.lock
);
4381 em
= lookup_extent_mapping(&map_tree
->map_tree
, logical
, 1);
4382 read_unlock(&map_tree
->map_tree
.lock
);
4384 /* already mapped? */
4385 if (em
&& em
->start
<= logical
&& em
->start
+ em
->len
> logical
) {
4386 free_extent_map(em
);
4389 free_extent_map(em
);
4392 em
= alloc_extent_map();
4395 num_stripes
= btrfs_chunk_num_stripes(leaf
, chunk
);
4396 map
= kmalloc(map_lookup_size(num_stripes
), GFP_NOFS
);
4398 free_extent_map(em
);
4402 em
->bdev
= (struct block_device
*)map
;
4403 em
->start
= logical
;
4405 em
->block_start
= 0;
4406 em
->block_len
= em
->len
;
4408 map
->num_stripes
= num_stripes
;
4409 map
->io_width
= btrfs_chunk_io_width(leaf
, chunk
);
4410 map
->io_align
= btrfs_chunk_io_align(leaf
, chunk
);
4411 map
->sector_size
= btrfs_chunk_sector_size(leaf
, chunk
);
4412 map
->stripe_len
= btrfs_chunk_stripe_len(leaf
, chunk
);
4413 map
->type
= btrfs_chunk_type(leaf
, chunk
);
4414 map
->sub_stripes
= btrfs_chunk_sub_stripes(leaf
, chunk
);
4415 for (i
= 0; i
< num_stripes
; i
++) {
4416 map
->stripes
[i
].physical
=
4417 btrfs_stripe_offset_nr(leaf
, chunk
, i
);
4418 devid
= btrfs_stripe_devid_nr(leaf
, chunk
, i
);
4419 read_extent_buffer(leaf
, uuid
, (unsigned long)
4420 btrfs_stripe_dev_uuid_nr(chunk
, i
),
4422 map
->stripes
[i
].dev
= btrfs_find_device(root
, devid
, uuid
,
4424 if (!map
->stripes
[i
].dev
&& !btrfs_test_opt(root
, DEGRADED
)) {
4426 free_extent_map(em
);
4429 if (!map
->stripes
[i
].dev
) {
4430 map
->stripes
[i
].dev
=
4431 add_missing_dev(root
, devid
, uuid
);
4432 if (!map
->stripes
[i
].dev
) {
4434 free_extent_map(em
);
4438 map
->stripes
[i
].dev
->in_fs_metadata
= 1;
4441 write_lock(&map_tree
->map_tree
.lock
);
4442 ret
= add_extent_mapping(&map_tree
->map_tree
, em
);
4443 write_unlock(&map_tree
->map_tree
.lock
);
4444 BUG_ON(ret
); /* Tree corruption */
4445 free_extent_map(em
);
4450 static void fill_device_from_item(struct extent_buffer
*leaf
,
4451 struct btrfs_dev_item
*dev_item
,
4452 struct btrfs_device
*device
)
4456 device
->devid
= btrfs_device_id(leaf
, dev_item
);
4457 device
->disk_total_bytes
= btrfs_device_total_bytes(leaf
, dev_item
);
4458 device
->total_bytes
= device
->disk_total_bytes
;
4459 device
->bytes_used
= btrfs_device_bytes_used(leaf
, dev_item
);
4460 device
->type
= btrfs_device_type(leaf
, dev_item
);
4461 device
->io_align
= btrfs_device_io_align(leaf
, dev_item
);
4462 device
->io_width
= btrfs_device_io_width(leaf
, dev_item
);
4463 device
->sector_size
= btrfs_device_sector_size(leaf
, dev_item
);
4465 ptr
= (unsigned long)btrfs_device_uuid(dev_item
);
4466 read_extent_buffer(leaf
, device
->uuid
, ptr
, BTRFS_UUID_SIZE
);
4469 static int open_seed_devices(struct btrfs_root
*root
, u8
*fsid
)
4471 struct btrfs_fs_devices
*fs_devices
;
4474 BUG_ON(!mutex_is_locked(&uuid_mutex
));
4476 fs_devices
= root
->fs_info
->fs_devices
->seed
;
4477 while (fs_devices
) {
4478 if (!memcmp(fs_devices
->fsid
, fsid
, BTRFS_UUID_SIZE
)) {
4482 fs_devices
= fs_devices
->seed
;
4485 fs_devices
= find_fsid(fsid
);
4491 fs_devices
= clone_fs_devices(fs_devices
);
4492 if (IS_ERR(fs_devices
)) {
4493 ret
= PTR_ERR(fs_devices
);
4497 ret
= __btrfs_open_devices(fs_devices
, FMODE_READ
,
4498 root
->fs_info
->bdev_holder
);
4500 free_fs_devices(fs_devices
);
4504 if (!fs_devices
->seeding
) {
4505 __btrfs_close_devices(fs_devices
);
4506 free_fs_devices(fs_devices
);
4511 fs_devices
->seed
= root
->fs_info
->fs_devices
->seed
;
4512 root
->fs_info
->fs_devices
->seed
= fs_devices
;
4517 static int read_one_dev(struct btrfs_root
*root
,
4518 struct extent_buffer
*leaf
,
4519 struct btrfs_dev_item
*dev_item
)
4521 struct btrfs_device
*device
;
4524 u8 fs_uuid
[BTRFS_UUID_SIZE
];
4525 u8 dev_uuid
[BTRFS_UUID_SIZE
];
4527 devid
= btrfs_device_id(leaf
, dev_item
);
4528 read_extent_buffer(leaf
, dev_uuid
,
4529 (unsigned long)btrfs_device_uuid(dev_item
),
4531 read_extent_buffer(leaf
, fs_uuid
,
4532 (unsigned long)btrfs_device_fsid(dev_item
),
4535 if (memcmp(fs_uuid
, root
->fs_info
->fsid
, BTRFS_UUID_SIZE
)) {
4536 ret
= open_seed_devices(root
, fs_uuid
);
4537 if (ret
&& !btrfs_test_opt(root
, DEGRADED
))
4541 device
= btrfs_find_device(root
, devid
, dev_uuid
, fs_uuid
);
4542 if (!device
|| !device
->bdev
) {
4543 if (!btrfs_test_opt(root
, DEGRADED
))
4547 printk(KERN_WARNING
"warning devid %llu missing\n",
4548 (unsigned long long)devid
);
4549 device
= add_missing_dev(root
, devid
, dev_uuid
);
4552 } else if (!device
->missing
) {
4554 * this happens when a device that was properly setup
4555 * in the device info lists suddenly goes bad.
4556 * device->bdev is NULL, and so we have to set
4557 * device->missing to one here
4559 root
->fs_info
->fs_devices
->missing_devices
++;
4560 device
->missing
= 1;
4564 if (device
->fs_devices
!= root
->fs_info
->fs_devices
) {
4565 BUG_ON(device
->writeable
);
4566 if (device
->generation
!=
4567 btrfs_device_generation(leaf
, dev_item
))
4571 fill_device_from_item(leaf
, dev_item
, device
);
4572 device
->dev_root
= root
->fs_info
->dev_root
;
4573 device
->in_fs_metadata
= 1;
4574 if (device
->writeable
) {
4575 device
->fs_devices
->total_rw_bytes
+= device
->total_bytes
;
4576 spin_lock(&root
->fs_info
->free_chunk_lock
);
4577 root
->fs_info
->free_chunk_space
+= device
->total_bytes
-
4579 spin_unlock(&root
->fs_info
->free_chunk_lock
);
4585 int btrfs_read_sys_array(struct btrfs_root
*root
)
4587 struct btrfs_super_block
*super_copy
= root
->fs_info
->super_copy
;
4588 struct extent_buffer
*sb
;
4589 struct btrfs_disk_key
*disk_key
;
4590 struct btrfs_chunk
*chunk
;
4592 unsigned long sb_ptr
;
4598 struct btrfs_key key
;
4600 sb
= btrfs_find_create_tree_block(root
, BTRFS_SUPER_INFO_OFFSET
,
4601 BTRFS_SUPER_INFO_SIZE
);
4604 btrfs_set_buffer_uptodate(sb
);
4605 btrfs_set_buffer_lockdep_class(root
->root_key
.objectid
, sb
, 0);
4607 * The sb extent buffer is artifical and just used to read the system array.
4608 * btrfs_set_buffer_uptodate() call does not properly mark all it's
4609 * pages up-to-date when the page is larger: extent does not cover the
4610 * whole page and consequently check_page_uptodate does not find all
4611 * the page's extents up-to-date (the hole beyond sb),
4612 * write_extent_buffer then triggers a WARN_ON.
4614 * Regular short extents go through mark_extent_buffer_dirty/writeback cycle,
4615 * but sb spans only this function. Add an explicit SetPageUptodate call
4616 * to silence the warning eg. on PowerPC 64.
4618 if (PAGE_CACHE_SIZE
> BTRFS_SUPER_INFO_SIZE
)
4619 SetPageUptodate(sb
->pages
[0]);
4621 write_extent_buffer(sb
, super_copy
, 0, BTRFS_SUPER_INFO_SIZE
);
4622 array_size
= btrfs_super_sys_array_size(super_copy
);
4624 ptr
= super_copy
->sys_chunk_array
;
4625 sb_ptr
= offsetof(struct btrfs_super_block
, sys_chunk_array
);
4628 while (cur
< array_size
) {
4629 disk_key
= (struct btrfs_disk_key
*)ptr
;
4630 btrfs_disk_key_to_cpu(&key
, disk_key
);
4632 len
= sizeof(*disk_key
); ptr
+= len
;
4636 if (key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
4637 chunk
= (struct btrfs_chunk
*)sb_ptr
;
4638 ret
= read_one_chunk(root
, &key
, sb
, chunk
);
4641 num_stripes
= btrfs_chunk_num_stripes(sb
, chunk
);
4642 len
= btrfs_chunk_item_size(num_stripes
);
4651 free_extent_buffer(sb
);
4655 int btrfs_read_chunk_tree(struct btrfs_root
*root
)
4657 struct btrfs_path
*path
;
4658 struct extent_buffer
*leaf
;
4659 struct btrfs_key key
;
4660 struct btrfs_key found_key
;
4664 root
= root
->fs_info
->chunk_root
;
4666 path
= btrfs_alloc_path();
4670 mutex_lock(&uuid_mutex
);
4673 /* first we search for all of the device items, and then we
4674 * read in all of the chunk items. This way we can create chunk
4675 * mappings that reference all of the devices that are afound
4677 key
.objectid
= BTRFS_DEV_ITEMS_OBJECTID
;
4681 ret
= btrfs_search_slot(NULL
, root
, &key
, path
, 0, 0);
4685 leaf
= path
->nodes
[0];
4686 slot
= path
->slots
[0];
4687 if (slot
>= btrfs_header_nritems(leaf
)) {
4688 ret
= btrfs_next_leaf(root
, path
);
4695 btrfs_item_key_to_cpu(leaf
, &found_key
, slot
);
4696 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
4697 if (found_key
.objectid
!= BTRFS_DEV_ITEMS_OBJECTID
)
4699 if (found_key
.type
== BTRFS_DEV_ITEM_KEY
) {
4700 struct btrfs_dev_item
*dev_item
;
4701 dev_item
= btrfs_item_ptr(leaf
, slot
,
4702 struct btrfs_dev_item
);
4703 ret
= read_one_dev(root
, leaf
, dev_item
);
4707 } else if (found_key
.type
== BTRFS_CHUNK_ITEM_KEY
) {
4708 struct btrfs_chunk
*chunk
;
4709 chunk
= btrfs_item_ptr(leaf
, slot
, struct btrfs_chunk
);
4710 ret
= read_one_chunk(root
, &found_key
, leaf
, chunk
);
4716 if (key
.objectid
== BTRFS_DEV_ITEMS_OBJECTID
) {
4718 btrfs_release_path(path
);
4723 unlock_chunks(root
);
4724 mutex_unlock(&uuid_mutex
);
4726 btrfs_free_path(path
);
4730 static void __btrfs_reset_dev_stats(struct btrfs_device
*dev
)
4734 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
4735 btrfs_dev_stat_reset(dev
, i
);
4738 int btrfs_init_dev_stats(struct btrfs_fs_info
*fs_info
)
4740 struct btrfs_key key
;
4741 struct btrfs_key found_key
;
4742 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
4743 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
4744 struct extent_buffer
*eb
;
4747 struct btrfs_device
*device
;
4748 struct btrfs_path
*path
= NULL
;
4751 path
= btrfs_alloc_path();
4757 mutex_lock(&fs_devices
->device_list_mutex
);
4758 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
4760 struct btrfs_dev_stats_item
*ptr
;
4763 key
.type
= BTRFS_DEV_STATS_KEY
;
4764 key
.offset
= device
->devid
;
4765 ret
= btrfs_search_slot(NULL
, dev_root
, &key
, path
, 0, 0);
4767 __btrfs_reset_dev_stats(device
);
4768 device
->dev_stats_valid
= 1;
4769 btrfs_release_path(path
);
4772 slot
= path
->slots
[0];
4773 eb
= path
->nodes
[0];
4774 btrfs_item_key_to_cpu(eb
, &found_key
, slot
);
4775 item_size
= btrfs_item_size_nr(eb
, slot
);
4777 ptr
= btrfs_item_ptr(eb
, slot
,
4778 struct btrfs_dev_stats_item
);
4780 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
4781 if (item_size
>= (1 + i
) * sizeof(__le64
))
4782 btrfs_dev_stat_set(device
, i
,
4783 btrfs_dev_stats_value(eb
, ptr
, i
));
4785 btrfs_dev_stat_reset(device
, i
);
4788 device
->dev_stats_valid
= 1;
4789 btrfs_dev_stat_print_on_load(device
);
4790 btrfs_release_path(path
);
4792 mutex_unlock(&fs_devices
->device_list_mutex
);
4795 btrfs_free_path(path
);
4796 return ret
< 0 ? ret
: 0;
4799 static int update_dev_stat_item(struct btrfs_trans_handle
*trans
,
4800 struct btrfs_root
*dev_root
,
4801 struct btrfs_device
*device
)
4803 struct btrfs_path
*path
;
4804 struct btrfs_key key
;
4805 struct extent_buffer
*eb
;
4806 struct btrfs_dev_stats_item
*ptr
;
4811 key
.type
= BTRFS_DEV_STATS_KEY
;
4812 key
.offset
= device
->devid
;
4814 path
= btrfs_alloc_path();
4816 ret
= btrfs_search_slot(trans
, dev_root
, &key
, path
, -1, 1);
4818 printk_in_rcu(KERN_WARNING
"btrfs: error %d while searching for dev_stats item for device %s!\n",
4819 ret
, rcu_str_deref(device
->name
));
4824 btrfs_item_size_nr(path
->nodes
[0], path
->slots
[0]) < sizeof(*ptr
)) {
4825 /* need to delete old one and insert a new one */
4826 ret
= btrfs_del_item(trans
, dev_root
, path
);
4828 printk_in_rcu(KERN_WARNING
"btrfs: delete too small dev_stats item for device %s failed %d!\n",
4829 rcu_str_deref(device
->name
), ret
);
4836 /* need to insert a new item */
4837 btrfs_release_path(path
);
4838 ret
= btrfs_insert_empty_item(trans
, dev_root
, path
,
4839 &key
, sizeof(*ptr
));
4841 printk_in_rcu(KERN_WARNING
"btrfs: insert dev_stats item for device %s failed %d!\n",
4842 rcu_str_deref(device
->name
), ret
);
4847 eb
= path
->nodes
[0];
4848 ptr
= btrfs_item_ptr(eb
, path
->slots
[0], struct btrfs_dev_stats_item
);
4849 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
4850 btrfs_set_dev_stats_value(eb
, ptr
, i
,
4851 btrfs_dev_stat_read(device
, i
));
4852 btrfs_mark_buffer_dirty(eb
);
4855 btrfs_free_path(path
);
4860 * called from commit_transaction. Writes all changed device stats to disk.
4862 int btrfs_run_dev_stats(struct btrfs_trans_handle
*trans
,
4863 struct btrfs_fs_info
*fs_info
)
4865 struct btrfs_root
*dev_root
= fs_info
->dev_root
;
4866 struct btrfs_fs_devices
*fs_devices
= fs_info
->fs_devices
;
4867 struct btrfs_device
*device
;
4870 mutex_lock(&fs_devices
->device_list_mutex
);
4871 list_for_each_entry(device
, &fs_devices
->devices
, dev_list
) {
4872 if (!device
->dev_stats_valid
|| !device
->dev_stats_dirty
)
4875 ret
= update_dev_stat_item(trans
, dev_root
, device
);
4877 device
->dev_stats_dirty
= 0;
4879 mutex_unlock(&fs_devices
->device_list_mutex
);
4884 void btrfs_dev_stat_inc_and_print(struct btrfs_device
*dev
, int index
)
4886 btrfs_dev_stat_inc(dev
, index
);
4887 btrfs_dev_stat_print_on_error(dev
);
4890 void btrfs_dev_stat_print_on_error(struct btrfs_device
*dev
)
4892 if (!dev
->dev_stats_valid
)
4894 printk_ratelimited_in_rcu(KERN_ERR
4895 "btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
4896 rcu_str_deref(dev
->name
),
4897 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
4898 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
4899 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
4900 btrfs_dev_stat_read(dev
,
4901 BTRFS_DEV_STAT_CORRUPTION_ERRS
),
4902 btrfs_dev_stat_read(dev
,
4903 BTRFS_DEV_STAT_GENERATION_ERRS
));
4906 static void btrfs_dev_stat_print_on_load(struct btrfs_device
*dev
)
4910 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
4911 if (btrfs_dev_stat_read(dev
, i
) != 0)
4913 if (i
== BTRFS_DEV_STAT_VALUES_MAX
)
4914 return; /* all values == 0, suppress message */
4916 printk_in_rcu(KERN_INFO
"btrfs: bdev %s errs: wr %u, rd %u, flush %u, corrupt %u, gen %u\n",
4917 rcu_str_deref(dev
->name
),
4918 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_WRITE_ERRS
),
4919 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_READ_ERRS
),
4920 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_FLUSH_ERRS
),
4921 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_CORRUPTION_ERRS
),
4922 btrfs_dev_stat_read(dev
, BTRFS_DEV_STAT_GENERATION_ERRS
));
4925 int btrfs_get_dev_stats(struct btrfs_root
*root
,
4926 struct btrfs_ioctl_get_dev_stats
*stats
)
4928 struct btrfs_device
*dev
;
4929 struct btrfs_fs_devices
*fs_devices
= root
->fs_info
->fs_devices
;
4932 mutex_lock(&fs_devices
->device_list_mutex
);
4933 dev
= btrfs_find_device(root
, stats
->devid
, NULL
, NULL
);
4934 mutex_unlock(&fs_devices
->device_list_mutex
);
4938 "btrfs: get dev_stats failed, device not found\n");
4940 } else if (!dev
->dev_stats_valid
) {
4942 "btrfs: get dev_stats failed, not yet valid\n");
4944 } else if (stats
->flags
& BTRFS_DEV_STATS_RESET
) {
4945 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++) {
4946 if (stats
->nr_items
> i
)
4948 btrfs_dev_stat_read_and_reset(dev
, i
);
4950 btrfs_dev_stat_reset(dev
, i
);
4953 for (i
= 0; i
< BTRFS_DEV_STAT_VALUES_MAX
; i
++)
4954 if (stats
->nr_items
> i
)
4955 stats
->values
[i
] = btrfs_dev_stat_read(dev
, i
);
4957 if (stats
->nr_items
> BTRFS_DEV_STAT_VALUES_MAX
)
4958 stats
->nr_items
= BTRFS_DEV_STAT_VALUES_MAX
;